1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT 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 <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <unistd.h> |
25 | #include <unistd.h> |
25 | |
26 | |
26 | #include "global.h" |
27 | #include "global.h" |
27 | #include "funcpoint.h" |
|
|
28 | |
|
|
29 | #include "loader.h" |
28 | #include "loader.h" |
30 | |
|
|
31 | #include "path.h" |
29 | #include "path.h" |
32 | |
30 | |
33 | /* |
31 | sint8 maptile::outdoor_darkness; |
34 | * This makes a path absolute outside the world of Crossfire. |
|
|
35 | * In other words, it prepends LIBDIR/MAPDIR/ to the given path |
|
|
36 | * and returns the pointer to a static array containing the result. |
|
|
37 | * it really should be called create_mapname |
|
|
38 | */ |
|
|
39 | const char * |
|
|
40 | create_pathname (const char *name) |
|
|
41 | { |
|
|
42 | static char buf[8192]; |
|
|
43 | snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name); |
|
|
44 | return buf; |
|
|
45 | } |
|
|
46 | |
|
|
47 | /* |
|
|
48 | * This function checks if a file with the given path exists. |
|
|
49 | * -1 is returned if it fails, otherwise the mode of the file |
|
|
50 | * is returned. |
|
|
51 | * It tries out all the compression suffixes listed in the uncomp[] array. |
|
|
52 | * |
|
|
53 | * If prepend_dir is set, then we call create_pathname (which prepends |
|
|
54 | * libdir & mapdir). Otherwise, we assume the name given is fully |
|
|
55 | * complete. |
|
|
56 | * Only the editor actually cares about the writablity of this - |
|
|
57 | * the rest of the code only cares that the file is readable. |
|
|
58 | * when the editor goes away, the call to stat should probably be |
|
|
59 | * replaced by an access instead (similar to the windows one, but |
|
|
60 | * that seems to be missing the prepend_dir processing |
|
|
61 | */ |
|
|
62 | int |
|
|
63 | check_path (const char *name, int prepend_dir) |
|
|
64 | { |
|
|
65 | char buf[MAX_BUF]; |
|
|
66 | |
|
|
67 | char *endbuf; |
|
|
68 | struct stat statbuf; |
|
|
69 | int mode = 0; |
|
|
70 | |
|
|
71 | if (prepend_dir) |
|
|
72 | assign (buf, create_pathname (name)); |
|
|
73 | else |
|
|
74 | assign (buf, name); |
|
|
75 | |
|
|
76 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
|
|
77 | * this method should be equivalant and is clearer. |
|
|
78 | * Can not use strcat because we need to cycle through |
|
|
79 | * all the names. |
|
|
80 | */ |
|
|
81 | endbuf = buf + strlen (buf); |
|
|
82 | |
|
|
83 | if (stat (buf, &statbuf)) |
|
|
84 | return -1; |
|
|
85 | if (!S_ISREG (statbuf.st_mode)) |
|
|
86 | return (-1); |
|
|
87 | |
|
|
88 | if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) || |
|
|
89 | ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH)) |
|
|
90 | mode |= 4; |
|
|
91 | |
|
|
92 | if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) || |
|
|
93 | (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH)) |
|
|
94 | mode |= 2; |
|
|
95 | |
|
|
96 | return (mode); |
|
|
97 | } |
|
|
98 | |
32 | |
99 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
33 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
100 | * one function that just returns a P_.. value (see map.h) |
34 | * one function that just returns a P_.. value (see map.h) |
101 | * it will also do map translation for tiled maps, returning |
35 | * it will also do map translation for tiled maps, returning |
102 | * new values into newmap, nx, and ny. Any and all of those |
36 | * new values into newmap, nx, and ny. Any and all of those |
… | |
… | |
137 | * by the caller. |
71 | * by the caller. |
138 | */ |
72 | */ |
139 | int |
73 | int |
140 | blocked_link (object *ob, maptile *m, int sx, int sy) |
74 | blocked_link (object *ob, maptile *m, int sx, int sy) |
141 | { |
75 | { |
142 | object *tmp; |
|
|
143 | int mflags, blocked; |
|
|
144 | |
|
|
145 | /* Make sure the coordinates are valid - they should be, as caller should |
76 | /* Make sure the coordinates are valid - they should be, as caller should |
146 | * have already checked this. |
77 | * have already checked this. |
147 | */ |
78 | */ |
148 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
79 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
149 | { |
80 | { |
150 | LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
81 | LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
151 | return 1; |
82 | return 1; |
152 | } |
83 | } |
153 | |
84 | |
154 | /* Save some cycles - instead of calling get_map_flags(), just get the value |
85 | mapspace &ms = m->at (sx, sy); |
155 | * directly. |
|
|
156 | */ |
|
|
157 | mflags = m->at (sx, sy).flags (); |
|
|
158 | |
86 | |
159 | blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); |
87 | int mflags = ms.flags (); |
|
|
88 | int blocked = ms.move_block; |
160 | |
89 | |
161 | /* If space is currently not blocked by anything, no need to |
90 | /* If space is currently not blocked by anything, no need to |
162 | * go further. Not true for players - all sorts of special |
91 | * go further. Not true for players - all sorts of special |
163 | * things we need to do for players. |
92 | * things we need to do for players. |
164 | */ |
93 | */ |
165 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
94 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
166 | return 0; |
95 | return 0; |
167 | |
96 | |
168 | /* if there isn't anytyhing alive on this space, and this space isn't |
97 | /* if there isn't anything alive on this space, and this space isn't |
169 | * otherwise blocked, we can return now. Only if there is a living |
98 | * otherwise blocked, we can return now. Only if there is a living |
170 | * creature do we need to investigate if it is part of this creature |
99 | * creature do we need to investigate if it is part of this creature |
171 | * or another. Likewise, only if something is blocking us do we |
100 | * or another. Likewise, only if something is blocking us do we |
172 | * need to investigate if there is a special circumstance that would |
101 | * need to investigate if there is a special circumstance that would |
173 | * let the player through (inventory checkers for example) |
102 | * let the player through (inventory checkers for example) |
… | |
… | |
180 | /* We basically go through the stack of objects, and if there is |
109 | /* We basically go through the stack of objects, and if there is |
181 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
110 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
182 | * true. If we get through the entire stack, that must mean |
111 | * true. If we get through the entire stack, that must mean |
183 | * ob is blocking it, so return 0. |
112 | * ob is blocking it, so return 0. |
184 | */ |
113 | */ |
185 | for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) |
114 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
186 | { |
115 | { |
187 | |
116 | if (OB_MOVE_BLOCK (ob, tmp)) |
188 | /* This must be before the checks below. Code for inventory checkers. */ |
|
|
189 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
|
|
190 | { |
117 | { |
191 | /* If last_sp is set, the player/monster needs an object, |
118 | if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob)) |
192 | * so we check for it. If they don't have it, they can't |
119 | if (RESULT_INT (0)) |
193 | * pass through this space. |
120 | return 1; |
194 | */ |
121 | else |
195 | if (tmp->last_sp) |
122 | continue; |
|
|
123 | |
|
|
124 | if (tmp->type == CHECK_INV) |
196 | { |
125 | { |
197 | if (check_inv_recursive (ob, tmp) == NULL) |
126 | bool have = check_inv_recursive (ob, tmp); |
|
|
127 | |
|
|
128 | // last_sp set means we block if we don't have. |
|
|
129 | if (logical_xor (have, tmp->last_sp)) |
198 | return 1; |
130 | return 1; |
199 | else |
131 | } |
200 | continue; |
132 | else if (tmp->type == T_MATCH) |
|
|
133 | { |
|
|
134 | // T_MATCH allows "entrance" iff the match is true |
|
|
135 | // == blocks if the match fails |
|
|
136 | |
|
|
137 | // we could have used an INVOKE_OBJECT, but decided against it, as we |
|
|
138 | // assume that T_MATCH is relatively common. |
|
|
139 | if (!match (tmp->slaying, ob, tmp, ob)) |
|
|
140 | return 1; |
201 | } |
141 | } |
202 | else |
142 | else |
203 | { |
143 | return 1; // unconditional block |
204 | /* In this case, the player must not have the object - |
144 | |
205 | * if they do, they can't pass through. |
|
|
206 | */ |
|
|
207 | if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ |
|
|
208 | return 1; |
|
|
209 | else |
|
|
210 | continue; |
|
|
211 | } |
|
|
212 | } /* if check_inv */ |
|
|
213 | else |
145 | } else { |
214 | { |
146 | // space does not block the ob, directly, but |
215 | /* Broke apart a big nasty if into several here to make |
147 | // anything alive that is not a door still |
216 | * this more readable. first check - if the space blocks |
148 | // blocks anything but wizards. |
217 | * movement, can't move here. |
|
|
218 | * second - if a monster, can't move there, unless it is a |
|
|
219 | * hidden dm |
|
|
220 | */ |
|
|
221 | if (OB_MOVE_BLOCK (ob, tmp)) |
|
|
222 | return 1; |
|
|
223 | |
149 | |
224 | if (tmp->flag [FLAG_ALIVE] |
150 | if (tmp->flag [FLAG_ALIVE] |
225 | && tmp->head_ () != ob |
151 | && tmp->head_ () != ob |
226 | && tmp != ob |
152 | && tmp != ob |
227 | && tmp->type != DOOR |
153 | && tmp->type != DOOR |
228 | && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) |
154 | && !tmp->flag [FLAG_WIZPASS]) |
229 | return 1; |
155 | return 1; |
230 | } |
156 | } |
231 | |
|
|
232 | } |
157 | } |
|
|
158 | |
233 | return 0; |
159 | return 0; |
234 | } |
160 | } |
235 | |
161 | |
236 | /* |
162 | /* |
237 | * Returns true if the given object can't fit in the given spot. |
163 | * Returns qthe blocking object if the given object can't fit in the given |
238 | * This is meant for multi space objects - for single space objecs, |
164 | * spot. This is meant for multi space objects - for single space objecs, |
239 | * just calling get_map_blocked and checking that against movement type |
165 | * just calling get_map_blocked and checking that against movement type |
240 | * of object. This function goes through all the parts of the |
166 | * of object. This function goes through all the parts of the multipart |
241 | * multipart object and makes sure they can be inserted. |
167 | * object and makes sure they can be inserted. |
242 | * |
168 | * |
243 | * While this doesn't call out of map, the get_map_flags does. |
169 | * While this doesn't call out of map, the get_map_flags does. |
244 | * |
170 | * |
245 | * This function has been used to deprecate arch_out_of_map - |
171 | * This function has been used to deprecate arch_out_of_map - |
246 | * this function also does that check, and since in most cases, |
172 | * this function also does that check, and since in most cases, |
… | |
… | |
257 | * |
183 | * |
258 | * Note this used to be arch_blocked, but with new movement |
184 | * Note this used to be arch_blocked, but with new movement |
259 | * code, we need to have actual object to check its move_type |
185 | * code, we need to have actual object to check its move_type |
260 | * against the move_block values. |
186 | * against the move_block values. |
261 | */ |
187 | */ |
262 | int |
188 | bool |
263 | ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) |
189 | object::blocked (maptile *m, int x, int y) const |
264 | { |
190 | { |
265 | archetype *tmp; |
191 | for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more) |
266 | int flag; |
|
|
267 | maptile *m1; |
|
|
268 | sint16 sx, sy; |
|
|
269 | |
|
|
270 | if (!ob) |
|
|
271 | { |
|
|
272 | flag = get_map_flags (m, &m1, x, y, &sx, &sy); |
|
|
273 | if (flag & P_OUT_OF_MAP) |
|
|
274 | return P_OUT_OF_MAP; |
|
|
275 | |
|
|
276 | /* don't have object, so don't know what types would block */ |
|
|
277 | return m1->at (sx, sy).move_block; |
|
|
278 | } |
192 | { |
|
|
193 | mapxy pos (m, x + tmp->x, y + tmp->y); |
279 | |
194 | |
280 | for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more) |
195 | if (!pos.normalise ()) |
281 | { |
196 | return 1; |
282 | flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy); |
|
|
283 | |
197 | |
284 | if (flag & P_OUT_OF_MAP) |
198 | mapspace &ms = *pos; |
285 | return P_OUT_OF_MAP; |
199 | |
286 | if (flag & P_IS_ALIVE) |
200 | if (ms.flags () & P_IS_ALIVE) |
287 | return P_IS_ALIVE; |
201 | return 1; |
288 | |
202 | |
289 | mapspace &ms = m1->at (sx, sy); |
203 | /* However, often ob doesn't have any move type |
290 | |
204 | * (signifying non-moving objects) |
291 | /* find_first_free_spot() calls this function. However, often |
|
|
292 | * ob doesn't have any move type (when used to place exits) |
|
|
293 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
205 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
294 | */ |
206 | */ |
295 | |
|
|
296 | if (ob->move_type == 0 && ms.move_block != MOVE_ALL) |
207 | if (!move_type && ms.move_block != MOVE_ALL) |
297 | continue; |
208 | continue; |
298 | |
209 | |
299 | /* Note it is intentional that we check ob - the movement type of the |
210 | /* Note it is intentional that we check ob - the movement type of the |
300 | * head of the object should correspond for the entire object. |
211 | * head of the object should correspond for the entire object. |
301 | */ |
212 | */ |
302 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
213 | if (ms.blocks (move_type)) |
303 | return P_NO_PASS; |
214 | return 1; |
304 | } |
215 | } |
305 | |
216 | |
306 | return 0; |
217 | return 0; |
307 | } |
218 | } |
308 | |
219 | |
… | |
… | |
326 | |
237 | |
327 | insert_ob_in_ob (tmp, container); |
238 | insert_ob_in_ob (tmp, container); |
328 | tmp = next; |
239 | tmp = next; |
329 | } |
240 | } |
330 | |
241 | |
331 | /* sum_weight will go through and calculate what all the containers are |
242 | // go through and calculate what all the containers are carrying. |
332 | * carrying. |
243 | //TODO: remove |
333 | */ |
244 | container->update_weight (); |
334 | sum_weight (container); |
|
|
335 | } |
245 | } |
336 | |
246 | |
337 | void |
247 | void |
338 | maptile::set_object_flag (int flag, int value) |
248 | maptile::set_object_flag (int flag, int value) |
339 | { |
249 | { |
… | |
… | |
341 | return; |
251 | return; |
342 | |
252 | |
343 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
253 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
344 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
254 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
345 | tmp->flag [flag] = value; |
255 | tmp->flag [flag] = value; |
|
|
256 | } |
|
|
257 | |
|
|
258 | void |
|
|
259 | maptile::post_load_original () |
|
|
260 | { |
|
|
261 | if (!spaces) |
|
|
262 | return; |
|
|
263 | |
|
|
264 | set_object_flag (FLAG_OBJ_ORIGINAL); |
|
|
265 | |
|
|
266 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
267 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
|
|
268 | INVOKE_OBJECT (RESET, tmp); |
346 | } |
269 | } |
347 | |
270 | |
348 | /* link_multipart_objects go through all the objects on the map looking |
271 | /* link_multipart_objects go through all the objects on the map looking |
349 | * for objects whose arch says they are multipart yet according to the |
272 | * for objects whose arch says they are multipart yet according to the |
350 | * info we have, they only have the head (as would be expected when |
273 | * info we have, they only have the head (as would be expected when |
… | |
… | |
388 | bool |
311 | bool |
389 | maptile::_load_objects (object_thawer &f) |
312 | maptile::_load_objects (object_thawer &f) |
390 | { |
313 | { |
391 | for (;;) |
314 | for (;;) |
392 | { |
315 | { |
393 | coroapi::cede_to_tick_every (100); // cede once in a while |
316 | coroapi::cede_to_tick (); // cede once in a while |
394 | |
317 | |
395 | switch (f.kw) |
318 | switch (f.kw) |
396 | { |
319 | { |
397 | case KW_arch: |
320 | case KW_arch: |
398 | if (object *op = object::read (f, this)) |
321 | if (object *op = object::read (f, this)) |
399 | { |
322 | { |
|
|
323 | // TODO: why? |
400 | if (op->inv) |
324 | if (op->inv) |
401 | sum_weight (op); |
325 | op->update_weight (); |
402 | |
326 | |
403 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
327 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
|
|
328 | { |
|
|
329 | // we insert manually because |
|
|
330 | // a) its way faster |
|
|
331 | // b) we remove manually, too, and there are good reasons for that |
|
|
332 | // c) it's correct |
|
|
333 | mapspace &ms = at (op->x, op->y); |
|
|
334 | |
|
|
335 | op->flag [FLAG_REMOVED] = false; |
|
|
336 | |
|
|
337 | op->above = 0; |
|
|
338 | op->below = ms.top; |
|
|
339 | |
|
|
340 | *(ms.top ? &ms.top->above : &ms.bot) = op; |
|
|
341 | |
|
|
342 | ms.top = op; |
|
|
343 | ms.flags_ = 0; |
|
|
344 | } |
|
|
345 | else |
|
|
346 | { |
|
|
347 | f.parse_warn (format ("object %s out of range", op->debug_desc ())); |
|
|
348 | op->destroy (); |
|
|
349 | } |
404 | } |
350 | } |
405 | |
351 | |
406 | continue; |
352 | continue; |
407 | |
353 | |
408 | case KW_EOF: |
354 | case KW_EOF: |
… | |
… | |
421 | } |
367 | } |
422 | |
368 | |
423 | void |
369 | void |
424 | maptile::activate () |
370 | maptile::activate () |
425 | { |
371 | { |
426 | active = true; |
|
|
427 | |
|
|
428 | if (spaces) |
372 | if (spaces) |
429 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
373 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
430 | for (object *op = ms->bot; op; op = op->above) |
374 | for (object *op = ms->bot; op; op = op->above) |
431 | op->activate_recursive (); |
375 | op->activate_recursive (); |
432 | } |
376 | } |
433 | |
377 | |
434 | void |
378 | void |
435 | maptile::deactivate () |
379 | maptile::deactivate () |
436 | { |
380 | { |
437 | active = false; |
|
|
438 | |
|
|
439 | if (spaces) |
381 | if (spaces) |
440 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
382 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
441 | for (object *op = ms->bot; op; op = op->above) |
383 | for (object *op = ms->bot; op; op = op->above) |
442 | op->deactivate_recursive (); |
384 | op->deactivate_recursive (); |
443 | } |
385 | } |
… | |
… | |
453 | if (!spaces) |
395 | if (!spaces) |
454 | return false; |
396 | return false; |
455 | |
397 | |
456 | for (int i = 0; i < size (); ++i) |
398 | for (int i = 0; i < size (); ++i) |
457 | { |
399 | { |
458 | int unique = 0; |
400 | bool unique = 0; |
|
|
401 | |
459 | for (object *op = spaces [i].bot; op; op = op->above) |
402 | for (object *op = spaces [i].bot; op; op = op->above) |
460 | { |
403 | { |
461 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
404 | unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]; |
462 | unique = 1; |
|
|
463 | |
405 | |
464 | if (!op->can_map_save ()) |
406 | if (expect_false (!op->can_map_save ())) |
465 | continue; |
407 | continue; |
466 | |
408 | |
467 | if (unique || op->flag [FLAG_UNIQUE]) |
409 | if (expect_false (unique || op->flag [FLAG_UNIQUE])) |
468 | { |
410 | { |
469 | if (flags & IO_UNIQUES) |
411 | if (flags & IO_UNIQUES) |
470 | op->write (f); |
412 | op->write (f); |
471 | } |
413 | } |
472 | else if (flags & IO_OBJECTS) |
414 | else if (expect_true (flags & IO_OBJECTS)) |
473 | op->write (f); |
415 | op->write (f); |
474 | } |
416 | } |
475 | } |
417 | } |
476 | |
418 | |
477 | coroapi::cede_to_tick (); |
419 | coroapi::cede_to_tick (); |
478 | |
420 | |
479 | return true; |
421 | return true; |
480 | } |
|
|
481 | |
|
|
482 | bool |
|
|
483 | maptile::_load_objects (const char *path, bool skip_header) |
|
|
484 | { |
|
|
485 | object_thawer f (path); |
|
|
486 | |
|
|
487 | if (!f) |
|
|
488 | return false; |
|
|
489 | |
|
|
490 | f.next (); |
|
|
491 | |
|
|
492 | if (skip_header) |
|
|
493 | for (;;) |
|
|
494 | { |
|
|
495 | keyword kw = f.kw; |
|
|
496 | f.skip (); |
|
|
497 | if (kw == KW_end) |
|
|
498 | break; |
|
|
499 | } |
|
|
500 | |
|
|
501 | return _load_objects (f); |
|
|
502 | } |
422 | } |
503 | |
423 | |
504 | bool |
424 | bool |
505 | maptile::_save_objects (const char *path, int flags) |
425 | maptile::_save_objects (const char *path, int flags) |
506 | { |
426 | { |
… | |
… | |
637 | return items; |
557 | return items; |
638 | } |
558 | } |
639 | |
559 | |
640 | /* opposite of parse string, this puts the string that was originally fed in to |
560 | /* opposite of parse string, this puts the string that was originally fed in to |
641 | * the map (or something equivilent) into output_string. */ |
561 | * the map (or something equivilent) into output_string. */ |
642 | static void |
562 | static const char * |
643 | print_shop_string (maptile *m, char *output_string) |
563 | print_shop_string (maptile *m) |
644 | { |
564 | { |
645 | int i; |
565 | static dynbuf_text buf; buf.clear (); |
646 | char tmp[MAX_BUF]; |
|
|
647 | |
566 | |
648 | strcpy (output_string, ""); |
|
|
649 | for (i = 0; i < m->shopitems[0].index; i++) |
567 | for (int i = 0; i < m->shopitems[0].index; i++) |
650 | { |
568 | { |
651 | if (m->shopitems[i].typenum) |
569 | if (m->shopitems[i].typenum) |
652 | { |
570 | { |
653 | if (m->shopitems[i].strength) |
571 | if (m->shopitems[i].strength) |
654 | sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
572 | buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
655 | else |
573 | else |
656 | sprintf (tmp, "%s;", m->shopitems[i].name); |
574 | buf.printf ("%s;", m->shopitems[i].name); |
657 | } |
575 | } |
658 | else |
576 | else |
659 | { |
577 | { |
660 | if (m->shopitems[i].strength) |
578 | if (m->shopitems[i].strength) |
661 | sprintf (tmp, "*:%d;", m->shopitems[i].strength); |
579 | buf.printf ("*:%d;", m->shopitems[i].strength); |
662 | else |
580 | else |
663 | sprintf (tmp, "*"); |
581 | buf.printf ("*"); |
664 | } |
582 | } |
665 | |
|
|
666 | strcat (output_string, tmp); |
|
|
667 | } |
583 | } |
|
|
584 | |
|
|
585 | return buf; |
668 | } |
586 | } |
669 | |
587 | |
670 | /* This loads the header information of the map. The header |
588 | /* This loads the header information of the map. The header |
671 | * contains things like difficulty, size, timeout, etc. |
589 | * contains things like difficulty, size, timeout, etc. |
672 | * this used to be stored in the map object, but with the |
590 | * this used to be stored in the map object, but with the |
… | |
… | |
681 | bool |
599 | bool |
682 | maptile::_load_header (object_thawer &thawer) |
600 | maptile::_load_header (object_thawer &thawer) |
683 | { |
601 | { |
684 | for (;;) |
602 | for (;;) |
685 | { |
603 | { |
686 | thawer.next (); |
|
|
687 | |
|
|
688 | switch (thawer.kw) |
604 | switch (thawer.kw) |
689 | { |
605 | { |
690 | case KW_msg: |
606 | case KW_msg: |
691 | thawer.get_ml (KW_endmsg, msg); |
607 | thawer.get_ml (KW_endmsg, msg); |
692 | break; |
608 | break; |
… | |
… | |
726 | case KW_sky: thawer.get (sky); break; |
642 | case KW_sky: thawer.get (sky); break; |
727 | |
643 | |
728 | case KW_per_player: thawer.get (per_player); break; |
644 | case KW_per_player: thawer.get (per_player); break; |
729 | case KW_per_party: thawer.get (per_party); break; |
645 | case KW_per_party: thawer.get (per_party); break; |
730 | case KW_no_reset: thawer.get (no_reset); break; |
646 | case KW_no_reset: thawer.get (no_reset); break; |
|
|
647 | case KW_no_drop: thawer.get (no_drop); break; |
731 | |
648 | |
732 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
649 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
733 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
650 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
734 | |
651 | |
735 | // old names new names |
652 | // old names new names |
… | |
… | |
747 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
664 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
748 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
665 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
749 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
666 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
750 | |
667 | |
751 | case KW_ERROR: |
668 | case KW_ERROR: |
752 | set_key (thawer.kw_str, thawer.value); |
669 | set_key_text (thawer.kw_str, thawer.value); |
753 | break; |
670 | break; |
754 | |
671 | |
755 | case KW_end: |
672 | case KW_end: |
|
|
673 | thawer.next (); |
756 | return true; |
674 | return true; |
757 | |
675 | |
758 | default: |
676 | default: |
759 | if (!thawer.parse_error ("map", 0)) |
677 | if (!thawer.parse_error ("map", 0)) |
760 | return false; |
678 | return false; |
761 | break; |
679 | break; |
762 | } |
680 | } |
|
|
681 | |
|
|
682 | thawer.next (); |
763 | } |
683 | } |
764 | |
684 | |
765 | abort (); |
685 | abort (); |
766 | } |
|
|
767 | |
|
|
768 | bool |
|
|
769 | maptile::_load_header (const char *path) |
|
|
770 | { |
|
|
771 | object_thawer thawer (path); |
|
|
772 | |
|
|
773 | if (!thawer) |
|
|
774 | return false; |
|
|
775 | |
|
|
776 | return _load_header (thawer); |
|
|
777 | } |
686 | } |
778 | |
687 | |
779 | /****************************************************************************** |
688 | /****************************************************************************** |
780 | * This is the start of unique map handling code |
689 | * This is the start of unique map handling code |
781 | *****************************************************************************/ |
690 | *****************************************************************************/ |
… | |
… | |
793 | |
702 | |
794 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
703 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
795 | unique = 1; |
704 | unique = 1; |
796 | |
705 | |
797 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
706 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
798 | { |
|
|
799 | op->destroy_inv (false); |
|
|
800 | op->destroy (); |
707 | op->destroy (); |
801 | } |
|
|
802 | |
708 | |
803 | op = above; |
709 | op = above; |
804 | } |
710 | } |
805 | } |
711 | } |
806 | } |
712 | } |
… | |
… | |
817 | MAP_OUT (swap_time); |
723 | MAP_OUT (swap_time); |
818 | MAP_OUT (reset_time); |
724 | MAP_OUT (reset_time); |
819 | MAP_OUT (reset_timeout); |
725 | MAP_OUT (reset_timeout); |
820 | MAP_OUT (fixed_resettime); |
726 | MAP_OUT (fixed_resettime); |
821 | MAP_OUT (no_reset); |
727 | MAP_OUT (no_reset); |
|
|
728 | MAP_OUT (no_drop); |
822 | MAP_OUT (difficulty); |
729 | MAP_OUT (difficulty); |
823 | |
|
|
824 | if (default_region) MAP_OUT2 (region, default_region->name); |
730 | if (default_region) MAP_OUT2 (region, default_region->name); |
825 | |
731 | |
826 | if (shopitems) |
732 | if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this)); |
827 | { |
|
|
828 | char shop[MAX_BUF]; |
|
|
829 | print_shop_string (this, shop); |
|
|
830 | MAP_OUT2 (shopitems, shop); |
|
|
831 | } |
|
|
832 | |
|
|
833 | MAP_OUT (shopgreed); |
733 | MAP_OUT (shopgreed); |
834 | MAP_OUT (shopmin); |
734 | MAP_OUT (shopmin); |
835 | MAP_OUT (shopmax); |
735 | MAP_OUT (shopmax); |
836 | if (shoprace) MAP_OUT (shoprace); |
736 | if (shoprace) MAP_OUT (shoprace); |
|
|
737 | |
837 | MAP_OUT (darkness); |
738 | MAP_OUT (darkness); |
838 | MAP_OUT (width); |
739 | MAP_OUT (width); |
839 | MAP_OUT (height); |
740 | MAP_OUT (height); |
840 | MAP_OUT (enter_x); |
741 | MAP_OUT (enter_x); |
841 | MAP_OUT (enter_y); |
742 | MAP_OUT (enter_y); |
… | |
… | |
880 | * Remove and free all objects in the given map. |
781 | * Remove and free all objects in the given map. |
881 | */ |
782 | */ |
882 | void |
783 | void |
883 | maptile::clear () |
784 | maptile::clear () |
884 | { |
785 | { |
885 | sfree (regions, size ()), regions = 0; |
|
|
886 | free (regionmap), regionmap = 0; |
|
|
887 | |
|
|
888 | if (spaces) |
786 | if (spaces) |
889 | { |
787 | { |
890 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
788 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
891 | while (object *op = ms->bot) |
789 | while (object *op = ms->bot) |
892 | { |
790 | { |
|
|
791 | // manually remove, as to not trigger anything |
|
|
792 | if (ms->bot = op->above) |
|
|
793 | ms->bot->below = 0; |
|
|
794 | |
|
|
795 | op->flag [FLAG_REMOVED] = true; |
|
|
796 | |
893 | op = op->head_ (); |
797 | object *head = op->head_ (); |
894 | op->destroy_inv (false); |
798 | if (op == head) |
895 | op->destroy (); |
799 | op->destroy (); |
|
|
800 | else if (head->map != op->map) |
|
|
801 | { |
|
|
802 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
|
|
803 | head->destroy (); |
|
|
804 | } |
896 | } |
805 | } |
897 | |
806 | |
898 | sfree (spaces, size ()), spaces = 0; |
807 | sfree0 (spaces, size ()); |
899 | } |
808 | } |
900 | |
809 | |
901 | if (buttons) |
810 | if (buttons) |
902 | free_objectlinkpt (buttons), buttons = 0; |
811 | free_objectlinkpt (buttons), buttons = 0; |
|
|
812 | |
|
|
813 | sfree0 (regions, size ()); |
|
|
814 | delete [] regionmap; regionmap = 0; |
903 | } |
815 | } |
904 | |
816 | |
905 | void |
817 | void |
906 | maptile::clear_header () |
818 | maptile::clear_header () |
907 | { |
819 | { |
… | |
… | |
959 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
871 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
960 | break; |
872 | break; |
961 | |
873 | |
962 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
874 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
963 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
875 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
964 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
|
|
965 | || QUERY_FLAG (op, FLAG_UNIQUE) |
876 | || QUERY_FLAG (op, FLAG_UNIQUE) |
966 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
877 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
967 | || QUERY_FLAG (op, FLAG_UNPAID) |
878 | || QUERY_FLAG (op, FLAG_UNPAID) |
968 | || op->is_alive ()) |
879 | || op->is_alive ()) |
969 | ; // do not decay |
880 | ; // do not decay |
… | |
… | |
1008 | op->destroy (); |
919 | op->destroy (); |
1009 | } |
920 | } |
1010 | } |
921 | } |
1011 | |
922 | |
1012 | /* |
923 | /* |
1013 | * Updates every button on the map (by calling update_button() for them). |
|
|
1014 | */ |
|
|
1015 | void |
|
|
1016 | maptile::update_buttons () |
|
|
1017 | { |
|
|
1018 | for (oblinkpt *obp = buttons; obp; obp = obp->next) |
|
|
1019 | for (objectlink *ol = obp->link; ol; ol = ol->next) |
|
|
1020 | { |
|
|
1021 | if (!ol->ob) |
|
|
1022 | { |
|
|
1023 | LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", |
|
|
1024 | ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); |
|
|
1025 | continue; |
|
|
1026 | } |
|
|
1027 | |
|
|
1028 | if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL) |
|
|
1029 | { |
|
|
1030 | update_button (ol->ob); |
|
|
1031 | break; |
|
|
1032 | } |
|
|
1033 | } |
|
|
1034 | } |
|
|
1035 | |
|
|
1036 | /* |
|
|
1037 | * This routine is supposed to find out the difficulty of the map. |
924 | * This routine is supposed to find out the difficulty of the map. |
1038 | * difficulty does not have a lot to do with character level, |
925 | * difficulty does not have a lot to do with character level, |
1039 | * but does have a lot to do with treasure on the map. |
926 | * but does have a lot to do with treasure on the map. |
1040 | * |
927 | * |
1041 | * Difficulty can now be set by the map creature. If the value stored |
928 | * Difficulty can now be set by the map creator. If the value stored |
1042 | * in the map is zero, then use this routine. Maps should really |
929 | * in the map is zero, then use this routine. Maps should really |
1043 | * have a difficulty set than using this function - human calculation |
930 | * have a difficulty set rather than using this function - human calculation |
1044 | * is much better than this functions guesswork. |
931 | * is much better than this function's guesswork. |
1045 | */ |
932 | */ |
1046 | int |
933 | int |
1047 | maptile::estimate_difficulty () const |
934 | maptile::estimate_difficulty () const |
1048 | { |
935 | { |
1049 | long monster_cnt = 0; |
936 | long monster_cnt = 0; |
… | |
… | |
1061 | |
948 | |
1062 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
949 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
1063 | { |
950 | { |
1064 | total_exp += op->stats.exp; |
951 | total_exp += op->stats.exp; |
1065 | |
952 | |
1066 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
953 | if (archetype *at = op->other_arch) |
|
|
954 | { |
1067 | total_exp += at->stats.exp * 8; |
955 | total_exp += at->stats.exp * 8; |
1068 | |
|
|
1069 | monster_cnt++; |
956 | monster_cnt++; |
|
|
957 | } |
|
|
958 | |
|
|
959 | for (object *inv = op->inv; inv; inv = inv->below) |
|
|
960 | { |
|
|
961 | total_exp += op->stats.exp * 8; |
|
|
962 | monster_cnt++; |
|
|
963 | } |
1070 | } |
964 | } |
1071 | } |
965 | } |
1072 | |
966 | |
1073 | avgexp = (double) total_exp / monster_cnt; |
967 | avgexp = (double) total_exp / monster_cnt; |
1074 | |
968 | |
… | |
… | |
1087 | * postive values make it darker, negative make it brighter |
981 | * postive values make it darker, negative make it brighter |
1088 | */ |
982 | */ |
1089 | int |
983 | int |
1090 | maptile::change_map_light (int change) |
984 | maptile::change_map_light (int change) |
1091 | { |
985 | { |
1092 | int new_level = darkness + change; |
|
|
1093 | |
|
|
1094 | /* Nothing to do */ |
986 | /* Nothing to do */ |
1095 | if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) |
987 | if (!change) |
1096 | return 0; |
988 | return 0; |
1097 | |
989 | |
1098 | /* inform all players on the map */ |
990 | /* inform all players on the map */ |
1099 | if (change > 0) |
991 | if (change > 0) |
1100 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
992 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1101 | else |
993 | else |
1102 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
994 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1103 | |
995 | |
1104 | /* Do extra checking. since darkness is a unsigned value, |
996 | darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS); |
1105 | * we need to be extra careful about negative values. |
|
|
1106 | * In general, the checks below are only needed if change |
|
|
1107 | * is not +/-1 |
|
|
1108 | */ |
|
|
1109 | if (new_level < 0) |
|
|
1110 | darkness = 0; |
|
|
1111 | else if (new_level >= MAX_DARKNESS) |
|
|
1112 | darkness = MAX_DARKNESS; |
|
|
1113 | else |
|
|
1114 | darkness = new_level; |
|
|
1115 | |
997 | |
1116 | /* All clients need to get re-updated for the change */ |
998 | /* All clients need to get re-updated for the change */ |
1117 | update_all_map_los (this); |
999 | update_all_map_los (this); |
|
|
1000 | |
1118 | return 1; |
1001 | return 1; |
1119 | } |
1002 | } |
1120 | |
1003 | |
1121 | /* |
1004 | /* |
1122 | * This function updates various attributes about a specific space |
1005 | * This function updates various attributes about a specific space |
… | |
… | |
1125 | * through, etc) |
1008 | * through, etc) |
1126 | */ |
1009 | */ |
1127 | void |
1010 | void |
1128 | mapspace::update_ () |
1011 | mapspace::update_ () |
1129 | { |
1012 | { |
1130 | object *tmp, *last = 0; |
1013 | object *last = 0; |
1131 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1014 | uint8 flags = P_UPTODATE, anywhere = 0; |
|
|
1015 | sint8 light = 0; |
1132 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1016 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1133 | |
1017 | |
1134 | //object *middle = 0; |
1018 | //object *middle = 0; |
1135 | //object *top = 0; |
1019 | //object *top = 0; |
1136 | //object *floor = 0; |
1020 | //object *floor = 0; |
1137 | // this seems to generate better code than using locals, above |
1021 | // this seems to generate better code than using locals, above |
1138 | object *&top = faces_obj[0] = 0; |
1022 | object *&top = faces_obj[0] = 0; |
1139 | object *&middle = faces_obj[1] = 0; |
1023 | object *&middle = faces_obj[1] = 0; |
1140 | object *&floor = faces_obj[2] = 0; |
1024 | object *&floor = faces_obj[2] = 0; |
1141 | |
1025 | |
1142 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1026 | for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1143 | { |
1027 | { |
1144 | /* This could be made additive I guess (two lights better than |
1028 | // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C) |
1145 | * one). But if so, it shouldn't be a simple additive - 2 |
|
|
1146 | * light bulbs do not illuminate twice as far as once since |
|
|
1147 | * it is a dissapation factor that is cubed. |
|
|
1148 | */ |
|
|
1149 | if (tmp->glow_radius > light) |
|
|
1150 | light = tmp->glow_radius; |
1029 | light += tmp->glow_radius; |
1151 | |
1030 | |
1152 | /* This call is needed in order to update objects the player |
1031 | /* This call is needed in order to update objects the player |
1153 | * is standing in that have animations (ie, grass, fire, etc). |
1032 | * is standing in that have animations (ie, grass, fire, etc). |
1154 | * However, it also causes the look window to be re-drawn |
1033 | * However, it also causes the look window to be re-drawn |
1155 | * 3 times each time the player moves, because many of the |
1034 | * 3 times each time the player moves, because many of the |
… | |
… | |
1174 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
1053 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
1175 | { |
1054 | { |
1176 | middle = tmp; |
1055 | middle = tmp; |
1177 | anywhere = 1; |
1056 | anywhere = 1; |
1178 | } |
1057 | } |
|
|
1058 | |
1179 | /* Find the highest visible face around. If equal |
1059 | /* Find the highest visible face around. If equal |
1180 | * visibilities, we still want the one nearer to the |
1060 | * visibilities, we still want the one nearer to the |
1181 | * top |
1061 | * top |
1182 | */ |
1062 | */ |
1183 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) |
1063 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) |
… | |
… | |
1202 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1082 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1203 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
1083 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
1204 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
1084 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
1205 | } |
1085 | } |
1206 | |
1086 | |
1207 | this->light = light; |
1087 | this->light = min (light, MAX_LIGHT_RADIUS); |
1208 | this->flags_ = flags; |
1088 | this->flags_ = flags; |
1209 | this->move_block = move_block & ~move_allow; |
1089 | this->move_block = move_block & ~move_allow; |
1210 | this->move_on = move_on; |
1090 | this->move_on = move_on; |
1211 | this->move_off = move_off; |
1091 | this->move_off = move_off; |
1212 | this->move_slow = move_slow; |
1092 | this->move_slow = move_slow; |
… | |
… | |
1232 | * 1) top face is set, need middle to be set. |
1112 | * 1) top face is set, need middle to be set. |
1233 | * 2) middle is set, need to set top. |
1113 | * 2) middle is set, need to set top. |
1234 | * 3) neither middle or top is set - need to set both. |
1114 | * 3) neither middle or top is set - need to set both. |
1235 | */ |
1115 | */ |
1236 | |
1116 | |
1237 | for (tmp = last; tmp; tmp = tmp->below) |
1117 | for (object *tmp = last; tmp; tmp = tmp->below) |
1238 | { |
1118 | { |
1239 | /* Once we get to a floor, stop, since we already have a floor object */ |
1119 | /* Once we get to a floor, stop, since we already have a floor object */ |
1240 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1120 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1241 | break; |
1121 | break; |
1242 | |
1122 | |
… | |
… | |
1294 | vol += op->volume (); |
1174 | vol += op->volume (); |
1295 | |
1175 | |
1296 | return vol; |
1176 | return vol; |
1297 | } |
1177 | } |
1298 | |
1178 | |
1299 | /* this updates the orig_map->tile_map[tile_num] value after finding |
1179 | maptile * |
1300 | * the map. It also takes care of linking back the freshly found |
1180 | maptile::tile_available (int dir, bool load) |
1301 | * maps tile_map values if it tiles back to this one. It returns |
|
|
1302 | * the value of orig_map->tile_map[tile_num]. |
|
|
1303 | */ |
|
|
1304 | static inline maptile * |
|
|
1305 | find_and_link (maptile *orig_map, int tile_num) |
|
|
1306 | { |
1181 | { |
1307 | maptile *mp = orig_map->tile_map [tile_num]; |
1182 | if (tile_path[dir]) |
1308 | |
|
|
1309 | if (!mp) |
|
|
1310 | { |
|
|
1311 | mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map); |
|
|
1312 | |
|
|
1313 | if (!mp) |
|
|
1314 | { |
|
|
1315 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
|
|
1316 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
|
|
1317 | &orig_map->tile_path[tile_num], &orig_map->path); |
|
|
1318 | mp = new maptile (1, 1); |
|
|
1319 | mp->alloc (); |
|
|
1320 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1321 | } |
|
|
1322 | } |
1183 | { |
|
|
1184 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
|
|
1185 | return tile_map[dir]; |
1323 | |
1186 | |
1324 | int dest_tile = (tile_num + 2) % 4; |
1187 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
|
|
1188 | return tile_map[dir]; |
|
|
1189 | } |
1325 | |
1190 | |
1326 | orig_map->tile_map [tile_num] = mp; |
|
|
1327 | |
|
|
1328 | // optimisation: back-link map to origin map if euclidean |
|
|
1329 | //TODO: non-euclidean maps MUST GO |
|
|
1330 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
|
|
1331 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
|
|
1332 | |
|
|
1333 | return mp; |
1191 | return 0; |
1334 | } |
|
|
1335 | |
|
|
1336 | static inline void |
|
|
1337 | load_and_link (maptile *orig_map, int tile_num) |
|
|
1338 | { |
|
|
1339 | find_and_link (orig_map, tile_num)->load_sync (); |
|
|
1340 | } |
1192 | } |
1341 | |
1193 | |
1342 | /* this returns TRUE if the coordinates (x,y) are out of |
1194 | /* this returns TRUE if the coordinates (x,y) are out of |
1343 | * map m. This function also takes into account any |
1195 | * map m. This function also takes into account any |
1344 | * tiling considerations, loading adjacant maps as needed. |
1196 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1357 | if (!m) |
1209 | if (!m) |
1358 | return 0; |
1210 | return 0; |
1359 | |
1211 | |
1360 | if (x < 0) |
1212 | if (x < 0) |
1361 | { |
1213 | { |
1362 | if (!m->tile_path[3]) |
1214 | if (!m->tile_available (3)) |
1363 | return 1; |
1215 | return 1; |
1364 | |
1216 | |
1365 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
|
|
1366 | find_and_link (m, 3); |
|
|
1367 | |
|
|
1368 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1217 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1369 | } |
1218 | } |
1370 | |
1219 | |
1371 | if (x >= m->width) |
1220 | if (x >= m->width) |
1372 | { |
1221 | { |
1373 | if (!m->tile_path[1]) |
1222 | if (!m->tile_available (1)) |
1374 | return 1; |
1223 | return 1; |
1375 | |
1224 | |
1376 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
|
|
1377 | find_and_link (m, 1); |
|
|
1378 | |
|
|
1379 | return out_of_map (m->tile_map[1], x - m->width, y); |
1225 | return out_of_map (m->tile_map[1], x - m->width, y); |
1380 | } |
1226 | } |
1381 | |
1227 | |
1382 | if (y < 0) |
1228 | if (y < 0) |
1383 | { |
1229 | { |
1384 | if (!m->tile_path[0]) |
1230 | if (!m->tile_available (0)) |
1385 | return 1; |
1231 | return 1; |
1386 | |
1232 | |
1387 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
|
|
1388 | find_and_link (m, 0); |
|
|
1389 | |
|
|
1390 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1233 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1391 | } |
1234 | } |
1392 | |
1235 | |
1393 | if (y >= m->height) |
1236 | if (y >= m->height) |
1394 | { |
1237 | { |
1395 | if (!m->tile_path[2]) |
1238 | if (!m->tile_available (2)) |
1396 | return 1; |
1239 | return 1; |
1397 | |
|
|
1398 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
|
|
1399 | find_and_link (m, 2); |
|
|
1400 | |
1240 | |
1401 | return out_of_map (m->tile_map[2], x, y - m->height); |
1241 | return out_of_map (m->tile_map[2], x, y - m->height); |
1402 | } |
1242 | } |
1403 | |
1243 | |
1404 | /* Simple case - coordinates are within this local |
1244 | /* Simple case - coordinates are within this local |
… | |
… | |
1418 | maptile * |
1258 | maptile * |
1419 | maptile::xy_find (sint16 &x, sint16 &y) |
1259 | maptile::xy_find (sint16 &x, sint16 &y) |
1420 | { |
1260 | { |
1421 | if (x < 0) |
1261 | if (x < 0) |
1422 | { |
1262 | { |
1423 | if (!tile_path[3]) |
1263 | if (!tile_available (3)) |
1424 | return 0; |
1264 | return 0; |
1425 | |
1265 | |
1426 | find_and_link (this, 3); |
|
|
1427 | x += tile_map[3]->width; |
1266 | x += tile_map[3]->width; |
1428 | return tile_map[3]->xy_find (x, y); |
1267 | return tile_map[3]->xy_find (x, y); |
1429 | } |
1268 | } |
1430 | |
1269 | |
1431 | if (x >= width) |
1270 | if (x >= width) |
1432 | { |
1271 | { |
1433 | if (!tile_path[1]) |
1272 | if (!tile_available (1)) |
1434 | return 0; |
1273 | return 0; |
1435 | |
1274 | |
1436 | find_and_link (this, 1); |
|
|
1437 | x -= width; |
1275 | x -= width; |
1438 | return tile_map[1]->xy_find (x, y); |
1276 | return tile_map[1]->xy_find (x, y); |
1439 | } |
1277 | } |
1440 | |
1278 | |
1441 | if (y < 0) |
1279 | if (y < 0) |
1442 | { |
1280 | { |
1443 | if (!tile_path[0]) |
1281 | if (!tile_available (0)) |
1444 | return 0; |
1282 | return 0; |
1445 | |
1283 | |
1446 | find_and_link (this, 0); |
|
|
1447 | y += tile_map[0]->height; |
1284 | y += tile_map[0]->height; |
1448 | return tile_map[0]->xy_find (x, y); |
1285 | return tile_map[0]->xy_find (x, y); |
1449 | } |
1286 | } |
1450 | |
1287 | |
1451 | if (y >= height) |
1288 | if (y >= height) |
1452 | { |
1289 | { |
1453 | if (!tile_path[2]) |
1290 | if (!tile_available (2)) |
1454 | return 0; |
1291 | return 0; |
1455 | |
1292 | |
1456 | find_and_link (this, 2); |
|
|
1457 | y -= height; |
1293 | y -= height; |
1458 | return tile_map[2]->xy_find (x, y); |
1294 | return tile_map[2]->xy_find (x, y); |
1459 | } |
1295 | } |
1460 | |
1296 | |
1461 | /* Simple case - coordinates are within this local |
1297 | /* Simple case - coordinates are within this local |
… | |
… | |
1472 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1308 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1473 | { |
1309 | { |
1474 | if (!map1 || !map2) |
1310 | if (!map1 || !map2) |
1475 | return 0; |
1311 | return 0; |
1476 | |
1312 | |
1477 | //TODO: this doesn't actually check corretcly when intermediate maps are not loaded |
1313 | //TODO: this doesn't actually check correctly when intermediate maps are not loaded |
1478 | //fix: compare paths instead (this is likely faster, too!) |
1314 | //fix: compare paths instead (this is likely faster, too!) |
1479 | if (map1 == map2) |
1315 | if (map1 == map2) |
1480 | { |
1316 | { |
1481 | *dx = 0; |
1317 | *dx = 0; |
1482 | *dy = 0; |
1318 | *dy = 0; |
… | |
… | |
1664 | else |
1500 | else |
1665 | { |
1501 | { |
1666 | retval->distance_x += op2->x - x; |
1502 | retval->distance_x += op2->x - x; |
1667 | retval->distance_y += op2->y - y; |
1503 | retval->distance_y += op2->y - y; |
1668 | |
1504 | |
1669 | retval->part = NULL; |
1505 | retval->part = 0; |
1670 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1506 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1671 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1507 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1672 | } |
1508 | } |
1673 | } |
1509 | } |
1674 | |
1510 | |
1675 | /* Returns true of op1 and op2 are effectively on the same map |
1511 | /* Returns true of op1 and op2 are effectively on the same map |
… | |
… | |
1689 | } |
1525 | } |
1690 | |
1526 | |
1691 | object * |
1527 | object * |
1692 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1528 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1693 | { |
1529 | { |
1694 | if (!op->flag [FLAG_REMOVED]) |
|
|
1695 | op->remove (); |
|
|
1696 | |
|
|
1697 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1530 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1698 | } |
1531 | } |
1699 | |
1532 | |
1700 | region * |
1533 | region * |
1701 | maptile::region (int x, int y) const |
1534 | maptile::region (int x, int y) const |
… | |
… | |
1711 | |
1544 | |
1712 | return ::region::default_region (); |
1545 | return ::region::default_region (); |
1713 | } |
1546 | } |
1714 | |
1547 | |
1715 | /* picks a random object from a style map. |
1548 | /* picks a random object from a style map. |
1716 | * Redone by MSW so it should be faster and not use static |
|
|
1717 | * variables to generate tables. |
|
|
1718 | */ |
1549 | */ |
1719 | object * |
1550 | object * |
1720 | maptile::pick_random_object () const |
1551 | maptile::pick_random_object (rand_gen &gen) const |
1721 | { |
1552 | { |
1722 | /* while returning a null object will result in a crash, that |
1553 | /* while returning a null object will result in a crash, that |
1723 | * is actually preferable to an infinite loop. That is because |
1554 | * is actually preferable to an infinite loop. That is because |
1724 | * most servers will automatically restart in case of crash. |
1555 | * most servers will automatically restart in case of crash. |
1725 | * Change the logic on getting the random space - shouldn't make |
1556 | * Change the logic on getting the random space - shouldn't make |
1726 | * any difference, but this seems clearer to me. |
1557 | * any difference, but this seems clearer to me. |
1727 | */ |
1558 | */ |
1728 | for (int i = 1000; --i;) |
1559 | for (int i = 1000; --i;) |
1729 | { |
1560 | { |
1730 | object *pick = at (rndm (width), rndm (height)).bot; |
1561 | object *pick = at (gen (width), gen (height)).bot; |
1731 | |
1562 | |
1732 | // do not prefer big monsters just because they are big. |
1563 | // do not prefer big monsters just because they are big. |
1733 | if (pick && pick->head_ () == pick) |
1564 | if (pick && pick->is_head ()) |
1734 | return pick->head_ (); |
1565 | return pick->head_ (); |
1735 | } |
1566 | } |
1736 | |
1567 | |
1737 | // instead of crashing in the unlikely(?) case, try to return *something* |
1568 | // instead of crashing in the unlikely(?) case, try to return *something* |
1738 | return get_archetype ("blocked"); |
1569 | return archetype::find ("bug"); |
1739 | } |
1570 | } |
1740 | |
1571 | |
|
|
1572 | void |
|
|
1573 | maptile::play_sound (faceidx sound, int x, int y) const |
|
|
1574 | { |
|
|
1575 | if (!sound) |
|
|
1576 | return; |
|
|
1577 | |
|
|
1578 | for_all_players_on_map (pl, this) |
|
|
1579 | if (client *ns = pl->ns) |
|
|
1580 | { |
|
|
1581 | int dx = x - pl->ob->x; |
|
|
1582 | int dy = y - pl->ob->y; |
|
|
1583 | |
|
|
1584 | int distance = idistance (dx, dy); |
|
|
1585 | |
|
|
1586 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1587 | ns->play_sound (sound, dx, dy); |
|
|
1588 | } |
|
|
1589 | } |
|
|
1590 | |
|
|
1591 | void |
|
|
1592 | maptile::say_msg (const char *msg, int x, int y) const |
|
|
1593 | { |
|
|
1594 | for_all_players (pl) |
|
|
1595 | if (client *ns = pl->ns) |
|
|
1596 | { |
|
|
1597 | int dx = x - pl->ob->x; |
|
|
1598 | int dy = y - pl->ob->y; |
|
|
1599 | |
|
|
1600 | int distance = idistance (dx, dy); |
|
|
1601 | |
|
|
1602 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1603 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
|
|
1604 | } |
|
|
1605 | } |
|
|
1606 | |
|
|
1607 | static void |
|
|
1608 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
|
|
1609 | { |
|
|
1610 | // clip to map to the left |
|
|
1611 | if (x0 < 0) |
|
|
1612 | { |
|
|
1613 | if (maptile *tile = m->tile_available (TILE_LEFT, 1)) |
|
|
1614 | split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy); |
|
|
1615 | |
|
|
1616 | if (x1 < 0) // entirely to the left |
|
|
1617 | return; |
|
|
1618 | |
|
|
1619 | x0 = 0; |
|
|
1620 | } |
|
|
1621 | |
|
|
1622 | // clip to map to the right |
|
|
1623 | if (x1 > m->width) |
|
|
1624 | { |
|
|
1625 | if (maptile *tile = m->tile_available (TILE_RIGHT, 1)) |
|
|
1626 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
|
|
1627 | |
|
|
1628 | if (x0 > m->width) // entirely to the right |
|
|
1629 | return; |
|
|
1630 | |
|
|
1631 | x1 = m->width; |
|
|
1632 | } |
|
|
1633 | |
|
|
1634 | // clip to map above |
|
|
1635 | if (y0 < 0) |
|
|
1636 | { |
|
|
1637 | if (maptile *tile = m->tile_available (TILE_UP, 1)) |
|
|
1638 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
|
|
1639 | |
|
|
1640 | if (y1 < 0) // entirely above |
|
|
1641 | return; |
|
|
1642 | |
|
|
1643 | y0 = 0; |
|
|
1644 | } |
|
|
1645 | |
|
|
1646 | // clip to map below |
|
|
1647 | if (y1 > m->height) |
|
|
1648 | { |
|
|
1649 | if (maptile *tile = m->tile_available (TILE_DOWN, 1)) |
|
|
1650 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
|
|
1651 | |
|
|
1652 | if (y0 > m->height) // entirely below |
|
|
1653 | return; |
|
|
1654 | |
|
|
1655 | y1 = m->height; |
|
|
1656 | } |
|
|
1657 | |
|
|
1658 | // if we get here, the rect is within the current map |
|
|
1659 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1660 | |
|
|
1661 | r->m = m; |
|
|
1662 | r->x0 = x0; |
|
|
1663 | r->y0 = y0; |
|
|
1664 | r->x1 = x1; |
|
|
1665 | r->y1 = y1; |
|
|
1666 | r->dx = dx; |
|
|
1667 | r->dy = dy; |
|
|
1668 | } |
|
|
1669 | |
|
|
1670 | maprect * |
|
|
1671 | maptile::split_to_tiles (int x0, int y0, int x1, int y1) |
|
|
1672 | { |
|
|
1673 | static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8); |
|
|
1674 | buf.clear (); |
|
|
1675 | |
|
|
1676 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
|
|
1677 | |
|
|
1678 | // add end marker |
|
|
1679 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1680 | r->m = 0; |
|
|
1681 | |
|
|
1682 | return (maprect *)buf.linearise (); |
|
|
1683 | } |
|
|
1684 | |