source: src/compiler.ma @ 2705

Last change on this file since 2705 was 2705, checked in by sacerdot, 8 years ago

More progress in ASM towards implementing the new pseudoinstructions.

File size: 3.2 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".
21include "LTL/LTLToLIN.ma".
22(*
23include "LIN/LINToASM.ma".
24*) include "ASM/ASM.ma".
25   axiom lin_to_asm: lin_program → pseudo_assembly_program.
26
27axiom compute_fixpoint : fixpoint_computer.
28axiom colour_graph : coloured_graph_computer.
29
30definition back_end : RTLabs_program → pseudo_assembly_program ≝
31λp.
32  let p ≝ rtlabs_to_rtl p in
33  let p ≝ rtl_to_ertl p in
34  let p ≝ ertl_to_ertlptr p in
35  let p ≝ ertlptr_to_ltl compute_fixpoint colour_graph p in (* TODO: abstract over colouring *)
36  let p ≝ ltl_to_lin p in
37          lin_to_asm p.
38
39(* JHM: minimum needed for assembler axiom to typecheck *)
40(* JHM: moved from ASMCostsSplit.ma                     *)
41(* JHM: should move elsewhere in ASM/                   *)
42definition object_code ≝ list Byte.
43definition costlabel_map ≝ BitVectorTrie costlabel 16.
44
45include "ASM/Policy.ma".
46(* Equivalent to the inclusion of ASM/Policy.ma, waiting for that slow
47   file to compile
48  include "ASM/PolicyStep.ma".
49  axiom jump_expansion': ∀program:preamble × (Σl:list labelled_instruction.lt (S (|l|)) 2^16 ∧ is_well_labelled_p l).
50 option (Σsigma_policy:(Word → Word) × (Word → bool).
51   let 〈sigma,policy〉≝ sigma_policy in
52   sigma_policy_specification 〈\fst program,\snd program〉 sigma policy). *)
53
54definition assembler : pseudo_assembly_program → res (object_code × costlabel_map) ≝
55λp.
56  let 〈preamble, list_instr〉 ≝ p in
57  (* TODO: fail if p is too large. *)
58  let p' ≝ 〈preamble, list_instr〉 in
59  ! sigma_pol ← opt_to_res ? (msg Jump_expansion_failed) (jump_expansion' p');
60  let sigma ≝ λppc. \fst sigma_pol ppc in
61  let pol ≝ λppc. \snd sigma_pol ppc in
62  OK ? (assembly p sigma pol).
63cases daemon
64qed.
65
66include "ASM/ASMCosts.ma".
67
68definition lift_cost_map_back_to_front :
69  ∀clight, code_memory, lbls.
70    let abstat ≝ ASM_abstract_status code_memory lbls in
71   (∀l. (as_cost_labelled abstat l) + ¬(as_cost_labelled abstat l)) →
72  as_cost_map abstat → clight_cost_map clight ≝
73  λclight,code_memory,lbls,dec,k,asm_cost_map.
74  lift_sigma_map_id … 0 (* labels not present in out code get 0 *)
75    dec k asm_cost_map.
76
77include "ASM/ASMCostsSplit.ma".
78
79definition compile : clight_program →
80  res (object_code × costlabel_map × (𝚺labelled:clight_program. clight_cost_map labelled)) ≝
81λp.
82  ! 〈init_cost,p',p〉 ← front_end p;
83  let p ≝ back_end p in
84    ! p ← assembler p;
85  let k ≝ ASM_cost_map p ? in
86  let k' ≝ lift_cost_map_back_to_front
87    p'
88    (load_code_memory (\fst p))
89    (\snd p)
90    ? k
91    in
92  return 〈p, ❬p', k'❭〉.
93  cases daemon
94qed.
Note: See TracBrowser for help on using the repository browser.