summaryrefslogtreecommitdiff
path: root/tests/coq/misc/NoNestedBorrows.v
blob: c1c24e00de8881448877c7a02595f74ded840564 (plain)
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
(** 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] *)
Record Pair_t (T1 T2 : Type) := mkPair_t { Pair_x : T1; Pair_y : T2; }.

Arguments mkPair_t {T1} {T2} _ _.
Arguments Pair_x {T1} {T2}.
Arguments Pair_y {T1} {T2}.

(** [no_nested_borrows::List] *)
Inductive List_t (T : Type) :=
| ListCons : T -> List_t T -> List_t T
| ListNil : List_t T
.

Arguments ListCons {T} _ _.
Arguments ListNil {T}.

(** [no_nested_borrows::One] *)
Inductive One_t (T1 : Type) := | OneOne : T1 -> One_t T1.

Arguments OneOne {T1} _.

(** [no_nested_borrows::EmptyEnum] *)
Inductive Empty_enum_t := | EmptyEnumEmpty : Empty_enum_t.

(** [no_nested_borrows::Enum] *)
Inductive Enum_t := | EnumVariant1 : Enum_t | EnumVariant2 : Enum_t.

(** [no_nested_borrows::EmptyStruct] *)
Record Empty_struct_t := mkEmpty_struct_t {  }.

(** [no_nested_borrows::Sum] *)
Inductive Sum_t (T1 T2 : Type) :=
| SumLeft : T1 -> Sum_t T1 T2
| SumRight : T2 -> Sum_t T1 T2
.

Arguments SumLeft {T1} {T2} _.
Arguments SumRight {T1} {T2} _.

(** [no_nested_borrows::neg_test]: forward function *)
Definition neg_test_fwd (x : i32) : result i32 :=
  i32_neg x.

(** [no_nested_borrows::add_test]: forward function *)
Definition add_test_fwd (x : u32) (y : u32) : result u32 :=
  u32_add x y.

(** [no_nested_borrows::subs_test]: forward function *)
Definition subs_test_fwd (x : u32) (y : u32) : result u32 :=
  u32_sub x y.

(** [no_nested_borrows::div_test]: forward function *)
Definition div_test_fwd (x : u32) (y : u32) : result u32 :=
  u32_div x y.

(** [no_nested_borrows::div_test1]: forward function *)
Definition div_test1_fwd (x : u32) : result u32 :=
  u32_div x 2%u32.

(** [no_nested_borrows::rem_test]: forward function *)
Definition rem_test_fwd (x : u32) (y : u32) : result u32 :=
  u32_rem x y.

(** [no_nested_borrows::cast_test]: forward function *)
Definition cast_test_fwd (x : u32) : result i32 :=
  scalar_cast U32 I32 x.

(** [no_nested_borrows::test2]: forward function *)
Definition test2_fwd : result unit :=
  _ <- u32_add 23%u32 44%u32; Return tt.

(** Unit test for [no_nested_borrows::test2] *)
Check (test2_fwd )%return.

(** [no_nested_borrows::get_max]: forward function *)
Definition get_max_fwd (x : u32) (y : u32) : result u32 :=
  if x s>= y then Return x else Return y
.

(** [no_nested_borrows::test3]: forward function *)
Definition test3_fwd : result unit :=
  x <- get_max_fwd 4%u32 3%u32;
  y <- get_max_fwd 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_fwd )%return.

(** [no_nested_borrows::test_neg1]: forward function *)
Definition test_neg1_fwd : 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_fwd )%return.

(** [no_nested_borrows::refs_test1]: forward function *)
Definition refs_test1_fwd : 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_fwd )%return.

(** [no_nested_borrows::refs_test2]: forward function *)
Definition refs_test2_fwd : 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_fwd )%return.

(** [no_nested_borrows::test_list1]: forward function *)
Definition test_list1_fwd : result unit :=
  Return tt.

