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.326 by root, Thu Apr 15 00:56:40 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
42freelist_item *object::freelist;
43uint32_t object::object_count;
44uint32_t object::free_count;
45uint32_t object::create_count;
46uint32_t object::destroy_count;
47
48//+GPL
41 49
42short freearr_x[SIZEOFFREE] = { 50short freearr_x[SIZEOFFREE] = {
43 0, 51 0,
44 0, 1, 1, 1, 0, -1, -1, -1, 52 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, 53 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
49 0, 57 0,
50 -1, -1, 0, 1, 1, 1, 0, -1, 58 -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, 59 -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 60 -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}; 61};
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] = { 62int freedir[SIZEOFFREE] = {
61 0, 63 0,
62 1, 2, 3, 4, 5, 6, 7, 8, 64 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, 65 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 66 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}; 67};
66 68
69static int maxfree[SIZEOFFREE] = {
70 0,
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,
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};
75
67static void 76static void
68write_uuid (uval64 skip, bool sync) 77write_uuid (uval64 skip, bool sync)
69{ 78{
70 CALL_BEGIN (2); 79 CALL_BEGIN (2);
71 CALL_ARG_SV (newSVval64 (skip)); 80 CALL_ARG_SV (newSVval64 (skip));
73 CALL_CALL ("cf::write_uuid", G_DISCARD); 82 CALL_CALL ("cf::write_uuid", G_DISCARD);
74 CALL_END; 83 CALL_END;
75} 84}
76 85
77static void 86static void
78read_uuid (void) 87read_uuid ()
79{ 88{
80 char filename[MAX_BUF]; 89 char filename[MAX_BUF];
81 90
82 sprintf (filename, "%s/uuid", settings.localdir); 91 sprintf (filename, "%s/uuid", settings.localdir);
83 92
97 106
98 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); 107 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
99 _exit (1); 108 _exit (1);
100 } 109 }
101 110
102 UUID::BUF buf; 111 char buf [UUID::MAX_LEN];
103 buf[0] = 0; 112 buf[0] = 0;
104 fgets (buf, sizeof (buf), fp); 113 fgets (buf, sizeof (buf), fp);
105 114
106 if (!UUID::cur.parse (buf)) 115 if (!UUID::cur.parse (buf))
107 { 116 {
134 143
135void 144void
136UUID::init () 145UUID::init ()
137{ 146{
138 read_uuid (); 147 read_uuid ();
148}
149
150bool
151UUID::parse (const char *s)
152{
153 if (*s++ != '<' || *s++ != '1' || *s++ != '.')
154 return false;
155
156 seq = 0;
157
158 while (*s != '>')
159 {
160 if (*s < '0')
161 return false;
162
163 // this gives nice branchless code with gcc
164 assert ('0' < 'a' && '0' == 48 && 'a' == 97);
165 int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
166
167 seq = (seq << 4) | digit;
168
169 ++s;
170 }
171
172 return true;
173}
174
175char *
176UUID::append (char *buf) const
177{
178 *buf++ = '<';
179 *buf++ = '1';
180 *buf++ = '.';
181
182 uint64_t seq = this->seq;
183 const int bits = 64;
184 char nz = 0;
185 static const char tohex [] = "0123456789abcdef";
186
187 // assert (len >= 3 + bits / 4 + 1 + 1);
188 for (int i = bits / 4; --i; )
189 {
190 uint8_t digit = seq >> (bits - 4);
191
192 *buf = tohex [digit];
193 nz |= digit;
194 buf += nz ? 1 : 0;
195 seq <<= 4;
196 }
197
198 // last digit is special - always emit
199 uint8_t digit = seq >> (bits - 4);
200 *buf++ = tohex [digit];
201
202 *buf++ = '>';
203
204 return buf;
205}
206
207char *
208UUID::c_str () const
209{
210 static char buf [MAX_LEN];
211 *append (buf) = 0;
212 return buf;
139} 213}
140 214
141/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 215/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
142static bool 216static bool
143compare_ob_value_lists_one (const object *wants, const object *has) 217compare_ob_value_lists_one (const object *wants, const object *has)
179 * Improvements made with merge: Better checking on potion, and also 253 * Improvements made with merge: Better checking on potion, and also
180 * check weight 254 * check weight
181 */ 255 */
182bool object::can_merge_slow (object *ob1, object *ob2) 256bool object::can_merge_slow (object *ob1, object *ob2)
183{ 257{
184 /* A couple quicksanity checks */ 258 /* A couple quick sanity checks */
185 if (ob1 == ob2 259 if (ob1 == ob2
186 || ob1->type != ob2->type 260 || ob1->type != ob2->type
187 || ob1->speed != ob2->speed
188 || ob1->value != ob2->value 261 || ob1->value != ob2->value
189 || ob1->name != ob2->name) 262 || ob1->name != ob2->name
263 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
190 return 0; 264 return 0;
191 265
192 /* Do not merge objects if nrof would overflow, assume nrof 266 /* Do not merge objects if nrof would overflow, assume nrof
193 * is always 0 .. 2**31-1 */ 267 * is always 0 .. 2**31-1 */
194 if (ob1->nrof > 0x7fffffff - ob2->nrof) 268 if (ob1->nrof > 0x7fffffff - ob2->nrof)
198 * This is to the comparison of the flags below will be OK. We 272 * This is to the comparison of the flags below will be OK. We
199 * just can't ignore the been applied or identified flags, as they 273 * just can't ignore the been applied or identified flags, as they
200 * are not equal - just if it has been identified, the been_applied 274 * are not equal - just if it has been identified, the been_applied
201 * flags lose any meaning. 275 * flags lose any meaning.
202 */ 276 */
203 if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) 277 if (ob1->flag [FLAG_IDENTIFIED])
204 SET_FLAG (ob1, FLAG_BEEN_APPLIED); 278 ob1->set_flag (FLAG_BEEN_APPLIED);
205 279
206 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) 280 if (ob2->flag [FLAG_IDENTIFIED])
207 SET_FLAG (ob2, FLAG_BEEN_APPLIED); 281 ob2->set_flag (FLAG_BEEN_APPLIED);
208 282
209 if (ob1->arch->archname != ob2->arch->archname 283 if (ob1->arch->archname != ob2->arch->archname
210 || ob1->name != ob2->name 284 || ob1->name != ob2->name
211 || ob1->title != ob2->title 285 || ob1->title != ob2->title
212 || ob1->msg != ob2->msg 286 || ob1->msg != ob2->msg
215 || ob1->magic != ob2->magic 289 || ob1->magic != ob2->magic
216 || ob1->slaying != ob2->slaying 290 || ob1->slaying != ob2->slaying
217 || ob1->skill != ob2->skill 291 || ob1->skill != ob2->skill
218 || ob1->value != ob2->value 292 || ob1->value != ob2->value
219 || ob1->animation_id != ob2->animation_id 293 || ob1->animation_id != ob2->animation_id
220 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other 294 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
221 || ob1->client_type != ob2->client_type 295 || ob1->client_type != ob2->client_type
222 || ob1->materialname != ob2->materialname 296 || ob1->material != ob2->material
223 || ob1->lore != ob2->lore 297 || ob1->lore != ob2->lore
224 || ob1->subtype != ob2->subtype 298 || ob1->subtype != ob2->subtype
225 || ob1->move_type != ob2->move_type 299 || ob1->move_type != ob2->move_type
226 || ob1->move_block != ob2->move_block 300 || ob1->move_block != ob2->move_block
227 || ob1->move_allow != ob2->move_allow 301 || ob1->move_allow != ob2->move_allow
228 || ob1->move_on != ob2->move_on 302 || ob1->move_on != ob2->move_on
229 || ob1->move_off != ob2->move_off 303 || ob1->move_off != ob2->move_off
230 || ob1->move_slow != ob2->move_slow 304 || ob1->move_slow != ob2->move_slow
231 || ob1->move_slow_penalty != ob2->move_slow_penalty 305 || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
232 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) 306 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
233 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 307 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
234 return 0; 308 return 0;
235 309
236 if ((ob1->flag ^ ob2->flag) 310 if ((ob1->flag ^ ob2->flag)
261 335
262 /* Don't merge objects that are applied. With the new 'body' code, 336 /* Don't merge objects that are applied. With the new 'body' code,
263 * it is possible for most any character to have more than one of 337 * it is possible for most any character to have more than one of
264 * some items equipped, and we don't want those to merge. 338 * some items equipped, and we don't want those to merge.
265 */ 339 */
266 if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED)) 340 if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED])
267 return 0; 341 return 0;
268 342
269 /* Note sure why the following is the case - either the object has to 343 /* Note sure why the following is the case - either the object has to
270 * be animated or have a very low speed. Is this an attempted monster 344 * be animated or have a very low speed. Is this an attempted monster
271 * check? 345 * check?
272 */ 346 */
273 if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) 347 if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ())
274 return 0; 348 return 0;
275 349
276 switch (ob1->type) 350 switch (ob1->type)
277 { 351 {
278 case SCROLL: 352 case SCROLL:
334 408
335 // the player itself is always on a map, so we will find him here 409 // the player itself is always on a map, so we will find him here
336 // even if our inv is in a player. 410 // even if our inv is in a player.
337 if (envest->is_on_map ()) 411 if (envest->is_on_map ())
338 if (object *pl = envest->ms ().player ()) 412 if (object *pl = envest->ms ().player ())
339 if (pl->container == env) 413 if (pl->container_ () == env)
340 return pl; 414 return pl;
341 } 415 }
342 else 416 else
343 { 417 {
344 // maybe there is a player standing on the same mapspace 418 // maybe there is a player standing on the same mapspace
345 // this will catch the case where "this" is a player 419 // this will catch the case where "this" is a player
346 if (object *pl = ms ().player ()) 420 if (object *pl = ms ().player ())
347 if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look) 421 if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
348 || this == pl->container) 422 || pl->container_ () == this)
349 return pl; 423 return pl;
350 } 424 }
351 } 425 }
352 426
353 return 0; 427 return 0;
409 483
410 sum = weight_adjust_for (this, sum); 484 sum = weight_adjust_for (this, sum);
411 485
412 if (sum != carrying) 486 if (sum != carrying)
413 { 487 {
488 if (carrying != sum)//D
489 LOG (llevDebug, "updating weight got %ld, expected %ld (%s)\n",
490 (long long)sum, (long long)carrying, debug_desc ());
491
414 carrying = sum; 492 carrying = sum;
415 493
416 if (object *pl = visible_to ()) 494 if (object *pl = visible_to ())
417 if (pl != this) // player is handled lazily 495 if (pl != this) // player is handled lazily
418 esrv_update_item (UPD_WEIGHT, pl, this); 496 esrv_update_item (UPD_WEIGHT, pl, this);
431 object_freezer freezer; 509 object_freezer freezer;
432 op->write (freezer); 510 op->write (freezer);
433 return freezer.as_string (); 511 return freezer.as_string ();
434} 512}
435 513
436/* 514char *
437 * get_nearest_part(multi-object, object 2) returns the part of the 515object::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{ 516{
444 object *tmp, *closest; 517 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} 518}
458 519
459/* 520/*
460 * Returns the object which has the count-variable equal to the argument. 521 * Returns the object which has the count-variable equal to the argument.
461 * VERRRY slow. 522 * VERRRY slow.
463object * 524object *
464find_object (tag_t i) 525find_object (tag_t i)
465{ 526{
466 for_all_objects (op) 527 for_all_objects (op)
467 if (op->count == i) 528 if (op->count == i)
529 return op;
530
531 return 0;
532}
533
534/*
535 * Returns the object which has the uuid equal to the argument.
536 * MOAR VERRRY slow.
537 */
538
539object *
540find_object_uuid (UUID i)
541{
542 for_all_objects (op)
543 if (op->uuid == i)
468 return op; 544 return op;
469 545
470 return 0; 546 return 0;
471} 547}
472 548
506 LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); 582 LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
507 return; 583 return;
508 } 584 }
509 585
510 this->owner = owner; 586 this->owner = owner;
511}
512
513int
514object::slottype () const
515{
516 if (type == SKILL)
517 {
518 if (IS_COMBAT_SKILL (subtype)) return slot_combat;
519 if (IS_RANGED_SKILL (subtype)) return slot_ranged;
520 }
521 else
522 {
523 if (slot [body_combat].info) return slot_combat;
524 if (slot [body_range ].info) return slot_ranged;
525 }
526
527 return slot_none;
528}
529
530bool
531object::change_weapon (object *ob)
532{
533 if (current_weapon == ob)
534 return true;
535
536 if (chosen_skill)
537 chosen_skill->flag [FLAG_APPLIED] = false;
538
539 current_weapon = ob;
540 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
541
542 if (chosen_skill)
543 chosen_skill->flag [FLAG_APPLIED] = true;
544
545 update_stats ();
546
547 if (ob)
548 {
549 // now check wether any body locations became invalid, in which case
550 // we cannot apply the weapon at the moment.
551 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
552 if (slot[i].used < 0)
553 {
554 current_weapon = chosen_skill = 0;
555 update_stats ();
556
557 new_draw_info_format (NDI_UNIQUE, 0, this,
558 "You try to balance all your items at once, "
559 "but the %s is just too much for your body. "
560 "[You need to unapply some items first.]", &ob->name);
561 return false;
562 }
563
564 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
565 }
566 else
567 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
568
569 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
570 {
571 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
572 &name, ob->debug_desc ());
573 return false;
574 }
575
576 return true;
577} 587}
578 588
579/* Zero the key_values on op, decrementing the shared-string 589/* Zero the key_values on op, decrementing the shared-string
580 * refcounts and freeing the links. 590 * refcounts and freeing the links.
581 */ 591 */
634 tail = new_link; 644 tail = new_link;
635 } 645 }
636 } 646 }
637 } 647 }
638 648
639 if (speed < 0)
640 dst->speed_left -= rndm ();
641
642 dst->activate (); 649 dst->activate ();
643} 650}
644 651
645void 652void
646object::instantiate () 653object::instantiate ()
647{ 654{
648 if (!uuid.seq) // HACK 655 if (!uuid.seq) // HACK
649 uuid = UUID::gen (); 656 uuid = UUID::gen ();
650 657
658 // TODO: unclean state changes, should nt be done in copy_to AND instantiate
659 if (flag [FLAG_RANDOM_SPEED] && speed)
660 speed_left = - speed - rndm (); // TODO animation
661 else
651 speed_left = -0.1f; 662 speed_left = -1.;
663
652 /* copy the body_info to the body_used - this is only really 664 /* 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. 665 * 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 666 * by doing so, when a monster is created, it has good starting
655 * values for the body_used info, so when items are created 667 * values for the body_used info, so when items are created
656 * for it, they can be properly equipped. 668 * for it, they can be properly equipped.
664object * 676object *
665object::clone () 677object::clone ()
666{ 678{
667 object *neu = create (); 679 object *neu = create ();
668 copy_to (neu); 680 copy_to (neu);
681
682 // TODO: unclean state changes, should not be done in clone AND instantiate
683 if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
684 neu->speed_left = - neu->speed - rndm (); // TODO animation
685
669 neu->map = map; // not copied by copy_to 686 neu->map = map; // not copied by copy_to
670 return neu; 687 return neu;
671} 688}
672 689
673/* 690/*
676 * be called to update the face variable, _and_ how it looks on the map. 693 * be called to update the face variable, _and_ how it looks on the map.
677 */ 694 */
678void 695void
679update_turn_face (object *op) 696update_turn_face (object *op)
680{ 697{
681 if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) 698 if (!op->flag [FLAG_IS_TURNABLE] || !op->arch)
682 return; 699 return;
683 700
684 SET_ANIMATION (op, op->direction); 701 SET_ANIMATION (op, op->direction);
685 update_object (op, UP_OBJ_FACE); 702 update_object (op, UP_OBJ_FACE);
686} 703}
691 * This function needs to be called whenever the speed of an object changes. 708 * This function needs to be called whenever the speed of an object changes.
692 */ 709 */
693void 710void
694object::set_speed (float speed) 711object::set_speed (float speed)
695{ 712{
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; 713 this->speed = speed;
703 714
704 if (has_active_speed ()) 715 if (has_active_speed ())
705 activate (); 716 activate ();
706 else 717 else
756 767
757 if (!(m.flags_ & P_UPTODATE)) 768 if (!(m.flags_ & P_UPTODATE))
758 /* nop */; 769 /* nop */;
759 else if (action == UP_OBJ_INSERT) 770 else if (action == UP_OBJ_INSERT)
760 { 771 {
772#if 0
761 // this is likely overkill, TODO: revisit (schmorp) 773 // this is likely overkill, TODO: revisit (schmorp)
762 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 774 if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW))
763 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 775 || (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC))
764 || (op->is_player () && !(m.flags_ & P_PLAYER)) 776 || (op->is_player () && !(m.flags_ & P_PLAYER))
765 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 777 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
766 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) 778 || (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE))
767 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) 779 || (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC))
768 || (m.move_on | op->move_on ) != m.move_on 780 || (m.move_on | op->move_on ) != m.move_on
769 || (m.move_off | op->move_off ) != m.move_off 781 || (m.move_off | op->move_off ) != m.move_off
770 || (m.move_slow | op->move_slow) != m.move_slow 782 || (m.move_slow | op->move_slow) != m.move_slow
771 /* This isn't perfect, but I don't expect a lot of objects to 783 /* This isn't perfect, but I don't expect a lot of objects to
772 * have move_allow right now. 784 * have move_allow right now.
773 */ 785 */
774 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block 786 || ((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 (); 787 m.invalidate ();
788#else
789 // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
790 m.invalidate ();
791#endif
777 } 792 }
778 /* if the object is being removed, we can't make intelligent 793 /* if the object is being removed, we can't make intelligent
779 * decisions, because remove_ob can't really pass the object 794 * decisions, because remove_ob can't really pass the object
780 * that is being removed. 795 * that is being removed.
781 */ 796 */
790 update_object (op->more, action); 805 update_object (op->more, action);
791} 806}
792 807
793object::object () 808object::object ()
794{ 809{
795 SET_FLAG (this, FLAG_REMOVED); 810 this->set_flag (FLAG_REMOVED);
796 811
797 //expmul = 1.0; declared const for the time being 812 //expmul = 1.0; declared const for the time being
798 face = blank_face; 813 face = blank_face;
814 material = MATERIAL_NULL;
799} 815}
800 816
801object::~object () 817object::~object ()
802{ 818{
803 unlink (); 819 unlink ();
804 820
805 free_key_values (this); 821 free_key_values (this);
806} 822}
807
808static int object_count;
809 823
810void object::link () 824void object::link ()
811{ 825{
812 assert (!index);//D 826 assert (!index);//D
813 uuid = UUID::gen (); 827 uuid = UUID::gen ();
814 count = ++object_count;
815 828
816 refcnt_inc (); 829 refcnt_inc ();
817 objects.insert (this); 830 objects.insert (this);
831
832 ++create_count;
833
818} 834}
819 835
820void object::unlink () 836void object::unlink ()
821{ 837{
822 if (!index) 838 if (!index)
823 return; 839 return;
840
841 ++destroy_count;
824 842
825 objects.erase (this); 843 objects.erase (this);
826 refcnt_dec (); 844 refcnt_dec ();
827} 845}
828 846
933 map->insert (op, x, y); 951 map->insert (op, x, y);
934 } 952 }
935 } 953 }
936} 954}
937 955
956/*
957 * Remove and free all objects in the inventory of the given object.
958 * Unlike destroy_inv, this assumes the *this is destroyed as well
959 * well, so we can (and have to!) take shortcuts.
960 */
961void
962object::destroy_inv_fast ()
963{
964 while (object *op = inv)
965 {
966 // remove from object the fast way
967 op->flag [FLAG_REMOVED] = true;
968 op->env = 0;
969 if ((inv = inv->below))
970 inv->above = 0;
971
972 // then destroy
973 op->destroy ();
974 }
975}
976
977void
978object::freelist_free (int count)
979{
980 while (count-- && freelist)
981 {
982 freelist_item *next = freelist->next;
983 // count is being "destroyed"
984
985 sfree ((char *)freelist, sizeof (object));
986
987 freelist = next;
988 --free_count;
989 }
990}
991
992object *
938object *object::create () 993object::create ()
939{ 994{
940 object *op = new object; 995 object *op;
996
997 if (freelist)
998 {
999 freelist_item li = *freelist;
1000 memset (freelist, 0, sizeof (object));
1001
1002 op = new (freelist) object;
1003 op->count = li.count;
1004
1005 freelist = li.next;
1006 --free_count;
1007 }
1008 else
1009 {
1010 void *ni = salloc0<char> (sizeof (object));
1011
1012 op = new(ni) object;
1013
1014 op->count = ++object_count;
1015 }
1016
941 op->link (); 1017 op->link ();
1018
942 return op; 1019 return op;
1020}
1021
1022void
1023object::do_delete ()
1024{
1025 uint32_t count = this->count;
1026
1027 this->~object ();
1028
1029 freelist_item *li = (freelist_item *)this;
1030 li->next = freelist;
1031 li->count = count;
1032
1033 freelist = li;
1034 ++free_count;
943} 1035}
944 1036
945static struct freed_map : maptile 1037static struct freed_map : maptile
946{ 1038{
947 freed_map () 1039 freed_map ()
1012 LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); 1104 LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1013 head->destroy (); 1105 head->destroy ();
1014 return; 1106 return;
1015 } 1107 }
1016 1108
1017 destroy_inv (false); 1109 destroy_inv_fast ();
1018 1110
1019 if (is_head ()) 1111 if (is_head ())
1020 if (sound_destroy) 1112 if (sound_destroy)
1021 play_sound (sound_destroy); 1113 play_sound (sound_destroy);
1022 else if (flag [FLAG_MONSTER]) 1114 else if (flag [FLAG_MONSTER])
1033 * the previous environment. 1125 * the previous environment.
1034 */ 1126 */
1035void 1127void
1036object::do_remove () 1128object::do_remove ()
1037{ 1129{
1038 object *tmp, *last = 0;
1039 object *otmp;
1040
1041 if (flag [FLAG_REMOVED]) 1130 if (flag [FLAG_REMOVED])
1042 return; 1131 return;
1043 1132
1044 INVOKE_OBJECT (REMOVE, this); 1133 INVOKE_OBJECT (REMOVE, this);
1045 1134
1077 1166
1078 above = 0; 1167 above = 0;
1079 below = 0; 1168 below = 0;
1080 env = 0; 1169 env = 0;
1081 1170
1082 /* NO_FIX_PLAYER is set when a great many changes are being 1171 if (pl && pl->is_player ())
1083 * made to players inventory. If set, avoiding the call
1084 * to save cpu time.
1085 */ 1172 {
1086 if (pl) 1173 if (expect_false (pl->contr->combat_ob == this))
1087 if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1088 { 1174 {
1089 pl->update_stats (); 1175 pl->apply (pl->contr->combat_ob, AP_UNAPPLY);
1176 pl->contr->combat_ob = 0;
1177 if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
1178 }
1090 1179
1180 if (expect_false (pl->contr->ranged_ob == this))
1181 {
1182 pl->apply (pl->contr->ranged_ob, AP_UNAPPLY);
1183 pl->contr->ranged_ob = 0;
1184 if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
1185 }
1186
1187 pl->contr->queue_stats_update ();
1188
1091 if (glow_radius && pl->is_on_map ()) 1189 if (expect_false (glow_radius) && pl->is_on_map ())
1092 update_all_los (pl->map, pl->x, pl->y); 1190 update_all_los (pl->map, pl->x, pl->y);
1093 } 1191 }
1094 } 1192 }
1095 else if (map) 1193 else if (map)
1096 { 1194 {
1097 map->dirty = true; 1195 map->dirty = true;
1098 mapspace &ms = this->ms (); 1196 mapspace &ms = this->ms ();
1111 close_container (); 1209 close_container ();
1112 1210
1113 --map->players; 1211 --map->players;
1114 map->touch (); 1212 map->touch ();
1115 } 1213 }
1116 else if (pl->container == this) 1214 else if (pl->container_ () == this)
1117 { 1215 {
1118 // removing a container should close it 1216 // removing a container should close it
1119 close_container (); 1217 close_container ();
1120 } 1218 }
1121 1219 else
1122 esrv_del_item (pl->contr, count); 1220 esrv_del_item (pl->contr, count);
1123 } 1221 }
1124 1222
1125 /* link the object above us */ 1223 /* link the object above us */
1126 // re-link, make sure compiler can easily use cmove 1224 // re-link, make sure compiler can easily use cmove
1127 *(above ? &above->below : &ms.top) = below; 1225 *(above ? &above->below : &ms.top) = below;
1137 1235
1138 int check_walk_off = !flag [FLAG_NO_APPLY]; 1236 int check_walk_off = !flag [FLAG_NO_APPLY];
1139 1237
1140 if (object *pl = ms.player ()) 1238 if (object *pl = ms.player ())
1141 { 1239 {
1142 if (pl->container == this) 1240 if (pl->container_ () == this)
1143 /* If a container that the player is currently using somehow gets 1241 /* If a container that the player is currently using somehow gets
1144 * removed (most likely destroyed), update the player view 1242 * removed (most likely destroyed), update the player view
1145 * appropriately. 1243 * appropriately.
1146 */ 1244 */
1147 pl->close_container (); 1245 pl->close_container ();
1151 //TODO: update floorbox to preserve ordering 1249 //TODO: update floorbox to preserve ordering
1152 if (pl->contr->ns) 1250 if (pl->contr->ns)
1153 pl->contr->ns->floorbox_update (); 1251 pl->contr->ns->floorbox_update ();
1154 } 1252 }
1155 1253
1254 if (check_walk_off)
1156 for (tmp = ms.bot; tmp; tmp = tmp->above) 1255 for (object *above, *tmp = ms.bot; tmp; tmp = above)
1157 { 1256 {
1257 above = tmp->above;
1258
1158 /* No point updating the players look faces if he is the object 1259 /* No point updating the players look faces if he is the object
1159 * being removed. 1260 * being removed.
1160 */ 1261 */
1161 1262
1162 /* See if object moving off should effect something */ 1263 /* See if object moving off should effect something */
1163 if (check_walk_off
1164 && ((move_type & tmp->move_off) 1264 if ((move_type & tmp->move_off)
1165 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1265 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1166 {
1167 move_apply (tmp, this, 0); 1266 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 } 1267 }
1172
1173 last = tmp;
1174 }
1175 1268
1176 if (affects_los ()) 1269 if (affects_los ())
1177 update_all_los (map, x, y); 1270 update_all_los (map, x, y);
1178 } 1271 }
1179} 1272}
1223 1316
1224 object *prev = this; 1317 object *prev = this;
1225 1318
1226 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) 1319 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1227 { 1320 {
1228 object *op = arch_to_object (at); 1321 object *op = at->instance ();
1229 1322
1230 op->name = name; 1323 op->name = name;
1231 op->name_pl = name_pl; 1324 op->name_pl = name_pl;
1232 op->title = title; 1325 op->title = title;
1233 1326
1271 * Passing 0 for flag gives proper default values, so flag really only needs 1364 * Passing 0 for flag gives proper default values, so flag really only needs
1272 * to be set if special handling is needed. 1365 * to be set if special handling is needed.
1273 * 1366 *
1274 * Return value: 1367 * Return value:
1275 * new object if 'op' was merged with other object 1368 * new object if 'op' was merged with other object
1276 * NULL if 'op' was destroyed 1369 * NULL if there was an error (destroyed, blocked etc.)
1277 * just 'op' otherwise 1370 * just 'op' otherwise
1278 */ 1371 */
1279object * 1372object *
1280insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1373insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1281{ 1374{
1318 // from here :/ 1411 // from here :/
1319 op->nrof += tmp->nrof; 1412 op->nrof += tmp->nrof;
1320 tmp->destroy (); 1413 tmp->destroy ();
1321 } 1414 }
1322 1415
1323 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1416 op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1324 CLEAR_FLAG (op, FLAG_INV_LOCKED); 1417 op->clr_flag (FLAG_INV_LOCKED);
1325 1418
1326 if (!QUERY_FLAG (op, FLAG_ALIVE)) 1419 if (!op->flag [FLAG_ALIVE])
1327 CLEAR_FLAG (op, FLAG_NO_STEAL); 1420 op->clr_flag (FLAG_NO_STEAL);
1328 1421
1329 if (flag & INS_BELOW_ORIGINATOR) 1422 if (flag & INS_BELOW_ORIGINATOR)
1330 { 1423 {
1331 if (originator->map != op->map || originator->x != op->x || originator->y != op->y) 1424 if (originator->map != op->map || originator->x != op->x || originator->y != op->y)
1332 { 1425 {
1367 * when lots of spells are cast in one area. Currently, it is presumed 1460 * when lots of spells are cast in one area. Currently, it is presumed
1368 * that flying non pickable objects are spell objects. 1461 * that flying non pickable objects are spell objects.
1369 */ 1462 */
1370 for (object *tmp = ms.bot; tmp; tmp = tmp->above) 1463 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1371 { 1464 {
1372 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) 1465 if (tmp->flag [FLAG_IS_FLOOR] || tmp->flag [FLAG_OVERLAY_FLOOR])
1373 floor = tmp; 1466 floor = tmp;
1374 1467
1375 if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1468 if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR])
1376 { 1469 {
1377 /* We insert above top, so we want this object below this */ 1470 /* We insert above top, so we want this object below this */
1378 top = tmp->below; 1471 top = tmp->below;
1379 break; 1472 break;
1380 } 1473 }
1398 && (op->face && !faces [op->face].visibility)) 1491 && (op->face && !faces [op->face].visibility))
1399 { 1492 {
1400 object *last; 1493 object *last;
1401 1494
1402 for (last = top; last != floor; last = last->below) 1495 for (last = top; last != floor; last = last->below)
1403 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1496 if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT))
1404 break; 1497 break;
1405 1498
1406 /* Check to see if we found the object that blocks view, 1499 /* Check to see if we found the object that blocks view,
1407 * and make sure we have a below pointer for it so that 1500 * and make sure we have a below pointer for it so that
1408 * we can get inserted below this one, which requires we 1501 * we can get inserted below this one, which requires we
1479 * blocked() and wall() work properly), and these flags are updated by 1572 * blocked() and wall() work properly), and these flags are updated by
1480 * update_object(). 1573 * update_object().
1481 */ 1574 */
1482 1575
1483 /* if this is not the head or flag has been passed, don't check walk on status */ 1576 /* 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) 1577 if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1485 { 1578 {
1486 if (check_move_on (op, originator)) 1579 if (check_move_on (op, originator))
1487 return 0; 1580 return 0;
1488 1581
1489 /* If we are a multi part object, lets work our way through the check 1582 /* If we are a multi part object, lets work our way through the check
1508 1601
1509 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1602 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1510 if (tmp->arch->archname == archname) /* same archetype */ 1603 if (tmp->arch->archname == archname) /* same archetype */
1511 tmp->destroy (); 1604 tmp->destroy ();
1512 1605
1513 object *tmp = arch_to_object (archetype::find (archname)); 1606 object *tmp = archetype::find (archname)->instance ();
1514 1607
1515 tmp->x = op->x; 1608 tmp->x = op->x;
1516 tmp->y = op->y; 1609 tmp->y = op->y;
1517 1610
1518 insert_ob_in_map (tmp, op->map, op, 0); 1611 insert_ob_in_map (tmp, op->map, op, 0);
1523{ 1616{
1524 if (where->env) 1617 if (where->env)
1525 return where->env->insert (this); 1618 return where->env->insert (this);
1526 else 1619 else
1527 return where->map->insert (this, where->x, where->y, originator, flags); 1620 return where->map->insert (this, where->x, where->y, originator, flags);
1621}
1622
1623// check whether we can put this into the map, respect max_volume, max_items
1624bool
1625object::can_drop_at (maptile *m, int x, int y, object *originator)
1626{
1627 mapspace &ms = m->at (x, y);
1628
1629 int items = ms.items ();
1630
1631 if (!items // testing !items ensures we can drop at least one item
1632 || (items < m->max_items
1633 && ms.volume () < m->max_volume))
1634 return true;
1635
1636 if (originator && originator->is_player ())
1637 originator->contr->failmsgf (
1638 "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1639 query_name ()
1640 );
1641
1642 return false;
1528} 1643}
1529 1644
1530/* 1645/*
1531 * decrease(object, number) decreases a specified number from 1646 * decrease(object, number) decreases a specified number from
1532 * the amount of an object. If the amount reaches 0, the object 1647 * the amount of an object. If the amount reaches 0, the object
1672 if (op->glow_radius && is_on_map ()) 1787 if (op->glow_radius && is_on_map ())
1673 { 1788 {
1674 update_stats (); 1789 update_stats ();
1675 update_all_los (map, x, y); 1790 update_all_los (map, x, y);
1676 } 1791 }
1677 else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) 1792 else if (is_player ())
1678 // if this is a player's inventory, update stats 1793 // if this is a player's inventory, update stats
1679 update_stats (); 1794 contr->queue_stats_update ();
1680 1795
1681 INVOKE_OBJECT (INSERT, this); 1796 INVOKE_OBJECT (INSERT, this);
1682 1797
1683 return op; 1798 return op;
1684} 1799}
1704 * on top. 1819 * on top.
1705 */ 1820 */
1706int 1821int
1707check_move_on (object *op, object *originator) 1822check_move_on (object *op, object *originator)
1708{ 1823{
1824 if (op->flag [FLAG_NO_APPLY])
1825 return 0;
1826
1709 object *tmp; 1827 object *tmp;
1710 maptile *m = op->map; 1828 maptile *m = op->map;
1711 int x = op->x, y = op->y; 1829 int x = op->x, y = op->y;
1712 1830
1713 MoveType move_on, move_slow, move_block; 1831 mapspace &ms = m->at (x, y);
1714 1832
1715 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1833 ms.update ();
1716 return 0;
1717 1834
1718 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1835 MoveType move_on = ms.move_on;
1719 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1836 MoveType move_slow = ms.move_slow;
1720 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1837 MoveType move_block = ms.move_block;
1721 1838
1722 /* if nothing on this space will slow op down or be applied, 1839 /* 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 1840 * 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 1841 * is set, as lots of objects don't have it set - we treat that
1725 * as walking. 1842 * as walking.
1736 return 0; 1853 return 0;
1737 1854
1738 /* The objects have to be checked from top to bottom. 1855 /* The objects have to be checked from top to bottom.
1739 * Hence, we first go to the top: 1856 * Hence, we first go to the top:
1740 */ 1857 */
1741 1858 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 } 1859 {
1860 next = tmp->below;
1751 1861
1752 for (; tmp; tmp = tmp->below)
1753 {
1754 if (tmp == op) 1862 if (tmp == op)
1755 continue; /* Can't apply yourself */ 1863 continue; /* Can't apply yourself */
1756 1864
1757 /* Check to see if one of the movement types should be slowed down. 1865 /* 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 1866 * Second check makes sure that the movement types not being slowed
1759 * (~slow_move) is not blocked on this space - just because the 1867 * (~slow_move) is not blocked on this space - just because the
1760 * space doesn't slow down swimming (for example), if you can't actually 1868 * space doesn't slow down swimming (for example), if you can't actually
1761 * swim on that space, can't use it to avoid the penalty. 1869 * swim on that space, can't use it to avoid the penalty.
1762 */ 1870 */
1763 if (!QUERY_FLAG (op, FLAG_WIZPASS)) 1871 if (!op->flag [FLAG_WIZPASS])
1764 { 1872 {
1765 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1873 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)) 1874 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1767 { 1875 {
1768
1769 float
1770 diff = tmp->move_slow_penalty * fabs (op->speed); 1876 float diff = tmp->move_slow_penalty * fabs (op->speed);
1771 1877
1772 if (op->is_player ()) 1878 if (op->is_player ())
1773 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1879 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))) 1880 (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1775 diff /= 4.0; 1881 diff /= 4.0;
1776 1882
1777 op->speed_left -= diff; 1883 op->speed_left -= diff;
1778 } 1884 }
1779 } 1885 }
1901void 2007void
1902flag_inv (object *op, int flag) 2008flag_inv (object *op, int flag)
1903{ 2009{
1904 for (object *tmp = op->inv; tmp; tmp = tmp->below) 2010 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1905 { 2011 {
1906 SET_FLAG (tmp, flag); 2012 tmp->set_flag (flag);
1907 flag_inv (tmp, flag); 2013 flag_inv (tmp, flag);
1908 } 2014 }
1909} 2015}
1910 2016
1911/* 2017/*
1914void 2020void
1915unflag_inv (object *op, int flag) 2021unflag_inv (object *op, int flag)
1916{ 2022{
1917 for (object *tmp = op->inv; tmp; tmp = tmp->below) 2023 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1918 { 2024 {
1919 CLEAR_FLAG (tmp, flag); 2025 tmp->clr_flag (flag);
1920 unflag_inv (tmp, flag); 2026 unflag_inv (tmp, flag);
1921 } 2027 }
1922} 2028}
1923 2029
1924/* 2030/*
2180 * This basically means that if direction is 15, then it could either go 2286 * 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. 2287 * 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 2288 * Moved from spell_util.c to object.c with the other related direction
2183 * functions. 2289 * functions.
2184 */ 2290 */
2185const int reduction_dir[SIZEOFFREE][3] = { 2291static const int reduction_dir[SIZEOFFREE][3] = {
2186 {0, 0, 0}, /* 0 */ 2292 {0, 0, 0}, /* 0 */
2187 {0, 0, 0}, /* 1 */ 2293 {0, 0, 0}, /* 1 */
2188 {0, 0, 0}, /* 2 */ 2294 {0, 0, 0}, /* 2 */
2189 {0, 0, 0}, /* 3 */ 2295 {0, 0, 0}, /* 3 */
2190 {0, 0, 0}, /* 4 */ 2296 {0, 0, 0}, /* 4 */
2284 * Add a check so we can't pick up invisible objects (0.93.8) 2390 * Add a check so we can't pick up invisible objects (0.93.8)
2285 */ 2391 */
2286int 2392int
2287can_pick (const object *who, const object *item) 2393can_pick (const object *who, const object *item)
2288{ 2394{
2289 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2395 return /*who->flag [FLAG_WIZ]|| */
2290 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2396 (item->weight > 0 && !item->flag [FLAG_NO_PICK] &&
2291 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); 2397 !item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2292} 2398}
2293 2399
2294/* 2400/*
2295 * create clone from object to another 2401 * create clone from object to another
2296 */ 2402 */
2461{ 2567{
2462 return map ? map->region (x, y) 2568 return map ? map->region (x, y)
2463 : region::default_region (); 2569 : region::default_region ();
2464} 2570}
2465 2571
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 2572void
2476object::open_container (object *new_container) 2573object::open_container (object *new_container)
2477{ 2574{
2478 if (container == new_container) 2575 if (container == new_container)
2479 return; 2576 return;
2513 // TODO: this does not seem to serve any purpose anymore? 2610 // TODO: this does not seem to serve any purpose anymore?
2514#if 0 2611#if 0
2515 // insert the "Close Container" object. 2612 // insert the "Close Container" object.
2516 if (archetype *closer = new_container->other_arch) 2613 if (archetype *closer = new_container->other_arch)
2517 { 2614 {
2518 object *closer = arch_to_object (new_container->other_arch); 2615 object *closer = new_container->other_arch->instance ();
2519 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2616 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2520 new_container->insert (closer); 2617 new_container->insert (closer);
2521 } 2618 }
2522#endif 2619#endif
2523 2620
2549 return splay (tmp); 2646 return splay (tmp);
2550 2647
2551 return 0; 2648 return 0;
2552} 2649}
2553 2650
2651//-GPL
2652
2653void
2654object::force_set_timer (int duration)
2655{
2656 this->duration = 1;
2657 this->speed_left = -1.f;
2658
2659 this->set_speed (duration ? 1.f / duration : 0.f);
2660}
2661
2554object * 2662object *
2555object::force_add (shstr_tmp name, int duration) 2663object::force_add (shstr_tmp name, int duration)
2556{ 2664{
2557 if (object *force = force_find (name)) 2665 if (object *force = force_find (name))
2558 force->destroy (); 2666 force->destroy ();
2559 2667
2560 object *force = get_archetype (FORCE_NAME); 2668 object *force = get_archetype (FORCE_NAME);
2561 2669
2562 force->slaying = name; 2670 force->slaying = name;
2563 force->stats.food = 1; 2671 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; 2672 force->flag [FLAG_APPLIED] = true;
2569 2673
2570 return insert (force); 2674 return insert (force);
2571} 2675}
2572 2676
2573void 2677void
2622 2726
2623 insert (force); 2727 insert (force);
2624 } 2728 }
2625} 2729}
2626 2730
2731void object::change_move_type (MoveType mt)
2732{
2733 if (move_type == mt)
2734 return;
2735
2736 if (is_on_map ())
2737 {
2738 // we are on the map, so handle move_on/off effects
2739 remove ();
2740 move_type = mt;
2741 map->insert (this, x, y, this);
2742 }
2743 else
2744 move_type = mt;
2745}
2746
2747/* object should be a player.
2748 * we return the object the player has marked with the 'mark' command
2749 * below. If no match is found (or object has changed), we return
2750 * NULL. We leave it up to the calling function to print messages if
2751 * nothing is found.
2752 */
2753object *
2754object::mark () const
2755{
2756 if (contr && contr->mark && contr->mark->env == this)
2757 return contr->mark;
2758 else
2759 return 0;
2760}
2761

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines