1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464
|
(**************************************************************************)
(* *)
(* OCaml *)
(* *)
(* Pierre Chambart, OCamlPro *)
(* Mark Shinwell and Leo White, Jane Street Europe *)
(* *)
(* Copyright 2013--2016 OCamlPro SAS *)
(* Copyright 2014--2016 Jane Street Group LLC *)
(* *)
(* All rights reserved. This file is distributed under the terms of *)
(* the GNU Lesser General Public License version 2.1, with the *)
(* special exception on linking described in the file LICENSE. *)
(* *)
(**************************************************************************)
[@@@ocaml.warning "+a-4-9-30-40-41-42-66"]
open! Int_replace_polymorphic_compare
type tbl = {
sb_var : Variable.t Variable.Map.t;
sb_mutable_var : Mutable_variable.t Mutable_variable.Map.t;
sb_exn : Static_exception.t Static_exception.Map.t;
(* Used to handle substitution sequences: we cannot call the substitution
recursively because there can be name clashes. *)
back_var : Variable.t list Variable.Map.t;
back_mutable_var : Mutable_variable.t list Mutable_variable.Map.t;
}
type t =
| Inactive
| Active of tbl
type subst = t
let empty_tbl = {
sb_var = Variable.Map.empty;
sb_mutable_var = Mutable_variable.Map.empty;
sb_exn = Static_exception.Map.empty;
back_var = Variable.Map.empty;
back_mutable_var = Mutable_variable.Map.empty;
}
let print ppf = function
| Inactive -> Format.fprintf ppf "Inactive"
| Active tbl ->
Format.fprintf ppf "Active:@ ";
Variable.Map.iter (fun var1 var2 ->
Format.fprintf ppf "%a -> %a@ "
Variable.print var1
Variable.print var2)
tbl.sb_var;
Mutable_variable.Map.iter (fun mut_var1 mut_var2 ->
Format.fprintf ppf "(mutable) %a -> %a@ "
Mutable_variable.print mut_var1
Mutable_variable.print mut_var2)
tbl.sb_mutable_var;
Variable.Map.iter (fun var vars ->
Format.fprintf ppf "%a -> %a@ "
Variable.print var
Variable.Set.print (Variable.Set.of_list vars))
tbl.back_var;
Mutable_variable.Map.iter (fun mut_var mut_vars ->
Format.fprintf ppf "(mutable) %a -> %a@ "
Mutable_variable.print mut_var
Mutable_variable.Set.print (Mutable_variable.Set.of_list mut_vars))
tbl.back_mutable_var
let empty = Inactive
let is_empty = function
| Inactive -> true
| Active _ -> false
let empty_preserving_activation_state = function
| Inactive -> Inactive
| Active _ -> Active empty_tbl
let activate = function
| Inactive -> Active empty_tbl
| Active _ as t -> t
let rec add_sb_var sb id id' =
let sb = { sb with sb_var = Variable.Map.add id id' sb.sb_var } in
let sb =
try let pre_vars = Variable.Map.find id sb.back_var in
List.fold_left (fun sb pre_id -> add_sb_var sb pre_id id') sb pre_vars
with Not_found -> sb in
let back_var =
let l = try Variable.Map.find id' sb.back_var with Not_found -> [] in
Variable.Map.add id' (id :: l) sb.back_var in
{ sb with back_var }
let rec add_sb_mutable_var sb id id' =
let sb =
{ sb with
sb_mutable_var = Mutable_variable.Map.add id id' sb.sb_mutable_var;
}
in
let sb =
try
let pre_vars = Mutable_variable.Map.find id sb.back_mutable_var in
List.fold_left (fun sb pre_id -> add_sb_mutable_var sb pre_id id')
sb pre_vars
with Not_found -> sb in
let back_mutable_var =
let l =
try Mutable_variable.Map.find id' sb.back_mutable_var
with Not_found -> []
in
Mutable_variable.Map.add id' (id :: l) sb.back_mutable_var
in
{ sb with back_mutable_var }
let apply_static_exception t i =
match t with
| Inactive ->
i
| Active t ->
try Static_exception.Map.find i t.sb_exn
with Not_found -> i
let add_static_exception t i =
match t with
| Inactive -> i, t
| Active t ->
let i' = Static_exception.create () in
let sb_exn =
Static_exception.Map.add i i' t.sb_exn
in
i', Active { t with sb_exn; }
let active_add_variable t id =
let id' = Variable.rename id in
let t = add_sb_var t id id' in
id', t
let active_add_parameter t param =
let param' = Parameter.rename param in
let t = add_sb_var t (Parameter.var param) (Parameter.var param') in
param', t
let add_variable t id =
match t with
| Inactive -> id, t
| Active t ->
let id', t = active_add_variable t id in
id', Active t
let active_add_parameters' t (params:Parameter.t list) =
List.fold_right (fun param (params, t) ->
let param', t = active_add_parameter t param in
param' :: params, t)
params ([], t)
let add_variables t defs =
List.fold_right (fun (id, data) (defs, t) ->
let id', t = add_variable t id in
(id', data) :: defs, t) defs ([], t)
let add_variables3 t defs =
List.fold_right (fun (id, data1, data2) (defs, t) ->
let id', t = add_variable t id in
(id', data1, data2) :: defs, t) defs ([], t)
let add_variables' t ids =
List.fold_right (fun id (ids, t) ->
let id', t = add_variable t id in
id' :: ids, t) ids ([], t)
let active_add_mutable_variable t id =
let id' = Mutable_variable.rename id in
let t = add_sb_mutable_var t id id' in
id', t
let add_mutable_variable t id =
match t with
| Inactive -> id, t
| Active t ->
let id', t = active_add_mutable_variable t id in
id', Active t
let active_find_var_exn t id =
try Variable.Map.find id t.sb_var with
| Not_found ->
Misc.fatal_error (Format.asprintf "find_var: can't find %a@."
Variable.print id)
let apply_variable t var =
match t with
| Inactive -> var
| Active t ->
try Variable.Map.find var t.sb_var with
| Not_found -> var
let apply_mutable_variable t mut_var =
match t with
| Inactive -> mut_var
| Active t ->
try Mutable_variable.Map.find mut_var t.sb_mutable_var with
| Not_found -> mut_var
let rewrite_recursive_calls_with_symbols t
(function_declarations : Flambda.function_declarations)
~make_closure_symbol =
match t with
| Inactive -> function_declarations
| Active _ ->
let all_free_symbols =
Variable.Map.fold
(fun _ (function_decl : Flambda.function_declaration)
syms ->
Symbol.Set.union syms function_decl.free_symbols)
function_declarations.funs Symbol.Set.empty
in
let closure_symbols_used = ref false in
let closure_symbols =
Variable.Map.fold (fun var _ map ->
let closure_id = Closure_id.wrap var in
let sym = make_closure_symbol closure_id in
if Symbol.Set.mem sym all_free_symbols then begin
closure_symbols_used := true;
Symbol.Map.add sym var map
end else begin
map
end)
function_declarations.funs Symbol.Map.empty
in
if not !closure_symbols_used then begin
(* Don't waste time rewriting the function declaration(s) if there
are no occurrences of any of the closure symbols. *)
function_declarations
end else begin
let funs =
Variable.Map.map (fun (ffun : Flambda.function_declaration) ->
let body =
Flambda_iterators.map_toplevel_named
(* CR-someday pchambart: This may be worth deep substituting
below the closures, but that means that we need to take care
of functions' free variables. *)
(function
| Symbol sym when Symbol.Map.mem sym closure_symbols ->
Expr (Var (Symbol.Map.find sym closure_symbols))
| e -> e)
ffun.body
in
Flambda.update_body_of_function_declaration ffun ~body)
function_declarations.funs
in
Flambda.update_function_declarations function_declarations ~funs
end
module Project_var = struct
type t =
{ vars_within_closure : Var_within_closure.t Var_within_closure.Map.t;
closure_id : Closure_id.t Closure_id.Map.t }
let empty =
{ vars_within_closure = Var_within_closure.Map.empty;
closure_id = Closure_id.Map.empty;
}
let print ppf t =
Format.fprintf ppf "{ vars_within_closure %a, closure_id %a }"
(Var_within_closure.Map.print Var_within_closure.print)
t.vars_within_closure
(Closure_id.Map.print Closure_id.print)
t.closure_id
let new_subst_fv t id subst =
match subst with
| Inactive -> id, subst, t
| Active subst ->
let id' = Variable.rename id in
let subst = add_sb_var subst id id' in
let off = Var_within_closure.wrap id in
let off' = Var_within_closure.wrap id' in
let off_sb = Var_within_closure.Map.add off off' t.vars_within_closure in
id', Active subst, { t with vars_within_closure = off_sb; }
let new_subst_fun t id subst =
let id' = Variable.rename id in
let subst = add_sb_var subst id id' in
let off = Closure_id.wrap id in
let off' = Closure_id.wrap id' in
let off_sb = Closure_id.Map.add off off' t.closure_id in
id', subst, { t with closure_id = off_sb; }
(** Returns :
* The map of new_identifiers -> expression
* The new environment with added substitution
* a fresh ffunction_subst with only the substitution of free variables
*)
let subst_free_vars fv subst ~only_freshen_parameters
: (Flambda.specialised_to * _) Variable.Map.t * _ * _ =
Variable.Map.fold (fun id lam (fv, subst, t) ->
let id, subst, t =
if only_freshen_parameters then
id, subst, t
else
new_subst_fv t id subst
in
Variable.Map.add id lam fv, subst, t)
fv
(Variable.Map.empty, subst, empty)
(** Returns :
* The function_declaration with renamed function identifiers
* The new environment with added substitution
* The ffunction_subst completed with function substitution
subst_free_vars must have been used to build off_sb
*)
let func_decls_subst t (subst : subst)
(func_decls : Flambda.function_declarations)
~only_freshen_parameters =
match subst with
| Inactive -> func_decls, subst, t
| Active subst ->
let subst_func_decl _fun_id (func_decl : Flambda.function_declaration)
subst =
let params, subst = active_add_parameters' subst func_decl.params in
(* Since all parameters are distinct, even between functions, we can
just use a single substitution. *)
let body =
Flambda_utils.toplevel_substitution subst.sb_var func_decl.body
in
let function_decl =
Flambda.create_function_declaration ~params ~body
~stub:func_decl.stub ~dbg:func_decl.dbg
~inline:func_decl.inline ~specialise:func_decl.specialise
~is_a_functor:func_decl.is_a_functor
~closure_origin:func_decl.closure_origin
~poll:func_decl.poll
in
function_decl, subst
in
let subst, t =
if only_freshen_parameters then
subst, t
else
Variable.Map.fold (fun orig_id _func_decl (subst, t) ->
let _id, subst, t = new_subst_fun t orig_id subst in
subst, t)
func_decls.funs
(subst, t)
in
let funs, subst =
Variable.Map.fold (fun orig_id func_decl (funs, subst) ->
let func_decl, subst = subst_func_decl orig_id func_decl subst in
let id =
if only_freshen_parameters then orig_id
else active_find_var_exn subst orig_id
in
let funs = Variable.Map.add id func_decl funs in
funs, subst)
func_decls.funs
(Variable.Map.empty, subst)
in
let function_decls =
Flambda.update_function_declarations func_decls ~funs
in
function_decls, Active subst, t
let apply_closure_id t closure_id =
try Closure_id.Map.find closure_id t.closure_id
with Not_found -> closure_id
let apply_var_within_closure t var_in_closure =
try Var_within_closure.Map.find var_in_closure t.vars_within_closure
with Not_found -> var_in_closure
module Compose (T : Identifiable.S) = struct
let compose ~earlier ~later =
if (T.Map.equal T.equal) earlier later
|| T.Map.cardinal later = 0
then
earlier
else
T.Map.mapi (fun src_var var ->
if T.Map.mem src_var later then begin
Misc.fatal_errorf "Freshening.Project_var.compose: domains \
of substitutions must be disjoint. earlier=%a later=%a"
(T.Map.print T.print) earlier
(T.Map.print T.print) later
end;
match T.Map.find var later with
| exception Not_found -> var
| var -> var)
earlier
end
module V = Compose (Var_within_closure)
module C = Compose (Closure_id)
let compose ~earlier ~later : t =
{ vars_within_closure =
V.compose ~earlier:earlier.vars_within_closure
~later:later.vars_within_closure;
closure_id =
C.compose ~earlier:earlier.closure_id
~later:later.closure_id;
}
end
let apply_function_decls_and_free_vars t fv func_decls
~only_freshen_parameters =
let module I = Project_var in
let fv, t, of_closures = I.subst_free_vars fv t ~only_freshen_parameters in
let func_decls, t, of_closures =
I.func_decls_subst of_closures t func_decls ~only_freshen_parameters
in
fv, func_decls, t, of_closures
let does_not_freshen t vars =
match t with
| Inactive -> true
| Active subst ->
not (List.exists (fun var -> Variable.Map.mem var subst.sb_var) vars)
let freshen_projection (projection : Projection.t) ~freshening
~closure_freshening : Projection.t =
match projection with
| Project_var { closure; closure_id; var; } ->
Project_var {
closure = apply_variable freshening closure;
closure_id = Project_var.apply_closure_id closure_freshening closure_id;
var = Project_var.apply_var_within_closure closure_freshening var;
}
| Project_closure { set_of_closures; closure_id; } ->
Project_closure {
set_of_closures = apply_variable freshening set_of_closures;
closure_id = Project_var.apply_closure_id closure_freshening closure_id;
}
| Move_within_set_of_closures { closure; start_from; move_to; } ->
Move_within_set_of_closures {
closure = apply_variable freshening closure;
start_from = Project_var.apply_closure_id closure_freshening start_from;
move_to = Project_var.apply_closure_id closure_freshening move_to;
}
| Field (field_index, var) ->
Field (field_index, apply_variable freshening var)
let freshen_projection_relation relation ~freshening ~closure_freshening =
Variable.Map.map (fun (spec_to : Flambda.specialised_to) ->
let projection =
match spec_to.projection with
| None -> None
| Some projection ->
Some (freshen_projection projection ~freshening ~closure_freshening)
in
{ spec_to with projection; })
relation
let freshen_projection_relation' relation ~freshening ~closure_freshening =
Variable.Map.map (fun ((spec_to : Flambda.specialised_to), data) ->
let projection =
match spec_to.projection with
| None -> None
| Some projection ->
Some (freshen_projection projection ~freshening ~closure_freshening)
in
{ spec_to with projection; }, data)
relation
|