2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Jim R. Oldroyd at The Instruction Set and Keith Gabryelski at
7 * Commodore Business Machines.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * @(#) Copyright (c) 1991, 1993 The Regents of the University of California. All rights reserved.
38 * @(#)quiz.c 8.3 (Berkeley) 5/4/95
39 * $FreeBSD: src/games/quiz/quiz.c,v 1.12 1999/12/12 02:29:54 billf Exp $
40 * $DragonFly: src/games/quiz/quiz.c,v 1.4 2004/07/27 07:37:39 asmodai Exp $
43 #include <sys/types.h>
54 #include "pathnames.h"
57 static int catone, cattwo, tflag;
60 char *appdstr (char *, char *, size_t);
61 void downcase (char *);
62 void err (const char *, ...);
63 void get_cats (char *, char *);
64 void get_file (char *);
65 char *next_cat (char *);
67 void score (u_int, u_int, u_int);
68 void show_index (void);
82 indexfile = _PATH_QUIZIDX;
83 while ((ch = getopt(argc, argv, "i:t")) != -1)
105 get_cats(argv[0], argv[1]);
123 if ((fp = fopen(file, "r")) == NULL)
124 err("%s: %s", file, strerror(errno));
128 * Should really free up space from any earlier read list
129 * but there are no reverse pointers to do so with.
133 while ((lp = fgetln(fp, &len)) != NULL) {
134 if (qp->q_text && qp->q_text[strlen(qp->q_text) - 1] == '\\')
135 qp->q_text = appdstr(qp->q_text, lp, len);
137 if ((qp->q_next = malloc(sizeof(QE))) == NULL)
138 err("%s", strerror(errno));
141 if ((qp->q_text = strdup(lp)) == NULL)
142 err("%s", strerror(errno));
143 qp->q_asked = qp->q_answered = FALSE;
158 if ((pf = popen(_PATH_PAGER, "w")) == NULL)
159 err("%s: %s", _PATH_PAGER, strerror(errno));
160 (void)fprintf(pf, "Subjects:\n\n");
161 for (qp = qlist.q_next; qp; qp = qp->q_next) {
162 for (s = next_cat(qp->q_text); s; s = next_cat(s)) {
165 if ((p = rxp_expand()) != '\0')
166 (void)fprintf(pf, "%s ", p);
168 (void)fprintf(pf, "\n");
170 (void)fprintf(pf, "\n%s\n%s\n%s\n",
171 "For example, \"quiz victim killer\" prints a victim's name and you reply",
172 "with the killer, and \"quiz killer victim\" works the other way around.",
173 "Type an empty line to get the correct answer.");
187 for (qp = qlist.q_next; qp; qp = qp->q_next) {
188 s = next_cat(qp->q_text);
189 catone = cattwo = i = 0;
200 if (catone && cattwo && catone != cattwo) {
201 if (!rxp_compile(qp->q_text))
203 get_file(rxp_expand());
207 err("invalid categories");
216 u_int guesses, rights, wrongs;
218 char *answer, *s, *t, question[LINE_SZ];
221 guesses = rights = wrongs = 0;
225 next = random() % qsize;
227 for (i = 0; i < next; i++)
229 while (qp && qp->q_answered)
235 if (tflag && random() % 100 > 20) {
236 /* repeat questions in tutorial mode */
237 while (qp && (!qp->q_asked || qp->q_answered))
243 for (i = 0; i < catone - 1; i++)
248 if (!t || *t == '\0') {
249 qp->q_answered = TRUE;
252 (void)strcpy(question, t);
254 for (i = 0; i < cattwo - 1; i++)
259 if (!t || *t == '\0') {
260 qp->q_answered = TRUE;
264 (void)printf("%s?\n", question);
266 if ((answer = fgetln(stdin, &len)) == NULL) {
267 score(rights, wrongs, guesses);
270 answer[len - 1] = '\0';
272 if (rxp_match(answer)) {
273 (void)printf("Right!\n");
275 qp->q_answered = TRUE;
278 if (*answer == '\0') {
279 (void)printf("%s\n", t);
282 qp->q_answered = TRUE;
285 (void)printf("What?\n");
288 score(rights, wrongs, guesses);
317 if ((m = malloc(strlen(s) + len + 1)) == NULL)
318 err("%s", strerror(errno));
321 for (; (*mp++ = *sp++););
324 if (*(mp - 1) == '\\')
328 if (mp[len - 1] == '\n')
339 (void)printf("Rights %d, wrongs %d,", r, w);
341 (void)printf(" extra guesses %d,", g);
342 (void)printf(" score %d%%\n", (r + w + g) ? r * 100 / (r + w + g) : 0);
351 for (; (ch = *p); ++p)
352 if (isascii(ch) && isupper(ch))
359 (void)fprintf(stderr, "quiz [-t] [-i file] category1 category2\n");
366 err(const char *fmt, ...)
370 (void)fprintf(stderr, "quiz: ");
371 (void)vfprintf(stderr, fmt, ap);
373 (void)fprintf(stderr, "\n");