Revision 70df2f87
Added by Xavier Thirioux almost 8 years ago
src/machine_code.ml  

425  425 
to the computed schedule [sch] 
426  426 
*) 
427  427 
let sort_equations_from_schedule nd sch = 
428 
(* Format.eprintf "%s schedule: %a@." 

429 
nd.node_id 

430 
(Utils.fprintf_list ~sep:" ; " Scheduling.pp_eq_schedule) sch;*) 

428  431 
let split_eqs = Splitting.tuple_split_eq_list nd.node_eqs in 
429  432 
let eqs_rev, remainder = 
430  433 
List.fold_left 
...  ...  
439  442 
([], split_eqs) 
440  443 
sch 
441  444 
in 
442 
if List.length remainder > 0 then ( 

443 
Format.eprintf "Equations not used are@.%a@.Full equation set is:@.%a@.@?" 

444 
Printers.pp_node_eqs remainder 

445 
Printers.pp_node_eqs nd.node_eqs; 

446 
assert false); 

447 
List.rev eqs_rev 

445 
begin 

446 
if List.length remainder > 0 then ( 

447 
Format.eprintf "Equations not used are@.%a@.Full equation set is:@.%a@.@?" 

448 
Printers.pp_node_eqs remainder 

449 
Printers.pp_node_eqs nd.node_eqs; 

450 
assert false); 

451 
List.rev eqs_rev 

452 
end 

448  453  
449  454 
let translate_eqs node args eqs = 
450  455 
List.fold_right (fun eq args > translate_eq node args eq) eqs args;; 
Also available in: Unified diff
 corrected bugs with the inlining mode
gitsvnid: https://cavale.enseeiht.fr/svn/lustrec/lustre_compiler/trunk@329 041b043f8d7c46b2b46eef0dd855326e