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

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

166 167 168
  (* s : top level variables
   * f : all free variables in the subtree
   * b : true if the type contains only variables *)
169
  type t =  { s : Set.t ; f : Var.Set.t ; b : bool }
170

Pietro Abate's avatar
Pietro Abate committed
171
  let empty = { s = Set.empty ; f = Var.Set.empty ; b = false }
172 173 174
  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 }
175 176 177 178 179

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

  let pair x y = {
180 181 182
    b = false ;
    s = Set.empty ;
    f = Var.Set.union x.f y.f
183 184 185
  }

  (* true if it contains only one variable *)
186
  let is_single x = x.b && (Var.Set.cardinal x.f = 1) && (Set.cardinal x.s = 1)
Pietro Abate's avatar
Pietro Abate committed
187

Pietro Abate's avatar
Pietro Abate committed
188
  let no_variables x = (x.b == false) && (Var.Set.cardinal x.f = 0) && (Set.cardinal x.s = 0)
189

Pietro Abate's avatar
Pietro Abate committed
190
  let has_toplevel x = Set.cardinal x.s > 0
Pietro Abate's avatar
Pietro Abate committed
191

Pietro Abate's avatar
Pietro Abate committed
192 193
  let print ppf x = if x.b then Set.print ";" ppf x.s
  let dump ppf x =
Pietro Abate's avatar
WIP  
Pietro Abate committed
194 195
    Format.fprintf ppf "<b = %b ; f = {%a} ; s = {%a}>" 
      x.b Var.Set.print x.f (Set.print ";") x.s
Pietro Abate's avatar
Pietro Abate committed
196 197
  let mem v x = Set.mem v x.s

198
end
199

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

254 255 256 257
  let print_lst ppf =
    List.iter (fun f -> f ppf; Format.fprintf ppf " |")

  let dump ppf d =
Pietro Abate's avatar
Pietro Abate committed
258
    Format.fprintf ppf "<types atoms(%a) ints(%a) chars(%a) times(%a) arrow(%a) record(%a) xml(%a) abstract(%a) absent(%b)>\n%a"
259
      BoolAtoms.dump d.atoms
260 261
      BoolIntervals.dump d.ints
      BoolChars.dump d.chars
262
      BoolPair.dump d.times
263
      BoolPair.dump d.arrow
264 265
      BoolRec.dump d.record
      BoolPair.dump d.xml
266 267
      Abstract.dump d.abstract
      d.absent
Pietro Abate's avatar
Pietro Abate committed
268
      TLV.dump d.toplvars
269

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

283 284 285 286 287 288 289 290 291 292 293
  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;
    ()

294
  let equal a b =
295
    (a == b) || (
296 297 298
      (BoolAtoms.equal a.atoms b.atoms) &&
      (BoolChars.equal a.chars b.chars) &&
      (BoolIntervals.equal a.ints  b.ints) &&
299 300 301 302
      (BoolPair.equal a.times b.times) &&
      (BoolPair.equal a.xml b.xml) &&
      (BoolPair.equal a.arrow b.arrow) &&
      (BoolRec.equal a.record b.record) &&
303
      (Abstract.equal a.abstract b.abstract) &&
304 305
      (a.absent == b.absent)
    )
306 307

  let compare a b =
Pietro Abate's avatar
Pietro Abate committed
308
    if a == b then 0
309 310 311
    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
312 313 314 315
    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
316
    else let c = Abstract.compare a.abstract b.abstract in if c <> 0 then c
317 318 319
    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
320

321
  let hash a =
322 323 324
    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
325 326 327 328 329 330 331
    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
332

333 334 335
end
and Node :
sig
336
  type t = { id : int; cu: Compunit.t; mutable descr : Descr.t }
337 338 339 340 341
  val dump: Format.formatter -> t -> unit
  val check: t -> unit
  val equal: t -> t -> bool
  val hash: t -> int
  val compare:t -> t -> int
342
  val mk: int -> Descr.t -> t
343
end =
344

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

356 357
and Pair : Bool.S with type elem = (Node.t * Node.t) =
  Bool.Make(Custom.Pair(Node)(Node))
Pietro Abate's avatar
Pietro Abate committed
358
and BoolPair : BoolVar.S with
359
  type s = Pair.t = BoolVar.Make(Pair)
360

361 362 363 364 365
(* 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)))
366 367
and BoolRec : BoolVar.S with
  type s = Rec.t = BoolVar.Make(Rec)
