types.ml 132 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 107
module Abstracts
  =
struct
108
  module T = Custom.String
109

110
  module V = struct type t = T.t * Obj.t end
111 112

  include SortedList.FiniteCofinite(T)
113 114 115 116 117
  let trivially_disjoint = disjoint
  let compute ~empty ~full ~cup ~cap ~diff ~atom b = assert false
  let get _ = assert false
  let iter _ = assert false

118
  let full = any
119 120

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

128 129 130 131
  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
132

133 134
end

135 136
type pair_kind = [ `Normal | `XML ]

137 138 139 140
module BoolAtoms = BoolVar.Make(Atoms)
module BoolIntervals = BoolVar.Make(Intervals)
module BoolChars = BoolVar.Make(Chars)
module BoolAbstracts = BoolVar.Make(Abstracts)
141

Pietro Abate's avatar
Pietro Abate committed
142
module rec Descr :
143
sig
144
  type s = {
145 146 147
    atoms : BoolAtoms.t;
    ints  : BoolIntervals.t;
    chars : BoolChars.t;
148 149 150 151
    times : BoolPair.t;
    xml   : BoolPair.t;
    arrow : BoolPair.t;
    record: BoolRec.t;
152
    abstract: BoolAbstracts.t;
153
    absent: bool;
154
  }
155
  include Custom.T with type t = s
156
  val empty: t
Julien Lopez's avatar
Julien Lopez committed
157
  val any : t
Julien Lopez's avatar
Julien Lopez committed
158
  val is_empty : t -> bool
159 160
end =
struct
161
  type s = {
162 163 164
    atoms : BoolAtoms.t;
    ints  : BoolIntervals.t;
    chars : BoolChars.t;
165 166 167 168
    times : BoolPair.t;
    xml   : BoolPair.t;
    arrow : BoolPair.t;
    record: BoolRec.t;
169
    abstract: BoolAbstracts.t;
170
    absent: bool;
171
  }
172
  type t = s
173

174
  let dump ppf d =
175 176 177 178 179 180 181 182 183 184
    Format.fprintf ppf "@[<v 1>types:@\n\
@<1>    atoms: %a@\n\
@<1>     ints: %a@\n\
@<1>    chars: %a@\n\
@<1>    times: %a@\n\
@<1>    arrow: %a@\n\
@<1>   record: %a@\n\
@<1>      xml: %a@\n\
@<1> abstract: %a@\n\
@<1>   absent: %b@]@\n"
185
      BoolAtoms.dump d.atoms
186 187
      BoolIntervals.dump d.ints
      BoolChars.dump d.chars
188
      BoolPair.dump d.times
189
      BoolPair.dump d.arrow
190 191
      BoolRec.dump d.record
      BoolPair.dump d.xml
192
      BoolAbstracts.dump d.abstract
193
      d.absent
194

Pietro Abate's avatar
Pietro Abate committed
195 196 197 198
  let empty = {
    times = BoolPair.empty;
    xml   = BoolPair.empty;
    arrow = BoolPair.empty;
199
    record= BoolRec.empty;
200 201 202
    ints  = BoolIntervals.empty;
    atoms = BoolAtoms.empty;
    chars = BoolChars.empty;
203
    abstract = BoolAbstracts.empty;
204
    absent = false;
205 206
  }

Julien Lopez's avatar
Julien Lopez committed
207 208 209 210
  let any =  {
    times = BoolPair.full;
    xml   = BoolPair.full;
    arrow = BoolPair.full;
211
    record = BoolRec.full;
Julien Lopez's avatar
Julien Lopez committed
212 213 214
    ints  = BoolIntervals.full;
    atoms = BoolAtoms.full;
    chars = BoolChars.full;
215
    abstract = BoolAbstracts.full;
216
    absent = false;
Julien Lopez's avatar
Julien Lopez committed
217 218
  }

219 220 221 222 223 224 225 226
  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;
227
    BoolAbstracts.check a.abstract;
228 229
    ()

230
  let equal a b =
