sol.c

   1 #define _DEFAULT_SOURCE
   2 #define _POSIX_C_SOURCE /* for sigaction */
   3 #include <poll.h>
   4 #include <signal.h>
   5 #include <stdio.h>
   6 #include <stdlib.h>
   7 #include <string.h>
   8 #include <time.h>
   9 #include <termios.h>
  10 #include <unistd.h>
  11
  12 #include "sol.h"
  13 #include "schemes.h"
  14
  15 struct playfield f;
  16 struct opts op;
  17
  18 // action table {{{
  19 /* stores a function pointer for every takeable action; called by game loop */
  20 int (*action[NUM_PLACES][10])(int,int,int) = {
  21 #ifdef KLONDIKE
  22         /* 1    2    3    4    5    6    7   stk  wst  fnd*/
  23 /* 1 */ { t2f, t2t, t2t, t2t, t2t, t2t, t2t, nop, nop, t2f },
  24 /* 2 */ { t2t, t2f, t2t, t2t, t2t, t2t, t2t, nop, nop, t2f },
  25 /* 3 */ { t2t, t2t, t2f, t2t, t2t, t2t, t2t, nop, nop, t2f },
  26 /* 4 */ { t2t, t2t, t2t, t2f, t2t, t2t, t2t, nop, nop, t2f },
  27 /* 5 */ { t2t, t2t, t2t, t2t, t2f, t2t, t2t, nop, nop, t2f },
  28 /* 6 */ { t2t, t2t, t2t, t2t, t2t, t2f, t2t, nop, nop, t2f },
  29 /* 7 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2f, nop, nop, t2f },
  30 /*stk*/ { nop, nop, nop, nop, nop, nop, nop, nop, s2w, nop },
  31 /*wst*/ { w2t, w2t, w2t, w2t, w2t, w2t, w2t, w2s, w2f, w2f },
  32 /*fnd*/ { f2t, f2t, f2t, f2t, f2t, f2t, f2t, nop, nop, nop },
  33 #elif defined SPIDER
  34         /* 1    2    3    4    5    6    7    8    9    10*/
  35 /* 1 */ { t2f, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t },
  36 /* 2 */ { t2t, t2f, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t },
  37 /* 3 */ { t2t, t2t, t2f, t2t, t2t, t2t, t2t, t2t, t2t, t2t },
  38 /* 4 */ { t2t, t2t, t2t, t2f, t2t, t2t, t2t, t2t, t2t, t2t },
  39 /* 5 */ { t2t, t2t, t2t, t2t, t2f, t2t, t2t, t2t, t2t, t2t },
  40 /* 6 */ { t2t, t2t, t2t, t2t, t2t, t2f, t2t, t2t, t2t, t2t },
  41 /* 7 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2f, t2t, t2t, t2t },
  42 /* 8 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2f, t2t, t2t },
  43 /* 9 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2f, t2t },
  44 /*10 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2f },
  45 /*stk*/ { s2t, s2t, s2t, s2t, s2t, s2t, s2t, s2t, s2t, s2t },
  46 #endif
  47 };
  48 // }}}
  49
  50 // argv parsing, game loops, cleanup {{{
  51 int main(int argc, char** argv) {
  52         /* opinionated defaults: */
  53         op.s = &unicode_large_color;
  54 #ifdef SPIDER
  55         op.m = MEDIUM;
  56 #endif
  57         op.v = 0;
  58
  59         int optget;
  60         opterr = 0; /* don't print message on unrecognized option */
  61         while ((optget = getopt (argc, argv, "+:hd:o:s:")) != -1) {
  62                 switch (optget) {
  63 #ifdef SPIDER
  64                 case 'd': /* difficulty */
  65                         if(!strcmp(optarg,   "easy")) op.m = EASY;
  66                         if(!strcmp(optarg, "medium")) op.m = MEDIUM;
  67                         if(!strcmp(optarg,   "hard")) op.m = NORMAL;
  68                         break;
  69 #endif
  70                 case 'o': /* misc. options */
  71                         if(!strcmp(optarg, "consv")) op.v = 1;
  72                         break;
  73                 case 's': /* scheme */
  74                         if(!strcmp(optarg,"color")) op.s = &unicode_large_color;
  75                         if(!strcmp(optarg, "mono")) op.s = &unicode_large_mono;
  76                         if(!strcmp(optarg,"small")) op.s = &unicode_small_mono;
  77                         break;
  78                 case 'h':
  79                 case ':': //missing optarg
  80                 default:
  81                         fprintf (stderr, SHORTHELP LONGHELP KEYHELP, argv[0]);
  82                         return optget != 'h';
  83                 }
  84         }
  85
  86         signal_setup();
  87         atexit (*quit);
  88
  89 newgame:
  90         screen_setup(1);
  91
  92         switch(sol()) {
  93         case GAME_NEW: goto newgame;
  94         case GAME_WON:
  95                 print_table(NO_HI, NO_HI);
  96                 win_anim();
  97                 if (getchar()=='q') return 0;
  98                 goto newgame;
  99         case GAME_QUIT: return 0;
 100         }
 101 }
 102
 103 int sol(void) {
 104         /* clean undo (from previous game): */
 105         free_undo(f.u);
 106
 107         deal();
 108
 109         int from, to, opt;
 110         for(;;) {
 111                 switch (get_cmd(&from, &to, &opt)) {
 112                 case CMD_MOVE:
 113                         switch (action[from][to](from,to,opt)) {
 114                         case OK:  break;
 115                         case ERR: visbell(); break;
 116                         case WON: return GAME_WON;
 117                         }
 118                         break;
 119                 case CMD_HINT: break;//TODO: show a possible (and sensible) move
 120                 case CMD_JOIN: break;//TODO: join any pile to here (longest if possible)
 121                 case CMD_UNDO: undo_pop(f.u); break;
 122                 case CMD_INVAL: visbell(); break;
 123                 case CMD_NEW:   return GAME_NEW;
 124                 case CMD_AGAIN: //TODO: restart with same seed
 125                 case CMD_QUIT:  return GAME_QUIT;
 126                 }
 127         }
 128 }
 129
 130 void quit(void) {
 131         screen_setup(0);
 132         /* free undo data structures: */
 133         free_undo(f.u);
 134 }
 135 //}}}
 136
 137 // card games helper functions {{{
 138 #define get_suit(card) \
 139         ((card-1) % NUM_SUITS)
 140 #define get_rank(card) \
 141         ((card-1) / NUM_SUITS)
 142 #define get_color(card) \
 143         ((get_suit(card) ^ get_suit(card)>>1) & 1)
 144
 145 #define is_tableu(where) (where <= TAB_MAX)
 146
 147 int find_top(card_t* pile) {
 148         int i;
 149         for(i=PILE_SIZE-1; i>=0 && !pile[i]; i--);
 150         return i;
 151 }
 152 int first_movable(card_t* pile) {
 153         int i = 0;
 154         for (;pile[i] && !is_movable(pile, i); i++);
 155         return i;
 156 }
 157 int turn_over(card_t* pile) {
 158         int top = find_top(pile);
 159         if (pile[top] < 0) {
 160                 pile[top] *= -1;
 161                 return 1;
 162         } else return 0;
 163 }
 164 int check_won(void) {
 165         for (int pile = 0; pile < NUM_DECKS*NUM_SUITS; pile++)
 166                 if (f.f[pile][NUM_RANKS-1] == NO_CARD) return 0;
 167
 168         return 1;
 169 }
 170 int rank_next (card_t a, card_t b) {
 171         return get_rank(a) == get_rank(b)-1;
 172 }
 173 int is_consecutive (card_t* pile, int pos) {
 174         if (pos+1 >= PILE_SIZE) return 1; /* card is last */
 175         if (pile[pos+1] == NO_CARD) return 1; /* card is first */
 176
 177 #ifdef KLONDIKE
 178         /* ranks consecutive? */
 179         if (!rank_next(pile[pos+1], pile[pos])) return 0;
 180         /* color opposite? */
 181         if (get_color(pile[pos+1]) == get_color(pile[pos])) return 0;
 182 #elif defined SPIDER
 183         /* ranks consecutive? */
 184         if (!rank_next(pile[pos+1], pile[pos])) return 0;
 185         /* same suit? */
 186         if (get_suit(pile[pos+1]) != get_suit(pile[pos])) return 0;
 187 #endif
 188
 189         return 1;
 190 }
 191
 192 int is_movable(card_t* pile, int n) {
 193 #ifdef KLONDIKE
 194         return(pile[n] > NO_CARD); /*non-movable cards don't exist in klondike*/
 195 #elif defined SPIDER
 196         int top = find_top(pile);
 197         for (int i = top; i >= 0; i--) {
 198                 if (pile[i] <= NO_CARD) return 0; /*no card or card face down?*/
 199                 if (!is_consecutive(pile, i)) return 0;
 200                 if (i == n) return 1; /* card reached, must be movable */
 201         }
 202         return 0;
 203 #endif
 204 }
 205 //}}}
 206
 207 // takeable actions {{{
 208 #ifdef KLONDIKE
 209 card_t stack_take(void) { /*NOTE: assert(f.w >= 0) */
 210         card_t card = f.s[f.w];
 211         /* move stack one over, so there are no gaps in it: */
 212         for (int i = f.w; i < f.z-1; i++)
 213                 f.s[i] = f.s[i+1];
 214         f.z--;
 215         f.w--; /* make previous card visible again */
 216         return card;
 217 }
 218 int t2f(int from, int to, int opt) { /* tableu to foundation */
 219         (void) to; (void) opt; /* don't need */
 220         int top_from = find_top(f.t[from]);
 221         to = get_suit(f.t[from][top_from]);
 222         int top_to   = find_top(f.f[to]);
 223         if ((top_to < 0 && get_rank(f.t[from][top_from]) == RANK_A)
 224         || (top_to >= 0 && rank_next(f.f[to][top_to],f.t[from][top_from]))) {
 225                 f.f[to][top_to+1] = f.t[from][top_from];
 226                 f.t[from][top_from] = NO_CARD;
 227                 undo_push(from, FOUNDATION, to,
 228                 turn_over(f.t[from]));
 229                 if (check_won()) return WON;
 230                 return OK;
 231         } else return ERR;
 232 }
 233 int w2f(int from, int to, int opt) { /* waste to foundation */
 234         (void) from; (void) to; (void) opt; /* don't need */
 235         if (f.w < 0) return ERR;
 236         to = get_suit(f.s[f.w]);
 237         int top_to = find_top(f.f[to]);
 238         if ((top_to < 0 && get_rank(f.s[f.w]) == RANK_A)
 239         || (top_to >= 0 && rank_next(f.f[to][top_to], f.s[f.w]))) {
 240                 undo_push(WASTE, FOUNDATION, f.w | to<<16, 0);//ugly encoding :|
 241                 f.f[to][top_to+1] = stack_take();
 242                 if (check_won()) return WON;
 243                 return OK;
 244         } else return ERR;
 245
 246 }
 247 int s2w(int from, int to, int opt) { /* stock to waste */
 248         (void) from; (void) to; (void) opt; /* don't need */
 249         if (f.z == 0) return ERR;
 250         f.w++;
 251         if (f.w == f.z) f.w = -1;
 252         return OK;
 253 }
 254 int w2s(int from, int to, int opt) { /* waste to stock (undo stock to waste) */
 255         (void) from; (void) to; (void) opt; /* don't need */
 256         if (f.z == 0) return ERR;
 257         f.w--;
 258         if (f.w < -1) f.w = f.z-1;
 259         return OK;
 260 }
 261 int f2t(int from, int to, int opt) { /* foundation to tableu */
 262         (void) from; /* don't need */
 263         int top_to = find_top(f.t[to]);
 264         from = opt;
 265         int top_from = find_top(f.f[from]);
 266
 267         if ((get_color(f.t[to][top_to]) != get_color(f.f[from][top_from]))
 268         && (rank_next(f.f[from][top_from], f.t[to][top_to]))) {
 269                 f.t[to][top_to+1] = f.f[from][top_from];
 270                 f.f[from][top_from] = NO_CARD;
 271                 undo_push(FOUNDATION, to, from, 0);
 272                 return OK;
 273         } else return ERR;
 274 }
 275 int w2t(int from, int to, int opt) { /* waste to tableu */
 276         (void) from; (void) opt; /* don't need */
 277         int top_to = find_top(f.t[to]);
 278         if (((get_color(f.t[to][top_to]) != get_color(f.s[f.w]))
 279            && (rank_next(f.s[f.w], f.t[to][top_to])))
 280         || (top_to < 0 && get_rank(f.s[f.w]) == RANK_K)) {
 281                 undo_push(WASTE, to, f.w, 0);
 282                 f.t[to][top_to+1] = stack_take();
 283                 return OK;
 284         } else return ERR;
 285 }
 286 int t2t(int from, int to, int opt) { /* tableu to tableu */
 287         (void) opt; /* don't need */
 288         int top_to = find_top(f.t[to]);
 289         int top_from = find_top(f.t[from]);
 290         int count = 0; //NOTE: could probably be factored out
 291         for (int i = top_from; i >=0; i--) {
 292                 if (((get_color(f.t[to][top_to]) != get_color(f.t[from][i]))
 293                    && (rank_next(f.t[from][i], f.t[to][top_to]))
 294                    && f.t[from][i] > NO_CARD) /* card face up? */
 295                 || (top_to < 0 && get_rank(f.t[from][i]) == RANK_K)) {
 296                         /* move cards [i..top_from] to their destination */
 297                         for (;i <= top_from; i++) {
 298                                 top_to++;
 299                                 f.t[to][top_to] = f.t[from][i];
 300                                 f.t[from][i] = NO_CARD;
 301                                 count++;
 302                         }
 303                         undo_push(from, to, count,
 304                         turn_over(f.t[from]));
 305                         return OK;
 306                 }
 307         }
 308         return ERR; /* no such move possible */
 309 }
 310 #elif defined SPIDER
 311 int remove_if_complete (int pileno) { //cleanup!
 312         static int foundation = 0;
 313         if (pileno == -1) return foundation--; /* for undo_pop() */
 314
 315         card_t* pile = f.t[pileno];
 316         /* test if K...A complete; move to foundation if so */
 317         int top_from = find_top(pile);
 318         if (get_rank(pile[top_from]) != RANK_A) return 0;
 319         for (int i = top_from; i>=0; i--) {
 320                 if (!is_consecutive (pile, i)) return 0;
 321                 if (i+RANK_K == top_from /* if ace to king: remove it */
 322                     && get_rank(pile[top_from-RANK_K]) == RANK_K) {
 323                         for(int i=top_from, j=0; i>top_from-NUM_RANKS; i--,j++){
 324                                 f.f[foundation][j] = pile[i];
 325                                 pile[i] = NO_CARD;
 326                         }
 327                         undo_push(pileno, FOUNDATION, foundation,
 328                         turn_over(pile));
 329                         foundation++;
 330                         return 1;
 331                 }
 332         }
 333
 334         return 0;
 335 }
 336 int t2t(int from, int to, int opt) { //in dire need of cleanup
 337         int top_from = find_top(f.t[from]);
 338         int top_to = find_top(f.t[to]);
 339         int empty_to = (top_to < 0)? opt: -1; /* empty pile? */
 340         int count = 0; //NOTE: could probably be factored out
 341
 342         for (int i = top_from; i >= 0; i--) {
 343                 if (!is_consecutive(f.t[from], i)) break;
 344
 345                 /* is consecutive OR to empty pile and rank ok? */
 346                 if (rank_next(f.t[from][i], f.t[to][top_to])
 347                 || (empty_to >= RANK_A && get_rank(f.t[from][i]) == empty_to)) {
 348                         for (;i <= top_from; i++) {
 349                                 top_to++;
 350                                 f.t[to][top_to] = f.t[from][i];
 351                                 f.t[from][i] = NO_CARD;
 352                                 count++;
 353                         }
 354                         undo_push(from, to, count,
 355                         turn_over(f.t[from]));
 356                         remove_if_complete(to);
 357                         if (check_won()) return WON;
 358                         return OK;
 359                 }
 360         }
 361
 362         return ERR; /* no such move possible */
 363 }
 364 int s2t(int from, int to, int opt) {
 365         (void) from; (void) to; (void) opt; /* don't need */
 366         if (f.z <= 0) return ERR; /* stack out of cards */
 367         for (int pile = 0; pile < NUM_PILES; pile++)
 368                 if (f.t[pile][0]==NO_CARD) return ERR; /*no piles may be empty*/
 369         for (int pile = 0; pile < NUM_PILES; pile++) {
 370                 f.t[pile][find_top(f.t[pile])+1] = f.s[--f.z];
 371                 remove_if_complete(pile);
 372                 if (check_won()) return WON;
 373         }
 374         undo_push(STOCK, TABLEU, 1, 0); /*NOTE: puts 1 card on each tableu pile*/
 375         return OK;
 376 }
 377 int t2f(int from, int to, int opt) {
 378         (void) to; (void) opt; /* don't need */
 379         /* manually retrigger remove_if_complete() (e.g. after undo_pop) */
 380         return remove_if_complete(from)?OK:ERR;
 381 }
 382 #endif
 383 int nop(int from, int to, int opt) { (void)from;(void)to;(void)opt;return ERR; }
 384 // }}}
 385
 386 // keyboard input handling {{{
 387 // cursor functions{{{
 388 #pragma GCC diagnostic ignored "-Wswitch" //not ideal :|
 389 #ifdef KLONDIKE
 390 void cursor_left (struct cursor* cursor) {
 391         if (is_tableu(cursor->pile)) {
 392                 if (cursor->pile > 0) cursor->pile--;
 393                 cursor->opt = 0;
 394         } else { /* stock/waste/foundation*/
 395                 switch (cursor->pile) {
 396                 case WASTE: cursor->pile = STOCK; cursor->opt = 0; break;
 397                 case FOUNDATION:
 398                         if (cursor->opt <= 0)
 399                                 cursor->pile = WASTE;
 400                         else
 401                                 cursor->opt--;
 402                 }
 403         }
 404 }
 405 void cursor_down (struct cursor* cursor) {
 406         if (!is_tableu(cursor->pile)) {
 407                 switch (cursor->pile) {
 408                 case STOCK: cursor->pile = TAB_1; break;
 409                 case WASTE: cursor->pile = TAB_2; break;
 410                 case FOUNDATION:
 411                         cursor->pile = TAB_4 + cursor->opt;
 412                 }
 413                 cursor->opt = 0;
 414         }
 415 }
 416 void cursor_up (struct cursor* cursor) {
 417         if (is_tableu(cursor->pile)) {
 418                 switch (cursor->pile) { //ugly :|
 419                 case TAB_1: cursor->pile = STOCK; break;
 420                 case TAB_2: cursor->pile = WASTE; break;
 421                 case TAB_3: cursor->pile = WASTE; break;
 422                 case TAB_4: case TAB_5: case TAB_6: case TAB_7:
 423                         cursor->opt=cursor->pile-TAB_4;
 424                         cursor->pile = FOUNDATION;
 425                         break;
 426                 }
 427         }
 428 }
 429 void cursor_right (struct cursor* cursor) {
 430         if (is_tableu(cursor->pile)) {
 431                 if (cursor->pile < TAB_MAX) cursor->pile++;
 432         } else {
 433                 switch (cursor->pile) {
 434                 case STOCK: cursor->pile = WASTE; break;
 435                 case WASTE: cursor->pile = FOUNDATION;cursor->opt = 0; break;
 436                 case FOUNDATION:
 437                         if (cursor->opt < NUM_DECKS*NUM_SUITS)
 438                                 cursor->opt++;
 439                 }
 440         }
 441 }
 442 #elif defined SPIDER
 443 /*NOTE: one can't highlight the stock due to me being too lazy to implement it*/
 444 void cursor_left (struct cursor* cursor) {
 445         if (cursor->pile > 0) cursor->pile--;
 446         cursor->opt = 0;
 447 }
 448 void cursor_down (struct cursor* cursor) {
 449         int first = first_movable(f.t[cursor->pile]);
 450         int top = find_top(f.t[cursor->pile]);
 451         if (first + cursor->opt < top)
 452                 cursor->opt++;
 453 }
 454 void cursor_up (struct cursor* cursor) {
 455         if (cursor->opt > 0) cursor->opt--;
 456 }
 457 void cursor_right (struct cursor* cursor) {
 458         if (cursor->pile < TAB_MAX) cursor->pile++;
 459         cursor->opt = 0;
 460 }
 461 #endif
 462 void cursor_to (struct cursor* cursor, int pile) {
 463         cursor->pile = pile;
 464         cursor->opt = 0;
 465 }
 466 #pragma GCC diagnostic pop
 467 //}}}
 468 int get_cmd (int* from, int* to, int* opt) {
 469         //TODO: escape sequences (mouse, cursor keys)
 470         int _f, t;
 471         struct cursor inactive = {-1,-1};
 472         static struct cursor active = {0,0};
 473         active.opt = 0; /* always reset offset, but keep pile */
 474
 475         /***/
 476 from_l: print_table(&active, &inactive);
 477         _f = getchar();
 478
 479         switch (_f) {
 480         /* direct addressing: */
 481         case '1': *from = TAB_1; break;
 482         case '2': *from = TAB_2; break;
 483         case '3': *from = TAB_3; break;
 484         case '4': *from = TAB_4; break;
 485         case '5': *from = TAB_5; break;
 486         case '6': *from = TAB_6; break;
 487         case '7': *from = TAB_7; break;
 488 #ifdef SPIDER
 489         case '8': *from = TAB_8; break;
 490         case '9': *from = TAB_9; break;
 491         case '0': *from = TAB_10;break;
 492 #elif defined KLONDIKE
 493         case '9': *from = WASTE; break;
 494         case '0': *from = FOUNDATION; break;
 495         case '8': /* fallthrough */
 496 #endif
 497         case '\n': /* shortcut for dealing from stock */
 498                 *from = STOCK;
 499                 *to = WASTE;
 500                 return CMD_MOVE;
 501         /* cursor keys addressing: */
 502         case 'h': cursor_left (&active); goto from_l;
 503         case 'j': cursor_down (&active); goto from_l;
 504         case 'k': cursor_up   (&active); goto from_l;
 505         case 'l': cursor_right(&active); goto from_l;
 506         case 'H': cursor_to(&active,TAB_1);  goto from_l; /* leftmost  tableu */
 507         case 'L': cursor_to(&active,TAB_MAX);goto from_l; /* rigthmost tableu */
 508         //TODO: real cursor keys, home/end
 509         case ' ': /* continue with second cursor */
 510                 *from = active.pile;
 511                 if (*from == STOCK) {
 512                         *to = WASTE;
 513                         return CMD_MOVE;
 514                 }
 515 #ifdef KLONDIKE
 516                 *opt = active.opt; /* when FOUNDATION */
 517 #endif
 518                 inactive = active;
 519                 break;
 520         /* misc keys: */
 521         case ':':
 522                 {char buf[256];
 523                 fprintf (stderr, ":");
 524                 raw_mode(0); /* turn on echo */
 525                 fgets (buf, 256, stdin);
 526                 raw_mode(1);
 527                 switch(buf[0]) {
 528                 case 'q': return CMD_QUIT;
 529                 case 'n': return CMD_NEW;
 530                 case 'r': return CMD_AGAIN;
 531                 default:  return CMD_INVAL;
 532                 }}
 533         case 'J': return CMD_JOIN;
 534         case 'K': /* fallthrough */
 535         case '?': return CMD_HINT;
 536         case 'u': return CMD_UNDO;
 537         case EOF: return CMD_NONE; /* sent by SIGCONT */
 538         default: return CMD_INVAL;
 539         }
 540         inactive.pile = *from; /* for direct addressing highlighting */
 541         if (is_tableu(*from) && f.t[*from][0] == NO_CARD) return CMD_INVAL;
 542
 543         /***/
 544 to_l:   print_table(&active, &inactive);
 545         t = getchar();
 546
 547         switch (t) {
 548         case 'h': cursor_left (&active); goto to_l;
 549         case 'j': cursor_down (&active); goto to_l;
 550         case 'k': cursor_up   (&active); goto to_l;
 551         case 'l': cursor_right(&active); goto to_l;
 552         case 'H': cursor_to(&active,TAB_1);  goto to_l;
 553         case 'L': cursor_to(&active,TAB_MAX);goto to_l;
 554         case 'J': /* fallthrough; key makes no sense on destination */
 555         case ' ':
 556                 *to = active.pile;
 557                 break; /* continues with the foundation/empty tableu check */
 558         case 'K': /* fallthrough */
 559         case '?': return CMD_HINT;
 560         case 'u': return CMD_NONE; /* cancel selection */
 561         case EOF: return CMD_NONE; /* sent by SIGCONT */
 562         default:
 563                 if (t < '0' || t > '9') return CMD_INVAL;
 564                 if (t == '0')
 565 #ifdef KLONDIKE
 566                         *to = FOUNDATION;
 567 #elif defined SPIDER
 568                         *to = TAB_10;
 569 #endif
 570                 else
 571                         *to = t-'1';
 572         }
 573
 574         /***/
 575 #ifdef KLONDIKE
 576         if (*from == FOUNDATION) {
 577                 int top = find_top(f.t[*to]);
 578                 if (top < 0) return CMD_INVAL;
 579                 int color = get_color(f.t[*to][top]);
 580                 int choice_1 = 1-color; /* selects piles of   */
 581                 int choice_2 = 2+color; /* the opposite color */
 582                 int top_c1 = find_top(f.f[choice_1]);
 583                 int top_c2 = find_top(f.f[choice_2]);
 584
 585                 switch ((rank_next(f.f[choice_1][top_c1], f.t[*to][top])
 586                          && top_c1 >= 0 ) << 0
 587                        |(rank_next(f.f[choice_2][top_c2], f.t[*to][top])
 588                          && top_c2 >= 0 ) << 1) {
 589                 case (       1<<0): *opt = choice_1; break; /* choice_1 only */
 590                 case (1<<1       ): *opt = choice_2; break; /* choice_2 only */
 591                 case (1<<1 | 1<<0): /* both, ask user which to pick from */
 592                         printf ("take from (1-4): "); fflush (stdout);
 593                         *opt = getchar() - '1';
 594                         if (*opt < 0 || *opt > 3) return CMD_INVAL;
 595                         break;
 596                 default: return CMD_INVAL; /* none matched */
 597                 }
 598                 /* `opt` is the foundation index (0..3) */
 599         }
 600 #elif defined SPIDER
 601         /* moving to empty tableu? */
 602         if (is_tableu(*to) && f.t[*to][0] == NO_CARD) {
 603                 int bottom = first_movable(f.t[*from]);
 604                 if (inactive.opt >= 0) { /*if from was cursor addressed: */
 605                         *opt = get_rank(f.t[*from][bottom + inactive.opt]);
 606                         return CMD_MOVE;
 607                 }
 608                 int top = find_top(f.t[*from]);
 609                 if (top < 0) return CMD_INVAL;
 610                 if (top >= 0 && !is_movable(f.t[*from], top-1)) {
 611                         *opt = get_rank(f.t[*from][top]);
 612                 } else { /* only ask the user if it's unclear: */
 613                         printf ("\rup to ([a23456789xjqk] or space/return): ");
 614                         *opt = getchar();
 615                         switch (*opt) {
 616                         case ' ': *opt = get_rank(f.t[*from][top]); break;
 617                         case'\n': *opt = get_rank(f.t[*from][bottom]); break;
 618                         case 'a': case 'A': *opt = RANK_A; break;
 619                         case '0': /* fallthrough */
 620                         case 'x': case 'X': *opt = RANK_X; break;
 621                         case 'j': case 'J': *opt = RANK_J; break;
 622                         case 'q': case 'Q': *opt = RANK_Q; break;
 623                         case 'k': case 'K': *opt = RANK_K; break;
 624                         default: *opt -= '1';
 625                         }
 626                         if (*opt < RANK_A || *opt > RANK_K) return ERR;
 627                 }
 628                 /* `opt` is the rank of the highest card to move */
 629         }
 630 #endif
 631         return CMD_MOVE;
 632 }
 633 // }}}
 634
 635 // shuffling and dealing {{{
 636 void deal(void) {
 637         f = (const struct playfield){0}; /* clear playfield */
 638         card_t deck[DECK_SIZE*NUM_DECKS];
 639         int avail = DECK_SIZE*NUM_DECKS;
 640         for (int i = 0; i < DECK_SIZE*NUM_DECKS; i++) deck[i] = (i%DECK_SIZE)+1;
 641 #ifdef SPIDER
 642         if (op.m != NORMAL) for (int i = 0; i < DECK_SIZE*NUM_DECKS; i++) {
 643                 if (op.m == MEDIUM) deck[i] = 1+((deck[i]-1) | 2);
 644                 if (op.m == EASY)   deck[i] = 1+((deck[i]-1) | 2 | 1);
 645                 /* the 1+ -1 dance gets rid of the offset created by NO_CARD */
 646         }
 647 #endif
 648         srandom (time(NULL));
 649         long seed = time(NULL);
 650         srandom (seed);
 651         for (int i = DECK_SIZE*NUM_DECKS-1; i > 0; i--) { /* fisher-yates */
 652                 int j = random() % (i+1);
 653                 if (j-i) deck[i]^=deck[j],deck[j]^=deck[i],deck[i]^=deck[j];
 654         }
 655
 656         /* deal cards: */
 657         for (int i = 0; i < NUM_PILES; i++) {
 658 #ifdef KLONDIKE
 659                 int closed = i; /* pile n has n closed cards, then 1 open */
 660 #elif defined SPIDER
 661                 int closed = i<4?5:4; /* pile 1-4 have 5, 5-10 have 4 closed */
 662 #endif
 663                 /* face down cards are negated: */
 664                 for (int j = 0; j < closed; j++) f.t[i][j] = -deck[--avail];
 665                 f.t[i][closed] = deck[--avail]; /* the face-up card */
 666         }
 667         /* rest of the cards to the stock; NOTE: assert(avail==50) for spider */
 668         for (f.z = 0; avail; f.z++) f.s[f.z] = deck[--avail];
 669         f.w = -1; /* @start: nothing on waste (no waste in spider -> const) */
 670
 671         f.u = &undo_sentinel;
 672 }
 673 //}}}
 674
 675 // screen drawing routines {{{
 676 void print_hi(int invert, int grey_bg, int bold, char* str) {
 677         if (op.s == &unicode_large_color){//ARGH! awful hack for bold with faint
 678                 int offset = str[3]==033?16:str[4]==033?17:0;
 679                 if ((unsigned char)str[10] == 0x9a) offset = 0; //facedown card
 680                 printf ("%s%s%s""%.*s%s%s""%s%s%s",
 681                         bold?"\033[1m":"", invert?"\033[7m":"", grey_bg?"\033[100m":"",
 682                         offset, str, bold?"\033[1m":"", str+offset,
 683                         grey_bg?"\033[49m":"", invert?"\033[27m":"",bold?"\033[22m":"");
 684                 return;
 685         }
 686         printf ("%s%s%s%s%s%s%s",
 687                 bold?"\033[1m":"", invert?"\033[7m":"", grey_bg?"\033[100m":"",
 688                 str,
 689                 grey_bg?"\033[49m":"", invert?"\033[27m":"",bold?"\033[22m":"");
 690 }
 691 void print_table(const struct cursor* active, const struct cursor* inactive) {
 692         printf("\033[2J\033[H"); /* clear screen, reset cursor */
 693 #ifdef KLONDIKE
 694         /* print stock, waste and foundation: */
 695         for (int line = 0; line < op.s->height; line++) {
 696                 /* stock: */
 697                 print_hi (active->pile == STOCK, inactive->pile == STOCK, 1, (
 698                         (f.w < f.z-1)?op.s->facedown
 699                         :op.s->placeholder)[line]);
 700                 /* waste: */
 701                 print_hi (active->pile == WASTE, inactive->pile == WASTE, 1, (
 702                         /* NOTE: cast, because f.w sometimes is (short)-1 !? */
 703                         ((short)f.w >= 0)?op.s->card[f.s[f.w]]
 704                         :op.s->placeholder)[line]);
 705                 printf ("%s", op.s->card[NO_CARD][line]); /* spacer */
 706                 /* foundation: */
 707                 for (int pile = 0; pile < NUM_SUITS; pile++) {
 708                         int card = find_top(f.f[pile]);
 709                         print_hi (active->pile==FOUNDATION && active->opt==pile,
 710                                 inactive->pile==FOUNDATION && (
 711                                         /* cursor addr.     || direct addr.   */
 712                                         inactive->opt==pile || inactive->opt < 0
 713                                 ), 1,
 714                                 (card < 0)?op.s->placeholder[line]
 715                                 :op.s->card[f.f[pile][card]][line]);
 716                 }
 717                 printf("\n");
 718         }
 719         printf("\n");
 720 #elif defined SPIDER
 721         int fdone; for (fdone = NUM_DECKS*NUM_SUITS; fdone; fdone--)
 722                 if (f.f[fdone-1][RANK_K]) break;  /*number of completed stacks*/
 723         int spacer_from = f.z?(f.z/10-1) * op.s->halfwidth[0] + op.s->width:0;
 724         int spacer_to   = NUM_PILES*op.s->width -
 725                 ((fdone?(fdone-1) * op.s->halfwidth[1]:0)+op.s->width);
 726         for (int line = 0; line < op.s->height; line++) {
 727                 /* available stock: */
 728                 for (int i = f.z/10; i; i--) {
 729                         if (i==1) printf ("%s", op.s->facedown[line]);
 730                         else      printf ("%s", op.s->halfstack[line]);
 731                 }
 732                 /* spacer: */
 733                 for (int i = spacer_from; i < spacer_to; i++) printf (" ");
 734                 /* foundation (overlapping): */
 735                 for (int i = 0; i < NUM_DECKS*NUM_SUITS; i++) {
 736                         int overlap = i? op.s->halfcard[line]: 0;
 737                         if (f.f[i][RANK_K]) printf ("%.*s", op.s->halfwidth[2],
 738                                 op.s->card[f.f[i][RANK_K]][line]+overlap);
 739                 }
 740                 printf("\n");
 741         }
 742         printf("\n");
 743 #endif
 744 #ifdef KLONDIKE
 745 #define DO_HI(cursor) cursor->pile == pile && (movable || empty)
 746 #define INC_OFFSET
 747 #elif defined SPIDER
 748         int offset[NUM_PILES]={1,1,1,1,1,1,1,1,1,1}; // :|
 749 #define DO_HI(cursor) cursor->pile == pile && (movable || empty) \
 750         && offset[pile] > cursor->opt
 751 #define INC_OFFSET if (movable) offset[pile]++
 752 #endif
 753         /* print tableu piles: */
 754         int row[NUM_PILES] = {0};
 755         int line[NUM_PILES]= {0};
 756         int label[NUM_PILES]={0};
 757         int line_had_card;
 758         int did_placeholders = 0;
 759         do {
 760                 line_had_card = 0;
 761                 for (int pile = 0; pile < NUM_PILES; pile++) {
 762                         card_t card = f.t[pile][row[pile]];
 763                         card_t next = f.t[pile][row[pile]+1];
 764                         int movable = is_movable(f.t[pile], row[pile]);
 765                         int empty   = !card && row[pile] == 0;
 766
 767                         print_hi (DO_HI(active), DO_HI(inactive), movable, (
 768                                 (!card && row[pile] == 0)?op.s->placeholder
 769                                 :(card<0)?op.s->facedown
 770                                 :op.s->card[card]
 771                                 )[line[pile]]);
 772
 773                         int extreme_overlap = op.v && find_top(f.t[pile])>10;
 774                         /* normal overlap: */
 775                         if (++line[pile] >= (next?op.s->overlap:op.s->height)
 776                         /* extreme overlap on closed cards: */
 777                         || (extreme_overlap &&
 778                             line[pile] >= 1 &&
 779                             f.t[pile][row[pile]] < 0 &&
 780                             f.t[pile][row[pile]+1] <0)
 781                         /* extreme overlap on sequences: */
 782                         || (extreme_overlap &&
 783                             line[pile] >= 1 && row[pile] > 0 &&
 784                             f.t[pile][row[pile]-1] > NO_CARD &&
 785                             is_consecutive (f.t[pile], row[pile]) &&
 786                             is_consecutive (f.t[pile], row[pile]-1) &&
 787                             f.t[pile][row[pile]+1] != NO_CARD)
 788                         ) {
 789                                 line[pile]=0;
 790                                 row[pile]++;
 791                                 INC_OFFSET;
 792                         }
 793                         /* tableu labels: */
 794                         if(!card && !label[pile] && row[pile]>0&&line[pile]>0) {
 795                                 label[pile] = 1;
 796                                 printf ("\b\b%d ", (pile+1) % 10); //XXX: hack
 797                         }
 798                         line_had_card |= !!card;
 799                         did_placeholders |= row[pile] > 0;
 800                 }
 801                 printf ("\n");
 802         } while (line_had_card || !did_placeholders);
 803 }
 804
 805 void visbell (void) {
 806         printf ("\033[?5h"); fflush (stdout);
 807         usleep (100000);
 808         printf ("\033[?5l"); fflush (stdout);
 809 }
 810 void win_anim(void) {
 811         printf ("\033[?25l"); /* hide cursor */
 812         for (;;) {
 813                 /* set cursor to random location */
 814                 int row = 1+random()%(24-op.s->width);
 815                 int col = 1+random()%(80-op.s->height);
 816
 817                 /* draw random card */
 818                 int face = 1 + random() % 52;
 819                 for (int l = 0; l < op.s->height; l++) {
 820                         printf ("\033[%d;%dH", row+l, col);
 821                         printf ("%s", op.s->card[face][l]);
 822                 }
 823                 fflush (stdout);
 824
 825                 /* exit on keypress */
 826                 struct pollfd p = {STDIN_FILENO, POLLIN, 0};
 827                 if (poll (&p, 1, 80)) goto fin;
 828         }
 829 fin:
 830         printf ("\033[?25h"); /* show cursor */
 831         return;
 832 }
 833 //}}}
 834
 835 // undo logic {{{
 836 void undo_push (int _f, int t, int n, int o) {
 837         struct undo* new = malloc(sizeof(struct undo));
 838         new->f = _f;
 839         new->t = t;
 840         new->n = n;
 841         new->o = o;
 842         new->prev = f.u;
 843         new->next = NULL;
 844         f.u->next = new;
 845         f.u = f.u->next;
 846 }
 847 void undo_pop (struct undo* u) {
 848         if (u == &undo_sentinel) return;
 849
 850 #ifdef KLONDIKE
 851         if (u->f == FOUNDATION) {
 852                 /* foundation -> tableu */
 853                 int top_f = find_top(f.f[u->n]);
 854                 int top_t = find_top(f.t[u->t]);
 855                 f.f[u->n][top_f+1] = f.t[u->t][top_t];
 856                 f.t[u->t][top_t] = NO_CARD;
 857         } else if (u->f == WASTE && u->t == FOUNDATION) {
 858                 /* waste -> foundation */
 859                 /* split u->n into wst and fnd: */
 860                 int wst = u->n & 0xffff;
 861                 int fnd = u->n >> 16;
 862                 /* move stock cards one position up to make room: */
 863                 for (int i = f.z; i >= wst; i--) f.s[i+1] = f.s[i];
 864                 /* move one card from foundation to waste: */
 865                 int top = find_top(f.f[fnd]);
 866                 f.s[wst] = f.f[fnd][top];
 867                 f.f[fnd][top] = NO_CARD;
 868                 f.z++;
 869                 f.w++;
 870         } else if (u->f == WASTE) {
 871                 /* waste -> tableu */
 872                 /* move stock cards one position up to make room: */
 873                 for (int i = f.z; i >= u->n; i--) f.s[i+1] = f.s[i];
 874                 /* move one card from tableu to waste: */
 875                 int top = find_top(f.t[u->t]);
 876                 f.s[u->n] = f.t[u->t][top];
 877                 f.t[u->t][top] = NO_CARD;
 878                 f.z++;
 879                 f.w++;
 880         } else if (u->t == FOUNDATION) {
 881                 /* tableu -> foundation */
 882                 int top_f = find_top(f.t[u->f]);
 883                 int top_t = find_top(f.f[u->n]);
 884                 /* close topcard if previous action caused turn_over(): */
 885                 if (u->o) f.t[u->f][top_f] *= -1;
 886                 /* move one card from foundation to tableu: */
 887                 f.t[u->f][top_f+1] = f.f[u->n][top_t];
 888                 f.f[u->n][top_t] = NO_CARD;
 889         } else {
 890                 /* tableu -> tableu */
 891                 int top_f = find_top(f.t[u->f]);
 892                 int top_t = find_top(f.t[u->t]);
 893                 /* close topcard if previous action caused turn_over(): */
 894                 if (u->o) f.t[u->f][top_f] *= -1;
 895                 /* move n cards from tableu[f] to tableu[t]: */
 896                 for (int i = 0; i < u->n; i++) {
 897                         f.t[u->f][top_f+u->n-i] = f.t[u->t][top_t-i];
 898                         f.t[u->t][top_t-i] = NO_CARD;
 899                 }
 900         }
 901 #elif defined SPIDER
 902         if (u->f == STOCK) {
 903                 /* stock -> tableu */
 904                 /*remove a card from each pile and put it back onto the stock:*/
 905                 for (int pile = NUM_PILES-1; pile >= 0; pile--) {
 906                         int top = find_top(f.t[pile]);
 907                         f.s[f.z++] = f.t[pile][top];
 908                         f.t[pile][top] = NO_CARD;
 909                 }
 910         } else if (u->t == FOUNDATION) {
 911                 /* tableu -> foundation */
 912                 int top = find_top(f.t[u->f]);
 913                 /* close topcard if previous action caused turn_over(): */
 914                 if (u->o) f.t[u->f][top] *= -1;
 915                 /* append cards from foundation to tableu */
 916                 for (int i = RANK_K; i >= RANK_A; i--) {
 917                         f.t[u->f][++top] = f.f[u->n][i];
 918                         f.f[u->n][i] = NO_CARD;
 919                 }
 920                 /* decrement complete-foundation-counter: */
 921                 remove_if_complete(-1);
 922         } else {
 923                 /* tableu -> tableu */
 924                 int top_f = find_top(f.t[u->f]);
 925                 int top_t = find_top(f.t[u->t]);
 926                 /* close topcard if previous action caused turn_over(): */
 927                 if (u->o) f.t[u->f][top_f] *= -1;
 928                 /* move n cards from tableu[f] to tableu[t]: */
 929                 for (int i = 0; i < u->n; i++) {
 930                         f.t[u->f][top_f+u->n-i] = f.t[u->t][top_t-i];
 931                         f.t[u->t][top_t-i] = NO_CARD;
 932                 }
 933         }
 934 #endif
 935
 936         void* old = f.u;
 937         f.u = f.u->prev;
 938         free(old);
 939 }
 940 void free_undo (struct undo* u) {
 941         while (u && u != &undo_sentinel) {
 942                 void* old = u;
 943                 u = u->prev;
 944                 free (old);
 945         }
 946 }
 947 //}}}
 948
 949 // initialization stuff {{{
 950 void screen_setup (int enable) {
 951         if (enable) {
 952                 raw_mode(1);
 953                 printf ("\033[s\033[?47h"); /* save cursor, alternate screen */
 954                 printf ("\033[H\033[J"); /* reset cursor, clear screen */
 955                 //TODO//printf ("\033[?1000h\033[?25l"); /* enable mouse, hide cursor */
 956         } else {
 957                 //TODO//printf ("\033[?9l\033[?25h"); /* disable mouse, show cursor */
 958                 printf ("\033[?47l\033[u"); /* primary screen, restore cursor */
 959                 raw_mode(0);
 960         }
 961 }
 962
 963 void raw_mode(int enable) {
 964         static struct termios saved_term_mode;
 965         struct termios raw_term_mode;
 966
 967         if (enable) {
 968                 if (saved_term_mode.c_lflag == 0)/*don't overwrite stored mode*/
 969                         tcgetattr(STDIN_FILENO, &saved_term_mode);
 970                 raw_term_mode = saved_term_mode;
 971                 raw_term_mode.c_lflag &= ~(ICANON | ECHO);
 972                 raw_term_mode.c_cc[VMIN] = 1 ;
 973                 raw_term_mode.c_cc[VTIME] = 0;
 974                 tcsetattr(STDIN_FILENO, TCSAFLUSH, &raw_term_mode);
 975         } else {
 976                 tcsetattr(STDIN_FILENO, TCSAFLUSH, &saved_term_mode);
 977         }
 978 }
 979
 980 void signal_handler (int signum) {
 981         switch (signum) {
 982         case SIGCONT:
 983                 screen_setup(0);
 984                 screen_setup(1);
 985                 print_table(NO_HI, NO_HI);
 986                 break;
 987         case SIGINT:
 988                 exit(128+SIGINT);
 989         }
 990 }
 991 void signal_setup(void) {
 992         struct sigaction saction;
 993
 994         saction.sa_handler = signal_handler;
 995         sigemptyset(&saction.sa_mask);
 996         saction.sa_flags = 0;
 997         if (sigaction(SIGCONT, &saction, NULL) < 0) {
 998                 perror ("SIGCONT");
 999                 exit (1);
1000         }
1001         if (sigaction(SIGINT, &saction, NULL) < 0) {
1002                 perror ("SIGINT");
1003                 exit (1);
1004         }
1005 }
1006 //}}}
1007
1008 //vim: foldmethod=marker