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.19 by root, Thu Aug 31 18:59:23 2006 UTC vs.
Revision 1.198 by root, Thu Apr 29 12:24:04 2010 UTC

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

Diff Legend

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