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.210 by root, Mon Apr 21 07:01:40 2008 UTC vs.
Revision 1.232 by root, Tue May 6 18:09:42 2008 UTC

… …
24#include <global.h> 24#include <global.h>
25#include <stdio.h> 25#include <stdio.h>
26#include <sys/types.h> 26#include <sys/types.h>
27#include <sys/uio.h> 27#include <sys/uio.h>
28#include <object.h> 28#include <object.h>
29#include <funcpoint.h>
30#include <sproto.h> 29#include <sproto.h>
31#include <loader.h> 30#include <loader.h>
32 31
33#include <bitset> 32#include <bitset>
34 33
… …
140 139
141/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 140/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
142static bool 141static bool
143compare_ob_value_lists_one (const object *wants, const object *has) 142compare_ob_value_lists_one (const object *wants, const object *has)
144{ 143{
145 key_value *wants_field;
146
147 /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both 144 /* n-squared behaviour (see kv_get), but I'm hoping both
148 * objects with lists are rare, and lists stay short. If not, use a 145 * objects with lists are rare, and lists stay short. If not, use a
149 * different structure or at least keep the lists sorted... 146 * different structure or at least keep the lists sorted...
150 */ 147 */
151 148
152 /* For each field in wants, */ 149 /* For each field in wants, */
153 for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) 150 for (key_value *kv = wants->key_values; kv; kv = kv->next)
154 { 151 if (has->kv_get (kv->key) != kv->value)
155 key_value *has_field; 152 return false;
156
157 /* Look for a field in has with the same key. */
158 has_field = get_ob_key_link (has, wants_field->key);
159
160 if (!has_field)
161 return 0; /* No field with that name. */
162
163 /* Found the matching field. */
164 if (has_field->value != wants_field->value)
165 return 0; /* Values don't match, so this half of the comparison is false. */
166
167 /* If we get here, we found a match. Now for the next field in wants. */
168 }
169 153
170 /* If we get here, every field in wants has a matching field in has. */ 154 /* If we get here, every field in wants has a matching field in has. */
171 return 1; 155 return true;
172} 156}
173 157
174/* Returns TRUE if ob1 has the same key_values as ob2. */ 158/* Returns TRUE if ob1 has the same key_values as ob2. */
175static bool 159static bool
176compare_ob_value_lists (const object *ob1, const object *ob2) 160compare_ob_value_lists (const object *ob1, const object *ob2)
177{ 161{
178 /* However, there may be fields in has which aren't partnered in wants, 162 /* However, there may be fields in has which aren't partnered in wants,
179 * so we need to run the comparison *twice*. :( 163 * so we need to run the comparison *twice*. :(
180 */ 164 */
181 return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1); 165 return compare_ob_value_lists_one (ob1, ob2)
166 && compare_ob_value_lists_one (ob2, ob1);
182} 167}
183 168
184/* Function examines the 2 objects given to it, and returns true if 169/* Function examines the 2 objects given to it, and returns true if
185 * they can be merged together. 170 * they can be merged together.
186 * 171 *
… …
331 316
332 /* Everything passes, must be OK. */ 317 /* Everything passes, must be OK. */
333 return 1; 318 return 1;
334} 319}
335 320
321// find player who can see this object
322object *
323object::visible_to () const
324{
325 if (client_visible () && !flag [FLAG_REMOVED])
326 {
327 // see if we are in a container of sorts
328 if (env)
329 {
330 // the player inventory itself is always visible
331 if (env->type == PLAYER)
332 return env;
333
334 // else a player could have our env open
335 object *envest = env->outer_env ();
336
337 // the player itself is always on a map, so we will find him here
338 // even if our inv is in a player.
339 if (envest->is_on_map ())
340 if (object *pl = envest->ms ().player ())
341 if (pl->container == env)
342 return pl;
343 }
344 else
345 {
346 // maybe there is a player standing on the same mapspace
347 // this will catch the case where "this" is a player
348 if (object *pl = ms ().player ())
349 if (!pl->container || this == pl->container)
350 return pl;
351 }
352 }
353
354 return 0;
355}
356
336// adjust weight per container type ("of holding") 357// adjust weight per container type ("of holding")
337static sint32 358static sint32
338weight_adjust (object *op, sint32 weight) 359weight_adjust (object *op, sint32 weight)
339{ 360{
340 return op->type == CONTAINER 361 return op->type == CONTAINER
… …
351{ 372{
352 while (op) 373 while (op)
353 { 374 {
354 weight = weight_adjust (op, weight); 375 weight = weight_adjust (op, weight);
355 376
377 if (!weight)
378 return;
379
356 op->carrying += weight; 380 op->carrying += weight;
381
382 if (object *pl = op->visible_to ())
383 if (pl != op) // player is handled lazily
384 esrv_update_item (UPD_WEIGHT, pl, op);
385
357 op = op->env; 386 op = op->env;
358 } 387 }
359} 388}
360 389
361/* 390/*
… …
374 op->update_weight (); 403 op->update_weight ();
375 404
376 sum += op->total_weight (); 405 sum += op->total_weight ();
377 } 406 }
378 407
379 carrying = weight_adjust (this, sum); 408 sum = weight_adjust (this, sum);
409
410 if (sum != carrying)
411 {
412 carrying = sum;
413
414 if (object *pl = visible_to ())
415 if (pl != this) // player is handled lazily
416 esrv_update_item (UPD_WEIGHT, pl, this);
417 }
380} 418}
381 419
382/* 420/*
383 * Used by: Server DM commands: dumpbelow, dump. Some error messages. 421 * Used by: Server DM commands: dumpbelow, dump. Some error messages.
384 */ 422 */
… …
551 } 589 }
552 590
553 op->key_values = 0; 591 op->key_values = 0;
554} 592}
555 593
556object & 594/*
557object::operator =(const object &src) 595 * copy_to first frees everything allocated by the dst object,
596 * and then copies the contents of itself into the second
597 * object, allocating what needs to be allocated. Basically, any
598 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
599 * if the first object is freed, the pointers in the new object
600 * will point at garbage.
601 */
602void
603object::copy_to (object *dst)
558{ 604{
559 bool is_freed = flag [FLAG_FREED]; 605 dst->remove ();
560 bool is_removed = flag [FLAG_REMOVED];
561
562 *(object_copy *)this = src; 606 *(object_copy *)dst = *this;
563
564 flag [FLAG_FREED] = is_freed;
565 flag [FLAG_REMOVED] = is_removed; 607 dst->flag [FLAG_REMOVED] = true;
566 608
567 /* Copy over key_values, if any. */ 609 /* Copy over key_values, if any. */
568 if (src.key_values) 610 if (key_values)
569 { 611 {
570 key_value *tail = 0; 612 key_value *tail = 0;
571 key_values = 0; 613 dst->key_values = 0;
572 614
573 for (key_value *i = src.key_values; i; i = i->next) 615 for (key_value *i = key_values; i; i = i->next)
574 { 616 {
575 key_value *new_link = new key_value; 617 key_value *new_link = new key_value;
576 618
577 new_link->next = 0; 619 new_link->next = 0;
578 new_link->key = i->key; 620 new_link->key = i->key;
579 new_link->value = i->value; 621 new_link->value = i->value;
580 622
581 /* Try and be clever here, too. */ 623 /* Try and be clever here, too. */
582 if (!key_values) 624 if (!dst->key_values)
583 { 625 {
584 key_values = new_link; 626 dst->key_values = new_link;
585 tail = new_link; 627 tail = new_link;
586 } 628 }
587 else 629 else
588 { 630 {
589 tail->next = new_link; 631 tail->next = new_link;
590 tail = new_link; 632 tail = new_link;
591 } 633 }
592 } 634 }
593 } 635 }
594}
595
596/*
597 * copy_to first frees everything allocated by the dst object,
598 * and then copies the contents of itself into the second
599 * object, allocating what needs to be allocated. Basically, any
600 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
601 * if the first object is freed, the pointers in the new object
602 * will point at garbage.
603 */
604void
605object::copy_to (object *dst)
606{
607 *dst = *this;
608 636
609 if (speed < 0) 637 if (speed < 0)
610 dst->speed_left -= rndm (); 638 dst->speed_left -= rndm ();
611 639
612 dst->set_speed (dst->speed); 640 dst->set_speed (dst->speed);
… …
634object * 662object *
635object::clone () 663object::clone ()
636{ 664{
637 object *neu = create (); 665 object *neu = create ();
638 copy_to (neu); 666 copy_to (neu);
667 neu->map = map; // not copied by copy_to
639 return neu; 668 return neu;
640} 669}
641 670
642/* 671/*
643 * If an object with the IS_TURNABLE() flag needs to be turned due 672 * If an object with the IS_TURNABLE() flag needs to be turned due
… …
694 * UP_OBJ_FACE: only the objects face has changed. 723 * UP_OBJ_FACE: only the objects face has changed.
695 */ 724 */
696void 725void
697update_object (object *op, int action) 726update_object (object *op, int action)
698{ 727{
699 if (op == NULL) 728 if (!op)
700 { 729 {
701 /* this should never happen */ 730 /* this should never happen */
702 LOG (llevDebug, "update_object() called for NULL object.\n"); 731 LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
703 return; 732 return;
704 } 733 }
705 734
706 if (op->env) 735 if (!op->is_on_map ())
707 { 736 {
708 /* Animation is currently handled by client, so nothing 737 /* Animation is currently handled by client, so nothing
709 * to do in this case. 738 * to do in this case.
710 */ 739 */
711 return; 740 return;
712 } 741 }
713
714 /* If the map is saving, don't do anything as everything is
715 * going to get freed anyways.
716 */
717 if (!op->map || op->map->in_memory == MAP_SAVING)
718 return;
719 742
720 /* make sure the object is within map boundaries */ 743 /* make sure the object is within map boundaries */
721 if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) 744 if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
722 { 745 {
723 LOG (llevError, "update_object() called for object out of map!\n"); 746 LOG (llevError, "update_object() called for object out of map!\n");
… …
866object::destroy_inv (bool drop_to_ground) 889object::destroy_inv (bool drop_to_ground)
867{ 890{
868 // need to check first, because the checks below might segfault 891 // need to check first, because the checks below might segfault
869 // as we might be on an invalid mapspace and crossfire code 892 // as we might be on an invalid mapspace and crossfire code
870 // is too buggy to ensure that the inventory is empty. 893 // is too buggy to ensure that the inventory is empty.
871 // corollary: if you create arrows etc. with stuff in tis inventory, 894 // corollary: if you create arrows etc. with stuff in its inventory,
872 // cf will crash below with off-map x and y 895 // cf will crash below with off-map x and y
873 if (!inv) 896 if (!inv)
874 return; 897 return;
875 898
876 /* Only if the space blocks everything do we not process - 899 /* Only if the space blocks everything do we not process -
… …
883 || map->nodrop 906 || map->nodrop
884 || ms ().move_block == MOVE_ALL) 907 || ms ().move_block == MOVE_ALL)
885 { 908 {
886 while (inv) 909 while (inv)
887 { 910 {
888 inv->destroy_inv (drop_to_ground); 911 inv->destroy_inv (false);
889 inv->destroy (); 912 inv->destroy ();
890 } 913 }
891 } 914 }
892 else 915 else
893 { /* Put objects in inventory onto this space */ 916 { /* Put objects in inventory onto this space */
… …
899 || op->flag [FLAG_NO_DROP] 922 || op->flag [FLAG_NO_DROP]
900 || op->type == RUNE 923 || op->type == RUNE
901 || op->type == TRAP 924 || op->type == TRAP
902 || op->flag [FLAG_IS_A_TEMPLATE] 925 || op->flag [FLAG_IS_A_TEMPLATE]
903 || op->flag [FLAG_DESTROY_ON_DEATH]) 926 || op->flag [FLAG_DESTROY_ON_DEATH])
904 op->destroy (); 927 op->destroy (true);
905 else 928 else
906 map->insert (op, x, y); 929 map->insert (op, x, y);
907 } 930 }
908 } 931 }
909} 932}
… …
913 object *op = new object; 936 object *op = new object;
914 op->link (); 937 op->link ();
915 return op; 938 return op;
916} 939}
917 940
941static struct freed_map : maptile
942{
943 freed_map ()
944 {
945 path = "<freed objects map>";
946 name = "/internal/freed_objects_map";
947 width = 3;
948 height = 3;
949 nodrop = 1;
950
951 alloc ();
952 in_memory = MAP_ACTIVE;
953 }
954
955 ~freed_map ()
956 {
957 destroy ();
958 }
959} freed_map; // freed objects are moved here to avoid crashes
960
918void 961void
919object::do_destroy () 962object::do_destroy ()
920{ 963{
921 attachable::do_destroy ();
922
923 if (flag [FLAG_IS_LINKED]) 964 if (flag [FLAG_IS_LINKED])
924 remove_button_link (this); 965 remove_button_link (this);
925 966
926 if (flag [FLAG_FRIENDLY]) 967 if (flag [FLAG_FRIENDLY])
927 remove_friendly_object (this); 968 remove_friendly_object (this);
928 969
929 if (!flag [FLAG_REMOVED])
930 remove (); 970 remove ();
931 971
932 destroy_inv (true); 972 attachable::do_destroy ();
933 973
934 deactivate (); 974 deactivate ();
935 unlink (); 975 unlink ();
936 976
937 flag [FLAG_FREED] = 1; 977 flag [FLAG_FREED] = 1;
938 978
939 // hack to ensure that freed objects still have a valid map 979 // hack to ensure that freed objects still have a valid map
940 {
941 static maptile *freed_map; // freed objects are moved here to avoid crashes
942
943 if (!freed_map)
944 {
945 freed_map = new maptile;
946
947 freed_map->path = "<freed objects map>";
948 freed_map->name = "/internal/freed_objects_map";
949 freed_map->width = 3;
950 freed_map->height = 3;
951 freed_map->nodrop = 1;
952
953 freed_map->alloc ();
954 freed_map->in_memory = MAP_ACTIVE;
955 }
956
957 map = freed_map; 980 map = &freed_map;
958 x = 1; 981 x = 1;
959 y = 1; 982 y = 1;
960 }
961 983
962 if (more) 984 if (more)
963 { 985 {
964 more->destroy (); 986 more->destroy ();
965 more = 0; 987 more = 0;
… …
978object::destroy (bool destroy_inventory) 1000object::destroy (bool destroy_inventory)
979{ 1001{
980 if (destroyed ()) 1002 if (destroyed ())
981 return; 1003 return;
982 1004
1005 if (!is_head () && !head->destroyed ())
1006 {
1007 LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1008 head->destroy (destroy_inventory);
1009 return;
1010 }
1011
983 if (destroy_inventory) 1012 destroy_inv (!destroy_inventory);
984 destroy_inv (false);
985 1013
986 if (is_head ()) 1014 if (is_head ())
987 if (sound_destroy) 1015 if (sound_destroy)
988 play_sound (sound_destroy); 1016 play_sound (sound_destroy);
989 else if (flag [FLAG_MONSTER]) 1017 else if (flag [FLAG_MONSTER])
… …
1003object::do_remove () 1031object::do_remove ()
1004{ 1032{
1005 object *tmp, *last = 0; 1033 object *tmp, *last = 0;
1006 object *otmp; 1034 object *otmp;
1007 1035
1008 if (QUERY_FLAG (this, FLAG_REMOVED)) 1036 if (flag [FLAG_REMOVED])
1009 return; 1037 return;
1010 1038
1011 SET_FLAG (this, FLAG_REMOVED);
1012 INVOKE_OBJECT (REMOVE, this); 1039 INVOKE_OBJECT (REMOVE, this);
1040
1041 flag [FLAG_REMOVED] = true;
1013 1042
1014 if (more) 1043 if (more)
1015 more->remove (); 1044 more->remove ();
1016 1045
1017 /* 1046 /*
1018 * In this case, the object to be removed is in someones 1047 * In this case, the object to be removed is in someones
1019 * inventory. 1048 * inventory.
1020 */ 1049 */
1021 if (env) 1050 if (env)
1022 { 1051 {
1052 flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1053 if (object *pl = visible_to ())
1054 esrv_del_item (pl->contr, count);
1055 flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1056
1023 adjust_weight (env, -total_weight ()); 1057 adjust_weight (env, -total_weight ());
1024 1058
1025 *(above ? &above->below : &env->inv) = below; 1059 *(above ? &above->below : &env->inv) = below;
1026 1060
1027 if (below) 1061 if (below)
… …
1045 if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1079 if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1046 otmp->update_stats (); 1080 otmp->update_stats ();
1047 } 1081 }
1048 else if (map) 1082 else if (map)
1049 { 1083 {
1050 if (type == PLAYER)
1051 {
1052 // leaving a spot always closes any open container on the ground
1053 if (container && !container->env)
1054 // this causes spurious floorbox updates, but it ensures
1055 // that the CLOSE event is being sent.
1056 close_container ();
1057
1058 --map->players;
1059 map->touch ();
1060 }
1061
1062 map->dirty = true; 1084 map->dirty = true;
1063 mapspace &ms = this->ms (); 1085 mapspace &ms = this->ms ();
1086
1087 if (object *pl = ms.player ())
1088 {
1089 if (type == PLAYER) // this == pl(!)
1090 {
1091 // leaving a spot always closes any open container on the ground
1092 if (container && !container->env)
1093 // this causes spurious floorbox updates, but it ensures
1094 // that the CLOSE event is being sent.
1095 close_container ();
1096
1097 --map->players;
1098 map->touch ();
1099 }
1100 else if (pl->container == this)
1101 {
1102 // removing a container should close it
1103 close_container ();
1104 }
1105
1106 esrv_del_item (pl->contr, count);
1107 }
1064 1108
1065 /* link the object above us */ 1109 /* link the object above us */
1066 if (above) 1110 if (above)
1067 above->below = below; 1111 above->below = below;
1068 else 1112 else
… …
1098 * removed (most likely destroyed), update the player view 1142 * removed (most likely destroyed), update the player view
1099 * appropriately. 1143 * appropriately.
1100 */ 1144 */
1101 pl->close_container (); 1145 pl->close_container ();
1102 1146
1147 //TODO: the floorbox prev/next might need updating
1148 //esrv_del_item (pl->contr, count);
1149 //TODO: update floorbox to preserve ordering
1150 if (pl->contr->ns)
1103 pl->contr->ns->floorbox_update (); 1151 pl->contr->ns->floorbox_update ();
1104 } 1152 }
1105 1153
1106 for (tmp = ms.bot; tmp; tmp = tmp->above) 1154 for (tmp = ms.bot; tmp; tmp = tmp->above)
1107 { 1155 {
1108 /* No point updating the players look faces if he is the object 1156 /* No point updating the players look faces if he is the object
… …
1152 if (!top) 1200 if (!top)
1153 for (top = op; top && top->above; top = top->above) 1201 for (top = op; top && top->above; top = top->above)
1154 ; 1202 ;
1155 1203
1156 for (; top; top = top->below) 1204 for (; top; top = top->below)
1157 {
1158 if (top == op)
1159 continue;
1160
1161 if (object::can_merge (op, top)) 1205 if (object::can_merge (op, top))
1162 { 1206 {
1163 top->nrof += op->nrof; 1207 top->nrof += op->nrof;
1164 1208
1165/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ 1209 if (object *pl = top->visible_to ())
1166 op->weight = 0; /* Don't want any adjustements now */ 1210 esrv_update_item (UPD_NROF, pl, top);
1211
1212 op->weight = 0; // cancel the addition above
1213 op->carrying = 0; // must be 0 already
1214
1167 op->destroy (); 1215 op->destroy (1);
1216
1168 return top; 1217 return top;
1169 } 1218 }
1170 }
1171 1219
1172 return 0; 1220 return 0;
1173} 1221}
1174 1222
1175void 1223void
… …
1234object * 1282object *
1235insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1283insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1236{ 1284{
1237 assert (!op->flag [FLAG_FREED]); 1285 assert (!op->flag [FLAG_FREED]);
1238 1286
1239 object *top, *floor = NULL;
1240
1241 op->remove (); 1287 op->remove ();
1242 1288
1243 /* Ideally, the caller figures this out. However, it complicates a lot 1289 /* Ideally, the caller figures this out. However, it complicates a lot
1244 * of areas of callers (eg, anything that uses find_free_spot would now 1290 * of areas of callers (eg, anything that uses find_free_spot would now
1245 * need extra work 1291 * need extra work
1246 */ 1292 */
1247 if (!xy_normalise (m, op->x, op->y)) 1293 if (!xy_normalise (m, op->x, op->y))
1248 { 1294 {
1249 op->destroy (); 1295 op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1250 return 0; 1296 return 0;
1251 } 1297 }
1252 1298
1253 if (object *more = op->more) 1299 if (object *more = op->more)
1254 if (!insert_ob_in_map (more, m, originator, flag)) 1300 if (!insert_ob_in_map (more, m, originator, flag))
… …
1263 */ 1309 */
1264 if (op->nrof && !(flag & INS_NO_MERGE)) 1310 if (op->nrof && !(flag & INS_NO_MERGE))
1265 for (object *tmp = ms.bot; tmp; tmp = tmp->above) 1311 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1266 if (object::can_merge (op, tmp)) 1312 if (object::can_merge (op, tmp))
1267 { 1313 {
1314 // TODO: we atcually want to update tmp, not op,
1315 // but some caller surely breaks when we return tmp
1316 // from here :/
1268 op->nrof += tmp->nrof; 1317 op->nrof += tmp->nrof;
1269 tmp->destroy (1); 1318 tmp->destroy (1);
1270 } 1319 }
1271 1320
1272 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1321 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
… …
1294 /* since *below* originator, no need to update top */ 1343 /* since *below* originator, no need to update top */
1295 originator->below = op; 1344 originator->below = op;
1296 } 1345 }
1297 else 1346 else
1298 { 1347 {
1348 object *top, *floor = NULL;
1349
1299 top = ms.bot; 1350 top = ms.bot;
1300 1351
1301 /* If there are other objects, then */ 1352 /* If there are other objects, then */
1302 if (top) 1353 if (top)
1303 { 1354 {
… …
1402 } 1453 }
1403 1454
1404 op->map->dirty = true; 1455 op->map->dirty = true;
1405 1456
1406 if (object *pl = ms.player ()) 1457 if (object *pl = ms.player ())
1458 //TODO: the floorbox prev/next might need updating
1459 //esrv_send_item (pl, op);
1460 //TODO: update floorbox to preserve ordering
1461 if (pl->contr->ns)
1407 pl->contr->ns->floorbox_update (); 1462 pl->contr->ns->floorbox_update ();
1408 1463
1409 /* If this object glows, it may affect lighting conditions that are 1464 /* If this object glows, it may affect lighting conditions that are
1410 * visible to others on this map. But update_all_los is really 1465 * visible to others on this map. But update_all_los is really
1411 * an inefficient way to do this, as it means los for all players 1466 * an inefficient way to do this, as it means los for all players
1412 * on the map will get recalculated. The players could very well 1467 * on the map will get recalculated. The players could very well
… …
1477 return where->env->insert (this); 1532 return where->env->insert (this);
1478 else 1533 else
1479 return where->map->insert (this, where->x, where->y, originator, flags); 1534 return where->map->insert (this, where->x, where->y, originator, flags);
1480} 1535}
1481 1536
1482// find player who can see this object
1483static object *
1484visible_to (object *op)
1485{
1486 if (!op->flag [FLAG_REMOVED])
1487 {
1488 // see if we are in a container of sorts
1489 if (object *env = op->env)
1490 {
1491 // the player inventory itself is always visible
1492 if (env->type == PLAYER)
1493 return env;
1494
1495 // else a player could have our env open
1496 env = env->outer_env ();
1497
1498 // the player itself is always on a map, so we will find him here
1499 // even if our inv is in a player.
1500 if (env->is_on_map ())
1501 if (object *pl = env->ms ().player ())
1502 if (pl->container == op->env)
1503 return pl;
1504 }
1505 else
1506 {
1507 // maybe there is a player standing on the same mapspace
1508 if (object *pl = env->ms ().player ())
1509 return pl;
1510 }
1511 }
1512
1513 return 0;
1514}
1515
1516/* 1537/*
1517 * decrease(object, number) decreases a specified number from 1538 * decrease(object, number) decreases a specified number from
1518 * the amount of an object. If the amount reaches 0, the object 1539 * the amount of an object. If the amount reaches 0, the object
1519 * is subsequently removed and freed. 1540 * is subsequently removed and freed.
1520 * 1541 *
1521 * Return value: 'op' if something is left, NULL if the amount reached 0 1542 * Return value: 'op' if something is left, NULL if the amount reached 0
1522 */ 1543 */
1523bool 1544bool
1524object::decrease (sint32 nr) 1545object::decrease (sint32 nr)
1525{ 1546{
1547 if (!nr)
1548 return true;
1549
1526 nr = min (nr, nrof); 1550 nr = min (nr, nrof);
1527 1551
1528 if (!nr)
1529 return 1;
1530
1531 nrof -= nr; 1552 nrof -= nr;
1532 1553
1533 object *visible = visible_to (this);
1534
1535 if (nrof) 1554 if (nrof)
1536 { 1555 {
1537 adjust_weight (env, -weight * nr); // carrying == 0 1556 adjust_weight (env, -weight * nr); // carrying == 0
1538 1557
1539 if (visible) 1558 if (object *pl = visible_to ())
1540 esrv_send_item (visible, this); 1559 esrv_update_item (UPD_NROF, pl, this);
1541 1560
1542 return 1; 1561 return true;
1543 } 1562 }
1544 else 1563 else
1545 { 1564 {
1546 if (visible)
1547 esrv_del_item (visible->contr, count);
1548
1549 this->destroy (1); 1565 destroy (1);
1550 return 0; 1566 return false;
1551 } 1567 }
1552} 1568}
1553 1569
1554/* 1570/*
1555 * split(ob,nr) splits up ob into two parts. The part which 1571 * split(ob,nr) splits up ob into two parts. The part which
… …
1558 * On failure, NULL is returned. 1574 * On failure, NULL is returned.
1559 */ 1575 */
1560object * 1576object *
1561object::split (sint32 nr) 1577object::split (sint32 nr)
1562{ 1578{
1579 int have = number_of ();
1580
1563 if (nrof < nr) 1581 if (have < nr)
1564 return 0; 1582 return 0;
1565 else if (nrof == nr) 1583 else if (have == nr)
1566 { 1584 {
1567 remove (); 1585 remove ();
1568 return this; 1586 return this;
1569 } 1587 }
1570 else 1588 else
1571 { 1589 {
1572 decrease (nr); 1590 decrease (nr);
1573 1591
1574 object *op = object_create_clone (this); 1592 object *op = deep_clone ();
1575 op->nrof = nr; 1593 op->nrof = nr;
1576 return op; 1594 return op;
1577 } 1595 }
1578} 1596}
1579 1597
… …
1623 if (object::can_merge (tmp, op)) 1641 if (object::can_merge (tmp, op))
1624 { 1642 {
1625 /* return the original object and remove inserted object 1643 /* return the original object and remove inserted object
1626 (client needs the original object) */ 1644 (client needs the original object) */
1627 tmp->nrof += op->nrof; 1645 tmp->nrof += op->nrof;
1646
1647 if (object *pl = tmp->visible_to ())
1648 esrv_update_item (UPD_NROF, pl, tmp);
1649
1628 adjust_weight (this, op->total_weight ()); 1650 adjust_weight (this, op->total_weight ());
1629 1651
1630 op->destroy (1); 1652 op->destroy (1);
1631 op = tmp; 1653 op = tmp;
1632 goto inserted; 1654 goto inserted;
… …
1646 1668
1647 inv = op; 1669 inv = op;
1648 1670
1649 op->flag [FLAG_REMOVED] = 0; 1671 op->flag [FLAG_REMOVED] = 0;
1650 1672
1673 if (object *pl = op->visible_to ())
1674 esrv_send_item (pl, op);
1675
1651 adjust_weight (this, op->total_weight ()); 1676 adjust_weight (this, op->total_weight ());
1652 1677
1653inserted: 1678inserted:
1654 /* reset the light list and los of the players on the map */ 1679 /* reset the light list and los of the players on the map */
1655 if (op->glow_radius && map && map->darkness) 1680 if (op->glow_radius && map && map->darkness)
1656 update_all_los (map, x, y); 1681 update_all_los (map, x, y);
1657 1682
1658 if (object *otmp = in_player ()) 1683 // if this is a player's inventory, update stats
1659 if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1684 if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1660 otmp->update_stats (); 1685 update_stats ();
1661 1686
1662 INVOKE_OBJECT (INSERT, this); 1687 INVOKE_OBJECT (INSERT, this);
1663 1688
1664 return op; 1689 return op;
1665} 1690}
… …
1793 LOG (llevError, "Present_arch called outside map.\n"); 1818 LOG (llevError, "Present_arch called outside map.\n");
1794 return NULL; 1819 return NULL;
1795 } 1820 }
1796 1821
1797 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) 1822 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1798 if (tmp->arch == at) 1823 if (tmp->arch->archname == at->archname)
1799 return tmp; 1824 return tmp;
1800 1825
1801 return NULL; 1826 return NULL;
1802} 1827}
1803 1828
… …
1867 * The first matching object is returned, or NULL if none. 1892 * The first matching object is returned, or NULL if none.
1868 */ 1893 */
1869object * 1894object *
1870present_arch_in_ob (const archetype *at, const object *op) 1895present_arch_in_ob (const archetype *at, const object *op)
1871{ 1896{
1872 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1897 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1873 if (tmp->arch == at) 1898 if (tmp->arch->archname == at->archname)
1874 return tmp; 1899 return tmp;
1875 1900
1876 return NULL; 1901 return NULL;
1877} 1902}
1878 1903
… …
2287 2312
2288/* 2313/*
2289 * create clone from object to another 2314 * create clone from object to another
2290 */ 2315 */
2291object * 2316object *
2292object_create_clone (object *asrc) 2317object::deep_clone ()
2293{ 2318{
2294 object *dst = 0, *tmp, *src, *prev, *item; 2319 assert (("deep_clone called on non-head object", is_head ()));
2295 2320
2296 if (!asrc) 2321 object *dst = clone ();
2297 return 0;
2298 2322
2299 src = asrc->head_ (); 2323 object *prev = dst;
2300
2301 prev = 0;
2302 for (object *part = src; part; part = part->more) 2324 for (object *part = this->more; part; part = part->more)
2303 { 2325 {
2304 tmp = part->clone (); 2326 object *tmp = part->clone ();
2305 tmp->x -= src->x;
2306 tmp->y -= src->y;
2307
2308 if (!part->head)
2309 {
2310 dst = tmp;
2311 tmp->head = 0;
2312 }
2313 else
2314 tmp->head = dst; 2327 tmp->head = dst;
2315
2316 tmp->more = 0;
2317
2318 if (prev)
2319 prev->more = tmp; 2328 prev->more = tmp;
2320
2321 prev = tmp; 2329 prev = tmp;
2322 } 2330 }
2323 2331
2324 for (item = src->inv; item; item = item->below) 2332 for (object *item = inv; item; item = item->below)
2325 insert_ob_in_ob (object_create_clone (item), dst); 2333 insert_ob_in_ob (item->deep_clone (), dst);
2326 2334
2327 return dst; 2335 return dst;
2328} 2336}
2329 2337
2330/* This returns the first object in who's inventory that 2338/* This returns the first object in who's inventory that
… …
2339 return tmp; 2347 return tmp;
2340 2348
2341 return 0; 2349 return 0;
2342} 2350}
2343 2351
2344/* If ob has a field named key, return the link from the list, 2352const shstr &
2345 * otherwise return NULL. 2353object::kv_get (const shstr &key) const
2346 *
2347 * key must be a passed in shared string - otherwise, this won't
2348 * do the desired thing.
2349 */
2350key_value *
2351get_ob_key_link (const object *ob, const char *key)
2352{ 2354{
2353 for (key_value *link = ob->key_values; link; link = link->next) 2355 for (key_value *kv = key_values; kv; kv = kv->next)
2354 if (link->key == key) 2356 if (kv->key == key)
2355 return link;
2356
2357 return 0;
2358}
2359
2360/*
2361 * Returns the value of op has an extra_field for key, or NULL.
2362 *
2363 * The argument doesn't need to be a shared string.
2364 *
2365 * The returned string is shared.
2366 */
2367const char *
2368get_ob_key_value (const object *op, const char *const key)
2369{
2370 key_value *link;
2371 shstr_cmp canonical_key (key);
2372
2373 if (!canonical_key)
2374 {
2375 /* 1. There being a field named key on any object
2376 * implies there'd be a shared string to find.
2377 * 2. Since there isn't, no object has this field.
2378 * 3. Therefore, *this* object doesn't have this field.
2379 */
2380 return 0;
2381 }
2382
2383 /* This is copied from get_ob_key_link() above -
2384 * only 4 lines, and saves the function call overhead.
2385 */
2386 for (link = op->key_values; link; link = link->next)
2387 if (link->key == canonical_key)
2388 return link->value; 2357 return kv->value;
2389 2358
2390 return 0; 2359 return shstr_null;
2391} 2360}
2392 2361
2393/* 2362void
2394 * Updates the canonical_key in op to value. 2363object::kv_set (const shstr &key, const shstr &value)
2395 *
2396 * canonical_key is a shared string (value doesn't have to be).
2397 *
2398 * Unless add_key is TRUE, it won't add fields, only change the value of existing
2399 * keys.
2400 *
2401 * Returns TRUE on success.
2402 */
2403int
2404set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2405{ 2364{
2406 key_value *field = NULL, *last = NULL; 2365 for (key_value *kv = key_values; kv; kv = kv->next)
2407 2366 if (kv->key == key)
2408 for (field = op->key_values; field != NULL; field = field->next)
2409 {
2410 if (field->key != canonical_key)
2411 { 2367 {
2412 last = field; 2368 kv->value = value;
2413 continue; 2369 return;
2414 } 2370 }
2415 2371
2416 if (value) 2372 key_value *kv = new key_value;
2417 field->value = value; 2373
2418 else 2374 kv->next = key_values;
2375 kv->key = key;
2376 kv->value = value;
2377
2378 key_values = kv;
2379}
2380
2381void
2382object::kv_del (const shstr &key)
2383{
2384 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2385 if ((*kvp)->key == key)
2419 { 2386 {
2420 /* Basically, if the archetype has this key set, 2387 key_value *kv = *kvp;
2421 * we need to store the null value so when we save 2388 *kvp = (*kvp)->next;
2422 * it, we save the empty value so that when we load, 2389 delete kv;
2423 * we get this value back again. 2390 return;
2424 */
2425 if (get_ob_key_link (op->arch, canonical_key))
2426 field->value = 0;
2427 else
2428 {
2429 if (last)
2430 last->next = field->next;
2431 else
2432 op->key_values = field->next;
2433
2434 delete field;
2435 }
2436 } 2391 }
2437 return TRUE;
2438 }
2439 /* IF we get here, key doesn't exist */
2440
2441 /* No field, we'll have to add it. */
2442
2443 if (!add_key)
2444 return FALSE;
2445
2446 /* There isn't any good reason to store a null
2447 * value in the key/value list. If the archetype has
2448 * this key, then we should also have it, so shouldn't
2449 * be here. If user wants to store empty strings,
2450 * should pass in ""
2451 */
2452 if (value == NULL)
2453 return TRUE;
2454
2455 field = new key_value;
2456
2457 field->key = canonical_key;
2458 field->value = value;
2459 /* Usual prepend-addition. */
2460 field->next = op->key_values;
2461 op->key_values = field;
2462
2463 return TRUE;
2464}
2465
2466/*
2467 * Updates the key in op to value.
2468 *
2469 * If add_key is FALSE, this will only update existing keys,
2470 * and not add new ones.
2471 * In general, should be little reason FALSE is ever passed in for add_key
2472 *
2473 * Returns TRUE on success.
2474 */
2475int
2476set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2477{
2478 shstr key_ (key);
2479
2480 return set_ob_key_value_s (op, key_, value, add_key);
2481} 2392}
2482 2393
2483object::depth_iterator::depth_iterator (object *container) 2394object::depth_iterator::depth_iterator (object *container)
2484: iterator_base (container) 2395: iterator_base (container)
2485{ 2396{
… …
2543 &name, 2454 &name,
2544 title ? "\",title:\"" : "", 2455 title ? "\",title:\"" : "",
2545 title ? (const char *)title : "", 2456 title ? (const char *)title : "",
2546 flag_desc (flagdesc, 512), type); 2457 flag_desc (flagdesc, 512), type);
2547 2458
2548 if (!this->flag[FLAG_REMOVED] && env) 2459 if (!flag[FLAG_REMOVED] && env)
2549 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2460 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2550 2461
2551 if (map) 2462 if (map)
2552 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); 2463 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2553 2464
… …
2583object::open_container (object *new_container) 2494object::open_container (object *new_container)
2584{ 2495{
2585 if (container == new_container) 2496 if (container == new_container)
2586 return; 2497 return;
2587 2498
2588 if (object *old_container = container) 2499 object *old_container = container;
2500
2501 if (old_container)
2589 { 2502 {
2590 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) 2503 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2591 return; 2504 return;
2592 2505
2593#if 0 2506#if 0
… …
2595 if (object *closer = old_container->inv) 2508 if (object *closer = old_container->inv)
2596 if (closer->type == CLOSE_CON) 2509 if (closer->type == CLOSE_CON)
2597 closer->destroy (); 2510 closer->destroy ();
2598#endif 2511#endif
2599 2512
2513 // make sure the container is available
2514 esrv_send_item (this, old_container);
2515
2600 old_container->flag [FLAG_APPLIED] = 0; 2516 old_container->flag [FLAG_APPLIED] = false;
2601 container = 0; 2517 container = 0;
2602 2518
2519 // client needs item update to make it work, client bug requires this to be separate
2603 esrv_update_item (UPD_FLAGS, this, old_container); 2520 esrv_update_item (UPD_FLAGS, this, old_container);
2521
2604 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); 2522 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2605 play_sound (sound_find ("chest_close")); 2523 play_sound (sound_find ("chest_close"));
2606 } 2524 }
2607 2525
2608 if (new_container) 2526 if (new_container)
… …
2621 } 2539 }
2622#endif 2540#endif
2623 2541
2624 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); 2542 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2625 2543
2544 // make sure the container is available, client bug requires this to be separate
2545 esrv_send_item (this, new_container);
2546
2626 new_container->flag [FLAG_APPLIED] = 1; 2547 new_container->flag [FLAG_APPLIED] = true;
2627 container = new_container; 2548 container = new_container;
2628 2549
2550 // client needs flag change
2629 esrv_update_item (UPD_FLAGS, this, new_container); 2551 esrv_update_item (UPD_FLAGS, this, new_container);
2630 esrv_send_inventory (this, new_container); 2552 esrv_send_inventory (this, new_container);
2631 play_sound (sound_find ("chest_open")); 2553 play_sound (sound_find ("chest_open"));
2632 } 2554 }
2555// else if (!old_container->env && contr && contr->ns)
2556// contr->ns->floorbox_reset ();
2633} 2557}
2634 2558
2635object * 2559object *
2636object::force_find (const shstr name) 2560object::force_find (const shstr name)
2637{ 2561{

Diff Legend

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