hangman/hangman.h

   1 /*      $NetBSD: hangman.h,v 1.11 2002/01/20 00:42:51 jsm Exp $ */
   2
   3 /*
   4  * Copyright (c) 1983, 1993
   5  *      The Regents of the University of California.  All rights reserved.
   6  *
   7  * Redistribution and use in source and binary forms, with or without
   8  * modification, are permitted provided that the following conditions
   9  * are met:
  10  * 1. Redistributions of source code must retain the above copyright
  11  *    notice, this list of conditions and the following disclaimer.
  12  * 2. Redistributions in binary form must reproduce the above copyright
  13  *    notice, this list of conditions and the following disclaimer in the
  14  *    documentation and/or other materials provided with the distribution.
  15  * 3. All advertising materials mentioning features or use of this software
  16  *    must display the following acknowledgement:
  17  *      This product includes software developed by the University of
  18  *      California, Berkeley and its contributors.
  19  * 4. Neither the name of the University nor the names of its contributors
  20  *    may be used to endorse or promote products derived from this software
  21  *    without specific prior written permission.
  22  *
  23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  33  * SUCH DAMAGE.
  34  *
  35  *      @(#)hangman.h   8.1 (Berkeley) 5/31/93
  36  */
  37
  38 #include        <sys/types.h>
  39 #include        <sys/stat.h>
  40 #include        <ctype.h>
  41 #include        <curses.h>
  42 #include        <signal.h>
  43 #include        <stdlib.h>
  44 #include        <string.h>
  45 #include        <unistd.h>
  46 #include        "pathnames.h"
  47
  48 #define MINLEN  6
  49 #define MAXERRS 7
  50
  51 #define MESGY   12
  52 #define MESGX   0
  53 #define PROMPTY 11
  54 #define PROMPTX 0
  55 #define KNOWNY  10
  56 #define KNOWNX  1
  57 #define NUMBERY 4
  58 #define NUMBERX (COLS - 1 - 26)
  59 #define AVGY    5
  60 #define AVGX    (COLS - 1 - 26)
  61 #define GUESSY  2
  62 #define GUESSX  (COLS - 1 - 26)
  63
  64
  65 typedef struct {
  66         short   y, x;
  67         char    ch;
  68 }       ERR_POS;
  69
  70 extern bool Guessed[];
  71
  72 extern char Word[], Known[];
  73 extern const char *const Noose_pict[];
  74
  75 extern int Errors, Wordnum;
  76 extern unsigned int Minlen;
  77
  78 extern double Average;
  79
  80 extern const ERR_POS Err_pos[];
  81
  82 extern const char *Dict_name;
  83
  84 extern FILE *Dict;
  85
  86 extern off_t Dict_size;
  87
  88 void    die __P((int)) __attribute__((__noreturn__));
  89 void    endgame __P((void));
  90 int     main __P((int, char *[]));
  91 void    getguess __P((void));
  92 void    getword __P((void));
  93 void    playgame __P((void));
  94 void    prdata __P((void));
  95 void    prman __P((void));
  96 void    prword __P((void));
  97 int     readch __P((void));
  98 void    setup __P((void));