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.68 by root, Mon Dec 18 02:35:00 2006 UTC vs.
Revision 1.81 by root, Sat Dec 23 13:56:25 2006 UTC

… …
221 SET_FLAG (ob1, FLAG_BEEN_APPLIED); 221 SET_FLAG (ob1, FLAG_BEEN_APPLIED);
222 222
223 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) 223 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
224 SET_FLAG (ob2, FLAG_BEEN_APPLIED); 224 SET_FLAG (ob2, FLAG_BEEN_APPLIED);
225 225
226
227 if ((ob1->flags ^ ob2->flags).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () 226 if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
228 || ob1->arch != ob2->arch 227 || ob1->arch != ob2->arch
229 || ob1->name != ob2->name 228 || ob1->name != ob2->name
230 || ob1->title != ob2->title 229 || ob1->title != ob2->title
231 || ob1->msg != ob2->msg 230 || ob1->msg != ob2->msg
232 || ob1->weight != ob2->weight 231 || ob1->weight != ob2->weight
… …
353 op = op->env; 352 op = op->env;
354 return op; 353 return op;
355} 354}
356 355
357/* 356/*
358 * Eneq(@csd.uu.se): Since we can have items buried in a character we need
359 * a better check. We basically keeping traversing up until we can't
360 * or find a player.
361 */
362
363object *
364is_player_inv (object *op)
365{
366 for (; op != NULL && op->type != PLAYER; op = op->env)
367 if (op->env == op)
368 op->env = NULL;
369 return op;
370}
371
372/*
373 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 357 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
374 * Some error messages. 358 * Some error messages.
375 * The result of the dump is stored in the static global errmsg array. 359 * The result of the dump is stored in the static global errmsg array.
376 */ 360 */
377 361
… …
483 } 467 }
484 468
485 op->key_values = 0; 469 op->key_values = 0;
486} 470}
487 471
488void object::clear ()
489{
490 attachable_base::clear ();
491
492 free_key_values (this);
493
494 owner = 0;
495 name = 0;
496 name_pl = 0;
497 title = 0;
498 race = 0;
499 slaying = 0;
500 skill = 0;
501 msg = 0;
502 lore = 0;
503 custom_name = 0;
504 materialname = 0;
505 contr = 0;
506 below = 0;
507 above = 0;
508 inv = 0;
509 container = 0;
510 env = 0;
511 more = 0;
512 head = 0;
513 map = 0;
514 active_next = 0;
515 active_prev = 0;
516
517 memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
518
519 SET_FLAG (this, FLAG_REMOVED);
520
521 /* What is not cleared is next, prev, and count */
522
523 expmul = 1.0;
524 face = blank_face;
525
526 if (settings.casting_time)
527 casting_time = -1;
528}
529
530/* 472/*
531 * copy_to first frees everything allocated by the dst object, 473 * copy_to first frees everything allocated by the dst object,
532 * and then copies the contents of itself into the second 474 * and then copies the contents of itself into the second
533 * object, allocating what needs to be allocated. Basically, any 475 * object, allocating what needs to be allocated. Basically, any
534 * data that is malloc'd needs to be re-malloc/copied. Otherwise, 476 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
… …
540{ 482{
541 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 483 bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
542 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 484 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
543 485
544 *(object_copy *)dst = *this; 486 *(object_copy *)dst = *this;
545 *(object_pod *)dst = *this;
546 487
547 if (self || cb) 488 if (self || cb)
548 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst)); 489 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));
549 490
550 if (is_freed) 491 if (is_freed)
… …
710 op->active_next = NULL; 651 op->active_next = NULL;
711 op->active_prev = NULL; 652 op->active_prev = NULL;
712} 653}
713 654
714/* 655/*
715 * update_object() updates the array which represents the map. 656 * update_object() updates the the map.
716 * It takes into account invisible objects (and represent squares covered 657 * It takes into account invisible objects (and represent squares covered
717 * by invisible objects by whatever is below them (unless it's another 658 * by invisible objects by whatever is below them (unless it's another
718 * invisible object, etc...) 659 * invisible object, etc...)
719 * If the object being updated is beneath a player, the look-window 660 * If the object being updated is beneath a player, the look-window
720 * of that player is updated (this might be a suboptimal way of 661 * of that player is updated (this might be a suboptimal way of
721 * updating that window, though, since update_object() is called _often_) 662 * updating that window, though, since update_object() is called _often_)
722 * 663 *
723 * action is a hint of what the caller believes need to be done. 664 * action is a hint of what the caller believes need to be done.
724 * For example, if the only thing that has changed is the face (due to
725 * an animation), we don't need to call update_position until that actually
726 * comes into view of a player. OTOH, many other things, like addition/removal
727 * of walls or living creatures may need us to update the flags now.
728 * current action are: 665 * current action are:
729 * UP_OBJ_INSERT: op was inserted 666 * UP_OBJ_INSERT: op was inserted
730 * UP_OBJ_REMOVE: op was removed 667 * UP_OBJ_REMOVE: op was removed
731 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update 668 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
732 * as that is easier than trying to look at what may have changed. 669 * as that is easier than trying to look at what may have changed.
733 * UP_OBJ_FACE: only the objects face has changed. 670 * UP_OBJ_FACE: only the objects face has changed.
734 */ 671 */
735
736void 672void
737update_object (object *op, int action) 673update_object (object *op, int action)
738{ 674{
739 int update_now = 0, flags;
740 MoveType move_on, move_off, move_block, move_slow; 675 MoveType move_on, move_off, move_block, move_slow;
741 676
742 if (op == NULL) 677 if (op == NULL)
743 { 678 {
744 /* this should never happen */ 679 /* this should never happen */
745 LOG (llevDebug, "update_object() called for NULL object.\n"); 680 LOG (llevDebug, "update_object() called for NULL object.\n");
746 return; 681 return;
747 } 682 }
748 683
749 if (op->env != NULL) 684 if (op->env)
750 { 685 {
751 /* Animation is currently handled by client, so nothing 686 /* Animation is currently handled by client, so nothing
752 * to do in this case. 687 * to do in this case.
753 */ 688 */
754 return; 689 return;
… …
768 abort (); 703 abort ();
769#endif 704#endif
770 return; 705 return;
771 } 706 }
772 707
773 flags = GET_MAP_FLAGS (op->map, op->x, op->y); 708 mapspace &m = op->ms ();
774 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
775 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
776 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
777 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
778 move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
779 709
710 if (m.flags_ & P_NEED_UPDATE)
711 /* nop */;
780 if (action == UP_OBJ_INSERT) 712 else if (action == UP_OBJ_INSERT)
781 { 713 {
714 // this is likely overkill, TODO: revisit (schmorp)
782 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW)) 715 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
783 update_now = 1;
784
785 if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC)) 716 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
786 update_now = 1; 717 || (op->type == PLAYER && !(m.flags_ & P_PLAYER))
787 718 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
719 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
788 if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC)) 720 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
789 update_now = 1;
790
791 if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
792 update_now = 1;
793
794 if (op->type == SAFE_GROUND && !(flags & P_SAFE))
795 update_now = 1;
796
797 if ((move_on | op->move_on) != move_on) 721 || (m.move_on | op->move_on ) != m.move_on
798 update_now = 1;
799
800 if ((move_off | op->move_off) != move_off) 722 || (m.move_off | op->move_off ) != m.move_off
801 update_now = 1; 723 || (m.move_slow | op->move_slow) != m.move_slow
802
803 /* This isn't perfect, but I don't expect a lot of objects to 724 /* This isn't perfect, but I don't expect a lot of objects to
804 * to have move_allow right now. 725 * to have move_allow right now.
805 */ 726 */
806 if (((move_block | op->move_block) & ~op->move_allow) != move_block) 727 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
807 update_now = 1; 728 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
808 729 m.flags_ = P_NEED_UPDATE;
809 if ((move_slow | op->move_slow) != move_slow)
810 update_now = 1;
811 } 730 }
812
813 /* if the object is being removed, we can't make intelligent 731 /* if the object is being removed, we can't make intelligent
814 * decisions, because remove_ob can't really pass the object 732 * decisions, because remove_ob can't really pass the object
815 * that is being removed. 733 * that is being removed.
816 */ 734 */
817 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 735 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
818 update_now = 1; 736 m.flags_ = P_NEED_UPDATE;
819 else if (action == UP_OBJ_FACE) 737 else if (action == UP_OBJ_FACE)
820 /* Nothing to do for that case */ ; 738 /* Nothing to do for that case */ ;
821 else 739 else
822 LOG (llevError, "update_object called with invalid action: %d\n", action); 740 LOG (llevError, "update_object called with invalid action: %d\n", action);
823 741
824 if (update_now)
825 {
826 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
827 update_position (op->map, op->x, op->y);
828 }
829
830 if (op->more != NULL) 742 if (op->more)
831 update_object (op->more, action); 743 update_object (op->more, action);
832} 744}
833 745
834object::vector object::mortals; 746object::vector object::mortals;
835object::vector object::objects; // not yet used 747object::vector object::objects; // not yet used
… …
1056 968
1057 /* NO_FIX_PLAYER is set when a great many changes are being 969 /* NO_FIX_PLAYER is set when a great many changes are being
1058 * made to players inventory. If set, avoiding the call 970 * made to players inventory. If set, avoiding the call
1059 * to save cpu time. 971 * to save cpu time.
1060 */ 972 */
1061 if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 973 if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1062 fix_player (otmp); 974 otmp->update_stats ();
1063 975
1064 if (above != NULL) 976 if (above != NULL)
1065 above->below = below; 977 above->below = below;
1066 else 978 else
1067 env->inv = below; 979 env->inv = below;
… …
1086 998
1087 /* link the object above us */ 999 /* link the object above us */
1088 if (above) 1000 if (above)
1089 above->below = below; 1001 above->below = below;
1090 else 1002 else
1091 SET_MAP_TOP (map, x, y, below); /* we were top, set new top */ 1003 map->at (x, y).top = below; /* we were top, set new top */
1092 1004
1093 /* Relink the object below us, if there is one */ 1005 /* Relink the object below us, if there is one */
1094 if (below) 1006 if (below)
1095 below->above = above; 1007 below->above = above;
1096 else 1008 else
… …
1108 dump = dump_object (GET_MAP_OB (map, x, y)); 1020 dump = dump_object (GET_MAP_OB (map, x, y));
1109 LOG (llevError, "%s\n", dump); 1021 LOG (llevError, "%s\n", dump);
1110 free (dump); 1022 free (dump);
1111 } 1023 }
1112 1024
1113 SET_MAP_OB (map, x, y, above); /* goes on above it. */ 1025 map->at (x, y).bottom = above; /* goes on above it. */
1114 } 1026 }
1115 1027
1116 above = 0; 1028 above = 0;
1117 below = 0; 1029 below = 0;
1118 1030
… …
1137 { 1049 {
1138 CLEAR_FLAG (this, FLAG_APPLIED); 1050 CLEAR_FLAG (this, FLAG_APPLIED);
1139 tmp->container = 0; 1051 tmp->container = 0;
1140 } 1052 }
1141 1053
1142 tmp->contr->socket->update_look = 1; 1054 tmp->contr->ns->floorbox_update ();
1143 } 1055 }
1144 1056
1145 /* See if player moving off should effect something */ 1057 /* See if player moving off should effect something */
1146 if (check_walk_off 1058 if (check_walk_off
1147 && ((move_type & tmp->move_off) 1059 && ((move_type & tmp->move_off)
… …
1161 last = tmp; 1073 last = tmp;
1162 } 1074 }
1163 1075
1164 /* last == NULL of there are no objects on this space */ 1076 /* last == NULL of there are no objects on this space */
1165 if (!last) 1077 if (!last)
1166 { 1078 map->at (x, y).flags_ = P_NEED_UPDATE;
1167 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1168 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1169 * those out anyways, and if there are any flags set right now, they won't
1170 * be correct anyways.
1171 */
1172 SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1173 update_position (map, x, y);
1174 }
1175 else 1079 else
1176 update_object (last, UP_OBJ_REMOVE); 1080 update_object (last, UP_OBJ_REMOVE);
1177 1081
1178 if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius) 1082 if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)
1179 update_all_los (map, x, y); 1083 update_all_los (map, x, y);
… …
1369 op->below = originator->below; 1273 op->below = originator->below;
1370 1274
1371 if (op->below) 1275 if (op->below)
1372 op->below->above = op; 1276 op->below->above = op;
1373 else 1277 else
1374 SET_MAP_OB (op->map, op->x, op->y, op); 1278 op->ms ().bottom = op;
1375 1279
1376 /* since *below* originator, no need to update top */ 1280 /* since *below* originator, no need to update top */
1377 originator->below = op; 1281 originator->below = op;
1378 } 1282 }
1379 else 1283 else
… …
1425 * If INS_ON_TOP is used, don't do this processing 1329 * If INS_ON_TOP is used, don't do this processing
1426 * Need to find the object that in fact blocks view, otherwise 1330 * Need to find the object that in fact blocks view, otherwise
1427 * stacking is a bit odd. 1331 * stacking is a bit odd.
1428 */ 1332 */
1429 if (!(flag & INS_ON_TOP) && 1333 if (!(flag & INS_ON_TOP) &&
1430 (get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) 1334 (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))
1431 { 1335 {
1432 for (last = top; last != floor; last = last->below) 1336 for (last = top; last != floor; last = last->below)
1433 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1337 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1434 break; 1338 break;
1435 /* Check to see if we found the object that blocks view, 1339 /* Check to see if we found the object that blocks view,
… …
1458 1362
1459 if (op->above) 1363 if (op->above)
1460 op->above->below = op; 1364 op->above->below = op;
1461 1365
1462 op->below = NULL; 1366 op->below = NULL;
1463 SET_MAP_OB (op->map, op->x, op->y, op); 1367 op->ms ().bottom = op;
1464 } 1368 }
1465 else 1369 else
1466 { /* get inserted into the stack above top */ 1370 { /* get inserted into the stack above top */
1467 op->above = top->above; 1371 op->above = top->above;
1468 1372
… …
1472 op->below = top; 1376 op->below = top;
1473 top->above = op; 1377 top->above = op;
1474 } 1378 }
1475 1379
1476 if (op->above == NULL) 1380 if (op->above == NULL)
1477 SET_MAP_TOP (op->map, op->x, op->y, op); 1381 op->ms ().top = op;
1478 } /* else not INS_BELOW_ORIGINATOR */ 1382 } /* else not INS_BELOW_ORIGINATOR */
1479 1383
1480 if (op->type == PLAYER) 1384 if (op->type == PLAYER)
1481 op->contr->do_los = 1; 1385 op->contr->do_los = 1;
1482 1386
1483 /* If we have a floor, we know the player, if any, will be above 1387 /* If we have a floor, we know the player, if any, will be above
1484 * it, so save a few ticks and start from there. 1388 * it, so save a few ticks and start from there.
1485 */ 1389 */
1486 if (!(flag & INS_MAP_LOAD)) 1390 if (!(flag & INS_MAP_LOAD))
1487 for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1391 if (object *pl = op->ms ().player ())
1488 if (tmp->type == PLAYER) 1392 pl->contr->ns->floorbox_update ();
1489 tmp->contr->socket->update_look = 1;
1490 1393
1491 /* If this object glows, it may affect lighting conditions that are 1394 /* If this object glows, it may affect lighting conditions that are
1492 * visible to others on this map. But update_all_los is really 1395 * visible to others on this map. But update_all_los is really
1493 * an inefficient way to do this, as it means los for all players 1396 * an inefficient way to do this, as it means los for all players
1494 * on the map will get recalculated. The players could very well 1397 * on the map will get recalculated. The players could very well
… …
1502 1405
1503 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1406 /* updates flags (blocked, alive, no magic, etc) for this map space */
1504 update_object (op, UP_OBJ_INSERT); 1407 update_object (op, UP_OBJ_INSERT);
1505 1408
1506 /* Don't know if moving this to the end will break anything. However, 1409 /* Don't know if moving this to the end will break anything. However,
1507 * we want to have update_look set above before calling this. 1410 * we want to have floorbox_update called before calling this.
1508 * 1411 *
1509 * check_move_on() must be after this because code called from 1412 * check_move_on() must be after this because code called from
1510 * check_move_on() depends on correct map flags (so functions like 1413 * check_move_on() depends on correct map flags (so functions like
1511 * blocked() and wall() work properly), and these flags are updated by 1414 * blocked() and wall() work properly), and these flags are updated by
1512 * update_object(). 1415 * update_object().
… …
1528 1431
1529 return op; 1432 return op;
1530} 1433}
1531 1434
1532/* this function inserts an object in the map, but if it 1435/* this function inserts an object in the map, but if it
1533 * finds an object of its own type, it'll remove that one first. 1436 * finds an object of its own type, it'll remove that one first.
1534 * op is the object to insert it under: supplies x and the map. 1437 * op is the object to insert it under: supplies x and the map.
1535 */ 1438 */
1536void 1439void
1537replace_insert_ob_in_map (const char *arch_string, object *op) 1440replace_insert_ob_in_map (const char *arch_string, object *op)
1538{ 1441{
1539 object * 1442 object *tmp, *tmp1;
1540 tmp;
1541 object *
1542 tmp1;
1543 1443
1544 /* first search for itself and remove any old instances */ 1444 /* first search for itself and remove any old instances */
1545 1445
1546 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1446 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1547 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1447 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
… …
1605 1505
1606object * 1506object *
1607decrease_ob_nr (object *op, uint32 i) 1507decrease_ob_nr (object *op, uint32 i)
1608{ 1508{
1609 object *tmp; 1509 object *tmp;
1610 player *pl;
1611 1510
1612 if (i == 0) /* objects with op->nrof require this check */ 1511 if (i == 0) /* objects with op->nrof require this check */
1613 return op; 1512 return op;
1614 1513
1615 if (i > op->nrof) 1514 if (i > op->nrof)
1616 i = op->nrof; 1515 i = op->nrof;
1617 1516
1618 if (QUERY_FLAG (op, FLAG_REMOVED)) 1517 if (QUERY_FLAG (op, FLAG_REMOVED))
1619 op->nrof -= i; 1518 op->nrof -= i;
1620 else if (op->env != NULL) 1519 else if (op->env)
1621 { 1520 {
1622 /* is this object in the players inventory, or sub container 1521 /* is this object in the players inventory, or sub container
1623 * therein? 1522 * therein?
1624 */ 1523 */
1625 tmp = is_player_inv (op->env); 1524 tmp = op->in_player ();
1626 /* nope. Is this a container the player has opened? 1525 /* nope. Is this a container the player has opened?
1627 * If so, set tmp to that player. 1526 * If so, set tmp to that player.
1628 * IMO, searching through all the players will mostly 1527 * IMO, searching through all the players will mostly
1629 * likely be quicker than following op->env to the map, 1528 * likely be quicker than following op->env to the map,
1630 * and then searching the map for a player. 1529 * and then searching the map for a player.
1631 */ 1530 */
1632 if (!tmp) 1531 if (!tmp)
1633 { 1532 for_all_players (pl)
1634 for (pl = first_player; pl; pl = pl->next)
1635 if (pl->ob->container == op->env) 1533 if (pl->ob->container == op->env)
1534 {
1535 tmp = pl->ob;
1636 break; 1536 break;
1637 if (pl)
1638 tmp = pl->ob;
1639 else
1640 tmp = NULL;
1641 } 1537 }
1642 1538
1643 if (i < op->nrof) 1539 if (i < op->nrof)
1644 { 1540 {
1645 sub_weight (op->env, op->weight * i); 1541 sub_weight (op->env, op->weight * i);
1646 op->nrof -= i; 1542 op->nrof -= i;
1647 if (tmp) 1543 if (tmp)
1648 {
1649 esrv_send_item (tmp, op); 1544 esrv_send_item (tmp, op);
1650 }
1651 } 1545 }
1652 else 1546 else
1653 { 1547 {
1654 op->remove (); 1548 op->remove ();
1655 op->nrof = 0; 1549 op->nrof = 0;
1656 if (tmp) 1550 if (tmp)
1657 {
1658 esrv_del_item (tmp->contr, op->count); 1551 esrv_del_item (tmp->contr, op->count);
1659 }
1660 } 1552 }
1661 } 1553 }
1662 else 1554 else
1663 { 1555 {
1664 object *above = op->above; 1556 object *above = op->above;
… …
1670 op->remove (); 1562 op->remove ();
1671 op->nrof = 0; 1563 op->nrof = 0;
1672 } 1564 }
1673 1565
1674 /* Since we just removed op, op->above is null */ 1566 /* Since we just removed op, op->above is null */
1675 for (tmp = above; tmp != NULL; tmp = tmp->above) 1567 for (tmp = above; tmp; tmp = tmp->above)
1676 if (tmp->type == PLAYER) 1568 if (tmp->type == PLAYER)
1677 { 1569 {
1678 if (op->nrof) 1570 if (op->nrof)
1679 esrv_send_item (tmp, op); 1571 esrv_send_item (tmp, op);
1680 else 1572 else
… …
1685 if (op->nrof) 1577 if (op->nrof)
1686 return op; 1578 return op;
1687 else 1579 else
1688 { 1580 {
1689 op->destroy (); 1581 op->destroy ();
1690 return NULL; 1582 return 0;
1691 } 1583 }
1692} 1584}
1693 1585
1694/* 1586/*
1695 * add_weight(object, weight) adds the specified weight to an object, 1587 * add_weight(object, weight) adds the specified weight to an object,
… …
1783 add_weight (this, op->weight * op->nrof); 1675 add_weight (this, op->weight * op->nrof);
1784 } 1676 }
1785 else 1677 else
1786 add_weight (this, (op->weight + op->carrying)); 1678 add_weight (this, (op->weight + op->carrying));
1787 1679
1788 otmp = is_player_inv (this); 1680 otmp = this->in_player ();
1789 if (otmp && otmp->contr) 1681 if (otmp && otmp->contr)
1790 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1682 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1791 fix_player (otmp); 1683 otmp->update_stats ();
1792 1684
1793 op->map = NULL; 1685 op->map = 0;
1794 op->env = this; 1686 op->env = this;
1795 op->above = NULL; 1687 op->above = 0;
1796 op->below = NULL; 1688 op->below = 0;
1797 op->x = 0, op->y = 0; 1689 op->x = 0, op->y = 0;
1798 1690
1799 /* reset the light list and los of the players on the map */ 1691 /* reset the light list and los of the players on the map */
1800 if ((op->glow_radius != 0) && map) 1692 if ((op->glow_radius != 0) && map)
1801 { 1693 {
… …
2138 * if the space being examined only has a wall to the north and empty 2030 * if the space being examined only has a wall to the north and empty
2139 * spaces in all the other directions, this will reduce the search space 2031 * spaces in all the other directions, this will reduce the search space
2140 * to only the spaces immediately surrounding the target area, and 2032 * to only the spaces immediately surrounding the target area, and
2141 * won't look 2 spaces south of the target space. 2033 * won't look 2 spaces south of the target space.
2142 */ 2034 */
2143 else if ((flag & AB_NO_PASS) && maxfree[i] < stop) 2035 else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2144 stop = maxfree[i]; 2036 stop = maxfree[i];
2145 } 2037 }
2038
2146 if (!index) 2039 if (!index)
2147 return -1; 2040 return -1;
2041
2148 return altern[RANDOM () % index]; 2042 return altern[RANDOM () % index];
2149} 2043}
2150 2044
2151/* 2045/*
2152 * find_first_free_spot(archetype, maptile, x, y) works like 2046 * find_first_free_spot(archetype, maptile, x, y) works like
… …
2260 mp = m; 2154 mp = m;
2261 nx = x + freearr_x[i]; 2155 nx = x + freearr_x[i];
2262 ny = y + freearr_y[i]; 2156 ny = y + freearr_y[i];
2263 2157
2264 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2158 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
2159
2265 if (mflags & P_OUT_OF_MAP) 2160 if (mflags & P_OUT_OF_MAP)
2266 {
2267 max = maxfree[i]; 2161 max = maxfree[i];
2268 }
2269 else 2162 else
2270 { 2163 {
2271 blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); 2164 blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);
2272 2165
2273 if ((move_type & blocked) == move_type) 2166 if ((move_type & blocked) == move_type)
2274 {
2275 max = maxfree[i]; 2167 max = maxfree[i];
2276 }
2277 else if (mflags & P_IS_ALIVE) 2168 else if (mflags & P_IS_ALIVE)
2278 { 2169 {
2279 for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above) 2170 for (tmp = GET_MAP_OB (mp, nx, ny); tmp; tmp = tmp->above)
2280 {
2281 if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2171 if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))
2282 {
2283 break; 2172 break;
2284 } 2173
2285 }
2286 if (tmp) 2174 if (tmp)
2287 {
2288 return freedir[i]; 2175 return freedir[i];
2289 }
2290 } 2176 }
2291 } 2177 }
2292 } 2178 }
2179
2293 return 0; 2180 return 0;
2294} 2181}
2295 2182
2296/* 2183/*
2297 * distance(object 1, object 2) will return the square of the 2184 * distance(object 1, object 2) will return the square of the
… …
2299 */ 2186 */
2300 2187
2301int 2188int
2302distance (const object *ob1, const object *ob2) 2189distance (const object *ob1, const object *ob2)
2303{ 2190{
2304 int 2191 int i;
2305 i;
2306 2192
2307 i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); 2193 i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2308 return i; 2194 return i;
2309} 2195}
2310 2196
… …
2315 */ 2201 */
2316 2202
2317int 2203int
2318find_dir_2 (int x, int y) 2204find_dir_2 (int x, int y)
2319{ 2205{
2320 int 2206 int q;
2321 q;
2322 2207
2323 if (y) 2208 if (y)
2324 q = x * 100 / y; 2209 q = x * 100 / y;
2325 else if (x) 2210 else if (x)
2326 q = -300 * x; 2211 q = -300 * x;
… …
2452 * find a path to that monster that we found. If not, 2337 * find a path to that monster that we found. If not,
2453 * we don't bother going toward it. Returns 1 if we 2338 * we don't bother going toward it. Returns 1 if we
2454 * can see a direct way to get it 2339 * can see a direct way to get it
2455 * Modified to be map tile aware -.MSW 2340 * Modified to be map tile aware -.MSW
2456 */ 2341 */
2457
2458
2459int 2342int
2460can_see_monsterP (maptile *m, int x, int y, int dir) 2343can_see_monsterP (maptile *m, int x, int y, int dir)
2461{ 2344{
2462 sint16 dx, dy; 2345 sint16 dx, dy;
2463 int
2464 mflags; 2346 int mflags;
2465 2347
2466 if (dir < 0) 2348 if (dir < 0)
2467 return 0; /* exit condition: invalid direction */ 2349 return 0; /* exit condition: invalid direction */
2468 2350
2469 dx = x + freearr_x[dir]; 2351 dx = x + freearr_x[dir];
… …
2482 return 0; 2364 return 0;
2483 2365
2484 /* yes, can see. */ 2366 /* yes, can see. */
2485 if (dir < 9) 2367 if (dir < 9)
2486 return 1; 2368 return 1;
2369
2487 return can_see_monsterP (m, x, y, reduction_dir[dir][0]) | 2370 return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2488 can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]); 2371 | can_see_monsterP (m, x, y, reduction_dir[dir][1])
2372 | can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2489} 2373}
2490
2491
2492 2374
2493/* 2375/*
2494 * can_pick(picker, item): finds out if an object is possible to be 2376 * can_pick(picker, item): finds out if an object is possible to be
2495 * picked up by the picker. Returnes 1 if it can be 2377 * picked up by the picker. Returnes 1 if it can be
2496 * picked up, otherwise 0. 2378 * picked up, otherwise 0.
… …
2507 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2389 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2508 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2390 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2509 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); 2391 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2510} 2392}
2511 2393
2512
2513/* 2394/*
2514 * create clone from object to another 2395 * create clone from object to another
2515 */ 2396 */
2516object * 2397object *
2517object_create_clone (object *asrc) 2398object_create_clone (object *asrc)
… …
2536 { 2417 {
2537 dst = tmp; 2418 dst = tmp;
2538 tmp->head = 0; 2419 tmp->head = 0;
2539 } 2420 }
2540 else 2421 else
2541 {
2542 tmp->head = dst; 2422 tmp->head = dst;
2543 }
2544 2423
2545 tmp->more = 0; 2424 tmp->more = 0;
2546 2425
2547 if (prev) 2426 if (prev)
2548 prev->more = tmp; 2427 prev->more = tmp;

Diff Legend

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