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: generalize prediction engine for CMD_HINT
 386 #ifdef KLONDIKE
 387 #define would_complete(pile) 0
 388 #elif defined SPIDER
 389 #define would_complete(pile) \
 390         (get_rank(f.t[pile][r[pile].top]) == RANK_A \
 391         && get_rank(f.t[to][bottom_to]) == RANK_K)
 392 #endif
 393 #define would_turn(pile) \
 394         (f.t[pile][r[pile].pos-1] < 0)
 395 #define would_empty(pile) \
 396         (r[pile].pos == 0)
 397
 398 int join(int to) {
 399         int top_to = find_top(f.t[to]);
 400 #ifdef SPIDER
 401         int bottom_to = first_movable(f.t[to]);
 402 #endif
 403
 404 #ifdef KLONDIKE
 405         if (to == FOUNDATION) {
 406                 int status = ERR;
 407                 for (int i = 0; i <= TAB_MAX; i++)
 408                         switch ((i?t2f:w2f)(i-1, FOUNDATION, 0)) {
 409                         case WON: return WON;
 410                         case OK:  status = OK;
 411                         case ERR: /* nop */;
 412                         }
 413                 return status;
 414         }
 415
 416         if (top_to < 0) { /* move a king to empty pile: */
 417                 for (int i = 0; i < TAB_MAX; i++) {
 418                         if (f.t[i][0] < 0) /* i.e. would turn? */
 419                                 if (t2t(i, to, 0) == OK) return OK;
 420                 }
 421                 return w2t(WASTE, to, 0);
 422         }
 423 #endif
 424
 425         struct rating {
 426                 int ok:1;    /* card to move in pile? */
 427                 int above;   /* number of movable cards above */
 428                 int below;   /* number of cards below ours */
 429                 int pos;     /* where the card to move is in the pile */
 430                 int top;     /* find_top() */
 431         } r[NUM_PILES] = {{0}};
 432         int complete = 0;/* SPIDER: true if any pile would complete a stack */
 433         int turn =  0; /* SPIDER: true if any pile would turn_over */
 434         int empty = 0; /* true if any pile would become empty */
 435
 436         /* 1. rate each pile: */
 437 #ifdef SPIDER
 438         if (top_to < 0) {
 439                 for (int pile = 0; pile < NUM_PILES; pile++) {
 440                         if (pile == to) continue;
 441                         int top = find_top(f.t[pile]);
 442                         int bottom = first_movable(f.t[pile]);
 443                         r[pile].pos = bottom; /* need for would_empty */
 444
 445                         if (top < 0) continue; /* no cards to move */
 446                         if (would_empty(pile)) continue; /* doesn't help */
 447
 448                         r[pile].ok++;
 449                         r[pile].above = 0; /* always take as many as possible */
 450                         r[pile].below = top - bottom;
 451                         r[pile].top = top;
 452                         complete |= would_complete(pile); /* never happens */
 453                         turn     |= would_turn(pile);
 454                         empty    |= would_empty(pile);
 455                 }
 456         } else
 457 #endif
 458         for (int pile = 0; pile < NUM_PILES; pile++) {
 459                 r[pile].top = r[pile].pos = find_top(f.t[pile]);
 460                 /* backtrack until we find a compatible-to-'to'-pile card: */
 461                 while (r[pile].pos >= 0 && is_movable(f.t[pile], r[pile].pos)) {
 462                         int rankdiff = get_rank(f.t[pile][r[pile].pos])
 463                                        - get_rank(f.t[to][top_to]);
 464                         if (rankdiff >= 0) break; /* past our card */
 465                         if (rankdiff == -1 /* rank matches */
 466 #ifdef KLONDIKE
 467                         && get_color(f.t[pile][r[pile].pos]) /* color OK */
 468                            != get_color(f.t[to][top_to])
 469 #elif defined SPIDER
 470                         && get_suit(f.t[pile][r[pile].pos]) /* color OK */
 471                            == get_suit(f.t[to][top_to])
 472 #endif
 473                         ) {
 474                                 r[pile].ok++;
 475                                 complete |= would_complete(pile);
 476                                 turn     |= would_turn(pile);
 477                                 empty    |= would_empty(pile);
 478                                 for (int i = r[pile].pos; i >= 0; i--)
 479                                         if (is_movable(f.t[pile], i-1))
 480                                                 r[pile].above++;
 481                                         else break;
 482                                 break;
 483                         }
 484                         r[pile].pos--;
 485                         r[pile].below++;
 486                 }
 487         }
 488
 489         /* 2. find optimal pile: (optimized for spider) */
 490         //todo: in spider, prefer longest piles if above==0 (faster completions)
 491         int from = -1;
 492         for (int pile = 0, above = 99, below = 99; pile < NUM_PILES; pile++) {
 493                 if (!r[pile].ok) continue;
 494                 /* don't bother if another pile would be better: prefer ... */
 495                 /* ... to complete a stack: */
 496                 if (!would_complete(pile) && complete) continue;
 497                 /* ... emptying piles: */
 498                 if (!would_empty(pile) && empty && !complete) continue;
 499                 /* ... to turn_over: */
 500                 if (!would_turn(pile) && turn && !complete && !empty) continue;
 501                 /* ... not to rip apart too many cards: */
 502                 if (r[pile].above > above) continue;
 503                 /* if tied, prefer ... */
 504                 if (r[pile].above == above
 505                    /* ... larger pile if destination is empty */
 506                    && (top_to < 0? r[pile].below < below
 507                    /* ... shorter pile otherwise */
 508                                  : r[pile].below > below))
 509                         continue;
 510
 511                 from = pile;
 512                 above = r[pile].above;
 513                 below = r[pile].below;
 514         }
 515
 516         /* 3. move cards over and return: */
 517 #ifdef KLONDIKE
 518         /* prefer waste if it wouldn't turn_over: */
 519         if (!turn && w2t(WASTE, to, 0) == OK)
 520                 return OK;
 521         if (from < 0) /* nothing found */
 522                 return ERR;
 523         return t2t(from, to, 0);
 524 #elif defined SPIDER
 525         if (from < 0) /* nothing found */
 526                 return ERR;
 527         int bottom = first_movable(f.t[from]);
 528         return t2t(from, to, get_rank(f.t[from][bottom]));
 529 #endif
 530 }
 531 #undef would_empty
 532 #undef would_turn
 533 #undef would_complete
 534 int nop(int from, int to, int opt) { (void)from;(void)to;(void)opt;return ERR; }
 535 // }}}
 536
 537 // keyboard input handling {{{
 538 // cursor functions{{{
 539 #ifdef KLONDIKE
 540 void cursor_left (struct cursor* cursor) {
 541         if (is_tableu(cursor->pile)) {
 542                 if (cursor->pile > 0) cursor->pile--;
 543                 cursor->opt = 0;
 544         } else { /* stock/waste/foundation*/
 545                 switch (cursor->pile) {
 546                 case WASTE: cursor->pile = STOCK; cursor->opt = 0; break;
 547                 case FOUNDATION:
 548                         if (cursor->opt <= 0)
 549                                 cursor->pile = WASTE;
 550                         else
 551                                 cursor->opt--;
 552                 }
 553         }
 554 }
 555 void cursor_down (struct cursor* cursor) {
 556         if (!is_tableu(cursor->pile)) {
 557                 switch (cursor->pile) {
 558                 case STOCK: cursor->pile = TAB_1; break;
 559                 case WASTE: cursor->pile = TAB_2; break;
 560                 case FOUNDATION:
 561                         cursor->pile = TAB_4 + cursor->opt;
 562                 }
 563                 cursor->opt = 0;
 564         }
 565 }
 566 void cursor_up (struct cursor* cursor) {
 567         if (is_tableu(cursor->pile)) {
 568                 switch (cursor->pile) { //ugly :|
 569                 case TAB_1: cursor->pile = STOCK; break;
 570                 case TAB_2: cursor->pile = WASTE; break;
 571                 case TAB_3: cursor->pile = WASTE; break;
 572                 case TAB_4: case TAB_5: case TAB_6: case TAB_7:
 573                         cursor->opt=cursor->pile-TAB_4;
 574                         cursor->pile = FOUNDATION;
 575                         break;
 576                 }
 577         }
 578 }
 579 void cursor_right (struct cursor* cursor) {
 580         if (is_tableu(cursor->pile)) {
 581                 if (cursor->pile < TAB_MAX) cursor->pile++;
 582         } else {
 583                 switch (cursor->pile) {
 584                 case STOCK: cursor->pile = WASTE; break;
 585                 case WASTE: cursor->pile = FOUNDATION;cursor->opt = 0; break;
 586                 case FOUNDATION:
 587                         if (cursor->opt < NUM_SUITS-1)
 588                                 cursor->opt++;
 589                 }
 590         }
 591 }
 592 #elif defined SPIDER
 593 /*NOTE: one can't highlight the stock due to me being too lazy to implement it*/
 594 void cursor_left (struct cursor* cursor) {
 595         if (cursor->pile > 0) cursor->pile--;
 596         cursor->opt = 0;
 597 }
 598 void cursor_down (struct cursor* cursor) {
 599         int first = first_movable(f.t[cursor->pile]);
 600         int top = find_top(f.t[cursor->pile]);
 601         if (first + cursor->opt < top)
 602                 cursor->opt++;
 603 }
 604 void cursor_up (struct cursor* cursor) {
 605         if (cursor->opt > 0) cursor->opt--;
 606 }
 607 void cursor_right (struct cursor* cursor) {
 608         if (cursor->pile < TAB_MAX) cursor->pile++;
 609         cursor->opt = 0;
 610 }
 611 #endif
 612 void cursor_to (struct cursor* cursor, int pile) {
 613         cursor->pile = pile;
 614         cursor->opt = 0;
 615 }
 616 //}}}
 617 int get_cmd (int* from, int* to, int* opt) {
 618         int _f, t;
 619         unsigned char mouse[3];
 620         struct cursor inactive = {-1,-1};
 621         static struct cursor active = {0,0};
 622         active.opt = 0; /* always reset offset, but keep pile */
 623
 624         /***/
 625 from_l: print_table(&active, &inactive);
 626         _f = getch(mouse);
 627
 628         switch (_f) {
 629         /* direct addressing: */
 630         case '1': *from = TAB_1; break;
 631         case '2': *from = TAB_2; break;
 632         case '3': *from = TAB_3; break;
 633         case '4': *from = TAB_4; break;
 634         case '5': *from = TAB_5; break;
 635         case '6': *from = TAB_6; break;
 636         case '7': *from = TAB_7; break;
 637 #ifdef SPIDER
 638         case '8': *from = TAB_8; break;
 639         case '9': *from = TAB_9; break;
 640         case '0': *from = TAB_10;break;
 641 #elif defined KLONDIKE
 642         case '9': *from = WASTE; break;
 643         case '0': *from = FOUNDATION; break;
 644         case '8': /* fallthrough */
 645 #endif
 646         case '\n': /* shortcut for dealing from stock */
 647                 *from = STOCK;
 648                 *to = WASTE;
 649                 return CMD_MOVE;
 650         /* cursor keys addressing: */
 651         case KEY_LEFT:
 652         case 'h': cursor_left (&active); goto from_l;
 653         case KEY_DOWN:
 654         case 'j': cursor_down (&active); goto from_l;
 655         case KEY_UP:
 656         case 'k': cursor_up   (&active); goto from_l;
 657         case KEY_RIGHT:
 658         case 'l': cursor_right(&active); goto from_l;
 659         case KEY_HOME:
 660         case 'H': cursor_to(&active,TAB_1);  goto from_l; /* leftmost  tableu */
 661         case KEY_END:
 662         case 'L': cursor_to(&active,TAB_MAX);goto from_l; /* rigthmost tableu */
 663         case KEY_INS:
 664         case 'M': cursor_to(&active,TAB_MAX/2); goto from_l; /* center tableu */
 665         case ' ': /* continue with second cursor */
 666                 *from = active.pile;
 667                 if (*from == STOCK) {
 668                         *to = WASTE;
 669                         return CMD_MOVE;
 670                 }
 671 #ifdef KLONDIKE
 672                 *opt = active.opt; /* when FOUNDATION */
 673 #endif
 674                 inactive = active;
 675                 break;
 676         /* mouse addressing: */
 677         case MOUSE_MIDDLE:
 678         case MOUSE_RIGHT: return CMD_NONE;
 679         case MOUSE_LEFT:
 680                 {
 681                 int pile = term2pile(mouse);
 682                 if (pile < 0) return CMD_INVAL;
 683                 *from = pile;
 684 #ifdef KLONDIKE
 685                 if (pile >= FOUNDATION)
 686                         *from = FOUNDATION,
 687                         *opt  = pile - FOUNDATION;
 688 #endif
 689                 break;
 690                 }
 691         /* misc keys: */
 692         case ':':
 693                 {char buf[256];
 694                 fprintf (stderr, ":");
 695                 raw_mode(0); /* turn on echo */
 696                 fgets (buf, 256, stdin);
 697                 raw_mode(1);
 698                 switch(buf[0]) {
 699                 case 'q': return CMD_QUIT;
 700                 case 'n': return CMD_NEW;
 701                 case 'r': return CMD_AGAIN;
 702                 default:  return CMD_INVAL;
 703                 }}
 704         case 'J':
 705                 *to = active.pile;
 706 #ifdef KLONDIKE
 707                 if (*to == FOUNDATION) return CMD_JOIN;
 708 #endif
 709                 if (*to > TAB_MAX) return CMD_INVAL;
 710                 return CMD_JOIN;
 711         case 'K': /* fallthrough */
 712         case '?': return CMD_HINT;
 713         case 'u': return CMD_UNDO;
 714         case EOF: return CMD_NONE; /* sent by SIGCONT */
 715         default: return CMD_INVAL;
 716         }
 717         inactive.pile = *from; /* for direct addressing highlighting */
 718         if (is_tableu(*from) && f.t[*from][0] == NO_CARD) return CMD_INVAL;
 719
 720         /***/
 721 to_l:   print_table(&active, &inactive);
 722         t = getch(mouse);
 723
 724         switch (t) {
 725         case KEY_LEFT:
 726         case 'h': cursor_left (&active); goto to_l;
 727         case KEY_DOWN:
 728         case 'j': cursor_down (&active); goto to_l;
 729         case KEY_UP:
 730         case 'k': cursor_up   (&active); goto to_l;
 731         case KEY_RIGHT:
 732         case 'l': cursor_right(&active); goto to_l;
 733         case KEY_HOME:
 734         case 'H': cursor_to(&active,TAB_1);     goto to_l;
 735         case KEY_END:
 736         case 'L': cursor_to(&active,TAB_MAX);   goto to_l;
 737         case KEY_INS:
 738         case 'M': cursor_to(&active,TAB_MAX/2); goto to_l;
 739         case 'J': /* fallthrough; just join selected pile */
 740         case ' ':
 741                 *to = active.pile;
 742                 break; /* continues with the foundation/empty tableu check */
 743         case MOUSE_MIDDLE:
 744         case MOUSE_RIGHT: return CMD_NONE;
 745         case MOUSE_LEFT:
 746                 {
 747                 int pile = term2pile(mouse);
 748                 if (pile < 0) return CMD_INVAL;
 749                 *to = pile;
 750 #ifdef KLONDIKE
 751                 if (pile >= FOUNDATION)
 752                         *to = FOUNDATION,
 753                         *opt  = pile - FOUNDATION;
 754 #endif
 755                 break;
 756                 }
 757         case 'K': /* fallthrough */
 758         case '?': return CMD_HINT;
 759         case 'u': return CMD_NONE; /* cancel selection */
 760         case EOF: return CMD_NONE; /* sent by SIGCONT */
 761         default:
 762                 if (t < '0' || t > '9') return CMD_INVAL;
 763                 if (t == '0')
 764 #ifdef KLONDIKE
 765                         *to = FOUNDATION;
 766 #elif defined SPIDER
 767                         *to = TAB_10;
 768 #endif
 769                 else
 770                         *to = t-'1';
 771         }
 772
 773         /***/
 774 #ifdef KLONDIKE
 775         if (*from == FOUNDATION) {
 776                 int top = find_top(f.t[*to]);
 777                 if (top < 0) return CMD_INVAL;
 778                 int color = get_color(f.t[*to][top]);
 779                 int choice_1 = 1-color; /* selects piles of   */
 780                 int choice_2 = 2+color; /* the opposite color */
 781                 int top_c1 = find_top(f.f[choice_1]);
 782                 int top_c2 = find_top(f.f[choice_2]);
 783
 784                 switch ((rank_next(f.f[choice_1][top_c1], f.t[*to][top])
 785                          && top_c1 >= 0 ) << 0
 786                        |(rank_next(f.f[choice_2][top_c2], f.t[*to][top])
 787                          && top_c2 >= 0 ) << 1) {
 788                 case (       1<<0): *opt = choice_1; break; /* choice_1 only */
 789                 case (1<<1       ): *opt = choice_2; break; /* choice_2 only */
 790                 case (1<<1 | 1<<0): /* both, ask user which to pick from */
 791                         printf ("take from (1-4): "); fflush (stdout);
 792                         *opt = getch(NULL) - '1';
 793                         if (*opt < 0 || *opt > 3) return CMD_INVAL;
 794                         break;
 795                 default: return CMD_INVAL; /* none matched */
 796                 }
 797                 /* `opt` is the foundation index (0..3) */
 798         }
 799 #elif defined SPIDER
 800         /* moving to empty tableu? */
 801         if (is_tableu(*to) && f.t[*to][0] == NO_CARD) {
 802                 int bottom = first_movable(f.t[*from]);
 803                 if (inactive.opt >= 0) { /*if from was cursor addressed: */
 804                         *opt = get_rank(f.t[*from][bottom + inactive.opt]);
 805                         return CMD_MOVE;
 806                 }
 807                 int top = find_top(f.t[*from]);
 808                 if (top < 0) return CMD_INVAL;
 809                 if (top >= 0 && !is_movable(f.t[*from], top-1)) {
 810                         *opt = get_rank(f.t[*from][top]);
 811                 } else { /* only ask the user if it's unclear: */
 812                         printf ("\rup to ([a23456789xjqk] or space/return): ");
 813                         *opt = getch(NULL);
 814                         switch (*opt) {
 815                         case ' ': *opt = get_rank(f.t[*from][top]); break;
 816                         case'\n': *opt = get_rank(f.t[*from][bottom]); break;
 817                         case 'a': case 'A': *opt = RANK_A; break;
 818                         case '0': /* fallthrough */
 819                         case 'x': case 'X': *opt = RANK_X; break;
 820                         case 'j': case 'J': *opt = RANK_J; break;
 821                         case 'q': case 'Q': *opt = RANK_Q; break;
 822                         case 'k': case 'K': *opt = RANK_K; break;
 823                         default: *opt -= '1';
 824                         }
 825                         if (*opt < RANK_A || *opt > RANK_K) return ERR;
 826                 }
 827                 /* `opt` is the rank of the highest card to move */
 828         }
 829 #endif
 830         return CMD_MOVE;
 831 }
 832
 833 int getctrlseq(unsigned char* buf) {
 834         int c;
 835         enum esc_states {
 836                 START,
 837                 ESC_SENT,
 838                 CSI_SENT,
 839                 MOUSE_EVENT,
 840         } state = START;
 841         int offset = 0x20; /* never sends control chars as data */
 842         while ((c = getchar()) != EOF) {
 843                 switch (state) {
 844                 case START:
 845                         switch (c) {
 846                         case '\033': state=ESC_SENT; break;
 847                         default: return c;
 848                         }
 849                         break;
 850                 case ESC_SENT:
 851                         switch (c) {
 852                         case '[': state=CSI_SENT; break;
 853                         default: return KEY_INVAL;
 854                         }
 855                         break;
 856                 case CSI_SENT:
 857                         switch (c) {
 858                         case 'A': return KEY_UP;
 859                         case 'B': return KEY_DOWN;
 860                         case 'C': return KEY_RIGHT;
 861                         case 'D': return KEY_LEFT;
 862                         /*NOTE: home/end send ^[[x~ . no support for modifiers*/
 863                         case 'H': return KEY_HOME;
 864                         case 'F': return KEY_END;
 865                         case '2': getchar(); return KEY_INS;
 866                         case '5': getchar(); return KEY_PGUP;
 867                         case '6': getchar(); return KEY_PGDN;
 868                         case 'M': state=MOUSE_EVENT; break;
 869                         default: return KEY_INVAL;
 870                         }
 871                         break;
 872                 case MOUSE_EVENT:
 873                         if (buf == NULL) return KEY_INVAL;
 874                         buf[0] = c - offset;
 875                         buf[1] = getchar() - offset;
 876                         buf[2] = getchar() - offset;
 877                         return MOUSE_ANY;
 878                 default:
 879                         return KEY_INVAL;
 880                 }
 881         }
 882         return 2;
 883 }
 884 int term2pile(unsigned char *mouse) {
 885         int line   = (mouse[2]-1);
 886         int column = (mouse[1]-1) / op.s->width;
 887
 888         if (line < op.s->height) { /* first line */
 889 #ifdef KLONDIKE
 890                 switch (column) {
 891                 case 0: return STOCK;
 892                 case 1: return WASTE;
 893                 case 2: return -1; /* spacer */
 894                 case 3: return FOUNDATION+0;
 895                 case 4: return FOUNDATION+1;
 896                 case 5: return FOUNDATION+2;
 897                 case 6: return FOUNDATION+3;
 898                 }
 899 #elif defined SPIDER
 900                 if (column < 2) return STOCK;
 901                 return -1;
 902 #endif
 903         } else if (line > op.s->height) { /* tableu */
 904                 if (column <= TAB_MAX) return column;
 905         }
 906         return -1;
 907 }
 908 int wait_mouse_up(unsigned char* mouse) {
 909         unsigned char mouse2[3];
 910         struct cursor cur = {-1,-1};
 911         int level = 1;
 912
 913         /* display a cursor while mouse button is pushed: */
 914         int pile = term2pile(mouse);
 915         cur.pile = pile;
 916 #ifdef KLONDIKE
 917         if (pile >= FOUNDATION) {
 918                 cur.pile = FOUNDATION;
 919                 cur.opt = pile-FOUNDATION;
 920         }
 921 #endif
 922         print_table(&cur, NO_HI); //TODO: should not overwrite inactive cursor!
 923
 924         while (level > 0) {
 925                 if (getctrlseq (mouse2) == MOUSE_ANY) {
 926                         /* ignore mouse wheel events: */
 927                         if (mouse2[0] & 0x40) continue;
 928
 929                         else if((mouse2[0]&3) == 3) level--; /* release event */
 930                         else level++; /* another button pressed */
 931                 }
 932         }
 933
 934         //print_table(NO_HI, NO_HI);//TODO:probably redundant, as screen gets redrawn afterwards anyways
 935
 936         return mouse[1] == mouse2[1] && mouse[2] == mouse2[2];
 937 }
 938
 939 int getch(unsigned char* buf) {
 940 /* returns a character, EOF, or constant for an escape/control sequence - NOT
 941 compatible with the ncurses implementation of same name */
 942         int action = getctrlseq(buf);
 943
 944         switch (action) {
 945         case MOUSE_ANY:
 946                 if (buf[0] > 3) break; /* ignore wheel events */
 947                 int success = wait_mouse_up(buf);
 948
 949                 /* mouse moved while pressed: */
 950                 if (!success) return KEY_INVAL;
 951                 //TODO:if moved while pressed: interpret second location as 'to'
 952
 953                 switch (buf[0]) {
 954                 case 0: return MOUSE_LEFT;
 955                 case 1: return MOUSE_MIDDLE;
 956                 case 2: return MOUSE_RIGHT;
 957                 }
 958         }
 959
 960         return action;
 961 }
 962 // }}}
 963
 964 // shuffling and dealing {{{
 965 void deal(long seed) {
 966         f = (const struct playfield){0}; /* clear playfield */
 967         card_t deck[DECK_SIZE*NUM_DECKS];
 968         int avail = DECK_SIZE*NUM_DECKS;
 969         for (int i = 0; i < DECK_SIZE*NUM_DECKS; i++) deck[i] = (i%DECK_SIZE)+1;
 970 #ifdef SPIDER
 971         if (op.m != NORMAL) for (int i = 0; i < DECK_SIZE*NUM_DECKS; i++) {
 972                 if (op.m == MEDIUM) deck[i] = 1+((deck[i]-1) | 2);
 973                 if (op.m == EASY)   deck[i] = 1+((deck[i]-1) | 2 | 1);
 974                 /* the 1+ -1 dance gets rid of the offset created by NO_CARD */
 975         }
 976 #endif
 977         srand (seed);
 978         for (int i = DECK_SIZE*NUM_DECKS-1; i > 0; i--) { /* fisher-yates */
 979                 int j = rand() % (i+1);
 980                 if (j-i) deck[i]^=deck[j],deck[j]^=deck[i],deck[i]^=deck[j];
 981         }
 982
 983         /* deal cards: */
 984         for (int i = 0; i < NUM_PILES; i++) {
 985 #ifdef KLONDIKE
 986                 int closed = i; /* pile n has n closed cards, then 1 open */
 987 #elif defined SPIDER
 988                 int closed = i<4?5:4; /* pile 1-4 have 5, 5-10 have 4 closed */
 989 #endif
 990                 /* face down cards are negated: */
 991                 for (int j = 0; j < closed; j++) f.t[i][j] = -deck[--avail];
 992                 f.t[i][closed] = deck[--avail]; /* the face-up card */
 993         }
 994         /* rest of the cards to the stock; NOTE: assert(avail==50) for spider */
 995         for (f.z = 0; avail; f.z++) f.s[f.z] = deck[--avail];
 996 #ifdef KLONDIKE
 997         f.w = -1; /* @start: nothing on waste */
 998 #elif defined SPIDER
 999         f.w = 0; /* number of used foundations */
1000 #endif
1001
1002         f.u = &undo_sentinel;
1003 }
1004 //}}}
1005
1006 // screen drawing routines {{{
1007 void print_hi(int invert, int grey_bg, int bold, char* str) {
1008         if (bold && op.s == &unicode_large_color){ //awful hack for bold + faint
1009                 int offset = str[3]==017?16:str[4]==017?17:0;
1010                 printf ("%s%s%s""%.*s%s%s""%s%s%s",
1011                         "\033[1m", invert?"\033[7m":"", grey_bg?"\033[100m":"",
1012                         offset, str, bold?"\033[1m":"", str+offset,
1013                         grey_bg?"\033[49m":"", invert?"\033[27m":"","\033[22m");
1014                 return;
1015         }
1016         printf ("%s%s%s%s%s%s%s",
1017                 bold?"\033[1m":"", invert?"\033[7m":"", grey_bg?"\033[100m":"",
1018                 str,
1019                 grey_bg?"\033[49m":"", invert?"\033[27m":"",bold?"\033[22m":"");
1020 }
1021 void print_table(const struct cursor* active, const struct cursor* inactive) {
1022         printf("\033[2J\033[H"); /* clear screen, reset cursor */
1023 #ifdef KLONDIKE
1024         /* print stock, waste and foundation: */
1025         for (int line = 0; line < op.s->height; line++) {
1026                 /* stock: */
1027                 print_hi (active->pile == STOCK, inactive->pile == STOCK, 1, (
1028                         (f.w < f.z-1)?op.s->facedown
1029                         :op.s->placeholder)[line]);
1030                 /* waste: */
1031                 print_hi (active->pile == WASTE, inactive->pile == WASTE, 1, (
1032                         /* NOTE: cast, because f.w sometimes is (short)-1 !? */
1033                         ((short)f.w >= 0)?op.s->card[f.s[f.w]]
1034                         :op.s->placeholder)[line]);
1035                 printf ("%s", op.s->card[NO_CARD][line]); /* spacer */
1036                 /* foundation: */
1037                 for (int pile = 0; pile < NUM_SUITS; pile++) {
1038                         int card = find_top(f.f[pile]);
1039                         print_hi (active->pile==FOUNDATION && active->opt==pile,
1040                                 inactive->pile==FOUNDATION && (
1041                                         /* cursor addr.     || direct addr.   */
1042                                         inactive->opt==pile || inactive->opt < 0
1043                                 ), 1,
1044                                 (card < 0)?op.s->placeholder[line]
1045                                 :op.s->card[f.f[pile][card]][line]);
1046                 }
1047                 printf("\n");
1048         }
1049         printf("\n");
1050 #elif defined SPIDER
1051         int fdone; for (fdone = NUM_DECKS*NUM_SUITS; fdone; fdone--)
1052                 if (f.f[fdone-1][RANK_K]) break;  /*number of completed stacks*/
1053         int spacer_from = f.z?(f.z/10-1) * op.s->halfwidth[0] + op.s->width:0;
1054         int spacer_to   = NUM_PILES*op.s->width -
1055                 ((fdone?(fdone-1) * op.s->halfwidth[1]:0)+op.s->width);
1056         for (int line = 0; line < op.s->height; line++) {
1057                 /* available stock: */
1058                 for (int i = f.z/10; i; i--) {
1059                         if (i==1) printf ("%s", op.s->facedown[line]);
1060                         else      printf ("%s", op.s->halfstack[line]);
1061                 }
1062                 /* spacer: */
1063                 for (int i = spacer_from; i < spacer_to; i++) printf (" ");
1064                 /* foundation (overlapping): */
1065                 for (int i = NUM_DECKS*NUM_SUITS-1, half = 0; i >= 0; i--) {
1066                         int overlap = half? op.s->halfcard[line]: 0;
1067                         if (f.f[i][RANK_K]) printf ("%.*s", op.s->halfwidth[2],
1068                                 op.s->card[f.f[i][RANK_K]][line]+overlap),
1069                                 half++;
1070                 }
1071                 printf("\n");
1072         }
1073         printf("\n");
1074 #endif
1075 #ifdef KLONDIKE
1076 #define DO_HI(cursor) (cursor->pile == pile && (movable || empty))
1077 #define TOP_HI(c) 1 /* can't select partial stacks in KLONDIKE */
1078 #define INC_OFFSET
1079 #elif defined SPIDER
1080         int offset[NUM_PILES]={1,1,1,1,1,1,1,1,1,1}; // :|
1081 #define DO_HI(cursor) (cursor->pile == pile && (movable || empty) \
1082         && offset[pile] > cursor->opt)
1083 #define TOP_HI(cursor) (cursor->pile == pile && movable \
1084         && offset[pile]-1 == cursor->opt)
1085 #define INC_OFFSET if (movable) offset[pile]++
1086 #endif
1087         /* print tableu piles: */
1088         int row[NUM_PILES] = {0};
1089         int line[NUM_PILES]= {0};
1090         int label[NUM_PILES]={0};
1091         int line_had_card;
1092         int did_placeholders = 0;
1093         do {
1094                 line_had_card = 0;
1095                 for (int pile = 0; pile < NUM_PILES; pile++) {
1096                         card_t card = f.t[pile][row[pile]];
1097                         card_t next = f.t[pile][row[pile]+1];
1098                         int movable = is_movable(f.t[pile], row[pile]);
1099                         int empty   = !card && row[pile] == 0;
1100
1101                         print_hi (DO_HI(active), DO_HI(inactive), movable, (
1102                                 (!card && row[pile] == 0)?op.s->placeholder
1103                                 :(card<0)?op.s->facedown
1104                                 :op.s->card[card]
1105                                 )[line[pile]]);
1106
1107                         int extreme_overlap = ( 3  /* spacer, labels, status */
1108                                 + 2 * op.s->height /* stock, top tableu card */
1109                                 + find_top(f.t[pile]) * op.s->overlap) >op.w[0];
1110                         /* normal overlap: */
1111                         if (++line[pile] >= (next?op.s->overlap:op.s->height)
1112                         /* extreme overlap on closed cards: */
1113                         || (extreme_overlap &&
1114                             line[pile] >= 1 &&
1115                             f.t[pile][row[pile]] < 0 &&
1116                             f.t[pile][row[pile]+1] <0)
1117                         /* extreme overlap on sequences: */
1118                         || (extreme_overlap &&
1119                             !TOP_HI(active) && /*always show top selected card*/
1120                             line[pile] >= 1 && row[pile] > 0 &&
1121                             f.t[pile][row[pile]-1] > NO_CARD &&
1122                             is_consecutive (f.t[pile], row[pile]) &&
1123                             is_consecutive (f.t[pile], row[pile]-1) &&
1124                             f.t[pile][row[pile]+1] != NO_CARD)
1125                         ) {
1126                                 line[pile]=0;
1127                                 row[pile]++;
1128                                 INC_OFFSET;
1129                         }
1130                         /* tableu labels: */
1131                         if(!card && !label[pile] && row[pile]>0&&line[pile]>0) {
1132                                 label[pile] = 1;
1133                                 printf ("\b\b%d ", (pile+1) % 10); //XXX: hack
1134                         }
1135                         line_had_card |= !!card;
1136                         did_placeholders |= row[pile] > 0;
1137                 }
1138                 printf ("\n");
1139         } while (line_had_card || !did_placeholders);
1140 }
1141
1142 void visbell (void) {
1143         printf ("\033[?5h"); fflush (stdout);
1144         usleep (100000);
1145         printf ("\033[?5l"); fflush (stdout);
1146 }
1147 void win_anim(void) {
1148         printf ("\033[?25l"); /* hide cursor */
1149         for (;;) {
1150                 /* set cursor to random location */
1151                 int row = 1+rand()%(24-op.s->width);
1152                 int col = 1+rand()%(80-op.s->height);
1153
1154                 /* draw random card */
1155                 int face = 1 + rand() % 52;
1156                 for (int l = 0; l < op.s->height; l++) {
1157                         printf ("\033[%d;%dH", row+l, col);
1158                         printf ("%s", op.s->card[face][l]);
1159                 }
1160                 fflush (stdout);
1161
1162                 /* exit on keypress */
1163                 struct pollfd p = {STDIN_FILENO, POLLIN, 0};
1164                 if (poll (&p, 1, 80)) goto fin;
1165         }
1166 fin:
1167         printf ("\033[?25h"); /* show cursor */
1168         return;
1169 }
1170 //}}}
1171
1172 // undo logic {{{
1173 void undo_push (int _f, int t, int n, int o) {
1174         struct undo* new = malloc(sizeof(struct undo));
1175         new->f = _f;
1176         new->t = t;
1177         new->n = n;
1178         new->o = o;
1179         new->prev = f.u;
1180         new->next = NULL;
1181         f.u->next = new;
1182         f.u = f.u->next;
1183 }
1184 void undo_pop (struct undo* u) {
1185         if (u == &undo_sentinel) return;
1186
1187 #ifdef KLONDIKE
1188         if (u->f == FOUNDATION) {
1189                 /* foundation -> tableu */
1190                 int top_f = find_top(f.f[u->n]);
1191                 int top_t = find_top(f.t[u->t]);
1192                 f.f[u->n][top_f+1] = f.t[u->t][top_t];
1193                 f.t[u->t][top_t] = NO_CARD;
1194         } else if (u->f == WASTE && u->t == FOUNDATION) {
1195                 /* waste -> foundation */
1196                 /* split u->n into wst and fnd: */
1197                 int wst = u->n & 0xffff;
1198                 int fnd = u->n >> 16;
1199                 /* move stock cards one position up to make room: */
1200                 for (int i = f.z; i >= wst; i--) f.s[i+1] = f.s[i];
1201                 /* move one card from foundation to waste: */
1202                 int top = find_top(f.f[fnd]);
1203                 f.s[wst] = f.f[fnd][top];
1204                 f.f[fnd][top] = NO_CARD;
1205                 f.z++;
1206                 f.w++;
1207         } else if (u->f == WASTE) {
1208                 /* waste -> tableu */
1209                 /* move stock cards one position up to make room: */
1210                 for (int i = f.z; i >= u->n; i--) f.s[i+1] = f.s[i];
1211                 /* move one card from tableu to waste: */
1212                 int top = find_top(f.t[u->t]);
1213                 f.s[u->n] = f.t[u->t][top];
1214                 f.t[u->t][top] = NO_CARD;
1215                 f.z++;
1216                 f.w++;
1217         } else if (u->t == FOUNDATION) {
1218                 /* tableu -> foundation */
1219                 int top_f = find_top(f.t[u->f]);
1220                 int top_t = find_top(f.f[u->n]);
1221                 /* close topcard if previous action caused turn_over(): */
1222                 if (u->o) f.t[u->f][top_f] *= -1;
1223                 /* move one card from foundation to tableu: */
1224                 f.t[u->f][top_f+1] = f.f[u->n][top_t];
1225                 f.f[u->n][top_t] = NO_CARD;
1226         } else {
1227                 /* tableu -> tableu */
1228                 int top_f = find_top(f.t[u->f]);
1229                 int top_t = find_top(f.t[u->t]);
1230                 /* close topcard if previous action caused turn_over(): */
1231                 if (u->o) f.t[u->f][top_f] *= -1;
1232                 /* move n cards from tableu[f] to tableu[t]: */
1233                 for (int i = 0; i < u->n; i++) {
1234                         f.t[u->f][top_f+u->n-i] = f.t[u->t][top_t-i];
1235                         f.t[u->t][top_t-i] = NO_CARD;
1236                 }
1237         }
1238 #elif defined SPIDER
1239         if (u->f == STOCK) {
1240                 /* stock -> tableu */
1241                 /*remove a card from each pile and put it back onto the stock:*/
1242                 for (int pile = NUM_PILES-1; pile >= 0; pile--) {
1243                         int top = find_top(f.t[pile]);
1244                         f.s[f.z++] = f.t[pile][top];
1245                         f.t[pile][top] = NO_CARD;
1246                 }
1247         } else if (u->t == FOUNDATION) {
1248                 /* tableu -> foundation */
1249                 int top = find_top(f.t[u->f]);
1250                 /* close topcard if previous action caused turn_over(): */
1251                 if (u->o) f.t[u->f][top] *= -1;
1252                 /* append cards from foundation to tableu */
1253                 for (int i = RANK_K; i >= RANK_A; i--) {
1254                         f.t[u->f][++top] = f.f[u->n][i];
1255                         f.f[u->n][i] = NO_CARD;
1256                 }
1257                 f.w--; /* decrement complete-foundation-counter */
1258
1259         } else {
1260                 /* tableu -> tableu */
1261                 int top_f = find_top(f.t[u->f]);
1262                 int top_t = find_top(f.t[u->t]);
1263                 /* close topcard if previous action caused turn_over(): */
1264                 if (u->o) f.t[u->f][top_f] *= -1;
1265                 /* move n cards from tableu[f] to tableu[t]: */
1266                 for (int i = 0; i < u->n; i++) {
1267                         f.t[u->f][top_f+u->n-i] = f.t[u->t][top_t-i];
1268                         f.t[u->t][top_t-i] = NO_CARD;
1269                 }
1270         }
1271 #endif
1272
1273         void* old = f.u;
1274         f.u = f.u->prev;
1275         free(old);
1276 }
1277 void free_undo (struct undo* u) {
1278         while (u && u != &undo_sentinel) {
1279                 void* old = u;
1280                 u = u->prev;
1281                 free (old);
1282         }
1283 }
1284 //}}}
1285
1286 // initialization stuff {{{
1287 void screen_setup (int enable) {
1288         if (enable) {
1289                 raw_mode(1);
1290                 printf ("\033[s\033[?47h"); /* save cursor, alternate screen */
1291                 printf ("\033[H\033[J"); /* reset cursor, clear screen */
1292                 //TODO//printf ("\033[?1000h\033[?25l"); /* enable mouse, hide cursor */
1293                 printf ("\033[?1000h"); /* enable mouse */
1294         } else {
1295                 //TODO//printf ("\033[?9l\033[?25h"); /* disable mouse, show cursor */
1296                 printf ("\033[?9l"); /* disable mouse */
1297                 printf ("\033[?47l\033[u"); /* primary screen, restore cursor */
1298                 raw_mode(0);
1299         }
1300 }
1301
1302 void raw_mode(int enable) {
1303         static struct termios saved_term_mode;
1304         struct termios raw_term_mode;
1305
1306         if (enable) {
1307                 if (saved_term_mode.c_lflag == 0)/*don't overwrite stored mode*/
1308                         tcgetattr(STDIN_FILENO, &saved_term_mode);
1309                 raw_term_mode = saved_term_mode;
1310                 raw_term_mode.c_lflag &= ~(ICANON | ECHO);
1311                 raw_term_mode.c_cc[VMIN] = 1 ;
1312                 raw_term_mode.c_cc[VTIME] = 0;
1313                 tcsetattr(STDIN_FILENO, TCSAFLUSH, &raw_term_mode);
1314         } else {
1315                 tcsetattr(STDIN_FILENO, TCSAFLUSH, &saved_term_mode);
1316         }
1317 }
1318
1319 void signal_handler (int signum) {
1320         struct winsize w;
1321         switch (signum) {
1322         case SIGCONT:
1323                 screen_setup(0);
1324                 screen_setup(1);
1325                 print_table(NO_HI, NO_HI);
1326                 break;
1327         case SIGINT: //TODO: don't exit; just warn like vim does
1328                 exit(128+SIGINT);
1329         case SIGWINCH:
1330                 ioctl(STDOUT_FILENO, TIOCGWINSZ, &w);
1331                 op.w[0] = w.ws_row;
1332                 op.w[1] = w.ws_col;
1333                 break;
1334         }
1335 }
1336 void signal_setup(void) {
1337         struct sigaction saction;
1338
1339         saction.sa_handler = signal_handler;
1340         sigemptyset(&saction.sa_mask);
1341         saction.sa_flags = 0;
1342         if (sigaction(SIGCONT, &saction, NULL) < 0) {
1343                 perror ("SIGCONT");
1344                 exit (1);
1345         }
1346         if (sigaction(SIGINT, &saction, NULL) < 0) {
1347                 perror ("SIGINT");
1348                 exit (1);
1349         }
1350         if (sigaction(SIGWINCH, &saction, NULL) < 0) {
1351                 perror ("SIGWINCH");
1352                 exit (1);
1353         }
1354 }
1355 //}}}
1356
1357 //vim: foldmethod=marker