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 void remove_if_complete (int pileno) { //cleanup!
 312         static int foundation = 0;
 313         if (pileno == -1) { foundation--; return; } /* 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;
 319         for (int i = top_from; i>=0; i--) {
 320                 if (!is_consecutive (pile, i)) return;
 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;
 331                 }
 332         }
 333 }
 334 int t2t(int from, int to, int opt) { //in dire need of cleanup
 335         int top_from = find_top(f.t[from]);
 336         int top_to = find_top(f.t[to]);
 337         int empty_to = (top_to < 0)? opt: -1; /* empty pile? */
 338         int count = 0; //NOTE: could probably be factored out
 339
 340         for (int i = top_from; i >= 0; i--) {
 341                 if (!is_consecutive(f.t[from], i)) break;
 342
 343                 /* is consecutive OR to empty pile and rank ok? */
 344                 if (rank_next(f.t[from][i], f.t[to][top_to])
 345                 || (empty_to >= RANK_A && get_rank(f.t[from][i]) == empty_to)) {
 346                         for (;i <= top_from; i++) {
 347                                 top_to++;
 348                                 f.t[to][top_to] = f.t[from][i];
 349                                 f.t[from][i] = NO_CARD;
 350                                 count++;
 351                         }
 352                         undo_push(from, to, count,
 353                         turn_over(f.t[from]));
 354                         remove_if_complete(to);
 355                         if (check_won()) return WON;
 356                         return OK;
 357                 }
 358         }
 359
 360         return ERR; /* no such move possible */
 361 }
 362 int s2t(int from, int to, int opt) {
 363         (void) from; (void) to; (void) opt; /* don't need */
 364         if (f.z <= 0) return ERR; /* stack out of cards */
 365         for (int pile = 0; pile < NUM_PILES; pile++)
 366                 if (f.t[pile][0]==NO_CARD) return ERR; /*no piles may be empty*/
 367         for (int pile = 0; pile < NUM_PILES; pile++) {
 368                 f.t[pile][find_top(f.t[pile])+1] = f.s[--f.z];
 369                 remove_if_complete(pile);
 370                 if (check_won()) return WON;
 371         }
 372         undo_push(STOCK, TABLEU, 1, 0); /*NOTE: puts 1 card on each tableu pile*/
 373         return OK;
 374 }
 375 int t2f(int from, int to, int opt) {
 376         (void) to; (void) opt; /* don't need */
 377         /* manually retrigger remove_if_complete() (e.g. after undo_pop) */
 378         remove_if_complete(from);
 379         return OK;
 380 }
 381 #endif
 382 int nop(int from, int to, int opt) { (void)from;(void)to;(void)opt;return ERR; }
 383 // }}}
 384
 385 // keyboard input handling {{{
 386 // cursor functions{{{
 387 #pragma GCC diagnostic ignored "-Wswitch" //not ideal :|
 388 #ifdef KLONDIKE
 389 void cursor_left (struct cursor* cursor) {
 390         if (is_tableu(cursor->pile)) {
 391                 if (cursor->pile > 0) cursor->pile--;
 392                 cursor->opt = 0;
 393         } else { /* stock/waste/foundation*/
 394                 switch (cursor->pile) {
 395                 case WASTE: cursor->pile = STOCK; cursor->opt = 0; break;
 396                 case FOUNDATION:
 397                         if (cursor->opt <= 0)
 398                                 cursor->pile = WASTE;
 399                         else
 400                                 cursor->opt--;
 401                 }
 402         }
 403 }
 404 void cursor_down (struct cursor* cursor) {
 405         if (!is_tableu(cursor->pile)) {
 406                 switch (cursor->pile) {
 407                 case STOCK: cursor->pile = TAB_1; break;
 408                 case WASTE: cursor->pile = TAB_2; break;
 409                 case FOUNDATION:
 410                         cursor->pile = TAB_4 + cursor->opt;
 411                 }
 412                 cursor->opt = 0;
 413         }
 414 }
 415 void cursor_up (struct cursor* cursor) {
 416         if (is_tableu(cursor->pile)) {
 417                 switch (cursor->pile) { //ugly :|
 418                 case TAB_1: cursor->pile = STOCK; break;
 419                 case TAB_2: cursor->pile = WASTE; break;
 420                 case TAB_3: cursor->pile = WASTE; break;
 421                 case TAB_4: case TAB_5: case TAB_6: case TAB_7:
 422                         cursor->opt=cursor->pile-TAB_4;
 423                         cursor->pile = FOUNDATION;
 424                         break;
 425                 }
 426         }
 427 }
 428 void cursor_right (struct cursor* cursor) {
 429         if (is_tableu(cursor->pile)) {
 430                 if (cursor->pile < TAB_MAX) cursor->pile++;
 431         } else {
 432                 switch (cursor->pile) {
 433                 case STOCK: cursor->pile = WASTE; break;
 434                 case WASTE: cursor->pile = FOUNDATION;cursor->opt = 0; break;
 435                 case FOUNDATION:
 436                         if (cursor->opt < NUM_DECKS*NUM_SUITS)
 437                                 cursor->opt++;
 438                 }
 439         }
 440 }
 441 #elif defined SPIDER
 442 /*NOTE: one can't highlight the stock due to me being too lazy to implement it*/
 443 void cursor_left (struct cursor* cursor) {
 444         if (cursor->pile > 0) cursor->pile--;
 445         cursor->opt = 0;
 446 }
 447 void cursor_down (struct cursor* cursor) {
 448         int first = first_movable(f.t[cursor->pile]);
 449         int top = find_top(f.t[cursor->pile]);
 450         if (first + cursor->opt < top)
 451                 cursor->opt++;
 452 }
 453 void cursor_up (struct cursor* cursor) {
 454         if (cursor->opt > 0) cursor->opt--;
 455 }
 456 void cursor_right (struct cursor* cursor) {
 457         if (cursor->pile < TAB_MAX) cursor->pile++;
 458         cursor->opt = 0;
 459 }
 460 #endif
 461 void cursor_to (struct cursor* cursor, int pile) {
 462         cursor->pile = pile;
 463         cursor->opt = 0;
 464 }
 465 #pragma GCC diagnostic pop
 466 //}}}
 467 int get_cmd (int* from, int* to, int* opt) {
 468         //TODO: escape sequences (mouse, cursor keys)
 469         int _f, t;
 470         struct cursor inactive = {-1,-1};
 471         static struct cursor active = {0,0};
 472         active.opt = 0; /* always reset offset, but keep pile */
 473
 474         /***/
 475 from_l: print_table(&active, &inactive);
 476         _f = getchar();
 477
 478         switch (_f) {
 479         /* direct addressing: */
 480         case '1': *from = TAB_1; break;
 481         case '2': *from = TAB_2; break;
 482         case '3': *from = TAB_3; break;
 483         case '4': *from = TAB_4; break;
 484         case '5': *from = TAB_5; break;
 485         case '6': *from = TAB_6; break;
 486         case '7': *from = TAB_7; break;
 487 #ifdef SPIDER
 488         case '8': *from = TAB_8; break;
 489         case '9': *from = TAB_9; break;
 490         case '0': *from = TAB_10;break;
 491 #elif defined KLONDIKE
 492         case '9': *from = WASTE; break;
 493         case '0': *from = FOUNDATION; break;
 494         case '8': /* fallthrough */
 495 #endif
 496         case '\n': /* shortcut for dealing from stock */
 497                 *from = STOCK;
 498                 *to = WASTE;
 499                 return CMD_MOVE;
 500         /* cursor keys addressing: */
 501         case 'h': cursor_left (&active); goto from_l;
 502         case 'j': cursor_down (&active); goto from_l;
 503         case 'k': cursor_up   (&active); goto from_l;
 504         case 'l': cursor_right(&active); goto from_l;
 505         case 'H': cursor_to(&active,TAB_1);  goto from_l; /* leftmost  tableu */
 506         case 'L': cursor_to(&active,TAB_MAX);goto from_l; /* rigthmost tableu */
 507         //TODO: real cursor keys, home/end
 508         case ' ': /* continue with second cursor */
 509                 *from = active.pile;
 510                 if (*from == STOCK) {
 511                         *to = WASTE;
 512                         return CMD_MOVE;
 513                 }
 514 #ifdef KLONDIKE
 515                 *opt = active.opt; /* when FOUNDATION */
 516 #endif
 517                 inactive = active;
 518                 break;
 519         /* misc keys: */
 520         case ':':
 521                 {char buf[256];
 522                 fprintf (stderr, ":");
 523                 raw_mode(0); /* turn on echo */
 524                 fgets (buf, 256, stdin);
 525                 raw_mode(1);
 526                 switch(buf[0]) {
 527                 case 'q': return CMD_QUIT;
 528                 case 'n': return CMD_NEW;
 529                 case 'r': return CMD_AGAIN;
 530                 default:  return CMD_INVAL;
 531                 }}
 532         case 'J': return CMD_JOIN;
 533         case 'K': /* fallthrough */
 534         case '?': return CMD_HINT;
 535         case 'u': return CMD_UNDO;
 536         case EOF: return CMD_NONE; /* sent by SIGCONT */
 537         default: return CMD_INVAL;
 538         }
 539         inactive.pile = *from; /* for direct addressing highlighting */
 540         if (is_tableu(*from) && f.t[*from][0] == NO_CARD) return CMD_INVAL;
 541
 542         /***/
 543 to_l:   print_table(&active, &inactive);
 544         t = getchar();
 545
 546         switch (t) {
 547         case 'h': cursor_left (&active); goto to_l;
 548         case 'j': cursor_down (&active); goto to_l;
 549         case 'k': cursor_up   (&active); goto to_l;
 550         case 'l': cursor_right(&active); goto to_l;
 551         case 'H': cursor_to(&active,TAB_1);  goto to_l;
 552         case 'L': cursor_to(&active,TAB_MAX);goto to_l;
 553         case 'J': /* fallthrough; key makes no sense on destination */
 554         case ' ':
 555                 *to = active.pile;
 556                 break; /* continues with the foundation/empty tableu check */
 557         case 'K': /* fallthrough */
 558         case '?': return CMD_HINT;
 559         case 'u': return CMD_NONE; /* cancel selection */
 560         case EOF: return CMD_NONE; /* sent by SIGCONT */
 561         default:
 562                 if (t < '0' || t > '9') return CMD_INVAL;
 563                 if (t == '0')
 564 #ifdef KLONDIKE
 565                         *to = FOUNDATION;
 566 #elif defined SPIDER
 567                         *to = TAB_10;
 568 #endif
 569                 else
 570                         *to = t-'1';
 571         }
 572
 573         /***/
 574 #ifdef KLONDIKE
 575         if (*from == FOUNDATION) {
 576                 int top = find_top(f.t[*to]);
 577                 if (top < 0) return CMD_INVAL;
 578                 int color = get_color(f.t[*to][top]);
 579                 int choice_1 = 1-color; /* selects piles of   */
 580                 int choice_2 = 2+color; /* the opposite color */
 581                 int top_c1 = find_top(f.f[choice_1]);
 582                 int top_c2 = find_top(f.f[choice_2]);
 583
 584                 switch ((rank_next(f.f[choice_1][top_c1], f.t[*to][top])
 585                          && top_c1 >= 0 ) << 0
 586                        |(rank_next(f.f[choice_2][top_c2], f.t[*to][top])
 587                          && top_c2 >= 0 ) << 1) {
 588                 case (       1<<0): *opt = choice_1; break; /* choice_1 only */
 589                 case (1<<1       ): *opt = choice_2; break; /* choice_2 only */
 590                 case (1<<1 | 1<<0): /* both, ask user which to pick from */
 591                         printf ("take from (1-4): "); fflush (stdout);
 592                         *opt = getchar() - '1';
 593                         if (*opt < 0 || *opt > 3) return CMD_INVAL;
 594                         break;
 595                 default: return CMD_INVAL; /* none matched */
 596                 }
 597                 /* `opt` is the foundation index (0..3) */
 598         }
 599 #elif defined SPIDER
 600         /* moving to empty tableu? */
 601         if (is_tableu(*to) && f.t[*to][0] == NO_CARD) {
 602                 int bottom = first_movable(f.t[*from]);
 603                 if (inactive.opt >= 0) { /*if from was cursor addressed: */
 604                         *opt = get_rank(f.t[*from][bottom + inactive.opt]);
 605                         return CMD_MOVE;
 606                 }
 607                 int top = find_top(f.t[*from]);
 608                 if (top < 0) return CMD_INVAL;
 609                 if (top >= 0 && !is_movable(f.t[*from], top-1)) {
 610                         *opt = get_rank(f.t[*from][top]);
 611                 } else { /* only ask the user if it's unclear: */
 612                         printf ("\rup to ([a23456789xjqk] or space/return): ");
 613                         *opt = getchar();
 614                         switch (*opt) {
 615                         case ' ': *opt = get_rank(f.t[*from][top]); break;
 616                         case'\n': *opt = get_rank(f.t[*from][bottom]); break;
 617                         case 'a': case 'A': *opt = RANK_A; break;
 618                         case '0': /* fallthrough */
 619                         case 'x': case 'X': *opt = RANK_X; break;
 620                         case 'j': case 'J': *opt = RANK_J; break;
 621                         case 'q': case 'Q': *opt = RANK_Q; break;
 622                         case 'k': case 'K': *opt = RANK_K; break;
 623                         default: *opt -= '1';
 624                         }
 625                         if (*opt < RANK_A || *opt > RANK_K) return ERR;
 626                 }
 627                 /* `opt` is the rank of the highest card to move */
 628         }
 629 #endif
 630         return CMD_MOVE;
 631 }
 632 // }}}
 633
 634 // shuffling and dealing {{{
 635 void deal(void) {
 636         f = (const struct playfield){0}; /* clear playfield */
 637         card_t deck[DECK_SIZE*NUM_DECKS];
 638         int avail = DECK_SIZE*NUM_DECKS;
 639         for (int i = 0; i < DECK_SIZE*NUM_DECKS; i++) deck[i] = (i%DECK_SIZE)+1;
 640 #ifdef SPIDER
 641         if (op.m != NORMAL) for (int i = 0; i < DECK_SIZE*NUM_DECKS; i++) {
 642                 if (op.m == MEDIUM) deck[i] = 1+((deck[i]-1) | 2);
 643                 if (op.m == EASY)   deck[i] = 1+((deck[i]-1) | 2 | 1);
 644                 /* the 1+ -1 dance gets rid of the offset created by NO_CARD */
 645         }
 646 #endif
 647         srandom (time(NULL));
 648         long seed = time(NULL);
 649         srandom (seed);
 650         for (int i = DECK_SIZE*NUM_DECKS-1; i > 0; i--) { /* fisher-yates */
 651                 int j = random() % (i+1);
 652                 if (j-i) deck[i]^=deck[j],deck[j]^=deck[i],deck[i]^=deck[j];
 653         }
 654
 655         /* deal cards: */
 656         for (int i = 0; i < NUM_PILES; i++) {
 657 #ifdef KLONDIKE
 658                 int closed = i; /* pile n has n closed cards, then 1 open */
 659 #elif defined SPIDER
 660                 int closed = i<4?5:4; /* pile 1-4 have 5, 5-10 have 4 closed */
 661 #endif
 662                 /* face down cards are negated: */
 663                 for (int j = 0; j < closed; j++) f.t[i][j] = -deck[--avail];
 664                 f.t[i][closed] = deck[--avail]; /* the face-up card */
 665         }
 666         /* rest of the cards to the stock; NOTE: assert(avail==50) for spider */
 667         for (f.z = 0; avail; f.z++) f.s[f.z] = deck[--avail];
 668         f.w = -1; /* @start: nothing on waste (no waste in spider -> const) */
 669
 670         f.u = &undo_sentinel;
 671 }
 672 //}}}
 673
 674 // screen drawing routines {{{
 675 void print_hi(int invert, int grey_bg, int bold, char* str) {
 676         if (op.s == &unicode_large_color){//ARGH! awful hack for bold with faint
 677                 int offset = str[3]==033?16:str[4]==033?17:0;
 678                 if ((unsigned char)str[10] == 0x9a) offset = 0; //facedown card
 679                 printf ("%s%s%s""%.*s%s%s""%s%s%s",
 680                         bold?"\033[1m":"", invert?"\033[7m":"", grey_bg?"\033[100m":"",
 681                         offset, str, bold?"\033[1m":"", str+offset,
 682                         grey_bg?"\033[49m":"", invert?"\033[27m":"",bold?"\033[22m":"");
 683                 return;
 684         }
 685         printf ("%s%s%s%s%s%s%s",
 686                 bold?"\033[1m":"", invert?"\033[7m":"", grey_bg?"\033[100m":"",
 687                 str,
 688                 grey_bg?"\033[49m":"", invert?"\033[27m":"",bold?"\033[22m":"");
 689 }
 690 void print_table(const struct cursor* active, const struct cursor* inactive) {
 691         printf("\033[2J\033[H"); /* clear screen, reset cursor */
 692 #ifdef KLONDIKE
 693         /* print stock, waste and foundation: */
 694         for (int line = 0; line < op.s->height; line++) {
 695                 /* stock: */
 696                 print_hi (active->pile == STOCK, inactive->pile == STOCK, 1, (
 697                         (f.w < f.z-1)?op.s->facedown
 698                         :op.s->placeholder)[line]);
 699                 /* waste: */
 700                 print_hi (active->pile == WASTE, inactive->pile == WASTE, 1, (
 701                         /* NOTE: cast, because f.w sometimes is (short)-1 !? */
 702                         ((short)f.w >= 0)?op.s->card[f.s[f.w]]
 703                         :op.s->placeholder)[line]);
 704                 printf ("%s", op.s->card[NO_CARD][line]); /* spacer */
 705                 /* foundation: */
 706                 for (int pile = 0; pile < NUM_SUITS; pile++) {
 707                         int card = find_top(f.f[pile]);
 708                         print_hi (active->pile==FOUNDATION && active->opt==pile,
 709                                 inactive->pile==FOUNDATION && (
 710                                         /* cursor addr.     || direct addr.   */
 711                                         inactive->opt==pile || inactive->opt < 0
 712                                 ), 1,
 713                                 (card < 0)?op.s->placeholder[line]
 714                                 :op.s->card[f.f[pile][card]][line]);
 715                 }
 716                 printf("\n");
 717         }
 718         printf("\n");
 719 #elif defined SPIDER
 720         int fdone; for (fdone = NUM_DECKS*NUM_SUITS; fdone; fdone--)
 721                 if (f.f[fdone-1][RANK_K]) break;  /*number of completed stacks*/
 722         int spacer_from = f.z?(f.z/10-1) * op.s->halfwidth[0] + op.s->width:0;
 723         int spacer_to   = NUM_PILES*op.s->width -
 724                 ((fdone?(fdone-1) * op.s->halfwidth[1]:0)+op.s->width);
 725         for (int line = 0; line < op.s->height; line++) {
 726                 /* available stock: */
 727                 for (int i = f.z/10; i; i--) {
 728                         if (i==1) printf ("%s", op.s->facedown[line]);
 729                         else      printf ("%s", op.s->halfstack[line]);
 730                 }
 731                 /* spacer: */
 732                 for (int i = spacer_from; i < spacer_to; i++) printf (" ");
 733                 /* foundation (overlapping): */
 734                 for (int i = 0; i < NUM_DECKS*NUM_SUITS; i++) {
 735                         int overlap = i? op.s->halfcard[line]: 0;
 736                         if (f.f[i][RANK_K]) printf ("%.*s", op.s->halfwidth[2],
 737                                 op.s->card[f.f[i][RANK_K]][line]+overlap);
 738                 }
 739                 printf("\n");
 740         }
 741         printf("\n");
 742 #endif
 743 #ifdef KLONDIKE
 744 #define DO_HI(cursor) cursor->pile == pile && (movable || empty)
 745 #define INC_OFFSET
 746 #elif defined SPIDER
 747         int offset[NUM_PILES]={1,1,1,1,1,1,1,1,1,1}; // :|
 748 #define DO_HI(cursor) cursor->pile == pile && (movable || empty) \
 749         && offset[pile] > cursor->opt
 750 #define INC_OFFSET if (movable) offset[pile]++
 751 #endif
 752         /* print tableu piles: */
 753         int row[NUM_PILES] = {0};
 754         int line[NUM_PILES]= {0};
 755         int label[NUM_PILES]={0};
 756         int line_had_card;
 757         int did_placeholders = 0;
 758         do {
 759                 line_had_card = 0;
 760                 for (int pile = 0; pile < NUM_PILES; pile++) {
 761                         card_t card = f.t[pile][row[pile]];
 762                         card_t next = f.t[pile][row[pile]+1];
 763                         int movable = is_movable(f.t[pile], row[pile]);
 764                         int empty   = !card && row[pile] == 0;
 765
 766                         print_hi (DO_HI(active), DO_HI(inactive), movable, (
 767                                 (!card && row[pile] == 0)?op.s->placeholder
 768                                 :(card<0)?op.s->facedown
 769                                 :op.s->card[card]
 770                                 )[line[pile]]);
 771
 772                         int extreme_overlap = op.v && find_top(f.t[pile])>10;
 773                         /* normal overlap: */
 774                         if (++line[pile] >= (next?op.s->overlap:op.s->height)
 775                         /* extreme overlap on closed cards: */
 776                         || (extreme_overlap &&
 777                             line[pile] >= 1 &&
 778                             f.t[pile][row[pile]] < 0 &&
 779                             f.t[pile][row[pile]+1] <0)
 780                         /* extreme overlap on sequences: */
 781                         || (extreme_overlap &&
 782                             line[pile] >= 1 && row[pile] > 0 &&
 783                             f.t[pile][row[pile]-1] > NO_CARD &&
 784                             is_consecutive (f.t[pile], row[pile]) &&
 785                             is_consecutive (f.t[pile], row[pile]-1) &&
 786                             f.t[pile][row[pile]+1] != NO_CARD)
 787                         ) {
 788                                 line[pile]=0;
 789                                 row[pile]++;
 790                                 INC_OFFSET;
 791                         }
 792                         /* tableu labels: */
 793                         if(!card && !label[pile] && row[pile]>0&&line[pile]>0) {
 794                                 label[pile] = 1;
 795                                 printf ("\b\b%d ", (pile+1) % 10); //XXX: hack
 796                         }
 797                         line_had_card |= !!card;
 798                         did_placeholders |= row[pile] > 0;
 799                 }
 800                 printf ("\n");
 801         } while (line_had_card || !did_placeholders);
 802 }
 803
 804 void visbell (void) {
 805         printf ("\033[?5h"); fflush (stdout);
 806         usleep (100000);
 807         printf ("\033[?5l"); fflush (stdout);
 808 }
 809 void win_anim(void) {
 810         printf ("\033[?25l"); /* hide cursor */
 811         for (;;) {
 812                 /* set cursor to random location */
 813                 int row = 1+random()%(24-op.s->width);
 814                 int col = 1+random()%(80-op.s->height);
 815
 816                 /* draw random card */
 817                 int face = 1 + random() % 52;
 818                 for (int l = 0; l < op.s->height; l++) {
 819                         printf ("\033[%d;%dH", row+l, col);
 820                         printf ("%s", op.s->card[face][l]);
 821                 }
 822                 fflush (stdout);
 823
 824                 /* exit on keypress */
 825                 struct pollfd p = {STDIN_FILENO, POLLIN, 0};
 826                 if (poll (&p, 1, 80)) goto fin;
 827         }
 828 fin:
 829         printf ("\033[?25h"); /* show cursor */
 830         return;
 831 }
 832 //}}}
 833
 834 // undo logic {{{
 835 void undo_push (int _f, int t, int n, int o) {
 836         struct undo* new = malloc(sizeof(struct undo));
 837         new->f = _f;
 838         new->t = t;
 839         new->n = n;
 840         new->o = o;
 841         new->prev = f.u;
 842         new->next = NULL;
 843         f.u->next = new;
 844         f.u = f.u->next;
 845 }
 846 void undo_pop (struct undo* u) {
 847         if (u == &undo_sentinel) return;
 848
 849 #ifdef KLONDIKE
 850         if (u->f == FOUNDATION) {
 851                 /* foundation -> tableu */
 852                 int top_f = find_top(f.f[u->n]);
 853                 int top_t = find_top(f.t[u->t]);
 854                 f.f[u->n][top_f+1] = f.t[u->t][top_t];
 855                 f.t[u->t][top_t] = NO_CARD;
 856         } else if (u->f == WASTE && u->t == FOUNDATION) {
 857                 /* waste -> foundation */
 858                 /* split u->n into wst and fnd: */
 859                 int wst = u->n & 0xffff;
 860                 int fnd = u->n >> 16;
 861                 /* move stock cards one position up to make room: */
 862                 for (int i = f.z; i >= wst; i--) f.s[i+1] = f.s[i];
 863                 /* move one card from foundation to waste: */
 864                 int top = find_top(f.f[fnd]);
 865                 f.s[wst] = f.f[fnd][top];
 866                 f.f[fnd][top] = NO_CARD;
 867                 f.z++;
 868                 f.w++;
 869         } else if (u->f == WASTE) {
 870                 /* waste -> tableu */
 871                 /* move stock cards one position up to make room: */
 872                 for (int i = f.z; i >= u->n; i--) f.s[i+1] = f.s[i];
 873                 /* move one card from tableu to waste: */
 874                 int top = find_top(f.t[u->t]);
 875                 f.s[u->n] = f.t[u->t][top];
 876                 f.t[u->t][top] = NO_CARD;
 877                 f.z++;
 878                 f.w++;
 879         } else if (u->t == FOUNDATION) {
 880                 /* tableu -> foundation */
 881                 int top_f = find_top(f.t[u->f]);
 882                 int top_t = find_top(f.f[u->n]);
 883                 /* close topcard if previous action caused turn_over(): */
 884                 if (u->o) f.t[u->f][top_f] *= -1;
 885                 /* move one card from foundation to tableu: */
 886                 f.t[u->f][top_f+1] = f.f[u->n][top_t];
 887                 f.f[u->n][top_t] = NO_CARD;
 888         } else {
 889                 /* tableu -> tableu */
 890                 int top_f = find_top(f.t[u->f]);
 891                 int top_t = find_top(f.t[u->t]);
 892                 /* close topcard if previous action caused turn_over(): */
 893                 if (u->o) f.t[u->f][top_f] *= -1;
 894                 /* move n cards from tableu[f] to tableu[t]: */
 895                 for (int i = 0; i < u->n; i++) {
 896                         f.t[u->f][top_f+u->n-i] = f.t[u->t][top_t-i];
 897                         f.t[u->t][top_t-i] = NO_CARD;
 898                 }
 899         }
 900 #elif defined SPIDER
 901         if (u->f == STOCK) {
 902                 /* stock -> tableu */
 903                 /*remove a card from each pile and put it back onto the stock:*/
 904                 for (int pile = NUM_PILES-1; pile >= 0; pile--) {
 905                         int top = find_top(f.t[pile]);
 906                         f.s[f.z++] = f.t[pile][top];
 907                         f.t[pile][top] = NO_CARD;
 908                 }
 909         } else if (u->t == FOUNDATION) {
 910                 /* tableu -> foundation */
 911                 int top = find_top(f.t[u->f]);
 912                 /* close topcard if previous action caused turn_over(): */
 913                 if (u->o) f.t[u->f][top] *= -1;
 914                 /* append cards from foundation to tableu */
 915                 for (int i = RANK_K; i >= RANK_A; i--) {
 916                         f.t[u->f][++top] = f.f[u->n][i];
 917                         f.f[u->n][i] = NO_CARD;
 918                 }
 919                 /* decrement complete-foundation-counter: */
 920                 remove_if_complete(-1);
 921         } else {
 922                 /* tableu -> tableu */
 923                 int top_f = find_top(f.t[u->f]);
 924                 int top_t = find_top(f.t[u->t]);
 925                 /* close topcard if previous action caused turn_over(): */
 926                 if (u->o) f.t[u->f][top_f] *= -1;
 927                 /* move n cards from tableu[f] to tableu[t]: */
 928                 for (int i = 0; i < u->n; i++) {
 929                         f.t[u->f][top_f+u->n-i] = f.t[u->t][top_t-i];
 930                         f.t[u->t][top_t-i] = NO_CARD;
 931                 }
 932         }
 933 #endif
 934
 935         void* old = f.u;
 936         f.u = f.u->prev;
 937         free(old);
 938 }
 939 void free_undo (struct undo* u) {
 940         while (u && u != &undo_sentinel) {
 941                 void* old = u;
 942                 u = u->prev;
 943                 free (old);
 944         }
 945 }
 946 //}}}
 947
 948 // initialization stuff {{{
 949 void screen_setup (int enable) {
 950         if (enable) {
 951                 raw_mode(1);
 952                 printf ("\033[s\033[?47h"); /* save cursor, alternate screen */
 953                 printf ("\033[H\033[J"); /* reset cursor, clear screen */
 954                 //TODO//printf ("\033[?1000h\033[?25l"); /* enable mouse, hide cursor */
 955         } else {
 956                 //TODO//printf ("\033[?9l\033[?25h"); /* disable mouse, show cursor */
 957                 printf ("\033[?47l\033[u"); /* primary screen, restore cursor */
 958                 raw_mode(0);
 959         }
 960 }
 961
 962 void raw_mode(int enable) {
 963         static struct termios saved_term_mode;
 964         struct termios raw_term_mode;
 965
 966         if (enable) {
 967                 if (saved_term_mode.c_lflag == 0)/*don't overwrite stored mode*/
 968                         tcgetattr(STDIN_FILENO, &saved_term_mode);
 969                 raw_term_mode = saved_term_mode;
 970                 raw_term_mode.c_lflag &= ~(ICANON | ECHO);
 971                 raw_term_mode.c_cc[VMIN] = 1 ;
 972                 raw_term_mode.c_cc[VTIME] = 0;
 973                 tcsetattr(STDIN_FILENO, TCSAFLUSH, &raw_term_mode);
 974         } else {
 975                 tcsetattr(STDIN_FILENO, TCSAFLUSH, &saved_term_mode);
 976         }
 977 }
 978
 979 void signal_handler (int signum) {
 980         switch (signum) {
 981         case SIGCONT:
 982                 screen_setup(0);
 983                 screen_setup(1);
 984                 print_table(NO_HI, NO_HI);
 985                 break;
 986         case SIGINT:
 987                 exit(128+SIGINT);
 988         }
 989 }
 990 void signal_setup(void) {
 991         struct sigaction saction;
 992
 993         saction.sa_handler = signal_handler;
 994         sigemptyset(&saction.sa_mask);
 995         saction.sa_flags = 0;
 996         if (sigaction(SIGCONT, &saction, NULL) < 0) {
 997                 perror ("SIGCONT");
 998                 exit (1);
 999         }
1000         if (sigaction(SIGINT, &saction, NULL) < 0) {
1001                 perror ("SIGINT");
1002                 exit (1);
1003         }
1004 }
1005 //}}}
1006
1007 //vim: foldmethod=marker