types.ml 104 KB
Newer Older
1
open Ident
2
open Encodings
3

4
5
let (@@) f a = f a

6
let count = ref 0
Pietro Abate's avatar
Pietro Abate committed
7

8
9
10
11
let () =
  Stats.register Stats.Summary
    (fun ppf -> Format.fprintf ppf "Allocated type nodes:%i@\n" !count)

Pietro Abate's avatar
Pietro Abate committed
12
(*
13
14
15
16
17
18
19
20
To be sure not to use generic comparison ...
*)
let (=) : int -> int -> bool = (==)
let (<) : int -> int -> bool = (<)
let (<=) : int -> int -> bool = (<=)
let (<>) : int -> int -> bool = (<>)
let compare = 1

Pietro Abate's avatar
Pietro Abate committed
21
type const =
22
  | Integer of Intervals.V.t
23
  | Atom of Atoms.V.t
24
  | Char of Chars.V.t
25
26
27
28
  | Pair of const * const
  | Xml of const * const
  | Record of const label_map
  | String of U.uindex * U.uindex * U.t * const
29

Jérôme Maloberti's avatar
Jérôme Maloberti committed
30
31
type service_params =
  | TProd of service_params * service_params
Pietro Abate's avatar
Pietro Abate committed
32
  | TOption of service_params
Jérôme Maloberti's avatar
Jérôme Maloberti committed
33
34
35
36
37
38
39
  | TList of string * service_params
  | TSet of service_params
  | TSum of service_params * service_params
  | TString of string
  | TInt of string
  | TInt32 of string
  | TInt64 of string
Pietro Abate's avatar
Pietro Abate committed
40
  | TFloat of string
Jérôme Maloberti's avatar
Jérôme Maloberti committed
41
42
43
  | TBool of string
  | TFile of string
      (* | TUserType of string * (string -> 'a) * ('a -> string) *)
Pietro Abate's avatar
Pietro Abate committed
44
  | TCoord of string
Jérôme Maloberti's avatar
Jérôme Maloberti committed
45
  | TCoordv of service_params * string
Pietro Abate's avatar
Pietro Abate committed
46
  | TESuffix of string
Jérôme Maloberti's avatar
Jérôme Maloberti committed
47
48
49
  | TESuffixs of string
      (*  | TESuffixu of (string * (string -> 'a) * ('a -> string)) *)
  | TSuffix of (bool * service_params)
Pietro Abate's avatar
Pietro Abate committed
50
  | TUnit
Jérôme Maloberti's avatar
Jérôme Maloberti committed
51
52
53
  | TAny
  | TConst of string;;

54
55
56
module Const = struct
  type t = const

57
58
  let check _ = ()
  let dump ppf _ = Format.fprintf ppf "<Types.Const.t>"
59
60

  let rec compare c1 c2 = match (c1,c2) with
61
    | Integer x, Integer y -> Intervals.V.compare x y
62
63
    | Integer _, _ -> -1
    | _, Integer _ -> 1
64
    | Atom x, Atom y -> Atoms.V.compare x y
65
66
    | Atom _, _ -> -1
    | _, Atom _ -> 1
67

68
    | Char x, Char y -> Chars.V.compare x y
69
70
71
    | Char _, _ -> -1
    | _, Char _ -> 1
    | Pair (x1,x2), Pair (y1,y2) ->
72
73
	let c = compare x1 y1 in
	if c <> 0 then c else compare x2 y2
74
75
76
    | Pair (_,_), _ -> -1
    | _, Pair (_,_) -> 1
    | Xml (x1,x2), Xml (y1,y2) ->
77
78
	let c = compare x1 y1 in
	if c <> 0 then c else compare x2 y2
79
80
81
    | Xml (_,_), _ -> -1
    | _, Xml (_,_) -> 1
    | Record x, Record y ->
82
	LabelMap.compare compare x y
83
84
85
    | Record _, _ -> -1
    | _, Record _ -> 1
    | String (i1,j1,s1,r1), String (i2,j2,s2,r2) ->
Pietro Abate's avatar
Pietro Abate committed
86
	let c = Pervasives.compare i1 i2 in if c <> 0 then c
87
88
89
	else let c = Pervasives.compare j1 j2 in if c <> 0 then c
	else let c = U.compare s1 s2 in if c <> 0 then c (* Should compare
							    only the substring *)
90
91
92
93
94
95
96
97
98
99
	else compare r1 r2

  let rec hash = function
    | Integer x -> 1 + 17 * (Intervals.V.hash x)
    | Atom x -> 2 + 17 * (Atoms.V.hash x)
    | Char x -> 3 + 17 * (Chars.V.hash x)
    | Pair (x,y) -> 4 + 17 * (hash x) + 257 * (hash y)
    | Xml (x,y) -> 5 + 17 * (hash x) + 257 * (hash y)
    | Record x -> 6 + 17 * (LabelMap.hash hash x)
    | String (i,j,s,r) -> 7 + 17 * (U.hash s) + 257 * hash r
100
      (* Note: improve hash for String *)
101

102
103
  let equal c1 c2 = compare c1 c2 = 0
end
104

105
106
module Abstract =
struct
107
  module T = Custom.String
108
109
110
111
112
113
114
115
116
117
  type abs = T.t

  module V =
  struct
    type t = abs * Obj.t
  end

  include SortedList.FiniteCofinite(T)

  let print = function
118
    | Finite l -> List.map (fun x ppf -> Format.fprintf ppf "!%s" x) l
119
    | Cofinite l ->
