types.ml 116 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
module Abstracts = struct
106
  module T = Custom.String
107
108
  type abs = T.t

109
  module V = struct type t = abs * Obj.t end
110
111

  include SortedList.FiniteCofinite(T)
112
  let full = any
113
114

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

122
123
124
125
  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
126

127
128
end

129
130
type pair_kind = [ `Normal | `XML ]

Pietro Abate's avatar
Pietro Abate committed
131
module BoolAtoms : BoolVar.S with
132
  type s = Atoms.t = BoolVar.Make(Atoms)
Pietro Abate's avatar
Pietro Abate committed
133
module BoolIntervals : BoolVar.S with
134
  type s = Intervals.t = BoolVar.Make(Intervals)
Pietro Abate's avatar
Pietro Abate committed
135
module BoolChars : BoolVar.S with
136
  type s = Chars.t = BoolVar.Make(Chars)
137
138
module BoolAbstracts : BoolVar.S with
  type s = Abstracts.t = BoolVar.Make(Abstracts)
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
(* module TLV = struct *)

(*   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 pp_aux ppf pp_elem s = *)
(*       let f ppf = function *)
(*         |(v,true) -> Format.fprintf ppf "%a" pp_elem v *)
(*         |(v,false) -> Format.fprintf ppf "~ %a" pp_elem v *)
(*       in *)
(*       Utils.pp_list ~sep:";" ~delim:("{","}") f ppf (elements s) *)
(*     let dump ppf s = pp_aux ppf Var.dump s *)
(*     let pp ppf s = pp_aux ppf Var.pp s *)

(*     let printf = pp Format.std_formatter *)
(*   end *)

(*   (\* tlv : top level variables *)
(*    * fv : all free variables in the subtree *\) *)
(*   type t =  { tlv : Set.t ; fv : Var.Set.t; isvar : bool } *)

(*   let empty = { tlv = Set.empty ; fv = Var.Set.empty; isvar = false } *)
(*   let any = { tlv = Set.empty ; fv = Var.Set.empty; isvar = false } *)

(*   let singleton (v,p) = { tlv = Set.singleton (v,p); fv = Var.Set.singleton v; isvar = true } *)

(*   (\* return the max of top level variables *\) *)
(*   let max x = Set.max_elt x.tlv *)

(*   let pair x y = { *)
(*     tlv = Set.empty ; *)
(*     fv = Var.Set.union x.fv y.fv ; *)
(*     isvar = false *)
(*   } *)

(*   let record x = { *)
(*     tlv = Set.empty ; *)
(*     fv = x.fv ; *)
(*     isvar = false *)
(*   } *)

(*   (\* true if it contains only one variable *\) *)
(*   let is_single t = t.isvar && (Var.Set.cardinal t.fv = 1) && (Set.cardinal t.tlv = 1) *)

(*   let no_variables t = (Var.Set.cardinal t.fv = 0) && (Set.cardinal t.tlv = 0) *)

(*   let has_toplevel t = Set.cardinal t.tlv > 0 *)

(*   let pp ppf x = Set.pp ppf x.tlv *)
(*   let dump ppf x = Format.fprintf ppf "<fv = %a ; tlv = %a>" Var.Set.dump x.fv Set.dump x.tlv *)
(*   let printf = pp Format.std_formatter *)

(*   let mem v x = Set.mem v x.tlv *)

(* end *)
203

Pietro Abate's avatar
Pietro Abate committed
204
module rec Descr :
205
sig
Pietro Abate's avatar
Pietro Abate committed
206
  (* each kind is represented as a union of itersection of types
207
208
209
   * the type is a union of all kinds
   *
   * we add a new field that contains only variables.
Pietro Abate's avatar
Pietro Abate committed
210
   * Inv :
211
212
213
214
215
216
217
218
219
220
221
222
     * 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
   *)
223
  type s = {
224
225
226
    atoms : BoolAtoms.t;
    ints  : BoolIntervals.t;
    chars : BoolChars.t;
227
228
229
230
    times : BoolPair.t;
    xml   : BoolPair.t;
    arrow : BoolPair.t;
    record: BoolRec.t;
231
    abstract: BoolAbstracts.t;
232
233
234
    (* 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 *)
235
    absent: bool;
236
  }
237
  include Custom.T with type t = s
238
  val empty: t
Julien Lopez's avatar
Julien Lopez committed
239
  val any : t
Julien Lopez's avatar
Julien Lopez committed
240
  val is_empty : t -> bool
