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; |
… | |
… | |
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 - 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; |
… | |
… | |
819 | |
903 | |
820 | if (flag [FLAG_IS_LINKED]) |
904 | if (flag [FLAG_IS_LINKED]) |
821 | remove_button_link (this); |
905 | remove_button_link (this); |
822 | |
906 | |
823 | if (flag [FLAG_FRIENDLY]) |
907 | if (flag [FLAG_FRIENDLY]) |
824 | { |
|
|
825 | remove_friendly_object (this); |
908 | remove_friendly_object (this); |
826 | |
|
|
827 | if (type == GOLEM |
|
|
828 | && owner |
|
|
829 | && owner->type == PLAYER |
|
|
830 | && owner->contr->ranges[range_golem] == this) |
|
|
831 | owner->contr->ranges[range_golem] = 0; |
|
|
832 | } |
|
|
833 | |
909 | |
834 | if (!flag [FLAG_REMOVED]) |
910 | if (!flag [FLAG_REMOVED]) |
835 | remove (); |
911 | remove (); |
836 | |
912 | |
837 | destroy_inv (true); |
913 | destroy_inv (true); |
… | |
… | |
860 | map = freed_map; |
936 | map = freed_map; |
861 | x = 1; |
937 | x = 1; |
862 | y = 1; |
938 | y = 1; |
863 | } |
939 | } |
864 | |
940 | |
865 | head = 0; |
|
|
866 | |
|
|
867 | if (more) |
941 | if (more) |
868 | { |
942 | { |
869 | more->destroy (); |
943 | more->destroy (); |
870 | more = 0; |
944 | more = 0; |
871 | } |
945 | } |
872 | |
946 | |
|
|
947 | head = 0; |
|
|
948 | |
873 | // clear those pointers that likely might have circular references to us |
949 | // clear those pointers that likely might cause circular references |
874 | owner = 0; |
950 | owner = 0; |
875 | enemy = 0; |
951 | enemy = 0; |
876 | attacked_by = 0; |
952 | attacked_by = 0; |
|
|
953 | current_weapon = 0; |
877 | } |
954 | } |
878 | |
955 | |
879 | void |
956 | void |
880 | object::destroy (bool destroy_inventory) |
957 | object::destroy (bool destroy_inventory) |
881 | { |
958 | { |
882 | if (destroyed ()) |
959 | if (destroyed ()) |
883 | return; |
960 | return; |
884 | |
961 | |
885 | if (destroy_inventory) |
962 | if (destroy_inventory) |
886 | 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 |
887 | |
969 | |
888 | attachable::destroy (); |
970 | attachable::destroy (); |
889 | } |
971 | } |
890 | |
972 | |
891 | /* |
973 | /* |
… | |
… | |
1039 | |
1121 | |
1040 | if (destroyed ()) |
1122 | if (destroyed ()) |
1041 | 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 ()); |
1042 | } |
1124 | } |
1043 | |
1125 | |
1044 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1045 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1046 | if (tmp->above == tmp) |
|
|
1047 | tmp->above = 0; |
|
|
1048 | |
|
|
1049 | last = tmp; |
1126 | last = tmp; |
1050 | } |
1127 | } |
1051 | |
1128 | |
1052 | /* last == NULL if there are no objects on this space */ |
1129 | /* last == NULL if there are no objects on this space */ |
1053 | //TODO: this makes little sense, why only update the topmost object? |
1130 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1096 | } |
1173 | } |
1097 | |
1174 | |
1098 | return 0; |
1175 | return 0; |
1099 | } |
1176 | } |
1100 | |
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 | |
1101 | /* |
1201 | /* |
1102 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1202 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1103 | * job preparing multi-part monsters. |
1203 | * job preparing multi-part monsters. |
1104 | */ |
1204 | */ |
1105 | object * |
1205 | object * |
1106 | 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) |
1107 | { |
1207 | { |
1108 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1208 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1109 | { |
1209 | { |
1110 | tmp->x = x + tmp->arch->clone.x; |
1210 | tmp->x = x + tmp->arch->x; |
1111 | tmp->y = y + tmp->arch->clone.y; |
1211 | tmp->y = y + tmp->arch->y; |
1112 | } |
1212 | } |
1113 | |
1213 | |
1114 | return insert_ob_in_map (op, m, originator, flag); |
1214 | return insert_ob_in_map (op, m, originator, flag); |
1115 | } |
1215 | } |
1116 | |
1216 | |
… | |
… | |
1135 | * just 'op' otherwise |
1235 | * just 'op' otherwise |
1136 | */ |
1236 | */ |
1137 | object * |
1237 | object * |
1138 | 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) |
1139 | { |
1239 | { |
|
|
1240 | assert (!op->flag [FLAG_FREED]); |
|
|
1241 | |
1140 | object *tmp, *top, *floor = NULL; |
1242 | object *top, *floor = NULL; |
1141 | |
|
|
1142 | if (QUERY_FLAG (op, FLAG_FREED)) |
|
|
1143 | { |
|
|
1144 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1145 | return NULL; |
|
|
1146 | } |
|
|
1147 | |
|
|
1148 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1149 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1150 | |
1243 | |
1151 | op->remove (); |
1244 | op->remove (); |
1152 | |
1245 | |
1153 | if (!m) |
1246 | #if 0 |
1154 | { |
1247 | if (!m->active != !op->active) |
1155 | char *dump = dump_object (op); |
1248 | if (m->active) |
1156 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1249 | op->activate_recursive (); |
1157 | free (dump); |
1250 | else |
1158 | return op; |
1251 | op->deactivate_recursive (); |
1159 | } |
1252 | #endif |
1160 | |
1253 | |
1161 | if (out_of_map (m, op->x, op->y)) |
1254 | if (out_of_map (m, op->x, op->y)) |
1162 | { |
1255 | { |
1163 | char *dump = dump_object (op); |
|
|
1164 | 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 ()); |
1165 | #ifdef MANY_CORES |
1257 | #ifdef MANY_CORES |
1166 | /* 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 |
1167 | * 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 |
1168 | * improperly inserted. |
1260 | * improperly inserted. |
1169 | */ |
1261 | */ |
1170 | abort (); |
1262 | abort (); |
1171 | #endif |
1263 | #endif |
1172 | free (dump); |
|
|
1173 | return op; |
1264 | return op; |
1174 | } |
1265 | } |
1175 | |
1266 | |
1176 | if (object *more = op->more) |
1267 | if (object *more = op->more) |
1177 | { |
|
|
1178 | if (!insert_ob_in_map (more, m, originator, flag)) |
1268 | if (!insert_ob_in_map (more, m, originator, flag)) |
1179 | { |
|
|
1180 | if (!op->head) |
|
|
1181 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1182 | |
|
|
1183 | return 0; |
1269 | return 0; |
1184 | } |
|
|
1185 | } |
|
|
1186 | |
1270 | |
1187 | CLEAR_FLAG (op, FLAG_REMOVED); |
1271 | CLEAR_FLAG (op, FLAG_REMOVED); |
1188 | |
1272 | |
1189 | /* Ideally, the caller figures this out. However, it complicates a lot |
1273 | /* Ideally, the caller figures this out. However, it complicates a lot |
1190 | * 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 |
… | |
… | |
1197 | mapspace &ms = op->ms (); |
1281 | mapspace &ms = op->ms (); |
1198 | |
1282 | |
1199 | /* this has to be done after we translate the coordinates. |
1283 | /* this has to be done after we translate the coordinates. |
1200 | */ |
1284 | */ |
1201 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1285 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1202 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1286 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1203 | if (object::can_merge (op, tmp)) |
1287 | if (object::can_merge (op, tmp)) |
1204 | { |
1288 | { |
1205 | op->nrof += tmp->nrof; |
1289 | op->nrof += tmp->nrof; |
1206 | tmp->destroy (); |
1290 | tmp->destroy (); |
1207 | } |
1291 | } |
… | |
… | |
1274 | * looks like instead of lots of conditions here. |
1358 | * looks like instead of lots of conditions here. |
1275 | * makes things faster, and effectively the same result. |
1359 | * makes things faster, and effectively the same result. |
1276 | */ |
1360 | */ |
1277 | |
1361 | |
1278 | /* Have object 'fall below' other objects that block view. |
1362 | /* Have object 'fall below' other objects that block view. |
1279 | * Unless those objects are exits, type 66 |
1363 | * Unless those objects are exits. |
1280 | * If INS_ON_TOP is used, don't do this processing |
1364 | * If INS_ON_TOP is used, don't do this processing |
1281 | * Need to find the object that in fact blocks view, otherwise |
1365 | * Need to find the object that in fact blocks view, otherwise |
1282 | * stacking is a bit odd. |
1366 | * stacking is a bit odd. |
1283 | */ |
1367 | */ |
1284 | if (!(flag & INS_ON_TOP) |
1368 | if (!(flag & INS_ON_TOP) |
1285 | && ms.flags () & P_BLOCKSVIEW |
1369 | && ms.flags () & P_BLOCKSVIEW |
1286 | && (op->face && !op->face->visibility)) |
1370 | && (op->face && !faces [op->face].visibility)) |
1287 | { |
1371 | { |
1288 | for (last = top; last != floor; last = last->below) |
1372 | for (last = top; last != floor; last = last->below) |
1289 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1373 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1290 | break; |
1374 | break; |
1291 | |
1375 | |
… | |
… | |
1296 | */ |
1380 | */ |
1297 | if (last && last->below && last != floor) |
1381 | if (last && last->below && last != floor) |
1298 | top = last->below; |
1382 | top = last->below; |
1299 | } |
1383 | } |
1300 | } /* If objects on this space */ |
1384 | } /* If objects on this space */ |
1301 | |
|
|
1302 | if (flag & INS_MAP_LOAD) |
1385 | if (flag & INS_MAP_LOAD) |
1303 | top = ms.top; |
1386 | top = ms.top; |
1304 | |
1387 | |
1305 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1388 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1306 | top = floor; |
1389 | top = floor; |
… | |
… | |
1376 | * blocked() and wall() work properly), and these flags are updated by |
1459 | * blocked() and wall() work properly), and these flags are updated by |
1377 | * update_object(). |
1460 | * update_object(). |
1378 | */ |
1461 | */ |
1379 | |
1462 | |
1380 | /* 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 */ |
1381 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1464 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1382 | { |
1465 | { |
1383 | if (check_move_on (op, originator)) |
1466 | if (check_move_on (op, originator)) |
1384 | return 0; |
1467 | return 0; |
1385 | |
1468 | |
1386 | /* 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 |
1387 | * walk on's. |
1470 | * walk on's. |
1388 | */ |
1471 | */ |
1389 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1472 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1390 | if (check_move_on (tmp, originator)) |
1473 | if (check_move_on (tmp, originator)) |
1391 | return 0; |
1474 | return 0; |
1392 | } |
1475 | } |
1393 | |
1476 | |
1394 | return op; |
1477 | return op; |
… | |
… | |
1404 | object *tmp, *tmp1; |
1487 | object *tmp, *tmp1; |
1405 | |
1488 | |
1406 | /* first search for itself and remove any old instances */ |
1489 | /* first search for itself and remove any old instances */ |
1407 | |
1490 | |
1408 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1491 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1409 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1492 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1410 | tmp->destroy (); |
1493 | tmp->destroy (); |
1411 | |
1494 | |
1412 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1495 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1413 | |
1496 | |
1414 | tmp1->x = op->x; |
1497 | tmp1->x = op->x; |
… | |
… | |
1417 | } |
1500 | } |
1418 | |
1501 | |
1419 | object * |
1502 | object * |
1420 | object::insert_at (object *where, object *originator, int flags) |
1503 | object::insert_at (object *where, object *originator, int flags) |
1421 | { |
1504 | { |
1422 | where->map->insert (this, where->x, where->y, originator, flags); |
1505 | return where->map->insert (this, where->x, where->y, originator, flags); |
1423 | } |
1506 | } |
1424 | |
1507 | |
1425 | /* |
1508 | /* |
1426 | * 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 |
1427 | * is returned contains nr objects, and the remaining parts contains |
1510 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1467 | * 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 |
1468 | * is subsequently removed and freed. |
1551 | * is subsequently removed and freed. |
1469 | * |
1552 | * |
1470 | * 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 |
1471 | */ |
1554 | */ |
1472 | |
|
|
1473 | object * |
1555 | object * |
1474 | decrease_ob_nr (object *op, uint32 i) |
1556 | decrease_ob_nr (object *op, uint32 i) |
1475 | { |
1557 | { |
1476 | object *tmp; |
1558 | object *tmp; |
1477 | |
1559 | |
… | |
… | |
1552 | |
1634 | |
1553 | /* |
1635 | /* |
1554 | * add_weight(object, weight) adds the specified weight to an object, |
1636 | * add_weight(object, weight) adds the specified weight to an object, |
1555 | * and also updates how much the environment(s) is/are carrying. |
1637 | * and also updates how much the environment(s) is/are carrying. |
1556 | */ |
1638 | */ |
1557 | |
|
|
1558 | void |
1639 | void |
1559 | add_weight (object *op, signed long weight) |
1640 | add_weight (object *op, signed long weight) |
1560 | { |
1641 | { |
1561 | while (op != NULL) |
1642 | while (op != NULL) |
1562 | { |
1643 | { |
… | |
… | |
1577 | 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); |
1578 | free (dump); |
1659 | free (dump); |
1579 | return op; |
1660 | return op; |
1580 | } |
1661 | } |
1581 | |
1662 | |
1582 | if (where->head) |
1663 | if (where->head_ () != where) |
1583 | { |
1664 | { |
1584 | 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"); |
1585 | where = where->head; |
1666 | where = where->head; |
1586 | } |
1667 | } |
1587 | |
1668 | |
1588 | return where->insert (op); |
1669 | return where->insert (op); |
1589 | } |
1670 | } |
… | |
… | |
1594 | * inside the object environment. |
1675 | * inside the object environment. |
1595 | * |
1676 | * |
1596 | * 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 |
1597 | * be != op, if items are merged. -Tero |
1678 | * be != op, if items are merged. -Tero |
1598 | */ |
1679 | */ |
1599 | |
|
|
1600 | object * |
1680 | object * |
1601 | object::insert (object *op) |
1681 | object::insert (object *op) |
1602 | { |
1682 | { |
1603 | object *tmp, *otmp; |
1683 | object *tmp, *otmp; |
1604 | |
1684 | |
… | |
… | |
1918 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1998 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1919 | { |
1999 | { |
1920 | CLEAR_FLAG (tmp, flag); |
2000 | CLEAR_FLAG (tmp, flag); |
1921 | unflag_inv (tmp, flag); |
2001 | unflag_inv (tmp, flag); |
1922 | } |
2002 | } |
1923 | } |
|
|
1924 | |
|
|
1925 | /* |
|
|
1926 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
1927 | * all it's inventory (recursively). |
|
|
1928 | * If checksums are used, a player will get set_cheat called for |
|
|
1929 | * him/her-self and all object carried by a call to this function. |
|
|
1930 | */ |
|
|
1931 | void |
|
|
1932 | set_cheat (object *op) |
|
|
1933 | { |
|
|
1934 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1935 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1936 | } |
2003 | } |
1937 | |
2004 | |
1938 | /* |
2005 | /* |
1939 | * 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 |
1940 | * 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 |
… | |
… | |
2058 | object *tmp; |
2125 | object *tmp; |
2059 | maptile *mp; |
2126 | maptile *mp; |
2060 | |
2127 | |
2061 | MoveType blocked, move_type; |
2128 | MoveType blocked, move_type; |
2062 | |
2129 | |
2063 | if (exclude && exclude->head) |
2130 | if (exclude && exclude->head_ () != exclude) |
2064 | { |
2131 | { |
2065 | exclude = exclude->head; |
2132 | exclude = exclude->head; |
2066 | move_type = exclude->move_type; |
2133 | move_type = exclude->move_type; |
2067 | } |
2134 | } |
2068 | else |
2135 | else |
… | |
… | |
2091 | max = maxfree[i]; |
2158 | max = maxfree[i]; |
2092 | else if (mflags & P_IS_ALIVE) |
2159 | else if (mflags & P_IS_ALIVE) |
2093 | { |
2160 | { |
2094 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2161 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2095 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2162 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2096 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2163 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2097 | break; |
2164 | break; |
2098 | |
2165 | |
2099 | if (tmp) |
2166 | if (tmp) |
2100 | return freedir[i]; |
2167 | return freedir[i]; |
2101 | } |
2168 | } |
… | |
… | |
2296 | * create clone from object to another |
2363 | * create clone from object to another |
2297 | */ |
2364 | */ |
2298 | object * |
2365 | object * |
2299 | object_create_clone (object *asrc) |
2366 | object_create_clone (object *asrc) |
2300 | { |
2367 | { |
2301 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2368 | object *dst = 0, *tmp, *src, *prev, *item; |
2302 | |
2369 | |
2303 | if (!asrc) |
2370 | if (!asrc) |
2304 | return 0; |
2371 | return 0; |
2305 | |
2372 | |
2306 | src = asrc; |
|
|
2307 | if (src->head) |
|
|
2308 | src = src->head; |
2373 | src = asrc->head_ (); |
2309 | |
2374 | |
2310 | prev = 0; |
2375 | prev = 0; |
2311 | for (part = src; part; part = part->more) |
2376 | for (object *part = src; part; part = part->more) |
2312 | { |
2377 | { |
2313 | tmp = part->clone (); |
2378 | tmp = part->clone (); |
2314 | tmp->x -= src->x; |
2379 | tmp->x -= src->x; |
2315 | tmp->y -= src->y; |
2380 | tmp->y -= src->y; |
2316 | |
2381 | |
… | |
… | |
2334 | insert_ob_in_ob (object_create_clone (item), dst); |
2399 | insert_ob_in_ob (object_create_clone (item), dst); |
2335 | |
2400 | |
2336 | return dst; |
2401 | return dst; |
2337 | } |
2402 | } |
2338 | |
2403 | |
2339 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2340 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2341 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2342 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2343 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2344 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2345 | object * |
|
|
2346 | load_object_str (const char *obstr) |
|
|
2347 | { |
|
|
2348 | object *op; |
|
|
2349 | char filename[MAX_BUF]; |
|
|
2350 | |
|
|
2351 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2352 | |
|
|
2353 | FILE *tempfile = fopen (filename, "w"); |
|
|
2354 | |
|
|
2355 | if (tempfile == NULL) |
|
|
2356 | { |
|
|
2357 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2358 | return NULL; |
|
|
2359 | } |
|
|
2360 | |
|
|
2361 | fprintf (tempfile, obstr); |
|
|
2362 | fclose (tempfile); |
|
|
2363 | |
|
|
2364 | op = object::create (); |
|
|
2365 | |
|
|
2366 | object_thawer thawer (filename); |
|
|
2367 | |
|
|
2368 | if (thawer) |
|
|
2369 | load_object (thawer, op, 0); |
|
|
2370 | |
|
|
2371 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2372 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2373 | |
|
|
2374 | return op; |
|
|
2375 | } |
|
|
2376 | |
|
|
2377 | /* This returns the first object in who's inventory that |
2404 | /* This returns the first object in who's inventory that |
2378 | * has the same type and subtype match. |
2405 | * has the same type and subtype match. |
2379 | * returns NULL if no match. |
2406 | * returns NULL if no match. |
2380 | */ |
2407 | */ |
2381 | object * |
2408 | object * |
… | |
… | |
2434 | if (link->key == canonical_key) |
2461 | if (link->key == canonical_key) |
2435 | return link->value; |
2462 | return link->value; |
2436 | |
2463 | |
2437 | return 0; |
2464 | return 0; |
2438 | } |
2465 | } |
2439 | |
|
|
2440 | |
2466 | |
2441 | /* |
2467 | /* |
2442 | * Updates the canonical_key in op to value. |
2468 | * Updates the canonical_key in op to value. |
2443 | * |
2469 | * |
2444 | * 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). |
… | |
… | |
2468 | /* Basically, if the archetype has this key set, |
2494 | /* Basically, if the archetype has this key set, |
2469 | * we need to store the null value so when we save |
2495 | * we need to store the null value so when we save |
2470 | * it, we save the empty value so that when we load, |
2496 | * it, we save the empty value so that when we load, |
2471 | * we get this value back again. |
2497 | * we get this value back again. |
2472 | */ |
2498 | */ |
2473 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2499 | if (get_ob_key_link (op->arch, canonical_key)) |
2474 | field->value = 0; |
2500 | field->value = 0; |
2475 | else |
2501 | else |
2476 | { |
2502 | { |
2477 | if (last) |
2503 | if (last) |
2478 | last->next = field->next; |
2504 | last->next = field->next; |
… | |
… | |
2547 | } |
2573 | } |
2548 | else |
2574 | else |
2549 | item = item->env; |
2575 | item = item->env; |
2550 | } |
2576 | } |
2551 | |
2577 | |
2552 | |
|
|
2553 | const char * |
2578 | const char * |
2554 | object::flag_desc (char *desc, int len) const |
2579 | object::flag_desc (char *desc, int len) const |
2555 | { |
2580 | { |
2556 | char *p = desc; |
2581 | char *p = desc; |
2557 | bool first = true; |
2582 | bool first = true; |
… | |
… | |
2603 | } |
2628 | } |
2604 | |
2629 | |
2605 | const char * |
2630 | const char * |
2606 | object::debug_desc () const |
2631 | object::debug_desc () const |
2607 | { |
2632 | { |
2608 | static char info[256 * 4]; |
2633 | static char info[3][256 * 4]; |
|
|
2634 | static int info_idx; |
|
|
2635 | |
2609 | return debug_desc (info); |
2636 | return debug_desc (info [++info_idx % 3]); |
2610 | } |
|
|
2611 | |
|
|
2612 | const char * |
|
|
2613 | object::debug_desc2 () const |
|
|
2614 | { |
|
|
2615 | static char info[256 * 4]; |
|
|
2616 | return debug_desc (info); |
|
|
2617 | } |
2637 | } |
2618 | |
2638 | |
2619 | struct region * |
2639 | struct region * |
2620 | object::region () const |
2640 | object::region () const |
2621 | { |
2641 | { |
… | |
… | |
2624 | } |
2644 | } |
2625 | |
2645 | |
2626 | const materialtype_t * |
2646 | const materialtype_t * |
2627 | object::dominant_material () const |
2647 | object::dominant_material () const |
2628 | { |
2648 | { |
2629 | if (materialtype_t *mat = name_to_material (materialname)) |
2649 | if (materialtype_t *mt = name_to_material (materialname)) |
2630 | return mat; |
2650 | return mt; |
2631 | |
2651 | |
2632 | // omfg this is slow, this has to be temporary :) |
|
|
2633 | shstr unknown ("unknown"); |
|
|
2634 | |
|
|
2635 | return name_to_material (unknown); |
2652 | return name_to_material (shstr_unknown); |
2636 | } |
2653 | } |
2637 | |
2654 | |
2638 | void |
2655 | void |
2639 | object::open_container (object *new_container) |
2656 | object::open_container (object *new_container) |
2640 | { |
2657 | { |
2641 | if (container == new_container) |
2658 | if (container == new_container) |
2642 | return; |
2659 | return; |
2643 | |
|
|
2644 | if (contr && contr->ns) |
|
|
2645 | contr->ns->floorbox_reset (); |
|
|
2646 | |
2660 | |
2647 | if (object *old_container = container) |
2661 | if (object *old_container = container) |
2648 | { |
2662 | { |
2649 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2663 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2650 | return; |
2664 | return; |
… | |
… | |
2677 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2691 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2678 | new_container->insert (closer); |
2692 | new_container->insert (closer); |
2679 | } |
2693 | } |
2680 | #endif |
2694 | #endif |
2681 | |
2695 | |
|
|
2696 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2697 | |
2682 | new_container->flag [FLAG_APPLIED] = 1; |
2698 | new_container->flag [FLAG_APPLIED] = 1; |
2683 | container = new_container; |
2699 | container = new_container; |
2684 | |
2700 | |
2685 | esrv_update_item (UPD_FLAGS, this, new_container); |
2701 | esrv_update_item (UPD_FLAGS, this, new_container); |
2686 | esrv_send_inventory (this, new_container); |
2702 | esrv_send_inventory (this, new_container); |
2687 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2688 | } |
2703 | } |
2689 | } |
2704 | } |
2690 | |
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); |
2691 | |
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 | |