(** Unit test for [no_nested_borrows::test_list1] *)
Check (test_list1_fwd )%return.

(** [no_nested_borrows::test_box1]: forward function *)
Definition test_box1_fwd : result unit :=
  let b := 1%i32 in
  let x := b in
  if negb (x s= 1%i32) then Fail_ Failure else Return tt
.

(** Unit test for [no_nested_borrows::test_box1] *)
Check (test_box1_fwd )%return.

(** [no_nested_borrows::copy_int]: forward function *)
Definition copy_int_fwd (x : i32) : result i32 :=
  Return x.

(** [no_nested_borrows::test_unreachable]: forward function *)
Definition test_unreachable_fwd (b : bool) : result unit :=
  if b then Fail_ Failure else Return tt
.

(** [no_nested_borrows::test_panic]: forward function *)
Definition test_panic_fwd (b : bool) : result unit :=
  if b then Fail_ Failure else Return tt
.

(** [no_nested_borrows::test_copy_int]: forward function *)
Definition test_copy_int_fwd : result unit :=
  y <- copy_int_fwd 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_fwd )%return.

(** [no_nested_borrows::is_cons]: forward function *)
Definition is_cons_fwd (T : Type) (l : List_t T) : result bool :=
  match l with | ListCons t l0 => Return true | ListNil => Return false end
.

(** [no_nested_borrows::test_is_cons]: forward function *)
Definition test_is_cons_fwd : result unit :=
  let l := ListNil in
  b <- is_cons_fwd i32 (ListCons 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_fwd )%return.

(** [no_nested_borrows::split_list]: forward function *)
Definition split_list_fwd
  (T : Type) (l : List_t T) : result (T * (List_t T)) :=
  match l with
  | ListCons hd tl => Return (hd, tl)
  | ListNil => Fail_ Failure
  end
.

(** [no_nested_borrows::test_split_list]: forward function *)
Definition test_split_list_fwd : result unit :=
  let l := ListNil in
  p <- split_list_fwd i32 (ListCons 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_fwd )%return.

(** [no_nested_borrows::choose]: forward function *)
Definition choose_fwd (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 *)
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 *)
Definition choose_test_fwd : result unit :=
  z <- choose_fwd 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_fwd )%return.

(** [no_nested_borrows::test_char]: forward function *)
Definition test_char_fwd : result char :=
  Return (char_of_byte Coq.Init.Byte.x61)
.

(** [no_nested_borrows::Tree] *)
Inductive Tree_t (T : Type) :=
| TreeLeaf : T -> Tree_t T
| TreeNode : T -> Node_elem_t T -> Tree_t T -> Tree_t T

(** [no_nested_borrows::NodeElem] *)
with Node_elem_t (T : Type) :=
| NodeElemCons : Tree_t T -> Node_elem_t T -> Node_elem_t T
| NodeElemNil : Node_elem_t T
.

Arguments TreeLeaf {T} _.
Arguments TreeNode {T} _ _ _.

Arguments NodeElemCons {T} _ _.
Arguments NodeElemNil {T}.

(** [no_nested_borrows::list_length]: forward function *)
Fixpoint list_length_fwd (T : Type) (l : List_t T) : result u32 :=
  match l with
  | ListCons t l1 => i <- list_length_fwd T l1; u32_add 1%u32 i
  | ListNil => Return 0%u32
  end
.

(** [no_nested_borrows::list_nth_shared]: forward function *)
Fixpoint list_nth_shared_fwd (T : Type) (l : List_t T) (i : u32) : result T :=
  match l with
  | ListCons x tl =>
    if i s= 0%u32
    then Return x
    else (i0 <- u32_sub i 1%u32; list_nth_shared_fwd T tl i0)
  | ListNil => Fail_ Failure
  end
.

