1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
|
/* $OpenBSD: db_hangman.c,v 1.10 1996/11/29 06:51:49 mickey Exp $ */
/*
* Copyright (c) 1996 Theo de Raadt, Michael Shalayeff
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Michael Shalayeff.
* 4. The name of the authors may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
*/
#include <sys/param.h>
#include <machine/db_machdep.h>
#include <ddb/db_sym.h>
#include <ddb/db_extern.h>
#include <dev/cons.h>
#include <dev/rndvar.h>
#define TOLOWER(c) (('A'<=(c)&&(c)<='Z')?(c)-'A'+'a':(c))
#define ISALPHA(c) (('a'<=(c)&&(c)<='z')||('A'<=(c)&&(c)<='Z'))
/*
* if [ `size db_hangman.o | awk 'BEGIN {getline} {print $$1+$$2}'` -gt 1024 ];
* then
* echo 'hangman is too big!!!'
* fi
*
*/
static __inline size_t db_random __P((size_t));
static __inline char *db_randomsym __P((size_t *));
void db_hang __P((int, char *, char *));
int db_hangon __P((void));
static int skill;
static __inline size_t
db_random( mod )
register size_t mod;
{
size_t ret;
get_random_bytes(&ret, sizeof(ret) );
return ret % mod;
}
static __inline char *
db_randomsym(lenp)
size_t *lenp;
{
register char *p, *q;
/* choose random symtab */
register db_symtab_t stab = db_istab(db_random(db_nsymtabs));
/* choose random symbol from the table */
q = db_qualify(X_db_isym(stab, db_random(X_db_nsyms(stab))),stab->name);
/* don't show symtab name if there are less than 3 of 'em */
if (db_nsymtabs < 3)
while(*q++ != ':');
/* strlen(q) && ignoring underscores and colons */
for ((*lenp) = 0, p = q; *p; p++)
if (ISALPHA(*p))
(*lenp)++;
return q;
}
static char hangpic[]=
"\n88888 \r\n"
"9 7 6 \r\n"
"97 5 \r\n"
"9 423\r\n"
"9 2 \r\n"
"9 1 0\r\n"
"9\r\n"
"9 ";
static char substchar[]="\\/|\\/O|/-|";
void
db_hang(tries, word, abc)
int tries;
register char *word;
register char *abc;
{
register char *p;
for(p=hangpic; *p; p++) {
if(*p>='0' && *p<='9')
{
if(tries<=(*p)-'0')
cnputc(substchar[(*p)-'0']);
else
cnputc(' ');
} else
cnputc(*p);
}
for (p = word; *p; p++)
if (ISALPHA(*p))
cnputc(abc[TOLOWER(*p) - 'a']);
else
cnputc(*p);
cnputc(' ');
cnputc('(');
for (p = abc; *p; p++)
if (*p == '_')
cnputc('a' + (p - abc));
cnputc(')');
cnputc('\r');
}
int
db_hangon(void)
{
static size_t len;
static size_t tries;
static char *word = NULL;
static char abc[26+1]; /* for '\0' */
if (word == NULL) {
register char *p;
for (p = abc; p < &abc[sizeof(abc)-1]; p++)
*p = '-';
*p = '\0';
tries = 2 * (1 + skill / 3);
word = db_randomsym(&len);
}
{
register char c, c1;
db_hang(tries, word, abc);
c1 = cngetc();
c = TOLOWER(c1);
if (ISALPHA(c) && abc[c - 'a'] == '-') {
register char *p;
register size_t n;
/* strchr(word,c) */
for (n = 0, p = word; *p ; p++)
if (*p == c)
n++;
if (n) {
abc[c - 'a'] = c1;
len -= n;
} else {
abc[c - 'a'] = '_';
tries--;
}
}
}
if (tries && len)
return 1;
if (!tries && skill > 2)
{
register char *p = word;
for (; *p; p++)
if (ISALPHA(*p))
abc[TOLOWER(*p) - 'a'] = *p;
}
db_hang(tries, word, abc);
cnputc('\n');
word = NULL;
return !tries;
}
void
db_hangman( addr, haddr, count, modif)
db_expr_t addr;
int haddr;
db_expr_t count;
char *modif;
{
if (modif[0] == 's' && '0' <= modif[1] && modif[1] <= '9')
skill = modif[1] - '0';
else
skill = 5;
while (db_hangon());
}
|
