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
|
(* TEST
frame_pointers;
modules = "qsort_.c";
*)
external with_frame : (unit -> 'a) -> 'a = "with_frame"
external check_frames : unit -> unit = "check_frames"
external in_callback : (unit -> 'a) -> 'a = "in_callback"
external in_callback_stk :
int -> int -> int -> int -> int ->
int -> int -> int -> int -> int ->
(unit -> 'a) -> 'a = "in_callback_stk_byte" "in_callback_stk"
external sort2 : ('a -> 'a -> int) -> 'a -> 'a -> 'a * 'a = "sort2"
let rec recurse n =
if n = 0 then 0 else 1 + recurse (n-1)
let f a b =
check_frames ();
let cmp_str a b =
Printf.printf "Comparing %s <=> %s\n" a b;
let n = recurse 10000 in (* force stack realloc *)
assert (n = 10000);
(* check_frames not expected to work here:
we're inside a call to qsort that may not have frame pointers *)
Gc.minor ();
String.compare a b
in
let a, b = sort2 cmp_str a b in
check_frames ();
Printf.printf "Sorted: %s <= %s\n" a b
let in_finaliser f =
let finalised = ref false in
Gc.finalise_last (fun () -> finalised := true; f ()) (ref 42);
Gc.minor ();
assert (!finalised)
let () =
in_callback @@ fun () ->
with_frame @@ fun () ->
in_finaliser @@ fun () ->
in_callback @@ fun () ->
in_callback_stk 10 10 10 10 10 10 10 10 10 10 (fun () ->
f "foo" "bar";
f "bar" "foo")
|
