ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.337 by root, Thu May 6 21:45:49 2010 UTC vs.
Revision 1.358 by root, Sun Nov 25 15:50:20 2012 UTC

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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 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>
… …
71 9, 10, 13, 14, 17, 18, 21, 22, 71 9, 10, 13, 14, 17, 18, 21, 22,
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
76const char *wall_suffix[16] = {
77 "0",
78 "1_3",
79 "1_4",
80 "2_1_2",
81 "1_2",
82 "2_2_4",
83 "2_2_1",
84 "3_1",
85 "1_1",
86 "2_2_3",
87 "2_2_2",
88 "3_3",
89 "2_1_1",
90 "3_4",
91 "3_2",
92 "4"
93};
94
76static void 95static void
77write_uuid (uval64 skip, bool sync) 96write_uuid (uval64 skip, bool sync)
78{ 97{
79 CALL_BEGIN (2); 98 CALL_BEGIN (2);
80 CALL_ARG_SV (newSVval64 (skip)); 99 CALL_ARG_SV (newSVval64 (skip));
… …
214 233
215/* 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. */
216static bool 235static bool
217compare_ob_value_lists_one (const object *wants, const object *has) 236compare_ob_value_lists_one (const object *wants, const object *has)
218{ 237{
219 /* n-squared behaviour (see kv_get), but I'm hoping both 238 /* n-squared behaviour (see kv.get), but I'm hoping both
220 * 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
221 * different structure or at least keep the lists sorted... 240 * different structure or at least keep the lists sorted...
222 */ 241 */
223 242
224 /* For each field in wants, */ 243 /* For each field in wants, */
225 for (key_value *kv = wants->key_values; kv; kv = kv->next) 244 for (key_value *kv = wants->kv.first; kv; kv = kv->next)
226 if (has->kv_get (kv->key) != kv->value) 245 if (has->kv.get (kv->key) != kv->value)
227 return false; 246 return false;
228 247
229 /* 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. */
230 return true; 249 return true;
231} 250}
… …
255 */ 274 */
256bool object::can_merge_slow (object *ob1, object *ob2) 275bool object::can_merge_slow (object *ob1, object *ob2)
257{ 276{
258 /* A couple quick sanity checks */ 277 /* A couple quick sanity checks */
259 if (ob1 == ob2 278 if (ob1 == ob2
260 || ob1->type != ob2->type 279 || ob1->type != ob2->type
261 || ob1->value != ob2->value 280 || ob1->value != ob2->value
262 || ob1->name != ob2->name 281 || ob1->name != ob2->name
282 || ob1->custom_name != ob2->custom_name
263 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED) 283 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
264 return 0; 284 return 0;
265 285
266 /* Do not merge objects if nrof would overflow, assume nrof 286 /* Do not merge objects if nrof would overflow, assume nrof
267 * is always 0 .. 2**31-1 */ 287 * is always 0 .. 2**31-1 */
… …
353 if (ob1->level != ob2->level) 373 if (ob1->level != ob2->level)
354 return 0; 374 return 0;
355 break; 375 break;
356 } 376 }
357 377
358 if (ob1->key_values || ob2->key_values) 378 if (!ob1->kv.empty () || !ob2->kv.empty ())
359 { 379 {
360 /* At least one of these has key_values. */ 380 /* At least one of these has key_values. */
361 if ((!ob1->key_values) != (!ob2->key_values)) 381 if (ob1->kv.empty () != ob2->kv.empty ())
362 return 0; /* One has fields, but the other one doesn't. */ 382 return 0; /* One has fields, but the other one doesn't. */
363 383
364 if (!compare_ob_value_lists (ob1, ob2)) 384 if (!compare_ob_value_lists (ob1, ob2))
365 return 0; 385 return 0;
366 } 386 }
… …
426 446
427 return 0; 447 return 0;
428} 448}
429 449
430// adjust weight per container type ("of holding") 450// adjust weight per container type ("of holding")
431static uint32 451static weight_t
432weight_adjust_for (object *op, uint32 weight) 452weight_adjust_for (object *op, weight_t weight)
433{ 453{
434 return op->type == CONTAINER 454 if (op->type == CONTAINER)
435 ? weight - weight * op->stats.Str / 100 455 weight -= weight * op->stats.Str / 100;
436 : weight; 456
457 return weight;
437} 458}
438 459
439/* 460/*
440 * subtracts, then adds, the specified weight to an object, 461 * subtracts, then adds, the specified weight to an object,
441 * and also updates how much the environment(s) is/are carrying. 462 * and also updates how much the environment(s) is/are carrying.
442 */ 463 */
443static void 464static void
444adjust_weight (object *op, sint32 sub, sint32 add) 465adjust_weight (object *op, weight_t sub, weight_t add)
445{ 466{
446 while (op) 467 while (op)
447 { 468 {
448 sint32 ocarrying = op->carrying; 469 weight_t carrying = (weight_t)op->carrying
470 - weight_adjust_for (op, sub)
471 + weight_adjust_for (op, add);
449 472
450 op->carrying -= weight_adjust_for (op, sub); 473 sub = op->carrying;
451 op->carrying += weight_adjust_for (op, add); 474 op->carrying = carrying;
475 add = op->carrying;
452 476
453 if (object *pl = op->visible_to ()) 477 if (object *pl = op->visible_to ())
454 if (pl != op) // player is handled lazily 478 if (pl != op) // player is handled lazily
455 esrv_update_item (UPD_WEIGHT, pl, op); 479 esrv_update_item (UPD_WEIGHT, pl, op);
456 480
457 sub = ocarrying;
458 add = op->carrying;
459
460 op = op->env; 481 op = op->env;
461 } 482 }
462} 483}
463 484
464/* 485/*
… …
467 * containers are carrying, and sums it up. 488 * containers are carrying, and sums it up.
468 */ 489 */
469void 490void
470object::update_weight () 491object::update_weight ()
471{ 492{
472 sint32 sum = 0; 493 weight_t sum = 0;
473 494
474 for (object *op = inv; op; op = op->below) 495 for (object *op = inv; op; op = op->below)
475 { 496 {
476 op->update_weight (); 497 op->update_weight ();
477 498
… …
577 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 ());
578 return; 599 return;
579 } 600 }
580 601
581 this->owner = owner; 602 this->owner = owner;
582}
583
584/* Zero the key_values on op, decrementing the shared-string
585 * refcounts and freeing the links.
586 */
587static void
588free_key_values (object *op)
589{
590 for (key_value *i = op->key_values; i; )
591 {
592 key_value *next = i->next;
593 delete i;
594
595 i = next;
596 }
597
598 op->key_values = 0;
599} 603}
600 604
601/* 605/*
602 * copy_to first frees everything allocated by the dst object, 606 * copy_to first frees everything allocated by the dst object,
603 * and then copies the contents of itself into the second 607 * and then copies the contents of itself into the second
… …
609void 613void
610object::copy_to (object *dst) 614object::copy_to (object *dst)
611{ 615{
612 dst->remove (); 616 dst->remove ();
613 *(object_copy *)dst = *this; 617 *(object_copy *)dst = *this;
618
619 // maybe move to object_copy?
620 dst->kv = kv;
621
614 dst->flag [FLAG_REMOVED] = true; 622 dst->flag [FLAG_REMOVED] = true;
615
616 /* Copy over key_values, if any. */
617 if (key_values)
618 {
619 key_value *tail = 0;
620 dst->key_values = 0;
621
622 for (key_value *i = key_values; i; i = i->next)
623 {
624 key_value *new_link = new key_value;
625
626 new_link->next = 0;
627 new_link->key = i->key;
628 new_link->value = i->value;
629
630 /* Try and be clever here, too. */
631 if (!dst->key_values)
632 {
633 dst->key_values = new_link;
634 tail = new_link;
635 }
636 else
637 {
638 tail->next = new_link;
639 tail = new_link;
640 }
641 }
642 }
643
644 dst->activate (); 623 dst->activate ();
645} 624}
646 625
647void 626void
648object::instantiate () 627object::instantiate ()
649{ 628{
650 if (!uuid.seq) // HACK 629 if (!uuid.seq) // HACK
651 uuid = UUID::gen (); 630 uuid = UUID::gen ();
652 631
653 // TODO: unclean state changes, should nt be done in copy_to AND instantiate 632 // TODO: unclean state changes, should not be done in copy_to AND instantiate
654 if (flag [FLAG_RANDOM_SPEED] && speed) 633 if (flag [FLAG_RANDOM_SPEED] && speed)
655 speed_left = - speed - rndm (); // TODO animation 634 speed_left = - speed - rndm (); // TODO animation
656 else 635 else
657 speed_left = -1.; 636 speed_left = -1.;
658 637
659 /* 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
660 * 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.
661 * 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
662 * values for the body_used info, so when items are created 641 * values for the body_used info, so when items are created
663 * for it, they can be properly equipped. 642 * for it, they can be properly equipped.
664 */ 643 */
665 for (int i = NUM_BODY_LOCATIONS; i--; ) 644 for (int i = NUM_BODY_LOCATIONS; i--; )
666 slot[i].used = slot[i].info; 645 slot[i].used = slot[i].info;
667 646
… …
759 } 738 }
760 739
761 mapspace &m = op->ms (); 740 mapspace &m = op->ms ();
762 741
763 if (!(m.flags_ & P_UPTODATE)) 742 if (!(m.flags_ & P_UPTODATE))
764 /* nop */; 743 m.update_up (); // nothing to do except copy up
765 else if (action == UP_OBJ_INSERT) 744 else if (action == UP_OBJ_INSERT)
766 { 745 {
767#if 0 746#if 0
768 // this is likely overkill, TODO: revisit (schmorp) 747 // this is likely overkill, TODO: revisit (schmorp)
769 if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW)) 748 if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW))
… …
790 * that is being removed. 769 * that is being removed.
791 */ 770 */
792 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 771 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
793 m.invalidate (); 772 m.invalidate ();
794 else if (action == UP_OBJ_FACE) 773 else if (action == UP_OBJ_FACE)
795 /* Nothing to do for that case */ ; 774 m.update_up (); // nothing to do for that case, except copy up
796 else 775 else
797 LOG (llevError, "update_object called with invalid action: %d\n", action); 776 LOG (llevError, "update_object called with invalid action: %d\n", action);
798 777
799 if (op->more) 778 if (op->more)
800 update_object (op->more, action); 779 update_object (op->more, action);
… …
811 790
812object::~object () 791object::~object ()
813{ 792{
814 unlink (); 793 unlink ();
815 794
816 free_key_values (this); 795 kv.clear ();
817} 796}
818 797
819void object::link () 798void object::link ()
820{ 799{
821 assert (!index);//D 800 assert (!index);//D
… …
920 * if some form of movement is allowed, let objects 899 * if some form of movement is allowed, let objects
921 * drop on that space. 900 * drop on that space.
922 */ 901 */
923 if (!drop_to_ground 902 if (!drop_to_ground
924 || !map 903 || !map
925 || map->in_memory != MAP_ACTIVE 904 || !map->linkable ()
926 || map->no_drop 905 || map->no_drop
927 || ms ().move_block == MOVE_ALL) 906 || ms ().move_block == MOVE_ALL)
928 { 907 {
929 while (inv) 908 while (inv)
930 inv->destroy (); 909 inv->destroy ();
… …
1027 1006
1028 freelist = li; 1007 freelist = li;
1029 ++free_count; 1008 ++free_count;
1030} 1009}
1031 1010
1032static struct freed_map : maptile
1033{
1034 freed_map ()
1035 : maptile (3, 3)
1036 {
1037 path = "<freed objects map>";
1038 name = "/internal/freed_objects_map";
1039 no_drop = 1;
1040 no_reset = 1;
1041
1042 in_memory = MAP_ACTIVE;
1043 }
1044
1045 ~freed_map ()
1046 {
1047 destroy ();
1048 }
1049} freed_map; // freed objects are moved here to avoid crashes
1050
1051void 1011void
1052object::do_destroy () 1012object::do_destroy ()
1053{ 1013{
1054 if (flag [FLAG_IS_LINKED]) 1014 if (flag [FLAG_IS_LINKED])
1055 remove_link (); 1015 remove_link ();
… …
1163 1123
1164 if (pl && pl->is_player ()) 1124 if (pl && pl->is_player ())
1165 { 1125 {
1166 if (expect_false (pl->contr->combat_ob == this)) 1126 if (expect_false (pl->contr->combat_ob == this))
1167 { 1127 {
1168 pl->apply (pl->contr->combat_ob, AP_UNAPPLY); 1128 pl->apply (pl->contr->combat_ob, AP_UNAPPLY | AP_IGNORE_CURSE);
1169 pl->contr->combat_ob = 0; 1129 pl->contr->combat_ob = 0;
1170 if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob); 1130 if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
1171 } 1131 }
1172 1132
1173 if (expect_false (pl->contr->ranged_ob == this)) 1133 if (expect_false (pl->contr->ranged_ob == this))
1174 { 1134 {
1175 pl->apply (pl->contr->ranged_ob, AP_UNAPPLY); 1135 pl->apply (pl->contr->ranged_ob, AP_UNAPPLY | AP_IGNORE_CURSE);
1176 pl->contr->ranged_ob = 0; 1136 pl->contr->ranged_ob = 0;
1177 if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob); 1137 if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
1178 } 1138 }
1179 1139
1180 pl->contr->queue_stats_update (); 1140 pl->contr->queue_stats_update ();
… …
1220 1180
1221 above = 0; 1181 above = 0;
1222 below = 0; 1182 below = 0;
1223 1183
1224 ms.invalidate (); 1184 ms.invalidate ();
1225
1226 if (map->in_memory == MAP_SAVING)
1227 return;
1228 1185
1229 int check_walk_off = !flag [FLAG_NO_APPLY]; 1186 int check_walk_off = !flag [FLAG_NO_APPLY];
1230 1187
1231 if (object *pl = ms.player ()) 1188 if (object *pl = ms.player ())
1232 { 1189 {
… …
1367{ 1324{
1368 op->remove (); 1325 op->remove ();
1369 1326
1370 if (m == &freed_map)//D TODO: remove soon 1327 if (m == &freed_map)//D TODO: remove soon
1371 {//D 1328 {//D
1372 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
1373 }//D 1330 }//D
1374 1331
1375 /* Ideally, the caller figures this out. However, it complicates a lot 1332 /* Ideally, the caller figures this out. However, it complicates a lot
1376 * 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
1377 * need extra work 1334 * need extra work
… …
1624 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
1625 || (items < m->max_items 1582 || (items < m->max_items
1626 && ms.volume () < m->max_volume)) 1583 && ms.volume () < m->max_volume))
1627 return true; 1584 return true;
1628 1585
1629 if (originator && originator->is_player ()) 1586 if (originator)
1630 originator->contr->failmsgf ( 1587 originator->failmsgf (
1631 "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.>",
1632 query_name () 1589 query_name ()
1633 ); 1590 );
1634 1591
1635 return false; 1592 return false;
1636} 1593}
… …
1650 1607
1651 nr = min (nr, nrof); 1608 nr = min (nr, nrof);
1652 1609
1653 if (nrof > nr) 1610 if (nrof > nr)
1654 { 1611 {
1655 sint64 oweight = total_weight (); 1612 weight_t oweight = total_weight ();
1656 1613
1657 nrof -= nr; 1614 nrof -= nr;
1658 1615
1659 if (object *pl = visible_to ()) 1616 if (object *pl = visible_to ())
1660 esrv_update_item (UPD_NROF, pl, this); 1617 esrv_update_item (UPD_NROF, pl, this);
… …
1744 if (object::can_merge (tmp, op)) 1701 if (object::can_merge (tmp, op))
1745 { 1702 {
1746 /* return the original object and remove inserted object 1703 /* return the original object and remove inserted object
1747 (client prefers the original object) */ 1704 (client prefers the original object) */
1748 1705
1749 // carring must be 0 for mergable objects 1706 // carrying must be 0 for mergable objects
1750 sint64 oweight = tmp->weight * tmp->nrof; 1707 weight_t oweight = weight_t (tmp->weight) * tmp->nrof;
1751 1708
1752 tmp->nrof += op->nrof; 1709 tmp->nrof += op->nrof;
1753 1710
1754 if (object *pl = tmp->visible_to ()) 1711 if (object *pl = tmp->visible_to ())
1755 esrv_update_item (UPD_NROF, pl, tmp); 1712 esrv_update_item (UPD_NROF, pl, tmp);
1756 1713
1757 adjust_weight (this, oweight, tmp->weight * tmp->nrof); 1714 adjust_weight (this, oweight, weight_t (tmp->weight) * tmp->nrof);
1758 1715
1759 op->destroy (); 1716 op->destroy ();
1760 op = tmp; 1717 op = tmp;
1761 goto inserted; 1718 goto inserted;
1762 } 1719 }
… …
2052 */ 2009 */
2053int 2010int
2054find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 2011find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2055{ 2012{
2056 int altern[SIZEOFFREE]; 2013 int altern[SIZEOFFREE];
2057 int index = 0, flag; 2014 int index = 0;
2058 2015
2059 for (int i = start; i < stop; i++) 2016 for (int i = start; i < stop; i++)
2060 { 2017 {
2061 mapxy pos (m, x, y); pos.move (i); 2018 mapxy pos (m, x, y); pos.move (i);
2062 2019
… …
2174 * there is capable of. 2131 * there is capable of.
2175 */ 2132 */
2176int 2133int
2177find_dir (maptile *m, int x, int y, object *exclude) 2134find_dir (maptile *m, int x, int y, object *exclude)
2178{ 2135{
2179 int max = SIZEOFFREE, mflags; 2136 int max = SIZEOFFREE;
2180 MoveType move_type; 2137 MoveType move_type;
2181 2138
2182 if (exclude && exclude->head_ () != exclude) 2139 if (exclude && exclude->head_ () != exclude)
2183 { 2140 {
2184 exclude = exclude->head; 2141 exclude = exclude->head;
… …
2435 return /*who->flag [FLAG_WIZ]|| */ 2392 return /*who->flag [FLAG_WIZ]|| */
2436 (item->weight > 0 && !item->flag [FLAG_NO_PICK] && 2393 (item->weight > 0 && !item->flag [FLAG_NO_PICK] &&
2437 !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));
2438} 2395}
2439 2396
2397//-GPL
2398
2440/* 2399/*
2441 * create clone from object to another 2400 * create clone from object to another
2442 */ 2401 */
2443object * 2402object *
2444object::deep_clone () 2403object::deep_clone ()
… …
2474 return tmp; 2433 return tmp;
2475 2434
2476 return 0; 2435 return 0;
2477} 2436}
2478 2437
2438/* Zero the key_values on op, decrementing the shared-string
2439 * refcounts and freeing the links.
2440 */
2441void
2442key_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
2479shstr_tmp 2454shstr_tmp
2480object::kv_get (shstr_tmp key) const 2455key_values::get (shstr_tmp key) const
2481{ 2456{
2482 for (key_value *kv = key_values; kv; kv = kv->next) 2457 for (key_value *kv = first; kv; kv = kv->next)
2483 if (kv->key == key) 2458 if (kv->key == key)
2484 return kv->value; 2459 return kv->value;
2485 2460
2486 return shstr (); 2461 return shstr ();
2487} 2462}
2488 2463
2489void 2464void
2465key_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
2476void
2490object::kv_set (shstr_tmp key, shstr_tmp value) 2477key_values::set (shstr_tmp key, shstr_tmp value)
2491{ 2478{
2492 for (key_value *kv = key_values; kv; kv = kv->next) 2479 for (key_value *kv = first; kv; kv = kv->next)
2493 if (kv->key == key) 2480 if (kv->key == key)
2494 { 2481 {
2495 kv->value = value; 2482 kv->value = value;
2496 return; 2483 return;
2497 } 2484 }
2498 2485
2499 key_value *kv = new key_value; 2486 add (key, value);
2500
2501 kv->next = key_values;
2502 kv->key = key;
2503 kv->value = value;
2504
2505 key_values = kv;
2506} 2487}
2507 2488
2508void 2489void
2509object::kv_del (shstr_tmp key) 2490key_values::del (shstr_tmp key)
2510{ 2491{
2511 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) 2492 for (key_value **kvp = &first; *kvp; kvp = &(*kvp)->next)
2512 if ((*kvp)->key == key) 2493 if ((*kvp)->key == key)
2513 { 2494 {
2514 key_value *kv = *kvp; 2495 key_value *kv = *kvp;
2515 *kvp = (*kvp)->next; 2496 *kvp = (*kvp)->next;
2516 delete kv; 2497 delete kv;
2517 return; 2498 return;
2518 } 2499 }
2500}
2501
2502void
2503key_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
2519key_values &
2520key_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 ();
2519} 2528}
2520 2529
2521object::depth_iterator::depth_iterator (object *container) 2530object::depth_iterator::depth_iterator (object *container)
2522: iterator_base (container) 2531: iterator_base (container)
2523{ 2532{
… …
2606object::region () const 2615object::region () const
2607{ 2616{
2608 return map ? map->region (x, y) 2617 return map ? map->region (x, y)
2609 : region::default_region (); 2618 : region::default_region ();
2610} 2619}
2620
2621//+GPL
2611 2622
2612void 2623void
2613object::open_container (object *new_container) 2624object::open_container (object *new_container)
2614{ 2625{
2615 if (container == new_container) 2626 if (container == new_container)
… …
2673 } 2684 }
2674// else if (!old_container->env && contr && contr->ns) 2685// else if (!old_container->env && contr && contr->ns)
2675// contr->ns->floorbox_reset (); 2686// contr->ns->floorbox_reset ();
2676} 2687}
2677 2688
2689//-GPL
2690
2691// prefetch some flat area around the player
2692static void
2693prefetch_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
2707void
2708object::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
2678object * 2721object *
2679object::force_find (shstr_tmp name) 2722object::force_find (shstr_tmp name)
2680{ 2723{
2681 /* 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
2682 * place 2725 * place
… …
2686 return splay (tmp); 2729 return splay (tmp);
2687 2730
2688 return 0; 2731 return 0;
2689} 2732}
2690 2733
2691//-GPL
2692
2693void 2734void
2694object::force_set_timer (int duration) 2735object::force_set_timer (int duration)
2695{ 2736{
2696 this->duration = 1; 2737 this->duration = 1;
2697 this->speed_left = -1.f; 2738 this->speed_left = -1.f;
… …
2703object::force_add (shstr_tmp name, int duration) 2744object::force_add (shstr_tmp name, int duration)
2704{ 2745{
2705 if (object *force = force_find (name)) 2746 if (object *force = force_find (name))
2706 force->destroy (); 2747 force->destroy ();
2707 2748
2708 object *force = get_archetype (FORCE_NAME); 2749 object *force = archetype::get (FORCE_NAME);
2709 2750
2710 force->slaying = name; 2751 force->slaying = name;
2711 force->force_set_timer (duration); 2752 force->force_set_timer (duration);
2712 force->flag [FLAG_APPLIED] = true; 2753 force->flag [FLAG_APPLIED] = true;
2713 2754
… …
2797 return contr->mark; 2838 return contr->mark;
2798 else 2839 else
2799 return 0; 2840 return 0;
2800} 2841}
2801 2842
2843// put marked object first in the inventory
2844// this is used by identify-like spells so players can influence
2845// the order a bit.
2846void
2847object::splay_marked ()
2848{
2849 if (object *marked = mark ())
2850 splay (marked);
2851}
2852

Diff Legend

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