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.20 by root, Sun Sep 3 00:18:40 2006 UTC vs.
Revision 1.122 by root, Thu Aug 30 05:24:14 2007 UTC

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

Diff Legend

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