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.122 by root, Wed Jan 24 22:42:48 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 23 */
23 24
24/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25 sub/add_weight will transcend the environment updating the carrying 26 sub/add_weight will transcend the environment updating the carrying
26 variable. */ 27 variable. */
27#include <global.h> 28#include <global.h>
… …
30#include <sys/uio.h> 31#include <sys/uio.h>
31#include <object.h> 32#include <object.h>
32#include <funcpoint.h> 33#include <funcpoint.h>
33#include <loader.h> 34#include <loader.h>
34 35
36#include <bitset>
37
35int nrofallocobjects = 0; 38int nrofallocobjects = 0;
36static UUID uuid; 39static UUID uuid;
37const uint64 UUID_SKIP = 1<<19; 40const uint64 UUID_SKIP = 1<<19;
38 41
39object *active_objects; /* List of active objects that need to be processed */ 42objectvec objects;
43activevec actives;
40 44
41short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 45short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
42 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 46 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
43}; 47};
44short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, 48short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
… …
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 - rndm ();
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}
898
899object::vector object::mortals;
900object::vector object::objects; // not yet used
901object *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} 663}
922 664
923object::object () 665object::object ()
924{ 666{
925 SET_FLAG (this, FLAG_REMOVED); 667 SET_FLAG (this, FLAG_REMOVED);
… …
928 face = blank_face; 670 face = blank_face;
929} 671}
930 672
931object::~object () 673object::~object ()
932{ 674{
675 unlink ();
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 if (!index)
953 object::first = next; 695 return;
954 696
955 /* Remove this object from the list of used objects */ 697 objects.erase (this);
956 if (prev) prev->next = next; 698 refcnt_dec ();
957 if (next) next->prev = prev; 699}
958 700
959 prev = 0; 701void
960 next = 0; 702object::activate ()
703{
704 /* If already on active list, don't do anything */
705 if (active)
706 return;
707
708 if (has_active_speed ())
709 actives.insert (this);
710}
711
712void
713object::activate_recursive ()
714{
715 activate ();
716
717 for (object *op = inv; op; op = op->below)
718 op->activate_recursive ();
719}
720
721/* This function removes object 'op' from the list of active
722 * objects.
723 * This should only be used for style maps or other such
724 * reference maps where you don't want an object that isn't
725 * in play chewing up cpu time getting processed.
726 * The reverse of this is to call update_ob_speed, which
727 * will do the right thing based on the speed of the object.
728 */
729void
730object::deactivate ()
731{
732 /* If not on the active list, nothing needs to be done */
733 if (!active)
734 return;
735
736 actives.erase (this);
737}
738
739void
740object::deactivate_recursive ()
741{
742 for (object *op = inv; op; op = op->below)
743 op->deactivate_recursive ();
744
745 deactivate ();
746}
747
748void
749object::set_flag_inv (int flag, int value)
750{
751 for (object *op = inv; op; op = op->below)
752 {
753 op->flag [flag] = value;
754 op->set_flag_inv (flag, value);
755 }
756}
757
758/*
759 * Remove and free all objects in the inventory of the given object.
760 * object.c ?
761 */
762void
763object::destroy_inv (bool drop_to_ground)
764{
765 // need to check first, because the checks below might segfault
766 // as we might be on an invalid mapspace and crossfire code
767 // is too buggy to ensure that the inventory is empty.
768 // corollary: if you create arrows etc. with stuff in tis inventory,
769 // cf will crash below with off-map x and y
770 if (!inv)
771 return;
772
773 /* Only if the space blocks everything do we not process -
774 * if some form of movement is allowed, let objects
775 * drop on that space.
776 */
777 if (!drop_to_ground
778 || !map
779 || map->in_memory != MAP_IN_MEMORY
780 || map->nodrop
781 || ms ().move_block == MOVE_ALL)
782 {
783 while (inv)
784 {
785 inv->destroy_inv (drop_to_ground);
786 inv->destroy ();
787 }
788 }
789 else
790 { /* Put objects in inventory onto this space */
791 while (inv)
792 {
793 object *op = inv;
794
795 if (op->flag [FLAG_STARTEQUIP]
796 || op->flag [FLAG_NO_DROP]
797 || op->type == RUNE
798 || op->type == TRAP
799 || op->flag [FLAG_IS_A_TEMPLATE]
800 || op->flag [FLAG_DESTROY_ON_DEATH])
801 op->destroy ();
802 else
803 map->insert (op, x, y);
804 }
805 }
961} 806}
962 807
963object *object::create () 808object *object::create ()
964{ 809{
965 object *op = new object; 810 object *op = new object;
966 op->link (); 811 op->link ();
967 return op; 812 return op;
968} 813}
969 814
970/* 815void
971 * free_object() frees everything allocated by an object, removes 816object::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{ 817{
982 if (QUERY_FLAG (this, FLAG_FREED)) 818 attachable::do_destroy ();
983 return;
984 819
985 if (QUERY_FLAG (this, FLAG_FRIENDLY)) 820 if (flag [FLAG_IS_LINKED])
821 remove_button_link (this);
822
823 if (flag [FLAG_FRIENDLY])
986 remove_friendly_object (this); 824 remove_friendly_object (this);
987 825
988 if (!QUERY_FLAG (this, FLAG_REMOVED)) 826 if (!flag [FLAG_REMOVED])
989 remove_ob (this); 827 remove ();
990 828
991 SET_FLAG (this, FLAG_FREED); 829 destroy_inv (true);
830
831 deactivate ();
832 unlink ();
833
834 flag [FLAG_FREED] = 1;
835
836 // hack to ensure that freed objects still have a valid map
837 {
838 static maptile *freed_map; // freed objects are moved here to avoid crashes
839
840 if (!freed_map)
841 {
842 freed_map = new maptile;
843
844 freed_map->name = "/internal/freed_objects_map";
845 freed_map->width = 3;
846 freed_map->height = 3;
847
848 freed_map->alloc ();
849 freed_map->in_memory = MAP_IN_MEMORY;
850 }
851
852 map = freed_map;
853 x = 1;
854 y = 1;
855 }
856
857 head = 0;
992 858
993 if (more) 859 if (more)
994 { 860 {
995 more->free (free_inventory); 861 more->destroy ();
996 more = 0; 862 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 } 863 }
1040 864
1041 // clear those pointers that likely might have circular references to us 865 // clear those pointers that likely might have circular references to us
1042 owner = 0; 866 owner = 0;
1043 enemy = 0; 867 enemy = 0;
1044 attacked_by = 0; 868 attacked_by = 0;
869}
1045 870
1046 /* Remove object from the active list */ 871void
1047 speed = 0; 872object::destroy (bool destroy_inventory)
1048 update_ob_speed (this); 873{
874 if (destroyed ())
875 return;
1049 876
1050 unlink (); 877 if (destroy_inventory)
878 destroy_inv (false);
1051 879
1052 mortals.push_back (this); 880 attachable::destroy ();
1053} 881}
1054 882
1055/* 883/*
1056 * sub_weight() recursively (outwards) subtracts a number from the 884 * sub_weight() recursively (outwards) subtracts a number from the
1057 * weight of an object (and what is carried by it's environment(s)). 885 * weight of an object (and what is carried by it's environment(s)).
1058 */ 886 */
1059
1060void 887void
1061sub_weight (object *op, signed long weight) 888sub_weight (object *op, signed long weight)
1062{ 889{
1063 while (op != NULL) 890 while (op != NULL)
1064 { 891 {
… …
1068 op->carrying -= weight; 895 op->carrying -= weight;
1069 op = op->env; 896 op = op->env;
1070 } 897 }
1071} 898}
1072 899
1073/* remove_ob(op): 900/* op->remove ():
1074 * This function removes the object op from the linked list of objects 901 * 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 902 * which it is currently tied to. When this function is done, the
1076 * object will have no environment. If the object previously had an 903 * object will have no environment. If the object previously had an
1077 * environment, the x and y coordinates will be updated to 904 * environment, the x and y coordinates will be updated to
1078 * the previous environment. 905 * the previous environment.
1079 * Beware: This function is called from the editor as well! 906 * Beware: This function is called from the editor as well!
1080 */ 907 */
1081
1082void 908void
1083remove_ob (object *op) 909object::remove_slow ()
1084{ 910{
1085 object *tmp, *last = 0; 911 object *tmp, *last = 0;
1086 object *otmp; 912 object *otmp;
1087 913
1088 int check_walk_off;
1089 maptile *m;
1090
1091 sint16 x, y;
1092
1093 if (QUERY_FLAG (op, FLAG_REMOVED)) 914 if (QUERY_FLAG (this, FLAG_REMOVED))
1094 return; 915 return;
1095 916
1096 SET_FLAG (op, FLAG_REMOVED); 917 SET_FLAG (this, FLAG_REMOVED);
918 INVOKE_OBJECT (REMOVE, this);
1097 919
1098 if (op->more != NULL) 920 if (more)
1099 remove_ob (op->more); 921 more->remove ();
1100 922
1101 /* 923 /*
1102 * In this case, the object to be removed is in someones 924 * In this case, the object to be removed is in someones
1103 * inventory. 925 * inventory.
1104 */ 926 */
1105 if (op->env != NULL) 927 if (env)
1106 { 928 {
1107 if (op->nrof) 929 if (nrof)
1108 sub_weight (op->env, op->weight * op->nrof); 930 sub_weight (env, weight * nrof);
1109 else 931 else
1110 sub_weight (op->env, op->weight + op->carrying); 932 sub_weight (env, weight + carrying);
1111 933
1112 /* NO_FIX_PLAYER is set when a great many changes are being 934 /* NO_FIX_PLAYER is set when a great many changes are being
1113 * made to players inventory. If set, avoiding the call 935 * made to players inventory. If set, avoiding the call
1114 * to save cpu time. 936 * to save cpu time.
1115 */ 937 */
1116 if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 938 if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1117 fix_player (otmp); 939 otmp->update_stats ();
1118 940
1119 if (op->above != NULL) 941 if (above)
1120 op->above->below = op->below; 942 above->below = below;
1121 else 943 else
1122 op->env->inv = op->below; 944 env->inv = below;
1123 945
1124 if (op->below != NULL) 946 if (below)
1125 op->below->above = op->above; 947 below->above = above;
1126 948
1127 /* we set up values so that it could be inserted into 949 /* we set up values so that it could be inserted into
1128 * the map, but we don't actually do that - it is up 950 * the map, but we don't actually do that - it is up
1129 * to the caller to decide what we want to do. 951 * to the caller to decide what we want to do.
1130 */ 952 */
1131 op->x = op->env->x, op->y = op->env->y; 953 x = env->x, y = env->y;
1132 op->map = op->env->map; 954 map = env->map;
1133 op->above = NULL, op->below = NULL; 955 above = 0, below = 0;
1134 op->env = NULL; 956 env = 0;
1135 } 957 }
1136 else if (op->map) 958 else if (map)
1137 { 959 {
1138 x = op->x; 960 if (type == PLAYER)
1139 y = op->y;
1140 m = get_map_from_coord (op->map, &x, &y);
1141
1142 if (!m)
1143 { 961 {
1144 LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n", 962 --map->players;
1145 op->map->path, op->x, op->y); 963 map->touch ();
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 } 964 }
1152 965
1153 if (op->map != m) 966 map->dirty = true;
1154 LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n", 967 mapspace &ms = this->ms ();
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 */
1160 968
1161 /* link the object above us */ 969 /* link the object above us */
1162 if (op->above) 970 if (above)
1163 op->above->below = op->below; 971 above->below = below;
1164 else 972 else
1165 SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ 973 ms.top = below; /* we were top, set new top */
1166 974
1167 /* Relink the object below us, if there is one */ 975 /* Relink the object below us, if there is one */
1168 if (op->below) 976 if (below)
1169 op->below->above = op->above; 977 below->above = above;
1170 else 978 else
1171 { 979 {
1172 /* Nothing below, which means we need to relink map object for this space 980 /* 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 981 * use translated coordinates in case some oddness with map tiling is
1174 * evident 982 * evident
1175 */ 983 */
1176 if (GET_MAP_OB (m, x, y) != op) 984 if (GET_MAP_OB (map, x, y) != this)
1177 {
1178 dump_object (op);
1179 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); 985 LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1181 dump_object (GET_MAP_OB (m, x, y));
1182 LOG (llevError, "%s\n", errmsg);
1183 }
1184 986
1185 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ 987 ms.bot = above; /* goes on above it. */
1186 } 988 }
1187 989
1188 op->above = 0; 990 above = 0;
1189 op->below = 0; 991 below = 0;
1190 992
1191 if (op->map->in_memory == MAP_SAVING) 993 if (map->in_memory == MAP_SAVING)
1192 return; 994 return;
1193 995
1194 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); 996 int check_walk_off = !flag [FLAG_NO_APPLY];
1195 997
1196 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 998 for (tmp = ms.bot; tmp; tmp = tmp->above)
1197 { 999 {
1198 /* No point updating the players look faces if he is the object 1000 /* No point updating the players look faces if he is the object
1199 * being removed. 1001 * being removed.
1200 */ 1002 */
1201 1003
1202 if (tmp->type == PLAYER && tmp != op) 1004 if (tmp->type == PLAYER && tmp != this)
1203 { 1005 {
1204 /* If a container that the player is currently using somehow gets 1006 /* If a container that the player is currently using somehow gets
1205 * removed (most likely destroyed), update the player view 1007 * removed (most likely destroyed), update the player view
1206 * appropriately. 1008 * appropriately.
1207 */ 1009 */
1208 if (tmp->container == op) 1010 if (tmp->container == this)
1209 { 1011 {
1210 CLEAR_FLAG (op, FLAG_APPLIED); 1012 flag [FLAG_APPLIED] = 0;
1211 tmp->container = NULL; 1013 tmp->container = 0;
1212 } 1014 }
1213 1015
1214 tmp->contr->socket.update_look = 1; 1016 if (tmp->contr->ns)
1017 tmp->contr->ns->floorbox_update ();
1215 } 1018 }
1216 1019
1217 /* See if player moving off should effect something */ 1020 /* 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)) 1021 if (check_walk_off
1022 && ((move_type & tmp->move_off)
1023 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1219 { 1024 {
1220 move_apply (tmp, op, NULL); 1025 move_apply (tmp, this, 0);
1221 1026
1222 if (op->destroyed ()); 1027 if (destroyed ())
1223 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); 1028 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1224 } 1029 }
1225 1030
1226 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1031 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1227 1032 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1228 if (tmp->above == tmp) 1033 if (tmp->above == tmp)
1229 tmp->above = NULL; 1034 tmp->above = 0;
1230 1035
1231 last = tmp; 1036 last = tmp;
1232 } 1037 }
1233 1038
1234 /* last == NULL of there are no objects on this space */ 1039 /* last == NULL if there are no objects on this space */
1040 //TODO: this makes little sense, why only update the topmost object?
1235 if (last == NULL) 1041 if (!last)
1236 { 1042 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 1043 else
1246 update_object (last, UP_OBJ_REMOVE); 1044 update_object (last, UP_OBJ_REMOVE);
1247 1045
1248 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) 1046 if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1249 update_all_los (op->map, op->x, op->y); 1047 update_all_los (map, x, y);
1250 } 1048 }
1251} 1049}
1252 1050
1253/* 1051/*
1254 * merge_ob(op,top): 1052 * merge_ob(op,top):
… …
1262merge_ob (object *op, object *top) 1060merge_ob (object *op, object *top)
1263{ 1061{
1264 if (!op->nrof) 1062 if (!op->nrof)
1265 return 0; 1063 return 0;
1266 1064
1267 if (top == NULL) 1065 if (top)
1268 for (top = op; top != NULL && top->above != NULL; top = top->above); 1066 for (top = op; top && top->above; top = top->above)
1067 ;
1269 1068
1270 for (; top != NULL; top = top->below) 1069 for (; top; top = top->below)
1271 { 1070 {
1272 if (top == op) 1071 if (top == op)
1273 continue; 1072 continue;
1274 if (CAN_MERGE (op, top)) 1073
1074 if (object::can_merge (op, top))
1275 { 1075 {
1276 top->nrof += op->nrof; 1076 top->nrof += op->nrof;
1277 1077
1278/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ 1078/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1279 op->weight = 0; /* Don't want any adjustements now */ 1079 op->weight = 0; /* Don't want any adjustements now */
1280 remove_ob (op); 1080 op->destroy ();
1281 free_object (op);
1282 return top; 1081 return top;
1283 } 1082 }
1284 } 1083 }
1285 1084
1286 return 0; 1085 return 0;
1287} 1086}
1288 1087
1289/* 1088/*
1290 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1089 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1291 * job preparing multi-part monsters 1090 * job preparing multi-part monsters.
1292 */ 1091 */
1293object * 1092object *
1294insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1093insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1295{ 1094{
1296 object *tmp;
1297
1298 if (op->head)
1299 op = op->head;
1300
1301 for (tmp = op; tmp; tmp = tmp->more) 1095 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1302 { 1096 {
1303 tmp->x = x + tmp->arch->clone.x; 1097 tmp->x = x + tmp->arch->clone.x;
1304 tmp->y = y + tmp->arch->clone.y; 1098 tmp->y = y + tmp->arch->clone.y;
1305 } 1099 }
1306 1100
… …
1325 * Return value: 1119 * Return value:
1326 * new object if 'op' was merged with other object 1120 * new object if 'op' was merged with other object
1327 * NULL if 'op' was destroyed 1121 * NULL if 'op' was destroyed
1328 * just 'op' otherwise 1122 * just 'op' otherwise
1329 */ 1123 */
1330
1331object * 1124object *
1332insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1125insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1333{ 1126{
1334 object *tmp, *top, *floor = NULL; 1127 object *tmp, *top, *floor = NULL;
1335 sint16 x, y;
1336 1128
1337 if (QUERY_FLAG (op, FLAG_FREED)) 1129 if (QUERY_FLAG (op, FLAG_FREED))
1338 { 1130 {
1339 LOG (llevError, "Trying to insert freed object!\n"); 1131 LOG (llevError, "Trying to insert freed object!\n");
1340 return NULL; 1132 return NULL;
1341 } 1133 }
1342 1134
1343 if (m == NULL) 1135 if (!QUERY_FLAG (op, FLAG_REMOVED))
1136 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1137
1138 op->remove ();
1139
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))
1365 {
1366 dump_object (op);
1367 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg);
1368 return op;
1369 }
1370
1371 if (op->more != NULL)
1372 {
1373 /* The part may be on a different map. */
1374
1375 object *more = op->more; 1163 if (object *more = op->more)
1376 1164 {
1377 /* We really need the caller to normalize coordinates - if
1378 * 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
1380 * is clear wrong do we normalize it.
1381 */
1382 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1383 more->map = get_map_from_coord (m, &more->x, &more->y);
1384 else if (!more->map)
1385 {
1386 /* For backwards compatibility - when not dealing with tiled maps,
1387 * more->map should always point to the parent.
1388 */
1389 more->map = m;
1390 }
1391
1392 if (insert_ob_in_map (more, more->map, originator, flag) == NULL) 1165 if (!insert_ob_in_map (more, m, originator, flag))
1393 { 1166 {
1394 if (!op->head) 1167 if (!op->head)
1395 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); 1168 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1396 1169
1397 return NULL; 1170 return 0;
1398 } 1171 }
1399 } 1172 }
1400 1173
1401 CLEAR_FLAG (op, FLAG_REMOVED); 1174 CLEAR_FLAG (op, FLAG_REMOVED);
1402 1175
1403 /* Ideally, the caller figures this out. However, it complicates a lot 1176 /* Ideally, the caller figures this out. However, it complicates a lot
1404 * of areas of callers (eg, anything that uses find_free_spot would now 1177 * of areas of callers (eg, anything that uses find_free_spot would now
1405 * need extra work 1178 * need extra work
1406 */ 1179 */
1407 op->map = get_map_from_coord (m, &op->x, &op->y); 1180 if (!xy_normalise (m, op->x, op->y))
1408 x = op->x; 1181 return 0;
1409 y = op->y; 1182
1183 op->map = m;
1184 mapspace &ms = op->ms ();
1410 1185
1411 /* this has to be done after we translate the coordinates. 1186 /* this has to be done after we translate the coordinates.
1412 */ 1187 */
1413 if (op->nrof && !(flag & INS_NO_MERGE)) 1188 if (op->nrof && !(flag & INS_NO_MERGE))
1414 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) 1189 for (tmp = ms.bot; tmp; tmp = tmp->above)
1415 if (CAN_MERGE (op, tmp)) 1190 if (object::can_merge (op, tmp))
1416 { 1191 {
1417 op->nrof += tmp->nrof; 1192 op->nrof += tmp->nrof;
1418 remove_ob (tmp); 1193 tmp->destroy ();
1419 free_object (tmp);
1420 } 1194 }
1421 1195
1422 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1196 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1423 CLEAR_FLAG (op, FLAG_INV_LOCKED); 1197 CLEAR_FLAG (op, FLAG_INV_LOCKED);
1424 1198
… …
1437 op->below = originator->below; 1211 op->below = originator->below;
1438 1212
1439 if (op->below) 1213 if (op->below)
1440 op->below->above = op; 1214 op->below->above = op;
1441 else 1215 else
1442 SET_MAP_OB (op->map, op->x, op->y, op); 1216 ms.bot = op;
1443 1217
1444 /* since *below* originator, no need to update top */ 1218 /* since *below* originator, no need to update top */
1445 originator->below = op; 1219 originator->below = op;
1446 } 1220 }
1447 else 1221 else
1448 { 1222 {
1223 top = ms.bot;
1224
1449 /* If there are other objects, then */ 1225 /* If there are other objects, then */
1450 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) 1226 if ((!(flag & INS_MAP_LOAD)) && top)
1451 { 1227 {
1452 object *last = NULL; 1228 object *last = 0;
1453 1229
1454 /* 1230 /*
1455 * If there are multiple objects on this space, we do some trickier handling. 1231 * If there are multiple objects on this space, we do some trickier handling.
1456 * We've already dealt with merging if appropriate. 1232 * We've already dealt with merging if appropriate.
1457 * Generally, we want to put the new object on top. But if 1233 * 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 1237 * 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 1238 * 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 1239 * when lots of spells are cast in one area. Currently, it is presumed
1464 * that flying non pickable objects are spell objects. 1240 * that flying non pickable objects are spell objects.
1465 */ 1241 */
1466 1242 for (top = ms.bot; top; top = top->above)
1467 while (top != NULL)
1468 { 1243 {
1469 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1244 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1470 floor = top; 1245 floor = top;
1471 1246
1472 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1247 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
… …
1475 top = top->below; 1250 top = top->below;
1476 break; 1251 break;
1477 } 1252 }
1478 1253
1479 last = top; 1254 last = top;
1480 top = top->above;
1481 } 1255 }
1482 1256
1483 /* Don't want top to be NULL, so set it to the last valid object */ 1257 /* Don't want top to be NULL, so set it to the last valid object */
1484 top = last; 1258 top = last;
1485 1259
… …
1492 * Unless those objects are exits, type 66 1266 * Unless those objects are exits, type 66
1493 * If INS_ON_TOP is used, don't do this processing 1267 * If INS_ON_TOP is used, don't do this processing
1494 * Need to find the object that in fact blocks view, otherwise 1268 * Need to find the object that in fact blocks view, otherwise
1495 * stacking is a bit odd. 1269 * stacking is a bit odd.
1496 */ 1270 */
1497 if (!(flag & INS_ON_TOP) && 1271 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)) 1272 && ms.flags () & P_BLOCKSVIEW
1273 && (op->face && !op->face->visibility))
1499 { 1274 {
1500 for (last = top; last != floor; last = last->below) 1275 for (last = top; last != floor; last = last->below)
1501 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1276 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1502 break; 1277 break;
1278
1503 /* Check to see if we found the object that blocks view, 1279 /* Check to see if we found the object that blocks view,
1504 * and make sure we have a below pointer for it so that 1280 * and make sure we have a below pointer for it so that
1505 * we can get inserted below this one, which requires we 1281 * we can get inserted below this one, which requires we
1506 * set top to the object below us. 1282 * set top to the object below us.
1507 */ 1283 */
… …
1509 top = last->below; 1285 top = last->below;
1510 } 1286 }
1511 } /* If objects on this space */ 1287 } /* If objects on this space */
1512 1288
1513 if (flag & INS_MAP_LOAD) 1289 if (flag & INS_MAP_LOAD)
1514 top = GET_MAP_TOP (op->map, op->x, op->y); 1290 top = ms.top;
1515 1291
1516 if (flag & INS_ABOVE_FLOOR_ONLY) 1292 if (flag & INS_ABOVE_FLOOR_ONLY)
1517 top = floor; 1293 top = floor;
1518 1294
1519 /* Top is the object that our object (op) is going to get inserted above. 1295 /* Top is the object that our object (op) is going to get inserted above.
1520 */ 1296 */
1521 1297
1522 /* First object on this space */ 1298 /* First object on this space */
1523 if (!top) 1299 if (!top)
1524 { 1300 {
1525 op->above = GET_MAP_OB (op->map, op->x, op->y); 1301 op->above = ms.bot;
1526 1302
1527 if (op->above) 1303 if (op->above)
1528 op->above->below = op; 1304 op->above->below = op;
1529 1305
1530 op->below = NULL; 1306 op->below = 0;
1531 SET_MAP_OB (op->map, op->x, op->y, op); 1307 ms.bot = op;
1532 } 1308 }
1533 else 1309 else
1534 { /* get inserted into the stack above top */ 1310 { /* get inserted into the stack above top */
1535 op->above = top->above; 1311 op->above = top->above;
1536 1312
… …
1539 1315
1540 op->below = top; 1316 op->below = top;
1541 top->above = op; 1317 top->above = op;
1542 } 1318 }
1543 1319
1544 if (op->above == NULL) 1320 if (!op->above)
1545 SET_MAP_TOP (op->map, op->x, op->y, op); 1321 ms.top = op;
1546 } /* else not INS_BELOW_ORIGINATOR */ 1322 } /* else not INS_BELOW_ORIGINATOR */
1547 1323
1548 if (op->type == PLAYER) 1324 if (op->type == PLAYER)
1325 {
1549 op->contr->do_los = 1; 1326 op->contr->do_los = 1;
1327 ++op->map->players;
1328 op->map->touch ();
1329 }
1330
1331 op->map->dirty = true;
1550 1332
1551 /* If we have a floor, we know the player, if any, will be above 1333 /* 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. 1334 * it, so save a few ticks and start from there.
1553 */ 1335 */
1554 if (!(flag & INS_MAP_LOAD)) 1336 if (!(flag & INS_MAP_LOAD))
1555 for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1337 if (object *pl = ms.player ())
1556 if (tmp->type == PLAYER) 1338 if (pl->contr->ns)
1557 tmp->contr->socket.update_look = 1; 1339 pl->contr->ns->floorbox_update ();
1558 1340
1559 /* If this object glows, it may affect lighting conditions that are 1341 /* If this object glows, it may affect lighting conditions that are
1560 * visible to others on this map. But update_all_los is really 1342 * 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 1343 * 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 1344 * on the map will get recalculated. The players could very well
1563 * be far away from this change and not affected in any way - 1345 * be far away from this change and not affected in any way -
1564 * this should get redone to only look for players within range, 1346 * this should get redone to only look for players within range,
1565 * or just updating the P_NEED_UPDATE for spaces within this area 1347 * or just updating the P_UPTODATE for spaces within this area
1566 * of effect may be sufficient. 1348 * of effect may be sufficient.
1567 */ 1349 */
1568 if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) 1350 if (op->map->darkness && (op->glow_radius != 0))
1569 update_all_los (op->map, op->x, op->y); 1351 update_all_los (op->map, op->x, op->y);
1570 1352
1571 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1353 /* updates flags (blocked, alive, no magic, etc) for this map space */
1572 update_object (op, UP_OBJ_INSERT); 1354 update_object (op, UP_OBJ_INSERT);
1573 1355
1356 INVOKE_OBJECT (INSERT, op);
1357
1574 /* Don't know if moving this to the end will break anything. However, 1358 /* 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. 1359 * we want to have floorbox_update called before calling this.
1576 * 1360 *
1577 * check_move_on() must be after this because code called from 1361 * check_move_on() must be after this because code called from
1578 * check_move_on() depends on correct map flags (so functions like 1362 * check_move_on() depends on correct map flags (so functions like
1579 * blocked() and wall() work properly), and these flags are updated by 1363 * blocked() and wall() work properly), and these flags are updated by
1580 * update_object(). 1364 * update_object().
… …
1582 1366
1583 /* if this is not the head or flag has been passed, don't check walk on status */ 1367 /* 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) 1368 if (!(flag & INS_NO_WALK_ON) && !op->head)
1585 { 1369 {
1586 if (check_move_on (op, originator)) 1370 if (check_move_on (op, originator))
1587 return NULL; 1371 return 0;
1588 1372
1589 /* If we are a multi part object, lets work our way through the check 1373 /* If we are a multi part object, lets work our way through the check
1590 * walk on's. 1374 * walk on's.
1591 */ 1375 */
1592 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1376 for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1593 if (check_move_on (tmp, originator)) 1377 if (check_move_on (tmp, originator))
1594 return NULL; 1378 return 0;
1595 } 1379 }
1596 1380
1597 return op; 1381 return op;
1598} 1382}
1599 1383
1600/* this function inserts an object in the map, but if it 1384/* 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. 1385 * 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. 1386 * op is the object to insert it under: supplies x and the map.
1603 */ 1387 */
1604void 1388void
1605replace_insert_ob_in_map (const char *arch_string, object *op) 1389replace_insert_ob_in_map (const char *arch_string, object *op)
1606{ 1390{
1607 object * 1391 object *tmp, *tmp1;
1608 tmp;
1609 object *
1610 tmp1;
1611 1392
1612 /* first search for itself and remove any old instances */ 1393 /* first search for itself and remove any old instances */
1613 1394
1614 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1395 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1615 {
1616 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1396 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1617 { 1397 tmp->destroy ();
1618 remove_ob (tmp);
1619 free_object (tmp);
1620 }
1621 }
1622 1398
1623 tmp1 = arch_to_object (archetype::find (arch_string)); 1399 tmp1 = arch_to_object (archetype::find (arch_string));
1624 1400
1625 tmp1->x = op->x; 1401 tmp1->x = op->x;
1626 tmp1->y = op->y; 1402 tmp1->y = op->y;
1627 insert_ob_in_map (tmp1, op->map, op, 0); 1403 insert_ob_in_map (tmp1, op->map, op, 0);
1404}
1405
1406object *
1407object::insert_at (object *where, object *originator, int flags)
1408{
1409 where->map->insert (this, where->x, where->y, originator, flags);
1628} 1410}
1629 1411
1630/* 1412/*
1631 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1413 * 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 1414 * is returned contains nr objects, and the remaining parts contains
1633 * the rest (or is removed and freed if that number is 0). 1415 * the rest (or is removed and freed if that number is 0).
1634 * On failure, NULL is returned, and the reason put into the 1416 * On failure, NULL is returned, and the reason put into the
1635 * global static errmsg array. 1417 * global static errmsg array.
1636 */ 1418 */
1637
1638object * 1419object *
1639get_split_ob (object *orig_ob, uint32 nr) 1420get_split_ob (object *orig_ob, uint32 nr)
1640{ 1421{
1641 object * 1422 object *newob;
1642 newob;
1643 int
1644 is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); 1423 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1645 1424
1646 if (orig_ob->nrof < nr) 1425 if (orig_ob->nrof < nr)
1647 { 1426 {
1648 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); 1427 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1649 return NULL; 1428 return NULL;
1650 } 1429 }
1651 1430
1652 newob = object_create_clone (orig_ob); 1431 newob = object_create_clone (orig_ob);
1653 1432
1654 if ((orig_ob->nrof -= nr) < 1) 1433 if ((orig_ob->nrof -= nr) < 1)
1655 { 1434 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) 1435 else if (!is_removed)
1661 { 1436 {
1662 if (orig_ob->env != NULL) 1437 if (orig_ob->env != NULL)
1663 sub_weight (orig_ob->env, orig_ob->weight * nr); 1438 sub_weight (orig_ob->env, orig_ob->weight * nr);
1664 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) 1439 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
… …
1684 1459
1685object * 1460object *
1686decrease_ob_nr (object *op, uint32 i) 1461decrease_ob_nr (object *op, uint32 i)
1687{ 1462{
1688 object *tmp; 1463 object *tmp;
1689 player *pl;
1690 1464
1691 if (i == 0) /* objects with op->nrof require this check */ 1465 if (i == 0) /* objects with op->nrof require this check */
1692 return op; 1466 return op;
1693 1467
1694 if (i > op->nrof) 1468 if (i > op->nrof)
1695 i = op->nrof; 1469 i = op->nrof;
1696 1470
1697 if (QUERY_FLAG (op, FLAG_REMOVED)) 1471 if (QUERY_FLAG (op, FLAG_REMOVED))
1698 op->nrof -= i; 1472 op->nrof -= i;
1699 else if (op->env != NULL) 1473 else if (op->env)
1700 { 1474 {
1701 /* is this object in the players inventory, or sub container 1475 /* is this object in the players inventory, or sub container
1702 * therein? 1476 * therein?
1703 */ 1477 */
1704 tmp = is_player_inv (op->env); 1478 tmp = op->in_player ();
1705 /* nope. Is this a container the player has opened? 1479 /* nope. Is this a container the player has opened?
1706 * If so, set tmp to that player. 1480 * If so, set tmp to that player.
1707 * IMO, searching through all the players will mostly 1481 * IMO, searching through all the players will mostly
1708 * likely be quicker than following op->env to the map, 1482 * likely be quicker than following op->env to the map,
1709 * and then searching the map for a player. 1483 * and then searching the map for a player.
1710 */ 1484 */
1711 if (!tmp) 1485 if (!tmp)
1712 { 1486 for_all_players (pl)
1713 for (pl = first_player; pl; pl = pl->next)
1714 if (pl->ob->container == op->env) 1487 if (pl->ob->container == op->env)
1488 {
1489 tmp = pl->ob;
1715 break; 1490 break;
1716 if (pl)
1717 tmp = pl->ob;
1718 else
1719 tmp = NULL;
1720 } 1491 }
1721 1492
1722 if (i < op->nrof) 1493 if (i < op->nrof)
1723 { 1494 {
1724 sub_weight (op->env, op->weight * i); 1495 sub_weight (op->env, op->weight * i);
1725 op->nrof -= i; 1496 op->nrof -= i;
1726 if (tmp) 1497 if (tmp)
1727 {
1728 esrv_send_item (tmp, op); 1498 esrv_send_item (tmp, op);
1729 }
1730 } 1499 }
1731 else 1500 else
1732 { 1501 {
1733 remove_ob (op); 1502 op->remove ();
1734 op->nrof = 0; 1503 op->nrof = 0;
1735 if (tmp) 1504 if (tmp)
1736 {
1737 esrv_del_item (tmp->contr, op->count); 1505 esrv_del_item (tmp->contr, op->count);
1738 }
1739 } 1506 }
1740 } 1507 }
1741 else 1508 else
1742 { 1509 {
1743 object *above = op->above; 1510 object *above = op->above;
1744 1511
1745 if (i < op->nrof) 1512 if (i < op->nrof)
1746 op->nrof -= i; 1513 op->nrof -= i;
1747 else 1514 else
1748 { 1515 {
1749 remove_ob (op); 1516 op->remove ();
1750 op->nrof = 0; 1517 op->nrof = 0;
1751 } 1518 }
1752 1519
1753 /* Since we just removed op, op->above is null */ 1520 /* Since we just removed op, op->above is null */
1754 for (tmp = above; tmp != NULL; tmp = tmp->above) 1521 for (tmp = above; tmp; tmp = tmp->above)
1755 if (tmp->type == PLAYER) 1522 if (tmp->type == PLAYER)
1756 { 1523 {
1757 if (op->nrof) 1524 if (op->nrof)
1758 esrv_send_item (tmp, op); 1525 esrv_send_item (tmp, op);
1759 else 1526 else
… …
1763 1530
1764 if (op->nrof) 1531 if (op->nrof)
1765 return op; 1532 return op;
1766 else 1533 else
1767 { 1534 {
1768 free_object (op); 1535 op->destroy ();
1769 return NULL; 1536 return 0;
1770 } 1537 }
1771} 1538}
1772 1539
1773/* 1540/*
1774 * add_weight(object, weight) adds the specified weight to an object, 1541 * add_weight(object, weight) adds the specified weight to an object,
… …
1786 op->carrying += weight; 1553 op->carrying += weight;
1787 op = op->env; 1554 op = op->env;
1788 } 1555 }
1789} 1556}
1790 1557
1558object *
1559insert_ob_in_ob (object *op, object *where)
1560{
1561 if (!where)
1562 {
1563 char *dump = dump_object (op);
1564 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1565 free (dump);
1566 return op;
1567 }
1568
1569 if (where->head)
1570 {
1571 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");
1572 where = where->head;
1573 }
1574
1575 return where->insert (op);
1576}
1577
1791/* 1578/*
1792 * insert_ob_in_ob(op,environment): 1579 * env->insert (op)
1793 * This function inserts the object op in the linked list 1580 * This function inserts the object op in the linked list
1794 * inside the object environment. 1581 * inside the object environment.
1795 * 1582 *
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 1583 * The function returns now pointer to inserted item, and return value can
1802 * be != op, if items are merged. -Tero 1584 * be != op, if items are merged. -Tero
1803 */ 1585 */
1804 1586
1805object * 1587object *
1806insert_ob_in_ob (object *op, object *where) 1588object::insert (object *op)
1807{ 1589{
1808 object * 1590 object *tmp, *otmp;
1809 tmp, *
1810 otmp;
1811 1591
1812 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1592 if (!QUERY_FLAG (op, FLAG_REMOVED))
1813 { 1593 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 1594
1832 if (op->more) 1595 if (op->more)
1833 { 1596 {
1834 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); 1597 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1835 return op; 1598 return op;
… …
1837 1600
1838 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1601 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1839 CLEAR_FLAG (op, FLAG_REMOVED); 1602 CLEAR_FLAG (op, FLAG_REMOVED);
1840 if (op->nrof) 1603 if (op->nrof)
1841 { 1604 {
1842 for (tmp = where->inv; tmp != NULL; tmp = tmp->below) 1605 for (tmp = inv; tmp != NULL; tmp = tmp->below)
1843 if (CAN_MERGE (tmp, op)) 1606 if (object::can_merge (tmp, op))
1844 { 1607 {
1845 /* return the original object and remove inserted object 1608 /* return the original object and remove inserted object
1846 (client needs the original object) */ 1609 (client needs the original object) */
1847 tmp->nrof += op->nrof; 1610 tmp->nrof += op->nrof;
1848 /* Weight handling gets pretty funky. Since we are adding to 1611 /* Weight handling gets pretty funky. Since we are adding to
1849 * tmp->nrof, we need to increase the weight. 1612 * tmp->nrof, we need to increase the weight.
1850 */ 1613 */
1851 add_weight (where, op->weight * op->nrof); 1614 add_weight (this, op->weight * op->nrof);
1852 SET_FLAG (op, FLAG_REMOVED); 1615 SET_FLAG (op, FLAG_REMOVED);
1853 free_object (op); /* free the inserted object */ 1616 op->destroy (); /* free the inserted object */
1854 op = tmp; 1617 op = tmp;
1855 remove_ob (op); /* and fix old object's links */ 1618 op->remove (); /* and fix old object's links */
1856 CLEAR_FLAG (op, FLAG_REMOVED); 1619 CLEAR_FLAG (op, FLAG_REMOVED);
1857 break; 1620 break;
1858 } 1621 }
1859 1622
1860 /* I assume combined objects have no inventory 1623 /* I assume combined objects have no inventory
1861 * We add the weight - this object could have just been removed 1624 * We add the weight - this object could have just been removed
1862 * (if it was possible to merge). calling remove_ob will subtract 1625 * (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 1626 * the weight, so we need to add it in again, since we actually do
1864 * the linking below 1627 * the linking below
1865 */ 1628 */
1866 add_weight (where, op->weight * op->nrof); 1629 add_weight (this, op->weight * op->nrof);
1867 } 1630 }
1868 else 1631 else
1869 add_weight (where, (op->weight + op->carrying)); 1632 add_weight (this, (op->weight + op->carrying));
1870 1633
1871 otmp = is_player_inv (where); 1634 otmp = this->in_player ();
1872 if (otmp && otmp->contr != NULL) 1635 if (otmp && otmp->contr)
1873 {
1874 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1636 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1875 fix_player (otmp); 1637 otmp->update_stats ();
1876 }
1877 1638
1878 op->map = NULL; 1639 op->map = 0;
1879 op->env = where; 1640 op->env = this;
1880 op->above = NULL; 1641 op->above = 0;
1881 op->below = NULL; 1642 op->below = 0;
1882 op->x = 0, op->y = 0; 1643 op->x = 0, op->y = 0;
1883 1644
1884 /* reset the light list and los of the players on the map */ 1645 /* reset the light list and los of the players on the map */
1885 if ((op->glow_radius != 0) && where->map) 1646 if ((op->glow_radius != 0) && map)
1886 { 1647 {
1887#ifdef DEBUG_LIGHTS 1648#ifdef DEBUG_LIGHTS
1888 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); 1649 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1889#endif /* DEBUG_LIGHTS */ 1650#endif /* DEBUG_LIGHTS */
1890 if (MAP_DARKNESS (where->map)) 1651 if (map->darkness)
1891 update_all_los (where->map, where->x, where->y); 1652 update_all_los (map, x, y);
1892 } 1653 }
1893 1654
1894 /* Client has no idea of ordering so lets not bother ordering it here. 1655 /* Client has no idea of ordering so lets not bother ordering it here.
1895 * It sure simplifies this function... 1656 * It sure simplifies this function...
1896 */ 1657 */
1897 if (where->inv == NULL) 1658 if (!inv)
1898 where->inv = op; 1659 inv = op;
1899 else 1660 else
1900 { 1661 {
1901 op->below = where->inv; 1662 op->below = inv;
1902 op->below->above = op; 1663 op->below->above = op;
1903 where->inv = op; 1664 inv = op;
1904 } 1665 }
1666
1667 INVOKE_OBJECT (INSERT, this);
1668
1905 return op; 1669 return op;
1906} 1670}
1907 1671
1908/* 1672/*
1909 * Checks if any objects has a move_type that matches objects 1673 * Checks if any objects has a move_type that matches objects
… …
1923 * 1687 *
1924 * MSW 2001-07-08: Check all objects on space, not just those below 1688 * 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 1689 * object being inserted. insert_ob_in_map may not put new objects
1926 * on top. 1690 * on top.
1927 */ 1691 */
1928
1929int 1692int
1930check_move_on (object *op, object *originator) 1693check_move_on (object *op, object *originator)
1931{ 1694{
1932 object *tmp; 1695 object *tmp;
1933 maptile *m = op->map; 1696 maptile *m = op->map;
… …
1960 1723
1961 /* The objects have to be checked from top to bottom. 1724 /* The objects have to be checked from top to bottom.
1962 * Hence, we first go to the top: 1725 * Hence, we first go to the top:
1963 */ 1726 */
1964 1727
1965 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above) 1728 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1966 { 1729 {
1967 /* Trim the search when we find the first other spell effect 1730 /* Trim the search when we find the first other spell effect
1968 * this helps performance so that if a space has 50 spell objects, 1731 * this helps performance so that if a space has 50 spell objects,
1969 * we don't need to check all of them. 1732 * we don't need to check all of them.
1970 */ 1733 */
… …
1988 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1751 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1989 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1752 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1990 { 1753 {
1991 1754
1992 float 1755 float
1993 diff = tmp->move_slow_penalty * FABS (op->speed); 1756 diff = tmp->move_slow_penalty * fabs (op->speed);
1994 1757
1995 if (op->type == PLAYER) 1758 if (op->type == PLAYER)
1996 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1759 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1997 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1760 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1998 diff /= 4.0; 1761 diff /= 4.0;
… …
2025/* 1788/*
2026 * present_arch(arch, map, x, y) searches for any objects with 1789 * present_arch(arch, map, x, y) searches for any objects with
2027 * a matching archetype at the given map and coordinates. 1790 * a matching archetype at the given map and coordinates.
2028 * The first matching object is returned, or NULL if none. 1791 * The first matching object is returned, or NULL if none.
2029 */ 1792 */
2030
2031object * 1793object *
2032present_arch (const archetype *at, maptile *m, int x, int y) 1794present_arch (const archetype *at, maptile *m, int x, int y)
2033{ 1795{
2034 object *
2035 tmp;
2036
2037 if (m == NULL || out_of_map (m, x, y)) 1796 if (!m || out_of_map (m, x, y))
2038 { 1797 {
2039 LOG (llevError, "Present_arch called outside map.\n"); 1798 LOG (llevError, "Present_arch called outside map.\n");
2040 return NULL; 1799 return NULL;
2041 } 1800 }
2042 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1801
1802 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
2043 if (tmp->arch == at) 1803 if (tmp->arch == at)
2044 return tmp; 1804 return tmp;
1805
2045 return NULL; 1806 return NULL;
2046} 1807}
2047 1808
2048/* 1809/*
2049 * present(type, map, x, y) searches for any objects with 1810 * present(type, map, x, y) searches for any objects with
2050 * a matching type variable at the given map and coordinates. 1811 * a matching type variable at the given map and coordinates.
2051 * The first matching object is returned, or NULL if none. 1812 * The first matching object is returned, or NULL if none.
2052 */ 1813 */
2053
2054object * 1814object *
2055present (unsigned char type, maptile *m, int x, int y) 1815present (unsigned char type, maptile *m, int x, int y)
2056{ 1816{
2057 object *
2058 tmp;
2059
2060 if (out_of_map (m, x, y)) 1817 if (out_of_map (m, x, y))
2061 { 1818 {
2062 LOG (llevError, "Present called outside map.\n"); 1819 LOG (llevError, "Present called outside map.\n");
2063 return NULL; 1820 return NULL;
2064 } 1821 }
2065 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1822
1823 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
2066 if (tmp->type == type) 1824 if (tmp->type == type)
2067 return tmp; 1825 return tmp;
1826
2068 return NULL; 1827 return NULL;
2069} 1828}
2070 1829
2071/* 1830/*
2072 * present_in_ob(type, object) searches for any objects with 1831 * present_in_ob(type, object) searches for any objects with
2073 * a matching type variable in the inventory of the given object. 1832 * a matching type variable in the inventory of the given object.
2074 * The first matching object is returned, or NULL if none. 1833 * The first matching object is returned, or NULL if none.
2075 */ 1834 */
2076
2077object * 1835object *
2078present_in_ob (unsigned char type, const object *op) 1836present_in_ob (unsigned char type, const object *op)
2079{ 1837{
2080 object *
2081 tmp;
2082
2083 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1838 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2084 if (tmp->type == type) 1839 if (tmp->type == type)
2085 return tmp; 1840 return tmp;
1841
2086 return NULL; 1842 return NULL;
2087} 1843}
2088 1844
2089/* 1845/*
2090 * present_in_ob (type, str, object) searches for any objects with 1846 * present_in_ob (type, str, object) searches for any objects with
… …
2098 * str is the string to match against. Note that we match against 1854 * 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 1855 * 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 1856 * spell code can use one object type (force), but change it's name
2101 * to be unique. 1857 * to be unique.
2102 */ 1858 */
2103
2104object * 1859object *
2105present_in_ob_by_name (int type, const char *str, const object *op) 1860present_in_ob_by_name (int type, const char *str, const object *op)
2106{ 1861{
2107 object *
2108 tmp;
2109
2110 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1862 for (object *tmp = op->inv; tmp; tmp = tmp->below)
2111 {
2112 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) 1863 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2113 return tmp; 1864 return tmp;
2114 } 1865
2115 return NULL; 1866 return 0;
2116} 1867}
2117 1868
2118/* 1869/*
2119 * present_arch_in_ob(archetype, object) searches for any objects with 1870 * present_arch_in_ob(archetype, object) searches for any objects with
2120 * a matching archetype in the inventory of the given object. 1871 * a matching archetype in the inventory of the given object.
2121 * The first matching object is returned, or NULL if none. 1872 * The first matching object is returned, or NULL if none.
2122 */ 1873 */
2123
2124object * 1874object *
2125present_arch_in_ob (const archetype *at, const object *op) 1875present_arch_in_ob (const archetype *at, const object *op)
2126{ 1876{
2127 object *
2128 tmp;
2129
2130 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1877 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2131 if (tmp->arch == at) 1878 if (tmp->arch == at)
2132 return tmp; 1879 return tmp;
1880
2133 return NULL; 1881 return NULL;
2134} 1882}
2135 1883
2136/* 1884/*
2137 * activate recursively a flag on an object inventory 1885 * activate recursively a flag on an object inventory
2138 */ 1886 */
2139void 1887void
2140flag_inv (object *op, int flag) 1888flag_inv (object *op, int flag)
2141{ 1889{
2142 object *
2143 tmp;
2144
2145 if (op->inv) 1890 if (op->inv)
2146 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1891 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2147 { 1892 {
2148 SET_FLAG (tmp, flag); 1893 SET_FLAG (tmp, flag);
2149 flag_inv (tmp, flag); 1894 flag_inv (tmp, flag);
2150 } 1895 }
2151} /* 1896}
1897
1898/*
2152 * desactivate recursively a flag on an object inventory 1899 * deactivate recursively a flag on an object inventory
2153 */ 1900 */
2154void 1901void
2155unflag_inv (object *op, int flag) 1902unflag_inv (object *op, int flag)
2156{ 1903{
2157 object *
2158 tmp;
2159
2160 if (op->inv) 1904 if (op->inv)
2161 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1905 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2162 { 1906 {
2163 CLEAR_FLAG (tmp, flag); 1907 CLEAR_FLAG (tmp, flag);
2164 unflag_inv (tmp, flag); 1908 unflag_inv (tmp, flag);
2165 } 1909 }
2166} 1910}
… …
2169 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in 1913 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2170 * all it's inventory (recursively). 1914 * all it's inventory (recursively).
2171 * If checksums are used, a player will get set_cheat called for 1915 * 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. 1916 * him/her-self and all object carried by a call to this function.
2173 */ 1917 */
2174
2175void 1918void
2176set_cheat (object *op) 1919set_cheat (object *op)
2177{ 1920{
2178 SET_FLAG (op, FLAG_WAS_WIZ); 1921 SET_FLAG (op, FLAG_WAS_WIZ);
2179 flag_inv (op, FLAG_WAS_WIZ); 1922 flag_inv (op, FLAG_WAS_WIZ);
… …
2198 * because arch_blocked (now ob_blocked) needs to know the movement type 1941 * 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 1942 * 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 1943 * the archetype because that isn't correct if the monster has been
2201 * customized, changed states, etc. 1944 * customized, changed states, etc.
2202 */ 1945 */
2203
2204int 1946int
2205find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 1947find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2206{ 1948{
2207 int
2208 i,
2209 index = 0, flag; 1949 int index = 0, flag;
2210 static int
2211 altern[SIZEOFFREE]; 1950 int altern[SIZEOFFREE];
2212 1951
2213 for (i = start; i < stop; i++) 1952 for (int i = start; i < stop; i++)
2214 { 1953 {
2215 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); 1954 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2216 if (!flag) 1955 if (!flag)
2217 altern[index++] = i; 1956 altern [index++] = i;
2218 1957
2219 /* Basically, if we find a wall on a space, we cut down the search size. 1958 /* 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. 1959 * 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 - 1960 * 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 1961 * 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 1962 * spaces in all the other directions, this will reduce the search space
2224 * to only the spaces immediately surrounding the target area, and 1963 * to only the spaces immediately surrounding the target area, and
2225 * won't look 2 spaces south of the target space. 1964 * won't look 2 spaces south of the target space.
2226 */ 1965 */
2227 else if ((flag & AB_NO_PASS) && maxfree[i] < stop) 1966 else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2228 stop = maxfree[i]; 1967 stop = maxfree[i];
2229 } 1968 }
1969
2230 if (!index) 1970 if (!index)
2231 return -1; 1971 return -1;
1972
2232 return altern[RANDOM () % index]; 1973 return altern[RANDOM () % index];
2233} 1974}
2234 1975
2235/* 1976/*
2236 * find_first_free_spot(archetype, maptile, x, y) works like 1977 * find_first_free_spot(archetype, maptile, x, y) works like
2237 * find_free_spot(), but it will search max number of squares. 1978 * find_free_spot(), but it will search max number of squares.
2238 * But it will return the first available spot, not a random choice. 1979 * 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. 1980 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2240 */ 1981 */
2241
2242int 1982int
2243find_first_free_spot (const object *ob, maptile *m, int x, int y) 1983find_first_free_spot (const object *ob, maptile *m, int x, int y)
2244{ 1984{
2245 int
2246 i;
2247
2248 for (i = 0; i < SIZEOFFREE; i++) 1985 for (int i = 0; i < SIZEOFFREE; i++)
2249 {
2250 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) 1986 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2251 return i; 1987 return i;
2252 } 1988
2253 return -1; 1989 return -1;
2254} 1990}
2255 1991
2256/* 1992/*
2257 * The function permute(arr, begin, end) randomly reorders the array 1993 * The function permute(arr, begin, end) randomly reorders the array
2258 * arr[begin..end-1]. 1994 * arr[begin..end-1].
1995 * now uses a fisher-yates shuffle, old permute was broken
2259 */ 1996 */
2260static void 1997static void
2261permute (int *arr, int begin, int end) 1998permute (int *arr, int begin, int end)
2262{ 1999{
2263 int 2000 arr += begin;
2264 i,
2265 j,
2266 tmp,
2267 len;
2268
2269 len = end - begin; 2001 end -= begin;
2270 for (i = begin; i < end; i++)
2271 {
2272 j = begin + RANDOM () % len;
2273 2002
2274 tmp = arr[i]; 2003 while (--end)
2275 arr[i] = arr[j]; 2004 swap (arr [end], arr [RANDOM () % (end + 1)]);
2276 arr[j] = tmp;
2277 }
2278} 2005}
2279 2006
2280/* new function to make monster searching more efficient, and effective! 2007/* new function to make monster searching more efficient, and effective!
2281 * This basically returns a randomized array (in the passed pointer) of 2008 * 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 2009 * 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. 2012 * the 3x3 area will be searched, just not in a predictable order.
2286 */ 2013 */
2287void 2014void
2288get_search_arr (int *search_arr) 2015get_search_arr (int *search_arr)
2289{ 2016{
2290 int 2017 int i;
2291 i;
2292 2018
2293 for (i = 0; i < SIZEOFFREE; i++) 2019 for (i = 0; i < SIZEOFFREE; i++)
2294 {
2295 search_arr[i] = i; 2020 search_arr[i] = i;
2296 }
2297 2021
2298 permute (search_arr, 1, SIZEOFFREE1 + 1); 2022 permute (search_arr, 1, SIZEOFFREE1 + 1);
2299 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); 2023 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2300 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); 2024 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2301} 2025}
… …
2310 * Perhaps incorrectly, but I'm making the assumption that exclude 2034 * 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 2035 * 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 2036 * because we have to know what movement the thing looking to move
2313 * there is capable of. 2037 * there is capable of.
2314 */ 2038 */
2315
2316int 2039int
2317find_dir (maptile *m, int x, int y, object *exclude) 2040find_dir (maptile *m, int x, int y, object *exclude)
2318{ 2041{
2319 int
2320 i,
2321 max = SIZEOFFREE, mflags; 2042 int i, max = SIZEOFFREE, mflags;
2322 2043
2323 sint16 nx, ny; 2044 sint16 nx, ny;
2324 object * 2045 object *tmp;
2325 tmp;
2326 maptile * 2046 maptile *mp;
2327 mp;
2328 2047
2329 MoveType blocked, move_type; 2048 MoveType blocked, move_type;
2330 2049
2331 if (exclude && exclude->head) 2050 if (exclude && exclude->head)
2332 { 2051 {
… …
2344 mp = m; 2063 mp = m;
2345 nx = x + freearr_x[i]; 2064 nx = x + freearr_x[i];
2346 ny = y + freearr_y[i]; 2065 ny = y + freearr_y[i];
2347 2066
2348 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2067 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
2068
2349 if (mflags & P_OUT_OF_MAP) 2069 if (mflags & P_OUT_OF_MAP)
2350 {
2351 max = maxfree[i]; 2070 max = maxfree[i];
2352 }
2353 else 2071 else
2354 { 2072 {
2355 blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); 2073 mapspace &ms = mp->at (nx, ny);
2074
2075 blocked = ms.move_block;
2356 2076
2357 if ((move_type & blocked) == move_type) 2077 if ((move_type & blocked) == move_type)
2358 {
2359 max = maxfree[i]; 2078 max = maxfree[i];
2360 }
2361 else if (mflags & P_IS_ALIVE) 2079 else if (mflags & P_IS_ALIVE)
2362 { 2080 {
2363 for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above) 2081 for (tmp = ms.bot; tmp; tmp = tmp->above)
2364 { 2082 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))) 2083 && (tmp != exclude || (tmp->head && tmp->head != exclude)))
2366 {
2367 break; 2084 break;
2368 } 2085
2369 }
2370 if (tmp) 2086 if (tmp)
2371 {
2372 return freedir[i]; 2087 return freedir[i];
2373 }
2374 } 2088 }
2375 } 2089 }
2376 } 2090 }
2091
2377 return 0; 2092 return 0;
2378} 2093}
2379 2094
2380/* 2095/*
2381 * distance(object 1, object 2) will return the square of the 2096 * distance(object 1, object 2) will return the square of the
2382 * distance between the two given objects. 2097 * distance between the two given objects.
2383 */ 2098 */
2384
2385int 2099int
2386distance (const object *ob1, const object *ob2) 2100distance (const object *ob1, const object *ob2)
2387{ 2101{
2388 int
2389 i;
2390
2391 i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); 2102 return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2392 return i;
2393} 2103}
2394 2104
2395/* 2105/*
2396 * find_dir_2(delta-x,delta-y) will return a direction in which 2106 * 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 2107 * an object which has subtracted the x and y coordinates of another
2398 * object, needs to travel toward it. 2108 * object, needs to travel toward it.
2399 */ 2109 */
2400
2401int 2110int
2402find_dir_2 (int x, int y) 2111find_dir_2 (int x, int y)
2403{ 2112{
2404 int 2113 int q;
2405 q;
2406 2114
2407 if (y) 2115 if (y)
2408 q = x * 100 / y; 2116 q = x * 100 / y;
2409 else if (x) 2117 else if (x)
2410 q = -300 * x; 2118 q = -300 * x;
… …
2435 2143
2436 return 3; 2144 return 3;
2437} 2145}
2438 2146
2439/* 2147/*
2440 * absdir(int): Returns a number between 1 and 8, which represent
2441 * the "absolute" direction of a number (it actually takes care of
2442 * "overflow" in previous calculations of a direction).
2443 */
2444
2445int
2446absdir (int d)
2447{
2448 while (d < 1)
2449 d += 8;
2450 while (d > 8)
2451 d -= 8;
2452 return d;
2453}
2454
2455/*
2456 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2148 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2457 * between two directions (which are expected to be absolute (see absdir()) 2149 * between two directions (which are expected to be absolute (see absdir())
2458 */ 2150 */
2459
2460int 2151int
2461dirdiff (int dir1, int dir2) 2152dirdiff (int dir1, int dir2)
2462{ 2153{
2463 int 2154 int d;
2464 d;
2465 2155
2466 d = abs (dir1 - dir2); 2156 d = abs (dir1 - dir2);
2467 if (d > 4) 2157 if (d > 4)
2468 d = 8 - d; 2158 d = 8 - d;
2159
2469 return d; 2160 return d;
2470} 2161}
2471 2162
2472/* peterm: 2163/* peterm:
2473 * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. 2164 * 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 2167 * 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. 2168 * 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 2169 * Moved from spell_util.c to object.c with the other related direction
2479 * functions. 2170 * functions.
2480 */ 2171 */
2481
2482int
2483 reduction_dir[SIZEOFFREE][3] = { 2172int reduction_dir[SIZEOFFREE][3] = {
2484 {0, 0, 0}, /* 0 */ 2173 {0, 0, 0}, /* 0 */
2485 {0, 0, 0}, /* 1 */ 2174 {0, 0, 0}, /* 1 */
2486 {0, 0, 0}, /* 2 */ 2175 {0, 0, 0}, /* 2 */
2487 {0, 0, 0}, /* 3 */ 2176 {0, 0, 0}, /* 3 */
2488 {0, 0, 0}, /* 4 */ 2177 {0, 0, 0}, /* 4 */
… …
2536 * find a path to that monster that we found. If not, 2225 * find a path to that monster that we found. If not,
2537 * we don't bother going toward it. Returns 1 if we 2226 * we don't bother going toward it. Returns 1 if we
2538 * can see a direct way to get it 2227 * can see a direct way to get it
2539 * Modified to be map tile aware -.MSW 2228 * Modified to be map tile aware -.MSW
2540 */ 2229 */
2541
2542
2543int 2230int
2544can_see_monsterP (maptile *m, int x, int y, int dir) 2231can_see_monsterP (maptile *m, int x, int y, int dir)
2545{ 2232{
2546 sint16 dx, dy; 2233 sint16 dx, dy;
2547 int
2548 mflags; 2234 int mflags;
2549 2235
2550 if (dir < 0) 2236 if (dir < 0)
2551 return 0; /* exit condition: invalid direction */ 2237 return 0; /* exit condition: invalid direction */
2552 2238
2553 dx = x + freearr_x[dir]; 2239 dx = x + freearr_x[dir];
… …
2566 return 0; 2252 return 0;
2567 2253
2568 /* yes, can see. */ 2254 /* yes, can see. */
2569 if (dir < 9) 2255 if (dir < 9)
2570 return 1; 2256 return 1;
2257
2571 return can_see_monsterP (m, x, y, reduction_dir[dir][0]) | 2258 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]); 2259 | can_see_monsterP (m, x, y, reduction_dir[dir][1])
2260 | can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2573} 2261}
2574
2575
2576 2262
2577/* 2263/*
2578 * can_pick(picker, item): finds out if an object is possible to be 2264 * 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 2265 * picked up by the picker. Returnes 1 if it can be
2580 * picked up, otherwise 0. 2266 * picked up, otherwise 0.
… …
2591 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2277 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2592 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2278 (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)); 2279 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2594} 2280}
2595 2281
2596
2597/* 2282/*
2598 * create clone from object to another 2283 * create clone from object to another
2599 */ 2284 */
2600object * 2285object *
2601object_create_clone (object *asrc) 2286object_create_clone (object *asrc)
2602{ 2287{
2603 object *
2604 dst = NULL, *tmp, *src, *part, *prev, *item; 2288 object *dst = 0, *tmp, *src, *part, *prev, *item;
2605 2289
2606 if (!asrc) 2290 if (!asrc)
2607 return NULL; 2291 return 0;
2292
2608 src = asrc; 2293 src = asrc;
2609 if (src->head) 2294 if (src->head)
2610 src = src->head; 2295 src = src->head;
2611 2296
2612 prev = NULL; 2297 prev = 0;
2613 for (part = src; part; part = part->more) 2298 for (part = src; part; part = part->more)
2614 { 2299 {
2615 tmp = get_object (); 2300 tmp = part->clone ();
2616 copy_object (part, tmp);
2617 tmp->x -= src->x; 2301 tmp->x -= src->x;
2618 tmp->y -= src->y; 2302 tmp->y -= src->y;
2303
2619 if (!part->head) 2304 if (!part->head)
2620 { 2305 {
2621 dst = tmp; 2306 dst = tmp;
2622 tmp->head = NULL; 2307 tmp->head = 0;
2623 } 2308 }
2624 else 2309 else
2625 {
2626 tmp->head = dst; 2310 tmp->head = dst;
2627 } 2311
2628 tmp->more = NULL; 2312 tmp->more = 0;
2313
2629 if (prev) 2314 if (prev)
2630 prev->more = tmp; 2315 prev->more = tmp;
2316
2631 prev = tmp; 2317 prev = tmp;
2632 } 2318 }
2633 2319
2634 for (item = src->inv; item; item = item->below) 2320 for (item = src->inv; item; item = item->below)
2635 insert_ob_in_ob (object_create_clone (item), dst); 2321 insert_ob_in_ob (object_create_clone (item), dst);
… …
2641/* Basically, we save the content of the string to a temp file, then call */ 2327/* 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, */ 2328/* 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. */ 2329/* 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. */ 2330/* Remember not to use load_object_str in a time-critical situation. */
2645/* Also remember that multiparts objects are not supported for now. */ 2331/* Also remember that multiparts objects are not supported for now. */
2646
2647object * 2332object *
2648load_object_str (const char *obstr) 2333load_object_str (const char *obstr)
2649{ 2334{
2650 object *op; 2335 object *op;
2651 char filename[MAX_BUF]; 2336 char filename[MAX_BUF];
… …
2661 } 2346 }
2662 2347
2663 fprintf (tempfile, obstr); 2348 fprintf (tempfile, obstr);
2664 fclose (tempfile); 2349 fclose (tempfile);
2665 2350
2666 op = get_object (); 2351 op = object::create ();
2667 2352
2668 object_thawer thawer (filename); 2353 object_thawer thawer (filename);
2669 2354
2670 if (thawer) 2355 if (thawer)
2671 load_object (thawer, op, 0); 2356 load_object (thawer, op, 0);
… …
2681 * returns NULL if no match. 2366 * returns NULL if no match.
2682 */ 2367 */
2683object * 2368object *
2684find_obj_by_type_subtype (const object *who, int type, int subtype) 2369find_obj_by_type_subtype (const object *who, int type, int subtype)
2685{ 2370{
2686 object *tmp;
2687
2688 for (tmp = who->inv; tmp; tmp = tmp->below) 2371 for (object *tmp = who->inv; tmp; tmp = tmp->below)
2689 if (tmp->type == type && tmp->subtype == subtype) 2372 if (tmp->type == type && tmp->subtype == subtype)
2690 return tmp; 2373 return tmp;
2691 2374
2692 return NULL; 2375 return 0;
2693} 2376}
2694 2377
2695/* If ob has a field named key, return the link from the list, 2378/* If ob has a field named key, return the link from the list,
2696 * otherwise return NULL. 2379 * otherwise return NULL.
2697 * 2380 *
… …
2699 * do the desired thing. 2382 * do the desired thing.
2700 */ 2383 */
2701key_value * 2384key_value *
2702get_ob_key_link (const object *ob, const char *key) 2385get_ob_key_link (const object *ob, const char *key)
2703{ 2386{
2704 key_value *link;
2705
2706 for (link = ob->key_values; link != NULL; link = link->next) 2387 for (key_value *link = ob->key_values; link; link = link->next)
2707 if (link->key == key) 2388 if (link->key == key)
2708 return link; 2389 return link;
2709 2390
2710 return NULL; 2391 return 0;
2711} 2392}
2712 2393
2713/* 2394/*
2714 * Returns the value of op has an extra_field for key, or NULL. 2395 * Returns the value of op has an extra_field for key, or NULL.
2715 * 2396 *
… …
2755 * Returns TRUE on success. 2436 * Returns TRUE on success.
2756 */ 2437 */
2757int 2438int
2758set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) 2439set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2759{ 2440{
2760 key_value *
2761 field = NULL, *last = NULL; 2441 key_value *field = NULL, *last = NULL;
2762 2442
2763 for (field = op->key_values; field != NULL; field = field->next) 2443 for (field = op->key_values; field != NULL; field = field->next)
2764 { 2444 {
2765 if (field->key != canonical_key) 2445 if (field->key != canonical_key)
2766 { 2446 {
… …
2794 /* IF we get here, key doesn't exist */ 2474 /* IF we get here, key doesn't exist */
2795 2475
2796 /* No field, we'll have to add it. */ 2476 /* No field, we'll have to add it. */
2797 2477
2798 if (!add_key) 2478 if (!add_key)
2799 {
2800 return FALSE; 2479 return FALSE;
2801 } 2480
2802 /* There isn't any good reason to store a null 2481 /* There isn't any good reason to store a null
2803 * value in the key/value list. If the archetype has 2482 * value in the key/value list. If the archetype has
2804 * this key, then we should also have it, so shouldn't 2483 * this key, then we should also have it, so shouldn't
2805 * be here. If user wants to store empty strings, 2484 * be here. If user wants to store empty strings,
2806 * should pass in "" 2485 * should pass in ""
… …
2855 } 2534 }
2856 else 2535 else
2857 item = item->env; 2536 item = item->env;
2858} 2537}
2859 2538
2539
2540const char *
2541object::flag_desc (char *desc, int len) const
2542{
2543 char *p = desc;
2544 bool first = true;
2545
2546 *p = 0;
2547
2548 for (int i = 0; i < NUM_FLAGS; i++)
2549 {
2550 if (len <= 10) // magic constant!
2551 {
2552 snprintf (p, len, ",...");
2553 break;
2554 }
2555
2556 if (flag [i])
2557 {
2558 int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
2559 len -= cnt;
2560 p += cnt;
2561 first = false;
2562 }
2563 }
2564
2565 return desc;
2566}
2567
2860// return a suitable string describing an objetc in enough detail to find it 2568// return a suitable string describing an object in enough detail to find it
2861const char * 2569const char *
2862object::debug_desc (char *info) const 2570object::debug_desc (char *info) const
2863{ 2571{
2572 char flagdesc[512];
2864 char info2[256 * 3]; 2573 char info2[256 * 4];
2865 char *p = info; 2574 char *p = info;
2866 2575
2867 p += snprintf (p, 256, "%d=\"%s%s%s\"", 2576 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2868 count, 2577 count, uuid.seq,
2869 &name, 2578 &name,
2870 title ? " " : "", 2579 title ? "\",title:\"" : "",
2871 title ? (const char *)title : ""); 2580 title ? (const char *)title : "",
2581 flag_desc (flagdesc, 512), type);
2872 2582
2873 if (env) 2583 if (env)
2874 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2584 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2875 2585
2876 if (map) 2586 if (map)
2877 p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); 2587 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2878 2588
2879 return info; 2589 return info;
2880} 2590}
2881 2591
2882const char * 2592const char *
2883object::debug_desc () const 2593object::debug_desc () const
2884{ 2594{
2885 static char info[256 * 3]; 2595 static char info[256 * 4];
2886 return debug_desc (info); 2596 return debug_desc (info);
2887} 2597}
2888 2598
2599const char *
2600object::debug_desc2 () const
2601{
2602 static char info[256 * 4];
2603 return debug_desc (info);
2604}
2605

Diff Legend

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