d26dc4b5a1
2005-12-05 Robert Dewar <dewar@adacore.com>
* i-c.adb, i-cexten.ads, i-cobol.adb, i-cobol.ads, i-cpoint.ads,
i-cpp.adb, i-cpp.ads, i-cstrea.ads, i-cstrin.adb, i-cstrin.ads,
inline.adb, interfac.ads, i-os2err.ads, i-os2lib.ads, i-os2syn.ads,
i-os2thr.ads, itypes.adb, itypes.adb, itypes.ads, krunch.ads,
krunch.adb, lib.adb, lib.ads, lib-list.adb, lib-load.adb,
lib-load.ads, lib-sort.adb, live.adb, make.ads, i-cstrea-vms.adb,
interfac-vms.ads, makegpr.adb, indepsw-gnu.adb, indepsw.ads,
s-wchcon.ads, sdefault.ads, sem_ch10.adb, sem_eval.ads: Minor
reformatting.
2005-12-05 Robert Dewar <dewar@adacore.com>
* s-vaflop-vms-alpha.adb: (Ne_F): New function
(Ne_G): New function
* exp_ch4.adb (Expand_Allocator_Expression): Factor duplicated code
for tag assignment.
(Rewrite_Comparison): Handle case where operation is not a comparison
and ignore, and also handle type conversion case.
2005-12-05 Thomas Quinot <quinot@adacore.com>
* exp_aggr.ads: Fix typo in comment.
???-mark Convert_Aggr_In_Assignment as needing documentation.
2005-12-05 Gary Dismukes <dismukes@adacore.com>
* layout.adb: Replace various uses of byte by storage unit throughout.
(Get_Max_SU_Size): Name changed from Get_Max_Size. In the case of a
static size, convert to storage units before returning, to conform to
spec.
2005-12-05 Matthew Gingell <gingell@adacore.com>
* g-exctra.ads: Fix typo in comment.
2005-12-05 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
* utils.c: Minor reformatting.
2005-12-05 Robert Dewar <dewar@adacore.com>
* g-soccon.ads:
Further comment fixes to make the status of the default file clear
* s-bitops.adb: Clarify comment for Bits_Array
From-SVN: r108308
101 lines
4.4 KiB
Ada
101 lines
4.4 KiB
Ada
------------------------------------------------------------------------------
|
|
-- --
|
|
-- GNAT COMPILER COMPONENTS --
|
|
-- --
|
|
-- L I B . S O R T --
|
|
-- --
|
|
-- B o d y --
|
|
-- --
|
|
-- Copyright (C) 1992-2005, 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- --
|
|
-- ware Foundation; either version 2, or (at your option) any later ver- --
|
|
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
|
|
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
|
|
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
|
|
-- for more details. You should have received a copy of the GNU General --
|
|
-- Public License distributed with GNAT; see file COPYING. If not, write --
|
|
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
|
|
-- Boston, MA 02110-1301, USA. --
|
|
-- --
|
|
-- As a special exception, if other files instantiate generics from this --
|
|
-- unit, or you link this unit with other files to produce an executable, --
|
|
-- this unit does not by itself cause the resulting executable to be --
|
|
-- covered by the GNU General Public License. This exception does not --
|
|
-- however invalidate any other reasons why the executable file might be --
|
|
-- covered by the GNU Public License. --
|
|
-- --
|
|
-- GNAT was originally developed by the GNAT team at New York University. --
|
|
-- Extensive contributions were provided by Ada Core Technologies Inc. --
|
|
-- --
|
|
------------------------------------------------------------------------------
|
|
|
|
with GNAT.Heap_Sort_A; use GNAT.Heap_Sort_A;
|
|
|
|
separate (Lib)
|
|
procedure Sort (Tbl : in out Unit_Ref_Table) is
|
|
|
|
T : array (0 .. Integer (Tbl'Last - Tbl'First + 1)) of Unit_Number_Type;
|
|
-- Actual sort is done on this copy of the array with 0's origin
|
|
-- subscripts. Location 0 is used as a temporary by the sorting algorithm.
|
|
-- Also the addressing of the table is more efficient with 0's origin,
|
|
-- even though we have to copy Tbl back and forth.
|
|
|
|
function Lt_Uname (C1, C2 : Natural) return Boolean;
|
|
-- Comparison routine for comparing Unames. Needed by the sorting routine
|
|
|
|
procedure Move_Uname (From : Natural; To : Natural);
|
|
-- Move routine needed by the sorting routine below
|
|
|
|
--------------
|
|
-- Lt_Uname --
|
|
--------------
|
|
|
|
function Lt_Uname (C1, C2 : Natural) return Boolean is
|
|
begin
|
|
-- Preprocessing data and definition files are not sorted, they are
|
|
-- at the bottom of the list. They are recognized because they are
|
|
-- the only ones without a Unit_Name.
|
|
|
|
if Units.Table (T (C1)).Unit_Name = No_Name then
|
|
return False;
|
|
|
|
elsif Units.Table (T (C2)).Unit_Name = No_Name then
|
|
return True;
|
|
|
|
else
|
|
return
|
|
Uname_Lt
|
|
(Units.Table (T (C1)).Unit_Name, Units.Table (T (C2)).Unit_Name);
|
|
end if;
|
|
end Lt_Uname;
|
|
|
|
----------------
|
|
-- Move_Uname --
|
|
----------------
|
|
|
|
procedure Move_Uname (From : Natural; To : Natural) is
|
|
begin
|
|
T (To) := T (From);
|
|
end Move_Uname;
|
|
|
|
-- Start of processing for Sort
|
|
|
|
begin
|
|
if T'Last > 0 then
|
|
for I in 1 .. T'Last loop
|
|
T (I) := Tbl (Int (I) - 1 + Tbl'First);
|
|
end loop;
|
|
|
|
Sort (T'Last,
|
|
Move_Uname'Unrestricted_Access, Lt_Uname'Unrestricted_Access);
|
|
|
|
-- Sort is complete, copy result back into place
|
|
|
|
for I in 1 .. T'Last loop
|
|
Tbl (Int (I) - 1 + Tbl'First) := T (I);
|
|
end loop;
|
|
end if;
|
|
end Sort;
|