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.117 by root, Fri Aug 24 00:26:09 2007 UTC vs.
Revision 1.176 by root, Tue Nov 10 05:11:05 2009 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 * Crossfire TRT 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 <crossfire@schmorp.de> 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 "funcpoint.h"
28
29#include "loader.h" 28#include "loader.h"
30
31#include "path.h" 29#include "path.h"
30
31//+GPL
32
33sint8 maptile::outdoor_darkness;
32 34
33/* This rolls up wall, blocks_magic, blocks_view, etc, all into 35/* This rolls up wall, blocks_magic, blocks_view, etc, all into
34 * one function that just returns a P_.. value (see map.h) 36 * one function that just returns a P_.. value (see map.h)
35 * it will also do map translation for tiled maps, returning 37 * it will also do map translation for tiled maps, returning
36 * 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
… …
71 * by the caller. 73 * by the caller.
72 */ 74 */
73int 75int
74blocked_link (object *ob, maptile *m, int sx, int sy) 76blocked_link (object *ob, maptile *m, int sx, int sy)
75{ 77{
76 object *tmp;
77 int mflags, blocked;
78
79 /* 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
80 * have already checked this. 79 * have already checked this.
81 */ 80 */
82 if (OUT_OF_REAL_MAP (m, sx, sy)) 81 if (OUT_OF_REAL_MAP (m, sx, sy))
83 { 82 {
84 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");
85 return 1; 84 return 1;
86 } 85 }
87 86
88 /* Save some cycles - instead of calling get_map_flags(), just get the value 87 mapspace &ms = m->at (sx, sy);
89 * directly.
90 */
91 mflags = m->at (sx, sy).flags ();
92 88
93 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 89 int mflags = ms.flags ();
90 int blocked = ms.move_block;
94 91
95 /* If space is currently not blocked by anything, no need to 92 /* If space is currently not blocked by anything, no need to
96 * go further. Not true for players - all sorts of special 93 * go further. Not true for players - all sorts of special
97 * things we need to do for players. 94 * things we need to do for players.
98 */ 95 */
99 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 96 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
100 return 0; 97 return 0;
101 98
102 /* 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
103 * 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
104 * 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
105 * or another. Likewise, only if something is blocking us do we 102 * or another. Likewise, only if something is blocking us do we
106 * need to investigate if there is a special circumstance that would 103 * need to investigate if there is a special circumstance that would
107 * let the player through (inventory checkers for example) 104 * let the player through (inventory checkers for example)
… …
114 /* 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
115 * 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
116 * true. If we get through the entire stack, that must mean 113 * true. If we get through the entire stack, that must mean
117 * ob is blocking it, so return 0. 114 * ob is blocking it, so return 0.
118 */ 115 */
119 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) 116 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
120 { 117 {
121 118 if (OB_MOVE_BLOCK (ob, tmp))
122 /* This must be before the checks below. Code for inventory checkers. */
123 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
124 { 119 {
125 /* If last_sp is set, the player/monster needs an object, 120 if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
126 * so we check for it. If they don't have it, they can't 121 if (RESULT_INT (0))
127 * pass through this space. 122 return 1;
128 */ 123 else
129 if (tmp->last_sp) 124 continue;
125
126 if (tmp->type == CHECK_INV)
130 { 127 {
131 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))
132 return 1; 132 return 1;
133 else 133 }
134 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;
135 } 143 }
136 else 144 else
137 { 145 return 1; // unconditional block
138 /* In this case, the player must not have the object - 146
139 * if they do, they can't pass through.
140 */
141 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
142 return 1;
143 else
144 continue;
145 }
146 } /* if check_inv */
147 else 147 } else {
148 { 148 // space does not block the ob, directly, but
149 /* Broke apart a big nasty if into several here to make 149 // anything alive that is not a door still
150 * this more readable. first check - if the space blocks 150 // blocks anything but wizards.
151 * movement, can't move here.
152 * second - if a monster, can't move there, unless it is a
153 * hidden dm
154 */
155 if (OB_MOVE_BLOCK (ob, tmp))
156 return 1;
157 151
158 if (tmp->flag [FLAG_ALIVE] 152 if (tmp->flag [FLAG_ALIVE]
159 && tmp->head_ () != ob 153 && tmp->head_ () != ob
160 && tmp != ob 154 && tmp != ob
161 && tmp->type != DOOR 155 && tmp->type != DOOR
162 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) 156 && !tmp->flag [FLAG_WIZPASS])
163 return 1; 157 return 1;
164 } 158 }
165
166 } 159 }
160
167 return 0; 161 return 0;
168} 162}
169 163
170/* 164/*
171 * Returns true if the given object can't fit in the given spot. 165 * Returns qthe blocking object if the given object can't fit in the given
172 * This is meant for multi space objects - for single space objecs, 166 * spot. This is meant for multi space objects - for single space objecs,
173 * just calling get_map_blocked and checking that against movement type 167 * just calling get_map_blocked and checking that against movement type
174 * of object. This function goes through all the parts of the 168 * of object. This function goes through all the parts of the multipart
175 * multipart object and makes sure they can be inserted. 169 * object and makes sure they can be inserted.
176 * 170 *
177 * While this doesn't call out of map, the get_map_flags does. 171 * While this doesn't call out of map, the get_map_flags does.
178 * 172 *
179 * This function has been used to deprecate arch_out_of_map - 173 * This function has been used to deprecate arch_out_of_map -
180 * this function also does that check, and since in most cases, 174 * this function also does that check, and since in most cases,
… …
191 * 185 *
192 * Note this used to be arch_blocked, but with new movement 186 * Note this used to be arch_blocked, but with new movement
193 * code, we need to have actual object to check its move_type 187 * code, we need to have actual object to check its move_type
194 * against the move_block values. 188 * against the move_block values.
195 */ 189 */
196int 190bool
197ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 191object::blocked (maptile *m, int x, int y) const
198{ 192{
199 archetype *tmp; 193 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
200 int flag;
201 maptile *m1;
202 sint16 sx, sy;
203
204 if (!ob)
205 {
206 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
207 if (flag & P_OUT_OF_MAP)
208 return P_OUT_OF_MAP;
209
210 /* don't have object, so don't know what types would block */
211 return m1->at (sx, sy).move_block;
212 } 194 {
195 mapxy pos (m, x + tmp->x, y + tmp->y);
213 196
214 for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more) 197 if (!pos.normalise ())
215 { 198 return 1;
216 flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
217 199
218 if (flag & P_OUT_OF_MAP) 200 mapspace &ms = *pos;
219 return P_OUT_OF_MAP; 201
220 if (flag & P_IS_ALIVE) 202 if (ms.flags () & P_IS_ALIVE)
221 return P_IS_ALIVE; 203 return 1;
222 204
223 mapspace &ms = m1->at (sx, sy); 205 /* However, often ob doesn't have any move type
224 206 * (signifying non-moving objects)
225 /* find_first_free_spot() calls this function. However, often
226 * ob doesn't have any move type (when used to place exits)
227 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 207 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
228 */ 208 */
229
230 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 209 if (!move_type && ms.move_block != MOVE_ALL)
231 continue; 210 continue;
232 211
233 /* Note it is intentional that we check ob - the movement type of the 212 /* Note it is intentional that we check ob - the movement type of the
234 * head of the object should correspond for the entire object. 213 * head of the object should correspond for the entire object.
235 */ 214 */
236 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 215 if (ms.blocks (move_type))
237 return P_NO_PASS; 216 return 1;
238 } 217 }
239 218
240 return 0; 219 return 0;
241} 220}
242 221
243/* When the map is loaded, load_object does not actually insert objects 222//-GPL
244 * into inventory, but just links them. What this does is go through
245 * and insert them properly.
246 * The object 'container' is the object that contains the inventory.
247 * This is needed so that we can update the containers weight.
248 */
249void
250fix_container (object *container)
251{
252 object *tmp = container->inv, *next;
253
254 container->inv = 0;
255 while (tmp)
256 {
257 next = tmp->below;
258 if (tmp->inv)
259 fix_container (tmp);
260
261 insert_ob_in_ob (tmp, container);
262 tmp = next;
263 }
264
265 /* sum_weight will go through and calculate what all the containers are
266 * carrying.
267 */
268 sum_weight (container);
269}
270 223
271void 224void
272maptile::set_object_flag (int flag, int value) 225maptile::set_object_flag (int flag, int value)
273{ 226{
274 if (!spaces) 227 if (!spaces)
… …
276 229
277 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 230 for (mapspace *ms = spaces + size (); ms-- > spaces; )
278 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 231 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
279 tmp->flag [flag] = value; 232 tmp->flag [flag] = value;
280} 233}
234
235void
236maptile::post_load_original ()
237{
238 if (!spaces)
239 return;
240
241 set_object_flag (FLAG_OBJ_ORIGINAL);
242
243 for (mapspace *ms = spaces + size (); ms-- > spaces; )
244 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
245 INVOKE_OBJECT (RESET, tmp);
246}
247
248void
249maptile::post_load ()
250{
251#if 0
252 if (!spaces)
253 return;
254
255 for (mapspace *ms = spaces + size (); ms-- > spaces; )
256 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
257 ; // nop
258#endif
259}
260
261//+GPL
281 262
282/* link_multipart_objects go through all the objects on the map looking 263/* link_multipart_objects go through all the objects on the map looking
283 * for objects whose arch says they are multipart yet according to the 264 * for objects whose arch says they are multipart yet according to the
284 * info we have, they only have the head (as would be expected when 265 * info we have, they only have the head (as would be expected when
285 * they are saved). 266 * they are saved).
… …
313 op = op->above; 294 op = op->above;
314 } 295 }
315 } 296 }
316} 297}
317 298
299//-GPL
300
318/* 301/*
319 * Loads (ands parses) the objects into a given map from the specified 302 * Loads (ands parses) the objects into a given map from the specified
320 * file pointer. 303 * file pointer.
321 */ 304 */
322bool 305bool
323maptile::_load_objects (object_thawer &f) 306maptile::_load_objects (object_thawer &f)
324{ 307{
325 for (;;) 308 for (;;)
326 { 309 {
327 coroapi::cede_to_tick_every (100); // cede once in a while 310 coroapi::cede_to_tick (); // cede once in a while
328 311
329 switch (f.kw) 312 switch (f.kw)
330 { 313 {
331 case KW_arch: 314 case KW_arch:
332 if (object *op = object::read (f, this)) 315 if (object *op = object::read (f, this))
333 { 316 {
317 // TODO: why?
334 if (op->inv) 318 if (op->inv)
335 sum_weight (op); 319 op->update_weight ();
336 320
337 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 321 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
322 {
323 // we insert manually because
324 // a) its way faster
325 // b) we remove manually, too, and there are good reasons for that
326 // c) it's correct
327 mapspace &ms = at (op->x, op->y);
328
329 op->flag [FLAG_REMOVED] = false;
330
331 op->above = 0;
332 op->below = ms.top;
333
334 *(ms.top ? &ms.top->above : &ms.bot) = op;
335
336 ms.top = op;
337 ms.flags_ = 0;
338 }
339 else
340 {
341 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
342 op->destroy ();
343 }
338 } 344 }
339 345
340 continue; 346 continue;
341 347
342 case KW_EOF: 348 case KW_EOF:
… …
383 if (!spaces) 389 if (!spaces)
384 return false; 390 return false;
385 391
386 for (int i = 0; i < size (); ++i) 392 for (int i = 0; i < size (); ++i)
387 { 393 {
388 int unique = 0; 394 bool unique = 0;
395
389 for (object *op = spaces [i].bot; op; op = op->above) 396 for (object *op = spaces [i].bot; op; op = op->above)
390 { 397 {
391 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 398 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
392 unique = 1;
393 399
394 if (!op->can_map_save ()) 400 if (expect_false (!op->can_map_save ()))
395 continue; 401 continue;
396 402
397 if (unique || op->flag [FLAG_UNIQUE]) 403 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
398 { 404 {
399 if (flags & IO_UNIQUES) 405 if (flags & IO_UNIQUES)
400 op->write (f); 406 op->write (f);
401 } 407 }
402 else if (flags & IO_OBJECTS) 408 else if (expect_true (flags & IO_OBJECTS))
403 op->write (f); 409 op->write (f);
404 } 410 }
405 } 411 }
406 412
407 coroapi::cede_to_tick (); 413 coroapi::cede_to_tick ();
408 414
409 return true; 415 return true;
410}
411
412bool
413maptile::_load_objects (const char *path, bool skip_header)
414{
415 object_thawer f (path);
416
417 if (!f)
418 return false;
419
420 f.next ();
421
422 if (skip_header)
423 for (;;)
424 {
425 keyword kw = f.kw;
426 f.skip ();
427 if (kw == KW_end)
428 break;
429 }
430
431 return _load_objects (f);
432} 416}
433 417
434bool 418bool
435maptile::_save_objects (const char *path, int flags) 419maptile::_save_objects (const char *path, int flags)
436{ 420{
… …
450 * map archetype. Mimic that behaviour. 434 * map archetype. Mimic that behaviour.
451 */ 435 */
452 width = 16; 436 width = 16;
453 height = 16; 437 height = 16;
454 timeout = 300; 438 timeout = 300;
455 max_nrof = 1000; // 1000 items of anything 439 max_items = MAX_ITEM_PER_ACTION;
456 max_volume = 2000000; // 2m³ 440 max_volume = 2000000; // 2m³
457} 441}
458 442
459maptile::maptile (int w, int h) 443maptile::maptile (int w, int h)
460{ 444{
… …
481 if (spaces) 465 if (spaces)
482 return; 466 return;
483 467
484 spaces = salloc0<mapspace> (size ()); 468 spaces = salloc0<mapspace> (size ());
485} 469}
470
471//+GPL
486 472
487/* Takes a string from a map definition and outputs a pointer to the array of shopitems 473/* Takes a string from a map definition and outputs a pointer to the array of shopitems
488 * corresponding to that string. Memory is allocated for this, it must be freed 474 * corresponding to that string. Memory is allocated for this, it must be freed
489 * at a later date. 475 * at a later date.
490 * Called by parse_map_headers below. 476 * Called by parse_map_headers below.
… …
567 return items; 553 return items;
568} 554}
569 555
570/* opposite of parse string, this puts the string that was originally fed in to 556/* opposite of parse string, this puts the string that was originally fed in to
571 * the map (or something equivilent) into output_string. */ 557 * the map (or something equivilent) into output_string. */
572static void 558static const char *
573print_shop_string (maptile *m, char *output_string) 559print_shop_string (maptile *m)
574{ 560{
575 int i; 561 static dynbuf_text buf; buf.clear ();
576 char tmp[MAX_BUF];
577 562
578 strcpy (output_string, "");
579 for (i = 0; i < m->shopitems[0].index; i++) 563 for (int i = 0; i < m->shopitems[0].index; i++)
580 { 564 {
581 if (m->shopitems[i].typenum) 565 if (m->shopitems[i].typenum)
582 { 566 {
583 if (m->shopitems[i].strength) 567 if (m->shopitems[i].strength)
584 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 568 buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
585 else 569 else
586 sprintf (tmp, "%s;", m->shopitems[i].name); 570 buf.printf ("%s;", m->shopitems[i].name);
587 } 571 }
588 else 572 else
589 { 573 {
590 if (m->shopitems[i].strength) 574 if (m->shopitems[i].strength)
591 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 575 buf.printf ("*:%d;", m->shopitems[i].strength);
592 else 576 else
593 sprintf (tmp, "*"); 577 buf.printf ("*");
594 } 578 }
595
596 strcat (output_string, tmp);
597 } 579 }
580
581 return buf;
598} 582}
583
584//-GPL
599 585
600/* This loads the header information of the map. The header 586/* This loads the header information of the map. The header
601 * contains things like difficulty, size, timeout, etc. 587 * contains things like difficulty, size, timeout, etc.
602 * this used to be stored in the map object, but with the 588 * this used to be stored in the map object, but with the
603 * addition of tiling, fields beyond that easily named in an 589 * addition of tiling, fields beyond that easily named in an
… …
611bool 597bool
612maptile::_load_header (object_thawer &thawer) 598maptile::_load_header (object_thawer &thawer)
613{ 599{
614 for (;;) 600 for (;;)
615 { 601 {
616 thawer.next ();
617
618 switch (thawer.kw) 602 switch (thawer.kw)
619 { 603 {
620 case KW_msg: 604 case KW_msg:
621 thawer.get_ml (KW_endmsg, msg); 605 thawer.get_ml (KW_endmsg, msg);
622 break; 606 break;
… …
656 case KW_sky: thawer.get (sky); break; 640 case KW_sky: thawer.get (sky); break;
657 641
658 case KW_per_player: thawer.get (per_player); break; 642 case KW_per_player: thawer.get (per_player); break;
659 case KW_per_party: thawer.get (per_party); break; 643 case KW_per_party: thawer.get (per_party); break;
660 case KW_no_reset: thawer.get (no_reset); break; 644 case KW_no_reset: thawer.get (no_reset); break;
645 case KW_no_drop: thawer.get (no_drop); break;
661 646
662 case KW_region: default_region = region::find (thawer.get_str ()); break; 647 case KW_region: default_region = region::find (thawer.get_str ()); break;
663 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 648 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
664 649
665 // old names new names 650 // old names new names
… …
677 case KW_tile_path_2: thawer.get (tile_path [1]); break; 662 case KW_tile_path_2: thawer.get (tile_path [1]); break;
678 case KW_tile_path_3: thawer.get (tile_path [2]); break; 663 case KW_tile_path_3: thawer.get (tile_path [2]); break;
679 case KW_tile_path_4: thawer.get (tile_path [3]); break; 664 case KW_tile_path_4: thawer.get (tile_path [3]); break;
680 665
681 case KW_ERROR: 666 case KW_ERROR:
682 set_key (thawer.kw_str, thawer.value); 667 set_key_text (thawer.kw_str, thawer.value);
683 break; 668 break;
684 669
685 case KW_end: 670 case KW_end:
671 thawer.next ();
686 return true; 672 return true;
687 673
688 default: 674 default:
689 if (!thawer.parse_error ("map", 0)) 675 if (!thawer.parse_error ("map", 0))
690 return false; 676 return false;
691 break; 677 break;
692 } 678 }
679
680 thawer.next ();
693 } 681 }
694 682
695 abort (); 683 abort ();
696} 684}
697 685
698bool 686//+GPL
699maptile::_load_header (const char *path)
700{
701 object_thawer thawer (path);
702
703 if (!thawer)
704 return false;
705
706 return _load_header (thawer);
707}
708 687
709/****************************************************************************** 688/******************************************************************************
710 * This is the start of unique map handling code 689 * This is the start of unique map handling code
711 *****************************************************************************/ 690 *****************************************************************************/
712 691
… …
723 702
724 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 703 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
725 unique = 1; 704 unique = 1;
726 705
727 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 706 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
728 {
729 op->destroy_inv (false);
730 op->destroy (); 707 op->destroy ();
731 }
732 708
733 op = above; 709 op = above;
734 } 710 }
735 } 711 }
736} 712}
713
714//-GPL
737 715
738bool 716bool
739maptile::_save_header (object_freezer &freezer) 717maptile::_save_header (object_freezer &freezer)
740{ 718{
741#define MAP_OUT(k) freezer.put (KW_ ## k, k) 719#define MAP_OUT(k) freezer.put (KW_ ## k, k)
… …
747 MAP_OUT (swap_time); 725 MAP_OUT (swap_time);
748 MAP_OUT (reset_time); 726 MAP_OUT (reset_time);
749 MAP_OUT (reset_timeout); 727 MAP_OUT (reset_timeout);
750 MAP_OUT (fixed_resettime); 728 MAP_OUT (fixed_resettime);
751 MAP_OUT (no_reset); 729 MAP_OUT (no_reset);
730 MAP_OUT (no_drop);
752 MAP_OUT (difficulty); 731 MAP_OUT (difficulty);
753
754 if (default_region) MAP_OUT2 (region, default_region->name); 732 if (default_region) MAP_OUT2 (region, default_region->name);
755 733
756 if (shopitems) 734 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
757 {
758 char shop[MAX_BUF];
759 print_shop_string (this, shop);
760 MAP_OUT2 (shopitems, shop);
761 }
762
763 MAP_OUT (shopgreed); 735 MAP_OUT (shopgreed);
764 MAP_OUT (shopmin); 736 MAP_OUT (shopmin);
765 MAP_OUT (shopmax); 737 MAP_OUT (shopmax);
766 if (shoprace) MAP_OUT (shoprace); 738 if (shoprace) MAP_OUT (shoprace);
739
767 MAP_OUT (darkness); 740 MAP_OUT (darkness);
768 MAP_OUT (width); 741 MAP_OUT (width);
769 MAP_OUT (height); 742 MAP_OUT (height);
770 MAP_OUT (enter_x); 743 MAP_OUT (enter_x);
771 MAP_OUT (enter_y); 744 MAP_OUT (enter_y);
… …
804 return false; 777 return false;
805 778
806 return freezer.save (path); 779 return freezer.save (path);
807} 780}
808 781
782//+GPL
783
809/* 784/*
810 * Remove and free all objects in the given map. 785 * Remove and free all objects in the given map.
811 */ 786 */
812void 787void
813maptile::clear () 788maptile::clear ()
814{ 789{
815 sfree (regions, size ()); regions = 0;
816 delete [] regionmap; regionmap = 0;
817
818 if (spaces) 790 if (spaces)
819 { 791 {
820 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 792 for (mapspace *ms = spaces + size (); ms-- > spaces; )
821 while (object *op = ms->bot) 793 while (object *op = ms->bot)
822 { 794 {
795 // manually remove, as to not trigger anything
796 if (ms->bot = op->above)
797 ms->bot->below = 0;
798
799 op->flag [FLAG_REMOVED] = true;
800
823 op = op->head_ (); 801 object *head = op->head_ ();
824 op->destroy_inv (false); 802 if (op == head)
825 op->destroy (); 803 op->destroy ();
804 else if (head->map != op->map)
805 {
806 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
807 head->destroy ();
808 }
826 } 809 }
827 810
828 sfree (spaces, size ()), spaces = 0; 811 sfree0 (spaces, size ());
829 } 812 }
830 813
831 if (buttons) 814 if (buttons)
832 free_objectlinkpt (buttons), buttons = 0; 815 free_objectlinkpt (buttons), buttons = 0;
816
817 sfree0 (regions, size ());
818 delete [] regionmap; regionmap = 0;
833} 819}
834 820
835void 821void
836maptile::clear_header () 822maptile::clear_header ()
837{ 823{
… …
889 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 875 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
890 break; 876 break;
891 877
892 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 878 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
893 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) 879 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
894 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
895 || QUERY_FLAG (op, FLAG_UNIQUE) 880 || QUERY_FLAG (op, FLAG_UNIQUE)
896 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) 881 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
897 || QUERY_FLAG (op, FLAG_UNPAID) 882 || QUERY_FLAG (op, FLAG_UNPAID)
898 || op->is_alive ()) 883 || op->is_alive ())
899 ; // do not decay 884 ; // do not decay
… …
938 op->destroy (); 923 op->destroy ();
939 } 924 }
940} 925}
941 926
942/* 927/*
943 * Updates every button on the map (by calling update_button() for them).
944 */
945void
946maptile::update_buttons ()
947{
948 for (oblinkpt *obp = buttons; obp; obp = obp->next)
949 for (objectlink *ol = obp->link; ol; ol = ol->next)
950 {
951 if (!ol->ob)
952 {
953 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
954 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
955 continue;
956 }
957
958 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
959 {
960 update_button (ol->ob);
961 break;
962 }
963 }
964}
965
966/*
967 * This routine is supposed to find out the difficulty of the map. 928 * This routine is supposed to find out the difficulty of the map.
968 * difficulty does not have a lot to do with character level, 929 * difficulty does not have a lot to do with character level,
969 * but does have a lot to do with treasure on the map. 930 * but does have a lot to do with treasure on the map.
970 * 931 *
971 * Difficulty can now be set by the map creature. If the value stored 932 * Difficulty can now be set by the map creator. If the value stored
972 * in the map is zero, then use this routine. Maps should really 933 * in the map is zero, then use this routine. Maps should really
973 * have a difficulty set than using this function - human calculation 934 * have a difficulty set rather than using this function - human calculation
974 * is much better than this functions guesswork. 935 * is much better than this function's guesswork.
975 */ 936 */
976int 937int
977maptile::estimate_difficulty () const 938maptile::estimate_difficulty () const
978{ 939{
979 long monster_cnt = 0; 940 long monster_cnt = 0;
… …
991 952
992 if (QUERY_FLAG (op, FLAG_GENERATOR)) 953 if (QUERY_FLAG (op, FLAG_GENERATOR))
993 { 954 {
994 total_exp += op->stats.exp; 955 total_exp += op->stats.exp;
995 956
996 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 957 if (archetype *at = op->other_arch)
958 {
997 total_exp += at->stats.exp * 8; 959 total_exp += at->stats.exp * 8;
998
999 monster_cnt++; 960 monster_cnt++;
961 }
962
963 for (object *inv = op->inv; inv; inv = inv->below)
964 {
965 total_exp += op->stats.exp * 8;
966 monster_cnt++;
967 }
1000 } 968 }
1001 } 969 }
1002 970
1003 avgexp = (double) total_exp / monster_cnt; 971 avgexp = (double) total_exp / monster_cnt;
1004 972
… …
1017 * postive values make it darker, negative make it brighter 985 * postive values make it darker, negative make it brighter
1018 */ 986 */
1019int 987int
1020maptile::change_map_light (int change) 988maptile::change_map_light (int change)
1021{ 989{
1022 int new_level = darkness + change;
1023
1024 /* Nothing to do */ 990 /* Nothing to do */
1025 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 991 if (!change)
1026 return 0; 992 return 0;
1027 993
1028 /* inform all players on the map */ 994 /* inform all players on the map */
1029 if (change > 0) 995 if (change > 0)
1030 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 996 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1031 else 997 else
1032 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 998 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1033 999
1034 /* Do extra checking. since darkness is a unsigned value, 1000 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1035 * we need to be extra careful about negative values.
1036 * In general, the checks below are only needed if change
1037 * is not +/-1
1038 */
1039 if (new_level < 0)
1040 darkness = 0;
1041 else if (new_level >= MAX_DARKNESS)
1042 darkness = MAX_DARKNESS;
1043 else
1044 darkness = new_level;
1045 1001
1046 /* All clients need to get re-updated for the change */ 1002 /* All clients need to get re-updated for the change */
1047 update_all_map_los (this); 1003 update_all_map_los (this);
1004
1048 return 1; 1005 return 1;
1049} 1006}
1050 1007
1051/* 1008/*
1052 * This function updates various attributes about a specific space 1009 * This function updates various attributes about a specific space
… …
1055 * through, etc) 1012 * through, etc)
1056 */ 1013 */
1057void 1014void
1058mapspace::update_ () 1015mapspace::update_ ()
1059{ 1016{
1060 object *tmp, *last = 0; 1017 object *last = 0;
1061 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1018 uint8 flags = P_UPTODATE;
1019 sint8 light = 0;
1062 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1020 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1021 uint64_t volume = 0;
1022 uint32_t items = 0;
1023 object *anywhere = 0;
1024 uint8_t middle_visibility = 0;
1063 1025
1064 //object *middle = 0; 1026 //object *middle = 0;
1065 //object *top = 0; 1027 //object *top = 0;
1066 //object *floor = 0; 1028 //object *floor = 0;
1067 // this seems to generate better code than using locals, above 1029 // this seems to generate better code than using locals, above
1068 object *&top = faces_obj[0] = 0; 1030 object *&top = faces_obj[0] = 0;
1069 object *&middle = faces_obj[1] = 0; 1031 object *&middle = faces_obj[1] = 0;
1070 object *&floor = faces_obj[2] = 0; 1032 object *&floor = faces_obj[2] = 0;
1071 1033
1034 object::flags_t allflags; // all flags of all objects or'ed together
1035
1072 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1036 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1073 { 1037 {
1074 /* This could be made additive I guess (two lights better than 1038 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1075 * one). But if so, it shouldn't be a simple additive - 2
1076 * light bulbs do not illuminate twice as far as once since
1077 * it is a dissapation factor that is cubed.
1078 */
1079 if (tmp->glow_radius > light)
1080 light = tmp->glow_radius; 1039 light += tmp->glow_radius;
1081 1040
1082 /* This call is needed in order to update objects the player 1041 /* This call is needed in order to update objects the player
1083 * is standing in that have animations (ie, grass, fire, etc). 1042 * is standing in that have animations (ie, grass, fire, etc).
1084 * However, it also causes the look window to be re-drawn 1043 * However, it also causes the look window to be re-drawn
1085 * 3 times each time the player moves, because many of the 1044 * 3 times each time the player moves, because many of the
1086 * functions the move_player calls eventualy call this. 1045 * functions the move_player calls eventualy call this.
1087 * 1046 *
1088 * Always put the player down for drawing. 1047 * Always put the player down for drawing.
1089 */ 1048 */
1090 if (!tmp->invisible) 1049 if (expect_true (!tmp->invisible))
1091 { 1050 {
1092 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1051 if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]))
1093 top = tmp; 1052 top = tmp;
1094 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1053 else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1095 { 1054 {
1096 /* If we got a floor, that means middle and top were below it, 1055 /* If we got a floor, that means middle and top were below it,
1097 * so should not be visible, so we clear them. 1056 * so should not be visible, so we clear them.
1098 */ 1057 */
1099 middle = 0; 1058 middle = 0;
1100 top = 0; 1059 top = 0;
1101 floor = tmp; 1060 floor = tmp;
1061 volume = 0;
1062 items = 0;
1102 } 1063 }
1103 /* Flag anywhere have high priority */ 1064 else
1104 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1105 { 1065 {
1066 if (expect_true (!tmp->flag [FLAG_NO_PICK]))
1067 {
1068 ++items;
1069 volume += tmp->volume ();
1070 }
1071
1072 /* Flag anywhere have high priority */
1073 if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1074 anywhere = tmp;
1075
1076 /* Find the highest visible face around. If equal
1077 * visibilities, we still want the one nearer to the
1078 * top
1079 */
1080 if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
1081 {
1082 middle_visibility = ::faces [tmp->face].visibility;
1106 middle = tmp; 1083 middle = tmp;
1107 anywhere = 1; 1084 }
1108 } 1085 }
1109 /* Find the highest visible face around. If equal
1110 * visibilities, we still want the one nearer to the
1111 * top
1112 */
1113 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1114 middle = tmp;
1115 }
1116
1117 if (tmp == tmp->above)
1118 {
1119 LOG (llevError, "Error in structure of map\n");
1120 exit (-1);
1121 } 1086 }
1122 1087
1123 move_slow |= tmp->move_slow; 1088 move_slow |= tmp->move_slow;
1124 move_block |= tmp->move_block; 1089 move_block |= tmp->move_block;
1125 move_on |= tmp->move_on; 1090 move_on |= tmp->move_on;
1126 move_off |= tmp->move_off; 1091 move_off |= tmp->move_off;
1127 move_allow |= tmp->move_allow; 1092 move_allow |= tmp->move_allow;
1128 1093
1129 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; 1094 allflags |= tmp->flag;
1130 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; 1095
1131 if (tmp->type == PLAYER) flags |= P_PLAYER; 1096 if (tmp->type == PLAYER) flags |= P_PLAYER;
1132 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1097 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1133 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1134 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1135 } 1098 }
1136 1099
1137 this->light = light; 1100 // FLAG_SEE_ANYWHERE takes precedence
1101 if (anywhere)
1102 middle = anywhere;
1103
1104 // ORing all flags together and checking them here is much faster
1105 if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
1106 if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC;
1107 if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE;
1108 if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC;
1109
1110 this->light = min (light, MAX_LIGHT_RADIUS);
1138 this->flags_ = flags; 1111 this->flags_ = flags;
1139 this->move_block = move_block & ~move_allow; 1112 this->move_block = move_block & ~move_allow;
1140 this->move_on = move_on; 1113 this->move_on = move_on;
1141 this->move_off = move_off; 1114 this->move_off = move_off;
1142 this->move_slow = move_slow; 1115 this->move_slow = move_slow;
1116 this->volume_ = (volume + 1023) / 1024;
1117 this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1143 1118
1144 /* At this point, we have a floor face (if there is a floor), 1119 /* At this point, we have a floor face (if there is a floor),
1145 * and the floor is set - we are not going to touch it at 1120 * and the floor is set - we are not going to touch it at
1146 * this point. 1121 * this point.
1147 * middle contains the highest visibility face. 1122 * middle contains the highest visibility face.
… …
1162 * 1) top face is set, need middle to be set. 1137 * 1) top face is set, need middle to be set.
1163 * 2) middle is set, need to set top. 1138 * 2) middle is set, need to set top.
1164 * 3) neither middle or top is set - need to set both. 1139 * 3) neither middle or top is set - need to set both.
1165 */ 1140 */
1166 1141
1167 for (tmp = last; tmp; tmp = tmp->below) 1142 for (object *tmp = last; tmp; tmp = tmp->below)
1168 { 1143 {
1169 /* Once we get to a floor, stop, since we already have a floor object */ 1144 /* Once we get to a floor, stop, since we already have a floor object */
1170 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1145 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1171 break; 1146 break;
1172 1147
… …
1213 faces_obj [1] = middle; 1188 faces_obj [1] = middle;
1214 faces_obj [2] = floor; 1189 faces_obj [2] = floor;
1215#endif 1190#endif
1216} 1191}
1217 1192
1218uint64 1193maptile *
1219mapspace::volume () const
1220{
1221 uint64 vol = 0;
1222
1223 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1224 vol += op->volume ();
1225
1226 return vol;
1227}
1228
1229bool
1230maptile::tile_available (int dir, bool load) 1194maptile::tile_available (int dir, bool load)
1231{ 1195{
1232 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY))
1233 return 1;
1234
1235 if (!tile_path[dir]) 1196 if (tile_path[dir])
1236 return 0; 1197 {
1198 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1199 return tile_map[dir];
1237 1200
1238 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1201 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1239 return 1; 1202 return tile_map[dir];
1203 }
1240 1204
1241 return 0; 1205 return 0;
1242} 1206}
1243 1207
1244/* this returns TRUE if the coordinates (x,y) are out of 1208/* this returns TRUE if the coordinates (x,y) are out of
… …
1259 if (!m) 1223 if (!m)
1260 return 0; 1224 return 0;
1261 1225
1262 if (x < 0) 1226 if (x < 0)
1263 { 1227 {
1264 if (!m->tile_available (3, 0)) 1228 if (!m->tile_available (3))
1265 return 1; 1229 return 1;
1266 1230
1267 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1231 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1268 } 1232 }
1269 1233
1270 if (x >= m->width) 1234 if (x >= m->width)
1271 { 1235 {
1272 if (!m->tile_available (1, 0)) 1236 if (!m->tile_available (1))
1273 return 1; 1237 return 1;
1274 1238
1275 return out_of_map (m->tile_map[1], x - m->width, y); 1239 return out_of_map (m->tile_map[1], x - m->width, y);
1276 } 1240 }
1277 1241
1278 if (y < 0) 1242 if (y < 0)
1279 { 1243 {
1280 if (!m->tile_available (0, 0)) 1244 if (!m->tile_available (0))
1281 return 1; 1245 return 1;
1282 1246
1283 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1247 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1284 } 1248 }
1285 1249
1286 if (y >= m->height) 1250 if (y >= m->height)
1287 { 1251 {
1288 if (!m->tile_available (2, 0)) 1252 if (!m->tile_available (2))
1289 return 1; 1253 return 1;
1290 1254
1291 return out_of_map (m->tile_map[2], x, y - m->height); 1255 return out_of_map (m->tile_map[2], x, y - m->height);
1292 } 1256 }
1293 1257
… …
1308maptile * 1272maptile *
1309maptile::xy_find (sint16 &x, sint16 &y) 1273maptile::xy_find (sint16 &x, sint16 &y)
1310{ 1274{
1311 if (x < 0) 1275 if (x < 0)
1312 { 1276 {
1313 if (!tile_available (3, 1)) 1277 if (!tile_available (3))
1314 return 0; 1278 return 0;
1315 1279
1316 x += tile_map[3]->width; 1280 x += tile_map[3]->width;
1317 return tile_map[3]->xy_find (x, y); 1281 return tile_map[3]->xy_find (x, y);
1318 } 1282 }
1319 1283
1320 if (x >= width) 1284 if (x >= width)
1321 { 1285 {
1322 if (!tile_available (1, 1)) 1286 if (!tile_available (1))
1323 return 0; 1287 return 0;
1324 1288
1325 x -= width; 1289 x -= width;
1326 return tile_map[1]->xy_find (x, y); 1290 return tile_map[1]->xy_find (x, y);
1327 } 1291 }
1328 1292
1329 if (y < 0) 1293 if (y < 0)
1330 { 1294 {
1331 if (!tile_available (0, 1)) 1295 if (!tile_available (0))
1332 return 0; 1296 return 0;
1333 1297
1334 y += tile_map[0]->height; 1298 y += tile_map[0]->height;
1335 return tile_map[0]->xy_find (x, y); 1299 return tile_map[0]->xy_find (x, y);
1336 } 1300 }
1337 1301
1338 if (y >= height) 1302 if (y >= height)
1339 { 1303 {
1340 if (!tile_available (2, 1)) 1304 if (!tile_available (2))
1341 return 0; 1305 return 0;
1342 1306
1343 y -= height; 1307 y -= height;
1344 return tile_map[2]->xy_find (x, y); 1308 return tile_map[2]->xy_find (x, y);
1345 } 1309 }
… …
1358adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1322adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1359{ 1323{
1360 if (!map1 || !map2) 1324 if (!map1 || !map2)
1361 return 0; 1325 return 0;
1362 1326
1363 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded 1327 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1364 //fix: compare paths instead (this is likely faster, too!) 1328 //fix: compare paths instead (this is likely faster, too!)
1365 if (map1 == map2) 1329 if (map1 == map2)
1366 { 1330 {
1367 *dx = 0; 1331 *dx = 0;
1368 *dy = 0; 1332 *dy = 0;
… …
1550 else 1514 else
1551 { 1515 {
1552 retval->distance_x += op2->x - x; 1516 retval->distance_x += op2->x - x;
1553 retval->distance_y += op2->y - y; 1517 retval->distance_y += op2->y - y;
1554 1518
1555 retval->part = NULL; 1519 retval->part = 0;
1556 retval->distance = idistance (retval->distance_x, retval->distance_y); 1520 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1557 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1521 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1558 } 1522 }
1559} 1523}
1560 1524
1561/* Returns true of op1 and op2 are effectively on the same map 1525/* Returns true of op1 and op2 are effectively on the same map
… …
1572 int dx, dy; 1536 int dx, dy;
1573 1537
1574 return adjacent_map (op1->map, op2->map, &dx, &dy); 1538 return adjacent_map (op1->map, op2->map, &dx, &dy);
1575} 1539}
1576 1540
1541//-GPL
1542
1577object * 1543object *
1578maptile::insert (object *op, int x, int y, object *originator, int flags) 1544maptile::insert (object *op, int x, int y, object *originator, int flags)
1579{ 1545{
1580 if (!op->flag [FLAG_REMOVED])
1581 op->remove ();
1582
1583 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1546 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1584} 1547}
1585 1548
1586region * 1549region *
1587maptile::region (int x, int y) const 1550maptile::region (int x, int y) const
… …
1596 return default_region; 1559 return default_region;
1597 1560
1598 return ::region::default_region (); 1561 return ::region::default_region ();
1599} 1562}
1600 1563
1564//+GPL
1565
1601/* picks a random object from a style map. 1566/* picks a random object from a style map.
1602 * Redone by MSW so it should be faster and not use static
1603 * variables to generate tables.
1604 */ 1567 */
1605object * 1568object *
1606maptile::pick_random_object () const 1569maptile::pick_random_object (rand_gen &gen) const
1607{ 1570{
1608 /* while returning a null object will result in a crash, that 1571 /* while returning a null object will result in a crash, that
1609 * is actually preferable to an infinite loop. That is because 1572 * is actually preferable to an infinite loop. That is because
1610 * most servers will automatically restart in case of crash. 1573 * most servers will automatically restart in case of crash.
1611 * Change the logic on getting the random space - shouldn't make 1574 * Change the logic on getting the random space - shouldn't make
1612 * any difference, but this seems clearer to me. 1575 * any difference, but this seems clearer to me.
1613 */ 1576 */
1614 for (int i = 1000; --i;) 1577 for (int i = 1000; --i;)
1615 { 1578 {
1616 object *pick = at (rndm (width), rndm (height)).bot; 1579 object *pick = at (gen (width), gen (height)).bot;
1617 1580
1618 // do not prefer big monsters just because they are big. 1581 // do not prefer big monsters just because they are big.
1619 if (pick && pick->head_ () == pick) 1582 if (pick && pick->is_head ())
1620 return pick->head_ (); 1583 return pick->head_ ();
1621 } 1584 }
1622 1585
1623 // instead of crashing in the unlikely(?) case, try to return *something* 1586 // instead of crashing in the unlikely(?) case, try to return *something*
1624 return get_archetype ("blocked"); 1587 return archetype::find (shstr_bug);
1625} 1588}
1589
1590//-GPL
1626 1591
1627void 1592void
1628maptile::play_sound (faceidx sound, int x, int y) const 1593maptile::play_sound (faceidx sound, int x, int y) const
1629{ 1594{
1630 if (!sound) 1595 if (!sound)
1631 return; 1596 return;
1632 1597
1598 for_all_players_on_map (pl, this)
1599 if (client *ns = pl->ns)
1600 {
1601 int dx = x - pl->ob->x;
1602 int dy = y - pl->ob->y;
1603
1604 int distance = idistance (dx, dy);
1605
1606 if (distance <= MAX_SOUND_DISTANCE)
1607 ns->play_sound (sound, dx, dy);
1608 }
1609}
1610
1611void
1612maptile::say_msg (const char *msg, int x, int y) const
1613{
1633 for_all_players (pl) 1614 for_all_players (pl)
1634 if (pl->ob->map == this)
1635 if (client *ns = pl->ns) 1615 if (client *ns = pl->ns)
1636 { 1616 {
1637 int dx = x - pl->ob->x; 1617 int dx = x - pl->ob->x;
1638 int dy = y - pl->ob->y; 1618 int dy = y - pl->ob->y;
1639 1619
1640 int distance = idistance (dx, dy); 1620 int distance = idistance (dx, dy);
1641 1621
1642 if (distance <= MAX_SOUND_DISTANCE) 1622 if (distance <= MAX_SOUND_DISTANCE)
1643 ns->play_sound (sound, dx, dy); 1623 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1644 } 1624 }
1645} 1625}
1646 1626
1627static void
1628split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1629{
1630 // clip to map to the left
1631 if (x0 < 0)
1632 {
1633 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1634 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1635
1636 if (x1 < 0) // entirely to the left
1637 return;
1638
1639 x0 = 0;
1640 }
1641
1642 // clip to map to the right
1643 if (x1 > m->width)
1644 {
1645 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1646 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1647
1648 if (x0 > m->width) // entirely to the right
1649 return;
1650
1651 x1 = m->width;
1652 }
1653
1654 // clip to map above
1655 if (y0 < 0)
1656 {
1657 if (maptile *tile = m->tile_available (TILE_UP, 1))
1658 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1659
1660 if (y1 < 0) // entirely above
1661 return;
1662
1663 y0 = 0;
1664 }
1665
1666 // clip to map below
1667 if (y1 > m->height)
1668 {
1669 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1670 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1671
1672 if (y0 > m->height) // entirely below
1673 return;
1674
1675 y1 = m->height;
1676 }
1677
1678 // if we get here, the rect is within the current map
1679 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1680
1681 r->m = m;
1682 r->x0 = x0;
1683 r->y0 = y0;
1684 r->x1 = x1;
1685 r->y1 = y1;
1686 r->dx = dx;
1687 r->dy = dy;
1688}
1689
1690maprect *
1691maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1692{
1693 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1694 buf.clear ();
1695
1696 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1697
1698 // add end marker
1699 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1700 r->m = 0;
1701
1702 return (maprect *)buf.linearise ();
1703}
1704

Diff Legend

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