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.77 by root, Thu Jan 18 16:19:34 2007 UTC vs.
Revision 1.213 by root, Sat May 7 20:03:27 2011 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,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 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 <global.h>
26#include <funcpoint.h>
27
28#include <loader.h>
29#include <unistd.h> 25#include <unistd.h>
30 26
27#include "global.h"
31#include "path.h" 28#include "path.h"
32 29
33/* 30//+GPL
34 * This makes a path absolute outside the world of Crossfire.
35 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
36 * and returns the pointer to a static array containing the result.
37 * it really should be called create_mapname
38 */
39const char *
40create_pathname (const char *name)
41{
42 static char buf[8192];
43 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
44 return buf;
45}
46 31
47/* 32sint8 maptile::outdoor_darkness;
48 * This function checks if a file with the given path exists.
49 * -1 is returned if it fails, otherwise the mode of the file
50 * is returned.
51 * It tries out all the compression suffixes listed in the uncomp[] array.
52 *
53 * If prepend_dir is set, then we call create_pathname (which prepends
54 * libdir & mapdir). Otherwise, we assume the name given is fully
55 * complete.
56 * Only the editor actually cares about the writablity of this -
57 * the rest of the code only cares that the file is readable.
58 * when the editor goes away, the call to stat should probably be
59 * replaced by an access instead (similar to the windows one, but
60 * that seems to be missing the prepend_dir processing
61 */
62int
63check_path (const char *name, int prepend_dir)
64{
65 char buf[MAX_BUF];
66
67 char *endbuf;
68 struct stat statbuf;
69 int mode = 0;
70
71 if (prepend_dir)
72 strcpy (buf, create_pathname (name));
73 else
74 strcpy (buf, name);
75
76 /* old method (strchr(buf, '\0')) seemd very odd to me -
77 * this method should be equivalant and is clearer.
78 * Can not use strcat because we need to cycle through
79 * all the names.
80 */
81 endbuf = buf + strlen (buf);
82
83 if (stat (buf, &statbuf))
84 return -1;
85 if (!S_ISREG (statbuf.st_mode))
86 return (-1);
87
88 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
89 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
90 mode |= 4;
91
92 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
93 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
94 mode |= 2;
95
96 return (mode);
97}
98 33
99/* This rolls up wall, blocks_magic, blocks_view, etc, all into 34/* This rolls up wall, blocks_magic, blocks_view, etc, all into
100 * one function that just returns a P_.. value (see map.h) 35 * one function that just returns a P_.. value (see map.h)
101 * it will also do map translation for tiled maps, returning 36 * it will also do map translation for tiled maps, returning
102 * new values into newmap, nx, and ny. Any and all of those 37 * new values into newmap, nx, and ny. Any and all of those
… …
137 * by the caller. 72 * by the caller.
138 */ 73 */
139int 74int
140blocked_link (object *ob, maptile *m, int sx, int sy) 75blocked_link (object *ob, maptile *m, int sx, int sy)
141{ 76{
142 object *tmp;
143 int mflags, blocked;
144
145 /* Make sure the coordinates are valid - they should be, as caller should 77 /* Make sure the coordinates are valid - they should be, as caller should
146 * have already checked this. 78 * have already checked this.
147 */ 79 */
148 if (OUT_OF_REAL_MAP (m, sx, sy)) 80 if (OUT_OF_REAL_MAP (m, sx, sy))
149 { 81 {
150 LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); 82 LOG (llevError | logBacktrace, "blocked_link: Passed map, x, y coordinates outside of map\n");
151 return 1; 83 return 1;
152 } 84 }
153 85
154 /* Save some cycles - instead of calling get_map_flags(), just get the value 86 mapspace &ms = m->at (sx, sy);
155 * directly.
156 */
157 mflags = m->at (sx, sy).flags ();
158 87
159 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 88 int mflags = ms.flags ();
89 int blocked = ms.move_block;
160 90
161 /* If space is currently not blocked by anything, no need to 91 /* If space is currently not blocked by anything, no need to
162 * go further. Not true for players - all sorts of special 92 * go further. Not true for players - all sorts of special
163 * things we need to do for players. 93 * things we need to do for players.
164 */ 94 */
165 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 95 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
166 return 0; 96 return 0;
167 97
168 /* if there isn't anytyhing alive on this space, and this space isn't 98 /* if there isn't anything alive on this space, and this space isn't
169 * otherwise blocked, we can return now. Only if there is a living 99 * otherwise blocked, we can return now. Only if there is a living
170 * creature do we need to investigate if it is part of this creature 100 * creature do we need to investigate if it is part of this creature
171 * or another. Likewise, only if something is blocking us do we 101 * or another. Likewise, only if something is blocking us do we
172 * need to investigate if there is a special circumstance that would 102 * need to investigate if there is a special circumstance that would
173 * let the player through (inventory checkers for example) 103 * let the player through (inventory checkers for example)
174 */ 104 */
175 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 105 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
176 return 0; 106 return 0;
177 107
178 if (ob->head != NULL)
179 ob = ob->head; 108 ob = ob->head_ ();
180 109
181 /* We basically go through the stack of objects, and if there is 110 /* We basically go through the stack of objects, and if there is
182 * some other object that has NO_PASS or FLAG_ALIVE set, return 111 * some other object that has NO_PASS or FLAG_ALIVE set, return
183 * true. If we get through the entire stack, that must mean 112 * true. If we get through the entire stack, that must mean
184 * ob is blocking it, so return 0. 113 * ob is blocking it, so return 0.
185 */ 114 */
186 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) 115 for (object *tmp = ms.top; tmp; tmp = tmp->below)
187 { 116 {
188 117 if (OB_MOVE_BLOCK (ob, tmp))
189 /* This must be before the checks below. Code for inventory checkers. */
190 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
191 { 118 {
192 /* If last_sp is set, the player/monster needs an object, 119 if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
193 * so we check for it. If they don't have it, they can't 120 if (RESULT_INT (0))
194 * pass through this space. 121 return 1;
195 */ 122 else
196 if (tmp->last_sp) 123 continue;
124
125 if (tmp->type == CHECK_INV)
197 { 126 {
198 if (check_inv_recursive (ob, tmp) == NULL) 127 bool have = check_inv_recursive (ob, tmp);
128
129 // last_sp set means we block if we don't have.
130 if (logical_xor (have, tmp->last_sp))
199 return 1; 131 return 1;
200 else 132 }
201 continue; 133 else if (tmp->type == T_MATCH)
134 {
135 // T_MATCH allows "entrance" iff the match is true
136 // == blocks if the match fails
137
138 // we could have used an INVOKE_OBJECT, but decided against it, as we
139 // assume that T_MATCH is relatively common.
140 if (!match (tmp->slaying, ob, tmp, ob))
141 return 1;
202 } 142 }
203 else 143 else
204 { 144 return 1; // unconditional block
205 /* In this case, the player must not have the object - 145
206 * if they do, they can't pass through.
207 */
208 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
209 return 1;
210 else
211 continue;
212 }
213 } /* if check_inv */
214 else 146 } else {
215 { 147 // space does not block the ob, directly, but
216 /* Broke apart a big nasty if into several here to make 148 // anything alive that is not a door still
217 * this more readable. first check - if the space blocks 149 // blocks anything
218 * movement, can't move here. 150
219 * second - if a monster, can't move there, unles it is a 151 if (tmp->flag [FLAG_ALIVE]
220 * hidden dm 152 && tmp->type != DOOR
221 */ 153 && tmp->head_ () != ob) //TODO: maybe move these check up?
222 if (OB_MOVE_BLOCK (ob, tmp))
223 return 1;
224 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob &&
225 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden))
226 return 1; 154 return 1;
227 } 155 }
228
229 } 156 }
157
230 return 0; 158 return 0;
231} 159}
232 160
233/* 161/*
234 * Returns true if the given object can't fit in the given spot. 162 * Returns the blocking object if the given object can't fit in the given
235 * This is meant for multi space objects - for single space objecs, 163 * spot. This is meant for multi space objects - for single space objecs,
236 * just calling get_map_blocked and checking that against movement type 164 * just calling get_map_blocked and checking that against movement type
237 * of object. This function goes through all the parts of the 165 * of object. This function goes through all the parts of the multipart
238 * multipart object and makes sure they can be inserted. 166 * object and makes sure they can be inserted.
239 * 167 *
240 * While this doesn't call out of map, the get_map_flags does. 168 * While this doesn't call out of map, the get_map_flags does.
241 * 169 *
242 * This function has been used to deprecate arch_out_of_map - 170 * This function has been used to deprecate arch_out_of_map -
243 * this function also does that check, and since in most cases, 171 * this function also does that check, and since in most cases,
… …
254 * 182 *
255 * Note this used to be arch_blocked, but with new movement 183 * Note this used to be arch_blocked, but with new movement
256 * code, we need to have actual object to check its move_type 184 * code, we need to have actual object to check its move_type
257 * against the move_block values. 185 * against the move_block values.
258 */ 186 */
259int 187bool
260ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 188object::blocked (maptile *m, int x, int y) const
261{ 189{
262 archetype *tmp; 190 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 } 191 {
192 mapxy pos (m, x + tmp->x, y + tmp->y);
276 193
277 for (tmp = ob->arch; tmp; tmp = tmp->more) 194 if (!pos.normalise ())
278 { 195 return 1;
279 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
280 196
281 if (flag & P_OUT_OF_MAP) 197 mapspace &ms = *pos;
282 return P_OUT_OF_MAP; 198
283 if (flag & P_IS_ALIVE) 199 if (ms.flags () & P_IS_ALIVE)
284 return P_IS_ALIVE; 200 return 1;
285 201
286 mapspace &ms = m1->at (sx, sy); 202 /* However, often ob doesn't have any move type
287 203 * (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. 204 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
291 */ 205 */
292
293 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 206 if (!move_type && ms.move_block != MOVE_ALL)
294 continue; 207 continue;
295 208
296 /* Note it is intentional that we check ob - the movement type of the 209 /* Note it is intentional that we check ob - the movement type of the
297 * head of the object should correspond for the entire object. 210 * head of the object should correspond for the entire object.
298 */ 211 */
299 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 212 if (ms.blocks (move_type))
300 return P_NO_PASS; 213 return 1;
301 } 214 }
302 215
303 return 0; 216 return 0;
304} 217}
305 218
306/* When the map is loaded, load_object does not actually insert objects 219//-GPL
307 * into inventory, but just links them. What this does is go through
308 * and insert them properly.
309 * The object 'container' is the object that contains the inventory.
310 * This is needed so that we can update the containers weight.
311 */
312void
313fix_container (object *container)
314{
315 object *tmp = container->inv, *next;
316
317 container->inv = 0;
318 while (tmp)
319 {
320 next = tmp->below;
321 if (tmp->inv)
322 fix_container (tmp);
323
324 insert_ob_in_ob (tmp, container);
325 tmp = next;
326 }
327
328 /* sum_weight will go through and calculate what all the containers are
329 * carrying.
330 */
331 sum_weight (container);
332}
333 220
334void 221void
335maptile::set_object_flag (int flag, int value) 222maptile::set_object_flag (int flag, int value)
336{ 223{
337 if (!spaces) 224 if (!spaces)
… …
340 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 227 for (mapspace *ms = spaces + size (); ms-- > spaces; )
341 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 228 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
342 tmp->flag [flag] = value; 229 tmp->flag [flag] = value;
343} 230}
344 231
232void
233maptile::post_load_original ()
234{
235 if (!spaces)
236 return;
237
238 set_object_flag (FLAG_OBJ_ORIGINAL);
239
240 for (mapspace *ms = spaces + size (); ms-- > spaces; )
241 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
242 INVOKE_OBJECT (RESET, tmp);
243}
244
245void
246maptile::post_load ()
247{
248#if 0
249 if (!spaces)
250 return;
251
252 for (mapspace *ms = spaces + size (); ms-- > spaces; )
253 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
254 ; // nop
255#endif
256}
257
258//+GPL
259
345/* link_multipart_objects go through all the objects on the map looking 260/* link_multipart_objects go through all the objects on the map looking
346 * for objects whose arch says they are multipart yet according to the 261 * for objects whose arch says they are multipart yet according to the
347 * info we have, they only have the head (as would be expected when 262 * info we have, they only have the head (as would be expected when
348 * they are saved). We do have to look for the old maps that did save 263 * they are saved).
349 * the more sections and not re-add sections for them.
350 */ 264 */
351void 265void
352maptile::link_multipart_objects () 266maptile::link_multipart_objects ()
353{ 267{
354 if (!spaces) 268 if (!spaces)
355 return; 269 return;
356 270
357 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 271 for (mapspace *ms = spaces + size (); ms-- > spaces; )
358 for (object *tmp = ms->bot; tmp; ) 272 {
273 object *op = ms->bot;
274 while (op)
359 { 275 {
360 object *above = tmp->above;
361
362 /* already multipart - don't do anything more */ 276 /* already multipart - don't do anything more */
363 if (!tmp->head && !tmp->more) 277 if (op->head_ () == op && !op->more && op->arch->more)
364 {
365 /* If there is nothing more to this object, this for loop
366 * won't do anything.
367 */
368 archetype *at;
369 object *last, *op;
370 for (at = tmp->arch->more, last = tmp;
371 at;
372 at = at->more, last = op)
373 { 278 {
374 op = arch_to_object (at); 279 op->remove ();
280 op->expand_tail ();
375 281
376 /* update x,y coordinates */ 282 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
377 op->x += tmp->x; 283 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
378 op->y += tmp->y; 284 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
379 op->head = tmp;
380 op->map = this;
381 last->more = op;
382 op->name = tmp->name;
383 op->title = tmp->title;
384
385 /* we could link all the parts onto tmp, and then just
386 * call insert_ob_in_map once, but the effect is the same,
387 * as insert_ob_in_map will call itself with each part, and
388 * the coding is simpler to just to it here with each part.
389 */
390 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 285 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
286
287 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
288 // so we have to reset the iteration through the mapspace
391 } 289 }
290 else
291 op = op->above;
392 } 292 }
393
394 tmp = above;
395 } 293 }
396} 294}
295
296//-GPL
397 297
398/* 298/*
399 * Loads (ands parses) the objects into a given map from the specified 299 * Loads (ands parses) the objects into a given map from the specified
400 * file pointer. 300 * file pointer.
401 * mapflags is the same as we get with load_original_map
402 */ 301 */
403bool 302bool
404maptile::_load_objects (object_thawer &thawer) 303maptile::_load_objects (object_thawer &f)
405{ 304{
406 int unique; 305 for (;;)
407 object *op, *prev = NULL, *last_more = NULL, *otmp;
408
409 op = object::create ();
410 op->map = this; /* To handle buttons correctly */
411
412 while (int i = load_object (thawer, op, 0))
413 { 306 {
414 /* if the archetype for the object is null, means that we 307 coroapi::cede_to_tick (); // cede once in a while
415 * got an invalid object. Don't do anything with it - the game 308
416 * or editor will not be able to do anything with it either. 309 switch (f.kw)
417 */
418 if (op->arch == NULL)
419 { 310 {
420 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 311 case KW_arch:
312 if (object *op = object::read (f, this))
313 {
314 // TODO: why?
315 if (op->inv)
316 {
317 op->carrying = 0;
318 op->update_weight ();
319 }
320
321 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
322 {
323 // we insert manually because
324 // a) its way faster
325 // b) we remove manually, too, and there are good reasons for that
326 // c) it's correct
327 mapspace &ms = at (op->x, op->y);
328
329 op->flag [FLAG_REMOVED] = false;
330
331 op->above = 0;
332 op->below = ms.top;
333
334 *(ms.top ? &ms.top->above : &ms.bot) = op;
335
336 ms.top = op;
337 ms.flags_ = 0;
338 }
339 else
340 {
341 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
342 op->destroy ();
343 }
344 }
345
421 continue; 346 continue;
422 }
423 347
424 switch (i)
425 {
426 case LL_NORMAL:
427 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
428
429 if (op->inv)
430 sum_weight (op);
431
432 prev = op, last_more = op;
433 break;
434
435 case LL_MORE: 348 case KW_EOF:
436 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 349 return true;
437 op->head = prev, last_more->more = op, last_more = op; 350
351 default:
352 if (!f.parse_error ("map file"))
353 return false;
438 break; 354 break;
439 } 355 }
440 356
441 op = object::create (); 357 f.next ();
442 op->map = this;
443 }
444
445 op->destroy ();
446
447#if 0
448 for (i = 0; i < width; i++)
449 for (j = 0; j < height; j++)
450 {
451 unique = 0;
452 /* check for unique items, or unique squares */
453 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
454 {
455 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
456 unique = 1;
457
458 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
459 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
460 }
461 } 358 }
462#endif
463 359
464 return true; 360 return true;
465} 361}
466 362
467void 363void
468maptile::activate () 364maptile::activate ()
469{ 365{
470 if (!spaces) 366 if (state != MAP_INACTIVE)
471 return; 367 return;
472 368
473 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 369 for (mapspace *ms = spaces + size (); ms-- > spaces; )
474 for (object *op = ms->bot; op; op = op->above) 370 for (object *op = ms->bot; op; op = op->above)
475 op->activate_recursive (); 371 op->activate_recursive ();
372
373 state = MAP_ACTIVE;
374
375 activate_physics ();
476} 376}
477 377
478void 378void
479maptile::deactivate () 379maptile::deactivate ()
480{ 380{
481 if (!spaces) 381 if (state != MAP_ACTIVE)
482 return; 382 return;
483 383
484 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 384 for (mapspace *ms = spaces + size (); ms-- > spaces; )
485 for (object *op = ms->bot; op; op = op->above) 385 for (object *op = ms->bot; op; op = op->above)
486 op->deactivate_recursive (); 386 op->deactivate_recursive ();
387
388 state = MAP_INACTIVE;
487} 389}
488 390
489bool 391bool
490maptile::_save_objects (object_freezer &freezer, int flags) 392maptile::_save_objects (object_freezer &f, int flags)
491{ 393{
492 static int cede_count = 0; 394 coroapi::cede_to_tick ();
493 395
494 if (flags & IO_HEADER) 396 if (flags & IO_HEADER)
495 _save_header (freezer); 397 _save_header (f);
496 398
497 if (!spaces) 399 if (!spaces)
498 return false; 400 return false;
499 401
500 for (int i = 0; i < size (); ++i) 402 for (int i = 0; i < size (); ++i)
501 { 403 {
502#if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D
503 if (cede_count >= 500)
504 {
505 cede_count = 0;
506 coroapi::cede ();
507 }
508#endif
509
510 int unique = 0; 404 bool unique = 0;
405
511 for (object *op = spaces [i].bot; op; op = op->above) 406 for (object *op = spaces [i].bot; op; op = op->above)
512 { 407 {
513 // count per-object, but cede only when modification-safe
514 cede_count++;
515
516 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 408 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
517 unique = 1;
518 409
519 if (!op->can_map_save ()) 410 if (expect_false (!op->can_map_save ()))
520 continue; 411 continue;
521 412
522 if (unique || op->flag [FLAG_UNIQUE]) 413 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
523 { 414 {
524 if (flags & IO_UNIQUES) 415 if (flags & IO_UNIQUES)
525 save_object (freezer, op, 1); 416 op->write (f);
526 } 417 }
527 else if (flags & IO_OBJECTS) 418 else if (expect_true (flags & IO_OBJECTS))
528 save_object (freezer, op, 1); 419 op->write (f);
529 } 420 }
530 } 421 }
531 422
423 coroapi::cede_to_tick ();
424
532 return true; 425 return true;
533}
534
535bool
536maptile::_load_objects (const char *path, bool skip_header)
537{
538 object_thawer thawer (path);
539
540 if (!thawer)
541 return false;
542
543 if (skip_header)
544 for (;;)
545 {
546 keyword kw = thawer.get_kv ();
547
548 if (kw == KW_end)
549 break;
550
551 thawer.skip_kv (kw);
552 }
553
554 return _load_objects (thawer);
555} 426}
556 427
557bool 428bool
558maptile::_save_objects (const char *path, int flags) 429maptile::_save_objects (const char *path, int flags)
559{ 430{
… …
563 return false; 434 return false;
564 435
565 return freezer.save (path); 436 return freezer.save (path);
566} 437}
567 438
568maptile::maptile () 439void
440maptile::init ()
569{ 441{
570 in_memory = MAP_SWAPPED; 442 state = MAP_SWAPPED;
571 443
572 /* The maps used to pick up default x and y values from the 444 /* The maps used to pick up default x and y values from the
573 * map archetype. Mimic that behaviour. 445 * map archetype. Mimic that behaviour.
574 */ 446 */
575 width = 16; 447 width = 16;
576 height = 16; 448 height = 16;
449 timeout = 300;
450 max_items = MAX_ITEM_PER_ACTION;
451 max_volume = 2000000; // 2m³
577 reset_timeout = 0; 452 reset_timeout = 0;
578 timeout = 300;
579 enter_x = 0; 453 enter_x = 0;
580 enter_y = 0; 454 enter_y = 0;
581} 455}
582 456
457maptile::maptile ()
458{
459 init ();
460}
461
583maptile::maptile (int w, int h) 462maptile::maptile (int w, int h)
584{ 463{
585 in_memory = MAP_SWAPPED; 464 init ();
586 465
587 width = w; 466 width = w;
588 height = h; 467 height = h;
589 reset_timeout = 0;
590 timeout = 300;
591 enter_x = 0;
592 enter_y = 0;
593 468
594 alloc (); 469 alloc ();
595} 470}
596 471
597/* 472/*
… …
605 if (spaces) 480 if (spaces)
606 return; 481 return;
607 482
608 spaces = salloc0<mapspace> (size ()); 483 spaces = salloc0<mapspace> (size ());
609} 484}
485
486//+GPL
610 487
611/* Takes a string from a map definition and outputs a pointer to the array of shopitems 488/* Takes a string from a map definition and outputs a pointer to the array of shopitems
612 * corresponding to that string. Memory is allocated for this, it must be freed 489 * corresponding to that string. Memory is allocated for this, it must be freed
613 * at a later date. 490 * at a later date.
614 * Called by parse_map_headers below. 491 * Called by parse_map_headers below.
… …
691 return items; 568 return items;
692} 569}
693 570
694/* opposite of parse string, this puts the string that was originally fed in to 571/* opposite of parse string, this puts the string that was originally fed in to
695 * the map (or something equivilent) into output_string. */ 572 * the map (or something equivilent) into output_string. */
696static void 573static const char *
697print_shop_string (maptile *m, char *output_string) 574print_shop_string (maptile *m)
698{ 575{
699 int i; 576 static dynbuf_text buf; buf.clear ();
700 char tmp[MAX_BUF]; 577 bool first = true;
701 578
702 strcpy (output_string, "");
703 for (i = 0; i < m->shopitems[0].index; i++) 579 for (int i = 0; i < m->shopitems[0].index; i++)
704 { 580 {
581 if (!first)
582 buf << ';';
583
584 first = false;
585
705 if (m->shopitems[i].typenum) 586 if (m->shopitems[i].typenum)
706 { 587 {
707 if (m->shopitems[i].strength) 588 if (m->shopitems[i].strength)
708 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 589 buf.printf ("%s:%d", m->shopitems[i].name, m->shopitems[i].strength);
709 else 590 else
710 sprintf (tmp, "%s;", m->shopitems[i].name); 591 buf.printf ("%s", m->shopitems[i].name);
711 } 592 }
712 else 593 else
713 { 594 {
714 if (m->shopitems[i].strength) 595 if (m->shopitems[i].strength)
715 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 596 buf.printf ("*:%d", m->shopitems[i].strength);
716 else 597 else
717 sprintf (tmp, "*"); 598 buf.printf ("*");
718 } 599 }
719
720 strcat (output_string, tmp);
721 } 600 }
601
602 return buf;
722} 603}
604
605//-GPL
723 606
724/* This loads the header information of the map. The header 607/* This loads the header information of the map. The header
725 * contains things like difficulty, size, timeout, etc. 608 * contains things like difficulty, size, timeout, etc.
726 * this used to be stored in the map object, but with the 609 * this used to be stored in the map object, but with the
727 * addition of tiling, fields beyond that easily named in an 610 * addition of tiling, fields beyond that easily named in an
… …
735bool 618bool
736maptile::_load_header (object_thawer &thawer) 619maptile::_load_header (object_thawer &thawer)
737{ 620{
738 for (;;) 621 for (;;)
739 { 622 {
740 keyword kw = thawer.get_kv ();
741
742 switch (kw) 623 switch (thawer.kw)
743 { 624 {
744 case KW_EOF:
745 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
746 return false;
747
748 case KW_end:
749 return true;
750
751 default:
752 case KW_ERROR:
753 LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword);
754 break;
755
756 case KW_msg: 625 case KW_msg:
757 thawer.get_ml (KW_endmsg, msg); 626 thawer.get_ml (KW_endmsg, msg);
758 break; 627 break;
759 628
760 case KW_lore: // CF+ extension 629 case KW_lore: // deliantra extension
761 thawer.get_ml (KW_endlore, maplore); 630 thawer.get_ml (KW_endlore, maplore);
762 break; 631 break;
763 632
764 case KW_maplore: 633 case KW_maplore:
765 thawer.get_ml (KW_endmaplore, maplore); 634 thawer.get_ml (KW_endmaplore, maplore);
… …
782 case KW_shopgreed: thawer.get (shopgreed); break; 651 case KW_shopgreed: thawer.get (shopgreed); break;
783 case KW_shopmin: thawer.get (shopmin); break; 652 case KW_shopmin: thawer.get (shopmin); break;
784 case KW_shopmax: thawer.get (shopmax); break; 653 case KW_shopmax: thawer.get (shopmax); break;
785 case KW_shoprace: thawer.get (shoprace); break; 654 case KW_shoprace: thawer.get (shoprace); break;
786 case KW_outdoor: thawer.get (outdoor); break; 655 case KW_outdoor: thawer.get (outdoor); break;
787 case KW_temp: thawer.get (temp); break;
788 case KW_pressure: thawer.get (pressure); break;
789 case KW_humid: thawer.get (humid); break;
790 case KW_windspeed: thawer.get (windspeed); break;
791 case KW_winddir: thawer.get (winddir); break;
792 case KW_sky: thawer.get (sky); break;
793 656
794 case KW_per_player: thawer.get (per_player); break; 657 case KW_per_player: thawer.get (per_player); break;
795 case KW_per_party: thawer.get (per_party); break; 658 case KW_per_party: thawer.get (per_party); break;
659 case KW_no_reset: thawer.get (no_reset); break;
660 case KW_no_drop: thawer.get (no_drop); break;
796 661
797 case KW_region: get_region_by_name (thawer.get_str ()); break; 662 case KW_region: thawer.get (default_region); break;
798 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 663 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
799 664
800 // old names new names 665 // old names new names
801 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 666 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
802 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 667 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
806 case KW_value: case KW_swap_time: thawer.get (timeout); break; 671 case KW_value: case KW_swap_time: thawer.get (timeout); break;
807 case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break; 672 case KW_level: case KW_difficulty: thawer.get (difficulty); difficulty = clamp (difficulty, 1, settings.max_level); break;
808 case KW_invisible: case KW_darkness: thawer.get (darkness); break; 673 case KW_invisible: case KW_darkness: thawer.get (darkness); break;
809 case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break; 674 case KW_stand_still: case KW_fixed_resettime: thawer.get (fixed_resettime); break;
810 675
811 case KW_tile_path_1: thawer.get (tile_path [0]); break; 676 case KW_tile_path_1: thawer.get (tile_path [TILE_NORTH]); break;
812 case KW_tile_path_2: thawer.get (tile_path [1]); break; 677 case KW_tile_path_2: thawer.get (tile_path [TILE_EAST ]); break;
813 case KW_tile_path_3: thawer.get (tile_path [2]); break; 678 case KW_tile_path_3: thawer.get (tile_path [TILE_SOUTH]); break;
814 case KW_tile_path_4: thawer.get (tile_path [3]); break; 679 case KW_tile_path_4: thawer.get (tile_path [TILE_WEST ]); break;
680 case KW_tile_path_5: thawer.get (tile_path [TILE_UP ]); break;
681 case KW_tile_path_6: thawer.get (tile_path [TILE_DOWN ]); break;
682
683 case KW_ERROR:
684 set_key_text (thawer.kw_str, thawer.value);
685 break;
686
687 case KW_end:
688 thawer.next ();
689 return true;
690
691 default:
692 if (!thawer.parse_error ("map"))
693 return false;
694 break;
815 } 695 }
696
697 thawer.next ();
816 } 698 }
817 699
818 abort (); 700 abort ();
819} 701}
820 702
821bool 703//+GPL
822maptile::_load_header (const char *path)
823{
824 object_thawer thawer (path);
825
826 if (!thawer)
827 return false;
828
829 return _load_header (thawer);
830}
831 704
832/****************************************************************************** 705/******************************************************************************
833 * This is the start of unique map handling code 706 * This is the start of unique map handling code
834 *****************************************************************************/ 707 *****************************************************************************/
835 708
… …
842 int unique = 0; 715 int unique = 0;
843 for (object *op = spaces [i].bot; op; ) 716 for (object *op = spaces [i].bot; op; )
844 { 717 {
845 object *above = op->above; 718 object *above = op->above;
846 719
847 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 720 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
848 unique = 1; 721 unique = 1;
849 722
850 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 723 if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique))
851 {
852 op->destroy_inv (false);
853 op->destroy (); 724 op->destroy ();
854 }
855 725
856 op = above; 726 op = above;
857 } 727 }
858 } 728 }
859} 729}
860 730
731//-GPL
732
861bool 733bool
862maptile::_save_header (object_freezer &freezer) 734maptile::_save_header (object_freezer &freezer)
863{ 735{
864#define MAP_OUT(k) freezer.put (KW_ ## k, k) 736#define MAP_OUT(k) freezer.put (KW(k), k)
865#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 737#define MAP_OUT2(k,v) freezer.put (KW(k), v)
866 738
867 MAP_OUT2 (arch, "map"); 739 MAP_OUT2 (arch, CS(map));
868 740
869 if (name) MAP_OUT (name); 741 if (name) MAP_OUT (name);
870 MAP_OUT (swap_time); 742 MAP_OUT (swap_time);
871 MAP_OUT (reset_time); 743 MAP_OUT (reset_time);
872 MAP_OUT (reset_timeout); 744 MAP_OUT (reset_timeout);
873 MAP_OUT (fixed_resettime); 745 MAP_OUT (fixed_resettime);
746 MAP_OUT (no_reset);
747 MAP_OUT (no_drop);
874 MAP_OUT (difficulty); 748 MAP_OUT (difficulty);
875
876 if (region) MAP_OUT2 (region, region->name); 749 if (default_region) MAP_OUT2 (region, default_region->name);
877 750
878 if (shopitems) 751 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
879 {
880 char shop[MAX_BUF];
881 print_shop_string (this, shop);
882 MAP_OUT2 (shopitems, shop);
883 }
884
885 MAP_OUT (shopgreed); 752 MAP_OUT (shopgreed);
886 MAP_OUT (shopmin); 753 MAP_OUT (shopmin);
887 MAP_OUT (shopmax); 754 MAP_OUT (shopmax);
888 if (shoprace) MAP_OUT (shoprace); 755 if (shoprace) MAP_OUT (shoprace);
889 MAP_OUT (darkness); 756
890 MAP_OUT (width); 757 MAP_OUT (width);
891 MAP_OUT (height); 758 MAP_OUT (height);
892 MAP_OUT (enter_x); 759 MAP_OUT (enter_x);
893 MAP_OUT (enter_y); 760 MAP_OUT (enter_y);
894 761 MAP_OUT (darkness);
895 if (msg) freezer.put (KW_msg , KW_endmsg , msg);
896 if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
897
898 MAP_OUT (outdoor); 762 MAP_OUT (outdoor);
899 MAP_OUT (temp); 763
900 MAP_OUT (pressure); 764 if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
901 MAP_OUT (humid); 765 if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
902 MAP_OUT (windspeed);
903 MAP_OUT (winddir);
904 MAP_OUT (sky);
905 766
906 MAP_OUT (per_player); 767 MAP_OUT (per_player);
907 MAP_OUT (per_party); 768 MAP_OUT (per_party);
908 769
909 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); 770 if (tile_path [TILE_NORTH]) MAP_OUT2 (tile_path_1, tile_path [TILE_NORTH]);
910 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); 771 if (tile_path [TILE_EAST ]) MAP_OUT2 (tile_path_2, tile_path [TILE_EAST ]);
911 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); 772 if (tile_path [TILE_SOUTH]) MAP_OUT2 (tile_path_3, tile_path [TILE_SOUTH]);
912 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); 773 if (tile_path [TILE_WEST ]) MAP_OUT2 (tile_path_4, tile_path [TILE_WEST ]);
774 if (tile_path [TILE_UP ]) MAP_OUT2 (tile_path_5, tile_path [TILE_UP ]);
775 if (tile_path [TILE_DOWN ]) MAP_OUT2 (tile_path_6, tile_path [TILE_DOWN ]);
913 776
914 freezer.put (this); 777 freezer.put (this);
915 freezer.put (KW_end); 778 freezer.put (KW(end));
916 779
917 return true; 780 return true;
918} 781}
919 782
920bool 783bool
… …
926 return false; 789 return false;
927 790
928 return freezer.save (path); 791 return freezer.save (path);
929} 792}
930 793
794//+GPL
795
931/* 796/*
932 * Remove and free all objects in the given map. 797 * Remove and free all objects in the given map.
933 */ 798 */
934void 799void
935maptile::clear () 800maptile::clear ()
936{ 801{
937 if (!spaces) 802 if (spaces)
938 return; 803 {
939
940 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 804 for (mapspace *ms = spaces + size (); ms-- > spaces; )
941 while (object *op = ms->bot) 805 while (object *op = ms->bot)
942 { 806 {
807 // manually remove, as to not trigger anything
808 if (ms->bot = op->above)
809 ms->bot->below = 0;
810
811 op->flag [FLAG_REMOVED] = true;
812
813 object *head = op->head_ ();
943 if (op->head) 814 if (op == head)
944 op = op->head;
945
946 op->destroy_inv (false);
947 op->destroy (); 815 op->destroy ();
816 else if (head->map != op->map)
817 {
818 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
819 head->destroy ();
820 }
821 }
822
823 sfree0 (spaces, size ());
948 } 824 }
949
950 sfree (spaces, size ()), spaces = 0;
951 825
952 if (buttons) 826 if (buttons)
953 free_objectlinkpt (buttons), buttons = 0; 827 free_objectlinkpt (buttons), buttons = 0;
828
829 sfree0 (regions, size ());
830 delete [] regionmap; regionmap = 0;
954} 831}
955 832
956void 833void
957maptile::clear_header () 834maptile::clear_header ()
958{ 835{
… …
960 msg = 0; 837 msg = 0;
961 maplore = 0; 838 maplore = 0;
962 shoprace = 0; 839 shoprace = 0;
963 delete [] shopitems, shopitems = 0; 840 delete [] shopitems, shopitems = 0;
964 841
965 for (int i = 0; i < 4; i++) 842 for (int i = 0; i < array_length (tile_path); i++)
966 tile_path [i] = 0; 843 tile_path [i] = 0;
967} 844}
968 845
969maptile::~maptile () 846maptile::~maptile ()
970{ 847{
… …
977 /* We need to look through all the maps and see if any maps 854 /* We need to look through all the maps and see if any maps
978 * are pointing at this one for tiling information. Since 855 * are pointing at this one for tiling information. Since
979 * tiling can be asymetric, we just can not look to see which 856 * tiling can be asymetric, we just can not look to see which
980 * maps this map tiles with and clears those. 857 * maps this map tiles with and clears those.
981 */ 858 */
982 for (int i = 0; i < 4; i++) 859 for (int i = 0; i < array_length (tile_path); i++)
983 if (tile_map[i] == m) 860 if (tile_map[i] == m)
984 tile_map[i] = 0; 861 tile_map[i] = 0;
985} 862}
986 863
987void 864void
… …
990 attachable::do_destroy (); 867 attachable::do_destroy ();
991 868
992 clear (); 869 clear ();
993} 870}
994 871
995/* 872/* decay and destroy perishable items in a map */
996 * Updates every button on the map (by calling update_button() for them). 873// TODO: should be done regularly, not on map load?
997 */
998void 874void
999maptile::update_buttons () 875maptile::do_decay_objects ()
1000{ 876{
1001 for (oblinkpt *obp = buttons; obp; obp = obp->next) 877 if (!spaces)
1002 for (objectlink *ol = obp->link; ol; ol = ol->next) 878 return;
879
880 for (mapspace *ms = spaces + size (); ms-- > spaces; )
881 for (object *above, *op = ms->bot; op; op = above)
1003 { 882 {
1004 if (!ol->ob) 883 above = op->above;
884
885 // do not decay anything above unique floor tiles (yet :)
886 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
887 break;
888
889 bool destroy = 0;
890
891 if (op->flag [FLAG_IS_FLOOR]
892 || op->flag [FLAG_OBJ_ORIGINAL]
893 || op->flag [FLAG_UNIQUE]
894 || op->flag [FLAG_OVERLAY_FLOOR]
895 || op->flag [FLAG_UNPAID]
896 || op->is_alive ())
897 ; // do not decay
898 else if (op->is_weapon ())
1005 { 899 {
1006 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", 900 op->stats.dam--;
1007 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); 901 if (op->stats.dam < 0)
1008 continue; 902 destroy = 1;
1009 } 903 }
1010 904 else if (op->is_armor ())
1011 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
1012 { 905 {
1013 update_button (ol->ob); 906 op->stats.ac--;
1014 break; 907 if (op->stats.ac < 0)
908 destroy = 1;
1015 } 909 }
910 else if (op->type == FOOD)
911 {
912 op->stats.food -= rndm (5, 20);
913 if (op->stats.food < 0)
914 destroy = 1;
915 }
916 else
917 {
918 int mat = op->materials;
919
920 if (mat & M_PAPER
921 || mat & M_LEATHER
922 || mat & M_WOOD
923 || mat & M_ORGANIC
924 || mat & M_CLOTH
925 || mat & M_LIQUID
926 || (mat & M_IRON && rndm (1, 5) == 1)
927 || (mat & M_GLASS && rndm (1, 2) == 1)
928 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
929 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
930 //|| (mat & M_ICE && temp > 32)
931 )
932 destroy = 1;
933 }
934
935 /* adjust overall chance below */
936 if (destroy && rndm (0, 1))
937 op->destroy ();
1016 } 938 }
1017} 939}
1018 940
1019/* 941/*
1020 * This routine is supposed to find out the difficulty of the map. 942 * This routine is supposed to find out the difficulty of the map.
1021 * difficulty does not have a lot to do with character level, 943 * difficulty does not have a lot to do with character level,
1022 * but does have a lot to do with treasure on the map. 944 * but does have a lot to do with treasure on the map.
1023 * 945 *
1024 * Difficulty can now be set by the map creature. If the value stored 946 * Difficulty can now be set by the map creator. If the value stored
1025 * in the map is zero, then use this routine. Maps should really 947 * in the map is zero, then use this routine. Maps should really
1026 * have a difficulty set than using this function - human calculation 948 * have a difficulty set rather than using this function - human calculation
1027 * is much better than this functions guesswork. 949 * is much better than this function's guesswork.
1028 */ 950 */
1029int 951int
1030maptile::estimate_difficulty () const 952maptile::estimate_difficulty () const
1031{ 953{
1032 long monster_cnt = 0; 954 long monster_cnt = 0;
… …
1034 sint64 total_exp = 0; 956 sint64 total_exp = 0;
1035 957
1036 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 958 for (mapspace *ms = spaces + size (); ms-- > spaces; )
1037 for (object *op = ms->bot; op; op = op->above) 959 for (object *op = ms->bot; op; op = op->above)
1038 { 960 {
1039 if (QUERY_FLAG (op, FLAG_MONSTER)) 961 if (op->flag [FLAG_MONSTER])
1040 { 962 {
1041 total_exp += op->stats.exp; 963 total_exp += op->stats.exp;
1042 monster_cnt++; 964 monster_cnt++;
1043 } 965 }
1044 966
1045 if (QUERY_FLAG (op, FLAG_GENERATOR)) 967 if (op->flag [FLAG_GENERATOR])
1046 { 968 {
1047 total_exp += op->stats.exp; 969 total_exp += op->stats.exp;
1048 970
1049 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 971 if (archetype *at = op->other_arch)
972 {
1050 total_exp += at->clone.stats.exp * 8; 973 total_exp += at->stats.exp * 8;
1051
1052 monster_cnt++; 974 monster_cnt++;
975 }
976
977 for (object *inv = op->inv; inv; inv = inv->below)
978 {
979 total_exp += op->stats.exp * 8;
980 monster_cnt++;
981 }
1053 } 982 }
1054 } 983 }
1055 984
1056 avgexp = (double) total_exp / monster_cnt; 985 avgexp = (double) total_exp / monster_cnt;
1057 986
… …
1070 * postive values make it darker, negative make it brighter 999 * postive values make it darker, negative make it brighter
1071 */ 1000 */
1072int 1001int
1073maptile::change_map_light (int change) 1002maptile::change_map_light (int change)
1074{ 1003{
1075 int new_level = darkness + change;
1076
1077 /* Nothing to do */ 1004 /* Nothing to do */
1078 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1005 if (!change)
1079 return 0; 1006 return 0;
1080 1007
1081 /* inform all players on the map */ 1008 /* inform all players on the map */
1082 if (change > 0) 1009 if (change > 0)
1083 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1010 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1084 else 1011 else
1085 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1012 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1086 1013
1087 /* Do extra checking. since darkness is a unsigned value, 1014 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1088 * we need to be extra careful about negative values.
1089 * In general, the checks below are only needed if change
1090 * is not +/-1
1091 */
1092 if (new_level < 0)
1093 darkness = 0;
1094 else if (new_level >= MAX_DARKNESS)
1095 darkness = MAX_DARKNESS;
1096 else
1097 darkness = new_level;
1098 1015
1099 /* All clients need to get re-updated for the change */ 1016 /* All clients need to get re-updated for the change */
1100 update_all_map_los (this); 1017 update_all_map_los (this);
1018
1101 return 1; 1019 return 1;
1102} 1020}
1103 1021
1104/* 1022/*
1105 * This function updates various attributes about a specific space 1023 * This function updates various attributes about a specific space
… …
1108 * through, etc) 1026 * through, etc)
1109 */ 1027 */
1110void 1028void
1111mapspace::update_ () 1029mapspace::update_ ()
1112{ 1030{
1113 object *tmp, *last = 0; 1031 object *last = 0;
1114 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1032 uint8 flags = P_UPTODATE;
1115 New_Face *top, *floor, *middle; 1033 sint8 light = 0;
1116 object *top_obj, *floor_obj, *middle_obj;
1117 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1034 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1035 uint64_t volume = 0;
1036 uint32_t items = 0;
1037 object *anywhere = 0;
1038 uint8_t middle_visibility = 0;
1118 1039
1119 middle = blank_face; 1040 //object *middle = 0;
1120 top = blank_face; 1041 //object *top = 0;
1121 floor = blank_face; 1042 //object *floor = 0;
1043 // this seems to generate better code than using locals, above
1044 object *&top = faces_obj[0] = 0;
1045 object *&middle = faces_obj[1] = 0;
1046 object *&floor = faces_obj[2] = 0;
1122 1047
1123 middle_obj = 0; 1048 object::flags_t allflags; // all flags of all objects or'ed together
1124 top_obj = 0;
1125 floor_obj = 0;
1126 1049
1127 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1050 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1128 { 1051 {
1129 /* This could be made additive I guess (two lights better than 1052 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1130 * one). But if so, it shouldn't be a simple additive - 2
1131 * light bulbs do not illuminate twice as far as once since
1132 * it is a dissapation factor that is cubed.
1133 */
1134 if (tmp->glow_radius > light)
1135 light = tmp->glow_radius; 1053 light += tmp->glow_radius;
1136 1054
1137 /* This call is needed in order to update objects the player 1055 /* This call is needed in order to update objects the player
1138 * is standing in that have animations (ie, grass, fire, etc). 1056 * is standing in that have animations (ie, grass, fire, etc).
1139 * However, it also causes the look window to be re-drawn 1057 * However, it also causes the look window to be re-drawn
1140 * 3 times each time the player moves, because many of the 1058 * 3 times each time the player moves, because many of the
1141 * functions the move_player calls eventualy call this. 1059 * functions the move_player calls eventualy call this.
1142 * 1060 *
1143 * Always put the player down for drawing. 1061 * Always put the player down for drawing.
1144 */ 1062 */
1145 if (!tmp->invisible) 1063 if (expect_true (!tmp->invisible))
1146 { 1064 {
1147 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1065 if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]))
1148 {
1149 top = tmp->face;
1150 top_obj = tmp; 1066 top = tmp;
1151 } 1067 else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1152 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1153 { 1068 {
1154 /* If we got a floor, that means middle and top were below it, 1069 /* If we got a floor, that means middle and top were below it,
1155 * so should not be visible, so we clear them. 1070 * so should not be visible, so we clear them.
1156 */ 1071 */
1157 middle = blank_face; 1072 middle = 0;
1158 top = blank_face; 1073 top = 0;
1159 floor = tmp->face;
1160 floor_obj = tmp; 1074 floor = tmp;
1075 volume = 0;
1076 items = 0;
1161 } 1077 }
1162 /* Flag anywhere have high priority */ 1078 else
1163 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1164 { 1079 {
1165 middle = tmp->face; 1080 if (expect_true (!tmp->flag [FLAG_NO_PICK]))
1081 {
1082 ++items;
1083 volume += tmp->volume ();
1084 }
1166 1085
1167 middle_obj = tmp; 1086 /* Flag anywhere have high priority */
1087 if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1168 anywhere = 1; 1088 anywhere = tmp;
1089
1090 /* Find the highest visible face around. If equal
1091 * visibilities, we still want the one nearer to the
1092 * top
1093 */
1094 if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
1095 {
1096 middle_visibility = ::faces [tmp->face].visibility;
1097 middle = tmp;
1098 }
1169 } 1099 }
1170 /* Find the highest visible face around. If equal
1171 * visibilities, we still want the one nearer to the
1172 * top
1173 */
1174 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere))
1175 {
1176 middle = tmp->face;
1177 middle_obj = tmp;
1178 }
1179 }
1180
1181 if (tmp == tmp->above)
1182 {
1183 LOG (llevError, "Error in structure of map\n");
1184 exit (-1);
1185 } 1100 }
1186 1101
1187 move_slow |= tmp->move_slow; 1102 move_slow |= tmp->move_slow;
1188 move_block |= tmp->move_block; 1103 move_block |= tmp->move_block;
1189 move_on |= tmp->move_on; 1104 move_on |= tmp->move_on;
1190 move_off |= tmp->move_off; 1105 move_off |= tmp->move_off;
1191 move_allow |= tmp->move_allow; 1106 move_allow |= tmp->move_allow;
1192 1107
1193 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; 1108 allflags |= tmp->flag;
1194 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; 1109
1195 if (tmp->type == PLAYER) flags |= P_PLAYER; 1110 if (tmp->type == PLAYER) flags |= P_PLAYER;
1196 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1111 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1197 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1198 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1199 } 1112 }
1200 1113
1201 this->light = light; 1114 // FLAG_SEE_ANYWHERE takes precedence
1115 if (anywhere)
1116 middle = anywhere;
1117
1118 // ORing all flags together and checking them here is much faster
1119 if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
1120 if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC;
1121 if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE;
1122 if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC;
1123
1124 this->light = min (light, MAX_LIGHT_RADIUS);
1202 this->flags_ = flags; 1125 this->flags_ = flags;
1203 this->move_block = move_block & ~move_allow; 1126 this->move_block = move_block & ~move_allow;
1204 this->move_on = move_on; 1127 this->move_on = move_on;
1205 this->move_off = move_off; 1128 this->move_off = move_off;
1206 this->move_slow = move_slow; 1129 this->move_slow = move_slow;
1130 this->volume_ = (volume + 1023) / 1024;
1131 this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1207 1132
1208 /* At this point, we have a floor face (if there is a floor), 1133 /* At this point, we have a floor face (if there is a floor),
1209 * and the floor is set - we are not going to touch it at 1134 * and the floor is set - we are not going to touch it at
1210 * this point. 1135 * this point.
1211 * middle contains the highest visibility face. 1136 * middle contains the highest visibility face.
… …
1218 * middle face. This should not happen, as we already have the 1143 * middle face. This should not happen, as we already have the
1219 * else statement above so middle should not get set. OTOH, it 1144 * else statement above so middle should not get set. OTOH, it
1220 * may be possible for the faces to match but be different objects. 1145 * may be possible for the faces to match but be different objects.
1221 */ 1146 */
1222 if (top == middle) 1147 if (top == middle)
1223 middle = blank_face; 1148 middle = 0;
1224 1149
1225 /* There are three posibilities at this point: 1150 /* There are three posibilities at this point:
1226 * 1) top face is set, need middle to be set. 1151 * 1) top face is set, need middle to be set.
1227 * 2) middle is set, need to set top. 1152 * 2) middle is set, need to set top.
1228 * 3) neither middle or top is set - need to set both. 1153 * 3) neither middle or top is set - need to set both.
1229 */ 1154 */
1230 1155
1231 for (tmp = last; tmp; tmp = tmp->below) 1156 for (object *tmp = last; tmp; tmp = tmp->below)
1232 { 1157 {
1233 /* Once we get to a floor, stop, since we already have a floor object */ 1158 /* Once we get to a floor, stop, since we already have a floor object */
1234 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1159 if (tmp->flag [FLAG_IS_FLOOR])
1235 break; 1160 break;
1236 1161
1237 /* If two top faces are already set, quit processing */ 1162 /* If two top faces are already set, quit processing */
1238 if ((top != blank_face) && (middle != blank_face)) 1163 if (top && middle)
1239 break; 1164 break;
1240 1165
1241 /* Only show visible faces */ 1166 /* Only show visible faces */
1242 if (!tmp->invisible) 1167 if (!tmp->invisible)
1243 { 1168 {
1244 /* Fill in top if needed */ 1169 /* Fill in top if needed */
1245 if (top == blank_face) 1170 if (!top)
1246 { 1171 {
1247 top = tmp->face;
1248 top_obj = tmp; 1172 top = tmp;
1249 if (top == middle) 1173 if (top == middle)
1250 middle = blank_face; 1174 middle = 0;
1251 } 1175 }
1252 else 1176 else
1253 { 1177 {
1254 /* top is already set - we should only get here if 1178 /* top is already set - we should only get here if
1255 * middle is not set 1179 * middle is not set
1256 * 1180 *
1257 * Set the middle face and break out, since there is nothing 1181 * Set the middle face and break out, since there is nothing
1258 * more to fill in. We don't check visiblity here, since 1182 * more to fill in. We don't check visiblity here, since
1259 * 1183 *
1260 */ 1184 */
1261 if (tmp->face != top) 1185 if (tmp != top)
1262 { 1186 {
1263 middle = tmp->face;
1264 middle_obj = tmp; 1187 middle = tmp;
1265 break; 1188 break;
1266 } 1189 }
1267 } 1190 }
1268 } 1191 }
1269 } 1192 }
1270 1193
1271 if (middle == floor) 1194 if (middle == floor)
1272 middle = blank_face; 1195 middle = 0;
1273 1196
1274 if (top == middle) 1197 if (top == middle)
1275 middle = blank_face; 1198 middle = 0;
1276 1199
1277 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1200 // set lower map transparent floor flag if applicable
1278 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1201 if (floor && floor->flag [FLAG_IS_TRANSPARENT_FLOOR] && !middle && !top)
1279 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
1280}
1281
1282/* this updates the orig_map->tile_map[tile_num] value after finding
1283 * the map. It also takes care of linking back the freshly found
1284 * maps tile_map values if it tiles back to this one. It returns
1285 * the value of orig_map->tile_map[tile_num].
1286 */
1287static inline maptile *
1288find_and_link (maptile *orig_map, int tile_num)
1289{
1290 maptile *mp = orig_map->tile_map [tile_num];
1291
1292 if (!mp)
1293 { 1202 {
1294 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); 1203 floor->set_anim_frame (0);
1295 1204
1296 if (!mp) 1205 if (maptile *m = floor->map->tile_map [TILE_DOWN])
1297 { 1206 {
1298 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine 1207 mapspace &ms = m->at (floor->x, floor->y);
1299 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", 1208 ms.update ();
1300 &orig_map->tile_path[tile_num], &orig_map->path); 1209
1301 mp = new maptile (1, 1); 1210 if (object *floor2 = ms.faces_obj [2])
1302 mp->alloc (); 1211 if (!floor2->flag [FLAG_IS_TRANSPARENT_FLOOR])
1303 mp->in_memory = MAP_IN_MEMORY; 1212 {
1213 floor->set_anim_frame (1);
1214 top = floor;
1215 middle = ms.faces_obj [0];
1216 floor = floor2;
1217 }
1218
1219 ms.pflags |= PF_VIS_UP;
1304 } 1220 }
1305 } 1221 }
1306 1222
1307 int dest_tile = (tile_num + 2) % 4; 1223#if 0
1224 faces_obj [0] = top;
1225 faces_obj [1] = middle;
1226 faces_obj [2] = floor;
1227#endif
1228}
1308 1229
1309 orig_map->tile_map [tile_num] = mp; 1230void
1231mapspace::update_up ()
1232{
1233 // invalidate up
1234 if (!(pflags & PF_VIS_UP))
1235 return;
1310 1236
1311 // optimisation: back-link map to origin map if euclidean 1237 pflags &= ~PF_VIS_UP;
1312 //TODO: non-euclidean maps MUST GO
1313 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1314 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1315 1238
1239 if (bot)
1240 if (maptile *m = bot->map->tile_map [TILE_UP])
1241 m->at (bot->x, bot->y).invalidate ();
1242}
1243
1244maptile *
1245maptile::tile_available (int dir, bool load)
1246{
1247 // map is there and we don't need to load it OR it's loaded => return what we have
1248 if (tile_map [dir] && (!load || tile_map [dir]->linkable ()))
1249 return tile_map [dir];
1250
1251 if (tile_path [dir])
1252 {
1253 // well, try to locate it then, if possible - maybe it's there already
1254 if (maptile *m = find_async (tile_path [dir], this, load))
1255 {
1256 bool match = true;
1257
1258 if (dir == TILE_NORTH || dir == TILE_SOUTH || dir == TILE_UP || dir == TILE_DOWN)
1259 if (width != m->width)
1260 match = false;
1261
1262 if (dir == TILE_EAST || dir == TILE_WEST || dir == TILE_UP || dir == TILE_DOWN)
1263 if (height != m->height)
1264 match = false;
1265
1266 if (!match)
1267 {
1268 LOG (llevError, "tile dimension mismatch for direction %d from %s to %s\n",
1269 dir, &path, &m->path);
1270 m = 0;
1271 }
1272
1273 // this could be optimised endlessly
1274 //m->activate_physics ();
1275
1276 return tile_map [dir] = m;
1277 }
1278 }
1279
1316 return mp; 1280 return 0;
1317}
1318
1319static inline void
1320load_and_link (maptile *orig_map, int tile_num)
1321{
1322 find_and_link (orig_map, tile_num)->load_sync ();
1323} 1281}
1324 1282
1325/* this returns TRUE if the coordinates (x,y) are out of 1283/* this returns TRUE if the coordinates (x,y) are out of
1326 * map m. This function also takes into account any 1284 * map m. This function also takes into account any
1327 * tiling considerations, loading adjacant maps as needed. 1285 * tiling considerations, loading adjacant maps as needed.
… …
1340 if (!m) 1298 if (!m)
1341 return 0; 1299 return 0;
1342 1300
1343 if (x < 0) 1301 if (x < 0)
1344 { 1302 {
1345 if (!m->tile_path[3]) 1303 if (!m->tile_available (TILE_WEST))
1346 return 1; 1304 return 1;
1347 1305
1348 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1349 find_and_link (m, 3);
1350
1351 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1306 return out_of_map (m->tile_map [TILE_WEST], x + m->tile_map [TILE_WEST]->width, y);
1352 } 1307 }
1353 1308
1354 if (x >= m->width) 1309 if (x >= m->width)
1355 { 1310 {
1356 if (!m->tile_path[1]) 1311 if (!m->tile_available (TILE_EAST))
1357 return 1; 1312 return 1;
1358 1313
1359 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1360 find_and_link (m, 1);
1361
1362 return out_of_map (m->tile_map[1], x - m->width, y); 1314 return out_of_map (m->tile_map [TILE_EAST], x - m->width, y);
1363 } 1315 }
1364 1316
1365 if (y < 0) 1317 if (y < 0)
1366 { 1318 {
1367 if (!m->tile_path[0]) 1319 if (!m->tile_available (TILE_NORTH))
1368 return 1; 1320 return 1;
1369 1321
1370 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1371 find_and_link (m, 0);
1372
1373 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1322 return out_of_map (m->tile_map [TILE_NORTH], x, y + m->tile_map [TILE_NORTH]->height);
1374 } 1323 }
1375 1324
1376 if (y >= m->height) 1325 if (y >= m->height)
1377 { 1326 {
1378 if (!m->tile_path[2]) 1327 if (!m->tile_available (TILE_SOUTH))
1379 return 1; 1328 return 1;
1380 1329
1381 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1382 find_and_link (m, 2);
1383
1384 return out_of_map (m->tile_map[2], x, y - m->height); 1330 return out_of_map (m->tile_map [TILE_SOUTH], x, y - m->height);
1385 } 1331 }
1386 1332
1387 /* Simple case - coordinates are within this local 1333 /* Simple case - coordinates are within this local
1388 * map. 1334 * map.
1389 */ 1335 */
… …
1401maptile * 1347maptile *
1402maptile::xy_find (sint16 &x, sint16 &y) 1348maptile::xy_find (sint16 &x, sint16 &y)
1403{ 1349{
1404 if (x < 0) 1350 if (x < 0)
1405 { 1351 {
1406 if (!tile_path[3]) 1352 if (!tile_available (TILE_WEST))
1407 return 0; 1353 return 0;
1408 1354
1409 find_and_link (this, 3);
1410 x += tile_map[3]->width; 1355 x += tile_map [TILE_WEST]->width;
1411 return tile_map[3]->xy_find (x, y); 1356 return tile_map [TILE_WEST]->xy_find (x, y);
1412 } 1357 }
1413 1358
1414 if (x >= width) 1359 if (x >= width)
1415 { 1360 {
1416 if (!tile_path[1]) 1361 if (!tile_available (TILE_EAST))
1417 return 0; 1362 return 0;
1418 1363
1419 find_and_link (this, 1);
1420 x -= width; 1364 x -= width;
1421 return tile_map[1]->xy_find (x, y); 1365 return tile_map [TILE_EAST]->xy_find (x, y);
1422 } 1366 }
1423 1367
1424 if (y < 0) 1368 if (y < 0)
1425 { 1369 {
1426 if (!tile_path[0]) 1370 if (!tile_available (TILE_NORTH))
1427 return 0; 1371 return 0;
1428 1372
1429 find_and_link (this, 0);
1430 y += tile_map[0]->height; 1373 y += tile_map [TILE_NORTH]->height;
1431 return tile_map[0]->xy_find (x, y); 1374 return tile_map [TILE_NORTH]->xy_find (x, y);
1432 } 1375 }
1433 1376
1434 if (y >= height) 1377 if (y >= height)
1435 { 1378 {
1436 if (!tile_path[2]) 1379 if (!tile_available (TILE_SOUTH))
1437 return 0; 1380 return 0;
1438 1381
1439 find_and_link (this, 2);
1440 y -= height; 1382 y -= height;
1441 return tile_map[2]->xy_find (x, y); 1383 return tile_map [TILE_SOUTH]->xy_find (x, y);
1442 } 1384 }
1443 1385
1444 /* Simple case - coordinates are within this local 1386 /* Simple case - coordinates are within this local
1445 * map. 1387 * map.
1446 */ 1388 */
… …
1449 1391
1450/** 1392/**
1451 * Return whether map2 is adjacent to map1. If so, store the distance from 1393 * Return whether map2 is adjacent to map1. If so, store the distance from
1452 * map1 to map2 in dx/dy. 1394 * map1 to map2 in dx/dy.
1453 */ 1395 */
1454static int 1396int
1455adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1397adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy)
1456{ 1398{
1457 if (!map1 || !map2) 1399 if (!map1 || !map2)
1458 return 0; 1400 return 0;
1459 1401
1460 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded 1402 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1461 //fix: compare paths instead (this is likely faster, too!) 1403 //fix: compare paths instead (this is likely faster, too!)
1462 if (map1 == map2) 1404 if (map1 == map2)
1463 { 1405 {
1464 *dx = 0; 1406 *dx = 0;
1465 *dy = 0; 1407 *dy = 0;
1466 } 1408 }
1467 else if (map1->tile_map[0] == map2) 1409 else if (map1->tile_available (TILE_NORTH, false) == map2)
1468 { /* up */ 1410 {
1469 *dx = 0; 1411 *dx = 0;
1470 *dy = -map2->height; 1412 *dy = -map2->height;
1471 } 1413 }
1472 else if (map1->tile_map[1] == map2) 1414 else if (map1->tile_available (TILE_EAST , false) == map2)
1473 { /* right */ 1415 {
1474 *dx = map1->width; 1416 *dx = map1->width;
1475 *dy = 0; 1417 *dy = 0;
1476 } 1418 }
1477 else if (map1->tile_map[2] == map2) 1419 else if (map1->tile_available (TILE_SOUTH, false) == map2)
1478 { /* down */ 1420 {
1479 *dx = 0; 1421 *dx = 0;
1480 *dy = map1->height; 1422 *dy = map1->height;
1481 } 1423 }
1482 else if (map1->tile_map[3] == map2) 1424 else if (map1->tile_available (TILE_WEST , false) == map2)
1483 { /* left */ 1425 {
1484 *dx = -map2->width; 1426 *dx = -map2->width;
1485 *dy = 0; 1427 *dy = 0;
1486 } 1428 }
1487 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) 1429 else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2)
1488 { /* up right */ 1430 { /* up right */
1489 *dx = map1->tile_map[0]->width; 1431 *dx = +map1->tile_map[TILE_NORTH]->width;
1490 *dy = -map1->tile_map[0]->height; 1432 *dy = -map1->tile_map[TILE_NORTH]->height;
1491 } 1433 }
1492 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) 1434 else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2)
1493 { /* up left */ 1435 { /* up left */
1494 *dx = -map2->width; 1436 *dx = -map2->width;
1495 *dy = -map1->tile_map[0]->height; 1437 *dy = -map1->tile_map[TILE_NORTH]->height;
1496 } 1438 }
1497 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) 1439 else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2)
1498 { /* right up */ 1440 { /* right up */
1499 *dx = map1->width; 1441 *dx = +map1->width;
1500 *dy = -map2->height; 1442 *dy = -map2->height;
1501 } 1443 }
1502 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) 1444 else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2)
1503 { /* right down */ 1445 { /* right down */
1504 *dx = map1->width; 1446 *dx = +map1->width;
1505 *dy = map1->tile_map[1]->height; 1447 *dy = +map1->tile_map[TILE_EAST]->height;
1506 } 1448 }
1507 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) 1449 else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2)
1508 { /* down right */ 1450 { /* down right */
1509 *dx = map1->tile_map[2]->width; 1451 *dx = +map1->tile_map[TILE_SOUTH]->width;
1510 *dy = map1->height; 1452 *dy = +map1->height;
1511 } 1453 }
1512 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) 1454 else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2)
1513 { /* down left */ 1455 { /* down left */
1514 *dx = -map2->width; 1456 *dx = -map2->width;
1515 *dy = map1->height; 1457 *dy = +map1->height;
1516 } 1458 }
1517 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) 1459 else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2)
1518 { /* left up */ 1460 { /* left up */
1519 *dx = -map1->tile_map[3]->width; 1461 *dx = -map1->tile_map[TILE_WEST]->width;
1520 *dy = -map2->height; 1462 *dy = -map2->height;
1521 } 1463 }
1522 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) 1464 else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2)
1523 { /* left down */ 1465 { /* left down */
1524 *dx = -map1->tile_map[3]->width; 1466 *dx = -map1->tile_map[TILE_WEST]->width;
1525 *dy = map1->tile_map[3]->height; 1467 *dy = +map1->tile_map[TILE_WEST]->height;
1526 } 1468 }
1527 else 1469 else
1528 return 0; 1470 return 0;
1529 1471
1530 return 1; 1472 return 1;
… …
1550/* From map.c 1492/* From map.c
1551 * This is used by get_player to determine where the other 1493 * This is used by get_player to determine where the other
1552 * creature is. get_rangevector takes into account map tiling, 1494 * creature is. get_rangevector takes into account map tiling,
1553 * so you just can not look the the map coordinates and get the 1495 * so you just can not look the the map coordinates and get the
1554 * righte value. distance_x/y are distance away, which 1496 * righte value. distance_x/y are distance away, which
1555 * can be negativbe. direction is the crossfire direction scheme 1497 * can be negative. direction is the crossfire direction scheme
1556 * that the creature should head. part is the part of the 1498 * that the creature should head. part is the part of the
1557 * monster that is closest. 1499 * monster that is closest.
1558 * 1500 *
1559 * get_rangevector looks at op1 and op2, and fills in the 1501 * get_rangevector looks at op1 and op2, and fills in the
1560 * structure for op1 to get to op2. 1502 * structure for op1 to get to op2.
… …
1566 * 1508 *
1567 * currently, the only flag supported (0x1) is don't translate for 1509 * currently, the only flag supported (0x1) is don't translate for
1568 * closest body part of 'op1' 1510 * closest body part of 'op1'
1569 */ 1511 */
1570void 1512void
1571get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1513get_rangevector (object *op1, object *op2, rv_vector *retval, int flags)
1572{ 1514{
1573 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1515 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1574 { 1516 {
1575 /* be conservative and fill in _some_ data */ 1517 /* be conservative and fill in _some_ data */
1576 retval->distance = 100000; 1518 retval->distance = 10000;
1577 retval->distance_x = 32767; 1519 retval->distance_x = 10000;
1578 retval->distance_y = 32767; 1520 retval->distance_y = 10000;
1579 retval->direction = 0; 1521 retval->direction = 0;
1580 retval->part = 0; 1522 retval->part = 0;
1581 } 1523 }
1582 else 1524 else
1583 { 1525 {
1584 object *best;
1585
1586 retval->distance_x += op2->x - op1->x; 1526 retval->distance_x += op2->x - op1->x;
1587 retval->distance_y += op2->y - op1->y; 1527 retval->distance_y += op2->y - op1->y;
1588 1528
1589 best = op1; 1529 object *best = op1;
1530
1590 /* If this is multipart, find the closest part now */ 1531 /* If this is multipart, find the closest part now */
1591 if (!(flags & 0x1) && op1->more) 1532 if (!(flags & 1) && op1->more)
1592 { 1533 {
1593 object *tmp; 1534 int best_distance = idistance (retval->distance_x, retval->distance_y);
1594 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1595 1535
1596 /* we just take the offset of the piece to head to figure 1536 /* we just take the offset of the piece to head to figure
1597 * distance instead of doing all that work above again 1537 * distance instead of doing all that work above again
1598 * since the distance fields we set above are positive in the 1538 * since the distance fields we set above are positive in the
1599 * same axis as is used for multipart objects, the simply arithmetic 1539 * same axis as is used for multipart objects, the simply arithmetic
1600 * below works. 1540 * below works.
1601 */ 1541 */
1602 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1542 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1603 { 1543 {
1604 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1544 int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
1605 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1545
1606 if (tmpi < best_distance) 1546 if (tmpi < best_distance)
1607 { 1547 {
1608 best_distance = tmpi; 1548 best_distance = tmpi;
1609 best = tmp; 1549 best = tmp;
1610 } 1550 }
1611 } 1551 }
1612 1552
1613 if (best != op1) 1553 if (best != op1)
1614 { 1554 {
1615 retval->distance_x += op1->x - best->x; 1555 retval->distance_x += op1->x - best->x;
1616 retval->distance_y += op1->y - best->y; 1556 retval->distance_y += op1->y - best->y;
1617 } 1557 }
1618 } 1558 }
1619 1559
1620 retval->part = best; 1560 retval->part = best;
1621 retval->distance = idistance (retval->distance_x, retval->distance_y); 1561 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1622 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1562 retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1623 } 1563 }
1624} 1564}
1625 1565
1626/* this is basically the same as get_rangevector above, but instead of 1566/* this is basically the same as get_rangevector above, but instead of
1627 * the first parameter being an object, it instead is the map 1567 * the first parameter being an object, it instead is the map
… …
1631 * flags has no meaning for this function at this time - I kept it in to 1571 * flags has no meaning for this function at this time - I kept it in to
1632 * be more consistant with the above function and also in case they are needed 1572 * be more consistant with the above function and also in case they are needed
1633 * for something in the future. Also, since no object is pasted, the best 1573 * for something in the future. Also, since no object is pasted, the best
1634 * field of the rv_vector is set to NULL. 1574 * field of the rv_vector is set to NULL.
1635 */ 1575 */
1636
1637void 1576void
1638get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1577get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1639{ 1578{
1640 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1579 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1641 { 1580 {
1642 /* be conservative and fill in _some_ data */ 1581 /* be conservative and fill in _some_ data */
1643 retval->distance = 100000; 1582 retval->distance = 100000;
1644 retval->distance_x = 32767; 1583 retval->distance_x = 32767;
1645 retval->distance_y = 32767; 1584 retval->distance_y = 32767;
1646 retval->direction = 0; 1585 retval->direction = 0;
1647 retval->part = 0; 1586 retval->part = 0;
1648 } 1587 }
1649 else 1588 else
1650 { 1589 {
1651 retval->distance_x += op2->x - x; 1590 retval->distance_x += op2->x - x;
1652 retval->distance_y += op2->y - y; 1591 retval->distance_y += op2->y - y;
1653 1592
1654 retval->part = NULL; 1593 retval->part = 0;
1655 retval->distance = idistance (retval->distance_x, retval->distance_y); 1594 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1656 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1595 retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1657 } 1596 }
1658} 1597}
1659 1598
1660/* Returns true of op1 and op2 are effectively on the same map 1599/* Returns true of op1 and op2 are effectively on the same map
1661 * (as related to map tiling). Note that this looks for a path from 1600 * (as related to map tiling). Note that this looks for a path from
… …
1671 int dx, dy; 1610 int dx, dy;
1672 1611
1673 return adjacent_map (op1->map, op2->map, &dx, &dy); 1612 return adjacent_map (op1->map, op2->map, &dx, &dy);
1674} 1613}
1675 1614
1615//-GPL
1616
1676object * 1617object *
1677maptile::insert (object *op, int x, int y, object *originator, int flags) 1618maptile::insert (object *op, int x, int y, object *originator, int flags)
1678{ 1619{
1679 if (!op->flag [FLAG_REMOVED])
1680 op->remove ();
1681
1682 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1620 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1683} 1621}
1684 1622
1623region *
1624maptile::region (int x, int y) const
1625{
1626 if (regions
1627 && regionmap
1628 && !OUT_OF_REAL_MAP (this, x, y))
1629 if (struct region *reg = regionmap [regions [y * width + x]])
1630 return reg;
1631
1632 if (default_region)
1633 return default_region;
1634
1635 return ::region::default_region ();
1636}
1637
1638//+GPL
1639
1640/* picks a random object from a style map.
1641 */
1642object *
1643maptile::pick_random_object (rand_gen &gen) const
1644{
1645 /* while returning a null object will result in a crash, that
1646 * is actually preferable to an infinite loop. That is because
1647 * most servers will automatically restart in case of crash.
1648 * Change the logic on getting the random space - shouldn't make
1649 * any difference, but this seems clearer to me.
1650 */
1651 for (int i = 1000; --i;)
1652 {
1653 object *pick = at (gen (width), gen (height)).bot;
1654
1655 // must be head: do not prefer big monsters just because they are big.
1656 if (pick && pick->is_head ())
1657 return pick;
1658 }
1659
1660 // instead of crashing in the unlikely(?) case, try to return *something*
1661 return archetype::find (shstr_bug);
1662}
1663
1664//-GPL
1665
1666void
1667maptile::play_sound (faceidx sound, int x, int y) const
1668{
1669 if (!sound)
1670 return;
1671
1672 for_all_players_on_map (pl, this)
1673 if (client *ns = pl->ns)
1674 {
1675 int dx = x - pl->ob->x;
1676 int dy = y - pl->ob->y;
1677
1678 int distance = idistance (dx, dy);
1679
1680 if (distance <= MAX_SOUND_DISTANCE)
1681 ns->play_sound (sound, dx, dy);
1682 }
1683}
1684
1685void
1686maptile::say_msg (const char *msg, int x, int y) const
1687{
1688 for_all_players (pl)
1689 if (client *ns = pl->ns)
1690 {
1691 int dx = x - pl->ob->x;
1692 int dy = y - pl->ob->y;
1693
1694 int distance = idistance (dx, dy);
1695
1696 if (distance <= MAX_SOUND_DISTANCE)
1697 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1698 }
1699}
1700
1701dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
1702
1703static void
1704split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1705{
1706 // clip to map to the left
1707 if (x0 < 0)
1708 {
1709 if (maptile *tile = m->tile_available (TILE_WEST, 1))
1710 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1711
1712 if (x1 < 0) // entirely to the left
1713 return;
1714
1715 x0 = 0;
1716 }
1717
1718 // clip to map to the right
1719 if (x1 > m->width)
1720 {
1721 if (maptile *tile = m->tile_available (TILE_EAST, 1))
1722 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1723
1724 if (x0 > m->width) // entirely to the right
1725 return;
1726
1727 x1 = m->width;
1728 }
1729
1730 // clip to map above
1731 if (y0 < 0)
1732 {
1733 if (maptile *tile = m->tile_available (TILE_NORTH, 1))
1734 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1735
1736 if (y1 < 0) // entirely above
1737 return;
1738
1739 y0 = 0;
1740 }
1741
1742 // clip to map below
1743 if (y1 > m->height)
1744 {
1745 if (maptile *tile = m->tile_available (TILE_SOUTH, 1))
1746 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1747
1748 if (y0 > m->height) // entirely below
1749 return;
1750
1751 y1 = m->height;
1752 }
1753
1754 // if we get here, the rect is within the current map
1755 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1756
1757 r->m = m;
1758 r->x0 = x0;
1759 r->y0 = y0;
1760 r->x1 = x1;
1761 r->y1 = y1;
1762 r->dx = dx;
1763 r->dy = dy;
1764}
1765
1766maprect *
1767maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
1768{
1769 buf.clear ();
1770
1771 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1772
1773 // add end marker
1774 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1775 r->m = 0;
1776
1777 return (maprect *)buf.linearise ();
1778}
1779

Diff Legend

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