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

4
let count = ref 0
Pietro Abate's avatar
Pietro Abate committed
5

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

Pietro Abate's avatar
Pietro Abate committed
10
(*
11
12
13
14
15
16
17
18
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
19
type const =
20
  | Integer of Intervals.V.t
21
  | Atom of Atoms.V.t
22
  | Char of Chars.V.t
23
24
25
26
  | Pair of const * const
  | Xml of const * const
  | Record of const label_map
  | String of U.uindex * U.uindex * U.t * const
27

Jérôme Maloberti's avatar
Jérôme Maloberti committed
28
29
type service_params =
  | TProd of service_params * service_params
Pietro Abate's avatar
Pietro Abate committed
30
  | TOption of service_params
Jérôme Maloberti's avatar
Jérôme Maloberti committed
31
32
33
34
35
36
37
  | 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
38
  | TFloat of string
Jérôme Maloberti's avatar
Jérôme Maloberti committed
39
40
41
  | TBool of string
  | TFile of string
      (* | TUserType of string * (string -> 'a) * ('a -> string) *)
Pietro Abate's avatar
Pietro Abate committed
42
  | TCoord of string
Jérôme Maloberti's avatar
Jérôme Maloberti committed
43
  | TCoordv of service_params * string
Pietro Abate's avatar
Pietro Abate committed
44
  | TESuffix of string
Jérôme Maloberti's avatar
Jérôme Maloberti committed
45
46
47
  | TESuffixs of string
      (*  | TESuffixu of (string * (string -> 'a) * ('a -> string)) *)
  | TSuffix of (bool * service_params)
Pietro Abate's avatar
Pietro Abate committed
48
  | TUnit
Jérôme Maloberti's avatar
Jérôme Maloberti committed
49
50
51
  | TAny
  | TConst of string;;

52
53
54
module Const = struct
  type t = const

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

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

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

100
101
  let equal c1 c2 = compare c1 c2 = 0
end
102

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

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

  include SortedList.FiniteCofinite(T)

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

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

128
129
end

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

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

139
140
141

module TLV = struct

142
143
144
145
146
147
148
149
150
151
152
  module Set = 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)

153
154
155
  (* s : top level variables
   * f : all free variables in the subtree
   * b : true if the type contains only variables *)
156
  type t =  { s : Set.t ; f : Var.Set.t ; b : bool }
157

158
159
160
161
  let empty = { s = Set.empty ; f = Var.Set.empty ; b = true }
  let any = { s = Set.empty ; f = Var.Set.empty ; b = false }

  let singleton (v,p) = { s = Set.singleton (v,p); f = Var.Set.singleton v; b = true }
162
163
164
165
166
167
168

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

  let pair x y = {
    b = false ; 
    s = Set.empty ; 
169
    f = Var.Set.union x.f y.f 
170
171
172
173
174
  }

  let union x y = {
    b = x.b && y.b;
    s = Set.union x.s y.s ;
175
    f = Var.Set.union x.f y.f ;
176
177
178
179
180
  }

  let inter x y = {
    b = x.b && y.b;
    s = Set.inter x.s y.s ;
181
    f = Var.Set.inter x.f y.f ;
182
183
184
  }

  let diff x y = {
185
    b = x.b && y.b;
186
187
    s = Set.inter x.s (Set.fold (fun (v,p) acc -> Set.add (v,not p) acc) y.s Set.empty); 
    f = Var.Set.union x.f y.f;
188
189
190
  }

  (* true if it contains only one variable *)
191
192
  let is_single x = x.b && (Var.Set.cardinal x.f = 1) && (Set.cardinal x.s = 1)
  let no_variables x = (x.b == false) && (Var.Set.cardinal x.f = 0)
193
194

end
195

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

250
251
252
253
  let print_lst ppf =
    List.iter (fun f -> f ppf; Format.fprintf ppf " |")

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

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

278
279
280
281
282
283
284
285
286
287
288
  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;
    ()

