-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchild_processes-standard_io.adb
193 lines (158 loc) · 7.12 KB
/
child_processes-standard_io.adb
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
------------------------------------------------------------------------------
-- --
-- Ada User Repository Annex (AURA) --
-- ANNEXI-STRAYLINE Reference Implementation --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2020, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Calendar;
package body Child_Processes.Standard_IO is
----------------
-- Set_Handle --
----------------
procedure Set_Handle (Stream: in out Standard_IO_Stream;
Handle: in Platform.Stream_Handle)
is
begin
Stream.Handle := Handle;
end Set_Handle;
------------
-- Handle --
------------
function Handle (Stream: in out Standard_IO_Stream)
return Platform.Stream_Handle
is (Stream.Handle);
-----------------
-- Set_Timeout --
-----------------
procedure Set_Timeout (Stream : in out Standard_IO_Stream;
Timeout: in Duration)
is
begin
Stream.Timeout := Timeout;
end Set_Timeout;
----------
-- Read --
----------
procedure Read (Stream: in out Standard_IO_Stream;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is
use Ada.Calendar;
First_Attempt: Time;
Timed_Out: Boolean;
begin
-- First try the whole thing in one shot
Platform.Read_Buffer
(Stream => Stream.Handle,
Buffer => Item,
Last => Last);
if Last = Item'Last then
-- That was easy!
return;
else
-- Otherwise we need to go into a wait loop
Last := Item'First - 1;
First_Attempt := Clock;
end if;
while Last < Item'Last
and then (if Stream.Timeout > 0.0 then
Clock <= (First_Attempt + Stream.Timeout))
loop
Platform.Wait_Can_Read (Stream => Stream.Handle,
Timeout => Stream.Timeout,
Timed_Out => Timed_Out);
if Timed_Out then
-- No question that this is timeout
return;
else
-- Try to read in the next chunk
Platform.Read_Buffer
(Stream => Stream.Handle,
Buffer => Item(Last + 1 .. Item'Last),
Last => Last);
end if;
end loop;
end Read;
-----------
-- Write --
-----------
overriding
procedure Write (Stream: in out Standard_IO_Stream;
Item : in Stream_Element_Array)
is
use Ada.Calendar;
First_Attempt: Time := Clock;
Last: Stream_Element_Offset := Item'First - 1;
Timed_Out: Boolean;
procedure Timeout_Raise is
begin
raise Storage_Error with "Platform stream buffer full";
end Timeout_Raise;
begin
loop
-- Much simpler without a buffer!
Platform.Write_Buffer (Stream => Stream.Handle,
Buffer => Item(Last + 1 .. Item'Last),
Last => Last);
exit when Last = Item'Last;
if Stream.Timeout > 0.0
and then Clock > (First_Attempt + Stream.Timeout)
then
Timeout_Raise;
end if;
Platform.Wait_Can_Write (Stream => Stream.Handle,
Timeout => Stream.Timeout,
Timed_Out => Timed_Out);
if Timed_Out then
Timeout_Raise;
end if;
end loop;
end Write;
--------------------
-- Read_Immediate --
--------------------
procedure Read_Immediate (Stream: in out Standard_IO_Stream;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is begin
Platform.Read_Buffer (Stream => Stream.Handle,
Buffer => Item,
Last => Last);
end Read_Immediate;
end Child_Processes.Standard_IO;