More efficient

backend/Duplicateaux.ml

@@ -309,14 +309,18 @@ let get_loop_info f is_loop_header bfs_order code =
   let mark_body body =
     List.iter (fun n ->
       match get_some @@ PTree.get n code with
-      | Icond (_, _, ifso, ifnot, _) ->
-          let b1 = List.mem ifso body in
-          let b2 = List.mem ifnot body in
-          if (b1 && b2) then ()
-          else if (b1 || b2) then begin
-            if b1 then loop_info := PTree.set n (Some true) !loop_info
-            else if b2 then loop_info := PTree.set n (Some false) !loop_info
-          end
+      | Icond (_, _, ifso, ifnot, _) -> begin
+          match PTree.get n !loop_info with
+          | None -> ()
+          | Some _ ->
+              let b1 = List.mem ifso body in
+              let b2 = List.mem ifnot body in
+              if (b1 && b2) then ()
+              else if (b1 || b2) then begin
+                if b1 then loop_info := PTree.set n (Some true) !loop_info
+                else if b2 then loop_info := PTree.set n (Some false) !loop_info
+              end
+        end
       | _ -> ()
     ) body
   in let bodymap = get_loop_bodies code f.fn_entrypoint in