289
  let equal a b =
290
    (a == b) || (
291
292
293
      (BoolAtoms.equal a.atoms b.atoms) &&
      (BoolChars.equal a.chars b.chars) &&
      (BoolIntervals.equal a.ints  b.ints) &&
294
295
296
297
      (BoolPair.equal a.times b.times) &&
      (BoolPair.equal a.xml b.xml) &&
      (BoolPair.equal a.arrow b.arrow) &&
      (BoolRec.equal a.record b.record) &&
298
      (Abstract.equal a.abstract b.abstract) &&
299
300
      (a.absent == b.absent)
    )
301
302

  let compare a b =
Pietro Abate's avatar
Pietro Abate committed
303
    if a == b then 0
304
305
306
    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
307
308
309
310
    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
311
    else let c = Abstract.compare a.abstract b.abstract in if c <> 0 then c
312
313
314
    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
315

316
  let hash a =
317
318
319
    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
320
321
322
323
324
325
326
    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
327

328
329
330
end
and Node :
sig
331
  type t = { id : int; cu: Compunit.t; mutable descr : Descr.t }
332
333
334
335
336
  val dump: Format.formatter -> t -> unit
  val check: t -> unit
  val equal: t -> t -> bool
  val hash: t -> int
  val compare:t -> t -> int
337
  val mk: int -> Descr.t -> t
338
end =
339

340
struct
341
  type t = { id : int; cu: Compunit.t; mutable descr : Descr.t }
342
  let check n = ()
343
  let dump ppf n = Format.fprintf ppf "X%i" n.id
344
  let hash x = x.id + Compunit.hash x.cu
Pietro Abate's avatar
Pietro Abate committed
345
  let compare x y =
346
347
348
    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 }
349
350
end

351
352
and Pair : Bool.S with type elem = (Node.t * Node.t) =
  Bool.Make(Custom.Pair(Node)(Node))
Pietro Abate's avatar
Pietro Abate committed
353
and BoolPair : BoolVar.S with
354
  type s = Pair.t = BoolVar.Make(Pair)
355

356
357
358
359
360
(* 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)))
361
362
and BoolRec : BoolVar.S with
  type s = Rec.t = BoolVar.Make(Rec)
363

364
365
module DescrHash = Hashtbl.Make(Descr)
module DescrMap = Map.Make(Descr)
366
367
module DescrSet = Set.Make(Descr)
module DescrSList = SortedList.Make(Descr)
368

369
370
371
type descr = Descr.t
type node = Node.t
include Descr
372

373
374
let forward_print = ref (fun _ _ -> assert false)

Pietro Abate's avatar
Pietro Abate committed
375
376
let make () =
  incr count;
377
378
  Node.mk !count empty

Pietro Abate's avatar
Pietro Abate committed
379
let define n d =
380
381
  n.Node.descr <- d

Pietro Abate's avatar
Pietro Abate committed
382
383
let cons d =
  incr count;
384
385
  Node.mk !count d

386
387
388
389
let descr n = n.Node.descr
let internalize n = n
let id n = n.Node.id

390
391
392
(* two representation possible. either all fields (except vars) are full, OR
 * the field vars is full.
 *)
393
let any =  {
Pietro Abate's avatar
Pietro Abate committed
394
395
396
397
  times = BoolPair.full;
  xml   = BoolPair.full;
  arrow = BoolPair.full;
  record= BoolRec.full;
398
399
400
  ints  = BoolIntervals.full;
  atoms = BoolAtoms.full;
  chars = BoolChars.full;
401
  abstract = Abstract.any;
402
  absent= false;
403
  toplvars = TLV.any
404
}
405
406

let non_constructed =
Pietro Abate's avatar
Pietro Abate committed
407
  { any with
408
      times = empty.times; xml = empty.xml; record = empty.record }
Pietro Abate's avatar
Pietro Abate committed
409
410