120
121
122
123
	[ fun ppf ->
	  Format.fprintf ppf "@[Abstract";
	  List.iter (fun x -> Format.fprintf ppf " \\@ !%s" x) l;
	  Format.fprintf ppf "@]" ]
124

125
126
127
128
  let contains_sample s t = match s,t with
    | None, Cofinite _ -> true
    | None, Finite _ -> false
    | Some s, t -> contains s t
Pietro Abate's avatar
Pietro Abate committed
129

130
131
end

132
133
type pair_kind = [ `Normal | `XML ]

Pietro Abate's avatar
Pietro Abate committed
134
module BoolAtoms : BoolVar.S with
135
  type s = Atoms.t = BoolVar.Make(Atoms)
Pietro Abate's avatar
Pietro Abate committed
136
module BoolIntervals : BoolVar.S with
137
  type s = Intervals.t = BoolVar.Make(Intervals)
Pietro Abate's avatar
Pietro Abate committed
138
module BoolChars : BoolVar.S with
139
  type s = Chars.t = BoolVar.Make(Chars)
140

141
142
143

module TLV = struct

Pietro Abate's avatar
Pietro Abate committed
144
145
146
147
148
149
150
151
152
153
154
155
156
  module Set = struct
    include Set.Make(
      struct
        type t = (Var.var * bool)
        let compare (v1,p1) (v2,p2) =
          let c = Var.compare v1 v2 in
          if c == 0 then
            if p1 == p2 then 0
            else if p1 then 1 else -1
          else c
      end)
    let print sep ppf s =
      let aux1 ppf = function
157
158
        |(v,true) -> Format.fprintf ppf "%a" Var.print v
        |(v,false) -> Format.fprintf ppf "~ %a" Var.print v
Pietro Abate's avatar
Pietro Abate committed
159
160
161
162
163
      in
      let rec aux ppf = function
        |[] -> ()
        |[h] -> aux1 ppf h
        |h::l -> Format.fprintf ppf "%a %s %a" aux1 h sep aux l
164
      in
Pietro Abate's avatar
Pietro Abate committed
165
166
      aux ppf (elements s)
  end
167

Pietro Abate's avatar
Pietro Abate committed
168
  (* tlv : top level variables
Julien Lopez's avatar
Julien Lopez committed
169
170
   * fv : all free variables in the subtree *)
  type t =  { tlv : Set.t ; fv : Var.Set.t; isvar : bool }
171

Julien Lopez's avatar
Julien Lopez committed
172
173
  let empty = { tlv = Set.empty ; fv = Var.Set.empty; isvar = false }
  let any = { tlv = Set.empty ; fv = Var.Set.empty; isvar = false }
174

Julien Lopez's avatar
Julien Lopez committed
175
  let singleton (v,p) = { tlv = Set.singleton (v,p); fv = Var.Set.singleton v; isvar = true }
176
177

  (* return the max of top level variables *)
Pietro Abate's avatar
Pietro Abate committed
178
  let max x = Set.max_elt x.tlv
179
180

  let pair x y = {
Pietro Abate's avatar
Pietro Abate committed
181
    tlv = Set.empty ;
Julien Lopez's avatar
Julien Lopez committed
182
183
184
185
186
187
188
189
    fv = Var.Set.union x.fv y.fv ;
    isvar = false
  }

  let record x = {
    tlv = Set.empty ;
    fv = x.fv ;
    isvar = false
190
191
192
  }

  (* true if it contains only one variable *)
Julien Lopez's avatar
Julien Lopez committed
193
  let is_single x = x.isvar && (Var.Set.cardinal x.fv = 1) && (Set.cardinal x.tlv = 1)
Pietro Abate's avatar
Pietro Abate committed
194

Julien Lopez's avatar
Julien Lopez committed
195
  let no_variables x = (Var.Set.cardinal x.fv = 0) && (Set.cardinal x.tlv = 0)
196

Pietro Abate's avatar
Pietro Abate committed
197
  let has_toplevel x = Set.cardinal x.tlv > 0
Pietro Abate's avatar
Pietro Abate committed
198

Julien Lopez's avatar
Julien Lopez committed
199
  let print ppf x = Set.print ";" ppf x.tlv
Pietro Abate's avatar
Pietro Abate committed
200
  let dump ppf x =
Julien Lopez's avatar
Julien Lopez committed
201
202
    Format.fprintf ppf "<fv = {%a} ; tlv = {%a}>"
      Var.Set.print x.fv (Set.print ";") x.tlv
Pietro Abate's avatar
Pietro Abate committed
203
  let mem v x = Set.mem v x.tlv
Pietro Abate's avatar
Pietro Abate committed
204

205
end
206

Pietro Abate's avatar
Pietro Abate committed
207
module rec Descr :
208
sig
Pietro Abate's avatar
Pietro Abate committed
209
  (* each kind is represented as a union of itersection of types
210
211
212
   * the type is a union of all kinds
   *
   * we add a new field that contains only variables.
Pietro Abate's avatar
Pietro Abate committed
213
   * Inv :
214
215
216
217
218
219
220
221
222
223
224
225
     * if the bdd of ANY kind is composed only of variables,
       the we move it in vars:
     * From a bdd we move all variables to vars: that belong to
     * to a path in the bdd that contains only variables and end in
     * true
     * A bdd never contains a path that ends in 1 and contains only variables
     *
     * (t1 v a ) ^ ( t2 v b )
     * we need to distribute variables for the intersection
     * (t1 ^ t2) v (t1 ^ b) v (t2 ^ a) v (a ^ b)
     * before we were doing only t1 ^ t2
   *)
