twinkle1.c revision 1.5 1 1.5 agc .\" $NetBSD: twinkle1.c,v 1.5 2003/08/07 16:44:29 agc Exp $
2 1.4 perry .\"
3 1.1 cgd .\" Copyright (c) 1980, 1993
4 1.1 cgd .\" The Regents of the University of California. All rights reserved.
5 1.1 cgd .\"
6 1.1 cgd .\" Redistribution and use in source and binary forms, with or without
7 1.1 cgd .\" modification, are permitted provided that the following conditions
8 1.1 cgd .\" are met:
9 1.1 cgd .\" 1. Redistributions of source code must retain the above copyright
10 1.1 cgd .\" notice, this list of conditions and the following disclaimer.
11 1.1 cgd .\" 2. Redistributions in binary form must reproduce the above copyright
12 1.1 cgd .\" notice, this list of conditions and the following disclaimer in the
13 1.1 cgd .\" documentation and/or other materials provided with the distribution.
14 1.5 agc .\" 3. Neither the name of the University nor the names of its contributors
15 1.1 cgd .\" may be used to endorse or promote products derived from this software
16 1.1 cgd .\" without specific prior written permission.
17 1.1 cgd .\"
18 1.1 cgd .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19 1.1 cgd .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 1.1 cgd .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 1.1 cgd .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22 1.1 cgd .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 1.1 cgd .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 1.1 cgd .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 1.1 cgd .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 1.1 cgd .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 1.1 cgd .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 1.1 cgd .\" SUCH DAMAGE.
29 1.1 cgd .\"
30 1.3 cgd .\" @(#)twinkle1.c 8.1 (Berkeley) 6/8/93
31 1.1 cgd .\"
32 1.1 cgd # include <curses.h>
33 1.1 cgd # include <signal.h>
34 1.1 cgd
35 1.1 cgd /*
36 1.1 cgd * the idea for this program was a product of the imagination of
37 1.1 cgd * Kurt Schoens. Not responsible for minds lost or stolen.
38 1.1 cgd */
39 1.1 cgd
40 1.1 cgd # define NCOLS 80
41 1.1 cgd # define NLINES 24
42 1.1 cgd # define MAXPATTERNS 4
43 1.1 cgd
44 1.1 cgd typedef struct {
45 1.1 cgd int y, x;
46 1.1 cgd } LOCS;
47 1.1 cgd
48 1.1 cgd LOCS Layout[NCOLS * NLINES]; /* current board layout */
49 1.1 cgd
50 1.1 cgd int Pattern, /* current pattern number */
51 1.1 cgd Numstars; /* number of stars in pattern */
52 1.1 cgd
53 1.1 cgd char *getenv();
54 1.1 cgd
55 1.1 cgd int die();
56 1.1 cgd
57 1.1 cgd main()
58 1.1 cgd {
59 1.1 cgd srand(getpid()); /* initialize random sequence */
60 1.1 cgd
61 1.1 cgd initscr();
62 1.1 cgd signal(SIGINT, die);
63 1.1 cgd noecho();
64 1.1 cgd nonl();
65 1.1 cgd leaveok(stdscr, TRUE);
66 1.1 cgd scrollok(stdscr, FALSE);
67 1.1 cgd
68 1.1 cgd for (;;) {
69 1.1 cgd makeboard(); /* make the board setup */
70 1.1 cgd puton('*'); /* put on '*'s */
71 1.1 cgd puton(' '); /* cover up with ' 's */
72 1.1 cgd }
73 1.1 cgd }
74 1.1 cgd
75 1.1 cgd /*
76 1.1 cgd * On program exit, move the cursor to the lower left corner by
77 1.1 cgd * direct addressing, since current location is not guaranteed.
78 1.1 cgd * We lie and say we used to be at the upper right corner to guarantee
79 1.1 cgd * absolute addressing.
80 1.1 cgd */
81 1.1 cgd die()
82 1.1 cgd {
83 1.1 cgd signal(SIGINT, SIG_IGN);
84 1.1 cgd mvcur(0, COLS - 1, LINES - 1, 0);
85 1.1 cgd endwin();
86 1.1 cgd exit(0);
87 1.1 cgd }
88 1.1 cgd
89 1.1 cgd
90 1.1 cgd /*
91 1.1 cgd * Make the current board setup. It picks a random pattern and
92 1.1 cgd * calls ison() to determine if the character is on that pattern
93 1.1 cgd * or not.
94 1.1 cgd */
95 1.1 cgd makeboard()
96 1.1 cgd {
97 1.1 cgd reg int y, x;
98 1.1 cgd reg LOCS *lp;
99 1.1 cgd
100 1.1 cgd Pattern = rand() % MAXPATTERNS;
101 1.1 cgd lp = Layout;
102 1.1 cgd for (y = 0; y < NLINES; y++)
103 1.1 cgd for (x = 0; x < NCOLS; x++)
104 1.1 cgd if (ison(y, x)) {
105 1.1 cgd lp->y = y;
106 1.1 cgd lp->x = x;
107 1.1 cgd lp++;
108 1.1 cgd }
109 1.1 cgd Numstars = lp - Layout;
110 1.1 cgd }
111 1.1 cgd
112 1.1 cgd /*
113 1.1 cgd * Return TRUE if (y, x) is on the current pattern.
114 1.1 cgd */
115 1.1 cgd ison(y, x)
116 1.1 cgd reg int y, x; {
117 1.1 cgd
118 1.1 cgd switch (Pattern) {
119 1.1 cgd case 0: /* alternating lines */
120 1.1 cgd return !(y & 01);
121 1.1 cgd case 1: /* box */
122 1.1 cgd if (x >= LINES && y >= NCOLS)
123 1.1 cgd return FALSE;
124 1.1 cgd if (y < 3 || y >= NLINES - 3)
125 1.1 cgd return TRUE;
126 1.1 cgd return (x < 3 || x >= NCOLS - 3);
127 1.1 cgd case 2: /* holy pattern! */
128 1.1 cgd return ((x + y) & 01);
129 1.1 cgd case 3: /* bar across center */
130 1.1 cgd return (y >= 9 && y <= 15);
131 1.1 cgd }
132 1.1 cgd /* NOTREACHED */
133 1.1 cgd }
134 1.1 cgd
135 1.1 cgd puton(ch)
136 1.1 cgd reg char ch;
137 1.1 cgd {
138 1.1 cgd reg LOCS *lp;
139 1.1 cgd reg int r;
140 1.1 cgd reg LOCS *end;
141 1.1 cgd LOCS temp;
142 1.1 cgd
143 1.1 cgd end = &Layout[Numstars];
144 1.1 cgd for (lp = Layout; lp < end; lp++) {
145 1.1 cgd r = rand() % Numstars;
146 1.1 cgd temp = *lp;
147 1.1 cgd *lp = Layout[r];
148 1.1 cgd Layout[r] = temp;
149 1.1 cgd }
150 1.1 cgd
151 1.1 cgd for (lp = Layout; lp < end; lp++) {
152 1.1 cgd mvaddch(lp->y, lp->x, ch);
153 1.1 cgd refresh();
154 1.1 cgd }
155 1.1 cgd }
156