| 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 | |
31 | |
| … | |
… | |
| 166 | } |
165 | } |
| 167 | return 0; |
166 | return 0; |
| 168 | } |
167 | } |
| 169 | |
168 | |
| 170 | /* |
169 | /* |
| 171 | * 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 |
| 172 | * This is meant for multi space objects - for single space objecs, |
171 | * spot. This is meant for multi space objects - for single space objecs, |
| 173 | * just calling get_map_blocked and checking that against movement type |
172 | * just calling get_map_blocked and checking that against movement type |
| 174 | * of object. This function goes through all the parts of the |
173 | * of object. This function goes through all the parts of the multipart |
| 175 | * multipart object and makes sure they can be inserted. |
174 | * object and makes sure they can be inserted. |
| 176 | * |
175 | * |
| 177 | * 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. |
| 178 | * |
177 | * |
| 179 | * This function has been used to deprecate arch_out_of_map - |
178 | * This function has been used to deprecate arch_out_of_map - |
| 180 | * this function also does that check, and since in most cases, |
179 | * this function also does that check, and since in most cases, |
| … | |
… | |
| 191 | * |
190 | * |
| 192 | * Note this used to be arch_blocked, but with new movement |
191 | * Note this used to be arch_blocked, but with new movement |
| 193 | * 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 |
| 194 | * against the move_block values. |
193 | * against the move_block values. |
| 195 | */ |
194 | */ |
| 196 | int |
195 | bool |
| 197 | ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) |
196 | object::blocked (maptile *m, int x, int y) const |
| 198 | { |
197 | { |
| 199 | archetype *tmp; |
198 | for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more) |
| 200 | int flag; |
|
|
| 201 | maptile *m1; |
|
|
| 202 | sint16 sx, sy; |
|
|
| 203 | |
|
|
| 204 | if (!ob) |
|
|
| 205 | { |
|
|
| 206 | flag = get_map_flags (m, &m1, x, y, &sx, &sy); |
|
|
| 207 | if (flag & P_OUT_OF_MAP) |
|
|
| 208 | return P_OUT_OF_MAP; |
|
|
| 209 | |
|
|
| 210 | /* don't have object, so don't know what types would block */ |
|
|
| 211 | return m1->at (sx, sy).move_block; |
|
|
| 212 | } |
199 | { |
|
|
200 | mapxy pos (m, x + tmp->x, y + tmp->y); |
| 213 | |
201 | |
| 214 | for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more) |
202 | if (!pos.normalise ()) |
| 215 | { |
203 | return 1; |
| 216 | flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy); |
|
|
| 217 | |
204 | |
| 218 | if (flag & P_OUT_OF_MAP) |
205 | mapspace &ms = *pos; |
| 219 | return P_OUT_OF_MAP; |
206 | |
| 220 | if (flag & P_IS_ALIVE) |
207 | if (ms.flags () & P_IS_ALIVE) |
| 221 | return P_IS_ALIVE; |
208 | return 1; |
| 222 | |
209 | |
| 223 | mapspace &ms = m1->at (sx, sy); |
210 | /* However, often ob doesn't have any move type |
| 224 | |
211 | * (signifying non-moving objects) |
| 225 | /* find_first_free_spot() calls this function. However, often |
|
|
| 226 | * ob doesn't have any move type (when used to place exits) |
|
|
| 227 | * 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. |
| 228 | */ |
213 | */ |
| 229 | |
|
|
| 230 | if (ob->move_type == 0 && ms.move_block != MOVE_ALL) |
214 | if (!move_type && ms.move_block != MOVE_ALL) |
| 231 | continue; |
215 | continue; |
| 232 | |
216 | |
| 233 | /* 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 |
| 234 | * head of the object should correspond for the entire object. |
218 | * head of the object should correspond for the entire object. |
| 235 | */ |
219 | */ |
| 236 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
220 | if (ms.blocks (move_type)) |
| 237 | return P_NO_PASS; |
221 | return 1; |
| 238 | } |
222 | } |
| 239 | |
223 | |
| 240 | return 0; |
224 | return 0; |
| 241 | } |
225 | } |
| 242 | |
226 | |
| … | |
… | |
| 260 | |
244 | |
| 261 | insert_ob_in_ob (tmp, container); |
245 | insert_ob_in_ob (tmp, container); |
| 262 | tmp = next; |
246 | tmp = next; |
| 263 | } |
247 | } |
| 264 | |
248 | |
| 265 | /* sum_weight will go through and calculate what all the containers are |
249 | // go through and calculate what all the containers are carrying. |
| 266 | * carrying. |
250 | //TODO: remove |
| 267 | */ |
251 | container->update_weight (); |
| 268 | sum_weight (container); |
|
|
| 269 | } |
252 | } |
| 270 | |
253 | |
| 271 | void |
254 | void |
| 272 | maptile::set_object_flag (int flag, int value) |
255 | maptile::set_object_flag (int flag, int value) |
| 273 | { |
256 | { |
| … | |
… | |
| 322 | bool |
305 | bool |
| 323 | maptile::_load_objects (object_thawer &f) |
306 | maptile::_load_objects (object_thawer &f) |
| 324 | { |
307 | { |
| 325 | for (;;) |
308 | for (;;) |
| 326 | { |
309 | { |
| 327 | coroapi::cede_to_tick_every (100); // cede once in a while |
310 | coroapi::cede_to_tick (); // cede once in a while |
| 328 | |
311 | |
| 329 | switch (f.kw) |
312 | switch (f.kw) |
| 330 | { |
313 | { |
| 331 | case KW_arch: |
314 | case KW_arch: |
| 332 | if (object *op = object::read (f, this)) |
315 | if (object *op = object::read (f, this)) |
| 333 | { |
316 | { |
|
|
317 | // TODO: why? |
| 334 | if (op->inv) |
318 | if (op->inv) |
| 335 | sum_weight (op); |
319 | op->update_weight (); |
| 336 | |
320 | |
| 337 | 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 | } |
| 338 | } |
347 | } |
| 339 | |
348 | |
| 340 | continue; |
349 | continue; |
| 341 | |
350 | |
| 342 | case KW_EOF: |
351 | case KW_EOF: |
| … | |
… | |
| 383 | if (!spaces) |
392 | if (!spaces) |
| 384 | return false; |
393 | return false; |
| 385 | |
394 | |
| 386 | for (int i = 0; i < size (); ++i) |
395 | for (int i = 0; i < size (); ++i) |
| 387 | { |
396 | { |
| 388 | int unique = 0; |
397 | bool unique = 0; |
|
|
398 | |
| 389 | for (object *op = spaces [i].bot; op; op = op->above) |
399 | for (object *op = spaces [i].bot; op; op = op->above) |
| 390 | { |
400 | { |
| 391 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
401 | unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]; |
| 392 | unique = 1; |
|
|
| 393 | |
402 | |
| 394 | if (!op->can_map_save ()) |
403 | if (expect_false (!op->can_map_save ())) |
| 395 | continue; |
404 | continue; |
| 396 | |
405 | |
| 397 | if (unique || op->flag [FLAG_UNIQUE]) |
406 | if (expect_false (unique || op->flag [FLAG_UNIQUE])) |
| 398 | { |
407 | { |
| 399 | if (flags & IO_UNIQUES) |
408 | if (flags & IO_UNIQUES) |
| 400 | op->write (f); |
409 | op->write (f); |
| 401 | } |
410 | } |
| 402 | else if (flags & IO_OBJECTS) |
411 | else if (expect_true (flags & IO_OBJECTS)) |
| 403 | op->write (f); |
412 | op->write (f); |
| 404 | } |
413 | } |
| 405 | } |
414 | } |
| 406 | |
415 | |
| 407 | coroapi::cede_to_tick (); |
416 | coroapi::cede_to_tick (); |
| 408 | |
417 | |
| 409 | return true; |
418 | return true; |
| 410 | } |
|
|
| 411 | |
|
|
| 412 | bool |
|
|
| 413 | maptile::_load_objects (const char *path, bool skip_header) |
|
|
| 414 | { |
|
|
| 415 | object_thawer f (path); |
|
|
| 416 | |
|
|
| 417 | if (!f) |
|
|
| 418 | return false; |
|
|
| 419 | |
|
|
| 420 | f.next (); |
|
|
| 421 | |
|
|
| 422 | if (skip_header) |
|
|
| 423 | for (;;) |
|
|
| 424 | { |
|
|
| 425 | keyword kw = f.kw; |
|
|
| 426 | f.skip (); |
|
|
| 427 | if (kw == KW_end) |
|
|
| 428 | break; |
|
|
| 429 | } |
|
|
| 430 | |
|
|
| 431 | return _load_objects (f); |
|
|
| 432 | } |
419 | } |
| 433 | |
420 | |
| 434 | bool |
421 | bool |
| 435 | maptile::_save_objects (const char *path, int flags) |
422 | maptile::_save_objects (const char *path, int flags) |
| 436 | { |
423 | { |
| … | |
… | |
| 611 | bool |
598 | bool |
| 612 | maptile::_load_header (object_thawer &thawer) |
599 | maptile::_load_header (object_thawer &thawer) |
| 613 | { |
600 | { |
| 614 | for (;;) |
601 | for (;;) |
| 615 | { |
602 | { |
| 616 | thawer.next (); |
|
|
| 617 | |
|
|
| 618 | switch (thawer.kw) |
603 | switch (thawer.kw) |
| 619 | { |
604 | { |
| 620 | case KW_msg: |
605 | case KW_msg: |
| 621 | thawer.get_ml (KW_endmsg, msg); |
606 | thawer.get_ml (KW_endmsg, msg); |
| 622 | break; |
607 | break; |
| … | |
… | |
| 677 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
662 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
| 678 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
663 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
| 679 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
664 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
| 680 | |
665 | |
| 681 | case KW_ERROR: |
666 | case KW_ERROR: |
| 682 | set_key (thawer.kw_str, thawer.value); |
667 | set_key_text (thawer.kw_str, thawer.value); |
| 683 | break; |
668 | break; |
| 684 | |
669 | |
| 685 | case KW_end: |
670 | case KW_end: |
|
|
671 | thawer.next (); |
| 686 | return true; |
672 | return true; |
| 687 | |
673 | |
| 688 | default: |
674 | default: |
| 689 | if (!thawer.parse_error ("map", 0)) |
675 | if (!thawer.parse_error ("map", 0)) |
| 690 | return false; |
676 | return false; |
| 691 | break; |
677 | break; |
| 692 | } |
678 | } |
|
|
679 | |
|
|
680 | thawer.next (); |
| 693 | } |
681 | } |
| 694 | |
682 | |
| 695 | abort (); |
683 | abort (); |
| 696 | } |
|
|
| 697 | |
|
|
| 698 | bool |
|
|
| 699 | maptile::_load_header (const char *path) |
|
|
| 700 | { |
|
|
| 701 | object_thawer thawer (path); |
|
|
| 702 | |
|
|
| 703 | if (!thawer) |
|
|
| 704 | return false; |
|
|
| 705 | |
|
|
| 706 | return _load_header (thawer); |
|
|
| 707 | } |
684 | } |
| 708 | |
685 | |
| 709 | /****************************************************************************** |
686 | /****************************************************************************** |
| 710 | * This is the start of unique map handling code |
687 | * This is the start of unique map handling code |
| 711 | *****************************************************************************/ |
688 | *****************************************************************************/ |
| … | |
… | |
| 810 | * Remove and free all objects in the given map. |
787 | * Remove and free all objects in the given map. |
| 811 | */ |
788 | */ |
| 812 | void |
789 | void |
| 813 | maptile::clear () |
790 | maptile::clear () |
| 814 | { |
791 | { |
| 815 | sfree (regions, size ()); regions = 0; |
|
|
| 816 | delete [] regionmap; regionmap = 0; |
|
|
| 817 | |
|
|
| 818 | if (spaces) |
792 | if (spaces) |
| 819 | { |
793 | { |
| 820 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
794 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
| 821 | while (object *op = ms->bot) |
795 | while (object *op = ms->bot) |
| 822 | { |
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 | |
| 823 | op = op->head_ (); |
803 | object *head = op->head_ (); |
|
|
804 | if (op == head) |
|
|
805 | { |
| 824 | op->destroy_inv (false); |
806 | op->destroy_inv (false); |
| 825 | 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 | } |
| 826 | } |
814 | } |
| 827 | |
815 | |
| 828 | sfree (spaces, size ()), spaces = 0; |
816 | sfree (spaces, size ()), spaces = 0; |
| 829 | } |
817 | } |
| 830 | |
818 | |
| 831 | if (buttons) |
819 | if (buttons) |
| 832 | free_objectlinkpt (buttons), buttons = 0; |
820 | free_objectlinkpt (buttons), buttons = 0; |
|
|
821 | |
|
|
822 | sfree (regions, size ()); regions = 0; |
|
|
823 | delete [] regionmap; regionmap = 0; |
| 833 | } |
824 | } |
| 834 | |
825 | |
| 835 | void |
826 | void |
| 836 | maptile::clear_header () |
827 | maptile::clear_header () |
| 837 | { |
828 | { |
| … | |
… | |
| 889 | 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)) |
| 890 | break; |
881 | break; |
| 891 | |
882 | |
| 892 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
883 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
| 893 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
884 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
| 894 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
|
|
| 895 | || QUERY_FLAG (op, FLAG_UNIQUE) |
885 | || QUERY_FLAG (op, FLAG_UNIQUE) |
| 896 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
886 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
| 897 | || QUERY_FLAG (op, FLAG_UNPAID) |
887 | || QUERY_FLAG (op, FLAG_UNPAID) |
| 898 | || op->is_alive ()) |
888 | || op->is_alive ()) |
| 899 | ; // do not decay |
889 | ; // do not decay |
| … | |
… | |
| 1230 | maptile::tile_available (int dir, bool load) |
1220 | maptile::tile_available (int dir, bool load) |
| 1231 | { |
1221 | { |
| 1232 | if (!tile_path[dir]) |
1222 | if (!tile_path[dir]) |
| 1233 | return 0; |
1223 | return 0; |
| 1234 | |
1224 | |
| 1235 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) |
1225 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
| 1236 | return 1; |
1226 | return 1; |
| 1237 | |
1227 | |
| 1238 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1228 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
| 1239 | return 1; |
1229 | return 1; |
| 1240 | |
1230 | |