241
242
end =
struct
243
  type s = {
244
245
246
    atoms : BoolAtoms.t;
    ints  : BoolIntervals.t;
    chars : BoolChars.t;
247
248
249
250
    times : BoolPair.t;
    xml   : BoolPair.t;
    arrow : BoolPair.t;
    record: BoolRec.t;
251
    abstract: BoolAbstracts.t;
252
    absent: bool;
253
  }
254
  type t = s
255

256
  let dump ppf d =
257
    Format.fprintf ppf "<types atoms(%a) ints(%a) chars(%a) times(%a) arrow(%a) record(%a) xml(%a) abstract(%a) absent(%b)>\n"
258
      BoolAtoms.dump d.atoms
259
260
      BoolIntervals.dump d.ints
      BoolChars.dump d.chars
261
      BoolPair.dump d.times
262
      BoolPair.dump d.arrow
263
264
      BoolRec.dump d.record
      BoolPair.dump d.xml
265
      BoolAbstracts.dump d.abstract
266
      d.absent
267

Pietro Abate's avatar
Pietro Abate committed
268
269
270
271
  let empty = {
    times = BoolPair.empty;
    xml   = BoolPair.empty;
    arrow = BoolPair.empty;
272
    record= BoolRec.empty;
273
274
275
    ints  = BoolIntervals.empty;
    atoms = BoolAtoms.empty;
    chars = BoolChars.empty;
276
    abstract = BoolAbstracts.empty;
277
    absent = false;
278
279
  }

Julien Lopez's avatar
Julien Lopez committed
280
281
282
283
284
285
286
287
288
289
290
291
  (*
   * Two representations possible. Either all fields (except vars) are full, OR
   * the field vars is full.
   *)
  let any =  {
    times = BoolPair.full;
    xml   = BoolPair.full;
    arrow = BoolPair.full;
    record= BoolRec.full;
    ints  = BoolIntervals.full;
    atoms = BoolAtoms.full;
    chars = BoolChars.full;
292
    abstract = BoolAbstracts.full;
Julien Lopez's avatar
Julien Lopez committed
293
294
295
    absent= false;
  }

296
297
298
299
300
301
302
303
  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;
304
    BoolAbstracts.check a.abstract;
305
306
    ()

307
  let equal a b =
308
    (a == b) || (
309
310
311
      (BoolAtoms.equal a.atoms b.atoms) &&
      (BoolChars.equal a.chars b.chars) &&
      (BoolIntervals.equal a.ints  b.ints) &&
312
313
314
315
      (BoolPair.equal a.times b.times) &&
      (BoolPair.equal a.xml b.xml) &&
      (BoolPair.equal a.arrow b.arrow) &&
      (BoolRec.equal a.record b.record) &&
316
      (BoolAbstracts.equal a.abstract b.abstract) &&
317
318
      (a.absent == b.absent)
    )
319

Julien Lopez's avatar
Julien Lopez committed
320
321
322
323
324
325
326
327
  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) &&
328
      (BoolAbstracts.is_empty a.abstract)
Julien Lopez's avatar
Julien Lopez committed
329

330
  let compare a b =
Pietro Abate's avatar
Pietro Abate committed
331
    if a == b then 0
332
333
334
    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
335
336
337
338
    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
339
    else let c = BoolAbstracts.compare a.abstract b.abstract in if c <> 0 then c
340
341
342
    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
343

344
  let hash a =
345
346
347
    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
348
349
350
351
    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
352
    let accu = 17 * accu + BoolAbstracts.hash a.abstract in
353
354
    let accu = if a.absent then accu+5 else accu in
    accu
355

356
357
358
end
and Node :
sig
359
  type t = { id : int; cu: Compunit.t; mutable descr : Descr.t }
360
361
362
363
364
  val dump: Format.formatter -> t -> unit
  val check: t -> unit
  val equal: t -> t -> bool
  val hash: t -> int
  val compare:t -> t -> int
365
  val mk: int -> Descr.t -> t
366
end =
367

368
struct
369
  type t = { id : int; cu: Compunit.t; mutable descr : Descr.t }
370
  let check n = ()
371
  let dump ppf n = Format.fprintf ppf "X%i" n.id
372
  let hash x = x.id + Compunit.hash x.cu
Pietro Abate's avatar
Pietro Abate committed
373
  let compare x y =
374
375
376
    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 }
377
378
end

