1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002-2005 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * option) any later version. |
… | |
… | |
48 | * map pointers. |
48 | * map pointers. |
49 | */ |
49 | */ |
50 | #define MAGIC_MAP_SIZE 50 |
50 | #define MAGIC_MAP_SIZE 50 |
51 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
51 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
52 | |
52 | |
53 | #define MAP_LAYERS 3 |
53 | #define MAP_LAYERS 3 |
54 | |
54 | |
55 | // tile map index |
55 | // tile map index |
56 | enum { |
56 | enum { |
57 | TILE_UP = 0, |
57 | TILE_NORTH, |
58 | TILE_RIGHT = 1, |
58 | TILE_EAST, |
|
|
59 | TILE_SOUTH, |
|
|
60 | TILE_WEST, |
|
|
61 | TILE_UP, |
59 | TILE_DOWN = 2, |
62 | TILE_DOWN, |
60 | TILE_LEFT = 3, |
63 | TILE_NUM, |
61 | }; |
64 | }; |
62 | |
65 | |
63 | /* Values for in_memory below */ |
66 | /* Values for in_memory below */ |
64 | enum { |
67 | enum { |
65 | MAP_ACTIVE, |
68 | MAP_ACTIVE, |
… | |
… | |
288 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
291 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
289 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
292 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
290 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
293 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
291 | shstr ACC (RW, msg); /* Message map creator may have left */ |
294 | shstr ACC (RW, msg); /* Message map creator may have left */ |
292 | shstr ACC (RW, maplore); /* Map lore information */ |
295 | shstr ACC (RW, maplore); /* Map lore information */ |
293 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
296 | shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */ |
294 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
297 | maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */ |
295 | shstr ACC (RW, path); /* Filename of the map */ |
298 | shstr ACC (RW, path); /* Filename of the map */ |
296 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
299 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
297 | int ACC (RW, max_items); // maximum number of items on a mapspace |
300 | int ACC (RW, max_items); // maximum number of items on a mapspace |
298 | |
301 | |
299 | //-GPL |
302 | //-GPL |
… | |
… | |
320 | MTH void update_buttons (); |
323 | MTH void update_buttons (); |
321 | MTH int change_map_light (int change); |
324 | MTH int change_map_light (int change); |
322 | MTH int estimate_difficulty () const; |
325 | MTH int estimate_difficulty () const; |
323 | |
326 | |
324 | MTH void play_sound (faceidx sound, int x, int y) const; |
327 | MTH void play_sound (faceidx sound, int x, int y) const; |
325 | MTH void say_msg (const char *msg, int x, int y) const; |
328 | MTH void say_msg (const_utf8_string msg, int x, int y) const; |
326 | |
329 | |
327 | // connected links |
330 | // connected links |
328 | oblinkpt *find_link (shstr_tmp id); |
331 | oblinkpt *find_link (shstr_tmp id); |
329 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
332 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
330 | |
333 | |
… | |
… | |
348 | bool _load_objects (object_thawer &thawer); |
351 | bool _load_objects (object_thawer &thawer); |
349 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
352 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
350 | |
353 | |
351 | // save objects into the given file (uses IO_ flags) |
354 | // save objects into the given file (uses IO_ flags) |
352 | bool _save_objects (object_freezer &freezer, int flags); |
355 | bool _save_objects (object_freezer &freezer, int flags); |
353 | MTH bool _save_objects (const char *path, int flags); |
356 | MTH bool _save_objects (const_octet_string path, int flags); |
354 | |
357 | |
355 | // save the header pseudo object _only_ |
358 | // save the header pseudo object _only_ |
356 | bool _save_header (object_freezer &freezer); |
359 | bool _save_header (object_freezer &freezer); |
357 | MTH bool _save_header (const char *path); |
360 | MTH bool _save_header (const_octet_string path); |
358 | |
361 | |
359 | maptile (); |
362 | maptile (); |
360 | maptile (int w, int h); |
363 | maptile (int w, int h); |
|
|
364 | void init (); |
361 | ~maptile (); |
365 | ~maptile (); |
362 | |
366 | |
363 | void do_destroy (); |
367 | void do_destroy (); |
364 | void gather_callbacks (AV *&callbacks, event_type event) const; |
368 | void gather_callbacks (AV *&callbacks, event_type event) const; |
365 | |
369 | |
… | |
… | |
386 | { |
390 | { |
387 | if (!spaces) |
391 | if (!spaces) |
388 | do_load_sync (); |
392 | do_load_sync (); |
389 | } |
393 | } |
390 | |
394 | |
391 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
395 | void make_map_floor (char **layout, const char *floorstyle, random_map_params *RP); |
392 | bool generate_random_map (random_map_params *RP); |
396 | bool generate_random_map (random_map_params *RP); |
393 | |
397 | |
394 | static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL |
398 | static maptile *find_async (const_utf8_string path, maptile *original = 0, bool load = true);//PERL |
395 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
399 | static maptile *find_sync (const_utf8_string path, maptile *original = 0);//PERL |
396 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
400 | static maptile *find_style_sync (const_utf8_string dir, const_utf8_string file = 0);//PERL |
397 | object *pick_random_object (rand_gen &gen = rndm) const; |
401 | object *pick_random_object (rand_gen &gen = rndm) const; |
398 | |
402 | |
399 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
403 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
400 | |
404 | |
401 | // return an array of maprects corresponding |
405 | // return an array of maprects corresponding |
402 | // to the given rectangular area. the last rect will have |
406 | // to the given rectangular area. the last rect will have |
403 | // a 0 map pointer. |
407 | // a 0 map pointer. |
404 | // the array will be stored in a static memory area, |
|
|
405 | // so recursion is not atm. supported |
|
|
406 | maprect *split_to_tiles (int x0, int y0, int x1, int y1); |
408 | maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1); |
|
|
409 | |
|
|
410 | MTH bool is_in_shop (int x, int y) const; |
407 | }; |
411 | }; |
|
|
412 | |
|
|
413 | inline bool |
|
|
414 | object::is_in_shop () const |
|
|
415 | { |
|
|
416 | return is_on_map () |
|
|
417 | && map->is_in_shop (x, y); |
|
|
418 | } |
408 | |
419 | |
409 | //+GPL |
420 | //+GPL |
410 | |
421 | |
411 | /* This is used by get_rangevector to determine where the other |
422 | /* This is used by get_rangevector to determine where the other |
412 | * creature is. get_rangevector takes into account map tiling, |
423 | * creature is. get_rangevector takes into account map tiling, |
… | |
… | |
431 | // and so on. |
442 | // and so on. |
432 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
443 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
433 | int out_of_map (maptile *m, int x, int y); |
444 | int out_of_map (maptile *m, int x, int y); |
434 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
445 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
435 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
446 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
436 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); |
447 | void get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); |
437 | int on_same_map (const object *op1, const object *op2); |
448 | int on_same_map (const object *op1, const object *op2); |
438 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
449 | int adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy); |
439 | |
450 | |
440 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
451 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
441 | static inline bool |
452 | static inline bool |
442 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
453 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
443 | { |
454 | { |
… | |
… | |
547 | |
558 | |
548 | #define ordered_mapwalk_end \ |
559 | #define ordered_mapwalk_end \ |
549 | } \ |
560 | } \ |
550 | } |
561 | } |
551 | |
562 | |
|
|
563 | extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations |
|
|
564 | |
552 | // loop over every space in the given maprect, |
565 | // loop over every space in the given maprect, |
553 | // setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 |
566 | // setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 |
554 | // the iterator code must be a single statement following this macro call, similar to "if" |
567 | // the iterator code must be a single statement following this macro call, similar to "if" |
555 | // "continue" will skip to the next space |
568 | // "continue" will skip to the next space |
556 | #define rect_mapwalk(rect,dx0,dy0) \ |
569 | #define rect_mapwalk(rect,dx0,dy0) \ |
… | |
… | |
562 | |
575 | |
563 | // same as ordered_mapwalk, but the walk will not follow any particular |
576 | // same as ordered_mapwalk, but the walk will not follow any particular |
564 | // order (unorded), but is likely faster. |
577 | // order (unorded), but is likely faster. |
565 | // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
578 | // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
566 | // "continue" will skip to the next space |
579 | // "continue" will skip to the next space |
567 | #define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \ |
580 | #define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \ |
568 | for (maprect *r_e_c_t = (map)->split_to_tiles ( \ |
581 | for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \ |
569 | (ox) + (dx0) , (oy) + (dy0) , \ |
582 | (ox) + (dx0) , (oy) + (dy0) , \ |
570 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
583 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
571 | r_e_c_t->m; \ |
584 | r_e_c_t->m; \ |
572 | ++r_e_c_t) \ |
585 | ++r_e_c_t) \ |
573 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
586 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
574 | |
587 | |
575 | #define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ |
588 | #define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \ |
576 | unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
589 | unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
577 | |
590 | |
578 | #endif |
591 | #endif |
579 | |
592 | |