aboutsummaryrefslogtreecommitdiff
path: root/gcc/ada/libgnat/s-exctab.adb
blob: 3cb36abfbb551825d28303b117568feef7649b3f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
------------------------------------------------------------------------------
--                                                                          --
--                         GNAT COMPILER COMPONENTS                         --
--                                                                          --
--               S Y S T E M . E X C E P T I O N _ T A B L E                --
--                                                                          --
--                                 B o d y                                  --
--                                                                          --
--          Copyright (C) 1996-2023, 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 System.Soft_Links; use System.Soft_Links;

package body System.Exception_Table is

   use System.Standard_Library;

   type Hash_Val is mod 2 ** 8;
   subtype Hash_Idx is Hash_Val range 1 .. 37;

   HTable : array (Hash_Idx) of aliased Exception_Data_Ptr;
   --  Actual hash table containing all registered exceptions
   --
   --  The table is very small and the hash function weak, as looking up
   --  registered exceptions is rare and minimizing space and time overhead
   --  of registration is more important. In addition, it is expected that the
   --  exceptions that need to be looked up are registered dynamically, and
   --  therefore will be at the begin of the hash chains.
   --
   --  The table differs from System.HTable.Static_HTable in that the final
   --  element of each chain is not marked by null, but by a pointer to self.
   --  This way it is possible to defend against the same entry being inserted
   --  twice, without having to do a lookup which is relatively expensive for
   --  programs with large number
   --
   --  All non-local subprograms use the global Task_Lock to protect against
   --  concurrent use of the exception table. This is needed as local
   --  exceptions may be declared concurrently with those declared at the
   --  library level.

   --  Local Subprograms

   generic
      with procedure Process (T : Exception_Data_Ptr; More : out Boolean);
   procedure Iterate;
   --  Iterate over all

   function Lookup  (Name : String) return Exception_Data_Ptr;
   --  Find and return the Exception_Data of the exception with the given Name
   --  (which must be in all uppercase), or null if none was registered.

   procedure Register (Item : Exception_Data_Ptr);
   --  Register an exception with the given Exception_Data in the table.

   function Has_Name (Item : Exception_Data_Ptr; Name : String) return Boolean;
   --  Return True iff Item.Full_Name and Name are equal. Both names are
   --  assumed to be in all uppercase and end with ASCII.NUL.

   function Hash (S : String) return Hash_Idx;
   --  Return the index in the hash table for S, which is assumed to be all
   --  uppercase and end with ASCII.NUL.

   --------------
   -- Has_Name --
   --------------

   function Has_Name (Item : Exception_Data_Ptr; Name : String) return Boolean
   is
      S : constant Big_String_Ptr := To_Ptr (Item.Full_Name);
      J : Integer := S'First;

   begin
      for K in Name'Range loop

         --  Note that as both items are terminated with ASCII.NUL, the
         --  comparison below must fail for strings of different lengths.

         if S (J) /= Name (K) then
            return False;
         end if;

         J := J + 1;
      end loop;

      return True;
   end Has_Name;

   ------------
   -- Lookup --
   ------------

   function Lookup (Name : String) return Exception_Data_Ptr is
      Prev   : Exception_Data_Ptr;
      Curr   : Exception_Data_Ptr;

   begin
      Curr := HTable (Hash (Name));
      Prev := null;
      while Curr /= Prev loop
         if Has_Name (Curr, Name) then
            return Curr;
         end if;

         Prev := Curr;
         Curr := Curr.HTable_Ptr;
      end loop;

      return null;
   end Lookup;

   ----------
   -- Hash --
   ----------

   function Hash (S : String) return Hash_Idx is
      Hash : Hash_Val := 0;

   begin
      for J in S'Range loop
         exit when S (J) = ASCII.NUL;
         Hash := Hash xor Character'Pos (S (J));
      end loop;

      return Hash_Idx'First + Hash mod (Hash_Idx'Last - Hash_Idx'First + 1);
   end Hash;

   -------------
   -- Iterate --
   -------------

   procedure Iterate is
      More : Boolean;
      Prev, Curr : Exception_Data_Ptr;

   begin
      Outer : for Idx in HTable'Range loop
         Prev   := null;
         Curr   := HTable (Idx);

         while Curr /= Prev loop
               Process (Curr, More);

               exit Outer when not More;

               Prev := Curr;
               Curr := Curr.HTable_Ptr;
         end loop;
      end loop Outer;
   end Iterate;

   --------------
   -- Register --
   --------------

   procedure Register (Item : Exception_Data_Ptr) is
   begin
      if Item.HTable_Ptr = null then
         Prepend_To_Chain : declare
            Chain : Exception_Data_Ptr
                      renames HTable (Hash (To_Ptr (Item.Full_Name).all));

         begin
            if Chain = null then
               Item.HTable_Ptr := Item;
            else
               Item.HTable_Ptr := Chain;
            end if;

            Chain := Item;
         end Prepend_To_Chain;
      end if;
   end Register;

   -------------------------------
   -- Get_Registered_Exceptions --
   -------------------------------

   procedure Get_Registered_Exceptions
     (List : out Exception_Data_Array;
      Last : out Integer)
   is
      procedure Get_One (Item : Exception_Data_Ptr; More : out Boolean);
      --  Add Item to List (List'First .. Last) by first incrementing Last
      --  and storing Item in List (Last). Last should be in List'First - 1
      --  and List'Last.

      procedure Get_All is new Iterate (Get_One);
      --  Store all registered exceptions in List, updating Last

      -------------
      -- Get_One --
      -------------

      procedure Get_One (Item : Exception_Data_Ptr; More : out Boolean) is
      begin
         if Last < List'Last then
            Last := Last + 1;
            List (Last) := Item;
            More := True;

         else
            More := False;
         end if;
      end Get_One;

   begin
      --  In this routine the invariant is that List (List'First .. Last)
      --  contains the registered exceptions retrieved so far.

      Last := List'First - 1;

      Lock_Task.all;
      Get_All;
      Unlock_Task.all;
   end Get_Registered_Exceptions;

   ------------------------
   -- Internal_Exception --
   ------------------------

   function Internal_Exception
     (X                   : String;
      Create_If_Not_Exist : Boolean := True) return Exception_Data_Ptr
   is
      --  If X was not yet registered and Create_if_Not_Exist is True,
      --  dynamically allocate and register a new exception.

      type String_Ptr is access all String;

      Dyn_Copy : String_Ptr;
      Copy     : aliased String (X'First .. X'Last + 1);
      Result   : Exception_Data_Ptr;

   begin
      Lock_Task.all;

      Copy (X'Range) := X;
      Copy (Copy'Last) := ASCII.NUL;
      Result := Lookup (Copy);

      --  If unknown exception, create it on the heap. This is a legitimate
      --  situation in the distributed case when an exception is defined
      --  only in a partition

      if Result = null and then Create_If_Not_Exist then
         Dyn_Copy := new String'(Copy);

         Result :=
           new Exception_Data'
             (Not_Handled_By_Others => False,
              Lang                  => 'A',
              Name_Length           => Copy'Length,
              Full_Name             => Dyn_Copy.all'Address,
              HTable_Ptr            => null,
              Foreign_Data          => Null_Address,
              Raise_Hook            => null);

         Register (Result);
      end if;

      Unlock_Task.all;

      return Result;
   end Internal_Exception;

   ------------------------
   -- Register_Exception --
   ------------------------

   procedure Register_Exception (X : Exception_Data_Ptr) is
   begin
      Lock_Task.all;
      Register (X);
      Unlock_Task.all;
   end Register_Exception;

   ---------------------------------
   -- Registered_Exceptions_Count --
   ---------------------------------

   function Registered_Exceptions_Count return Natural is
      Count : Natural := 0;

      procedure Count_Item (Item : Exception_Data_Ptr; More : out Boolean);
      --  Update Count for given Item

      procedure Count_Item (Item : Exception_Data_Ptr; More : out Boolean) is
         pragma Unreferenced (Item);
      begin
         Count := Count + 1;
         More := Count < Natural'Last;
      end Count_Item;

      procedure Count_All is new Iterate (Count_Item);

   begin
      Lock_Task.all;
      Count_All;
      Unlock_Task.all;

      return Count;
   end Registered_Exceptions_Count;

begin
   --  Register the standard exceptions at elaboration time

   --  We don't need to use the locking version here as the elaboration
   --  will not be concurrent and no tasks can call any subprograms of this
   --  unit before it has been elaborated.

   Register (Abort_Signal_Def'Access);
   Register (Tasking_Error_Def'Access);
   Register (Storage_Error_Def'Access);
   Register (Program_Error_Def'Access);
   Register (Numeric_Error_Def'Access);
   Register (Constraint_Error_Def'Access);
end System.Exception_Table;