uttt/uttt.c

725 行
17 KiB
C

#include <stddef.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <curses.h>
#include <signal.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <string.h>
#include <errno.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <stdarg.h>
struct ut_state
{
char tiles[9][9];
char boards[3][3];
int playBoard;
char player;
};
const struct ut_state ut_initial = {
.boards = {0},
.tiles = {0},
.playBoard = -1,
.player = 'X',
};
const char HELP_TEXT[] = "\
Usage: uttt (--local | --host | --join)\n\
\n\
--local play non-network game\n\
--host host game at 127.0.0.1:6669\n\
--join join game at 127.0.0.1:6669\n\
";
const char arg_local[] = "--local";
const char arg_host[] = "--host";
const char arg_join[] = "--join";
const char PLAY_BOARDS[][14] = {
"top left", "top middle", "top right",
"middle left", "middle", "middle right",
"bottom left", "bottom middle", "bottom right",
"all boards",
};
char ut_turn(char player)
{
switch(player)
{
case 'X': return 'O';
case 'O': return 'X';
default: return '\0';
}
}
#define T(r, c) (tiles[offset + stride * r + c])
char ut_winner(const char *tiles, int offset, int stride) {
// whoreizontal wins
for (int y = 0; y < 3; y++)
{
char tile = T(y, 0);
if (tile == '\0') {continue;}
if (tile == T(y, 1) && tile == T(y, 2)) {return tile;}
}
// vertical wins
for (int x = 0; x < 3; x++)
{
char tile = T(0, x);
if (tile == '\0') {continue;}
if (tile == T(1, x) && tile == T(2, x)) {return tile;}
}
// diagonalz
char tile = T(1, 1);
if (tile != '\0')
{
if (tile == T(0, 0) && tile == T(2, 2)) {return tile;}
if (tile == T(2, 0) && tile == T(0, 2)) {return tile;}
}
for(int y = 0; y < 3; y++)
{
for(int x = 0; x < 3; x++)
{
if(T(y, x) == '\0') {return '\0';} // in progress
}
}
return ' '; // draw
}
int ut_move(struct ut_state *new_state, const struct ut_state *old_state, int row, int col)
{
// bad move - out of bounds
if(row < 0 || row >= 9 || col < 0 || col >= 9) {return 1;}
// state->playBoard == -1 means all boards playable; otherwise only one board is playable
if (old_state->playBoard != -1 && old_state->playBoard != 3 * (row / 3) + (col / 3)) {return 1;}
// bad move - tile is occupied
if(old_state->tiles[row][col] != '\0') {return 1;}
// bad move - board is finished
if(old_state->boards[row / 3][col / 3] != '\0') {return 1;}
// copy old_state->{tiles,boards} to new_state->{tiles,boards}
memmove(new_state->tiles, old_state->tiles, sizeof(old_state->tiles));
memmove(new_state->boards, old_state->boards, sizeof(old_state->boards));
// do move
new_state->tiles[row][col] = old_state->player;
new_state->boards[row / 3][col / 3] = ut_winner((char *)new_state->tiles, 27 * (row / 3) + 3 * (col / 3), 9);
// next play board - if next play board is not playable, play any board
new_state->playBoard = new_state->boards[row % 3][col % 3] == '\0' ? 3 * (row % 3) + (col % 3) : -1;
new_state->player = ut_turn(old_state->player);
return 0;
}
int curs_line;
void ut_curserase(void)
{
curs_line = 0;
erase();
}
void ut_cursprint(const char *str, int n)
{
mvaddnstr(curs_line, 0, str, n);
int y, x;
getyx(stdscr, y, x);
curs_line = y;
}
int ut_writefill(int fd, const char *x, size_t l)
{
while(l > 0)
{
int r = write(fd, x, l);
if(r < 0)
{
if(errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR) {continue;}
else {return 1;}
}
x += r; l -= r;
}
return 0;
}
#define MAX_LINE 128
int ut_cursprintf(const char *restrict format, ...)
{
char line[MAX_LINE];
va_list ap;
va_start(ap, format);
int n = vsnprintf(line, MAX_LINE, format, ap);
va_end(ap);
if(n < 0 || n > MAX_LINE - 1) {return -1;}
ut_cursprint(line, n);
return n;
}
int ut_dprintf(int fd, const char *restrict format, ...)
{
char line[MAX_LINE];
va_list ap;
va_start(ap, format);
int n = vsnprintf(line, MAX_LINE, format, ap);
va_end(ap);
if(n < 0 || n > MAX_LINE - 1) {return -1;}
if(ut_writefill(fd, line, n)) {return -1;}
return n;
}
void ut_drawBoard(void (*mvch)(void*, int, int, char), void *arg, const char *tiles, int offset, int stride, int iy, int ix, char winner, bool highlight)
{
// 7x7 board display
/*
* X|X|X
* -+-+-
* X|X|X
* -+-+-
* X|X|X
*/
for(int r = 0; r < 3; r++) // tiles
for(int c = 0; c < 3; c++)
mvch(arg, iy + 2 * r + 1, ix + 2 * c + 1, T(r, c) != '\0' ? T(r, c) : ' ');
//char info = winner != '\0' ? winner : highlight ? '*' : ' ';
for(int r = 0; r < 3; r++) // |
for(int c = 0; c < 2; c++)
mvch(arg, iy + 2 * r + 1, ix + 2 * c + 1 + 1, '|');
for(int r = 0; r < 2; r++) // -
for(int c = 0; c < 3; c++)
mvch(arg, iy + 2 * r + 1 + 1, ix + 2 * c + 1, '-');
for(int r = 0; r < 2; r++) // +
for(int c = 0; c < 2; c++)
mvch(arg, iy + 2 * r + 1 + 1, ix + 2 * c + 1 + 1, highlight ? '*' : '+');
for(int r = 0; r < 7; r++) // | boundary
for(int c = 0; c < 2; c++)
mvch(arg, iy + r, ix + 6 * c, winner != '\0' ? winner : ' ');
for(int r = 0; r < 2; r++) // - boundary
for(int c = 0; c < 7; c++)
mvch(arg, iy + 6 * r, ix + c, winner != '\0' ? winner : ' ');
}
#define DTILES_Y 21
#define DTILES_X 21
void ut_drawTiles(void (*mvch)(void*, int, int, char), void *arg, const struct ut_state *state, bool numbers, int lr, int lc)
{
for(int r = 0; r < 3; r++)
for(int c = 0; c < 3; c++)
ut_drawBoard(mvch, arg, (char *)state->tiles,
27 * r + 3 * c, 9,
7 * r, 7 * c,
state->boards[r][c],
state->boards[r][c] == '\0' && (state->playBoard == -1 || state->playBoard == 3 * r + c));
if(numbers)
{
for(int b = 0; b < 3; b++)
for(int c = 0; c < 3; c++)
mvch(arg, 0, 7 * b + 2 * c + 1, '0' + 3 * b + c);
for(int b = 0; b < 3; b++)
for(int r = 0; r < 3; r++)
mvch(arg, 7 * b + 2 * r + 1, 0, '0' + 3 * b + r);
}
if(lr >= 0 && lr < 9 && lc >= 0 && lc < 9)
mvch(arg, 7 * (lr / 3) + 2 * (lr % 3) + 1,
7 * (lc / 3) + 2 * (lc % 3) + 1,
state->tiles[lr][lc] == 'X' ? '%' : '0');
}
#define DBOARDS_Y 7
#define DBOARDS_X 7
void ut_drawBoards(void (*mvch)(void*, int, int, char), void *arg, const struct ut_state *state)
{
ut_drawBoard(mvch, arg, (char *)state->boards,
0, 3,
0, 0,
'\0', false);
}
void ut_cursmvchc(void *arg, int y, int x, char c)
{
bool colorized;
if(colorized = has_colors())
{
color_set((c == 'X' || c == '%') ? 1 :
(c == 'O' || c == '0') ? 2 : 0, NULL);
}
bool bold;
if(c == '%' || c == '0')
{
bold = true;
attr_on(A_BOLD, NULL);
}
mvaddch(curs_line + y, x, c);
if(bold) {attr_off(A_BOLD, NULL);}
if(colorized) {color_set(0, NULL);}
}
void ut_tmvch(void *arg, int y, int x, char c)
{
((char (*)[DTILES_X])arg)[y][x] = c;
}
void ut_bmvch(void *arg, int y, int x, char c)
{
((char (*)[DBOARDS_X])arg)[y][x] = c;
}
int dtiles_line;
void ut_cursdraw(const struct ut_state *state)
{
ut_cursprintf("Turn: %c Play board: %s\n", (int)state->player, PLAY_BOARDS[(state->playBoard + 10) % 10]);
dtiles_line = curs_line;
ut_drawTiles(ut_cursmvchc, NULL, state, false, -1, -1); // TODO some kind of move history to know the last move
curs_line += DTILES_Y;
//ut_drawBoards(ut_cursmvchc, NULL, state);
}
void ut_sockdraw(const struct ut_state *state, int fd)
{
ut_dprintf(fd, "Turn: %c\nPlay board: %s\n", (int)state->player, PLAY_BOARDS[(state->playBoard + 10) % 10]);
char dtiles[DTILES_Y][DTILES_X];
ut_drawTiles(ut_tmvch, dtiles, state, true, -1, -1);
for(int r = 0; r < DTILES_Y; r++)
{
ut_dprintf(fd, "%.*s\n", DTILES_X, dtiles[r]);
}
}
/*void ut_show_boards(const struct ut_state *state) {
for (int j = 0; j < 3; j++) {
for (int i = 0; i < 3; i++) {
putchar(state->boards[j][i] ? state->boards[j][i] : ' ');
}
putchar('\n');
}
}*/
int ut_readfill(int fd, char *x, size_t l)
{
while(l > 0)
{
int r = read(fd, x, l);
if(r < 0)
{
//printf("ut_readfill read:%d errno=%d\n", r, errno);
if(errno == EAGAIN || errno == EWOULDBLOCK || errno == EINTR) {continue;}
else {return 1;}
}
else if(r == 0) {return 2;}
x += r; l -= r;
}
return 0;
}
int ut_cursgetpos(const struct ut_state *state, int *r, int *c)
{
#define P(r, c, d) ((state->playBoard == -1 || state->playBoard == 3 * (r / 3) + (c / 3)) && \
(state->boards[r / 3][c / 3] == '\0' || d % 3 == 1))
MEVENT event;
ut_cursprintf("Select move with arrow keys or mouse.\n");
if(*r < 0 || *r >= 9 || *c < 0 || *c >= 9)
{
*r = 4; *c = 4;
}
else if(state->playBoard == -1)
{
*r = 3 * (*r / 3) + 1;
*c = 3 * (*c / 3) + 1;
}
else
{
*r = 3 * (state->playBoard / 3) + 1;
*c = 3 * (state->playBoard % 3) + 1;
}
for(;;)
{
/*if(state->boards[*r / 3][*c / 3] != '\0')
{
*r = 3 * (*r / 3) + 1;
*c = 3 * (*c / 3) + 1;
}*/
move(dtiles_line + (7 * (*r / 3) + 1) + (2 * (*r % 3)),
(7 * (*c / 3) + 1) + (2 * (*c % 3)));
refresh();
switch(getch())
{
case KEY_MOUSE:
if(getmouse(&event) == OK && (event.bstate & BUTTON1_CLICKED))
{
event.y -= dtiles_line;
if(event.y < 0 || event.y >= 21) {break;}
if(event.x < 0 || event.x >= 21) {break;}
*r = (event.y % 7 - 1) / 2 + 3 * (event.y / 7);
*c = (event.x % 7 - 1) / 2 + 3 * (event.x / 7);
if(((event.y % 7) - 1) % 2 != 0) {break;}
if(((event.x % 7) - 1) % 2 != 0) {break;}
return 0;
}
break;
case 'k': /* FALLTHROUGH */
case 'w': /* FALLTHROUGH */
case KEY_UP:
//*r = (((*r - 1) % 9) + 9) % 9;
for(int i = 0; i < 9 + 1; i++)
{
*r = (*r + 9 - 1) % 9;
if(P(*r, *c, *r)) {break;}
}
break;
case 'h': /* FALLTHROUGH */
case 'a': /* FALLTHROUGH */
case KEY_LEFT:
//*c = (((*c - 1) % 9) + 9) % 9;
for(int i = 0; i < 9 + 1; i++)
{
*c = (*c + 9 - 1) % 9;
if(P(*r, *c, *c)) {break;}
}
break;
case 'j': /* FALLTHROUGH */
case 's': /* FALLTHROUGH */
case KEY_DOWN:
//*r = (*r + 1) % 9;
for(int i = 0; i < 9 + 1; i++)
{
*r = (*r + 1) % 9;
if(P(*r, *c, *r)) {break;}
}
break;
case 'l': /* FALLTHROUGH */
case 'd': /* FALLTHROUGH */
case KEY_RIGHT:
//*c = (*c + 1) % 9;
for(int i = 0; i < 9 + 1; i++)
{
*c = (*c + 1) % 9;
if(P(*r, *c, *c)) {break;}
}
break;
case ' ': /* FALLTHROUGH */
case '\r': /* FALLTHROUGH */
case KEY_ENTER:
return 0;
case ERR: /* FALLTHROUGH */
default:
break;
}
}
#undef P
}
/*bool getpos(const struct ut_state *state, int *x, int *y) {
while (true) {
printf("Place token %c at position x,y: ", state->player);
char line[5] = {0};
if (fgets(line, 5, stdin) == NULL)
return false;
// line was too short
if (line[3] == '\0')
continue;
// line was too long
if (line[3] != '\n') {
// consume rest of line
while (true) {
int garbage = getchar();
if (garbage == EOF)
return false;
if (garbage == '\n')
break;
}
continue;
}
int sscanf_result = sscanf(line, "%d,%d", x, y);
if (sscanf_result == EOF)
return false;
if (sscanf_result != 2)
continue;
break;
}
return true;
}*/
int ut_ignore_line(int sock) {
char byte;
for (int i = 0; i < 128; i++) {
if (ut_readfill(sock, &byte, 1)) {
return 1;
}
if (byte == '\n') {return 0;}
}
return 2;
}
int ut_sockgetpos(const struct ut_state *state, int sock, int *y, int *x, bool readable) { // TODO
int index = 0;
char byte;
while (true) {
if (ut_readfill(sock, &byte, 1)) {return 1;}
// allow \r\n
if (index == 3 && byte == '\r') {
if (ut_readfill(sock, &byte, 1)) {return 1;}
}
if (index == 0 && byte == '|') {
if (ut_ignore_line(sock)) {return -1;}
} else if (index == 0) {
*x = byte - 0x30;
} else if (index == 2) {
*y = byte - 0x30;
} else if (index == 1 && byte != ',' || index == 3 && byte != '\n') {
ut_cursprintf("Partner sent malformed coords - retrying\n");
if (ut_ignore_line(sock)) {return 2;}
if (readable) {
ut_dprintf(sock, "Invalid coordinates. Try again: ");
}
index = 0;
continue;
}
index++;
if (index == 4) {break;}
}
//printf("x=%d y=%d\n", *x, *y);
return 0;
}
int ut_local_game(struct ut_state *state) {
for(;;)
{
int r = 4, c = 4;
ut_curserase();
ut_cursdraw(state);
char w = ut_winner((char *)state->boards, 0, 3);
if(w)
{
if(w == ' ')
{
ut_cursprintf("Draw!\n");
}
else
{
ut_cursprintf("%c wins!\n", (int)w);
}
break;
}
if(ut_cursgetpos(state, &r, &c)) {continue;}
if(ut_move(state, state, r, c)) {continue;}
}
return 0;
}
int ut_network_game(struct ut_state *state, int sock, char player, bool readable) { // TODO
while (true) {
int r = 4, c = 4;
ut_curserase();
ut_cursdraw(state);
if (readable) ut_sockdraw(state, sock);
char w = ut_winner((char *)state->boards, 0, 3);
if(w)
{
if(w == ' ')
{
ut_cursprintf("Draw!\n");
if (readable) {ut_dprintf(sock, "\nDraw!\n");}
close(sock);
}
else
{
ut_cursprintf("%c wins!\n", (int)w);
if (readable) {ut_dprintf(sock, "\n%c wins!\n", (int)w);}
close(sock);
}
break;
}
if (state->player == player) {
if (readable) {ut_dprintf(sock, "Waiting for game partner ...\n");}
if(ut_cursgetpos(state, &r, &c)) {continue;}
ut_dprintf(sock, "%d,%d\n", c, r);
} else {
ut_cursprintf("Waiting for game partner ...\n");
refresh();
if (readable) {
// line feed aligns game board each turn
ut_dprintf(sock, "\nPlace token %c in position x,y: ", ut_turn(player));
}
int err = ut_sockgetpos(state, sock, &r, &c, readable);
ut_cursprintf("received row=%d col=%d\n", r, c);
if (err == 1) {
ut_cursprintf("Connection closed.\n");
return 1;
}
else if (err == 2) {
ut_cursprintf("Partner sent too much data - exiting\n");
return 1;
}
}
if (ut_move(state, state, r, c)) {continue;}
if (readable) {ut_dprintf(sock, "\n");}
}
return 0;
}
char ut_random_player(void) {
char player;
int random = open("/dev/urandom", O_RDONLY);
if (read(random, &player, 1) < 0) {return -1;}
player = (player % 2 == 0) ? 'X' : 'O';
return player;
}
int ut_host_game(struct ut_state *state) {
int sock = socket(AF_INET, SOCK_STREAM, 0);
if (sock == -1) {
printf("error %d\n", errno);
return 1;
}
const struct sockaddr_in addr = {
.sin_family = AF_INET,
.sin_port = htons(6669),
.sin_addr = { .s_addr = htonl(0x7f000001) },
};
setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, &(int){1}, sizeof(int));
if (bind(sock, (struct sockaddr*)&addr, sizeof(addr)) == -1) {
printf("error %d\n", errno);
return 1;
}
if (listen(sock, 128) == -1) {
printf("error %d\n", errno);
return 1;
}
ut_cursprintf("Waiting for game partner at 127.0.0.1:6669 ...\n");
int conn = accept(sock, NULL, NULL);
if (conn == -1) {
printf("error %d\n", errno);
return 1;
}
// decide X or O
char player;
if ((player = ut_random_player()) < 0) {return 1;}
// check to determine readable
char byte;
ut_dprintf(conn, "| Press enter to start.\n");
if (ut_readfill(conn, &byte, 1)) {
printf("Connection closed.\n");
return 1;
}
bool readable = byte != '\0';
if (byte != '\n') {
int err = ut_ignore_line(conn);
if (err == 1) {
printf("Connection closed.\n");
return 1;
} else if (err == 2) {
printf("Partner sent too much data - exiting\n");
return 1;
}
}
// tell partner X or O
ut_dprintf(conn, "%c\n", ut_turn(player));
if (readable) {
ut_dprintf(conn, "You play as: %c\n\n", ut_turn(player));
}
return ut_network_game(state, conn, player, readable);
}
int ut_join_game(struct ut_state *state) {
int sock = socket(AF_INET, SOCK_STREAM, 0);
if (sock == -1) {
printf("error %d\n", errno);
return 1;
}
const struct sockaddr_in addr = {
.sin_family = AF_INET,
.sin_port = htons(6669),
.sin_addr = { .s_addr = htonl(0x7f000001) },
};
ut_cursprintf("Connecting to game host at 127.0.0.1:6669 ...\n");
if(connect(sock, (struct sockaddr*)&addr, sizeof(addr)) == -1)
{
printf("error %d\n", errno);
return 1;
}
// tell host to deactivate readable
ut_writefill(sock, "\0\n", 2);
// host decides X or O
char player_buf[2];
char *player = player_buf;
for (int i = 0; i < 10; i++) {
int r = ut_readfill(sock, player_buf, 1);
ut_ignore_line(sock);
if (*player == '|') {
continue;
}
if (r == 2) {printf("Connection closed.\n");}
if (r != 0) {return 1;}
break;
}
if (*player != 'X' && *player != 'O') {
printf("Host is retarded.\n");
return 1;
}
return ut_network_game(state, sock, *player, false);
}
void finish(int sig)
{
// putchar('\n');
endwin();
// other cleanup
exit(0);
}
void waitfinish(int sig)
{
ut_cursprintf("\nPress any key to exit.");
refresh();
mousemask(0, NULL);
getch();
finish(sig);
}
void begin(void)
{
signal(SIGINT, finish);
initscr();
keypad(stdscr, TRUE);
nonl(); // \r instead of \r\n
cbreak();
noecho();
mousemask(BUTTON1_CLICKED, NULL);
if (has_colors())
{
start_color();
init_pair(1, COLOR_RED, COLOR_BLACK);
init_pair(2, COLOR_BLUE, COLOR_BLACK);
}
}
int main(int argc, char **argv) {
struct ut_state state = ut_initial;
if (argc != 2) {
printf(HELP_TEXT);
return 1;
} else if (strncmp(argv[1], arg_local, sizeof(arg_local)) == 0) {
begin();
waitfinish(ut_local_game(&state));
} else if (strncmp(argv[1], arg_host, sizeof(arg_host)) == 0) {
begin();
waitfinish(ut_host_game(&state));
} else if (strncmp(argv[1], arg_join, sizeof(arg_join)) == 0) {
begin();
waitfinish(ut_join_game(&state));
} else {
printf(HELP_TEXT);
return 1;
}
return 0;
}