226
  type s = {
227
228
229
    atoms : BoolAtoms.t;
    ints  : BoolIntervals.t;
    chars : BoolChars.t;
230
231
232
233
    times : BoolPair.t;
    xml   : BoolPair.t;
    arrow : BoolPair.t;
    record: BoolRec.t;
234
    abstract: Abstract.t;
235
236
237
    (* this is used in record to flag the fact that the type of a label is
     * absent . It is used for optional arguments in functions as ?Int
     * is the union of Int ^ undef where undef is a type with absent : true *)
238
239
240
    absent: bool;
    (* maintains the list of all toplevel type variables in s
     * and a flag that is true if s contains only variables, false otherwise *)
241
    toplvars : TLV.t
242
  }
243
  include Custom.T with type t = s
244
  val empty: t
Julien Lopez's avatar
Julien Lopez committed
245
  val is_empty : t -> bool
246
247
end =
struct
248
  type s = {
249
250
251
    atoms : BoolAtoms.t;
    ints  : BoolIntervals.t;
    chars : BoolChars.t;
252
253
254
255
    times : BoolPair.t;
    xml   : BoolPair.t;
    arrow : BoolPair.t;
    record: BoolRec.t;
256
    abstract: Abstract.t;
257
    absent: bool;
258
    toplvars : TLV.t
259
  }
260
  type t = s
261

262
263
264
265
  let print_lst ppf =
    List.iter (fun f -> f ppf; Format.fprintf ppf " |")

  let dump ppf d =
Pietro Abate's avatar
Pietro Abate committed
266
    Format.fprintf ppf "<types atoms(%a) ints(%a) chars(%a) times(%a) arrow(%a) record(%a) xml(%a) abstract(%a) absent(%b)>\n%a"
267
      BoolAtoms.dump d.atoms
268
269
      BoolIntervals.dump d.ints
      BoolChars.dump d.chars
270
      BoolPair.dump d.times
271
      BoolPair.dump d.arrow
272
273
      BoolRec.dump d.record
      BoolPair.dump d.xml
274
275
      Abstract.dump d.abstract
      d.absent
Pietro Abate's avatar
Pietro Abate committed
276
      TLV.dump d.toplvars
277

Pietro Abate's avatar
Pietro Abate committed
278
279
280
281
  let empty = {
    times = BoolPair.empty;
    xml   = BoolPair.empty;
    arrow = BoolPair.empty;
282
    record= BoolRec.empty;
283
284
285
    ints  = BoolIntervals.empty;
    atoms = BoolAtoms.empty;
    chars = BoolChars.empty;
286
    abstract = Abstract.empty;
287
    absent= false;
288
    toplvars = TLV.empty
289
290
  }

291
292
293
294
295
296
297
298
299
300
301
  let check a =
    BoolChars.check a.chars;
    BoolIntervals.check a.ints;
    BoolAtoms.check a.atoms;
    BoolPair.check a.times;
    BoolPair.check a.xml;
    BoolPair.check a.arrow;
    BoolRec.check a.record;
    Abstract.check a.abstract;
    ()

302
  let equal a b =
303
    (a == b) || (
304
305
306
      (BoolAtoms.equal a.atoms b.atoms) &&
      (BoolChars.equal a.chars b.chars) &&
      (BoolIntervals.equal a.ints  b.ints) &&
307
308
309
310
      (BoolPair.equal a.times b.times) &&
      (BoolPair.equal a.xml b.xml) &&
      (BoolPair.equal a.arrow b.arrow) &&
      (BoolRec.equal a.record b.record) &&
311
      (Abstract.equal a.abstract b.abstract) &&
312
313
      (a.absent == b.absent)
    )
314

Julien Lopez's avatar
Julien Lopez committed
315
316
317
318
319
320
321
322
323
324
  let is_empty a =
    (BoolAtoms.is_empty a.atoms) &&
      (BoolChars.is_empty a.chars) &&
      (BoolIntervals.is_empty a.ints) &&
      (BoolPair.is_empty a.times) &&
      (BoolPair.is_empty a.xml) &&
      (BoolPair.is_empty a.arrow) &&
      (BoolRec.is_empty a.record) &&
      (Abstract.is_empty a.abstract)

325
  let compare a b =
Pietro Abate's avatar
Pietro Abate committed
326
    if a == b then 0
327
328
329
    else let c = BoolAtoms.compare a.atoms b.atoms in if c <> 0 then c
    else let c = BoolChars.compare a.chars b.chars in if c <> 0 then c
    else let c = BoolIntervals.compare a.ints b.ints in if c <> 0 then c
330
331
332
333
    else let c = BoolPair.compare a.times b.times in if c <> 0 then c
    else let c = BoolPair.compare a.xml b.xml in if c <> 0 then c
    else let c = BoolPair.compare a.arrow b.arrow in if c <> 0 then c
    else let c = BoolRec.compare a.record b.record in if c <> 0 then c
334
    else let c = Abstract.compare a.abstract b.abstract in if c <> 0 then c
335
336
337
    else if a.absent && not b.absent then -1
    else if b.absent && not a.absent then 1
    else 0
Pietro Abate's avatar
Pietro Abate committed
338

339
  let hash a =
340
341
342
    let accu = BoolChars.hash a.chars in
    let accu = 17 * accu + BoolIntervals.hash a.ints in
    let accu = 17 * accu + BoolAtoms.hash a.atoms in
