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. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#) Copyright (c) 1991, 1993 The Regents of the University of California. All rights reserved.
34 * @(#)quiz.c 8.3 (Berkeley) 5/4/95
35 * $FreeBSD: src/games/quiz/quiz.c,v 1.12 1999/12/12 02:29:54 billf Exp $
38 #include <sys/types.h>
49 #include "pathnames.h"
52 static int catone, cattwo, tflag;
55 char *appdstr (char *, char *, size_t);
56 void downcase (char *);
57 void err (const char *, ...) __printflike(1, 2) __dead2;
58 void get_cats (char *, char *);
59 void get_file (const char *);
60 char *next_cat (char *);
62 void score (u_int, u_int, u_int);
63 void show_index (void);
64 void usage (void) __dead2;
67 main(int argc, char **argv)
70 const char *indexfile;
75 indexfile = _PATH_QUIZIDX;
76 while ((ch = getopt(argc, argv, "i:t")) != -1)
98 get_cats(argv[0], argv[1]);
108 get_file(const char *file)
115 if ((fp = fopen(file, "r")) == NULL)
116 err("%s: %s", file, strerror(errno));
120 * Should really free up space from any earlier read list
121 * but there are no reverse pointers to do so with.
125 while ((lp = fgetln(fp, &len)) != NULL) {
126 if (qp->q_text && qp->q_text[strlen(qp->q_text) - 1] == '\\')
127 qp->q_text = appdstr(qp->q_text, lp, len);
129 if ((qp->q_next = malloc(sizeof(QE))) == NULL)
130 err("%s", strerror(errno));
133 if ((qp->q_text = strdup(lp)) == NULL)
134 err("%s", strerror(errno));
135 qp->q_asked = qp->q_answered = FALSE;
150 if ((pf = popen(_PATH_PAGER, "w")) == NULL)
151 err("%s: %s", _PATH_PAGER, strerror(errno));
152 fprintf(pf, "Subjects:\n\n");
153 for (qp = qlist.q_next; qp; qp = qp->q_next) {
154 for (s = next_cat(qp->q_text); s; s = next_cat(s)) {
157 if ((p = rxp_expand()) != NULL)
158 fprintf(pf, "%s ", p);
162 fprintf(pf, "\n%s\n%s\n%s\n",
163 "For example, \"quiz victim killer\" prints a victim's name and you reply",
164 "with the killer, and \"quiz killer victim\" works the other way around.",
165 "Type an empty line to get the correct answer.");
170 get_cats(char *cat1, char *cat2)
178 for (qp = qlist.q_next; qp; qp = qp->q_next) {
179 s = next_cat(qp->q_text);
180 catone = cattwo = i = 0;
191 if (catone && cattwo && catone != cattwo) {
192 if (!rxp_compile(qp->q_text))
194 get_file(rxp_expand());
198 err("invalid categories");
207 u_int guesses, rights, wrongs;
209 char *answer, *s, *t, question[LINE_SZ];
212 guesses = rights = wrongs = 0;
216 next = random() % qsize;
218 for (i = 0; i < next; i++)
220 while (qp && qp->q_answered)
226 if (tflag && random() % 100 > 20) {
227 /* repeat questions in tutorial mode */
228 while (qp && (!qp->q_asked || qp->q_answered))
234 for (i = 0; i < catone - 1; i++)
239 if (!t || *t == '\0') {
240 qp->q_answered = TRUE;
245 for (i = 0; i < cattwo - 1; i++)
250 if (!t || *t == '\0') {
251 qp->q_answered = TRUE;
255 printf("%s?\n", question);
257 if ((answer = fgetln(stdin, &len)) == NULL) {
258 score(rights, wrongs, guesses);
261 answer[len - 1] = '\0';
263 if (rxp_match(answer)) {
266 qp->q_answered = TRUE;
269 if (*answer == '\0') {
273 qp->q_answered = TRUE;
279 score(rights, wrongs, guesses);
299 appdstr(char *s, char *tp, size_t len)
304 if ((m = malloc(strlen(s) + len + 1)) == NULL)
305 err("%s", strerror(errno));
308 for (; (*mp++ = *sp++););
311 if (*(mp - 1) == '\\')
315 if (mp[len - 1] == '\n')
323 score(u_int r, u_int w, u_int g)
325 printf("Rights %d, wrongs %d,", r, w);
327 printf(" extra guesses %d,", g);
328 printf(" score %d%%\n", (r + w + g) ? r * 100 / (r + w + g) : 0);
336 for (; (ch = *p); ++p)
337 if (isascii(ch) && isupper(ch))
344 fprintf(stderr, "quiz [-t] [-i file] category1 category2\n");
351 err(const char *fmt, ...)
355 fprintf(stderr, "quiz: ");
356 vfprintf(stderr, fmt, ap);
358 fprintf(stderr, "\n");