379
380
and Pair : Bool.S with type elem = (Node.t * Node.t) =
  Bool.Make(Custom.Pair(Node)(Node))
Kim Nguyễn's avatar
Kim Nguyễn committed
381
and BoolPair : BoolVar.S with type s = Pair.t =
382
  BoolVar.Make(Pair)
383

384
385
386
387
388
(* 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)))
389
390
and BoolRec : BoolVar.S with
  type s = Rec.t = BoolVar.Make(Rec)
391

392
393
module DescrHash = Hashtbl.Make(Descr)
module DescrMap = Map.Make(Descr)
394
395
module DescrSet = Set.Make(Descr)
module DescrSList = SortedList.Make(Descr)
396

397
398
399
type descr = Descr.t
type node = Node.t
include Descr
400

401
402
let forward_print = ref (fun _ _ -> assert false)

Pietro Abate's avatar
Pietro Abate committed
403
404
let make () =
  incr count;
405
406
  Node.mk !count empty

Pietro Abate's avatar
Pietro Abate committed
407
let define n d =
408
409
  n.Node.descr <- d

Pietro Abate's avatar
Pietro Abate committed
410
411
let cons d =
  incr count;
412
413
  Node.mk !count d

414
415
416
417
let descr n = n.Node.descr
let internalize n = n
let id n = n.Node.id

418
let non_constructed =
Pietro Abate's avatar
Pietro Abate committed
419
  { any with
420
      times = empty.times; xml = empty.xml; record = empty.record }
Pietro Abate's avatar
Pietro Abate committed
421
422

let non_constructed_or_absent =
423
  { non_constructed with absent = true }
424

Pietro Abate's avatar
Pietro Abate committed
425
(* Descr.t type constructors *)
426
427
428
let times x y = { empty with times = BoolPair.atom (`Atm (Pair.atom (x,y))) }
let xml x y = { empty with xml = BoolPair.atom (`Atm (Pair.atom (x,y))) }
let arrow x y = { empty with arrow = BoolPair.atom (`Atm (Pair.atom (x,y))) }
429

Pietro Abate's avatar
Pietro Abate committed
430
let record label t =
431
  { empty with record = BoolRec.atom (`Atm (Rec.atom (true,LabelMap.singleton label t))) }
432

433
let record_fields x =
434
  { empty with record = BoolRec.atom (`Atm (Rec.atom x)) }
435

436
let atom a = { empty with atoms = BoolAtoms.atom (`Atm a) }
437
438

(* Atm = Any ^ a *)
439
440
let var a =  {
  times = BoolPair.vars a;
Pietro Abate's avatar
Pietro Abate committed
441
442
443
  xml   = BoolPair.vars a;
  arrow = BoolPair.vars a;
  record= BoolRec.vars a;
444
445
446
  ints  = BoolIntervals.vars a;
  atoms = BoolAtoms.vars a;
  chars = BoolChars.vars a;
447
  abstract = BoolAbstracts.vars a;
448
  absent = false;
449
450
}

