| 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 | |
27 | |
| 29 | #include "loader.h" |
28 | #include "loader.h" |
| 30 | |
29 | |
| 31 | #include "path.h" |
30 | #include "path.h" |
| 32 | |
|
|
| 33 | /* |
|
|
| 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 | { |
| … | |
… | |
| 388 | bool |
305 | bool |
| 389 | maptile::_load_objects (object_thawer &f) |
306 | maptile::_load_objects (object_thawer &f) |
| 390 | { |
307 | { |
| 391 | for (;;) |
308 | for (;;) |
| 392 | { |
309 | { |
| 393 | coroapi::cede_to_tick_every (100); // cede once in a while |
310 | coroapi::cede_to_tick (); // cede once in a while |
| 394 | |
311 | |
| 395 | switch (f.kw) |
312 | switch (f.kw) |
| 396 | { |
313 | { |
| 397 | case KW_arch: |
314 | case KW_arch: |
| 398 | if (object *op = object::read (f, this)) |
315 | if (object *op = object::read (f, this)) |
| 399 | { |
316 | { |
|
|
317 | // TODO: why? |
| 400 | if (op->inv) |
318 | if (op->inv) |
| 401 | sum_weight (op); |
319 | op->update_weight (); |
| 402 | |
320 | |
| 403 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
321 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
|
|
322 | { |
|
|
323 | // we insert manually because |
|
|
324 | // a) its way faster |
|
|
325 | // b) we remove manually, too, and there are good reasons for that |
|
|
326 | // c) its correct |
|
|
327 | mapspace &ms = at (op->x, op->y); |
|
|
328 | |
|
|
329 | op->flag [FLAG_REMOVED] = false; |
|
|
330 | |
|
|
331 | op->above = 0; |
|
|
332 | op->below = ms.top; |
|
|
333 | |
|
|
334 | if (ms.top) |
|
|
335 | ms.top->above = op; |
|
|
336 | else |
|
|
337 | ms.bot = op; |
|
|
338 | |
|
|
339 | ms.top = op; |
|
|
340 | ms.flags_ = 0; |
|
|
341 | } |
|
|
342 | else |
|
|
343 | { |
|
|
344 | f.parse_warn (format ("object %s out of range", op->debug_desc ())); |
|
|
345 | op->destroy (); |
|
|
346 | } |
| 404 | } |
347 | } |
| 405 | |
348 | |
| 406 | continue; |
349 | continue; |
| 407 | |
350 | |
| 408 | case KW_EOF: |
351 | case KW_EOF: |
| … | |
… | |
| 421 | } |
364 | } |
| 422 | |
365 | |
| 423 | void |
366 | void |
| 424 | maptile::activate () |
367 | maptile::activate () |
| 425 | { |
368 | { |
| 426 | active = true; |
|
|
| 427 | |
|
|
| 428 | if (spaces) |
369 | if (spaces) |
| 429 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
370 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
| 430 | for (object *op = ms->bot; op; op = op->above) |
371 | for (object *op = ms->bot; op; op = op->above) |
| 431 | op->activate_recursive (); |
372 | op->activate_recursive (); |
| 432 | } |
373 | } |
| 433 | |
374 | |
| 434 | void |
375 | void |
| 435 | maptile::deactivate () |
376 | maptile::deactivate () |
| 436 | { |
377 | { |
| 437 | active = false; |
|
|
| 438 | |
|
|
| 439 | if (spaces) |
378 | if (spaces) |
| 440 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
379 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
| 441 | for (object *op = ms->bot; op; op = op->above) |
380 | for (object *op = ms->bot; op; op = op->above) |
| 442 | op->deactivate_recursive (); |
381 | op->deactivate_recursive (); |
| 443 | } |
382 | } |
| … | |
… | |
| 453 | if (!spaces) |
392 | if (!spaces) |
| 454 | return false; |
393 | return false; |
| 455 | |
394 | |
| 456 | for (int i = 0; i < size (); ++i) |
395 | for (int i = 0; i < size (); ++i) |
| 457 | { |
396 | { |
| 458 | int unique = 0; |
397 | bool unique = 0; |
|
|
398 | |
| 459 | for (object *op = spaces [i].bot; op; op = op->above) |
399 | for (object *op = spaces [i].bot; op; op = op->above) |
| 460 | { |
400 | { |
| 461 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
401 | unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]; |
| 462 | unique = 1; |
|
|
| 463 | |
402 | |
| 464 | if (!op->can_map_save ()) |
403 | if (expect_false (!op->can_map_save ())) |
| 465 | continue; |
404 | continue; |
| 466 | |
405 | |
| 467 | if (unique || op->flag [FLAG_UNIQUE]) |
406 | if (expect_false (unique || op->flag [FLAG_UNIQUE])) |
| 468 | { |
407 | { |
| 469 | if (flags & IO_UNIQUES) |
408 | if (flags & IO_UNIQUES) |
| 470 | op->write (f); |
409 | op->write (f); |
| 471 | } |
410 | } |
| 472 | else if (flags & IO_OBJECTS) |
411 | else if (expect_true (flags & IO_OBJECTS)) |
| 473 | op->write (f); |
412 | op->write (f); |
| 474 | } |
413 | } |
| 475 | } |
414 | } |
| 476 | |
415 | |
| 477 | coroapi::cede_to_tick (); |
416 | coroapi::cede_to_tick (); |
| 478 | |
417 | |
| 479 | return true; |
418 | 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 | } |
419 | } |
| 503 | |
420 | |
| 504 | bool |
421 | bool |
| 505 | maptile::_save_objects (const char *path, int flags) |
422 | maptile::_save_objects (const char *path, int flags) |
| 506 | { |
423 | { |
| … | |
… | |
| 681 | bool |
598 | bool |
| 682 | maptile::_load_header (object_thawer &thawer) |
599 | maptile::_load_header (object_thawer &thawer) |
| 683 | { |
600 | { |
| 684 | for (;;) |
601 | for (;;) |
| 685 | { |
602 | { |
| 686 | thawer.next (); |
|
|
| 687 | |
|
|
| 688 | switch (thawer.kw) |
603 | switch (thawer.kw) |
| 689 | { |
604 | { |
| 690 | case KW_msg: |
605 | case KW_msg: |
| 691 | thawer.get_ml (KW_endmsg, msg); |
606 | thawer.get_ml (KW_endmsg, msg); |
| 692 | break; |
607 | break; |
| … | |
… | |
| 747 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
662 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
| 748 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
663 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
| 749 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
664 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
| 750 | |
665 | |
| 751 | case KW_ERROR: |
666 | case KW_ERROR: |
| 752 | set_key (thawer.kw_str, thawer.value); |
667 | set_key_text (thawer.kw_str, thawer.value); |
| 753 | break; |
668 | break; |
| 754 | |
669 | |
| 755 | case KW_end: |
670 | case KW_end: |
|
|
671 | thawer.next (); |
| 756 | return true; |
672 | return true; |
| 757 | |
673 | |
| 758 | default: |
674 | default: |
| 759 | if (!thawer.parse_error ("map", 0)) |
675 | if (!thawer.parse_error ("map", 0)) |
| 760 | return false; |
676 | return false; |
| 761 | break; |
677 | break; |
| 762 | } |
678 | } |
|
|
679 | |
|
|
680 | thawer.next (); |
| 763 | } |
681 | } |
| 764 | |
682 | |
| 765 | abort (); |
683 | 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 | } |
684 | } |
| 778 | |
685 | |
| 779 | /****************************************************************************** |
686 | /****************************************************************************** |
| 780 | * This is the start of unique map handling code |
687 | * This is the start of unique map handling code |
| 781 | *****************************************************************************/ |
688 | *****************************************************************************/ |
| … | |
… | |
| 880 | * Remove and free all objects in the given map. |
787 | * Remove and free all objects in the given map. |
| 881 | */ |
788 | */ |
| 882 | void |
789 | void |
| 883 | maptile::clear () |
790 | maptile::clear () |
| 884 | { |
791 | { |
| 885 | sfree (regions, size ()); regions = 0; |
|
|
| 886 | delete [] regionmap; regionmap = 0; |
|
|
| 887 | |
|
|
| 888 | if (spaces) |
792 | if (spaces) |
| 889 | { |
793 | { |
| 890 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
794 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
| 891 | while (object *op = ms->bot) |
795 | while (object *op = ms->bot) |
| 892 | { |
796 | { |
|
|
797 | // manually remove, as to not trigger anything |
|
|
798 | if (ms->bot = op->above) |
|
|
799 | ms->bot->below = 0; |
|
|
800 | |
|
|
801 | op->flag [FLAG_REMOVED] = true; |
|
|
802 | |
| 893 | op = op->head_ (); |
803 | object *head = op->head_ (); |
|
|
804 | if (op == head) |
|
|
805 | { |
| 894 | op->destroy_inv (false); |
806 | op->destroy_inv (false); |
| 895 | op->destroy (); |
807 | op->destroy (); |
|
|
808 | } |
|
|
809 | else if (head->map != op->map) |
|
|
810 | { |
|
|
811 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
|
|
812 | head->destroy (); |
|
|
813 | } |
| 896 | } |
814 | } |
| 897 | |
815 | |
| 898 | sfree (spaces, size ()), spaces = 0; |
816 | sfree0 (spaces, size ()); |
| 899 | } |
817 | } |
| 900 | |
818 | |
| 901 | if (buttons) |
819 | if (buttons) |
| 902 | free_objectlinkpt (buttons), buttons = 0; |
820 | free_objectlinkpt (buttons), buttons = 0; |
|
|
821 | |
|
|
822 | sfree0 (regions, size ()); |
|
|
823 | delete [] regionmap; regionmap = 0; |
| 903 | } |
824 | } |
| 904 | |
825 | |
| 905 | void |
826 | void |
| 906 | maptile::clear_header () |
827 | maptile::clear_header () |
| 907 | { |
828 | { |
| … | |
… | |
| 959 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
880 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
| 960 | break; |
881 | break; |
| 961 | |
882 | |
| 962 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
883 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
| 963 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
884 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
| 964 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
|
|
| 965 | || QUERY_FLAG (op, FLAG_UNIQUE) |
885 | || QUERY_FLAG (op, FLAG_UNIQUE) |
| 966 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
886 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
| 967 | || QUERY_FLAG (op, FLAG_UNPAID) |
887 | || QUERY_FLAG (op, FLAG_UNPAID) |
| 968 | || op->is_alive ()) |
888 | || op->is_alive ()) |
| 969 | ; // do not decay |
889 | ; // do not decay |
| … | |
… | |
| 1061 | |
981 | |
| 1062 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
982 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
| 1063 | { |
983 | { |
| 1064 | total_exp += op->stats.exp; |
984 | total_exp += op->stats.exp; |
| 1065 | |
985 | |
| 1066 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
986 | if (archetype *at = op->other_arch) |
|
|
987 | { |
| 1067 | total_exp += at->stats.exp * 8; |
988 | total_exp += at->stats.exp * 8; |
| 1068 | |
|
|
| 1069 | monster_cnt++; |
989 | monster_cnt++; |
|
|
990 | } |
|
|
991 | |
|
|
992 | for (object *inv = op->inv; inv; inv = inv->below) |
|
|
993 | { |
|
|
994 | total_exp += op->stats.exp * 8; |
|
|
995 | monster_cnt++; |
|
|
996 | } |
| 1070 | } |
997 | } |
| 1071 | } |
998 | } |
| 1072 | |
999 | |
| 1073 | avgexp = (double) total_exp / monster_cnt; |
1000 | avgexp = (double) total_exp / monster_cnt; |
| 1074 | |
1001 | |
| … | |
… | |
| 1144 | /* This could be made additive I guess (two lights better than |
1071 | /* This could be made additive I guess (two lights better than |
| 1145 | * one). But if so, it shouldn't be a simple additive - 2 |
1072 | * one). But if so, it shouldn't be a simple additive - 2 |
| 1146 | * light bulbs do not illuminate twice as far as once since |
1073 | * light bulbs do not illuminate twice as far as once since |
| 1147 | * it is a dissapation factor that is cubed. |
1074 | * it is a dissapation factor that is cubed. |
| 1148 | */ |
1075 | */ |
| 1149 | if (tmp->glow_radius > light) |
|
|
| 1150 | light = tmp->glow_radius; |
1076 | light = max (light, tmp->glow_radius); |
| 1151 | |
1077 | |
| 1152 | /* This call is needed in order to update objects the player |
1078 | /* This call is needed in order to update objects the player |
| 1153 | * is standing in that have animations (ie, grass, fire, etc). |
1079 | * is standing in that have animations (ie, grass, fire, etc). |
| 1154 | * However, it also causes the look window to be re-drawn |
1080 | * However, it also causes the look window to be re-drawn |
| 1155 | * 3 times each time the player moves, because many of the |
1081 | * 3 times each time the player moves, because many of the |
| … | |
… | |
| 1294 | vol += op->volume (); |
1220 | vol += op->volume (); |
| 1295 | |
1221 | |
| 1296 | return vol; |
1222 | return vol; |
| 1297 | } |
1223 | } |
| 1298 | |
1224 | |
| 1299 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1225 | bool |
| 1300 | * the map. It also takes care of linking back the freshly found |
1226 | 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 | { |
1227 | { |
| 1307 | maptile *mp = orig_map->tile_map [tile_num]; |
1228 | if (!tile_path[dir]) |
|
|
1229 | return 0; |
| 1308 | |
1230 | |
| 1309 | if (!mp) |
1231 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
| 1310 | { |
1232 | return 1; |
| 1311 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
|
|
| 1312 | |
1233 | |
| 1313 | if (!mp) |
1234 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
| 1314 | { |
1235 | return 1; |
| 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 | } |
|
|
| 1323 | |
1236 | |
| 1324 | int dest_tile = (tile_num + 2) % 4; |
|
|
| 1325 | |
|
|
| 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; |
1237 | 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 | } |
1238 | } |
| 1341 | |
1239 | |
| 1342 | /* this returns TRUE if the coordinates (x,y) are out of |
1240 | /* this returns TRUE if the coordinates (x,y) are out of |
| 1343 | * map m. This function also takes into account any |
1241 | * map m. This function also takes into account any |
| 1344 | * tiling considerations, loading adjacant maps as needed. |
1242 | * tiling considerations, loading adjacant maps as needed. |
| … | |
… | |
| 1357 | if (!m) |
1255 | if (!m) |
| 1358 | return 0; |
1256 | return 0; |
| 1359 | |
1257 | |
| 1360 | if (x < 0) |
1258 | if (x < 0) |
| 1361 | { |
1259 | { |
| 1362 | if (!m->tile_path[3]) |
1260 | if (!m->tile_available (3)) |
| 1363 | return 1; |
1261 | return 1; |
| 1364 | |
1262 | |
| 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); |
1263 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
| 1369 | } |
1264 | } |
| 1370 | |
1265 | |
| 1371 | if (x >= m->width) |
1266 | if (x >= m->width) |
| 1372 | { |
1267 | { |
| 1373 | if (!m->tile_path[1]) |
1268 | if (!m->tile_available (1)) |
| 1374 | return 1; |
1269 | return 1; |
| 1375 | |
1270 | |
| 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); |
1271 | return out_of_map (m->tile_map[1], x - m->width, y); |
| 1380 | } |
1272 | } |
| 1381 | |
1273 | |
| 1382 | if (y < 0) |
1274 | if (y < 0) |
| 1383 | { |
1275 | { |
| 1384 | if (!m->tile_path[0]) |
1276 | if (!m->tile_available (0)) |
| 1385 | return 1; |
1277 | return 1; |
| 1386 | |
1278 | |
| 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); |
1279 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
| 1391 | } |
1280 | } |
| 1392 | |
1281 | |
| 1393 | if (y >= m->height) |
1282 | if (y >= m->height) |
| 1394 | { |
1283 | { |
| 1395 | if (!m->tile_path[2]) |
1284 | if (!m->tile_available (2)) |
| 1396 | return 1; |
1285 | 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 | |
1286 | |
| 1401 | return out_of_map (m->tile_map[2], x, y - m->height); |
1287 | return out_of_map (m->tile_map[2], x, y - m->height); |
| 1402 | } |
1288 | } |
| 1403 | |
1289 | |
| 1404 | /* Simple case - coordinates are within this local |
1290 | /* Simple case - coordinates are within this local |
| … | |
… | |
| 1418 | maptile * |
1304 | maptile * |
| 1419 | maptile::xy_find (sint16 &x, sint16 &y) |
1305 | maptile::xy_find (sint16 &x, sint16 &y) |
| 1420 | { |
1306 | { |
| 1421 | if (x < 0) |
1307 | if (x < 0) |
| 1422 | { |
1308 | { |
| 1423 | if (!tile_path[3]) |
1309 | if (!tile_available (3)) |
| 1424 | return 0; |
1310 | return 0; |
| 1425 | |
1311 | |
| 1426 | find_and_link (this, 3); |
|
|
| 1427 | x += tile_map[3]->width; |
1312 | x += tile_map[3]->width; |
| 1428 | return tile_map[3]->xy_find (x, y); |
1313 | return tile_map[3]->xy_find (x, y); |
| 1429 | } |
1314 | } |
| 1430 | |
1315 | |
| 1431 | if (x >= width) |
1316 | if (x >= width) |
| 1432 | { |
1317 | { |
| 1433 | if (!tile_path[1]) |
1318 | if (!tile_available (1)) |
| 1434 | return 0; |
1319 | return 0; |
| 1435 | |
1320 | |
| 1436 | find_and_link (this, 1); |
|
|
| 1437 | x -= width; |
1321 | x -= width; |
| 1438 | return tile_map[1]->xy_find (x, y); |
1322 | return tile_map[1]->xy_find (x, y); |
| 1439 | } |
1323 | } |
| 1440 | |
1324 | |
| 1441 | if (y < 0) |
1325 | if (y < 0) |
| 1442 | { |
1326 | { |
| 1443 | if (!tile_path[0]) |
1327 | if (!tile_available (0)) |
| 1444 | return 0; |
1328 | return 0; |
| 1445 | |
1329 | |
| 1446 | find_and_link (this, 0); |
|
|
| 1447 | y += tile_map[0]->height; |
1330 | y += tile_map[0]->height; |
| 1448 | return tile_map[0]->xy_find (x, y); |
1331 | return tile_map[0]->xy_find (x, y); |
| 1449 | } |
1332 | } |
| 1450 | |
1333 | |
| 1451 | if (y >= height) |
1334 | if (y >= height) |
| 1452 | { |
1335 | { |
| 1453 | if (!tile_path[2]) |
1336 | if (!tile_available (2)) |
| 1454 | return 0; |
1337 | return 0; |
| 1455 | |
1338 | |
| 1456 | find_and_link (this, 2); |
|
|
| 1457 | y -= height; |
1339 | y -= height; |
| 1458 | return tile_map[2]->xy_find (x, y); |
1340 | return tile_map[2]->xy_find (x, y); |
| 1459 | } |
1341 | } |
| 1460 | |
1342 | |
| 1461 | /* Simple case - coordinates are within this local |
1343 | /* Simple case - coordinates are within this local |
| … | |
… | |
| 1472 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1354 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
| 1473 | { |
1355 | { |
| 1474 | if (!map1 || !map2) |
1356 | if (!map1 || !map2) |
| 1475 | return 0; |
1357 | return 0; |
| 1476 | |
1358 | |
| 1477 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
1359 | //TODO: this doesn't actually check correctly when intermediate maps are not loaded |
| 1478 | //fix: compare paths instead (this is likely faster, too!) |
1360 | //fix: compare paths instead (this is likely faster, too!) |
| 1479 | if (map1 == map2) |
1361 | if (map1 == map2) |
| 1480 | { |
1362 | { |
| 1481 | *dx = 0; |
1363 | *dx = 0; |
| 1482 | *dy = 0; |
1364 | *dy = 0; |
| … | |
… | |
| 1711 | |
1593 | |
| 1712 | return ::region::default_region (); |
1594 | return ::region::default_region (); |
| 1713 | } |
1595 | } |
| 1714 | |
1596 | |
| 1715 | /* picks a random object from a style map. |
1597 | /* 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 | */ |
1598 | */ |
| 1719 | object * |
1599 | object * |
| 1720 | maptile::pick_random_object () const |
1600 | maptile::pick_random_object (rand_gen &gen) const |
| 1721 | { |
1601 | { |
| 1722 | /* while returning a null object will result in a crash, that |
1602 | /* while returning a null object will result in a crash, that |
| 1723 | * is actually preferable to an infinite loop. That is because |
1603 | * is actually preferable to an infinite loop. That is because |
| 1724 | * most servers will automatically restart in case of crash. |
1604 | * most servers will automatically restart in case of crash. |
| 1725 | * Change the logic on getting the random space - shouldn't make |
1605 | * Change the logic on getting the random space - shouldn't make |
| 1726 | * any difference, but this seems clearer to me. |
1606 | * any difference, but this seems clearer to me. |
| 1727 | */ |
1607 | */ |
| 1728 | for (int i = 1000; --i;) |
1608 | for (int i = 1000; --i;) |
| 1729 | { |
1609 | { |
| 1730 | object *pick = at (rndm (width), rndm (height)).bot; |
1610 | object *pick = at (gen (width), gen (height)).bot; |
| 1731 | |
1611 | |
| 1732 | // do not prefer big monsters just because they are big. |
1612 | // do not prefer big monsters just because they are big. |
| 1733 | if (pick && pick->head_ () == pick) |
1613 | if (pick && pick->is_head ()) |
| 1734 | return pick->head_ (); |
1614 | return pick->head_ (); |
| 1735 | } |
1615 | } |
| 1736 | |
1616 | |
| 1737 | // instead of crashing in the unlikely(?) case, try to return *something* |
1617 | // instead of crashing in the unlikely(?) case, try to return *something* |
| 1738 | return get_archetype ("blocked"); |
1618 | return archetype::find ("bug"); |
| 1739 | } |
1619 | } |
| 1740 | |
1620 | |
|
|
1621 | void |
|
|
1622 | maptile::play_sound (faceidx sound, int x, int y) const |
|
|
1623 | { |
|
|
1624 | if (!sound) |
|
|
1625 | return; |
|
|
1626 | |
|
|
1627 | for_all_players (pl) |
|
|
1628 | if (pl->ob->map == this) |
|
|
1629 | if (client *ns = pl->ns) |
|
|
1630 | { |
|
|
1631 | int dx = x - pl->ob->x; |
|
|
1632 | int dy = y - pl->ob->y; |
|
|
1633 | |
|
|
1634 | int distance = idistance (dx, dy); |
|
|
1635 | |
|
|
1636 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1637 | ns->play_sound (sound, dx, dy); |
|
|
1638 | } |
|
|
1639 | } |
|
|
1640 | |