343
344
345
346
347
348
349
    let accu = 17 * accu + BoolPair.hash a.times in
    let accu = 17 * accu + BoolPair.hash a.xml in
    let accu = 17 * accu + BoolPair.hash a.arrow in
    let accu = 17 * accu + BoolRec.hash a.record in
    let accu = 17 * accu + Abstract.hash a.abstract in
    let accu = if a.absent then accu+5 else accu in
    accu
350

351
352
353
end
and Node :
sig
354
  type t = { id : int; cu: Compunit.t; mutable descr : Descr.t }
355
356
357
358
359
  val dump: Format.formatter -> t -> unit
  val check: t -> unit
  val equal: t -> t -> bool
  val hash: t -> int
  val compare:t -> t -> int
360
  val mk: int -> Descr.t -> t
361
end =
362

363
struct
364
  type t = { id : int; cu: Compunit.t; mutable descr : Descr.t }
365
  let check n = ()
366
  let dump ppf n = Format.fprintf ppf "X%i" n.id
367
  let hash x = x.id + Compunit.hash x.cu
Pietro Abate's avatar
Pietro Abate committed
368
  let compare x y =
369
370
371
    let c = x.id - y.id in if c = 0 then Compunit.compare x.cu y.cu else c
  let equal x y = x==y || (x.id == y.id && (Compunit.equal x.cu y.cu))
  let mk id d = { id = id; cu = Compunit.current (); descr = d }
372
373
end

374
375
and Pair : Bool.S with type elem = (Node.t * Node.t) =
  Bool.Make(Custom.Pair(Node)(Node))
Pietro Abate's avatar
Pietro Abate committed
376
and BoolPair : BoolVar.S with
377
  type s = Pair.t = BoolVar.Make(Pair)
378

379
380
381
382
383
(* bool = true means that the record is open that is, that
 * the labels that are not in the domain of the map are
 * equal to "any" *)
and Rec : Bool.S with type elem = bool * Node.t Ident.label_map =
  Bool.Make(Custom.Pair(Custom.Bool)(LabelSet.MakeMap(Node)))
384
385
and BoolRec : BoolVar.S with
  type s = Rec.t = BoolVar.Make(Rec)
386

387
388
module DescrHash = Hashtbl.Make(Descr)
module DescrMap = Map.Make(Descr)
389
390
module DescrSet = Set.Make(Descr)
module DescrSList = SortedList.Make(Descr)
391

392
393
394
type descr = Descr.t
type node = Node.t
include Descr
395

396
397
let forward_print = ref (fun _ _ -> assert false)

Pietro Abate's avatar
Pietro Abate committed
398
399
let make () =
  incr count;
400
401
  Node.mk !count empty

Pietro Abate's avatar
Pietro Abate committed
402
let define n d =
403
404
  n.Node.descr <- d

Pietro Abate's avatar
Pietro Abate committed
405
406
let cons d =
  incr count;
407
408
  Node.mk !count d

409
410
411
412
let descr n = n.Node.descr
let internalize n = n
let id n = n.Node.id

413
414
415
(* two representation possible. either all fields (except vars) are full, OR
 * the field vars is full.
 *)
416
let any =  {
Pietro Abate's avatar
Pietro Abate committed
417
418
419
420
  times = BoolPair.full;
  xml   = BoolPair.full;
  arrow = BoolPair.full;
  record= BoolRec.full;
421
422
423
  ints  = BoolIntervals.full;
  atoms = BoolAtoms.full;
  chars = BoolChars.full;
424
  abstract = Abstract.any;
425
  absent= false;
426
  toplvars = TLV.any
427
}
428
429

let non_constructed =
Pietro Abate's avatar
Pietro Abate committed
430
  { any with
431
      times = empty.times; xml = empty.xml; record = empty.record }
Pietro Abate's avatar
Pietro Abate committed
432
433

let non_constructed_or_absent =
434
  { non_constructed with absent = true }
435

Pietro Abate's avatar
Pietro Abate committed
436
(* Descr.t type constructors *)
437
438
let times x y = { empty with
                    times = BoolPair.atom (`Atm (Pair.atom (x,y)));
Pietro Abate's avatar
Pietro Abate committed
439
                    toplvars = TLV.pair (descr x).toplvars (descr y).toplvars }
440
let xml x y = { empty with
Pietro Abate's avatar
Pietro Abate committed
441
442
                    xml = BoolPair.atom (`Atm (Pair.atom (x,y)));
                    toplvars = TLV.pair (descr x).toplvars (descr y).toplvars }
443
444
let arrow x y = { empty with
                    arrow = BoolPair.atom (`Atm (Pair.atom (x,y)));
Pietro Abate's avatar
Pietro Abate committed
445
                    toplvars = TLV.pair (descr x).toplvars (descr y).toplvars }
446

Pietro Abate's avatar
Pietro Abate committed
447
448
let record label t =
  { empty with
449
    record = BoolRec.atom (`Atm (Rec.atom (true,LabelMap.singleton label t)));
Julien Lopez's avatar
Julien Lopez committed
450
    toplvars = TLV.record (descr t).toplvars }
451
452
453

let tlv_from_rec (_, l) =
  let rec aux acc = function
Julien Lopez's avatar
Julien Lopez committed
454
    | (_, n) :: rest -> aux (TLV.pair acc (descr n).toplvars) rest
455
456
457
    | [] -> acc in
  aux TLV.empty (Ident.LabelMap.get l)

458
let record_fields x =
459
460
  { empty with record = BoolRec.atom (`Atm (Rec.atom x));
    toplvars = tlv_from_rec x }
461

462
let atom a = { empty with atoms = BoolAtoms.atom (`Atm a) }
463
464

