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 |
376 | * multi-object 1 which is closest to the second object. |
376 | * multi-object 1 which is closest to the second object. |
377 | * If it's not a multi-object, it is returned. |
377 | * If it's not a multi-object, it is returned. |
378 | */ |
378 | */ |
379 | |
|
|
380 | object * |
379 | object * |
381 | get_nearest_part (object *op, const object *pl) |
380 | get_nearest_part (object *op, const object *pl) |
382 | { |
381 | { |
383 | object *tmp, *closest; |
382 | object *tmp, *closest; |
384 | int last_dist, i; |
383 | int last_dist, i; |
… | |
… | |
429 | } |
428 | } |
430 | |
429 | |
431 | /* |
430 | /* |
432 | * Sets the owner and sets the skill and exp pointers to owner's current |
431 | * Sets the owner and sets the skill and exp pointers to owner's current |
433 | * skill and experience objects. |
432 | * skill and experience objects. |
|
|
433 | * ACTUALLY NO! investigate! TODO |
434 | */ |
434 | */ |
435 | void |
435 | void |
436 | object::set_owner (object *owner) |
436 | object::set_owner (object *owner) |
437 | { |
437 | { |
|
|
438 | // allow objects which own objects |
438 | if (!owner) |
439 | if (owner) |
439 | return; |
|
|
440 | |
|
|
441 | /* next line added to allow objects which own objects */ |
|
|
442 | /* Add a check for ownercounts in here, as I got into an endless loop |
|
|
443 | * with the fireball owning a poison cloud which then owned the |
|
|
444 | * fireball. I believe that was caused by one of the objects getting |
|
|
445 | * freed and then another object replacing it. Since the ownercounts |
|
|
446 | * didn't match, this check is valid and I believe that cause is valid. |
|
|
447 | */ |
|
|
448 | while (owner->owner) |
440 | while (owner->owner) |
449 | owner = owner->owner; |
441 | owner = owner->owner; |
450 | |
442 | |
451 | this->owner = owner; |
443 | this->owner = owner; |
|
|
444 | } |
|
|
445 | |
|
|
446 | int |
|
|
447 | object::slottype () const |
|
|
448 | { |
|
|
449 | if (type == SKILL) |
|
|
450 | { |
|
|
451 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
452 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
453 | } |
|
|
454 | else |
|
|
455 | { |
|
|
456 | if (slot [body_combat].info) return slot_combat; |
|
|
457 | if (slot [body_range ].info) return slot_ranged; |
|
|
458 | } |
|
|
459 | |
|
|
460 | return slot_none; |
|
|
461 | } |
|
|
462 | |
|
|
463 | bool |
|
|
464 | object::change_weapon (object *ob) |
|
|
465 | { |
|
|
466 | if (current_weapon == ob) |
|
|
467 | return true; |
|
|
468 | |
|
|
469 | if (chosen_skill) |
|
|
470 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
471 | |
|
|
472 | current_weapon = ob; |
|
|
473 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
474 | |
|
|
475 | if (chosen_skill) |
|
|
476 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
477 | |
|
|
478 | update_stats (); |
|
|
479 | |
|
|
480 | if (ob) |
|
|
481 | { |
|
|
482 | // now check wether any body locations became invalid, in which case |
|
|
483 | // we cannot apply the weapon at the moment. |
|
|
484 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
485 | if (slot[i].used < 0) |
|
|
486 | { |
|
|
487 | current_weapon = chosen_skill = 0; |
|
|
488 | update_stats (); |
|
|
489 | |
|
|
490 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
491 | "You try to balance all your items at once, " |
|
|
492 | "but the %s is just too much for your body. " |
|
|
493 | "[You need to unapply some items first.]", &ob->name); |
|
|
494 | return false; |
|
|
495 | } |
|
|
496 | |
|
|
497 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
498 | } |
|
|
499 | else |
|
|
500 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
501 | |
|
|
502 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
503 | { |
|
|
504 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
505 | &name, ob->debug_desc ()); |
|
|
506 | return false; |
|
|
507 | } |
|
|
508 | |
|
|
509 | return true; |
452 | } |
510 | } |
453 | |
511 | |
454 | /* Zero the key_values on op, decrementing the shared-string |
512 | /* Zero the key_values on op, decrementing the shared-string |
455 | * refcounts and freeing the links. |
513 | * refcounts and freeing the links. |
456 | */ |
514 | */ |
457 | static void |
515 | static void |
458 | free_key_values (object *op) |
516 | free_key_values (object *op) |
459 | { |
517 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
518 | for (key_value *i = op->key_values; i; ) |
461 | { |
519 | { |
462 | key_value *next = i->next; |
520 | key_value *next = i->next; |
463 | delete i; |
521 | delete i; |
464 | |
522 | |
465 | i = next; |
523 | i = next; |
466 | } |
524 | } |
467 | |
525 | |
468 | op->key_values = 0; |
526 | op->key_values = 0; |
469 | } |
527 | } |
470 | |
528 | |
471 | /* |
529 | object & |
472 | * copy_to first frees everything allocated by the dst object, |
530 | 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 | { |
531 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
532 | bool is_freed = flag [FLAG_FREED]; |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
533 | bool is_removed = flag [FLAG_REMOVED]; |
484 | |
534 | |
485 | *(object_copy *)dst = *this; |
535 | *(object_copy *)this = src; |
486 | |
536 | |
487 | if (is_freed) |
537 | flag [FLAG_FREED] = is_freed; |
488 | SET_FLAG (dst, FLAG_FREED); |
538 | 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 | |
539 | |
496 | /* Copy over key_values, if any. */ |
540 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
541 | if (src.key_values) |
498 | { |
542 | { |
499 | key_value *tail = 0; |
543 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
544 | key_values = 0; |
503 | |
545 | |
504 | for (i = key_values; i; i = i->next) |
546 | for (key_value *i = src.key_values; i; i = i->next) |
505 | { |
547 | { |
506 | key_value *new_link = new key_value; |
548 | key_value *new_link = new key_value; |
507 | |
549 | |
508 | new_link->next = 0; |
550 | new_link->next = 0; |
509 | new_link->key = i->key; |
551 | new_link->key = i->key; |
510 | new_link->value = i->value; |
552 | new_link->value = i->value; |
511 | |
553 | |
512 | /* Try and be clever here, too. */ |
554 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
555 | if (!key_values) |
514 | { |
556 | { |
515 | dst->key_values = new_link; |
557 | key_values = new_link; |
516 | tail = new_link; |
558 | tail = new_link; |
517 | } |
559 | } |
518 | else |
560 | else |
519 | { |
561 | { |
520 | tail->next = new_link; |
562 | tail->next = new_link; |
521 | tail = new_link; |
563 | tail = new_link; |
522 | } |
564 | } |
523 | } |
565 | } |
524 | } |
566 | } |
|
|
567 | } |
|
|
568 | |
|
|
569 | /* |
|
|
570 | * copy_to first frees everything allocated by the dst object, |
|
|
571 | * and then copies the contents of itself into the second |
|
|
572 | * object, allocating what needs to be allocated. Basically, any |
|
|
573 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
574 | * if the first object is freed, the pointers in the new object |
|
|
575 | * will point at garbage. |
|
|
576 | */ |
|
|
577 | void |
|
|
578 | object::copy_to (object *dst) |
|
|
579 | { |
|
|
580 | *dst = *this; |
|
|
581 | |
|
|
582 | if (speed < 0) |
|
|
583 | dst->speed_left -= rndm (); |
525 | |
584 | |
526 | dst->set_speed (dst->speed); |
585 | dst->set_speed (dst->speed); |
|
|
586 | } |
|
|
587 | |
|
|
588 | void |
|
|
589 | object::instantiate () |
|
|
590 | { |
|
|
591 | if (!uuid.seq) // HACK |
|
|
592 | uuid = gen_uuid (); |
|
|
593 | |
|
|
594 | speed_left = -0.1f; |
|
|
595 | /* copy the body_info to the body_used - this is only really |
|
|
596 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
597 | * by doing so, when a monster is created, it has good starting |
|
|
598 | * values for the body_used info, so when items are created |
|
|
599 | * for it, they can be properly equipped. |
|
|
600 | */ |
|
|
601 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
602 | slot[i].used = slot[i].info; |
|
|
603 | |
|
|
604 | attachable::instantiate (); |
527 | } |
605 | } |
528 | |
606 | |
529 | object * |
607 | object * |
530 | object::clone () |
608 | object::clone () |
531 | { |
609 | { |
… | |
… | |
589 | * UP_OBJ_FACE: only the objects face has changed. |
667 | * UP_OBJ_FACE: only the objects face has changed. |
590 | */ |
668 | */ |
591 | void |
669 | void |
592 | update_object (object *op, int action) |
670 | update_object (object *op, int action) |
593 | { |
671 | { |
594 | MoveType move_on, move_off, move_block, move_slow; |
|
|
595 | |
|
|
596 | if (op == NULL) |
672 | if (op == NULL) |
597 | { |
673 | { |
598 | /* this should never happen */ |
674 | /* this should never happen */ |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
675 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
600 | return; |
676 | return; |
… | |
… | |
819 | |
895 | |
820 | if (flag [FLAG_IS_LINKED]) |
896 | if (flag [FLAG_IS_LINKED]) |
821 | remove_button_link (this); |
897 | remove_button_link (this); |
822 | |
898 | |
823 | if (flag [FLAG_FRIENDLY]) |
899 | if (flag [FLAG_FRIENDLY]) |
824 | { |
|
|
825 | remove_friendly_object (this); |
900 | 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 | |
901 | |
834 | if (!flag [FLAG_REMOVED]) |
902 | if (!flag [FLAG_REMOVED]) |
835 | remove (); |
903 | remove (); |
836 | |
904 | |
837 | destroy_inv (true); |
905 | destroy_inv (true); |
… | |
… | |
847 | |
915 | |
848 | if (!freed_map) |
916 | if (!freed_map) |
849 | { |
917 | { |
850 | freed_map = new maptile; |
918 | freed_map = new maptile; |
851 | |
919 | |
|
|
920 | freed_map->path = "<freed objects map>"; |
852 | freed_map->name = "/internal/freed_objects_map"; |
921 | freed_map->name = "/internal/freed_objects_map"; |
853 | freed_map->width = 3; |
922 | freed_map->width = 3; |
854 | freed_map->height = 3; |
923 | freed_map->height = 3; |
855 | |
924 | |
856 | freed_map->alloc (); |
925 | freed_map->alloc (); |
… | |
… | |
860 | map = freed_map; |
929 | map = freed_map; |
861 | x = 1; |
930 | x = 1; |
862 | y = 1; |
931 | y = 1; |
863 | } |
932 | } |
864 | |
933 | |
865 | head = 0; |
|
|
866 | |
|
|
867 | if (more) |
934 | if (more) |
868 | { |
935 | { |
869 | more->destroy (); |
936 | more->destroy (); |
870 | more = 0; |
937 | more = 0; |
871 | } |
938 | } |
872 | |
939 | |
|
|
940 | head = 0; |
|
|
941 | |
873 | // clear those pointers that likely might have circular references to us |
942 | // clear those pointers that likely might cause circular references |
874 | owner = 0; |
943 | owner = 0; |
875 | enemy = 0; |
944 | enemy = 0; |
876 | attacked_by = 0; |
945 | attacked_by = 0; |
|
|
946 | current_weapon = 0; |
877 | } |
947 | } |
878 | |
948 | |
879 | void |
949 | void |
880 | object::destroy (bool destroy_inventory) |
950 | object::destroy (bool destroy_inventory) |
881 | { |
951 | { |
882 | if (destroyed ()) |
952 | if (destroyed ()) |
883 | return; |
953 | return; |
884 | |
954 | |
885 | if (destroy_inventory) |
955 | if (destroy_inventory) |
886 | destroy_inv (false); |
956 | destroy_inv (false); |
|
|
957 | |
|
|
958 | if (is_head ()) |
|
|
959 | if (sound_destroy) |
|
|
960 | play_sound (sound_destroy); |
|
|
961 | else if (flag [FLAG_MONSTER]) |
|
|
962 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
887 | |
963 | |
888 | attachable::destroy (); |
964 | attachable::destroy (); |
889 | } |
965 | } |
890 | |
966 | |
891 | /* |
967 | /* |
… | |
… | |
1006 | if (map->in_memory == MAP_SAVING) |
1082 | if (map->in_memory == MAP_SAVING) |
1007 | return; |
1083 | return; |
1008 | |
1084 | |
1009 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1085 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1010 | |
1086 | |
|
|
1087 | if (object *pl = ms.player ()) |
|
|
1088 | { |
|
|
1089 | if (pl->container == this) |
|
|
1090 | /* If a container that the player is currently using somehow gets |
|
|
1091 | * removed (most likely destroyed), update the player view |
|
|
1092 | * appropriately. |
|
|
1093 | */ |
|
|
1094 | pl->close_container (); |
|
|
1095 | |
|
|
1096 | pl->contr->ns->floorbox_update (); |
|
|
1097 | } |
|
|
1098 | |
1011 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1099 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1012 | { |
1100 | { |
1013 | /* No point updating the players look faces if he is the object |
1101 | /* No point updating the players look faces if he is the object |
1014 | * being removed. |
1102 | * being removed. |
1015 | */ |
1103 | */ |
1016 | |
|
|
1017 | if (tmp->type == PLAYER && tmp != this) |
|
|
1018 | { |
|
|
1019 | /* If a container that the player is currently using somehow gets |
|
|
1020 | * removed (most likely destroyed), update the player view |
|
|
1021 | * appropriately. |
|
|
1022 | */ |
|
|
1023 | if (tmp->container == this) |
|
|
1024 | { |
|
|
1025 | flag [FLAG_APPLIED] = 0; |
|
|
1026 | tmp->container = 0; |
|
|
1027 | } |
|
|
1028 | |
|
|
1029 | if (tmp->contr->ns) |
|
|
1030 | tmp->contr->ns->floorbox_update (); |
|
|
1031 | } |
|
|
1032 | |
1104 | |
1033 | /* See if object moving off should effect something */ |
1105 | /* See if object moving off should effect something */ |
1034 | if (check_walk_off |
1106 | if (check_walk_off |
1035 | && ((move_type & tmp->move_off) |
1107 | && ((move_type & tmp->move_off) |
1036 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1108 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
… | |
… | |
1039 | |
1111 | |
1040 | if (destroyed ()) |
1112 | if (destroyed ()) |
1041 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1113 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1042 | } |
1114 | } |
1043 | |
1115 | |
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; |
1116 | last = tmp; |
1050 | } |
1117 | } |
1051 | |
1118 | |
1052 | /* last == NULL if there are no objects on this space */ |
1119 | /* last == NULL if there are no objects on this space */ |
1053 | //TODO: this makes little sense, why only update the topmost object? |
1120 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1096 | } |
1163 | } |
1097 | |
1164 | |
1098 | return 0; |
1165 | return 0; |
1099 | } |
1166 | } |
1100 | |
1167 | |
|
|
1168 | void |
|
|
1169 | object::expand_tail () |
|
|
1170 | { |
|
|
1171 | if (more) |
|
|
1172 | return; |
|
|
1173 | |
|
|
1174 | object *prev = this; |
|
|
1175 | |
|
|
1176 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
|
|
1177 | { |
|
|
1178 | object *op = arch_to_object (at); |
|
|
1179 | |
|
|
1180 | op->name = name; |
|
|
1181 | op->name_pl = name_pl; |
|
|
1182 | op->title = title; |
|
|
1183 | |
|
|
1184 | op->head = this; |
|
|
1185 | prev->more = op; |
|
|
1186 | |
|
|
1187 | prev = op; |
|
|
1188 | } |
|
|
1189 | } |
|
|
1190 | |
1101 | /* |
1191 | /* |
1102 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1192 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1103 | * job preparing multi-part monsters. |
1193 | * job preparing multi-part monsters. |
1104 | */ |
1194 | */ |
1105 | object * |
1195 | object * |
1106 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1196 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1107 | { |
1197 | { |
1108 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1198 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1109 | { |
1199 | { |
1110 | tmp->x = x + tmp->arch->clone.x; |
1200 | tmp->x = x + tmp->arch->x; |
1111 | tmp->y = y + tmp->arch->clone.y; |
1201 | tmp->y = y + tmp->arch->y; |
1112 | } |
1202 | } |
1113 | |
1203 | |
1114 | return insert_ob_in_map (op, m, originator, flag); |
1204 | return insert_ob_in_map (op, m, originator, flag); |
1115 | } |
1205 | } |
1116 | |
1206 | |
… | |
… | |
1135 | * just 'op' otherwise |
1225 | * just 'op' otherwise |
1136 | */ |
1226 | */ |
1137 | object * |
1227 | object * |
1138 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1228 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1139 | { |
1229 | { |
|
|
1230 | assert (!op->flag [FLAG_FREED]); |
|
|
1231 | |
1140 | object *tmp, *top, *floor = NULL; |
1232 | 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 | |
1233 | |
1151 | op->remove (); |
1234 | op->remove (); |
1152 | |
1235 | |
1153 | if (!m) |
|
|
1154 | { |
|
|
1155 | char *dump = dump_object (op); |
|
|
1156 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
|
|
1157 | free (dump); |
|
|
1158 | return op; |
|
|
1159 | } |
|
|
1160 | |
|
|
1161 | if (out_of_map (m, op->x, op->y)) |
1236 | if (out_of_map (m, op->x, op->y)) |
1162 | { |
1237 | { |
1163 | char *dump = dump_object (op); |
|
|
1164 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1238 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1165 | #ifdef MANY_CORES |
1239 | #ifdef MANY_CORES |
1166 | /* Better to catch this here, as otherwise the next use of this object |
1240 | /* 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 |
1241 | * is likely to cause a crash. Better to find out where it is getting |
1168 | * improperly inserted. |
1242 | * improperly inserted. |
1169 | */ |
1243 | */ |
1170 | abort (); |
1244 | abort (); |
1171 | #endif |
1245 | #endif |
1172 | free (dump); |
|
|
1173 | return op; |
1246 | return op; |
1174 | } |
1247 | } |
1175 | |
1248 | |
1176 | if (object *more = op->more) |
1249 | if (object *more = op->more) |
1177 | { |
|
|
1178 | if (!insert_ob_in_map (more, m, originator, flag)) |
1250 | 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; |
1251 | return 0; |
1184 | } |
|
|
1185 | } |
|
|
1186 | |
1252 | |
1187 | CLEAR_FLAG (op, FLAG_REMOVED); |
1253 | CLEAR_FLAG (op, FLAG_REMOVED); |
1188 | |
1254 | |
1189 | /* Ideally, the caller figures this out. However, it complicates a lot |
1255 | /* 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 |
1256 | * of areas of callers (eg, anything that uses find_free_spot would now |
… | |
… | |
1197 | mapspace &ms = op->ms (); |
1263 | mapspace &ms = op->ms (); |
1198 | |
1264 | |
1199 | /* this has to be done after we translate the coordinates. |
1265 | /* this has to be done after we translate the coordinates. |
1200 | */ |
1266 | */ |
1201 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1267 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1202 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1268 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1203 | if (object::can_merge (op, tmp)) |
1269 | if (object::can_merge (op, tmp)) |
1204 | { |
1270 | { |
1205 | op->nrof += tmp->nrof; |
1271 | op->nrof += tmp->nrof; |
1206 | tmp->destroy (); |
1272 | tmp->destroy (); |
1207 | } |
1273 | } |
… | |
… | |
1274 | * looks like instead of lots of conditions here. |
1340 | * looks like instead of lots of conditions here. |
1275 | * makes things faster, and effectively the same result. |
1341 | * makes things faster, and effectively the same result. |
1276 | */ |
1342 | */ |
1277 | |
1343 | |
1278 | /* Have object 'fall below' other objects that block view. |
1344 | /* Have object 'fall below' other objects that block view. |
1279 | * Unless those objects are exits, type 66 |
1345 | * Unless those objects are exits. |
1280 | * If INS_ON_TOP is used, don't do this processing |
1346 | * If INS_ON_TOP is used, don't do this processing |
1281 | * Need to find the object that in fact blocks view, otherwise |
1347 | * Need to find the object that in fact blocks view, otherwise |
1282 | * stacking is a bit odd. |
1348 | * stacking is a bit odd. |
1283 | */ |
1349 | */ |
1284 | if (!(flag & INS_ON_TOP) |
1350 | if (!(flag & INS_ON_TOP) |
1285 | && ms.flags () & P_BLOCKSVIEW |
1351 | && ms.flags () & P_BLOCKSVIEW |
1286 | && (op->face && !op->face->visibility)) |
1352 | && (op->face && !faces [op->face].visibility)) |
1287 | { |
1353 | { |
1288 | for (last = top; last != floor; last = last->below) |
1354 | for (last = top; last != floor; last = last->below) |
1289 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1355 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1290 | break; |
1356 | break; |
1291 | |
1357 | |
… | |
… | |
1296 | */ |
1362 | */ |
1297 | if (last && last->below && last != floor) |
1363 | if (last && last->below && last != floor) |
1298 | top = last->below; |
1364 | top = last->below; |
1299 | } |
1365 | } |
1300 | } /* If objects on this space */ |
1366 | } /* If objects on this space */ |
1301 | |
|
|
1302 | if (flag & INS_MAP_LOAD) |
1367 | if (flag & INS_MAP_LOAD) |
1303 | top = ms.top; |
1368 | top = ms.top; |
1304 | |
1369 | |
1305 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1370 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1306 | top = floor; |
1371 | top = floor; |
… | |
… | |
1341 | op->map->touch (); |
1406 | op->map->touch (); |
1342 | } |
1407 | } |
1343 | |
1408 | |
1344 | op->map->dirty = true; |
1409 | op->map->dirty = true; |
1345 | |
1410 | |
1346 | /* If we have a floor, we know the player, if any, will be above |
|
|
1347 | * it, so save a few ticks and start from there. |
|
|
1348 | */ |
|
|
1349 | if (!(flag & INS_MAP_LOAD)) |
1411 | if (!(flag & INS_MAP_LOAD)) |
1350 | if (object *pl = ms.player ()) |
1412 | if (object *pl = ms.player ()) |
1351 | if (pl->contr->ns) |
|
|
1352 | pl->contr->ns->floorbox_update (); |
1413 | pl->contr->ns->floorbox_update (); |
1353 | |
1414 | |
1354 | /* If this object glows, it may affect lighting conditions that are |
1415 | /* If this object glows, it may affect lighting conditions that are |
1355 | * visible to others on this map. But update_all_los is really |
1416 | * visible to others on this map. But update_all_los is really |
1356 | * an inefficient way to do this, as it means los for all players |
1417 | * an inefficient way to do this, as it means los for all players |
1357 | * on the map will get recalculated. The players could very well |
1418 | * on the map will get recalculated. The players could very well |
… | |
… | |
1376 | * blocked() and wall() work properly), and these flags are updated by |
1437 | * blocked() and wall() work properly), and these flags are updated by |
1377 | * update_object(). |
1438 | * update_object(). |
1378 | */ |
1439 | */ |
1379 | |
1440 | |
1380 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1441 | /* 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) |
1442 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1382 | { |
1443 | { |
1383 | if (check_move_on (op, originator)) |
1444 | if (check_move_on (op, originator)) |
1384 | return 0; |
1445 | return 0; |
1385 | |
1446 | |
1386 | /* If we are a multi part object, lets work our way through the check |
1447 | /* If we are a multi part object, lets work our way through the check |
1387 | * walk on's. |
1448 | * walk on's. |
1388 | */ |
1449 | */ |
1389 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1450 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1390 | if (check_move_on (tmp, originator)) |
1451 | if (check_move_on (tmp, originator)) |
1391 | return 0; |
1452 | return 0; |
1392 | } |
1453 | } |
1393 | |
1454 | |
1394 | return op; |
1455 | return op; |
… | |
… | |
1404 | object *tmp, *tmp1; |
1465 | object *tmp, *tmp1; |
1405 | |
1466 | |
1406 | /* first search for itself and remove any old instances */ |
1467 | /* first search for itself and remove any old instances */ |
1407 | |
1468 | |
1408 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1469 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1409 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1470 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1410 | tmp->destroy (); |
1471 | tmp->destroy (); |
1411 | |
1472 | |
1412 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1473 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1413 | |
1474 | |
1414 | tmp1->x = op->x; |
1475 | tmp1->x = op->x; |
… | |
… | |
1417 | } |
1478 | } |
1418 | |
1479 | |
1419 | object * |
1480 | object * |
1420 | object::insert_at (object *where, object *originator, int flags) |
1481 | object::insert_at (object *where, object *originator, int flags) |
1421 | { |
1482 | { |
1422 | where->map->insert (this, where->x, where->y, originator, flags); |
1483 | return where->map->insert (this, where->x, where->y, originator, flags); |
1423 | } |
1484 | } |
1424 | |
1485 | |
1425 | /* |
1486 | /* |
1426 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1487 | * 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 |
1488 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1467 | * the amount of an object. If the amount reaches 0, the object |
1528 | * the amount of an object. If the amount reaches 0, the object |
1468 | * is subsequently removed and freed. |
1529 | * is subsequently removed and freed. |
1469 | * |
1530 | * |
1470 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1531 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1471 | */ |
1532 | */ |
1472 | |
|
|
1473 | object * |
1533 | object * |
1474 | decrease_ob_nr (object *op, uint32 i) |
1534 | decrease_ob_nr (object *op, uint32 i) |
1475 | { |
1535 | { |
1476 | object *tmp; |
1536 | object *tmp; |
1477 | |
1537 | |
… | |
… | |
1552 | |
1612 | |
1553 | /* |
1613 | /* |
1554 | * add_weight(object, weight) adds the specified weight to an object, |
1614 | * add_weight(object, weight) adds the specified weight to an object, |
1555 | * and also updates how much the environment(s) is/are carrying. |
1615 | * and also updates how much the environment(s) is/are carrying. |
1556 | */ |
1616 | */ |
1557 | |
|
|
1558 | void |
1617 | void |
1559 | add_weight (object *op, signed long weight) |
1618 | add_weight (object *op, signed long weight) |
1560 | { |
1619 | { |
1561 | while (op != NULL) |
1620 | while (op != NULL) |
1562 | { |
1621 | { |
… | |
… | |
1577 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1636 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1578 | free (dump); |
1637 | free (dump); |
1579 | return op; |
1638 | return op; |
1580 | } |
1639 | } |
1581 | |
1640 | |
1582 | if (where->head) |
1641 | if (where->head_ () != where) |
1583 | { |
1642 | { |
1584 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1643 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1585 | where = where->head; |
1644 | where = where->head; |
1586 | } |
1645 | } |
1587 | |
1646 | |
1588 | return where->insert (op); |
1647 | return where->insert (op); |
1589 | } |
1648 | } |
… | |
… | |
1594 | * inside the object environment. |
1653 | * inside the object environment. |
1595 | * |
1654 | * |
1596 | * The function returns now pointer to inserted item, and return value can |
1655 | * The function returns now pointer to inserted item, and return value can |
1597 | * be != op, if items are merged. -Tero |
1656 | * be != op, if items are merged. -Tero |
1598 | */ |
1657 | */ |
1599 | |
|
|
1600 | object * |
1658 | object * |
1601 | object::insert (object *op) |
1659 | object::insert (object *op) |
1602 | { |
1660 | { |
1603 | object *tmp, *otmp; |
|
|
1604 | |
|
|
1605 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1661 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1606 | op->remove (); |
1662 | op->remove (); |
1607 | |
1663 | |
1608 | if (op->more) |
1664 | if (op->more) |
1609 | { |
1665 | { |
… | |
… | |
1611 | return op; |
1667 | return op; |
1612 | } |
1668 | } |
1613 | |
1669 | |
1614 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1670 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1615 | CLEAR_FLAG (op, FLAG_REMOVED); |
1671 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1672 | |
1616 | if (op->nrof) |
1673 | if (op->nrof) |
1617 | { |
1674 | { |
1618 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1675 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1619 | if (object::can_merge (tmp, op)) |
1676 | if (object::can_merge (tmp, op)) |
1620 | { |
1677 | { |
1621 | /* return the original object and remove inserted object |
1678 | /* return the original object and remove inserted object |
1622 | (client needs the original object) */ |
1679 | (client needs the original object) */ |
1623 | tmp->nrof += op->nrof; |
1680 | tmp->nrof += op->nrof; |
… | |
… | |
1642 | add_weight (this, op->weight * op->nrof); |
1699 | add_weight (this, op->weight * op->nrof); |
1643 | } |
1700 | } |
1644 | else |
1701 | else |
1645 | add_weight (this, (op->weight + op->carrying)); |
1702 | add_weight (this, (op->weight + op->carrying)); |
1646 | |
1703 | |
1647 | otmp = this->in_player (); |
1704 | if (object *otmp = this->in_player ()) |
1648 | if (otmp && otmp->contr) |
|
|
1649 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1705 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1650 | otmp->update_stats (); |
1706 | otmp->update_stats (); |
1651 | |
1707 | |
|
|
1708 | op->owner = 0; // its his/hers now. period. |
1652 | op->map = 0; |
1709 | op->map = 0; |
1653 | op->env = this; |
1710 | op->env = this; |
1654 | op->above = 0; |
1711 | op->above = 0; |
1655 | op->below = 0; |
1712 | op->below = 0; |
1656 | op->x = 0, op->y = 0; |
1713 | op->x = op->y = 0; |
1657 | |
1714 | |
1658 | /* reset the light list and los of the players on the map */ |
1715 | /* reset the light list and los of the players on the map */ |
1659 | if ((op->glow_radius != 0) && map) |
1716 | if (op->glow_radius && map) |
1660 | { |
1717 | { |
1661 | #ifdef DEBUG_LIGHTS |
1718 | #ifdef DEBUG_LIGHTS |
1662 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1719 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1663 | #endif /* DEBUG_LIGHTS */ |
1720 | #endif /* DEBUG_LIGHTS */ |
1664 | if (map->darkness) |
1721 | if (map->darkness) |
… | |
… | |
1918 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1975 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1919 | { |
1976 | { |
1920 | CLEAR_FLAG (tmp, flag); |
1977 | CLEAR_FLAG (tmp, flag); |
1921 | unflag_inv (tmp, flag); |
1978 | unflag_inv (tmp, flag); |
1922 | } |
1979 | } |
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 | } |
1980 | } |
1937 | |
1981 | |
1938 | /* |
1982 | /* |
1939 | * find_free_spot(object, map, x, y, start, stop) will search for |
1983 | * 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 |
1984 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
2058 | object *tmp; |
2102 | object *tmp; |
2059 | maptile *mp; |
2103 | maptile *mp; |
2060 | |
2104 | |
2061 | MoveType blocked, move_type; |
2105 | MoveType blocked, move_type; |
2062 | |
2106 | |
2063 | if (exclude && exclude->head) |
2107 | if (exclude && exclude->head_ () != exclude) |
2064 | { |
2108 | { |
2065 | exclude = exclude->head; |
2109 | exclude = exclude->head; |
2066 | move_type = exclude->move_type; |
2110 | move_type = exclude->move_type; |
2067 | } |
2111 | } |
2068 | else |
2112 | else |
… | |
… | |
2091 | max = maxfree[i]; |
2135 | max = maxfree[i]; |
2092 | else if (mflags & P_IS_ALIVE) |
2136 | else if (mflags & P_IS_ALIVE) |
2093 | { |
2137 | { |
2094 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2138 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2095 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2139 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2096 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2140 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2097 | break; |
2141 | break; |
2098 | |
2142 | |
2099 | if (tmp) |
2143 | if (tmp) |
2100 | return freedir[i]; |
2144 | return freedir[i]; |
2101 | } |
2145 | } |
… | |
… | |
2281 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2325 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2282 | * core dumps if they do. |
2326 | * core dumps if they do. |
2283 | * |
2327 | * |
2284 | * Add a check so we can't pick up invisible objects (0.93.8) |
2328 | * Add a check so we can't pick up invisible objects (0.93.8) |
2285 | */ |
2329 | */ |
2286 | |
|
|
2287 | int |
2330 | int |
2288 | can_pick (const object *who, const object *item) |
2331 | can_pick (const object *who, const object *item) |
2289 | { |
2332 | { |
2290 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2333 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2291 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2334 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
… | |
… | |
2296 | * create clone from object to another |
2339 | * create clone from object to another |
2297 | */ |
2340 | */ |
2298 | object * |
2341 | object * |
2299 | object_create_clone (object *asrc) |
2342 | object_create_clone (object *asrc) |
2300 | { |
2343 | { |
2301 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2344 | object *dst = 0, *tmp, *src, *prev, *item; |
2302 | |
2345 | |
2303 | if (!asrc) |
2346 | if (!asrc) |
2304 | return 0; |
2347 | return 0; |
2305 | |
2348 | |
2306 | src = asrc; |
|
|
2307 | if (src->head) |
|
|
2308 | src = src->head; |
2349 | src = asrc->head_ (); |
2309 | |
2350 | |
2310 | prev = 0; |
2351 | prev = 0; |
2311 | for (part = src; part; part = part->more) |
2352 | for (object *part = src; part; part = part->more) |
2312 | { |
2353 | { |
2313 | tmp = part->clone (); |
2354 | tmp = part->clone (); |
2314 | tmp->x -= src->x; |
2355 | tmp->x -= src->x; |
2315 | tmp->y -= src->y; |
2356 | tmp->y -= src->y; |
2316 | |
2357 | |
… | |
… | |
2334 | insert_ob_in_ob (object_create_clone (item), dst); |
2375 | insert_ob_in_ob (object_create_clone (item), dst); |
2335 | |
2376 | |
2336 | return dst; |
2377 | return dst; |
2337 | } |
2378 | } |
2338 | |
2379 | |
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 |
2380 | /* This returns the first object in who's inventory that |
2378 | * has the same type and subtype match. |
2381 | * has the same type and subtype match. |
2379 | * returns NULL if no match. |
2382 | * returns NULL if no match. |
2380 | */ |
2383 | */ |
2381 | object * |
2384 | object * |
… | |
… | |
2434 | if (link->key == canonical_key) |
2437 | if (link->key == canonical_key) |
2435 | return link->value; |
2438 | return link->value; |
2436 | |
2439 | |
2437 | return 0; |
2440 | return 0; |
2438 | } |
2441 | } |
2439 | |
|
|
2440 | |
2442 | |
2441 | /* |
2443 | /* |
2442 | * Updates the canonical_key in op to value. |
2444 | * Updates the canonical_key in op to value. |
2443 | * |
2445 | * |
2444 | * canonical_key is a shared string (value doesn't have to be). |
2446 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2468 | /* Basically, if the archetype has this key set, |
2470 | /* Basically, if the archetype has this key set, |
2469 | * we need to store the null value so when we save |
2471 | * we need to store the null value so when we save |
2470 | * it, we save the empty value so that when we load, |
2472 | * it, we save the empty value so that when we load, |
2471 | * we get this value back again. |
2473 | * we get this value back again. |
2472 | */ |
2474 | */ |
2473 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2475 | if (get_ob_key_link (op->arch, canonical_key)) |
2474 | field->value = 0; |
2476 | field->value = 0; |
2475 | else |
2477 | else |
2476 | { |
2478 | { |
2477 | if (last) |
2479 | if (last) |
2478 | last->next = field->next; |
2480 | last->next = field->next; |
… | |
… | |
2547 | } |
2549 | } |
2548 | else |
2550 | else |
2549 | item = item->env; |
2551 | item = item->env; |
2550 | } |
2552 | } |
2551 | |
2553 | |
2552 | |
|
|
2553 | const char * |
2554 | const char * |
2554 | object::flag_desc (char *desc, int len) const |
2555 | object::flag_desc (char *desc, int len) const |
2555 | { |
2556 | { |
2556 | char *p = desc; |
2557 | char *p = desc; |
2557 | bool first = true; |
2558 | bool first = true; |
… | |
… | |
2591 | &name, |
2592 | &name, |
2592 | title ? "\",title:\"" : "", |
2593 | title ? "\",title:\"" : "", |
2593 | title ? (const char *)title : "", |
2594 | title ? (const char *)title : "", |
2594 | flag_desc (flagdesc, 512), type); |
2595 | flag_desc (flagdesc, 512), type); |
2595 | |
2596 | |
2596 | if (env) |
2597 | if (!this->flag[FLAG_REMOVED] && env) |
2597 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2598 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2598 | |
2599 | |
2599 | if (map) |
2600 | if (map) |
2600 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2601 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2601 | |
2602 | |
… | |
… | |
2603 | } |
2604 | } |
2604 | |
2605 | |
2605 | const char * |
2606 | const char * |
2606 | object::debug_desc () const |
2607 | object::debug_desc () const |
2607 | { |
2608 | { |
2608 | static char info[256 * 4]; |
2609 | static char info[3][256 * 4]; |
|
|
2610 | static int info_idx; |
|
|
2611 | |
2609 | return debug_desc (info); |
2612 | 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 | } |
2613 | } |
2618 | |
2614 | |
2619 | struct region * |
2615 | struct region * |
2620 | object::region () const |
2616 | object::region () const |
2621 | { |
2617 | { |
… | |
… | |
2624 | } |
2620 | } |
2625 | |
2621 | |
2626 | const materialtype_t * |
2622 | const materialtype_t * |
2627 | object::dominant_material () const |
2623 | object::dominant_material () const |
2628 | { |
2624 | { |
2629 | if (materialtype_t *mat = name_to_material (materialname)) |
2625 | if (materialtype_t *mt = name_to_material (materialname)) |
2630 | return mat; |
2626 | return mt; |
2631 | |
2627 | |
2632 | // omfg this is slow, this has to be temporary :) |
|
|
2633 | shstr unknown ("unknown"); |
|
|
2634 | |
|
|
2635 | return name_to_material (unknown); |
2628 | return name_to_material (shstr_unknown); |
2636 | } |
2629 | } |
2637 | |
2630 | |
2638 | void |
2631 | void |
2639 | object::open_container (object *new_container) |
2632 | object::open_container (object *new_container) |
2640 | { |
2633 | { |
… | |
… | |
2656 | old_container->flag [FLAG_APPLIED] = 0; |
2649 | old_container->flag [FLAG_APPLIED] = 0; |
2657 | container = 0; |
2650 | container = 0; |
2658 | |
2651 | |
2659 | esrv_update_item (UPD_FLAGS, this, old_container); |
2652 | esrv_update_item (UPD_FLAGS, this, old_container); |
2660 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2653 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2654 | play_sound (sound_find ("chest_close")); |
2661 | } |
2655 | } |
2662 | |
2656 | |
2663 | if (new_container) |
2657 | if (new_container) |
2664 | { |
2658 | { |
2665 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
2659 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
… | |
… | |
2681 | new_container->flag [FLAG_APPLIED] = 1; |
2675 | new_container->flag [FLAG_APPLIED] = 1; |
2682 | container = new_container; |
2676 | container = new_container; |
2683 | |
2677 | |
2684 | esrv_update_item (UPD_FLAGS, this, new_container); |
2678 | esrv_update_item (UPD_FLAGS, this, new_container); |
2685 | esrv_send_inventory (this, new_container); |
2679 | esrv_send_inventory (this, new_container); |
|
|
2680 | play_sound (sound_find ("chest_open")); |
|
|
2681 | } |
|
|
2682 | } |
|
|
2683 | |
|
|
2684 | object * |
|
|
2685 | object::force_find (const shstr name) |
|
|
2686 | { |
|
|
2687 | /* cycle through his inventory to look for the MARK we want to |
|
|
2688 | * place |
|
|
2689 | */ |
|
|
2690 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2691 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2692 | return splay (tmp); |
|
|
2693 | |
|
|
2694 | return 0; |
|
|
2695 | } |
|
|
2696 | |
|
|
2697 | void |
|
|
2698 | object::force_add (const shstr name, int duration) |
|
|
2699 | { |
|
|
2700 | if (object *force = force_find (name)) |
|
|
2701 | force->destroy (); |
|
|
2702 | |
|
|
2703 | object *force = get_archetype (FORCE_NAME); |
|
|
2704 | |
|
|
2705 | force->slaying = name; |
|
|
2706 | force->stats.food = 1; |
|
|
2707 | force->speed_left = -1.f; |
|
|
2708 | |
|
|
2709 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2710 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2711 | force->flag [FLAG_APPLIED] = true; |
|
|
2712 | |
|
|
2713 | insert (force); |
|
|
2714 | } |
|
|
2715 | |
|
|
2716 | void |
|
|
2717 | object::play_sound (faceidx sound) const |
|
|
2718 | { |
|
|
2719 | if (!sound) |
|
|
2720 | return; |
|
|
2721 | |
|
|
2722 | if (flag [FLAG_REMOVED]) |
|
|
2723 | return; |
|
|
2724 | |
|
|
2725 | if (env) |
2686 | } |
2726 | { |
|
|
2727 | if (object *pl = in_player ()) |
|
|
2728 | pl->contr->play_sound (sound); |
|
|
2729 | } |
|
|
2730 | else |
|
|
2731 | map->play_sound (sound, x, y); |
2687 | } |
2732 | } |
2688 | |
2733 | |
2689 | |
|
|