diff options
Diffstat (limited to 'gcc/ada/exp_ch4.adb')
| -rw-r--r-- | gcc/ada/exp_ch4.adb | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/gcc/ada/exp_ch4.adb b/gcc/ada/exp_ch4.adb index 6952665ce21..06c69b1fc36 100644 --- a/gcc/ada/exp_ch4.adb +++ b/gcc/ada/exp_ch4.adb @@ -1790,7 +1790,7 @@ package body Exp_Ch4 is -- components of the arrays. -- -- The actual way the code works is to return the comparison of - -- corresponding components for the N+1 call. That's neater! + -- corresponding components for the N+1 call. That's neater. function Test_Empty_Arrays return Node_Id; -- This function constructs the test for both arrays being empty @@ -4419,7 +4419,7 @@ package body Exp_Ch4 is Analyze_And_Resolve (N, PtrT); -- We set the variable as statically allocated, since we don't want - -- it going on the stack of the current procedure! + -- it going on the stack of the current procedure. Set_Is_Statically_Allocated (Temp); return; @@ -5727,7 +5727,7 @@ package body Exp_Ch4 is -- way we get all the processing above for an explicit range. -- Don't do this for predicated types, since in this case we - -- want to check the predicate! + -- want to check the predicate. elsif Is_Scalar_Type (Typ) then if No (Predicate_Function (Typ)) then @@ -6004,7 +6004,7 @@ package body Exp_Ch4 is -- If a predicate is present, then we do the predicate test, but we -- most certainly want to omit this if we are within the predicate - -- function itself, since otherwise we have an infinite recursion! + -- function itself, since otherwise we have an infinite recursion. -- The check should also not be emitted when testing against a range -- (the check is only done when the right operand is a subtype; see -- RM12-4.5.2 (28.1/3-30/3)). @@ -7151,7 +7151,7 @@ package body Exp_Ch4 is then -- Search for equality operation, checking that the operands -- have the same type. Note that we must find a matching entry, - -- or something is very wrong! + -- or something is very wrong. Prim := First_Elmt (Collect_Primitive_Operations (A_Typ)); @@ -9127,7 +9127,7 @@ package body Exp_Ch4 is and then Is_Constrained (Ptyp) then -- Do this optimization for discrete types only, and not for - -- access types (access discriminants get us into trouble!) + -- access types (access discriminants get us into trouble). if not Is_Discrete_Type (Etype (N)) then null; @@ -9135,7 +9135,7 @@ package body Exp_Ch4 is -- Don't do this on the left hand of an assignment statement. -- Normally one would think that references like this would not -- occur, but they do in generated code, and mean that we really - -- do want to assign the discriminant! + -- do want to assign the discriminant. elsif Nkind (Par) = N_Assignment_Statement and then Name (Par) = N @@ -9154,7 +9154,7 @@ package body Exp_Ch4 is -- Don't do this optimization if we are within the code for a -- discriminant check, since the whole point of such a check may - -- be to verify the condition on which the code below depends! + -- be to verify the condition on which the code below depends. elsif Is_In_Discriminant_Check (N) then null; @@ -9248,7 +9248,7 @@ package body Exp_Ch4 is return; -- Otherwise we can just copy the constraint, but the - -- result is certainly not static! In some cases the + -- result is certainly not static. In some cases the -- discriminant constraint has been analyzed in the -- context of the original subtype indication, but for -- itypes the constraint might not have been analyzed @@ -9961,7 +9961,7 @@ package body Exp_Ch4 is -- in Checks.Apply_Arithmetic_Overflow_Check, but we catch more cases in -- the processing here. Also we still need the Checks circuit, since we -- have to be sure not to generate junk overflow checks in the first - -- place, since it would be trick to remove them here! + -- place, since it would be trick to remove them here. if Integer_Promotion_Possible (N) then |