source: src/compiler.ma @ 2876

Last change on this file since 2876 was 2875, checked in by sacerdot, 7 years ago

Pretty printing of object code integrated too.
A couple of axioms make execution via the preclassified_system
raise assert false.

File size: 5.4 KB
Line 
1(* Front-end related includes *)
2include "Clight/label.ma".
3include "Clight/SimplifyCasts.ma".
4include "Clight/switchRemoval.ma".
5include "Clight/toCminor.ma".
6include "Cminor/toRTLabs.ma".
7include "RTLabs/CostCheck.ma".
8include "RTLabs/CostInj.ma".
9
10(* Back-end related includes *)
11include "RTLabs/RTLabsToRTL.ma".
12include "RTL/RTLToERTL.ma".
13include "ERTL/ERTLToERTLptr.ma".
14include "ERTLptr/ERTLptrToLTL.ma".
15include "LTL/LTLToLIN.ma".
16include "LIN/LINToASM.ma".
17
18(* List of all passes whose outputs can be observed *)
19inductive pass : Type[0] ≝
20   clight_pass: pass
21 | clight_switch_removed_pass: pass
22 | clight_label_pass: pass
23 | clight_simplified_pass: pass
24 | cminor_pass: pass
25 | rtlabs_pass: pass
26 | rtl_separate_pass: pass
27 | rtl_uniq_pass: pass
28 | ertl_pass: pass
29 | ertlptr_pass: pass
30 | ltl_pass: pass
31 | lin_pass: pass
32 | assembly_pass: pass
33 | object_code_pass: pass.
34
35definition with_stack_model : Type[0] → Type[0] ≝
36 λA:Type[0].A × (ident → option ℕ).
37
38definition syntax_of_pass : pass → Type[0] ≝
39 λpass.
40  match pass with
41  [ clight_pass ⇒ clight_program
42  | clight_switch_removed_pass ⇒ clight_program
43  | clight_label_pass ⇒ clight_program
44  | clight_simplified_pass ⇒ clight_program
45  | cminor_pass ⇒ Cminor_program
46  | rtlabs_pass ⇒ RTLabs_program
47  | rtl_separate_pass ⇒ with_stack_model rtl_program
48  | rtl_uniq_pass ⇒ with_stack_model rtl_program
49  | ertl_pass ⇒ with_stack_model ertl_program
50  | ertlptr_pass ⇒ with_stack_model ertlptr_program
51  | ltl_pass ⇒ with_stack_model ltl_program
52  | lin_pass ⇒ with_stack_model lin_program
53  | assembly_pass ⇒ pseudo_assembly_program
54  | object_code_pass ⇒ labelled_object_code ].
55
56definition observe_pass ≝ ∀pass. syntax_of_pass pass → unit.
57
58(* The compiler front-end *)
59definition front_end :
60 observe_pass → clight_program → res (costlabel × clight_program × RTLabs_program) ≝
61λobserve,p.
62  let i ≝ observe clight_pass p in
63  let p ≝ program_switch_removal p in
64  let i ≝ observe clight_switch_removed_pass p in
65  let 〈p',init_cost〉 ≝ clight_label p in
66  let i ≝ observe clight_label_pass p' in
67  let p ≝ simplify_program p' in
68  let i ≝ observe clight_simplified_pass p in
69  ! p ← clight_to_cminor p;
70  let i ≝ observe cminor_pass p in
71  let p ≝ cminor_to_rtlabs init_cost p in
72  let i ≝ observe rtlabs_pass p in
73  if check_cost_program p then
74    if check_program_cost_injectivity p then
75      (return 〈init_cost,p',p〉)
76    else
77      (Error ? (msg RepeatedCostLabel))
78  else
79    (Error ? (msg BadCostLabelling)).
80
81(* The compiler back-end *)
82include "ERTLptr/uses.ma".  (* Included by the untrusted code *)
83axiom compute_fixpoint : fixpoint_computer.
84axiom colour_graph : coloured_graph_computer.
85
86include "common/AssocList.ma".
87
88(* Inefficient, replace with Trie lookup *)
89definition lookup_stack_cost ≝
90 λP,p,id.
91  assoc_list_lookup ?? id (eq_identifier …) (stack_cost P p).
92
93definition back_end :
94 observe_pass → RTLabs_program →
95  res (pseudo_assembly_program × stack_cost_model × nat) ≝
96λobserve,p.
97  let p ≝ rtlabs_to_rtl p in
98  let st ≝ lookup_stack_cost … p in
99  let i ≝ observe rtl_separate_pass 〈p,st〉 in
100  let i ≝ observe rtl_uniq_pass 〈p,st〉 in
101  let p ≝ rtl_to_ertl p in
102  let st ≝ lookup_stack_cost … p in 
103  let i ≝ observe ertl_pass 〈p,st〉 in
104  let p ≝ ertl_to_ertlptr p in
105  let st ≝ lookup_stack_cost … p in 
106  let i ≝ observe ertlptr_pass 〈p,st〉 in
107  let 〈p,stack_cost,max_stack〉 ≝ ertlptr_to_ltl compute_fixpoint colour_graph p in
108  (* The two stack models are the same *)
109  let st ≝ lookup_stack_cost … p in
110  let i ≝ observe ltl_pass 〈p,st〉 in
111  let st ≝ lookup_stack_cost … p in
112  let p ≝ ltl_to_lin p in
113  let st ≝ lookup_stack_cost … p in
114  let i ≝ observe lin_pass 〈p,st〉 in
115   ! p ← opt_to_res ? (msg AssemblyTooLarge) (lin_to_asm p) ;
116  let i ≝ observe assembly_pass p in
117   return 〈p,stack_cost,max_stack〉.
118
119(* The assembler *)
120include "ASM/Policy.ma".
121
122definition assembler :
123 observe_pass → pseudo_assembly_program → res labelled_object_code ≝
124λobserve,p.
125  ! sigma_pol ← opt_to_res ? (msg Jump_expansion_failed) (jump_expansion' p);
126  let sigma ≝ λppc. \fst sigma_pol ppc in
127  let pol ≝ λppc. \snd sigma_pol ppc in
128  let p ≝ assembly p sigma pol in
129  let i ≝ observe object_code_pass p in
130  OK ? p.
131
132(* Cost lifting *)
133include "ASM/ASMCosts.ma".
134
135definition lift_cost_map_back_to_front :
136  ∀clight, code_memory, lbls.
137    let abstat ≝ ASM_abstract_status code_memory lbls in
138  as_cost_map abstat → clight_cost_map clight ≝
139  λclight,code_memory,lbls,k,asm_cost_map.
140  lift_sigma_map_id … 0 (* labels not present in out code get 0 *)
141    (strong_decidable_in_codomain …) k asm_cost_map.
142
143(* Cost model computation *)
144include "ASM/ASMCostsSplit.ma".
145
146record compiler_output : Type[0] ≝
147 { c_labelled_object_code: labelled_object_code
148 ; c_stack_cost: stack_cost_model
149 ; c_max_stack: nat
150 ; c_labelled_clight: clight_program
151 ; c_clight_cost_map: clight_cost_map c_labelled_clight
152 }.
153
154definition compile : observe_pass → clight_program → res compiler_output ≝
155λobserve,p.
156  ! 〈init_cost,p',p〉 ← front_end observe p;
157  ! 〈p,stack_cost,max_stack〉 ← back_end observe p;
158  ! p ← assembler observe p;
159  let k ≝ ASM_cost_map p in
160  let k' ≝
161   lift_cost_map_back_to_front p' (load_code_memory (oc p)) (costlabels p) k in
162  return mk_compiler_output p stack_cost max_stack p' k'.
Note: See TracBrowser for help on using the repository browser.