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

Diff Legend

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