1 /* NetHack 3.6 sp_lev.c $NHDT-Date: 1449269920 2015/12/04 22:58:40 $ $NHDT-Branch: NetHack-3.6.0 $:$NHDT-Revision: 1.77 $ */
2 /* Copyright (c) 1989 by Jean-Christophe Collet */
3 /* NetHack may be freely redistributed. See license for details. */
6 * This file contains the various functions that are related to the special
9 * It contains also the special level loader.
18 #pragma warning(disable : 4244)
21 typedef void FDECL((*select_iter_func), (int, int, genericptr));
23 extern void FDECL(mkmap, (lev_init *));
25 STATIC_DCL void NDECL(solidify_map);
26 STATIC_DCL void FDECL(splev_stack_init, (struct splevstack *));
27 STATIC_DCL void FDECL(splev_stack_done, (struct splevstack *));
28 STATIC_DCL void FDECL(splev_stack_push, (struct splevstack *,
30 STATIC_DCL struct opvar *FDECL(splev_stack_pop, (struct splevstack *));
31 STATIC_DCL struct splevstack *FDECL(splev_stack_reverse,
32 (struct splevstack *));
33 STATIC_DCL struct opvar *FDECL(opvar_new_str, (char *));
34 STATIC_DCL struct opvar *FDECL(opvar_new_int, (long));
35 STATIC_DCL struct opvar *FDECL(opvar_new_coord, (int, int));
37 STATIC_DCL struct opvar * FDECL(opvar_new_region, (int,int, int,int));
39 STATIC_DCL void FDECL(opvar_free_x, (struct opvar *));
40 STATIC_DCL struct opvar *FDECL(opvar_clone, (struct opvar *));
41 STATIC_DCL struct opvar *FDECL(opvar_var_conversion, (struct sp_coder *,
43 STATIC_DCL struct splev_var *FDECL(opvar_var_defined, (struct sp_coder *,
45 STATIC_DCL struct opvar *FDECL(splev_stack_getdat, (struct sp_coder *,
47 STATIC_DCL struct opvar *FDECL(splev_stack_getdat_any, (struct sp_coder *));
48 STATIC_DCL void FDECL(variable_list_del, (struct splev_var *));
49 STATIC_DCL void FDECL(lvlfill_maze_grid, (int, int, int, int, SCHAR_P));
50 STATIC_DCL void FDECL(lvlfill_solid, (SCHAR_P, SCHAR_P));
51 STATIC_DCL void FDECL(set_wall_property, (XCHAR_P, XCHAR_P, XCHAR_P, XCHAR_P,
53 STATIC_DCL void NDECL(shuffle_alignments);
54 STATIC_DCL void NDECL(count_features);
55 STATIC_DCL void NDECL(remove_boundary_syms);
56 STATIC_DCL void FDECL(maybe_add_door, (int, int, struct mkroom *));
57 STATIC_DCL void NDECL(link_doors_rooms);
58 STATIC_DCL void NDECL(fill_rooms);
59 STATIC_DCL int NDECL(rnddoor);
60 STATIC_DCL int NDECL(rndtrap);
61 STATIC_DCL void FDECL(get_location, (schar *, schar *, int, struct mkroom *));
62 STATIC_DCL boolean FDECL(is_ok_location, (SCHAR_P, SCHAR_P, int));
63 STATIC_DCL unpacked_coord FDECL(get_unpacked_coord, (long, int));
64 STATIC_DCL void FDECL(get_location_coord, (schar *, schar *, int,
65 struct mkroom *, long));
66 STATIC_DCL void FDECL(get_room_loc, (schar *, schar *, struct mkroom *));
67 STATIC_DCL void FDECL(get_free_room_loc, (schar *, schar *,
68 struct mkroom *, packed_coord));
69 STATIC_DCL boolean FDECL(create_subroom, (struct mkroom *, XCHAR_P, XCHAR_P,
70 XCHAR_P, XCHAR_P, XCHAR_P, XCHAR_P));
71 STATIC_DCL void FDECL(create_door, (room_door *, struct mkroom *));
72 STATIC_DCL void FDECL(create_trap, (trap *, struct mkroom *));
73 STATIC_DCL int FDECL(noncoalignment, (ALIGNTYP_P));
74 STATIC_DCL boolean FDECL(m_bad_boulder_spot, (int, int));
75 STATIC_DCL void FDECL(create_monster, (monster *, struct mkroom *));
76 STATIC_DCL void FDECL(create_object, (object *, struct mkroom *));
77 STATIC_DCL void FDECL(create_altar, (altar *, struct mkroom *));
78 STATIC_DCL void FDECL(replace_terrain, (replaceterrain *, struct mkroom *));
79 STATIC_DCL boolean FDECL(search_door, (struct mkroom *,
80 xchar *, xchar *, XCHAR_P, int));
81 STATIC_DCL void NDECL(fix_stair_rooms);
82 STATIC_DCL void FDECL(create_corridor, (corridor *));
83 STATIC_DCL struct mkroom *FDECL(build_room, (room *, struct mkroom *));
84 STATIC_DCL void FDECL(light_region, (region *));
85 STATIC_DCL void FDECL(wallify_map, (int, int, int, int));
86 STATIC_DCL void FDECL(maze1xy, (coord *, int));
87 STATIC_DCL void NDECL(fill_empty_maze);
88 STATIC_DCL boolean FDECL(sp_level_loader, (dlb *, sp_lev *));
89 STATIC_DCL boolean FDECL(sp_level_free, (sp_lev *));
90 STATIC_DCL void FDECL(splev_initlev, (lev_init *));
91 STATIC_DCL struct sp_frame *FDECL(frame_new, (long));
92 STATIC_DCL void FDECL(frame_del, (struct sp_frame *));
93 STATIC_DCL void FDECL(spo_frame_push, (struct sp_coder *));
94 STATIC_DCL void FDECL(spo_frame_pop, (struct sp_coder *));
95 STATIC_DCL long FDECL(sp_code_jmpaddr, (long, long));
96 STATIC_DCL void FDECL(spo_call, (struct sp_coder *));
97 STATIC_DCL void FDECL(spo_return, (struct sp_coder *));
98 STATIC_DCL void FDECL(spo_end_moninvent, (struct sp_coder *));
99 STATIC_DCL void FDECL(spo_pop_container, (struct sp_coder *));
100 STATIC_DCL void FDECL(spo_message, (struct sp_coder *));
101 STATIC_DCL void FDECL(spo_monster, (struct sp_coder *));
102 STATIC_DCL void FDECL(spo_object, (struct sp_coder *));
103 STATIC_DCL void FDECL(spo_level_flags, (struct sp_coder *));
104 STATIC_DCL void FDECL(spo_initlevel, (struct sp_coder *));
105 STATIC_DCL void FDECL(spo_engraving, (struct sp_coder *));
106 STATIC_DCL void FDECL(spo_mineralize, (struct sp_coder *));
107 STATIC_DCL void FDECL(spo_room, (struct sp_coder *));
108 STATIC_DCL void FDECL(spo_endroom, (struct sp_coder *));
109 STATIC_DCL void FDECL(spo_stair, (struct sp_coder *));
110 STATIC_DCL void FDECL(spo_ladder, (struct sp_coder *));
111 STATIC_DCL void FDECL(spo_grave, (struct sp_coder *));
112 STATIC_DCL void FDECL(spo_altar, (struct sp_coder *));
113 STATIC_DCL void FDECL(spo_trap, (struct sp_coder *));
114 STATIC_DCL void FDECL(spo_gold, (struct sp_coder *));
115 STATIC_DCL void FDECL(spo_corridor, (struct sp_coder *));
116 STATIC_DCL struct opvar *FDECL(selection_opvar, (char *));
117 STATIC_DCL xchar FDECL(selection_getpoint, (int, int, struct opvar *));
118 STATIC_DCL void FDECL(selection_setpoint, (int, int, struct opvar *, XCHAR_P));
119 STATIC_DCL struct opvar *FDECL(selection_not, (struct opvar *));
120 STATIC_DCL struct opvar *FDECL(selection_logical_oper, (struct opvar *,
121 struct opvar *, CHAR_P));
122 STATIC_DCL struct opvar *FDECL(selection_filter_mapchar, (struct opvar *,
124 STATIC_DCL void FDECL(selection_filter_percent, (struct opvar *, int));
125 STATIC_DCL int FDECL(selection_rndcoord, (struct opvar *, schar *, schar *,
127 STATIC_DCL void FDECL(selection_do_grow, (struct opvar *, int));
128 STATIC_DCL void FDECL(set_selection_floodfillchk, (int FDECL((*), (int,int))));
129 STATIC_DCL int FDECL(floodfillchk_match_under, (int, int));
130 STATIC_DCL int FDECL(floodfillchk_match_accessible, (int, int));
131 STATIC_DCL void FDECL(selection_floodfill, (struct opvar *, int, int,
133 STATIC_DCL void FDECL(selection_do_ellipse, (struct opvar *, int, int,
135 STATIC_DCL long FDECL(line_dist_coord, (long, long, long, long, long, long));
136 STATIC_DCL void FDECL(selection_do_gradient, (struct opvar *, long, long, long,
137 long, long, long, long, long));
138 STATIC_DCL void FDECL(selection_do_line, (SCHAR_P, SCHAR_P, SCHAR_P, SCHAR_P,
140 STATIC_DCL void FDECL(selection_do_randline, (SCHAR_P, SCHAR_P, SCHAR_P,
141 SCHAR_P, SCHAR_P, SCHAR_P,
143 STATIC_DCL void FDECL(selection_iterate, (struct opvar *, select_iter_func,
145 STATIC_DCL void FDECL(sel_set_ter, (int, int, genericptr_t));
146 STATIC_DCL void FDECL(sel_set_feature, (int, int, genericptr_t));
147 STATIC_DCL void FDECL(sel_set_door, (int, int, genericptr_t));
148 STATIC_DCL void FDECL(spo_door, (struct sp_coder *));
149 STATIC_DCL void FDECL(spo_feature, (struct sp_coder *));
150 STATIC_DCL void FDECL(spo_terrain, (struct sp_coder *));
151 STATIC_DCL void FDECL(spo_replace_terrain, (struct sp_coder *));
152 STATIC_DCL boolean FDECL(generate_way_out_method, (int, int, struct opvar *));
153 STATIC_DCL void NDECL(ensure_way_out);
154 STATIC_DCL void FDECL(spo_levregion, (struct sp_coder *));
155 STATIC_DCL void FDECL(spo_region, (struct sp_coder *));
156 STATIC_DCL void FDECL(spo_drawbridge, (struct sp_coder *));
157 STATIC_DCL void FDECL(spo_mazewalk, (struct sp_coder *));
158 STATIC_DCL void FDECL(spo_wall_property, (struct sp_coder *));
159 STATIC_DCL void FDECL(spo_room_door, (struct sp_coder *));
160 STATIC_DCL void FDECL(sel_set_wallify, (int, int, genericptr_t));
161 STATIC_DCL void FDECL(spo_wallify, (struct sp_coder *));
162 STATIC_DCL void FDECL(spo_map, (struct sp_coder *));
163 STATIC_DCL void FDECL(spo_jmp, (struct sp_coder *, sp_lev *));
164 STATIC_DCL void FDECL(spo_conditional_jump, (struct sp_coder *, sp_lev *));
165 STATIC_DCL void FDECL(spo_var_init, (struct sp_coder *));
167 STATIC_DCL long FDECL(opvar_array_length, (struct sp_coder *));
169 STATIC_DCL void FDECL(spo_shuffle_array, (struct sp_coder *));
170 STATIC_DCL boolean FDECL(sp_level_coder, (sp_lev *));
181 #define sq(x) ((x) * (x))
186 #define Fread (void) dlb_fread
187 #define Fgetc (schar) dlb_fgetc
188 #define New(type) (type *) alloc(sizeof(type))
189 #define NewTab(type, size) (type **) alloc(sizeof(type *) * (unsigned) size)
190 #define Free(ptr) if (ptr) free((genericptr_t) (ptr))
192 extern struct engr *head_engr;
194 extern int min_rx, max_rx, min_ry, max_ry; /* from mkmap.c */
196 /* positions touched by level elements explicitly defined in the des-file */
197 static char SpLev_Map[COLNO][ROWNO];
199 static aligntyp ralign[3] = { AM_CHAOTIC, AM_NEUTRAL, AM_LAWFUL };
200 static NEARDATA xchar xstart, ystart;
201 static NEARDATA char xsize, ysize;
203 char *lev_message = 0;
204 lev_region *lregions = 0;
205 int num_lregions = 0;
206 boolean splev_init_present = FALSE;
207 boolean icedpools = FALSE;
209 struct obj *container_obj[MAX_CONTAINMENT];
210 int container_idx = 0;
212 struct monst *invent_carrying_monster = NULL;
214 #define SPLEV_STACK_RESERVE 128
221 for (x = 0; x < COLNO; x++)
222 for (y = 0; y < ROWNO; y++)
223 if (IS_STWALL(levl[x][y].typ) && !SpLev_Map[x][y])
224 levl[x][y].wall_info |= (W_NONDIGGABLE | W_NONPASSWALL);
229 struct splevstack *st;
233 st->depth_alloc = SPLEV_STACK_RESERVE;
235 (struct opvar **) alloc(st->depth_alloc * sizeof(struct opvar *));
241 struct splevstack *st;
246 if (st->stackdata && st->depth) {
247 for (i = 0; i < st->depth; i++) {
248 switch (st->stackdata[i]->spovartyp) {
258 case SPOVAR_VARIABLE:
261 Free(st->stackdata[i]->vardata.str);
262 st->stackdata[i]->vardata.str = NULL;
265 Free(st->stackdata[i]);
266 st->stackdata[i] = NULL;
270 st->stackdata = NULL;
271 st->depth = st->depth_alloc = 0;
277 splev_stack_push(st, v)
278 struct splevstack *st;
284 panic("splev_stack_push: no stackdata allocated?");
286 if (st->depth >= st->depth_alloc) {
287 struct opvar **tmp = (struct opvar **) alloc(
288 (st->depth_alloc + SPLEV_STACK_RESERVE) * sizeof(struct opvar *));
290 (void) memcpy(tmp, st->stackdata,
291 st->depth_alloc * sizeof(struct opvar *));
294 st->depth_alloc += SPLEV_STACK_RESERVE;
297 st->stackdata[st->depth] = v;
303 struct splevstack *st;
305 struct opvar *ret = NULL;
310 panic("splev_stack_pop: no stackdata allocated?");
314 ret = st->stackdata[st->depth];
315 st->stackdata[st->depth] = NULL;
318 impossible("splev_stack_pop: empty stack?");
323 splev_stack_reverse(st)
324 struct splevstack *st;
332 panic("splev_stack_reverse: no stackdata allocated?");
333 for (i = 0; i < (st->depth / 2); i++) {
334 tmp = st->stackdata[i];
335 st->stackdata[i] = st->stackdata[st->depth - i - 1];
336 st->stackdata[st->depth - i - 1] = tmp;
341 #define OV_typ(o) (o->spovartyp)
342 #define OV_i(o) (o->vardata.l)
343 #define OV_s(o) (o->vardata.str)
345 #define OV_pop_i(x) (x = splev_stack_getdat(coder, SPOVAR_INT))
346 #define OV_pop_c(x) (x = splev_stack_getdat(coder, SPOVAR_COORD))
347 #define OV_pop_r(x) (x = splev_stack_getdat(coder, SPOVAR_REGION))
348 #define OV_pop_s(x) (x = splev_stack_getdat(coder, SPOVAR_STRING))
349 #define OV_pop(x) (x = splev_stack_getdat_any(coder))
350 #define OV_pop_typ(x, typ) (x = splev_stack_getdat(coder, typ))
356 struct opvar *tmpov = (struct opvar *) alloc(sizeof(struct opvar));
358 tmpov->spovartyp = SPOVAR_STRING;
361 tmpov->vardata.str = (char *) alloc(len + 1);
362 (void) memcpy((genericptr_t) tmpov->vardata.str, (genericptr_t) s,
364 tmpov->vardata.str[len] = '\0';
366 tmpov->vardata.str = NULL;
374 struct opvar *tmpov = (struct opvar *) alloc(sizeof(struct opvar));
376 tmpov->spovartyp = SPOVAR_INT;
377 tmpov->vardata.l = i;
382 opvar_new_coord(x, y)
385 struct opvar *tmpov = (struct opvar *) alloc(sizeof(struct opvar));
387 tmpov->spovartyp = SPOVAR_COORD;
388 tmpov->vardata.l = SP_COORD_PACK(x, y);
394 opvar_new_region(x1,y1,x2,y2)
397 struct opvar *tmpov = (struct opvar *)alloc(sizeof (struct opvar));
399 tmpov->spovartyp = SPOVAR_REGION;
400 tmpov->vardata.l = SP_REGION_PACK(x1,y1,x2,y2);
411 switch (ov->spovartyp) {
419 case SPOVAR_VARIABLE:
422 Free(ov->vardata.str);
425 impossible("Unknown opvar value type (%i)!", ov->spovartyp);
431 * Name of current function for use in messages:
432 * __func__ -- C99 standard;
433 * __FUNCTION__ -- gcc extension, starting before C99 and continuing after;
434 * picked up by other compilers (or vice versa?);
435 * __FUNC__ -- supported by Borland;
436 * nhFunc -- slightly intrusive but fully portable nethack construct
437 * for any version of any compiler.
439 #define opvar_free(ov) \
445 impossible("opvar_free(), %s", nhFunc); \
455 panic("no opvar to clone");
456 tmpov = (struct opvar *) alloc(sizeof(struct opvar));
457 tmpov->spovartyp = ov->spovartyp;
458 switch (ov->spovartyp) {
465 tmpov->vardata.l = ov->vardata.l;
467 case SPOVAR_VARIABLE:
470 tmpov->vardata.str = dupstr(ov->vardata.str);
473 impossible("Unknown push value type (%i)!", ov->spovartyp);
479 opvar_var_conversion(coder, ov)
480 struct sp_coder *coder;
483 static const char nhFunc[] = "opvar_var_conversion";
484 struct splev_var *tmp;
486 struct opvar *array_idx = NULL;
490 if (ov->spovartyp != SPOVAR_VARIABLE)
492 tmp = coder->frame->variables;
494 if (!strcmp(tmp->name, OV_s(ov))) {
495 if ((tmp->svtyp & SPOVAR_ARRAY)) {
496 array_idx = opvar_var_conversion(coder,
497 splev_stack_pop(coder->stack));
498 if (!array_idx || OV_typ(array_idx) != SPOVAR_INT)
499 panic("array idx not an int");
500 if (tmp->array_len < 1)
501 panic("array len < 1");
502 OV_i(array_idx) = (OV_i(array_idx) % tmp->array_len);
503 tmpov = opvar_clone(tmp->data.arrayvalues[OV_i(array_idx)]);
504 opvar_free(array_idx);
507 tmpov = opvar_clone(tmp->data.value);
517 opvar_var_defined(coder, name)
518 struct sp_coder *coder;
521 struct splev_var *tmp;
525 tmp = coder->frame->variables;
527 if (!strcmp(tmp->name, name))
535 splev_stack_getdat(coder, typ)
536 struct sp_coder *coder;
539 static const char nhFunc[] = "splev_stack_getdat";
540 if (coder && coder->stack) {
541 struct opvar *tmp = splev_stack_pop(coder->stack);
542 struct opvar *ret = NULL;
545 panic("no value type %i in stack.", typ);
546 if (tmp->spovartyp == SPOVAR_VARIABLE) {
547 ret = opvar_var_conversion(coder, tmp);
551 if (tmp->spovartyp == typ)
553 else opvar_free(tmp);
559 splev_stack_getdat_any(coder)
560 struct sp_coder *coder;
562 static const char nhFunc[] = "splev_stack_getdat_any";
563 if (coder && coder->stack) {
564 struct opvar *tmp = splev_stack_pop(coder->stack);
565 if (tmp && tmp->spovartyp == SPOVAR_VARIABLE) {
566 struct opvar *ret = opvar_var_conversion(coder, tmp);
576 variable_list_del(varlist)
577 struct splev_var *varlist;
579 static const char nhFunc[] = "variable_list_del";
580 struct splev_var *tmp = varlist;
586 if ((tmp->svtyp & SPOVAR_ARRAY)) {
587 long idx = tmp->array_len;
590 opvar_free(tmp->data.arrayvalues[idx]);
592 Free(tmp->data.arrayvalues);
594 opvar_free(tmp->data.value);
603 lvlfill_maze_grid(x1, y1, x2, y2, filling)
609 for (x = x1; x <= x2; x++)
610 for (y = y1; y <= y2; y++) {
611 if (level.flags.corrmaze)
612 levl[x][y].typ = STONE;
615 (y < 2 || ((x % 2) && (y % 2))) ? STONE : filling;
620 lvlfill_solid(filling, lit)
625 for (x = 2; x <= x_maze_max; x++)
626 for (y = 0; y <= y_maze_max; y++) {
627 SET_TYPLIT(x, y, filling, lit);
632 * Make walls of the area (x1, y1, x2, y2) non diggable/non passwall-able
635 set_wall_property(x1, y1, x2, y2, prop)
636 xchar x1, y1, x2, y2;
641 for (y = max(y1, 0); y <= min(y2, ROWNO - 1); y++)
642 for (x = max(x1, 0); x <= min(x2, COLNO - 1); x++)
643 if (IS_STWALL(levl[x][y].typ) || IS_TREE(levl[x][y].typ))
644 levl[x][y].wall_info |= prop;
653 /* shuffle 3 alignments */
656 ralign[2] = ralign[i];
660 ralign[1] = ralign[0];
666 * Count the different features (sinks, fountains) in the level.
673 level.flags.nfountains = level.flags.nsinks = 0;
674 for (y = 0; y < ROWNO; y++)
675 for (x = 0; x < COLNO; x++) {
676 int typ = levl[x][y].typ;
678 level.flags.nfountains++;
679 else if (typ == SINK)
680 level.flags.nsinks++;
685 remove_boundary_syms()
688 * If any CROSSWALLs are found, must change to ROOM after REGION's
689 * are laid out. CROSSWALLS are used to specify "invisible"
690 * boundaries where DOOR syms look bad or aren't desirable.
693 boolean has_bounds = FALSE;
695 for (x = 0; x < COLNO - 1; x++)
696 for (y = 0; y < ROWNO - 1; y++)
697 if (levl[x][y].typ == CROSSWALL) {
702 for (x = 0; x < x_maze_max; x++)
703 for (y = 0; y < y_maze_max; y++)
704 if ((levl[x][y].typ == CROSSWALL) && SpLev_Map[x][y])
705 levl[x][y].typ = ROOM;
710 maybe_add_door(x, y, droom)
712 struct mkroom *droom;
714 if (droom->hx >= 0 && doorindex < DOORMAX && inside_room(droom, x, y))
715 add_door(x, y, droom);
724 for (y = 0; y < ROWNO; y++)
725 for (x = 0; x < COLNO; x++)
726 if (IS_DOOR(levl[x][y].typ) || levl[x][y].typ == SDOOR) {
727 for (tmpi = 0; tmpi < nroom; tmpi++) {
728 maybe_add_door(x, y, &rooms[tmpi]);
729 for (m = 0; m < rooms[tmpi].nsubrooms; m++) {
730 maybe_add_door(x, y, rooms[tmpi].sbrooms[m]);
741 for (tmpi = 0; tmpi < nroom; tmpi++) {
743 if (rooms[tmpi].needfill)
744 fill_room(&rooms[tmpi], (rooms[tmpi].needfill == 2));
745 for (m = 0; m < rooms[tmpi].nsubrooms; m++)
746 if (rooms[tmpi].sbrooms[m]->needfill)
747 fill_room(rooms[tmpi].sbrooms[m], FALSE);
752 * Choose randomly the state (nodoor, open, closed or locked) for a door
764 * Select a random trap
772 rtrap = rnd(TRAPNUM - 1);
774 case HOLE: /* no random holes on special levels */
775 case VIBRATING_SQUARE:
780 if (!Can_dig_down(&u.uz))
785 if (level.flags.noteleport)
788 case ROLLING_BOULDER_TRAP:
790 if (In_endgame(&u.uz))
794 } while (rtrap == NO_TRAP);
799 * Coordinates in special level files are handled specially:
801 * if x or y is < 0, we generate a random coordinate.
802 * The "humidity" flag is used to insure that engravings aren't
803 * created underwater, or eels on dry land.
806 get_location(x, y, humidity, croom)
809 struct mkroom *croom;
817 sx = croom->hx - mx + 1;
818 sy = croom->hy - my + 1;
826 if (*x >= 0) { /* normal locations */
829 } else { /* random location */
831 if (croom) { /* handle irregular areas */
833 somexy(croom, &tmpc);
837 *x = mx + rn2((int) sx);
838 *y = my + rn2((int) sy);
840 if (is_ok_location(*x, *y, humidity))
842 } while (++cpt < 100);
847 for (xx = 0; xx < sx; xx++)
848 for (yy = 0; yy < sy; yy++) {
851 if (is_ok_location(*x, *y, humidity))
854 if (!(humidity & NO_LOC_WARN)) {
855 impossible("get_location: can't find a place!");
864 if (!(humidity & ANY_LOC) && !isok(*x, *y)) {
865 if (!(humidity & NO_LOC_WARN)) {
866 /*warning("get_location: (%d,%d) out of bounds", *x, *y);*/
876 is_ok_location(x, y, humidity)
878 register int humidity;
882 if (Is_waterlevel(&u.uz))
883 return TRUE; /* accept any spot */
885 /* TODO: Should perhaps check if wall is diggable/passwall? */
886 if (humidity & ANY_LOC)
889 if ((humidity & SOLID) && IS_ROCK(levl[x][y].typ))
892 if (humidity & DRY) {
893 typ = levl[x][y].typ;
894 if (typ == ROOM || typ == AIR || typ == CLOUD || typ == ICE
898 if ((humidity & WET) && is_pool(x, y))
900 if ((humidity & HOT) && is_lava(x, y))
906 get_unpacked_coord(loc, defhumidity)
910 static unpacked_coord c;
912 if (loc & SP_COORD_IS_RANDOM) {
915 c.getloc_flags = (loc & ~SP_COORD_IS_RANDOM);
917 c.getloc_flags = defhumidity;
920 c.getloc_flags = defhumidity;
921 c.x = SP_COORD_X(loc);
922 c.y = SP_COORD_Y(loc);
928 get_location_coord(x, y, humidity, croom, crd)
931 struct mkroom *croom;
936 c = get_unpacked_coord(crd, humidity);
939 get_location(x, y, c.getloc_flags | (c.is_random ? NO_LOC_WARN : 0),
941 if (*x == -1 && *y == -1 && c.is_random)
942 get_location(x, y, humidity, croom);
946 * Get a relative position inside a room.
947 * negative values for x or y means RANDOM!
951 get_room_loc(x, y, croom)
953 struct mkroom *croom;
957 if (*x < 0 && *y < 0) {
958 if (somexy(croom, &c)) {
962 panic("get_room_loc : can't find a place!");
965 *x = rn2(croom->hx - croom->lx + 1);
967 *y = rn2(croom->hy - croom->ly + 1);
974 * Get a relative position inside a room.
975 * negative values for x or y means RANDOM!
978 get_free_room_loc(x, y, croom, pos)
980 struct mkroom *croom;
984 register int trycnt = 0;
986 get_location_coord(&try_x, &try_y, DRY, croom, pos);
987 if (levl[try_x][try_y].typ != ROOM) {
989 try_x = *x, try_y = *y;
990 get_room_loc(&try_x, &try_y, croom);
991 } while (levl[try_x][try_y].typ != ROOM && ++trycnt <= 100);
994 panic("get_free_room_loc: can't find a place!");
996 *x = try_x, *y = try_y;
1000 check_room(lowx, ddx, lowy, ddy, vault)
1001 xchar *lowx, *ddx, *lowy, *ddy;
1004 register int x, y, hix = *lowx + *ddx, hiy = *lowy + *ddy;
1005 register struct rm *lev;
1006 int xlim, ylim, ymax;
1008 xlim = XLIM + (vault ? 1 : 0);
1009 ylim = YLIM + (vault ? 1 : 0);
1015 if (hix > COLNO - 3)
1017 if (hiy > ROWNO - 3)
1020 if (hix <= *lowx || hiy <= *lowy)
1023 /* check area around room (and make room smaller if necessary) */
1024 for (x = *lowx - xlim; x <= hix + xlim; x++) {
1025 if (x <= 0 || x >= COLNO)
1034 for (; y <= ymax; y++) {
1037 debugpline2("strange area [%d,%d] in check_room.", x, y);
1042 *lowx = x + xlim + 1;
1046 *lowy = y + ylim + 1;
1059 * Create a new room.
1060 * This is still very incomplete...
1063 create_room(x, y, w, h, xal, yal, rtype, rlit)
1070 int wtmp, htmp, xaltmp, yaltmp, xtmp, ytmp;
1073 boolean vault = FALSE;
1074 int xlim = XLIM, ylim = YLIM;
1076 if (rtype == -1) /* Is the type random ? */
1079 if (rtype == VAULT) {
1085 /* on low levels the room is lit (usually) */
1086 /* some other rooms may require lighting */
1088 /* is light state random ? */
1090 rlit = (rnd(1 + abs(depth(&u.uz))) < 11 && rn2(77)) ? TRUE : FALSE;
1093 * Here we will try to create a room. If some parameters are
1094 * random we are willing to make several try before we give
1098 xchar xborder, yborder;
1106 /* First case : a totally random room */
1108 if ((xtmp < 0 && ytmp < 0 && wtmp < 0 && xaltmp < 0 && yaltmp < 0)
1110 xchar hx, hy, lx, ly, dx, dy;
1111 r1 = rnd_rect(); /* Get a random rectangle */
1113 if (!r1) { /* No more free rectangles ! */
1114 debugpline0("No more rects...");
1124 dx = 2 + rn2((hx - lx > 28) ? 12 : 8);
1129 xborder = (lx > 0 && hx < COLNO - 1) ? 2 * xlim : xlim + 1;
1130 yborder = (ly > 0 && hy < ROWNO - 1) ? 2 * ylim : ylim + 1;
1131 if (hx - lx < dx + 3 + xborder || hy - ly < dy + 3 + yborder) {
1135 xabs = lx + (lx > 0 ? xlim : 3)
1136 + rn2(hx - (lx > 0 ? lx : 3) - dx - xborder + 1);
1137 yabs = ly + (ly > 0 ? ylim : 2)
1138 + rn2(hy - (ly > 0 ? ly : 2) - dy - yborder + 1);
1139 if (ly == 0 && hy >= (ROWNO - 1) && (!nroom || !rn2(nroom))
1140 && (yabs + dy > ROWNO / 2)) {
1142 if (nroom < 4 && dy > 1)
1145 if (!check_room(&xabs, &dx, &yabs, &dy, vault)) {
1153 r2.hx = xabs + wtmp;
1154 r2.hy = yabs + htmp;
1155 } else { /* Only some parameters are random */
1157 if (xtmp < 0 && ytmp < 0) { /* Position is RANDOM */
1162 if (wtmp < 0 || htmp < 0) { /* Size is RANDOM */
1166 if (xaltmp == -1) /* Horizontal alignment is RANDOM */
1168 if (yaltmp == -1) /* Vertical alignment is RANDOM */
1171 /* Try to generate real (absolute) coordinates here! */
1173 xabs = (((xtmp - 1) * COLNO) / 5) + 1;
1174 yabs = (((ytmp - 1) * ROWNO) / 5) + 1;
1179 xabs += (COLNO / 5) - wtmp;
1182 xabs += ((COLNO / 5) - wtmp) / 2;
1189 yabs += (ROWNO / 5) - htmp;
1192 yabs += ((ROWNO / 5) - htmp) / 2;
1196 if (xabs + wtmp - 1 > COLNO - 2)
1197 xabs = COLNO - wtmp - 3;
1200 if (yabs + htmp - 1 > ROWNO - 2)
1201 yabs = ROWNO - htmp - 3;
1205 /* Try to find a rectangle that fit our room ! */
1209 r2.hx = xabs + wtmp + rndpos;
1210 r2.hy = yabs + htmp + rndpos;
1213 } while (++trycnt <= 100 && !r1);
1214 if (!r1) { /* creation of room failed ? */
1217 split_rects(r1, &r2);
1220 smeq[nroom] = nroom;
1221 add_room(xabs, yabs, xabs + wtmp - 1, yabs + htmp - 1, rlit, rtype,
1224 rooms[nroom].lx = xabs;
1225 rooms[nroom].ly = yabs;
1231 * Create a subroom in room proom at pos x,y with width w & height h.
1232 * x & y are relative to the parent room.
1235 create_subroom(proom, x, y, w, h, rtype, rlit)
1236 struct mkroom *proom;
1241 xchar width, height;
1243 width = proom->hx - proom->lx + 1;
1244 height = proom->hy - proom->ly + 1;
1246 /* There is a minimum size for the parent room */
1247 if (width < 4 || height < 4)
1250 /* Check for random position, size, etc... */
1255 h = rnd(height - 3);
1257 x = rnd(width - w - 1) - 1;
1259 y = rnd(height - h - 1) - 1;
1264 if ((x + w + 1) == width)
1266 if ((y + h + 1) == height)
1271 rlit = (rnd(1 + abs(depth(&u.uz))) < 11 && rn2(77)) ? TRUE : FALSE;
1272 add_subroom(proom, proom->lx + x, proom->ly + y, proom->lx + x + w - 1,
1273 proom->ly + y + h - 1, rlit, rtype, FALSE);
1278 * Create a new door in a room.
1279 * It's placed on a wall (north, south, east or west).
1282 create_door(dd, broom)
1284 struct mkroom *broom;
1287 int trycnt = 0, wtry = 0;
1289 if (dd->secret == -1)
1290 dd->secret = rn2(2);
1292 if (dd->mask == -1) {
1293 /* is it a locked door, closed, or a doorway? */
1297 dd->mask = D_ISOPEN;
1299 dd->mask = D_LOCKED;
1301 dd->mask = D_CLOSED;
1302 if (dd->mask != D_ISOPEN && !rn2(25))
1303 dd->mask |= D_TRAPPED;
1305 dd->mask = D_NODOOR;
1308 dd->mask = D_LOCKED;
1310 dd->mask = D_CLOSED;
1313 dd->mask |= D_TRAPPED;
1318 register int dwall, dpos;
1321 if (dwall == -1) /* The wall is RANDOM */
1322 dwall = 1 << rn2(4);
1326 /* Convert wall and pos into an absolute coordinate! */
1330 if (!(dwall & W_NORTH))
1334 + ((dpos == -1) ? rn2(1 + (broom->hx - broom->lx)) : dpos);
1335 if (IS_ROCK(levl[x][y - 1].typ))
1339 if (!(dwall & W_SOUTH))
1343 + ((dpos == -1) ? rn2(1 + (broom->hx - broom->lx)) : dpos);
1344 if (IS_ROCK(levl[x][y + 1].typ))
1348 if (!(dwall & W_WEST))
1352 + ((dpos == -1) ? rn2(1 + (broom->hy - broom->ly)) : dpos);
1353 if (IS_ROCK(levl[x - 1][y].typ))
1357 if (!(dwall & W_EAST))
1361 + ((dpos == -1) ? rn2(1 + (broom->hy - broom->ly)) : dpos);
1362 if (IS_ROCK(levl[x + 1][y].typ))
1367 panic("create_door: No wall for door!");
1375 } while (++trycnt <= 100);
1377 impossible("create_door: Can't find a proper place!");
1380 levl[x][y].typ = (dd->secret ? SDOOR : DOOR);
1381 levl[x][y].doormask = dd->mask;
1385 * Create a secret door in croom on any one of the specified walls.
1388 create_secret_door(croom, walls)
1389 struct mkroom *croom;
1390 xchar walls; /* any of W_NORTH | W_SOUTH | W_EAST | W_WEST (or W_ANY) */
1392 xchar sx, sy; /* location of the secret door */
1395 for (count = 0; count < 100; count++) {
1396 sx = rn1(croom->hx - croom->lx + 1, croom->lx);
1397 sy = rn1(croom->hy - croom->ly + 1, croom->ly);
1401 if (!(walls & W_NORTH))
1405 case 1: /* bottom */
1406 if (!(walls & W_SOUTH))
1411 if (!(walls & W_EAST))
1416 if (!(walls & W_WEST))
1422 if (okdoor(sx, sy)) {
1423 levl[sx][sy].typ = SDOOR;
1424 levl[sx][sy].doormask = D_CLOSED;
1429 impossible("couldn't create secret door on any walls 0x%x", walls);
1433 * Create a trap in a room.
1436 create_trap(t, croom)
1438 struct mkroom *croom;
1444 get_free_room_loc(&x, &y, croom, t->coord);
1448 get_location_coord(&x, &y, DRY, croom, t->coord);
1449 } while ((levl[x][y].typ == STAIRS || levl[x][y].typ == LADDER)
1450 && ++trycnt <= 100);
1458 mktrap(t->type, 1, (struct mkroom *) 0, &tm);
1462 * Create a monster in a room.
1465 noncoalignment(alignment)
1472 return (k ? -1 : 1);
1473 return (k ? -alignment : 0);
1476 /* attempt to screen out locations where a mimic-as-boulder shouldn't occur */
1478 m_bad_boulder_spot(x, y)
1483 /* avoid trap locations */
1486 /* try to avoid locations which already have a boulder (this won't
1487 actually work; we get called before objects have been placed...) */
1488 if (sobj_at(BOULDER, x, y))
1490 /* avoid closed doors */
1492 if (IS_DOOR(lev->typ) && (lev->doormask & (D_CLOSED | D_LOCKED)) != 0)
1499 create_monster(m, croom)
1501 struct mkroom *croom;
1508 struct permonst *pm;
1512 class = (char) def_char_to_monclass((char) m->class);
1516 if (class == MAXMCLASSES)
1517 panic("create_monster: unknown monster class '%c'", m->class);
1519 amask = (m->align == AM_SPLEV_CO)
1520 ? Align2amask(u.ualignbase[A_ORIGINAL])
1521 : (m->align == AM_SPLEV_NONCO)
1522 ? Align2amask(noncoalignment(u.ualignbase[A_ORIGINAL]))
1523 : (m->align <= -(MAX_REGISTERS + 1))
1525 : (m->align < 0 ? ralign[-m->align - 1] : m->align);
1528 pm = (struct permonst *) 0;
1529 else if (m->id != NON_PM) {
1531 g_mvflags = (unsigned) mvitals[monsndx(pm)].mvflags;
1532 if ((pm->geno & G_UNIQ) && (g_mvflags & G_EXTINCT))
1534 else if (g_mvflags & G_GONE) /* genocided or extinct */
1535 pm = (struct permonst *) 0; /* make random monster */
1537 pm = mkclass(class, G_NOGEN);
1538 /* if we can't get a specific monster type (pm == 0) then the
1539 class has been genocided, so settle for a random monster */
1541 if (In_mines(&u.uz) && pm && your_race(pm)
1542 && (Race_if(PM_DWARF) || Race_if(PM_GNOME)) && rn2(3))
1543 pm = (struct permonst *) 0;
1547 if (pm->mlet == S_EEL || amphibious(pm) || is_swimmer(pm))
1549 if (is_flyer(pm) || is_floater(pm))
1551 if (passes_walls(pm) || noncorporeal(pm))
1555 /* If water-liking monster, first try is without DRY */
1556 get_location_coord(&x, &y, loc | NO_LOC_WARN, croom, m->coord);
1557 if (x == -1 && y == -1) {
1559 get_location_coord(&x, &y, loc, croom, m->coord);
1562 get_location_coord(&x, &y, DRY, croom, m->coord);
1565 /* try to find a close place if someone else is already there */
1566 if (MON_AT(x, y) && enexto(&cc, x, y, pm))
1569 if (m->align != -(MAX_REGISTERS + 2))
1570 mtmp = mk_roamer(pm, Amask2align(amask), x, y, m->peaceful);
1571 else if (PM_ARCHEOLOGIST <= m->id && m->id <= PM_WIZARD)
1572 mtmp = mk_mplayer(pm, x, y, FALSE);
1574 mtmp = makemon(pm, x, y, NO_MM_FLAGS);
1577 x = mtmp->mx, y = mtmp->my; /* sanity precaution */
1579 /* handle specific attributes for some special monsters */
1581 mtmp = christen_monst(mtmp, m->name.str);
1584 * This is currently hardwired for mimics only. It should
1585 * eventually be expanded.
1587 if (m->appear_as.str
1588 && ((mtmp->data->mlet == S_MIMIC) || mtmp->cham)) {
1591 switch (m->appear) {
1594 "create_monster: mon has an appearance, \"%s\", but no type",
1598 case M_AP_FURNITURE:
1599 for (i = 0; i < MAXPCHARS; i++)
1600 if (!strcmp(defsyms[i].explanation, m->appear_as.str))
1602 if (i == MAXPCHARS) {
1603 impossible("create_monster: can't find feature \"%s\"",
1606 mtmp->m_ap_type = M_AP_FURNITURE;
1607 mtmp->mappearance = i;
1612 for (i = 0; i < NUM_OBJECTS; i++)
1613 if (OBJ_NAME(objects[i])
1614 && !strcmp(OBJ_NAME(objects[i]), m->appear_as.str))
1616 if (i == NUM_OBJECTS) {
1617 impossible("create_monster: can't find object \"%s\"",
1620 mtmp->m_ap_type = M_AP_OBJECT;
1621 mtmp->mappearance = i;
1622 /* try to avoid placing mimic boulder on a trap */
1623 if (i == BOULDER && m->x < 0
1624 && m_bad_boulder_spot(x, y)) {
1625 int retrylimit = 10;
1627 remove_monster(x, y);
1631 get_location(&x, &y, DRY, croom);
1632 if (MON_AT(x, y) && enexto(&cc, x, y, pm))
1634 } while (m_bad_boulder_spot(x, y)
1635 && --retrylimit > 0);
1636 place_monster(mtmp, x, y);
1637 /* if we didn't find a good spot
1638 then mimic something else */
1640 set_mimic_sym(mtmp);
1645 case M_AP_MONSTER: {
1648 if (!strcmpi(m->appear_as.str, "random"))
1649 mndx = select_newcham_form(mtmp);
1651 mndx = name_to_mon(m->appear_as.str);
1652 if ((mndx != NON_PM) && (&mons[mndx] != mtmp->data)) {
1653 struct permonst *mdat = &mons[mndx];
1654 struct permonst *olddata = mtmp->data;
1656 mgender_from_permonst(mtmp, mdat);
1657 set_mon_data(mtmp, mdat, 0);
1658 if (emits_light(olddata) != emits_light(mtmp->data)) {
1659 /* used to give light, now doesn't, or vice versa,
1660 or light's range has changed */
1661 if (emits_light(olddata))
1662 del_light_source(LS_MONSTER, (genericptr_t) mtmp);
1663 if (emits_light(mtmp->data))
1664 new_light_source(mtmp->mx, mtmp->my,
1665 emits_light(mtmp->data),
1666 LS_MONSTER, (genericptr_t) mtmp);
1668 if (!mtmp->perminvis || pm_invisible(olddata))
1669 mtmp->perminvis = pm_invisible(mdat);
1675 "create_monster: unimplemented mon appear type [%d,\"%s\"]",
1676 m->appear, m->appear_as.str);
1679 if (does_block(x, y, &levl[x][y]))
1683 if (m->peaceful >= 0) {
1684 mtmp->mpeaceful = m->peaceful;
1685 /* changed mpeaceful again; have to reset malign */
1688 if (m->asleep >= 0) {
1690 /* optimizer bug strikes again */
1692 mtmp->msleeping = 1;
1694 mtmp->msleeping = 0;
1696 mtmp->msleeping = m->asleep;
1700 mtmp->mtrapseen = m->seentraps;
1714 mtmp->minvis = mtmp->perminvis = 1;
1718 mtmp->mblinded = (m->blinded % 127);
1722 mtmp->mfrozen = (m->paralyzed % 127);
1726 mtmp->mfleetim = (m->fleeing % 127);
1729 if (m->has_invent) {
1730 discard_minvent(mtmp);
1731 invent_carrying_monster = mtmp;
1737 * Create an object in a room.
1740 create_object(o, croom)
1742 struct mkroom *croom;
1747 boolean named; /* has a name been supplied in level description? */
1749 named = o->name.str ? TRUE : FALSE;
1751 get_location_coord(&x, &y, DRY, croom, o->coord);
1759 otmp = mkobj_at(RANDOM_CLASS, x, y, !named);
1760 else if (o->id != -1)
1761 otmp = mksobj_at(o->id, x, y, TRUE, !named);
1764 * The special levels are compiled with the default "text" object
1765 * class characters. We must convert them to the internal format.
1767 char oclass = (char) def_char_to_objclass(c);
1769 if (oclass == MAXOCLASSES)
1770 panic("create_object: unexpected object class '%c'", c);
1772 /* KMH -- Create piles of gold properly */
1773 if (oclass == COIN_CLASS)
1774 otmp = mkgold(0L, x, y);
1776 otmp = mkobj_at(oclass, x, y, !named);
1779 if (o->spe != -127) /* That means NOT RANDOM! */
1780 otmp->spe = (schar) o->spe;
1782 switch (o->curse_state) {
1785 break; /* BLESSED */
1789 break; /* uncursed */
1794 break; /* Otherwise it's random and we're happy
1795 * with what mkobj gave us! */
1798 /* corpsenm is "empty" if -1, random if -2, otherwise specific */
1799 if (o->corpsenm != NON_PM) {
1800 if (o->corpsenm == NON_PM - 1)
1801 set_corpsenm(otmp, rndmonnum());
1803 set_corpsenm(otmp, o->corpsenm);
1805 /* set_corpsenm() took care of egg hatch and corpse timers */
1808 otmp = oname(otmp, o->name.str);
1811 if (o->eroded < 0) {
1812 otmp->oerodeproof = 1;
1814 otmp->oeroded = (o->eroded % 4);
1815 otmp->oeroded2 = ((o->eroded >> 2) % 4);
1819 otmp->recharged = (o->recharged % 8);
1822 } else if (o->broken) {
1824 otmp->olocked = 0; /* obj generation may set */
1830 #ifdef INVISIBLE_OBJECTS
1835 if (o->quan > 0 && objects[otmp->otyp].oc_merge) {
1836 otmp->quan = o->quan;
1837 otmp->owt = weight(otmp);
1841 if (o->containment & SP_OBJ_CONTENT) {
1842 if (!container_idx) {
1843 if (!invent_carrying_monster) {
1844 /*impossible("create_object: no container");*/
1845 /* don't complain, the monster may be gone legally
1846 (eg. unique demon already generated)
1847 TODO: In the case of unique demon lords, they should
1848 get their inventories even when they get generated
1849 outside the des-file. Maybe another data file that
1850 determines what inventories monsters get by default?
1854 struct obj *objcheck = otmp;
1857 for (ci = 0; ci < container_idx; ci++)
1858 if (container_obj[ci] == objcheck)
1860 remove_object(otmp);
1861 if (mpickobj(invent_carrying_monster, otmp)) {
1864 "container given to monster was merged or deallocated.");
1865 for (ci = inuse; ci < container_idx - 1; ci++)
1866 container_obj[ci] = container_obj[ci + 1];
1867 container_obj[container_idx] = NULL;
1870 /* we lost track of it. */
1875 remove_object(otmp);
1876 if (container_obj[container_idx - 1])
1877 (void) add_to_container(container_obj[container_idx - 1],
1880 obj_extract_self(otmp);
1887 if (o->containment & SP_OBJ_CONTAINER) {
1888 delete_contents(otmp);
1889 if (container_idx < MAX_CONTAINMENT) {
1890 container_obj[container_idx] = otmp;
1893 impossible("create_object: too deeply nested containers.");
1896 /* Medusa level special case: statues are petrified monsters, so they
1897 * are not stone-resistant and have monster inventory. They also lack
1898 * other contents, but that can be specified as an empty container.
1900 if (o->id == STATUE && Is_medusa_level(&u.uz) && o->corpsenm == NON_PM) {
1904 int i = 0; /* prevent endless loop in case makemon always fails */
1906 /* Named random statues are of player types, and aren't stone-
1907 * resistant (if they were, we'd have to reset the name as well as
1908 * setting corpsenm).
1910 for (wastyp = otmp->corpsenm; i < 1000; i++, wastyp = rndmonnum()) {
1911 /* makemon without rndmonst() might create a group */
1912 was = makemon(&mons[wastyp], 0, 0, MM_NOCOUNTBIRTH);
1914 if (!resists_ston(was)) {
1915 (void) propagate(wastyp, TRUE, FALSE);
1923 set_corpsenm(otmp, wastyp);
1924 while (was->minvent) {
1927 obj_extract_self(obj);
1928 (void) add_to_container(otmp, obj);
1930 otmp->owt = weight(otmp);
1935 /* Nasty hack here: try to determine if this is the Mines or Sokoban
1936 * "prize" and then set record_achieve_special (maps to corpsenm)
1937 * for the object. That field will later be checked to find out if
1938 * the player obtained the prize. */
1939 if (otmp->otyp == LUCKSTONE && Is_mineend_level(&u.uz)) {
1940 otmp->record_achieve_special = 1;
1941 } else if ((otmp->otyp == AMULET_OF_REFLECTION
1942 || otmp->otyp == BAG_OF_HOLDING)
1943 && Is_sokoend_level(&u.uz)) {
1944 otmp->record_achieve_special = 1;
1950 begin_burn(otmp, FALSE);
1956 (void) bury_an_obj(otmp, &dealloced);
1957 if (dealloced && container_idx) {
1958 container_obj[container_idx - 1] = NULL;
1964 * Create an altar in a room.
1967 create_altar(a, croom)
1969 struct mkroom *croom;
1973 boolean croom_is_temple = TRUE;
1977 get_free_room_loc(&x, &y, croom, a->coord);
1978 if (croom->rtype != TEMPLE)
1979 croom_is_temple = FALSE;
1981 get_location_coord(&x, &y, DRY, croom, a->coord);
1982 if ((sproom = (schar) *in_rooms(x, y, TEMPLE)) != 0)
1983 croom = &rooms[sproom - ROOMOFFSET];
1985 croom_is_temple = FALSE;
1988 /* check for existing features */
1989 oldtyp = levl[x][y].typ;
1990 if (oldtyp == STAIRS || oldtyp == LADDER)
1993 /* Is the alignment random ?
1994 * If so, it's an 80% chance that the altar will be co-aligned.
1996 * The alignment is encoded as amask values instead of alignment
1997 * values to avoid conflicting with the rest of the encoding,
1998 * shared by many other parts of the special level code.
2000 amask = (a->align == AM_SPLEV_CO)
2001 ? Align2amask(u.ualignbase[A_ORIGINAL])
2002 : (a->align == AM_SPLEV_NONCO)
2003 ? Align2amask(noncoalignment(u.ualignbase[A_ORIGINAL]))
2004 : (a->align == -(MAX_REGISTERS + 1))
2006 : (a->align < 0 ? ralign[-a->align - 1] : a->align);
2008 levl[x][y].typ = ALTAR;
2009 levl[x][y].altarmask = amask;
2012 a->shrine = rn2(2); /* handle random case */
2014 if (!croom_is_temple || !a->shrine)
2017 if (a->shrine) { /* Is it a shrine or sanctum? */
2018 priestini(&u.uz, croom, x, y, (a->shrine > 1));
2019 levl[x][y].altarmask |= AM_SHRINE;
2020 level.flags.has_temple = TRUE;
2025 replace_terrain(terr, croom)
2026 replaceterrain *terr;
2027 struct mkroom *croom;
2029 schar x, y, x1, y1, x2, y2;
2031 if (terr->toter >= MAX_TYPE)
2036 get_location(&x1, &y1, ANY_LOC, croom);
2040 get_location(&x2, &y2, ANY_LOC, croom);
2042 for (x = max(x1, 0); x <= min(x2, COLNO - 1); x++)
2043 for (y = max(y1, 0); y <= min(y2, ROWNO - 1); y++)
2044 if (levl[x][y].typ == terr->fromter && rn2(100) < terr->chance) {
2045 SET_TYPLIT(x, y, terr->toter, terr->tolit);
2050 * Search for a door in a room on a specified wall.
2053 search_door(croom, x, y, wall, cnt)
2054 struct mkroom *croom;
2088 dx = dy = xx = yy = 0;
2089 panic("search_door: Bad wall!");
2092 while (xx <= croom->hx + 1 && yy <= croom->hy + 1) {
2093 if (IS_DOOR(levl[xx][yy].typ) || levl[xx][yy].typ == SDOOR) {
2106 * Dig a corridor between two points.
2109 dig_corridor(org, dest, nxcor, ftyp, btyp)
2114 int dx = 0, dy = 0, dix, diy, cct;
2122 if (xx <= 0 || yy <= 0 || tx <= 0 || ty <= 0 || xx > COLNO - 1
2123 || tx > COLNO - 1 || yy > ROWNO - 1 || ty > ROWNO - 1) {
2124 debugpline4("dig_corridor: bad coords <%d,%d> <%d,%d>.",
2140 while (xx != tx || yy != ty) {
2141 /* loop: dig corridor at [xx,yy] and find new [xx,yy] */
2142 if (cct++ > 500 || (nxcor && !rn2(35)))
2148 if (xx >= COLNO - 1 || xx <= 0 || yy <= 0 || yy >= ROWNO - 1)
2149 return FALSE; /* impossible */
2151 crm = &levl[xx][yy];
2152 if (crm->typ == btyp) {
2153 if (ftyp != CORR || rn2(100)) {
2155 if (nxcor && !rn2(50))
2156 (void) mksobj_at(BOULDER, xx, yy, TRUE, FALSE);
2160 } else if (crm->typ != ftyp && crm->typ != SCORR) {
2165 /* find next corridor position */
2169 if ((dix > diy) && diy && !rn2(dix-diy+1)) {
2171 } else if ((diy > dix) && dix && !rn2(diy-dix+1)) {
2175 /* do we have to change direction ? */
2176 if (dy && dix > diy) {
2177 register int ddx = (xx > tx) ? -1 : 1;
2179 crm = &levl[xx + ddx][yy];
2180 if (crm->typ == btyp || crm->typ == ftyp || crm->typ == SCORR) {
2185 } else if (dx && diy > dix) {
2186 register int ddy = (yy > ty) ? -1 : 1;
2188 crm = &levl[xx][yy + ddy];
2189 if (crm->typ == btyp || crm->typ == ftyp || crm->typ == SCORR) {
2196 /* continue straight on? */
2197 crm = &levl[xx + dx][yy + dy];
2198 if (crm->typ == btyp || crm->typ == ftyp || crm->typ == SCORR)
2201 /* no, what must we do now?? */
2204 dy = (ty < yy) ? -1 : 1;
2207 dx = (tx < xx) ? -1 : 1;
2209 crm = &levl[xx + dx][yy + dy];
2210 if (crm->typ == btyp || crm->typ == ftyp || crm->typ == SCORR)
2219 * Disgusting hack: since special levels have their rooms filled before
2220 * sorting the rooms, we have to re-arrange the speed values upstairs_room
2221 * and dnstairs_room after the rooms have been sorted. On normal levels,
2222 * stairs don't get created until _after_ sorting takes place.
2228 struct mkroom *croom;
2231 && !((dnstairs_room->lx <= xdnstair && xdnstair <= dnstairs_room->hx)
2232 && (dnstairs_room->ly <= ydnstair
2233 && ydnstair <= dnstairs_room->hy))) {
2234 for (i = 0; i < nroom; i++) {
2236 if ((croom->lx <= xdnstair && xdnstair <= croom->hx)
2237 && (croom->ly <= ydnstair && ydnstair <= croom->hy)) {
2238 dnstairs_room = croom;
2243 panic("Couldn't find dnstair room in fix_stair_rooms!");
2246 && !((upstairs_room->lx <= xupstair && xupstair <= upstairs_room->hx)
2247 && (upstairs_room->ly <= yupstair
2248 && yupstair <= upstairs_room->hy))) {
2249 for (i = 0; i < nroom; i++) {
2251 if ((croom->lx <= xupstair && xupstair <= croom->hx)
2252 && (croom->ly <= yupstair && yupstair <= croom->hy)) {
2253 upstairs_room = croom;
2258 panic("Couldn't find upstair room in fix_stair_rooms!");
2263 * Corridors always start from a door. But it can end anywhere...
2264 * Basically we search for door coordinates or for endpoints coordinates
2265 * (from a distance).
2273 if (c->src.room == -1) {
2275 makecorridors(); /*makecorridors(c->src.door);*/
2279 if (!search_door(&rooms[c->src.room], &org.x, &org.y, c->src.wall,
2283 if (c->dest.room != -1) {
2284 if (!search_door(&rooms[c->dest.room], &dest.x, &dest.y, c->dest.wall,
2287 switch (c->src.wall) {
2301 switch (c->dest.wall) {
2315 (void) dig_corridor(&org, &dest, FALSE, CORR, STONE);
2320 * Fill a room (shop, zoo, etc...) with appropriate stuff.
2323 fill_room(croom, prefilled)
2324 struct mkroom *croom;
2327 if (!croom || croom->rtype == OROOM)
2334 if (croom->rtype >= SHOPBASE) {
2335 stock_room(croom->rtype - SHOPBASE, croom);
2336 level.flags.has_shop = TRUE;
2340 switch (croom->rtype) {
2342 for (x = croom->lx; x <= croom->hx; x++)
2343 for (y = croom->ly; y <= croom->hy; y++)
2344 (void) mkgold((long) rn1(abs(depth(&u.uz)) * 100, 51),
2356 switch (croom->rtype) {
2358 level.flags.has_vault = TRUE;
2361 level.flags.has_zoo = TRUE;
2364 level.flags.has_court = TRUE;
2367 level.flags.has_morgue = TRUE;
2370 level.flags.has_beehive = TRUE;
2373 level.flags.has_barracks = TRUE;
2376 level.flags.has_temple = TRUE;
2379 level.flags.has_swamp = TRUE;
2390 struct mkroom *aroom;
2391 xchar rtype = (!r->chance || rn2(100) < r->chance) ? r->rtype : OROOM;
2394 aroom = &subrooms[nsubroom];
2395 okroom = create_subroom(mkr, r->x, r->y, r->w, r->h, rtype, r->rlit);
2397 aroom = &rooms[nroom];
2398 okroom = create_room(r->x, r->y, r->w, r->h, r->xalign, r->yalign,
2403 #ifdef SPECIALIZATION
2404 topologize(aroom, FALSE); /* set roomno */
2406 topologize(aroom); /* set roomno */
2408 aroom->needfill = r->filled;
2409 aroom->needjoining = r->joined;
2412 return (struct mkroom *) 0;
2416 * set lighting in a region that will not become a room.
2419 light_region(tmpregion)
2422 register boolean litstate = tmpregion->rlit ? 1 : 0;
2423 register int hiy = tmpregion->y2;
2425 register struct rm *lev;
2426 int lowy = tmpregion->y1;
2427 int lowx = tmpregion->x1, hix = tmpregion->x2;
2430 /* adjust region size for walls, but only if lighted */
2431 lowx = max(lowx - 1, 1);
2432 hix = min(hix + 1, COLNO - 1);
2433 lowy = max(lowy - 1, 0);
2434 hiy = min(hiy + 1, ROWNO - 1);
2436 for (x = lowx; x <= hix; x++) {
2437 lev = &levl[x][lowy];
2438 for (y = lowy; y <= hiy; y++) {
2439 if (lev->typ != LAVAPOOL) /* this overrides normal lighting */
2440 lev->lit = litstate;
2447 wallify_map(x1, y1, x2, y2)
2450 int x, y, xx, yy, lo_xx, lo_yy, hi_xx, hi_yy;
2452 for (y = y1; y <= y2; y++) {
2453 lo_yy = (y > 0) ? y - 1 : 0;
2454 hi_yy = (y < y2) ? y + 1 : y2;
2455 for (x = x1; x <= x2; x++) {
2456 if (levl[x][y].typ != STONE)
2458 lo_xx = (x > 0) ? x - 1 : 0;
2459 hi_xx = (x < x2) ? x + 1 : x2;
2460 for (yy = lo_yy; yy <= hi_yy; yy++)
2461 for (xx = lo_xx; xx <= hi_xx; xx++)
2462 if (IS_ROOM(levl[xx][yy].typ)
2463 || levl[xx][yy].typ == CROSSWALL) {
2464 levl[x][y].typ = (yy != y) ? HWALL : VWALL;
2465 yy = hi_yy; /* end `yy' loop */
2466 break; /* end `xx' loop */
2473 * Select a random coordinate in the maze.
2475 * We want a place not 'touched' by the loader. That is, a place in
2476 * the maze outside every part of the special level.
2479 maze1xy(m, humidity)
2483 register int x, y, tryct = 2000;
2484 /* tryct: normally it won't take more than ten or so tries due
2485 to the circumstances under which we'll be called, but the
2486 `humidity' screening might drastically change the chances */
2489 x = rn1(x_maze_max - 3, 3);
2490 y = rn1(y_maze_max - 3, 3);
2492 break; /* give up */
2493 } while (!(x % 2) || !(y % 2) || SpLev_Map[x][y]
2494 || !is_ok_location((schar) x, (schar) y, humidity));
2496 m->x = (xchar) x, m->y = (xchar) y;
2500 * If there's a significant portion of maze unused by the special level,
2501 * we don't want it empty.
2503 * Makes the number of traps, monsters, etc. proportional
2504 * to the size of the maze.
2509 int mapcountmax, mapcount, mapfact;
2513 mapcountmax = mapcount = (x_maze_max - 2) * (y_maze_max - 2);
2514 mapcountmax = mapcountmax / 2;
2516 for (x = 2; x < x_maze_max; x++)
2517 for (y = 0; y < y_maze_max; y++)
2518 if (SpLev_Map[x][y])
2521 if ((mapcount > (int) (mapcountmax / 10))) {
2522 mapfact = (int) ((mapcount * 100L) / mapcountmax);
2523 for (x = rnd((int) (20 * mapfact) / 100); x; x--) {
2525 (void) mkobj_at(rn2(2) ? GEM_CLASS : RANDOM_CLASS, mm.x, mm.y,
2528 for (x = rnd((int) (12 * mapfact) / 100); x; x--) {
2530 (void) mksobj_at(BOULDER, mm.x, mm.y, TRUE, FALSE);
2532 for (x = rn2(2); x; x--) {
2534 (void) makemon(&mons[PM_MINOTAUR], mm.x, mm.y, NO_MM_FLAGS);
2536 for (x = rnd((int) (12 * mapfact) / 100); x; x--) {
2538 (void) makemon((struct permonst *) 0, mm.x, mm.y, NO_MM_FLAGS);
2540 for (x = rn2((int) (15 * mapfact) / 100); x; x--) {
2542 (void) mkgold(0L, mm.x, mm.y);
2544 for (x = rn2((int) (15 * mapfact) / 100); x; x--) {
2548 trytrap = rndtrap();
2549 if (sobj_at(BOULDER, mm.x, mm.y))
2550 while (trytrap == PIT || trytrap == SPIKED_PIT
2551 || trytrap == TRAPDOOR || trytrap == HOLE)
2552 trytrap = rndtrap();
2553 (void) maketrap(mm.x, mm.y, trytrap);
2559 * special level loader
2562 sp_level_loader(fd, lvl)
2567 struct opvar *opdat;
2570 Fread((genericptr_t) & (lvl->n_opcodes), 1, sizeof(lvl->n_opcodes), fd);
2571 lvl->opcodes = (_opcode *) alloc(sizeof(_opcode) * (lvl->n_opcodes));
2573 while (n_opcode < lvl->n_opcodes) {
2574 Fread((genericptr_t) &lvl->opcodes[n_opcode].opcode, 1,
2575 sizeof(lvl->opcodes[n_opcode].opcode), fd);
2576 opcode = lvl->opcodes[n_opcode].opcode;
2580 if (opcode < SPO_NULL || opcode >= MAX_SP_OPCODES)
2581 panic("sp_level_loader: impossible opcode %i.", opcode);
2583 if (opcode == SPO_PUSH) {
2585 struct opvar *ov = (struct opvar *) alloc(sizeof(struct opvar));
2588 ov->spovartyp = SPO_NULL;
2590 Fread((genericptr_t) & (ov->spovartyp), 1, sizeof(ov->spovartyp),
2593 switch (ov->spovartyp) {
2598 case SPOVAR_MAPCHAR:
2602 Fread((genericptr_t) & (ov->vardata.l), 1,
2603 sizeof(ov->vardata.l), fd);
2605 case SPOVAR_VARIABLE:
2610 Fread((genericptr_t) &nsize, 1, sizeof(nsize), fd);
2611 opd = (char *) alloc(nsize + 1);
2614 Fread(opd, 1, nsize, fd);
2616 ov->vardata.str = opd;
2620 panic("sp_level_loader: unknown opvar type %i",
2625 lvl->opcodes[n_opcode].opdat = opdat;
2632 /* Frees the memory allocated for special level creation structs */
2637 static const char nhFunc[] = "sp_level_free";
2640 while (n_opcode < lvl->n_opcodes) {
2641 int opcode = lvl->opcodes[n_opcode].opcode;
2642 struct opvar *opdat = lvl->opcodes[n_opcode].opdat;
2644 if (opcode < SPO_NULL || opcode >= MAX_SP_OPCODES)
2645 panic("sp_level_free: unknown opcode %i", opcode);
2652 lvl->opcodes = NULL;
2657 splev_initlev(linit)
2660 switch (linit->init_style) {
2662 impossible("Unrecognized level init style.");
2666 case LVLINIT_SOLIDFILL:
2667 if (linit->lit == -1)
2668 linit->lit = rn2(2);
2669 lvlfill_solid(linit->filling, linit->lit);
2671 case LVLINIT_MAZEGRID:
2672 lvlfill_maze_grid(2, 0, x_maze_max, y_maze_max, linit->filling);
2678 if (linit->lit == -1)
2679 linit->lit = rn2(2);
2680 if (linit->filling > -1)
2681 lvlfill_solid(linit->filling, 0);
2682 linit->icedpools = icedpools;
2692 struct sp_frame *frame =
2693 (struct sp_frame *) alloc(sizeof(struct sp_frame));
2696 frame->variables = NULL;
2697 frame->n_opcode = execptr;
2698 frame->stack = (struct splevstack *) alloc(sizeof(struct splevstack));
2699 splev_stack_init(frame->stack);
2705 struct sp_frame *frame;
2710 splev_stack_done(frame->stack);
2711 frame->stack = NULL;
2713 if (frame->variables) {
2714 variable_list_del(frame->variables);
2715 frame->variables = NULL;
2721 spo_frame_push(coder)
2722 struct sp_coder *coder;
2724 struct sp_frame *tmpframe = frame_new(coder->frame->n_opcode);
2726 tmpframe->next = coder->frame;
2727 coder->frame = tmpframe;
2731 spo_frame_pop(coder)
2732 struct sp_coder *coder;
2734 if (coder->frame && coder->frame->next) {
2735 struct sp_frame *tmpframe = coder->frame->next;
2737 frame_del(coder->frame);
2738 coder->frame = tmpframe;
2739 coder->stack = coder->frame->stack;
2744 sp_code_jmpaddr(curpos, jmpaddr)
2745 long curpos, jmpaddr;
2747 return (curpos + jmpaddr);
2752 struct sp_coder *coder;
2754 static const char nhFunc[] = "spo_call";
2756 struct opvar *params;
2757 struct sp_frame *tmpframe;
2759 if (!OV_pop_i(addr) || !OV_pop_i(params))
2761 if (OV_i(params) < 0)
2764 tmpframe = frame_new(sp_code_jmpaddr(coder->frame->n_opcode,
2767 while (OV_i(params)-- > 0) {
2768 splev_stack_push(tmpframe->stack, splev_stack_getdat_any(coder));
2770 splev_stack_reverse(tmpframe->stack);
2773 tmpframe->next = coder->frame;
2774 coder->frame = tmpframe;
2782 struct sp_coder *coder;
2784 static const char nhFunc[] = "spo_return";
2785 struct opvar *params;
2787 if (!coder->frame || !coder->frame->next)
2788 panic("return: no frame.");
2789 if (!OV_pop_i(params))
2791 if (OV_i(params) < 0)
2794 while (OV_i(params)-- > 0) {
2795 splev_stack_push(coder->frame->next->stack,
2796 splev_stack_pop(coder->stack));
2800 if (coder->frame->next) {
2801 struct sp_frame *tmpframe = coder->frame->next;
2802 frame_del(coder->frame);
2803 coder->frame = tmpframe;
2804 coder->stack = coder->frame->stack;
2812 spo_end_moninvent(coder)
2813 struct sp_coder *coder UNUSED;
2815 if (invent_carrying_monster)
2816 m_dowear(invent_carrying_monster, TRUE);
2817 invent_carrying_monster = NULL;
2822 spo_pop_container(coder)
2823 struct sp_coder *coder UNUSED;
2825 if (container_idx > 0) {
2827 container_obj[container_idx] = NULL;
2833 struct sp_coder *coder;
2835 static const char nhFunc[] = "spo_message";
2846 old_n = lev_message ? (strlen(lev_message) + 1) : 0;
2849 levmsg = (char *) alloc(old_n + n + 1);
2851 levmsg[old_n - 1] = '\n';
2853 (void) memcpy((genericptr_t) levmsg, (genericptr_t) lev_message,
2855 (void) memcpy((genericptr_t) &levmsg[old_n], msg, n);
2856 levmsg[old_n + n] = '\0';
2858 lev_message = levmsg;
2864 struct sp_coder *coder;
2866 static const char nhFunc[] = "spo_monster";
2868 struct opvar *varparam;
2869 struct opvar *id, *mcoord, *has_inv;
2872 tmpmons.peaceful = -1;
2873 tmpmons.asleep = -1;
2874 tmpmons.name.str = (char *) 0;
2876 tmpmons.appear_as.str = (char *) 0;
2877 tmpmons.align = -MAX_REGISTERS - 2;
2880 tmpmons.cancelled = 0;
2881 tmpmons.revived = 0;
2883 tmpmons.fleeing = 0;
2884 tmpmons.blinded = 0;
2885 tmpmons.paralyzed = 0;
2886 tmpmons.stunned = 0;
2887 tmpmons.confused = 0;
2888 tmpmons.seentraps = 0;
2889 tmpmons.has_invent = 0;
2891 if (!OV_pop_i(has_inv))
2894 if (!OV_pop_i(varparam))
2897 while ((nparams++ < (SP_M_V_END + 1)) && (OV_typ(varparam) == SPOVAR_INT)
2898 && (OV_i(varparam) >= 0) && (OV_i(varparam) < SP_M_V_END)) {
2899 struct opvar *parm = NULL;
2902 switch (OV_i(varparam)) {
2904 if ((OV_typ(parm) == SPOVAR_STRING) && !tmpmons.name.str)
2905 tmpmons.name.str = dupstr(OV_s(parm));
2908 if ((OV_typ(parm) == SPOVAR_INT) && !tmpmons.appear_as.str) {
2909 tmpmons.appear = OV_i(parm);
2912 tmpmons.appear_as.str = dupstr(OV_s(parm));
2916 if (OV_typ(parm) == SPOVAR_INT)
2917 tmpmons.asleep = OV_i(parm);
2920 if (OV_typ(parm) == SPOVAR_INT)
2921 tmpmons.align = OV_i(parm);
2923 case SP_M_V_PEACEFUL:
2924 if (OV_typ(parm) == SPOVAR_INT)
2925 tmpmons.peaceful = OV_i(parm);
2928 if (OV_typ(parm) == SPOVAR_INT)
2929 tmpmons.female = OV_i(parm);
2932 if (OV_typ(parm) == SPOVAR_INT)
2933 tmpmons.invis = OV_i(parm);
2935 case SP_M_V_CANCELLED:
2936 if (OV_typ(parm) == SPOVAR_INT)
2937 tmpmons.cancelled = OV_i(parm);
2939 case SP_M_V_REVIVED:
2940 if (OV_typ(parm) == SPOVAR_INT)
2941 tmpmons.revived = OV_i(parm);
2944 if (OV_typ(parm) == SPOVAR_INT)
2945 tmpmons.avenge = OV_i(parm);
2947 case SP_M_V_FLEEING:
2948 if (OV_typ(parm) == SPOVAR_INT)
2949 tmpmons.fleeing = OV_i(parm);
2951 case SP_M_V_BLINDED:
2952 if (OV_typ(parm) == SPOVAR_INT)
2953 tmpmons.blinded = OV_i(parm);
2955 case SP_M_V_PARALYZED:
2956 if (OV_typ(parm) == SPOVAR_INT)
2957 tmpmons.paralyzed = OV_i(parm);
2959 case SP_M_V_STUNNED:
2960 if (OV_typ(parm) == SPOVAR_INT)
2961 tmpmons.stunned = OV_i(parm);
2963 case SP_M_V_CONFUSED:
2964 if (OV_typ(parm) == SPOVAR_INT)
2965 tmpmons.confused = OV_i(parm);
2967 case SP_M_V_SEENTRAPS:
2968 if (OV_typ(parm) == SPOVAR_INT)
2969 tmpmons.seentraps = OV_i(parm);
2972 nparams = SP_M_V_END + 1;
2975 impossible("MONSTER with unknown variable param type!");
2979 if (OV_i(varparam) != SP_M_V_END) {
2980 opvar_free(varparam);
2985 if (!OV_pop_c(mcoord))
2986 panic("no monster coord?");
2988 if (!OV_pop_typ(id, SPOVAR_MONST))
2989 panic("no mon type");
2991 tmpmons.id = SP_MONST_PM(OV_i(id));
2992 tmpmons.class = SP_MONST_CLASS(OV_i(id));
2993 tmpmons.coord = OV_i(mcoord);
2994 tmpmons.has_invent = OV_i(has_inv);
2996 create_monster(&tmpmons, coder->croom);
2998 Free(tmpmons.name.str);
2999 Free(tmpmons.appear_as.str);
3002 opvar_free(has_inv);
3003 opvar_free(varparam);
3008 struct sp_coder *coder;
3010 static const char nhFunc[] = "spo_object";
3013 struct opvar *varparam;
3014 struct opvar *id, *containment;
3018 tmpobj.curse_state = -1;
3019 tmpobj.corpsenm = NON_PM;
3020 tmpobj.name.str = (char *) 0;
3027 tmpobj.recharged = 0;
3031 tmpobj.coord = SP_COORD_PACK_RANDOM(0);
3033 if (!OV_pop_i(containment))
3036 if (!OV_pop_i(varparam))
3039 while ((nparams++ < (SP_O_V_END + 1)) && (OV_typ(varparam) == SPOVAR_INT)
3040 && (OV_i(varparam) >= 0) && (OV_i(varparam) < SP_O_V_END)) {
3043 switch (OV_i(varparam)) {
3045 if ((OV_typ(parm) == SPOVAR_STRING) && !tmpobj.name.str)
3046 tmpobj.name.str = dupstr(OV_s(parm));
3048 case SP_O_V_CORPSENM:
3049 if (OV_typ(parm) == SPOVAR_MONST) {
3050 char monclass = SP_MONST_CLASS(OV_i(parm));
3051 int monid = SP_MONST_PM(OV_i(parm));
3053 if (monid >= 0 && monid < NUMMONS) {
3054 tmpobj.corpsenm = monid;
3055 break; /* we're done! */
3057 struct permonst *pm = (struct permonst *) 0;
3058 if (def_char_to_monclass(monclass) != MAXMCLASSES) {
3059 pm = mkclass(def_char_to_monclass(monclass), G_NOGEN);
3064 tmpobj.corpsenm = monsndx(pm);
3069 if (OV_typ(parm) == SPOVAR_INT)
3070 tmpobj.curse_state = OV_i(parm);
3073 if (OV_typ(parm) == SPOVAR_INT)
3074 tmpobj.spe = OV_i(parm);
3077 if (OV_typ(parm) == SPOVAR_INT)
3078 tmpobj.quan = OV_i(parm);
3081 if (OV_typ(parm) == SPOVAR_INT)
3082 tmpobj.buried = OV_i(parm);
3085 if (OV_typ(parm) == SPOVAR_INT)
3086 tmpobj.lit = OV_i(parm);
3089 if (OV_typ(parm) == SPOVAR_INT)
3090 tmpobj.eroded = OV_i(parm);
3093 if (OV_typ(parm) == SPOVAR_INT)
3094 tmpobj.locked = OV_i(parm);
3096 case SP_O_V_TRAPPED:
3097 if (OV_typ(parm) == SPOVAR_INT)
3098 tmpobj.trapped = OV_i(parm);
3100 case SP_O_V_RECHARGED:
3101 if (OV_typ(parm) == SPOVAR_INT)
3102 tmpobj.recharged = OV_i(parm);
3105 if (OV_typ(parm) == SPOVAR_INT)
3106 tmpobj.invis = OV_i(parm);
3108 case SP_O_V_GREASED:
3109 if (OV_typ(parm) == SPOVAR_INT)
3110 tmpobj.greased = OV_i(parm);
3113 if (OV_typ(parm) == SPOVAR_INT)
3114 tmpobj.broken = OV_i(parm);
3117 if (OV_typ(parm) != SPOVAR_COORD)
3118 panic("no coord for obj?");
3119 tmpobj.coord = OV_i(parm);
3122 nparams = SP_O_V_END + 1;
3125 impossible("OBJECT with unknown variable param type!");
3129 if (OV_i(varparam) != SP_O_V_END) {
3130 opvar_free(varparam);
3135 if (!OV_pop_typ(id, SPOVAR_OBJ))
3136 panic("no obj type");
3138 tmpobj.id = SP_OBJ_TYP(OV_i(id));
3139 tmpobj.class = SP_OBJ_CLASS(OV_i(id));
3140 tmpobj.containment = OV_i(containment);
3142 quancnt = (tmpobj.id > STRANGE_OBJECT) ? tmpobj.quan : 0;
3145 create_object(&tmpobj, coder->croom);
3147 } while ((quancnt > 0) && ((tmpobj.id > STRANGE_OBJECT)
3148 && !objects[tmpobj.id].oc_merge));
3150 Free(tmpobj.name.str);
3151 opvar_free(varparam);
3153 opvar_free(containment);
3157 spo_level_flags(coder)
3158 struct sp_coder *coder;
3160 static const char nhFunc[] = "spo_level_flags";
3161 struct opvar *flagdata;
3164 if (!OV_pop_i(flagdata))
3166 lflags = OV_i(flagdata);
3168 if (lflags & NOTELEPORT)
3169 level.flags.noteleport = 1;
3170 if (lflags & HARDFLOOR)
3171 level.flags.hardfloor = 1;
3172 if (lflags & NOMMAP)
3173 level.flags.nommap = 1;
3174 if (lflags & SHORTSIGHTED)
3175 level.flags.shortsighted = 1;
3176 if (lflags & ARBOREAL)
3177 level.flags.arboreal = 1;
3178 if (lflags & MAZELEVEL)
3179 level.flags.is_maze_lev = 1;
3180 if (lflags & PREMAPPED)
3181 coder->premapped = TRUE;
3182 if (lflags & SHROUD)
3183 level.flags.hero_memory = 0;
3184 if (lflags & GRAVEYARD)
3185 level.flags.graveyard = 1;
3186 if (lflags & ICEDPOOLS)
3188 if (lflags & SOLIDIFY)
3189 coder->solidify = TRUE;
3190 if (lflags & CORRMAZE)
3191 level.flags.corrmaze = TRUE;
3192 if (lflags & CHECK_INACCESSIBLES)
3193 coder->check_inaccessibles = TRUE;
3195 opvar_free(flagdata);
3199 spo_initlevel(coder)
3200 struct sp_coder *coder;
3202 static const char nhFunc[] = "spo_initlevel";
3204 struct opvar *init_style, *fg, *bg, *smoothed, *joined, *lit, *walled,
3207 if (!OV_pop_i(fg) || !OV_pop_i(bg) || !OV_pop_i(smoothed)
3208 || !OV_pop_i(joined) || !OV_pop_i(lit) || !OV_pop_i(walled)
3209 || !OV_pop_i(filling) || !OV_pop_i(init_style))
3212 splev_init_present = TRUE;
3214 init_lev.init_style = OV_i(init_style);
3215 init_lev.fg = OV_i(fg);
3216 init_lev.bg = OV_i(bg);
3217 init_lev.smoothed = OV_i(smoothed);
3218 init_lev.joined = OV_i(joined);
3219 init_lev.lit = OV_i(lit);
3220 init_lev.walled = OV_i(walled);
3221 init_lev.filling = OV_i(filling);
3223 coder->lvl_is_joined = OV_i(joined);
3225 splev_initlev(&init_lev);
3227 opvar_free(init_style);
3230 opvar_free(smoothed);
3234 opvar_free(filling);
3238 spo_engraving(coder)
3239 struct sp_coder *coder;
3241 static const char nhFunc[] = "spo_engraving";
3242 struct opvar *etyp, *txt, *ecoord;
3245 if (!OV_pop_i(etyp) || !OV_pop_s(txt) || !OV_pop_c(ecoord))
3248 get_location_coord(&x, &y, DRY, coder->croom, OV_i(ecoord));
3249 make_engr_at(x, y, OV_s(txt), 0L, OV_i(etyp));
3257 spo_mineralize(coder)
3258 struct sp_coder *coder;
3260 static const char nhFunc[] = "spo_mineralize";
3261 struct opvar *kelp_pool, *kelp_moat, *gold_prob, *gem_prob;
3263 if (!OV_pop_i(gem_prob) || !OV_pop_i(gold_prob) || !OV_pop_i(kelp_moat)
3264 || !OV_pop_i(kelp_pool))
3267 mineralize(OV_i(kelp_pool), OV_i(kelp_moat), OV_i(gold_prob),
3268 OV_i(gem_prob), TRUE);
3270 opvar_free(gem_prob);
3271 opvar_free(gold_prob);
3272 opvar_free(kelp_moat);
3273 opvar_free(kelp_pool);
3278 struct sp_coder *coder;
3280 static const char nhFunc[] = "spo_room";
3282 if (coder->n_subroom > MAX_NESTED_ROOMS) {
3283 panic("Too deeply nested rooms?!");
3285 struct opvar *rflags, *h, *w, *yalign, *xalign, *y, *x, *rlit,
3288 struct mkroom *tmpcr;
3290 if (!OV_pop_i(h) || !OV_pop_i(w) || !OV_pop_i(y) || !OV_pop_i(x)
3291 || !OV_pop_i(yalign) || !OV_pop_i(xalign) || !OV_pop_i(rflags)
3292 || !OV_pop_i(rlit) || !OV_pop_i(chance) || !OV_pop_i(rtype))
3295 tmproom.x = OV_i(x);
3296 tmproom.y = OV_i(y);
3297 tmproom.w = OV_i(w);
3298 tmproom.h = OV_i(h);
3299 tmproom.xalign = OV_i(xalign);
3300 tmproom.yalign = OV_i(yalign);
3301 tmproom.rtype = OV_i(rtype);
3302 tmproom.chance = OV_i(chance);
3303 tmproom.rlit = OV_i(rlit);
3304 tmproom.filled = (OV_i(rflags) & (1 << 0));
3305 /*tmproom.irregular = (OV_i(rflags) & (1 << 1));*/
3306 tmproom.joined = !(OV_i(rflags) & (1 << 2));
3319 if (!coder->failed_room[coder->n_subroom - 1]) {
3320 tmpcr = build_room(&tmproom, coder->croom);
3322 coder->tmproomlist[coder->n_subroom] = tmpcr;
3323 coder->failed_room[coder->n_subroom] = FALSE;
3327 } /* failed to create parent room, so fail this too */
3329 coder->tmproomlist[coder->n_subroom] = (struct mkroom *) 0;
3330 coder->failed_room[coder->n_subroom] = TRUE;
3336 struct sp_coder *coder;
3338 if (coder->n_subroom > 1) {
3340 coder->tmproomlist[coder->n_subroom] = NULL;
3341 coder->failed_room[coder->n_subroom] = TRUE;
3343 /* no subroom, get out of top-level room */
3344 /* Need to ensure xstart/ystart/xsize/ysize have something sensible,
3345 in case there's some stuff to be created outside the outermost
3349 if (xsize <= 1 && ysize <= 1) {
3360 struct sp_coder *coder;
3362 static const char nhFunc[] = "spo_stair";
3364 struct opvar *up, *scoord;
3365 struct trap *badtrap;
3367 if (!OV_pop_i(up) || !OV_pop_c(scoord))
3370 get_location_coord(&x, &y, DRY, coder->croom, OV_i(scoord));
3371 if ((badtrap = t_at(x, y)) != 0)
3373 mkstairs(x, y, (char) OV_i(up), coder->croom);
3374 SpLev_Map[x][y] = 1;
3382 struct sp_coder *coder;
3384 static const char nhFunc[] = "spo_ladder";
3386 struct opvar *up, *lcoord;
3388 if (!OV_pop_i(up) || !OV_pop_c(lcoord))
3391 get_location_coord(&x, &y, DRY, coder->croom, OV_i(lcoord));
3393 levl[x][y].typ = LADDER;
3394 SpLev_Map[x][y] = 1;
3398 levl[x][y].ladder = LA_UP;
3402 levl[x][y].ladder = LA_DOWN;
3410 struct sp_coder *coder;
3412 static const char nhFunc[] = "spo_grave";
3413 struct opvar *gcoord, *typ, *txt;
3416 if (!OV_pop_i(typ) || !OV_pop_s(txt) || !OV_pop_c(gcoord))
3419 get_location_coord(&x, &y, DRY, coder->croom, OV_i(gcoord));
3421 if (isok(x, y) && !t_at(x, y)) {
3422 levl[x][y].typ = GRAVE;
3423 switch (OV_i(typ)) {
3425 make_grave(x, y, OV_s(txt));
3428 make_grave(x, y, NULL);
3443 struct sp_coder *coder;
3445 static const char nhFunc[] = "spo_altar";
3446 struct opvar *al, *shrine, *acoord;
3449 if (!OV_pop_i(al) || !OV_pop_i(shrine) || !OV_pop_c(acoord))
3452 tmpaltar.coord = OV_i(acoord);
3453 tmpaltar.align = OV_i(al);
3454 tmpaltar.shrine = OV_i(shrine);
3456 create_altar(&tmpaltar, coder->croom);
3465 struct sp_coder *coder;
3467 static const char nhFunc[] = "spo_trap";
3469 struct opvar *tcoord;
3472 if (!OV_pop_i(type) || !OV_pop_c(tcoord))
3475 tmptrap.coord = OV_i(tcoord);
3476 tmptrap.type = OV_i(type);
3478 create_trap(&tmptrap, coder->croom);
3485 struct sp_coder *coder;
3487 static const char nhFunc[] = "spo_gold";
3488 struct opvar *gcoord, *amt;
3492 if (!OV_pop_c(gcoord) || !OV_pop_i(amt))
3495 get_location_coord(&x, &y, DRY, coder->croom, OV_i(gcoord));
3498 mkgold(amount, x, y);
3505 struct sp_coder *coder;
3507 static const char nhFunc[] = "spo_corridor";
3508 struct opvar *deswall, *desdoor, *desroom, *srcwall, *srcdoor, *srcroom;
3511 if (!OV_pop_i(deswall) || !OV_pop_i(desdoor) || !OV_pop_i(desroom)
3512 || !OV_pop_i(srcwall) || !OV_pop_i(srcdoor) || !OV_pop_i(srcroom))
3515 tc.src.room = OV_i(srcroom);
3516 tc.src.door = OV_i(srcdoor);
3517 tc.src.wall = OV_i(srcwall);
3518 tc.dest.room = OV_i(desroom);
3519 tc.dest.door = OV_i(desdoor);
3520 tc.dest.wall = OV_i(deswall);
3522 create_corridor(&tc);
3524 opvar_free(deswall);
3525 opvar_free(desdoor);
3526 opvar_free(desroom);
3527 opvar_free(srcwall);
3528 opvar_free(srcdoor);
3529 opvar_free(srcroom);
3533 selection_opvar(nbuf)
3537 char buf[(COLNO * ROWNO) + 1];
3540 (void) memset(buf, 1, sizeof(buf));
3541 buf[(COLNO * ROWNO)] = '\0';
3542 ov = opvar_new_str(buf);
3544 ov = opvar_new_str(nbuf);
3546 ov->spovartyp = SPOVAR_SEL;
3551 selection_getpoint(x, y, ov)
3555 if (!ov || ov->spovartyp != SPOVAR_SEL)
3557 if (x < 0 || y < 0 || x >= COLNO || y >= ROWNO)
3560 return (ov->vardata.str[COLNO * y + x] - 1);
3564 selection_setpoint(x, y, ov, c)
3569 if (!ov || ov->spovartyp != SPOVAR_SEL)
3571 if (x < 0 || y < 0 || x >= COLNO || y >= ROWNO)
3574 ov->vardata.str[COLNO * y + x] = (char) (c + 1);
3584 ov = selection_opvar((char *) 0);
3588 for (x = 0; x < COLNO; x++)
3589 for (y = 0; y < ROWNO; y++)
3590 if (!selection_getpoint(x, y, s))
3591 selection_setpoint(x, y, ov, 1);
3597 selection_logical_oper(s1, s2, oper)
3598 struct opvar *s1, *s2;
3604 ov = selection_opvar((char *) 0);
3608 for (x = 0; x < COLNO; x++)
3609 for (y = 0; y < ROWNO; y++) {
3613 if (selection_getpoint(x, y, s1)
3614 || selection_getpoint(x, y, s2))
3615 selection_setpoint(x, y, ov, 1);
3618 if (selection_getpoint(x, y, s1)
3619 && selection_getpoint(x, y, s2))
3620 selection_setpoint(x, y, ov, 1);
3629 selection_filter_mapchar(ov, mc)
3636 struct opvar *ret = selection_opvar((char *) 0);
3638 if (!ov || !mc || !ret)
3640 mapc = SP_MAPCHAR_TYP(OV_i(mc));
3641 lit = SP_MAPCHAR_LIT(OV_i(mc));
3642 for (x = 0; x < COLNO; x++)
3643 for (y = 0; y < ROWNO; y++)
3644 if (selection_getpoint(x, y, ov) && (levl[x][y].typ == mapc)) {
3648 selection_setpoint(x, y, ret, 1);
3651 selection_setpoint(x, y, ret, rn2(2));
3655 if (levl[x][y].lit == lit)
3656 selection_setpoint(x, y, ret, 1);
3664 selection_filter_percent(ov, percent)
3672 for (x = 0; x < COLNO; x++)
3673 for (y = 0; y < ROWNO; y++)
3674 if (selection_getpoint(x, y, ov) && (rn2(100) >= percent))
3675 selection_setpoint(x, y, ov, 0);
3679 selection_rndcoord(ov, x, y, removeit)
3688 for (dx = 0; dx < COLNO; dx++)
3689 for (dy = 0; dy < ROWNO; dy++)
3690 if (isok(dx, dy) && selection_getpoint(dx, dy, ov))
3695 for (dx = 0; dx < COLNO; dx++)
3696 for (dy = 0; dy < ROWNO; dy++)
3697 if (isok(dx, dy) && selection_getpoint(dx, dy, ov)) {
3701 if (removeit) selection_setpoint(dx, dy, ov, 0);
3712 selection_do_grow(ov, dir)
3717 char tmp[COLNO][ROWNO];
3719 if (ov->spovartyp != SPOVAR_SEL)
3724 (void) memset(tmp, 0, sizeof(tmp));
3726 for (x = 0; x < COLNO; x++)
3727 for (y = 0; y < ROWNO; y++) {
3729 if ((dir & W_WEST) && (x > 0)
3730 && (selection_getpoint(x - 1, y, ov)))
3732 if ((dir & (W_WEST | W_NORTH)) && (x > 0) && (y > 0)
3733 && (selection_getpoint(x - 1, y - 1, ov)))
3735 if ((dir & W_NORTH) && (y > 0)
3736 && (selection_getpoint(x, y - 1, ov)))
3738 if ((dir & (W_NORTH | W_EAST)) && (y > 0) && (x < COLNO - 1)
3739 && (selection_getpoint(x + 1, y - 1, ov)))
3741 if ((dir & W_EAST) && (x < COLNO - 1)
3742 && (selection_getpoint(x + 1, y, ov)))
3744 if ((dir & (W_EAST | W_SOUTH)) && (x < COLNO - 1)
3745 && (y < ROWNO - 1) && (selection_getpoint(x + 1, y + 1, ov)))
3747 if ((dir & W_SOUTH) && (y < ROWNO - 1)
3748 && (selection_getpoint(x, y + 1, ov)))
3750 if ((dir & (W_SOUTH | W_WEST)) && (y < ROWNO - 1) && (x > 0)
3751 && (selection_getpoint(x - 1, y + 1, ov)))
3757 for (x = 0; x < COLNO; x++)
3758 for (y = 0; y < ROWNO; y++)
3760 selection_setpoint(x, y, ov, 1);
3763 STATIC_VAR int FDECL((*selection_flood_check_func), (int, int));
3764 STATIC_VAR schar floodfillchk_match_under_typ;
3767 set_selection_floodfillchk(f)
3768 int FDECL((*f), (int, int));
3770 selection_flood_check_func = f;
3774 floodfillchk_match_under(x,y)
3777 return (floodfillchk_match_under_typ == levl[x][y].typ);
3781 floodfillchk_match_accessible(x, y)
3784 return (ACCESSIBLE(levl[x][y].typ)
3785 || levl[x][y].typ == SDOOR
3786 || levl[x][y].typ == SCORR);
3790 selection_floodfill(ov, x, y, diagonals)
3795 static const char nhFunc[] = "selection_floodfill";
3796 struct opvar *tmp = selection_opvar((char *) 0);
3797 #define SEL_FLOOD_STACK (COLNO * ROWNO)
3798 #define SEL_FLOOD(nx, ny) \
3800 if (idx < SEL_FLOOD_STACK) { \
3805 panic(floodfill_stack_overrun); \
3807 #define SEL_FLOOD_CHKDIR(mx,my,sel) \
3808 if (isok((mx), (my)) \
3809 && (*selection_flood_check_func)((mx), (my)) \
3810 && !selection_getpoint((mx), (my), (sel))) \
3811 SEL_FLOOD((mx), (my))
3812 static const char floodfill_stack_overrun[] = "floodfill stack overrun";
3814 xchar dx[SEL_FLOOD_STACK];
3815 xchar dy[SEL_FLOOD_STACK];
3817 if (selection_flood_check_func == NULL) {
3827 selection_setpoint(x, y, ov, 1);
3828 selection_setpoint(x, y, tmp, 1);
3830 SEL_FLOOD_CHKDIR((x + 1), y, tmp);
3831 SEL_FLOOD_CHKDIR((x - 1), y, tmp);
3832 SEL_FLOOD_CHKDIR(x, (y + 1), tmp);
3833 SEL_FLOOD_CHKDIR(x, (y - 1), tmp);
3835 SEL_FLOOD_CHKDIR((x + 1), (y + 1), tmp);
3836 SEL_FLOOD_CHKDIR((x - 1), (y - 1), tmp);
3837 SEL_FLOOD_CHKDIR((x - 1), (y + 1), tmp);
3838 SEL_FLOOD_CHKDIR((x + 1), (y - 1), tmp);
3842 #undef SEL_FLOOD_STACK
3843 #undef SEL_FLOOD_CHKDIR
3847 /* McIlroy's Ellipse Algorithm */
3849 selection_do_ellipse(ov, xc, yc, a, b, filled)
3851 int xc, yc, a, b, filled;
3852 { /* e(x,y) = b^2*x^2 + a^2*y^2 - a^2*b^2 */
3854 long a2 = (long) a * a, b2 = (long) b * b;
3855 long crit1 = -(a2 / 4 + a % 2 + b2);
3856 long crit2 = -(b2 / 4 + b % 2 + a2);
3857 long crit3 = -(b2 / 4 + b % 2);
3858 long t = -a2 * y; /* e(x+1/2,y-1/2) - (a^2+b^2)/4 */
3859 long dxt = 2 * b2 * x, dyt = -2 * a2 * y;
3860 long d2xt = 2 * b2, d2yt = 2 * a2;
3870 while (y >= 0 && x <= a) {
3871 selection_setpoint(xc + x, yc + y, ov, 1);
3872 if (x != 0 || y != 0)
3873 selection_setpoint(xc - x, yc - y, ov, 1);
3874 if (x != 0 && y != 0) {
3875 selection_setpoint(xc + x, yc - y, ov, 1);
3876 selection_setpoint(xc - x, yc + y, ov, 1);
3878 if (t + b2 * x <= crit1 /* e(x+1,y-1/2) <= 0 */
3879 || t + a2 * y <= crit3) { /* e(x+1/2,y) <= 0 */
3883 } else if (t - a2 * y > crit2) { /* e(x+1/2,y-1) > 0 */
3897 while (y >= 0 && x <= a) {
3898 if (t + b2 * x <= crit1 /* e(x+1,y-1/2) <= 0 */
3899 || t + a2 * y <= crit3) { /* e(x+1/2,y) <= 0 */
3904 } else if (t - a2 * y > crit2) { /* e(x+1/2,y-1) > 0 */
3905 for (i = 0; i < width; i++)
3906 selection_setpoint(xc - x + i, yc - y, ov, 1);
3908 for (i = 0; i < width; i++)
3909 selection_setpoint(xc - x + i, yc + y, ov, 1);
3914 for (i = 0; i < width; i++)
3915 selection_setpoint(xc - x + i, yc - y, ov, 1);
3917 for (i = 0; i < width; i++)
3918 selection_setpoint(xc - x + i, yc + y, ov, 1);
3931 /* distance from line segment (x1,y1, x2,y2) to point (x3,y3) */
3933 line_dist_coord(x1, y1, x2, y2, x3, y3)
3934 long x1, y1, x2, y2, x3, y3;
3938 long s = px * px + py * py;
3939 long x, y, dx, dy, dist = 0;
3942 if (x1 == x2 && y1 == y2)
3943 return isqrt(dist2(x1, y1, x3, y3));
3945 lu = ((x3 - x1) * px + (y3 - y1) * py) / (float) s;
3955 dist = isqrt(dx * dx + dy * dy);
3961 selection_do_gradient(ov, x, y, x2, y2, gtyp, mind, maxd, limit)
3963 long x, y, x2, y2, gtyp, mind, maxd, limit;
3979 case SEL_GRADIENT_RADIAL: {
3980 for (dx = 0; dx < COLNO; dx++)
3981 for (dy = 0; dy < ROWNO; dy++) {
3982 long d0 = line_dist_coord(x, y, x2, y2, dx, dy);
3983 if (d0 >= mind && (!limit || d0 <= maxd)) {
3984 if (d0 - mind > rn2(dofs))
3985 selection_setpoint(dx, dy, ov, 1);
3990 case SEL_GRADIENT_SQUARE: {
3991 for (dx = 0; dx < COLNO; dx++)
3992 for (dy = 0; dy < ROWNO; dy++) {
3993 long d1 = line_dist_coord(x, y, x2, y2, x, dy);
3994 long d2 = line_dist_coord(x, y, x2, y2, dx, y);
3995 long d3 = line_dist_coord(x, y, x2, y2, x2, dy);
3996 long d4 = line_dist_coord(x, y, x2, y2, dx, y2);
3997 long d5 = line_dist_coord(x, y, x2, y2, dx, dy);
3998 long d0 = min(d5, min(max(d1, d2), max(d3, d4)));
4000 if (d0 >= mind && (!limit || d0 <= maxd)) {
4001 if (d0 - mind > rn2(dofs))
4002 selection_setpoint(dx, dy, ov, 1);
4010 /* bresenham line algo */
4012 selection_do_line(x1, y1, x2, y2, ov)
4013 schar x1, y1, x2, y2;
4016 int d0, dx, dy, ai, bi, xi, yi;
4034 selection_setpoint(x1, y1, ov, 1);
4047 selection_setpoint(x1, y1, ov, 1);
4060 selection_setpoint(x1, y1, ov, 1);
4066 selection_do_randline(x1, y1, x2, y2, rough, rec, ov)
4067 schar x1, y1, x2, y2, rough, rec;
4077 if ((x2 == x1) && (y2 == y1)) {
4078 selection_setpoint(x1, y1, ov, 1);
4082 if (rough > max(abs(x2 - x1), abs(y2 - y1)))
4083 rough = max(abs(x2 - x1), abs(y2 - y1));
4086 mx = ((x1 + x2) / 2);
4087 my = ((y1 + y2) / 2);
4090 dx = (Rand() % rough) - (rough / 2);
4091 dy = (Rand() % rough) - (rough / 2);
4092 mx = ((x1 + x2) / 2) + dx;
4093 my = ((y1 + y2) / 2) + dy;
4094 } while ((mx > COLNO - 1 || mx < 0 || my < 0 || my > ROWNO - 1));
4097 selection_setpoint(mx, my, ov, 1);
4099 rough = (rough * 2) / 3;
4103 selection_do_randline(x1, y1, mx, my, rough, rec, ov);
4104 selection_do_randline(mx, my, x2, y2, rough, rec, ov);
4108 selection_iterate(ov, func, arg)
4110 select_iter_func func;
4115 /* yes, this is very naive, but it's not _that_ expensive. */
4116 for (x = 0; x < COLNO; x++)
4117 for (y = 0; y < ROWNO; y++)
4118 if (selection_getpoint(x, y, ov))
4123 sel_set_ter(x, y, arg)
4129 terr = *(terrain *) arg;
4130 SET_TYPLIT(x, y, terr.ter, terr.tlit);
4131 /* handle doors and secret doors */
4132 if (levl[x][y].typ == SDOOR || IS_DOOR(levl[x][y].typ)) {
4133 if (levl[x][y].typ == SDOOR)
4134 levl[x][y].doormask = D_CLOSED;
4135 if (x && (IS_WALL(levl[x - 1][y].typ) || levl[x - 1][y].horizontal))
4136 levl[x][y].horizontal = 1;
4141 sel_set_feature(x, y, arg)
4145 if (IS_FURNITURE(levl[x][y].typ))
4147 levl[x][y].typ = (*(int *) arg);
4151 sel_set_door(dx, dy, arg)
4155 xchar typ = *(xchar *) arg;
4159 if (!IS_DOOR(levl[x][y].typ) && levl[x][y].typ != SDOOR)
4160 levl[x][y].typ = (typ & D_SECRET) ? SDOOR : DOOR;
4161 if (typ & D_SECRET) {
4166 levl[x][y].doormask = typ;
4167 SpLev_Map[x][y] = 1;
4172 struct sp_coder *coder;
4174 static const char nhFunc[] = "spo_door";
4175 struct opvar *msk, *sel;
4178 if (!OV_pop_i(msk) || !OV_pop_typ(sel, SPOVAR_SEL))
4181 typ = OV_i(msk) == -1 ? rnddoor() : (xchar) OV_i(msk);
4183 selection_iterate(sel, sel_set_door, (genericptr_t) &typ);
4191 struct sp_coder *coder;
4193 static const char nhFunc[] = "spo_feature";
4197 if (!OV_pop_typ(sel, SPOVAR_SEL))
4200 switch (coder->opcode) {
4202 impossible("spo_feature called with wrong opcode %i.", coder->opcode);
4214 selection_iterate(sel, sel_set_feature, (genericptr_t) &typ);
4220 struct sp_coder *coder;
4222 static const char nhFunc[] = "spo_terrain";
4224 struct opvar *ter, *sel;
4226 if (!OV_pop_typ(ter, SPOVAR_MAPCHAR) || !OV_pop_typ(sel, SPOVAR_SEL))
4229 tmpterrain.ter = SP_MAPCHAR_TYP(OV_i(ter));
4230 tmpterrain.tlit = SP_MAPCHAR_LIT(OV_i(ter));
4231 selection_iterate(sel, sel_set_ter, (genericptr_t) &tmpterrain);
4238 spo_replace_terrain(coder)
4239 struct sp_coder *coder;
4241 static const char nhFunc[] = "spo_replace_terrain";
4243 struct opvar *reg, *from_ter, *to_ter, *chance;
4245 if (!OV_pop_i(chance) || !OV_pop_typ(to_ter, SPOVAR_MAPCHAR)
4246 || !OV_pop_typ(from_ter, SPOVAR_MAPCHAR) || !OV_pop_r(reg))
4249 rt.chance = OV_i(chance);
4250 rt.tolit = SP_MAPCHAR_LIT(OV_i(to_ter));
4251 rt.toter = SP_MAPCHAR_TYP(OV_i(to_ter));
4252 rt.fromter = SP_MAPCHAR_TYP(OV_i(from_ter));
4253 /* TODO: use SP_MAPCHAR_LIT(OV_i(from_ter)) too */
4254 rt.x1 = SP_REGION_X1(OV_i(reg));
4255 rt.y1 = SP_REGION_Y1(OV_i(reg));
4256 rt.x2 = SP_REGION_X2(OV_i(reg));
4257 rt.y2 = SP_REGION_Y2(OV_i(reg));
4259 replace_terrain(&rt, coder->croom);
4262 opvar_free(from_ter);
4268 generate_way_out_method(nx,ny, ov)
4272 static const char nhFunc[] = "generate_way_out_method";
4273 const int escapeitems[] = { PICK_AXE,
4278 RIN_TELEPORTATION };
4279 struct opvar *ov2 = selection_opvar((char *) 0), *ov3;
4283 selection_floodfill(ov2, nx, ny, TRUE);
4284 ov3 = opvar_clone(ov2);
4286 /* try to make a secret door */
4287 while (selection_rndcoord(ov3, &x, &y, TRUE)) {
4288 if (isok(x+1, y) && !selection_getpoint(x+1, y, ov)
4289 && IS_WALL(levl[x+1][y].typ)
4290 && isok(x+2, y) && selection_getpoint(x+2, y, ov)
4291 && ACCESSIBLE(levl[x+2][y].typ)) {
4292 levl[x+1][y].typ = SDOOR;
4295 if (isok(x-1, y) && !selection_getpoint(x-1, y, ov)
4296 && IS_WALL(levl[x-1][y].typ)
4297 && isok(x-2, y) && selection_getpoint(x-2, y, ov)
4298 && ACCESSIBLE(levl[x-2][y].typ)) {
4299 levl[x-1][y].typ = SDOOR;
4302 if (isok(x, y+1) && !selection_getpoint(x, y+1, ov)
4303 && IS_WALL(levl[x][y+1].typ)
4304 && isok(x, y+2) && selection_getpoint(x, y+2, ov)
4305 && ACCESSIBLE(levl[x][y+2].typ)) {
4306 levl[x][y+1].typ = SDOOR;
4309 if (isok(x, y-1) && !selection_getpoint(x, y-1, ov)
4310 && IS_WALL(levl[x][y-1].typ)
4311 && isok(x, y-2) && selection_getpoint(x, y-2, ov)
4312 && ACCESSIBLE(levl[x][y-2].typ)) {
4313 levl[x][y-1].typ = SDOOR;
4318 /* try to make a hole or a trapdoor */
4319 if (Can_fall_thru(&u.uz)) {
4321 ov3 = opvar_clone(ov2);
4322 while (selection_rndcoord(ov3, &x, &y, TRUE)) {
4323 if (maketrap(x,y, rn2(2) ? HOLE : TRAPDOOR))
4328 /* generate one of the escape items */
4329 if (selection_rndcoord(ov2, &x, &y, FALSE)) {
4330 mksobj_at(escapeitems[rn2(SIZE(escapeitems))], x, y, TRUE, FALSE);
4344 static const char nhFunc[] = "ensure_way_out";
4345 struct opvar *ov = selection_opvar((char *) 0);
4346 struct trap *ttmp = ftrap;
4350 set_selection_floodfillchk(floodfillchk_match_accessible);
4352 if (xupstair && !selection_getpoint(xupstair, yupstair, ov))
4353 selection_floodfill(ov, xupstair, yupstair, TRUE);
4354 if (xdnstair && !selection_getpoint(xdnstair, ydnstair, ov))
4355 selection_floodfill(ov, xdnstair, ydnstair, TRUE);
4356 if (xupladder && !selection_getpoint(xupladder, yupladder, ov))
4357 selection_floodfill(ov, xupladder, yupladder, TRUE);
4358 if (xdnladder && !selection_getpoint(xdnladder, ydnladder, ov))
4359 selection_floodfill(ov, xdnladder, ydnladder, TRUE);
4362 if ((ttmp->ttyp == MAGIC_PORTAL || ttmp->ttyp == VIBRATING_SQUARE
4363 || ttmp->ttyp == HOLE || ttmp->ttyp == TRAPDOOR)
4364 && !selection_getpoint(ttmp->tx, ttmp->ty, ov))
4365 selection_floodfill(ov, ttmp->tx, ttmp->ty, TRUE);
4371 for (x = 0; x < COLNO; x++)
4372 for (y = 0; y < ROWNO; y++)
4373 if (ACCESSIBLE(levl[x][y].typ)
4374 && !selection_getpoint(x, y, ov)) {
4375 if (generate_way_out_method(x,y, ov))
4376 selection_floodfill(ov, x,y, TRUE);
4386 spo_levregion(coder)
4387 struct sp_coder *coder;
4389 static const char nhFunc[] = "spot_levregion";
4390 struct opvar *rname, *padding, *rtype, *del_islev, *dy2, *dx2, *dy1, *dx1,
4391 *in_islev, *iy2, *ix2, *iy1, *ix1;
4393 lev_region *tmplregion;
4395 if (!OV_pop_s(rname) || !OV_pop_i(padding) || !OV_pop_i(rtype)
4396 || !OV_pop_i(del_islev) || !OV_pop_i(dy2) || !OV_pop_i(dx2)
4397 || !OV_pop_i(dy1) || !OV_pop_i(dx1) || !OV_pop_i(in_islev)
4398 || !OV_pop_i(iy2) || !OV_pop_i(ix2) || !OV_pop_i(iy1)
4402 tmplregion = (lev_region *) alloc(sizeof(lev_region));
4404 tmplregion->inarea.x1 = OV_i(ix1);
4405 tmplregion->inarea.y1 = OV_i(iy1);
4406 tmplregion->inarea.x2 = OV_i(ix2);
4407 tmplregion->inarea.y2 = OV_i(iy2);
4409 tmplregion->delarea.x1 = OV_i(dx1);
4410 tmplregion->delarea.y1 = OV_i(dy1);
4411 tmplregion->delarea.x2 = OV_i(dx2);
4412 tmplregion->delarea.y2 = OV_i(dy2);
4414 tmplregion->in_islev = OV_i(in_islev);
4415 tmplregion->del_islev = OV_i(del_islev);
4416 tmplregion->rtype = OV_i(rtype);
4417 tmplregion->padding = OV_i(padding);
4418 tmplregion->rname.str = dupstr(OV_s(rname));
4420 if (!tmplregion->in_islev) {
4421 get_location(&tmplregion->inarea.x1, &tmplregion->inarea.y1, ANY_LOC,
4422 (struct mkroom *) 0);
4423 get_location(&tmplregion->inarea.x2, &tmplregion->inarea.y2, ANY_LOC,
4424 (struct mkroom *) 0);
4427 if (!tmplregion->del_islev) {
4428 get_location(&tmplregion->delarea.x1, &tmplregion->delarea.y1,
4429 ANY_LOC, (struct mkroom *) 0);
4430 get_location(&tmplregion->delarea.x2, &tmplregion->delarea.y2,
4431 ANY_LOC, (struct mkroom *) 0);
4434 /* realloc the lregion space to add the new one */
4435 lev_region *newl = (lev_region *) alloc(
4436 sizeof(lev_region) * (unsigned) (1 + num_lregions));
4438 (void) memcpy((genericptr_t) (newl), (genericptr_t) lregions,
4439 sizeof(lev_region) * num_lregions);
4445 lregions = (lev_region *) alloc(sizeof(lev_region));
4447 (void) memcpy(&lregions[num_lregions - 1], tmplregion,
4448 sizeof(lev_region));
4461 opvar_free(del_islev);
4462 opvar_free(in_islev);
4465 opvar_free(padding);
4470 struct sp_coder *coder;
4472 static const char nhFunc[] = "spo_region";
4473 struct opvar *rtype, *rlit, *rflags, *area;
4474 xchar dx1, dy1, dx2, dy2;
4475 register struct mkroom *troom;
4476 boolean prefilled, room_not_needed, irregular, joined;
4478 if (!OV_pop_i(rflags) || !OV_pop_i(rtype) || !OV_pop_i(rlit)
4482 prefilled = !(OV_i(rflags) & (1 << 0));
4483 irregular = (OV_i(rflags) & (1 << 1));
4484 joined = !(OV_i(rflags) & (1 << 2));
4486 if (OV_i(rtype) > MAXRTYPE) {
4487 OV_i(rtype) -= MAXRTYPE + 1;
4494 (rnd(1 + abs(depth(&u.uz))) < 11 && rn2(77)) ? TRUE : FALSE;
4496 dx1 = SP_REGION_X1(OV_i(area));
4497 dy1 = SP_REGION_Y1(OV_i(area));
4498 dx2 = SP_REGION_X2(OV_i(area));
4499 dy2 = SP_REGION_Y2(OV_i(area));
4501 get_location(&dx1, &dy1, ANY_LOC, (struct mkroom *) 0);
4502 get_location(&dx2, &dy2, ANY_LOC, (struct mkroom *) 0);
4504 /* for an ordinary room, `prefilled' is a flag to force
4505 an actual room to be created (such rooms are used to
4506 control placement of migrating monster arrivals) */
4507 room_not_needed = (OV_i(rtype) == OROOM && !irregular && !prefilled);
4508 if (room_not_needed || nroom >= MAXNROFROOMS) {
4510 if (!room_not_needed)
4511 impossible("Too many rooms on new level!");
4512 tmpregion.rlit = OV_i(rlit);
4517 light_region(&tmpregion);
4527 troom = &rooms[nroom];
4529 /* mark rooms that must be filled, but do it later */
4530 if (OV_i(rtype) != OROOM)
4531 troom->needfill = (prefilled ? 2 : 1);
4533 troom->needjoining = joined;
4536 min_rx = max_rx = dx1;
4537 min_ry = max_ry = dy1;
4538 smeq[nroom] = nroom;
4539 flood_fill_rm(dx1, dy1, nroom + ROOMOFFSET, OV_i(rlit), TRUE);
4540 add_room(min_rx, min_ry, max_rx, max_ry, FALSE, OV_i(rtype), TRUE);
4541 troom->rlit = OV_i(rlit);
4542 troom->irregular = TRUE;
4544 add_room(dx1, dy1, dx2, dy2, OV_i(rlit), OV_i(rtype), TRUE);
4545 #ifdef SPECIALIZATION
4546 topologize(troom, FALSE); /* set roomno */
4548 topologize(troom); /* set roomno */
4552 if (!room_not_needed) {
4553 if (coder->n_subroom > 1)
4554 impossible("region as subroom");
4556 coder->tmproomlist[coder->n_subroom] = troom;
4557 coder->failed_room[coder->n_subroom] = FALSE;
4569 spo_drawbridge(coder)
4570 struct sp_coder *coder;
4572 static const char nhFunc[] = "spo_drawbridge";
4574 struct opvar *dir, *db_open, *dcoord;
4576 if (!OV_pop_i(dir) || !OV_pop_i(db_open) || !OV_pop_c(dcoord))
4579 get_location_coord(&x, &y, DRY | WET | HOT, coder->croom, OV_i(dcoord));
4580 if (!create_drawbridge(x, y, OV_i(dir), OV_i(db_open)))
4581 impossible("Cannot create drawbridge.");
4582 SpLev_Map[x][y] = 1;
4585 opvar_free(db_open);
4591 struct sp_coder *coder;
4593 static const char nhFunc[] = "spo_mazewalk";
4595 struct opvar *ftyp, *fstocked, *fdir, *mcoord;
4598 if (!OV_pop_i(ftyp) || !OV_pop_i(fstocked) || !OV_pop_i(fdir)
4599 || !OV_pop_c(mcoord))
4604 get_location_coord(&x, &y, ANY_LOC, coder->croom, OV_i(mcoord));
4608 if (OV_i(ftyp) < 1) {
4609 OV_i(ftyp) = level.flags.corrmaze ? CORR : ROOM;
4612 /* don't use move() - it doesn't use W_NORTH, etc. */
4627 impossible("spo_mazewalk: Bad MAZEWALK direction");
4630 if (!IS_DOOR(levl[x][y].typ)) {
4631 levl[x][y].typ = OV_i(ftyp);
4632 levl[x][y].flags = 0;
4636 * We must be sure that the parity of the coordinates for
4637 * walkfrom() is odd. But we must also take into account
4638 * what direction was chosen.
4646 /* no need for IS_DOOR check; out of map bounds */
4647 levl[x][y].typ = OV_i(ftyp);
4648 levl[x][y].flags = 0;
4658 walkfrom(x, y, OV_i(ftyp));
4664 opvar_free(fstocked);
4669 spo_wall_property(coder)
4670 struct sp_coder *coder;
4672 static const char nhFunc[] = "spo_wall_property";
4674 xchar dx1, dy1, dx2, dy2;
4675 int wprop = (coder->opcode == SPO_NON_DIGGABLE)
4682 dx1 = SP_REGION_X1(OV_i(r));
4683 dy1 = SP_REGION_Y1(OV_i(r));
4684 dx2 = SP_REGION_X2(OV_i(r));
4685 dy2 = SP_REGION_Y2(OV_i(r));
4687 get_location(&dx1, &dy1, ANY_LOC, (struct mkroom *) 0);
4688 get_location(&dx2, &dy2, ANY_LOC, (struct mkroom *) 0);
4690 set_wall_property(dx1, dy1, dx2, dy2, wprop);
4696 spo_room_door(coder)
4697 struct sp_coder *coder;
4699 static const char nhFunc[] = "spo_room_door";
4700 struct opvar *wall, *secret, *mask, *pos;
4703 if (!OV_pop_i(wall) || !OV_pop_i(secret) || !OV_pop_i(mask)
4704 || !OV_pop_i(pos) || !coder->croom)
4707 tmpd.secret = OV_i(secret);
4708 tmpd.mask = OV_i(mask);
4709 tmpd.pos = OV_i(pos);
4710 tmpd.wall = OV_i(wall);
4712 create_door(&tmpd, coder->croom);
4722 sel_set_wallify(x, y, arg)
4724 genericptr_t arg UNUSED;
4726 wallify_map(x, y, x, y);
4731 struct sp_coder *coder;
4733 static const char nhFunc[] = "spo_wallify";
4734 struct opvar *typ, *r;
4735 int dx1, dy1, dx2, dy2;
4739 switch (OV_i(typ)) {
4744 dx1 = (xchar) SP_REGION_X1(OV_i(r));
4745 dy1 = (xchar) SP_REGION_Y1(OV_i(r));
4746 dx2 = (xchar) SP_REGION_X2(OV_i(r));
4747 dy2 = (xchar) SP_REGION_Y2(OV_i(r));
4748 wallify_map(dx1 < 0 ? (xstart-1) : dx1, dy1 < 0 ? (ystart-1) : dy1,
4749 dx2 < 0 ? (xstart + xsize + 1) : dx2,
4750 dy2 < 0 ? (ystart + ysize + 1) : dy2);
4753 if (!OV_pop_typ(r, SPOVAR_SEL))
4755 selection_iterate(r, sel_set_wallify, NULL);
4764 struct sp_coder *coder;
4766 static const char nhFunc[] = "spo_map";
4767 mazepart tmpmazepart;
4768 struct opvar *mpxs, *mpys, *mpmap, *mpa, *mpkeepr, *mpzalign;
4769 xchar halign, valign;
4770 xchar tmpxstart, tmpystart, tmpxsize, tmpysize;
4773 if (!OV_pop_i(mpxs) || !OV_pop_i(mpys) || !OV_pop_s(mpmap)
4774 || !OV_pop_i(mpkeepr) || !OV_pop_i(mpzalign) || !OV_pop_c(mpa))
4777 tmpmazepart.xsize = OV_i(mpxs);
4778 tmpmazepart.ysize = OV_i(mpys);
4779 tmpmazepart.zaligntyp = OV_i(mpzalign);
4781 upc = get_unpacked_coord(OV_i(mpa), ANY_LOC);
4782 tmpmazepart.halign = upc.x;
4783 tmpmazepart.valign = upc.y;
4790 halign = tmpmazepart.halign;
4791 valign = tmpmazepart.valign;
4792 xsize = tmpmazepart.xsize;
4793 ysize = tmpmazepart.ysize;
4794 switch (tmpmazepart.zaligntyp) {
4799 switch ((int) halign) {
4801 xstart = splev_init_present ? 1 : 3;
4804 xstart = 2 + ((x_maze_max - 2 - xsize) / 4);
4807 xstart = 2 + ((x_maze_max - 2 - xsize) / 2);
4810 xstart = 2 + ((x_maze_max - 2 - xsize) * 3 / 4);
4813 xstart = x_maze_max - xsize - 1;
4816 switch ((int) valign) {
4821 ystart = 2 + ((y_maze_max - 2 - ysize) / 2);
4824 ystart = y_maze_max - ysize - 1;
4833 if (!coder->croom) {
4836 xsize = COLNO - 1 - tmpmazepart.xsize;
4837 ysize = ROWNO - tmpmazepart.ysize;
4839 get_location_coord(&halign, &valign, ANY_LOC, coder->croom,
4841 xsize = tmpmazepart.xsize;
4842 ysize = tmpmazepart.ysize;
4847 if ((ystart < 0) || (ystart + ysize > ROWNO)) {
4848 /* try to move the start a bit */
4849 ystart += (ystart > 0) ? -2 : 2;
4852 if (ystart < 0 || ystart + ysize > ROWNO)
4853 panic("reading special level with ysize too large");
4855 if (xsize <= 1 && ysize <= 1) {
4863 for (y = ystart; y < ystart + ysize; y++)
4864 for (x = xstart; x < xstart + xsize; x++) {
4866 (mpmap->vardata.str[(y - ystart) * xsize + (x - xstart)]
4868 if (mptyp >= MAX_TYPE)
4870 levl[x][y].typ = mptyp;
4871 levl[x][y].lit = FALSE;
4872 /* clear out levl: load_common_data may set them */
4873 levl[x][y].flags = 0;
4874 levl[x][y].horizontal = 0;
4875 levl[x][y].roomno = 0;
4876 levl[x][y].edge = 0;
4877 SpLev_Map[x][y] = 1;
4879 * Set secret doors to closed (why not trapped too?). Set
4880 * the horizontal bit.
4882 if (levl[x][y].typ == SDOOR || IS_DOOR(levl[x][y].typ)) {
4883 if (levl[x][y].typ == SDOOR)
4884 levl[x][y].doormask = D_CLOSED;
4886 * If there is a wall to the left that connects to a
4887 * (secret) door, then it is horizontal. This does
4888 * not allow (secret) doors to be corners of rooms.
4890 if (x != xstart && (IS_WALL(levl[x - 1][y].typ)
4891 || levl[x - 1][y].horizontal))
4892 levl[x][y].horizontal = 1;
4893 } else if (levl[x][y].typ == HWALL
4894 || levl[x][y].typ == IRONBARS)
4895 levl[x][y].horizontal = 1;
4896 else if (levl[x][y].typ == LAVAPOOL)
4898 else if (splev_init_present && levl[x][y].typ == ICE)
4899 levl[x][y].icedpool = icedpools ? ICED_POOL : ICED_MOAT;
4901 if (coder->lvl_is_joined)
4902 remove_rooms(xstart, ystart, xstart + xsize, ystart + ysize);
4904 if (!OV_i(mpkeepr)) {
4915 opvar_free(mpkeepr);
4916 opvar_free(mpzalign);
4921 struct sp_coder *coder;
4924 static const char nhFunc[] = "spo_jmp";
4928 if (!OV_pop_i(tmpa))
4930 a = sp_code_jmpaddr(coder->frame->n_opcode, (OV_i(tmpa) - 1));
4931 if ((a >= 0) && (a < lvl->n_opcodes) && (a != coder->frame->n_opcode))
4932 coder->frame->n_opcode = a;
4937 spo_conditional_jump(coder, lvl)
4938 struct sp_coder *coder;
4941 static const char nhFunc[] = "spo_conditional_jump";
4942 struct opvar *oa, *oc;
4946 if (!OV_pop_i(oa) || !OV_pop_i(oc))
4949 a = sp_code_jmpaddr(coder->frame->n_opcode, (OV_i(oa) - 1));
4952 switch (coder->opcode) {
4954 impossible("spo_conditional_jump: illegal opcode");
4957 test = (c & SP_CPUFLAG_LT);
4960 test = (c & (SP_CPUFLAG_LT | SP_CPUFLAG_EQ));
4963 test = (c & SP_CPUFLAG_GT);
4966 test = (c & (SP_CPUFLAG_GT | SP_CPUFLAG_EQ));
4969 test = (c & SP_CPUFLAG_EQ);
4972 test = (c & ~SP_CPUFLAG_EQ);
4976 if ((test) && (a >= 0) && (a < lvl->n_opcodes)
4977 && (a != coder->frame->n_opcode))
4978 coder->frame->n_opcode = a;
4986 struct sp_coder *coder;
4988 static const char nhFunc[] = "spo_var_init";
4989 struct opvar *vname;
4990 struct opvar *arraylen;
4991 struct opvar *vvalue;
4992 struct splev_var *tmpvar;
4993 struct splev_var *tmp2;
4999 if (!vname || !arraylen)
5000 panic("no values for SPO_VAR_INIT");
5002 tmpvar = opvar_var_defined(coder, OV_s(vname));
5005 /* variable redefinition */
5006 if (OV_i(arraylen) < 0) {
5008 if (tmpvar->array_len) {
5009 idx = tmpvar->array_len;
5011 opvar_free(tmpvar->data.arrayvalues[idx]);
5013 Free(tmpvar->data.arrayvalues);
5015 opvar_free(tmpvar->data.value);
5017 tmpvar->data.arrayvalues = NULL;
5019 } else if (OV_i(arraylen)) {
5020 /* redefined array */
5021 idx = tmpvar->array_len;
5023 opvar_free(tmpvar->data.arrayvalues[idx]);
5025 Free(tmpvar->data.arrayvalues);
5026 tmpvar->data.arrayvalues = NULL;
5027 goto create_new_array;
5029 /* redefined single value */
5031 if (tmpvar->svtyp != vvalue->spovartyp)
5032 panic("redefining variable as different type");
5033 opvar_free(tmpvar->data.value);
5034 tmpvar->data.value = vvalue;
5035 tmpvar->array_len = 0;
5038 /* new variable definition */
5039 tmpvar = (struct splev_var *) alloc(sizeof(struct splev_var));
5040 tmpvar->next = coder->frame->variables;
5041 tmpvar->name = dupstr(OV_s(vname));
5042 coder->frame->variables = tmpvar;
5044 if (OV_i(arraylen) < 0) {
5048 tmp2 = opvar_var_defined(coder, OV_s(vvalue));
5050 panic("no copyable var");
5051 tmpvar->svtyp = tmp2->svtyp;
5052 tmpvar->array_len = tmp2->array_len;
5053 if (tmpvar->array_len) {
5054 idx = tmpvar->array_len;
5055 tmpvar->data.arrayvalues =
5056 (struct opvar **) alloc(sizeof(struct opvar *) * idx);
5058 tmpvar->data.arrayvalues[idx] =
5059 opvar_clone(tmp2->data.arrayvalues[idx]);
5062 tmpvar->data.value = opvar_clone(tmp2->data.value);
5065 } else if (OV_i(arraylen)) {
5068 idx = OV_i(arraylen);
5069 tmpvar->array_len = idx;
5070 tmpvar->data.arrayvalues =
5071 (struct opvar **) alloc(sizeof(struct opvar *) * idx);
5075 panic("no value for arrayvariable");
5076 tmpvar->data.arrayvalues[idx] = vvalue;
5078 tmpvar->svtyp = SPOVAR_ARRAY;
5080 /* new single value */
5083 panic("no value for variable");
5084 tmpvar->svtyp = OV_typ(vvalue);
5085 tmpvar->data.value = vvalue;
5086 tmpvar->array_len = 0;
5091 opvar_free(arraylen);
5097 opvar_array_length(coder)
5098 struct sp_coder *coder;
5100 static const char nhFunc[] = "opvar_array_length";
5101 struct opvar *vname;
5102 struct splev_var *tmp;
5108 vname = splev_stack_pop(coder->stack);
5111 if (vname->spovartyp != SPOVAR_VARIABLE)
5114 tmp = coder->frame->variables;
5116 if (!strcmp(tmp->name, OV_s(vname))) {
5117 if ((tmp->svtyp & SPOVAR_ARRAY)) {
5118 len = tmp->array_len;
5134 spo_shuffle_array(coder)
5135 struct sp_coder *coder;
5137 static const char nhFunc[] = "spo_shuffle_array";
5138 struct opvar *vname;
5139 struct splev_var *tmp;
5143 if (!OV_pop_s(vname))
5146 tmp = opvar_var_defined(coder, OV_s(vname));
5147 if (!tmp || (tmp->array_len < 1)) {
5151 for (i = tmp->array_len - 1; i > 0; i--) {
5152 if ((j = rn2(i + 1)) == i)
5154 tmp2 = tmp->data.arrayvalues[j];
5155 tmp->data.arrayvalues[j] = tmp->data.arrayvalues[i];
5156 tmp->data.arrayvalues[i] = tmp2;
5162 /* Special level coder, creates the special level from the sp_lev codes.
5163 * Does not free the allocated memory.
5169 static const char nhFunc[] = "sp_level_coder";
5170 unsigned long exec_opcodes = 0;
5172 long room_stack = 0;
5173 unsigned long max_execution = SPCODER_MAX_RUNTIME;
5174 struct sp_coder *coder =
5175 (struct sp_coder *) alloc(sizeof(struct sp_coder));
5177 coder->frame = frame_new(0);
5178 coder->stack = NULL;
5179 coder->premapped = FALSE;
5180 coder->solidify = FALSE;
5181 coder->check_inaccessibles = FALSE;
5182 coder->croom = NULL;
5183 coder->n_subroom = 1;
5184 coder->exit_script = FALSE;
5185 coder->lvl_is_joined = 0;
5187 splev_init_present = FALSE;
5191 char *met = nh_getenv("SPCODER_MAX_RUNTIME");
5192 if (met && met[0] == '1')
5193 max_execution = (1 << 30) - 1;
5196 for (tmpi = 0; tmpi <= MAX_NESTED_ROOMS; tmpi++) {
5197 coder->tmproomlist[tmpi] = (struct mkroom *) 0;
5198 coder->failed_room[tmpi] = FALSE;
5201 shuffle_alignments();
5203 for (tmpi = 0; tmpi < MAX_CONTAINMENT; tmpi++)
5204 container_obj[tmpi] = NULL;
5207 invent_carrying_monster = NULL;
5209 (void) memset((genericptr_t) &SpLev_Map[0][0], 0, sizeof SpLev_Map);
5211 level.flags.is_maze_lev = 0;
5218 while (coder->frame->n_opcode < lvl->n_opcodes && !coder->exit_script) {
5219 coder->opcode = lvl->opcodes[coder->frame->n_opcode].opcode;
5220 coder->opdat = lvl->opcodes[coder->frame->n_opcode].opdat;
5222 coder->stack = coder->frame->stack;
5224 if (exec_opcodes++ > max_execution) {
5225 impossible("Level script is taking too much time, stopping.");
5226 coder->exit_script = TRUE;
5229 if (coder->failed_room[coder->n_subroom - 1]
5230 && coder->opcode != SPO_ENDROOM && coder->opcode != SPO_ROOM
5231 && coder->opcode != SPO_SUBROOM)
5234 coder->croom = coder->tmproomlist[coder->n_subroom - 1];
5236 switch (coder->opcode) {
5240 coder->exit_script = TRUE;
5242 case SPO_FRAME_PUSH:
5243 spo_frame_push(coder);
5246 spo_frame_pop(coder);
5254 case SPO_END_MONINVENT:
5255 spo_end_moninvent(coder);
5257 case SPO_POP_CONTAINER:
5258 spo_pop_container(coder);
5261 struct opvar *ov = splev_stack_pop(coder->stack);
5267 splev_stack_push(coder->stack, opvar_clone(coder->opdat));
5278 case SPO_LEVEL_FLAGS:
5279 spo_level_flags(coder);
5282 spo_initlevel(coder);
5285 spo_engraving(coder);
5287 case SPO_MINERALIZE:
5288 spo_mineralize(coder);
5292 if (!coder->failed_room[coder->n_subroom - 1]) {
5298 if (coder->failed_room[coder->n_subroom - 1]) {
5334 spo_corridor(coder);
5339 case SPO_REPLACETERRAIN:
5340 spo_replace_terrain(coder);
5343 spo_levregion(coder);
5348 case SPO_DRAWBRIDGE:
5349 spo_drawbridge(coder);
5352 spo_mazewalk(coder);
5354 case SPO_NON_PASSWALL:
5355 case SPO_NON_DIGGABLE:
5356 spo_wall_property(coder);
5359 spo_room_door(coder);
5365 struct opvar *a = splev_stack_pop(coder->stack);
5367 splev_stack_push(coder->stack, opvar_clone(a));
5368 splev_stack_push(coder->stack, opvar_clone(a));
5378 splev_stack_push(coder->stack, a);
5387 splev_stack_push(coder->stack, a);
5390 case SPO_MATH_SIGN: {
5395 OV_i(a) = ((OV_i(a) < 0) ? -1 : ((OV_i(a) > 0) ? 1 : 0));
5396 splev_stack_push(coder->stack, a);
5399 case SPO_MATH_ADD: {
5400 struct opvar *a, *b;
5402 if (!OV_pop(b) || !OV_pop(a))
5404 if (OV_typ(b) == OV_typ(a)) {
5405 if (OV_typ(a) == SPOVAR_INT) {
5406 OV_i(a) = OV_i(a) + OV_i(b);
5407 splev_stack_push(coder->stack, a);
5409 } else if (OV_typ(a) == SPOVAR_STRING) {
5411 char *tmpbuf = (char *) alloc(strlen(OV_s(a))
5412 + strlen(OV_s(b)) + 1);
5414 (void) sprintf(tmpbuf, "%s%s", OV_s(a), OV_s(b));
5415 c = opvar_new_str(tmpbuf);
5416 splev_stack_push(coder->stack, c);
5421 splev_stack_push(coder->stack, a);
5423 impossible("adding weird types");
5426 splev_stack_push(coder->stack, a);
5428 impossible("adding different types");
5432 case SPO_MATH_SUB: {
5433 struct opvar *a, *b;
5435 if (!OV_pop_i(b) || !OV_pop_i(a))
5437 OV_i(a) = OV_i(a) - OV_i(b);
5438 splev_stack_push(coder->stack, a);
5442 case SPO_MATH_MUL: {
5443 struct opvar *a, *b;
5445 if (!OV_pop_i(b) || !OV_pop_i(a))
5447 OV_i(a) = OV_i(a) * OV_i(b);
5448 splev_stack_push(coder->stack, a);
5452 case SPO_MATH_DIV: {
5453 struct opvar *a, *b;
5455 if (!OV_pop_i(b) || !OV_pop_i(a))
5458 OV_i(a) = OV_i(a) / OV_i(b);
5462 splev_stack_push(coder->stack, a);
5466 case SPO_MATH_MOD: {
5467 struct opvar *a, *b;
5469 if (!OV_pop_i(b) || !OV_pop_i(a))
5472 OV_i(a) = OV_i(a) % OV_i(b);
5476 splev_stack_push(coder->stack, a);
5489 impossible("spo_cmp: no values in stack");
5492 if (OV_typ(a) != OV_typ(b)) {
5493 impossible("spo_cmp: trying to compare differing datatypes");
5496 switch (OV_typ(a)) {
5499 case SPOVAR_MAPCHAR:
5503 if (OV_i(b) > OV_i(a))
5504 val |= SP_CPUFLAG_LT;
5505 if (OV_i(b) < OV_i(a))
5506 val |= SP_CPUFLAG_GT;
5507 if (OV_i(b) == OV_i(a))
5508 val |= SP_CPUFLAG_EQ;
5509 c = opvar_new_int(val);
5512 c = opvar_new_int(!strcmp(OV_s(b), OV_s(a))
5517 c = opvar_new_int(0);
5520 splev_stack_push(coder->stack, c);
5526 spo_jmp(coder, lvl);
5534 spo_conditional_jump(coder, lvl);
5540 if (!OV_pop_i(tmpv))
5542 t = opvar_new_int((OV_i(tmpv) > 1) ? rn2(OV_i(tmpv)) : 0);
5543 splev_stack_push(coder->stack, t);
5548 struct opvar *a, *b, *t;
5550 if (!OV_pop_i(b) || !OV_pop_i(a))
5556 t = opvar_new_int(d(OV_i(a), OV_i(b)));
5557 splev_stack_push(coder->stack, t);
5566 spo_var_init(coder);
5568 case SPO_SHUFFLE_ARRAY:
5569 spo_shuffle_array(coder);
5571 case SPO_SEL_ADD: /* actually, logical or */
5573 struct opvar *sel1, *sel2, *pt;
5575 if (!OV_pop_typ(sel1, SPOVAR_SEL))
5576 panic("no sel1 for add");
5577 if (!OV_pop_typ(sel2, SPOVAR_SEL))
5578 panic("no sel2 for add");
5579 pt = selection_logical_oper(sel1, sel2, '|');
5582 splev_stack_push(coder->stack, pt);
5585 case SPO_SEL_COMPLEMENT: {
5586 struct opvar *sel, *pt;
5588 if (!OV_pop_typ(sel, SPOVAR_SEL))
5589 panic("no sel for not");
5590 pt = selection_not(sel);
5592 splev_stack_push(coder->stack, pt);
5595 case SPO_SEL_FILTER: /* sorta like logical and */
5597 struct opvar *filtertype;
5599 if (!OV_pop_i(filtertype))
5600 panic("no sel filter type");
5601 switch (OV_i(filtertype)) {
5602 case SPOFILTER_PERCENT: {
5603 struct opvar *tmp1, *sel;
5605 if (!OV_pop_i(tmp1))
5606 panic("no sel filter percent");
5607 if (!OV_pop_typ(sel, SPOVAR_SEL))
5608 panic("no sel filter");
5609 selection_filter_percent(sel, OV_i(tmp1));
5610 splev_stack_push(coder->stack, sel);
5614 case SPOFILTER_SELECTION: /* logical and */
5616 struct opvar *pt, *sel1, *sel2;
5618 if (!OV_pop_typ(sel1, SPOVAR_SEL))
5619 panic("no sel filter sel1");
5620 if (!OV_pop_typ(sel2, SPOVAR_SEL))
5621 panic("no sel filter sel2");
5622 pt = selection_logical_oper(sel1, sel2, '&');
5623 splev_stack_push(coder->stack, pt);
5628 case SPOFILTER_MAPCHAR: {
5629 struct opvar *pt, *tmp1, *sel;
5631 if (!OV_pop_typ(sel, SPOVAR_SEL))
5632 panic("no sel filter");
5633 if (!OV_pop_typ(tmp1, SPOVAR_MAPCHAR))
5634 panic("no sel filter mapchar");
5635 pt = selection_filter_mapchar(sel, tmp1);
5636 splev_stack_push(coder->stack, pt);
5642 panic("unknown sel filter type");
5644 opvar_free(filtertype);
5647 case SPO_SEL_POINT: {
5649 struct opvar *pt = selection_opvar((char *) 0);
5653 panic("no ter sel coord");
5654 get_location_coord(&x, &y, ANY_LOC, coder->croom, OV_i(tmp));
5655 selection_setpoint(x, y, pt, 1);
5656 splev_stack_push(coder->stack, pt);
5661 case SPO_SEL_FILLRECT: {
5662 struct opvar *tmp, *pt = selection_opvar((char *) 0);
5663 schar x, y, x1, y1, x2, y2;
5666 panic("no ter sel region");
5667 x1 = min(SP_REGION_X1(OV_i(tmp)), SP_REGION_X2(OV_i(tmp)));
5668 y1 = min(SP_REGION_Y1(OV_i(tmp)), SP_REGION_Y2(OV_i(tmp)));
5669 x2 = max(SP_REGION_X1(OV_i(tmp)), SP_REGION_X2(OV_i(tmp)));
5670 y2 = max(SP_REGION_Y1(OV_i(tmp)), SP_REGION_Y2(OV_i(tmp)));
5671 get_location(&x1, &y1, ANY_LOC, coder->croom);
5672 get_location(&x2, &y2, ANY_LOC, coder->croom);
5673 x1 = (x1 < 0) ? 0 : x1;
5674 y1 = (y1 < 0) ? 0 : y1;
5675 x2 = (x2 >= COLNO) ? COLNO - 1 : x2;
5676 y2 = (y2 >= ROWNO) ? ROWNO - 1 : y2;
5677 if (coder->opcode == SPO_SEL_RECT) {
5678 for (x = x1; x <= x2; x++) {
5679 selection_setpoint(x, y1, pt, 1);
5680 selection_setpoint(x, y2, pt, 1);
5682 for (y = y1; y <= y2; y++) {
5683 selection_setpoint(x1, y, pt, 1);
5684 selection_setpoint(x2, y, pt, 1);
5687 for (x = x1; x <= x2; x++)
5688 for (y = y1; y <= y2; y++)
5689 selection_setpoint(x, y, pt, 1);
5691 splev_stack_push(coder->stack, pt);
5695 case SPO_SEL_LINE: {
5696 struct opvar *tmp = NULL, *tmp2 = NULL,
5697 *pt = selection_opvar((char *) 0);
5698 schar x1, y1, x2, y2;
5701 panic("no ter sel linecoord1");
5702 if (!OV_pop_c(tmp2))
5703 panic("no ter sel linecoord2");
5704 get_location_coord(&x1, &y1, ANY_LOC, coder->croom, OV_i(tmp));
5705 get_location_coord(&x2, &y2, ANY_LOC, coder->croom, OV_i(tmp2));
5706 x1 = (x1 < 0) ? 0 : x1;
5707 y1 = (y1 < 0) ? 0 : y1;
5708 x2 = (x2 >= COLNO) ? COLNO - 1 : x2;
5709 y2 = (y2 >= ROWNO) ? ROWNO - 1 : y2;
5710 selection_do_line(x1, y1, x2, y2, pt);
5711 splev_stack_push(coder->stack, pt);
5716 case SPO_SEL_RNDLINE: {
5717 struct opvar *tmp = NULL, *tmp2 = NULL, *tmp3,
5718 *pt = selection_opvar((char *) 0);
5719 schar x1, y1, x2, y2;
5721 if (!OV_pop_i(tmp3))
5722 panic("no ter sel randline1");
5724 panic("no ter sel randline2");
5725 if (!OV_pop_c(tmp2))
5726 panic("no ter sel randline3");
5727 get_location_coord(&x1, &y1, ANY_LOC, coder->croom, OV_i(tmp));
5728 get_location_coord(&x2, &y2, ANY_LOC, coder->croom, OV_i(tmp2));
5729 x1 = (x1 < 0) ? 0 : x1;
5730 y1 = (y1 < 0) ? 0 : y1;
5731 x2 = (x2 >= COLNO) ? COLNO - 1 : x2;
5732 y2 = (y2 >= ROWNO) ? ROWNO - 1 : y2;
5733 selection_do_randline(x1, y1, x2, y2, OV_i(tmp3), 12, pt);
5734 splev_stack_push(coder->stack, pt);
5740 case SPO_SEL_GROW: {
5741 struct opvar *dirs, *pt;
5743 if (!OV_pop_i(dirs))
5744 panic("no dirs for grow");
5745 if (!OV_pop_typ(pt, SPOVAR_SEL))
5746 panic("no selection for grow");
5747 selection_do_grow(pt, OV_i(dirs));
5748 splev_stack_push(coder->stack, pt);
5752 case SPO_SEL_FLOOD: {
5757 panic("no ter sel flood coord");
5758 get_location_coord(&x, &y, ANY_LOC, coder->croom, OV_i(tmp));
5760 struct opvar *pt = selection_opvar((char *) 0);
5762 set_selection_floodfillchk(floodfillchk_match_under);
5763 floodfillchk_match_under_typ = levl[x][y].typ;
5764 selection_floodfill(pt, x, y, FALSE);
5765 splev_stack_push(coder->stack, pt);
5770 case SPO_SEL_RNDCOORD: {
5774 if (!OV_pop_typ(pt, SPOVAR_SEL))
5775 panic("no selection for rndcoord");
5776 if (selection_rndcoord(pt, &x, &y, FALSE)) {
5780 splev_stack_push(coder->stack, opvar_new_coord(x, y));
5784 case SPO_SEL_ELLIPSE: {
5785 struct opvar *filled, *xaxis, *yaxis, *pt;
5786 struct opvar *sel = selection_opvar((char *) 0);
5789 if (!OV_pop_i(filled))
5790 panic("no filled for ellipse");
5791 if (!OV_pop_i(yaxis))
5792 panic("no yaxis for ellipse");
5793 if (!OV_pop_i(xaxis))
5794 panic("no xaxis for ellipse");
5796 panic("no pt for ellipse");
5797 get_location_coord(&x, &y, ANY_LOC, coder->croom, OV_i(pt));
5798 selection_do_ellipse(sel, x, y, OV_i(xaxis), OV_i(yaxis),
5800 splev_stack_push(coder->stack, sel);
5807 case SPO_SEL_GRADIENT: {
5808 struct opvar *gtyp, *glim, *mind, *maxd, *gcoord, *coord2;
5812 if (!OV_pop_i(gtyp))
5813 panic("no gtyp for grad");
5814 if (!OV_pop_i(glim))
5815 panic("no glim for grad");
5816 if (!OV_pop_c(coord2))
5817 panic("no coord2 for grad");
5818 if (!OV_pop_c(gcoord))
5819 panic("no coord for grad");
5820 if (!OV_pop_i(maxd))
5821 panic("no maxd for grad");
5822 if (!OV_pop_i(mind))
5823 panic("no mind for grad");
5824 get_location_coord(&x, &y, ANY_LOC, coder->croom, OV_i(gcoord));
5825 get_location_coord(&x2, &y2, ANY_LOC, coder->croom, OV_i(coord2));
5827 sel = selection_opvar((char *) 0);
5828 selection_do_gradient(sel, x, y, x2, y2, OV_i(gtyp), OV_i(mind),
5829 OV_i(maxd), OV_i(glim));
5830 splev_stack_push(coder->stack, sel);
5841 panic("sp_level_coder: Unknown opcode %i", coder->opcode);
5845 coder->frame->n_opcode++;
5850 remove_boundary_syms();
5852 if (coder->check_inaccessibles)
5854 /* FIXME: Ideally, we want this call to only cover areas of the map
5855 * which were not inserted directly by the special level file (see
5856 * the insect legs on Baalzebub's level, for instance). Since that
5857 * is currently not possible, we overload the corrmaze flag for this
5860 if (!level.flags.corrmaze)
5861 wallification(1, 0, COLNO - 1, ROWNO - 1);
5865 if (coder->premapped)
5867 if (coder->solidify)
5871 struct sp_frame *tmpframe;
5873 tmpframe = coder->frame->next;
5874 frame_del(coder->frame);
5875 coder->frame = tmpframe;
5876 } while (coder->frame);
5892 boolean result = FALSE;
5893 struct version_info vers_info;
5895 fd = dlb_fopen(name, RDBMODE);
5898 Fread((genericptr_t) &vers_info, sizeof vers_info, 1, fd);
5899 if (!check_version(&vers_info, name, TRUE)) {
5900 (void) dlb_fclose(fd);
5903 lvl = (sp_lev *) alloc(sizeof(sp_lev));
5904 result = sp_level_loader(fd, lvl);
5905 (void) dlb_fclose(fd);
5907 result = sp_level_coder(lvl);
5916 #pragma warning(pop)