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.67 by elmex, Wed Jan 3 02:51:09 2007 UTC vs.
Revision 1.172 by root, Sun Nov 8 20:55:39 2009 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
8 it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
9 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 11 * option) any later version.
11 12 *
12 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,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
18 along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22*/ 23 */
23 24
24#include <global.h>
25#include <funcpoint.h>
26
27#include <loader.h>
28#include <unistd.h> 25#include <unistd.h>
29 26
27#include "global.h"
28#include "loader.h"
30#include "path.h" 29#include "path.h"
31 30
32/* 31//+GPL
33 * This makes a path absolute outside the world of Crossfire.
34 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
35 * and returns the pointer to a static array containing the result.
36 * it really should be called create_mapname
37 */
38const char *
39create_pathname (const char *name)
40{
41 static char buf[8192];
42 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
43 return buf;
44}
45 32
46/* 33sint8 maptile::outdoor_darkness;
47 * This function checks if a file with the given path exists.
48 * -1 is returned if it fails, otherwise the mode of the file
49 * is returned.
50 * It tries out all the compression suffixes listed in the uncomp[] array.
51 *
52 * If prepend_dir is set, then we call create_pathname (which prepends
53 * libdir & mapdir). Otherwise, we assume the name given is fully
54 * complete.
55 * Only the editor actually cares about the writablity of this -
56 * the rest of the code only cares that the file is readable.
57 * when the editor goes away, the call to stat should probably be
58 * replaced by an access instead (similar to the windows one, but
59 * that seems to be missing the prepend_dir processing
60 */
61int
62check_path (const char *name, int prepend_dir)
63{
64 char buf[MAX_BUF];
65
66 char *endbuf;
67 struct stat statbuf;
68 int mode = 0;
69
70 if (prepend_dir)
71 strcpy (buf, create_pathname (name));
72 else
73 strcpy (buf, name);
74
75 /* old method (strchr(buf, '\0')) seemd very odd to me -
76 * this method should be equivalant and is clearer.
77 * Can not use strcat because we need to cycle through
78 * all the names.
79 */
80 endbuf = buf + strlen (buf);
81
82 if (stat (buf, &statbuf))
83 return -1;
84 if (!S_ISREG (statbuf.st_mode))
85 return (-1);
86
87 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
88 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
89 mode |= 4;
90
91 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
92 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
93 mode |= 2;
94
95 return (mode);
96}
97 34
98/* This rolls up wall, blocks_magic, blocks_view, etc, all into 35/* This rolls up wall, blocks_magic, blocks_view, etc, all into
99 * one function that just returns a P_.. value (see map.h) 36 * one function that just returns a P_.. value (see map.h)
100 * it will also do map translation for tiled maps, returning 37 * it will also do map translation for tiled maps, returning
101 * new values into newmap, nx, and ny. Any and all of those 38 * new values into newmap, nx, and ny. Any and all of those
… …
136 * by the caller. 73 * by the caller.
137 */ 74 */
138int 75int
139blocked_link (object *ob, maptile *m, int sx, int sy) 76blocked_link (object *ob, maptile *m, int sx, int sy)
140{ 77{
141 object *tmp;
142 int mflags, blocked;
143
144 /* Make sure the coordinates are valid - they should be, as caller should 78 /* Make sure the coordinates are valid - they should be, as caller should
145 * have already checked this. 79 * have already checked this.
146 */ 80 */
147 if (OUT_OF_REAL_MAP (m, sx, sy)) 81 if (OUT_OF_REAL_MAP (m, sx, sy))
148 { 82 {
149 LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); 83 LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");
150 return 1; 84 return 1;
151 } 85 }
152 86
153 /* Save some cycles - instead of calling get_map_flags(), just get the value 87 mapspace &ms = m->at (sx, sy);
154 * directly.
155 */
156 mflags = m->at (sx, sy).flags ();
157 88
158 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 89 int mflags = ms.flags ();
90 int blocked = ms.move_block;
159 91
160 /* If space is currently not blocked by anything, no need to 92 /* If space is currently not blocked by anything, no need to
161 * go further. Not true for players - all sorts of special 93 * go further. Not true for players - all sorts of special
162 * things we need to do for players. 94 * things we need to do for players.
163 */ 95 */
164 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 96 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
165 return 0; 97 return 0;
166 98
167 /* if there isn't anytyhing alive on this space, and this space isn't 99 /* if there isn't anything alive on this space, and this space isn't
168 * otherwise blocked, we can return now. Only if there is a living 100 * otherwise blocked, we can return now. Only if there is a living
169 * creature do we need to investigate if it is part of this creature 101 * creature do we need to investigate if it is part of this creature
170 * or another. Likewise, only if something is blocking us do we 102 * or another. Likewise, only if something is blocking us do we
171 * need to investigate if there is a special circumstance that would 103 * need to investigate if there is a special circumstance that would
172 * let the player through (inventory checkers for example) 104 * let the player through (inventory checkers for example)
173 */ 105 */
174 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 106 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
175 return 0; 107 return 0;
176 108
177 if (ob->head != NULL)
178 ob = ob->head; 109 ob = ob->head_ ();
179 110
180 /* We basically go through the stack of objects, and if there is 111 /* We basically go through the stack of objects, and if there is
181 * some other object that has NO_PASS or FLAG_ALIVE set, return 112 * some other object that has NO_PASS or FLAG_ALIVE set, return
182 * true. If we get through the entire stack, that must mean 113 * true. If we get through the entire stack, that must mean
183 * ob is blocking it, so return 0. 114 * ob is blocking it, so return 0.
184 */ 115 */
185 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) 116 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
186 { 117 {
187 118 if (OB_MOVE_BLOCK (ob, tmp))
188 /* This must be before the checks below. Code for inventory checkers. */
189 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
190 { 119 {
191 /* If last_sp is set, the player/monster needs an object, 120 if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
192 * so we check for it. If they don't have it, they can't 121 if (RESULT_INT (0))
193 * pass through this space. 122 return 1;
194 */ 123 else
195 if (tmp->last_sp) 124 continue;
125
126 if (tmp->type == CHECK_INV)
196 { 127 {
197 if (check_inv_recursive (ob, tmp) == NULL) 128 bool have = check_inv_recursive (ob, tmp);
129
130 // last_sp set means we block if we don't have.
131 if (logical_xor (have, tmp->last_sp))
198 return 1; 132 return 1;
199 else 133 }
200 continue; 134 else if (tmp->type == T_MATCH)
135 {
136 // T_MATCH allows "entrance" iff the match is true
137 // == blocks if the match fails
138
139 // we could have used an INVOKE_OBJECT, but decided against it, as we
140 // assume that T_MATCH is relatively common.
141 if (!match (tmp->slaying, ob, tmp, ob))
142 return 1;
201 } 143 }
202 else 144 else
203 { 145 return 1; // unconditional block
204 /* In this case, the player must not have the object - 146
205 * if they do, they can't pass through.
206 */
207 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
208 return 1;
209 else
210 continue;
211 }
212 } /* if check_inv */
213 else 147 } else {
214 { 148 // space does not block the ob, directly, but
215 /* Broke apart a big nasty if into several here to make 149 // anything alive that is not a door still
216 * this more readable. first check - if the space blocks 150 // blocks anything but wizards.
217 * movement, can't move here. 151
218 * second - if a monster, can't move there, unles it is a 152 if (tmp->flag [FLAG_ALIVE]
219 * hidden dm 153 && tmp->head_ () != ob
220 */ 154 && tmp != ob
221 if (OB_MOVE_BLOCK (ob, tmp)) 155 && tmp->type != DOOR
222 return 1; 156 && !tmp->flag [FLAG_WIZPASS])
223 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob &&
224 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden))
225 return 1; 157 return 1;
226 } 158 }
227
228 } 159 }
160
229 return 0; 161 return 0;
230} 162}
231 163
232
233/* 164/*
234 * Returns true if the given object can't fit in the given spot. 165 * Returns qthe blocking object if the given object can't fit in the given
235 * This is meant for multi space objects - for single space objecs, 166 * spot. This is meant for multi space objects - for single space objecs,
236 * just calling get_map_blocked and checking that against movement type 167 * just calling get_map_blocked and checking that against movement type
237 * of object. This function goes through all the parts of the 168 * of object. This function goes through all the parts of the multipart
238 * multipart object and makes sure they can be inserted. 169 * object and makes sure they can be inserted.
239 * 170 *
240 * While this doesn't call out of map, the get_map_flags does. 171 * While this doesn't call out of map, the get_map_flags does.
241 * 172 *
242 * This function has been used to deprecate arch_out_of_map - 173 * This function has been used to deprecate arch_out_of_map -
243 * this function also does that check, and since in most cases, 174 * this function also does that check, and since in most cases,
… …
254 * 185 *
255 * Note this used to be arch_blocked, but with new movement 186 * Note this used to be arch_blocked, but with new movement
256 * code, we need to have actual object to check its move_type 187 * code, we need to have actual object to check its move_type
257 * against the move_block values. 188 * against the move_block values.
258 */ 189 */
259int 190bool
260ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 191object::blocked (maptile *m, int x, int y) const
261{ 192{
262 archetype *tmp; 193 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
263 int flag;
264 maptile *m1;
265 sint16 sx, sy;
266
267 if (!ob)
268 {
269 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
270 if (flag & P_OUT_OF_MAP)
271 return P_OUT_OF_MAP;
272
273 /* don't have object, so don't know what types would block */
274 return m1->at (sx, sy).move_block;
275 } 194 {
195 mapxy pos (m, x + tmp->x, y + tmp->y);
276 196
277 for (tmp = ob->arch; tmp; tmp = tmp->more) 197 if (!pos.normalise ())
278 { 198 return 1;
279 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
280 199
281 if (flag & P_OUT_OF_MAP) 200 mapspace &ms = *pos;
282 return P_OUT_OF_MAP; 201
283 if (flag & P_IS_ALIVE) 202 if (ms.flags () & P_IS_ALIVE)
284 return P_IS_ALIVE; 203 return 1;
285 204
286 mapspace &ms = m1->at (sx, sy); 205 /* However, often ob doesn't have any move type
287 206 * (signifying non-moving objects)
288 /* find_first_free_spot() calls this function. However, often
289 * ob doesn't have any move type (when used to place exits)
290 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 207 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
291 */ 208 */
292
293 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 209 if (!move_type && ms.move_block != MOVE_ALL)
294 continue; 210 continue;
295 211
296 /* Note it is intentional that we check ob - the movement type of the 212 /* Note it is intentional that we check ob - the movement type of the
297 * head of the object should correspond for the entire object. 213 * head of the object should correspond for the entire object.
298 */ 214 */
299 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 215 if (ms.blocks (move_type))
300 return P_NO_PASS; 216 return 1;
301 } 217 }
302 218
303 return 0; 219 return 0;
304} 220}
305 221
… …
307 * into inventory, but just links them. What this does is go through 223 * into inventory, but just links them. What this does is go through
308 * and insert them properly. 224 * and insert them properly.
309 * The object 'container' is the object that contains the inventory. 225 * The object 'container' is the object that contains the inventory.
310 * This is needed so that we can update the containers weight. 226 * This is needed so that we can update the containers weight.
311 */ 227 */
312void 228static void
313fix_container (object *container) 229fix_container (object *container)
314{ 230{
315 object *tmp = container->inv, *next; 231 object *tmp = container->inv, *next;
316 232
317 container->inv = 0; 233 container->inv = 0;
… …
323 239
324 insert_ob_in_ob (tmp, container); 240 insert_ob_in_ob (tmp, container);
325 tmp = next; 241 tmp = next;
326 } 242 }
327 243
328 /* sum_weight will go through and calculate what all the containers are 244 // go through and calculate what all the containers are carrying.
329 * carrying. 245 //TODO: remove
330 */ 246 container->update_weight ();
331 sum_weight (container);
332} 247}
248
249//-GPL
333 250
334void 251void
335maptile::set_object_flag (int flag, int value) 252maptile::set_object_flag (int flag, int value)
336{ 253{
337 if (!spaces) 254 if (!spaces)
… …
340 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 257 for (mapspace *ms = spaces + size (); ms-- > spaces; )
341 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 258 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
342 tmp->flag [flag] = value; 259 tmp->flag [flag] = value;
343} 260}
344 261
262void
263maptile::post_load_original ()
264{
265 if (!spaces)
266 return;
267
268 set_object_flag (FLAG_OBJ_ORIGINAL);
269
270 for (mapspace *ms = spaces + size (); ms-- > spaces; )
271 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
272 INVOKE_OBJECT (RESET, tmp);
273}
274
275//+GPL
276
345/* link_multipart_objects go through all the objects on the map looking 277/* link_multipart_objects go through all the objects on the map looking
346 * for objects whose arch says they are multipart yet according to the 278 * for objects whose arch says they are multipart yet according to the
347 * info we have, they only have the head (as would be expected when 279 * info we have, they only have the head (as would be expected when
348 * they are saved). We do have to look for the old maps that did save 280 * they are saved).
349 * the more sections and not re-add sections for them.
350 */ 281 */
351void 282void
352maptile::link_multipart_objects () 283maptile::link_multipart_objects ()
353{ 284{
354 if (!spaces) 285 if (!spaces)
355 return; 286 return;
356 287
357 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 288 for (mapspace *ms = spaces + size (); ms-- > spaces; )
358 for (object *tmp = ms->bot; tmp; ) 289 {
290 object *op = ms->bot;
291 while (op)
359 { 292 {
360 object *above = tmp->above;
361
362 /* already multipart - don't do anything more */ 293 /* already multipart - don't do anything more */
363 if (!tmp->head && !tmp->more) 294 if (op->head_ () == op && !op->more && op->arch->more)
364 {
365 /* If there is nothing more to this object, this for loop
366 * won't do anything.
367 */
368 archetype *at;
369 object *last, *op;
370 for (at = tmp->arch->more, last = tmp;
371 at;
372 at = at->more, last = op)
373 { 295 {
374 op = arch_to_object (at); 296 op->remove ();
297 op->expand_tail ();
375 298
376 /* update x,y coordinates */ 299 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
377 op->x += tmp->x; 300 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
378 op->y += tmp->y; 301 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
379 op->head = tmp;
380 op->map = this;
381 last->more = op;
382 op->name = tmp->name;
383 op->title = tmp->title;
384
385 /* we could link all the parts onto tmp, and then just
386 * call insert_ob_in_map once, but the effect is the same,
387 * as insert_ob_in_map will call itself with each part, and
388 * the coding is simpler to just to it here with each part.
389 */
390 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 302 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
303
304 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
305 // so we have to reset the iteration through the mapspace
391 } 306 }
307 else
308 op = op->above;
392 } 309 }
393
394 tmp = above;
395 } 310 }
396} 311}
312
313//-GPL
397 314
398/* 315/*
399 * Loads (ands parses) the objects into a given map from the specified 316 * Loads (ands parses) the objects into a given map from the specified
400 * file pointer. 317 * file pointer.
401 * mapflags is the same as we get with load_original_map
402 */ 318 */
403bool 319bool
404maptile::load_objects (object_thawer &thawer) 320maptile::_load_objects (object_thawer &f)
405{ 321{
406 int unique; 322 for (;;)
407 object *op, *prev = NULL, *last_more = NULL, *otmp;
408
409 op = object::create ();
410 op->map = this; /* To handle buttons correctly */
411
412 while (int i = load_object (thawer, op, 0))
413 { 323 {
414 /* if the archetype for the object is null, means that we 324 coroapi::cede_to_tick (); // cede once in a while
415 * got an invalid object. Don't do anything with it - the game 325
416 * or editor will not be able to do anything with it either. 326 switch (f.kw)
417 */
418 if (op->arch == NULL)
419 { 327 {
420 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 328 case KW_arch:
329 if (object *op = object::read (f, this))
330 {
331 // TODO: why?
332 if (op->inv)
333 op->update_weight ();
334
335 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
336 {
337 // we insert manually because
338 // a) its way faster
339 // b) we remove manually, too, and there are good reasons for that
340 // c) it's correct
341 mapspace &ms = at (op->x, op->y);
342
343 op->flag [FLAG_REMOVED] = false;
344
345 op->above = 0;
346 op->below = ms.top;
347
348 *(ms.top ? &ms.top->above : &ms.bot) = op;
349
350 ms.top = op;
351 ms.flags_ = 0;
352 }
353 else
354 {
355 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
356 op->destroy ();
357 }
358 }
359
421 continue; 360 continue;
422 }
423 361
424 switch (i)
425 {
426 case LL_NORMAL:
427 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
428
429 if (op->inv)
430 sum_weight (op);
431
432 prev = op, last_more = op;
433 break;
434
435 case LL_MORE: 362 case KW_EOF:
436 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 363 return true;
437 op->head = prev, last_more->more = op, last_more = op; 364
365 default:
366 if (!f.parse_error ("map file"))
367 return false;
438 break; 368 break;
439 } 369 }
440 370
441 op = object::create (); 371 f.next ();
442 op->map = this;
443 }
444
445 op->destroy ();
446
447#if 0
448 for (i = 0; i < width; i++)
449 for (j = 0; j < height; j++)
450 {
451 unique = 0;
452 /* check for unique items, or unique squares */
453 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
454 {
455 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
456 unique = 1;
457
458 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
459 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
460 }
461 } 372 }
462#endif
463 373
464 return true; 374 return true;
465} 375}
466 376
467void 377void
468maptile::activate () 378maptile::activate ()
469{ 379{
470 if (!spaces) 380 if (spaces)
471 return;
472
473 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 381 for (mapspace *ms = spaces + size (); ms-- > spaces; )
474 for (object *op = ms->bot; op; op = op->above) 382 for (object *op = ms->bot; op; op = op->above)
475 op->activate_recursive (); 383 op->activate_recursive ();
476} 384}
477 385
478void 386void
479maptile::deactivate () 387maptile::deactivate ()
480{ 388{
481 if (!spaces) 389 if (spaces)
482 return;
483
484 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 390 for (mapspace *ms = spaces + size (); ms-- > spaces; )
485 for (object *op = ms->bot; op; op = op->above) 391 for (object *op = ms->bot; op; op = op->above)
486 op->deactivate_recursive (); 392 op->deactivate_recursive ();
487} 393}
488 394
489bool 395bool
490maptile::save_objects (object_freezer &freezer, int flags) 396maptile::_save_objects (object_freezer &f, int flags)
491{ 397{
492 static int cede_count = 0; 398 coroapi::cede_to_tick ();
493 399
494 if (flags & IO_HEADER) 400 if (flags & IO_HEADER)
495 save_header (freezer); 401 _save_header (f);
496 402
497 if (!spaces) 403 if (!spaces)
498 return false; 404 return false;
499 405
500 for (int i = 0; i < size (); ++i) 406 for (int i = 0; i < size (); ++i)
501 { 407 {
502 if (cede_count >= 500)
503 {
504 cede_count = 0;
505 coroapi::cede ();
506 }
507
508 int unique = 0; 408 bool unique = 0;
409
509 for (object *op = spaces [i].bot; op; op = op->above) 410 for (object *op = spaces [i].bot; op; op = op->above)
510 { 411 {
511 // count per-object, but cede only when modification-safe
512 cede_count++;
513
514 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 412 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
515 unique = 1;
516 413
517 if (!op->can_map_save ()) 414 if (expect_false (!op->can_map_save ()))
518 continue; 415 continue;
519 416
520 if (unique || op->flag [FLAG_UNIQUE]) 417 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
521 { 418 {
522 if (flags & IO_UNIQUES) 419 if (flags & IO_UNIQUES)
523 save_object (freezer, op, 1); 420 op->write (f);
524 } 421 }
525 else if (flags & IO_OBJECTS) 422 else if (expect_true (flags & IO_OBJECTS))
526 save_object (freezer, op, 1); 423 op->write (f);
527 } 424 }
528 } 425 }
529 426
427 coroapi::cede_to_tick ();
428
530 return true; 429 return true;
531} 430}
532 431
533bool 432bool
534maptile::load_objects (const char *path, bool skip_header) 433maptile::_save_objects (const char *path, int flags)
535{ 434{
536 object_thawer thawer (path); 435 object_freezer freezer;
537 436
538 if (!thawer) 437 if (!_save_objects (freezer, flags))
539 return false; 438 return false;
540 439
541 if (skip_header)
542 for (;;)
543 {
544 keyword kw = thawer.get_kv ();
545
546 if (kw == KW_end)
547 break;
548
549 thawer.skip_kv (kw);
550 }
551
552 return load_objects (thawer);
553}
554
555bool
556maptile::save_objects (const char *path, int flags)
557{
558 object_freezer freezer;
559
560 if (!save_objects (freezer, flags))
561 return false;
562
563 return freezer.save (path); 440 return freezer.save (path);
564} 441}
565 442
566maptile::maptile () 443maptile::maptile ()
567{ 444{
568 in_memory = MAP_SWAPPED; 445 in_memory = MAP_SWAPPED;
569 446
570 /* The maps used to pick up default x and y values from the 447 /* The maps used to pick up default x and y values from the
571 * map archetype. Mimic that behaviour. 448 * map archetype. Mimic that behaviour.
572 */ 449 */
573 width = 16; 450 width = 16;
574 height = 16; 451 height = 16;
575 reset_timeout = 0;
576 timeout = 300; 452 timeout = 300;
577 enter_x = 0; 453 max_nrof = 1000; // 1000 items of anything
578 enter_y = 0; 454 max_items = MAX_ITEM_PER_ACTION;
455 max_volume = 2000000; // 2m³
579} 456}
580 457
581maptile::maptile (int w, int h) 458maptile::maptile (int w, int h)
582{ 459{
583 in_memory = MAP_SWAPPED; 460 in_memory = MAP_SWAPPED;
… …
603 if (spaces) 480 if (spaces)
604 return; 481 return;
605 482
606 spaces = salloc0<mapspace> (size ()); 483 spaces = salloc0<mapspace> (size ());
607} 484}
485
486//+GPL
608 487
609/* Takes a string from a map definition and outputs a pointer to the array of shopitems 488/* Takes a string from a map definition and outputs a pointer to the array of shopitems
610 * corresponding to that string. Memory is allocated for this, it must be freed 489 * corresponding to that string. Memory is allocated for this, it must be freed
611 * at a later date. 490 * at a later date.
612 * Called by parse_map_headers below. 491 * Called by parse_map_headers below.
… …
689 return items; 568 return items;
690} 569}
691 570
692/* opposite of parse string, this puts the string that was originally fed in to 571/* opposite of parse string, this puts the string that was originally fed in to
693 * the map (or something equivilent) into output_string. */ 572 * the map (or something equivilent) into output_string. */
694static void 573static const char *
695print_shop_string (maptile *m, char *output_string) 574print_shop_string (maptile *m)
696{ 575{
697 int i; 576 static dynbuf_text buf; buf.clear ();
698 char tmp[MAX_BUF];
699 577
700 strcpy (output_string, "");
701 for (i = 0; i < m->shopitems[0].index; i++) 578 for (int i = 0; i < m->shopitems[0].index; i++)
702 { 579 {
703 if (m->shopitems[i].typenum) 580 if (m->shopitems[i].typenum)
704 { 581 {
705 if (m->shopitems[i].strength) 582 if (m->shopitems[i].strength)
706 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 583 buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
707 else 584 else
708 sprintf (tmp, "%s;", m->shopitems[i].name); 585 buf.printf ("%s;", m->shopitems[i].name);
709 } 586 }
710 else 587 else
711 { 588 {
712 if (m->shopitems[i].strength) 589 if (m->shopitems[i].strength)
713 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 590 buf.printf ("*:%d;", m->shopitems[i].strength);
714 else 591 else
715 sprintf (tmp, "*"); 592 buf.printf ("*");
716 } 593 }
717
718 strcat (output_string, tmp);
719 } 594 }
595
596 return buf;
720} 597}
598
599//-GPL
721 600
722/* This loads the header information of the map. The header 601/* This loads the header information of the map. The header
723 * contains things like difficulty, size, timeout, etc. 602 * contains things like difficulty, size, timeout, etc.
724 * this used to be stored in the map object, but with the 603 * this used to be stored in the map object, but with the
725 * addition of tiling, fields beyond that easily named in an 604 * addition of tiling, fields beyond that easily named in an
… …
729 * This could be done in lex (like the object loader), but I think 608 * This could be done in lex (like the object loader), but I think
730 * currently, there are few enough fields this is not a big deal. 609 * currently, there are few enough fields this is not a big deal.
731 * MSW 2001-07-01 610 * MSW 2001-07-01
732 */ 611 */
733bool 612bool
734maptile::load_header (object_thawer &thawer) 613maptile::_load_header (object_thawer &thawer)
735{ 614{
736 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
737 int msgpos = 0;
738 int maplorepos = 0;
739
740 for (;;) 615 for (;;)
741 { 616 {
742 keyword kw = thawer.get_kv ();
743
744 switch (kw) 617 switch (thawer.kw)
745 { 618 {
746 case KW_EOF:
747 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
748 return false;
749
750 case KW_end:
751 return true;
752
753 case KW_msg: 619 case KW_msg:
754 thawer.get_ml (KW_endmsg, msg); 620 thawer.get_ml (KW_endmsg, msg);
755 break; 621 break;
756 622
757 case KW_lore: // CF+ extension 623 case KW_lore: // CF+ extension
… …
788 case KW_winddir: thawer.get (winddir); break; 654 case KW_winddir: thawer.get (winddir); break;
789 case KW_sky: thawer.get (sky); break; 655 case KW_sky: thawer.get (sky); break;
790 656
791 case KW_per_player: thawer.get (per_player); break; 657 case KW_per_player: thawer.get (per_player); break;
792 case KW_per_party: thawer.get (per_party); break; 658 case KW_per_party: thawer.get (per_party); break;
659 case KW_no_reset: thawer.get (no_reset); break;
660 case KW_no_drop: thawer.get (no_drop); break;
793 661
794 case KW_region: get_region_by_name (thawer.get_str ()); break; 662 case KW_region: default_region = region::find (thawer.get_str ()); break;
795 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 663 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
796 664
797 // old names new names 665 // old names new names
798 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 666 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
799 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 667 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
808 case KW_tile_path_1: thawer.get (tile_path [0]); break; 676 case KW_tile_path_1: thawer.get (tile_path [0]); break;
809 case KW_tile_path_2: thawer.get (tile_path [1]); break; 677 case KW_tile_path_2: thawer.get (tile_path [1]); break;
810 case KW_tile_path_3: thawer.get (tile_path [2]); break; 678 case KW_tile_path_3: thawer.get (tile_path [2]); break;
811 case KW_tile_path_4: thawer.get (tile_path [3]); break; 679 case KW_tile_path_4: thawer.get (tile_path [3]); break;
812 680
681 case KW_ERROR:
682 set_key_text (thawer.kw_str, thawer.value);
683 break;
684
685 case KW_end:
686 thawer.next ();
687 return true;
688
813 default: 689 default:
814 LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]); 690 if (!thawer.parse_error ("map", 0))
691 return false;
815 break; 692 break;
816 } 693 }
694
695 thawer.next ();
817 } 696 }
818 697
819 abort (); 698 abort ();
820} 699}
821 700
822bool 701//+GPL
823maptile::load_header (const char *path)
824{
825 object_thawer thawer (path);
826
827 if (!thawer)
828 return false;
829
830 return load_header (thawer);
831}
832 702
833/****************************************************************************** 703/******************************************************************************
834 * This is the start of unique map handling code 704 * This is the start of unique map handling code
835 *****************************************************************************/ 705 *****************************************************************************/
836 706
… …
846 object *above = op->above; 716 object *above = op->above;
847 717
848 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 718 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
849 unique = 1; 719 unique = 1;
850 720
851 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 721 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
852 {
853 op->destroy_inv (false);
854 op->destroy (); 722 op->destroy ();
855 }
856 723
857 op = above; 724 op = above;
858 } 725 }
859 } 726 }
860} 727}
861 728
729//-GPL
730
862bool 731bool
863maptile::save_header (object_freezer &freezer) 732maptile::_save_header (object_freezer &freezer)
864{ 733{
865#define MAP_OUT(k) freezer.put (KW_ ## k, k) 734#define MAP_OUT(k) freezer.put (KW_ ## k, k)
866#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 735#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
867 736
868 MAP_OUT2 (arch, "map"); 737 MAP_OUT2 (arch, "map");
… …
870 if (name) MAP_OUT (name); 739 if (name) MAP_OUT (name);
871 MAP_OUT (swap_time); 740 MAP_OUT (swap_time);
872 MAP_OUT (reset_time); 741 MAP_OUT (reset_time);
873 MAP_OUT (reset_timeout); 742 MAP_OUT (reset_timeout);
874 MAP_OUT (fixed_resettime); 743 MAP_OUT (fixed_resettime);
744 MAP_OUT (no_reset);
745 MAP_OUT (no_drop);
875 MAP_OUT (difficulty); 746 MAP_OUT (difficulty);
876
877 if (region) MAP_OUT2 (region, region->name); 747 if (default_region) MAP_OUT2 (region, default_region->name);
878 748
879 if (shopitems) 749 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
880 {
881 char shop[MAX_BUF];
882 print_shop_string (this, shop);
883 MAP_OUT2 (shopitems, shop);
884 }
885
886 MAP_OUT (shopgreed); 750 MAP_OUT (shopgreed);
887 MAP_OUT (shopmin); 751 MAP_OUT (shopmin);
888 MAP_OUT (shopmax); 752 MAP_OUT (shopmax);
889 if (shoprace) MAP_OUT (shoprace); 753 if (shoprace) MAP_OUT (shoprace);
754
890 MAP_OUT (darkness); 755 MAP_OUT (darkness);
891 MAP_OUT (width); 756 MAP_OUT (width);
892 MAP_OUT (height); 757 MAP_OUT (height);
893 MAP_OUT (enter_x); 758 MAP_OUT (enter_x);
894 MAP_OUT (enter_y); 759 MAP_OUT (enter_y);
… …
917 782
918 return true; 783 return true;
919} 784}
920 785
921bool 786bool
922maptile::save_header (const char *path) 787maptile::_save_header (const char *path)
923{ 788{
924 object_freezer freezer; 789 object_freezer freezer;
925 790
926 if (!save_header (freezer)) 791 if (!_save_header (freezer))
927 return false; 792 return false;
928 793
929 return freezer.save (path); 794 return freezer.save (path);
930} 795}
796
797//+GPL
931 798
932/* 799/*
933 * Remove and free all objects in the given map. 800 * Remove and free all objects in the given map.
934 */ 801 */
935void 802void
936maptile::clear () 803maptile::clear ()
937{ 804{
938 if (!spaces) 805 if (spaces)
939 return; 806 {
940
941 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 807 for (mapspace *ms = spaces + size (); ms-- > spaces; )
942 while (object *op = ms->bot) 808 while (object *op = ms->bot)
943 { 809 {
810 // manually remove, as to not trigger anything
811 if (ms->bot = op->above)
812 ms->bot->below = 0;
813
814 op->flag [FLAG_REMOVED] = true;
815
816 object *head = op->head_ ();
944 if (op->head) 817 if (op == head)
945 op = op->head;
946
947 op->destroy_inv (false);
948 op->destroy (); 818 op->destroy ();
819 else if (head->map != op->map)
820 {
821 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
822 head->destroy ();
823 }
824 }
825
826 sfree0 (spaces, size ());
949 } 827 }
950
951 sfree (spaces, size ()), spaces = 0;
952 828
953 if (buttons) 829 if (buttons)
954 free_objectlinkpt (buttons), buttons = 0; 830 free_objectlinkpt (buttons), buttons = 0;
831
832 sfree0 (regions, size ());
833 delete [] regionmap; regionmap = 0;
955} 834}
956 835
957void 836void
958maptile::clear_header () 837maptile::clear_header ()
959{ 838{
… …
991 attachable::do_destroy (); 870 attachable::do_destroy ();
992 871
993 clear (); 872 clear ();
994} 873}
995 874
996/* 875/* decay and destroy perishable items in a map */
997 * Updates every button on the map (by calling update_button() for them).
998 */
999void 876void
1000maptile::update_buttons () 877maptile::do_decay_objects ()
1001{ 878{
1002 for (oblinkpt *obp = buttons; obp; obp = obp->next) 879 if (!spaces)
1003 for (objectlink *ol = obp->link; ol; ol = ol->next) 880 return;
881
882 for (mapspace *ms = spaces + size (); ms-- > spaces; )
883 for (object *above, *op = ms->bot; op; op = above)
1004 { 884 {
1005 if (!ol->ob) 885 above = op->above;
886
887 bool destroy = 0;
888
889 // do not decay anything above unique floor tiles (yet :)
890 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
891 break;
892
893 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
894 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
895 || QUERY_FLAG (op, FLAG_UNIQUE)
896 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
897 || QUERY_FLAG (op, FLAG_UNPAID)
898 || op->is_alive ())
899 ; // do not decay
900 else if (op->is_weapon ())
1006 { 901 {
1007 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", 902 op->stats.dam--;
1008 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); 903 if (op->stats.dam < 0)
1009 continue; 904 destroy = 1;
1010 } 905 }
1011 906 else if (op->is_armor ())
1012 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
1013 { 907 {
1014 update_button (ol->ob); 908 op->stats.ac--;
1015 break; 909 if (op->stats.ac < 0)
910 destroy = 1;
1016 } 911 }
912 else if (op->type == FOOD)
913 {
914 op->stats.food -= rndm (5, 20);
915 if (op->stats.food < 0)
916 destroy = 1;
917 }
918 else
919 {
920 int mat = op->materials;
921
922 if (mat & M_PAPER
923 || mat & M_LEATHER
924 || mat & M_WOOD
925 || mat & M_ORGANIC
926 || mat & M_CLOTH
927 || mat & M_LIQUID
928 || (mat & M_IRON && rndm (1, 5) == 1)
929 || (mat & M_GLASS && rndm (1, 2) == 1)
930 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
931 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
932 || (mat & M_ICE && temp > 32))
933 destroy = 1;
934 }
935
936 /* adjust overall chance below */
937 if (destroy && rndm (0, 1))
938 op->destroy ();
1017 } 939 }
1018} 940}
1019 941
1020/* 942/*
1021 * This routine is supposed to find out the difficulty of the map. 943 * This routine is supposed to find out the difficulty of the map.
1022 * difficulty does not have a lot to do with character level, 944 * difficulty does not have a lot to do with character level,
1023 * but does have a lot to do with treasure on the map. 945 * but does have a lot to do with treasure on the map.
1024 * 946 *
1025 * Difficulty can now be set by the map creature. If the value stored 947 * Difficulty can now be set by the map creator. If the value stored
1026 * in the map is zero, then use this routine. Maps should really 948 * in the map is zero, then use this routine. Maps should really
1027 * have a difficulty set than using this function - human calculation 949 * have a difficulty set rather than using this function - human calculation
1028 * is much better than this functions guesswork. 950 * is much better than this function's guesswork.
1029 */ 951 */
1030int 952int
1031maptile::estimate_difficulty () const 953maptile::estimate_difficulty () const
1032{ 954{
1033 long monster_cnt = 0; 955 long monster_cnt = 0;
… …
1045 967
1046 if (QUERY_FLAG (op, FLAG_GENERATOR)) 968 if (QUERY_FLAG (op, FLAG_GENERATOR))
1047 { 969 {
1048 total_exp += op->stats.exp; 970 total_exp += op->stats.exp;
1049 971
1050 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 972 if (archetype *at = op->other_arch)
973 {
1051 total_exp += at->clone.stats.exp * 8; 974 total_exp += at->stats.exp * 8;
1052
1053 monster_cnt++; 975 monster_cnt++;
976 }
977
978 for (object *inv = op->inv; inv; inv = inv->below)
979 {
980 total_exp += op->stats.exp * 8;
981 monster_cnt++;
982 }
1054 } 983 }
1055 } 984 }
1056 985
1057 avgexp = (double) total_exp / monster_cnt; 986 avgexp = (double) total_exp / monster_cnt;
1058 987
… …
1071 * postive values make it darker, negative make it brighter 1000 * postive values make it darker, negative make it brighter
1072 */ 1001 */
1073int 1002int
1074maptile::change_map_light (int change) 1003maptile::change_map_light (int change)
1075{ 1004{
1076 int new_level = darkness + change;
1077
1078 /* Nothing to do */ 1005 /* Nothing to do */
1079 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1006 if (!change)
1080 return 0; 1007 return 0;
1081 1008
1082 /* inform all players on the map */ 1009 /* inform all players on the map */
1083 if (change > 0) 1010 if (change > 0)
1084 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1011 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1085 else 1012 else
1086 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1013 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1087 1014
1088 /* Do extra checking. since darkness is a unsigned value, 1015 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1089 * we need to be extra careful about negative values.
1090 * In general, the checks below are only needed if change
1091 * is not +/-1
1092 */
1093 if (new_level < 0)
1094 darkness = 0;
1095 else if (new_level >= MAX_DARKNESS)
1096 darkness = MAX_DARKNESS;
1097 else
1098 darkness = new_level;
1099 1016
1100 /* All clients need to get re-updated for the change */ 1017 /* All clients need to get re-updated for the change */
1101 update_all_map_los (this); 1018 update_all_map_los (this);
1019
1102 return 1; 1020 return 1;
1103} 1021}
1104 1022
1105/* 1023/*
1106 * This function updates various attributes about a specific space 1024 * This function updates various attributes about a specific space
… …
1109 * through, etc) 1027 * through, etc)
1110 */ 1028 */
1111void 1029void
1112mapspace::update_ () 1030mapspace::update_ ()
1113{ 1031{
1114 object *tmp, *last = 0; 1032 object *last = 0;
1115 uint8 flags = 0, light = 0, anywhere = 0; 1033 uint8 flags = P_UPTODATE;
1116 New_Face *top, *floor, *middle; 1034 sint8 light = 0;
1117 object *top_obj, *floor_obj, *middle_obj;
1118 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1035 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1036 uint64_t volume = 0;
1037 uint32_t items = 0;
1038 object *anywhere = 0;
1119 1039
1120 middle = blank_face; 1040 //object *middle = 0;
1121 top = blank_face; 1041 //object *top = 0;
1122 floor = blank_face; 1042 //object *floor = 0;
1043 // this seems to generate better code than using locals, above
1044 object *&top = faces_obj[0] = 0;
1045 object *&middle = faces_obj[1] = 0;
1046 object *&floor = faces_obj[2] = 0;
1123 1047
1124 middle_obj = 0; 1048 object::flags_t allflags; // all flags of all objects or'ed together
1125 top_obj = 0;
1126 floor_obj = 0;
1127 1049
1128 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1050 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1129 { 1051 {
1130 /* This could be made additive I guess (two lights better than 1052 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1131 * one). But if so, it shouldn't be a simple additive - 2
1132 * light bulbs do not illuminate twice as far as once since
1133 * it is a dissapation factor that is cubed.
1134 */
1135 if (tmp->glow_radius > light)
1136 light = tmp->glow_radius; 1053 light += tmp->glow_radius;
1137 1054
1138 /* This call is needed in order to update objects the player 1055 /* This call is needed in order to update objects the player
1139 * is standing in that have animations (ie, grass, fire, etc). 1056 * is standing in that have animations (ie, grass, fire, etc).
1140 * However, it also causes the look window to be re-drawn 1057 * However, it also causes the look window to be re-drawn
1141 * 3 times each time the player moves, because many of the 1058 * 3 times each time the player moves, because many of the
1142 * functions the move_player calls eventualy call this. 1059 * functions the move_player calls eventualy call this.
1143 * 1060 *
1144 * Always put the player down for drawing. 1061 * Always put the player down for drawing.
1145 */ 1062 */
1146 if (!tmp->invisible) 1063 if (expect_true (!tmp->invisible))
1147 { 1064 {
1148 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1065 if (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER])
1066 top = tmp;
1067 else
1149 { 1068 {
1150 top = tmp->face; 1069 if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1070 {
1071 /* If we got a floor, that means middle and top were below it,
1072 * so should not be visible, so we clear them.
1073 */
1074 middle = 0;
1075 top = 0;
1151 top_obj = tmp; 1076 floor = tmp;
1077 volume = 0;
1078 items = 0;
1079 }
1080 else
1081 {
1082 if (expect_true (!tmp->flag [FLAG_NO_PICK]))
1083 {
1084 ++items;
1085 volume += tmp->volume ();
1086 }
1087
1088 /* Flag anywhere have high priority */
1089 if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1090 anywhere = tmp;
1091 /* Find the highest visible face around. If equal
1092 * visibilities, we still want the one nearer to the
1093 * top
1094 */
1095 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility))
1096 middle = tmp;
1097 }
1152 } 1098 }
1153 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1154 {
1155 /* If we got a floor, that means middle and top were below it,
1156 * so should not be visible, so we clear them.
1157 */
1158 middle = blank_face;
1159 top = blank_face;
1160 floor = tmp->face;
1161 floor_obj = tmp;
1162 }
1163 /* Flag anywhere have high priority */
1164 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1165 {
1166 middle = tmp->face;
1167
1168 middle_obj = tmp;
1169 anywhere = 1;
1170 }
1171 /* Find the highest visible face around. If equal
1172 * visibilities, we still want the one nearer to the
1173 * top
1174 */
1175 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere))
1176 {
1177 middle = tmp->face;
1178 middle_obj = tmp;
1179 }
1180 }
1181
1182 if (tmp == tmp->above)
1183 {
1184 LOG (llevError, "Error in structure of map\n");
1185 exit (-1);
1186 } 1099 }
1187 1100
1188 move_slow |= tmp->move_slow; 1101 move_slow |= tmp->move_slow;
1189 move_block |= tmp->move_block; 1102 move_block |= tmp->move_block;
1190 move_on |= tmp->move_on; 1103 move_on |= tmp->move_on;
1191 move_off |= tmp->move_off; 1104 move_off |= tmp->move_off;
1192 move_allow |= tmp->move_allow; 1105 move_allow |= tmp->move_allow;
1193 1106
1194 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; 1107 allflags |= tmp->flag;
1195 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; 1108
1196 if (tmp->type == PLAYER) flags |= P_PLAYER; 1109 if (tmp->type == PLAYER) flags |= P_PLAYER;
1197 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1110 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1198 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1199 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1200 } 1111 }
1201 1112
1202 this->light = light; 1113 // FLAG_SEE_ANYWHERE takes precedence
1114 if (anywhere)
1115 middle = anywhere;
1116
1117 // ORing all flags together and checking them here is much faster
1118 if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
1119 if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC;
1120 if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE;
1121 if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC;
1122
1123 this->light = min (light, MAX_LIGHT_RADIUS);
1203 this->flags_ = flags; 1124 this->flags_ = flags;
1204 this->move_block = move_block & ~move_allow; 1125 this->move_block = move_block & ~move_allow;
1205 this->move_on = move_on; 1126 this->move_on = move_on;
1206 this->move_off = move_off; 1127 this->move_off = move_off;
1207 this->move_slow = move_slow; 1128 this->move_slow = move_slow;
1129 this->volume_ = (volume + 1023) / 1024;
1130 this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1208 1131
1209 /* At this point, we have a floor face (if there is a floor), 1132 /* At this point, we have a floor face (if there is a floor),
1210 * and the floor is set - we are not going to touch it at 1133 * and the floor is set - we are not going to touch it at
1211 * this point. 1134 * this point.
1212 * middle contains the highest visibility face. 1135 * middle contains the highest visibility face.
… …
1219 * middle face. This should not happen, as we already have the 1142 * middle face. This should not happen, as we already have the
1220 * else statement above so middle should not get set. OTOH, it 1143 * else statement above so middle should not get set. OTOH, it
1221 * may be possible for the faces to match but be different objects. 1144 * may be possible for the faces to match but be different objects.
1222 */ 1145 */
1223 if (top == middle) 1146 if (top == middle)
1224 middle = blank_face; 1147 middle = 0;
1225 1148
1226 /* There are three posibilities at this point: 1149 /* There are three posibilities at this point:
1227 * 1) top face is set, need middle to be set. 1150 * 1) top face is set, need middle to be set.
1228 * 2) middle is set, need to set top. 1151 * 2) middle is set, need to set top.
1229 * 3) neither middle or top is set - need to set both. 1152 * 3) neither middle or top is set - need to set both.
1230 */ 1153 */
1231 1154
1232 for (tmp = last; tmp; tmp = tmp->below) 1155 for (object *tmp = last; tmp; tmp = tmp->below)
1233 { 1156 {
1234 /* Once we get to a floor, stop, since we already have a floor object */ 1157 /* Once we get to a floor, stop, since we already have a floor object */
1235 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1158 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1236 break; 1159 break;
1237 1160
1238 /* If two top faces are already set, quit processing */ 1161 /* If two top faces are already set, quit processing */
1239 if ((top != blank_face) && (middle != blank_face)) 1162 if (top && middle)
1240 break; 1163 break;
1241 1164
1242 /* Only show visible faces */ 1165 /* Only show visible faces */
1243 if (!tmp->invisible) 1166 if (!tmp->invisible)
1244 { 1167 {
1245 /* Fill in top if needed */ 1168 /* Fill in top if needed */
1246 if (top == blank_face) 1169 if (!top)
1247 { 1170 {
1248 top = tmp->face;
1249 top_obj = tmp; 1171 top = tmp;
1250 if (top == middle) 1172 if (top == middle)
1251 middle = blank_face; 1173 middle = 0;
1252 } 1174 }
1253 else 1175 else
1254 { 1176 {
1255 /* top is already set - we should only get here if 1177 /* top is already set - we should only get here if
1256 * middle is not set 1178 * middle is not set
1257 * 1179 *
1258 * Set the middle face and break out, since there is nothing 1180 * Set the middle face and break out, since there is nothing
1259 * more to fill in. We don't check visiblity here, since 1181 * more to fill in. We don't check visiblity here, since
1260 * 1182 *
1261 */ 1183 */
1262 if (tmp->face != top) 1184 if (tmp != top)
1263 { 1185 {
1264 middle = tmp->face;
1265 middle_obj = tmp; 1186 middle = tmp;
1266 break; 1187 break;
1267 } 1188 }
1268 } 1189 }
1269 } 1190 }
1270 } 1191 }
1271 1192
1272 if (middle == floor) 1193 if (middle == floor)
1273 middle = blank_face; 1194 middle = 0;
1274 1195
1275 if (top == middle) 1196 if (top == middle)
1276 middle = blank_face; 1197 middle = 0;
1277 1198
1278 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1199#if 0
1279 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1200 faces_obj [0] = top;
1280 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1201 faces_obj [1] = middle;
1202 faces_obj [2] = floor;
1203#endif
1281} 1204}
1282 1205
1283/* this updates the orig_map->tile_map[tile_num] value after loading 1206maptile *
1284 * the map. It also takes care of linking back the freshly loaded 1207maptile::tile_available (int dir, bool load)
1285 * maps tile_map values if it tiles back to this one. It returns
1286 * the value of orig_map->tile_map[tile_num]. It really only does this
1287 * so that it is easier for calling functions to verify success.
1288 */
1289static maptile *
1290load_and_link_tiled_map (maptile *orig_map, int tile_num)
1291{ 1208{
1292 maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); 1209 if (tile_path[dir])
1293
1294 if (!mp || mp->in_memory != MAP_IN_MEMORY)
1295 {
1296 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1297 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1298 &orig_map->tile_path[tile_num], &orig_map->path);
1299 mp = new maptile (1, 1);
1300 mp->alloc ();
1301 mp->in_memory = MAP_IN_MEMORY;
1302 } 1210 {
1211 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1212 return tile_map[dir];
1303 1213
1304 int dest_tile = (tile_num + 2) % 4; 1214 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1215 return tile_map[dir];
1216 }
1305 1217
1306 orig_map->tile_map[tile_num] = mp;
1307
1308 // optimisation: back-link map to origin map if euclidean
1309 //TODO: non-euclidean maps MUST GO
1310 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1311 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1312
1313 return mp; 1218 return 0;
1314} 1219}
1315 1220
1316/* this returns TRUE if the coordinates (x,y) are out of 1221/* this returns TRUE if the coordinates (x,y) are out of
1317 * map m. This function also takes into account any 1222 * map m. This function also takes into account any
1318 * tiling considerations, loading adjacant maps as needed. 1223 * tiling considerations, loading adjacant maps as needed.
… …
1331 if (!m) 1236 if (!m)
1332 return 0; 1237 return 0;
1333 1238
1334 if (x < 0) 1239 if (x < 0)
1335 { 1240 {
1336 if (!m->tile_path[3]) 1241 if (!m->tile_available (3))
1337 return 1; 1242 return 1;
1338 1243
1339 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1340 load_and_link_tiled_map (m, 3);
1341
1342 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1244 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1343 } 1245 }
1344 1246
1345 if (x >= m->width) 1247 if (x >= m->width)
1346 { 1248 {
1347 if (!m->tile_path[1]) 1249 if (!m->tile_available (1))
1348 return 1; 1250 return 1;
1349 1251
1350 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1351 load_and_link_tiled_map (m, 1);
1352
1353 return out_of_map (m->tile_map[1], x - m->width, y); 1252 return out_of_map (m->tile_map[1], x - m->width, y);
1354 } 1253 }
1355 1254
1356 if (y < 0) 1255 if (y < 0)
1357 { 1256 {
1358 if (!m->tile_path[0]) 1257 if (!m->tile_available (0))
1359 return 1; 1258 return 1;
1360 1259
1361 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1362 load_and_link_tiled_map (m, 0);
1363
1364 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1260 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1365 } 1261 }
1366 1262
1367 if (y >= m->height) 1263 if (y >= m->height)
1368 { 1264 {
1369 if (!m->tile_path[2]) 1265 if (!m->tile_available (2))
1370 return 1; 1266 return 1;
1371
1372 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1373 load_and_link_tiled_map (m, 2);
1374 1267
1375 return out_of_map (m->tile_map[2], x, y - m->height); 1268 return out_of_map (m->tile_map[2], x, y - m->height);
1376 } 1269 }
1377 1270
1378 /* Simple case - coordinates are within this local 1271 /* Simple case - coordinates are within this local
… …
1388 * updates x and y to be the localised coordinates. 1281 * updates x and y to be the localised coordinates.
1389 * Using this is more efficient of calling out_of_map 1282 * Using this is more efficient of calling out_of_map
1390 * and then figuring out what the real map is 1283 * and then figuring out what the real map is
1391 */ 1284 */
1392maptile * 1285maptile *
1393get_map_from_coord (maptile *m, sint16 *x, sint16 *y) 1286maptile::xy_find (sint16 &x, sint16 &y)
1394{ 1287{
1395 if (*x < 0) 1288 if (x < 0)
1396 { 1289 {
1397 if (!m->tile_path[3]) 1290 if (!tile_available (3))
1398 return 0; 1291 return 0;
1399 1292
1400 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1401 load_and_link_tiled_map (m, 3);
1402
1403 *x += m->tile_map[3]->width; 1293 x += tile_map[3]->width;
1404 return (get_map_from_coord (m->tile_map[3], x, y)); 1294 return tile_map[3]->xy_find (x, y);
1405 } 1295 }
1406 1296
1407 if (*x >= m->width) 1297 if (x >= width)
1408 { 1298 {
1409 if (!m->tile_path[1]) 1299 if (!tile_available (1))
1410 return 0; 1300 return 0;
1411 1301
1412 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1413 load_and_link_tiled_map (m, 1);
1414
1415 *x -= m->width; 1302 x -= width;
1416 return (get_map_from_coord (m->tile_map[1], x, y)); 1303 return tile_map[1]->xy_find (x, y);
1417 } 1304 }
1418 1305
1419 if (*y < 0) 1306 if (y < 0)
1420 { 1307 {
1421 if (!m->tile_path[0]) 1308 if (!tile_available (0))
1422 return 0; 1309 return 0;
1423 1310
1424 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1425 load_and_link_tiled_map (m, 0);
1426
1427 *y += m->tile_map[0]->height; 1311 y += tile_map[0]->height;
1428 return (get_map_from_coord (m->tile_map[0], x, y)); 1312 return tile_map[0]->xy_find (x, y);
1429 } 1313 }
1430 1314
1431 if (*y >= m->height) 1315 if (y >= height)
1432 { 1316 {
1433 if (!m->tile_path[2]) 1317 if (!tile_available (2))
1434 return 0; 1318 return 0;
1435 1319
1436 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1437 load_and_link_tiled_map (m, 2);
1438
1439 *y -= m->height; 1320 y -= height;
1440 return (get_map_from_coord (m->tile_map[2], x, y)); 1321 return tile_map[2]->xy_find (x, y);
1441 } 1322 }
1442 1323
1443 /* Simple case - coordinates are within this local 1324 /* Simple case - coordinates are within this local
1444 * map. 1325 * map.
1445 */ 1326 */
1446 return m; 1327 return this;
1447} 1328}
1448 1329
1449/** 1330/**
1450 * Return whether map2 is adjacent to map1. If so, store the distance from 1331 * Return whether map2 is adjacent to map1. If so, store the distance from
1451 * map1 to map2 in dx/dy. 1332 * map1 to map2 in dx/dy.
1452 */ 1333 */
1453static int 1334int
1454adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1335adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1455{ 1336{
1456 if (!map1 || !map2) 1337 if (!map1 || !map2)
1457 return 0; 1338 return 0;
1458 1339
1340 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1341 //fix: compare paths instead (this is likely faster, too!)
1459 if (map1 == map2) 1342 if (map1 == map2)
1460 { 1343 {
1461 *dx = 0; 1344 *dx = 0;
1462 *dy = 0; 1345 *dy = 0;
1463 } 1346 }
… …
1523 } 1406 }
1524 else 1407 else
1525 return 0; 1408 return 0;
1526 1409
1527 return 1; 1410 return 1;
1411}
1412
1413maptile *
1414maptile::xy_load (sint16 &x, sint16 &y)
1415{
1416 maptile *map = xy_find (x, y);
1417
1418 if (map)
1419 map->load_sync ();
1420
1421 return map;
1422}
1423
1424maptile *
1425get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
1426{
1427 return m->xy_load (*x, *y);
1528} 1428}
1529 1429
1530/* From map.c 1430/* From map.c
1531 * This is used by get_player to determine where the other 1431 * This is used by get_player to determine where the other
1532 * creature is. get_rangevector takes into account map tiling, 1432 * creature is. get_rangevector takes into account map tiling,
1533 * so you just can not look the the map coordinates and get the 1433 * so you just can not look the the map coordinates and get the
1534 * righte value. distance_x/y are distance away, which 1434 * righte value. distance_x/y are distance away, which
1535 * can be negativbe. direction is the crossfire direction scheme 1435 * can be negative. direction is the crossfire direction scheme
1536 * that the creature should head. part is the part of the 1436 * that the creature should head. part is the part of the
1537 * monster that is closest. 1437 * monster that is closest.
1538 * 1438 *
1539 * get_rangevector looks at op1 and op2, and fills in the 1439 * get_rangevector looks at op1 and op2, and fills in the
1540 * structure for op1 to get to op2. 1440 * structure for op1 to get to op2.
… …
1551get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1451get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1552{ 1452{
1553 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1453 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1554 { 1454 {
1555 /* be conservative and fill in _some_ data */ 1455 /* be conservative and fill in _some_ data */
1556 retval->distance = 100000; 1456 retval->distance = 10000;
1557 retval->distance_x = 32767; 1457 retval->distance_x = 10000;
1558 retval->distance_y = 32767; 1458 retval->distance_y = 10000;
1559 retval->direction = 0; 1459 retval->direction = 0;
1560 retval->part = 0; 1460 retval->part = 0;
1561 } 1461 }
1562 else 1462 else
1563 { 1463 {
… …
1568 1468
1569 best = op1; 1469 best = op1;
1570 /* If this is multipart, find the closest part now */ 1470 /* If this is multipart, find the closest part now */
1571 if (!(flags & 0x1) && op1->more) 1471 if (!(flags & 0x1) && op1->more)
1572 { 1472 {
1573 object *tmp;
1574 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1473 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1575 1474
1576 /* we just take the offset of the piece to head to figure 1475 /* we just take the offset of the piece to head to figure
1577 * distance instead of doing all that work above again 1476 * distance instead of doing all that work above again
1578 * since the distance fields we set above are positive in the 1477 * since the distance fields we set above are positive in the
1579 * same axis as is used for multipart objects, the simply arithmetic 1478 * same axis as is used for multipart objects, the simply arithmetic
1580 * below works. 1479 * below works.
1581 */ 1480 */
1582 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1481 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1583 { 1482 {
1584 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1483 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1585 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1484 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1586 if (tmpi < best_distance) 1485 if (tmpi < best_distance)
1587 { 1486 {
1588 best_distance = tmpi; 1487 best_distance = tmpi;
1589 best = tmp; 1488 best = tmp;
1590 } 1489 }
1591 } 1490 }
1491
1592 if (best != op1) 1492 if (best != op1)
1593 { 1493 {
1594 retval->distance_x += op1->x - best->x; 1494 retval->distance_x += op1->x - best->x;
1595 retval->distance_y += op1->y - best->y; 1495 retval->distance_y += op1->y - best->y;
1596 } 1496 }
1597 } 1497 }
1498
1598 retval->part = best; 1499 retval->part = best;
1599 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1500 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1600 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1501 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1601 } 1502 }
1602} 1503}
1603 1504
1604/* this is basically the same as get_rangevector above, but instead of 1505/* this is basically the same as get_rangevector above, but instead of
… …
1609 * flags has no meaning for this function at this time - I kept it in to 1510 * flags has no meaning for this function at this time - I kept it in to
1610 * be more consistant with the above function and also in case they are needed 1511 * be more consistant with the above function and also in case they are needed
1611 * for something in the future. Also, since no object is pasted, the best 1512 * for something in the future. Also, since no object is pasted, the best
1612 * field of the rv_vector is set to NULL. 1513 * field of the rv_vector is set to NULL.
1613 */ 1514 */
1614
1615void 1515void
1616get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1516get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1617{ 1517{
1618 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1518 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1619 { 1519 {
1620 /* be conservative and fill in _some_ data */ 1520 /* be conservative and fill in _some_ data */
1621 retval->distance = 100000; 1521 retval->distance = 100000;
… …
1627 else 1527 else
1628 { 1528 {
1629 retval->distance_x += op2->x - x; 1529 retval->distance_x += op2->x - x;
1630 retval->distance_y += op2->y - y; 1530 retval->distance_y += op2->y - y;
1631 1531
1632 retval->part = NULL; 1532 retval->part = 0;
1633 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1533 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1634 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1534 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1635 } 1535 }
1636} 1536}
1637 1537
1638/* Returns true of op1 and op2 are effectively on the same map 1538/* Returns true of op1 and op2 are effectively on the same map
… …
1649 int dx, dy; 1549 int dx, dy;
1650 1550
1651 return adjacent_map (op1->map, op2->map, &dx, &dy); 1551 return adjacent_map (op1->map, op2->map, &dx, &dy);
1652} 1552}
1653 1553
1554//-GPL
1555
1654object * 1556object *
1655maptile::insert (object *op, int x, int y, object *originator, int flags) 1557maptile::insert (object *op, int x, int y, object *originator, int flags)
1656{ 1558{
1657 if (!op->flag [FLAG_REMOVED])
1658 op->remove ();
1659
1660 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1559 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1661} 1560}
1662 1561
1562region *
1563maptile::region (int x, int y) const
1564{
1565 if (regions
1566 && regionmap
1567 && !OUT_OF_REAL_MAP (this, x, y))
1568 if (struct region *reg = regionmap [regions [y * width + x]])
1569 return reg;
1570
1571 if (default_region)
1572 return default_region;
1573
1574 return ::region::default_region ();
1575}
1576
1577//+GPL
1578
1579/* picks a random object from a style map.
1580 */
1581object *
1582maptile::pick_random_object (rand_gen &gen) const
1583{
1584 /* while returning a null object will result in a crash, that
1585 * is actually preferable to an infinite loop. That is because
1586 * most servers will automatically restart in case of crash.
1587 * Change the logic on getting the random space - shouldn't make
1588 * any difference, but this seems clearer to me.
1589 */
1590 for (int i = 1000; --i;)
1591 {
1592 object *pick = at (gen (width), gen (height)).bot;
1593
1594 // do not prefer big monsters just because they are big.
1595 if (pick && pick->is_head ())
1596 return pick->head_ ();
1597 }
1598
1599 // instead of crashing in the unlikely(?) case, try to return *something*
1600 return archetype::find (shstr_bug);
1601}
1602
1603//-GPL
1604
1605void
1606maptile::play_sound (faceidx sound, int x, int y) const
1607{
1608 if (!sound)
1609 return;
1610
1611 for_all_players_on_map (pl, this)
1612 if (client *ns = pl->ns)
1613 {
1614 int dx = x - pl->ob->x;
1615 int dy = y - pl->ob->y;
1616
1617 int distance = idistance (dx, dy);
1618
1619 if (distance <= MAX_SOUND_DISTANCE)
1620 ns->play_sound (sound, dx, dy);
1621 }
1622}
1623
1624void
1625maptile::say_msg (const char *msg, int x, int y) const
1626{
1627 for_all_players (pl)
1628 if (client *ns = pl->ns)
1629 {
1630 int dx = x - pl->ob->x;
1631 int dy = y - pl->ob->y;
1632
1633 int distance = idistance (dx, dy);
1634
1635 if (distance <= MAX_SOUND_DISTANCE)
1636 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1637 }
1638}
1639
1640static void
1641split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1642{
1643 // clip to map to the left
1644 if (x0 < 0)
1645 {
1646 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1647 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1648
1649 if (x1 < 0) // entirely to the left
1650 return;
1651
1652 x0 = 0;
1653 }
1654
1655 // clip to map to the right
1656 if (x1 > m->width)
1657 {
1658 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1659 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1660
1661 if (x0 > m->width) // entirely to the right
1662 return;
1663
1664 x1 = m->width;
1665 }
1666
1667 // clip to map above
1668 if (y0 < 0)
1669 {
1670 if (maptile *tile = m->tile_available (TILE_UP, 1))
1671 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1672
1673 if (y1 < 0) // entirely above
1674 return;
1675
1676 y0 = 0;
1677 }
1678
1679 // clip to map below
1680 if (y1 > m->height)
1681 {
1682 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1683 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1684
1685 if (y0 > m->height) // entirely below
1686 return;
1687
1688 y1 = m->height;
1689 }
1690
1691 // if we get here, the rect is within the current map
1692 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1693
1694 r->m = m;
1695 r->x0 = x0;
1696 r->y0 = y0;
1697 r->x1 = x1;
1698 r->y1 = y1;
1699 r->dx = dx;
1700 r->dy = dy;
1701}
1702
1703maprect *
1704maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1705{
1706 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1707 buf.clear ();
1708
1709 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1710
1711 // add end marker
1712 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1713 r->m = 0;
1714
1715 return (maprect *)buf.linearise ();
1716}
1717

Diff Legend

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