1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | |
3 | * |
4 | Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | |
7 | * |
8 | This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | (at your option) any later version. |
11 | * (at your 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 GNU General Public License |
19 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
21 | |
|
|
22 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | #include <global.h> |
|
|
26 | #include <funcpoint.h> |
|
|
27 | |
|
|
28 | #include <loader.h> |
|
|
29 | #include <unistd.h> |
24 | #include <unistd.h> |
30 | |
25 | |
|
|
26 | #include "global.h" |
|
|
27 | #include "funcpoint.h" |
|
|
28 | |
|
|
29 | #include "loader.h" |
|
|
30 | |
31 | #include "path.h" |
31 | #include "path.h" |
32 | |
|
|
33 | /* |
|
|
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 | */ |
|
|
39 | const char * |
|
|
40 | create_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 | |
|
|
47 | /* |
|
|
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 | */ |
|
|
62 | int |
|
|
63 | check_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 | |
32 | |
99 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
33 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
100 | * one function that just returns a P_.. value (see map.h) |
34 | * one function that just returns a P_.. value (see map.h) |
101 | * it will also do map translation for tiled maps, returning |
35 | * it will also do map translation for tiled maps, returning |
102 | * 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 |
… | |
… | |
173 | * let the player through (inventory checkers for example) |
107 | * let the player through (inventory checkers for example) |
174 | */ |
108 | */ |
175 | if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) |
109 | if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) |
176 | return 0; |
110 | return 0; |
177 | |
111 | |
178 | if (ob->head != NULL) |
|
|
179 | ob = ob->head; |
112 | ob = ob->head_ (); |
180 | |
113 | |
181 | /* We basically go through the stack of objects, and if there is |
114 | /* 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 |
115 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
183 | * true. If we get through the entire stack, that must mean |
116 | * true. If we get through the entire stack, that must mean |
184 | * ob is blocking it, so return 0. |
117 | * ob is blocking it, so return 0. |
… | |
… | |
214 | else |
147 | else |
215 | { |
148 | { |
216 | /* Broke apart a big nasty if into several here to make |
149 | /* Broke apart a big nasty if into several here to make |
217 | * this more readable. first check - if the space blocks |
150 | * this more readable. first check - if the space blocks |
218 | * movement, can't move here. |
151 | * movement, can't move here. |
219 | * second - if a monster, can't move there, unles it is a |
152 | * second - if a monster, can't move there, unless it is a |
220 | * hidden dm |
153 | * hidden dm |
221 | */ |
154 | */ |
222 | if (OB_MOVE_BLOCK (ob, tmp)) |
155 | if (OB_MOVE_BLOCK (ob, tmp)) |
223 | return 1; |
156 | return 1; |
224 | if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && |
157 | |
225 | tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) |
158 | if (tmp->flag [FLAG_ALIVE] |
|
|
159 | && tmp->head_ () != ob |
|
|
160 | && tmp != ob |
|
|
161 | && tmp->type != DOOR |
|
|
162 | && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) |
226 | return 1; |
163 | return 1; |
227 | } |
164 | } |
228 | |
165 | |
229 | } |
166 | } |
230 | return 0; |
167 | return 0; |
231 | } |
168 | } |
232 | |
|
|
233 | |
169 | |
234 | /* |
170 | /* |
235 | * Returns true if the given object can't fit in the given spot. |
171 | * Returns true if the given object can't fit in the given spot. |
236 | * This is meant for multi space objects - for single space objecs, |
172 | * This is meant for multi space objects - for single space objecs, |
237 | * just calling get_map_blocked and checking that against movement type |
173 | * just calling get_map_blocked and checking that against movement type |
… | |
… | |
273 | |
209 | |
274 | /* don't have object, so don't know what types would block */ |
210 | /* don't have object, so don't know what types would block */ |
275 | return m1->at (sx, sy).move_block; |
211 | return m1->at (sx, sy).move_block; |
276 | } |
212 | } |
277 | |
213 | |
278 | for (tmp = ob->arch; tmp; tmp = tmp->more) |
214 | for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more) |
279 | { |
215 | { |
280 | flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); |
216 | flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy); |
281 | |
217 | |
282 | if (flag & P_OUT_OF_MAP) |
218 | if (flag & P_OUT_OF_MAP) |
283 | return P_OUT_OF_MAP; |
219 | return P_OUT_OF_MAP; |
284 | if (flag & P_IS_ALIVE) |
220 | if (flag & P_IS_ALIVE) |
285 | return P_IS_ALIVE; |
221 | return P_IS_ALIVE; |
… | |
… | |
344 | } |
280 | } |
345 | |
281 | |
346 | /* link_multipart_objects go through all the objects on the map looking |
282 | /* link_multipart_objects go through all the objects on the map looking |
347 | * for objects whose arch says they are multipart yet according to the |
283 | * for objects whose arch says they are multipart yet according to the |
348 | * info we have, they only have the head (as would be expected when |
284 | * info we have, they only have the head (as would be expected when |
349 | * they are saved). We do have to look for the old maps that did save |
285 | * they are saved). |
350 | * the more sections and not re-add sections for them. |
|
|
351 | */ |
286 | */ |
352 | void |
287 | void |
353 | maptile::link_multipart_objects () |
288 | maptile::link_multipart_objects () |
354 | { |
289 | { |
355 | if (!spaces) |
290 | if (!spaces) |
356 | return; |
291 | return; |
357 | |
292 | |
358 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
293 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
359 | for (object *tmp = ms->bot; tmp; ) |
294 | { |
|
|
295 | object *op = ms->bot; |
|
|
296 | while (op) |
360 | { |
297 | { |
361 | object *above = tmp->above; |
|
|
362 | |
|
|
363 | /* already multipart - don't do anything more */ |
298 | /* already multipart - don't do anything more */ |
364 | if (!tmp->head && !tmp->more) |
299 | if (op->head_ () == op && !op->more && op->arch->more) |
365 | { |
|
|
366 | /* If there is nothing more to this object, this for loop |
|
|
367 | * won't do anything. |
|
|
368 | */ |
|
|
369 | archetype *at; |
|
|
370 | object *last, *op; |
|
|
371 | for (at = tmp->arch->more, last = tmp; |
|
|
372 | at; |
|
|
373 | at = at->more, last = op) |
|
|
374 | { |
300 | { |
375 | op = arch_to_object (at); |
301 | op->remove (); |
|
|
302 | op->expand_tail (); |
376 | |
303 | |
377 | /* update x,y coordinates */ |
304 | // FIXME: INS_ON_TOP is just a workaround for the pentagram vs. |
378 | op->x += tmp->x; |
305 | // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters |
379 | op->y += tmp->y; |
306 | // below the pentagrams... hopefully INS_ON_TOP doesn't break anything |
380 | op->head = tmp; |
|
|
381 | op->map = this; |
|
|
382 | last->more = op; |
|
|
383 | op->name = tmp->name; |
|
|
384 | op->title = tmp->title; |
|
|
385 | |
|
|
386 | /* we could link all the parts onto tmp, and then just |
|
|
387 | * call insert_ob_in_map once, but the effect is the same, |
|
|
388 | * as insert_ob_in_map will call itself with each part, and |
|
|
389 | * the coding is simpler to just to it here with each part. |
|
|
390 | */ |
|
|
391 | insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); |
307 | insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON); |
|
|
308 | |
|
|
309 | op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP |
|
|
310 | // so we have to reset the iteration through the mapspace |
392 | } |
311 | } |
|
|
312 | else |
|
|
313 | op = op->above; |
393 | } |
314 | } |
394 | |
|
|
395 | tmp = above; |
|
|
396 | } |
315 | } |
397 | } |
316 | } |
398 | |
317 | |
399 | /* |
318 | /* |
400 | * Loads (ands parses) the objects into a given map from the specified |
319 | * Loads (ands parses) the objects into a given map from the specified |
401 | * file pointer. |
320 | * file pointer. |
402 | * mapflags is the same as we get with load_original_map |
|
|
403 | */ |
321 | */ |
404 | bool |
322 | bool |
405 | maptile::_load_objects (object_thawer &thawer) |
323 | maptile::_load_objects (object_thawer &f) |
406 | { |
324 | { |
407 | int unique; |
325 | for (;;) |
408 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
|
|
409 | |
|
|
410 | op = object::create (); |
|
|
411 | op->map = this; /* To handle buttons correctly */ |
|
|
412 | |
|
|
413 | while (int i = load_object (thawer, op, 0)) |
|
|
414 | { |
326 | { |
415 | /* if the archetype for the object is null, means that we |
327 | coroapi::cede_to_tick_every (100); // cede once in a while |
416 | * got an invalid object. Don't do anything with it - the game |
328 | |
417 | * or editor will not be able to do anything with it either. |
329 | switch (f.kw) |
418 | */ |
|
|
419 | if (op->arch == NULL) |
|
|
420 | { |
330 | { |
421 | LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); |
331 | case KW_arch: |
422 | continue; |
332 | if (object *op = object::read (f, this)) |
423 | } |
|
|
424 | |
|
|
425 | switch (i) |
|
|
426 | { |
333 | { |
427 | case LL_NORMAL: |
334 | if (op->inv) |
|
|
335 | sum_weight (op); |
|
|
336 | |
428 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
337 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
|
|
338 | } |
429 | |
339 | |
430 | if (op->inv) |
340 | continue; |
431 | sum_weight (op); |
|
|
432 | |
341 | |
433 | prev = op, last_more = op; |
|
|
434 | break; |
|
|
435 | |
|
|
436 | case LL_MORE: |
342 | case KW_EOF: |
437 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); |
343 | return true; |
438 | op->head = prev, last_more->more = op, last_more = op; |
344 | |
|
|
345 | default: |
|
|
346 | if (!f.parse_error ("map file")) |
|
|
347 | return false; |
439 | break; |
348 | break; |
440 | } |
349 | } |
441 | |
350 | |
442 | op = object::create (); |
351 | f.next (); |
443 | op->map = this; |
|
|
444 | } |
|
|
445 | |
|
|
446 | op->destroy (); |
|
|
447 | |
|
|
448 | #if 0 |
|
|
449 | for (i = 0; i < width; i++) |
|
|
450 | for (j = 0; j < height; j++) |
|
|
451 | { |
|
|
452 | unique = 0; |
|
|
453 | /* check for unique items, or unique squares */ |
|
|
454 | for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above) |
|
|
455 | { |
|
|
456 | if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) |
|
|
457 | unique = 1; |
|
|
458 | |
|
|
459 | if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) |
|
|
460 | SET_FLAG (otmp, FLAG_OBJ_ORIGINAL); |
|
|
461 | } |
|
|
462 | } |
352 | } |
463 | #endif |
|
|
464 | |
353 | |
465 | return true; |
354 | return true; |
466 | } |
355 | } |
467 | |
356 | |
468 | void |
357 | void |
469 | maptile::activate () |
358 | maptile::activate () |
470 | { |
359 | { |
471 | if (!spaces) |
360 | if (spaces) |
472 | return; |
|
|
473 | |
|
|
474 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
361 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
475 | for (object *op = ms->bot; op; op = op->above) |
362 | for (object *op = ms->bot; op; op = op->above) |
476 | op->activate_recursive (); |
363 | op->activate_recursive (); |
477 | } |
364 | } |
478 | |
365 | |
479 | void |
366 | void |
480 | maptile::deactivate () |
367 | maptile::deactivate () |
481 | { |
368 | { |
482 | if (!spaces) |
369 | if (spaces) |
483 | return; |
|
|
484 | |
|
|
485 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
370 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
486 | for (object *op = ms->bot; op; op = op->above) |
371 | for (object *op = ms->bot; op; op = op->above) |
487 | op->deactivate_recursive (); |
372 | op->deactivate_recursive (); |
488 | } |
373 | } |
489 | |
374 | |
490 | bool |
375 | bool |
491 | maptile::_save_objects (object_freezer &freezer, int flags) |
376 | maptile::_save_objects (object_freezer &f, int flags) |
492 | { |
377 | { |
493 | static int cede_count = 0; |
378 | coroapi::cede_to_tick (); |
494 | |
379 | |
495 | if (flags & IO_HEADER) |
380 | if (flags & IO_HEADER) |
496 | _save_header (freezer); |
381 | _save_header (f); |
497 | |
382 | |
498 | if (!spaces) |
383 | if (!spaces) |
499 | return false; |
384 | return false; |
500 | |
385 | |
501 | for (int i = 0; i < size (); ++i) |
386 | for (int i = 0; i < size (); ++i) |
502 | { |
387 | { |
503 | #if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D |
|
|
504 | if (cede_count >= 500) |
|
|
505 | { |
|
|
506 | cede_count = 0; |
|
|
507 | coroapi::cede (); |
|
|
508 | } |
|
|
509 | #endif |
|
|
510 | |
|
|
511 | int unique = 0; |
388 | bool unique = 0; |
|
|
389 | |
512 | for (object *op = spaces [i].bot; op; op = op->above) |
390 | for (object *op = spaces [i].bot; op; op = op->above) |
513 | { |
391 | { |
514 | // count per-object, but cede only when modification-safe |
|
|
515 | cede_count++; |
|
|
516 | |
|
|
517 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
392 | unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]; |
518 | unique = 1; |
|
|
519 | |
393 | |
520 | if (!op->can_map_save ()) |
394 | if (expect_false (!op->can_map_save ())) |
521 | continue; |
395 | continue; |
522 | |
396 | |
523 | if (unique || op->flag [FLAG_UNIQUE]) |
397 | if (expect_false (unique || op->flag [FLAG_UNIQUE])) |
524 | { |
398 | { |
525 | if (flags & IO_UNIQUES) |
399 | if (flags & IO_UNIQUES) |
526 | save_object (freezer, op, 1); |
400 | op->write (f); |
527 | } |
401 | } |
528 | else if (flags & IO_OBJECTS) |
402 | else if (expect_true (flags & IO_OBJECTS)) |
529 | save_object (freezer, op, 1); |
403 | op->write (f); |
530 | } |
404 | } |
531 | } |
405 | } |
532 | |
406 | |
|
|
407 | coroapi::cede_to_tick (); |
|
|
408 | |
533 | return true; |
409 | return true; |
534 | } |
|
|
535 | |
|
|
536 | bool |
|
|
537 | maptile::_load_objects (const char *path, bool skip_header) |
|
|
538 | { |
|
|
539 | object_thawer thawer (path); |
|
|
540 | |
|
|
541 | if (!thawer) |
|
|
542 | return false; |
|
|
543 | |
|
|
544 | if (skip_header) |
|
|
545 | for (;;) |
|
|
546 | { |
|
|
547 | keyword kw = thawer.get_kv (); |
|
|
548 | |
|
|
549 | if (kw == KW_end) |
|
|
550 | break; |
|
|
551 | |
|
|
552 | thawer.skip_kv (kw); |
|
|
553 | } |
|
|
554 | |
|
|
555 | return _load_objects (thawer); |
|
|
556 | } |
410 | } |
557 | |
411 | |
558 | bool |
412 | bool |
559 | maptile::_save_objects (const char *path, int flags) |
413 | maptile::_save_objects (const char *path, int flags) |
560 | { |
414 | { |
… | |
… | |
569 | maptile::maptile () |
423 | maptile::maptile () |
570 | { |
424 | { |
571 | in_memory = MAP_SWAPPED; |
425 | in_memory = MAP_SWAPPED; |
572 | |
426 | |
573 | /* The maps used to pick up default x and y values from the |
427 | /* The maps used to pick up default x and y values from the |
574 | * map archetype. Mimic that behaviour. |
428 | * map archetype. Mimic that behaviour. |
575 | */ |
429 | */ |
576 | width = 16; |
430 | width = 16; |
577 | height = 16; |
431 | height = 16; |
578 | reset_timeout = 0; |
|
|
579 | timeout = 300; |
432 | timeout = 300; |
580 | enter_x = 0; |
433 | max_nrof = 1000; // 1000 items of anything |
581 | enter_y = 0; |
434 | max_volume = 2000000; // 2m³ |
582 | } |
435 | } |
583 | |
436 | |
584 | maptile::maptile (int w, int h) |
437 | maptile::maptile (int w, int h) |
585 | { |
438 | { |
586 | in_memory = MAP_SWAPPED; |
439 | in_memory = MAP_SWAPPED; |
… | |
… | |
736 | bool |
589 | bool |
737 | maptile::_load_header (object_thawer &thawer) |
590 | maptile::_load_header (object_thawer &thawer) |
738 | { |
591 | { |
739 | for (;;) |
592 | for (;;) |
740 | { |
593 | { |
741 | keyword kw = thawer.get_kv (); |
|
|
742 | |
|
|
743 | switch (kw) |
594 | switch (thawer.kw) |
744 | { |
595 | { |
745 | case KW_EOF: |
|
|
746 | LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); |
|
|
747 | return false; |
|
|
748 | |
|
|
749 | case KW_end: |
|
|
750 | return true; |
|
|
751 | |
|
|
752 | default: |
|
|
753 | case KW_ERROR: |
|
|
754 | LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword); |
|
|
755 | break; |
|
|
756 | |
|
|
757 | case KW_msg: |
596 | case KW_msg: |
758 | thawer.get_ml (KW_endmsg, msg); |
597 | thawer.get_ml (KW_endmsg, msg); |
759 | break; |
598 | break; |
760 | |
599 | |
761 | case KW_lore: // CF+ extension |
600 | case KW_lore: // CF+ extension |
… | |
… | |
792 | case KW_winddir: thawer.get (winddir); break; |
631 | case KW_winddir: thawer.get (winddir); break; |
793 | case KW_sky: thawer.get (sky); break; |
632 | case KW_sky: thawer.get (sky); break; |
794 | |
633 | |
795 | case KW_per_player: thawer.get (per_player); break; |
634 | case KW_per_player: thawer.get (per_player); break; |
796 | case KW_per_party: thawer.get (per_party); break; |
635 | case KW_per_party: thawer.get (per_party); break; |
|
|
636 | case KW_no_reset: thawer.get (no_reset); break; |
797 | |
637 | |
798 | case KW_region: get_region_by_name (thawer.get_str ()); break; |
638 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
799 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
639 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
800 | |
640 | |
801 | // old names new names |
641 | // old names new names |
802 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
642 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
803 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
643 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
… | |
… | |
811 | |
651 | |
812 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
652 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
813 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
653 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
814 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
654 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
815 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
655 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
|
|
656 | |
|
|
657 | case KW_ERROR: |
|
|
658 | set_key_text (thawer.kw_str, thawer.value); |
|
|
659 | break; |
|
|
660 | |
|
|
661 | case KW_end: |
|
|
662 | thawer.next (); |
|
|
663 | return true; |
|
|
664 | |
|
|
665 | default: |
|
|
666 | if (!thawer.parse_error ("map", 0)) |
|
|
667 | return false; |
|
|
668 | break; |
816 | } |
669 | } |
|
|
670 | |
|
|
671 | thawer.next (); |
817 | } |
672 | } |
818 | |
673 | |
819 | abort (); |
674 | abort (); |
820 | } |
|
|
821 | |
|
|
822 | bool |
|
|
823 | maptile::_load_header (const char *path) |
|
|
824 | { |
|
|
825 | object_thawer thawer (path); |
|
|
826 | |
|
|
827 | if (!thawer) |
|
|
828 | return false; |
|
|
829 | |
|
|
830 | return _load_header (thawer); |
|
|
831 | } |
675 | } |
832 | |
676 | |
833 | /****************************************************************************** |
677 | /****************************************************************************** |
834 | * This is the start of unique map handling code |
678 | * This is the start of unique map handling code |
835 | *****************************************************************************/ |
679 | *****************************************************************************/ |
… | |
… | |
846 | object *above = op->above; |
690 | object *above = op->above; |
847 | |
691 | |
848 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
692 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
849 | unique = 1; |
693 | unique = 1; |
850 | |
694 | |
851 | if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
695 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
852 | { |
696 | { |
853 | op->destroy_inv (false); |
697 | op->destroy_inv (false); |
854 | op->destroy (); |
698 | op->destroy (); |
855 | } |
699 | } |
856 | |
700 | |
… | |
… | |
870 | if (name) MAP_OUT (name); |
714 | if (name) MAP_OUT (name); |
871 | MAP_OUT (swap_time); |
715 | MAP_OUT (swap_time); |
872 | MAP_OUT (reset_time); |
716 | MAP_OUT (reset_time); |
873 | MAP_OUT (reset_timeout); |
717 | MAP_OUT (reset_timeout); |
874 | MAP_OUT (fixed_resettime); |
718 | MAP_OUT (fixed_resettime); |
|
|
719 | MAP_OUT (no_reset); |
875 | MAP_OUT (difficulty); |
720 | MAP_OUT (difficulty); |
876 | |
721 | |
877 | if (region) MAP_OUT2 (region, region->name); |
722 | if (default_region) MAP_OUT2 (region, default_region->name); |
878 | |
723 | |
879 | if (shopitems) |
724 | if (shopitems) |
880 | { |
725 | { |
881 | char shop[MAX_BUF]; |
726 | char shop[MAX_BUF]; |
882 | print_shop_string (this, shop); |
727 | print_shop_string (this, shop); |
… | |
… | |
933 | * Remove and free all objects in the given map. |
778 | * Remove and free all objects in the given map. |
934 | */ |
779 | */ |
935 | void |
780 | void |
936 | maptile::clear () |
781 | maptile::clear () |
937 | { |
782 | { |
|
|
783 | sfree (regions, size ()); regions = 0; |
|
|
784 | delete [] regionmap; regionmap = 0; |
|
|
785 | |
938 | if (!spaces) |
786 | if (spaces) |
939 | return; |
787 | { |
940 | |
|
|
941 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
788 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
942 | while (object *op = ms->bot) |
789 | while (object *op = ms->bot) |
943 | { |
790 | { |
944 | if (op->head) |
|
|
945 | op = op->head; |
791 | op = op->head_ (); |
946 | |
|
|
947 | op->destroy_inv (false); |
792 | op->destroy_inv (false); |
948 | op->destroy (); |
793 | op->destroy (); |
949 | } |
794 | } |
950 | |
795 | |
951 | sfree (spaces, size ()), spaces = 0; |
796 | sfree (spaces, size ()), spaces = 0; |
|
|
797 | } |
952 | |
798 | |
953 | if (buttons) |
799 | if (buttons) |
954 | free_objectlinkpt (buttons), buttons = 0; |
800 | free_objectlinkpt (buttons), buttons = 0; |
955 | } |
801 | } |
956 | |
802 | |
… | |
… | |
989 | maptile::do_destroy () |
835 | maptile::do_destroy () |
990 | { |
836 | { |
991 | attachable::do_destroy (); |
837 | attachable::do_destroy (); |
992 | |
838 | |
993 | clear (); |
839 | clear (); |
|
|
840 | } |
|
|
841 | |
|
|
842 | /* decay and destroy perishable items in a map */ |
|
|
843 | void |
|
|
844 | maptile::do_decay_objects () |
|
|
845 | { |
|
|
846 | if (!spaces) |
|
|
847 | return; |
|
|
848 | |
|
|
849 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
850 | for (object *above, *op = ms->bot; op; op = above) |
|
|
851 | { |
|
|
852 | above = op->above; |
|
|
853 | |
|
|
854 | bool destroy = 0; |
|
|
855 | |
|
|
856 | // do not decay anything above unique floor tiles (yet :) |
|
|
857 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
|
|
858 | break; |
|
|
859 | |
|
|
860 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
|
|
861 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
|
|
862 | || QUERY_FLAG (op, FLAG_UNIQUE) |
|
|
863 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
|
|
864 | || QUERY_FLAG (op, FLAG_UNPAID) |
|
|
865 | || op->is_alive ()) |
|
|
866 | ; // do not decay |
|
|
867 | else if (op->is_weapon ()) |
|
|
868 | { |
|
|
869 | op->stats.dam--; |
|
|
870 | if (op->stats.dam < 0) |
|
|
871 | destroy = 1; |
|
|
872 | } |
|
|
873 | else if (op->is_armor ()) |
|
|
874 | { |
|
|
875 | op->stats.ac--; |
|
|
876 | if (op->stats.ac < 0) |
|
|
877 | destroy = 1; |
|
|
878 | } |
|
|
879 | else if (op->type == FOOD) |
|
|
880 | { |
|
|
881 | op->stats.food -= rndm (5, 20); |
|
|
882 | if (op->stats.food < 0) |
|
|
883 | destroy = 1; |
|
|
884 | } |
|
|
885 | else |
|
|
886 | { |
|
|
887 | int mat = op->materials; |
|
|
888 | |
|
|
889 | if (mat & M_PAPER |
|
|
890 | || mat & M_LEATHER |
|
|
891 | || mat & M_WOOD |
|
|
892 | || mat & M_ORGANIC |
|
|
893 | || mat & M_CLOTH |
|
|
894 | || mat & M_LIQUID |
|
|
895 | || (mat & M_IRON && rndm (1, 5) == 1) |
|
|
896 | || (mat & M_GLASS && rndm (1, 2) == 1) |
|
|
897 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
898 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
|
|
899 | || (mat & M_ICE && temp > 32)) |
|
|
900 | destroy = 1; |
|
|
901 | } |
|
|
902 | |
|
|
903 | /* adjust overall chance below */ |
|
|
904 | if (destroy && rndm (0, 1)) |
|
|
905 | op->destroy (); |
|
|
906 | } |
994 | } |
907 | } |
995 | |
908 | |
996 | /* |
909 | /* |
997 | * Updates every button on the map (by calling update_button() for them). |
910 | * Updates every button on the map (by calling update_button() for them). |
998 | */ |
911 | */ |
… | |
… | |
1046 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
959 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
1047 | { |
960 | { |
1048 | total_exp += op->stats.exp; |
961 | total_exp += op->stats.exp; |
1049 | |
962 | |
1050 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
963 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
1051 | total_exp += at->clone.stats.exp * 8; |
964 | total_exp += at->stats.exp * 8; |
1052 | |
965 | |
1053 | monster_cnt++; |
966 | monster_cnt++; |
1054 | } |
967 | } |
1055 | } |
968 | } |
1056 | |
969 | |
… | |
… | |
1110 | */ |
1023 | */ |
1111 | void |
1024 | void |
1112 | mapspace::update_ () |
1025 | mapspace::update_ () |
1113 | { |
1026 | { |
1114 | object *tmp, *last = 0; |
1027 | object *tmp, *last = 0; |
1115 | uint8 flags = 0, light = 0, anywhere = 0; |
1028 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1116 | New_Face *top, *floor, *middle; |
|
|
1117 | object *top_obj, *floor_obj, *middle_obj; |
|
|
1118 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1029 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1119 | |
1030 | |
1120 | middle = blank_face; |
1031 | //object *middle = 0; |
1121 | top = blank_face; |
1032 | //object *top = 0; |
1122 | floor = blank_face; |
1033 | //object *floor = 0; |
1123 | |
1034 | // this seems to generate better code than using locals, above |
1124 | middle_obj = 0; |
1035 | object *&top = faces_obj[0] = 0; |
1125 | top_obj = 0; |
1036 | object *&middle = faces_obj[1] = 0; |
1126 | floor_obj = 0; |
1037 | object *&floor = faces_obj[2] = 0; |
1127 | |
1038 | |
1128 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1039 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1129 | { |
1040 | { |
1130 | /* This could be made additive I guess (two lights better than |
1041 | /* This could be made additive I guess (two lights better than |
1131 | * one). But if so, it shouldn't be a simple additive - 2 |
1042 | * one). But if so, it shouldn't be a simple additive - 2 |
… | |
… | |
1144 | * Always put the player down for drawing. |
1055 | * Always put the player down for drawing. |
1145 | */ |
1056 | */ |
1146 | if (!tmp->invisible) |
1057 | if (!tmp->invisible) |
1147 | { |
1058 | { |
1148 | if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) |
1059 | if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) |
1149 | { |
|
|
1150 | top = tmp->face; |
|
|
1151 | top_obj = tmp; |
1060 | top = tmp; |
1152 | } |
|
|
1153 | else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1061 | else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1154 | { |
1062 | { |
1155 | /* If we got a floor, that means middle and top were below it, |
1063 | /* If we got a floor, that means middle and top were below it, |
1156 | * so should not be visible, so we clear them. |
1064 | * so should not be visible, so we clear them. |
1157 | */ |
1065 | */ |
1158 | middle = blank_face; |
1066 | middle = 0; |
1159 | top = blank_face; |
1067 | top = 0; |
1160 | floor = tmp->face; |
|
|
1161 | floor_obj = tmp; |
1068 | floor = tmp; |
1162 | } |
1069 | } |
1163 | /* Flag anywhere have high priority */ |
1070 | /* Flag anywhere have high priority */ |
1164 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
1071 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
1165 | { |
1072 | { |
1166 | middle = tmp->face; |
|
|
1167 | |
|
|
1168 | middle_obj = tmp; |
1073 | middle = tmp; |
1169 | anywhere = 1; |
1074 | anywhere = 1; |
1170 | } |
1075 | } |
1171 | /* Find the highest visible face around. If equal |
1076 | /* Find the highest visible face around. If equal |
1172 | * visibilities, we still want the one nearer to the |
1077 | * visibilities, we still want the one nearer to the |
1173 | * top |
1078 | * top |
1174 | */ |
1079 | */ |
1175 | else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) |
1080 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) |
1176 | { |
|
|
1177 | middle = tmp->face; |
|
|
1178 | middle_obj = tmp; |
1081 | middle = tmp; |
1179 | } |
|
|
1180 | } |
1082 | } |
1181 | |
1083 | |
1182 | if (tmp == tmp->above) |
1084 | if (tmp == tmp->above) |
1183 | { |
1085 | { |
1184 | LOG (llevError, "Error in structure of map\n"); |
1086 | LOG (llevError, "Error in structure of map\n"); |
… | |
… | |
1219 | * middle face. This should not happen, as we already have the |
1121 | * middle face. This should not happen, as we already have the |
1220 | * else statement above so middle should not get set. OTOH, it |
1122 | * else statement above so middle should not get set. OTOH, it |
1221 | * may be possible for the faces to match but be different objects. |
1123 | * may be possible for the faces to match but be different objects. |
1222 | */ |
1124 | */ |
1223 | if (top == middle) |
1125 | if (top == middle) |
1224 | middle = blank_face; |
1126 | middle = 0; |
1225 | |
1127 | |
1226 | /* There are three posibilities at this point: |
1128 | /* There are three posibilities at this point: |
1227 | * 1) top face is set, need middle to be set. |
1129 | * 1) top face is set, need middle to be set. |
1228 | * 2) middle is set, need to set top. |
1130 | * 2) middle is set, need to set top. |
1229 | * 3) neither middle or top is set - need to set both. |
1131 | * 3) neither middle or top is set - need to set both. |
… | |
… | |
1234 | /* Once we get to a floor, stop, since we already have a floor object */ |
1136 | /* Once we get to a floor, stop, since we already have a floor object */ |
1235 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1137 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1236 | break; |
1138 | break; |
1237 | |
1139 | |
1238 | /* If two top faces are already set, quit processing */ |
1140 | /* If two top faces are already set, quit processing */ |
1239 | if ((top != blank_face) && (middle != blank_face)) |
1141 | if (top && middle) |
1240 | break; |
1142 | break; |
1241 | |
1143 | |
1242 | /* Only show visible faces */ |
1144 | /* Only show visible faces */ |
1243 | if (!tmp->invisible) |
1145 | if (!tmp->invisible) |
1244 | { |
1146 | { |
1245 | /* Fill in top if needed */ |
1147 | /* Fill in top if needed */ |
1246 | if (top == blank_face) |
1148 | if (!top) |
1247 | { |
1149 | { |
1248 | top = tmp->face; |
|
|
1249 | top_obj = tmp; |
1150 | top = tmp; |
1250 | if (top == middle) |
1151 | if (top == middle) |
1251 | middle = blank_face; |
1152 | middle = 0; |
1252 | } |
1153 | } |
1253 | else |
1154 | else |
1254 | { |
1155 | { |
1255 | /* top is already set - we should only get here if |
1156 | /* top is already set - we should only get here if |
1256 | * middle is not set |
1157 | * middle is not set |
1257 | * |
1158 | * |
1258 | * Set the middle face and break out, since there is nothing |
1159 | * Set the middle face and break out, since there is nothing |
1259 | * more to fill in. We don't check visiblity here, since |
1160 | * more to fill in. We don't check visiblity here, since |
1260 | * |
1161 | * |
1261 | */ |
1162 | */ |
1262 | if (tmp->face != top) |
1163 | if (tmp != top) |
1263 | { |
1164 | { |
1264 | middle = tmp->face; |
|
|
1265 | middle_obj = tmp; |
1165 | middle = tmp; |
1266 | break; |
1166 | break; |
1267 | } |
1167 | } |
1268 | } |
1168 | } |
1269 | } |
1169 | } |
1270 | } |
1170 | } |
1271 | |
1171 | |
1272 | if (middle == floor) |
1172 | if (middle == floor) |
1273 | middle = blank_face; |
1173 | middle = 0; |
1274 | |
1174 | |
1275 | if (top == middle) |
1175 | if (top == middle) |
1276 | middle = blank_face; |
1176 | middle = 0; |
1277 | |
1177 | |
1278 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1178 | #if 0 |
1279 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1179 | faces_obj [0] = top; |
1280 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1180 | faces_obj [1] = middle; |
|
|
1181 | faces_obj [2] = floor; |
|
|
1182 | #endif |
1281 | } |
1183 | } |
1282 | |
1184 | |
1283 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1185 | uint64 |
1284 | * the map. It also takes care of linking back the freshly found |
1186 | mapspace::volume () const |
1285 | * maps tile_map values if it tiles back to this one. It returns |
|
|
1286 | * the value of orig_map->tile_map[tile_num]. |
|
|
1287 | */ |
|
|
1288 | static inline maptile * |
|
|
1289 | find_and_link (maptile *orig_map, int tile_num) |
|
|
1290 | { |
1187 | { |
1291 | maptile *mp = orig_map->tile_map [tile_num]; |
1188 | uint64 vol = 0; |
1292 | |
1189 | |
1293 | if (!mp) |
1190 | for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below) |
1294 | { |
1191 | vol += op->volume (); |
1295 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
|
|
1296 | |
1192 | |
1297 | if (!mp) |
1193 | return vol; |
1298 | { |
1194 | } |
1299 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
|
|
1300 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
|
|
1301 | &orig_map->tile_path[tile_num], &orig_map->path); |
|
|
1302 | mp = new maptile (1, 1); |
|
|
1303 | mp->alloc (); |
|
|
1304 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1305 | } |
|
|
1306 | } |
|
|
1307 | |
1195 | |
1308 | int dest_tile = (tile_num + 2) % 4; |
1196 | bool |
|
|
1197 | maptile::tile_available (int dir, bool load) |
|
|
1198 | { |
|
|
1199 | if (!tile_path[dir]) |
|
|
1200 | return 0; |
1309 | |
1201 | |
1310 | orig_map->tile_map [tile_num] = mp; |
1202 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) |
|
|
1203 | return 1; |
1311 | |
1204 | |
1312 | // optimisation: back-link map to origin map if euclidean |
1205 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1313 | //TODO: non-euclidean maps MUST GO |
1206 | return 1; |
1314 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
|
|
1315 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
|
|
1316 | |
1207 | |
1317 | return mp; |
1208 | return 0; |
1318 | } |
|
|
1319 | |
|
|
1320 | static inline void |
|
|
1321 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1322 | { |
|
|
1323 | find_and_link (orig_map, tile_num)->load_sync (); |
|
|
1324 | } |
1209 | } |
1325 | |
1210 | |
1326 | /* this returns TRUE if the coordinates (x,y) are out of |
1211 | /* this returns TRUE if the coordinates (x,y) are out of |
1327 | * map m. This function also takes into account any |
1212 | * map m. This function also takes into account any |
1328 | * tiling considerations, loading adjacant maps as needed. |
1213 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1341 | if (!m) |
1226 | if (!m) |
1342 | return 0; |
1227 | return 0; |
1343 | |
1228 | |
1344 | if (x < 0) |
1229 | if (x < 0) |
1345 | { |
1230 | { |
1346 | if (!m->tile_path[3]) |
1231 | if (!m->tile_available (3)) |
1347 | return 1; |
1232 | return 1; |
1348 | |
1233 | |
1349 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
|
|
1350 | find_and_link (m, 3); |
|
|
1351 | |
|
|
1352 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1234 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1353 | } |
1235 | } |
1354 | |
1236 | |
1355 | if (x >= m->width) |
1237 | if (x >= m->width) |
1356 | { |
1238 | { |
1357 | if (!m->tile_path[1]) |
1239 | if (!m->tile_available (1)) |
1358 | return 1; |
1240 | return 1; |
1359 | |
1241 | |
1360 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
|
|
1361 | find_and_link (m, 1); |
|
|
1362 | |
|
|
1363 | return out_of_map (m->tile_map[1], x - m->width, y); |
1242 | return out_of_map (m->tile_map[1], x - m->width, y); |
1364 | } |
1243 | } |
1365 | |
1244 | |
1366 | if (y < 0) |
1245 | if (y < 0) |
1367 | { |
1246 | { |
1368 | if (!m->tile_path[0]) |
1247 | if (!m->tile_available (0)) |
1369 | return 1; |
1248 | return 1; |
1370 | |
1249 | |
1371 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
|
|
1372 | find_and_link (m, 0); |
|
|
1373 | |
|
|
1374 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1250 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1375 | } |
1251 | } |
1376 | |
1252 | |
1377 | if (y >= m->height) |
1253 | if (y >= m->height) |
1378 | { |
1254 | { |
1379 | if (!m->tile_path[2]) |
1255 | if (!m->tile_available (2)) |
1380 | return 1; |
1256 | return 1; |
1381 | |
|
|
1382 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
|
|
1383 | find_and_link (m, 2); |
|
|
1384 | |
1257 | |
1385 | return out_of_map (m->tile_map[2], x, y - m->height); |
1258 | return out_of_map (m->tile_map[2], x, y - m->height); |
1386 | } |
1259 | } |
1387 | |
1260 | |
1388 | /* Simple case - coordinates are within this local |
1261 | /* Simple case - coordinates are within this local |
… | |
… | |
1402 | maptile * |
1275 | maptile * |
1403 | maptile::xy_find (sint16 &x, sint16 &y) |
1276 | maptile::xy_find (sint16 &x, sint16 &y) |
1404 | { |
1277 | { |
1405 | if (x < 0) |
1278 | if (x < 0) |
1406 | { |
1279 | { |
1407 | if (!tile_path[3]) |
1280 | if (!tile_available (3)) |
1408 | return 0; |
1281 | return 0; |
1409 | |
1282 | |
1410 | find_and_link (this, 3); |
|
|
1411 | x += tile_map[3]->width; |
1283 | x += tile_map[3]->width; |
1412 | return tile_map[3]->xy_find (x, y); |
1284 | return tile_map[3]->xy_find (x, y); |
1413 | } |
1285 | } |
1414 | |
1286 | |
1415 | if (x >= width) |
1287 | if (x >= width) |
1416 | { |
1288 | { |
1417 | if (!tile_path[1]) |
1289 | if (!tile_available (1)) |
1418 | return 0; |
1290 | return 0; |
1419 | |
1291 | |
1420 | find_and_link (this, 1); |
|
|
1421 | x -= width; |
1292 | x -= width; |
1422 | return tile_map[1]->xy_find (x, y); |
1293 | return tile_map[1]->xy_find (x, y); |
1423 | } |
1294 | } |
1424 | |
1295 | |
1425 | if (y < 0) |
1296 | if (y < 0) |
1426 | { |
1297 | { |
1427 | if (!tile_path[0]) |
1298 | if (!tile_available (0)) |
1428 | return 0; |
1299 | return 0; |
1429 | |
1300 | |
1430 | find_and_link (this, 0); |
|
|
1431 | y += tile_map[0]->height; |
1301 | y += tile_map[0]->height; |
1432 | return tile_map[0]->xy_find (x, y); |
1302 | return tile_map[0]->xy_find (x, y); |
1433 | } |
1303 | } |
1434 | |
1304 | |
1435 | if (y >= height) |
1305 | if (y >= height) |
1436 | { |
1306 | { |
1437 | if (!tile_path[2]) |
1307 | if (!tile_available (2)) |
1438 | return 0; |
1308 | return 0; |
1439 | |
1309 | |
1440 | find_and_link (this, 2); |
|
|
1441 | y -= height; |
1310 | y -= height; |
1442 | return tile_map[2]->xy_find (x, y); |
1311 | return tile_map[2]->xy_find (x, y); |
1443 | } |
1312 | } |
1444 | |
1313 | |
1445 | /* Simple case - coordinates are within this local |
1314 | /* Simple case - coordinates are within this local |
… | |
… | |
1450 | |
1319 | |
1451 | /** |
1320 | /** |
1452 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1321 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1453 | * map1 to map2 in dx/dy. |
1322 | * map1 to map2 in dx/dy. |
1454 | */ |
1323 | */ |
1455 | static int |
1324 | int |
1456 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1325 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1457 | { |
1326 | { |
1458 | if (!map1 || !map2) |
1327 | if (!map1 || !map2) |
1459 | return 0; |
1328 | return 0; |
1460 | |
1329 | |
1461 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
1330 | //TODO: this doesn't actually check correctly when intermediate maps are not loaded |
1462 | //fix: compare paths instead (this is likely faster, too!) |
1331 | //fix: compare paths instead (this is likely faster, too!) |
1463 | if (map1 == map2) |
1332 | if (map1 == map2) |
1464 | { |
1333 | { |
1465 | *dx = 0; |
1334 | *dx = 0; |
1466 | *dy = 0; |
1335 | *dy = 0; |
… | |
… | |
1551 | /* From map.c |
1420 | /* From map.c |
1552 | * This is used by get_player to determine where the other |
1421 | * This is used by get_player to determine where the other |
1553 | * creature is. get_rangevector takes into account map tiling, |
1422 | * creature is. get_rangevector takes into account map tiling, |
1554 | * so you just can not look the the map coordinates and get the |
1423 | * so you just can not look the the map coordinates and get the |
1555 | * righte value. distance_x/y are distance away, which |
1424 | * righte value. distance_x/y are distance away, which |
1556 | * can be negativbe. direction is the crossfire direction scheme |
1425 | * can be negative. direction is the crossfire direction scheme |
1557 | * that the creature should head. part is the part of the |
1426 | * that the creature should head. part is the part of the |
1558 | * monster that is closest. |
1427 | * monster that is closest. |
1559 | * |
1428 | * |
1560 | * get_rangevector looks at op1 and op2, and fills in the |
1429 | * get_rangevector looks at op1 and op2, and fills in the |
1561 | * structure for op1 to get to op2. |
1430 | * structure for op1 to get to op2. |
… | |
… | |
1572 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1441 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1573 | { |
1442 | { |
1574 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1443 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1575 | { |
1444 | { |
1576 | /* be conservative and fill in _some_ data */ |
1445 | /* be conservative and fill in _some_ data */ |
1577 | retval->distance = 100000; |
1446 | retval->distance = 10000; |
1578 | retval->distance_x = 32767; |
1447 | retval->distance_x = 10000; |
1579 | retval->distance_y = 32767; |
1448 | retval->distance_y = 10000; |
1580 | retval->direction = 0; |
1449 | retval->direction = 0; |
1581 | retval->part = 0; |
1450 | retval->part = 0; |
1582 | } |
1451 | } |
1583 | else |
1452 | else |
1584 | { |
1453 | { |
… | |
… | |
1589 | |
1458 | |
1590 | best = op1; |
1459 | best = op1; |
1591 | /* If this is multipart, find the closest part now */ |
1460 | /* If this is multipart, find the closest part now */ |
1592 | if (!(flags & 0x1) && op1->more) |
1461 | if (!(flags & 0x1) && op1->more) |
1593 | { |
1462 | { |
1594 | object *tmp; |
|
|
1595 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1463 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1596 | |
1464 | |
1597 | /* we just take the offset of the piece to head to figure |
1465 | /* we just take the offset of the piece to head to figure |
1598 | * distance instead of doing all that work above again |
1466 | * distance instead of doing all that work above again |
1599 | * since the distance fields we set above are positive in the |
1467 | * since the distance fields we set above are positive in the |
1600 | * same axis as is used for multipart objects, the simply arithmetic |
1468 | * same axis as is used for multipart objects, the simply arithmetic |
1601 | * below works. |
1469 | * below works. |
1602 | */ |
1470 | */ |
1603 | for (tmp = op1->more; tmp != NULL; tmp = tmp->more) |
1471 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1604 | { |
1472 | { |
1605 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1473 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1606 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1474 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1607 | if (tmpi < best_distance) |
1475 | if (tmpi < best_distance) |
1608 | { |
1476 | { |
1609 | best_distance = tmpi; |
1477 | best_distance = tmpi; |
1610 | best = tmp; |
1478 | best = tmp; |
1611 | } |
1479 | } |
1612 | } |
1480 | } |
|
|
1481 | |
1613 | if (best != op1) |
1482 | if (best != op1) |
1614 | { |
1483 | { |
1615 | retval->distance_x += op1->x - best->x; |
1484 | retval->distance_x += op1->x - best->x; |
1616 | retval->distance_y += op1->y - best->y; |
1485 | retval->distance_y += op1->y - best->y; |
1617 | } |
1486 | } |
1618 | } |
1487 | } |
|
|
1488 | |
1619 | retval->part = best; |
1489 | retval->part = best; |
1620 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1490 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1621 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1491 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1622 | } |
1492 | } |
1623 | } |
1493 | } |
1624 | |
1494 | |
1625 | /* this is basically the same as get_rangevector above, but instead of |
1495 | /* this is basically the same as get_rangevector above, but instead of |
… | |
… | |
1630 | * flags has no meaning for this function at this time - I kept it in to |
1500 | * flags has no meaning for this function at this time - I kept it in to |
1631 | * be more consistant with the above function and also in case they are needed |
1501 | * be more consistant with the above function and also in case they are needed |
1632 | * for something in the future. Also, since no object is pasted, the best |
1502 | * for something in the future. Also, since no object is pasted, the best |
1633 | * field of the rv_vector is set to NULL. |
1503 | * field of the rv_vector is set to NULL. |
1634 | */ |
1504 | */ |
1635 | |
|
|
1636 | void |
1505 | void |
1637 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) |
1506 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1638 | { |
1507 | { |
1639 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1508 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1640 | { |
1509 | { |
1641 | /* be conservative and fill in _some_ data */ |
1510 | /* be conservative and fill in _some_ data */ |
1642 | retval->distance = 100000; |
1511 | retval->distance = 100000; |
… | |
… | |
1649 | { |
1518 | { |
1650 | retval->distance_x += op2->x - x; |
1519 | retval->distance_x += op2->x - x; |
1651 | retval->distance_y += op2->y - y; |
1520 | retval->distance_y += op2->y - y; |
1652 | |
1521 | |
1653 | retval->part = NULL; |
1522 | retval->part = NULL; |
1654 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1523 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1655 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1524 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1656 | } |
1525 | } |
1657 | } |
1526 | } |
1658 | |
1527 | |
1659 | /* Returns true of op1 and op2 are effectively on the same map |
1528 | /* Returns true of op1 and op2 are effectively on the same map |
… | |
… | |
1679 | op->remove (); |
1548 | op->remove (); |
1680 | |
1549 | |
1681 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1550 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1682 | } |
1551 | } |
1683 | |
1552 | |
|
|
1553 | region * |
|
|
1554 | maptile::region (int x, int y) const |
|
|
1555 | { |
|
|
1556 | if (regions |
|
|
1557 | && regionmap |
|
|
1558 | && !OUT_OF_REAL_MAP (this, x, y)) |
|
|
1559 | if (struct region *reg = regionmap [regions [y * width + x]]) |
|
|
1560 | return reg; |
|
|
1561 | |
|
|
1562 | if (default_region) |
|
|
1563 | return default_region; |
|
|
1564 | |
|
|
1565 | return ::region::default_region (); |
|
|
1566 | } |
|
|
1567 | |
|
|
1568 | /* picks a random object from a style map. |
|
|
1569 | * Redone by MSW so it should be faster and not use static |
|
|
1570 | * variables to generate tables. |
|
|
1571 | */ |
|
|
1572 | object * |
|
|
1573 | maptile::pick_random_object () const |
|
|
1574 | { |
|
|
1575 | /* while returning a null object will result in a crash, that |
|
|
1576 | * is actually preferable to an infinite loop. That is because |
|
|
1577 | * most servers will automatically restart in case of crash. |
|
|
1578 | * Change the logic on getting the random space - shouldn't make |
|
|
1579 | * any difference, but this seems clearer to me. |
|
|
1580 | */ |
|
|
1581 | for (int i = 1000; --i;) |
|
|
1582 | { |
|
|
1583 | object *pick = at (rndm (width), rndm (height)).bot; |
|
|
1584 | |
|
|
1585 | // do not prefer big monsters just because they are big. |
|
|
1586 | if (pick && pick->head_ () == pick) |
|
|
1587 | return pick->head_ (); |
|
|
1588 | } |
|
|
1589 | |
|
|
1590 | // instead of crashing in the unlikely(?) case, try to return *something* |
|
|
1591 | return get_archetype ("blocked"); |
|
|
1592 | } |
|
|
1593 | |
|
|
1594 | void |
|
|
1595 | maptile::play_sound (faceidx sound, int x, int y) const |
|
|
1596 | { |
|
|
1597 | if (!sound) |
|
|
1598 | return; |
|
|
1599 | |
|
|
1600 | for_all_players (pl) |
|
|
1601 | if (pl->observe->map == this) |
|
|
1602 | if (client *ns = pl->ns) |
|
|
1603 | { |
|
|
1604 | int dx = x - pl->ob->x; |
|
|
1605 | int dy = y - pl->ob->y; |
|
|
1606 | |
|
|
1607 | int distance = idistance (dx, dy); |
|
|
1608 | |
|
|
1609 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1610 | ns->play_sound (sound, dx, dy); |
|
|
1611 | } |
|
|
1612 | } |
|
|
1613 | |