open Util open Environ open Conversion open Vm open Values open Vmvalues open Vmsymtable
(* Test la structure des piles *)
type'a fail = { fail : 'r. 'a -> 'r }
exception NotConvertible
let fail_check state check box = match state with
| Result.Ok state -> (state, check, box)
| Result.Error None -> raise NotConvertible
| Result.Error (Some err) -> box.fail err
let convert_instances ~flex u1 u2 (state, check, box) = let state, check = Conversion.convert_instances ~flex u1 u2 (state, check) in
fail_check state check box
let sort_cmp_universes env pb s1 s2 (state, check, box) = let state, check = Conversion.sort_cmp_universes env pb s1 s2 (state, check) in
fail_check state check box
let rec compare_stack stk1 stk2 = match stk1, stk2 with
| [], [] -> true
| z1::stk1, z2::stk2 -> if compare_zipper z1 z2 then compare_stack stk1 stk2 elsefalse
| _, _ -> false
(* Conversion *) let conv_vect fconv vect1 vect2 cu = let n = Array.length vect1 in if Int.equal n (Array.length vect2) then let rcu = ref cu in
for i = 0 to n - 1 do
rcu := fconv vect1.(i) vect2.(i) !rcu
done;
!rcu elseraise NotConvertible
let rec conv_val env pb k v1 v2 cu = if v1 == v2 then cu else conv_whd env pb k (whd_val v1) (whd_val v2) cu
and conv_whd env pb k whd1 whd2 cu = (* Pp.(msg_debug (str "conv_whd(" ++ pr_whd whd1 ++ str ", " ++ pr_whd whd2 ++ str ")")) ; *) match whd1, whd2 with
| Vprod p1, Vprod p2 -> let cu = conv_val env CONV k (dom p1) (dom p2) cu in
conv_fun env pb k (codom p1) (codom p2) cu
| Vfun f1, Vfun f2 -> conv_fun env CONV k f1 f2 cu
| Vfix (f1,None), Vfix (f2,None) -> conv_fix env k f1 f2 cu
| Vfix (f1,Some args1), Vfix(f2,Some args2) -> if nargs args1 <> nargs args2 thenraise NotConvertible else conv_arguments env k args1 args2 (conv_fix env k f1 f2 cu)
| Vcofix (cf1,_,None), Vcofix (cf2,_,None) -> conv_cofix env k cf1 cf2 cu
| Vcofix (cf1,_,Some args1), Vcofix (cf2,_,Some args2) -> if nargs args1 <> nargs args2 thenraise NotConvertible else conv_arguments env k args1 args2 (conv_cofix env k cf1 cf2 cu)
| Vconst i1, Vconst i2 -> if Int.equal i1 i2 then cu elseraise NotConvertible
| Vblock b1, Vblock b2 -> let tag1 = btag b1 and tag2 = btag b2 in let sz = bsize b1 in if Int.equal tag1 tag2 && Int.equal sz (bsize b2) then let rcu = ref cu in
for i = 0 to sz - 1 do
rcu := conv_val env CONV k (bfield b1 i) (bfield b2 i) !rcu
done;
!rcu elseraise NotConvertible
| Vint64 i1, Vint64 i2 -> if Int64.equal i1 i2 then cu elseraise NotConvertible
| Vfloat64 f1, Vfloat64 f2 -> if Float64.(equal (of_float f1) (of_float f2)) then cu elseraise NotConvertible
| Vstring s1, Vstring s2 -> if Pstring.equal s1 s2 then cu elseraise NotConvertible
| Varray t1, Varray t2 -> if t1 == t2 then cu else let n = Parray.length_int t1 in ifnot (Int.equal n (Parray.length_int t2)) thenraise NotConvertible;
Parray.fold_left2 (fun cu v1 v2 -> conv_val env CONV k v1 v2 cu) cu t1 t2
| Vaccu (a1, stk1), Vaccu (a2, stk2) ->
conv_atom env pb k a1 stk1 a2 stk2 cu
| Vfun _, _ | _, Vfun _ -> (* on the fly eta expansion *)
conv_val env CONV (k+1) (apply_whd k whd1) (apply_whd k whd2) cu
and conv_atom env pb k a1 stk1 a2 stk2 cu = (* Pp.(msg_debug (str "conv_atom(" ++ pr_atom a1 ++ str ", " ++ pr_atom a2 ++ str ")")) ; *) match a1, a2 with
| Aind ((mi,_i) as ind1) , Aind ind2 -> if Names.Ind.CanOrd.equal ind1 ind2 && compare_stack stk1 stk2 then if UVars.AbstractContext.is_constant (Environ.mind_context env mi) then
conv_stack env k stk1 stk2 cu elsebegin match stk1 , stk2 with
| Zapp args1 :: stk1' , Zapp args2 :: stk2' ->
assert (0 < nargs args1);
assert (0 < nargs args2); let u1 = uni_instance (arg args1 0) in let u2 = uni_instance (arg args2 0) in let cu = convert_instances ~flex:false u1 u2 cu in
conv_arguments env ~from:1 k args1 args2
(conv_stack env k stk1' stk2' cu)
| _, _ -> assert false(* Should not happen if problem is well typed *) end elseraise NotConvertible
| Aid ik1, Aid ik2 -> if Vmvalues.eq_id_key ik1 ik2 && compare_stack stk1 stk2 then if UVars.AbstractContext.is_constant (table_key_instance env ik1) then
conv_stack env k stk1 stk2 cu else match stk1 , stk2 with
| Zapp args1 :: stk1' , Zapp args2 :: stk2' ->
assert (0 < nargs args1);
assert (0 < nargs args2); let u1 = uni_instance (arg args1 0) in let u2 = uni_instance (arg args2 0) in let cu = convert_instances ~flex:false u1 u2 cu in
conv_arguments env ~from:1 k args1 args2
(conv_stack env k stk1' stk2' cu)
| _, _ -> assert false(* Should not happen if problem is well typed *) elseraise NotConvertible
| Asort s1, Asort s2 ->
sort_cmp_universes env pb s1 s2 cu
| Asort _ , _ | Aind _, _ | Aid _, _ -> raise NotConvertible
and conv_stack env k stk1 stk2 cu = match stk1, stk2 with
| [], [] -> cu
| Zapp args1 :: stk1, Zapp args2 :: stk2 ->
conv_stack env k stk1 stk2 (conv_arguments env k args1 args2 cu)
| Zfix(f1,args1) :: stk1, Zfix(f2,args2) :: stk2 ->
conv_stack env k stk1 stk2
(conv_arguments env k args1 args2 (conv_fix env k f1 f2 cu))
| Zswitch sw1 :: stk1, Zswitch sw2 :: stk2 -> if check_switch sw1 sw2 then let vt1,vt2 = type_of_switch sw1, type_of_switch sw2 in let rcu = ref (conv_val env CONV k vt1 vt2 cu) in let b1, b2 = branch_of_switch k sw1, branch_of_switch k sw2 in
for i = 0 to Array.length b1 - 1 do
rcu :=
conv_val env CONV (k + fst b1.(i)) (snd b1.(i)) (snd b2.(i)) !rcu
done;
conv_stack env k stk1 stk2 !rcu elseraise NotConvertible
| Zproj p1 :: stk1, Zproj p2 :: stk2 -> if Int.equal p1 p2 then conv_stack env k stk1 stk2 cu elseraise NotConvertible
| [], _ | Zapp _ :: _, _ | Zfix _ :: _, _ | Zswitch _ :: _, _
| Zproj _ :: _, _ -> raise NotConvertible
and conv_fun env pb k f1 f2 cu = if f1 == f2 then cu else let arity,b1,b2 = decompose_vfun2 k f1 f2 in
conv_val env pb (k+arity) b1 b2 cu
and conv_fix env k f1 f2 cu = if f1 == f2 then cu else if check_fix f1 f2 then let bf1, tf1 = reduce_fix k f1 in let bf2, tf2 = reduce_fix k f2 in let cu = conv_vect (conv_val env CONV k) tf1 tf2 cu in
conv_vect (conv_fun env CONV (k + Array.length tf1)) bf1 bf2 cu elseraise NotConvertible
and conv_cofix env k cf1 cf2 cu = if cf1 == cf2 then cu else if check_cofix cf1 cf2 then let bcf1, tcf1 = reduce_cofix k cf1 in let bcf2, tcf2 = reduce_cofix k cf2 in let cu = conv_vect (conv_val env CONV k) tcf1 tcf2 cu in
conv_vect (conv_val env CONV (k + Array.length tcf1)) bcf1 bcf2 cu elseraise NotConvertible
and conv_arguments env ?from:(from=0) k args1 args2 cu = if args1 == args2 then cu else let n = nargs args1 in if Int.equal n (nargs args2) then let rcu = ref cu in
for i = from to n - 1 do
rcu := conv_val env CONV k (arg args1 i) (arg args2 i) !rcu
done;
!rcu elseraise NotConvertible
let warn_bytecode_compiler_failed = letopen Pp in
CWarnings.create ~name:"bytecode-compiler-failed" ~category:CWarnings.CoreCategories.bytecode_compiler
(fun () -> strbrk "Bytecode compiler failed, " ++
strbrk "falling back to standard conversion")
let vm_conv_gen (type err) cv_pb sigma env univs t1 t2 = ifnot (typing_flags env).Declarations.enable_VM then
Conversion.generic_conv cv_pb ~l2r:false ~evars:sigma.Genlambda.evars_val
TransparentState.full env univs t1 t2 else let exception Error of err in let box = { fail = fun e -> raise (Error e) } in try let (state, check) = univs in let v1 = val_of_constr env sigma t1 in let v2 = val_of_constr env sigma t2 in
Result.Ok (pi1 (conv_val env cv_pb (nb_rel env) v1 v2 (state, check, box))) with
| NotConvertible -> Result.Error None
| Error e -> Result.Error (Some e)
| Not_found | Invalid_argument _ | Vmerrors.CompileError _ ->
warn_bytecode_compiler_failed ();
Conversion.generic_conv cv_pb ~l2r:false ~evars:sigma.Genlambda.evars_val
TransparentState.full env univs t1 t2
let vm_conv cv_pb env t1 t2 = let univs = Environ.universes env in let b = if cv_pb = CUMUL then Constr.leq_constr_univs univs t1 t2 else Constr.eq_constr_univs univs t1 t2 in if b then Result.Ok () else let state = (univs, checked_universes) in let ans : (UGraph.t, 'a option) result =
NewProfile.profile "vm_conv" (fun () ->
vm_conv_gen cv_pb (Genlambda.empty_evars env) env state t1 t2)
() in match ans with
| Result.Ok (_ : UGraph.t)-> Result.Ok ()
| Result.Error None -> Result.Error ()
| Result.Error (Some e) -> Empty.abort e
¤ Dauer der Verarbeitung: 0.20 Sekunden
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.