summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
ae4bc2c)
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
blackbox : [X] gtk COMMON blackbox
slant : [X] gtk COMMON SLANT
lightup : [X] gtk COMMON lightup
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
# Auxiliary command-line programs.
solosolver : [U] solo[STANDALONE_SOLVER] malloc
}
static void draw_clue(frontend *fe, 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;
{
char p[2];
int ccol = ((x ^ y) & 1) ? COL_SLANT1 : COL_SLANT2;
}
static void draw_tile(frontend *fe, game_drawstate *ds, game_clues *clues,
}
static void draw_tile(frontend *fe, game_drawstate *ds, game_clues *clues,
{
int w = clues->w, h = clues->h, W = w+1 /*, H = h+1 */;
int chesscolour = (x ^ y) & 1;
{
int w = clues->w, h = clues->h, W = w+1 /*, H = h+1 */;
int chesscolour = (x ^ y) & 1;