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
|
/* $OpenBSD: hangman.h,v 1.11 2015/12/31 15:20:36 mestre Exp $ */
/* $NetBSD: hangman.h,v 1.5 1995/04/24 12:23:44 cgd Exp $ */
/*
* Copyright (c) 1983, 1993
* The Regents of the University of California. 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. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``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.
*
* @(#)hangman.h 8.1 (Berkeley) 5/31/93
*/
#include <stdbool.h>
#include <stdio.h>
#define MAXBADWORDS 100
#define MINLEN 6
#define MAXLEN 60
#define MAXERRS 7
#define MESGY 12
#define MESGX 0
#define PROMPTY 11
#define PROMPTX 0
#define KNOWNY 10
#define KNOWNX 1
#define NUMBERY 4
#define NUMBERX (COLS - 11 - 26)
#define AVGY 5
#define AVGX (COLS - 11 - 26)
#define GUESSY 2
#define GUESSX (COLS - 11 - 26)
typedef struct {
short y, x;
char ch;
} ERR_POS;
extern bool Guessed[];
extern char Word[BUFSIZ], Known[BUFSIZ];
extern const char *const Noose_pict[];
extern int Errors, Wordnum;
extern double Average;
extern const ERR_POS Err_pos[];
extern const char *Dict_name;
extern FILE *Dict;
extern off_t Dict_size;
extern int syms;
extern int symfd;
extern off_t symoffs, symsize;
__dead void die(int);
void endgame(void);
void getguess(void);
void getword(void);
void sym_getword(void);
int sym_setup(void);
void playgame(void);
void prdata(void);
void prman(void);
void prword(void);
unsigned char readch(void);
void setup(void);
|
