sol.c

   1 #define _DEFAULT_SOURCE
   2 #include <poll.h>
   3 #include <stdio.h>
   4 #include <stdlib.h>
   5 #include <time.h>
   6 #include <termios.h>
   7 #include <unistd.h>
   8
   9 #include "sol.h"
  10 #include "schemes.h"
  11
  12 #ifdef KLONDIKE
  13 #define NUM_PILES 7
  14 #define MAX_HIDDEN 6 /*how many cards are turned over at most in a tableu pile*/
  15 #define MAX_STOCK 24 /*how many cards can be in the stock at most (=@start)*/
  16 #define NUM_DECKS 1
  17 #define PILE_SIZE MAX_HIDDEN+NUM_RANKS
  18 #elif defined SPIDER
  19 #define MAX_HIDDEN 5
  20 #define NUM_PILES 10
  21 #define MAX_STOCK 50 /*how many cards can be dealt onto the piles*/
  22 #define NUM_DECKS 2
  23 #define PILE_SIZE DECK_SIZE*NUM_DECKS /* no maximum stack size in spider :/ */
  24 #endif
  25
  26 #define get_suit(card) \
  27         ((card-1) % NUM_SUITS)
  28 #define get_rank(card) \
  29         ((card-1) / NUM_SUITS)
  30 #define get_color(card) \
  31         ((get_suit(card) ^ get_suit(card)>>1) & 1)
  32
  33 struct playfield {
  34         card_t s[MAX_STOCK]; /* stock */
  35         int z; /* stock size */
  36         int w; /* waste; index into stock (const -1 in spider) */
  37         card_t f[NUM_DECKS*NUM_SUITS][PILE_SIZE]; /* foundation */
  38         card_t t[NUM_PILES][PILE_SIZE]; /* tableu piles */
  39         struct undo {
  40                 int f; /* pile cards were taken from (overloaded:128+n=stock) */
  41                 int t; /* pile cards were moved to */
  42                 int n; /* number of cards moved */
  43                 struct undo* prev;
  44                 struct undo* next;
  45         }* u;
  46 } f;
  47 struct opts {
  48 #ifdef SPIDER
  49         int m; /* difficulty mode */
  50 #endif
  51         const struct scheme* s;
  52 } op;
  53
  54 // action table {{{
  55 /* stores a function pointer for every takeable action; called by game loop */
  56 int (*action[NUM_PLACES][10])(int,int) = {
  57 #ifdef KLONDIKE
  58         /* 1    2    3    4    5    6    7   stk  wst  fnd*/
  59 /* 1 */ { t2f, t2t, t2t, t2t, t2t, t2t, t2t, nop, nop, t2f },
  60 /* 2 */ { t2t, t2f, t2t, t2t, t2t, t2t, t2t, nop, nop, t2f },
  61 /* 3 */ { t2t, t2t, t2f, t2t, t2t, t2t, t2t, nop, nop, t2f },
  62 /* 4 */ { t2t, t2t, t2t, t2f, t2t, t2t, t2t, nop, nop, t2f },
  63 /* 5 */ { t2t, t2t, t2t, t2t, t2f, t2t, t2t, nop, nop, t2f },
  64 /* 6 */ { t2t, t2t, t2t, t2t, t2t, t2f, t2t, nop, nop, t2f },
  65 /* 7 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2f, nop, nop, t2f },
  66 /*stk*/ { nop, nop, nop, nop, nop, nop, nop, nop, s2w, nop },
  67 /*wst*/ { w2t, w2t, w2t, w2t, w2t, w2t, w2t, w2s, w2f, w2f },
  68 /*fnd*/ { f2t, f2t, f2t, f2t, f2t, f2t, f2t, nop, nop, nop },
  69 #elif defined SPIDER
  70         /* 1    2    3    4    5    6    7    8    9    10*/
  71 /* 1 */ { nop, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t },
  72 /* 2 */ { t2t, nop, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t },
  73 /* 3 */ { t2t, t2t, nop, t2t, t2t, t2t, t2t, t2t, t2t, t2t },
  74 /* 4 */ { t2t, t2t, t2t, nop, t2t, t2t, t2t, t2t, t2t, t2t },
  75 /* 5 */ { t2t, t2t, t2t, t2t, nop, t2t, t2t, t2t, t2t, t2t },
  76 /* 6 */ { t2t, t2t, t2t, t2t, t2t, nop, t2t, t2t, t2t, t2t },
  77 /* 7 */ { t2t, t2t, t2t, t2t, t2t, t2t, nop, t2t, t2t, t2t },
  78 /* 8 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2t, nop, t2t, t2t },
  79 /* 9 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, nop, t2t },
  80 /*10 */ { t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, t2t, nop },
  81 /*stk*/ { s2t, s2t, s2t, s2t, s2t, s2t, s2t, s2t, s2t, s2t },
  82 #endif
  83 };
  84 // }}}
  85
  86 int main(int argc, char** argv) {
  87         (void) argc;(void) argv;
  88         op.s = &unicode_large_color;
  89 #ifdef SPIDER
  90         op.m = MEDIUM; //TODO: make configurable
  91         op.m = EASY;
  92 #endif
  93         screen_setup(1);
  94         sol(); //TODO: restart, etc.
  95         screen_setup(0);
  96 }
  97
  98 void sol(void) {
  99         deal();
 100
 101         int from, to;
 102         print_table(NO_HI);
 103         for(;;) {
 104                 switch (get_cmd(&from, &to)) {
 105                 case CMD_MOVE:
 106                         switch (action[from][to](from,to)) {
 107                         case OK:  break;
 108                         case ERR: visbell(); break;
 109                         case WON:
 110                                 print_table(NO_HI);
 111                                 win_anim();
 112                                 getchar(); /* consume char left by win_anim() */
 113                                 return;
 114                         }
 115                         break;
 116                 case CMD_QUIT: return;
 117                 }
 118                 print_table(NO_HI);
 119         }
 120 }
 121
 122 int find_top(card_t* pile) {
 123         int i;
 124         for(i=PILE_SIZE-1; i>=0 && !pile[i]; i--);
 125         return i;
 126 }
 127 void turn_over(card_t* pile) {
 128         int top = find_top(pile);
 129         if (pile[top] < 0) pile[top] *= -1;
 130 }
 131 int check_won(void) {
 132         for (int pile = 0; pile < NUM_DECKS*NUM_SUITS; pile++)
 133                 if (f.f[pile][NUM_RANKS-1] == NO_CARD) return 0;
 134
 135         return 1;
 136 }
 137 void win_anim(void) {
 138         printf ("\033[?25l"); /* hide cursor */
 139         for (;;) {
 140                 /* set cursor to random location */
 141                 int row = 1+random()%(24-op.s->width);
 142                 int col = 1+random()%(80-op.s->height);
 143
 144                 /* draw random card */
 145                 int face = 1 + random() % 52;
 146                 for (int l = 0; l < op.s->height; l++) {
 147                         printf ("\033[%d;%dH", row+l, col);
 148                         printf ("%s", op.s->card[face][l]);
 149                 }
 150                 fflush (stdout);
 151
 152                 /* exit on keypress */
 153                 struct pollfd p = {STDIN_FILENO, POLLIN, 0};
 154                 if (poll (&p, 1, 80)) goto fin;
 155         }
 156 fin:
 157         printf ("\033[?25h"); /* show cursor */
 158         return;
 159 }
 160 // takeable actions {{{
 161 #ifdef KLONDIKE
 162 card_t stack_take(void) { /*NOTE: assert(f.w >= 0) */
 163         card_t card = f.s[f.w];
 164         /* move stack one over, so there are no gaps in it: */
 165         for (int i = f.w; i < f.z-1; i++)
 166                 f.s[i] = f.s[i+1];
 167         f.z--;
 168         f.w--; /* make previous card visible again */
 169         return card;
 170 }
 171 int t2f(int from, int to) { /* tableu to foundation */
 172         (void) to; //don't need
 173         int top_from = find_top(f.t[from]);
 174         to = get_suit(f.t[from][top_from]);
 175         int top_to   = find_top(f.f[to]);
 176         if ((top_to < 0 && get_rank(f.t[from][top_from]) == RANK_A)
 177         || (top_to >= 0 && get_rank(f.f[to][top_to]) == get_rank(f.t[from][top_from])-1)) {
 178                 f.f[to][top_to+1] = f.t[from][top_from];
 179                 f.t[from][top_from] = NO_CARD;
 180                 turn_over(f.t[from]);
 181                 if (check_won()) return WON;
 182                 return OK;
 183         } else return ERR;
 184 }
 185 int w2f(int from, int to) { /* waste to foundation */
 186         (void) from; (void) to; //don't need
 187         if (f.w < 0) return ERR;
 188         to = get_suit(f.s[f.w]);
 189         int top_to = find_top(f.f[to]);
 190         if ((top_to < 0 && get_rank(f.s[f.w]) == RANK_A)
 191         || (top_to >= 0 && get_rank(f.f[to][top_to]) == get_rank(f.s[f.w])-1)) {
 192                 f.f[to][top_to+1] = stack_take();
 193                 if (check_won()) return WON;
 194                 return OK;
 195         } else return ERR;
 196
 197 }
 198 int s2w(int from, int to) { /* stock to waste */
 199         (void) from; (void) to; //don't need
 200         if (f.z == 0) return ERR;
 201         f.w++;
 202         if (f.w == f.z) f.w = -1;
 203         return OK;
 204 }
 205 int w2s(int from, int to) { /* waste to stock (undoes stock to waste) */
 206         (void) from; (void) to; //don't need
 207         if (f.z == 0) return ERR;
 208         f.w--;
 209         if (f.w < -1) f.w = f.z-1;
 210         return OK;
 211 }
 212 int f2t(int from, int to) { /* foundation to tableu */
 213         int top_to = find_top(f.t[to]);
 214         printf ("take from (1-4): "); fflush (stdout);
 215         from = getchar() - '1';
 216         if (from < 0 || from > 3) return ERR;
 217         int top_from = find_top(f.f[from]);
 218
 219         if ((get_color(f.t[to][top_to]) != get_color(f.f[from][top_from]))
 220         && (get_rank(f.t[to][top_to]) == get_rank(f.f[from][top_from])+1)) {
 221                 f.t[to][top_to+1] = f.f[from][top_from];
 222                 f.f[from][top_from] = NO_CARD;
 223                 return OK;
 224         } else return ERR;
 225 }
 226 int w2t(int from, int to) { /* waste to tableu */
 227         (void) from; //don't need
 228         int top_to = find_top(f.t[to]);
 229         if (((get_color(f.t[to][top_to]) != get_color(f.s[f.w]))
 230            && (get_rank(f.t[to][top_to]) == get_rank(f.s[f.w])+1))
 231         || (top_to < 0 && get_rank(f.s[f.w]) == RANK_K)) {
 232                 f.t[to][top_to+1] = stack_take();
 233                 return OK;
 234         } else return ERR;
 235 }
 236 int t2t(int from, int to) { /* tableu to tableu */
 237         int top_to = find_top(f.t[to]);
 238         int top_from = find_top(f.t[from]);
 239         for (int i = top_from; i >=0; i--) {
 240                 if (((get_color(f.t[to][top_to]) != get_color(f.t[from][i]))
 241                    && (get_rank(f.t[to][top_to]) == get_rank(f.t[from][i])+1)
 242                    && f.t[from][i] > NO_CARD) /* card face up? */
 243                 || (top_to < 0 && get_rank(f.t[from][i]) == RANK_K)) {
 244                         /* move cards [i..top_from] to their destination */
 245                         for (;i <= top_from; i++) {
 246                                 top_to++;
 247                                 f.t[to][top_to] = f.t[from][i];
 248                                 f.t[from][i] = NO_CARD;
 249                         }
 250                         turn_over(f.t[from]);
 251                         return OK;
 252                 }
 253         }
 254         return ERR; /* no such move possible */
 255 }
 256 #elif defined SPIDER
 257 void remove_if_complete (card_t* pile) { //TODO: cleanup
 258         static int foundation = 0; /* where to put pile onto (1 set per stack)*/
 259         /* test if K...A complete; move to foundation if so */
 260         int top_from = find_top(pile);
 261         if (get_rank(pile[top_from]) != RANK_A) return;
 262         for (int i = top_from; i>=0; i--) {
 263                 if ((i+1 < PILE_SIZE && pile[i+1] != NO_CARD) // card below or last? XXX: copied from t2t()--make function
 264                     && (get_rank(pile[i+1]) != get_rank(pile[i])-1) //cards not consecutive?
 265                    ) {
 266                         return;
 267                 }
 268                 if ((i+1 < PILE_SIZE && pile[i+1] != NO_CARD) // card below  or last?
 269                     && (get_suit(pile[i+1]) != get_suit(pile[i])) //cards not same suit?
 270                    ) {
 271                         return;
 272                 }
 273                 if (i+RANK_K == top_from
 274                     && get_rank(pile[top_from-RANK_K]) == RANK_K) { //ace to king ok, remove it
 275                         for (int i = top_from, j = 0; i > top_from-NUM_RANKS; i--, j++) {
 276                                 f.f[foundation][j] = pile[i];
 277                                 pile[i] = NO_CARD;
 278                         }
 279                         foundation++;
 280                         turn_over(pile);
 281                         return;
 282                 }
 283         }
 284 }
 285 int t2t(int from, int to) { //TODO: in dire need of cleanup
 286         //TODO: segfaulted once on large column
 287         //TODO: sometimes moving doesn't work (ERR when it should be OK) XXX
 288
 289         int top_from = find_top(f.t[from]);
 290         int top_to = find_top(f.t[to]);
 291         int empty_to = -1; //awful, nondescriptive name :/
 292         if (top_to < 0) { /* empty pile? */
 293                 printf ("\rup to (a23456789xjqk): "); //TODO: automatically do it if only 1 card movable
 294                 empty_to = getchar();
 295                 switch (empty_to) {
 296                 case 'a': case 'A': empty_to = RANK_A; break;
 297                 case '0': /* fallthrough */
 298                 case 'x': case 'X': empty_to = RANK_X; break;
 299                 case 'j': case 'J': empty_to = RANK_J; break;
 300                 case 'q': case 'Q': empty_to = RANK_Q; break;
 301                 case 'k': case 'K': empty_to = RANK_K; break;
 302                 default: empty_to -= '1';
 303                 }
 304                 if (empty_to < RANK_A || empty_to > RANK_K) return ERR;
 305         }
 306         for (int i = top_from; i >= 0; i--) {
 307                 if ((i+1 < PILE_SIZE && f.t[from][i+1] != NO_CARD) // card below or last?
 308                     && (get_rank(f.t[from][i+1]) != get_rank(f.t[from][i])-1) //cards not consecutive?
 309                    ) {
 310                         break;
 311                 }
 312                 if ((i+1 < PILE_SIZE && f.t[from][i+1] != NO_CARD) // card below  or last?
 313                     && (get_suit(f.t[from][i+1]) != get_suit(f.t[from][i])) //cards not same suit?
 314                    ) {
 315                         break;
 316                 }
 317
 318                 if ((get_rank(f.t[from][i]) == get_rank(f.t[to][top_to])-1) // consecutive?
 319                 || (empty_to >= RANK_A && get_rank(f.t[from][i]) == empty_to)) { //to empty pile and rank ok?
 320                         for (;i <= top_from; i++) {
 321                                 top_to++;
 322                                 f.t[to][top_to] = f.t[from][i];
 323                                 f.t[from][i] = NO_CARD;
 324                         }
 325                         turn_over(f.t[from]);
 326                         remove_if_complete (f.t[to]);
 327                         if (check_won()) return WON;
 328                         return OK;
 329                 }
 330         }
 331
 332         return ERR; /* no such move possible */
 333 }
 334 int s2t(int from, int to) { //TODO: check remove, won
 335         (void) from; (void) to; //don't need
 336         if (f.z <= 0) return ERR; /* stack out of cards */
 337         for (int pile = 0; pile < NUM_PILES; pile++)
 338                 if (f.t[pile][0]==NO_CARD) return ERR; /*no piles may be empty*/
 339         for (int pile = 0; pile < NUM_PILES; pile++) {
 340                 f.t[pile][find_top(f.t[pile])+1] = f.s[--f.z];
 341         }
 342         return OK;
 343 }
 344 #endif
 345 int nop(int from, int to) { (void)from;(void)to; return ERR; }
 346 // }}}
 347
 348 int get_cmd (int* from, int* to) {
 349         //returns 0 on success or an error code indicating game quit, new game,...
 350         //TODO: escape sequences (mouse, cursor keys)
 351         int f, t;
 352         f = getchar();
 353
 354         switch (f) {
 355         case '1': *from = TAB_1; break;
 356         case '2': *from = TAB_2; break;
 357         case '3': *from = TAB_3; break;
 358         case '4': *from = TAB_4; break;
 359         case '5': *from = TAB_5; break;
 360         case '6': *from = TAB_6; break;
 361         case '7': *from = TAB_7; break;
 362 #ifdef SPIDER
 363         case '8': *from = TAB_8; break;
 364         case '9': *from = TAB_9; break;
 365         case '0': *from = TAB_10; break;
 366 #elif defined KLONDIKE
 367         case '9': *from = WASTE; break;
 368         case '0': *from = FOUNDATION; break;
 369         case '8': /* fallthrough */
 370 #endif
 371         case '\n': /* shortcut for dealing from stock */
 372                 *from = STOCK;
 373                 *to = WASTE;
 374                 return CMD_MOVE;
 375         case 'q': return CMD_QUIT;
 376         case 'r': return CMD_NEW;  //TODO
 377         case 'h': return CMD_HINT; //TODO
 378         case '?': return CMD_HELP; //TODO
 379         case '/': return CMD_FIND; //TODO: highlight card of given rank (even non-movable)
 380         case '\033': return CMD_INVAL; //TODO: cntlseq
 381         default: return CMD_INVAL;
 382         }
 383         print_table(*from);
 384
 385         t = getchar();
 386         if (t < '0' || t > '9') return CMD_INVAL;
 387         if (t == '0')
 388 #ifdef KLONDIKE
 389                 *to = FOUNDATION;
 390 #elif defined SPIDER
 391                 *to = TAB_10;
 392 #endif
 393         else
 394                 *to = t-'1';
 395         return CMD_MOVE;
 396 }
 397
 398 void deal(void) {
 399         f = (const struct playfield){0}; /* clear playfield */
 400         card_t deck[DECK_SIZE*NUM_DECKS];
 401         int avail = DECK_SIZE*NUM_DECKS;
 402         for (int i = 0; i < DECK_SIZE*NUM_DECKS; i++) deck[i] = (i%DECK_SIZE)+1;
 403 #ifdef SPIDER
 404         if (op.m != NORMAL) for (int i = 0; i < DECK_SIZE*NUM_DECKS; i++) {
 405                 if (op.m == MEDIUM) deck[i] = 1+((deck[i]-1) | 2);
 406                 if (op.m == EASY)   deck[i] = 1+((deck[i]-1) | 2 | 1);
 407                 /* the 1+ -1 dance gets rid of the offset created by NO_CARD */
 408         }
 409 #endif
 410         srandom (time(NULL));
 411 /*XXX*/ long seed = time(NULL);
 412 /*XXX*/ srandom (seed);
 413         for (int i = DECK_SIZE*NUM_DECKS-1; i > 0; i--) { //fisher-yates
 414                 int j = random() % (i+1);
 415                 if (j-i) deck[i]^=deck[j],deck[j]^=deck[i],deck[i]^=deck[j];
 416         }
 417 ///////////////////////////////////////////////XXX
 418 //sometimes we see duplicate cards. this tries to catch that
 419 int count[_NUM_CARDS_internal] = {0};
 420 for (int i = 0; i < DECK_SIZE*NUM_DECKS; i++)
 421         count[deck[i]]++;
 422 for (int i = 0; i < _NUM_CARDS_internal; i++){ //0 is NO_CARD
 423 #ifdef SPIDER
 424         int x = op.m==MEDIUM?2:op.m==EASY?4:1;
 425 #else
 426         int x = 1;
 427 #endif
 428         if (deck[i] == NO_CARD) continue;
 429         if (count[deck[i]] != NUM_DECKS*x) {
 430                 screen_setup(0);
 431                 printf ("found duplicate card with seed %lx!\n", seed);
 432                 for (int i = 1; i < _NUM_CARDS_internal; i++)
 433                         printf ("%3d of %2d\n", count[deck[i]], deck[i]);
 434                 exit(1);
 435         }
 436 }
 437 ///////////////////////////////////////////////XXX
 438
 439         /* deal cards: */
 440         for (int i = 0; i < NUM_PILES; i++) {
 441 #ifdef KLONDIKE
 442                 int closed = i; /* pile n has n closed cards, then 1 open */
 443 #elif defined SPIDER
 444                 int closed = i<4?5:4; /* pile 1-4 have 5, 5-10 have 4 closed */
 445 #endif
 446                 /* face down cards are negated: */
 447                 for (int j = 0; j < closed; j++) f.t[i][j] = -deck[--avail];
 448                 f.t[i][closed] = deck[--avail]; /* the face-up card */
 449         }
 450         /* rest of the cards to the stock; NOTE: assert(avail==50) for spider */
 451         for (f.z = 0; avail; f.z++) f.s[f.z] = deck[--avail];
 452         f.w = -1; /* @start: nothing on waste (no waste in spider -> const) */
 453 }
 454
 455 int is_movable(card_t* pile, int n) { //TODO cleanup, code deduplication, needs entry in sol.h
 456 #ifdef KLONDIKE
 457         return(pile[n] > NO_CARD); /*non-movable cards don't exist in klondike*/
 458 #elif defined SPIDER
 459         int top = find_top(pile);
 460         for (int i = top; i; i--) {
 461                 if (pile[i] <= NO_CARD) return 0; //card face down?
 462                 if ((i+1 < PILE_SIZE && pile[i+1] != NO_CARD) // card below or last? //COPIED FROM t2t
 463                     && (get_rank(pile[i+1]) != get_rank(pile[i])-1) //cards not consecutive?
 464                    ) {
 465                         return 0;
 466                 }
 467                 if ((i+1 < PILE_SIZE && pile[i+1] != NO_CARD) // card below  or last?
 468                     && (get_suit(pile[i+1]) != get_suit(pile[i])) //cards not same suit?
 469                    ) {
 470                         return 0;
 471                 }
 472                 if (i == n) return 1; //card reached, must be movable
 473         }
 474         return 0;
 475 #endif
 476 }
 477 #define print_hi(test, str) /* for highlighting during get_cmd() */ \
 478         printf ("%s%s%s", (test)?"\033[7m":"", str, (test)?"\033[27m":"")
 479 void print_table(int highlight) { //{{{
 480         printf("\033[2J\033[H"); /* clear screen, reset cursor */
 481 #ifdef KLONDIKE
 482         /* print stock, waste and foundation: */
 483         for (int line = 0; line < op.s->height; line++) {
 484                 /* stock: */
 485                 print_hi (highlight == STOCK, (
 486                         (f.w < f.z-1)?op.s->facedown
 487                         :op.s->placeholder)[line]);
 488                 /* waste: */
 489                 print_hi (highlight == WASTE, (
 490                         /* NOTE: cast, because f.w sometimes is (short)-1 !? */
 491                         ((short)f.w >= 0)?op.s->card[f.s[f.w]]
 492                         :op.s->placeholder)[line]);
 493                 printf ("%s", op.s->card[NO_CARD][line]); /* spacer */
 494                 /* foundation: */
 495                 for (int pile = 0; pile < NUM_SUITS; pile++) {
 496                         int card = find_top(f.f[pile]);
 497                         print_hi (highlight == FOUNDATION,
 498                                 (card < 0)?op.s->placeholder[line]
 499                                 :op.s->card[f.f[pile][card]][line]);
 500                 }
 501                 printf("\n");
 502         }
 503         printf("\n");
 504 #endif
 505         /* print tableu piles: */
 506         int row[NUM_PILES] = {0};
 507         int line[NUM_PILES]= {0};
 508         int label[NUM_PILES]={0};// :|
 509         int line_had_card; // :|
 510         do {
 511                 line_had_card = 0;
 512                 for (int pile = 0; pile < NUM_PILES; pile++) {
 513                         card_t card = f.t[pile][row[pile]];
 514                         card_t next = f.t[pile][row[pile]+1];
 515
 516                         print_hi (highlight == pile && is_movable(f.t[pile],row[pile]), (
 517                                 (card<0)?op.s->facedown
 518                                 :op.s->card[card]
 519                                 )[line[pile]]);
 520
 521                         if (++line[pile] >= (next?op.s->overlap:op.s->height) //normal overlap
 522 #if 0 //XXX
 523                         || (line[pile] >= 1 &&
 524                             f.t[pile][row[pile]] < 0 &&
 525                             f.t[pile][row[pile]+1] <0) //extreme overlap on closed
 526                         || (0) //extreme overlap on sequence TODO
 527 #endif
 528                         ) {
 529                                 line[pile]=0;
 530                                 row[pile]++;
 531                         }
 532                         if(!card && !label[pile]) { /* tableu labels: */
 533                                 label[pile] = 1;
 534                                 printf ("\b\b%d ", (pile+1) % 10); //XXX: hack
 535                         }
 536                         line_had_card |= !!card;
 537                 }
 538                 printf ("\n");
 539         } while (line_had_card);
 540 }//}}}
 541
 542 void visbell (void) {
 543         printf ("\033[?5h"); fflush (stdout);
 544         usleep (100000);
 545         printf ("\033[?5l"); fflush (stdout);
 546 }
 547
 548 void append_undo (int n, int f, int t) {
 549         (void)n;(void)f;(void)t;
 550         //check if we have to free redo buffer (.next)
 551         //malloc
 552         //update pointers
 553         //TODO: undo; needs operations to be written by x2y()
 554 }
 555
 556 void screen_setup (int enable) {
 557         if (enable) {
 558                 raw_mode(1);
 559                 printf ("\033[s\033[?47h"); /* save cursor, alternate screen */
 560                 printf ("\033[H\033[J"); /* reset cursor, clear screen */
 561                 //TODO//printf ("\033[?1000h\033[?25l"); /* enable mouse, hide cursor */
 562         } else {
 563                 //TODO//printf ("\033[?9l\033[?25h"); /* disable mouse, show cursor */
 564                 printf ("\033[?47l\033[u"); /* primary screen, restore cursor */
 565                 raw_mode(0);
 566         }
 567 }
 568
 569 void raw_mode(int enable) { //{{{
 570         static struct termios saved_term_mode;
 571         struct termios raw_term_mode;
 572
 573         if (enable) {
 574                 tcgetattr(STDIN_FILENO, &saved_term_mode);
 575                 raw_term_mode = saved_term_mode;
 576                 raw_term_mode.c_lflag &= ~(ICANON | ECHO);
 577                 raw_term_mode.c_cc[VMIN] = 1 ;
 578                 raw_term_mode.c_cc[VTIME] = 0;
 579                 tcsetattr(STDIN_FILENO, TCSAFLUSH, &raw_term_mode);
 580         } else {
 581                 tcsetattr(STDIN_FILENO, TCSAFLUSH, &saved_term_mode);
 582         }
 583 } //}}}
 584
 585 //vim: foldmethod=marker