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.101 by root, Sat Apr 21 16:56:28 2007 UTC vs.
Revision 1.163 by root, Thu Oct 15 21:40:42 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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * 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
9 * 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
10 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * 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
19 * 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
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * 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>
23 */ 23 */
24 24
25#include <unistd.h> 25#include <unistd.h>
26 26
27#include "global.h" 27#include "global.h"
28#include "funcpoint.h"
29
30#include "loader.h" 28#include "loader.h"
31
32#include "path.h" 29#include "path.h"
33 30
34/* 31sint8 maptile::outdoor_darkness;
35 * This makes a path absolute outside the world of Crossfire.
36 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
37 * and returns the pointer to a static array containing the result.
38 * it really should be called create_mapname
39 */
40const char *
41create_pathname (const char *name)
42{
43 static char buf[8192];
44 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
45 return buf;
46}
47
48/*
49 * This function checks if a file with the given path exists.
50 * -1 is returned if it fails, otherwise the mode of the file
51 * is returned.
52 * It tries out all the compression suffixes listed in the uncomp[] array.
53 *
54 * If prepend_dir is set, then we call create_pathname (which prepends
55 * libdir & mapdir). Otherwise, we assume the name given is fully
56 * complete.
57 * Only the editor actually cares about the writablity of this -
58 * the rest of the code only cares that the file is readable.
59 * when the editor goes away, the call to stat should probably be
60 * replaced by an access instead (similar to the windows one, but
61 * that seems to be missing the prepend_dir processing
62 */
63int
64check_path (const char *name, int prepend_dir)
65{
66 char buf[MAX_BUF];
67
68 char *endbuf;
69 struct stat statbuf;
70 int mode = 0;
71
72 if (prepend_dir)
73 assign (buf, create_pathname (name));
74 else
75 assign (buf, name);
76
77 /* old method (strchr(buf, '\0')) seemd very odd to me -
78 * this method should be equivalant and is clearer.
79 * Can not use strcat because we need to cycle through
80 * all the names.
81 */
82 endbuf = buf + strlen (buf);
83
84 if (stat (buf, &statbuf))
85 return -1;
86 if (!S_ISREG (statbuf.st_mode))
87 return (-1);
88
89 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
90 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
91 mode |= 4;
92
93 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
94 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
95 mode |= 2;
96
97 return (mode);
98}
99 32
100/* This rolls up wall, blocks_magic, blocks_view, etc, all into 33/* This rolls up wall, blocks_magic, blocks_view, etc, all into
101 * one function that just returns a P_.. value (see map.h) 34 * one function that just returns a P_.. value (see map.h)
102 * it will also do map translation for tiled maps, returning 35 * it will also do map translation for tiled maps, returning
103 * new values into newmap, nx, and ny. Any and all of those 36 * new values into newmap, nx, and ny. Any and all of those
… …
138 * by the caller. 71 * by the caller.
139 */ 72 */
140int 73int
141blocked_link (object *ob, maptile *m, int sx, int sy) 74blocked_link (object *ob, maptile *m, int sx, int sy)
142{ 75{
143 object *tmp;
144 int mflags, blocked;
145
146 /* Make sure the coordinates are valid - they should be, as caller should 76 /* Make sure the coordinates are valid - they should be, as caller should
147 * have already checked this. 77 * have already checked this.
148 */ 78 */
149 if (OUT_OF_REAL_MAP (m, sx, sy)) 79 if (OUT_OF_REAL_MAP (m, sx, sy))
150 { 80 {
… …
153 } 83 }
154 84
155 /* Save some cycles - instead of calling get_map_flags(), just get the value 85 /* Save some cycles - instead of calling get_map_flags(), just get the value
156 * directly. 86 * directly.
157 */ 87 */
158 mflags = m->at (sx, sy).flags (); 88 mapspace &ms = m->at (sx, sy);
159 89
160 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 90 int mflags = ms.flags ();
91 int blocked = ms.move_block;
161 92
162 /* If space is currently not blocked by anything, no need to 93 /* If space is currently not blocked by anything, no need to
163 * go further. Not true for players - all sorts of special 94 * go further. Not true for players - all sorts of special
164 * things we need to do for players. 95 * things we need to do for players.
165 */ 96 */
166 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 97 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
167 return 0; 98 return 0;
168 99
169 /* if there isn't anytyhing alive on this space, and this space isn't 100 /* if there isn't anything alive on this space, and this space isn't
170 * otherwise blocked, we can return now. Only if there is a living 101 * otherwise blocked, we can return now. Only if there is a living
171 * creature do we need to investigate if it is part of this creature 102 * creature do we need to investigate if it is part of this creature
172 * or another. Likewise, only if something is blocking us do we 103 * or another. Likewise, only if something is blocking us do we
173 * need to investigate if there is a special circumstance that would 104 * need to investigate if there is a special circumstance that would
174 * let the player through (inventory checkers for example) 105 * let the player through (inventory checkers for example)
175 */ 106 */
176 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 107 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
177 return 0; 108 return 0;
178 109
179 if (ob->head != NULL)
180 ob = ob->head; 110 ob = ob->head_ ();
181 111
182 /* We basically go through the stack of objects, and if there is 112 /* We basically go through the stack of objects, and if there is
183 * some other object that has NO_PASS or FLAG_ALIVE set, return 113 * some other object that has NO_PASS or FLAG_ALIVE set, return
184 * true. If we get through the entire stack, that must mean 114 * true. If we get through the entire stack, that must mean
185 * ob is blocking it, so return 0. 115 * ob is blocking it, so return 0.
186 */ 116 */
187 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) 117 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
188 { 118 {
119 bool block = OB_MOVE_BLOCK (ob, tmp);
189 120
190 /* This must be before the checks below. Code for inventory checkers. */ 121 /* This must be before the checks below. Code for inventory checkers. */
191 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) 122 if (block && tmp->type == CHECK_INV)
192 { 123 {
124 bool have = check_inv_recursive (ob, tmp);
125
193 /* If last_sp is set, the player/monster needs an object, 126 /* If last_sp is set, the player/monster needs an object,
194 * so we check for it. If they don't have it, they can't 127 * so we check for it. If they don't have it, they can't
195 * pass through this space. 128 * pass through this space.
196 */ 129 */
197 if (tmp->last_sp) 130 if (tmp->last_sp)
198 { 131 {
199 if (check_inv_recursive (ob, tmp) == NULL) 132 if (!have)
200 return 1; 133 return 1;
201 else
202 continue;
203 } 134 }
204 else 135 else
205 { 136 {
206 /* In this case, the player must not have the object - 137 /* In this case, the player must not have the object -
207 * if they do, they can't pass through. 138 * if they do, they can't pass through.
208 */ 139 */
209 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ 140 if (have)
210 return 1; 141 return 1;
211 else
212 continue;
213 } 142 }
214 } /* if check_inv */ 143 }
144 else if (block && tmp->type == T_MATCH)
145 {
146 //TODO
147 }
215 else 148 else
216 { 149 {
217 /* Broke apart a big nasty if into several here to make 150 /* Broke apart a big nasty if into several here to make
218 * this more readable. first check - if the space blocks 151 * this more readable. first check - if the space blocks
219 * movement, can't move here. 152 * movement, can't move here.
220 * second - if a monster, can't move there, unles it is a 153 * second - if a monster, can't move there, unless it is a
221 * hidden dm 154 * dm.
222 */ 155 */
223 if (OB_MOVE_BLOCK (ob, tmp)) 156 if (block)
224 return 1; 157 return 1;
225 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && 158
226 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) 159 if (tmp->flag [FLAG_ALIVE]
160 && tmp->head_ () != ob
161 && tmp != ob
162 && tmp->type != DOOR
163 && !tmp->flag [FLAG_WIZ])
227 return 1; 164 return 1;
228 } 165 }
229
230 } 166 }
167
231 return 0; 168 return 0;
232} 169}
233 170
234/* 171/*
235 * Returns true if the given object can't fit in the given spot. 172 * Returns qthe blocking object if the given object can't fit in the given
236 * This is meant for multi space objects - for single space objecs, 173 * spot. This is meant for multi space objects - for single space objecs,
237 * just calling get_map_blocked and checking that against movement type 174 * just calling get_map_blocked and checking that against movement type
238 * of object. This function goes through all the parts of the 175 * of object. This function goes through all the parts of the multipart
239 * multipart object and makes sure they can be inserted. 176 * object and makes sure they can be inserted.
240 * 177 *
241 * While this doesn't call out of map, the get_map_flags does. 178 * While this doesn't call out of map, the get_map_flags does.
242 * 179 *
243 * This function has been used to deprecate arch_out_of_map - 180 * This function has been used to deprecate arch_out_of_map -
244 * this function also does that check, and since in most cases, 181 * this function also does that check, and since in most cases,
… …
255 * 192 *
256 * Note this used to be arch_blocked, but with new movement 193 * Note this used to be arch_blocked, but with new movement
257 * code, we need to have actual object to check its move_type 194 * code, we need to have actual object to check its move_type
258 * against the move_block values. 195 * against the move_block values.
259 */ 196 */
260int 197bool
261ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 198object::blocked (maptile *m, int x, int y) const
262{ 199{
263 archetype *tmp; 200 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
264 int flag;
265 maptile *m1;
266 sint16 sx, sy;
267
268 if (!ob)
269 {
270 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
271 if (flag & P_OUT_OF_MAP)
272 return P_OUT_OF_MAP;
273
274 /* don't have object, so don't know what types would block */
275 return m1->at (sx, sy).move_block;
276 } 201 {
202 mapxy pos (m, x + tmp->x, y + tmp->y);
277 203
278 for (tmp = ob->arch; tmp; tmp = tmp->more) 204 if (!pos.normalise ())
279 { 205 return 1;
280 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
281 206
282 if (flag & P_OUT_OF_MAP) 207 mapspace &ms = *pos;
283 return P_OUT_OF_MAP; 208
284 if (flag & P_IS_ALIVE) 209 if (ms.flags () & P_IS_ALIVE)
285 return P_IS_ALIVE; 210 return 1;
286 211
287 mapspace &ms = m1->at (sx, sy); 212 /* However, often ob doesn't have any move type
288 213 * (signifying non-moving objects)
289 /* find_first_free_spot() calls this function. However, often
290 * ob doesn't have any move type (when used to place exits)
291 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 214 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
292 */ 215 */
293
294 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 216 if (!move_type && ms.move_block != MOVE_ALL)
295 continue; 217 continue;
296 218
297 /* Note it is intentional that we check ob - the movement type of the 219 /* Note it is intentional that we check ob - the movement type of the
298 * head of the object should correspond for the entire object. 220 * head of the object should correspond for the entire object.
299 */ 221 */
300 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 222 if (ms.blocks (move_type))
301 return P_NO_PASS; 223 return 1;
302 } 224 }
303 225
304 return 0; 226 return 0;
305} 227}
306 228
… …
324 246
325 insert_ob_in_ob (tmp, container); 247 insert_ob_in_ob (tmp, container);
326 tmp = next; 248 tmp = next;
327 } 249 }
328 250
329 /* sum_weight will go through and calculate what all the containers are 251 // go through and calculate what all the containers are carrying.
330 * carrying. 252 //TODO: remove
331 */ 253 container->update_weight ();
332 sum_weight (container);
333} 254}
334 255
335void 256void
336maptile::set_object_flag (int flag, int value) 257maptile::set_object_flag (int flag, int value)
337{ 258{
… …
339 return; 260 return;
340 261
341 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 262 for (mapspace *ms = spaces + size (); ms-- > spaces; )
342 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 263 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
343 tmp->flag [flag] = value; 264 tmp->flag [flag] = value;
265}
266
267void
268maptile::post_load_original ()
269{
270 if (!spaces)
271 return;
272
273 set_object_flag (FLAG_OBJ_ORIGINAL);
274
275 for (mapspace *ms = spaces + size (); ms-- > spaces; )
276 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
277 INVOKE_OBJECT (RESET, tmp);
344} 278}
345 279
346/* link_multipart_objects go through all the objects on the map looking 280/* link_multipart_objects go through all the objects on the map looking
347 * for objects whose arch says they are multipart yet according to the 281 * for objects whose arch says they are multipart yet according to the
348 * info we have, they only have the head (as would be expected when 282 * info we have, they only have the head (as would be expected when
… …
353{ 287{
354 if (!spaces) 288 if (!spaces)
355 return; 289 return;
356 290
357 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 291 for (mapspace *ms = spaces + size (); ms-- > spaces; )
358 for (object *op = ms->bot; op; op = op->above) 292 {
293 object *op = ms->bot;
294 while (op)
359 { 295 {
360 /* already multipart - don't do anything more */ 296 /* already multipart - don't do anything more */
361 if (!op->head && !op->more && op->arch->more) 297 if (op->head_ () == op && !op->more && op->arch->more)
362 { 298 {
363 op->remove (); 299 op->remove ();
364 op->expand_tail (); 300 op->expand_tail ();
301
302 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
303 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
304 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
365 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 305 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
306
307 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
308 // so we have to reset the iteration through the mapspace
366 } 309 }
310 else
311 op = op->above;
367 } 312 }
313 }
368} 314}
369 315
370/* 316/*
371 * Loads (ands parses) the objects into a given map from the specified 317 * Loads (ands parses) the objects into a given map from the specified
372 * file pointer. 318 * file pointer.
… …
374bool 320bool
375maptile::_load_objects (object_thawer &f) 321maptile::_load_objects (object_thawer &f)
376{ 322{
377 for (;;) 323 for (;;)
378 { 324 {
379 coroapi::cede_to_tick_every (100); // cede once in a while 325 coroapi::cede_to_tick (); // cede once in a while
380 326
381 switch (f.kw) 327 switch (f.kw)
382 { 328 {
383 case KW_arch: 329 case KW_arch:
384 if (object *op = object::read (f, this)) 330 if (object *op = object::read (f, this))
385 { 331 {
332 // TODO: why?
386 if (op->inv) 333 if (op->inv)
387 sum_weight (op); 334 op->update_weight ();
388 335
389 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 336 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
337 {
338 // we insert manually because
339 // a) its way faster
340 // b) we remove manually, too, and there are good reasons for that
341 // c) it's correct
342 mapspace &ms = at (op->x, op->y);
343
344 op->flag [FLAG_REMOVED] = false;
345
346 op->above = 0;
347 op->below = ms.top;
348
349 *(ms.top ? &ms.top->above : &ms.bot) = op;
350
351 ms.top = op;
352 ms.flags_ = 0;
353 }
354 else
355 {
356 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
357 op->destroy ();
358 }
390 } 359 }
391 360
392 continue; 361 continue;
393 362
394 case KW_EOF: 363 case KW_EOF:
… …
407} 376}
408 377
409void 378void
410maptile::activate () 379maptile::activate ()
411{ 380{
412 active = true;
413
414 if (spaces) 381 if (spaces)
415 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 382 for (mapspace *ms = spaces + size (); ms-- > spaces; )
416 for (object *op = ms->bot; op; op = op->above) 383 for (object *op = ms->bot; op; op = op->above)
417 op->activate_recursive (); 384 op->activate_recursive ();
418} 385}
419 386
420void 387void
421maptile::deactivate () 388maptile::deactivate ()
422{ 389{
423 active = false;
424
425 if (spaces) 390 if (spaces)
426 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 391 for (mapspace *ms = spaces + size (); ms-- > spaces; )
427 for (object *op = ms->bot; op; op = op->above) 392 for (object *op = ms->bot; op; op = op->above)
428 op->deactivate_recursive (); 393 op->deactivate_recursive ();
429} 394}
… …
439 if (!spaces) 404 if (!spaces)
440 return false; 405 return false;
441 406
442 for (int i = 0; i < size (); ++i) 407 for (int i = 0; i < size (); ++i)
443 { 408 {
444 int unique = 0; 409 bool unique = 0;
410
445 for (object *op = spaces [i].bot; op; op = op->above) 411 for (object *op = spaces [i].bot; op; op = op->above)
446 { 412 {
447 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 413 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
448 unique = 1;
449 414
450 if (!op->can_map_save ()) 415 if (expect_false (!op->can_map_save ()))
451 continue; 416 continue;
452 417
453 if (unique || op->flag [FLAG_UNIQUE]) 418 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
454 { 419 {
455 if (flags & IO_UNIQUES) 420 if (flags & IO_UNIQUES)
456 op->write (f); 421 op->write (f);
457 } 422 }
458 else if (flags & IO_OBJECTS) 423 else if (expect_true (flags & IO_OBJECTS))
459 op->write (f); 424 op->write (f);
460 } 425 }
461 } 426 }
462 427
463 coroapi::cede_to_tick (); 428 coroapi::cede_to_tick ();
464 429
465 return true; 430 return true;
466}
467
468bool
469maptile::_load_objects (const char *path, bool skip_header)
470{
471 object_thawer f (path);
472
473 if (!f)
474 return false;
475
476 f.next ();
477
478 if (skip_header)
479 for (;;)
480 {
481 keyword kw = f.kw;
482 f.skip ();
483 if (kw == KW_end)
484 break;
485 }
486
487 return _load_objects (f);
488} 431}
489 432
490bool 433bool
491maptile::_save_objects (const char *path, int flags) 434maptile::_save_objects (const char *path, int flags)
492{ 435{
… …
667bool 610bool
668maptile::_load_header (object_thawer &thawer) 611maptile::_load_header (object_thawer &thawer)
669{ 612{
670 for (;;) 613 for (;;)
671 { 614 {
672 keyword kw = thawer.get_kv ();
673
674 switch (kw) 615 switch (thawer.kw)
675 { 616 {
676 case KW_msg: 617 case KW_msg:
677 thawer.get_ml (KW_endmsg, msg); 618 thawer.get_ml (KW_endmsg, msg);
678 break; 619 break;
679 620
… …
711 case KW_winddir: thawer.get (winddir); break; 652 case KW_winddir: thawer.get (winddir); break;
712 case KW_sky: thawer.get (sky); break; 653 case KW_sky: thawer.get (sky); break;
713 654
714 case KW_per_player: thawer.get (per_player); break; 655 case KW_per_player: thawer.get (per_player); break;
715 case KW_per_party: thawer.get (per_party); break; 656 case KW_per_party: thawer.get (per_party); break;
657 case KW_no_reset: thawer.get (no_reset); break;
658 case KW_no_drop: thawer.get (no_drop); break;
716 659
717 case KW_region: default_region = region::find (thawer.get_str ()); break; 660 case KW_region: default_region = region::find (thawer.get_str ()); break;
718 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 661 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
719 662
720 // old names new names 663 // old names new names
… …
731 case KW_tile_path_1: thawer.get (tile_path [0]); break; 674 case KW_tile_path_1: thawer.get (tile_path [0]); break;
732 case KW_tile_path_2: thawer.get (tile_path [1]); break; 675 case KW_tile_path_2: thawer.get (tile_path [1]); break;
733 case KW_tile_path_3: thawer.get (tile_path [2]); break; 676 case KW_tile_path_3: thawer.get (tile_path [2]); break;
734 case KW_tile_path_4: thawer.get (tile_path [3]); break; 677 case KW_tile_path_4: thawer.get (tile_path [3]); break;
735 678
679 case KW_ERROR:
680 set_key_text (thawer.kw_str, thawer.value);
681 break;
682
736 case KW_end: 683 case KW_end:
684 thawer.next ();
737 return true; 685 return true;
738 686
739 default: 687 default:
740 if (!thawer.parse_error ("map", 0)) 688 if (!thawer.parse_error ("map", 0))
741 return false; 689 return false;
742 break; 690 break;
743 } 691 }
692
693 thawer.next ();
744 } 694 }
745 695
746 abort (); 696 abort ();
747}
748
749bool
750maptile::_load_header (const char *path)
751{
752 object_thawer thawer (path);
753
754 if (!thawer)
755 return false;
756
757 return _load_header (thawer);
758} 697}
759 698
760/****************************************************************************** 699/******************************************************************************
761 * This is the start of unique map handling code 700 * This is the start of unique map handling code
762 *****************************************************************************/ 701 *****************************************************************************/
… …
773 object *above = op->above; 712 object *above = op->above;
774 713
775 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 714 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
776 unique = 1; 715 unique = 1;
777 716
778 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 717 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
779 {
780 op->destroy_inv (false);
781 op->destroy (); 718 op->destroy ();
782 }
783 719
784 op = above; 720 op = above;
785 } 721 }
786 } 722 }
787} 723}
… …
797 if (name) MAP_OUT (name); 733 if (name) MAP_OUT (name);
798 MAP_OUT (swap_time); 734 MAP_OUT (swap_time);
799 MAP_OUT (reset_time); 735 MAP_OUT (reset_time);
800 MAP_OUT (reset_timeout); 736 MAP_OUT (reset_timeout);
801 MAP_OUT (fixed_resettime); 737 MAP_OUT (fixed_resettime);
738 MAP_OUT (no_reset);
739 MAP_OUT (no_drop);
802 MAP_OUT (difficulty); 740 MAP_OUT (difficulty);
803 741
804 if (default_region) MAP_OUT2 (region, default_region->name); 742 if (default_region) MAP_OUT2 (region, default_region->name);
805 743
806 if (shopitems) 744 if (shopitems)
… …
860 * Remove and free all objects in the given map. 798 * Remove and free all objects in the given map.
861 */ 799 */
862void 800void
863maptile::clear () 801maptile::clear ()
864{ 802{
865 sfree (regions, size ()), regions = 0;
866 free (regionmap), regionmap = 0;
867
868 if (spaces) 803 if (spaces)
869 { 804 {
870 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 805 for (mapspace *ms = spaces + size (); ms-- > spaces; )
871 while (object *op = ms->bot) 806 while (object *op = ms->bot)
872 { 807 {
808 // manually remove, as to not trigger anything
809 if (ms->bot = op->above)
810 ms->bot->below = 0;
811
812 op->flag [FLAG_REMOVED] = true;
813
814 object *head = op->head_ ();
873 if (op->head) 815 if (op == head)
874 op = op->head;
875
876 op->destroy_inv (false);
877 op->destroy (); 816 op->destroy ();
817 else if (head->map != op->map)
818 {
819 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
820 head->destroy ();
821 }
878 } 822 }
879 823
880 sfree (spaces, size ()), spaces = 0; 824 sfree0 (spaces, size ());
881 } 825 }
882 826
883 if (buttons) 827 if (buttons)
884 free_objectlinkpt (buttons), buttons = 0; 828 free_objectlinkpt (buttons), buttons = 0;
829
830 sfree0 (regions, size ());
831 delete [] regionmap; regionmap = 0;
885} 832}
886 833
887void 834void
888maptile::clear_header () 835maptile::clear_header ()
889{ 836{
… …
921 attachable::do_destroy (); 868 attachable::do_destroy ();
922 869
923 clear (); 870 clear ();
924} 871}
925 872
926/* 873/* decay and destroy perishable items in a map */
927 * Updates every button on the map (by calling update_button() for them).
928 */
929void 874void
930maptile::update_buttons () 875maptile::do_decay_objects ()
931{ 876{
932 for (oblinkpt *obp = buttons; obp; obp = obp->next) 877 if (!spaces)
933 for (objectlink *ol = obp->link; ol; ol = ol->next) 878 return;
879
880 for (mapspace *ms = spaces + size (); ms-- > spaces; )
881 for (object *above, *op = ms->bot; op; op = above)
934 { 882 {
935 if (!ol->ob) 883 above = op->above;
884
885 bool destroy = 0;
886
887 // do not decay anything above unique floor tiles (yet :)
888 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
889 break;
890
891 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
892 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
893 || QUERY_FLAG (op, FLAG_UNIQUE)
894 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
895 || QUERY_FLAG (op, FLAG_UNPAID)
896 || op->is_alive ())
897 ; // do not decay
898 else if (op->is_weapon ())
936 { 899 {
937 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", 900 op->stats.dam--;
938 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); 901 if (op->stats.dam < 0)
939 continue; 902 destroy = 1;
940 } 903 }
941 904 else if (op->is_armor ())
942 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
943 { 905 {
944 update_button (ol->ob); 906 op->stats.ac--;
945 break; 907 if (op->stats.ac < 0)
908 destroy = 1;
946 } 909 }
910 else if (op->type == FOOD)
911 {
912 op->stats.food -= rndm (5, 20);
913 if (op->stats.food < 0)
914 destroy = 1;
915 }
916 else
917 {
918 int mat = op->materials;
919
920 if (mat & M_PAPER
921 || mat & M_LEATHER
922 || mat & M_WOOD
923 || mat & M_ORGANIC
924 || mat & M_CLOTH
925 || mat & M_LIQUID
926 || (mat & M_IRON && rndm (1, 5) == 1)
927 || (mat & M_GLASS && rndm (1, 2) == 1)
928 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
929 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
930 || (mat & M_ICE && temp > 32))
931 destroy = 1;
932 }
933
934 /* adjust overall chance below */
935 if (destroy && rndm (0, 1))
936 op->destroy ();
947 } 937 }
948} 938}
949 939
950/* 940/*
951 * This routine is supposed to find out the difficulty of the map. 941 * This routine is supposed to find out the difficulty of the map.
952 * difficulty does not have a lot to do with character level, 942 * difficulty does not have a lot to do with character level,
953 * but does have a lot to do with treasure on the map. 943 * but does have a lot to do with treasure on the map.
954 * 944 *
955 * Difficulty can now be set by the map creature. If the value stored 945 * Difficulty can now be set by the map creator. If the value stored
956 * in the map is zero, then use this routine. Maps should really 946 * in the map is zero, then use this routine. Maps should really
957 * have a difficulty set than using this function - human calculation 947 * have a difficulty set rather than using this function - human calculation
958 * is much better than this functions guesswork. 948 * is much better than this function's guesswork.
959 */ 949 */
960int 950int
961maptile::estimate_difficulty () const 951maptile::estimate_difficulty () const
962{ 952{
963 long monster_cnt = 0; 953 long monster_cnt = 0;
… …
975 965
976 if (QUERY_FLAG (op, FLAG_GENERATOR)) 966 if (QUERY_FLAG (op, FLAG_GENERATOR))
977 { 967 {
978 total_exp += op->stats.exp; 968 total_exp += op->stats.exp;
979 969
980 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 970 if (archetype *at = op->other_arch)
971 {
981 total_exp += at->clone.stats.exp * 8; 972 total_exp += at->stats.exp * 8;
982
983 monster_cnt++; 973 monster_cnt++;
974 }
975
976 for (object *inv = op->inv; inv; inv = inv->below)
977 {
978 total_exp += op->stats.exp * 8;
979 monster_cnt++;
980 }
984 } 981 }
985 } 982 }
986 983
987 avgexp = (double) total_exp / monster_cnt; 984 avgexp = (double) total_exp / monster_cnt;
988 985
… …
1001 * postive values make it darker, negative make it brighter 998 * postive values make it darker, negative make it brighter
1002 */ 999 */
1003int 1000int
1004maptile::change_map_light (int change) 1001maptile::change_map_light (int change)
1005{ 1002{
1006 int new_level = darkness + change;
1007
1008 /* Nothing to do */ 1003 /* Nothing to do */
1009 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1004 if (!change)
1010 return 0; 1005 return 0;
1011 1006
1012 /* inform all players on the map */ 1007 /* inform all players on the map */
1013 if (change > 0) 1008 if (change > 0)
1014 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1009 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1015 else 1010 else
1016 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1011 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1017 1012
1018 /* Do extra checking. since darkness is a unsigned value, 1013 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1019 * we need to be extra careful about negative values.
1020 * In general, the checks below are only needed if change
1021 * is not +/-1
1022 */
1023 if (new_level < 0)
1024 darkness = 0;
1025 else if (new_level >= MAX_DARKNESS)
1026 darkness = MAX_DARKNESS;
1027 else
1028 darkness = new_level;
1029 1014
1030 /* All clients need to get re-updated for the change */ 1015 /* All clients need to get re-updated for the change */
1031 update_all_map_los (this); 1016 update_all_map_los (this);
1017
1032 return 1; 1018 return 1;
1033} 1019}
1034 1020
1035/* 1021/*
1036 * This function updates various attributes about a specific space 1022 * This function updates various attributes about a specific space
… …
1039 * through, etc) 1025 * through, etc)
1040 */ 1026 */
1041void 1027void
1042mapspace::update_ () 1028mapspace::update_ ()
1043{ 1029{
1044 object *tmp, *last = 0; 1030 object *last = 0;
1045 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1031 uint8 flags = P_UPTODATE, anywhere = 0;
1032 sint8 light = 0;
1046 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1033 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1047 1034
1048 //object *middle = 0; 1035 //object *middle = 0;
1049 //object *top = 0; 1036 //object *top = 0;
1050 //object *floor = 0; 1037 //object *floor = 0;
1051 // this seems to generate better code than using locals, above 1038 // this seems to generate better code than using locals, above
1052 object *&top = faces_obj[0] = 0; 1039 object *&top = faces_obj[0] = 0;
1053 object *&middle = faces_obj[1] = 0; 1040 object *&middle = faces_obj[1] = 0;
1054 object *&floor = faces_obj[2] = 0; 1041 object *&floor = faces_obj[2] = 0;
1055 1042
1056 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1043 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1057 { 1044 {
1058 /* This could be made additive I guess (two lights better than 1045 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1059 * one). But if so, it shouldn't be a simple additive - 2
1060 * light bulbs do not illuminate twice as far as once since
1061 * it is a dissapation factor that is cubed.
1062 */
1063 if (tmp->glow_radius > light)
1064 light = tmp->glow_radius; 1046 light += tmp->glow_radius;
1065 1047
1066 /* This call is needed in order to update objects the player 1048 /* This call is needed in order to update objects the player
1067 * is standing in that have animations (ie, grass, fire, etc). 1049 * is standing in that have animations (ie, grass, fire, etc).
1068 * However, it also causes the look window to be re-drawn 1050 * However, it also causes the look window to be re-drawn
1069 * 3 times each time the player moves, because many of the 1051 * 3 times each time the player moves, because many of the
… …
1088 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1070 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1089 { 1071 {
1090 middle = tmp; 1072 middle = tmp;
1091 anywhere = 1; 1073 anywhere = 1;
1092 } 1074 }
1075
1093 /* Find the highest visible face around. If equal 1076 /* Find the highest visible face around. If equal
1094 * visibilities, we still want the one nearer to the 1077 * visibilities, we still want the one nearer to the
1095 * top 1078 * top
1096 */ 1079 */
1097 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) 1080 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
… …
1116 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1099 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1117 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1100 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1118 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1101 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1119 } 1102 }
1120 1103
1121 this->light = light; 1104 this->light = min (light, MAX_LIGHT_RADIUS);
1122 this->flags_ = flags; 1105 this->flags_ = flags;
1123 this->move_block = move_block & ~move_allow; 1106 this->move_block = move_block & ~move_allow;
1124 this->move_on = move_on; 1107 this->move_on = move_on;
1125 this->move_off = move_off; 1108 this->move_off = move_off;
1126 this->move_slow = move_slow; 1109 this->move_slow = move_slow;
… …
1146 * 1) top face is set, need middle to be set. 1129 * 1) top face is set, need middle to be set.
1147 * 2) middle is set, need to set top. 1130 * 2) middle is set, need to set top.
1148 * 3) neither middle or top is set - need to set both. 1131 * 3) neither middle or top is set - need to set both.
1149 */ 1132 */
1150 1133
1151 for (tmp = last; tmp; tmp = tmp->below) 1134 for (object *tmp = last; tmp; tmp = tmp->below)
1152 { 1135 {
1153 /* Once we get to a floor, stop, since we already have a floor object */ 1136 /* Once we get to a floor, stop, since we already have a floor object */
1154 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1137 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1155 break; 1138 break;
1156 1139
… …
1208 vol += op->volume (); 1191 vol += op->volume ();
1209 1192
1210 return vol; 1193 return vol;
1211} 1194}
1212 1195
1213/* this updates the orig_map->tile_map[tile_num] value after finding 1196maptile *
1214 * the map. It also takes care of linking back the freshly found 1197maptile::tile_available (int dir, bool load)
1215 * maps tile_map values if it tiles back to this one. It returns
1216 * the value of orig_map->tile_map[tile_num].
1217 */
1218static inline maptile *
1219find_and_link (maptile *orig_map, int tile_num)
1220{ 1198{
1221 maptile *mp = orig_map->tile_map [tile_num]; 1199 if (tile_path[dir])
1222
1223 if (!mp)
1224 {
1225 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1226
1227 if (!mp)
1228 {
1229 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1230 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1231 &orig_map->tile_path[tile_num], &orig_map->path);
1232 mp = new maptile (1, 1);
1233 mp->alloc ();
1234 mp->in_memory = MAP_IN_MEMORY;
1235 }
1236 } 1200 {
1201 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1202 return tile_map[dir];
1237 1203
1238 int dest_tile = (tile_num + 2) % 4; 1204 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1205 return tile_map[dir];
1206 }
1239 1207
1240 orig_map->tile_map [tile_num] = mp;
1241
1242 // optimisation: back-link map to origin map if euclidean
1243 //TODO: non-euclidean maps MUST GO
1244 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1245 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1246
1247 return mp; 1208 return 0;
1248}
1249
1250static inline void
1251load_and_link (maptile *orig_map, int tile_num)
1252{
1253 find_and_link (orig_map, tile_num)->load_sync ();
1254} 1209}
1255 1210
1256/* this returns TRUE if the coordinates (x,y) are out of 1211/* this returns TRUE if the coordinates (x,y) are out of
1257 * map m. This function also takes into account any 1212 * map m. This function also takes into account any
1258 * tiling considerations, loading adjacant maps as needed. 1213 * tiling considerations, loading adjacant maps as needed.
… …
1271 if (!m) 1226 if (!m)
1272 return 0; 1227 return 0;
1273 1228
1274 if (x < 0) 1229 if (x < 0)
1275 { 1230 {
1276 if (!m->tile_path[3]) 1231 if (!m->tile_available (3))
1277 return 1; 1232 return 1;
1278 1233
1279 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1280 find_and_link (m, 3);
1281
1282 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1234 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1283 } 1235 }
1284 1236
1285 if (x >= m->width) 1237 if (x >= m->width)
1286 { 1238 {
1287 if (!m->tile_path[1]) 1239 if (!m->tile_available (1))
1288 return 1; 1240 return 1;
1289 1241
1290 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1291 find_and_link (m, 1);
1292
1293 return out_of_map (m->tile_map[1], x - m->width, y); 1242 return out_of_map (m->tile_map[1], x - m->width, y);
1294 } 1243 }
1295 1244
1296 if (y < 0) 1245 if (y < 0)
1297 { 1246 {
1298 if (!m->tile_path[0]) 1247 if (!m->tile_available (0))
1299 return 1; 1248 return 1;
1300 1249
1301 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1302 find_and_link (m, 0);
1303
1304 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1250 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1305 } 1251 }
1306 1252
1307 if (y >= m->height) 1253 if (y >= m->height)
1308 { 1254 {
1309 if (!m->tile_path[2]) 1255 if (!m->tile_available (2))
1310 return 1; 1256 return 1;
1311
1312 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1313 find_and_link (m, 2);
1314 1257
1315 return out_of_map (m->tile_map[2], x, y - m->height); 1258 return out_of_map (m->tile_map[2], x, y - m->height);
1316 } 1259 }
1317 1260
1318 /* Simple case - coordinates are within this local 1261 /* Simple case - coordinates are within this local
… …
1332maptile * 1275maptile *
1333maptile::xy_find (sint16 &x, sint16 &y) 1276maptile::xy_find (sint16 &x, sint16 &y)
1334{ 1277{
1335 if (x < 0) 1278 if (x < 0)
1336 { 1279 {
1337 if (!tile_path[3]) 1280 if (!tile_available (3))
1338 return 0; 1281 return 0;
1339 1282
1340 find_and_link (this, 3);
1341 x += tile_map[3]->width; 1283 x += tile_map[3]->width;
1342 return tile_map[3]->xy_find (x, y); 1284 return tile_map[3]->xy_find (x, y);
1343 } 1285 }
1344 1286
1345 if (x >= width) 1287 if (x >= width)
1346 { 1288 {
1347 if (!tile_path[1]) 1289 if (!tile_available (1))
1348 return 0; 1290 return 0;
1349 1291
1350 find_and_link (this, 1);
1351 x -= width; 1292 x -= width;
1352 return tile_map[1]->xy_find (x, y); 1293 return tile_map[1]->xy_find (x, y);
1353 } 1294 }
1354 1295
1355 if (y < 0) 1296 if (y < 0)
1356 { 1297 {
1357 if (!tile_path[0]) 1298 if (!tile_available (0))
1358 return 0; 1299 return 0;
1359 1300
1360 find_and_link (this, 0);
1361 y += tile_map[0]->height; 1301 y += tile_map[0]->height;
1362 return tile_map[0]->xy_find (x, y); 1302 return tile_map[0]->xy_find (x, y);
1363 } 1303 }
1364 1304
1365 if (y >= height) 1305 if (y >= height)
1366 { 1306 {
1367 if (!tile_path[2]) 1307 if (!tile_available (2))
1368 return 0; 1308 return 0;
1369 1309
1370 find_and_link (this, 2);
1371 y -= height; 1310 y -= height;
1372 return tile_map[2]->xy_find (x, y); 1311 return tile_map[2]->xy_find (x, y);
1373 } 1312 }
1374 1313
1375 /* Simple case - coordinates are within this local 1314 /* Simple case - coordinates are within this local
… …
1386adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1325adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1387{ 1326{
1388 if (!map1 || !map2) 1327 if (!map1 || !map2)
1389 return 0; 1328 return 0;
1390 1329
1391 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded 1330 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1392 //fix: compare paths instead (this is likely faster, too!) 1331 //fix: compare paths instead (this is likely faster, too!)
1393 if (map1 == map2) 1332 if (map1 == map2)
1394 { 1333 {
1395 *dx = 0; 1334 *dx = 0;
1396 *dy = 0; 1335 *dy = 0;
… …
1578 else 1517 else
1579 { 1518 {
1580 retval->distance_x += op2->x - x; 1519 retval->distance_x += op2->x - x;
1581 retval->distance_y += op2->y - y; 1520 retval->distance_y += op2->y - y;
1582 1521
1583 retval->part = NULL; 1522 retval->part = 0;
1584 retval->distance = idistance (retval->distance_x, retval->distance_y); 1523 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1585 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1524 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1586 } 1525 }
1587} 1526}
1588 1527
1589/* Returns true of op1 and op2 are effectively on the same map 1528/* Returns true of op1 and op2 are effectively on the same map
… …
1603} 1542}
1604 1543
1605object * 1544object *
1606maptile::insert (object *op, int x, int y, object *originator, int flags) 1545maptile::insert (object *op, int x, int y, object *originator, int flags)
1607{ 1546{
1608 if (!op->flag [FLAG_REMOVED])
1609 op->remove ();
1610
1611 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1547 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1612} 1548}
1613 1549
1614region * 1550region *
1615maptile::region (int x, int y) const 1551maptile::region (int x, int y) const
… …
1625 1561
1626 return ::region::default_region (); 1562 return ::region::default_region ();
1627} 1563}
1628 1564
1629/* picks a random object from a style map. 1565/* picks a random object from a style map.
1630 * Redone by MSW so it should be faster and not use static
1631 * variables to generate tables.
1632 */ 1566 */
1633object * 1567object *
1634maptile::pick_random_object () const 1568maptile::pick_random_object (rand_gen &gen) const
1635{ 1569{
1636 /* while returning a null object will result in a crash, that 1570 /* while returning a null object will result in a crash, that
1637 * is actually preferable to an infinite loop. That is because 1571 * is actually preferable to an infinite loop. That is because
1638 * most servers will automatically restart in case of crash. 1572 * most servers will automatically restart in case of crash.
1639 * Change the logic on getting the random space - shouldn't make 1573 * Change the logic on getting the random space - shouldn't make
1640 * any difference, but this seems clearer to me. 1574 * any difference, but this seems clearer to me.
1641 */ 1575 */
1642 for (int i = 1000; --i;) 1576 for (int i = 1000; --i;)
1643 { 1577 {
1644 object *pick = at (rndm (width), rndm (height)).bot; 1578 object *pick = at (gen (width), gen (height)).bot;
1645 1579
1646 // do not prefer big monsters just because they are big. 1580 // do not prefer big monsters just because they are big.
1647 if (pick && pick->head_ () == pick) 1581 if (pick && pick->is_head ())
1648 return pick->head_ (); 1582 return pick->head_ ();
1649 } 1583 }
1650 1584
1651 // instead of crashing in the unlikely(?) case, try to return *something* 1585 // instead of crashing in the unlikely(?) case, try to return *something*
1652 return get_archetype ("blocked"); 1586 return archetype::find ("bug");
1653} 1587}
1654 1588
1589void
1590maptile::play_sound (faceidx sound, int x, int y) const
1591{
1592 if (!sound)
1593 return;
1594
1595 for_all_players_on_map (pl, this)
1596 if (client *ns = pl->ns)
1597 {
1598 int dx = x - pl->ob->x;
1599 int dy = y - pl->ob->y;
1600
1601 int distance = idistance (dx, dy);
1602
1603 if (distance <= MAX_SOUND_DISTANCE)
1604 ns->play_sound (sound, dx, dy);
1605 }
1606}
1607
1608void
1609maptile::say_msg (const char *msg, int x, int y) const
1610{
1611 for_all_players (pl)
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->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1621 }
1622}
1623
1624static void
1625split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1626{
1627 // clip to map to the left
1628 if (x0 < 0)
1629 {
1630 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1631 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1632
1633 if (x1 < 0) // entirely to the left
1634 return;
1635
1636 x0 = 0;
1637 }
1638
1639 // clip to map to the right
1640 if (x1 > m->width)
1641 {
1642 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1643 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1644
1645 if (x0 > m->width) // entirely to the right
1646 return;
1647
1648 x1 = m->width;
1649 }
1650
1651 // clip to map above
1652 if (y0 < 0)
1653 {
1654 if (maptile *tile = m->tile_available (TILE_UP, 1))
1655 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1656
1657 if (y1 < 0) // entirely above
1658 return;
1659
1660 y0 = 0;
1661 }
1662
1663 // clip to map below
1664 if (y1 > m->height)
1665 {
1666 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1667 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1668
1669 if (y0 > m->height) // entirely below
1670 return;
1671
1672 y1 = m->height;
1673 }
1674
1675 // if we get here, the rect is within the current map
1676 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1677
1678 r->m = m;
1679 r->x0 = x0;
1680 r->y0 = y0;
1681 r->x1 = x1;
1682 r->y1 = y1;
1683 r->dx = dx;
1684 r->dy = dy;
1685}
1686
1687maprect *
1688maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1689{
1690 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1691 buf.clear ();
1692
1693 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1694
1695 // add end marker
1696 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1697 r->m = 0;
1698
1699 return (maprect *)buf.linearise ();
1700}
1701

Diff Legend

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