Thanks for the summary. This two-pass approach is the same one I used in Go’s golang.org/x/tools/go/ssa package, because I was at that time unaware that there a

Thanks for the summary. This two-pass approach is the same one I used in Go’s golang.org/x/tools/go/ssa package, because I was at that time unaware that there are more efficient algorithms for constructing full SSA (with phis) in one pass, using the optimistic assumption that control flow graphs are reducible, which is nearly always true. The Go compiler’s SSA construction uses the one pass approach.