ocaml/testasmcomp/quicksort2.cmm

49 lines
1.8 KiB
Plaintext

(***********************************************************************)
(* *)
(* Objective Caml *)
(* *)
(* Xavier Leroy, projet Cristal, INRIA Rocquencourt *)
(* *)
(* Copyright 1996 Institut National de Recherche en Informatique et *)
(* Automatique. Distributed only by permission. *)
(* *)
(***********************************************************************)
(* $Id$ *)
(function "cmp" (i: int j: int)
(- i j))
(function "quick" (lo: int hi: int a: addr cmp: addr)
(if (< lo hi)
(let (i lo
j hi
pivot (intaref a hi))
(while (< i j)
(catch
(while 1
(if (>= i hi) exit [])
(if (> (app cmp [(intaref a i) pivot] int) 0) exit [])
(assign i (+ i 1)))
with [])
(catch
(while 1
(if (<= j lo) exit [])
(if (< (app cmp [(intaref a j) pivot] int) 0) exit [])
(assign j (- j 1)))
with [])
(if (< i j)
(let temp (intaref a i)
(intaset a i (intaref a j))
(intaset a j temp))
[]))
(let temp (intaref a i)
(intaset a i (intaref a hi))
(intaset a hi temp))
(app "quick" [lo (- i 1) a cmp] unit)
(app "quick" [(+ i 1) hi a cmp] unit))
[]))
(function "quicksort" (lo: int hi: int a: addr)
(app "quick" [lo hi a "cmp"] unit))