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 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 | { |
58 | TILE_RIGHT = 1, |
58 | TILE_NORTH, |
|
|
59 | TILE_EAST, |
|
|
60 | TILE_SOUTH, |
|
|
61 | TILE_WEST, |
|
|
62 | TILE_UP, |
59 | TILE_DOWN = 2, |
63 | TILE_DOWN, |
60 | TILE_LEFT = 3, |
64 | TILE_NUM, |
61 | }; |
65 | }; |
62 | |
66 | |
63 | /* Values for in_memory below */ |
67 | /* Values for state below */ |
64 | enum { |
68 | enum |
65 | MAP_ACTIVE, |
69 | { |
66 | MAP_INACTIVE, // not used atm. |
70 | MAP_SWAPPED, // header loaded, nothing else |
67 | MAP_SWAPPED, |
71 | MAP_INACTIVE, // in memory, linkable, but not active |
68 | MAP_LOADING, |
72 | MAP_ACTIVE, // running! |
69 | MAP_SAVING, |
|
|
70 | }; |
73 | }; |
71 | |
74 | |
72 | /* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should |
75 | /* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should |
73 | * really be used, as it is multi tile aware. However, there are some cases |
76 | * really be used, as it is multi tile aware. However, there are some cases |
74 | * where it is known the map is not tiled or the values are known |
77 | * where it is known the map is not tiled or the values are known |
… | |
… | |
88 | * should almost always be using out_of_map instead, which takes into account |
91 | * should almost always be using out_of_map instead, which takes into account |
89 | * map tiling. |
92 | * map tiling. |
90 | */ |
93 | */ |
91 | #define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height))) |
94 | #define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height))) |
92 | |
95 | |
93 | /* These are used in the MapLook flags element. They are not used in |
96 | /* These are used in the mapspace flags element. They are not used in |
94 | * in the object flags structure. |
97 | * in the object flags structure. |
95 | */ |
98 | */ |
96 | #define P_BLOCKSVIEW 0x01 |
99 | #define P_BLOCKSVIEW 0x01 |
97 | #define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
100 | #define P_NO_MAGIC 0x02 /* Spells (some) can't pass this object */ |
98 | #define P_NO_CLERIC 0x04 /* no clerical spells cast here */ |
101 | #define P_NO_CLERIC 0x04 /* no clerical spells cast here */ |
… | |
… | |
112 | * function that does more of the work can hopefully be used to replace |
115 | * function that does more of the work can hopefully be used to replace |
113 | * lots of duplicate checks currently in the code. |
116 | * lots of duplicate checks currently in the code. |
114 | */ |
117 | */ |
115 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
118 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
116 | #define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */ |
119 | #define P_NEW_MAP 0x20000 /* Coordinates passed result in a new tiled map */ |
|
|
120 | |
|
|
121 | // persistent flags (pflags) in mapspace |
|
|
122 | enum |
|
|
123 | { |
|
|
124 | PF_VIS_UP = 0x01, // visible upwards, set by upmap, cleared by mapspace |
|
|
125 | }; |
117 | |
126 | |
118 | /* Instead of having numerous arrays that have information on a |
127 | /* Instead of having numerous arrays that have information on a |
119 | * particular space (was map, floor, floor2, map_ob), |
128 | * particular space (was map, floor, floor2, map_ob), |
120 | * have this structure take care of that information. |
129 | * have this structure take care of that information. |
121 | * This puts it all in one place, and should also make it easier |
130 | * This puts it all in one place, and should also make it easier |
… | |
… | |
136 | uint16_t ACC (RW, items_); // saturates at 64k |
145 | uint16_t ACC (RW, items_); // saturates at 64k |
137 | uint32_t ACC (RW, volume_); // ~dm³ (not cm³) (factor is actually 1024) |
146 | 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 |
147 | 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 |
148 | static uint32_t ACC (RW, smellcount); // global smell counter |
140 | |
149 | |
141 | uint32_t pad1_, pad2_; // pad to 64 bytes on 64 bit systems |
150 | uint8_t pflags; // additional, persistent flags |
|
|
151 | uint8_t pad [3]; // pad to 64 bytes on LP64 systems |
142 | |
152 | |
143 | //-GPL |
153 | //-GPL |
144 | |
154 | |
145 | void update_ (); |
155 | void update_ (); |
146 | MTH void update () |
156 | MTH void update () |
… | |
… | |
212 | maptile *m; |
222 | maptile *m; |
213 | int x0, y0; |
223 | int x0, y0; |
214 | int x1, y1; |
224 | int x1, y1; |
215 | int dx, dy; // offset to go from local coordinates to original tile */ |
225 | int dx, dy; // offset to go from local coordinates to original tile */ |
216 | }; |
226 | }; |
|
|
227 | |
|
|
228 | // (refcounted) list of objects on this map that need physics processing |
|
|
229 | struct physics_queue |
|
|
230 | : unordered_vector<object *> |
|
|
231 | { |
|
|
232 | int i; // already processed |
|
|
233 | physics_queue (); |
|
|
234 | ~physics_queue (); |
|
|
235 | object *pop (); |
|
|
236 | }; |
|
|
237 | |
|
|
238 | #define PHYSICS_QUEUES 16 // "activity" at least every 16 ticks |
217 | |
239 | |
218 | //+GPL |
240 | //+GPL |
219 | |
241 | |
220 | struct shopitems : zero_initialised |
242 | struct shopitems : zero_initialised |
221 | { |
243 | { |
… | |
… | |
263 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
285 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
264 | bool ACC (RW, no_reset); // must not reset this map |
286 | bool ACC (RW, no_reset); // must not reset this map |
265 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
287 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
266 | * players entering/exiting map |
288 | * players entering/exiting map |
267 | */ |
289 | */ |
|
|
290 | uint8 ACC (RW, state); /* If not true, the map has been freed and must |
|
|
291 | * be loaded before used. The map,omap and map_ob |
|
|
292 | * arrays will be allocated when the map is loaded */ |
268 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
293 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
269 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
294 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
270 | uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must |
|
|
271 | * be loaded before used. The map,omap and map_ob |
|
|
272 | * arrays will be allocated when the map is loaded */ |
|
|
273 | sint16 players; /* How many players are on this map right now */ |
295 | sint16 players; /* How many players are on this map right now */ |
274 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
296 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
275 | |
297 | |
276 | bool ACC (RW, per_player); |
298 | bool ACC (RW, per_player); |
277 | bool ACC (RW, per_party); |
299 | bool ACC (RW, per_party); |
… | |
… | |
288 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
310 | double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ |
289 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
311 | sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ |
290 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
312 | sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ |
291 | shstr ACC (RW, msg); /* Message map creator may have left */ |
313 | shstr ACC (RW, msg); /* Message map creator may have left */ |
292 | shstr ACC (RW, maplore); /* Map lore information */ |
314 | shstr ACC (RW, maplore); /* Map lore information */ |
293 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
315 | shstr ACC (RW, tile_path[TILE_NUM]); /* path to adjoining maps */ |
294 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
316 | maptile *ACC (RW, tile_map[TILE_NUM]); /* Next map, linked list */ |
295 | shstr ACC (RW, path); /* Filename of the map */ |
317 | shstr ACC (RW, path); /* Filename of the map */ |
296 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
318 | 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 |
319 | int ACC (RW, max_items); // maximum number of items on a mapspace |
298 | |
320 | |
299 | //-GPL |
321 | //-GPL |
300 | |
322 | |
|
|
323 | physics_queue pq[PHYSICS_QUEUES]; |
|
|
324 | MTH void queue_physics (object *ob, int after = 0); |
|
|
325 | MTH void queue_physics_at (int x, int y); |
|
|
326 | MTH void post_load_physics (); |
|
|
327 | MTH int run_physics (tick_t tick, int max_objects); |
|
|
328 | |
301 | // the maptile:: is neccessary here for the perl interface to work |
329 | // the maptile:: is neccessary here for the perl interface to work |
302 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
330 | MTH sint8 darklevel (sint8 outside = maptile::outdoor_darkness) const |
303 | { |
331 | { |
304 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
332 | return clamp (outdoor ? darkness + outside : darkness, 0, MAX_DARKNESS); |
305 | } |
333 | } |
306 | |
334 | |
307 | static void adjust_daylight (); |
335 | static void adjust_daylight (); |
308 | |
336 | |
309 | MTH void activate (); |
337 | MTH void activate (); |
|
|
338 | MTH void activate_physics (); |
310 | MTH void deactivate (); |
339 | MTH void deactivate (); |
311 | |
340 | |
312 | // allocates all (empty) mapspace |
341 | // allocates all (empty) mapspace |
313 | MTH void alloc (); |
342 | MTH void alloc (); |
314 | // deallocates the mapspaces (and destroys all objects) |
343 | // deallocates the mapspaces (and destroys all objects) |
… | |
… | |
320 | MTH void update_buttons (); |
349 | MTH void update_buttons (); |
321 | MTH int change_map_light (int change); |
350 | MTH int change_map_light (int change); |
322 | MTH int estimate_difficulty () const; |
351 | MTH int estimate_difficulty () const; |
323 | |
352 | |
324 | MTH void play_sound (faceidx sound, int x, int y) const; |
353 | MTH void play_sound (faceidx sound, int x, int y) const; |
325 | MTH void say_msg (const char *msg, int x, int y) const; |
354 | MTH void say_msg (const_utf8_string msg, int x, int y) const; |
326 | |
355 | |
327 | // connected links |
356 | // connected links |
328 | oblinkpt *find_link (shstr_tmp id); |
357 | oblinkpt *find_link (shstr_tmp id); |
329 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
358 | MTH void trigger (shstr_tmp id, int state = 1, object *activator = 0, object *originator = 0); |
330 | |
359 | |
… | |
… | |
348 | bool _load_objects (object_thawer &thawer); |
377 | bool _load_objects (object_thawer &thawer); |
349 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
378 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
350 | |
379 | |
351 | // save objects into the given file (uses IO_ flags) |
380 | // save objects into the given file (uses IO_ flags) |
352 | bool _save_objects (object_freezer &freezer, int flags); |
381 | bool _save_objects (object_freezer &freezer, int flags); |
353 | MTH bool _save_objects (const char *path, int flags); |
382 | MTH bool _save_objects (const_octet_string path, int flags); |
354 | |
383 | |
355 | // save the header pseudo object _only_ |
384 | // save the header pseudo object _only_ |
356 | bool _save_header (object_freezer &freezer); |
385 | bool _save_header (object_freezer &freezer); |
357 | MTH bool _save_header (const char *path); |
386 | MTH bool _save_header (const_octet_string path); |
358 | |
387 | |
359 | maptile (); |
388 | maptile (); |
360 | maptile (int w, int h); |
389 | maptile (int w, int h); |
|
|
390 | void init (); |
361 | ~maptile (); |
391 | ~maptile (); |
362 | |
392 | |
363 | void do_destroy (); |
393 | void do_destroy (); |
364 | void gather_callbacks (AV *&callbacks, event_type event) const; |
394 | void gather_callbacks (AV *&callbacks, event_type event) const; |
|
|
395 | |
|
|
396 | MTH bool linkable () { return state >= MAP_INACTIVE; } |
365 | |
397 | |
366 | MTH int size () const { return width * height; } |
398 | MTH int size () const { return width * height; } |
367 | |
399 | |
368 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
400 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
369 | |
401 | |
… | |
… | |
386 | { |
418 | { |
387 | if (!spaces) |
419 | if (!spaces) |
388 | do_load_sync (); |
420 | do_load_sync (); |
389 | } |
421 | } |
390 | |
422 | |
391 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
423 | void make_map_floor (char **layout, const char *floorstyle, random_map_params *RP); |
392 | bool generate_random_map (random_map_params *RP); |
424 | bool generate_random_map (random_map_params *RP); |
393 | |
425 | |
394 | static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL |
426 | 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 |
427 | 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 |
428 | 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; |
429 | object *pick_random_object (rand_gen &gen = rndm) const; |
398 | |
430 | |
399 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
431 | mapspace &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
400 | |
432 | |
401 | // return an array of maprects corresponding |
433 | // return an array of maprects corresponding |
402 | // to the given rectangular area. the last rect will have |
434 | // to the given rectangular area. the last rect will have |
403 | // a 0 map pointer. |
435 | // 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); |
436 | maprect *split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1); |
|
|
437 | |
|
|
438 | MTH bool is_in_shop (int x, int y) const; |
407 | }; |
439 | }; |
|
|
440 | |
|
|
441 | inline bool |
|
|
442 | object::is_in_shop () const |
|
|
443 | { |
|
|
444 | return is_on_map () |
|
|
445 | && map->is_in_shop (x, y); |
|
|
446 | } |
408 | |
447 | |
409 | //+GPL |
448 | //+GPL |
410 | |
449 | |
411 | /* This is used by get_rangevector to determine where the other |
450 | /* This is used by get_rangevector to determine where the other |
412 | * creature is. get_rangevector takes into account map tiling, |
451 | * creature is. get_rangevector takes into account map tiling, |
… | |
… | |
431 | // and so on. |
470 | // and so on. |
432 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
471 | 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); |
472 | int out_of_map (maptile *m, int x, int y); |
434 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
473 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
435 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
474 | 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*/); |
475 | 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); |
476 | int on_same_map (const object *op1, const object *op2); |
438 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
477 | int adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy); |
439 | |
478 | |
440 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
479 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
441 | static inline bool |
480 | static inline bool |
442 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
481 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
443 | { |
482 | { |
… | |
… | |
547 | |
586 | |
548 | #define ordered_mapwalk_end \ |
587 | #define ordered_mapwalk_end \ |
549 | } \ |
588 | } \ |
550 | } |
589 | } |
551 | |
590 | |
|
|
591 | extern dynbuf mapwalk_buf; // can be used in simple non-recursive situations |
|
|
592 | |
552 | // loop over every space in the given maprect, |
593 | // 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 |
594 | // 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" |
595 | // the iterator code must be a single statement following this macro call, similar to "if" |
555 | // "continue" will skip to the next space |
596 | // "continue" will skip to the next space |
556 | #define rect_mapwalk(rect,dx0,dy0) \ |
597 | #define rect_mapwalk(rect,dx0,dy0) \ |
… | |
… | |
562 | |
603 | |
563 | // same as ordered_mapwalk, but the walk will not follow any particular |
604 | // same as ordered_mapwalk, but the walk will not follow any particular |
564 | // order (unorded), but is likely faster. |
605 | // 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 |
606 | // 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 |
607 | // "continue" will skip to the next space |
567 | #define unordered_mapwalk_at(map,ox,oy,dx0,dy0,dx1,dy1) \ |
608 | #define unordered_mapwalk_at(buf,map,ox,oy,dx0,dy0,dx1,dy1) \ |
568 | for (maprect *r_e_c_t = (map)->split_to_tiles ( \ |
609 | for (maprect *r_e_c_t = (map)->split_to_tiles (buf, \ |
569 | (ox) + (dx0) , (oy) + (dy0) , \ |
610 | (ox) + (dx0) , (oy) + (dy0) , \ |
570 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
611 | (ox) + (dx1) + 1, (oy) + (dy1) + 1); \ |
571 | r_e_c_t->m; \ |
612 | r_e_c_t->m; \ |
572 | ++r_e_c_t) \ |
613 | ++r_e_c_t) \ |
573 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
614 | rect_mapwalk (r_e_c_t, (ox), (oy)) |
574 | |
615 | |
575 | #define unordered_mapwalk(op,dx0,dy0,dx1,dy1) \ |
616 | #define unordered_mapwalk(buf,op,dx0,dy0,dx1,dy1) \ |
576 | unordered_mapwalk_at (op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
617 | unordered_mapwalk_at (buf,op->map, op->x, op->y, dx0, dy0, dx1, dy1) |
577 | |
618 | |
578 | #endif |
619 | #endif |
579 | |
620 | |