… | |
… | |
139 | |
139 | |
140 | /* 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. */ |
141 | static bool |
141 | static bool |
142 | compare_ob_value_lists_one (const object *wants, const object *has) |
142 | compare_ob_value_lists_one (const object *wants, const object *has) |
143 | { |
143 | { |
144 | key_value *wants_field; |
|
|
145 | |
|
|
146 | /* 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 |
147 | * 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 |
148 | * different structure or at least keep the lists sorted... |
146 | * different structure or at least keep the lists sorted... |
149 | */ |
147 | */ |
150 | |
148 | |
151 | /* For each field in wants, */ |
149 | /* For each field in wants, */ |
152 | 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) |
153 | { |
151 | if (has->kv_get (kv->key) != kv->value) |
154 | key_value *has_field; |
152 | return false; |
155 | |
|
|
156 | /* Look for a field in has with the same key. */ |
|
|
157 | has_field = get_ob_key_link (has, wants_field->key); |
|
|
158 | |
|
|
159 | if (!has_field) |
|
|
160 | return 0; /* No field with that name. */ |
|
|
161 | |
|
|
162 | /* Found the matching field. */ |
|
|
163 | if (has_field->value != wants_field->value) |
|
|
164 | return 0; /* Values don't match, so this half of the comparison is false. */ |
|
|
165 | |
|
|
166 | /* If we get here, we found a match. Now for the next field in wants. */ |
|
|
167 | } |
|
|
168 | |
153 | |
169 | /* 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. */ |
170 | return 1; |
155 | return true; |
171 | } |
156 | } |
172 | |
157 | |
173 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
158 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
174 | static bool |
159 | static bool |
175 | compare_ob_value_lists (const object *ob1, const object *ob2) |
160 | compare_ob_value_lists (const object *ob1, const object *ob2) |
176 | { |
161 | { |
177 | /* 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, |
178 | * so we need to run the comparison *twice*. :( |
163 | * so we need to run the comparison *twice*. :( |
179 | */ |
164 | */ |
180 | 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); |
181 | } |
167 | } |
182 | |
168 | |
183 | /* 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 |
184 | * they can be merged together. |
170 | * they can be merged together. |
185 | * |
171 | * |
… | |
… | |
368 | return 0; |
354 | return 0; |
369 | } |
355 | } |
370 | |
356 | |
371 | // adjust weight per container type ("of holding") |
357 | // adjust weight per container type ("of holding") |
372 | static sint32 |
358 | static sint32 |
373 | weight_adjust (object *op, sint32 weight) |
359 | weight_adjust_for (object *op, sint32 weight) |
374 | { |
360 | { |
375 | return op->type == CONTAINER |
361 | return op->type == CONTAINER |
376 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
362 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
377 | : weight; |
363 | : weight; |
378 | } |
364 | } |
… | |
… | |
384 | static void |
370 | static void |
385 | adjust_weight (object *op, sint32 weight) |
371 | adjust_weight (object *op, sint32 weight) |
386 | { |
372 | { |
387 | while (op) |
373 | while (op) |
388 | { |
374 | { |
|
|
375 | // adjust by actual difference to account for rounding errors |
|
|
376 | // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct |
389 | weight = weight_adjust (op, weight); |
377 | weight = weight_adjust_for (op, op->carrying) |
|
|
378 | - weight_adjust_for (op, op->carrying - weight); |
390 | |
379 | |
391 | if (!weight) |
380 | if (!weight) |
392 | return; |
381 | return; |
393 | |
382 | |
394 | op->carrying += weight; |
383 | op->carrying += weight; |
… | |
… | |
417 | op->update_weight (); |
406 | op->update_weight (); |
418 | |
407 | |
419 | sum += op->total_weight (); |
408 | sum += op->total_weight (); |
420 | } |
409 | } |
421 | |
410 | |
422 | sum = weight_adjust (this, sum); |
411 | sum = weight_adjust_for (this, sum); |
423 | |
412 | |
424 | if (sum != carrying) |
413 | if (sum != carrying) |
425 | { |
414 | { |
426 | carrying = sum; |
415 | carrying = sum; |
427 | |
416 | |
… | |
… | |
603 | } |
592 | } |
604 | |
593 | |
605 | op->key_values = 0; |
594 | op->key_values = 0; |
606 | } |
595 | } |
607 | |
596 | |
608 | object & |
597 | /* |
609 | object::operator =(const object &src) |
598 | * copy_to first frees everything allocated by the dst object, |
|
|
599 | * and then copies the contents of itself into the second |
|
|
600 | * object, allocating what needs to be allocated. Basically, any |
|
|
601 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
602 | * if the first object is freed, the pointers in the new object |
|
|
603 | * will point at garbage. |
|
|
604 | */ |
|
|
605 | void |
|
|
606 | object::copy_to (object *dst) |
610 | { |
607 | { |
611 | bool is_freed = flag [FLAG_FREED]; |
608 | dst->remove (); |
612 | bool is_removed = flag [FLAG_REMOVED]; |
|
|
613 | |
|
|
614 | *(object_copy *)this = src; |
609 | *(object_copy *)dst = *this; |
615 | |
|
|
616 | flag [FLAG_FREED] = is_freed; |
|
|
617 | flag [FLAG_REMOVED] = is_removed; |
610 | dst->flag [FLAG_REMOVED] = true; |
618 | |
611 | |
619 | /* Copy over key_values, if any. */ |
612 | /* Copy over key_values, if any. */ |
620 | if (src.key_values) |
613 | if (key_values) |
621 | { |
614 | { |
622 | key_value *tail = 0; |
615 | key_value *tail = 0; |
623 | key_values = 0; |
616 | dst->key_values = 0; |
624 | |
617 | |
625 | for (key_value *i = src.key_values; i; i = i->next) |
618 | for (key_value *i = key_values; i; i = i->next) |
626 | { |
619 | { |
627 | key_value *new_link = new key_value; |
620 | key_value *new_link = new key_value; |
628 | |
621 | |
629 | new_link->next = 0; |
622 | new_link->next = 0; |
630 | new_link->key = i->key; |
623 | new_link->key = i->key; |
631 | new_link->value = i->value; |
624 | new_link->value = i->value; |
632 | |
625 | |
633 | /* Try and be clever here, too. */ |
626 | /* Try and be clever here, too. */ |
634 | if (!key_values) |
627 | if (!dst->key_values) |
635 | { |
628 | { |
636 | key_values = new_link; |
629 | dst->key_values = new_link; |
637 | tail = new_link; |
630 | tail = new_link; |
638 | } |
631 | } |
639 | else |
632 | else |
640 | { |
633 | { |
641 | tail->next = new_link; |
634 | tail->next = new_link; |
642 | tail = new_link; |
635 | tail = new_link; |
643 | } |
636 | } |
644 | } |
637 | } |
645 | } |
638 | } |
646 | } |
|
|
647 | |
|
|
648 | /* |
|
|
649 | * copy_to first frees everything allocated by the dst object, |
|
|
650 | * and then copies the contents of itself into the second |
|
|
651 | * object, allocating what needs to be allocated. Basically, any |
|
|
652 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
653 | * if the first object is freed, the pointers in the new object |
|
|
654 | * will point at garbage. |
|
|
655 | */ |
|
|
656 | void |
|
|
657 | object::copy_to (object *dst) |
|
|
658 | { |
|
|
659 | *dst = *this; |
|
|
660 | |
639 | |
661 | if (speed < 0) |
640 | if (speed < 0) |
662 | dst->speed_left -= rndm (); |
641 | dst->speed_left -= rndm (); |
663 | |
642 | |
664 | dst->set_speed (dst->speed); |
643 | dst->set_speed (dst->speed); |
… | |
… | |
686 | object * |
665 | object * |
687 | object::clone () |
666 | object::clone () |
688 | { |
667 | { |
689 | object *neu = create (); |
668 | object *neu = create (); |
690 | copy_to (neu); |
669 | copy_to (neu); |
|
|
670 | neu->map = map; // not copied by copy_to |
691 | return neu; |
671 | return neu; |
692 | } |
672 | } |
693 | |
673 | |
694 | /* |
674 | /* |
695 | * If an object with the IS_TURNABLE() flag needs to be turned due |
675 | * If an object with the IS_TURNABLE() flag needs to be turned due |
… | |
… | |
746 | * UP_OBJ_FACE: only the objects face has changed. |
726 | * UP_OBJ_FACE: only the objects face has changed. |
747 | */ |
727 | */ |
748 | void |
728 | void |
749 | update_object (object *op, int action) |
729 | update_object (object *op, int action) |
750 | { |
730 | { |
751 | if (op == NULL) |
731 | if (!op) |
752 | { |
732 | { |
753 | /* this should never happen */ |
733 | /* this should never happen */ |
754 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
734 | LOG (llevError | logBacktrace, "update_object() called for NULL object.\n"); |
755 | return; |
735 | return; |
756 | } |
736 | } |
757 | |
737 | |
758 | if (op->env) |
738 | if (!op->is_on_map ()) |
759 | { |
739 | { |
760 | /* Animation is currently handled by client, so nothing |
740 | /* Animation is currently handled by client, so nothing |
761 | * to do in this case. |
741 | * to do in this case. |
762 | */ |
742 | */ |
763 | return; |
743 | return; |
764 | } |
744 | } |
765 | |
|
|
766 | /* If the map is saving, don't do anything as everything is |
|
|
767 | * going to get freed anyways. |
|
|
768 | */ |
|
|
769 | if (!op->map || op->map->in_memory == MAP_SAVING) |
|
|
770 | return; |
|
|
771 | |
745 | |
772 | /* make sure the object is within map boundaries */ |
746 | /* make sure the object is within map boundaries */ |
773 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
747 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
774 | { |
748 | { |
775 | LOG (llevError, "update_object() called for object out of map!\n"); |
749 | LOG (llevError, "update_object() called for object out of map!\n"); |
… | |
… | |
930 | * drop on that space. |
904 | * drop on that space. |
931 | */ |
905 | */ |
932 | if (!drop_to_ground |
906 | if (!drop_to_ground |
933 | || !map |
907 | || !map |
934 | || map->in_memory != MAP_ACTIVE |
908 | || map->in_memory != MAP_ACTIVE |
935 | || map->nodrop |
909 | || map->no_drop |
936 | || ms ().move_block == MOVE_ALL) |
910 | || ms ().move_block == MOVE_ALL) |
937 | { |
911 | { |
938 | while (inv) |
912 | while (inv) |
939 | { |
913 | { |
940 | inv->destroy_inv (false); |
914 | inv->destroy_inv (false); |
… | |
… | |
965 | object *op = new object; |
939 | object *op = new object; |
966 | op->link (); |
940 | op->link (); |
967 | return op; |
941 | return op; |
968 | } |
942 | } |
969 | |
943 | |
|
|
944 | static struct freed_map : maptile |
|
|
945 | { |
|
|
946 | freed_map () |
|
|
947 | { |
|
|
948 | path = "<freed objects map>"; |
|
|
949 | name = "/internal/freed_objects_map"; |
|
|
950 | width = 3; |
|
|
951 | height = 3; |
|
|
952 | no_drop = 1; |
|
|
953 | no_reset = 1; |
|
|
954 | |
|
|
955 | alloc (); |
|
|
956 | in_memory = MAP_ACTIVE; |
|
|
957 | } |
|
|
958 | |
|
|
959 | ~freed_map () |
|
|
960 | { |
|
|
961 | destroy (); |
|
|
962 | } |
|
|
963 | } freed_map; // freed objects are moved here to avoid crashes |
|
|
964 | |
970 | void |
965 | void |
971 | object::do_destroy () |
966 | object::do_destroy () |
972 | { |
967 | { |
973 | if (flag [FLAG_IS_LINKED]) |
968 | if (flag [FLAG_IS_LINKED]) |
974 | remove_button_link (this); |
969 | remove_button_link (this); |
… | |
… | |
984 | unlink (); |
979 | unlink (); |
985 | |
980 | |
986 | flag [FLAG_FREED] = 1; |
981 | flag [FLAG_FREED] = 1; |
987 | |
982 | |
988 | // hack to ensure that freed objects still have a valid map |
983 | // hack to ensure that freed objects still have a valid map |
989 | { |
|
|
990 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
991 | |
|
|
992 | if (!freed_map) |
|
|
993 | { |
|
|
994 | freed_map = new maptile; |
|
|
995 | |
|
|
996 | freed_map->path = "<freed objects map>"; |
|
|
997 | freed_map->name = "/internal/freed_objects_map"; |
|
|
998 | freed_map->width = 3; |
|
|
999 | freed_map->height = 3; |
|
|
1000 | freed_map->nodrop = 1; |
|
|
1001 | |
|
|
1002 | freed_map->alloc (); |
|
|
1003 | freed_map->in_memory = MAP_ACTIVE; |
|
|
1004 | } |
|
|
1005 | |
|
|
1006 | map = freed_map; |
984 | map = &freed_map; |
1007 | x = 1; |
985 | x = 1; |
1008 | y = 1; |
986 | y = 1; |
1009 | } |
|
|
1010 | |
987 | |
1011 | if (more) |
988 | if (more) |
1012 | { |
989 | { |
1013 | more->destroy (); |
990 | more->destroy (); |
1014 | more = 0; |
991 | more = 0; |
… | |
… | |
1031 | |
1008 | |
1032 | if (!is_head () && !head->destroyed ()) |
1009 | if (!is_head () && !head->destroyed ()) |
1033 | { |
1010 | { |
1034 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1011 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1035 | head->destroy (destroy_inventory); |
1012 | head->destroy (destroy_inventory); |
|
|
1013 | return; |
1036 | } |
1014 | } |
1037 | |
1015 | |
1038 | destroy_inv (!destroy_inventory); |
1016 | destroy_inv (!destroy_inventory); |
1039 | |
1017 | |
1040 | if (is_head ()) |
1018 | if (is_head ()) |
… | |
… | |
1073 | * In this case, the object to be removed is in someones |
1051 | * In this case, the object to be removed is in someones |
1074 | * inventory. |
1052 | * inventory. |
1075 | */ |
1053 | */ |
1076 | if (env) |
1054 | if (env) |
1077 | { |
1055 | { |
|
|
1056 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1078 | if (object *pl = visible_to ()) |
1057 | if (object *pl = visible_to ()) |
1079 | esrv_del_item (pl->contr, count); |
1058 | esrv_del_item (pl->contr, count); |
|
|
1059 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1080 | |
1060 | |
1081 | adjust_weight (env, -total_weight ()); |
1061 | adjust_weight (env, -total_weight ()); |
1082 | |
|
|
1083 | *(above ? &above->below : &env->inv) = below; |
|
|
1084 | |
|
|
1085 | if (below) |
|
|
1086 | below->above = above; |
|
|
1087 | |
1062 | |
1088 | /* we set up values so that it could be inserted into |
1063 | /* we set up values so that it could be inserted into |
1089 | * the map, but we don't actually do that - it is up |
1064 | * the map, but we don't actually do that - it is up |
1090 | * to the caller to decide what we want to do. |
1065 | * to the caller to decide what we want to do. |
1091 | */ |
1066 | */ |
1092 | map = env->map; |
1067 | map = env->map; |
1093 | x = env->x; |
1068 | x = env->x; |
1094 | y = env->y; |
1069 | y = env->y; |
|
|
1070 | |
|
|
1071 | // make sure cmov optimisation is applicable |
|
|
1072 | *(above ? &above->below : &env->inv) = below; |
|
|
1073 | *(below ? &below->above : &above ) = above; // &above is just a dummy |
|
|
1074 | |
1095 | above = 0; |
1075 | above = 0; |
1096 | below = 0; |
1076 | below = 0; |
1097 | env = 0; |
1077 | env = 0; |
1098 | |
1078 | |
1099 | /* NO_FIX_PLAYER is set when a great many changes are being |
1079 | /* NO_FIX_PLAYER is set when a great many changes are being |
… | |
… | |
1129 | |
1109 | |
1130 | esrv_del_item (pl->contr, count); |
1110 | esrv_del_item (pl->contr, count); |
1131 | } |
1111 | } |
1132 | |
1112 | |
1133 | /* link the object above us */ |
1113 | /* link the object above us */ |
1134 | if (above) |
1114 | // re-link, make sure compiler can easily use cmove |
1135 | above->below = below; |
1115 | *(above ? &above->below : &ms.top) = below; |
1136 | else |
1116 | *(below ? &below->above : &ms.bot) = above; |
1137 | ms.top = below; /* we were top, set new top */ |
|
|
1138 | |
|
|
1139 | /* Relink the object below us, if there is one */ |
|
|
1140 | if (below) |
|
|
1141 | below->above = above; |
|
|
1142 | else |
|
|
1143 | { |
|
|
1144 | /* Nothing below, which means we need to relink map object for this space |
|
|
1145 | * use translated coordinates in case some oddness with map tiling is |
|
|
1146 | * evident |
|
|
1147 | */ |
|
|
1148 | if (GET_MAP_OB (map, x, y) != this) |
|
|
1149 | LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ()); |
|
|
1150 | |
|
|
1151 | ms.bot = above; /* goes on above it. */ |
|
|
1152 | } |
|
|
1153 | |
1117 | |
1154 | above = 0; |
1118 | above = 0; |
1155 | below = 0; |
1119 | below = 0; |
1156 | |
1120 | |
1157 | if (map->in_memory == MAP_SAVING) |
1121 | if (map->in_memory == MAP_SAVING) |
… | |
… | |
1167 | * appropriately. |
1131 | * appropriately. |
1168 | */ |
1132 | */ |
1169 | pl->close_container (); |
1133 | pl->close_container (); |
1170 | |
1134 | |
1171 | //TODO: the floorbox prev/next might need updating |
1135 | //TODO: the floorbox prev/next might need updating |
1172 | esrv_del_item (pl->contr, count); |
1136 | //esrv_del_item (pl->contr, count); |
|
|
1137 | //TODO: update floorbox to preserve ordering |
|
|
1138 | if (pl->contr->ns) |
|
|
1139 | pl->contr->ns->floorbox_update (); |
1173 | } |
1140 | } |
1174 | |
1141 | |
1175 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1142 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1176 | { |
1143 | { |
1177 | /* No point updating the players look faces if he is the object |
1144 | /* No point updating the players look faces if he is the object |
… | |
… | |
1301 | * just 'op' otherwise |
1268 | * just 'op' otherwise |
1302 | */ |
1269 | */ |
1303 | object * |
1270 | object * |
1304 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1271 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1305 | { |
1272 | { |
1306 | assert (!op->flag [FLAG_FREED]); |
|
|
1307 | |
|
|
1308 | op->remove (); |
1273 | op->remove (); |
1309 | |
1274 | |
1310 | /* Ideally, the caller figures this out. However, it complicates a lot |
1275 | /* Ideally, the caller figures this out. However, it complicates a lot |
1311 | * of areas of callers (eg, anything that uses find_free_spot would now |
1276 | * of areas of callers (eg, anything that uses find_free_spot would now |
1312 | * need extra work |
1277 | * need extra work |
1313 | */ |
1278 | */ |
1314 | if (!xy_normalise (m, op->x, op->y)) |
1279 | if (!xy_normalise (m, op->x, op->y)) |
1315 | { |
1280 | { |
1316 | op->destroy (1); |
1281 | op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found |
1317 | return 0; |
1282 | return 0; |
1318 | } |
1283 | } |
1319 | |
1284 | |
1320 | if (object *more = op->more) |
1285 | if (object *more = op->more) |
1321 | if (!insert_ob_in_map (more, m, originator, flag)) |
1286 | if (!insert_ob_in_map (more, m, originator, flag)) |
… | |
… | |
1330 | */ |
1295 | */ |
1331 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1296 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1332 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1297 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1333 | if (object::can_merge (op, tmp)) |
1298 | if (object::can_merge (op, tmp)) |
1334 | { |
1299 | { |
1335 | // TODO: we atcually want to update tmp, not op, |
1300 | // TODO: we actually want to update tmp, not op, |
1336 | // but some caller surely breaks when we return tmp |
1301 | // but some caller surely breaks when we return tmp |
1337 | // from here :/ |
1302 | // from here :/ |
1338 | op->nrof += tmp->nrof; |
1303 | op->nrof += tmp->nrof; |
1339 | tmp->destroy (1); |
1304 | tmp->destroy (1); |
1340 | } |
1305 | } |
… | |
… | |
1345 | if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1310 | if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1346 | CLEAR_FLAG (op, FLAG_NO_STEAL); |
1311 | CLEAR_FLAG (op, FLAG_NO_STEAL); |
1347 | |
1312 | |
1348 | if (flag & INS_BELOW_ORIGINATOR) |
1313 | if (flag & INS_BELOW_ORIGINATOR) |
1349 | { |
1314 | { |
1350 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1315 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y || !originator->is_on_map ()) |
1351 | { |
1316 | { |
1352 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1317 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1353 | abort (); |
1318 | abort (); |
1354 | } |
1319 | } |
1355 | |
1320 | |
1356 | op->above = originator; |
1321 | op->above = originator; |
1357 | op->below = originator->below; |
1322 | op->below = originator->below; |
1358 | |
|
|
1359 | if (op->below) |
|
|
1360 | op->below->above = op; |
|
|
1361 | else |
|
|
1362 | ms.bot = op; |
|
|
1363 | |
|
|
1364 | /* since *below* originator, no need to update top */ |
|
|
1365 | originator->below = op; |
1323 | originator->below = op; |
|
|
1324 | |
|
|
1325 | *(op->below ? &op->below->above : &ms.bot) = op; |
1366 | } |
1326 | } |
1367 | else |
1327 | else |
1368 | { |
1328 | { |
1369 | object *top, *floor = NULL; |
1329 | object *floor = 0; |
1370 | |
1330 | object *top = ms.top; |
1371 | top = ms.bot; |
|
|
1372 | |
1331 | |
1373 | /* If there are other objects, then */ |
1332 | /* If there are other objects, then */ |
1374 | if (top) |
1333 | if (top) |
1375 | { |
1334 | { |
1376 | object *last = 0; |
|
|
1377 | |
|
|
1378 | /* |
1335 | /* |
1379 | * If there are multiple objects on this space, we do some trickier handling. |
1336 | * If there are multiple objects on this space, we do some trickier handling. |
1380 | * We've already dealt with merging if appropriate. |
1337 | * We've already dealt with merging if appropriate. |
1381 | * Generally, we want to put the new object on top. But if |
1338 | * Generally, we want to put the new object on top. But if |
1382 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1339 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
… | |
… | |
1385 | * once we get to them. This reduces the need to traverse over all of |
1342 | * once we get to them. This reduces the need to traverse over all of |
1386 | * them when adding another one - this saves quite a bit of cpu time |
1343 | * them when adding another one - this saves quite a bit of cpu time |
1387 | * when lots of spells are cast in one area. Currently, it is presumed |
1344 | * when lots of spells are cast in one area. Currently, it is presumed |
1388 | * that flying non pickable objects are spell objects. |
1345 | * that flying non pickable objects are spell objects. |
1389 | */ |
1346 | */ |
1390 | for (top = ms.bot; top; top = top->above) |
1347 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1391 | { |
1348 | { |
1392 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1349 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) |
1393 | floor = top; |
1350 | floor = tmp; |
1394 | |
1351 | |
1395 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1352 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1396 | { |
1353 | { |
1397 | /* We insert above top, so we want this object below this */ |
1354 | /* We insert above top, so we want this object below this */ |
1398 | top = top->below; |
1355 | top = tmp->below; |
1399 | break; |
1356 | break; |
1400 | } |
1357 | } |
1401 | |
1358 | |
1402 | last = top; |
1359 | top = tmp; |
1403 | } |
1360 | } |
1404 | |
|
|
1405 | /* Don't want top to be NULL, so set it to the last valid object */ |
|
|
1406 | top = last; |
|
|
1407 | |
1361 | |
1408 | /* We let update_position deal with figuring out what the space |
1362 | /* We let update_position deal with figuring out what the space |
1409 | * looks like instead of lots of conditions here. |
1363 | * looks like instead of lots of conditions here. |
1410 | * makes things faster, and effectively the same result. |
1364 | * makes things faster, and effectively the same result. |
1411 | */ |
1365 | */ |
… | |
… | |
1418 | */ |
1372 | */ |
1419 | if (!(flag & INS_ON_TOP) |
1373 | if (!(flag & INS_ON_TOP) |
1420 | && ms.flags () & P_BLOCKSVIEW |
1374 | && ms.flags () & P_BLOCKSVIEW |
1421 | && (op->face && !faces [op->face].visibility)) |
1375 | && (op->face && !faces [op->face].visibility)) |
1422 | { |
1376 | { |
|
|
1377 | object *last; |
|
|
1378 | |
1423 | for (last = top; last != floor; last = last->below) |
1379 | for (last = top; last != floor; last = last->below) |
1424 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1380 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1425 | break; |
1381 | break; |
1426 | |
1382 | |
1427 | /* Check to see if we found the object that blocks view, |
1383 | /* Check to see if we found the object that blocks view, |
… | |
… | |
1438 | top = floor; |
1394 | top = floor; |
1439 | |
1395 | |
1440 | /* Top is the object that our object (op) is going to get inserted above. |
1396 | /* Top is the object that our object (op) is going to get inserted above. |
1441 | */ |
1397 | */ |
1442 | |
1398 | |
1443 | /* First object on this space */ |
1399 | /* no top found, insert at bottom */ |
1444 | if (!top) |
1400 | if (!top) |
1445 | { |
1401 | { |
|
|
1402 | op->below = 0; |
1446 | op->above = ms.bot; |
1403 | op->above = ms.bot; |
1447 | |
|
|
1448 | if (op->above) |
|
|
1449 | op->above->below = op; |
|
|
1450 | |
|
|
1451 | op->below = 0; |
|
|
1452 | ms.bot = op; |
1404 | ms.bot = op; |
|
|
1405 | |
|
|
1406 | *(op->above ? &op->above->below : &ms.top) = op; |
1453 | } |
1407 | } |
1454 | else |
1408 | else |
1455 | { /* get inserted into the stack above top */ |
1409 | { /* get inserted into the stack above top */ |
1456 | op->above = top->above; |
1410 | op->above = top->above; |
1457 | |
|
|
1458 | if (op->above) |
|
|
1459 | op->above->below = op; |
1411 | top->above = op; |
1460 | |
1412 | |
1461 | op->below = top; |
1413 | op->below = top; |
1462 | top->above = op; |
1414 | *(op->above ? &op->above->below : &ms.top) = op; |
1463 | } |
1415 | } |
1464 | |
|
|
1465 | if (!op->above) |
|
|
1466 | ms.top = op; |
|
|
1467 | } /* else not INS_BELOW_ORIGINATOR */ |
1416 | } /* else not INS_BELOW_ORIGINATOR */ |
1468 | |
1417 | |
1469 | if (op->type == PLAYER) |
1418 | if (op->type == PLAYER) |
1470 | { |
1419 | { |
1471 | op->contr->do_los = 1; |
1420 | op->contr->do_los = 1; |
… | |
… | |
1475 | |
1424 | |
1476 | op->map->dirty = true; |
1425 | op->map->dirty = true; |
1477 | |
1426 | |
1478 | if (object *pl = ms.player ()) |
1427 | if (object *pl = ms.player ()) |
1479 | //TODO: the floorbox prev/next might need updating |
1428 | //TODO: the floorbox prev/next might need updating |
1480 | esrv_send_item (pl, op); |
1429 | //esrv_send_item (pl, op); |
|
|
1430 | //TODO: update floorbox to preserve ordering |
|
|
1431 | if (pl->contr->ns) |
|
|
1432 | pl->contr->ns->floorbox_update (); |
1481 | |
1433 | |
1482 | /* If this object glows, it may affect lighting conditions that are |
1434 | /* If this object glows, it may affect lighting conditions that are |
1483 | * visible to others on this map. But update_all_los is really |
1435 | * visible to others on this map. But update_all_los is really |
1484 | * an inefficient way to do this, as it means los for all players |
1436 | * an inefficient way to do this, as it means los for all players |
1485 | * on the map will get recalculated. The players could very well |
1437 | * on the map will get recalculated. The players could very well |
… | |
… | |
1605 | } |
1557 | } |
1606 | else |
1558 | else |
1607 | { |
1559 | { |
1608 | decrease (nr); |
1560 | decrease (nr); |
1609 | |
1561 | |
1610 | object *op = object_create_clone (this); |
1562 | object *op = deep_clone (); |
1611 | op->nrof = nr; |
1563 | op->nrof = nr; |
1612 | return op; |
1564 | return op; |
1613 | } |
1565 | } |
1614 | } |
1566 | } |
1615 | |
1567 | |
… | |
… | |
1836 | LOG (llevError, "Present_arch called outside map.\n"); |
1788 | LOG (llevError, "Present_arch called outside map.\n"); |
1837 | return NULL; |
1789 | return NULL; |
1838 | } |
1790 | } |
1839 | |
1791 | |
1840 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1792 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1841 | if (tmp->arch == at) |
1793 | if (tmp->arch->archname == at->archname) |
1842 | return tmp; |
1794 | return tmp; |
1843 | |
1795 | |
1844 | return NULL; |
1796 | return NULL; |
1845 | } |
1797 | } |
1846 | |
1798 | |
… | |
… | |
1910 | * The first matching object is returned, or NULL if none. |
1862 | * The first matching object is returned, or NULL if none. |
1911 | */ |
1863 | */ |
1912 | object * |
1864 | object * |
1913 | present_arch_in_ob (const archetype *at, const object *op) |
1865 | present_arch_in_ob (const archetype *at, const object *op) |
1914 | { |
1866 | { |
1915 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1867 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1916 | if (tmp->arch == at) |
1868 | if (tmp->arch->archname == at->archname) |
1917 | return tmp; |
1869 | return tmp; |
1918 | |
1870 | |
1919 | return NULL; |
1871 | return NULL; |
1920 | } |
1872 | } |
1921 | |
1873 | |
… | |
… | |
2330 | |
2282 | |
2331 | /* |
2283 | /* |
2332 | * create clone from object to another |
2284 | * create clone from object to another |
2333 | */ |
2285 | */ |
2334 | object * |
2286 | object * |
2335 | object_create_clone (object *asrc) |
2287 | object::deep_clone () |
2336 | { |
2288 | { |
2337 | object *dst = 0, *tmp, *src, *prev, *item; |
2289 | assert (("deep_clone called on non-head object", is_head ())); |
2338 | |
2290 | |
2339 | if (!asrc) |
2291 | object *dst = clone (); |
2340 | return 0; |
|
|
2341 | |
2292 | |
2342 | src = asrc->head_ (); |
2293 | object *prev = dst; |
2343 | |
|
|
2344 | prev = 0; |
|
|
2345 | for (object *part = src; part; part = part->more) |
2294 | for (object *part = this->more; part; part = part->more) |
2346 | { |
2295 | { |
2347 | tmp = part->clone (); |
2296 | object *tmp = part->clone (); |
2348 | tmp->x -= src->x; |
|
|
2349 | tmp->y -= src->y; |
|
|
2350 | |
|
|
2351 | if (!part->head) |
|
|
2352 | { |
|
|
2353 | dst = tmp; |
|
|
2354 | tmp->head = 0; |
|
|
2355 | } |
|
|
2356 | else |
|
|
2357 | tmp->head = dst; |
2297 | tmp->head = dst; |
2358 | |
|
|
2359 | tmp->more = 0; |
|
|
2360 | |
|
|
2361 | if (prev) |
|
|
2362 | prev->more = tmp; |
2298 | prev->more = tmp; |
2363 | |
|
|
2364 | prev = tmp; |
2299 | prev = tmp; |
2365 | } |
2300 | } |
2366 | |
2301 | |
2367 | for (item = src->inv; item; item = item->below) |
2302 | for (object *item = inv; item; item = item->below) |
2368 | insert_ob_in_ob (object_create_clone (item), dst); |
2303 | insert_ob_in_ob (item->deep_clone (), dst); |
2369 | |
2304 | |
2370 | return dst; |
2305 | return dst; |
2371 | } |
2306 | } |
2372 | |
2307 | |
2373 | /* This returns the first object in who's inventory that |
2308 | /* This returns the first object in who's inventory that |
… | |
… | |
2382 | return tmp; |
2317 | return tmp; |
2383 | |
2318 | |
2384 | return 0; |
2319 | return 0; |
2385 | } |
2320 | } |
2386 | |
2321 | |
2387 | /* If ob has a field named key, return the link from the list, |
2322 | const shstr & |
2388 | * otherwise return NULL. |
2323 | object::kv_get (const shstr &key) const |
2389 | * |
|
|
2390 | * key must be a passed in shared string - otherwise, this won't |
|
|
2391 | * do the desired thing. |
|
|
2392 | */ |
|
|
2393 | key_value * |
|
|
2394 | get_ob_key_link (const object *ob, const char *key) |
|
|
2395 | { |
2324 | { |
2396 | for (key_value *link = ob->key_values; link; link = link->next) |
2325 | for (key_value *kv = key_values; kv; kv = kv->next) |
2397 | if (link->key == key) |
2326 | if (kv->key == key) |
2398 | return link; |
|
|
2399 | |
|
|
2400 | return 0; |
|
|
2401 | } |
|
|
2402 | |
|
|
2403 | /* |
|
|
2404 | * Returns the value of op has an extra_field for key, or NULL. |
|
|
2405 | * |
|
|
2406 | * The argument doesn't need to be a shared string. |
|
|
2407 | * |
|
|
2408 | * The returned string is shared. |
|
|
2409 | */ |
|
|
2410 | const char * |
|
|
2411 | get_ob_key_value (const object *op, const char *const key) |
|
|
2412 | { |
|
|
2413 | key_value *link; |
|
|
2414 | shstr_cmp canonical_key (key); |
|
|
2415 | |
|
|
2416 | if (!canonical_key) |
|
|
2417 | { |
|
|
2418 | /* 1. There being a field named key on any object |
|
|
2419 | * implies there'd be a shared string to find. |
|
|
2420 | * 2. Since there isn't, no object has this field. |
|
|
2421 | * 3. Therefore, *this* object doesn't have this field. |
|
|
2422 | */ |
|
|
2423 | return 0; |
|
|
2424 | } |
|
|
2425 | |
|
|
2426 | /* This is copied from get_ob_key_link() above - |
|
|
2427 | * only 4 lines, and saves the function call overhead. |
|
|
2428 | */ |
|
|
2429 | for (link = op->key_values; link; link = link->next) |
|
|
2430 | if (link->key == canonical_key) |
|
|
2431 | return link->value; |
2327 | return kv->value; |
2432 | |
2328 | |
2433 | return 0; |
2329 | return shstr_null; |
2434 | } |
2330 | } |
2435 | |
2331 | |
2436 | /* |
2332 | void |
2437 | * Updates the canonical_key in op to value. |
2333 | object::kv_set (const shstr &key, const shstr &value) |
2438 | * |
|
|
2439 | * canonical_key is a shared string (value doesn't have to be). |
|
|
2440 | * |
|
|
2441 | * Unless add_key is TRUE, it won't add fields, only change the value of existing |
|
|
2442 | * keys. |
|
|
2443 | * |
|
|
2444 | * Returns TRUE on success. |
|
|
2445 | */ |
|
|
2446 | int |
|
|
2447 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
|
|
2448 | { |
2334 | { |
2449 | key_value *field = NULL, *last = NULL; |
2335 | for (key_value *kv = key_values; kv; kv = kv->next) |
2450 | |
2336 | if (kv->key == key) |
2451 | for (field = op->key_values; field != NULL; field = field->next) |
|
|
2452 | { |
|
|
2453 | if (field->key != canonical_key) |
|
|
2454 | { |
2337 | { |
2455 | last = field; |
2338 | kv->value = value; |
2456 | continue; |
2339 | return; |
2457 | } |
2340 | } |
2458 | |
2341 | |
2459 | if (value) |
2342 | key_value *kv = new key_value; |
2460 | field->value = value; |
2343 | |
2461 | else |
2344 | kv->next = key_values; |
|
|
2345 | kv->key = key; |
|
|
2346 | kv->value = value; |
|
|
2347 | |
|
|
2348 | key_values = kv; |
|
|
2349 | } |
|
|
2350 | |
|
|
2351 | void |
|
|
2352 | object::kv_del (const shstr &key) |
|
|
2353 | { |
|
|
2354 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
|
|
2355 | if ((*kvp)->key == key) |
2462 | { |
2356 | { |
2463 | /* Basically, if the archetype has this key set, |
2357 | key_value *kv = *kvp; |
2464 | * we need to store the null value so when we save |
2358 | *kvp = (*kvp)->next; |
2465 | * it, we save the empty value so that when we load, |
2359 | delete kv; |
2466 | * we get this value back again. |
2360 | return; |
2467 | */ |
|
|
2468 | if (get_ob_key_link (op->arch, canonical_key)) |
|
|
2469 | field->value = 0; |
|
|
2470 | else |
|
|
2471 | { |
|
|
2472 | if (last) |
|
|
2473 | last->next = field->next; |
|
|
2474 | else |
|
|
2475 | op->key_values = field->next; |
|
|
2476 | |
|
|
2477 | delete field; |
|
|
2478 | } |
|
|
2479 | } |
2361 | } |
2480 | return TRUE; |
|
|
2481 | } |
|
|
2482 | /* IF we get here, key doesn't exist */ |
|
|
2483 | |
|
|
2484 | /* No field, we'll have to add it. */ |
|
|
2485 | |
|
|
2486 | if (!add_key) |
|
|
2487 | return FALSE; |
|
|
2488 | |
|
|
2489 | /* There isn't any good reason to store a null |
|
|
2490 | * value in the key/value list. If the archetype has |
|
|
2491 | * this key, then we should also have it, so shouldn't |
|
|
2492 | * be here. If user wants to store empty strings, |
|
|
2493 | * should pass in "" |
|
|
2494 | */ |
|
|
2495 | if (value == NULL) |
|
|
2496 | return TRUE; |
|
|
2497 | |
|
|
2498 | field = new key_value; |
|
|
2499 | |
|
|
2500 | field->key = canonical_key; |
|
|
2501 | field->value = value; |
|
|
2502 | /* Usual prepend-addition. */ |
|
|
2503 | field->next = op->key_values; |
|
|
2504 | op->key_values = field; |
|
|
2505 | |
|
|
2506 | return TRUE; |
|
|
2507 | } |
|
|
2508 | |
|
|
2509 | /* |
|
|
2510 | * Updates the key in op to value. |
|
|
2511 | * |
|
|
2512 | * If add_key is FALSE, this will only update existing keys, |
|
|
2513 | * and not add new ones. |
|
|
2514 | * In general, should be little reason FALSE is ever passed in for add_key |
|
|
2515 | * |
|
|
2516 | * Returns TRUE on success. |
|
|
2517 | */ |
|
|
2518 | int |
|
|
2519 | set_ob_key_value (object *op, const char *key, const char *value, int add_key) |
|
|
2520 | { |
|
|
2521 | shstr key_ (key); |
|
|
2522 | |
|
|
2523 | return set_ob_key_value_s (op, key_, value, add_key); |
|
|
2524 | } |
2362 | } |
2525 | |
2363 | |
2526 | object::depth_iterator::depth_iterator (object *container) |
2364 | object::depth_iterator::depth_iterator (object *container) |
2527 | : iterator_base (container) |
2365 | : iterator_base (container) |
2528 | { |
2366 | { |