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.286 by root, Wed Sep 2 16:54:20 2009 UTC vs.
Revision 1.315 by root, Fri Mar 26 21:43:43 2010 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your 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 GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * 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>
22 */ 23 */
23 24
24#include <global.h> 25#include <global.h>
25#include <stdio.h> 26#include <stdio.h>
26#include <sys/types.h> 27#include <sys/types.h>
27#include <sys/uio.h> 28#include <sys/uio.h>
28#include <object.h> 29#include <object.h>
29#include <sproto.h> 30#include <sproto.h>
30#include <loader.h>
31 31
32#include <bitset> 32#include <bitset>
33 33
34UUID UUID::cur; 34UUID UUID::cur;
35static uint64_t seq_next_save; 35static uint64_t seq_next_save;
36static const uint64 UUID_GAP = 1<<19; 36static const uint64 UUID_GAP = 1<<19;
37uint32_t mapspace::smellcount = 10000; 37uint32_t mapspace::smellcount = 10000;
38 38
39objectvec objects; 39objectvec objects;
40activevec actives; 40activevec actives;
41
42//+GPL
41 43
42short freearr_x[SIZEOFFREE] = { 44short freearr_x[SIZEOFFREE] = {
43 0, 45 0,
44 0, 1, 1, 1, 0, -1, -1, -1, 46 0, 1, 1, 1, 0, -1, -1, -1,
45 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 47 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
… …
49 0, 51 0,
50 -1, -1, 0, 1, 1, 1, 0, -1, 52 -1, -1, 0, 1, 1, 1, 0, -1,
51 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, 53 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
52 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 54 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
53}; 55};
54int maxfree[SIZEOFFREE] = {
55 0,
56 9, 10, 13, 14, 17, 18, 21, 22,
57 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
58 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
59};
60int freedir[SIZEOFFREE] = { 56int freedir[SIZEOFFREE] = {
61 0, 57 0,
62 1, 2, 3, 4, 5, 6, 7, 8, 58 1, 2, 3, 4, 5, 6, 7, 8,
63 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 59 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
64 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 60 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
65}; 61};
66 62
63static int maxfree[SIZEOFFREE] = {
64 0,
65 9, 10, 13, 14, 17, 18, 21, 22,
66 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
67 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
68};
69
67static void 70static void
68write_uuid (uval64 skip, bool sync) 71write_uuid (uval64 skip, bool sync)
69{ 72{
70 CALL_BEGIN (2); 73 CALL_BEGIN (2);
71 CALL_ARG_SV (newSVval64 (skip)); 74 CALL_ARG_SV (newSVval64 (skip));
… …
73 CALL_CALL ("cf::write_uuid", G_DISCARD); 76 CALL_CALL ("cf::write_uuid", G_DISCARD);
74 CALL_END; 77 CALL_END;
75} 78}
76 79
77static void 80static void
78read_uuid (void) 81read_uuid ()
79{ 82{
80 char filename[MAX_BUF]; 83 char filename[MAX_BUF];
81 84
82 sprintf (filename, "%s/uuid", settings.localdir); 85 sprintf (filename, "%s/uuid", settings.localdir);
83 86
… …
97 100
98 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); 101 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
99 _exit (1); 102 _exit (1);
100 } 103 }
101 104
102 UUID::BUF buf; 105 char buf [UUID::MAX_LEN];
103 buf[0] = 0; 106 buf[0] = 0;
104 fgets (buf, sizeof (buf), fp); 107 fgets (buf, sizeof (buf), fp);
105 108
106 if (!UUID::cur.parse (buf)) 109 if (!UUID::cur.parse (buf))
107 { 110 {
… …
134 137
135void 138void
136UUID::init () 139UUID::init ()
137{ 140{
138 read_uuid (); 141 read_uuid ();
142}
143
144bool
145UUID::parse (const char *s)
146{
147 if (*s++ != '<' || *s++ != '1' || *s++ != '.')
148 return false;
149
150 seq = 0;
151
152 while (*s != '>')
153 {
154 if (*s < '0')
155 return false;
156
157 // this gives nice branchless code with gcc
158 assert ('0' < 'a' && '0' == 48 && 'a' == 97);
159 int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
160
161 seq = (seq << 4) | digit;
162
163 ++s;
164 }
165
166 return true;
167}
168
169char *
170UUID::append (char *buf) const
171{
172 *buf++ = '<';
173 *buf++ = '1';
174 *buf++ = '.';
175
176 uint64_t seq = this->seq;
177 const int bits = 64;
178 char nz = 0;
179 static const char tohex [] = "0123456789abcdef";
180
181 // assert (len >= 3 + bits / 4 + 1 + 1);
182 for (int i = bits / 4; --i; )
183 {
184 uint8_t digit = seq >> (bits - 4);
185
186 *buf = tohex [digit];
187 nz |= digit;
188 buf += nz ? 1 : 0;
189 seq <<= 4;
190 }
191
192 // last digit is special - always emit
193 uint8_t digit = seq >> (bits - 4);
194 *buf++ = tohex [digit];
195
196 *buf++ = '>';
197
198 return buf;
199}
200
201char *
202UUID::c_str () const
203{
204 static char buf [MAX_LEN];
205 *append (buf) = 0;
206 return buf;
139} 207}
140 208
141/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 209/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
142static bool 210static bool
143compare_ob_value_lists_one (const object *wants, const object *has) 211compare_ob_value_lists_one (const object *wants, const object *has)
… …
179 * Improvements made with merge: Better checking on potion, and also 247 * Improvements made with merge: Better checking on potion, and also
180 * check weight 248 * check weight
181 */ 249 */
182bool object::can_merge_slow (object *ob1, object *ob2) 250bool object::can_merge_slow (object *ob1, object *ob2)
183{ 251{
184 /* A couple quicksanity checks */ 252 /* A couple quick sanity checks */
185 if (ob1 == ob2 253 if (ob1 == ob2
186 || ob1->type != ob2->type 254 || ob1->type != ob2->type
187 || ob1->speed != ob2->speed
188 || ob1->value != ob2->value 255 || ob1->value != ob2->value
189 || ob1->name != ob2->name) 256 || ob1->name != ob2->name
257 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
190 return 0; 258 return 0;
191 259
192 /* Do not merge objects if nrof would overflow, assume nrof 260 /* Do not merge objects if nrof would overflow, assume nrof
193 * is always 0 .. 2**31-1 */ 261 * is always 0 .. 2**31-1 */
194 if (ob1->nrof > 0x7fffffff - ob2->nrof) 262 if (ob1->nrof > 0x7fffffff - ob2->nrof)
… …
215 || ob1->magic != ob2->magic 283 || ob1->magic != ob2->magic
216 || ob1->slaying != ob2->slaying 284 || ob1->slaying != ob2->slaying
217 || ob1->skill != ob2->skill 285 || ob1->skill != ob2->skill
218 || ob1->value != ob2->value 286 || ob1->value != ob2->value
219 || ob1->animation_id != ob2->animation_id 287 || ob1->animation_id != ob2->animation_id
220 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other 288 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
221 || ob1->client_type != ob2->client_type 289 || ob1->client_type != ob2->client_type
222 || ob1->materialname != ob2->materialname 290 || ob1->material != ob2->material
223 || ob1->lore != ob2->lore 291 || ob1->lore != ob2->lore
224 || ob1->subtype != ob2->subtype 292 || ob1->subtype != ob2->subtype
225 || ob1->move_type != ob2->move_type 293 || ob1->move_type != ob2->move_type
226 || ob1->move_block != ob2->move_block 294 || ob1->move_block != ob2->move_block
227 || ob1->move_allow != ob2->move_allow 295 || ob1->move_allow != ob2->move_allow
228 || ob1->move_on != ob2->move_on 296 || ob1->move_on != ob2->move_on
229 || ob1->move_off != ob2->move_off 297 || ob1->move_off != ob2->move_off
230 || ob1->move_slow != ob2->move_slow 298 || ob1->move_slow != ob2->move_slow
231 || ob1->move_slow_penalty != ob2->move_slow_penalty 299 || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
232 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) 300 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
233 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 301 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
234 return 0; 302 return 0;
235 303
236 if ((ob1->flag ^ ob2->flag) 304 if ((ob1->flag ^ ob2->flag)
… …
334 402
335 // the player itself is always on a map, so we will find him here 403 // the player itself is always on a map, so we will find him here
336 // even if our inv is in a player. 404 // even if our inv is in a player.
337 if (envest->is_on_map ()) 405 if (envest->is_on_map ())
338 if (object *pl = envest->ms ().player ()) 406 if (object *pl = envest->ms ().player ())
339 if (pl->container == env) 407 if (pl->container_ () == env)
340 return pl; 408 return pl;
341 } 409 }
342 else 410 else
343 { 411 {
344 // maybe there is a player standing on the same mapspace 412 // maybe there is a player standing on the same mapspace
345 // this will catch the case where "this" is a player 413 // this will catch the case where "this" is a player
346 if (object *pl = ms ().player ()) 414 if (object *pl = ms ().player ())
347 if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look) 415 if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
348 || this == pl->container) 416 || pl->container_ () == this)
349 return pl; 417 return pl;
350 } 418 }
351 } 419 }
352 420
353 return 0; 421 return 0;
… …
431 object_freezer freezer; 499 object_freezer freezer;
432 op->write (freezer); 500 op->write (freezer);
433 return freezer.as_string (); 501 return freezer.as_string ();
434} 502}
435 503
436/* 504char *
437 * get_nearest_part(multi-object, object 2) returns the part of the 505object::as_string ()
438 * multi-object 1 which is closest to the second object.
439 * If it's not a multi-object, it is returned.
440 */
441object *
442get_nearest_part (object *op, const object *pl)
443{ 506{
444 object *tmp, *closest; 507 return dump_object (this);
445 int last_dist, i;
446
447 if (!op->more)
448 return op;
449
450 for (last_dist = distance (op, pl), closest = op, tmp = op->more;
451 tmp;
452 tmp = tmp->more)
453 if ((i = distance (tmp, pl)) < last_dist)
454 closest = tmp, last_dist = i;
455
456 return closest;
457} 508}
458 509
459/* 510/*
460 * Returns the object which has the count-variable equal to the argument. 511 * Returns the object which has the count-variable equal to the argument.
461 * VERRRY slow. 512 * VERRRY slow.
… …
463object * 514object *
464find_object (tag_t i) 515find_object (tag_t i)
465{ 516{
466 for_all_objects (op) 517 for_all_objects (op)
467 if (op->count == i) 518 if (op->count == i)
519 return op;
520
521 return 0;
522}
523
524/*
525 * Returns the object which has the uuid equal to the argument.
526 * MOAR VERRRY slow.
527 */
528
529object *
530find_object_uuid (UUID i)
531{
532 for_all_objects (op)
533 if (op->uuid == i)
468 return op; 534 return op;
469 535
470 return 0; 536 return 0;
471} 537}
472 538
… …
555 update_stats (); 621 update_stats ();
556 622
557 new_draw_info_format (NDI_UNIQUE, 0, this, 623 new_draw_info_format (NDI_UNIQUE, 0, this,
558 "You try to balance all your items at once, " 624 "You try to balance all your items at once, "
559 "but the %s is just too much for your body. " 625 "but the %s is just too much for your body. "
560 "[You need to unapply some items first.]", &ob->name); 626 "[You need to unapply some items first - use the 'body' command to see "
627 "how many items you can wear on a specific body part.]", &ob->name);
561 return false; 628 return false;
562 } 629 }
563 630
564 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); 631 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
565 } 632 }
… …
634 tail = new_link; 701 tail = new_link;
635 } 702 }
636 } 703 }
637 } 704 }
638 705
639 if (speed < 0)
640 dst->speed_left -= rndm ();
641
642 dst->activate (); 706 dst->activate ();
643} 707}
644 708
645void 709void
646object::instantiate () 710object::instantiate ()
647{ 711{
648 if (!uuid.seq) // HACK 712 if (!uuid.seq) // HACK
649 uuid = UUID::gen (); 713 uuid = UUID::gen ();
650 714
715 // TODO: unclean state changes, should nt be done in copy_to AND instantiate
716 if (flag [FLAG_RANDOM_SPEED] && speed)
717 speed_left = - speed - rndm (); // TODO animation
718 else
651 speed_left = -0.1f; 719 speed_left = -1.;
720
652 /* copy the body_info to the body_used - this is only really 721 /* copy the body_info to the body_used - this is only really
653 * need for monsters, but doesn't hurt to do it for everything. 722 * need for monsters, but doesn't hurt to do it for everything.
654 * by doing so, when a monster is created, it has good starting 723 * by doing so, when a monster is created, it has good starting
655 * values for the body_used info, so when items are created 724 * values for the body_used info, so when items are created
656 * for it, they can be properly equipped. 725 * for it, they can be properly equipped.
… …
664object * 733object *
665object::clone () 734object::clone ()
666{ 735{
667 object *neu = create (); 736 object *neu = create ();
668 copy_to (neu); 737 copy_to (neu);
738
739 // TODO: unclean state changes, should not be done in clone AND instantiate
740 if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
741 neu->speed_left = - neu->speed - rndm (); // TODO animation
742
669 neu->map = map; // not copied by copy_to 743 neu->map = map; // not copied by copy_to
670 return neu; 744 return neu;
671} 745}
672 746
673/* 747/*
… …
691 * This function needs to be called whenever the speed of an object changes. 765 * This function needs to be called whenever the speed of an object changes.
692 */ 766 */
693void 767void
694object::set_speed (float speed) 768object::set_speed (float speed)
695{ 769{
696 if (flag [FLAG_FREED] && speed)
697 {
698 LOG (llevError, "Object %s is freed but has speed.\n", &name);
699 speed = 0;
700 }
701
702 this->speed = speed; 770 this->speed = speed;
703 771
704 if (has_active_speed ()) 772 if (has_active_speed ())
705 activate (); 773 activate ();
706 else 774 else
… …
756 824
757 if (!(m.flags_ & P_UPTODATE)) 825 if (!(m.flags_ & P_UPTODATE))
758 /* nop */; 826 /* nop */;
759 else if (action == UP_OBJ_INSERT) 827 else if (action == UP_OBJ_INSERT)
760 { 828 {
829#if 0
761 // this is likely overkill, TODO: revisit (schmorp) 830 // this is likely overkill, TODO: revisit (schmorp)
762 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 831 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
763 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 832 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
764 || (op->is_player () && !(m.flags_ & P_PLAYER)) 833 || (op->is_player () && !(m.flags_ & P_PLAYER))
765 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 834 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
… …
770 || (m.move_slow | op->move_slow) != m.move_slow 839 || (m.move_slow | op->move_slow) != m.move_slow
771 /* This isn't perfect, but I don't expect a lot of objects to 840 /* This isn't perfect, but I don't expect a lot of objects to
772 * have move_allow right now. 841 * have move_allow right now.
773 */ 842 */
774 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block 843 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
775 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
776 m.invalidate (); 844 m.invalidate ();
845#else
846 // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
847 m.invalidate ();
848#endif
777 } 849 }
778 /* if the object is being removed, we can't make intelligent 850 /* if the object is being removed, we can't make intelligent
779 * decisions, because remove_ob can't really pass the object 851 * decisions, because remove_ob can't really pass the object
780 * that is being removed. 852 * that is being removed.
781 */ 853 */
… …
793object::object () 865object::object ()
794{ 866{
795 SET_FLAG (this, FLAG_REMOVED); 867 SET_FLAG (this, FLAG_REMOVED);
796 868
797 //expmul = 1.0; declared const for the time being 869 //expmul = 1.0; declared const for the time being
798 face = blank_face; 870 face = blank_face;
871 material = MATERIAL_NULL;
799} 872}
800 873
801object::~object () 874object::~object ()
802{ 875{
803 unlink (); 876 unlink ();
… …
1033 * the previous environment. 1106 * the previous environment.
1034 */ 1107 */
1035void 1108void
1036object::do_remove () 1109object::do_remove ()
1037{ 1110{
1038 object *tmp, *last = 0;
1039 object *otmp;
1040
1041 if (flag [FLAG_REMOVED]) 1111 if (flag [FLAG_REMOVED])
1042 return; 1112 return;
1043 1113
1044 INVOKE_OBJECT (REMOVE, this); 1114 INVOKE_OBJECT (REMOVE, this);
1045 1115
… …
1077 1147
1078 above = 0; 1148 above = 0;
1079 below = 0; 1149 below = 0;
1080 env = 0; 1150 env = 0;
1081 1151
1082 /* NO_FIX_PLAYER is set when a great many changes are being 1152 if (pl && pl->is_player ())
1083 * made to players inventory. If set, avoiding the call
1084 * to save cpu time.
1085 */
1086 if (pl)
1087 if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1088 { 1153 {
1089 pl->update_stats (); 1154 pl->contr->queue_stats_update ();
1090 1155
1091 if (glow_radius && pl->is_on_map ()) 1156 if (glow_radius && pl->is_on_map ())
1092 update_all_los (pl->map, pl->x, pl->y); 1157 update_all_los (pl->map, pl->x, pl->y);
1093 } 1158 }
1094 } 1159 }
1095 else if (map) 1160 else if (map)
1096 { 1161 {
1097 map->dirty = true; 1162 map->dirty = true;
1098 mapspace &ms = this->ms (); 1163 mapspace &ms = this->ms ();
… …
1111 close_container (); 1176 close_container ();
1112 1177
1113 --map->players; 1178 --map->players;
1114 map->touch (); 1179 map->touch ();
1115 } 1180 }
1116 else if (pl->container == this) 1181 else if (pl->container_ () == this)
1117 { 1182 {
1118 // removing a container should close it 1183 // removing a container should close it
1119 close_container (); 1184 close_container ();
1120 } 1185 }
1121 1186
… …
1137 1202
1138 int check_walk_off = !flag [FLAG_NO_APPLY]; 1203 int check_walk_off = !flag [FLAG_NO_APPLY];
1139 1204
1140 if (object *pl = ms.player ()) 1205 if (object *pl = ms.player ())
1141 { 1206 {
1142 if (pl->container == this) 1207 if (pl->container_ () == this)
1143 /* If a container that the player is currently using somehow gets 1208 /* If a container that the player is currently using somehow gets
1144 * removed (most likely destroyed), update the player view 1209 * removed (most likely destroyed), update the player view
1145 * appropriately. 1210 * appropriately.
1146 */ 1211 */
1147 pl->close_container (); 1212 pl->close_container ();
… …
1151 //TODO: update floorbox to preserve ordering 1216 //TODO: update floorbox to preserve ordering
1152 if (pl->contr->ns) 1217 if (pl->contr->ns)
1153 pl->contr->ns->floorbox_update (); 1218 pl->contr->ns->floorbox_update ();
1154 } 1219 }
1155 1220
1221 if (check_walk_off)
1156 for (tmp = ms.bot; tmp; tmp = tmp->above) 1222 for (object *above, *tmp = ms.bot; tmp; tmp = above)
1157 { 1223 {
1224 above = tmp->above;
1225
1158 /* No point updating the players look faces if he is the object 1226 /* No point updating the players look faces if he is the object
1159 * being removed. 1227 * being removed.
1160 */ 1228 */
1161 1229
1162 /* See if object moving off should effect something */ 1230 /* See if object moving off should effect something */
1163 if (check_walk_off
1164 && ((move_type & tmp->move_off) 1231 if ((move_type & tmp->move_off)
1165 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1232 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1166 {
1167 move_apply (tmp, this, 0); 1233 move_apply (tmp, this, 0);
1168
1169 if (destroyed ())
1170 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1171 } 1234 }
1172
1173 last = tmp;
1174 }
1175 1235
1176 if (affects_los ()) 1236 if (affects_los ())
1177 update_all_los (map, x, y); 1237 update_all_los (map, x, y);
1178 } 1238 }
1179} 1239}
… …
1223 1283
1224 object *prev = this; 1284 object *prev = this;
1225 1285
1226 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) 1286 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1227 { 1287 {
1228 object *op = arch_to_object (at); 1288 object *op = at->instance ();
1229 1289
1230 op->name = name; 1290 op->name = name;
1231 op->name_pl = name_pl; 1291 op->name_pl = name_pl;
1232 op->title = title; 1292 op->title = title;
1233 1293
… …
1271 * Passing 0 for flag gives proper default values, so flag really only needs 1331 * Passing 0 for flag gives proper default values, so flag really only needs
1272 * to be set if special handling is needed. 1332 * to be set if special handling is needed.
1273 * 1333 *
1274 * Return value: 1334 * Return value:
1275 * new object if 'op' was merged with other object 1335 * new object if 'op' was merged with other object
1276 * NULL if 'op' was destroyed 1336 * NULL if there was an error (destroyed, blocked etc.)
1277 * just 'op' otherwise 1337 * just 'op' otherwise
1278 */ 1338 */
1279object * 1339object *
1280insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1340insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1281{ 1341{
… …
1479 * blocked() and wall() work properly), and these flags are updated by 1539 * blocked() and wall() work properly), and these flags are updated by
1480 * update_object(). 1540 * update_object().
1481 */ 1541 */
1482 1542
1483 /* if this is not the head or flag has been passed, don't check walk on status */ 1543 /* if this is not the head or flag has been passed, don't check walk on status */
1484 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) 1544 if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1485 { 1545 {
1486 if (check_move_on (op, originator)) 1546 if (check_move_on (op, originator))
1487 return 0; 1547 return 0;
1488 1548
1489 /* If we are a multi part object, lets work our way through the check 1549 /* If we are a multi part object, lets work our way through the check
… …
1508 1568
1509 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1569 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1510 if (tmp->arch->archname == archname) /* same archetype */ 1570 if (tmp->arch->archname == archname) /* same archetype */
1511 tmp->destroy (); 1571 tmp->destroy ();
1512 1572
1513 object *tmp = arch_to_object (archetype::find (archname)); 1573 object *tmp = archetype::find (archname)->instance ();
1514 1574
1515 tmp->x = op->x; 1575 tmp->x = op->x;
1516 tmp->y = op->y; 1576 tmp->y = op->y;
1517 1577
1518 insert_ob_in_map (tmp, op->map, op, 0); 1578 insert_ob_in_map (tmp, op->map, op, 0);
… …
1523{ 1583{
1524 if (where->env) 1584 if (where->env)
1525 return where->env->insert (this); 1585 return where->env->insert (this);
1526 else 1586 else
1527 return where->map->insert (this, where->x, where->y, originator, flags); 1587 return where->map->insert (this, where->x, where->y, originator, flags);
1588}
1589
1590// check whether we can put this into the map, respect max_volume, max_items
1591bool
1592object::can_drop_at (maptile *m, int x, int y, object *originator)
1593{
1594 mapspace &ms = m->at (x, y);
1595
1596 int items = ms.items ();
1597
1598 if (!items // testing !items ensures we can drop at least one item
1599 || (items < m->max_items
1600 && ms.volume () < m->max_volume))
1601 return true;
1602
1603 if (originator && originator->is_player ())
1604 originator->contr->failmsg (format (
1605 "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1606 query_name ()
1607 ));
1608
1609 return false;
1528} 1610}
1529 1611
1530/* 1612/*
1531 * decrease(object, number) decreases a specified number from 1613 * decrease(object, number) decreases a specified number from
1532 * the amount of an object. If the amount reaches 0, the object 1614 * the amount of an object. If the amount reaches 0, the object
… …
1672 if (op->glow_radius && is_on_map ()) 1754 if (op->glow_radius && is_on_map ())
1673 { 1755 {
1674 update_stats (); 1756 update_stats ();
1675 update_all_los (map, x, y); 1757 update_all_los (map, x, y);
1676 } 1758 }
1677 else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) 1759 else if (is_player ())
1678 // if this is a player's inventory, update stats 1760 // if this is a player's inventory, update stats
1679 update_stats (); 1761 contr->queue_stats_update ();
1680 1762
1681 INVOKE_OBJECT (INSERT, this); 1763 INVOKE_OBJECT (INSERT, this);
1682 1764
1683 return op; 1765 return op;
1684} 1766}
… …
1704 * on top. 1786 * on top.
1705 */ 1787 */
1706int 1788int
1707check_move_on (object *op, object *originator) 1789check_move_on (object *op, object *originator)
1708{ 1790{
1791 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1792 return 0;
1793
1709 object *tmp; 1794 object *tmp;
1710 maptile *m = op->map; 1795 maptile *m = op->map;
1711 int x = op->x, y = op->y; 1796 int x = op->x, y = op->y;
1712 1797
1713 MoveType move_on, move_slow, move_block; 1798 mapspace &ms = m->at (x, y);
1714 1799
1715 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1800 ms.update ();
1716 return 0;
1717 1801
1718 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1802 MoveType move_on = ms.move_on;
1719 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1803 MoveType move_slow = ms.move_slow;
1720 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1804 MoveType move_block = ms.move_block;
1721 1805
1722 /* if nothing on this space will slow op down or be applied, 1806 /* if nothing on this space will slow op down or be applied,
1723 * no need to do checking below. have to make sure move_type 1807 * no need to do checking below. have to make sure move_type
1724 * is set, as lots of objects don't have it set - we treat that 1808 * is set, as lots of objects don't have it set - we treat that
1725 * as walking. 1809 * as walking.
… …
1736 return 0; 1820 return 0;
1737 1821
1738 /* The objects have to be checked from top to bottom. 1822 /* The objects have to be checked from top to bottom.
1739 * Hence, we first go to the top: 1823 * Hence, we first go to the top:
1740 */ 1824 */
1741 1825 for (object *next, *tmp = ms.top; tmp; tmp = next)
1742 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1743 {
1744 /* Trim the search when we find the first other spell effect
1745 * this helps performance so that if a space has 50 spell objects,
1746 * we don't need to check all of them.
1747 */
1748 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1749 break;
1750 } 1826 {
1827 next = tmp->below;
1751 1828
1752 for (; tmp; tmp = tmp->below)
1753 {
1754 if (tmp == op) 1829 if (tmp == op)
1755 continue; /* Can't apply yourself */ 1830 continue; /* Can't apply yourself */
1756 1831
1757 /* Check to see if one of the movement types should be slowed down. 1832 /* Check to see if one of the movement types should be slowed down.
1758 * Second check makes sure that the movement types not being slowed 1833 * Second check makes sure that the movement types not being slowed
… …
1763 if (!QUERY_FLAG (op, FLAG_WIZPASS)) 1838 if (!QUERY_FLAG (op, FLAG_WIZPASS))
1764 { 1839 {
1765 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1840 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1766 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1841 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1767 { 1842 {
1768
1769 float
1770 diff = tmp->move_slow_penalty * fabs (op->speed); 1843 float diff = tmp->move_slow_penalty * fabs (op->speed);
1771 1844
1772 if (op->is_player ()) 1845 if (op->is_player ())
1773 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1846 if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1774 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1847 (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1775 diff /= 4.0; 1848 diff /= 4.0;
1776 1849
1777 op->speed_left -= diff; 1850 op->speed_left -= diff;
1778 } 1851 }
1779 } 1852 }
… …
2180 * This basically means that if direction is 15, then it could either go 2253 * This basically means that if direction is 15, then it could either go
2181 * direction 4, 14, or 16 to get back to where we are. 2254 * direction 4, 14, or 16 to get back to where we are.
2182 * Moved from spell_util.c to object.c with the other related direction 2255 * Moved from spell_util.c to object.c with the other related direction
2183 * functions. 2256 * functions.
2184 */ 2257 */
2185const int reduction_dir[SIZEOFFREE][3] = { 2258static const int reduction_dir[SIZEOFFREE][3] = {
2186 {0, 0, 0}, /* 0 */ 2259 {0, 0, 0}, /* 0 */
2187 {0, 0, 0}, /* 1 */ 2260 {0, 0, 0}, /* 1 */
2188 {0, 0, 0}, /* 2 */ 2261 {0, 0, 0}, /* 2 */
2189 {0, 0, 0}, /* 3 */ 2262 {0, 0, 0}, /* 3 */
2190 {0, 0, 0}, /* 4 */ 2263 {0, 0, 0}, /* 4 */
… …
2461{ 2534{
2462 return map ? map->region (x, y) 2535 return map ? map->region (x, y)
2463 : region::default_region (); 2536 : region::default_region ();
2464} 2537}
2465 2538
2466const materialtype_t *
2467object::dominant_material () const
2468{
2469 if (materialtype_t *mt = name_to_material (materialname))
2470 return mt;
2471
2472 return name_to_material (shstr_unknown);
2473}
2474
2475void 2539void
2476object::open_container (object *new_container) 2540object::open_container (object *new_container)
2477{ 2541{
2478 if (container == new_container) 2542 if (container == new_container)
2479 return; 2543 return;
… …
2513 // TODO: this does not seem to serve any purpose anymore? 2577 // TODO: this does not seem to serve any purpose anymore?
2514#if 0 2578#if 0
2515 // insert the "Close Container" object. 2579 // insert the "Close Container" object.
2516 if (archetype *closer = new_container->other_arch) 2580 if (archetype *closer = new_container->other_arch)
2517 { 2581 {
2518 object *closer = arch_to_object (new_container->other_arch); 2582 object *closer = new_container->other_arch->instance ();
2519 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2583 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2520 new_container->insert (closer); 2584 new_container->insert (closer);
2521 } 2585 }
2522#endif 2586#endif
2523 2587
… …
2549 return splay (tmp); 2613 return splay (tmp);
2550 2614
2551 return 0; 2615 return 0;
2552} 2616}
2553 2617
2618//-GPL
2619
2620void
2621object::force_set_timer (int duration)
2622{
2623 this->duration = 1;
2624 this->speed_left = -1.f;
2625
2626 this->set_speed (duration ? 1.f / duration : 0.f);
2627}
2628
2554object * 2629object *
2555object::force_add (shstr_tmp name, int duration) 2630object::force_add (shstr_tmp name, int duration)
2556{ 2631{
2557 if (object *force = force_find (name)) 2632 if (object *force = force_find (name))
2558 force->destroy (); 2633 force->destroy ();
2559 2634
2560 object *force = get_archetype (FORCE_NAME); 2635 object *force = get_archetype (FORCE_NAME);
2561 2636
2562 force->slaying = name; 2637 force->slaying = name;
2563 force->stats.food = 1; 2638 force->force_set_timer (duration);
2564 force->speed_left = -1.f;
2565
2566 force->set_speed (duration ? 1.f / duration : 0.f);
2567 force->flag [FLAG_IS_USED_UP] = true;
2568 force->flag [FLAG_APPLIED] = true; 2639 force->flag [FLAG_APPLIED] = true;
2569 2640
2570 return insert (force); 2641 return insert (force);
2571} 2642}
2572 2643
2573void 2644void
… …
2622 2693
2623 insert (force); 2694 insert (force);
2624 } 2695 }
2625} 2696}
2626 2697
2698void object::change_move_type (MoveType mt)
2699{
2700 if (move_type == mt)
2701 return;
2702
2703 if (is_on_map ())
2704 {
2705 // we are on the map, so handle move_on/off effects
2706 remove ();
2707 move_type = mt;
2708 map->insert (this, x, y, this);
2709 }
2710 else
2711 move_type = mt;
2712}
2713

Diff Legend

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