451
452
let char c = { empty with chars = BoolChars.atom (`Atm c) }
let interval i = { empty with ints = BoolIntervals.atom (`Atm i) }
453
let abstract a = { empty with abstract = BoolAbstracts.atom (`Atm a) }
454

455

456
457
458
459
460
461
module type BVS =
sig
    type elem
    type t
    val get : t -> (elem list* elem list) list
end
462

Pietro Abate's avatar
Pietro Abate committed
463

Pietro Abate's avatar
Pietro Abate committed
464
let cup x y =
465
  if x == y then x else
466
    {
467
468
469
470
471
472
473
      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;
474
      abstract = BoolAbstracts.cup x.abstract y.abstract;
475
476
      absent = x.absent || y.absent;
    }
477

Pietro Abate's avatar
Pietro Abate committed
478
let cap x y =
479
  if x == y then x else
480
    {
481
482
483
484
485
486
487
      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;
488
      abstract = BoolAbstracts.cap x.abstract y.abstract;
489
      absent= x.absent && y.absent;
490
    }
491

Pietro Abate's avatar
Pietro Abate committed
492
let diff x y =
493
  if x == y then empty else
494
    {
495
496
497
498
499
500
501
      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;
502
      abstract = BoolAbstracts.diff x.abstract y.abstract;
503
      absent= x.absent && not y.absent;
504
    }
Pietro Abate's avatar
Pietro Abate committed
505

506
507
(* TODO: optimize disjoint check for boolean combinations *)
let trivially_disjoint a b =
508
509
510
  (BoolChars.trivially_disjoint a.chars b.chars) &&
  (BoolIntervals.trivially_disjoint a.ints b.ints) &&
  (BoolAtoms.trivially_disjoint a.atoms b.atoms) &&
511
512
513
  (BoolPair.trivially_disjoint a.times b.times) &&
  (BoolPair.trivially_disjoint a.xml b.xml) &&
  (BoolPair.trivially_disjoint a.arrow b.arrow) &&
514
  (BoolRec.trivially_disjoint a.record b.record) &&
515
  (BoolAbstracts.trivially_disjoint a.abstract b.abstract) &&
516
  (not (a.absent && b.absent))
517

518
let rec constant = function
519
520
521
  | Integer i -> interval (Intervals.atom i)
  | Atom a -> atom (Atoms.atom a)
  | Char c -> char (Chars.atom c)
522
  | Pair (x,y) -> times (const_node x) (const_node y)
523
  | Xml (x,y) -> xml (const_node x) (const_node y)
524
  | Record x -> record_fields (false ,LabelMap.map const_node x)
525
526
  | String (i,j,s,c) ->
      if U.equal_index i j then constant c
Pietro Abate's avatar
Pietro Abate committed
527
      else
528
529
530
	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)
531

532
533
let neg x = diff any x

534
let any_node = cons any
535
let empty_node = cons empty
536

537
module LabelS = Set.Make(Label)
538

Pietro Abate's avatar
Pietro Abate committed
539
let any_or_absent = { any with absent = true }
540
let only_absent = { empty with absent = true }
541

542
let get_record r =
Pietro Abate's avatar
Pietro Abate committed
543
544
  let labs accu (_,r) =
    List.fold_left
545
      (fun accu (l,_) -> LabelS.add l accu) accu (LabelMap.get r) in
546
  let extend descrs labs (o,r) =
547
548
549
550
551
    let rec aux i labs r =
      match labs with
	| [] -> ()
	| l1::labs ->
	    match r with
Pietro Abate's avatar
Pietro Abate committed
552
	      | (l2,x)::r when l1 == l2 ->
553
554
555
		  descrs.(i) <- cap descrs.(i) (descr x);
		  aux (i+1) labs r
	      | r ->
Pietro Abate's avatar
Pietro Abate committed
556
		  if not o then
557
		    descrs.(i) <- cap descrs.(i) only_absent; (* TODO:OPT *)
558
559
		  aux (i+1) labs r
    in
560
    aux 0 labs (LabelMap.get r);
561
562
563
    o
  in
  let line (p,n) =
Pietro Abate's avatar
Pietro Abate committed
564
    let labels =
565
566
      List.fold_left labs (List.fold_left labs LabelS.empty p) n in
    let labels = LabelS.elements labels in
567
    let nlab = List.length labels in
568
    let mk () = Array.create nlab any_or_absent in
569
570

    let pos = mk () in
Pietro Abate's avatar
Pietro Abate committed
571
572
    let opos = List.fold_left
		 (fun accu x ->
573
574
575
576
577
578
579
580
581
582
583
		    (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
584
  List.map line (Rec.get r)
585

586
587
588
589
590
(* 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)
591
let cap_product any_left any_right l =
Pietro Abate's avatar
Pietro Abate committed
592
  List.fold_left
593
    (fun (d1,d2) (t1,t2) -> (cap_t d1 t1, cap_t d2 t2))
594
    (any_left,any_right)
595
    l
596
let any_pair = { empty with times = any.times }
597

598
599
600
let rec exists max f =
  (max > 0) && (f (max - 1) || exists (max - 1) f)

601
exception NotEmpty
602

603
604
605
606
607
608
609
610
611
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
612
    | WAbstract of Abstracts.elem option
613
614
615
616
617
618
619

    | 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
620
  and witness_slot =
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
      { 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
636
	| WAbstract (Some t) -> 7 + 17 * Abstracts.T.hash t
Pietro Abate's avatar
Pietro Abate committed
637
	| WPair (_,_,s)
638
639
640
641
642
643
	| 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
644
	| WRecord (r,o,_) ->
645
646
647
	    (if o then 2 else 3) + 257 * LabelMap.hash hash_small r
	| WFun (f,_) ->
	    4 + 257 *
Pietro Abate's avatar
Pietro Abate committed
648
649
	      (Hashtbl.hash
		 (List.map
650
		    (function (x,None) -> 17 * hash_small x
Pietro Abate's avatar
Pietro Abate committed
651
		       | (x,Some y) ->
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
			   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
667
	| WAbstract (Some t1), WAbstract (Some t2) -> Abstracts.T.equal t1 t2
668
669
670
	| _ -> w1 == w2

      let equal w1 w2 = match w1,w2 with
Pietro Abate's avatar
Pietro Abate committed
671
672
	| WPair (p1,q1,_), WPair (p2,q2,_)
	| WXml (p1,q1,_), WXml (p2,q2,_) ->
673
674
675
676
677
678
679
680
	    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
681
					   | Some y1, Some y2 ->
682
683
684
685
686
687
688
689
690
					       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
691
  let wslot () = { wuid = !wuid; wnodes_in = NodeSet.empty;
692
693
		   wnodes_out = NodeSet.empty }

694
695
696
697
  let () =
    Stats.register Stats.Summary
      (fun ppf -> Format.fprintf ppf "Allocated witnesses:%i@\n" !wuid)

698
  let rec pp ppf = function
699
700
701
702
703
704
705
706
707
708
    | 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
709
    | WPair (w1,w2,_) ->
710
	Format.fprintf ppf "(%a,%a)" pp w1 pp w2
Pietro Abate's avatar
Pietro Abate committed
711
    | WXml (w1,w2,_) ->
712
	Format.fprintf ppf "XML(%a,%a)" pp w1 pp w2
713
714
715
    | WRecord (ws,o,_) ->
	Format.fprintf ppf "{";
	LabelMap.iteri
Pietro Abate's avatar
Pietro Abate committed
716
	  (fun l w -> Format.fprintf ppf " %a=%a"
717
	     Label.print_attr l pp w)
718
719
720
721
722
723
	  ws;
	if o then Format.fprintf ppf " ..";
	Format.fprintf ppf " }"
    | WFun (f,_) ->
	Format.fprintf ppf "FUN{";
	List.iter (fun (x,y) ->
724
		     Format.fprintf ppf " %a->" pp x;
725
726
		     match y with
		       | None -> Format.fprintf ppf "#"
727
		       | Some y -> pp ppf y) f;
728
729
730
731
732
733
734
	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
735

736
737
  let printf = pp Format.std_formatter

738
739
  let wmk w =  (* incr wuid; w *)  (* hash-consing disabled *)
    try WHash.find wmemo w
Pietro Abate's avatar
Pietro Abate committed
740
741
    with Not_found ->
      incr wuid;
742
      WHash.add wmemo w w;
Pietro Abate's avatar
Pietro Abate committed
743
(*      Format.fprintf Format.std_formatter "W:%a@."
744
	pp w; *)
745
746
747
748
749
750
751
      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()))

752
  let bool_pair f =
Pietro Abate's avatar
Pietro Abate committed
753
754
755
    Pair.compute
      ~empty:false ~full:true
      ~cup:(||) ~cap:(&&) ~diff:(fun x y -> x && not y)
756
757
758
      ~atom:f

  let bool_rec f =
Pietro Abate's avatar
Pietro Abate committed
759
760
761
    Rec.compute
      ~empty:false ~full:true
      ~cup:(||) ~cap:(&&) ~diff:(fun x y -> x && not y)
762
763
764
765
766
767
768
769
770
771
772
773
      ~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

774
775
  (* type_has checks if a witness is contained in the union of
   * the leafs of a bdd, ignoring all variables. *)
776
  and type_has t = function
777
778
779
    | 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
780
781
782
    | WPair (w1,w2,_) ->
	bool_pair
	  (fun (n1,n2) -> node_has n1 w1 && node_has n2 w2)
783
	  (BoolPair.leafconj t.times)
784
    | WXml (w1,w2,_) ->
Pietro Abate's avatar
Pietro Abate committed
785
	bool_pair
786
	  (fun (n1,n2) -> node_has n1 w1 && node_has n2 w2)
787
	  (BoolPair.leafconj t.xml)
788
    | WFun (f,_) ->
Pietro Abate's avatar
Pietro Abate committed
789
	bool_pair
790
791
792
793
794
795
	  (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
796
	       f)
797
	  (BoolPair.leafconj t.arrow)
798
    | WRecord (f,o,_) ->
Pietro Abate's avatar
Pietro Abate committed
799
	bool_rec
800
801
802
	  (fun (o',f') ->
	     ((not o) || o') && (
	       let checked = ref 0 in
Pietro Abate's avatar
Pietro Abate committed
803
804
	       try
		 LabelMap.iteri
805
		   (fun l n ->
Pietro Abate's avatar
Pietro Abate committed
806
		      let w =
807
808
809
			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
810
		   ) f';
811
812
813
814
815
		 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))
816
	  (BoolRec.leafconj t.record)
817
    | WAbsent -> t.absent
818
    | WAbstract a -> Abstracts.contains_sample a (BoolAbstracts.leafconj t.abstract)
819
820
end

Pietro Abate's avatar
Pietro Abate committed
821
type slot = { mutable status : status;
822
823
	       mutable notify : notify;
	       mutable active : bool }
824
825
and status = Empty | NEmpty of Witness.witness | Maybe
and notify = Nothing | Do of slot * (Witness.witness -> unit) * notify
826
827

let slot_empty = { status = Empty; active = false; notify = Nothing }
828
829
let slot_nempty w = { status = NEmpty w;
		     active = false; notify = Nothing }
830

831
let rec notify w = function
832
  | Nothing -> ()
Pietro Abate's avatar
Pietro Abate committed
833
  | Do (n,f,rem) ->
834
835
      if n.status == Maybe then (try f w with NotEmpty -> ());
      notify w rem
836
837
838
839
840

let rec iter_s s f = function
  | [] -> ()
  | arg::rem -> f arg s; iter_s s f rem

841
842
843
let set s w =
  s.status <- NEmpty w;
  notify w s.notify;
Pietro Abate's avatar
Pietro Abate committed
844
  s.notify <- Nothing;
845
846
  raise NotEmpty

847
let rec big_conj f l n w =
848
  match l with
849
850
    | [] -> set n w
    | [arg] -> f w arg n
851
    | arg::rem ->
Pietro Abate's avatar
Pietro Abate committed
852
853
	let s =
	  { status = Maybe; active = false;
854
	    notify = Do (n,(big_conj f rem n), Nothing) } in
Pietro Abate's avatar
Pietro Abate committed
855
	try
856
	  f w arg s;
857
	  if s.active then n.active <- true
858
	with NotEmpty when n.status == Empty || n.status == Maybe -> ()
859

860
let memo = DescrHash.create 8191
Pietro Abate's avatar
Pietro Abate committed
861
let marks = ref []
862

Pietro Abate's avatar
Pietro Abate committed
863
let count_subtype = Stats.Counter.create "Subtyping internal loop"
864

865
866
let complex = ref 0

867
let rec slot d =
868
  incr complex;
Pietro Abate's avatar
Pietro Abate committed
869
  Stats.Counter.incr count_subtype;
870
  (* XXX here I call leafconj a zilliontime. REWRITE !!! *)
871
  if d.absent then slot_nempty Witness.WAbsent
Pietro Abate's avatar
Pietro Abate committed
872
  else if not (Intervals.is_empty (BoolIntervals.leafconj d.ints))
873
  then slot_nempty (Witness.WInt (Intervals.sample (BoolIntervals.leafconj d.ints)))
Pietro Abate's avatar
Pietro Abate committed
874
  else if not (Atoms.is_empty (BoolAtoms.leafconj d.atoms))
875
  then slot_nempty (Witness.WAtom (Atoms.sample (BoolAtoms.leafconj d.atoms)))
Pietro Abate's avatar
Pietro Abate committed
876
  else if not (Chars.is_empty (BoolChars.leafconj d.chars))
877
  then slot_nempty (Witness.WChar (Chars.sample (BoolChars.leafconj d.chars)))
878
879
  else if not (Abstracts.is_empty (BoolAbstracts.leafconj d.abstract))
  then slot_nempty (Witness.WAbstract (Abstracts.sample (BoolAbstracts.leafconj d.abstract)))
880
881
882
883
884
  else try DescrHash.find memo d
  with Not_found ->
    let s = { status = Maybe; active = false; notify = Nothing } in
    DescrHash.add memo d s;
    (try
885
       iter_s s check_times (Pair.get (BoolPair.leafconj d.times));
Pietro Abate's avatar
Pietro Abate committed
886
       iter_s s check_xml (Pair.get (BoolPair.leafconj d.xml));
887
888
       iter_s s check_arrow (Pair.get (BoolPair.leafconj d.arrow));
       iter_s s check_record (get_record (BoolRec.leafconj d.record));
889
       if s.active then marks := s :: !marks else s.status <- Empty;