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.150 by root, Thu Dec 4 03:48:19 2008 UTC vs.
Revision 1.169 by root, Sat Nov 7 18:30:05 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>
25 26
26#include "global.h" 27#include "global.h"
27#include "loader.h" 28#include "loader.h"
28#include "path.h" 29#include "path.h"
30
31//+GPL
32
33sint8 maptile::outdoor_darkness;
29 34
30/* This rolls up wall, blocks_magic, blocks_view, etc, all into 35/* This rolls up wall, blocks_magic, blocks_view, etc, all into
31 * one function that just returns a P_.. value (see map.h) 36 * one function that just returns a P_.. value (see map.h)
32 * it will also do map translation for tiled maps, returning 37 * it will also do map translation for tiled maps, returning
33 * new values into newmap, nx, and ny. Any and all of those 38 * new values into newmap, nx, and ny. Any and all of those
… …
68 * by the caller. 73 * by the caller.
69 */ 74 */
70int 75int
71blocked_link (object *ob, maptile *m, int sx, int sy) 76blocked_link (object *ob, maptile *m, int sx, int sy)
72{ 77{
73 object *tmp;
74 int mflags, blocked;
75
76 /* Make sure the coordinates are valid - they should be, as caller should 78 /* Make sure the coordinates are valid - they should be, as caller should
77 * have already checked this. 79 * have already checked this.
78 */ 80 */
79 if (OUT_OF_REAL_MAP (m, sx, sy)) 81 if (OUT_OF_REAL_MAP (m, sx, sy))
80 { 82 {
81 LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); 83 LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");
82 return 1; 84 return 1;
83 } 85 }
84 86
85 /* Save some cycles - instead of calling get_map_flags(), just get the value 87 mapspace &ms = m->at (sx, sy);
86 * directly.
87 */
88 mflags = m->at (sx, sy).flags ();
89 88
90 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 89 int mflags = ms.flags ();
90 int blocked = ms.move_block;
91 91
92 /* If space is currently not blocked by anything, no need to 92 /* If space is currently not blocked by anything, no need to
93 * go further. Not true for players - all sorts of special 93 * go further. Not true for players - all sorts of special
94 * things we need to do for players. 94 * things we need to do for players.
95 */ 95 */
96 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 96 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
97 return 0; 97 return 0;
98 98
99 /* if there isn't anytyhing alive on this space, and this space isn't 99 /* if there isn't anything alive on this space, and this space isn't
100 * otherwise blocked, we can return now. Only if there is a living 100 * otherwise blocked, we can return now. Only if there is a living
101 * creature do we need to investigate if it is part of this creature 101 * creature do we need to investigate if it is part of this creature
102 * or another. Likewise, only if something is blocking us do we 102 * or another. Likewise, only if something is blocking us do we
103 * need to investigate if there is a special circumstance that would 103 * need to investigate if there is a special circumstance that would
104 * let the player through (inventory checkers for example) 104 * let the player through (inventory checkers for example)
… …
111 /* We basically go through the stack of objects, and if there is 111 /* We basically go through the stack of objects, and if there is
112 * some other object that has NO_PASS or FLAG_ALIVE set, return 112 * some other object that has NO_PASS or FLAG_ALIVE set, return
113 * true. If we get through the entire stack, that must mean 113 * true. If we get through the entire stack, that must mean
114 * ob is blocking it, so return 0. 114 * ob is blocking it, so return 0.
115 */ 115 */
116 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) 116 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
117 { 117 {
118 118 if (OB_MOVE_BLOCK (ob, tmp))
119 /* This must be before the checks below. Code for inventory checkers. */
120 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
121 { 119 {
122 /* If last_sp is set, the player/monster needs an object, 120 if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
123 * so we check for it. If they don't have it, they can't 121 if (RESULT_INT (0))
124 * pass through this space. 122 return 1;
125 */ 123 else
126 if (tmp->last_sp) 124 continue;
125
126 if (tmp->type == CHECK_INV)
127 { 127 {
128 if (check_inv_recursive (ob, tmp) == NULL) 128 bool have = check_inv_recursive (ob, tmp);
129
130 // last_sp set means we block if we don't have.
131 if (logical_xor (have, tmp->last_sp))
129 return 1; 132 return 1;
130 else 133 }
131 continue; 134 else if (tmp->type == T_MATCH)
135 {
136 // T_MATCH allows "entrance" iff the match is true
137 // == blocks if the match fails
138
139 // we could have used an INVOKE_OBJECT, but decided against it, as we
140 // assume that T_MATCH is relatively common.
141 if (!match (tmp->slaying, ob, tmp, ob))
142 return 1;
132 } 143 }
133 else 144 else
134 { 145 return 1; // unconditional block
135 /* In this case, the player must not have the object - 146
136 * if they do, they can't pass through.
137 */
138 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
139 return 1;
140 else
141 continue;
142 }
143 } /* if check_inv */
144 else 147 } else {
145 { 148 // space does not block the ob, directly, but
146 /* Broke apart a big nasty if into several here to make 149 // anything alive that is not a door still
147 * this more readable. first check - if the space blocks 150 // blocks anything but wizards.
148 * movement, can't move here.
149 * second - if a monster, can't move there, unless it is a
150 * hidden dm
151 */
152 if (OB_MOVE_BLOCK (ob, tmp))
153 return 1;
154 151
155 if (tmp->flag [FLAG_ALIVE] 152 if (tmp->flag [FLAG_ALIVE]
156 && tmp->head_ () != ob 153 && tmp->head_ () != ob
157 && tmp != ob 154 && tmp != ob
158 && tmp->type != DOOR 155 && tmp->type != DOOR
159 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) 156 && !tmp->flag [FLAG_WIZPASS])
160 return 1; 157 return 1;
161 } 158 }
162
163 } 159 }
160
164 return 0; 161 return 0;
165} 162}
166 163
167/* 164/*
168 * Returns qthe blocking object if the given object can't fit in the given 165 * Returns qthe blocking object if the given object can't fit in the given
… …
226 * into inventory, but just links them. What this does is go through 223 * into inventory, but just links them. What this does is go through
227 * and insert them properly. 224 * and insert them properly.
228 * The object 'container' is the object that contains the inventory. 225 * The object 'container' is the object that contains the inventory.
229 * This is needed so that we can update the containers weight. 226 * This is needed so that we can update the containers weight.
230 */ 227 */
231void 228static void
232fix_container (object *container) 229fix_container (object *container)
233{ 230{
234 object *tmp = container->inv, *next; 231 object *tmp = container->inv, *next;
235 232
236 container->inv = 0; 233 container->inv = 0;
… …
247 // go through and calculate what all the containers are carrying. 244 // go through and calculate what all the containers are carrying.
248 //TODO: remove 245 //TODO: remove
249 container->update_weight (); 246 container->update_weight ();
250} 247}
251 248
249//-GPL
250
252void 251void
253maptile::set_object_flag (int flag, int value) 252maptile::set_object_flag (int flag, int value)
254{ 253{
255 if (!spaces) 254 if (!spaces)
256 return; 255 return;
… …
270 269
271 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 270 for (mapspace *ms = spaces + size (); ms-- > spaces; )
272 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 271 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
273 INVOKE_OBJECT (RESET, tmp); 272 INVOKE_OBJECT (RESET, tmp);
274} 273}
274
275//+GPL
275 276
276/* link_multipart_objects go through all the objects on the map looking 277/* link_multipart_objects go through all the objects on the map looking
277 * for objects whose arch says they are multipart yet according to the 278 * for objects whose arch says they are multipart yet according to the
278 * info we have, they only have the head (as would be expected when 279 * info we have, they only have the head (as would be expected when
279 * they are saved). 280 * they are saved).
… …
307 op = op->above; 308 op = op->above;
308 } 309 }
309 } 310 }
310} 311}
311 312
313//-GPL
314
312/* 315/*
313 * Loads (ands parses) the objects into a given map from the specified 316 * Loads (ands parses) the objects into a given map from the specified
314 * file pointer. 317 * file pointer.
315 */ 318 */
316bool 319bool
… …
332 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) 335 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
333 { 336 {
334 // we insert manually because 337 // we insert manually because
335 // a) its way faster 338 // a) its way faster
336 // b) we remove manually, too, and there are good reasons for that 339 // b) we remove manually, too, and there are good reasons for that
337 // c) its correct 340 // c) it's correct
338 mapspace &ms = at (op->x, op->y); 341 mapspace &ms = at (op->x, op->y);
339 342
340 op->flag [FLAG_REMOVED] = false; 343 op->flag [FLAG_REMOVED] = false;
341 344
342 op->above = 0; 345 op->above = 0;
343 op->below = ms.top; 346 op->below = ms.top;
344 347
345 if (ms.top)
346 ms.top->above = op; 348 *(ms.top ? &ms.top->above : &ms.bot) = op;
347 else
348 ms.bot = op;
349 349
350 ms.top = op; 350 ms.top = op;
351 ms.flags_ = 0; 351 ms.flags_ = 0;
352 } 352 }
353 else 353 else
… …
479 if (spaces) 479 if (spaces)
480 return; 480 return;
481 481
482 spaces = salloc0<mapspace> (size ()); 482 spaces = salloc0<mapspace> (size ());
483} 483}
484
485//+GPL
484 486
485/* Takes a string from a map definition and outputs a pointer to the array of shopitems 487/* Takes a string from a map definition and outputs a pointer to the array of shopitems
486 * corresponding to that string. Memory is allocated for this, it must be freed 488 * corresponding to that string. Memory is allocated for this, it must be freed
487 * at a later date. 489 * at a later date.
488 * Called by parse_map_headers below. 490 * Called by parse_map_headers below.
… …
565 return items; 567 return items;
566} 568}
567 569
568/* opposite of parse string, this puts the string that was originally fed in to 570/* opposite of parse string, this puts the string that was originally fed in to
569 * the map (or something equivilent) into output_string. */ 571 * the map (or something equivilent) into output_string. */
570static void 572static const char *
571print_shop_string (maptile *m, char *output_string) 573print_shop_string (maptile *m)
572{ 574{
573 int i; 575 static dynbuf_text buf; buf.clear ();
574 char tmp[MAX_BUF];
575 576
576 strcpy (output_string, "");
577 for (i = 0; i < m->shopitems[0].index; i++) 577 for (int i = 0; i < m->shopitems[0].index; i++)
578 { 578 {
579 if (m->shopitems[i].typenum) 579 if (m->shopitems[i].typenum)
580 { 580 {
581 if (m->shopitems[i].strength) 581 if (m->shopitems[i].strength)
582 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 582 buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
583 else 583 else
584 sprintf (tmp, "%s;", m->shopitems[i].name); 584 buf.printf ("%s;", m->shopitems[i].name);
585 } 585 }
586 else 586 else
587 { 587 {
588 if (m->shopitems[i].strength) 588 if (m->shopitems[i].strength)
589 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 589 buf.printf ("*:%d;", m->shopitems[i].strength);
590 else 590 else
591 sprintf (tmp, "*"); 591 buf.printf ("*");
592 } 592 }
593
594 strcat (output_string, tmp);
595 } 593 }
594
595 return buf;
596} 596}
597
598//-GPL
597 599
598/* This loads the header information of the map. The header 600/* This loads the header information of the map. The header
599 * contains things like difficulty, size, timeout, etc. 601 * contains things like difficulty, size, timeout, etc.
600 * this used to be stored in the map object, but with the 602 * this used to be stored in the map object, but with the
601 * addition of tiling, fields beyond that easily named in an 603 * addition of tiling, fields beyond that easily named in an
… …
693 } 695 }
694 696
695 abort (); 697 abort ();
696} 698}
697 699
700//+GPL
701
698/****************************************************************************** 702/******************************************************************************
699 * This is the start of unique map handling code 703 * This is the start of unique map handling code
700 *****************************************************************************/ 704 *****************************************************************************/
701 705
702/* This goes through the maptile and removed any unique items on the map. */ 706/* This goes through the maptile and removed any unique items on the map. */
… …
718 722
719 op = above; 723 op = above;
720 } 724 }
721 } 725 }
722} 726}
727
728//-GPL
723 729
724bool 730bool
725maptile::_save_header (object_freezer &freezer) 731maptile::_save_header (object_freezer &freezer)
726{ 732{
727#define MAP_OUT(k) freezer.put (KW_ ## k, k) 733#define MAP_OUT(k) freezer.put (KW_ ## k, k)
… …
735 MAP_OUT (reset_timeout); 741 MAP_OUT (reset_timeout);
736 MAP_OUT (fixed_resettime); 742 MAP_OUT (fixed_resettime);
737 MAP_OUT (no_reset); 743 MAP_OUT (no_reset);
738 MAP_OUT (no_drop); 744 MAP_OUT (no_drop);
739 MAP_OUT (difficulty); 745 MAP_OUT (difficulty);
740
741 if (default_region) MAP_OUT2 (region, default_region->name); 746 if (default_region) MAP_OUT2 (region, default_region->name);
742 747
743 if (shopitems) 748 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
744 {
745 char shop[MAX_BUF];
746 print_shop_string (this, shop);
747 MAP_OUT2 (shopitems, shop);
748 }
749
750 MAP_OUT (shopgreed); 749 MAP_OUT (shopgreed);
751 MAP_OUT (shopmin); 750 MAP_OUT (shopmin);
752 MAP_OUT (shopmax); 751 MAP_OUT (shopmax);
753 if (shoprace) MAP_OUT (shoprace); 752 if (shoprace) MAP_OUT (shoprace);
753
754 MAP_OUT (darkness); 754 MAP_OUT (darkness);
755 MAP_OUT (width); 755 MAP_OUT (width);
756 MAP_OUT (height); 756 MAP_OUT (height);
757 MAP_OUT (enter_x); 757 MAP_OUT (enter_x);
758 MAP_OUT (enter_y); 758 MAP_OUT (enter_y);
… …
790 if (!_save_header (freezer)) 790 if (!_save_header (freezer))
791 return false; 791 return false;
792 792
793 return freezer.save (path); 793 return freezer.save (path);
794} 794}
795
796//+GPL
795 797
796/* 798/*
797 * Remove and free all objects in the given map. 799 * Remove and free all objects in the given map.
798 */ 800 */
799void 801void
… …
935 op->destroy (); 937 op->destroy ();
936 } 938 }
937} 939}
938 940
939/* 941/*
940 * Updates every button on the map (by calling update_button() for them).
941 */
942void
943maptile::update_buttons ()
944{
945 for (oblinkpt *obp = buttons; obp; obp = obp->next)
946 for (objectlink *ol = obp->link; ol; ol = ol->next)
947 {
948 if (!ol->ob)
949 {
950 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
951 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
952 continue;
953 }
954
955 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
956 {
957 update_button (ol->ob);
958 break;
959 }
960 }
961}
962
963/*
964 * 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.
965 * difficulty does not have a lot to do with character level, 943 * difficulty does not have a lot to do with character level,
966 * 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.
967 * 945 *
968 * 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
969 * 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
970 * have a difficulty set than using this function - human calculation 948 * have a difficulty set rather than using this function - human calculation
971 * is much better than this functions guesswork. 949 * is much better than this function's guesswork.
972 */ 950 */
973int 951int
974maptile::estimate_difficulty () const 952maptile::estimate_difficulty () const
975{ 953{
976 long monster_cnt = 0; 954 long monster_cnt = 0;
… …
1021 * postive values make it darker, negative make it brighter 999 * postive values make it darker, negative make it brighter
1022 */ 1000 */
1023int 1001int
1024maptile::change_map_light (int change) 1002maptile::change_map_light (int change)
1025{ 1003{
1026 int new_level = darkness + change;
1027
1028 /* Nothing to do */ 1004 /* Nothing to do */
1029 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1005 if (!change)
1030 return 0; 1006 return 0;
1031 1007
1032 /* inform all players on the map */ 1008 /* inform all players on the map */
1033 if (change > 0) 1009 if (change > 0)
1034 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1010 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1035 else 1011 else
1036 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1012 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1037 1013
1038 /* Do extra checking. since darkness is a unsigned value, 1014 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1039 * we need to be extra careful about negative values.
1040 * In general, the checks below are only needed if change
1041 * is not +/-1
1042 */
1043 if (new_level < 0)
1044 darkness = 0;
1045 else if (new_level >= MAX_DARKNESS)
1046 darkness = MAX_DARKNESS;
1047 else
1048 darkness = new_level;
1049 1015
1050 /* All clients need to get re-updated for the change */ 1016 /* All clients need to get re-updated for the change */
1051 update_all_map_los (this); 1017 update_all_map_los (this);
1052 1018
1053 return 1; 1019 return 1;
… …
1226 vol += op->volume (); 1192 vol += op->volume ();
1227 1193
1228 return vol; 1194 return vol;
1229} 1195}
1230 1196
1231bool 1197maptile *
1232maptile::tile_available (int dir, bool load) 1198maptile::tile_available (int dir, bool load)
1233{ 1199{
1234 if (!tile_path[dir]) 1200 if (tile_path[dir])
1235 return 0; 1201 {
1236
1237 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))
1238 return 1; 1203 return tile_map[dir];
1239 1204
1240 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1205 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1241 return 1; 1206 return tile_map[dir];
1207 }
1242 1208
1243 return 0; 1209 return 0;
1244} 1210}
1245 1211
1246/* this returns TRUE if the coordinates (x,y) are out of 1212/* this returns TRUE if the coordinates (x,y) are out of
… …
1552 else 1518 else
1553 { 1519 {
1554 retval->distance_x += op2->x - x; 1520 retval->distance_x += op2->x - x;
1555 retval->distance_y += op2->y - y; 1521 retval->distance_y += op2->y - y;
1556 1522
1557 retval->part = NULL; 1523 retval->part = 0;
1558 retval->distance = idistance (retval->distance_x, retval->distance_y); 1524 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1559 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1525 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1560 } 1526 }
1561} 1527}
1562 1528
1563/* Returns true of op1 and op2 are effectively on the same map 1529/* Returns true of op1 and op2 are effectively on the same map
… …
1574 int dx, dy; 1540 int dx, dy;
1575 1541
1576 return adjacent_map (op1->map, op2->map, &dx, &dy); 1542 return adjacent_map (op1->map, op2->map, &dx, &dy);
1577} 1543}
1578 1544
1545//-GPL
1546
1579object * 1547object *
1580maptile::insert (object *op, int x, int y, object *originator, int flags) 1548maptile::insert (object *op, int x, int y, object *originator, int flags)
1581{ 1549{
1582 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1550 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1583} 1551}
… …
1594 if (default_region) 1562 if (default_region)
1595 return default_region; 1563 return default_region;
1596 1564
1597 return ::region::default_region (); 1565 return ::region::default_region ();
1598} 1566}
1567
1568//+GPL
1599 1569
1600/* picks a random object from a style map. 1570/* picks a random object from a style map.
1601 */ 1571 */
1602object * 1572object *
1603maptile::pick_random_object (rand_gen &gen) const 1573maptile::pick_random_object (rand_gen &gen) const
… …
1616 if (pick && pick->is_head ()) 1586 if (pick && pick->is_head ())
1617 return pick->head_ (); 1587 return pick->head_ ();
1618 } 1588 }
1619 1589
1620 // instead of crashing in the unlikely(?) case, try to return *something* 1590 // instead of crashing in the unlikely(?) case, try to return *something*
1621 return archetype::find ("bug"); 1591 return archetype::find (shstr_bug);
1622} 1592}
1593
1594//-GPL
1623 1595
1624void 1596void
1625maptile::play_sound (faceidx sound, int x, int y) const 1597maptile::play_sound (faceidx sound, int x, int y) const
1626{ 1598{
1627 if (!sound) 1599 if (!sound)
1628 return; 1600 return;
1629 1601
1602 for_all_players_on_map (pl, this)
1603 if (client *ns = pl->ns)
1604 {
1605 int dx = x - pl->ob->x;
1606 int dy = y - pl->ob->y;
1607
1608 int distance = idistance (dx, dy);
1609
1610 if (distance <= MAX_SOUND_DISTANCE)
1611 ns->play_sound (sound, dx, dy);
1612 }
1613}
1614
1615void
1616maptile::say_msg (const char *msg, int x, int y) const
1617{
1630 for_all_players (pl) 1618 for_all_players (pl)
1631 if (pl->ob->map == this)
1632 if (client *ns = pl->ns) 1619 if (client *ns = pl->ns)
1633 { 1620 {
1634 int dx = x - pl->ob->x; 1621 int dx = x - pl->ob->x;
1635 int dy = y - pl->ob->y; 1622 int dy = y - pl->ob->y;
1636 1623
1637 int distance = idistance (dx, dy); 1624 int distance = idistance (dx, dy);
1638 1625
1639 if (distance <= MAX_SOUND_DISTANCE) 1626 if (distance <= MAX_SOUND_DISTANCE)
1640 ns->play_sound (sound, dx, dy); 1627 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1641 } 1628 }
1642} 1629}
1643 1630
1631static void
1632split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1633{
1634 // clip to map to the left
1635 if (x0 < 0)
1636 {
1637 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1638 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1639
1640 if (x1 < 0) // entirely to the left
1641 return;
1642
1643 x0 = 0;
1644 }
1645
1646 // clip to map to the right
1647 if (x1 > m->width)
1648 {
1649 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1650 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1651
1652 if (x0 > m->width) // entirely to the right
1653 return;
1654
1655 x1 = m->width;
1656 }
1657
1658 // clip to map above
1659 if (y0 < 0)
1660 {
1661 if (maptile *tile = m->tile_available (TILE_UP, 1))
1662 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1663
1664 if (y1 < 0) // entirely above
1665 return;
1666
1667 y0 = 0;
1668 }
1669
1670 // clip to map below
1671 if (y1 > m->height)
1672 {
1673 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1674 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1675
1676 if (y0 > m->height) // entirely below
1677 return;
1678
1679 y1 = m->height;
1680 }
1681
1682 // if we get here, the rect is within the current map
1683 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1684
1685 r->m = m;
1686 r->x0 = x0;
1687 r->y0 = y0;
1688 r->x1 = x1;
1689 r->y1 = y1;
1690 r->dx = dx;
1691 r->dy = dy;
1692}
1693
1694maprect *
1695maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1696{
1697 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1698 buf.clear ();
1699
1700 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1701
1702 // add end marker
1703 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1704 r->m = 0;
1705
1706 return (maprect *)buf.linearise ();
1707}
1708

Diff Legend

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