xref: /minix3/lib/libcurses/PSD.doc/twinkle2.c (revision 51ffecc181005cb45a40108612ee28d1daaeeb86)
1*51ffecc1SBen Gras /*	$NetBSD: twinkle2.c,v 1.6 2005/05/23 04:04:49 christos Exp $	*/
2*51ffecc1SBen Gras 
3*51ffecc1SBen Gras /*
4*51ffecc1SBen Gras  *
5*51ffecc1SBen Gras  *  Copyright (c) 1980, 1993
6*51ffecc1SBen Gras  * 	 The Regents of the University of California.  All rights reserved.
7*51ffecc1SBen Gras  *
8*51ffecc1SBen Gras  *  Redistribution and use in source and binary forms, with or without
9*51ffecc1SBen Gras  *  modification, are permitted provided that the following conditions
10*51ffecc1SBen Gras  *  are met:
11*51ffecc1SBen Gras  *  1. Redistributions of source code must retain the above copyright
12*51ffecc1SBen Gras  *     notice, this list of conditions and the following disclaimer.
13*51ffecc1SBen Gras  *  2. Redistributions in binary form must reproduce the above copyright
14*51ffecc1SBen Gras  *     notice, this list of conditions and the following disclaimer in the
15*51ffecc1SBen Gras  *     documentation and/or other materials provided with the distribution.
16*51ffecc1SBen Gras  *  3. Neither the name of the University nor the names of its contributors
17*51ffecc1SBen Gras  *     may be used to endorse or promote products derived from this software
18*51ffecc1SBen Gras  *     without specific prior written permission.
19*51ffecc1SBen Gras  *
20*51ffecc1SBen Gras  *  THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21*51ffecc1SBen Gras  *  ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22*51ffecc1SBen Gras  *  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23*51ffecc1SBen Gras  *  ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24*51ffecc1SBen Gras  *  FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25*51ffecc1SBen Gras  *  DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26*51ffecc1SBen Gras  *  OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27*51ffecc1SBen Gras  *  HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28*51ffecc1SBen Gras  *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29*51ffecc1SBen Gras  *  OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30*51ffecc1SBen Gras  *  SUCH DAMAGE.
31*51ffecc1SBen Gras  *
32*51ffecc1SBen Gras  * 	@(#)twinkle2.c	8.1 (Berkeley) 6/8/93
33*51ffecc1SBen Gras  */
34*51ffecc1SBen Gras 
35*51ffecc1SBen Gras #include <stdlib.h>
36*51ffecc1SBen Gras #include <unistd.h>
37*51ffecc1SBen Gras #include <curses.h>
38*51ffecc1SBen Gras #include <signal.h>
39*51ffecc1SBen Gras 
40*51ffecc1SBen Gras #define	NCOLS	80
41*51ffecc1SBen Gras #define	NLINES	24
42*51ffecc1SBen Gras #define	MAXPATTERNS	4
43*51ffecc1SBen Gras 
44*51ffecc1SBen Gras typedef struct {
45*51ffecc1SBen Gras 	int	y, x;
46*51ffecc1SBen Gras } LOCS;
47*51ffecc1SBen Gras 
48*51ffecc1SBen Gras static LOCS	Layout[NCOLS * NLINES];	/* current board layout */
49*51ffecc1SBen Gras 
50*51ffecc1SBen Gras static int	Pattern,		/* current pattern number */
51*51ffecc1SBen Gras 		Numstars;		/* number of stars in pattern */
52*51ffecc1SBen Gras 
53*51ffecc1SBen Gras static void puton(char);
54*51ffecc1SBen Gras static void die(int);
55*51ffecc1SBen Gras static void makeboard(void);
56*51ffecc1SBen Gras static int ison(int, int);
57*51ffecc1SBen Gras 
58*51ffecc1SBen Gras static int AM;
59*51ffecc1SBen Gras static char *VS;
60*51ffecc1SBen Gras static char *TI;
61*51ffecc1SBen Gras static char *CL;
62*51ffecc1SBen Gras 
63*51ffecc1SBen Gras int
main(void)64*51ffecc1SBen Gras main(void)
65*51ffecc1SBen Gras {
66*51ffecc1SBen Gras 	char	*sp;
67*51ffecc1SBen Gras 	char	buf[1024];
68*51ffecc1SBen Gras 	char	*ptr = buf;
69*51ffecc1SBen Gras 
70*51ffecc1SBen Gras 	srand(getpid());		/* initialize random sequence */
71*51ffecc1SBen Gras 
72*51ffecc1SBen Gras 	if (isatty(0)) {
73*51ffecc1SBen Gras 		initscr();
74*51ffecc1SBen Gras 		gettmode();
75*51ffecc1SBen Gras 		if ((sp = getenv("TERM")) != NULL)
76*51ffecc1SBen Gras 			setterm(sp);
77*51ffecc1SBen Gras 		signal(SIGINT, die);
78*51ffecc1SBen Gras 	}
79*51ffecc1SBen Gras 	else {
80*51ffecc1SBen Gras 		printf("Need a terminal on fd=%d\n", 0);
81*51ffecc1SBen Gras 		exit(1);
82*51ffecc1SBen Gras 	}
83*51ffecc1SBen Gras 
84*51ffecc1SBen Gras 	tgetent(buf, sp);
85*51ffecc1SBen Gras 
86*51ffecc1SBen Gras 	AM = tgetflag("am");
87*51ffecc1SBen Gras 	TI = tgetstr("ti", &ptr);
88*51ffecc1SBen Gras 	if (TI == NULL) {
89*51ffecc1SBen Gras 		printf("terminal does not have the ti capability\n");
90*51ffecc1SBen Gras 		exit(1);
91*51ffecc1SBen Gras 	}
92*51ffecc1SBen Gras 	VS = tgetstr("vs", &ptr);
93*51ffecc1SBen Gras 	if (VS == NULL) {
94*51ffecc1SBen Gras 		printf("terminal does not have the vs capability\n");
95*51ffecc1SBen Gras 		exit(1);
96*51ffecc1SBen Gras 	}
97*51ffecc1SBen Gras 	CL = tgetstr("cl", &ptr);
98*51ffecc1SBen Gras 	if (CL == NULL) {
99*51ffecc1SBen Gras 		printf("terminal does not have the cl capability\n");
100*51ffecc1SBen Gras 		exit(1);
101*51ffecc1SBen Gras 	}
102*51ffecc1SBen Gras 	puts(TI);
103*51ffecc1SBen Gras 	puts(VS);
104*51ffecc1SBen Gras 
105*51ffecc1SBen Gras 	noecho();
106*51ffecc1SBen Gras 	nonl();
107*51ffecc1SBen Gras 	tputs(CL, NLINES, putchar);
108*51ffecc1SBen Gras 	for (;;) {
109*51ffecc1SBen Gras 		makeboard();		/* make the board setup */
110*51ffecc1SBen Gras 		puton('*');		/* put on '*'s */
111*51ffecc1SBen Gras 		puton(' ');		/* cover up with ' 's */
112*51ffecc1SBen Gras 	}
113*51ffecc1SBen Gras }
114*51ffecc1SBen Gras 
115*51ffecc1SBen Gras /*
116*51ffecc1SBen Gras  * On program exit, move the cursor to the lower left corner by
117*51ffecc1SBen Gras  * direct addressing, since current location is not guaranteed.
118*51ffecc1SBen Gras  * We lie and say we used to be at the upper right corner to guarantee
119*51ffecc1SBen Gras  * absolute addressing.
120*51ffecc1SBen Gras  */
121*51ffecc1SBen Gras static void
die(int n)122*51ffecc1SBen Gras die(int n)
123*51ffecc1SBen Gras {
124*51ffecc1SBen Gras 	signal(SIGINT, SIG_IGN);
125*51ffecc1SBen Gras 	mvcur(0, COLS - 1, LINES - 1, 0);
126*51ffecc1SBen Gras 	endwin();
127*51ffecc1SBen Gras 	exit(n);
128*51ffecc1SBen Gras }
129*51ffecc1SBen Gras 
130*51ffecc1SBen Gras static void
puton(char ch)131*51ffecc1SBen Gras puton(char ch)
132*51ffecc1SBen Gras {
133*51ffecc1SBen Gras 	LOCS	*lp;
134*51ffecc1SBen Gras 	int		r;
135*51ffecc1SBen Gras 	LOCS	*end;
136*51ffecc1SBen Gras 	LOCS		temp;
137*51ffecc1SBen Gras 	static int	lasty, lastx;
138*51ffecc1SBen Gras 
139*51ffecc1SBen Gras 	end = &Layout[Numstars];
140*51ffecc1SBen Gras 	for (lp = Layout; lp < end; lp++) {
141*51ffecc1SBen Gras 		r = rand() % Numstars;
142*51ffecc1SBen Gras 		temp = *lp;
143*51ffecc1SBen Gras 		*lp = Layout[r];
144*51ffecc1SBen Gras 		Layout[r] = temp;
145*51ffecc1SBen Gras 	}
146*51ffecc1SBen Gras 
147*51ffecc1SBen Gras 	for (lp = Layout; lp < end; lp++)
148*51ffecc1SBen Gras 			/* prevent scrolling */
149*51ffecc1SBen Gras 		if (!AM || (lp->y < NLINES - 1 || lp->x < NCOLS - 1)) {
150*51ffecc1SBen Gras 			mvcur(lasty, lastx, lp->y, lp->x);
151*51ffecc1SBen Gras 			putchar(ch);
152*51ffecc1SBen Gras 			lasty = lp->y;
153*51ffecc1SBen Gras 			if ((lastx = lp->x + 1) >= NCOLS)
154*51ffecc1SBen Gras 				if (AM) {
155*51ffecc1SBen Gras 					lastx = 0;
156*51ffecc1SBen Gras 					lasty++;
157*51ffecc1SBen Gras 				}
158*51ffecc1SBen Gras 				else
159*51ffecc1SBen Gras 					lastx = NCOLS - 1;
160*51ffecc1SBen Gras 		}
161*51ffecc1SBen Gras }
162*51ffecc1SBen Gras 
163*51ffecc1SBen Gras /*
164*51ffecc1SBen Gras  * Make the current board setup.  It picks a random pattern and
165*51ffecc1SBen Gras  * calls ison() to determine if the character is on that pattern
166*51ffecc1SBen Gras  * or not.
167*51ffecc1SBen Gras  */
168*51ffecc1SBen Gras static void
makeboard(void)169*51ffecc1SBen Gras makeboard(void)
170*51ffecc1SBen Gras {
171*51ffecc1SBen Gras 	int		y, x;
172*51ffecc1SBen Gras 	LOCS	*lp;
173*51ffecc1SBen Gras 
174*51ffecc1SBen Gras 	Pattern = rand() % MAXPATTERNS;
175*51ffecc1SBen Gras 	lp = Layout;
176*51ffecc1SBen Gras 	for (y = 0; y < NLINES; y++)
177*51ffecc1SBen Gras 		for (x = 0; x < NCOLS; x++)
178*51ffecc1SBen Gras 			if (ison(y, x)) {
179*51ffecc1SBen Gras 				lp->y = y;
180*51ffecc1SBen Gras 				lp->x = x;
181*51ffecc1SBen Gras 				lp++;
182*51ffecc1SBen Gras 			}
183*51ffecc1SBen Gras 	Numstars = lp - Layout;
184*51ffecc1SBen Gras }
185*51ffecc1SBen Gras 
186*51ffecc1SBen Gras /*
187*51ffecc1SBen Gras  * Return TRUE if (y, x) is on the current pattern.
188*51ffecc1SBen Gras  */
189*51ffecc1SBen Gras static int
ison(int y,int x)190*51ffecc1SBen Gras ison(int y, int x)
191*51ffecc1SBen Gras {
192*51ffecc1SBen Gras 	switch (Pattern) {
193*51ffecc1SBen Gras 	  case 0:	/* alternating lines */
194*51ffecc1SBen Gras 		return !(y & 01);
195*51ffecc1SBen Gras 	  case 1:	/* box */
196*51ffecc1SBen Gras 		if (x >= LINES && y >= NCOLS)
197*51ffecc1SBen Gras 			return FALSE;
198*51ffecc1SBen Gras 		if (y < 3 || y >= NLINES - 3)
199*51ffecc1SBen Gras 			return TRUE;
200*51ffecc1SBen Gras 		return (x < 3 || x >= NCOLS - 3);
201*51ffecc1SBen Gras 	  case 2:	/* holy pattern! */
202*51ffecc1SBen Gras 		return ((x + y) & 01);
203*51ffecc1SBen Gras 	  case 3:	/* bar across center */
204*51ffecc1SBen Gras 		return (y >= 9 && y <= 15);
205*51ffecc1SBen Gras 	}
206*51ffecc1SBen Gras 	/* NOTREACHED */
207*51ffecc1SBen Gras }
208