]>
git.gir.st - VIper.git/blob - viiper.c
1 /*******************************************************************************
3 By Tobias Girstmair, 2018
6 (see ./viiper -h for full list of options)
8 KEYBINDINGS: - hjkl to move
9 - p to pause and resume
12 - (see `./minesviiper -h' for all keybindings)
14 GNU GPL v3, see LICENSE or https://www.gnu.org/licenses/gpl-3.0.txt
15 *******************************************************************************/
18 #define _POSIX_C_SOURCE 2 /*for getopt and sigaction in c99, sigsetjmp*/
23 #include <sys/ioctl.h>
32 #define MIN(a,b) (a>b?b:a)
33 #define MAX(a,b) (a>b?a:b)
34 #define CLAMP(a,m,M) (a<m?m:(a>M?M:a))
35 #define printm(n, s) for (int _loop = 0; _loop < n; _loop++) fputs (s, stdout)
36 #define print(str) fputs (str?str:"", stdout)
39 #define OPPOSITE(dir) ( \
40 dir == EAST ? WEST : \
41 dir == WEST ? EAST : \
42 dir == NORTH ? SOUTH : \
43 dir == SOUTH ? NORTH : -1)
48 #define CW op.scheme->cell_width
51 int w
; /* field width */
52 int h
; /* field height */
53 int d
; /* direction the snake is looking */
54 int t
; /* time of game start */
56 float v
; /* velocity in moves per second */
57 struct snake
* s
; /* snek */
58 struct item
* i
; /* items (food, boni) */
60 int h
; /* write head */
61 int n
; /* number of elements */
63 } k
; /* ring buffer for direction events */
67 int l
; /* initial snake length */
68 int s
; /* initial snake speed */
69 struct scheme
* scheme
;
74 int main (int argc
, char** argv
) {
76 g
.w
= 30; //two-char-width
83 opterr
= 0; /* don't print message on unrecognized option */
84 while ((optget
= getopt (argc
, argv
, "+s:dh")) != -1) {
89 fprintf (stderr
, "speed must be >= 1\n");
93 case 'd': op
.scheme
= &vt220_charset
; break;
96 fprintf (stderr
, SHORTHELP LONGHELP
, argv
[0]);
97 return !(optget
=='h');
99 } if (optind
< argc
) { /* parse Fieldspec */
100 int n
= sscanf (argv
[optind
], "%dx%d", &g
.w
, &g
.h
);
103 fprintf(stderr
,"FIELDSIZE is WxH (width 'x' height)\n");
115 if (sigsetjmp(game_over
, 1)) {
118 move_ph (g
.h
/2+LINE_OFFSET
, g
.w
);
119 printf ("snek ded :(");
125 //TODO: call viiper() in a game loop
140 spawn_item(FOOD
, rand() % NUM_FOODS
, NULL
); //TODO: shape distribution, so bigger values get selected less
143 switch (getctrlseq()) {
144 case CTRSEQ_CURSOR_LEFT
: case 'h':append_movement(WEST
); break;
145 case CTRSEQ_CURSOR_DOWN
: case 'j':append_movement(SOUTH
); break;
146 case CTRSEQ_CURSOR_UP
: case 'k':append_movement(NORTH
); break;
147 case CTRSEQ_CURSOR_RIGHT
:case 'l':append_movement(EAST
); break;
150 move_ph (g
.h
/2+LINE_OFFSET
, g
.w
*CW
/2);
151 printf ("\033[5mPAUSE\033[0m"); /* blinking text */
152 if (getchar() == 'q') exit(0);
156 case 'r': /*TODO:restart*/ return 0;
162 case 0x02: /* STX; gets sent when returning from SIGALRM */
169 #define pop_dir() (g.k.n? g.k.c[(16+g.k.h-g.k.n--)%16] : NONE)
170 void snake_advance (void) {
171 int new_dir
= pop_dir();
172 /* switch direction if new one is in the buffer and it won't kill us: */
173 if (new_dir
&& g
.d
!= OPPOSITE(new_dir
)) g
.d
= new_dir
;
175 int new_row
= g
.s
->r
+(g
.d
==SOUTH
) -(g
.d
==NORTH
);
176 int new_col
= g
.s
->c
+(g
.d
==EAST
) -(g
.d
==WEST
);
178 /* detect food hit and spawn a new food */
179 for (struct item
* i
= g
.i
; i
; i
= i
->next
) {
180 if (i
->r
== new_row
&& i
->c
== new_col
) {
182 spawn_item(FOOD
, rand() % NUM_FOODS
, i
);
186 if (new_row
>= g
.h
|| new_col
>= g
.w
|| new_row
< 0 || new_col
< 0)
187 siglongjmp(game_over
, 1/*<-will be the retval of setjmp*/);
189 struct snake
* new_head
;
190 struct snake
* new_tail
; /* former second-to-last element */
191 for (new_tail
= g
.s
; new_tail
->next
->next
; new_tail
= new_tail
->next
)
192 /*use the opportunity of looping to check if we eat ourselves:*/
193 if(new_tail
->next
->r
== new_row
&& new_tail
->next
->c
== new_col
)
194 siglongjmp(game_over
, 1);
195 int old_tail
[2] = {new_tail
->next
->r
, new_tail
->next
->c
};/*gets erased*/
196 new_head
= new_tail
->next
; /* reuse element instead of malloc() */
197 new_tail
->next
= NULL
;
199 new_head
->r
= new_row
;
200 new_head
->c
= new_col
;
201 new_head
->next
= g
.s
;
205 draw_sprites (old_tail
[0], old_tail
[1]);
208 void spawn_item (int type
, int value
, struct item
* p_item
) {
213 /* loop through snake to check if we aren't on it */
214 //WARN: inefficient as snake gets longer; near impossible in the end
215 for (struct snake
* s
= g
.s
; s
; s
= s
->next
)
216 if (s
->r
== row
&& s
->c
== col
) goto try_again
; //TODO: appears to not work all the time
218 /* if we got a item buffer reuse it, otherwise create a new one: */
219 struct item
* new_item
;
220 if (p_item
) new_item
= p_item
;
221 else new_item
= malloc (sizeof(struct item
));
227 new_item
->s
= time(0);
228 if (g
.i
) g
.i
->prev
= new_item
;
229 new_item
->next
= g
.i
;
230 new_item
->prev
= NULL
;
235 void consume_item (struct item
* i
) {
239 case FOOD_5
: g
.p
+= 5; break;
240 case FOOD_10
: g
.p
+= 10; break;
241 case FOOD_20
: g
.p
+= 20; break;
243 snake_append(&g
.s
, 0,0); /* position doesn't matter, as item */
244 break; /* will be reused as the head before it is drawn */
250 if (i
->next
) i
->next
->prev
= i
->prev
;
251 if (i
->prev
) i
->prev
->next
= i
->next
;
255 void show_playfield (void) {
260 printm (g
.w
, BORDER(T
,C
));
261 printf ("%s\n", BORDER(T
,R
));
264 for (int row
= 0; row
< g
.h
; row
++)
265 printf ("%s%*s%s\n", BORDER(C
,L
), CW
*g
.w
, "", BORDER(C
,R
));
269 printm (g
.w
, BORDER(B
,C
));
275 void draw_sprites (int erase_r
, int erase_c
) {
277 move_ph (erase_r
+LINE_OFFSET
, erase_c
*CW
+COL_OFFSET
);
281 struct snake
* last
= NULL
;
283 for (struct snake
* s
= g
.s
; s
; s
= s
->next
) {
284 move_ph (s
->r
+LINE_OFFSET
, s
->c
*CW
+COL_OFFSET
); /*NOTE: all those are actually wrong; draws snake 1 col too far left*/
286 int predecessor
= (last
==NULL
)?NONE
:
287 (last
->r
< s
->r
) ? NORTH
:
288 (last
->r
> s
->r
) ? SOUTH
:
289 (last
->c
> s
->c
) ? EAST
:
290 (last
->c
< s
->c
) ? WEST
:NONE
;
291 int successor
= (s
->next
== NULL
)?NONE
:
292 (s
->next
->r
< s
->r
) ? NORTH
:
293 (s
->next
->r
> s
->r
) ? SOUTH
:
294 (s
->next
->c
> s
->c
) ? EAST
:
295 (s
->next
->c
< s
->c
) ? WEST
:NONE
;
297 printf ("\033[%sm", op
.scheme
->color
[color
]);
298 print (op
.scheme
->snake
[predecessor
][successor
]);
304 /* print item queue */
305 for (struct item
* i
= g
.i
; i
; i
= i
->next
) {
306 move_ph (i
->r
+LINE_OFFSET
, i
->c
*CW
+COL_OFFSET
);
307 if (i
->t
== FOOD
) print (op
.scheme
->item
[i
->v
]);
308 else if (i
->t
==BONUS
) /* TODO: print bonus */;
312 int score_width
= g
.p
> 9999?6:4;
313 move_ph (0, (g
.w
*CW
-score_width
)/2-COL_OFFSET
);
314 printf ("%s %0*d %s", BORDER(S
,L
), score_width
, g
.p
, BORDER(S
,R
));
317 void snake_append (struct snake
** s
, int row
, int col
) {
318 struct snake
* new = malloc (sizeof(struct snake
));
324 struct snake
* p
= *s
;
325 while (p
->next
) p
= p
->next
;
333 for (int i
= 0; i
< op
.l
; i
++) {
334 if (g
.w
/2-i
< 0) /* go upwards if we hit left wall */
335 snake_append(&g
.s
, g
.h
/2-(i
-g
.w
/2), 0);
336 else /* normally just keep goint left */
337 snake_append(&g
.s
, g
.h
/2, g
.w
/2-i
);
341 #define free_ll(head) do{ \
361 int getctrlseq (void) {
364 while ((c
= getchar()) != EOF
) {
368 case '\033': state
=ESC_SENT
; break;
374 case '[': state
=CSI_SENT
; break;
375 default: return CTRSEQ_INVALID
;
380 case 'A': return CTRSEQ_CURSOR_UP
;
381 case 'B': return CTRSEQ_CURSOR_DOWN
;
382 case 'C': return CTRSEQ_CURSOR_RIGHT
;
383 case 'D': return CTRSEQ_CURSOR_LEFT
;
384 default: return CTRSEQ_INVALID
;
388 return CTRSEQ_INVALID
;
394 void append_movement (int dir
) {
395 if (g
.k
.n
> 15) return; /* no space in buffer */
396 if (g
.k
.n
&& g
.k
.c
[(16+g
.k
.h
-1)%16] == dir
)
397 return; /* don't add the same direction twice */
401 g
.k
.h
= ++g
.k
.h
% 16;
404 void move_ph (int line
, int col
) {
405 /* move printhead to zero-indexed position */
406 printf ("\033[%d;%dH", line
+1, col
+1);
409 void clamp_fieldsize (void) {
410 /* clamp field size to terminal size and mouse maximum: */
412 ioctl(STDOUT_FILENO
, TIOCGWINSZ
, &w
);
414 if (g
.w
< 10) g
.w
= 10;
415 if (g
.h
< 10) g
.h
= 10;
417 if (COL_OFFSET
+ g
.w
*CW
+ COL_OFFSET
> w
.ws_col
)
418 g
.w
= (w
.ws_col
- (COL_OFFSET
+COL_OFFSET
))/CW
; //TODO: does not work in `-d' (in xterm)
419 if (LINE_OFFSET
+ g
.h
+ LINES_AFTER
> w
.ws_row
)
420 g
.h
= w
.ws_row
- (LINE_OFFSET
+LINES_AFTER
);
423 void timer_setup (int enable
) {
424 static struct itimerval tbuf
;
425 tbuf
.it_interval
.tv_sec
= 0;//TODO: make it speed up automatically
426 tbuf
.it_interval
.tv_usec
= (1000000/g
.v
)-1; /*WARN: 1 <= g.v <= 999999*/
429 tbuf
.it_value
.tv_sec
= tbuf
.it_interval
.tv_sec
;
430 tbuf
.it_value
.tv_usec
= tbuf
.it_interval
.tv_usec
;
432 tbuf
.it_value
.tv_sec
= 0;
433 tbuf
.it_value
.tv_usec
= 0;
436 if ( setitimer(ITIMER_REAL
, &tbuf
, NULL
) == -1 ) {
443 void signal_setup (void) {
444 struct sigaction saction
;
446 saction
.sa_handler
= signal_handler
;
447 sigemptyset(&saction
.sa_mask
);
448 saction
.sa_flags
= 0;
449 if (sigaction(SIGALRM
, &saction
, NULL
) < 0 ) {
454 if (sigaction(SIGINT
, &saction
, NULL
) < 0 ) {
459 if (sigaction(SIGCONT
, &saction
, NULL
) < 0 ) {
465 void signal_handler (int signum
) {
473 siglongjmp(game_over
, 1);/*TODO:returning from ^Z breaks input*/
477 void screen_setup (int enable
) {
480 printf ("\033[s\033[?47h"); /* save cursor, alternate screen */
481 printf ("\033[H\033[J"); /* reset cursor, clear screen */
482 printf ("\033[?25l"); /* hide cursor */
483 print (op
.scheme
->init_seq
); /* swich charset, if necessary */
485 print (op
.scheme
->reset_seq
); /* reset charset, if necessary */
486 printf ("\033[?25h"); /* show cursor */
487 printf ("\033[?47l\033[u"); /* primary screen, restore cursor */
492 /* http://users.csc.calpoly.edu/~phatalsk/357/lectures/code/sigalrm.c */
493 void raw_mode(int enable
) {
494 static struct termios saved_term_mode
;
495 struct termios raw_term_mode
;
498 tcgetattr(STDIN_FILENO
, &saved_term_mode
);
499 raw_term_mode
= saved_term_mode
;
500 raw_term_mode
.c_lflag
&= ~(ICANON
| ECHO
);
501 raw_term_mode
.c_cc
[VMIN
] = 1 ;
502 raw_term_mode
.c_cc
[VTIME
] = 0;
503 tcsetattr(STDIN_FILENO
, TCSAFLUSH
, &raw_term_mode
);
505 tcsetattr(STDIN_FILENO
, TCSAFLUSH
, &saved_term_mode
);