1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the Affero GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * and the GNU General Public License along with this program. If not, see |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <global.h> |
25 | #include <global.h> |
26 | #include <stdio.h> |
26 | #include <stdio.h> |
… | |
… | |
72 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
72 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
73 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
73 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
74 | }; |
74 | }; |
75 | |
75 | |
76 | const char *wall_suffix[16] = { |
76 | const char *wall_suffix[16] = { |
77 | "0", |
77 | "0", |
78 | "1_3", |
78 | "1_3", |
79 | "1_4", |
79 | "1_4", |
80 | "2_1_2", |
80 | "2_1_2", |
81 | "1_2", |
81 | "1_2", |
82 | "2_2_4", |
82 | "2_2_4", |
83 | "2_2_1", |
83 | "2_2_1", |
84 | "3_1", |
84 | "3_1", |
85 | "1_1", |
85 | "1_1", |
86 | "2_2_3", |
86 | "2_2_3", |
87 | "2_2_2", |
87 | "2_2_2", |
88 | "3_3", |
88 | "3_3", |
89 | "2_1_1", |
89 | "2_1_1", |
90 | "3_4", |
90 | "3_4", |
91 | "3_2", |
91 | "3_2", |
92 | "4" |
92 | "4" |
93 | }; |
93 | }; |
94 | |
94 | |
95 | static void |
95 | static void |
96 | write_uuid (uval64 skip, bool sync) |
96 | write_uuid (uval64 skip, bool sync) |
97 | { |
97 | { |
… | |
… | |
233 | |
233 | |
234 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
234 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
235 | static bool |
235 | static bool |
236 | compare_ob_value_lists_one (const object *wants, const object *has) |
236 | compare_ob_value_lists_one (const object *wants, const object *has) |
237 | { |
237 | { |
238 | /* n-squared behaviour (see kv_get), but I'm hoping both |
238 | /* n-squared behaviour (see kv.get), but I'm hoping both |
239 | * objects with lists are rare, and lists stay short. If not, use a |
239 | * objects with lists are rare, and lists stay short. If not, use a |
240 | * different structure or at least keep the lists sorted... |
240 | * different structure or at least keep the lists sorted... |
241 | */ |
241 | */ |
242 | |
242 | |
243 | /* For each field in wants, */ |
243 | /* For each field in wants, */ |
244 | for (key_value *kv = wants->key_values; kv; kv = kv->next) |
244 | for (key_value *kv = wants->kv.first; kv; kv = kv->next) |
245 | if (has->kv_get (kv->key) != kv->value) |
245 | if (has->kv.get (kv->key) != kv->value) |
246 | return false; |
246 | return false; |
247 | |
247 | |
248 | /* If we get here, every field in wants has a matching field in has. */ |
248 | /* If we get here, every field in wants has a matching field in has. */ |
249 | return true; |
249 | return true; |
250 | } |
250 | } |
… | |
… | |
351 | /* inventory ok - still need to check rest of this object to see |
351 | /* inventory ok - still need to check rest of this object to see |
352 | * if it is valid. |
352 | * if it is valid. |
353 | */ |
353 | */ |
354 | } |
354 | } |
355 | |
355 | |
356 | /* Don't merge objects that are applied. With the new 'body' code, |
356 | /* Don't merge objects that are applied. With the new 'body' code, |
357 | * it is possible for most any character to have more than one of |
357 | * it is possible for most any character to have more than one of |
358 | * some items equipped, and we don't want those to merge. |
358 | * some items equipped, and we don't want those to merge. |
359 | */ |
359 | */ |
360 | if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED]) |
360 | if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED]) |
361 | return 0; |
361 | return 0; |
362 | |
362 | |
363 | /* Note sure why the following is the case - either the object has to |
363 | /* Not sure why the following is the case - either the object has to |
364 | * be animated or have a very low speed. Is this an attempted monster |
364 | * be animated or have a very low speed. Is this an attempted monster |
365 | * check? |
365 | * check? |
366 | */ |
366 | */ |
367 | if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ()) |
367 | if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ()) |
368 | return 0; |
368 | return 0; |
369 | |
369 | |
… | |
… | |
373 | if (ob1->level != ob2->level) |
373 | if (ob1->level != ob2->level) |
374 | return 0; |
374 | return 0; |
375 | break; |
375 | break; |
376 | } |
376 | } |
377 | |
377 | |
378 | if (ob1->key_values || ob2->key_values) |
378 | if (!ob1->kv.empty () || !ob2->kv.empty ()) |
379 | { |
379 | { |
380 | /* At least one of these has key_values. */ |
380 | /* At least one of these has key_values. */ |
381 | if ((!ob1->key_values) != (!ob2->key_values)) |
381 | if (ob1->kv.empty () != ob2->kv.empty ()) |
382 | return 0; /* One has fields, but the other one doesn't. */ |
382 | return 0; /* One has fields, but the other one doesn't. */ |
383 | |
383 | |
384 | if (!compare_ob_value_lists (ob1, ob2)) |
384 | if (!compare_ob_value_lists (ob1, ob2)) |
385 | return 0; |
385 | return 0; |
386 | } |
386 | } |
… | |
… | |
446 | |
446 | |
447 | return 0; |
447 | return 0; |
448 | } |
448 | } |
449 | |
449 | |
450 | // adjust weight per container type ("of holding") |
450 | // adjust weight per container type ("of holding") |
451 | static uint32 |
451 | static weight_t |
452 | weight_adjust_for (object *op, uint32 weight) |
452 | weight_adjust_for (object *op, weight_t weight) |
453 | { |
453 | { |
454 | return op->type == CONTAINER |
454 | if (op->type == CONTAINER) |
455 | ? weight - weight * op->stats.Str / 100 |
455 | weight -= weight * op->stats.Str / 100; |
456 | : weight; |
456 | |
|
|
457 | return weight; |
457 | } |
458 | } |
458 | |
459 | |
459 | /* |
460 | /* |
460 | * subtracts, then adds, the specified weight to an object, |
461 | * subtracts, then adds, the specified weight to an object, |
461 | * and also updates how much the environment(s) is/are carrying. |
462 | * and also updates how much the environment(s) is/are carrying. |
462 | */ |
463 | */ |
463 | static void |
464 | static void |
464 | adjust_weight (object *op, sint32 sub, sint32 add) |
465 | adjust_weight (object *op, weight_t sub, weight_t add) |
465 | { |
466 | { |
466 | while (op) |
467 | while (op) |
467 | { |
468 | { |
468 | sint32 ocarrying = op->carrying; |
469 | weight_t carrying = (weight_t)op->carrying |
|
|
470 | - weight_adjust_for (op, sub) |
|
|
471 | + weight_adjust_for (op, add); |
469 | |
472 | |
470 | op->carrying -= weight_adjust_for (op, sub); |
473 | sub = op->carrying; |
471 | op->carrying += weight_adjust_for (op, add); |
474 | op->carrying = carrying; |
|
|
475 | add = op->carrying; |
472 | |
476 | |
473 | if (object *pl = op->visible_to ()) |
477 | if (object *pl = op->visible_to ()) |
474 | if (pl != op) // player is handled lazily |
478 | if (pl != op) // player is handled lazily |
475 | esrv_update_item (UPD_WEIGHT, pl, op); |
479 | esrv_update_item (UPD_WEIGHT, pl, op); |
476 | |
480 | |
477 | sub = ocarrying; |
|
|
478 | add = op->carrying; |
|
|
479 | |
|
|
480 | op = op->env; |
481 | op = op->env; |
481 | } |
482 | } |
482 | } |
483 | } |
483 | |
484 | |
484 | /* |
485 | /* |
… | |
… | |
487 | * containers are carrying, and sums it up. |
488 | * containers are carrying, and sums it up. |
488 | */ |
489 | */ |
489 | void |
490 | void |
490 | object::update_weight () |
491 | object::update_weight () |
491 | { |
492 | { |
492 | sint32 sum = 0; |
493 | weight_t sum = 0; |
493 | |
494 | |
494 | for (object *op = inv; op; op = op->below) |
495 | for (object *op = inv; op; op = op->below) |
495 | { |
496 | { |
496 | op->update_weight (); |
497 | op->update_weight (); |
497 | |
498 | |
… | |
… | |
597 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
598 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
598 | return; |
599 | return; |
599 | } |
600 | } |
600 | |
601 | |
601 | this->owner = owner; |
602 | this->owner = owner; |
602 | } |
|
|
603 | |
|
|
604 | /* Zero the key_values on op, decrementing the shared-string |
|
|
605 | * refcounts and freeing the links. |
|
|
606 | */ |
|
|
607 | static void |
|
|
608 | free_key_values (object *op) |
|
|
609 | { |
|
|
610 | for (key_value *i = op->key_values; i; ) |
|
|
611 | { |
|
|
612 | key_value *next = i->next; |
|
|
613 | delete i; |
|
|
614 | |
|
|
615 | i = next; |
|
|
616 | } |
|
|
617 | |
|
|
618 | op->key_values = 0; |
|
|
619 | } |
603 | } |
620 | |
604 | |
621 | /* |
605 | /* |
622 | * copy_to first frees everything allocated by the dst object, |
606 | * copy_to first frees everything allocated by the dst object, |
623 | * and then copies the contents of itself into the second |
607 | * and then copies the contents of itself into the second |
… | |
… | |
629 | void |
613 | void |
630 | object::copy_to (object *dst) |
614 | object::copy_to (object *dst) |
631 | { |
615 | { |
632 | dst->remove (); |
616 | dst->remove (); |
633 | *(object_copy *)dst = *this; |
617 | *(object_copy *)dst = *this; |
|
|
618 | |
|
|
619 | // maybe move to object_copy? |
|
|
620 | dst->kv = kv; |
|
|
621 | |
634 | dst->flag [FLAG_REMOVED] = true; |
622 | dst->flag [FLAG_REMOVED] = true; |
635 | |
|
|
636 | /* Copy over key_values, if any. */ |
|
|
637 | if (key_values) |
|
|
638 | { |
|
|
639 | key_value *tail = 0; |
|
|
640 | dst->key_values = 0; |
|
|
641 | |
|
|
642 | for (key_value *i = key_values; i; i = i->next) |
|
|
643 | { |
|
|
644 | key_value *new_link = new key_value; |
|
|
645 | |
|
|
646 | new_link->next = 0; |
|
|
647 | new_link->key = i->key; |
|
|
648 | new_link->value = i->value; |
|
|
649 | |
|
|
650 | /* Try and be clever here, too. */ |
|
|
651 | if (!dst->key_values) |
|
|
652 | { |
|
|
653 | dst->key_values = new_link; |
|
|
654 | tail = new_link; |
|
|
655 | } |
|
|
656 | else |
|
|
657 | { |
|
|
658 | tail->next = new_link; |
|
|
659 | tail = new_link; |
|
|
660 | } |
|
|
661 | } |
|
|
662 | } |
|
|
663 | |
|
|
664 | dst->activate (); |
623 | dst->activate (); |
665 | } |
624 | } |
666 | |
625 | |
667 | void |
626 | void |
668 | object::instantiate () |
627 | object::instantiate () |
… | |
… | |
677 | speed_left = -1.; |
636 | speed_left = -1.; |
678 | |
637 | |
679 | /* copy the body_info to the body_used - this is only really |
638 | /* copy the body_info to the body_used - this is only really |
680 | * need for monsters, but doesn't hurt to do it for everything. |
639 | * need for monsters, but doesn't hurt to do it for everything. |
681 | * by doing so, when a monster is created, it has good starting |
640 | * by doing so, when a monster is created, it has good starting |
682 | * values for the body_used info, so when items are created |
641 | * values for the body_used info, so when items are created |
683 | * for it, they can be properly equipped. |
642 | * for it, they can be properly equipped. |
684 | */ |
643 | */ |
685 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
644 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
686 | slot[i].used = slot[i].info; |
645 | slot[i].used = slot[i].info; |
687 | |
646 | |
… | |
… | |
779 | } |
738 | } |
780 | |
739 | |
781 | mapspace &m = op->ms (); |
740 | mapspace &m = op->ms (); |
782 | |
741 | |
783 | if (!(m.flags_ & P_UPTODATE)) |
742 | if (!(m.flags_ & P_UPTODATE)) |
784 | /* nop */; |
743 | m.update_up (); // nothing to do except copy up |
785 | else if (action == UP_OBJ_INSERT) |
744 | else if (action == UP_OBJ_INSERT) |
786 | { |
745 | { |
787 | #if 0 |
746 | #if 0 |
788 | // this is likely overkill, TODO: revisit (schmorp) |
747 | // this is likely overkill, TODO: revisit (schmorp) |
789 | if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW)) |
748 | if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW)) |
… | |
… | |
794 | || (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC)) |
753 | || (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC)) |
795 | || (m.move_on | op->move_on ) != m.move_on |
754 | || (m.move_on | op->move_on ) != m.move_on |
796 | || (m.move_off | op->move_off ) != m.move_off |
755 | || (m.move_off | op->move_off ) != m.move_off |
797 | || (m.move_slow | op->move_slow) != m.move_slow |
756 | || (m.move_slow | op->move_slow) != m.move_slow |
798 | /* This isn't perfect, but I don't expect a lot of objects to |
757 | /* This isn't perfect, but I don't expect a lot of objects to |
799 | * have move_allow right now. |
758 | * have move_allow right now. |
800 | */ |
759 | */ |
801 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
760 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
802 | m.invalidate (); |
761 | m.invalidate (); |
803 | #else |
762 | #else |
804 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
763 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
… | |
… | |
810 | * that is being removed. |
769 | * that is being removed. |
811 | */ |
770 | */ |
812 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
771 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
813 | m.invalidate (); |
772 | m.invalidate (); |
814 | else if (action == UP_OBJ_FACE) |
773 | else if (action == UP_OBJ_FACE) |
815 | /* Nothing to do for that case */ ; |
774 | m.update_up (); // nothing to do for that case, except copy up |
816 | else |
775 | else |
817 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
776 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
818 | |
777 | |
819 | if (op->more) |
778 | if (op->more) |
820 | update_object (op->more, action); |
779 | update_object (op->more, action); |
… | |
… | |
831 | |
790 | |
832 | object::~object () |
791 | object::~object () |
833 | { |
792 | { |
834 | unlink (); |
793 | unlink (); |
835 | |
794 | |
836 | free_key_values (this); |
795 | kv.clear (); |
837 | } |
796 | } |
838 | |
797 | |
839 | void object::link () |
798 | void object::link () |
840 | { |
799 | { |
841 | assert (!index);//D |
800 | assert (!index);//D |
… | |
… | |
884 | op->activate_recursive (); |
843 | op->activate_recursive (); |
885 | } |
844 | } |
886 | |
845 | |
887 | /* This function removes object 'op' from the list of active |
846 | /* This function removes object 'op' from the list of active |
888 | * objects. |
847 | * objects. |
889 | * This should only be used for style maps or other such |
848 | * This should only be used for style maps or other such |
890 | * reference maps where you don't want an object that isn't |
849 | * reference maps where you don't want an object that isn't |
891 | * in play chewing up cpu time getting processed. |
850 | * in play chewing up cpu time getting processed. |
892 | * The reverse of this is to call update_ob_speed, which |
851 | * The reverse of this is to call update_ob_speed, which |
893 | * will do the right thing based on the speed of the object. |
852 | * will do the right thing based on the speed of the object. |
894 | */ |
853 | */ |
… | |
… | |
940 | * if some form of movement is allowed, let objects |
899 | * if some form of movement is allowed, let objects |
941 | * drop on that space. |
900 | * drop on that space. |
942 | */ |
901 | */ |
943 | if (!drop_to_ground |
902 | if (!drop_to_ground |
944 | || !map |
903 | || !map |
945 | || map->in_memory != MAP_ACTIVE |
904 | || !map->linkable () |
946 | || map->no_drop |
905 | || map->no_drop |
947 | || ms ().move_block == MOVE_ALL) |
906 | || ms ().move_block == MOVE_ALL) |
948 | { |
907 | { |
949 | while (inv) |
908 | while (inv) |
950 | inv->destroy (); |
909 | inv->destroy (); |
… | |
… | |
1047 | |
1006 | |
1048 | freelist = li; |
1007 | freelist = li; |
1049 | ++free_count; |
1008 | ++free_count; |
1050 | } |
1009 | } |
1051 | |
1010 | |
1052 | static struct freed_map : maptile |
|
|
1053 | { |
|
|
1054 | freed_map () |
|
|
1055 | : maptile (3, 3) |
|
|
1056 | { |
|
|
1057 | path = "<freed objects map>"; |
|
|
1058 | name = "/internal/freed_objects_map"; |
|
|
1059 | no_drop = 1; |
|
|
1060 | no_reset = 1; |
|
|
1061 | |
|
|
1062 | in_memory = MAP_ACTIVE; |
|
|
1063 | } |
|
|
1064 | |
|
|
1065 | ~freed_map () |
|
|
1066 | { |
|
|
1067 | destroy (); |
|
|
1068 | } |
|
|
1069 | } freed_map; // freed objects are moved here to avoid crashes |
|
|
1070 | |
|
|
1071 | void |
1011 | void |
1072 | object::do_destroy () |
1012 | object::do_destroy () |
1073 | { |
1013 | { |
1074 | if (flag [FLAG_IS_LINKED]) |
1014 | if (flag [FLAG_IS_LINKED]) |
1075 | remove_link (); |
1015 | remove_link (); |
… | |
… | |
1148 | flag [FLAG_REMOVED] = true; |
1088 | flag [FLAG_REMOVED] = true; |
1149 | |
1089 | |
1150 | if (more) |
1090 | if (more) |
1151 | more->remove (); |
1091 | more->remove (); |
1152 | |
1092 | |
1153 | /* |
1093 | /* |
1154 | * In this case, the object to be removed is in someones |
1094 | * In this case, the object to be removed is in someones |
1155 | * inventory. |
1095 | * inventory. |
1156 | */ |
1096 | */ |
1157 | if (env) |
1097 | if (env) |
1158 | { |
1098 | { |
… | |
… | |
1240 | |
1180 | |
1241 | above = 0; |
1181 | above = 0; |
1242 | below = 0; |
1182 | below = 0; |
1243 | |
1183 | |
1244 | ms.invalidate (); |
1184 | ms.invalidate (); |
1245 | |
|
|
1246 | if (map->in_memory == MAP_SAVING) |
|
|
1247 | return; |
|
|
1248 | |
1185 | |
1249 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1186 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1250 | |
1187 | |
1251 | if (object *pl = ms.player ()) |
1188 | if (object *pl = ms.player ()) |
1252 | { |
1189 | { |
… | |
… | |
1387 | { |
1324 | { |
1388 | op->remove (); |
1325 | op->remove (); |
1389 | |
1326 | |
1390 | if (m == &freed_map)//D TODO: remove soon |
1327 | if (m == &freed_map)//D TODO: remove soon |
1391 | {//D |
1328 | {//D |
1392 | LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D |
1329 | LOG (llevError | logBacktrace, "tries to insert object on freed objects map: %s", op->debug_desc ());//D |
1393 | }//D |
1330 | }//D |
1394 | |
1331 | |
1395 | /* Ideally, the caller figures this out. However, it complicates a lot |
1332 | /* Ideally, the caller figures this out. However, it complicates a lot |
1396 | * of areas of callers (eg, anything that uses find_free_spot would now |
1333 | * of areas of callers (eg, anything that uses find_free_spot would now |
1397 | * need extra work |
1334 | * need extra work |
… | |
… | |
1466 | * We've already dealt with merging if appropriate. |
1403 | * We've already dealt with merging if appropriate. |
1467 | * Generally, we want to put the new object on top. But if |
1404 | * Generally, we want to put the new object on top. But if |
1468 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1405 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1469 | * floor, we want to insert above that and no further. |
1406 | * floor, we want to insert above that and no further. |
1470 | * Also, if there are spell objects on this space, we stop processing |
1407 | * Also, if there are spell objects on this space, we stop processing |
1471 | * once we get to them. This reduces the need to traverse over all of |
1408 | * once we get to them. This reduces the need to traverse over all of |
1472 | * them when adding another one - this saves quite a bit of cpu time |
1409 | * them when adding another one - this saves quite a bit of cpu time |
1473 | * when lots of spells are cast in one area. Currently, it is presumed |
1410 | * when lots of spells are cast in one area. Currently, it is presumed |
1474 | * that flying non pickable objects are spell objects. |
1411 | * that flying non pickable objects are spell objects. |
1475 | */ |
1412 | */ |
1476 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1413 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
… | |
… | |
1602 | |
1539 | |
1603 | return op; |
1540 | return op; |
1604 | } |
1541 | } |
1605 | |
1542 | |
1606 | /* this function inserts an object in the map, but if it |
1543 | /* this function inserts an object in the map, but if it |
1607 | * finds an object of its own type, it'll remove that one first. |
1544 | * finds an object of its own type, it'll remove that one first. |
1608 | * op is the object to insert it under: supplies x and the map. |
1545 | * op is the object to insert it under: supplies x and the map. |
1609 | */ |
1546 | */ |
1610 | void |
1547 | void |
1611 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1548 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1612 | { |
1549 | { |
… | |
… | |
1644 | if (!items // testing !items ensures we can drop at least one item |
1581 | if (!items // testing !items ensures we can drop at least one item |
1645 | || (items < m->max_items |
1582 | || (items < m->max_items |
1646 | && ms.volume () < m->max_volume)) |
1583 | && ms.volume () < m->max_volume)) |
1647 | return true; |
1584 | return true; |
1648 | |
1585 | |
1649 | if (originator && originator->is_player ()) |
1586 | if (originator) |
1650 | originator->contr->failmsgf ( |
1587 | originator->failmsgf ( |
1651 | "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>", |
1588 | "No matter how hard you try, you just cannot put the %s here! H<Try to remove some items from the floor first.>", |
1652 | query_name () |
1589 | query_name () |
1653 | ); |
1590 | ); |
1654 | |
1591 | |
1655 | return false; |
1592 | return false; |
1656 | } |
1593 | } |
… | |
… | |
1670 | |
1607 | |
1671 | nr = min (nr, nrof); |
1608 | nr = min (nr, nrof); |
1672 | |
1609 | |
1673 | if (nrof > nr) |
1610 | if (nrof > nr) |
1674 | { |
1611 | { |
1675 | sint64 oweight = total_weight (); |
1612 | weight_t oweight = total_weight (); |
1676 | |
1613 | |
1677 | nrof -= nr; |
1614 | nrof -= nr; |
1678 | |
1615 | |
1679 | if (object *pl = visible_to ()) |
1616 | if (object *pl = visible_to ()) |
1680 | esrv_update_item (UPD_NROF, pl, this); |
1617 | esrv_update_item (UPD_NROF, pl, this); |
… | |
… | |
1741 | /* |
1678 | /* |
1742 | * env->insert (op) |
1679 | * env->insert (op) |
1743 | * This function inserts the object op in the linked list |
1680 | * This function inserts the object op in the linked list |
1744 | * inside the object environment. |
1681 | * inside the object environment. |
1745 | * |
1682 | * |
1746 | * The function returns now pointer to inserted item, and return value can |
1683 | * The function returns now pointer to inserted item, and return value can |
1747 | * be != op, if items are merged. -Tero |
1684 | * be != op, if items are merged. -Tero |
1748 | */ |
1685 | */ |
1749 | object * |
1686 | object * |
1750 | object::insert (object *op) |
1687 | object::insert (object *op) |
1751 | { |
1688 | { |
… | |
… | |
1764 | if (object::can_merge (tmp, op)) |
1701 | if (object::can_merge (tmp, op)) |
1765 | { |
1702 | { |
1766 | /* return the original object and remove inserted object |
1703 | /* return the original object and remove inserted object |
1767 | (client prefers the original object) */ |
1704 | (client prefers the original object) */ |
1768 | |
1705 | |
1769 | // carring must be 0 for mergable objects |
1706 | // carrying must be 0 for mergable objects |
1770 | sint64 oweight = tmp->weight * tmp->nrof; |
1707 | weight_t oweight = weight_t (tmp->weight) * tmp->nrof; |
1771 | |
1708 | |
1772 | tmp->nrof += op->nrof; |
1709 | tmp->nrof += op->nrof; |
1773 | |
1710 | |
1774 | if (object *pl = tmp->visible_to ()) |
1711 | if (object *pl = tmp->visible_to ()) |
1775 | esrv_update_item (UPD_NROF, pl, tmp); |
1712 | esrv_update_item (UPD_NROF, pl, tmp); |
1776 | |
1713 | |
1777 | adjust_weight (this, oweight, tmp->weight * tmp->nrof); |
1714 | adjust_weight (this, oweight, weight_t (tmp->weight) * tmp->nrof); |
1778 | |
1715 | |
1779 | op->destroy (); |
1716 | op->destroy (); |
1780 | op = tmp; |
1717 | op = tmp; |
1781 | goto inserted; |
1718 | goto inserted; |
1782 | } |
1719 | } |
… | |
… | |
1871 | */ |
1808 | */ |
1872 | if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0) |
1809 | if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0) |
1873 | return 0; |
1810 | return 0; |
1874 | |
1811 | |
1875 | /* The objects have to be checked from top to bottom. |
1812 | /* The objects have to be checked from top to bottom. |
1876 | * Hence, we first go to the top: |
1813 | * Hence, we first go to the top: |
1877 | */ |
1814 | */ |
1878 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1815 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1879 | { |
1816 | { |
1880 | next = tmp->below; |
1817 | next = tmp->below; |
1881 | |
1818 | |
… | |
… | |
2065 | * inform the caller. However, insert_ob_in_map will update as |
2002 | * inform the caller. However, insert_ob_in_map will update as |
2066 | * necessary, so the caller shouldn't need to do any special work. |
2003 | * necessary, so the caller shouldn't need to do any special work. |
2067 | * Note - updated to take an object instead of archetype - this is necessary |
2004 | * Note - updated to take an object instead of archetype - this is necessary |
2068 | * because arch_blocked (now ob_blocked) needs to know the movement type |
2005 | * because arch_blocked (now ob_blocked) needs to know the movement type |
2069 | * to know if the space in question will block the object. We can't use |
2006 | * to know if the space in question will block the object. We can't use |
2070 | * the archetype because that isn't correct if the monster has been |
2007 | * the archetype because that isn't correct if the monster has been |
2071 | * customized, changed states, etc. |
2008 | * customized, changed states, etc. |
2072 | */ |
2009 | */ |
2073 | int |
2010 | int |
2074 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2011 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2075 | { |
2012 | { |
2076 | int altern[SIZEOFFREE]; |
2013 | int altern[SIZEOFFREE]; |
2077 | int index = 0, flag; |
2014 | int index = 0; |
2078 | |
2015 | |
2079 | for (int i = start; i < stop; i++) |
2016 | for (int i = start; i < stop; i++) |
2080 | { |
2017 | { |
2081 | mapxy pos (m, x, y); pos.move (i); |
2018 | mapxy pos (m, x, y); pos.move (i); |
2082 | |
2019 | |
… | |
… | |
2098 | continue; |
2035 | continue; |
2099 | } |
2036 | } |
2100 | |
2037 | |
2101 | /* Basically, if we find a wall on a space, we cut down the search size. |
2038 | /* Basically, if we find a wall on a space, we cut down the search size. |
2102 | * In this way, we won't return spaces that are on another side of a wall. |
2039 | * In this way, we won't return spaces that are on another side of a wall. |
2103 | * This mostly work, but it cuts down the search size in all directions - |
2040 | * This mostly work, but it cuts down the search size in all directions - |
2104 | * if the space being examined only has a wall to the north and empty |
2041 | * if the space being examined only has a wall to the north and empty |
2105 | * spaces in all the other directions, this will reduce the search space |
2042 | * spaces in all the other directions, this will reduce the search space |
2106 | * to only the spaces immediately surrounding the target area, and |
2043 | * to only the spaces immediately surrounding the target area, and |
2107 | * won't look 2 spaces south of the target space. |
2044 | * won't look 2 spaces south of the target space. |
2108 | */ |
2045 | */ |
… | |
… | |
2138 | */ |
2075 | */ |
2139 | int |
2076 | int |
2140 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2077 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2141 | { |
2078 | { |
2142 | for (int i = 0; i < SIZEOFFREE; i++) |
2079 | for (int i = 0; i < SIZEOFFREE; i++) |
2143 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2080 | if (!ob->blocked (m, x + DIRX (i), y + DIRY (i))) |
2144 | return i; |
2081 | return i; |
2145 | |
2082 | |
2146 | return -1; |
2083 | return -1; |
2147 | } |
2084 | } |
2148 | |
2085 | |
… | |
… | |
2159 | |
2096 | |
2160 | while (--end) |
2097 | while (--end) |
2161 | swap (arr [end], arr [rndm (end + 1)]); |
2098 | swap (arr [end], arr [rndm (end + 1)]); |
2162 | } |
2099 | } |
2163 | |
2100 | |
2164 | /* new function to make monster searching more efficient, and effective! |
2101 | /* new function to make monster searching more efficient, and effective! |
2165 | * This basically returns a randomized array (in the passed pointer) of |
2102 | * This basically returns a randomized array (in the passed pointer) of |
2166 | * the spaces to find monsters. In this way, it won't always look for |
2103 | * the spaces to find monsters. In this way, it won't always look for |
2167 | * monsters to the north first. However, the size of the array passed |
2104 | * monsters to the north first. However, the size of the array passed |
2168 | * covers all the spaces, so within that size, all the spaces within |
2105 | * covers all the spaces, so within that size, all the spaces within |
2169 | * the 3x3 area will be searched, just not in a predictable order. |
2106 | * the 3x3 area will be searched, just not in a predictable order. |
… | |
… | |
2194 | * there is capable of. |
2131 | * there is capable of. |
2195 | */ |
2132 | */ |
2196 | int |
2133 | int |
2197 | find_dir (maptile *m, int x, int y, object *exclude) |
2134 | find_dir (maptile *m, int x, int y, object *exclude) |
2198 | { |
2135 | { |
2199 | int max = SIZEOFFREE, mflags; |
2136 | int max = SIZEOFFREE; |
2200 | MoveType move_type; |
2137 | MoveType move_type; |
2201 | |
2138 | |
2202 | if (exclude && exclude->head_ () != exclude) |
2139 | if (exclude && exclude->head_ () != exclude) |
2203 | { |
2140 | { |
2204 | exclude = exclude->head; |
2141 | exclude = exclude->head; |
… | |
… | |
2413 | int mflags; |
2350 | int mflags; |
2414 | |
2351 | |
2415 | if (dir < 0) |
2352 | if (dir < 0) |
2416 | return 0; /* exit condition: invalid direction */ |
2353 | return 0; /* exit condition: invalid direction */ |
2417 | |
2354 | |
2418 | dx = x + freearr_x[dir]; |
2355 | dx = x + DIRX (dir); |
2419 | dy = y + freearr_y[dir]; |
2356 | dy = y + DIRY (dir); |
2420 | |
2357 | |
2421 | mflags = get_map_flags (m, &m, dx, dy, &dx, &dy); |
2358 | mflags = get_map_flags (m, &m, dx, dy, &dx, &dy); |
2422 | |
2359 | |
2423 | /* This functional arguably was incorrect before - it was |
2360 | /* This functional arguably was incorrect before - it was |
2424 | * checking for P_WALL - that was basically seeing if |
2361 | * checking for P_WALL - that was basically seeing if |
… | |
… | |
2455 | return /*who->flag [FLAG_WIZ]|| */ |
2392 | return /*who->flag [FLAG_WIZ]|| */ |
2456 | (item->weight > 0 && !item->flag [FLAG_NO_PICK] && |
2393 | (item->weight > 0 && !item->flag [FLAG_NO_PICK] && |
2457 | !item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2394 | !item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2458 | } |
2395 | } |
2459 | |
2396 | |
|
|
2397 | //-GPL |
|
|
2398 | |
2460 | /* |
2399 | /* |
2461 | * create clone from object to another |
2400 | * create clone from object to another |
2462 | */ |
2401 | */ |
2463 | object * |
2402 | object * |
2464 | object::deep_clone () |
2403 | object::deep_clone () |
… | |
… | |
2494 | return tmp; |
2433 | return tmp; |
2495 | |
2434 | |
2496 | return 0; |
2435 | return 0; |
2497 | } |
2436 | } |
2498 | |
2437 | |
|
|
2438 | /* Zero the key_values on op, decrementing the shared-string |
|
|
2439 | * refcounts and freeing the links. |
|
|
2440 | */ |
|
|
2441 | void |
|
|
2442 | key_values::clear () |
|
|
2443 | { |
|
|
2444 | for (key_value *kvp = first; kvp; ) |
|
|
2445 | { |
|
|
2446 | key_value *next = kvp->next; |
|
|
2447 | delete kvp; |
|
|
2448 | kvp = next; |
|
|
2449 | } |
|
|
2450 | |
|
|
2451 | first = 0; |
|
|
2452 | } |
|
|
2453 | |
2499 | shstr_tmp |
2454 | shstr_tmp |
2500 | object::kv_get (shstr_tmp key) const |
2455 | key_values::get (shstr_tmp key) const |
2501 | { |
2456 | { |
2502 | for (key_value *kv = key_values; kv; kv = kv->next) |
2457 | for (key_value *kv = first; kv; kv = kv->next) |
2503 | if (kv->key == key) |
2458 | if (kv->key == key) |
2504 | return kv->value; |
2459 | return kv->value; |
2505 | |
2460 | |
2506 | return shstr (); |
2461 | return shstr (); |
2507 | } |
2462 | } |
2508 | |
2463 | |
2509 | void |
2464 | void |
|
|
2465 | key_values::add (shstr_tmp key, shstr_tmp value) |
|
|
2466 | { |
|
|
2467 | key_value *kv = new key_value; |
|
|
2468 | |
|
|
2469 | kv->next = first; |
|
|
2470 | kv->key = key; |
|
|
2471 | kv->value = value; |
|
|
2472 | |
|
|
2473 | first = kv; |
|
|
2474 | } |
|
|
2475 | |
|
|
2476 | void |
2510 | object::kv_set (shstr_tmp key, shstr_tmp value) |
2477 | key_values::set (shstr_tmp key, shstr_tmp value) |
2511 | { |
2478 | { |
2512 | for (key_value *kv = key_values; kv; kv = kv->next) |
2479 | for (key_value *kv = first; kv; kv = kv->next) |
2513 | if (kv->key == key) |
2480 | if (kv->key == key) |
2514 | { |
2481 | { |
2515 | kv->value = value; |
2482 | kv->value = value; |
2516 | return; |
2483 | return; |
2517 | } |
2484 | } |
2518 | |
2485 | |
2519 | key_value *kv = new key_value; |
2486 | add (key, value); |
2520 | |
|
|
2521 | kv->next = key_values; |
|
|
2522 | kv->key = key; |
|
|
2523 | kv->value = value; |
|
|
2524 | |
|
|
2525 | key_values = kv; |
|
|
2526 | } |
2487 | } |
2527 | |
2488 | |
2528 | void |
2489 | void |
2529 | object::kv_del (shstr_tmp key) |
2490 | key_values::del (shstr_tmp key) |
2530 | { |
2491 | { |
2531 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
2492 | for (key_value **kvp = &first; *kvp; kvp = &(*kvp)->next) |
2532 | if ((*kvp)->key == key) |
2493 | if ((*kvp)->key == key) |
2533 | { |
2494 | { |
2534 | key_value *kv = *kvp; |
2495 | key_value *kv = *kvp; |
2535 | *kvp = (*kvp)->next; |
2496 | *kvp = (*kvp)->next; |
2536 | delete kv; |
2497 | delete kv; |
2537 | return; |
2498 | return; |
2538 | } |
2499 | } |
|
|
2500 | } |
|
|
2501 | |
|
|
2502 | void |
|
|
2503 | key_values::reverse () |
|
|
2504 | { |
|
|
2505 | key_value *prev = 0; |
|
|
2506 | key_value *head = first; |
|
|
2507 | |
|
|
2508 | while (head) |
|
|
2509 | { |
|
|
2510 | key_value *node = head; |
|
|
2511 | head = head->next; |
|
|
2512 | node->next = prev; |
|
|
2513 | prev = node; |
|
|
2514 | } |
|
|
2515 | |
|
|
2516 | first = prev; |
|
|
2517 | } |
|
|
2518 | |
|
|
2519 | key_values & |
|
|
2520 | key_values::operator =(const key_values &kv) |
|
|
2521 | { |
|
|
2522 | clear (); |
|
|
2523 | |
|
|
2524 | for (key_value *kvp = kv.first; kvp; kvp = kvp->next) |
|
|
2525 | add (kvp->key, kvp->value); |
|
|
2526 | |
|
|
2527 | reverse (); |
2539 | } |
2528 | } |
2540 | |
2529 | |
2541 | object::depth_iterator::depth_iterator (object *container) |
2530 | object::depth_iterator::depth_iterator (object *container) |
2542 | : iterator_base (container) |
2531 | : iterator_base (container) |
2543 | { |
2532 | { |
… | |
… | |
2626 | object::region () const |
2615 | object::region () const |
2627 | { |
2616 | { |
2628 | return map ? map->region (x, y) |
2617 | return map ? map->region (x, y) |
2629 | : region::default_region (); |
2618 | : region::default_region (); |
2630 | } |
2619 | } |
|
|
2620 | |
|
|
2621 | //+GPL |
2631 | |
2622 | |
2632 | void |
2623 | void |
2633 | object::open_container (object *new_container) |
2624 | object::open_container (object *new_container) |
2634 | { |
2625 | { |
2635 | if (container == new_container) |
2626 | if (container == new_container) |
… | |
… | |
2693 | } |
2684 | } |
2694 | // else if (!old_container->env && contr && contr->ns) |
2685 | // else if (!old_container->env && contr && contr->ns) |
2695 | // contr->ns->floorbox_reset (); |
2686 | // contr->ns->floorbox_reset (); |
2696 | } |
2687 | } |
2697 | |
2688 | |
|
|
2689 | //-GPL |
|
|
2690 | |
|
|
2691 | // prefetch some flat area around the player |
|
|
2692 | static void |
|
|
2693 | prefetch_surrounding_area (object *op, maptile *map, int range) |
|
|
2694 | { |
|
|
2695 | for (maprect *rect = map->split_to_tiles (mapwalk_buf, |
|
|
2696 | op->x - range , op->y - range , |
|
|
2697 | op->x + range + 1, op->y + range + 1); |
|
|
2698 | rect->m; |
|
|
2699 | ++rect) |
|
|
2700 | { |
|
|
2701 | rect->m->touch (); |
|
|
2702 | rect->m->activate (); |
|
|
2703 | } |
|
|
2704 | } |
|
|
2705 | |
|
|
2706 | // prefetch a generous area around the player, also up and down |
|
|
2707 | void |
|
|
2708 | object::prefetch_surrounding_maps () |
|
|
2709 | { |
|
|
2710 | prefetch_surrounding_area (this, map, 40); |
|
|
2711 | |
|
|
2712 | if (maptile *m = map->tile_available (TILE_DOWN)) |
|
|
2713 | prefetch_surrounding_area (this, m, 20); |
|
|
2714 | |
|
|
2715 | if (maptile *m = map->tile_available (TILE_UP)) |
|
|
2716 | prefetch_surrounding_area (this, m, 20); |
|
|
2717 | } |
|
|
2718 | |
|
|
2719 | //+GPL |
|
|
2720 | |
2698 | object * |
2721 | object * |
2699 | object::force_find (shstr_tmp name) |
2722 | object::force_find (shstr_tmp name) |
2700 | { |
2723 | { |
2701 | /* cycle through his inventory to look for the MARK we want to |
2724 | /* cycle through his inventory to look for the MARK we want to |
2702 | * place |
2725 | * place |
2703 | */ |
2726 | */ |
2704 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2727 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2705 | if (tmp->type == FORCE && tmp->slaying == name) |
2728 | if (tmp->type == FORCE && tmp->slaying == name) |
2706 | return splay (tmp); |
2729 | return splay (tmp); |
2707 | |
2730 | |
2708 | return 0; |
2731 | return 0; |
2709 | } |
2732 | } |
2710 | |
2733 | |
2711 | //-GPL |
|
|
2712 | |
|
|
2713 | void |
2734 | void |
2714 | object::force_set_timer (int duration) |
2735 | object::force_set_timer (int duration) |
2715 | { |
2736 | { |
2716 | this->duration = 1; |
2737 | this->duration = 1; |
2717 | this->speed_left = -1.f; |
2738 | this->speed_left = -1.f; |
… | |
… | |
2723 | object::force_add (shstr_tmp name, int duration) |
2744 | object::force_add (shstr_tmp name, int duration) |
2724 | { |
2745 | { |
2725 | if (object *force = force_find (name)) |
2746 | if (object *force = force_find (name)) |
2726 | force->destroy (); |
2747 | force->destroy (); |
2727 | |
2748 | |
2728 | object *force = get_archetype (FORCE_NAME); |
2749 | object *force = archetype::get (FORCE_NAME); |
2729 | |
2750 | |
2730 | force->slaying = name; |
2751 | force->slaying = name; |
2731 | force->force_set_timer (duration); |
2752 | force->force_set_timer (duration); |
2732 | force->flag [FLAG_APPLIED] = true; |
2753 | force->flag [FLAG_APPLIED] = true; |
2733 | |
2754 | |