(** [no_nested_borrows::list_nth_mut]: forward function *)
Fixpoint list_nth_mut_fwd (T : Type) (l : List_t T) (i : u32) : result T :=
  match l with
  | ListCons x tl =>
    if i s= 0%u32
    then Return x
    else (i0 <- u32_sub i 1%u32; list_nth_mut_fwd T tl i0)
  | ListNil => Fail_ Failure
  end
.

(** [no_nested_borrows::list_nth_mut]: backward function 0 *)
Fixpoint list_nth_mut_back
  (T : Type) (l : List_t T) (i : u32) (ret : T) : result (List_t T) :=
  match l with
  | ListCons x tl =>
    if i s= 0%u32
    then Return (ListCons ret tl)
    else (
      i0 <- u32_sub i 1%u32;
      tl0 <- list_nth_mut_back T tl i0 ret;
      Return (ListCons x tl0))
  | ListNil => Fail_ Failure
  end
.

(** [no_nested_borrows::list_rev_aux]: forward function *)
Fixpoint list_rev_aux_fwd
  (T : Type) (li : List_t T) (lo : List_t T) : result (List_t T) :=
  match li with
  | ListCons hd tl => list_rev_aux_fwd T tl (ListCons hd lo)
  | ListNil => Return lo
  end
.

(** [no_nested_borrows::list_rev]: merged forward/backward function
    (there is a single backward function, and the forward function returns ()) *)
Definition list_rev_fwd_back (T : Type) (l : List_t T) : result (List_t T) :=
  let li := mem_replace_fwd (List_t T) l ListNil in
  list_rev_aux_fwd T li ListNil
.

(** [no_nested_borrows::test_list_functions]: forward function *)
Definition test_list_functions_fwd : result unit :=
  let l := ListNil in
  let l0 := ListCons 2%i32 l in
  let l1 := ListCons 1%i32 l0 in
  i <- list_length_fwd i32 (ListCons 0%i32 l1);
  if negb (i s= 3%u32)
  then Fail_ Failure
  else (
    i0 <- list_nth_shared_fwd i32 (ListCons 0%i32 l1) 0%u32;
    if negb (i0 s= 0%i32)
    then Fail_ Failure
    else (
      i1 <- list_nth_shared_fwd i32 (ListCons 0%i32 l1) 1%u32;
      if negb (i1 s= 1%i32)
      then Fail_ Failure
      else (
        i2 <- list_nth_shared_fwd i32 (ListCons 0%i32 l1) 2%u32;
        if negb (i2 s= 2%i32)
        then Fail_ Failure
        else (
          ls <- list_nth_mut_back i32 (ListCons 0%i32 l1) 1%u32 3%i32;
          i3 <- list_nth_shared_fwd i32 ls 0%u32;
          if negb (i3 s= 0%i32)
          then Fail_ Failure
          else (
            i4 <- list_nth_shared_fwd i32 ls 1%u32;
            if negb (i4 s= 3%i32)
            then Fail_ Failure
            else (
              i5 <- list_nth_shared_fwd 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_fwd )%return.

(** [no_nested_borrows::id_mut_pair1]: forward function *)
Definition id_mut_pair1_fwd
  (T1 T2 : Type) (x : T1) (y : T2) : result (T1 * T2) :=
  Return (x, y)
.

(** [no_nested_borrows::id_mut_pair1]: backward function 0 *)
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 *)
Definition id_mut_pair2_fwd
  (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 *)
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 *)
Definition id_mut_pair3_fwd
  (T1 T2 : Type) (x : T1) (y : T2) : result (T1 * T2) :=
  Return (x, y)
.

(** [no_nested_borrows::id_mut_pair3]: backward function 0 *)
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 *)
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 *)
Definition id_mut_pair4_fwd
  (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 *)
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 *)
Definition id_mut_pair4_back'b
  (T1 T2 : Type) (p : (T1 * T2)) (ret : T2) : result T2 :=
  Return ret
.

(** [no_nested_borrows::StructWithTuple] *)
Record Struct_with_tuple_t (T1 T2 : Type) :=
mkStruct_with_tuple_t {
  Struct_with_tuple_p : (T1 * T2);
}
.

