fact
stringlengths
7
4.84k
type
stringclasses
18 values
library
stringclasses
14 values
imports
listlengths
0
27
filename
stringclasses
205 values
symbolic_name
stringlengths
1
49
docstring
stringlengths
6
2.5k
combine_cond'_sound: forall cond args res res', combine_cond' cond args = Some res' -> eval_condition cond (map valu args) m = Some res -> res = res'.
Theorem
aarch64
[ "Coq.FunInd", "Coqlib", "AST", "Integers", "Values", "Memory", "Op", "Registers", "RTL", "CSEdomain", "CombineOp" ]
aarch64/CombineOpproof.v
combine_cond
null
combine_addr_sound: forall addr args addr' args', combine_addr get addr args = Some(addr', args') -> eval_addressing ge sp addr' (map valu args') = eval_addressing ge sp addr (map valu args).
Theorem
aarch64
[ "Coq.FunInd", "Coqlib", "AST", "Integers", "Values", "Memory", "Op", "Registers", "RTL", "CSEdomain", "CombineOp" ]
aarch64/CombineOpproof.v
combine_addr_sound
null
combine_op_sound: forall op args op' args' r, combine_op get op args = Some(op', args') -> eval_operation ge sp op (map valu args) m = Some r -> exists r', eval_operation ge sp op' (map valu args') m = Some r' /\ Val.lessdef r r'.
Theorem
aarch64
[ "Coq.FunInd", "Coqlib", "AST", "Integers", "Values", "Memory", "Op", "Registers", "RTL", "CSEdomain", "CombineOp" ]
aarch64/CombineOpproof.v
combine_op_sound
null
match_G: forall r id ofs, AE.get r ae = Ptr(Gl id ofs) -> Val.lessdef e#r (Genv.symbol_address ge id ofs).
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
match_G
null
match_S: forall r ofs, AE.get r ae = Ptr(Stk ofs) -> Val.lessdef e#r (Vptr sp ofs).
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
match_S
null
const_for_result_correct: forall a op v, const_for_result a = Some op -> vmatch bc v a -> exists v', eval_operation ge (Vptr sp Ptrofs.zero) op nil m = Some v' /\ Val.lessdef v v'.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
const_for_result_correct
null
eval_static_shift_correct: forall s v a, eval_shift s (Vint v) a = Vint (eval_static_shift s v a).
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
eval_static_shift_correct
null
eval_static_shiftl_correct: forall s v a, eval_shiftl s (Vlong v) a = Vlong (eval_static_shiftl s v a).
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
eval_static_shiftl_correct
null
eval_static_extend_correct: forall x v a, eval_extend x (Vint v) a = Vlong (eval_static_extend x v a).
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
eval_static_extend_correct
null
cond_strength_reduction_correct: forall cond args vl, vl = map (fun r => AE.get r ae) args -> let (cond', args') := cond_strength_reduction cond args vl in eval_condition cond' e##args' m = eval_condition cond e##args m.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
cond_strength_reduction_correct
null
make_cmp_base_correct: forall c args vl, vl = map (fun r => AE.get r ae) args -> let (op', args') := make_cmp_base c args vl in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op' e##args' m = Some v /\ Val.lessdef (Val.of_optbool (eval_condition c e##args m)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_cmp_base_correct
null
make_cmp_correct: forall c args vl, vl = map (fun r => AE.get r ae) args -> let (op', args') := make_cmp c args vl in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op' e##args' m = Some v /\ Val.lessdef (Val.of_optbool (eval_condition c e##args m)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_cmp_correct
null
make_select_correct: forall c ty r1 r2 args vl, vl = map (fun r => AE.get r ae) args -> let (op', args') := make_select c ty r1 r2 args vl in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op' e##args' m = Some v /\ Val.lessdef (Val.select (eval_condition c e##args m) e#r1 e#r2 ty) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_select_correct
null
make_addimm_correct: forall n r, let (op, args) := make_addimm n r in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.add e#r (Vint n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_addimm_correct
null
make_shlimm_correct: forall n r1 r2, e#r2 = Vint n -> let (op, args) := make_shlimm n r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.shl e#r1 (Vint n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_shlimm_correct
null
make_shrimm_correct: forall n r1 r2, e#r2 = Vint n -> let (op, args) := make_shrimm n r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.shr e#r1 (Vint n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_shrimm_correct
null
make_shruimm_correct: forall n r1 r2, e#r2 = Vint n -> let (op, args) := make_shruimm n r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.shru e#r1 (Vint n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_shruimm_correct
null
make_mulimm_correct: forall n r1 r2, e#r2 = Vint n -> let (op, args) := make_mulimm n r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.mul e#r1 (Vint n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_mulimm_correct
null
make_divimm_correct: forall n r1 r2 v, Val.divs e#r1 e#r2 = Some v -> e#r2 = Vint n -> let (op, args) := make_divimm n r1 r2 in exists w, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some w /\ Val.lessdef v w.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_divimm_correct
null
make_divuimm_correct: forall n r1 r2 v, Val.divu e#r1 e#r2 = Some v -> e#r2 = Vint n -> let (op, args) := make_divuimm n r1 r2 in exists w, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some w /\ Val.lessdef v w.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_divuimm_correct
null
make_andimm_correct: forall n r x, vmatch bc e#r x -> let (op, args) := make_andimm n r x in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.and e#r (Vint n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_andimm_correct
null
make_orimm_correct: forall n r, let (op, args) := make_orimm n r in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.or e#r (Vint n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_orimm_correct
null
make_xorimm_correct: forall n r, let (op, args) := make_xorimm n r in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.xor e#r (Vint n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_xorimm_correct
null
make_addlimm_correct: forall n r, let (op, args) := make_addlimm n r in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.addl e#r (Vlong n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_addlimm_correct
null
make_shllimm_correct: forall n r1 r2, e#r2 = Vint n -> let (op, args) := make_shllimm n r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.shll e#r1 (Vint n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_shllimm_correct
null
make_shrlimm_correct: forall n r1 r2, e#r2 = Vint n -> let (op, args) := make_shrlimm n r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.shrl e#r1 (Vint n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_shrlimm_correct
null
make_shrluimm_correct: forall n r1 r2, e#r2 = Vint n -> let (op, args) := make_shrluimm n r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.shrlu e#r1 (Vint n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_shrluimm_correct
null
make_mullimm_correct: forall n r1 r2, e#r2 = Vlong n -> let (op, args) := make_mullimm n r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.mull e#r1 (Vlong n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_mullimm_correct
null
make_divlimm_correct: forall n r1 r2 v, Val.divls e#r1 e#r2 = Some v -> e#r2 = Vlong n -> let (op, args) := make_divlimm n r1 r2 in exists w, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some w /\ Val.lessdef v w.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_divlimm_correct
null
make_divluimm_correct: forall n r1 r2 v, Val.divlu e#r1 e#r2 = Some v -> e#r2 = Vlong n -> let (op, args) := make_divluimm n r1 r2 in exists w, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some w /\ Val.lessdef v w.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_divluimm_correct
null
make_andlimm_correct: forall n r x, let (op, args) := make_andlimm n r x in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.andl e#r (Vlong n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_andlimm_correct
null
make_orlimm_correct: forall n r, let (op, args) := make_orlimm n r in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.orl e#r (Vlong n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_orlimm_correct
null
make_xorlimm_correct: forall n r, let (op, args) := make_xorlimm n r in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.xorl e#r (Vlong n)) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_xorlimm_correct
null
make_mulfimm_correct: forall n r1 r2, e#r2 = Vfloat n -> let (op, args) := make_mulfimm n r1 r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.mulf e#r1 e#r2) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_mulfimm_correct
null
make_mulfimm_correct_2: forall n r1 r2, e#r1 = Vfloat n -> let (op, args) := make_mulfimm n r2 r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.mulf e#r1 e#r2) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_mulfimm_correct_2
null
make_mulfsimm_correct: forall n r1 r2, e#r2 = Vsingle n -> let (op, args) := make_mulfsimm n r1 r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.mulfs e#r1 e#r2) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_mulfsimm_correct
null
make_mulfsimm_correct_2: forall n r1 r2, e#r1 = Vsingle n -> let (op, args) := make_mulfsimm n r2 r1 r2 in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.mulfs e#r1 e#r2) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_mulfsimm_correct_2
null
make_zext_correct: forall s r x, vmatch bc e#r x -> let (op, args) := make_zext s r x in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.zero_ext s e#r) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_zext_correct
null
make_sext_correct: forall s r x, vmatch bc e#r x -> let (op, args) := make_sext s r x in exists v, eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v /\ Val.lessdef (Val.sign_ext s e#r) v.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
make_sext_correct
null
op_strength_reduction_correct: forall op args vl v, vl = map (fun r => AE.get r ae) args -> eval_operation ge (Vptr sp Ptrofs.zero) op e##args m = Some v -> let (op', args') := op_strength_reduction op args vl in exists w, eval_operation ge (Vptr sp Ptrofs.zero) op' e##args' m = Some w /\ Val.lessdef v w.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
op_strength_reduction_correct
null
addr_strength_reduction_correct: forall addr args vl res, vl = map (fun r => AE.get r ae) args -> eval_addressing ge (Vptr sp Ptrofs.zero) addr e##args = Some res -> let (addr', args') := addr_strength_reduction addr args vl in exists res', eval_addressing ge (Vptr sp Ptrofs.zero) addr' e##args' = Some res' /\ Val.lessdef res res'.
Lemma
aarch64
[ "Coqlib", "Compopts", "Integers", "Floats", "Values", "Memory", "Globalenvs", "Events", "Op", "Registers", "RTL", "ValueDomain", "ValueAOp", "ValueAnalysis", "ConstpropOp" ]
aarch64/ConstpropOpproof.v
addr_strength_reduction_correct
null
is_callee_save (r: mreg): bool := match r with | R0 | R1 | R2 | R3 | R4 | R5 | R6 | R7 => false | R8 | R9 | R10 | R11 | R12 | R13 | R14 | R15 => false | R17 => false | R19 | R20 | R21 | R22 | R23 => true | R24 | R25 | R26 | R27 | R28 => true | R29 => true | F0 | F1 | F2 | F3 | F4 | F5 | F6 | F7 => false | F8 | F9 | F10 | F11 | F12 | F13 | F14 | F15 => true | F16 | F17 | F18 | F19 | F20 | F21 | F22 | F23 => false | F24 | F25 | F26 | F27 | F28 | F29 | F30 | F31 => false end.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
is_callee_save
Machine registers (type [mreg] in module [Locations]) are divided in: - Callee-save registers, whose value is preserved across a function call. - Caller-save registers that can be modified during a function call. We follow the Procedure Call Standard for the ARM 64-bit Architecture (AArch64) document: R19-R28 and F8-F15 are callee-save. X16 is reserved as a temporary for asm generation. X18 is reserved as the platform register. X29 is reserved as the frame pointer register. X30 is reserved as the return address register.
int_caller_save_regs := R0 :: R1 :: R2 :: R3 :: R4 :: R5 :: R6 :: R7 :: R8 :: R9 :: R10 :: R11 :: R12 :: R13 :: R14 :: R15 :: R17 :: nil.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
int_caller_save_regs
null
float_caller_save_regs := F0 :: F1 :: F2 :: F3 :: F4 :: F5 :: F6 :: F7 :: F16 :: F17 :: F18 :: F19 :: F20 :: F21 :: F22 :: F23 :: F24 :: F25 :: F26 :: F27 :: F28 :: F29 :: F30 :: F31 :: nil.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
float_caller_save_regs
null
int_callee_save_regs := R19 :: R20 :: R21 :: R22 :: R23 :: R24 :: R25 :: R26 :: R27 :: R28 :: R29 :: nil.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
int_callee_save_regs
null
float_callee_save_regs := F8 :: F9 :: F10 :: F11 :: F12 :: F13 :: F14 :: F15 :: nil.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
float_callee_save_regs
null
destroyed_at_call := List.filter (fun r => negb (is_callee_save r)) all_mregs.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
destroyed_at_call
null
dummy_int_reg := R0.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
dummy_int_reg
null
dummy_float_reg := F0.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
dummy_float_reg
r Used in [Coloring].
callee_save_type := mreg_type.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
callee_save_type
r Used in [Coloring].
is_float_reg (r: mreg): bool := match r with | R0 | R1 | R2 | R3 | R4 | R5 | R6 | R7 | R8 | R9 | R10 | R11 | R12 | R13 | R14 | R15 | R17 | R19 | R20 | R21 | R22 | R23 | R24 | R25 | R26 | R27 | R28 | R29 => false | F0 | F1 | F2 | F3 | F4 | F5 | F6 | F7 | F8 | F9 | F10 | F11 | F12 | F13 | F14 | F15 | F16 | F17 | F18 | F19 | F20 | F21 | F22 | F23 | F24 | F25 | F26 | F27 | F28 | F29 | F30 | F31 => true end.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
is_float_reg
null
alloc_regs := mk_alloc_regs { preferred_int_regs: list mreg; remaining_int_regs: list mreg; preferred_float_regs: list mreg; remaining_float_regs: list mreg }.
Record
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
alloc_regs
How to use registers for register allocation. We favor the use of caller-save registers, using callee-save registers only when no caller-save is available.
allocatable_registers (_: unit) := {| preferred_int_regs := int_caller_save_regs; remaining_int_regs := int_callee_save_regs; preferred_float_regs := float_caller_save_regs; remaining_float_regs := float_callee_save_regs |}.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
allocatable_registers
null
loc_result (s: signature) : rpair mreg := match proj_sig_res s with | Tint | Tlong | Tany32 | Tany64 => One R0 | Tfloat | Tsingle => One F0 end.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_result
The result value of a function is passed back to the caller in registers [R0] or [F0], depending on the type of the returned value. We treat a function without result as a function with one integer result.
loc_result_type: forall sig, subtype (proj_sig_res sig) (typ_rpair mreg_type (loc_result sig)) = true.
Lemma
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_result_type
The result registers have types compatible with that given in the signature.
loc_result_caller_save: forall (s: signature), forall_rpair (fun r => is_callee_save r = false) (loc_result s).
Lemma
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_result_caller_save
The result locations are caller-save registers
loc_result_pair: forall sg, match loc_result sg with | One _ => True | Twolong r1 r2 => r1 <> r2 /\ proj_sig_res sg = Tlong /\ subtype Tint (mreg_type r1) = true /\ subtype Tint (mreg_type r2) = true /\ Archi.ptr64 = false end.
Lemma
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_result_pair
If the result is in a pair of registers, those registers are distinct and have type [Tint] at least.
loc_result_exten: forall s1 s2, s1.(sig_res) = s2.(sig_res) -> loc_result s1 = loc_result s2.
Lemma
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_result_exten
The location of the result depends only on the result part of the signature
int_param_regs := R0 :: R1 :: R2 :: R3 :: R4 :: R5 :: R6 :: R7 :: nil.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
int_param_regs
- The first 8 integer arguments are passed in registers [R0...R7]. - The first 8 FP arguments are passed in registers [F0...F7]. - Extra arguments are passed on the stack, in [Outgoing] slots, consecutively assigned, starting at word offset 0. In the standard AAPCS64, all stack slots are 8-byte wide (2 words). In the Apple variant, a stack slot has the size of the type of the corresponding argument, and is aligned accordingly. We use 8-byte slots (2 words) for C types [long] and [double], and 4-byte slots (1 word) for C types [int] and [float]. For full conformance, we should use 1-byte slots for [char] types and 2-byte slots for [short] types, but this cannot be expressed in CompCert's type algebra, so we incorrectly use 4-byte slots. Concerning variable arguments to vararg functions: - In the AAPCS64 standard, they are passed like regular, fixed arguments. - In the Apple variant, they are always passed on stack, in 8-byte slots.
float_param_regs := F0 :: F1 :: F2 :: F3 :: F4 :: F5 :: F6 :: F7 :: nil.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
float_param_regs
null
stack_arg (ty: typ) (ir fr ofs: Z) (rec: Z -> Z -> Z -> list (rpair loc)) := match Archi.abi with | Archi.AAPCS64 => let ofs := align ofs 2 in One (S Outgoing ofs ty) :: rec ir fr (ofs + 2) | Archi.Apple => let ofs := align ofs (typesize ty) in One (S Outgoing ofs ty) :: rec ir fr (ofs + typesize ty) end.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
stack_arg
null
int_arg (ty: typ) (ir fr ofs: Z) (rec: Z -> Z -> Z -> list (rpair loc)) := match list_nth_z int_param_regs ir with | None => stack_arg ty ir fr ofs rec | Some ireg => One (R ireg) :: rec (ir + 1) fr ofs end.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
int_arg
null
float_arg (ty: typ) (ir fr ofs: Z) (rec: Z -> Z -> Z -> list (rpair loc)) := match list_nth_z float_param_regs fr with | None => stack_arg ty ir fr ofs rec | Some freg => One (R freg) :: rec ir (fr + 1) ofs end.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
float_arg
null
loc_arguments_stack (tyl: list typ) (ofs: Z) {struct tyl} : list (rpair loc) := match tyl with | nil => nil | ty :: tys => One (S Outgoing ofs Tany64) :: loc_arguments_stack tys (ofs + 2) end.
Fixpoint
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_arguments_stack
null
loc_arguments_rec (tyl: list typ) (fixed ir fr ofs: Z) {struct tyl} : list (rpair loc) := match tyl with | nil => nil | ty :: tys => if zle fixed 0 then loc_arguments_stack tyl (align ofs 2) else match ty with | Tint | Tlong | Tany32 | Tany64 => int_arg ty ir fr ofs (loc_arguments_rec tys (fixed - 1)) | Tfloat | Tsingle => float_arg ty ir fr ofs (loc_arguments_rec tys (fixed - 1)) end end.
Fixpoint
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_arguments_rec
null
fixed_arguments (s: signature) : Z := match Archi.abi, s.(sig_cc).(cc_vararg) with | Archi.Apple, Some n => n | _, _ => list_length_z s.(sig_args) end.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
fixed_arguments
Number of fixed arguments for a function with signature [s]. For AAPCS64, all arguments are treated as fixed, even for a vararg function.
loc_arguments (s: signature) : list (rpair loc) := loc_arguments_rec (proj_sig_args s) (fixed_arguments s) 0 0 0.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_arguments
[loc_arguments s] returns the list of locations where to store arguments when calling a function with signature [s].
loc_argument_acceptable (l: loc) : Prop := match l with | R r => is_callee_save r = false | S Outgoing ofs ty => ofs >= 0 /\ (typealign ty | ofs) | _ => False end.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_argument_acceptable
Argument locations are either caller-save registers or [Outgoing] stack slots at nonnegative offsets.
loc_arguments_rec_charact: forall tyl fixed ri rf ofs p, ofs >= 0 -> In p (loc_arguments_rec tyl fixed ri rf ofs) -> forall_rpair loc_argument_acceptable p.
Lemma
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_arguments_rec_charact
null
loc_arguments_acceptable: forall (s: signature) (p: rpair loc), In p (loc_arguments s) -> forall_rpair loc_argument_acceptable p.
Lemma
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_arguments_acceptable
null
loc_arguments_main: loc_arguments signature_main = nil.
Lemma
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
loc_arguments_main
null
return_value_needs_normalization (t: xtype) : bool := match Archi.abi with | Archi.Apple => false | Archi.AAPCS64 => match t with | Xbool | Xint8signed | Xint8unsigned | Xint16signed | Xint16unsigned => true | _ => false end end.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
return_value_needs_normalization
According to the AAPCS64 ABI specification, "padding bits" in the return value of a function or in a function parameter have unpredictable values and must be ignored. Consequently, we force normalization of return values and of function parameters when they have small integer types (8- and 16-bit integers), so that the top bits (the "padding bits") are proper sign- or zero-extensions of the small integer value. The Apple variant of the AAPCS64 requires the callee to return a normalized value, and the caller to pass normalized parameters, hence no normalization is needed.
parameter_needs_normalization := return_value_needs_normalization.
Definition
aarch64
[ "Coqlib", "Decidableplus", "AST", "Events", "Locations" ]
aarch64/Conventions1.v
parameter_needs_normalization
null
mreg: Type := | R0 | R1 | R2 | R3 | R4 | R5 | R6 | R7 | R8 | R9 | R10 | R11 | R12 | R13 | R14 | R15 | R17 | R19 | R20 | R21 | R22 | R23 | R24 | R25 | R26 | R27 | R28 | R29 | F0 | F1 | F2 | F3 | F4 | F5 | F6 | F7 | F8 | F9 | F10 | F11 | F12 | F13 | F14 | F15 | F16 | F17 | F18 | F19 | F20 | F21 | F22 | F23 | F24 | F25 | F26 | F27 | F28 | F29 | F30 | F31.
Inductive
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
mreg
Integer register 16 is reserved as temporary and for call veeners. Integer register 18 is reserved as the platform register. Integer register 30 is reserved for the return address.
mreg_eq: forall (r1 r2: mreg), {r1 = r2} + {r1 <> r2}.
Lemma
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
mreg_eq
null
all_mregs := R0 :: R1 :: R2 :: R3 :: R4 :: R5 :: R6 :: R7 :: R8 :: R9 :: R10 :: R11 :: R12 :: R13 :: R14 :: R15 :: R17 :: R19 :: R20 :: R21 :: R22 :: R23 :: R24 :: R25 :: R26 :: R27 :: R28 :: R29 :: F0 :: F1 :: F2 :: F3 :: F4 :: F5 :: F6 :: F7 :: F8 :: F9 :: F10 :: F11 :: F12 :: F13 :: F14 :: F15 :: F16 :: F17 :: F18 :: F19 :: F20 :: F21 :: F22 :: F23 :: F24 :: F25 :: F26 :: F27 :: F28 :: F29 :: F30 :: F31 :: nil.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
all_mregs
null
all_mregs_complete: forall (r: mreg), In r all_mregs.
Lemma
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
all_mregs_complete
null
Decidable_eq_mreg : forall (x y: mreg), Decidable (eq x y) := Decidable_eq mreg_eq.
Instance
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
Decidable_eq_mreg
null
Finite_mreg : Finite mreg := { Finite_elements := all_mregs; Finite_elements_spec := all_mregs_complete }.
Instance
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
Finite_mreg
null
mreg_type (r: mreg): typ := Tany64.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
mreg_type
null
t := mreg.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
t
null
eq := mreg_eq.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
eq
null
index (r: mreg): positive := match r with | R0 => 1 | R1 => 2 | R2 => 3 | R3 => 4 | R4 => 5 | R5 => 6 | R6 => 7 | R7 => 8 | R8 => 9 | R9 => 10 | R10 => 11 | R11 => 12 | R12 => 13 | R13 => 14 | R14 => 15 | R15 => 16 | R17 => 17 | R19 => 19 | R20 => 20 | R21 => 21 | R22 => 22 | R23 => 23 | R24 => 24 | R25 => 25 | R26 => 26 | R27 => 27 | R28 => 28 | R29 => 29 | F0 => 32 | F1 => 33 | F2 => 34 | F3 => 35 | F4 => 36 | F5 => 37 | F6 => 38 | F7 => 39 | F8 => 40 | F9 => 41 | F10 => 42 | F11 => 43 | F12 => 44 | F13 => 45 | F14 => 46 | F15 => 47 | F16 => 48 | F17 => 49 | F18 => 50 | F19 => 51 | F20 => 52 | F21 => 53 | F22 => 54 | F23 => 55 | F24 => 56 | F25 => 57 | F26 => 58 | F27 => 59 | F28 => 60 | F29 => 61 | F30 => 62 | F31 => 63 end.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
index
null
index_inj: forall r1 r2, index r1 = index r2 -> r1 = r2.
Lemma
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
index_inj
null
is_stack_reg (r: mreg) : bool := false.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
is_stack_reg
null
register_names := ("X0", R0) :: ("X1", R1) :: ("X2", R2) :: ("X3", R3) :: ("X4", R4) :: ("X5", R5) :: ("X6", R6) :: ("X7", R7) :: ("X8", R8) :: ("X9", R9) :: ("X10", R10) :: ("X11", R11) :: ("X12", R12) :: ("X13", R13) :: ("X14", R14) :: ("X15", R15) :: ("X17", R17) :: ("X19", R19) :: ("X20", R20) :: ("X21", R21) :: ("X22", R22) :: ("X23", R23) :: ("X24", R24) :: ("X25", R25) :: ("X26", R26) :: ("X27", R27) :: ("X28", R28) :: ("X29", R29) :: ("D0", F0) :: ("D1", F1) :: ("D2", F2) :: ("D3", F3) :: ("D4", F4) :: ("D5", F5) :: ("D6", F6) :: ("D7", F7) :: ("D8", F8) :: ("D9", F9) :: ("D10", F10) :: ("D11", F11) :: ("D12", F12) :: ("D13", F13) :: ("D14", F14) :: ("D15", F15) :: ("D16", F16) :: ("D17", F17) :: ("D18", F18) :: ("D19", F19) :: ("D20", F20) :: ("D21", F21) :: ("D22", F22) :: ("D23", F23) :: ("D24", F24) :: ("D25", F25) :: ("D26", F26) :: ("D27", F27) :: ("D28", F28) :: ("D29", F29) :: ("D30", F30) :: ("D31", F31) :: nil.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
register_names
null
register_by_name (s: string) : option mreg := let fix assoc (l: list (string * mreg)) : option mreg := match l with | nil => None | (s1, r1) :: l' => if string_dec s s1 then Some r1 else assoc l' end in assoc register_names.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
register_by_name
null
destroyed_by_op (op: operation): list mreg := match op with | Oshrximm _ | Oshrlximm _ => R17 :: nil | _ => nil end.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
destroyed_by_op
** Destroyed registers, preferred registers
destroyed_by_load (chunk: memory_chunk) (addr: addressing): list mreg := nil.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
destroyed_by_load
null
destroyed_by_store (chunk: memory_chunk) (addr: addressing): list mreg := nil.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
destroyed_by_store
null
destroyed_by_cond (cond: condition): list mreg := nil.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
destroyed_by_cond
null
destroyed_by_jumptable: list mreg := R17 :: nil.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
destroyed_by_jumptable
null
destroyed_by_clobber (cl: list string): list mreg := match cl with | nil => nil | c1 :: cl => match register_by_name c1 with | Some r => r :: destroyed_by_clobber cl | None => destroyed_by_clobber cl end end.
Fixpoint
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
destroyed_by_clobber
null
destroyed_by_builtin (ef: external_function): list mreg := match ef with | EF_memcpy sz al => R14 :: R15 :: R17 :: nil | EF_inline_asm txt sg clob => destroyed_by_clobber clob | _ => nil end.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
destroyed_by_builtin
null
destroyed_by_setstack (ty: typ): list mreg := nil.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
destroyed_by_setstack
null
destroyed_at_function_entry: list mreg := R15 :: nil.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
destroyed_at_function_entry
null
destroyed_at_indirect_call: list mreg := nil.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
destroyed_at_indirect_call
null
temp_for_parent_frame: mreg := R15.
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
temp_for_parent_frame
null
mregs_for_operation (op: operation): list (option mreg) * option mreg := (nil, None).
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
mregs_for_operation
null
mregs_for_builtin (ef: external_function): list (option mreg) * list(option mreg) := (nil, nil).
Definition
aarch64
[ "Coq.String", "Coqlib", "Decidableplus", "Maps", "AST", "Op" ]
aarch64/Machregs.v
mregs_for_builtin
null