368

369 370
module DescrHash = Hashtbl.Make(Descr)
module DescrMap = Map.Make(Descr)
371 372
module DescrSet = Set.Make(Descr)
module DescrSList = SortedList.Make(Descr)
373

374 375 376
type descr = Descr.t
type node = Node.t
include Descr
377

378 379
let forward_print = ref (fun _ _ -> assert false)

Pietro Abate's avatar
Pietro Abate committed
380 381
let make () =
  incr count;
382 383
  Node.mk !count empty

Pietro Abate's avatar
Pietro Abate committed
384
let define n d =
385 386
  n.Node.descr <- d

Pietro Abate's avatar
Pietro Abate committed
387 388
let cons d =
  incr count;
389 390
  Node.mk !count d

391 392 393 394
let descr n = n.Node.descr
let internalize n = n
let id n = n.Node.id

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

let non_constructed =
Pietro Abate's avatar
Pietro Abate committed
412
  { any with
413
      times = empty.times; xml = empty.xml; record = empty.record }
Pietro Abate's avatar
Pietro Abate committed
414 415

let non_constructed_or_absent =
416
  { non_constructed with absent = true }
417

Pietro Abate's avatar
Pietro Abate committed
418
(* Descr.t type constructors *)
419 420
let times x y = { empty with
                    times = BoolPair.atom (`Atm (Pair.atom (x,y)));
Pietro Abate's avatar
Pietro Abate committed
421
                    toplvars = TLV.pair (descr x).toplvars (descr y).toplvars }
422
let xml x y = { empty with
Pietro Abate's avatar
Pietro Abate committed
423 424
                    xml = BoolPair.atom (`Atm (Pair.atom (x,y)));
                    toplvars = TLV.pair (descr x).toplvars (descr y).toplvars }
425 426
let arrow x y = { empty with
                    arrow = BoolPair.atom (`Atm (Pair.atom (x,y)));
Pietro Abate's avatar
Pietro Abate committed
427
                    toplvars = TLV.pair (descr x).toplvars (descr y).toplvars }
428 429

(* XXX toplevel variables are not properly set for records *)
Pietro Abate's avatar
Pietro Abate committed
430 431
let record label t =
  { empty with
432
      record = BoolRec.atom (`Atm (Rec.atom (true,LabelMap.singleton label t))) }
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 = Abstract.empty;
448
  absent= false;
449
  toplvars = TLV.singleton (a,true)
450 451
}

452
let is_var t = TLV.is_single t.toplvars
453
let no_var t = TLV.no_variables t.toplvars
Pietro Abate's avatar
Pietro Abate committed
454 455
let has_tlv t = TLV.has_toplevel t.toplvars

456
let all_vars t = t.toplvars.TLV.f
457

458 459
(* XXX this function could be potentially costly. There should be
 * better way to take trace of top level variables in a type *)
Pietro Abate's avatar
Pietro Abate committed
460 461 462 463
let update_tlv x y t =
  let open TLV in
  let tlv t =
    let aux get bdd : Set.t =
464
      let l =
Pietro Abate's avatar
Pietro Abate committed
465
        List.fold_left (fun acc (p,n) ->
466
          let acc1 =
Pietro Abate's avatar
Pietro Abate committed
467 468 469 470 471
            List.fold_left (fun acc -> function
              |(`Var v) as x -> Set.union acc (Set.singleton (x,true))
              |_ -> acc
            ) Set.empty p
          in
472
          let acc2 =
Pietro Abate's avatar
Pietro Abate committed
473 474 475 476 477 478 479 480 481 482 483 484 485 486
            List.fold_left (fun acc -> function
              |(`Var v) as x -> Set.union acc (Set.singleton (x,false))
              |_ -> assert false
            ) acc1 n
          in acc2::acc
        ) [] (get bdd)
      in
      match l with
      |[] -> Set.empty
      |[h] -> h
      |h::l -> List.fold_left Set.inter h l
    in
    List.fold_left Set.inter
    (aux BoolChars.get t.chars) 
487 488 489 490 491 492 493
    [
      (aux BoolIntervals.get t.ints);
      (aux BoolAtoms.get t.atoms);
      (aux BoolPair.get t.arrow);
      (aux BoolPair.get t.xml);
      (aux BoolRec.get t.record)
    ]
