… | |
… | |
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 | |
35 | int nrofallocobjects = 0; |
37 | int nrofallocobjects = 0; |
36 | static UUID uuid; |
38 | static UUID uuid; |
37 | const uint64 UUID_SKIP = 1<<19; |
39 | const uint64 UUID_SKIP = 1<<19; |
38 | |
40 | |
… | |
… | |
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 | |
194 | bool object::can_merge (object *ob1, object *ob2) |
196 | bool 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 | */ |
… | |
… | |
350 | object * |
348 | object * |
351 | object_get_env_recursive (object *op) |
349 | object_get_env_recursive (object *op) |
352 | { |
350 | { |
353 | while (op->env != NULL) |
351 | while (op->env != NULL) |
354 | op = op->env; |
352 | op = op->env; |
355 | return op; |
|
|
356 | } |
|
|
357 | |
|
|
358 | /* |
|
|
359 | * Eneq(@csd.uu.se): Since we can have items buried in a character we need |
|
|
360 | * a better check. We basically keeping traversing up until we can't |
|
|
361 | * or find a player. |
|
|
362 | */ |
|
|
363 | |
|
|
364 | object * |
|
|
365 | is_player_inv (object *op) |
|
|
366 | { |
|
|
367 | for (; op != NULL && op->type != PLAYER; op = op->env) |
|
|
368 | if (op->env == op) |
|
|
369 | op->env = NULL; |
|
|
370 | return op; |
353 | return op; |
371 | } |
354 | } |
372 | |
355 | |
373 | /* |
356 | /* |
374 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
357 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
… | |
… | |
526 | |
509 | |
527 | if (settings.casting_time) |
510 | if (settings.casting_time) |
528 | casting_time = -1; |
511 | casting_time = -1; |
529 | } |
512 | } |
530 | |
513 | |
531 | void object::clone (object *destination) |
|
|
532 | { |
|
|
533 | *(object_copy *)destination = *this; |
|
|
534 | *(object_pod *)destination = *this; |
|
|
535 | |
|
|
536 | if (self || cb) |
|
|
537 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); |
|
|
538 | } |
|
|
539 | |
|
|
540 | /* |
514 | /* |
541 | * copy object first frees everything allocated by the second object, |
515 | * copy_to first frees everything allocated by the dst object, |
542 | * and then copies the contends of the first object into the second |
516 | * and then copies the contents of itself into the second |
543 | * object, allocating what needs to be allocated. Basically, any |
517 | * object, allocating what needs to be allocated. Basically, any |
544 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
518 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
545 | * if the first object is freed, the pointers in the new object |
519 | * if the first object is freed, the pointers in the new object |
546 | * will point at garbage. |
520 | * will point at garbage. |
547 | */ |
521 | */ |
548 | void |
522 | void |
549 | copy_object (object *op2, object *op) |
523 | object::copy_to (object *dst) |
550 | { |
524 | { |
551 | bool is_freed = QUERY_FLAG (op, FLAG_FREED); |
525 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
552 | bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); |
526 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
553 | |
527 | |
554 | op2->clone (op); |
528 | *(object_copy *)dst = *this; |
|
|
529 | *(object_pod *)dst = *this; |
|
|
530 | |
|
|
531 | if (self || cb) |
|
|
532 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst)); |
555 | |
533 | |
556 | if (is_freed) |
534 | if (is_freed) |
557 | SET_FLAG (op, FLAG_FREED); |
535 | SET_FLAG (dst, FLAG_FREED); |
558 | |
536 | |
559 | if (is_removed) |
537 | if (is_removed) |
560 | SET_FLAG (op, FLAG_REMOVED); |
538 | SET_FLAG (dst, FLAG_REMOVED); |
561 | |
539 | |
562 | if (op2->speed < 0) |
540 | if (speed < 0) |
563 | op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0; |
541 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
564 | |
542 | |
565 | /* Copy over key_values, if any. */ |
543 | /* Copy over key_values, if any. */ |
566 | if (op2->key_values) |
544 | if (key_values) |
567 | { |
545 | { |
568 | key_value *tail = 0; |
546 | key_value *tail = 0; |
569 | key_value *i; |
547 | key_value *i; |
570 | |
548 | |
571 | op->key_values = 0; |
549 | dst->key_values = 0; |
572 | |
550 | |
573 | for (i = op2->key_values; i; i = i->next) |
551 | for (i = key_values; i; i = i->next) |
574 | { |
552 | { |
575 | key_value *new_link = new key_value; |
553 | key_value *new_link = new key_value; |
576 | |
554 | |
577 | new_link->next = 0; |
555 | new_link->next = 0; |
578 | new_link->key = i->key; |
556 | new_link->key = i->key; |
579 | new_link->value = i->value; |
557 | new_link->value = i->value; |
580 | |
558 | |
581 | /* Try and be clever here, too. */ |
559 | /* Try and be clever here, too. */ |
582 | if (!op->key_values) |
560 | if (!dst->key_values) |
583 | { |
561 | { |
584 | op->key_values = new_link; |
562 | dst->key_values = new_link; |
585 | tail = new_link; |
563 | tail = new_link; |
586 | } |
564 | } |
587 | else |
565 | else |
588 | { |
566 | { |
589 | tail->next = new_link; |
567 | tail->next = new_link; |
590 | tail = new_link; |
568 | tail = new_link; |
591 | } |
569 | } |
592 | } |
570 | } |
593 | } |
571 | } |
594 | |
572 | |
595 | update_ob_speed (op); |
573 | update_ob_speed (dst); |
|
|
574 | } |
|
|
575 | |
|
|
576 | object * |
|
|
577 | object::clone () |
|
|
578 | { |
|
|
579 | object *neu = create (); |
|
|
580 | copy_to (neu); |
|
|
581 | return neu; |
596 | } |
582 | } |
597 | |
583 | |
598 | /* |
584 | /* |
599 | * If an object with the IS_TURNABLE() flag needs to be turned due |
585 | * If an object with the IS_TURNABLE() flag needs to be turned due |
600 | * to the closest player being on the other side, this function can |
586 | * to the closest player being on the other side, this function can |
… | |
… | |
909 | |
895 | |
910 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
896 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
911 | remove_friendly_object (this); |
897 | remove_friendly_object (this); |
912 | |
898 | |
913 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
899 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
914 | remove_ob (this); |
900 | remove (); |
915 | |
901 | |
916 | SET_FLAG (this, FLAG_FREED); |
902 | SET_FLAG (this, FLAG_FREED); |
917 | |
903 | |
918 | if (more) |
904 | if (more) |
919 | { |
905 | { |
… | |
… | |
944 | |
930 | |
945 | while (op) |
931 | while (op) |
946 | { |
932 | { |
947 | object *tmp = op->below; |
933 | object *tmp = op->below; |
948 | |
934 | |
949 | remove_ob (op); |
935 | op->remove (); |
950 | |
936 | |
951 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
937 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
952 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
938 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
953 | free_object (op); |
939 | op->destroy (); |
954 | else |
940 | else |
955 | { |
941 | { |
956 | op->x = x; |
942 | op->x = x; |
957 | op->y = y; |
943 | op->y = y; |
958 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
944 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
… | |
… | |
1015 | op->carrying -= weight; |
1001 | op->carrying -= weight; |
1016 | op = op->env; |
1002 | op = op->env; |
1017 | } |
1003 | } |
1018 | } |
1004 | } |
1019 | |
1005 | |
1020 | /* remove_ob(op): |
1006 | /* op->remove (): |
1021 | * This function removes the object op from the linked list of objects |
1007 | * This function removes the object op from the linked list of objects |
1022 | * which it is currently tied to. When this function is done, the |
1008 | * which it is currently tied to. When this function is done, the |
1023 | * object will have no environment. If the object previously had an |
1009 | * object will have no environment. If the object previously had an |
1024 | * environment, the x and y coordinates will be updated to |
1010 | * environment, the x and y coordinates will be updated to |
1025 | * the previous environment. |
1011 | * the previous environment. |
… | |
… | |
1054 | |
1040 | |
1055 | /* NO_FIX_PLAYER is set when a great many changes are being |
1041 | /* NO_FIX_PLAYER is set when a great many changes are being |
1056 | * made to players inventory. If set, avoiding the call |
1042 | * made to players inventory. If set, avoiding the call |
1057 | * to save cpu time. |
1043 | * to save cpu time. |
1058 | */ |
1044 | */ |
1059 | if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1045 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1060 | fix_player (otmp); |
1046 | fix_player (otmp); |
1061 | |
1047 | |
1062 | if (above != NULL) |
1048 | if (above != NULL) |
1063 | above->below = below; |
1049 | above->below = below; |
1064 | else |
1050 | else |
… | |
… | |
1135 | { |
1121 | { |
1136 | CLEAR_FLAG (this, FLAG_APPLIED); |
1122 | CLEAR_FLAG (this, FLAG_APPLIED); |
1137 | tmp->container = 0; |
1123 | tmp->container = 0; |
1138 | } |
1124 | } |
1139 | |
1125 | |
1140 | tmp->contr->socket.update_look = 1; |
1126 | tmp->contr->socket->floorbox_update (); |
1141 | } |
1127 | } |
1142 | |
1128 | |
1143 | /* See if player moving off should effect something */ |
1129 | /* See if player moving off should effect something */ |
1144 | if (check_walk_off |
1130 | if (check_walk_off |
1145 | && ((move_type & tmp->move_off) |
1131 | && ((move_type & tmp->move_off) |
… | |
… | |
1197 | |
1183 | |
1198 | for (; top != NULL; top = top->below) |
1184 | for (; top != NULL; top = top->below) |
1199 | { |
1185 | { |
1200 | if (top == op) |
1186 | if (top == op) |
1201 | continue; |
1187 | continue; |
1202 | if (CAN_MERGE (op, top)) |
1188 | |
|
|
1189 | if (object::can_merge (op, top)) |
1203 | { |
1190 | { |
1204 | top->nrof += op->nrof; |
1191 | top->nrof += op->nrof; |
1205 | |
1192 | |
1206 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1193 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1207 | op->weight = 0; /* Don't want any adjustements now */ |
1194 | op->weight = 0; /* Don't want any adjustements now */ |
1208 | remove_ob (op); |
1195 | op->destroy (); |
1209 | free_object (op); |
|
|
1210 | return top; |
1196 | return top; |
1211 | } |
1197 | } |
1212 | } |
1198 | } |
1213 | |
1199 | |
1214 | return 0; |
1200 | return 0; |
… | |
… | |
1341 | |
1327 | |
1342 | /* this has to be done after we translate the coordinates. |
1328 | /* this has to be done after we translate the coordinates. |
1343 | */ |
1329 | */ |
1344 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1330 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1345 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1331 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1346 | if (CAN_MERGE (op, tmp)) |
1332 | if (object::can_merge (op, tmp)) |
1347 | { |
1333 | { |
1348 | op->nrof += tmp->nrof; |
1334 | op->nrof += tmp->nrof; |
1349 | remove_ob (tmp); |
1335 | tmp->destroy (); |
1350 | free_object (tmp); |
|
|
1351 | } |
1336 | } |
1352 | |
1337 | |
1353 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1338 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1354 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1339 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1355 | |
1340 | |
… | |
… | |
1483 | * it, so save a few ticks and start from there. |
1468 | * it, so save a few ticks and start from there. |
1484 | */ |
1469 | */ |
1485 | if (!(flag & INS_MAP_LOAD)) |
1470 | if (!(flag & INS_MAP_LOAD)) |
1486 | for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1471 | for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1487 | if (tmp->type == PLAYER) |
1472 | if (tmp->type == PLAYER) |
1488 | tmp->contr->socket.update_look = 1; |
1473 | tmp->contr->socket->floorbox_update (); |
1489 | |
1474 | |
1490 | /* If this object glows, it may affect lighting conditions that are |
1475 | /* If this object glows, it may affect lighting conditions that are |
1491 | * visible to others on this map. But update_all_los is really |
1476 | * visible to others on this map. But update_all_los is really |
1492 | * an inefficient way to do this, as it means los for all players |
1477 | * an inefficient way to do this, as it means los for all players |
1493 | * on the map will get recalculated. The players could very well |
1478 | * on the map will get recalculated. The players could very well |
… | |
… | |
1501 | |
1486 | |
1502 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1487 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1503 | update_object (op, UP_OBJ_INSERT); |
1488 | update_object (op, UP_OBJ_INSERT); |
1504 | |
1489 | |
1505 | /* Don't know if moving this to the end will break anything. However, |
1490 | /* Don't know if moving this to the end will break anything. However, |
1506 | * we want to have update_look set above before calling this. |
1491 | * we want to have floorbox_update called before calling this. |
1507 | * |
1492 | * |
1508 | * check_move_on() must be after this because code called from |
1493 | * check_move_on() must be after this because code called from |
1509 | * check_move_on() depends on correct map flags (so functions like |
1494 | * check_move_on() depends on correct map flags (so functions like |
1510 | * blocked() and wall() work properly), and these flags are updated by |
1495 | * blocked() and wall() work properly), and these flags are updated by |
1511 | * update_object(). |
1496 | * update_object(). |
… | |
… | |
1541 | tmp1; |
1526 | tmp1; |
1542 | |
1527 | |
1543 | /* first search for itself and remove any old instances */ |
1528 | /* first search for itself and remove any old instances */ |
1544 | |
1529 | |
1545 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1530 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1546 | { |
|
|
1547 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1531 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1548 | { |
1532 | tmp->destroy (); |
1549 | remove_ob (tmp); |
|
|
1550 | free_object (tmp); |
|
|
1551 | } |
|
|
1552 | } |
|
|
1553 | |
1533 | |
1554 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1534 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1555 | |
1535 | |
1556 | tmp1->x = op->x; |
1536 | tmp1->x = op->x; |
1557 | tmp1->y = op->y; |
1537 | tmp1->y = op->y; |
… | |
… | |
1567 | */ |
1547 | */ |
1568 | |
1548 | |
1569 | object * |
1549 | object * |
1570 | get_split_ob (object *orig_ob, uint32 nr) |
1550 | get_split_ob (object *orig_ob, uint32 nr) |
1571 | { |
1551 | { |
1572 | object * |
1552 | object *newob; |
1573 | newob; |
|
|
1574 | int |
|
|
1575 | is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1553 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1576 | |
1554 | |
1577 | if (orig_ob->nrof < nr) |
1555 | if (orig_ob->nrof < nr) |
1578 | { |
1556 | { |
1579 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1557 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1580 | return NULL; |
1558 | return NULL; |
1581 | } |
1559 | } |
1582 | |
1560 | |
1583 | newob = object_create_clone (orig_ob); |
1561 | newob = object_create_clone (orig_ob); |
1584 | |
1562 | |
1585 | if ((orig_ob->nrof -= nr) < 1) |
1563 | if ((orig_ob->nrof -= nr) < 1) |
1586 | { |
1564 | orig_ob->destroy (1); |
1587 | if (!is_removed) |
|
|
1588 | remove_ob (orig_ob); |
|
|
1589 | free_object2 (orig_ob, 1); |
|
|
1590 | } |
|
|
1591 | else if (!is_removed) |
1565 | else if (!is_removed) |
1592 | { |
1566 | { |
1593 | if (orig_ob->env != NULL) |
1567 | if (orig_ob->env != NULL) |
1594 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1568 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1595 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
1569 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
… | |
… | |
1625 | if (i > op->nrof) |
1599 | if (i > op->nrof) |
1626 | i = op->nrof; |
1600 | i = op->nrof; |
1627 | |
1601 | |
1628 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1602 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1629 | op->nrof -= i; |
1603 | op->nrof -= i; |
1630 | else if (op->env != NULL) |
1604 | else if (op->env) |
1631 | { |
1605 | { |
1632 | /* is this object in the players inventory, or sub container |
1606 | /* is this object in the players inventory, or sub container |
1633 | * therein? |
1607 | * therein? |
1634 | */ |
1608 | */ |
1635 | tmp = is_player_inv (op->env); |
1609 | tmp = op->in_player (); |
1636 | /* nope. Is this a container the player has opened? |
1610 | /* nope. Is this a container the player has opened? |
1637 | * If so, set tmp to that player. |
1611 | * If so, set tmp to that player. |
1638 | * IMO, searching through all the players will mostly |
1612 | * IMO, searching through all the players will mostly |
1639 | * likely be quicker than following op->env to the map, |
1613 | * likely be quicker than following op->env to the map, |
1640 | * and then searching the map for a player. |
1614 | * and then searching the map for a player. |
1641 | */ |
1615 | */ |
1642 | if (!tmp) |
1616 | if (!tmp) |
1643 | { |
1617 | { |
1644 | for (pl = first_player; pl; pl = pl->next) |
1618 | for (pl = first_player; pl; pl = pl->next) |
1645 | if (pl->ob->container == op->env) |
1619 | if (pl->ob->container == op->env) |
|
|
1620 | { |
|
|
1621 | tmp = pl->ob; |
1646 | break; |
1622 | break; |
1647 | if (pl) |
1623 | } |
1648 | tmp = pl->ob; |
|
|
1649 | else |
|
|
1650 | tmp = NULL; |
|
|
1651 | } |
1624 | } |
1652 | |
1625 | |
1653 | if (i < op->nrof) |
1626 | if (i < op->nrof) |
1654 | { |
1627 | { |
1655 | sub_weight (op->env, op->weight * i); |
1628 | sub_weight (op->env, op->weight * i); |
1656 | op->nrof -= i; |
1629 | op->nrof -= i; |
1657 | if (tmp) |
1630 | if (tmp) |
1658 | { |
|
|
1659 | esrv_send_item (tmp, op); |
1631 | esrv_send_item (tmp, op); |
1660 | } |
|
|
1661 | } |
1632 | } |
1662 | else |
1633 | else |
1663 | { |
1634 | { |
1664 | remove_ob (op); |
1635 | op->remove (); |
1665 | op->nrof = 0; |
1636 | op->nrof = 0; |
1666 | if (tmp) |
1637 | if (tmp) |
1667 | { |
|
|
1668 | esrv_del_item (tmp->contr, op->count); |
1638 | esrv_del_item (tmp->contr, op->count); |
1669 | } |
|
|
1670 | } |
1639 | } |
1671 | } |
1640 | } |
1672 | else |
1641 | else |
1673 | { |
1642 | { |
1674 | object *above = op->above; |
1643 | object *above = op->above; |
1675 | |
1644 | |
1676 | if (i < op->nrof) |
1645 | if (i < op->nrof) |
1677 | op->nrof -= i; |
1646 | op->nrof -= i; |
1678 | else |
1647 | else |
1679 | { |
1648 | { |
1680 | remove_ob (op); |
1649 | op->remove (); |
1681 | op->nrof = 0; |
1650 | op->nrof = 0; |
1682 | } |
1651 | } |
1683 | |
1652 | |
1684 | /* Since we just removed op, op->above is null */ |
1653 | /* Since we just removed op, op->above is null */ |
1685 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
1654 | for (tmp = above; tmp; tmp = tmp->above) |
1686 | if (tmp->type == PLAYER) |
1655 | if (tmp->type == PLAYER) |
1687 | { |
1656 | { |
1688 | if (op->nrof) |
1657 | if (op->nrof) |
1689 | esrv_send_item (tmp, op); |
1658 | esrv_send_item (tmp, op); |
1690 | else |
1659 | else |
… | |
… | |
1694 | |
1663 | |
1695 | if (op->nrof) |
1664 | if (op->nrof) |
1696 | return op; |
1665 | return op; |
1697 | else |
1666 | else |
1698 | { |
1667 | { |
1699 | free_object (op); |
1668 | op->destroy (); |
1700 | return NULL; |
1669 | return 0; |
1701 | } |
1670 | } |
1702 | } |
1671 | } |
1703 | |
1672 | |
1704 | /* |
1673 | /* |
1705 | * add_weight(object, weight) adds the specified weight to an object, |
1674 | * add_weight(object, weight) adds the specified weight to an object, |
… | |
… | |
1765 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1734 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1766 | CLEAR_FLAG (op, FLAG_REMOVED); |
1735 | CLEAR_FLAG (op, FLAG_REMOVED); |
1767 | if (op->nrof) |
1736 | if (op->nrof) |
1768 | { |
1737 | { |
1769 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1738 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1770 | if (CAN_MERGE (tmp, op)) |
1739 | if (object::can_merge (tmp, op)) |
1771 | { |
1740 | { |
1772 | /* return the original object and remove inserted object |
1741 | /* return the original object and remove inserted object |
1773 | (client needs the original object) */ |
1742 | (client needs the original object) */ |
1774 | tmp->nrof += op->nrof; |
1743 | tmp->nrof += op->nrof; |
1775 | /* Weight handling gets pretty funky. Since we are adding to |
1744 | /* Weight handling gets pretty funky. Since we are adding to |
… | |
… | |
1793 | add_weight (this, op->weight * op->nrof); |
1762 | add_weight (this, op->weight * op->nrof); |
1794 | } |
1763 | } |
1795 | else |
1764 | else |
1796 | add_weight (this, (op->weight + op->carrying)); |
1765 | add_weight (this, (op->weight + op->carrying)); |
1797 | |
1766 | |
1798 | otmp = is_player_inv (this); |
1767 | otmp = this->in_player (); |
1799 | if (otmp && otmp->contr) |
1768 | if (otmp && otmp->contr) |
1800 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1769 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1801 | fix_player (otmp); |
1770 | fix_player (otmp); |
1802 | |
1771 | |
1803 | op->map = NULL; |
1772 | op->map = 0; |
1804 | op->env = this; |
1773 | op->env = this; |
1805 | op->above = NULL; |
1774 | op->above = 0; |
1806 | op->below = NULL; |
1775 | op->below = 0; |
1807 | op->x = 0, op->y = 0; |
1776 | op->x = 0, op->y = 0; |
1808 | |
1777 | |
1809 | /* reset the light list and los of the players on the map */ |
1778 | /* reset the light list and los of the players on the map */ |
1810 | if ((op->glow_radius != 0) && map) |
1779 | if ((op->glow_radius != 0) && map) |
1811 | { |
1780 | { |
… | |
… | |
2148 | * if the space being examined only has a wall to the north and empty |
2117 | * if the space being examined only has a wall to the north and empty |
2149 | * spaces in all the other directions, this will reduce the search space |
2118 | * spaces in all the other directions, this will reduce the search space |
2150 | * to only the spaces immediately surrounding the target area, and |
2119 | * to only the spaces immediately surrounding the target area, and |
2151 | * won't look 2 spaces south of the target space. |
2120 | * won't look 2 spaces south of the target space. |
2152 | */ |
2121 | */ |
2153 | else if ((flag & AB_NO_PASS) && maxfree[i] < stop) |
2122 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2154 | stop = maxfree[i]; |
2123 | stop = maxfree[i]; |
2155 | } |
2124 | } |
|
|
2125 | |
2156 | if (!index) |
2126 | if (!index) |
2157 | return -1; |
2127 | return -1; |
|
|
2128 | |
2158 | return altern[RANDOM () % index]; |
2129 | return altern[RANDOM () % index]; |
2159 | } |
2130 | } |
2160 | |
2131 | |
2161 | /* |
2132 | /* |
2162 | * find_first_free_spot(archetype, maptile, x, y) works like |
2133 | * find_first_free_spot(archetype, maptile, x, y) works like |
… | |
… | |
2524 | * create clone from object to another |
2495 | * create clone from object to another |
2525 | */ |
2496 | */ |
2526 | object * |
2497 | object * |
2527 | object_create_clone (object *asrc) |
2498 | object_create_clone (object *asrc) |
2528 | { |
2499 | { |
2529 | object * |
|
|
2530 | dst = NULL, *tmp, *src, *part, *prev, *item; |
2500 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2531 | |
2501 | |
2532 | if (!asrc) |
2502 | if (!asrc) |
2533 | return NULL; |
2503 | return 0; |
|
|
2504 | |
2534 | src = asrc; |
2505 | src = asrc; |
2535 | if (src->head) |
2506 | if (src->head) |
2536 | src = src->head; |
2507 | src = src->head; |
2537 | |
2508 | |
2538 | prev = NULL; |
2509 | prev = 0; |
2539 | for (part = src; part; part = part->more) |
2510 | for (part = src; part; part = part->more) |
2540 | { |
2511 | { |
2541 | tmp = get_object (); |
2512 | tmp = part->clone (); |
2542 | copy_object (part, tmp); |
|
|
2543 | tmp->x -= src->x; |
2513 | tmp->x -= src->x; |
2544 | tmp->y -= src->y; |
2514 | tmp->y -= src->y; |
|
|
2515 | |
2545 | if (!part->head) |
2516 | if (!part->head) |
2546 | { |
2517 | { |
2547 | dst = tmp; |
2518 | dst = tmp; |
2548 | tmp->head = NULL; |
2519 | tmp->head = 0; |
2549 | } |
2520 | } |
2550 | else |
2521 | else |
2551 | { |
2522 | { |
2552 | tmp->head = dst; |
2523 | tmp->head = dst; |
2553 | } |
2524 | } |
|
|
2525 | |
2554 | tmp->more = NULL; |
2526 | tmp->more = 0; |
|
|
2527 | |
2555 | if (prev) |
2528 | if (prev) |
2556 | prev->more = tmp; |
2529 | prev->more = tmp; |
|
|
2530 | |
2557 | prev = tmp; |
2531 | prev = tmp; |
2558 | } |
2532 | } |
2559 | |
2533 | |
2560 | for (item = src->inv; item; item = item->below) |
2534 | for (item = src->inv; item; item = item->below) |
2561 | insert_ob_in_ob (object_create_clone (item), dst); |
2535 | insert_ob_in_ob (object_create_clone (item), dst); |
… | |
… | |
2587 | } |
2561 | } |
2588 | |
2562 | |
2589 | fprintf (tempfile, obstr); |
2563 | fprintf (tempfile, obstr); |
2590 | fclose (tempfile); |
2564 | fclose (tempfile); |
2591 | |
2565 | |
2592 | op = get_object (); |
2566 | op = object::create (); |
2593 | |
2567 | |
2594 | object_thawer thawer (filename); |
2568 | object_thawer thawer (filename); |
2595 | |
2569 | |
2596 | if (thawer) |
2570 | if (thawer) |
2597 | load_object (thawer, op, 0); |
2571 | load_object (thawer, op, 0); |