231
    (a == b) || (
232 233 234
      (BoolAtoms.equal a.atoms b.atoms) &&
      (BoolChars.equal a.chars b.chars) &&
      (BoolIntervals.equal a.ints  b.ints) &&
235 236 237 238
      (BoolPair.equal a.times b.times) &&
      (BoolPair.equal a.xml b.xml) &&
      (BoolPair.equal a.arrow b.arrow) &&
      (BoolRec.equal a.record b.record) &&
239
      (BoolAbstracts.equal a.abstract b.abstract) &&
240 241
      (a.absent == b.absent)
    )
242

Julien Lopez's avatar
Julien Lopez committed
243 244 245 246 247 248 249 250
  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) &&
251
      (BoolAbstracts.is_empty a.abstract)
Julien Lopez's avatar
Julien Lopez committed
252

253
  let compare a b =
Pietro Abate's avatar
Pietro Abate committed
254
    if a == b then 0
255 256 257
    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
258 259 260 261
    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
262
    else let c = BoolAbstracts.compare a.abstract b.abstract in if c <> 0 then c
263 264 265
    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
266

267
  let hash a =
268 269 270
    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
271 272 273 274
    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
275
    let accu = 17 * accu + BoolAbstracts.hash a.abstract in
276 277
    let accu = if a.absent then accu+5 else accu in
    accu
278

279 280 281
end
and Node :
sig
282
  type t = { id : int; cu: Compunit.t; mutable descr : Descr.t }
283 284 285 286 287
  val dump: Format.formatter -> t -> unit
  val check: t -> unit
  val equal: t -> t -> bool
  val hash: t -> int
  val compare:t -> t -> int
288
  val mk: int -> Descr.t -> t
289
end =
290

291
struct
292
  type t = { id : int; cu: Compunit.t; mutable descr : Descr.t }
293
  let check n = ()
294
  let dump ppf n = Format.fprintf ppf "X%i" n.id
295
  let hash x = x.id + Compunit.hash x.cu
Pietro Abate's avatar
Pietro Abate committed
296
  let compare x y =
297 298
    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))
299

300
  let mk id d = { id = id; cu = Compunit.current (); descr = d }
301 302 303



304 305
end

306 307
and Pair : Bool.S with type elem = (Node.t * Node.t) =
  Bool.Make(Custom.Pair(Node)(Node))
308
and BoolPair : BoolVar.S with module Atom = Pair = BoolVar.Make(Pair)
309

310 311 312 313 314
(* 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)))
315
and BoolRec : BoolVar.S with module Atom = Rec = BoolVar.Make(Rec)
316

317 318
module DescrHash = Hashtbl.Make(Descr)
module DescrMap = Map.Make(Descr)
319 320
module DescrSet = Set.Make(Descr)
module DescrSList = SortedList.Make(Descr)
321

322 323 324
type descr = Descr.t
type node = Node.t
include Descr
325

326 327
let dummy_print = (fun _ _ -> assert false)
let forward_print = ref dummy_print
328

Pietro Abate's avatar
Pietro Abate committed
329 330
let make () =
  incr count;
331 332
  Node.mk !count empty

Pietro Abate's avatar
Pietro Abate committed
333
let define n d =
334 335
  n.Node.descr <- d

Pietro Abate's avatar
Pietro Abate committed
336 337
let cons d =
  incr count;
338 339
  Node.mk !count d

340 341 342 343
let descr n = n.Node.descr
let internalize n = n
let id n = n.Node.id

344
let non_constructed =
Pietro Abate's avatar
Pietro Abate committed
345
  { any with
346
      times = empty.times; xml = empty.xml; record = empty.record }
Pietro Abate's avatar
Pietro Abate committed
347 348

let non_constructed_or_absent =
349
  { non_constructed with absent = true }
350

Pietro Abate's avatar
Pietro Abate committed
351
(* Descr.t type constructors *)
352 353 354
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))) }
355

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

359
let record_fields x =
360
  { empty with record = BoolRec.atom (`Atm (Rec.atom x)) }
361

362
let atom a = { empty with atoms = BoolAtoms.atom (`Atm a) }
363 364

