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.62 by root, Sun Dec 31 22:23:11 2006 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 (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 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
8 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
9 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 11 * option) any later version.
11 12 *
12 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,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 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
18 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
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
20 21 *
21 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>
22*/ 23 */
23 24
24#include <global.h>
25#include <funcpoint.h>
26
27#include <loader.h>
28#include <unistd.h> 25#include <unistd.h>
29 26
27#include "global.h"
28#include "loader.h"
30#include "path.h" 29#include "path.h"
31 30
32/* 31sint8 maptile::outdoor_darkness;
33 * This makes a path absolute outside the world of Crossfire.
34 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
35 * and returns the pointer to a static array containing the result.
36 * it really should be called create_mapname
37 */
38const char *
39create_pathname (const char *name)
40{
41 static char buf[8192];
42 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
43 return buf;
44}
45
46/*
47 * This function checks if a file with the given path exists.
48 * -1 is returned if it fails, otherwise the mode of the file
49 * is returned.
50 * It tries out all the compression suffixes listed in the uncomp[] array.
51 *
52 * If prepend_dir is set, then we call create_pathname (which prepends
53 * libdir & mapdir). Otherwise, we assume the name given is fully
54 * complete.
55 * Only the editor actually cares about the writablity of this -
56 * the rest of the code only cares that the file is readable.
57 * when the editor goes away, the call to stat should probably be
58 * replaced by an access instead (similar to the windows one, but
59 * that seems to be missing the prepend_dir processing
60 */
61int
62check_path (const char *name, int prepend_dir)
63{
64 char buf[MAX_BUF];
65
66 char *endbuf;
67 struct stat statbuf;
68 int mode = 0;
69
70 if (prepend_dir)
71 strcpy (buf, create_pathname (name));
72 else
73 strcpy (buf, name);
74
75 /* old method (strchr(buf, '\0')) seemd very odd to me -
76 * this method should be equivalant and is clearer.
77 * Can not use strcat because we need to cycle through
78 * all the names.
79 */
80 endbuf = buf + strlen (buf);
81
82 if (stat (buf, &statbuf))
83 return -1;
84 if (!S_ISREG (statbuf.st_mode))
85 return (-1);
86
87 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
88 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
89 mode |= 4;
90
91 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
92 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
93 mode |= 2;
94
95 return (mode);
96}
97 32
98/* This rolls up wall, blocks_magic, blocks_view, etc, all into 33/* This rolls up wall, blocks_magic, blocks_view, etc, all into
99 * one function that just returns a P_.. value (see map.h) 34 * one function that just returns a P_.. value (see map.h)
100 * it will also do map translation for tiled maps, returning 35 * it will also do map translation for tiled maps, returning
101 * 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
… …
136 * by the caller. 71 * by the caller.
137 */ 72 */
138int 73int
139blocked_link (object *ob, maptile *m, int sx, int sy) 74blocked_link (object *ob, maptile *m, int sx, int sy)
140{ 75{
141 object *tmp;
142 int mflags, blocked;
143
144 /* 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
145 * have already checked this. 77 * have already checked this.
146 */ 78 */
147 if (OUT_OF_REAL_MAP (m, sx, sy)) 79 if (OUT_OF_REAL_MAP (m, sx, sy))
148 { 80 {
… …
151 } 83 }
152 84
153 /* 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
154 * directly. 86 * directly.
155 */ 87 */
156 mflags = m->at (sx, sy).flags (); 88 mapspace &ms = m->at (sx, sy);
157 89
158 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 90 int mflags = ms.flags ();
91 int blocked = ms.move_block;
159 92
160 /* If space is currently not blocked by anything, no need to 93 /* If space is currently not blocked by anything, no need to
161 * go further. Not true for players - all sorts of special 94 * go further. Not true for players - all sorts of special
162 * things we need to do for players. 95 * things we need to do for players.
163 */ 96 */
164 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 97 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
165 return 0; 98 return 0;
166 99
167 /* 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
168 * 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
169 * 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
170 * or another. Likewise, only if something is blocking us do we 103 * or another. Likewise, only if something is blocking us do we
171 * need to investigate if there is a special circumstance that would 104 * need to investigate if there is a special circumstance that would
172 * let the player through (inventory checkers for example) 105 * let the player through (inventory checkers for example)
173 */ 106 */
174 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 107 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
175 return 0; 108 return 0;
176 109
177 if (ob->head != NULL)
178 ob = ob->head; 110 ob = ob->head_ ();
179 111
180 /* 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
181 * 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
182 * true. If we get through the entire stack, that must mean 114 * true. If we get through the entire stack, that must mean
183 * ob is blocking it, so return 0. 115 * ob is blocking it, so return 0.
184 */ 116 */
185 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) 117 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
186 { 118 {
119 bool block = OB_MOVE_BLOCK (ob, tmp);
187 120
188 /* This must be before the checks below. Code for inventory checkers. */ 121 /* This must be before the checks below. Code for inventory checkers. */
189 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) 122 if (block && tmp->type == CHECK_INV)
190 { 123 {
124 bool have = check_inv_recursive (ob, tmp);
125
191 /* If last_sp is set, the player/monster needs an object, 126 /* If last_sp is set, the player/monster needs an object,
192 * 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
193 * pass through this space. 128 * pass through this space.
194 */ 129 */
195 if (tmp->last_sp) 130 if (tmp->last_sp)
196 { 131 {
197 if (check_inv_recursive (ob, tmp) == NULL) 132 if (!have)
198 return 1; 133 return 1;
199 else
200 continue;
201 } 134 }
202 else 135 else
203 { 136 {
204 /* In this case, the player must not have the object - 137 /* In this case, the player must not have the object -
205 * if they do, they can't pass through. 138 * if they do, they can't pass through.
206 */ 139 */
207 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ 140 if (have)
208 return 1; 141 return 1;
209 else
210 continue;
211 } 142 }
212 } /* if check_inv */ 143 }
144 else if (block && tmp->type == T_MATCH)
145 {
146 //TODO
147 }
213 else 148 else
214 { 149 {
215 /* Broke apart a big nasty if into several here to make 150 /* Broke apart a big nasty if into several here to make
216 * this more readable. first check - if the space blocks 151 * this more readable. first check - if the space blocks
217 * movement, can't move here. 152 * movement, can't move here.
218 * 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
219 * hidden dm 154 * dm.
220 */ 155 */
221 if (OB_MOVE_BLOCK (ob, tmp)) 156 if (block)
222 return 1; 157 return 1;
223 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && 158
224 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])
225 return 1; 164 return 1;
226 } 165 }
227
228 } 166 }
167
229 return 0; 168 return 0;
230} 169}
231 170
232
233/* 171/*
234 * 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
235 * This is meant for multi space objects - for single space objecs, 173 * spot. This is meant for multi space objects - for single space objecs,
236 * just calling get_map_blocked and checking that against movement type 174 * just calling get_map_blocked and checking that against movement type
237 * of object. This function goes through all the parts of the 175 * of object. This function goes through all the parts of the multipart
238 * multipart object and makes sure they can be inserted. 176 * object and makes sure they can be inserted.
239 * 177 *
240 * 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.
241 * 179 *
242 * This function has been used to deprecate arch_out_of_map - 180 * This function has been used to deprecate arch_out_of_map -
243 * this function also does that check, and since in most cases, 181 * this function also does that check, and since in most cases,
… …
254 * 192 *
255 * Note this used to be arch_blocked, but with new movement 193 * Note this used to be arch_blocked, but with new movement
256 * 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
257 * against the move_block values. 195 * against the move_block values.
258 */ 196 */
259int 197bool
260ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 198object::blocked (maptile *m, int x, int y) const
261{ 199{
262 archetype *tmp; 200 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
263 int flag;
264 maptile *m1;
265 sint16 sx, sy;
266
267 if (!ob)
268 {
269 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
270 if (flag & P_OUT_OF_MAP)
271 return P_OUT_OF_MAP;
272
273 /* don't have object, so don't know what types would block */
274 return m1->at (sx, sy).move_block;
275 } 201 {
202 mapxy pos (m, x + tmp->x, y + tmp->y);
276 203
277 for (tmp = ob->arch; tmp; tmp = tmp->more) 204 if (!pos.normalise ())
278 { 205 return 1;
279 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
280 206
281 if (flag & P_OUT_OF_MAP) 207 mapspace &ms = *pos;
282 return P_OUT_OF_MAP; 208
283 if (flag & P_IS_ALIVE) 209 if (ms.flags () & P_IS_ALIVE)
284 return P_IS_ALIVE; 210 return 1;
285 211
286 mapspace &ms = m1->at (sx, sy); 212 /* However, often ob doesn't have any move type
287 213 * (signifying non-moving objects)
288 /* find_first_free_spot() calls this function. However, often
289 * ob doesn't have any move type (when used to place exits)
290 * 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.
291 */ 215 */
292
293 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 216 if (!move_type && ms.move_block != MOVE_ALL)
294 continue; 217 continue;
295 218
296 /* 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
297 * head of the object should correspond for the entire object. 220 * head of the object should correspond for the entire object.
298 */ 221 */
299 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 222 if (ms.blocks (move_type))
300 return P_NO_PASS; 223 return 1;
301 } 224 }
302 225
303 return 0; 226 return 0;
304} 227}
305 228
… …
323 246
324 insert_ob_in_ob (tmp, container); 247 insert_ob_in_ob (tmp, container);
325 tmp = next; 248 tmp = next;
326 } 249 }
327 250
328 /* sum_weight will go through and calculate what all the containers are 251 // go through and calculate what all the containers are carrying.
329 * carrying. 252 //TODO: remove
330 */ 253 container->update_weight ();
331 sum_weight (container); 254}
255
256void
257maptile::set_object_flag (int flag, int value)
258{
259 if (!spaces)
260 return;
261
262 for (mapspace *ms = spaces + size (); ms-- > spaces; )
263 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
264 tmp->flag [flag] = value;
265}
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);
332} 278}
333 279
334/* 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
335 * 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
336 * 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
337 * they are saved). We do have to look for the old maps that did save 283 * they are saved).
338 * the more sections and not re-add sections for them.
339 */ 284 */
340void 285void
341maptile::link_multipart_objects () 286maptile::link_multipart_objects ()
342{ 287{
343 if (!spaces) 288 if (!spaces)
344 return; 289 return;
345 290
346 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 291 for (mapspace *ms = spaces + size (); ms-- > spaces; )
347 for (object *tmp = ms->bot; tmp; ) 292 {
293 object *op = ms->bot;
294 while (op)
348 { 295 {
349 object *above = tmp->above;
350
351 /* already multipart - don't do anything more */ 296 /* already multipart - don't do anything more */
352 if (!tmp->head && !tmp->more) 297 if (op->head_ () == op && !op->more && op->arch->more)
353 {
354 /* If there is nothing more to this object, this for loop
355 * won't do anything.
356 */
357 archetype *at;
358 object *last, *op;
359 for (at = tmp->arch->more, last = tmp;
360 at;
361 at = at->more, last = op)
362 { 298 {
363 op = arch_to_object (at); 299 op->remove ();
300 op->expand_tail ();
364 301
365 /* update x,y coordinates */ 302 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
366 op->x += tmp->x; 303 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
367 op->y += tmp->y; 304 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
368 op->head = tmp;
369 op->map = this;
370 last->more = op;
371 op->name = tmp->name;
372 op->title = tmp->title;
373
374 /* we could link all the parts onto tmp, and then just
375 * call insert_ob_in_map once, but the effect is the same,
376 * as insert_ob_in_map will call itself with each part, and
377 * the coding is simpler to just to it here with each part.
378 */
379 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
380 } 309 }
310 else
311 op = op->above;
381 } 312 }
382
383 tmp = above;
384 } 313 }
385} 314}
386 315
387/* 316/*
388 * 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
389 * file pointer. 318 * file pointer.
390 * mapflags is the same as we get with load_original_map
391 */ 319 */
392bool 320bool
393maptile::load_objects (object_thawer &thawer) 321maptile::_load_objects (object_thawer &f)
394{ 322{
395 int unique; 323 for (;;)
396 object *op, *prev = NULL, *last_more = NULL, *otmp;
397
398 op = object::create ();
399 op->map = this; /* To handle buttons correctly */
400
401 while (int i = load_object (thawer, op, 0))
402 { 324 {
403 /* if the archetype for the object is null, means that we 325 coroapi::cede_to_tick (); // cede once in a while
404 * got an invalid object. Don't do anything with it - the game 326
405 * or editor will not be able to do anything with it either. 327 switch (f.kw)
406 */
407 if (op->arch == NULL)
408 { 328 {
409 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 329 case KW_arch:
330 if (object *op = object::read (f, this))
331 {
332 // TODO: why?
333 if (op->inv)
334 op->update_weight ();
335
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 }
359 }
360
410 continue; 361 continue;
411 }
412 362
413 switch (i)
414 {
415 case LL_NORMAL:
416 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
417
418 if (op->inv)
419 sum_weight (op);
420
421 prev = op, last_more = op;
422 break;
423
424 case LL_MORE: 363 case KW_EOF:
425 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 364 return true;
426 op->head = prev, last_more->more = op, last_more = op; 365
366 default:
367 if (!f.parse_error ("map file"))
368 return false;
427 break; 369 break;
428 } 370 }
429 371
430 op = object::create (); 372 f.next ();
431 op->map = this;
432 }
433
434 op->destroy ();
435
436#if 0
437 for (i = 0; i < width; i++)
438 for (j = 0; j < height; j++)
439 {
440 unique = 0;
441 /* check for unique items, or unique squares */
442 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
443 {
444 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
445 unique = 1;
446
447 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
448 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
449 }
450 } 373 }
451#endif
452 374
453 return true; 375 return true;
454} 376}
455 377
456void 378void
457maptile::activate () 379maptile::activate ()
458{ 380{
459 if (!spaces) 381 if (spaces)
460 return;
461
462 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 382 for (mapspace *ms = spaces + size (); ms-- > spaces; )
463 for (object *op = ms->bot; op; op = op->above) 383 for (object *op = ms->bot; op; op = op->above)
464 op->activate_recursive (); 384 op->activate_recursive ();
465} 385}
466 386
467void 387void
468maptile::deactivate () 388maptile::deactivate ()
469{ 389{
470 if (!spaces) 390 if (spaces)
471 return;
472
473 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 391 for (mapspace *ms = spaces + size (); ms-- > spaces; )
474 for (object *op = ms->bot; op; op = op->above) 392 for (object *op = ms->bot; op; op = op->above)
475 op->deactivate_recursive (); 393 op->deactivate_recursive ();
476} 394}
477 395
478bool 396bool
479maptile::save_objects (object_freezer &freezer, int flags) 397maptile::_save_objects (object_freezer &f, int flags)
480{ 398{
399 coroapi::cede_to_tick ();
400
481 if (flags & IO_HEADER) 401 if (flags & IO_HEADER)
482 save_header (freezer); 402 _save_header (f);
483 403
484 if (!spaces) 404 if (!spaces)
485 return false; 405 return false;
486 406
487 for (int i = 0; i < size (); ++i) 407 for (int i = 0; i < size (); ++i)
488 { 408 {
489 int unique = 0; 409 bool unique = 0;
410
490 for (object *op = spaces [i].bot; op; op = op->above) 411 for (object *op = spaces [i].bot; op; op = op->above)
491 { 412 {
492 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 413 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
493 unique = 1;
494 414
495 if (!op->can_map_save ()) 415 if (expect_false (!op->can_map_save ()))
496 continue; 416 continue;
497 417
498 if (unique || op->flag [FLAG_UNIQUE]) 418 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
499 { 419 {
500 if (flags & IO_UNIQUES) 420 if (flags & IO_UNIQUES)
501 save_object (freezer, op, 1); 421 op->write (f);
502 } 422 }
503 else if (flags & IO_OBJECTS) 423 else if (expect_true (flags & IO_OBJECTS))
504 save_object (freezer, op, 1); 424 op->write (f);
505 } 425 }
506 } 426 }
507 427
428 coroapi::cede_to_tick ();
429
508 return true; 430 return true;
509} 431}
510 432
511bool 433bool
512maptile::load_objects (const char *path, bool skip_header) 434maptile::_save_objects (const char *path, int flags)
513{ 435{
514 object_thawer thawer (path); 436 object_freezer freezer;
515 437
516 if (!thawer) 438 if (!_save_objects (freezer, flags))
517 return false; 439 return false;
518 440
519 if (skip_header)
520 for (;;)
521 {
522 keyword kw = thawer.get_kv ();
523
524 if (kw == KW_end)
525 break;
526
527 thawer.skip_kv (kw);
528 }
529
530 return load_objects (thawer);
531}
532
533bool
534maptile::save_objects (const char *path, int flags)
535{
536 object_freezer freezer;
537
538 if (!save_objects (freezer, flags))
539 return false;
540
541 return freezer.save (path); 441 return freezer.save (path);
542} 442}
543 443
544maptile::maptile () 444maptile::maptile ()
545{ 445{
546 in_memory = MAP_SWAPPED; 446 in_memory = MAP_SWAPPED;
547 447
548 /* The maps used to pick up default x and y values from the 448 /* The maps used to pick up default x and y values from the
549 * map archetype. Mimic that behaviour. 449 * map archetype. Mimic that behaviour.
550 */ 450 */
551 width = 16; 451 width = 16;
552 height = 16; 452 height = 16;
553 reset_timeout = 0;
554 timeout = 300; 453 timeout = 300;
555 enter_x = 0; 454 max_nrof = 1000; // 1000 items of anything
556 enter_y = 0; 455 max_volume = 2000000; // 2m³
557} 456}
558 457
559maptile::maptile (int w, int h) 458maptile::maptile (int w, int h)
560{ 459{
561 in_memory = MAP_SWAPPED; 460 in_memory = MAP_SWAPPED;
… …
667 return items; 566 return items;
668} 567}
669 568
670/* 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
671 * the map (or something equivilent) into output_string. */ 570 * the map (or something equivilent) into output_string. */
672static void 571static const char *
673print_shop_string (maptile *m, char *output_string) 572print_shop_string (maptile *m)
674{ 573{
675 int i; 574 static dynbuf_text buf; buf.clear ();
676 char tmp[MAX_BUF];
677 575
678 strcpy (output_string, "");
679 for (i = 0; i < m->shopitems[0].index; i++) 576 for (int i = 0; i < m->shopitems[0].index; i++)
680 { 577 {
681 if (m->shopitems[i].typenum) 578 if (m->shopitems[i].typenum)
682 { 579 {
683 if (m->shopitems[i].strength) 580 if (m->shopitems[i].strength)
684 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);
685 else 582 else
686 sprintf (tmp, "%s;", m->shopitems[i].name); 583 buf.printf ("%s;", m->shopitems[i].name);
687 } 584 }
688 else 585 else
689 { 586 {
690 if (m->shopitems[i].strength) 587 if (m->shopitems[i].strength)
691 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 588 buf.printf ("*:%d;", m->shopitems[i].strength);
692 else 589 else
693 sprintf (tmp, "*"); 590 buf.printf ("*");
694 } 591 }
695
696 strcat (output_string, tmp);
697 } 592 }
593
594 return buf;
698} 595}
699 596
700/* This loads the header information of the map. The header 597/* This loads the header information of the map. The header
701 * contains things like difficulty, size, timeout, etc. 598 * contains things like difficulty, size, timeout, etc.
702 * 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
… …
707 * This could be done in lex (like the object loader), but I think 604 * This could be done in lex (like the object loader), but I think
708 * currently, there are few enough fields this is not a big deal. 605 * currently, there are few enough fields this is not a big deal.
709 * MSW 2001-07-01 606 * MSW 2001-07-01
710 */ 607 */
711bool 608bool
712maptile::load_header (object_thawer &thawer) 609maptile::_load_header (object_thawer &thawer)
713{ 610{
714 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
715 int msgpos = 0;
716 int maplorepos = 0;
717
718 for (;;) 611 for (;;)
719 { 612 {
720 keyword kw = thawer.get_kv ();
721
722 switch (kw) 613 switch (thawer.kw)
723 { 614 {
724 case KW_EOF:
725 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
726 return false;
727
728 case KW_end:
729 return true;
730
731 case KW_msg: 615 case KW_msg:
732 thawer.get_ml (KW_endmsg, msg); 616 thawer.get_ml (KW_endmsg, msg);
733 break; 617 break;
734 618
735 case KW_lore: // CF+ extension 619 case KW_lore: // CF+ extension
… …
766 case KW_winddir: thawer.get (winddir); break; 650 case KW_winddir: thawer.get (winddir); break;
767 case KW_sky: thawer.get (sky); break; 651 case KW_sky: thawer.get (sky); break;
768 652
769 case KW_per_player: thawer.get (per_player); break; 653 case KW_per_player: thawer.get (per_player); break;
770 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;
771 657
772 case KW_region: get_region_by_name (thawer.get_str ()); break; 658 case KW_region: default_region = region::find (thawer.get_str ()); break;
773 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 659 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
774 660
775 // old names new names 661 // old names new names
776 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 662 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
777 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 663 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
786 case KW_tile_path_1: thawer.get (tile_path [0]); break; 672 case KW_tile_path_1: thawer.get (tile_path [0]); break;
787 case KW_tile_path_2: thawer.get (tile_path [1]); break; 673 case KW_tile_path_2: thawer.get (tile_path [1]); break;
788 case KW_tile_path_3: thawer.get (tile_path [2]); break; 674 case KW_tile_path_3: thawer.get (tile_path [2]); break;
789 case KW_tile_path_4: thawer.get (tile_path [3]); break; 675 case KW_tile_path_4: thawer.get (tile_path [3]); break;
790 676
677 case KW_ERROR:
678 set_key_text (thawer.kw_str, thawer.value);
679 break;
680
681 case KW_end:
682 thawer.next ();
683 return true;
684
791 default: 685 default:
792 LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]); 686 if (!thawer.parse_error ("map", 0))
687 return false;
793 break; 688 break;
794 } 689 }
690
691 thawer.next ();
795 } 692 }
796 693
797 abort (); 694 abort ();
798}
799
800bool
801maptile::load_header (const char *path)
802{
803 object_thawer thawer (path);
804
805 if (!thawer)
806 return false;
807
808 return load_header (thawer);
809} 695}
810 696
811/****************************************************************************** 697/******************************************************************************
812 * This is the start of unique map handling code 698 * This is the start of unique map handling code
813 *****************************************************************************/ 699 *****************************************************************************/
… …
824 object *above = op->above; 710 object *above = op->above;
825 711
826 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))
827 unique = 1; 713 unique = 1;
828 714
829 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 715 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
830 {
831 op->destroy_inv (false);
832 op->destroy (); 716 op->destroy ();
833 }
834 717
835 op = above; 718 op = above;
836 } 719 }
837 } 720 }
838} 721}
839 722
840bool 723bool
841maptile::save_header (object_freezer &freezer) 724maptile::_save_header (object_freezer &freezer)
842{ 725{
843#define MAP_OUT(k) freezer.put (KW_ ## k, k) 726#define MAP_OUT(k) freezer.put (KW_ ## k, k)
844#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 727#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
845 728
846 MAP_OUT2 (arch, "map"); 729 MAP_OUT2 (arch, "map");
… …
848 if (name) MAP_OUT (name); 731 if (name) MAP_OUT (name);
849 MAP_OUT (swap_time); 732 MAP_OUT (swap_time);
850 MAP_OUT (reset_time); 733 MAP_OUT (reset_time);
851 MAP_OUT (reset_timeout); 734 MAP_OUT (reset_timeout);
852 MAP_OUT (fixed_resettime); 735 MAP_OUT (fixed_resettime);
736 MAP_OUT (no_reset);
737 MAP_OUT (no_drop);
853 MAP_OUT (difficulty); 738 MAP_OUT (difficulty);
854
855 if (region) MAP_OUT2 (region, region->name); 739 if (default_region) MAP_OUT2 (region, default_region->name);
856 740
857 if (shopitems) 741 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
858 {
859 char shop[MAX_BUF];
860 print_shop_string (this, shop);
861 MAP_OUT2 (shopitems, shop);
862 }
863
864 MAP_OUT (shopgreed); 742 MAP_OUT (shopgreed);
865 MAP_OUT (shopmin); 743 MAP_OUT (shopmin);
866 MAP_OUT (shopmax); 744 MAP_OUT (shopmax);
867 if (shoprace) MAP_OUT (shoprace); 745 if (shoprace) MAP_OUT (shoprace);
746
868 MAP_OUT (darkness); 747 MAP_OUT (darkness);
869 MAP_OUT (width); 748 MAP_OUT (width);
870 MAP_OUT (height); 749 MAP_OUT (height);
871 MAP_OUT (enter_x); 750 MAP_OUT (enter_x);
872 MAP_OUT (enter_y); 751 MAP_OUT (enter_y);
… …
888 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); 767 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
889 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); 768 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
890 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); 769 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
891 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); 770 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
892 771
772 freezer.put (this);
893 freezer.put (KW_end); 773 freezer.put (KW_end);
894 774
895 return true; 775 return true;
896} 776}
897 777
898bool 778bool
899maptile::save_header (const char *path) 779maptile::_save_header (const char *path)
900{ 780{
901 object_freezer freezer; 781 object_freezer freezer;
902 782
903 if (!save_header (freezer)) 783 if (!_save_header (freezer))
904 return false; 784 return false;
905 785
906 return freezer.save (path); 786 return freezer.save (path);
907} 787}
908 788
… …
910 * Remove and free all objects in the given map. 790 * Remove and free all objects in the given map.
911 */ 791 */
912void 792void
913maptile::clear () 793maptile::clear ()
914{ 794{
915 if (!spaces) 795 if (spaces)
916 return; 796 {
917
918 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 797 for (mapspace *ms = spaces + size (); ms-- > spaces; )
919 while (object *op = ms->bot) 798 while (object *op = ms->bot)
920 { 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_ ();
921 if (op->head) 807 if (op == head)
922 op = op->head;
923
924 op->destroy_inv (false);
925 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 }
814 }
815
816 sfree0 (spaces, size ());
926 } 817 }
927
928 sfree (spaces, size ()), spaces = 0;
929 818
930 if (buttons) 819 if (buttons)
931 free_objectlinkpt (buttons), buttons = 0; 820 free_objectlinkpt (buttons), buttons = 0;
821
822 sfree0 (regions, size ());
823 delete [] regionmap; regionmap = 0;
932} 824}
933 825
934void 826void
935maptile::clear_header () 827maptile::clear_header ()
936{ 828{
… …
968 attachable::do_destroy (); 860 attachable::do_destroy ();
969 861
970 clear (); 862 clear ();
971} 863}
972 864
973/* 865/* decay and destroy perishable items in a map */
974 * Updates every button on the map (by calling update_button() for them).
975 */
976void 866void
977maptile::update_buttons () 867maptile::do_decay_objects ()
978{ 868{
979 for (oblinkpt *obp = buttons; obp; obp = obp->next) 869 if (!spaces)
980 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)
981 { 874 {
982 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 ())
983 { 891 {
984 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", 892 op->stats.dam--;
985 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)
986 continue; 894 destroy = 1;
987 } 895 }
988 896 else if (op->is_armor ())
989 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
990 { 897 {
991 update_button (ol->ob); 898 op->stats.ac--;
992 break; 899 if (op->stats.ac < 0)
900 destroy = 1;
993 } 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 ();
994 } 929 }
995} 930}
996 931
997/* 932/*
998 * 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.
999 * difficulty does not have a lot to do with character level, 934 * difficulty does not have a lot to do with character level,
1000 * 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.
1001 * 936 *
1002 * 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
1003 * 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
1004 * have a difficulty set than using this function - human calculation 939 * have a difficulty set rather than using this function - human calculation
1005 * is much better than this functions guesswork. 940 * is much better than this function's guesswork.
1006 */ 941 */
1007int 942int
1008maptile::estimate_difficulty () const 943maptile::estimate_difficulty () const
1009{ 944{
1010 long monster_cnt = 0; 945 long monster_cnt = 0;
… …
1022 957
1023 if (QUERY_FLAG (op, FLAG_GENERATOR)) 958 if (QUERY_FLAG (op, FLAG_GENERATOR))
1024 { 959 {
1025 total_exp += op->stats.exp; 960 total_exp += op->stats.exp;
1026 961
1027 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 962 if (archetype *at = op->other_arch)
963 {
1028 total_exp += at->clone.stats.exp * 8; 964 total_exp += at->stats.exp * 8;
1029
1030 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 }
1031 } 973 }
1032 } 974 }
1033 975
1034 avgexp = (double) total_exp / monster_cnt; 976 avgexp = (double) total_exp / monster_cnt;
1035 977
… …
1048 * postive values make it darker, negative make it brighter 990 * postive values make it darker, negative make it brighter
1049 */ 991 */
1050int 992int
1051maptile::change_map_light (int change) 993maptile::change_map_light (int change)
1052{ 994{
1053 int new_level = darkness + change;
1054
1055 /* Nothing to do */ 995 /* Nothing to do */
1056 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 996 if (!change)
1057 return 0; 997 return 0;
1058 998
1059 /* inform all players on the map */ 999 /* inform all players on the map */
1060 if (change > 0) 1000 if (change > 0)
1061 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1001 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1062 else 1002 else
1063 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1003 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1064 1004
1065 /* Do extra checking. since darkness is a unsigned value, 1005 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1066 * we need to be extra careful about negative values.
1067 * In general, the checks below are only needed if change
1068 * is not +/-1
1069 */
1070 if (new_level < 0)
1071 darkness = 0;
1072 else if (new_level >= MAX_DARKNESS)
1073 darkness = MAX_DARKNESS;
1074 else
1075 darkness = new_level;
1076 1006
1077 /* All clients need to get re-updated for the change */ 1007 /* All clients need to get re-updated for the change */
1078 update_all_map_los (this); 1008 update_all_map_los (this);
1009
1079 return 1; 1010 return 1;
1080} 1011}
1081 1012
1082/* 1013/*
1083 * This function updates various attributes about a specific space 1014 * This function updates various attributes about a specific space
… …
1086 * through, etc) 1017 * through, etc)
1087 */ 1018 */
1088void 1019void
1089mapspace::update_ () 1020mapspace::update_ ()
1090{ 1021{
1091 object *tmp, *last = 0; 1022 object *last = 0;
1092 uint8 flags = 0, light = 0, anywhere = 0; 1023 uint8 flags = P_UPTODATE, anywhere = 0;
1093 New_Face *top, *floor, *middle; 1024 sint8 light = 0;
1094 object *top_obj, *floor_obj, *middle_obj;
1095 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;
1096 1026
1097 middle = blank_face; 1027 //object *middle = 0;
1098 top = blank_face; 1028 //object *top = 0;
1099 floor = blank_face; 1029 //object *floor = 0;
1030 // this seems to generate better code than using locals, above
1031 object *&top = faces_obj[0] = 0;
1032 object *&middle = faces_obj[1] = 0;
1033 object *&floor = faces_obj[2] = 0;
1100 1034
1101 middle_obj = 0;
1102 top_obj = 0;
1103 floor_obj = 0;
1104
1105 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1035 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1106 { 1036 {
1107 /* This could be made additive I guess (two lights better than 1037 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1108 * one). But if so, it shouldn't be a simple additive - 2
1109 * light bulbs do not illuminate twice as far as once since
1110 * it is a dissapation factor that is cubed.
1111 */
1112 if (tmp->glow_radius > light)
1113 light = tmp->glow_radius; 1038 light += tmp->glow_radius;
1114 1039
1115 /* This call is needed in order to update objects the player 1040 /* This call is needed in order to update objects the player
1116 * is standing in that have animations (ie, grass, fire, etc). 1041 * is standing in that have animations (ie, grass, fire, etc).
1117 * However, it also causes the look window to be re-drawn 1042 * However, it also causes the look window to be re-drawn
1118 * 3 times each time the player moves, because many of the 1043 * 3 times each time the player moves, because many of the
… …
1121 * Always put the player down for drawing. 1046 * Always put the player down for drawing.
1122 */ 1047 */
1123 if (!tmp->invisible) 1048 if (!tmp->invisible)
1124 { 1049 {
1125 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1050 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1126 {
1127 top = tmp->face;
1128 top_obj = tmp; 1051 top = tmp;
1129 }
1130 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1052 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1131 { 1053 {
1132 /* If we got a floor, that means middle and top were below it, 1054 /* If we got a floor, that means middle and top were below it,
1133 * so should not be visible, so we clear them. 1055 * so should not be visible, so we clear them.
1134 */ 1056 */
1135 middle = blank_face; 1057 middle = 0;
1136 top = blank_face; 1058 top = 0;
1137 floor = tmp->face;
1138 floor_obj = tmp; 1059 floor = tmp;
1139 } 1060 }
1140 /* Flag anywhere have high priority */ 1061 /* Flag anywhere have high priority */
1141 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1062 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1142 { 1063 {
1143 middle = tmp->face;
1144
1145 middle_obj = tmp; 1064 middle = tmp;
1146 anywhere = 1; 1065 anywhere = 1;
1147 } 1066 }
1067
1148 /* Find the highest visible face around. If equal 1068 /* Find the highest visible face around. If equal
1149 * visibilities, we still want the one nearer to the 1069 * visibilities, we still want the one nearer to the
1150 * top 1070 * top
1151 */ 1071 */
1152 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) 1072 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1153 {
1154 middle = tmp->face;
1155 middle_obj = tmp; 1073 middle = tmp;
1156 }
1157 } 1074 }
1158 1075
1159 if (tmp == tmp->above) 1076 if (tmp == tmp->above)
1160 { 1077 {
1161 LOG (llevError, "Error in structure of map\n"); 1078 LOG (llevError, "Error in structure of map\n");
… …
1174 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1091 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1175 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1092 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1176 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1093 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1177 } 1094 }
1178 1095
1179 this->light = light; 1096 this->light = min (light, MAX_LIGHT_RADIUS);
1180 this->flags_ = flags; 1097 this->flags_ = flags;
1181 this->move_block = move_block & ~move_allow; 1098 this->move_block = move_block & ~move_allow;
1182 this->move_on = move_on; 1099 this->move_on = move_on;
1183 this->move_off = move_off; 1100 this->move_off = move_off;
1184 this->move_slow = move_slow; 1101 this->move_slow = move_slow;
… …
1196 * middle face. This should not happen, as we already have the 1113 * middle face. This should not happen, as we already have the
1197 * else statement above so middle should not get set. OTOH, it 1114 * else statement above so middle should not get set. OTOH, it
1198 * may be possible for the faces to match but be different objects. 1115 * may be possible for the faces to match but be different objects.
1199 */ 1116 */
1200 if (top == middle) 1117 if (top == middle)
1201 middle = blank_face; 1118 middle = 0;
1202 1119
1203 /* There are three posibilities at this point: 1120 /* There are three posibilities at this point:
1204 * 1) top face is set, need middle to be set. 1121 * 1) top face is set, need middle to be set.
1205 * 2) middle is set, need to set top. 1122 * 2) middle is set, need to set top.
1206 * 3) neither middle or top is set - need to set both. 1123 * 3) neither middle or top is set - need to set both.
1207 */ 1124 */
1208 1125
1209 for (tmp = last; tmp; tmp = tmp->below) 1126 for (object *tmp = last; tmp; tmp = tmp->below)
1210 { 1127 {
1211 /* 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 */
1212 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1129 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1213 break; 1130 break;
1214 1131
1215 /* If two top faces are already set, quit processing */ 1132 /* If two top faces are already set, quit processing */
1216 if ((top != blank_face) && (middle != blank_face)) 1133 if (top && middle)
1217 break; 1134 break;
1218 1135
1219 /* Only show visible faces, unless its the editor - show all */ 1136 /* Only show visible faces */
1220 if (!tmp->invisible || editor) 1137 if (!tmp->invisible)
1221 { 1138 {
1222 /* Fill in top if needed */ 1139 /* Fill in top if needed */
1223 if (top == blank_face) 1140 if (!top)
1224 { 1141 {
1225 top = tmp->face;
1226 top_obj = tmp; 1142 top = tmp;
1227 if (top == middle) 1143 if (top == middle)
1228 middle = blank_face; 1144 middle = 0;
1229 } 1145 }
1230 else 1146 else
1231 { 1147 {
1232 /* top is already set - we should only get here if 1148 /* top is already set - we should only get here if
1233 * middle is not set 1149 * middle is not set
1234 * 1150 *
1235 * Set the middle face and break out, since there is nothing 1151 * Set the middle face and break out, since there is nothing
1236 * more to fill in. We don't check visiblity here, since 1152 * more to fill in. We don't check visiblity here, since
1237 * 1153 *
1238 */ 1154 */
1239 if (tmp->face != top) 1155 if (tmp != top)
1240 { 1156 {
1241 middle = tmp->face;
1242 middle_obj = tmp; 1157 middle = tmp;
1243 break; 1158 break;
1244 } 1159 }
1245 } 1160 }
1246 } 1161 }
1247 } 1162 }
1248 1163
1249 if (middle == floor) 1164 if (middle == floor)
1250 middle = blank_face; 1165 middle = 0;
1251 1166
1252 if (top == middle) 1167 if (top == middle)
1253 middle = blank_face; 1168 middle = 0;
1254 1169
1255 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1170#if 0
1256 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1171 faces_obj [0] = top;
1257 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1172 faces_obj [1] = middle;
1173 faces_obj [2] = floor;
1174#endif
1258} 1175}
1259 1176
1260/* this updates the orig_map->tile_map[tile_num] value after loading 1177uint64
1261 * the map. It also takes care of linking back the freshly loaded 1178mapspace::volume () const
1262 * maps tile_map values if it tiles back to this one. It returns
1263 * the value of orig_map->tile_map[tile_num]. It really only does this
1264 * so that it is easier for calling functions to verify success.
1265 */
1266static maptile *
1267load_and_link_tiled_map (maptile *orig_map, int tile_num)
1268{ 1179{
1269 maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); 1180 uint64 vol = 0;
1270 1181
1271 if (!mp || mp->in_memory != MAP_IN_MEMORY) 1182 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1272 { 1183 vol += op->volume ();
1273 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine 1184
1274 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", 1185 return vol;
1275 &orig_map->tile_path[tile_num], &orig_map->path); 1186}
1276 mp = new maptile (1, 1); 1187
1277 mp->alloc (); 1188maptile *
1278 mp->in_memory = MAP_IN_MEMORY; 1189maptile::tile_available (int dir, bool load)
1190{
1191 if (tile_path[dir])
1279 } 1192 {
1193 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1194 return tile_map[dir];
1280 1195
1281 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 }
1282 1199
1283 orig_map->tile_map[tile_num] = mp;
1284
1285 // optimisation: back-link map to origin map if euclidean
1286 //TODO: non-euclidean maps MUST GO
1287 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1288 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1289
1290 return mp; 1200 return 0;
1291} 1201}
1292 1202
1293/* this returns TRUE if the coordinates (x,y) are out of 1203/* this returns TRUE if the coordinates (x,y) are out of
1294 * map m. This function also takes into account any 1204 * map m. This function also takes into account any
1295 * tiling considerations, loading adjacant maps as needed. 1205 * tiling considerations, loading adjacant maps as needed.
… …
1308 if (!m) 1218 if (!m)
1309 return 0; 1219 return 0;
1310 1220
1311 if (x < 0) 1221 if (x < 0)
1312 { 1222 {
1313 if (!m->tile_path[3]) 1223 if (!m->tile_available (3))
1314 return 1; 1224 return 1;
1315 1225
1316 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1317 load_and_link_tiled_map (m, 3);
1318
1319 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);
1320 } 1227 }
1321 1228
1322 if (x >= m->width) 1229 if (x >= m->width)
1323 { 1230 {
1324 if (!m->tile_path[1]) 1231 if (!m->tile_available (1))
1325 return 1; 1232 return 1;
1326 1233
1327 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1328 load_and_link_tiled_map (m, 1);
1329
1330 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);
1331 } 1235 }
1332 1236
1333 if (y < 0) 1237 if (y < 0)
1334 { 1238 {
1335 if (!m->tile_path[0]) 1239 if (!m->tile_available (0))
1336 return 1; 1240 return 1;
1337 1241
1338 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1339 load_and_link_tiled_map (m, 0);
1340
1341 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);
1342 } 1243 }
1343 1244
1344 if (y >= m->height) 1245 if (y >= m->height)
1345 { 1246 {
1346 if (!m->tile_path[2]) 1247 if (!m->tile_available (2))
1347 return 1; 1248 return 1;
1348
1349 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1350 load_and_link_tiled_map (m, 2);
1351 1249
1352 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);
1353 } 1251 }
1354 1252
1355 /* Simple case - coordinates are within this local 1253 /* Simple case - coordinates are within this local
… …
1360 1258
1361/* This is basically the same as out_of_map above, but 1259/* This is basically the same as out_of_map above, but
1362 * instead we return NULL if no map is valid (coordinates 1260 * instead we return NULL if no map is valid (coordinates
1363 * out of bounds and no tiled map), otherwise it returns 1261 * out of bounds and no tiled map), otherwise it returns
1364 * the map as that the coordinates are really on, and 1262 * the map as that the coordinates are really on, and
1365 * updates x and y to be the localized coordinates. 1263 * updates x and y to be the localised coordinates.
1366 * Using this is more efficient of calling out_of_map 1264 * Using this is more efficient of calling out_of_map
1367 * and then figuring out what the real map is 1265 * and then figuring out what the real map is
1368 */ 1266 */
1369maptile * 1267maptile *
1370get_map_from_coord (maptile *m, sint16 *x, sint16 *y) 1268maptile::xy_find (sint16 &x, sint16 &y)
1371{ 1269{
1372 if (*x < 0) 1270 if (x < 0)
1373 { 1271 {
1374 if (!m->tile_path[3]) 1272 if (!tile_available (3))
1375 return 0; 1273 return 0;
1376 1274
1377 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1378 load_and_link_tiled_map (m, 3);
1379
1380 *x += m->tile_map[3]->width; 1275 x += tile_map[3]->width;
1381 return (get_map_from_coord (m->tile_map[3], x, y)); 1276 return tile_map[3]->xy_find (x, y);
1382 } 1277 }
1383 1278
1384 if (*x >= m->width) 1279 if (x >= width)
1385 { 1280 {
1386 if (!m->tile_path[1]) 1281 if (!tile_available (1))
1387 return 0; 1282 return 0;
1388 1283
1389 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1390 load_and_link_tiled_map (m, 1);
1391
1392 *x -= m->width; 1284 x -= width;
1393 return (get_map_from_coord (m->tile_map[1], x, y)); 1285 return tile_map[1]->xy_find (x, y);
1394 } 1286 }
1395 1287
1396 if (*y < 0) 1288 if (y < 0)
1397 { 1289 {
1398 if (!m->tile_path[0]) 1290 if (!tile_available (0))
1399 return 0; 1291 return 0;
1400 1292
1401 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1402 load_and_link_tiled_map (m, 0);
1403
1404 *y += m->tile_map[0]->height; 1293 y += tile_map[0]->height;
1405 return (get_map_from_coord (m->tile_map[0], x, y)); 1294 return tile_map[0]->xy_find (x, y);
1406 } 1295 }
1407 1296
1408 if (*y >= m->height) 1297 if (y >= height)
1409 { 1298 {
1410 if (!m->tile_path[2]) 1299 if (!tile_available (2))
1411 return 0; 1300 return 0;
1412 1301
1413 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1414 load_and_link_tiled_map (m, 2);
1415
1416 *y -= m->height; 1302 y -= height;
1417 return (get_map_from_coord (m->tile_map[2], x, y)); 1303 return tile_map[2]->xy_find (x, y);
1418 } 1304 }
1419 1305
1420 /* Simple case - coordinates are within this local 1306 /* Simple case - coordinates are within this local
1421 * map. 1307 * map.
1422 */ 1308 */
1423 return m; 1309 return this;
1424} 1310}
1425 1311
1426/** 1312/**
1427 * Return whether map2 is adjacent to map1. If so, store the distance from 1313 * Return whether map2 is adjacent to map1. If so, store the distance from
1428 * map1 to map2 in dx/dy. 1314 * map1 to map2 in dx/dy.
1429 */ 1315 */
1430static int 1316int
1431adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1317adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1432{ 1318{
1433 if (!map1 || !map2) 1319 if (!map1 || !map2)
1434 return 0; 1320 return 0;
1435 1321
1322 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1323 //fix: compare paths instead (this is likely faster, too!)
1436 if (map1 == map2) 1324 if (map1 == map2)
1437 { 1325 {
1438 *dx = 0; 1326 *dx = 0;
1439 *dy = 0; 1327 *dy = 0;
1440 } 1328 }
… …
1500 } 1388 }
1501 else 1389 else
1502 return 0; 1390 return 0;
1503 1391
1504 return 1; 1392 return 1;
1393}
1394
1395maptile *
1396maptile::xy_load (sint16 &x, sint16 &y)
1397{
1398 maptile *map = xy_find (x, y);
1399
1400 if (map)
1401 map->load_sync ();
1402
1403 return map;
1404}
1405
1406maptile *
1407get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
1408{
1409 return m->xy_load (*x, *y);
1505} 1410}
1506 1411
1507/* From map.c 1412/* From map.c
1508 * This is used by get_player to determine where the other 1413 * This is used by get_player to determine where the other
1509 * creature is. get_rangevector takes into account map tiling, 1414 * creature is. get_rangevector takes into account map tiling,
1510 * so you just can not look the the map coordinates and get the 1415 * so you just can not look the the map coordinates and get the
1511 * righte value. distance_x/y are distance away, which 1416 * righte value. distance_x/y are distance away, which
1512 * can be negativbe. direction is the crossfire direction scheme 1417 * can be negative. direction is the crossfire direction scheme
1513 * that the creature should head. part is the part of the 1418 * that the creature should head. part is the part of the
1514 * monster that is closest. 1419 * monster that is closest.
1515 * 1420 *
1516 * get_rangevector looks at op1 and op2, and fills in the 1421 * get_rangevector looks at op1 and op2, and fills in the
1517 * structure for op1 to get to op2. 1422 * structure for op1 to get to op2.
… …
1528get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1433get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1529{ 1434{
1530 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1435 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1531 { 1436 {
1532 /* be conservative and fill in _some_ data */ 1437 /* be conservative and fill in _some_ data */
1533 retval->distance = 100000; 1438 retval->distance = 10000;
1534 retval->distance_x = 32767; 1439 retval->distance_x = 10000;
1535 retval->distance_y = 32767; 1440 retval->distance_y = 10000;
1536 retval->direction = 0; 1441 retval->direction = 0;
1537 retval->part = 0; 1442 retval->part = 0;
1538 } 1443 }
1539 else 1444 else
1540 { 1445 {
… …
1545 1450
1546 best = op1; 1451 best = op1;
1547 /* If this is multipart, find the closest part now */ 1452 /* If this is multipart, find the closest part now */
1548 if (!(flags & 0x1) && op1->more) 1453 if (!(flags & 0x1) && op1->more)
1549 { 1454 {
1550 object *tmp;
1551 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1455 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1552 1456
1553 /* we just take the offset of the piece to head to figure 1457 /* we just take the offset of the piece to head to figure
1554 * distance instead of doing all that work above again 1458 * distance instead of doing all that work above again
1555 * since the distance fields we set above are positive in the 1459 * since the distance fields we set above are positive in the
1556 * same axis as is used for multipart objects, the simply arithmetic 1460 * same axis as is used for multipart objects, the simply arithmetic
1557 * below works. 1461 * below works.
1558 */ 1462 */
1559 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1463 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1560 { 1464 {
1561 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1465 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1562 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1466 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1563 if (tmpi < best_distance) 1467 if (tmpi < best_distance)
1564 { 1468 {
1565 best_distance = tmpi; 1469 best_distance = tmpi;
1566 best = tmp; 1470 best = tmp;
1567 } 1471 }
1568 } 1472 }
1473
1569 if (best != op1) 1474 if (best != op1)
1570 { 1475 {
1571 retval->distance_x += op1->x - best->x; 1476 retval->distance_x += op1->x - best->x;
1572 retval->distance_y += op1->y - best->y; 1477 retval->distance_y += op1->y - best->y;
1573 } 1478 }
1574 } 1479 }
1480
1575 retval->part = best; 1481 retval->part = best;
1576 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1482 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1577 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1483 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1578 } 1484 }
1579} 1485}
1580 1486
1581/* this is basically the same as get_rangevector above, but instead of 1487/* this is basically the same as get_rangevector above, but instead of
… …
1586 * flags has no meaning for this function at this time - I kept it in to 1492 * flags has no meaning for this function at this time - I kept it in to
1587 * be more consistant with the above function and also in case they are needed 1493 * be more consistant with the above function and also in case they are needed
1588 * for something in the future. Also, since no object is pasted, the best 1494 * for something in the future. Also, since no object is pasted, the best
1589 * field of the rv_vector is set to NULL. 1495 * field of the rv_vector is set to NULL.
1590 */ 1496 */
1591
1592void 1497void
1593get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1498get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1594{ 1499{
1595 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1500 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1596 { 1501 {
1597 /* be conservative and fill in _some_ data */ 1502 /* be conservative and fill in _some_ data */
1598 retval->distance = 100000; 1503 retval->distance = 100000;
… …
1604 else 1509 else
1605 { 1510 {
1606 retval->distance_x += op2->x - x; 1511 retval->distance_x += op2->x - x;
1607 retval->distance_y += op2->y - y; 1512 retval->distance_y += op2->y - y;
1608 1513
1609 retval->part = NULL; 1514 retval->part = 0;
1610 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1515 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1611 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1516 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1612 } 1517 }
1613} 1518}
1614 1519
1615/* 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
… …
1629} 1534}
1630 1535
1631object * 1536object *
1632maptile::insert (object *op, int x, int y, object *originator, int flags) 1537maptile::insert (object *op, int x, int y, object *originator, int flags)
1633{ 1538{
1634 if (!op->flag [FLAG_REMOVED])
1635 op->remove ();
1636
1637 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);
1638} 1540}
1639 1541
1542region *
1543maptile::region (int x, int y) const
1544{
1545 if (regions
1546 && regionmap
1547 && !OUT_OF_REAL_MAP (this, x, y))
1548 if (struct region *reg = regionmap [regions [y * width + x]])
1549 return reg;
1550
1551 if (default_region)
1552 return default_region;
1553
1554 return ::region::default_region ();
1555}
1556
1557/* picks a random object from a style map.
1558 */
1559object *
1560maptile::pick_random_object (rand_gen &gen) const
1561{
1562 /* while returning a null object will result in a crash, that
1563 * is actually preferable to an infinite loop. That is because
1564 * most servers will automatically restart in case of crash.
1565 * Change the logic on getting the random space - shouldn't make
1566 * any difference, but this seems clearer to me.
1567 */
1568 for (int i = 1000; --i;)
1569 {
1570 object *pick = at (gen (width), gen (height)).bot;
1571
1572 // do not prefer big monsters just because they are big.
1573 if (pick && pick->is_head ())
1574 return pick->head_ ();
1575 }
1576
1577 // instead of crashing in the unlikely(?) case, try to return *something*
1578 return archetype::find ("bug");
1579}
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