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.55 by root, Sun Dec 3 00:41:33 2006 UTC vs.
Revision 1.141 by root, Sun Apr 29 21:44:34 2007 UTC

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

Diff Legend

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