b740cf2853
gcc/ada/ * alloc.ads, aspects.adb, aspects.ads, atree.adb, atree.ads, casing.adb, casing.ads, csets.adb, csets.ads, debug.adb, debug.ads, einfo.adb, einfo.ads, elists.adb, elists.ads, fname.adb, fname.ads, gnatvsn.adb, gnatvsn.ads, hostparm.ads, indepsw-aix.adb, indepsw-darwin.adb, indepsw-gnu.adb, indepsw.adb, indepsw.ads, krunch.adb, krunch.ads, lib-list.adb, lib-sort.adb, lib.adb, lib.ads, namet-sp.adb, namet-sp.ads, namet.adb, namet.ads, nlists.adb, nlists.ads, opt.adb, opt.ads, output.adb, output.ads, rident.ads, scans.adb, scans.ads, scil_ll.adb, scil_ll.ads, sem_aux.ads, sem_aux.adb, sfn_scan.adb, sinfo.adb, sinfo.ads, sinput.adb, sinput.ads, snames.adb-tmpl, snames.ads-tmpl, stand.ads, stringt.adb, stringt.ads, table.adb, table.ads, types.adb, types.ads, uintp.adb, uintp.ads, uname.adb, uname.ads, urealp.adb, urealp.ads, vast.adb, vast.ads, widechar.adb, widechar.ads: Update header.
94 lines
3.7 KiB
Ada
94 lines
3.7 KiB
Ada
------------------------------------------------------------------------------
|
|
-- --
|
|
-- GNAT COMPILER COMPONENTS --
|
|
-- --
|
|
-- L I B . S O R T --
|
|
-- --
|
|
-- B o d y --
|
|
-- --
|
|
-- Copyright (C) 1992-2020, 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 3, 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 COPYING3. If not, go to --
|
|
-- http://www.gnu.org/licenses for a complete copy of the 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_G;
|
|
|
|
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
|
|
|
|
package Sorting is new GNAT.Heap_Sort_G (Move_Uname, Lt_Uname);
|
|
|
|
--------------
|
|
-- 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_Unit_Name then
|
|
return False;
|
|
|
|
elsif Units.Table (T (C2)).Unit_Name = No_Unit_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;
|
|
|
|
Sorting.Sort (T'Last);
|
|
|
|
-- 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;
|