| 1 | /* |
1 | /* |
| 2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 | * |
3 | * |
| 4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
| 6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
| 7 | * |
7 | * |
| 8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
| 9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
| 10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
| 11 | * (at your option) any later version. |
11 | * (at your 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, |
| … | |
… | |
| 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 GNU General Public License |
| 19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 20 | * |
20 | * |
| 21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 22 | */ |
22 | */ |
| 23 | |
23 | |
| 24 | #include <unistd.h> |
24 | #include <unistd.h> |
| 25 | |
25 | |
| 26 | #include "global.h" |
26 | #include "global.h" |
| 27 | #include "funcpoint.h" |
|
|
| 28 | |
|
|
| 29 | #include "loader.h" |
27 | #include "loader.h" |
| 30 | |
|
|
| 31 | #include "path.h" |
28 | #include "path.h" |
| 32 | |
29 | |
| 33 | /* |
30 | sint8 maptile::outdoor_darkness; |
| 34 | * This makes a path absolute outside the world of Crossfire. |
|
|
| 35 | * In other words, it prepends LIBDIR/MAPDIR/ to the given path |
|
|
| 36 | * and returns the pointer to a static array containing the result. |
|
|
| 37 | * it really should be called create_mapname |
|
|
| 38 | */ |
|
|
| 39 | const char * |
|
|
| 40 | create_pathname (const char *name) |
|
|
| 41 | { |
|
|
| 42 | static char buf[8192]; |
|
|
| 43 | snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name); |
|
|
| 44 | return buf; |
|
|
| 45 | } |
|
|
| 46 | |
|
|
| 47 | /* |
|
|
| 48 | * This function checks if a file with the given path exists. |
|
|
| 49 | * -1 is returned if it fails, otherwise the mode of the file |
|
|
| 50 | * is returned. |
|
|
| 51 | * It tries out all the compression suffixes listed in the uncomp[] array. |
|
|
| 52 | * |
|
|
| 53 | * If prepend_dir is set, then we call create_pathname (which prepends |
|
|
| 54 | * libdir & mapdir). Otherwise, we assume the name given is fully |
|
|
| 55 | * complete. |
|
|
| 56 | * Only the editor actually cares about the writablity of this - |
|
|
| 57 | * the rest of the code only cares that the file is readable. |
|
|
| 58 | * when the editor goes away, the call to stat should probably be |
|
|
| 59 | * replaced by an access instead (similar to the windows one, but |
|
|
| 60 | * that seems to be missing the prepend_dir processing |
|
|
| 61 | */ |
|
|
| 62 | int |
|
|
| 63 | check_path (const char *name, int prepend_dir) |
|
|
| 64 | { |
|
|
| 65 | char buf[MAX_BUF]; |
|
|
| 66 | |
|
|
| 67 | char *endbuf; |
|
|
| 68 | struct stat statbuf; |
|
|
| 69 | int mode = 0; |
|
|
| 70 | |
|
|
| 71 | if (prepend_dir) |
|
|
| 72 | assign (buf, create_pathname (name)); |
|
|
| 73 | else |
|
|
| 74 | assign (buf, name); |
|
|
| 75 | |
|
|
| 76 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
|
|
| 77 | * this method should be equivalant and is clearer. |
|
|
| 78 | * Can not use strcat because we need to cycle through |
|
|
| 79 | * all the names. |
|
|
| 80 | */ |
|
|
| 81 | endbuf = buf + strlen (buf); |
|
|
| 82 | |
|
|
| 83 | if (stat (buf, &statbuf)) |
|
|
| 84 | return -1; |
|
|
| 85 | if (!S_ISREG (statbuf.st_mode)) |
|
|
| 86 | return (-1); |
|
|
| 87 | |
|
|
| 88 | if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) || |
|
|
| 89 | ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH)) |
|
|
| 90 | mode |= 4; |
|
|
| 91 | |
|
|
| 92 | if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) || |
|
|
| 93 | (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH)) |
|
|
| 94 | mode |= 2; |
|
|
| 95 | |
|
|
| 96 | return (mode); |
|
|
| 97 | } |
|
|
| 98 | |
31 | |
| 99 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
32 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
| 100 | * one function that just returns a P_.. value (see map.h) |
33 | * one function that just returns a P_.. value (see map.h) |
| 101 | * it will also do map translation for tiled maps, returning |
34 | * it will also do map translation for tiled maps, returning |
| 102 | * new values into newmap, nx, and ny. Any and all of those |
35 | * new values into newmap, nx, and ny. Any and all of those |
| … | |
… | |
| 232 | } |
165 | } |
| 233 | return 0; |
166 | return 0; |
| 234 | } |
167 | } |
| 235 | |
168 | |
| 236 | /* |
169 | /* |
| 237 | * Returns true if the given object can't fit in the given spot. |
170 | * Returns qthe blocking object if the given object can't fit in the given |
| 238 | * This is meant for multi space objects - for single space objecs, |
171 | * spot. This is meant for multi space objects - for single space objecs, |
| 239 | * just calling get_map_blocked and checking that against movement type |
172 | * just calling get_map_blocked and checking that against movement type |
| 240 | * of object. This function goes through all the parts of the |
173 | * of object. This function goes through all the parts of the multipart |
| 241 | * multipart object and makes sure they can be inserted. |
174 | * object and makes sure they can be inserted. |
| 242 | * |
175 | * |
| 243 | * While this doesn't call out of map, the get_map_flags does. |
176 | * While this doesn't call out of map, the get_map_flags does. |
| 244 | * |
177 | * |
| 245 | * This function has been used to deprecate arch_out_of_map - |
178 | * This function has been used to deprecate arch_out_of_map - |
| 246 | * this function also does that check, and since in most cases, |
179 | * this function also does that check, and since in most cases, |
| … | |
… | |
| 257 | * |
190 | * |
| 258 | * Note this used to be arch_blocked, but with new movement |
191 | * Note this used to be arch_blocked, but with new movement |
| 259 | * code, we need to have actual object to check its move_type |
192 | * code, we need to have actual object to check its move_type |
| 260 | * against the move_block values. |
193 | * against the move_block values. |
| 261 | */ |
194 | */ |
| 262 | int |
195 | bool |
| 263 | ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) |
196 | object::blocked (maptile *m, int x, int y) const |
| 264 | { |
197 | { |
| 265 | archetype *tmp; |
198 | for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more) |
| 266 | int flag; |
|
|
| 267 | maptile *m1; |
|
|
| 268 | sint16 sx, sy; |
|
|
| 269 | |
|
|
| 270 | if (!ob) |
|
|
| 271 | { |
|
|
| 272 | flag = get_map_flags (m, &m1, x, y, &sx, &sy); |
|
|
| 273 | if (flag & P_OUT_OF_MAP) |
|
|
| 274 | return P_OUT_OF_MAP; |
|
|
| 275 | |
|
|
| 276 | /* don't have object, so don't know what types would block */ |
|
|
| 277 | return m1->at (sx, sy).move_block; |
|
|
| 278 | } |
199 | { |
|
|
200 | mapxy pos (m, x + tmp->x, y + tmp->y); |
| 279 | |
201 | |
| 280 | for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more) |
202 | if (!pos.normalise ()) |
| 281 | { |
203 | return 1; |
| 282 | flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy); |
|
|
| 283 | |
204 | |
| 284 | if (flag & P_OUT_OF_MAP) |
205 | mapspace &ms = *pos; |
| 285 | return P_OUT_OF_MAP; |
206 | |
| 286 | if (flag & P_IS_ALIVE) |
207 | if (ms.flags () & P_IS_ALIVE) |
| 287 | return P_IS_ALIVE; |
208 | return 1; |
| 288 | |
209 | |
| 289 | mapspace &ms = m1->at (sx, sy); |
210 | /* However, often ob doesn't have any move type |
| 290 | |
211 | * (signifying non-moving objects) |
| 291 | /* find_first_free_spot() calls this function. However, often |
|
|
| 292 | * ob doesn't have any move type (when used to place exits) |
|
|
| 293 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
212 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
| 294 | */ |
213 | */ |
| 295 | |
|
|
| 296 | if (ob->move_type == 0 && ms.move_block != MOVE_ALL) |
214 | if (!move_type && ms.move_block != MOVE_ALL) |
| 297 | continue; |
215 | continue; |
| 298 | |
216 | |
| 299 | /* Note it is intentional that we check ob - the movement type of the |
217 | /* Note it is intentional that we check ob - the movement type of the |
| 300 | * head of the object should correspond for the entire object. |
218 | * head of the object should correspond for the entire object. |
| 301 | */ |
219 | */ |
| 302 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
220 | if (ms.blocks (move_type)) |
| 303 | return P_NO_PASS; |
221 | return 1; |
| 304 | } |
222 | } |
| 305 | |
223 | |
| 306 | return 0; |
224 | return 0; |
| 307 | } |
225 | } |
| 308 | |
226 | |
| … | |
… | |
| 326 | |
244 | |
| 327 | insert_ob_in_ob (tmp, container); |
245 | insert_ob_in_ob (tmp, container); |
| 328 | tmp = next; |
246 | tmp = next; |
| 329 | } |
247 | } |
| 330 | |
248 | |
| 331 | /* sum_weight will go through and calculate what all the containers are |
249 | // go through and calculate what all the containers are carrying. |
| 332 | * carrying. |
250 | //TODO: remove |
| 333 | */ |
251 | container->update_weight (); |
| 334 | sum_weight (container); |
|
|
| 335 | } |
252 | } |
| 336 | |
253 | |
| 337 | void |
254 | void |
| 338 | maptile::set_object_flag (int flag, int value) |
255 | maptile::set_object_flag (int flag, int value) |
| 339 | { |
256 | { |
| … | |
… | |
| 341 | return; |
258 | return; |
| 342 | |
259 | |
| 343 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
260 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
| 344 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
261 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
| 345 | tmp->flag [flag] = value; |
262 | tmp->flag [flag] = value; |
|
|
263 | } |
|
|
264 | |
|
|
265 | void |
|
|
266 | maptile::post_load_original () |
|
|
267 | { |
|
|
268 | if (!spaces) |
|
|
269 | return; |
|
|
270 | |
|
|
271 | set_object_flag (FLAG_OBJ_ORIGINAL); |
|
|
272 | |
|
|
273 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
274 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
|
|
275 | INVOKE_OBJECT (RESET, tmp); |
| 346 | } |
276 | } |
| 347 | |
277 | |
| 348 | /* link_multipart_objects go through all the objects on the map looking |
278 | /* link_multipart_objects go through all the objects on the map looking |
| 349 | * for objects whose arch says they are multipart yet according to the |
279 | * for objects whose arch says they are multipart yet according to the |
| 350 | * info we have, they only have the head (as would be expected when |
280 | * info we have, they only have the head (as would be expected when |
| … | |
… | |
| 388 | bool |
318 | bool |
| 389 | maptile::_load_objects (object_thawer &f) |
319 | maptile::_load_objects (object_thawer &f) |
| 390 | { |
320 | { |
| 391 | for (;;) |
321 | for (;;) |
| 392 | { |
322 | { |
| 393 | coroapi::cede_to_tick_every (100); // cede once in a while |
323 | coroapi::cede_to_tick (); // cede once in a while |
| 394 | |
324 | |
| 395 | switch (f.kw) |
325 | switch (f.kw) |
| 396 | { |
326 | { |
| 397 | case KW_arch: |
327 | case KW_arch: |
| 398 | if (object *op = object::read (f, this)) |
328 | if (object *op = object::read (f, this)) |
| 399 | { |
329 | { |
|
|
330 | // TODO: why? |
| 400 | if (op->inv) |
331 | if (op->inv) |
| 401 | sum_weight (op); |
332 | op->update_weight (); |
| 402 | |
333 | |
| 403 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
334 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
|
|
335 | { |
|
|
336 | // we insert manually because |
|
|
337 | // a) its way faster |
|
|
338 | // b) we remove manually, too, and there are good reasons for that |
|
|
339 | // c) its correct |
|
|
340 | mapspace &ms = at (op->x, op->y); |
|
|
341 | |
|
|
342 | op->flag [FLAG_REMOVED] = false; |
|
|
343 | |
|
|
344 | op->above = 0; |
|
|
345 | op->below = ms.top; |
|
|
346 | |
|
|
347 | if (ms.top) |
|
|
348 | ms.top->above = op; |
|
|
349 | else |
|
|
350 | ms.bot = op; |
|
|
351 | |
|
|
352 | ms.top = op; |
|
|
353 | ms.flags_ = 0; |
|
|
354 | } |
|
|
355 | else |
|
|
356 | { |
|
|
357 | f.parse_warn (format ("object %s out of range", op->debug_desc ())); |
|
|
358 | op->destroy (); |
|
|
359 | } |
| 404 | } |
360 | } |
| 405 | |
361 | |
| 406 | continue; |
362 | continue; |
| 407 | |
363 | |
| 408 | case KW_EOF: |
364 | case KW_EOF: |
| … | |
… | |
| 421 | } |
377 | } |
| 422 | |
378 | |
| 423 | void |
379 | void |
| 424 | maptile::activate () |
380 | maptile::activate () |
| 425 | { |
381 | { |
| 426 | active = true; |
|
|
| 427 | |
|
|
| 428 | if (spaces) |
382 | if (spaces) |
| 429 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
383 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
| 430 | for (object *op = ms->bot; op; op = op->above) |
384 | for (object *op = ms->bot; op; op = op->above) |
| 431 | op->activate_recursive (); |
385 | op->activate_recursive (); |
| 432 | } |
386 | } |
| 433 | |
387 | |
| 434 | void |
388 | void |
| 435 | maptile::deactivate () |
389 | maptile::deactivate () |
| 436 | { |
390 | { |
| 437 | active = false; |
|
|
| 438 | |
|
|
| 439 | if (spaces) |
391 | if (spaces) |
| 440 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
392 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
| 441 | for (object *op = ms->bot; op; op = op->above) |
393 | for (object *op = ms->bot; op; op = op->above) |
| 442 | op->deactivate_recursive (); |
394 | op->deactivate_recursive (); |
| 443 | } |
395 | } |
| … | |
… | |
| 453 | if (!spaces) |
405 | if (!spaces) |
| 454 | return false; |
406 | return false; |
| 455 | |
407 | |
| 456 | for (int i = 0; i < size (); ++i) |
408 | for (int i = 0; i < size (); ++i) |
| 457 | { |
409 | { |
| 458 | int unique = 0; |
410 | bool unique = 0; |
|
|
411 | |
| 459 | for (object *op = spaces [i].bot; op; op = op->above) |
412 | for (object *op = spaces [i].bot; op; op = op->above) |
| 460 | { |
413 | { |
| 461 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
414 | unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]; |
| 462 | unique = 1; |
|
|
| 463 | |
415 | |
| 464 | if (!op->can_map_save ()) |
416 | if (expect_false (!op->can_map_save ())) |
| 465 | continue; |
417 | continue; |
| 466 | |
418 | |
| 467 | if (unique || op->flag [FLAG_UNIQUE]) |
419 | if (expect_false (unique || op->flag [FLAG_UNIQUE])) |
| 468 | { |
420 | { |
| 469 | if (flags & IO_UNIQUES) |
421 | if (flags & IO_UNIQUES) |
| 470 | op->write (f); |
422 | op->write (f); |
| 471 | } |
423 | } |
| 472 | else if (flags & IO_OBJECTS) |
424 | else if (expect_true (flags & IO_OBJECTS)) |
| 473 | op->write (f); |
425 | op->write (f); |
| 474 | } |
426 | } |
| 475 | } |
427 | } |
| 476 | |
428 | |
| 477 | coroapi::cede_to_tick (); |
429 | coroapi::cede_to_tick (); |
| 478 | |
430 | |
| 479 | return true; |
431 | return true; |
| 480 | } |
|
|
| 481 | |
|
|
| 482 | bool |
|
|
| 483 | maptile::_load_objects (const char *path, bool skip_header) |
|
|
| 484 | { |
|
|
| 485 | object_thawer f (path); |
|
|
| 486 | |
|
|
| 487 | if (!f) |
|
|
| 488 | return false; |
|
|
| 489 | |
|
|
| 490 | f.next (); |
|
|
| 491 | |
|
|
| 492 | if (skip_header) |
|
|
| 493 | for (;;) |
|
|
| 494 | { |
|
|
| 495 | keyword kw = f.kw; |
|
|
| 496 | f.skip (); |
|
|
| 497 | if (kw == KW_end) |
|
|
| 498 | break; |
|
|
| 499 | } |
|
|
| 500 | |
|
|
| 501 | return _load_objects (f); |
|
|
| 502 | } |
432 | } |
| 503 | |
433 | |
| 504 | bool |
434 | bool |
| 505 | maptile::_save_objects (const char *path, int flags) |
435 | maptile::_save_objects (const char *path, int flags) |
| 506 | { |
436 | { |
| … | |
… | |
| 681 | bool |
611 | bool |
| 682 | maptile::_load_header (object_thawer &thawer) |
612 | maptile::_load_header (object_thawer &thawer) |
| 683 | { |
613 | { |
| 684 | for (;;) |
614 | for (;;) |
| 685 | { |
615 | { |
| 686 | thawer.next (); |
|
|
| 687 | |
|
|
| 688 | switch (thawer.kw) |
616 | switch (thawer.kw) |
| 689 | { |
617 | { |
| 690 | case KW_msg: |
618 | case KW_msg: |
| 691 | thawer.get_ml (KW_endmsg, msg); |
619 | thawer.get_ml (KW_endmsg, msg); |
| 692 | break; |
620 | break; |
| … | |
… | |
| 726 | case KW_sky: thawer.get (sky); break; |
654 | case KW_sky: thawer.get (sky); break; |
| 727 | |
655 | |
| 728 | case KW_per_player: thawer.get (per_player); break; |
656 | case KW_per_player: thawer.get (per_player); break; |
| 729 | case KW_per_party: thawer.get (per_party); break; |
657 | case KW_per_party: thawer.get (per_party); break; |
| 730 | case KW_no_reset: thawer.get (no_reset); break; |
658 | case KW_no_reset: thawer.get (no_reset); break; |
|
|
659 | case KW_no_drop: thawer.get (no_drop); break; |
| 731 | |
660 | |
| 732 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
661 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
| 733 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
662 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
| 734 | |
663 | |
| 735 | // old names new names |
664 | // old names new names |
| … | |
… | |
| 747 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
676 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
| 748 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
677 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
| 749 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
678 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
| 750 | |
679 | |
| 751 | case KW_ERROR: |
680 | case KW_ERROR: |
| 752 | set_key (thawer.kw_str, thawer.value); |
681 | set_key_text (thawer.kw_str, thawer.value); |
| 753 | break; |
682 | break; |
| 754 | |
683 | |
| 755 | case KW_end: |
684 | case KW_end: |
|
|
685 | thawer.next (); |
| 756 | return true; |
686 | return true; |
| 757 | |
687 | |
| 758 | default: |
688 | default: |
| 759 | if (!thawer.parse_error ("map", 0)) |
689 | if (!thawer.parse_error ("map", 0)) |
| 760 | return false; |
690 | return false; |
| 761 | break; |
691 | break; |
| 762 | } |
692 | } |
|
|
693 | |
|
|
694 | thawer.next (); |
| 763 | } |
695 | } |
| 764 | |
696 | |
| 765 | abort (); |
697 | abort (); |
| 766 | } |
|
|
| 767 | |
|
|
| 768 | bool |
|
|
| 769 | maptile::_load_header (const char *path) |
|
|
| 770 | { |
|
|
| 771 | object_thawer thawer (path); |
|
|
| 772 | |
|
|
| 773 | if (!thawer) |
|
|
| 774 | return false; |
|
|
| 775 | |
|
|
| 776 | return _load_header (thawer); |
|
|
| 777 | } |
698 | } |
| 778 | |
699 | |
| 779 | /****************************************************************************** |
700 | /****************************************************************************** |
| 780 | * This is the start of unique map handling code |
701 | * This is the start of unique map handling code |
| 781 | *****************************************************************************/ |
702 | *****************************************************************************/ |
| … | |
… | |
| 793 | |
714 | |
| 794 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
715 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
| 795 | unique = 1; |
716 | unique = 1; |
| 796 | |
717 | |
| 797 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
718 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
| 798 | { |
|
|
| 799 | op->destroy_inv (false); |
|
|
| 800 | op->destroy (); |
719 | op->destroy (); |
| 801 | } |
|
|
| 802 | |
720 | |
| 803 | op = above; |
721 | op = above; |
| 804 | } |
722 | } |
| 805 | } |
723 | } |
| 806 | } |
724 | } |
| … | |
… | |
| 817 | MAP_OUT (swap_time); |
735 | MAP_OUT (swap_time); |
| 818 | MAP_OUT (reset_time); |
736 | MAP_OUT (reset_time); |
| 819 | MAP_OUT (reset_timeout); |
737 | MAP_OUT (reset_timeout); |
| 820 | MAP_OUT (fixed_resettime); |
738 | MAP_OUT (fixed_resettime); |
| 821 | MAP_OUT (no_reset); |
739 | MAP_OUT (no_reset); |
|
|
740 | MAP_OUT (no_drop); |
| 822 | MAP_OUT (difficulty); |
741 | MAP_OUT (difficulty); |
| 823 | |
742 | |
| 824 | if (default_region) MAP_OUT2 (region, default_region->name); |
743 | if (default_region) MAP_OUT2 (region, default_region->name); |
| 825 | |
744 | |
| 826 | if (shopitems) |
745 | if (shopitems) |
| … | |
… | |
| 880 | * Remove and free all objects in the given map. |
799 | * Remove and free all objects in the given map. |
| 881 | */ |
800 | */ |
| 882 | void |
801 | void |
| 883 | maptile::clear () |
802 | maptile::clear () |
| 884 | { |
803 | { |
| 885 | sfree (regions, size ()), regions = 0; |
|
|
| 886 | free (regionmap), regionmap = 0; |
|
|
| 887 | |
|
|
| 888 | if (spaces) |
804 | if (spaces) |
| 889 | { |
805 | { |
| 890 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
806 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
| 891 | while (object *op = ms->bot) |
807 | while (object *op = ms->bot) |
| 892 | { |
808 | { |
|
|
809 | // manually remove, as to not trigger anything |
|
|
810 | if (ms->bot = op->above) |
|
|
811 | ms->bot->below = 0; |
|
|
812 | |
|
|
813 | op->flag [FLAG_REMOVED] = true; |
|
|
814 | |
| 893 | op = op->head_ (); |
815 | object *head = op->head_ (); |
| 894 | op->destroy_inv (false); |
816 | if (op == head) |
| 895 | op->destroy (); |
817 | op->destroy (); |
|
|
818 | else if (head->map != op->map) |
|
|
819 | { |
|
|
820 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
|
|
821 | head->destroy (); |
|
|
822 | } |
| 896 | } |
823 | } |
| 897 | |
824 | |
| 898 | sfree (spaces, size ()), spaces = 0; |
825 | sfree0 (spaces, size ()); |
| 899 | } |
826 | } |
| 900 | |
827 | |
| 901 | if (buttons) |
828 | if (buttons) |
| 902 | free_objectlinkpt (buttons), buttons = 0; |
829 | free_objectlinkpt (buttons), buttons = 0; |
|
|
830 | |
|
|
831 | sfree0 (regions, size ()); |
|
|
832 | delete [] regionmap; regionmap = 0; |
| 903 | } |
833 | } |
| 904 | |
834 | |
| 905 | void |
835 | void |
| 906 | maptile::clear_header () |
836 | maptile::clear_header () |
| 907 | { |
837 | { |
| … | |
… | |
| 959 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
889 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
| 960 | break; |
890 | break; |
| 961 | |
891 | |
| 962 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
892 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
| 963 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
893 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
| 964 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
|
|
| 965 | || QUERY_FLAG (op, FLAG_UNIQUE) |
894 | || QUERY_FLAG (op, FLAG_UNIQUE) |
| 966 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
895 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
| 967 | || QUERY_FLAG (op, FLAG_UNPAID) |
896 | || QUERY_FLAG (op, FLAG_UNPAID) |
| 968 | || op->is_alive ()) |
897 | || op->is_alive ()) |
| 969 | ; // do not decay |
898 | ; // do not decay |
| … | |
… | |
| 1008 | op->destroy (); |
937 | op->destroy (); |
| 1009 | } |
938 | } |
| 1010 | } |
939 | } |
| 1011 | |
940 | |
| 1012 | /* |
941 | /* |
| 1013 | * Updates every button on the map (by calling update_button() for them). |
|
|
| 1014 | */ |
|
|
| 1015 | void |
|
|
| 1016 | maptile::update_buttons () |
|
|
| 1017 | { |
|
|
| 1018 | for (oblinkpt *obp = buttons; obp; obp = obp->next) |
|
|
| 1019 | for (objectlink *ol = obp->link; ol; ol = ol->next) |
|
|
| 1020 | { |
|
|
| 1021 | if (!ol->ob) |
|
|
| 1022 | { |
|
|
| 1023 | LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", |
|
|
| 1024 | ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); |
|
|
| 1025 | continue; |
|
|
| 1026 | } |
|
|
| 1027 | |
|
|
| 1028 | if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL) |
|
|
| 1029 | { |
|
|
| 1030 | update_button (ol->ob); |
|
|
| 1031 | break; |
|
|
| 1032 | } |
|
|
| 1033 | } |
|
|
| 1034 | } |
|
|
| 1035 | |
|
|
| 1036 | /* |
|
|
| 1037 | * This routine is supposed to find out the difficulty of the map. |
942 | * This routine is supposed to find out the difficulty of the map. |
| 1038 | * difficulty does not have a lot to do with character level, |
943 | * difficulty does not have a lot to do with character level, |
| 1039 | * but does have a lot to do with treasure on the map. |
944 | * but does have a lot to do with treasure on the map. |
| 1040 | * |
945 | * |
| 1041 | * Difficulty can now be set by the map creature. If the value stored |
946 | * Difficulty can now be set by the map creator. If the value stored |
| 1042 | * in the map is zero, then use this routine. Maps should really |
947 | * in the map is zero, then use this routine. Maps should really |
| 1043 | * have a difficulty set than using this function - human calculation |
948 | * have a difficulty set rather than using this function - human calculation |
| 1044 | * is much better than this functions guesswork. |
949 | * is much better than this function's guesswork. |
| 1045 | */ |
950 | */ |
| 1046 | int |
951 | int |
| 1047 | maptile::estimate_difficulty () const |
952 | maptile::estimate_difficulty () const |
| 1048 | { |
953 | { |
| 1049 | long monster_cnt = 0; |
954 | long monster_cnt = 0; |
| … | |
… | |
| 1061 | |
966 | |
| 1062 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
967 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
| 1063 | { |
968 | { |
| 1064 | total_exp += op->stats.exp; |
969 | total_exp += op->stats.exp; |
| 1065 | |
970 | |
| 1066 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
971 | if (archetype *at = op->other_arch) |
|
|
972 | { |
| 1067 | total_exp += at->stats.exp * 8; |
973 | total_exp += at->stats.exp * 8; |
| 1068 | |
|
|
| 1069 | monster_cnt++; |
974 | monster_cnt++; |
|
|
975 | } |
|
|
976 | |
|
|
977 | for (object *inv = op->inv; inv; inv = inv->below) |
|
|
978 | { |
|
|
979 | total_exp += op->stats.exp * 8; |
|
|
980 | monster_cnt++; |
|
|
981 | } |
| 1070 | } |
982 | } |
| 1071 | } |
983 | } |
| 1072 | |
984 | |
| 1073 | avgexp = (double) total_exp / monster_cnt; |
985 | avgexp = (double) total_exp / monster_cnt; |
| 1074 | |
986 | |
| … | |
… | |
| 1087 | * postive values make it darker, negative make it brighter |
999 | * postive values make it darker, negative make it brighter |
| 1088 | */ |
1000 | */ |
| 1089 | int |
1001 | int |
| 1090 | maptile::change_map_light (int change) |
1002 | maptile::change_map_light (int change) |
| 1091 | { |
1003 | { |
| 1092 | int new_level = darkness + change; |
|
|
| 1093 | |
|
|
| 1094 | /* Nothing to do */ |
1004 | /* Nothing to do */ |
| 1095 | if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) |
1005 | if (!change) |
| 1096 | return 0; |
1006 | return 0; |
| 1097 | |
1007 | |
| 1098 | /* inform all players on the map */ |
1008 | /* inform all players on the map */ |
| 1099 | if (change > 0) |
1009 | if (change > 0) |
| 1100 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1010 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
| 1101 | else |
1011 | else |
| 1102 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1012 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
| 1103 | |
1013 | |
| 1104 | /* Do extra checking. since darkness is a unsigned value, |
1014 | darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS); |
| 1105 | * we need to be extra careful about negative values. |
|
|
| 1106 | * In general, the checks below are only needed if change |
|
|
| 1107 | * is not +/-1 |
|
|
| 1108 | */ |
|
|
| 1109 | if (new_level < 0) |
|
|
| 1110 | darkness = 0; |
|
|
| 1111 | else if (new_level >= MAX_DARKNESS) |
|
|
| 1112 | darkness = MAX_DARKNESS; |
|
|
| 1113 | else |
|
|
| 1114 | darkness = new_level; |
|
|
| 1115 | |
1015 | |
| 1116 | /* All clients need to get re-updated for the change */ |
1016 | /* All clients need to get re-updated for the change */ |
| 1117 | update_all_map_los (this); |
1017 | update_all_map_los (this); |
|
|
1018 | |
| 1118 | return 1; |
1019 | return 1; |
| 1119 | } |
1020 | } |
| 1120 | |
1021 | |
| 1121 | /* |
1022 | /* |
| 1122 | * This function updates various attributes about a specific space |
1023 | * This function updates various attributes about a specific space |
| … | |
… | |
| 1125 | * through, etc) |
1026 | * through, etc) |
| 1126 | */ |
1027 | */ |
| 1127 | void |
1028 | void |
| 1128 | mapspace::update_ () |
1029 | mapspace::update_ () |
| 1129 | { |
1030 | { |
| 1130 | object *tmp, *last = 0; |
1031 | object *last = 0; |
| 1131 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1032 | uint8 flags = P_UPTODATE, anywhere = 0; |
|
|
1033 | sint8 light = 0; |
| 1132 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1034 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
| 1133 | |
1035 | |
| 1134 | //object *middle = 0; |
1036 | //object *middle = 0; |
| 1135 | //object *top = 0; |
1037 | //object *top = 0; |
| 1136 | //object *floor = 0; |
1038 | //object *floor = 0; |
| 1137 | // this seems to generate better code than using locals, above |
1039 | // this seems to generate better code than using locals, above |
| 1138 | object *&top = faces_obj[0] = 0; |
1040 | object *&top = faces_obj[0] = 0; |
| 1139 | object *&middle = faces_obj[1] = 0; |
1041 | object *&middle = faces_obj[1] = 0; |
| 1140 | object *&floor = faces_obj[2] = 0; |
1042 | object *&floor = faces_obj[2] = 0; |
| 1141 | |
1043 | |
| 1142 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1044 | for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) |
| 1143 | { |
1045 | { |
| 1144 | /* This could be made additive I guess (two lights better than |
1046 | // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C) |
| 1145 | * one). But if so, it shouldn't be a simple additive - 2 |
|
|
| 1146 | * light bulbs do not illuminate twice as far as once since |
|
|
| 1147 | * it is a dissapation factor that is cubed. |
|
|
| 1148 | */ |
|
|
| 1149 | if (tmp->glow_radius > light) |
|
|
| 1150 | light = tmp->glow_radius; |
1047 | light += tmp->glow_radius; |
| 1151 | |
1048 | |
| 1152 | /* This call is needed in order to update objects the player |
1049 | /* This call is needed in order to update objects the player |
| 1153 | * is standing in that have animations (ie, grass, fire, etc). |
1050 | * is standing in that have animations (ie, grass, fire, etc). |
| 1154 | * However, it also causes the look window to be re-drawn |
1051 | * However, it also causes the look window to be re-drawn |
| 1155 | * 3 times each time the player moves, because many of the |
1052 | * 3 times each time the player moves, because many of the |
| … | |
… | |
| 1174 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
1071 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
| 1175 | { |
1072 | { |
| 1176 | middle = tmp; |
1073 | middle = tmp; |
| 1177 | anywhere = 1; |
1074 | anywhere = 1; |
| 1178 | } |
1075 | } |
|
|
1076 | |
| 1179 | /* Find the highest visible face around. If equal |
1077 | /* Find the highest visible face around. If equal |
| 1180 | * visibilities, we still want the one nearer to the |
1078 | * visibilities, we still want the one nearer to the |
| 1181 | * top |
1079 | * top |
| 1182 | */ |
1080 | */ |
| 1183 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) |
1081 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) |
| … | |
… | |
| 1202 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1100 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
| 1203 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
1101 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
| 1204 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
1102 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
| 1205 | } |
1103 | } |
| 1206 | |
1104 | |
| 1207 | this->light = light; |
1105 | this->light = min (light, MAX_LIGHT_RADIUS); |
| 1208 | this->flags_ = flags; |
1106 | this->flags_ = flags; |
| 1209 | this->move_block = move_block & ~move_allow; |
1107 | this->move_block = move_block & ~move_allow; |
| 1210 | this->move_on = move_on; |
1108 | this->move_on = move_on; |
| 1211 | this->move_off = move_off; |
1109 | this->move_off = move_off; |
| 1212 | this->move_slow = move_slow; |
1110 | this->move_slow = move_slow; |
| … | |
… | |
| 1232 | * 1) top face is set, need middle to be set. |
1130 | * 1) top face is set, need middle to be set. |
| 1233 | * 2) middle is set, need to set top. |
1131 | * 2) middle is set, need to set top. |
| 1234 | * 3) neither middle or top is set - need to set both. |
1132 | * 3) neither middle or top is set - need to set both. |
| 1235 | */ |
1133 | */ |
| 1236 | |
1134 | |
| 1237 | for (tmp = last; tmp; tmp = tmp->below) |
1135 | for (object *tmp = last; tmp; tmp = tmp->below) |
| 1238 | { |
1136 | { |
| 1239 | /* Once we get to a floor, stop, since we already have a floor object */ |
1137 | /* Once we get to a floor, stop, since we already have a floor object */ |
| 1240 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1138 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
| 1241 | break; |
1139 | break; |
| 1242 | |
1140 | |
| … | |
… | |
| 1294 | vol += op->volume (); |
1192 | vol += op->volume (); |
| 1295 | |
1193 | |
| 1296 | return vol; |
1194 | return vol; |
| 1297 | } |
1195 | } |
| 1298 | |
1196 | |
| 1299 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1197 | maptile * |
| 1300 | * the map. It also takes care of linking back the freshly found |
1198 | maptile::tile_available (int dir, bool load) |
| 1301 | * maps tile_map values if it tiles back to this one. It returns |
|
|
| 1302 | * the value of orig_map->tile_map[tile_num]. |
|
|
| 1303 | */ |
|
|
| 1304 | static inline maptile * |
|
|
| 1305 | find_and_link (maptile *orig_map, int tile_num) |
|
|
| 1306 | { |
1199 | { |
| 1307 | maptile *mp = orig_map->tile_map [tile_num]; |
1200 | if (tile_path[dir]) |
| 1308 | |
|
|
| 1309 | if (!mp) |
|
|
| 1310 | { |
|
|
| 1311 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
|
|
| 1312 | |
|
|
| 1313 | if (!mp) |
|
|
| 1314 | { |
|
|
| 1315 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
|
|
| 1316 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
|
|
| 1317 | &orig_map->tile_path[tile_num], &orig_map->path); |
|
|
| 1318 | mp = new maptile (1, 1); |
|
|
| 1319 | mp->alloc (); |
|
|
| 1320 | mp->in_memory = MAP_IN_MEMORY; |
|
|
| 1321 | } |
|
|
| 1322 | } |
1201 | { |
|
|
1202 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
|
|
1203 | return tile_map[dir]; |
| 1323 | |
1204 | |
| 1324 | int dest_tile = (tile_num + 2) % 4; |
1205 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
|
|
1206 | return tile_map[dir]; |
|
|
1207 | } |
| 1325 | |
1208 | |
| 1326 | orig_map->tile_map [tile_num] = mp; |
|
|
| 1327 | |
|
|
| 1328 | // optimisation: back-link map to origin map if euclidean |
|
|
| 1329 | //TODO: non-euclidean maps MUST GO |
|
|
| 1330 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
|
|
| 1331 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
|
|
| 1332 | |
|
|
| 1333 | return mp; |
1209 | return 0; |
| 1334 | } |
|
|
| 1335 | |
|
|
| 1336 | static inline void |
|
|
| 1337 | load_and_link (maptile *orig_map, int tile_num) |
|
|
| 1338 | { |
|
|
| 1339 | find_and_link (orig_map, tile_num)->load_sync (); |
|
|
| 1340 | } |
1210 | } |
| 1341 | |
1211 | |
| 1342 | /* this returns TRUE if the coordinates (x,y) are out of |
1212 | /* this returns TRUE if the coordinates (x,y) are out of |
| 1343 | * map m. This function also takes into account any |
1213 | * map m. This function also takes into account any |
| 1344 | * tiling considerations, loading adjacant maps as needed. |
1214 | * tiling considerations, loading adjacant maps as needed. |
| … | |
… | |
| 1357 | if (!m) |
1227 | if (!m) |
| 1358 | return 0; |
1228 | return 0; |
| 1359 | |
1229 | |
| 1360 | if (x < 0) |
1230 | if (x < 0) |
| 1361 | { |
1231 | { |
| 1362 | if (!m->tile_path[3]) |
1232 | if (!m->tile_available (3)) |
| 1363 | return 1; |
1233 | return 1; |
| 1364 | |
1234 | |
| 1365 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
|
|
| 1366 | find_and_link (m, 3); |
|
|
| 1367 | |
|
|
| 1368 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1235 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
| 1369 | } |
1236 | } |
| 1370 | |
1237 | |
| 1371 | if (x >= m->width) |
1238 | if (x >= m->width) |
| 1372 | { |
1239 | { |
| 1373 | if (!m->tile_path[1]) |
1240 | if (!m->tile_available (1)) |
| 1374 | return 1; |
1241 | return 1; |
| 1375 | |
1242 | |
| 1376 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
|
|
| 1377 | find_and_link (m, 1); |
|
|
| 1378 | |
|
|
| 1379 | return out_of_map (m->tile_map[1], x - m->width, y); |
1243 | return out_of_map (m->tile_map[1], x - m->width, y); |
| 1380 | } |
1244 | } |
| 1381 | |
1245 | |
| 1382 | if (y < 0) |
1246 | if (y < 0) |
| 1383 | { |
1247 | { |
| 1384 | if (!m->tile_path[0]) |
1248 | if (!m->tile_available (0)) |
| 1385 | return 1; |
1249 | return 1; |
| 1386 | |
1250 | |
| 1387 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
|
|
| 1388 | find_and_link (m, 0); |
|
|
| 1389 | |
|
|
| 1390 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1251 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
| 1391 | } |
1252 | } |
| 1392 | |
1253 | |
| 1393 | if (y >= m->height) |
1254 | if (y >= m->height) |
| 1394 | { |
1255 | { |
| 1395 | if (!m->tile_path[2]) |
1256 | if (!m->tile_available (2)) |
| 1396 | return 1; |
1257 | return 1; |
| 1397 | |
|
|
| 1398 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
|
|
| 1399 | find_and_link (m, 2); |
|
|
| 1400 | |
1258 | |
| 1401 | return out_of_map (m->tile_map[2], x, y - m->height); |
1259 | return out_of_map (m->tile_map[2], x, y - m->height); |
| 1402 | } |
1260 | } |
| 1403 | |
1261 | |
| 1404 | /* Simple case - coordinates are within this local |
1262 | /* Simple case - coordinates are within this local |
| … | |
… | |
| 1418 | maptile * |
1276 | maptile * |
| 1419 | maptile::xy_find (sint16 &x, sint16 &y) |
1277 | maptile::xy_find (sint16 &x, sint16 &y) |
| 1420 | { |
1278 | { |
| 1421 | if (x < 0) |
1279 | if (x < 0) |
| 1422 | { |
1280 | { |
| 1423 | if (!tile_path[3]) |
1281 | if (!tile_available (3)) |
| 1424 | return 0; |
1282 | return 0; |
| 1425 | |
1283 | |
| 1426 | find_and_link (this, 3); |
|
|
| 1427 | x += tile_map[3]->width; |
1284 | x += tile_map[3]->width; |
| 1428 | return tile_map[3]->xy_find (x, y); |
1285 | return tile_map[3]->xy_find (x, y); |
| 1429 | } |
1286 | } |
| 1430 | |
1287 | |
| 1431 | if (x >= width) |
1288 | if (x >= width) |
| 1432 | { |
1289 | { |
| 1433 | if (!tile_path[1]) |
1290 | if (!tile_available (1)) |
| 1434 | return 0; |
1291 | return 0; |
| 1435 | |
1292 | |
| 1436 | find_and_link (this, 1); |
|
|
| 1437 | x -= width; |
1293 | x -= width; |
| 1438 | return tile_map[1]->xy_find (x, y); |
1294 | return tile_map[1]->xy_find (x, y); |
| 1439 | } |
1295 | } |
| 1440 | |
1296 | |
| 1441 | if (y < 0) |
1297 | if (y < 0) |
| 1442 | { |
1298 | { |
| 1443 | if (!tile_path[0]) |
1299 | if (!tile_available (0)) |
| 1444 | return 0; |
1300 | return 0; |
| 1445 | |
1301 | |
| 1446 | find_and_link (this, 0); |
|
|
| 1447 | y += tile_map[0]->height; |
1302 | y += tile_map[0]->height; |
| 1448 | return tile_map[0]->xy_find (x, y); |
1303 | return tile_map[0]->xy_find (x, y); |
| 1449 | } |
1304 | } |
| 1450 | |
1305 | |
| 1451 | if (y >= height) |
1306 | if (y >= height) |
| 1452 | { |
1307 | { |
| 1453 | if (!tile_path[2]) |
1308 | if (!tile_available (2)) |
| 1454 | return 0; |
1309 | return 0; |
| 1455 | |
1310 | |
| 1456 | find_and_link (this, 2); |
|
|
| 1457 | y -= height; |
1311 | y -= height; |
| 1458 | return tile_map[2]->xy_find (x, y); |
1312 | return tile_map[2]->xy_find (x, y); |
| 1459 | } |
1313 | } |
| 1460 | |
1314 | |
| 1461 | /* Simple case - coordinates are within this local |
1315 | /* Simple case - coordinates are within this local |
| … | |
… | |
| 1472 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1326 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
| 1473 | { |
1327 | { |
| 1474 | if (!map1 || !map2) |
1328 | if (!map1 || !map2) |
| 1475 | return 0; |
1329 | return 0; |
| 1476 | |
1330 | |
| 1477 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
1331 | //TODO: this doesn't actually check correctly when intermediate maps are not loaded |
| 1478 | //fix: compare paths instead (this is likely faster, too!) |
1332 | //fix: compare paths instead (this is likely faster, too!) |
| 1479 | if (map1 == map2) |
1333 | if (map1 == map2) |
| 1480 | { |
1334 | { |
| 1481 | *dx = 0; |
1335 | *dx = 0; |
| 1482 | *dy = 0; |
1336 | *dy = 0; |
| … | |
… | |
| 1689 | } |
1543 | } |
| 1690 | |
1544 | |
| 1691 | object * |
1545 | object * |
| 1692 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1546 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
| 1693 | { |
1547 | { |
| 1694 | if (!op->flag [FLAG_REMOVED]) |
|
|
| 1695 | op->remove (); |
|
|
| 1696 | |
|
|
| 1697 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1548 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
| 1698 | } |
1549 | } |
| 1699 | |
1550 | |
| 1700 | region * |
1551 | region * |
| 1701 | maptile::region (int x, int y) const |
1552 | maptile::region (int x, int y) const |
| … | |
… | |
| 1711 | |
1562 | |
| 1712 | return ::region::default_region (); |
1563 | return ::region::default_region (); |
| 1713 | } |
1564 | } |
| 1714 | |
1565 | |
| 1715 | /* picks a random object from a style map. |
1566 | /* picks a random object from a style map. |
| 1716 | * Redone by MSW so it should be faster and not use static |
|
|
| 1717 | * variables to generate tables. |
|
|
| 1718 | */ |
1567 | */ |
| 1719 | object * |
1568 | object * |
| 1720 | maptile::pick_random_object () const |
1569 | maptile::pick_random_object (rand_gen &gen) const |
| 1721 | { |
1570 | { |
| 1722 | /* while returning a null object will result in a crash, that |
1571 | /* while returning a null object will result in a crash, that |
| 1723 | * is actually preferable to an infinite loop. That is because |
1572 | * is actually preferable to an infinite loop. That is because |
| 1724 | * most servers will automatically restart in case of crash. |
1573 | * most servers will automatically restart in case of crash. |
| 1725 | * Change the logic on getting the random space - shouldn't make |
1574 | * Change the logic on getting the random space - shouldn't make |
| 1726 | * any difference, but this seems clearer to me. |
1575 | * any difference, but this seems clearer to me. |
| 1727 | */ |
1576 | */ |
| 1728 | for (int i = 1000; --i;) |
1577 | for (int i = 1000; --i;) |
| 1729 | { |
1578 | { |
| 1730 | object *pick = at (rndm (width), rndm (height)).bot; |
1579 | object *pick = at (gen (width), gen (height)).bot; |
| 1731 | |
1580 | |
| 1732 | // do not prefer big monsters just because they are big. |
1581 | // do not prefer big monsters just because they are big. |
| 1733 | if (pick && pick->head_ () == pick) |
1582 | if (pick && pick->is_head ()) |
| 1734 | return pick->head_ (); |
1583 | return pick->head_ (); |
| 1735 | } |
1584 | } |
| 1736 | |
1585 | |
| 1737 | // instead of crashing in the unlikely(?) case, try to return *something* |
1586 | // instead of crashing in the unlikely(?) case, try to return *something* |
| 1738 | return get_archetype ("blocked"); |
1587 | return archetype::find ("bug"); |
| 1739 | } |
1588 | } |
| 1740 | |
1589 | |
|
|
1590 | void |
|
|
1591 | maptile::play_sound (faceidx sound, int x, int y) const |
|
|
1592 | { |
|
|
1593 | if (!sound) |
|
|
1594 | return; |
|
|
1595 | |
|
|
1596 | for_all_players_on_map (pl, this) |
|
|
1597 | if (client *ns = pl->ns) |
|
|
1598 | { |
|
|
1599 | int dx = x - pl->ob->x; |
|
|
1600 | int dy = y - pl->ob->y; |
|
|
1601 | |
|
|
1602 | int distance = idistance (dx, dy); |
|
|
1603 | |
|
|
1604 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1605 | ns->play_sound (sound, dx, dy); |
|
|
1606 | } |
|
|
1607 | } |
|
|
1608 | |
|
|
1609 | static void |
|
|
1610 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
|
|
1611 | { |
|
|
1612 | // clip to map to the left |
|
|
1613 | if (x0 < 0) |
|
|
1614 | { |
|
|
1615 | if (maptile *tile = m->tile_available (TILE_LEFT, 1)) |
|
|
1616 | split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy); |
|
|
1617 | |
|
|
1618 | if (x1 < 0) // entirely to the left |
|
|
1619 | return; |
|
|
1620 | |
|
|
1621 | x0 = 0; |
|
|
1622 | } |
|
|
1623 | |
|
|
1624 | // clip to map to the right |
|
|
1625 | if (x1 > m->width) |
|
|
1626 | { |
|
|
1627 | if (maptile *tile = m->tile_available (TILE_RIGHT, 1)) |
|
|
1628 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
|
|
1629 | |
|
|
1630 | if (x0 > m->width) // entirely to the right |
|
|
1631 | return; |
|
|
1632 | |
|
|
1633 | x1 = m->width; |
|
|
1634 | } |
|
|
1635 | |
|
|
1636 | // clip to map above |
|
|
1637 | if (y0 < 0) |
|
|
1638 | { |
|
|
1639 | if (maptile *tile = m->tile_available (TILE_UP, 1)) |
|
|
1640 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
|
|
1641 | |
|
|
1642 | if (y1 < 0) // entirely above |
|
|
1643 | return; |
|
|
1644 | |
|
|
1645 | y0 = 0; |
|
|
1646 | } |
|
|
1647 | |
|
|
1648 | // clip to map below |
|
|
1649 | if (y1 > m->height) |
|
|
1650 | { |
|
|
1651 | if (maptile *tile = m->tile_available (TILE_DOWN, 1)) |
|
|
1652 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
|
|
1653 | |
|
|
1654 | if (y0 > m->height) // entirely below |
|
|
1655 | return; |
|
|
1656 | |
|
|
1657 | y1 = m->height; |
|
|
1658 | } |
|
|
1659 | |
|
|
1660 | // if we get here, the rect is within the current map |
|
|
1661 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1662 | |
|
|
1663 | r->m = m; |
|
|
1664 | r->x0 = x0; |
|
|
1665 | r->y0 = y0; |
|
|
1666 | r->x1 = x1; |
|
|
1667 | r->y1 = y1; |
|
|
1668 | r->dx = dx; |
|
|
1669 | r->dy = dy; |
|
|
1670 | } |
|
|
1671 | |
|
|
1672 | maprect * |
|
|
1673 | maptile::split_to_tiles (int x0, int y0, int x1, int y1) |
|
|
1674 | { |
|
|
1675 | static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8); |
|
|
1676 | buf.clear (); |
|
|
1677 | |
|
|
1678 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
|
|
1679 | |
|
|
1680 | // add end marker |
|
|
1681 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1682 | r->m = 0; |
|
|
1683 | |
|
|
1684 | return (maprect *)buf.linearise (); |
|
|
1685 | } |
|
|
1686 | |
