… | |
… | |
186 | || ob1->speed != ob2->speed |
186 | || ob1->speed != ob2->speed |
187 | || ob1->value != ob2->value |
187 | || ob1->value != ob2->value |
188 | || ob1->name != ob2->name) |
188 | || ob1->name != ob2->name) |
189 | return 0; |
189 | return 0; |
190 | |
190 | |
191 | /* Do not merge objects if nrof would overflow. First part checks |
191 | /* Do not merge objects if nrof would overflow, assume nrof |
192 | * for unsigned overflow (2c), second part checks whether the result |
192 | * is always 0 .. 2**31-1 */ |
193 | * would fit into a 32 bit signed int, which is often used to hold |
193 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
194 | * nrof values. |
|
|
195 | */ |
|
|
196 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
|
|
197 | return 0; |
194 | return 0; |
198 | |
195 | |
199 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
196 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
200 | * This is to the comparison of the flags below will be OK. We |
197 | * This is to the comparison of the flags below will be OK. We |
201 | * just can't ignore the been applied or identified flags, as they |
198 | * just can't ignore the been applied or identified flags, as they |
… | |
… | |
235 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
232 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
236 | return 0; |
233 | return 0; |
237 | |
234 | |
238 | if ((ob1->flag ^ ob2->flag) |
235 | if ((ob1->flag ^ ob2->flag) |
239 | .reset (FLAG_INV_LOCKED) |
236 | .reset (FLAG_INV_LOCKED) |
240 | .reset (FLAG_CLIENT_SENT) |
|
|
241 | .reset (FLAG_REMOVED) |
237 | .reset (FLAG_REMOVED) |
242 | .any ()) |
238 | .any ()) |
243 | return 0; |
239 | return 0; |
244 | |
240 | |
245 | /* This is really a spellbook check - we should in general |
241 | /* This is really a spellbook check - we should in general |
… | |
… | |
770 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
766 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
771 | || (m.move_on | op->move_on ) != m.move_on |
767 | || (m.move_on | op->move_on ) != m.move_on |
772 | || (m.move_off | op->move_off ) != m.move_off |
768 | || (m.move_off | op->move_off ) != m.move_off |
773 | || (m.move_slow | op->move_slow) != m.move_slow |
769 | || (m.move_slow | op->move_slow) != m.move_slow |
774 | /* This isn't perfect, but I don't expect a lot of objects to |
770 | /* This isn't perfect, but I don't expect a lot of objects to |
775 | * to have move_allow right now. |
771 | * have move_allow right now. |
776 | */ |
772 | */ |
777 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
773 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
778 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
774 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
779 | m.flags_ = 0; |
775 | m.flags_ = 0; |
780 | } |
776 | } |
… | |
… | |
910 | || map->in_memory != MAP_ACTIVE |
906 | || map->in_memory != MAP_ACTIVE |
911 | || map->no_drop |
907 | || map->no_drop |
912 | || ms ().move_block == MOVE_ALL) |
908 | || ms ().move_block == MOVE_ALL) |
913 | { |
909 | { |
914 | while (inv) |
910 | while (inv) |
915 | { |
|
|
916 | inv->destroy_inv (false); |
|
|
917 | inv->destroy (); |
911 | inv->destroy (true); |
918 | } |
|
|
919 | } |
912 | } |
920 | else |
913 | else |
921 | { /* Put objects in inventory onto this space */ |
914 | { /* Put objects in inventory onto this space */ |
922 | while (inv) |
915 | while (inv) |
923 | { |
916 | { |
… | |
… | |
1118 | *(below ? &below->above : &ms.bot) = above; |
1111 | *(below ? &below->above : &ms.bot) = above; |
1119 | |
1112 | |
1120 | above = 0; |
1113 | above = 0; |
1121 | below = 0; |
1114 | below = 0; |
1122 | |
1115 | |
|
|
1116 | ms.flags_ = 0; |
|
|
1117 | |
1123 | if (map->in_memory == MAP_SAVING) |
1118 | if (map->in_memory == MAP_SAVING) |
1124 | return; |
1119 | return; |
1125 | |
1120 | |
1126 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1121 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1127 | |
1122 | |
… | |
… | |
1158 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1153 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1159 | } |
1154 | } |
1160 | |
1155 | |
1161 | last = tmp; |
1156 | last = tmp; |
1162 | } |
1157 | } |
1163 | |
|
|
1164 | /* last == NULL if there are no objects on this space */ |
|
|
1165 | //TODO: this makes little sense, why only update the topmost object? |
|
|
1166 | if (!last) |
|
|
1167 | map->at (x, y).flags_ = 0; |
|
|
1168 | else |
|
|
1169 | update_object (last, UP_OBJ_REMOVE); |
|
|
1170 | |
1158 | |
1171 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1159 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1172 | update_all_los (map, x, y); |
1160 | update_all_los (map, x, y); |
1173 | } |
1161 | } |
1174 | } |
1162 | } |
… | |
… | |
1538 | if (!nr) |
1526 | if (!nr) |
1539 | return true; |
1527 | return true; |
1540 | |
1528 | |
1541 | nr = min (nr, nrof); |
1529 | nr = min (nr, nrof); |
1542 | |
1530 | |
|
|
1531 | if (nrof > nr) |
|
|
1532 | { |
1543 | nrof -= nr; |
1533 | nrof -= nr; |
1544 | |
|
|
1545 | if (nrof) |
|
|
1546 | { |
|
|
1547 | adjust_weight (env, -weight * max (1, nr)); // carrying == 0 |
1534 | adjust_weight (env, -weight * max (1, nr)); // carrying == 0 |
1548 | |
1535 | |
1549 | if (object *pl = visible_to ()) |
1536 | if (object *pl = visible_to ()) |
1550 | esrv_update_item (UPD_NROF, pl, this); |
1537 | esrv_update_item (UPD_NROF, pl, this); |
1551 | |
1538 | |
1552 | return true; |
1539 | return true; |
1553 | } |
1540 | } |
1554 | else |
1541 | else |
1555 | { |
1542 | { |
1556 | destroy (1); |
1543 | destroy (); |
1557 | return false; |
1544 | return false; |
1558 | } |
1545 | } |
1559 | } |
1546 | } |
1560 | |
1547 | |
1561 | /* |
1548 | /* |