source: src/compiler.ma @ 2702

Last change on this file since 2702 was 2702, checked in by sacerdot, 7 years ago
  1. proof closed in ASM/UtilBranch
  2. more passes integrated in the compiler.ma
  3. some work on commenting out broken proofs in linearise.ma
File size: 3.3 KB
Line 
1include "Clight/label.ma".
2include "Clight/SimplifyCasts.ma".
3include "Clight/switchRemoval.ma".
4include "Clight/toCminor.ma".
5include "Cminor/initialisation.ma".
6include "Cminor/toRTLabs.ma".
7
8definition front_end : clight_program → res (costlabel × clight_program × RTLabs_program) ≝
9λp.
10  let p ≝ program_switch_removal p in
11  let 〈p',init_cost〉 ≝ clight_label p in
12  let p ≝ simplify_program p' in
13  ! p ← clight_to_cminor p;
14  let p ≝ cminor_to_rtlabs init_cost p in
15  return 〈init_cost,p',p〉.
16
17include "RTLabs/RTLabsToRTL.ma".
18include "RTL/RTLToERTL.ma".
19include "ERTL/ERTLToERTLptr.ma".
20include "ERTLptr/ERTLptrToLTL.ma".
21(*
22include "LTL/LTLToLIN.ma".
23include "LIN/LINToASM.ma".
24*) include "ASM/ASM.ma". include "LIN/LIN.ma".
25   axiom ltl_to_lin: ltl_program → lin_program.
26   axiom lin_to_asm: lin_program → pseudo_assembly_program.
27
28axiom compute_fixpoint : fixpoint_computer.
29axiom colour_graph : coloured_graph_computer.
30
31definition back_end : RTLabs_program → pseudo_assembly_program ≝
32λp.
33  let p ≝ rtlabs_to_rtl p in
34  let p ≝ rtl_to_ertl p in
35  let p ≝ ertl_to_ertlptr p in
36  let p ≝ ertlptr_to_ltl compute_fixpoint colour_graph p in (* TODO: abstract over colouring *)
37  let p ≝ ltl_to_lin p in
38          lin_to_asm p.
39
40(* JHM: minimum needed for assembler axiom to typecheck *)
41(* JHM: moved from ASMCostsSplit.ma                     *)
42(* JHM: should move elsewhere in ASM/                   *)
43definition object_code ≝ list Byte.
44definition costlabel_map ≝ BitVectorTrie costlabel 16.
45
46include "ASM/Policy.ma".
47(* Equivalent to the inclusion of ASM/Policy.ma, waiting for that slow
48   file to compile
49  include "ASM/PolicyStep.ma".
50  axiom jump_expansion': ∀program:preamble × (Σl:list labelled_instruction.lt (S (|l|)) 2^16 ∧ is_well_labelled_p l).
51 option (Σsigma_policy:(Word → Word) × (Word → bool).
52   let 〈sigma,policy〉≝ sigma_policy in
53   sigma_policy_specification 〈\fst program,\snd program〉 sigma policy). *)
54
55definition assembler : pseudo_assembly_program → res (object_code × costlabel_map) ≝
56λp.
57  let 〈preamble, list_instr〉 ≝ p in
58  (* TODO: fail if p is too large. *)
59  let p' ≝ 〈preamble, list_instr〉 in
60  ! sigma_pol ← opt_to_res ? (msg Jump_expansion_failed) (jump_expansion' p');
61  let sigma ≝ λppc. \fst sigma_pol ppc in
62  let pol ≝ λppc. \snd sigma_pol ppc in
63  OK ? (assembly p sigma pol).
64cases daemon
65qed.
66
67include "ASM/ASMCosts.ma".
68
69definition lift_cost_map_back_to_front :
70  ∀clight, code_memory, lbls.
71    let abstat ≝ ASM_abstract_status code_memory lbls in
72   (∀l. (as_cost_labelled abstat l) + ¬(as_cost_labelled abstat l)) →
73  as_cost_map abstat → clight_cost_map clight ≝
74  λclight,code_memory,lbls,dec,k,asm_cost_map.
75  lift_sigma_map_id … 0 (* labels not present in out code get 0 *)
76    dec k asm_cost_map.
77
78include "ASM/ASMCostsSplit.ma".
79
80definition compile : clight_program →
81  res (object_code × costlabel_map × (𝚺labelled:clight_program. clight_cost_map labelled)) ≝
82λp.
83  ! 〈init_cost,p',p〉 ← front_end p;
84  let p ≝ back_end p in
85    ! p ← assembler p;
86  let k ≝ ASM_cost_map p ? in
87  let k' ≝ lift_cost_map_back_to_front
88    p'
89    (load_code_memory (\fst p))
90    (\snd p)
91    ? k
92    in
93  return 〈p, ❬p', k'❭〉.
94  cases daemon
95qed.
Note: See TracBrowser for help on using the repository browser.