Daily bump.
[official-gcc.git] / gcc / ada / 5atpopsp.adb
blob6d8cb87a2c9b64704450ffee6ec2094b16f27b8c
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS --
4 -- --
5 -- S Y S T E M . T A S K _ P R I M I T I V E S . O P E R A T I O N S . --
6 -- S P E C I F I C --
7 -- --
8 -- B o d y --
9 -- --
10 -- $Revision: 1.1 $
11 -- --
12 -- Copyright (C) 1991-2001, Florida State University --
13 -- --
14 -- GNARL is free software; you can redistribute it and/or modify it under --
15 -- terms of the GNU General Public License as published by the Free Soft- --
16 -- ware Foundation; either version 2, or (at your option) any later ver- --
17 -- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
18 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
19 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
20 -- for more details. You should have received a copy of the GNU General --
21 -- Public License distributed with GNARL; see file COPYING. If not, write --
22 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
23 -- MA 02111-1307, USA. --
24 -- --
25 -- As a special exception, if other files instantiate generics from this --
26 -- unit, or you link this unit with other files to produce an executable, --
27 -- this unit does not by itself cause the resulting executable to be --
28 -- covered by the GNU General Public License. This exception does not --
29 -- however invalidate any other reasons why the executable file might be --
30 -- covered by the GNU Public License. --
31 -- --
32 -- GNARL was developed by the GNARL team at Florida State University. It is --
33 -- now maintained by Ada Core Technologies Inc. in cooperation with Florida --
34 -- State University (http://www.gnat.com). --
35 -- --
36 ------------------------------------------------------------------------------
38 -- This is a POSIX version of this package where foreign threads are
39 -- recognized.
40 -- Currently, DEC Unix, SCO UnixWare, Solaris pthread, HPUX pthread and RTEMS
41 -- use this version.
43 with System.Soft_Links;
44 -- used to initialize TSD for a C thread, in function Self
46 separate (System.Task_Primitives.Operations)
47 package body Specific is
49 ------------------
50 -- Local Data --
51 ------------------
53 -- The followings are logically constants, but need to be initialized
54 -- at run time.
56 ATCB_Key : aliased pthread_key_t;
57 -- Key used to find the Ada Task_ID associated with a thread
59 -- The following are used to allow the Self function to
60 -- automatically generate ATCB's for C threads that happen to call
61 -- Ada procedure, which in turn happen to call the Ada runtime system.
63 type Fake_ATCB;
64 type Fake_ATCB_Ptr is access Fake_ATCB;
65 type Fake_ATCB is record
66 Stack_Base : Interfaces.C.unsigned := 0;
67 -- A value of zero indicates the node is not in use.
68 Next : Fake_ATCB_Ptr;
69 Real_ATCB : aliased Ada_Task_Control_Block (0);
70 end record;
72 Fake_ATCB_List : Fake_ATCB_Ptr;
73 -- A linear linked list.
74 -- The list is protected by All_Tasks_L;
75 -- Nodes are added to this list from the front.
76 -- Once a node is added to this list, it is never removed.
78 Fake_Task_Elaborated : aliased Boolean := True;
79 -- Used to identified fake tasks (i.e., non-Ada Threads).
81 Next_Fake_ATCB : Fake_ATCB_Ptr;
82 -- Used to allocate one Fake_ATCB in advance. See comment in New_Fake_ATCB
84 -----------------------
85 -- Local Subprograms --
86 -----------------------
88 ---------------------------------
89 -- Support for New_Fake_ATCB --
90 ---------------------------------
92 function New_Fake_ATCB return Task_ID;
93 -- Allocate and Initialize a new ATCB. This code can safely be called from
94 -- a foreign thread, as it doesn't access implicitly or explicitly
95 -- "self" before having initialized the new ATCB.
97 -------------------
98 -- New_Fake_ATCB --
99 -------------------
101 function New_Fake_ATCB return Task_ID is
102 Self_ID : Task_ID;
103 P, Q : Fake_ATCB_Ptr;
104 Succeeded : Boolean;
105 Result : Interfaces.C.int;
107 begin
108 -- This section is ticklish.
109 -- We dare not call anything that might require an ATCB, until
110 -- we have the new ATCB in place.
112 Write_Lock (All_Tasks_L'Access);
113 Q := null;
114 P := Fake_ATCB_List;
116 while P /= null loop
117 if P.Stack_Base = 0 then
118 Q := P;
119 end if;
121 P := P.Next;
122 end loop;
124 if Q = null then
126 -- Create a new ATCB with zero entries.
128 Self_ID := Next_Fake_ATCB.Real_ATCB'Access;
129 Next_Fake_ATCB.Stack_Base := 1;
130 Next_Fake_ATCB.Next := Fake_ATCB_List;
131 Fake_ATCB_List := Next_Fake_ATCB;
132 Next_Fake_ATCB := null;
134 else
135 -- Reuse an existing fake ATCB.
137 Self_ID := Q.Real_ATCB'Access;
138 Q.Stack_Base := 1;
139 end if;
141 -- Record this as the Task_ID for the current thread.
143 Self_ID.Common.LL.Thread := pthread_self;
144 Result := pthread_setspecific (ATCB_Key, To_Address (Self_ID));
145 pragma Assert (Result = 0);
147 -- Do the standard initializations
149 System.Tasking.Initialize_ATCB
150 (Self_ID, null, Null_Address, Null_Task, Fake_Task_Elaborated'Access,
151 System.Priority'First, Task_Info.Unspecified_Task_Info, 0, Self_ID,
152 Succeeded);
153 pragma Assert (Succeeded);
155 -- Finally, it is safe to use an allocator in this thread.
157 if Next_Fake_ATCB = null then
158 Next_Fake_ATCB := new Fake_ATCB;
159 end if;
161 Self_ID.Master_of_Task := 0;
162 Self_ID.Master_Within := Self_ID.Master_of_Task + 1;
164 for L in Self_ID.Entry_Calls'Range loop
165 Self_ID.Entry_Calls (L).Self := Self_ID;
166 Self_ID.Entry_Calls (L).Level := L;
167 end loop;
169 Self_ID.Common.State := Runnable;
170 Self_ID.Awake_Count := 1;
172 -- Since this is not an ordinary Ada task, we will start out undeferred
174 Self_ID.Deferral_Level := 0;
176 System.Soft_Links.Create_TSD (Self_ID.Common.Compiler_Data);
178 -- ????
179 -- The following call is commented out to avoid dependence on
180 -- the System.Tasking.Initialization package.
181 -- It seems that if we want Ada.Task_Attributes to work correctly
182 -- for C threads we will need to raise the visibility of this soft
183 -- link to System.Soft_Links.
184 -- We are putting that off until this new functionality is otherwise
185 -- stable.
186 -- System.Tasking.Initialization.Initialize_Attributes_Link.all (T);
188 for J in Known_Tasks'Range loop
189 if Known_Tasks (J) = null then
190 Known_Tasks (J) := Self_ID;
191 Self_ID.Known_Tasks_Index := J;
192 exit;
193 end if;
194 end loop;
196 -- Must not unlock until Next_ATCB is again allocated.
198 Unlock (All_Tasks_L'Access);
199 return Self_ID;
200 end New_Fake_ATCB;
202 ----------------
203 -- Initialize --
204 ----------------
206 procedure Initialize (Environment_Task : Task_ID) is
207 Result : Interfaces.C.int;
209 begin
210 Result := pthread_key_create (ATCB_Key'Access, null);
211 pragma Assert (Result = 0);
212 Result := pthread_setspecific (ATCB_Key, To_Address (Environment_Task));
213 pragma Assert (Result = 0);
215 -- Create a free ATCB for use on the Fake_ATCB_List.
217 Next_Fake_ATCB := new Fake_ATCB;
218 end Initialize;
220 ---------
221 -- Set --
222 ---------
224 procedure Set (Self_Id : Task_ID) is
225 Result : Interfaces.C.int;
227 begin
228 Result := pthread_setspecific (ATCB_Key, To_Address (Self_Id));
229 pragma Assert (Result = 0);
230 end Set;
232 ----------
233 -- Self --
234 ----------
236 -- To make Ada tasks and C threads interoperate better, we have
237 -- added some functionality to Self. Suppose a C main program
238 -- (with threads) calls an Ada procedure and the Ada procedure
239 -- calls the tasking runtime system. Eventually, a call will be
240 -- made to self. Since the call is not coming from an Ada task,
241 -- there will be no corresponding ATCB.
243 -- (The entire Ada run-time system may not have been elaborated,
244 -- either, but that is a different problem, that we will need to
245 -- solve another way.)
247 -- What we do in Self is to catch references that do not come
248 -- from recognized Ada tasks, and create an ATCB for the calling
249 -- thread.
251 -- The new ATCB will be "detached" from the normal Ada task
252 -- master hierarchy, much like the existing implicitly created
253 -- signal-server tasks.
255 -- We will also use such points to poll for disappearance of the
256 -- threads associated with any implicit ATCBs that we created
257 -- earlier, and take the opportunity to recover them.
259 -- A nasty problem here is the limitations of the compilation
260 -- order dependency, and in particular the GNARL/GNULLI layering.
261 -- To initialize an ATCB we need to assume System.Tasking has
262 -- been elaborated.
264 function Self return Task_ID is
265 Result : System.Address;
267 begin
268 Result := pthread_getspecific (ATCB_Key);
270 -- If the key value is Null, then it is a non-Ada task.
272 if Result = System.Null_Address then
273 return New_Fake_ATCB;
274 end if;
276 return To_Task_ID (Result);
277 end Self;
279 end Specific;