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. */ |
… | |
… | |
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> |
34 | #include <skills.h> |
|
|
35 | #include <loader.h> |
33 | #include <loader.h> |
36 | |
34 | |
37 | int nrofallocobjects = 0; |
35 | int nrofallocobjects = 0; |
|
|
36 | static UUID uuid; |
|
|
37 | const uint64 UUID_SKIP = 1<<19; |
38 | |
38 | |
39 | object *objects; /* Pointer to the list of used objects */ |
|
|
40 | 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 */ |
41 | |
40 | |
42 | 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, |
43 | 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 |
44 | }; |
43 | }; |
… | |
… | |
50 | }; |
49 | }; |
51 | int freedir[SIZEOFFREE] = { |
50 | int freedir[SIZEOFFREE] = { |
52 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
51 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
53 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
52 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
54 | }; |
53 | }; |
|
|
54 | |
|
|
55 | static void |
|
|
56 | write_uuid (void) |
|
|
57 | { |
|
|
58 | char filename1[MAX_BUF], filename2[MAX_BUF]; |
|
|
59 | |
|
|
60 | sprintf (filename1, "%s/uuid", settings.localdir); |
|
|
61 | sprintf (filename2, "%s/uuid~", settings.localdir); |
|
|
62 | |
|
|
63 | FILE *fp; |
|
|
64 | |
|
|
65 | if (!(fp = fopen (filename2, "w"))) |
|
|
66 | { |
|
|
67 | LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); |
|
|
68 | return; |
|
|
69 | } |
|
|
70 | |
|
|
71 | fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2); |
|
|
72 | fclose (fp); |
|
|
73 | rename (filename2, filename1); |
|
|
74 | } |
|
|
75 | |
|
|
76 | static void |
|
|
77 | read_uuid (void) |
|
|
78 | { |
|
|
79 | char filename[MAX_BUF]; |
|
|
80 | |
|
|
81 | sprintf (filename, "%s/uuid", settings.localdir); |
|
|
82 | |
|
|
83 | FILE *fp; |
|
|
84 | |
|
|
85 | if (!(fp = fopen (filename, "r"))) |
|
|
86 | { |
|
|
87 | if (errno == ENOENT) |
|
|
88 | { |
|
|
89 | LOG (llevInfo, "RESET uid to 1\n"); |
|
|
90 | uuid.seq = 0; |
|
|
91 | write_uuid (); |
|
|
92 | return; |
|
|
93 | } |
|
|
94 | |
|
|
95 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
|
|
96 | _exit (1); |
|
|
97 | } |
|
|
98 | |
|
|
99 | int version; |
|
|
100 | unsigned long long uid; |
|
|
101 | if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1) |
|
|
102 | { |
|
|
103 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
|
|
104 | _exit (1); |
|
|
105 | } |
|
|
106 | |
|
|
107 | uuid.seq = uid; |
|
|
108 | write_uuid (); |
|
|
109 | LOG (llevDebug, "read UID: %lld\n", uid); |
|
|
110 | fclose (fp); |
|
|
111 | } |
|
|
112 | |
|
|
113 | UUID |
|
|
114 | gen_uuid () |
|
|
115 | { |
|
|
116 | UUID uid; |
|
|
117 | |
|
|
118 | uid.seq = ++uuid.seq; |
|
|
119 | |
|
|
120 | if (!(uuid.seq & (UUID_SKIP - 1))) |
|
|
121 | write_uuid (); |
|
|
122 | |
|
|
123 | return uid; |
|
|
124 | } |
|
|
125 | |
|
|
126 | void |
|
|
127 | init_uuid () |
|
|
128 | { |
|
|
129 | read_uuid (); |
|
|
130 | } |
55 | |
131 | |
56 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
132 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
57 | static int |
133 | static int |
58 | compare_ob_value_lists_one (const object *wants, const object *has) |
134 | compare_ob_value_lists_one (const object *wants, const object *has) |
59 | { |
135 | { |
… | |
… | |
255 | { |
331 | { |
256 | if (inv->inv) |
332 | if (inv->inv) |
257 | sum_weight (inv); |
333 | sum_weight (inv); |
258 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
334 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
259 | } |
335 | } |
|
|
336 | |
260 | if (op->type == CONTAINER && op->stats.Str) |
337 | if (op->type == CONTAINER && op->stats.Str) |
261 | sum = (sum * (100 - op->stats.Str)) / 100; |
338 | sum = (sum * (100 - op->stats.Str)) / 100; |
|
|
339 | |
262 | if (op->carrying != sum) |
340 | if (op->carrying != sum) |
263 | op->carrying = sum; |
341 | op->carrying = sum; |
|
|
342 | |
264 | return sum; |
343 | return sum; |
265 | } |
344 | } |
266 | |
345 | |
267 | /** |
346 | /** |
268 | * Return the outermost environment object for a given object. |
347 | * Return the outermost environment object for a given object. |
… | |
… | |
366 | void |
445 | void |
367 | dump_all_objects (void) |
446 | dump_all_objects (void) |
368 | { |
447 | { |
369 | object *op; |
448 | object *op; |
370 | |
449 | |
371 | for (op = objects; op != NULL; op = op->next) |
450 | for (op = object::first; op != NULL; op = op->next) |
372 | { |
451 | { |
373 | dump_object (op); |
452 | dump_object (op); |
374 | fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg); |
453 | fprintf (logfile, "Object %s\n", errmsg); |
375 | } |
454 | } |
376 | } |
455 | } |
377 | |
456 | |
378 | /* |
457 | /* |
379 | * get_nearest_part(multi-object, object 2) returns the part of the |
458 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
402 | object * |
481 | object * |
403 | find_object (tag_t i) |
482 | find_object (tag_t i) |
404 | { |
483 | { |
405 | object *op; |
484 | object *op; |
406 | |
485 | |
407 | for (op = objects; op != NULL; op = op->next) |
486 | for (op = object::first; op != NULL; op = op->next) |
408 | if (op->count == i) |
487 | if (op->count == i) |
409 | break; |
488 | break; |
|
|
489 | |
410 | return op; |
490 | return op; |
411 | } |
491 | } |
412 | |
492 | |
413 | /* |
493 | /* |
414 | * Returns the first object which has a name equal to the argument. |
494 | * Returns the first object which has a name equal to the argument. |
… | |
… | |
417 | */ |
497 | */ |
418 | |
498 | |
419 | object * |
499 | object * |
420 | find_object_name (const char *str) |
500 | find_object_name (const char *str) |
421 | { |
501 | { |
422 | const char *name = shstr::find (str); |
502 | shstr_cmp str_ (str); |
423 | object *op; |
503 | object *op; |
424 | |
504 | |
425 | for (op = objects; op != NULL; op = op->next) |
505 | for (op = object::first; op != NULL; op = op->next) |
426 | if (&op->name == name) |
506 | if (op->name == str_) |
427 | break; |
507 | break; |
428 | |
508 | |
429 | return op; |
509 | return op; |
430 | } |
510 | } |
431 | |
511 | |
432 | void |
512 | void |
433 | free_all_object_data () |
513 | free_all_object_data () |
434 | { |
514 | { |
435 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
515 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
436 | } |
|
|
437 | |
|
|
438 | /* |
|
|
439 | * Returns the object which this object marks as being the owner. |
|
|
440 | * A id-scheme is used to avoid pointing to objects which have been |
|
|
441 | * freed and are now reused. If this is detected, the owner is |
|
|
442 | * set to NULL, and NULL is returned. |
|
|
443 | * Changed 2004-02-12 - if the player is setting at the play again |
|
|
444 | * prompt, he is removed, and we don't want to treat him as an owner of |
|
|
445 | * anything, so check removed flag. I don't expect that this should break |
|
|
446 | * anything - once an object is removed, it is basically dead anyways. |
|
|
447 | */ |
|
|
448 | object * |
|
|
449 | object::get_owner () |
|
|
450 | { |
|
|
451 | if (!owner |
|
|
452 | || QUERY_FLAG (owner, FLAG_FREED) |
|
|
453 | || QUERY_FLAG (owner, FLAG_REMOVED)) |
|
|
454 | owner = 0; |
|
|
455 | |
|
|
456 | return owner; |
|
|
457 | } |
516 | } |
458 | |
517 | |
459 | /* |
518 | /* |
460 | * Sets the owner and sets the skill and exp pointers to owner's current |
519 | * Sets the owner and sets the skill and exp pointers to owner's current |
461 | * skill and experience objects. |
520 | * skill and experience objects. |
… | |
… | |
531 | |
590 | |
532 | /* What is not cleared is next, prev, and count */ |
591 | /* What is not cleared is next, prev, and count */ |
533 | |
592 | |
534 | expmul = 1.0; |
593 | expmul = 1.0; |
535 | face = blank_face; |
594 | face = blank_face; |
536 | attacked_by_count = -1; |
|
|
537 | |
595 | |
538 | if (settings.casting_time) |
596 | if (settings.casting_time) |
539 | casting_time = -1; |
597 | casting_time = -1; |
540 | } |
598 | } |
541 | |
599 | |
… | |
… | |
836 | |
894 | |
837 | if (op->more != NULL) |
895 | if (op->more != NULL) |
838 | update_object (op->more, action); |
896 | update_object (op->more, action); |
839 | } |
897 | } |
840 | |
898 | |
841 | static unordered_vector<object *> mortals; |
899 | object::vector object::mortals; |
842 | static std::vector<object *> freed; |
900 | object::vector object::objects; // not yet used |
|
|
901 | object *object::first; |
843 | |
902 | |
844 | void object::free_mortals () |
903 | void object::free_mortals () |
845 | { |
904 | { |
846 | for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();) |
905 | for (AUTODECL (i, mortals.begin ()); i != mortals.end ();) |
847 | if ((*i)->refcnt) |
906 | if ((*i)->refcnt) |
848 | ++i; // further delay freeing |
907 | ++i; // further delay freeing |
849 | else |
908 | else |
850 | { |
909 | { |
851 | freed.push_back (*i);//D |
|
|
852 | //delete *i; |
910 | delete *i; |
853 | mortals.erase (i); |
911 | mortals.erase (i); |
854 | } |
912 | } |
855 | |
913 | |
856 | if (mortals.size())//D |
914 | static int lastmortals = 0;//D |
|
|
915 | |
|
|
916 | if (mortals.size() != lastmortals && lastmortals > 100)//D |
|
|
917 | { |
|
|
918 | lastmortals = mortals.size ();//D |
857 | LOG (llevDebug, "%d objects in mortal queue\n", mortals.size());//D |
919 | LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D |
|
|
920 | } |
858 | } |
921 | } |
859 | |
922 | |
860 | object::object () |
923 | object::object () |
861 | { |
924 | { |
862 | SET_FLAG (this, FLAG_REMOVED); |
925 | SET_FLAG (this, FLAG_REMOVED); |
863 | |
926 | |
864 | expmul = 1.0; |
927 | expmul = 1.0; |
865 | face = blank_face; |
928 | face = blank_face; |
866 | attacked_by_count = -1; |
|
|
867 | } |
929 | } |
868 | |
930 | |
869 | object::~object () |
931 | object::~object () |
870 | { |
932 | { |
871 | free_key_values (this); |
933 | free_key_values (this); |
872 | } |
934 | } |
873 | |
935 | |
874 | void object::link () |
936 | void object::link () |
875 | { |
937 | { |
876 | count = ++ob_count; |
938 | count = ++ob_count; |
|
|
939 | uuid = gen_uuid (); |
877 | |
940 | |
878 | prev = 0; |
941 | prev = 0; |
879 | next = objects; |
942 | next = object::first; |
880 | |
943 | |
881 | if (objects) |
944 | if (object::first) |
882 | objects->prev = this; |
945 | object::first->prev = this; |
883 | |
946 | |
884 | objects = this; |
947 | object::first = this; |
885 | } |
948 | } |
886 | |
949 | |
887 | void object::unlink () |
950 | void object::unlink () |
888 | { |
951 | { |
889 | count = 0; |
952 | if (this == object::first) |
|
|
953 | object::first = next; |
890 | |
954 | |
891 | /* Remove this object from the list of used objects */ |
955 | /* Remove this object from the list of used objects */ |
892 | if (prev) |
|
|
893 | { |
|
|
894 | prev->next = next; |
956 | if (prev) prev->next = next; |
|
|
957 | if (next) next->prev = prev; |
|
|
958 | |
895 | prev = 0; |
959 | prev = 0; |
896 | } |
|
|
897 | |
|
|
898 | if (next) |
|
|
899 | { |
|
|
900 | next->prev = prev; |
|
|
901 | next = 0; |
960 | next = 0; |
902 | } |
|
|
903 | |
|
|
904 | if (this == objects) |
|
|
905 | objects = next; |
|
|
906 | } |
961 | } |
907 | |
962 | |
908 | object *object::create () |
963 | object *object::create () |
909 | { |
964 | { |
910 | object * |
|
|
911 | op; |
|
|
912 | |
|
|
913 | if (freed.empty ()) |
|
|
914 | op = new object; |
965 | object *op = new object; |
915 | else |
|
|
916 | { |
|
|
917 | // highly annoying, but the only way to get it stable right now |
|
|
918 | op = freed.back (); |
|
|
919 | freed.pop_back (); |
|
|
920 | op->~object (); |
|
|
921 | new ((void *) op) object; |
|
|
922 | } |
|
|
923 | |
|
|
924 | op->link (); |
966 | op->link (); |
925 | return op; |
967 | return op; |
926 | } |
968 | } |
927 | |
969 | |
928 | /* |
970 | /* |
… | |
… | |
930 | * it from the list of used objects, and puts it on the list of |
972 | * it from the list of used objects, and puts it on the list of |
931 | * free objects. The IS_FREED() flag is set in the object. |
973 | * free objects. The IS_FREED() flag is set in the object. |
932 | * The object must have been removed by remove_ob() first for |
974 | * The object must have been removed by remove_ob() first for |
933 | * this function to succeed. |
975 | * this function to succeed. |
934 | * |
976 | * |
935 | * If free_inventory is set, free inventory as well. Else drop items in |
977 | * If destroy_inventory is set, free inventory as well. Else drop items in |
936 | * inventory to the ground. |
978 | * inventory to the ground. |
937 | */ |
979 | */ |
938 | void object::free (bool free_inventory) |
980 | void object::destroy (bool destroy_inventory) |
939 | { |
981 | { |
940 | if (QUERY_FLAG (this, FLAG_FREED)) |
982 | if (QUERY_FLAG (this, FLAG_FREED)) |
941 | return; |
983 | return; |
942 | |
984 | |
|
|
985 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
|
|
986 | remove_friendly_object (this); |
|
|
987 | |
943 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
988 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
944 | remove_ob (this); |
989 | remove_ob (this); |
945 | |
990 | |
946 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
|
|
947 | remove_friendly_object (this); |
|
|
948 | |
|
|
949 | SET_FLAG (this, FLAG_FREED); |
991 | SET_FLAG (this, FLAG_FREED); |
950 | |
992 | |
951 | if (more) |
993 | if (more) |
952 | { |
994 | { |
953 | more->free (free_inventory); |
995 | more->destroy (destroy_inventory); |
954 | more = 0; |
996 | more = 0; |
955 | } |
997 | } |
956 | |
998 | |
957 | if (inv) |
999 | if (inv) |
958 | { |
1000 | { |
959 | /* Only if the space blocks everything do we not process - |
1001 | /* Only if the space blocks everything do we not process - |
960 | * if some form of movement is allowed, let objects |
1002 | * if some form of movement is allowed, let objects |
961 | * drop on that space. |
1003 | * drop on that space. |
962 | */ |
1004 | */ |
963 | if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)) |
1005 | if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
964 | { |
1006 | { |
965 | object *op = inv; |
1007 | object *op = inv; |
966 | |
1008 | |
967 | while (op) |
1009 | while (op) |
968 | { |
1010 | { |
969 | object *tmp = op->below; |
1011 | object *tmp = op->below; |
970 | op->free (free_inventory); |
1012 | op->destroy (destroy_inventory); |
971 | op = tmp; |
1013 | op = tmp; |
972 | } |
1014 | } |
973 | } |
1015 | } |
974 | else |
1016 | else |
975 | { /* Put objects in inventory onto this space */ |
1017 | { /* Put objects in inventory onto this space */ |
… | |
… | |
994 | op = tmp; |
1036 | op = tmp; |
995 | } |
1037 | } |
996 | } |
1038 | } |
997 | } |
1039 | } |
998 | |
1040 | |
|
|
1041 | // clear those pointers that likely might have circular references to us |
999 | owner = 0; |
1042 | owner = 0; |
|
|
1043 | enemy = 0; |
|
|
1044 | attacked_by = 0; |
|
|
1045 | |
|
|
1046 | // only relevant for players(?), but make sure of it anyways |
|
|
1047 | contr = 0; |
1000 | |
1048 | |
1001 | /* Remove object from the active list */ |
1049 | /* Remove object from the active list */ |
1002 | speed = 0; |
1050 | speed = 0; |
1003 | update_ob_speed (this); |
1051 | update_ob_speed (this); |
1004 | |
1052 | |
… | |
… | |
1016 | sub_weight (object *op, signed long weight) |
1064 | sub_weight (object *op, signed long weight) |
1017 | { |
1065 | { |
1018 | while (op != NULL) |
1066 | while (op != NULL) |
1019 | { |
1067 | { |
1020 | if (op->type == CONTAINER) |
1068 | if (op->type == CONTAINER) |
1021 | { |
|
|
1022 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
1069 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
1023 | } |
1070 | |
1024 | op->carrying -= weight; |
1071 | op->carrying -= weight; |
1025 | op = op->env; |
1072 | op = op->env; |
1026 | } |
1073 | } |
1027 | } |
1074 | } |
1028 | |
1075 | |
… | |
… | |
1036 | */ |
1083 | */ |
1037 | |
1084 | |
1038 | void |
1085 | void |
1039 | remove_ob (object *op) |
1086 | remove_ob (object *op) |
1040 | { |
1087 | { |
|
|
1088 | object *tmp, *last = 0; |
1041 | object * |
1089 | object *otmp; |
1042 | tmp, * |
|
|
1043 | last = NULL; |
|
|
1044 | object * |
|
|
1045 | otmp; |
|
|
1046 | |
1090 | |
1047 | tag_t |
|
|
1048 | tag; |
|
|
1049 | int |
|
|
1050 | check_walk_off; |
1091 | int check_walk_off; |
1051 | mapstruct * |
1092 | maptile *m; |
1052 | m; |
|
|
1053 | |
1093 | |
1054 | sint16 |
1094 | sint16 x, y; |
1055 | x, |
|
|
1056 | y; |
|
|
1057 | |
1095 | |
1058 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1096 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1059 | return; |
1097 | return; |
1060 | |
1098 | |
1061 | SET_FLAG (op, FLAG_REMOVED); |
1099 | SET_FLAG (op, FLAG_REMOVED); |
… | |
… | |
1154 | op->below = 0; |
1192 | op->below = 0; |
1155 | |
1193 | |
1156 | if (op->map->in_memory == MAP_SAVING) |
1194 | if (op->map->in_memory == MAP_SAVING) |
1157 | return; |
1195 | return; |
1158 | |
1196 | |
1159 | tag = op->count; |
|
|
1160 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
1197 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
1161 | |
1198 | |
1162 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1199 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1163 | { |
1200 | { |
1164 | /* No point updating the players look faces if he is the object |
1201 | /* No point updating the players look faces if he is the object |
… | |
… | |
1179 | |
1216 | |
1180 | tmp->contr->socket.update_look = 1; |
1217 | tmp->contr->socket.update_look = 1; |
1181 | } |
1218 | } |
1182 | |
1219 | |
1183 | /* See if player moving off should effect something */ |
1220 | /* See if player moving off should effect something */ |
1184 | if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1221 | if (check_walk_off |
|
|
1222 | && ((op->move_type & tmp->move_off) |
|
|
1223 | && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1185 | { |
1224 | { |
1186 | move_apply (tmp, op, NULL); |
1225 | move_apply (tmp, op, NULL); |
1187 | |
1226 | |
1188 | if (was_destroyed (op, tag)) |
1227 | if (op->destroyed ()) |
1189 | { |
|
|
1190 | LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); |
1228 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1191 | } |
|
|
1192 | } |
1229 | } |
1193 | |
1230 | |
1194 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1231 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1195 | |
1232 | |
1196 | if (tmp->above == tmp) |
1233 | if (tmp->above == tmp) |
… | |
… | |
1224 | * This function goes through all objects below and including top, and |
1261 | * This function goes through all objects below and including top, and |
1225 | * merges op to the first matching object. |
1262 | * merges op to the first matching object. |
1226 | * If top is NULL, it is calculated. |
1263 | * If top is NULL, it is calculated. |
1227 | * Returns pointer to object if it succeded in the merge, otherwise NULL |
1264 | * Returns pointer to object if it succeded in the merge, otherwise NULL |
1228 | */ |
1265 | */ |
1229 | |
|
|
1230 | object * |
1266 | object * |
1231 | merge_ob (object *op, object *top) |
1267 | merge_ob (object *op, object *top) |
1232 | { |
1268 | { |
1233 | if (!op->nrof) |
1269 | if (!op->nrof) |
1234 | return 0; |
1270 | return 0; |
… | |
… | |
1250 | free_object (op); |
1286 | free_object (op); |
1251 | return top; |
1287 | return top; |
1252 | } |
1288 | } |
1253 | } |
1289 | } |
1254 | |
1290 | |
1255 | return NULL; |
1291 | return 0; |
1256 | } |
1292 | } |
1257 | |
1293 | |
1258 | /* |
1294 | /* |
1259 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1295 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1260 | * job preparing multi-part monsters |
1296 | * job preparing multi-part monsters |
1261 | */ |
1297 | */ |
1262 | object * |
1298 | object * |
1263 | insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) |
1299 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1264 | { |
1300 | { |
1265 | object *tmp; |
1301 | object *tmp; |
1266 | |
1302 | |
1267 | if (op->head) |
1303 | if (op->head) |
1268 | op = op->head; |
1304 | op = op->head; |
… | |
… | |
1296 | * NULL if 'op' was destroyed |
1332 | * NULL if 'op' was destroyed |
1297 | * just 'op' otherwise |
1333 | * just 'op' otherwise |
1298 | */ |
1334 | */ |
1299 | |
1335 | |
1300 | object * |
1336 | object * |
1301 | insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) |
1337 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1302 | { |
1338 | { |
1303 | object *tmp, *top, *floor = NULL; |
1339 | object *tmp, *top, *floor = NULL; |
1304 | sint16 x, y; |
1340 | sint16 x, y; |
1305 | |
1341 | |
1306 | if (QUERY_FLAG (op, FLAG_FREED)) |
1342 | if (QUERY_FLAG (op, FLAG_FREED)) |
… | |
… | |
1587 | remove_ob (tmp); |
1623 | remove_ob (tmp); |
1588 | free_object (tmp); |
1624 | free_object (tmp); |
1589 | } |
1625 | } |
1590 | } |
1626 | } |
1591 | |
1627 | |
1592 | tmp1 = arch_to_object (find_archetype (arch_string)); |
1628 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1593 | |
1629 | |
1594 | tmp1->x = op->x; |
1630 | tmp1->x = op->x; |
1595 | tmp1->y = op->y; |
1631 | tmp1->y = op->y; |
1596 | insert_ob_in_map (tmp1, op->map, op, 0); |
1632 | insert_ob_in_map (tmp1, op->map, op, 0); |
1597 | } |
1633 | } |
… | |
… | |
1896 | */ |
1932 | */ |
1897 | |
1933 | |
1898 | int |
1934 | int |
1899 | check_move_on (object *op, object *originator) |
1935 | check_move_on (object *op, object *originator) |
1900 | { |
1936 | { |
1901 | object * |
1937 | object *tmp; |
1902 | tmp; |
1938 | maptile *m = op->map; |
1903 | tag_t |
|
|
1904 | tag; |
|
|
1905 | mapstruct * |
|
|
1906 | m = op->map; |
|
|
1907 | int |
|
|
1908 | x = op->x, y = op->y; |
1939 | int x = op->x, y = op->y; |
1909 | |
1940 | |
1910 | MoveType |
1941 | MoveType move_on, move_slow, move_block; |
1911 | move_on, |
|
|
1912 | move_slow, |
|
|
1913 | move_block; |
|
|
1914 | |
1942 | |
1915 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1943 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1916 | return 0; |
1944 | return 0; |
1917 | |
|
|
1918 | tag = op->count; |
|
|
1919 | |
1945 | |
1920 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1946 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1921 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1947 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1922 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1948 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1923 | |
1949 | |
… | |
… | |
1984 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
2010 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1985 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
2011 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1986 | { |
2012 | { |
1987 | move_apply (tmp, op, originator); |
2013 | move_apply (tmp, op, originator); |
1988 | |
2014 | |
1989 | if (was_destroyed (op, tag)) |
2015 | if (op->destroyed ()) |
1990 | return 1; |
2016 | return 1; |
1991 | |
2017 | |
1992 | /* what the person/creature stepped onto has moved the object |
2018 | /* what the person/creature stepped onto has moved the object |
1993 | * someplace new. Don't process any further - if we did, |
2019 | * someplace new. Don't process any further - if we did, |
1994 | * have a feeling strange problems would result. |
2020 | * have a feeling strange problems would result. |
… | |
… | |
2006 | * a matching archetype at the given map and coordinates. |
2032 | * a matching archetype at the given map and coordinates. |
2007 | * The first matching object is returned, or NULL if none. |
2033 | * The first matching object is returned, or NULL if none. |
2008 | */ |
2034 | */ |
2009 | |
2035 | |
2010 | object * |
2036 | object * |
2011 | present_arch (const archetype *at, mapstruct *m, int x, int y) |
2037 | present_arch (const archetype *at, maptile *m, int x, int y) |
2012 | { |
2038 | { |
2013 | object * |
2039 | object * |
2014 | tmp; |
2040 | tmp; |
2015 | |
2041 | |
2016 | if (m == NULL || out_of_map (m, x, y)) |
2042 | if (m == NULL || out_of_map (m, x, y)) |
… | |
… | |
2029 | * a matching type variable at the given map and coordinates. |
2055 | * a matching type variable at the given map and coordinates. |
2030 | * The first matching object is returned, or NULL if none. |
2056 | * The first matching object is returned, or NULL if none. |
2031 | */ |
2057 | */ |
2032 | |
2058 | |
2033 | object * |
2059 | object * |
2034 | present (unsigned char type, mapstruct *m, int x, int y) |
2060 | present (unsigned char type, maptile *m, int x, int y) |
2035 | { |
2061 | { |
2036 | object * |
2062 | object * |
2037 | tmp; |
2063 | tmp; |
2038 | |
2064 | |
2039 | if (out_of_map (m, x, y)) |
2065 | if (out_of_map (m, x, y)) |
… | |
… | |
2179 | * the archetype because that isn't correct if the monster has been |
2205 | * the archetype because that isn't correct if the monster has been |
2180 | * customized, changed states, etc. |
2206 | * customized, changed states, etc. |
2181 | */ |
2207 | */ |
2182 | |
2208 | |
2183 | int |
2209 | int |
2184 | find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) |
2210 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2185 | { |
2211 | { |
2186 | int |
2212 | int |
2187 | i, |
2213 | i, |
2188 | index = 0, flag; |
2214 | index = 0, flag; |
2189 | static int |
2215 | static int |
… | |
… | |
2210 | return -1; |
2236 | return -1; |
2211 | return altern[RANDOM () % index]; |
2237 | return altern[RANDOM () % index]; |
2212 | } |
2238 | } |
2213 | |
2239 | |
2214 | /* |
2240 | /* |
2215 | * find_first_free_spot(archetype, mapstruct, x, y) works like |
2241 | * find_first_free_spot(archetype, maptile, x, y) works like |
2216 | * find_free_spot(), but it will search max number of squares. |
2242 | * find_free_spot(), but it will search max number of squares. |
2217 | * But it will return the first available spot, not a random choice. |
2243 | * But it will return the first available spot, not a random choice. |
2218 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2244 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2219 | */ |
2245 | */ |
2220 | |
2246 | |
2221 | int |
2247 | int |
2222 | find_first_free_spot (const object *ob, mapstruct *m, int x, int y) |
2248 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2223 | { |
2249 | { |
2224 | int |
2250 | int |
2225 | i; |
2251 | i; |
2226 | |
2252 | |
2227 | for (i = 0; i < SIZEOFFREE; i++) |
2253 | for (i = 0; i < SIZEOFFREE; i++) |
… | |
… | |
2291 | * because we have to know what movement the thing looking to move |
2317 | * because we have to know what movement the thing looking to move |
2292 | * there is capable of. |
2318 | * there is capable of. |
2293 | */ |
2319 | */ |
2294 | |
2320 | |
2295 | int |
2321 | int |
2296 | find_dir (mapstruct *m, int x, int y, object *exclude) |
2322 | find_dir (maptile *m, int x, int y, object *exclude) |
2297 | { |
2323 | { |
2298 | int |
2324 | int |
2299 | i, |
2325 | i, |
2300 | max = SIZEOFFREE, mflags; |
2326 | max = SIZEOFFREE, mflags; |
2301 | |
2327 | |
2302 | sint16 nx, ny; |
2328 | sint16 nx, ny; |
2303 | object * |
2329 | object * |
2304 | tmp; |
2330 | tmp; |
2305 | mapstruct * |
2331 | maptile * |
2306 | mp; |
2332 | mp; |
2307 | |
2333 | |
2308 | MoveType blocked, move_type; |
2334 | MoveType blocked, move_type; |
2309 | |
2335 | |
2310 | if (exclude && exclude->head) |
2336 | if (exclude && exclude->head) |
… | |
… | |
2518 | * Modified to be map tile aware -.MSW |
2544 | * Modified to be map tile aware -.MSW |
2519 | */ |
2545 | */ |
2520 | |
2546 | |
2521 | |
2547 | |
2522 | int |
2548 | int |
2523 | can_see_monsterP (mapstruct *m, int x, int y, int dir) |
2549 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2524 | { |
2550 | { |
2525 | sint16 dx, dy; |
2551 | sint16 dx, dy; |
2526 | int |
2552 | int |
2527 | mflags; |
2553 | mflags; |
2528 | |
2554 | |
… | |
… | |
2608 | if (prev) |
2634 | if (prev) |
2609 | prev->more = tmp; |
2635 | prev->more = tmp; |
2610 | prev = tmp; |
2636 | prev = tmp; |
2611 | } |
2637 | } |
2612 | |
2638 | |
2613 | /*** copy inventory ***/ |
|
|
2614 | for (item = src->inv; item; item = item->below) |
2639 | for (item = src->inv; item; item = item->below) |
2615 | { |
|
|
2616 | (void) insert_ob_in_ob (object_create_clone (item), dst); |
2640 | insert_ob_in_ob (object_create_clone (item), dst); |
2617 | } |
|
|
2618 | |
2641 | |
2619 | return dst; |
2642 | return dst; |
2620 | } |
2643 | } |
2621 | |
2644 | |
2622 | /* return true if the object was destroyed, 0 otherwise */ |
|
|
2623 | int |
|
|
2624 | was_destroyed (const object *op, tag_t old_tag) |
|
|
2625 | { |
|
|
2626 | /* checking for FLAG_FREED isn't necessary, but makes this function more |
|
|
2627 | * robust */ |
|
|
2628 | return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED); |
|
|
2629 | } |
|
|
2630 | |
|
|
2631 | /* GROS - Creates an object using a string representing its content. */ |
2645 | /* GROS - Creates an object using a string representing its content. */ |
2632 | |
|
|
2633 | /* Basically, we save the content of the string to a temp file, then call */ |
2646 | /* Basically, we save the content of the string to a temp file, then call */ |
2634 | |
|
|
2635 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
2647 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
2636 | |
|
|
2637 | /* but it was simple to make and allows reusing the load_object function. */ |
2648 | /* but it was simple to make and allows reusing the load_object function. */ |
2638 | |
|
|
2639 | /* Remember not to use load_object_str in a time-critical situation. */ |
2649 | /* Remember not to use load_object_str in a time-critical situation. */ |
2640 | |
|
|
2641 | /* Also remember that multiparts objects are not supported for now. */ |
2650 | /* Also remember that multiparts objects are not supported for now. */ |
2642 | |
2651 | |
2643 | object * |
2652 | object * |
2644 | load_object_str (const char *obstr) |
2653 | load_object_str (const char *obstr) |
2645 | { |
2654 | { |
2646 | object * |
2655 | object *op; |
2647 | op; |
|
|
2648 | char |
|
|
2649 | filename[MAX_BUF]; |
2656 | char filename[MAX_BUF]; |
2650 | |
2657 | |
2651 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
2658 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
2652 | |
2659 | |
2653 | FILE * |
|
|
2654 | tempfile = fopen (filename, "w"); |
2660 | FILE *tempfile = fopen (filename, "w"); |
2655 | |
2661 | |
2656 | if (tempfile == NULL) |
2662 | if (tempfile == NULL) |
2657 | { |
2663 | { |
2658 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2664 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2659 | return NULL; |
2665 | return NULL; |
2660 | }; |
2666 | } |
|
|
2667 | |
2661 | fprintf (tempfile, obstr); |
2668 | fprintf (tempfile, obstr); |
2662 | fclose (tempfile); |
2669 | fclose (tempfile); |
2663 | |
2670 | |
2664 | op = get_object (); |
2671 | op = get_object (); |
2665 | |
2672 | |
… | |
… | |
2679 | * returns NULL if no match. |
2686 | * returns NULL if no match. |
2680 | */ |
2687 | */ |
2681 | object * |
2688 | object * |
2682 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2689 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2683 | { |
2690 | { |
2684 | object * |
2691 | object *tmp; |
2685 | tmp; |
|
|
2686 | |
2692 | |
2687 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2693 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2688 | if (tmp->type == type && tmp->subtype == subtype) |
2694 | if (tmp->type == type && tmp->subtype == subtype) |
2689 | return tmp; |
2695 | return tmp; |
2690 | |
2696 | |
… | |
… | |
2698 | * do the desired thing. |
2704 | * do the desired thing. |
2699 | */ |
2705 | */ |
2700 | key_value * |
2706 | key_value * |
2701 | get_ob_key_link (const object *ob, const char *key) |
2707 | get_ob_key_link (const object *ob, const char *key) |
2702 | { |
2708 | { |
2703 | key_value * |
2709 | key_value *link; |
2704 | link; |
|
|
2705 | |
2710 | |
2706 | for (link = ob->key_values; link != NULL; link = link->next) |
2711 | for (link = ob->key_values; link != NULL; link = link->next) |
2707 | { |
|
|
2708 | if (link->key == key) |
2712 | if (link->key == key) |
2709 | { |
|
|
2710 | return link; |
2713 | return link; |
2711 | } |
|
|
2712 | } |
|
|
2713 | |
2714 | |
2714 | return NULL; |
2715 | return NULL; |
2715 | } |
2716 | } |
2716 | |
2717 | |
2717 | /* |
2718 | /* |
… | |
… | |
2722 | * The returned string is shared. |
2723 | * The returned string is shared. |
2723 | */ |
2724 | */ |
2724 | const char * |
2725 | const char * |
2725 | get_ob_key_value (const object *op, const char *const key) |
2726 | get_ob_key_value (const object *op, const char *const key) |
2726 | { |
2727 | { |
2727 | key_value * |
2728 | key_value *link; |
2728 | link; |
2729 | shstr_cmp canonical_key (key); |
2729 | const char * |
|
|
2730 | canonical_key; |
|
|
2731 | |
2730 | |
2732 | canonical_key = shstr::find (key); |
|
|
2733 | |
|
|
2734 | if (canonical_key == NULL) |
2731 | if (!canonical_key) |
2735 | { |
2732 | { |
2736 | /* 1. There being a field named key on any object |
2733 | /* 1. There being a field named key on any object |
2737 | * implies there'd be a shared string to find. |
2734 | * implies there'd be a shared string to find. |
2738 | * 2. Since there isn't, no object has this field. |
2735 | * 2. Since there isn't, no object has this field. |
2739 | * 3. Therefore, *this* object doesn't have this field. |
2736 | * 3. Therefore, *this* object doesn't have this field. |
2740 | */ |
2737 | */ |
2741 | return NULL; |
2738 | return 0; |
2742 | } |
2739 | } |
2743 | |
2740 | |
2744 | /* This is copied from get_ob_key_link() above - |
2741 | /* This is copied from get_ob_key_link() above - |
2745 | * only 4 lines, and saves the function call overhead. |
2742 | * only 4 lines, and saves the function call overhead. |
2746 | */ |
2743 | */ |
2747 | for (link = op->key_values; link != NULL; link = link->next) |
2744 | for (link = op->key_values; link; link = link->next) |
2748 | { |
|
|
2749 | if (link->key == canonical_key) |
2745 | if (link->key == canonical_key) |
2750 | { |
|
|
2751 | return link->value; |
2746 | return link->value; |
2752 | } |
2747 | |
2753 | } |
|
|
2754 | return NULL; |
2748 | return 0; |
2755 | } |
2749 | } |
2756 | |
2750 | |
2757 | |
2751 | |
2758 | /* |
2752 | /* |
2759 | * Updates the canonical_key in op to value. |
2753 | * Updates the canonical_key in op to value. |
… | |
… | |
2845 | shstr key_ (key); |
2839 | shstr key_ (key); |
2846 | |
2840 | |
2847 | return set_ob_key_value_s (op, key_, value, add_key); |
2841 | return set_ob_key_value_s (op, key_, value, add_key); |
2848 | } |
2842 | } |
2849 | |
2843 | |
|
|
2844 | object::depth_iterator::depth_iterator (object *container) |
|
|
2845 | : iterator_base (container) |
|
|
2846 | { |
|
|
2847 | while (item->inv) |
|
|
2848 | item = item->inv; |
|
|
2849 | } |
|
|
2850 | |
2850 | void |
2851 | void |
2851 | object::deep_iterator::next () |
2852 | object::depth_iterator::next () |
2852 | { |
2853 | { |
2853 | if (item->inv) |
|
|
2854 | item = item->inv; |
|
|
2855 | else if (item->below) |
2854 | if (item->below) |
|
|
2855 | { |
2856 | item = item->below; |
2856 | item = item->below; |
|
|
2857 | |
|
|
2858 | while (item->inv) |
|
|
2859 | item = item->inv; |
|
|
2860 | } |
2857 | else |
2861 | else |
2858 | item = item->env->below; |
2862 | item = item->env; |
2859 | } |
2863 | } |
|
|
2864 | |
|
|
2865 | // return a suitable string describing an objetc in enough detail to find it |
|
|
2866 | const char * |
|
|
2867 | object::debug_desc (char *info) const |
|
|
2868 | { |
|
|
2869 | char info2[256 * 3]; |
|
|
2870 | char *p = info; |
|
|
2871 | |
|
|
2872 | p += snprintf (p, 256, "%d=\"%s%s%s\"", |
|
|
2873 | count, |
|
|
2874 | &name, |
|
|
2875 | title ? " " : "", |
|
|
2876 | title ? (const char *)title : ""); |
|
|
2877 | |
|
|
2878 | if (env) |
|
|
2879 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
|
|
2880 | |
|
|
2881 | if (map) |
|
|
2882 | p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); |
|
|
2883 | |
|
|
2884 | return info; |
|
|
2885 | } |
|
|
2886 | |
|
|
2887 | const char * |
|
|
2888 | object::debug_desc () const |
|
|
2889 | { |
|
|
2890 | static char info[256 * 3]; |
|
|
2891 | return debug_desc (info); |
|
|
2892 | } |
|
|
2893 | |