Arguments mkStruct_with_tuple_t {T1} {T2} _.
Arguments Struct_with_tuple_p {T1} {T2}.

(** [no_nested_borrows::new_tuple1]: forward function *)
Definition new_tuple1_fwd : result (Struct_with_tuple_t u32 u32) :=
  Return {| Struct_with_tuple_p := (1%u32, 2%u32) |}
.

(** [no_nested_borrows::new_tuple2]: forward function *)
Definition new_tuple2_fwd : result (Struct_with_tuple_t i16 i16) :=
  Return {| Struct_with_tuple_p := (1%i16, 2%i16) |}
.

(** [no_nested_borrows::new_tuple3]: forward function *)
Definition new_tuple3_fwd : result (Struct_with_tuple_t u64 i64) :=
  Return {| Struct_with_tuple_p := (1%u64, 2%i64) |}
.

(** [no_nested_borrows::StructWithPair] *)
Record Struct_with_pair_t (T1 T2 : Type) :=
mkStruct_with_pair_t {
  Struct_with_pair_p : Pair_t T1 T2;
}
.

Arguments mkStruct_with_pair_t {T1} {T2} _.
Arguments Struct_with_pair_p {T1} {T2}.

(** [no_nested_borrows::new_pair1]: forward function *)
Definition new_pair1_fwd : result (Struct_with_pair_t u32 u32) :=
  Return {| Struct_with_pair_p := {| Pair_x := 1%u32; Pair_y := 2%u32 |} |}
.

(** [no_nested_borrows::test_constants]: forward function *)
Definition test_constants_fwd : result unit :=
  swt <- new_tuple1_fwd;
  let (i, _) := swt.(Struct_with_tuple_p) in
  if negb (i s= 1%u32)
  then Fail_ Failure
  else (
    swt0 <- new_tuple2_fwd;
    let (i0, _) := swt0.(Struct_with_tuple_p) in
    if negb (i0 s= 1%i16)
    then Fail_ Failure
    else (
      swt1 <- new_tuple3_fwd;
      let (i1, _) := swt1.(Struct_with_tuple_p) in
      if negb (i1 s= 1%u64)
      then Fail_ Failure
      else (
        swp <- new_pair1_fwd;
        if negb (swp.(Struct_with_pair_p).(Pair_x) s= 1%u32)
        then Fail_ Failure
        else Return tt)))
.

(** Unit test for [no_nested_borrows::test_constants] *)
Check (test_constants_fwd )%return.

(** [no_nested_borrows::test_weird_borrows1]: forward function *)
Definition test_weird_borrows1_fwd : result unit :=
  Return tt.

(** Unit test for [no_nested_borrows::test_weird_borrows1] *)
Check (test_weird_borrows1_fwd )%return.

(** [no_nested_borrows::test_mem_replace]: merged forward/backward function
    (there is a single backward function, and the forward function returns ()) *)
Definition test_mem_replace_fwd_back (px : u32) : result u32 :=
  let y := mem_replace_fwd 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 *)
Definition test_shared_borrow_bool1_fwd (b : bool) : result u32 :=
  if b then Return 0%u32 else Return 1%u32
.

(** [no_nested_borrows::test_shared_borrow_bool2]: forward function *)
Definition test_shared_borrow_bool2_fwd : result u32 :=
  Return 0%u32.

(** [no_nested_borrows::test_shared_borrow_enum1]: forward function *)
Definition test_shared_borrow_enum1_fwd (l : List_t u32) : result u32 :=
  match l with | ListCons i l0 => Return 1%u32 | ListNil => Return 0%u32 end
.

(** [no_nested_borrows::test_shared_borrow_enum2]: forward function *)
Definition test_shared_borrow_enum2_fwd : result u32 :=
  Return 0%u32.

End NoNestedBorrows .