1 #define _DEFAULT_SOURCE
2 #define _POSIX_C_SOURCE /* for sigaction */
18 /* stores a function pointer for every takeable action; called by game loop */
19 int (*action
[NUM_PLACES
][10])(int,int,int) = {
21 /* 1 2 3 4 5 6 7 stk wst fnd*/
22 /* 1 */ { t2f
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, nop
, nop
, t2f
},
23 /* 2 */ { t2t
, t2f
, t2t
, t2t
, t2t
, t2t
, t2t
, nop
, nop
, t2f
},
24 /* 3 */ { t2t
, t2t
, t2f
, t2t
, t2t
, t2t
, t2t
, nop
, nop
, t2f
},
25 /* 4 */ { t2t
, t2t
, t2t
, t2f
, t2t
, t2t
, t2t
, nop
, nop
, t2f
},
26 /* 5 */ { t2t
, t2t
, t2t
, t2t
, t2f
, t2t
, t2t
, nop
, nop
, t2f
},
27 /* 6 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2f
, t2t
, nop
, nop
, t2f
},
28 /* 7 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2f
, nop
, nop
, t2f
},
29 /*stk*/ { nop
, nop
, nop
, nop
, nop
, nop
, nop
, nop
, s2w
, nop
},
30 /*wst*/ { w2t
, w2t
, w2t
, w2t
, w2t
, w2t
, w2t
, w2s
, w2f
, w2f
},
31 /*fnd*/ { f2t
, f2t
, f2t
, f2t
, f2t
, f2t
, f2t
, nop
, nop
, nop
},
33 /* 1 2 3 4 5 6 7 8 9 10*/
34 /* 1 */ { t2f
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
},
35 /* 2 */ { t2t
, t2f
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
},
36 /* 3 */ { t2t
, t2t
, t2f
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
},
37 /* 4 */ { t2t
, t2t
, t2t
, t2f
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
},
38 /* 5 */ { t2t
, t2t
, t2t
, t2t
, t2f
, t2t
, t2t
, t2t
, t2t
, t2t
},
39 /* 6 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2f
, t2t
, t2t
, t2t
, t2t
},
40 /* 7 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2f
, t2t
, t2t
, t2t
},
41 /* 8 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2f
, t2t
, t2t
},
42 /* 9 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2f
, t2t
},
43 /*10 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2f
},
44 /*stk*/ { s2t
, s2t
, s2t
, s2t
, s2t
, s2t
, s2t
, s2t
, s2t
, s2t
},
49 // argv parsing, game loops, cleanup {{{
50 int main(int argc
, char** argv
) {
51 /* opinionated defaults: */
52 op
.s
= &unicode_large_color
;
59 opterr
= 0; /* don't print message on unrecognized option */
60 while ((optget
= getopt (argc
, argv
, "+:hs:vbcm")) != -1) {
63 case 's': /* number of suits */
65 case '1': op
.m
= EASY
; break;
66 case '2': op
.m
= MEDIUM
; break;
67 case '4': op
.m
= NORMAL
; break;
71 case 'v': op
.v
= 1; break; /* conserve vertical space */
72 case 'b': op
.s
= &unicode_large_mono
; break;
73 case 'c': op
.s
= &unicode_large_color
; break;
74 case 'm': op
.s
= &unicode_small_mono
; break; /* "mini" */
75 case 'h': default: goto error
;
77 fprintf (stderr
, SHORTHELP LONGHELP KEYHELP
, argv
[0]);
89 case GAME_NEW
: goto newgame
;
91 print_table(NO_HI
, NO_HI
);
93 if (getchar()=='q') return 0;
95 case GAME_QUIT
: return 0;
100 /* clean undo (from previous game): */
107 switch (get_cmd(&from
, &to
, &opt
)) {
109 switch (action
[from
][to
](from
,to
,opt
)) {
111 case ERR
: visbell(); break;
112 case WON
: return GAME_WON
;
115 case CMD_HINT
: break;//TODO: show a possible (and sensible) move
116 case CMD_JOIN
: break;//TODO: join any pile to here (longest if possible)
117 case CMD_UNDO
: undo_pop(f
.u
); break;
118 case CMD_INVAL
: visbell(); break;
119 case CMD_NEW
: return GAME_NEW
;
120 case CMD_AGAIN
: //TODO: restart with same seed
121 case CMD_QUIT
: return GAME_QUIT
;
128 /* free undo data structures: */
133 // card games helper functions {{{
134 #define get_suit(card) \
135 ((card-1) % NUM_SUITS)
136 #define get_rank(card) \
137 ((card-1) / NUM_SUITS)
138 #define get_color(card) \
139 ((get_suit(card) ^ get_suit(card)>>1) & 1)
141 #define is_tableu(where) (where <= TAB_MAX)
143 int find_top(card_t
* pile
) {
145 for(i
=PILE_SIZE
-1; i
>=0 && !pile
[i
]; i
--);
148 int first_movable(card_t
* pile
) {
150 for (;pile
[i
] && !is_movable(pile
, i
); i
++);
153 int turn_over(card_t
* pile
) {
154 int top
= find_top(pile
);
160 int check_won(void) {
161 for (int pile
= 0; pile
< NUM_DECKS
*NUM_SUITS
; pile
++)
162 if (f
.f
[pile
][NUM_RANKS
-1] == NO_CARD
) return 0;
166 int rank_next (card_t a
, card_t b
) {
167 return get_rank(a
) == get_rank(b
)-1;
169 int is_consecutive (card_t
* pile
, int pos
) {
170 if (pos
+1 >= PILE_SIZE
) return 1; /* card is last */
171 if (pile
[pos
+1] == NO_CARD
) return 1; /* card is first */
174 /* ranks consecutive? */
175 if (!rank_next(pile
[pos
+1], pile
[pos
])) return 0;
176 /* color opposite? */
177 if (get_color(pile
[pos
+1]) == get_color(pile
[pos
])) return 0;
179 /* ranks consecutive? */
180 if (!rank_next(pile
[pos
+1], pile
[pos
])) return 0;
182 if (get_suit(pile
[pos
+1]) != get_suit(pile
[pos
])) return 0;
188 int is_movable(card_t
* pile
, int n
) {
190 return(pile
[n
] > NO_CARD
); /*non-movable cards don't exist in klondike*/
192 int top
= find_top(pile
);
193 for (int i
= top
; i
>= 0; i
--) {
194 if (pile
[i
] <= NO_CARD
) return 0; /*no card or card face down?*/
195 if (!is_consecutive(pile
, i
)) return 0;
196 if (i
== n
) return 1; /* card reached, must be movable */
203 // takeable actions {{{
205 card_t
stack_take(void) { /*NOTE: assert(f.w >= 0) */
206 card_t card
= f
.s
[f
.w
];
207 /* move stack one over, so there are no gaps in it: */
208 for (int i
= f
.w
; i
< f
.z
-1; i
++)
211 f
.w
--; /* make previous card visible again */
214 int t2f(int from
, int to
, int opt
) { /* tableu to foundation */
215 (void) to
; (void) opt
; /* don't need */
216 int top_from
= find_top(f
.t
[from
]);
217 to
= get_suit(f
.t
[from
][top_from
]);
218 int top_to
= find_top(f
.f
[to
]);
219 if ((top_to
< 0 && get_rank(f
.t
[from
][top_from
]) == RANK_A
)
220 || (top_to
>= 0 && rank_next(f
.f
[to
][top_to
],f
.t
[from
][top_from
]))) {
221 f
.f
[to
][top_to
+1] = f
.t
[from
][top_from
];
222 f
.t
[from
][top_from
] = NO_CARD
;
223 undo_push(from
, FOUNDATION
, to
,
224 turn_over(f
.t
[from
]));
225 if (check_won()) return WON
;
229 int w2f(int from
, int to
, int opt
) { /* waste to foundation */
230 (void) from
; (void) to
; (void) opt
; /* don't need */
231 if (f
.w
< 0) return ERR
;
232 to
= get_suit(f
.s
[f
.w
]);
233 int top_to
= find_top(f
.f
[to
]);
234 if ((top_to
< 0 && get_rank(f
.s
[f
.w
]) == RANK_A
)
235 || (top_to
>= 0 && rank_next(f
.f
[to
][top_to
], f
.s
[f
.w
]))) {
236 undo_push(WASTE
, FOUNDATION
, f
.w
| to
<<16, 0);//ugly encoding :|
237 f
.f
[to
][top_to
+1] = stack_take();
238 if (check_won()) return WON
;
243 int s2w(int from
, int to
, int opt
) { /* stock to waste */
244 (void) from
; (void) to
; (void) opt
; /* don't need */
245 if (f
.z
== 0) return ERR
;
247 if (f
.w
== f
.z
) f
.w
= -1;
250 int w2s(int from
, int to
, int opt
) { /* waste to stock (undo stock to waste) */
251 (void) from
; (void) to
; (void) opt
; /* don't need */
252 if (f
.z
== 0) return ERR
;
254 if (f
.w
< -1) f
.w
= f
.z
-1;
257 int f2t(int from
, int to
, int opt
) { /* foundation to tableu */
258 (void) from
; /* don't need */
259 int top_to
= find_top(f
.t
[to
]);
261 int top_from
= find_top(f
.f
[from
]);
263 if ((get_color(f
.t
[to
][top_to
]) != get_color(f
.f
[from
][top_from
]))
264 && (rank_next(f
.f
[from
][top_from
], f
.t
[to
][top_to
]))) {
265 f
.t
[to
][top_to
+1] = f
.f
[from
][top_from
];
266 f
.f
[from
][top_from
] = NO_CARD
;
267 undo_push(FOUNDATION
, to
, from
, 0);
271 int w2t(int from
, int to
, int opt
) { /* waste to tableu */
272 (void) from
; (void) opt
; /* don't need */
273 int top_to
= find_top(f
.t
[to
]);
274 if (((get_color(f
.t
[to
][top_to
]) != get_color(f
.s
[f
.w
]))
275 && (rank_next(f
.s
[f
.w
], f
.t
[to
][top_to
])))
276 || (top_to
< 0 && get_rank(f
.s
[f
.w
]) == RANK_K
)) {
277 undo_push(WASTE
, to
, f
.w
, 0);
278 f
.t
[to
][top_to
+1] = stack_take();
282 int t2t(int from
, int to
, int opt
) { /* tableu to tableu */
283 (void) opt
; /* don't need */
284 int top_to
= find_top(f
.t
[to
]);
285 int top_from
= find_top(f
.t
[from
]);
286 int count
= 0; //NOTE: could probably be factored out
287 for (int i
= top_from
; i
>=0; i
--) {
288 if (((get_color(f
.t
[to
][top_to
]) != get_color(f
.t
[from
][i
]))
289 && (rank_next(f
.t
[from
][i
], f
.t
[to
][top_to
]))
290 && f
.t
[from
][i
] > NO_CARD
) /* card face up? */
291 || (top_to
< 0 && get_rank(f
.t
[from
][i
]) == RANK_K
)) {
292 /* move cards [i..top_from] to their destination */
293 for (;i
<= top_from
; i
++) {
295 f
.t
[to
][top_to
] = f
.t
[from
][i
];
296 f
.t
[from
][i
] = NO_CARD
;
299 undo_push(from
, to
, count
,
300 turn_over(f
.t
[from
]));
304 return ERR
; /* no such move possible */
307 int remove_if_complete (int pileno
) { //cleanup!
308 card_t
* pile
= f
.t
[pileno
];
309 /* test if K...A complete; move to foundation if so */
310 int top_from
= find_top(pile
);
311 if (get_rank(pile
[top_from
]) != RANK_A
) return 0;
312 for (int i
= top_from
; i
>=0; i
--) {
313 if (!is_consecutive (pile
, i
)) return 0;
314 if (i
+RANK_K
== top_from
/* if ace to king: remove it */
315 && get_rank(pile
[top_from
-RANK_K
]) == RANK_K
) {
316 for(int i
=top_from
, j
=0; i
>top_from
-NUM_RANKS
; i
--,j
++){
317 f
.f
[f
.w
][j
] = pile
[i
];
320 undo_push(pileno
, FOUNDATION
, f
.w
,
329 int t2t(int from
, int to
, int opt
) { //in dire need of cleanup
330 int top_from
= find_top(f
.t
[from
]);
331 int top_to
= find_top(f
.t
[to
]);
332 int empty_to
= (top_to
< 0)? opt
: -1; /* empty pile? */
333 int count
= 0; //NOTE: could probably be factored out
335 for (int i
= top_from
; i
>= 0; i
--) {
336 if (!is_consecutive(f
.t
[from
], i
)) break;
338 /* is consecutive OR to empty pile and rank ok? */
339 if (rank_next(f
.t
[from
][i
], f
.t
[to
][top_to
])
340 || (empty_to
>= RANK_A
&& get_rank(f
.t
[from
][i
]) == empty_to
)) {
341 for (;i
<= top_from
; i
++) {
343 f
.t
[to
][top_to
] = f
.t
[from
][i
];
344 f
.t
[from
][i
] = NO_CARD
;
347 undo_push(from
, to
, count
,
348 turn_over(f
.t
[from
]));
349 remove_if_complete(to
);
350 if (check_won()) return WON
;
355 return ERR
; /* no such move possible */
357 int s2t(int from
, int to
, int opt
) {
358 (void) from
; (void) to
; (void) opt
; /* don't need */
359 if (f
.z
<= 0) return ERR
; /* stack out of cards */
360 for (int pile
= 0; pile
< NUM_PILES
; pile
++)
361 if (f
.t
[pile
][0]==NO_CARD
) return ERR
; /*no piles may be empty*/
362 for (int pile
= 0; pile
< NUM_PILES
; pile
++) {
363 f
.t
[pile
][find_top(f
.t
[pile
])+1] = f
.s
[--f
.z
];
364 remove_if_complete(pile
);
365 if (check_won()) return WON
;
367 undo_push(STOCK
, TABLEU
, 1, 0); /*NOTE: puts 1 card on each tableu pile*/
370 int t2f(int from
, int to
, int opt
) {
371 (void) to
; (void) opt
; /* don't need */
372 /* manually retrigger remove_if_complete() (e.g. after undo_pop) */
373 return remove_if_complete(from
)?OK
:ERR
;
376 int nop(int from
, int to
, int opt
) { (void)from
;(void)to
;(void)opt
;return ERR
; }
379 // keyboard input handling {{{
380 // cursor functions{{{
381 #pragma GCC diagnostic ignored "-Wswitch" //not ideal :|
383 void cursor_left (struct cursor
* cursor
) {
384 if (is_tableu(cursor
->pile
)) {
385 if (cursor
->pile
> 0) cursor
->pile
--;
387 } else { /* stock/waste/foundation*/
388 switch (cursor
->pile
) {
389 case WASTE
: cursor
->pile
= STOCK
; cursor
->opt
= 0; break;
391 if (cursor
->opt
<= 0)
392 cursor
->pile
= WASTE
;
398 void cursor_down (struct cursor
* cursor
) {
399 if (!is_tableu(cursor
->pile
)) {
400 switch (cursor
->pile
) {
401 case STOCK
: cursor
->pile
= TAB_1
; break;
402 case WASTE
: cursor
->pile
= TAB_2
; break;
404 cursor
->pile
= TAB_4
+ cursor
->opt
;
409 void cursor_up (struct cursor
* cursor
) {
410 if (is_tableu(cursor
->pile
)) {
411 switch (cursor
->pile
) { //ugly :|
412 case TAB_1
: cursor
->pile
= STOCK
; break;
413 case TAB_2
: cursor
->pile
= WASTE
; break;
414 case TAB_3
: cursor
->pile
= WASTE
; break;
415 case TAB_4
: case TAB_5
: case TAB_6
: case TAB_7
:
416 cursor
->opt
=cursor
->pile
-TAB_4
;
417 cursor
->pile
= FOUNDATION
;
422 void cursor_right (struct cursor
* cursor
) {
423 if (is_tableu(cursor
->pile
)) {
424 if (cursor
->pile
< TAB_MAX
) cursor
->pile
++;
426 switch (cursor
->pile
) {
427 case STOCK
: cursor
->pile
= WASTE
; break;
428 case WASTE
: cursor
->pile
= FOUNDATION
;cursor
->opt
= 0; break;
430 if (cursor
->opt
< NUM_DECKS
*NUM_SUITS
)
436 /*NOTE: one can't highlight the stock due to me being too lazy to implement it*/
437 void cursor_left (struct cursor
* cursor
) {
438 if (cursor
->pile
> 0) cursor
->pile
--;
441 void cursor_down (struct cursor
* cursor
) {
442 int first
= first_movable(f
.t
[cursor
->pile
]);
443 int top
= find_top(f
.t
[cursor
->pile
]);
444 if (first
+ cursor
->opt
< top
)
447 void cursor_up (struct cursor
* cursor
) {
448 if (cursor
->opt
> 0) cursor
->opt
--;
450 void cursor_right (struct cursor
* cursor
) {
451 if (cursor
->pile
< TAB_MAX
) cursor
->pile
++;
455 void cursor_to (struct cursor
* cursor
, int pile
) {
459 #pragma GCC diagnostic pop
461 int get_cmd (int* from
, int* to
, int* opt
) {
462 //TODO: escape sequences (mouse, cursor keys)
464 struct cursor inactive
= {-1,-1};
465 static struct cursor active
= {0,0};
466 active
.opt
= 0; /* always reset offset, but keep pile */
469 from_l
: print_table(&active
, &inactive
);
473 /* direct addressing: */
474 case '1': *from
= TAB_1
; break;
475 case '2': *from
= TAB_2
; break;
476 case '3': *from
= TAB_3
; break;
477 case '4': *from
= TAB_4
; break;
478 case '5': *from
= TAB_5
; break;
479 case '6': *from
= TAB_6
; break;
480 case '7': *from
= TAB_7
; break;
482 case '8': *from
= TAB_8
; break;
483 case '9': *from
= TAB_9
; break;
484 case '0': *from
= TAB_10
;break;
485 #elif defined KLONDIKE
486 case '9': *from
= WASTE
; break;
487 case '0': *from
= FOUNDATION
; break;
488 case '8': /* fallthrough */
490 case '\n': /* shortcut for dealing from stock */
494 /* cursor keys addressing: */
495 case 'h': cursor_left (&active
); goto from_l
;
496 case 'j': cursor_down (&active
); goto from_l
;
497 case 'k': cursor_up (&active
); goto from_l
;
498 case 'l': cursor_right(&active
); goto from_l
;
499 case 'H': cursor_to(&active
,TAB_1
); goto from_l
; /* leftmost tableu */
500 case 'L': cursor_to(&active
,TAB_MAX
);goto from_l
; /* rigthmost tableu */
501 //TODO: real cursor keys, home/end
502 case ' ': /* continue with second cursor */
504 if (*from
== STOCK
) {
509 *opt
= active
.opt
; /* when FOUNDATION */
516 fprintf (stderr
, ":");
517 raw_mode(0); /* turn on echo */
518 fgets (buf
, 256, stdin
);
521 case 'q': return CMD_QUIT
;
522 case 'n': return CMD_NEW
;
523 case 'r': return CMD_AGAIN
;
524 default: return CMD_INVAL
;
526 case 'J': return CMD_JOIN
;
527 case 'K': /* fallthrough */
528 case '?': return CMD_HINT
;
529 case 'u': return CMD_UNDO
;
530 case EOF
: return CMD_NONE
; /* sent by SIGCONT */
531 default: return CMD_INVAL
;
533 inactive
.pile
= *from
; /* for direct addressing highlighting */
534 if (is_tableu(*from
) && f
.t
[*from
][0] == NO_CARD
) return CMD_INVAL
;
537 to_l
: print_table(&active
, &inactive
);
541 case 'h': cursor_left (&active
); goto to_l
;
542 case 'j': cursor_down (&active
); goto to_l
;
543 case 'k': cursor_up (&active
); goto to_l
;
544 case 'l': cursor_right(&active
); goto to_l
;
545 case 'H': cursor_to(&active
,TAB_1
); goto to_l
;
546 case 'L': cursor_to(&active
,TAB_MAX
);goto to_l
;
547 case 'J': /* fallthrough; key makes no sense on destination */
550 break; /* continues with the foundation/empty tableu check */
551 case 'K': /* fallthrough */
552 case '?': return CMD_HINT
;
553 case 'u': return CMD_NONE
; /* cancel selection */
554 case EOF
: return CMD_NONE
; /* sent by SIGCONT */
556 if (t
< '0' || t
> '9') return CMD_INVAL
;
569 if (*from
== FOUNDATION
) {
570 int top
= find_top(f
.t
[*to
]);
571 if (top
< 0) return CMD_INVAL
;
572 int color
= get_color(f
.t
[*to
][top
]);
573 int choice_1
= 1-color
; /* selects piles of */
574 int choice_2
= 2+color
; /* the opposite color */
575 int top_c1
= find_top(f
.f
[choice_1
]);
576 int top_c2
= find_top(f
.f
[choice_2
]);
578 switch ((rank_next(f
.f
[choice_1
][top_c1
], f
.t
[*to
][top
])
579 && top_c1
>= 0 ) << 0
580 |(rank_next(f
.f
[choice_2
][top_c2
], f
.t
[*to
][top
])
581 && top_c2
>= 0 ) << 1) {
582 case ( 1<<0): *opt
= choice_1
; break; /* choice_1 only */
583 case (1<<1 ): *opt
= choice_2
; break; /* choice_2 only */
584 case (1<<1 | 1<<0): /* both, ask user which to pick from */
585 printf ("take from (1-4): "); fflush (stdout
);
586 *opt
= getchar() - '1';
587 if (*opt
< 0 || *opt
> 3) return CMD_INVAL
;
589 default: return CMD_INVAL
; /* none matched */
591 /* `opt` is the foundation index (0..3) */
594 /* moving to empty tableu? */
595 if (is_tableu(*to
) && f
.t
[*to
][0] == NO_CARD
) {
596 int bottom
= first_movable(f
.t
[*from
]);
597 if (inactive
.opt
>= 0) { /*if from was cursor addressed: */
598 *opt
= get_rank(f
.t
[*from
][bottom
+ inactive
.opt
]);
601 int top
= find_top(f
.t
[*from
]);
602 if (top
< 0) return CMD_INVAL
;
603 if (top
>= 0 && !is_movable(f
.t
[*from
], top
-1)) {
604 *opt
= get_rank(f
.t
[*from
][top
]);
605 } else { /* only ask the user if it's unclear: */
606 printf ("\rup to ([a23456789xjqk] or space/return): ");
609 case ' ': *opt
= get_rank(f
.t
[*from
][top
]); break;
610 case'\n': *opt
= get_rank(f
.t
[*from
][bottom
]); break;
611 case 'a': case 'A': *opt
= RANK_A
; break;
612 case '0': /* fallthrough */
613 case 'x': case 'X': *opt
= RANK_X
; break;
614 case 'j': case 'J': *opt
= RANK_J
; break;
615 case 'q': case 'Q': *opt
= RANK_Q
; break;
616 case 'k': case 'K': *opt
= RANK_K
; break;
617 default: *opt
-= '1';
619 if (*opt
< RANK_A
|| *opt
> RANK_K
) return ERR
;
621 /* `opt` is the rank of the highest card to move */
628 // shuffling and dealing {{{
630 f
= (const struct playfield
){0}; /* clear playfield */
631 card_t deck
[DECK_SIZE
*NUM_DECKS
];
632 int avail
= DECK_SIZE
*NUM_DECKS
;
633 for (int i
= 0; i
< DECK_SIZE
*NUM_DECKS
; i
++) deck
[i
] = (i
%DECK_SIZE
)+1;
635 if (op
.m
!= NORMAL
) for (int i
= 0; i
< DECK_SIZE
*NUM_DECKS
; i
++) {
636 if (op
.m
== MEDIUM
) deck
[i
] = 1+((deck
[i
]-1) | 2);
637 if (op
.m
== EASY
) deck
[i
] = 1+((deck
[i
]-1) | 2 | 1);
638 /* the 1+ -1 dance gets rid of the offset created by NO_CARD */
641 srandom (time(NULL
));
642 long seed
= time(NULL
);
644 for (int i
= DECK_SIZE
*NUM_DECKS
-1; i
> 0; i
--) { /* fisher-yates */
645 int j
= random() % (i
+1);
646 if (j
-i
) deck
[i
]^=deck
[j
],deck
[j
]^=deck
[i
],deck
[i
]^=deck
[j
];
650 for (int i
= 0; i
< NUM_PILES
; i
++) {
652 int closed
= i
; /* pile n has n closed cards, then 1 open */
654 int closed
= i
<4?5:4; /* pile 1-4 have 5, 5-10 have 4 closed */
656 /* face down cards are negated: */
657 for (int j
= 0; j
< closed
; j
++) f
.t
[i
][j
] = -deck
[--avail
];
658 f
.t
[i
][closed
] = deck
[--avail
]; /* the face-up card */
660 /* rest of the cards to the stock; NOTE: assert(avail==50) for spider */
661 for (f
.z
= 0; avail
; f
.z
++) f
.s
[f
.z
] = deck
[--avail
];
663 f
.w
= -1; /* @start: nothing on waste */
665 f
.w
= 0; /* number of used foundations */
668 f
.u
= &undo_sentinel
;
672 // screen drawing routines {{{
673 void print_hi(int invert
, int grey_bg
, int bold
, char* str
) {
674 if (bold
&& op
.s
== &unicode_large_color
){//ARGH! awful hack for bold with faint
675 int offset
= str
[3]==017?16:str
[4]==017?17:0;
676 printf ("%s%s%s""%.*s%s%s""%s%s%s",
677 bold
?"\033[1m":"", invert
?"\033[7m":"", grey_bg
?"\033[100m":"",
678 offset
, str
, bold
?"\033[1m":"", str
+offset
,
679 grey_bg
?"\033[49m":"", invert
?"\033[27m":"",bold
?"\033[22m":"");
682 printf ("%s%s%s%s%s%s%s",
683 bold
?"\033[1m":"", invert
?"\033[7m":"", grey_bg
?"\033[100m":"",
685 grey_bg
?"\033[49m":"", invert
?"\033[27m":"",bold
?"\033[22m":"");
687 void print_table(const struct cursor
* active
, const struct cursor
* inactive
) {
688 printf("\033[2J\033[H"); /* clear screen, reset cursor */
690 /* print stock, waste and foundation: */
691 for (int line
= 0; line
< op
.s
->height
; line
++) {
693 print_hi (active
->pile
== STOCK
, inactive
->pile
== STOCK
, 1, (
694 (f
.w
< f
.z
-1)?op
.s
->facedown
695 :op
.s
->placeholder
)[line
]);
697 print_hi (active
->pile
== WASTE
, inactive
->pile
== WASTE
, 1, (
698 /* NOTE: cast, because f.w sometimes is (short)-1 !? */
699 ((short)f
.w
>= 0)?op
.s
->card
[f
.s
[f
.w
]]
700 :op
.s
->placeholder
)[line
]);
701 printf ("%s", op
.s
->card
[NO_CARD
][line
]); /* spacer */
703 for (int pile
= 0; pile
< NUM_SUITS
; pile
++) {
704 int card
= find_top(f
.f
[pile
]);
705 print_hi (active
->pile
==FOUNDATION
&& active
->opt
==pile
,
706 inactive
->pile
==FOUNDATION
&& (
707 /* cursor addr. || direct addr. */
708 inactive
->opt
==pile
|| inactive
->opt
< 0
710 (card
< 0)?op
.s
->placeholder
[line
]
711 :op
.s
->card
[f
.f
[pile
][card
]][line
]);
717 int fdone
; for (fdone
= NUM_DECKS
*NUM_SUITS
; fdone
; fdone
--)
718 if (f
.f
[fdone
-1][RANK_K
]) break; /*number of completed stacks*/
719 int spacer_from
= f
.z
?(f
.z
/10-1) * op
.s
->halfwidth
[0] + op
.s
->width
:0;
720 int spacer_to
= NUM_PILES
*op
.s
->width
-
721 ((fdone
?(fdone
-1) * op
.s
->halfwidth
[1]:0)+op
.s
->width
);
722 for (int line
= 0; line
< op
.s
->height
; line
++) {
723 /* available stock: */
724 for (int i
= f
.z
/10; i
; i
--) {
725 if (i
==1) printf ("%s", op
.s
->facedown
[line
]);
726 else printf ("%s", op
.s
->halfstack
[line
]);
729 for (int i
= spacer_from
; i
< spacer_to
; i
++) printf (" ");
730 /* foundation (overlapping): */
731 for (int i
= 0; i
< NUM_DECKS
*NUM_SUITS
; i
++) { //TODO: print in revrse order (otherwise new piles get put 'below' older ones)
732 int overlap
= i
? op
.s
->halfcard
[line
]: 0;
733 if (f
.f
[i
][RANK_K
]) printf ("%.*s", op
.s
->halfwidth
[2],
734 op
.s
->card
[f
.f
[i
][RANK_K
]][line
]+overlap
);
741 #define DO_HI(cursor) (cursor->pile == pile && (movable || empty))
742 #define TOP_HI(c) 1 /* can't select partial stacks in KLONDIKE */
745 int offset
[NUM_PILES
]={1,1,1,1,1,1,1,1,1,1}; // :|
746 #define DO_HI(cursor) (cursor->pile == pile && (movable || empty) \
747 && offset[pile] > cursor->opt)
748 #define TOP_HI(cursor) (cursor->pile == pile && movable \
749 && offset[pile]-1 == cursor->opt)
750 #define INC_OFFSET if (movable) offset[pile]++
752 /* print tableu piles: */
753 int row
[NUM_PILES
] = {0};
754 int line
[NUM_PILES
]= {0};
755 int label
[NUM_PILES
]={0};
757 int did_placeholders
= 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;
766 print_hi (DO_HI(active
), DO_HI(inactive
), movable
, (
767 (!card
&& row
[pile
] == 0)?op
.s
->placeholder
768 :(card
<0)?op
.s
->facedown
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
&&
778 f
.t
[pile
][row
[pile
]] < 0 &&
779 f
.t
[pile
][row
[pile
]+1] <0)
780 /* extreme overlap on sequences: */
781 || (extreme_overlap
&&
782 !TOP_HI(active
) && /*always show top selected card*/
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
)
794 if(!card
&& !label
[pile
] && row
[pile
]>0&&line
[pile
]>0) {
796 printf ("\b\b%d ", (pile
+1) % 10); //XXX: hack
798 line_had_card
|= !!card
;
799 did_placeholders
|= row
[pile
] > 0;
802 } while (line_had_card
|| !did_placeholders
);
805 void visbell (void) {
806 printf ("\033[?5h"); fflush (stdout
);
808 printf ("\033[?5l"); fflush (stdout
);
810 void win_anim(void) {
811 printf ("\033[?25l"); /* hide cursor */
813 /* set cursor to random location */
814 int row
= 1+random()%(24-op
.s
->width
);
815 int col
= 1+random()%(80-op
.s
->height
);
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
]);
825 /* exit on keypress */
826 struct pollfd p
= {STDIN_FILENO
, POLLIN
, 0};
827 if (poll (&p
, 1, 80)) goto fin
;
830 printf ("\033[?25h"); /* show cursor */
836 void undo_push (int _f
, int t
, int n
, int o
) {
837 struct undo
* new = malloc(sizeof(struct undo
));
847 void undo_pop (struct undo
* u
) {
848 if (u
== &undo_sentinel
) return;
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
;
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
;
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
;
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
;
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
;
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
;
920 f
.w
--; /* decrement complete-foundation-counter */
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
;
940 void free_undo (struct undo
* u
) {
941 while (u
&& u
!= &undo_sentinel
) {
949 // initialization stuff {{{
950 void screen_setup (int enable
) {
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 */
957 //TODO//printf ("\033[?9l\033[?25h"); /* disable mouse, show cursor */
958 printf ("\033[?47l\033[u"); /* primary screen, restore cursor */
963 void raw_mode(int enable
) {
964 static struct termios saved_term_mode
;
965 struct termios raw_term_mode
;
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
);
976 tcsetattr(STDIN_FILENO
, TCSAFLUSH
, &saved_term_mode
);
980 void signal_handler (int signum
) {
985 print_table(NO_HI
, NO_HI
);
991 void signal_setup(void) {
992 struct sigaction saction
;
994 saction
.sa_handler
= signal_handler
;
995 sigemptyset(&saction
.sa_mask
);
996 saction
.sa_flags
= 0;
997 if (sigaction(SIGCONT
, &saction
, NULL
) < 0) {
1001 if (sigaction(SIGINT
, &saction
, NULL
) < 0) {
1008 //vim: foldmethod=marker