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

Diff Legend

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