mdw@git.distorted.org.uk Git - sgt/puzzles/blob - midend.c

   1 /*
   2  * midend.c: general middle fragment sitting between the
   3  * platform-specific front end and game-specific back end.
   4  * Maintains a move list, takes care of Undo and Redo commands, and
   5  * processes standard keystrokes for undo/redo/new/restart/quit.
   6  */
   7
   8 #include <stdio.h>
   9 #include <assert.h>
  10
  11 #include "puzzles.h"
  12
  13 struct midend_data {
  14     char *seed;
  15     int nstates, statesize, statepos;
  16     game_params *params;
  17     game_state **states;
  18 };
  19
  20 #define ensure(me) do { \
  21     if ((me)->nstates >= (me)->statesize) { \
  22         (me)->statesize = (me)->nstates + 128; \
  23         (me)->states = sresize((me)->states, (me)->statesize, game_state *); \
  24     } \
  25 } while (0)
  26
  27 midend_data *midend_new(void)
  28 {
  29     midend_data *me = snew(midend_data);
  30
  31     me->nstates = me->statesize = me->statepos = 0;
  32     me->states = NULL;
  33     me->params = default_params();
  34     me->seed = NULL;
  35
  36     return me;
  37 }
  38
  39 void midend_free(midend_data *me)
  40 {
  41     sfree(me->states);
  42     sfree(me->seed);
  43     free_params(me->params);
  44     sfree(me);
  45 }
  46
  47 void midend_size(midend_data *me, int *x, int *y)
  48 {
  49     game_size(me->params, x, y);
  50 }
  51
  52 void midend_set_params(midend_data *me, game_params *params)
  53 {
  54     free_params(me->params);
  55     me->params = params;
  56 }
  57
  58 void midend_new_game(midend_data *me, char *seed)
  59 {
  60     while (me->nstates > 0)
  61         free_game(me->states[--me->nstates]);
  62
  63     assert(me->nstates == 0);
  64
  65     sfree(me->seed);
  66     if (seed)
  67         me->seed = dupstr(seed);
  68     else
  69         me->seed = new_game_seed(me->params);
  70
  71     ensure(me);
  72     me->states[me->nstates++] = new_game(me->params, me->seed);
  73     me->statepos = 1;
  74 }
  75
  76 void midend_restart_game(midend_data *me)
  77 {
  78     while (me->nstates > 1)
  79         free_game(me->states[--me->nstates]);
  80     me->statepos = me->nstates;
  81 }
  82
  83 void midend_undo(midend_data *me)
  84 {
  85     if (me->statepos > 1)
  86         me->statepos--;
  87 }
  88
  89 void midend_redo(midend_data *me)
  90 {
  91     if (me->statepos < me->nstates)
  92         me->statepos++;
  93 }
  94
  95 int midend_process_key(midend_data *me, int x, int y, int button)
  96 {
  97     game_state *s;
  98
  99     if (button == 'n' || button == 'N' || button == '\x0E') {
 100         midend_new_game(me, NULL);
 101         return 1;
 102     } else if (button == 'r' || button == 'R') {
 103         midend_restart_game(me);
 104         return 1;
 105     } else if (button == 'u' || button == 'u' ||
 106                button == '\x1A' || button == '\x1F') {
 107         midend_undo(me);
 108         return 1;
 109     } else if (button == '\x12') {
 110         midend_redo(me);
 111         return 1;
 112     } else if (button == 'q' || button == 'Q' || button == '\x11') {
 113         return 0;
 114     }
 115
 116     s = make_move(me->states[me->statepos-1], x, y, button);
 117
 118     if (s) {
 119         while (me->nstates > me->statepos)
 120             free_game(me->states[--me->nstates]);
 121         ensure(me);
 122         me->states[me->nstates] = s;
 123         me->statepos = ++me->nstates;
 124     }
 125
 126     return 1;
 127 }