16-bit-cleanness fixes from James H (again). It would be really nice

to have some means of automatically spotting this sort of problem on
a desktop platform, but I can't immediately think of one; building a
trick compiler which thinks `int' is 16 bits would be the obvious
option, but it would immediately break the ABIs to all the system
functions.

git-svn-id: svn://svn.tartarus.org/sgt/puzzles@6184 cda61777-01e9-0310-a592-d414129be87e

diff --git a/Recipe b/Recipe
index 903e50b..580660e 100644 (file)
--- a/Recipe
+++ b/Recipe
@@ -46,6 +46,7 @@ untangle : [X] gtk COMMON UNTANGLE
 blackbox : [X] gtk COMMON blackbox
 slant    : [X] gtk COMMON SLANT
 lightup  : [X] gtk COMMON lightup
+map      : [X] gtk COMMON map
 
 # Auxiliary command-line programs.
 solosolver :    [U] solo[STANDALONE_SOLVER] malloc

diff --git a/slant.c b/slant.c
index 3bb5405..75a3463 100644 (file)
--- a/slant.c
+++ b/slant.c
@@ -1661,7 +1661,7 @@ static void game_free_drawstate(game_drawstate *ds)
 }
 
 static void draw_clue(frontend *fe, game_drawstate *ds,
-                     int x, int y, int v, int err)
+                     int x, int y, long v, long err)
 {
     char p[2];
     int ccol = ((x ^ y) & 1) ? COL_SLANT1 : COL_SLANT2;
@@ -1678,7 +1678,7 @@ static void draw_clue(frontend *fe, game_drawstate *ds,
 }
 
 static void draw_tile(frontend *fe, game_drawstate *ds, game_clues *clues,
-                     int x, int y, int v)
+                     int x, int y, long v)
 {
     int w = clues->w, h = clues->h, W = w+1 /*, H = h+1 */;
     int chesscolour = (x ^ y) & 1;