1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
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 (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | 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 |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
20 | |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
|
|
22 | */ |
22 | */ |
23 | |
23 | |
24 | #include <global.h> |
|
|
25 | #include <funcpoint.h> |
|
|
26 | |
|
|
27 | #include <loader.h> |
|
|
28 | #include <unistd.h> |
24 | #include <unistd.h> |
29 | |
25 | |
|
|
26 | #include "global.h" |
|
|
27 | #include "loader.h" |
30 | #include "path.h" |
28 | #include "path.h" |
31 | |
29 | |
32 | /* |
30 | sint8 maptile::outdoor_darkness; |
33 | * This makes a path absolute outside the world of Crossfire. |
|
|
34 | * In other words, it prepends LIBDIR/MAPDIR/ to the given path |
|
|
35 | * and returns the pointer to a static array containing the result. |
|
|
36 | * it really should be called create_mapname |
|
|
37 | */ |
|
|
38 | const char * |
|
|
39 | create_pathname (const char *name) |
|
|
40 | { |
|
|
41 | static char buf[8192]; |
|
|
42 | snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name); |
|
|
43 | return buf; |
|
|
44 | } |
|
|
45 | |
|
|
46 | /* |
|
|
47 | * This function checks if a file with the given path exists. |
|
|
48 | * -1 is returned if it fails, otherwise the mode of the file |
|
|
49 | * is returned. |
|
|
50 | * It tries out all the compression suffixes listed in the uncomp[] array. |
|
|
51 | * |
|
|
52 | * If prepend_dir is set, then we call create_pathname (which prepends |
|
|
53 | * libdir & mapdir). Otherwise, we assume the name given is fully |
|
|
54 | * complete. |
|
|
55 | * Only the editor actually cares about the writablity of this - |
|
|
56 | * the rest of the code only cares that the file is readable. |
|
|
57 | * when the editor goes away, the call to stat should probably be |
|
|
58 | * replaced by an access instead (similar to the windows one, but |
|
|
59 | * that seems to be missing the prepend_dir processing |
|
|
60 | */ |
|
|
61 | int |
|
|
62 | check_path (const char *name, int prepend_dir) |
|
|
63 | { |
|
|
64 | char buf[MAX_BUF]; |
|
|
65 | |
|
|
66 | char *endbuf; |
|
|
67 | struct stat statbuf; |
|
|
68 | int mode = 0; |
|
|
69 | |
|
|
70 | if (prepend_dir) |
|
|
71 | strcpy (buf, create_pathname (name)); |
|
|
72 | else |
|
|
73 | strcpy (buf, name); |
|
|
74 | |
|
|
75 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
|
|
76 | * this method should be equivalant and is clearer. |
|
|
77 | * Can not use strcat because we need to cycle through |
|
|
78 | * all the names. |
|
|
79 | */ |
|
|
80 | endbuf = buf + strlen (buf); |
|
|
81 | |
|
|
82 | if (stat (buf, &statbuf)) |
|
|
83 | return -1; |
|
|
84 | if (!S_ISREG (statbuf.st_mode)) |
|
|
85 | return (-1); |
|
|
86 | |
|
|
87 | if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) || |
|
|
88 | ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH)) |
|
|
89 | mode |= 4; |
|
|
90 | |
|
|
91 | if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) || |
|
|
92 | (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH)) |
|
|
93 | mode |= 2; |
|
|
94 | |
|
|
95 | return (mode); |
|
|
96 | } |
|
|
97 | |
31 | |
98 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
32 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
99 | * one function that just returns a P_.. value (see map.h) |
33 | * one function that just returns a P_.. value (see map.h) |
100 | * it will also do map translation for tiled maps, returning |
34 | * it will also do map translation for tiled maps, returning |
101 | * new values into newmap, nx, and ny. Any and all of those |
35 | * new values into newmap, nx, and ny. Any and all of those |
… | |
… | |
172 | * let the player through (inventory checkers for example) |
106 | * let the player through (inventory checkers for example) |
173 | */ |
107 | */ |
174 | if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) |
108 | if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) |
175 | return 0; |
109 | return 0; |
176 | |
110 | |
177 | if (ob->head != NULL) |
|
|
178 | ob = ob->head; |
111 | ob = ob->head_ (); |
179 | |
112 | |
180 | /* We basically go through the stack of objects, and if there is |
113 | /* 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 |
114 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
182 | * true. If we get through the entire stack, that must mean |
115 | * true. If we get through the entire stack, that must mean |
183 | * ob is blocking it, so return 0. |
116 | * ob is blocking it, so return 0. |
… | |
… | |
213 | else |
146 | else |
214 | { |
147 | { |
215 | /* Broke apart a big nasty if into several here to make |
148 | /* Broke apart a big nasty if into several here to make |
216 | * this more readable. first check - if the space blocks |
149 | * this more readable. first check - if the space blocks |
217 | * movement, can't move here. |
150 | * movement, can't move here. |
218 | * second - if a monster, can't move there, unles it is a |
151 | * second - if a monster, can't move there, unless it is a |
219 | * hidden dm |
152 | * hidden dm |
220 | */ |
153 | */ |
221 | if (OB_MOVE_BLOCK (ob, tmp)) |
154 | if (OB_MOVE_BLOCK (ob, tmp)) |
222 | return 1; |
155 | return 1; |
223 | if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && |
156 | |
224 | tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) |
157 | if (tmp->flag [FLAG_ALIVE] |
|
|
158 | && tmp->head_ () != ob |
|
|
159 | && tmp != ob |
|
|
160 | && tmp->type != DOOR |
|
|
161 | && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) |
225 | return 1; |
162 | return 1; |
226 | } |
163 | } |
227 | |
164 | |
228 | } |
165 | } |
229 | return 0; |
166 | return 0; |
230 | } |
167 | } |
231 | |
168 | |
232 | |
|
|
233 | /* |
169 | /* |
234 | * Returns true if the given object can't fit in the given spot. |
170 | * Returns qthe blocking object if the given object can't fit in the given |
235 | * This is meant for multi space objects - for single space objecs, |
171 | * spot. This is meant for multi space objects - for single space objecs, |
236 | * just calling get_map_blocked and checking that against movement type |
172 | * just calling get_map_blocked and checking that against movement type |
237 | * of object. This function goes through all the parts of the |
173 | * of object. This function goes through all the parts of the multipart |
238 | * multipart object and makes sure they can be inserted. |
174 | * object and makes sure they can be inserted. |
239 | * |
175 | * |
240 | * While this doesn't call out of map, the get_map_flags does. |
176 | * While this doesn't call out of map, the get_map_flags does. |
241 | * |
177 | * |
242 | * This function has been used to deprecate arch_out_of_map - |
178 | * This function has been used to deprecate arch_out_of_map - |
243 | * this function also does that check, and since in most cases, |
179 | * this function also does that check, and since in most cases, |
… | |
… | |
254 | * |
190 | * |
255 | * Note this used to be arch_blocked, but with new movement |
191 | * Note this used to be arch_blocked, but with new movement |
256 | * code, we need to have actual object to check its move_type |
192 | * code, we need to have actual object to check its move_type |
257 | * against the move_block values. |
193 | * against the move_block values. |
258 | */ |
194 | */ |
259 | int |
195 | bool |
260 | ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) |
196 | object::blocked (maptile *m, int x, int y) const |
261 | { |
197 | { |
262 | archetype *tmp; |
198 | for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more) |
263 | int flag; |
|
|
264 | maptile *m1; |
|
|
265 | sint16 sx, sy; |
|
|
266 | |
|
|
267 | if (!ob) |
|
|
268 | { |
|
|
269 | flag = get_map_flags (m, &m1, x, y, &sx, &sy); |
|
|
270 | if (flag & P_OUT_OF_MAP) |
|
|
271 | return P_OUT_OF_MAP; |
|
|
272 | |
|
|
273 | /* don't have object, so don't know what types would block */ |
|
|
274 | return m1->at (sx, sy).move_block; |
|
|
275 | } |
199 | { |
|
|
200 | mapxy pos (m, x + tmp->x, y + tmp->y); |
276 | |
201 | |
277 | for (tmp = ob->arch; tmp; tmp = tmp->more) |
202 | if (!pos.normalise ()) |
278 | { |
203 | return 1; |
279 | flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); |
|
|
280 | |
204 | |
281 | if (flag & P_OUT_OF_MAP) |
205 | mapspace &ms = *pos; |
282 | return P_OUT_OF_MAP; |
206 | |
283 | if (flag & P_IS_ALIVE) |
207 | if (ms.flags () & P_IS_ALIVE) |
284 | return P_IS_ALIVE; |
208 | return 1; |
285 | |
209 | |
286 | mapspace &ms = m1->at (sx, sy); |
210 | /* However, often ob doesn't have any move type |
287 | |
211 | * (signifying non-moving objects) |
288 | /* find_first_free_spot() calls this function. However, often |
|
|
289 | * ob doesn't have any move type (when used to place exits) |
|
|
290 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
212 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
291 | */ |
213 | */ |
292 | |
|
|
293 | if (ob->move_type == 0 && ms.move_block != MOVE_ALL) |
214 | if (!move_type && ms.move_block != MOVE_ALL) |
294 | continue; |
215 | continue; |
295 | |
216 | |
296 | /* Note it is intentional that we check ob - the movement type of the |
217 | /* Note it is intentional that we check ob - the movement type of the |
297 | * head of the object should correspond for the entire object. |
218 | * head of the object should correspond for the entire object. |
298 | */ |
219 | */ |
299 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
220 | if (ms.blocks (move_type)) |
300 | return P_NO_PASS; |
221 | return 1; |
301 | } |
222 | } |
302 | |
223 | |
303 | return 0; |
224 | return 0; |
304 | } |
225 | } |
305 | |
226 | |
… | |
… | |
323 | |
244 | |
324 | insert_ob_in_ob (tmp, container); |
245 | insert_ob_in_ob (tmp, container); |
325 | tmp = next; |
246 | tmp = next; |
326 | } |
247 | } |
327 | |
248 | |
328 | /* sum_weight will go through and calculate what all the containers are |
249 | // go through and calculate what all the containers are carrying. |
329 | * carrying. |
250 | //TODO: remove |
330 | */ |
251 | container->update_weight (); |
331 | sum_weight (container); |
|
|
332 | } |
252 | } |
333 | |
253 | |
334 | void |
254 | void |
335 | maptile::set_object_flag (int flag, int value) |
255 | maptile::set_object_flag (int flag, int value) |
336 | { |
256 | { |
… | |
… | |
340 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
260 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
341 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
261 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
342 | tmp->flag [flag] = value; |
262 | tmp->flag [flag] = value; |
343 | } |
263 | } |
344 | |
264 | |
|
|
265 | void |
|
|
266 | maptile::post_load_original () |
|
|
267 | { |
|
|
268 | if (!spaces) |
|
|
269 | return; |
|
|
270 | |
|
|
271 | set_object_flag (FLAG_OBJ_ORIGINAL); |
|
|
272 | |
|
|
273 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
274 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
|
|
275 | INVOKE_OBJECT (RESET, tmp); |
|
|
276 | } |
|
|
277 | |
345 | /* link_multipart_objects go through all the objects on the map looking |
278 | /* link_multipart_objects go through all the objects on the map looking |
346 | * for objects whose arch says they are multipart yet according to the |
279 | * for objects whose arch says they are multipart yet according to the |
347 | * info we have, they only have the head (as would be expected when |
280 | * info we have, they only have the head (as would be expected when |
348 | * they are saved). We do have to look for the old maps that did save |
281 | * they are saved). |
349 | * the more sections and not re-add sections for them. |
|
|
350 | */ |
282 | */ |
351 | void |
283 | void |
352 | maptile::link_multipart_objects () |
284 | maptile::link_multipart_objects () |
353 | { |
285 | { |
354 | if (!spaces) |
286 | if (!spaces) |
355 | return; |
287 | return; |
356 | |
288 | |
357 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
289 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
358 | for (object *tmp = ms->bot; tmp; ) |
290 | { |
|
|
291 | object *op = ms->bot; |
|
|
292 | while (op) |
359 | { |
293 | { |
360 | object *above = tmp->above; |
|
|
361 | |
|
|
362 | /* already multipart - don't do anything more */ |
294 | /* already multipart - don't do anything more */ |
363 | if (!tmp->head && !tmp->more) |
295 | if (op->head_ () == op && !op->more && op->arch->more) |
364 | { |
|
|
365 | /* If there is nothing more to this object, this for loop |
|
|
366 | * won't do anything. |
|
|
367 | */ |
|
|
368 | archetype *at; |
|
|
369 | object *last, *op; |
|
|
370 | for (at = tmp->arch->more, last = tmp; |
|
|
371 | at; |
|
|
372 | at = at->more, last = op) |
|
|
373 | { |
296 | { |
374 | op = arch_to_object (at); |
297 | op->remove (); |
|
|
298 | op->expand_tail (); |
375 | |
299 | |
376 | /* update x,y coordinates */ |
300 | // FIXME: INS_ON_TOP is just a workaround for the pentagram vs. |
377 | op->x += tmp->x; |
301 | // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters |
378 | op->y += tmp->y; |
302 | // below the pentagrams... hopefully INS_ON_TOP doesn't break anything |
379 | op->head = tmp; |
|
|
380 | op->map = this; |
|
|
381 | last->more = op; |
|
|
382 | op->name = tmp->name; |
|
|
383 | op->title = tmp->title; |
|
|
384 | |
|
|
385 | /* we could link all the parts onto tmp, and then just |
|
|
386 | * call insert_ob_in_map once, but the effect is the same, |
|
|
387 | * as insert_ob_in_map will call itself with each part, and |
|
|
388 | * the coding is simpler to just to it here with each part. |
|
|
389 | */ |
|
|
390 | insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); |
303 | insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON); |
|
|
304 | |
|
|
305 | op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP |
|
|
306 | // so we have to reset the iteration through the mapspace |
391 | } |
307 | } |
|
|
308 | else |
|
|
309 | op = op->above; |
392 | } |
310 | } |
393 | |
|
|
394 | tmp = above; |
|
|
395 | } |
311 | } |
396 | } |
312 | } |
397 | |
313 | |
398 | /* |
314 | /* |
399 | * Loads (ands parses) the objects into a given map from the specified |
315 | * Loads (ands parses) the objects into a given map from the specified |
400 | * file pointer. |
316 | * file pointer. |
401 | * mapflags is the same as we get with load_original_map |
|
|
402 | */ |
317 | */ |
403 | bool |
318 | bool |
404 | maptile::load_objects (object_thawer &thawer) |
319 | maptile::_load_objects (object_thawer &f) |
405 | { |
320 | { |
406 | int unique; |
321 | for (;;) |
407 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
|
|
408 | |
|
|
409 | op = object::create (); |
|
|
410 | op->map = this; /* To handle buttons correctly */ |
|
|
411 | |
|
|
412 | while (int i = load_object (thawer, op, 0)) |
|
|
413 | { |
322 | { |
414 | /* if the archetype for the object is null, means that we |
323 | coroapi::cede_to_tick (); // cede once in a while |
415 | * got an invalid object. Don't do anything with it - the game |
324 | |
416 | * or editor will not be able to do anything with it either. |
325 | switch (f.kw) |
417 | */ |
|
|
418 | if (op->arch == NULL) |
|
|
419 | { |
326 | { |
420 | LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); |
327 | case KW_arch: |
|
|
328 | if (object *op = object::read (f, this)) |
|
|
329 | { |
|
|
330 | // TODO: why? |
|
|
331 | if (op->inv) |
|
|
332 | op->update_weight (); |
|
|
333 | |
|
|
334 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
|
|
335 | { |
|
|
336 | // we insert manually because |
|
|
337 | // a) its way faster |
|
|
338 | // b) we remove manually, too, and there are good reasons for that |
|
|
339 | // c) its correct |
|
|
340 | mapspace &ms = at (op->x, op->y); |
|
|
341 | |
|
|
342 | op->flag [FLAG_REMOVED] = false; |
|
|
343 | |
|
|
344 | op->above = 0; |
|
|
345 | op->below = ms.top; |
|
|
346 | |
|
|
347 | if (ms.top) |
|
|
348 | ms.top->above = op; |
|
|
349 | else |
|
|
350 | ms.bot = op; |
|
|
351 | |
|
|
352 | ms.top = op; |
|
|
353 | ms.flags_ = 0; |
|
|
354 | } |
|
|
355 | else |
|
|
356 | { |
|
|
357 | f.parse_warn (format ("object %s out of range", op->debug_desc ())); |
|
|
358 | op->destroy (); |
|
|
359 | } |
|
|
360 | } |
|
|
361 | |
421 | continue; |
362 | continue; |
422 | } |
|
|
423 | |
363 | |
424 | switch (i) |
|
|
425 | { |
|
|
426 | case LL_NORMAL: |
|
|
427 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
|
|
428 | |
|
|
429 | if (op->inv) |
|
|
430 | sum_weight (op); |
|
|
431 | |
|
|
432 | prev = op, last_more = op; |
|
|
433 | break; |
|
|
434 | |
|
|
435 | case LL_MORE: |
364 | case KW_EOF: |
436 | insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); |
365 | return true; |
437 | op->head = prev, last_more->more = op, last_more = op; |
366 | |
|
|
367 | default: |
|
|
368 | if (!f.parse_error ("map file")) |
|
|
369 | return false; |
438 | break; |
370 | break; |
439 | } |
371 | } |
440 | |
372 | |
441 | op = object::create (); |
373 | f.next (); |
442 | op->map = this; |
|
|
443 | } |
|
|
444 | |
|
|
445 | op->destroy (); |
|
|
446 | |
|
|
447 | #if 0 |
|
|
448 | for (i = 0; i < width; i++) |
|
|
449 | for (j = 0; j < height; j++) |
|
|
450 | { |
|
|
451 | unique = 0; |
|
|
452 | /* check for unique items, or unique squares */ |
|
|
453 | for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above) |
|
|
454 | { |
|
|
455 | if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) |
|
|
456 | unique = 1; |
|
|
457 | |
|
|
458 | if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) |
|
|
459 | SET_FLAG (otmp, FLAG_OBJ_ORIGINAL); |
|
|
460 | } |
|
|
461 | } |
374 | } |
462 | #endif |
|
|
463 | |
375 | |
464 | return true; |
376 | return true; |
465 | } |
377 | } |
466 | |
378 | |
467 | void |
379 | void |
468 | maptile::activate () |
380 | maptile::activate () |
469 | { |
381 | { |
470 | if (!spaces) |
382 | if (spaces) |
471 | return; |
|
|
472 | |
|
|
473 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
383 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
474 | for (object *op = ms->bot; op; op = op->above) |
384 | for (object *op = ms->bot; op; op = op->above) |
475 | op->activate_recursive (); |
385 | op->activate_recursive (); |
476 | } |
386 | } |
477 | |
387 | |
478 | void |
388 | void |
479 | maptile::deactivate () |
389 | maptile::deactivate () |
480 | { |
390 | { |
481 | if (!spaces) |
391 | if (spaces) |
482 | return; |
|
|
483 | |
|
|
484 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
392 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
485 | for (object *op = ms->bot; op; op = op->above) |
393 | for (object *op = ms->bot; op; op = op->above) |
486 | op->deactivate_recursive (); |
394 | op->deactivate_recursive (); |
487 | } |
395 | } |
488 | |
396 | |
489 | bool |
397 | bool |
490 | maptile::save_objects (object_freezer &freezer, int flags) |
398 | maptile::_save_objects (object_freezer &f, int flags) |
491 | { |
399 | { |
492 | static int cede_count = 0; |
400 | coroapi::cede_to_tick (); |
493 | |
401 | |
494 | if (flags & IO_HEADER) |
402 | if (flags & IO_HEADER) |
495 | save_header (freezer); |
403 | _save_header (f); |
496 | |
404 | |
497 | if (!spaces) |
405 | if (!spaces) |
498 | return false; |
406 | return false; |
499 | |
407 | |
500 | for (int i = 0; i < size (); ++i) |
408 | for (int i = 0; i < size (); ++i) |
501 | { |
409 | { |
502 | if (cede_count >= 500) |
|
|
503 | { |
|
|
504 | cede_count = 0; |
|
|
505 | coroapi::cede (); |
|
|
506 | } |
|
|
507 | |
|
|
508 | int unique = 0; |
410 | bool unique = 0; |
|
|
411 | |
509 | for (object *op = spaces [i].bot; op; op = op->above) |
412 | for (object *op = spaces [i].bot; op; op = op->above) |
510 | { |
413 | { |
511 | // count per-object, but cede only when modification-safe |
|
|
512 | cede_count++; |
|
|
513 | |
|
|
514 | if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) |
414 | unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]; |
515 | unique = 1; |
|
|
516 | |
415 | |
517 | if (!op->can_map_save ()) |
416 | if (expect_false (!op->can_map_save ())) |
518 | continue; |
417 | continue; |
519 | |
418 | |
520 | if (unique || op->flag [FLAG_UNIQUE]) |
419 | if (expect_false (unique || op->flag [FLAG_UNIQUE])) |
521 | { |
420 | { |
522 | if (flags & IO_UNIQUES) |
421 | if (flags & IO_UNIQUES) |
523 | save_object (freezer, op, 1); |
422 | op->write (f); |
524 | } |
423 | } |
525 | else if (flags & IO_OBJECTS) |
424 | else if (expect_true (flags & IO_OBJECTS)) |
526 | save_object (freezer, op, 1); |
425 | op->write (f); |
527 | } |
426 | } |
528 | } |
427 | } |
529 | |
428 | |
|
|
429 | coroapi::cede_to_tick (); |
|
|
430 | |
530 | return true; |
431 | return true; |
531 | } |
432 | } |
532 | |
433 | |
533 | bool |
434 | bool |
534 | maptile::load_objects (const char *path, bool skip_header) |
435 | maptile::_save_objects (const char *path, int flags) |
535 | { |
436 | { |
536 | object_thawer thawer (path); |
437 | object_freezer freezer; |
537 | |
438 | |
538 | if (!thawer) |
439 | if (!_save_objects (freezer, flags)) |
539 | return false; |
440 | return false; |
540 | |
441 | |
541 | if (skip_header) |
|
|
542 | for (;;) |
|
|
543 | { |
|
|
544 | keyword kw = thawer.get_kv (); |
|
|
545 | |
|
|
546 | if (kw == KW_end) |
|
|
547 | break; |
|
|
548 | |
|
|
549 | thawer.skip_kv (kw); |
|
|
550 | } |
|
|
551 | |
|
|
552 | return load_objects (thawer); |
|
|
553 | } |
|
|
554 | |
|
|
555 | bool |
|
|
556 | maptile::save_objects (const char *path, int flags) |
|
|
557 | { |
|
|
558 | object_freezer freezer; |
|
|
559 | |
|
|
560 | if (!save_objects (freezer, flags)) |
|
|
561 | return false; |
|
|
562 | |
|
|
563 | return freezer.save (path); |
442 | return freezer.save (path); |
564 | } |
443 | } |
565 | |
444 | |
566 | maptile::maptile () |
445 | maptile::maptile () |
567 | { |
446 | { |
568 | in_memory = MAP_SWAPPED; |
447 | in_memory = MAP_SWAPPED; |
569 | |
448 | |
570 | /* The maps used to pick up default x and y values from the |
449 | /* The maps used to pick up default x and y values from the |
571 | * map archetype. Mimic that behaviour. |
450 | * map archetype. Mimic that behaviour. |
572 | */ |
451 | */ |
573 | width = 16; |
452 | width = 16; |
574 | height = 16; |
453 | height = 16; |
575 | reset_timeout = 0; |
|
|
576 | timeout = 300; |
454 | timeout = 300; |
577 | enter_x = 0; |
455 | max_nrof = 1000; // 1000 items of anything |
578 | enter_y = 0; |
456 | max_volume = 2000000; // 2m³ |
579 | } |
457 | } |
580 | |
458 | |
581 | maptile::maptile (int w, int h) |
459 | maptile::maptile (int w, int h) |
582 | { |
460 | { |
583 | in_memory = MAP_SWAPPED; |
461 | in_memory = MAP_SWAPPED; |
… | |
… | |
729 | * This could be done in lex (like the object loader), but I think |
607 | * This could be done in lex (like the object loader), but I think |
730 | * currently, there are few enough fields this is not a big deal. |
608 | * currently, there are few enough fields this is not a big deal. |
731 | * MSW 2001-07-01 |
609 | * MSW 2001-07-01 |
732 | */ |
610 | */ |
733 | bool |
611 | bool |
734 | maptile::load_header (object_thawer &thawer) |
612 | maptile::_load_header (object_thawer &thawer) |
735 | { |
613 | { |
736 | char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end; |
|
|
737 | int msgpos = 0; |
|
|
738 | int maplorepos = 0; |
|
|
739 | |
|
|
740 | for (;;) |
614 | for (;;) |
741 | { |
615 | { |
742 | keyword kw = thawer.get_kv (); |
|
|
743 | |
|
|
744 | switch (kw) |
616 | switch (thawer.kw) |
745 | { |
617 | { |
746 | case KW_EOF: |
|
|
747 | LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path); |
|
|
748 | return false; |
|
|
749 | |
|
|
750 | case KW_end: |
|
|
751 | return true; |
|
|
752 | |
|
|
753 | case KW_msg: |
618 | case KW_msg: |
754 | thawer.get_ml (KW_endmsg, msg); |
619 | thawer.get_ml (KW_endmsg, msg); |
755 | break; |
620 | break; |
756 | |
621 | |
757 | case KW_lore: // CF+ extension |
622 | case KW_lore: // CF+ extension |
… | |
… | |
788 | case KW_winddir: thawer.get (winddir); break; |
653 | case KW_winddir: thawer.get (winddir); break; |
789 | case KW_sky: thawer.get (sky); break; |
654 | case KW_sky: thawer.get (sky); break; |
790 | |
655 | |
791 | case KW_per_player: thawer.get (per_player); break; |
656 | case KW_per_player: thawer.get (per_player); break; |
792 | case KW_per_party: thawer.get (per_party); break; |
657 | case KW_per_party: thawer.get (per_party); break; |
|
|
658 | case KW_no_reset: thawer.get (no_reset); break; |
|
|
659 | case KW_no_drop: thawer.get (no_drop); break; |
793 | |
660 | |
794 | case KW_region: get_region_by_name (thawer.get_str ()); break; |
661 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
795 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
662 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
796 | |
663 | |
797 | // old names new names |
664 | // old names new names |
798 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
665 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
799 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
666 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
… | |
… | |
808 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
675 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
809 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
676 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
810 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
677 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
811 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
678 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
812 | |
679 | |
|
|
680 | case KW_ERROR: |
|
|
681 | set_key_text (thawer.kw_str, thawer.value); |
|
|
682 | break; |
|
|
683 | |
|
|
684 | case KW_end: |
|
|
685 | thawer.next (); |
|
|
686 | return true; |
|
|
687 | |
813 | default: |
688 | default: |
814 | LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]); |
689 | if (!thawer.parse_error ("map", 0)) |
|
|
690 | return false; |
815 | break; |
691 | break; |
816 | } |
692 | } |
|
|
693 | |
|
|
694 | thawer.next (); |
817 | } |
695 | } |
818 | |
696 | |
819 | abort (); |
697 | abort (); |
820 | } |
|
|
821 | |
|
|
822 | bool |
|
|
823 | maptile::load_header (const char *path) |
|
|
824 | { |
|
|
825 | object_thawer thawer (path); |
|
|
826 | |
|
|
827 | if (!thawer) |
|
|
828 | return false; |
|
|
829 | |
|
|
830 | return load_header (thawer); |
|
|
831 | } |
698 | } |
832 | |
699 | |
833 | /****************************************************************************** |
700 | /****************************************************************************** |
834 | * This is the start of unique map handling code |
701 | * This is the start of unique map handling code |
835 | *****************************************************************************/ |
702 | *****************************************************************************/ |
… | |
… | |
846 | object *above = op->above; |
713 | object *above = op->above; |
847 | |
714 | |
848 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
715 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
849 | unique = 1; |
716 | unique = 1; |
850 | |
717 | |
851 | if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
718 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
852 | { |
|
|
853 | op->destroy_inv (false); |
|
|
854 | op->destroy (); |
719 | op->destroy (); |
855 | } |
|
|
856 | |
720 | |
857 | op = above; |
721 | op = above; |
858 | } |
722 | } |
859 | } |
723 | } |
860 | } |
724 | } |
861 | |
725 | |
862 | bool |
726 | bool |
863 | maptile::save_header (object_freezer &freezer) |
727 | maptile::_save_header (object_freezer &freezer) |
864 | { |
728 | { |
865 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
729 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
866 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
730 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
867 | |
731 | |
868 | MAP_OUT2 (arch, "map"); |
732 | MAP_OUT2 (arch, "map"); |
… | |
… | |
870 | if (name) MAP_OUT (name); |
734 | if (name) MAP_OUT (name); |
871 | MAP_OUT (swap_time); |
735 | MAP_OUT (swap_time); |
872 | MAP_OUT (reset_time); |
736 | MAP_OUT (reset_time); |
873 | MAP_OUT (reset_timeout); |
737 | MAP_OUT (reset_timeout); |
874 | MAP_OUT (fixed_resettime); |
738 | MAP_OUT (fixed_resettime); |
|
|
739 | MAP_OUT (no_reset); |
|
|
740 | MAP_OUT (no_drop); |
875 | MAP_OUT (difficulty); |
741 | MAP_OUT (difficulty); |
876 | |
742 | |
877 | if (region) MAP_OUT2 (region, region->name); |
743 | if (default_region) MAP_OUT2 (region, default_region->name); |
878 | |
744 | |
879 | if (shopitems) |
745 | if (shopitems) |
880 | { |
746 | { |
881 | char shop[MAX_BUF]; |
747 | char shop[MAX_BUF]; |
882 | print_shop_string (this, shop); |
748 | print_shop_string (this, shop); |
… | |
… | |
917 | |
783 | |
918 | return true; |
784 | return true; |
919 | } |
785 | } |
920 | |
786 | |
921 | bool |
787 | bool |
922 | maptile::save_header (const char *path) |
788 | maptile::_save_header (const char *path) |
923 | { |
789 | { |
924 | object_freezer freezer; |
790 | object_freezer freezer; |
925 | |
791 | |
926 | if (!save_header (freezer)) |
792 | if (!_save_header (freezer)) |
927 | return false; |
793 | return false; |
928 | |
794 | |
929 | return freezer.save (path); |
795 | return freezer.save (path); |
930 | } |
796 | } |
931 | |
797 | |
… | |
… | |
933 | * Remove and free all objects in the given map. |
799 | * Remove and free all objects in the given map. |
934 | */ |
800 | */ |
935 | void |
801 | void |
936 | maptile::clear () |
802 | maptile::clear () |
937 | { |
803 | { |
938 | if (!spaces) |
804 | if (spaces) |
939 | return; |
805 | { |
940 | |
|
|
941 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
806 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
942 | while (object *op = ms->bot) |
807 | while (object *op = ms->bot) |
943 | { |
808 | { |
|
|
809 | // manually remove, as to not trigger anything |
|
|
810 | if (ms->bot = op->above) |
|
|
811 | ms->bot->below = 0; |
|
|
812 | |
|
|
813 | op->flag [FLAG_REMOVED] = true; |
|
|
814 | |
|
|
815 | object *head = op->head_ (); |
944 | if (op->head) |
816 | if (op == head) |
945 | op = op->head; |
|
|
946 | |
|
|
947 | op->destroy_inv (false); |
|
|
948 | op->destroy (); |
817 | op->destroy (); |
|
|
818 | else if (head->map != op->map) |
|
|
819 | { |
|
|
820 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
|
|
821 | head->destroy (); |
|
|
822 | } |
|
|
823 | } |
|
|
824 | |
|
|
825 | sfree0 (spaces, size ()); |
949 | } |
826 | } |
950 | |
|
|
951 | sfree (spaces, size ()), spaces = 0; |
|
|
952 | |
827 | |
953 | if (buttons) |
828 | if (buttons) |
954 | free_objectlinkpt (buttons), buttons = 0; |
829 | free_objectlinkpt (buttons), buttons = 0; |
|
|
830 | |
|
|
831 | sfree0 (regions, size ()); |
|
|
832 | delete [] regionmap; regionmap = 0; |
955 | } |
833 | } |
956 | |
834 | |
957 | void |
835 | void |
958 | maptile::clear_header () |
836 | maptile::clear_header () |
959 | { |
837 | { |
… | |
… | |
989 | maptile::do_destroy () |
867 | maptile::do_destroy () |
990 | { |
868 | { |
991 | attachable::do_destroy (); |
869 | attachable::do_destroy (); |
992 | |
870 | |
993 | clear (); |
871 | clear (); |
|
|
872 | } |
|
|
873 | |
|
|
874 | /* decay and destroy perishable items in a map */ |
|
|
875 | void |
|
|
876 | maptile::do_decay_objects () |
|
|
877 | { |
|
|
878 | if (!spaces) |
|
|
879 | return; |
|
|
880 | |
|
|
881 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
882 | for (object *above, *op = ms->bot; op; op = above) |
|
|
883 | { |
|
|
884 | above = op->above; |
|
|
885 | |
|
|
886 | bool destroy = 0; |
|
|
887 | |
|
|
888 | // do not decay anything above unique floor tiles (yet :) |
|
|
889 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
|
|
890 | break; |
|
|
891 | |
|
|
892 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
|
|
893 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
|
|
894 | || QUERY_FLAG (op, FLAG_UNIQUE) |
|
|
895 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
|
|
896 | || QUERY_FLAG (op, FLAG_UNPAID) |
|
|
897 | || op->is_alive ()) |
|
|
898 | ; // do not decay |
|
|
899 | else if (op->is_weapon ()) |
|
|
900 | { |
|
|
901 | op->stats.dam--; |
|
|
902 | if (op->stats.dam < 0) |
|
|
903 | destroy = 1; |
|
|
904 | } |
|
|
905 | else if (op->is_armor ()) |
|
|
906 | { |
|
|
907 | op->stats.ac--; |
|
|
908 | if (op->stats.ac < 0) |
|
|
909 | destroy = 1; |
|
|
910 | } |
|
|
911 | else if (op->type == FOOD) |
|
|
912 | { |
|
|
913 | op->stats.food -= rndm (5, 20); |
|
|
914 | if (op->stats.food < 0) |
|
|
915 | destroy = 1; |
|
|
916 | } |
|
|
917 | else |
|
|
918 | { |
|
|
919 | int mat = op->materials; |
|
|
920 | |
|
|
921 | if (mat & M_PAPER |
|
|
922 | || mat & M_LEATHER |
|
|
923 | || mat & M_WOOD |
|
|
924 | || mat & M_ORGANIC |
|
|
925 | || mat & M_CLOTH |
|
|
926 | || mat & M_LIQUID |
|
|
927 | || (mat & M_IRON && rndm (1, 5) == 1) |
|
|
928 | || (mat & M_GLASS && rndm (1, 2) == 1) |
|
|
929 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
930 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
|
|
931 | || (mat & M_ICE && temp > 32)) |
|
|
932 | destroy = 1; |
|
|
933 | } |
|
|
934 | |
|
|
935 | /* adjust overall chance below */ |
|
|
936 | if (destroy && rndm (0, 1)) |
|
|
937 | op->destroy (); |
|
|
938 | } |
994 | } |
939 | } |
995 | |
940 | |
996 | /* |
941 | /* |
997 | * Updates every button on the map (by calling update_button() for them). |
942 | * Updates every button on the map (by calling update_button() for them). |
998 | */ |
943 | */ |
… | |
… | |
1020 | /* |
965 | /* |
1021 | * This routine is supposed to find out the difficulty of the map. |
966 | * This routine is supposed to find out the difficulty of the map. |
1022 | * difficulty does not have a lot to do with character level, |
967 | * difficulty does not have a lot to do with character level, |
1023 | * but does have a lot to do with treasure on the map. |
968 | * but does have a lot to do with treasure on the map. |
1024 | * |
969 | * |
1025 | * Difficulty can now be set by the map creature. If the value stored |
970 | * Difficulty can now be set by the map creator. If the value stored |
1026 | * in the map is zero, then use this routine. Maps should really |
971 | * in the map is zero, then use this routine. Maps should really |
1027 | * have a difficulty set than using this function - human calculation |
972 | * have a difficulty set rather than using this function - human calculation |
1028 | * is much better than this functions guesswork. |
973 | * is much better than this function's guesswork. |
1029 | */ |
974 | */ |
1030 | int |
975 | int |
1031 | maptile::estimate_difficulty () const |
976 | maptile::estimate_difficulty () const |
1032 | { |
977 | { |
1033 | long monster_cnt = 0; |
978 | long monster_cnt = 0; |
… | |
… | |
1045 | |
990 | |
1046 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
991 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
1047 | { |
992 | { |
1048 | total_exp += op->stats.exp; |
993 | total_exp += op->stats.exp; |
1049 | |
994 | |
1050 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
995 | if (archetype *at = op->other_arch) |
|
|
996 | { |
1051 | total_exp += at->clone.stats.exp * 8; |
997 | total_exp += at->stats.exp * 8; |
1052 | |
|
|
1053 | monster_cnt++; |
998 | monster_cnt++; |
|
|
999 | } |
|
|
1000 | |
|
|
1001 | for (object *inv = op->inv; inv; inv = inv->below) |
|
|
1002 | { |
|
|
1003 | total_exp += op->stats.exp * 8; |
|
|
1004 | monster_cnt++; |
|
|
1005 | } |
1054 | } |
1006 | } |
1055 | } |
1007 | } |
1056 | |
1008 | |
1057 | avgexp = (double) total_exp / monster_cnt; |
1009 | avgexp = (double) total_exp / monster_cnt; |
1058 | |
1010 | |
… | |
… | |
1071 | * postive values make it darker, negative make it brighter |
1023 | * postive values make it darker, negative make it brighter |
1072 | */ |
1024 | */ |
1073 | int |
1025 | int |
1074 | maptile::change_map_light (int change) |
1026 | maptile::change_map_light (int change) |
1075 | { |
1027 | { |
1076 | int new_level = darkness + change; |
|
|
1077 | |
|
|
1078 | /* Nothing to do */ |
1028 | /* Nothing to do */ |
1079 | if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) |
1029 | if (!change) |
1080 | return 0; |
1030 | return 0; |
1081 | |
1031 | |
1082 | /* inform all players on the map */ |
1032 | /* inform all players on the map */ |
1083 | if (change > 0) |
1033 | if (change > 0) |
1084 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1034 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1085 | else |
1035 | else |
1086 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1036 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1087 | |
1037 | |
1088 | /* Do extra checking. since darkness is a unsigned value, |
1038 | darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS); |
1089 | * we need to be extra careful about negative values. |
|
|
1090 | * In general, the checks below are only needed if change |
|
|
1091 | * is not +/-1 |
|
|
1092 | */ |
|
|
1093 | if (new_level < 0) |
|
|
1094 | darkness = 0; |
|
|
1095 | else if (new_level >= MAX_DARKNESS) |
|
|
1096 | darkness = MAX_DARKNESS; |
|
|
1097 | else |
|
|
1098 | darkness = new_level; |
|
|
1099 | |
1039 | |
1100 | /* All clients need to get re-updated for the change */ |
1040 | /* All clients need to get re-updated for the change */ |
1101 | update_all_map_los (this); |
1041 | update_all_map_los (this); |
|
|
1042 | |
1102 | return 1; |
1043 | return 1; |
1103 | } |
1044 | } |
1104 | |
1045 | |
1105 | /* |
1046 | /* |
1106 | * This function updates various attributes about a specific space |
1047 | * This function updates various attributes about a specific space |
… | |
… | |
1109 | * through, etc) |
1050 | * through, etc) |
1110 | */ |
1051 | */ |
1111 | void |
1052 | void |
1112 | mapspace::update_ () |
1053 | mapspace::update_ () |
1113 | { |
1054 | { |
1114 | object *tmp, *last = 0; |
1055 | object *last = 0; |
1115 | uint8 flags = 0, light = 0, anywhere = 0; |
1056 | uint8 flags = P_UPTODATE, anywhere = 0; |
1116 | New_Face *top, *floor, *middle; |
1057 | sint8 light = 0; |
1117 | object *top_obj, *floor_obj, *middle_obj; |
|
|
1118 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1058 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1119 | |
1059 | |
1120 | middle = blank_face; |
1060 | //object *middle = 0; |
1121 | top = blank_face; |
1061 | //object *top = 0; |
1122 | floor = blank_face; |
1062 | //object *floor = 0; |
|
|
1063 | // this seems to generate better code than using locals, above |
|
|
1064 | object *&top = faces_obj[0] = 0; |
|
|
1065 | object *&middle = faces_obj[1] = 0; |
|
|
1066 | object *&floor = faces_obj[2] = 0; |
1123 | |
1067 | |
1124 | middle_obj = 0; |
|
|
1125 | top_obj = 0; |
|
|
1126 | floor_obj = 0; |
|
|
1127 | |
|
|
1128 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1068 | for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1129 | { |
1069 | { |
1130 | /* This could be made additive I guess (two lights better than |
1070 | // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C) |
1131 | * one). But if so, it shouldn't be a simple additive - 2 |
|
|
1132 | * light bulbs do not illuminate twice as far as once since |
|
|
1133 | * it is a dissapation factor that is cubed. |
|
|
1134 | */ |
|
|
1135 | if (tmp->glow_radius > light) |
|
|
1136 | light = tmp->glow_radius; |
1071 | light += tmp->glow_radius; |
1137 | |
1072 | |
1138 | /* This call is needed in order to update objects the player |
1073 | /* This call is needed in order to update objects the player |
1139 | * is standing in that have animations (ie, grass, fire, etc). |
1074 | * is standing in that have animations (ie, grass, fire, etc). |
1140 | * However, it also causes the look window to be re-drawn |
1075 | * However, it also causes the look window to be re-drawn |
1141 | * 3 times each time the player moves, because many of the |
1076 | * 3 times each time the player moves, because many of the |
… | |
… | |
1144 | * Always put the player down for drawing. |
1079 | * Always put the player down for drawing. |
1145 | */ |
1080 | */ |
1146 | if (!tmp->invisible) |
1081 | if (!tmp->invisible) |
1147 | { |
1082 | { |
1148 | if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) |
1083 | if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) |
1149 | { |
|
|
1150 | top = tmp->face; |
|
|
1151 | top_obj = tmp; |
1084 | top = tmp; |
1152 | } |
|
|
1153 | else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1085 | else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1154 | { |
1086 | { |
1155 | /* If we got a floor, that means middle and top were below it, |
1087 | /* If we got a floor, that means middle and top were below it, |
1156 | * so should not be visible, so we clear them. |
1088 | * so should not be visible, so we clear them. |
1157 | */ |
1089 | */ |
1158 | middle = blank_face; |
1090 | middle = 0; |
1159 | top = blank_face; |
1091 | top = 0; |
1160 | floor = tmp->face; |
|
|
1161 | floor_obj = tmp; |
1092 | floor = tmp; |
1162 | } |
1093 | } |
1163 | /* Flag anywhere have high priority */ |
1094 | /* Flag anywhere have high priority */ |
1164 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
1095 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
1165 | { |
1096 | { |
1166 | middle = tmp->face; |
|
|
1167 | |
|
|
1168 | middle_obj = tmp; |
1097 | middle = tmp; |
1169 | anywhere = 1; |
1098 | anywhere = 1; |
1170 | } |
1099 | } |
|
|
1100 | |
1171 | /* Find the highest visible face around. If equal |
1101 | /* Find the highest visible face around. If equal |
1172 | * visibilities, we still want the one nearer to the |
1102 | * visibilities, we still want the one nearer to the |
1173 | * top |
1103 | * top |
1174 | */ |
1104 | */ |
1175 | else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) |
1105 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) |
1176 | { |
|
|
1177 | middle = tmp->face; |
|
|
1178 | middle_obj = tmp; |
1106 | middle = tmp; |
1179 | } |
|
|
1180 | } |
1107 | } |
1181 | |
1108 | |
1182 | if (tmp == tmp->above) |
1109 | if (tmp == tmp->above) |
1183 | { |
1110 | { |
1184 | LOG (llevError, "Error in structure of map\n"); |
1111 | LOG (llevError, "Error in structure of map\n"); |
… | |
… | |
1197 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1124 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1198 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
1125 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
1199 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
1126 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
1200 | } |
1127 | } |
1201 | |
1128 | |
1202 | this->light = light; |
1129 | this->light = min (light, MAX_LIGHT_RADIUS); |
1203 | this->flags_ = flags; |
1130 | this->flags_ = flags; |
1204 | this->move_block = move_block & ~move_allow; |
1131 | this->move_block = move_block & ~move_allow; |
1205 | this->move_on = move_on; |
1132 | this->move_on = move_on; |
1206 | this->move_off = move_off; |
1133 | this->move_off = move_off; |
1207 | this->move_slow = move_slow; |
1134 | this->move_slow = move_slow; |
… | |
… | |
1219 | * middle face. This should not happen, as we already have the |
1146 | * middle face. This should not happen, as we already have the |
1220 | * else statement above so middle should not get set. OTOH, it |
1147 | * else statement above so middle should not get set. OTOH, it |
1221 | * may be possible for the faces to match but be different objects. |
1148 | * may be possible for the faces to match but be different objects. |
1222 | */ |
1149 | */ |
1223 | if (top == middle) |
1150 | if (top == middle) |
1224 | middle = blank_face; |
1151 | middle = 0; |
1225 | |
1152 | |
1226 | /* There are three posibilities at this point: |
1153 | /* There are three posibilities at this point: |
1227 | * 1) top face is set, need middle to be set. |
1154 | * 1) top face is set, need middle to be set. |
1228 | * 2) middle is set, need to set top. |
1155 | * 2) middle is set, need to set top. |
1229 | * 3) neither middle or top is set - need to set both. |
1156 | * 3) neither middle or top is set - need to set both. |
1230 | */ |
1157 | */ |
1231 | |
1158 | |
1232 | for (tmp = last; tmp; tmp = tmp->below) |
1159 | for (object *tmp = last; tmp; tmp = tmp->below) |
1233 | { |
1160 | { |
1234 | /* Once we get to a floor, stop, since we already have a floor object */ |
1161 | /* Once we get to a floor, stop, since we already have a floor object */ |
1235 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1162 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1236 | break; |
1163 | break; |
1237 | |
1164 | |
1238 | /* If two top faces are already set, quit processing */ |
1165 | /* If two top faces are already set, quit processing */ |
1239 | if ((top != blank_face) && (middle != blank_face)) |
1166 | if (top && middle) |
1240 | break; |
1167 | break; |
1241 | |
1168 | |
1242 | /* Only show visible faces, unless its the editor - show all */ |
1169 | /* Only show visible faces */ |
1243 | if (!tmp->invisible || editor) |
1170 | if (!tmp->invisible) |
1244 | { |
1171 | { |
1245 | /* Fill in top if needed */ |
1172 | /* Fill in top if needed */ |
1246 | if (top == blank_face) |
1173 | if (!top) |
1247 | { |
1174 | { |
1248 | top = tmp->face; |
|
|
1249 | top_obj = tmp; |
1175 | top = tmp; |
1250 | if (top == middle) |
1176 | if (top == middle) |
1251 | middle = blank_face; |
1177 | middle = 0; |
1252 | } |
1178 | } |
1253 | else |
1179 | else |
1254 | { |
1180 | { |
1255 | /* top is already set - we should only get here if |
1181 | /* top is already set - we should only get here if |
1256 | * middle is not set |
1182 | * middle is not set |
1257 | * |
1183 | * |
1258 | * Set the middle face and break out, since there is nothing |
1184 | * Set the middle face and break out, since there is nothing |
1259 | * more to fill in. We don't check visiblity here, since |
1185 | * more to fill in. We don't check visiblity here, since |
1260 | * |
1186 | * |
1261 | */ |
1187 | */ |
1262 | if (tmp->face != top) |
1188 | if (tmp != top) |
1263 | { |
1189 | { |
1264 | middle = tmp->face; |
|
|
1265 | middle_obj = tmp; |
1190 | middle = tmp; |
1266 | break; |
1191 | break; |
1267 | } |
1192 | } |
1268 | } |
1193 | } |
1269 | } |
1194 | } |
1270 | } |
1195 | } |
1271 | |
1196 | |
1272 | if (middle == floor) |
1197 | if (middle == floor) |
1273 | middle = blank_face; |
1198 | middle = 0; |
1274 | |
1199 | |
1275 | if (top == middle) |
1200 | if (top == middle) |
1276 | middle = blank_face; |
1201 | middle = 0; |
1277 | |
1202 | |
1278 | faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; |
1203 | #if 0 |
1279 | faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; |
1204 | faces_obj [0] = top; |
1280 | faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; |
1205 | faces_obj [1] = middle; |
|
|
1206 | faces_obj [2] = floor; |
|
|
1207 | #endif |
1281 | } |
1208 | } |
1282 | |
1209 | |
1283 | /* this updates the orig_map->tile_map[tile_num] value after loading |
1210 | uint64 |
1284 | * the map. It also takes care of linking back the freshly loaded |
1211 | mapspace::volume () const |
1285 | * maps tile_map values if it tiles back to this one. It returns |
|
|
1286 | * the value of orig_map->tile_map[tile_num]. It really only does this |
|
|
1287 | * so that it is easier for calling functions to verify success. |
|
|
1288 | */ |
|
|
1289 | static maptile * |
|
|
1290 | load_and_link_tiled_map (maptile *orig_map, int tile_num) |
|
|
1291 | { |
1212 | { |
1292 | maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); |
1213 | uint64 vol = 0; |
1293 | |
1214 | |
1294 | if (!mp || mp->in_memory != MAP_IN_MEMORY) |
1215 | for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below) |
1295 | { |
1216 | vol += op->volume (); |
1296 | // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine |
|
|
1297 | LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", |
|
|
1298 | &orig_map->tile_path[tile_num], &orig_map->path); |
|
|
1299 | mp = new maptile (1, 1); |
|
|
1300 | mp->alloc (); |
|
|
1301 | mp->in_memory = MAP_IN_MEMORY; |
|
|
1302 | } |
|
|
1303 | |
1217 | |
1304 | int dest_tile = (tile_num + 2) % 4; |
1218 | return vol; |
|
|
1219 | } |
1305 | |
1220 | |
1306 | orig_map->tile_map[tile_num] = mp; |
1221 | bool |
|
|
1222 | maptile::tile_available (int dir, bool load) |
|
|
1223 | { |
|
|
1224 | if (!tile_path[dir]) |
|
|
1225 | return 0; |
1307 | |
1226 | |
1308 | // optimisation: back-link map to origin map if euclidean |
1227 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1309 | //TODO: non-euclidean maps MUST GO |
1228 | return 1; |
1310 | if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path) |
|
|
1311 | orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; |
|
|
1312 | |
1229 | |
|
|
1230 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
|
|
1231 | return 1; |
|
|
1232 | |
1313 | return mp; |
1233 | return 0; |
1314 | } |
1234 | } |
1315 | |
1235 | |
1316 | /* this returns TRUE if the coordinates (x,y) are out of |
1236 | /* this returns TRUE if the coordinates (x,y) are out of |
1317 | * map m. This function also takes into account any |
1237 | * map m. This function also takes into account any |
1318 | * tiling considerations, loading adjacant maps as needed. |
1238 | * tiling considerations, loading adjacant maps as needed. |
… | |
… | |
1331 | if (!m) |
1251 | if (!m) |
1332 | return 0; |
1252 | return 0; |
1333 | |
1253 | |
1334 | if (x < 0) |
1254 | if (x < 0) |
1335 | { |
1255 | { |
1336 | if (!m->tile_path[3]) |
1256 | if (!m->tile_available (3)) |
1337 | return 1; |
1257 | return 1; |
1338 | |
1258 | |
1339 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
|
|
1340 | load_and_link_tiled_map (m, 3); |
|
|
1341 | |
|
|
1342 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1259 | return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); |
1343 | } |
1260 | } |
1344 | |
1261 | |
1345 | if (x >= m->width) |
1262 | if (x >= m->width) |
1346 | { |
1263 | { |
1347 | if (!m->tile_path[1]) |
1264 | if (!m->tile_available (1)) |
1348 | return 1; |
1265 | return 1; |
1349 | |
1266 | |
1350 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
|
|
1351 | load_and_link_tiled_map (m, 1); |
|
|
1352 | |
|
|
1353 | return out_of_map (m->tile_map[1], x - m->width, y); |
1267 | return out_of_map (m->tile_map[1], x - m->width, y); |
1354 | } |
1268 | } |
1355 | |
1269 | |
1356 | if (y < 0) |
1270 | if (y < 0) |
1357 | { |
1271 | { |
1358 | if (!m->tile_path[0]) |
1272 | if (!m->tile_available (0)) |
1359 | return 1; |
1273 | return 1; |
1360 | |
1274 | |
1361 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
|
|
1362 | load_and_link_tiled_map (m, 0); |
|
|
1363 | |
|
|
1364 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1275 | return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); |
1365 | } |
1276 | } |
1366 | |
1277 | |
1367 | if (y >= m->height) |
1278 | if (y >= m->height) |
1368 | { |
1279 | { |
1369 | if (!m->tile_path[2]) |
1280 | if (!m->tile_available (2)) |
1370 | return 1; |
1281 | return 1; |
1371 | |
|
|
1372 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
|
|
1373 | load_and_link_tiled_map (m, 2); |
|
|
1374 | |
1282 | |
1375 | return out_of_map (m->tile_map[2], x, y - m->height); |
1283 | return out_of_map (m->tile_map[2], x, y - m->height); |
1376 | } |
1284 | } |
1377 | |
1285 | |
1378 | /* Simple case - coordinates are within this local |
1286 | /* Simple case - coordinates are within this local |
… | |
… | |
1383 | |
1291 | |
1384 | /* This is basically the same as out_of_map above, but |
1292 | /* This is basically the same as out_of_map above, but |
1385 | * instead we return NULL if no map is valid (coordinates |
1293 | * instead we return NULL if no map is valid (coordinates |
1386 | * out of bounds and no tiled map), otherwise it returns |
1294 | * out of bounds and no tiled map), otherwise it returns |
1387 | * the map as that the coordinates are really on, and |
1295 | * the map as that the coordinates are really on, and |
1388 | * updates x and y to be the localized coordinates. |
1296 | * updates x and y to be the localised coordinates. |
1389 | * Using this is more efficient of calling out_of_map |
1297 | * Using this is more efficient of calling out_of_map |
1390 | * and then figuring out what the real map is |
1298 | * and then figuring out what the real map is |
1391 | */ |
1299 | */ |
1392 | maptile * |
1300 | maptile * |
1393 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
1301 | maptile::xy_find (sint16 &x, sint16 &y) |
1394 | { |
1302 | { |
1395 | if (*x < 0) |
1303 | if (x < 0) |
1396 | { |
1304 | { |
1397 | if (!m->tile_path[3]) |
1305 | if (!tile_available (3)) |
1398 | return 0; |
1306 | return 0; |
1399 | |
1307 | |
1400 | if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) |
|
|
1401 | load_and_link_tiled_map (m, 3); |
|
|
1402 | |
|
|
1403 | *x += m->tile_map[3]->width; |
1308 | x += tile_map[3]->width; |
1404 | return (get_map_from_coord (m->tile_map[3], x, y)); |
1309 | return tile_map[3]->xy_find (x, y); |
1405 | } |
1310 | } |
1406 | |
1311 | |
1407 | if (*x >= m->width) |
1312 | if (x >= width) |
1408 | { |
1313 | { |
1409 | if (!m->tile_path[1]) |
1314 | if (!tile_available (1)) |
1410 | return 0; |
1315 | return 0; |
1411 | |
1316 | |
1412 | if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) |
|
|
1413 | load_and_link_tiled_map (m, 1); |
|
|
1414 | |
|
|
1415 | *x -= m->width; |
1317 | x -= width; |
1416 | return (get_map_from_coord (m->tile_map[1], x, y)); |
1318 | return tile_map[1]->xy_find (x, y); |
1417 | } |
1319 | } |
1418 | |
1320 | |
1419 | if (*y < 0) |
1321 | if (y < 0) |
1420 | { |
1322 | { |
1421 | if (!m->tile_path[0]) |
1323 | if (!tile_available (0)) |
1422 | return 0; |
1324 | return 0; |
1423 | |
1325 | |
1424 | if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) |
|
|
1425 | load_and_link_tiled_map (m, 0); |
|
|
1426 | |
|
|
1427 | *y += m->tile_map[0]->height; |
1326 | y += tile_map[0]->height; |
1428 | return (get_map_from_coord (m->tile_map[0], x, y)); |
1327 | return tile_map[0]->xy_find (x, y); |
1429 | } |
1328 | } |
1430 | |
1329 | |
1431 | if (*y >= m->height) |
1330 | if (y >= height) |
1432 | { |
1331 | { |
1433 | if (!m->tile_path[2]) |
1332 | if (!tile_available (2)) |
1434 | return 0; |
1333 | return 0; |
1435 | |
1334 | |
1436 | if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) |
|
|
1437 | load_and_link_tiled_map (m, 2); |
|
|
1438 | |
|
|
1439 | *y -= m->height; |
1335 | y -= height; |
1440 | return (get_map_from_coord (m->tile_map[2], x, y)); |
1336 | return tile_map[2]->xy_find (x, y); |
1441 | } |
1337 | } |
1442 | |
1338 | |
1443 | /* Simple case - coordinates are within this local |
1339 | /* Simple case - coordinates are within this local |
1444 | * map. |
1340 | * map. |
1445 | */ |
1341 | */ |
1446 | return m; |
1342 | return this; |
1447 | } |
1343 | } |
1448 | |
1344 | |
1449 | /** |
1345 | /** |
1450 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1346 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1451 | * map1 to map2 in dx/dy. |
1347 | * map1 to map2 in dx/dy. |
1452 | */ |
1348 | */ |
1453 | static int |
1349 | int |
1454 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1350 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1455 | { |
1351 | { |
1456 | if (!map1 || !map2) |
1352 | if (!map1 || !map2) |
1457 | return 0; |
1353 | return 0; |
1458 | |
1354 | |
|
|
1355 | //TODO: this doesn't actually check correctly when intermediate maps are not loaded |
|
|
1356 | //fix: compare paths instead (this is likely faster, too!) |
1459 | if (map1 == map2) |
1357 | if (map1 == map2) |
1460 | { |
1358 | { |
1461 | *dx = 0; |
1359 | *dx = 0; |
1462 | *dy = 0; |
1360 | *dy = 0; |
1463 | } |
1361 | } |
… | |
… | |
1523 | } |
1421 | } |
1524 | else |
1422 | else |
1525 | return 0; |
1423 | return 0; |
1526 | |
1424 | |
1527 | return 1; |
1425 | return 1; |
|
|
1426 | } |
|
|
1427 | |
|
|
1428 | maptile * |
|
|
1429 | maptile::xy_load (sint16 &x, sint16 &y) |
|
|
1430 | { |
|
|
1431 | maptile *map = xy_find (x, y); |
|
|
1432 | |
|
|
1433 | if (map) |
|
|
1434 | map->load_sync (); |
|
|
1435 | |
|
|
1436 | return map; |
|
|
1437 | } |
|
|
1438 | |
|
|
1439 | maptile * |
|
|
1440 | get_map_from_coord (maptile *m, sint16 *x, sint16 *y) |
|
|
1441 | { |
|
|
1442 | return m->xy_load (*x, *y); |
1528 | } |
1443 | } |
1529 | |
1444 | |
1530 | /* From map.c |
1445 | /* From map.c |
1531 | * This is used by get_player to determine where the other |
1446 | * This is used by get_player to determine where the other |
1532 | * creature is. get_rangevector takes into account map tiling, |
1447 | * creature is. get_rangevector takes into account map tiling, |
1533 | * so you just can not look the the map coordinates and get the |
1448 | * so you just can not look the the map coordinates and get the |
1534 | * righte value. distance_x/y are distance away, which |
1449 | * righte value. distance_x/y are distance away, which |
1535 | * can be negativbe. direction is the crossfire direction scheme |
1450 | * can be negative. direction is the crossfire direction scheme |
1536 | * that the creature should head. part is the part of the |
1451 | * that the creature should head. part is the part of the |
1537 | * monster that is closest. |
1452 | * monster that is closest. |
1538 | * |
1453 | * |
1539 | * get_rangevector looks at op1 and op2, and fills in the |
1454 | * get_rangevector looks at op1 and op2, and fills in the |
1540 | * structure for op1 to get to op2. |
1455 | * structure for op1 to get to op2. |
… | |
… | |
1551 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1466 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1552 | { |
1467 | { |
1553 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1468 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1554 | { |
1469 | { |
1555 | /* be conservative and fill in _some_ data */ |
1470 | /* be conservative and fill in _some_ data */ |
1556 | retval->distance = 100000; |
1471 | retval->distance = 10000; |
1557 | retval->distance_x = 32767; |
1472 | retval->distance_x = 10000; |
1558 | retval->distance_y = 32767; |
1473 | retval->distance_y = 10000; |
1559 | retval->direction = 0; |
1474 | retval->direction = 0; |
1560 | retval->part = 0; |
1475 | retval->part = 0; |
1561 | } |
1476 | } |
1562 | else |
1477 | else |
1563 | { |
1478 | { |
… | |
… | |
1568 | |
1483 | |
1569 | best = op1; |
1484 | best = op1; |
1570 | /* If this is multipart, find the closest part now */ |
1485 | /* If this is multipart, find the closest part now */ |
1571 | if (!(flags & 0x1) && op1->more) |
1486 | if (!(flags & 0x1) && op1->more) |
1572 | { |
1487 | { |
1573 | object *tmp; |
|
|
1574 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1488 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1575 | |
1489 | |
1576 | /* we just take the offset of the piece to head to figure |
1490 | /* we just take the offset of the piece to head to figure |
1577 | * distance instead of doing all that work above again |
1491 | * distance instead of doing all that work above again |
1578 | * since the distance fields we set above are positive in the |
1492 | * since the distance fields we set above are positive in the |
1579 | * same axis as is used for multipart objects, the simply arithmetic |
1493 | * same axis as is used for multipart objects, the simply arithmetic |
1580 | * below works. |
1494 | * below works. |
1581 | */ |
1495 | */ |
1582 | for (tmp = op1->more; tmp != NULL; tmp = tmp->more) |
1496 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1583 | { |
1497 | { |
1584 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1498 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1585 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1499 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1586 | if (tmpi < best_distance) |
1500 | if (tmpi < best_distance) |
1587 | { |
1501 | { |
1588 | best_distance = tmpi; |
1502 | best_distance = tmpi; |
1589 | best = tmp; |
1503 | best = tmp; |
1590 | } |
1504 | } |
1591 | } |
1505 | } |
|
|
1506 | |
1592 | if (best != op1) |
1507 | if (best != op1) |
1593 | { |
1508 | { |
1594 | retval->distance_x += op1->x - best->x; |
1509 | retval->distance_x += op1->x - best->x; |
1595 | retval->distance_y += op1->y - best->y; |
1510 | retval->distance_y += op1->y - best->y; |
1596 | } |
1511 | } |
1597 | } |
1512 | } |
|
|
1513 | |
1598 | retval->part = best; |
1514 | retval->part = best; |
1599 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1515 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1600 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1516 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1601 | } |
1517 | } |
1602 | } |
1518 | } |
1603 | |
1519 | |
1604 | /* this is basically the same as get_rangevector above, but instead of |
1520 | /* this is basically the same as get_rangevector above, but instead of |
… | |
… | |
1609 | * flags has no meaning for this function at this time - I kept it in to |
1525 | * flags has no meaning for this function at this time - I kept it in to |
1610 | * be more consistant with the above function and also in case they are needed |
1526 | * be more consistant with the above function and also in case they are needed |
1611 | * for something in the future. Also, since no object is pasted, the best |
1527 | * for something in the future. Also, since no object is pasted, the best |
1612 | * field of the rv_vector is set to NULL. |
1528 | * field of the rv_vector is set to NULL. |
1613 | */ |
1529 | */ |
1614 | |
|
|
1615 | void |
1530 | void |
1616 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) |
1531 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1617 | { |
1532 | { |
1618 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1533 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1619 | { |
1534 | { |
1620 | /* be conservative and fill in _some_ data */ |
1535 | /* be conservative and fill in _some_ data */ |
1621 | retval->distance = 100000; |
1536 | retval->distance = 100000; |
… | |
… | |
1628 | { |
1543 | { |
1629 | retval->distance_x += op2->x - x; |
1544 | retval->distance_x += op2->x - x; |
1630 | retval->distance_y += op2->y - y; |
1545 | retval->distance_y += op2->y - y; |
1631 | |
1546 | |
1632 | retval->part = NULL; |
1547 | retval->part = NULL; |
1633 | retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); |
1548 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1634 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1549 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1635 | } |
1550 | } |
1636 | } |
1551 | } |
1637 | |
1552 | |
1638 | /* Returns true of op1 and op2 are effectively on the same map |
1553 | /* Returns true of op1 and op2 are effectively on the same map |
… | |
… | |
1652 | } |
1567 | } |
1653 | |
1568 | |
1654 | object * |
1569 | object * |
1655 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1570 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1656 | { |
1571 | { |
1657 | if (!op->flag [FLAG_REMOVED]) |
|
|
1658 | op->remove (); |
|
|
1659 | |
|
|
1660 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1572 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1661 | } |
1573 | } |
1662 | |
1574 | |
|
|
1575 | region * |
|
|
1576 | maptile::region (int x, int y) const |
|
|
1577 | { |
|
|
1578 | if (regions |
|
|
1579 | && regionmap |
|
|
1580 | && !OUT_OF_REAL_MAP (this, x, y)) |
|
|
1581 | if (struct region *reg = regionmap [regions [y * width + x]]) |
|
|
1582 | return reg; |
|
|
1583 | |
|
|
1584 | if (default_region) |
|
|
1585 | return default_region; |
|
|
1586 | |
|
|
1587 | return ::region::default_region (); |
|
|
1588 | } |
|
|
1589 | |
|
|
1590 | /* picks a random object from a style map. |
|
|
1591 | */ |
|
|
1592 | object * |
|
|
1593 | maptile::pick_random_object (rand_gen &gen) const |
|
|
1594 | { |
|
|
1595 | /* while returning a null object will result in a crash, that |
|
|
1596 | * is actually preferable to an infinite loop. That is because |
|
|
1597 | * most servers will automatically restart in case of crash. |
|
|
1598 | * Change the logic on getting the random space - shouldn't make |
|
|
1599 | * any difference, but this seems clearer to me. |
|
|
1600 | */ |
|
|
1601 | for (int i = 1000; --i;) |
|
|
1602 | { |
|
|
1603 | object *pick = at (gen (width), gen (height)).bot; |
|
|
1604 | |
|
|
1605 | // do not prefer big monsters just because they are big. |
|
|
1606 | if (pick && pick->is_head ()) |
|
|
1607 | return pick->head_ (); |
|
|
1608 | } |
|
|
1609 | |
|
|
1610 | // instead of crashing in the unlikely(?) case, try to return *something* |
|
|
1611 | return archetype::find ("bug"); |
|
|
1612 | } |
|
|
1613 | |
|
|
1614 | void |
|
|
1615 | maptile::play_sound (faceidx sound, int x, int y) const |
|
|
1616 | { |
|
|
1617 | if (!sound) |
|
|
1618 | return; |
|
|
1619 | |
|
|
1620 | for_all_players_on_map (pl, this) |
|
|
1621 | if (client *ns = pl->ns) |
|
|
1622 | { |
|
|
1623 | int dx = x - pl->ob->x; |
|
|
1624 | int dy = y - pl->ob->y; |
|
|
1625 | |
|
|
1626 | int distance = idistance (dx, dy); |
|
|
1627 | |
|
|
1628 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1629 | ns->play_sound (sound, dx, dy); |
|
|
1630 | } |
|
|
1631 | } |
|
|
1632 | |