games/hack/hack.search.c

   1 /*      $NetBSD: hack.search.c,v 1.6 2009/06/07 18:30:39 dholland Exp $ */
   2
   3 /*
   4  * Copyright (c) 1985, Stichting Centrum voor Wiskunde en Informatica,
   5  * Amsterdam
   6  * All rights reserved.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions are
  10  * met:
  11  *
  12  * - Redistributions of source code must retain the above copyright notice,
  13  * this list of conditions and the following disclaimer.
  14  *
  15  * - Redistributions in binary form must reproduce the above copyright
  16  * notice, this list of conditions and the following disclaimer in the
  17  * documentation and/or other materials provided with the distribution.
  18  *
  19  * - Neither the name of the Stichting Centrum voor Wiskunde en
  20  * Informatica, nor the names of its contributors may be used to endorse or
  21  * promote products derived from this software without specific prior
  22  * written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
  25  * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
  26  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
  27  * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
  28  * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  29  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  30  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
  31  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
  32  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  33  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  34  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  35  */
  36
  37 /*
  38  * Copyright (c) 1982 Jay Fenlason <hack@gnu.org>
  39  * All rights reserved.
  40  *
  41  * Redistribution and use in source and binary forms, with or without
  42  * modification, are permitted provided that the following conditions
  43  * are met:
  44  * 1. Redistributions of source code must retain the above copyright
  45  *    notice, this list of conditions and the following disclaimer.
  46  * 2. Redistributions in binary form must reproduce the above copyright
  47  *    notice, this list of conditions and the following disclaimer in the
  48  *    documentation and/or other materials provided with the distribution.
  49  * 3. The name of the author may not be used to endorse or promote products
  50  *    derived from this software without specific prior written permission.
  51  *
  52  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
  53  * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
  54  * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL
  55  * THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  56  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  57  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
  58  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
  59  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
  60  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  61  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  62  */
  63
  64 #include "hack.h"
  65 #include "extern.h"
  66
  67 int
  68 findit(void)
  69 {                               /* returns number of things found */
  70         int             num;
  71         xchar           zx, zy;
  72         struct trap    *ttmp;
  73         struct monst   *mtmp;
  74         xchar           lx, hx, ly, hy;
  75
  76         if (u.uswallow)
  77                 return (0);
  78         for (lx = u.ux; (num = levl[lx - 1][u.uy].typ) && num != CORR; lx--);
  79         for (hx = u.ux; (num = levl[hx + 1][u.uy].typ) && num != CORR; hx++);
  80         for (ly = u.uy; (num = levl[u.ux][ly - 1].typ) && num != CORR; ly--);
  81         for (hy = u.uy; (num = levl[u.ux][hy + 1].typ) && num != CORR; hy++);
  82         num = 0;
  83         for (zy = ly; zy <= hy; zy++)
  84                 for (zx = lx; zx <= hx; zx++) {
  85                         if (levl[zx][zy].typ == SDOOR) {
  86                                 levl[zx][zy].typ = DOOR;
  87                                 atl(zx, zy, '+');
  88                                 num++;
  89                         } else if (levl[zx][zy].typ == SCORR) {
  90                                 levl[zx][zy].typ = CORR;
  91                                 atl(zx, zy, CORR_SYM);
  92                                 num++;
  93                         } else if ((ttmp = t_at(zx, zy)) != NULL) {
  94                                 if (ttmp->ttyp == PIERC) {
  95                                         (void) makemon(PM_PIERCER, zx, zy);
  96                                         num++;
  97                                         deltrap(ttmp);
  98                                 } else if (!ttmp->tseen) {
  99                                         ttmp->tseen = 1;
 100                                         if (!vism_at(zx, zy))
 101                                                 atl(zx, zy, '^');
 102                                         num++;
 103                                 }
 104                         } else if ((mtmp = m_at(zx, zy)) != NULL)
 105                                 if (mtmp->mimic) {
 106                                         seemimic(mtmp);
 107                                         num++;
 108                                 }
 109                 }
 110         return (num);
 111 }
 112
 113 int
 114 dosearch(void)
 115 {
 116         xchar           x, y;
 117         struct trap    *trap;
 118         struct monst   *mtmp;
 119
 120         if (u.uswallow)
 121                 pline("What are you looking for? The exit?");
 122         else
 123                 for (x = u.ux - 1; x < u.ux + 2; x++)
 124                         for (y = u.uy - 1; y < u.uy + 2; y++)
 125                                 if (x != u.ux || y != u.uy) {
 126                                         if (levl[x][y].typ == SDOOR) {
 127                                                 if (rn2(7))
 128                                                         continue;
 129                                                 levl[x][y].typ = DOOR;
 130                                                 levl[x][y].seen = 0;    /* force prl */
 131                                                 prl(x, y);
 132                                                 nomul(0);
 133                                         } else if (levl[x][y].typ == SCORR) {
 134                                                 if (rn2(7))
 135                                                         continue;
 136                                                 levl[x][y].typ = CORR;
 137                                                 levl[x][y].seen = 0;    /* force prl */
 138                                                 prl(x, y);
 139                                                 nomul(0);
 140                                         } else {
 141                                                 /*
 142                                                  * Be careful not to find
 143                                                  * anything in an SCORR or
 144                                                  * SDOOR
 145                                                  */
 146                                                 if ((mtmp = m_at(x, y)) != NULL)
 147                                                         if (mtmp->mimic) {
 148                                                                 seemimic(mtmp);
 149                                                                 pline("You find a mimic.");
 150                                                                 return (1);
 151                                                         }
 152                                                 for (trap = ftrap; trap; trap = trap->ntrap)
 153                                                         if (trap->tx == x && trap->ty == y &&
 154                                                             !trap->tseen && !rn2(8)) {
 155                                                                 nomul(0);
 156                                                                 pline("You find a%s.", traps[trap->ttyp]);
 157                                                                 if (trap->ttyp == PIERC) {
 158                                                                         deltrap(trap);
 159                                                                         (void) makemon(PM_PIERCER, x, y);
 160                                                                         return (1);
 161                                                                 }
 162                                                                 trap->tseen = 1;
 163                                                                 if (!vism_at(x, y))
 164                                                                         atl(x, y, '^');
 165                                                         }
 166                                         }
 167                                 }
 168         return (1);
 169 }
 170
 171 int
 172 doidtrap(void)
 173 {
 174         struct trap    *trap;
 175         int             x, y;
 176         if (!getdir(1))
 177                 return (0);
 178         x = u.ux + u.dx;
 179         y = u.uy + u.dy;
 180         for (trap = ftrap; trap; trap = trap->ntrap)
 181                 if (trap->tx == x && trap->ty == y && trap->tseen) {
 182                         if (u.dz)
 183                                 if ((u.dz < 0) != (!xdnstair && trap->ttyp == TRAPDOOR))
 184                                         continue;
 185                         pline("That is a%s.", traps[trap->ttyp]);
 186                         return (0);
 187                 }
 188         pline("I can't see a trap there.");
 189         return (0);
 190 }
 191
 192 void
 193 wakeup(struct monst *mtmp)
 194 {
 195         mtmp->msleep = 0;
 196         setmangry(mtmp);
 197         if (mtmp->mimic)
 198                 seemimic(mtmp);
 199 }
 200
 201 /* NOTE: we must check if(mtmp->mimic) before calling this routine */
 202 void
 203 seemimic(struct monst *mtmp)
 204 {
 205         mtmp->mimic = 0;
 206         mtmp->mappearance = 0;
 207         unpmon(mtmp);
 208         pmon(mtmp);
 209 }