ncursesw-morphos/test/worm.c

619 lines
14 KiB
C
Raw Normal View History

2006-12-18 12:32:42 +08:00
/****************************************************************************
* Copyright (c) 1998-2007,2008 Free Software Foundation, Inc. *
2006-12-18 12:32:42 +08:00
* *
* Permission is hereby granted, free of charge, to any person obtaining a *
* copy of this software and associated documentation files (the *
* "Software"), to deal in the Software without restriction, including *
* without limitation the rights to use, copy, modify, merge, publish, *
* distribute, distribute with modifications, sublicense, and/or sell *
* copies of the Software, and to permit persons to whom the Software is *
* furnished to do so, subject to the following conditions: *
* *
* The above copyright notice and this permission notice shall be included *
* in all copies or substantial portions of the Software. *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
* IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
* THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
* *
* Except as contained in this notice, the name(s) of the above copyright *
* holders shall not be used in advertising or otherwise to promote the *
* sale, use or other dealings in this Software without prior written *
* authorization. *
****************************************************************************/
1997-05-15 12:00:00 +08:00
/*
@@@ @@@ @@@@@@@@@@ @@@@@@@@@@@ @@@@@@@@@@@@
@@@ @@@ @@@@@@@@@@@@ @@@@@@@@@@@@ @@@@@@@@@@@@@
@@@ @@@ @@@@ @@@@ @@@@ @@@@ @@@ @@@@
@@@ @@ @@@ @@@ @@@ @@@ @@@ @@@ @@@
@@@ @@@@ @@@ @@@ @@@ @@@ @@@ @@@ @@@
@@@@ @@@@ @@@@ @@@ @@@ @@@ @@@ @@@ @@@
@@@@@@@@@@@@ @@@@ @@@@ @@@ @@@ @@@ @@@
@@@@ @@@@ @@@@@@@@@@@@ @@@ @@@ @@@ @@@
@@ @@ @@@@@@@@@@ @@@ @@@ @@@ @@@
Eric P. Scott
Caltech High Energy Physics
October, 1980
Hacks to turn this into a test frame for cursor movement:
Eric S. Raymond <esr@snark.thyrsus.com>
January, 1995
July 1995 (esr): worms is now in living color! :-)
Options:
-f fill screen with copies of 'WORM' at start.
-l <n> set worm length
-n <n> set number of worms
-t make worms leave droppings
-T <start> <end> set trace interval
-S set single-stepping during trace interval
-N suppress cursor-movement optimization
This program makes a good torture-test for the ncurses cursor-optimization
code. You can use -T to set the worm move interval over which movement
traces will be dumped. The program stops and waits for one character of
input at the beginning and end of the interval.
2009-05-03 08:59:25 +08:00
$Id: worm.c,v 1.59 2008/11/16 00:19:59 juergen Exp $
1997-05-15 12:00:00 +08:00
*/
#include <test.priv.h>
#ifdef USE_PTHREADS
#include <pthread.h>
#endif
WANT_USE_WINDOW();
#define MAX_WORMS 40
#define MAX_LENGTH 1024
1999-10-24 12:32:42 +08:00
static chtype flavor[] =
{
'O', '*', '#', '$', '%', '0', '@',
1997-05-15 12:00:00 +08:00
};
1999-10-24 12:32:42 +08:00
static const short xinc[] =
{
1, 1, 1, 0, -1, -1, -1, 0
}, yinc[] =
{
-1, 0, 1, 1, 1, 0, -1, -1
1997-05-15 12:00:00 +08:00
};
typedef struct worm {
int orientation;
int head;
short *xpos;
short *ypos;
chtype attrs;
#ifdef USE_PTHREADS
pthread_t thread;
#endif
} WORM;
static unsigned long sequence = 0;
static bool quitting = FALSE;
static WORM worm[MAX_WORMS];
static short **refs;
static int last_x, last_y;
1997-05-15 12:00:00 +08:00
static const char *field;
1999-10-24 12:32:42 +08:00
static int length = 16, number = 3;
static chtype trail = ' ';
1997-05-15 12:00:00 +08:00
static unsigned pending;
1997-05-15 12:00:00 +08:00
#ifdef TRACE
static int generation, trace_start, trace_end;
1997-05-15 12:00:00 +08:00
#endif /* TRACE */
1999-10-24 12:32:42 +08:00
/* *INDENT-OFF* */
1997-05-15 12:00:00 +08:00
static const struct options {
int nopts;
int opts[3];
} normal[8]={
{ 3, { 7, 0, 1 } },
{ 3, { 0, 1, 2 } },
{ 3, { 1, 2, 3 } },
{ 3, { 2, 3, 4 } },
{ 3, { 3, 4, 5 } },
{ 3, { 4, 5, 6 } },
{ 3, { 5, 6, 7 } },
{ 3, { 6, 7, 0 } }
}, upper[8]={
{ 1, { 1, 0, 0 } },
{ 2, { 1, 2, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 2, { 4, 5, 0 } },
{ 1, { 5, 0, 0 } },
{ 2, { 1, 5, 0 } }
}, left[8]={
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 2, { 2, 3, 0 } },
{ 1, { 3, 0, 0 } },
{ 2, { 3, 7, 0 } },
{ 1, { 7, 0, 0 } },
{ 2, { 7, 0, 0 } }
}, right[8]={
{ 1, { 7, 0, 0 } },
{ 2, { 3, 7, 0 } },
{ 1, { 3, 0, 0 } },
{ 2, { 3, 4, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 2, { 6, 7, 0 } }
}, lower[8]={
{ 0, { 0, 0, 0 } },
{ 2, { 0, 1, 0 } },
{ 1, { 1, 0, 0 } },
{ 2, { 1, 5, 0 } },
{ 1, { 5, 0, 0 } },
{ 2, { 5, 6, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } }
}, upleft[8]={
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 1, { 3, 0, 0 } },
{ 2, { 1, 3, 0 } },
{ 1, { 1, 0, 0 } }
}, upright[8]={
{ 2, { 3, 5, 0 } },
{ 1, { 3, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 1, { 5, 0, 0 } }
}, lowleft[8]={
{ 3, { 7, 0, 1 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 1, { 1, 0, 0 } },
{ 2, { 1, 7, 0 } },
{ 1, { 7, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } }
}, lowright[8]={
{ 0, { 0, 0, 0 } },
{ 1, { 7, 0, 0 } },
{ 2, { 5, 7, 0 } },
{ 1, { 5, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } },
{ 0, { 0, 0, 0 } }
};
1999-10-24 12:32:42 +08:00
/* *INDENT-ON* */
static void
cleanup(void)
{
USING_WINDOW(stdscr, wrefresh);
1999-10-24 12:32:42 +08:00
curs_set(1);
endwin();
}
static RETSIGTYPE
onsig(int sig GCC_UNUSED)
{
cleanup();
2002-10-13 11:35:53 +08:00
ExitProgram(EXIT_FAILURE);
1999-10-24 12:32:42 +08:00
}
1997-05-15 12:00:00 +08:00
1999-10-24 12:32:42 +08:00
static float
ranf(void)
{
long r = (rand() & 077777);
return ((float) r / 32768.);
}
1997-05-15 12:00:00 +08:00
static int
draw_worm(WINDOW *win, void *data)
{
WORM *w = (WORM *) data;
const struct options *op;
unsigned mask = ~(1 << (w - worm));
chtype attrs = w->attrs | ((mask & pending) ? A_REVERSE : 0);
int x;
int y;
int h;
bool done = FALSE;
if ((x = w->xpos[h = w->head]) < 0) {
wmove(win, y = w->ypos[h] = last_y, x = w->xpos[h] = 0);
waddch(win, attrs);
refs[y][x]++;
} else {
y = w->ypos[h];
}
if (x > last_x)
x = last_x;
if (y > last_y)
y = last_y;
if (++h == length)
h = 0;
if (w->xpos[w->head = h] >= 0) {
int x1, y1;
x1 = w->xpos[h];
y1 = w->ypos[h];
if (y1 < LINES
&& x1 < COLS
&& --refs[y1][x1] == 0) {
wmove(win, y1, x1);
waddch(win, trail);
}
}
op = &(x == 0
? (y == 0
? upleft
: (y == last_y
? lowleft
: left))
: (x == last_x
? (y == 0
? upright
: (y == last_y
? lowright
: right))
: (y == 0
? upper
: (y == last_y
? lower
: normal))))[w->orientation];
switch (op->nopts) {
case 0:
done = TRUE;
break;
case 1:
w->orientation = op->opts[0];
break;
default:
w->orientation = op->opts[(int) (ranf() * (float) op->nopts)];
break;
}
if (!done) {
x += xinc[w->orientation];
y += yinc[w->orientation];
wmove(win, y, x);
if (y < 0)
y = 0;
waddch(win, attrs);
w->ypos[h] = y;
w->xpos[h] = x;
refs[y][x]++;
}
return done;
}
#ifdef USE_PTHREADS
static bool
quit_worm(int bitnum)
{
pending |= (1 << bitnum);
napms(10); /* let the other thread(s) have a chance */
pending &= ~(1 << bitnum);
return quitting;
}
static void *
start_worm(void *arg)
{
unsigned long compare = 0;
Trace(("start_worm"));
while (!quit_worm(((struct worm *) arg) - worm)) {
while (compare < sequence) {
++compare;
2009-05-03 08:59:25 +08:00
#if HAVE_USE_WINDOW
use_window(stdscr, draw_worm, arg);
2009-05-03 08:59:25 +08:00
#else
draw_worm(stdscr, arg);
#endif
}
}
Trace(("...start_worm (done)"));
return NULL;
}
#endif
static bool
draw_all_worms(void)
{
bool done = FALSE;
int n;
struct worm *w;
#ifdef USE_PTHREADS
static bool first = TRUE;
if (first) {
first = FALSE;
for (n = 0, w = &worm[0]; n < number; n++, w++) {
int rc;
rc = pthread_create(&(w->thread), NULL, start_worm, w);
}
}
#else
for (n = 0, w = &worm[0]; n < number; n++, w++) {
2009-05-03 08:59:25 +08:00
if (
#if HAVE_USE_WINDOW
USING_WINDOW2(stdscr, draw_worm, w)
#else
draw_worm(stdscr, w)
#endif
)
done = TRUE;
}
#endif
return done;
}
static int
get_input(void)
{
int ch;
ch = USING_WINDOW(stdscr, wgetch);
return ch;
}
#ifdef KEY_RESIZE
static int
update_refs(WINDOW *win)
{
int x, y;
(void) win;
if (last_x != COLS - 1) {
for (y = 0; y <= last_y; y++) {
refs[y] = typeRealloc(short, COLS, refs[y]);
for (x = last_x + 1; x < COLS; x++)
refs[y][x] = 0;
}
last_x = COLS - 1;
}
if (last_y != LINES - 1) {
for (y = LINES; y <= last_y; y++)
free(refs[y]);
refs = typeRealloc(short *, LINES, refs);
for (y = last_y + 1; y < LINES; y++) {
refs[y] = typeMalloc(short, COLS);
for (x = 0; x < COLS; x++)
refs[y][x] = 0;
}
last_y = LINES - 1;
}
return OK;
}
#endif
1997-05-15 12:00:00 +08:00
int
main(int argc, char *argv[])
{
1999-10-24 12:32:42 +08:00
int x, y;
int n;
struct worm *w;
short *ip;
2006-12-18 12:32:42 +08:00
bool done = FALSE;
1999-10-24 12:32:42 +08:00
2002-10-13 11:35:53 +08:00
setlocale(LC_ALL, "");
1999-10-24 12:32:42 +08:00
for (x = 1; x < argc; x++) {
char *p;
p = argv[x];
if (*p == '-')
p++;
switch (*p) {
case 'f':
field = "WORM";
break;
case 'l':
if (++x == argc)
goto usage;
if ((length = atoi(argv[x])) < 2 || length > MAX_LENGTH) {
1999-10-24 12:32:42 +08:00
fprintf(stderr, "%s: Invalid length\n", *argv);
2002-10-13 11:35:53 +08:00
ExitProgram(EXIT_FAILURE);
1999-10-24 12:32:42 +08:00
}
break;
case 'n':
if (++x == argc)
goto usage;
if ((number = atoi(argv[x])) < 1 || number > MAX_WORMS) {
1999-10-24 12:32:42 +08:00
fprintf(stderr, "%s: Invalid number of worms\n", *argv);
2002-10-13 11:35:53 +08:00
ExitProgram(EXIT_FAILURE);
1999-10-24 12:32:42 +08:00
}
break;
case 't':
trail = '.';
break;
1997-05-15 12:00:00 +08:00
#ifdef TRACE
1999-10-24 12:32:42 +08:00
case 'T':
trace_start = atoi(argv[++x]);
trace_end = atoi(argv[++x]);
break;
case 'N':
_nc_optimize_enable ^= OPTIMIZE_ALL; /* declared by ncurses */
break;
1997-05-15 12:00:00 +08:00
#endif /* TRACE */
1999-10-24 12:32:42 +08:00
default:
usage:
fprintf(stderr,
2002-10-13 11:35:53 +08:00
"usage: %s [-field] [-length #] [-number #] [-trail]\n", *argv);
ExitProgram(EXIT_FAILURE);
1999-10-24 12:32:42 +08:00
}
1997-05-15 12:00:00 +08:00
}
signal(SIGINT, onsig);
initscr();
noecho();
cbreak();
nonl();
curs_set(0);
last_y = LINES - 1;
last_x = COLS - 1;
1997-05-15 12:00:00 +08:00
#ifdef A_COLOR
1999-10-24 12:32:42 +08:00
if (has_colors()) {
1997-05-15 12:00:00 +08:00
int bg = COLOR_BLACK;
start_color();
2000-10-21 12:42:11 +08:00
#if HAVE_USE_DEFAULT_COLORS
1997-05-15 12:00:00 +08:00
if (use_default_colors() == OK)
bg = -1;
#endif
1999-10-24 12:32:42 +08:00
#define SET_COLOR(num, fg) \
init_pair(num+1, fg, bg); \
flavor[num] |= COLOR_PAIR(num+1) | A_BOLD
SET_COLOR(0, COLOR_GREEN);
SET_COLOR(1, COLOR_RED);
SET_COLOR(2, COLOR_CYAN);
SET_COLOR(3, COLOR_WHITE);
SET_COLOR(4, COLOR_MAGENTA);
SET_COLOR(5, COLOR_BLUE);
SET_COLOR(6, COLOR_YELLOW);
1997-05-15 12:00:00 +08:00
}
#endif /* A_COLOR */
refs = typeMalloc(short *, LINES);
1999-10-24 12:32:42 +08:00
for (y = 0; y < LINES; y++) {
refs[y] = typeMalloc(short, COLS);
1999-10-24 12:32:42 +08:00
for (x = 0; x < COLS; x++) {
refs[y][x] = 0;
1999-10-24 12:32:42 +08:00
}
1997-05-15 12:00:00 +08:00
}
#ifdef BADCORNER
/* if addressing the lower right corner doesn't work in your curses */
refs[last_y][last_x] = 1;
1997-05-15 12:00:00 +08:00
#endif /* BADCORNER */
1999-10-24 12:32:42 +08:00
for (n = number, w = &worm[0]; --n >= 0; w++) {
w->attrs = flavor[n % SIZEOF(flavor)];
w->orientation = 0;
w->head = 0;
2000-07-09 10:46:08 +08:00
if (!(ip = typeMalloc(short, (length + 1)))) {
1999-10-24 12:32:42 +08:00
fprintf(stderr, "%s: out of memory\n", *argv);
2002-10-13 11:35:53 +08:00
ExitProgram(EXIT_FAILURE);
1999-10-24 12:32:42 +08:00
}
w->xpos = ip;
for (x = length; --x >= 0;)
*ip++ = -1;
2000-07-09 10:46:08 +08:00
if (!(ip = typeMalloc(short, (length + 1)))) {
1999-10-24 12:32:42 +08:00
fprintf(stderr, "%s: out of memory\n", *argv);
2002-10-13 11:35:53 +08:00
ExitProgram(EXIT_FAILURE);
1999-10-24 12:32:42 +08:00
}
w->ypos = ip;
for (y = length; --y >= 0;)
*ip++ = -1;
1997-05-15 12:00:00 +08:00
}
if (field) {
1999-10-24 12:32:42 +08:00
const char *p;
p = field;
for (y = last_y; --y >= 0;) {
1999-10-24 12:32:42 +08:00
for (x = COLS; --x >= 0;) {
addch((chtype) (*p++));
if (!*p)
p = field;
}
}
1997-05-15 12:00:00 +08:00
}
USING_WINDOW(stdscr, wrefresh);
1999-10-24 12:32:42 +08:00
nodelay(stdscr, TRUE);
1997-05-15 12:00:00 +08:00
2006-12-18 12:32:42 +08:00
while (!done) {
2000-07-09 10:46:08 +08:00
int ch;
++sequence;
if ((ch = get_input()) > 0) {
#ifdef TRACE
if (trace_start || trace_end) {
if (generation == trace_start) {
trace(TRACE_CALLS);
get_input();
} else if (generation == trace_end) {
trace(0);
get_input();
}
generation++;
}
#endif
1999-10-24 12:32:42 +08:00
#ifdef KEY_RESIZE
if (ch == KEY_RESIZE) {
USING_WINDOW(stdscr, update_refs);
1999-10-24 12:32:42 +08:00
}
#endif
1999-10-24 12:32:42 +08:00
/*
* Make it simple to put this into single-step mode, or resume
2005-10-10 02:41:57 +08:00
* normal operation -T.Dickey
1999-10-24 12:32:42 +08:00
*/
if (ch == 'q') {
quitting = TRUE;
2006-12-18 12:32:42 +08:00
done = TRUE;
continue;
1999-10-24 12:32:42 +08:00
} else if (ch == 's') {
nodelay(stdscr, FALSE);
} else if (ch == ' ') {
nodelay(stdscr, TRUE);
}
}
1997-05-15 12:00:00 +08:00
done = draw_all_worms();
1999-10-24 12:32:42 +08:00
napms(10);
USING_WINDOW(stdscr, wrefresh);
1999-10-24 12:32:42 +08:00
}
2006-12-18 12:32:42 +08:00
Trace(("Cleanup"));
2006-12-18 12:32:42 +08:00
cleanup();
#ifdef NO_LEAKS
for (y = 0; y < LINES; y++) {
free(refs[y]);
2006-12-18 12:32:42 +08:00
}
free(refs);
2006-12-18 12:32:42 +08:00
for (n = number, w = &worm[0]; --n >= 0; w++) {
free(w->xpos);
free(w->ypos);
}
#endif
#ifdef USE_PTHREADS
/*
* Do this just in case one of the threads did not really exit.
*/
Trace(("join all threads"));
for (n = 0; n < number; n++) {
pthread_join(worm[n].thread, NULL);
}
2006-12-18 12:32:42 +08:00
#endif
ExitProgram(EXIT_SUCCESS);
1997-05-15 12:00:00 +08:00
}