(* Atm = Any ^ a *)
465
466
let var a =  {
  times = BoolPair.vars a;
Pietro Abate's avatar
Pietro Abate committed
467
468
469
  xml   = BoolPair.vars a;
  arrow = BoolPair.vars a;
  record= BoolRec.vars a;
470
471
472
  ints  = BoolIntervals.vars a;
  atoms = BoolAtoms.vars a;
  chars = BoolChars.vars a;
473
  abstract = Abstract.empty;
474
  absent= false;
475
  toplvars = TLV.singleton (a,true)
476
477
}

478
479
(* XXX this function could be potentially costly. There should be
 * better way to take trace of top level variables in a type *)
Pietro Abate's avatar
Pietro Abate committed
480
481
482
483
let update_tlv x y t =
  let open TLV in
  let tlv t =
    let aux get bdd : Set.t =
484
      let l =
Pietro Abate's avatar
Pietro Abate committed
485
        List.fold_left (fun acc (p,n) ->
486
          let acc1 =
Pietro Abate's avatar
Pietro Abate committed
487
488
489
490
491
            List.fold_left (fun acc -> function
              |(`Var v) as x -> Set.union acc (Set.singleton (x,true))
              |_ -> acc
            ) Set.empty p
          in
492
          let acc2 =
Pietro Abate's avatar
Pietro Abate committed
493
494
495
496
497
498
499
500
501
502
503
504
            List.fold_left (fun acc -> function
              |(`Var v) as x -> Set.union acc (Set.singleton (x,false))
              |_ -> assert false
            ) acc1 n
          in acc2::acc
        ) [] (get bdd)
      in
      match l with
      |[] -> Set.empty
      |[h] -> h
      |h::l -> List.fold_left Set.inter h l
    in
Julien Lopez's avatar
Julien Lopez committed
505
    List.fold_left Set.union
506
    (aux BoolChars.get t.chars)
507
508
509
510
511
512
513
    [
      (aux BoolIntervals.get t.ints);
      (aux BoolAtoms.get t.atoms);
      (aux BoolPair.get t.arrow);
      (aux BoolPair.get t.xml);
      (aux BoolRec.get t.record)
    ]
Pietro Abate's avatar
Pietro Abate committed
514
  in
515
516
  let fv t = if Descr.is_empty t then Var.Set.empty else
      Var.Set.union x.toplvars.fv y.toplvars.fv in
Julien Lopez's avatar
Julien Lopez committed
517
518
519
  { t with toplvars =
    {
      tlv = tlv t ;
520
521
      fv = fv t ;
      isvar = t.toplvars.isvar
Pietro Abate's avatar
Pietro Abate committed
522
  } }
Pietro Abate's avatar
Pietro Abate committed
523
524
;;

525
526
let char c = { empty with chars = BoolChars.atom (`Atm c) }
let interval i = { empty with ints = BoolIntervals.atom (`Atm i) }
527
let abstract a = { empty with abstract = a }
528
529

let get_abstract t = t.abstract
530

531
532
533
534
535
536
537
let is_var t = TLV.is_single t.toplvars
let no_var t = TLV.no_variables t.toplvars
let has_tlv t = TLV.has_toplevel t.toplvars

let all_vars t = t.toplvars.TLV.fv
let all_tlv t = t.toplvars.TLV.tlv

Pietro Abate's avatar
Pietro Abate committed
538
let cup x y =
539
540
541
542
543
544
545
546
547
548
549
550
551
  if x == y then x else
    let t = {
      times = BoolPair.cup x.times y.times;
      xml   = BoolPair.cup x.xml y.xml;
      arrow = BoolPair.cup x.arrow y.arrow;
      record= BoolRec.cup x.record y.record;
      ints  = BoolIntervals.cup x.ints  y.ints;
      atoms = BoolAtoms.cup x.atoms y.atoms;
      chars = BoolChars.cup x.chars y.chars;
      abstract = Abstract.cup x.abstract y.abstract;
      absent= x.absent || y.absent;
      toplvars = TLV.empty
    } in
552
    let isvar = (is_var x && equal x t) || (is_var y && equal y t) in
553
    update_tlv x y { t with toplvars = { t.toplvars with TLV.isvar = isvar }}
554

Pietro Abate's avatar
Pietro Abate committed
555
let cap x y =
556
557
558
559
560
561
562
563
564
565
566
567
568
  if x == y then x else
    let t = {
      ints  = BoolIntervals.cap x.ints y.ints;
      times = BoolPair.cap x.times y.times;
      xml   = BoolPair.cap x.xml y.xml;
      record= BoolRec.cap x.record y.record;
      arrow = BoolPair.cap x.arrow y.arrow;
      atoms = BoolAtoms.cap x.atoms y.atoms;
      chars = BoolChars.cap x.chars y.chars;
      abstract = Abstract.cap x.abstract y.abstract;
      absent= x.absent && y.absent;
      toplvars = TLV.empty
    } in
569
    let isvar = (is_var x && equal x t) || (is_var y && equal y t) in
570
    update_tlv x y { t with toplvars = { t.toplvars with TLV.isvar = isvar }}
571

Pietro Abate's avatar
Pietro Abate committed
572
let diff x y =
573
574
575
576
577
578
579
580
581
582
583
584
585
  if x == y then empty else
    let t = {
      times = BoolPair.diff x.times y.times;
      xml   = BoolPair.diff x.xml y.xml;
      arrow = BoolPair.diff x.arrow y.arrow;
      record= BoolRec.diff x.record y.record;
      ints  = BoolIntervals.diff x.ints y.ints;
      atoms = BoolAtoms.diff x.atoms y.atoms;
      chars = BoolChars.diff x.chars y.chars;
      abstract = Abstract.diff x.abstract y.abstract;
      absent= x.absent && not y.absent;
      toplvars = TLV.empty
    } in