let non_constructed_or_absent =
411
  { non_constructed with absent = true }
412

Pietro Abate's avatar
Pietro Abate committed
413
(* Descr.t type constructors *)
414
415
416
417
418
let times x y = { empty with times = BoolPair.atom (`Atm (Pair.atom (x,y))); toplvars = TLV.pair (descr x).toplvars (descr y).toplvars }
let xml x y = { empty with xml = BoolPair.atom (`Atm (Pair.atom (x,y))); toplvars = TLV.pair (descr x).toplvars (descr y).toplvars }
let arrow x y = { empty with arrow = BoolPair.atom (`Atm (Pair.atom (x,y))); toplvars = TLV.pair (descr x).toplvars (descr y).toplvars }

(* XXX toplevel variables are not properly set for records *)
Pietro Abate's avatar
Pietro Abate committed
419
420
let record label t =
  { empty with
421
      record = BoolRec.atom (`Atm (Rec.atom (true,LabelMap.singleton label t))) }
422
let record_fields x =
423
  { empty with record = BoolRec.atom (`Atm (Rec.atom x)) }
424

425
let atom a = { empty with atoms = BoolAtoms.atom (`Atm a) }
426
427

(* Atm = Any ^ a *)
428
429
let var a =  {
  times = BoolPair.vars a;
Pietro Abate's avatar
Pietro Abate committed
430
431
432
  xml   = BoolPair.vars a;
  arrow = BoolPair.vars a;
  record= BoolRec.vars a;
433
434
435
  ints  = BoolIntervals.vars a;
  atoms = BoolAtoms.vars a;
  chars = BoolChars.vars a;
436
  abstract = Abstract.empty;
437
  absent= false;
438
  toplvars = TLV.singleton (a,true)
439
440
}

441
let is_var t = TLV.is_single t.toplvars
442
let no_var t = TLV.no_variables t.toplvars
443

444
445
let char c = { empty with chars = BoolChars.atom (`Atm c) }
let interval i = { empty with ints = BoolIntervals.atom (`Atm i) }
446
let abstract a = { empty with abstract = a }
447
448

let get_abstract t = t.abstract
449

Pietro Abate's avatar
Pietro Abate committed
450
let cup x y =
451
  if x == y then x else {
452
453
454
    times = BoolPair.cup x.times y.times;
    xml   = BoolPair.cup x.xml y.xml;
    arrow = BoolPair.cup x.arrow y.arrow;
455
    record= BoolRec.cup x.record y.record;
456
457
458
    ints  = BoolIntervals.cup x.ints  y.ints;
    atoms = BoolAtoms.cup x.atoms y.atoms;
    chars = BoolChars.cup x.chars y.chars;
459
    abstract = Abstract.cup x.abstract y.abstract;
460
    absent= x.absent || y.absent;
461
    toplvars = TLV.union x.toplvars y.toplvars
462
  }
463

Pietro Abate's avatar
Pietro Abate committed
464
let cap x y =
465
  if x == y then x else {
466
    ints  = BoolIntervals.cap x.ints y.ints;
467
468
    times = BoolPair.cap x.times y.times;
    xml   = BoolPair.cap x.xml y.xml;
469
    record= BoolRec.cap x.record y.record;
470
    arrow = BoolPair.cap x.arrow y.arrow;
471
472
    atoms = BoolAtoms.cap x.atoms y.atoms;
    chars = BoolChars.cap x.chars y.chars;
473
    abstract = Abstract.cap x.abstract y.abstract;
474
    absent= x.absent && y.absent;
475
    toplvars = TLV.inter x.toplvars y.toplvars
476
  }
477

