make fmt

middle_end/flambda2/simplify/apply_cont_rewrite.ml

@@ -167,7 +167,8 @@ let make_rewrite rewrite ~ctx id args =
            required extra args might not be needed as argument to the
            continuation. But we want to keep the let bindings.
            [required_by_other_extra_args] tracks that dependency. It is the set
-           of free variables of [extra_args_rev] and [extra_invariant_args_rev] *)
+           of free variables of [extra_args_rev] and
+           [extra_invariant_args_rev] *)
         let extra_arg, extra_let, free_names, defined_names =
           match arg with
           | Already_in_scope simple ->

middle_end/flambda2/simplify/unboxing/optimistic_unboxing_decision.mli

@@ -14,23 +14,22 @@
 (*                                                                        *)
 (**************************************************************************)
 
-(** Unfold a continuation parameter's type into an unboxing decision tree. This
-    does not take account of the types of the corresponding arguments at the
-    continuation's use site(s). *)
 (* Note that, if the continuation is recursive, we need to prevent generating
-   decisions that unbox variants and closures, as we cannot be sure that reasonable
-   extra_args can be computed for all use sites, since we have not yet seen all
-   use sites at this point. For instance: *)
+   decisions that unbox variants and closures, as we cannot be sure that
+   reasonable extra_args can be computed for all use sites, since we have not
+   yet seen all use sites at this point. For instance: *)
 (*
  * let rec cont k x y =
  *   switch y with
  *   | 0 -> k (Some x)
  *   | 1 -> k (f x) (* for some function f in scope *)
  *)
 (* In this case, even if we know that x is an option, to unbox it we'd need to
-   introduce a switch in the `1` branch. This is:
-   1) not implemented (although technically possible)
-   2) not efficient or beneficial in most cases. *)
+   introduce a switch in the `1` branch. This is: 1) not implemented (although
+   technically possible) 2) not efficient or beneficial in most cases. *)
+(** Unfold a continuation parameter's type into an unboxing decision tree. This
+    does not take account of the types of the corresponding arguments at the
+    continuation's use site(s). *)
 val make_optimistic_decision :
   depth:int ->
   recursive:bool ->