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
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
#![allow(clippy::collapsible_else_if)]
//! This module contains the functions for receiving
//! a payload for binary sessions.
use crate::binary::cancel::cancel;
use crate::binary::struct_trait::session::Session;
use crate::binary_atmp::struct_trait::recv::RecvTimed;
use std::collections::HashMap;
// use std::convert::TryFrom;
use std::error::Error;
use std::marker;
use std::time::{Duration, Instant};
/// Receive a value of type `T`. Can fail. Returns either a
/// pair of the received value and the continuation of the
/// session `S` or an error.
pub fn recv<
T,
const CLOCK: char,
const START: i128,
const INCLUDE_START: bool,
const END: i128,
const INCLUDE_END: bool,
const RESET: char,
S,
>(
all_clocks: &mut HashMap<char, Instant>,
s: RecvTimed<T, CLOCK, START, INCLUDE_START, END, INCLUDE_END, RESET, S>,
) -> Result<(T, S), Box<dyn Error>>
where
T: marker::Send,
S: Session,
{
// If the start of the time window is after its end, return an error
if s.start > s.end {
panic!("The start of the time window is after its end")
}
// if there is no lower bound
if s.start < 0 {
// if there is an upper bound
if s.end >= 0 {
// if this upper bound is included in the time constraint
if s.include_end {
// if the clock is available among all clocks
if let Some(own_clock) = all_clocks.get_mut(&s.clock) {
// if the clock respects the time constraint and the clock must be reset
if own_clock.elapsed().as_secs() <= u64::try_from(s.end)? && s.reset != ' ' {
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, c)) => {
let clock_to_reset = all_clocks.get_mut(&s.reset).unwrap();
*clock_to_reset = Instant::now();
Ok((v, c))
}
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
// if the clock respects the time constraint and the clock must not be reset
} else if own_clock.elapsed().as_secs() <= u64::try_from(s.end)? {
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, s)) => Ok((v, s)),
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
// if the clock does not respect the time constraint
} else {
panic!("Timeout for clock {}", s.clock);
}
// if the clock is not available among all clocks
} else {
panic!("The clock {} is not available in {:?}", s.clock, all_clocks);
}
// if this upper bound is not included in the time constraint. In this case, we remove
// one time from the upper bound
} else {
// if the clock is available among all clocks
if let Some(own_clock) = all_clocks.get_mut(&s.clock) {
// if the clock respects the time constraint and the clock must be reset
if own_clock.elapsed().as_secs() < u64::try_from(s.end)? && s.reset != ' ' {
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, c)) => {
let clock_to_reset = all_clocks.get_mut(&s.reset).unwrap();
*clock_to_reset = Instant::now();
Ok((v, c))
}
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
// if the clock respects the time constraint and the clock must not be reset
} else if own_clock.elapsed().as_secs() < u64::try_from(s.end)? {
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, s)) => Ok((v, s)),
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
// if the clock does not respect the time constraint
} else {
panic!("Timeout for clock {}", s.clock);
}
// if the clock is not available among all clocks
} else {
panic!("The clock {} is not available in {:?}", s.clock, all_clocks);
}
}
// if both are negative, recv with blocking
} else {
if !s.include_start && !s.include_end {
match s.channel.recv() {
Ok((v, c)) => Ok((v, c)),
Err(e) => {
cancel(s);
panic!("{}", e.to_string())
}
}
} else {
cancel(s);
panic!(
"{}",
"None of the bounds must be included when they are both negative.".to_string()
);
}
}
// if there is a lower bound
} else {
// if there is no upper bound
if s.end < 0 {
// if this lower bound is included in the time constraint
if s.include_start {
// if the clock is available among all clocks
if let Some(own_clock) = all_clocks.get_mut(&s.clock) {
// if the clock respects the time constraint and the clock must be reset
if u64::try_from(s.start)? <= own_clock.elapsed().as_secs() && s.reset != ' ' {
// blocking receive
match s.channel.recv() {
Ok((v, c)) => {
let clock_to_reset = all_clocks.get_mut(&s.reset).unwrap();
*clock_to_reset = Instant::now();
Ok((v, c))
}
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
// if the clock respects the time constraint and the clock must not be reset
} else if u64::try_from(s.start)? <= own_clock.elapsed().as_secs() {
// blocking receive
match s.channel.recv() {
Ok((v, s)) => Ok((v, s)),
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
// if the clock does not respect the time constraint
} else {
panic!("Timeout for clock {}", s.clock);
}
// if the clock is not available among all clocks
} else {
panic!("The clock {} is not available in {:?}", s.clock, all_clocks);
}
// if this lower bound is not included in the time constraint. In this case, we add one
// unit time from the upper bound
} else {
// if the clock is available among all clocks
if let Some(own_clock) = all_clocks.get_mut(&s.clock) {
// if the clock respects the time constraint and the clock must be reset
if u64::try_from(s.start)? < own_clock.elapsed().as_secs() && s.reset != ' ' {
// blocking receive
match s.channel.recv() {
Ok((v, c)) => {
let clock_to_reset = all_clocks.get_mut(&s.reset).unwrap();
*clock_to_reset = Instant::now();
Ok((v, c))
}
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
// if the clock respects the time constraint and the clock must not be reset
} else if u64::try_from(s.start)? < own_clock.elapsed().as_secs() {
// blocking receive
match s.channel.recv() {
Ok((v, s)) => Ok((v, s)),
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
// if the clock does not respect the time constraint
} else {
panic!("Timeout for clock {}", s.clock);
}
// if the clock is not available among all clocks
} else {
panic!("The clock {} is not available in {:?}", s.clock, all_clocks);
}
}
// if both bounds are correct (positive)
} else {
// if the time constraint does not make sense
if s.start > s.end {
panic!(
"Start and End parameters cannot match: start = {} > {} = end",
s.start, s.end
);
}
// match on the possible inclusion of the bounds
match (s.include_start, s.include_end) {
// if both bounds are included
(true, true) => {
if let Some(own_clock) = all_clocks.get_mut(&s.clock) {
if u64::try_from(s.start)? <= own_clock.elapsed().as_secs()
&& own_clock.elapsed().as_secs() <= u64::try_from(s.end)?
&& s.reset != ' '
{
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, c)) => {
let clock_to_reset = all_clocks.get_mut(&s.reset).unwrap();
*clock_to_reset = Instant::now();
Ok((v, c))
}
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
} else if u64::try_from(s.start)? <= own_clock.elapsed().as_secs()
&& own_clock.elapsed().as_secs() <= u64::try_from(s.end)?
{
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, s)) => Ok((v, s)),
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
} else {
panic!("Timeout for clock {}", s.clock);
}
} else {
panic!("The clock {} is not available in {:?}", s.clock, all_clocks);
}
}
// if only the lower bound is included
(true, false) => {
if let Some(own_clock) = all_clocks.get_mut(&s.clock) {
if u64::try_from(s.start)? <= own_clock.elapsed().as_secs()
&& own_clock.elapsed().as_secs() < u64::try_from(s.end)?
&& s.reset != ' '
{
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, c)) => {
let clock_to_reset = all_clocks.get_mut(&s.reset).unwrap();
*clock_to_reset = Instant::now();
Ok((v, c))
}
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
} else if u64::try_from(s.start)? <= own_clock.elapsed().as_secs()
&& own_clock.elapsed().as_secs() < u64::try_from(s.end)?
{
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, s)) => Ok((v, s)),
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
} else {
panic!("Timeout for clock {}", s.clock);
}
} else {
panic!("The clock {} is not available in {:?}", s.clock, all_clocks);
}
}
// if only the upper bound is included
(false, true) => {
if let Some(own_clock) = all_clocks.get_mut(&s.clock) {
if u64::try_from(s.start)? < own_clock.elapsed().as_secs()
&& own_clock.elapsed().as_secs() <= u64::try_from(s.end)?
&& s.reset != ' '
{
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, c)) => {
let clock_to_reset = all_clocks.get_mut(&s.reset).unwrap();
*clock_to_reset = Instant::now();
Ok((v, c))
}
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
} else if u64::try_from(s.start)? < own_clock.elapsed().as_secs()
&& own_clock.elapsed().as_secs() <= u64::try_from(s.end)?
{
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, s)) => Ok((v, s)),
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
} else {
panic!("Timeout for clock {}", s.clock);
}
} else {
panic!("The clock {} is not available in {:?}", s.clock, all_clocks);
}
}
// if none of the bounds are included
(false, false) => {
if let Some(own_clock) = all_clocks.get_mut(&s.clock) {
if u64::try_from(s.start)? < own_clock.elapsed().as_secs()
&& own_clock.elapsed().as_secs() < u64::try_from(s.end)?
&& s.reset != ' '
{
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, c)) => {
let clock_to_reset = all_clocks.get_mut(&s.reset).unwrap();
*clock_to_reset = Instant::now();
Ok((v, c))
}
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
} else if u64::try_from(s.start)? < own_clock.elapsed().as_secs()
&& own_clock.elapsed().as_secs() < u64::try_from(s.end)?
{
// receive with timeout
match s.channel.recv_timeout(
Duration::from_secs(u64::try_from(s.end)?) - own_clock.elapsed(),
) {
Ok((v, s)) => Ok((v, s)),
Err(e) => {
cancel(s);
Err(Box::new(e))
}
}
} else {
panic!("Timeout for clock {}", s.clock);
}
} else {
panic!("The clock {} is not available in {:?}", s.clock, all_clocks);
}
}
}
}
}
}