ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/map.C
(Generate patch)

Comparing deliantra/server/common/map.C (file contents):
Revision 1.138 by root, Sun May 4 14:12:37 2008 UTC vs.
Revision 1.157 by root, Thu Jan 8 19:23:44 2009 UTC

22 */ 22 */
23 23
24#include <unistd.h> 24#include <unistd.h>
25 25
26#include "global.h" 26#include "global.h"
27
28#include "loader.h" 27#include "loader.h"
29
30#include "path.h" 28#include "path.h"
29
30sint8 maptile::outdoor_darkness;
31 31
32/* This rolls up wall, blocks_magic, blocks_view, etc, all into 32/* This rolls up wall, blocks_magic, blocks_view, etc, all into
33 * one function that just returns a P_.. value (see map.h) 33 * one function that just returns a P_.. value (see map.h)
34 * it will also do map translation for tiled maps, returning 34 * it will also do map translation for tiled maps, returning
35 * new values into newmap, nx, and ny. Any and all of those 35 * new values into newmap, nx, and ny. Any and all of those
260 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 260 for (mapspace *ms = spaces + size (); ms-- > spaces; )
261 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 261 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
262 tmp->flag [flag] = value; 262 tmp->flag [flag] = value;
263} 263}
264 264
265void
266maptile::post_load_original ()
267{
268 if (!spaces)
269 return;
270
271 set_object_flag (FLAG_OBJ_ORIGINAL);
272
273 for (mapspace *ms = spaces + size (); ms-- > spaces; )
274 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
275 INVOKE_OBJECT (RESET, tmp);
276}
277
265/* link_multipart_objects go through all the objects on the map looking 278/* link_multipart_objects go through all the objects on the map looking
266 * for objects whose arch says they are multipart yet according to the 279 * for objects whose arch says they are multipart yet according to the
267 * info we have, they only have the head (as would be expected when 280 * info we have, they only have the head (as would be expected when
268 * they are saved). 281 * they are saved).
269 */ 282 */
641 case KW_sky: thawer.get (sky); break; 654 case KW_sky: thawer.get (sky); break;
642 655
643 case KW_per_player: thawer.get (per_player); break; 656 case KW_per_player: thawer.get (per_player); break;
644 case KW_per_party: thawer.get (per_party); break; 657 case KW_per_party: thawer.get (per_party); break;
645 case KW_no_reset: thawer.get (no_reset); break; 658 case KW_no_reset: thawer.get (no_reset); break;
659 case KW_no_drop: thawer.get (no_drop); break;
646 660
647 case KW_region: default_region = region::find (thawer.get_str ()); break; 661 case KW_region: default_region = region::find (thawer.get_str ()); break;
648 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 662 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
649 663
650 // old names new names 664 // old names new names
700 714
701 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 715 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
702 unique = 1; 716 unique = 1;
703 717
704 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 718 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
705 {
706 op->destroy_inv (false);
707 op->destroy (); 719 op->destroy ();
708 }
709 720
710 op = above; 721 op = above;
711 } 722 }
712 } 723 }
713} 724}
724 MAP_OUT (swap_time); 735 MAP_OUT (swap_time);
725 MAP_OUT (reset_time); 736 MAP_OUT (reset_time);
726 MAP_OUT (reset_timeout); 737 MAP_OUT (reset_timeout);
727 MAP_OUT (fixed_resettime); 738 MAP_OUT (fixed_resettime);
728 MAP_OUT (no_reset); 739 MAP_OUT (no_reset);
740 MAP_OUT (no_drop);
729 MAP_OUT (difficulty); 741 MAP_OUT (difficulty);
730 742
731 if (default_region) MAP_OUT2 (region, default_region->name); 743 if (default_region) MAP_OUT2 (region, default_region->name);
732 744
733 if (shopitems) 745 if (shopitems)
800 812
801 op->flag [FLAG_REMOVED] = true; 813 op->flag [FLAG_REMOVED] = true;
802 814
803 object *head = op->head_ (); 815 object *head = op->head_ ();
804 if (op == head) 816 if (op == head)
805 {
806 op->destroy_inv (false);
807 op->destroy (); 817 op->destroy ();
808 }
809 else if (head->map != op->map) 818 else if (head->map != op->map)
810 { 819 {
811 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); 820 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
812 head->destroy (); 821 head->destroy ();
813 } 822 }
928 op->destroy (); 937 op->destroy ();
929 } 938 }
930} 939}
931 940
932/* 941/*
933 * Updates every button on the map (by calling update_button() for them).
934 */
935void
936maptile::update_buttons ()
937{
938 for (oblinkpt *obp = buttons; obp; obp = obp->next)
939 for (objectlink *ol = obp->link; ol; ol = ol->next)
940 {
941 if (!ol->ob)
942 {
943 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
944 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
945 continue;
946 }
947
948 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
949 {
950 update_button (ol->ob);
951 break;
952 }
953 }
954}
955
956/*
957 * This routine is supposed to find out the difficulty of the map. 942 * This routine is supposed to find out the difficulty of the map.
958 * difficulty does not have a lot to do with character level, 943 * difficulty does not have a lot to do with character level,
959 * but does have a lot to do with treasure on the map. 944 * but does have a lot to do with treasure on the map.
960 * 945 *
961 * Difficulty can now be set by the map creature. If the value stored 946 * Difficulty can now be set by the map creator. If the value stored
962 * in the map is zero, then use this routine. Maps should really 947 * in the map is zero, then use this routine. Maps should really
963 * have a difficulty set than using this function - human calculation 948 * have a difficulty set rather than using this function - human calculation
964 * is much better than this functions guesswork. 949 * is much better than this function's guesswork.
965 */ 950 */
966int 951int
967maptile::estimate_difficulty () const 952maptile::estimate_difficulty () const
968{ 953{
969 long monster_cnt = 0; 954 long monster_cnt = 0;
981 966
982 if (QUERY_FLAG (op, FLAG_GENERATOR)) 967 if (QUERY_FLAG (op, FLAG_GENERATOR))
983 { 968 {
984 total_exp += op->stats.exp; 969 total_exp += op->stats.exp;
985 970
986 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 971 if (archetype *at = op->other_arch)
972 {
987 total_exp += at->stats.exp * 8; 973 total_exp += at->stats.exp * 8;
988
989 monster_cnt++; 974 monster_cnt++;
975 }
976
977 for (object *inv = op->inv; inv; inv = inv->below)
978 {
979 total_exp += op->stats.exp * 8;
980 monster_cnt++;
981 }
990 } 982 }
991 } 983 }
992 984
993 avgexp = (double) total_exp / monster_cnt; 985 avgexp = (double) total_exp / monster_cnt;
994 986
1007 * postive values make it darker, negative make it brighter 999 * postive values make it darker, negative make it brighter
1008 */ 1000 */
1009int 1001int
1010maptile::change_map_light (int change) 1002maptile::change_map_light (int change)
1011{ 1003{
1012 int new_level = darkness + change;
1013
1014 /* Nothing to do */ 1004 /* Nothing to do */
1015 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1005 if (!change)
1016 return 0; 1006 return 0;
1017 1007
1018 /* inform all players on the map */ 1008 /* inform all players on the map */
1019 if (change > 0) 1009 if (change > 0)
1020 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1010 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1021 else 1011 else
1022 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1012 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1023 1013
1024 /* Do extra checking. since darkness is a unsigned value, 1014 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1025 * we need to be extra careful about negative values.
1026 * In general, the checks below are only needed if change
1027 * is not +/-1
1028 */
1029 if (new_level < 0)
1030 darkness = 0;
1031 else if (new_level >= MAX_DARKNESS)
1032 darkness = MAX_DARKNESS;
1033 else
1034 darkness = new_level;
1035 1015
1036 /* All clients need to get re-updated for the change */ 1016 /* All clients need to get re-updated for the change */
1037 update_all_map_los (this); 1017 update_all_map_los (this);
1018
1038 return 1; 1019 return 1;
1039} 1020}
1040 1021
1041/* 1022/*
1042 * This function updates various attributes about a specific space 1023 * This function updates various attributes about a specific space
1045 * through, etc) 1026 * through, etc)
1046 */ 1027 */
1047void 1028void
1048mapspace::update_ () 1029mapspace::update_ ()
1049{ 1030{
1050 object *tmp, *last = 0; 1031 object *last = 0;
1051 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1032 uint8 flags = P_UPTODATE, anywhere = 0;
1033 sint8 light = 0;
1052 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1034 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1053 1035
1054 //object *middle = 0; 1036 //object *middle = 0;
1055 //object *top = 0; 1037 //object *top = 0;
1056 //object *floor = 0; 1038 //object *floor = 0;
1057 // this seems to generate better code than using locals, above 1039 // this seems to generate better code than using locals, above
1058 object *&top = faces_obj[0] = 0; 1040 object *&top = faces_obj[0] = 0;
1059 object *&middle = faces_obj[1] = 0; 1041 object *&middle = faces_obj[1] = 0;
1060 object *&floor = faces_obj[2] = 0; 1042 object *&floor = faces_obj[2] = 0;
1061 1043
1062 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1044 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1063 { 1045 {
1064 /* This could be made additive I guess (two lights better than 1046 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1065 * one). But if so, it shouldn't be a simple additive - 2
1066 * light bulbs do not illuminate twice as far as once since
1067 * it is a dissapation factor that is cubed.
1068 */
1069 if (tmp->glow_radius > light)
1070 light = tmp->glow_radius; 1047 light += tmp->glow_radius;
1071 1048
1072 /* This call is needed in order to update objects the player 1049 /* This call is needed in order to update objects the player
1073 * is standing in that have animations (ie, grass, fire, etc). 1050 * is standing in that have animations (ie, grass, fire, etc).
1074 * However, it also causes the look window to be re-drawn 1051 * However, it also causes the look window to be re-drawn
1075 * 3 times each time the player moves, because many of the 1052 * 3 times each time the player moves, because many of the
1094 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1071 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1095 { 1072 {
1096 middle = tmp; 1073 middle = tmp;
1097 anywhere = 1; 1074 anywhere = 1;
1098 } 1075 }
1076
1099 /* Find the highest visible face around. If equal 1077 /* Find the highest visible face around. If equal
1100 * visibilities, we still want the one nearer to the 1078 * visibilities, we still want the one nearer to the
1101 * top 1079 * top
1102 */ 1080 */
1103 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) 1081 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1122 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1100 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1123 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1101 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1124 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1102 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1125 } 1103 }
1126 1104
1127 this->light = light; 1105 this->light = min (light, MAX_LIGHT_RADIUS);
1128 this->flags_ = flags; 1106 this->flags_ = flags;
1129 this->move_block = move_block & ~move_allow; 1107 this->move_block = move_block & ~move_allow;
1130 this->move_on = move_on; 1108 this->move_on = move_on;
1131 this->move_off = move_off; 1109 this->move_off = move_off;
1132 this->move_slow = move_slow; 1110 this->move_slow = move_slow;
1152 * 1) top face is set, need middle to be set. 1130 * 1) top face is set, need middle to be set.
1153 * 2) middle is set, need to set top. 1131 * 2) middle is set, need to set top.
1154 * 3) neither middle or top is set - need to set both. 1132 * 3) neither middle or top is set - need to set both.
1155 */ 1133 */
1156 1134
1157 for (tmp = last; tmp; tmp = tmp->below) 1135 for (object *tmp = last; tmp; tmp = tmp->below)
1158 { 1136 {
1159 /* Once we get to a floor, stop, since we already have a floor object */ 1137 /* Once we get to a floor, stop, since we already have a floor object */
1160 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1138 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1161 break; 1139 break;
1162 1140
1214 vol += op->volume (); 1192 vol += op->volume ();
1215 1193
1216 return vol; 1194 return vol;
1217} 1195}
1218 1196
1219bool 1197maptile *
1220maptile::tile_available (int dir, bool load) 1198maptile::tile_available (int dir, bool load)
1221{ 1199{
1222 if (!tile_path[dir]) 1200 if (tile_path[dir])
1223 return 0; 1201 {
1224
1225 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) 1202 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1226 return 1; 1203 return tile_map[dir];
1227 1204
1228 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1205 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1229 return 1; 1206 return tile_map[dir];
1207 }
1230 1208
1231 return 0; 1209 return 0;
1232} 1210}
1233 1211
1234/* this returns TRUE if the coordinates (x,y) are out of 1212/* this returns TRUE if the coordinates (x,y) are out of
1565} 1543}
1566 1544
1567object * 1545object *
1568maptile::insert (object *op, int x, int y, object *originator, int flags) 1546maptile::insert (object *op, int x, int y, object *originator, int flags)
1569{ 1547{
1570 if (!op->flag [FLAG_REMOVED])
1571 op->remove ();
1572
1573 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1548 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1574} 1549}
1575 1550
1576region * 1551region *
1577maptile::region (int x, int y) const 1552maptile::region (int x, int y) const
1616maptile::play_sound (faceidx sound, int x, int y) const 1591maptile::play_sound (faceidx sound, int x, int y) const
1617{ 1592{
1618 if (!sound) 1593 if (!sound)
1619 return; 1594 return;
1620 1595
1596 for_all_players_on_map (pl, this)
1597 if (client *ns = pl->ns)
1598 {
1599 int dx = x - pl->ob->x;
1600 int dy = y - pl->ob->y;
1601
1602 int distance = idistance (dx, dy);
1603
1604 if (distance <= MAX_SOUND_DISTANCE)
1605 ns->play_sound (sound, dx, dy);
1606 }
1607}
1608
1609void
1610maptile::say_msg (const char *msg, int x, int y) const
1611{
1621 for_all_players (pl) 1612 for_all_players (pl)
1622 if (pl->ob->map == this)
1623 if (client *ns = pl->ns) 1613 if (client *ns = pl->ns)
1624 { 1614 {
1625 int dx = x - pl->ob->x; 1615 int dx = x - pl->ob->x;
1626 int dy = y - pl->ob->y; 1616 int dy = y - pl->ob->y;
1627 1617
1628 int distance = idistance (dx, dy); 1618 int distance = idistance (dx, dy);
1629 1619
1630 if (distance <= MAX_SOUND_DISTANCE) 1620 if (distance <= MAX_SOUND_DISTANCE)
1631 ns->play_sound (sound, dx, dy); 1621 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1632 } 1622 }
1633} 1623}
1634 1624
1625static void
1626split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1627{
1628 // clip to map to the left
1629 if (x0 < 0)
1630 {
1631 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1632 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1633
1634 if (x1 < 0) // entirely to the left
1635 return;
1636
1637 x0 = 0;
1638 }
1639
1640 // clip to map to the right
1641 if (x1 > m->width)
1642 {
1643 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1644 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1645
1646 if (x0 > m->width) // entirely to the right
1647 return;
1648
1649 x1 = m->width;
1650 }
1651
1652 // clip to map above
1653 if (y0 < 0)
1654 {
1655 if (maptile *tile = m->tile_available (TILE_UP, 1))
1656 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1657
1658 if (y1 < 0) // entirely above
1659 return;
1660
1661 y0 = 0;
1662 }
1663
1664 // clip to map below
1665 if (y1 > m->height)
1666 {
1667 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1668 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1669
1670 if (y0 > m->height) // entirely below
1671 return;
1672
1673 y1 = m->height;
1674 }
1675
1676 // if we get here, the rect is within the current map
1677 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1678
1679 r->m = m;
1680 r->x0 = x0;
1681 r->y0 = y0;
1682 r->x1 = x1;
1683 r->y1 = y1;
1684 r->dx = dx;
1685 r->dy = dy;
1686}
1687
1688maprect *
1689maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1690{
1691 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1692 buf.clear ();
1693
1694 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1695
1696 // add end marker
1697 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1698 r->m = 0;
1699
1700 return (maprect *)buf.linearise ();
1701}
1702

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines