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.24 by root, Mon Sep 4 16:46:32 2006 UTC vs.
Revision 1.181 by root, Sat Jan 16 13:41:37 2010 UTC

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

Diff Legend

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