xref: /netbsd-src/games/hack/hack.rumors.c (revision 10ad5ffa714ce1a679dcc9dd8159648df2d67b5a)
1 /*	$NetBSD: hack.rumors.c,v 1.6 2009/06/07 18:30:39 dholland Exp $	*/
2 
3 /*
4  * Copyright (c) 1985, Stichting Centrum voor Wiskunde en Informatica,
5  * Amsterdam
6  * All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions are
10  * met:
11  *
12  * - Redistributions of source code must retain the above copyright notice,
13  * this list of conditions and the following disclaimer.
14  *
15  * - Redistributions in binary form must reproduce the above copyright
16  * notice, this list of conditions and the following disclaimer in the
17  * documentation and/or other materials provided with the distribution.
18  *
19  * - Neither the name of the Stichting Centrum voor Wiskunde en
20  * Informatica, nor the names of its contributors may be used to endorse or
21  * promote products derived from this software without specific prior
22  * written permission.
23  *
24  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
25  * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
26  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
27  * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
28  * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
29  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
30  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
31  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
32  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
33  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
34  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35  */
36 
37 /*
38  * Copyright (c) 1982 Jay Fenlason <hack@gnu.org>
39  * All rights reserved.
40  *
41  * Redistribution and use in source and binary forms, with or without
42  * modification, are permitted provided that the following conditions
43  * are met:
44  * 1. Redistributions of source code must retain the above copyright
45  *    notice, this list of conditions and the following disclaimer.
46  * 2. Redistributions in binary form must reproduce the above copyright
47  *    notice, this list of conditions and the following disclaimer in the
48  *    documentation and/or other materials provided with the distribution.
49  * 3. The name of the author may not be used to endorse or promote products
50  *    derived from this software without specific prior written permission.
51  *
52  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
53  * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
54  * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL
55  * THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
56  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
57  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
58  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
59  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
60  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
61  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
62  */
63 
64 #include <sys/cdefs.h>
65 #ifndef lint
66 __RCSID("$NetBSD: hack.rumors.c,v 1.6 2009/06/07 18:30:39 dholland Exp $");
67 #endif				/* not lint */
68 
69 #include "hack.h"	/* for RUMORFILE and BSD (strchr) */
70 #include "extern.h"
71 #define	CHARSZ	8		/* number of bits in a char */
72 int             n_rumors = 0;
73 int             n_used_rumors = -1;
74 char           *usedbits;
75 
76 void
77 init_rumors(FILE *rumf)
78 {
79 	int             i;
80 	n_used_rumors = 0;
81 	while (skipline(rumf))
82 		n_rumors++;
83 	rewind(rumf);
84 	i = n_rumors / CHARSZ;
85 	usedbits = (char *) alloc((unsigned) (i + 1));
86 	for (; i >= 0; i--)
87 		usedbits[i] = 0;
88 }
89 
90 int
91 skipline(FILE *rumf)
92 {
93 	char            line[COLNO];
94 	while (1) {
95 		if (!fgets(line, sizeof(line), rumf))
96 			return (0);
97 		if (strchr(line, '\n'))
98 			return (1);
99 	}
100 }
101 
102 void
103 outline(FILE *rumf)
104 {
105 	char            line[COLNO];
106 	char           *ep;
107 	if (!fgets(line, sizeof(line), rumf))
108 		return;
109 	if ((ep = strchr(line, '\n')) != 0)
110 		*ep = 0;
111 	pline("This cookie has a scrap of paper inside! It reads: ");
112 	pline(line);
113 }
114 
115 void
116 outrumor(void)
117 {
118 	int             rn, i;
119 	FILE           *rumf;
120 	if (n_rumors <= n_used_rumors ||
121 	    (rumf = fopen(RUMORFILE, "r")) == (FILE *) 0)
122 		return;
123 	if (n_used_rumors < 0)
124 		init_rumors(rumf);
125 	if (!n_rumors)
126 		goto none;
127 	rn = rn2(n_rumors - n_used_rumors);
128 	i = 0;
129 	while (rn || used(i)) {
130 		(void) skipline(rumf);
131 		if (!used(i))
132 			rn--;
133 		i++;
134 	}
135 	usedbits[i / CHARSZ] |= (1 << (i % CHARSZ));
136 	n_used_rumors++;
137 	outline(rumf);
138 none:
139 	(void) fclose(rumf);
140 }
141 
142 int
143 used(int i)
144 {
145 	return (usedbits[i / CHARSZ] & (1 << (i % CHARSZ)));
146 }
147