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
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . S E C O N D A R Y _ S T A C K --
-- --
-- B o d y --
-- --
-- $Revision: 1.35 $ --
-- --
-- Copyright (C) 1992-1997 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 2, 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 COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
with System.Task_Specific_Data;
with System.Tasking_Soft_Links;
with Unchecked_Conversion;
with Unchecked_Deallocation;
package body System.Secondary_Stack is
use type SSE.Storage_Offset;
-- +------------------+
-- | Next |
-- +------------------+
-- | | Last (200)
-- | |
-- | |
-- | |
-- | |
-- | |
-- | | First (101)
-- +------------------+
-- +----------> | | |
-- | +----------+-------+
-- | | |
-- | ^ V
-- | | |
-- | +-------+----------+
-- | | | |
-- | +------------------+
-- | | | Last (100)
-- | | C |
-- | | H |
-- +-----------------+ | +-------->| U |
-- | Current_Chunk -|--+ | | N |
-- +-----------------+ | | K |
-- | Top -|-----+ | | First (1)
-- +-----------------+ +------------------+
-- | Default_Size | | Prev |
-- +-----------------+ +------------------+
--
--
type Memory is array (Mark_Id range <>) of SSE.Storage_Element;
type Chunk_Id (First, Last : Mark_Id);
type Chunk_Ptr is access Chunk_Id;
type Chunk_Id (First, Last : Mark_Id) is record
Prev, Next : Chunk_Ptr;
Mem : Memory (First .. Last);
end record;
type Stack_Id is record
Top : Mark_Id;
Current_Chunk : Chunk_Ptr;
Default_Size : SSE.Storage_Count;
end record;
type Stack_Ptr is access Stack_Id;
function From_Addr is new Unchecked_Conversion (Address, Stack_Ptr);
function To_Addr is new Unchecked_Conversion (Stack_Ptr, System.Address);
procedure Free is new Unchecked_Deallocation (Chunk_Id, Chunk_Ptr);
--------------
-- Allocate --
--------------
procedure SS_Allocate
(Address : out System.Address;
Storage_Size : SSE.Storage_Count)
is
Stack : constant Stack_Ptr :=
From_Addr
(System.Task_Specific_Data.Get_Sec_Stack_Addr);
Chunk : Chunk_Ptr := Stack.Current_Chunk;
Max_Align : constant Mark_Id := Mark_Id (Standard'Maximum_Alignment);
Max_Size : constant Mark_Id :=
((Mark_Id (Storage_Size) + Max_Align - 1) / Max_Align)
* Max_Align;
Count_Unreleased_Chunks : Natural;
To_Be_Released_Chunk : Chunk_Ptr;
begin
-- The Current_Chunk may not be the good one if a lot of release
-- operations have taken place. So go down the stack if necessary
while Chunk.First > Stack.Top loop
Chunk := Chunk.Prev;
end loop;
-- Find out if the available memory in the current chunk is sufficient.
-- if not, go to the next one and eventally create the necessary room
Count_Unreleased_Chunks := 0;
while Chunk.Last - Stack.Top + 1 < Max_Size loop
if Chunk.Next /= null then
-- Release unused non-first empty chunk
if Chunk.Prev /= null and then Chunk.First = Stack.Top then
To_Be_Released_Chunk := Chunk;
Chunk := Chunk.Prev;
Chunk.Next := To_Be_Released_Chunk.Next;
To_Be_Released_Chunk.Next.Prev := Chunk;
Free (To_Be_Released_Chunk);
end if;
-- Create new chunk of the default size unless it is not sufficient
elsif SSE.Storage_Count (Max_Size) <= Stack.Default_Size then
Chunk.Next := new Chunk_Id (
First => Chunk.Last + 1,
Last => Chunk.Last + Mark_Id (Stack.Default_Size));
Chunk.Next.Prev := Chunk;
else
Chunk.Next := new Chunk_Id (
First => Chunk.Last + 1,
Last => Chunk.Last + Max_Size);
Chunk.Next.Prev := Chunk;
end if;
Chunk := Chunk.Next;
Stack.Top := Chunk.First;
end loop;
-- Resulting address is the address pointed by Stack.Top
Address := Chunk.Mem (Stack.Top)'Address;
Stack.Top := Stack.Top + Mark_Id (Max_Size);
Stack.Current_Chunk := Chunk;
end SS_Allocate;
-------------
-- SS_Init --
-------------
procedure SS_Init (Stk : out System.Address; Size : Natural) is
Stack : Stack_Ptr;
begin
Stack := new Stack_Id;
Stack.Current_Chunk := new Chunk_Id (1, Mark_Id (Size));
Stack.Top := 1;
Stack.Default_Size := SSE.Storage_Count (Size);
Stk := To_Addr (Stack);
end SS_Init;
-------------
-- SS_Free --
-------------
procedure SS_Free (Stk : System.Address) is
Stack : Stack_Ptr := From_Addr (Stk);
Chunk : Chunk_Ptr := Stack.Current_Chunk;
procedure Free is new Unchecked_Deallocation (Stack_Id, Stack_Ptr);
begin
while Chunk.Prev /= null loop
Chunk := Chunk.Prev;
end loop;
while Chunk.Next /= null loop
Chunk := Chunk.Next;
Free (Chunk.Prev);
end loop;
Free (Chunk);
Free (Stack);
end SS_Free;
-------------
-- SS_Mark --
-------------
function SS_Mark return Mark_Id is
begin
return From_Addr (System.Task_Specific_Data.Get_Sec_Stack_Addr).Top;
end SS_Mark;
----------------
-- SS_Release --
----------------
procedure SS_Release (M : Mark_Id) is
begin
From_Addr (System.Task_Specific_Data.Get_Sec_Stack_Addr).Top := M;
end SS_Release;
-------------
-- SS_Info --
-------------
procedure SS_Info is
Stack : constant Stack_Ptr :=
From_Addr
(System.Task_Specific_Data.Get_Sec_Stack_Addr);
Nb_Chunks : Integer := 1;
Chunk : Chunk_Ptr := Stack.Current_Chunk;
begin
Put_Line ("Secondary Stack information:");
while Chunk.Prev /= null loop
Chunk := Chunk.Prev;
end loop;
while Chunk.Next /= null loop
Nb_Chunks := Nb_Chunks + 1;
Chunk := Chunk.Next;
end loop;
-- Current Chunk information
Put_Line (
" Total size : "
& Mark_Id'Image (Chunk.Last)
& " bytes");
Put_Line (
" Current allocated space : "
& Mark_Id'Image (Stack.Top - 1)
& " bytes");
Put_Line (
" Number of Chunks : "
& Integer'Image (Nb_Chunks));
Put_Line (
" Default size of Chunks : "
& SSE.Storage_Count'Image (Stack.Default_Size));
end SS_Info;
begin
System.Tasking_Soft_Links.SS_Init := SS_Init'Access;
System.Tasking_Soft_Links.SS_Free := SS_Free'Access;
declare
Main_SS : Address;
begin
-- What is this constant doing here ???
SS_Init (Main_SS, 10 * 1024);
System.Tasking_Soft_Links.Set_Sec_Stack_Addr_NT (Main_SS);
end;
end System.Secondary_Stack;
|