Pietro Abate's avatar
Pietro Abate committed
494 495 496 497 498
  in
  let s = tlv t in
  { t with toplvars = { s = s ; f = Var.Set.union x.toplvars.f y.toplvars.f ; b = x.toplvars.b && x.toplvars.b } }
;;

499 500
let char c = { empty with chars = BoolChars.atom (`Atm c) }
let interval i = { empty with ints = BoolIntervals.atom (`Atm i) }
501
let abstract a = { empty with abstract = a }
502 503

let get_abstract t = t.abstract
504

Pietro Abate's avatar
Pietro Abate committed
505
let cup x y =
Pietro Abate's avatar
Pietro Abate committed
506
  if x == y then x else update_tlv x y {
507 508 509
    times = BoolPair.cup x.times y.times;
    xml   = BoolPair.cup x.xml y.xml;
    arrow = BoolPair.cup x.arrow y.arrow;
510
    record= BoolRec.cup x.record y.record;
511 512 513
    ints  = BoolIntervals.cup x.ints  y.ints;
    atoms = BoolAtoms.cup x.atoms y.atoms;
    chars = BoolChars.cup x.chars y.chars;
514
    abstract = Abstract.cup x.abstract y.abstract;
515
    absent= x.absent || y.absent;
Pietro Abate's avatar
Pietro Abate committed
516
    toplvars = TLV.empty
517
  }
518

Pietro Abate's avatar
Pietro Abate committed
519
let cap x y =
Pietro Abate's avatar
Pietro Abate committed
520
  if x == y then x else update_tlv x y {
521
    ints  = BoolIntervals.cap x.ints y.ints;
522 523
    times = BoolPair.cap x.times y.times;
    xml   = BoolPair.cap x.xml y.xml;
524
    record= BoolRec.cap x.record y.record;
525
    arrow = BoolPair.cap x.arrow y.arrow;
526 527
    atoms = BoolAtoms.cap x.atoms y.atoms;
    chars = BoolChars.cap x.chars y.chars;
528
    abstract = Abstract.cap x.abstract y.abstract;
529
    absent= x.absent && y.absent;
Pietro Abate's avatar
Pietro Abate committed
530
    toplvars = TLV.empty
531
  }
532

Pietro Abate's avatar
Pietro Abate committed
533
let diff x y =
Pietro Abate's avatar
Pietro Abate committed
534
  if x == y then empty else update_tlv x y {
535 536 537
    times = BoolPair.diff x.times y.times;
    xml   = BoolPair.diff x.xml y.xml;
    arrow = BoolPair.diff x.arrow y.arrow;
538
    record= BoolRec.diff x.record y.record;
539
    ints  = BoolIntervals.diff x.ints y.ints;
540 541
    atoms = BoolAtoms.diff x.atoms y.atoms;
    chars = BoolChars.diff x.chars y.chars;
542
    abstract = Abstract.diff x.abstract y.abstract;
543
    absent= x.absent && not y.absent;
Pietro Abate's avatar
Pietro Abate committed
544
    toplvars = TLV.empty
545
  }
Pietro Abate's avatar
Pietro Abate committed
546

547 548
(* TODO: optimize disjoint check for boolean combinations *)
let trivially_disjoint a b =
549 550 551
  (BoolChars.trivially_disjoint a.chars b.chars) &&
  (BoolIntervals.trivially_disjoint a.ints b.ints) &&
  (BoolAtoms.trivially_disjoint a.atoms b.atoms) &&
552 553 554
  (BoolPair.trivially_disjoint a.times b.times) &&
  (BoolPair.trivially_disjoint a.xml b.xml) &&
  (BoolPair.trivially_disjoint a.arrow b.arrow) &&
555
  (BoolRec.trivially_disjoint a.record b.record) &&
556
  (Abstract.disjoint a.abstract b.abstract) &&
557
  (not (a.absent && b.absent))
558

559
let rec constant = function
560 561 562
  | Integer i -> interval (Intervals.atom i)
  | Atom a -> atom (Atoms.atom a)
  | Char c -> char (Chars.atom c)
563
  | Pair (x,y) -> times (const_node x) (const_node y)
564
  | Xml (x,y) -> xml (const_node x) (const_node y)
565
  | Record x -> record_fields (false ,LabelMap.map const_node x)
566 567
  | String (i,j,s,c) ->
      if U.equal_index i j then constant c
Pietro Abate's avatar
Pietro Abate committed
568
      else
569 570 571
	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)
572

573 574
let neg x = diff any x

575
let any_node = cons any
576
let empty_node = cons empty
577

