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.67 by root, Thu Dec 14 04:30:32 2006 UTC vs.
Revision 1.146 by root, Fri May 11 21:07:13 2007 UTC

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

Diff Legend

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