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) 2002-2005 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002-2005,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. |
|
|
21 | * |
20 | * |
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 | /* |
24 | /* |
26 | * The maptile is allocated each time a new map is opened. |
25 | * The maptile is allocated each time a new map is opened. |
27 | * It contains pointers (very indirectly) to all objects on the map. |
26 | * It contains pointers (very indirectly) to all objects on the map. |
… | |
… | |
65 | // all those macros are herewith declared legacy |
64 | // all those macros are herewith declared legacy |
66 | #define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () |
65 | #define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () |
67 | #define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light |
66 | #define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light |
68 | #define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot |
67 | #define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot |
69 | #define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top |
68 | #define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top |
70 | #define GET_MAP_FACE(M,X,Y,L) (M)->at((X),(Y)).faces[L] |
|
|
71 | #define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] |
69 | #define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] |
72 | #define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block |
70 | #define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block |
73 | #define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow |
71 | #define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow |
74 | #define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on |
72 | #define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on |
75 | #define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off |
73 | #define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off |
… | |
… | |
118 | * to extend information about a space. |
116 | * to extend information about a space. |
119 | */ |
117 | */ |
120 | struct mapspace |
118 | struct mapspace |
121 | { |
119 | { |
122 | object *bot, *top; /* lowest/highest object on this space */ |
120 | object *bot, *top; /* lowest/highest object on this space */ |
123 | facetile *faces[MAP_LAYERS]; /* faces for the 3 layers */ |
|
|
124 | object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ |
121 | object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ |
125 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
122 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
126 | sint8 light; /* How much light this space provides */ |
123 | sint8 light; /* How much light this space provides */ |
127 | MoveType move_block; /* What movement types this space blocks */ |
124 | MoveType move_block; /* What movement types this space blocks */ |
128 | MoveType move_slow; /* What movement types this space slows */ |
125 | MoveType move_slow; /* What movement types this space slows */ |
… | |
… | |
153 | if (op->type == PLAYER) |
150 | if (op->type == PLAYER) |
154 | return op; |
151 | return op; |
155 | |
152 | |
156 | return 0; |
153 | return 0; |
157 | } |
154 | } |
158 | }; |
|
|
159 | |
155 | |
160 | /* |
156 | // return the item volume on this mapspace in cm³ |
161 | * Each map is in a given region of the game world and links to a region definiton, so |
157 | uint64 volume () const; |
162 | * they have to appear here in the headers, before the mapdef |
|
|
163 | */ |
|
|
164 | INTERFACE_CLASS (region) |
|
|
165 | struct region : zero_initialised |
|
|
166 | { |
|
|
167 | region *ACC (RW, next); /* pointer to next region, NULL for the last one */ |
|
|
168 | char *ACC (RW, name); /* Shortend name of the region as maps refer to it */ |
|
|
169 | char *ACC (RW, parent_name); /* |
|
|
170 | * So that parent and child regions can be defined in |
|
|
171 | * any order, we keep hold of the parent_name during |
|
|
172 | * initialisation, and the children get assigned to their |
|
|
173 | * parents later. (before runtime on the server though) |
|
|
174 | * nothing outside the init code should ever use this value. |
|
|
175 | */ |
|
|
176 | region *ACC (RW, parent); /* |
|
|
177 | * Pointer to the region that is a parent of the current |
|
|
178 | * region, if a value isn't defined in the current region |
|
|
179 | * we traverse this series of pointers until it is. |
|
|
180 | */ |
|
|
181 | char *ACC (RW, longname); /* Official title of the region, this might be defined |
|
|
182 | * to be the same as name*/ |
|
|
183 | char *ACC (RW, msg); /* the description of the region */ |
|
|
184 | uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */ |
|
|
185 | sint8 ACC (RW, fallback); /* whether, in the event of a region not existing, |
|
|
186 | * this should be the one we fall back on as the default */ |
|
|
187 | char *ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */ |
|
|
188 | sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */ |
|
|
189 | |
|
|
190 | static region *default_region (); |
|
|
191 | static region *find (const char *name); |
|
|
192 | }; |
158 | }; |
193 | |
159 | |
194 | struct shopitems : zero_initialised |
160 | struct shopitems : zero_initialised |
195 | { |
161 | { |
196 | const char *name; /* name of the item in question, null if it is the default item */ |
162 | const char *name; /* name of the item in question, null if it is the default item */ |
… | |
… | |
233 | double ACC (RW, reset_time); |
199 | double ACC (RW, reset_time); |
234 | uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map |
200 | uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map |
235 | * should be reset |
201 | * should be reset |
236 | */ |
202 | */ |
237 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
203 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
|
|
204 | bool ACC (RW, no_reset); // must not reset this map |
238 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
205 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
239 | * players entering/exiting map |
206 | * players entering/exiting map |
240 | */ |
207 | */ |
241 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
208 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
242 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
209 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
… | |
… | |
244 | * be loaded before used. The map,omap and map_ob |
211 | * be loaded before used. The map,omap and map_ob |
245 | * arrays will be allocated when the map is loaded */ |
212 | * arrays will be allocated when the map is loaded */ |
246 | sint16 players; /* How many players are on this map right now */ |
213 | sint16 players; /* How many players are on this map right now */ |
247 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
214 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
248 | |
215 | |
|
|
216 | bool ACC (RW, active); // wether this map is active or not |
249 | bool ACC (RW, per_player); |
217 | bool ACC (RW, per_player); |
250 | bool ACC (RW, per_party); |
218 | bool ACC (RW, per_party); |
251 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
219 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
252 | bool ACC (RW, nodrop); /* avoid dropping anything on this map */ |
220 | bool ACC (RW, nodrop); /* avoid dropping anything on this map */ |
253 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
221 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
… | |
… | |
270 | shstr ACC (RW, msg); /* Message map creator may have left */ |
238 | shstr ACC (RW, msg); /* Message map creator may have left */ |
271 | shstr ACC (RW, maplore); /* Map lore information */ |
239 | shstr ACC (RW, maplore); /* Map lore information */ |
272 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
240 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
273 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
241 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
274 | shstr ACC (RW, path); /* Filename of the map */ |
242 | shstr ACC (RW, path); /* Filename of the map */ |
|
|
243 | int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace |
|
|
244 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
275 | |
245 | |
276 | MTH void activate (); |
246 | MTH void activate (); |
277 | MTH void deactivate (); |
247 | MTH void deactivate (); |
278 | |
248 | |
279 | // allocates all (empty) mapspace |
249 | // allocates all (empty) mapspace |
280 | MTH void alloc (); |
250 | MTH void alloc (); |
281 | // deallocates the mapspaces (and destroys all objects) |
251 | // deallocates the mapspaces (and destroys all objects) |
282 | MTH void clear (); |
252 | MTH void clear (); |
283 | |
253 | |
284 | MTH void fix_auto_apply (); |
254 | MTH void fix_auto_apply (); |
285 | MTH void decay_objects (); |
255 | MTH void do_decay_objects (); |
286 | MTH void update_buttons (); |
256 | MTH void update_buttons (); |
287 | MTH int change_map_light (int change); |
257 | MTH int change_map_light (int change); |
288 | static void change_all_map_light (int change); //PERL |
258 | static void change_all_map_light (int change); //PERL |
289 | MTH void set_darkness_map (); |
259 | MTH void set_darkness_map (); |
290 | MTH int estimate_difficulty () const; |
260 | MTH int estimate_difficulty () const; |
… | |
… | |
347 | } |
317 | } |
348 | |
318 | |
349 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
319 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
350 | bool generate_random_map (random_map_params *RP); |
320 | bool generate_random_map (random_map_params *RP); |
351 | |
321 | |
|
|
322 | static maptile *find_async (const char *path, maptile *original = 0);//PERL |
352 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
323 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
353 | // async prefetch |
324 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
354 | static maptile *find_async (const char *path, maptile *original = 0);//PERL |
325 | MTH object *pick_random_object () const; |
355 | |
326 | |
356 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
327 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
357 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
328 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
358 | }; |
329 | }; |
359 | |
330 | |
… | |
… | |
375 | object *part; |
346 | object *part; |
376 | }; |
347 | }; |
377 | |
348 | |
378 | //TODO: these should be refactored into things like xy_normalise |
349 | //TODO: these should be refactored into things like xy_normalise |
379 | // and so on. |
350 | // and so on. |
380 | int get_map_flags(maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
351 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
381 | int ob_blocked(const object *ob, maptile *m, sint16 x, sint16 y); |
352 | int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y); |
382 | int out_of_map(maptile *m, int x, int y); |
353 | int out_of_map (maptile *m, int x, int y); |
383 | maptile *get_map_from_coord(maptile *m, sint16 *x, sint16 *y); |
354 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
384 | void get_rangevector(object *op1, object *op2, rv_vector *retval, int flags); |
355 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
385 | void get_rangevector_from_mapcoord(const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
356 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
386 | int on_same_map(const object *op1, const object *op2); |
357 | int on_same_map (const object *op1, const object *op2); |
|
|
358 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
387 | |
359 | |
388 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
360 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
389 | inline bool |
361 | inline bool |
390 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
362 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
391 | { |
363 | { |