| blob | 97f6ea12c3860ce26d1b818a3f6ca73ce08c2710 |
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- S E M _ R E S --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
10 -- --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
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 ------------------------------------------------------------------------------
84 -----------------------
85 -- Local Subprograms --
86 -----------------------
88 -- Second pass (top-down) type checking and overload resolution procedures
89 -- Typ is the type required by context. These procedures propagate the type
90 -- information recursively to the descendants of N. If the node is not
91 -- overloaded, its Etype is established in the first pass. If overloaded,
92 -- the Resolve routines set the correct type. For arith. operators, the
93 -- Etype is the base type of the context.
95 -- Note that Resolve_Attribute is separated off in Sem_Attr
98 -- Enforce the restrictions on the use of discriminants when constraining
99 -- a component of a discriminated type (record or concurrent type).
102 -- Given a node for an operator associated with type T, check that
103 -- the operator is visible. Operators all of whose operands are
104 -- universal must be checked for visibility during resolution
105 -- because their type is not determinable based on their operands.
107 procedure Check_Fully_Declared_Prefix
110 -- Check that the type of the prefix of a dereference is not incomplete
113 -- Given a call node, N, which is known to occur immediately within the
114 -- subprogram being called, determines whether it is a detectable case of
115 -- an infinite recursion, and if so, outputs appropriate messages. Returns
116 -- True if an infinite recursion is detected, and False otherwise.
119 -- If the type of the object being initialized uses the secondary stack
120 -- directly or indirectly, create a transient scope for the call to the
121 -- init proc. This is because we do not create transient scopes for the
122 -- initialization of individual components within the init proc itself.
123 -- Could be optimized away perhaps?
126 -- N is the node for a logical operator. If the operator is predefined, and
127 -- the root type of the operands is Standard.Boolean, then a check is made
128 -- for restriction No_Direct_Boolean_Operators. This procedure also handles
129 -- the style check for Style_Check_Boolean_And_Or.
132 -- N is either an indexed component or a selected component. This function
133 -- returns true if the prefix refers to an object that has an address
134 -- clause (the case in which we may want to issue a warning).
137 -- Determine whether E is an access type declared by an access declaration,
138 -- and not an (anonymous) allocator type.
141 -- Utility to check whether the entity for an operator is a predefined
142 -- operator, in which case the expression is left as an operator in the
143 -- tree (else it is rewritten into a call). An instance of an intrinsic
144 -- conversion operation may be given an operator name, but is not treated
145 -- like an operator. Note that an operator that is an imported back-end
146 -- builtin has convention Intrinsic, but is expected to be rewritten into
147 -- a call, so such an operator is not treated as predefined by this
148 -- predicate.
151 -- If a default expression in entry call N depends on the discriminants
152 -- of the task, it must be replaced with a reference to the discriminant
153 -- of the task being called.
155 procedure Resolve_Op_Concat_Arg
160 -- Internal procedure for Resolve_Op_Concat to resolve one operand of
161 -- concatenation operator. The operand is either of the array type or of
162 -- the component type. If the operand is an aggregate, and the component
163 -- type is composite, this is ambiguous if component type has aggregates.
166 -- Does the first part of the work of Resolve_Op_Concat
169 -- Does the "rest" of the work of Resolve_Op_Concat, after the left operand
170 -- has been resolved. See Resolve_Op_Concat for details.
208 function Operator_Kind
211 -- Utility to map the name of an operator into the corresponding Node. Used
212 -- by other node rewriting procedures.
215 -- Resolve actuals of call, and add default expressions for missing ones.
216 -- N is the Node_Id for the subprogram call, and Nam is the entity of the
217 -- called subprogram.
220 -- Called from Resolve_Call, when the prefix denotes an entry or element
221 -- of entry family. Actuals are resolved as for subprograms, and the node
222 -- is rebuilt as an entry call. Also called for protected operations. Typ
223 -- is the context type, which is used when the operation is a protected
224 -- function with no arguments, and the return value is indexed.
227 -- A call to a user-defined intrinsic operator is rewritten as a call to
228 -- the corresponding predefined operator, with suitable conversions. Note
229 -- that this applies only for intrinsic operators that denote predefined
230 -- operators, not ones that are intrinsic imports of back-end builtins.
233 -- Ditto, for arithmetic unary operators
236 -- If an operator node resolves to a call to a user-defined operator,
237 -- rewrite the node as a function call.
239 procedure Make_Call_Into_Operator
243 -- Inverse transformation: if an operator is given in functional notation,
244 -- then after resolving the node, transform into an operator node, so
245 -- that operands are resolved properly. Recall that predefined operators
246 -- do not have a full signature and special resolution rules apply.
248 procedure Rewrite_Renamed_Operator
252 -- An operator can rename another, e.g. in an instantiation. In that
253 -- case, the proper operator node must be constructed and resolved.
256 -- The String_Literal_Subtype is built for all strings that are not
257 -- operands of a static concatenation operation. If the argument is
258 -- not a N_String_Literal node, then the call has no effect.
261 -- Build subtype of array type, with the range specified by the slice
264 -- Called after N has been resolved and evaluated, but before range checks
265 -- have been applied. Currently simplifies a combination of floating-point
266 -- to integer conversion and Rounding or Truncation attribute.
269 -- A universal_fixed expression in an universal context is unambiguous if
270 -- there is only one applicable fixed point type. Determining whether there
271 -- is only one requires a search over all visible entities, and happens
272 -- only in very pathological cases (see 6115-006).
274 -------------------------
275 -- Ambiguous_Character --
276 -------------------------
281 begin
285 -- First the ones in Standard
290 -- Include Wide_Wide_Character in Ada 2005 mode
296 -- Now any other types that match
306 -------------------------
307 -- Analyze_And_Resolve --
308 -------------------------
311 begin
317 begin
322 -- Versions with check(s) suppressed
324 procedure Analyze_And_Resolve
328 is
331 begin
333 declare
335 begin
341 else
342 declare
344 begin
352 and then Scope_Is_Transient
353 then
354 -- This can only happen if a transient scope was created for an inner
355 -- expression, which will be removed upon completion of the analysis
356 -- of an enclosing construct. The transient scope must have the
357 -- suppress status of the enclosing environment, not of this Analyze
358 -- call.
361 Scope_Suppress;
365 procedure Analyze_And_Resolve
368 is
371 begin
373 declare
375 begin
381 else
382 declare
384 begin
393 Scope_Suppress;
397 ----------------------------
398 -- Check_Discriminant_Use --
399 ----------------------------
407 begin
408 -- Any use in a spec-expression is legal
415 -- Discriminant cannot be used to constrain a scalar type
422 then
427 -- The following check catches the unusual case where a
428 -- discriminant appears within an index constraint that is part of
429 -- a larger expression within a constraint on a component, e.g. "C
430 -- : Int range 1 .. F (new A(1 .. D))". For now we only check case
431 -- of record components, and note that a similar check should also
432 -- apply in the case of discriminant constraints below. ???
434 -- Note that the check for N_Subtype_Declaration below is to
435 -- detect the valid use of discriminants in the constraints of a
436 -- subtype declaration when this subtype declaration appears
437 -- inside the scope of a record type (which is syntactically
438 -- illegal, but which may be created as part of derived type
439 -- processing for records). See Sem_Ch3.Build_Derived_Record_Type
440 -- for more info.
444 and then not
446 and then
448 N_Subtype_Declaration)
450 then
451 Error_Msg_N
456 -- Detect a common error:
458 -- type R (D : Positive := 100) is record
459 -- Name : String (1 .. D);
460 -- end record;
462 -- The default value causes an object of type R to be allocated
463 -- with room for Positive'Last characters. The RM does not mandate
464 -- the allocation of the maximum size, but that is what GNAT does
465 -- so we should warn the programmer that there is a problem.
474 -- Return True if type T has a large enough range that any
475 -- array whose index type covered the whole range of the type
476 -- would likely raise Storage_Error.
478 ------------------------
479 -- Large_Storage_Type --
480 ------------------------
483 begin
484 -- The type is considered large if its bounds are known at
485 -- compile time and if it requires at least as many bits as
486 -- a Positive to store the possible values.
490 and then
495 -- Start of processing for Check_Large
497 begin
498 -- Check that the Disc has a large range
504 -- If the enclosing type is limited, we allocate only the
505 -- default value, not the maximum, and there is no need for
506 -- a warning.
512 -- Check that it is the high bound
516 then
520 -- Check the array allows a large range at this bound. First
521 -- find the array
535 -- Next, find the dimension
543 loop
552 -- Now, check the dimension has a large range
558 -- Warn about the danger
560 Error_Msg_N
570 -- Legal case is in index or discriminant constraint
573 N_Discriminant_Association)
574 then
576 Error_Msg_N
581 then
582 Error_Msg_N
588 -- Otherwise, context is an expression. It should not be within (i.e. a
589 -- subexpression of) a constraint for a component.
591 else
595 N_Subtype_Indication,
596 N_Entry_Declaration)
597 loop
603 -- If the discriminant is used in an expression that is a bound of a
604 -- scalar type, an Itype is created and the bounds are attached to
605 -- its range, not to the original subtype indication. Such use is of
606 -- course a double fault.
610 N_Derived_Type_Definition)
613 -- The constraint itself may be given by a subtype indication,
614 -- rather than by a more common discrete range.
617 and then
621 then
622 Error_Msg_N
628 --------------------------------
629 -- Check_For_Visible_Operator --
630 --------------------------------
633 begin
635 Error_Msg_NE -- CODEFIX
637 Error_Msg_N -- CODEFIX
642 ----------------------------------
643 -- Check_Fully_Declared_Prefix --
644 ----------------------------------
646 procedure Check_Fully_Declared_Prefix
649 is
650 begin
651 -- Check that the designated type of the prefix of a dereference is
652 -- not an incomplete type. This cannot be done unconditionally, because
653 -- dereferences of private types are legal in default expressions. This
654 -- case is taken care of in Check_Fully_Declared, called below. There
655 -- are also 2005 cases where it is legal for the prefix to be unfrozen.
657 -- This consideration also applies to similar checks for allocators,
658 -- qualified expressions, and type conversions.
660 -- An additional exception concerns other per-object expressions that
661 -- are not directly related to component declarations, in particular
662 -- representation pragmas for tasks. These will be per-object
663 -- expressions if they depend on discriminants or some global entity.
664 -- If the task has access discriminants, the designated type may be
665 -- incomplete at the point the expression is resolved. This resolution
666 -- takes place within the body of the initialization procedure, where
667 -- the discriminant is replaced by its discriminal.
671 then
674 -- Ada 2005 (AI-326): Tagged incomplete types allowed. The wrong usages
675 -- are handled by Analyze_Access_Attribute, Analyze_Assignment,
676 -- Analyze_Object_Renaming, and Freeze_Entity.
682 E_Incomplete_Type
684 then
686 else
691 ------------------------------
692 -- Check_Infinite_Recursion --
693 ------------------------------
700 -- Check whether list of actuals is identical to list of formals of
701 -- called function (which is also the enclosing scope).
703 ------------------------
704 -- Same_Argument_List --
705 ------------------------
712 begin
715 else
724 then
735 -- Start of processing for Check_Infinite_Recursion
737 begin
738 -- Special case, if this is a procedure call and is a call to the
739 -- current procedure with the same argument list, then this is for
740 -- sure an infinite recursion and we insert a call to raise SE.
744 and then Same_Argument_List
745 then
746 declare
748 begin
752 then
764 -- If not that special case, search up tree, quitting if we reach a
765 -- construct (e.g. a conditional) that tells us that this is not a
766 -- case for an infinite recursion warning.
769 loop
772 -- If no parent, then we were not inside a subprogram, this can for
773 -- example happen when processing certain pragmas in a spec. Just
774 -- return False in this case.
780 -- Done if we get to subprogram body, this is definitely an infinite
781 -- recursion case if we did not find anything to stop us.
785 -- If appearing in conditional, result is false
788 N_And_Then,
789 N_Case_Expression,
790 N_Case_Statement,
791 N_If_Expression,
792 N_If_Statement)
793 then
798 then
799 -- If the call is the expression of a return statement and the
800 -- actuals are identical to the formals, it's worth a warning.
801 -- However, we skip this if there is an immediately preceding
802 -- raise statement, since the call is never executed.
804 -- Furthermore, this corresponds to a common idiom:
806 -- function F (L : Thing) return Boolean is
807 -- begin
808 -- raise Program_Error;
809 -- return F (L);
810 -- end F;
812 -- for generating a stub function
815 and then Same_Argument_List
816 then
819 -- OK, return statement is in a statement list, look for raise
821 declare
824 begin
825 -- Skip past N_Freeze_Entity nodes generated by expansion
830 loop
834 -- If no raise statement, give warning. We look at the
835 -- original node, because in the case of "raise ... with
836 -- ...", the node has been transformed into a call.
839 and then
847 else
859 -------------------------------
860 -- Check_Initialization_Call --
861 -------------------------------
867 -- Check whether the creation of an object of the type will involve
868 -- use of the secondary stack. If T is a record type, this is true
869 -- if the expression for some component uses the secondary stack, e.g.
870 -- through a call to a function that returns an unconstrained value.
871 -- False if T is controlled, because cleanups occur elsewhere.
873 -------------
874 -- Uses_SS --
875 -------------
882 begin
883 -- Normally we want to use the underlying type, but if it's not set
884 -- then continue with T.
901 then
902 -- The expression for a dynamic component may be rewritten
903 -- as a dereference, so retrieve original node.
907 -- Return True if the expression is a call to a function
908 -- (including an attribute function such as Image, or a
909 -- user-defined operator) with a result that requires a
910 -- transient scope.
917 then
930 else
935 -- Start of processing for Check_Initialization_Call
937 begin
938 -- Establish a transient scope if the type needs it
945 ---------------------------------------
946 -- Check_No_Direct_Boolean_Operators --
947 ---------------------------------------
950 begin
953 then
954 -- Restriction only applies to original source code
961 -- Do style check (but skip if in instance, error is on template)
970 ------------------------------
971 -- Check_Parameterless_Call --
972 ------------------------------
978 -- If the prefix is of an access_to_subprogram type, the node must be
979 -- rewritten as a call. Ditto if the prefix is overloaded and all its
980 -- interpretations are access to subprograms.
982 ---------------------------
983 -- Prefix_Is_Access_Subp --
984 ---------------------------
990 begin
991 -- If the context is an attribute reference that can apply to
992 -- functions, this is never a parameterless call (RM 4.1.4(6)).
996 Name_Code_Address,
997 Name_Access)
998 then
1003 return
1006 else
1011 then
1022 -- Start of processing for Check_Parameterless_Call
1024 begin
1025 -- Defend against junk stuff if errors already detected
1032 then
1039 -- If the context expects a value, and the name is a procedure, this is
1040 -- most likely a missing 'Access. Don't try to resolve the parameterless
1041 -- call, error will be caught when the outer call is analyzed.
1046 and then
1048 N_Function_Call,
1049 N_Procedure_Call_Statement)
1050 then
1054 -- Rewrite as call if overloadable entity that is (or could be, in the
1055 -- overloaded case) a function call. If we know for sure that the entity
1056 -- is an enumeration literal, we do not rewrite it.
1058 -- If the entity is the name of an operator, it cannot be a call because
1059 -- operators cannot have default parameters. In this case, this must be
1060 -- a string whose contents coincide with an operator name. Set the kind
1061 -- of the node appropriately.
1069 -- Rewrite as call if it is an explicit dereference of an expression of
1070 -- a subprogram access type, and the subprogram type is not that of a
1071 -- procedure or entry.
1073 or else
1076 -- Rewrite as call if it is a selected component which is a function,
1077 -- this is the case of a call to a protected function (which may be
1078 -- overloaded with other protected operations).
1080 or else
1083 or else
1085 E_Procedure)
1088 -- If one of the above three conditions is met, rewrite as call. Apply
1089 -- the rewriting only once.
1091 then
1094 then
1096 -- This may be a prefixed call that was not fully analyzed, e.g.
1097 -- an actual in an instance.
1102 then
1110 -- The node is the name of the parameterless call. Preserve its
1111 -- descendants, which may be complex expressions.
1115 -- If overloaded, overload set belongs to new copy
1119 -- Change node to parameterless function call (note that the
1120 -- Parameter_Associations associations field is left set to Empty,
1121 -- its normal default value since there are no parameters)
1139 --------------------------------
1140 -- Is_Atomic_Ref_With_Address --
1141 --------------------------------
1146 begin
1150 else
1151 declare
1154 begin
1162 -----------------------------
1163 -- Is_Definite_Access_Type --
1164 -----------------------------
1168 begin
1174 ----------------------
1175 -- Is_Predefined_Op --
1176 ----------------------
1179 begin
1180 -- Predefined operators are intrinsic subprograms
1186 -- A call to a back-end builtin is never a predefined operator
1197 -----------------------------
1198 -- Make_Call_Into_Operator --
1199 -----------------------------
1201 procedure Make_Call_Into_Operator
1205 is
1220 -- If the operand is not universal, and the operator is given by an
1221 -- expanded name, verify that the operand has an interpretation with a
1222 -- type defined in the given scope of the operator.
1225 -- Find a type of the given class in package Pack that contains the
1226 -- operator.
1228 ---------------------------
1229 -- Operand_Type_In_Scope --
1230 ---------------------------
1237 begin
1241 else
1255 ---------------
1256 -- Type_In_P --
1257 ---------------
1263 -- Verify that node is not part of the type declaration for the
1264 -- candidate type, which would otherwise be invisible.
1266 -------------
1267 -- In_Decl --
1268 -------------
1274 begin
1283 else
1286 loop
1289 else
1298 -- Start of processing for Type_In_P
1300 begin
1301 -- If the context type is declared in the prefix package, this is the
1302 -- desired base type.
1307 else
1311 and then not In_Decl
1312 then
1323 -- Start of processing for Make_Call_Into_Operator
1325 begin
1328 -- Binary operator
1338 -- Unary operator
1340 else
1346 -- If the operator is denoted by an expanded name, and the prefix is
1347 -- not Standard, but the operator is a predefined one whose scope is
1348 -- Standard, then this is an implicit_operator, inserted as an
1349 -- interpretation by the procedure of the same name. This procedure
1350 -- overestimates the presence of implicit operators, because it does
1351 -- not examine the type of the operands. Verify now that the operand
1352 -- type appears in the given scope. If right operand is universal,
1353 -- check the other operand. In the case of concatenation, either
1354 -- argument can be the component type, so check the type of the result.
1355 -- If both arguments are literals, look for a type of the right kind
1356 -- defined in the given scope. This elaborate nonsense is brought to
1357 -- you courtesy of b33302a. The type itself must be frozen, so we must
1358 -- find the type of the proper class in the given scope.
1360 -- A final wrinkle is the multiplication operator for fixed point types,
1361 -- which is defined in Standard only, and not in the scope of the
1362 -- fixed point type itself.
1367 -- If this is a package renaming, get renamed entity, which will be
1368 -- the scope of the operands if operaton is type-correct.
1374 -- If the entity being called is defined in the given package, it is
1375 -- a renaming of a predefined operator, and known to be legal.
1379 then
1382 -- Visibility does not need to be checked in an instance: if the
1383 -- operator was not visible in the generic it has been diagnosed
1384 -- already, else there is an implicit copy of it in the instance.
1392 then
1397 -- Ada 2005 AI-420: Predefined equality on Universal_Access is
1398 -- available.
1403 then
1406 else
1415 and then Is_Binary
1417 then
1423 -- Verify that the scope contains a type that corresponds to
1424 -- the given literal. Optimize the case where Pack is Standard.
1446 else
1455 else
1464 then
1467 -- If the type is defined elsewhere, and the operator is not
1468 -- defined in the given scope (by a renaming declaration, e.g.)
1469 -- then this is an error as well. If an extension of System is
1470 -- present, and the type may be defined there, Pack must be
1471 -- System itself.
1478 then
1481 else
1487 then
1494 Error_Msg_NE
1499 -- Detect a mismatch between the context type and the result type
1500 -- in the named package, which is otherwise not detected if the
1501 -- operands are universal. Check is only needed if source entity is
1502 -- an operator, not a function that renames an operator.
1509 and then not In_Instance
1510 then
1513 then
1514 -- Already checked above
1518 -- Operator may be defined in an extension of System
1522 then
1525 else
1526 -- Could we use Wrong_Type here??? (this would require setting
1527 -- Etype (N) to the actual type found where Typ was expected).
1538 else
1542 -- If this is a call to a function that renames a predefined equality,
1543 -- the renaming declaration provides a type that must be used to
1544 -- resolve the operands. This must be done now because resolution of
1545 -- the equality node will not resolve any remaining ambiguity, and it
1546 -- assumes that the first operand is not overloaded.
1551 then
1559 -- Do rewrite setting Comes_From_Source on the result if the original
1560 -- call came from source. Although it is not strictly the case that the
1561 -- operator as such comes from the source, logically it corresponds
1562 -- exactly to the function call in the source, so it should be marked
1563 -- this way (e.g. to make sure that validity checks work fine).
1565 declare
1567 begin
1572 -- If this is an arithmetic operator and the result type is private,
1573 -- the operands and the result must be wrapped in conversion to
1574 -- expose the underlying numeric type and expand the proper checks,
1575 -- e.g. on division.
1579 when N_Op_Add | N_Op_Subtract | N_Op_Multiply | N_Op_Divide |
1580 N_Op_Expon | N_Op_Mod | N_Op_Rem =>
1589 else
1593 -- If in ASIS_Mode, propagate operand types to original actuals of
1594 -- function call, which would otherwise not be fully resolved. If
1595 -- the call has already been constant-folded, nothing to do. We
1596 -- relocate the operand nodes rather than copy them, to preserve
1597 -- original_node pointers, given that the operands themselves may
1598 -- have been rewritten. If the call was itself a rewriting of an
1599 -- operator node, nothing to do.
1601 if ASIS_Mode
1604 then
1610 else
1619 -------------------
1620 -- Operator_Kind --
1621 -------------------
1623 function Operator_Kind
1626 is
1629 begin
1630 -- Use CASE statement or array???
1667 else
1671 -- Unary operators
1673 else
1682 else
1690 ----------------------------
1691 -- Preanalyze_And_Resolve --
1692 ----------------------------
1697 begin
1701 -- Normally, we suppress all checks for this preanalysis. There is no
1702 -- point in processing them now, since they will be applied properly
1703 -- and in the proper location when the default expressions reanalyzed
1704 -- and reexpanded later on. We will also have more information at that
1705 -- point for possible suppression of individual checks.
1707 -- However, in SPARK mode, most expansion is suppressed, and this
1708 -- later reanalysis and reexpansion may not occur. SPARK mode does
1709 -- require the setting of checking flags for proof purposes, so we
1710 -- do the SPARK preanalysis without suppressing checks.
1712 -- This special handling for SPARK mode is required for example in the
1713 -- case of Ada 2012 constructs such as quantified expressions, which are
1714 -- expanded in two separate steps.
1718 else
1722 Expander_Mode_Restore;
1726 -- Version without context type
1731 begin
1738 Expander_Mode_Restore;
1742 ----------------------------------
1743 -- Replace_Actual_Discriminants --
1744 ----------------------------------
1751 -- Comment needed???
1753 -------------------
1754 -- Process_Discr --
1755 -------------------
1760 begin
1766 then
1782 -- Start of processing for Replace_Actual_Discriminants
1784 begin
1798 else
1803 -------------
1804 -- Resolve --
1805 -------------
1821 -- Determine whether a node comes from a predefined library unit or
1822 -- Standard.
1825 -- Try and fix up a literal so that it matches its expected type. New
1826 -- literals are manufactured if necessary to avoid cascaded errors.
1829 -- Additional diagnostics when an ambiguous call has an ambiguous
1830 -- argument (typically a controlling actual).
1833 -- Called when attempt at resolving current expression fails
1835 ------------------------------------
1836 -- Comes_From_Predefined_Lib_Unit --
1837 -------------------------------------
1840 begin
1841 return
1843 or else Is_Predefined_File_Name
1847 --------------------
1848 -- Patch_Up_Value --
1849 --------------------
1852 begin
1869 then
1874 Char_Literal_Value =>
1890 -------------------------------
1891 -- Report_Ambiguous_Argument --
1892 -------------------------------
1899 begin
1903 then
1906 -- Could use comments on what is going on here???
1914 else
1923 -----------------------
1924 -- Resolution_Failed --
1925 -----------------------
1928 begin
1934 -- The caller will return without calling the expander, so we need
1935 -- to set the analyzed flag. Note that it is fine to set Analyzed
1936 -- to True even if we are in the middle of a shallow analysis,
1937 -- (see the spec of sem for more details) since this is an error
1938 -- situation anyway, and there is no point in repeating the
1939 -- analysis later (indeed it won't work to repeat it later, since
1940 -- we haven't got a clear resolution of which entity is being
1941 -- referenced.)
1947 -- Start of processing for Resolve
1949 begin
1954 -- Access attribute on remote subprogram cannot be used for a non-remote
1955 -- access-to-subprogram type.
1959 Name_Unrestricted_Access,
1960 Name_Unchecked_Access)
1966 then
1967 Error_Msg_N
1973 -- If the context is a Remote_Access_To_Subprogram, access attributes
1974 -- must be resolved with the corresponding fat pointer. There is no need
1975 -- to check for the attribute name since the return type of an
1976 -- attribute is never a remote type.
1981 then
1982 declare
1990 begin
1991 -- Check that Typ is a remote access-to-subprogram type
1995 -- Prefix (N) must statically denote a remote subprogram
1996 -- declared in a package specification.
2000 Attr = Attribute_Unrestricted_Access
2001 then
2016 or else
2018 then
2020 Error_Msg_N
2022 N);
2025 -- If we are generating code in distributed mode, perform
2026 -- semantic checks against corresponding remote entities.
2028 if Expander_Active
2030 then
2031 Check_Subtype_Conformant
2033 Old_Id => Designated_Type
2059 then
2064 -- Return if already analyzed
2071 -- Any case of Any_Type as the Etype value means that we had a
2072 -- previous error.
2081 -- The resolution of an Expression_With_Actions is determined by
2082 -- its Expression.
2090 -- If not overloaded, then we know the type, and all that needs doing
2091 -- is to check that this type is compatible with the context.
2097 -- In the overloaded case, we must select the interpretation that
2098 -- is compatible with the context (i.e. the type passed to Resolve)
2100 else
2101 -- Loop through possible interpretations
2111 -- We are only interested in interpretations that are compatible
2112 -- with the expected type, any other interpretations are ignored.
2117 Write_Eol;
2120 else
2121 -- Skip the current interpretation if it is disabled by an
2122 -- abstract operator. This action is performed only when the
2123 -- type against which we are resolving is the same as the
2124 -- type of the interpretation.
2131 then
2139 -- First matching interpretation
2147 -- Matching interpretation that is not the first, maybe an
2148 -- error, but there are some cases where preference rules are
2149 -- used to choose between the two possibilities. These and
2150 -- some more obscure cases are handled in Disambiguate.
2152 else
2153 -- If the current statement is part of a predefined library
2154 -- unit, then all interpretations which come from user level
2155 -- packages should not be considered. Check previous and
2156 -- current one.
2164 -- Previous interpretation must be discarded
2174 -- Otherwise apply further disambiguation steps
2179 -- Disambiguation has succeeded. Skip the remaining
2180 -- interpretations.
2190 else
2191 -- Before we issue an ambiguity complaint, check for
2192 -- the case of a subprogram call where at least one
2193 -- of the arguments is Any_Type, and if so, suppress
2194 -- the message, since it is a cascaded error.
2197 declare
2201 begin
2213 Write_Eol;
2226 then
2231 then
2235 -- Not that special case, so issue message using the
2236 -- flag Ambiguous to control printing of the header
2237 -- message only at the start of an ambiguous set.
2242 then
2243 Error_Msg_N
2246 else
2247 Error_Msg_NE -- CODEFIX
2255 Error_Msg_N
2257 else
2258 Error_Msg_N -- CODEFIX
2264 then
2265 Report_Ambiguous_Argument;
2271 -- By default, the error message refers to the candidate
2272 -- interpretation. But if it is a predefined operator, it
2273 -- is implicitly declared at the declaration of the type
2274 -- of the operand. Recover the sloc of that declaration
2275 -- for the error message.
2281 Standard_Standard
2282 then
2287 then
2295 Standard_Standard
2296 then
2301 then
2305 -- If this is an indirect call, use the subprogram_type
2306 -- in the message, to have a meaningful location. Also
2307 -- indicate if this is an inherited operation, created
2308 -- by a type declaration.
2313 then
2315 Error_Msg_Sloc :=
2317 else
2324 then
2325 -- Special-case the message for universal_fixed
2326 -- operators, which are not declared with the type
2327 -- of the operand, but appear forever in Standard.
2331 then
2332 Error_Msg_N
2335 else
2336 Error_Msg_N
2340 elsif
2342 then
2343 Error_Msg_N
2345 else
2346 Error_Msg_N -- CODEFIX
2353 -- We have a matching interpretation, Expr_Type is the type
2354 -- from this interpretation, and Seen is the entity.
2356 -- For an operator, just set the entity name. The type will be
2357 -- set by the specific operator resolution routine.
2372 -- AI05-0139-2: Expression is overloaded because type has
2373 -- implicit dereference. If type matches context, no implicit
2374 -- dereference is involved.
2385 then
2386 -- If the node is a general indexing, the dereference is
2387 -- is inserted when resolving the rewritten form, else
2388 -- insert it now.
2392 then
2396 -- For an explicit dereference, attribute reference, range,
2397 -- short-circuit form (which is not an operator node), or call
2398 -- with a name that is an explicit dereference, there is
2399 -- nothing to be done at this point.
2402 N_Attribute_Reference,
2403 N_And_Then,
2404 N_Indexed_Component,
2405 N_Or_Else,
2406 N_Range,
2407 N_Selected_Component,
2408 N_Slice)
2410 then
2413 -- For procedure or function calls, set the type of the name,
2414 -- and also the entity pointer for the prefix.
2418 then
2425 then
2430 -- For all other cases, just set the type of the Name
2432 else
2440 -- Move to next interpretation
2448 -- At this stage Found indicates whether or not an acceptable
2449 -- interpretation exists. If not, then we have an error, except that if
2450 -- the context is Any_Type as a result of some other error, then we
2451 -- suppress the error report.
2456 -- If type we are looking for is Void, then this is the procedure
2457 -- call case, and the error is simply that what we gave is not a
2458 -- procedure name (we think of procedure calls as expressions with
2459 -- types internally, but the user doesn't think of them this way).
2463 -- Special case message if function used as a procedure
2468 then
2469 Error_Msg_NE
2473 -- Otherwise give general message (not clear what cases this
2474 -- covers, but no harm in providing for them).
2476 else
2482 -- Otherwise we do have a subexpression with the wrong type
2484 -- Check for the case of an allocator which uses an access type
2485 -- instead of the designated type. This is a common error and we
2486 -- specialize the message, posting an error on the operand of the
2487 -- allocator, complaining that we expected the designated type of
2488 -- the allocator.
2494 then
2498 -- Check for view mismatch on Null in instances, for which the
2499 -- view-swapping mechanism has no identifier.
2505 then
2510 -- Check for an aggregate. Sometimes we can get bogus aggregates
2511 -- from misuse of parentheses, and we are about to complain about
2512 -- the aggregate without even looking inside it.
2514 -- Instead, if we have an aggregate of type Any_Composite, then
2515 -- analyze and resolve the component fields, and then only issue
2516 -- another message if we get no errors doing this (otherwise
2517 -- assume that the errors in the aggregate caused the problem).
2521 then
2522 -- Disable expansion in any case. If there is a type mismatch
2523 -- it may be fatal to try to expand the aggregate. The flag
2524 -- would otherwise be set to false when the error is posted.
2528 declare
2530 -- Check one aggregate, and set Found to True if we have a
2531 -- definite error in any of its elements
2534 -- Check one element of aggregate and set Found to True if
2535 -- we definitely have an error in the element.
2537 ----------------
2538 -- Check_Aggr --
2539 ----------------
2544 begin
2557 -- If this is a default-initialized component, then
2558 -- there is nothing to check. The box will be
2559 -- replaced by the appropriate call during late
2560 -- expansion.
2571 ----------------
2572 -- Check_Elmt --
2573 ----------------
2576 begin
2577 -- If we have a nested aggregate, go inside it (to
2578 -- attempt a naked analyze-resolve of the aggregate can
2579 -- cause undesirable cascaded errors). Do not resolve
2580 -- expression if it needs a type from context, as for
2581 -- integer * fixed expression.
2586 else
2591 then
2601 begin
2606 -- Looks like we have a type error, but check for special case
2607 -- of Address wanted, integer found, with the configuration pragma
2608 -- Allow_Integer_Address active. If we have this case, introduce
2609 -- an unchecked conversion to allow the integer expression to be
2610 -- treated as an Address. The reverse case of integer wanted,
2611 -- Address found, is treated in an analogous manner.
2619 -- That special Allow_Integer_Address check did not appply, so we
2620 -- have a real type error. If an error message was issued already,
2621 -- Found got reset to True, so if it's still False, issue standard
2622 -- Wrong_Type message.
2626 declare
2629 begin
2635 -- Protected operation: retrieve operation name
2639 else
2644 Error_Msg_NE
2650 declare
2654 begin
2661 Error_Msg_NE
2667 else
2671 else
2677 Resolution_Failed;
2680 -- Test if we have more than one interpretation for the context
2683 Resolution_Failed;
2686 -- Only one intepretation
2688 else
2689 -- In Ada 2005, if we have something like "X : T := 2 + 2;", where
2690 -- the "+" on T is abstract, and the operands are of universal type,
2691 -- the above code will have (incorrectly) resolved the "+" to the
2692 -- universal one in Standard. Therefore check for this case and give
2693 -- an error. We can't do this earlier, because it would cause legal
2694 -- cases to get errors (when some other type has an abstract "+").
2700 then
2705 then
2706 Error_Msg_NE
2715 -- Here we have an acceptable interpretation for the context
2717 -- Propagate type information and normalize tree for various
2718 -- predefined operations. If the context only imposes a class of
2719 -- types, rather than a specific type, propagate the actual type
2720 -- downward.
2726 Typ = Any_Discrete
2727 then
2730 -- Any_Fixed is legal in a real context only if a specific fixed-
2731 -- point type is imposed. If Norman Cohen can be confused by this,
2732 -- it deserves a separate message.
2736 then
2743 -- A user-defined operator is transformed into a function call at
2744 -- this point, so that further processing knows that operators are
2745 -- really operators (i.e. are predefined operators). User-defined
2746 -- operators that are intrinsic are just renamings of the predefined
2747 -- ones, and need not be turned into calls either, but if they rename
2748 -- a different operator, we must transform the node accordingly.
2749 -- Instantiations of Unchecked_Conversion are intrinsic but are
2750 -- treated as functions, even if given an operator designator.
2755 then
2761 and then
2763 N_Subprogram_Renaming_Declaration
2764 then
2767 -- If the node is rewritten, it will be fully resolved in
2768 -- Rewrite_Renamed_Operator.
2778 when N_Aggregate => Resolve_Aggregate (N, Ctx_Type);
2780 when N_Allocator => Resolve_Allocator (N, Ctx_Type);
2782 when N_Short_Circuit
2783 => Resolve_Short_Circuit (N, Ctx_Type);
2785 when N_Attribute_Reference
2786 => Resolve_Attribute (N, Ctx_Type);
2788 when N_Case_Expression
2789 => Resolve_Case_Expression (N, Ctx_Type);
2791 when N_Character_Literal
2792 => Resolve_Character_Literal (N, Ctx_Type);
2794 when N_Expanded_Name
2795 => Resolve_Entity_Name (N, Ctx_Type);
2797 when N_Explicit_Dereference
2798 => Resolve_Explicit_Dereference (N, Ctx_Type);
2800 when N_Expression_With_Actions
2801 => Resolve_Expression_With_Actions (N, Ctx_Type);
2803 when N_Extension_Aggregate
2804 => Resolve_Extension_Aggregate (N, Ctx_Type);
2806 when N_Function_Call
2807 => Resolve_Call (N, Ctx_Type);
2809 when N_Identifier
2810 => Resolve_Entity_Name (N, Ctx_Type);
2812 when N_If_Expression
2813 => Resolve_If_Expression (N, Ctx_Type);
2815 when N_Indexed_Component
2816 => Resolve_Indexed_Component (N, Ctx_Type);
2818 when N_Integer_Literal
2819 => Resolve_Integer_Literal (N, Ctx_Type);
2821 when N_Membership_Test
2822 => Resolve_Membership_Op (N, Ctx_Type);
2824 when N_Null => Resolve_Null (N, Ctx_Type);
2826 when N_Op_And | N_Op_Or | N_Op_Xor
2827 => Resolve_Logical_Op (N, Ctx_Type);
2829 when N_Op_Eq | N_Op_Ne
2830 => Resolve_Equality_Op (N, Ctx_Type);
2832 when N_Op_Lt | N_Op_Le | N_Op_Gt | N_Op_Ge
2833 => Resolve_Comparison_Op (N, Ctx_Type);
2835 when N_Op_Not => Resolve_Op_Not (N, Ctx_Type);
2837 when N_Op_Add | N_Op_Subtract | N_Op_Multiply |
2838 N_Op_Divide | N_Op_Mod | N_Op_Rem
2840 => Resolve_Arithmetic_Op (N, Ctx_Type);
2842 when N_Op_Concat => Resolve_Op_Concat (N, Ctx_Type);
2844 when N_Op_Expon => Resolve_Op_Expon (N, Ctx_Type);
2846 when N_Op_Plus | N_Op_Minus | N_Op_Abs
2847 => Resolve_Unary_Op (N, Ctx_Type);
2849 when N_Op_Shift => Resolve_Shift (N, Ctx_Type);
2851 when N_Procedure_Call_Statement
2852 => Resolve_Call (N, Ctx_Type);
2854 when N_Operator_Symbol
2855 => Resolve_Operator_Symbol (N, Ctx_Type);
2857 when N_Qualified_Expression
2858 => Resolve_Qualified_Expression (N, Ctx_Type);
2860 -- Why is the following null, needs a comment ???
2862 when N_Quantified_Expression
2863 => null;
2865 when N_Raise_Expression
2866 => Resolve_Raise_Expression (N, Ctx_Type);
2868 when N_Raise_xxx_Error
2869 => Set_Etype (N, Ctx_Type);
2871 when N_Range => Resolve_Range (N, Ctx_Type);
2873 when N_Real_Literal
2874 => Resolve_Real_Literal (N, Ctx_Type);
2876 when N_Reference => Resolve_Reference (N, Ctx_Type);
2878 when N_Selected_Component
2879 => Resolve_Selected_Component (N, Ctx_Type);
2881 when N_Slice => Resolve_Slice (N, Ctx_Type);
2883 when N_String_Literal
2884 => Resolve_String_Literal (N, Ctx_Type);
2886 when N_Type_Conversion
2887 => Resolve_Type_Conversion (N, Ctx_Type);
2889 when N_Unchecked_Expression =>
2890 Resolve_Unchecked_Expression (N, Ctx_Type);
2892 when N_Unchecked_Type_Conversion =>
2893 Resolve_Unchecked_Type_Conversion (N, Ctx_Type);
2894 end case;
2896 -- Ada 2012 (AI05-0149): Apply an (implicit) conversion to an
2897 -- expression of an anonymous access type that occurs in the context
2898 -- of a named general access type, except when the expression is that
2899 -- of a membership test. This ensures proper legality checking in
2900 -- terms of allowed conversions (expressions that would be illegal to
2901 -- convert implicitly are allowed in membership tests).
2903 if Ada_Version >= Ada_2012
2904 and then Ekind (Ctx_Type) = E_General_Access_Type
2905 and then Ekind (Etype (N)) = E_Anonymous_Access_Type
2906 and then Nkind (Parent (N)) not in N_Membership_Test
2907 then
2908 Rewrite (N, Convert_To (Ctx_Type, Relocate_Node (N)));
2909 Analyze_And_Resolve (N, Ctx_Type);
2910 end if;
2912 -- If the subexpression was replaced by a non-subexpression, then
2913 -- all we do is to expand it. The only legitimate case we know of
2914 -- is converting procedure call statement to entry call statements,
2915 -- but there may be others, so we are making this test general.
2917 if Nkind (N) not in N_Subexpr then
2918 Debug_A_Exit ("resolving ", N, " (done)");
2919 Expand (N);
2920 return;
2921 end if;
2923 -- The expression is definitely NOT overloaded at this point, so
2924 -- we reset the Is_Overloaded flag to avoid any confusion when
2925 -- reanalyzing the node.
2927 Set_Is_Overloaded (N, False);
2929 -- Freeze expression type, entity if it is a name, and designated
2930 -- type if it is an allocator (RM 13.14(10,11,13)).
2932 -- Now that the resolution of the type of the node is complete, and
2933 -- we did not detect an error, we can expand this node. We skip the
2934 -- expand call if we are in a default expression, see section
2935 -- "Handling of Default Expressions" in Sem spec.
2937 Debug_A_Exit ("resolving ", N, " (done)");
2939 -- We unconditionally freeze the expression, even if we are in
2940 -- default expression mode (the Freeze_Expression routine tests this
2941 -- flag and only freezes static types if it is set).
2943 -- Ada 2012 (AI05-177): The declaration of an expression function
2944 -- does not cause freezing, but we never reach here in that case.
2945 -- Here we are resolving the corresponding expanded body, so we do
2946 -- need to perform normal freezing.
2948 Freeze_Expression (N);
2950 -- Now we can do the expansion
2952 Expand (N);
2953 end if;
2954 end Resolve;
2956 -------------
2957 -- Resolve --
2958 -------------
2960 -- Version with check(s) suppressed
2962 procedure Resolve (N : Node_Id; Typ : Entity_Id; Suppress : Check_Id) is
2963 begin
2964 if Suppress = All_Checks then
2965 declare
2966 Sva : constant Suppress_Array := Scope_Suppress.Suppress;
2967 begin
2968 Scope_Suppress.Suppress := (others => True);
2969 Resolve (N, Typ);
2970 Scope_Suppress.Suppress := Sva;
2971 end;
2973 else
2974 declare
2975 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
2976 begin
2977 Scope_Suppress.Suppress (Suppress) := True;
2978 Resolve (N, Typ);
2979 Scope_Suppress.Suppress (Suppress) := Svg;
2980 end;
2981 end if;
2982 end Resolve;
2984 -------------
2985 -- Resolve --
2986 -------------
2988 -- Version with implicit type
2990 procedure Resolve (N : Node_Id) is
2991 begin
2992 Resolve (N, Etype (N));
2993 end Resolve;
2995 ---------------------
2996 -- Resolve_Actuals --
2997 ---------------------
2999 procedure Resolve_Actuals (N : Node_Id; Nam : Entity_Id) is
3000 Loc : constant Source_Ptr := Sloc (N);
3001 A : Node_Id;
3002 A_Id : Entity_Id;
3003 A_Typ : Entity_Id;
3004 F : Entity_Id;
3005 F_Typ : Entity_Id;
3006 Prev : Node_Id := Empty;
3007 Orig_A : Node_Id;
3009 procedure Check_Aliased_Parameter;
3010 -- Check rules on aliased parameters and related accessibility rules
3011 -- in (RM 3.10.2 (10.2-10.4)).
3013 procedure Check_Argument_Order;
3014 -- Performs a check for the case where the actuals are all simple
3015 -- identifiers that correspond to the formal names, but in the wrong
3016 -- order, which is considered suspicious and cause for a warning.
3018 procedure Check_Prefixed_Call;
3019 -- If the original node is an overloaded call in prefix notation,
3021 -- Try_Object_Operation has already verified that there is a valid
3022 -- interpretation, but the form of the actual can only be determined
3023 -- once the primitive operation is identified.
3026 -- If the actual is missing in a call, insert in the actuals list
3027 -- an instance of the default expression. The insertion is always
3028 -- a named association.
3030 procedure Property_Error
3034 -- Emit an error concerning variable Var with entity Var_Id that has
3035 -- enabled property Prop_Nam when it acts as an actual parameter in a
3036 -- call and the corresponding formal parameter is of mode IN.
3039 -- Check whether T1 and T2, or their full views, are derived from a
3040 -- common type. Used to enforce the restrictions on array conversions
3041 -- of AI95-00246.
3044 -- Predicate to determine whether an actual that is a concatenation
3045 -- will be evaluated statically and does not need a transient scope.
3046 -- This must be determined before the actual is resolved and expanded
3047 -- because if needed the transient scope must be introduced earlier.
3049 ------------------------------
3050 -- Check_Aliased_Parameter --
3051 ------------------------------
3056 begin
3064 else
3071 -- In a generic body assume the worst for generic formals:
3072 -- they can have a constrained partial view (AI05-041).
3078 then
3081 else
3086 else
3098 then
3106 then
3107 Error_Msg_N
3113 --------------------------
3114 -- Check_Argument_Order --
3115 --------------------------
3118 begin
3119 -- Nothing to do if no parameters, or original node is neither a
3120 -- function call nor a procedure call statement (happens in the
3121 -- operator-transformed-to-function call case), or the call does
3122 -- not come from source, or this warning is off.
3124 if not Warn_On_Parameter_Order
3128 then
3132 declare
3135 begin
3136 -- Nothing to do if only one parameter
3142 -- Here if at least two arguments
3144 declare
3150 -- Set True if an out of order case is found
3152 begin
3153 -- Collect identifier names of actuals, fail if any actual is
3154 -- not a simple identifier, and record max length of name.
3160 else
3166 -- If we got this far, all actuals are identifiers and the list
3167 -- of their names is stored in the Actuals array.
3172 -- If we ran out of formals, that's odd, probably an error
3173 -- which will be detected elsewhere, but abandon the search.
3179 -- If name matches and is in order OK
3184 else
3185 -- If no match, see if it is elsewhere in list and if so
3186 -- flag potential wrong order if type is compatible.
3190 and then
3192 then
3198 -- No match
3206 -- If Formals left over, also probably an error, skip warning
3212 -- Here we give the warning if something was out of order
3215 Error_Msg_N
3222 -------------------------
3223 -- Check_Prefixed_Call --
3224 -------------------------
3233 begin
3234 -- Check whether the call is a prefixed call, with or without
3235 -- additional actuals.
3238 or else
3244 then
3247 then
3248 -- Introduce dereference on object in prefix
3250 New_A :=
3258 then
3259 -- Introduce an implicit 'Access in prefix
3262 Error_Msg_NE
3278 --------------------
3279 -- Insert_Default --
3280 --------------------
3286 begin
3287 -- Missing argument in call, nothing to insert
3292 else
3293 -- Note that we do a full New_Copy_Tree, so that any associated
3294 -- Itypes are properly copied. This may not be needed any more,
3295 -- but it does no harm as a safety measure. Defaults of a generic
3296 -- formal may be out of bounds of the corresponding actual (see
3297 -- cc1311b) and an additional check may be required.
3299 Actval :=
3300 New_Copy_Tree
3307 then
3313 then
3316 then
3317 -- If default is a real literal, do not introduce a
3318 -- conversion whose effect may depend on the run-time
3319 -- size of universal real.
3323 else
3334 -- Resolve aggregates with their base type, to avoid scope
3335 -- anomalies: the subtype was first built in the subprogram
3336 -- declaration, and the current call may be nested.
3340 else
3344 else
3347 -- See note above concerning aggregates
3351 then
3354 -- Resolve entities with their own type, which may differ from
3355 -- the type of a reference in a generic context (the view
3356 -- swapping mechanism did not anticipate the re-analysis of
3357 -- default values in calls).
3362 else
3367 -- If default is a tag indeterminate function call, propagate tag
3368 -- to obtain proper dispatching.
3372 then
3378 -- If the default expression raises constraint error, then just
3379 -- silently replace it with an N_Raise_Constraint_Error node, since
3380 -- we already gave the warning on the subprogram spec. If node is
3381 -- already a Raise_Constraint_Error leave as is, to prevent loops in
3382 -- the warnings removal machinery.
3386 then
3394 Assoc :=
3399 -- Case of insertion is first named actual
3403 then
3410 else
3414 else
3418 -- Case of insertion is not first named actual
3420 else
3421 Set_Next_Named_Actual
3433 --------------------
3434 -- Property_Error --
3435 --------------------
3437 procedure Property_Error
3441 is
3442 begin
3444 Error_Msg_NE
3450 -------------------
3451 -- Same_Ancestor --
3452 -------------------
3458 begin
3461 then
3467 then
3474 --------------------------
3475 -- Static_Concatenation --
3476 --------------------------
3479 begin
3486 -- Concatenation is static when both operands are static and
3487 -- the concatenation operator is a predefined one.
3490 and then
3492 and then
3497 declare
3499 begin
3502 and then
3506 else
3512 -- Start of processing for Resolve_Actuals
3514 begin
3515 Check_Argument_Order;
3519 Check_Prefixed_Call;
3528 -- If we have an error in any actual or formal, indicated by a type
3529 -- of Any_Type, then abandon resolution attempt, and set result type
3530 -- to Any_Type. Skip this if the actual is a Raise_Expression, whose
3531 -- type is imposed from context.
3535 then
3542 -- Case where actual is present
3544 -- If the actual is an entity, generate a reference to it now. We
3545 -- do this before the actual is resolved, because a formal of some
3546 -- protected subprogram, or a task discriminant, will be rewritten
3547 -- during expansion, and the source entity reference may be lost.
3552 then
3558 then
3565 -- RM 6.4.1(12): For an out parameter that is passed by
3566 -- copy, the formal parameter object is created, and:
3568 -- * For an access type, the formal parameter is initialized
3569 -- from the value of the actual, without checking that the
3570 -- value satisfies any constraint, any predicate, or any
3571 -- exclusion of the null value.
3573 -- * For a scalar type that has the Default_Value aspect
3574 -- specified, the formal parameter is initialized from the
3575 -- value of the actual, without checking that the value
3576 -- satisfies any constraint or any predicate.
3577 -- I do not understand why this case is included??? this is
3578 -- not a case where an OUT parameter is treated as IN OUT.
3580 -- * For a composite type with discriminants or that has
3581 -- implicit initial values for any subcomponents, the
3582 -- behavior is as for an in out parameter passed by copy.
3584 -- Hence for these cases we generate the read reference now
3585 -- (the write reference will be generated later by
3586 -- Note_Possible_Modification).
3589 and then
3591 or else
3593 and then
3595 or else
3598 or else Is_Partially_Initialized_Type
3600 then
3610 then
3611 -- If style checking mode on, check match of formal name
3619 -- If the formal is Out or In_Out, do not resolve and expand the
3620 -- conversion, because it is subsequently expanded into explicit
3621 -- temporaries and assignments. However, the object of the
3622 -- conversion can be resolved. An exception is the case of tagged
3623 -- type conversion with a class-wide actual. In that case we want
3624 -- the tag check to occur and no temporary will be needed (no
3625 -- representation change can occur) and the parameter is passed by
3626 -- reference, so we go ahead and resolve the type conversion.
3627 -- Another exception is the case of reference to component or
3628 -- subcomponent of a bit-packed array, in which case we want to
3629 -- defer expansion to the point the in and out assignments are
3630 -- performed.
3635 then
3638 then
3639 -- In a view conversion, the conversion must be legal in
3640 -- both directions, and thus both component types must be
3641 -- aliased, or neither (4.6 (8)).
3643 -- The extra rule in 4.6 (24.9.2) seems unduly restrictive:
3644 -- the privacy requirement should not apply to generic
3645 -- types, and should be checked in an instance. ARG query
3646 -- is in order ???
3650 then
3651 Error_Msg_N
3655 -- Comment here??? what set of cases???
3657 elsif
3659 then
3660 -- Check view conv between unrelated by ref array types
3664 then
3665 Error_Msg_N
3669 -- In Ada 2005 mode, check view conversion component
3670 -- type cannot be private, tagged, or volatile. Note
3671 -- that we only apply this to source conversions. The
3672 -- generated code can contain conversions which are
3673 -- not subject to this test, and we cannot extract the
3674 -- component type in such cases since it is not present.
3678 then
3679 declare
3681 Component_Type
3683 begin
3688 then
3689 Error_Msg_N
3700 -- Resolve expression if conversion is all OK
3705 then
3709 -- If the actual is a function call that returns a limited
3710 -- unconstrained object that needs finalization, create a
3711 -- transient scope for it, so that it can receive the proper
3712 -- finalization list.
3717 and then Expander_Active
3719 then
3723 -- A small optimization: if one of the actuals is a concatenation
3724 -- create a block around a procedure call to recover stack space.
3725 -- This alleviates stack usage when several procedure calls in
3726 -- the same statement list use concatenation. We do not perform
3727 -- this wrapping for code statements, where the argument is a
3728 -- static string, and we want to preserve warnings involving
3729 -- sequences of such statements.
3733 and then Expander_Active
3734 and then
3738 then
3742 else
3746 and then
3749 then
3750 Error_Msg_N
3763 -- (Ada 2005: AI-251): If the actual is an allocator whose
3764 -- directly designated type is a class-wide interface, we build
3765 -- an anonymous access type to use it as the type of the
3766 -- allocator. Later, when the subprogram call is expanded, if
3767 -- the interface has a secondary dispatch table the expander
3768 -- will add a type conversion to force the correct displacement
3769 -- of the pointer.
3772 declare
3778 begin
3781 then
3784 Set_Directly_Designated_Type
3789 -- Ada 2005, AI-162:If the actual is an allocator, the
3790 -- innermost enclosing statement is the master of the
3791 -- created object. This needs to be done with expansion
3792 -- enabled only, otherwise the transient scope will not
3793 -- be removed in the expansion of the wrapped construct.
3796 and then Expander_Active
3797 then
3807 -- (Ada 2005): The call may be to a primitive operation of a
3808 -- tagged synchronized type, declared outside of the type. In
3809 -- this case the controlling actual must be converted to its
3810 -- corresponding record type, which is the formal type. The
3811 -- actual may be a subtype, either because of a constraint or
3812 -- because it is a generic actual, so use base type to locate
3813 -- concurrent type.
3820 then
3821 -- If the actual is overloaded, look for an interpretation
3822 -- that has a synchronized type.
3827 else
3828 declare
3832 begin
3837 then
3847 declare
3850 begin
3853 else
3857 -- Tagged synchronized type (case 1): the actual is a
3858 -- concurrent type.
3862 then
3864 Unchecked_Convert_To
3868 -- Tagged synchronized type (case 2): the formal is a
3869 -- concurrent type.
3872 and then Present
3877 then
3880 -- Common case
3882 else
3887 -- Not a synchronized operation
3889 else
3897 -- An actual cannot be an untagged formal incomplete type
3902 then
3903 Error_Msg_N
3909 N_Procedure_Call_Statement)
3910 then
3911 -- In formal mode, check that actual parameters matching
3912 -- formals of tagged types are objects (or ancestor type
3913 -- conversions of objects), not general expressions.
3920 declare
3925 begin
3927 Check_SPARK_05_Restriction
3930 -- In formal mode, the only view conversions are those
3931 -- involving ancestor conversion of an extended type.
3933 elsif not
3939 then
3940 if Ekind_In
3942 then
3943 Check_SPARK_05_Restriction
3946 else
3947 Check_SPARK_05_Restriction
3951 else
3956 else
3960 -- In formal mode, the only view conversions are those
3961 -- involving ancestor conversion of an extended type.
3965 then
3966 Check_SPARK_05_Restriction
3972 -- has warnings suppressed, then we reset Never_Set_In_Source for
3973 -- the calling entity. The reason for this is to catch cases like
3974 -- GNAT.Spitbol.Patterns.Vstring_Var where the called subprogram
3975 -- uses trickery to modify an IN parameter.
3982 then
3986 -- Perform error checks for IN and IN OUT parameters
3990 -- Check unset reference. For scalar parameters, it is clearly
3991 -- wrong to pass an uninitialized value as either an IN or
3992 -- IN-OUT parameter. For composites, it is also clearly an
3993 -- error to pass a completely uninitialized value as an IN
3994 -- parameter, but the case of IN OUT is trickier. We prefer
3995 -- not to give a warning here. For example, suppose there is
3996 -- a routine that sets some component of a record to False.
3997 -- It is perfectly reasonable to make this IN-OUT and allow
3998 -- either initialized or uninitialized records to be passed
3999 -- in this case.
4001 -- For partially initialized composite values, we also avoid
4002 -- warnings, since it is quite likely that we are passing a
4003 -- partially initialized value and only the initialized fields
4004 -- will in fact be read in the subprogram.
4009 then
4013 -- In Ada 83 we cannot pass an OUT parameter as an IN or IN OUT
4014 -- actual to a nested call, since this is case of reading an
4015 -- out parameter, which is not allowed.
4020 then
4025 -- Case of OUT or IN OUT parameter
4029 -- For an Out parameter, check for useless assignment. Note
4030 -- that we can't set Last_Assignment this early, because we may
4031 -- kill current values in Resolve_Call, and that call would
4032 -- clobber the Last_Assignment field.
4034 -- Note: call Warn_On_Useless_Assignment before doing the check
4035 -- below for Is_OK_Variable_For_Out_Formal so that the setting
4036 -- of Referenced_As_LHS/Referenced_As_Out_Formal properly
4037 -- reflects the last assignment, not this one.
4044 then
4049 -- Validate the form of the actual. Note that the call to
4050 -- Is_OK_Variable_For_Out_Formal generates the required
4051 -- reference in this case.
4053 -- A call to an initialization procedure for an aggregate
4054 -- component may initialize a nested component of a constant
4055 -- designated object. In this context the object is variable.
4059 then
4063 and then
4066 then
4067 Error_Msg_N
4073 -- What's the following about???
4077 else
4078 Kill_All_Checks;
4087 -- Apply appropriate constraint/predicate checks for IN [OUT] case
4091 -- Apply predicate tests except in certain special cases. Note
4092 -- that it might be more consistent to apply these only when
4093 -- expansion is active (in Exp_Ch6.Expand_Actuals), as we do
4094 -- for the outbound predicate tests ???
4100 -- Apply required constraint checks
4102 -- Gigi looks at the check flag and uses the appropriate types.
4103 -- For now since one flag is used there is an optimization
4104 -- which might not be done in the IN OUT case since Gigi does
4105 -- not do any analysis. More thought required about this ???
4107 -- In fact is this comment obsolete??? doesn't the expander now
4108 -- generate all these tests anyway???
4121 then
4124 -- For view conversions of a discriminated object, apply
4125 -- check to object itself, the conversion alreay has the
4126 -- proper type.
4130 then
4137 then
4143 then
4146 else
4150 -- Ada 2005 (AI-231): Note that the controlling parameter case
4151 -- already existed in Ada 95, which is partially checked
4152 -- elsewhere (see Checks), and we don't want the warning
4153 -- message to differ.
4158 then
4160 Apply_Compile_Time_Constraint_Error
4166 Apply_Compile_Time_Constraint_Error
4175 -- Checks for OUT parameters and IN OUT parameters
4179 -- If there is a type conversion, to make sure the return value
4180 -- meets the constraints of the variable before the conversion.
4184 Apply_Scalar_Range_Check
4186 else
4187 Apply_Range_Check
4191 -- If no conversion apply scalar range checks and length checks
4192 -- base on the subtype of the actual (NOT that of the formal).
4194 else
4199 then
4201 else
4206 -- Note: we do not apply the predicate checks for the case of
4207 -- OUT and IN OUT parameters. They are instead applied in the
4208 -- Expand_Actuals routine in Exp_Ch6.
4211 -- An actual associated with an access parameter is implicitly
4212 -- converted to the anonymous access type of the formal and must
4213 -- satisfy the legality checks for access conversions.
4217 Error_Msg_N
4221 -- If the actual is an access selected component of a variable,
4222 -- the call may modify its designated object. It is reasonable
4223 -- to treat this as a potential modification of the enclosing
4224 -- record, to prevent spurious warnings that it should be
4225 -- declared as a constant, because intuitively programmers
4226 -- regard the designated subcomponent as part of the record.
4231 then
4236 -- Check bad case of atomic/volatile argument (RM C.6(12))
4240 then
4243 then
4244 Error_Msg_NE
4250 then
4251 Error_Msg_NE
4257 -- Check that subprograms don't have improper controlling
4258 -- arguments (RM 3.9.2 (9)).
4260 -- A primitive operation may have an access parameter of an
4261 -- incomplete tagged type, but a dispatching call is illegal
4262 -- if the type is still incomplete.
4268 declare
4270 begin
4274 then
4275 Error_Msg_NE
4289 then
4294 Error_Msg_NE
4298 -- Apply the checks described in 3.10.2(27): if the context is a
4299 -- specific access-to-object, the actual cannot be class-wide.
4300 -- Use base type to exclude access_to_subprogram cases.
4307 and then
4312 -- Disable these checks for call to imported C++ subprograms
4314 and then not
4318 then
4319 Error_Msg_N
4324 Error_Msg_NE
4329 Check_Aliased_Parameter;
4333 -- If it is a named association, treat the selector_name as a
4334 -- proper identifier, and mark the corresponding entity.
4338 -- Ignore reference in SPARK mode, as it refers to an entity not
4339 -- in scope at the point of reference, so the reference should
4340 -- be ignored for computing effects of subprograms.
4342 and then not GNATprove_Mode
4343 then
4356 -- The following checks are only relevant when SPARK_Mode is on as
4357 -- they are not standard Ada legality rule. Internally generated
4358 -- temporaries are ignored.
4363 then
4364 -- An effectively volatile object may act as an actual
4365 -- parameter when the corresponding formal is of a non-scalar
4366 -- volatile type.
4370 then
4373 -- An effectively volatile object may act as an actual
4374 -- parameter in a call to an instance of Unchecked_Conversion.
4379 else
4380 Error_Msg_N
4385 -- Detect an external variable with an enabled property that
4386 -- does not match the mode of the corresponding formal in a
4387 -- procedure call. Functions are not considered because they
4388 -- cannot have effectively volatile formal parameters in the
4389 -- first place.
4395 then
4409 then
4411 Error_Msg_NE
4415 Error_Msg_N
4421 -- A formal parameter of a specific tagged type whose related
4422 -- subprogram is subject to pragma Extensions_Visible with value
4423 -- "False" cannot act as an actual in a subprogram with value
4424 -- "True" (SPARK RM 6.1.7(3)).
4428 Extensions_Visible_True
4429 then
4430 Error_Msg_N
4433 Error_Msg_NE
4439 -- Case where actual is not present
4441 else
4442 Insert_Default;
4449 -----------------------
4450 -- Resolve_Allocator --
4451 -----------------------
4463 procedure Check_Allocator_Discrim_Accessibility
4466 -- Check that accessibility level associated with an access discriminant
4467 -- initialized in an allocator by the expression Disc_Exp is not deeper
4468 -- than the level of the allocator type Alloc_Typ. An error message is
4469 -- issued if this condition is violated. Specialized checks are done for
4470 -- the cases of a constraint expression which is an access attribute or
4471 -- an access discriminant.
4474 -- If the allocator is an actual in a call, it is allowed to be class-
4475 -- wide when the context is not because it is a controlling actual.
4477 -------------------------------------------
4478 -- Check_Allocator_Discrim_Accessibility --
4479 -------------------------------------------
4481 procedure Check_Allocator_Discrim_Accessibility
4484 is
4485 begin
4488 then
4489 Error_Msg_N
4492 -- When the expression is an Access attribute the level of the prefix
4493 -- object must not be deeper than that of the allocator's type.
4497 Attribute_Access
4500 then
4501 Error_Msg_N
4503 Disc_Exp);
4505 -- When the expression is an access discriminant the check is against
4506 -- the level of the prefix object.
4512 then
4513 Error_Msg_N
4515 Disc_Exp);
4517 -- All other cases are legal
4519 else
4524 ----------------------------
4525 -- In_Dispatching_Context --
4526 ----------------------------
4531 begin
4537 -- Start of processing for Resolve_Allocator
4539 begin
4540 -- Replace general access with specific type
4550 -- For qualified expression, resolve the expression using the given
4551 -- subtype (nothing to do for type mark, subtype indication)
4556 and then not In_Dispatching_Context
4557 then
4558 Error_Msg_N
4566 -- A qualified expression requires an exact match of the type.
4567 -- Class-wide matching is not allowed.
4572 then
4576 -- Calls to build-in-place functions are not currently supported in
4577 -- allocators for access types associated with a simple storage pool.
4578 -- Supporting such allocators may require passing additional implicit
4579 -- parameters to build-in-place functions (or a significant revision
4580 -- of the current b-i-p implementation to unify the handling for
4581 -- multiple kinds of storage pools). ???
4585 then
4586 declare
4589 begin
4591 and then
4592 Present (Get_Rep_Pragma
4594 then
4595 Error_Msg_N
4602 -- A special accessibility check is needed for allocators that
4603 -- constrain access discriminants. The level of the type of the
4604 -- expression used to constrain an access discriminant cannot be
4605 -- deeper than the type of the allocator (in contrast to access
4606 -- parameters, where the level of the actual can be arbitrary).
4608 -- We can't use Valid_Conversion to perform this check because in
4609 -- general the type of the allocator is unrelated to the type of
4610 -- the access discriminant.
4614 then
4621 then
4624 -- Get the first component expression of the aggregate
4634 else
4638 else
4657 else
4662 else
4671 -- For a subtype mark or subtype indication, freeze the subtype
4673 else
4677 Error_Msg_N
4681 -- A special accessibility check is needed for allocators that
4682 -- constrain access discriminants. The level of the type of the
4683 -- expression used to constrain an access discriminant cannot be
4684 -- deeper than the type of the allocator (in contrast to access
4685 -- parameters, where the level of the actual can be arbitrary).
4686 -- We can't use Valid_Conversion to perform this check because
4687 -- in general the type of the allocator is unrelated to the type
4688 -- of the access discriminant.
4693 then
4703 else
4717 -- Ada 2005 (AI-344): A class-wide allocator requires an accessibility
4718 -- check that the level of the type of the created object is not deeper
4719 -- than the level of the allocator's access type, since extensions can
4720 -- now occur at deeper levels than their ancestor types. This is a
4721 -- static accessibility level check; a run-time check is also needed in
4722 -- the case of an initialized allocator with a class-wide argument (see
4723 -- Expand_Allocator_Expression).
4727 then
4728 declare
4731 begin
4736 else
4742 then
4745 Error_Msg_N
4754 -- Do not apply Ada 2005 accessibility checks on a class-wide
4755 -- allocator if the type given in the allocator is a formal
4756 -- type. A run-time check will be performed in the instance.
4766 -- Check for allocation from an empty storage pool
4771 -- If the context is an unchecked conversion, as may happen within an
4772 -- inlined subprogram, the allocator is being resolved with its own
4773 -- anonymous type. In that case, if the target type has a specific
4774 -- storage pool, it must be inherited explicitly by the allocator type.
4778 then
4779 Set_Associated_Storage_Pool
4787 -- Check that an allocator with task parts isn't for a nested access
4788 -- type when restriction No_Task_Hierarchy applies.
4792 then
4796 -- An illegal allocator may be rewritten as a raise Program_Error
4797 -- statement.
4801 -- An anonymous access discriminant is the definition of a
4802 -- coextension.
4806 N_Discriminant_Specification
4807 then
4808 declare
4812 begin
4815 -- Ada 2012 AI05-0052: If the designated type of the allocator
4816 -- is limited, then the allocator shall not be used to define
4817 -- the value of an access discriminant unless the discriminated
4818 -- type is immutably limited.
4823 then
4824 Error_Msg_N
4830 -- Avoid marking an allocator as a dynamic coextension if it is
4831 -- within a static construct.
4837 -- Cleanup for potential static coextensions
4839 else
4845 -- Report a simple error: if the designated object is a local task,
4846 -- its body has not been seen yet, and its activation will fail an
4847 -- elaboration check.
4854 then
4860 -- Ada 2012 (AI05-0111-3): Detect an attempt to allocate a task or a
4861 -- type with a task component on a subpool. This action must raise
4862 -- Program_Error at runtime.
4868 then
4880 ---------------------------
4881 -- Resolve_Arithmetic_Op --
4882 ---------------------------
4884 -- Used for resolving all arithmetic operators except exponentiation
4895 -- We do the resolution using the base type, because intermediate values
4896 -- in expressions always are of the base type, not a subtype of it.
4899 -- Returns True if N is in a context that expects "any real type"
4902 -- Return True iff given type is Integer or universal real/integer
4905 -- Choose type of integer literal in fixed-point operation to conform
4906 -- to available fixed-point type. T is the type of the other operand,
4907 -- which is needed to determine the expected type of N.
4910 -- Set operand type to T if universal
4912 -------------------------------
4913 -- Expected_Type_Is_Any_Real --
4914 -------------------------------
4917 begin
4918 -- N is the expression after "delta" in a fixed_point_definition;
4919 -- see RM-3.5.9(6):
4922 N_Decimal_Fixed_Point_Definition,
4924 -- N is one of the bounds in a real_range_specification;
4925 -- see RM-3.5.7(5):
4927 N_Real_Range_Specification,
4929 -- N is the expression of a delta_constraint;
4930 -- see RM-J.3(3):
4932 N_Delta_Constraint);
4935 -----------------------------
4936 -- Is_Integer_Or_Universal --
4937 -----------------------------
4944 begin
4950 else
4956 then
4967 ----------------------------
4968 -- Set_Mixed_Mode_Operand --
4969 ----------------------------
4975 begin
4978 -- A universal integer literal is resolved as standard integer
4979 -- except in the case of a fixed-point result, where we leave it
4980 -- as universal (to be handled by Exp_Fixd later on)
4984 else
4992 then
4993 -- A universal real can appear in a fixed-type context. We resolve
4994 -- the literal with that context, even though this might raise an
4995 -- exception prematurely (the other operand may be zero).
5002 then
5003 -- Integer arg in mixed-mode operation. Resolve with universal
5004 -- type, in case preference rule must be applied.
5010 then
5011 -- Not a mixed-mode operation, resolve with context
5017 -- N may itself be a mixed-mode operation, so use context type
5024 then
5025 -- Must be (fixed * fixed) operation, operand must have one
5026 -- compatible interpretation.
5033 then
5034 -- C * F(X) in a fixed context, where C is a real literal or a
5035 -- fixed-point expression. F must have either a fixed type
5036 -- interpretation or an integer interpretation, but not both.
5043 else
5050 else
5058 -- Reanalyze the literal with the fixed type of the context. If
5059 -- context is Universal_Fixed, we are within a conversion, leave
5060 -- the literal as a universal real because there is no usable
5061 -- fixed type, and the target of the conversion plays no role in
5062 -- the resolution.
5064 declare
5068 begin
5071 else
5077 then
5079 else
5087 else
5092 ----------------------
5093 -- Set_Operand_Type --
5094 ----------------------
5097 begin
5100 then
5105 -- Start of processing for Resolve_Arithmetic_Op
5107 begin
5112 then
5116 -- Special-case for mixed-mode universal expressions or fixed point type
5117 -- operation: each argument is resolved separately. The same treatment
5118 -- is required if one of the operands of a fixed point operation is
5119 -- universal real, since in this case we don't do a conversion to a
5120 -- specific fixed-point type (instead the expander handles the case).
5122 -- Set the type of the node to its universal interpretation because
5123 -- legality checks on an exponentiation operand need the context.
5128 then
5139 or else
5142 then
5147 -- If context is a fixed type and one operand is integer, the other
5148 -- is resolved with the type of the context.
5153 then
5160 then
5164 else
5169 -- Check the rule in RM05-4.5.5(19.1/2) disallowing universal_fixed
5170 -- multiplying operators from being used when the expected type is
5171 -- also universal_fixed. Note that B_Typ will be Universal_Fixed in
5172 -- some cases where the expected type is actually Any_Real;
5173 -- Expected_Type_Is_Any_Real takes care of that case.
5177 then
5181 N_Unchecked_Type_Conversion)
5182 then
5189 else
5192 and then not
5194 N_Unchecked_Type_Conversion)
5195 then
5196 Error_Msg_N
5201 -- The expected type is "any real type" in contexts like
5203 -- type T is delta <universal_fixed-expression> ...
5205 -- in which case we need to set the type to Universal_Real
5206 -- so that static expression evaluation will work properly.
5210 else
5220 then
5225 -- If no previous errors, this is only possible if one operand is
5226 -- overloaded and the context is universal. Resolve as such.
5231 else
5233 and then
5235 then
5239 -- If the context is Universal_Fixed and the operands are also
5240 -- universal fixed, this is an error, unless there is only one
5241 -- applicable fixed_point type (usually Duration).
5249 else
5254 else
5259 -- If one of the arguments was resolved to a non-universal type.
5260 -- label the result of the operation itself with the same type.
5261 -- Do the same for the universal argument, if any.
5273 -- In SPARK, a multiplication or division with operands of fixed point
5274 -- types must be qualified or explicitly converted to identify the
5275 -- result type.
5280 and then
5282 then
5283 Check_SPARK_05_Restriction
5287 -- Set overflow and division checking bit
5294 -- Give warning if explicit division by zero
5298 then
5304 or else
5307 then
5308 -- Specialize the warning message according to the operation.
5309 -- The following warnings are for the case
5314 -- For division, we have two cases, for float division
5315 -- of an unconstrained float type, on a machine where
5316 -- Machine_Overflows is false, we don't get an exception
5317 -- at run-time, but rather an infinity or Nan. The Nan
5318 -- case is pretty obscure, so just warn about infinities.
5322 and then not Machine_Overflows_On_Target
5323 then
5324 Error_Msg_N
5328 -- For all other cases, we get a Constraint_Error
5330 else
5331 Apply_Compile_Time_Constraint_Error
5337 Apply_Compile_Time_Constraint_Error
5342 Apply_Compile_Time_Constraint_Error
5346 -- Division by zero can only happen with division, rem,
5347 -- and mod operations.
5353 -- Otherwise just set the flag to check at run time
5355 else
5360 -- If Restriction No_Implicit_Conditionals is active, then it is
5361 -- violated if either operand can be negative for mod, or for rem
5362 -- if both operands can be negative.
5366 then
5367 declare
5374 -- Set if corresponding operand might be negative
5376 begin
5377 Determine_Range
5381 Determine_Range
5385 -- Check if we will be generating conditionals. There are two
5386 -- cases where that can happen, first for REM, the only case
5387 -- is largest negative integer mod -1, where the division can
5388 -- overflow, but we still have to give the right result. The
5389 -- front end generates a test for this annoying case. Here we
5390 -- just test if both operands can be negative (that's what the
5391 -- expander does, so we match its logic here).
5393 -- The second case is mod where either operand can be negative.
5394 -- In this case, the back end has to generate additional tests.
5397 or else
5399 then
5411 ------------------
5412 -- Resolve_Call --
5413 ------------------
5416 function Same_Or_Aliased_Subprograms
5419 -- Returns True if the subprogram entity S is the same as E or else
5420 -- S is an alias of E.
5422 ---------------------------------
5423 -- Same_Or_Aliased_Subprograms --
5424 ---------------------------------
5426 function Same_Or_Aliased_Subprograms
5429 is
5431 begin
5435 -- Local variables
5449 -- Start of processing for Resolve_Call
5451 begin
5452 -- The context imposes a unique interpretation with type Typ on a
5453 -- procedure or function call. Find the entity of the subprogram that
5454 -- yields the expected type, and propagate the corresponding formal
5455 -- constraints on the actuals. The caller has established that an
5456 -- interpretation exists, and emitted an error if not unique.
5458 -- First deal with the case of a call to an access-to-subprogram,
5459 -- dereference made explicit in Analyze_Call.
5465 else
5466 -- Find the interpretation whose type (a subprogram type) has a
5467 -- return type that is compatible with the context. Analysis of
5468 -- the node has established that one exists.
5487 -- If the prefix is not an entity, then resolve it
5493 -- For an indirect call, we always invalidate checks, since we do not
5494 -- know whether the subprogram is local or global. Yes we could do
5495 -- better here, e.g. by knowing that there are no local subprograms,
5496 -- but it does not seem worth the effort. Similarly, we kill all
5497 -- knowledge of current constant values.
5499 Kill_Current_Values;
5501 -- If this is a procedure call which is really an entry call, do
5502 -- the conversion of the procedure call to an entry call. Protected
5503 -- operations use the same circuitry because the name in the call
5504 -- can be an arbitrary expression with special resolution rules.
5509 then
5513 -- Kill checks and constant values, as above for indirect case
5514 -- Who knows what happens when another task is activated?
5516 Kill_Current_Values;
5519 -- Normal subprogram call with name established in Resolve
5525 -- Otherwise we must have the case of an overloaded call
5527 else
5530 -- Initialize Nam to prevent warning (we know it will be assigned
5531 -- in the loop below, but the compiler does not know that).
5551 then
5552 -- The prefix is a parameterless function call that returns an access
5553 -- to subprogram. If parameters are present in the current call, add
5554 -- add an explicit dereference. We use the base type here because
5555 -- within an instance these may be subtypes.
5557 -- The dereference is added either in Analyze_Call or here. Should
5558 -- be consolidated ???
5567 -- Check that a call to Current_Task does not occur in an entry body
5570 declare
5573 begin
5575 loop
5578 -- Exclude calls that occur within the default of a formal
5579 -- parameter of the entry, since those are evaluated outside
5580 -- of the body.
5587 then
5590 Error_Msg_NE
5604 -- Check that a procedure call does not occur in the context of the
5605 -- entry call statement of a conditional or timed entry call. Note that
5606 -- the case of a call to a subprogram renaming of an entry will also be
5607 -- rejected. The test for N not being an N_Entry_Call_Statement is
5608 -- defensive, covering the possibility that the processing of entry
5609 -- calls might reach this point due to later modifications of the code
5610 -- above.
5615 then
5619 -- Ada 2005 (AI-345): If a procedure_call_statement is used
5620 -- for a procedure_or_entry_call, the procedure_name or
5621 -- procedure_prefix of the procedure_call_statement shall denote
5622 -- an entry renamed by a procedure, or (a view of) a primitive
5623 -- subprogram of a limited interface whose first parameter is
5624 -- a controlling parameter.
5629 then
5630 Error_Msg_N
5635 -- If the SPARK_05 restriction is active, we are not allowed
5636 -- to have a call to a subprogram before we see its completion.
5641 -- Don't flag strange internal calls
5646 -- Only flag calls in extended main source
5651 -- Exclude enumeration literals from this processing
5654 then
5655 Check_SPARK_05_Restriction
5659 -- Check that this is not a call to a protected procedure or entry from
5660 -- within a protected function.
5664 -- Freeze the subprogram name if not in a spec-expression. Note that
5665 -- we freeze procedure calls as well as function calls. Procedure calls
5666 -- are not frozen according to the rules (RM 13.14(14)) because it is
5667 -- impossible to have a procedure call to a non-frozen procedure in
5668 -- pure Ada, but in the code that we generate in the expander, this
5669 -- rule needs extending because we can generate procedure calls that
5670 -- need freezing.
5672 -- In Ada 2012, expression functions may be called within pre/post
5673 -- conditions of subsequent functions or expression functions. Such
5674 -- calls do not freeze when they appear within generated bodies,
5675 -- (including the body of another expression function) which would
5676 -- place the freeze node in the wrong scope. An expression function
5677 -- is frozen in the usual fashion, by the appearance of a real body,
5678 -- or at the end of a declarative part.
5682 and then
5685 then
5689 -- For a predefined operator, the type of the result is the type imposed
5690 -- by context, except for a predefined operation on universal fixed.
5691 -- Otherwise The type of the call is the type returned by the subprogram
5692 -- being called.
5699 -- If the subprogram returns an array type, and the context requires the
5700 -- component type of that array type, the node is really an indexing of
5701 -- the parameterless call. Resolve as such. A pathological case occurs
5702 -- when the type of the component is an access to the array type. In
5703 -- this case the call is truly ambiguous.
5706 and then
5709 or else
5712 and then
5714 then
5715 declare
5720 begin
5723 then
5724 Error_Msg_N
5726 else
5729 -- The called entity may be an explicit dereference, in which
5730 -- case there is no entity to set.
5738 or else
5740 and then
5742 then
5745 -- Indexed call to a parameterless function
5747 Index_Node :=
5749 Prefix =>
5752 else
5753 -- An Ada 2005 prefixed call to a primitive operation
5754 -- whose first parameter is the prefix. This prefix was
5755 -- prepended to the parameter list, which is actually a
5756 -- list of indexes. Remove the prefix in order to build
5757 -- the proper indexed component.
5759 Index_Node :=
5761 Prefix =>
5764 Parameter_Associations =>
5765 New_List
5770 -- Preserve the parenthesis count of the node
5774 -- Since we are correcting a node classification error made
5775 -- by the parser, we call Replace rather than Rewrite.
5789 else
5793 -- In the case where the call is to an overloaded subprogram, Analyze
5794 -- calls Normalize_Actuals once per overloaded subprogram. Therefore in
5795 -- such a case Normalize_Actuals needs to be called once more to order
5796 -- the actuals correctly. Otherwise the call will have the ordering
5797 -- given by the last overloaded subprogram whether this is the correct
5798 -- one being called or not.
5805 -- In any case, call is fully resolved now. Reset Overload flag, to
5806 -- prevent subsequent overload resolution if node is analyzed again
5811 -- If we are calling the current subprogram from immediately within its
5812 -- body, then that is the case where we can sometimes detect cases of
5813 -- infinite recursion statically. Do not try this in case restriction
5814 -- No_Recursion is in effect anyway, and do it only for source calls.
5819 -- Check violation of SPARK_05 restriction which does not permit
5820 -- a subprogram body to contain a call to the subprogram directly.
5824 then
5825 Check_SPARK_05_Restriction
5829 -- Issue warning for possible infinite recursion in the absence
5830 -- of the No_Recursion restriction.
5835 then
5836 -- Here we detected and flagged an infinite recursion, so we do
5837 -- not need to test the case below for further warnings. Also we
5838 -- are all done if we now have a raise SE node.
5844 -- If call is to immediately containing subprogram, then check for
5845 -- the case of a possible run-time detectable infinite recursion.
5847 else
5851 -- Although in general case, recursion is not statically
5852 -- checkable, the case of calling an immediately containing
5853 -- subprogram is easy to catch.
5857 -- If the recursive call is to a parameterless subprogram,
5858 -- then even if we can't statically detect infinite
5859 -- recursion, this is pretty suspicious, and we output a
5860 -- warning. Furthermore, we will try later to detect some
5861 -- cases here at run time by expanding checking code (see
5862 -- Detect_Infinite_Recursion in package Exp_Ch6).
5864 -- If the recursive call is within a handler, do not emit a
5865 -- warning, because this is a common idiom: loop until input
5866 -- is correct, catch illegal input in handler and restart.
5872 then
5873 -- For the case of a procedure call. We give the message
5874 -- only if the call is the first statement in a sequence
5875 -- of statements, or if all previous statements are
5876 -- simple assignments. This is simply a heuristic to
5877 -- decrease false positives, without losing too many good
5878 -- warnings. The idea is that these previous statements
5879 -- may affect global variables the procedure depends on.
5880 -- We also exclude raise statements, that may arise from
5881 -- constraint checks and are probably unrelated to the
5882 -- intended control flow.
5886 then
5887 declare
5889 begin
5893 N_Raise_Constraint_Error)
5894 then
5903 -- Do not give warning if we are in a conditional context
5905 declare
5907 begin
5913 then
5918 -- Here warning is to be issued
5934 -- Check obsolescent reference to Ada.Characters.Handling subprogram
5938 -- If subprogram name is a predefined operator, it was given in
5939 -- functional notation. Replace call node with operator node, so
5940 -- that actuals can be resolved appropriately.
5948 then
5954 -- Create a transient scope if the resulting type requires it
5956 -- There are several notable exceptions:
5958 -- a) In init procs, the transient scope overhead is not needed, and is
5959 -- even incorrect when the call is a nested initialization call for a
5960 -- component whose expansion may generate adjust calls. However, if the
5961 -- call is some other procedure call within an initialization procedure
5962 -- (for example a call to Create_Task in the init_proc of the task
5963 -- run-time record) a transient scope must be created around this call.
5965 -- b) Enumeration literal pseudo-calls need no transient scope
5967 -- c) Intrinsic subprograms (Unchecked_Conversion and source info
5968 -- functions) do not use the secondary stack even though the return
5969 -- type may be unconstrained.
5971 -- d) Calls to a build-in-place function, since such functions may
5972 -- allocate their result directly in a target object, and cases where
5973 -- the result does get allocated in the secondary stack are checked for
5974 -- within the specialized Exp_Ch6 procedures for expanding those
5975 -- build-in-place calls.
5977 -- e) If the subprogram is marked Inline_Always, then even if it returns
5978 -- an unconstrained type the call does not require use of the secondary
5979 -- stack. However, inlining will only take place if the body to inline
5980 -- is already present. It may not be available if e.g. the subprogram is
5981 -- declared in a child instance.
5983 -- If this is an initialization call for a type whose construction
5984 -- uses the secondary stack, and it is not a nested call to initialize
5985 -- a component, we do need to create a transient scope for it. We
5986 -- check for this by traversing the type in Check_Initialization_Call.
5992 then
5998 then
6001 elsif Expander_Active
6004 and then
6006 or else
6008 then
6011 -- If the call appears within the bounds of a loop, it will
6012 -- be rewritten and reanalyzed, nothing left to do here.
6019 and then not Within_Init_Proc
6020 then
6024 -- A protected function cannot be called within the definition of the
6025 -- enclosing protected type, unless it is part of a pre/postcondition
6026 -- on another protected operation.
6031 and then not In_Spec_Expression
6032 then
6033 Error_Msg_NE
6037 -- Propagate interpretation to actuals, and add default expressions
6038 -- where needed.
6043 -- Overloaded literals are rewritten as function calls, for purpose of
6044 -- resolution. After resolution, we can replace the call with the
6045 -- literal itself.
6051 -- Avoid validation, since it is a static function call
6057 -- If the subprogram is not global, then kill all saved values and
6058 -- checks. This is a bit conservative, since in many cases we could do
6059 -- better, but it is not worth the effort. Similarly, we kill constant
6060 -- values. However we do not need to do this for internal entities
6061 -- (unless they are inherited user-defined subprograms), since they
6062 -- are not in the business of molesting local values.
6064 -- If the flag Suppress_Value_Tracking_On_Calls is set, then we also
6065 -- kill all checks and values for calls to global subprograms. This
6066 -- takes care of the case where an access to a local subprogram is
6067 -- taken, and could be passed directly or indirectly and then called
6068 -- from almost any context.
6070 -- Note: we do not do this step till after resolving the actuals. That
6071 -- way we still take advantage of the current value information while
6072 -- scanning the actuals.
6074 -- We suppress killing values if we are processing the nodes associated
6075 -- with N_Freeze_Entity nodes. Otherwise the declaration of a tagged
6076 -- type kills all the values as part of analyzing the code that
6077 -- initializes the dispatch tables.
6081 or else Suppress_Value_Tracking_On_Call
6086 then
6087 Kill_Current_Values;
6090 -- If we are warning about unread OUT parameters, this is the place to
6091 -- set Last_Assignment for OUT and IN OUT parameters. We have to do this
6092 -- after the above call to Kill_Current_Values (since that call clears
6093 -- the Last_Assignment field of all local variables).
6098 then
6099 declare
6103 begin
6113 then
6123 -- If the subprogram is a primitive operation, check whether or not
6124 -- it is a correct dispatching call.
6128 then
6133 and then not In_Instance
6134 then
6138 -- If this is a dispatching call, generate the appropriate reference,
6139 -- for better source navigation in GPS.
6143 then
6146 -- Normal case, not a dispatching call: generate a call reference
6148 else
6156 -- Check for violation of restriction No_Specific_Termination_Handlers
6157 -- and warn on a potentially blocking call to Abort_Task.
6161 or else
6163 then
6170 -- A call to Ada.Real_Time.Timing_Events.Set_Handler to set a relative
6171 -- timing event violates restriction No_Relative_Delay (AI-0211). We
6172 -- need to check the second argument to determine whether it is an
6173 -- absolute or relative timing event.
6178 then
6182 -- Issue an error for a call to an eliminated subprogram. This routine
6183 -- will not perform the check if the call appears within a default
6184 -- expression.
6188 -- In formal mode, the primitive operations of a tagged type or type
6189 -- extension do not include functions that return the tagged type.
6195 then
6199 -- Implement rule in 12.5.1 (23.3/2): In an instance, if the actual is
6200 -- class-wide and the call dispatches on result in a context that does
6201 -- not provide a tag, the call raises Program_Error.
6204 and then In_Instance
6209 then
6210 -- Verify that none of the formals are controlling
6212 declare
6216 begin
6238 -- Check for calling a function with OUT or IN OUT parameter when the
6239 -- calling context (us right now) is not Ada 2012, so does not allow
6240 -- OUT or IN OUT parameters in function calls.
6245 then
6250 -- Check the dimensions of the actuals in the call. For function calls,
6251 -- propagate the dimensions from the returned type to N.
6255 -- All done, evaluate call and deal with elaboration issues
6260 -- In GNATprove mode, expansion is disabled, but we want to inline some
6261 -- subprograms to facilitate formal verification. Indirect calls through
6262 -- a subprogram type or within a generic cannot be inlined. Inlining is
6263 -- performed only for calls subject to SPARK_Mode on.
6265 if GNATprove_Mode
6268 and then not Inside_A_Generic
6269 then
6276 -- Nothing to do if the subprogram is not eligible for inlining in
6277 -- GNATprove mode.
6281 then
6284 -- Calls cannot be inlined inside assertions, as GNATprove treats
6285 -- assertions as logic expressions.
6292 -- Calls cannot be inlined inside default expressions
6299 -- Inlining should not be performed during pre-analysis
6303 -- With the one-pass inlining technique, a call cannot be
6304 -- inlined if the corresponding body has not been seen yet.
6307 Error_Msg_NE
6312 -- Nothing to do if there is no body to inline, indicating that
6313 -- the subprogram is not suitable for inlining in GNATprove
6314 -- mode.
6319 -- Calls cannot be inlined inside potentially unevaluated
6320 -- expressions, as this would create complex actions inside
6321 -- expressions, that are not handled by GNATprove.
6325 Error_Msg_N
6329 -- Otherwise, inline the call
6331 else
6341 -----------------------------
6342 -- Resolve_Case_Expression --
6343 -----------------------------
6348 begin
6359 -------------------------------
6360 -- Resolve_Character_Literal --
6361 -------------------------------
6367 begin
6368 -- Verify that the character does belong to the type of the context
6373 -- Wide_Wide_Character literals must always be defined, since the set
6374 -- of wide wide character literals is complete, i.e. if a character
6375 -- literal is accepted by the parser, then it is OK for wide wide
6376 -- character (out of range character literals are rejected).
6381 -- Always accept character literal for type Any_Character, which
6382 -- occurs in error situations and in comparisons of literals, both
6383 -- of which should accept all literals.
6388 -- For Standard.Character or a type derived from it, check that the
6389 -- literal is in range.
6396 -- For Standard.Wide_Character or a type derived from it, check that the
6397 -- literal is in range.
6404 -- For Standard.Wide_Wide_Character or a type derived from it, we
6405 -- know the literal is in range, since the parser checked.
6410 -- If the entity is already set, this has already been resolved in a
6411 -- generic context, or comes from expansion. Nothing else to do.
6416 -- Otherwise we have a user defined character type, and we can use the
6417 -- standard visibility mechanisms to locate the referenced entity.
6419 else
6432 -- If we fall through, then the literal does not match any of the
6433 -- entries of the enumeration type. This isn't just a constraint error
6434 -- situation, it is an illegality (see RM 4.2).
6436 Error_Msg_NE
6440 ---------------------------
6441 -- Resolve_Comparison_Op --
6442 ---------------------------
6444 -- Context requires a boolean type, and plays no role in resolution.
6445 -- Processing identical to that for equality operators. The result type is
6446 -- the base type, which matters when pathological subtypes of booleans with
6447 -- limited ranges are used.
6454 begin
6455 -- If this is an intrinsic operation which is not predefined, use the
6456 -- types of its declared arguments to resolve the possibly overloaded
6457 -- operands. Otherwise the operands are unambiguous and specify the
6458 -- expected type.
6463 else
6474 -- Skip remaining processing if already set to Any_Type
6480 -- Deal with other error cases
6484 T = Any_Character
6485 then
6488 else
6496 -- Resolve the operands if types OK
6505 -- In SPARK, ordering operators <, <=, >, >= are not defined for Boolean
6506 -- types or array types except String.
6509 Check_SPARK_05_Restriction
6514 then
6515 Check_SPARK_05_Restriction
6519 -- Check comparison on unordered enumeration
6523 Error_Msg_NE
6528 -- Evaluate the relation (note we do this after the above check since
6529 -- this Eval call may change N to True/False.
6535 -----------------------------------------
6536 -- Resolve_Discrete_Subtype_Indication --
6537 -----------------------------------------
6539 procedure Resolve_Discrete_Subtype_Indication
6542 is
6546 begin
6554 else
6564 Error_Msg_NE
6567 -- Rewrite the constraint as a range of Typ
6568 -- to allow compilation to proceed further.
6580 else
6584 -- Additionally, we must check that the bounds are compatible
6585 -- with the given subtype, which might be different from the
6586 -- type of the context.
6590 -- ??? If the above check statically detects a Constraint_Error
6591 -- it replaces the offending bound(s) of the range R with a
6592 -- Constraint_Error node. When the itype which uses these bounds
6593 -- is frozen the resulting call to Duplicate_Subexpr generates
6594 -- a new temporary for the bounds.
6596 -- Unfortunately there are other itypes that are also made depend
6597 -- on these bounds, so when Duplicate_Subexpr is called they get
6598 -- a forward reference to the newly created temporaries and Gigi
6599 -- aborts on such forward references. This is probably sign of a
6600 -- more fundamental problem somewhere else in either the order of
6601 -- itype freezing or the way certain itypes are constructed.
6603 -- To get around this problem we call Remove_Side_Effects right
6604 -- away if either bounds of R are a Constraint_Error.
6606 declare
6610 begin
6626 -------------------------
6627 -- Resolve_Entity_Name --
6628 -------------------------
6630 -- Used to resolve identifiers and expanded names
6634 -- Denote whether an arbitrary node Nod appears in a check node
6636 function Is_OK_Volatile_Context
6639 -- Determine whether node Context denotes a "non-interfering context"
6640 -- (as defined in SPARK RM 7.1.3(13)) where volatile reference Obj_Ref
6641 -- can safely reside.
6643 ----------------------
6644 -- Appears_In_Check --
6645 ----------------------
6650 begin
6651 -- Climb the parent chain looking for a check node
6658 -- Prevent the search from going too far
6670 ----------------------------
6671 -- Is_OK_Volatile_Context --
6672 ----------------------------
6674 function Is_OK_Volatile_Context
6677 is
6678 begin
6679 -- The volatile object appears on either side of an assignment
6684 -- The volatile object is part of the initialization expression of
6685 -- another object. Ensure that the climb of the parent chain came
6686 -- from the expression side and not from the name side.
6691 then
6694 -- The volatile object appears as an actual parameter in a call to an
6695 -- instance of Unchecked_Conversion whose result is renamed.
6700 then
6703 -- The volatile object appears as the prefix of a name occurring
6704 -- in a non-interfering context.
6707 N_Indexed_Component,
6708 N_Selected_Component,
6709 N_Slice)
6711 and then Is_OK_Volatile_Context
6714 then
6717 -- The volatile object appears as the expression of a type conversion
6718 -- occurring in a non-interfering context.
6721 N_Unchecked_Type_Conversion)
6723 and then Is_OK_Volatile_Context
6726 then
6729 -- Allow references to volatile objects in various checks. This is
6730 -- not a direct SPARK 2014 requirement.
6735 else
6740 -- Local variables
6745 -- Start of processing for Resolve_Entity_Name
6747 begin
6748 -- If garbage from errors, set to Any_Type and return
6755 -- Replace named numbers by corresponding literals. Note that this is
6756 -- the one case where Resolve_Entity_Name must reset the Etype, since
6757 -- it is currently marked as universal.
6767 -- For enumeration literals, we need to make sure that a proper style
6768 -- check is done, since such literals are overloaded, and thus we did
6769 -- not do a style check during the first phase of analysis.
6775 -- Case of subtype name appearing as an operand in expression
6779 -- Allow use of subtype if it is a concurrent type where we are
6780 -- currently inside the body. This will eventually be expanded into a
6781 -- call to Self (for tasks) or _object (for protected objects). Any
6782 -- other use of a subtype is invalid.
6786 then
6789 -- Any other use is an error
6791 else
6792 Error_Msg_N
6796 -- Check discriminant use if entity is discriminant in current scope,
6797 -- i.e. discriminant of record or concurrent type currently being
6798 -- analyzed. Uses in corresponding body are unrestricted.
6803 then
6806 -- A parameterless generic function cannot appear in a context that
6807 -- requires resolution.
6818 then
6821 -- In all other cases, just do the possible static evaluation
6823 else
6824 -- A deferred constant that appears in an expression must have a
6825 -- completion, unless it has been removed by in-place expansion of
6826 -- an aggregate.
6832 and then not In_Spec_Expression
6834 then
6838 then
6840 else
6841 Error_Msg_N (
6851 -- When the entity appears in a parameter association, retrieve the
6852 -- related subprogram call.
6858 -- An effectively volatile object subject to enabled properties
6859 -- Async_Writers or Effective_Reads must appear in a specific context.
6860 -- The following checks are only relevant when SPARK_Mode is on as they
6861 -- are not standard Ada legality rules.
6867 and then
6869 then
6870 -- The effectively volatile objects appears in a "non-interfering
6871 -- context" as defined in SPARK RM 7.1.3(13).
6876 -- Assume that references to effectively volatile objects that appear
6877 -- as actual parameters in a procedure call are always legal. A full
6878 -- legality check is done when the actuals are resolved.
6883 -- Otherwise the context causes a side effect with respect to the
6884 -- effectively volatile object.
6886 else
6887 Error_Msg_N
6894 -------------------
6895 -- Resolve_Entry --
6896 -------------------
6908 -- If the bounds of the entry family being called depend on task
6909 -- discriminants, build a new index subtype where a discriminant is
6910 -- replaced with the value of the discriminant of the target task.
6911 -- The target task is the prefix of the entry name in the call.
6913 -----------------------
6914 -- Actual_Index_Type --
6915 -----------------------
6925 -- If the bound is given by a discriminant, replace with a reference
6926 -- to the discriminant of the same name in the target task. If the
6927 -- entry name is the target of a requeue statement and the entry is
6928 -- in the current protected object, the bound to be used is the
6929 -- discriminal of the object (see Apply_Range_Checks for details of
6930 -- the transformation).
6932 -----------------------------
6933 -- Actual_Discriminant_Ref --
6934 -----------------------------
6940 begin
6945 then
6951 then
6952 -- Note: here Bound denotes a discriminant of the corresponding
6953 -- record type tskV, whose discriminal is a formal of the
6954 -- init-proc tskVIP. What we want is the body discriminal,
6955 -- which is associated to the discriminant of the original
6956 -- concurrent type tsk.
6958 return New_Occurrence_Of
6961 else
6962 Ref :=
6972 -- Start of processing for Actual_Index_Type
6974 begin
6977 then
6980 else
6994 -- Start of processing of Resolve_Entry
6996 begin
6997 -- Find name of entry being called, and resolve prefix of name with its
6998 -- own type. The prefix can be overloaded, and the name and signature of
6999 -- the entry must be taken into account.
7003 -- Case of dealing with entry family within the current tasks
7007 else
7013 -- Entry call to an entry (or entry family) in the current task. This
7014 -- is legal even though the task will deadlock. Rewrite as call to
7015 -- current task.
7017 -- This can also be a call to an entry in an enclosing task. If this
7018 -- is a single task, we have to retrieve its name, because the scope
7019 -- of the entry is the task type, not the object. If the enclosing
7020 -- task is a task type, the identity of the task is given by its own
7021 -- self variable.
7023 -- Finally this can be a requeue on an entry of the same task or
7024 -- protected object.
7031 then
7032 -- S is an enclosing task or protected object. The concurrent
7033 -- declaration has been converted into a type declaration, and
7034 -- the object itself has an object declaration that follows
7035 -- the type in the same declarative part.
7047 -- Call to current task. Will be transformed into call to Self
7054 New_N :=
7057 Selector_Name =>
7064 then
7065 -- Use the entry name (which must be unique at this point) to find
7066 -- the prefix that returns the corresponding task/protected type.
7068 declare
7074 begin
7096 -- Up to this point the expression could have been the actual in a
7097 -- simple entry call, and be given by a named association.
7101 else
7107 ------------------------
7108 -- Resolve_Entry_Call --
7109 ------------------------
7121 begin
7122 -- We kill all checks here, because it does not seem worth the effort to
7123 -- do anything better, an entry call is a big operation.
7125 Kill_All_Checks;
7127 -- Processing of the name is similar for entry calls and protected
7128 -- operation calls. Once the entity is determined, we can complete
7129 -- the resolution of the actuals.
7131 -- The selector may be overloaded, in the case of a protected object
7132 -- with overloaded functions. The type of the context is used for
7133 -- resolution.
7138 then
7139 declare
7143 begin
7162 -- Simple entry call
7170 -- Call to member of entry family
7177 -- We cannot in general check the maximum depth of protected entry calls
7178 -- at compile time. But we can tell that any protected entry call at all
7179 -- violates a specified nesting depth of zero.
7185 -- Use context type to disambiguate a protected function that can be
7186 -- called without actuals and that returns an array type, and where the
7187 -- argument list may be an indexing of the returned value.
7192 and then
7198 and then
7199 Covers
7202 then
7203 declare
7206 begin
7207 Index_Node :=
7209 Prefix =>
7213 -- Since we are correcting a node classification error made by the
7214 -- parser, we call Replace rather than Rewrite.
7227 then
7228 -- Rewrite as call to the precondition wrapper, adding the task
7229 -- object to the list of actuals. If the call is to a member of an
7230 -- entry family, include the index as well.
7232 declare
7236 begin
7245 New_Call :=
7247 Name =>
7252 -- Preanalyze and resolve new call. Current procedure is called
7253 -- from Resolve_Call, after which expansion will take place.
7260 -- The operation name may have been overloaded. Order the actuals
7261 -- according to the formals of the resolved entity, and set the return
7262 -- type to that of the operation.
7273 -- Create a call reference to the entry
7281 -- Verify that a procedure call cannot masquerade as an entry
7282 -- call where an entry call is expected.
7287 then
7292 then
7297 then
7302 -- After resolution, entry calls and protected procedure calls are
7303 -- changed into entry calls, for expansion. The structure of the node
7304 -- does not change, so it can safely be done in place. Protected
7305 -- function calls must keep their structure because they are
7306 -- subexpressions.
7310 -- A protected operation that is not a function may modify the
7311 -- corresponding object, and cannot apply to a constant. If this
7312 -- is an internal call, the prefix is the type itself.
7318 then
7319 Error_Msg_N
7321 Entry_Name);
7335 -- Protected functions can return on the secondary stack, in which
7336 -- case we must trigger the transient scope mechanism.
7338 elsif Expander_Active
7340 then
7345 -------------------------
7346 -- Resolve_Equality_Op --
7347 -------------------------
7349 -- Both arguments must have the same type, and the boolean context does
7350 -- not participate in the resolution. The first pass verifies that the
7351 -- interpretation is not ambiguous, and the type of the left argument is
7352 -- correctly set, or is Any_Type in case of ambiguity. If both arguments
7353 -- are strings or aggregates, allocators, or Null, they are ambiguous even
7354 -- though they carry a single (universal) type. Diagnose this case here.
7362 -- The resolution rule for if expressions requires that each such must
7363 -- have a unique type. This means that if several dependent expressions
7364 -- are of a non-null anonymous access type, and the context does not
7365 -- impose an expected type (as can be the case in an equality operation)
7366 -- the expression must be rejected.
7369 -- Attempt to explain the nature of a redundant comparison with True. If
7370 -- the expression N is too complex, this routine issues a general error
7371 -- message.
7374 -- In the case of allocators and access attributes, the context must
7375 -- provide an indication of the specific access type to be used. If
7376 -- one operand is of such a "generic" access type, check whether there
7377 -- is a specific visible access type that has the same designated type.
7378 -- This is semantically dubious, and of no interest to any real code,
7379 -- but c48008a makes it all worthwhile.
7381 -------------------------
7382 -- Check_If_Expression --
7383 -------------------------
7389 begin
7396 then
7402 ------------------------
7403 -- Explain_Redundancy --
7404 ------------------------
7411 begin
7414 -- Strip the operand down to an entity
7416 loop
7419 else
7424 -- The construct denotes an entity
7429 -- Do not generate an error message when the comparison is done
7430 -- against the enumeration literal Standard.True.
7434 -- Build a customized error message
7461 -- The construct is too complex to disect, issue a general message
7463 else
7468 -----------------------------
7469 -- Find_Unique_Access_Type --
7470 -----------------------------
7477 begin
7479 E_Access_Attribute_Type)
7480 then
7484 E_Access_Attribute_Type)
7485 then
7487 else
7499 then
7512 -- Start of processing for Resolve_Equality_Op
7514 begin
7525 T = Any_Character
7526 then
7529 else
7538 then
7547 -- If expressions must have a single type, and if the context does
7548 -- not impose one the dependent expressions cannot be anonymous
7549 -- access types.
7551 -- Why no similar processing for case expressions???
7555 E_Anonymous_Access_Subprogram_Type)
7557 E_Anonymous_Access_Subprogram_Type)
7558 then
7566 -- In SPARK, equality operators = and /= for array types other than
7567 -- String are only defined when, for each index position, the
7568 -- operands have equal static bounds.
7572 -- Protect call to Matching_Static_Array_Bounds to avoid costly
7573 -- operation if not needed.
7581 then
7582 Check_SPARK_05_Restriction
7587 -- If the unique type is a class-wide type then it will be expanded
7588 -- into a dispatching call to the predefined primitive. Therefore we
7589 -- check here for potential violation of such restriction.
7595 if Warn_On_Redundant_Constructs
7600 then
7601 Error_Msg_N -- CODEFIX
7611 -- If this is an inequality, it may be the implicit inequality
7612 -- created for a user-defined operation, in which case the corres-
7613 -- ponding equality operation is not intrinsic, and the operation
7614 -- cannot be constant-folded. Else fold.
7619 or else Is_Intrinsic_Subprogram
7621 then
7627 then
7631 -- Ada 2005: If one operand is an anonymous access type, convert the
7632 -- other operand to it, to ensure that the underlying types match in
7633 -- the back-end. Same for access_to_subprogram, and the conversion
7634 -- verifies that the types are subtype conformant.
7636 -- We apply the same conversion in the case one of the operands is a
7637 -- private subtype of the type of the other.
7639 -- Why the Expander_Active test here ???
7641 if Expander_Active
7642 and then
7644 E_Anonymous_Access_Subprogram_Type)
7646 then
7666 ----------------------------------
7667 -- Resolve_Explicit_Dereference --
7668 ----------------------------------
7676 -- The candidate prefix type, if overloaded
7681 begin
7685 -- A useful optimization: check whether the dereference denotes an
7686 -- element of a container, and if so rewrite it as a call to the
7687 -- corresponding Element function.
7689 -- Disabled for now, on advice of ARG. A more restricted form of the
7690 -- predicate might be acceptable ???
7692 -- if Is_Container_Element (N) then
7693 -- return;
7694 -- end if;
7698 -- Use the context type to select the prefix that has the correct
7699 -- designated type. Keep the first match, which will be the inner-
7700 -- most.
7707 then
7712 -- Remove access types that do not match, but preserve access
7713 -- to subprogram interpretations, in case a further dereference
7714 -- is needed (see below).
7727 else
7728 -- If no interpretation covers the designated type of the prefix,
7729 -- this is the pathological case where not all implementations of
7730 -- the prefix allow the interpretation of the node as a call. Now
7731 -- that the expected type is known, Remove other interpretations
7732 -- from prefix, rewrite it as a call, and resolve again, so that
7733 -- the proper call node is generated.
7744 New_N :=
7746 Name =>
7757 -- If not overloaded, resolve P with its own type
7759 else
7767 -- If the designated type is a packed unconstrained array type, and the
7768 -- explicit dereference is not in the context of an attribute reference,
7769 -- then we must compute and set the actual subtype, since it is needed
7770 -- by Gigi. The reason we exclude the attribute case is that this is
7771 -- handled fine by Gigi, and in fact we use such attributes to build the
7772 -- actual subtype. We also exclude generated code (which builds actual
7773 -- subtypes directly if they are needed).
7780 then
7784 -- Note: No Eval processing is required for an explicit dereference,
7785 -- because such a name can never be static.
7789 -------------------------------------
7790 -- Resolve_Expression_With_Actions --
7791 -------------------------------------
7794 begin
7797 -- If N has no actions, and its expression has been constant folded,
7798 -- then rewrite N as just its expression. Note, we can't do this in
7799 -- the general case of Is_Empty_List (Actions (N)) as this would cause
7800 -- Expression (N) to be expanded again.
7804 then
7809 ----------------------------------
7810 -- Resolve_Generalized_Indexing --
7811 ----------------------------------
7819 begin
7820 -- In ASIS mode, propagate the information about the indices back to
7821 -- to the original indexing node. The generalized indexing is either
7822 -- a function call, or a dereference of one. The actuals include the
7823 -- prefix of the original node, which is the container expression.
7832 loop
7843 else
7849 ---------------------------
7850 -- Resolve_If_Expression --
7851 ---------------------------
7860 begin
7865 -- When the "then" expression is of a scalar subtype different from the
7866 -- result subtype, then insert a conversion to ensure the generation of
7867 -- a constraint check. The same is done for the else part below, again
7868 -- comparing subtypes rather than base types.
7872 then
7877 -- If ELSE expression present, just resolve using the determined type
7885 then
7890 -- If no ELSE expression is present, root type must be Standard.Boolean
7891 -- and we provide a Standard.True result converted to the appropriate
7892 -- Boolean type (in case it is a derived boolean type).
7895 Else_Expr :=
7900 else
7909 -------------------------------
7910 -- Resolve_Indexed_Component --
7911 -------------------------------
7919 begin
7927 -- Use the context type to select the prefix that yields the correct
7928 -- component type.
7930 declare
7937 begin
7944 and then
7945 Covers
7948 then
7957 else
7963 else
7974 else
7981 -- If prefix is access type, dereference to get real array type.
7982 -- Note: we do not apply an access check because the expander always
7983 -- introduces an explicit dereference, and the check will happen there.
7989 -- If name was overloaded, set component type correctly now
7990 -- If a misplaced call to an entry family (which has no index types)
7991 -- return. Error will be diagnosed from calling context.
7995 else
8002 -- The prefix may have resolved to a string literal, in which case its
8003 -- etype has a special representation. This is only possible currently
8004 -- if the prefix is a static concatenation, written in functional
8005 -- notation.
8010 else
8017 else
8028 -- Do not generate the warning on suspicious index if we are analyzing
8029 -- package Ada.Tags; otherwise we will report the warning with the
8030 -- Prims_Ptr field of the dispatch table.
8033 or else not
8035 Ada_Tags)
8036 then
8041 -- If the array type is atomic, and the component is not atomic, then
8042 -- this is worth a warning, since we have a situation where the access
8043 -- to the component may cause extra read/writes of the atomic array
8044 -- object, or partial word accesses, which could be unexpected.
8050 and then Has_Atomic_Components
8053 then
8061 -----------------------------
8062 -- Resolve_Integer_Literal --
8063 -----------------------------
8066 begin
8071 --------------------------------
8072 -- Resolve_Intrinsic_Operator --
8073 --------------------------------
8082 -- If the operand is a literal, it cannot be the expression in a
8083 -- conversion. Use a qualified expression instead.
8088 begin
8090 Res :=
8096 else
8103 -- Start of processing for Resolve_Intrinsic_Operator
8105 begin
8106 -- We must preserve the original entity in a generic setting, so that
8107 -- the legality of the operation can be verified in an instance.
8122 -- If the result or operand types are private, rewrite with unchecked
8123 -- conversions on the operands and the result, to expose the proper
8124 -- underlying numeric type.
8129 then
8131 -- Unchecked_Convert_To (Btyp, Left_Opnd (N));
8132 -- What on earth is this commented out fragment of code???
8136 else
8157 then
8158 -- Add explicit conversion where needed, and save interpretations in
8159 -- case operands are overloaded.
8166 else
8172 else
8182 else
8187 --------------------------------------
8188 -- Resolve_Intrinsic_Unary_Operator --
8189 --------------------------------------
8191 procedure Resolve_Intrinsic_Unary_Operator
8194 is
8199 begin
8218 else
8223 ------------------------
8224 -- Resolve_Logical_Op --
8225 ------------------------
8230 begin
8233 -- Predefined operations on scalar types yield the base type. On the
8234 -- other hand, logical operations on arrays yield the type of the
8235 -- arguments (and the context).
8239 else
8243 -- The following test is required because the operands of the operation
8244 -- may be literals, in which case the resulting type appears to be
8245 -- compatible with a signed integer type, when in fact it is compatible
8246 -- only with modular types. If the context itself is universal, the
8247 -- operation is illegal.
8255 Error_Msg_N
8263 then
8267 -- Replace AND by AND THEN, or OR by OR ELSE, if Short_Circuit_And_Or
8268 -- is active and the result type is standard Boolean (do not mess with
8269 -- ops that return a nonstandard Boolean type, because something strange
8270 -- is going on).
8272 -- Note: you might expect this replacement to be done during expansion,
8273 -- but that doesn't work, because when the pragma Short_Circuit_And_Or
8274 -- is used, no part of the right operand of an "and" or "or" operator
8275 -- should be executed if the left operand would short-circuit the
8276 -- evaluation of the corresponding "and then" or "or else". If we left
8277 -- the replacement to expansion time, then run-time checks associated
8278 -- with such operands would be evaluated unconditionally, due to being
8279 -- before the condition prior to the rewriting as short-circuit forms
8280 -- during expansion.
8282 if Short_Circuit_And_Or
8285 then
8293 -- Case of OR changed to OR ELSE
8295 else
8303 -- Return now, since analysis of the rewritten ops will take care of
8304 -- other reference bookkeeping and expression folding.
8319 -- In SPARK, logical operations AND, OR and XOR for arrays are defined
8320 -- only when both operands have same static lower and higher bounds. Of
8321 -- course the types have to match, so only check if operands are
8322 -- compatible and the node itself has no errors.
8326 then
8327 declare
8331 begin
8332 -- Protect call to Matching_Static_Array_Bounds to avoid costly
8333 -- operation if not needed.
8340 then
8341 Check_SPARK_05_Restriction
8350 ---------------------------
8351 -- Resolve_Membership_Op --
8352 ---------------------------
8354 -- The context can only be a boolean type, and does not determine the
8355 -- arguments. Arguments should be unambiguous, but the preference rule for
8356 -- universal types applies.
8366 -- Analysis has determined a unique type for the left operand. Use it to
8367 -- resolve the disjuncts.
8369 ----------------------------
8370 -- Resolve_Set_Membership --
8371 ----------------------------
8377 begin
8383 -- Alternative is an expression, a range
8384 -- or a subtype mark.
8388 then
8395 -- Check for duplicates for discrete case
8398 declare
8407 begin
8408 -- Loop checking duplicates. This is quadratic, but giant sets
8409 -- are unlikely in this context so it's a reasonable choice.
8416 N_Character_Literal)
8418 then
8436 -- Start of processing for Resolve_Membership_Op
8438 begin
8444 Resolve_Set_Membership;
8448 and then
8450 or else
8453 then
8456 -- Ada 2005 (AI-251): Support the following case:
8458 -- type I is interface;
8459 -- type T is tagged ...
8461 -- function Test (O : I'Class) is
8462 -- begin
8463 -- return O in T'Class.
8464 -- end Test;
8466 -- In this case we have nothing else to do. The membership test will be
8467 -- done at run time.
8474 then
8476 else
8480 -- If mixed-mode operations are present and operands are all literal,
8481 -- the only interpretation involves Duration, which is probably not
8482 -- the intention of the programmer.
8497 then
8503 else
8508 -- Here after resolving membership operation
8516 ------------------
8517 -- Resolve_Null --
8518 ------------------
8523 begin
8524 -- Handle restriction against anonymous null access values This
8525 -- restriction can be turned off using -gnatdj.
8527 -- Ada 2005 (AI-231): Remove restriction
8530 and then not Debug_Flag_J
8533 then
8534 -- In the common case of a call which uses an explicitly null value
8535 -- for an access parameter, give specialized error message.
8538 Error_Msg_N
8541 -- Standard message for all other cases (are there any?)
8543 else
8544 Error_Msg_N
8549 -- Ada 2005 (AI-231): Generate the null-excluding check in case of
8550 -- assignment to a null-excluding object
8555 then
8557 Insert_Action
8562 else
8569 -- In a distributed context, null for a remote access to subprogram may
8570 -- need to be replaced with a special record aggregate. In this case,
8571 -- return after having done the transformation.
8576 then
8580 -- The null literal takes its type from the context
8585 -----------------------
8586 -- Resolve_Op_Concat --
8587 -----------------------
8591 -- We wish to avoid deep recursion, because concatenations are often
8592 -- deeply nested, as in A&B&...&Z. Therefore, we walk down the left
8593 -- operands nonrecursively until we find something that is not a simple
8594 -- concatenation (A in this case). We resolve that, and then walk back
8595 -- up the tree following Parent pointers, calling Resolve_Op_Concat_Rest
8596 -- to do the rest of the work at each level. The Parent pointers allow
8597 -- us to avoid recursion, and thus avoid running out of memory. See also
8598 -- Sem_Ch4.Analyze_Concatenation, where a similar approach is used.
8603 begin
8604 -- The following code is equivalent to:
8606 -- Resolve_Op_Concat_First (NN, Typ);
8607 -- Resolve_Op_Concat_Arg (N, ...);
8608 -- Resolve_Op_Concat_Rest (N, Typ);
8610 -- where the Resolve_Op_Concat_Arg call recurses back here if the left
8611 -- operand is a concatenation.
8613 -- Walk down left operands
8615 loop
8624 -- Now (given the above example) NN is A&B and Op1 is A
8626 -- First resolve Op1 ...
8630 -- ... then walk NN back up until we reach N (where we started), calling
8631 -- Resolve_Op_Concat_Rest along the way.
8633 loop
8640 Check_SPARK_05_Restriction
8645 ---------------------------
8646 -- Resolve_Op_Concat_Arg --
8647 ---------------------------
8649 procedure Resolve_Op_Concat_Arg
8654 is
8658 begin
8660 if Is_Comp
8664 then
8666 else
8670 -- If both Array & Array and Array & Component are visible, there is a
8671 -- potential ambiguity that must be reported.
8676 then
8680 -- If the operation is user-defined and not overloaded use its
8681 -- profile. The operation may be a renaming, in which case it has
8682 -- been rewritten, and we want the original profile.
8687 then
8689 Etype
8693 -- Otherwise an aggregate may match both the array type and the
8694 -- component type.
8696 else
8701 else
8705 then
8706 declare
8711 begin
8716 -- Special-case the error message when the overloading is
8717 -- caused by a function that yields an array and can be
8718 -- called without parameters.
8723 Error_Msg_NE
8725 Error_Msg_NE
8729 else
8737 or else
8739 then
8740 Error_Msg_N -- CODEFIX
8758 else
8763 else
8767 -- Concatenation is restricted in SPARK: each operand must be either a
8768 -- string literal, the name of a string constant, a static character or
8769 -- string expression, or another concatenation. Arg cannot be a
8770 -- concatenation here as callers of Resolve_Op_Concat_Arg call it
8771 -- separately on each final operand, past concatenation operations.
8775 Check_SPARK_05_Restriction
8783 then
8784 Check_SPARK_05_Restriction
8788 -- Do not issue error on an operand that is neither a character nor a
8789 -- string, as the error is issued in Resolve_Op_Concat.
8791 else
8798 -----------------------------
8799 -- Resolve_Op_Concat_First --
8800 -----------------------------
8807 begin
8808 -- The parser folds an enormous sequence of concatenations of string
8809 -- literals into "" & "...", where the Is_Folded_In_Parser flag is set
8810 -- in the right operand. If the expression resolves to a predefined "&"
8811 -- operator, all is well. Otherwise, the parser's folding is wrong, so
8812 -- we give an error. See P_Simple_Expression in Par.Ch4.
8817 then
8832 ----------------------------
8833 -- Resolve_Op_Concat_Rest --
8834 ----------------------------
8840 begin
8849 -- If this is not a static concatenation, but the result is a string
8850 -- type (and not an array of strings) ensure that static string operands
8851 -- have their subtypes properly constructed.
8855 then
8861 ----------------------
8862 -- Resolve_Op_Expon --
8863 ----------------------
8868 begin
8869 -- Catch attempts to do fixed-point exponentiation with universal
8870 -- operands, which is a case where the illegality is not caught during
8871 -- normal operator analysis. This is not done in preanalysis mode
8872 -- since the tree is not fully decorated during preanalysis.
8883 then
8893 then
8900 then
8904 -- We do the resolution using the base type, because intermediate values
8905 -- in expressions are always of the base type, not a subtype of it.
8910 -- For integer types, right argument must be in Natural range
8925 -- Evaluate the exponentiation operator for dimensioned type
8928 else
8932 -- Set overflow checking bit. Much cleverer code needed here eventually
8933 -- and perhaps the Resolve routines should be separated for the various
8934 -- arithmetic operations, since they will need different processing. ???
8943 --------------------
8944 -- Resolve_Op_Not --
8945 --------------------
8951 -- This function determines if the parent node is a boolean operator or
8952 -- operation (comparison op, membership test, or short circuit form) and
8953 -- the not in question is the left operand of this operation. Note that
8954 -- if the not is in parens, then false is returned.
8956 -----------------------
8957 -- Parent_Is_Boolean --
8958 -----------------------
8961 begin
8965 else
8967 when N_Op_And |
8968 N_Op_Eq |
8969 N_Op_Ge |
8970 N_Op_Gt |
8971 N_Op_Le |
8972 N_Op_Lt |
8973 N_Op_Ne |
8974 N_Op_Or |
8975 N_Op_Xor |
8976 N_In |
8977 N_Not_In |
8978 N_And_Then |
8979 N_Or_Else =>
8989 -- Start of processing for Resolve_Op_Not
8991 begin
8992 -- Predefined operations on scalar types yield the base type. On the
8993 -- other hand, logical operations on arrays yield the type of the
8994 -- arguments (and the context).
8998 else
9002 -- Straightforward case of incorrect arguments
9009 -- Special case of probable missing parens
9013 Error_Msg_N
9016 else
9017 Error_Msg_N
9024 -- OK resolution of NOT
9026 else
9027 -- Warn if non-boolean types involved. This is a case like not a < b
9028 -- where a and b are modular, where we will get (not a) < b and most
9029 -- likely not (a < b) was intended.
9031 if Warn_On_Questionable_Missing_Parens
9033 and then Parent_Is_Boolean
9034 then
9038 -- Warn on double negation if checking redundant constructs
9040 if Warn_On_Redundant_Constructs
9045 then
9049 -- Complete resolution and evaluation of NOT
9059 -----------------------------
9060 -- Resolve_Operator_Symbol --
9061 -----------------------------
9063 -- Nothing to be done, all resolved already
9069 begin
9073 ----------------------------------
9074 -- Resolve_Qualified_Expression --
9075 ----------------------------------
9083 begin
9086 -- Protect call to Matching_Static_Array_Bounds to avoid costly
9087 -- operation if not needed.
9094 then
9095 Check_SPARK_05_Restriction
9099 -- A qualified expression requires an exact match of the type, class-
9100 -- wide matching is not allowed. However, if the qualifying type is
9101 -- specific and the expression has a class-wide type, it may still be
9102 -- okay, since it can be the result of the expansion of a call to a
9103 -- dispatching function, so we also have to check class-wideness of the
9104 -- type of the expression's original node.
9107 or else
9111 then
9115 -- If the target type is unconstrained, then we reset the type of the
9116 -- result from the type of the expression. For other cases, the actual
9117 -- subtype of the expression is the target type.
9121 then
9128 -- If we still have a qualified expression after the static evaluation,
9129 -- then apply a scalar range check if needed. The reason that we do this
9130 -- after the Eval call is that otherwise, the application of the range
9131 -- check may convert an illegal static expression and result in warning
9132 -- rather than giving an error (e.g Integer'(Integer'Last + 1)).
9139 ------------------------------
9140 -- Resolve_Raise_Expression --
9141 ------------------------------
9144 begin
9148 else
9153 -------------------
9154 -- Resolve_Range --
9155 -------------------
9162 -- Returns True if N is of the form X'First .. X'Last where X is the
9163 -- same entity for both attributes.
9165 --------------------
9166 -- First_Last_Ref --
9167 --------------------
9173 begin
9178 then
9179 declare
9182 begin
9186 then
9195 -- Start of processing for Resolve_Range
9197 begin
9202 -- Check for inappropriate range on unordered enumeration type
9206 -- Exclude X'First .. X'Last if X is the same entity for both
9208 and then not First_Last_Ref
9209 then
9211 Error_Msg_NE
9218 -- We have to check the bounds for being within the base range as
9219 -- required for a non-static context. Normally this is automatic and
9220 -- done as part of evaluating expressions, but the N_Range node is an
9221 -- exception, since in GNAT we consider this node to be a subexpression,
9222 -- even though in Ada it is not. The circuit in Sem_Eval could check for
9223 -- this, but that would put the test on the main evaluation path for
9224 -- expressions.
9229 -- Check for an ambiguous range over character literals. This will
9230 -- happen with a membership test involving only literals.
9238 -- If bounds are static, constant-fold them, so size computations are
9239 -- identical between front-end and back-end. Do not perform this
9240 -- transformation while analyzing generic units, as type information
9241 -- would be lost when reanalyzing the constant node in the instance.
9254 --------------------------
9255 -- Resolve_Real_Literal --
9256 --------------------------
9261 begin
9262 -- Special processing for fixed-point literals to make sure that the
9263 -- value is an exact multiple of small where this is required. We skip
9264 -- this for the universal real case, and also for generic types.
9270 then
9271 declare
9278 begin
9279 -- Case of literal is not an exact multiple of the Small
9283 -- For a source program literal for a decimal fixed-point type,
9284 -- this is statically illegal (RM 4.9(36)).
9289 then
9293 -- Generate a warning if literal from source
9296 and then Warn_On_Bad_Fixed_Value
9297 then
9298 Error_Msg_N
9300 N);
9303 -- Replace literal by a value that is the exact representation
9304 -- of a value of the type, i.e. a multiple of the small value,
9305 -- by truncation, since Machine_Rounds is false for all GNAT
9306 -- fixed-point types (RM 4.9(38)).
9316 -- In all cases, set the corresponding integer field
9322 -- Now replace the actual type by the expected type as usual
9328 -----------------------
9329 -- Resolve_Reference --
9330 -----------------------
9335 begin
9336 -- Replace general access with specific type
9344 -- If we are taking the reference of a volatile entity, then treat it as
9345 -- a potential modification of this entity. This is too conservative,
9346 -- but necessary because remove side effects can cause transformations
9347 -- of normal assignments into reference sequences that otherwise fail to
9348 -- notice the modification.
9355 --------------------------------
9356 -- Resolve_Selected_Component --
9357 --------------------------------
9372 -- Check whether this is the initialization of a component within an
9373 -- init proc (by assignment or call to another init proc). If true,
9374 -- there is no need for a discriminant check.
9376 --------------------
9377 -- Init_Component --
9378 --------------------
9381 begin
9382 return Inside_Init_Proc
9388 -- Start of processing for Resolve_Selected_Component
9390 begin
9393 -- Use the context type to select the prefix that has a selector
9394 -- of the correct name and type.
9402 else
9406 -- Locate selected component. For a private prefix the selector
9407 -- can denote a discriminant.
9411 -- The visible components of a class-wide type are those of
9412 -- the root type.
9422 then
9429 else
9433 Error_Msg_N
9438 else
9441 -- There may be an implicit dereference. Retrieve
9442 -- designated record type.
9446 else
9452 -- Resolution chooses the new interpretation.
9453 -- Find the component with the right name.
9458 loop
9475 -- There must be a legal interpretation at this point
9482 else
9483 -- Resolve prefix with its type
9488 -- Generate cross-reference. We needed to wait until full overloading
9489 -- resolution was complete to do this, since otherwise we can't tell if
9490 -- we are an lvalue or not.
9494 else
9498 -- If prefix is an access type, the node will be transformed into an
9499 -- explicit dereference during expansion. The type of the node is the
9500 -- designated type of that of the prefix.
9505 else
9509 -- Set flag for expander if discriminant check required
9516 and then not Init_Component
9517 then
9525 -- If the prefix is a record conversion, this may be a renamed
9526 -- discriminant whose bounds differ from those of the original
9527 -- one, so we must ensure that a range check is performed.
9532 then
9536 -- Note: No Eval processing is required, because the prefix is of a
9537 -- record type, or protected type, and neither can possibly be static.
9539 -- If the record type is atomic, and the component is non-atomic, then
9540 -- this is worth a warning, since we have a situation where the access
9541 -- to the component may cause extra read/writes of the atomic array
9542 -- object, or partial word accesses, both of which may be unexpected.
9548 then
9549 Error_Msg_N
9552 Error_Msg_N
9560 -------------------
9561 -- Resolve_Shift --
9562 -------------------
9569 begin
9570 -- We do the resolution using the base type, because intermediate values
9571 -- in expressions always are of the base type, not a subtype of it.
9584 ---------------------------
9585 -- Resolve_Short_Circuit --
9586 ---------------------------
9593 begin
9594 -- Ensure all actions associated with the left operand (e.g.
9595 -- finalization of transient controlled objects) are fully evaluated
9596 -- locally within an expression with actions. This is particularly
9597 -- helpful for coverage analysis. However this should not happen in
9598 -- generics.
9601 declare
9603 begin
9611 -- Set Comes_From_Source on L to preserve warnings for unset
9612 -- reference.
9621 -- Check for issuing warning for always False assert/check, this happens
9622 -- when assertions are turned off, in which case the pragma Assert/Check
9623 -- was transformed into:
9625 -- if False and then <condition> then ...
9627 -- and we detect this pattern
9629 if Warn_On_Assertion_Failure
9636 then
9637 declare
9640 begin
9641 -- Special handling of Asssert pragma
9645 then
9646 declare
9648 Original_Node
9649 (Expression
9652 begin
9653 -- Don't warn if original condition is explicit False,
9654 -- since obviously the failure is expected in this case.
9658 then
9661 -- Issue warning. We do not want the deletion of the
9662 -- IF/AND-THEN to take this message with it. We achieve this
9663 -- by making sure that the expanded code points to the Sloc
9664 -- of the expression, not the original pragma.
9666 else
9667 -- Note: Use Error_Msg_F here rather than Error_Msg_N.
9668 -- The source location of the expression is not usually
9669 -- the best choice here. For example, it gets located on
9670 -- the last AND keyword in a chain of boolean expressiond
9671 -- AND'ed together. It is best to put the message on the
9672 -- first character of the assertion, which is the effect
9673 -- of the First_Node call here.
9675 Error_Msg_F
9677 Expression
9682 -- Similar processing for Check pragma
9686 then
9687 -- Don't want to warn if original condition is explicit False
9689 declare
9691 Original_Node
9692 (Expression
9694 begin
9697 then
9700 -- Post warning
9702 else
9703 -- Again use Error_Msg_F rather than Error_Msg_N, see
9704 -- comment above for an explanation of why we do this.
9706 Error_Msg_F
9708 Expression
9716 -- Continue with processing of short circuit
9725 -------------------
9726 -- Resolve_Slice --
9727 -------------------
9736 begin
9739 -- Use the context type to select the prefix that yields the correct
9740 -- array type.
9742 declare
9749 begin
9757 then
9765 else
9770 else
9781 else
9791 -- If the prefix is an access to an unconstrained array, we must use
9792 -- the actual subtype of the object to perform the index checks. The
9793 -- object denoted by the prefix is implicit in the node, so we build
9794 -- an explicit representation for it in order to compute the actual
9795 -- subtype.
9800 declare
9804 begin
9815 then
9818 -- If the name is a selected component that depends on discriminants,
9819 -- build an actual subtype for it. This can happen only when the name
9820 -- itself is overloaded; otherwise the actual subtype is created when
9821 -- the selected component is analyzed.
9824 and then Full_Analysis
9826 then
9827 declare
9830 begin
9835 -- Maybe this should just be "else", instead of checking for the
9836 -- specific case of slice??? This is needed for the case where the
9837 -- prefix is an Image attribute, which gets expanded to a slice, and so
9838 -- has a constrained subtype which we want to use for the slice range
9839 -- check applied below (the range check won't get done if the
9840 -- unconstrained subtype of the 'Image is used).
9846 -- Obtain the type of the array index
9850 else
9854 -- If name was overloaded, set slice type correctly now
9858 -- Handle the generation of a range check that compares the array index
9859 -- against the discrete_range. The check is not applied to internally
9860 -- built nodes associated with the expansion of dispatch tables. Check
9861 -- that Ada.Tags has already been loaded to avoid extra dependencies on
9862 -- the unit.
9864 if Tagged_Type_Expansion
9870 then
9873 -- The discrete_range is specified by a subtype indication. Create a
9874 -- shallow copy and inherit the type, parent and source location from
9875 -- the discrete_range. This ensures that the range check is inserted
9876 -- relative to the slice and that the runtime exception points to the
9877 -- proper construct.
9886 -- The discrete_range is a regular range. Resolve the bounds and remove
9887 -- their side effects.
9889 else
9906 -- Check bad use of type with predicates
9908 declare
9911 begin
9914 then
9916 else
9921 Bad_Predicated_Subtype_Use
9926 -- Otherwise here is where we check suspicious indexes
9937 ----------------------------
9938 -- Resolve_String_Literal --
9939 ----------------------------
9950 begin
9951 -- For a string appearing in a concatenation, defer creation of the
9952 -- string_literal_subtype until the end of the resolution of the
9953 -- concatenation, because the literal may be constant-folded away. This
9954 -- is a useful optimization for long concatenation expressions.
9956 -- If the string is an aggregate built for a single character (which
9957 -- happens in a non-static context) or a is null string to which special
9958 -- checks may apply, we build the subtype. Wide strings must also get a
9959 -- string subtype if they come from a one character aggregate. Strings
9960 -- generated by attributes might be static, but it is often hard to
9961 -- determine whether the enclosing context is static, so we generate
9962 -- subtypes for them as well, thus losing some rarer optimizations ???
9963 -- Same for strings that come from a static conversion.
9965 Need_Check :=
9974 -- If the resolving type is itself a string literal subtype, we can just
9975 -- reuse it, since there is no point in creating another.
9981 and then not Need_Check
9983 N_Attribute_Reference,
9984 N_Qualified_Expression,
9985 N_Type_Conversion)
9986 then
9989 -- Do not generate a string literal subtype for the default expression
9990 -- of a formal parameter in GNATprove mode. This is because the string
9991 -- subtype is associated with the freezing actions of the subprogram,
9992 -- however freezing is disabled in GNATprove mode and as a result the
9993 -- subtype is unavailable.
9995 elsif GNATprove_Mode
9997 then
10000 -- Otherwise we must create a string literal subtype. Note that the
10001 -- whole idea of string literal subtypes is simply to avoid the need
10002 -- for building a full fledged array subtype for each literal.
10004 else
10010 or else Need_Check
10011 then
10018 then
10024 -- The validity of a null string has been checked in the call to
10025 -- Eval_String_Literal.
10030 -- Always accept string literal with component type Any_Character, which
10031 -- occurs in error situations and in comparisons of literals, both of
10032 -- which should accept all literals.
10037 -- If the type is bit-packed, then we always transform the string
10038 -- literal into a full fledged aggregate.
10043 -- Deal with cases of Wide_Wide_String, Wide_String, and String
10045 else
10046 -- For Standard.Wide_Wide_String, or any other type whose component
10047 -- type is Standard.Wide_Wide_Character, we know that all the
10048 -- characters in the string must be acceptable, since the parser
10049 -- accepted the characters as valid character literals.
10054 -- For the case of Standard.String, or any other type whose component
10055 -- type is Standard.Character, we must make sure that there are no
10056 -- wide characters in the string, i.e. that it is entirely composed
10057 -- of characters in range of type Character.
10059 -- If the string literal is the result of a static concatenation, the
10060 -- test has already been performed on the components, and need not be
10061 -- repeated.
10065 then
10069 -- If we are out of range, post error. This is one of the
10070 -- very few places that we place the flag in the middle of
10071 -- a token, right under the offending wide character. Not
10072 -- quite clear if this is right wrt wide character encoding
10073 -- sequences, but it's only an error message.
10075 Error_Msg
10082 -- For the case of Standard.Wide_String, or any other type whose
10083 -- component type is Standard.Wide_Character, we must make sure that
10084 -- there are no wide characters in the string, i.e. that it is
10085 -- entirely composed of characters in range of type Wide_Character.
10087 -- If the string literal is the result of a static concatenation,
10088 -- the test has already been performed on the components, and need
10089 -- not be repeated.
10093 then
10097 -- If we are out of range, post error. This is one of the
10098 -- very few places that we place the flag in the middle of
10099 -- a token, right under the offending wide character.
10101 -- This is not quite right, because characters in general
10102 -- will take more than one character position ???
10104 Error_Msg
10111 -- If the root type is not a standard character, then we will convert
10112 -- the string into an aggregate and will let the aggregate code do
10113 -- the checking. Standard Wide_Wide_Character is also OK here.
10115 else
10119 -- See if the component type of the array corresponding to the string
10120 -- has compile time known bounds. If yes we can directly check
10121 -- whether the evaluation of the string will raise constraint error.
10122 -- Otherwise we need to transform the string literal into the
10123 -- corresponding character aggregate and let the aggregate code do
10124 -- the checking.
10128 -- Check for the case of full range, where we are definitely OK
10134 -- Here the range is not the complete base type range, so check
10136 declare
10144 begin
10147 then
10153 then
10154 Apply_Compile_Time_Constraint_Error
10156 CE_Range_Check_Failed,
10167 -- If we got here we meed to transform the string literal into the
10168 -- equivalent qualified positional array aggregate. This is rather
10169 -- heavy artillery for this situation, but it is hard work to avoid.
10171 declare
10176 begin
10177 -- Build the character literals, we give them source locations that
10178 -- correspond to the string positions, which is a bit tricky given
10179 -- the possible presence of wide character escape sequences.
10193 -- Should we have a call to Skip_Wide here ???
10195 -- ??? else
10196 -- Skip_Wide (P);
10204 Expression =>
10211 -----------------------------
10212 -- Resolve_Type_Conversion --
10213 -----------------------------
10225 -- Set to False to suppress cases where we want to suppress the test
10226 -- for redundancy to avoid possible false positives on this warning.
10228 begin
10229 if not Conv_OK
10231 then
10235 -- If the Operand Etype is Universal_Fixed, then the conversion is
10236 -- never redundant. We need this check because by the time we have
10237 -- finished the rather complex transformation, the conversion looks
10238 -- redundant when it is not.
10243 -- If the operand is marked as Any_Fixed, then special processing is
10244 -- required. This is also a case where we suppress the test for a
10245 -- redundant conversion, since most certainly it is not redundant.
10250 -- Mixed-mode operation involving a literal. Context must be a fixed
10251 -- type which is applied to the literal subsequently.
10259 or else
10261 then
10262 -- Return if expression is ambiguous
10267 -- If nothing else, the available fixed type is Duration
10269 else
10273 -- Resolve the real operand with largest available precision
10277 else
10283 -- If the operand is a literal (it could be a non-static and
10284 -- illegal exponentiation) check whether the use of Duration
10285 -- is potentially inaccurate.
10290 then
10291 Error_Msg_N
10294 Error_Msg_N
10301 then
10304 else
10313 -- In SPARK, a type conversion between array types should be restricted
10314 -- to types which have matching static bounds.
10316 -- Protect call to Matching_Static_Array_Bounds to avoid costly
10317 -- operation if not needed.
10324 then
10325 Check_SPARK_05_Restriction
10329 -- In formal mode, the operand of an ancestor type conversion must be an
10330 -- object (not an expression).
10338 then
10344 -- Note: we do the Eval_Type_Conversion call before applying the
10345 -- required checks for a subtype conversion. This is important, since
10346 -- both are prepared under certain circumstances to change the type
10347 -- conversion to a constraint error node, but in the case of
10348 -- Eval_Type_Conversion this may reflect an illegality in the static
10349 -- case, and we would miss the illegality (getting only a warning
10350 -- message), if we applied the type conversion checks first.
10354 -- Even when evaluation is not possible, we may be able to simplify the
10355 -- conversion or its expression. This needs to be done before applying
10356 -- checks, since otherwise the checks may use the original expression
10357 -- and defeat the simplifications. This is specifically the case for
10358 -- elimination of the floating-point Truncation attribute in
10359 -- float-to-int conversions.
10363 -- If after evaluation we still have a type conversion, then we may need
10364 -- to apply checks required for a subtype conversion.
10366 -- Skip these type conversion checks if universal fixed operands
10367 -- operands involved, since range checks are handled separately for
10368 -- these cases (in the appropriate Expand routines in unit Exp_Fixd).
10374 then
10378 -- Issue warning for conversion of simple object to its own type. We
10379 -- have to test the original nodes, since they may have been rewritten
10380 -- by various optimizations.
10384 -- Here we test for a redundant conversion if the warning mode is
10385 -- active (and was not locally reset), and we have a type conversion
10386 -- from source not appearing in a generic instance.
10388 if Test_Redundant
10391 and then not In_Instance
10392 then
10396 -- If the node is part of a larger expression, the Target_Type
10397 -- may not be the original type of the node if the context is a
10398 -- condition. Recover original type to see if conversion is needed.
10402 then
10406 -- If we have an entity name, then give the warning if the entity
10407 -- is the right type, or if it is a loop parameter covered by the
10408 -- original type (that's needed because loop parameters have an
10409 -- odd subtype coming from the bounds).
10412 and then
10414 or else
10418 -- If not an entity, then type of expression must match
10421 then
10422 -- One more check, do not give warning if the analyzed conversion
10423 -- has an expression with non-static bounds, and the bounds of the
10424 -- target are static. This avoids junk warnings in cases where the
10425 -- conversion is necessary to establish staticness, for example in
10426 -- a case statement.
10430 then
10433 -- Finally, if this type conversion occurs in a context requiring
10434 -- a prefix, and the expression is a qualified expression then the
10435 -- type conversion is not redundant, since a qualified expression
10436 -- is not a prefix, whereas a type conversion is. For example, "X
10437 -- := T'(Funx(...)).Y;" is illegal because a selected component
10438 -- requires a prefix, but a type conversion makes it legal: "X :=
10439 -- T(T'(Funx(...))).Y;"
10441 -- In Ada 2012, a qualified expression is a name, so this idiom is
10442 -- no longer needed, but we still suppress the warning because it
10443 -- seems unfriendly for warnings to pop up when you switch to the
10444 -- newer language version.
10448 N_Indexed_Component,
10449 N_Selected_Component,
10450 N_Slice,
10451 N_Explicit_Dereference)
10452 then
10455 -- Never warn on conversion to Long_Long_Integer'Base since
10456 -- that is most likely an artifact of the extended overflow
10457 -- checking and comes from complex expanded code.
10462 -- Here we give the redundant conversion warning. If it is an
10463 -- entity, give the name of the entity in the message. If not,
10464 -- just mention the expression.
10466 -- Shoudn't we test Warn_On_Redundant_Constructs here ???
10468 else
10471 Error_Msg_NE -- CODEFIX
10474 else
10475 Error_Msg_NE
10483 -- Ada 2005 (AI-251): Handle class-wide interface type conversions.
10484 -- No need to perform any interface conversion if the type of the
10485 -- expression coincides with the target type.
10488 and then Expander_Active
10490 then
10491 declare
10495 begin
10496 -- If the type of the operand is a limited view, use the non-
10497 -- limited view when available.
10502 then
10518 -- Conversion from interface type
10522 -- Ada 2005 (AI-217): Handle entities from limited views
10526 Error_Msg_NE -- CODEFIX
10529 Error_Msg_N
10531 N);
10534 and then not
10537 then
10539 Error_Msg_NE -- CODEFIX
10542 Error_Msg_N
10544 N);
10546 else
10550 -- Conversion to interface type
10554 -- Handle subtypes
10561 or else Interface_Present_In_Ancestor
10564 then
10566 else
10569 Error_Msg_N
10577 -- Ada 2012: if target type has predicates, the result requires a
10578 -- predicate check. If the context is a call to another predicate
10579 -- check we must prevent infinite recursion.
10585 or else
10587 then
10590 else
10595 -- If at this stage we have a real to integer conversion, make sure
10596 -- that the Do_Range_Check flag is set, because such conversions in
10597 -- general need a range check. We only need this if expansion is off
10598 -- or we are in GNATProve mode.
10604 then
10609 ----------------------
10610 -- Resolve_Unary_Op --
10611 ----------------------
10620 begin
10623 Check_SPARK_05_Restriction
10627 -- Deal with intrinsic unary operators
10633 then
10638 -- Deal with universal cases
10641 or else
10643 then
10650 -- Generate warning for expressions like abs (x mod 2)
10652 if Warn_On_Redundant_Constructs
10654 then
10658 Error_Msg_N -- CODEFIX
10663 -- Deal with reference generation
10670 -- Set overflow checking bit. Much cleverer code needed here eventually
10671 -- and perhaps the Resolve routines should be separated for the various
10672 -- arithmetic operations, since they will need different processing ???
10680 -- Generate warning for expressions like -5 mod 3 for integers. No need
10681 -- to worry in the floating-point case, since parens do not affect the
10682 -- result so there is no point in giving in a warning.
10684 declare
10693 begin
10694 if Warn_On_Questionable_Missing_Parens
10698 then
10701 -- We are looking for cases where the right operand is not
10702 -- parenthesized, and is a binary operator, multiply, divide, or
10703 -- mod. These are the cases where the grouping can affect results.
10707 then
10708 -- For mod, we always give the warning, since the value is
10709 -- affected by the parenthesization (e.g. (-5) mod 315 /=
10710 -- -(5 mod 315)). But for the other cases, the only concern is
10711 -- overflow, e.g. for the case of 8 big signed (-(2 * 64)
10712 -- overflows, but (-2) * 64 does not). So we try to give the
10713 -- message only when overflow is possible.
10717 then
10722 else
10728 else
10732 -- Note that the test below is deliberately excluding the
10733 -- largest negative number, since that is a potentially
10734 -- troublesome case (e.g. -2 * x, where the result is the
10735 -- largest negative integer has an overflow with 2 * x).
10742 -- For the multiplication case, the only case we have to worry
10743 -- about is when (-a)*b is exactly the largest negative number
10744 -- so that -(a*b) can cause overflow. This can only happen if
10745 -- a is a power of 2, and more generally if any operand is a
10746 -- constant that is not a power of 2, then the parentheses
10747 -- cannot affect whether overflow occurs. We only bother to
10748 -- test the left most operand
10750 -- Loop looking at left operands for one that has known value
10757 -- Operand value of 0 or 1 skips warning
10762 -- Otherwise check power of 2, if power of 2, warn, if
10763 -- anything else, skip warning.
10765 else
10769 else
10778 -- Keep looking at left operands
10783 -- For rem or "/" we can only have a problematic situation
10784 -- if the divisor has a value of minus one or one. Otherwise
10785 -- overflow is impossible (divisor > 1) or we have a case of
10786 -- division by zero in any case.
10791 then
10795 -- If we fall through warning should be issued
10797 -- Shouldn't we test Warn_On_Questionable_Missing_Parens ???
10799 Error_Msg_N
10806 ----------------------------------
10807 -- Resolve_Unchecked_Expression --
10808 ----------------------------------
10810 procedure Resolve_Unchecked_Expression
10813 is
10814 begin
10819 ---------------------------------------
10820 -- Resolve_Unchecked_Type_Conversion --
10821 ---------------------------------------
10823 procedure Resolve_Unchecked_Type_Conversion
10826 is
10832 begin
10833 -- Resolve operand using its own type
10837 -- In an inlined context, the unchecked conversion may be applied
10838 -- to a literal, in which case its type is the type of the context.
10839 -- (In other contexts conversions cannot apply to literals).
10841 if In_Inlined_Body
10845 then
10853 ------------------------------
10854 -- Rewrite_Operator_As_Call --
10855 ------------------------------
10862 begin
10869 New_N :=
10880 ------------------------------
10881 -- Rewrite_Renamed_Operator --
10882 ------------------------------
10884 procedure Rewrite_Renamed_Operator
10888 is
10893 begin
10894 -- Do not perform this transformation within a pre/postcondition,
10895 -- because the expression will be re-analyzed, and the transformation
10896 -- might affect the visibility of the operator, e.g. in an instance.
10902 -- Rewrite the operator node using the real operator, not its renaming.
10903 -- Exclude user-defined intrinsic operations of the same name, which are
10904 -- treated separately and rewritten as calls.
10913 -- Indicate that both the original entity and its renaming are
10914 -- referenced at this point.
10925 -- If the context type is private, add the appropriate conversions so
10926 -- that the operator is applied to the full view. This is done in the
10927 -- routines that resolve intrinsic operators.
10931 then
10933 when N_Op_Add | N_Op_Subtract | N_Op_Multiply | N_Op_Divide |
10934 N_Op_Expon | N_Op_Mod | N_Op_Rem =>
10947 -- Operator renames a user-defined operator of the same name. Use the
10948 -- original operator in the node, which is the one Gigi knows about.
10955 -----------------------
10956 -- Set_Slice_Subtype --
10957 -----------------------
10959 -- Build an implicit subtype declaration to represent the type delivered by
10960 -- the slice. This is an abbreviated version of an array subtype. We define
10961 -- an index subtype for the slice, using either the subtype name or the
10962 -- discrete range of the slice. To be consistent with index usage elsewhere
10963 -- we create a list header to hold the single index. This list is not
10964 -- otherwise attached to the syntax tree.
10975 begin
10981 else
10982 -- We force the evaluation of a range. This is definitely needed in
10983 -- the renamed case, and seems safer to do unconditionally. Note in
10984 -- any case that since we will create and insert an Itype referring
10985 -- to this range, we must make sure any side effect removal actions
10986 -- are inserted before the Itype definition.
10992 -- If the discrete range is given by a subtype indication, the
10993 -- type of the slice is the base of the subtype mark.
10996 declare
10998 begin
11007 -- Take a new copy of Drange (where bounds have been rewritten to
11008 -- reference side-effect-free names). Using a separate tree ensures
11009 -- that further expansion (e.g. while rewriting a slice assignment
11010 -- into a FOR loop) does not attempt to remove side effects on the
11011 -- bounds again (which would cause the bounds in the index subtype
11012 -- definition to refer to temporaries before they are defined) (the
11013 -- reason is that some names are considered side effect free here
11014 -- for the subtype, but not in the context of a loop iteration
11015 -- scheme).
11036 -- The Etype of the existing Slice node is reset to this slice subtype.
11037 -- Its bounds are obtained from its first index.
11041 -- For packed slice subtypes, freeze immediately (except in the case of
11042 -- being in a "spec expression" where we never freeze when we first see
11043 -- the expression).
11048 -- For all other cases insert an itype reference in the slice's actions
11049 -- so that the itype is frozen at the proper place in the tree (i.e. at
11050 -- the point where actions for the slice are analyzed). Note that this
11051 -- is different from freezing the itype immediately, which might be
11052 -- premature (e.g. if the slice is within a transient scope). This needs
11053 -- to be done only if expansion is enabled.
11060 --------------------------------
11061 -- Set_String_Literal_Subtype --
11062 --------------------------------
11070 begin
11082 -- The low bound is set from the low bound of the corresponding index
11083 -- type. Note that we do not store the high bound in the string literal
11084 -- subtype, but it can be deduced if necessary from the length and the
11085 -- low bound.
11090 -- If the lower bound is not static we create a range for the string
11091 -- literal, using the index type and the known length of the literal.
11092 -- The index type is not necessarily Positive, so the upper bound is
11093 -- computed as T'Val (T'Pos (Low_Bound) + L - 1).
11095 else
11096 declare
11102 Prefix =>
11106 Left_Opnd =>
11109 Prefix =>
11111 Expressions =>
11113 Right_Opnd =>
11122 begin
11124 Set_String_Literal_Low_Bound
11127 else
11128 -- If the index type is an enumeration type, build bounds
11129 -- expression with attributes.
11131 Set_String_Literal_Low_Bound
11135 Prefix =>
11142 -- Build bona fide subtype for the string, and wrap it in an
11143 -- unchecked conversion, because the backend expects the
11144 -- String_Literal_Subtype to have a static lower bound.
11146 Index_Subtype :=
11153 -- In the context, the Index_Type may already have a constraint,
11154 -- so use common base type on string subtype. The base type may
11155 -- be used when generating attributes of the string, for example
11156 -- in the context of a slice assignment.
11181 ------------------------------
11182 -- Simplify_Type_Conversion --
11183 ------------------------------
11186 begin
11188 declare
11193 begin
11194 -- Special processing if the conversion is the expression of a
11195 -- Rounding or Truncation attribute reference. In this case we
11196 -- replace:
11198 -- ityp (ftyp'Rounding (x)) or ityp (ftyp'Truncation (x))
11200 -- by
11202 -- ityp (x)
11204 -- with the Float_Truncate flag set to False or True respectively,
11205 -- which is more efficient.
11208 and then
11214 Name_Truncation)
11215 then
11216 declare
11219 begin
11229 -----------------------------
11230 -- Unique_Fixed_Point_Type --
11231 -----------------------------
11240 -- Give error messages for true ambiguity. Messages are posted on node
11241 -- N, and entities T1, T2 are the possible interpretations.
11243 -----------------------
11244 -- Fixed_Point_Error --
11245 -----------------------
11248 begin
11254 -- Start of processing for Unique_Fixed_Point_Type
11256 begin
11257 -- The operations on Duration are visible, so Duration is always a
11258 -- possible interpretation.
11262 -- Look for fixed-point types in enclosing scopes
11271 then
11273 Fixed_Point_Error;
11275 else
11286 -- Look for visible fixed type declarations in the context
11297 then
11299 Fixed_Point_Error;
11301 else
11314 Error_Msg_NE
11316 else
11317 Error_Msg_NE
11324 ----------------------
11325 -- Valid_Conversion --
11326 ----------------------
11328 function Valid_Conversion
11333 is
11338 function Conversion_Check
11341 -- Little routine to post Msg if Valid is False, returns Valid value
11344 -- If Report_Errs, then calls Errout.Error_Msg_N with its arguments
11346 procedure Conversion_Error_NE
11350 -- If Report_Errs, then calls Errout.Error_Msg_NE with its arguments
11352 function Valid_Tagged_Conversion
11355 -- Specifically test for validity of tagged conversions
11358 -- Check index and component conformance, and accessibility levels if
11359 -- the component types are anonymous access types (Ada 2005).
11361 ----------------------
11362 -- Conversion_Check --
11363 ----------------------
11365 function Conversion_Check
11368 is
11369 begin
11370 if not Valid
11372 -- A generic unit has already been analyzed and we have verified
11373 -- that a particular conversion is OK in that context. Since the
11374 -- instance is reanalyzed without relying on the relationships
11375 -- established during the analysis of the generic, it is possible
11376 -- to end up with inconsistent views of private types. Do not emit
11377 -- the error message in such cases. The rest of the machinery in
11378 -- Valid_Conversion still ensures the proper compatibility of
11379 -- target and operand types.
11381 and then not In_Instance
11382 then
11389 ------------------------
11390 -- Conversion_Error_N --
11391 ------------------------
11394 begin
11400 -------------------------
11401 -- Conversion_Error_NE --
11402 -------------------------
11404 procedure Conversion_Error_NE
11408 is
11409 begin
11415 ----------------------------
11416 -- Valid_Array_Conversion --
11417 ----------------------------
11420 is
11435 begin
11436 -- Error if wrong number of dimensions
11438 if
11440 then
11441 Conversion_Error_N
11445 -- Number of dimensions matches
11447 else
11448 -- Loop through indexes of the two arrays
11456 -- Error if index types are incompatible
11462 then
11463 Conversion_Error_N
11465 Operand);
11473 -- If component types have same base type, all set
11478 -- Here if base types of components are not the same. The only
11479 -- time this is allowed is if we have anonymous access types.
11481 -- The conversion of arrays of anonymous access types can lead
11482 -- to dangling pointers. AI-392 formalizes the accessibility
11483 -- checks that must be applied to such conversions to prevent
11484 -- out-of-scope references.
11486 elsif Ekind_In
11488 E_Anonymous_Access_Subprogram_Type)
11490 and then
11492 then
11495 then
11498 Conversion_Error_N
11508 -- Conversion not allowed because of accessibility levels
11510 else
11511 Conversion_Error_N
11517 else
11521 -- All other cases where component base types do not match
11523 else
11524 Conversion_Error_N
11526 Operand);
11530 -- Check that component subtypes statically match. For numeric
11531 -- types this means that both must be either constrained or
11532 -- unconstrained. For enumeration types the bounds must match.
11533 -- All of this is checked in Subtypes_Statically_Match.
11535 if not Subtypes_Statically_Match
11537 then
11538 Conversion_Error_N
11547 -----------------------------
11548 -- Valid_Tagged_Conversion --
11549 -----------------------------
11551 function Valid_Tagged_Conversion
11554 is
11555 begin
11556 -- Upward conversions are allowed (RM 4.6(22))
11560 then
11563 -- Downward conversion are allowed if the operand is class-wide
11564 -- (RM 4.6(23)).
11568 then
11573 then
11574 return
11578 -- Ada 2005 (AI-251): The conversion to/from interface types is
11579 -- always valid
11584 -- If the operand is a class-wide type obtained through a limited_
11585 -- with clause, and the context includes the non-limited view, use
11586 -- it to determine whether the conversion is legal.
11592 then
11597 then
11600 else
11601 Conversion_Error_NE
11608 -- Start of processing for Valid_Conversion
11610 begin
11614 declare
11622 begin
11623 -- Remove procedure calls, which syntactically cannot appear in
11624 -- this context, but which cannot be removed by type checking,
11625 -- because the context does not impose a type.
11627 -- The node may be labelled overloaded, but still contain only one
11628 -- interpretation because others were discarded earlier. If this
11629 -- is the case, retain the single interpretation if legal.
11637 then
11638 -- More than one candidate interpretation is available
11646 -- When compiling for a system where Address is of a visible
11647 -- integer type, spurious ambiguities can be produced when
11648 -- arithmetic operations have a literal operand and return
11649 -- System.Address or a descendant of it. These ambiguities
11650 -- are usually resolved by the context, but for conversions
11651 -- there is no context type and the removal of the spurious
11652 -- operations must be done explicitly here.
11654 if not Address_Is_Private
11656 then
11681 Conversion_Error_N
11684 -- If the interpretation involves a standard operator, use
11685 -- the location of the type, which may be user-defined.
11689 else
11693 Conversion_Error_N -- CODEFIX
11698 else
11702 Conversion_Error_N -- CODEFIX
11714 -- Deal with conversion of integer type to address if the pragma
11715 -- Allow_Integer_Address is in effect. We convert the conversion to
11716 -- an unchecked conversion in this case and we are all done.
11724 -- If we are within a child unit, check whether the type of the
11725 -- expression has an ancestor in a parent unit, in which case it
11726 -- belongs to its derivation class even if the ancestor is private.
11727 -- See RM 7.3.1 (5.2/3).
11731 -- Numeric types
11735 -- A universal fixed expression can be converted to any numeric type
11740 -- Also no need to check when in an instance or inlined body, because
11741 -- the legality has been established when the template was analyzed.
11742 -- Furthermore, numeric conversions may occur where only a private
11743 -- view of the operand type is visible at the instantiation point.
11744 -- This results in a spurious error if we check that the operand type
11745 -- is a numeric type.
11747 -- Note: in a previous version of this unit, the following tests were
11748 -- applied only for generated code (Comes_From_Source set to False),
11749 -- but in fact the test is required for source code as well, since
11750 -- this situation can arise in source code.
11755 -- Otherwise we need the conversion check
11757 else
11758 return Conversion_Check
11760 or else
11766 -- Array types
11772 then
11773 Conversion_Error_N
11777 else
11781 -- Ada 2005 (AI-251): Anonymous access types where target references an
11782 -- interface type.
11785 E_Anonymous_Access_Type)
11787 then
11788 -- Check the static accessibility rule of 4.6(17). Note that the
11789 -- check is not enforced when within an instance body, since the
11790 -- RM requires such cases to be caught at run time.
11792 -- If the operand is a rewriting of an allocator no check is needed
11793 -- because there are no accessibility issues.
11801 then
11802 -- In an instance, this is a run-time check, but one we know
11803 -- will fail, so generate an appropriate warning. The raise
11804 -- will be generated by Expand_N_Type_Conversion.
11808 Conversion_Error_N
11810 Operand);
11813 else
11814 Conversion_Error_N
11816 Operand);
11820 -- Special accessibility checks are needed in the case of access
11821 -- discriminants declared for a limited type.
11825 then
11826 -- When the operand is a selected access discriminant the check
11827 -- needs to be made against the level of the object denoted by
11828 -- the prefix of the selected name (Object_Access_Level handles
11829 -- checking the prefix of the operand for this case).
11834 then
11835 -- In an instance, this is a run-time check, but one we know
11836 -- will fail, so generate an appropriate warning. The raise
11837 -- will be generated by Expand_N_Type_Conversion.
11841 Conversion_Error_N
11846 -- Real error if not in instance body
11848 else
11849 Conversion_Error_N
11856 -- The case of a reference to an access discriminant from
11857 -- within a limited type declaration (which will appear as
11858 -- a discriminal) is always illegal because the level of the
11859 -- discriminant is considered to be deeper than any (nameable)
11860 -- access type.
11864 and then
11867 then
11868 Conversion_Error_N
11870 Operand);
11878 -- General and anonymous access types
11881 E_Anonymous_Access_Type)
11882 and then
11883 Conversion_Check
11885 and then not
11887 E_Access_Protected_Subprogram_Type),
11889 then
11892 then
11893 Conversion_Error_N
11898 -- Check the static accessibility rule of 4.6(17). Note that the
11899 -- check is not enforced when within an instance body, since the RM
11900 -- requires such cases to be caught at run time.
11905 N_Object_Declaration
11906 then
11907 -- Ada 2012 (AI05-0149): Perform legality checking on implicit
11908 -- conversions from an anonymous access type to a named general
11909 -- access type. Such conversions are not allowed in the case of
11910 -- access parameters and stand-alone objects of an anonymous
11911 -- access type. The implicit conversion case is recognized by
11912 -- testing that Comes_From_Source is False and that it's been
11913 -- rewritten. The Comes_From_Source test isn't sufficient because
11914 -- nodes in inlined calls to predefined library routines can have
11915 -- Comes_From_Source set to False. (Is there a better way to test
11916 -- for implicit conversions???)
11923 then
11926 -- Implicit conversions aren't allowed for objects of an
11927 -- anonymous access type, since such objects have nonstatic
11928 -- levels in Ada 2012.
11931 N_Object_Declaration
11932 then
11933 Conversion_Error_N
11938 -- Implicit conversions aren't allowed for anonymous access
11939 -- parameters. The "not Is_Local_Anonymous_Access_Type" test
11940 -- is done to exclude anonymous access results.
11944 N_Function_Specification,
11945 N_Procedure_Specification)
11946 then
11947 Conversion_Error_N
11952 -- This is a case where there's an enclosing object whose
11953 -- to which the "statically deeper than" relationship does
11954 -- not apply (such as an access discriminant selected from
11955 -- a dereference of an access parameter).
11959 then
11960 Conversion_Error_N
11965 -- In other cases, the level of the operand's type must be
11966 -- statically less deep than that of the target type, else
11967 -- implicit conversion is disallowed (by RM12-8.6(27.1/3)).
11971 then
11972 Conversion_Error_N
11981 then
11982 -- In an instance, this is a run-time check, but one we know
11983 -- will fail, so generate an appropriate warning. The raise
11984 -- will be generated by Expand_N_Type_Conversion.
11988 Conversion_Error_N
11990 Operand);
11993 -- If not in an instance body, this is a real error
11995 else
11996 -- Avoid generation of spurious error message
11999 Conversion_Error_N
12001 Operand);
12007 -- Special accessibility checks are needed in the case of access
12008 -- discriminants declared for a limited type.
12012 then
12013 -- When the operand is a selected access discriminant the check
12014 -- needs to be made against the level of the object denoted by
12015 -- the prefix of the selected name (Object_Access_Level handles
12016 -- checking the prefix of the operand for this case).
12021 then
12022 -- In an instance, this is a run-time check, but one we know
12023 -- will fail, so generate an appropriate warning. The raise
12024 -- will be generated by Expand_N_Type_Conversion.
12028 Conversion_Error_N
12033 -- If not in an instance body, this is a real error
12035 else
12036 Conversion_Error_N
12043 -- The case of a reference to an access discriminant from
12044 -- within a limited type declaration (which will appear as
12045 -- a discriminal) is always illegal because the level of the
12046 -- discriminant is considered to be deeper than any (nameable)
12047 -- access type.
12050 and then
12053 then
12054 Conversion_Error_N
12056 Operand);
12062 -- In the presence of limited_with clauses we have to use non-limited
12063 -- views, if available.
12067 -- Helper function to handle limited views
12069 --------------------------
12070 -- Full_Designated_Type --
12071 --------------------------
12076 begin
12077 -- Handle the limited view of a type
12082 then
12084 else
12089 -- Local Declarations
12097 -- Start of processing for Check_Limited
12099 begin
12103 else
12105 Conversion_Error_NE
12110 -- Ada 2005 AI-384: legality rule is symmetric in both
12111 -- designated types. The conversion is legal (with possible
12112 -- constraint check) if either designated type is
12113 -- unconstrained.
12116 or else
12118 and then
12121 then
12122 -- Special case, if Value_Size has been used to make the
12123 -- sizes different, the conversion is not allowed even
12124 -- though the subtypes statically match.
12129 then
12130 Conversion_Error_NE
12133 Conversion_Error_NE
12138 -- Normal case where conversion is allowed
12140 else
12144 else
12145 Error_Msg_NE
12153 -- Access to subprogram types. If the operand is an access parameter,
12154 -- the type has a deeper accessibility that any master, and cannot be
12155 -- assigned. We must make an exception if the conversion is part of an
12156 -- assignment and the target is the return object of an extended return
12157 -- statement, because in that case the accessibility check takes place
12158 -- after the return.
12162 -- Note: this test of Opnd_Type is there to prevent entering this
12163 -- branch in the case of a remote access to subprogram type, which
12164 -- is internally represented as an E_Record_Type.
12167 then
12171 and then
12175 then
12176 Conversion_Error_N
12178 Operand);
12179 Conversion_Error_N
12182 Operand);
12184 Error_Msg_NE
12189 -- Check that the designated types are subtype conformant
12195 -- Check the static accessibility rule of 4.6(20)
12199 then
12200 Conversion_Error_N
12202 Operand);
12204 -- Check that if the operand type is declared in a generic body,
12205 -- then the target type must be declared within that same body
12206 -- (enforces last sentence of 4.6(20)).
12209 declare
12215 begin
12222 Conversion_Error_N
12231 -- Remote access to subprogram types
12235 then
12236 -- It is valid to convert from one RAS type to another provided
12237 -- that their specification statically match.
12239 -- Note: at this point, remote access to subprogram types have been
12240 -- expanded to their E_Record_Type representation, and we need to
12241 -- go back to the original access type definition using the
12242 -- Corresponding_Remote_Type attribute in order to check that the
12243 -- designated profiles match.
12248 Check_Subtype_Conformant
12251 Old_Id =>
12253 Err_Loc =>
12254 N);
12257 -- If it was legal in the generic, it's legal in the instance
12262 -- If both are tagged types, check legality of view conversions
12265 and then
12267 then
12270 -- Types derived from the same root type are convertible
12275 -- In an instance or an inlined body, there may be inconsistent views of
12276 -- the same type, or of types derived from a common root.
12279 and then
12282 then
12285 -- Special check for common access type error case
12289 then
12291 Conversion_Error_NE -- CODEFIX
12295 -- Here we have a real conversion error
12297 else
12298 Conversion_Error_NE