QWE

Author: hhugo

compiler/lib/flow.ml

@@ -515,18 +515,19 @@ let the_shape_of ~return_values ~pure info x =
                     let pure = Primitive.is_pure name in
                     Shape.Function { arity; pure; res = Top "unk" }
                   with _ -> Top "other")
-              | Expr (Apply { f; args; _ }) -> (
-                let shape = loop info f (Var.Set.add f acc) in
-                let rec loop n' shape =
-                  match shape with
-                  | Shape.Function { arity = n; pure; res } ->
-                      if n = n' then res
-                      else if n' < n
-                      then Shape.Function { arity = n - n'; pure; res }
-                      else loop (n' - n) res
-                  | Shape.Block _ | Shape.Top _ -> Shape.Top "apply2"
-                in
-                loop (List.length args) shape)
+              | Expr (Apply { f; args; _ }) ->
+                  let shape = loop info f (Var.Set.add f acc) in
+                  let rec loop n' shape =
+                    match shape with
+                    | Shape.Function { arity = n; pure; res } ->
+                        if n = n'
+                        then res
+                        else if n' < n
+                        then Shape.Function { arity = n - n'; pure; res }
+                        else loop (n' - n) res
+                    | Shape.Block _ | Shape.Top _ -> Shape.Top "apply2"
+                  in
+                  loop (List.length args) shape
               | _ -> Shape.Top "other"))
         (Top "init")
         (fun u v -> merge u v)

compiler/lib/shape.ml

@@ -151,9 +151,7 @@ module State = struct
 
   let mem x = BitSet.mem t.cache (Code.Var.idx x)
 
-  let get x = if mem x then Code.Var.Hashtbl.find_opt t.table x
-              else None
-
+  let get x = if mem x then Code.Var.Hashtbl.find_opt t.table x else None
 
   let is_pure_fun x =
     match Code.Var.Hashtbl.find_opt t.table x with