Pietro Abate's avatar
Pietro Abate committed
478
let diff x y =
479
  if x == y then empty else {
480
481
482
    times = BoolPair.diff x.times y.times;
    xml   = BoolPair.diff x.xml y.xml;
    arrow = BoolPair.diff x.arrow y.arrow;
483
    record= BoolRec.diff x.record y.record;
484
    ints  = BoolIntervals.diff x.ints y.ints;
485
486
    atoms = BoolAtoms.diff x.atoms y.atoms;
    chars = BoolChars.diff x.chars y.chars;
487
    abstract = Abstract.diff x.abstract y.abstract;
488
    absent= x.absent && not y.absent;
489
    toplvars = TLV.diff x.toplvars y.toplvars
490
  }
Pietro Abate's avatar
Pietro Abate committed
491

492
493
(* TODO: optimize disjoint check for boolean combinations *)
let trivially_disjoint a b =
494
495
496
  (BoolChars.trivially_disjoint a.chars b.chars) &&
  (BoolIntervals.trivially_disjoint a.ints b.ints) &&
  (BoolAtoms.trivially_disjoint a.atoms b.atoms) &&
497
498
499
  (BoolPair.trivially_disjoint a.times b.times) &&
  (BoolPair.trivially_disjoint a.xml b.xml) &&
  (BoolPair.trivially_disjoint a.arrow b.arrow) &&
500
  (BoolRec.trivially_disjoint a.record b.record) &&
501
  (Abstract.disjoint a.abstract b.abstract) &&
502
  (not (a.absent && b.absent))
503

504
let rec constant = function
505
506
507
  | Integer i -> interval (Intervals.atom i)
  | Atom a -> atom (Atoms.atom a)
  | Char c -> char (Chars.atom c)
508
  | Pair (x,y) -> times (const_node x) (const_node y)
509
  | Xml (x,y) -> xml (const_node x) (const_node y)
510
  | Record x -> record_fields (false ,LabelMap.map const_node x)
511
512
  | String (i,j,s,c) ->
      if U.equal_index i j then constant c
Pietro Abate's avatar
Pietro Abate committed
513
      else
514
515
516
	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)
517

518
519
let neg x = diff any x

520
let any_node = cons any
521
let empty_node = cons empty
522

523
module LabelS = Set.Make(Label)
524

Pietro Abate's avatar
Pietro Abate committed
525
let any_or_absent = { any with absent = true }
526
let only_absent = { empty with absent = true }
527

528
let get_record r =
Pietro Abate's avatar
Pietro Abate committed
529
530
  let labs accu (_,r) =
    List.fold_left
531
      (fun accu (l,_) -> LabelS.add l accu) accu (LabelMap.get r) in
532
  let extend descrs labs (o,r) =
533
534
535
536
537
    let rec aux i labs r =
      match labs with
	| [] -> ()
	| l1::labs ->
	    match r with
Pietro Abate's avatar
Pietro Abate committed
538
	      | (l2,x)::r when l1 == l2 ->
539
540
541
		  descrs.(i) <- cap descrs.(i) (descr x);
		  aux (i+1) labs r
	      | r ->
Pietro Abate's avatar
Pietro Abate committed
542
		  if not o then
543
		    descrs.(i) <- cap descrs.(i) only_absent; (* TODO:OPT *)
544
545
		  aux (i+1) labs r
    in
546
    aux 0 labs (LabelMap.get r);
547
548
549
    o
  in
  let line (p,n) =
Pietro Abate's avatar
Pietro Abate committed
550
    let labels =
551
552
      List.fold_left labs (List.fold_left labs LabelS.empty p) n in
    let labels = LabelS.elements labels in
553
    let nlab = List.length labels in
554
    let mk () = Array.create nlab any_or_absent in
555
556

    let pos = mk () in
