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
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
|
(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
(** [no_nested_borrows] *)
Require Import Primitives.
Import Primitives.
Require Import Coq.ZArith.ZArith.
Require Import List.
Import ListNotations.
Local Open Scope Primitives_scope.
Module NoNestedBorrows.
(** [no_nested_borrows::Pair]
Source: 'src/no_nested_borrows.rs', lines 4:0-4:23 *)
Record Pair_t (T1 T2 : Type) := mkPair_t { pair_x : T1; pair_y : T2; }.
Arguments mkPair_t { _ _ }.
Arguments pair_x { _ _ }.
Arguments pair_y { _ _ }.
(** [no_nested_borrows::List]
Source: 'src/no_nested_borrows.rs', lines 9:0-9:16 *)
Inductive List_t (T : Type) :=
| List_Cons : T -> List_t T -> List_t T
| List_Nil : List_t T
.
Arguments List_Cons { _ }.
Arguments List_Nil { _ }.
(** [no_nested_borrows::One]
Source: 'src/no_nested_borrows.rs', lines 20:0-20:16 *)
Inductive One_t (T1 : Type) := | One_One : T1 -> One_t T1.
Arguments One_One { _ }.
(** [no_nested_borrows::EmptyEnum]
Source: 'src/no_nested_borrows.rs', lines 26:0-26:18 *)
Inductive EmptyEnum_t := | EmptyEnum_Empty : EmptyEnum_t.
(** [no_nested_borrows::Enum]
Source: 'src/no_nested_borrows.rs', lines 32:0-32:13 *)
Inductive Enum_t := | Enum_Variant1 : Enum_t | Enum_Variant2 : Enum_t.
(** [no_nested_borrows::EmptyStruct]
Source: 'src/no_nested_borrows.rs', lines 39:0-39:22 *)
Definition EmptyStruct_t : Type := unit.
(** [no_nested_borrows::Sum]
Source: 'src/no_nested_borrows.rs', lines 41:0-41:20 *)
Inductive Sum_t (T1 T2 : Type) :=
| Sum_Left : T1 -> Sum_t T1 T2
| Sum_Right : T2 -> Sum_t T1 T2
.
Arguments Sum_Left { _ _ }.
Arguments Sum_Right { _ _ }.
(** [no_nested_borrows::neg_test]: forward function
Source: 'src/no_nested_borrows.rs', lines 48:0-48:30 *)
Definition neg_test (x : i32) : result i32 :=
i32_neg x.
(** [no_nested_borrows::add_u32]: forward function
Source: 'src/no_nested_borrows.rs', lines 54:0-54:37 *)
Definition add_u32 (x : u32) (y : u32) : result u32 :=
u32_add x y.
(** [no_nested_borrows::subs_u32]: forward function
Source: 'src/no_nested_borrows.rs', lines 60:0-60:38 *)
Definition subs_u32 (x : u32) (y : u32) : result u32 :=
u32_sub x y.
(** [no_nested_borrows::div_u32]: forward function
Source: 'src/no_nested_borrows.rs', lines 66:0-66:37 *)
Definition div_u32 (x : u32) (y : u32) : result u32 :=
u32_div x y.
(** [no_nested_borrows::div_u32_const]: forward function
Source: 'src/no_nested_borrows.rs', lines 73:0-73:35 *)
Definition div_u32_const (x : u32) : result u32 :=
u32_div x 2%u32.
(** [no_nested_borrows::rem_u32]: forward function
Source: 'src/no_nested_borrows.rs', lines 78:0-78:37 *)
Definition rem_u32 (x : u32) (y : u32) : result u32 :=
u32_rem x y.
(** [no_nested_borrows::mul_u32]: forward function
Source: 'src/no_nested_borrows.rs', lines 82:0-82:37 *)
Definition mul_u32 (x : u32) (y : u32) : result u32 :=
u32_mul x y.
(** [no_nested_borrows::add_i32]: forward function
Source: 'src/no_nested_borrows.rs', lines 88:0-88:37 *)
Definition add_i32 (x : i32) (y : i32) : result i32 :=
i32_add x y.
(** [no_nested_borrows::subs_i32]: forward function
Source: 'src/no_nested_borrows.rs', lines 92:0-92:38 *)
Definition subs_i32 (x : i32) (y : i32) : result i32 :=
i32_sub x y.
(** [no_nested_borrows::div_i32]: forward function
Source: 'src/no_nested_borrows.rs', lines 96:0-96:37 *)
Definition div_i32 (x : i32) (y : i32) : result i32 :=
i32_div x y.
(** [no_nested_borrows::div_i32_const]: forward function
Source: 'src/no_nested_borrows.rs', lines 100:0-100:35 *)
Definition div_i32_const (x : i32) : result i32 :=
i32_div x 2%i32.
(** [no_nested_borrows::rem_i32]: forward function
Source: 'src/no_nested_borrows.rs', lines 104:0-104:37 *)
Definition rem_i32 (x : i32) (y : i32) : result i32 :=
i32_rem x y.
(** [no_nested_borrows::mul_i32]: forward function
Source: 'src/no_nested_borrows.rs', lines 108:0-108:37 *)
Definition mul_i32 (x : i32) (y : i32) : result i32 :=
i32_mul x y.
(** [no_nested_borrows::mix_arith_u32]: forward function
Source: 'src/no_nested_borrows.rs', lines 112:0-112:51 *)
Definition mix_arith_u32 (x : u32) (y : u32) (z : u32) : result u32 :=
i <- u32_add x y;
i0 <- u32_div x y;
i1 <- u32_mul i i0;
i2 <- u32_rem z y;
i3 <- u32_sub x i2;
i4 <- u32_add i1 i3;
i5 <- u32_add x y;
i6 <- u32_add i5 z;
u32_rem i4 i6
.
(** [no_nested_borrows::mix_arith_i32]: forward function
Source: 'src/no_nested_borrows.rs', lines 116:0-116:51 *)
Definition mix_arith_i32 (x : i32) (y : i32) (z : i32) : result i32 :=
i <- i32_add x y;
i0 <- i32_div x y;
i1 <- i32_mul i i0;
i2 <- i32_rem z y;
i3 <- i32_sub x i2;
i4 <- i32_add i1 i3;
i5 <- i32_add x y;
i6 <- i32_add i5 z;
i32_rem i4 i6
.
(** [no_nested_borrows::CONST0]
Source: 'src/no_nested_borrows.rs', lines 125:0-125:23 *)
Definition const0_body : result usize := usize_add 1%usize 1%usize.
Definition const0_c : usize := const0_body%global.
(** [no_nested_borrows::CONST1]
Source: 'src/no_nested_borrows.rs', lines 126:0-126:23 *)
Definition const1_body : result usize := usize_mul 2%usize 2%usize.
Definition const1_c : usize := const1_body%global.
(** [no_nested_borrows::cast_test]: forward function
Source: 'src/no_nested_borrows.rs', lines 128:0-128:31 *)
Definition cast_test (x : u32) : result i32 :=
scalar_cast U32 I32 x.
(** [no_nested_borrows::test2]: forward function
Source: 'src/no_nested_borrows.rs', lines 133:0-133:14 *)
Definition test2 : result unit :=
_ <- u32_add 23%u32 44%u32; Return tt.
(** Unit test for [no_nested_borrows::test2] *)
Check (test2 )%return.
(** [no_nested_borrows::get_max]: forward function
Source: 'src/no_nested_borrows.rs', lines 145:0-145:37 *)
Definition get_max (x : u32) (y : u32) : result u32 :=
if x s>= y then Return x else Return y
.
(** [no_nested_borrows::test3]: forward function
Source: 'src/no_nested_borrows.rs', lines 153:0-153:14 *)
Definition test3 : result unit :=
x <- get_max 4%u32 3%u32;
y <- get_max 10%u32 11%u32;
z <- u32_add x y;
if negb (z s= 15%u32) then Fail_ Failure else Return tt
.
(** Unit test for [no_nested_borrows::test3] *)
Check (test3 )%return.
(** [no_nested_borrows::test_neg1]: forward function
Source: 'src/no_nested_borrows.rs', lines 160:0-160:18 *)
Definition test_neg1 : result unit :=
y <- i32_neg 3%i32; if negb (y s= (-3)%i32) then Fail_ Failure else Return tt
.
(** Unit test for [no_nested_borrows::test_neg1] *)
Check (test_neg1 )%return.
(** [no_nested_borrows::refs_test1]: forward function
Source: 'src/no_nested_borrows.rs', lines 167:0-167:19 *)
Definition refs_test1 : result unit :=
if negb (1%i32 s= 1%i32) then Fail_ Failure else Return tt
.
(** Unit test for [no_nested_borrows::refs_test1] *)
Check (refs_test1 )%return.
(** [no_nested_borrows::refs_test2]: forward function
Source: 'src/no_nested_borrows.rs', lines 178:0-178:19 *)
Definition refs_test2 : result unit :=
if negb (2%i32 s= 2%i32)
then Fail_ Failure
else
if negb (0%i32 s= 0%i32)
then Fail_ Failure
else
if negb (2%i32 s= 2%i32)
then Fail_ Failure
else if negb (2%i32 s= 2%i32) then Fail_ Failure else Return tt
.
(** Unit test for [no_nested_borrows::refs_test2] *)
Check (refs_test2 )%return.
(** [no_nested_borrows::test_list1]: forward function
Source: 'src/no_nested_borrows.rs', lines 194:0-194:19 *)
Definition test_list1 : result unit :=
Return tt.
(** Unit test for [no_nested_borrows::test_list1] *)
Check (test_list1 )%return.
(** [no_nested_borrows::test_box1]: forward function
Source: 'src/no_nested_borrows.rs', lines 199:0-199:18 *)
Definition test_box1 : result unit :=
let b := 0%i32 in
b0 <- alloc_boxed_Box_deref_mut_back i32 b 1%i32;
x <- alloc_boxed_Box_deref i32 b0;
if negb (x s= 1%i32) then Fail_ Failure else Return tt
.
(** Unit test for [no_nested_borrows::test_box1] *)
Check (test_box1 )%return.
(** [no_nested_borrows::copy_int]: forward function
Source: 'src/no_nested_borrows.rs', lines 209:0-209:30 *)
Definition copy_int (x : i32) : result i32 :=
Return x.
(** [no_nested_borrows::test_unreachable]: forward function
Source: 'src/no_nested_borrows.rs', lines 215:0-215:32 *)
Definition test_unreachable (b : bool) : result unit :=
if b then Fail_ Failure else Return tt
.
(** [no_nested_borrows::test_panic]: forward function
Source: 'src/no_nested_borrows.rs', lines 223:0-223:26 *)
Definition test_panic (b : bool) : result unit :=
if b then Fail_ Failure else Return tt
.
(** [no_nested_borrows::test_copy_int]: forward function
Source: 'src/no_nested_borrows.rs', lines 230:0-230:22 *)
Definition test_copy_int : result unit :=
y <- copy_int 0%i32; if negb (0%i32 s= y) then Fail_ Failure else Return tt
.
(** Unit test for [no_nested_borrows::test_copy_int] *)
Check (test_copy_int )%return.
(** [no_nested_borrows::is_cons]: forward function
Source: 'src/no_nested_borrows.rs', lines 237:0-237:38 *)
Definition is_cons (T : Type) (l : List_t T) : result bool :=
match l with | List_Cons t l0 => Return true | List_Nil => Return false end
.
(** [no_nested_borrows::test_is_cons]: forward function
Source: 'src/no_nested_borrows.rs', lines 244:0-244:21 *)
Definition test_is_cons : result unit :=
let l := List_Nil in
b <- is_cons i32 (List_Cons 0%i32 l);
if negb b then Fail_ Failure else Return tt
.
(** Unit test for [no_nested_borrows::test_is_cons] *)
Check (test_is_cons )%return.
(** [no_nested_borrows::split_list]: forward function
Source: 'src/no_nested_borrows.rs', lines 250:0-250:48 *)
Definition split_list (T : Type) (l : List_t T) : result (T * (List_t T)) :=
match l with
| List_Cons hd tl => Return (hd, tl)
| List_Nil => Fail_ Failure
end
.
(** [no_nested_borrows::test_split_list]: forward function
Source: 'src/no_nested_borrows.rs', lines 258:0-258:24 *)
Definition test_split_list : result unit :=
let l := List_Nil in
p <- split_list i32 (List_Cons 0%i32 l);
let (hd, _) := p in
if negb (hd s= 0%i32) then Fail_ Failure else Return tt
.
(** Unit test for [no_nested_borrows::test_split_list] *)
Check (test_split_list )%return.
(** [no_nested_borrows::choose]: forward function
Source: 'src/no_nested_borrows.rs', lines 265:0-265:70 *)
Definition choose (T : Type) (b : bool) (x : T) (y : T) : result T :=
if b then Return x else Return y
.
(** [no_nested_borrows::choose]: backward function 0
Source: 'src/no_nested_borrows.rs', lines 265:0-265:70 *)
Definition choose_back
(T : Type) (b : bool) (x : T) (y : T) (ret : T) : result (T * T) :=
if b then Return (ret, y) else Return (x, ret)
.
(** [no_nested_borrows::choose_test]: forward function
Source: 'src/no_nested_borrows.rs', lines 273:0-273:20 *)
Definition choose_test : result unit :=
z <- choose i32 true 0%i32 0%i32;
z0 <- i32_add z 1%i32;
if negb (z0 s= 1%i32)
then Fail_ Failure
else (
p <- choose_back i32 true 0%i32 0%i32 z0;
let (x, y) := p in
if negb (x s= 1%i32)
then Fail_ Failure
else if negb (y s= 0%i32) then Fail_ Failure else Return tt)
.
(** Unit test for [no_nested_borrows::choose_test] *)
Check (choose_test )%return.
(** [no_nested_borrows::test_char]: forward function
Source: 'src/no_nested_borrows.rs', lines 285:0-285:26 *)
Definition test_char : result char :=
Return (char_of_byte Coq.Init.Byte.x61).
(** [no_nested_borrows::Tree]
Source: 'src/no_nested_borrows.rs', lines 290:0-290:16 *)
Inductive Tree_t (T : Type) :=
| Tree_Leaf : T -> Tree_t T
| Tree_Node : T -> NodeElem_t T -> Tree_t T -> Tree_t T
(** [no_nested_borrows::NodeElem]
Source: 'src/no_nested_borrows.rs', lines 295:0-295:20 *)
with NodeElem_t (T : Type) :=
| NodeElem_Cons : Tree_t T -> NodeElem_t T -> NodeElem_t T
| NodeElem_Nil : NodeElem_t T
.
Arguments Tree_Leaf { _ }.
Arguments Tree_Node { _ }.
Arguments NodeElem_Cons { _ }.
Arguments NodeElem_Nil { _ }.
(** [no_nested_borrows::list_length]: forward function
Source: 'src/no_nested_borrows.rs', lines 330:0-330:48 *)
Fixpoint list_length (T : Type) (l : List_t T) : result u32 :=
match l with
| List_Cons t l1 => i <- list_length T l1; u32_add 1%u32 i
| List_Nil => Return 0%u32
end
.
(** [no_nested_borrows::list_nth_shared]: forward function
Source: 'src/no_nested_borrows.rs', lines 338:0-338:62 *)
Fixpoint list_nth_shared (T : Type) (l : List_t T) (i : u32) : result T :=
match l with
| List_Cons x tl =>
if i s= 0%u32
then Return x
else (i0 <- u32_sub i 1%u32; list_nth_shared T tl i0)
| List_Nil => Fail_ Failure
end
.
(** [no_nested_borrows::list_nth_mut]: forward function
Source: 'src/no_nested_borrows.rs', lines 354:0-354:67 *)
Fixpoint list_nth_mut (T : Type) (l : List_t T) (i : u32) : result T :=
match l with
| List_Cons x tl =>
if i s= 0%u32
then Return x
else (i0 <- u32_sub i 1%u32; list_nth_mut T tl i0)
| List_Nil => Fail_ Failure
end
.
(** [no_nested_borrows::list_nth_mut]: backward function 0
Source: 'src/no_nested_borrows.rs', lines 354:0-354:67 *)
Fixpoint list_nth_mut_back
(T : Type) (l : List_t T) (i : u32) (ret : T) : result (List_t T) :=
match l with
| List_Cons x tl =>
if i s= 0%u32
then Return (List_Cons ret tl)
else (
i0 <- u32_sub i 1%u32;
tl0 <- list_nth_mut_back T tl i0 ret;
Return (List_Cons x tl0))
| List_Nil => Fail_ Failure
end
.
(** [no_nested_borrows::list_rev_aux]: forward function
Source: 'src/no_nested_borrows.rs', lines 370:0-370:63 *)
Fixpoint list_rev_aux
(T : Type) (li : List_t T) (lo : List_t T) : result (List_t T) :=
match li with
| List_Cons hd tl => list_rev_aux T tl (List_Cons hd lo)
| List_Nil => Return lo
end
.
(** [no_nested_borrows::list_rev]: merged forward/backward function
(there is a single backward function, and the forward function returns ())
Source: 'src/no_nested_borrows.rs', lines 384:0-384:42 *)
Definition list_rev (T : Type) (l : List_t T) : result (List_t T) :=
let li := core_mem_replace (List_t T) l List_Nil in
list_rev_aux T li List_Nil
.
(** [no_nested_borrows::test_list_functions]: forward function
Source: 'src/no_nested_borrows.rs', lines 389:0-389:28 *)
Definition test_list_functions : result unit :=
let l := List_Nil in
let l0 := List_Cons 2%i32 l in
let l1 := List_Cons 1%i32 l0 in
i <- list_length i32 (List_Cons 0%i32 l1);
if negb (i s= 3%u32)
then Fail_ Failure
else (
i0 <- list_nth_shared i32 (List_Cons 0%i32 l1) 0%u32;
if negb (i0 s= 0%i32)
then Fail_ Failure
else (
i1 <- list_nth_shared i32 (List_Cons 0%i32 l1) 1%u32;
if negb (i1 s= 1%i32)
then Fail_ Failure
else (
i2 <- list_nth_shared i32 (List_Cons 0%i32 l1) 2%u32;
if negb (i2 s= 2%i32)
then Fail_ Failure
else (
ls <- list_nth_mut_back i32 (List_Cons 0%i32 l1) 1%u32 3%i32;
i3 <- list_nth_shared i32 ls 0%u32;
if negb (i3 s= 0%i32)
then Fail_ Failure
else (
i4 <- list_nth_shared i32 ls 1%u32;
if negb (i4 s= 3%i32)
then Fail_ Failure
else (
i5 <- list_nth_shared i32 ls 2%u32;
if negb (i5 s= 2%i32) then Fail_ Failure else Return tt))))))
.
(** Unit test for [no_nested_borrows::test_list_functions] *)
Check (test_list_functions )%return.
(** [no_nested_borrows::id_mut_pair1]: forward function
Source: 'src/no_nested_borrows.rs', lines 405:0-405:89 *)
Definition id_mut_pair1 (T1 T2 : Type) (x : T1) (y : T2) : result (T1 * T2) :=
Return (x, y)
.
(** [no_nested_borrows::id_mut_pair1]: backward function 0
Source: 'src/no_nested_borrows.rs', lines 405:0-405:89 *)
Definition id_mut_pair1_back
(T1 T2 : Type) (x : T1) (y : T2) (ret : (T1 * T2)) : result (T1 * T2) :=
let (t, t0) := ret in Return (t, t0)
.
(** [no_nested_borrows::id_mut_pair2]: forward function
Source: 'src/no_nested_borrows.rs', lines 409:0-409:88 *)
Definition id_mut_pair2 (T1 T2 : Type) (p : (T1 * T2)) : result (T1 * T2) :=
let (t, t0) := p in Return (t, t0)
.
(** [no_nested_borrows::id_mut_pair2]: backward function 0
Source: 'src/no_nested_borrows.rs', lines 409:0-409:88 *)
Definition id_mut_pair2_back
(T1 T2 : Type) (p : (T1 * T2)) (ret : (T1 * T2)) : result (T1 * T2) :=
let (t, t0) := ret in Return (t, t0)
.
(** [no_nested_borrows::id_mut_pair3]: forward function
Source: 'src/no_nested_borrows.rs', lines 413:0-413:93 *)
Definition id_mut_pair3 (T1 T2 : Type) (x : T1) (y : T2) : result (T1 * T2) :=
Return (x, y)
.
(** [no_nested_borrows::id_mut_pair3]: backward function 0
Source: 'src/no_nested_borrows.rs', lines 413:0-413:93 *)
Definition id_mut_pair3_back'a
(T1 T2 : Type) (x : T1) (y : T2) (ret : T1) : result T1 :=
Return ret
.
(** [no_nested_borrows::id_mut_pair3]: backward function 1
Source: 'src/no_nested_borrows.rs', lines 413:0-413:93 *)
Definition id_mut_pair3_back'b
(T1 T2 : Type) (x : T1) (y : T2) (ret : T2) : result T2 :=
Return ret
.
(** [no_nested_borrows::id_mut_pair4]: forward function
Source: 'src/no_nested_borrows.rs', lines 417:0-417:92 *)
Definition id_mut_pair4 (T1 T2 : Type) (p : (T1 * T2)) : result (T1 * T2) :=
let (t, t0) := p in Return (t, t0)
.
(** [no_nested_borrows::id_mut_pair4]: backward function 0
Source: 'src/no_nested_borrows.rs', lines 417:0-417:92 *)
Definition id_mut_pair4_back'a
(T1 T2 : Type) (p : (T1 * T2)) (ret : T1) : result T1 :=
Return ret
.
(** [no_nested_borrows::id_mut_pair4]: backward function 1
Source: 'src/no_nested_borrows.rs', lines 417:0-417:92 *)
Definition id_mut_pair4_back'b
(T1 T2 : Type) (p : (T1 * T2)) (ret : T2) : result T2 :=
Return ret
.
(** [no_nested_borrows::StructWithTuple]
Source: 'src/no_nested_borrows.rs', lines 424:0-424:34 *)
Record StructWithTuple_t (T1 T2 : Type) :=
mkStructWithTuple_t {
structWithTuple_p : (T1 * T2);
}
.
Arguments mkStructWithTuple_t { _ _ }.
Arguments structWithTuple_p { _ _ }.
(** [no_nested_borrows::new_tuple1]: forward function
Source: 'src/no_nested_borrows.rs', lines 428:0-428:48 *)
Definition new_tuple1 : result (StructWithTuple_t u32 u32) :=
Return {| structWithTuple_p := (1%u32, 2%u32) |}
.
(** [no_nested_borrows::new_tuple2]: forward function
Source: 'src/no_nested_borrows.rs', lines 432:0-432:48 *)
Definition new_tuple2 : result (StructWithTuple_t i16 i16) :=
Return {| structWithTuple_p := (1%i16, 2%i16) |}
.
(** [no_nested_borrows::new_tuple3]: forward function
Source: 'src/no_nested_borrows.rs', lines 436:0-436:48 *)
Definition new_tuple3 : result (StructWithTuple_t u64 i64) :=
Return {| structWithTuple_p := (1%u64, 2%i64) |}
.
(** [no_nested_borrows::StructWithPair]
Source: 'src/no_nested_borrows.rs', lines 441:0-441:33 *)
Record StructWithPair_t (T1 T2 : Type) :=
mkStructWithPair_t {
structWithPair_p : Pair_t T1 T2;
}
.
Arguments mkStructWithPair_t { _ _ }.
Arguments structWithPair_p { _ _ }.
(** [no_nested_borrows::new_pair1]: forward function
Source: 'src/no_nested_borrows.rs', lines 445:0-445:46 *)
Definition new_pair1 : result (StructWithPair_t u32 u32) :=
Return {| structWithPair_p := {| pair_x := 1%u32; pair_y := 2%u32 |} |}
.
(** [no_nested_borrows::test_constants]: forward function
Source: 'src/no_nested_borrows.rs', lines 453:0-453:23 *)
Definition test_constants : result unit :=
swt <- new_tuple1;
let (i, _) := swt.(structWithTuple_p) in
if negb (i s= 1%u32)
then Fail_ Failure
else (
swt0 <- new_tuple2;
let (i0, _) := swt0.(structWithTuple_p) in
if negb (i0 s= 1%i16)
then Fail_ Failure
else (
swt1 <- new_tuple3;
let (i1, _) := swt1.(structWithTuple_p) in
if negb (i1 s= 1%u64)
then Fail_ Failure
else (
swp <- new_pair1;
if negb (swp.(structWithPair_p).(pair_x) s= 1%u32)
then Fail_ Failure
else Return tt)))
.
(** Unit test for [no_nested_borrows::test_constants] *)
Check (test_constants )%return.
(** [no_nested_borrows::test_weird_borrows1]: forward function
Source: 'src/no_nested_borrows.rs', lines 462:0-462:28 *)
Definition test_weird_borrows1 : result unit :=
Return tt.
(** Unit test for [no_nested_borrows::test_weird_borrows1] *)
Check (test_weird_borrows1 )%return.
(** [no_nested_borrows::test_mem_replace]: merged forward/backward function
(there is a single backward function, and the forward function returns ())
Source: 'src/no_nested_borrows.rs', lines 472:0-472:37 *)
Definition test_mem_replace (px : u32) : result u32 :=
let y := core_mem_replace u32 px 1%u32 in
if negb (y s= 0%u32) then Fail_ Failure else Return 2%u32
.
(** [no_nested_borrows::test_shared_borrow_bool1]: forward function
Source: 'src/no_nested_borrows.rs', lines 479:0-479:47 *)
Definition test_shared_borrow_bool1 (b : bool) : result u32 :=
if b then Return 0%u32 else Return 1%u32
.
(** [no_nested_borrows::test_shared_borrow_bool2]: forward function
Source: 'src/no_nested_borrows.rs', lines 492:0-492:40 *)
Definition test_shared_borrow_bool2 : result u32 :=
Return 0%u32.
(** [no_nested_borrows::test_shared_borrow_enum1]: forward function
Source: 'src/no_nested_borrows.rs', lines 507:0-507:52 *)
Definition test_shared_borrow_enum1 (l : List_t u32) : result u32 :=
match l with | List_Cons i l0 => Return 1%u32 | List_Nil => Return 0%u32 end
.
(** [no_nested_borrows::test_shared_borrow_enum2]: forward function
Source: 'src/no_nested_borrows.rs', lines 519:0-519:40 *)
Definition test_shared_borrow_enum2 : result u32 :=
Return 0%u32.
(** [no_nested_borrows::Tuple]
Source: 'src/no_nested_borrows.rs', lines 530:0-530:24 *)
Definition Tuple_t (T1 T2 : Type) : Type := T1 * T2.
(** [no_nested_borrows::use_tuple_struct]: merged forward/backward function
(there is a single backward function, and the forward function returns ())
Source: 'src/no_nested_borrows.rs', lines 532:0-532:48 *)
Definition use_tuple_struct (x : Tuple_t u32 u32) : result (Tuple_t u32 u32) :=
let (_, i) := x in Return (1%u32, i)
.
(** [no_nested_borrows::create_tuple_struct]: forward function
Source: 'src/no_nested_borrows.rs', lines 536:0-536:61 *)
Definition create_tuple_struct
(x : u32) (y : u64) : result (Tuple_t u32 u64) :=
Return (x, y)
.
(** [no_nested_borrows::IdType]
Source: 'src/no_nested_borrows.rs', lines 541:0-541:20 *)
Definition IdType_t (T : Type) : Type := T.
(** [no_nested_borrows::use_id_type]: forward function
Source: 'src/no_nested_borrows.rs', lines 543:0-543:40 *)
Definition use_id_type (T : Type) (x : IdType_t T) : result T :=
Return x.
(** [no_nested_borrows::create_id_type]: forward function
Source: 'src/no_nested_borrows.rs', lines 547:0-547:43 *)
Definition create_id_type (T : Type) (x : T) : result (IdType_t T) :=
Return x.
End NoNestedBorrows.
|