ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/map.C
(Generate patch)

Comparing deliantra/server/common/map.C (file contents):
Revision 1.46 by root, Wed Dec 20 11:36:38 2006 UTC vs.
Revision 1.218 by root, Mon Oct 29 23:55:52 2012 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
8 it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
9 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 11 * option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
18 along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22*/ 23 */
23 24
24
25#include <global.h>
26#include <funcpoint.h>
27
28#include <loader.h>
29#include <unistd.h> 25#include <unistd.h>
30 26
27#include "global.h"
31#include "path.h" 28#include "path.h"
32 29
33/* 30//+GPL
34 * Returns the maptile which has a name matching the given argument.
35 * return NULL if no match is found.
36 */
37 31
38maptile * 32sint8 maptile::outdoor_darkness;
39has_been_loaded (const char *name)
40{
41 maptile *map;
42
43 if (!name || !*name)
44 return 0;
45 for (map = first_map; map; map = map->next)
46 if (!strcmp (name, map->path))
47 break;
48 return (map);
49}
50
51/*
52 * This makes a path absolute outside the world of Crossfire.
53 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
54 * and returns the pointer to a static array containing the result.
55 * it really should be called create_mapname
56 */
57
58const char *
59create_pathname (const char *name)
60{
61 static char buf[MAX_BUF];
62
63 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
64 * someplace else in the code? msw 2-17-97
65 */
66 if (*name == '/')
67 sprintf (buf, "%s/%s%s", settings.datadir, settings.mapdir, name);
68 else
69 sprintf (buf, "%s/%s/%s", settings.datadir, settings.mapdir, name);
70 return (buf);
71}
72
73/*
74 * same as create_pathname, but for the overlay maps.
75 */
76
77const char *
78create_overlay_pathname (const char *name)
79{
80 static char buf[MAX_BUF];
81
82 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
83 * someplace else in the code? msw 2-17-97
84 */
85 if (*name == '/')
86 sprintf (buf, "%s/%s%s", settings.localdir, settings.mapdir, name);
87 else
88 sprintf (buf, "%s/%s/%s", settings.localdir, settings.mapdir, name);
89 return (buf);
90}
91
92/*
93 * same as create_pathname, but for the template maps.
94 */
95
96const char *
97create_template_pathname (const char *name)
98{
99 static char buf[MAX_BUF];
100
101 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
102 * someplace else in the code? msw 2-17-97
103 */
104 if (*name == '/')
105 sprintf (buf, "%s/%s%s", settings.localdir, settings.templatedir, name);
106 else
107 sprintf (buf, "%s/%s/%s", settings.localdir, settings.templatedir, name);
108 return (buf);
109}
110
111/*
112 * This makes absolute path to the itemfile where unique objects
113 * will be saved. Converts '/' to '@'. I think it's essier maintain
114 * files than full directory structure, but if this is problem it can
115 * be changed.
116 */
117static const char *
118create_items_path (const char *s)
119{
120 static char buf[MAX_BUF];
121 char *t;
122
123 if (*s == '/')
124 s++;
125
126 sprintf (buf, "%s/%s/", settings.localdir, settings.uniquedir);
127
128 for (t = buf + strlen (buf); *s; s++, t++)
129 if (*s == '/')
130 *t = '@';
131 else
132 *t = *s;
133 *t = 0;
134 return (buf);
135}
136
137
138/*
139 * This function checks if a file with the given path exists.
140 * -1 is returned if it fails, otherwise the mode of the file
141 * is returned.
142 * It tries out all the compression suffixes listed in the uncomp[] array.
143 *
144 * If prepend_dir is set, then we call create_pathname (which prepends
145 * libdir & mapdir). Otherwise, we assume the name given is fully
146 * complete.
147 * Only the editor actually cares about the writablity of this -
148 * the rest of the code only cares that the file is readable.
149 * when the editor goes away, the call to stat should probably be
150 * replaced by an access instead (similar to the windows one, but
151 * that seems to be missing the prepend_dir processing
152 */
153
154int
155check_path (const char *name, int prepend_dir)
156{
157 char buf[MAX_BUF];
158
159 char *endbuf;
160 struct stat statbuf;
161 int mode = 0;
162
163 if (prepend_dir)
164 strcpy (buf, create_pathname (name));
165 else
166 strcpy (buf, name);
167
168 /* old method (strchr(buf, '\0')) seemd very odd to me -
169 * this method should be equivalant and is clearer.
170 * Can not use strcat because we need to cycle through
171 * all the names.
172 */
173 endbuf = buf + strlen (buf);
174
175 if (stat (buf, &statbuf))
176 return -1;
177 if (!S_ISREG (statbuf.st_mode))
178 return (-1);
179
180 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
181 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
182 mode |= 4;
183
184 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
185 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
186 mode |= 2;
187
188 return (mode);
189}
190
191/*
192 * Prints out debug-information about a map.
193 * Dumping these at llevError doesn't seem right, but is
194 * necessary to make sure the information is in fact logged.
195 */
196
197void
198dump_map (const maptile *m)
199{
200 LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory);
201 LOG (llevError, "Size: %dx%d Start: %d,%d\n", MAP_WIDTH (m), MAP_HEIGHT (m), MAP_ENTER_X (m), MAP_ENTER_Y (m));
202
203 if (m->msg != NULL)
204 LOG (llevError, "Message:\n%s", m->msg);
205
206 if (m->maplore != NULL)
207 LOG (llevError, "Lore:\n%s", m->maplore);
208
209 if (m->tmpname != NULL)
210 LOG (llevError, "Tmpname: %s\n", m->tmpname);
211
212 LOG (llevError, "Difficulty: %d\n", m->difficulty);
213 LOG (llevError, "Darkness: %d\n", m->darkness);
214}
215
216/*
217 * Prints out debug-information about all maps.
218 * This basically just goes through all the maps and calls
219 * dump_map on each one.
220 */
221
222void
223dump_all_maps (void)
224{
225 maptile *m;
226
227 for (m = first_map; m; m = m->next)
228 dump_map (m);
229}
230 33
231/* This rolls up wall, blocks_magic, blocks_view, etc, all into 34/* This rolls up wall, blocks_magic, blocks_view, etc, all into
232 * one function that just returns a P_.. value (see map.h) 35 * one function that just returns a P_.. value (see map.h)
233 * it will also do map translation for tiled maps, returning 36 * it will also do map translation for tiled maps, returning
234 * new values into newmap, nx, and ny. Any and all of those 37 * new values into newmap, nx, and ny. Any and all of those
… …
239 * don't expect to insert/remove anything from those spaces. 42 * don't expect to insert/remove anything from those spaces.
240 */ 43 */
241int 44int
242get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny) 45get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny)
243{ 46{
244 sint16 newx, newy;
245 int retval = 0;
246 maptile *mp;
247
248 newx = x; 47 sint16 newx = x;
249 newy = y; 48 sint16 newy = y;
250 49
251 mp = get_map_from_coord (oldmap, &newx, &newy); 50 maptile *mp = get_map_from_coord (oldmap, &newx, &newy);
252 51
253 if (!mp) 52 if (!mp)
254 return P_OUT_OF_MAP; 53 return P_OUT_OF_MAP;
255
256 if (mp != oldmap)
257 retval |= P_NEW_MAP;
258 54
259 if (newmap) *newmap = mp; 55 if (newmap) *newmap = mp;
260 if (nx) *nx = newx; 56 if (nx) *nx = newx;
261 if (ny) *ny = newy; 57 if (ny) *ny = newy;
262 58
263 return retval | mp->at (newx, newy).flags (); 59 return mp->at (newx, newy).flags () | (mp != oldmap ? P_NEW_MAP : 0);
264} 60}
265 61
266/* 62/*
267 * Returns true if the given coordinate is blocked except by the 63 * Returns true if the given coordinate is blocked except by the
268 * object passed is not blocking. This is used with 64 * object passed is not blocking. This is used with
… …
276 * by the caller. 72 * by the caller.
277 */ 73 */
278int 74int
279blocked_link (object *ob, maptile *m, int sx, int sy) 75blocked_link (object *ob, maptile *m, int sx, int sy)
280{ 76{
281 object *tmp;
282 int mflags, blocked;
283
284 /* Make sure the coordinates are valid - they should be, as caller should 77 /* Make sure the coordinates are valid - they should be, as caller should
285 * have already checked this. 78 * have already checked this.
286 */ 79 */
287 if (OUT_OF_REAL_MAP (m, sx, sy)) 80 if (OUT_OF_REAL_MAP (m, sx, sy))
288 { 81 {
289 LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); 82 LOG (llevError | logBacktrace, "blocked_link: Passed map, x, y coordinates outside of map\n");
290 return 1; 83 return 1;
291 } 84 }
292 85
293 /* Save some cycles - instead of calling get_map_flags(), just get the value 86 mapspace &ms = m->at (sx, sy);
294 * directly.
295 */
296 mflags = m->at (sx, sy).flags ();
297 87
298 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 88 int mflags = ms.flags ();
89 int blocked = ms.move_block;
299 90
300 /* If space is currently not blocked by anything, no need to 91 /* If space is currently not blocked by anything, no need to
301 * go further. Not true for players - all sorts of special 92 * go further. Not true for players - all sorts of special
302 * things we need to do for players. 93 * things we need to do for players.
303 */ 94 */
304 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 95 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
305 return 0; 96 return 0;
306 97
307 /* if there isn't anytyhing alive on this space, and this space isn't 98 /* if there isn't anything alive on this space, and this space isn't
308 * otherwise blocked, we can return now. Only if there is a living 99 * otherwise blocked, we can return now. Only if there is a living
309 * creature do we need to investigate if it is part of this creature 100 * creature do we need to investigate if it is part of this creature
310 * or another. Likewise, only if something is blocking us do we 101 * or another. Likewise, only if something is blocking us do we
311 * need to investigate if there is a special circumstance that would 102 * need to investigate if there is a special circumstance that would
312 * let the player through (inventory checkers for example) 103 * let the player through (inventory checkers for example)
313 */ 104 */
314 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 105 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
315 return 0; 106 return 0;
316 107
317 if (ob->head != NULL)
318 ob = ob->head; 108 ob = ob->head_ ();
319 109
320 /* We basically go through the stack of objects, and if there is 110 /* We basically go through the stack of objects, and if there is
321 * some other object that has NO_PASS or FLAG_ALIVE set, return 111 * some other object that has NO_PASS or FLAG_ALIVE set, return
322 * true. If we get through the entire stack, that must mean 112 * true. If we get through the entire stack, that must mean
323 * ob is blocking it, so return 0. 113 * ob is blocking it, so return 0.
324 */ 114 */
325 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) 115 for (object *tmp = ms.top; tmp; tmp = tmp->below)
326 { 116 {
327 117 if (OB_MOVE_BLOCK (ob, tmp))
328 /* This must be before the checks below. Code for inventory checkers. */
329 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
330 { 118 {
331 /* If last_sp is set, the player/monster needs an object, 119 if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
332 * so we check for it. If they don't have it, they can't 120 if (RESULT_INT (0))
333 * pass through this space. 121 return 1;
334 */ 122 else
335 if (tmp->last_sp) 123 continue;
124
125 if (tmp->type == CHECK_INV)
336 { 126 {
337 if (check_inv_recursive (ob, tmp) == NULL) 127 bool have = check_inv_recursive (ob, tmp);
128
129 // last_sp set means we block if we don't have.
130 if (logical_xor (have, tmp->last_sp))
338 return 1; 131 return 1;
339 else 132 }
340 continue; 133 else if (tmp->type == T_MATCH)
134 {
135 // T_MATCH allows "entrance" iff the match is true
136 // == blocks if the match fails
137
138 // we could have used an INVOKE_OBJECT, but decided against it, as we
139 // assume that T_MATCH is relatively common.
140 if (!match (tmp->slaying, ob, tmp, ob))
141 return 1;
341 } 142 }
342 else 143 else
343 { 144 return 1; // unconditional block
344 /* In this case, the player must not have the object - 145
345 * if they do, they can't pass through.
346 */
347 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
348 return 1;
349 else
350 continue;
351 }
352 } /* if check_inv */
353 else 146 } else {
354 { 147 // space does not block the ob, directly, but
355 /* Broke apart a big nasty if into several here to make 148 // anything alive that is not a door still
356 * this more readable. first check - if the space blocks 149 // blocks anything
357 * movement, can't move here. 150
358 * second - if a monster, can't move there, unles it is a 151 if (tmp->flag [FLAG_ALIVE]
359 * hidden dm 152 && tmp->type != DOOR
360 */ 153 && tmp->head_ () != ob) //TODO: maybe move these check up?
361 if (OB_MOVE_BLOCK (ob, tmp))
362 return 1;
363 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob &&
364 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden))
365 return 1; 154 return 1;
366 } 155 }
367
368 } 156 }
157
369 return 0; 158 return 0;
370} 159}
371 160
372
373/* 161/*
374 * Returns true if the given object can't fit in the given spot. 162 * Returns the blocking object if the given object can't fit in the given
375 * This is meant for multi space objects - for single space objecs, 163 * spot. This is meant for multi space objects - for single space objecs,
376 * just calling get_map_blocked and checking that against movement type 164 * just calling get_map_blocked and checking that against movement type
377 * of object. This function goes through all the parts of the 165 * of object. This function goes through all the parts of the multipart
378 * multipart object and makes sure they can be inserted. 166 * object and makes sure they can be inserted.
379 * 167 *
380 * While this doesn't call out of map, the get_map_flags does. 168 * While this doesn't call out of map, the get_map_flags does.
381 * 169 *
382 * This function has been used to deprecate arch_out_of_map - 170 * This function has been used to deprecate arch_out_of_map -
383 * this function also does that check, and since in most cases, 171 * this function also does that check, and since in most cases,
… …
394 * 182 *
395 * Note this used to be arch_blocked, but with new movement 183 * Note this used to be arch_blocked, but with new movement
396 * code, we need to have actual object to check its move_type 184 * code, we need to have actual object to check its move_type
397 * against the move_block values. 185 * against the move_block values.
398 */ 186 */
399int 187bool
400ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 188object::blocked (maptile *m, int x, int y) const
401{ 189{
402 archetype *tmp; 190 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
403 int flag;
404 maptile *m1;
405 sint16 sx, sy;
406
407 if (ob == NULL)
408 {
409 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
410 if (flag & P_OUT_OF_MAP)
411 return P_OUT_OF_MAP;
412
413 /* don't have object, so don't know what types would block */
414 return (GET_MAP_MOVE_BLOCK (m1, sx, sy));
415 } 191 {
192 mapxy pos (m, x + tmp->x, y + tmp->y);
416 193
417 for (tmp = ob->arch; tmp != NULL; tmp = tmp->more) 194 if (!pos.normalise ())
418 { 195 return 1;
419 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
420 196
421 if (flag & P_OUT_OF_MAP) 197 mapspace &ms = *pos;
422 return P_OUT_OF_MAP; 198
423 if (flag & P_IS_ALIVE) 199 if (ms.flags () & P_IS_ALIVE)
424 return P_IS_ALIVE; 200 return 1;
425 201
426 /* find_first_free_spot() calls this function. However, often 202 /* However, often ob doesn't have any move type
427 * ob doesn't have any move type (when used to place exits) 203 * (signifying non-moving objects)
428 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 204 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
429 */ 205 */
430 206 if (!move_type && ms.move_block != MOVE_ALL)
431 if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK (m1, sx, sy) != MOVE_ALL)
432 continue; 207 continue;
433 208
434 /* Note it is intentional that we check ob - the movement type of the 209 /* Note it is intentional that we check ob - the movement type of the
435 * head of the object should correspond for the entire object. 210 * head of the object should correspond for the entire object.
436 */ 211 */
437 if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy))) 212 if (ms.blocks (move_type))
438 return P_NO_PASS; 213 return 1;
439 } 214 }
440 215
441 return 0; 216 return 0;
442} 217}
443 218
444/* When the map is loaded, load_object does not actually insert objects 219//-GPL
445 * into inventory, but just links them. What this does is go through
446 * and insert them properly.
447 * The object 'container' is the object that contains the inventory.
448 * This is needed so that we can update the containers weight.
449 */
450 220
451void 221void
452fix_container (object *container) 222maptile::set_object_flag (int flag, int value)
453{ 223{
454 object *tmp = container->inv, *next; 224 if (!spaces)
225 return;
455 226
456 container->inv = NULL; 227 for (mapspace *ms = spaces + size (); ms-- > spaces; )
457 while (tmp != NULL) 228 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
458 { 229 tmp->flag [flag] = value;
459 next = tmp->below;
460 if (tmp->inv)
461 fix_container (tmp);
462 (void) insert_ob_in_ob (tmp, container);
463 tmp = next;
464 }
465 /* sum_weight will go through and calculate what all the containers are
466 * carrying.
467 */
468 sum_weight (container);
469} 230}
231
232void
233maptile::post_load_original ()
234{
235 if (!spaces)
236 return;
237
238 set_object_flag (FLAG_OBJ_ORIGINAL);
239
240 for (mapspace *ms = spaces + size (); ms-- > spaces; )
241 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
242 INVOKE_OBJECT (RESET, tmp);
243}
244
245void
246maptile::post_load ()
247{
248#if 0
249 if (!spaces)
250 return;
251
252 for (mapspace *ms = spaces + size (); ms-- > spaces; )
253 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
254 ; // nop
255#endif
256}
257
258//+GPL
470 259
471/* link_multipart_objects go through all the objects on the map looking 260/* link_multipart_objects go through all the objects on the map looking
472 * for objects whose arch says they are multipart yet according to the 261 * for objects whose arch says they are multipart yet according to the
473 * info we have, they only have the head (as would be expected when 262 * info we have, they only have the head (as would be expected when
474 * they are saved). We do have to look for the old maps that did save 263 * they are saved).
475 * the more sections and not re-add sections for them.
476 */ 264 */
477 265void
478static void 266maptile::link_multipart_objects ()
479link_multipart_objects (maptile *m)
480{ 267{
481 int x, y; 268 if (!spaces)
482 object *tmp, *op, *last, *above; 269 return;
483 archetype *at;
484 270
485 for (x = 0; x < MAP_WIDTH (m); x++) 271 for (mapspace *ms = spaces + size (); ms-- > spaces; )
486 for (y = 0; y < MAP_HEIGHT (m); y++) 272 {
487 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = above) 273 object *op = ms->bot;
274 while (op)
488 { 275 {
489 above = tmp->above;
490
491 /* already multipart - don't do anything more */ 276 /* already multipart - don't do anything more */
492 if (tmp->head || tmp->more) 277 if (op->head_ () == op && !op->more && op->arch->more)
493 continue;
494
495 /* If there is nothing more to this object, this for loop
496 * won't do anything.
497 */
498 for (at = tmp->arch->more, last = tmp; at != NULL; at = at->more, last = op)
499 { 278 {
500 op = arch_to_object (at); 279 op->remove ();
280 op->expand_tail ();
501 281
502 /* update x,y coordinates */ 282 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
503 op->x += tmp->x; 283 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
504 op->y += tmp->y; 284 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
505 op->head = tmp; 285 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
506 op->map = m; 286
507 last->more = op; 287 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
508 op->name = tmp->name; 288 // so we have to reset the iteration through the mapspace
509 op->title = tmp->title;
510 /* we could link all the parts onto tmp, and then just
511 * call insert_ob_in_map once, but the effect is the same,
512 * as insert_ob_in_map will call itself with each part, and
513 * the coding is simpler to just to it here with each part.
514 */ 289 }
515 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 290 else
516 } /* for at = tmp->arch->more */ 291 op = op->above;
517 } /* for objects on this space */ 292 }
293 }
518} 294}
295
296//-GPL
519 297
520/* 298/*
521 * Loads (ands parses) the objects into a given map from the specified 299 * Loads (ands parses) the objects into a given map from the specified
522 * file pointer. 300 * file pointer.
523 * mapflags is the same as we get with load_original_map
524 */ 301 */
525void 302bool
526load_objects (maptile *m, object_thawer & fp, int mapflags) 303maptile::_load_objects (object_thawer &f)
527{ 304{
528 int i, j; 305 for (;;)
529 int unique;
530 object *op, *prev = NULL, *last_more = NULL, *otmp;
531
532 op = object::create ();
533 op->map = m; /* To handle buttons correctly */
534
535 while ((i = load_object (fp, op, mapflags)))
536 { 306 {
537 /* if the archetype for the object is null, means that we 307 coroapi::cede_to_tick (); // cede once in a while
538 * got an invalid object. Don't do anything with it - the game 308
539 * or editor will not be able to do anything with it either. 309 switch (f.kw)
540 */
541 if (op->arch == NULL)
542 { 310 {
543 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 311 case KW_arch:
312 if (object *op = object::read (f, this))
313 {
314 // TODO: why?
315 if (op->inv)
316 {
317 op->carrying = 0;
318 op->update_weight ();
319 }
320
321 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
322 {
323 // we insert manually because
324 // a) its way faster
325 // b) we remove manually, too, and there are good reasons for that
326 // c) it's correct
327 mapspace &ms = at (op->x, op->y);
328
329 op->flag [FLAG_REMOVED] = false;
330
331 op->above = 0;
332 op->below = ms.top;
333
334 *(ms.top ? &ms.top->above : &ms.bot) = op;
335
336 ms.top = op;
337 ms.flags_ = 0;
338 }
339 else
340 {
341 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
342 op->destroy ();
343 }
344 }
345
544 continue; 346 continue;
545 }
546 347
547
548 switch (i)
549 {
550 case LL_NORMAL:
551 /* if we are loading an overlay, put the floors on the bottom */
552 if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY)
553 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD);
554 else
555 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
556
557 if (op->inv)
558 sum_weight (op);
559
560 prev = op, last_more = op;
561 break;
562
563 case LL_MORE: 348 case KW_EOF:
564 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 349 return true;
565 op->head = prev, last_more->more = op, last_more = op; 350
351 default:
352 if (!f.parse_error ("map file"))
353 return false;
566 break; 354 break;
567 } 355 }
568 356
569 if (mapflags & MAP_STYLE) 357 f.next ();
570 remove_from_active_list (op);
571
572 op = object::create ();
573 op->map = m;
574 }
575
576 for (i = 0; i < m->width; i++)
577 { 358 }
578 for (j = 0; j < m->height; j++) 359
360 return true;
361}
362
363void
364maptile::activate ()
365{
366 if (state != MAP_INACTIVE)
367 return;
368
369 for (mapspace *ms = spaces + size (); ms-- > spaces; )
370 for (object *op = ms->bot; op; op = op->above)
371 op->activate_recursive ();
372
373 state = MAP_ACTIVE;
374
375 activate_physics ();
376}
377
378void
379maptile::deactivate ()
380{
381 if (state != MAP_ACTIVE)
382 return;
383
384 for (mapspace *ms = spaces + size (); ms-- > spaces; )
385 for (object *op = ms->bot; op; op = op->above)
386 op->deactivate_recursive ();
387
388 state = MAP_INACTIVE;
389}
390
391bool
392maptile::_save_objects (object_freezer &f, int flags)
393{
394 coroapi::cede_to_tick ();
395
396 if (flags & IO_HEADER)
397 _save_header (f);
398
399 if (!spaces)
400 return false;
401
402 for (int i = 0; i < size (); ++i)
403 {
404 bool unique = 0;
405
406 for (object *op = spaces [i].bot; op; op = op->above)
579 { 407 {
580 unique = 0; 408 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
581 /* check for unique items, or unique squares */ 409
582 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above) 410 if (expect_false (!op->can_map_save ()))
411 continue;
412
413 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
583 { 414 {
584 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) 415 if (flags & IO_UNIQUES)
585 unique = 1; 416 op->write (f);
586
587 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
588 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
589 } 417 }
418 else if (expect_true (flags & IO_OBJECTS))
419 op->write (f);
590 } 420 }
591 } 421 }
592 422
593 op->destroy (); 423 coroapi::cede_to_tick ();
594 link_multipart_objects (m);
595}
596 424
597/* This saves all the objects on the map in a non destructive fashion. 425 return true;
598 * Modified by MSW 2001-07-01 to do in a single pass - reduces code, 426}
599 * and we only save the head of multi part objects - this is needed 427
600 * in order to do map tiling properly. 428bool
429maptile::_save_objects (const char *path, int flags)
430{
431 object_freezer freezer;
432
433 if (!_save_objects (freezer, flags))
434 return false;
435
436 return freezer.save (path);
437}
438
439void
440maptile::init ()
441{
442 state = MAP_SWAPPED;
443
444 /* The maps used to pick up default x and y values from the
445 * map archetype. Mimic that behaviour.
601 */ 446 */
602void 447 width = 16;
603save_objects (maptile *m, object_freezer & fp, object_freezer & fp2, int flag) 448 height = 16;
604{ 449 timeout = 300;
605 int i, j = 0, unique = 0; 450 max_items = MAX_ITEM_PER_ACTION;
606 object *op; 451 max_volume = 2000000; // 2m³
607 452 reset_timeout = 0;
608 /* first pass - save one-part objects */ 453 enter_x = 0;
609 for (i = 0; i < MAP_WIDTH (m); i++) 454 enter_y = 0;
610 for (j = 0; j < MAP_HEIGHT (m); j++)
611 {
612 unique = 0;
613 for (op = GET_MAP_OB (m, i, j); op; op = op->above)
614 {
615 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
616 unique = 1;
617
618 if (op->type == PLAYER)
619 continue;
620
621 if (op->head || op->owner)
622 continue;
623
624 if (unique || QUERY_FLAG (op, FLAG_UNIQUE))
625 save_object (fp2, op, 3);
626 else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID))))
627 save_object (fp, op, 3);
628 }
629 }
630} 455}
631 456
632maptile::maptile () 457maptile::maptile ()
633{ 458{
634 in_memory = MAP_SWAPPED; 459 init ();
635 /* The maps used to pick up default x and y values from the
636 * map archetype. Mimic that behaviour.
637 */
638 MAP_WIDTH (this) = 16;
639 MAP_HEIGHT (this) = 16;
640 MAP_RESET_TIMEOUT (this) = 0;
641 MAP_TIMEOUT (this) = 300;
642 MAP_ENTER_X (this) = 0;
643 MAP_ENTER_Y (this) = 0;
644 /*set part to -1 indicating conversion to weather map not yet done */
645 MAP_WORLDPARTX (this) = -1;
646 MAP_WORLDPARTY (this) = -1;
647} 460}
648 461
649/* 462maptile::maptile (int w, int h)
650 * Allocates, initialises, and returns a pointer to a maptile.
651 * Modified to no longer take a path option which was not being
652 * used anyways. MSW 2001-07-01
653 */
654maptile *
655get_linked_map (void)
656{ 463{
657 maptile *mp, *map = new maptile; 464 init ();
658 465
659 for (mp = first_map; mp && mp->next; mp = mp->next); 466 width = w;
467 height = h;
660 468
661 if (mp == NULL) 469 alloc ();
662 first_map = map;
663 else
664 mp->next = map;
665
666 return map;
667} 470}
668 471
669/* 472/*
670 * Allocates the arrays contained in a maptile. 473 * Allocates the arrays contained in a maptile.
671 * This basically allocates the dynamic array of spaces for the 474 * This basically allocates the dynamic array of spaces for the
672 * map. 475 * map.
673 */ 476 */
674void 477void
675maptile::allocate () 478maptile::alloc ()
676{ 479{
677 in_memory = MAP_IN_MEMORY;
678
679 /* Log this condition and free the storage. We could I suppose
680 * realloc, but if the caller is presuming the data will be intact,
681 * that is their poor assumption.
682 */
683 if (spaces) 480 if (spaces)
684 {
685 LOG (llevError, "allocate_map called with already allocated map (%s)\n", path);
686 free (spaces);
687 }
688
689 spaces = (mapspace *)
690 calloc (1, width * height * sizeof (mapspace));
691
692 if (!spaces)
693 fatal (OUT_OF_MEMORY);
694}
695
696/* Create and returns a map of the specific size. Used
697 * in random map code and the editor.
698 */
699maptile *
700get_empty_map (int sizex, int sizey)
701{
702 maptile *m = get_linked_map ();
703
704 m->width = sizex;
705 m->height = sizey;
706 m->in_memory = MAP_SWAPPED;
707 m->allocate ();
708
709 return m; 481 return;
482
483 spaces = salloc0<mapspace> (size ());
710} 484}
485
486//+GPL
711 487
712/* Takes a string from a map definition and outputs a pointer to the array of shopitems 488/* Takes a string from a map definition and outputs a pointer to the array of shopitems
713 * corresponding to that string. Memory is allocated for this, it must be freed 489 * corresponding to that string. Memory is allocated for this, it must be freed
714 * at a later date. 490 * at a later date.
715 * Called by parse_map_headers below. 491 * Called by parse_map_headers below.
716 */ 492 */
717
718static shopitems * 493static shopitems *
719parse_shop_string (const char *input_string) 494parse_shop_string (const char *input_string)
720{ 495{
721 char *shop_string, *p, *q, *next_semicolon, *next_colon; 496 char *shop_string, *p, *q, *next_semicolon, *next_colon;
722 shopitems *items = NULL; 497 shopitems *items = NULL;
… …
731 p = strchr (p, ';'); 506 p = strchr (p, ';');
732 number_of_entries++; 507 number_of_entries++;
733 if (p) 508 if (p)
734 p++; 509 p++;
735 } 510 }
511
736 p = shop_string; 512 p = shop_string;
737 strip_endline (p); 513 strip_endline (p);
738 items = new shopitems[number_of_entries + 1]; 514 items = new shopitems[number_of_entries + 1];
739 for (i = 0; i < number_of_entries; i++) 515 for (i = 0; i < number_of_entries; i++)
740 { 516 {
741 if (!p) 517 if (!p)
742 { 518 {
743 LOG (llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n"); 519 LOG (llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n");
744 break; 520 break;
745 } 521 }
522
746 next_semicolon = strchr (p, ';'); 523 next_semicolon = strchr (p, ';');
747 next_colon = strchr (p, ':'); 524 next_colon = strchr (p, ':');
748 /* if there is a stregth specified, figure out what it is, we'll need it soon. */ 525 /* if there is a stregth specified, figure out what it is, we'll need it soon. */
749 if (next_colon && (!next_semicolon || next_colon < next_semicolon)) 526 if (next_colon && (!next_semicolon || next_colon < next_semicolon))
750 items[i].strength = atoi (strchr (p, ':') + 1); 527 items[i].strength = atoi (strchr (p, ':') + 1);
… …
766 *q = '\0'; 543 *q = '\0';
767 544
768 current_type = get_typedata_by_name (p); 545 current_type = get_typedata_by_name (p);
769 if (current_type) 546 if (current_type)
770 { 547 {
771 items[i].name = current_type->name; 548 items[i].name = current_type->name;
772 items[i].typenum = current_type->number; 549 items[i].typenum = current_type->number;
773 items[i].name_pl = current_type->name_pl; 550 items[i].name_pl = current_type->name_pl;
774 } 551 }
775 else 552 else
776 { /* oh uh, something's wrong, let's free up this one, and try 553 { /* oh uh, something's wrong, let's free up this one, and try
777 * the next entry while we're at it, better print a warning 554 * the next entry while we're at it, better print a warning
778 */ 555 */
779 LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string); 556 LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string);
780 } 557 }
781 } 558 }
559
782 items[i].index = number_of_entries; 560 items[i].index = number_of_entries;
783 if (next_semicolon) 561 if (next_semicolon)
784 p = ++next_semicolon; 562 p = ++next_semicolon;
785 else 563 else
786 p = NULL; 564 p = NULL;
787 } 565 }
566
788 free (shop_string); 567 free (shop_string);
789 return items; 568 return items;
790} 569}
791 570
792/* opposite of parse string, this puts the string that was originally fed in to 571/* opposite of parse string, this puts the string that was originally fed in to
793 * the map (or something equivilent) into output_string. */ 572 * the map (or something equivilent) into output_string. */
794static void 573static const char *
795print_shop_string (maptile *m, char *output_string) 574print_shop_string (maptile *m)
796{ 575{
797 int i; 576 static dynbuf_text buf; buf.clear ();
798 char tmp[MAX_BUF]; 577 bool first = true;
799 578
800 strcpy (output_string, "");
801 for (i = 0; i < m->shopitems[0].index; i++) 579 for (int i = 0; i < m->shopitems[0].index; i++)
802 { 580 {
581 if (!first)
582 buf << ';';
583
584 first = false;
585
803 if (m->shopitems[i].typenum) 586 if (m->shopitems[i].typenum)
804 { 587 {
805 if (m->shopitems[i].strength) 588 if (m->shopitems[i].strength)
806 {
807 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 589 buf.printf ("%s:%d", m->shopitems[i].name, m->shopitems[i].strength);
808 }
809 else 590 else
810 sprintf (tmp, "%s;", m->shopitems[i].name); 591 buf.printf ("%s", m->shopitems[i].name);
811 } 592 }
812 else 593 else
813 { 594 {
814 if (m->shopitems[i].strength) 595 if (m->shopitems[i].strength)
815 {
816 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 596 buf.printf ("*:%d", m->shopitems[i].strength);
817 }
818 else 597 else
819 sprintf (tmp, "*"); 598 buf.printf ("*");
820 } 599 }
821 strcat (output_string, tmp);
822 } 600 }
601
602 return buf;
823} 603}
604
605//-GPL
824 606
825/* This loads the header information of the map. The header 607/* This loads the header information of the map. The header
826 * contains things like difficulty, size, timeout, etc. 608 * contains things like difficulty, size, timeout, etc.
827 * this used to be stored in the map object, but with the 609 * this used to be stored in the map object, but with the
828 * addition of tiling, fields beyond that easily named in an 610 * addition of tiling, fields beyond that easily named in an
… …
830 * put all the stuff in the map object so that names actually make 612 * put all the stuff in the map object so that names actually make
831 * sense. 613 * sense.
832 * This could be done in lex (like the object loader), but I think 614 * This could be done in lex (like the object loader), but I think
833 * currently, there are few enough fields this is not a big deal. 615 * currently, there are few enough fields this is not a big deal.
834 * MSW 2001-07-01 616 * MSW 2001-07-01
835 * return 0 on success, 1 on failure.
836 */ 617 */
837 618bool
838static int 619maptile::_load_header (object_thawer &thawer)
839load_map_header (object_thawer & fp, maptile *m)
840{ 620{
841 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end; 621 for (;;)
842 int msgpos = 0;
843 int maplorepos = 0;
844
845 while (fgets (buf, HUGE_BUF, fp) != NULL)
846 { 622 {
847 buf[HUGE_BUF - 1] = 0; 623 switch (thawer.kw)
848 key = buf;
849
850 while (isspace (*key))
851 key++;
852
853 if (*key == 0)
854 continue; /* empty line */
855
856 value = strchr (key, ' ');
857
858 if (!value)
859 { 624 {
860 if ((end = strchr (key, '\n'))) 625 case KW_msg:
861 *end = 0; 626 thawer.get_ml (KW_endmsg, msg);
627 break;
628
629 case KW_lore: // deliantra extension
630 thawer.get_ml (KW_endlore, maplore);
631 break;
632
633 case KW_maplore:
634 thawer.get_ml (KW_endmaplore, maplore);
635 break;
636
637 case KW_arch:
638 if (strcmp (thawer.get_str (), "map"))
639 LOG (llevError, "%s: loading map and got a non 'arch map' line (arch %s), skipping.\n", &path, thawer.get_str ());
640 break;
641
642 case KW_oid:
643 thawer.get (this, thawer.get_sint32 ());
644 break;
645
646 case KW_file_format_version: break; // nop
647
648 case KW_name: thawer.get (name); break;
649 case KW_attach: thawer.get (attach); break;
650 case KW_reset_time: thawer.get (reset_time); break;
651 case KW_shopgreed: thawer.get (shopgreed); break;
652 case KW_shopmin: thawer.get (shopmin); break;
653 case KW_shopmax: thawer.get (shopmax); break;
654 case KW_shoprace: thawer.get (shoprace); break;
655 case KW_outdoor: thawer.get (outdoor); break;
656
657 case KW_per_player: thawer.get (per_player); break;
658 case KW_per_party: thawer.get (per_party); break;
659 case KW_no_reset: thawer.get (no_reset); break;
660 case KW_no_drop: thawer.get (no_drop); break;
661
662 case KW_region: thawer.get (default_region); break;
663 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
664
665 // old names new names
666 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
667 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
668 case KW_x: case KW_width: thawer.get (width); break;
669 case KW_y: case KW_height: thawer.get (height); break;
670 case KW_weight: case KW_reset_timeout: thawer.get (reset_timeout); break;
671 case KW_value: case KW_swap_time: thawer.get (timeout); break;
672 case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break;
673 case KW_invisible: case KW_darkness: thawer.get (darkness); break;
674 case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break;
675
676 case KW_tile_path_1: thawer.get (tile_path [TILE_NORTH]); break;
677 case KW_tile_path_2: thawer.get (tile_path [TILE_EAST ]); break;
678 case KW_tile_path_3: thawer.get (tile_path [TILE_SOUTH]); break;
679 case KW_tile_path_4: thawer.get (tile_path [TILE_WEST ]); break;
680 case KW_tile_path_5: thawer.get (tile_path [TILE_UP ]); break;
681 case KW_tile_path_6: thawer.get (tile_path [TILE_DOWN ]); break;
682
683 case KW_ERROR:
684 set_key_text (thawer.kw_str, thawer.value);
685 break;
686
687 case KW_end:
688 thawer.next ();
689 return true;
690
691 default:
692 if (!thawer.parse_error ("map"))
693 return false;
694 break;
862 } 695 }
863 else
864 {
865 *value = 0;
866 value++;
867 end = strchr (value, '\n');
868 696
869 while (isspace (*value)) 697 thawer.next ();
870 {
871 value++;
872
873 if (*value == '\0' || value == end)
874 {
875 /* Nothing but spaces. */
876 value = NULL;
877 break;
878 }
879 }
880 }
881
882 if (!end)
883 {
884 LOG (llevError, "Error loading map header - did not find a newline - perhaps file is truncated? Buf=%s\n", buf);
885 return 1;
886 }
887
888 /* key is the field name, value is what it should be set
889 * to. We've already done the work to null terminate key,
890 * and strip off any leading spaces for both of these.
891 * We have not touched the newline at the end of the line -
892 * these are needed for some values. the end pointer
893 * points to the first of the newlines.
894 * value could be NULL! It would be easy enough to just point
895 * this to "" to prevent cores, but that would let more errors slide
896 * through.
897 *
898 * First check for entries that do not use the value parameter, then
899 * validate that value is given and check for the remaining entries
900 * that use the parameter.
901 */
902
903 if (!strcmp (key, "msg"))
904 {
905 while (fgets (buf, HUGE_BUF, fp) != NULL)
906 {
907 if (!strcmp (buf, "endmsg\n"))
908 break;
909 else
910 {
911 /* slightly more efficient than strcat */
912 strcpy (msgbuf + msgpos, buf);
913 msgpos += strlen (buf);
914 }
915 }
916 /* There are lots of maps that have empty messages (eg, msg/endmsg
917 * with nothing between). There is no reason in those cases to
918 * keep the empty message. Also, msgbuf contains garbage data
919 * when msgpos is zero, so copying it results in crashes
920 */
921 if (msgpos != 0)
922 m->msg = strdup (msgbuf);
923 }
924 else if (!strcmp (key, "maplore"))
925 {
926 while (fgets (buf, HUGE_BUF, fp) != NULL)
927 {
928 if (!strcmp (buf, "endmaplore\n"))
929 break;
930 else
931 {
932 /* slightly more efficient than strcat */
933 strcpy (maplorebuf + maplorepos, buf);
934 maplorepos += strlen (buf);
935 }
936 }
937 if (maplorepos != 0)
938 m->maplore = strdup (maplorebuf);
939 }
940 else if (!strcmp (key, "end"))
941 {
942 break;
943 }
944 else if (value == NULL)
945 {
946 LOG (llevError, "Got '%s' line without parameter in map header\n", key);
947 }
948 else if (!strcmp (key, "arch"))
949 {
950 /* This is an oddity, but not something we care about much. */
951 if (strcmp (value, "map\n"))
952 LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value);
953 }
954 else if (!strcmp (key, "name"))
955 {
956 *end = 0;
957 m->name = strdup (value);
958 }
959 /* first strcmp value on these are old names supported
960 * for compatibility reasons. The new values (second) are
961 * what really should be used.
962 */
963 else if (!strcmp (key, "oid"))
964 fp.get (m, atoi (value));
965 else if (!strcmp (key, "attach"))
966 m->attach = value;
967 else if (!strcmp (key, "hp") || !strcmp (key, "enter_x"))
968 m->enter_x = atoi (value);
969 else if (!strcmp (key, "sp") || !strcmp (key, "enter_y"))
970 m->enter_y = atoi (value);
971 else if (!strcmp (key, "x") || !strcmp (key, "width"))
972 m->width = atoi (value);
973 else if (!strcmp (key, "y") || !strcmp (key, "height"))
974 m->height = atoi (value);
975 else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout"))
976 m->reset_timeout = atoi (value);
977 else if (!strcmp (key, "value") || !strcmp (key, "swap_time"))
978 m->timeout = atoi (value);
979 else if (!strcmp (key, "level") || !strcmp (key, "difficulty"))
980 m->difficulty = clamp (atoi (value), 1, settings.max_level);
981 else if (!strcmp (key, "invisible") || !strcmp (key, "darkness"))
982 m->darkness = atoi (value);
983 else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime"))
984 m->fixed_resettime = atoi (value);
985 else if (!strcmp (key, "unique"))
986 m->unique = atoi (value);
987 else if (!strcmp (key, "template"))
988 m->templatemap = atoi (value);
989 else if (!strcmp (key, "region"))
990 m->region = get_region_by_name (value);
991 else if (!strcmp (key, "shopitems"))
992 {
993 *end = 0;
994 m->shopitems = parse_shop_string (value);
995 }
996 else if (!strcmp (key, "shopgreed"))
997 m->shopgreed = atof (value);
998 else if (!strcmp (key, "shopmin"))
999 m->shopmin = atol (value);
1000 else if (!strcmp (key, "shopmax"))
1001 m->shopmax = atol (value);
1002 else if (!strcmp (key, "shoprace"))
1003 {
1004 *end = 0;
1005 m->shoprace = strdup (value);
1006 }
1007 else if (!strcmp (key, "outdoor"))
1008 m->outdoor = atoi (value);
1009 else if (!strcmp (key, "temp"))
1010 m->temp = atoi (value);
1011 else if (!strcmp (key, "pressure"))
1012 m->pressure = atoi (value);
1013 else if (!strcmp (key, "humid"))
1014 m->humid = atoi (value);
1015 else if (!strcmp (key, "windspeed"))
1016 m->windspeed = atoi (value);
1017 else if (!strcmp (key, "winddir"))
1018 m->winddir = atoi (value);
1019 else if (!strcmp (key, "sky"))
1020 m->sky = atoi (value);
1021 else if (!strcmp (key, "nosmooth"))
1022 m->nosmooth = atoi (value);
1023 else if (!strncmp (key, "tile_path_", 10))
1024 {
1025 int tile = atoi (key + 10);
1026
1027 if (tile < 1 || tile > 4)
1028 {
1029 LOG (llevError, "load_map_header: tile location %d out of bounds (%s)\n", tile, m->path);
1030 }
1031 else
1032 {
1033 char *path;
1034
1035 *end = 0;
1036
1037 if (m->tile_path[tile - 1])
1038 {
1039 LOG (llevError, "load_map_header: tile location %d duplicated (%s)\n", tile, m->path);
1040 free (m->tile_path[tile - 1]);
1041 m->tile_path[tile - 1] = NULL;
1042 }
1043
1044 if (check_path (value, 1) != -1)
1045 {
1046 /* The unadorned path works. */
1047 path = value;
1048 }
1049 else
1050 {
1051 /* Try again; it could be a relative exit. */
1052
1053 path = path_combine_and_normalize (m->path, value);
1054
1055 if (check_path (path, 1) == -1)
1056 {
1057 LOG (llevError, "get_map_header: Bad tile path %s %s\n", m->path, value);
1058 path = NULL;
1059 }
1060 }
1061
1062 if (editor)
1063 {
1064 /* Use the value as in the file. */
1065 m->tile_path[tile - 1] = strdup (value);
1066 }
1067 else if (path != NULL)
1068 {
1069 /* Use the normalized value. */
1070 m->tile_path[tile - 1] = strdup (path);
1071 }
1072 } /* end if tile direction (in)valid */
1073 }
1074 else
1075 LOG (llevError, "Got unknown value in map header: %s %s\n", key, value);
1076 }
1077
1078 if (!key || strcmp (key, "end"))
1079 { 698 }
1080 LOG (llevError, "Got premature eof on map header!\n");
1081 return 1;
1082 }
1083 699
1084 return 0; 700 abort ();
1085} 701}
1086 702
1087/* 703//+GPL
1088 * Opens the file "filename" and reads information about the map
1089 * from the given file, and stores it in a newly allocated
1090 * maptile. A pointer to this structure is returned, or NULL on failure.
1091 * flags correspond to those in map.h. Main ones used are
1092 * MAP_PLAYER_UNIQUE, in which case we don't do any name changes, and
1093 * MAP_BLOCK, in which case we block on this load. This happens in all
1094 * cases, no matter if this flag is set or not.
1095 * MAP_STYLE: style map - don't add active objects, don't add to server
1096 * managed map list.
1097 */
1098
1099maptile *
1100load_original_map (const char *filename, int flags)
1101{
1102 maptile *m;
1103 char pathname[MAX_BUF];
1104
1105 if (flags & MAP_PLAYER_UNIQUE)
1106 strcpy (pathname, filename);
1107 else if (flags & MAP_OVERLAY)
1108 strcpy (pathname, create_overlay_pathname (filename));
1109 else
1110 strcpy (pathname, create_pathname (filename));
1111
1112 LOG (llevDebug, "load_original_map(%x): %s (%s)\n", flags, filename, pathname);
1113
1114 object_thawer thawer (pathname);
1115
1116 if (!thawer)
1117 return 0;
1118
1119 m = get_linked_map ();
1120
1121 strcpy (m->path, filename);
1122 if (load_map_header (thawer, m))
1123 {
1124 LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags);
1125 delete_map (m);
1126 return NULL;
1127 }
1128
1129 m->allocate ();
1130
1131 m->in_memory = MAP_LOADING;
1132 load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE));
1133
1134 m->in_memory = MAP_IN_MEMORY;
1135 if (!MAP_DIFFICULTY (m))
1136 MAP_DIFFICULTY (m) = calculate_difficulty (m);
1137 set_map_reset_time (m);
1138 m->instantiate ();
1139 return (m);
1140}
1141
1142/*
1143 * Loads a map, which has been loaded earlier, from file.
1144 * Return the map object we load into (this can change from the passed
1145 * option if we can't find the original map)
1146 */
1147
1148static maptile *
1149load_temporary_map (maptile *m)
1150{
1151 char buf[MAX_BUF];
1152
1153 if (!m->tmpname)
1154 {
1155 LOG (llevError, "No temporary filename for map %s\n", m->path);
1156 strcpy (buf, m->path);
1157 delete_map (m);
1158 m = load_original_map (buf, 0);
1159 if (m == NULL)
1160 return NULL;
1161 fix_auto_apply (m); /* Chests which open as default */
1162 return m;
1163 }
1164
1165 object_thawer thawer (m->tmpname);
1166
1167 if (!thawer)
1168 {
1169 strcpy (buf, m->path);
1170 delete_map (m);
1171 m = load_original_map (buf, 0);
1172 if (!m)
1173 return NULL;
1174 fix_auto_apply (m); /* Chests which open as default */
1175 return m;
1176 }
1177
1178 if (load_map_header (thawer, m))
1179 {
1180 LOG (llevError, "Error loading map header for %s (%s)\n", m->path, m->tmpname);
1181 delete_map (m);
1182 m = load_original_map (m->path, 0);
1183 return NULL;
1184 }
1185
1186 m->allocate ();
1187
1188 m->in_memory = MAP_LOADING;
1189 load_objects (m, thawer, 0);
1190
1191 m->in_memory = MAP_IN_MEMORY;
1192 INVOKE_MAP (SWAPIN, m);
1193 return m;
1194}
1195
1196/*
1197 * Loads a map, which has been loaded earlier, from file.
1198 * Return the map object we load into (this can change from the passed
1199 * option if we can't find the original map)
1200 */
1201
1202maptile *
1203load_overlay_map (const char *filename, maptile *m)
1204{
1205 char pathname[MAX_BUF];
1206
1207 strcpy (pathname, create_overlay_pathname (filename));
1208
1209 object_thawer thawer (pathname);
1210
1211 if (!thawer)
1212 return m;
1213
1214 if (load_map_header (thawer, m))
1215 {
1216 LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname);
1217 delete_map (m);
1218 m = load_original_map (m->path, 0);
1219 return NULL;
1220 }
1221 /*m->allocate ();*/
1222
1223 m->in_memory = MAP_LOADING;
1224 load_objects (m, thawer, MAP_OVERLAY);
1225
1226 m->in_memory = MAP_IN_MEMORY;
1227 return m;
1228}
1229 704
1230/****************************************************************************** 705/******************************************************************************
1231 * This is the start of unique map handling code 706 * This is the start of unique map handling code
1232 *****************************************************************************/ 707 *****************************************************************************/
1233 708
1234/* This goes through map 'm' and removed any unique items on the map. */ 709/* This goes through the maptile and removed any unique items on the map. */
1235static void 710void
1236delete_unique_items (maptile *m) 711maptile::clear_unique_items ()
1237{ 712{
1238 int i, j, unique; 713 for (int i = 0; i < size (); ++i)
1239 object *op, *next;
1240
1241 for (i = 0; i < MAP_WIDTH (m); i++)
1242 for (j = 0; j < MAP_HEIGHT (m); j++)
1243 { 714 {
1244 unique = 0; 715 int unique = 0;
716 for (object *op = spaces [i].bot; op; )
717 {
718 object *above = op->above;
1245 719
1246 for (op = GET_MAP_OB (m, i, j); op; op = next) 720 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
721 unique = 1;
722
723 if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique))
724 op->destroy ();
725
726 op = above;
727 }
728 }
729}
730
731//-GPL
732
733bool
734maptile::_save_header (object_freezer &freezer)
735{
736#define MAP_OUT(k) freezer.put (KW(k), k)
737#define MAP_OUT2(k,v) freezer.put (KW(k), v)
738
739 MAP_OUT2 (arch, CS(map));
740
741 if (name) MAP_OUT (name);
742 MAP_OUT (swap_time);
743 MAP_OUT (reset_time);
744 MAP_OUT (reset_timeout);
745 MAP_OUT (fixed_resettime);
746 MAP_OUT (no_reset);
747 MAP_OUT (no_drop);
748 MAP_OUT (difficulty);
749 if (default_region) MAP_OUT2 (region, default_region->name);
750
751 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
752 MAP_OUT (shopgreed);
753 MAP_OUT (shopmin);
754 MAP_OUT (shopmax);
755 if (shoprace) MAP_OUT (shoprace);
756
757 MAP_OUT (width);
758 MAP_OUT (height);
759 MAP_OUT (enter_x);
760 MAP_OUT (enter_y);
761 MAP_OUT (darkness);
762 MAP_OUT (outdoor);
763
764 if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
765 if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
766
767 MAP_OUT (per_player);
768 MAP_OUT (per_party);
769
770 if (tile_path [TILE_NORTH]) MAP_OUT2 (tile_path_1, tile_path [TILE_NORTH]);
771 if (tile_path [TILE_EAST ]) MAP_OUT2 (tile_path_2, tile_path [TILE_EAST ]);
772 if (tile_path [TILE_SOUTH]) MAP_OUT2 (tile_path_3, tile_path [TILE_SOUTH]);
773 if (tile_path [TILE_WEST ]) MAP_OUT2 (tile_path_4, tile_path [TILE_WEST ]);
774 if (tile_path [TILE_UP ]) MAP_OUT2 (tile_path_5, tile_path [TILE_UP ]);
775 if (tile_path [TILE_DOWN ]) MAP_OUT2 (tile_path_6, tile_path [TILE_DOWN ]);
776
777 freezer.put (this);
778 freezer.put (KW(end));
779
780 return true;
781}
782
783bool
784maptile::_save_header (const char *path)
785{
786 object_freezer freezer;
787
788 if (!_save_header (freezer))
789 return false;
790
791 return freezer.save (path);
792}
793
794//+GPL
795
796/*
797 * Remove and free all objects in the given map.
798 */
799void
800maptile::clear ()
801{
802 if (spaces)
803 {
804 for (mapspace *ms = spaces + size (); ms-- > spaces; )
805 while (object *op = ms->bot)
1247 { 806 {
807 // manually remove, as to not trigger anything
1248 next = op->above; 808 if (ms->bot = op->above)
809 ms->bot->below = 0;
1249 810
1250 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 811 op->flag [FLAG_REMOVED] = true;
1251 unique = 1;
1252 812
1253 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 813 object *head = op->head_ ();
814 if (op == head)
815 op->destroy ();
816 else if (head->map != op->map)
1254 { 817 {
1255 clean_object (op); 818 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
1256
1257 if (QUERY_FLAG (op, FLAG_IS_LINKED))
1258 remove_button_link (op);
1259
1260 op->destroy (); 819 head->destroy ();
1261 } 820 }
1262 } 821 }
822
823 sfree0 (spaces, size ());
1263 } 824 }
1264}
1265 825
1266
1267/*
1268 * Loads unique objects from file(s) into the map which is in memory
1269 * m is the map to load unique items into.
1270 */
1271static void
1272load_unique_objects (maptile *m)
1273{
1274 int count;
1275 char firstname[MAX_BUF];
1276
1277 for (count = 0; count < 10; count++)
1278 {
1279 sprintf (firstname, "%s.v%02d", create_items_path (m->path), count);
1280 if (!access (firstname, R_OK))
1281 break;
1282 }
1283 /* If we get here, we did not find any map */
1284 if (count == 10)
1285 return;
1286
1287 object_thawer thawer (firstname);
1288
1289 if (!thawer)
1290 return;
1291
1292 m->in_memory = MAP_LOADING;
1293 if (m->tmpname == NULL) /* if we have loaded unique items from */
1294 delete_unique_items (m); /* original map before, don't duplicate them */
1295 load_objects (m, thawer, 0);
1296
1297 m->in_memory = MAP_IN_MEMORY;
1298}
1299
1300
1301/*
1302 * Saves a map to file. If flag is set, it is saved into the same
1303 * file it was (originally) loaded from. Otherwise a temporary
1304 * filename will be genarated, and the file will be stored there.
1305 * The temporary filename will be stored in the maptileure.
1306 * If the map is unique, we also save to the filename in the map
1307 * (this should have been updated when first loaded)
1308 */
1309
1310int
1311new_save_map (maptile *m, int flag)
1312{
1313 char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF];
1314 int i;
1315
1316 if (flag && !*m->path)
1317 {
1318 LOG (llevError, "Tried to save map without path.\n");
1319 return -1;
1320 }
1321
1322 if (flag || (m->unique) || (m->templatemap))
1323 {
1324 if (!m->unique && !m->templatemap)
1325 { /* flag is set */
1326 if (flag == 2)
1327 strcpy (filename, create_overlay_pathname (m->path));
1328 else
1329 strcpy (filename, create_pathname (m->path));
1330 }
1331 else
1332 strcpy (filename, m->path);
1333
1334 make_path_to_file (filename);
1335 }
1336 else
1337 {
1338 if (!m->tmpname)
1339 m->tmpname = tempnam (settings.tmpdir, NULL);
1340
1341 strcpy (filename, m->tmpname);
1342 }
1343
1344 LOG (llevDebug, "Saving map %s to %s\n", m->path, filename);
1345 m->in_memory = MAP_SAVING;
1346
1347 object_freezer freezer;
1348
1349 /* legacy */
1350 fprintf (freezer, "arch map\n");
1351 if (m->name)
1352 fprintf (freezer, "name %s\n", m->name);
1353 if (!flag)
1354 fprintf (freezer, "swap_time %d\n", m->swap_time);
1355 if (m->reset_timeout)
1356 fprintf (freezer, "reset_timeout %d\n", m->reset_timeout);
1357 if (m->fixed_resettime)
1358 fprintf (freezer, "fixed_resettime %d\n", m->fixed_resettime);
1359 /* we unfortunately have no idea if this is a value the creator set
1360 * or a difficulty value we generated when the map was first loaded
1361 */
1362 if (m->difficulty)
1363 fprintf (freezer, "difficulty %d\n", m->difficulty);
1364 if (m->region)
1365 fprintf (freezer, "region %s\n", m->region->name);
1366 if (m->shopitems)
1367 {
1368 print_shop_string (m, shop);
1369 fprintf (freezer, "shopitems %s\n", shop);
1370 }
1371 if (m->shopgreed)
1372 fprintf (freezer, "shopgreed %f\n", m->shopgreed);
1373 if (m->shopmin)
1374 fprintf (freezer, "shopmin %llu\n", m->shopmin);
1375 if (m->shopmax)
1376 fprintf (freezer, "shopmax %llu\n", m->shopmax);
1377 if (m->shoprace)
1378 fprintf (freezer, "shoprace %s\n", m->shoprace);
1379 if (m->darkness)
1380 fprintf (freezer, "darkness %d\n", m->darkness);
1381 if (m->width)
1382 fprintf (freezer, "width %d\n", m->width);
1383 if (m->height)
1384 fprintf (freezer, "height %d\n", m->height);
1385 if (m->enter_x)
1386 fprintf (freezer, "enter_x %d\n", m->enter_x);
1387 if (m->enter_y)
1388 fprintf (freezer, "enter_y %d\n", m->enter_y);
1389 if (m->msg)
1390 fprintf (freezer, "msg\n%sendmsg\n", m->msg);
1391 if (m->maplore)
1392 fprintf (freezer, "maplore\n%sendmaplore\n", m->maplore);
1393 if (m->unique)
1394 fprintf (freezer, "unique %d\n", m->unique);
1395 if (m->templatemap)
1396 fprintf (freezer, "template %d\n", m->templatemap);
1397 if (m->outdoor)
1398 fprintf (freezer, "outdoor %d\n", m->outdoor);
1399 if (m->temp)
1400 fprintf (freezer, "temp %d\n", m->temp);
1401 if (m->pressure)
1402 fprintf (freezer, "pressure %d\n", m->pressure);
1403 if (m->humid)
1404 fprintf (freezer, "humid %d\n", m->humid);
1405 if (m->windspeed)
1406 fprintf (freezer, "windspeed %d\n", m->windspeed);
1407 if (m->winddir)
1408 fprintf (freezer, "winddir %d\n", m->winddir);
1409 if (m->sky)
1410 fprintf (freezer, "sky %d\n", m->sky);
1411 if (m->nosmooth)
1412 fprintf (freezer, "nosmooth %d\n", m->nosmooth);
1413
1414 /* Save any tiling information, except on overlays */
1415 if (flag != 2)
1416 for (i = 0; i < 4; i++)
1417 if (m->tile_path[i])
1418 fprintf (freezer, "tile_path_%d %s\n", i + 1, m->tile_path[i]);
1419
1420 freezer.put (m);
1421 fprintf (freezer, "end\n");
1422
1423 /* In the game save unique items in the different file, but
1424 * in the editor save them to the normal map file.
1425 * If unique map, save files in the proper destination (set by
1426 * player)
1427 */
1428 if ((flag == 0 || flag == 2) && !m->unique && !m->templatemap)
1429 {
1430 object_freezer unique;
1431
1432 if (flag == 2)
1433 save_objects (m, freezer, unique, 2);
1434 else
1435 save_objects (m, freezer, unique, 0);
1436
1437 sprintf (buf, "%s.v00", create_items_path (m->path));
1438
1439 unique.save (buf);
1440 }
1441 else
1442 { /* save same file when not playing, like in editor */
1443 save_objects (m, freezer, freezer, 0);
1444 }
1445
1446 freezer.save (filename);
1447
1448 return 0;
1449}
1450
1451
1452/*
1453 * Remove and free all objects in the inventory of the given object.
1454 * object.c ?
1455 */
1456
1457void
1458clean_object (object *op)
1459{
1460 object *tmp, *next;
1461
1462 for (tmp = op->inv; tmp; tmp = next)
1463 {
1464 next = tmp->below;
1465
1466 clean_object (tmp);
1467 if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
1468 remove_button_link (tmp);
1469
1470 tmp->destroy ();
1471 }
1472}
1473
1474/*
1475 * Remove and free all objects in the given map.
1476 */
1477
1478void
1479free_all_objects (maptile *m)
1480{
1481 int i, j;
1482 object *op;
1483
1484 for (i = 0; i < MAP_WIDTH (m); i++)
1485 for (j = 0; j < MAP_HEIGHT (m); j++)
1486 {
1487 object *previous_obj = NULL;
1488
1489 while ((op = GET_MAP_OB (m, i, j)) != NULL)
1490 {
1491 if (op == previous_obj)
1492 {
1493 LOG (llevDebug, "free_all_objects: Link error, bailing out.\n");
1494 break;
1495 }
1496
1497 previous_obj = op;
1498
1499 if (op->head != NULL)
1500 op = op->head;
1501
1502 /* If the map isn't in memory, free_object will remove and
1503 * free objects in op's inventory. So let it do the job.
1504 */
1505 if (m->in_memory == MAP_IN_MEMORY)
1506 clean_object (op);
1507
1508 op->destroy ();
1509 }
1510 }
1511}
1512
1513/*
1514 * Frees everything allocated by the given maptileure.
1515 * don't free tmpname - our caller is left to do that
1516 */
1517
1518void
1519free_map (maptile *m, int flag)
1520{
1521 int i;
1522
1523 if (!m->in_memory)
1524 {
1525 LOG (llevError, "Trying to free freed map.\n");
1526 return;
1527 }
1528
1529 // TODO: use new/delete
1530#define FREE_AND_CLEAR(p) { free (p); p = NULL; }
1531
1532 if (flag && m->spaces)
1533 free_all_objects (m);
1534 if (m->name)
1535 FREE_AND_CLEAR (m->name);
1536 if (m->spaces)
1537 FREE_AND_CLEAR (m->spaces);
1538 if (m->msg)
1539 FREE_AND_CLEAR (m->msg);
1540 if (m->maplore)
1541 FREE_AND_CLEAR (m->maplore);
1542
1543 delete [] m->shopitems;
1544 m->shopitems = 0;
1545
1546 if (m->shoprace)
1547 FREE_AND_CLEAR (m->shoprace);
1548
1549 if (m->buttons) 826 if (buttons)
1550 free_objectlinkpt (m->buttons); 827 free_objectlinkpt (buttons), buttons = 0;
1551 828
1552 m->buttons = NULL; 829 sfree0 (regions, size ());
1553 830 delete [] regionmap; regionmap = 0;
1554 for (i = 0; i < 4; i++)
1555 {
1556 if (m->tile_path[i])
1557 FREE_AND_CLEAR (m->tile_path[i]);
1558 m->tile_map[i] = NULL;
1559 }
1560
1561 m->in_memory = MAP_SWAPPED;
1562
1563#undef FREE_AND_CLEAR
1564
1565} 831}
1566 832
1567/*
1568 * function: vanish maptile
1569 * m : pointer to maptile, if NULL no action
1570 * this deletes all the data on the map (freeing pointers)
1571 * and then removes this map from the global linked list of maps.
1572 */
1573
1574void 833void
1575delete_map (maptile *m) 834maptile::clear_header ()
1576{ 835{
1577 maptile *tmp, *last; 836 name = 0;
1578 int i; 837 msg = 0;
838 maplore = 0;
839 shoprace = 0;
840 delete [] shopitems, shopitems = 0;
1579 841
1580 if (!m) 842 for (int i = 0; i < array_length (tile_path); i++)
1581 return; 843 tile_path [i] = 0;
844}
1582 845
1583 m->clear (); 846maptile::~maptile ()
847{
848 assert (destroyed ());
849}
1584 850
1585 if (m->in_memory == MAP_IN_MEMORY) 851void
1586 { 852maptile::clear_links_to (maptile *m)
1587 /* change to MAP_SAVING, even though we are not, 853{
1588 * so that remove_ob doesn't do as much work.
1589 */
1590 m->in_memory = MAP_SAVING;
1591 free_map (m, 1);
1592 }
1593 /* move this out of free_map, since tmpname can still be needed if
1594 * the map is swapped out.
1595 */
1596 if (m->tmpname)
1597 {
1598 free (m->tmpname);
1599 m->tmpname = NULL;
1600 }
1601 last = NULL;
1602 /* We need to look through all the maps and see if any maps 854 /* We need to look through all the maps and see if any maps
1603 * are pointing at this one for tiling information. Since 855 * are pointing at this one for tiling information. Since
1604 * tiling can be assymetric, we just can not look to see which 856 * tiling can be asymetric, we just can not look to see which
1605 * maps this map tiles with and clears those. 857 * maps this map tiles with and clears those.
1606 */ 858 */
1607 for (tmp = first_map; tmp != NULL; tmp = tmp->next) 859 for (int i = 0; i < array_length (tile_path); i++)
1608 {
1609 if (tmp->next == m)
1610 last = tmp;
1611
1612 /* This should hopefully get unrolled on a decent compiler */
1613 for (i = 0; i < 4; i++)
1614 if (tmp->tile_map[i] == m) 860 if (tile_map[i] == m)
1615 tmp->tile_map[i] = NULL; 861 tile_map[i] = 0;
1616 } 862}
1617 863
1618 /* If last is null, then this should be the first map in the list */ 864void
865maptile::do_destroy ()
866{
867 attachable::do_destroy ();
868
869 clear ();
870}
871
872/* decay and destroy perishable items in a map */
873// TODO: should be done regularly, not on map load?
874void
875maptile::do_decay_objects ()
876{
1619 if (!last) 877 if (!spaces)
878 return;
879
880 for (mapspace *ms = spaces + size (); ms-- > spaces; )
881 for (object *above, *op = ms->bot; op; op = above)
1620 { 882 {
1621 if (m == first_map) 883 above = op->above;
1622 first_map = m->next; 884
885 // do not decay anything above unique floor tiles (yet :)
886 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
887 break;
888
889 bool destroy = 0;
890
891 if (op->flag [FLAG_IS_FLOOR]
892 || op->flag [FLAG_OBJ_ORIGINAL]
893 || op->flag [FLAG_UNIQUE]
894 || op->flag [FLAG_OVERLAY_FLOOR]
895 || op->flag [FLAG_UNPAID]
896 || op->is_alive ())
897 ; // do not decay
898 else if (op->is_weapon ())
899 {
900 op->stats.dam--;
901 if (op->stats.dam < 0)
902 destroy = 1;
903 }
904 else if (op->is_armor ())
905 {
906 op->stats.ac--;
907 if (op->stats.ac < 0)
908 destroy = 1;
909 }
910 else if (op->type == FOOD)
911 {
912 op->stats.food -= rndm (5, 20);
913 if (op->stats.food < 0)
914 destroy = 1;
915 }
1623 else 916 else
1624 /* m->path is a static char, so should hopefully still have
1625 * some useful data in it.
1626 */
1627 LOG (llevError, "delete_map: Unable to find map %s in list\n", m->path);
1628 }
1629 else
1630 last->next = m->next;
1631
1632 delete m;
1633}
1634
1635/*
1636 * Makes sure the given map is loaded and swapped in.
1637 * name is path name of the map.
1638 * flags meaning:
1639 * 0x1 (MAP_FLUSH): flush the map - always load from the map directory,
1640 * and don't do unique items or the like.
1641 * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player.
1642 * dont do any more name translation on it.
1643 *
1644 * Returns a pointer to the given map.
1645 */
1646maptile *
1647ready_map_name (const char *name, int flags)
1648{
1649 maptile *m;
1650
1651 if (!name)
1652 return (NULL);
1653
1654 /* Have we been at this level before? */
1655 m = has_been_loaded (name);
1656
1657 /* Map is good to go, so just return it */
1658 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY))
1659 {
1660 return m;
1661 }
1662
1663 /* unique maps always get loaded from their original location, and never
1664 * a temp location. Likewise, if map_flush is set, or we have never loaded
1665 * this map, load it now. I removed the reset checking from here -
1666 * it seems the probability of a player trying to enter a map that should
1667 * reset but hasn't yet is quite low, and removing that makes this function
1668 * a bit cleaner (and players probably shouldn't rely on exact timing for
1669 * resets in any case - if they really care, they should use the 'maps command.
1670 */
1671 if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m)
1672 {
1673
1674 /* first visit or time to reset */
1675 if (m)
1676 { 917 {
1677 clean_tmp_map (m); /* Doesn't make much difference */ 918 int mat = op->materials;
1678 delete_map (m); 919
920 if (mat & M_PAPER
921 || mat & M_LEATHER
922 || mat & M_WOOD
923 || mat & M_ORGANIC
924 || mat & M_CLOTH
925 || mat & M_LIQUID
926 || (mat & M_IRON && rndm (1, 5) == 1)
927 || (mat & M_GLASS && rndm (1, 2) == 1)
928 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
929 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
930 //|| (mat & M_ICE && temp > 32)
931 )
932 destroy = 1;
1679 } 933 }
1680 934
1681 /* create and load a map */ 935 /* adjust overall chance below */
1682 if (flags & MAP_PLAYER_UNIQUE) 936 if (destroy && rndm (0, 1))
1683 LOG (llevDebug, "Trying to load map %s.\n", name); 937 op->destroy ();
1684 else
1685 LOG (llevDebug, "Trying to load map %s.\n", create_pathname (name));
1686
1687 //eval_pv ("$x = Event::time", 1);//D
1688 if (!(m = load_original_map (name, (flags & MAP_PLAYER_UNIQUE))))
1689 return (NULL);
1690 //eval_pv ("warn \"LOAD \", Event::time - $x", 1);//D
1691
1692 fix_auto_apply (m); /* Chests which open as default */
1693
1694 /* If a player unique map, no extra unique object file to load.
1695 * if from the editor, likewise.
1696 */
1697 if (!(flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)))
1698 load_unique_objects (m);
1699
1700 if (!(flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE | MAP_OVERLAY)))
1701 {
1702 m = load_overlay_map (name, m);
1703 if (m == NULL)
1704 return NULL;
1705 } 938 }
1706
1707 if (flags & MAP_PLAYER_UNIQUE)
1708 INVOKE_MAP (SWAPIN, m);
1709
1710 }
1711 else
1712 {
1713 /* If in this loop, we found a temporary map, so load it up. */
1714
1715 m = load_temporary_map (m);
1716 if (m == NULL)
1717 return NULL;
1718 load_unique_objects (m);
1719
1720 clean_tmp_map (m);
1721 m->in_memory = MAP_IN_MEMORY;
1722 /* tempnam() on sun systems (probably others) uses malloc
1723 * to allocated space for the string. Free it here.
1724 * In some cases, load_temporary_map above won't find the
1725 * temporary map, and so has reloaded a new map. If that
1726 * is the case, tmpname is now null
1727 */
1728 if (m->tmpname)
1729 free (m->tmpname);
1730 m->tmpname = NULL;
1731 /* It's going to be saved anew anyway */
1732 }
1733
1734 /* Below here is stuff common to both first time loaded maps and
1735 * temp maps.
1736 */
1737
1738 decay_objects (m); /* start the decay */
1739 /* In case other objects press some buttons down */
1740 update_buttons (m);
1741 if (m->outdoor)
1742 set_darkness_map (m);
1743 /* run the weather over this map */
1744 weather_effect (name);
1745 return m;
1746} 939}
1747
1748 940
1749/* 941/*
1750 * This routine is supposed to find out the difficulty of the map. 942 * This routine is supposed to find out the difficulty of the map.
1751 * difficulty does not have a lot to do with character level, 943 * difficulty does not have a lot to do with character level,
1752 * but does have a lot to do with treasure on the map. 944 * but does have a lot to do with treasure on the map.
1753 * 945 *
1754 * Difficulty can now be set by the map creature. If the value stored 946 * Difficulty can now be set by the map creator. If the value stored
1755 * in the map is zero, then use this routine. Maps should really 947 * in the map is zero, then use this routine. Maps should really
1756 * have a difficulty set than using this function - human calculation 948 * have a difficulty set rather than using this function - human calculation
1757 * is much better than this functions guesswork. 949 * is much better than this function's guesswork.
1758 */ 950 */
1759
1760int 951int
1761calculate_difficulty (maptile *m) 952maptile::estimate_difficulty () const
1762{ 953{
1763 object *op;
1764 archetype *at;
1765 int x, y, i;
1766 long monster_cnt = 0; 954 long monster_cnt = 0;
1767 double avgexp = 0; 955 double avgexp = 0;
1768 sint64 total_exp = 0; 956 sint64 total_exp = 0;
1769 957
1770 if (MAP_DIFFICULTY (m)) 958 for (mapspace *ms = spaces + size (); ms-- > spaces; )
1771 { 959 for (object *op = ms->bot; op; op = op->above)
1772 LOG (llevDebug, "Using stored map difficulty: %d\n", MAP_DIFFICULTY (m));
1773 return MAP_DIFFICULTY (m);
1774 }
1775
1776 for (x = 0; x < MAP_WIDTH (m); x++)
1777 for (y = 0; y < MAP_HEIGHT (m); y++)
1778 for (op = GET_MAP_OB (m, x, y); op != NULL; op = op->above)
1779 { 960 {
1780 if (QUERY_FLAG (op, FLAG_MONSTER)) 961 if (op->flag [FLAG_MONSTER])
1781 { 962 {
1782 total_exp += op->stats.exp; 963 total_exp += op->stats.exp;
1783 monster_cnt++; 964 monster_cnt++;
1784 } 965 }
1785 966
1786 if (QUERY_FLAG (op, FLAG_GENERATOR)) 967 if (op->flag [FLAG_GENERATOR])
1787 { 968 {
1788 total_exp += op->stats.exp; 969 total_exp += op->stats.exp;
1789 at = type_to_archetype (GENERATE_TYPE (op));
1790 970
1791 if (at != NULL) 971 if (archetype *at = op->other_arch)
972 {
1792 total_exp += at->clone.stats.exp * 8; 973 total_exp += at->stats.exp * 8;
1793
1794 monster_cnt++; 974 monster_cnt++;
1795 } 975 }
976
977 for (object *inv = op->inv; inv; inv = inv->below)
978 {
979 total_exp += op->stats.exp * 8;
980 monster_cnt++;
981 }
1796 } 982 }
983 }
1797 984
1798 avgexp = (double) total_exp / monster_cnt; 985 avgexp = (double) total_exp / monster_cnt;
1799 986
1800 for (i = 1; i <= settings.max_level; i++) 987 for (int i = 1; i <= settings.max_level; i++)
1801 {
1802 if ((level_exp (i, 1) - level_exp (i - 1, 1)) > (100 * avgexp)) 988 if ((level_exp (i, 1) - level_exp (i - 1, 1)) > (100 * avgexp))
1803 {
1804 /* LOG(llevDebug, "Calculated difficulty for map: %s: %d\n", m->name, i); */
1805 return i; 989 return i;
1806 }
1807 }
1808 990
1809 return 1; 991 return 1;
1810}
1811
1812void
1813clean_tmp_map (maptile *m)
1814{
1815 if (m->tmpname == NULL)
1816 return;
1817 INVOKE_MAP (CLEAN, m);
1818 (void) unlink (m->tmpname);
1819}
1820
1821void
1822free_all_maps (void)
1823{
1824 int real_maps = 0;
1825
1826 while (first_map)
1827 {
1828 /* I think some of the callers above before it gets here set this to be
1829 * saving, but we still want to free this data
1830 */
1831 if (first_map->in_memory == MAP_SAVING)
1832 first_map->in_memory = MAP_IN_MEMORY;
1833 delete_map (first_map);
1834 real_maps++;
1835 }
1836 LOG (llevDebug, "free_all_maps: Freed %d maps\n", real_maps);
1837} 992}
1838 993
1839/* change_map_light() - used to change map light level (darkness) 994/* change_map_light() - used to change map light level (darkness)
1840 * up or down. Returns true if successful. It should now be 995 * up or down. Returns true if successful. It should now be
1841 * possible to change a value by more than 1. 996 * possible to change a value by more than 1.
1842 * Move this from los.c to map.c since this is more related 997 * Move this from los.c to map.c since this is more related
1843 * to maps than los. 998 * to maps than los.
1844 * postive values make it darker, negative make it brighter 999 * postive values make it darker, negative make it brighter
1845 */ 1000 */
1846
1847int 1001int
1848change_map_light (maptile *m, int change) 1002maptile::change_map_light (int change)
1849{ 1003{
1850 int new_level = m->darkness + change;
1851
1852 /* Nothing to do */ 1004 /* Nothing to do */
1853 if (!change || (new_level <= 0 && m->darkness == 0) || (new_level >= MAX_DARKNESS && m->darkness >= MAX_DARKNESS)) 1005 if (!change)
1854 {
1855 return 0; 1006 return 0;
1856 }
1857 1007
1858 /* inform all players on the map */ 1008 /* inform all players on the map */
1859 if (change > 0) 1009 if (change > 0)
1860 new_info_map (NDI_BLACK | NDI_UNIQUE, m, "It becomes darker."); 1010 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1861 else 1011 else
1862 new_info_map (NDI_BLACK | NDI_UNIQUE, m, "It becomes brighter."); 1012 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1863 1013
1864 /* Do extra checking. since m->darkness is a unsigned value, 1014 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1865 * we need to be extra careful about negative values.
1866 * In general, the checks below are only needed if change
1867 * is not +/-1
1868 */
1869 if (new_level < 0)
1870 m->darkness = 0;
1871 else if (new_level >= MAX_DARKNESS)
1872 m->darkness = MAX_DARKNESS;
1873 else
1874 m->darkness = new_level;
1875 1015
1876 /* All clients need to get re-updated for the change */ 1016 /* All clients need to get re-updated for the change */
1877 update_all_map_los (m); 1017 update_all_map_los (this);
1018
1878 return 1; 1019 return 1;
1879} 1020}
1880 1021
1881/* 1022/*
1882 * This function updates various attributes about a specific space 1023 * This function updates various attributes about a specific space
… …
1885 * through, etc) 1026 * through, etc)
1886 */ 1027 */
1887void 1028void
1888mapspace::update_ () 1029mapspace::update_ ()
1889{ 1030{
1890 object *tmp, *last = 0; 1031 object *last = 0;
1891 uint8 flags = 0, light = 0, anywhere = 0; 1032 uint8 flags = P_UPTODATE;
1892 New_Face *top, *floor, *middle; 1033 sint8 light = 0;
1893 object *top_obj, *floor_obj, *middle_obj;
1894 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1034 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1035 uint64_t volume = 0;
1036 uint32_t items = 0;
1037 object *anywhere = 0;
1038 uint8_t middle_visibility = 0;
1895 1039
1896 middle = blank_face; 1040 //object *middle = 0;
1897 top = blank_face; 1041 //object *top = 0;
1898 floor = blank_face; 1042 //object *floor = 0;
1043 // this seems to generate better code than using locals, above
1044 object *&top = faces_obj[0] = 0;
1045 object *&middle = faces_obj[1] = 0;
1046 object *&floor = faces_obj[2] = 0;
1899 1047
1900 middle_obj = 0; 1048 object::flags_t allflags; // all flags of all objects or'ed together
1901 top_obj = 0;
1902 floor_obj = 0;
1903 1049
1904 for (tmp = bottom; tmp; last = tmp, tmp = tmp->above) 1050 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1905 { 1051 {
1906 /* This could be made additive I guess (two lights better than 1052 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1907 * one). But if so, it shouldn't be a simple additive - 2
1908 * light bulbs do not illuminate twice as far as once since
1909 * it is a dissapation factor that is cubed.
1910 */
1911 if (tmp->glow_radius > light)
1912 light = tmp->glow_radius; 1053 light += tmp->glow_radius;
1913 1054
1914 /* This call is needed in order to update objects the player 1055 /* This call is needed in order to update objects the player
1915 * is standing in that have animations (ie, grass, fire, etc). 1056 * is standing in that have animations (ie, grass, fire, etc).
1916 * However, it also causes the look window to be re-drawn 1057 * However, it also causes the look window to be re-drawn
1917 * 3 times each time the player moves, because many of the 1058 * 3 times each time the player moves, because many of the
1918 * functions the move_player calls eventualy call this. 1059 * functions the move_player calls eventualy call this.
1919 * 1060 *
1920 * Always put the player down for drawing. 1061 * Always put the player down for drawing.
1921 */ 1062 */
1922 if (!tmp->invisible) 1063 if (expect_true (!tmp->invisible))
1923 { 1064 {
1924 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1065 if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]))
1925 {
1926 top = tmp->face;
1927 top_obj = tmp; 1066 top = tmp;
1928 } 1067 else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1929 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1930 { 1068 {
1931 /* If we got a floor, that means middle and top were below it, 1069 /* If we got a floor, that means middle and top were below it,
1932 * so should not be visible, so we clear them. 1070 * so should not be visible, so we clear them.
1933 */ 1071 */
1934 middle = blank_face; 1072 middle = 0;
1935 top = blank_face; 1073 top = 0;
1936 floor = tmp->face;
1937 floor_obj = tmp; 1074 floor = tmp;
1075 volume = 0;
1076 items = 0;
1938 } 1077 }
1939 /* Flag anywhere have high priority */ 1078 else
1940 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1941 { 1079 {
1942 middle = tmp->face; 1080 if (expect_true (!tmp->flag [FLAG_NO_PICK]))
1081 {
1082 ++items;
1083 volume += tmp->volume ();
1084 }
1943 1085
1944 middle_obj = tmp; 1086 /* Flag anywhere have high priority */
1087 if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1945 anywhere = 1; 1088 anywhere = tmp;
1089
1090 /* Find the highest visible face around. If equal
1091 * visibilities, we still want the one nearer to the
1092 * top
1093 */
1094 if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
1095 {
1096 middle_visibility = ::faces [tmp->face].visibility;
1097 middle = tmp;
1098 }
1946 } 1099 }
1947 /* Find the highest visible face around. If equal
1948 * visibilities, we still want the one nearer to the
1949 * top
1950 */
1951 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere))
1952 {
1953 middle = tmp->face;
1954 middle_obj = tmp;
1955 }
1956 }
1957
1958 if (tmp == tmp->above)
1959 {
1960 LOG (llevError, "Error in structure of map\n");
1961 exit (-1);
1962 } 1100 }
1963 1101
1964 move_slow |= tmp->move_slow; 1102 move_slow |= tmp->move_slow;
1965 move_block |= tmp->move_block; 1103 move_block |= tmp->move_block;
1966 move_on |= tmp->move_on; 1104 move_on |= tmp->move_on;
1967 move_off |= tmp->move_off; 1105 move_off |= tmp->move_off;
1968 move_allow |= tmp->move_allow; 1106 move_allow |= tmp->move_allow;
1969 1107
1970 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; 1108 allflags |= tmp->flag;
1971 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; 1109
1972 if (tmp->type == PLAYER) flags |= P_PLAYER; 1110 if (tmp->type == PLAYER) flags |= P_PLAYER;
1973 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1111 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1974 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1975 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1976 } 1112 }
1977 1113
1978 this->light = light; 1114 // FLAG_SEE_ANYWHERE takes precedence
1115 if (anywhere)
1116 middle = anywhere;
1117
1118 // ORing all flags together and checking them here is much faster
1119 if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
1120 if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC;
1121 if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE;
1122 if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC;
1123
1124 this->light = min (light, MAX_LIGHT_RADIUS);
1979 this->flags_ = flags; 1125 this->flags_ = flags;
1980 this->move_block = move_block & ~move_allow; 1126 this->move_block = move_block & ~move_allow;
1981 this->move_on = move_on; 1127 this->move_on = move_on;
1982 this->move_off = move_off; 1128 this->move_off = move_off;
1983 this->move_slow = move_slow; 1129 this->move_slow = move_slow;
1130 this->volume_ = (volume + 1023) / 1024;
1131 this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1984 1132
1985 /* At this point, we have a floor face (if there is a floor), 1133 /* At this point, we have a floor face (if there is a floor),
1986 * and the floor is set - we are not going to touch it at 1134 * and the floor is set - we are not going to touch it at
1987 * this point. 1135 * this point.
1988 * middle contains the highest visibility face. 1136 * middle contains the highest visibility face.
… …
1995 * middle face. This should not happen, as we already have the 1143 * middle face. This should not happen, as we already have the
1996 * else statement above so middle should not get set. OTOH, it 1144 * else statement above so middle should not get set. OTOH, it
1997 * may be possible for the faces to match but be different objects. 1145 * may be possible for the faces to match but be different objects.
1998 */ 1146 */
1999 if (top == middle) 1147 if (top == middle)
2000 middle = blank_face; 1148 middle = 0;
2001 1149
2002 /* There are three posibilities at this point: 1150 /* There are three posibilities at this point:
2003 * 1) top face is set, need middle to be set. 1151 * 1) top face is set, need middle to be set.
2004 * 2) middle is set, need to set top. 1152 * 2) middle is set, need to set top.
2005 * 3) neither middle or top is set - need to set both. 1153 * 3) neither middle or top is set - need to set both.
2006 */ 1154 */
2007 1155
2008 for (tmp = last; tmp; tmp = tmp->below) 1156 for (object *tmp = last; tmp; tmp = tmp->below)
2009 { 1157 {
2010 /* Once we get to a floor, stop, since we already have a floor object */ 1158 /* Once we get to a floor, stop, since we already have a floor object */
2011 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1159 if (tmp->flag [FLAG_IS_FLOOR])
2012 break; 1160 break;
2013 1161
2014 /* If two top faces are already set, quit processing */ 1162 /* If two top faces are already set, quit processing */
2015 if ((top != blank_face) && (middle != blank_face)) 1163 if (top && middle)
2016 break; 1164 break;
2017 1165
2018 /* Only show visible faces, unless its the editor - show all */ 1166 /* Only show visible faces */
2019 if (!tmp->invisible || editor) 1167 if (!tmp->invisible)
2020 { 1168 {
2021 /* Fill in top if needed */ 1169 /* Fill in top if needed */
2022 if (top == blank_face) 1170 if (!top)
2023 { 1171 {
2024 top = tmp->face;
2025 top_obj = tmp; 1172 top = tmp;
2026 if (top == middle) 1173 if (top == middle)
2027 middle = blank_face; 1174 middle = 0;
2028 } 1175 }
2029 else 1176 else
2030 { 1177 {
2031 /* top is already set - we should only get here if 1178 /* top is already set - we should only get here if
2032 * middle is not set 1179 * middle is not set
2033 * 1180 *
2034 * Set the middle face and break out, since there is nothing 1181 * Set the middle face and break out, since there is nothing
2035 * more to fill in. We don't check visiblity here, since 1182 * more to fill in. We don't check visiblity here, since
2036 * 1183 *
2037 */ 1184 */
2038 if (tmp->face != top) 1185 if (tmp != top)
2039 { 1186 {
2040 middle = tmp->face;
2041 middle_obj = tmp; 1187 middle = tmp;
2042 break; 1188 break;
2043 } 1189 }
2044 } 1190 }
2045 } 1191 }
2046 } 1192 }
2047 1193
2048 if (middle == floor) 1194 if (middle == floor)
2049 middle = blank_face; 1195 middle = 0;
2050 1196
2051 if (top == middle) 1197 if (top == middle)
2052 middle = blank_face; 1198 middle = 0;
2053 1199
2054 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1200 // set lower map transparent floor flag if applicable
2055 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1201 if (floor && floor->flag [FLAG_IS_TRANSPARENT_FLOOR] && !middle && !top)
2056 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1202 {
2057} 1203 floor->set_anim_frame (0);
2058 1204
2059void 1205 if (maptile *m = floor->map->tile_map [TILE_DOWN])
2060set_map_reset_time (maptile *map) 1206 {
2061{ 1207 mapspace &ms = m->at (floor->x, floor->y);
2062 int timeout; 1208 ms.update ();
2063 1209
2064 timeout = MAP_RESET_TIMEOUT (map); 1210 if (object *floor2 = ms.faces_obj [2])
2065 if (timeout <= 0) 1211 if (!floor2->flag [FLAG_IS_TRANSPARENT_FLOOR])
2066 timeout = MAP_DEFAULTRESET; 1212 {
2067 if (timeout >= MAP_MAXRESET) 1213 floor->set_anim_frame (1);
2068 timeout = MAP_MAXRESET; 1214 top = floor;
2069 MAP_WHEN_RESET (map) = time (0) + timeout; 1215 middle = ms.faces_obj [0];
2070} 1216 floor = floor2;
1217 }
2071 1218
2072/* this updates the orig_map->tile_map[tile_num] value after loading 1219 ms.pflags |= PF_VIS_UP;
2073 * the map. It also takes care of linking back the freshly loaded 1220 }
2074 * maps tile_map values if it tiles back to this one. It returns 1221 }
2075 * the value of orig_map->tile_map[tile_num]. It really only does this
2076 * so that it is easier for calling functions to verify success.
2077 */
2078 1222
2079static maptile * 1223#if 0
2080load_and_link_tiled_map (maptile *orig_map, int tile_num) 1224 faces_obj [0] = top;
2081{ 1225 faces_obj [1] = middle;
2082 int dest_tile = (tile_num + 2) % 4; 1226 faces_obj [2] = floor;
2083 char *path = path_combine_and_normalize (orig_map->path, orig_map->tile_path[tile_num]); 1227#endif
1228}
2084 1229
2085 orig_map->tile_map[tile_num] = ready_map_name (path, 0); 1230void
1231mapspace::update_up ()
1232{
1233 // invalidate up
1234 if (!(pflags & PF_VIS_UP))
1235 return;
2086 1236
2087 /* need to do a strcmp here as the orig_map->path is not a shared string */ 1237 pflags &= ~PF_VIS_UP;
2088 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] && !strcmp (orig_map->tile_map[tile_num]->tile_path[dest_tile], orig_map->path))
2089 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
2090 1238
2091 return orig_map->tile_map[tile_num]; 1239 if (bot)
1240 if (maptile *m = bot->map->tile_map [TILE_UP])
1241 m->at (bot->x, bot->y).invalidate ();
1242}
1243
1244maptile *
1245maptile::tile_available (int dir, bool load)
1246{
1247 // map is there and we don't need to load it OR it's loaded => return what we have
1248 if (tile_map [dir] && (!load || tile_map [dir]->linkable ()))
1249 return tile_map [dir];
1250
1251 if (tile_path [dir])
1252 {
1253 // well, try to locate it then, if possible - maybe it's there already
1254 // this is the ONLY place in the server that links maps with each other,
1255 // so any kind of inter-map stuff has to be initiated here.
1256 if (maptile *m = find_async (tile_path [dir], this, load))
1257 {
1258 bool mismatch = false;
1259
1260 if (dir == TILE_NORTH || dir == TILE_SOUTH || dir == TILE_UP || dir == TILE_DOWN)
1261 if (width != m->width)
1262 mismatch = true;
1263
1264 if (dir == TILE_EAST || dir == TILE_WEST || dir == TILE_UP || dir == TILE_DOWN)
1265 if (height != m->height)
1266 mismatch = true;
1267
1268 if (mismatch)
1269 {
1270 LOG (llevError, "tile dimension mismatch for direction %d from %s to %s\n",
1271 dir, &path, &m->path);
1272 m = 0;
1273 }
1274 else if (0)//D
1275 {
1276 // as an optimisation, link us against the other map if the other map
1277 // has us as neighbour, which is very common, but not guaranteed.
1278 int dir2 = REVERSE_TILE_DIR (dir);
1279
1280 if (m->tile_path [dir2] == path)
1281 m->tile_map [dir2] = this;
1282 }
1283
1284
1285 return tile_map [dir] = m;
1286 }
1287 }
1288
1289 return 0;
2092} 1290}
2093 1291
2094/* this returns TRUE if the coordinates (x,y) are out of 1292/* this returns TRUE if the coordinates (x,y) are out of
2095 * map m. This function also takes into account any 1293 * map m. This function also takes into account any
2096 * tiling considerations, loading adjacant maps as needed. 1294 * tiling considerations, loading adjacant maps as needed.
2097 * This is the function should always be used when it 1295 * This is the function should always be used when it
2098 * necessary to check for valid coordinates. 1296 * necessary to check for valid coordinates.
2099 * This function will recursively call itself for the 1297 * This function will recursively call itself for the
2100 * tiled maps. 1298 * tiled maps.
2101 *
2102 *
2103 */ 1299 */
2104int 1300int
2105out_of_map (maptile *m, int x, int y) 1301out_of_map (maptile *m, int x, int y)
2106{ 1302{
2107 /* If we get passed a null map, this is obviously the 1303 /* If we get passed a null map, this is obviously the
… …
2111 if (!m) 1307 if (!m)
2112 return 0; 1308 return 0;
2113 1309
2114 if (x < 0) 1310 if (x < 0)
2115 { 1311 {
2116 if (!m->tile_path[3]) 1312 if (!m->tile_available (TILE_WEST))
2117 return 1; 1313 return 1;
2118 1314
2119 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 1315 return out_of_map (m->tile_map [TILE_WEST], x + m->tile_map [TILE_WEST]->width, y);
2120 load_and_link_tiled_map (m, 3);
2121
2122 return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y));
2123 }
2124
2125 if (x >= MAP_WIDTH (m))
2126 { 1316 }
2127 if (!m->tile_path[1]) 1317
1318 if (x >= m->width)
1319 {
1320 if (!m->tile_available (TILE_EAST))
2128 return 1; 1321 return 1;
2129 1322
2130 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2131 load_and_link_tiled_map (m, 1);
2132
2133 return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y)); 1323 return out_of_map (m->tile_map [TILE_EAST], x - m->width, y);
2134 } 1324 }
2135 1325
2136 if (y < 0) 1326 if (y < 0)
2137 { 1327 {
2138 if (!m->tile_path[0]) 1328 if (!m->tile_available (TILE_NORTH))
2139 return 1; 1329 return 1;
2140 1330
2141 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 1331 return out_of_map (m->tile_map [TILE_NORTH], x, y + m->tile_map [TILE_NORTH]->height);
2142 load_and_link_tiled_map (m, 0);
2143
2144 return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0])));
2145 }
2146
2147 if (y >= MAP_HEIGHT (m))
2148 { 1332 }
2149 if (!m->tile_path[2]) 1333
1334 if (y >= m->height)
1335 {
1336 if (!m->tile_available (TILE_SOUTH))
2150 return 1; 1337 return 1;
2151 1338
2152 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 1339 return out_of_map (m->tile_map [TILE_SOUTH], x, y - m->height);
2153 load_and_link_tiled_map (m, 2);
2154
2155 return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m)));
2156 } 1340 }
2157 1341
2158 /* Simple case - coordinates are within this local 1342 /* Simple case - coordinates are within this local
2159 * map. 1343 * map.
2160 */ 1344 */
… …
2163 1347
2164/* This is basically the same as out_of_map above, but 1348/* This is basically the same as out_of_map above, but
2165 * instead we return NULL if no map is valid (coordinates 1349 * instead we return NULL if no map is valid (coordinates
2166 * out of bounds and no tiled map), otherwise it returns 1350 * out of bounds and no tiled map), otherwise it returns
2167 * the map as that the coordinates are really on, and 1351 * the map as that the coordinates are really on, and
2168 * updates x and y to be the localized coordinates. 1352 * updates x and y to be the localised coordinates.
2169 * Using this is more efficient of calling out_of_map 1353 * Using this is more efficient of calling out_of_map
2170 * and then figuring out what the real map is 1354 * and then figuring out what the real map is
2171 */ 1355 */
2172maptile * 1356maptile *
2173get_map_from_coord (maptile *m, sint16 * x, sint16 * y) 1357maptile::xy_find (sint16 &x, sint16 &y)
2174{ 1358{
2175
2176 if (*x < 0) 1359 if (x < 0)
2177 { 1360 {
2178 if (!m->tile_path[3]) 1361 if (!tile_available (TILE_WEST))
2179 return 0; 1362 return 0;
2180 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2181 load_and_link_tiled_map (m, 3);
2182 1363
2183 *x += MAP_WIDTH (m->tile_map[3]); 1364 x += tile_map [TILE_WEST]->width;
2184 return (get_map_from_coord (m->tile_map[3], x, y)); 1365 return tile_map [TILE_WEST]->xy_find (x, y);
2185 }
2186
2187 if (*x >= MAP_WIDTH (m))
2188 { 1366 }
2189 if (!m->tile_path[1]) 1367
1368 if (x >= width)
1369 {
1370 if (!tile_available (TILE_EAST))
2190 return 0; 1371 return 0;
2191 1372
2192 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 1373 x -= width;
2193 load_and_link_tiled_map (m, 1); 1374 return tile_map [TILE_EAST]->xy_find (x, y);
2194
2195 *x -= MAP_WIDTH (m);
2196 return (get_map_from_coord (m->tile_map[1], x, y));
2197 } 1375 }
2198 1376
2199 if (*y < 0) 1377 if (y < 0)
2200 { 1378 {
2201 if (!m->tile_path[0]) 1379 if (!tile_available (TILE_NORTH))
2202 return 0; 1380 return 0;
2203 1381
2204 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 1382 y += tile_map [TILE_NORTH]->height;
2205 load_and_link_tiled_map (m, 0); 1383 return tile_map [TILE_NORTH]->xy_find (x, y);
2206
2207 *y += MAP_HEIGHT (m->tile_map[0]);
2208 return (get_map_from_coord (m->tile_map[0], x, y));
2209 }
2210
2211 if (*y >= MAP_HEIGHT (m))
2212 { 1384 }
2213 if (!m->tile_path[2]) 1385
1386 if (y >= height)
1387 {
1388 if (!tile_available (TILE_SOUTH))
2214 return 0; 1389 return 0;
2215 1390
2216 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 1391 y -= height;
2217 load_and_link_tiled_map (m, 2); 1392 return tile_map [TILE_SOUTH]->xy_find (x, y);
2218
2219 *y -= MAP_HEIGHT (m);
2220 return (get_map_from_coord (m->tile_map[2], x, y));
2221 } 1393 }
2222 1394
2223 /* Simple case - coordinates are within this local 1395 /* Simple case - coordinates are within this local
2224 * map. 1396 * map.
2225 */ 1397 */
2226
2227 return m; 1398 return this;
2228} 1399}
2229 1400
2230/** 1401/**
2231 * Return whether map2 is adjacent to map1. If so, store the distance from 1402 * Return whether map2 is adjacent to map1. If so, store the distance from
2232 * map1 to map2 in dx/dy. 1403 * map1 to map2 in dx/dy.
2233 */ 1404 */
2234static int 1405int
2235adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1406adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy)
2236{ 1407{
2237 if (!map1 || !map2) 1408 if (!map1 || !map2)
2238 return 0; 1409 return 0;
2239 1410
1411 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1412 //fix: compare paths instead (this is likely faster, too!)
2240 if (map1 == map2) 1413 if (map1 == map2)
2241 { 1414 {
2242 *dx = 0; 1415 *dx = 0;
2243 *dy = 0; 1416 *dy = 0;
2244 1417 }
1418 else if (map1->tile_available (TILE_NORTH, false) == map2)
2245 } 1419 {
2246 else if (map1->tile_map[0] == map2)
2247 { /* up */
2248 *dx = 0; 1420 *dx = 0;
2249 *dy = -MAP_HEIGHT (map2); 1421 *dy = -map2->height;
1422 }
1423 else if (map1->tile_available (TILE_EAST , false) == map2)
2250 } 1424 {
2251 else if (map1->tile_map[1] == map2) 1425 *dx = map1->width;
2252 { /* right */
2253 *dx = MAP_WIDTH (map1);
2254 *dy = 0; 1426 *dy = 0;
2255 } 1427 }
2256 else if (map1->tile_map[2] == map2) 1428 else if (map1->tile_available (TILE_SOUTH, false) == map2)
2257 { /* down */ 1429 {
2258 *dx = 0; 1430 *dx = 0;
2259 *dy = MAP_HEIGHT (map1); 1431 *dy = map1->height;
1432 }
1433 else if (map1->tile_available (TILE_WEST , false) == map2)
2260 } 1434 {
2261 else if (map1->tile_map[3] == map2) 1435 *dx = -map2->width;
2262 { /* left */
2263 *dx = -MAP_WIDTH (map2);
2264 *dy = 0; 1436 *dy = 0;
2265
2266 } 1437 }
2267 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) 1438 else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2)
2268 { /* up right */ 1439 { /* up right */
2269 *dx = MAP_WIDTH (map1->tile_map[0]); 1440 *dx = +map1->tile_map[TILE_NORTH]->width;
2270 *dy = -MAP_HEIGHT (map1->tile_map[0]); 1441 *dy = -map1->tile_map[TILE_NORTH]->height;
2271 } 1442 }
2272 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) 1443 else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2)
2273 { /* up left */ 1444 { /* up left */
2274 *dx = -MAP_WIDTH (map2); 1445 *dx = -map2->width;
2275 *dy = -MAP_HEIGHT (map1->tile_map[0]); 1446 *dy = -map1->tile_map[TILE_NORTH]->height;
2276 } 1447 }
2277 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) 1448 else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2)
2278 { /* right up */ 1449 { /* right up */
2279 *dx = MAP_WIDTH (map1); 1450 *dx = +map1->width;
2280 *dy = -MAP_HEIGHT (map2); 1451 *dy = -map2->height;
2281 } 1452 }
2282 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) 1453 else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2)
2283 { /* right down */ 1454 { /* right down */
2284 *dx = MAP_WIDTH (map1); 1455 *dx = +map1->width;
2285 *dy = MAP_HEIGHT (map1->tile_map[1]); 1456 *dy = +map1->tile_map[TILE_EAST]->height;
2286 } 1457 }
2287 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) 1458 else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2)
2288 { /* down right */ 1459 { /* down right */
2289 *dx = MAP_WIDTH (map1->tile_map[2]); 1460 *dx = +map1->tile_map[TILE_SOUTH]->width;
2290 *dy = MAP_HEIGHT (map1); 1461 *dy = +map1->height;
2291 } 1462 }
2292 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) 1463 else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2)
2293 { /* down left */ 1464 { /* down left */
2294 *dx = -MAP_WIDTH (map2); 1465 *dx = -map2->width;
2295 *dy = MAP_HEIGHT (map1); 1466 *dy = +map1->height;
2296 } 1467 }
2297 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) 1468 else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2)
2298 { /* left up */ 1469 { /* left up */
2299 *dx = -MAP_WIDTH (map1->tile_map[3]); 1470 *dx = -map1->tile_map[TILE_WEST]->width;
2300 *dy = -MAP_HEIGHT (map2); 1471 *dy = -map2->height;
2301 } 1472 }
2302 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) 1473 else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2)
2303 { /* left down */ 1474 { /* left down */
2304 *dx = -MAP_WIDTH (map1->tile_map[3]); 1475 *dx = -map1->tile_map[TILE_WEST]->width;
2305 *dy = MAP_HEIGHT (map1->tile_map[3]); 1476 *dy = +map1->tile_map[TILE_WEST]->height;
2306
2307 } 1477 }
2308 else 1478 else
2309 { /* not "adjacent" enough */
2310 return 0; 1479 return 0;
2311 }
2312 1480
2313 return 1; 1481 return 1;
1482}
1483
1484maptile *
1485maptile::xy_load (sint16 &x, sint16 &y)
1486{
1487 maptile *map = xy_find (x, y);
1488
1489 if (map)
1490 map->load_sync ();
1491
1492 return map;
1493}
1494
1495maptile *
1496get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
1497{
1498 return m->xy_load (*x, *y);
2314} 1499}
2315 1500
2316/* From map.c 1501/* From map.c
2317 * This is used by get_player to determine where the other 1502 * This is used by get_player to determine where the other
2318 * creature is. get_rangevector takes into account map tiling, 1503 * creature is. get_rangevector takes into account map tiling,
2319 * so you just can not look the the map coordinates and get the 1504 * so you just can not look the the map coordinates and get the
2320 * righte value. distance_x/y are distance away, which 1505 * righte value. distance_x/y are distance away, which
2321 * can be negativbe. direction is the crossfire direction scheme 1506 * can be negative. direction is the crossfire direction scheme
2322 * that the creature should head. part is the part of the 1507 * that the creature should head. part is the part of the
2323 * monster that is closest. 1508 * monster that is closest.
2324 * 1509 *
2325 * get_rangevector looks at op1 and op2, and fills in the 1510 * get_rangevector looks at op1 and op2, and fills in the
2326 * structure for op1 to get to op2. 1511 * structure for op1 to get to op2.
2327 * We already trust that the caller has verified that the 1512 * We already trust that the caller has verified that the
2328 * two objects are at least on adjacent maps. If not, 1513 * two objects are at least on adjacent maps. If not,
2329 * results are not likely to be what is desired. 1514 * results are not likely to be what is desired.
… …
2331 * be unexpected 1516 * be unexpected
2332 * 1517 *
2333 * currently, the only flag supported (0x1) is don't translate for 1518 * currently, the only flag supported (0x1) is don't translate for
2334 * closest body part of 'op1' 1519 * closest body part of 'op1'
2335 */ 1520 */
2336
2337void 1521void
2338get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1522get_rangevector (object *op1, object *op2, rv_vector *retval, int flags)
2339{ 1523{
2340 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1524 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
2341 { 1525 {
2342 /* be conservative and fill in _some_ data */ 1526 /* be conservative and fill in _some_ data */
2343 retval->distance = 100000; 1527 retval->distance = 10000;
2344 retval->distance_x = 32767; 1528 retval->distance_x = 10000;
2345 retval->distance_y = 32767; 1529 retval->distance_y = 10000;
2346 retval->direction = 0; 1530 retval->direction = 0;
2347 retval->part = 0; 1531 retval->part = 0;
2348 } 1532 }
2349 else 1533 else
2350 { 1534 {
2351 object *best;
2352
2353 retval->distance_x += op2->x - op1->x; 1535 retval->distance_x += op2->x - op1->x;
2354 retval->distance_y += op2->y - op1->y; 1536 retval->distance_y += op2->y - op1->y;
2355 1537
2356 best = op1; 1538 object *best = op1;
1539
2357 /* If this is multipart, find the closest part now */ 1540 /* If this is multipart, find the closest part now */
2358 if (!(flags & 0x1) && op1->more) 1541 if (!(flags & 1) && op1->more)
2359 { 1542 {
2360 object *tmp; 1543 int best_distance = idistance (retval->distance_x, retval->distance_y);
2361 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
2362 1544
2363 /* we just take the offset of the piece to head to figure 1545 /* we just take the offset of the piece to head to figure
2364 * distance instead of doing all that work above again 1546 * distance instead of doing all that work above again
2365 * since the distance fields we set above are positive in the 1547 * since the distance fields we set above are positive in the
2366 * same axis as is used for multipart objects, the simply arithmetic 1548 * same axis as is used for multipart objects, the simply arithmetic
2367 * below works. 1549 * below works.
2368 */ 1550 */
2369 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1551 for (object *tmp = op1->more; tmp; tmp = tmp->more)
2370 { 1552 {
2371 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1553 int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
2372 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1554
2373 if (tmpi < best_distance) 1555 if (tmpi < best_distance)
2374 { 1556 {
2375 best_distance = tmpi; 1557 best_distance = tmpi;
2376 best = tmp; 1558 best = tmp;
2377 } 1559 }
2378 } 1560 }
1561
2379 if (best != op1) 1562 if (best != op1)
2380 { 1563 {
2381 retval->distance_x += op1->x - best->x; 1564 retval->distance_x += op1->x - best->x;
2382 retval->distance_y += op1->y - best->y; 1565 retval->distance_y += op1->y - best->y;
2383 } 1566 }
2384 } 1567 }
1568
2385 retval->part = best; 1569 retval->part = best;
2386 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1570 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
2387 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1571 retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
2388 } 1572 }
2389} 1573}
2390 1574
2391/* this is basically the same as get_rangevector above, but instead of 1575/* this is basically the same as get_rangevector above, but instead of
2392 * the first parameter being an object, it instead is the map 1576 * the first parameter being an object, it instead is the map
… …
2396 * flags has no meaning for this function at this time - I kept it in to 1580 * flags has no meaning for this function at this time - I kept it in to
2397 * be more consistant with the above function and also in case they are needed 1581 * be more consistant with the above function and also in case they are needed
2398 * for something in the future. Also, since no object is pasted, the best 1582 * for something in the future. Also, since no object is pasted, the best
2399 * field of the rv_vector is set to NULL. 1583 * field of the rv_vector is set to NULL.
2400 */ 1584 */
2401
2402void 1585void
2403get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1586get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
2404{ 1587{
2405 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1588 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
2406 { 1589 {
2407 /* be conservative and fill in _some_ data */ 1590 /* be conservative and fill in _some_ data */
2408 retval->distance = 100000; 1591 retval->distance = 100000;
2409 retval->distance_x = 32767; 1592 retval->distance_x = 32767;
2410 retval->distance_y = 32767; 1593 retval->distance_y = 32767;
2411 retval->direction = 0; 1594 retval->direction = 0;
2412 retval->part = 0; 1595 retval->part = 0;
2413 } 1596 }
2414 else 1597 else
2415 { 1598 {
2416 retval->distance_x += op2->x - x; 1599 retval->distance_x += op2->x - x;
2417 retval->distance_y += op2->y - y; 1600 retval->distance_y += op2->y - y;
2418 1601
2419 retval->part = NULL; 1602 retval->part = 0;
2420 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1603 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
2421 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1604 retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
2422 } 1605 }
2423} 1606}
2424 1607
2425/* Returns true of op1 and op2 are effectively on the same map 1608/* Returns true of op1 and op2 are effectively on the same map
2426 * (as related to map tiling). Note that this looks for a path from 1609 * (as related to map tiling). Note that this looks for a path from
2427 * op1 to op2, so if the tiled maps are assymetric and op2 has a path 1610 * op1 to op2, so if the tiled maps are asymetric and op2 has a path
2428 * to op1, this will still return false. 1611 * to op1, this will still return false.
2429 * Note we only look one map out to keep the processing simple 1612 * Note we only look one map out to keep the processing simple
2430 * and efficient. This could probably be a macro. 1613 * and efficient. This could probably be a macro.
2431 * MSW 2001-08-05 1614 * MSW 2001-08-05
2432 */ 1615 */
… …
2435{ 1618{
2436 int dx, dy; 1619 int dx, dy;
2437 1620
2438 return adjacent_map (op1->map, op2->map, &dx, &dy); 1621 return adjacent_map (op1->map, op2->map, &dx, &dy);
2439} 1622}
1623
1624//-GPL
1625
1626object *
1627maptile::insert (object *op, int x, int y, object *originator, int flags)
1628{
1629 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1630}
1631
1632region *
1633maptile::region (int x, int y) const
1634{
1635 if (regions
1636 && regionmap
1637 && !OUT_OF_REAL_MAP (this, x, y))
1638 if (struct region *reg = regionmap [regions [y * width + x]])
1639 return reg;
1640
1641 if (default_region)
1642 return default_region;
1643
1644 return ::region::default_region ();
1645}
1646
1647//+GPL
1648
1649/* picks a random object from a style map.
1650 */
1651object *
1652maptile::pick_random_object (rand_gen &gen) const
1653{
1654 /* while returning a null object will result in a crash, that
1655 * is actually preferable to an infinite loop. That is because
1656 * most servers will automatically restart in case of crash.
1657 * Change the logic on getting the random space - shouldn't make
1658 * any difference, but this seems clearer to me.
1659 */
1660 for (int i = 1000; --i;)
1661 {
1662 object *pick = at (gen (width), gen (height)).bot;
1663
1664 // must be head: do not prefer big monsters just because they are big.
1665 if (pick && pick->is_head ())
1666 return pick;
1667 }
1668
1669 // instead of crashing in the unlikely(?) case, try to return *something*
1670 return archetype::find (shstr_bug);
1671}
1672
1673//-GPL
1674
1675void
1676maptile::play_sound (faceidx sound, int x, int y) const
1677{
1678 if (!sound)
1679 return;
1680
1681 for_all_players_on_map (pl, this)
1682 if (client *ns = pl->ns)
1683 {
1684 int dx = x - pl->ob->x;
1685 int dy = y - pl->ob->y;
1686
1687 int distance = idistance (dx, dy);
1688
1689 if (distance <= MAX_SOUND_DISTANCE)
1690 ns->play_sound (sound, dx, dy);
1691 }
1692}
1693
1694void
1695maptile::say_msg (const char *msg, int x, int y) const
1696{
1697 for_all_players (pl)
1698 if (client *ns = pl->ns)
1699 {
1700 int dx = x - pl->ob->x;
1701 int dy = y - pl->ob->y;
1702
1703 int distance = idistance (dx, dy);
1704
1705 if (distance <= MAX_SOUND_DISTANCE)
1706 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1707 }
1708}
1709
1710dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
1711
1712static void
1713split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1714{
1715 // clip to map to the left
1716 if (x0 < 0)
1717 {
1718 if (maptile *tile = m->tile_available (TILE_WEST, 1))
1719 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1720
1721 if (x1 < 0) // entirely to the left
1722 return;
1723
1724 x0 = 0;
1725 }
1726
1727 // clip to map to the right
1728 if (x1 > m->width)
1729 {
1730 if (maptile *tile = m->tile_available (TILE_EAST, 1))
1731 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1732
1733 if (x0 >= m->width) // entirely to the right
1734 return;
1735
1736 x1 = m->width;
1737 }
1738
1739 // clip to map to the north
1740 if (y0 < 0)
1741 {
1742 if (maptile *tile = m->tile_available (TILE_NORTH, 1))
1743 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1744
1745 if (y1 < 0) // entirely to the north
1746 return;
1747
1748 y0 = 0;
1749 }
1750
1751 // clip to map to the south
1752 if (y1 > m->height)
1753 {
1754 if (maptile *tile = m->tile_available (TILE_SOUTH, 1))
1755 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1756
1757 if (y0 >= m->height) // entirely to the south
1758 return;
1759
1760 y1 = m->height;
1761 }
1762
1763 // if we get here, the rect is within the current map
1764 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1765
1766 r->m = m;
1767 r->x0 = x0;
1768 r->y0 = y0;
1769 r->x1 = x1;
1770 r->y1 = y1;
1771 r->dx = dx;
1772 r->dy = dy;
1773}
1774
1775maprect *
1776maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
1777{
1778 buf.clear ();
1779
1780 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1781
1782 // add end marker
1783 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1784 r->m = 0;
1785
1786 return (maprect *)buf.linearise ();
1787}
1788

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines