sol.c

   1 #define _DEFAULT_SOURCE /* for getopt, sigaction, usleep */
   2 #include <poll.h>
   3 #include <signal.h>
   4 #include <stdio.h>
   5 #include <stdlib.h>
   6 #include <sys/ioctl.h>
   7 #include <time.h>
   8 #include <termios.h>
   9 #include <unistd.h>
  10
  11 #include "sol.h"
  12 #include "schemes.h"
  13
  14 struct playfield f;
  15 struct opts op;
  16
  17 // action table {{{
  18 /* stores a function pointer for every takeable action; called by game loop */
  19 int (*action[NUM_PLACES][10])(int,int,int) = {
  20 #ifdef KLONDIKE
  21         /* 1    2    3    4    5    6    7   stk  wst  fnd*/
  22 /* 1 */ { t2f, t2t, t2t, t2t, t2t, t2t, t2t, nop, nop, t2f },
  23 /* 2 */ { t2t, t2f, t2t, t2t, t2t, t2t, t2t, nop, nop, t2f },
  24 /* 3 */ { t2t, t2t, t2f, t2t, t2t, t2t, t2t, nop, nop, t2f },
  25 /* 4 */ { t2t, t2t, t2t, t2f, t2t, t2t, t2t, nop, nop, t2f },
  26 /* 5 */ { t2t, t2t, t2t, t2t, t2f, t2t, t2t, nop, nop, t2f },
  27 /* 6 */ { t2t, t2t, t2t, t2t, t2t, t2f, t2t, nop, nop, t2f },
  28 /* 7 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2f, nop, nop, t2f },
  29 /*stk*/ { nop, nop, nop, nop, nop, nop, nop, nop, s2w, nop },
  30 /*wst*/ { w2t, w2t, w2t, w2t, w2t, w2t, w2t, w2s, w2f, w2f },
  31 /*fnd*/ { f2t, f2t, f2t, f2t, f2t, f2t, f2t, nop, nop, nop },
  32 #elif defined SPIDER
  33         /* 1    2    3    4    5    6    7    8    9    10*/
  34 /* 1 */ { t2f, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t },
  35 /* 2 */ { t2t, t2f, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t },
  36 /* 3 */ { t2t, t2t, t2f, t2t, t2t, t2t, t2t, t2t, t2t, t2t },
  37 /* 4 */ { t2t, t2t, t2t, t2f, t2t, t2t, t2t, t2t, t2t, t2t },
  38 /* 5 */ { t2t, t2t, t2t, t2t, t2f, t2t, t2t, t2t, t2t, t2t },
  39 /* 6 */ { t2t, t2t, t2t, t2t, t2t, t2f, t2t, t2t, t2t, t2t },
  40 /* 7 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2f, t2t, t2t, t2t },
  41 /* 8 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2f, t2t, t2t },
  42 /* 9 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2f, t2t },
  43 /*10 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2f },
  44 /*stk*/ { s2t, s2t, s2t, s2t, s2t, s2t, s2t, s2t, s2t, s2t },
  45 #endif
  46 };
  47 // }}}
  48
  49 // argv parsing, game loops, cleanup {{{
  50 int main(int argc, char** argv) {
  51         /* opinionated defaults: */
  52         op.s = &unicode_large_color;
  53 #ifdef SPIDER
  54         op.m = MEDIUM;
  55 #endif
  56
  57         int optget;
  58         opterr = 0; /* don't print message on unrecognized option */
  59         while ((optget = getopt (argc, argv, "+:hs:vbcm")) != -1) {
  60                 switch (optget) {
  61 #ifdef SPIDER
  62                 case 's': /* number of suits */
  63                         switch (optarg[0]) {
  64                         case '1': op.m = EASY; break;
  65                         case '2': op.m = MEDIUM; break;
  66                         case '4': op.m = NORMAL; break;
  67                         default: goto error;
  68                         } break;
  69 #endif
  70                 case 'b': op.s = &unicode_large_mono; break;
  71                 case 'c': op.s = &unicode_large_color; break;
  72                 case 'm': op.s = &unicode_small_mono; break; /* "mini" */
  73                 case 'h': default: goto error;
  74                 error:
  75                         fprintf (stderr, SHORTHELP LONGHELP KEYHELP, argv[0]);
  76                         return optget != 'h';
  77                 }
  78         }
  79
  80         signal_setup();
  81         atexit (*quit);
  82
  83         signal_handler(SIGWINCH); /* initialize window size */
  84
  85 newgame:
  86         screen_setup(1);
  87
  88         switch(sol()) {
  89         case GAME_NEW: goto newgame;
  90         case GAME_WON:
  91                 print_table(NO_HI, NO_HI);
  92                 win_anim();
  93                 if (getch(NULL)=='q') return 0;
  94                 goto newgame;
  95         case GAME_QUIT: return 0;
  96         }
  97 }
  98
  99 int sol(void) {
 100         int ret;
 101         long seed = time(NULL);
 102 restart:
 103         free_undo(f.u);
 104         deal(seed);
 105
 106         int from, to, opt;
 107         for(;;) {
 108                 switch (get_cmd(&from, &to, &opt)) {
 109                 case CMD_MOVE:
 110                         ret = action[from][to](from,to,opt);
 111                         if (ret == ERR) /* try again with from/to swapped: */
 112                                 ret = action[to][from](to,from,opt);
 113                         switch (ret) {
 114                         case OK:  break;
 115                         case ERR: visbell(); break;
 116                         case WON: return GAME_WON;
 117                         }
 118                         break;
 119                 case CMD_JOIN:
 120                         switch (join(to)) {
 121                         case OK:  break;
 122                         case ERR: visbell(); break;
 123                         case WON: return GAME_WON;
 124                         }
 125                         break;
 126                 case CMD_HINT:  break;//TODO: show a possible (and sensible) move. if possible, involve active cursor
 127                 case CMD_UNDO:  undo_pop(f.u); break;
 128                 case CMD_INVAL: visbell(); break;
 129                 case CMD_NEW:   return GAME_NEW;
 130                 case CMD_AGAIN: goto restart;
 131                 case CMD_QUIT:  return GAME_QUIT;
 132                 }
 133         }
 134 }
 135
 136 void quit(void) {
 137         screen_setup(0);
 138         free_undo(f.u);
 139 }
 140 //}}}
 141
 142 // card games helper functions {{{
 143 #define get_suit(card) \
 144         ((card-1) % NUM_SUITS)
 145 #define get_rank(card) \
 146         ((card-1) / NUM_SUITS)
 147 #define get_color(card) \
 148         ((get_suit(card) ^ get_suit(card)>>1) & 1)
 149
 150 #define is_tableu(where) (where <= TAB_MAX)
 151
 152 int find_top(card_t* pile) {
 153         int i;
 154         for(i=PILE_SIZE-1; i>=0 && !pile[i]; i--);
 155         return i;
 156 }
 157 int first_movable(card_t* pile) {
 158         int i = 0;
 159         for (;pile[i] && !is_movable(pile, i); i++);
 160         return i;
 161 }
 162 int turn_over(card_t* pile) {
 163         int top = find_top(pile);
 164         if (pile[top] < 0) {
 165                 pile[top] *= -1;
 166                 return 1;
 167         } else return 0;
 168 }
 169 int check_won(void) {
 170         for (int pile = 0; pile < NUM_DECKS*NUM_SUITS; pile++)
 171                 if (f.f[pile][NUM_RANKS-1] == NO_CARD) return 0;
 172
 173         return 1;
 174 }
 175 int rank_next (card_t a, card_t b) {
 176         return get_rank(a) == get_rank(b)-1;
 177 }
 178 int is_consecutive (card_t* pile, int pos) {
 179         if (pos+1 >= PILE_SIZE) return 1; /* card is last */
 180         if (pile[pos+1] == NO_CARD) return 1; /* card is first */
 181
 182 #ifdef KLONDIKE
 183         /* ranks consecutive? */
 184         if (!rank_next(pile[pos+1], pile[pos])) return 0;
 185         /* color opposite? */
 186         if (get_color(pile[pos+1]) == get_color(pile[pos])) return 0;
 187 #elif defined SPIDER
 188         /* ranks consecutive? */
 189         if (!rank_next(pile[pos+1], pile[pos])) return 0;
 190         /* same suit? */
 191         if (get_suit(pile[pos+1]) != get_suit(pile[pos])) return 0;
 192 #endif
 193
 194         return 1;
 195 }
 196
 197 int is_movable(card_t* pile, int n) {
 198 #ifdef KLONDIKE
 199         return(pile[n] > NO_CARD); /*non-movable cards don't exist in klondike*/
 200 #elif defined SPIDER
 201         int top = find_top(pile);
 202         for (int i = top; i >= 0; i--) {
 203                 if (pile[i] <= NO_CARD) return 0; /*no card or card face down?*/
 204                 if (!is_consecutive(pile, i)) return 0;
 205                 if (i == n) return 1; /* card reached, must be movable */
 206         }
 207         return 0;
 208 #endif
 209 }
 210 //}}}
 211
 212 // takeable actions {{{
 213 #ifdef KLONDIKE
 214 card_t stack_take(void) { /*NOTE: assert(f.w >= 0) */
 215         card_t card = f.s[f.w];
 216         /* move stack one over, so there are no gaps in it: */
 217         for (int i = f.w; i < f.z-1; i++)
 218                 f.s[i] = f.s[i+1];
 219         f.z--;
 220         f.w--; /* make previous card visible again */
 221         return card;
 222 }
 223 int t2f(int from, int to, int opt) { /* tableu to foundation */
 224         (void) to; (void) opt; /* don't need */
 225         int top_from = find_top(f.t[from]);
 226         to = get_suit(f.t[from][top_from]);
 227         int top_to   = find_top(f.f[to]);
 228         if ((top_to < 0 && get_rank(f.t[from][top_from]) == RANK_A)
 229         || (top_to >= 0 && rank_next(f.f[to][top_to],f.t[from][top_from]))) {
 230                 f.f[to][top_to+1] = f.t[from][top_from];
 231                 f.t[from][top_from] = NO_CARD;
 232                 undo_push(from, FOUNDATION, to,
 233                 turn_over(f.t[from]));
 234                 if (check_won()) return WON;
 235                 return OK;
 236         } else return ERR;
 237 }
 238 int w2f(int from, int to, int opt) { /* waste to foundation */
 239         (void) from; (void) to; (void) opt; /* don't need */
 240         if (f.w < 0) return ERR;
 241         to = get_suit(f.s[f.w]);
 242         int top_to = find_top(f.f[to]);
 243         if ((top_to < 0 && get_rank(f.s[f.w]) == RANK_A)
 244         || (top_to >= 0 && rank_next(f.f[to][top_to], f.s[f.w]))) {
 245                 undo_push(WASTE, FOUNDATION, f.w | to<<16, 0);//ugly encoding :|
 246                 f.f[to][top_to+1] = stack_take();
 247                 if (check_won()) return WON;
 248                 return OK;
 249         } else return ERR;
 250
 251 }
 252 int s2w(int from, int to, int opt) { /* stock to waste */
 253         (void) from; (void) to; (void) opt; /* don't need */
 254         if (f.z == 0) return ERR;
 255         f.w++;
 256         if (f.w == f.z) f.w = -1;
 257         return OK;
 258 }
 259 int w2s(int from, int to, int opt) { /* waste to stock (undo stock to waste) */
 260         (void) from; (void) to; (void) opt; /* don't need */
 261         if (f.z == 0) return ERR;
 262         f.w--;
 263         if (f.w < -1) f.w = f.z-1;
 264         return OK;
 265 }
 266 int f2t(int from, int to, int opt) { /* foundation to tableu */
 267         (void) from; /* don't need */
 268         int top_to = find_top(f.t[to]);
 269         from = opt;
 270         int top_from = find_top(f.f[from]);
 271
 272         if ((get_color(f.t[to][top_to]) != get_color(f.f[from][top_from]))
 273         && (rank_next(f.f[from][top_from], f.t[to][top_to]))) {
 274                 f.t[to][top_to+1] = f.f[from][top_from];
 275                 f.f[from][top_from] = NO_CARD;
 276                 undo_push(FOUNDATION, to, from, 0);
 277                 return OK;
 278         } else return ERR;
 279 }
 280 int w2t(int from, int to, int opt) { /* waste to tableu */
 281         (void) from; (void) opt; /* don't need */
 282         int top_to = find_top(f.t[to]);
 283         if (((get_color(f.t[to][top_to]) != get_color(f.s[f.w]))
 284            && (rank_next(f.s[f.w], f.t[to][top_to])))
 285         || (top_to < 0 && get_rank(f.s[f.w]) == RANK_K)) {
 286                 undo_push(WASTE, to, f.w, 0);
 287                 f.t[to][top_to+1] = stack_take();
 288                 return OK;
 289         } else return ERR;
 290 }
 291 int t2t(int from, int to, int opt) { /* tableu to tableu */
 292         (void) opt; /* don't need */
 293         int top_to = find_top(f.t[to]);
 294         int top_from = find_top(f.t[from]);
 295         int count = 0; //NOTE: could probably be factored out
 296         for (int i = top_from; i >=0; i--) {
 297                 if (((get_color(f.t[to][top_to]) != get_color(f.t[from][i]))
 298                    && (rank_next(f.t[from][i], f.t[to][top_to]))
 299                    && f.t[from][i] > NO_CARD) /* card face up? */
 300                 || (top_to < 0 && get_rank(f.t[from][i]) == RANK_K)) {
 301                         /* move cards [i..top_from] to their destination */
 302                         for (;i <= top_from; i++) {
 303                                 top_to++;
 304                                 f.t[to][top_to] = f.t[from][i];
 305                                 f.t[from][i] = NO_CARD;
 306                                 count++;
 307                         }
 308                         undo_push(from, to, count,
 309                         turn_over(f.t[from]));
 310                         return OK;
 311                 }
 312         }
 313         return ERR; /* no such move possible */
 314 }
 315 #elif defined SPIDER
 316 int remove_if_complete (int pileno) { //cleanup!
 317         card_t* pile = f.t[pileno];
 318         /* test if K...A complete; move to foundation if so */
 319         int top_from = find_top(pile);
 320         if (get_rank(pile[top_from]) != RANK_A) return 0;
 321         for (int i = top_from; i>=0; i--) {
 322                 if (!is_consecutive (pile, i)) return 0;
 323                 if (i+RANK_K == top_from /* if ace to king: remove it */
 324                     && get_rank(pile[top_from-RANK_K]) == RANK_K) {
 325                         for(int i=top_from, j=0; i>top_from-NUM_RANKS; i--,j++){
 326                                 f.f[f.w][j] = pile[i];
 327                                 pile[i] = NO_CARD;
 328                         }
 329                         undo_push(pileno, FOUNDATION, f.w,
 330                         turn_over(pile));
 331                         f.w++;
 332                         return 1;
 333                 }
 334         }
 335
 336         return 0;
 337 }
 338 int t2t(int from, int to, int opt) { //in dire need of cleanup
 339         int top_from = find_top(f.t[from]);
 340         int top_to = find_top(f.t[to]);
 341         int empty_to = (top_to < 0)? opt: -1; /* empty pile? */
 342         int count = 0; //NOTE: could probably be factored out
 343
 344         for (int i = top_from; i >= 0; i--) {
 345                 if (!is_consecutive(f.t[from], i)) break;
 346
 347                 /* is consecutive OR to empty pile and rank ok? */
 348                 if (rank_next(f.t[from][i], f.t[to][top_to])
 349                 || (empty_to >= RANK_A && get_rank(f.t[from][i]) == empty_to)) {
 350                         for (;i <= top_from; i++) {
 351                                 top_to++;
 352                                 f.t[to][top_to] = f.t[from][i];
 353                                 f.t[from][i] = NO_CARD;
 354                                 count++;
 355                         }
 356                         undo_push(from, to, count,
 357                         turn_over(f.t[from]));
 358                         remove_if_complete(to);
 359                         if (check_won()) return WON;
 360                         return OK;
 361                 }
 362         }
 363
 364         return ERR; /* no such move possible */
 365 }
 366 int s2t(int from, int to, int opt) {
 367         (void) from; (void) to; (void) opt; /* don't need */
 368         if (f.z <= 0) return ERR; /* stack out of cards */
 369         for (int pile = 0; pile < NUM_PILES; pile++)
 370                 if (f.t[pile][0]==NO_CARD) return ERR; /*no piles may be empty*/
 371         for (int pile = 0; pile < NUM_PILES; pile++) {
 372                 f.t[pile][find_top(f.t[pile])+1] = f.s[--f.z];
 373                 remove_if_complete(pile);
 374                 if (check_won()) return WON;
 375         }
 376         undo_push(STOCK, TABLEU, 1, 0); /*NOTE: puts 1 card on each tableu pile*/
 377         return OK;
 378 }
 379 int t2f(int from, int to, int opt) {
 380         (void) to; (void) opt; /* don't need */
 381         /* manually retrigger remove_if_complete() (e.g. after undo_pop) */
 382         return remove_if_complete(from)?OK:ERR;
 383 }
 384 #endif
 385 //TODO: which pile to take from should form the basis of CMD_HINT
 386 #define would_complete(pile) \
 387         (get_rank(f.t[pile][r[pile].top]) == RANK_A)
 388
 389 int join(int to) {
 390         int top_to = find_top(f.t[to]);
 391
 392 #ifdef KLONDIKE
 393         if (to == FOUNDATION) {
 394                 int status = ERR;
 395                 for (int i = 0; i <= TAB_MAX; i++)
 396                         switch ((i?t2f:w2f)(i-1, FOUNDATION, 0)) {
 397                         case WON: return WON;
 398                         case OK:  status = OK;
 399                         case ERR: /* nop */;
 400                         }
 401                 return status;
 402         }
 403
 404         if (top_to < 0) { /* move a king to empty pile: */
 405                 for (int i = 0; i < TAB_MAX; i++) {
 406                         if (f.t[i][0] < 0) /* i.e. would turn? */
 407                                 if (t2t(i, to, 0) == OK) return OK;
 408                 }
 409                 return w2t(WASTE, to, 0);
 410         }
 411 #elif defined SPIDER
 412         if (top_to < 0) { //TODO: would-turn or longest stack to empty pile
 413         }
 414 #endif
 415
 416         struct rating {
 417                 int ok:1;    /* card to move in pile? */
 418                 int above;   /* number of movable cards above */
 419                 int below;   /* number of cards below ours */
 420                 int pos;     /* where the card to move is in the pile */
 421                 int top;     /* find_top() */
 422         } r[NUM_PILES] = {{0}};
 423         int complete = 0;/* SPIDER: true if any pile would complete a stack */
 424
 425         /* 1. rate each pile: */
 426         for (int pile = 0; pile < NUM_PILES; pile++) {
 427                 r[pile].top = r[pile].pos = find_top(f.t[pile]);
 428                 /* backtrack until we find a compatible-to-'to'-pile card: */
 429                 while (r[pile].pos >= 0 && is_movable(f.t[pile], r[pile].pos)) {
 430                         int rankdiff = get_rank(f.t[pile][r[pile].pos])
 431                                        - get_rank(f.t[to][top_to]);
 432                         if (rankdiff >= 0) break; /* past our card */
 433                         if (rankdiff == -1 /* rank matches */
 434 #ifdef KLONDIKE
 435                         && get_color(f.t[pile][r[pile].pos]) /* color OK */
 436                            != get_color(f.t[to][top_to])
 437 #elif defined SPIDER
 438                         && get_suit(f.t[pile][r[pile].pos]) /* color OK */
 439                            == get_suit(f.t[to][top_to])
 440 #endif
 441                         ) {
 442                                 r[pile].ok++;
 443                                 complete |= would_complete(pile);
 444                                 for (int i = r[pile].pos; i >= 0; i--)
 445                                         if (is_movable(f.t[pile], i-1))
 446                                                 r[pile].above++;
 447                                         else break;
 448                                 break;
 449                         }
 450                         r[pile].pos--;
 451                         r[pile].below++;
 452                 }
 453         }
 454
 455         /* 2. find optimal pile: (optimized for spider) */
 456         int from = -1;
 457         int turn =  0;
 458         for (int pile = 0, above = 99, empty = 0, below = 99, e = 0, t = 0;
 459              pile < NUM_PILES; pile++) {
 460                 if (!r[pile].ok) continue;
 461 #ifdef SPIDER
 462                 /* don't bother if another pile could complete */
 463                 if (complete && !would_complete(pile)) continue;
 464 #endif
 465
 466                 if ((e=(r[pile].pos == 0))               /* will become empty */
 467                 || ((t=(f.t[pile][r[pile].pos-1] < 0)) && !empty) /*turn_over?*/
 468                 || (r[pile].above < above && !empty)      /* less cards above */
 469                 || (r[pile].above == above && !empty && !turn /* if tied, ... */
 470                     && r[pile].below < below)) {      /* ... use shorter pile */
 471                         from = pile;
 472                         above = r[pile].above;
 473                         below = r[pile].below;
 474                         empty |= e;
 475                         turn  |= t;
 476                 }
 477         }
 478
 479         /* 3. move cards over and return: */
 480 #ifdef KLONDIKE
 481         /* prefer waste if it wouldn't turn_over: */
 482         if (!turn && w2t(WASTE, to, 0) == OK)
 483                 return OK;
 484         if (from < 0) /* nothing found */
 485                 return ERR;
 486         return t2t(from, to, 0);
 487 #elif defined SPIDER
 488         if (from < 0) /* nothing found */
 489                 return ERR;
 490         int bottom = first_movable(f.t[from]);
 491         return t2t(from, to, get_rank(f.t[from][bottom]));
 492 #endif
 493 }
 494 #undef would_complete
 495 int nop(int from, int to, int opt) { (void)from;(void)to;(void)opt;return ERR; }
 496 // }}}
 497
 498 // keyboard input handling {{{
 499 // cursor functions{{{
 500 #ifdef KLONDIKE
 501 void cursor_left (struct cursor* cursor) {
 502         if (is_tableu(cursor->pile)) {
 503                 if (cursor->pile > 0) cursor->pile--;
 504                 cursor->opt = 0;
 505         } else { /* stock/waste/foundation*/
 506                 switch (cursor->pile) {
 507                 case WASTE: cursor->pile = STOCK; cursor->opt = 0; break;
 508                 case FOUNDATION:
 509                         if (cursor->opt <= 0)
 510                                 cursor->pile = WASTE;
 511                         else
 512                                 cursor->opt--;
 513                 }
 514         }
 515 }
 516 void cursor_down (struct cursor* cursor) {
 517         if (!is_tableu(cursor->pile)) {
 518                 switch (cursor->pile) {
 519                 case STOCK: cursor->pile = TAB_1; break;
 520                 case WASTE: cursor->pile = TAB_2; break;
 521                 case FOUNDATION:
 522                         cursor->pile = TAB_4 + cursor->opt;
 523                 }
 524                 cursor->opt = 0;
 525         }
 526 }
 527 void cursor_up (struct cursor* cursor) {
 528         if (is_tableu(cursor->pile)) {
 529                 switch (cursor->pile) { //ugly :|
 530                 case TAB_1: cursor->pile = STOCK; break;
 531                 case TAB_2: cursor->pile = WASTE; break;
 532                 case TAB_3: cursor->pile = WASTE; break;
 533                 case TAB_4: case TAB_5: case TAB_6: case TAB_7:
 534                         cursor->opt=cursor->pile-TAB_4;
 535                         cursor->pile = FOUNDATION;
 536                         break;
 537                 }
 538         }
 539 }
 540 void cursor_right (struct cursor* cursor) {
 541         if (is_tableu(cursor->pile)) {
 542                 if (cursor->pile < TAB_MAX) cursor->pile++;
 543         } else {
 544                 switch (cursor->pile) {
 545                 case STOCK: cursor->pile = WASTE; break;
 546                 case WASTE: cursor->pile = FOUNDATION;cursor->opt = 0; break;
 547                 case FOUNDATION:
 548                         if (cursor->opt < NUM_SUITS-1)
 549                                 cursor->opt++;
 550                 }
 551         }
 552 }
 553 #elif defined SPIDER
 554 /*NOTE: one can't highlight the stock due to me being too lazy to implement it*/
 555 void cursor_left (struct cursor* cursor) {
 556         if (cursor->pile > 0) cursor->pile--;
 557         cursor->opt = 0;
 558 }
 559 void cursor_down (struct cursor* cursor) {
 560         int first = first_movable(f.t[cursor->pile]);
 561         int top = find_top(f.t[cursor->pile]);
 562         if (first + cursor->opt < top)
 563                 cursor->opt++;
 564 }
 565 void cursor_up (struct cursor* cursor) {
 566         if (cursor->opt > 0) cursor->opt--;
 567 }
 568 void cursor_right (struct cursor* cursor) {
 569         if (cursor->pile < TAB_MAX) cursor->pile++;
 570         cursor->opt = 0;
 571 }
 572 #endif
 573 void cursor_to (struct cursor* cursor, int pile) {
 574         cursor->pile = pile;
 575         cursor->opt = 0;
 576 }
 577 //}}}
 578 int get_cmd (int* from, int* to, int* opt) {
 579         /*XXX*/unsigned char mouse[3];
 580         //TODO: escape sequences (mouse, cursor keys)
 581         int _f, t;
 582         struct cursor inactive = {-1,-1};
 583         static struct cursor active = {0,0};
 584         active.opt = 0; /* always reset offset, but keep pile */
 585
 586         /***/
 587 from_l: print_table(&active, &inactive);
 588         _f = getch(mouse);
 589
 590         switch (_f) {
 591         /* direct addressing: */
 592         case '1': *from = TAB_1; break;
 593         case '2': *from = TAB_2; break;
 594         case '3': *from = TAB_3; break;
 595         case '4': *from = TAB_4; break;
 596         case '5': *from = TAB_5; break;
 597         case '6': *from = TAB_6; break;
 598         case '7': *from = TAB_7; break;
 599 #ifdef SPIDER
 600         case '8': *from = TAB_8; break;
 601         case '9': *from = TAB_9; break;
 602         case '0': *from = TAB_10;break;
 603 #elif defined KLONDIKE
 604         case '9': *from = WASTE; break;
 605         case '0': *from = FOUNDATION; break;
 606         case '8': /* fallthrough */
 607 #endif
 608         case '\n': /* shortcut for dealing from stock */
 609                 *from = STOCK;
 610                 *to = WASTE;
 611                 return CMD_MOVE;
 612         /* cursor keys addressing: */
 613         case KEY_LEFT:
 614         case 'h': cursor_left (&active); goto from_l;
 615         case KEY_DOWN:
 616         case 'j': cursor_down (&active); goto from_l;
 617         case KEY_UP:
 618         case 'k': cursor_up   (&active); goto from_l;
 619         case KEY_RIGHT:
 620         case 'l': cursor_right(&active); goto from_l;
 621         case KEY_HOME:
 622         case 'H': cursor_to(&active,TAB_1);  goto from_l; /* leftmost  tableu */
 623         case KEY_END:
 624         case 'L': cursor_to(&active,TAB_MAX);goto from_l; /* rigthmost tableu */
 625         case KEY_INS:
 626         case 'M': cursor_to(&active,TAB_MAX/2); goto from_l; /* center tableu */
 627         //TODO: real cursor keys, home/end
 628         case ' ': /* continue with second cursor */
 629                 *from = active.pile;
 630                 if (*from == STOCK) {
 631                         *to = WASTE;
 632                         return CMD_MOVE;
 633                 }
 634 #ifdef KLONDIKE
 635                 *opt = active.opt; /* when FOUNDATION */
 636 #endif
 637                 inactive = active;
 638                 break;
 639         /* misc keys: */
 640         case ':':
 641                 {char buf[256];
 642                 fprintf (stderr, ":");
 643                 raw_mode(0); /* turn on echo */
 644                 fgets (buf, 256, stdin);
 645                 raw_mode(1);
 646                 switch(buf[0]) {
 647                 case 'q': return CMD_QUIT;
 648                 case 'n': return CMD_NEW;
 649                 case 'r': return CMD_AGAIN;
 650                 default:  return CMD_INVAL;
 651                 }}
 652         case 'J':
 653                 *to = active.pile;
 654 #ifdef KLONDIKE
 655                 if (*to == FOUNDATION) return CMD_JOIN;
 656 #endif
 657                 if (*to > TAB_MAX) return CMD_INVAL;
 658                 return CMD_JOIN;
 659         case 'K': /* fallthrough */
 660         case '?': return CMD_HINT;
 661         case 'u': return CMD_UNDO;
 662         case EOF: return CMD_NONE; /* sent by SIGCONT */
 663         default: return CMD_INVAL;
 664         }
 665         inactive.pile = *from; /* for direct addressing highlighting */
 666         if (is_tableu(*from) && f.t[*from][0] == NO_CARD) return CMD_INVAL;
 667
 668         /***/
 669 to_l:   print_table(&active, &inactive);
 670         t = getch(mouse);
 671
 672         switch (t) {
 673         case KEY_LEFT:
 674         case 'h': cursor_left (&active); goto to_l;
 675         case KEY_DOWN:
 676         case 'j': cursor_down (&active); goto to_l;
 677         case KEY_UP:
 678         case 'k': cursor_up   (&active); goto to_l;
 679         case KEY_RIGHT:
 680         case 'l': cursor_right(&active); goto to_l;
 681         case KEY_HOME:
 682         case 'H': cursor_to(&active,TAB_1);     goto to_l;
 683         case KEY_END:
 684         case 'L': cursor_to(&active,TAB_MAX);   goto to_l;
 685         case KEY_INS:
 686         case 'M': cursor_to(&active,TAB_MAX/2); goto to_l;
 687         case 'J': /* fallthrough; just join selected pile */
 688         case ' ':
 689                 *to = active.pile;
 690                 break; /* continues with the foundation/empty tableu check */
 691         case 'K': /* fallthrough */
 692         case '?': return CMD_HINT;
 693         case 'u': return CMD_NONE; /* cancel selection */
 694         case EOF: return CMD_NONE; /* sent by SIGCONT */
 695         default:
 696                 if (t < '0' || t > '9') return CMD_INVAL;
 697                 if (t == '0')
 698 #ifdef KLONDIKE
 699                         *to = FOUNDATION;
 700 #elif defined SPIDER
 701                         *to = TAB_10;
 702 #endif
 703                 else
 704                         *to = t-'1';
 705         }
 706
 707         /***/
 708 #ifdef KLONDIKE
 709         if (*from == FOUNDATION) {
 710                 int top = find_top(f.t[*to]);
 711                 if (top < 0) return CMD_INVAL;
 712                 int color = get_color(f.t[*to][top]);
 713                 int choice_1 = 1-color; /* selects piles of   */
 714                 int choice_2 = 2+color; /* the opposite color */
 715                 int top_c1 = find_top(f.f[choice_1]);
 716                 int top_c2 = find_top(f.f[choice_2]);
 717
 718                 switch ((rank_next(f.f[choice_1][top_c1], f.t[*to][top])
 719                          && top_c1 >= 0 ) << 0
 720                        |(rank_next(f.f[choice_2][top_c2], f.t[*to][top])
 721                          && top_c2 >= 0 ) << 1) {
 722                 case (       1<<0): *opt = choice_1; break; /* choice_1 only */
 723                 case (1<<1       ): *opt = choice_2; break; /* choice_2 only */
 724                 case (1<<1 | 1<<0): /* both, ask user which to pick from */
 725                         printf ("take from (1-4): "); fflush (stdout);
 726                         *opt = getch(NULL) - '1';
 727                         if (*opt < 0 || *opt > 3) return CMD_INVAL;
 728                         break;
 729                 default: return CMD_INVAL; /* none matched */
 730                 }
 731                 /* `opt` is the foundation index (0..3) */
 732         }
 733 #elif defined SPIDER
 734         /* moving to empty tableu? */
 735         if (is_tableu(*to) && f.t[*to][0] == NO_CARD) {
 736                 int bottom = first_movable(f.t[*from]);
 737                 if (inactive.opt >= 0) { /*if from was cursor addressed: */
 738                         *opt = get_rank(f.t[*from][bottom + inactive.opt]);
 739                         return CMD_MOVE;
 740                 }
 741                 int top = find_top(f.t[*from]);
 742                 if (top < 0) return CMD_INVAL;
 743                 if (top >= 0 && !is_movable(f.t[*from], top-1)) {
 744                         *opt = get_rank(f.t[*from][top]);
 745                 } else { /* only ask the user if it's unclear: */
 746                         printf ("\rup to ([a23456789xjqk] or space/return): ");
 747                         *opt = getch(NULL);
 748                         switch (*opt) {
 749                         case ' ': *opt = get_rank(f.t[*from][top]); break;
 750                         case'\n': *opt = get_rank(f.t[*from][bottom]); break;
 751                         case 'a': case 'A': *opt = RANK_A; break;
 752                         case '0': /* fallthrough */
 753                         case 'x': case 'X': *opt = RANK_X; break;
 754                         case 'j': case 'J': *opt = RANK_J; break;
 755                         case 'q': case 'Q': *opt = RANK_Q; break;
 756                         case 'k': case 'K': *opt = RANK_K; break;
 757                         default: *opt -= '1';
 758                         }
 759                         if (*opt < RANK_A || *opt > RANK_K) return ERR;
 760                 }
 761                 /* `opt` is the rank of the highest card to move */
 762         }
 763 #endif
 764         return CMD_MOVE;
 765 }
 766
 767 int getctrlseq(unsigned char* buf) {
 768         int c;
 769         enum esc_states {
 770                 START,
 771                 ESC_SENT,
 772                 CSI_SENT,
 773                 MOUSE_EVENT,
 774         } state = START;
 775         int offset = 0x20; /* never sends control chars as data */
 776         while ((c = getchar()) != EOF) {
 777                 switch (state) {
 778                 case START:
 779                         switch (c) {
 780                         case '\033': state=ESC_SENT; break;
 781                         default: return c;
 782                         }
 783                         break;
 784                 case ESC_SENT:
 785                         switch (c) {
 786                         case '[': state=CSI_SENT; break;
 787                         default: return KEY_INVAL;
 788                         }
 789                         break;
 790                 case CSI_SENT:
 791                         switch (c) {
 792                         case 'A': return KEY_UP;
 793                         case 'B': return KEY_DOWN;
 794                         case 'C': return KEY_RIGHT;
 795                         case 'D': return KEY_LEFT;
 796                         /*NOTE: home/end send ^[[x~ . no support for modifiers*/
 797                         case 'H': return KEY_HOME;
 798                         case 'F': return KEY_END;
 799                         case '2': getchar(); return KEY_INS;
 800                         case '5': getchar(); return KEY_PGUP;
 801                         case '6': getchar(); return KEY_PGDN;
 802                         case 'M': state=MOUSE_EVENT; break;
 803                         default: return KEY_INVAL;
 804                         }
 805                         break;
 806                 case MOUSE_EVENT:
 807                         if (buf == NULL) return KEY_INVAL;
 808                         buf[0] = c - offset;
 809                         buf[1] = getchar() - offset;
 810                         buf[2] = getchar() - offset;
 811                         return MOUSE_ANY;
 812                 default:
 813                         return KEY_INVAL;
 814                 }
 815         }
 816         return 2;
 817 }
 818 int wait_mouse_up(int l, int c) {
 819         unsigned char mouse2[3];
 820         int level = 1;
 821         int l2, c2;
 822
 823         /* TODO: show a pushed-in button if cursor is on minefield */
 824
 825         while (level > 0) {
 826                 if (getctrlseq (mouse2) == MOUSE_ANY) {
 827                         /* ignore mouse wheel events: */
 828                         if (mouse2[0] & 0x40) continue;
 829
 830                         else if((mouse2[0]&3) == 3) level--; /* release event */
 831                         else level++; /* another button pressed */
 832                 }
 833         }
 834
 835         /* TODO: show normal button */
 836
 837         c2 = /*screen2field_c*/(mouse2[1]);
 838         l2 = /*screen2field_l*/(mouse2[2]);
 839         return ((l2 == l) && (c2 == c));
 840 }
 841
 842 int getch(unsigned char* buf) {
 843 /* returns a character, EOF, or constant for an escape/control sequence - NOT
 844 compatible with the ncurses implementation of same name */
 845         int action = getctrlseq(buf);
 846         int l, c;
 847         switch (action) {
 848         case MOUSE_ANY:
 849                 l = /*screen2field_l*/ (buf[2]);
 850                 c = /*screen2field_c*/ (buf[1]);
 851
 852                 if (buf[0] > 3) break; /* ignore all but left/middle/right/up */
 853                 int success = wait_mouse_up(l, c);
 854
 855                 /* mouse moved while pressed: */
 856                 if (!success) return KEY_INVAL;
 857
 858                 switch (buf[0]) {
 859                 case 0: return MOUSE_LEFT;
 860                 case 1: return MOUSE_MIDDLE;
 861                 case 2: return MOUSE_RIGHT;
 862                 }
 863         }
 864
 865         return action;
 866 }
 867 // }}}
 868
 869 // shuffling and dealing {{{
 870 void deal(long seed) {
 871         f = (const struct playfield){0}; /* clear playfield */
 872         card_t deck[DECK_SIZE*NUM_DECKS];
 873         int avail = DECK_SIZE*NUM_DECKS;
 874         for (int i = 0; i < DECK_SIZE*NUM_DECKS; i++) deck[i] = (i%DECK_SIZE)+1;
 875 #ifdef SPIDER
 876         if (op.m != NORMAL) for (int i = 0; i < DECK_SIZE*NUM_DECKS; i++) {
 877                 if (op.m == MEDIUM) deck[i] = 1+((deck[i]-1) | 2);
 878                 if (op.m == EASY)   deck[i] = 1+((deck[i]-1) | 2 | 1);
 879                 /* the 1+ -1 dance gets rid of the offset created by NO_CARD */
 880         }
 881 #endif
 882         srand (seed);
 883         for (int i = DECK_SIZE*NUM_DECKS-1; i > 0; i--) { /* fisher-yates */
 884                 int j = rand() % (i+1);
 885                 if (j-i) deck[i]^=deck[j],deck[j]^=deck[i],deck[i]^=deck[j];
 886         }
 887
 888         /* deal cards: */
 889         for (int i = 0; i < NUM_PILES; i++) {
 890 #ifdef KLONDIKE
 891                 int closed = i; /* pile n has n closed cards, then 1 open */
 892 #elif defined SPIDER
 893                 int closed = i<4?5:4; /* pile 1-4 have 5, 5-10 have 4 closed */
 894 #endif
 895                 /* face down cards are negated: */
 896                 for (int j = 0; j < closed; j++) f.t[i][j] = -deck[--avail];
 897                 f.t[i][closed] = deck[--avail]; /* the face-up card */
 898         }
 899         /* rest of the cards to the stock; NOTE: assert(avail==50) for spider */
 900         for (f.z = 0; avail; f.z++) f.s[f.z] = deck[--avail];
 901 #ifdef KLONDIKE
 902         f.w = -1; /* @start: nothing on waste */
 903 #elif defined SPIDER
 904         f.w = 0; /* number of used foundations */
 905 #endif
 906
 907         f.u = &undo_sentinel;
 908 }
 909 //}}}
 910
 911 // screen drawing routines {{{
 912 void print_hi(int invert, int grey_bg, int bold, char* str) {
 913         if (bold && op.s == &unicode_large_color){//ARGH! awful hack for bold with faint
 914                 int offset = str[3]==017?16:str[4]==017?17:0;
 915                 printf ("%s%s%s""%.*s%s%s""%s%s%s",
 916                         bold?"\033[1m":"", invert?"\033[7m":"", grey_bg?"\033[100m":"",
 917                         offset, str, bold?"\033[1m":"", str+offset,
 918                         grey_bg?"\033[49m":"", invert?"\033[27m":"",bold?"\033[22m":"");
 919                 return;
 920         }
 921         printf ("%s%s%s%s%s%s%s",
 922                 bold?"\033[1m":"", invert?"\033[7m":"", grey_bg?"\033[100m":"",
 923                 str,
 924                 grey_bg?"\033[49m":"", invert?"\033[27m":"",bold?"\033[22m":"");
 925 }
 926 void print_table(const struct cursor* active, const struct cursor* inactive) {
 927         printf("\033[2J\033[H"); /* clear screen, reset cursor */
 928 #ifdef KLONDIKE
 929         /* print stock, waste and foundation: */
 930         for (int line = 0; line < op.s->height; line++) {
 931                 /* stock: */
 932                 print_hi (active->pile == STOCK, inactive->pile == STOCK, 1, (
 933                         (f.w < f.z-1)?op.s->facedown
 934                         :op.s->placeholder)[line]);
 935                 /* waste: */
 936                 print_hi (active->pile == WASTE, inactive->pile == WASTE, 1, (
 937                         /* NOTE: cast, because f.w sometimes is (short)-1 !? */
 938                         ((short)f.w >= 0)?op.s->card[f.s[f.w]]
 939                         :op.s->placeholder)[line]);
 940                 printf ("%s", op.s->card[NO_CARD][line]); /* spacer */
 941                 /* foundation: */
 942                 for (int pile = 0; pile < NUM_SUITS; pile++) {
 943                         int card = find_top(f.f[pile]);
 944                         print_hi (active->pile==FOUNDATION && active->opt==pile,
 945                                 inactive->pile==FOUNDATION && (
 946                                         /* cursor addr.     || direct addr.   */
 947                                         inactive->opt==pile || inactive->opt < 0
 948                                 ), 1,
 949                                 (card < 0)?op.s->placeholder[line]
 950                                 :op.s->card[f.f[pile][card]][line]);
 951                 }
 952                 printf("\n");
 953         }
 954         printf("\n");
 955 #elif defined SPIDER
 956         int fdone; for (fdone = NUM_DECKS*NUM_SUITS; fdone; fdone--)
 957                 if (f.f[fdone-1][RANK_K]) break;  /*number of completed stacks*/
 958         int spacer_from = f.z?(f.z/10-1) * op.s->halfwidth[0] + op.s->width:0;
 959         int spacer_to   = NUM_PILES*op.s->width -
 960                 ((fdone?(fdone-1) * op.s->halfwidth[1]:0)+op.s->width);
 961         for (int line = 0; line < op.s->height; line++) {
 962                 /* available stock: */
 963                 for (int i = f.z/10; i; i--) {
 964                         if (i==1) printf ("%s", op.s->facedown[line]);
 965                         else      printf ("%s", op.s->halfstack[line]);
 966                 }
 967                 /* spacer: */
 968                 for (int i = spacer_from; i < spacer_to; i++) printf (" ");
 969                 /* foundation (overlapping): */
 970                 for (int i = 0; i < NUM_DECKS*NUM_SUITS; i++) { //TODO: print in revrse order (otherwise new piles get put 'below' older ones)
 971                         int overlap = i? op.s->halfcard[line]: 0;
 972                         if (f.f[i][RANK_K]) printf ("%.*s", op.s->halfwidth[2],
 973                                 op.s->card[f.f[i][RANK_K]][line]+overlap);
 974                 }
 975                 printf("\n");
 976         }
 977         printf("\n");
 978 #endif
 979 #ifdef KLONDIKE
 980 #define DO_HI(cursor) (cursor->pile == pile && (movable || empty))
 981 #define TOP_HI(c) 1 /* can't select partial stacks in KLONDIKE */
 982 #define INC_OFFSET
 983 #elif defined SPIDER
 984         int offset[NUM_PILES]={1,1,1,1,1,1,1,1,1,1}; // :|
 985 #define DO_HI(cursor) (cursor->pile == pile && (movable || empty) \
 986         && offset[pile] > cursor->opt)
 987 #define TOP_HI(cursor) (cursor->pile == pile && movable \
 988         && offset[pile]-1 == cursor->opt)
 989 #define INC_OFFSET if (movable) offset[pile]++
 990 #endif
 991         /* print tableu piles: */
 992         int row[NUM_PILES] = {0};
 993         int line[NUM_PILES]= {0};
 994         int label[NUM_PILES]={0};
 995         int line_had_card;
 996         int did_placeholders = 0;
 997         do {
 998                 line_had_card = 0;
 999                 for (int pile = 0; pile < NUM_PILES; pile++) {
1000                         card_t card = f.t[pile][row[pile]];
1001                         card_t next = f.t[pile][row[pile]+1];
1002                         int movable = is_movable(f.t[pile], row[pile]);
1003                         int empty   = !card && row[pile] == 0;
1004
1005                         print_hi (DO_HI(active), DO_HI(inactive), movable, (
1006                                 (!card && row[pile] == 0)?op.s->placeholder
1007                                 :(card<0)?op.s->facedown
1008                                 :op.s->card[card]
1009                                 )[line[pile]]);
1010
1011                         int extreme_overlap = ( 3  /* spacer, labels, status */
1012                                 + 2 * op.s->height /* stock, top tableu card */
1013                                 + find_top(f.t[pile]) * op.s->overlap) >op.w[0];
1014                         /* normal overlap: */
1015                         if (++line[pile] >= (next?op.s->overlap:op.s->height)
1016                         /* extreme overlap on closed cards: */
1017                         || (extreme_overlap &&
1018                             line[pile] >= 1 &&
1019                             f.t[pile][row[pile]] < 0 &&
1020                             f.t[pile][row[pile]+1] <0)
1021                         /* extreme overlap on sequences: */
1022                         || (extreme_overlap &&
1023                             !TOP_HI(active) && /*always show top selected card*/
1024                             line[pile] >= 1 && row[pile] > 0 &&
1025                             f.t[pile][row[pile]-1] > NO_CARD &&
1026                             is_consecutive (f.t[pile], row[pile]) &&
1027                             is_consecutive (f.t[pile], row[pile]-1) &&
1028                             f.t[pile][row[pile]+1] != NO_CARD)
1029                         ) {
1030                                 line[pile]=0;
1031                                 row[pile]++;
1032                                 INC_OFFSET;
1033                         }
1034                         /* tableu labels: */
1035                         if(!card && !label[pile] && row[pile]>0&&line[pile]>0) {
1036                                 label[pile] = 1;
1037                                 printf ("\b\b%d ", (pile+1) % 10); //XXX: hack
1038                         }
1039                         line_had_card |= !!card;
1040                         did_placeholders |= row[pile] > 0;
1041                 }
1042                 printf ("\n");
1043         } while (line_had_card || !did_placeholders);
1044 }
1045
1046 void visbell (void) {
1047         printf ("\033[?5h"); fflush (stdout);
1048         usleep (100000);
1049         printf ("\033[?5l"); fflush (stdout);
1050 }
1051 void win_anim(void) {
1052         printf ("\033[?25l"); /* hide cursor */
1053         for (;;) {
1054                 /* set cursor to random location */
1055                 int row = 1+rand()%(24-op.s->width);
1056                 int col = 1+rand()%(80-op.s->height);
1057
1058                 /* draw random card */
1059                 int face = 1 + rand() % 52;
1060                 for (int l = 0; l < op.s->height; l++) {
1061                         printf ("\033[%d;%dH", row+l, col);
1062                         printf ("%s", op.s->card[face][l]);
1063                 }
1064                 fflush (stdout);
1065
1066                 /* exit on keypress */
1067                 struct pollfd p = {STDIN_FILENO, POLLIN, 0};
1068                 if (poll (&p, 1, 80)) goto fin;
1069         }
1070 fin:
1071         printf ("\033[?25h"); /* show cursor */
1072         return;
1073 }
1074 //}}}
1075
1076 // undo logic {{{
1077 void undo_push (int _f, int t, int n, int o) {
1078         struct undo* new = malloc(sizeof(struct undo));
1079         new->f = _f;
1080         new->t = t;
1081         new->n = n;
1082         new->o = o;
1083         new->prev = f.u;
1084         new->next = NULL;
1085         f.u->next = new;
1086         f.u = f.u->next;
1087 }
1088 void undo_pop (struct undo* u) {
1089         if (u == &undo_sentinel) return;
1090
1091 #ifdef KLONDIKE
1092         if (u->f == FOUNDATION) {
1093                 /* foundation -> tableu */
1094                 int top_f = find_top(f.f[u->n]);
1095                 int top_t = find_top(f.t[u->t]);
1096                 f.f[u->n][top_f+1] = f.t[u->t][top_t];
1097                 f.t[u->t][top_t] = NO_CARD;
1098         } else if (u->f == WASTE && u->t == FOUNDATION) {
1099                 /* waste -> foundation */
1100                 /* split u->n into wst and fnd: */
1101                 int wst = u->n & 0xffff;
1102                 int fnd = u->n >> 16;
1103                 /* move stock cards one position up to make room: */
1104                 for (int i = f.z; i >= wst; i--) f.s[i+1] = f.s[i];
1105                 /* move one card from foundation to waste: */
1106                 int top = find_top(f.f[fnd]);
1107                 f.s[wst] = f.f[fnd][top];
1108                 f.f[fnd][top] = NO_CARD;
1109                 f.z++;
1110                 f.w++;
1111         } else if (u->f == WASTE) {
1112                 /* waste -> tableu */
1113                 /* move stock cards one position up to make room: */
1114                 for (int i = f.z; i >= u->n; i--) f.s[i+1] = f.s[i];
1115                 /* move one card from tableu to waste: */
1116                 int top = find_top(f.t[u->t]);
1117                 f.s[u->n] = f.t[u->t][top];
1118                 f.t[u->t][top] = NO_CARD;
1119                 f.z++;
1120                 f.w++;
1121         } else if (u->t == FOUNDATION) {
1122                 /* tableu -> foundation */
1123                 int top_f = find_top(f.t[u->f]);
1124                 int top_t = find_top(f.f[u->n]);
1125                 /* close topcard if previous action caused turn_over(): */
1126                 if (u->o) f.t[u->f][top_f] *= -1;
1127                 /* move one card from foundation to tableu: */
1128                 f.t[u->f][top_f+1] = f.f[u->n][top_t];
1129                 f.f[u->n][top_t] = NO_CARD;
1130         } else {
1131                 /* tableu -> tableu */
1132                 int top_f = find_top(f.t[u->f]);
1133                 int top_t = find_top(f.t[u->t]);
1134                 /* close topcard if previous action caused turn_over(): */
1135                 if (u->o) f.t[u->f][top_f] *= -1;
1136                 /* move n cards from tableu[f] to tableu[t]: */
1137                 for (int i = 0; i < u->n; i++) {
1138                         f.t[u->f][top_f+u->n-i] = f.t[u->t][top_t-i];
1139                         f.t[u->t][top_t-i] = NO_CARD;
1140                 }
1141         }
1142 #elif defined SPIDER
1143         if (u->f == STOCK) {
1144                 /* stock -> tableu */
1145                 /*remove a card from each pile and put it back onto the stock:*/
1146                 for (int pile = NUM_PILES-1; pile >= 0; pile--) {
1147                         int top = find_top(f.t[pile]);
1148                         f.s[f.z++] = f.t[pile][top];
1149                         f.t[pile][top] = NO_CARD;
1150                 }
1151         } else if (u->t == FOUNDATION) {
1152                 /* tableu -> foundation */
1153                 int top = find_top(f.t[u->f]);
1154                 /* close topcard if previous action caused turn_over(): */
1155                 if (u->o) f.t[u->f][top] *= -1;
1156                 /* append cards from foundation to tableu */
1157                 for (int i = RANK_K; i >= RANK_A; i--) {
1158                         f.t[u->f][++top] = f.f[u->n][i];
1159                         f.f[u->n][i] = NO_CARD;
1160                 }
1161                 f.w--; /* decrement complete-foundation-counter */
1162
1163         } else {
1164                 /* tableu -> tableu */
1165                 int top_f = find_top(f.t[u->f]);
1166                 int top_t = find_top(f.t[u->t]);
1167                 /* close topcard if previous action caused turn_over(): */
1168                 if (u->o) f.t[u->f][top_f] *= -1;
1169                 /* move n cards from tableu[f] to tableu[t]: */
1170                 for (int i = 0; i < u->n; i++) {
1171                         f.t[u->f][top_f+u->n-i] = f.t[u->t][top_t-i];
1172                         f.t[u->t][top_t-i] = NO_CARD;
1173                 }
1174         }
1175 #endif
1176
1177         void* old = f.u;
1178         f.u = f.u->prev;
1179         free(old);
1180 }
1181 void free_undo (struct undo* u) {
1182         while (u && u != &undo_sentinel) {
1183                 void* old = u;
1184                 u = u->prev;
1185                 free (old);
1186         }
1187 }
1188 //}}}
1189
1190 // initialization stuff {{{
1191 void screen_setup (int enable) {
1192         if (enable) {
1193                 raw_mode(1);
1194                 printf ("\033[s\033[?47h"); /* save cursor, alternate screen */
1195                 printf ("\033[H\033[J"); /* reset cursor, clear screen */
1196                 //TODO//printf ("\033[?1000h\033[?25l"); /* enable mouse, hide cursor */
1197         } else {
1198                 //TODO//printf ("\033[?9l\033[?25h"); /* disable mouse, show cursor */
1199                 printf ("\033[?47l\033[u"); /* primary screen, restore cursor */
1200                 raw_mode(0);
1201         }
1202 }
1203
1204 void raw_mode(int enable) {
1205         static struct termios saved_term_mode;
1206         struct termios raw_term_mode;
1207
1208         if (enable) {
1209                 if (saved_term_mode.c_lflag == 0)/*don't overwrite stored mode*/
1210                         tcgetattr(STDIN_FILENO, &saved_term_mode);
1211                 raw_term_mode = saved_term_mode;
1212                 raw_term_mode.c_lflag &= ~(ICANON | ECHO);
1213                 raw_term_mode.c_cc[VMIN] = 1 ;
1214                 raw_term_mode.c_cc[VTIME] = 0;
1215                 tcsetattr(STDIN_FILENO, TCSAFLUSH, &raw_term_mode);
1216         } else {
1217                 tcsetattr(STDIN_FILENO, TCSAFLUSH, &saved_term_mode);
1218         }
1219 }
1220
1221 void signal_handler (int signum) {
1222         struct winsize w;
1223         switch (signum) {
1224         case SIGCONT:
1225                 screen_setup(0);
1226                 screen_setup(1);
1227                 print_table(NO_HI, NO_HI);
1228                 break;
1229         case SIGINT: //TODO: don't exit; just warn like vim does
1230                 exit(128+SIGINT);
1231         case SIGWINCH:
1232                 ioctl(STDOUT_FILENO, TIOCGWINSZ, &w);
1233                 op.w[0] = w.ws_row;
1234                 op.w[1] = w.ws_col;
1235                 break;
1236         }
1237 }
1238 void signal_setup(void) {
1239         struct sigaction saction;
1240
1241         saction.sa_handler = signal_handler;
1242         sigemptyset(&saction.sa_mask);
1243         saction.sa_flags = 0;
1244         if (sigaction(SIGCONT, &saction, NULL) < 0) {
1245                 perror ("SIGCONT");
1246                 exit (1);
1247         }
1248         if (sigaction(SIGINT, &saction, NULL) < 0) {
1249                 perror ("SIGINT");
1250                 exit (1);
1251         }
1252         if (sigaction(SIGWINCH, &saction, NULL) < 0) {
1253                 perror ("SIGWINCH");
1254                 exit (1);
1255         }
1256 }
1257 //}}}
1258
1259 //vim: foldmethod=marker