1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | |
3 | * |
4 | Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | |
7 | * |
8 | This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | 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 |
10 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | (at your option) any later version. |
11 | * (at your option) any later version. |
12 | |
12 | * |
13 | 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, |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | |
17 | * |
18 | 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 |
19 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
21 | |
|
|
22 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
26 | sub/add_weight will transcend the environment updating the carrying |
25 | sub/add_weight will transcend the environment updating the carrying |
27 | variable. */ |
26 | variable. */ |
28 | #include <global.h> |
27 | #include <global.h> |
29 | #include <stdio.h> |
28 | #include <stdio.h> |
30 | #include <sys/types.h> |
29 | #include <sys/types.h> |
31 | #include <sys/uio.h> |
30 | #include <sys/uio.h> |
32 | #include <object.h> |
31 | #include <object.h> |
33 | #include <funcpoint.h> |
32 | #include <funcpoint.h> |
|
|
33 | #include <sproto.h> |
34 | #include <loader.h> |
34 | #include <loader.h> |
35 | |
35 | |
36 | #include <bitset> |
36 | #include <bitset> |
37 | |
37 | |
38 | int nrofallocobjects = 0; |
38 | int nrofallocobjects = 0; |
… | |
… | |
299 | return 0; |
299 | return 0; |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
301 | return 0; |
301 | return 0; |
302 | } |
302 | } |
303 | |
303 | |
304 | //TODO: generate an event or call into perl for additional checks |
|
|
305 | if (ob1->self || ob2->self) |
304 | if (ob1->self || ob2->self) |
306 | { |
305 | { |
307 | ob1->optimise (); |
306 | ob1->optimise (); |
308 | ob2->optimise (); |
307 | ob2->optimise (); |
309 | |
308 | |
310 | if (ob1->self || ob2->self) |
309 | if (ob1->self || ob2->self) |
|
|
310 | if (!cfperl_can_merge (ob1, ob2)) |
311 | return 0; |
311 | return 0; |
312 | } |
312 | } |
313 | |
313 | |
314 | /* Everything passes, must be OK. */ |
314 | /* Everything passes, must be OK. */ |
315 | return 1; |
315 | return 1; |
316 | } |
316 | } |
… | |
… | |
324 | sum_weight (object *op) |
324 | sum_weight (object *op) |
325 | { |
325 | { |
326 | long sum; |
326 | long sum; |
327 | object *inv; |
327 | object *inv; |
328 | |
328 | |
329 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
329 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
330 | { |
330 | { |
331 | if (inv->inv) |
331 | if (inv->inv) |
332 | sum_weight (inv); |
332 | sum_weight (inv); |
|
|
333 | |
333 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
334 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
334 | } |
335 | } |
335 | |
336 | |
336 | if (op->type == CONTAINER && op->stats.Str) |
337 | if (op->type == CONTAINER && op->stats.Str) |
337 | sum = (sum * (100 - op->stats.Str)) / 100; |
338 | sum = (sum * (100 - op->stats.Str)) / 100; |
… | |
… | |
357 | /* |
358 | /* |
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
359 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
359 | * Some error messages. |
360 | * Some error messages. |
360 | * The result of the dump is stored in the static global errmsg array. |
361 | * The result of the dump is stored in the static global errmsg array. |
361 | */ |
362 | */ |
362 | |
|
|
363 | char * |
363 | char * |
364 | dump_object (object *op) |
364 | dump_object (object *op) |
365 | { |
365 | { |
366 | if (!op) |
366 | if (!op) |
367 | return strdup ("[NULLOBJ]"); |
367 | return strdup ("[NULLOBJ]"); |
368 | |
368 | |
369 | object_freezer freezer; |
369 | object_freezer freezer; |
370 | save_object (freezer, op, 1); |
370 | op->write (freezer); |
371 | return freezer.as_string (); |
371 | return freezer.as_string (); |
372 | } |
372 | } |
373 | |
373 | |
374 | /* |
374 | /* |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
449 | owner = owner->owner; |
449 | owner = owner->owner; |
450 | |
450 | |
451 | this->owner = owner; |
451 | this->owner = owner; |
452 | } |
452 | } |
453 | |
453 | |
|
|
454 | int |
|
|
455 | object::slottype () const |
|
|
456 | { |
|
|
457 | if (type == SKILL) |
|
|
458 | { |
|
|
459 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
460 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
461 | } |
|
|
462 | else |
|
|
463 | { |
|
|
464 | if (slot [body_combat].info) return slot_combat; |
|
|
465 | if (slot [body_range ].info) return slot_ranged; |
|
|
466 | } |
|
|
467 | |
|
|
468 | return slot_none; |
|
|
469 | } |
|
|
470 | |
|
|
471 | bool |
|
|
472 | object::change_weapon (object *ob) |
|
|
473 | { |
|
|
474 | if (current_weapon == ob) |
|
|
475 | return true; |
|
|
476 | |
|
|
477 | if (chosen_skill) |
|
|
478 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
479 | |
|
|
480 | current_weapon = ob; |
|
|
481 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
482 | |
|
|
483 | if (chosen_skill) |
|
|
484 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
485 | |
|
|
486 | update_stats (); |
|
|
487 | |
|
|
488 | if (ob) |
|
|
489 | { |
|
|
490 | // now check wether any body locations became invalid, in which case |
|
|
491 | // we cannot apply the weapon at the moment. |
|
|
492 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
493 | if (slot[i].used < 0) |
|
|
494 | { |
|
|
495 | current_weapon = chosen_skill = 0; |
|
|
496 | update_stats (); |
|
|
497 | |
|
|
498 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
499 | "You try to balance all your items at once, " |
|
|
500 | "but the %s is just too much for your body. " |
|
|
501 | "[You need to unapply some items first.]", &ob->name); |
|
|
502 | return false; |
|
|
503 | } |
|
|
504 | |
|
|
505 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
506 | } |
|
|
507 | else |
|
|
508 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
509 | |
|
|
510 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
511 | { |
|
|
512 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
513 | &name, ob->debug_desc ()); |
|
|
514 | return false; |
|
|
515 | } |
|
|
516 | |
|
|
517 | return true; |
|
|
518 | } |
|
|
519 | |
454 | /* Zero the key_values on op, decrementing the shared-string |
520 | /* Zero the key_values on op, decrementing the shared-string |
455 | * refcounts and freeing the links. |
521 | * refcounts and freeing the links. |
456 | */ |
522 | */ |
457 | static void |
523 | static void |
458 | free_key_values (object *op) |
524 | free_key_values (object *op) |
459 | { |
525 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
526 | for (key_value *i = op->key_values; i; ) |
461 | { |
527 | { |
462 | key_value *next = i->next; |
528 | key_value *next = i->next; |
463 | delete i; |
529 | delete i; |
464 | |
530 | |
465 | i = next; |
531 | i = next; |
466 | } |
532 | } |
467 | |
533 | |
468 | op->key_values = 0; |
534 | op->key_values = 0; |
469 | } |
535 | } |
470 | |
536 | |
471 | /* |
537 | object & |
472 | * copy_to first frees everything allocated by the dst object, |
538 | 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 | { |
539 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
540 | bool is_freed = flag [FLAG_FREED]; |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
541 | bool is_removed = flag [FLAG_REMOVED]; |
484 | |
542 | |
485 | *(object_copy *)dst = *this; |
543 | *(object_copy *)this = src; |
486 | |
544 | |
487 | if (is_freed) |
545 | flag [FLAG_FREED] = is_freed; |
488 | SET_FLAG (dst, FLAG_FREED); |
546 | 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 | |
547 | |
496 | /* Copy over key_values, if any. */ |
548 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
549 | if (src.key_values) |
498 | { |
550 | { |
499 | key_value *tail = 0; |
551 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
552 | key_values = 0; |
503 | |
553 | |
504 | for (i = key_values; i; i = i->next) |
554 | for (key_value *i = src.key_values; i; i = i->next) |
505 | { |
555 | { |
506 | key_value *new_link = new key_value; |
556 | key_value *new_link = new key_value; |
507 | |
557 | |
508 | new_link->next = 0; |
558 | new_link->next = 0; |
509 | new_link->key = i->key; |
559 | new_link->key = i->key; |
510 | new_link->value = i->value; |
560 | new_link->value = i->value; |
511 | |
561 | |
512 | /* Try and be clever here, too. */ |
562 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
563 | if (!key_values) |
514 | { |
564 | { |
515 | dst->key_values = new_link; |
565 | key_values = new_link; |
516 | tail = new_link; |
566 | tail = new_link; |
517 | } |
567 | } |
518 | else |
568 | else |
519 | { |
569 | { |
520 | tail->next = new_link; |
570 | tail->next = new_link; |
521 | tail = new_link; |
571 | tail = new_link; |
522 | } |
572 | } |
523 | } |
573 | } |
524 | } |
574 | } |
|
|
575 | } |
|
|
576 | |
|
|
577 | /* |
|
|
578 | * copy_to first frees everything allocated by the dst object, |
|
|
579 | * and then copies the contents of itself into the second |
|
|
580 | * object, allocating what needs to be allocated. Basically, any |
|
|
581 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
582 | * if the first object is freed, the pointers in the new object |
|
|
583 | * will point at garbage. |
|
|
584 | */ |
|
|
585 | void |
|
|
586 | object::copy_to (object *dst) |
|
|
587 | { |
|
|
588 | *dst = *this; |
|
|
589 | |
|
|
590 | if (speed < 0) |
|
|
591 | dst->speed_left = speed_left - rndm (); |
525 | |
592 | |
526 | dst->set_speed (dst->speed); |
593 | dst->set_speed (dst->speed); |
|
|
594 | } |
|
|
595 | |
|
|
596 | void |
|
|
597 | object::instantiate () |
|
|
598 | { |
|
|
599 | if (!uuid.seq) // HACK |
|
|
600 | uuid = gen_uuid (); |
|
|
601 | |
|
|
602 | speed_left = -0.1f; |
|
|
603 | /* copy the body_info to the body_used - this is only really |
|
|
604 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
605 | * by doing so, when a monster is created, it has good starting |
|
|
606 | * values for the body_used info, so when items are created |
|
|
607 | * for it, they can be properly equipped. |
|
|
608 | */ |
|
|
609 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
610 | slot[i].used = slot[i].info; |
|
|
611 | |
|
|
612 | attachable::instantiate (); |
527 | } |
613 | } |
528 | |
614 | |
529 | object * |
615 | object * |
530 | object::clone () |
616 | object::clone () |
531 | { |
617 | { |
… | |
… | |
589 | * UP_OBJ_FACE: only the objects face has changed. |
675 | * UP_OBJ_FACE: only the objects face has changed. |
590 | */ |
676 | */ |
591 | void |
677 | void |
592 | update_object (object *op, int action) |
678 | update_object (object *op, int action) |
593 | { |
679 | { |
594 | MoveType move_on, move_off, move_block, move_slow; |
|
|
595 | |
|
|
596 | if (op == NULL) |
680 | if (op == NULL) |
597 | { |
681 | { |
598 | /* this should never happen */ |
682 | /* this should never happen */ |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
683 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
600 | return; |
684 | return; |
… | |
… | |
670 | face = blank_face; |
754 | face = blank_face; |
671 | } |
755 | } |
672 | |
756 | |
673 | object::~object () |
757 | object::~object () |
674 | { |
758 | { |
|
|
759 | unlink (); |
|
|
760 | |
675 | free_key_values (this); |
761 | free_key_values (this); |
676 | } |
762 | } |
677 | |
763 | |
678 | static int object_count; |
764 | static int object_count; |
679 | |
765 | |
… | |
… | |
687 | objects.insert (this); |
773 | objects.insert (this); |
688 | } |
774 | } |
689 | |
775 | |
690 | void object::unlink () |
776 | void object::unlink () |
691 | { |
777 | { |
692 | assert (index);//D |
778 | if (!index) |
|
|
779 | return; |
|
|
780 | |
693 | objects.erase (this); |
781 | objects.erase (this); |
694 | refcnt_dec (); |
782 | refcnt_dec (); |
695 | } |
783 | } |
696 | |
784 | |
697 | void |
785 | void |
… | |
… | |
771 | * drop on that space. |
859 | * drop on that space. |
772 | */ |
860 | */ |
773 | if (!drop_to_ground |
861 | if (!drop_to_ground |
774 | || !map |
862 | || !map |
775 | || map->in_memory != MAP_IN_MEMORY |
863 | || map->in_memory != MAP_IN_MEMORY |
|
|
864 | || map->nodrop |
776 | || ms ().move_block == MOVE_ALL) |
865 | || ms ().move_block == MOVE_ALL) |
777 | { |
866 | { |
778 | while (inv) |
867 | while (inv) |
779 | { |
868 | { |
780 | inv->destroy_inv (drop_to_ground); |
869 | inv->destroy_inv (drop_to_ground); |
… | |
… | |
847 | map = freed_map; |
936 | map = freed_map; |
848 | x = 1; |
937 | x = 1; |
849 | y = 1; |
938 | y = 1; |
850 | } |
939 | } |
851 | |
940 | |
852 | head = 0; |
|
|
853 | |
|
|
854 | if (more) |
941 | if (more) |
855 | { |
942 | { |
856 | more->destroy (); |
943 | more->destroy (); |
857 | more = 0; |
944 | more = 0; |
858 | } |
945 | } |
859 | |
946 | |
|
|
947 | head = 0; |
|
|
948 | |
860 | // clear those pointers that likely might have circular references to us |
949 | // clear those pointers that likely might cause circular references |
861 | owner = 0; |
950 | owner = 0; |
862 | enemy = 0; |
951 | enemy = 0; |
863 | attacked_by = 0; |
952 | attacked_by = 0; |
|
|
953 | current_weapon = 0; |
864 | } |
954 | } |
865 | |
955 | |
866 | void |
956 | void |
867 | object::destroy (bool destroy_inventory) |
957 | object::destroy (bool destroy_inventory) |
868 | { |
958 | { |
869 | if (destroyed ()) |
959 | if (destroyed ()) |
870 | return; |
960 | return; |
871 | |
961 | |
872 | if (destroy_inventory) |
962 | if (destroy_inventory) |
873 | destroy_inv (false); |
963 | destroy_inv (false); |
|
|
964 | |
|
|
965 | if (sound_destroy) |
|
|
966 | play_sound (sound_destroy); |
|
|
967 | else if (flag [FLAG_MONSTER]) |
|
|
968 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
874 | |
969 | |
875 | attachable::destroy (); |
970 | attachable::destroy (); |
876 | } |
971 | } |
877 | |
972 | |
878 | /* |
973 | /* |
… | |
… | |
896 | * This function removes the object op from the linked list of objects |
991 | * This function removes the object op from the linked list of objects |
897 | * which it is currently tied to. When this function is done, the |
992 | * which it is currently tied to. When this function is done, the |
898 | * object will have no environment. If the object previously had an |
993 | * object will have no environment. If the object previously had an |
899 | * environment, the x and y coordinates will be updated to |
994 | * environment, the x and y coordinates will be updated to |
900 | * the previous environment. |
995 | * the previous environment. |
901 | * Beware: This function is called from the editor as well! |
|
|
902 | */ |
996 | */ |
903 | void |
997 | void |
904 | object::remove () |
998 | object::do_remove () |
905 | { |
999 | { |
906 | object *tmp, *last = 0; |
1000 | object *tmp, *last = 0; |
907 | object *otmp; |
1001 | object *otmp; |
908 | |
1002 | |
909 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1003 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
952 | } |
1046 | } |
953 | else if (map) |
1047 | else if (map) |
954 | { |
1048 | { |
955 | if (type == PLAYER) |
1049 | if (type == PLAYER) |
956 | { |
1050 | { |
|
|
1051 | // leaving a spot always closes any open container on the ground |
|
|
1052 | if (container && !container->env) |
|
|
1053 | // this causes spurious floorbox updates, but it ensures |
|
|
1054 | // that the CLOSE event is being sent. |
|
|
1055 | close_container (); |
|
|
1056 | |
957 | --map->players; |
1057 | --map->players; |
958 | map->touch (); |
1058 | map->touch (); |
959 | } |
1059 | } |
960 | |
1060 | |
961 | map->dirty = true; |
1061 | map->dirty = true; |
|
|
1062 | mapspace &ms = this->ms (); |
962 | |
1063 | |
963 | /* link the object above us */ |
1064 | /* link the object above us */ |
964 | if (above) |
1065 | if (above) |
965 | above->below = below; |
1066 | above->below = below; |
966 | else |
1067 | else |
967 | map->at (x, y).top = below; /* we were top, set new top */ |
1068 | ms.top = below; /* we were top, set new top */ |
968 | |
1069 | |
969 | /* Relink the object below us, if there is one */ |
1070 | /* Relink the object below us, if there is one */ |
970 | if (below) |
1071 | if (below) |
971 | below->above = above; |
1072 | below->above = above; |
972 | else |
1073 | else |
… | |
… | |
974 | /* Nothing below, which means we need to relink map object for this space |
1075 | /* Nothing below, which means we need to relink map object for this space |
975 | * use translated coordinates in case some oddness with map tiling is |
1076 | * use translated coordinates in case some oddness with map tiling is |
976 | * evident |
1077 | * evident |
977 | */ |
1078 | */ |
978 | if (GET_MAP_OB (map, x, y) != this) |
1079 | if (GET_MAP_OB (map, x, y) != this) |
979 | { |
|
|
980 | char *dump = dump_object (this); |
|
|
981 | LOG (llevError, |
|
|
982 | "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); |
1080 | 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 ()); |
983 | free (dump); |
|
|
984 | dump = dump_object (GET_MAP_OB (map, x, y)); |
|
|
985 | LOG (llevError, "%s\n", dump); |
|
|
986 | free (dump); |
|
|
987 | } |
|
|
988 | |
1081 | |
989 | map->at (x, y).bot = above; /* goes on above it. */ |
1082 | ms.bot = above; /* goes on above it. */ |
990 | } |
1083 | } |
991 | |
1084 | |
992 | above = 0; |
1085 | above = 0; |
993 | below = 0; |
1086 | below = 0; |
994 | |
1087 | |
995 | if (map->in_memory == MAP_SAVING) |
1088 | if (map->in_memory == MAP_SAVING) |
996 | return; |
1089 | return; |
997 | |
1090 | |
998 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1091 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
999 | |
1092 | |
1000 | for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) |
1093 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1001 | { |
1094 | { |
1002 | /* No point updating the players look faces if he is the object |
1095 | /* No point updating the players look faces if he is the object |
1003 | * being removed. |
1096 | * being removed. |
1004 | */ |
1097 | */ |
1005 | |
1098 | |
… | |
… | |
1028 | |
1121 | |
1029 | if (destroyed ()) |
1122 | if (destroyed ()) |
1030 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1123 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1031 | } |
1124 | } |
1032 | |
1125 | |
1033 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1034 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1035 | if (tmp->above == tmp) |
|
|
1036 | tmp->above = 0; |
|
|
1037 | |
|
|
1038 | last = tmp; |
1126 | last = tmp; |
1039 | } |
1127 | } |
1040 | |
1128 | |
1041 | /* last == NULL if there are no objects on this space */ |
1129 | /* last == NULL if there are no objects on this space */ |
1042 | //TODO: this makes little sense, why only update the topmost object? |
1130 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1085 | } |
1173 | } |
1086 | |
1174 | |
1087 | return 0; |
1175 | return 0; |
1088 | } |
1176 | } |
1089 | |
1177 | |
|
|
1178 | void |
|
|
1179 | object::expand_tail () |
|
|
1180 | { |
|
|
1181 | if (more) |
|
|
1182 | return; |
|
|
1183 | |
|
|
1184 | object *prev = this; |
|
|
1185 | |
|
|
1186 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
|
|
1187 | { |
|
|
1188 | object *op = arch_to_object (at); |
|
|
1189 | |
|
|
1190 | op->name = name; |
|
|
1191 | op->name_pl = name_pl; |
|
|
1192 | op->title = title; |
|
|
1193 | |
|
|
1194 | op->head = this; |
|
|
1195 | prev->more = op; |
|
|
1196 | |
|
|
1197 | prev = op; |
|
|
1198 | } |
|
|
1199 | } |
|
|
1200 | |
1090 | /* |
1201 | /* |
1091 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1202 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1092 | * job preparing multi-part monsters |
1203 | * job preparing multi-part monsters. |
1093 | */ |
1204 | */ |
1094 | object * |
1205 | object * |
1095 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1206 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1096 | { |
1207 | { |
1097 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1208 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1098 | { |
1209 | { |
1099 | tmp->x = x + tmp->arch->clone.x; |
1210 | tmp->x = x + tmp->arch->x; |
1100 | tmp->y = y + tmp->arch->clone.y; |
1211 | tmp->y = y + tmp->arch->y; |
1101 | } |
1212 | } |
1102 | |
1213 | |
1103 | return insert_ob_in_map (op, m, originator, flag); |
1214 | return insert_ob_in_map (op, m, originator, flag); |
1104 | } |
1215 | } |
1105 | |
1216 | |
… | |
… | |
1124 | * just 'op' otherwise |
1235 | * just 'op' otherwise |
1125 | */ |
1236 | */ |
1126 | object * |
1237 | object * |
1127 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1238 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1128 | { |
1239 | { |
|
|
1240 | assert (!op->flag [FLAG_FREED]); |
|
|
1241 | |
1129 | object *tmp, *top, *floor = NULL; |
1242 | object *top, *floor = NULL; |
1130 | sint16 x, y; |
|
|
1131 | |
1243 | |
1132 | if (QUERY_FLAG (op, FLAG_FREED)) |
1244 | op->remove (); |
1133 | { |
|
|
1134 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1135 | return NULL; |
|
|
1136 | } |
|
|
1137 | |
1245 | |
1138 | if (!m) |
1246 | #if 0 |
1139 | { |
1247 | if (!m->active != !op->active) |
1140 | char *dump = dump_object (op); |
1248 | if (m->active) |
1141 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1249 | op->activate_recursive (); |
1142 | free (dump); |
1250 | else |
1143 | return op; |
1251 | op->deactivate_recursive (); |
1144 | } |
1252 | #endif |
1145 | |
1253 | |
1146 | if (out_of_map (m, op->x, op->y)) |
1254 | if (out_of_map (m, op->x, op->y)) |
1147 | { |
1255 | { |
1148 | char *dump = dump_object (op); |
|
|
1149 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1256 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1150 | #ifdef MANY_CORES |
1257 | #ifdef MANY_CORES |
1151 | /* Better to catch this here, as otherwise the next use of this object |
1258 | /* Better to catch this here, as otherwise the next use of this object |
1152 | * is likely to cause a crash. Better to find out where it is getting |
1259 | * is likely to cause a crash. Better to find out where it is getting |
1153 | * improperly inserted. |
1260 | * improperly inserted. |
1154 | */ |
1261 | */ |
1155 | abort (); |
1262 | abort (); |
1156 | #endif |
1263 | #endif |
1157 | free (dump); |
|
|
1158 | return op; |
1264 | return op; |
1159 | } |
1265 | } |
1160 | |
1266 | |
1161 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1267 | if (object *more = op->more) |
1162 | { |
1268 | if (!insert_ob_in_map (more, m, originator, flag)) |
1163 | char *dump = dump_object (op); |
|
|
1164 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1165 | free (dump); |
|
|
1166 | return op; |
1269 | return 0; |
1167 | } |
|
|
1168 | |
|
|
1169 | if (op->more) |
|
|
1170 | { |
|
|
1171 | /* The part may be on a different map. */ |
|
|
1172 | |
|
|
1173 | object *more = op->more; |
|
|
1174 | |
|
|
1175 | /* We really need the caller to normalise coordinates - if |
|
|
1176 | * we set the map, that doesn't work if the location is within |
|
|
1177 | * a map and this is straddling an edge. So only if coordinate |
|
|
1178 | * is clear wrong do we normalise it. |
|
|
1179 | */ |
|
|
1180 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1181 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1182 | else if (!more->map) |
|
|
1183 | { |
|
|
1184 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1185 | * more->map should always point to the parent. |
|
|
1186 | */ |
|
|
1187 | more->map = m; |
|
|
1188 | } |
|
|
1189 | |
|
|
1190 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
|
|
1191 | { |
|
|
1192 | if (!op->head) |
|
|
1193 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1194 | |
|
|
1195 | return 0; |
|
|
1196 | } |
|
|
1197 | } |
|
|
1198 | |
1270 | |
1199 | CLEAR_FLAG (op, FLAG_REMOVED); |
1271 | CLEAR_FLAG (op, FLAG_REMOVED); |
1200 | |
1272 | |
1201 | /* Ideally, the caller figures this out. However, it complicates a lot |
1273 | /* Ideally, the caller figures this out. However, it complicates a lot |
1202 | * of areas of callers (eg, anything that uses find_free_spot would now |
1274 | * of areas of callers (eg, anything that uses find_free_spot would now |
1203 | * need extra work |
1275 | * need extra work |
1204 | */ |
1276 | */ |
1205 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1277 | if (!xy_normalise (m, op->x, op->y)) |
1206 | x = op->x; |
1278 | return 0; |
1207 | y = op->y; |
1279 | |
|
|
1280 | op->map = m; |
|
|
1281 | mapspace &ms = op->ms (); |
1208 | |
1282 | |
1209 | /* this has to be done after we translate the coordinates. |
1283 | /* this has to be done after we translate the coordinates. |
1210 | */ |
1284 | */ |
1211 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1285 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1212 | for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) |
1286 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1213 | if (object::can_merge (op, tmp)) |
1287 | if (object::can_merge (op, tmp)) |
1214 | { |
1288 | { |
1215 | op->nrof += tmp->nrof; |
1289 | op->nrof += tmp->nrof; |
1216 | tmp->destroy (); |
1290 | tmp->destroy (); |
1217 | } |
1291 | } |
… | |
… | |
1234 | op->below = originator->below; |
1308 | op->below = originator->below; |
1235 | |
1309 | |
1236 | if (op->below) |
1310 | if (op->below) |
1237 | op->below->above = op; |
1311 | op->below->above = op; |
1238 | else |
1312 | else |
1239 | op->ms ().bot = op; |
1313 | ms.bot = op; |
1240 | |
1314 | |
1241 | /* since *below* originator, no need to update top */ |
1315 | /* since *below* originator, no need to update top */ |
1242 | originator->below = op; |
1316 | originator->below = op; |
1243 | } |
1317 | } |
1244 | else |
1318 | else |
1245 | { |
1319 | { |
|
|
1320 | top = ms.bot; |
|
|
1321 | |
1246 | /* If there are other objects, then */ |
1322 | /* If there are other objects, then */ |
1247 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1323 | if ((!(flag & INS_MAP_LOAD)) && top) |
1248 | { |
1324 | { |
1249 | object *last = 0; |
1325 | object *last = 0; |
1250 | |
1326 | |
1251 | /* |
1327 | /* |
1252 | * If there are multiple objects on this space, we do some trickier handling. |
1328 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1258 | * once we get to them. This reduces the need to traverse over all of |
1334 | * once we get to them. This reduces the need to traverse over all of |
1259 | * them when adding another one - this saves quite a bit of cpu time |
1335 | * them when adding another one - this saves quite a bit of cpu time |
1260 | * when lots of spells are cast in one area. Currently, it is presumed |
1336 | * when lots of spells are cast in one area. Currently, it is presumed |
1261 | * that flying non pickable objects are spell objects. |
1337 | * that flying non pickable objects are spell objects. |
1262 | */ |
1338 | */ |
1263 | while (top) |
1339 | for (top = ms.bot; top; top = top->above) |
1264 | { |
1340 | { |
1265 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1341 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1266 | floor = top; |
1342 | floor = top; |
1267 | |
1343 | |
1268 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1344 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1271 | top = top->below; |
1347 | top = top->below; |
1272 | break; |
1348 | break; |
1273 | } |
1349 | } |
1274 | |
1350 | |
1275 | last = top; |
1351 | last = top; |
1276 | top = top->above; |
|
|
1277 | } |
1352 | } |
1278 | |
1353 | |
1279 | /* Don't want top to be NULL, so set it to the last valid object */ |
1354 | /* Don't want top to be NULL, so set it to the last valid object */ |
1280 | top = last; |
1355 | top = last; |
1281 | |
1356 | |
… | |
… | |
1283 | * looks like instead of lots of conditions here. |
1358 | * looks like instead of lots of conditions here. |
1284 | * makes things faster, and effectively the same result. |
1359 | * makes things faster, and effectively the same result. |
1285 | */ |
1360 | */ |
1286 | |
1361 | |
1287 | /* Have object 'fall below' other objects that block view. |
1362 | /* Have object 'fall below' other objects that block view. |
1288 | * Unless those objects are exits, type 66 |
1363 | * Unless those objects are exits. |
1289 | * If INS_ON_TOP is used, don't do this processing |
1364 | * If INS_ON_TOP is used, don't do this processing |
1290 | * Need to find the object that in fact blocks view, otherwise |
1365 | * Need to find the object that in fact blocks view, otherwise |
1291 | * stacking is a bit odd. |
1366 | * stacking is a bit odd. |
1292 | */ |
1367 | */ |
1293 | if (!(flag & INS_ON_TOP) && |
1368 | if (!(flag & INS_ON_TOP) |
1294 | (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1369 | && ms.flags () & P_BLOCKSVIEW |
|
|
1370 | && (op->face && !faces [op->face].visibility)) |
1295 | { |
1371 | { |
1296 | for (last = top; last != floor; last = last->below) |
1372 | for (last = top; last != floor; last = last->below) |
1297 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1373 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1298 | break; |
1374 | break; |
|
|
1375 | |
1299 | /* Check to see if we found the object that blocks view, |
1376 | /* Check to see if we found the object that blocks view, |
1300 | * and make sure we have a below pointer for it so that |
1377 | * and make sure we have a below pointer for it so that |
1301 | * we can get inserted below this one, which requires we |
1378 | * we can get inserted below this one, which requires we |
1302 | * set top to the object below us. |
1379 | * set top to the object below us. |
1303 | */ |
1380 | */ |
1304 | if (last && last->below && last != floor) |
1381 | if (last && last->below && last != floor) |
1305 | top = last->below; |
1382 | top = last->below; |
1306 | } |
1383 | } |
1307 | } /* If objects on this space */ |
1384 | } /* If objects on this space */ |
1308 | |
|
|
1309 | if (flag & INS_MAP_LOAD) |
1385 | if (flag & INS_MAP_LOAD) |
1310 | top = GET_MAP_TOP (op->map, op->x, op->y); |
1386 | top = ms.top; |
1311 | |
1387 | |
1312 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1388 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1313 | top = floor; |
1389 | top = floor; |
1314 | |
1390 | |
1315 | /* Top is the object that our object (op) is going to get inserted above. |
1391 | /* Top is the object that our object (op) is going to get inserted above. |
1316 | */ |
1392 | */ |
1317 | |
1393 | |
1318 | /* First object on this space */ |
1394 | /* First object on this space */ |
1319 | if (!top) |
1395 | if (!top) |
1320 | { |
1396 | { |
1321 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1397 | op->above = ms.bot; |
1322 | |
1398 | |
1323 | if (op->above) |
1399 | if (op->above) |
1324 | op->above->below = op; |
1400 | op->above->below = op; |
1325 | |
1401 | |
1326 | op->below = 0; |
1402 | op->below = 0; |
1327 | op->ms ().bot = op; |
1403 | ms.bot = op; |
1328 | } |
1404 | } |
1329 | else |
1405 | else |
1330 | { /* get inserted into the stack above top */ |
1406 | { /* get inserted into the stack above top */ |
1331 | op->above = top->above; |
1407 | op->above = top->above; |
1332 | |
1408 | |
… | |
… | |
1336 | op->below = top; |
1412 | op->below = top; |
1337 | top->above = op; |
1413 | top->above = op; |
1338 | } |
1414 | } |
1339 | |
1415 | |
1340 | if (!op->above) |
1416 | if (!op->above) |
1341 | op->ms ().top = op; |
1417 | ms.top = op; |
1342 | } /* else not INS_BELOW_ORIGINATOR */ |
1418 | } /* else not INS_BELOW_ORIGINATOR */ |
1343 | |
1419 | |
1344 | if (op->type == PLAYER) |
1420 | if (op->type == PLAYER) |
1345 | { |
1421 | { |
1346 | op->contr->do_los = 1; |
1422 | op->contr->do_los = 1; |
… | |
… | |
1352 | |
1428 | |
1353 | /* If we have a floor, we know the player, if any, will be above |
1429 | /* If we have a floor, we know the player, if any, will be above |
1354 | * it, so save a few ticks and start from there. |
1430 | * it, so save a few ticks and start from there. |
1355 | */ |
1431 | */ |
1356 | if (!(flag & INS_MAP_LOAD)) |
1432 | if (!(flag & INS_MAP_LOAD)) |
1357 | if (object *pl = op->ms ().player ()) |
1433 | if (object *pl = ms.player ()) |
1358 | if (pl->contr->ns) |
1434 | if (pl->contr->ns) |
1359 | pl->contr->ns->floorbox_update (); |
1435 | pl->contr->ns->floorbox_update (); |
1360 | |
1436 | |
1361 | /* If this object glows, it may affect lighting conditions that are |
1437 | /* If this object glows, it may affect lighting conditions that are |
1362 | * visible to others on this map. But update_all_los is really |
1438 | * visible to others on this map. But update_all_los is really |
… | |
… | |
1383 | * blocked() and wall() work properly), and these flags are updated by |
1459 | * blocked() and wall() work properly), and these flags are updated by |
1384 | * update_object(). |
1460 | * update_object(). |
1385 | */ |
1461 | */ |
1386 | |
1462 | |
1387 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1463 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1388 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1464 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1389 | { |
1465 | { |
1390 | if (check_move_on (op, originator)) |
1466 | if (check_move_on (op, originator)) |
1391 | return 0; |
1467 | return 0; |
1392 | |
1468 | |
1393 | /* If we are a multi part object, lets work our way through the check |
1469 | /* If we are a multi part object, lets work our way through the check |
1394 | * walk on's. |
1470 | * walk on's. |
1395 | */ |
1471 | */ |
1396 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1472 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1397 | if (check_move_on (tmp, originator)) |
1473 | if (check_move_on (tmp, originator)) |
1398 | return 0; |
1474 | return 0; |
1399 | } |
1475 | } |
1400 | |
1476 | |
1401 | return op; |
1477 | return op; |
… | |
… | |
1411 | object *tmp, *tmp1; |
1487 | object *tmp, *tmp1; |
1412 | |
1488 | |
1413 | /* first search for itself and remove any old instances */ |
1489 | /* first search for itself and remove any old instances */ |
1414 | |
1490 | |
1415 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1491 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1416 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1492 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1417 | tmp->destroy (); |
1493 | tmp->destroy (); |
1418 | |
1494 | |
1419 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1495 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1420 | |
1496 | |
1421 | tmp1->x = op->x; |
1497 | tmp1->x = op->x; |
… | |
… | |
1424 | } |
1500 | } |
1425 | |
1501 | |
1426 | object * |
1502 | object * |
1427 | object::insert_at (object *where, object *originator, int flags) |
1503 | object::insert_at (object *where, object *originator, int flags) |
1428 | { |
1504 | { |
1429 | where->map->insert (this, where->x, where->y, originator, flags); |
1505 | return where->map->insert (this, where->x, where->y, originator, flags); |
1430 | } |
1506 | } |
1431 | |
1507 | |
1432 | /* |
1508 | /* |
1433 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1509 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1434 | * is returned contains nr objects, and the remaining parts contains |
1510 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1474 | * the amount of an object. If the amount reaches 0, the object |
1550 | * the amount of an object. If the amount reaches 0, the object |
1475 | * is subsequently removed and freed. |
1551 | * is subsequently removed and freed. |
1476 | * |
1552 | * |
1477 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1553 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1478 | */ |
1554 | */ |
1479 | |
|
|
1480 | object * |
1555 | object * |
1481 | decrease_ob_nr (object *op, uint32 i) |
1556 | decrease_ob_nr (object *op, uint32 i) |
1482 | { |
1557 | { |
1483 | object *tmp; |
1558 | object *tmp; |
1484 | |
1559 | |
… | |
… | |
1559 | |
1634 | |
1560 | /* |
1635 | /* |
1561 | * add_weight(object, weight) adds the specified weight to an object, |
1636 | * add_weight(object, weight) adds the specified weight to an object, |
1562 | * and also updates how much the environment(s) is/are carrying. |
1637 | * and also updates how much the environment(s) is/are carrying. |
1563 | */ |
1638 | */ |
1564 | |
|
|
1565 | void |
1639 | void |
1566 | add_weight (object *op, signed long weight) |
1640 | add_weight (object *op, signed long weight) |
1567 | { |
1641 | { |
1568 | while (op != NULL) |
1642 | while (op != NULL) |
1569 | { |
1643 | { |
… | |
… | |
1584 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1658 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1585 | free (dump); |
1659 | free (dump); |
1586 | return op; |
1660 | return op; |
1587 | } |
1661 | } |
1588 | |
1662 | |
1589 | if (where->head) |
1663 | if (where->head_ () != where) |
1590 | { |
1664 | { |
1591 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1665 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1592 | where = where->head; |
1666 | where = where->head; |
1593 | } |
1667 | } |
1594 | |
1668 | |
1595 | return where->insert (op); |
1669 | return where->insert (op); |
1596 | } |
1670 | } |
… | |
… | |
1601 | * inside the object environment. |
1675 | * inside the object environment. |
1602 | * |
1676 | * |
1603 | * The function returns now pointer to inserted item, and return value can |
1677 | * The function returns now pointer to inserted item, and return value can |
1604 | * be != op, if items are merged. -Tero |
1678 | * be != op, if items are merged. -Tero |
1605 | */ |
1679 | */ |
1606 | |
|
|
1607 | object * |
1680 | object * |
1608 | object::insert (object *op) |
1681 | object::insert (object *op) |
1609 | { |
1682 | { |
1610 | object *tmp, *otmp; |
1683 | object *tmp, *otmp; |
1611 | |
1684 | |
… | |
… | |
1771 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1844 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1772 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1845 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1773 | { |
1846 | { |
1774 | |
1847 | |
1775 | float |
1848 | float |
1776 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1849 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1777 | |
1850 | |
1778 | if (op->type == PLAYER) |
1851 | if (op->type == PLAYER) |
1779 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1852 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1780 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1853 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1781 | diff /= 4.0; |
1854 | diff /= 4.0; |
… | |
… | |
1925 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1998 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1926 | { |
1999 | { |
1927 | CLEAR_FLAG (tmp, flag); |
2000 | CLEAR_FLAG (tmp, flag); |
1928 | unflag_inv (tmp, flag); |
2001 | unflag_inv (tmp, flag); |
1929 | } |
2002 | } |
1930 | } |
|
|
1931 | |
|
|
1932 | /* |
|
|
1933 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
1934 | * all it's inventory (recursively). |
|
|
1935 | * If checksums are used, a player will get set_cheat called for |
|
|
1936 | * him/her-self and all object carried by a call to this function. |
|
|
1937 | */ |
|
|
1938 | void |
|
|
1939 | set_cheat (object *op) |
|
|
1940 | { |
|
|
1941 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1942 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1943 | } |
2003 | } |
1944 | |
2004 | |
1945 | /* |
2005 | /* |
1946 | * find_free_spot(object, map, x, y, start, stop) will search for |
2006 | * find_free_spot(object, map, x, y, start, stop) will search for |
1947 | * a spot at the given map and coordinates which will be able to contain |
2007 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
1988 | } |
2048 | } |
1989 | |
2049 | |
1990 | if (!index) |
2050 | if (!index) |
1991 | return -1; |
2051 | return -1; |
1992 | |
2052 | |
1993 | return altern[RANDOM () % index]; |
2053 | return altern [rndm (index)]; |
1994 | } |
2054 | } |
1995 | |
2055 | |
1996 | /* |
2056 | /* |
1997 | * find_first_free_spot(archetype, maptile, x, y) works like |
2057 | * find_first_free_spot(archetype, maptile, x, y) works like |
1998 | * find_free_spot(), but it will search max number of squares. |
2058 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
2019 | { |
2079 | { |
2020 | arr += begin; |
2080 | arr += begin; |
2021 | end -= begin; |
2081 | end -= begin; |
2022 | |
2082 | |
2023 | while (--end) |
2083 | while (--end) |
2024 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2084 | swap (arr [end], arr [rndm (end + 1)]); |
2025 | } |
2085 | } |
2026 | |
2086 | |
2027 | /* new function to make monster searching more efficient, and effective! |
2087 | /* new function to make monster searching more efficient, and effective! |
2028 | * This basically returns a randomized array (in the passed pointer) of |
2088 | * This basically returns a randomized array (in the passed pointer) of |
2029 | * the spaces to find monsters. In this way, it won't always look for |
2089 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2065 | object *tmp; |
2125 | object *tmp; |
2066 | maptile *mp; |
2126 | maptile *mp; |
2067 | |
2127 | |
2068 | MoveType blocked, move_type; |
2128 | MoveType blocked, move_type; |
2069 | |
2129 | |
2070 | if (exclude && exclude->head) |
2130 | if (exclude && exclude->head_ () != exclude) |
2071 | { |
2131 | { |
2072 | exclude = exclude->head; |
2132 | exclude = exclude->head; |
2073 | move_type = exclude->move_type; |
2133 | move_type = exclude->move_type; |
2074 | } |
2134 | } |
2075 | else |
2135 | else |
… | |
… | |
2098 | max = maxfree[i]; |
2158 | max = maxfree[i]; |
2099 | else if (mflags & P_IS_ALIVE) |
2159 | else if (mflags & P_IS_ALIVE) |
2100 | { |
2160 | { |
2101 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2161 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2102 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2162 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2103 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2163 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2104 | break; |
2164 | break; |
2105 | |
2165 | |
2106 | if (tmp) |
2166 | if (tmp) |
2107 | return freedir[i]; |
2167 | return freedir[i]; |
2108 | } |
2168 | } |
… | |
… | |
2303 | * create clone from object to another |
2363 | * create clone from object to another |
2304 | */ |
2364 | */ |
2305 | object * |
2365 | object * |
2306 | object_create_clone (object *asrc) |
2366 | object_create_clone (object *asrc) |
2307 | { |
2367 | { |
2308 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2368 | object *dst = 0, *tmp, *src, *prev, *item; |
2309 | |
2369 | |
2310 | if (!asrc) |
2370 | if (!asrc) |
2311 | return 0; |
2371 | return 0; |
2312 | |
2372 | |
2313 | src = asrc; |
|
|
2314 | if (src->head) |
|
|
2315 | src = src->head; |
2373 | src = asrc->head_ (); |
2316 | |
2374 | |
2317 | prev = 0; |
2375 | prev = 0; |
2318 | for (part = src; part; part = part->more) |
2376 | for (object *part = src; part; part = part->more) |
2319 | { |
2377 | { |
2320 | tmp = part->clone (); |
2378 | tmp = part->clone (); |
2321 | tmp->x -= src->x; |
2379 | tmp->x -= src->x; |
2322 | tmp->y -= src->y; |
2380 | tmp->y -= src->y; |
2323 | |
2381 | |
… | |
… | |
2341 | insert_ob_in_ob (object_create_clone (item), dst); |
2399 | insert_ob_in_ob (object_create_clone (item), dst); |
2342 | |
2400 | |
2343 | return dst; |
2401 | return dst; |
2344 | } |
2402 | } |
2345 | |
2403 | |
2346 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2347 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2348 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2349 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2350 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2351 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2352 | object * |
|
|
2353 | load_object_str (const char *obstr) |
|
|
2354 | { |
|
|
2355 | object *op; |
|
|
2356 | char filename[MAX_BUF]; |
|
|
2357 | |
|
|
2358 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2359 | |
|
|
2360 | FILE *tempfile = fopen (filename, "w"); |
|
|
2361 | |
|
|
2362 | if (tempfile == NULL) |
|
|
2363 | { |
|
|
2364 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2365 | return NULL; |
|
|
2366 | } |
|
|
2367 | |
|
|
2368 | fprintf (tempfile, obstr); |
|
|
2369 | fclose (tempfile); |
|
|
2370 | |
|
|
2371 | op = object::create (); |
|
|
2372 | |
|
|
2373 | object_thawer thawer (filename); |
|
|
2374 | |
|
|
2375 | if (thawer) |
|
|
2376 | load_object (thawer, op, 0); |
|
|
2377 | |
|
|
2378 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2379 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2380 | |
|
|
2381 | return op; |
|
|
2382 | } |
|
|
2383 | |
|
|
2384 | /* This returns the first object in who's inventory that |
2404 | /* This returns the first object in who's inventory that |
2385 | * has the same type and subtype match. |
2405 | * has the same type and subtype match. |
2386 | * returns NULL if no match. |
2406 | * returns NULL if no match. |
2387 | */ |
2407 | */ |
2388 | object * |
2408 | object * |
… | |
… | |
2441 | if (link->key == canonical_key) |
2461 | if (link->key == canonical_key) |
2442 | return link->value; |
2462 | return link->value; |
2443 | |
2463 | |
2444 | return 0; |
2464 | return 0; |
2445 | } |
2465 | } |
2446 | |
|
|
2447 | |
2466 | |
2448 | /* |
2467 | /* |
2449 | * Updates the canonical_key in op to value. |
2468 | * Updates the canonical_key in op to value. |
2450 | * |
2469 | * |
2451 | * canonical_key is a shared string (value doesn't have to be). |
2470 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2475 | /* Basically, if the archetype has this key set, |
2494 | /* Basically, if the archetype has this key set, |
2476 | * we need to store the null value so when we save |
2495 | * we need to store the null value so when we save |
2477 | * it, we save the empty value so that when we load, |
2496 | * it, we save the empty value so that when we load, |
2478 | * we get this value back again. |
2497 | * we get this value back again. |
2479 | */ |
2498 | */ |
2480 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2499 | if (get_ob_key_link (op->arch, canonical_key)) |
2481 | field->value = 0; |
2500 | field->value = 0; |
2482 | else |
2501 | else |
2483 | { |
2502 | { |
2484 | if (last) |
2503 | if (last) |
2485 | last->next = field->next; |
2504 | last->next = field->next; |
… | |
… | |
2554 | } |
2573 | } |
2555 | else |
2574 | else |
2556 | item = item->env; |
2575 | item = item->env; |
2557 | } |
2576 | } |
2558 | |
2577 | |
2559 | |
|
|
2560 | const char * |
2578 | const char * |
2561 | object::flag_desc (char *desc, int len) const |
2579 | object::flag_desc (char *desc, int len) const |
2562 | { |
2580 | { |
2563 | char *p = desc; |
2581 | char *p = desc; |
2564 | bool first = true; |
2582 | bool first = true; |
… | |
… | |
2591 | { |
2609 | { |
2592 | char flagdesc[512]; |
2610 | char flagdesc[512]; |
2593 | char info2[256 * 4]; |
2611 | char info2[256 * 4]; |
2594 | char *p = info; |
2612 | char *p = info; |
2595 | |
2613 | |
2596 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", |
2614 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2597 | count, uuid.seq, |
2615 | count, uuid.seq, |
2598 | &name, |
2616 | &name, |
2599 | title ? "\",title:" : "", |
2617 | title ? "\",title:\"" : "", |
2600 | title ? (const char *)title : "", |
2618 | title ? (const char *)title : "", |
2601 | flag_desc (flagdesc, 512), type); |
2619 | flag_desc (flagdesc, 512), type); |
2602 | |
2620 | |
2603 | if (env) |
2621 | if (env) |
2604 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2622 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
… | |
… | |
2610 | } |
2628 | } |
2611 | |
2629 | |
2612 | const char * |
2630 | const char * |
2613 | object::debug_desc () const |
2631 | object::debug_desc () const |
2614 | { |
2632 | { |
2615 | static char info[256 * 4]; |
2633 | static char info[3][256 * 4]; |
|
|
2634 | static int info_idx; |
|
|
2635 | |
2616 | return debug_desc (info); |
2636 | return debug_desc (info [++info_idx % 3]); |
2617 | } |
2637 | } |
2618 | |
2638 | |
2619 | const char * |
2639 | struct region * |
2620 | object::debug_desc2 () const |
2640 | object::region () const |
2621 | { |
2641 | { |
2622 | static char info[256 * 4]; |
2642 | return map ? map->region (x, y) |
2623 | return debug_desc (info); |
2643 | : region::default_region (); |
2624 | } |
2644 | } |
2625 | |
2645 | |
|
|
2646 | const materialtype_t * |
|
|
2647 | object::dominant_material () const |
|
|
2648 | { |
|
|
2649 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2650 | return mt; |
|
|
2651 | |
|
|
2652 | return name_to_material (shstr_unknown); |
|
|
2653 | } |
|
|
2654 | |
|
|
2655 | void |
|
|
2656 | object::open_container (object *new_container) |
|
|
2657 | { |
|
|
2658 | if (container == new_container) |
|
|
2659 | return; |
|
|
2660 | |
|
|
2661 | if (object *old_container = container) |
|
|
2662 | { |
|
|
2663 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2664 | return; |
|
|
2665 | |
|
|
2666 | #if 0 |
|
|
2667 | // remove the "Close old_container" object. |
|
|
2668 | if (object *closer = old_container->inv) |
|
|
2669 | if (closer->type == CLOSE_CON) |
|
|
2670 | closer->destroy (); |
|
|
2671 | #endif |
|
|
2672 | |
|
|
2673 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2674 | container = 0; |
|
|
2675 | |
|
|
2676 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2677 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2678 | } |
|
|
2679 | |
|
|
2680 | if (new_container) |
|
|
2681 | { |
|
|
2682 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2683 | return; |
|
|
2684 | |
|
|
2685 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2686 | #if 0 |
|
|
2687 | // insert the "Close Container" object. |
|
|
2688 | if (archetype *closer = new_container->other_arch) |
|
|
2689 | { |
|
|
2690 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2691 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2692 | new_container->insert (closer); |
|
|
2693 | } |
|
|
2694 | #endif |
|
|
2695 | |
|
|
2696 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2697 | |
|
|
2698 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2699 | container = new_container; |
|
|
2700 | |
|
|
2701 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2702 | esrv_send_inventory (this, new_container); |
|
|
2703 | } |
|
|
2704 | } |
|
|
2705 | |
|
|
2706 | object * |
|
|
2707 | object::force_find (const shstr name) |
|
|
2708 | { |
|
|
2709 | /* cycle through his inventory to look for the MARK we want to |
|
|
2710 | * place |
|
|
2711 | */ |
|
|
2712 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2713 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2714 | return splay (tmp); |
|
|
2715 | |
|
|
2716 | return 0; |
|
|
2717 | } |
|
|
2718 | |
|
|
2719 | void |
|
|
2720 | object::force_add (const shstr name, int duration) |
|
|
2721 | { |
|
|
2722 | if (object *force = force_find (name)) |
|
|
2723 | force->destroy (); |
|
|
2724 | |
|
|
2725 | object *force = get_archetype (FORCE_NAME); |
|
|
2726 | |
|
|
2727 | force->slaying = name; |
|
|
2728 | force->stats.food = 1; |
|
|
2729 | force->speed_left = -1.f; |
|
|
2730 | |
|
|
2731 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2732 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2733 | force->flag [FLAG_APPLIED] = true; |
|
|
2734 | |
|
|
2735 | insert (force); |
|
|
2736 | } |
|
|
2737 | |