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
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- I N T E R F A C E S . C . P O I N T E R S --
-- --
-- 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 Interfaces.C.Strings; use Interfaces.C.Strings;
with System; use System;
with Ada.Unchecked_Conversion;
package body Interfaces.C.Pointers is
type Addr is mod Memory_Size;
function To_Pointer is new Ada.Unchecked_Conversion (Addr, Pointer);
function To_Addr is new Ada.Unchecked_Conversion (Pointer, Addr);
function To_Addr is new Ada.Unchecked_Conversion (ptrdiff_t, Addr);
function To_Ptrdiff is new Ada.Unchecked_Conversion (Addr, ptrdiff_t);
Elmt_Size : constant ptrdiff_t :=
(Element_Array'Component_Size
+ Storage_Unit - 1) / Storage_Unit;
subtype Index_Base is Index'Base;
---------
-- "+" --
---------
function "+" (Left : Pointer; Right : ptrdiff_t) return Pointer is
begin
if Left = null then
raise Pointer_Error;
end if;
return To_Pointer (To_Addr (Left) + To_Addr (Elmt_Size * Right));
end "+";
function "+" (Left : ptrdiff_t; Right : Pointer) return Pointer is
begin
if Right = null then
raise Pointer_Error;
end if;
return To_Pointer (To_Addr (Elmt_Size * Left) + To_Addr (Right));
end "+";
---------
-- "-" --
---------
function "-" (Left : Pointer; Right : ptrdiff_t) return Pointer is
begin
if Left = null then
raise Pointer_Error;
end if;
return To_Pointer (To_Addr (Left) - To_Addr (Right * Elmt_Size));
end "-";
function "-" (Left : Pointer; Right : Pointer) return ptrdiff_t is
begin
if Left = null or else Right = null then
raise Pointer_Error;
end if;
return To_Ptrdiff (To_Addr (Left) - To_Addr (Right)) / Elmt_Size;
end "-";
----------------
-- Copy_Array --
----------------
procedure Copy_Array
(Source : Pointer;
Target : Pointer;
Length : ptrdiff_t)
is
T : Pointer := Target;
S : Pointer := Source;
begin
if S = null or else T = null then
raise Dereference_Error;
else
for J in 1 .. Length loop
T.all := S.all;
Increment (T);
Increment (S);
end loop;
end if;
end Copy_Array;
---------------------------
-- Copy_Terminated_Array --
---------------------------
procedure Copy_Terminated_Array
(Source : Pointer;
Target : Pointer;
Limit : ptrdiff_t := ptrdiff_t'Last;
Terminator : Element := Default_Terminator)
is
S : Pointer := Source;
T : Pointer := Target;
L : ptrdiff_t := Limit;
begin
if S = null or else T = null then
raise Dereference_Error;
else
while L > 0 loop
T.all := S.all;
exit when T.all = Terminator;
Increment (T);
Increment (S);
L := L - 1;
end loop;
end if;
end Copy_Terminated_Array;
---------------
-- Decrement --
---------------
procedure Decrement (Ref : in out Pointer) is
begin
Ref := Ref - 1;
end Decrement;
---------------
-- Increment --
---------------
procedure Increment (Ref : in out Pointer) is
begin
Ref := Ref + 1;
end Increment;
-----------
-- Value --
-----------
function Value
(Ref : Pointer;
Terminator : Element := Default_Terminator) return Element_Array
is
P : Pointer;
L : constant Index_Base := Index'First;
H : Index_Base;
begin
if Ref = null then
raise Dereference_Error;
else
H := L;
P := Ref;
loop
exit when P.all = Terminator;
H := Index_Base'Succ (H);
Increment (P);
end loop;
declare
subtype A is Element_Array (L .. H);
type PA is access A;
function To_PA is new Ada.Unchecked_Conversion (Pointer, PA);
begin
return To_PA (Ref).all;
end;
end if;
end Value;
function Value
(Ref : Pointer;
Length : ptrdiff_t) return Element_Array
is
L : Index_Base;
H : Index_Base;
begin
if Ref = null then
raise Dereference_Error;
-- For length zero, we need to return a null slice, but we can't make
-- the bounds of this slice Index'First, since this could cause a
-- Constraint_Error if Index'First = Index'Base'First.
elsif Length <= 0 then
declare
pragma Warnings (Off); -- kill warnings since X not assigned
X : Element_Array (Index'Succ (Index'First) .. Index'First);
pragma Warnings (On);
begin
return X;
end;
-- Normal case (length non-zero)
else
L := Index'First;
H := Index'Val (Index'Pos (Index'First) + Length - 1);
declare
subtype A is Element_Array (L .. H);
type PA is access A;
function To_PA is new Ada.Unchecked_Conversion (Pointer, PA);
begin
return To_PA (Ref).all;
end;
end if;
end Value;
--------------------
-- Virtual_Length --
--------------------
function Virtual_Length
(Ref : Pointer;
Terminator : Element := Default_Terminator) return ptrdiff_t
is
P : Pointer;
C : ptrdiff_t;
begin
if Ref = null then
raise Dereference_Error;
else
C := 0;
P := Ref;
while P.all /= Terminator loop
C := C + 1;
Increment (P);
end loop;
return C;
end if;
end Virtual_Length;
end Interfaces.C.Pointers;
|
