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.27 by root, Fri Sep 8 12:56:42 2006 UTC vs.
Revision 1.160 by root, Mon Oct 12 14:00:57 2009 UTC

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

Diff Legend

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