Source:NetHack 3.6.2/include/rm.h

From NetHackWiki
Jump to navigation Jump to search

Below is the full text to rm.h from the source code of NetHack 3.6.2. To link to a particular line, write [[Source:NetHack 3.6.2/include/rm.h#line12]], for example.

The NetHack General Public License applies to screenshots, source code and other content from NetHack.

This content was modified from the original NetHack source code distribution (by splitting up NetHack content between wiki pages, and possibly further editing). See the page history for a list of who changed it, and on what dates.

1. /* NetHack 3.6	rm.h	$NHDT-Date: 1547255911 2019/01/12 01:18:31 $  $NHDT-Branch: NetHack-3.6.2-beta01 $:$NHDT-Revision: 1.60 $ */
2. /* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */
3. /*-Copyright (c) Pasi Kallinen, 2017. */
4. /* NetHack may be freely redistributed.  See license for details. */
5. 
6. #ifndef RM_H
7. #define RM_H
8. 
9. /*
10.  * The dungeon presentation graphics code and data structures were rewritten
11.  * and generalized for NetHack's release 2 by Eric S. Raymond (eric@snark)
12.  * building on Don G. Kneller's MS-DOS implementation.	See drawing.c for
13.  * the code that permits the user to set the contents of the symbol structure.
14.  *
15.  * The door representation was changed by Ari
16.  * Huttunen(ahuttune@niksula.hut.fi)
17.  */
18. 
19. /*
20.  * TLCORNER     TDWALL          TRCORNER
21.  * +-           -+-             -+
22.  * |             |               |
23.  *
24.  * TRWALL       CROSSWALL       TLWALL          HWALL
25.  * |             |               |
26.  * +-           -+-             -+              ---
27.  * |             |               |
28.  *
29.  * BLCORNER     TUWALL          BRCORNER        VWALL
30.  * |             |               |              |
31.  * +-           -+-             -+              |
32.  */
33. 
34. /* Level location types.  [Some debugging code in src/display.c
35.    defines array type_names[] which contains an entry for each of
36.    these, so needs to be kept in sync if any new types are added
37.    or existing ones renumbered.] */
38. enum levl_typ_types {
39.     STONE     =  0,
40.     VWALL     =  1,
41.     HWALL     =  2,
42.     TLCORNER  =  3,
43.     TRCORNER  =  4,
44.     BLCORNER  =  5,
45.     BRCORNER  =  6,
46.     CROSSWALL =  7, /* For pretty mazes and special levels */
47.     TUWALL    =  8,
48.     TDWALL    =  9,
49.     TLWALL    = 10,
50.     TRWALL    = 11,
51.     DBWALL    = 12,
52.     TREE      = 13, /* KMH */
53.     SDOOR     = 14,
54.     SCORR     = 15,
55.     POOL      = 16,
56.     MOAT      = 17, /* pool that doesn't boil, adjust messages */
57.     WATER     = 18,
58.     DRAWBRIDGE_UP = 19,
59.     LAVAPOOL  = 20,
60.     IRONBARS  = 21, /* KMH */
61.     DOOR      = 22,
62.     CORR      = 23,
63.     ROOM      = 24,
64.     STAIRS    = 25,
65.     LADDER    = 26,
66.     FOUNTAIN  = 27,
67.     THRONE    = 28,
68.     SINK      = 29,
69.     GRAVE     = 30,
70.     ALTAR     = 31,
71.     ICE       = 32,
72.     DRAWBRIDGE_DOWN = 33,
73.     AIR       = 34,
74.     CLOUD     = 35,
75. 
76.     MAX_TYPE  = 36,
77.     INVALID_TYPE = 127
78. };
79. 
80. /*
81.  * Avoid using the level types in inequalities:
82.  * these types are subject to change.
83.  * Instead, use one of the macros below.
84.  */
85. #define IS_WALL(typ) ((typ) && (typ) <= DBWALL)
86. #define IS_STWALL(typ) ((typ) <= DBWALL) /* STONE <= (typ) <= DBWALL */
87. #define IS_ROCK(typ) ((typ) < POOL)      /* absolutely nonaccessible */
88. #define IS_DOOR(typ) ((typ) == DOOR)
89. #define IS_DOORJOIN(typ) (IS_ROCK(typ) || (typ) == IRONBARS)
90. #define IS_TREE(typ)                                            \
91.     ((typ) == TREE || (level.flags.arboreal && (typ) == STONE))
92. #define ACCESSIBLE(typ) ((typ) >= DOOR) /* good position */
93. #define IS_ROOM(typ) ((typ) >= ROOM)    /* ROOM, STAIRS, furniture.. */
94. #define ZAP_POS(typ) ((typ) >= POOL)
95. #define SPACE_POS(typ) ((typ) > DOOR)
96. #define IS_POOL(typ) ((typ) >= POOL && (typ) <= DRAWBRIDGE_UP)
97. #define IS_THRONE(typ) ((typ) == THRONE)
98. #define IS_FOUNTAIN(typ) ((typ) == FOUNTAIN)
99. #define IS_SINK(typ) ((typ) == SINK)
100. #define IS_GRAVE(typ) ((typ) == GRAVE)
101. #define IS_ALTAR(typ) ((typ) == ALTAR)
102. #define IS_DRAWBRIDGE(typ) \
103.     ((typ) == DRAWBRIDGE_UP || (typ) == DRAWBRIDGE_DOWN)
104. #define IS_FURNITURE(typ) ((typ) >= STAIRS && (typ) <= ALTAR)
105. #define IS_AIR(typ) ((typ) == AIR || (typ) == CLOUD)
106. #define IS_SOFT(typ) ((typ) == AIR || (typ) == CLOUD || IS_POOL(typ))
107. 
108. /*
109.  * The screen symbols may be the default or defined at game startup time.
110.  * See drawing.c for defaults.
111.  * Note: {ibm|dec|curses}_graphics[] arrays (also in drawing.c) must be kept in
112.  * synch.
113.  */
114. 
115. /* begin dungeon characters */
116. enum screen_symbols {
117.     S_stone     =  0,
118.     S_vwall     =  1,
119.     S_hwall     =  2,
120.     S_tlcorn    =  3,
121.     S_trcorn    =  4,
122.     S_blcorn    =  5,
123.     S_brcorn    =  6,
124.     S_crwall    =  7,
125.     S_tuwall    =  8,
126.     S_tdwall    =  9,
127.     S_tlwall    = 10,
128.     S_trwall    = 11,
129.     S_ndoor     = 12,
130.     S_vodoor    = 13,
131.     S_hodoor    = 14,
132.     S_vcdoor    = 15, /* closed door, vertical wall */
133.     S_hcdoor    = 16, /* closed door, horizontal wall */
134.     S_bars      = 17, /* KMH -- iron bars */
135.     S_tree      = 18, /* KMH */
136.     S_room      = 19,
137.     S_darkroom  = 20,
138.     S_corr      = 21,
139.     S_litcorr   = 22,
140.     S_upstair   = 23,
141.     S_dnstair   = 24,
142.     S_upladder  = 25,
143.     S_dnladder  = 26,
144.     S_altar     = 27,
145.     S_grave     = 28,
146.     S_throne    = 29,
147.     S_sink      = 30,
148.     S_fountain  = 31,
149.     S_pool      = 32,
150.     S_ice       = 33,
151.     S_lava      = 34,
152.     S_vodbridge = 35,
153.     S_hodbridge = 36,
154.     S_vcdbridge = 37, /* closed drawbridge, vertical wall */
155.     S_hcdbridge = 38, /* closed drawbridge, horizontal wall */
156.     S_air       = 39,
157.     S_cloud     = 40,
158.     S_water     = 41,
159. 
160. /* end dungeon characters, begin traps */
161. 
162.     S_arrow_trap           = 42,
163.     S_dart_trap            = 43,
164.     S_falling_rock_trap    = 44,
165.     S_squeaky_board        = 45,
166.     S_bear_trap            = 46,
167.     S_land_mine            = 47,
168.     S_rolling_boulder_trap = 48,
169.     S_sleeping_gas_trap    = 49,
170.     S_rust_trap            = 50,
171.     S_fire_trap            = 51,
172.     S_pit                  = 52,
173.     S_spiked_pit           = 53,
174.     S_hole                 = 54,
175.     S_trap_door            = 55,
176.     S_teleportation_trap   = 56,
177.     S_level_teleporter     = 57,
178.     S_magic_portal         = 58,
179.     S_web                  = 59,
180.     S_statue_trap          = 60,
181.     S_magic_trap           = 61,
182.     S_anti_magic_trap      = 62,
183.     S_polymorph_trap       = 63,
184.     S_vibrating_square     = 64, /* for display rather than any trap effect */
185. 
186. /* end traps, begin special effects */
187. 
188.     S_vbeam     = 65, /* The 4 zap beam symbols.  Do NOT separate. */
189.     S_hbeam     = 66, /* To change order or add, see function      */
190.     S_lslant    = 67, /* zapdir_to_glyph() in display.c.           */
191.     S_rslant    = 68,
192.     S_digbeam   = 69, /* dig beam symbol */
193.     S_flashbeam = 70, /* camera flash symbol */
194.     S_boomleft  = 71, /* thrown boomerang, open left, e.g ')'    */
195.     S_boomright = 72, /* thrown boomerang, open right, e.g. '('  */
196.     S_ss1       = 73, /* 4 magic shield ("resistance sparkle") glyphs */
197.     S_ss2       = 74,
198.     S_ss3       = 75,
199.     S_ss4       = 76,
200.     S_poisoncloud = 77,
201.     S_goodpos   = 78, /* valid position for targeting via getpos() */
202. 
203. /* The 8 swallow symbols.  Do NOT separate.  To change order or add, */
204. /* see the function swallow_to_glyph() in display.c.                 */
205.     S_sw_tl     = 79, /* swallow top left [1]             */
206.     S_sw_tc     = 80, /* swallow top center [2]    Order: */
207.     S_sw_tr     = 81, /* swallow top right [3]            */
208.     S_sw_ml     = 82, /* swallow middle left [4]   1 2 3  */
209.     S_sw_mr     = 83, /* swallow middle right [6]  4 5 6  */
210.     S_sw_bl     = 84, /* swallow bottom left [7]   7 8 9  */
211.     S_sw_bc     = 85, /* swallow bottom center [8]        */
212.     S_sw_br     = 86, /* swallow bottom right [9]         */
213. 
214.     S_explode1  = 87, /* explosion top left               */
215.     S_explode2  = 88, /* explosion top center             */
216.     S_explode3  = 89, /* explosion top right        Ex.   */
217.     S_explode4  = 90, /* explosion middle left            */
218.     S_explode5  = 91, /* explosion middle center    /-\   */
219.     S_explode6  = 92, /* explosion middle right     |@|   */
220.     S_explode7  = 93, /* explosion bottom left      \-/   */
221.     S_explode8  = 94, /* explosion bottom center          */
222.     S_explode9  = 95, /* explosion bottom right           */
223. 
224. /* end effects */
225. 
226.     MAXPCHARS   = 96  /* maximum number of mapped characters */
227. };
228. 
229. #define MAXDCHARS (S_water - S_stone + 1) /* mapped dungeon characters */
230. #define MAXTCHARS (S_vibrating_square - S_arrow_trap + 1) /* trap chars */
231. #define MAXECHARS (S_explode9 - S_vbeam + 1) /* mapped effects characters */
232. #define MAXEXPCHARS 9 /* number of explosion characters */
233. 
234. #define DARKROOMSYM (Is_rogue_level(&u.uz) ? S_stone : S_darkroom)
235. 
236. #define is_cmap_trap(i) ((i) >= S_arrow_trap && (i) <= S_polymorph_trap)
237. #define is_cmap_drawbridge(i) ((i) >= S_vodbridge && (i) <= S_hcdbridge)
238. #define is_cmap_door(i) ((i) >= S_vodoor && (i) <= S_hcdoor)
239. #define is_cmap_wall(i) ((i) >= S_stone && (i) <= S_trwall)
240. #define is_cmap_room(i) ((i) >= S_room && (i) <= S_darkroom)
241. #define is_cmap_corr(i) ((i) >= S_corr && (i) <= S_litcorr)
242. #define is_cmap_furniture(i) ((i) >= S_upstair && (i) <= S_fountain)
243. #define is_cmap_water(i) ((i) == S_pool || (i) == S_water)
244. #define is_cmap_lava(i) ((i) == S_lava)
245. 
246. 
247. struct symdef {
248.     uchar sym;
249.     const char *explanation;
250. #ifdef TEXTCOLOR
251.     uchar color;
252. #endif
253. };
254. 
255. struct symparse {
256.     unsigned range;
257. #define SYM_CONTROL 1 /* start/finish markers */
258. #define SYM_PCHAR 2   /* index into showsyms  */
259. #define SYM_OC 3      /* index into oc_syms   */
260. #define SYM_MON 4     /* index into monsyms   */
261. #define SYM_OTH 5     /* misc                 */
262.     int idx;
263.     const char *name;
264. };
265. 
266. /* misc symbol definitions */
267. #define SYM_BOULDER 0
268. #define SYM_INVISIBLE 1
269. #define MAXOTHER 2
270. 
271. /* linked list of symsets and their characteristics */
272. struct symsetentry {
273.     struct symsetentry *next; /* next in list                         */
274.     char *name;               /* ptr to symset name                   */
275.     char *desc;               /* ptr to description                   */
276.     int idx;                  /* an index value                       */
277.     int handling;             /* known handlers value                 */
278.     Bitfield(nocolor, 1);     /* don't use color if set               */
279.     Bitfield(primary, 1);     /* restricted for use as primary set    */
280.     Bitfield(rogue, 1);       /* restricted for use as rogue lev set  */
281.                               /* 5 free bits */
282. };
283. 
284. /*
285.  * Graphics sets for display symbols
286.  */
287. #define DEFAULT_GRAPHICS 0 /* regular characters: '-', '+', &c */
288. #define PRIMARY 0          /* primary graphics set        */
289. #define ROGUESET 1         /* rogue graphics set          */
290. #define NUM_GRAPHICS 2
291. 
292. /*
293.  * special symbol set handling types ( for invoking callbacks, etc.)
294.  * Must match the order of the known_handlers strings
295.  * in drawing.c
296.  */
297. #define H_UNK     0
298. #define H_IBM     1
299. #define H_DEC     2
300. #define H_CURS    3
301. 
302. extern const struct symdef defsyms[MAXPCHARS]; /* defaults */
303. extern const struct symdef def_warnsyms[WARNCOUNT];
304. extern int currentgraphics; /* from drawing.c */
305. extern nhsym showsyms[];
306. extern nhsym l_syms[];
307. extern nhsym r_syms[];
308. 
309. extern struct symsetentry symset[NUM_GRAPHICS]; /* from drawing.c */
310. #define SYMHANDLING(ht) (symset[currentgraphics].handling == (ht))
311. 
312. /*
313.  * The 5 possible states of doors
314.  */
315. 
316. #define D_NODOOR 0
317. #define D_BROKEN 1
318. #define D_ISOPEN 2
319. #define D_CLOSED 4
320. #define D_LOCKED 8
321. #define D_TRAPPED 16
322. #define D_SECRET 32 /* only used by sp_lev.c, NOT in rm-struct */
323. 
324. /*
325.  * Some altars are considered as shrines, so we need a flag.
326.  */
327. #define AM_SHRINE 8
328. 
329. /*
330.  * Thrones should only be looted once.
331.  */
332. #define T_LOOTED 1
333. 
334. /*
335.  * Trees have more than one kick result.
336.  */
337. #define TREE_LOOTED 1
338. #define TREE_SWARM 2
339. 
340. /*
341.  * Fountains have limits, and special warnings.
342.  */
343. #define F_LOOTED 1
344. #define F_WARNED 2
345. #define FOUNTAIN_IS_WARNED(x, y) (levl[x][y].looted & F_WARNED)
346. #define FOUNTAIN_IS_LOOTED(x, y) (levl[x][y].looted & F_LOOTED)
347. #define SET_FOUNTAIN_WARNED(x, y) levl[x][y].looted |= F_WARNED;
348. #define SET_FOUNTAIN_LOOTED(x, y) levl[x][y].looted |= F_LOOTED;
349. #define CLEAR_FOUNTAIN_WARNED(x, y) levl[x][y].looted &= ~F_WARNED;
350. #define CLEAR_FOUNTAIN_LOOTED(x, y) levl[x][y].looted &= ~F_LOOTED;
351. 
352. /*
353.  * Doors are even worse :-) The special warning has a side effect
354.  * of instantly trapping the door, and if it was defined as trapped,
355.  * the guards consider that you have already been warned!
356.  */
357. #define D_WARNED 16
358. 
359. /*
360.  * Sinks have 3 different types of loot that shouldn't be abused
361.  */
362. #define S_LPUDDING 1
363. #define S_LDWASHER 2
364. #define S_LRING 4
365. 
366. /*
367.  * The four directions for a DrawBridge.
368.  */
369. #define DB_NORTH 0
370. #define DB_SOUTH 1
371. #define DB_EAST 2
372. #define DB_WEST 3
373. #define DB_DIR 3 /* mask for direction */
374. 
375. /*
376.  * What's under a drawbridge.
377.  */
378. #define DB_MOAT 0
379. #define DB_LAVA 4
380. #define DB_ICE 8
381. #define DB_FLOOR 16
382. #define DB_UNDER 28 /* mask for underneath */
383. 
384. /*
385.  * Wall information.  Nondiggable also applies to iron bars.
386.  */
387. #define WM_MASK 0x07 /* wall mode (bottom three bits) */
388. #define W_NONDIGGABLE 0x08
389. #define W_NONPASSWALL 0x10
390. 
391. /*
392.  * Ladders (in Vlad's tower) may be up or down.
393.  */
394. #define LA_UP 1
395. #define LA_DOWN 2
396. 
397. /*
398.  * Room areas may be iced pools
399.  */
400. #define ICED_POOL 8
401. #define ICED_MOAT 16
402. 
403. /*
404.  * The structure describing a coordinate position.
405.  * Before adding fields, remember that this will significantly affect
406.  * the size of temporary files and save files.
407.  *
408.  * Also remember that the run-length encoding for some ports in save.c
409.  * must be updated to consider the field.
410.  */
411. struct rm {
412.     int glyph;               /* what the hero thinks is there */
413.     schar typ;               /* what is really there */
414.     uchar seenv;             /* seen vector */
415.     Bitfield(flags, 5);      /* extra information for typ */
416.     Bitfield(horizontal, 1); /* wall/door/etc is horiz. (more typ info) */
417.     Bitfield(lit, 1);        /* speed hack for lit rooms */
418.     Bitfield(waslit, 1);     /* remember if a location was lit */
419. 
420.     Bitfield(roomno, 6); /* room # for special rooms */
421.     Bitfield(edge, 1);   /* marks boundaries for special rooms*/
422.     Bitfield(candig, 1); /* Exception to Can_dig_down; was a trapdoor */
423. };
424. 
425. #define SET_TYPLIT(x, y, ttyp, llit)                              \
426.     {                                                             \
427.         if ((x) >= 0 && (y) >= 0 && (x) < COLNO && (y) < ROWNO) { \
428.             if ((ttyp) < MAX_TYPE)                                \
429.                 levl[(x)][(y)].typ = (ttyp);                      \
430.             if ((ttyp) == LAVAPOOL)                               \
431.                 levl[(x)][(y)].lit = 1;                           \
432.             else if ((schar)(llit) != -2) {                       \
433.                 if ((schar)(llit) == -1)                          \
434.                     levl[(x)][(y)].lit = rn2(2);                  \
435.                 else                                              \
436.                     levl[(x)][(y)].lit = (llit);                  \
437.             }                                                     \
438.         }                                                         \
439.     }
440. 
441. /*
442.  * Add wall angle viewing by defining "modes" for each wall type.  Each
443.  * mode describes which parts of a wall are finished (seen as as wall)
444.  * and which are unfinished (seen as rock).
445.  *
446.  * We use the bottom 3 bits of the flags field for the mode.  This comes
447.  * in conflict with secret doors, but we avoid problems because until
448.  * a secret door becomes discovered, we know what sdoor's bottom three
449.  * bits are.
450.  *
451.  * The following should cover all of the cases.
452.  *
453.  *      type    mode                            Examples: R=rock, F=finished
454.  *      -----   ----                            ----------------------------
455.  *      WALL:   0 none                          hwall, mode 1
456.  *              1 left/top (1/2 rock)                   RRR
457.  *              2 right/bottom (1/2 rock)               ---
458.  *                                                      FFF
459.  *
460.  *      CORNER: 0 none                          trcorn, mode 2
461.  *              1 outer (3/4 rock)                      FFF
462.  *              2 inner (1/4 rock)                      F+-
463.  *                                                      F|R
464.  *
465.  *      TWALL:  0 none                          tlwall, mode 3
466.  *              1 long edge (1/2 rock)                  F|F
467.  *              2 bottom left (on a tdwall)             -+F
468.  *              3 bottom right (on a tdwall)            R|F
469.  *
470.  *      CRWALL: 0 none                          crwall, mode 5
471.  *              1 top left (1/4 rock)                   R|F
472.  *              2 top right (1/4 rock)                  -+-
473.  *              3 bottom left (1/4 rock)                F|R
474.  *              4 bottom right (1/4 rock)
475.  *              5 top left & bottom right (1/2 rock)
476.  *              6 bottom left & top right (1/2 rock)
477.  */
478. 
479. #define WM_W_LEFT 1 /* vertical or horizontal wall */
480. #define WM_W_RIGHT 2
481. #define WM_W_TOP WM_W_LEFT
482. #define WM_W_BOTTOM WM_W_RIGHT
483. 
484. #define WM_C_OUTER 1 /* corner wall */
485. #define WM_C_INNER 2
486. 
487. #define WM_T_LONG 1 /* T wall */
488. #define WM_T_BL 2
489. #define WM_T_BR 3
490. 
491. #define WM_X_TL 1 /* cross wall */
492. #define WM_X_TR 2
493. #define WM_X_BL 3
494. #define WM_X_BR 4
495. #define WM_X_TLBR 5
496. #define WM_X_BLTR 6
497. 
498. /*
499.  * Seen vector values.  The seen vector is an array of 8 bits, one for each
500.  * octant around a given center x:
501.  *
502.  *              0 1 2
503.  *              7 x 3
504.  *              6 5 4
505.  *
506.  * In the case of walls, a single wall square can be viewed from 8 possible
507.  * directions.  If we know the type of wall and the directions from which
508.  * it has been seen, then we can determine what it looks like to the hero.
509.  */
510. #define SV0   0x01
511. #define SV1   0x02
512. #define SV2   0x04
513. #define SV3   0x08
514. #define SV4   0x10
515. #define SV5   0x20
516. #define SV6   0x40
517. #define SV7   0x80
518. #define SVALL 0xFF
519. 
520. #define doormask flags
521. #define altarmask flags
522. #define wall_info flags
523. #define ladder flags
524. #define drawbridgemask flags
525. #define looted flags
526. #define icedpool flags
527. 
528. #define blessedftn horizontal /* a fountain that grants attribs */
529. #define disturbed horizontal  /* a grave that has been disturbed */
530. 
531. struct damage {
532.     struct damage *next;
533.     long when, cost;
534.     coord place;
535.     schar typ;
536. };
537. 
538. /* for bones levels:  identify the dead character, who might have died on
539.    an existing bones level; if so, most recent victim will be first in list */
540. struct cemetery {
541.     struct cemetery *next; /* next struct is previous dead character... */
542.     /* "plname" + "-ROLe" + "-RACe" + "-GENder" + "-ALIgnment" + \0 */
543.     char who[PL_NSIZ + 4 * (1 + 3) + 1];
544.     /* death reason, same as in score/log file */
545.     char how[100 + 1]; /* [DTHSZ+1] */
546.     /* date+time in string of digits rather than binary */
547.     char when[4 + 2 + 2 + 2 + 2 + 2 + 1]; /* "YYYYMMDDhhmmss\0" */
548.     /* final resting place spot */
549.     schar frpx, frpy;
550.     boolean bonesknown;
551. };
552. 
553. struct levelflags {
554.     uchar nfountains; /* number of fountains on level */
555.     uchar nsinks;     /* number of sinks on the level */
556.     /* Several flags that give hints about what's on the level */
557.     Bitfield(has_shop, 1);
558.     Bitfield(has_vault, 1);
559.     Bitfield(has_zoo, 1);
560.     Bitfield(has_court, 1);
561.     Bitfield(has_morgue, 1);
562.     Bitfield(has_beehive, 1);
563.     Bitfield(has_barracks, 1);
564.     Bitfield(has_temple, 1);
565. 
566.     Bitfield(has_swamp, 1);
567.     Bitfield(noteleport, 1);
568.     Bitfield(hardfloor, 1);
569.     Bitfield(nommap, 1);
570.     Bitfield(hero_memory, 1);   /* hero has memory */
571.     Bitfield(shortsighted, 1);  /* monsters are shortsighted */
572.     Bitfield(graveyard, 1);     /* has_morgue, but remains set */
573.     Bitfield(sokoban_rules, 1); /* fill pits and holes w/ boulders */
574. 
575.     Bitfield(is_maze_lev, 1);
576.     Bitfield(is_cavernous_lev, 1);
577.     Bitfield(arboreal, 1);     /* Trees replace rock */
578.     Bitfield(wizard_bones, 1); /* set if level came from a bones file
579.                                   which was created in wizard mode (or
580.                                   normal mode descendant of such) */
581.     Bitfield(corrmaze, 1);     /* Whether corridors are used for the maze
582.                                   rather than ROOM */
583. };
584. 
585. typedef struct {
586.     struct rm locations[COLNO][ROWNO];
587. #ifndef MICROPORT_BUG
588.     struct obj *objects[COLNO][ROWNO];
589.     struct monst *monsters[COLNO][ROWNO];
590. #else
591.     struct obj *objects[1][ROWNO];
592.     char *yuk1[COLNO - 1][ROWNO];
593.     struct monst *monsters[1][ROWNO];
594.     char *yuk2[COLNO - 1][ROWNO];
595. #endif
596.     struct obj *objlist;
597.     struct obj *buriedobjlist;
598.     struct monst *monlist;
599.     struct damage *damagelist;
600.     struct cemetery *bonesinfo;
601.     struct levelflags flags;
602. } dlevel_t;
603. 
604. extern schar lastseentyp[COLNO][ROWNO]; /* last seen/touched dungeon typ */
605. 
606. extern dlevel_t level; /* structure describing the current level */
607. 
608. /*
609.  * Macros for compatibility with old code. Someday these will go away.
610.  */
611. #define levl level.locations
612. #define fobj level.objlist
613. #define fmon level.monlist
614. 
615. /*
616.  * Covert a trap number into the defsym graphics array.
617.  * Convert a defsym number into a trap number.
618.  * Assumes that arrow trap will always be the first trap.
619.  */
620. #define trap_to_defsym(t) (S_arrow_trap + (t) -1)
621. #define defsym_to_trap(d) ((d) -S_arrow_trap + 1)
622. 
623. #define OBJ_AT(x, y) (level.objects[x][y] != (struct obj *) 0)
624. /*
625.  * Macros for encapsulation of level.monsters references.
626.  */
627. #define MON_AT(x, y)                            \
628.     (level.monsters[x][y] != (struct monst *) 0 \
629.      && !(level.monsters[x][y])->mburied)
630. #define MON_BURIED_AT(x, y)                     \
631.     (level.monsters[x][y] != (struct monst *) 0 \
632.      && (level.monsters[x][y])->mburied)
633. #ifdef EXTRA_SANITY_CHECKS
634. #define place_worm_seg(m, x, y) \
635.     do {                                                        \
636.         if (level.monsters[x][y] && level.monsters[x][y] != m)  \
637.             impossible("place_worm_seg over mon");              \
638.         level.monsters[x][y] = m;                               \
639.     } while(0)
640. #define remove_monster(x, y) \
641.     do {                                                \
642.         if (!level.monsters[x][y])                      \
643.             impossible("no monster to remove");         \
644.         level.monsters[x][y] = (struct monst *) 0;      \
645.     } while(0)
646. #else
647. #define place_worm_seg(m, x, y) level.monsters[x][y] = m
648. #define remove_monster(x, y) level.monsters[x][y] = (struct monst *) 0
649. #endif
650. #define m_at(x, y) (MON_AT(x, y) ? level.monsters[x][y] : (struct monst *) 0)
651. #define m_buried_at(x, y) \
652.     (MON_BURIED_AT(x, y) ? level.monsters[x][y] : (struct monst *) 0)
653. 
654. /* restricted movement, potential luck penalties */
655. #define Sokoban level.flags.sokoban_rules
656. 
657. #endif /* RM_H */