(* Atm = Any ^ a *)
365 366 367 368 369 370 371 372 373 374
let var a =
  {
  times = BoolPair.var a;
  xml   = BoolPair.var a;
  arrow = BoolPair.var a;
  record= BoolRec.var a;
  ints  = BoolIntervals.var a;
  atoms = BoolAtoms.var a;
  chars = BoolChars.var a;
  abstract = BoolAbstracts.var a;
375
  absent = false;
376 377
}

378 379
let char c = { empty with chars = BoolChars.atom (`Atm c) }
let interval i = { empty with ints = BoolIntervals.atom (`Atm i) }
380
let abstract a = { empty with abstract = BoolAbstracts.atom (`Atm a) }
381

Pietro Abate's avatar
Pietro Abate committed
382
let cup x y =
383
  if x == y then x else
384
    {
385 386 387 388 389 390 391
      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;
392
      abstract = BoolAbstracts.cup x.abstract y.abstract;
393 394
      absent = x.absent || y.absent;
    }
395

Pietro Abate's avatar
Pietro Abate committed
396
let cap x y =
397
  if x == y then x else
398
    {
399 400 401
      ints  = BoolIntervals.cap x.ints y.ints;
      times = BoolPair.cap x.times y.times;
      xml   = BoolPair.cap x.xml y.xml;
402
      record = BoolRec.cap x.record y.record;
403 404 405
      arrow = BoolPair.cap x.arrow y.arrow;
      atoms = BoolAtoms.cap x.atoms y.atoms;
      chars = BoolChars.cap x.chars y.chars;
406
      abstract = BoolAbstracts.cap x.abstract y.abstract;
407
      absent= x.absent && y.absent;
408
    }
409

Pietro Abate's avatar
Pietro Abate committed
410
let diff x y =
411
  if x == y then empty else
412
    {
413 414 415 416 417 418 419
      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;
420
      abstract = BoolAbstracts.diff x.abstract y.abstract;
421
      absent= x.absent && not y.absent;
422
    }
Pietro Abate's avatar
Pietro Abate committed
423

424 425
(* TODO: optimize disjoint check for boolean combinations *)
let trivially_disjoint a b =
426 427 428
  (BoolChars.trivially_disjoint a.chars b.chars) &&
  (BoolIntervals.trivially_disjoint a.ints b.ints) &&
  (BoolAtoms.trivially_disjoint a.atoms b.atoms) &&
429 430 431
  (BoolPair.trivially_disjoint a.times b.times) &&
  (BoolPair.trivially_disjoint a.xml b.xml) &&
  (BoolPair.trivially_disjoint a.arrow b.arrow) &&
432
  (BoolRec.trivially_disjoint a.record b.record) &&
433
  (BoolAbstracts.trivially_disjoint a.abstract b.abstract) &&
434
  (not (a.absent && b.absent))
435

436
let rec constant = function
437 438 439
  | Integer i -> interval (Intervals.atom i)
  | Atom a -> atom (Atoms.atom a)
  | Char c -> char (Chars.atom c)
440
  | Pair (x,y) -> times (const_node x) (const_node y)
441
  | Xml (x,y) -> xml (const_node x) (const_node y)
442
  | Record x -> record_fields (false ,LabelMap.map const_node x)
443 444
  | String (i,j,s,c) ->
      if U.equal_index i j then constant c
Pietro Abate's avatar
Pietro Abate committed
445
      else
446 447 448
	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)
449

450 451
let neg x = diff any x

452
let any_node = cons any
453
let empty_node = cons empty
454

455
module LabelS = Set.Make(Label)
456

Pietro Abate's avatar
Pietro Abate committed
457
let any_or_absent = { any with absent = true }
458
let only_absent = { empty with absent = true }
459

460
let get_record r =
Pietro Abate's avatar
Pietro Abate committed
461 462
  let labs accu (_,r) =
    List.fold_left
463
      (fun accu (l,_) -> LabelS.add l accu) accu (LabelMap.get r) in
464
  let extend descrs labs (o,r) =
465 466 467 468 469
    let rec aux i labs r =
      match labs with
	| [] -> ()
	| l1::labs ->
	    match r with
Pietro Abate's avatar
Pietro Abate committed
470
	      | (l2,x)::r when l1 == l2 ->
471 472 473
		  descrs.(i) <- cap descrs.(i) (descr x);
		  aux (i+1) labs r
	      | r ->
Pietro Abate's avatar
Pietro Abate committed
474
		  if not o then
475
		    descrs.(i) <- cap descrs.(i) only_absent; (* TODO:OPT *)
476 477
		  aux (i+1) labs r
    in
478
    aux 0 labs (LabelMap.get r);
479 480 481
    o
  in
  let line (p,n) =
Pietro Abate's avatar
Pietro Abate committed
482
    let labels =
483 484
      List.fold_left labs (List.fold_left labs LabelS.empty p) n in
    let labels = LabelS.elements labels in
485
    let nlab = List.length labels in
486
    let mk () = Array.create nlab any_or_absent in
487 488

    let pos = mk () in
Pietro Abate's avatar
Pietro Abate committed
489 490
    let opos = List.fold_left
		 (fun accu x ->
491 492 493 494 495 496 497 498 499 500 501
		    (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
502
  List.map line (Rec.get r)
503

504 505 506 507 508
(* 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)
509
let cap_product any_left any_right l =
Pietro Abate's avatar
Pietro Abate committed
510
  List.fold_left
511
    (fun (d1,d2) (t1,t2) -> (cap_t d1 t1, cap_t d2 t2))
512
    (any_left,any_right)
513
    l
514
let any_pair = { empty with times = any.times }
515

516 517 518
let rec exists max f =
  (max > 0) && (f (max - 1) || exists (max - 1) f)

519
exception NotEmpty
520

521 522 523 524 525 526 527 528 529
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
530
    | WAbstract of Abstracts.elem option
531 532 533 534 535 536 537

    | 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
538
  and witness_slot =
539 540 541 542 543 544 545 546 547 548 549 550 551 552 553
      { 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
554
	| WAbstract (Some t) -> 7 + 17 * Abstracts.T.hash t
Pietro Abate's avatar
Pietro Abate committed
555
	| WPair (_,_,s)
556 557 558 559 560 561
	| 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
562
	| WRecord (r,o,_) ->
563 564 565
	    (if o then 2 else 3) + 257 * LabelMap.hash hash_small r
	| WFun (f,_) ->
	    4 + 257 *
Pietro Abate's avatar
Pietro Abate committed
566 567
	      (Hashtbl.hash
		 (List.map
568
		    (function (x,None) -> 17 * hash_small x
Pietro Abate's avatar
Pietro Abate committed
569
		       | (x,Some y) ->
570 571 572 573 574 575 576 577 578 579 580 581 582 583 584
			   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
585
	| WAbstract (Some t1), WAbstract (Some t2) -> Abstracts.T.equal t1 t2
586 587 588
	| _ -> w1 == w2

      let equal w1 w2 = match w1,w2 with
Pietro Abate's avatar
Pietro Abate committed
589 590
	| WPair (p1,q1,_), WPair (p2,q2,_)
	| WXml (p1,q1,_), WXml (p2,q2,_) ->
591 592 593 594 595 596 597 598
	    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
599
					   | Some y1, Some y2 ->
600 601 602 603 604 605 606 607 608
					       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
609
  let wslot () = { wuid = !wuid; wnodes_in = NodeSet.empty;
610 611
		   wnodes_out = NodeSet.empty }

612 613 614 615
  let () =
    Stats.register Stats.Summary
      (fun ppf -> Format.fprintf ppf "Allocated witnesses:%i@\n" !wuid)

616
  let rec pp ppf = function
617 618 619 620 621 622 623 624 625 626
    | 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
627
    | WPair (w1,w2,_) ->
628
	Format.fprintf ppf "(%a,%a)" pp w1 pp w2
Pietro Abate's avatar
Pietro Abate committed
629
    | WXml (w1,w2,_) ->
630
	Format.fprintf ppf "XML(%a,%a)" pp w1 pp w2
631 632 633
    | WRecord (ws,o,_) ->
	Format.fprintf ppf "{";
	LabelMap.iteri
Pietro Abate's avatar
Pietro Abate committed
634
	  (fun l w -> Format.fprintf ppf " %a=%a"
635
	     Label.print_attr l pp w)
636 637 638 639 640 641
	  ws;
	if o then Format.fprintf ppf " ..";
	Format.fprintf ppf " }"
    | WFun (f,_) ->
	Format.fprintf ppf "FUN{";
	List.iter (fun (x,y) ->
642
		     Format.fprintf ppf " %a->" pp x;
643 644
		     match y with
		       | None -> Format.fprintf ppf "#"
645
		       | Some y -> pp ppf y) f;
646 647 648 649 650 651 652
	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
653

654 655
  let printf = pp Format.std_formatter

656 657
  let wmk w =  (* incr wuid; w *)  (* hash-consing disabled *)
    try WHash.find wmemo w
Pietro Abate's avatar
Pietro Abate committed
658 659
    with Not_found ->
      incr wuid;
660
      WHash.add wmemo w w;
Pietro Abate's avatar
Pietro Abate committed
661
(*      Format.fprintf Format.std_formatter "W:%a@."
662
	pp w; *)
663 664 665 666 667 668 669
      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()))

670
  let bool_pair f =
Pietro Abate's avatar
Pietro Abate committed
671 672 673
    Pair.compute
      ~empty:false ~full:true
      ~cup:(||) ~cap:(&&) ~diff:(fun x y -> x && not y)
674 675 676
      ~atom:f

  let bool_rec f =
Pietro Abate's avatar
Pietro Abate committed
677 678 679
    Rec.compute
      ~empty:false ~full:true
      ~cup:(||) ~cap:(&&) ~diff:(fun x y -> x && not y)
680 681
      ~atom:f

682
  let rec node_has n = function
683 684 685 686 687 688 689 690 691
    | 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

692 693
  (* type_has checks if a witness is contained in the union of
   * the leafs of a bdd, ignoring all variables. *)
694
  and type_has t = function
695 696 697
    | 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
698 699 700
    | WPair (w1,w2,_) ->
	bool_pair
	  (fun (n1,n2) -> node_has n1 w1 && node_has n2 w2)
701
	  (BoolPair.leafconj t.times)
702
    | WXml (w1,w2,_) ->
Pietro Abate's avatar
Pietro Abate committed
703
	bool_pair
704
	  (fun (n1,n2) -> node_has n1 w1 && node_has n2 w2)
705
	  (BoolPair.leafconj t.xml)
706
    | WFun (f,_) ->
Pietro Abate's avatar
Pietro Abate committed
707
	bool_pair
708 709 710 711 712 713
	  (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
714
	       f)
715
	  (BoolPair.leafconj t.arrow)
716
    | WRecord (f,o,_) ->
Pietro Abate's avatar
Pietro Abate committed
717
	bool_rec
718 719 720
	  (fun (o',f') ->
	     ((not o) || o') && (
	       let checked = ref 0 in
Pietro Abate's avatar
Pietro Abate committed
721 722
	       try
		 LabelMap.iteri
723
		   (fun l n ->
Pietro Abate's avatar
Pietro Abate committed
724
		      let w =
725 726 727
			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
728
		   ) f';
729 730 731 732 733
		 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))
734
	  (BoolRec.leafconj t.record)
735
    | WAbsent -> t.absent
736
    | WAbstract a -> Abstracts.contains_sample a (BoolAbstracts.leafconj t.abstract)
737 738
end

Pietro Abate's avatar
Pietro Abate committed
739
type slot = { mutable status : status;
740 741
	       mutable notify : notify;
	       mutable active : bool }
742 743
and status = Empty | NEmpty of Witness.witness | Maybe
and notify = Nothing | Do of slot * (Witness.witness -> unit) * notify
744 745

let slot_empty = { status = Empty; active = false; notify = Nothing }
746 747
let slot_nempty w = { status = NEmpty w;
		     active = false; notify = Nothing }
748

749
let rec notify w = function
750
  | Nothing -> ()
Pietro Abate's avatar
Pietro Abate committed
751
  | Do (n,f,rem) ->
752 753
      if n.status == Maybe then (try f w with NotEmpty -> ());
      notify w rem
754 755 756 757 758

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

759 760 761
let set s w =
  s.status <- NEmpty w;
  notify w s.notify;
Pietro Abate's avatar
Pietro Abate committed
762
  s