aboutsummaryrefslogtreecommitdiff
path: root/main.c
blob: d1c51384dc7d4360d4dbe0d4bebf480c9522e49a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <time.h>
#include <sys/select.h>
#include <sys/time.h>
#include <unistd.h>
#include <assert.h>
#include "termio.h"

#define WID 10
#define HEI 22


int delay_msec=700;


const int stones[7]={
	0b0000000001110001,
	0b0000000001110100,
	0b0000000000110011,
	0b0000000000110110,
	0b0000000001110010,
	0b0000000001100011,
	0b0000000000001111,
};

static int rotateR(int bl){
	int dest=0;
	for(int y=0;y<4;y++){
		for(int x=0;x<4;x++){
			dest|=(!!(bl&(1<<(4*y+x))))<<(4*x+3-y);
		}
	}
	return dest;
}

static int rotateL(int bl){
	return rotateR(rotateR(rotateR(bl)));
}


struct board {
	int lines[HEI];
	int stone,stx,sty;
};

static void persist(struct board *bd){
	// fprintf(stderr,"persist: stone=%d\n",bd->stone);
	// usleep(1000000);
	for(int y=0;y<4;y++){
		for(int x=0;x<4;x++){
			bd->lines[bd->sty+y]|=(!!(bd->stone&(1<<(4*y+x))))<<(bd->stx+x);
		}
	}
}

static void spawn(struct board *bd){
	int idx=rand()%7;
	// fprintf(stderr,"%d\n",idx);
	// usleep(1000000);
	bd->stone=stones[idx];
	bd->stx=WID/2-1;
	bd->sty=0;
}

static void show(const struct board *bd){
	struct board bd2;
	memcpy(&bd2,bd,sizeof bd2);
	persist(&bd2);
	printf("\x1B[H\x1B[2J");
	for(int y=0;y<HEI;y++){
		putchar('|');
		for(int x=0;x<WID;x++){
			if(bd2.lines[y]&(1<<x))printf("█");
			else putchar(' ');
		}
		putchar('|');
		putchar('\n');
	}
	putchar('+');
	for(int x=0;x<WID;x++){
		putchar('-');
	}
	putchar('+');
	putchar('\n');
	fflush(stdout);
}

static bool boardvalid(const struct board *bd){
	for(int y=0;y<4;y++){
		for(int x=0;x<4;x++){
			if((bd->stone&(1<<(4*y+x)))){
				if(bd->sty+y>=HEI)return false;
				if(bd->stx+x<0||bd->stx+x>=WID)return false;
			}
			if(bd->lines[bd->sty+y]&((!!(bd->stone&(1<<(4*y+x))))<<(bd->stx+x)))return false;
		}
	}
	return true;
}

static void advance(struct board *bd){
	fprintf(stderr,"advance: stone=%d\n",bd->stone);
	if(bd->stone==0){
		spawn(bd);
		return;
	}
	bd->sty++;
	if(!boardvalid(bd)){
		bd->sty--;
		persist(bd);
		spawn(bd);
		return;
	}
}

static void move(struct board *bd,int dir){
	bd->stx+=dir;
	if(!boardvalid(bd)){
		bd->stx-=dir;
		return;
	}
}

static void rotR(struct board *bd){
	int st=bd->stone;
	bd->stone=rotateR(bd->stone);
	if(!boardvalid(bd))bd->stone=st;
}


int main(void){
	srand(time(NULL));

	initkeyboard(false);
	atexit(endkeyboard);

	struct board bd;
	memset(&bd,0,sizeof bd);
	show(&bd);

	struct timeval timeleft;
	timeleft.tv_sec=0;
	timeleft.tv_usec=0;

	while(true){
		show(&bd);

		struct timeval start;
		gettimeofday(&start,NULL);

		fd_set inset;
		FD_ZERO(&inset);
		FD_SET(0,&inset);
		struct timeval timeout;
		memcpy(&timeout,&timeleft,sizeof timeout);

		int ret=select(1,&inset,NULL,NULL,&timeout);
		assert(ret>=0);

		struct timeval end;
		gettimeofday(&end,NULL);

		if(ret==0){
			advance(&bd);
			timeleft.tv_sec=delay_msec/1000;
			timeleft.tv_usec=delay_msec%1000*1000;
			continue;
		}
		end.tv_sec-=start.tv_sec;
		end.tv_usec-=start.tv_usec;
		if(end.tv_usec<0){
			end.tv_sec--;
			end.tv_usec+=1000000;
		}

		timeleft.tv_sec-=end.tv_sec;
		timeleft.tv_usec-=end.tv_usec;
		if(timeleft.tv_usec<0){
			timeleft.tv_sec--;
			if(timeleft.tv_sec<0){
				timeleft.tv_sec=timeleft.tv_usec=0;
			} else {
				timeleft.tv_usec+=1000000;
			}
		}

		assert(FD_ISSET(0,&inset));

		int key=tgetkey();
		if(key=='Q'||key=='q')break;
		else if(key=='S'||key=='s'||key==KEY_DOWN){
			advance(&bd);
			timeleft.tv_sec=delay_msec/1000;
			timeleft.tv_usec=delay_msec%1000*1000;
		} else if(key=='A'||key=='a'||key==KEY_LEFT)move(&bd,-1);
		else if(key=='D'||key=='d'||key==KEY_RIGHT)move(&bd,1);
		else if(key=='W'||key=='w'||key==KEY_UP)rotR(&bd);
		else bel();
	}
}