[WTO] Make `expand` tail recursive

Summary:
In some corner cases where there are a lot of sequential statements, it raised stack overflow.  To
avoid the issue, this diff changes the function as tail recursive by passing a callback function.

Reviewed By: ngorogiannis

Differential Revision: D26668338

fbshipit-source-id: 822d9a5f8

infer/src/IR/WeakTopologicalOrder.ml

@@ -47,25 +47,27 @@ module Partition = struct
         (fold_heads [@tailcall]) next ~init ~f
 
 
-  let rec expand ~fold_right partition =
-    match partition with
+  let expand ~fold_right partition =
+    let rec expand_aux ~cb = function
       | Empty ->
-        Empty
+          cb Empty
       | Node {node; next} ->
-        let init = expand ~fold_right next in
-        fold_right node ~init ~f:prepend_node
-    | Component {head; rest; next} -> (
-        let next = expand ~fold_right next in
-        let init = expand ~fold_right rest in
+          (expand_aux [@tailcall]) next ~cb:(fun init ->
+              fold_right node ~init ~f:prepend_node |> cb )
+      | Component {head; rest; next} ->
+          (expand_aux [@tailcall]) next ~cb:(fun next ->
+              (expand_aux [@tailcall]) rest ~cb:(fun init ->
                   match fold_right head ~init ~f:prepend_node with
                   | Empty | Component _ ->
-            (* [fold_right] is expected to always provide a non-empty sequence.
-               Hence the result of [fold_right ~f:prepend_node] will always start with a Node. *)
+                      (* [fold_right] is expected to always provide a non-empty sequence.  Hence the
+                         result of [fold_right ~f:prepend_node] will always start with a Node. *)
                       Logging.(die InternalError)
-              "WeakTopologicalOrder.Partition.expand: the expansion function fold_right should not \
-               return ~init directly"
+                        "WeakTopologicalOrder.Partition.expand: the expansion function fold_right \
+                         should not return ~init directly"
                   | Node {node= head; next= rest} ->
-            Component {head; rest; next} )
+                      cb (Component {head; rest; next}) ) )
+    in
+    expand_aux ~cb:IStd.ident partition
 
 
   let rec pp ~prefix ~pp_node fmt = function