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.28 by root, Fri Sep 8 18:26:22 2006 UTC vs.
Revision 1.102 by root, Thu May 17 21:32:08 2007 UTC

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

Diff Legend

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