586
    let isvar = (equal x any && is_var y) || (is_var x && equal y empty) in
587
    update_tlv x y { t with toplvars = { t.toplvars with TLV.isvar = isvar }}
Pietro Abate's avatar
Pietro Abate committed
588

589
590
(* TODO: optimize disjoint check for boolean combinations *)
let trivially_disjoint a b =
591
592
593
  (BoolChars.trivially_disjoint a.chars b.chars) &&
  (BoolIntervals.trivially_disjoint a.ints b.ints) &&
  (BoolAtoms.trivially_disjoint a.atoms b.atoms) &&
594
595
596
  (BoolPair.trivially_disjoint a.times b.times) &&
  (BoolPair.trivially_disjoint a.xml b.xml) &&
  (BoolPair.trivially_disjoint a.arrow b.arrow) &&
597
  (BoolRec.trivially_disjoint a.record b.record) &&
598
  (Abstract.disjoint a.abstract b.abstract) &&
599
  (not (a.absent && b.absent))
600

601
let rec constant = function
602
603
604
  | Integer i -> interval (Intervals.atom i)
  | Atom a -> atom (Atoms.atom a)
  | Char c -> char (Chars.atom c)
605
  | Pair (x,y) -> times (const_node x) (const_node y)
606
  | Xml (x,y) -> xml (const_node x) (const_node y)
607
  | Record x -> record_fields (false ,LabelMap.map const_node x)
608
609
  | String (i,j,s,c) ->
      if U.equal_index i j then constant c
Pietro Abate's avatar
Pietro Abate committed
610
      else
