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> |
… | |
… | |
36 | |
37 | |
37 | int nrofallocobjects = 0; |
38 | int nrofallocobjects = 0; |
38 | static UUID uuid; |
39 | static UUID uuid; |
39 | const uint64 UUID_SKIP = 1<<19; |
40 | const uint64 UUID_SKIP = 1<<19; |
40 | |
41 | |
41 | object *active_objects; /* List of active objects that need to be processed */ |
42 | objectvec objects; |
|
|
43 | activevec actives; |
42 | |
44 | |
43 | short 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, |
45 | short 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, |
44 | 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 |
45 | }; |
47 | }; |
46 | short 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, |
48 | short 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, |
… | |
… | |
276 | |
278 | |
277 | /* 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 |
278 | * 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 |
279 | * check? |
281 | * check? |
280 | */ |
282 | */ |
281 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) |
283 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
282 | return 0; |
284 | return 0; |
283 | |
285 | |
284 | switch (ob1->type) |
286 | switch (ob1->type) |
285 | { |
287 | { |
286 | case SCROLL: |
288 | case SCROLL: |
… | |
… | |
311 | |
313 | |
312 | /* Everything passes, must be OK. */ |
314 | /* Everything passes, must be OK. */ |
313 | return 1; |
315 | return 1; |
314 | } |
316 | } |
315 | |
317 | |
|
|
318 | void |
|
|
319 | player::set_range (rangetype r) |
|
|
320 | { |
|
|
321 | shoottype = r; |
|
|
322 | } |
|
|
323 | |
316 | /* |
324 | /* |
317 | * sum_weight() is a recursive function which calculates the weight |
325 | * sum_weight() is a recursive function which calculates the weight |
318 | * 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 |
319 | * containers are carrying, and sums it up. |
327 | * containers are carrying, and sums it up. |
320 | */ |
328 | */ |
… | |
… | |
355 | /* |
363 | /* |
356 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
364 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
357 | * Some error messages. |
365 | * Some error messages. |
358 | * 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. |
359 | */ |
367 | */ |
360 | |
|
|
361 | char * |
368 | char * |
362 | dump_object (object *op) |
369 | dump_object (object *op) |
363 | { |
370 | { |
364 | if (!op) |
371 | if (!op) |
365 | return strdup ("[NULLOBJ]"); |
372 | return strdup ("[NULLOBJ]"); |
366 | |
373 | |
367 | object_freezer freezer; |
374 | object_freezer freezer; |
368 | save_object (freezer, op, 1); |
375 | op->write (freezer); |
369 | return freezer.as_string (); |
376 | return freezer.as_string (); |
370 | } |
377 | } |
371 | |
378 | |
372 | /* |
379 | /* |
373 | * 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 |
… | |
… | |
390 | } |
397 | } |
391 | |
398 | |
392 | /* |
399 | /* |
393 | * 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. |
394 | */ |
401 | */ |
395 | |
|
|
396 | object * |
402 | object * |
397 | find_object (tag_t i) |
403 | find_object (tag_t i) |
398 | { |
404 | { |
399 | for (object *op = object::first; op; op = op->next) |
405 | for_all_objects (op) |
400 | if (op->count == i) |
406 | if (op->count == i) |
401 | return op; |
407 | return op; |
402 | |
408 | |
403 | return 0; |
409 | return 0; |
404 | } |
410 | } |
405 | |
411 | |
406 | /* |
412 | /* |
407 | * 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. |
408 | * Used only by the patch command, but not all that useful. |
414 | * Used only by the patch command, but not all that useful. |
409 | * Enables features like "patch <name-of-other-player> food 999" |
415 | * Enables features like "patch <name-of-other-player> food 999" |
410 | */ |
416 | */ |
411 | |
|
|
412 | object * |
417 | object * |
413 | find_object_name (const char *str) |
418 | find_object_name (const char *str) |
414 | { |
419 | { |
415 | shstr_cmp str_ (str); |
420 | shstr_cmp str_ (str); |
416 | object *op; |
421 | object *op; |
417 | |
422 | |
418 | for (op = object::first; op != NULL; op = op->next) |
423 | for_all_objects (op) |
419 | if (op->name == str_) |
424 | if (op->name == str_) |
420 | break; |
425 | break; |
421 | |
426 | |
422 | return op; |
427 | return op; |
423 | } |
428 | } |
… | |
… | |
455 | * refcounts and freeing the links. |
460 | * refcounts and freeing the links. |
456 | */ |
461 | */ |
457 | static void |
462 | static void |
458 | free_key_values (object *op) |
463 | free_key_values (object *op) |
459 | { |
464 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
465 | for (key_value *i = op->key_values; i; ) |
461 | { |
466 | { |
462 | key_value *next = i->next; |
467 | key_value *next = i->next; |
463 | delete i; |
468 | delete i; |
464 | |
469 | |
465 | i = next; |
470 | i = next; |
466 | } |
471 | } |
467 | |
472 | |
468 | op->key_values = 0; |
473 | op->key_values = 0; |
469 | } |
474 | } |
470 | |
475 | |
471 | /* |
476 | object & |
472 | * copy_to first frees everything allocated by the dst object, |
477 | object::operator =(const object &src) |
473 | * and then copies the contents of itself into the second |
|
|
474 | * object, allocating what needs to be allocated. Basically, any |
|
|
475 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
476 | * if the first object is freed, the pointers in the new object |
|
|
477 | * will point at garbage. |
|
|
478 | */ |
|
|
479 | void |
|
|
480 | object::copy_to (object *dst) |
|
|
481 | { |
478 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
479 | bool is_freed = flag [FLAG_FREED]; |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
480 | bool is_removed = flag [FLAG_REMOVED]; |
484 | |
481 | |
485 | *(object_copy *)dst = *this; |
482 | *(object_copy *)this = src; |
486 | |
483 | |
487 | if (is_freed) |
484 | flag [FLAG_FREED] = is_freed; |
488 | SET_FLAG (dst, FLAG_FREED); |
485 | flag [FLAG_REMOVED] = is_removed; |
489 | |
|
|
490 | if (is_removed) |
|
|
491 | SET_FLAG (dst, FLAG_REMOVED); |
|
|
492 | |
|
|
493 | if (speed < 0) |
|
|
494 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
|
|
495 | |
486 | |
496 | /* Copy over key_values, if any. */ |
487 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
488 | if (src.key_values) |
498 | { |
489 | { |
499 | key_value *tail = 0; |
490 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
491 | key_values = 0; |
503 | |
492 | |
504 | for (i = key_values; i; i = i->next) |
493 | for (key_value *i = src.key_values; i; i = i->next) |
505 | { |
494 | { |
506 | key_value *new_link = new key_value; |
495 | key_value *new_link = new key_value; |
507 | |
496 | |
508 | new_link->next = 0; |
497 | new_link->next = 0; |
509 | new_link->key = i->key; |
498 | new_link->key = i->key; |
510 | new_link->value = i->value; |
499 | new_link->value = i->value; |
511 | |
500 | |
512 | /* Try and be clever here, too. */ |
501 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
502 | if (!key_values) |
514 | { |
503 | { |
515 | dst->key_values = new_link; |
504 | key_values = new_link; |
516 | tail = new_link; |
505 | tail = new_link; |
517 | } |
506 | } |
518 | else |
507 | else |
519 | { |
508 | { |
520 | tail->next = new_link; |
509 | tail->next = new_link; |
521 | tail = new_link; |
510 | tail = new_link; |
522 | } |
511 | } |
523 | } |
512 | } |
524 | } |
513 | } |
|
|
514 | } |
|
|
515 | |
|
|
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 | */ |
|
|
524 | void |
|
|
525 | object::copy_to (object *dst) |
|
|
526 | { |
|
|
527 | *dst = *this; |
|
|
528 | |
|
|
529 | if (speed < 0) |
|
|
530 | dst->speed_left = speed_left - rndm (); |
525 | |
531 | |
526 | dst->set_speed (dst->speed); |
532 | dst->set_speed (dst->speed); |
|
|
533 | } |
|
|
534 | |
|
|
535 | void |
|
|
536 | object::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 (); |
527 | } |
551 | } |
528 | |
552 | |
529 | object * |
553 | object * |
530 | object::clone () |
554 | object::clone () |
531 | { |
555 | { |
… | |
… | |
563 | speed = 0; |
587 | speed = 0; |
564 | } |
588 | } |
565 | |
589 | |
566 | this->speed = speed; |
590 | this->speed = speed; |
567 | |
591 | |
568 | if (FABS (speed) > MIN_ACTIVE_SPEED) |
592 | if (has_active_speed ()) |
569 | { |
593 | activate (); |
570 | /* If already on active list, don't do anything */ |
|
|
571 | if (active_next || active_prev || this == active_objects) |
|
|
572 | return; |
|
|
573 | |
|
|
574 | /* process_events() expects us to insert the object at the beginning |
|
|
575 | * of the list. */ |
|
|
576 | active_next = active_objects; |
|
|
577 | |
|
|
578 | if (active_next) |
|
|
579 | active_next->active_prev = this; |
|
|
580 | |
|
|
581 | active_objects = this; |
|
|
582 | } |
|
|
583 | else |
594 | else |
584 | { |
595 | deactivate (); |
585 | /* If not on the active list, nothing needs to be done */ |
|
|
586 | if (!active_next && !active_prev && this != active_objects) |
|
|
587 | return; |
|
|
588 | |
|
|
589 | if (!active_prev) |
|
|
590 | { |
|
|
591 | active_objects = active_next; |
|
|
592 | |
|
|
593 | if (active_next) |
|
|
594 | active_next->active_prev = 0; |
|
|
595 | } |
|
|
596 | else |
|
|
597 | { |
|
|
598 | active_prev->active_next = active_next; |
|
|
599 | |
|
|
600 | if (active_next) |
|
|
601 | active_next->active_prev = active_prev; |
|
|
602 | } |
|
|
603 | |
|
|
604 | active_next = 0; |
|
|
605 | active_prev = 0; |
|
|
606 | } |
|
|
607 | } |
596 | } |
608 | |
597 | |
609 | /* |
598 | /* |
610 | * update_object() updates the the map. |
599 | * update_object() updates the the map. |
611 | * It takes into account invisible objects (and represent squares covered |
600 | * It takes into account invisible objects (and represent squares covered |
… | |
… | |
624 | * UP_OBJ_FACE: only the objects face has changed. |
613 | * UP_OBJ_FACE: only the objects face has changed. |
625 | */ |
614 | */ |
626 | void |
615 | void |
627 | update_object (object *op, int action) |
616 | update_object (object *op, int action) |
628 | { |
617 | { |
629 | MoveType move_on, move_off, move_block, move_slow; |
|
|
630 | |
|
|
631 | if (op == NULL) |
618 | if (op == NULL) |
632 | { |
619 | { |
633 | /* this should never happen */ |
620 | /* this should never happen */ |
634 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
621 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
635 | return; |
622 | return; |
… | |
… | |
659 | return; |
646 | return; |
660 | } |
647 | } |
661 | |
648 | |
662 | mapspace &m = op->ms (); |
649 | mapspace &m = op->ms (); |
663 | |
650 | |
664 | if (m.flags_ & P_NEED_UPDATE) |
651 | if (!(m.flags_ & P_UPTODATE)) |
665 | /* nop */; |
652 | /* nop */; |
666 | else if (action == UP_OBJ_INSERT) |
653 | else if (action == UP_OBJ_INSERT) |
667 | { |
654 | { |
668 | // this is likely overkill, TODO: revisit (schmorp) |
655 | // this is likely overkill, TODO: revisit (schmorp) |
669 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
656 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
… | |
… | |
678 | /* 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 |
679 | * to have move_allow right now. |
666 | * to have move_allow right now. |
680 | */ |
667 | */ |
681 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
668 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
682 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
669 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
683 | m.flags_ = P_NEED_UPDATE; |
670 | m.flags_ = 0; |
684 | } |
671 | } |
685 | /* if the object is being removed, we can't make intelligent |
672 | /* if the object is being removed, we can't make intelligent |
686 | * decisions, because remove_ob can't really pass the object |
673 | * decisions, because remove_ob can't really pass the object |
687 | * that is being removed. |
674 | * that is being removed. |
688 | */ |
675 | */ |
689 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
676 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
690 | m.flags_ = P_NEED_UPDATE; |
677 | m.flags_ = 0; |
691 | else if (action == UP_OBJ_FACE) |
678 | else if (action == UP_OBJ_FACE) |
692 | /* Nothing to do for that case */ ; |
679 | /* Nothing to do for that case */ ; |
693 | else |
680 | else |
694 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
681 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
695 | |
682 | |
696 | if (op->more) |
683 | if (op->more) |
697 | update_object (op->more, action); |
684 | update_object (op->more, action); |
698 | } |
685 | } |
699 | |
686 | |
700 | object::vector object::objects; // not yet used |
|
|
701 | object *object::first; |
|
|
702 | |
|
|
703 | object::object () |
687 | object::object () |
704 | { |
688 | { |
705 | SET_FLAG (this, FLAG_REMOVED); |
689 | SET_FLAG (this, FLAG_REMOVED); |
706 | |
690 | |
707 | expmul = 1.0; |
691 | expmul = 1.0; |
708 | face = blank_face; |
692 | face = blank_face; |
709 | } |
693 | } |
710 | |
694 | |
711 | object::~object () |
695 | object::~object () |
712 | { |
696 | { |
|
|
697 | unlink (); |
|
|
698 | |
713 | free_key_values (this); |
699 | free_key_values (this); |
714 | } |
700 | } |
715 | |
701 | |
|
|
702 | static int object_count; |
|
|
703 | |
716 | void object::link () |
704 | void object::link () |
717 | { |
705 | { |
718 | count = ++ob_count; |
706 | assert (!index);//D |
719 | uuid = gen_uuid (); |
707 | uuid = gen_uuid (); |
|
|
708 | count = ++object_count; |
720 | |
709 | |
721 | prev = 0; |
710 | refcnt_inc (); |
722 | next = object::first; |
711 | objects.insert (this); |
723 | |
|
|
724 | if (object::first) |
|
|
725 | object::first->prev = this; |
|
|
726 | |
|
|
727 | object::first = this; |
|
|
728 | } |
712 | } |
729 | |
713 | |
730 | void object::unlink () |
714 | void object::unlink () |
731 | { |
715 | { |
732 | if (this == object::first) |
716 | if (!index) |
733 | object::first = next; |
717 | return; |
734 | |
718 | |
735 | /* Remove this object from the list of used objects */ |
719 | objects.erase (this); |
736 | if (prev) prev->next = next; |
720 | refcnt_dec (); |
737 | if (next) next->prev = prev; |
|
|
738 | |
|
|
739 | prev = 0; |
|
|
740 | next = 0; |
|
|
741 | } |
721 | } |
742 | |
722 | |
743 | void |
723 | void |
|
|
724 | object::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 | |
|
|
734 | void |
744 | object::activate (bool recursive) |
735 | object::activate_recursive () |
745 | { |
736 | { |
746 | // uh, hack |
737 | activate (); |
747 | set_speed (speed); |
|
|
748 | |
738 | |
749 | if (recursive) |
|
|
750 | for (object *op = inv; op; op = op->above) |
739 | for (object *op = inv; op; op = op->below) |
751 | op->activate (1); |
740 | op->activate_recursive (); |
752 | } |
741 | } |
753 | |
742 | |
754 | /* This function removes object 'op' from the list of active |
743 | /* This function removes object 'op' from the list of active |
755 | * objects. |
744 | * objects. |
756 | * This should only be used for style maps or other such |
745 | * This should only be used for style maps or other such |
… | |
… | |
758 | * in play chewing up cpu time getting processed. |
747 | * in play chewing up cpu time getting processed. |
759 | * The reverse of this is to call update_ob_speed, which |
748 | * The reverse of this is to call update_ob_speed, which |
760 | * will do the right thing based on the speed of the object. |
749 | * will do the right thing based on the speed of the object. |
761 | */ |
750 | */ |
762 | void |
751 | void |
763 | object::deactivate (bool recursive) |
752 | object::deactivate () |
764 | { |
753 | { |
765 | /* If not on the active list, nothing needs to be done */ |
754 | /* If not on the active list, nothing needs to be done */ |
766 | if (!active_next && !active_prev && this != active_objects) |
755 | if (!active) |
767 | return; |
756 | return; |
768 | |
757 | |
769 | if (active_prev == 0) |
758 | actives.erase (this); |
770 | { |
759 | } |
771 | active_objects = active_next; |
|
|
772 | if (active_next) |
|
|
773 | active_next->active_prev = 0; |
|
|
774 | } |
|
|
775 | else |
|
|
776 | { |
|
|
777 | active_prev->active_next = active_next; |
|
|
778 | if (active_next) |
|
|
779 | active_next->active_prev = active_prev; |
|
|
780 | } |
|
|
781 | |
760 | |
782 | active_next = 0; |
761 | void |
783 | active_prev = 0; |
762 | object::deactivate_recursive () |
784 | |
763 | { |
785 | if (recursive) |
|
|
786 | for (object *op = inv; op; op = op->above) |
764 | for (object *op = inv; op; op = op->below) |
|
|
765 | op->deactivate_recursive (); |
|
|
766 | |
787 | op->deactivate (1); |
767 | deactivate (); |
|
|
768 | } |
|
|
769 | |
|
|
770 | void |
|
|
771 | object::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 | } |
788 | } |
778 | } |
789 | |
779 | |
790 | /* |
780 | /* |
791 | * Remove and free all objects in the inventory of the given object. |
781 | * Remove and free all objects in the inventory of the given object. |
792 | * object.c ? |
782 | * object.c ? |
… | |
… | |
807 | * drop on that space. |
797 | * drop on that space. |
808 | */ |
798 | */ |
809 | if (!drop_to_ground |
799 | if (!drop_to_ground |
810 | || !map |
800 | || !map |
811 | || map->in_memory != MAP_IN_MEMORY |
801 | || map->in_memory != MAP_IN_MEMORY |
|
|
802 | || map->nodrop |
812 | || ms ().move_block == MOVE_ALL) |
803 | || ms ().move_block == MOVE_ALL) |
813 | { |
804 | { |
814 | while (inv) |
805 | while (inv) |
815 | { |
806 | { |
816 | inv->destroy_inv (drop_to_ground); |
807 | inv->destroy_inv (drop_to_ground); |
… | |
… | |
825 | |
816 | |
826 | if (op->flag [FLAG_STARTEQUIP] |
817 | if (op->flag [FLAG_STARTEQUIP] |
827 | || op->flag [FLAG_NO_DROP] |
818 | || op->flag [FLAG_NO_DROP] |
828 | || op->type == RUNE |
819 | || op->type == RUNE |
829 | || op->type == TRAP |
820 | || op->type == TRAP |
830 | || op->flag [FLAG_IS_A_TEMPLATE]) |
821 | || op->flag [FLAG_IS_A_TEMPLATE] |
|
|
822 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
831 | op->destroy (); |
823 | op->destroy (); |
832 | else |
824 | else |
833 | map->insert (op, x, y); |
825 | map->insert (op, x, y); |
834 | } |
826 | } |
835 | } |
827 | } |
… | |
… | |
843 | } |
835 | } |
844 | |
836 | |
845 | void |
837 | void |
846 | object::do_destroy () |
838 | object::do_destroy () |
847 | { |
839 | { |
|
|
840 | attachable::do_destroy (); |
|
|
841 | |
848 | if (flag [FLAG_IS_LINKED]) |
842 | if (flag [FLAG_IS_LINKED]) |
849 | remove_button_link (this); |
843 | remove_button_link (this); |
850 | |
844 | |
851 | if (flag [FLAG_FRIENDLY]) |
845 | if (flag [FLAG_FRIENDLY]) |
852 | remove_friendly_object (this); |
846 | remove_friendly_object (this); |
853 | |
847 | |
854 | if (!flag [FLAG_REMOVED]) |
848 | if (!flag [FLAG_REMOVED]) |
855 | remove (); |
849 | remove (); |
856 | |
850 | |
857 | if (flag [FLAG_FREED]) |
851 | destroy_inv (true); |
858 | return; |
|
|
859 | |
852 | |
860 | set_speed (0); |
853 | deactivate (); |
|
|
854 | unlink (); |
861 | |
855 | |
862 | flag [FLAG_FREED] = 1; |
856 | flag [FLAG_FREED] = 1; |
863 | |
|
|
864 | attachable::do_destroy (); |
|
|
865 | |
|
|
866 | destroy_inv (true); |
|
|
867 | unlink (); |
|
|
868 | |
857 | |
869 | // hack to ensure that freed objects still have a valid map |
858 | // hack to ensure that freed objects still have a valid map |
870 | { |
859 | { |
871 | 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 |
872 | |
861 | |
… | |
… | |
877 | freed_map->name = "/internal/freed_objects_map"; |
866 | freed_map->name = "/internal/freed_objects_map"; |
878 | freed_map->width = 3; |
867 | freed_map->width = 3; |
879 | freed_map->height = 3; |
868 | freed_map->height = 3; |
880 | |
869 | |
881 | freed_map->alloc (); |
870 | freed_map->alloc (); |
|
|
871 | freed_map->in_memory = MAP_IN_MEMORY; |
882 | } |
872 | } |
883 | |
873 | |
884 | map = freed_map; |
874 | map = freed_map; |
885 | x = 1; |
875 | x = 1; |
886 | y = 1; |
876 | y = 1; |
… | |
… | |
896 | |
886 | |
897 | // clear those pointers that likely might have circular references to us |
887 | // clear those pointers that likely might have circular references to us |
898 | owner = 0; |
888 | owner = 0; |
899 | enemy = 0; |
889 | enemy = 0; |
900 | attacked_by = 0; |
890 | attacked_by = 0; |
901 | |
|
|
902 | // only relevant for players(?), but make sure of it anyways |
|
|
903 | contr = 0; |
|
|
904 | } |
891 | } |
905 | |
892 | |
906 | void |
893 | void |
907 | object::destroy (bool destroy_inventory) |
894 | object::destroy (bool destroy_inventory) |
908 | { |
895 | { |
… | |
… | |
936 | * 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 |
937 | * 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 |
938 | * object will have no environment. If the object previously had an |
925 | * object will have no environment. If the object previously had an |
939 | * environment, the x and y coordinates will be updated to |
926 | * environment, the x and y coordinates will be updated to |
940 | * the previous environment. |
927 | * the previous environment. |
941 | * Beware: This function is called from the editor as well! |
|
|
942 | */ |
928 | */ |
943 | void |
929 | void |
944 | object::remove () |
930 | object::do_remove () |
945 | { |
931 | { |
946 | object *tmp, *last = 0; |
932 | object *tmp, *last = 0; |
947 | object *otmp; |
933 | object *otmp; |
948 | |
934 | |
949 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
935 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
992 | } |
978 | } |
993 | else if (map) |
979 | else if (map) |
994 | { |
980 | { |
995 | if (type == PLAYER) |
981 | if (type == PLAYER) |
996 | { |
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 (); |
|
|
988 | |
997 | --map->players; |
989 | --map->players; |
998 | map->last_access = runtime; |
990 | map->touch (); |
999 | } |
991 | } |
1000 | |
992 | |
|
|
993 | map->dirty = true; |
|
|
994 | mapspace &ms = this->ms (); |
1001 | |
995 | |
1002 | /* link the object above us */ |
996 | /* link the object above us */ |
1003 | if (above) |
997 | if (above) |
1004 | above->below = below; |
998 | above->below = below; |
1005 | else |
999 | else |
1006 | map->at (x, y).top = below; /* we were top, set new top */ |
1000 | ms.top = below; /* we were top, set new top */ |
1007 | |
1001 | |
1008 | /* Relink the object below us, if there is one */ |
1002 | /* Relink the object below us, if there is one */ |
1009 | if (below) |
1003 | if (below) |
1010 | below->above = above; |
1004 | below->above = above; |
1011 | else |
1005 | else |
… | |
… | |
1013 | /* 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 |
1014 | * use translated coordinates in case some oddness with map tiling is |
1008 | * use translated coordinates in case some oddness with map tiling is |
1015 | * evident |
1009 | * evident |
1016 | */ |
1010 | */ |
1017 | if (GET_MAP_OB (map, x, y) != this) |
1011 | if (GET_MAP_OB (map, x, y) != this) |
1018 | { |
|
|
1019 | char *dump = dump_object (this); |
|
|
1020 | LOG (llevError, |
|
|
1021 | "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 ()); |
1022 | free (dump); |
|
|
1023 | dump = dump_object (GET_MAP_OB (map, x, y)); |
|
|
1024 | LOG (llevError, "%s\n", dump); |
|
|
1025 | free (dump); |
|
|
1026 | } |
|
|
1027 | |
1013 | |
1028 | map->at (x, y).bot = above; /* goes on above it. */ |
1014 | ms.bot = above; /* goes on above it. */ |
1029 | } |
1015 | } |
1030 | |
1016 | |
1031 | above = 0; |
1017 | above = 0; |
1032 | below = 0; |
1018 | below = 0; |
1033 | |
1019 | |
1034 | if (map->in_memory == MAP_SAVING) |
1020 | if (map->in_memory == MAP_SAVING) |
1035 | return; |
1021 | return; |
1036 | |
1022 | |
1037 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1023 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1038 | |
1024 | |
1039 | for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) |
1025 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1040 | { |
1026 | { |
1041 | /* 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 |
1042 | * being removed. |
1028 | * being removed. |
1043 | */ |
1029 | */ |
1044 | |
1030 | |
… | |
… | |
1078 | } |
1064 | } |
1079 | |
1065 | |
1080 | /* last == NULL if there are no objects on this space */ |
1066 | /* last == NULL if there are no objects on this space */ |
1081 | //TODO: this makes little sense, why only update the topmost object? |
1067 | //TODO: this makes little sense, why only update the topmost object? |
1082 | if (!last) |
1068 | if (!last) |
1083 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1069 | map->at (x, y).flags_ = 0; |
1084 | else |
1070 | else |
1085 | update_object (last, UP_OBJ_REMOVE); |
1071 | update_object (last, UP_OBJ_REMOVE); |
1086 | |
1072 | |
1087 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1073 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1088 | update_all_los (map, x, y); |
1074 | update_all_los (map, x, y); |
… | |
… | |
1124 | } |
1110 | } |
1125 | |
1111 | |
1126 | return 0; |
1112 | return 0; |
1127 | } |
1113 | } |
1128 | |
1114 | |
|
|
1115 | void |
|
|
1116 | object::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 | |
1129 | /* |
1138 | /* |
1130 | * 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 |
1131 | * job preparing multi-part monsters |
1140 | * job preparing multi-part monsters. |
1132 | */ |
1141 | */ |
1133 | object * |
1142 | object * |
1134 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1143 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1135 | { |
1144 | { |
1136 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1145 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
… | |
… | |
1163 | * just 'op' otherwise |
1172 | * just 'op' otherwise |
1164 | */ |
1173 | */ |
1165 | object * |
1174 | object * |
1166 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1175 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1167 | { |
1176 | { |
|
|
1177 | assert (!op->flag [FLAG_FREED]); |
|
|
1178 | |
1168 | object *tmp, *top, *floor = NULL; |
1179 | object *tmp, *top, *floor = NULL; |
1169 | sint16 x, y; |
|
|
1170 | |
1180 | |
1171 | if (QUERY_FLAG (op, FLAG_FREED)) |
1181 | op->remove (); |
1172 | { |
|
|
1173 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1174 | return NULL; |
|
|
1175 | } |
|
|
1176 | |
1182 | |
1177 | if (!m) |
1183 | #if 0 |
1178 | { |
1184 | if (!m->active != !op->active) |
1179 | char *dump = dump_object (op); |
1185 | if (m->active) |
1180 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1186 | op->activate_recursive (); |
1181 | free (dump); |
1187 | else |
1182 | return op; |
1188 | op->deactivate_recursive (); |
1183 | } |
1189 | #endif |
1184 | |
1190 | |
1185 | if (out_of_map (m, op->x, op->y)) |
1191 | if (out_of_map (m, op->x, op->y)) |
1186 | { |
1192 | { |
1187 | char *dump = dump_object (op); |
|
|
1188 | 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 ()); |
1189 | #ifdef MANY_CORES |
1194 | #ifdef MANY_CORES |
1190 | /* 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 |
1191 | * 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 |
1192 | * improperly inserted. |
1197 | * improperly inserted. |
1193 | */ |
1198 | */ |
1194 | abort (); |
1199 | abort (); |
1195 | #endif |
1200 | #endif |
1196 | free (dump); |
|
|
1197 | return op; |
1201 | return op; |
1198 | } |
1202 | } |
1199 | |
1203 | |
1200 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1201 | { |
|
|
1202 | char *dump = dump_object (op); |
|
|
1203 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1204 | free (dump); |
|
|
1205 | return op; |
|
|
1206 | } |
|
|
1207 | |
|
|
1208 | if (op->more) |
|
|
1209 | { |
|
|
1210 | /* The part may be on a different map. */ |
|
|
1211 | |
|
|
1212 | object *more = op->more; |
1204 | if (object *more = op->more) |
1213 | |
1205 | { |
1214 | /* We really need the caller to normalize coordinates - if |
|
|
1215 | * we set the map, that doesn't work if the location is within |
|
|
1216 | * a map and this is straddling an edge. So only if coordinate |
|
|
1217 | * is clear wrong do we normalize it. |
|
|
1218 | */ |
|
|
1219 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1220 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1221 | else if (!more->map) |
|
|
1222 | { |
|
|
1223 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1224 | * more->map should always point to the parent. |
|
|
1225 | */ |
|
|
1226 | more->map = m; |
|
|
1227 | } |
|
|
1228 | |
|
|
1229 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
1206 | if (!insert_ob_in_map (more, m, originator, flag)) |
1230 | { |
1207 | { |
1231 | if (!op->head) |
1208 | if (!op->head) |
1232 | 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"); |
1233 | |
1210 | |
1234 | return 0; |
1211 | return 0; |
… | |
… | |
1239 | |
1216 | |
1240 | /* Ideally, the caller figures this out. However, it complicates a lot |
1217 | /* Ideally, the caller figures this out. However, it complicates a lot |
1241 | * 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 |
1242 | * need extra work |
1219 | * need extra work |
1243 | */ |
1220 | */ |
1244 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1221 | if (!xy_normalise (m, op->x, op->y)) |
1245 | x = op->x; |
1222 | return 0; |
1246 | y = op->y; |
1223 | |
|
|
1224 | op->map = m; |
|
|
1225 | mapspace &ms = op->ms (); |
1247 | |
1226 | |
1248 | /* this has to be done after we translate the coordinates. |
1227 | /* this has to be done after we translate the coordinates. |
1249 | */ |
1228 | */ |
1250 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1229 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1251 | for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) |
1230 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1252 | if (object::can_merge (op, tmp)) |
1231 | if (object::can_merge (op, tmp)) |
1253 | { |
1232 | { |
1254 | op->nrof += tmp->nrof; |
1233 | op->nrof += tmp->nrof; |
1255 | tmp->destroy (); |
1234 | tmp->destroy (); |
1256 | } |
1235 | } |
… | |
… | |
1273 | op->below = originator->below; |
1252 | op->below = originator->below; |
1274 | |
1253 | |
1275 | if (op->below) |
1254 | if (op->below) |
1276 | op->below->above = op; |
1255 | op->below->above = op; |
1277 | else |
1256 | else |
1278 | op->ms ().bot = op; |
1257 | ms.bot = op; |
1279 | |
1258 | |
1280 | /* since *below* originator, no need to update top */ |
1259 | /* since *below* originator, no need to update top */ |
1281 | originator->below = op; |
1260 | originator->below = op; |
1282 | } |
1261 | } |
1283 | else |
1262 | else |
1284 | { |
1263 | { |
|
|
1264 | top = ms.bot; |
|
|
1265 | |
1285 | /* If there are other objects, then */ |
1266 | /* If there are other objects, then */ |
1286 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1267 | if ((!(flag & INS_MAP_LOAD)) && top) |
1287 | { |
1268 | { |
1288 | object *last = 0; |
1269 | object *last = 0; |
1289 | |
1270 | |
1290 | /* |
1271 | /* |
1291 | * 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. |
… | |
… | |
1297 | * 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 |
1298 | * 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 |
1299 | * 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 |
1300 | * that flying non pickable objects are spell objects. |
1281 | * that flying non pickable objects are spell objects. |
1301 | */ |
1282 | */ |
1302 | while (top) |
1283 | for (top = ms.bot; top; top = top->above) |
1303 | { |
1284 | { |
1304 | 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)) |
1305 | floor = top; |
1286 | floor = top; |
1306 | |
1287 | |
1307 | 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)) |
… | |
… | |
1310 | top = top->below; |
1291 | top = top->below; |
1311 | break; |
1292 | break; |
1312 | } |
1293 | } |
1313 | |
1294 | |
1314 | last = top; |
1295 | last = top; |
1315 | top = top->above; |
|
|
1316 | } |
1296 | } |
1317 | |
1297 | |
1318 | /* 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 */ |
1319 | top = last; |
1299 | top = last; |
1320 | |
1300 | |
… | |
… | |
1322 | * looks like instead of lots of conditions here. |
1302 | * looks like instead of lots of conditions here. |
1323 | * makes things faster, and effectively the same result. |
1303 | * makes things faster, and effectively the same result. |
1324 | */ |
1304 | */ |
1325 | |
1305 | |
1326 | /* Have object 'fall below' other objects that block view. |
1306 | /* Have object 'fall below' other objects that block view. |
1327 | * Unless those objects are exits, type 66 |
1307 | * Unless those objects are exits. |
1328 | * If INS_ON_TOP is used, don't do this processing |
1308 | * If INS_ON_TOP is used, don't do this processing |
1329 | * Need to find the object that in fact blocks view, otherwise |
1309 | * Need to find the object that in fact blocks view, otherwise |
1330 | * stacking is a bit odd. |
1310 | * stacking is a bit odd. |
1331 | */ |
1311 | */ |
1332 | if (!(flag & INS_ON_TOP) && |
1312 | if (!(flag & INS_ON_TOP) |
1333 | (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1313 | && ms.flags () & P_BLOCKSVIEW |
|
|
1314 | && (op->face && !faces [op->face].visibility)) |
1334 | { |
1315 | { |
1335 | for (last = top; last != floor; last = last->below) |
1316 | for (last = top; last != floor; last = last->below) |
1336 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1317 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1337 | break; |
1318 | break; |
|
|
1319 | |
1338 | /* Check to see if we found the object that blocks view, |
1320 | /* Check to see if we found the object that blocks view, |
1339 | * 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 |
1340 | * we can get inserted below this one, which requires we |
1322 | * we can get inserted below this one, which requires we |
1341 | * set top to the object below us. |
1323 | * set top to the object below us. |
1342 | */ |
1324 | */ |
… | |
… | |
1344 | top = last->below; |
1326 | top = last->below; |
1345 | } |
1327 | } |
1346 | } /* If objects on this space */ |
1328 | } /* If objects on this space */ |
1347 | |
1329 | |
1348 | if (flag & INS_MAP_LOAD) |
1330 | if (flag & INS_MAP_LOAD) |
1349 | top = GET_MAP_TOP (op->map, op->x, op->y); |
1331 | top = ms.top; |
1350 | |
1332 | |
1351 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1333 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1352 | top = floor; |
1334 | top = floor; |
1353 | |
1335 | |
1354 | /* 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. |
1355 | */ |
1337 | */ |
1356 | |
1338 | |
1357 | /* First object on this space */ |
1339 | /* First object on this space */ |
1358 | if (!top) |
1340 | if (!top) |
1359 | { |
1341 | { |
1360 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1342 | op->above = ms.bot; |
1361 | |
1343 | |
1362 | if (op->above) |
1344 | if (op->above) |
1363 | op->above->below = op; |
1345 | op->above->below = op; |
1364 | |
1346 | |
1365 | op->below = 0; |
1347 | op->below = 0; |
1366 | op->ms ().bot = op; |
1348 | ms.bot = op; |
1367 | } |
1349 | } |
1368 | else |
1350 | else |
1369 | { /* get inserted into the stack above top */ |
1351 | { /* get inserted into the stack above top */ |
1370 | op->above = top->above; |
1352 | op->above = top->above; |
1371 | |
1353 | |
… | |
… | |
1375 | op->below = top; |
1357 | op->below = top; |
1376 | top->above = op; |
1358 | top->above = op; |
1377 | } |
1359 | } |
1378 | |
1360 | |
1379 | if (!op->above) |
1361 | if (!op->above) |
1380 | op->ms ().top = op; |
1362 | ms.top = op; |
1381 | } /* else not INS_BELOW_ORIGINATOR */ |
1363 | } /* else not INS_BELOW_ORIGINATOR */ |
1382 | |
1364 | |
1383 | if (op->type == PLAYER) |
1365 | if (op->type == PLAYER) |
1384 | { |
1366 | { |
1385 | op->contr->do_los = 1; |
1367 | op->contr->do_los = 1; |
1386 | ++op->map->players; |
1368 | ++op->map->players; |
1387 | op->map->last_access = runtime; |
1369 | op->map->touch (); |
1388 | } |
1370 | } |
|
|
1371 | |
|
|
1372 | op->map->dirty = true; |
1389 | |
1373 | |
1390 | /* 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 |
1391 | * it, so save a few ticks and start from there. |
1375 | * it, so save a few ticks and start from there. |
1392 | */ |
1376 | */ |
1393 | if (!(flag & INS_MAP_LOAD)) |
1377 | if (!(flag & INS_MAP_LOAD)) |
1394 | if (object *pl = op->ms ().player ()) |
1378 | if (object *pl = ms.player ()) |
1395 | if (pl->contr->ns) |
1379 | if (pl->contr->ns) |
1396 | pl->contr->ns->floorbox_update (); |
1380 | pl->contr->ns->floorbox_update (); |
1397 | |
1381 | |
1398 | /* If this object glows, it may affect lighting conditions that are |
1382 | /* If this object glows, it may affect lighting conditions that are |
1399 | * 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 |
1400 | * 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 |
1401 | * on the map will get recalculated. The players could very well |
1385 | * on the map will get recalculated. The players could very well |
1402 | * 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 - |
1403 | * this should get redone to only look for players within range, |
1387 | * this should get redone to only look for players within range, |
1404 | * or just updating the P_NEED_UPDATE for spaces within this area |
1388 | * or just updating the P_UPTODATE for spaces within this area |
1405 | * of effect may be sufficient. |
1389 | * of effect may be sufficient. |
1406 | */ |
1390 | */ |
1407 | if (op->map->darkness && (op->glow_radius != 0)) |
1391 | if (op->map->darkness && (op->glow_radius != 0)) |
1408 | update_all_los (op->map, op->x, op->y); |
1392 | update_all_los (op->map, op->x, op->y); |
1409 | |
1393 | |
… | |
… | |
1447 | { |
1431 | { |
1448 | object *tmp, *tmp1; |
1432 | object *tmp, *tmp1; |
1449 | |
1433 | |
1450 | /* first search for itself and remove any old instances */ |
1434 | /* first search for itself and remove any old instances */ |
1451 | |
1435 | |
1452 | 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) |
1453 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1437 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1454 | tmp->destroy (); |
1438 | tmp->destroy (); |
1455 | |
1439 | |
1456 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1440 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1457 | |
1441 | |
… | |
… | |
1461 | } |
1445 | } |
1462 | |
1446 | |
1463 | object * |
1447 | object * |
1464 | object::insert_at (object *where, object *originator, int flags) |
1448 | object::insert_at (object *where, object *originator, int flags) |
1465 | { |
1449 | { |
1466 | where->map->insert (this, where->x, where->y, originator, flags); |
1450 | return where->map->insert (this, where->x, where->y, originator, flags); |
1467 | } |
1451 | } |
1468 | |
1452 | |
1469 | /* |
1453 | /* |
1470 | * 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 |
1471 | * is returned contains nr objects, and the remaining parts contains |
1455 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1511 | * 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 |
1512 | * is subsequently removed and freed. |
1496 | * is subsequently removed and freed. |
1513 | * |
1497 | * |
1514 | * 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 |
1515 | */ |
1499 | */ |
1516 | |
|
|
1517 | object * |
1500 | object * |
1518 | decrease_ob_nr (object *op, uint32 i) |
1501 | decrease_ob_nr (object *op, uint32 i) |
1519 | { |
1502 | { |
1520 | object *tmp; |
1503 | object *tmp; |
1521 | |
1504 | |
… | |
… | |
1596 | |
1579 | |
1597 | /* |
1580 | /* |
1598 | * add_weight(object, weight) adds the specified weight to an object, |
1581 | * add_weight(object, weight) adds the specified weight to an object, |
1599 | * and also updates how much the environment(s) is/are carrying. |
1582 | * and also updates how much the environment(s) is/are carrying. |
1600 | */ |
1583 | */ |
1601 | |
|
|
1602 | void |
1584 | void |
1603 | add_weight (object *op, signed long weight) |
1585 | add_weight (object *op, signed long weight) |
1604 | { |
1586 | { |
1605 | while (op != NULL) |
1587 | while (op != NULL) |
1606 | { |
1588 | { |
… | |
… | |
1638 | * inside the object environment. |
1620 | * inside the object environment. |
1639 | * |
1621 | * |
1640 | * The function returns now pointer to inserted item, and return value can |
1622 | * The function returns now pointer to inserted item, and return value can |
1641 | * be != op, if items are merged. -Tero |
1623 | * be != op, if items are merged. -Tero |
1642 | */ |
1624 | */ |
1643 | |
|
|
1644 | object * |
1625 | object * |
1645 | object::insert (object *op) |
1626 | object::insert (object *op) |
1646 | { |
1627 | { |
1647 | object *tmp, *otmp; |
1628 | object *tmp, *otmp; |
1648 | |
1629 | |
… | |
… | |
1780 | |
1761 | |
1781 | /* The objects have to be checked from top to bottom. |
1762 | /* The objects have to be checked from top to bottom. |
1782 | * Hence, we first go to the top: |
1763 | * Hence, we first go to the top: |
1783 | */ |
1764 | */ |
1784 | |
1765 | |
1785 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above) |
1766 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1786 | { |
1767 | { |
1787 | /* Trim the search when we find the first other spell effect |
1768 | /* Trim the search when we find the first other spell effect |
1788 | * 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, |
1789 | * we don't need to check all of them. |
1770 | * we don't need to check all of them. |
1790 | */ |
1771 | */ |
… | |
… | |
1808 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1789 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1809 | ((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)) |
1810 | { |
1791 | { |
1811 | |
1792 | |
1812 | float |
1793 | float |
1813 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1794 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1814 | |
1795 | |
1815 | if (op->type == PLAYER) |
1796 | if (op->type == PLAYER) |
1816 | 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)) || |
1817 | (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))) |
1818 | diff /= 4.0; |
1799 | diff /= 4.0; |
… | |
… | |
1848 | * The first matching object is returned, or NULL if none. |
1829 | * The first matching object is returned, or NULL if none. |
1849 | */ |
1830 | */ |
1850 | object * |
1831 | object * |
1851 | present_arch (const archetype *at, maptile *m, int x, int y) |
1832 | present_arch (const archetype *at, maptile *m, int x, int y) |
1852 | { |
1833 | { |
1853 | if (m == NULL || out_of_map (m, x, y)) |
1834 | if (!m || out_of_map (m, x, y)) |
1854 | { |
1835 | { |
1855 | LOG (llevError, "Present_arch called outside map.\n"); |
1836 | LOG (llevError, "Present_arch called outside map.\n"); |
1856 | return NULL; |
1837 | return NULL; |
1857 | } |
1838 | } |
1858 | |
1839 | |
1859 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1840 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1860 | if (tmp->arch == at) |
1841 | if (tmp->arch == at) |
1861 | return tmp; |
1842 | return tmp; |
1862 | |
1843 | |
1863 | return NULL; |
1844 | return NULL; |
1864 | } |
1845 | } |
… | |
… | |
1875 | { |
1856 | { |
1876 | LOG (llevError, "Present called outside map.\n"); |
1857 | LOG (llevError, "Present called outside map.\n"); |
1877 | return NULL; |
1858 | return NULL; |
1878 | } |
1859 | } |
1879 | |
1860 | |
1880 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1861 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1881 | if (tmp->type == type) |
1862 | if (tmp->type == type) |
1882 | return tmp; |
1863 | return tmp; |
1883 | |
1864 | |
1884 | return NULL; |
1865 | return NULL; |
1885 | } |
1866 | } |
… | |
… | |
2025 | } |
2006 | } |
2026 | |
2007 | |
2027 | if (!index) |
2008 | if (!index) |
2028 | return -1; |
2009 | return -1; |
2029 | |
2010 | |
2030 | return altern[RANDOM () % index]; |
2011 | return altern [rndm (index)]; |
2031 | } |
2012 | } |
2032 | |
2013 | |
2033 | /* |
2014 | /* |
2034 | * find_first_free_spot(archetype, maptile, x, y) works like |
2015 | * find_first_free_spot(archetype, maptile, x, y) works like |
2035 | * find_free_spot(), but it will search max number of squares. |
2016 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
2056 | { |
2037 | { |
2057 | arr += begin; |
2038 | arr += begin; |
2058 | end -= begin; |
2039 | end -= begin; |
2059 | |
2040 | |
2060 | while (--end) |
2041 | while (--end) |
2061 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2042 | swap (arr [end], arr [rndm (end + 1)]); |
2062 | } |
2043 | } |
2063 | |
2044 | |
2064 | /* new function to make monster searching more efficient, and effective! |
2045 | /* new function to make monster searching more efficient, and effective! |
2065 | * This basically returns a randomized array (in the passed pointer) of |
2046 | * This basically returns a randomized array (in the passed pointer) of |
2066 | * 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 |
… | |
… | |
2200 | |
2181 | |
2201 | return 3; |
2182 | return 3; |
2202 | } |
2183 | } |
2203 | |
2184 | |
2204 | /* |
2185 | /* |
2205 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2206 | * the "absolute" direction of a number (it actually takes care of |
|
|
2207 | * "overflow" in previous calculations of a direction). |
|
|
2208 | */ |
|
|
2209 | |
|
|
2210 | int |
|
|
2211 | absdir (int d) |
|
|
2212 | { |
|
|
2213 | while (d < 1) |
|
|
2214 | d += 8; |
|
|
2215 | |
|
|
2216 | while (d > 8) |
|
|
2217 | d -= 8; |
|
|
2218 | |
|
|
2219 | return d; |
|
|
2220 | } |
|
|
2221 | |
|
|
2222 | /* |
|
|
2223 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2186 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2224 | * between two directions (which are expected to be absolute (see absdir()) |
2187 | * between two directions (which are expected to be absolute (see absdir()) |
2225 | */ |
2188 | */ |
2226 | |
|
|
2227 | int |
2189 | int |
2228 | dirdiff (int dir1, int dir2) |
2190 | dirdiff (int dir1, int dir2) |
2229 | { |
2191 | { |
2230 | int d; |
2192 | int d; |
2231 | |
2193 | |
… | |
… | |
2397 | insert_ob_in_ob (object_create_clone (item), dst); |
2359 | insert_ob_in_ob (object_create_clone (item), dst); |
2398 | |
2360 | |
2399 | return dst; |
2361 | return dst; |
2400 | } |
2362 | } |
2401 | |
2363 | |
2402 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2403 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2404 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2405 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2406 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2407 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2408 | object * |
|
|
2409 | load_object_str (const char *obstr) |
|
|
2410 | { |
|
|
2411 | object *op; |
|
|
2412 | char filename[MAX_BUF]; |
|
|
2413 | |
|
|
2414 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2415 | |
|
|
2416 | FILE *tempfile = fopen (filename, "w"); |
|
|
2417 | |
|
|
2418 | if (tempfile == NULL) |
|
|
2419 | { |
|
|
2420 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2421 | return NULL; |
|
|
2422 | } |
|
|
2423 | |
|
|
2424 | fprintf (tempfile, obstr); |
|
|
2425 | fclose (tempfile); |
|
|
2426 | |
|
|
2427 | op = object::create (); |
|
|
2428 | |
|
|
2429 | object_thawer thawer (filename); |
|
|
2430 | |
|
|
2431 | if (thawer) |
|
|
2432 | load_object (thawer, op, 0); |
|
|
2433 | |
|
|
2434 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2435 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2436 | |
|
|
2437 | return op; |
|
|
2438 | } |
|
|
2439 | |
|
|
2440 | /* This returns the first object in who's inventory that |
2364 | /* This returns the first object in who's inventory that |
2441 | * has the same type and subtype match. |
2365 | * has the same type and subtype match. |
2442 | * returns NULL if no match. |
2366 | * returns NULL if no match. |
2443 | */ |
2367 | */ |
2444 | object * |
2368 | object * |
… | |
… | |
2497 | if (link->key == canonical_key) |
2421 | if (link->key == canonical_key) |
2498 | return link->value; |
2422 | return link->value; |
2499 | |
2423 | |
2500 | return 0; |
2424 | return 0; |
2501 | } |
2425 | } |
2502 | |
|
|
2503 | |
2426 | |
2504 | /* |
2427 | /* |
2505 | * Updates the canonical_key in op to value. |
2428 | * Updates the canonical_key in op to value. |
2506 | * |
2429 | * |
2507 | * 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). |
… | |
… | |
2610 | } |
2533 | } |
2611 | else |
2534 | else |
2612 | item = item->env; |
2535 | item = item->env; |
2613 | } |
2536 | } |
2614 | |
2537 | |
|
|
2538 | |
|
|
2539 | const char * |
|
|
2540 | object::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 | |
2615 | // 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 |
2616 | const char * |
2568 | const char * |
2617 | object::debug_desc (char *info) const |
2569 | object::debug_desc (char *info) const |
2618 | { |
2570 | { |
|
|
2571 | char flagdesc[512]; |
2619 | char info2[256 * 3]; |
2572 | char info2[256 * 4]; |
2620 | char *p = info; |
2573 | char *p = info; |
2621 | |
2574 | |
2622 | 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}", |
2623 | count, |
2576 | count, uuid.seq, |
2624 | &name, |
2577 | &name, |
2625 | title ? " " : "", |
2578 | title ? "\",title:\"" : "", |
2626 | title ? (const char *)title : ""); |
2579 | title ? (const char *)title : "", |
|
|
2580 | flag_desc (flagdesc, 512), type); |
2627 | |
2581 | |
2628 | if (env) |
2582 | if (env) |
2629 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2583 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2630 | |
2584 | |
2631 | if (map) |
2585 | if (map) |
… | |
… | |
2635 | } |
2589 | } |
2636 | |
2590 | |
2637 | const char * |
2591 | const char * |
2638 | object::debug_desc () const |
2592 | object::debug_desc () const |
2639 | { |
2593 | { |
2640 | static char info[256 * 3]; |
2594 | static char info[256 * 4]; |
2641 | return debug_desc (info); |
2595 | return debug_desc (info); |
2642 | } |
2596 | } |
2643 | |
2597 | |
|
|
2598 | const char * |
|
|
2599 | object::debug_desc2 () const |
|
|
2600 | { |
|
|
2601 | static char info[256 * 4]; |
|
|
2602 | return debug_desc (info); |
|
|
2603 | } |
|
|
2604 | |
|
|
2605 | struct region * |
|
|
2606 | object::region () const |
|
|
2607 | { |
|
|
2608 | return map ? map->region (x, y) |
|
|
2609 | : region::default_region (); |
|
|
2610 | } |
|
|
2611 | |
|
|
2612 | const materialtype_t * |
|
|
2613 | object::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 | |
|
|
2624 | void |
|
|
2625 | object::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 | |