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.61 by root, Mon Dec 11 21:32:16 2006 UTC vs.
Revision 1.108 by root, Sun Jan 7 02:39:13 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,
… …
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 return ((unsigned int)i) < objects.size ()
418 if (op->count == i) 401 ? objects [i]
419 return op; 402 : 0;
420
421 return 0;
422} 403}
423 404
424/* 405/*
425 * Returns the first object which has a name equal to the argument. 406 * Returns the first object which has a name equal to the argument.
426 * Used only by the patch command, but not all that useful. 407 * Used only by the patch command, but not all that useful.
427 * Enables features like "patch <name-of-other-player> food 999" 408 * Enables features like "patch <name-of-other-player> food 999"
428 */ 409 */
429
430object * 410object *
431find_object_name (const char *str) 411find_object_name (const char *str)
432{ 412{
433 shstr_cmp str_ (str); 413 shstr_cmp str_ (str);
434 object *op; 414 object *op;
435 415
436 for (op = object::first; op != NULL; op = op->next) 416 for_all_objects (op)
437 if (op->name == str_) 417 if (op->name == str_)
438 break; 418 break;
439 419
440 return op; 420 return op;
441} 421}
… …
484 } 464 }
485 465
486 op->key_values = 0; 466 op->key_values = 0;
487} 467}
488 468
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/* 469/*
541 * copy object first frees everything allocated by the second object, 470 * copy_to first frees everything allocated by the dst object,
542 * and then copies the contends of the first object into the second 471 * and then copies the contents of itself into the second
543 * object, allocating what needs to be allocated. Basically, any 472 * object, allocating what needs to be allocated. Basically, any
544 * data that is malloc'd needs to be re-malloc/copied. Otherwise, 473 * 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 474 * if the first object is freed, the pointers in the new object
546 * will point at garbage. 475 * will point at garbage.
547 */ 476 */
548void 477void
549copy_object (object *op2, object *op) 478object::copy_to (object *dst)
550{ 479{
551 bool is_freed = QUERY_FLAG (op, FLAG_FREED); 480 bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
552 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); 481 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
553 482
554 op2->clone (op); 483 *(object_copy *)dst = *this;
555 484
556 if (is_freed) 485 if (is_freed)
557 SET_FLAG (op, FLAG_FREED); 486 SET_FLAG (dst, FLAG_FREED);
558 487
559 if (is_removed) 488 if (is_removed)
560 SET_FLAG (op, FLAG_REMOVED); 489 SET_FLAG (dst, FLAG_REMOVED);
561 490
562 if (op2->speed < 0) 491 if (speed < 0)
563 op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0; 492 dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
564 493
565 /* Copy over key_values, if any. */ 494 /* Copy over key_values, if any. */
566 if (op2->key_values) 495 if (key_values)
567 { 496 {
568 key_value *tail = 0; 497 key_value *tail = 0;
569 key_value *i; 498 key_value *i;
570 499
571 op->key_values = 0; 500 dst->key_values = 0;
572 501
573 for (i = op2->key_values; i; i = i->next) 502 for (i = key_values; i; i = i->next)
574 { 503 {
575 key_value *new_link = new key_value; 504 key_value *new_link = new key_value;
576 505
577 new_link->next = 0; 506 new_link->next = 0;
578 new_link->key = i->key; 507 new_link->key = i->key;
579 new_link->value = i->value; 508 new_link->value = i->value;
580 509
581 /* Try and be clever here, too. */ 510 /* Try and be clever here, too. */
582 if (!op->key_values) 511 if (!dst->key_values)
583 { 512 {
584 op->key_values = new_link; 513 dst->key_values = new_link;
585 tail = new_link; 514 tail = new_link;
586 } 515 }
587 else 516 else
588 { 517 {
589 tail->next = new_link; 518 tail->next = new_link;
590 tail = new_link; 519 tail = new_link;
591 } 520 }
592 } 521 }
593 } 522 }
594 523
595 update_ob_speed (op); 524 dst->set_speed (dst->speed);
525}
526
527object *
528object::clone ()
529{
530 object *neu = create ();
531 copy_to (neu);
532 return neu;
596} 533}
597 534
598/* 535/*
599 * If an object with the IS_TURNABLE() flag needs to be turned due 536 * If an object with the IS_TURNABLE() flag needs to be turned due
600 * to the closest player being on the other side, this function can 537 * to the closest player being on the other side, this function can
601 * be called to update the face variable, _and_ how it looks on the map. 538 * be called to update the face variable, _and_ how it looks on the map.
602 */ 539 */
603
604void 540void
605update_turn_face (object *op) 541update_turn_face (object *op)
606{ 542{
607 if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL) 543 if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
608 return; 544 return;
545
609 SET_ANIMATION (op, op->direction); 546 SET_ANIMATION (op, op->direction);
610 update_object (op, UP_OBJ_FACE); 547 update_object (op, UP_OBJ_FACE);
611} 548}
612 549
613/* 550/*
614 * Updates the speed of an object. If the speed changes from 0 to another 551 * Updates the speed of an object. If the speed changes from 0 to another
615 * value, or vice versa, then add/remove the object from the active list. 552 * value, or vice versa, then add/remove the object from the active list.
616 * This function needs to be called whenever the speed of an object changes. 553 * This function needs to be called whenever the speed of an object changes.
617 */ 554 */
618void 555void
619update_ob_speed (object *op) 556object::set_speed (float speed)
620{ 557{
621 extern int arch_init; 558 if (flag [FLAG_FREED] && speed)
622
623 /* No reason putting the archetypes objects on the speed list,
624 * since they never really need to be updated.
625 */
626
627 if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
628 { 559 {
629 LOG (llevError, "Object %s is freed but has speed.\n", &op->name); 560 LOG (llevError, "Object %s is freed but has speed.\n", &name);
630#ifdef MANY_CORES
631 abort ();
632#else
633 op->speed = 0; 561 speed = 0;
634#endif
635 }
636
637 if (arch_init)
638 return;
639
640 if (FABS (op->speed) > MIN_ACTIVE_SPEED)
641 { 562 }
642 /* If already on active list, don't do anything */
643 if (op->active_next || op->active_prev || op == active_objects)
644 return;
645 563
646 /* process_events() expects us to insert the object at the beginning 564 this->speed = speed;
647 * of the list. */
648 op->active_next = active_objects;
649 565
650 if (op->active_next != NULL) 566 if (has_active_speed ())
651 op->active_next->active_prev = op; 567 activate ();
652
653 active_objects = op;
654 }
655 else 568 else
656 { 569 deactivate ();
657 /* If not on the active list, nothing needs to be done */
658 if (!op->active_next && !op->active_prev && op != active_objects)
659 return;
660
661 if (op->active_prev == NULL)
662 {
663 active_objects = op->active_next;
664
665 if (op->active_next != NULL)
666 op->active_next->active_prev = NULL;
667 }
668 else
669 {
670 op->active_prev->active_next = op->active_next;
671
672 if (op->active_next)
673 op->active_next->active_prev = op->active_prev;
674 }
675
676 op->active_next = NULL;
677 op->active_prev = NULL;
678 }
679} 570}
680 571
681/* This function removes object 'op' from the list of active
682 * objects.
683 * This should only be used for style maps or other such
684 * reference maps where you don't want an object that isn't
685 * in play chewing up cpu time getting processed.
686 * The reverse of this is to call update_ob_speed, which
687 * will do the right thing based on the speed of the object.
688 */
689void
690remove_from_active_list (object *op)
691{
692 /* If not on the active list, nothing needs to be done */
693 if (!op->active_next && !op->active_prev && op != active_objects)
694 return;
695
696 if (op->active_prev == NULL)
697 {
698 active_objects = op->active_next;
699 if (op->active_next != NULL)
700 op->active_next->active_prev = NULL;
701 }
702 else
703 {
704 op->active_prev->active_next = op->active_next;
705 if (op->active_next)
706 op->active_next->active_prev = op->active_prev;
707 }
708 op->active_next = NULL;
709 op->active_prev = NULL;
710}
711
712/* 572/*
713 * update_object() updates the array which represents the map. 573 * update_object() updates the the map.
714 * It takes into account invisible objects (and represent squares covered 574 * It takes into account invisible objects (and represent squares covered
715 * by invisible objects by whatever is below them (unless it's another 575 * by invisible objects by whatever is below them (unless it's another
716 * invisible object, etc...) 576 * invisible object, etc...)
717 * If the object being updated is beneath a player, the look-window 577 * If the object being updated is beneath a player, the look-window
718 * of that player is updated (this might be a suboptimal way of 578 * of that player is updated (this might be a suboptimal way of
719 * updating that window, though, since update_object() is called _often_) 579 * updating that window, though, since update_object() is called _often_)
720 * 580 *
721 * action is a hint of what the caller believes need to be done. 581 * action is a hint of what the caller believes need to be done.
722 * For example, if the only thing that has changed is the face (due to
723 * an animation), we don't need to call update_position until that actually
724 * comes into view of a player. OTOH, many other things, like addition/removal
725 * of walls or living creatures may need us to update the flags now.
726 * current action are: 582 * current action are:
727 * UP_OBJ_INSERT: op was inserted 583 * UP_OBJ_INSERT: op was inserted
728 * UP_OBJ_REMOVE: op was removed 584 * UP_OBJ_REMOVE: op was removed
729 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update 585 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
730 * as that is easier than trying to look at what may have changed. 586 * as that is easier than trying to look at what may have changed.
731 * UP_OBJ_FACE: only the objects face has changed. 587 * UP_OBJ_FACE: only the objects face has changed.
732 */ 588 */
733
734void 589void
735update_object (object *op, int action) 590update_object (object *op, int action)
736{ 591{
737 int update_now = 0, flags;
738 MoveType move_on, move_off, move_block, move_slow; 592 MoveType move_on, move_off, move_block, move_slow;
739 593
740 if (op == NULL) 594 if (op == NULL)
741 { 595 {
742 /* this should never happen */ 596 /* this should never happen */
743 LOG (llevDebug, "update_object() called for NULL object.\n"); 597 LOG (llevDebug, "update_object() called for NULL object.\n");
744 return; 598 return;
745 } 599 }
746 600
747 if (op->env != NULL) 601 if (op->env)
748 { 602 {
749 /* Animation is currently handled by client, so nothing 603 /* Animation is currently handled by client, so nothing
750 * to do in this case. 604 * to do in this case.
751 */ 605 */
752 return; 606 return;
… …
757 */ 611 */
758 if (!op->map || op->map->in_memory == MAP_SAVING) 612 if (!op->map || op->map->in_memory == MAP_SAVING)
759 return; 613 return;
760 614
761 /* make sure the object is within map boundaries */ 615 /* make sure the object is within map boundaries */
762 if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map)) 616 if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
763 { 617 {
764 LOG (llevError, "update_object() called for object out of map!\n"); 618 LOG (llevError, "update_object() called for object out of map!\n");
765#ifdef MANY_CORES 619#ifdef MANY_CORES
766 abort (); 620 abort ();
767#endif 621#endif
768 return; 622 return;
769 } 623 }
770 624
771 flags = GET_MAP_FLAGS (op->map, op->x, op->y); 625 mapspace &m = op->ms ();
772 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
773 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
774 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
775 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
776 move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
777 626
627 if (!(m.flags_ & P_UPTODATE))
628 /* nop */;
778 if (action == UP_OBJ_INSERT) 629 else if (action == UP_OBJ_INSERT)
779 { 630 {
631 // this is likely overkill, TODO: revisit (schmorp)
780 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW)) 632 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
781 update_now = 1;
782
783 if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC)) 633 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
784 update_now = 1; 634 || (op->type == PLAYER && !(m.flags_ & P_PLAYER))
785 635 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
636 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
786 if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC)) 637 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
787 update_now = 1;
788
789 if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
790 update_now = 1;
791
792 if (op->type == SAFE_GROUND && !(flags & P_SAFE))
793 update_now = 1;
794
795 if ((move_on | op->move_on) != move_on) 638 || (m.move_on | op->move_on ) != m.move_on
796 update_now = 1;
797
798 if ((move_off | op->move_off) != move_off) 639 || (m.move_off | op->move_off ) != m.move_off
799 update_now = 1; 640 || (m.move_slow | op->move_slow) != m.move_slow
800
801 /* This isn't perfect, but I don't expect a lot of objects to 641 /* This isn't perfect, but I don't expect a lot of objects to
802 * to have move_allow right now. 642 * to have move_allow right now.
803 */ 643 */
804 if (((move_block | op->move_block) & ~op->move_allow) != move_block) 644 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
805 update_now = 1; 645 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
806 646 m.flags_ = 0;
807 if ((move_slow | op->move_slow) != move_slow)
808 update_now = 1;
809 } 647 }
810
811 /* if the object is being removed, we can't make intelligent 648 /* if the object is being removed, we can't make intelligent
812 * decisions, because remove_ob can't really pass the object 649 * decisions, because remove_ob can't really pass the object
813 * that is being removed. 650 * that is being removed.
814 */ 651 */
815 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 652 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
816 update_now = 1; 653 m.flags_ = 0;
817 else if (action == UP_OBJ_FACE) 654 else if (action == UP_OBJ_FACE)
818 /* Nothing to do for that case */ ; 655 /* Nothing to do for that case */ ;
819 else 656 else
820 LOG (llevError, "update_object called with invalid action: %d\n", action); 657 LOG (llevError, "update_object called with invalid action: %d\n", action);
821 658
822 if (update_now)
823 {
824 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
825 update_position (op->map, op->x, op->y);
826 }
827
828 if (op->more != NULL) 659 if (op->more)
829 update_object (op->more, action); 660 update_object (op->more, action);
830} 661}
831 662
832object::vector object::mortals;
833object::vector object::objects; // not yet used
834object *object::first; 663object *object::first;
835
836void object::free_mortals ()
837{
838 for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
839 if ((*i)->refcnt)
840 ++i; // further delay freeing
841 else
842 {
843 delete *i;
844 mortals.erase (i);
845 }
846}
847 664
848object::object () 665object::object ()
849{ 666{
850 SET_FLAG (this, FLAG_REMOVED); 667 SET_FLAG (this, FLAG_REMOVED);
851 668
… …
858 free_key_values (this); 675 free_key_values (this);
859} 676}
860 677
861void object::link () 678void object::link ()
862{ 679{
863 count = ++ob_count;
864 uuid = gen_uuid (); 680 uuid = gen_uuid ();
865 681
866 prev = 0; 682 objects.insert (this);
867 next = object::first;
868
869 if (object::first)
870 object::first->prev = this;
871
872 object::first = this;
873} 683}
874 684
875void object::unlink () 685void object::unlink ()
876{ 686{
877 if (this == object::first) 687 objects.erase (this);
878 object::first = next; 688}
879 689
880 /* Remove this object from the list of used objects */ 690void
881 if (prev) prev->next = next; 691object::activate ()
882 if (next) next->prev = prev; 692{
693 /* If already on active list, don't do anything */
694 if (active)
695 return;
883 696
884 prev = 0; 697 if (has_active_speed ())
885 next = 0; 698 actives.insert (this);
699}
700
701void
702object::activate_recursive ()
703{
704 activate ();
705
706 for (object *op = inv; op; op = op->below)
707 op->activate_recursive ();
708}
709
710/* This function removes object 'op' from the list of active
711 * objects.
712 * This should only be used for style maps or other such
713 * reference maps where you don't want an object that isn't
714 * in play chewing up cpu time getting processed.
715 * The reverse of this is to call update_ob_speed, which
716 * will do the right thing based on the speed of the object.
717 */
718void
719object::deactivate ()
720{
721 /* If not on the active list, nothing needs to be done */
722 if (!active)
723 return;
724
725 actives.erase (this);
726}
727
728void
729object::deactivate_recursive ()
730{
731 for (object *op = inv; op; op = op->below)
732 op->deactivate_recursive ();
733
734 deactivate ();
735}
736
737void
738object::set_flag_inv (int flag, int value)
739{
740 for (object *op = inv; op; op = op->below)
741 {
742 op->flag [flag] = value;
743 op->set_flag_inv (flag, value);
744 }
745}
746
747/*
748 * Remove and free all objects in the inventory of the given object.
749 * object.c ?
750 */
751void
752object::destroy_inv (bool drop_to_ground)
753{
754 // need to check first, because the checks below might segfault
755 // as we might be on an invalid mapspace and crossfire code
756 // is too buggy to ensure that the inventory is empty.
757 // corollary: if you create arrows etc. with stuff in tis inventory,
758 // cf will crash below with off-map x and y
759 if (!inv)
760 return;
761
762 /* Only if the space blocks everything do we not process -
763 * if some form of movement is allowed, let objects
764 * drop on that space.
765 */
766 if (!drop_to_ground
767 || !map
768 || map->in_memory != MAP_IN_MEMORY
769 || ms ().move_block == MOVE_ALL)
770 {
771 while (inv)
772 {
773 inv->destroy_inv (drop_to_ground);
774 inv->destroy ();
775 }
776 }
777 else
778 { /* Put objects in inventory onto this space */
779 while (inv)
780 {
781 object *op = inv;
782
783 if (op->flag [FLAG_STARTEQUIP]
784 || op->flag [FLAG_NO_DROP]
785 || op->type == RUNE
786 || op->type == TRAP
787 || op->flag [FLAG_IS_A_TEMPLATE])
788 op->destroy ();
789 else
790 map->insert (op, x, y);
791 }
792 }
886} 793}
887 794
888object *object::create () 795object *object::create ()
889{ 796{
890 object *op = new object; 797 object *op = new object;
891 op->link (); 798 op->link ();
892 return op; 799 return op;
893} 800}
894 801
895/* 802void
896 * free_object() frees everything allocated by an object, removes 803object::do_destroy ()
897 * it from the list of used objects, and puts it on the list of
898 * free objects. The IS_FREED() flag is set in the object.
899 * The object must have been removed by remove_ob() first for
900 * this function to succeed.
901 *
902 * If destroy_inventory is set, free inventory as well. Else drop items in
903 * inventory to the ground.
904 */
905void object::destroy (bool destroy_inventory)
906{ 804{
907 if (QUERY_FLAG (this, FLAG_FREED)) 805 if (flag [FLAG_IS_LINKED])
806 remove_button_link (this);
807
808 if (flag [FLAG_FRIENDLY])
809 remove_friendly_object (this);
810
811 if (!flag [FLAG_REMOVED])
812 remove ();
813
814 if (flag [FLAG_FREED])
908 return; 815 return;
909 816
910 if (QUERY_FLAG (this, FLAG_FRIENDLY)) 817 set_speed (0);
911 remove_friendly_object (this);
912 818
913 if (!QUERY_FLAG (this, FLAG_REMOVED)) 819 flag [FLAG_FREED] = 1;
914 remove_ob (this);
915 820
916 SET_FLAG (this, FLAG_FREED); 821 attachable::do_destroy ();
917 822
918 if (more) 823 destroy_inv (true);
919 { 824 unlink ();
920 more->destroy (destroy_inventory);
921 more = 0;
922 }
923
924 if (inv)
925 {
926 /* Only if the space blocks everything do we not process -
927 * if some form of movement is allowed, let objects
928 * drop on that space.
929 */
930 if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
931 {
932 object *op = inv;
933
934 while (op)
935 {
936 object *tmp = op->below;
937 op->destroy (destroy_inventory);
938 op = tmp;
939 }
940 }
941 else
942 { /* Put objects in inventory onto this space */
943 object *op = inv;
944
945 while (op)
946 {
947 object *tmp = op->below;
948
949 remove_ob (op);
950
951 if (QUERY_FLAG (op, FLAG_STARTEQUIP)
952 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
953 free_object (op);
954 else
955 {
956 op->x = x;
957 op->y = y;
958 insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
959 }
960
961 op = tmp;
962 }
963 }
964 }
965 825
966 // hack to ensure that freed objects still have a valid map 826 // hack to ensure that freed objects still have a valid map
967 { 827 {
968 static maptile *freed_map; // freed objects are moved here to avoid crashes 828 static maptile *freed_map; // freed objects are moved here to avoid crashes
969 829
… …
973 833
974 freed_map->name = "/internal/freed_objects_map"; 834 freed_map->name = "/internal/freed_objects_map";
975 freed_map->width = 3; 835 freed_map->width = 3;
976 freed_map->height = 3; 836 freed_map->height = 3;
977 837
978 freed_map->allocate (); 838 freed_map->alloc ();
839 freed_map->in_memory = MAP_IN_MEMORY;
979 } 840 }
980 841
981 map = freed_map; 842 map = freed_map;
982 x = 1; 843 x = 1;
983 y = 1; 844 y = 1;
984 } 845 }
985 846
847 head = 0;
848
849 if (more)
850 {
851 more->destroy ();
852 more = 0;
853 }
854
986 // clear those pointers that likely might have circular references to us 855 // clear those pointers that likely might have circular references to us
987 owner = 0; 856 owner = 0;
988 enemy = 0; 857 enemy = 0;
989 attacked_by = 0; 858 attacked_by = 0;
859}
990 860
991 // only relevant for players(?), but make sure of it anyways 861void
992 contr = 0; 862object::destroy (bool destroy_inventory)
863{
864 if (destroyed ())
865 return;
993 866
994 /* Remove object from the active list */ 867 if (destroy_inventory)
995 speed = 0; 868 destroy_inv (false);
996 update_ob_speed (this);
997 869
998 unlink (); 870 attachable::destroy ();
999
1000 mortals.push_back (this);
1001} 871}
1002 872
1003/* 873/*
1004 * sub_weight() recursively (outwards) subtracts a number from the 874 * sub_weight() recursively (outwards) subtracts a number from the
1005 * weight of an object (and what is carried by it's environment(s)). 875 * weight of an object (and what is carried by it's environment(s)).
… …
1015 op->carrying -= weight; 885 op->carrying -= weight;
1016 op = op->env; 886 op = op->env;
1017 } 887 }
1018} 888}
1019 889
1020/* remove_ob(op): 890/* op->remove ():
1021 * This function removes the object op from the linked list of objects 891 * This function removes the object op from the linked list of objects
1022 * which it is currently tied to. When this function is done, the 892 * which it is currently tied to. When this function is done, the
1023 * object will have no environment. If the object previously had an 893 * object will have no environment. If the object previously had an
1024 * environment, the x and y coordinates will be updated to 894 * environment, the x and y coordinates will be updated to
1025 * the previous environment. 895 * the previous environment.
… …
1029object::remove () 899object::remove ()
1030{ 900{
1031 object *tmp, *last = 0; 901 object *tmp, *last = 0;
1032 object *otmp; 902 object *otmp;
1033 903
1034 int check_walk_off;
1035
1036 if (QUERY_FLAG (this, FLAG_REMOVED)) 904 if (QUERY_FLAG (this, FLAG_REMOVED))
1037 return; 905 return;
1038 906
1039 SET_FLAG (this, FLAG_REMOVED); 907 SET_FLAG (this, FLAG_REMOVED);
908 INVOKE_OBJECT (REMOVE, this);
1040 909
1041 if (more) 910 if (more)
1042 more->remove (); 911 more->remove ();
1043 912
1044 /* 913 /*
… …
1054 923
1055 /* NO_FIX_PLAYER is set when a great many changes are being 924 /* NO_FIX_PLAYER is set when a great many changes are being
1056 * made to players inventory. If set, avoiding the call 925 * made to players inventory. If set, avoiding the call
1057 * to save cpu time. 926 * to save cpu time.
1058 */ 927 */
1059 if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 928 if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1060 fix_player (otmp); 929 otmp->update_stats ();
1061 930
1062 if (above != NULL) 931 if (above)
1063 above->below = below; 932 above->below = below;
1064 else 933 else
1065 env->inv = below; 934 env->inv = below;
1066 935
1067 if (below != NULL) 936 if (below)
1068 below->above = above; 937 below->above = above;
1069 938
1070 /* we set up values so that it could be inserted into 939 /* we set up values so that it could be inserted into
1071 * the map, but we don't actually do that - it is up 940 * the map, but we don't actually do that - it is up
1072 * to the caller to decide what we want to do. 941 * to the caller to decide what we want to do.
… …
1076 above = 0, below = 0; 945 above = 0, below = 0;
1077 env = 0; 946 env = 0;
1078 } 947 }
1079 else if (map) 948 else if (map)
1080 { 949 {
1081 /* Re did the following section of code - it looks like it had 950 if (type == PLAYER)
1082 * lots of logic for things we no longer care about
1083 */ 951 {
952 --map->players;
953 map->touch ();
954 }
955
956 map->dirty = true;
1084 957
1085 /* link the object above us */ 958 /* link the object above us */
1086 if (above) 959 if (above)
1087 above->below = below; 960 above->below = below;
1088 else 961 else
1089 SET_MAP_TOP (map, x, y, below); /* we were top, set new top */ 962 map->at (x, y).top = below; /* we were top, set new top */
1090 963
1091 /* Relink the object below us, if there is one */ 964 /* Relink the object below us, if there is one */
1092 if (below) 965 if (below)
1093 below->above = above; 966 below->above = above;
1094 else 967 else
… …
1106 dump = dump_object (GET_MAP_OB (map, x, y)); 979 dump = dump_object (GET_MAP_OB (map, x, y));
1107 LOG (llevError, "%s\n", dump); 980 LOG (llevError, "%s\n", dump);
1108 free (dump); 981 free (dump);
1109 } 982 }
1110 983
1111 SET_MAP_OB (map, x, y, above); /* goes on above it. */ 984 map->at (x, y).bot = above; /* goes on above it. */
1112 } 985 }
1113 986
1114 above = 0; 987 above = 0;
1115 below = 0; 988 below = 0;
1116 989
1117 if (map->in_memory == MAP_SAVING) 990 if (map->in_memory == MAP_SAVING)
1118 return; 991 return;
1119 992
1120 check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY); 993 int check_walk_off = !flag [FLAG_NO_APPLY];
1121 994
1122 for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above) 995 for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)
1123 { 996 {
1124 /* No point updating the players look faces if he is the object 997 /* No point updating the players look faces if he is the object
1125 * being removed. 998 * being removed.
1126 */ 999 */
1127 1000
… …
1131 * removed (most likely destroyed), update the player view 1004 * removed (most likely destroyed), update the player view
1132 * appropriately. 1005 * appropriately.
1133 */ 1006 */
1134 if (tmp->container == this) 1007 if (tmp->container == this)
1135 { 1008 {
1136 CLEAR_FLAG (this, FLAG_APPLIED); 1009 flag [FLAG_APPLIED] = 0;
1137 tmp->container = 0; 1010 tmp->container = 0;
1138 } 1011 }
1139 1012
1140 tmp->contr->socket.update_look = 1; 1013 if (tmp->contr->ns)
1014 tmp->contr->ns->floorbox_update ();
1141 } 1015 }
1142 1016
1143 /* See if player moving off should effect something */ 1017 /* See if object moving off should effect something */
1144 if (check_walk_off 1018 if (check_walk_off
1145 && ((move_type & tmp->move_off) 1019 && ((move_type & tmp->move_off)
1146 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1020 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1147 { 1021 {
1148 move_apply (tmp, this, 0); 1022 move_apply (tmp, this, 0);
… …
1150 if (destroyed ()) 1024 if (destroyed ())
1151 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1025 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1152 } 1026 }
1153 1027
1154 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1028 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1155 1029 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1156 if (tmp->above == tmp) 1030 if (tmp->above == tmp)
1157 tmp->above = 0; 1031 tmp->above = 0;
1158 1032
1159 last = tmp; 1033 last = tmp;
1160 } 1034 }
1161 1035
1162 /* last == NULL of there are no objects on this space */ 1036 /* last == NULL if there are no objects on this space */
1037 //TODO: this makes little sense, why only update the topmost object?
1163 if (!last) 1038 if (!last)
1164 { 1039 map->at (x, y).flags_ = 0;
1165 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1166 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1167 * those out anyways, and if there are any flags set right now, they won't
1168 * be correct anyways.
1169 */
1170 SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1171 update_position (map, x, y);
1172 }
1173 else 1040 else
1174 update_object (last, UP_OBJ_REMOVE); 1041 update_object (last, UP_OBJ_REMOVE);
1175 1042
1176 if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius) 1043 if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1177 update_all_los (map, x, y); 1044 update_all_los (map, x, y);
1178 } 1045 }
1179} 1046}
1180 1047
1181/* 1048/*
… …
1190merge_ob (object *op, object *top) 1057merge_ob (object *op, object *top)
1191{ 1058{
1192 if (!op->nrof) 1059 if (!op->nrof)
1193 return 0; 1060 return 0;
1194 1061
1195 if (top == NULL) 1062 if (top)
1196 for (top = op; top != NULL && top->above != NULL; top = top->above); 1063 for (top = op; top && top->above; top = top->above)
1064 ;
1197 1065
1198 for (; top != NULL; top = top->below) 1066 for (; top; top = top->below)
1199 { 1067 {
1200 if (top == op) 1068 if (top == op)
1201 continue; 1069 continue;
1202 if (CAN_MERGE (op, top)) 1070
1071 if (object::can_merge (op, top))
1203 { 1072 {
1204 top->nrof += op->nrof; 1073 top->nrof += op->nrof;
1205 1074
1206/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ 1075/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1207 op->weight = 0; /* Don't want any adjustements now */ 1076 op->weight = 0; /* Don't want any adjustements now */
1208 remove_ob (op); 1077 op->destroy ();
1209 free_object (op);
1210 return top; 1078 return top;
1211 } 1079 }
1212 } 1080 }
1213 1081
1214 return 0; 1082 return 0;
… …
1219 * job preparing multi-part monsters 1087 * job preparing multi-part monsters
1220 */ 1088 */
1221object * 1089object *
1222insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1090insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1223{ 1091{
1224 object *tmp;
1225
1226 if (op->head)
1227 op = op->head;
1228
1229 for (tmp = op; tmp; tmp = tmp->more) 1092 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1230 { 1093 {
1231 tmp->x = x + tmp->arch->clone.x; 1094 tmp->x = x + tmp->arch->clone.x;
1232 tmp->y = y + tmp->arch->clone.y; 1095 tmp->y = y + tmp->arch->clone.y;
1233 } 1096 }
1234 1097
… …
1253 * Return value: 1116 * Return value:
1254 * new object if 'op' was merged with other object 1117 * new object if 'op' was merged with other object
1255 * NULL if 'op' was destroyed 1118 * NULL if 'op' was destroyed
1256 * just 'op' otherwise 1119 * just 'op' otherwise
1257 */ 1120 */
1258
1259object * 1121object *
1260insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1122insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1261{ 1123{
1262 object *tmp, *top, *floor = NULL; 1124 object *tmp, *top, *floor = NULL;
1263 sint16 x, y; 1125 sint16 x, y;
… …
1266 { 1128 {
1267 LOG (llevError, "Trying to insert freed object!\n"); 1129 LOG (llevError, "Trying to insert freed object!\n");
1268 return NULL; 1130 return NULL;
1269 } 1131 }
1270 1132
1271 if (m == NULL) 1133 if (!m)
1272 { 1134 {
1273 char *dump = dump_object (op); 1135 char *dump = dump_object (op);
1274 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1136 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1275 free (dump); 1137 free (dump);
1276 return op; 1138 return op;
… …
1297 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); 1159 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1298 free (dump); 1160 free (dump);
1299 return op; 1161 return op;
1300 } 1162 }
1301 1163
1302 if (op->more != NULL) 1164 if (op->more)
1303 { 1165 {
1304 /* The part may be on a different map. */ 1166 /* The part may be on a different map. */
1305 1167
1306 object *more = op->more; 1168 object *more = op->more;
1307 1169
1308 /* We really need the caller to normalize coordinates - if 1170 /* We really need the caller to normalise coordinates - if
1309 * we set the map, that doesn't work if the location is within 1171 * we set the map, that doesn't work if the location is within
1310 * a map and this is straddling an edge. So only if coordinate 1172 * a map and this is straddling an edge. So only if coordinate
1311 * is clear wrong do we normalize it. 1173 * is clear wrong do we normalise it.
1312 */ 1174 */
1313 if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) 1175 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1314 more->map = get_map_from_coord (m, &more->x, &more->y); 1176 more->map = get_map_from_coord (m, &more->x, &more->y);
1315 else if (!more->map) 1177 else if (!more->map)
1316 { 1178 {
… …
1323 if (insert_ob_in_map (more, more->map, originator, flag) == NULL) 1185 if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1324 { 1186 {
1325 if (!op->head) 1187 if (!op->head)
1326 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); 1188 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1327 1189
1328 return NULL; 1190 return 0;
1329 } 1191 }
1330 } 1192 }
1331 1193
1332 CLEAR_FLAG (op, FLAG_REMOVED); 1194 CLEAR_FLAG (op, FLAG_REMOVED);
1333 1195
… …
1340 y = op->y; 1202 y = op->y;
1341 1203
1342 /* this has to be done after we translate the coordinates. 1204 /* this has to be done after we translate the coordinates.
1343 */ 1205 */
1344 if (op->nrof && !(flag & INS_NO_MERGE)) 1206 if (op->nrof && !(flag & INS_NO_MERGE))
1345 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) 1207 for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)
1346 if (CAN_MERGE (op, tmp)) 1208 if (object::can_merge (op, tmp))
1347 { 1209 {
1348 op->nrof += tmp->nrof; 1210 op->nrof += tmp->nrof;
1349 remove_ob (tmp); 1211 tmp->destroy ();
1350 free_object (tmp);
1351 } 1212 }
1352 1213
1353 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1214 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1354 CLEAR_FLAG (op, FLAG_INV_LOCKED); 1215 CLEAR_FLAG (op, FLAG_INV_LOCKED);
1355 1216
… …
1368 op->below = originator->below; 1229 op->below = originator->below;
1369 1230
1370 if (op->below) 1231 if (op->below)
1371 op->below->above = op; 1232 op->below->above = op;
1372 else 1233 else
1373 SET_MAP_OB (op->map, op->x, op->y, op); 1234 op->ms ().bot = op;
1374 1235
1375 /* since *below* originator, no need to update top */ 1236 /* since *below* originator, no need to update top */
1376 originator->below = op; 1237 originator->below = op;
1377 } 1238 }
1378 else 1239 else
1379 { 1240 {
1380 /* If there are other objects, then */ 1241 /* If there are other objects, then */
1381 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) 1242 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))
1382 { 1243 {
1383 object *last = NULL; 1244 object *last = 0;
1384 1245
1385 /* 1246 /*
1386 * If there are multiple objects on this space, we do some trickier handling. 1247 * If there are multiple objects on this space, we do some trickier handling.
1387 * We've already dealt with merging if appropriate. 1248 * We've already dealt with merging if appropriate.
1388 * Generally, we want to put the new object on top. But if 1249 * Generally, we want to put the new object on top. But if
… …
1392 * once we get to them. This reduces the need to traverse over all of 1253 * once we get to them. This reduces the need to traverse over all of
1393 * them when adding another one - this saves quite a bit of cpu time 1254 * them when adding another one - this saves quite a bit of cpu time
1394 * when lots of spells are cast in one area. Currently, it is presumed 1255 * when lots of spells are cast in one area. Currently, it is presumed
1395 * that flying non pickable objects are spell objects. 1256 * that flying non pickable objects are spell objects.
1396 */ 1257 */
1397
1398 while (top != NULL) 1258 while (top)
1399 { 1259 {
1400 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1260 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1401 floor = top; 1261 floor = top;
1402 1262
1403 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1263 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
… …
1424 * If INS_ON_TOP is used, don't do this processing 1284 * If INS_ON_TOP is used, don't do this processing
1425 * Need to find the object that in fact blocks view, otherwise 1285 * Need to find the object that in fact blocks view, otherwise
1426 * stacking is a bit odd. 1286 * stacking is a bit odd.
1427 */ 1287 */
1428 if (!(flag & INS_ON_TOP) && 1288 if (!(flag & INS_ON_TOP) &&
1429 (get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) 1289 (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))
1430 { 1290 {
1431 for (last = top; last != floor; last = last->below) 1291 for (last = top; last != floor; last = last->below)
1432 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1292 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1433 break; 1293 break;
1434 /* Check to see if we found the object that blocks view, 1294 /* Check to see if we found the object that blocks view,
… …
1456 op->above = GET_MAP_OB (op->map, op->x, op->y); 1316 op->above = GET_MAP_OB (op->map, op->x, op->y);
1457 1317
1458 if (op->above) 1318 if (op->above)
1459 op->above->below = op; 1319 op->above->below = op;
1460 1320
1461 op->below = NULL; 1321 op->below = 0;
1462 SET_MAP_OB (op->map, op->x, op->y, op); 1322 op->ms ().bot = op;
1463 } 1323 }
1464 else 1324 else
1465 { /* get inserted into the stack above top */ 1325 { /* get inserted into the stack above top */
1466 op->above = top->above; 1326 op->above = top->above;
1467 1327
… …
1470 1330
1471 op->below = top; 1331 op->below = top;
1472 top->above = op; 1332 top->above = op;
1473 } 1333 }
1474 1334
1475 if (op->above == NULL) 1335 if (!op->above)
1476 SET_MAP_TOP (op->map, op->x, op->y, op); 1336 op->ms ().top = op;
1477 } /* else not INS_BELOW_ORIGINATOR */ 1337 } /* else not INS_BELOW_ORIGINATOR */
1478 1338
1479 if (op->type == PLAYER) 1339 if (op->type == PLAYER)
1340 {
1480 op->contr->do_los = 1; 1341 op->contr->do_los = 1;
1342 ++op->map->players;
1343 op->map->touch ();
1344 }
1345
1346 op->map->dirty = true;
1481 1347
1482 /* If we have a floor, we know the player, if any, will be above 1348 /* If we have a floor, we know the player, if any, will be above
1483 * it, so save a few ticks and start from there. 1349 * it, so save a few ticks and start from there.
1484 */ 1350 */
1485 if (!(flag & INS_MAP_LOAD)) 1351 if (!(flag & INS_MAP_LOAD))
1486 for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1352 if (object *pl = op->ms ().player ())
1487 if (tmp->type == PLAYER) 1353 if (pl->contr->ns)
1488 tmp->contr->socket.update_look = 1; 1354 pl->contr->ns->floorbox_update ();
1489 1355
1490 /* If this object glows, it may affect lighting conditions that are 1356 /* If this object glows, it may affect lighting conditions that are
1491 * visible to others on this map. But update_all_los is really 1357 * visible to others on this map. But update_all_los is really
1492 * an inefficient way to do this, as it means los for all players 1358 * an inefficient way to do this, as it means los for all players
1493 * on the map will get recalculated. The players could very well 1359 * on the map will get recalculated. The players could very well
1494 * be far away from this change and not affected in any way - 1360 * be far away from this change and not affected in any way -
1495 * this should get redone to only look for players within range, 1361 * this should get redone to only look for players within range,
1496 * or just updating the P_NEED_UPDATE for spaces within this area 1362 * or just updating the P_UPTODATE for spaces within this area
1497 * of effect may be sufficient. 1363 * of effect may be sufficient.
1498 */ 1364 */
1499 if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) 1365 if (op->map->darkness && (op->glow_radius != 0))
1500 update_all_los (op->map, op->x, op->y); 1366 update_all_los (op->map, op->x, op->y);
1501 1367
1502 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1368 /* updates flags (blocked, alive, no magic, etc) for this map space */
1503 update_object (op, UP_OBJ_INSERT); 1369 update_object (op, UP_OBJ_INSERT);
1504 1370
1371 INVOKE_OBJECT (INSERT, op);
1372
1505 /* Don't know if moving this to the end will break anything. However, 1373 /* Don't know if moving this to the end will break anything. However,
1506 * we want to have update_look set above before calling this. 1374 * we want to have floorbox_update called before calling this.
1507 * 1375 *
1508 * check_move_on() must be after this because code called from 1376 * check_move_on() must be after this because code called from
1509 * check_move_on() depends on correct map flags (so functions like 1377 * check_move_on() depends on correct map flags (so functions like
1510 * blocked() and wall() work properly), and these flags are updated by 1378 * blocked() and wall() work properly), and these flags are updated by
1511 * update_object(). 1379 * update_object().
… …
1513 1381
1514 /* if this is not the head or flag has been passed, don't check walk on status */ 1382 /* if this is not the head or flag has been passed, don't check walk on status */
1515 if (!(flag & INS_NO_WALK_ON) && !op->head) 1383 if (!(flag & INS_NO_WALK_ON) && !op->head)
1516 { 1384 {
1517 if (check_move_on (op, originator)) 1385 if (check_move_on (op, originator))
1518 return NULL; 1386 return 0;
1519 1387
1520 /* If we are a multi part object, lets work our way through the check 1388 /* If we are a multi part object, lets work our way through the check
1521 * walk on's. 1389 * walk on's.
1522 */ 1390 */
1523 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1391 for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1524 if (check_move_on (tmp, originator)) 1392 if (check_move_on (tmp, originator))
1525 return NULL; 1393 return 0;
1526 } 1394 }
1527 1395
1528 return op; 1396 return op;
1529} 1397}
1530 1398
1531/* this function inserts an object in the map, but if it 1399/* this function inserts an object in the map, but if it
1532 * finds an object of its own type, it'll remove that one first. 1400 * finds an object of its own type, it'll remove that one first.
1533 * op is the object to insert it under: supplies x and the map. 1401 * op is the object to insert it under: supplies x and the map.
1534 */ 1402 */
1535void 1403void
1536replace_insert_ob_in_map (const char *arch_string, object *op) 1404replace_insert_ob_in_map (const char *arch_string, object *op)
1537{ 1405{
1538 object * 1406 object *tmp, *tmp1;
1539 tmp;
1540 object *
1541 tmp1;
1542 1407
1543 /* first search for itself and remove any old instances */ 1408 /* first search for itself and remove any old instances */
1544 1409
1545 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1410 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1546 {
1547 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1411 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1548 { 1412 tmp->destroy ();
1549 remove_ob (tmp);
1550 free_object (tmp);
1551 }
1552 }
1553 1413
1554 tmp1 = arch_to_object (archetype::find (arch_string)); 1414 tmp1 = arch_to_object (archetype::find (arch_string));
1555 1415
1556 tmp1->x = op->x; 1416 tmp1->x = op->x;
1557 tmp1->y = op->y; 1417 tmp1->y = op->y;
1558 insert_ob_in_map (tmp1, op->map, op, 0); 1418 insert_ob_in_map (tmp1, op->map, op, 0);
1419}
1420
1421object *
1422object::insert_at (object *where, object *originator, int flags)
1423{
1424 where->map->insert (this, where->x, where->y, originator, flags);
1559} 1425}
1560 1426
1561/* 1427/*
1562 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1428 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1563 * is returned contains nr objects, and the remaining parts contains 1429 * is returned contains nr objects, and the remaining parts contains
1564 * the rest (or is removed and freed if that number is 0). 1430 * the rest (or is removed and freed if that number is 0).
1565 * On failure, NULL is returned, and the reason put into the 1431 * On failure, NULL is returned, and the reason put into the
1566 * global static errmsg array. 1432 * global static errmsg array.
1567 */ 1433 */
1568
1569object * 1434object *
1570get_split_ob (object *orig_ob, uint32 nr) 1435get_split_ob (object *orig_ob, uint32 nr)
1571{ 1436{
1572 object * 1437 object *newob;
1573 newob;
1574 int
1575 is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); 1438 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1576 1439
1577 if (orig_ob->nrof < nr) 1440 if (orig_ob->nrof < nr)
1578 { 1441 {
1579 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); 1442 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1580 return NULL; 1443 return NULL;
1581 } 1444 }
1582 1445
1583 newob = object_create_clone (orig_ob); 1446 newob = object_create_clone (orig_ob);
1584 1447
1585 if ((orig_ob->nrof -= nr) < 1) 1448 if ((orig_ob->nrof -= nr) < 1)
1586 { 1449 orig_ob->destroy (1);
1587 if (!is_removed)
1588 remove_ob (orig_ob);
1589 free_object2 (orig_ob, 1);
1590 }
1591 else if (!is_removed) 1450 else if (!is_removed)
1592 { 1451 {
1593 if (orig_ob->env != NULL) 1452 if (orig_ob->env != NULL)
1594 sub_weight (orig_ob->env, orig_ob->weight * nr); 1453 sub_weight (orig_ob->env, orig_ob->weight * nr);
1595 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) 1454 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
… …
1615 1474
1616object * 1475object *
1617decrease_ob_nr (object *op, uint32 i) 1476decrease_ob_nr (object *op, uint32 i)
1618{ 1477{
1619 object *tmp; 1478 object *tmp;
1620 player *pl;
1621 1479
1622 if (i == 0) /* objects with op->nrof require this check */ 1480 if (i == 0) /* objects with op->nrof require this check */
1623 return op; 1481 return op;
1624 1482
1625 if (i > op->nrof) 1483 if (i > op->nrof)
1626 i = op->nrof; 1484 i = op->nrof;
1627 1485
1628 if (QUERY_FLAG (op, FLAG_REMOVED)) 1486 if (QUERY_FLAG (op, FLAG_REMOVED))
1629 op->nrof -= i; 1487 op->nrof -= i;
1630 else if (op->env != NULL) 1488 else if (op->env)
1631 { 1489 {
1632 /* is this object in the players inventory, or sub container 1490 /* is this object in the players inventory, or sub container
1633 * therein? 1491 * therein?
1634 */ 1492 */
1635 tmp = is_player_inv (op->env); 1493 tmp = op->in_player ();
1636 /* nope. Is this a container the player has opened? 1494 /* nope. Is this a container the player has opened?
1637 * If so, set tmp to that player. 1495 * If so, set tmp to that player.
1638 * IMO, searching through all the players will mostly 1496 * IMO, searching through all the players will mostly
1639 * likely be quicker than following op->env to the map, 1497 * likely be quicker than following op->env to the map,
1640 * and then searching the map for a player. 1498 * and then searching the map for a player.
1641 */ 1499 */
1642 if (!tmp) 1500 if (!tmp)
1643 { 1501 for_all_players (pl)
1644 for (pl = first_player; pl; pl = pl->next)
1645 if (pl->ob->container == op->env) 1502 if (pl->ob->container == op->env)
1503 {
1504 tmp = pl->ob;
1646 break; 1505 break;
1647 if (pl)
1648 tmp = pl->ob;
1649 else
1650 tmp = NULL;
1651 } 1506 }
1652 1507
1653 if (i < op->nrof) 1508 if (i < op->nrof)
1654 { 1509 {
1655 sub_weight (op->env, op->weight * i); 1510 sub_weight (op->env, op->weight * i);
1656 op->nrof -= i; 1511 op->nrof -= i;
1657 if (tmp) 1512 if (tmp)
1658 {
1659 esrv_send_item (tmp, op); 1513 esrv_send_item (tmp, op);
1660 }
1661 } 1514 }
1662 else 1515 else
1663 { 1516 {
1664 remove_ob (op); 1517 op->remove ();
1665 op->nrof = 0; 1518 op->nrof = 0;
1666 if (tmp) 1519 if (tmp)
1667 {
1668 esrv_del_item (tmp->contr, op->count); 1520 esrv_del_item (tmp->contr, op->count);
1669 }
1670 } 1521 }
1671 } 1522 }
1672 else 1523 else
1673 { 1524 {
1674 object *above = op->above; 1525 object *above = op->above;
1675 1526
1676 if (i < op->nrof) 1527 if (i < op->nrof)
1677 op->nrof -= i; 1528 op->nrof -= i;
1678 else 1529 else
1679 { 1530 {
1680 remove_ob (op); 1531 op->remove ();
1681 op->nrof = 0; 1532 op->nrof = 0;
1682 } 1533 }
1683 1534
1684 /* Since we just removed op, op->above is null */ 1535 /* Since we just removed op, op->above is null */
1685 for (tmp = above; tmp != NULL; tmp = tmp->above) 1536 for (tmp = above; tmp; tmp = tmp->above)
1686 if (tmp->type == PLAYER) 1537 if (tmp->type == PLAYER)
1687 { 1538 {
1688 if (op->nrof) 1539 if (op->nrof)
1689 esrv_send_item (tmp, op); 1540 esrv_send_item (tmp, op);
1690 else 1541 else
… …
1694 1545
1695 if (op->nrof) 1546 if (op->nrof)
1696 return op; 1547 return op;
1697 else 1548 else
1698 { 1549 {
1699 free_object (op); 1550 op->destroy ();
1700 return NULL; 1551 return 0;
1701 } 1552 }
1702} 1553}
1703 1554
1704/* 1555/*
1705 * add_weight(object, weight) adds the specified weight to an object, 1556 * add_weight(object, weight) adds the specified weight to an object,
… …
1765 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1616 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1766 CLEAR_FLAG (op, FLAG_REMOVED); 1617 CLEAR_FLAG (op, FLAG_REMOVED);
1767 if (op->nrof) 1618 if (op->nrof)
1768 { 1619 {
1769 for (tmp = inv; tmp != NULL; tmp = tmp->below) 1620 for (tmp = inv; tmp != NULL; tmp = tmp->below)
1770 if (CAN_MERGE (tmp, op)) 1621 if (object::can_merge (tmp, op))
1771 { 1622 {
1772 /* return the original object and remove inserted object 1623 /* return the original object and remove inserted object
1773 (client needs the original object) */ 1624 (client needs the original object) */
1774 tmp->nrof += op->nrof; 1625 tmp->nrof += op->nrof;
1775 /* Weight handling gets pretty funky. Since we are adding to 1626 /* Weight handling gets pretty funky. Since we are adding to
… …
1793 add_weight (this, op->weight * op->nrof); 1644 add_weight (this, op->weight * op->nrof);
1794 } 1645 }
1795 else 1646 else
1796 add_weight (this, (op->weight + op->carrying)); 1647 add_weight (this, (op->weight + op->carrying));
1797 1648
1798 otmp = is_player_inv (this); 1649 otmp = this->in_player ();
1799 if (otmp && otmp->contr) 1650 if (otmp && otmp->contr)
1800 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1651 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1801 fix_player (otmp); 1652 otmp->update_stats ();
1802 1653
1803 op->map = NULL; 1654 op->map = 0;
1804 op->env = this; 1655 op->env = this;
1805 op->above = NULL; 1656 op->above = 0;
1806 op->below = NULL; 1657 op->below = 0;
1807 op->x = 0, op->y = 0; 1658 op->x = 0, op->y = 0;
1808 1659
1809 /* reset the light list and los of the players on the map */ 1660 /* reset the light list and los of the players on the map */
1810 if ((op->glow_radius != 0) && map) 1661 if ((op->glow_radius != 0) && map)
1811 { 1662 {
1812#ifdef DEBUG_LIGHTS 1663#ifdef DEBUG_LIGHTS
1813 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); 1664 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1814#endif /* DEBUG_LIGHTS */ 1665#endif /* DEBUG_LIGHTS */
1815 if (MAP_DARKNESS (map)) 1666 if (map->darkness)
1816 update_all_los (map, x, y); 1667 update_all_los (map, x, y);
1817 } 1668 }
1818 1669
1819 /* Client has no idea of ordering so lets not bother ordering it here. 1670 /* Client has no idea of ordering so lets not bother ordering it here.
1820 * It sure simplifies this function... 1671 * It sure simplifies this function...
… …
1825 { 1676 {
1826 op->below = inv; 1677 op->below = inv;
1827 op->below->above = op; 1678 op->below->above = op;
1828 inv = op; 1679 inv = op;
1829 } 1680 }
1681
1682 INVOKE_OBJECT (INSERT, this);
1830 1683
1831 return op; 1684 return op;
1832} 1685}
1833 1686
1834/* 1687/*
… …
1849 * 1702 *
1850 * MSW 2001-07-08: Check all objects on space, not just those below 1703 * MSW 2001-07-08: Check all objects on space, not just those below
1851 * object being inserted. insert_ob_in_map may not put new objects 1704 * object being inserted. insert_ob_in_map may not put new objects
1852 * on top. 1705 * on top.
1853 */ 1706 */
1854
1855int 1707int
1856check_move_on (object *op, object *originator) 1708check_move_on (object *op, object *originator)
1857{ 1709{
1858 object *tmp; 1710 object *tmp;
1859 maptile *m = op->map; 1711 maptile *m = op->map;
… …
1886 1738
1887 /* The objects have to be checked from top to bottom. 1739 /* The objects have to be checked from top to bottom.
1888 * Hence, we first go to the top: 1740 * Hence, we first go to the top:
1889 */ 1741 */
1890 1742
1891 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above) 1743 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1892 { 1744 {
1893 /* Trim the search when we find the first other spell effect 1745 /* Trim the search when we find the first other spell effect
1894 * this helps performance so that if a space has 50 spell objects, 1746 * this helps performance so that if a space has 50 spell objects,
1895 * we don't need to check all of them. 1747 * we don't need to check all of them.
1896 */ 1748 */
… …
1951/* 1803/*
1952 * present_arch(arch, map, x, y) searches for any objects with 1804 * present_arch(arch, map, x, y) searches for any objects with
1953 * a matching archetype at the given map and coordinates. 1805 * a matching archetype at the given map and coordinates.
1954 * The first matching object is returned, or NULL if none. 1806 * The first matching object is returned, or NULL if none.
1955 */ 1807 */
1956
1957object * 1808object *
1958present_arch (const archetype *at, maptile *m, int x, int y) 1809present_arch (const archetype *at, maptile *m, int x, int y)
1959{ 1810{
1960 object *
1961 tmp;
1962
1963 if (m == NULL || out_of_map (m, x, y)) 1811 if (!m || out_of_map (m, x, y))
1964 { 1812 {
1965 LOG (llevError, "Present_arch called outside map.\n"); 1813 LOG (llevError, "Present_arch called outside map.\n");
1966 return NULL; 1814 return NULL;
1967 } 1815 }
1968 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1816
1817 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1969 if (tmp->arch == at) 1818 if (tmp->arch == at)
1970 return tmp; 1819 return tmp;
1820
1971 return NULL; 1821 return NULL;
1972} 1822}
1973 1823
1974/* 1824/*
1975 * present(type, map, x, y) searches for any objects with 1825 * present(type, map, x, y) searches for any objects with
1976 * a matching type variable at the given map and coordinates. 1826 * a matching type variable at the given map and coordinates.
1977 * The first matching object is returned, or NULL if none. 1827 * The first matching object is returned, or NULL if none.
1978 */ 1828 */
1979
1980object * 1829object *
1981present (unsigned char type, maptile *m, int x, int y) 1830present (unsigned char type, maptile *m, int x, int y)
1982{ 1831{
1983 object *
1984 tmp;
1985
1986 if (out_of_map (m, x, y)) 1832 if (out_of_map (m, x, y))
1987 { 1833 {
1988 LOG (llevError, "Present called outside map.\n"); 1834 LOG (llevError, "Present called outside map.\n");
1989 return NULL; 1835 return NULL;
1990 } 1836 }
1991 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1837
1838 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1992 if (tmp->type == type) 1839 if (tmp->type == type)
1993 return tmp; 1840 return tmp;
1841
1994 return NULL; 1842 return NULL;
1995} 1843}
1996 1844
1997/* 1845/*
1998 * present_in_ob(type, object) searches for any objects with 1846 * present_in_ob(type, object) searches for any objects with
1999 * a matching type variable in the inventory of the given object. 1847 * a matching type variable in the inventory of the given object.
2000 * The first matching object is returned, or NULL if none. 1848 * The first matching object is returned, or NULL if none.
2001 */ 1849 */
2002
2003object * 1850object *
2004present_in_ob (unsigned char type, const object *op) 1851present_in_ob (unsigned char type, const object *op)
2005{ 1852{
2006 object *
2007 tmp;
2008
2009 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1853 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2010 if (tmp->type == type) 1854 if (tmp->type == type)
2011 return tmp; 1855 return tmp;
1856
2012 return NULL; 1857 return NULL;
2013} 1858}
2014 1859
2015/* 1860/*
2016 * present_in_ob (type, str, object) searches for any objects with 1861 * present_in_ob (type, str, object) searches for any objects with
… …
2024 * str is the string to match against. Note that we match against 1869 * str is the string to match against. Note that we match against
2025 * the object name, not the archetype name. this is so that the 1870 * the object name, not the archetype name. this is so that the
2026 * spell code can use one object type (force), but change it's name 1871 * spell code can use one object type (force), but change it's name
2027 * to be unique. 1872 * to be unique.
2028 */ 1873 */
2029
2030object * 1874object *
2031present_in_ob_by_name (int type, const char *str, const object *op) 1875present_in_ob_by_name (int type, const char *str, const object *op)
2032{ 1876{
2033 object *
2034 tmp;
2035
2036 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1877 for (object *tmp = op->inv; tmp; tmp = tmp->below)
2037 {
2038 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) 1878 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2039 return tmp; 1879 return tmp;
2040 } 1880
2041 return NULL; 1881 return 0;
2042} 1882}
2043 1883
2044/* 1884/*
2045 * present_arch_in_ob(archetype, object) searches for any objects with 1885 * present_arch_in_ob(archetype, object) searches for any objects with
2046 * a matching archetype in the inventory of the given object. 1886 * a matching archetype in the inventory of the given object.
2047 * The first matching object is returned, or NULL if none. 1887 * The first matching object is returned, or NULL if none.
2048 */ 1888 */
2049
2050object * 1889object *
2051present_arch_in_ob (const archetype *at, const object *op) 1890present_arch_in_ob (const archetype *at, const object *op)
2052{ 1891{
2053 object *
2054 tmp;
2055
2056 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1892 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2057 if (tmp->arch == at) 1893 if (tmp->arch == at)
2058 return tmp; 1894 return tmp;
1895
2059 return NULL; 1896 return NULL;
2060} 1897}
2061 1898
2062/* 1899/*
2063 * activate recursively a flag on an object inventory 1900 * activate recursively a flag on an object inventory
2064 */ 1901 */
2065void 1902void
2066flag_inv (object *op, int flag) 1903flag_inv (object *op, int flag)
2067{ 1904{
2068 object *
2069 tmp;
2070
2071 if (op->inv) 1905 if (op->inv)
2072 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1906 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2073 { 1907 {
2074 SET_FLAG (tmp, flag); 1908 SET_FLAG (tmp, flag);
2075 flag_inv (tmp, flag); 1909 flag_inv (tmp, flag);
2076 } 1910 }
2077} /* 1911}
1912
1913/*
2078 * desactivate recursively a flag on an object inventory 1914 * deactivate recursively a flag on an object inventory
2079 */ 1915 */
2080void 1916void
2081unflag_inv (object *op, int flag) 1917unflag_inv (object *op, int flag)
2082{ 1918{
2083 object *
2084 tmp;
2085
2086 if (op->inv) 1919 if (op->inv)
2087 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1920 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2088 { 1921 {
2089 CLEAR_FLAG (tmp, flag); 1922 CLEAR_FLAG (tmp, flag);
2090 unflag_inv (tmp, flag); 1923 unflag_inv (tmp, flag);
2091 } 1924 }
2092} 1925}
… …
2095 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in 1928 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2096 * all it's inventory (recursively). 1929 * all it's inventory (recursively).
2097 * If checksums are used, a player will get set_cheat called for 1930 * If checksums are used, a player will get set_cheat called for
2098 * him/her-self and all object carried by a call to this function. 1931 * him/her-self and all object carried by a call to this function.
2099 */ 1932 */
2100
2101void 1933void
2102set_cheat (object *op) 1934set_cheat (object *op)
2103{ 1935{
2104 SET_FLAG (op, FLAG_WAS_WIZ); 1936 SET_FLAG (op, FLAG_WAS_WIZ);
2105 flag_inv (op, FLAG_WAS_WIZ); 1937 flag_inv (op, FLAG_WAS_WIZ);
… …
2124 * because arch_blocked (now ob_blocked) needs to know the movement type 1956 * because arch_blocked (now ob_blocked) needs to know the movement type
2125 * to know if the space in question will block the object. We can't use 1957 * to know if the space in question will block the object. We can't use
2126 * the archetype because that isn't correct if the monster has been 1958 * the archetype because that isn't correct if the monster has been
2127 * customized, changed states, etc. 1959 * customized, changed states, etc.
2128 */ 1960 */
2129
2130int 1961int
2131find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 1962find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2132{ 1963{
2133 int
2134 i,
2135 index = 0, flag; 1964 int index = 0, flag;
2136 static int
2137 altern[SIZEOFFREE]; 1965 int altern[SIZEOFFREE];
2138 1966
2139 for (i = start; i < stop; i++) 1967 for (int i = start; i < stop; i++)
2140 { 1968 {
2141 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); 1969 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2142 if (!flag) 1970 if (!flag)
2143 altern[index++] = i; 1971 altern [index++] = i;
2144 1972
2145 /* Basically, if we find a wall on a space, we cut down the search size. 1973 /* Basically, if we find a wall on a space, we cut down the search size.
2146 * In this way, we won't return spaces that are on another side of a wall. 1974 * In this way, we won't return spaces that are on another side of a wall.
2147 * This mostly work, but it cuts down the search size in all directions - 1975 * This mostly work, but it cuts down the search size in all directions -
2148 * if the space being examined only has a wall to the north and empty 1976 * if the space being examined only has a wall to the north and empty
2149 * spaces in all the other directions, this will reduce the search space 1977 * spaces in all the other directions, this will reduce the search space
2150 * to only the spaces immediately surrounding the target area, and 1978 * to only the spaces immediately surrounding the target area, and
2151 * won't look 2 spaces south of the target space. 1979 * won't look 2 spaces south of the target space.
2152 */ 1980 */
2153 else if ((flag & AB_NO_PASS) && maxfree[i] < stop) 1981 else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2154 stop = maxfree[i]; 1982 stop = maxfree[i];
2155 } 1983 }
1984
2156 if (!index) 1985 if (!index)
2157 return -1; 1986 return -1;
1987
2158 return altern[RANDOM () % index]; 1988 return altern[RANDOM () % index];
2159} 1989}
2160 1990
2161/* 1991/*
2162 * find_first_free_spot(archetype, maptile, x, y) works like 1992 * find_first_free_spot(archetype, maptile, x, y) works like
2163 * find_free_spot(), but it will search max number of squares. 1993 * find_free_spot(), but it will search max number of squares.
2164 * But it will return the first available spot, not a random choice. 1994 * But it will return the first available spot, not a random choice.
2165 * Changed 0.93.2: Have it return -1 if there is no free spot available. 1995 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2166 */ 1996 */
2167
2168int 1997int
2169find_first_free_spot (const object *ob, maptile *m, int x, int y) 1998find_first_free_spot (const object *ob, maptile *m, int x, int y)
2170{ 1999{
2171 int
2172 i;
2173
2174 for (i = 0; i < SIZEOFFREE; i++) 2000 for (int i = 0; i < SIZEOFFREE; i++)
2175 {
2176 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) 2001 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2177 return i; 2002 return i;
2178 } 2003
2179 return -1; 2004 return -1;
2180} 2005}
2181 2006
2182/* 2007/*
2183 * The function permute(arr, begin, end) randomly reorders the array 2008 * The function permute(arr, begin, end) randomly reorders the array
2184 * arr[begin..end-1]. 2009 * arr[begin..end-1].
2010 * now uses a fisher-yates shuffle, old permute was broken
2185 */ 2011 */
2186static void 2012static void
2187permute (int *arr, int begin, int end) 2013permute (int *arr, int begin, int end)
2188{ 2014{
2189 int 2015 arr += begin;
2190 i,
2191 j,
2192 tmp,
2193 len;
2194
2195 len = end - begin; 2016 end -= begin;
2196 for (i = begin; i < end; i++)
2197 {
2198 j = begin + RANDOM () % len;
2199 2017
2200 tmp = arr[i]; 2018 while (--end)
2201 arr[i] = arr[j]; 2019 swap (arr [end], arr [RANDOM () % (end + 1)]);
2202 arr[j] = tmp;
2203 }
2204} 2020}
2205 2021
2206/* new function to make monster searching more efficient, and effective! 2022/* new function to make monster searching more efficient, and effective!
2207 * This basically returns a randomized array (in the passed pointer) of 2023 * This basically returns a randomized array (in the passed pointer) of
2208 * the spaces to find monsters. In this way, it won't always look for 2024 * the spaces to find monsters. In this way, it won't always look for
… …
2211 * the 3x3 area will be searched, just not in a predictable order. 2027 * the 3x3 area will be searched, just not in a predictable order.
2212 */ 2028 */
2213void 2029void
2214get_search_arr (int *search_arr) 2030get_search_arr (int *search_arr)
2215{ 2031{
2216 int 2032 int i;
2217 i;
2218 2033
2219 for (i = 0; i < SIZEOFFREE; i++) 2034 for (i = 0; i < SIZEOFFREE; i++)
2220 {
2221 search_arr[i] = i; 2035 search_arr[i] = i;
2222 }
2223 2036
2224 permute (search_arr, 1, SIZEOFFREE1 + 1); 2037 permute (search_arr, 1, SIZEOFFREE1 + 1);
2225 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); 2038 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2226 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); 2039 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2227} 2040}
… …
2236 * Perhaps incorrectly, but I'm making the assumption that exclude 2049 * Perhaps incorrectly, but I'm making the assumption that exclude
2237 * is actually want is going to try and move there. We need this info 2050 * is actually want is going to try and move there. We need this info
2238 * because we have to know what movement the thing looking to move 2051 * because we have to know what movement the thing looking to move
2239 * there is capable of. 2052 * there is capable of.
2240 */ 2053 */
2241
2242int 2054int
2243find_dir (maptile *m, int x, int y, object *exclude) 2055find_dir (maptile *m, int x, int y, object *exclude)
2244{ 2056{
2245 int
2246 i,
2247 max = SIZEOFFREE, mflags; 2057 int i, max = SIZEOFFREE, mflags;
2248 2058
2249 sint16 nx, ny; 2059 sint16 nx, ny;
2250 object * 2060 object *tmp;
2251 tmp;
2252 maptile * 2061 maptile *mp;
2253 mp;
2254 2062
2255 MoveType blocked, move_type; 2063 MoveType blocked, move_type;
2256 2064
2257 if (exclude && exclude->head) 2065 if (exclude && exclude->head)
2258 { 2066 {
… …
2270 mp = m; 2078 mp = m;
2271 nx = x + freearr_x[i]; 2079 nx = x + freearr_x[i];
2272 ny = y + freearr_y[i]; 2080 ny = y + freearr_y[i];
2273 2081
2274 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2082 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
2083
2275 if (mflags & P_OUT_OF_MAP) 2084 if (mflags & P_OUT_OF_MAP)
2276 {
2277 max = maxfree[i]; 2085 max = maxfree[i];
2278 }
2279 else 2086 else
2280 { 2087 {
2281 blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); 2088 mapspace &ms = mp->at (nx, ny);
2089
2090 blocked = ms.move_block;
2282 2091
2283 if ((move_type & blocked) == move_type) 2092 if ((move_type & blocked) == move_type)
2284 {
2285 max = maxfree[i]; 2093 max = maxfree[i];
2286 }
2287 else if (mflags & P_IS_ALIVE) 2094 else if (mflags & P_IS_ALIVE)
2288 { 2095 {
2289 for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above) 2096 for (tmp = ms.bot; tmp; tmp = tmp->above)
2290 { 2097 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2291 if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2098 && (tmp != exclude || (tmp->head && tmp->head != exclude)))
2292 {
2293 break; 2099 break;
2294 } 2100
2295 }
2296 if (tmp) 2101 if (tmp)
2297 {
2298 return freedir[i]; 2102 return freedir[i];
2299 }
2300 } 2103 }
2301 } 2104 }
2302 } 2105 }
2106
2303 return 0; 2107 return 0;
2304} 2108}
2305 2109
2306/* 2110/*
2307 * distance(object 1, object 2) will return the square of the 2111 * distance(object 1, object 2) will return the square of the
2308 * distance between the two given objects. 2112 * distance between the two given objects.
2309 */ 2113 */
2310
2311int 2114int
2312distance (const object *ob1, const object *ob2) 2115distance (const object *ob1, const object *ob2)
2313{ 2116{
2314 int
2315 i;
2316
2317 i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); 2117 return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2318 return i;
2319} 2118}
2320 2119
2321/* 2120/*
2322 * find_dir_2(delta-x,delta-y) will return a direction in which 2121 * find_dir_2(delta-x,delta-y) will return a direction in which
2323 * an object which has subtracted the x and y coordinates of another 2122 * an object which has subtracted the x and y coordinates of another
2324 * object, needs to travel toward it. 2123 * object, needs to travel toward it.
2325 */ 2124 */
2326
2327int 2125int
2328find_dir_2 (int x, int y) 2126find_dir_2 (int x, int y)
2329{ 2127{
2330 int 2128 int q;
2331 q;
2332 2129
2333 if (y) 2130 if (y)
2334 q = x * 100 / y; 2131 q = x * 100 / y;
2335 else if (x) 2132 else if (x)
2336 q = -300 * x; 2133 q = -300 * x;
… …
2371int 2168int
2372absdir (int d) 2169absdir (int d)
2373{ 2170{
2374 while (d < 1) 2171 while (d < 1)
2375 d += 8; 2172 d += 8;
2173
2376 while (d > 8) 2174 while (d > 8)
2377 d -= 8; 2175 d -= 8;
2176
2378 return d; 2177 return d;
2379} 2178}
2380 2179
2381/* 2180/*
2382 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2181 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
… …
2384 */ 2183 */
2385 2184
2386int 2185int
2387dirdiff (int dir1, int dir2) 2186dirdiff (int dir1, int dir2)
2388{ 2187{
2389 int 2188 int d;
2390 d;
2391 2189
2392 d = abs (dir1 - dir2); 2190 d = abs (dir1 - dir2);
2393 if (d > 4) 2191 if (d > 4)
2394 d = 8 - d; 2192 d = 8 - d;
2193
2395 return d; 2194 return d;
2396} 2195}
2397 2196
2398/* peterm: 2197/* peterm:
2399 * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. 2198 * do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
… …
2402 * This basically means that if direction is 15, then it could either go 2201 * This basically means that if direction is 15, then it could either go
2403 * direction 4, 14, or 16 to get back to where we are. 2202 * direction 4, 14, or 16 to get back to where we are.
2404 * Moved from spell_util.c to object.c with the other related direction 2203 * Moved from spell_util.c to object.c with the other related direction
2405 * functions. 2204 * functions.
2406 */ 2205 */
2407
2408int
2409 reduction_dir[SIZEOFFREE][3] = { 2206int reduction_dir[SIZEOFFREE][3] = {
2410 {0, 0, 0}, /* 0 */ 2207 {0, 0, 0}, /* 0 */
2411 {0, 0, 0}, /* 1 */ 2208 {0, 0, 0}, /* 1 */
2412 {0, 0, 0}, /* 2 */ 2209 {0, 0, 0}, /* 2 */
2413 {0, 0, 0}, /* 3 */ 2210 {0, 0, 0}, /* 3 */
2414 {0, 0, 0}, /* 4 */ 2211 {0, 0, 0}, /* 4 */
… …
2462 * find a path to that monster that we found. If not, 2259 * find a path to that monster that we found. If not,
2463 * we don't bother going toward it. Returns 1 if we 2260 * we don't bother going toward it. Returns 1 if we
2464 * can see a direct way to get it 2261 * can see a direct way to get it
2465 * Modified to be map tile aware -.MSW 2262 * Modified to be map tile aware -.MSW
2466 */ 2263 */
2467
2468
2469int 2264int
2470can_see_monsterP (maptile *m, int x, int y, int dir) 2265can_see_monsterP (maptile *m, int x, int y, int dir)
2471{ 2266{
2472 sint16 dx, dy; 2267 sint16 dx, dy;
2473 int
2474 mflags; 2268 int mflags;
2475 2269
2476 if (dir < 0) 2270 if (dir < 0)
2477 return 0; /* exit condition: invalid direction */ 2271 return 0; /* exit condition: invalid direction */
2478 2272
2479 dx = x + freearr_x[dir]; 2273 dx = x + freearr_x[dir];
… …
2492 return 0; 2286 return 0;
2493 2287
2494 /* yes, can see. */ 2288 /* yes, can see. */
2495 if (dir < 9) 2289 if (dir < 9)
2496 return 1; 2290 return 1;
2291
2497 return can_see_monsterP (m, x, y, reduction_dir[dir][0]) | 2292 return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2498 can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]); 2293 | can_see_monsterP (m, x, y, reduction_dir[dir][1])
2294 | can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2499} 2295}
2500
2501
2502 2296
2503/* 2297/*
2504 * can_pick(picker, item): finds out if an object is possible to be 2298 * can_pick(picker, item): finds out if an object is possible to be
2505 * picked up by the picker. Returnes 1 if it can be 2299 * picked up by the picker. Returnes 1 if it can be
2506 * picked up, otherwise 0. 2300 * picked up, otherwise 0.
… …
2517 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2311 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2518 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2312 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2519 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); 2313 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2520} 2314}
2521 2315
2522
2523/* 2316/*
2524 * create clone from object to another 2317 * create clone from object to another
2525 */ 2318 */
2526object * 2319object *
2527object_create_clone (object *asrc) 2320object_create_clone (object *asrc)
2528{ 2321{
2529 object *
2530 dst = NULL, *tmp, *src, *part, *prev, *item; 2322 object *dst = 0, *tmp, *src, *part, *prev, *item;
2531 2323
2532 if (!asrc) 2324 if (!asrc)
2533 return NULL; 2325 return 0;
2326
2534 src = asrc; 2327 src = asrc;
2535 if (src->head) 2328 if (src->head)
2536 src = src->head; 2329 src = src->head;
2537 2330
2538 prev = NULL; 2331 prev = 0;
2539 for (part = src; part; part = part->more) 2332 for (part = src; part; part = part->more)
2540 { 2333 {
2541 tmp = get_object (); 2334 tmp = part->clone ();
2542 copy_object (part, tmp);
2543 tmp->x -= src->x; 2335 tmp->x -= src->x;
2544 tmp->y -= src->y; 2336 tmp->y -= src->y;
2337
2545 if (!part->head) 2338 if (!part->head)
2546 { 2339 {
2547 dst = tmp; 2340 dst = tmp;
2548 tmp->head = NULL; 2341 tmp->head = 0;
2549 } 2342 }
2550 else 2343 else
2551 {
2552 tmp->head = dst; 2344 tmp->head = dst;
2553 } 2345
2554 tmp->more = NULL; 2346 tmp->more = 0;
2347
2555 if (prev) 2348 if (prev)
2556 prev->more = tmp; 2349 prev->more = tmp;
2350
2557 prev = tmp; 2351 prev = tmp;
2558 } 2352 }
2559 2353
2560 for (item = src->inv; item; item = item->below) 2354 for (item = src->inv; item; item = item->below)
2561 insert_ob_in_ob (object_create_clone (item), dst); 2355 insert_ob_in_ob (object_create_clone (item), dst);
… …
2567/* Basically, we save the content of the string to a temp file, then call */ 2361/* Basically, we save the content of the string to a temp file, then call */
2568/* load_object on it. I admit it is a highly inefficient way to make things, */ 2362/* load_object on it. I admit it is a highly inefficient way to make things, */
2569/* but it was simple to make and allows reusing the load_object function. */ 2363/* but it was simple to make and allows reusing the load_object function. */
2570/* Remember not to use load_object_str in a time-critical situation. */ 2364/* Remember not to use load_object_str in a time-critical situation. */
2571/* Also remember that multiparts objects are not supported for now. */ 2365/* Also remember that multiparts objects are not supported for now. */
2572
2573object * 2366object *
2574load_object_str (const char *obstr) 2367load_object_str (const char *obstr)
2575{ 2368{
2576 object *op; 2369 object *op;
2577 char filename[MAX_BUF]; 2370 char filename[MAX_BUF];
… …
2587 } 2380 }
2588 2381
2589 fprintf (tempfile, obstr); 2382 fprintf (tempfile, obstr);
2590 fclose (tempfile); 2383 fclose (tempfile);
2591 2384
2592 op = get_object (); 2385 op = object::create ();
2593 2386
2594 object_thawer thawer (filename); 2387 object_thawer thawer (filename);
2595 2388
2596 if (thawer) 2389 if (thawer)
2597 load_object (thawer, op, 0); 2390 load_object (thawer, op, 0);
… …
2607 * returns NULL if no match. 2400 * returns NULL if no match.
2608 */ 2401 */
2609object * 2402object *
2610find_obj_by_type_subtype (const object *who, int type, int subtype) 2403find_obj_by_type_subtype (const object *who, int type, int subtype)
2611{ 2404{
2612 object *tmp;
2613
2614 for (tmp = who->inv; tmp; tmp = tmp->below) 2405 for (object *tmp = who->inv; tmp; tmp = tmp->below)
2615 if (tmp->type == type && tmp->subtype == subtype) 2406 if (tmp->type == type && tmp->subtype == subtype)
2616 return tmp; 2407 return tmp;
2617 2408
2618 return NULL; 2409 return 0;
2619} 2410}
2620 2411
2621/* If ob has a field named key, return the link from the list, 2412/* If ob has a field named key, return the link from the list,
2622 * otherwise return NULL. 2413 * otherwise return NULL.
2623 * 2414 *
… …
2625 * do the desired thing. 2416 * do the desired thing.
2626 */ 2417 */
2627key_value * 2418key_value *
2628get_ob_key_link (const object *ob, const char *key) 2419get_ob_key_link (const object *ob, const char *key)
2629{ 2420{
2630 key_value *link;
2631
2632 for (link = ob->key_values; link != NULL; link = link->next) 2421 for (key_value *link = ob->key_values; link; link = link->next)
2633 if (link->key == key) 2422 if (link->key == key)
2634 return link; 2423 return link;
2635 2424
2636 return NULL; 2425 return 0;
2637} 2426}
2638 2427
2639/* 2428/*
2640 * Returns the value of op has an extra_field for key, or NULL. 2429 * Returns the value of op has an extra_field for key, or NULL.
2641 * 2430 *
… …
2681 * Returns TRUE on success. 2470 * Returns TRUE on success.
2682 */ 2471 */
2683int 2472int
2684set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) 2473set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2685{ 2474{
2686 key_value *
2687 field = NULL, *last = NULL; 2475 key_value *field = NULL, *last = NULL;
2688 2476
2689 for (field = op->key_values; field != NULL; field = field->next) 2477 for (field = op->key_values; field != NULL; field = field->next)
2690 { 2478 {
2691 if (field->key != canonical_key) 2479 if (field->key != canonical_key)
2692 { 2480 {
… …
2720 /* IF we get here, key doesn't exist */ 2508 /* IF we get here, key doesn't exist */
2721 2509
2722 /* No field, we'll have to add it. */ 2510 /* No field, we'll have to add it. */
2723 2511
2724 if (!add_key) 2512 if (!add_key)
2725 {
2726 return FALSE; 2513 return FALSE;
2727 } 2514
2728 /* There isn't any good reason to store a null 2515 /* There isn't any good reason to store a null
2729 * value in the key/value list. If the archetype has 2516 * value in the key/value list. If the archetype has
2730 * this key, then we should also have it, so shouldn't 2517 * this key, then we should also have it, so shouldn't
2731 * be here. If user wants to store empty strings, 2518 * be here. If user wants to store empty strings,
2732 * should pass in "" 2519 * should pass in ""
… …
2781 } 2568 }
2782 else 2569 else
2783 item = item->env; 2570 item = item->env;
2784} 2571}
2785 2572
2573
2574const char *
2575object::flag_desc (char *desc, int len) const
2576{
2577 char *p = desc;
2578 bool first = true;
2579
2580 *p = 0;
2581
2582 for (int i = 0; i < NUM_FLAGS; i++)
2583 {
2584 if (len <= 10) // magic constant!
2585 {
2586 snprintf (p, len, ",...");
2587 break;
2588 }
2589
2590 if (flag [i])
2591 {
2592 int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
2593 len -= cnt;
2594 p += cnt;
2595 first = false;
2596 }
2597 }
2598
2599 return desc;
2600}
2601
2786// return a suitable string describing an objetc in enough detail to find it 2602// return a suitable string describing an object in enough detail to find it
2787const char * 2603const char *
2788object::debug_desc (char *info) const 2604object::debug_desc (char *info) const
2789{ 2605{
2606 char flagdesc[512];
2790 char info2[256 * 3]; 2607 char info2[256 * 4];
2791 char *p = info; 2608 char *p = info;
2792 2609
2793 p += snprintf (p, 256, "%d=\"%s%s%s\"", 2610 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",
2794 count, 2611 count, uuid.seq,
2795 &name, 2612 &name,
2796 title ? " " : "", 2613 title ? "\",title:" : "",
2797 title ? (const char *)title : ""); 2614 title ? (const char *)title : "",
2615 flag_desc (flagdesc, 512), type);
2798 2616
2799 if (env) 2617 if (env)
2800 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2618 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2801 2619
2802 if (map) 2620 if (map)
2803 p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); 2621 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2804 2622
2805 return info; 2623 return info;
2806} 2624}
2807 2625
2808const char * 2626const char *
2809object::debug_desc () const 2627object::debug_desc () const
2810{ 2628{
2811 static char info[256 * 3]; 2629 static char info[256 * 4];
2812 return debug_desc (info); 2630 return debug_desc (info);
2813} 2631}
2814 2632

Diff Legend

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