Cleaning

backend/Duplicateaux.ml

@@ -339,7 +339,6 @@ let get_directions f code entrypoint = begin
   let loop_info = get_loop_info f is_loop_header bfs_order code in
   let directions = ref (PTree.map (fun n i -> None) code) in (* None <=> no predicted direction *)
   begin
-    debug_flag := true;
     (* ptree_printbool is_loop_header; *)
     (* debug "\n"; *)
     List.iter (fun n ->
@@ -367,7 +366,7 @@ let get_directions f code entrypoint = begin
           end
           )
       | _ -> ()
-    ) bfs_order; debug_flag := false;
+    ) bfs_order;
     !directions
   end
 end