Pietro Abate's avatar
Pietro Abate committed
557
558
    let opos = List.fold_left
		 (fun accu x ->
559
560
561
562
563
564
565
566
567
568
569
		    (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
570
  List.map line (Rec.get r)
571

572
573
574
575
576
(* 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)
577
let cap_product any_left any_right l =
Pietro Abate's avatar
Pietro Abate committed
578
  List.fold_left
579
    (fun (d1,d2) (t1,t2) -> (cap_t d1 t1, cap_t d2 t2))
580
    (any_left,any_right)
581
    l
582
let any_pair = { empty with times = any.times }
583

584
585
586
let rec exists max f =
  (max > 0) && (f (max - 1) || exists (max - 1) f)

587
exception NotEmpty
588

589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
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
606
  and witness_slot =
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
      { 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
623
	| WPair (_,_,s)
624
625
626
627
628
629
	| 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
630
	| WRecord (r,o,_) ->
631
632
633
	    (if o then 2 else 3) + 257 * LabelMap.hash hash_small r
	| WFun (f,_) ->
	    4 + 257 *
Pietro Abate's avatar
Pietro Abate committed
634
635
	      (Hashtbl.hash
		 (List.map
636
		    (function (x,None) -> 17 * hash_small x
Pietro Abate's avatar
Pietro Abate committed
637
		       | (x,Some y) ->
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
			   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
657
658
	| WPair (p1,q1,_), WPair (p2,q2,_)
	| WXml (p1,q1,_), WXml (p2,q2,_) ->
659
660
661
662
663
664
665
666
	    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
667
					   | Some y1, Some y2 ->
668
669
670
671
672
673
674
675
676
					       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
677
  let wslot () = { wuid = !wuid; wnodes_in = NodeSet.empty;
678
679
		   wnodes_out = NodeSet.empty }

680
681
682
683
  let () =
    Stats.register Stats.Summary
      (fun ppf -> Format.fprintf ppf "Allocated witnesses:%i@\n" !wuid)

684
685
686
687
688
689
690
691
692
693
694
  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
695
    | WPair (w1,w2,_) ->
696
	Format.fprintf ppf "(%a,%a)" print_witness w1 print_witness w2
Pietro Abate's avatar
Pietro Abate committed
697
    | WXml (w1,w2,_) ->
698
699
700
701
	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
702
	  (fun l w -> Format.fprintf ppf " %a=%a"
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
	     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
721

722
723
  let wmk w =  (* incr wuid; w *)  (* hash-consing disabled *)
    try WHash.find wmemo w
Pietro Abate's avatar
Pietro Abate committed
724
725
    with Not_found ->
      incr wuid;
726
      WHash.add wmemo w w;
Pietro Abate's avatar
Pietro Abate committed
727
(*      Format.fprintf Format.std_formatter "W:%a@."
728
729
730
731
732
733
734
735
	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()))

736
  let bool_pair f =
Pietro Abate's avatar
Pietro Abate committed
737
738
739
    Pair.compute
      ~empty:false ~full:true
      ~cup:(||) ~cap:(&&) ~diff:(fun x y -> x && not y)
740
741
742
      ~atom:f

  let bool_rec f =
Pietro Abate's avatar
Pietro Abate committed
743
744
745
    Rec.compute
      ~empty:false ~full:true
      ~cup:(||) ~cap:(&&) ~diff:(fun x y -> x && not y)
746
747
748
749
750
751
752
753
754
755
756
757
      ~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

758
759
  (* type_has checks if a witness is contained in the union of
   * the leafs of a bdd, ignoring all variables. *)
760
  and type_has t = function
761
762
763
    | 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
764
765
766
    | WPair (w1,w2,_) ->
	bool_pair
	  (fun (n1,n2) -> node_has n1 w1 && node_has n2 w2)
767
	  (BoolPair.leafconj t.times)
768
    | WXml (w1,w2,_) ->
Pietro Abate's avatar
Pietro Abate committed
769
	bool_pair
770
	  (fun (n1,n2) -> node_has n1 w1 && node_has n2 w2)
771
	  (BoolPair.leafconj t.xml)
772
    | WFun (f,_) ->
Pietro Abate's avatar
Pietro Abate committed
773
	bool_pair
774
775
776
777
778
779
	  (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
780
	       f)
781
	  (BoolPair.leafconj t.arrow)
782
    | WRecord (f,o,_) ->
Pietro Abate's avatar
Pietro Abate committed
783
	bool_rec
784
785
786
	  (fun (o',f') ->
	     ((not o) || o') && (
	       let checked = ref 0 in
Pietro Abate's avatar
Pietro Abate committed
787
788
	       try
		 LabelMap.iteri
789
		   (fun l n ->
Pietro Abate's avatar
Pietro Abate committed
790
		      let w =
791
792
793
			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
794
		   ) f';
795
796
797
798
799
		 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))
800
	  (BoolRec.leafconj t.record)
801
802
803
804
    | WAbsent -> t.absent
    | WAbstract a -> Abstract.contains_sample a t.abstract
end

Pietro Abate's avatar
Pietro Abate committed
805
type slot = { mutable status : status;
806
807
	       mutable notify : notify;
	       mutable active : bool }
808
809
and status = Empty | NEmpty of Witness.witness | Maybe
and notify = Nothing | Do of slot * (Witness.witness -> unit) * notify
810
811

let slot_empty = { status = Empty; active = false; notify = Nothing }
812
813
let slot_nempty w = { status = NEmpty w;
		     active = false; notify = Nothing }
814

815
let rec notify w = function
816
  | Nothing -> ()
Pietro Abate's avatar
Pietro Abate committed
817
  | Do (n,f,rem) ->
818
819
      if n.status == Maybe then (try f w with NotEmpty -> ());
      notify w rem
820
821
822
823
824

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

825
826
827
let set s w =
  s.status <- NEmpty w;
  notify w s.notify;
Pietro Abate's avatar
Pietro Abate committed
828
  s.notify <- Nothing;
829
830
  raise NotEmpty

831
let rec big_conj f l n w =
832
  match l with
833
834
    | [] -> set n w
    | [arg] -> f w arg n
835
    | arg::rem ->
Pietro Abate's avatar
Pietro Abate committed
836
837
	let s =
	  { status = Maybe; active = false;
838
	    notify = Do (n,(big_conj f rem n), Nothing) } in
Pietro Abate's avatar
Pietro Abate committed
839
	try
840
	  f w arg s;
841
	  if s.active then n.active <- true
842
	with NotEmpty when n.status == Empty || n.status == Maybe -> ()
843

844
let memo = DescrHash.create 8191
Pietro Abate's avatar
Pietro Abate committed
845
let marks = ref []
846

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

849
850
let complex = ref 0

851
let rec slot d =
852
  incr complex;
Pietro Abate's avatar
Pietro Abate committed
853
  Stats.Counter.incr count_subtype;
854
  if d.absent then slot_nempty Witness.WAbsent
Pietro Abate's avatar
Pietro Abate committed
855
  else if not (Intervals.is_empty (BoolIntervals.leafconj d.ints))
856
  then slot_nempty (Witness.WInt (Intervals.sample (BoolIntervals.leafconj d.ints)))
Pietro Abate's avatar
Pietro Abate committed
857
  else if not (Atoms.is_empty (BoolAtoms.leafconj d.atoms))
858
  then slot_nempty (Witness.WAtom (Atoms.sample (BoolAtoms.leafconj d.atoms)))
Pietro Abate's avatar
Pietro Abate committed
859
  else if not (Chars.is_empty (BoolChars.leafconj d.chars))
860
  then slot_nempty (Witness.WChar (Chars.sample (BoolChars.leafconj d.chars)))
Pietro Abate's avatar
Pietro Abate committed
861
  else if not (Abstract.is_empty d.abstract)
862
  then slot_nempty (Witness.WAbstract (Abstract.sample d.abstract))
863
864
865
866
867
  else try DescrHash.find memo d
  with Not_found ->
    let s = { status = Maybe; active = false; notify = Nothing } in
    DescrHash.add memo d s;
    (try
868
       iter_s s check_times (Pair.get (BoolPair.leafconj d.times));