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. |
|
|
21 | * |
20 | * |
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. */ |
… | |
… | |
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; |
… | |
… | |
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 - rndm (); |
|
|
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; |
… | |
… | |
852 | map = freed_map; |
936 | map = freed_map; |
853 | x = 1; |
937 | x = 1; |
854 | y = 1; |
938 | y = 1; |
855 | } |
939 | } |
856 | |
940 | |
857 | head = 0; |
|
|
858 | |
|
|
859 | if (more) |
941 | if (more) |
860 | { |
942 | { |
861 | more->destroy (); |
943 | more->destroy (); |
862 | more = 0; |
944 | more = 0; |
863 | } |
945 | } |
864 | |
946 | |
|
|
947 | head = 0; |
|
|
948 | |
865 | // clear those pointers that likely might have circular references to us |
949 | // clear those pointers that likely might cause circular references |
866 | owner = 0; |
950 | owner = 0; |
867 | enemy = 0; |
951 | enemy = 0; |
868 | attacked_by = 0; |
952 | attacked_by = 0; |
|
|
953 | current_weapon = 0; |
869 | } |
954 | } |
870 | |
955 | |
871 | void |
956 | void |
872 | object::destroy (bool destroy_inventory) |
957 | object::destroy (bool destroy_inventory) |
873 | { |
958 | { |
… | |
… | |
903 | * object will have no environment. If the object previously had an |
988 | * object will have no environment. If the object previously had an |
904 | * environment, the x and y coordinates will be updated to |
989 | * environment, the x and y coordinates will be updated to |
905 | * the previous environment. |
990 | * the previous environment. |
906 | */ |
991 | */ |
907 | void |
992 | void |
908 | object::remove_slow () |
993 | object::do_remove () |
909 | { |
994 | { |
910 | object *tmp, *last = 0; |
995 | object *tmp, *last = 0; |
911 | object *otmp; |
996 | object *otmp; |
912 | |
997 | |
913 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
998 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
956 | } |
1041 | } |
957 | else if (map) |
1042 | else if (map) |
958 | { |
1043 | { |
959 | if (type == PLAYER) |
1044 | if (type == PLAYER) |
960 | { |
1045 | { |
|
|
1046 | // leaving a spot always closes any open container on the ground |
|
|
1047 | if (container && !container->env) |
|
|
1048 | // this causes spurious floorbox updates, but it ensures |
|
|
1049 | // that the CLOSE event is being sent. |
|
|
1050 | close_container (); |
|
|
1051 | |
961 | --map->players; |
1052 | --map->players; |
962 | map->touch (); |
1053 | map->touch (); |
963 | } |
1054 | } |
964 | |
1055 | |
965 | map->dirty = true; |
1056 | map->dirty = true; |
… | |
… | |
1025 | |
1116 | |
1026 | if (destroyed ()) |
1117 | if (destroyed ()) |
1027 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1118 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1028 | } |
1119 | } |
1029 | |
1120 | |
1030 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1031 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1032 | if (tmp->above == tmp) |
|
|
1033 | tmp->above = 0; |
|
|
1034 | |
|
|
1035 | last = tmp; |
1121 | last = tmp; |
1036 | } |
1122 | } |
1037 | |
1123 | |
1038 | /* last == NULL if there are no objects on this space */ |
1124 | /* last == NULL if there are no objects on this space */ |
1039 | //TODO: this makes little sense, why only update the topmost object? |
1125 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1082 | } |
1168 | } |
1083 | |
1169 | |
1084 | return 0; |
1170 | return 0; |
1085 | } |
1171 | } |
1086 | |
1172 | |
|
|
1173 | void |
|
|
1174 | object::expand_tail () |
|
|
1175 | { |
|
|
1176 | if (more) |
|
|
1177 | return; |
|
|
1178 | |
|
|
1179 | object *prev = this; |
|
|
1180 | |
|
|
1181 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
|
|
1182 | { |
|
|
1183 | object *op = arch_to_object (at); |
|
|
1184 | |
|
|
1185 | op->name = name; |
|
|
1186 | op->name_pl = name_pl; |
|
|
1187 | op->title = title; |
|
|
1188 | |
|
|
1189 | op->head = this; |
|
|
1190 | prev->more = op; |
|
|
1191 | |
|
|
1192 | prev = op; |
|
|
1193 | } |
|
|
1194 | } |
|
|
1195 | |
1087 | /* |
1196 | /* |
1088 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1197 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1089 | * job preparing multi-part monsters. |
1198 | * job preparing multi-part monsters. |
1090 | */ |
1199 | */ |
1091 | object * |
1200 | object * |
1092 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1201 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1093 | { |
1202 | { |
1094 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1203 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1095 | { |
1204 | { |
1096 | tmp->x = x + tmp->arch->clone.x; |
1205 | tmp->x = x + tmp->arch->x; |
1097 | tmp->y = y + tmp->arch->clone.y; |
1206 | tmp->y = y + tmp->arch->y; |
1098 | } |
1207 | } |
1099 | |
1208 | |
1100 | return insert_ob_in_map (op, m, originator, flag); |
1209 | return insert_ob_in_map (op, m, originator, flag); |
1101 | } |
1210 | } |
1102 | |
1211 | |
… | |
… | |
1121 | * just 'op' otherwise |
1230 | * just 'op' otherwise |
1122 | */ |
1231 | */ |
1123 | object * |
1232 | object * |
1124 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1233 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1125 | { |
1234 | { |
|
|
1235 | assert (!op->flag [FLAG_FREED]); |
|
|
1236 | |
1126 | object *tmp, *top, *floor = NULL; |
1237 | object *top, *floor = NULL; |
1127 | |
|
|
1128 | if (QUERY_FLAG (op, FLAG_FREED)) |
|
|
1129 | { |
|
|
1130 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1131 | return NULL; |
|
|
1132 | } |
|
|
1133 | |
|
|
1134 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1135 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1136 | |
1238 | |
1137 | op->remove (); |
1239 | op->remove (); |
1138 | |
1240 | |
1139 | if (!m) |
1241 | #if 0 |
1140 | { |
1242 | if (!m->active != !op->active) |
1141 | char *dump = dump_object (op); |
1243 | if (m->active) |
1142 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1244 | op->activate_recursive (); |
1143 | free (dump); |
1245 | else |
1144 | return op; |
1246 | op->deactivate_recursive (); |
1145 | } |
1247 | #endif |
1146 | |
1248 | |
1147 | if (out_of_map (m, op->x, op->y)) |
1249 | if (out_of_map (m, op->x, op->y)) |
1148 | { |
1250 | { |
1149 | char *dump = dump_object (op); |
|
|
1150 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1251 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1151 | #ifdef MANY_CORES |
1252 | #ifdef MANY_CORES |
1152 | /* Better to catch this here, as otherwise the next use of this object |
1253 | /* Better to catch this here, as otherwise the next use of this object |
1153 | * is likely to cause a crash. Better to find out where it is getting |
1254 | * is likely to cause a crash. Better to find out where it is getting |
1154 | * improperly inserted. |
1255 | * improperly inserted. |
1155 | */ |
1256 | */ |
1156 | abort (); |
1257 | abort (); |
1157 | #endif |
1258 | #endif |
1158 | free (dump); |
|
|
1159 | return op; |
1259 | return op; |
1160 | } |
1260 | } |
1161 | |
1261 | |
1162 | if (object *more = op->more) |
1262 | if (object *more = op->more) |
1163 | { |
|
|
1164 | if (!insert_ob_in_map (more, m, originator, flag)) |
1263 | if (!insert_ob_in_map (more, m, originator, flag)) |
1165 | { |
|
|
1166 | if (!op->head) |
|
|
1167 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1168 | |
|
|
1169 | return 0; |
1264 | return 0; |
1170 | } |
|
|
1171 | } |
|
|
1172 | |
1265 | |
1173 | CLEAR_FLAG (op, FLAG_REMOVED); |
1266 | CLEAR_FLAG (op, FLAG_REMOVED); |
1174 | |
1267 | |
1175 | /* Ideally, the caller figures this out. However, it complicates a lot |
1268 | /* Ideally, the caller figures this out. However, it complicates a lot |
1176 | * of areas of callers (eg, anything that uses find_free_spot would now |
1269 | * of areas of callers (eg, anything that uses find_free_spot would now |
… | |
… | |
1183 | mapspace &ms = op->ms (); |
1276 | mapspace &ms = op->ms (); |
1184 | |
1277 | |
1185 | /* this has to be done after we translate the coordinates. |
1278 | /* this has to be done after we translate the coordinates. |
1186 | */ |
1279 | */ |
1187 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1280 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1188 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1281 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1189 | if (object::can_merge (op, tmp)) |
1282 | if (object::can_merge (op, tmp)) |
1190 | { |
1283 | { |
1191 | op->nrof += tmp->nrof; |
1284 | op->nrof += tmp->nrof; |
1192 | tmp->destroy (); |
1285 | tmp->destroy (); |
1193 | } |
1286 | } |
… | |
… | |
1260 | * looks like instead of lots of conditions here. |
1353 | * looks like instead of lots of conditions here. |
1261 | * makes things faster, and effectively the same result. |
1354 | * makes things faster, and effectively the same result. |
1262 | */ |
1355 | */ |
1263 | |
1356 | |
1264 | /* Have object 'fall below' other objects that block view. |
1357 | /* Have object 'fall below' other objects that block view. |
1265 | * Unless those objects are exits, type 66 |
1358 | * Unless those objects are exits. |
1266 | * If INS_ON_TOP is used, don't do this processing |
1359 | * If INS_ON_TOP is used, don't do this processing |
1267 | * Need to find the object that in fact blocks view, otherwise |
1360 | * Need to find the object that in fact blocks view, otherwise |
1268 | * stacking is a bit odd. |
1361 | * stacking is a bit odd. |
1269 | */ |
1362 | */ |
1270 | if (!(flag & INS_ON_TOP) |
1363 | if (!(flag & INS_ON_TOP) |
1271 | && ms.flags () & P_BLOCKSVIEW |
1364 | && ms.flags () & P_BLOCKSVIEW |
1272 | && (op->face && !op->face->visibility)) |
1365 | && (op->face && !faces [op->face].visibility)) |
1273 | { |
1366 | { |
1274 | for (last = top; last != floor; last = last->below) |
1367 | for (last = top; last != floor; last = last->below) |
1275 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1368 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1276 | break; |
1369 | break; |
1277 | |
1370 | |
… | |
… | |
1362 | * blocked() and wall() work properly), and these flags are updated by |
1455 | * blocked() and wall() work properly), and these flags are updated by |
1363 | * update_object(). |
1456 | * update_object(). |
1364 | */ |
1457 | */ |
1365 | |
1458 | |
1366 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1459 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1367 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1460 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1368 | { |
1461 | { |
1369 | if (check_move_on (op, originator)) |
1462 | if (check_move_on (op, originator)) |
1370 | return 0; |
1463 | return 0; |
1371 | |
1464 | |
1372 | /* If we are a multi part object, lets work our way through the check |
1465 | /* If we are a multi part object, lets work our way through the check |
1373 | * walk on's. |
1466 | * walk on's. |
1374 | */ |
1467 | */ |
1375 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1468 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1376 | if (check_move_on (tmp, originator)) |
1469 | if (check_move_on (tmp, originator)) |
1377 | return 0; |
1470 | return 0; |
1378 | } |
1471 | } |
1379 | |
1472 | |
1380 | return op; |
1473 | return op; |
… | |
… | |
1390 | object *tmp, *tmp1; |
1483 | object *tmp, *tmp1; |
1391 | |
1484 | |
1392 | /* first search for itself and remove any old instances */ |
1485 | /* first search for itself and remove any old instances */ |
1393 | |
1486 | |
1394 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1487 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1395 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1488 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1396 | tmp->destroy (); |
1489 | tmp->destroy (); |
1397 | |
1490 | |
1398 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1491 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1399 | |
1492 | |
1400 | tmp1->x = op->x; |
1493 | tmp1->x = op->x; |
… | |
… | |
1403 | } |
1496 | } |
1404 | |
1497 | |
1405 | object * |
1498 | object * |
1406 | object::insert_at (object *where, object *originator, int flags) |
1499 | object::insert_at (object *where, object *originator, int flags) |
1407 | { |
1500 | { |
1408 | where->map->insert (this, where->x, where->y, originator, flags); |
1501 | return where->map->insert (this, where->x, where->y, originator, flags); |
1409 | } |
1502 | } |
1410 | |
1503 | |
1411 | /* |
1504 | /* |
1412 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1505 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1413 | * is returned contains nr objects, and the remaining parts contains |
1506 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1453 | * the amount of an object. If the amount reaches 0, the object |
1546 | * the amount of an object. If the amount reaches 0, the object |
1454 | * is subsequently removed and freed. |
1547 | * is subsequently removed and freed. |
1455 | * |
1548 | * |
1456 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1549 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1457 | */ |
1550 | */ |
1458 | |
|
|
1459 | object * |
1551 | object * |
1460 | decrease_ob_nr (object *op, uint32 i) |
1552 | decrease_ob_nr (object *op, uint32 i) |
1461 | { |
1553 | { |
1462 | object *tmp; |
1554 | object *tmp; |
1463 | |
1555 | |
… | |
… | |
1538 | |
1630 | |
1539 | /* |
1631 | /* |
1540 | * add_weight(object, weight) adds the specified weight to an object, |
1632 | * add_weight(object, weight) adds the specified weight to an object, |
1541 | * and also updates how much the environment(s) is/are carrying. |
1633 | * and also updates how much the environment(s) is/are carrying. |
1542 | */ |
1634 | */ |
1543 | |
|
|
1544 | void |
1635 | void |
1545 | add_weight (object *op, signed long weight) |
1636 | add_weight (object *op, signed long weight) |
1546 | { |
1637 | { |
1547 | while (op != NULL) |
1638 | while (op != NULL) |
1548 | { |
1639 | { |
… | |
… | |
1563 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1654 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1564 | free (dump); |
1655 | free (dump); |
1565 | return op; |
1656 | return op; |
1566 | } |
1657 | } |
1567 | |
1658 | |
1568 | if (where->head) |
1659 | if (where->head_ () != where) |
1569 | { |
1660 | { |
1570 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1661 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1571 | where = where->head; |
1662 | where = where->head; |
1572 | } |
1663 | } |
1573 | |
1664 | |
1574 | return where->insert (op); |
1665 | return where->insert (op); |
1575 | } |
1666 | } |
… | |
… | |
1580 | * inside the object environment. |
1671 | * inside the object environment. |
1581 | * |
1672 | * |
1582 | * The function returns now pointer to inserted item, and return value can |
1673 | * The function returns now pointer to inserted item, and return value can |
1583 | * be != op, if items are merged. -Tero |
1674 | * be != op, if items are merged. -Tero |
1584 | */ |
1675 | */ |
1585 | |
|
|
1586 | object * |
1676 | object * |
1587 | object::insert (object *op) |
1677 | object::insert (object *op) |
1588 | { |
1678 | { |
1589 | object *tmp, *otmp; |
1679 | object *tmp, *otmp; |
1590 | |
1680 | |
… | |
… | |
1904 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1994 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1905 | { |
1995 | { |
1906 | CLEAR_FLAG (tmp, flag); |
1996 | CLEAR_FLAG (tmp, flag); |
1907 | unflag_inv (tmp, flag); |
1997 | unflag_inv (tmp, flag); |
1908 | } |
1998 | } |
1909 | } |
|
|
1910 | |
|
|
1911 | /* |
|
|
1912 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
1913 | * all it's inventory (recursively). |
|
|
1914 | * If checksums are used, a player will get set_cheat called for |
|
|
1915 | * him/her-self and all object carried by a call to this function. |
|
|
1916 | */ |
|
|
1917 | void |
|
|
1918 | set_cheat (object *op) |
|
|
1919 | { |
|
|
1920 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1921 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1922 | } |
1999 | } |
1923 | |
2000 | |
1924 | /* |
2001 | /* |
1925 | * find_free_spot(object, map, x, y, start, stop) will search for |
2002 | * find_free_spot(object, map, x, y, start, stop) will search for |
1926 | * a spot at the given map and coordinates which will be able to contain |
2003 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
2044 | object *tmp; |
2121 | object *tmp; |
2045 | maptile *mp; |
2122 | maptile *mp; |
2046 | |
2123 | |
2047 | MoveType blocked, move_type; |
2124 | MoveType blocked, move_type; |
2048 | |
2125 | |
2049 | if (exclude && exclude->head) |
2126 | if (exclude && exclude->head_ () != exclude) |
2050 | { |
2127 | { |
2051 | exclude = exclude->head; |
2128 | exclude = exclude->head; |
2052 | move_type = exclude->move_type; |
2129 | move_type = exclude->move_type; |
2053 | } |
2130 | } |
2054 | else |
2131 | else |
… | |
… | |
2077 | max = maxfree[i]; |
2154 | max = maxfree[i]; |
2078 | else if (mflags & P_IS_ALIVE) |
2155 | else if (mflags & P_IS_ALIVE) |
2079 | { |
2156 | { |
2080 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2157 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2081 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2158 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2082 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2159 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2083 | break; |
2160 | break; |
2084 | |
2161 | |
2085 | if (tmp) |
2162 | if (tmp) |
2086 | return freedir[i]; |
2163 | return freedir[i]; |
2087 | } |
2164 | } |
… | |
… | |
2282 | * create clone from object to another |
2359 | * create clone from object to another |
2283 | */ |
2360 | */ |
2284 | object * |
2361 | object * |
2285 | object_create_clone (object *asrc) |
2362 | object_create_clone (object *asrc) |
2286 | { |
2363 | { |
2287 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2364 | object *dst = 0, *tmp, *src, *prev, *item; |
2288 | |
2365 | |
2289 | if (!asrc) |
2366 | if (!asrc) |
2290 | return 0; |
2367 | return 0; |
2291 | |
2368 | |
2292 | src = asrc; |
|
|
2293 | if (src->head) |
|
|
2294 | src = src->head; |
2369 | src = asrc->head_ (); |
2295 | |
2370 | |
2296 | prev = 0; |
2371 | prev = 0; |
2297 | for (part = src; part; part = part->more) |
2372 | for (object *part = src; part; part = part->more) |
2298 | { |
2373 | { |
2299 | tmp = part->clone (); |
2374 | tmp = part->clone (); |
2300 | tmp->x -= src->x; |
2375 | tmp->x -= src->x; |
2301 | tmp->y -= src->y; |
2376 | tmp->y -= src->y; |
2302 | |
2377 | |
… | |
… | |
2320 | insert_ob_in_ob (object_create_clone (item), dst); |
2395 | insert_ob_in_ob (object_create_clone (item), dst); |
2321 | |
2396 | |
2322 | return dst; |
2397 | return dst; |
2323 | } |
2398 | } |
2324 | |
2399 | |
2325 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2326 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2327 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2328 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2329 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2330 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2331 | object * |
|
|
2332 | load_object_str (const char *obstr) |
|
|
2333 | { |
|
|
2334 | object *op; |
|
|
2335 | char filename[MAX_BUF]; |
|
|
2336 | |
|
|
2337 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2338 | |
|
|
2339 | FILE *tempfile = fopen (filename, "w"); |
|
|
2340 | |
|
|
2341 | if (tempfile == NULL) |
|
|
2342 | { |
|
|
2343 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2344 | return NULL; |
|
|
2345 | } |
|
|
2346 | |
|
|
2347 | fprintf (tempfile, obstr); |
|
|
2348 | fclose (tempfile); |
|
|
2349 | |
|
|
2350 | op = object::create (); |
|
|
2351 | |
|
|
2352 | object_thawer thawer (filename); |
|
|
2353 | |
|
|
2354 | if (thawer) |
|
|
2355 | load_object (thawer, op, 0); |
|
|
2356 | |
|
|
2357 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2358 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2359 | |
|
|
2360 | return op; |
|
|
2361 | } |
|
|
2362 | |
|
|
2363 | /* This returns the first object in who's inventory that |
2400 | /* This returns the first object in who's inventory that |
2364 | * has the same type and subtype match. |
2401 | * has the same type and subtype match. |
2365 | * returns NULL if no match. |
2402 | * returns NULL if no match. |
2366 | */ |
2403 | */ |
2367 | object * |
2404 | object * |
… | |
… | |
2420 | if (link->key == canonical_key) |
2457 | if (link->key == canonical_key) |
2421 | return link->value; |
2458 | return link->value; |
2422 | |
2459 | |
2423 | return 0; |
2460 | return 0; |
2424 | } |
2461 | } |
2425 | |
|
|
2426 | |
2462 | |
2427 | /* |
2463 | /* |
2428 | * Updates the canonical_key in op to value. |
2464 | * Updates the canonical_key in op to value. |
2429 | * |
2465 | * |
2430 | * canonical_key is a shared string (value doesn't have to be). |
2466 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2454 | /* Basically, if the archetype has this key set, |
2490 | /* Basically, if the archetype has this key set, |
2455 | * we need to store the null value so when we save |
2491 | * we need to store the null value so when we save |
2456 | * it, we save the empty value so that when we load, |
2492 | * it, we save the empty value so that when we load, |
2457 | * we get this value back again. |
2493 | * we get this value back again. |
2458 | */ |
2494 | */ |
2459 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2495 | if (get_ob_key_link (op->arch, canonical_key)) |
2460 | field->value = 0; |
2496 | field->value = 0; |
2461 | else |
2497 | else |
2462 | { |
2498 | { |
2463 | if (last) |
2499 | if (last) |
2464 | last->next = field->next; |
2500 | last->next = field->next; |
… | |
… | |
2533 | } |
2569 | } |
2534 | else |
2570 | else |
2535 | item = item->env; |
2571 | item = item->env; |
2536 | } |
2572 | } |
2537 | |
2573 | |
2538 | |
|
|
2539 | const char * |
2574 | const char * |
2540 | object::flag_desc (char *desc, int len) const |
2575 | object::flag_desc (char *desc, int len) const |
2541 | { |
2576 | { |
2542 | char *p = desc; |
2577 | char *p = desc; |
2543 | bool first = true; |
2578 | bool first = true; |
… | |
… | |
2570 | { |
2605 | { |
2571 | char flagdesc[512]; |
2606 | char flagdesc[512]; |
2572 | char info2[256 * 4]; |
2607 | char info2[256 * 4]; |
2573 | char *p = info; |
2608 | char *p = info; |
2574 | |
2609 | |
2575 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2610 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2576 | count, uuid.seq, |
2611 | count, uuid.seq, |
2577 | &name, |
2612 | &name, |
2578 | title ? "\",title:\"" : "", |
2613 | title ? "\",title:\"" : "", |
2579 | title ? (const char *)title : "", |
2614 | title ? (const char *)title : "", |
2580 | flag_desc (flagdesc, 512), type); |
2615 | flag_desc (flagdesc, 512), type); |
… | |
… | |
2589 | } |
2624 | } |
2590 | |
2625 | |
2591 | const char * |
2626 | const char * |
2592 | object::debug_desc () const |
2627 | object::debug_desc () const |
2593 | { |
2628 | { |
2594 | static char info[256 * 4]; |
2629 | static char info[3][256 * 4]; |
|
|
2630 | static int info_idx; |
|
|
2631 | |
2595 | return debug_desc (info); |
2632 | return debug_desc (info [++info_idx % 3]); |
2596 | } |
|
|
2597 | |
|
|
2598 | const char * |
|
|
2599 | object::debug_desc2 () const |
|
|
2600 | { |
|
|
2601 | static char info[256 * 4]; |
|
|
2602 | return debug_desc (info); |
|
|
2603 | } |
2633 | } |
2604 | |
2634 | |
2605 | struct region * |
2635 | struct region * |
2606 | object::region () const |
2636 | object::region () const |
2607 | { |
2637 | { |
2608 | return map ? map->region (x, y) |
2638 | return map ? map->region (x, y) |
2609 | : region::default_region (); |
2639 | : region::default_region (); |
2610 | } |
2640 | } |
2611 | |
2641 | |
|
|
2642 | const materialtype_t * |
|
|
2643 | object::dominant_material () const |
|
|
2644 | { |
|
|
2645 | if (materialtype_t *mat = name_to_material (materialname)) |
|
|
2646 | return mat; |
|
|
2647 | |
|
|
2648 | // omfg this is slow, this has to be temporary :) |
|
|
2649 | shstr unknown ("unknown"); |
|
|
2650 | |
|
|
2651 | return name_to_material (unknown); |
|
|
2652 | } |
|
|
2653 | |
|
|
2654 | void |
|
|
2655 | object::open_container (object *new_container) |
|
|
2656 | { |
|
|
2657 | if (container == new_container) |
|
|
2658 | return; |
|
|
2659 | |
|
|
2660 | if (object *old_container = container) |
|
|
2661 | { |
|
|
2662 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2663 | return; |
|
|
2664 | |
|
|
2665 | #if 0 |
|
|
2666 | // remove the "Close old_container" object. |
|
|
2667 | if (object *closer = old_container->inv) |
|
|
2668 | if (closer->type == CLOSE_CON) |
|
|
2669 | closer->destroy (); |
|
|
2670 | #endif |
|
|
2671 | |
|
|
2672 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2673 | container = 0; |
|
|
2674 | |
|
|
2675 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2676 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2677 | } |
|
|
2678 | |
|
|
2679 | if (new_container) |
|
|
2680 | { |
|
|
2681 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2682 | return; |
|
|
2683 | |
|
|
2684 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2685 | #if 0 |
|
|
2686 | // insert the "Close Container" object. |
|
|
2687 | if (archetype *closer = new_container->other_arch) |
|
|
2688 | { |
|
|
2689 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2690 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2691 | new_container->insert (closer); |
|
|
2692 | } |
|
|
2693 | #endif |
|
|
2694 | |
|
|
2695 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2696 | |
|
|
2697 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2698 | container = new_container; |
|
|
2699 | |
|
|
2700 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2701 | esrv_send_inventory (this, new_container); |
|
|
2702 | } |
|
|
2703 | } |
|
|
2704 | |
|
|
2705 | |