types.ml 99.4 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
module Abstract =
struct
107
  module T = Custom.String
108 109 110 111 112 113 114 115 116 117
  type abs = T.t

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

  include SortedList.FiniteCofinite(T)

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

125 126 127 128
  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
129

130 131
end

132 133
type pair_kind = [ `Normal | `XML ]

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

141 142 143

module TLV = struct

Pietro Abate's avatar
Pietro Abate committed
144 145 146 147 148 149 150 151 152 153 154 155 156
  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
157 158
        |(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
159 160 161 162 163
      in
      let rec aux ppf = function
        |[] -> ()
        |[h] -> aux1 ppf h
        |h::l -> Format.fprintf ppf "%a %s %a" aux1 h sep aux l
164
      in
Pietro Abate's avatar
Pietro Abate committed
165 166
      aux ppf (elements s)
  end
167

Pietro Abate's avatar
Pietro Abate committed
168 169 170 171
  (* tlv : top level variables
   * fv : all free variables in the subtree
   * varonly : true if the type contains only variables *)
  type t =  { tlv : Set.t ; fv : Var.Set.t ; varonly : bool }
172

Pietro Abate's avatar
Pietro Abate committed
173 174
  let empty = { tlv = Set.empty ; fv = Var.Set.empty ; varonly = false }
  let any = { tlv = Set.empty ; fv = Var.Set.empty ; varonly = false }
175

Pietro Abate's avatar
Pietro Abate committed
176
  let singleton (v,p) = { tlv = Set.singleton (v,p); fv = Var.Set.singleton v; varonly = true }
177 178

  (* return the max of top level variables *)
Pietro Abate's avatar
Pietro Abate committed
179
  let max x = Set.max_elt x.tlv
180 181

  let pair x y = {
Pietro Abate's avatar
Pietro Abate committed
182 183 184
    varonly = false ;
    tlv = Set.empty ;
    fv = Var.Set.union x.fv y.fv
185 186 187
  }

  (* true if it contains only one variable *)
Pietro Abate's avatar
Pietro Abate committed
188
  let is_single x = x.varonly && (Var.Set.cardinal x.fv = 1) && (Set.cardinal x.tlv = 1)
Pietro Abate's avatar
Pietro Abate committed
189

Pietro Abate's avatar
Pietro Abate committed
190
  let no_variables x = (x.varonly == false) && (Var.Set.cardinal x.fv = 0) && (Set.cardinal x.tlv = 0)
191

Pietro Abate's avatar
Pietro Abate committed
192
  let has_toplevel x = Set.cardinal x.tlv > 0
Pietro Abate's avatar
Pietro Abate committed
193

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

200
end
201

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

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

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

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

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

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

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

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

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

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

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

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

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

376 377 378
type descr = Descr.t
type node = Node.t
include Descr
379

380 381
let forward_print = ref (fun _ _ -> assert false)

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

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

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

393 394 395 396
let descr n = n.Node.descr
let internalize n = n
let id n = n.Node.id

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

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

let non_constructed_or_absent =
418
  { non_constructed with absent = true }
419

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

(* XXX toplevel variables are not properly set for records *)
Pietro Abate's avatar
Pietro Abate committed
432 433
let record label t =
  { empty with
434
      record = BoolRec.atom (`Atm (Rec.atom (true,LabelMap.singleton label t))) }
435
let record_fields x =
436
  { empty with record = BoolRec.atom (`Atm (Rec.atom x)) }
437

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

(* Atm = Any ^ a *)
441 442
let var a =  {
  times = BoolPair.vars a;
Pietro Abate's avatar
Pietro Abate committed
443 444 445
  xml   = BoolPair.vars a;
  arrow = BoolPair.vars a;
  record= BoolRec.vars a;
446 447 448
  ints  = BoolIntervals.vars a;
  atoms = BoolAtoms.vars a;
  chars = BoolChars.vars a;
449
  abstract = Abstract.empty;
450
  absent= false;
451
  toplvars = TLV.singleton (a,true)
452 453
}

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

Pietro Abate's avatar
Pietro Abate committed
458
let all_vars t = t.toplvars.TLV.fv
Pietro Abate's avatar
Pietro Abate committed
459
let all_tlv t = t.toplvars.TLV.tlv
460

461 462
(* 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
463 464 465 466
let update_tlv x y t =
  let open TLV in
  let tlv t =
    let aux get bdd : Set.t =
467
      let l =
Pietro Abate's avatar
Pietro Abate committed
468
        List.fold_left (fun acc (p,n) ->
469
          let acc1 =
Pietro Abate's avatar
Pietro Abate committed
470 471 472 473 474
            List.fold_left (fun acc -> function
              |(`Var v) as x -> Set.union acc (Set.singleton (x,true))
              |_ -> acc
            ) Set.empty p
          in
475
          let acc2 =
Pietro Abate's avatar
Pietro Abate committed
476 477 478 479 480 481 482 483 484 485 486 487 488
            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
489
    (aux BoolChars.get t.chars)
490 491 492 493 494 495 496
    [
      (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
497
  in
Pietro Abate's avatar
Pietro Abate committed
498 499 500 501 502 503
  { t with toplvars = 
    { 
      tlv = tlv t ; 
      fv = Var.Set.union x.toplvars.fv y.toplvars.fv ;
      varonly = x.toplvars.varonly && x.toplvars.varonly 
  } }
Pietro Abate's avatar
Pietro Abate committed
504 505
;;

506 507
let char c = { empty with chars = BoolChars.atom (`Atm c) }
let interval i = { empty with ints = BoolIntervals.atom (`Atm i) }
508
let abstract a = { empty with abstract = a }
509 510

let get_abstract t = t.abstract
511

Pietro Abate's avatar
Pietro Abate committed
512
let cup x y =
Pietro Abate's avatar
Pietro Abate committed
513
  if x == y then x else update_tlv x y {
514 515 516
    times = BoolPair.cup x.times y.times;
    xml   = BoolPair.cup x.xml y.xml;
    arrow = BoolPair.cup x.arrow y.arrow;
517
    record= BoolRec.cup x.record y.record;
518 519 520
    ints  = BoolIntervals.cup x.ints  y.ints;
    atoms = BoolAtoms.cup x.atoms y.atoms;
    chars = BoolChars.cup x.chars y.chars;
521
    abstract = Abstract.cup x.abstract y.abstract;
522
    absent= x.absent || y.absent;
Pietro Abate's avatar
Pietro Abate committed
523
    toplvars = TLV.empty
524
  }
525

Pietro Abate's avatar
Pietro Abate committed
526
let cap x y =
Pietro Abate's avatar
Pietro Abate committed
527
  if x == y then x else update_tlv x y {
528
    ints  = BoolIntervals.cap x.ints y.ints;
529 530
    times = BoolPair.cap x.times y.times;
    xml   = BoolPair.cap x.xml y.xml;
531
    record= BoolRec.cap x.record y.record;
532
    arrow = BoolPair.cap x.arrow y.arrow;
533 534
    atoms = BoolAtoms.cap x.atoms y.atoms;
    chars = BoolChars.cap x.chars y.chars;
535
    abstract = Abstract.cap x.abstract y.abstract;
536
    absent= x.absent && y.absent;
Pietro Abate's avatar
Pietro Abate committed
537
    toplvars = TLV.empty
538
  }
539

Pietro Abate's avatar
Pietro Abate committed
540
let diff x y =
Pietro Abate's avatar
Pietro Abate committed
541
  if x == y then empty else update_tlv x y {
542 543 544
    times = BoolPair.diff x.times y.times;
    xml   = BoolPair.diff x.xml y.xml;
    arrow = BoolPair.diff x.arrow y.arrow;
545
    record= BoolRec.diff x.record y.record;
546
    ints  = BoolIntervals.diff x.ints y.ints;
547 548
    atoms = BoolAtoms.diff x.atoms y.atoms;
    chars = BoolChars.diff x.chars y.chars;
549
    abstract = Abstract.diff x.abstract y.abstract;
550
    absent= x.absent && not y.absent;
Pietro Abate's avatar
Pietro Abate committed
551
    toplvars = TLV.empty
552
  }
Pietro Abate's avatar
Pietro Abate committed
553

554 555
(* TODO: optimize disjoint check for boolean combinations *)
let trivially_disjoint a b =
556 557 558
  (BoolChars.trivially_disjoint a.chars b.chars) &&
  (BoolIntervals.trivially_disjoint a.ints b.ints) &&
  (BoolAtoms.trivially_disjoint a.atoms b.atoms) &&
559 560 561
  (BoolPair.trivially_disjoint a.times b.times) &&
  (BoolPair.trivially_disjoint a.xml b.xml) &&
  (BoolPair.trivially_disjoint a.arrow b.arrow) &&
562
  (BoolRec.trivially_disjoint a.record b.record) &&
563
  (Abstract.disjoint a.abstract b.abstract) &&
564
  (not (a.absent && b.absent))
565

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

580 581
let neg x = diff any x

582
let any_node = cons any
583
let empty_node = cons empty
584

585
module LabelS = Set.Make(Label)
586

Pietro Abate's avatar
Pietro Abate committed
587
let any_or_absent = { any with absent = true }
588
let only_absent = { empty with absent = true }
589

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

    let pos = mk () in
Pietro Abate's avatar
Pietro Abate committed
619 620
    let opos = List.fold_left
		 (fun accu x ->
621 622 623 624 625 626 627 628 629 630 631
		    (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
632
  List.map line (Rec.get r)
633

634 635 636 637 638
(* 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)
639
let cap_product any_left any_right l =
Pietro Abate's avatar
Pietro Abate committed
640
  List.fold_left
641
    (fun (d1,d2) (t1,t2) -> (cap_t d1 t1, cap_t d2 t2))
642
    (any_left,any_right)
643
    l
644
let any_pair = { empty with times = any.times }
645

646 647 648
let rec exists max f =
  (max > 0) && (f (max - 1) || exists (max - 1) f)

649
exception NotEmpty
650

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

742 743 744 745
  let () =
    Stats.register Stats.Summary
      (fun ppf -> Format.fprintf ppf "Allocated witnesses:%i@\n" !wuid)

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