types.ml 123 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

Pietro Abate's avatar
Pietro Abate committed
140
module rec Descr :
141
sig
Pietro Abate's avatar
Pietro Abate committed
142
  (* each kind is represented as a union of itersection of types
143 144 145
   * the type is a union of all kinds
   *
   * we add a new field that contains only variables.
Pietro Abate's avatar
Pietro Abate committed
146
   * Inv :
147 148 149 150 151 152 153 154 155 156 157 158
     * 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
   *)
159
  type s = {
160 161 162
    atoms : BoolAtoms.t;
    ints  : BoolIntervals.t;
    chars : BoolChars.t;
163 164 165 166
    times : BoolPair.t;
    xml   : BoolPair.t;
    arrow : BoolPair.t;
    record: BoolRec.t;
167
    abstract: BoolAbstracts.t;
168 169 170
    (* 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 *)
171
    absent: bool;
172
  }
173
  include Custom.T with type t = s
174
  val empty: t
Julien Lopez's avatar
Julien Lopez committed
175
  val any : t
Julien Lopez's avatar
Julien Lopez committed
176
  val is_empty : t -> bool
177 178
end =
struct
179
  type s = {
180 181 182
    atoms : BoolAtoms.t;
    ints  : BoolIntervals.t;
    chars : BoolChars.t;
183 184 185 186
    times : BoolPair.t;
    xml   : BoolPair.t;
    arrow : BoolPair.t;
    record: BoolRec.t;
187
    abstract: BoolAbstracts.t;
188
    absent: bool;
189
  }
190
  type t = s
191

192
  let dump ppf d =
193 194 195 196 197 198 199 200 201 202
    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"
203
      BoolAtoms.dump d.atoms
204 205
      BoolIntervals.dump d.ints
      BoolChars.dump d.chars
206
      BoolPair.dump d.times
207
      BoolPair.dump d.arrow
208 209
      BoolRec.dump d.record
      BoolPair.dump d.xml
210
      BoolAbstracts.dump d.abstract
211
      d.absent
212

Pietro Abate's avatar
Pietro Abate committed
213 214 215 216
  let empty = {
    times = BoolPair.empty;
    xml   = BoolPair.empty;
    arrow = BoolPair.empty;
217
    record= BoolRec.empty;
218 219 220
    ints  = BoolIntervals.empty;
    atoms = BoolAtoms.empty;
    chars = BoolChars.empty;
221
    abstract = BoolAbstracts.empty;
222
    absent = false;
223 224
  }

Julien Lopez's avatar
Julien Lopez committed
225 226 227 228 229 230 231 232
  (*
   * 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;
233
    record = BoolRec.full;
Julien Lopez's avatar
Julien Lopez committed
234 235 236
    ints  = BoolIntervals.full;
    atoms = BoolAtoms.full;
    chars = BoolChars.full;
237
    abstract = BoolAbstracts.full;
238
    absent = false;
Julien Lopez's avatar
Julien Lopez committed
239 240
  }

241 242 243 244 245 246 247 248
  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;
249
    BoolAbstracts.check a.abstract;
250 251
    ()

252
  let equal a b =
253
    (a == b) || (
254 255 256
      (BoolAtoms.equal a.atoms b.atoms) &&
      (BoolChars.equal a.chars b.chars) &&
      (BoolIntervals.equal a.ints  b.ints) &&
257 258 259 260
      (BoolPair.equal a.times b.times) &&
      (BoolPair.equal a.xml b.xml) &&
      (BoolPair.equal a.arrow b.arrow) &&
      (BoolRec.equal a.record b.record) &&
261
      (BoolAbstracts.equal a.abstract b.abstract) &&
262 263
      (a.absent == b.absent)
    )
264

Julien Lopez's avatar
Julien Lopez committed
265 266 267 268 269 270 271 272
  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) &&
273
      (BoolAbstracts.is_empty a.abstract)
Julien Lopez's avatar
Julien Lopez committed
274

275
  let compare a b =
Pietro Abate's avatar
Pietro Abate committed
276
    if a == b then 0
277 278 279
    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
280 281 282 283
    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
284
    else let c = BoolAbstracts.compare a.abstract b.abstract in if c <> 0 then c
285 286 287
    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
288

289
  let hash a =
290 291 292
    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
293 294 295 296
    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
297
    let accu = 17 * accu + BoolAbstracts.hash a.abstract in
298 299
    let accu = if a.absent then accu+5 else accu in
    accu
300

301 302 303
end
and Node :
sig
304
  type t = { id : int; cu: Compunit.t; mutable descr : Descr.t }
305 306 307 308 309
  val dump: Format.formatter -> t -> unit
  val check: t -> unit
  val equal: t -> t -> bool
  val hash: t -> int
  val compare:t -> t -> int
