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

Diff Legend

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