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.49 by root, Sat Sep 16 22:24:12 2006 UTC vs.
Revision 1.112 by root, Mon Jan 8 14:11:04 2007 UTC

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

Diff Legend

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