Project

General

Profile

« Previous | Next » 

Revision 333e3a25

Added by Pierre-Loïc Garoche over 5 years ago

[general] Refactor get_node_eqs to produce (eqs, auts) with automatons

View differences:

src/machine_code.ml
555 555 
  (* Format.eprintf "%s schedule: %a@." *)
556 556 
  (* 		 nd.node_id *)
557 557 
  (* 		 (Utils.fprintf_list ~sep:" ; " Scheduling.pp_eq_schedule) sch; *)
558 
  let split_eqs = Splitting.tuple_split_eq_list (get_node_eqs nd) in
558 
  let eqs, auts = get_node_eqs nd in
559 
  assert (auts = []); (* Automata should be expanded by now *)
560 
  let split_eqs = Splitting.tuple_split_eq_list eqs in
559 561 
  let eqs_rev, remainder =
560 562 
    List.fold_left
561 563 
      (fun (accu, node_eqs_remainder) vl ->
......
571 573 
  in
572 574 
  begin
573 575 
    if List.length remainder > 0 then (
576 
      let eqs, auts = get_node_eqs nd in
577 
      assert (auts = []); (* Automata should be expanded by now *)
574 578 
      Format.eprintf "Equations not used are@.%a@.Full equation set is:@.%a@.@?"
575 579 
		     Printers.pp_node_eqs remainder
576 
      		     Printers.pp_node_eqs (get_node_eqs nd);
580 
      		     Printers.pp_node_eqs eqs;
577 581 
      assert false);
578 582 
    List.rev eqs_rev
579 583 
  end

Also available in: Unified diff