578
module LabelS = Set.Make(Label)
579

Pietro Abate's avatar
Pietro Abate committed
580
let any_or_absent = { any with absent = true }
581
let only_absent = { empty with absent = true }
582

583
let get_record r =
Pietro Abate's avatar
Pietro Abate committed
584 585
  let labs accu (_,r) =
    List.fold_left
586
      (fun accu (l,_) -> LabelS.add l accu) accu (LabelMap.get r) in
587
  let extend descrs labs (o,r) =
588 589 590 591 592
    let rec aux i labs r =
      match labs with
	| [] -> ()
	| l1::labs ->
	    match r with
Pietro Abate's avatar
Pietro Abate committed
593
	      | (l2,x)::r when l1 == l2 ->
594 595 596
		  descrs.(i) <- cap descrs.(i) (descr x);
		  aux (i+1) labs r
	      | r ->
Pietro Abate's avatar
Pietro Abate committed
597
		  if not o then
598
		    descrs.(i) <- cap descrs.(i) only_absent; (* TODO:OPT *)
599 600
		  aux (i+1) labs r
    in
601
    aux 0 labs (LabelMap.get r);
602 603 604
    o
  in
  let line (p,n) =
Pietro Abate's avatar
Pietro Abate committed
605
    let labels =
606 607
      List.fold_left labs (List.fold_left labs LabelS.empty p) n in
    let labels = LabelS.elements labels in
608
    let nlab = List.length labels in
609
    let mk () = Array.create nlab any_or_absent in
610 611

    let pos = mk () in
Pietro Abate's avatar
Pietro Abate committed
612 613
    let opos = List.fold_left
		 (fun accu x ->
614 615 616 617 618 619 620 621 622 623 624
		    (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
625
  List.map line (Rec.get r)
626

627 628 629 630 631
(* 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)
632
let cap_product any_left any_right l =
Pietro Abate's avatar
Pietro Abate committed
633
  List.fold_left
634
    (fun (d1,d2) (t1,t2) -> (cap_t d1 t1, cap_t d2 t2))
635
    (any_left,any_right)
636
    l
637
let any_pair = { empty with times = any.times }
638

639 640 641
let rec exists max f =
  (max > 0) && (f (max - 1) || exists (max - 1) f)

642
exception NotEmpty
643

644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660
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
661
  and witness_slot =
662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677
      { 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
678
	| WPair (_,_,s)
679 680 681 682 683 684
	| 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
685
	| WRecord (r,o,_) ->
686 687 688
	    (if o then 2 else 3) + 257 * LabelMap.hash hash_small r
	| WFun (f,_) ->
	    4 + 257 *
Pietro Abate's avatar
Pietro Abate committed
689 690
	      (Hashtbl.hash
		 (List.map
691
		    (function (x,None) -> 17 * hash_small x
Pietro Abate's avatar
Pietro Abate committed
692
		       | (x,Some y) ->
693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711
			   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
712 713
	| WPair (p1,q1,_), WPair (p2,q2,_)
	| WXml (p1,q1,_), WXml (p2,q2,_) ->
714 715 716 717 718 719 720 721
	    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
722
					   | Some y1, Some y2 ->
723 724 725 726 727 728 729 730 731
					       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
732
  let wslot () = { wuid = !wuid; wnodes_in = NodeSet.empty;
733 734
		   wnodes_out = NodeSet.empty }

735 736 737 738
  let () =
    Stats.register Stats.Summary
      (fun ppf -> Format.fprintf ppf "Allocated witnesses:%i@\n" !wuid)

739 740 741 742 743 744 745 746 747 748 749
  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
750
    | WPair (w1,w2,_) ->
751
	Format.fprintf ppf "(%a,%a)" print_witness w1 print_witness w2
Pietro Abate's avatar
Pietro Abate committed
752
    | WXml (w1,w2,_) ->
753 754 755 756
	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
757
	  (fun l w -> Format.fprintf ppf " %a=%a"
758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775
	     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
776

777 778
  let wmk w =  (* incr wuid; w *)  (* hash-consing disabled *)
    try WHash.find wmemo w
Pietro Abate's avatar
Pietro Abate committed
779 780
    with Not_found ->
      incr wuid;
781
      WHash.add wmemo w w;
Pietro Abate's avatar
Pietro Abate committed
782
(*      Format.fprintf Format.std_formatter "W:%a@."
783 784 785 786 787 788 789 790