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.95 by root, Thu Mar 15 13:19:37 2007 UTC vs.
Revision 1.164 by root, Fri Oct 16 01:19:12 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,2009 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 {
119 bool block = OB_MOVE_BLOCK (ob, tmp);
189 120
190 /* This must be before the checks below. Code for inventory checkers. */ 121 /* This must be before the checks below. Code for inventory checkers. */
191 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) 122 if (block && tmp->type == CHECK_INV)
192 { 123 {
124 bool have = check_inv_recursive (ob, tmp);
125
193 /* If last_sp is set, the player/monster needs an object, 126 /* 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 127 * so we check for it. If they don't have it, they can't
195 * pass through this space. 128 * pass through this space.
196 */ 129 */
197 if (tmp->last_sp) 130 if (tmp->last_sp)
198 { 131 {
199 if (check_inv_recursive (ob, tmp) == NULL) 132 if (!have)
200 return 1; 133 return 1;
201 else
202 continue;
203 } 134 }
204 else 135 else
205 { 136 {
206 /* In this case, the player must not have the object - 137 /* In this case, the player must not have the object -
207 * if they do, they can't pass through. 138 * if they do, they can't pass through.
208 */ 139 */
209 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ 140 if (have)
210 return 1; 141 return 1;
211 else
212 continue;
213 } 142 }
214 } /* if check_inv */ 143 }
144 else if (block && tmp->type == T_MATCH)
145 {
146 //TODO
147 }
215 else 148 else
216 { 149 {
217 /* Broke apart a big nasty if into several here to make 150 /* Broke apart a big nasty if into several here to make
218 * this more readable. first check - if the space blocks 151 * this more readable. first check - if the space blocks
219 * movement, can't move here. 152 * movement, can't move here.
220 * second - if a monster, can't move there, unles it is a 153 * second - if a monster, can't move there, unless it is a
221 * hidden dm 154 * dm.
222 */ 155 */
223 if (OB_MOVE_BLOCK (ob, tmp)) 156 if (block)
224 return 1; 157 return 1;
225 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && 158
226 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) 159 if (tmp->flag [FLAG_ALIVE]
160 && tmp->head_ () != ob
161 && tmp != ob
162 && tmp->type != DOOR
163 && !tmp->flag [FLAG_WIZ])
227 return 1; 164 return 1;
228 } 165 }
229
230 } 166 }
167
231 return 0; 168 return 0;
232} 169}
233 170
234/* 171/*
235 * Returns true if the given object can't fit in the given spot. 172 * 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, 173 * spot. This is meant for multi space objects - for single space objecs,
237 * just calling get_map_blocked and checking that against movement type 174 * just calling get_map_blocked and checking that against movement type
238 * of object. This function goes through all the parts of the 175 * of object. This function goes through all the parts of the multipart
239 * multipart object and makes sure they can be inserted. 176 * object and makes sure they can be inserted.
240 * 177 *
241 * While this doesn't call out of map, the get_map_flags does. 178 * While this doesn't call out of map, the get_map_flags does.
242 * 179 *
243 * This function has been used to deprecate arch_out_of_map - 180 * This function has been used to deprecate arch_out_of_map -
244 * this function also does that check, and since in most cases, 181 * this function also does that check, and since in most cases,
… …
255 * 192 *
256 * Note this used to be arch_blocked, but with new movement 193 * Note this used to be arch_blocked, but with new movement
257 * code, we need to have actual object to check its move_type 194 * code, we need to have actual object to check its move_type
258 * against the move_block values. 195 * against the move_block values.
259 */ 196 */
260int 197bool
261ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 198object::blocked (maptile *m, int x, int y) const
262{ 199{
263 archetype *tmp; 200 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 } 201 {
202 mapxy pos (m, x + tmp->x, y + tmp->y);
277 203
278 for (tmp = ob->arch; tmp; tmp = tmp->more) 204 if (!pos.normalise ())
279 { 205 return 1;
280 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
281 206
282 if (flag & P_OUT_OF_MAP) 207 mapspace &ms = *pos;
283 return P_OUT_OF_MAP; 208
284 if (flag & P_IS_ALIVE) 209 if (ms.flags () & P_IS_ALIVE)
285 return P_IS_ALIVE; 210 return 1;
286 211
287 mapspace &ms = m1->at (sx, sy); 212 /* However, often ob doesn't have any move type
288 213 * (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. 214 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
292 */ 215 */
293
294 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 216 if (!move_type && ms.move_block != MOVE_ALL)
295 continue; 217 continue;
296 218
297 /* Note it is intentional that we check ob - the movement type of the 219 /* Note it is intentional that we check ob - the movement type of the
298 * head of the object should correspond for the entire object. 220 * head of the object should correspond for the entire object.
299 */ 221 */
300 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 222 if (ms.blocks (move_type))
301 return P_NO_PASS; 223 return 1;
302 } 224 }
303 225
304 return 0; 226 return 0;
305} 227}
306 228
… …
324 246
325 insert_ob_in_ob (tmp, container); 247 insert_ob_in_ob (tmp, container);
326 tmp = next; 248 tmp = next;
327 } 249 }
328 250
329 /* sum_weight will go through and calculate what all the containers are 251 // go through and calculate what all the containers are carrying.
330 * carrying. 252 //TODO: remove
331 */ 253 container->update_weight ();
332 sum_weight (container);
333} 254}
334 255
335void 256void
336maptile::set_object_flag (int flag, int value) 257maptile::set_object_flag (int flag, int value)
337{ 258{
… …
341 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 262 for (mapspace *ms = spaces + size (); ms-- > spaces; )
342 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 263 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
343 tmp->flag [flag] = value; 264 tmp->flag [flag] = value;
344} 265}
345 266
267void
268maptile::post_load_original ()
269{
270 if (!spaces)
271 return;
272
273 set_object_flag (FLAG_OBJ_ORIGINAL);
274
275 for (mapspace *ms = spaces + size (); ms-- > spaces; )
276 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
277 INVOKE_OBJECT (RESET, tmp);
278}
279
346/* link_multipart_objects go through all the objects on the map looking 280/* 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 281 * 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 282 * 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 283 * they are saved).
350 * the more sections and not re-add sections for them.
351 */ 284 */
352void 285void
353maptile::link_multipart_objects () 286maptile::link_multipart_objects ()
354{ 287{
355 if (!spaces) 288 if (!spaces)
356 return; 289 return;
357 290
358 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 291 for (mapspace *ms = spaces + size (); ms-- > spaces; )
359 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 292 {
293 object *op = ms->bot;
294 while (op)
360 { 295 {
361 /* already multipart - don't do anything more */ 296 /* already multipart - don't do anything more */
362 if (!tmp->head && !tmp->more) 297 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 { 298 {
373 op = arch_to_object (at); 299 op->remove ();
300 op->expand_tail ();
374 301
375 /* update x,y coordinates */ 302 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
376 op->x += tmp->x; 303 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
377 op->y += tmp->y; 304 // 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); 305 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
306
307 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
308 // so we have to reset the iteration through the mapspace
390 } 309 }
310 else
311 op = op->above;
391 } 312 }
392 } 313 }
393} 314}
394 315
395/* 316/*
396 * Loads (ands parses) the objects into a given map from the specified 317 * Loads (ands parses) the objects into a given map from the specified
397 * file pointer. 318 * file pointer.
… …
399bool 320bool
400maptile::_load_objects (object_thawer &f) 321maptile::_load_objects (object_thawer &f)
401{ 322{
402 for (;;) 323 for (;;)
403 { 324 {
404 coroapi::cede_every (1000); // cede once in a while 325 coroapi::cede_to_tick (); // cede once in a while
405 326
406 switch (f.kw) 327 switch (f.kw)
407 { 328 {
408 case KW_arch: 329 case KW_arch:
409 if (object *op = object::read (f, this)) 330 if (object *op = object::read (f, this))
410 { 331 {
332 // TODO: why?
411 if (op->inv) 333 if (op->inv)
412 sum_weight (op); 334 op->update_weight ();
413 335
414 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 336 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
337 {
338 // we insert manually because
339 // a) its way faster
340 // b) we remove manually, too, and there are good reasons for that
341 // c) it's correct
342 mapspace &ms = at (op->x, op->y);
343
344 op->flag [FLAG_REMOVED] = false;
345
346 op->above = 0;
347 op->below = ms.top;
348
349 *(ms.top ? &ms.top->above : &ms.bot) = op;
350
351 ms.top = op;
352 ms.flags_ = 0;
353 }
354 else
355 {
356 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
357 op->destroy ();
358 }
415 } 359 }
416 360
417 continue; 361 continue;
418 362
419 case KW_EOF: 363 case KW_EOF:
… …
432} 376}
433 377
434void 378void
435maptile::activate () 379maptile::activate ()
436{ 380{
437 if (!spaces) 381 if (spaces)
438 return;
439
440 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 382 for (mapspace *ms = spaces + size (); ms-- > spaces; )
441 for (object *op = ms->bot; op; op = op->above) 383 for (object *op = ms->bot; op; op = op->above)
442 op->activate_recursive (); 384 op->activate_recursive ();
443} 385}
444 386
445void 387void
446maptile::deactivate () 388maptile::deactivate ()
447{ 389{
448 if (!spaces) 390 if (spaces)
449 return;
450
451 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 391 for (mapspace *ms = spaces + size (); ms-- > spaces; )
452 for (object *op = ms->bot; op; op = op->above) 392 for (object *op = ms->bot; op; op = op->above)
453 op->deactivate_recursive (); 393 op->deactivate_recursive ();
454} 394}
455 395
456bool 396bool
457maptile::_save_objects (object_freezer &f, int flags) 397maptile::_save_objects (object_freezer &f, int flags)
458{ 398{
459 static int cede_count = 0; 399 coroapi::cede_to_tick ();
460 400
461 if (flags & IO_HEADER) 401 if (flags & IO_HEADER)
462 _save_header (f); 402 _save_header (f);
463 403
464 if (!spaces) 404 if (!spaces)
465 return false; 405 return false;
466 406
467 for (int i = 0; i < size (); ++i) 407 for (int i = 0; i < size (); ++i)
468 { 408 {
469#if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D
470 if (cede_count >= 500)
471 {
472 cede_count = 0;
473 coroapi::cede ();
474 }
475#endif
476
477 int unique = 0; 409 bool unique = 0;
410
478 for (object *op = spaces [i].bot; op; op = op->above) 411 for (object *op = spaces [i].bot; op; op = op->above)
479 { 412 {
480 // count per-object, but cede only when modification-safe
481 cede_count++;
482
483 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 413 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
484 unique = 1;
485 414
486 if (!op->can_map_save ()) 415 if (expect_false (!op->can_map_save ()))
487 continue; 416 continue;
488 417
489 if (unique || op->flag [FLAG_UNIQUE]) 418 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
490 { 419 {
491 if (flags & IO_UNIQUES) 420 if (flags & IO_UNIQUES)
492 op->write (f); 421 op->write (f);
493 } 422 }
494 else if (flags & IO_OBJECTS) 423 else if (expect_true (flags & IO_OBJECTS))
495 op->write (f); 424 op->write (f);
496 } 425 }
497 } 426 }
498 427
428 coroapi::cede_to_tick ();
429
499 return true; 430 return true;
500}
501
502bool
503maptile::_load_objects (const char *path, bool skip_header)
504{
505 object_thawer f (path);
506
507 if (!f)
508 return false;
509
510 f.next ();
511
512 if (skip_header)
513 for (;;)
514 {
515 keyword kw = f.kw;
516 f.skip ();
517 if (kw == KW_end)
518 break;
519 }
520
521 return _load_objects (f);
522} 431}
523 432
524bool 433bool
525maptile::_save_objects (const char *path, int flags) 434maptile::_save_objects (const char *path, int flags)
526{ 435{
… …
657 return items; 566 return items;
658} 567}
659 568
660/* opposite of parse string, this puts the string that was originally fed in to 569/* opposite of parse string, this puts the string that was originally fed in to
661 * the map (or something equivilent) into output_string. */ 570 * the map (or something equivilent) into output_string. */
662static void 571static const char *
663print_shop_string (maptile *m, char *output_string) 572print_shop_string (maptile *m)
664{ 573{
665 int i; 574 static dynbuf_text buf; buf.clear ();
666 char tmp[MAX_BUF];
667 575
668 strcpy (output_string, "");
669 for (i = 0; i < m->shopitems[0].index; i++) 576 for (int i = 0; i < m->shopitems[0].index; i++)
670 { 577 {
671 if (m->shopitems[i].typenum) 578 if (m->shopitems[i].typenum)
672 { 579 {
673 if (m->shopitems[i].strength) 580 if (m->shopitems[i].strength)
674 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 581 buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
675 else 582 else
676 sprintf (tmp, "%s;", m->shopitems[i].name); 583 buf.printf ("%s;", m->shopitems[i].name);
677 } 584 }
678 else 585 else
679 { 586 {
680 if (m->shopitems[i].strength) 587 if (m->shopitems[i].strength)
681 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 588 buf.printf ("*:%d;", m->shopitems[i].strength);
682 else 589 else
683 sprintf (tmp, "*"); 590 buf.printf ("*");
684 } 591 }
685
686 strcat (output_string, tmp);
687 } 592 }
593
594 return buf;
688} 595}
689 596
690/* This loads the header information of the map. The header 597/* This loads the header information of the map. The header
691 * contains things like difficulty, size, timeout, etc. 598 * contains things like difficulty, size, timeout, etc.
692 * this used to be stored in the map object, but with the 599 * this used to be stored in the map object, but with the
… …
701bool 608bool
702maptile::_load_header (object_thawer &thawer) 609maptile::_load_header (object_thawer &thawer)
703{ 610{
704 for (;;) 611 for (;;)
705 { 612 {
706 keyword kw = thawer.get_kv ();
707
708 switch (kw) 613 switch (thawer.kw)
709 { 614 {
710 case KW_msg: 615 case KW_msg:
711 thawer.get_ml (KW_endmsg, msg); 616 thawer.get_ml (KW_endmsg, msg);
712 break; 617 break;
713 618
… …
745 case KW_winddir: thawer.get (winddir); break; 650 case KW_winddir: thawer.get (winddir); break;
746 case KW_sky: thawer.get (sky); break; 651 case KW_sky: thawer.get (sky); break;
747 652
748 case KW_per_player: thawer.get (per_player); break; 653 case KW_per_player: thawer.get (per_player); break;
749 case KW_per_party: thawer.get (per_party); break; 654 case KW_per_party: thawer.get (per_party); break;
655 case KW_no_reset: thawer.get (no_reset); break;
656 case KW_no_drop: thawer.get (no_drop); break;
750 657
751 case KW_region: default_region = region::find (thawer.get_str ()); break; 658 case KW_region: default_region = region::find (thawer.get_str ()); break;
752 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 659 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
753 660
754 // old names new names 661 // old names new names
… …
765 case KW_tile_path_1: thawer.get (tile_path [0]); break; 672 case KW_tile_path_1: thawer.get (tile_path [0]); break;
766 case KW_tile_path_2: thawer.get (tile_path [1]); break; 673 case KW_tile_path_2: thawer.get (tile_path [1]); break;
767 case KW_tile_path_3: thawer.get (tile_path [2]); break; 674 case KW_tile_path_3: thawer.get (tile_path [2]); break;
768 case KW_tile_path_4: thawer.get (tile_path [3]); break; 675 case KW_tile_path_4: thawer.get (tile_path [3]); break;
769 676
677 case KW_ERROR:
678 set_key_text (thawer.kw_str, thawer.value);
679 break;
680
770 case KW_end: 681 case KW_end:
682 thawer.next ();
771 return true; 683 return true;
772 684
773 default: 685 default:
774 if (!thawer.parse_error ("map", 0)) 686 if (!thawer.parse_error ("map", 0))
775 return false; 687 return false;
776 break; 688 break;
777 } 689 }
690
691 thawer.next ();
778 } 692 }
779 693
780 abort (); 694 abort ();
781}
782
783bool
784maptile::_load_header (const char *path)
785{
786 object_thawer thawer (path);
787
788 if (!thawer)
789 return false;
790
791 return _load_header (thawer);
792} 695}
793 696
794/****************************************************************************** 697/******************************************************************************
795 * This is the start of unique map handling code 698 * This is the start of unique map handling code
796 *****************************************************************************/ 699 *****************************************************************************/
… …
807 object *above = op->above; 710 object *above = op->above;
808 711
809 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 712 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
810 unique = 1; 713 unique = 1;
811 714
812 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 715 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
813 {
814 op->destroy_inv (false);
815 op->destroy (); 716 op->destroy ();
816 }
817 717
818 op = above; 718 op = above;
819 } 719 }
820 } 720 }
821} 721}
… …
831 if (name) MAP_OUT (name); 731 if (name) MAP_OUT (name);
832 MAP_OUT (swap_time); 732 MAP_OUT (swap_time);
833 MAP_OUT (reset_time); 733 MAP_OUT (reset_time);
834 MAP_OUT (reset_timeout); 734 MAP_OUT (reset_timeout);
835 MAP_OUT (fixed_resettime); 735 MAP_OUT (fixed_resettime);
736 MAP_OUT (no_reset);
737 MAP_OUT (no_drop);
836 MAP_OUT (difficulty); 738 MAP_OUT (difficulty);
837
838 if (default_region) MAP_OUT2 (region, default_region->name); 739 if (default_region) MAP_OUT2 (region, default_region->name);
839 740
840 if (shopitems) 741 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
841 {
842 char shop[MAX_BUF];
843 print_shop_string (this, shop);
844 MAP_OUT2 (shopitems, shop);
845 }
846
847 MAP_OUT (shopgreed); 742 MAP_OUT (shopgreed);
848 MAP_OUT (shopmin); 743 MAP_OUT (shopmin);
849 MAP_OUT (shopmax); 744 MAP_OUT (shopmax);
850 if (shoprace) MAP_OUT (shoprace); 745 if (shoprace) MAP_OUT (shoprace);
746
851 MAP_OUT (darkness); 747 MAP_OUT (darkness);
852 MAP_OUT (width); 748 MAP_OUT (width);
853 MAP_OUT (height); 749 MAP_OUT (height);
854 MAP_OUT (enter_x); 750 MAP_OUT (enter_x);
855 MAP_OUT (enter_y); 751 MAP_OUT (enter_y);
… …
894 * Remove and free all objects in the given map. 790 * Remove and free all objects in the given map.
895 */ 791 */
896void 792void
897maptile::clear () 793maptile::clear ()
898{ 794{
899 sfree (regions, size ()), regions = 0;
900 free (regionmap), regionmap = 0;
901
902 if (spaces) 795 if (spaces)
903 { 796 {
904 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 797 for (mapspace *ms = spaces + size (); ms-- > spaces; )
905 while (object *op = ms->bot) 798 while (object *op = ms->bot)
906 { 799 {
800 // manually remove, as to not trigger anything
801 if (ms->bot = op->above)
802 ms->bot->below = 0;
803
804 op->flag [FLAG_REMOVED] = true;
805
806 object *head = op->head_ ();
907 if (op->head) 807 if (op == head)
908 op = op->head;
909
910 op->destroy_inv (false);
911 op->destroy (); 808 op->destroy ();
809 else if (head->map != op->map)
810 {
811 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
812 head->destroy ();
813 }
912 } 814 }
913 815
914 sfree (spaces, size ()), spaces = 0; 816 sfree0 (spaces, size ());
915 } 817 }
916 818
917 if (buttons) 819 if (buttons)
918 free_objectlinkpt (buttons), buttons = 0; 820 free_objectlinkpt (buttons), buttons = 0;
821
822 sfree0 (regions, size ());
823 delete [] regionmap; regionmap = 0;
919} 824}
920 825
921void 826void
922maptile::clear_header () 827maptile::clear_header ()
923{ 828{
… …
955 attachable::do_destroy (); 860 attachable::do_destroy ();
956 861
957 clear (); 862 clear ();
958} 863}
959 864
960/* 865/* decay and destroy perishable items in a map */
961 * Updates every button on the map (by calling update_button() for them).
962 */
963void 866void
964maptile::update_buttons () 867maptile::do_decay_objects ()
965{ 868{
966 for (oblinkpt *obp = buttons; obp; obp = obp->next) 869 if (!spaces)
967 for (objectlink *ol = obp->link; ol; ol = ol->next) 870 return;
871
872 for (mapspace *ms = spaces + size (); ms-- > spaces; )
873 for (object *above, *op = ms->bot; op; op = above)
968 { 874 {
969 if (!ol->ob) 875 above = op->above;
876
877 bool destroy = 0;
878
879 // do not decay anything above unique floor tiles (yet :)
880 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
881 break;
882
883 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
884 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
885 || QUERY_FLAG (op, FLAG_UNIQUE)
886 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
887 || QUERY_FLAG (op, FLAG_UNPAID)
888 || op->is_alive ())
889 ; // do not decay
890 else if (op->is_weapon ())
970 { 891 {
971 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", 892 op->stats.dam--;
972 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); 893 if (op->stats.dam < 0)
973 continue; 894 destroy = 1;
974 } 895 }
975 896 else if (op->is_armor ())
976 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
977 { 897 {
978 update_button (ol->ob); 898 op->stats.ac--;
979 break; 899 if (op->stats.ac < 0)
900 destroy = 1;
980 } 901 }
902 else if (op->type == FOOD)
903 {
904 op->stats.food -= rndm (5, 20);
905 if (op->stats.food < 0)
906 destroy = 1;
907 }
908 else
909 {
910 int mat = op->materials;
911
912 if (mat & M_PAPER
913 || mat & M_LEATHER
914 || mat & M_WOOD
915 || mat & M_ORGANIC
916 || mat & M_CLOTH
917 || mat & M_LIQUID
918 || (mat & M_IRON && rndm (1, 5) == 1)
919 || (mat & M_GLASS && rndm (1, 2) == 1)
920 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
921 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
922 || (mat & M_ICE && temp > 32))
923 destroy = 1;
924 }
925
926 /* adjust overall chance below */
927 if (destroy && rndm (0, 1))
928 op->destroy ();
981 } 929 }
982} 930}
983 931
984/* 932/*
985 * This routine is supposed to find out the difficulty of the map. 933 * This routine is supposed to find out the difficulty of the map.
986 * difficulty does not have a lot to do with character level, 934 * difficulty does not have a lot to do with character level,
987 * but does have a lot to do with treasure on the map. 935 * but does have a lot to do with treasure on the map.
988 * 936 *
989 * Difficulty can now be set by the map creature. If the value stored 937 * Difficulty can now be set by the map creator. If the value stored
990 * in the map is zero, then use this routine. Maps should really 938 * in the map is zero, then use this routine. Maps should really
991 * have a difficulty set than using this function - human calculation 939 * have a difficulty set rather than using this function - human calculation
992 * is much better than this functions guesswork. 940 * is much better than this function's guesswork.
993 */ 941 */
994int 942int
995maptile::estimate_difficulty () const 943maptile::estimate_difficulty () const
996{ 944{
997 long monster_cnt = 0; 945 long monster_cnt = 0;
… …
1009 957
1010 if (QUERY_FLAG (op, FLAG_GENERATOR)) 958 if (QUERY_FLAG (op, FLAG_GENERATOR))
1011 { 959 {
1012 total_exp += op->stats.exp; 960 total_exp += op->stats.exp;
1013 961
1014 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 962 if (archetype *at = op->other_arch)
963 {
1015 total_exp += at->clone.stats.exp * 8; 964 total_exp += at->stats.exp * 8;
1016
1017 monster_cnt++; 965 monster_cnt++;
966 }
967
968 for (object *inv = op->inv; inv; inv = inv->below)
969 {
970 total_exp += op->stats.exp * 8;
971 monster_cnt++;
972 }
1018 } 973 }
1019 } 974 }
1020 975
1021 avgexp = (double) total_exp / monster_cnt; 976 avgexp = (double) total_exp / monster_cnt;
1022 977
… …
1035 * postive values make it darker, negative make it brighter 990 * postive values make it darker, negative make it brighter
1036 */ 991 */
1037int 992int
1038maptile::change_map_light (int change) 993maptile::change_map_light (int change)
1039{ 994{
1040 int new_level = darkness + change;
1041
1042 /* Nothing to do */ 995 /* Nothing to do */
1043 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 996 if (!change)
1044 return 0; 997 return 0;
1045 998
1046 /* inform all players on the map */ 999 /* inform all players on the map */
1047 if (change > 0) 1000 if (change > 0)
1048 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1001 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1049 else 1002 else
1050 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1003 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1051 1004
1052 /* Do extra checking. since darkness is a unsigned value, 1005 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1053 * we need to be extra careful about negative values.
1054 * In general, the checks below are only needed if change
1055 * is not +/-1
1056 */
1057 if (new_level < 0)
1058 darkness = 0;
1059 else if (new_level >= MAX_DARKNESS)
1060 darkness = MAX_DARKNESS;
1061 else
1062 darkness = new_level;
1063 1006
1064 /* All clients need to get re-updated for the change */ 1007 /* All clients need to get re-updated for the change */
1065 update_all_map_los (this); 1008 update_all_map_los (this);
1009
1066 return 1; 1010 return 1;
1067} 1011}
1068 1012
1069/* 1013/*
1070 * This function updates various attributes about a specific space 1014 * This function updates various attributes about a specific space
… …
1073 * through, etc) 1017 * through, etc)
1074 */ 1018 */
1075void 1019void
1076mapspace::update_ () 1020mapspace::update_ ()
1077{ 1021{
1078 object *tmp, *last = 0; 1022 object *last = 0;
1079 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1023 uint8 flags = P_UPTODATE, anywhere = 0;
1024 sint8 light = 0;
1080 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1025 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1081 1026
1082 //object *middle = 0; 1027 //object *middle = 0;
1083 //object *top = 0; 1028 //object *top = 0;
1084 //object *floor = 0; 1029 //object *floor = 0;
1085 // this seems to generate better code than using locals, above 1030 // this seems to generate better code than using locals, above
1086 object *&top = faces_obj[0] = 0; 1031 object *&top = faces_obj[0] = 0;
1087 object *&middle = faces_obj[1] = 0; 1032 object *&middle = faces_obj[1] = 0;
1088 object *&floor = faces_obj[2] = 0; 1033 object *&floor = faces_obj[2] = 0;
1089 1034
1090 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1035 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1091 { 1036 {
1092 /* This could be made additive I guess (two lights better than 1037 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1093 * one). But if so, it shouldn't be a simple additive - 2
1094 * light bulbs do not illuminate twice as far as once since
1095 * it is a dissapation factor that is cubed.
1096 */
1097 if (tmp->glow_radius > light)
1098 light = tmp->glow_radius; 1038 light += tmp->glow_radius;
1099 1039
1100 /* This call is needed in order to update objects the player 1040 /* This call is needed in order to update objects the player
1101 * is standing in that have animations (ie, grass, fire, etc). 1041 * is standing in that have animations (ie, grass, fire, etc).
1102 * However, it also causes the look window to be re-drawn 1042 * However, it also causes the look window to be re-drawn
1103 * 3 times each time the player moves, because many of the 1043 * 3 times each time the player moves, because many of the
… …
1122 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1062 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1123 { 1063 {
1124 middle = tmp; 1064 middle = tmp;
1125 anywhere = 1; 1065 anywhere = 1;
1126 } 1066 }
1067
1127 /* Find the highest visible face around. If equal 1068 /* Find the highest visible face around. If equal
1128 * visibilities, we still want the one nearer to the 1069 * visibilities, we still want the one nearer to the
1129 * top 1070 * top
1130 */ 1071 */
1131 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) 1072 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
… …
1150 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1091 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1151 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1092 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1152 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1093 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1153 } 1094 }
1154 1095
1155 this->light = light; 1096 this->light = min (light, MAX_LIGHT_RADIUS);
1156 this->flags_ = flags; 1097 this->flags_ = flags;
1157 this->move_block = move_block & ~move_allow; 1098 this->move_block = move_block & ~move_allow;
1158 this->move_on = move_on; 1099 this->move_on = move_on;
1159 this->move_off = move_off; 1100 this->move_off = move_off;
1160 this->move_slow = move_slow; 1101 this->move_slow = move_slow;
… …
1180 * 1) top face is set, need middle to be set. 1121 * 1) top face is set, need middle to be set.
1181 * 2) middle is set, need to set top. 1122 * 2) middle is set, need to set top.
1182 * 3) neither middle or top is set - need to set both. 1123 * 3) neither middle or top is set - need to set both.
1183 */ 1124 */
1184 1125
1185 for (tmp = last; tmp; tmp = tmp->below) 1126 for (object *tmp = last; tmp; tmp = tmp->below)
1186 { 1127 {
1187 /* Once we get to a floor, stop, since we already have a floor object */ 1128 /* Once we get to a floor, stop, since we already have a floor object */
1188 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1129 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1189 break; 1130 break;
1190 1131
… …
1242 vol += op->volume (); 1183 vol += op->volume ();
1243 1184
1244 return vol; 1185 return vol;
1245} 1186}
1246 1187
1247/* this updates the orig_map->tile_map[tile_num] value after finding 1188maptile *
1248 * the map. It also takes care of linking back the freshly found 1189maptile::tile_available (int dir, bool load)
1249 * maps tile_map values if it tiles back to this one. It returns
1250 * the value of orig_map->tile_map[tile_num].
1251 */
1252static inline maptile *
1253find_and_link (maptile *orig_map, int tile_num)
1254{ 1190{
1255 maptile *mp = orig_map->tile_map [tile_num]; 1191 if (tile_path[dir])
1256
1257 if (!mp)
1258 {
1259 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1260
1261 if (!mp)
1262 {
1263 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1264 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1265 &orig_map->tile_path[tile_num], &orig_map->path);
1266 mp = new maptile (1, 1);
1267 mp->alloc ();
1268 mp->in_memory = MAP_IN_MEMORY;
1269 }
1270 } 1192 {
1193 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1194 return tile_map[dir];
1271 1195
1272 int dest_tile = (tile_num + 2) % 4; 1196 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1197 return tile_map[dir];
1198 }
1273 1199
1274 orig_map->tile_map [tile_num] = mp;
1275
1276 // optimisation: back-link map to origin map if euclidean
1277 //TODO: non-euclidean maps MUST GO
1278 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1279 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1280
1281 return mp; 1200 return 0;
1282}
1283
1284static inline void
1285load_and_link (maptile *orig_map, int tile_num)
1286{
1287 find_and_link (orig_map, tile_num)->load_sync ();
1288} 1201}
1289 1202
1290/* this returns TRUE if the coordinates (x,y) are out of 1203/* this returns TRUE if the coordinates (x,y) are out of
1291 * map m. This function also takes into account any 1204 * map m. This function also takes into account any
1292 * tiling considerations, loading adjacant maps as needed. 1205 * tiling considerations, loading adjacant maps as needed.
… …
1305 if (!m) 1218 if (!m)
1306 return 0; 1219 return 0;
1307 1220
1308 if (x < 0) 1221 if (x < 0)
1309 { 1222 {
1310 if (!m->tile_path[3]) 1223 if (!m->tile_available (3))
1311 return 1; 1224 return 1;
1312 1225
1313 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1314 find_and_link (m, 3);
1315
1316 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1226 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1317 } 1227 }
1318 1228
1319 if (x >= m->width) 1229 if (x >= m->width)
1320 { 1230 {
1321 if (!m->tile_path[1]) 1231 if (!m->tile_available (1))
1322 return 1; 1232 return 1;
1323 1233
1324 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1325 find_and_link (m, 1);
1326
1327 return out_of_map (m->tile_map[1], x - m->width, y); 1234 return out_of_map (m->tile_map[1], x - m->width, y);
1328 } 1235 }
1329 1236
1330 if (y < 0) 1237 if (y < 0)
1331 { 1238 {
1332 if (!m->tile_path[0]) 1239 if (!m->tile_available (0))
1333 return 1; 1240 return 1;
1334 1241
1335 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1336 find_and_link (m, 0);
1337
1338 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1242 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1339 } 1243 }
1340 1244
1341 if (y >= m->height) 1245 if (y >= m->height)
1342 { 1246 {
1343 if (!m->tile_path[2]) 1247 if (!m->tile_available (2))
1344 return 1; 1248 return 1;
1345
1346 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1347 find_and_link (m, 2);
1348 1249
1349 return out_of_map (m->tile_map[2], x, y - m->height); 1250 return out_of_map (m->tile_map[2], x, y - m->height);
1350 } 1251 }
1351 1252
1352 /* Simple case - coordinates are within this local 1253 /* Simple case - coordinates are within this local
… …
1366maptile * 1267maptile *
1367maptile::xy_find (sint16 &x, sint16 &y) 1268maptile::xy_find (sint16 &x, sint16 &y)
1368{ 1269{
1369 if (x < 0) 1270 if (x < 0)
1370 { 1271 {
1371 if (!tile_path[3]) 1272 if (!tile_available (3))
1372 return 0; 1273 return 0;
1373 1274
1374 find_and_link (this, 3);
1375 x += tile_map[3]->width; 1275 x += tile_map[3]->width;
1376 return tile_map[3]->xy_find (x, y); 1276 return tile_map[3]->xy_find (x, y);
1377 } 1277 }
1378 1278
1379 if (x >= width) 1279 if (x >= width)
1380 { 1280 {
1381 if (!tile_path[1]) 1281 if (!tile_available (1))
1382 return 0; 1282 return 0;
1383 1283
1384 find_and_link (this, 1);
1385 x -= width; 1284 x -= width;
1386 return tile_map[1]->xy_find (x, y); 1285 return tile_map[1]->xy_find (x, y);
1387 } 1286 }
1388 1287
1389 if (y < 0) 1288 if (y < 0)
1390 { 1289 {
1391 if (!tile_path[0]) 1290 if (!tile_available (0))
1392 return 0; 1291 return 0;
1393 1292
1394 find_and_link (this, 0);
1395 y += tile_map[0]->height; 1293 y += tile_map[0]->height;
1396 return tile_map[0]->xy_find (x, y); 1294 return tile_map[0]->xy_find (x, y);
1397 } 1295 }
1398 1296
1399 if (y >= height) 1297 if (y >= height)
1400 { 1298 {
1401 if (!tile_path[2]) 1299 if (!tile_available (2))
1402 return 0; 1300 return 0;
1403 1301
1404 find_and_link (this, 2);
1405 y -= height; 1302 y -= height;
1406 return tile_map[2]->xy_find (x, y); 1303 return tile_map[2]->xy_find (x, y);
1407 } 1304 }
1408 1305
1409 /* Simple case - coordinates are within this local 1306 /* Simple case - coordinates are within this local
… …
1420adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1317adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1421{ 1318{
1422 if (!map1 || !map2) 1319 if (!map1 || !map2)
1423 return 0; 1320 return 0;
1424 1321
1425 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded 1322 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1426 //fix: compare paths instead (this is likely faster, too!) 1323 //fix: compare paths instead (this is likely faster, too!)
1427 if (map1 == map2) 1324 if (map1 == map2)
1428 { 1325 {
1429 *dx = 0; 1326 *dx = 0;
1430 *dy = 0; 1327 *dy = 0;
… …
1612 else 1509 else
1613 { 1510 {
1614 retval->distance_x += op2->x - x; 1511 retval->distance_x += op2->x - x;
1615 retval->distance_y += op2->y - y; 1512 retval->distance_y += op2->y - y;
1616 1513
1617 retval->part = NULL; 1514 retval->part = 0;
1618 retval->distance = idistance (retval->distance_x, retval->distance_y); 1515 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1619 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1516 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1620 } 1517 }
1621} 1518}
1622 1519
1623/* Returns true of op1 and op2 are effectively on the same map 1520/* Returns true of op1 and op2 are effectively on the same map
… …
1637} 1534}
1638 1535
1639object * 1536object *
1640maptile::insert (object *op, int x, int y, object *originator, int flags) 1537maptile::insert (object *op, int x, int y, object *originator, int flags)
1641{ 1538{
1642 if (!op->flag [FLAG_REMOVED])
1643 op->remove ();
1644
1645 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1539 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1646} 1540}
1647 1541
1648region * 1542region *
1649maptile::region (int x, int y) const 1543maptile::region (int x, int y) const
… …
1659 1553
1660 return ::region::default_region (); 1554 return ::region::default_region ();
1661} 1555}
1662 1556
1663/* picks a random object from a style map. 1557/* picks a random object from a style map.
1664 * Redone by MSW so it should be faster and not use static
1665 * variables to generate tables.
1666 */ 1558 */
1667object * 1559object *
1668maptile::pick_random_object () const 1560maptile::pick_random_object (rand_gen &gen) const
1669{ 1561{
1670 /* while returning a null object will result in a crash, that 1562 /* while returning a null object will result in a crash, that
1671 * is actually preferable to an infinite loop. That is because 1563 * is actually preferable to an infinite loop. That is because
1672 * most servers will automatically restart in case of crash. 1564 * most servers will automatically restart in case of crash.
1673 * Change the logic on getting the random space - shouldn't make 1565 * Change the logic on getting the random space - shouldn't make
1674 * any difference, but this seems clearer to me. 1566 * any difference, but this seems clearer to me.
1675 */ 1567 */
1676 for (int i = 1000; --i;) 1568 for (int i = 1000; --i;)
1677 { 1569 {
1678 object *pick = at (rndm (width), rndm (height)).bot; 1570 object *pick = at (gen (width), gen (height)).bot;
1679 1571
1680 // do not prefer big monsters just because they are big. 1572 // do not prefer big monsters just because they are big.
1681 if (pick && pick->head_ () == pick) 1573 if (pick && pick->is_head ())
1682 return pick->head_ (); 1574 return pick->head_ ();
1683 } 1575 }
1684 1576
1685 // instead of crashing in the unlikely(?) case, try to return *something* 1577 // instead of crashing in the unlikely(?) case, try to return *something*
1686 return get_archetype ("blocked"); 1578 return archetype::find ("bug");
1687} 1579}
1688 1580
1581void
1582maptile::play_sound (faceidx sound, int x, int y) const
1583{
1584 if (!sound)
1585 return;
1586
1587 for_all_players_on_map (pl, this)
1588 if (client *ns = pl->ns)
1589 {
1590 int dx = x - pl->ob->x;
1591 int dy = y - pl->ob->y;
1592
1593 int distance = idistance (dx, dy);
1594
1595 if (distance <= MAX_SOUND_DISTANCE)
1596 ns->play_sound (sound, dx, dy);
1597 }
1598}
1599
1600void
1601maptile::say_msg (const char *msg, int x, int y) const
1602{
1603 for_all_players (pl)
1604 if (client *ns = pl->ns)
1605 {
1606 int dx = x - pl->ob->x;
1607 int dy = y - pl->ob->y;
1608
1609 int distance = idistance (dx, dy);
1610
1611 if (distance <= MAX_SOUND_DISTANCE)
1612 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1613 }
1614}
1615
1616static void
1617split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1618{
1619 // clip to map to the left
1620 if (x0 < 0)
1621 {
1622 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1623 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1624
1625 if (x1 < 0) // entirely to the left
1626 return;
1627
1628 x0 = 0;
1629 }
1630
1631 // clip to map to the right
1632 if (x1 > m->width)
1633 {
1634 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1635 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1636
1637 if (x0 > m->width) // entirely to the right
1638 return;
1639
1640 x1 = m->width;
1641 }
1642
1643 // clip to map above
1644 if (y0 < 0)
1645 {
1646 if (maptile *tile = m->tile_available (TILE_UP, 1))
1647 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1648
1649 if (y1 < 0) // entirely above
1650 return;
1651
1652 y0 = 0;
1653 }
1654
1655 // clip to map below
1656 if (y1 > m->height)
1657 {
1658 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1659 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1660
1661 if (y0 > m->height) // entirely below
1662 return;
1663
1664 y1 = m->height;
1665 }
1666
1667 // if we get here, the rect is within the current map
1668 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1669
1670 r->m = m;
1671 r->x0 = x0;
1672 r->y0 = y0;
1673 r->x1 = x1;
1674 r->y1 = y1;
1675 r->dx = dx;
1676 r->dy = dy;
1677}
1678
1679maprect *
1680maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1681{
1682 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1683 buf.clear ();
1684
1685 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1686
1687 // add end marker
1688 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1689 r->m = 0;
1690
1691 return (maprect *)buf.linearise ();
1692}
1693

Diff Legend

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