+2015-10-20 Arnaud Charlet <charlet@adacore.com>
+
+ * sem_aggr.adb, mlib-prj.adb, prep.adb, eval_fat.adb, rtsfind.adb,
+ freeze.adb, sem_util.adb, sem_res.adb, sem_attr.adb, gnatlink.adb,
+ par-ch6.adb, exp_tss.adb, exp_ch4.adb, s-shasto.adb, exp_fixd.adb,
+ sem_ch6.adb, clean.adb, sem_ch8.adb, sem_eval.adb, sem_ch9.adb: Fix
+ typos.
+
2015-10-20 Ed Schonberg <schonberg@adacore.com>
* sem_ch11.adb (Analyze_Handled_Statements): If the scope is a
Delete_File := False;
if (Project.Library_Kind = Static
- and then Name (1 .. Last) = Archive_Name)
+ and then Name (1 .. Last) = Archive_Name)
or else
((Project.Library_Kind = Dynamic
or else
-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
N_Procedure_Call_Statement)
or else (Nkind (Parnt) = N_Parameter_Association
and then
- Nkind (Parent (Parnt)) = N_Procedure_Call_Statement)
+ Nkind (Parent (Parnt)) = N_Procedure_Call_Statement)
then
return;
-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2013, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
else
Elmt := First_Elmt (TSS_Elist (FN));
while Present (Elmt) loop
- if Chars (Node (Elmt)) = Nam then
+ if Chars (Node (Elmt)) = Nam then
Subp := Node (Elmt);
-- For stream subprograms, the TSS entity may be a renaming-
-- the body is analyzed when the renamed entity is frozen, it may
-- be necessary to restore the proper scope (see package Exp_Ch13).
- if Nkind (N) = N_Subprogram_Renaming_Declaration
+ if Nkind (N) = N_Subprogram_Renaming_Declaration
and then Present (Corresponding_Spec (N))
then
Set_Corresponding_Spec (Body_Node, Corresponding_Spec (N));
new String'(Arg);
elsif Arg'Length /= 0 and then Arg (1) = '-' then
- if Arg'Length > 4 and then Arg (2 .. 5) = "gnat" then
+ if Arg'Length > 4 and then Arg (2 .. 5) = "gnat" then
Exit_With_Error
("invalid switch: """ & Arg & """ (gnat not needed here)");
end if;
-- --
-- B o d y --
-- --
--- Copyright (C) 2001-2014, AdaCore --
+-- Copyright (C) 2001-2015, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
Delete := False;
if (The_Build_Mode = Static
- and then Name (1 .. Last) = Archive_Name)
+ and then Name (1 .. Last) = Archive_Name)
or else
((The_Build_Mode = Dynamic
or else
-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- --
-- B o d y --
-- --
--- Copyright (C) 2002-2013, Free Software Foundation, Inc. --
+-- Copyright (C) 2002-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
begin
Clause := U.First_Implicit_With;
while Present (Clause) loop
- if Parent (Clause) = Cunit (Current_Sem_Unit) then
+ if Parent (Clause) = Cunit (Current_Sem_Unit) then
return;
end if;
-- --
-- B o d y --
-- --
--- Copyright (C) 1998-2014, Free Software Foundation, Inc. --
+-- Copyright (C) 1998-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- Release least recently used entry if we have to
- if Shared_Var_Files_Open = Max_Shared_Var_Files then
+ if Shared_Var_Files_Open = Max_Shared_Var_Files then
Freed := LRU_Head;
if Freed.Next /= null then
-- have already been inserted into the component
-- list of the current aggregate.
- if Nkind (Def_Node) = N_Record_Definition
+ if Nkind (Def_Node) = N_Record_Definition
and then Present (Component_List (Def_Node))
and then
Present
Check_E0;
Analyze (P);
- if Etype (P) = Standard_Exception_Type then
+ if Etype (P) = Standard_Exception_Type then
Set_Etype (N, RTE (RE_Exception_Id));
-- Ada 2005 (AI-345): Attribute 'Identity may be applied to task
function Is_Class_Wide_Default (D : Node_Id) return Boolean is
begin
return Is_Class_Wide_Type (Designated_Type (Etype (D)))
- or else (Nkind (D) = N_Attribute_Reference
+ or else (Nkind (D) = N_Attribute_Reference
and then Attribute_Name (D) = Name_Access
and then Is_Class_Wide_Type (Etype (Prefix (D))));
end Is_Class_Wide_Default;
function Entity_Of_Unit (U : Node_Id) return Entity_Id is
begin
- if Nkind (U) = N_Package_Instantiation
+ if Nkind (U) = N_Package_Instantiation
and then Analyzed (U)
then
return Defining_Entity (Instance_Spec (U));
Tasking_Used := True;
-- Entry_Name is initialized to Any_Id. It should get reset to the
- -- matching entry entity. An error is signalled if it is not reset
+ -- matching entry entity. An error is signalled if it is not reset.
Entry_Name := Any_Id;
-- The entity for the protected subprogram corresponding to the entry
-- has been created. We retain the name of this entity in the entry
-- body, for use when the corresponding subprogram body is created.
- -- Note that entry bodies have no corresponding_spec, and there is no
+ -- Note that entry bodies have no Corresponding_Spec, and there is no
-- easy link back in the tree between the entry body and the entity for
-- the entry itself, which is why we must propagate some attributes
-- explicitly from spec to body.
-- are no language-defined aspects that apply to a protected body, it is
-- not worth changing the whole expansion to accomodate implementation-
-- defined aspects. Plus we cannot possibly known the semantics of such
- -- future implementation defined aspects in order to plan ahead.
+ -- future implementation-defined aspects in order to plan ahead.
if Has_Aspects (N) then
Error_Msg_N
-- Case where call to predicate function appears on its own (this means
-- that the predicate at this level is just inherited from the parent).
- elsif Nkind (Expr) = N_Function_Call then
+ elsif Nkind (Expr) = N_Function_Call then
declare
Typ : constant Entity_Id :=
Etype (First_Formal (Entity (Name (Expr))));
-- Use CASE statement or array???
if Is_Binary then
- if Op_Name = Name_Op_And then
+ if Op_Name = Name_Op_And then
Kind := N_Op_And;
- elsif Op_Name = Name_Op_Or then
+ elsif Op_Name = Name_Op_Or then
Kind := N_Op_Or;
- elsif Op_Name = Name_Op_Xor then
+ elsif Op_Name = Name_Op_Xor then
Kind := N_Op_Xor;
- elsif Op_Name = Name_Op_Eq then
+ elsif Op_Name = Name_Op_Eq then
Kind := N_Op_Eq;
- elsif Op_Name = Name_Op_Ne then
+ elsif Op_Name = Name_Op_Ne then
Kind := N_Op_Ne;
- elsif Op_Name = Name_Op_Lt then
+ elsif Op_Name = Name_Op_Lt then
Kind := N_Op_Lt;
- elsif Op_Name = Name_Op_Le then
+ elsif Op_Name = Name_Op_Le then
Kind := N_Op_Le;
- elsif Op_Name = Name_Op_Gt then
+ elsif Op_Name = Name_Op_Gt then
Kind := N_Op_Gt;
- elsif Op_Name = Name_Op_Ge then
+ elsif Op_Name = Name_Op_Ge then
Kind := N_Op_Ge;
- elsif Op_Name = Name_Op_Add then
+ elsif Op_Name = Name_Op_Add then
Kind := N_Op_Add;
- elsif Op_Name = Name_Op_Subtract then
+ elsif Op_Name = Name_Op_Subtract then
Kind := N_Op_Subtract;
- elsif Op_Name = Name_Op_Concat then
+ elsif Op_Name = Name_Op_Concat then
Kind := N_Op_Concat;
- elsif Op_Name = Name_Op_Multiply then
+ elsif Op_Name = Name_Op_Multiply then
Kind := N_Op_Multiply;
- elsif Op_Name = Name_Op_Divide then
+ elsif Op_Name = Name_Op_Divide then
Kind := N_Op_Divide;
- elsif Op_Name = Name_Op_Mod then
+ elsif Op_Name = Name_Op_Mod then
Kind := N_Op_Mod;
- elsif Op_Name = Name_Op_Rem then
+ elsif Op_Name = Name_Op_Rem then
Kind := N_Op_Rem;
- elsif Op_Name = Name_Op_Expon then
+ elsif Op_Name = Name_Op_Expon then
Kind := N_Op_Expon;
else
raise Program_Error;
-- Unary operators
else
- if Op_Name = Name_Op_Add then
+ if Op_Name = Name_Op_Add then
Kind := N_Op_Plus;
- elsif Op_Name = Name_Op_Subtract then
+ elsif Op_Name = Name_Op_Subtract then
Kind := N_Op_Minus;
- elsif Op_Name = Name_Op_Abs then
+ elsif Op_Name = Name_Op_Abs then
Kind := N_Op_Abs;
- elsif Op_Name = Name_Op_Not then
+ elsif Op_Name = Name_Op_Not then
Kind := N_Op_Not;
else
raise Program_Error;
-- appearing within a variant.
if Has_Discriminants (T)
- and then Ekind (Entity (S)) = E_Component
+ and then Ekind (Entity (S)) = E_Component
and then Present (Original_Record_Component (Entity (S)))
and then Ekind (Original_Record_Component (Entity (S))) = E_Component
and then
-- occurrence of 'Old in that operand is potentially unevaluated.
-- See Sem_ch13.adb for details of this transformation.
- if Nkind (Original_Node (Par)) = N_And_Then then
+ if Nkind (Original_Node (Par)) = N_And_Then then
return True;
end if;
and then Present (Next_Named_Actual (Old_E))
then
if First_Named_Actual (Old_Node)
- = Explicit_Actual_Parameter (Old_E)
+ = Explicit_Actual_Parameter (Old_E)
then
Set_First_Named_Actual
(New_Node, Explicit_Actual_Parameter (New_E));