310
  val mk: int -> Descr.t -> t
311
end =
312

313
struct
314
  type t = { id : int; cu: Compunit.t; mutable descr : Descr.t }
315
  let check n = ()
316
  let dump ppf n = Format.fprintf ppf "X%i" n.id
317
  let hash x = x.id + Compunit.hash x.cu
Pietro Abate's avatar
Pietro Abate committed
318
  let compare x y =
319 320
    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))
321

322
  let mk id d = { id = id; cu = Compunit.current (); descr = d }
323 324 325



326 327
end

328 329
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
330
and BoolPair : BoolVar.S with type s = Pair.t =
331
  BoolVar.Make(Pair)
332

333 334 335 336 337
(* 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)))
338 339
and BoolRec : BoolVar.S with
  type s = Rec.t = BoolVar.Make(Rec)
340

341 342
module DescrHash = Hashtbl.Make(Descr)
module DescrMap = Map.Make(Descr)
343 344
module DescrSet = Set.Make(Descr)
module DescrSList = SortedList.Make(Descr)
345

346 347 348
type descr = Descr.t
type node = Node.t
include Descr
349

350 351
let dummy_print = (fun _ _ -> assert false)
let forward_print = ref dummy_print
352

Pietro Abate's avatar
Pietro Abate committed
353 354
let make () =
  incr count;
355 356
  Node.mk !count empty

Pietro Abate's avatar
Pietro Abate committed
357
let define n d =
358 359
  n.Node.descr <- d

Pietro Abate's avatar
Pietro Abate committed
360 361
let cons d =
  incr count;
362 363
  Node.mk !count d

364 365 366 367
let descr n = n.Node.descr
let internalize n = n
let id n = n.Node.id

368
let non_constructed =
Pietro Abate's avatar
Pietro Abate committed
369
  { any with
370
      times = empty.times; xml = empty.xml; record = empty.record }
Pietro Abate's avatar
Pietro Abate committed
371 372

let non_constructed_or_absent =
373
  { non_constructed with absent = true }
374

Pietro Abate's avatar
Pietro Abate committed
375
(* Descr.t type constructors *)
376 377 378
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))) }
379

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

383
let record_fields x =
384
  { empty with record = BoolRec.atom (`Atm (Rec.atom x)) }
385

386
let atom a = { empty with atoms = BoolAtoms.atom (`Atm a) }
387 388

(* Atm = Any ^ a *)
389 390
let var a =  {
  times = BoolPair.vars a;
Pietro Abate's avatar
Pietro Abate committed
391 392 393
  xml   = BoolPair.vars a;
  arrow = BoolPair.vars a;
  record= BoolRec.vars a;
394 395 396
  ints  = BoolIntervals.vars a;
  atoms = BoolAtoms.vars a;
  chars = BoolChars.vars a;
397
  abstract = BoolAbstracts.vars a;
398
  absent = false;
399 400
}

