+2015-10-20 Arnaud Charlet <charlet@adacore.com>
+
+ * s-valllu.adb, sem_ch3.adb, layout.adb, a-crbtgo.adb, exp_ch9.adb,
+ make.adb, g-diopit.adb, s-valuns.adb, sem_ch9.adb, sem_ch10.adb,
+ sem_ch12.adb, a-tifiio.adb, g-dynhta.adb, uintp.adb,
+ sem_util.adb, sem_res.adb, s-htable.adb, exp_tss.adb, s-soflin.ads,
+ exp_ch6.adb, sem_ch6.adb, a-rbtgbo.adb, par-ch12.adb, sem_ch8.adb,
+ sem_eval.adb, mdll.adb, par-ch5.adb, s-poosiz.adb, sem_ch4.adb,
+ a-ngelfu.adb, s-taspri-solaris.ads, a-cforse.adb: Fix typos.
+
2015-10-20 Arnaud Charlet <charlet@adacore.com>
* sem_aggr.adb, mlib-prj.adb, prep.adb, eval_fat.adb, rtsfind.adb,
-------------------
function First_Element (Container : Set) return Element_Type is
- Fst : constant Count_Type := First (Container).Node;
+ Fst : constant Count_Type := First (Container).Node;
begin
if Fst = 0 then
raise Constraint_Error with "set is empty";
and then Color (X) = Black
loop
if X = Left (Parent (X)) then
- W := Right (Parent (X));
+ W := Right (Parent (X));
if Color (W) = Red then
Set_Color (W, Black);
else
pragma Assert (X = Right (Parent (X)));
- W := Left (Parent (X));
+ W := Left (Parent (X));
if Color (W) = Red then
Set_Color (W, Black);
then
Int_Part := Integer (Float_Type'Base'Truncation (A_Right));
Result := Left ** Int_Part;
- Rest := A_Right - Float_Type'Base (Int_Part);
+ Rest := A_Right - Float_Type'Base (Int_Part);
-- Compute with two leading bits of the mantissa using
-- square roots. Bound to be better than logarithms, and
Rest := Rest - 0.25;
end if;
- Result := Result *
+ Result := Result *
Float_Type'Base (Aux.Pow (Double (Left), Double (Rest)));
if Right >= 0.0 then
X := Node;
while X /= Tree.Root and then Color (N (X)) = Black loop
if X = Left (N (Parent (N (X)))) then
- W := Right (N (Parent (N (X))));
+ W := Right (N (Parent (N (X))));
if Color (N (W)) = Red then
Set_Color (N (W), Black);
else
pragma Assert (X = Right (N (Parent (N (X)))));
- W := Left (N (Parent (N (X))));
+ W := Left (N (Parent (N (X))));
if Color (N (W)) = Red then
Set_Color (N (W), Black);
-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2012, 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- --
-- The final expression for D is
- -- D := Integer'Max (-18, Integer'Min (Aft, 18 - (Fore - 1)));
+ -- D := Integer'Max (-18, Integer'Min (Aft, 18 - (Fore - 1)));
-- For Y and Z the following expressions can be derived:
Reset_Analyzed_Flags (Lhs);
else
- Lhs := New_Occurrence_Of (Var, Loc);
+ Lhs := New_Occurrence_Of (Var, Loc);
end if;
Set_Assignment_OK (Lhs);
declare
Decls : List_Id;
- Obj_Ptr : constant Entity_Id := Make_Temporary (Loc, 'T');
+ Obj_Ptr : constant Entity_Id := Make_Temporary (Loc, 'T');
begin
Decls := New_List (
-- Create the inner block to protect the abortable part
- Hdle := New_List (Build_Abort_Block_Handler (Loc));
+ Hdle := New_List (Build_Abort_Block_Handler (Loc));
Prepend_To (Astats,
Make_Procedure_Call_Statement (Loc,
begin
loop
Btyp := Base_Type (Btyp);
- Proc := TSS (Btyp, Nam);
+ Proc := TSS (Btyp, Nam);
exit when Present (Proc)
or else not Is_Derived_Type (Btyp);
-- --
-- B o d y --
-- --
--- Copyright (C) 2001-2010, 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- --
then
-- Starting with "<drive>:\"
- DS := Strings.Fixed.Index
- (SP (SP'First + 3 .. SP'Last), Dir_Seps);
+ DS := Strings.Fixed.Index
+ (SP (SP'First + 3 .. SP'Last), Dir_Seps);
if DS = 0 then
-- --
-- B o d y --
-- --
--- Copyright (C) 2002-2014, AdaCore --
+-- Copyright (C) 2002-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- --
else
loop
- Next_Elmt := Next (Elmt);
+ Next_Elmt := Next (Elmt);
if Next_Elmt = Null_Ptr then
return;
-- represents them the same way.
if Is_Access_Type (E) then
- Desig_Type := Underlying_Type (Designated_Type (E));
+ Desig_Type := Underlying_Type (Designated_Type (E));
-- If we only have a limited view of the type, see whether the
-- non-limited view is available.
Get_Name_String (ALI_File);
Link_Args (1) := new String'(Name_Buffer (1 .. Name_Len));
- Link_Args (2 .. Args'Length + 1) := Args;
+ Link_Args (2 .. Args'Length + 1) := Args;
GNAT.OS_Lib.Normalize_Arguments (Link_Args);
-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2007, 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- --
Adr_Opt'Unchecked_Access & All_Options;
begin
if Map_File then
- Params := Map_Opt'Unchecked_Access & Params;
+ Params := Map_Opt'Unchecked_Access & Params;
end if;
Utl.Gcc (Output_File => Dll_File,
when Tok_Not =>
if P_Null_Exclusion then
- Typedef_Node := P_Access_Type_Definition;
+ Typedef_Node := P_Access_Type_Definition;
Set_Null_Exclusion_Present (Typedef_Node);
return Typedef_Node;
-- --
-- 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- --
Node1 : Node_Id;
begin
- Node1 := New_Node (N_Iterator_Specification, Sloc (Def_Id));
+ Node1 := New_Node (N_Iterator_Specification, Sloc (Def_Id));
Set_Defining_Identifier (Node1, Def_Id);
if Token = Tok_Colon then
-- --
-- B o d y --
-- --
--- Copyright (C) 1995-2013, AdaCore --
+-- Copyright (C) 1995-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- --
else
loop
- Next_Elmt := Next (Elmt);
+ Next_Elmt := Next (Elmt);
if Next_Elmt = Null_Ptr then
return;
-- --
-- B o d y --
-- --
--- Copyright (C) 1992-2009, 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- --
function To_Storage_Count_Access is
new Ada.Unchecked_Conversion (Address, Storage_Count_Access);
- SC_Size : constant := SSE.Storage_Count'Object_Size / System.Storage_Unit;
+ SC_Size : constant := SSE.Storage_Count'Object_Size / System.Storage_Unit;
package Variable_Size_Management is
procedure Enter_Master_NT;
procedure Complete_Master_NT;
- Current_Master : Get_Integer_Call := Current_Master_NT'Access;
- Enter_Master : No_Param_Proc := Enter_Master_NT'Access;
- Complete_Master : No_Param_Proc := Complete_Master_NT'Access;
+ Current_Master : Get_Integer_Call := Current_Master_NT'Access;
+ Enter_Master : No_Param_Proc := Enter_Master_NT'Access;
+ Complete_Master : No_Param_Proc := Complete_Master_NT'Access;
----------------------
-- Delay Soft-Links --
-- --
-- S p e c --
-- --
--- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
+-- Copyright (C) 1992-2015, Free Software Foundation, Inc. --
-- --
-- GNARL 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- --
type Lock is record
L : aliased Base_Lock;
Ceiling : System.Any_Priority := System.Any_Priority'First;
- Saved_Priority : System.Any_Priority := System.Any_Priority'First;
+ Saved_Priority : System.Any_Priority := System.Any_Priority'First;
Owner : Owner_ID;
Next : Lock_Ptr;
Level : Private_Task_Serial_Number := 0;
-- --
-- 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- --
if Base not in 2 .. 16 then
Overflow := True;
- Base := 16;
+ Base := 16;
end if;
-- Scan out based integer
-- --
-- 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- --
if Base not in 2 .. 16 then
Overflow := True;
- Base := 16;
+ Base := 16;
end if;
-- Scan out based integer
-- visible, so analyze the declaration for B now, in case it
-- has not been done yet.
- Ent := Entity (Selector_Name (Nam));
+ Ent := Entity (Selector_Name (Nam));
Analyze
(Parent
(Unit_Declaration_Node (Entity (Selector_Name (Nam)))));
elsif No (Selector_Name (Actual)) then
Found_Assoc := Actual;
- Act := Explicit_Generic_Actual_Parameter (Actual);
+ Act := Explicit_Generic_Actual_Parameter (Actual);
Num_Matched := Num_Matched + 1;
Next (Actual);
Set_Etype (Selector_Name (Actual), Etype (A_F));
Generate_Reference (A_F, Selector_Name (Actual));
Found_Assoc := Actual;
- Act := Explicit_Generic_Actual_Parameter (Actual);
+ Act := Explicit_Generic_Actual_Parameter (Actual);
Num_Matched := Num_Matched + 1;
exit;
end if;
New_Copy_Tree (Name (Defining_Unit_Name (N))),
Defining_Identifier => Act_Decl_Id);
else
- Act_Decl_Name := Act_Decl_Id;
+ Act_Decl_Name := Act_Decl_Id;
end if;
-- Case of instantiation of a formal package
Name => New_Copy_Tree (Name (Defining_Unit_Name (Act_Spec))),
Defining_Identifier => Act_Body_Id);
else
- Act_Body_Name := Act_Body_Id;
+ Act_Body_Name := Act_Body_Id;
end if;
Set_Defining_Unit_Name (Act_Body, Act_Body_Name);
if ASIS_Mode then
declare
- Typ : constant Entity_Id := Make_Temporary (Loc, 'S');
+ Typ : constant Entity_Id := Make_Temporary (Loc, 'S');
begin
if Nkind (Spec) = N_Access_Function_Definition then
-- The index is given by a subtype with a range constraint
- T := Base_Type (Entity (Subtype_Mark (N)));
+ T := Base_Type (Entity (Subtype_Mark (N)));
if not Is_Discrete_Type (T) then
Error_Msg_N ("discrete type required for range", N);
R : Node_Id;
Subt : Entity_Id)
is
- Kind : constant Entity_Kind := Ekind (Def_Id);
+ Kind : constant Entity_Kind := Ekind (Def_Id);
begin
-- Defend against previous error
-- Before analysis, a function call appears as an indexed component
-- if there are no named associations.
- elsif Nkind (Parent_Node) = N_Indexed_Component
+ elsif Nkind (Parent_Node) = N_Indexed_Component
and then N = Prefix (Parent_Node)
then
Node_To_Replace := Parent_Node;
Set_Default_Value (Formal, Expression (Param_Spec));
if Present (Expression (Param_Spec)) then
- Default := Expression (Param_Spec);
+ Default := Expression (Param_Spec);
if Is_Scalar_Type (Etype (Default)) then
if Nkind (Parameter_Type (Param_Spec)) /=
S : Entity_Id;
begin
for J in reverse 1 .. Scope_Stack.Last loop
- S := Scope_Stack.Table (J).Entity;
+ S := Scope_Stack.Table (J).Entity;
Write_Int (Int (S));
Write_Str (" === ");
Write_Name (Chars (S));
for J in reverse 0 .. Scope_Stack.Last loop
Task_Nam := Scope_Stack.Table (J).Entity;
exit when Ekind (Etype (Task_Nam)) = E_Task_Type;
- Kind := Ekind (Task_Nam);
+ Kind := Ekind (Task_Nam);
if Kind /= E_Block and then Kind /= E_Loop
and then not Is_Entry (Task_Nam)
-- case of a concatenation of a series of string literals.
if Nkind (Left_Str) = N_String_Literal then
- Left_Len := String_Length (Strval (Left_Str));
+ Left_Len := String_Length (Strval (Left_Str));
-- If the left operand is the empty string, and the right operand
-- is a string literal (the case of "" & "..."), the result is the
declare
Pref : constant Node_Id := Prefix (Entry_Name);
- Ent : constant Entity_Id := Entity (Selector_Name (Entry_Name));
+ Ent : constant Entity_Id := Entity (Selector_Name (Entry_Name));
I : Interp_Index;
It : Interp;
else pragma Assert (Nkind (Entry_Name) = N_Indexed_Component);
Nam := Entity (Selector_Name (Prefix (Entry_Name)));
Resolve (Prefix (Prefix (Entry_Name)));
- Index := First (Expressions (Entry_Name));
+ Index := First (Expressions (Entry_Name));
Resolve (Index, Entry_Index_Type (Nam));
-- Up to this point the expression could have been the actual in a
if Present (It.Typ) then
N1 := It1.Nam;
T1 := It1.Typ;
- It1 := Disambiguate (Operand, I1, I, Any_Type);
+ It1 := Disambiguate (Operand, I1, I, Any_Type);
if It1 = No_Interp then
Conversion_Error_N
D := First_Elmt (Discriminant_Constraint (Desig_Typ));
while Present (D) loop
if Denotes_Discriminant (Node (D)) then
- D_Val := Make_Selected_Component (Loc,
+ D_Val := Make_Selected_Component (Loc,
Prefix => New_Copy_Tree (P),
Selector_Name => New_Occurrence_Of (Entity (Node (D)), Loc));
("Operation First for iterable type must be unique", Aspect);
return Any_Type;
else
- Cursor := Etype (Func);
+ Cursor := Etype (Func);
end if;
end if;
-- --
-- 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- --
-- Use prior single precision steps to compute this Euclid step
-- For constructs such as:
- -- sqrt_2: constant := 1.41421_35623_73095_04880_16887_24209_698;
+ -- sqrt_2: constant := 1.41421_35623_73095_04880_16887_24209_698;
-- sqrt_eps: constant long_float := long_float( 1.0 / sqrt_2)
-- ** long_float'machine_mantissa;
--
projects / gcc.git / commitdiff