Skip to content

R
riscv-gcc-1
Commit d781a615 by Arnaud Charlet
Options

[multiple changes] 

2011-12-21  Arnaud Charlet  <charlet@adacore.com>

	* comperr.adb (Delete_SCIL_Files): Also delete .scilx files.
	Fix implementation for child packages and package specs.
	(Delete_SCIL_Files.Decode_Name_Buffer): New function.

2011-12-21  Robert Dewar  <dewar@adacore.com>

	* err_vars.ads, a-cdlili.adb, a-cfdlli.ads, prj.adb, prj-nmsc.adb,
	a-cbdlli.adb, a-cbdlli.ads, a-cfdlli.adb: Minor reformatting.

2011-12-21  Vincent Pucci  <pucci@adacore.com>

	* s-diflio.adb, s-diflio.ads, s-diinio.adb, s-diinio.ads,
	s-llflex.ads: Fix header.

From-SVN: r182578
parent dea1d3dc
Showing with 160 additions and 73 deletions
gcc/ada/ChangeLog
2011-12-21 Arnaud Charlet <charlet@adacore.com>
* comperr.adb (Delete_SCIL_Files): Also delete .scilx files.
Fix implementation for child packages and package specs.
(Delete_SCIL_Files.Decode_Name_Buffer): New function.
2011-12-21 Robert Dewar <dewar@adacore.com>
* err_vars.ads, a-cdlili.adb, a-cfdlli.ads, prj.adb, prj-nmsc.adb,
a-cbdlli.adb, a-cbdlli.ads, a-cfdlli.adb: Minor reformatting.
2011-12-21 Vincent Pucci <pucci@adacore.com>
* s-diflio.adb, s-diflio.ads, s-diinio.adb, s-diinio.ads,
s-llflex.ads: Fix header.
2011-12-21 Thomas Quinot <quinot@adacore.com> 2011-12-21 Thomas Quinot <quinot@adacore.com>
* thread.c, s-oscons-tmplt.c, init.c (pthread_condattr_setclock): For * thread.c, s-oscons-tmplt.c, init.c (pthread_condattr_setclock): For
......
gcc/ada/a-cbdlli.adb
...@@ -1537,8 +1537,10 @@ package body Ada.Containers.Bounded_Doubly_Linked_Lists is ...@@ -1537,8 +1537,10 @@ package body Ada.Containers.Bounded_Doubly_Linked_Lists is
-- Reference -- -- Reference --
--------------- ---------------
function Constant_Reference (Container : List; Position : Cursor) function Constant_Reference
return Constant_Reference_Type is (Container : List;
Position : Cursor) return Constant_Reference_Type
is
begin begin
pragma Unreferenced (Container); pragma Unreferenced (Container);
...@@ -1550,8 +1552,10 @@ package body Ada.Containers.Bounded_Doubly_Linked_Lists is ...@@ -1550,8 +1552,10 @@ package body Ada.Containers.Bounded_Doubly_Linked_Lists is
Position.Container.Nodes (Position.Node).Element'Unrestricted_Access); Position.Container.Nodes (Position.Node).Element'Unrestricted_Access);
end Constant_Reference; end Constant_Reference;
function Reference (Container : List; Position : Cursor) function Reference
return Reference_Type is (Container : List;
Position : Cursor) return Reference_Type
is
begin begin
pragma Unreferenced (Container); pragma Unreferenced (Container);
......
gcc/ada/a-cbdlli.ads
...@@ -258,12 +258,12 @@ package Ada.Containers.Bounded_Doubly_Linked_Lists is ...@@ -258,12 +258,12 @@ package Ada.Containers.Bounded_Doubly_Linked_Lists is
for Reference_Type'Read use Read; for Reference_Type'Read use Read;
function Constant_Reference function Constant_Reference
(Container : List; Position : Cursor) -- SHOULD BE ALIASED (Container : List; -- SHOULD BE ALIASED ???
return Constant_Reference_Type; Position : Cursor) return Constant_Reference_Type;
function Reference function Reference
(Container : List; Position : Cursor) -- SHOULD BE ALIASED (Container : List; -- SHOULD BE ALIASED ???
return Reference_Type; Position : Cursor) return Reference_Type;
private private
......
gcc/ada/a-cdlili.adb
...@@ -1277,8 +1277,10 @@ package body Ada.Containers.Doubly_Linked_Lists is ...@@ -1277,8 +1277,10 @@ package body Ada.Containers.Doubly_Linked_Lists is
-- Reference -- -- Reference --
--------------- ---------------
function Constant_Reference (Container : List; Position : Cursor) function Constant_Reference
return Constant_Reference_Type is (Container : List;
Position : Cursor) return Constant_Reference_Type
is
begin begin
pragma Unreferenced (Container); pragma Unreferenced (Container);
...@@ -1289,8 +1291,10 @@ package body Ada.Containers.Doubly_Linked_Lists is ...@@ -1289,8 +1291,10 @@ package body Ada.Containers.Doubly_Linked_Lists is
return (Element => Position.Node.Element'Access); return (Element => Position.Node.Element'Access);
end Constant_Reference; end Constant_Reference;
function Reference (Container : List; Position : Cursor) function Reference
return Reference_Type is (Container : List;
Position : Cursor) return Reference_Type
is
begin begin
pragma Unreferenced (Container); pragma Unreferenced (Container);
......
gcc/ada/a-cfdlli.adb
...@@ -253,10 +253,11 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -253,10 +253,11 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
Capacity : Count_Type := 0) return List Capacity : Count_Type := 0) return List
is is
C : constant Count_Type := Count_Type'Max (Source.Capacity, Capacity); C : constant Count_Type := Count_Type'Max (Source.Capacity, Capacity);
N : Count_Type := 1; N : Count_Type;
P : List (C); P : List (C);
begin begin
N := 1;
while N <= Source.Capacity loop while N <= Source.Capacity loop
P.Nodes (N).Prev := Source.Nodes (N).Prev; P.Nodes (N).Prev := Source.Nodes (N).Prev;
P.Nodes (N).Next := Source.Nodes (N).Next; P.Nodes (N).Next := Source.Nodes (N).Next;
...@@ -604,12 +605,12 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -604,12 +605,12 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
Node : Count_Type := Container.First; Node : Count_Type := Container.First;
begin begin
for I in 2 .. Container.Length loop for J in 2 .. Container.Length loop
if Nodes (Nodes (Node).Next).Element < Nodes (Node).Element then if Nodes (Nodes (Node).Next).Element < Nodes (Node).Element then
return False; return False;
else
Node := Nodes (Node).Next;
end if; end if;
Node := Nodes (Node).Next;
end loop; end loop;
return True; return True;
...@@ -749,7 +750,7 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -749,7 +750,7 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
end if; end if;
end Sort; end Sort;
-- Start of processing for Sort -- Start of processing for Sort
begin begin
if Container.Length <= 1 then if Container.Length <= 1 then
...@@ -799,7 +800,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -799,7 +800,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
J : Count_Type; J : Count_Type;
begin begin
if Before.Node /= 0 then if Before.Node /= 0 then
pragma Assert (Vet (Container, Before), "bad cursor in Insert"); pragma Assert (Vet (Container, Before), "bad cursor in Insert");
end if; end if;
...@@ -848,7 +848,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -848,7 +848,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
J : Count_Type; J : Count_Type;
begin begin
if Before.Node /= 0 then if Before.Node /= 0 then
pragma Assert (Vet (Container, Before), "bad cursor in Insert"); pragma Assert (Vet (Container, Before), "bad cursor in Insert");
end if; end if;
...@@ -950,15 +949,15 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -950,15 +949,15 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
Process : Process :
not null access procedure (Container : List; Position : Cursor)) not null access procedure (Container : List; Position : Cursor))
is is
C : List renames Container'Unrestricted_Access.all; C : List renames Container'Unrestricted_Access.all;
B : Natural renames C.Busy; B : Natural renames C.Busy;
Node : Count_Type;
Node : Count_Type := Container.First;
begin begin
B := B + 1; B := B + 1;
begin begin
Node := Container.First;
while Node /= 0 loop while Node /= 0 loop
Process (Container, (Node => Node)); Process (Container, (Node => Node));
Node := Container.Nodes (Node).Next; Node := Container.Nodes (Node).Next;
...@@ -1235,7 +1234,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -1235,7 +1234,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
Position : Cursor) return Cursor Position : Cursor) return Cursor
is is
begin begin
return Next (Object.Container.all, Position); return Next (Object.Container.all, Position);
end Next; end Next;
...@@ -1288,7 +1286,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -1288,7 +1286,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
Position : Cursor) return Cursor Position : Cursor) return Cursor
is is
begin begin
return Previous (Object.Container.all, Position); return Previous (Object.Container.all, Position);
end Previous; end Previous;
...@@ -1372,10 +1369,11 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -1372,10 +1369,11 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
-- Reference -- -- Reference --
--------------- ---------------
function Constant_Reference (Container : List; Position : Cursor) function Constant_Reference
return Constant_Reference_Type is (Container : List;
Position : Cursor) return Constant_Reference_Type
is
begin begin
if not Has_Element (Container, Position) then if not Has_Element (Container, Position) then
raise Constraint_Error with "Position cursor has no element"; raise Constraint_Error with "Position cursor has no element";
end if; end if;
...@@ -1393,7 +1391,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -1393,7 +1391,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
New_Item : Element_Type) New_Item : Element_Type)
is is
begin begin
if not Has_Element (Container, Position) then if not Has_Element (Container, Position) then
raise Constraint_Error with "Position cursor has no element"; raise Constraint_Error with "Position cursor has no element";
end if; end if;
...@@ -1411,6 +1408,10 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -1411,6 +1408,10 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
begin begin
N (Position.Node).Element := New_Item; N (Position.Node).Element := New_Item;
end; end;
-- Above is peculiar, why not simply
-- Container.Nodes (Position.Node).Element := New_Item ???
end Replace_Element; end Replace_Element;
---------------------- ----------------------
...@@ -1462,7 +1463,7 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -1462,7 +1463,7 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
end if; end if;
end Swap; end Swap;
-- Start of processing for Reverse_Elements -- Start of processing for Reverse_Elements
begin begin
if Container.Length <= 1 then if Container.Length <= 1 then
...@@ -1511,6 +1512,7 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -1511,6 +1512,7 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
Position : Cursor := No_Element) return Cursor Position : Cursor := No_Element) return Cursor
is is
CFirst : Count_Type := Position.Node; CFirst : Count_Type := Position.Node;
begin begin
if CFirst = 0 then if CFirst = 0 then
CFirst := Container.First; CFirst := Container.First;
...@@ -1542,12 +1544,13 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -1542,12 +1544,13 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
C : List renames Container'Unrestricted_Access.all; C : List renames Container'Unrestricted_Access.all;
B : Natural renames C.Busy; B : Natural renames C.Busy;
Node : Count_Type := Container.Last; Node : Count_Type;
begin begin
B := B + 1; B := B + 1;
begin begin
Node := Container.Last;
while Node /= 0 loop while Node /= 0 loop
Process (Container, (Node => Node)); Process (Container, (Node => Node));
Node := Container.Nodes (Node).Prev; Node := Container.Nodes (Node).Prev;
...@@ -1649,7 +1652,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -1649,7 +1652,6 @@ package body Ada.Containers.Formal_Doubly_Linked_Lists is
Target_Position : Cursor; Target_Position : Cursor;
begin begin
if Target'Address = Source'Address then if Target'Address = Source'Address then
Splice (Target, Before, Position); Splice (Target, Before, Position);
return; return;
......
gcc/ada/a-cfdlli.ads
...@@ -246,8 +246,8 @@ package Ada.Containers.Formal_Doubly_Linked_Lists is ...@@ -246,8 +246,8 @@ package Ada.Containers.Formal_Doubly_Linked_Lists is
Implicit_Dereference => Element; Implicit_Dereference => Element;
function Constant_Reference function Constant_Reference
(Container : List; Position : Cursor) -- SHOULD BE ALIASED (Container : List; -- SHOULD BE ALIASED ???
return Constant_Reference_Type; Position : Cursor) return Constant_Reference_Type;
function Strict_Equal (Left, Right : List) return Boolean; function Strict_Equal (Left, Right : List) return Boolean;
-- Strict_Equal returns True if the containers are physically equal, i.e. -- Strict_Equal returns True if the containers are physically equal, i.e.
......
gcc/ada/comperr.adb
...@@ -438,10 +438,41 @@ package body Comperr is ...@@ -438,10 +438,41 @@ package body Comperr is
----------------------- -----------------------
procedure Delete_SCIL_Files is procedure Delete_SCIL_Files is
Main : Node_Id; Main : Node_Id;
Success : Boolean; Unit_Name : Node_Id;
Success : Boolean;
pragma Unreferenced (Success); pragma Unreferenced (Success);
procedure Decode_Name_Buffer;
-- Replace "__" by "." in Name_Buffer, and adjust Name_Len accordingly
------------------------
-- Decode_Name_Buffer --
------------------------
procedure Decode_Name_Buffer is
J : Natural := 1;
K : Natural := 0;
begin
while J <= Name_Len loop
K := K + 1;
if J < Name_Len
and then Name_Buffer (J) = '_'
and then Name_Buffer (J + 1) = '_'
then
Name_Buffer (K) := '.';
J := J + 1;
else
Name_Buffer (K) := Name_Buffer (J);
end if;
J := J + 1;
end loop;
Name_Len := K;
end Decode_Name_Buffer;
begin begin
-- If parsing was not successful, no Main_Unit is available, so return -- If parsing was not successful, no Main_Unit is available, so return
-- immediately. -- immediately.
...@@ -451,20 +482,45 @@ package body Comperr is ...@@ -451,20 +482,45 @@ package body Comperr is
end if; end if;
-- Retrieve unit name, and remove old versions of SCIL/<unit>.scil and -- Retrieve unit name, and remove old versions of SCIL/<unit>.scil and
-- SCIL/<unit>__body.scil -- SCIL/<unit>__body.scil, ditto for .scilx files.
Main := Unit (Cunit (Main_Unit)); Main := Unit (Cunit (Main_Unit));
if Nkind (Main) = N_Subprogram_Body then case Nkind (Main) is
Get_Name_String (Chars (Defining_Unit_Name (Specification (Main)))); when N_Subprogram_Body | N_Package_Declaration =>
else Unit_Name := Defining_Unit_Name (Specification (Main));
Get_Name_String (Chars (Defining_Unit_Name (Main)));
end if; when N_Package_Body =>
Unit_Name := Corresponding_Spec (Main);
when others =>
-- Should never happen, but can be ignored in production
pragma Assert (False);
return;
end case;
case Nkind (Unit_Name) is
when N_Defining_Identifier =>
Get_Name_String (Chars (Unit_Name));
when N_Defining_Program_Unit_Name =>
Get_Name_String (Chars (Defining_Identifier (Unit_Name)));
Decode_Name_Buffer;
when others =>
-- Should never happen, but can be ignored in production
pragma Assert (False);
return;
end case;
Delete_File Delete_File
("SCIL/" & Name_Buffer (1 .. Name_Len) & ".scil", Success); ("SCIL/" & Name_Buffer (1 .. Name_Len) & ".scil", Success);
Delete_File Delete_File
("SCIL/" & Name_Buffer (1 .. Name_Len) & ".scilx", Success);
Delete_File
("SCIL/" & Name_Buffer (1 .. Name_Len) & "__body.scil", Success); ("SCIL/" & Name_Buffer (1 .. Name_Len) & "__body.scil", Success);
Delete_File
("SCIL/" & Name_Buffer (1 .. Name_Len) & "__body.scilx", Success);
end Delete_SCIL_Files; end Delete_SCIL_Files;
----------------- -----------------
......
gcc/ada/err_vars.ads
...@@ -145,7 +145,9 @@ package Err_Vars is ...@@ -145,7 +145,9 @@ package Err_Vars is
-- Used if current message contains a < insertion character to indicate -- Used if current message contains a < insertion character to indicate
-- if the current message is a warning message. Must be set appropriately -- if the current message is a warning message. Must be set appropriately
-- before any call to Error_Msg_xxx with a < insertion character present. -- before any call to Error_Msg_xxx with a < insertion character present.
-- Setting is irrelevant if no < insertion character is present. -- Setting is irrelevant if no < insertion character is present. Note
-- that it is not necessary to reset this after using it, since the proper
-- procedure is always to set it before issuing such a message.
Error_Msg_String : String (1 .. 4096); Error_Msg_String : String (1 .. 4096);
Error_Msg_Strlen : Natural; Error_Msg_Strlen : Natural;
......
gcc/ada/prj-nmsc.adb
...@@ -1042,7 +1042,6 @@ package body Prj.Nmsc is ...@@ -1042,7 +1042,6 @@ package body Prj.Nmsc is
(Project : Project_Id; (Project : Project_Id;
Data : in out Tree_Processing_Data) Data : in out Tree_Processing_Data)
is is
procedure Check_Not_Defined (Name : Name_Id); procedure Check_Not_Defined (Name : Name_Id);
-- Report an error if Var is defined -- Report an error if Var is defined
...@@ -1065,6 +1064,8 @@ package body Prj.Nmsc is ...@@ -1065,6 +1064,8 @@ package body Prj.Nmsc is
end if; end if;
end Check_Not_Defined; end Check_Not_Defined;
-- Start of processing for Check_Not_Defined
begin begin
Check_Not_Defined (Snames.Name_Library_Dir); Check_Not_Defined (Snames.Name_Library_Dir);
Check_Not_Defined (Snames.Name_Library_Interface); Check_Not_Defined (Snames.Name_Library_Interface);
...@@ -1116,9 +1117,9 @@ package body Prj.Nmsc is ...@@ -1116,9 +1117,9 @@ package body Prj.Nmsc is
Check_Configuration (Project, Data); Check_Configuration (Project, Data);
-- For aggregate project checks that no library attributes are defined
if Project.Qualifier = Aggregate then if Project.Qualifier = Aggregate then
-- For aggregate project checks that no library attributes are
-- defined.
Check_Aggregate (Project, Data); Check_Aggregate (Project, Data);
else else
......
gcc/ada/prj.adb
...@@ -390,8 +390,9 @@ package body Prj is ...@@ -390,8 +390,9 @@ package body Prj is
------------------------- -------------------------
function Is_Allowed_Language (Name : Name_Id) return Boolean is function Is_Allowed_Language (Name : Name_Id) return Boolean is
R : Restricted_Lang_Access := Restricted_Languages; R : Restricted_Lang_Access := Restricted_Languages;
Lang : constant String := Get_Name_String (Name); Lang : constant String := Get_Name_String (Name);
begin begin
if R = null then if R = null then
return True; return True;
...@@ -1633,6 +1634,7 @@ package body Prj is ...@@ -1633,6 +1634,7 @@ package body Prj is
else else
Write_Line (" """ & Get_Name_String (Str2) & '"'); Write_Line (" """ & Get_Name_String (Str2) & '"');
end if; end if;
Set_Standard_Output; Set_Standard_Output;
end if; end if;
end Debug_Output; end Debug_Output;
......
gcc/ada/s-diflio.adb
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
-- -- -- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- GNAT RUN-TIME COMPONENTS --
-- -- -- --
-- S Y S T E M . D I M _ F L O A T _ I O -- -- S Y S T E M . D I M _ F L O A T _ I O --
-- -- -- --
-- B o d y -- -- B o d y --
-- -- -- --
-- Copyright (C) 2011, Free Software Foundation, Inc. -- -- Copyright (C) 2011, Free Software Foundation, Inc. --
-- -- -- --
-- GNARL is free software; you can redistribute it and/or modify it under -- -- 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- -- -- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- -- -- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
...@@ -24,8 +24,8 @@ ...@@ -24,8 +24,8 @@
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. -- -- <http://www.gnu.org/licenses/>. --
-- -- -- --
-- GNARL was developed by the GNARL team at Florida State University. -- -- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- Extensive contributions were provided by Ada Core Technologies Inc. --
-- -- -- --
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
......
gcc/ada/s-diflio.ads
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
-- -- -- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- GNAT RUN-TIME COMPONENTS --
-- -- -- --
-- S Y S T E M . D I M _ F L O A T _ I O -- -- S Y S T E M . D I M _ F L O A T _ I O --
-- -- -- --
-- S p e c -- -- S p e c --
-- -- -- --
-- Copyright (C) 2011, Free Software Foundation, Inc. -- -- Copyright (C) 2011, Free Software Foundation, Inc. --
-- -- -- --
-- GNARL is free software; you can redistribute it and/or modify it under -- -- 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- -- -- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- -- -- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
...@@ -24,8 +24,8 @@ ...@@ -24,8 +24,8 @@
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. -- -- <http://www.gnu.org/licenses/>. --
-- -- -- --
-- GNARL was developed by the GNARL team at Florida State University. -- -- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- Extensive contributions were provided by Ada Core Technologies Inc. --
-- -- -- --
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
......
gcc/ada/s-diinio.adb
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
-- -- -- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- GNAT RUN-TIME COMPONENTS --
-- -- -- --
-- S Y S T E M . D I M _ I N T E G E R _ I O -- -- S Y S T E M . D I M _ I N T E G E R _ I O --
-- -- -- --
-- B o d y -- -- B o d y --
-- -- -- --
-- Copyright (C) 2011, Free Software Foundation, Inc. -- -- Copyright (C) 2011, Free Software Foundation, Inc. --
-- -- -- --
-- GNARL is free software; you can redistribute it and/or modify it under -- -- 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- -- -- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- -- -- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
...@@ -24,8 +24,8 @@ ...@@ -24,8 +24,8 @@
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. -- -- <http://www.gnu.org/licenses/>. --
-- -- -- --
-- GNARL was developed by the GNARL team at Florida State University. -- -- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- Extensive contributions were provided by Ada Core Technologies Inc. --
-- -- -- --
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
......
gcc/ada/s-diinio.ads
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
-- -- -- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- GNAT RUN-TIME COMPONENTS --
-- -- -- --
-- S Y S T E M . D I M _ I N T E G E R _ I O -- -- S Y S T E M . D I M _ I N T E G E R _ I O --
-- -- -- --
-- S p e c -- -- S p e c --
-- -- -- --
-- Copyright (C) 2011, Free Software Foundation, Inc. -- -- Copyright (C) 2011, Free Software Foundation, Inc. --
-- -- -- --
-- GNARL is free software; you can redistribute it and/or modify it under -- -- 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- -- -- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- -- -- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
...@@ -24,8 +24,8 @@ ...@@ -24,8 +24,8 @@
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. -- -- <http://www.gnu.org/licenses/>. --
-- -- -- --
-- GNARL was developed by the GNARL team at Florida State University. -- -- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- Extensive contributions were provided by Ada Core Technologies Inc. --
-- -- -- --
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
......
gcc/ada/s-llflex.ads
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
-- -- -- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- GNAT RUN-TIME COMPONENTS --
-- -- -- --
-- S Y S T E M . L O N G _ L O N G _ F L O A T _ E X P O N -- -- S Y S T E M . L O N G _ L O N G _ F L O A T _ E X P O N --
-- -- -- --
-- S p e c -- -- S p e c --
-- -- -- --
-- Copyright (C) 2011, Free Software Foundation, Inc. -- -- Copyright (C) 2011, Free Software Foundation, Inc. --
-- -- -- --
-- GNARL is free software; you can redistribute it and/or modify it under -- -- 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- -- -- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- -- -- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
...@@ -24,8 +24,8 @@ ...@@ -24,8 +24,8 @@
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. -- -- <http://www.gnu.org/licenses/>. --
-- -- -- --
-- GNARL was developed by the GNARL team at Florida State University. -- -- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- Extensive contributions were provided by Ada Core Technologies Inc. --
-- -- -- --
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment