ok

Signed-off-by: Takeshi Yoneda <[email protected]>

internal/engine/wazevo/backend/regalloc/regalloc.go

@@ -449,7 +449,7 @@ func (a *Allocator) loopTreeDFS(entry Block) {
 // The algorithm here is derived from the Go compiler's allocator https://github.com/golang/go/blob/release-branch.go1.21/src/cmd/compile/internal/ssa/regalloc.go
 // In short, this is a simply linear scan register allocation where each block inherits the register allocation state from
 // one of its predecessors. Each block inherits the selected state and starts allocation from there.
-// If there's a discrepancy, the adjustments are made by spilling the values after allocation is done (which we call "fixing merge state").
+// If there's a discrepancy in the end states between predecessors, the adjustments are made to ensure consistency after allocation is done (which we call "fixing merge state").
 // The spill instructions (store into the dedicated slots) are inserted after all the allocations and fixing merge states. That is because
 // at the point, we all know where the reloads happen, and therefore we can know the best place to spill the values. More precisely,
 // the spill happens in the block that is the lowest common ancestor of all the blocks that reloads the value.