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.54 by root, Fri Nov 17 19:40:53 2006 UTC vs.
Revision 1.107 by pippijn, Sat Jan 6 14:42:29 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 CrossFire, A Multiplayer game for X-windows
3 3
4 Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 Copyright (C) 2001 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 Copyright (C) 1992 Frank Tore Johansen
6 7
7 This program is free software; you can redistribute it and/or modify 8 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by 9 it under the terms of the GNU General Public License as published by
… …
29#include <sys/types.h> 30#include <sys/types.h>
30#include <sys/uio.h> 31#include <sys/uio.h>
31#include <object.h> 32#include <object.h>
32#include <funcpoint.h> 33#include <funcpoint.h>
33#include <loader.h> 34#include <loader.h>
35
36#include <bitset>
34 37
35int nrofallocobjects = 0; 38int nrofallocobjects = 0;
36static UUID uuid; 39static UUID uuid;
37const uint64 UUID_SKIP = 1<<19; 40const uint64 UUID_SKIP = 1<<19;
38 41
… …
104 _exit (1); 107 _exit (1);
105 } 108 }
106 109
107 uuid.seq = uid; 110 uuid.seq = uid;
108 write_uuid (); 111 write_uuid ();
109 LOG (llevDebug, "read UID: %lld\n", uid); 112 LOG (llevDebug, "read UID: %" PRId64 "\n", uid);
110 fclose (fp); 113 fclose (fp);
111} 114}
112 115
113UUID 116UUID
114gen_uuid () 117gen_uuid ()
… …
139 * objects with lists are rare, and lists stay short. If not, use a 142 * objects with lists are rare, and lists stay short. If not, use a
140 * different structure or at least keep the lists sorted... 143 * different structure or at least keep the lists sorted...
141 */ 144 */
142 145
143 /* For each field in wants, */ 146 /* For each field in wants, */
144 for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next) 147 for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
145 { 148 {
146 key_value *has_field; 149 key_value *has_field;
147 150
148 /* Look for a field in has with the same key. */ 151 /* Look for a field in has with the same key. */
149 has_field = get_ob_key_link (has, wants_field->key); 152 has_field = get_ob_key_link (has, wants_field->key);
… …
183 * 186 *
184 * Note that this function appears a lot longer than the macro it 187 * Note that this function appears a lot longer than the macro it
185 * replaces - this is mostly for clarity - a decent compiler should hopefully 188 * replaces - this is mostly for clarity - a decent compiler should hopefully
186 * reduce this to the same efficiency. 189 * reduce this to the same efficiency.
187 * 190 *
188 * Check nrof variable *before* calling CAN_MERGE() 191 * Check nrof variable *before* calling can_merge()
189 * 192 *
190 * Improvements made with merge: Better checking on potion, and also 193 * Improvements made with merge: Better checking on potion, and also
191 * check weight 194 * check weight
192 */ 195 */
193
194bool object::can_merge (object *ob1, object *ob2) 196bool object::can_merge_slow (object *ob1, object *ob2)
195{ 197{
196 /* A couple quicksanity checks */ 198 /* A couple quicksanity checks */
197 if ((ob1 == ob2) || (ob1->type != ob2->type)) 199 if (ob1 == ob2
200 || ob1->type != ob2->type
201 || ob1->speed != ob2->speed
202 || ob1->value != ob2->value
203 || ob1->name != ob2->name)
198 return 0; 204 return 0;
199 205
200 if (ob1->speed != ob2->speed) 206 //TODO: this ain't working well, use nicer and correct overflow check
201 return 0;
202
203 /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that 207 /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
204 * value could not be stored in a sint32 (which unfortunately sometimes is 208 * value could not be stored in a sint32 (which unfortunately sometimes is
205 * used to store nrof). 209 * used to store nrof).
206 */ 210 */
207 if (ob1->nrof + ob2->nrof >= 1UL << 31) 211 if (ob1->nrof + ob2->nrof >= 1UL << 31)
… …
217 SET_FLAG (ob1, FLAG_BEEN_APPLIED); 221 SET_FLAG (ob1, FLAG_BEEN_APPLIED);
218 222
219 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) 223 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
220 SET_FLAG (ob2, FLAG_BEEN_APPLIED); 224 SET_FLAG (ob2, FLAG_BEEN_APPLIED);
221 225
222 226 if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
223 /* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something 227 || ob1->arch != ob2->arch
224 * being locked in inventory should prevent merging.
225 * 0x4 in flags3 is CLIENT_SENT
226 */
227 if ((ob1->arch != ob2->arch) ||
228 (ob1->flags[0] != ob2->flags[0]) ||
229 (ob1->flags[1] != ob2->flags[1]) ||
230 ((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
231 ((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
232 (ob1->name != ob2->name) || 228 || ob1->name != ob2->name
233 (ob1->title != ob2->title) || 229 || ob1->title != ob2->title
234 (ob1->msg != ob2->msg) || 230 || ob1->msg != ob2->msg
235 (ob1->weight != ob2->weight) || 231 || ob1->weight != ob2->weight
236 (memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) || 232 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
237 (memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) || 233 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
238 (ob1->attacktype != ob2->attacktype) || 234 || ob1->attacktype != ob2->attacktype
239 (ob1->magic != ob2->magic) || 235 || ob1->magic != ob2->magic
240 (ob1->slaying != ob2->slaying) || 236 || ob1->slaying != ob2->slaying
241 (ob1->skill != ob2->skill) || 237 || ob1->skill != ob2->skill
242 (ob1->value != ob2->value) || 238 || ob1->value != ob2->value
243 (ob1->animation_id != ob2->animation_id) || 239 || ob1->animation_id != ob2->animation_id
244 (ob1->client_type != ob2->client_type) || 240 || ob1->client_type != ob2->client_type
245 (ob1->materialname != ob2->materialname) || 241 || ob1->materialname != ob2->materialname
246 (ob1->lore != ob2->lore) || 242 || ob1->lore != ob2->lore
247 (ob1->subtype != ob2->subtype) || 243 || ob1->subtype != ob2->subtype
248 (ob1->move_type != ob2->move_type) || 244 || ob1->move_type != ob2->move_type
249 (ob1->move_block != ob2->move_block) || 245 || ob1->move_block != ob2->move_block
250 (ob1->move_allow != ob2->move_allow) || 246 || ob1->move_allow != ob2->move_allow
251 (ob1->move_on != ob2->move_on) || 247 || ob1->move_on != ob2->move_on
252 (ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty)) 248 || ob1->move_off != ob2->move_off
249 || ob1->move_slow != ob2->move_slow
250 || ob1->move_slow_penalty != ob2->move_slow_penalty)
253 return 0; 251 return 0;
254 252
255 /* This is really a spellbook check - really, we should 253 /* This is really a spellbook check - really, we should
256 * check all objects in the inventory. 254 * check all objects in the inventory.
257 */ 255 */
… …
260 /* if one object has inventory but the other doesn't, not equiv */ 258 /* if one object has inventory but the other doesn't, not equiv */
261 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) 259 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
262 return 0; 260 return 0;
263 261
264 /* Now check to see if the two inventory objects could merge */ 262 /* Now check to see if the two inventory objects could merge */
265 if (!CAN_MERGE (ob1->inv, ob2->inv)) 263 if (!object::can_merge (ob1->inv, ob2->inv))
266 return 0; 264 return 0;
267 265
268 /* inventory ok - still need to check rest of this object to see 266 /* inventory ok - still need to check rest of this object to see
269 * if it is valid. 267 * if it is valid.
270 */ 268 */
… …
279 277
280 /* Note sure why the following is the case - either the object has to 278 /* Note sure why the following is the case - either the object has to
281 * be animated or have a very low speed. Is this an attempted monster 279 * be animated or have a very low speed. Is this an attempted monster
282 * check? 280 * check?
283 */ 281 */
284 if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) 282 if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
285 return 0; 283 return 0;
286 284
287 switch (ob1->type) 285 switch (ob1->type)
288 { 286 {
289 case SCROLL: 287 case SCROLL:
… …
354 op = op->env; 352 op = op->env;
355 return op; 353 return op;
356} 354}
357 355
358/* 356/*
359 * Eneq(@csd.uu.se): Since we can have items buried in a character we need
360 * a better check. We basically keeping traversing up until we can't
361 * or find a player.
362 */
363
364object *
365is_player_inv (object *op)
366{
367 for (; op != NULL && op->type != PLAYER; op = op->env)
368 if (op->env == op)
369 op->env = NULL;
370 return op;
371}
372
373/*
374 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 357 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
375 * Some error messages. 358 * Some error messages.
376 * The result of the dump is stored in the static global errmsg array. 359 * The result of the dump is stored in the static global errmsg array.
377 */ 360 */
378 361
… …
381{ 364{
382 if (!op) 365 if (!op)
383 return strdup ("[NULLOBJ]"); 366 return strdup ("[NULLOBJ]");
384 367
385 object_freezer freezer; 368 object_freezer freezer;
386 save_object (freezer, op, 3); 369 save_object (freezer, op, 1);
387 return freezer.as_string (); 370 return freezer.as_string ();
388} 371}
389 372
390/* 373/*
391 * get_nearest_part(multi-object, object 2) returns the part of the 374 * get_nearest_part(multi-object, object 2) returns the part of the
… …
484 } 467 }
485 468
486 op->key_values = 0; 469 op->key_values = 0;
487} 470}
488 471
489void object::clear ()
490{
491 attachable_base::clear ();
492
493 free_key_values (this);
494
495 owner = 0;
496 name = 0;
497 name_pl = 0;
498 title = 0;
499 race = 0;
500 slaying = 0;
501 skill = 0;
502 msg = 0;
503 lore = 0;
504 custom_name = 0;
505 materialname = 0;
506 contr = 0;
507 below = 0;
508 above = 0;
509 inv = 0;
510 container = 0;
511 env = 0;
512 more = 0;
513 head = 0;
514 map = 0;
515 active_next = 0;
516 active_prev = 0;
517
518 memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
519
520 SET_FLAG (this, FLAG_REMOVED);
521
522 /* What is not cleared is next, prev, and count */
523
524 expmul = 1.0;
525 face = blank_face;
526
527 if (settings.casting_time)
528 casting_time = -1;
529}
530
531void object::clone (object *destination)
532{
533 *(object_copy *)destination = *this;
534 *(object_pod *)destination = *this;
535
536 if (self || cb)
537 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
538}
539
540/* 472/*
541 * copy object first frees everything allocated by the second object, 473 * copy_to first frees everything allocated by the dst object,
542 * and then copies the contends of the first object into the second 474 * and then copies the contents of itself into the second
543 * object, allocating what needs to be allocated. Basically, any 475 * object, allocating what needs to be allocated. Basically, any
544 * data that is malloc'd needs to be re-malloc/copied. Otherwise, 476 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
545 * if the first object is freed, the pointers in the new object 477 * if the first object is freed, the pointers in the new object
546 * will point at garbage. 478 * will point at garbage.
547 */ 479 */
548void 480void
549copy_object (object *op2, object *op) 481object::copy_to (object *dst)
550{ 482{
551 bool is_freed = QUERY_FLAG (op, FLAG_FREED); 483 bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
552 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); 484 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
553 485
554 op2->clone (op); 486 *(object_copy *)dst = *this;
555 487
556 if (is_freed) 488 if (is_freed)
557 SET_FLAG (op, FLAG_FREED); 489 SET_FLAG (dst, FLAG_FREED);
490
558 if (is_removed) 491 if (is_removed)
559 SET_FLAG (op, FLAG_REMOVED); 492 SET_FLAG (dst, FLAG_REMOVED);
560 493
561 if (op2->speed < 0) 494 if (speed < 0)
562 op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0; 495 dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
563 496
564 /* Copy over key_values, if any. */ 497 /* Copy over key_values, if any. */
565 if (op2->key_values) 498 if (key_values)
566 { 499 {
567 key_value *tail = 0; 500 key_value *tail = 0;
568 key_value *i; 501 key_value *i;
569 502
570 op->key_values = 0; 503 dst->key_values = 0;
571 504
572 for (i = op2->key_values; i; i = i->next) 505 for (i = key_values; i; i = i->next)
573 { 506 {
574 key_value *new_link = new key_value; 507 key_value *new_link = new key_value;
575 508
576 new_link->next = 0; 509 new_link->next = 0;
577 new_link->key = i->key; 510 new_link->key = i->key;
578 new_link->value = i->value; 511 new_link->value = i->value;
579 512
580 /* Try and be clever here, too. */ 513 /* Try and be clever here, too. */
581 if (!op->key_values) 514 if (!dst->key_values)
582 { 515 {
583 op->key_values = new_link; 516 dst->key_values = new_link;
584 tail = new_link; 517 tail = new_link;
585 } 518 }
586 else 519 else
587 { 520 {
588 tail->next = new_link; 521 tail->next = new_link;
589 tail = new_link; 522 tail = new_link;
590 } 523 }
591 } 524 }
592 } 525 }
593 526
594 update_ob_speed (op); 527 dst->set_speed (dst->speed);
528}
529
530object *
531object::clone ()
532{
533 object *neu = create ();
534 copy_to (neu);
535 return neu;
595} 536}
596 537
597/* 538/*
598 * If an object with the IS_TURNABLE() flag needs to be turned due 539 * If an object with the IS_TURNABLE() flag needs to be turned due
599 * to the closest player being on the other side, this function can 540 * to the closest player being on the other side, this function can
600 * be called to update the face variable, _and_ how it looks on the map. 541 * be called to update the face variable, _and_ how it looks on the map.
601 */ 542 */
602
603void 543void
604update_turn_face (object *op) 544update_turn_face (object *op)
605{ 545{
606 if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL) 546 if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
607 return; 547 return;
548
608 SET_ANIMATION (op, op->direction); 549 SET_ANIMATION (op, op->direction);
609 update_object (op, UP_OBJ_FACE); 550 update_object (op, UP_OBJ_FACE);
610} 551}
611 552
612/* 553/*
613 * Updates the speed of an object. If the speed changes from 0 to another 554 * Updates the speed of an object. If the speed changes from 0 to another
614 * value, or vice versa, then add/remove the object from the active list. 555 * value, or vice versa, then add/remove the object from the active list.
615 * This function needs to be called whenever the speed of an object changes. 556 * This function needs to be called whenever the speed of an object changes.
616 */ 557 */
617void 558void
618update_ob_speed (object *op) 559object::set_speed (float speed)
619{ 560{
620 extern int arch_init; 561 if (flag [FLAG_FREED] && speed)
621
622 /* No reason putting the archetypes objects on the speed list,
623 * since they never really need to be updated.
624 */
625
626 if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
627 { 562 {
628 LOG (llevError, "Object %s is freed but has speed.\n", &op->name); 563 LOG (llevError, "Object %s is freed but has speed.\n", &name);
629#ifdef MANY_CORES
630 abort ();
631#else
632 op->speed = 0; 564 speed = 0;
633#endif
634 }
635
636 if (arch_init)
637 return;
638
639 if (FABS (op->speed) > MIN_ACTIVE_SPEED)
640 { 565 }
641 /* If already on active list, don't do anything */
642 if (op->active_next || op->active_prev || op == active_objects)
643 return;
644 566
645 /* process_events() expects us to insert the object at the beginning 567 this->speed = speed;
646 * of the list. */
647 op->active_next = active_objects;
648 568
649 if (op->active_next != NULL) 569 if (has_active_speed ())
650 op->active_next->active_prev = op; 570 activate ();
651
652 active_objects = op;
653 }
654 else 571 else
655 { 572 deactivate ();
656 /* If not on the active list, nothing needs to be done */
657 if (!op->active_next && !op->active_prev && op != active_objects)
658 return;
659
660 if (op->active_prev == NULL)
661 {
662 active_objects = op->active_next;
663
664 if (op->active_next != NULL)
665 op->active_next->active_prev = NULL;
666 }
667 else
668 {
669 op->active_prev->active_next = op->active_next;
670
671 if (op->active_next)
672 op->active_next->active_prev = op->active_prev;
673 }
674
675 op->active_next = NULL;
676 op->active_prev = NULL;
677 }
678} 573}
679 574
680/* This function removes object 'op' from the list of active
681 * objects.
682 * This should only be used for style maps or other such
683 * reference maps where you don't want an object that isn't
684 * in play chewing up cpu time getting processed.
685 * The reverse of this is to call update_ob_speed, which
686 * will do the right thing based on the speed of the object.
687 */
688void
689remove_from_active_list (object *op)
690{
691 /* If not on the active list, nothing needs to be done */
692 if (!op->active_next && !op->active_prev && op != active_objects)
693 return;
694
695 if (op->active_prev == NULL)
696 {
697 active_objects = op->active_next;
698 if (op->active_next != NULL)
699 op->active_next->active_prev = NULL;
700 }
701 else
702 {
703 op->active_prev->active_next = op->active_next;
704 if (op->active_next)
705 op->active_next->active_prev = op->active_prev;
706 }
707 op->active_next = NULL;
708 op->active_prev = NULL;
709}
710
711/* 575/*
712 * update_object() updates the array which represents the map. 576 * update_object() updates the the map.
713 * It takes into account invisible objects (and represent squares covered 577 * It takes into account invisible objects (and represent squares covered
714 * by invisible objects by whatever is below them (unless it's another 578 * by invisible objects by whatever is below them (unless it's another
715 * invisible object, etc...) 579 * invisible object, etc...)
716 * If the object being updated is beneath a player, the look-window 580 * If the object being updated is beneath a player, the look-window
717 * of that player is updated (this might be a suboptimal way of 581 * of that player is updated (this might be a suboptimal way of
718 * updating that window, though, since update_object() is called _often_) 582 * updating that window, though, since update_object() is called _often_)
719 * 583 *
720 * action is a hint of what the caller believes need to be done. 584 * action is a hint of what the caller believes need to be done.
721 * For example, if the only thing that has changed is the face (due to
722 * an animation), we don't need to call update_position until that actually
723 * comes into view of a player. OTOH, many other things, like addition/removal
724 * of walls or living creatures may need us to update the flags now.
725 * current action are: 585 * current action are:
726 * UP_OBJ_INSERT: op was inserted 586 * UP_OBJ_INSERT: op was inserted
727 * UP_OBJ_REMOVE: op was removed 587 * UP_OBJ_REMOVE: op was removed
728 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update 588 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
729 * as that is easier than trying to look at what may have changed. 589 * as that is easier than trying to look at what may have changed.
730 * UP_OBJ_FACE: only the objects face has changed. 590 * UP_OBJ_FACE: only the objects face has changed.
731 */ 591 */
732
733void 592void
734update_object (object *op, int action) 593update_object (object *op, int action)
735{ 594{
736 int update_now = 0, flags;
737 MoveType move_on, move_off, move_block, move_slow; 595 MoveType move_on, move_off, move_block, move_slow;
738 596
739 if (op == NULL) 597 if (op == NULL)
740 { 598 {
741 /* this should never happen */ 599 /* this should never happen */
742 LOG (llevDebug, "update_object() called for NULL object.\n"); 600 LOG (llevDebug, "update_object() called for NULL object.\n");
743 return; 601 return;
744 } 602 }
745 603
746 if (op->env != NULL) 604 if (op->env)
747 { 605 {
748 /* Animation is currently handled by client, so nothing 606 /* Animation is currently handled by client, so nothing
749 * to do in this case. 607 * to do in this case.
750 */ 608 */
751 return; 609 return;
… …
756 */ 614 */
757 if (!op->map || op->map->in_memory == MAP_SAVING) 615 if (!op->map || op->map->in_memory == MAP_SAVING)
758 return; 616 return;
759 617
760 /* make sure the object is within map boundaries */ 618 /* make sure the object is within map boundaries */
761 if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map)) 619 if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
762 { 620 {
763 LOG (llevError, "update_object() called for object out of map!\n"); 621 LOG (llevError, "update_object() called for object out of map!\n");
764#ifdef MANY_CORES 622#ifdef MANY_CORES
765 abort (); 623 abort ();
766#endif 624#endif
767 return; 625 return;
768 } 626 }
769 627
770 flags = GET_MAP_FLAGS (op->map, op->x, op->y); 628 mapspace &m = op->ms ();
771 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
772 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
773 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
774 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
775 move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
776 629
630 if (!(m.flags_ & P_UPTODATE))
631 /* nop */;
777 if (action == UP_OBJ_INSERT) 632 else if (action == UP_OBJ_INSERT)
778 { 633 {
634 // this is likely overkill, TODO: revisit (schmorp)
779 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW)) 635 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
780 update_now = 1;
781
782 if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC)) 636 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
783 update_now = 1; 637 || (op->type == PLAYER && !(m.flags_ & P_PLAYER))
784 638 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
639 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
785 if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC)) 640 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
786 update_now = 1;
787
788 if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
789 update_now = 1;
790
791 if (op->type == SAFE_GROUND && !(flags & P_SAFE))
792 update_now = 1;
793
794 if ((move_on | op->move_on) != move_on) 641 || (m.move_on | op->move_on ) != m.move_on
795 update_now = 1;
796
797 if ((move_off | op->move_off) != move_off) 642 || (m.move_off | op->move_off ) != m.move_off
798 update_now = 1; 643 || (m.move_slow | op->move_slow) != m.move_slow
799
800 /* This isn't perfect, but I don't expect a lot of objects to 644 /* This isn't perfect, but I don't expect a lot of objects to
801 * to have move_allow right now. 645 * to have move_allow right now.
802 */ 646 */
803 if (((move_block | op->move_block) & ~op->move_allow) != move_block) 647 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
804 update_now = 1; 648 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
805 649 m.flags_ = 0;
806 if ((move_slow | op->move_slow) != move_slow)
807 update_now = 1;
808 } 650 }
809 /* if the object is being removed, we can't make intelligent 651 /* if the object is being removed, we can't make intelligent
810 * decisions, because remove_ob can't really pass the object 652 * decisions, because remove_ob can't really pass the object
811 * that is being removed. 653 * that is being removed.
812 */ 654 */
813 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 655 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
814 update_now = 1; 656 m.flags_ = 0;
815 else if (action == UP_OBJ_FACE) 657 else if (action == UP_OBJ_FACE)
816 /* Nothing to do for that case */ ; 658 /* Nothing to do for that case */ ;
817 else 659 else
818 LOG (llevError, "update_object called with invalid action: %d\n", action); 660 LOG (llevError, "update_object called with invalid action: %d\n", action);
819 661
820 if (update_now)
821 {
822 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
823 update_position (op->map, op->x, op->y);
824 }
825
826 if (op->more != NULL) 662 if (op->more)
827 update_object (op->more, action); 663 update_object (op->more, action);
828} 664}
829 665
830object::vector object::mortals;
831object::vector object::objects; // not yet used
832object *object::first; 666object *object::first;
833
834void object::free_mortals ()
835{
836 for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
837 if ((*i)->refcnt)
838 ++i; // further delay freeing
839 else
840 {
841 delete *i;
842 mortals.erase (i);
843 }
844
845 static int lastmortals = 0;//D
846
847 if (mortals.size() != lastmortals && lastmortals > 100)//D
848 {
849 lastmortals = mortals.size ();//D
850 LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
851 }
852}
853 667
854object::object () 668object::object ()
855{ 669{
856 SET_FLAG (this, FLAG_REMOVED); 670 SET_FLAG (this, FLAG_REMOVED);
857 671
… …
889 703
890 prev = 0; 704 prev = 0;
891 next = 0; 705 next = 0;
892} 706}
893 707
708bool
709object::active () const
710{
711 return active_next || active_prev || this == active_objects;
712}
713
714void
715object::activate ()
716{
717 /* If already on active list, don't do anything */
718 if (active ())
719 return;
720
721 if (has_active_speed ())
722 {
723 /* process_events() expects us to insert the object at the beginning
724 * of the list. */
725 active_next = active_objects;
726
727 if (active_next)
728 active_next->active_prev = this;
729
730 active_objects = this;
731 }
732}
733
734void
735object::activate_recursive ()
736{
737 activate ();
738
739 for (object *op = inv; op; op = op->below)
740 op->activate_recursive ();
741}
742
743/* This function removes object 'op' from the list of active
744 * objects.
745 * This should only be used for style maps or other such
746 * reference maps where you don't want an object that isn't
747 * in play chewing up cpu time getting processed.
748 * The reverse of this is to call update_ob_speed, which
749 * will do the right thing based on the speed of the object.
750 */
751void
752object::deactivate ()
753{
754 /* If not on the active list, nothing needs to be done */
755 if (!active ())
756 return;
757
758 if (active_prev == 0)
759 {
760 active_objects = active_next;
761 if (active_next)
762 active_next->active_prev = 0;
763 }
764 else
765 {
766 active_prev->active_next = active_next;
767 if (active_next)
768 active_next->active_prev = active_prev;
769 }
770
771 active_next = 0;
772 active_prev = 0;
773}
774
775void
776object::deactivate_recursive ()
777{
778 for (object *op = inv; op; op = op->below)
779 op->deactivate_recursive ();
780
781 deactivate ();
782}
783
784void
785object::set_flag_inv (int flag, int value)
786{
787 for (object *op = inv; op; op = op->below)
788 {
789 op->flag [flag] = value;
790 op->set_flag_inv (flag, value);
791 }
792}
793
794/*
795 * Remove and free all objects in the inventory of the given object.
796 * object.c ?
797 */
798void
799object::destroy_inv (bool drop_to_ground)
800{
801 // need to check first, because the checks below might segfault
802 // as we might be on an invalid mapspace and crossfire code
803 // is too buggy to ensure that the inventory is empty.
804 // corollary: if you create arrows etc. with stuff in tis inventory,
805 // cf will crash below with off-map x and y
806 if (!inv)
807 return;
808
809 /* Only if the space blocks everything do we not process -
810 * if some form of movement is allowed, let objects
811 * drop on that space.
812 */
813 if (!drop_to_ground
814 || !map
815 || map->in_memory != MAP_IN_MEMORY
816 || ms ().move_block == MOVE_ALL)
817 {
818 while (inv)
819 {
820 inv->destroy_inv (drop_to_ground);
821 inv->destroy ();
822 }
823 }
824 else
825 { /* Put objects in inventory onto this space */
826 while (inv)
827 {
828 object *op = inv;
829
830 if (op->flag [FLAG_STARTEQUIP]
831 || op->flag [FLAG_NO_DROP]
832 || op->type == RUNE
833 || op->type == TRAP
834 || op->flag [FLAG_IS_A_TEMPLATE])
835 op->destroy ();
836 else
837 map->insert (op, x, y);
838 }
839 }
840}
841
894object *object::create () 842object *object::create ()
895{ 843{
896 object *op = new object; 844 object *op = new object;
897 op->link (); 845 op->link ();
898 return op; 846 return op;
899} 847}
900 848
901/* 849void
902 * free_object() frees everything allocated by an object, removes 850object::do_destroy ()
903 * it from the list of used objects, and puts it on the list of
904 * free objects. The IS_FREED() flag is set in the object.
905 * The object must have been removed by remove_ob() first for
906 * this function to succeed.
907 *
908 * If destroy_inventory is set, free inventory as well. Else drop items in
909 * inventory to the ground.
910 */
911void object::destroy (bool destroy_inventory)
912{ 851{
913 if (QUERY_FLAG (this, FLAG_FREED)) 852 if (flag [FLAG_IS_LINKED])
853 remove_button_link (this);
854
855 if (flag [FLAG_FRIENDLY])
856 remove_friendly_object (this);
857
858 if (!flag [FLAG_REMOVED])
859 remove ();
860
861 if (flag [FLAG_FREED])
914 return; 862 return;
915 863
916 if (QUERY_FLAG (this, FLAG_FRIENDLY)) 864 set_speed (0);
917 remove_friendly_object (this);
918 865
919 if (!QUERY_FLAG (this, FLAG_REMOVED)) 866 flag [FLAG_FREED] = 1;
920 remove_ob (this);
921 867
922 SET_FLAG (this, FLAG_FREED); 868 attachable::do_destroy ();
869
870 destroy_inv (true);
871 unlink ();
872
873 // hack to ensure that freed objects still have a valid map
874 {
875 static maptile *freed_map; // freed objects are moved here to avoid crashes
876
877 if (!freed_map)
878 {
879 freed_map = new maptile;
880
881 freed_map->name = "/internal/freed_objects_map";
882 freed_map->width = 3;
883 freed_map->height = 3;
884
885 freed_map->alloc ();
886 freed_map->in_memory = MAP_IN_MEMORY;
887 }
888
889 map = freed_map;
890 x = 1;
891 y = 1;
892 }
893
894 head = 0;
923 895
924 if (more) 896 if (more)
925 { 897 {
926 more->destroy (destroy_inventory); 898 more->destroy ();
927 more = 0; 899 more = 0;
928 }
929
930 if (inv)
931 {
932 /* Only if the space blocks everything do we not process -
933 * if some form of movement is allowed, let objects
934 * drop on that space.
935 */
936 if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
937 {
938 object *op = inv;
939
940 while (op)
941 {
942 object *tmp = op->below;
943 op->destroy (destroy_inventory);
944 op = tmp;
945 }
946 }
947 else
948 { /* Put objects in inventory onto this space */
949 object *op = inv;
950
951 while (op)
952 {
953 object *tmp = op->below;
954
955 remove_ob (op);
956
957 if (QUERY_FLAG (op, FLAG_STARTEQUIP)
958 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
959 free_object (op);
960 else
961 {
962 op->x = x;
963 op->y = y;
964 insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
965 }
966
967 op = tmp;
968 }
969 }
970 } 900 }
971 901
972 // clear those pointers that likely might have circular references to us 902 // clear those pointers that likely might have circular references to us
973 owner = 0; 903 owner = 0;
974 enemy = 0; 904 enemy = 0;
975 attacked_by = 0; 905 attacked_by = 0;
976 906
977 // only relevant for players(?), but make sure of it anyways 907 // only relevant for players(?), but make sure of it anyways
978 contr = 0; 908 contr = 0;
909}
979 910
980 /* Remove object from the active list */ 911void
981 speed = 0; 912object::destroy (bool destroy_inventory)
982 update_ob_speed (this); 913{
914 if (destroyed ())
915 return;
983 916
984 unlink (); 917 if (destroy_inventory)
918 destroy_inv (false);
985 919
986 mortals.push_back (this); 920 attachable::destroy ();
987} 921}
988 922
989/* 923/*
990 * sub_weight() recursively (outwards) subtracts a number from the 924 * sub_weight() recursively (outwards) subtracts a number from the
991 * weight of an object (and what is carried by it's environment(s)). 925 * weight of an object (and what is carried by it's environment(s)).
992 */ 926 */
993
994void 927void
995sub_weight (object *op, signed long weight) 928sub_weight (object *op, signed long weight)
996{ 929{
997 while (op != NULL) 930 while (op != NULL)
998 { 931 {
… …
1002 op->carrying -= weight; 935 op->carrying -= weight;
1003 op = op->env; 936 op = op->env;
1004 } 937 }
1005} 938}
1006 939
1007/* remove_ob(op): 940/* op->remove ():
1008 * This function removes the object op from the linked list of objects 941 * This function removes the object op from the linked list of objects
1009 * which it is currently tied to. When this function is done, the 942 * which it is currently tied to. When this function is done, the
1010 * object will have no environment. If the object previously had an 943 * object will have no environment. If the object previously had an
1011 * environment, the x and y coordinates will be updated to 944 * environment, the x and y coordinates will be updated to
1012 * the previous environment. 945 * the previous environment.
1013 * Beware: This function is called from the editor as well! 946 * Beware: This function is called from the editor as well!
1014 */ 947 */
1015
1016void 948void
1017remove_ob (object *op) 949object::remove ()
1018{ 950{
1019 object *tmp, *last = 0; 951 object *tmp, *last = 0;
1020 object *otmp; 952 object *otmp;
1021 953
1022 int check_walk_off;
1023 maptile *m;
1024
1025 sint16 x, y;
1026
1027 if (QUERY_FLAG (op, FLAG_REMOVED)) 954 if (QUERY_FLAG (this, FLAG_REMOVED))
1028 return; 955 return;
1029 956
1030 SET_FLAG (op, FLAG_REMOVED); 957 SET_FLAG (this, FLAG_REMOVED);
958 INVOKE_OBJECT (REMOVE, this);
1031 959
1032 if (op->more != NULL) 960 if (more)
1033 remove_ob (op->more); 961 more->remove ();
1034 962
1035 /* 963 /*
1036 * In this case, the object to be removed is in someones 964 * In this case, the object to be removed is in someones
1037 * inventory. 965 * inventory.
1038 */ 966 */
1039 if (op->env != NULL) 967 if (env)
1040 { 968 {
1041 if (op->nrof) 969 if (nrof)
1042 sub_weight (op->env, op->weight * op->nrof); 970 sub_weight (env, weight * nrof);
1043 else 971 else
1044 sub_weight (op->env, op->weight + op->carrying); 972 sub_weight (env, weight + carrying);
1045 973
1046 /* NO_FIX_PLAYER is set when a great many changes are being 974 /* NO_FIX_PLAYER is set when a great many changes are being
1047 * made to players inventory. If set, avoiding the call 975 * made to players inventory. If set, avoiding the call
1048 * to save cpu time. 976 * to save cpu time.
1049 */ 977 */
1050 if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 978 if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1051 fix_player (otmp); 979 otmp->update_stats ();
1052 980
1053 if (op->above != NULL) 981 if (above)
1054 op->above->below = op->below; 982 above->below = below;
1055 else 983 else
1056 op->env->inv = op->below; 984 env->inv = below;
1057 985
1058 if (op->below != NULL) 986 if (below)
1059 op->below->above = op->above; 987 below->above = above;
1060 988
1061 /* we set up values so that it could be inserted into 989 /* we set up values so that it could be inserted into
1062 * the map, but we don't actually do that - it is up 990 * the map, but we don't actually do that - it is up
1063 * to the caller to decide what we want to do. 991 * to the caller to decide what we want to do.
1064 */ 992 */
1065 op->x = op->env->x, op->y = op->env->y; 993 x = env->x, y = env->y;
1066 op->map = op->env->map; 994 map = env->map;
1067 op->above = NULL, op->below = NULL; 995 above = 0, below = 0;
1068 op->env = NULL; 996 env = 0;
1069 } 997 }
1070 else if (op->map) 998 else if (map)
1071 { 999 {
1072 x = op->x; 1000 if (type == PLAYER)
1073 y = op->y;
1074 m = get_map_from_coord (op->map, &x, &y);
1075
1076 if (!m)
1077 {
1078 LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1079 op->map->path, op->x, op->y);
1080 /* in old days, we used to set x and y to 0 and continue.
1081 * it seems if we get into this case, something is probablye
1082 * screwed up and should be fixed.
1083 */
1084 abort ();
1085 } 1001 {
1086 1002 --map->players;
1087 if (op->map != m) 1003 map->touch ();
1088 LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1089 op->map->path, m->path, op->x, op->y, x, y);
1090
1091 /* Re did the following section of code - it looks like it had
1092 * lots of logic for things we no longer care about
1093 */ 1004 }
1005
1006 map->dirty = true;
1094 1007
1095 /* link the object above us */ 1008 /* link the object above us */
1096 if (op->above) 1009 if (above)
1097 op->above->below = op->below; 1010 above->below = below;
1098 else 1011 else
1099 SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ 1012 map->at (x, y).top = below; /* we were top, set new top */
1100 1013
1101 /* Relink the object below us, if there is one */ 1014 /* Relink the object below us, if there is one */
1102 if (op->below) 1015 if (below)
1103 op->below->above = op->above; 1016 below->above = above;
1104 else 1017 else
1105 { 1018 {
1106 /* Nothing below, which means we need to relink map object for this space 1019 /* Nothing below, which means we need to relink map object for this space
1107 * use translated coordinates in case some oddness with map tiling is 1020 * use translated coordinates in case some oddness with map tiling is
1108 * evident 1021 * evident
1109 */ 1022 */
1110 if (GET_MAP_OB (m, x, y) != op) 1023 if (GET_MAP_OB (map, x, y) != this)
1111 { 1024 {
1112 char *dump = dump_object (op); 1025 char *dump = dump_object (this);
1113 LOG (llevError, 1026 LOG (llevError,
1114 "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); 1027 "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);
1115 free (dump); 1028 free (dump);
1116 dump = dump_object (GET_MAP_OB (m, x, y)); 1029 dump = dump_object (GET_MAP_OB (map, x, y));
1117 LOG (llevError, "%s\n", dump); 1030 LOG (llevError, "%s\n", dump);
1118 free (dump); 1031 free (dump);
1119 } 1032 }
1120 1033
1121 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ 1034 map->at (x, y).bot = above; /* goes on above it. */
1122 } 1035 }
1123 1036
1124 op->above = 0; 1037 above = 0;
1125 op->below = 0; 1038 below = 0;
1126 1039
1127 if (op->map->in_memory == MAP_SAVING) 1040 if (map->in_memory == MAP_SAVING)
1128 return; 1041 return;
1129 1042
1130 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); 1043 int check_walk_off = !flag [FLAG_NO_APPLY];
1131 1044
1132 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1045 for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)
1133 { 1046 {
1134 /* No point updating the players look faces if he is the object 1047 /* No point updating the players look faces if he is the object
1135 * being removed. 1048 * being removed.
1136 */ 1049 */
1137 1050
1138 if (tmp->type == PLAYER && tmp != op) 1051 if (tmp->type == PLAYER && tmp != this)
1139 { 1052 {
1140 /* If a container that the player is currently using somehow gets 1053 /* If a container that the player is currently using somehow gets
1141 * removed (most likely destroyed), update the player view 1054 * removed (most likely destroyed), update the player view
1142 * appropriately. 1055 * appropriately.
1143 */ 1056 */
1144 if (tmp->container == op) 1057 if (tmp->container == this)
1145 { 1058 {
1146 CLEAR_FLAG (op, FLAG_APPLIED); 1059 flag [FLAG_APPLIED] = 0;
1147 tmp->container = NULL; 1060 tmp->container = 0;
1148 } 1061 }
1149 1062
1150 tmp->contr->socket.update_look = 1; 1063 if (tmp->contr->ns)
1064 tmp->contr->ns->floorbox_update ();
1151 } 1065 }
1152 1066
1153 /* See if player moving off should effect something */ 1067 /* See if object moving off should effect something */
1154 if (check_walk_off 1068 if (check_walk_off
1155 && ((op->move_type & tmp->move_off) 1069 && ((move_type & tmp->move_off)
1156 && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1070 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1157 { 1071 {
1158 move_apply (tmp, op, NULL); 1072 move_apply (tmp, this, 0);
1159 1073
1160 if (op->destroyed ()) 1074 if (destroyed ())
1161 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1075 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1162 } 1076 }
1163 1077
1164 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1078 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1165 1079 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1166 if (tmp->above == tmp) 1080 if (tmp->above == tmp)
1167 tmp->above = NULL; 1081 tmp->above = 0;
1168 1082
1169 last = tmp; 1083 last = tmp;
1170 } 1084 }
1171 1085
1172 /* last == NULL of there are no objects on this space */ 1086 /* last == NULL if there are no objects on this space */
1087 //TODO: this makes little sense, why only update the topmost object?
1173 if (last == NULL) 1088 if (!last)
1174 { 1089 map->at (x, y).flags_ = 0;
1175 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1176 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1177 * those out anyways, and if there are any flags set right now, they won't
1178 * be correct anyways.
1179 */
1180 SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1181 update_position (op->map, op->x, op->y);
1182 }
1183 else 1090 else
1184 update_object (last, UP_OBJ_REMOVE); 1091 update_object (last, UP_OBJ_REMOVE);
1185 1092
1186 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) 1093 if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1187 update_all_los (op->map, op->x, op->y); 1094 update_all_los (map, x, y);
1188 } 1095 }
1189} 1096}
1190 1097
1191/* 1098/*
1192 * merge_ob(op,top): 1099 * merge_ob(op,top):
… …
1200merge_ob (object *op, object *top) 1107merge_ob (object *op, object *top)
1201{ 1108{
1202 if (!op->nrof) 1109 if (!op->nrof)
1203 return 0; 1110 return 0;
1204 1111
1205 if (top == NULL) 1112 if (top)
1206 for (top = op; top != NULL && top->above != NULL; top = top->above); 1113 for (top = op; top && top->above; top = top->above)
1114 ;
1207 1115
1208 for (; top != NULL; top = top->below) 1116 for (; top; top = top->below)
1209 { 1117 {
1210 if (top == op) 1118 if (top == op)
1211 continue; 1119 continue;
1212 if (CAN_MERGE (op, top)) 1120
1121 if (object::can_merge (op, top))
1213 { 1122 {
1214 top->nrof += op->nrof; 1123 top->nrof += op->nrof;
1215 1124
1216/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ 1125/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1217 op->weight = 0; /* Don't want any adjustements now */ 1126 op->weight = 0; /* Don't want any adjustements now */
1218 remove_ob (op); 1127 op->destroy ();
1219 free_object (op);
1220 return top; 1128 return top;
1221 } 1129 }
1222 } 1130 }
1223 1131
1224 return 0; 1132 return 0;
… …
1229 * job preparing multi-part monsters 1137 * job preparing multi-part monsters
1230 */ 1138 */
1231object * 1139object *
1232insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1140insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1233{ 1141{
1234 object *tmp;
1235
1236 if (op->head)
1237 op = op->head;
1238
1239 for (tmp = op; tmp; tmp = tmp->more) 1142 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1240 { 1143 {
1241 tmp->x = x + tmp->arch->clone.x; 1144 tmp->x = x + tmp->arch->clone.x;
1242 tmp->y = y + tmp->arch->clone.y; 1145 tmp->y = y + tmp->arch->clone.y;
1243 } 1146 }
1244 1147
… …
1263 * Return value: 1166 * Return value:
1264 * new object if 'op' was merged with other object 1167 * new object if 'op' was merged with other object
1265 * NULL if 'op' was destroyed 1168 * NULL if 'op' was destroyed
1266 * just 'op' otherwise 1169 * just 'op' otherwise
1267 */ 1170 */
1268
1269object * 1171object *
1270insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1172insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1271{ 1173{
1272 object *tmp, *top, *floor = NULL; 1174 object *tmp, *top, *floor = NULL;
1273 sint16 x, y; 1175 sint16 x, y;
… …
1276 { 1178 {
1277 LOG (llevError, "Trying to insert freed object!\n"); 1179 LOG (llevError, "Trying to insert freed object!\n");
1278 return NULL; 1180 return NULL;
1279 } 1181 }
1280 1182
1281 if (m == NULL) 1183 if (!m)
1282 { 1184 {
1283 char *dump = dump_object (op); 1185 char *dump = dump_object (op);
1284 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1186 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1285 free (dump); 1187 free (dump);
1286 return op; 1188 return op;
… …
1307 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); 1209 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1308 free (dump); 1210 free (dump);
1309 return op; 1211 return op;
1310 } 1212 }
1311 1213
1312 if (op->more != NULL) 1214 if (op->more)
1313 { 1215 {
1314 /* The part may be on a different map. */ 1216 /* The part may be on a different map. */
1315 1217
1316 object *more = op->more; 1218 object *more = op->more;
1317 1219
1318 /* We really need the caller to normalize coordinates - if 1220 /* We really need the caller to normalise coordinates - if
1319 * we set the map, that doesn't work if the location is within 1221 * we set the map, that doesn't work if the location is within
1320 * a map and this is straddling an edge. So only if coordinate 1222 * a map and this is straddling an edge. So only if coordinate
1321 * is clear wrong do we normalize it. 1223 * is clear wrong do we normalise it.
1322 */ 1224 */
1323 if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) 1225 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1324 more->map = get_map_from_coord (m, &more->x, &more->y); 1226 more->map = get_map_from_coord (m, &more->x, &more->y);
1325 else if (!more->map) 1227 else if (!more->map)
1326 { 1228 {
… …
1333 if (insert_ob_in_map (more, more->map, originator, flag) == NULL) 1235 if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1334 { 1236 {
1335 if (!op->head) 1237 if (!op->head)
1336 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); 1238 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1337 1239
1338 return NULL; 1240 return 0;
1339 } 1241 }
1340 } 1242 }
1341 1243
1342 CLEAR_FLAG (op, FLAG_REMOVED); 1244 CLEAR_FLAG (op, FLAG_REMOVED);
1343 1245
… …
1350 y = op->y; 1252 y = op->y;
1351 1253
1352 /* this has to be done after we translate the coordinates. 1254 /* this has to be done after we translate the coordinates.
1353 */ 1255 */
1354 if (op->nrof && !(flag & INS_NO_MERGE)) 1256 if (op->nrof && !(flag & INS_NO_MERGE))
1355 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) 1257 for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)
1356 if (CAN_MERGE (op, tmp)) 1258 if (object::can_merge (op, tmp))
1357 { 1259 {
1358 op->nrof += tmp->nrof; 1260 op->nrof += tmp->nrof;
1359 remove_ob (tmp); 1261 tmp->destroy ();
1360 free_object (tmp);
1361 } 1262 }
1362 1263
1363 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1264 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1364 CLEAR_FLAG (op, FLAG_INV_LOCKED); 1265 CLEAR_FLAG (op, FLAG_INV_LOCKED);
1365 1266
… …
1378 op->below = originator->below; 1279 op->below = originator->below;
1379 1280
1380 if (op->below) 1281 if (op->below)
1381 op->below->above = op; 1282 op->below->above = op;
1382 else 1283 else
1383 SET_MAP_OB (op->map, op->x, op->y, op); 1284 op->ms ().bot = op;
1384 1285
1385 /* since *below* originator, no need to update top */ 1286 /* since *below* originator, no need to update top */
1386 originator->below = op; 1287 originator->below = op;
1387 } 1288 }
1388 else 1289 else
1389 { 1290 {
1390 /* If there are other objects, then */ 1291 /* If there are other objects, then */
1391 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) 1292 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))
1392 { 1293 {
1393 object *last = NULL; 1294 object *last = 0;
1394 1295
1395 /* 1296 /*
1396 * If there are multiple objects on this space, we do some trickier handling. 1297 * If there are multiple objects on this space, we do some trickier handling.
1397 * We've already dealt with merging if appropriate. 1298 * We've already dealt with merging if appropriate.
1398 * Generally, we want to put the new object on top. But if 1299 * Generally, we want to put the new object on top. But if
… …
1402 * once we get to them. This reduces the need to traverse over all of 1303 * once we get to them. This reduces the need to traverse over all of
1403 * them when adding another one - this saves quite a bit of cpu time 1304 * them when adding another one - this saves quite a bit of cpu time
1404 * when lots of spells are cast in one area. Currently, it is presumed 1305 * when lots of spells are cast in one area. Currently, it is presumed
1405 * that flying non pickable objects are spell objects. 1306 * that flying non pickable objects are spell objects.
1406 */ 1307 */
1407
1408 while (top != NULL) 1308 while (top)
1409 { 1309 {
1410 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1310 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1411 floor = top; 1311 floor = top;
1412 1312
1413 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1313 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
… …
1434 * If INS_ON_TOP is used, don't do this processing 1334 * If INS_ON_TOP is used, don't do this processing
1435 * Need to find the object that in fact blocks view, otherwise 1335 * Need to find the object that in fact blocks view, otherwise
1436 * stacking is a bit odd. 1336 * stacking is a bit odd.
1437 */ 1337 */
1438 if (!(flag & INS_ON_TOP) && 1338 if (!(flag & INS_ON_TOP) &&
1439 (get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) 1339 (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))
1440 { 1340 {
1441 for (last = top; last != floor; last = last->below) 1341 for (last = top; last != floor; last = last->below)
1442 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1342 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1443 break; 1343 break;
1444 /* Check to see if we found the object that blocks view, 1344 /* Check to see if we found the object that blocks view,
… …
1466 op->above = GET_MAP_OB (op->map, op->x, op->y); 1366 op->above = GET_MAP_OB (op->map, op->x, op->y);
1467 1367
1468 if (op->above) 1368 if (op->above)
1469 op->above->below = op; 1369 op->above->below = op;
1470 1370
1471 op->below = NULL; 1371 op->below = 0;
1472 SET_MAP_OB (op->map, op->x, op->y, op); 1372 op->ms ().bot = op;
1473 } 1373 }
1474 else 1374 else
1475 { /* get inserted into the stack above top */ 1375 { /* get inserted into the stack above top */
1476 op->above = top->above; 1376 op->above = top->above;
1477 1377
… …
1480 1380
1481 op->below = top; 1381 op->below = top;
1482 top->above = op; 1382 top->above = op;
1483 } 1383 }
1484 1384
1485 if (op->above == NULL) 1385 if (!op->above)
1486 SET_MAP_TOP (op->map, op->x, op->y, op); 1386 op->ms ().top = op;
1487 } /* else not INS_BELOW_ORIGINATOR */ 1387 } /* else not INS_BELOW_ORIGINATOR */
1488 1388
1489 if (op->type == PLAYER) 1389 if (op->type == PLAYER)
1390 {
1490 op->contr->do_los = 1; 1391 op->contr->do_los = 1;
1392 ++op->map->players;
1393 op->map->touch ();
1394 }
1395
1396 op->map->dirty = true;
1491 1397
1492 /* If we have a floor, we know the player, if any, will be above 1398 /* If we have a floor, we know the player, if any, will be above
1493 * it, so save a few ticks and start from there. 1399 * it, so save a few ticks and start from there.
1494 */ 1400 */
1495 if (!(flag & INS_MAP_LOAD)) 1401 if (!(flag & INS_MAP_LOAD))
1496 for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1402 if (object *pl = op->ms ().player ())
1497 if (tmp->type == PLAYER) 1403 if (pl->contr->ns)
1498 tmp->contr->socket.update_look = 1; 1404 pl->contr->ns->floorbox_update ();
1499 1405
1500 /* If this object glows, it may affect lighting conditions that are 1406 /* If this object glows, it may affect lighting conditions that are
1501 * visible to others on this map. But update_all_los is really 1407 * visible to others on this map. But update_all_los is really
1502 * an inefficient way to do this, as it means los for all players 1408 * an inefficient way to do this, as it means los for all players
1503 * on the map will get recalculated. The players could very well 1409 * on the map will get recalculated. The players could very well
1504 * be far away from this change and not affected in any way - 1410 * be far away from this change and not affected in any way -
1505 * this should get redone to only look for players within range, 1411 * this should get redone to only look for players within range,
1506 * or just updating the P_NEED_UPDATE for spaces within this area 1412 * or just updating the P_UPTODATE for spaces within this area
1507 * of effect may be sufficient. 1413 * of effect may be sufficient.
1508 */ 1414 */
1509 if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) 1415 if (op->map->darkness && (op->glow_radius != 0))
1510 update_all_los (op->map, op->x, op->y); 1416 update_all_los (op->map, op->x, op->y);
1511 1417
1512 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1418 /* updates flags (blocked, alive, no magic, etc) for this map space */
1513 update_object (op, UP_OBJ_INSERT); 1419 update_object (op, UP_OBJ_INSERT);
1514 1420
1421 INVOKE_OBJECT (INSERT, op);
1422
1515 /* Don't know if moving this to the end will break anything. However, 1423 /* Don't know if moving this to the end will break anything. However,
1516 * we want to have update_look set above before calling this. 1424 * we want to have floorbox_update called before calling this.
1517 * 1425 *
1518 * check_move_on() must be after this because code called from 1426 * check_move_on() must be after this because code called from
1519 * check_move_on() depends on correct map flags (so functions like 1427 * check_move_on() depends on correct map flags (so functions like
1520 * blocked() and wall() work properly), and these flags are updated by 1428 * blocked() and wall() work properly), and these flags are updated by
1521 * update_object(). 1429 * update_object().
… …
1523 1431
1524 /* if this is not the head or flag has been passed, don't check walk on status */ 1432 /* if this is not the head or flag has been passed, don't check walk on status */
1525 if (!(flag & INS_NO_WALK_ON) && !op->head) 1433 if (!(flag & INS_NO_WALK_ON) && !op->head)
1526 { 1434 {
1527 if (check_move_on (op, originator)) 1435 if (check_move_on (op, originator))
1528 return NULL; 1436 return 0;
1529 1437
1530 /* If we are a multi part object, lets work our way through the check 1438 /* If we are a multi part object, lets work our way through the check
1531 * walk on's. 1439 * walk on's.
1532 */ 1440 */
1533 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1441 for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1534 if (check_move_on (tmp, originator)) 1442 if (check_move_on (tmp, originator))
1535 return NULL; 1443 return 0;
1536 } 1444 }
1537 1445
1538 return op; 1446 return op;
1539} 1447}
1540 1448
1541/* this function inserts an object in the map, but if it 1449/* this function inserts an object in the map, but if it
1542 * finds an object of its own type, it'll remove that one first. 1450 * finds an object of its own type, it'll remove that one first.
1543 * op is the object to insert it under: supplies x and the map. 1451 * op is the object to insert it under: supplies x and the map.
1544 */ 1452 */
1545void 1453void
1546replace_insert_ob_in_map (const char *arch_string, object *op) 1454replace_insert_ob_in_map (const char *arch_string, object *op)
1547{ 1455{
1548 object * 1456 object *tmp, *tmp1;
1549 tmp;
1550 object *
1551 tmp1;
1552 1457
1553 /* first search for itself and remove any old instances */ 1458 /* first search for itself and remove any old instances */
1554 1459
1555 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1460 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1556 {
1557 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1461 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1558 { 1462 tmp->destroy ();
1559 remove_ob (tmp);
1560 free_object (tmp);
1561 }
1562 }
1563 1463
1564 tmp1 = arch_to_object (archetype::find (arch_string)); 1464 tmp1 = arch_to_object (archetype::find (arch_string));
1565 1465
1566 tmp1->x = op->x; 1466 tmp1->x = op->x;
1567 tmp1->y = op->y; 1467 tmp1->y = op->y;
1568 insert_ob_in_map (tmp1, op->map, op, 0); 1468 insert_ob_in_map (tmp1, op->map, op, 0);
1469}
1470
1471object *
1472object::insert_at (object *where, object *originator, int flags)
1473{
1474 where->map->insert (this, where->x, where->y, originator, flags);
1569} 1475}
1570 1476
1571/* 1477/*
1572 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1478 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1573 * is returned contains nr objects, and the remaining parts contains 1479 * is returned contains nr objects, and the remaining parts contains
1574 * the rest (or is removed and freed if that number is 0). 1480 * the rest (or is removed and freed if that number is 0).
1575 * On failure, NULL is returned, and the reason put into the 1481 * On failure, NULL is returned, and the reason put into the
1576 * global static errmsg array. 1482 * global static errmsg array.
1577 */ 1483 */
1578
1579object * 1484object *
1580get_split_ob (object *orig_ob, uint32 nr) 1485get_split_ob (object *orig_ob, uint32 nr)
1581{ 1486{
1582 object * 1487 object *newob;
1583 newob;
1584 int
1585 is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); 1488 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1586 1489
1587 if (orig_ob->nrof < nr) 1490 if (orig_ob->nrof < nr)
1588 { 1491 {
1589 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); 1492 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1590 return NULL; 1493 return NULL;
1591 } 1494 }
1592 1495
1593 newob = object_create_clone (orig_ob); 1496 newob = object_create_clone (orig_ob);
1594 1497
1595 if ((orig_ob->nrof -= nr) < 1) 1498 if ((orig_ob->nrof -= nr) < 1)
1596 { 1499 orig_ob->destroy (1);
1597 if (!is_removed)
1598 remove_ob (orig_ob);
1599 free_object2 (orig_ob, 1);
1600 }
1601 else if (!is_removed) 1500 else if (!is_removed)
1602 { 1501 {
1603 if (orig_ob->env != NULL) 1502 if (orig_ob->env != NULL)
1604 sub_weight (orig_ob->env, orig_ob->weight * nr); 1503 sub_weight (orig_ob->env, orig_ob->weight * nr);
1605 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) 1504 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
… …
1625 1524
1626object * 1525object *
1627decrease_ob_nr (object *op, uint32 i) 1526decrease_ob_nr (object *op, uint32 i)
1628{ 1527{
1629 object *tmp; 1528 object *tmp;
1630 player *pl;
1631 1529
1632 if (i == 0) /* objects with op->nrof require this check */ 1530 if (i == 0) /* objects with op->nrof require this check */
1633 return op; 1531 return op;
1634 1532
1635 if (i > op->nrof) 1533 if (i > op->nrof)
1636 i = op->nrof; 1534 i = op->nrof;
1637 1535
1638 if (QUERY_FLAG (op, FLAG_REMOVED)) 1536 if (QUERY_FLAG (op, FLAG_REMOVED))
1639 op->nrof -= i; 1537 op->nrof -= i;
1640 else if (op->env != NULL) 1538 else if (op->env)
1641 { 1539 {
1642 /* is this object in the players inventory, or sub container 1540 /* is this object in the players inventory, or sub container
1643 * therein? 1541 * therein?
1644 */ 1542 */
1645 tmp = is_player_inv (op->env); 1543 tmp = op->in_player ();
1646 /* nope. Is this a container the player has opened? 1544 /* nope. Is this a container the player has opened?
1647 * If so, set tmp to that player. 1545 * If so, set tmp to that player.
1648 * IMO, searching through all the players will mostly 1546 * IMO, searching through all the players will mostly
1649 * likely be quicker than following op->env to the map, 1547 * likely be quicker than following op->env to the map,
1650 * and then searching the map for a player. 1548 * and then searching the map for a player.
1651 */ 1549 */
1652 if (!tmp) 1550 if (!tmp)
1653 { 1551 for_all_players (pl)
1654 for (pl = first_player; pl; pl = pl->next)
1655 if (pl->ob->container == op->env) 1552 if (pl->ob->container == op->env)
1553 {
1554 tmp = pl->ob;
1656 break; 1555 break;
1657 if (pl)
1658 tmp = pl->ob;
1659 else
1660 tmp = NULL;
1661 } 1556 }
1662 1557
1663 if (i < op->nrof) 1558 if (i < op->nrof)
1664 { 1559 {
1665 sub_weight (op->env, op->weight * i); 1560 sub_weight (op->env, op->weight * i);
1666 op->nrof -= i; 1561 op->nrof -= i;
1667 if (tmp) 1562 if (tmp)
1668 {
1669 esrv_send_item (tmp, op); 1563 esrv_send_item (tmp, op);
1670 }
1671 } 1564 }
1672 else 1565 else
1673 { 1566 {
1674 remove_ob (op); 1567 op->remove ();
1675 op->nrof = 0; 1568 op->nrof = 0;
1676 if (tmp) 1569 if (tmp)
1677 {
1678 esrv_del_item (tmp->contr, op->count); 1570 esrv_del_item (tmp->contr, op->count);
1679 }
1680 } 1571 }
1681 } 1572 }
1682 else 1573 else
1683 { 1574 {
1684 object *above = op->above; 1575 object *above = op->above;
1685 1576
1686 if (i < op->nrof) 1577 if (i < op->nrof)
1687 op->nrof -= i; 1578 op->nrof -= i;
1688 else 1579 else
1689 { 1580 {
1690 remove_ob (op); 1581 op->remove ();
1691 op->nrof = 0; 1582 op->nrof = 0;
1692 } 1583 }
1693 1584
1694 /* Since we just removed op, op->above is null */ 1585 /* Since we just removed op, op->above is null */
1695 for (tmp = above; tmp != NULL; tmp = tmp->above) 1586 for (tmp = above; tmp; tmp = tmp->above)
1696 if (tmp->type == PLAYER) 1587 if (tmp->type == PLAYER)
1697 { 1588 {
1698 if (op->nrof) 1589 if (op->nrof)
1699 esrv_send_item (tmp, op); 1590 esrv_send_item (tmp, op);
1700 else 1591 else
… …
1704 1595
1705 if (op->nrof) 1596 if (op->nrof)
1706 return op; 1597 return op;
1707 else 1598 else
1708 { 1599 {
1709 free_object (op); 1600 op->destroy ();
1710 return NULL; 1601 return 0;
1711 } 1602 }
1712} 1603}
1713 1604
1714/* 1605/*
1715 * add_weight(object, weight) adds the specified weight to an object, 1606 * add_weight(object, weight) adds the specified weight to an object,
… …
1727 op->carrying += weight; 1618 op->carrying += weight;
1728 op = op->env; 1619 op = op->env;
1729 } 1620 }
1730} 1621}
1731 1622
1732/*
1733 * insert_ob_in_ob(op,environment):
1734 * This function inserts the object op in the linked list
1735 * inside the object environment.
1736 *
1737 * Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter
1738 * the inventory at the last position or next to other objects of the same
1739 * type.
1740 * Frank: Now sorted by type, archetype and magic!
1741 *
1742 * The function returns now pointer to inserted item, and return value can
1743 * be != op, if items are merged. -Tero
1744 */
1745
1746object * 1623object *
1747insert_ob_in_ob (object *op, object *where) 1624insert_ob_in_ob (object *op, object *where)
1748{ 1625{
1749 object * 1626 if (!where)
1750 tmp, *
1751 otmp;
1752
1753 if (!QUERY_FLAG (op, FLAG_REMOVED))
1754 {
1755 char *dump = dump_object (op);
1756 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump);
1757 free (dump);
1758 return op;
1759 }
1760
1761 if (where == NULL)
1762 { 1627 {
1763 char *dump = dump_object (op); 1628 char *dump = dump_object (op);
1764 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1629 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1765 free (dump); 1630 free (dump);
1766 return op; 1631 return op;
1767 } 1632 }
1768 1633
1769 if (where->head) 1634 if (where->head)
1770 { 1635 {
1771 LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n"); 1636 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");
1772 where = where->head; 1637 where = where->head;
1773 } 1638 }
1639
1640 return where->insert (op);
1641}
1642
1643/*
1644 * env->insert (op)
1645 * This function inserts the object op in the linked list
1646 * inside the object environment.
1647 *
1648 * The function returns now pointer to inserted item, and return value can
1649 * be != op, if items are merged. -Tero
1650 */
1651
1652object *
1653object::insert (object *op)
1654{
1655 object *tmp, *otmp;
1656
1657 if (!QUERY_FLAG (op, FLAG_REMOVED))
1658 op->remove ();
1774 1659
1775 if (op->more) 1660 if (op->more)
1776 { 1661 {
1777 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); 1662 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1778 return op; 1663 return op;
… …
1780 1665
1781 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1666 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1782 CLEAR_FLAG (op, FLAG_REMOVED); 1667 CLEAR_FLAG (op, FLAG_REMOVED);
1783 if (op->nrof) 1668 if (op->nrof)
1784 { 1669 {
1785 for (tmp = where->inv; tmp != NULL; tmp = tmp->below) 1670 for (tmp = inv; tmp != NULL; tmp = tmp->below)
1786 if (CAN_MERGE (tmp, op)) 1671 if (object::can_merge (tmp, op))
1787 { 1672 {
1788 /* return the original object and remove inserted object 1673 /* return the original object and remove inserted object
1789 (client needs the original object) */ 1674 (client needs the original object) */
1790 tmp->nrof += op->nrof; 1675 tmp->nrof += op->nrof;
1791 /* Weight handling gets pretty funky. Since we are adding to 1676 /* Weight handling gets pretty funky. Since we are adding to
1792 * tmp->nrof, we need to increase the weight. 1677 * tmp->nrof, we need to increase the weight.
1793 */ 1678 */
1794 add_weight (where, op->weight * op->nrof); 1679 add_weight (this, op->weight * op->nrof);
1795 SET_FLAG (op, FLAG_REMOVED); 1680 SET_FLAG (op, FLAG_REMOVED);
1796 free_object (op); /* free the inserted object */ 1681 op->destroy (); /* free the inserted object */
1797 op = tmp; 1682 op = tmp;
1798 remove_ob (op); /* and fix old object's links */ 1683 op->remove (); /* and fix old object's links */
1799 CLEAR_FLAG (op, FLAG_REMOVED); 1684 CLEAR_FLAG (op, FLAG_REMOVED);
1800 break; 1685 break;
1801 } 1686 }
1802 1687
1803 /* I assume combined objects have no inventory 1688 /* I assume combined objects have no inventory
1804 * We add the weight - this object could have just been removed 1689 * We add the weight - this object could have just been removed
1805 * (if it was possible to merge). calling remove_ob will subtract 1690 * (if it was possible to merge). calling remove_ob will subtract
1806 * the weight, so we need to add it in again, since we actually do 1691 * the weight, so we need to add it in again, since we actually do
1807 * the linking below 1692 * the linking below
1808 */ 1693 */
1809 add_weight (where, op->weight * op->nrof); 1694 add_weight (this, op->weight * op->nrof);
1810 } 1695 }
1811 else 1696 else
1812 add_weight (where, (op->weight + op->carrying)); 1697 add_weight (this, (op->weight + op->carrying));
1813 1698
1814 otmp = is_player_inv (where); 1699 otmp = this->in_player ();
1815 if (otmp && otmp->contr != NULL) 1700 if (otmp && otmp->contr)
1816 {
1817 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1701 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1818 fix_player (otmp); 1702 otmp->update_stats ();
1819 }
1820 1703
1821 op->map = NULL; 1704 op->map = 0;
1822 op->env = where; 1705 op->env = this;
1823 op->above = NULL; 1706 op->above = 0;
1824 op->below = NULL; 1707 op->below = 0;
1825 op->x = 0, op->y = 0; 1708 op->x = 0, op->y = 0;
1826 1709
1827 /* reset the light list and los of the players on the map */ 1710 /* reset the light list and los of the players on the map */
1828 if ((op->glow_radius != 0) && where->map) 1711 if ((op->glow_radius != 0) && map)
1829 { 1712 {
1830#ifdef DEBUG_LIGHTS 1713#ifdef DEBUG_LIGHTS
1831 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); 1714 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1832#endif /* DEBUG_LIGHTS */ 1715#endif /* DEBUG_LIGHTS */
1833 if (MAP_DARKNESS (where->map)) 1716 if (map->darkness)
1834 update_all_los (where->map, where->x, where->y); 1717 update_all_los (map, x, y);
1835 } 1718 }
1836 1719
1837 /* Client has no idea of ordering so lets not bother ordering it here. 1720 /* Client has no idea of ordering so lets not bother ordering it here.
1838 * It sure simplifies this function... 1721 * It sure simplifies this function...
1839 */ 1722 */
1840 if (where->inv == NULL) 1723 if (!inv)
1841 where->inv = op; 1724 inv = op;
1842 else 1725 else
1843 { 1726 {
1844 op->below = where->inv; 1727 op->below = inv;
1845 op->below->above = op; 1728 op->below->above = op;
1846 where->inv = op; 1729 inv = op;
1847 } 1730 }
1731
1732 INVOKE_OBJECT (INSERT, this);
1733
1848 return op; 1734 return op;
1849} 1735}
1850 1736
1851/* 1737/*
1852 * Checks if any objects has a move_type that matches objects 1738 * Checks if any objects has a move_type that matches objects
… …
1866 * 1752 *
1867 * MSW 2001-07-08: Check all objects on space, not just those below 1753 * MSW 2001-07-08: Check all objects on space, not just those below
1868 * object being inserted. insert_ob_in_map may not put new objects 1754 * object being inserted. insert_ob_in_map may not put new objects
1869 * on top. 1755 * on top.
1870 */ 1756 */
1871
1872int 1757int
1873check_move_on (object *op, object *originator) 1758check_move_on (object *op, object *originator)
1874{ 1759{
1875 object *tmp; 1760 object *tmp;
1876 maptile *m = op->map; 1761 maptile *m = op->map;
… …
1903 1788
1904 /* The objects have to be checked from top to bottom. 1789 /* The objects have to be checked from top to bottom.
1905 * Hence, we first go to the top: 1790 * Hence, we first go to the top:
1906 */ 1791 */
1907 1792
1908 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above) 1793 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1909 { 1794 {
1910 /* Trim the search when we find the first other spell effect 1795 /* Trim the search when we find the first other spell effect
1911 * this helps performance so that if a space has 50 spell objects, 1796 * this helps performance so that if a space has 50 spell objects,
1912 * we don't need to check all of them. 1797 * we don't need to check all of them.
1913 */ 1798 */
… …
1968/* 1853/*
1969 * present_arch(arch, map, x, y) searches for any objects with 1854 * present_arch(arch, map, x, y) searches for any objects with
1970 * a matching archetype at the given map and coordinates. 1855 * a matching archetype at the given map and coordinates.
1971 * The first matching object is returned, or NULL if none. 1856 * The first matching object is returned, or NULL if none.
1972 */ 1857 */
1973
1974object * 1858object *
1975present_arch (const archetype *at, maptile *m, int x, int y) 1859present_arch (const archetype *at, maptile *m, int x, int y)
1976{ 1860{
1977 object *
1978 tmp;
1979
1980 if (m == NULL || out_of_map (m, x, y)) 1861 if (!m || out_of_map (m, x, y))
1981 { 1862 {
1982 LOG (llevError, "Present_arch called outside map.\n"); 1863 LOG (llevError, "Present_arch called outside map.\n");
1983 return NULL; 1864 return NULL;
1984 } 1865 }
1985 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1866
1867 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1986 if (tmp->arch == at) 1868 if (tmp->arch == at)
1987 return tmp; 1869 return tmp;
1870
1988 return NULL; 1871 return NULL;
1989} 1872}
1990 1873
1991/* 1874/*
1992 * present(type, map, x, y) searches for any objects with 1875 * present(type, map, x, y) searches for any objects with
1993 * a matching type variable at the given map and coordinates. 1876 * a matching type variable at the given map and coordinates.
1994 * The first matching object is returned, or NULL if none. 1877 * The first matching object is returned, or NULL if none.
1995 */ 1878 */
1996
1997object * 1879object *
1998present (unsigned char type, maptile *m, int x, int y) 1880present (unsigned char type, maptile *m, int x, int y)
1999{ 1881{
2000 object *
2001 tmp;
2002
2003 if (out_of_map (m, x, y)) 1882 if (out_of_map (m, x, y))
2004 { 1883 {
2005 LOG (llevError, "Present called outside map.\n"); 1884 LOG (llevError, "Present called outside map.\n");
2006 return NULL; 1885 return NULL;
2007 } 1886 }
2008 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1887
1888 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
2009 if (tmp->type == type) 1889 if (tmp->type == type)
2010 return tmp; 1890 return tmp;
1891
2011 return NULL; 1892 return NULL;
2012} 1893}
2013 1894
2014/* 1895/*
2015 * present_in_ob(type, object) searches for any objects with 1896 * present_in_ob(type, object) searches for any objects with
2016 * a matching type variable in the inventory of the given object. 1897 * a matching type variable in the inventory of the given object.
2017 * The first matching object is returned, or NULL if none. 1898 * The first matching object is returned, or NULL if none.
2018 */ 1899 */
2019
2020object * 1900object *
2021present_in_ob (unsigned char type, const object *op) 1901present_in_ob (unsigned char type, const object *op)
2022{ 1902{
2023 object *
2024 tmp;
2025
2026 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1903 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2027 if (tmp->type == type) 1904 if (tmp->type == type)
2028 return tmp; 1905 return tmp;
1906
2029 return NULL; 1907 return NULL;
2030} 1908}
2031 1909
2032/* 1910/*
2033 * present_in_ob (type, str, object) searches for any objects with 1911 * present_in_ob (type, str, object) searches for any objects with
… …
2041 * str is the string to match against. Note that we match against 1919 * str is the string to match against. Note that we match against
2042 * the object name, not the archetype name. this is so that the 1920 * the object name, not the archetype name. this is so that the
2043 * spell code can use one object type (force), but change it's name 1921 * spell code can use one object type (force), but change it's name
2044 * to be unique. 1922 * to be unique.
2045 */ 1923 */
2046
2047object * 1924object *
2048present_in_ob_by_name (int type, const char *str, const object *op) 1925present_in_ob_by_name (int type, const char *str, const object *op)
2049{ 1926{
2050 object *
2051 tmp;
2052
2053 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1927 for (object *tmp = op->inv; tmp; tmp = tmp->below)
2054 {
2055 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) 1928 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2056 return tmp; 1929 return tmp;
2057 } 1930
2058 return NULL; 1931 return 0;
2059} 1932}
2060 1933
2061/* 1934/*
2062 * present_arch_in_ob(archetype, object) searches for any objects with 1935 * present_arch_in_ob(archetype, object) searches for any objects with
2063 * a matching archetype in the inventory of the given object. 1936 * a matching archetype in the inventory of the given object.
2064 * The first matching object is returned, or NULL if none. 1937 * The first matching object is returned, or NULL if none.
2065 */ 1938 */
2066
2067object * 1939object *
2068present_arch_in_ob (const archetype *at, const object *op) 1940present_arch_in_ob (const archetype *at, const object *op)
2069{ 1941{
2070 object *
2071 tmp;
2072
2073 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1942 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2074 if (tmp->arch == at) 1943 if (tmp->arch == at)
2075 return tmp; 1944 return tmp;
1945
2076 return NULL; 1946 return NULL;
2077} 1947}
2078 1948
2079/* 1949/*
2080 * activate recursively a flag on an object inventory 1950 * activate recursively a flag on an object inventory
2081 */ 1951 */
2082void 1952void
2083flag_inv (object *op, int flag) 1953flag_inv (object *op, int flag)
2084{ 1954{
2085 object *
2086 tmp;
2087
2088 if (op->inv) 1955 if (op->inv)
2089 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1956 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2090 { 1957 {
2091 SET_FLAG (tmp, flag); 1958 SET_FLAG (tmp, flag);
2092 flag_inv (tmp, flag); 1959 flag_inv (tmp, flag);
2093 } 1960 }
2094} /* 1961}
1962
1963/*
2095 * desactivate recursively a flag on an object inventory 1964 * deactivate recursively a flag on an object inventory
2096 */ 1965 */
2097void 1966void
2098unflag_inv (object *op, int flag) 1967unflag_inv (object *op, int flag)
2099{ 1968{
2100 object *
2101 tmp;
2102
2103 if (op->inv) 1969 if (op->inv)
2104 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1970 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2105 { 1971 {
2106 CLEAR_FLAG (tmp, flag); 1972 CLEAR_FLAG (tmp, flag);
2107 unflag_inv (tmp, flag); 1973 unflag_inv (tmp, flag);
2108 } 1974 }
2109} 1975}
… …
2112 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in 1978 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2113 * all it's inventory (recursively). 1979 * all it's inventory (recursively).
2114 * If checksums are used, a player will get set_cheat called for 1980 * If checksums are used, a player will get set_cheat called for
2115 * him/her-self and all object carried by a call to this function. 1981 * him/her-self and all object carried by a call to this function.
2116 */ 1982 */
2117
2118void 1983void
2119set_cheat (object *op) 1984set_cheat (object *op)
2120{ 1985{
2121 SET_FLAG (op, FLAG_WAS_WIZ); 1986 SET_FLAG (op, FLAG_WAS_WIZ);
2122 flag_inv (op, FLAG_WAS_WIZ); 1987 flag_inv (op, FLAG_WAS_WIZ);
… …
2141 * because arch_blocked (now ob_blocked) needs to know the movement type 2006 * because arch_blocked (now ob_blocked) needs to know the movement type
2142 * to know if the space in question will block the object. We can't use 2007 * to know if the space in question will block the object. We can't use
2143 * the archetype because that isn't correct if the monster has been 2008 * the archetype because that isn't correct if the monster has been
2144 * customized, changed states, etc. 2009 * customized, changed states, etc.
2145 */ 2010 */
2146
2147int 2011int
2148find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 2012find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2149{ 2013{
2150 int
2151 i,
2152 index = 0, flag; 2014 int index = 0, flag;
2153 static int
2154 altern[SIZEOFFREE]; 2015 int altern[SIZEOFFREE];
2155 2016
2156 for (i = start; i < stop; i++) 2017 for (int i = start; i < stop; i++)
2157 { 2018 {
2158 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); 2019 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2159 if (!flag) 2020 if (!flag)
2160 altern[index++] = i; 2021 altern [index++] = i;
2161 2022
2162 /* Basically, if we find a wall on a space, we cut down the search size. 2023 /* Basically, if we find a wall on a space, we cut down the search size.
2163 * In this way, we won't return spaces that are on another side of a wall. 2024 * In this way, we won't return spaces that are on another side of a wall.
2164 * This mostly work, but it cuts down the search size in all directions - 2025 * This mostly work, but it cuts down the search size in all directions -
2165 * if the space being examined only has a wall to the north and empty 2026 * if the space being examined only has a wall to the north and empty
2166 * spaces in all the other directions, this will reduce the search space 2027 * spaces in all the other directions, this will reduce the search space
2167 * to only the spaces immediately surrounding the target area, and 2028 * to only the spaces immediately surrounding the target area, and
2168 * won't look 2 spaces south of the target space. 2029 * won't look 2 spaces south of the target space.
2169 */ 2030 */
2170 else if ((flag & AB_NO_PASS) && maxfree[i] < stop) 2031 else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2171 stop = maxfree[i]; 2032 stop = maxfree[i];
2172 } 2033 }
2034
2173 if (!index) 2035 if (!index)
2174 return -1; 2036 return -1;
2037
2175 return altern[RANDOM () % index]; 2038 return altern[RANDOM () % index];
2176} 2039}
2177 2040
2178/* 2041/*
2179 * find_first_free_spot(archetype, maptile, x, y) works like 2042 * find_first_free_spot(archetype, maptile, x, y) works like
2180 * find_free_spot(), but it will search max number of squares. 2043 * find_free_spot(), but it will search max number of squares.
2181 * But it will return the first available spot, not a random choice. 2044 * But it will return the first available spot, not a random choice.
2182 * Changed 0.93.2: Have it return -1 if there is no free spot available. 2045 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2183 */ 2046 */
2184
2185int 2047int
2186find_first_free_spot (const object *ob, maptile *m, int x, int y) 2048find_first_free_spot (const object *ob, maptile *m, int x, int y)
2187{ 2049{
2188 int
2189 i;
2190
2191 for (i = 0; i < SIZEOFFREE; i++) 2050 for (int i = 0; i < SIZEOFFREE; i++)
2192 {
2193 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) 2051 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2194 return i; 2052 return i;
2195 } 2053
2196 return -1; 2054 return -1;
2197} 2055}
2198 2056
2199/* 2057/*
2200 * The function permute(arr, begin, end) randomly reorders the array 2058 * The function permute(arr, begin, end) randomly reorders the array
2201 * arr[begin..end-1]. 2059 * arr[begin..end-1].
2060 * now uses a fisher-yates shuffle, old permute was broken
2202 */ 2061 */
2203static void 2062static void
2204permute (int *arr, int begin, int end) 2063permute (int *arr, int begin, int end)
2205{ 2064{
2206 int 2065 arr += begin;
2207 i,
2208 j,
2209 tmp,
2210 len;
2211
2212 len = end - begin; 2066 end -= begin;
2213 for (i = begin; i < end; i++)
2214 {
2215 j = begin + RANDOM () % len;
2216 2067
2217 tmp = arr[i]; 2068 while (--end)
2218 arr[i] = arr[j]; 2069 swap (arr [end], arr [RANDOM () % (end + 1)]);
2219 arr[j] = tmp;
2220 }
2221} 2070}
2222 2071
2223/* new function to make monster searching more efficient, and effective! 2072/* new function to make monster searching more efficient, and effective!
2224 * This basically returns a randomized array (in the passed pointer) of 2073 * This basically returns a randomized array (in the passed pointer) of
2225 * the spaces to find monsters. In this way, it won't always look for 2074 * the spaces to find monsters. In this way, it won't always look for
… …
2228 * the 3x3 area will be searched, just not in a predictable order. 2077 * the 3x3 area will be searched, just not in a predictable order.
2229 */ 2078 */
2230void 2079void
2231get_search_arr (int *search_arr) 2080get_search_arr (int *search_arr)
2232{ 2081{
2233 int 2082 int i;
2234 i;
2235 2083
2236 for (i = 0; i < SIZEOFFREE; i++) 2084 for (i = 0; i < SIZEOFFREE; i++)
2237 {
2238 search_arr[i] = i; 2085 search_arr[i] = i;
2239 }
2240 2086
2241 permute (search_arr, 1, SIZEOFFREE1 + 1); 2087 permute (search_arr, 1, SIZEOFFREE1 + 1);
2242 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); 2088 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2243 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); 2089 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2244} 2090}
… …
2253 * Perhaps incorrectly, but I'm making the assumption that exclude 2099 * Perhaps incorrectly, but I'm making the assumption that exclude
2254 * is actually want is going to try and move there. We need this info 2100 * is actually want is going to try and move there. We need this info
2255 * because we have to know what movement the thing looking to move 2101 * because we have to know what movement the thing looking to move
2256 * there is capable of. 2102 * there is capable of.
2257 */ 2103 */
2258
2259int 2104int
2260find_dir (maptile *m, int x, int y, object *exclude) 2105find_dir (maptile *m, int x, int y, object *exclude)
2261{ 2106{
2262 int
2263 i,
2264 max = SIZEOFFREE, mflags; 2107 int i, max = SIZEOFFREE, mflags;
2265 2108
2266 sint16 nx, ny; 2109 sint16 nx, ny;
2267 object * 2110 object *tmp;
2268 tmp;
2269 maptile * 2111 maptile *mp;
2270 mp;
2271 2112
2272 MoveType blocked, move_type; 2113 MoveType blocked, move_type;
2273 2114
2274 if (exclude && exclude->head) 2115 if (exclude && exclude->head)
2275 { 2116 {
… …
2287 mp = m; 2128 mp = m;
2288 nx = x + freearr_x[i]; 2129 nx = x + freearr_x[i];
2289 ny = y + freearr_y[i]; 2130 ny = y + freearr_y[i];
2290 2131
2291 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2132 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
2133
2292 if (mflags & P_OUT_OF_MAP) 2134 if (mflags & P_OUT_OF_MAP)
2293 {
2294 max = maxfree[i]; 2135 max = maxfree[i];
2295 }
2296 else 2136 else
2297 { 2137 {
2298 blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); 2138 mapspace &ms = mp->at (nx, ny);
2139
2140 blocked = ms.move_block;
2299 2141
2300 if ((move_type & blocked) == move_type) 2142 if ((move_type & blocked) == move_type)
2301 {
2302 max = maxfree[i]; 2143 max = maxfree[i];
2303 }
2304 else if (mflags & P_IS_ALIVE) 2144 else if (mflags & P_IS_ALIVE)
2305 { 2145 {
2306 for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above) 2146 for (tmp = ms.bot; tmp; tmp = tmp->above)
2307 { 2147 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2308 if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2148 && (tmp != exclude || (tmp->head && tmp->head != exclude)))
2309 {
2310 break; 2149 break;
2311 } 2150
2312 }
2313 if (tmp) 2151 if (tmp)
2314 {
2315 return freedir[i]; 2152 return freedir[i];
2316 }
2317 } 2153 }
2318 } 2154 }
2319 } 2155 }
2156
2320 return 0; 2157 return 0;
2321} 2158}
2322 2159
2323/* 2160/*
2324 * distance(object 1, object 2) will return the square of the 2161 * distance(object 1, object 2) will return the square of the
2325 * distance between the two given objects. 2162 * distance between the two given objects.
2326 */ 2163 */
2327
2328int 2164int
2329distance (const object *ob1, const object *ob2) 2165distance (const object *ob1, const object *ob2)
2330{ 2166{
2331 int
2332 i;
2333
2334 i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); 2167 return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2335 return i;
2336} 2168}
2337 2169
2338/* 2170/*
2339 * find_dir_2(delta-x,delta-y) will return a direction in which 2171 * find_dir_2(delta-x,delta-y) will return a direction in which
2340 * an object which has subtracted the x and y coordinates of another 2172 * an object which has subtracted the x and y coordinates of another
2341 * object, needs to travel toward it. 2173 * object, needs to travel toward it.
2342 */ 2174 */
2343
2344int 2175int
2345find_dir_2 (int x, int y) 2176find_dir_2 (int x, int y)
2346{ 2177{
2347 int 2178 int q;
2348 q;
2349 2179
2350 if (y) 2180 if (y)
2351 q = x * 100 / y; 2181 q = x * 100 / y;
2352 else if (x) 2182 else if (x)
2353 q = -300 * x; 2183 q = -300 * x;
… …
2388int 2218int
2389absdir (int d) 2219absdir (int d)
2390{ 2220{
2391 while (d < 1) 2221 while (d < 1)
2392 d += 8; 2222 d += 8;
2223
2393 while (d > 8) 2224 while (d > 8)
2394 d -= 8; 2225 d -= 8;
2226
2395 return d; 2227 return d;
2396} 2228}
2397 2229
2398/* 2230/*
2399 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2231 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
… …
2401 */ 2233 */
2402 2234
2403int 2235int
2404dirdiff (int dir1, int dir2) 2236dirdiff (int dir1, int dir2)
2405{ 2237{
2406 int 2238 int d;
2407 d;
2408 2239
2409 d = abs (dir1 - dir2); 2240 d = abs (dir1 - dir2);
2410 if (d > 4) 2241 if (d > 4)
2411 d = 8 - d; 2242 d = 8 - d;
2243
2412 return d; 2244 return d;
2413} 2245}
2414 2246
2415/* peterm: 2247/* peterm:
2416 * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. 2248 * do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
… …
2419 * This basically means that if direction is 15, then it could either go 2251 * This basically means that if direction is 15, then it could either go
2420 * direction 4, 14, or 16 to get back to where we are. 2252 * direction 4, 14, or 16 to get back to where we are.
2421 * Moved from spell_util.c to object.c with the other related direction 2253 * Moved from spell_util.c to object.c with the other related direction
2422 * functions. 2254 * functions.
2423 */ 2255 */
2424
2425int
2426 reduction_dir[SIZEOFFREE][3] = { 2256int reduction_dir[SIZEOFFREE][3] = {
2427 {0, 0, 0}, /* 0 */ 2257 {0, 0, 0}, /* 0 */
2428 {0, 0, 0}, /* 1 */ 2258 {0, 0, 0}, /* 1 */
2429 {0, 0, 0}, /* 2 */ 2259 {0, 0, 0}, /* 2 */
2430 {0, 0, 0}, /* 3 */ 2260 {0, 0, 0}, /* 3 */
2431 {0, 0, 0}, /* 4 */ 2261 {0, 0, 0}, /* 4 */
… …
2479 * find a path to that monster that we found. If not, 2309 * find a path to that monster that we found. If not,
2480 * we don't bother going toward it. Returns 1 if we 2310 * we don't bother going toward it. Returns 1 if we
2481 * can see a direct way to get it 2311 * can see a direct way to get it
2482 * Modified to be map tile aware -.MSW 2312 * Modified to be map tile aware -.MSW
2483 */ 2313 */
2484
2485
2486int 2314int
2487can_see_monsterP (maptile *m, int x, int y, int dir) 2315can_see_monsterP (maptile *m, int x, int y, int dir)
2488{ 2316{
2489 sint16 dx, dy; 2317 sint16 dx, dy;
2490 int
2491 mflags; 2318 int mflags;
2492 2319
2493 if (dir < 0) 2320 if (dir < 0)
2494 return 0; /* exit condition: invalid direction */ 2321 return 0; /* exit condition: invalid direction */
2495 2322
2496 dx = x + freearr_x[dir]; 2323 dx = x + freearr_x[dir];
… …
2509 return 0; 2336 return 0;
2510 2337
2511 /* yes, can see. */ 2338 /* yes, can see. */
2512 if (dir < 9) 2339 if (dir < 9)
2513 return 1; 2340 return 1;
2341
2514 return can_see_monsterP (m, x, y, reduction_dir[dir][0]) | 2342 return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2515 can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]); 2343 | can_see_monsterP (m, x, y, reduction_dir[dir][1])
2344 | can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2516} 2345}
2517
2518
2519 2346
2520/* 2347/*
2521 * can_pick(picker, item): finds out if an object is possible to be 2348 * can_pick(picker, item): finds out if an object is possible to be
2522 * picked up by the picker. Returnes 1 if it can be 2349 * picked up by the picker. Returnes 1 if it can be
2523 * picked up, otherwise 0. 2350 * picked up, otherwise 0.
… …
2534 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2361 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2535 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2362 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2536 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); 2363 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2537} 2364}
2538 2365
2539
2540/* 2366/*
2541 * create clone from object to another 2367 * create clone from object to another
2542 */ 2368 */
2543object * 2369object *
2544object_create_clone (object *asrc) 2370object_create_clone (object *asrc)
2545{ 2371{
2546 object *
2547 dst = NULL, *tmp, *src, *part, *prev, *item; 2372 object *dst = 0, *tmp, *src, *part, *prev, *item;
2548 2373
2549 if (!asrc) 2374 if (!asrc)
2550 return NULL; 2375 return 0;
2376
2551 src = asrc; 2377 src = asrc;
2552 if (src->head) 2378 if (src->head)
2553 src = src->head; 2379 src = src->head;
2554 2380
2555 prev = NULL; 2381 prev = 0;
2556 for (part = src; part; part = part->more) 2382 for (part = src; part; part = part->more)
2557 { 2383 {
2558 tmp = get_object (); 2384 tmp = part->clone ();
2559 copy_object (part, tmp);
2560 tmp->x -= src->x; 2385 tmp->x -= src->x;
2561 tmp->y -= src->y; 2386 tmp->y -= src->y;
2387
2562 if (!part->head) 2388 if (!part->head)
2563 { 2389 {
2564 dst = tmp; 2390 dst = tmp;
2565 tmp->head = NULL; 2391 tmp->head = 0;
2566 } 2392 }
2567 else 2393 else
2568 {
2569 tmp->head = dst; 2394 tmp->head = dst;
2570 } 2395
2571 tmp->more = NULL; 2396 tmp->more = 0;
2397
2572 if (prev) 2398 if (prev)
2573 prev->more = tmp; 2399 prev->more = tmp;
2400
2574 prev = tmp; 2401 prev = tmp;
2575 } 2402 }
2576 2403
2577 for (item = src->inv; item; item = item->below) 2404 for (item = src->inv; item; item = item->below)
2578 insert_ob_in_ob (object_create_clone (item), dst); 2405 insert_ob_in_ob (object_create_clone (item), dst);
… …
2584/* Basically, we save the content of the string to a temp file, then call */ 2411/* Basically, we save the content of the string to a temp file, then call */
2585/* load_object on it. I admit it is a highly inefficient way to make things, */ 2412/* load_object on it. I admit it is a highly inefficient way to make things, */
2586/* but it was simple to make and allows reusing the load_object function. */ 2413/* but it was simple to make and allows reusing the load_object function. */
2587/* Remember not to use load_object_str in a time-critical situation. */ 2414/* Remember not to use load_object_str in a time-critical situation. */
2588/* Also remember that multiparts objects are not supported for now. */ 2415/* Also remember that multiparts objects are not supported for now. */
2589
2590object * 2416object *
2591load_object_str (const char *obstr) 2417load_object_str (const char *obstr)
2592{ 2418{
2593 object *op; 2419 object *op;
2594 char filename[MAX_BUF]; 2420 char filename[MAX_BUF];
… …
2604 } 2430 }
2605 2431
2606 fprintf (tempfile, obstr); 2432 fprintf (tempfile, obstr);
2607 fclose (tempfile); 2433 fclose (tempfile);
2608 2434
2609 op = get_object (); 2435 op = object::create ();
2610 2436
2611 object_thawer thawer (filename); 2437 object_thawer thawer (filename);
2612 2438
2613 if (thawer) 2439 if (thawer)
2614 load_object (thawer, op, 0); 2440 load_object (thawer, op, 0);
… …
2624 * returns NULL if no match. 2450 * returns NULL if no match.
2625 */ 2451 */
2626object * 2452object *
2627find_obj_by_type_subtype (const object *who, int type, int subtype) 2453find_obj_by_type_subtype (const object *who, int type, int subtype)
2628{ 2454{
2629 object *tmp;
2630
2631 for (tmp = who->inv; tmp; tmp = tmp->below) 2455 for (object *tmp = who->inv; tmp; tmp = tmp->below)
2632 if (tmp->type == type && tmp->subtype == subtype) 2456 if (tmp->type == type && tmp->subtype == subtype)
2633 return tmp; 2457 return tmp;
2634 2458
2635 return NULL; 2459 return 0;
2636} 2460}
2637 2461
2638/* If ob has a field named key, return the link from the list, 2462/* If ob has a field named key, return the link from the list,
2639 * otherwise return NULL. 2463 * otherwise return NULL.
2640 * 2464 *
… …
2642 * do the desired thing. 2466 * do the desired thing.
2643 */ 2467 */
2644key_value * 2468key_value *
2645get_ob_key_link (const object *ob, const char *key) 2469get_ob_key_link (const object *ob, const char *key)
2646{ 2470{
2647 key_value *link;
2648
2649 for (link = ob->key_values; link != NULL; link = link->next) 2471 for (key_value *link = ob->key_values; link; link = link->next)
2650 if (link->key == key) 2472 if (link->key == key)
2651 return link; 2473 return link;
2652 2474
2653 return NULL; 2475 return 0;
2654} 2476}
2655 2477
2656/* 2478/*
2657 * Returns the value of op has an extra_field for key, or NULL. 2479 * Returns the value of op has an extra_field for key, or NULL.
2658 * 2480 *
… …
2698 * Returns TRUE on success. 2520 * Returns TRUE on success.
2699 */ 2521 */
2700int 2522int
2701set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) 2523set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2702{ 2524{
2703 key_value *
2704 field = NULL, *last = NULL; 2525 key_value *field = NULL, *last = NULL;
2705 2526
2706 for (field = op->key_values; field != NULL; field = field->next) 2527 for (field = op->key_values; field != NULL; field = field->next)
2707 { 2528 {
2708 if (field->key != canonical_key) 2529 if (field->key != canonical_key)
2709 { 2530 {
… …
2737 /* IF we get here, key doesn't exist */ 2558 /* IF we get here, key doesn't exist */
2738 2559
2739 /* No field, we'll have to add it. */ 2560 /* No field, we'll have to add it. */
2740 2561
2741 if (!add_key) 2562 if (!add_key)
2742 {
2743 return FALSE; 2563 return FALSE;
2744 } 2564
2745 /* There isn't any good reason to store a null 2565 /* There isn't any good reason to store a null
2746 * value in the key/value list. If the archetype has 2566 * value in the key/value list. If the archetype has
2747 * this key, then we should also have it, so shouldn't 2567 * this key, then we should also have it, so shouldn't
2748 * be here. If user wants to store empty strings, 2568 * be here. If user wants to store empty strings,
2749 * should pass in "" 2569 * should pass in ""
… …
2798 } 2618 }
2799 else 2619 else
2800 item = item->env; 2620 item = item->env;
2801} 2621}
2802 2622
2623
2624const char *
2625object::flag_desc (char *desc, int len) const
2626{
2627 char *p = desc;
2628 bool first = true;
2629
2630 *p = 0;
2631
2632 for (int i = 0; i < NUM_FLAGS; i++)
2633 {
2634 if (len <= 10) // magic constant!
2635 {
2636 snprintf (p, len, ",...");
2637 break;
2638 }
2639
2640 if (flag [i])
2641 {
2642 int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
2643 len -= cnt;
2644 p += cnt;
2645 first = false;
2646 }
2647 }
2648
2649 return desc;
2650}
2651
2803// return a suitable string describing an objetc in enough detail to find it 2652// return a suitable string describing an object in enough detail to find it
2804const char * 2653const char *
2805object::debug_desc (char *info) const 2654object::debug_desc (char *info) const
2806{ 2655{
2656 char flagdesc[512];
2807 char info2[256 * 3]; 2657 char info2[256 * 4];
2808 char *p = info; 2658 char *p = info;
2809 2659
2810 p += snprintf (p, 256, "%d=\"%s%s%s\"", 2660 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",
2811 count, 2661 count, uuid.seq,
2812 &name, 2662 &name,
2813 title ? " " : "", 2663 title ? "\",title:" : "",
2814 title ? (const char *)title : ""); 2664 title ? (const char *)title : "",
2665 flag_desc (flagdesc, 512), type);
2815 2666
2816 if (env) 2667 if (env)
2817 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2668 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2818 2669
2819 if (map) 2670 if (map)
2820 p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); 2671 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2821 2672
2822 return info; 2673 return info;
2823} 2674}
2824 2675
2825const char * 2676const char *
2826object::debug_desc () const 2677object::debug_desc () const
2827{ 2678{
2828 static char info[256 * 3]; 2679 static char info[256 * 4];
2829 return debug_desc (info); 2680 return debug_desc (info);
2830} 2681}
2831 2682

Diff Legend

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