ada: Move formal hash tables from gnat repository to the SPARK library

The formal containers have been part of the SPARK library for some
time now. However, some units used only by these containers are still
part of the gnat repository. Move them to the SPARK library.

gcc/ada/ChangeLog:

	* Makefile.rtl: Remove references to moved units.
	* libgnat/a-chtgfk.adb: Removed.
	* libgnat/a-chtgfk.ads: Removed.
	* libgnat/a-chtgfo.adb: Removed.
	* libgnat/a-chtgfo.ads: Removed.
	* libgnat/a-cohata.ads (Generic_Formal_Hash_Table_Types): Removed.

1 files changed, 0 insertions, 114 deletions

diff --git a/gcc/ada/libgnat/a-chtgfo.ads b/gcc/ada/libgnat/a-chtgfo.ads
deleted file mode 100644
index f4471be..0000000
--- a/gcc/ada/libgnat/a-chtgfo.ads
+++ /dev/null
@@ -1,114 +0,0 @@
-------------------------------------------------------------------------------
---                                                                          --
---                         GNAT LIBRARY COMPONENTS                          --
---                                                                          --
---            ADA.CONTAINERS.HASH_TABLES.GENERIC_FORMAL_OPERATIONS          --
---                                                                          --
---                                 S p e c                                  --
---                                                                          --
---          Copyright (C) 2004-2024, 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/>.                                          --
---                                                                          --
--- This unit was originally developed by Matthew J Heaney.                  --
-------------------------------------------------------------------------------
-
---  Hash_Table_Type is used to implement hashed containers. This package
---  declares hash-table operations that do not depend on keys.
-
-generic
-   with package HT_Types is
-     new Generic_Formal_Hash_Table_Types (<>);
-
-   use HT_Types;
-
-   with function Hash_Node (Node : Node_Type) return Hash_Type;
-
-   with function Next (Node : Node_Type) return Count_Type;
-
-   with procedure Set_Next
-     (Node : in out Node_Type;
-      Next : Count_Type);
-
-package Ada.Containers.Hash_Tables.Generic_Formal_Operations is
-   pragma Pure;
-
-   function Index
-     (Buckets : Buckets_Type;
-      Node    : Node_Type) return Hash_Type;
-   pragma Inline (Index);
-   --  Uses the hash value of Node to compute its Buckets array index
-
-   function Index
-     (HT   : Hash_Table_Type;
-      Node : Node_Type) return Hash_Type;
-   pragma Inline (Index);
-   --  Uses the hash value of Node to compute its Hash_Table buckets array
-   --  index.
-
-   generic
-      with function Find
-        (HT  : Hash_Table_Type;
-         Key : Node_Type) return Boolean;
-   function Generic_Equal (L, R : Hash_Table_Type) return Boolean;
-   --  Used to implement hashed container equality. For each node in hash table
-   --  L, it calls Find to search for an equivalent item in hash table R. If
-   --  Find returns False for any node then Generic_Equal terminates
-   --  immediately and returns False. Otherwise if Find returns True for every
-   --  node then Generic_Equal returns True.
-
-   procedure Clear (HT : in out Hash_Table_Type);
-   --  Empties the hash table HT
-
-   procedure Delete_Node_Sans_Free
-     (HT : in out Hash_Table_Type;
-      X  : Count_Type);
-   --  Removes node X from the hash table without deallocating the node
-
-   generic
-      with procedure Set_Element (Node : in out Node_Type);
-   procedure Generic_Allocate
-     (HT   : in out Hash_Table_Type;
-      Node : out Count_Type);
-   --  Claim a node from the free store. Generic_Allocate first
-   --  calls Set_Element on the potential node, and then returns
-   --  the node's index as the value of the Node parameter.
-
-   procedure Free
-     (HT : in out Hash_Table_Type;
-      X  : Count_Type);
-   --  Return a node back to the free store, from where it had
-   --  been previously claimed via Generic_Allocate.
-
-   function First (HT : Hash_Table_Type) return Count_Type;
-   --  Returns the head of the list in the first (lowest-index) non-empty
-   --  bucket.
-
-   function Next
-     (HT   : Hash_Table_Type;
-      Node : Count_Type) return Count_Type;
-   --  Returns the node that immediately follows Node. This corresponds to
-   --  either the next node in the same bucket, or (if Node is the last node in
-   --  its bucket) the head of the list in the first non-empty bucket that
-   --  follows.
-
-   generic
-      with procedure Process (Node : Count_Type);
-   procedure Generic_Iteration (HT : Hash_Table_Type);
-   --  Calls Process for each node in hash table HT
-
-end Ada.Containers.Hash_Tables.Generic_Formal_Operations;