ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/map.h
(Generate patch)

Comparing deliantra/server/include/map.h (file contents):
Revision 1.63 by root, Mon Jan 29 16:11:48 2007 UTC vs.
Revision 1.76 by root, Mon May 28 21:15:56 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
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 it
9 * it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
10 * the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
11 * (at your option) any later version. 11 * 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, but
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 * GNU General Public License for more details. 16 * 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 along
19 * along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 21 *
22 * The authors can be reached via e-mail at crossfire@schmorp.de 22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 23 */
24 24
25/* 25/*
26 * The maptile is allocated each time a new map is opened. 26 * The maptile is allocated each time a new map is opened.
27 * It contains pointers (very indirectly) to all objects on the map. 27 * It contains pointers (very indirectly) to all objects on the map.
65// all those macros are herewith declared legacy 65// all those macros are herewith declared legacy
66#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () 66#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 67#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 68#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 69#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] 70#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 71#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 72#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 73#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 74#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off
118 * to extend information about a space. 117 * to extend information about a space.
119 */ 118 */
120struct mapspace 119struct mapspace
121{ 120{
122 object *bot, *top; /* lowest/highest object on this space */ 121 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 */ 122 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */
125 uint8 flags_; /* flags about this space (see the P_ values above) */ 123 uint8 flags_; /* flags about this space (see the P_ values above) */
126 sint8 light; /* How much light this space provides */ 124 sint8 light; /* How much light this space provides */
127 MoveType move_block; /* What movement types this space blocks */ 125 MoveType move_block; /* What movement types this space blocks */
128 MoveType move_slow; /* What movement types this space slows */ 126 MoveType move_slow; /* What movement types this space slows */
153 if (op->type == PLAYER) 151 if (op->type == PLAYER)
154 return op; 152 return op;
155 153
156 return 0; 154 return 0;
157 } 155 }
158};
159 156
160/* 157 // 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 158 uint64 volume () const;
162 * they have to appear here in the headers, before the mapdef
163 */
164INTERFACE_CLASS (region)
165struct region : zero_initialised
166{
167 region *ACC (RW, next); /* pointer to next region, NULL for the last one */
168 shstr ACC (RW, name); /* Shortend name of the region as maps refer to it */
169 shstr 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 shstr 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 shstr 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 static region *find_fuzzy (const char *name);
193}; 159};
194 160
195struct shopitems : zero_initialised 161struct shopitems : zero_initialised
196{ 162{
197 const char *name; /* name of the item in question, null if it is the default item */ 163 const char *name; /* name of the item in question, null if it is the default item */
245 * be loaded before used. The map,omap and map_ob 211 * be loaded before used. The map,omap and map_ob
246 * arrays will be allocated when the map is loaded */ 212 * arrays will be allocated when the map is loaded */
247 sint16 players; /* How many players are on this map right now */ 213 sint16 players; /* How many players are on this map right now */
248 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 */
249 215
216 bool ACC (RW, active); // wether this map is active or not
250 bool ACC (RW, per_player); 217 bool ACC (RW, per_player);
251 bool ACC (RW, per_party); 218 bool ACC (RW, per_party);
252 bool ACC (RW, outdoor); /* True if an outdoor map */ 219 bool ACC (RW, outdoor); /* True if an outdoor map */
253 bool ACC (RW, nodrop); /* avoid dropping anything on this map */ 220 bool ACC (RW, nodrop); /* avoid dropping anything on this map */
254 uint8 ACC (RW, darkness); /* indicates level of darkness of map */ 221 uint8 ACC (RW, darkness); /* indicates level of darkness of map */
271 shstr ACC (RW, msg); /* Message map creator may have left */ 238 shstr ACC (RW, msg); /* Message map creator may have left */
272 shstr ACC (RW, maplore); /* Map lore information */ 239 shstr ACC (RW, maplore); /* Map lore information */
273 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ 240 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */
274 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ 241 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */
275 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
276 245
277 MTH void activate (); 246 MTH void activate ();
278 MTH void deactivate (); 247 MTH void deactivate ();
279 248
280 // allocates all (empty) mapspace 249 // allocates all (empty) mapspace
348 } 317 }
349 318
350 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);
351 bool generate_random_map (random_map_params *RP); 320 bool generate_random_map (random_map_params *RP);
352 321
322 static maptile *find_async (const char *path, maptile *original = 0);//PERL
353 static maptile *find_sync (const char *path, maptile *original = 0);//PERL 323 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
354 // async prefetch 324 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
355 static maptile *find_async (const char *path, maptile *original = 0);//PERL 325 MTH object *pick_random_object () const;
356 326
357 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]; }
358 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } 328 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
359}; 329};
360 330

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines