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
|
(****************************************************************************)
(* the diy toolsuite *)
(* *)
(* Jade Alglave, University College London, UK. *)
(* Luc Maranget, INRIA Paris-Rocquencourt, France. *)
(* *)
(* Copyright 2010-present Institut National de Recherche en Informatique et *)
(* en Automatique and the authors. All rights reserved. *)
(* *)
(* This software is governed by the CeCILL-B license under French law and *)
(* abiding by the rules of distribution of free software. You can use, *)
(* modify and/ or redistribute the software under the terms of the CeCILL-B *)
(* license as circulated by CEA, CNRS and INRIA at the following URL *)
(* "http://www.cecill.info". We also give a copy in LICENSE.txt. *)
(****************************************************************************)
open Printf
type t = string
let pp = Misc.identity
let equal = String.equal
let compare = String.compare
let lab_count = ref 0
let reset () = lab_count := 0
let next_label s =
let x = !lab_count in
incr lab_count ;
sprintf "%s%02i" s x
let last p = sprintf "End%i" p
and return p = sprintf "Lret%i" p
type next = Any | Next | To of t
module Set = StringSet
module Map = StringMap
let norm lbls = try Some (Set.min_elt lbls) with Not_found -> None
module Full =
struct
type full = Proc.t * t
let pp (p,lbl) = Printf.sprintf "%s:%s" (Proc.pp p) (pp lbl)
let equal = Misc.pair_eq Proc.equal equal
and compare = Misc.pair_compare Proc.compare compare
module Set =
MySet.Make
(struct
type t = full
let compare = compare
end)
end
|