401 402
let char c = { empty with chars = BoolChars.atom (`Atm c) }
let interval i = { empty with ints = BoolIntervals.atom (`Atm i) }
403
let abstract a = { empty with abstract = BoolAbstracts.atom (`Atm a) }
404

Pietro Abate's avatar
Pietro Abate committed
405
let cup x y =
406
  if x == y then x else
407
    {
408 409 410 411 412 413 414
      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;
415
      abstract = BoolAbstracts.cup x.abstract y.abstract;
416 417
      absent = x.absent || y.absent;
    }
418

Pietro Abate's avatar
Pietro Abate committed
419
let cap x y =
420
  if x == y then x else
421
    {
422 423 424
      ints  = BoolIntervals.cap x.ints y.ints;
      times = BoolPair.cap x.times y.times;
      xml   = BoolPair.cap x.xml y.xml;
425
      record = BoolRec.cap x.record y.record;
426 427 428
      arrow = BoolPair.cap x.arrow y.arrow;
      atoms = BoolAtoms.cap x.atoms y.atoms;
      chars = BoolChars.cap x.chars y.chars;
429
      abstract = BoolAbstracts.cap x.abstract y.abstract;
430
      absent= x.absent && y.absent;
431
    }
432

Pietro Abate's avatar
Pietro Abate committed
433
let diff x y =
434
  if x == y then empty else
435
    {
436 437 438 439 440 441 442
      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;
443
      abstract = BoolAbstracts.diff x.abstract y.abstract;
444
      absent= x.absent && not y.absent;
445
    }
Pietro Abate's avatar
Pietro Abate committed
446

447 448
(* TODO: optimize disjoint check for boolean combinations *)
let trivially_disjoint a b =
449 450 451
  (BoolChars.trivially_disjoint a.chars b.chars) &&
  (BoolIntervals.trivially_disjoint a.ints b.ints) &&
  (BoolAtoms.trivially_disjoint a.atoms b.atoms) &&
452 453 454
  (BoolPair.trivially_disjoint a.times b.times) &&
  (BoolPair.trivially_disjoint a.xml b.xml) &&
  (BoolPair.trivially_disjoint a.arrow b.arrow) &&
455
  (BoolRec.trivially_disjoint a.record b.record) &&
456
  (BoolAbstracts.trivially_disjoint a.abstract b.abstract) &&
457
  (not (a.absent && b.absent))
458

459
let rec constant = function
460 461 462
  | Integer i -> interval (Intervals.atom i)
  | Atom a -> atom (Atoms.atom a)
  | Char c -> char (Chars.atom c)
463
  | Pair (x,y) -> times (const_node x) (const_node y)
464
  | Xml (x,y) -> xml (const_node x) (const_node y)
465
  | Record x -> record_fields (false ,LabelMap.map const_node x)
466 467
  | String (i,j,s,c) ->
      if U.equal_index i j then constant c
Pietro Abate's avatar
Pietro Abate committed
468
      else
469 470 471
	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)
472

473 474
let neg x = diff any x

475
let any_node = cons any
476
let empty_node = cons empty
477

478
module LabelS = Set.Make(Label)
479

Pietro Abate's avatar
Pietro Abate committed
480
let any_or_absent = { any with absent = true }
481
let only_absent = { empty with absent = true }
482

483
let get_record r =
Pietro Abate's avatar
Pietro Abate committed
484 485
  let labs accu (_,r) =
    List.fold_left
486
      (fun accu (l,_) -> LabelS.add l accu) accu (LabelMap.get r) in
487
  let extend descrs labs (o,r) =
488 489 490 491 492
    let rec aux i labs r =
      match labs with
	| [] -> ()
	| l1::labs ->
	    match r with
Pietro Abate's avatar
Pietro Abate committed
493
	      | (l2,x)::r when l1 == l2 ->
494 495 496
		  descrs.(i) <- cap descrs.(i) (descr x);
		  aux (i+1) labs r
	      | r ->
Pietro Abate's avatar
Pietro Abate committed
497
		  if not o then
498
		    descrs.(i) <- cap descrs.(i) only_absent; (* TODO:OPT *)
499 500
		  aux (i+1) labs r
    in
501
    aux 0 labs (LabelMap.get r);
502 503 504
    o
  in
  let line (p,n) =
Pietro Abate's avatar
Pietro Abate committed
505
    let labels =
506 507
      List.fold_left labs (List.fold_left labs LabelS.empty p) n in
    let labels = LabelS.elements labels in
508
    let nlab = List.length labels in
509
    let mk () = Array.create nlab any_or_absent in
510 511

    let pos = mk () in
Pietro Abate's avatar
Pietro Abate committed
512 513
    let opos = List.fold_left
		 (fun accu x ->
514 515 516 517 518 519 520 521 522 523 524
		    (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
525
  List.map line (Rec.get r)
526

527 528 529 530 531
(* 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)
532
let cap_product any_left any_right l =
Pietro Abate's avatar
Pietro Abate committed
533
  List.fold_left
534
    (fun (d1,d2) (t1,t2) -> (cap_t d1 t1, cap_t d2 t2))
535
    (any_left,any_right)
536
    l
537
let any_pair = { empty with times = any.times }
538

539 540 541
let rec exists max f =
  (max > 0) && (f (max - 1) || exists (max - 1) f)

542
exception NotEmpty
543

544 545 546 547 548 549 550 551 552
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
553
    | WAbstract of Abstracts.elem option
554 555 556 557 558 559 560

    | 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
561
  and witness_slot =
562 563 564 565 566 567 568 569 570 571 572 573 574 575 576
      { 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
577
	| WAbstract (Some t) -> 7 + 17 * Abstracts.T.hash t
Pietro Abate's avatar
Pietro Abate committed
578
	| WPair (_,_,s)
579 580 581 582 583 584
	| 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
585
	| WRecord (r,o,_) ->
586 587 588
	    (if o then 2 else 3) + 257 * LabelMap.hash hash_small r
	| WFun (f,_) ->
	    4 + 257 *
Pietro Abate's avatar
Pietro Abate committed
589 590
	      (Hashtbl.hash
		 (List.map
591
		    (function (x,None) -> 17 * hash_small x
Pietro Abate's avatar
Pietro Abate committed
592
		       | (x,Some y) ->
593 594 595 596 597 598 599 600 601 602 603 604 605 606 607
			   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
608
	| WAbstract (Some t1), WAbstract (Some t2) -> Abstracts.T.equal t1 t2
609 610 611
	| _ -> w1 == w2

      let equal w1 w2 = match w1,w2 with
Pietro Abate's avatar
Pietro Abate committed
612 613
	| WPair (p1,q1,_), WPair (p2,q2,_)
	| WXml (p1,q1,_), WXml (p2,q2,_) ->
614 615 616 617 618 619 620 621
	    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
622
					   | Some y1, Some y2 ->
623 624 625 626 627 628 629 630 631
					       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
632
  let wslot () = { wuid = !wuid; wnodes_in = NodeSet.empty;
633 634
		   wnodes_out = NodeSet.empty }

635 636 637 638
  let () =
    Stats.register Stats.Summary
      (fun ppf -> Format.fprintf ppf "Allocated witnesses:%i@\n" !wuid)

639
  let rec pp ppf = function
640 641 642 643 644 645 646 647 648 649
    | 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
650
    | WPair (w1,w2,_) ->
651
	Format.fprintf ppf "(%a,%a)" pp w1 pp w2
Pietro Abate's avatar
Pietro Abate committed
652
    | WXml (w1,w2,_) ->
653
	Format.fprintf ppf "XML(%a,%a)" pp w1 pp w2
654 655 656
    | WRecord (ws,o,_) ->
	Format.fprintf ppf "{";
	LabelMap.iteri
Pietro Abate's avatar
Pietro Abate committed
657
	  (fun l w -> Format.fprintf ppf " %a=%a"
658
	     Label.print_attr l pp w)
659 660 661 662 663 664
	  ws;
	if o then Format.fprintf ppf " ..";
	Format.fprintf ppf " }"
    | WFun (f,_) ->
	Format.fprintf ppf "FUN{";
	List.iter (fun (x,y) ->
665
		     Format.fprintf ppf " %a->" pp x;
666 667
		     match y with
		       | None -> Format.fprintf ppf "#"
668
		       | Some y -> pp ppf y) f;
669 670 671 672 673 674 675
	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
676

677 678
  let printf = pp Format.std_formatter

679 680
  let wmk w =  (* incr wuid; w *)  (* hash-consing disabled *)
    try WHash.find wmemo w
Pietro Abate's avatar
Pietro Abate committed
681 682
    with Not_found ->
      incr wuid;
683
      WHash.add wmemo w w;
Pietro Abate's avatar
Pietro Abate committed
684
(*      Format.fprintf Format.std_formatter "W:%a@."
685
	pp w; *)
686 687 688 689 690 691 692
      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()))

693
  let bool_pair f =
Pietro Abate's avatar
Pietro Abate committed
694 695 696
    Pair.compute
      ~empty:false ~full:true
      ~cup:(||) ~cap:(&&) ~diff:(fun x y -> x && not y)
697 698 699
      ~atom:f

  let bool_rec f =
Pietro Abate's avatar
Pietro Abate committed
700 701 702
    Rec.compute
      ~empty:false ~full:true
      ~cup:(||) ~cap:(&&) ~diff:(fun x y -> x && not y)
703 704
      ~atom:f

705
  let rec node_has n = function
706 707 708 709 710 711 712 713 714
    | 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

715 716
  (* type_has checks if a witness is contained in the union of
   * the leafs of a bdd, ignoring all variables. *)
717
  and type_has t = function
718 719 720
    | 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
721 722 723
    | WPair (w1,w2,_) ->
	bool_pair
	  (fun (n1,n2) -> node_has n1 w1 && node_has n2 w2)
724
	  (BoolPair.leafconj t.times)
725
    | WXml (w1,w2,_) ->
Pietro Abate's avatar
Pietro Abate committed
726
	bool_pair
727
	  (fun (n1,n2) -> node_has n1 w1 && node_has n2 w2)
728
	  (BoolPair.leafconj t.xml)
729
    | WFun (f,_) ->
Pietro Abate's avatar
Pietro Abate committed
730
	bool_pair
731 732 733 734 735 736
	  (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
737
	       f)
738
	  (BoolPair.leafconj t.arrow)
739
    | WRecord (f,o,_) ->
Pietro Abate's avatar
Pietro Abate committed
740
	bool_rec
741 742 743
	  (fun (o',f') ->
	     ((not o) || o') && (
	       let checked = ref 0 in
Pietro Abate's avatar
Pietro Abate committed
744 745
	       try
		 LabelMap.iteri
746
		   (fun l n ->
Pietro Abate's avatar
Pietro Abate committed
747
		      let w =
748 749 750
			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
751
		   ) f';
752 753 754 755 756
		 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))
757
	  (BoolRec.leafconj t.record)
758
    | WAbsent -> t.absent
759
    | WAbstract a -> Abstracts.contains_sample a (BoolAbstracts.leafconj t.abstract)
760 761
end

Pietro Abate's avatar
Pietro Abate committed
762
type slot = { mutable status : status;