ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.47 by root, Thu Sep 14 22:33:59 2006 UTC vs.
Revision 1.73 by root, Wed Dec 20 01:19:11 2006 UTC

… …
29#include <sys/types.h> 29#include <sys/types.h>
30#include <sys/uio.h> 30#include <sys/uio.h>
31#include <object.h> 31#include <object.h>
32#include <funcpoint.h> 32#include <funcpoint.h>
33#include <loader.h> 33#include <loader.h>
34
35#include <bitset>
34 36
35int nrofallocobjects = 0; 37int nrofallocobjects = 0;
36static UUID uuid; 38static UUID uuid;
37const uint64 UUID_SKIP = 1<<19; 39const uint64 UUID_SKIP = 1<<19;
38 40
… …
104 _exit (1); 106 _exit (1);
105 } 107 }
106 108
107 uuid.seq = uid; 109 uuid.seq = uid;
108 write_uuid (); 110 write_uuid ();
109 LOG (llevDebug, "read UID: %lld\n", uid); 111 LOG (llevDebug, "read UID: %" PRId64 "\n", uid);
110 fclose (fp); 112 fclose (fp);
111} 113}
112 114
113UUID 115UUID
114gen_uuid () 116gen_uuid ()
… …
183 * 185 *
184 * Note that this function appears a lot longer than the macro it 186 * Note that this function appears a lot longer than the macro it
185 * replaces - this is mostly for clarity - a decent compiler should hopefully 187 * replaces - this is mostly for clarity - a decent compiler should hopefully
186 * reduce this to the same efficiency. 188 * reduce this to the same efficiency.
187 * 189 *
188 * Check nrof variable *before* calling CAN_MERGE() 190 * Check nrof variable *before* calling can_merge()
189 * 191 *
190 * Improvements made with merge: Better checking on potion, and also 192 * Improvements made with merge: Better checking on potion, and also
191 * check weight 193 * check weight
192 */ 194 */
193 195
194bool object::can_merge (object *ob1, object *ob2) 196bool object::can_merge_slow (object *ob1, object *ob2)
195{ 197{
196 /* A couple quicksanity checks */ 198 /* A couple quicksanity checks */
197 if ((ob1 == ob2) || (ob1->type != ob2->type)) 199 if (ob1 == ob2
200 || ob1->type != ob2->type
201 || ob1->speed != ob2->speed
202 || ob1->value != ob2->value
203 || ob1->name != ob2->name)
198 return 0; 204 return 0;
199 205
200 if (ob1->speed != ob2->speed) 206 //TODO: this ain't working well, use nicer and correct overflow check
201 return 0;
202
203 /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that 207 /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
204 * value could not be stored in a sint32 (which unfortunately sometimes is 208 * value could not be stored in a sint32 (which unfortunately sometimes is
205 * used to store nrof). 209 * used to store nrof).
206 */ 210 */
207 if (ob1->nrof + ob2->nrof >= 1UL << 31) 211 if (ob1->nrof + ob2->nrof >= 1UL << 31)
… …
217 SET_FLAG (ob1, FLAG_BEEN_APPLIED); 221 SET_FLAG (ob1, FLAG_BEEN_APPLIED);
218 222
219 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) 223 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
220 SET_FLAG (ob2, FLAG_BEEN_APPLIED); 224 SET_FLAG (ob2, FLAG_BEEN_APPLIED);
221 225
222 226 if ((ob1->flags ^ ob2->flags).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
223 /* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something 227 || ob1->arch != ob2->arch
224 * being locked in inventory should prevent merging.
225 * 0x4 in flags3 is CLIENT_SENT
226 */
227 if ((ob1->arch != ob2->arch) ||
228 (ob1->flags[0] != ob2->flags[0]) ||
229 (ob1->flags[1] != ob2->flags[1]) ||
230 ((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
231 ((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
232 (ob1->name != ob2->name) || 228 || ob1->name != ob2->name
233 (ob1->title != ob2->title) || 229 || ob1->title != ob2->title
234 (ob1->msg != ob2->msg) || 230 || ob1->msg != ob2->msg
235 (ob1->weight != ob2->weight) || 231 || ob1->weight != ob2->weight
236 (memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) || 232 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
237 (memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) || 233 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
238 (ob1->attacktype != ob2->attacktype) || 234 || ob1->attacktype != ob2->attacktype
239 (ob1->magic != ob2->magic) || 235 || ob1->magic != ob2->magic
240 (ob1->slaying != ob2->slaying) || 236 || ob1->slaying != ob2->slaying
241 (ob1->skill != ob2->skill) || 237 || ob1->skill != ob2->skill
242 (ob1->value != ob2->value) || 238 || ob1->value != ob2->value
243 (ob1->animation_id != ob2->animation_id) || 239 || ob1->animation_id != ob2->animation_id
244 (ob1->client_type != ob2->client_type) || 240 || ob1->client_type != ob2->client_type
245 (ob1->materialname != ob2->materialname) || 241 || ob1->materialname != ob2->materialname
246 (ob1->lore != ob2->lore) || 242 || ob1->lore != ob2->lore
247 (ob1->subtype != ob2->subtype) || 243 || ob1->subtype != ob2->subtype
248 (ob1->move_type != ob2->move_type) || 244 || ob1->move_type != ob2->move_type
249 (ob1->move_block != ob2->move_block) || 245 || ob1->move_block != ob2->move_block
250 (ob1->move_allow != ob2->move_allow) || 246 || ob1->move_allow != ob2->move_allow
251 (ob1->move_on != ob2->move_on) || 247 || ob1->move_on != ob2->move_on
252 (ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty)) 248 || ob1->move_off != ob2->move_off
249 || ob1->move_slow != ob2->move_slow
250 || ob1->move_slow_penalty != ob2->move_slow_penalty)
253 return 0; 251 return 0;
254 252
255 /* This is really a spellbook check - really, we should 253 /* This is really a spellbook check - really, we should
256 * check all objects in the inventory. 254 * check all objects in the inventory.
257 */ 255 */
… …
260 /* if one object has inventory but the other doesn't, not equiv */ 258 /* if one object has inventory but the other doesn't, not equiv */
261 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) 259 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
262 return 0; 260 return 0;
263 261
264 /* Now check to see if the two inventory objects could merge */ 262 /* Now check to see if the two inventory objects could merge */
265 if (!CAN_MERGE (ob1->inv, ob2->inv)) 263 if (!object::can_merge (ob1->inv, ob2->inv))
266 return 0; 264 return 0;
267 265
268 /* inventory ok - still need to check rest of this object to see 266 /* inventory ok - still need to check rest of this object to see
269 * if it is valid. 267 * if it is valid.
270 */ 268 */
… …
374 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 372 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
375 * Some error messages. 373 * Some error messages.
376 * The result of the dump is stored in the static global errmsg array. 374 * The result of the dump is stored in the static global errmsg array.
377 */ 375 */
378 376
379void 377char *
380dump_object2 (object *op)
381{
382 errmsg[0] = 0;
383 return;
384 //TODO//D#d#
385#if 0
386 char *cp;
387
388/* object *tmp;*/
389
390 if (op->arch != NULL)
391 {
392 strcat (errmsg, "arch ");
393 strcat (errmsg, op->arch->name ? op->arch->name : "(null)");
394 strcat (errmsg, "\n");
395 if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
396 strcat (errmsg, cp);
397# if 0
398 /* Don't dump player diffs - they are too long, mostly meaningless, and
399 * will overflow the buffer.
400 * Changed so that we don't dump inventory either. This may
401 * also overflow the buffer.
402 */
403 if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
404 strcat (errmsg, cp);
405 for (tmp = op->inv; tmp; tmp = tmp->below)
406 dump_object2 (tmp);
407# endif
408 strcat (errmsg, "end\n");
409 }
410 else
411 {
412 strcat (errmsg, "Object ");
413 if (op->name == NULL)
414 strcat (errmsg, "(null)");
415 else
416 strcat (errmsg, op->name);
417 strcat (errmsg, "\n");
418# if 0
419 if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
420 strcat (errmsg, cp);
421 for (tmp = op->inv; tmp; tmp = tmp->below)
422 dump_object2 (tmp);
423# endif
424 strcat (errmsg, "end\n");
425 }
426#endif
427}
428
429/*
430 * Dumps an object. Returns output in the static global errmsg array.
431 */
432
433void
434dump_object (object *op) 378dump_object (object *op)
435{ 379{
436 if (op == NULL) 380 if (!op)
437 { 381 return strdup ("[NULLOBJ]");
438 strcpy (errmsg, "[NULL pointer]");
439 return;
440 }
441 errmsg[0] = '\0';
442 dump_object2 (op);
443}
444 382
445void 383 object_freezer freezer;
446dump_all_objects (void) 384 save_object (freezer, op, 3);
447{ 385 return freezer.as_string ();
448 object *op;
449
450 for (op = object::first; op != NULL; op = op->next)
451 {
452 dump_object (op);
453 fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);
454 }
455} 386}
456 387
457/* 388/*
458 * get_nearest_part(multi-object, object 2) returns the part of the 389 * get_nearest_part(multi-object, object 2) returns the part of the
459 * multi-object 1 which is closest to the second object. 390 * multi-object 1 which is closest to the second object.
… …
479 */ 410 */
480 411
481object * 412object *
482find_object (tag_t i) 413find_object (tag_t i)
483{ 414{
484 object *op;
485
486 for (op = object::first; op != NULL; op = op->next) 415 for (object *op = object::first; op; op = op->next)
487 if (op->count == i) 416 if (op->count == i)
488 break; 417 return op;
418
489 return op; 419 return 0;
490} 420}
491 421
492/* 422/*
493 * Returns the first object which has a name equal to the argument. 423 * Returns the first object which has a name equal to the argument.
494 * Used only by the patch command, but not all that useful. 424 * Used only by the patch command, but not all that useful.
… …
594 524
595 if (settings.casting_time) 525 if (settings.casting_time)
596 casting_time = -1; 526 casting_time = -1;
597} 527}
598 528
599void object::clone (object *destination)
600{
601 *(object_copy *)destination = *this;
602 *(object_pod *)destination = *this;
603
604 if (self || cb)
605 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
606}
607
608/* 529/*
609 * copy object first frees everything allocated by the second object, 530 * copy_to first frees everything allocated by the dst object,
610 * and then copies the contends of the first object into the second 531 * and then copies the contents of itself into the second
611 * object, allocating what needs to be allocated. Basically, any 532 * object, allocating what needs to be allocated. Basically, any
612 * data that is malloc'd needs to be re-malloc/copied. Otherwise, 533 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
613 * if the first object is freed, the pointers in the new object 534 * if the first object is freed, the pointers in the new object
614 * will point at garbage. 535 * will point at garbage.
615 */ 536 */
616void 537void
617copy_object (object *op2, object *op) 538object::copy_to (object *dst)
618{ 539{
619 bool is_freed = QUERY_FLAG (op, FLAG_FREED); 540 bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
620 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); 541 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
621 542
622 op2->clone (op); 543 *(object_copy *)dst = *this;
544 *(object_pod *)dst = *this;
545
546 if (self || cb)
547 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));
623 548
624 if (is_freed) 549 if (is_freed)
625 SET_FLAG (op, FLAG_FREED); 550 SET_FLAG (dst, FLAG_FREED);
551
626 if (is_removed) 552 if (is_removed)
627 SET_FLAG (op, FLAG_REMOVED); 553 SET_FLAG (dst, FLAG_REMOVED);
628 554
629 if (op2->speed < 0) 555 if (speed < 0)
630 op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0; 556 dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
631 557
632 /* Copy over key_values, if any. */ 558 /* Copy over key_values, if any. */
633 if (op2->key_values) 559 if (key_values)
634 { 560 {
635 key_value *tail = 0; 561 key_value *tail = 0;
636 key_value *i; 562 key_value *i;
637 563
638 op->key_values = 0; 564 dst->key_values = 0;
639 565
640 for (i = op2->key_values; i; i = i->next) 566 for (i = key_values; i; i = i->next)
641 { 567 {
642 key_value *new_link = new key_value; 568 key_value *new_link = new key_value;
643 569
644 new_link->next = 0; 570 new_link->next = 0;
645 new_link->key = i->key; 571 new_link->key = i->key;
646 new_link->value = i->value; 572 new_link->value = i->value;
647 573
648 /* Try and be clever here, too. */ 574 /* Try and be clever here, too. */
649 if (!op->key_values) 575 if (!dst->key_values)
650 { 576 {
651 op->key_values = new_link; 577 dst->key_values = new_link;
652 tail = new_link; 578 tail = new_link;
653 } 579 }
654 else 580 else
655 { 581 {
656 tail->next = new_link; 582 tail->next = new_link;
657 tail = new_link; 583 tail = new_link;
658 } 584 }
659 } 585 }
660 } 586 }
661 587
662 update_ob_speed (op); 588 update_ob_speed (dst);
589}
590
591object *
592object::clone ()
593{
594 object *neu = create ();
595 copy_to (neu);
596 return neu;
663} 597}
664 598
665/* 599/*
666 * If an object with the IS_TURNABLE() flag needs to be turned due 600 * If an object with the IS_TURNABLE() flag needs to be turned due
667 * to the closest player being on the other side, this function can 601 * to the closest player being on the other side, this function can
… …
872 update_now = 1; 806 update_now = 1;
873 807
874 if ((move_slow | op->move_slow) != move_slow) 808 if ((move_slow | op->move_slow) != move_slow)
875 update_now = 1; 809 update_now = 1;
876 } 810 }
811
877 /* if the object is being removed, we can't make intelligent 812 /* if the object is being removed, we can't make intelligent
878 * decisions, because remove_ob can't really pass the object 813 * decisions, because remove_ob can't really pass the object
879 * that is being removed. 814 * that is being removed.
880 */ 815 */
881 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 816 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
… …
907 else 842 else
908 { 843 {
909 delete *i; 844 delete *i;
910 mortals.erase (i); 845 mortals.erase (i);
911 } 846 }
912
913 static int lastmortals = 0;//D
914
915 if (mortals.size() != lastmortals)//D
916 {
917 lastmortals = mortals.size ();//D
918 LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
919 }
920} 847}
921 848
922object::object () 849object::object ()
923{ 850{
924 SET_FLAG (this, FLAG_REMOVED); 851 SET_FLAG (this, FLAG_REMOVED);
… …
946 object::first = this; 873 object::first = this;
947} 874}
948 875
949void object::unlink () 876void object::unlink ()
950{ 877{
951 //count = 0;//D
952 if (!prev && !next) return;//D
953
954 if (this == object::first) 878 if (this == object::first)
955 object::first = next; 879 object::first = next;
956 880
957 /* Remove this object from the list of used objects */ 881 /* Remove this object from the list of used objects */
958 if (prev) prev->next = next; 882 if (prev) prev->next = next;
… …
974 * it from the list of used objects, and puts it on the list of 898 * it from the list of used objects, and puts it on the list of
975 * free objects. The IS_FREED() flag is set in the object. 899 * free objects. The IS_FREED() flag is set in the object.
976 * The object must have been removed by remove_ob() first for 900 * The object must have been removed by remove_ob() first for
977 * this function to succeed. 901 * this function to succeed.
978 * 902 *
979 * If free_inventory is set, free inventory as well. Else drop items in 903 * If destroy_inventory is set, free inventory as well. Else drop items in
980 * inventory to the ground. 904 * inventory to the ground.
981 */ 905 */
982void object::free (bool free_inventory) 906void object::destroy (bool destroy_inventory)
983{ 907{
984 if (QUERY_FLAG (this, FLAG_FREED)) 908 if (QUERY_FLAG (this, FLAG_FREED))
985 return; 909 return;
986 910
987 if (QUERY_FLAG (this, FLAG_FRIENDLY)) 911 if (QUERY_FLAG (this, FLAG_FRIENDLY))
988 remove_friendly_object (this); 912 remove_friendly_object (this);
989 913
990 if (!QUERY_FLAG (this, FLAG_REMOVED)) 914 if (!QUERY_FLAG (this, FLAG_REMOVED))
991 remove_ob (this); 915 remove ();
992 916
993 SET_FLAG (this, FLAG_FREED); 917 SET_FLAG (this, FLAG_FREED);
994 918
995 if (more) 919 if (more)
996 { 920 {
997 more->free (free_inventory); 921 more->destroy (destroy_inventory);
998 more = 0; 922 more = 0;
999 } 923 }
1000 924
1001 if (inv) 925 if (inv)
1002 { 926 {
1003 /* Only if the space blocks everything do we not process - 927 /* Only if the space blocks everything do we not process -
1004 * if some form of movement is allowed, let objects 928 * if some form of movement is allowed, let objects
1005 * drop on that space. 929 * drop on that space.
1006 */ 930 */
1007 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) 931 if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1008 { 932 {
1009 object *op = inv; 933 object *op = inv;
1010 934
1011 while (op) 935 while (op)
1012 { 936 {
1013 object *tmp = op->below; 937 object *tmp = op->below;
1014 op->free (free_inventory); 938 op->destroy (destroy_inventory);
1015 op = tmp; 939 op = tmp;
1016 } 940 }
1017 } 941 }
1018 else 942 else
1019 { /* Put objects in inventory onto this space */ 943 { /* Put objects in inventory onto this space */
… …
1021 945
1022 while (op) 946 while (op)
1023 { 947 {
1024 object *tmp = op->below; 948 object *tmp = op->below;
1025 949
1026 remove_ob (op); 950 op->remove ();
1027 951
1028 if (QUERY_FLAG (op, FLAG_STARTEQUIP) 952 if (QUERY_FLAG (op, FLAG_STARTEQUIP)
1029 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) 953 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
1030 free_object (op); 954 op->destroy ();
1031 else 955 else
1032 { 956 {
1033 op->x = x; 957 op->x = x;
1034 op->y = y; 958 op->y = y;
1035 insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ 959 insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
… …
1038 op = tmp; 962 op = tmp;
1039 } 963 }
1040 } 964 }
1041 } 965 }
1042 966
967 // hack to ensure that freed objects still have a valid map
968 {
969 static maptile *freed_map; // freed objects are moved here to avoid crashes
970
971 if (!freed_map)
972 {
973 freed_map = new maptile;
974
975 freed_map->name = "/internal/freed_objects_map";
976 freed_map->width = 3;
977 freed_map->height = 3;
978
979 freed_map->allocate ();
980 }
981
982 map = freed_map;
983 x = 1;
984 y = 1;
985 }
986
1043 // clear those pointers that likely might have circular references to us 987 // clear those pointers that likely might have circular references to us
1044 owner = 0; 988 owner = 0;
1045 enemy = 0; 989 enemy = 0;
1046 attacked_by = 0; 990 attacked_by = 0;
1047 991
992 // only relevant for players(?), but make sure of it anyways
993 contr = 0;
994
1048 /* Remove object from the active list */ 995 /* Remove object from the active list */
1049 speed = 0; 996 speed = 0;
1050 update_ob_speed (this); 997 update_ob_speed (this);
1051 998
1052 unlink (); 999 unlink ();
… …
1056 1003
1057/* 1004/*
1058 * sub_weight() recursively (outwards) subtracts a number from the 1005 * sub_weight() recursively (outwards) subtracts a number from the
1059 * weight of an object (and what is carried by it's environment(s)). 1006 * weight of an object (and what is carried by it's environment(s)).
1060 */ 1007 */
1061
1062void 1008void
1063sub_weight (object *op, signed long weight) 1009sub_weight (object *op, signed long weight)
1064{ 1010{
1065 while (op != NULL) 1011 while (op != NULL)
1066 { 1012 {
… …
1070 op->carrying -= weight; 1016 op->carrying -= weight;
1071 op = op->env; 1017 op = op->env;
1072 } 1018 }
1073} 1019}
1074 1020
1075/* remove_ob(op): 1021/* op->remove ():
1076 * This function removes the object op from the linked list of objects 1022 * This function removes the object op from the linked list of objects
1077 * which it is currently tied to. When this function is done, the 1023 * which it is currently tied to. When this function is done, the
1078 * object will have no environment. If the object previously had an 1024 * object will have no environment. If the object previously had an
1079 * environment, the x and y coordinates will be updated to 1025 * environment, the x and y coordinates will be updated to
1080 * the previous environment. 1026 * the previous environment.
1081 * Beware: This function is called from the editor as well! 1027 * Beware: This function is called from the editor as well!
1082 */ 1028 */
1083
1084void 1029void
1085remove_ob (object *op) 1030object::remove ()
1086{ 1031{
1087 object *tmp, *last = 0; 1032 object *tmp, *last = 0;
1088 object *otmp; 1033 object *otmp;
1089 1034
1090 tag_t tag;
1091 int check_walk_off; 1035 int check_walk_off;
1092 mapstruct *m;
1093 1036
1094 sint16 x, y;
1095
1096 if (QUERY_FLAG (op, FLAG_REMOVED)) 1037 if (QUERY_FLAG (this, FLAG_REMOVED))
1097 return; 1038 return;
1098 1039
1099 SET_FLAG (op, FLAG_REMOVED); 1040 SET_FLAG (this, FLAG_REMOVED);
1100 1041
1101 if (op->more != NULL) 1042 if (more)
1102 remove_ob (op->more); 1043 more->remove ();
1103 1044
1104 /* 1045 /*
1105 * In this case, the object to be removed is in someones 1046 * In this case, the object to be removed is in someones
1106 * inventory. 1047 * inventory.
1107 */ 1048 */
1108 if (op->env != NULL) 1049 if (env)
1109 { 1050 {
1110 if (op->nrof) 1051 if (nrof)
1111 sub_weight (op->env, op->weight * op->nrof); 1052 sub_weight (env, weight * nrof);
1112 else 1053 else
1113 sub_weight (op->env, op->weight + op->carrying); 1054 sub_weight (env, weight + carrying);
1114 1055
1115 /* NO_FIX_PLAYER is set when a great many changes are being 1056 /* NO_FIX_PLAYER is set when a great many changes are being
1116 * made to players inventory. If set, avoiding the call 1057 * made to players inventory. If set, avoiding the call
1117 * to save cpu time. 1058 * to save cpu time.
1118 */ 1059 */
1119 if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1060 if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1120 fix_player (otmp); 1061 fix_player (otmp);
1121 1062
1122 if (op->above != NULL) 1063 if (above != NULL)
1123 op->above->below = op->below; 1064 above->below = below;
1124 else 1065 else
1125 op->env->inv = op->below; 1066 env->inv = below;
1126 1067
1127 if (op->below != NULL) 1068 if (below != NULL)
1128 op->below->above = op->above; 1069 below->above = above;
1129 1070
1130 /* we set up values so that it could be inserted into 1071 /* we set up values so that it could be inserted into
1131 * the map, but we don't actually do that - it is up 1072 * the map, but we don't actually do that - it is up
1132 * to the caller to decide what we want to do. 1073 * to the caller to decide what we want to do.
1133 */ 1074 */
1134 op->x = op->env->x, op->y = op->env->y; 1075 x = env->x, y = env->y;
1135 op->map = op->env->map; 1076 map = env->map;
1136 op->above = NULL, op->below = NULL; 1077 above = 0, below = 0;
1137 op->env = NULL; 1078 env = 0;
1138 } 1079 }
1139 else if (op->map) 1080 else if (map)
1140 { 1081 {
1141 x = op->x;
1142 y = op->y;
1143 m = get_map_from_coord (op->map, &x, &y);
1144
1145 if (!m)
1146 {
1147 LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1148 op->map->path, op->x, op->y);
1149 /* in old days, we used to set x and y to 0 and continue.
1150 * it seems if we get into this case, something is probablye
1151 * screwed up and should be fixed.
1152 */
1153 abort ();
1154 }
1155
1156 if (op->map != m)
1157 LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1158 op->map->path, m->path, op->x, op->y, x, y);
1159
1160 /* Re did the following section of code - it looks like it had 1082 /* Re did the following section of code - it looks like it had
1161 * lots of logic for things we no longer care about 1083 * lots of logic for things we no longer care about
1162 */ 1084 */
1163 1085
1164 /* link the object above us */ 1086 /* link the object above us */
1165 if (op->above) 1087 if (above)
1166 op->above->below = op->below; 1088 above->below = below;
1167 else 1089 else
1168 SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ 1090 SET_MAP_TOP (map, x, y, below); /* we were top, set new top */
1169 1091
1170 /* Relink the object below us, if there is one */ 1092 /* Relink the object below us, if there is one */
1171 if (op->below) 1093 if (below)
1172 op->below->above = op->above; 1094 below->above = above;
1173 else 1095 else
1174 { 1096 {
1175 /* Nothing below, which means we need to relink map object for this space 1097 /* Nothing below, which means we need to relink map object for this space
1176 * use translated coordinates in case some oddness with map tiling is 1098 * use translated coordinates in case some oddness with map tiling is
1177 * evident 1099 * evident
1178 */ 1100 */
1179 if (GET_MAP_OB (m, x, y) != op) 1101 if (GET_MAP_OB (map, x, y) != this)
1180 { 1102 {
1181 dump_object (op); 1103 char *dump = dump_object (this);
1182 LOG (llevError, 1104 LOG (llevError,
1183 "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); 1105 "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);
1106 free (dump);
1184 dump_object (GET_MAP_OB (m, x, y)); 1107 dump = dump_object (GET_MAP_OB (map, x, y));
1185 LOG (llevError, "%s\n", errmsg); 1108 LOG (llevError, "%s\n", dump);
1109 free (dump);
1186 } 1110 }
1187 1111
1188 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ 1112 SET_MAP_OB (map, x, y, above); /* goes on above it. */
1189 } 1113 }
1190 1114
1191 op->above = 0; 1115 above = 0;
1192 op->below = 0; 1116 below = 0;
1193 1117
1194 if (op->map->in_memory == MAP_SAVING) 1118 if (map->in_memory == MAP_SAVING)
1195 return; 1119 return;
1196 1120
1197 tag = op->count;
1198 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); 1121 check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);
1199 1122
1200 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1123 for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)
1201 { 1124 {
1202 /* No point updating the players look faces if he is the object 1125 /* No point updating the players look faces if he is the object
1203 * being removed. 1126 * being removed.
1204 */ 1127 */
1205 1128
1206 if (tmp->type == PLAYER && tmp != op) 1129 if (tmp->type == PLAYER && tmp != this)
1207 { 1130 {
1208 /* If a container that the player is currently using somehow gets 1131 /* If a container that the player is currently using somehow gets
1209 * removed (most likely destroyed), update the player view 1132 * removed (most likely destroyed), update the player view
1210 * appropriately. 1133 * appropriately.
1211 */ 1134 */
1212 if (tmp->container == op) 1135 if (tmp->container == this)
1213 { 1136 {
1214 CLEAR_FLAG (op, FLAG_APPLIED); 1137 CLEAR_FLAG (this, FLAG_APPLIED);
1215 tmp->container = NULL; 1138 tmp->container = 0;
1216 } 1139 }
1217 1140
1218 tmp->contr->socket.update_look = 1; 1141 tmp->contr->socket->floorbox_update ();
1219 } 1142 }
1220 1143
1221 /* See if player moving off should effect something */ 1144 /* See if player moving off should effect something */
1222 if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1145 if (check_walk_off
1146 && ((move_type & tmp->move_off)
1147 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1223 { 1148 {
1224 move_apply (tmp, op, NULL); 1149 move_apply (tmp, this, 0);
1225 1150
1226 if (was_destroyed (op, tag)) 1151 if (destroyed ())
1227 {
1228 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); 1152 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1229 }
1230 } 1153 }
1231 1154
1232 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1155 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1233 1156
1234 if (tmp->above == tmp) 1157 if (tmp->above == tmp)
1235 tmp->above = NULL; 1158 tmp->above = 0;
1236 1159
1237 last = tmp; 1160 last = tmp;
1238 } 1161 }
1239 1162
1240 /* last == NULL of there are no objects on this space */ 1163 /* last == NULL of there are no objects on this space */
1241 if (last == NULL) 1164 if (!last)
1242 { 1165 {
1243 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, 1166 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1244 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures 1167 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1245 * those out anyways, and if there are any flags set right now, they won't 1168 * those out anyways, and if there are any flags set right now, they won't
1246 * be correct anyways. 1169 * be correct anyways.
1247 */ 1170 */
1248 SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE); 1171 SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1249 update_position (op->map, op->x, op->y); 1172 update_position (map, x, y);
1250 } 1173 }
1251 else 1174 else
1252 update_object (last, UP_OBJ_REMOVE); 1175 update_object (last, UP_OBJ_REMOVE);
1253 1176
1254 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) 1177 if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)
1255 update_all_los (op->map, op->x, op->y); 1178 update_all_los (map, x, y);
1256 } 1179 }
1257} 1180}
1258 1181
1259/* 1182/*
1260 * merge_ob(op,top): 1183 * merge_ob(op,top):
… …
1275 1198
1276 for (; top != NULL; top = top->below) 1199 for (; top != NULL; top = top->below)
1277 { 1200 {
1278 if (top == op) 1201 if (top == op)
1279 continue; 1202 continue;
1280 if (CAN_MERGE (op, top)) 1203
1204 if (object::can_merge (op, top))
1281 { 1205 {
1282 top->nrof += op->nrof; 1206 top->nrof += op->nrof;
1283 1207
1284/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ 1208/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1285 op->weight = 0; /* Don't want any adjustements now */ 1209 op->weight = 0; /* Don't want any adjustements now */
1286 remove_ob (op); 1210 op->destroy ();
1287 free_object (op);
1288 return top; 1211 return top;
1289 } 1212 }
1290 } 1213 }
1291 1214
1292 return 0; 1215 return 0;
… …
1295/* 1218/*
1296 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1219 * same as insert_ob_in_map except it handle separate coordinates and do a clean
1297 * job preparing multi-part monsters 1220 * job preparing multi-part monsters
1298 */ 1221 */
1299object * 1222object *
1300insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) 1223insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1301{ 1224{
1302 object *tmp; 1225 object *tmp;
1303 1226
1304 if (op->head) 1227 if (op->head)
1305 op = op->head; 1228 op = op->head;
… …
1333 * NULL if 'op' was destroyed 1256 * NULL if 'op' was destroyed
1334 * just 'op' otherwise 1257 * just 'op' otherwise
1335 */ 1258 */
1336 1259
1337object * 1260object *
1338insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) 1261insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1339{ 1262{
1340 object *tmp, *top, *floor = NULL; 1263 object *tmp, *top, *floor = NULL;
1341 sint16 x, y; 1264 sint16 x, y;
1342 1265
1343 if (QUERY_FLAG (op, FLAG_FREED)) 1266 if (QUERY_FLAG (op, FLAG_FREED))
… …
1346 return NULL; 1269 return NULL;
1347 } 1270 }
1348 1271
1349 if (m == NULL) 1272 if (m == NULL)
1350 { 1273 {
1351 dump_object (op); 1274 char *dump = dump_object (op);
1352 LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg); 1275 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1276 free (dump);
1353 return op; 1277 return op;
1354 } 1278 }
1355 1279
1356 if (out_of_map (m, op->x, op->y)) 1280 if (out_of_map (m, op->x, op->y))
1357 { 1281 {
1358 dump_object (op); 1282 char *dump = dump_object (op);
1359 LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg); 1283 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1360#ifdef MANY_CORES 1284#ifdef MANY_CORES
1361 /* Better to catch this here, as otherwise the next use of this object 1285 /* Better to catch this here, as otherwise the next use of this object
1362 * is likely to cause a crash. Better to find out where it is getting 1286 * is likely to cause a crash. Better to find out where it is getting
1363 * improperly inserted. 1287 * improperly inserted.
1364 */ 1288 */
1365 abort (); 1289 abort ();
1366#endif 1290#endif
1291 free (dump);
1367 return op; 1292 return op;
1368 } 1293 }
1369 1294
1370 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1295 if (!QUERY_FLAG (op, FLAG_REMOVED))
1371 { 1296 {
1372 dump_object (op); 1297 char *dump = dump_object (op);
1373 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg); 1298 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1299 free (dump);
1374 return op; 1300 return op;
1375 } 1301 }
1376 1302
1377 if (op->more != NULL) 1303 if (op->more != NULL)
1378 { 1304 {
… …
1416 1342
1417 /* this has to be done after we translate the coordinates. 1343 /* this has to be done after we translate the coordinates.
1418 */ 1344 */
1419 if (op->nrof && !(flag & INS_NO_MERGE)) 1345 if (op->nrof && !(flag & INS_NO_MERGE))
1420 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) 1346 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)
1421 if (CAN_MERGE (op, tmp)) 1347 if (object::can_merge (op, tmp))
1422 { 1348 {
1423 op->nrof += tmp->nrof; 1349 op->nrof += tmp->nrof;
1424 remove_ob (tmp); 1350 tmp->destroy ();
1425 free_object (tmp);
1426 } 1351 }
1427 1352
1428 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1353 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1429 CLEAR_FLAG (op, FLAG_INV_LOCKED); 1354 CLEAR_FLAG (op, FLAG_INV_LOCKED);
1430 1355
… …
1558 * it, so save a few ticks and start from there. 1483 * it, so save a few ticks and start from there.
1559 */ 1484 */
1560 if (!(flag & INS_MAP_LOAD)) 1485 if (!(flag & INS_MAP_LOAD))
1561 for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1486 for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1562 if (tmp->type == PLAYER) 1487 if (tmp->type == PLAYER)
1563 tmp->contr->socket.update_look = 1; 1488 tmp->contr->socket->floorbox_update ();
1564 1489
1565 /* If this object glows, it may affect lighting conditions that are 1490 /* If this object glows, it may affect lighting conditions that are
1566 * visible to others on this map. But update_all_los is really 1491 * visible to others on this map. But update_all_los is really
1567 * an inefficient way to do this, as it means los for all players 1492 * an inefficient way to do this, as it means los for all players
1568 * on the map will get recalculated. The players could very well 1493 * on the map will get recalculated. The players could very well
… …
1576 1501
1577 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1502 /* updates flags (blocked, alive, no magic, etc) for this map space */
1578 update_object (op, UP_OBJ_INSERT); 1503 update_object (op, UP_OBJ_INSERT);
1579 1504
1580 /* Don't know if moving this to the end will break anything. However, 1505 /* Don't know if moving this to the end will break anything. However,
1581 * we want to have update_look set above before calling this. 1506 * we want to have floorbox_update called before calling this.
1582 * 1507 *
1583 * check_move_on() must be after this because code called from 1508 * check_move_on() must be after this because code called from
1584 * check_move_on() depends on correct map flags (so functions like 1509 * check_move_on() depends on correct map flags (so functions like
1585 * blocked() and wall() work properly), and these flags are updated by 1510 * blocked() and wall() work properly), and these flags are updated by
1586 * update_object(). 1511 * update_object().
… …
1616 tmp1; 1541 tmp1;
1617 1542
1618 /* first search for itself and remove any old instances */ 1543 /* first search for itself and remove any old instances */
1619 1544
1620 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1545 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1621 {
1622 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1546 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1623 { 1547 tmp->destroy ();
1624 remove_ob (tmp);
1625 free_object (tmp);
1626 }
1627 }
1628 1548
1629 tmp1 = arch_to_object (archetype::find (arch_string)); 1549 tmp1 = arch_to_object (archetype::find (arch_string));
1630 1550
1631 tmp1->x = op->x; 1551 tmp1->x = op->x;
1632 tmp1->y = op->y; 1552 tmp1->y = op->y;
… …
1642 */ 1562 */
1643 1563
1644object * 1564object *
1645get_split_ob (object *orig_ob, uint32 nr) 1565get_split_ob (object *orig_ob, uint32 nr)
1646{ 1566{
1647 object * 1567 object *newob;
1648 newob;
1649 int
1650 is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); 1568 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1651 1569
1652 if (orig_ob->nrof < nr) 1570 if (orig_ob->nrof < nr)
1653 { 1571 {
1654 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); 1572 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1655 return NULL; 1573 return NULL;
1656 } 1574 }
1657 1575
1658 newob = object_create_clone (orig_ob); 1576 newob = object_create_clone (orig_ob);
1659 1577
1660 if ((orig_ob->nrof -= nr) < 1) 1578 if ((orig_ob->nrof -= nr) < 1)
1661 { 1579 orig_ob->destroy (1);
1662 if (!is_removed)
1663 remove_ob (orig_ob);
1664 free_object2 (orig_ob, 1);
1665 }
1666 else if (!is_removed) 1580 else if (!is_removed)
1667 { 1581 {
1668 if (orig_ob->env != NULL) 1582 if (orig_ob->env != NULL)
1669 sub_weight (orig_ob->env, orig_ob->weight * nr); 1583 sub_weight (orig_ob->env, orig_ob->weight * nr);
1670 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) 1584 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
… …
1700 if (i > op->nrof) 1614 if (i > op->nrof)
1701 i = op->nrof; 1615 i = op->nrof;
1702 1616
1703 if (QUERY_FLAG (op, FLAG_REMOVED)) 1617 if (QUERY_FLAG (op, FLAG_REMOVED))
1704 op->nrof -= i; 1618 op->nrof -= i;
1705 else if (op->env != NULL) 1619 else if (op->env)
1706 { 1620 {
1707 /* is this object in the players inventory, or sub container 1621 /* is this object in the players inventory, or sub container
1708 * therein? 1622 * therein?
1709 */ 1623 */
1710 tmp = is_player_inv (op->env); 1624 tmp = is_player_inv (op->env);
… …
1716 */ 1630 */
1717 if (!tmp) 1631 if (!tmp)
1718 { 1632 {
1719 for (pl = first_player; pl; pl = pl->next) 1633 for (pl = first_player; pl; pl = pl->next)
1720 if (pl->ob->container == op->env) 1634 if (pl->ob->container == op->env)
1635 {
1636 tmp = pl->ob;
1721 break; 1637 break;
1722 if (pl) 1638 }
1723 tmp = pl->ob;
1724 else
1725 tmp = NULL;
1726 } 1639 }
1727 1640
1728 if (i < op->nrof) 1641 if (i < op->nrof)
1729 { 1642 {
1730 sub_weight (op->env, op->weight * i); 1643 sub_weight (op->env, op->weight * i);
1731 op->nrof -= i; 1644 op->nrof -= i;
1732 if (tmp) 1645 if (tmp)
1733 {
1734 esrv_send_item (tmp, op); 1646 esrv_send_item (tmp, op);
1735 }
1736 } 1647 }
1737 else 1648 else
1738 { 1649 {
1739 remove_ob (op); 1650 op->remove ();
1740 op->nrof = 0; 1651 op->nrof = 0;
1741 if (tmp) 1652 if (tmp)
1742 {
1743 esrv_del_item (tmp->contr, op->count); 1653 esrv_del_item (tmp->contr, op->count);
1744 }
1745 } 1654 }
1746 } 1655 }
1747 else 1656 else
1748 { 1657 {
1749 object *above = op->above; 1658 object *above = op->above;
1750 1659
1751 if (i < op->nrof) 1660 if (i < op->nrof)
1752 op->nrof -= i; 1661 op->nrof -= i;
1753 else 1662 else
1754 { 1663 {
1755 remove_ob (op); 1664 op->remove ();
1756 op->nrof = 0; 1665 op->nrof = 0;
1757 } 1666 }
1758 1667
1759 /* Since we just removed op, op->above is null */ 1668 /* Since we just removed op, op->above is null */
1760 for (tmp = above; tmp != NULL; tmp = tmp->above) 1669 for (tmp = above; tmp; tmp = tmp->above)
1761 if (tmp->type == PLAYER) 1670 if (tmp->type == PLAYER)
1762 { 1671 {
1763 if (op->nrof) 1672 if (op->nrof)
1764 esrv_send_item (tmp, op); 1673 esrv_send_item (tmp, op);
1765 else 1674 else
… …
1769 1678
1770 if (op->nrof) 1679 if (op->nrof)
1771 return op; 1680 return op;
1772 else 1681 else
1773 { 1682 {
1774 free_object (op); 1683 op->destroy ();
1775 return NULL; 1684 return 0;
1776 } 1685 }
1777} 1686}
1778 1687
1779/* 1688/*
1780 * add_weight(object, weight) adds the specified weight to an object, 1689 * add_weight(object, weight) adds the specified weight to an object,
… …
1792 op->carrying += weight; 1701 op->carrying += weight;
1793 op = op->env; 1702 op = op->env;
1794 } 1703 }
1795} 1704}
1796 1705
1706object *
1707insert_ob_in_ob (object *op, object *where)
1708{
1709 if (!where)
1710 {
1711 char *dump = dump_object (op);
1712 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1713 free (dump);
1714 return op;
1715 }
1716
1717 if (where->head)
1718 {
1719 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");
1720 where = where->head;
1721 }
1722
1723 return where->insert (op);
1724}
1725
1797/* 1726/*
1798 * insert_ob_in_ob(op,environment): 1727 * env->insert (op)
1799 * This function inserts the object op in the linked list 1728 * This function inserts the object op in the linked list
1800 * inside the object environment. 1729 * inside the object environment.
1801 * 1730 *
1802 * Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter
1803 * the inventory at the last position or next to other objects of the same
1804 * type.
1805 * Frank: Now sorted by type, archetype and magic!
1806 *
1807 * The function returns now pointer to inserted item, and return value can 1731 * The function returns now pointer to inserted item, and return value can
1808 * be != op, if items are merged. -Tero 1732 * be != op, if items are merged. -Tero
1809 */ 1733 */
1810 1734
1811object * 1735object *
1812insert_ob_in_ob (object *op, object *where) 1736object::insert (object *op)
1813{ 1737{
1814 object * 1738 object *tmp, *otmp;
1815 tmp, *
1816 otmp;
1817 1739
1818 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1740 if (!QUERY_FLAG (op, FLAG_REMOVED))
1819 { 1741 op->remove ();
1820 dump_object (op);
1821 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);
1822 return op;
1823 }
1824
1825 if (where == NULL)
1826 {
1827 dump_object (op);
1828 LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);
1829 return op;
1830 }
1831
1832 if (where->head)
1833 {
1834 LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");
1835 where = where->head;
1836 }
1837 1742
1838 if (op->more) 1743 if (op->more)
1839 { 1744 {
1840 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); 1745 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1841 return op; 1746 return op;
… …
1843 1748
1844 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1749 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1845 CLEAR_FLAG (op, FLAG_REMOVED); 1750 CLEAR_FLAG (op, FLAG_REMOVED);
1846 if (op->nrof) 1751 if (op->nrof)
1847 { 1752 {
1848 for (tmp = where->inv; tmp != NULL; tmp = tmp->below) 1753 for (tmp = inv; tmp != NULL; tmp = tmp->below)
1849 if (CAN_MERGE (tmp, op)) 1754 if (object::can_merge (tmp, op))
1850 { 1755 {
1851 /* return the original object and remove inserted object 1756 /* return the original object and remove inserted object
1852 (client needs the original object) */ 1757 (client needs the original object) */
1853 tmp->nrof += op->nrof; 1758 tmp->nrof += op->nrof;
1854 /* Weight handling gets pretty funky. Since we are adding to 1759 /* Weight handling gets pretty funky. Since we are adding to
1855 * tmp->nrof, we need to increase the weight. 1760 * tmp->nrof, we need to increase the weight.
1856 */ 1761 */
1857 add_weight (where, op->weight * op->nrof); 1762 add_weight (this, op->weight * op->nrof);
1858 SET_FLAG (op, FLAG_REMOVED); 1763 SET_FLAG (op, FLAG_REMOVED);
1859 free_object (op); /* free the inserted object */ 1764 op->destroy (); /* free the inserted object */
1860 op = tmp; 1765 op = tmp;
1861 remove_ob (op); /* and fix old object's links */ 1766 op->remove (); /* and fix old object's links */
1862 CLEAR_FLAG (op, FLAG_REMOVED); 1767 CLEAR_FLAG (op, FLAG_REMOVED);
1863 break; 1768 break;
1864 } 1769 }
1865 1770
1866 /* I assume combined objects have no inventory 1771 /* I assume combined objects have no inventory
1867 * We add the weight - this object could have just been removed 1772 * We add the weight - this object could have just been removed
1868 * (if it was possible to merge). calling remove_ob will subtract 1773 * (if it was possible to merge). calling remove_ob will subtract
1869 * the weight, so we need to add it in again, since we actually do 1774 * the weight, so we need to add it in again, since we actually do
1870 * the linking below 1775 * the linking below
1871 */ 1776 */
1872 add_weight (where, op->weight * op->nrof); 1777 add_weight (this, op->weight * op->nrof);
1873 } 1778 }
1874 else 1779 else
1875 add_weight (where, (op->weight + op->carrying)); 1780 add_weight (this, (op->weight + op->carrying));
1876 1781
1877 otmp = is_player_inv (where); 1782 otmp = is_player_inv (this);
1878 if (otmp && otmp->contr != NULL) 1783 if (otmp && otmp->contr)
1879 {
1880 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1784 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1881 fix_player (otmp); 1785 fix_player (otmp);
1882 }
1883 1786
1884 op->map = NULL; 1787 op->map = NULL;
1885 op->env = where; 1788 op->env = this;
1886 op->above = NULL; 1789 op->above = NULL;
1887 op->below = NULL; 1790 op->below = NULL;
1888 op->x = 0, op->y = 0; 1791 op->x = 0, op->y = 0;
1889 1792
1890 /* reset the light list and los of the players on the map */ 1793 /* reset the light list and los of the players on the map */
1891 if ((op->glow_radius != 0) && where->map) 1794 if ((op->glow_radius != 0) && map)
1892 { 1795 {
1893#ifdef DEBUG_LIGHTS 1796#ifdef DEBUG_LIGHTS
1894 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); 1797 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1895#endif /* DEBUG_LIGHTS */ 1798#endif /* DEBUG_LIGHTS */
1896 if (MAP_DARKNESS (where->map)) 1799 if (MAP_DARKNESS (map))
1897 update_all_los (where->map, where->x, where->y); 1800 update_all_los (map, x, y);
1898 } 1801 }
1899 1802
1900 /* Client has no idea of ordering so lets not bother ordering it here. 1803 /* Client has no idea of ordering so lets not bother ordering it here.
1901 * It sure simplifies this function... 1804 * It sure simplifies this function...
1902 */ 1805 */
1903 if (where->inv == NULL) 1806 if (!inv)
1904 where->inv = op; 1807 inv = op;
1905 else 1808 else
1906 { 1809 {
1907 op->below = where->inv; 1810 op->below = inv;
1908 op->below->above = op; 1811 op->below->above = op;
1909 where->inv = op; 1812 inv = op;
1910 } 1813 }
1814
1911 return op; 1815 return op;
1912} 1816}
1913 1817
1914/* 1818/*
1915 * Checks if any objects has a move_type that matches objects 1819 * Checks if any objects has a move_type that matches objects
… …
1933 */ 1837 */
1934 1838
1935int 1839int
1936check_move_on (object *op, object *originator) 1840check_move_on (object *op, object *originator)
1937{ 1841{
1938 object * 1842 object *tmp;
1939 tmp; 1843 maptile *m = op->map;
1940 tag_t
1941 tag;
1942 mapstruct *
1943 m = op->map;
1944 int
1945 x = op->x, y = op->y; 1844 int x = op->x, y = op->y;
1946 1845
1947 MoveType 1846 MoveType move_on, move_slow, move_block;
1948 move_on,
1949 move_slow,
1950 move_block;
1951 1847
1952 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1848 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1953 return 0; 1849 return 0;
1954
1955 tag = op->count;
1956 1850
1957 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1851 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1958 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1852 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1959 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1853 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1960 1854
… …
2021 if ((!op->move_type && tmp->move_on & MOVE_WALK) || 1915 if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
2022 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) 1916 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2023 { 1917 {
2024 move_apply (tmp, op, originator); 1918 move_apply (tmp, op, originator);
2025 1919
2026 if (was_destroyed (op, tag)) 1920 if (op->destroyed ())
2027 return 1; 1921 return 1;
2028 1922
2029 /* what the person/creature stepped onto has moved the object 1923 /* what the person/creature stepped onto has moved the object
2030 * someplace new. Don't process any further - if we did, 1924 * someplace new. Don't process any further - if we did,
2031 * have a feeling strange problems would result. 1925 * have a feeling strange problems would result.
… …
2043 * a matching archetype at the given map and coordinates. 1937 * a matching archetype at the given map and coordinates.
2044 * The first matching object is returned, or NULL if none. 1938 * The first matching object is returned, or NULL if none.
2045 */ 1939 */
2046 1940
2047object * 1941object *
2048present_arch (const archetype *at, mapstruct *m, int x, int y) 1942present_arch (const archetype *at, maptile *m, int x, int y)
2049{ 1943{
2050 object * 1944 object *
2051 tmp; 1945 tmp;
2052 1946
2053 if (m == NULL || out_of_map (m, x, y)) 1947 if (m == NULL || out_of_map (m, x, y))
… …
2066 * a matching type variable at the given map and coordinates. 1960 * a matching type variable at the given map and coordinates.
2067 * The first matching object is returned, or NULL if none. 1961 * The first matching object is returned, or NULL if none.
2068 */ 1962 */
2069 1963
2070object * 1964object *
2071present (unsigned char type, mapstruct *m, int x, int y) 1965present (unsigned char type, maptile *m, int x, int y)
2072{ 1966{
2073 object * 1967 object *
2074 tmp; 1968 tmp;
2075 1969
2076 if (out_of_map (m, x, y)) 1970 if (out_of_map (m, x, y))
… …
2216 * the archetype because that isn't correct if the monster has been 2110 * the archetype because that isn't correct if the monster has been
2217 * customized, changed states, etc. 2111 * customized, changed states, etc.
2218 */ 2112 */
2219 2113
2220int 2114int
2221find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) 2115find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2222{ 2116{
2223 int 2117 int
2224 i, 2118 i,
2225 index = 0, flag; 2119 index = 0, flag;
2226 static int 2120 static int
… …
2247 return -1; 2141 return -1;
2248 return altern[RANDOM () % index]; 2142 return altern[RANDOM () % index];
2249} 2143}
2250 2144
2251/* 2145/*
2252 * find_first_free_spot(archetype, mapstruct, x, y) works like 2146 * find_first_free_spot(archetype, maptile, x, y) works like
2253 * find_free_spot(), but it will search max number of squares. 2147 * find_free_spot(), but it will search max number of squares.
2254 * But it will return the first available spot, not a random choice. 2148 * But it will return the first available spot, not a random choice.
2255 * Changed 0.93.2: Have it return -1 if there is no free spot available. 2149 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2256 */ 2150 */
2257 2151
2258int 2152int
2259find_first_free_spot (const object *ob, mapstruct *m, int x, int y) 2153find_first_free_spot (const object *ob, maptile *m, int x, int y)
2260{ 2154{
2261 int 2155 int
2262 i; 2156 i;
2263 2157
2264 for (i = 0; i < SIZEOFFREE; i++) 2158 for (i = 0; i < SIZEOFFREE; i++)
… …
2328 * because we have to know what movement the thing looking to move 2222 * because we have to know what movement the thing looking to move
2329 * there is capable of. 2223 * there is capable of.
2330 */ 2224 */
2331 2225
2332int 2226int
2333find_dir (mapstruct *m, int x, int y, object *exclude) 2227find_dir (maptile *m, int x, int y, object *exclude)
2334{ 2228{
2335 int 2229 int
2336 i, 2230 i,
2337 max = SIZEOFFREE, mflags; 2231 max = SIZEOFFREE, mflags;
2338 2232
2339 sint16 nx, ny; 2233 sint16 nx, ny;
2340 object * 2234 object *
2341 tmp; 2235 tmp;
2342 mapstruct * 2236 maptile *
2343 mp; 2237 mp;
2344 2238
2345 MoveType blocked, move_type; 2239 MoveType blocked, move_type;
2346 2240
2347 if (exclude && exclude->head) 2241 if (exclude && exclude->head)
… …
2555 * Modified to be map tile aware -.MSW 2449 * Modified to be map tile aware -.MSW
2556 */ 2450 */
2557 2451
2558 2452
2559int 2453int
2560can_see_monsterP (mapstruct *m, int x, int y, int dir) 2454can_see_monsterP (maptile *m, int x, int y, int dir)
2561{ 2455{
2562 sint16 dx, dy; 2456 sint16 dx, dy;
2563 int 2457 int
2564 mflags; 2458 mflags;
2565 2459
… …
2614 * create clone from object to another 2508 * create clone from object to another
2615 */ 2509 */
2616object * 2510object *
2617object_create_clone (object *asrc) 2511object_create_clone (object *asrc)
2618{ 2512{
2619 object *
2620 dst = NULL, *tmp, *src, *part, *prev, *item; 2513 object *dst = 0, *tmp, *src, *part, *prev, *item;
2621 2514
2622 if (!asrc) 2515 if (!asrc)
2623 return NULL; 2516 return 0;
2517
2624 src = asrc; 2518 src = asrc;
2625 if (src->head) 2519 if (src->head)
2626 src = src->head; 2520 src = src->head;
2627 2521
2628 prev = NULL; 2522 prev = 0;
2629 for (part = src; part; part = part->more) 2523 for (part = src; part; part = part->more)
2630 { 2524 {
2631 tmp = get_object (); 2525 tmp = part->clone ();
2632 copy_object (part, tmp);
2633 tmp->x -= src->x; 2526 tmp->x -= src->x;
2634 tmp->y -= src->y; 2527 tmp->y -= src->y;
2528
2635 if (!part->head) 2529 if (!part->head)
2636 { 2530 {
2637 dst = tmp; 2531 dst = tmp;
2638 tmp->head = NULL; 2532 tmp->head = 0;
2639 } 2533 }
2640 else 2534 else
2641 { 2535 {
2642 tmp->head = dst; 2536 tmp->head = dst;
2643 } 2537 }
2538
2644 tmp->more = NULL; 2539 tmp->more = 0;
2540
2645 if (prev) 2541 if (prev)
2646 prev->more = tmp; 2542 prev->more = tmp;
2543
2647 prev = tmp; 2544 prev = tmp;
2648 } 2545 }
2649 2546
2650 /*** copy inventory ***/
2651 for (item = src->inv; item; item = item->below) 2547 for (item = src->inv; item; item = item->below)
2652 {
2653 (void) insert_ob_in_ob (object_create_clone (item), dst); 2548 insert_ob_in_ob (object_create_clone (item), dst);
2654 }
2655 2549
2656 return dst; 2550 return dst;
2657} 2551}
2658 2552
2659/* return true if the object was destroyed, 0 otherwise */
2660int
2661was_destroyed (const object *op, tag_t old_tag)
2662{
2663 /* checking for FLAG_FREED isn't necessary, but makes this function more
2664 * robust */
2665 return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);
2666}
2667
2668/* GROS - Creates an object using a string representing its content. */ 2553/* GROS - Creates an object using a string representing its content. */
2669
2670/* Basically, we save the content of the string to a temp file, then call */ 2554/* Basically, we save the content of the string to a temp file, then call */
2671
2672/* load_object on it. I admit it is a highly inefficient way to make things, */ 2555/* load_object on it. I admit it is a highly inefficient way to make things, */
2673
2674/* but it was simple to make and allows reusing the load_object function. */ 2556/* but it was simple to make and allows reusing the load_object function. */
2675
2676/* Remember not to use load_object_str in a time-critical situation. */ 2557/* Remember not to use load_object_str in a time-critical situation. */
2677
2678/* Also remember that multiparts objects are not supported for now. */ 2558/* Also remember that multiparts objects are not supported for now. */
2679 2559
2680object * 2560object *
2681load_object_str (const char *obstr) 2561load_object_str (const char *obstr)
2682{ 2562{
2683 object * 2563 object *op;
2684 op;
2685 char
2686 filename[MAX_BUF]; 2564 char filename[MAX_BUF];
2687 2565
2688 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); 2566 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2689 2567
2690 FILE *
2691 tempfile = fopen (filename, "w"); 2568 FILE *tempfile = fopen (filename, "w");
2692 2569
2693 if (tempfile == NULL) 2570 if (tempfile == NULL)
2694 { 2571 {
2695 LOG (llevError, "Error - Unable to access load object temp file\n"); 2572 LOG (llevError, "Error - Unable to access load object temp file\n");
2696 return NULL; 2573 return NULL;
2697 } 2574 }
2698 2575
2699 fprintf (tempfile, obstr); 2576 fprintf (tempfile, obstr);
2700 fclose (tempfile); 2577 fclose (tempfile);
2701 2578
2702 op = get_object (); 2579 op = object::create ();
2703 2580
2704 object_thawer thawer (filename); 2581 object_thawer thawer (filename);
2705 2582
2706 if (thawer) 2583 if (thawer)
2707 load_object (thawer, op, 0); 2584 load_object (thawer, op, 0);
… …
2717 * returns NULL if no match. 2594 * returns NULL if no match.
2718 */ 2595 */
2719object * 2596object *
2720find_obj_by_type_subtype (const object *who, int type, int subtype) 2597find_obj_by_type_subtype (const object *who, int type, int subtype)
2721{ 2598{
2722 object * 2599 object *tmp;
2723 tmp;
2724 2600
2725 for (tmp = who->inv; tmp; tmp = tmp->below) 2601 for (tmp = who->inv; tmp; tmp = tmp->below)
2726 if (tmp->type == type && tmp->subtype == subtype) 2602 if (tmp->type == type && tmp->subtype == subtype)
2727 return tmp; 2603 return tmp;
2728 2604
… …
2736 * do the desired thing. 2612 * do the desired thing.
2737 */ 2613 */
2738key_value * 2614key_value *
2739get_ob_key_link (const object *ob, const char *key) 2615get_ob_key_link (const object *ob, const char *key)
2740{ 2616{
2741 key_value * 2617 key_value *link;
2742 link;
2743 2618
2744 for (link = ob->key_values; link != NULL; link = link->next) 2619 for (link = ob->key_values; link != NULL; link = link->next)
2745 {
2746 if (link->key == key) 2620 if (link->key == key)
2747 {
2748 return link; 2621 return link;
2749 }
2750 }
2751 2622
2752 return NULL; 2623 return NULL;
2753} 2624}
2754 2625
2755/* 2626/*

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines