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.152 by root, Tue Dec 23 01:51:27 2008 UTC vs.
Revision 1.165 by root, Tue Oct 20 05:57:08 2009 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24#include <unistd.h> 25#include <unistd.h>
… …
70 * by the caller. 71 * by the caller.
71 */ 72 */
72int 73int
73blocked_link (object *ob, maptile *m, int sx, int sy) 74blocked_link (object *ob, maptile *m, int sx, int sy)
74{ 75{
75 object *tmp;
76 int mflags, blocked;
77
78 /* Make sure the coordinates are valid - they should be, as caller should 76 /* Make sure the coordinates are valid - they should be, as caller should
79 * have already checked this. 77 * have already checked this.
80 */ 78 */
81 if (OUT_OF_REAL_MAP (m, sx, sy)) 79 if (OUT_OF_REAL_MAP (m, sx, sy))
82 { 80 {
… …
85 } 83 }
86 84
87 /* Save some cycles - instead of calling get_map_flags(), just get the value 85 /* Save some cycles - instead of calling get_map_flags(), just get the value
88 * directly. 86 * directly.
89 */ 87 */
90 mflags = m->at (sx, sy).flags (); 88 mapspace &ms = m->at (sx, sy);
91 89
92 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 90 int mflags = ms.flags ();
91 int blocked = ms.move_block;
93 92
94 /* If space is currently not blocked by anything, no need to 93 /* If space is currently not blocked by anything, no need to
95 * go further. Not true for players - all sorts of special 94 * go further. Not true for players - all sorts of special
96 * things we need to do for players. 95 * things we need to do for players.
97 */ 96 */
98 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 97 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
99 return 0; 98 return 0;
100 99
101 /* if there isn't anytyhing alive on this space, and this space isn't 100 /* if there isn't anything alive on this space, and this space isn't
102 * otherwise blocked, we can return now. Only if there is a living 101 * otherwise blocked, we can return now. Only if there is a living
103 * creature do we need to investigate if it is part of this creature 102 * creature do we need to investigate if it is part of this creature
104 * or another. Likewise, only if something is blocking us do we 103 * or another. Likewise, only if something is blocking us do we
105 * need to investigate if there is a special circumstance that would 104 * need to investigate if there is a special circumstance that would
106 * let the player through (inventory checkers for example) 105 * let the player through (inventory checkers for example)
… …
113 /* We basically go through the stack of objects, and if there is 112 /* We basically go through the stack of objects, and if there is
114 * some other object that has NO_PASS or FLAG_ALIVE set, return 113 * some other object that has NO_PASS or FLAG_ALIVE set, return
115 * true. If we get through the entire stack, that must mean 114 * true. If we get through the entire stack, that must mean
116 * ob is blocking it, so return 0. 115 * ob is blocking it, so return 0.
117 */ 116 */
118 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) 117 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
119 { 118 {
120 119 if (OB_MOVE_BLOCK (ob, tmp))
121 /* This must be before the checks below. Code for inventory checkers. */
122 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
123 { 120 {
124 /* If last_sp is set, the player/monster needs an object, 121 if (tmp->type == CHECK_INV)
125 * so we check for it. If they don't have it, they can't
126 * pass through this space.
127 */
128 if (tmp->last_sp)
129 { 122 {
130 if (check_inv_recursive (ob, tmp) == NULL) 123 bool have = check_inv_recursive (ob, tmp);
124
125 // last_sp set means we block if we don't have.
126 if (logical_xor (have, tmp->last_sp))
131 return 1; 127 return 1;
132 else 128 }
133 continue; 129 else if (tmp->type == T_MATCH)
130 {
131 // T_MATCH allows "entrance" iff the match is true
132 // == blocks if the match fails
133
134 // we could have used an INVOKE_OBJECT, but decided against it, as we
135 // assume that T_MATCH is very common.
136 if (!match (tmp->slaying, ob, tmp, ob))
137 return 1;
134 } 138 }
135 else 139 else
136 { 140 return 1; // unconditional block
137 /* In this case, the player must not have the object - 141
138 * if they do, they can't pass through.
139 */
140 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
141 return 1;
142 else
143 continue;
144 }
145 } /* if check_inv */
146 else 142 } else {
147 { 143 // space does not block the ob, directly, but
148 /* Broke apart a big nasty if into several here to make 144 // anything alive that is not a door still
149 * this more readable. first check - if the space blocks 145 // blocks anything but wizards.
150 * movement, can't move here.
151 * second - if a monster, can't move there, unless it is a
152 * hidden dm
153 */
154 if (OB_MOVE_BLOCK (ob, tmp))
155 return 1;
156 146
157 if (tmp->flag [FLAG_ALIVE] 147 if (tmp->flag [FLAG_ALIVE]
158 && tmp->head_ () != ob 148 && tmp->head_ () != ob
159 && tmp != ob 149 && tmp != ob
160 && tmp->type != DOOR 150 && tmp->type != DOOR
161 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) 151 && !tmp->flag [FLAG_WIZPASS])
162 return 1; 152 return 1;
163 } 153 }
164
165 } 154 }
155
166 return 0; 156 return 0;
167} 157}
168 158
169/* 159/*
170 * Returns qthe blocking object if the given object can't fit in the given 160 * Returns qthe blocking object if the given object can't fit in the given
… …
334 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) 324 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
335 { 325 {
336 // we insert manually because 326 // we insert manually because
337 // a) its way faster 327 // a) its way faster
338 // b) we remove manually, too, and there are good reasons for that 328 // b) we remove manually, too, and there are good reasons for that
339 // c) its correct 329 // c) it's correct
340 mapspace &ms = at (op->x, op->y); 330 mapspace &ms = at (op->x, op->y);
341 331
342 op->flag [FLAG_REMOVED] = false; 332 op->flag [FLAG_REMOVED] = false;
343 333
344 op->above = 0; 334 op->above = 0;
345 op->below = ms.top; 335 op->below = ms.top;
346 336
347 if (ms.top)
348 ms.top->above = op; 337 *(ms.top ? &ms.top->above : &ms.bot) = op;
349 else
350 ms.bot = op;
351 338
352 ms.top = op; 339 ms.top = op;
353 ms.flags_ = 0; 340 ms.flags_ = 0;
354 } 341 }
355 else 342 else
… …
567 return items; 554 return items;
568} 555}
569 556
570/* opposite of parse string, this puts the string that was originally fed in to 557/* opposite of parse string, this puts the string that was originally fed in to
571 * the map (or something equivilent) into output_string. */ 558 * the map (or something equivilent) into output_string. */
572static void 559static const char *
573print_shop_string (maptile *m, char *output_string) 560print_shop_string (maptile *m)
574{ 561{
575 int i; 562 static dynbuf_text buf; buf.clear ();
576 char tmp[MAX_BUF];
577 563
578 strcpy (output_string, "");
579 for (i = 0; i < m->shopitems[0].index; i++) 564 for (int i = 0; i < m->shopitems[0].index; i++)
580 { 565 {
581 if (m->shopitems[i].typenum) 566 if (m->shopitems[i].typenum)
582 { 567 {
583 if (m->shopitems[i].strength) 568 if (m->shopitems[i].strength)
584 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 569 buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
585 else 570 else
586 sprintf (tmp, "%s;", m->shopitems[i].name); 571 buf.printf ("%s;", m->shopitems[i].name);
587 } 572 }
588 else 573 else
589 { 574 {
590 if (m->shopitems[i].strength) 575 if (m->shopitems[i].strength)
591 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 576 buf.printf ("*:%d;", m->shopitems[i].strength);
592 else 577 else
593 sprintf (tmp, "*"); 578 buf.printf ("*");
594 } 579 }
595
596 strcat (output_string, tmp);
597 } 580 }
581
582 return buf;
598} 583}
599 584
600/* This loads the header information of the map. The header 585/* This loads the header information of the map. The header
601 * contains things like difficulty, size, timeout, etc. 586 * contains things like difficulty, size, timeout, etc.
602 * this used to be stored in the map object, but with the 587 * this used to be stored in the map object, but with the
… …
737 MAP_OUT (reset_timeout); 722 MAP_OUT (reset_timeout);
738 MAP_OUT (fixed_resettime); 723 MAP_OUT (fixed_resettime);
739 MAP_OUT (no_reset); 724 MAP_OUT (no_reset);
740 MAP_OUT (no_drop); 725 MAP_OUT (no_drop);
741 MAP_OUT (difficulty); 726 MAP_OUT (difficulty);
742
743 if (default_region) MAP_OUT2 (region, default_region->name); 727 if (default_region) MAP_OUT2 (region, default_region->name);
744 728
745 if (shopitems) 729 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
746 {
747 char shop[MAX_BUF];
748 print_shop_string (this, shop);
749 MAP_OUT2 (shopitems, shop);
750 }
751
752 MAP_OUT (shopgreed); 730 MAP_OUT (shopgreed);
753 MAP_OUT (shopmin); 731 MAP_OUT (shopmin);
754 MAP_OUT (shopmax); 732 MAP_OUT (shopmax);
755 if (shoprace) MAP_OUT (shoprace); 733 if (shoprace) MAP_OUT (shoprace);
734
756 MAP_OUT (darkness); 735 MAP_OUT (darkness);
757 MAP_OUT (width); 736 MAP_OUT (width);
758 MAP_OUT (height); 737 MAP_OUT (height);
759 MAP_OUT (enter_x); 738 MAP_OUT (enter_x);
760 MAP_OUT (enter_y); 739 MAP_OUT (enter_y);
… …
937 op->destroy (); 916 op->destroy ();
938 } 917 }
939} 918}
940 919
941/* 920/*
942 * Updates every button on the map (by calling update_button() for them).
943 */
944void
945maptile::update_buttons ()
946{
947 for (oblinkpt *obp = buttons; obp; obp = obp->next)
948 for (objectlink *ol = obp->link; ol; ol = ol->next)
949 {
950 if (!ol->ob)
951 {
952 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
953 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
954 continue;
955 }
956
957 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
958 {
959 update_button (ol->ob);
960 break;
961 }
962 }
963}
964
965/*
966 * This routine is supposed to find out the difficulty of the map. 921 * This routine is supposed to find out the difficulty of the map.
967 * difficulty does not have a lot to do with character level, 922 * difficulty does not have a lot to do with character level,
968 * but does have a lot to do with treasure on the map. 923 * but does have a lot to do with treasure on the map.
969 * 924 *
970 * Difficulty can now be set by the map creature. If the value stored 925 * Difficulty can now be set by the map creator. If the value stored
971 * in the map is zero, then use this routine. Maps should really 926 * in the map is zero, then use this routine. Maps should really
972 * have a difficulty set than using this function - human calculation 927 * have a difficulty set rather than using this function - human calculation
973 * is much better than this functions guesswork. 928 * is much better than this function's guesswork.
974 */ 929 */
975int 930int
976maptile::estimate_difficulty () const 931maptile::estimate_difficulty () const
977{ 932{
978 long monster_cnt = 0; 933 long monster_cnt = 0;
… …
1023 * postive values make it darker, negative make it brighter 978 * postive values make it darker, negative make it brighter
1024 */ 979 */
1025int 980int
1026maptile::change_map_light (int change) 981maptile::change_map_light (int change)
1027{ 982{
1028 int new_level = darkness + change;
1029
1030 /* Nothing to do */ 983 /* Nothing to do */
1031 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 984 if (!change)
1032 return 0; 985 return 0;
1033 986
1034 /* inform all players on the map */ 987 /* inform all players on the map */
1035 if (change > 0) 988 if (change > 0)
1036 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 989 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1037 else 990 else
1038 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 991 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1039 992
1040 /* Do extra checking. since darkness is a unsigned value, 993 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1041 * we need to be extra careful about negative values.
1042 * In general, the checks below are only needed if change
1043 * is not +/-1
1044 */
1045 if (new_level < 0)
1046 darkness = 0;
1047 else if (new_level >= MAX_DARKNESS)
1048 darkness = MAX_DARKNESS;
1049 else
1050 darkness = new_level;
1051 994
1052 /* All clients need to get re-updated for the change */ 995 /* All clients need to get re-updated for the change */
1053 update_all_map_los (this); 996 update_all_map_los (this);
1054 997
1055 return 1; 998 return 1;
… …
1228 vol += op->volume (); 1171 vol += op->volume ();
1229 1172
1230 return vol; 1173 return vol;
1231} 1174}
1232 1175
1233bool 1176maptile *
1234maptile::tile_available (int dir, bool load) 1177maptile::tile_available (int dir, bool load)
1235{ 1178{
1236 if (!tile_path[dir]) 1179 if (tile_path[dir])
1237 return 0; 1180 {
1238
1239 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) 1181 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1240 return 1; 1182 return tile_map[dir];
1241 1183
1242 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1184 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1243 return 1; 1185 return tile_map[dir];
1186 }
1244 1187
1245 return 0; 1188 return 0;
1246} 1189}
1247 1190
1248/* this returns TRUE if the coordinates (x,y) are out of 1191/* this returns TRUE if the coordinates (x,y) are out of
… …
1554 else 1497 else
1555 { 1498 {
1556 retval->distance_x += op2->x - x; 1499 retval->distance_x += op2->x - x;
1557 retval->distance_y += op2->y - y; 1500 retval->distance_y += op2->y - y;
1558 1501
1559 retval->part = NULL; 1502 retval->part = 0;
1560 retval->distance = idistance (retval->distance_x, retval->distance_y); 1503 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1561 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1504 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1562 } 1505 }
1563} 1506}
1564 1507
1565/* Returns true of op1 and op2 are effectively on the same map 1508/* Returns true of op1 and op2 are effectively on the same map
… …
1640 if (distance <= MAX_SOUND_DISTANCE) 1583 if (distance <= MAX_SOUND_DISTANCE)
1641 ns->play_sound (sound, dx, dy); 1584 ns->play_sound (sound, dx, dy);
1642 } 1585 }
1643} 1586}
1644 1587
1588void
1589maptile::say_msg (const char *msg, int x, int y) const
1590{
1591 for_all_players (pl)
1592 if (client *ns = pl->ns)
1593 {
1594 int dx = x - pl->ob->x;
1595 int dy = y - pl->ob->y;
1596
1597 int distance = idistance (dx, dy);
1598
1599 if (distance <= MAX_SOUND_DISTANCE)
1600 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1601 }
1602}
1603
1604static void
1605split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1606{
1607 // clip to map to the left
1608 if (x0 < 0)
1609 {
1610 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1611 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1612
1613 if (x1 < 0) // entirely to the left
1614 return;
1615
1616 x0 = 0;
1617 }
1618
1619 // clip to map to the right
1620 if (x1 > m->width)
1621 {
1622 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1623 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1624
1625 if (x0 > m->width) // entirely to the right
1626 return;
1627
1628 x1 = m->width;
1629 }
1630
1631 // clip to map above
1632 if (y0 < 0)
1633 {
1634 if (maptile *tile = m->tile_available (TILE_UP, 1))
1635 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1636
1637 if (y1 < 0) // entirely above
1638 return;
1639
1640 y0 = 0;
1641 }
1642
1643 // clip to map below
1644 if (y1 > m->height)
1645 {
1646 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1647 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1648
1649 if (y0 > m->height) // entirely below
1650 return;
1651
1652 y1 = m->height;
1653 }
1654
1655 // if we get here, the rect is within the current map
1656 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1657
1658 r->m = m;
1659 r->x0 = x0;
1660 r->y0 = y0;
1661 r->x1 = x1;
1662 r->y1 = y1;
1663 r->dx = dx;
1664 r->dy = dy;
1665}
1666
1667maprect *
1668maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1669{
1670 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1671 buf.clear ();
1672
1673 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1674
1675 // add end marker
1676 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1677 r->m = 0;
1678
1679 return (maprect *)buf.linearise ();
1680}
1681

Diff Legend

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