720a8fb7 |
1 | /* |
2 | * puzzles.h: header file for my puzzle collection |
3 | */ |
4 | |
5 | #ifndef PUZZLES_PUZZLES_H |
6 | #define PUZZLES_PUZZLES_H |
7 | |
dafd6cf6 |
8 | #include <stdio.h> /* for FILE */ |
ab53eb64 |
9 | #include <stdlib.h> /* for size_t */ |
bd2b3071 |
10 | #include <limits.h> /* for UINT_MAX */ |
ab53eb64 |
11 | |
720a8fb7 |
12 | #ifndef TRUE |
13 | #define TRUE 1 |
14 | #endif |
15 | #ifndef FALSE |
16 | #define FALSE 0 |
17 | #endif |
18 | |
b2a646f1 |
19 | #define PI 3.141592653589793238462643383279502884197169399 |
20 | |
720a8fb7 |
21 | #define lenof(array) ( sizeof(array) / sizeof(*(array)) ) |
22 | |
1d8e8ad8 |
23 | #define STR_INT(x) #x |
24 | #define STR(x) STR_INT(x) |
25 | |
ab53eb64 |
26 | /* NB not perfect because they evaluate arguments multiple times. */ |
41184c24 |
27 | #ifndef max |
ab53eb64 |
28 | #define max(x,y) ( (x)>(y) ? (x) : (y) ) |
41184c24 |
29 | #endif /* max */ |
30 | #ifndef min |
ab53eb64 |
31 | #define min(x,y) ( (x)<(y) ? (x) : (y) ) |
41184c24 |
32 | #endif /* min */ |
ab53eb64 |
33 | |
720a8fb7 |
34 | enum { |
ab53eb64 |
35 | LEFT_BUTTON = 0x0200, |
720a8fb7 |
36 | MIDDLE_BUTTON, |
1482ee76 |
37 | RIGHT_BUTTON, |
74a4e547 |
38 | LEFT_DRAG, |
39 | MIDDLE_DRAG, |
40 | RIGHT_DRAG, |
41 | LEFT_RELEASE, |
42 | MIDDLE_RELEASE, |
43 | RIGHT_RELEASE, |
1482ee76 |
44 | CURSOR_UP, |
45 | CURSOR_DOWN, |
46 | CURSOR_LEFT, |
c71454c0 |
47 | CURSOR_RIGHT, |
4cd25760 |
48 | CURSOR_SELECT, |
4a9957b6 |
49 | CURSOR_SELECT2, |
3c833d45 |
50 | |
ab53eb64 |
51 | /* made smaller because of 'limited range of datatype' errors. */ |
52 | MOD_CTRL = 0x1000, |
53 | MOD_SHFT = 0x2000, |
54 | MOD_NUM_KEYPAD = 0x4000, |
55 | MOD_MASK = 0x7000 /* mask for all modifiers */ |
720a8fb7 |
56 | }; |
57 | |
6776a950 |
58 | #define IS_MOUSE_DOWN(m) ( (unsigned)((m) - LEFT_BUTTON) <= \ |
59 | (unsigned)(RIGHT_BUTTON - LEFT_BUTTON)) |
60 | #define IS_MOUSE_DRAG(m) ( (unsigned)((m) - LEFT_DRAG) <= \ |
61 | (unsigned)(RIGHT_DRAG - LEFT_DRAG)) |
62 | #define IS_MOUSE_RELEASE(m) ( (unsigned)((m) - LEFT_RELEASE) <= \ |
63 | (unsigned)(RIGHT_RELEASE - LEFT_RELEASE)) |
4a9957b6 |
64 | #define IS_CURSOR_MOVE(m) ( (m) == CURSOR_UP || (m) == CURSOR_DOWN || \ |
65 | (m) == CURSOR_RIGHT || (m) == CURSOR_LEFT ) |
66 | #define IS_CURSOR_SELECT(m) ( (m) == CURSOR_SELECT || (m) == CURSOR_SELECT2) |
6776a950 |
67 | |
2705d374 |
68 | /* |
69 | * Flags in the back end's `flags' word. |
70 | */ |
93b1da3d |
71 | /* Bit flags indicating mouse button priorities */ |
72 | #define BUTTON_BEATS(x,y) ( 1 << (((x)-LEFT_BUTTON)*3+(y)-LEFT_BUTTON) ) |
2705d374 |
73 | /* Flag indicating that Solve operations should be animated */ |
9d6c3859 |
74 | #define SOLVE_ANIMATES ( 1 << 9 ) |
cb0c7d4a |
75 | /* Pocket PC: Game requires right mouse button emulation */ |
76 | #define REQUIRE_RBUTTON ( 1 << 10 ) |
77 | /* Pocket PC: Game requires numeric input */ |
78 | #define REQUIRE_NUMPAD ( 1 << 11 ) |
2705d374 |
79 | /* end of `flags' word definitions */ |
9d6c3859 |
80 | |
cb0c7d4a |
81 | #ifdef _WIN32_WCE |
82 | /* Pocket PC devices have small, portrait screen that requires more vivid colours */ |
83 | #define SMALL_SCREEN |
84 | #define PORTRAIT_SCREEN |
85 | #define VIVID_COLOURS |
b1aca07f |
86 | #define STYLUS_BASED |
cb0c7d4a |
87 | #endif |
88 | |
4e7ef6e6 |
89 | #define IGNOREARG(x) ( (x) = (x) ) |
7f77ea24 |
90 | |
2ef96bd6 |
91 | typedef struct frontend frontend; |
c8230524 |
92 | typedef struct config_item config_item; |
dafd6cf6 |
93 | typedef struct midend midend; |
7f77ea24 |
94 | typedef struct random_state random_state; |
95 | typedef struct game_params game_params; |
96 | typedef struct game_state game_state; |
74a4e547 |
97 | typedef struct game_ui game_ui; |
2ef96bd6 |
98 | typedef struct game_drawstate game_drawstate; |
be8d5aa1 |
99 | typedef struct game game; |
3161048d |
100 | typedef struct blitter blitter; |
dafd6cf6 |
101 | typedef struct document document; |
102 | typedef struct drawing_api drawing_api; |
103 | typedef struct drawing drawing; |
104 | typedef struct psdata psdata; |
7f77ea24 |
105 | |
4efb3868 |
106 | #define ALIGN_VNORMAL 0x000 |
107 | #define ALIGN_VCENTRE 0x100 |
108 | |
109 | #define ALIGN_HLEFT 0x000 |
110 | #define ALIGN_HCENTRE 0x001 |
111 | #define ALIGN_HRIGHT 0x002 |
112 | |
113 | #define FONT_FIXED 0 |
114 | #define FONT_VARIABLE 1 |
115 | |
dafd6cf6 |
116 | /* For printing colours */ |
60aa1c74 |
117 | #define HATCH_SLASH 1 |
118 | #define HATCH_BACKSLASH 2 |
119 | #define HATCH_HORIZ 3 |
120 | #define HATCH_VERT 4 |
121 | #define HATCH_PLUS 5 |
122 | #define HATCH_X 6 |
dafd6cf6 |
123 | |
720a8fb7 |
124 | /* |
c8230524 |
125 | * Structure used to pass configuration data between frontend and |
126 | * game |
127 | */ |
95709966 |
128 | enum { C_STRING, C_CHOICES, C_BOOLEAN, C_END }; |
c8230524 |
129 | struct config_item { |
130 | /* |
131 | * `name' is never dynamically allocated. |
132 | */ |
133 | char *name; |
134 | /* |
135 | * `type' contains one of the above values. |
136 | */ |
137 | int type; |
138 | /* |
95709966 |
139 | * For C_STRING, `sval' is always dynamically allocated and |
140 | * non-NULL. For C_BOOLEAN and C_END, `sval' is always NULL. |
141 | * For C_CHOICES, `sval' is non-NULL, _not_ dynamically |
142 | * allocated, and contains a set of option strings separated by |
143 | * a delimiter. The delimeter is also the first character in |
144 | * the string, so for example ":Foo:Bar:Baz" gives three |
145 | * options `Foo', `Bar' and `Baz'. |
c8230524 |
146 | */ |
147 | char *sval; |
148 | /* |
95709966 |
149 | * For C_BOOLEAN, this is TRUE or FALSE. For C_CHOICES, it |
c8230524 |
150 | * indicates the chosen index from the `sval' list. In the |
151 | * above example, 0==Foo, 1==Bar and 2==Baz. |
152 | */ |
153 | int ival; |
154 | }; |
155 | |
156 | /* |
720a8fb7 |
157 | * Platform routines |
158 | */ |
ab53eb64 |
159 | |
7b010604 |
160 | /* We can't use #ifdef DEBUG, because Cygwin defines it by default. */ |
161 | #ifdef DEBUGGING |
ab53eb64 |
162 | #define debug(x) (debug_printf x) |
163 | void debug_printf(char *fmt, ...); |
164 | #else |
165 | #define debug(x) |
166 | #endif |
167 | |
720a8fb7 |
168 | void fatal(char *fmt, ...); |
2ef96bd6 |
169 | void frontend_default_colour(frontend *fe, float *output); |
2ef96bd6 |
170 | void deactivate_timer(frontend *fe); |
171 | void activate_timer(frontend *fe); |
cbb5549e |
172 | void get_random_seed(void **randseed, int *randseedsize); |
720a8fb7 |
173 | |
dafd6cf6 |
174 | /* |
175 | * drawing.c |
176 | */ |
83c0438f |
177 | drawing *drawing_new(const drawing_api *api, midend *me, void *handle); |
dafd6cf6 |
178 | void drawing_free(drawing *dr); |
179 | void draw_text(drawing *dr, int x, int y, int fonttype, int fontsize, |
180 | int align, int colour, char *text); |
181 | void draw_rect(drawing *dr, int x, int y, int w, int h, int colour); |
182 | void draw_line(drawing *dr, int x1, int y1, int x2, int y2, int colour); |
183 | void draw_polygon(drawing *dr, int *coords, int npoints, |
184 | int fillcolour, int outlinecolour); |
185 | void draw_circle(drawing *dr, int cx, int cy, int radius, |
186 | int fillcolour, int outlinecolour); |
a39c3aa0 |
187 | void draw_thick_line(drawing *dr, float thickness, |
188 | float x1, float y1, float x2, float y2, int colour); |
dafd6cf6 |
189 | void clip(drawing *dr, int x, int y, int w, int h); |
190 | void unclip(drawing *dr); |
191 | void start_draw(drawing *dr); |
192 | void draw_update(drawing *dr, int x, int y, int w, int h); |
193 | void end_draw(drawing *dr); |
4011952c |
194 | char *text_fallback(drawing *dr, const char *const *strings, int nstrings); |
dafd6cf6 |
195 | void status_bar(drawing *dr, char *text); |
196 | blitter *blitter_new(drawing *dr, int w, int h); |
197 | void blitter_free(drawing *dr, blitter *bl); |
3161048d |
198 | /* save puts the portion of the current display with top-left corner |
199 | * (x,y) to the blitter. load puts it back again to the specified |
200 | * coords, or else wherever it was saved from |
201 | * (if x = y = BLITTER_FROMSAVED). */ |
dafd6cf6 |
202 | void blitter_save(drawing *dr, blitter *bl, int x, int y); |
3161048d |
203 | #define BLITTER_FROMSAVED (-1) |
dafd6cf6 |
204 | void blitter_load(drawing *dr, blitter *bl, int x, int y); |
205 | void print_begin_doc(drawing *dr, int pages); |
206 | void print_begin_page(drawing *dr, int number); |
207 | void print_begin_puzzle(drawing *dr, float xm, float xc, |
208 | float ym, float yc, int pw, int ph, float wmm, |
209 | float scale); |
210 | void print_end_puzzle(drawing *dr); |
211 | void print_end_page(drawing *dr, int number); |
212 | void print_end_doc(drawing *dr); |
60aa1c74 |
213 | void print_get_colour(drawing *dr, int colour, int printing_in_colour, |
214 | int *hatch, float *r, float *g, float *b); |
dafd6cf6 |
215 | int print_mono_colour(drawing *dr, int grey); /* 0==black, 1==white */ |
60aa1c74 |
216 | int print_grey_colour(drawing *dr, float grey); |
217 | int print_hatched_colour(drawing *dr, int hatch); |
b0ad2ded |
218 | int print_rgb_mono_colour(drawing *dr, float r, float g, float b, int mono); |
60aa1c74 |
219 | int print_rgb_grey_colour(drawing *dr, float r, float g, float b, float grey); |
220 | int print_rgb_hatched_colour(drawing *dr, float r, float g, float b, |
221 | int hatch); |
dafd6cf6 |
222 | void print_line_width(drawing *dr, int width); |
e91f8f26 |
223 | void print_line_dotted(drawing *dr, int dotted); |
3161048d |
224 | |
720a8fb7 |
225 | /* |
7f77ea24 |
226 | * midend.c |
227 | */ |
dafd6cf6 |
228 | midend *midend_new(frontend *fe, const game *ourgame, |
229 | const drawing_api *drapi, void *drhandle); |
230 | void midend_free(midend *me); |
95568cbb |
231 | const game *midend_which_game(midend *me); |
dafd6cf6 |
232 | void midend_set_params(midend *me, game_params *params); |
821ab2c6 |
233 | game_params *midend_get_params(midend *me); |
8c4ea6f0 |
234 | void midend_size(midend *me, int *x, int *y, int user_size); |
dafd6cf6 |
235 | void midend_new_game(midend *me); |
236 | void midend_restart_game(midend *me); |
237 | void midend_stop_anim(midend *me); |
238 | int midend_process_key(midend *me, int x, int y, int button); |
239 | void midend_force_redraw(midend *me); |
240 | void midend_redraw(midend *me); |
241 | float *midend_colours(midend *me, int *ncolours); |
afc306fc |
242 | void midend_freeze_timer(midend *me, float tprop); |
dafd6cf6 |
243 | void midend_timer(midend *me, float tplus); |
244 | int midend_num_presets(midend *me); |
245 | void midend_fetch_preset(midend *me, int n, |
eb2ad6f1 |
246 | char **name, game_params **params); |
f92acd1a |
247 | int midend_which_preset(midend *me); |
dafd6cf6 |
248 | int midend_wants_statusbar(midend *me); |
821ab2c6 |
249 | enum { CFG_SETTINGS, CFG_SEED, CFG_DESC, CFG_FRONTEND_SPECIFIC }; |
dafd6cf6 |
250 | config_item *midend_get_config(midend *me, int which, char **wintitle); |
251 | char *midend_set_config(midend *me, int which, config_item *cfg); |
252 | char *midend_game_id(midend *me, char *id); |
253 | char *midend_get_game_id(midend *me); |
fa3abef5 |
254 | int midend_can_format_as_text_now(midend *me); |
dafd6cf6 |
255 | char *midend_text_format(midend *me); |
256 | char *midend_solve(midend *me); |
1cea529f |
257 | int midend_status(midend *me); |
ea6ffc86 |
258 | int midend_can_undo(midend *me); |
259 | int midend_can_redo(midend *me); |
dafd6cf6 |
260 | void midend_supersede_game_desc(midend *me, char *desc, char *privdesc); |
261 | char *midend_rewrite_statusbar(midend *me, char *text); |
262 | void midend_serialise(midend *me, |
a4393230 |
263 | void (*write)(void *ctx, void *buf, int len), |
264 | void *wctx); |
dafd6cf6 |
265 | char *midend_deserialise(midend *me, |
a4393230 |
266 | int (*read)(void *ctx, void *buf, int len), |
267 | void *rctx); |
95568cbb |
268 | char *identify_game(char **name, int (*read)(void *ctx, void *buf, int len), |
269 | void *rctx); |
dafd6cf6 |
270 | /* Printing functions supplied by the mid-end */ |
271 | char *midend_print_puzzle(midend *me, document *doc, int with_soln); |
dc3de726 |
272 | int midend_tilesize(midend *me); |
7f77ea24 |
273 | |
274 | /* |
720a8fb7 |
275 | * malloc.c |
276 | */ |
ab53eb64 |
277 | void *smalloc(size_t size); |
278 | void *srealloc(void *p, size_t size); |
720a8fb7 |
279 | void sfree(void *p); |
ab30d7be |
280 | char *dupstr(const char *s); |
720a8fb7 |
281 | #define snew(type) \ |
282 | ( (type *) smalloc (sizeof (type)) ) |
283 | #define snewn(number, type) \ |
284 | ( (type *) smalloc ((number) * sizeof (type)) ) |
285 | #define sresize(array, number, type) \ |
7f77ea24 |
286 | ( (type *) srealloc ((array), (number) * sizeof (type)) ) |
720a8fb7 |
287 | |
288 | /* |
4efb3868 |
289 | * misc.c |
290 | */ |
077f3cbe |
291 | void free_cfg(config_item *cfg); |
74476385 |
292 | void obfuscate_bitmap(unsigned char *bmp, int bits, int decode); |
293 | |
294 | /* allocates output each time. len is always in bytes of binary data. |
295 | * May assert (or just go wrong) if lengths are unchecked. */ |
296 | char *bin2hex(const unsigned char *in, int inlen); |
297 | unsigned char *hex2bin(const char *in, int outlen); |
298 | |
937a9eff |
299 | /* Sets (and possibly dims) background from frontend default colour, |
300 | * and auto-generates highlight and lowlight colours too. */ |
301 | void game_mkhighlight(frontend *fe, float *ret, |
302 | int background, int highlight, int lowlight); |
de344430 |
303 | /* As above, but starts from a provided background colour rather |
304 | * than the frontend default. */ |
305 | void game_mkhighlight_specific(frontend *fe, float *ret, |
306 | int background, int highlight, int lowlight); |
4efb3868 |
307 | |
c8305fa8 |
308 | /* Randomly shuffles an array of items. */ |
309 | void shuffle(void *array, int nelts, int eltsize, random_state *rs); |
310 | |
dafd6cf6 |
311 | /* Draw a rectangle outline, using the drawing API's draw_line. */ |
312 | void draw_rect_outline(drawing *dr, int x, int y, int w, int h, |
bf7ebf5a |
313 | int colour); |
314 | |
f4e23980 |
315 | /* Draw a set of rectangle corners (e.g. for a cursor display). */ |
316 | void draw_rect_corners(drawing *dr, int cx, int cy, int r, int col); |
317 | |
4a9957b6 |
318 | void move_cursor(int button, int *x, int *y, int maxw, int maxh, int wrap); |
319 | |
320 | /* Used in netslide.c and sixteen.c for cursor movement around edge. */ |
321 | int c2pos(int w, int h, int cx, int cy); |
3e17893b |
322 | int c2diff(int w, int h, int cx, int cy, int button); |
4a9957b6 |
323 | void pos2c(int w, int h, int pos, int *cx, int *cy); |
324 | |
325 | /* Draws text with an 'outline' formed by offsetting the text |
326 | * by one pixel; useful for highlighting. Outline is omitted if -1. */ |
327 | void draw_text_outline(drawing *dr, int x, int y, int fonttype, |
328 | int fontsize, int align, |
329 | int text_colour, int outline_colour, char *text); |
4efb3868 |
330 | /* |
f1010613 |
331 | * dsf.c |
332 | */ |
121aae4b |
333 | int *snew_dsf(int size); |
334 | |
335 | void print_dsf(int *dsf, int size); |
336 | |
337 | /* Return the canonical element of the equivalence class containing element |
338 | * val. If 'inverse' is non-NULL, this function will put into it a flag |
339 | * indicating whether the canonical element is inverse to val. */ |
340 | int edsf_canonify(int *dsf, int val, int *inverse); |
f1010613 |
341 | int dsf_canonify(int *dsf, int val); |
8b3b3223 |
342 | int dsf_size(int *dsf, int val); |
121aae4b |
343 | |
344 | /* Allow the caller to specify that two elements should be in the same |
345 | * equivalence class. If 'inverse' is TRUE, the elements are actually opposite |
346 | * to one another in some sense. This function will fail an assertion if the |
347 | * caller gives it self-contradictory data, ie if two elements are claimed to |
348 | * be both opposite and non-opposite. */ |
349 | void edsf_merge(int *dsf, int v1, int v2, int inverse); |
f1010613 |
350 | void dsf_merge(int *dsf, int v1, int v2); |
66a74a18 |
351 | void dsf_init(int *dsf, int len); |
f1010613 |
352 | |
353 | /* |
b760b8bd |
354 | * tdq.c |
355 | */ |
356 | |
357 | /* |
358 | * Data structure implementing a 'to-do queue', a simple |
359 | * de-duplicating to-do list mechanism. |
360 | * |
361 | * Specification: a tdq is a queue which can hold integers from 0 to |
362 | * n-1, where n was some constant specified at tdq creation time. No |
363 | * integer may appear in the queue's current contents more than once; |
364 | * an attempt to add an already-present integer again will do nothing, |
365 | * so that that integer is removed from the queue at the position |
366 | * where it was _first_ inserted. The add and remove operations take |
367 | * constant time. |
368 | * |
369 | * The idea is that you might use this in applications like solvers: |
370 | * keep a tdq listing the indices of grid squares that you currently |
371 | * need to process in some way. Whenever you modify a square in a way |
372 | * that will require you to re-scan its neighbours, add them to the |
373 | * list with tdq_add; meanwhile you're constantly taking elements off |
374 | * the list when you need another square to process. In solvers where |
375 | * deductions are mostly localised, this should prevent repeated |
376 | * O(N^2) loops over the whole grid looking for something to do. (But |
377 | * if only _most_ of the deductions are localised, then you should |
378 | * respond to an empty to-do list by re-adding everything using |
379 | * tdq_fill, so _then_ you rescan the whole grid looking for newly |
380 | * enabled non-local deductions. Only if you've done that and emptied |
381 | * the list again finding nothing new to do are you actually done.) |
382 | */ |
383 | typedef struct tdq tdq; |
384 | tdq *tdq_new(int n); |
385 | void tdq_free(tdq *tdq); |
386 | void tdq_add(tdq *tdq, int k); |
387 | int tdq_remove(tdq *tdq); /* returns -1 if nothing available */ |
388 | void tdq_fill(tdq *tdq); /* add everything to the tdq at once */ |
389 | |
390 | /* |
4700b849 |
391 | * laydomino.c |
392 | */ |
393 | int *domino_layout(int w, int h, random_state *rs); |
394 | void domino_layout_prealloc(int w, int h, random_state *rs, |
395 | int *grid, int *grid2, int *list); |
396 | /* |
97098757 |
397 | * version.c |
398 | */ |
399 | extern char ver[]; |
400 | |
401 | /* |
720a8fb7 |
402 | * random.c |
403 | */ |
1fbb0680 |
404 | random_state *random_new(char *seed, int len); |
e9f8a17f |
405 | random_state *random_copy(random_state *tocopy); |
48d70ca9 |
406 | unsigned long random_bits(random_state *state, int bits); |
720a8fb7 |
407 | unsigned long random_upto(random_state *state, unsigned long limit); |
408 | void random_free(random_state *state); |
c380832d |
409 | char *random_state_encode(random_state *state); |
410 | random_state *random_state_decode(char *input); |
7959b517 |
411 | /* random.c also exports SHA, which occasionally comes in useful. */ |
bd2b3071 |
412 | #if __STDC_VERSION__ >= 199901L |
413 | #include <stdint.h> |
414 | typedef uint32_t uint32; |
415 | #elif UINT_MAX >= 4294967295L |
416 | typedef unsigned int uint32; |
417 | #else |
7959b517 |
418 | typedef unsigned long uint32; |
bd2b3071 |
419 | #endif |
7959b517 |
420 | typedef struct { |
421 | uint32 h[5]; |
422 | unsigned char block[64]; |
423 | int blkused; |
424 | uint32 lenhi, lenlo; |
425 | } SHA_State; |
426 | void SHA_Init(SHA_State *s); |
427 | void SHA_Bytes(SHA_State *s, void *p, int len); |
428 | void SHA_Final(SHA_State *s, unsigned char *output); |
429 | void SHA_Simple(void *p, int len, unsigned char *output); |
720a8fb7 |
430 | |
431 | /* |
dafd6cf6 |
432 | * printing.c |
433 | */ |
434 | document *document_new(int pw, int ph, float userscale); |
435 | void document_free(document *doc); |
436 | void document_add_puzzle(document *doc, const game *game, game_params *par, |
437 | game_state *st, game_state *st2); |
438 | void document_print(document *doc, drawing *dr); |
439 | |
440 | /* |
441 | * ps.c |
442 | */ |
443 | psdata *ps_init(FILE *outfile, int colour); |
444 | void ps_free(psdata *ps); |
445 | drawing *ps_drawing_api(psdata *ps); |
446 | |
447 | /* |
9b265feb |
448 | * combi.c: provides a structure and functions for iterating over |
449 | * combinations (i.e. choosing r things out of n). |
450 | */ |
451 | typedef struct _combi_ctx { |
452 | int r, n, nleft, total; |
453 | int *a; |
454 | } combi_ctx; |
455 | |
456 | combi_ctx *new_combi(int r, int n); |
457 | void reset_combi(combi_ctx *combi); |
458 | combi_ctx *next_combi(combi_ctx *combi); /* returns NULL for end */ |
459 | void free_combi(combi_ctx *combi); |
460 | |
461 | /* |
fbd0fc79 |
462 | * divvy.c |
463 | */ |
464 | /* divides w*h rectangle into pieces of size k. Returns w*h dsf. */ |
465 | int *divvy_rectangle(int w, int h, int k, random_state *rs); |
466 | |
467 | /* |
be8d5aa1 |
468 | * Data structure containing the function calls and data specific |
469 | * to a particular game. This is enclosed in a data structure so |
470 | * that a particular platform can choose, if it wishes, to compile |
471 | * all the games into a single combined executable rather than |
472 | * having lots of little ones. |
720a8fb7 |
473 | */ |
be8d5aa1 |
474 | struct game { |
475 | const char *name; |
750037d7 |
476 | const char *winhelp_topic, *htmlhelp_topic; |
be8d5aa1 |
477 | game_params *(*default_params)(void); |
478 | int (*fetch_preset)(int i, char **name, game_params **params); |
1185e3c5 |
479 | void (*decode_params)(game_params *, char const *string); |
480 | char *(*encode_params)(game_params *, int full); |
be8d5aa1 |
481 | void (*free_params)(game_params *params); |
482 | game_params *(*dup_params)(game_params *params); |
1d228b10 |
483 | int can_configure; |
be8d5aa1 |
484 | config_item *(*configure)(game_params *params); |
485 | game_params *(*custom_params)(config_item *cfg); |
3ff276f2 |
486 | char *(*validate_params)(game_params *params, int full); |
1185e3c5 |
487 | char *(*new_desc)(game_params *params, random_state *rs, |
c566778e |
488 | char **aux, int interactive); |
1185e3c5 |
489 | char *(*validate_desc)(game_params *params, char *desc); |
dafd6cf6 |
490 | game_state *(*new_game)(midend *me, game_params *params, char *desc); |
be8d5aa1 |
491 | game_state *(*dup_game)(game_state *state); |
492 | void (*free_game)(game_state *state); |
2ac6d24e |
493 | int can_solve; |
df11cd4e |
494 | char *(*solve)(game_state *orig, game_state *curr, |
c566778e |
495 | char *aux, char **error); |
fa3abef5 |
496 | int can_format_as_text_ever; |
497 | int (*can_format_as_text_now)(game_params *params); |
9b4b03d3 |
498 | char *(*text_format)(game_state *state); |
be8d5aa1 |
499 | game_ui *(*new_ui)(game_state *state); |
500 | void (*free_ui)(game_ui *ui); |
ae8290c6 |
501 | char *(*encode_ui)(game_ui *ui); |
502 | void (*decode_ui)(game_ui *ui, char *encoding); |
07dfb697 |
503 | void (*changed_state)(game_ui *ui, game_state *oldstate, |
504 | game_state *newstate); |
e1f3c707 |
505 | char *(*interpret_move)(game_state *state, game_ui *ui, |
506 | const game_drawstate *ds, int x, int y, int button); |
df11cd4e |
507 | game_state *(*execute_move)(game_state *state, char *move); |
1f3ee4ee |
508 | int preferred_tilesize; |
509 | void (*compute_size)(game_params *params, int tilesize, int *x, int *y); |
dafd6cf6 |
510 | void (*set_size)(drawing *dr, game_drawstate *ds, |
511 | game_params *params, int tilesize); |
8266f3fc |
512 | float *(*colours)(frontend *fe, int *ncolours); |
dafd6cf6 |
513 | game_drawstate *(*new_drawstate)(drawing *dr, game_state *state); |
514 | void (*free_drawstate)(drawing *dr, game_drawstate *ds); |
515 | void (*redraw)(drawing *dr, game_drawstate *ds, game_state *oldstate, |
be8d5aa1 |
516 | game_state *newstate, int dir, game_ui *ui, float anim_time, |
517 | float flash_time); |
e3f21163 |
518 | float (*anim_length)(game_state *oldstate, game_state *newstate, int dir, |
519 | game_ui *ui); |
520 | float (*flash_length)(game_state *oldstate, game_state *newstate, int dir, |
521 | game_ui *ui); |
1cea529f |
522 | int (*status)(game_state *state); |
dafd6cf6 |
523 | int can_print, can_print_in_colour; |
524 | void (*print_size)(game_params *params, float *x, float *y); |
525 | void (*print)(drawing *dr, game_state *state, int tilesize); |
ac9f41c4 |
526 | int wants_statusbar; |
48dcdd62 |
527 | int is_timed; |
4d08de49 |
528 | int (*timing_state)(game_state *state, game_ui *ui); |
2705d374 |
529 | int flags; |
be8d5aa1 |
530 | }; |
531 | |
532 | /* |
dafd6cf6 |
533 | * Data structure containing the drawing API implemented by the |
534 | * front end and also by cross-platform printing modules such as |
535 | * PostScript. |
536 | */ |
537 | struct drawing_api { |
538 | void (*draw_text)(void *handle, int x, int y, int fonttype, int fontsize, |
539 | int align, int colour, char *text); |
540 | void (*draw_rect)(void *handle, int x, int y, int w, int h, int colour); |
541 | void (*draw_line)(void *handle, int x1, int y1, int x2, int y2, |
542 | int colour); |
543 | void (*draw_polygon)(void *handle, int *coords, int npoints, |
544 | int fillcolour, int outlinecolour); |
545 | void (*draw_circle)(void *handle, int cx, int cy, int radius, |
546 | int fillcolour, int outlinecolour); |
547 | void (*draw_update)(void *handle, int x, int y, int w, int h); |
548 | void (*clip)(void *handle, int x, int y, int w, int h); |
549 | void (*unclip)(void *handle); |
550 | void (*start_draw)(void *handle); |
551 | void (*end_draw)(void *handle); |
552 | void (*status_bar)(void *handle, char *text); |
553 | blitter *(*blitter_new)(void *handle, int w, int h); |
554 | void (*blitter_free)(void *handle, blitter *bl); |
555 | void (*blitter_save)(void *handle, blitter *bl, int x, int y); |
556 | void (*blitter_load)(void *handle, blitter *bl, int x, int y); |
557 | void (*begin_doc)(void *handle, int pages); |
558 | void (*begin_page)(void *handle, int number); |
559 | void (*begin_puzzle)(void *handle, float xm, float xc, |
560 | float ym, float yc, int pw, int ph, float wmm); |
561 | void (*end_puzzle)(void *handle); |
562 | void (*end_page)(void *handle, int number); |
563 | void (*end_doc)(void *handle); |
564 | void (*line_width)(void *handle, float width); |
e91f8f26 |
565 | void (*line_dotted)(void *handle, int dotted); |
4011952c |
566 | char *(*text_fallback)(void *handle, const char *const *strings, |
567 | int nstrings); |
a39c3aa0 |
568 | void (*draw_thick_line)(void *handle, float thickness, |
569 | float x1, float y1, float x2, float y2, |
570 | int colour); |
dafd6cf6 |
571 | }; |
572 | |
573 | /* |
be8d5aa1 |
574 | * For one-game-at-a-time platforms, there's a single structure |
19ef4855 |
575 | * like the above, under a fixed name. For all-at-once platforms, |
576 | * there's a list of all available puzzles in array form. |
be8d5aa1 |
577 | */ |
19ef4855 |
578 | #ifdef COMBINED |
579 | extern const game *gamelist[]; |
580 | extern const int gamecount; |
581 | #else |
be8d5aa1 |
582 | extern const game thegame; |
583 | #endif |
720a8fb7 |
584 | |
585 | #endif /* PUZZLES_PUZZLES_H */ |