pps_fetch: introduce a helper to handle timeouts
[dragonfly.git] / games / hangman / getword.c
blob892b5c41f602c2cfe6de82d46683e82c10824ba4
1 /* $OpenBSD: getword.c,v 1.8 2013/08/29 20:22:14 naddy Exp $ */
2 /* $NetBSD: getword.c,v 1.4 1995/03/23 08:32:45 cgd Exp $ */
4 /*
5 * Copyright (c) 1983, 1993
6 * The Regents of the University of California. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
33 #include <stdlib.h>
34 #include "hangman.h"
35 #include "pathnames.h"
38 * getword:
39 * Get a valid word out of the dictionary file
41 void
42 getword(void)
44 FILE *inf;
45 char *wp, *gp;
46 long pos;
47 int badwords, countwords;
48 size_t wordlen;
50 inf = Dict;
51 badwords = 0;
52 /* Make sure the dictionary file is valid if it's not the default */
53 countwords = strcmp(Dict_name, _PATH_DICT);
54 while (badwords < MAXBADWORDS) {
55 if (countwords)
56 badwords++;
57 pos = arc4random_uniform(Dict_size);
58 fseek(inf, pos, SEEK_SET);
59 if (fgets(Word, BUFSIZ, inf) == NULL)
60 continue;
61 if (fgets(Word, BUFSIZ, inf) == NULL)
62 continue;
63 wordlen = strlen(Word);
64 if (wordlen > 0 && Word[wordlen - 1] == '\n')
65 Word[wordlen - 1] = '\0';
66 if (wordlen < MINLEN || wordlen > MAXLEN)
67 continue;
68 for (wp = Word; *wp; wp++)
69 if (!islower(*wp))
70 goto cont;
71 break;
72 cont: ;
74 if (badwords >= MAXBADWORDS) {
75 mvcur(0, COLS - 1, LINES - 1, 0);
76 endwin();
77 errx(1, "file %s appears to be incorrectly formatted\n(Need one lower-case word per line)",
78 Dict_name);
80 gp = Known;
81 wp = Word;
82 while (*wp != '\0') {
83 *gp++ = '-';
84 wp++;
86 *gp = '\0';