611
612
613
	let (ch,i') = U.next s i in
	constant (Pair (Char (Chars.V.mk_int ch), String (i',j,s,c)))
and const_node c = cons (constant c)
614

615
616
let neg x = diff any x

617
let any_node = cons any
618
let empty_node = cons empty
619

620
module LabelS = Set.Make(Label)
621

Pietro Abate's avatar
Pietro Abate committed
622
let any_or_absent = { any with absent = true }
623
let only_absent = { empty with absent = true }
624

625
let get_record r =
Pietro Abate's avatar
Pietro Abate committed
626
627
  let labs accu (_,r) =
    List.fold_left
628
      (fun accu (l,_) -> LabelS.add l accu) accu (LabelMap.get r) in
629
  let extend descrs labs (o,r) =
630
631
632
633
634
    let rec aux i labs r =
      match labs with
	| [] -> ()
	| l1::labs ->
	    match r with
Pietro Abate's avatar
Pietro Abate committed
635
	      | (l2,x)::r when l1 == l2 ->
636
637
638
		  descrs.(i) <- cap descrs.(i) (descr x);
		  aux (i+1) labs r
	      | r ->
Pietro Abate's avatar
Pietro Abate committed
639
		  if not o then
640
		    descrs.(i) <- cap descrs.(i) only_absent; (* TODO:OPT *)
641
642
		  aux (i+1) labs r
    in
643
    aux 0 labs (LabelMap.get r);
644
645
646
    o
  in
  let line (p,n) =
Pietro Abate's avatar
Pietro Abate committed
647
    let labels =
648
649
      List.fold_left labs (List.fold_left labs LabelS.empty p) n in
    let labels = LabelS.elements labels in
650
    let nlab = List.length labels in
651
    let mk () = Array.create nlab any_or_absent in
652
653

    let pos = mk () in
Pietro Abate's avatar
Pietro Abate committed
654
655
    let opos = List.fold_left
		 (fun accu x ->
656
657
658
659
660
661
662
663
664
665
666
		    (extend pos labels x) && accu)
		 true p in
    let p = (opos, pos) in

    let n = List.map (fun x ->
			let neg = mk () in
			let o = extend neg labels x in
			(o,neg)
		     ) n in
    (labels,p,n)
  in
667
  List.map line (Rec.get r)
668

669
670
671
672
673
(* Subtyping algorithm *)

let diff_t d t = diff d (descr t)
let cap_t d t = cap d (descr t)
let cup_t d t = cup d (descr t)
674
let cap_product any_left any_right l =
Pietro Abate's avatar
Pietro Abate committed
675
  List.fold_left
676
    (fun (d1,d2) (t1,t2) -> (cap_t d1 t1, cap_t d2 t2))
677
    (any_left,any_right)
678
    l
679
let any_pair = { empty with times = any.times }
680

681
682
683
let rec exists max f =
  (max > 0) && (f (max - 1) || exists (max - 1) f)

684
exception NotEmpty
685

686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
module Witness = struct

  module NodeSet = Set.Make(Node)

  type witness =
    | WInt of Intervals.V.t
    | WAtom of Atoms.sample
    | WChar of Chars.V.t
    | WAbsent
    | WAbstract of Abstract.elem option

    | WPair of witness * witness * witness_slot
    | WXml of witness * witness * witness_slot
    | WRecord of witness label_map * bool * witness_slot
	(* Invariant: WAbsent cannot actually appear *)

    | WFun of (witness * witness option) list * witness_slot
Pietro Abate's avatar
Pietro Abate committed
703
  and witness_slot =
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
      { mutable wnodes_in: NodeSet.t;
	mutable wnodes_out: NodeSet.t;
	mutable wuid: int }

  module WHash = Hashtbl.Make(
    struct
      type t = witness
      let hash_small = function
	| WInt i -> 17 * Intervals.V.hash i
	| WChar c -> 1 + 17 * Chars.V.hash c
	| WAtom None -> 2
	| WAtom (Some (ns,None)) -> 3 + 17 * Ns.Uri.hash ns
	| WAtom (Some (_,Some t)) -> 4 + 17 * Ns.Label.hash t
	| WAbsent -> 5
	| WAbstract None -> 6
	| WAbstract (Some t) -> 7 + 17 * Abstract.T.hash t
Pietro Abate's avatar
Pietro Abate committed
720
	| WPair (_,_,s)
721
722
723
724
725
726
	| WXml (_,_,s)
	| WRecord (_,_,s)
	| WFun (_,s) -> 8 + 17 * s.wuid
      let hash = function
	| WPair (p1,p2,_) -> 257 * hash_small p1 + 65537 * hash_small p2
	| WXml (p1,p2,_) -> 1 + 257 * hash_small p1 + 65537 * hash_small p2
Pietro Abate's avatar
Pietro Abate committed
727
	| WRecord (r,o,_) ->
728
729
730
	    (if o then 2 else 3) + 257 * LabelMap.hash hash_small r
	| WFun (f,_) ->
	    4 + 257 *
Pietro Abate's avatar
Pietro Abate committed
731
732
	      (Hashtbl.hash
		 (List.map
733
		    (function (x,None) -> 17 * hash_small x
Pietro Abate's avatar
Pietro Abate committed
734
		       | (x,Some y) ->
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
			   1 + 17 * hash_small x + 257 * hash_small y)
		    f)
	      )
	| _ -> assert false

      let equal_small w1 w2 = match w1,w2 with
	| WInt i1, WInt i2 -> Intervals.V.equal i1 i2
	| WChar c1, WChar c2 -> Chars.V.equal c1 c2
	| WAtom None, WAtom None -> true
	| WAtom (Some (ns1,None)), WAtom (Some (ns2,None)) ->
	    Ns.Uri.equal ns1 ns2
	| WAtom (Some (_,Some t1)), WAtom (Some (_,Some t2)) ->
	    Ns.Label.equal t1 t2
	| WAbsent, WAbsent -> true
	| WAbstract None, WAbstract None -> false
	| WAbstract (Some t1), WAbstract (Some t2) -> Abstract.T.equal t1 t2
	| _ -> w1 == w2

      let equal w1 w2 = match w1,w2 with
Pietro Abate's avatar
Pietro Abate committed
754
755
	| WPair (p1,q1,_), WPair (p2,q2,_)
	| WXml (p1,q1,_), WXml (p2,q2,_) ->
756
757
758
759
760
761
762
763
	    equal_small p1 p2 && equal_small q1 q2
	| WRecord (r1,o1,_), WRecord (r2,o2,_) ->
	    o1 == o2 && (LabelMap.equal equal_small r1 r2)
	| WFun (f1,_), WFun (f2,_) ->
	    List.length f1 = List.length f2 &&
		List.for_all2
		(fun (x1,y1) (x2,y2) ->
		   equal_small x1 x2 && (match y1,y2 with
Pietro Abate's avatar
Pietro Abate committed
764
					   | Some y1, Some y2 ->
765
766
767
768
769
770
771
772
773
					       equal_small y1 y2
					   | None, None -> true
					   | _ -> false)
		) f1 f2
	| _ -> false
    end)

  let wmemo = WHash.create 1024
  let wuid = ref 0
Pietro Abate's avatar
Pietro Abate committed
774
  let wslot () = { wuid = !wuid; wnodes_in = NodeSet.empty;
775
776
		   wnodes_out = NodeSet.empty }

777
778
779
780
  let () =
    Stats.register Stats.Summary
      (fun ppf -> Format.fprintf ppf "Allocated witnesses:%i@\n" !wuid)

781
782
783
784
785
786
787
788
789
790
791
  let rec print_witness ppf = function
    | WInt i ->
	Format.fprintf ppf "%a" Intervals.V.print i
    | WChar c ->
	Format.fprintf ppf "%a" Chars.V.print c
    | WAtom None ->
	Format.fprintf ppf "`#:#"
    | WAtom (Some (ns,None)) ->
	Format.fprintf ppf "`%a" Ns.InternalPrinter.print_any_ns ns
    | WAtom (Some (_,Some t)) ->
	Format.fprintf ppf "`%a" Ns.Label.print_attr t
Pietro Abate's avatar
Pietro Abate committed
792
    | WPair (w1,w2,_) ->
793
	Format.fprintf ppf "(%a,%a)" print_witness w1 print_witness w2
Pietro Abate's avatar
Pietro Abate committed
794
    | WXml (w1,w2,_) ->
795
796
797
798
	Format.fprintf ppf "XML(%a,%a)" print_witness w1 print_witness w2
    | WRecord (ws,o,_) ->
	Format.fprintf ppf "{";
	LabelMap.iteri
Pietro Abate's avatar
Pietro Abate committed
799
	  (fun l w -> Format.fprintf ppf " %a=%a"
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
	     Label.print_attr l print_witness w)
	  ws;
	if o then Format.fprintf ppf " ..";
	Format.fprintf ppf " }"
    | WFun (f,_) ->
	Format.fprintf ppf "FUN{";
	List.iter (fun (x,y) ->
		     Format.fprintf ppf " %a->" print_witness x;
		     match y with
		       | None -> Format.fprintf ppf "#"
		       | Some y -> print_witness ppf y) f;
	Format.fprintf ppf " }"
    | WAbstract None ->
	Format.fprintf ppf "Abstract(..)"
    | WAbstract (Some s) ->
	Format.fprintf ppf "Abstract(%s)" s
    | WAbsent ->
	Format.fprintf ppf "Absent"
Pietro Abate's avatar
Pietro Abate committed
818

819
820
  let wmk w =  (* incr wuid; w *)  (* hash-consing disabled *)
    try WHash.find wmemo w
Pietro Abate's avatar
Pietro Abate committed
821
822
    with Not_found ->
      incr wuid;
823
      WHash.add wmemo w w;
Pietro Abate's avatar
Pietro Abate committed
824
(*      Format.fprintf Format.std_formatter "W:%a@."
825
826
827
828
829
830
831
832
	print_witness w; *)
      w

  let wpair p1 p2 = wmk (WPair (p1,p2, wslot()))
  let wxml p1 p2 = wmk (WXml (p1,p2, wslot()))
  let wrecord r o = wmk (WRecord (r,o, wslot()))
  let wfun f = wmk (WFun (f, wslot()))

833
  let bool_pair f =
Pietro Abate's avatar
Pietro Abate committed
834
835
836
    Pair.compute
      ~empty:false ~full:true
      ~cup:(||) ~cap:(&&) ~diff:(fun x y -> x && not y)
837
838
839
      ~atom:f

  let bool_rec f =
Pietro Abate's avatar
Pietro Abate committed
840
841
842
    Rec.compute
      ~empty:false ~full:true
      ~cup:(||) ~cap:(&&) ~diff:(fun x y -> x && not y)
843
844
845
846
847
848
849
850
851
852
853
854
      ~atom:f

  let rec node_has n = function
    | WXml (_,_,s) | WPair (_,_,s) | WFun (_,s) | WRecord (_,_,s) as w ->
	if NodeSet.mem n s.wnodes_in then true
	else if NodeSet.mem n s.wnodes_out then false
	else (let r = type_has (descr n) w in
	      if r then s.wnodes_in <- NodeSet.add n s.wnodes_in
	      else s.wnodes_out <- NodeSet.add n s.wnodes_out;
	      r)
    | w -> type_has (descr n) w

855
856
  (* type_has checks if a witness is contained in the union of
   * the leafs of a bdd, ignoring all variables. *)
857
  and type_has t = function
858
859
860
    | WInt i -> Intervals.contains i (BoolIntervals.leafconj t.ints)
    | WChar c -> Chars.contains c (BoolChars.leafconj t.chars)
    | WAtom a -> Atoms.contains_sample a (BoolAtoms.leafconj t.atoms)
Pietro Abate's avatar
Pietro Abate committed
861
862
863
    | WPair (w1,w2,_) ->
	bool_pair
	  (fun (n1,n2) -> node_has n1 w1 && node_has n2 w2)
864
	  (BoolPair.leafconj t.times)
865
    | WXml (w1,w2,_) ->
Pietro Abate's avatar
Pietro Abate committed
866
	bool_pair
867
	  (fun (n1,n2) -> node_has n1 w1 && node_has n2 w2)
868
	  (BoolPair.leafconj t.xml)
869
    | WFun (f,_) ->
Pietro Abate's avatar
Pietro Abate committed
870
	bool_pair
871
872
873
874
875
876
	  (fun (n1,n2) ->
	     List.for_all
	       (fun (x,y) ->
		  not (node_has n1 x) ||
		    (match y with None -> false
		       | Some y -> node_has n2 y))
Pietro Abate's avatar
Pietro Abate committed
877
	       f)
878
	  (BoolPair.leafconj t.arrow)
879
    | WRecord (f,o,_) ->
Pietro Abate's avatar
Pietro Abate committed
880
	bool_rec
881
882
883
	  (fun (o',f') ->
	     ((not o) || o') && (
	       let checked = ref 0 in
Pietro Abate's avatar
Pietro Abate committed
884
885
	       try
		 LabelMap.iteri
886
		   (fun l n ->
Pietro Abate's avatar
Pietro Abate committed
887
		      let w =
888
889
890
			try let w = LabelMap.assoc l f in incr checked; w
			with Not_found -> WAbsent in
		      if not (node_has n w) then raise Exit
Pietro Abate's avatar
Pietro Abate committed
891
		   ) f';
892
893
894
895
896
		 o' || (LabelMap.length f == !checked)
		   (* All the remaining fields cannot be WAbsent
		      because of an invariant. Otherwise, we must
		      check that all are WAbsent here. *)
	       with Exit -> false))
897
	  (BoolRec.leafconj t.record)
898
899
900
901
    | WAbsent -> t.absent
    | WAbstract a -> Abstract.contains_sample a t.abstract
end

Pietro Abate's avatar
Pietro Abate committed
902
type slot = { mutable status : status;
903
904
	       mutable notify : notify;
	       mutable active : bool }
905
906
and status = Empty | NEmpty of Witness.witness | Maybe
and notify = Nothing | Do of slot * (Witness.witness -> unit) * notify
907
908

let slot_empty = { status = Empty; active = false; notify = Nothing }
909
910
let slot_nempty w = { status = NEmpty w;
		     active = false; notify = Nothing }
911

912
let rec notify w = function
913
  | Nothing -> ()
Pietro Abate's avatar
Pietro Abate committed
914
  | Do (n,f,rem) ->
915
916
      if n.status == Maybe then (try f w with NotEmpty -> ());
      notify w rem