Consistently use snew_dsf to allocate dsfs.

All remaining cases where a dsf was allocated via snewn(foo, int) are
removed by this change.

1 files changed, 2 insertions, 4 deletions

diff --git a/tracks.c b/tracks.c
index 728e5a6..b1145d8 100644
--- a/tracks.c
+++ b/tracks.c
@@ -1373,8 +1373,7 @@ static int solve_check_loop(game_state *state)
     /* TODO eventually we should pull this out into a solver struct and keep it
        updated as we connect squares. For now we recreate it every time we try
        this particular solver step. */
-    dsf = snewn(w*h, int);
-    dsf_init(dsf, w*h);
+    dsf = snew_dsf(w*h);
 
     /* Work out the connectedness of the current loop set. */
     for (x = 0; x < w; x++) {
@@ -1878,8 +1877,7 @@ static bool check_completion(game_state *state, bool mark)
         }
     }
 
-    dsf = snewn(w*h, int);
-    dsf_init(dsf, w*h);
+    dsf = snew_dsf(w*h);
 
     for (x = 0; x < w; x++) {
         for (y = 0; y < h; y++) {