URL
https://opencores.org/ocsvn/openrisc_2011-10-31/openrisc_2011-10-31/trunk
Subversion Repositories openrisc_2011-10-31
[/] [openrisc/] [tags/] [gnu-src/] [gcc-4.5.1/] [gcc-4.5.1-or32-1.0rc1/] [gcc/] [ada/] [lib-sort.adb] - Rev 338
Compare with Previous | Blame | View Log
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- L I B . S O R T -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2009, 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. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- 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;