… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra 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 3 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, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* |
25 | /* |
… | |
… | |
28 | |
29 | |
29 | #ifndef MAP_H |
30 | #ifndef MAP_H |
30 | #define MAP_H |
31 | #define MAP_H |
31 | |
32 | |
32 | #include <tr1/unordered_map> |
33 | #include <tr1/unordered_map> |
|
|
34 | |
|
|
35 | //+GPL |
33 | |
36 | |
34 | #include "region.h" |
37 | #include "region.h" |
35 | #include "cfperl.h" |
38 | #include "cfperl.h" |
36 | |
39 | |
37 | /* We set this size - this is to make magic map work properly on |
40 | /* We set this size - this is to make magic map work properly on |
… | |
… | |
90 | /* These are used in the MapLook flags element. They are not used in |
93 | /* These are used in the MapLook flags element. They are not used in |
91 | * in the object flags structure. |
94 | * in the object flags structure. |
92 | */ |
95 | */ |
93 | #define P_BLOCKSVIEW 0x01 |
96 | #define P_BLOCKSVIEW 0x01 |
94 | #define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
97 | #define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
95 | #define P_PLAYER 0x04 /* a player (or something seeing these objects) is on this mapspace */ |
98 | #define P_NO_CLERIC 0x04 /* no clerical spells cast here */ |
96 | #define P_SAFE 0x08 /* If this is set the map tile is a safe space, |
99 | #define P_SAFE 0x08 /* If this is set the map tile is a safe space, |
97 | * that means, nothing harmful can be done, |
100 | * that means, nothing harmful can be done, |
98 | * such as: bombs, potion usage, alchemy, spells |
101 | * such as: bombs, potion usage, alchemy, spells |
99 | * this was introduced to make shops safer |
102 | * this was introduced to make shops safer |
100 | * but is useful in other situations */ |
103 | * but is useful in other situations */ |
|
|
104 | |
|
|
105 | #define P_PLAYER 0x10 /* a player (or something seeing these objects) is on this mapspace */ |
101 | #define P_IS_ALIVE 0x10 /* something alive is on this space */ |
106 | #define P_IS_ALIVE 0x20 /* something alive is on this space */ |
102 | #define P_NO_CLERIC 0x20 /* no clerical spells cast here */ |
|
|
103 | |
|
|
104 | #define P_UPTODATE 0x80 /* this space is up to date */ |
107 | #define P_UPTODATE 0x80 // this space is up to date |
105 | |
108 | |
106 | /* The following two values are not stored in the MapLook flags, but instead |
109 | /* The following two values are not stored in the MapLook flags, but instead |
107 | * used in the get_map_flags value - that function is used to return |
110 | * used in the get_map_flags value - that function is used to return |
108 | * the flag value, as well as other conditions - using a more general |
111 | * the flag value, as well as other conditions - using a more general |
109 | * function that does more of the work can hopefully be used to replace |
112 | * function that does more of the work can hopefully be used to replace |
110 | * lots of duplicate checks currently in the code. |
113 | * lots of duplicate checks currently in the code. |
111 | */ |
114 | */ |
112 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
115 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
113 | #define P_NEW_MAP 0x20000 |
116 | #define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */ |
114 | /* Coordinates passed result in a new tiled map */ |
|
|
115 | |
117 | |
116 | /* Instead of having numerous arrays that have information on a |
118 | /* Instead of having numerous arrays that have information on a |
117 | * particular space (was map, floor, floor2, map_ob), |
119 | * particular space (was map, floor, floor2, map_ob), |
118 | * have this structure take care of that information. |
120 | * have this structure take care of that information. |
119 | * This puts it all in one place, and should also make it easier |
121 | * This puts it all in one place, and should also make it easier |
… | |
… | |
121 | */ |
123 | */ |
122 | INTERFACE_CLASS (mapspace) |
124 | INTERFACE_CLASS (mapspace) |
123 | struct mapspace |
125 | struct mapspace |
124 | { |
126 | { |
125 | object *ACC (RW, bot); |
127 | object *ACC (RW, bot); |
126 | object *ACC (RW, top); /* lowest/highest object on this space */ |
128 | object *ACC (RW, top); /* lowest/highest object on this space */ |
127 | object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */ |
129 | object *ACC (RW, faces_obj[MAP_LAYERS]);/* face objects for the 3 layers */ |
128 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
130 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
129 | sint8 ACC (RW, light); /* How much light this space provides */ |
131 | sint8 ACC (RW, light); /* How much light this space provides */ |
130 | MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
132 | MoveType ACC (RW, move_block); /* What movement types this space blocks */ |
131 | MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
133 | MoveType ACC (RW, move_slow); /* What movement types this space slows */ |
132 | MoveType ACC (RW, move_on); /* What movement types are activated */ |
134 | MoveType ACC (RW, move_on); /* What movement types are activated */ |
133 | MoveType ACC (RW, move_off); /* What movement types are activated */ |
135 | MoveType ACC (RW, move_off); /* What movement types are activated */ |
|
|
136 | uint16_t ACC (RW, nrof_); // saturates at 64k |
|
|
137 | uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024) |
|
|
138 | uint32_t ACC (RW, smell); // the last count a player was seen here, or 0 |
|
|
139 | static uint32_t ACC (RW, smellcount); // global smell counter |
|
|
140 | |
|
|
141 | uint32_t pad1_, pad2_; // pad to 64 bytes on 64 bit systems |
|
|
142 | |
|
|
143 | //-GPL |
134 | |
144 | |
135 | void update_ (); |
145 | void update_ (); |
136 | MTH void update () |
146 | MTH void update () |
137 | { |
147 | { |
138 | if (!(flags_ & P_UPTODATE)) |
148 | // we take advantage of the fact that 0x80 is the sign bit |
|
|
149 | // to generate more efficient code on many cpus |
|
|
150 | assert (sint8 (P_UPTODATE) < 0); |
|
|
151 | assert (sint8 (-1 & ~P_UPTODATE) >= 0); |
|
|
152 | |
|
|
153 | if (expect_false (sint8 (flags_) >= 0)) |
139 | update_ (); |
154 | update_ (); |
|
|
155 | |
|
|
156 | // must be true by now |
|
|
157 | assume (sint8 (flags_) < 0); |
|
|
158 | assume (flags_ & P_UPTODATE); |
140 | } |
159 | } |
141 | |
160 | |
142 | MTH uint8 flags () |
161 | MTH uint8 flags () |
143 | { |
162 | { |
144 | update (); |
163 | update (); |
… | |
… | |
161 | op = 0; |
180 | op = 0; |
162 | |
181 | |
163 | return op; |
182 | return op; |
164 | } |
183 | } |
165 | |
184 | |
|
|
185 | MTH uint32 nrof () |
|
|
186 | { |
|
|
187 | update (); |
|
|
188 | return nrof_; |
|
|
189 | } |
|
|
190 | |
166 | // return the item volume on this mapspace in cm³ |
191 | // return the item volume on this mapspace in cm³ |
167 | MTH uint64 volume () const; |
192 | MTH uint64 volume () |
|
|
193 | { |
|
|
194 | update (); |
|
|
195 | return volume_ * 1024; |
|
|
196 | } |
168 | |
197 | |
169 | bool blocks (MoveType mt) const |
198 | bool blocks (MoveType mt) const |
170 | { |
199 | { |
171 | return move_block && (mt & move_block) == mt; |
200 | return move_block && (mt & move_block) == mt; |
172 | } |
201 | } |
… | |
… | |
183 | maptile *m; |
212 | maptile *m; |
184 | int x0, y0; |
213 | int x0, y0; |
185 | int x1, y1; |
214 | int x1, y1; |
186 | int dx, dy; // offset to go from local coordinates to original tile */ |
215 | int dx, dy; // offset to go from local coordinates to original tile */ |
187 | }; |
216 | }; |
|
|
217 | |
|
|
218 | //+GPL |
188 | |
219 | |
189 | struct shopitems : zero_initialised |
220 | struct shopitems : zero_initialised |
190 | { |
221 | { |
191 | const char *name; /* name of the item in question, null if it is the default item */ |
222 | const char *name; /* name of the item in question, null if it is the default item */ |
192 | const char *name_pl; /* plural name */ |
223 | const char *name_pl; /* plural name */ |
… | |
… | |
269 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
300 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
270 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
301 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
271 | shstr ACC (RW, path); /* Filename of the map */ |
302 | shstr ACC (RW, path); /* Filename of the map */ |
272 | int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace |
303 | int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace |
273 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
304 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
|
|
305 | int ACC (RW, max_items); // maximum number of items on a mapspace |
|
|
306 | |
|
|
307 | //-GPL |
274 | |
308 | |
275 | // the maptile:: is neccessary here for the perl interface to work |
309 | // the maptile:: is neccessary here for the perl interface to work |
276 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
310 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
277 | { |
311 | { |
278 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
312 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
… | |
… | |
293 | MTH void update_buttons (); |
327 | MTH void update_buttons (); |
294 | MTH int change_map_light (int change); |
328 | MTH int change_map_light (int change); |
295 | MTH int estimate_difficulty () const; |
329 | MTH int estimate_difficulty () const; |
296 | |
330 | |
297 | MTH void play_sound (faceidx sound, int x, int y) const; |
331 | MTH void play_sound (faceidx sound, int x, int y) const; |
|
|
332 | MTH void say_msg (const char *msg, int x, int y) const; |
|
|
333 | |
|
|
334 | // connected links |
|
|
335 | oblinkpt *find_link (shstr_tmp id); |
|
|
336 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
298 | |
337 | |
299 | // set the given flag on all objects in the map |
338 | // set the given flag on all objects in the map |
300 | MTH void set_object_flag (int flag, int value = 1); |
339 | MTH void set_object_flag (int flag, int value = 1); |
301 | MTH void post_load_original (); |
340 | MTH void post_load_original (); |
302 | |
341 | |
… | |
… | |
371 | // a 0 map pointer. |
410 | // a 0 map pointer. |
372 | // the array will be stored in a static memory area, |
411 | // the array will be stored in a static memory area, |
373 | // so recursion is not atm. supported |
412 | // so recursion is not atm. supported |
374 | maprect *split_to_tiles (int x0, int y0, int x1, int y1); |
413 | maprect *split_to_tiles (int x0, int y0, int x1, int y1); |
375 | }; |
414 | }; |
|
|
415 | |
|
|
416 | //+GPL |
376 | |
417 | |
377 | /* This is used by get_rangevector to determine where the other |
418 | /* This is used by get_rangevector to determine where the other |
378 | * creature is. get_rangevector takes into account map tiling, |
419 | * creature is. get_rangevector takes into account map tiling, |
379 | * so you just can not look the the map coordinates and get the |
420 | * so you just can not look the the map coordinates and get the |
380 | * righte value. distance_x/y are distance away, which |
421 | * righte value. distance_x/y are distance away, which |
… | |
… | |
397 | // and so on. |
438 | // and so on. |
398 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
439 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
399 | int out_of_map (maptile *m, int x, int y); |
440 | int out_of_map (maptile *m, int x, int y); |
400 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
441 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
401 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
442 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
402 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
443 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags = 0 /*unused*/); |
403 | int on_same_map (const object *op1, const object *op2); |
444 | int on_same_map (const object *op1, const object *op2); |
404 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
445 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
405 | |
446 | |
406 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
447 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
407 | static inline bool |
448 | static inline bool |
… | |
… | |
412 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
453 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
413 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
454 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
414 | } |
455 | } |
415 | // comaptibility cruft end |
456 | // comaptibility cruft end |
416 | |
457 | |
|
|
458 | //-GPL |
|
|
459 | |
417 | inline mapspace & |
460 | inline mapspace & |
418 | object::ms () const |
461 | object::ms () const |
419 | { |
462 | { |
420 | return map->at (x, y); |
463 | return map->at (x, y); |
421 | } |
464 | } |
… | |
… | |
488 | // can be used as a single statement, but both iterate macros |
531 | // can be used as a single statement, but both iterate macros |
489 | // invocations must not be followed by a ";" |
532 | // invocations must not be followed by a ";" |
490 | // see common/los.C for usage example |
533 | // see common/los.C for usage example |
491 | // the walk will be ordered, outer loop x, inner loop y |
534 | // the walk will be ordered, outer loop x, inner loop y |
492 | // m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op |
535 | // m will be set to the map (or 0), nx, ny to the map coord, dx, dy to the offset relative to op |
|
|
536 | // "continue" will skip to the next space |
493 | #define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \ |
537 | #define ordered_mapwalk_begin(op,dx0,dy0,dx1,dy1) \ |
494 | for (int dx = (dx0); dx <= (dx1); ++dx) \ |
538 | for (int dx = (dx0); dx <= (dx1); ++dx) \ |
495 | { \ |
539 | { \ |
496 | sint16 nx, ny; \ |
540 | sint16 nx, ny; \ |
497 | maptile *m = 0; \ |
541 | maptile *m = 0; \ |
… | |
… | |
502 | /* if not, do it the slow way */ \ |
546 | /* if not, do it the slow way */ \ |
503 | if (!m || ++ny >= m->height) \ |
547 | if (!m || ++ny >= m->height) \ |
504 | { \ |
548 | { \ |
505 | nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \ |
549 | nx = (op)->x + dx; ny = (op)->y + dy; m = (op)->map; \ |
506 | \ |
550 | \ |
507 | if (xy_normalise (m, nx, ny)) \ |
551 | if (!xy_normalise (m, nx, ny)) \ |
508 | m->touch (); \ |
|
|
509 | else \ |
|
|
510 | m = 0; \ |
552 | m = 0; \ |
511 | } |
553 | } |
512 | |
554 | |
513 | #define ordered_mapwalk_end \ |
555 | #define ordered_mapwalk_end \ |
514 | } \ |
556 | } \ |
515 | } |
557 | } |
516 | |
558 | |
517 | // loop over every space in the given maprect, |
559 | // loop over every space in the given maprect, |
518 | // setting m, nx, ny to the map and -coordinate and dx, dy to the offste relative to dx0,dy0 |
560 | // setting m, nx, ny to the map and -coordinate and dx, dy to the offset relative to dx0,dy0 |
519 | // the iterator code must be a single statement following this macro call, similar to "if" |
561 | // the iterator code must be a single statement following this macro call, similar to "if" |
|
|
562 | // "continue" will skip to the next space |
520 | #define rect_mapwalk(rect,dx0,dy0) \ |
563 | #define rect_mapwalk(rect,dx0,dy0) \ |
521 | statementvar (maptile *, m, (rect)->m) \ |
564 | statementvar (maptile *, m, (rect)->m) \ |
522 | for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \ |
565 | for (int nx = (rect)->x0; nx < (rect)->x1; ++nx) \ |
523 | for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \ |
566 | for (int ny = (rect)->y0; ny < (rect)->y1; ++ny) \ |
524 | statementvar (int, dx, nx + (rect)->dx - (dx0)) \ |
567 | statementvar (int, dx, nx + (rect)->dx - (dx0)) \ |
525 | statementvar (int, dy, ny + (rect)->dy - (dy0)) |
568 | statementvar (int, dy, ny + (rect)->dy - (dy0)) |
526 | |
569 | |
527 | // same as above, but the walk will not follow any particular |
570 | // same as ordered_mapwalk, but the walk will not follow any particular |
528 | // order (unorded), but is likely faster. |
571 | // order (unorded), but is likely faster. |
529 | // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
572 | // m will be set to the map (never 0!), nx, ny to the map coord, dx, dy to the offset relative to op |
|
|
573 | // "continue" will skip to the next space |
530 | #define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ |
574 | #define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \ |
531 | for (maprect *r_e_c_t = (op)->map->split_to_tiles ( \ |
575 | for (maprect *r_e_c_t = (map)->split_to_tiles ( \ |
532 | (op)->x + (dx0) , (op)->y + (dy0) , \ |
576 | (ox) + (dx0) , (oy) + (dy0) , \ |
533 | (op)->x + (dx1) + 1, (op)->y + (dy1) + 1); \ |
577 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
534 | r_e_c_t->m; \ |
578 | r_e_c_t->m; \ |
535 | ++r_e_c_t) \ |
579 | ++r_e_c_t) \ |
536 | rect_mapwalk (r_e_c_t, (op)->x, (op)->y) |
580 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
|
|
581 | |
|
|
582 | #define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ |
|
|
583 | unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
537 | |
584 | |
538 | #endif |
585 | #endif |
539 | |
586 | |