1 | |
|
|
2 | /* |
1 | /* |
3 | CrossFire, A Multiplayer game for X-windows |
2 | CrossFire, A Multiplayer game for X-windows |
4 | |
3 | |
5 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
4 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
6 | Copyright (C) 1992 Frank Tore Johansen |
5 | Copyright (C) 1992 Frank Tore Johansen |
… | |
… | |
17 | |
16 | |
18 | You should have received a copy of the GNU General Public License |
17 | You should have received a copy of the GNU General Public License |
19 | along with this program; if not, write to the Free Software |
18 | along with this program; if not, write to the Free Software |
20 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
21 | |
20 | |
22 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
21 | The authors can be reached via e-mail at <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. */ |
… | |
… | |
35 | |
34 | |
36 | int nrofallocobjects = 0; |
35 | int nrofallocobjects = 0; |
37 | static UUID uuid; |
36 | static UUID uuid; |
38 | const uint64 UUID_SKIP = 1<<19; |
37 | const uint64 UUID_SKIP = 1<<19; |
39 | |
38 | |
40 | object *objects; /* Pointer to the list of used objects */ |
|
|
41 | object *active_objects; /* List of active objects that need to be processed */ |
39 | object *active_objects; /* List of active objects that need to be processed */ |
42 | |
40 | |
43 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
41 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
44 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
42 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
45 | }; |
43 | }; |
… | |
… | |
376 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
374 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
377 | * Some error messages. |
375 | * Some error messages. |
378 | * The result of the dump is stored in the static global errmsg array. |
376 | * The result of the dump is stored in the static global errmsg array. |
379 | */ |
377 | */ |
380 | |
378 | |
381 | void |
379 | char * |
382 | dump_object2 (object *op) |
|
|
383 | { |
|
|
384 | errmsg[0] = 0; |
|
|
385 | return; |
|
|
386 | //TODO//D#d# |
|
|
387 | #if 0 |
|
|
388 | char *cp; |
|
|
389 | |
|
|
390 | /* object *tmp;*/ |
|
|
391 | |
|
|
392 | if (op->arch != NULL) |
|
|
393 | { |
|
|
394 | strcat (errmsg, "arch "); |
|
|
395 | strcat (errmsg, op->arch->name ? op->arch->name : "(null)"); |
|
|
396 | strcat (errmsg, "\n"); |
|
|
397 | if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL) |
|
|
398 | strcat (errmsg, cp); |
|
|
399 | # if 0 |
|
|
400 | /* Don't dump player diffs - they are too long, mostly meaningless, and |
|
|
401 | * will overflow the buffer. |
|
|
402 | * Changed so that we don't dump inventory either. This may |
|
|
403 | * also overflow the buffer. |
|
|
404 | */ |
|
|
405 | if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL) |
|
|
406 | strcat (errmsg, cp); |
|
|
407 | for (tmp = op->inv; tmp; tmp = tmp->below) |
|
|
408 | dump_object2 (tmp); |
|
|
409 | # endif |
|
|
410 | strcat (errmsg, "end\n"); |
|
|
411 | } |
|
|
412 | else |
|
|
413 | { |
|
|
414 | strcat (errmsg, "Object "); |
|
|
415 | if (op->name == NULL) |
|
|
416 | strcat (errmsg, "(null)"); |
|
|
417 | else |
|
|
418 | strcat (errmsg, op->name); |
|
|
419 | strcat (errmsg, "\n"); |
|
|
420 | # if 0 |
|
|
421 | if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL) |
|
|
422 | strcat (errmsg, cp); |
|
|
423 | for (tmp = op->inv; tmp; tmp = tmp->below) |
|
|
424 | dump_object2 (tmp); |
|
|
425 | # endif |
|
|
426 | strcat (errmsg, "end\n"); |
|
|
427 | } |
|
|
428 | #endif |
|
|
429 | } |
|
|
430 | |
|
|
431 | /* |
|
|
432 | * Dumps an object. Returns output in the static global errmsg array. |
|
|
433 | */ |
|
|
434 | |
|
|
435 | void |
|
|
436 | dump_object (object *op) |
380 | dump_object (object *op) |
437 | { |
381 | { |
438 | if (op == NULL) |
382 | if (!op) |
439 | { |
383 | return strdup ("[NULLOBJ]"); |
440 | strcpy (errmsg, "[NULL pointer]"); |
|
|
441 | return; |
|
|
442 | } |
|
|
443 | errmsg[0] = '\0'; |
|
|
444 | dump_object2 (op); |
|
|
445 | } |
|
|
446 | |
384 | |
447 | void |
385 | object_freezer freezer; |
448 | dump_all_objects (void) |
386 | save_object (freezer, op, 3); |
449 | { |
387 | return freezer.as_string (); |
450 | object *op; |
|
|
451 | |
|
|
452 | for (op = objects; op != NULL; op = op->next) |
|
|
453 | { |
|
|
454 | dump_object (op); |
|
|
455 | fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg); |
|
|
456 | } |
|
|
457 | } |
388 | } |
458 | |
389 | |
459 | /* |
390 | /* |
460 | * get_nearest_part(multi-object, object 2) returns the part of the |
391 | * get_nearest_part(multi-object, object 2) returns the part of the |
461 | * multi-object 1 which is closest to the second object. |
392 | * multi-object 1 which is closest to the second object. |
… | |
… | |
481 | */ |
412 | */ |
482 | |
413 | |
483 | object * |
414 | object * |
484 | find_object (tag_t i) |
415 | find_object (tag_t i) |
485 | { |
416 | { |
486 | object *op; |
417 | for (object *op = object::first; op; op = op->next) |
487 | |
|
|
488 | for (op = objects; op != NULL; op = op->next) |
|
|
489 | if (op->count == i) |
418 | if (op->count == i) |
490 | break; |
419 | return op; |
|
|
420 | |
491 | return op; |
421 | return 0; |
492 | } |
422 | } |
493 | |
423 | |
494 | /* |
424 | /* |
495 | * Returns the first object which has a name equal to the argument. |
425 | * Returns the first object which has a name equal to the argument. |
496 | * Used only by the patch command, but not all that useful. |
426 | * Used only by the patch command, but not all that useful. |
… | |
… | |
501 | find_object_name (const char *str) |
431 | find_object_name (const char *str) |
502 | { |
432 | { |
503 | shstr_cmp str_ (str); |
433 | shstr_cmp str_ (str); |
504 | object *op; |
434 | object *op; |
505 | |
435 | |
506 | for (op = objects; op != NULL; op = op->next) |
436 | for (op = object::first; op != NULL; op = op->next) |
507 | if (op->name == str_) |
437 | if (op->name == str_) |
508 | break; |
438 | break; |
509 | |
439 | |
510 | return op; |
440 | return op; |
511 | } |
441 | } |
512 | |
442 | |
513 | void |
443 | void |
514 | free_all_object_data () |
444 | free_all_object_data () |
515 | { |
445 | { |
516 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
446 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
517 | } |
|
|
518 | |
|
|
519 | /* |
|
|
520 | * Returns the object which this object marks as being the owner. |
|
|
521 | * A id-scheme is used to avoid pointing to objects which have been |
|
|
522 | * freed and are now reused. If this is detected, the owner is |
|
|
523 | * set to NULL, and NULL is returned. |
|
|
524 | * Changed 2004-02-12 - if the player is setting at the play again |
|
|
525 | * prompt, he is removed, and we don't want to treat him as an owner of |
|
|
526 | * anything, so check removed flag. I don't expect that this should break |
|
|
527 | * anything - once an object is removed, it is basically dead anyways. |
|
|
528 | */ |
|
|
529 | object * |
|
|
530 | object::get_owner () |
|
|
531 | { |
|
|
532 | if (!owner |
|
|
533 | || QUERY_FLAG (owner, FLAG_FREED) |
|
|
534 | || QUERY_FLAG (owner, FLAG_REMOVED)) |
|
|
535 | owner = 0; |
|
|
536 | |
|
|
537 | return owner; |
|
|
538 | } |
447 | } |
539 | |
448 | |
540 | /* |
449 | /* |
541 | * Sets the owner and sets the skill and exp pointers to owner's current |
450 | * Sets the owner and sets the skill and exp pointers to owner's current |
542 | * skill and experience objects. |
451 | * skill and experience objects. |
… | |
… | |
612 | |
521 | |
613 | /* What is not cleared is next, prev, and count */ |
522 | /* What is not cleared is next, prev, and count */ |
614 | |
523 | |
615 | expmul = 1.0; |
524 | expmul = 1.0; |
616 | face = blank_face; |
525 | face = blank_face; |
617 | attacked_by_count = -1; |
|
|
618 | |
526 | |
619 | if (settings.casting_time) |
527 | if (settings.casting_time) |
620 | casting_time = -1; |
528 | casting_time = -1; |
621 | } |
529 | } |
622 | |
530 | |
… | |
… | |
917 | |
825 | |
918 | if (op->more != NULL) |
826 | if (op->more != NULL) |
919 | update_object (op->more, action); |
827 | update_object (op->more, action); |
920 | } |
828 | } |
921 | |
829 | |
922 | static unordered_vector<object *> mortals; |
830 | object::vector object::mortals; |
923 | static std::vector<object *, slice_allocator <object *> > freed; |
831 | object::vector object::objects; // not yet used |
|
|
832 | object *object::first; |
924 | |
833 | |
925 | void object::free_mortals () |
834 | void object::free_mortals () |
926 | { |
835 | { |
927 | for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();) |
836 | for (AUTODECL (i, mortals.begin ()); i != mortals.end ();) |
928 | if ((*i)->refcnt) |
837 | if ((*i)->refcnt) |
929 | ++i; // further delay freeing |
838 | ++i; // further delay freeing |
930 | else |
839 | else |
931 | { |
840 | { |
932 | //printf ("free_mortal(%p,%ld,%ld)\n", *i, pticks, (*i)->count);//D |
|
|
933 | //freed.push_back (*i);//D |
|
|
934 | delete *i; |
841 | delete *i; |
935 | mortals.erase (i); |
842 | mortals.erase (i); |
936 | } |
843 | } |
937 | |
844 | |
938 | if (mortals.size() && 0)//D |
845 | static int lastmortals = 0;//D |
|
|
846 | |
|
|
847 | if (mortals.size() != lastmortals && lastmortals > 100)//D |
|
|
848 | { |
|
|
849 | lastmortals = mortals.size ();//D |
939 | LOG (llevDebug, "%d objects in mortal queue\n", mortals.size());//D |
850 | LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D |
|
|
851 | } |
940 | } |
852 | } |
941 | |
853 | |
942 | object::object () |
854 | object::object () |
943 | { |
855 | { |
944 | SET_FLAG (this, FLAG_REMOVED); |
856 | SET_FLAG (this, FLAG_REMOVED); |
945 | |
857 | |
946 | expmul = 1.0; |
858 | expmul = 1.0; |
947 | face = blank_face; |
859 | face = blank_face; |
948 | attacked_by_count = -1; |
|
|
949 | } |
860 | } |
950 | |
861 | |
951 | object::~object () |
862 | object::~object () |
952 | { |
863 | { |
953 | free_key_values (this); |
864 | free_key_values (this); |
… | |
… | |
957 | { |
868 | { |
958 | count = ++ob_count; |
869 | count = ++ob_count; |
959 | uuid = gen_uuid (); |
870 | uuid = gen_uuid (); |
960 | |
871 | |
961 | prev = 0; |
872 | prev = 0; |
962 | next = objects; |
873 | next = object::first; |
963 | |
874 | |
964 | if (objects) |
875 | if (object::first) |
965 | objects->prev = this; |
876 | object::first->prev = this; |
966 | |
877 | |
967 | objects = this; |
878 | object::first = this; |
968 | } |
879 | } |
969 | |
880 | |
970 | void object::unlink () |
881 | void object::unlink () |
971 | { |
882 | { |
972 | //count = 0;//D |
|
|
973 | if (!prev && !next) return;//D |
|
|
974 | |
|
|
975 | if (this == objects) |
883 | if (this == object::first) |
976 | objects = next; |
884 | object::first = next; |
977 | |
885 | |
978 | /* Remove this object from the list of used objects */ |
886 | /* Remove this object from the list of used objects */ |
979 | if (prev) prev->next = next; |
887 | if (prev) prev->next = next; |
980 | if (next) next->prev = prev; |
888 | if (next) next->prev = prev; |
981 | |
889 | |
… | |
… | |
983 | next = 0; |
891 | next = 0; |
984 | } |
892 | } |
985 | |
893 | |
986 | object *object::create () |
894 | object *object::create () |
987 | { |
895 | { |
988 | object *op; |
|
|
989 | |
|
|
990 | if (freed.empty ()) |
|
|
991 | op = new object; |
896 | object *op = new object; |
992 | else |
|
|
993 | { |
|
|
994 | // highly annoying, but the only way to get it stable right now |
|
|
995 | op = freed.back (); |
|
|
996 | freed.pop_back (); |
|
|
997 | op->~object (); |
|
|
998 | new ((void *) op) object; |
|
|
999 | } |
|
|
1000 | |
|
|
1001 | op->link (); |
897 | op->link (); |
1002 | return op; |
898 | return op; |
1003 | } |
899 | } |
1004 | |
900 | |
1005 | /* |
901 | /* |
… | |
… | |
1007 | * it from the list of used objects, and puts it on the list of |
903 | * it from the list of used objects, and puts it on the list of |
1008 | * free objects. The IS_FREED() flag is set in the object. |
904 | * free objects. The IS_FREED() flag is set in the object. |
1009 | * The object must have been removed by remove_ob() first for |
905 | * The object must have been removed by remove_ob() first for |
1010 | * this function to succeed. |
906 | * this function to succeed. |
1011 | * |
907 | * |
1012 | * If free_inventory is set, free inventory as well. Else drop items in |
908 | * If destroy_inventory is set, free inventory as well. Else drop items in |
1013 | * inventory to the ground. |
909 | * inventory to the ground. |
1014 | */ |
910 | */ |
1015 | void object::free (bool free_inventory) |
911 | void object::destroy (bool destroy_inventory) |
1016 | { |
912 | { |
1017 | if (QUERY_FLAG (this, FLAG_FREED)) |
913 | if (QUERY_FLAG (this, FLAG_FREED)) |
1018 | return; |
914 | return; |
1019 | |
915 | |
1020 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
916 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
… | |
… | |
1023 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
919 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
1024 | remove_ob (this); |
920 | remove_ob (this); |
1025 | |
921 | |
1026 | SET_FLAG (this, FLAG_FREED); |
922 | SET_FLAG (this, FLAG_FREED); |
1027 | |
923 | |
1028 | //printf ("free(%p,%ld,%ld)\n", this, pticks, count);//D |
|
|
1029 | |
|
|
1030 | if (more) |
924 | if (more) |
1031 | { |
925 | { |
1032 | more->free (free_inventory); |
926 | more->destroy (destroy_inventory); |
1033 | more = 0; |
927 | more = 0; |
1034 | } |
928 | } |
1035 | |
929 | |
1036 | if (inv) |
930 | if (inv) |
1037 | { |
931 | { |
1038 | /* Only if the space blocks everything do we not process - |
932 | /* Only if the space blocks everything do we not process - |
1039 | * if some form of movement is allowed, let objects |
933 | * if some form of movement is allowed, let objects |
1040 | * drop on that space. |
934 | * drop on that space. |
1041 | */ |
935 | */ |
1042 | if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
936 | if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
1043 | { |
937 | { |
1044 | object *op = inv; |
938 | object *op = inv; |
1045 | |
939 | |
1046 | while (op) |
940 | while (op) |
1047 | { |
941 | { |
1048 | object *tmp = op->below; |
942 | object *tmp = op->below; |
1049 | op->free (free_inventory); |
943 | op->destroy (destroy_inventory); |
1050 | op = tmp; |
944 | op = tmp; |
1051 | } |
945 | } |
1052 | } |
946 | } |
1053 | else |
947 | else |
1054 | { /* Put objects in inventory onto this space */ |
948 | { /* Put objects in inventory onto this space */ |
… | |
… | |
1073 | op = tmp; |
967 | op = tmp; |
1074 | } |
968 | } |
1075 | } |
969 | } |
1076 | } |
970 | } |
1077 | |
971 | |
|
|
972 | // clear those pointers that likely might have circular references to us |
1078 | owner = 0; |
973 | owner = 0; |
|
|
974 | enemy = 0; |
|
|
975 | attacked_by = 0; |
|
|
976 | |
|
|
977 | // only relevant for players(?), but make sure of it anyways |
|
|
978 | contr = 0; |
1079 | |
979 | |
1080 | /* Remove object from the active list */ |
980 | /* Remove object from the active list */ |
1081 | speed = 0; |
981 | speed = 0; |
1082 | update_ob_speed (this); |
982 | update_ob_speed (this); |
1083 | |
983 | |
… | |
… | |
1095 | sub_weight (object *op, signed long weight) |
995 | sub_weight (object *op, signed long weight) |
1096 | { |
996 | { |
1097 | while (op != NULL) |
997 | while (op != NULL) |
1098 | { |
998 | { |
1099 | if (op->type == CONTAINER) |
999 | if (op->type == CONTAINER) |
1100 | { |
|
|
1101 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
1000 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
1102 | } |
1001 | |
1103 | op->carrying -= weight; |
1002 | op->carrying -= weight; |
1104 | op = op->env; |
1003 | op = op->env; |
1105 | } |
1004 | } |
1106 | } |
1005 | } |
1107 | |
1006 | |
… | |
… | |
1115 | */ |
1014 | */ |
1116 | |
1015 | |
1117 | void |
1016 | void |
1118 | remove_ob (object *op) |
1017 | remove_ob (object *op) |
1119 | { |
1018 | { |
|
|
1019 | object *tmp, *last = 0; |
1120 | object * |
1020 | object *otmp; |
1121 | tmp, * |
|
|
1122 | last = NULL; |
|
|
1123 | object * |
|
|
1124 | otmp; |
|
|
1125 | |
1021 | |
1126 | tag_t |
|
|
1127 | tag; |
|
|
1128 | int |
|
|
1129 | check_walk_off; |
1022 | int check_walk_off; |
1130 | mapstruct * |
1023 | maptile *m; |
1131 | m; |
|
|
1132 | |
1024 | |
1133 | sint16 |
1025 | sint16 x, y; |
1134 | x, |
|
|
1135 | y; |
|
|
1136 | |
1026 | |
1137 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1027 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1138 | return; |
1028 | return; |
1139 | |
1029 | |
1140 | SET_FLAG (op, FLAG_REMOVED); |
1030 | SET_FLAG (op, FLAG_REMOVED); |
… | |
… | |
1217 | * use translated coordinates in case some oddness with map tiling is |
1107 | * use translated coordinates in case some oddness with map tiling is |
1218 | * evident |
1108 | * evident |
1219 | */ |
1109 | */ |
1220 | if (GET_MAP_OB (m, x, y) != op) |
1110 | if (GET_MAP_OB (m, x, y) != op) |
1221 | { |
1111 | { |
1222 | dump_object (op); |
1112 | char *dump = dump_object (op); |
1223 | LOG (llevError, |
1113 | LOG (llevError, |
1224 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg); |
1114 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); |
|
|
1115 | free (dump); |
1225 | dump_object (GET_MAP_OB (m, x, y)); |
1116 | dump = dump_object (GET_MAP_OB (m, x, y)); |
1226 | LOG (llevError, "%s\n", errmsg); |
1117 | LOG (llevError, "%s\n", dump); |
|
|
1118 | free (dump); |
1227 | } |
1119 | } |
1228 | |
1120 | |
1229 | SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ |
1121 | SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ |
1230 | } |
1122 | } |
1231 | |
1123 | |
… | |
… | |
1233 | op->below = 0; |
1125 | op->below = 0; |
1234 | |
1126 | |
1235 | if (op->map->in_memory == MAP_SAVING) |
1127 | if (op->map->in_memory == MAP_SAVING) |
1236 | return; |
1128 | return; |
1237 | |
1129 | |
1238 | tag = op->count; |
|
|
1239 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
1130 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
1240 | |
1131 | |
1241 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1132 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1242 | { |
1133 | { |
1243 | /* No point updating the players look faces if he is the object |
1134 | /* No point updating the players look faces if he is the object |
… | |
… | |
1258 | |
1149 | |
1259 | tmp->contr->socket.update_look = 1; |
1150 | tmp->contr->socket.update_look = 1; |
1260 | } |
1151 | } |
1261 | |
1152 | |
1262 | /* See if player moving off should effect something */ |
1153 | /* See if player moving off should effect something */ |
1263 | if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1154 | if (check_walk_off |
|
|
1155 | && ((op->move_type & tmp->move_off) |
|
|
1156 | && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1264 | { |
1157 | { |
1265 | move_apply (tmp, op, NULL); |
1158 | move_apply (tmp, op, NULL); |
1266 | |
1159 | |
1267 | if (was_destroyed (op, tag)) |
1160 | if (op->destroyed ()) |
1268 | { |
|
|
1269 | LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); |
1161 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1270 | } |
|
|
1271 | } |
1162 | } |
1272 | |
1163 | |
1273 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1164 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1274 | |
1165 | |
1275 | if (tmp->above == tmp) |
1166 | if (tmp->above == tmp) |
… | |
… | |
1328 | free_object (op); |
1219 | free_object (op); |
1329 | return top; |
1220 | return top; |
1330 | } |
1221 | } |
1331 | } |
1222 | } |
1332 | |
1223 | |
1333 | return NULL; |
1224 | return 0; |
1334 | } |
1225 | } |
1335 | |
1226 | |
1336 | /* |
1227 | /* |
1337 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1228 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1338 | * job preparing multi-part monsters |
1229 | * job preparing multi-part monsters |
1339 | */ |
1230 | */ |
1340 | object * |
1231 | object * |
1341 | insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) |
1232 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1342 | { |
1233 | { |
1343 | object *tmp; |
1234 | object *tmp; |
1344 | |
1235 | |
1345 | if (op->head) |
1236 | if (op->head) |
1346 | op = op->head; |
1237 | op = op->head; |
… | |
… | |
1374 | * NULL if 'op' was destroyed |
1265 | * NULL if 'op' was destroyed |
1375 | * just 'op' otherwise |
1266 | * just 'op' otherwise |
1376 | */ |
1267 | */ |
1377 | |
1268 | |
1378 | object * |
1269 | object * |
1379 | insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) |
1270 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1380 | { |
1271 | { |
1381 | object *tmp, *top, *floor = NULL; |
1272 | object *tmp, *top, *floor = NULL; |
1382 | sint16 x, y; |
1273 | sint16 x, y; |
1383 | |
1274 | |
1384 | if (QUERY_FLAG (op, FLAG_FREED)) |
1275 | if (QUERY_FLAG (op, FLAG_FREED)) |
… | |
… | |
1387 | return NULL; |
1278 | return NULL; |
1388 | } |
1279 | } |
1389 | |
1280 | |
1390 | if (m == NULL) |
1281 | if (m == NULL) |
1391 | { |
1282 | { |
1392 | dump_object (op); |
1283 | char *dump = dump_object (op); |
1393 | LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg); |
1284 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
|
|
1285 | free (dump); |
1394 | return op; |
1286 | return op; |
1395 | } |
1287 | } |
1396 | |
1288 | |
1397 | if (out_of_map (m, op->x, op->y)) |
1289 | if (out_of_map (m, op->x, op->y)) |
1398 | { |
1290 | { |
1399 | dump_object (op); |
1291 | char *dump = dump_object (op); |
1400 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg); |
1292 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1401 | #ifdef MANY_CORES |
1293 | #ifdef MANY_CORES |
1402 | /* Better to catch this here, as otherwise the next use of this object |
1294 | /* Better to catch this here, as otherwise the next use of this object |
1403 | * is likely to cause a crash. Better to find out where it is getting |
1295 | * is likely to cause a crash. Better to find out where it is getting |
1404 | * improperly inserted. |
1296 | * improperly inserted. |
1405 | */ |
1297 | */ |
1406 | abort (); |
1298 | abort (); |
1407 | #endif |
1299 | #endif |
|
|
1300 | free (dump); |
1408 | return op; |
1301 | return op; |
1409 | } |
1302 | } |
1410 | |
1303 | |
1411 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1304 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1412 | { |
1305 | { |
1413 | dump_object (op); |
1306 | char *dump = dump_object (op); |
1414 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg); |
1307 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1308 | free (dump); |
1415 | return op; |
1309 | return op; |
1416 | } |
1310 | } |
1417 | |
1311 | |
1418 | if (op->more != NULL) |
1312 | if (op->more != NULL) |
1419 | { |
1313 | { |
… | |
… | |
1665 | remove_ob (tmp); |
1559 | remove_ob (tmp); |
1666 | free_object (tmp); |
1560 | free_object (tmp); |
1667 | } |
1561 | } |
1668 | } |
1562 | } |
1669 | |
1563 | |
1670 | tmp1 = arch_to_object (find_archetype (arch_string)); |
1564 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1671 | |
1565 | |
1672 | tmp1->x = op->x; |
1566 | tmp1->x = op->x; |
1673 | tmp1->y = op->y; |
1567 | tmp1->y = op->y; |
1674 | insert_ob_in_map (tmp1, op->map, op, 0); |
1568 | insert_ob_in_map (tmp1, op->map, op, 0); |
1675 | } |
1569 | } |
… | |
… | |
1856 | tmp, * |
1750 | tmp, * |
1857 | otmp; |
1751 | otmp; |
1858 | |
1752 | |
1859 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1753 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1860 | { |
1754 | { |
1861 | dump_object (op); |
1755 | char *dump = dump_object (op); |
1862 | LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg); |
1756 | LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump); |
|
|
1757 | free (dump); |
1863 | return op; |
1758 | return op; |
1864 | } |
1759 | } |
1865 | |
1760 | |
1866 | if (where == NULL) |
1761 | if (where == NULL) |
1867 | { |
1762 | { |
1868 | dump_object (op); |
1763 | char *dump = dump_object (op); |
1869 | LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg); |
1764 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
|
|
1765 | free (dump); |
1870 | return op; |
1766 | return op; |
1871 | } |
1767 | } |
1872 | |
1768 | |
1873 | if (where->head) |
1769 | if (where->head) |
1874 | { |
1770 | { |
… | |
… | |
1974 | */ |
1870 | */ |
1975 | |
1871 | |
1976 | int |
1872 | int |
1977 | check_move_on (object *op, object *originator) |
1873 | check_move_on (object *op, object *originator) |
1978 | { |
1874 | { |
1979 | object * |
1875 | object *tmp; |
1980 | tmp; |
1876 | maptile *m = op->map; |
1981 | tag_t |
|
|
1982 | tag; |
|
|
1983 | mapstruct * |
|
|
1984 | m = op->map; |
|
|
1985 | int |
|
|
1986 | x = op->x, y = op->y; |
1877 | int x = op->x, y = op->y; |
1987 | |
1878 | |
1988 | MoveType |
1879 | MoveType move_on, move_slow, move_block; |
1989 | move_on, |
|
|
1990 | move_slow, |
|
|
1991 | move_block; |
|
|
1992 | |
1880 | |
1993 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1881 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1994 | return 0; |
1882 | return 0; |
1995 | |
|
|
1996 | tag = op->count; |
|
|
1997 | |
1883 | |
1998 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1884 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1999 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1885 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
2000 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1886 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
2001 | |
1887 | |
… | |
… | |
2062 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1948 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
2063 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1949 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
2064 | { |
1950 | { |
2065 | move_apply (tmp, op, originator); |
1951 | move_apply (tmp, op, originator); |
2066 | |
1952 | |
2067 | if (was_destroyed (op, tag)) |
1953 | if (op->destroyed ()) |
2068 | return 1; |
1954 | return 1; |
2069 | |
1955 | |
2070 | /* what the person/creature stepped onto has moved the object |
1956 | /* what the person/creature stepped onto has moved the object |
2071 | * someplace new. Don't process any further - if we did, |
1957 | * someplace new. Don't process any further - if we did, |
2072 | * have a feeling strange problems would result. |
1958 | * have a feeling strange problems would result. |
… | |
… | |
2084 | * a matching archetype at the given map and coordinates. |
1970 | * a matching archetype at the given map and coordinates. |
2085 | * The first matching object is returned, or NULL if none. |
1971 | * The first matching object is returned, or NULL if none. |
2086 | */ |
1972 | */ |
2087 | |
1973 | |
2088 | object * |
1974 | object * |
2089 | present_arch (const archetype *at, mapstruct *m, int x, int y) |
1975 | present_arch (const archetype *at, maptile *m, int x, int y) |
2090 | { |
1976 | { |
2091 | object * |
1977 | object * |
2092 | tmp; |
1978 | tmp; |
2093 | |
1979 | |
2094 | if (m == NULL || out_of_map (m, x, y)) |
1980 | if (m == NULL || out_of_map (m, x, y)) |
… | |
… | |
2107 | * a matching type variable at the given map and coordinates. |
1993 | * a matching type variable at the given map and coordinates. |
2108 | * The first matching object is returned, or NULL if none. |
1994 | * The first matching object is returned, or NULL if none. |
2109 | */ |
1995 | */ |
2110 | |
1996 | |
2111 | object * |
1997 | object * |
2112 | present (unsigned char type, mapstruct *m, int x, int y) |
1998 | present (unsigned char type, maptile *m, int x, int y) |
2113 | { |
1999 | { |
2114 | object * |
2000 | object * |
2115 | tmp; |
2001 | tmp; |
2116 | |
2002 | |
2117 | if (out_of_map (m, x, y)) |
2003 | if (out_of_map (m, x, y)) |
… | |
… | |
2257 | * the archetype because that isn't correct if the monster has been |
2143 | * the archetype because that isn't correct if the monster has been |
2258 | * customized, changed states, etc. |
2144 | * customized, changed states, etc. |
2259 | */ |
2145 | */ |
2260 | |
2146 | |
2261 | int |
2147 | int |
2262 | find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) |
2148 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2263 | { |
2149 | { |
2264 | int |
2150 | int |
2265 | i, |
2151 | i, |
2266 | index = 0, flag; |
2152 | index = 0, flag; |
2267 | static int |
2153 | static int |
… | |
… | |
2288 | return -1; |
2174 | return -1; |
2289 | return altern[RANDOM () % index]; |
2175 | return altern[RANDOM () % index]; |
2290 | } |
2176 | } |
2291 | |
2177 | |
2292 | /* |
2178 | /* |
2293 | * find_first_free_spot(archetype, mapstruct, x, y) works like |
2179 | * find_first_free_spot(archetype, maptile, x, y) works like |
2294 | * find_free_spot(), but it will search max number of squares. |
2180 | * find_free_spot(), but it will search max number of squares. |
2295 | * But it will return the first available spot, not a random choice. |
2181 | * But it will return the first available spot, not a random choice. |
2296 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2182 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2297 | */ |
2183 | */ |
2298 | |
2184 | |
2299 | int |
2185 | int |
2300 | find_first_free_spot (const object *ob, mapstruct *m, int x, int y) |
2186 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2301 | { |
2187 | { |
2302 | int |
2188 | int |
2303 | i; |
2189 | i; |
2304 | |
2190 | |
2305 | for (i = 0; i < SIZEOFFREE; i++) |
2191 | for (i = 0; i < SIZEOFFREE; i++) |
… | |
… | |
2369 | * because we have to know what movement the thing looking to move |
2255 | * because we have to know what movement the thing looking to move |
2370 | * there is capable of. |
2256 | * there is capable of. |
2371 | */ |
2257 | */ |
2372 | |
2258 | |
2373 | int |
2259 | int |
2374 | find_dir (mapstruct *m, int x, int y, object *exclude) |
2260 | find_dir (maptile *m, int x, int y, object *exclude) |
2375 | { |
2261 | { |
2376 | int |
2262 | int |
2377 | i, |
2263 | i, |
2378 | max = SIZEOFFREE, mflags; |
2264 | max = SIZEOFFREE, mflags; |
2379 | |
2265 | |
2380 | sint16 nx, ny; |
2266 | sint16 nx, ny; |
2381 | object * |
2267 | object * |
2382 | tmp; |
2268 | tmp; |
2383 | mapstruct * |
2269 | maptile * |
2384 | mp; |
2270 | mp; |
2385 | |
2271 | |
2386 | MoveType blocked, move_type; |
2272 | MoveType blocked, move_type; |
2387 | |
2273 | |
2388 | if (exclude && exclude->head) |
2274 | if (exclude && exclude->head) |
… | |
… | |
2596 | * Modified to be map tile aware -.MSW |
2482 | * Modified to be map tile aware -.MSW |
2597 | */ |
2483 | */ |
2598 | |
2484 | |
2599 | |
2485 | |
2600 | int |
2486 | int |
2601 | can_see_monsterP (mapstruct *m, int x, int y, int dir) |
2487 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2602 | { |
2488 | { |
2603 | sint16 dx, dy; |
2489 | sint16 dx, dy; |
2604 | int |
2490 | int |
2605 | mflags; |
2491 | mflags; |
2606 | |
2492 | |
… | |
… | |
2686 | if (prev) |
2572 | if (prev) |
2687 | prev->more = tmp; |
2573 | prev->more = tmp; |
2688 | prev = tmp; |
2574 | prev = tmp; |
2689 | } |
2575 | } |
2690 | |
2576 | |
2691 | /*** copy inventory ***/ |
|
|
2692 | for (item = src->inv; item; item = item->below) |
2577 | for (item = src->inv; item; item = item->below) |
2693 | { |
|
|
2694 | (void) insert_ob_in_ob (object_create_clone (item), dst); |
2578 | insert_ob_in_ob (object_create_clone (item), dst); |
2695 | } |
|
|
2696 | |
2579 | |
2697 | return dst; |
2580 | return dst; |
2698 | } |
2581 | } |
2699 | |
2582 | |
2700 | /* return true if the object was destroyed, 0 otherwise */ |
|
|
2701 | int |
|
|
2702 | was_destroyed (const object *op, tag_t old_tag) |
|
|
2703 | { |
|
|
2704 | /* checking for FLAG_FREED isn't necessary, but makes this function more |
|
|
2705 | * robust */ |
|
|
2706 | return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED); |
|
|
2707 | } |
|
|
2708 | |
|
|
2709 | /* GROS - Creates an object using a string representing its content. */ |
2583 | /* GROS - Creates an object using a string representing its content. */ |
2710 | |
|
|
2711 | /* Basically, we save the content of the string to a temp file, then call */ |
2584 | /* Basically, we save the content of the string to a temp file, then call */ |
2712 | |
|
|
2713 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
2585 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
2714 | |
|
|
2715 | /* but it was simple to make and allows reusing the load_object function. */ |
2586 | /* but it was simple to make and allows reusing the load_object function. */ |
2716 | |
|
|
2717 | /* Remember not to use load_object_str in a time-critical situation. */ |
2587 | /* Remember not to use load_object_str in a time-critical situation. */ |
2718 | |
|
|
2719 | /* Also remember that multiparts objects are not supported for now. */ |
2588 | /* Also remember that multiparts objects are not supported for now. */ |
2720 | |
2589 | |
2721 | object * |
2590 | object * |
2722 | load_object_str (const char *obstr) |
2591 | load_object_str (const char *obstr) |
2723 | { |
2592 | { |
2724 | object * |
2593 | object *op; |
2725 | op; |
|
|
2726 | char |
|
|
2727 | filename[MAX_BUF]; |
2594 | char filename[MAX_BUF]; |
2728 | |
2595 | |
2729 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
2596 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
2730 | |
2597 | |
2731 | FILE * |
|
|
2732 | tempfile = fopen (filename, "w"); |
2598 | FILE *tempfile = fopen (filename, "w"); |
2733 | |
2599 | |
2734 | if (tempfile == NULL) |
2600 | if (tempfile == NULL) |
2735 | { |
2601 | { |
2736 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2602 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2737 | return NULL; |
2603 | return NULL; |
… | |
… | |
2758 | * returns NULL if no match. |
2624 | * returns NULL if no match. |
2759 | */ |
2625 | */ |
2760 | object * |
2626 | object * |
2761 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2627 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2762 | { |
2628 | { |
2763 | object * |
2629 | object *tmp; |
2764 | tmp; |
|
|
2765 | |
2630 | |
2766 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2631 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2767 | if (tmp->type == type && tmp->subtype == subtype) |
2632 | if (tmp->type == type && tmp->subtype == subtype) |
2768 | return tmp; |
2633 | return tmp; |
2769 | |
2634 | |
… | |
… | |
2777 | * do the desired thing. |
2642 | * do the desired thing. |
2778 | */ |
2643 | */ |
2779 | key_value * |
2644 | key_value * |
2780 | get_ob_key_link (const object *ob, const char *key) |
2645 | get_ob_key_link (const object *ob, const char *key) |
2781 | { |
2646 | { |
2782 | key_value * |
2647 | key_value *link; |
2783 | link; |
|
|
2784 | |
2648 | |
2785 | for (link = ob->key_values; link != NULL; link = link->next) |
2649 | for (link = ob->key_values; link != NULL; link = link->next) |
2786 | { |
|
|
2787 | if (link->key == key) |
2650 | if (link->key == key) |
2788 | { |
|
|
2789 | return link; |
2651 | return link; |
2790 | } |
|
|
2791 | } |
|
|
2792 | |
2652 | |
2793 | return NULL; |
2653 | return NULL; |
2794 | } |
2654 | } |
2795 | |
2655 | |
2796 | /* |
2656 | /* |