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.96 by root, Thu Mar 15 14:23:02 2007 UTC vs.
Revision 1.161 by root, Mon Oct 12 21:27:55 2009 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program 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 2 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, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25#include <unistd.h> 25#include <unistd.h>
26 26
27#include "global.h" 27#include "global.h"
28#include "funcpoint.h"
29
30#include "loader.h" 28#include "loader.h"
31
32#include "path.h" 29#include "path.h"
33 30
34/* 31sint8 maptile::outdoor_darkness;
35 * This makes a path absolute outside the world of Crossfire.
36 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
37 * and returns the pointer to a static array containing the result.
38 * it really should be called create_mapname
39 */
40const char *
41create_pathname (const char *name)
42{
43 static char buf[8192];
44 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
45 return buf;
46}
47
48/*
49 * This function checks if a file with the given path exists.
50 * -1 is returned if it fails, otherwise the mode of the file
51 * is returned.
52 * It tries out all the compression suffixes listed in the uncomp[] array.
53 *
54 * If prepend_dir is set, then we call create_pathname (which prepends
55 * libdir & mapdir). Otherwise, we assume the name given is fully
56 * complete.
57 * Only the editor actually cares about the writablity of this -
58 * the rest of the code only cares that the file is readable.
59 * when the editor goes away, the call to stat should probably be
60 * replaced by an access instead (similar to the windows one, but
61 * that seems to be missing the prepend_dir processing
62 */
63int
64check_path (const char *name, int prepend_dir)
65{
66 char buf[MAX_BUF];
67
68 char *endbuf;
69 struct stat statbuf;
70 int mode = 0;
71
72 if (prepend_dir)
73 assign (buf, create_pathname (name));
74 else
75 assign (buf, name);
76
77 /* old method (strchr(buf, '\0')) seemd very odd to me -
78 * this method should be equivalant and is clearer.
79 * Can not use strcat because we need to cycle through
80 * all the names.
81 */
82 endbuf = buf + strlen (buf);
83
84 if (stat (buf, &statbuf))
85 return -1;
86 if (!S_ISREG (statbuf.st_mode))
87 return (-1);
88
89 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
90 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
91 mode |= 4;
92
93 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
94 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
95 mode |= 2;
96
97 return (mode);
98}
99 32
100/* This rolls up wall, blocks_magic, blocks_view, etc, all into 33/* This rolls up wall, blocks_magic, blocks_view, etc, all into
101 * one function that just returns a P_.. value (see map.h) 34 * one function that just returns a P_.. value (see map.h)
102 * it will also do map translation for tiled maps, returning 35 * it will also do map translation for tiled maps, returning
103 * new values into newmap, nx, and ny. Any and all of those 36 * new values into newmap, nx, and ny. Any and all of those
… …
138 * by the caller. 71 * by the caller.
139 */ 72 */
140int 73int
141blocked_link (object *ob, maptile *m, int sx, int sy) 74blocked_link (object *ob, maptile *m, int sx, int sy)
142{ 75{
143 object *tmp;
144 int mflags, blocked;
145
146 /* 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
147 * have already checked this. 77 * have already checked this.
148 */ 78 */
149 if (OUT_OF_REAL_MAP (m, sx, sy)) 79 if (OUT_OF_REAL_MAP (m, sx, sy))
150 { 80 {
… …
153 } 83 }
154 84
155 /* 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
156 * directly. 86 * directly.
157 */ 87 */
158 mflags = m->at (sx, sy).flags (); 88 mapspace &ms = m->at (sx, sy);
159 89
160 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 90 int mflags = ms.flags ();
91 int blocked = ms.move_block;
161 92
162 /* If space is currently not blocked by anything, no need to 93 /* If space is currently not blocked by anything, no need to
163 * go further. Not true for players - all sorts of special 94 * go further. Not true for players - all sorts of special
164 * things we need to do for players. 95 * things we need to do for players.
165 */ 96 */
166 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 97 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
167 return 0; 98 return 0;
168 99
169 /* 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
170 * 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
171 * 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
172 * or another. Likewise, only if something is blocking us do we 103 * or another. Likewise, only if something is blocking us do we
173 * need to investigate if there is a special circumstance that would 104 * need to investigate if there is a special circumstance that would
174 * let the player through (inventory checkers for example) 105 * let the player through (inventory checkers for example)
175 */ 106 */
176 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 107 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
177 return 0; 108 return 0;
178 109
179 if (ob->head != NULL)
180 ob = ob->head; 110 ob = ob->head_ ();
181 111
182 /* 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
183 * 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
184 * true. If we get through the entire stack, that must mean 114 * true. If we get through the entire stack, that must mean
185 * ob is blocking it, so return 0. 115 * ob is blocking it, so return 0.
186 */ 116 */
187 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) 117 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
188 { 118 {
189
190 /* This must be before the checks below. Code for inventory checkers. */ 119 /* This must be before the checks below. Code for inventory checkers. */
191 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) 120 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
192 { 121 {
122 bool have = check_inv_recursive (ob, tmp);
123
193 /* If last_sp is set, the player/monster needs an object, 124 /* If last_sp is set, the player/monster needs an object,
194 * so we check for it. If they don't have it, they can't 125 * so we check for it. If they don't have it, they can't
195 * pass through this space. 126 * pass through this space.
196 */ 127 */
197 if (tmp->last_sp) 128 if (tmp->last_sp)
198 { 129 {
199 if (check_inv_recursive (ob, tmp) == NULL) 130 if (!have)
200 return 1; 131 return 1;
201 else
202 continue;
203 } 132 }
204 else 133 else
205 { 134 {
206 /* In this case, the player must not have the object - 135 /* In this case, the player must not have the object -
207 * if they do, they can't pass through. 136 * if they do, they can't pass through.
208 */ 137 */
209 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ 138 if (have)
210 return 1; 139 return 1;
211 else
212 continue;
213 } 140 }
214 } /* if check_inv */ 141 }
215 else 142 else
216 { 143 {
217 /* Broke apart a big nasty if into several here to make 144 /* Broke apart a big nasty if into several here to make
218 * this more readable. first check - if the space blocks 145 * this more readable. first check - if the space blocks
219 * movement, can't move here. 146 * movement, can't move here.
220 * second - if a monster, can't move there, unles it is a 147 * second - if a monster, can't move there, unless it is a
221 * hidden dm 148 * dm.
222 */ 149 */
223 if (OB_MOVE_BLOCK (ob, tmp)) 150 if (OB_MOVE_BLOCK (ob, tmp))
224 return 1; 151 return 1;
225 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && 152
226 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) 153 if (tmp->flag [FLAG_ALIVE]
154 && tmp->head_ () != ob
155 && tmp != ob
156 && tmp->type != DOOR
157 && !tmp->flag [FLAG_WIZ])
227 return 1; 158 return 1;
228 } 159 }
229
230 } 160 }
161
231 return 0; 162 return 0;
232} 163}
233 164
234/* 165/*
235 * Returns true if the given object can't fit in the given spot. 166 * Returns qthe blocking object if the given object can't fit in the given
236 * This is meant for multi space objects - for single space objecs, 167 * spot. This is meant for multi space objects - for single space objecs,
237 * just calling get_map_blocked and checking that against movement type 168 * just calling get_map_blocked and checking that against movement type
238 * of object. This function goes through all the parts of the 169 * of object. This function goes through all the parts of the multipart
239 * multipart object and makes sure they can be inserted. 170 * object and makes sure they can be inserted.
240 * 171 *
241 * While this doesn't call out of map, the get_map_flags does. 172 * While this doesn't call out of map, the get_map_flags does.
242 * 173 *
243 * This function has been used to deprecate arch_out_of_map - 174 * This function has been used to deprecate arch_out_of_map -
244 * this function also does that check, and since in most cases, 175 * this function also does that check, and since in most cases,
… …
255 * 186 *
256 * Note this used to be arch_blocked, but with new movement 187 * Note this used to be arch_blocked, but with new movement
257 * code, we need to have actual object to check its move_type 188 * code, we need to have actual object to check its move_type
258 * against the move_block values. 189 * against the move_block values.
259 */ 190 */
260int 191bool
261ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 192object::blocked (maptile *m, int x, int y) const
262{ 193{
263 archetype *tmp; 194 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
264 int flag;
265 maptile *m1;
266 sint16 sx, sy;
267
268 if (!ob)
269 {
270 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
271 if (flag & P_OUT_OF_MAP)
272 return P_OUT_OF_MAP;
273
274 /* don't have object, so don't know what types would block */
275 return m1->at (sx, sy).move_block;
276 } 195 {
196 mapxy pos (m, x + tmp->x, y + tmp->y);
277 197
278 for (tmp = ob->arch; tmp; tmp = tmp->more) 198 if (!pos.normalise ())
279 { 199 return 1;
280 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
281 200
282 if (flag & P_OUT_OF_MAP) 201 mapspace &ms = *pos;
283 return P_OUT_OF_MAP; 202
284 if (flag & P_IS_ALIVE) 203 if (ms.flags () & P_IS_ALIVE)
285 return P_IS_ALIVE; 204 return 1;
286 205
287 mapspace &ms = m1->at (sx, sy); 206 /* However, often ob doesn't have any move type
288 207 * (signifying non-moving objects)
289 /* find_first_free_spot() calls this function. However, often
290 * ob doesn't have any move type (when used to place exits)
291 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 208 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
292 */ 209 */
293
294 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 210 if (!move_type && ms.move_block != MOVE_ALL)
295 continue; 211 continue;
296 212
297 /* Note it is intentional that we check ob - the movement type of the 213 /* Note it is intentional that we check ob - the movement type of the
298 * head of the object should correspond for the entire object. 214 * head of the object should correspond for the entire object.
299 */ 215 */
300 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 216 if (ms.blocks (move_type))
301 return P_NO_PASS; 217 return 1;
302 } 218 }
303 219
304 return 0; 220 return 0;
305} 221}
306 222
… …
324 240
325 insert_ob_in_ob (tmp, container); 241 insert_ob_in_ob (tmp, container);
326 tmp = next; 242 tmp = next;
327 } 243 }
328 244
329 /* sum_weight will go through and calculate what all the containers are 245 // go through and calculate what all the containers are carrying.
330 * carrying. 246 //TODO: remove
331 */ 247 container->update_weight ();
332 sum_weight (container);
333} 248}
334 249
335void 250void
336maptile::set_object_flag (int flag, int value) 251maptile::set_object_flag (int flag, int value)
337{ 252{
… …
341 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 256 for (mapspace *ms = spaces + size (); ms-- > spaces; )
342 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 257 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
343 tmp->flag [flag] = value; 258 tmp->flag [flag] = value;
344} 259}
345 260
261void
262maptile::post_load_original ()
263{
264 if (!spaces)
265 return;
266
267 set_object_flag (FLAG_OBJ_ORIGINAL);
268
269 for (mapspace *ms = spaces + size (); ms-- > spaces; )
270 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
271 INVOKE_OBJECT (RESET, tmp);
272}
273
346/* link_multipart_objects go through all the objects on the map looking 274/* link_multipart_objects go through all the objects on the map looking
347 * for objects whose arch says they are multipart yet according to the 275 * for objects whose arch says they are multipart yet according to the
348 * info we have, they only have the head (as would be expected when 276 * info we have, they only have the head (as would be expected when
349 * they are saved). We do have to look for the old maps that did save 277 * they are saved).
350 * the more sections and not re-add sections for them.
351 */ 278 */
352void 279void
353maptile::link_multipart_objects () 280maptile::link_multipart_objects ()
354{ 281{
355 if (!spaces) 282 if (!spaces)
356 return; 283 return;
357 284
358 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 285 for (mapspace *ms = spaces + size (); ms-- > spaces; )
359 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 286 {
287 object *op = ms->bot;
288 while (op)
360 { 289 {
361 /* already multipart - don't do anything more */ 290 /* already multipart - don't do anything more */
362 if (!tmp->head && !tmp->more) 291 if (op->head_ () == op && !op->more && op->arch->more)
363 {
364 /* If there is nothing more to this object, this for loop
365 * won't do anything.
366 */
367 archetype *at;
368 object *last, *op;
369 for (at = tmp->arch->more, last = tmp;
370 at;
371 at = at->more, last = op)
372 { 292 {
373 op = arch_to_object (at); 293 op->remove ();
294 op->expand_tail ();
374 295
375 /* update x,y coordinates */ 296 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
376 op->x += tmp->x; 297 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
377 op->y += tmp->y; 298 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
378 op->head = tmp;
379 op->map = this;
380 last->more = op;
381 op->name = tmp->name;
382 op->title = tmp->title;
383
384 /* we could link all the parts onto tmp, and then just
385 * call insert_ob_in_map once, but the effect is the same,
386 * as insert_ob_in_map will call itself with each part, and
387 * the coding is simpler to just to it here with each part.
388 */
389 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 299 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
300
301 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
302 // so we have to reset the iteration through the mapspace
390 } 303 }
304 else
305 op = op->above;
391 } 306 }
392 } 307 }
393} 308}
394 309
395/* 310/*
396 * Loads (ands parses) the objects into a given map from the specified 311 * Loads (ands parses) the objects into a given map from the specified
397 * file pointer. 312 * file pointer.
… …
399bool 314bool
400maptile::_load_objects (object_thawer &f) 315maptile::_load_objects (object_thawer &f)
401{ 316{
402 for (;;) 317 for (;;)
403 { 318 {
404 coroapi::cede_every (1000); // cede once in a while 319 coroapi::cede_to_tick (); // cede once in a while
405 320
406 switch (f.kw) 321 switch (f.kw)
407 { 322 {
408 case KW_arch: 323 case KW_arch:
409 if (object *op = object::read (f, this)) 324 if (object *op = object::read (f, this))
410 { 325 {
326 // TODO: why?
411 if (op->inv) 327 if (op->inv)
412 sum_weight (op); 328 op->update_weight ();
413 329
414 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 330 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
331 {
332 // we insert manually because
333 // a) its way faster
334 // b) we remove manually, too, and there are good reasons for that
335 // c) it's correct
336 mapspace &ms = at (op->x, op->y);
337
338 op->flag [FLAG_REMOVED] = false;
339
340 op->above = 0;
341 op->below = ms.top;
342
343 *(ms.top ? &ms.top->above : &ms.bot) = op;
344
345 ms.top = op;
346 ms.flags_ = 0;
347 }
348 else
349 {
350 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
351 op->destroy ();
352 }
415 } 353 }
416 354
417 continue; 355 continue;
418 356
419 case KW_EOF: 357 case KW_EOF:
… …
432} 370}
433 371
434void 372void
435maptile::activate () 373maptile::activate ()
436{ 374{
437 if (!spaces) 375 if (spaces)
438 return;
439
440 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 376 for (mapspace *ms = spaces + size (); ms-- > spaces; )
441 for (object *op = ms->bot; op; op = op->above) 377 for (object *op = ms->bot; op; op = op->above)
442 op->activate_recursive (); 378 op->activate_recursive ();
443} 379}
444 380
445void 381void
446maptile::deactivate () 382maptile::deactivate ()
447{ 383{
448 if (!spaces) 384 if (spaces)
449 return;
450
451 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 385 for (mapspace *ms = spaces + size (); ms-- > spaces; )
452 for (object *op = ms->bot; op; op = op->above) 386 for (object *op = ms->bot; op; op = op->above)
453 op->deactivate_recursive (); 387 op->deactivate_recursive ();
454} 388}
455 389
456bool 390bool
457maptile::_save_objects (object_freezer &f, int flags) 391maptile::_save_objects (object_freezer &f, int flags)
458{ 392{
459 static int cede_count = 0; 393 coroapi::cede_to_tick ();
460 394
461 if (flags & IO_HEADER) 395 if (flags & IO_HEADER)
462 _save_header (f); 396 _save_header (f);
463 397
464 if (!spaces) 398 if (!spaces)
465 return false; 399 return false;
466 400
467 for (int i = 0; i < size (); ++i) 401 for (int i = 0; i < size (); ++i)
468 { 402 {
469 if (cede_count >= 500)
470 {
471 cede_count = 0;
472 coroapi::cede ();
473 }
474
475 int unique = 0; 403 bool unique = 0;
404
476 for (object *op = spaces [i].bot; op; op = op->above) 405 for (object *op = spaces [i].bot; op; op = op->above)
477 { 406 {
478 // count per-object, but cede only when modification-safe
479 cede_count++;
480
481 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 407 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
482 unique = 1;
483 408
484 if (!op->can_map_save ()) 409 if (expect_false (!op->can_map_save ()))
485 continue; 410 continue;
486 411
487 if (unique || op->flag [FLAG_UNIQUE]) 412 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
488 { 413 {
489 if (flags & IO_UNIQUES) 414 if (flags & IO_UNIQUES)
490 op->write (f); 415 op->write (f);
491 } 416 }
492 else if (flags & IO_OBJECTS) 417 else if (expect_true (flags & IO_OBJECTS))
493 op->write (f); 418 op->write (f);
494 } 419 }
495 } 420 }
496 421
422 coroapi::cede_to_tick ();
423
497 return true; 424 return true;
498}
499
500bool
501maptile::_load_objects (const char *path, bool skip_header)
502{
503 object_thawer f (path);
504
505 if (!f)
506 return false;
507
508 f.next ();
509
510 if (skip_header)
511 for (;;)
512 {
513 keyword kw = f.kw;
514 f.skip ();
515 if (kw == KW_end)
516 break;
517 }
518
519 return _load_objects (f);
520} 425}
521 426
522bool 427bool
523maptile::_save_objects (const char *path, int flags) 428maptile::_save_objects (const char *path, int flags)
524{ 429{
… …
699bool 604bool
700maptile::_load_header (object_thawer &thawer) 605maptile::_load_header (object_thawer &thawer)
701{ 606{
702 for (;;) 607 for (;;)
703 { 608 {
704 keyword kw = thawer.get_kv ();
705
706 switch (kw) 609 switch (thawer.kw)
707 { 610 {
708 case KW_msg: 611 case KW_msg:
709 thawer.get_ml (KW_endmsg, msg); 612 thawer.get_ml (KW_endmsg, msg);
710 break; 613 break;
711 614
… …
743 case KW_winddir: thawer.get (winddir); break; 646 case KW_winddir: thawer.get (winddir); break;
744 case KW_sky: thawer.get (sky); break; 647 case KW_sky: thawer.get (sky); break;
745 648
746 case KW_per_player: thawer.get (per_player); break; 649 case KW_per_player: thawer.get (per_player); break;
747 case KW_per_party: thawer.get (per_party); break; 650 case KW_per_party: thawer.get (per_party); break;
651 case KW_no_reset: thawer.get (no_reset); break;
652 case KW_no_drop: thawer.get (no_drop); break;
748 653
749 case KW_region: default_region = region::find (thawer.get_str ()); break; 654 case KW_region: default_region = region::find (thawer.get_str ()); break;
750 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 655 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
751 656
752 // old names new names 657 // old names new names
… …
763 case KW_tile_path_1: thawer.get (tile_path [0]); break; 668 case KW_tile_path_1: thawer.get (tile_path [0]); break;
764 case KW_tile_path_2: thawer.get (tile_path [1]); break; 669 case KW_tile_path_2: thawer.get (tile_path [1]); break;
765 case KW_tile_path_3: thawer.get (tile_path [2]); break; 670 case KW_tile_path_3: thawer.get (tile_path [2]); break;
766 case KW_tile_path_4: thawer.get (tile_path [3]); break; 671 case KW_tile_path_4: thawer.get (tile_path [3]); break;
767 672
673 case KW_ERROR:
674 set_key_text (thawer.kw_str, thawer.value);
675 break;
676
768 case KW_end: 677 case KW_end:
678 thawer.next ();
769 return true; 679 return true;
770 680
771 default: 681 default:
772 if (!thawer.parse_error ("map", 0)) 682 if (!thawer.parse_error ("map", 0))
773 return false; 683 return false;
774 break; 684 break;
775 } 685 }
686
687 thawer.next ();
776 } 688 }
777 689
778 abort (); 690 abort ();
779}
780
781bool
782maptile::_load_header (const char *path)
783{
784 object_thawer thawer (path);
785
786 if (!thawer)
787 return false;
788
789 return _load_header (thawer);
790} 691}
791 692
792/****************************************************************************** 693/******************************************************************************
793 * This is the start of unique map handling code 694 * This is the start of unique map handling code
794 *****************************************************************************/ 695 *****************************************************************************/
… …
805 object *above = op->above; 706 object *above = op->above;
806 707
807 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 708 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
808 unique = 1; 709 unique = 1;
809 710
810 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 711 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
811 {
812 op->destroy_inv (false);
813 op->destroy (); 712 op->destroy ();
814 }
815 713
816 op = above; 714 op = above;
817 } 715 }
818 } 716 }
819} 717}
… …
829 if (name) MAP_OUT (name); 727 if (name) MAP_OUT (name);
830 MAP_OUT (swap_time); 728 MAP_OUT (swap_time);
831 MAP_OUT (reset_time); 729 MAP_OUT (reset_time);
832 MAP_OUT (reset_timeout); 730 MAP_OUT (reset_timeout);
833 MAP_OUT (fixed_resettime); 731 MAP_OUT (fixed_resettime);
732 MAP_OUT (no_reset);
733 MAP_OUT (no_drop);
834 MAP_OUT (difficulty); 734 MAP_OUT (difficulty);
835 735
836 if (default_region) MAP_OUT2 (region, default_region->name); 736 if (default_region) MAP_OUT2 (region, default_region->name);
837 737
838 if (shopitems) 738 if (shopitems)
… …
892 * Remove and free all objects in the given map. 792 * Remove and free all objects in the given map.
893 */ 793 */
894void 794void
895maptile::clear () 795maptile::clear ()
896{ 796{
897 sfree (regions, size ()), regions = 0;
898 free (regionmap), regionmap = 0;
899
900 if (spaces) 797 if (spaces)
901 { 798 {
902 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 799 for (mapspace *ms = spaces + size (); ms-- > spaces; )
903 while (object *op = ms->bot) 800 while (object *op = ms->bot)
904 { 801 {
802 // manually remove, as to not trigger anything
803 if (ms->bot = op->above)
804 ms->bot->below = 0;
805
806 op->flag [FLAG_REMOVED] = true;
807
808 object *head = op->head_ ();
905 if (op->head) 809 if (op == head)
906 op = op->head;
907
908 op->destroy_inv (false);
909 op->destroy (); 810 op->destroy ();
811 else if (head->map != op->map)
812 {
813 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
814 head->destroy ();
815 }
910 } 816 }
911 817
912 sfree (spaces, size ()), spaces = 0; 818 sfree0 (spaces, size ());
913 } 819 }
914 820
915 if (buttons) 821 if (buttons)
916 free_objectlinkpt (buttons), buttons = 0; 822 free_objectlinkpt (buttons), buttons = 0;
823
824 sfree0 (regions, size ());
825 delete [] regionmap; regionmap = 0;
917} 826}
918 827
919void 828void
920maptile::clear_header () 829maptile::clear_header ()
921{ 830{
… …
953 attachable::do_destroy (); 862 attachable::do_destroy ();
954 863
955 clear (); 864 clear ();
956} 865}
957 866
958/* 867/* decay and destroy perishable items in a map */
959 * Updates every button on the map (by calling update_button() for them).
960 */
961void 868void
962maptile::update_buttons () 869maptile::do_decay_objects ()
963{ 870{
964 for (oblinkpt *obp = buttons; obp; obp = obp->next) 871 if (!spaces)
965 for (objectlink *ol = obp->link; ol; ol = ol->next) 872 return;
873
874 for (mapspace *ms = spaces + size (); ms-- > spaces; )
875 for (object *above, *op = ms->bot; op; op = above)
966 { 876 {
967 if (!ol->ob) 877 above = op->above;
878
879 bool destroy = 0;
880
881 // do not decay anything above unique floor tiles (yet :)
882 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
883 break;
884
885 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
886 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
887 || QUERY_FLAG (op, FLAG_UNIQUE)
888 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
889 || QUERY_FLAG (op, FLAG_UNPAID)
890 || op->is_alive ())
891 ; // do not decay
892 else if (op->is_weapon ())
968 { 893 {
969 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", 894 op->stats.dam--;
970 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); 895 if (op->stats.dam < 0)
971 continue; 896 destroy = 1;
972 } 897 }
973 898 else if (op->is_armor ())
974 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
975 { 899 {
976 update_button (ol->ob); 900 op->stats.ac--;
977 break; 901 if (op->stats.ac < 0)
902 destroy = 1;
978 } 903 }
904 else if (op->type == FOOD)
905 {
906 op->stats.food -= rndm (5, 20);
907 if (op->stats.food < 0)
908 destroy = 1;
909 }
910 else
911 {
912 int mat = op->materials;
913
914 if (mat & M_PAPER
915 || mat & M_LEATHER
916 || mat & M_WOOD
917 || mat & M_ORGANIC
918 || mat & M_CLOTH
919 || mat & M_LIQUID
920 || (mat & M_IRON && rndm (1, 5) == 1)
921 || (mat & M_GLASS && rndm (1, 2) == 1)
922 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
923 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
924 || (mat & M_ICE && temp > 32))
925 destroy = 1;
926 }
927
928 /* adjust overall chance below */
929 if (destroy && rndm (0, 1))
930 op->destroy ();
979 } 931 }
980} 932}
981 933
982/* 934/*
983 * This routine is supposed to find out the difficulty of the map. 935 * This routine is supposed to find out the difficulty of the map.
984 * difficulty does not have a lot to do with character level, 936 * difficulty does not have a lot to do with character level,
985 * but does have a lot to do with treasure on the map. 937 * but does have a lot to do with treasure on the map.
986 * 938 *
987 * Difficulty can now be set by the map creature. If the value stored 939 * Difficulty can now be set by the map creator. If the value stored
988 * in the map is zero, then use this routine. Maps should really 940 * in the map is zero, then use this routine. Maps should really
989 * have a difficulty set than using this function - human calculation 941 * have a difficulty set rather than using this function - human calculation
990 * is much better than this functions guesswork. 942 * is much better than this function's guesswork.
991 */ 943 */
992int 944int
993maptile::estimate_difficulty () const 945maptile::estimate_difficulty () const
994{ 946{
995 long monster_cnt = 0; 947 long monster_cnt = 0;
… …
1007 959
1008 if (QUERY_FLAG (op, FLAG_GENERATOR)) 960 if (QUERY_FLAG (op, FLAG_GENERATOR))
1009 { 961 {
1010 total_exp += op->stats.exp; 962 total_exp += op->stats.exp;
1011 963
1012 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 964 if (archetype *at = op->other_arch)
965 {
1013 total_exp += at->clone.stats.exp * 8; 966 total_exp += at->stats.exp * 8;
1014
1015 monster_cnt++; 967 monster_cnt++;
968 }
969
970 for (object *inv = op->inv; inv; inv = inv->below)
971 {
972 total_exp += op->stats.exp * 8;
973 monster_cnt++;
974 }
1016 } 975 }
1017 } 976 }
1018 977
1019 avgexp = (double) total_exp / monster_cnt; 978 avgexp = (double) total_exp / monster_cnt;
1020 979
… …
1033 * postive values make it darker, negative make it brighter 992 * postive values make it darker, negative make it brighter
1034 */ 993 */
1035int 994int
1036maptile::change_map_light (int change) 995maptile::change_map_light (int change)
1037{ 996{
1038 int new_level = darkness + change;
1039
1040 /* Nothing to do */ 997 /* Nothing to do */
1041 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 998 if (!change)
1042 return 0; 999 return 0;
1043 1000
1044 /* inform all players on the map */ 1001 /* inform all players on the map */
1045 if (change > 0) 1002 if (change > 0)
1046 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1003 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1047 else 1004 else
1048 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1005 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1049 1006
1050 /* Do extra checking. since darkness is a unsigned value, 1007 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1051 * we need to be extra careful about negative values.
1052 * In general, the checks below are only needed if change
1053 * is not +/-1
1054 */
1055 if (new_level < 0)
1056 darkness = 0;
1057 else if (new_level >= MAX_DARKNESS)
1058 darkness = MAX_DARKNESS;
1059 else
1060 darkness = new_level;
1061 1008
1062 /* All clients need to get re-updated for the change */ 1009 /* All clients need to get re-updated for the change */
1063 update_all_map_los (this); 1010 update_all_map_los (this);
1011
1064 return 1; 1012 return 1;
1065} 1013}
1066 1014
1067/* 1015/*
1068 * This function updates various attributes about a specific space 1016 * This function updates various attributes about a specific space
… …
1071 * through, etc) 1019 * through, etc)
1072 */ 1020 */
1073void 1021void
1074mapspace::update_ () 1022mapspace::update_ ()
1075{ 1023{
1076 object *tmp, *last = 0; 1024 object *last = 0;
1077 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1025 uint8 flags = P_UPTODATE, anywhere = 0;
1026 sint8 light = 0;
1078 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1027 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1079 1028
1080 //object *middle = 0; 1029 //object *middle = 0;
1081 //object *top = 0; 1030 //object *top = 0;
1082 //object *floor = 0; 1031 //object *floor = 0;
1083 // this seems to generate better code than using locals, above 1032 // this seems to generate better code than using locals, above
1084 object *&top = faces_obj[0] = 0; 1033 object *&top = faces_obj[0] = 0;
1085 object *&middle = faces_obj[1] = 0; 1034 object *&middle = faces_obj[1] = 0;
1086 object *&floor = faces_obj[2] = 0; 1035 object *&floor = faces_obj[2] = 0;
1087 1036
1088 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1037 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1089 { 1038 {
1090 /* This could be made additive I guess (two lights better than 1039 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1091 * one). But if so, it shouldn't be a simple additive - 2
1092 * light bulbs do not illuminate twice as far as once since
1093 * it is a dissapation factor that is cubed.
1094 */
1095 if (tmp->glow_radius > light)
1096 light = tmp->glow_radius; 1040 light += tmp->glow_radius;
1097 1041
1098 /* This call is needed in order to update objects the player 1042 /* This call is needed in order to update objects the player
1099 * is standing in that have animations (ie, grass, fire, etc). 1043 * is standing in that have animations (ie, grass, fire, etc).
1100 * However, it also causes the look window to be re-drawn 1044 * However, it also causes the look window to be re-drawn
1101 * 3 times each time the player moves, because many of the 1045 * 3 times each time the player moves, because many of the
… …
1120 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1064 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1121 { 1065 {
1122 middle = tmp; 1066 middle = tmp;
1123 anywhere = 1; 1067 anywhere = 1;
1124 } 1068 }
1069
1125 /* Find the highest visible face around. If equal 1070 /* Find the highest visible face around. If equal
1126 * visibilities, we still want the one nearer to the 1071 * visibilities, we still want the one nearer to the
1127 * top 1072 * top
1128 */ 1073 */
1129 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) 1074 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
… …
1148 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1093 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1149 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1094 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1150 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1095 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1151 } 1096 }
1152 1097
1153 this->light = light; 1098 this->light = min (light, MAX_LIGHT_RADIUS);
1154 this->flags_ = flags; 1099 this->flags_ = flags;
1155 this->move_block = move_block & ~move_allow; 1100 this->move_block = move_block & ~move_allow;
1156 this->move_on = move_on; 1101 this->move_on = move_on;
1157 this->move_off = move_off; 1102 this->move_off = move_off;
1158 this->move_slow = move_slow; 1103 this->move_slow = move_slow;
… …
1178 * 1) top face is set, need middle to be set. 1123 * 1) top face is set, need middle to be set.
1179 * 2) middle is set, need to set top. 1124 * 2) middle is set, need to set top.
1180 * 3) neither middle or top is set - need to set both. 1125 * 3) neither middle or top is set - need to set both.
1181 */ 1126 */
1182 1127
1183 for (tmp = last; tmp; tmp = tmp->below) 1128 for (object *tmp = last; tmp; tmp = tmp->below)
1184 { 1129 {
1185 /* Once we get to a floor, stop, since we already have a floor object */ 1130 /* Once we get to a floor, stop, since we already have a floor object */
1186 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1131 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1187 break; 1132 break;
1188 1133
… …
1240 vol += op->volume (); 1185 vol += op->volume ();
1241 1186
1242 return vol; 1187 return vol;
1243} 1188}
1244 1189
1245/* this updates the orig_map->tile_map[tile_num] value after finding 1190maptile *
1246 * the map. It also takes care of linking back the freshly found 1191maptile::tile_available (int dir, bool load)
1247 * maps tile_map values if it tiles back to this one. It returns
1248 * the value of orig_map->tile_map[tile_num].
1249 */
1250static inline maptile *
1251find_and_link (maptile *orig_map, int tile_num)
1252{ 1192{
1253 maptile *mp = orig_map->tile_map [tile_num]; 1193 if (tile_path[dir])
1254
1255 if (!mp)
1256 {
1257 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1258
1259 if (!mp)
1260 {
1261 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1262 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1263 &orig_map->tile_path[tile_num], &orig_map->path);
1264 mp = new maptile (1, 1);
1265 mp->alloc ();
1266 mp->in_memory = MAP_IN_MEMORY;
1267 }
1268 } 1194 {
1195 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1196 return tile_map[dir];
1269 1197
1270 int dest_tile = (tile_num + 2) % 4; 1198 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1199 return tile_map[dir];
1200 }
1271 1201
1272 orig_map->tile_map [tile_num] = mp;
1273
1274 // optimisation: back-link map to origin map if euclidean
1275 //TODO: non-euclidean maps MUST GO
1276 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1277 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1278
1279 return mp; 1202 return 0;
1280}
1281
1282static inline void
1283load_and_link (maptile *orig_map, int tile_num)
1284{
1285 find_and_link (orig_map, tile_num)->load_sync ();
1286} 1203}
1287 1204
1288/* this returns TRUE if the coordinates (x,y) are out of 1205/* this returns TRUE if the coordinates (x,y) are out of
1289 * map m. This function also takes into account any 1206 * map m. This function also takes into account any
1290 * tiling considerations, loading adjacant maps as needed. 1207 * tiling considerations, loading adjacant maps as needed.
… …
1303 if (!m) 1220 if (!m)
1304 return 0; 1221 return 0;
1305 1222
1306 if (x < 0) 1223 if (x < 0)
1307 { 1224 {
1308 if (!m->tile_path[3]) 1225 if (!m->tile_available (3))
1309 return 1; 1226 return 1;
1310 1227
1311 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1312 find_and_link (m, 3);
1313
1314 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1228 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1315 } 1229 }
1316 1230
1317 if (x >= m->width) 1231 if (x >= m->width)
1318 { 1232 {
1319 if (!m->tile_path[1]) 1233 if (!m->tile_available (1))
1320 return 1; 1234 return 1;
1321 1235
1322 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1323 find_and_link (m, 1);
1324
1325 return out_of_map (m->tile_map[1], x - m->width, y); 1236 return out_of_map (m->tile_map[1], x - m->width, y);
1326 } 1237 }
1327 1238
1328 if (y < 0) 1239 if (y < 0)
1329 { 1240 {
1330 if (!m->tile_path[0]) 1241 if (!m->tile_available (0))
1331 return 1; 1242 return 1;
1332 1243
1333 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1334 find_and_link (m, 0);
1335
1336 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1244 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1337 } 1245 }
1338 1246
1339 if (y >= m->height) 1247 if (y >= m->height)
1340 { 1248 {
1341 if (!m->tile_path[2]) 1249 if (!m->tile_available (2))
1342 return 1; 1250 return 1;
1343
1344 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1345 find_and_link (m, 2);
1346 1251
1347 return out_of_map (m->tile_map[2], x, y - m->height); 1252 return out_of_map (m->tile_map[2], x, y - m->height);
1348 } 1253 }
1349 1254
1350 /* Simple case - coordinates are within this local 1255 /* Simple case - coordinates are within this local
… …
1364maptile * 1269maptile *
1365maptile::xy_find (sint16 &x, sint16 &y) 1270maptile::xy_find (sint16 &x, sint16 &y)
1366{ 1271{
1367 if (x < 0) 1272 if (x < 0)
1368 { 1273 {
1369 if (!tile_path[3]) 1274 if (!tile_available (3))
1370 return 0; 1275 return 0;
1371 1276
1372 find_and_link (this, 3);
1373 x += tile_map[3]->width; 1277 x += tile_map[3]->width;
1374 return tile_map[3]->xy_find (x, y); 1278 return tile_map[3]->xy_find (x, y);
1375 } 1279 }
1376 1280
1377 if (x >= width) 1281 if (x >= width)
1378 { 1282 {
1379 if (!tile_path[1]) 1283 if (!tile_available (1))
1380 return 0; 1284 return 0;
1381 1285
1382 find_and_link (this, 1);
1383 x -= width; 1286 x -= width;
1384 return tile_map[1]->xy_find (x, y); 1287 return tile_map[1]->xy_find (x, y);
1385 } 1288 }
1386 1289
1387 if (y < 0) 1290 if (y < 0)
1388 { 1291 {
1389 if (!tile_path[0]) 1292 if (!tile_available (0))
1390 return 0; 1293 return 0;
1391 1294
1392 find_and_link (this, 0);
1393 y += tile_map[0]->height; 1295 y += tile_map[0]->height;
1394 return tile_map[0]->xy_find (x, y); 1296 return tile_map[0]->xy_find (x, y);
1395 } 1297 }
1396 1298
1397 if (y >= height) 1299 if (y >= height)
1398 { 1300 {
1399 if (!tile_path[2]) 1301 if (!tile_available (2))
1400 return 0; 1302 return 0;
1401 1303
1402 find_and_link (this, 2);
1403 y -= height; 1304 y -= height;
1404 return tile_map[2]->xy_find (x, y); 1305 return tile_map[2]->xy_find (x, y);
1405 } 1306 }
1406 1307
1407 /* Simple case - coordinates are within this local 1308 /* Simple case - coordinates are within this local
… …
1418adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1319adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1419{ 1320{
1420 if (!map1 || !map2) 1321 if (!map1 || !map2)
1421 return 0; 1322 return 0;
1422 1323
1423 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded 1324 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1424 //fix: compare paths instead (this is likely faster, too!) 1325 //fix: compare paths instead (this is likely faster, too!)
1425 if (map1 == map2) 1326 if (map1 == map2)
1426 { 1327 {
1427 *dx = 0; 1328 *dx = 0;
1428 *dy = 0; 1329 *dy = 0;
… …
1610 else 1511 else
1611 { 1512 {
1612 retval->distance_x += op2->x - x; 1513 retval->distance_x += op2->x - x;
1613 retval->distance_y += op2->y - y; 1514 retval->distance_y += op2->y - y;
1614 1515
1615 retval->part = NULL; 1516 retval->part = 0;
1616 retval->distance = idistance (retval->distance_x, retval->distance_y); 1517 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1617 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1518 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1618 } 1519 }
1619} 1520}
1620 1521
1621/* Returns true of op1 and op2 are effectively on the same map 1522/* Returns true of op1 and op2 are effectively on the same map
… …
1635} 1536}
1636 1537
1637object * 1538object *
1638maptile::insert (object *op, int x, int y, object *originator, int flags) 1539maptile::insert (object *op, int x, int y, object *originator, int flags)
1639{ 1540{
1640 if (!op->flag [FLAG_REMOVED])
1641 op->remove ();
1642
1643 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1541 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1644} 1542}
1645 1543
1646region * 1544region *
1647maptile::region (int x, int y) const 1545maptile::region (int x, int y) const
… …
1657 1555
1658 return ::region::default_region (); 1556 return ::region::default_region ();
1659} 1557}
1660 1558
1661/* picks a random object from a style map. 1559/* picks a random object from a style map.
1662 * Redone by MSW so it should be faster and not use static
1663 * variables to generate tables.
1664 */ 1560 */
1665object * 1561object *
1666maptile::pick_random_object () const 1562maptile::pick_random_object (rand_gen &gen) const
1667{ 1563{
1668 /* while returning a null object will result in a crash, that 1564 /* while returning a null object will result in a crash, that
1669 * is actually preferable to an infinite loop. That is because 1565 * is actually preferable to an infinite loop. That is because
1670 * most servers will automatically restart in case of crash. 1566 * most servers will automatically restart in case of crash.
1671 * Change the logic on getting the random space - shouldn't make 1567 * Change the logic on getting the random space - shouldn't make
1672 * any difference, but this seems clearer to me. 1568 * any difference, but this seems clearer to me.
1673 */ 1569 */
1674 for (int i = 1000; --i;) 1570 for (int i = 1000; --i;)
1675 { 1571 {
1676 object *pick = at (rndm (width), rndm (height)).bot; 1572 object *pick = at (gen (width), gen (height)).bot;
1677 1573
1678 // do not prefer big monsters just because they are big. 1574 // do not prefer big monsters just because they are big.
1679 if (pick && pick->head_ () == pick) 1575 if (pick && pick->is_head ())
1680 return pick->head_ (); 1576 return pick->head_ ();
1681 } 1577 }
1682 1578
1683 // instead of crashing in the unlikely(?) case, try to return *something* 1579 // instead of crashing in the unlikely(?) case, try to return *something*
1684 return get_archetype ("blocked"); 1580 return archetype::find ("bug");
1685} 1581}
1686 1582
1583void
1584maptile::play_sound (faceidx sound, int x, int y) const
1585{
1586 if (!sound)
1587 return;
1588
1589 for_all_players_on_map (pl, this)
1590 if (client *ns = pl->ns)
1591 {
1592 int dx = x - pl->ob->x;
1593 int dy = y - pl->ob->y;
1594
1595 int distance = idistance (dx, dy);
1596
1597 if (distance <= MAX_SOUND_DISTANCE)
1598 ns->play_sound (sound, dx, dy);
1599 }
1600}
1601
1602void
1603maptile::say_msg (const char *msg, int x, int y) const
1604{
1605 for_all_players (pl)
1606 if (client *ns = pl->ns)
1607 {
1608 int dx = x - pl->ob->x;
1609 int dy = y - pl->ob->y;
1610
1611 int distance = idistance (dx, dy);
1612
1613 if (distance <= MAX_SOUND_DISTANCE)
1614 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1615 }
1616}
1617
1618static void
1619split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1620{
1621 // clip to map to the left
1622 if (x0 < 0)
1623 {
1624 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1625 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1626
1627 if (x1 < 0) // entirely to the left
1628 return;
1629
1630 x0 = 0;
1631 }
1632
1633 // clip to map to the right
1634 if (x1 > m->width)
1635 {
1636 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1637 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1638
1639 if (x0 > m->width) // entirely to the right
1640 return;
1641
1642 x1 = m->width;
1643 }
1644
1645 // clip to map above
1646 if (y0 < 0)
1647 {
1648 if (maptile *tile = m->tile_available (TILE_UP, 1))
1649 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1650
1651 if (y1 < 0) // entirely above
1652 return;
1653
1654 y0 = 0;
1655 }
1656
1657 // clip to map below
1658 if (y1 > m->height)
1659 {
1660 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1661 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1662
1663 if (y0 > m->height) // entirely below
1664 return;
1665
1666 y1 = m->height;
1667 }
1668
1669 // if we get here, the rect is within the current map
1670 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1671
1672 r->m = m;
1673 r->x0 = x0;
1674 r->y0 = y0;
1675 r->x1 = x1;
1676 r->y1 = y1;
1677 r->dx = dx;
1678 r->dy = dy;
1679}
1680
1681maprect *
1682maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1683{
1684 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1685 buf.clear ();
1686
1687 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1688
1689 // add end marker
1690 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1691 r->m = 0;
1692
1693 return (maprect *)buf.linearise ();
1694}
1695

Diff Legend

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