1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
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 <support@deliantra.net> |
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 "loader.h" |
|
|
28 | #include "path.h" |
28 | #include "path.h" |
|
|
29 | |
|
|
30 | //+GPL |
|
|
31 | |
|
|
32 | sint8 maptile::outdoor_darkness; |
29 | |
33 | |
30 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
34 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
31 | * one function that just returns a P_.. value (see map.h) |
35 | * one function that just returns a P_.. value (see map.h) |
32 | * it will also do map translation for tiled maps, returning |
36 | * it will also do map translation for tiled maps, returning |
33 | * new values into newmap, nx, and ny. Any and all of those |
37 | * new values into newmap, nx, and ny. Any and all of those |
… | |
… | |
68 | * by the caller. |
72 | * by the caller. |
69 | */ |
73 | */ |
70 | int |
74 | int |
71 | blocked_link (object *ob, maptile *m, int sx, int sy) |
75 | blocked_link (object *ob, maptile *m, int sx, int sy) |
72 | { |
76 | { |
73 | object *tmp; |
|
|
74 | int mflags, blocked; |
|
|
75 | |
|
|
76 | /* Make sure the coordinates are valid - they should be, as caller should |
77 | /* Make sure the coordinates are valid - they should be, as caller should |
77 | * have already checked this. |
78 | * have already checked this. |
78 | */ |
79 | */ |
79 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
80 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
80 | { |
81 | { |
81 | LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
82 | LOG (llevError | logBacktrace, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
82 | return 1; |
83 | return 1; |
83 | } |
84 | } |
84 | |
85 | |
85 | /* Save some cycles - instead of calling get_map_flags(), just get the value |
86 | mapspace &ms = m->at (sx, sy); |
86 | * directly. |
|
|
87 | */ |
|
|
88 | mflags = m->at (sx, sy).flags (); |
|
|
89 | |
87 | |
90 | blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); |
88 | int mflags = ms.flags (); |
|
|
89 | int blocked = ms.move_block; |
91 | |
90 | |
92 | /* If space is currently not blocked by anything, no need to |
91 | /* If space is currently not blocked by anything, no need to |
93 | * go further. Not true for players - all sorts of special |
92 | * go further. Not true for players - all sorts of special |
94 | * things we need to do for players. |
93 | * things we need to do for players. |
95 | */ |
94 | */ |
96 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
95 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0) |
97 | return 0; |
96 | return 0; |
98 | |
97 | |
99 | /* if there isn't anytyhing alive on this space, and this space isn't |
98 | /* if there isn't anything alive on this space, and this space isn't |
100 | * otherwise blocked, we can return now. Only if there is a living |
99 | * otherwise blocked, we can return now. Only if there is a living |
101 | * creature do we need to investigate if it is part of this creature |
100 | * creature do we need to investigate if it is part of this creature |
102 | * or another. Likewise, only if something is blocking us do we |
101 | * or another. Likewise, only if something is blocking us do we |
103 | * need to investigate if there is a special circumstance that would |
102 | * need to investigate if there is a special circumstance that would |
104 | * let the player through (inventory checkers for example) |
103 | * let the player through (inventory checkers for example) |
… | |
… | |
111 | /* We basically go through the stack of objects, and if there is |
110 | /* We basically go through the stack of objects, and if there is |
112 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
111 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
113 | * true. If we get through the entire stack, that must mean |
112 | * true. If we get through the entire stack, that must mean |
114 | * ob is blocking it, so return 0. |
113 | * ob is blocking it, so return 0. |
115 | */ |
114 | */ |
116 | for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) |
115 | for (object *tmp = ms.top; tmp; tmp = tmp->below) |
117 | { |
116 | { |
118 | |
117 | if (OB_MOVE_BLOCK (ob, tmp)) |
119 | /* This must be before the checks below. Code for inventory checkers. */ |
|
|
120 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
|
|
121 | { |
118 | { |
122 | /* If last_sp is set, the player/monster needs an object, |
119 | if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob)) |
123 | * so we check for it. If they don't have it, they can't |
120 | if (RESULT_INT (0)) |
124 | * pass through this space. |
121 | return 1; |
125 | */ |
122 | else |
126 | if (tmp->last_sp) |
123 | continue; |
|
|
124 | |
|
|
125 | if (tmp->type == CHECK_INV) |
127 | { |
126 | { |
128 | if (check_inv_recursive (ob, tmp) == NULL) |
127 | bool have = check_inv_recursive (ob, tmp); |
|
|
128 | |
|
|
129 | // last_sp set means we block if we don't have. |
|
|
130 | if (logical_xor (have, tmp->last_sp)) |
129 | return 1; |
131 | return 1; |
130 | else |
132 | } |
131 | continue; |
133 | else if (tmp->type == T_MATCH) |
|
|
134 | { |
|
|
135 | // T_MATCH allows "entrance" iff the match is true |
|
|
136 | // == blocks if the match fails |
|
|
137 | |
|
|
138 | // we could have used an INVOKE_OBJECT, but decided against it, as we |
|
|
139 | // assume that T_MATCH is relatively common. |
|
|
140 | if (!match (tmp->slaying, ob, tmp, ob)) |
|
|
141 | return 1; |
132 | } |
142 | } |
133 | else |
143 | else |
134 | { |
144 | return 1; // unconditional block |
135 | /* In this case, the player must not have the object - |
145 | |
136 | * if they do, they can't pass through. |
|
|
137 | */ |
|
|
138 | if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ |
|
|
139 | return 1; |
|
|
140 | else |
|
|
141 | continue; |
|
|
142 | } |
|
|
143 | } /* if check_inv */ |
|
|
144 | else |
146 | } else { |
145 | { |
147 | // space does not block the ob, directly, but |
146 | /* Broke apart a big nasty if into several here to make |
148 | // anything alive that is not a door still |
147 | * this more readable. first check - if the space blocks |
149 | // blocks anything |
148 | * movement, can't move here. |
|
|
149 | * second - if a monster, can't move there, unless it is a |
|
|
150 | * hidden dm |
|
|
151 | */ |
|
|
152 | if (OB_MOVE_BLOCK (ob, tmp)) |
|
|
153 | return 1; |
|
|
154 | |
150 | |
155 | if (tmp->flag [FLAG_ALIVE] |
151 | if (tmp->flag [FLAG_ALIVE] |
156 | && tmp->head_ () != ob |
|
|
157 | && tmp != ob |
|
|
158 | && tmp->type != DOOR |
152 | && tmp->type != DOOR |
159 | && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) |
153 | && tmp->head_ () != ob) //TODO: maybe move these check up? |
160 | return 1; |
154 | return 1; |
161 | } |
155 | } |
162 | |
|
|
163 | } |
156 | } |
|
|
157 | |
164 | return 0; |
158 | return 0; |
165 | } |
159 | } |
166 | |
160 | |
167 | /* |
161 | /* |
168 | * Returns qthe blocking object if the given object can't fit in the given |
162 | * Returns the blocking object if the given object can't fit in the given |
169 | * spot. This is meant for multi space objects - for single space objecs, |
163 | * spot. This is meant for multi space objects - for single space objecs, |
170 | * just calling get_map_blocked and checking that against movement type |
164 | * just calling get_map_blocked and checking that against movement type |
171 | * of object. This function goes through all the parts of the multipart |
165 | * of object. This function goes through all the parts of the multipart |
172 | * object and makes sure they can be inserted. |
166 | * object and makes sure they can be inserted. |
173 | * |
167 | * |
… | |
… | |
220 | } |
214 | } |
221 | |
215 | |
222 | return 0; |
216 | return 0; |
223 | } |
217 | } |
224 | |
218 | |
225 | /* When the map is loaded, load_object does not actually insert objects |
219 | //-GPL |
226 | * into inventory, but just links them. What this does is go through |
|
|
227 | * and insert them properly. |
|
|
228 | * The object 'container' is the object that contains the inventory. |
|
|
229 | * This is needed so that we can update the containers weight. |
|
|
230 | */ |
|
|
231 | void |
|
|
232 | fix_container (object *container) |
|
|
233 | { |
|
|
234 | object *tmp = container->inv, *next; |
|
|
235 | |
|
|
236 | container->inv = 0; |
|
|
237 | while (tmp) |
|
|
238 | { |
|
|
239 | next = tmp->below; |
|
|
240 | if (tmp->inv) |
|
|
241 | fix_container (tmp); |
|
|
242 | |
|
|
243 | insert_ob_in_ob (tmp, container); |
|
|
244 | tmp = next; |
|
|
245 | } |
|
|
246 | |
|
|
247 | // go through and calculate what all the containers are carrying. |
|
|
248 | //TODO: remove |
|
|
249 | container->update_weight (); |
|
|
250 | } |
|
|
251 | |
220 | |
252 | void |
221 | void |
253 | maptile::set_object_flag (int flag, int value) |
222 | maptile::set_object_flag (int flag, int value) |
254 | { |
223 | { |
255 | if (!spaces) |
224 | if (!spaces) |
… | |
… | |
270 | |
239 | |
271 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
240 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
272 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
241 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
273 | INVOKE_OBJECT (RESET, tmp); |
242 | INVOKE_OBJECT (RESET, tmp); |
274 | } |
243 | } |
|
|
244 | |
|
|
245 | void |
|
|
246 | maptile::post_load () |
|
|
247 | { |
|
|
248 | #if 0 |
|
|
249 | if (!spaces) |
|
|
250 | return; |
|
|
251 | |
|
|
252 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
253 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
|
|
254 | ; // nop |
|
|
255 | #endif |
|
|
256 | } |
|
|
257 | |
|
|
258 | //+GPL |
275 | |
259 | |
276 | /* link_multipart_objects go through all the objects on the map looking |
260 | /* link_multipart_objects go through all the objects on the map looking |
277 | * for objects whose arch says they are multipart yet according to the |
261 | * for objects whose arch says they are multipart yet according to the |
278 | * info we have, they only have the head (as would be expected when |
262 | * info we have, they only have the head (as would be expected when |
279 | * they are saved). |
263 | * they are saved). |
… | |
… | |
307 | op = op->above; |
291 | op = op->above; |
308 | } |
292 | } |
309 | } |
293 | } |
310 | } |
294 | } |
311 | |
295 | |
|
|
296 | //-GPL |
|
|
297 | |
312 | /* |
298 | /* |
313 | * Loads (ands parses) the objects into a given map from the specified |
299 | * Loads (ands parses) the objects into a given map from the specified |
314 | * file pointer. |
300 | * file pointer. |
315 | */ |
301 | */ |
316 | bool |
302 | bool |
… | |
… | |
325 | case KW_arch: |
311 | case KW_arch: |
326 | if (object *op = object::read (f, this)) |
312 | if (object *op = object::read (f, this)) |
327 | { |
313 | { |
328 | // TODO: why? |
314 | // TODO: why? |
329 | if (op->inv) |
315 | if (op->inv) |
|
|
316 | { |
|
|
317 | op->carrying = 0; |
330 | op->update_weight (); |
318 | op->update_weight (); |
|
|
319 | } |
331 | |
320 | |
332 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
321 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
333 | { |
322 | { |
334 | // we insert manually because |
323 | // we insert manually because |
335 | // a) its way faster |
324 | // a) its way faster |
336 | // b) we remove manually, too, and there are good reasons for that |
325 | // b) we remove manually, too, and there are good reasons for that |
337 | // c) its correct |
326 | // c) it's correct |
338 | mapspace &ms = at (op->x, op->y); |
327 | mapspace &ms = at (op->x, op->y); |
339 | |
328 | |
340 | op->flag [FLAG_REMOVED] = false; |
329 | op->flag [FLAG_REMOVED] = false; |
341 | |
330 | |
342 | op->above = 0; |
331 | op->above = 0; |
343 | op->below = ms.top; |
332 | op->below = ms.top; |
344 | |
333 | |
345 | if (ms.top) |
|
|
346 | ms.top->above = op; |
334 | *(ms.top ? &ms.top->above : &ms.bot) = op; |
347 | else |
|
|
348 | ms.bot = op; |
|
|
349 | |
335 | |
350 | ms.top = op; |
336 | ms.top = op; |
351 | ms.flags_ = 0; |
337 | ms.flags_ = 0; |
352 | } |
338 | } |
353 | else |
339 | else |
354 | { |
340 | { |
355 | f.parse_warn (format ("object %s out of range", op->debug_desc ())); |
341 | f.parse_warn (format ("object %s out of range", op->debug_desc ())); |
356 | op->destroy_inv (false); // be explicit about dropping |
|
|
357 | op->destroy (true); |
342 | op->destroy (); |
358 | } |
343 | } |
359 | } |
344 | } |
360 | |
345 | |
361 | continue; |
346 | continue; |
362 | |
347 | |
… | |
… | |
376 | } |
361 | } |
377 | |
362 | |
378 | void |
363 | void |
379 | maptile::activate () |
364 | maptile::activate () |
380 | { |
365 | { |
381 | if (spaces) |
366 | if (state != MAP_INACTIVE) |
|
|
367 | return; |
|
|
368 | |
382 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
369 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
383 | for (object *op = ms->bot; op; op = op->above) |
370 | for (object *op = ms->bot; op; op = op->above) |
384 | op->activate_recursive (); |
371 | op->activate_recursive (); |
|
|
372 | |
|
|
373 | state = MAP_ACTIVE; |
|
|
374 | |
|
|
375 | activate_physics (); |
385 | } |
376 | } |
386 | |
377 | |
387 | void |
378 | void |
388 | maptile::deactivate () |
379 | maptile::deactivate () |
389 | { |
380 | { |
390 | if (spaces) |
381 | if (state != MAP_ACTIVE) |
|
|
382 | return; |
|
|
383 | |
391 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
384 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
392 | for (object *op = ms->bot; op; op = op->above) |
385 | for (object *op = ms->bot; op; op = op->above) |
393 | op->deactivate_recursive (); |
386 | op->deactivate_recursive (); |
|
|
387 | |
|
|
388 | state = MAP_INACTIVE; |
394 | } |
389 | } |
395 | |
390 | |
396 | bool |
391 | bool |
397 | maptile::_save_objects (object_freezer &f, int flags) |
392 | maptile::_save_objects (object_freezer &f, int flags) |
398 | { |
393 | { |
… | |
… | |
439 | return false; |
434 | return false; |
440 | |
435 | |
441 | return freezer.save (path); |
436 | return freezer.save (path); |
442 | } |
437 | } |
443 | |
438 | |
444 | maptile::maptile () |
439 | void |
|
|
440 | maptile::init () |
445 | { |
441 | { |
446 | in_memory = MAP_SWAPPED; |
442 | state = MAP_SWAPPED; |
447 | |
443 | |
448 | /* The maps used to pick up default x and y values from the |
444 | /* The maps used to pick up default x and y values from the |
449 | * map archetype. Mimic that behaviour. |
445 | * map archetype. Mimic that behaviour. |
450 | */ |
446 | */ |
451 | width = 16; |
447 | width = 16; |
452 | height = 16; |
448 | height = 16; |
453 | timeout = 300; |
449 | timeout = 300; |
454 | max_nrof = 1000; // 1000 items of anything |
450 | max_items = MAX_ITEM_PER_ACTION; |
455 | max_volume = 2000000; // 2m³ |
451 | max_volume = 2000000; // 2m³ |
456 | } |
|
|
457 | |
|
|
458 | maptile::maptile (int w, int h) |
|
|
459 | { |
|
|
460 | in_memory = MAP_SWAPPED; |
|
|
461 | |
|
|
462 | width = w; |
|
|
463 | height = h; |
|
|
464 | reset_timeout = 0; |
452 | reset_timeout = 0; |
465 | timeout = 300; |
|
|
466 | enter_x = 0; |
453 | enter_x = 0; |
467 | enter_y = 0; |
454 | enter_y = 0; |
|
|
455 | } |
|
|
456 | |
|
|
457 | maptile::maptile () |
|
|
458 | { |
|
|
459 | init (); |
|
|
460 | } |
|
|
461 | |
|
|
462 | maptile::maptile (int w, int h) |
|
|
463 | { |
|
|
464 | init (); |
|
|
465 | |
|
|
466 | width = w; |
|
|
467 | height = h; |
468 | |
468 | |
469 | alloc (); |
469 | alloc (); |
470 | } |
470 | } |
471 | |
471 | |
472 | /* |
472 | /* |
… | |
… | |
480 | if (spaces) |
480 | if (spaces) |
481 | return; |
481 | return; |
482 | |
482 | |
483 | spaces = salloc0<mapspace> (size ()); |
483 | spaces = salloc0<mapspace> (size ()); |
484 | } |
484 | } |
|
|
485 | |
|
|
486 | //+GPL |
485 | |
487 | |
486 | /* Takes a string from a map definition and outputs a pointer to the array of shopitems |
488 | /* Takes a string from a map definition and outputs a pointer to the array of shopitems |
487 | * corresponding to that string. Memory is allocated for this, it must be freed |
489 | * corresponding to that string. Memory is allocated for this, it must be freed |
488 | * at a later date. |
490 | * at a later date. |
489 | * Called by parse_map_headers below. |
491 | * Called by parse_map_headers below. |
… | |
… | |
566 | return items; |
568 | return items; |
567 | } |
569 | } |
568 | |
570 | |
569 | /* opposite of parse string, this puts the string that was originally fed in to |
571 | /* opposite of parse string, this puts the string that was originally fed in to |
570 | * the map (or something equivilent) into output_string. */ |
572 | * the map (or something equivilent) into output_string. */ |
571 | static void |
573 | static const char * |
572 | print_shop_string (maptile *m, char *output_string) |
574 | print_shop_string (maptile *m) |
573 | { |
575 | { |
574 | int i; |
576 | static dynbuf_text buf; buf.clear (); |
575 | char tmp[MAX_BUF]; |
577 | bool first = true; |
576 | |
578 | |
577 | strcpy (output_string, ""); |
|
|
578 | for (i = 0; i < m->shopitems[0].index; i++) |
579 | for (int i = 0; i < m->shopitems[0].index; i++) |
579 | { |
580 | { |
|
|
581 | if (!first) |
|
|
582 | buf << ';'; |
|
|
583 | |
|
|
584 | first = false; |
|
|
585 | |
580 | if (m->shopitems[i].typenum) |
586 | if (m->shopitems[i].typenum) |
581 | { |
587 | { |
582 | if (m->shopitems[i].strength) |
588 | if (m->shopitems[i].strength) |
583 | sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
589 | buf.printf ("%s:%d", m->shopitems[i].name, m->shopitems[i].strength); |
584 | else |
590 | else |
585 | sprintf (tmp, "%s;", m->shopitems[i].name); |
591 | buf.printf ("%s", m->shopitems[i].name); |
586 | } |
592 | } |
587 | else |
593 | else |
588 | { |
594 | { |
589 | if (m->shopitems[i].strength) |
595 | if (m->shopitems[i].strength) |
590 | sprintf (tmp, "*:%d;", m->shopitems[i].strength); |
596 | buf.printf ("*:%d", m->shopitems[i].strength); |
591 | else |
597 | else |
592 | sprintf (tmp, "*"); |
598 | buf.printf ("*"); |
593 | } |
599 | } |
594 | |
|
|
595 | strcat (output_string, tmp); |
|
|
596 | } |
600 | } |
|
|
601 | |
|
|
602 | return buf; |
597 | } |
603 | } |
|
|
604 | |
|
|
605 | //-GPL |
598 | |
606 | |
599 | /* This loads the header information of the map. The header |
607 | /* This loads the header information of the map. The header |
600 | * contains things like difficulty, size, timeout, etc. |
608 | * contains things like difficulty, size, timeout, etc. |
601 | * this used to be stored in the map object, but with the |
609 | * this used to be stored in the map object, but with the |
602 | * addition of tiling, fields beyond that easily named in an |
610 | * addition of tiling, fields beyond that easily named in an |
… | |
… | |
616 | { |
624 | { |
617 | case KW_msg: |
625 | case KW_msg: |
618 | thawer.get_ml (KW_endmsg, msg); |
626 | thawer.get_ml (KW_endmsg, msg); |
619 | break; |
627 | break; |
620 | |
628 | |
621 | case KW_lore: // CF+ extension |
629 | case KW_lore: // deliantra extension |
622 | thawer.get_ml (KW_endlore, maplore); |
630 | thawer.get_ml (KW_endlore, maplore); |
623 | break; |
631 | break; |
624 | |
632 | |
625 | case KW_maplore: |
633 | case KW_maplore: |
626 | thawer.get_ml (KW_endmaplore, maplore); |
634 | thawer.get_ml (KW_endmaplore, maplore); |
… | |
… | |
643 | case KW_shopgreed: thawer.get (shopgreed); break; |
651 | case KW_shopgreed: thawer.get (shopgreed); break; |
644 | case KW_shopmin: thawer.get (shopmin); break; |
652 | case KW_shopmin: thawer.get (shopmin); break; |
645 | case KW_shopmax: thawer.get (shopmax); break; |
653 | case KW_shopmax: thawer.get (shopmax); break; |
646 | case KW_shoprace: thawer.get (shoprace); break; |
654 | case KW_shoprace: thawer.get (shoprace); break; |
647 | case KW_outdoor: thawer.get (outdoor); break; |
655 | case KW_outdoor: thawer.get (outdoor); break; |
648 | case KW_temp: thawer.get (temp); break; |
|
|
649 | case KW_pressure: thawer.get (pressure); break; |
|
|
650 | case KW_humid: thawer.get (humid); break; |
|
|
651 | case KW_windspeed: thawer.get (windspeed); break; |
|
|
652 | case KW_winddir: thawer.get (winddir); break; |
|
|
653 | case KW_sky: thawer.get (sky); break; |
|
|
654 | |
656 | |
655 | case KW_per_player: thawer.get (per_player); break; |
657 | case KW_per_player: thawer.get (per_player); break; |
656 | case KW_per_party: thawer.get (per_party); break; |
658 | case KW_per_party: thawer.get (per_party); break; |
657 | case KW_no_reset: thawer.get (no_reset); break; |
659 | case KW_no_reset: thawer.get (no_reset); break; |
658 | case KW_no_drop: thawer.get (no_drop); break; |
660 | case KW_no_drop: thawer.get (no_drop); break; |
659 | |
661 | |
660 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
662 | case KW_region: thawer.get (default_region); break; |
661 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
663 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
662 | |
664 | |
663 | // old names new names |
665 | // old names new names |
664 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
666 | case KW_hp: case KW_enter_x: thawer.get (enter_x); break; |
665 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
667 | case KW_sp: case KW_enter_y: thawer.get (enter_y); break; |
… | |
… | |
673 | |
675 | |
674 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
676 | case KW_tile_path_1: thawer.get (tile_path [0]); break; |
675 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
677 | case KW_tile_path_2: thawer.get (tile_path [1]); break; |
676 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
678 | case KW_tile_path_3: thawer.get (tile_path [2]); break; |
677 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
679 | case KW_tile_path_4: thawer.get (tile_path [3]); break; |
|
|
680 | case KW_tile_path_5: thawer.get (tile_path [4]); break; |
|
|
681 | case KW_tile_path_6: thawer.get (tile_path [5]); break; |
678 | |
682 | |
679 | case KW_ERROR: |
683 | case KW_ERROR: |
680 | set_key_text (thawer.kw_str, thawer.value); |
684 | set_key_text (thawer.kw_str, thawer.value); |
681 | break; |
685 | break; |
682 | |
686 | |
683 | case KW_end: |
687 | case KW_end: |
684 | thawer.next (); |
688 | thawer.next (); |
685 | return true; |
689 | return true; |
686 | |
690 | |
687 | default: |
691 | default: |
688 | if (!thawer.parse_error ("map", 0)) |
692 | if (!thawer.parse_error ("map")) |
689 | return false; |
693 | return false; |
690 | break; |
694 | break; |
691 | } |
695 | } |
692 | |
696 | |
693 | thawer.next (); |
697 | thawer.next (); |
694 | } |
698 | } |
695 | |
699 | |
696 | abort (); |
700 | abort (); |
697 | } |
701 | } |
|
|
702 | |
|
|
703 | //+GPL |
698 | |
704 | |
699 | /****************************************************************************** |
705 | /****************************************************************************** |
700 | * This is the start of unique map handling code |
706 | * This is the start of unique map handling code |
701 | *****************************************************************************/ |
707 | *****************************************************************************/ |
702 | |
708 | |
… | |
… | |
709 | int unique = 0; |
715 | int unique = 0; |
710 | for (object *op = spaces [i].bot; op; ) |
716 | for (object *op = spaces [i].bot; op; ) |
711 | { |
717 | { |
712 | object *above = op->above; |
718 | object *above = op->above; |
713 | |
719 | |
714 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
720 | if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE]) |
715 | unique = 1; |
721 | unique = 1; |
716 | |
722 | |
717 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
723 | if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique)) |
718 | { |
|
|
719 | op->destroy_inv (false); |
|
|
720 | op->destroy (true); |
724 | op->destroy (); |
721 | } |
|
|
722 | |
725 | |
723 | op = above; |
726 | op = above; |
724 | } |
727 | } |
725 | } |
728 | } |
726 | } |
729 | } |
727 | |
730 | |
|
|
731 | //-GPL |
|
|
732 | |
728 | bool |
733 | bool |
729 | maptile::_save_header (object_freezer &freezer) |
734 | maptile::_save_header (object_freezer &freezer) |
730 | { |
735 | { |
731 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
736 | #define MAP_OUT(k) freezer.put (KW(k), k) |
732 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
737 | #define MAP_OUT2(k,v) freezer.put (KW(k), v) |
733 | |
738 | |
734 | MAP_OUT2 (arch, "map"); |
739 | MAP_OUT2 (arch, CS(map)); |
735 | |
740 | |
736 | if (name) MAP_OUT (name); |
741 | if (name) MAP_OUT (name); |
737 | MAP_OUT (swap_time); |
742 | MAP_OUT (swap_time); |
738 | MAP_OUT (reset_time); |
743 | MAP_OUT (reset_time); |
739 | MAP_OUT (reset_timeout); |
744 | MAP_OUT (reset_timeout); |
740 | MAP_OUT (fixed_resettime); |
745 | MAP_OUT (fixed_resettime); |
741 | MAP_OUT (no_reset); |
746 | MAP_OUT (no_reset); |
742 | MAP_OUT (no_drop); |
747 | MAP_OUT (no_drop); |
743 | MAP_OUT (difficulty); |
748 | MAP_OUT (difficulty); |
744 | |
|
|
745 | if (default_region) MAP_OUT2 (region, default_region->name); |
749 | if (default_region) MAP_OUT2 (region, default_region->name); |
746 | |
750 | |
747 | if (shopitems) |
751 | if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this)); |
748 | { |
|
|
749 | char shop[MAX_BUF]; |
|
|
750 | print_shop_string (this, shop); |
|
|
751 | MAP_OUT2 (shopitems, shop); |
|
|
752 | } |
|
|
753 | |
|
|
754 | MAP_OUT (shopgreed); |
752 | MAP_OUT (shopgreed); |
755 | MAP_OUT (shopmin); |
753 | MAP_OUT (shopmin); |
756 | MAP_OUT (shopmax); |
754 | MAP_OUT (shopmax); |
757 | if (shoprace) MAP_OUT (shoprace); |
755 | if (shoprace) MAP_OUT (shoprace); |
758 | MAP_OUT (darkness); |
756 | |
759 | MAP_OUT (width); |
757 | MAP_OUT (width); |
760 | MAP_OUT (height); |
758 | MAP_OUT (height); |
761 | MAP_OUT (enter_x); |
759 | MAP_OUT (enter_x); |
762 | MAP_OUT (enter_y); |
760 | MAP_OUT (enter_y); |
763 | |
761 | MAP_OUT (darkness); |
764 | if (msg) freezer.put (KW_msg , KW_endmsg , msg); |
|
|
765 | if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore); |
|
|
766 | |
|
|
767 | MAP_OUT (outdoor); |
762 | MAP_OUT (outdoor); |
768 | MAP_OUT (temp); |
763 | |
769 | MAP_OUT (pressure); |
764 | if (msg) freezer.put (KW(msg) , KW(endmsg) , msg); |
770 | MAP_OUT (humid); |
765 | if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore); |
771 | MAP_OUT (windspeed); |
|
|
772 | MAP_OUT (winddir); |
|
|
773 | MAP_OUT (sky); |
|
|
774 | |
766 | |
775 | MAP_OUT (per_player); |
767 | MAP_OUT (per_player); |
776 | MAP_OUT (per_party); |
768 | MAP_OUT (per_party); |
777 | |
769 | |
778 | if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); |
770 | if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); |
779 | if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); |
771 | if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); |
780 | if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); |
772 | if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); |
781 | if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); |
773 | if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); |
|
|
774 | if (tile_path [4]) MAP_OUT2 (tile_path_5, tile_path [4]); |
|
|
775 | if (tile_path [5]) MAP_OUT2 (tile_path_6, tile_path [5]); |
782 | |
776 | |
783 | freezer.put (this); |
777 | freezer.put (this); |
784 | freezer.put (KW_end); |
778 | freezer.put (KW(end)); |
785 | |
779 | |
786 | return true; |
780 | return true; |
787 | } |
781 | } |
788 | |
782 | |
789 | bool |
783 | bool |
… | |
… | |
794 | if (!_save_header (freezer)) |
788 | if (!_save_header (freezer)) |
795 | return false; |
789 | return false; |
796 | |
790 | |
797 | return freezer.save (path); |
791 | return freezer.save (path); |
798 | } |
792 | } |
|
|
793 | |
|
|
794 | //+GPL |
799 | |
795 | |
800 | /* |
796 | /* |
801 | * Remove and free all objects in the given map. |
797 | * Remove and free all objects in the given map. |
802 | */ |
798 | */ |
803 | void |
799 | void |
… | |
… | |
814 | |
810 | |
815 | op->flag [FLAG_REMOVED] = true; |
811 | op->flag [FLAG_REMOVED] = true; |
816 | |
812 | |
817 | object *head = op->head_ (); |
813 | object *head = op->head_ (); |
818 | if (op == head) |
814 | if (op == head) |
819 | { |
|
|
820 | op->destroy_inv (false); |
|
|
821 | op->destroy (true); |
815 | op->destroy (); |
822 | } |
|
|
823 | else if (head->map != op->map) |
816 | else if (head->map != op->map) |
824 | { |
817 | { |
825 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
818 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
826 | head->destroy (true); |
819 | head->destroy (); |
827 | } |
820 | } |
828 | } |
821 | } |
829 | |
822 | |
830 | sfree0 (spaces, size ()); |
823 | sfree0 (spaces, size ()); |
831 | } |
824 | } |
… | |
… | |
844 | msg = 0; |
837 | msg = 0; |
845 | maplore = 0; |
838 | maplore = 0; |
846 | shoprace = 0; |
839 | shoprace = 0; |
847 | delete [] shopitems, shopitems = 0; |
840 | delete [] shopitems, shopitems = 0; |
848 | |
841 | |
849 | for (int i = 0; i < 4; i++) |
842 | for (int i = 0; i < array_length (tile_path); i++) |
850 | tile_path [i] = 0; |
843 | tile_path [i] = 0; |
851 | } |
844 | } |
852 | |
845 | |
853 | maptile::~maptile () |
846 | maptile::~maptile () |
854 | { |
847 | { |
… | |
… | |
861 | /* We need to look through all the maps and see if any maps |
854 | /* We need to look through all the maps and see if any maps |
862 | * are pointing at this one for tiling information. Since |
855 | * are pointing at this one for tiling information. Since |
863 | * tiling can be asymetric, we just can not look to see which |
856 | * tiling can be asymetric, we just can not look to see which |
864 | * maps this map tiles with and clears those. |
857 | * maps this map tiles with and clears those. |
865 | */ |
858 | */ |
866 | for (int i = 0; i < 4; i++) |
859 | for (int i = 0; i < array_length (tile_path); i++) |
867 | if (tile_map[i] == m) |
860 | if (tile_map[i] == m) |
868 | tile_map[i] = 0; |
861 | tile_map[i] = 0; |
869 | } |
862 | } |
870 | |
863 | |
871 | void |
864 | void |
… | |
… | |
875 | |
868 | |
876 | clear (); |
869 | clear (); |
877 | } |
870 | } |
878 | |
871 | |
879 | /* decay and destroy perishable items in a map */ |
872 | /* decay and destroy perishable items in a map */ |
|
|
873 | // TODO: should be done regularly, not on map load? |
880 | void |
874 | void |
881 | maptile::do_decay_objects () |
875 | maptile::do_decay_objects () |
882 | { |
876 | { |
883 | if (!spaces) |
877 | if (!spaces) |
884 | return; |
878 | return; |
… | |
… | |
886 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
880 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
887 | for (object *above, *op = ms->bot; op; op = above) |
881 | for (object *above, *op = ms->bot; op; op = above) |
888 | { |
882 | { |
889 | above = op->above; |
883 | above = op->above; |
890 | |
884 | |
|
|
885 | // do not decay anything above unique floor tiles (yet :) |
|
|
886 | if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE]) |
|
|
887 | break; |
|
|
888 | |
891 | bool destroy = 0; |
889 | bool destroy = 0; |
892 | |
890 | |
893 | // do not decay anything above unique floor tiles (yet :) |
891 | if (op->flag [FLAG_IS_FLOOR] |
894 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
892 | || op->flag [FLAG_OBJ_ORIGINAL] |
895 | break; |
893 | || op->flag [FLAG_UNIQUE] |
896 | |
894 | || op->flag [FLAG_OVERLAY_FLOOR] |
897 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
895 | || op->flag [FLAG_UNPAID] |
898 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
|
|
899 | || QUERY_FLAG (op, FLAG_UNIQUE) |
|
|
900 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
|
|
901 | || QUERY_FLAG (op, FLAG_UNPAID) |
|
|
902 | || op->is_alive ()) |
896 | || op->is_alive ()) |
903 | ; // do not decay |
897 | ; // do not decay |
904 | else if (op->is_weapon ()) |
898 | else if (op->is_weapon ()) |
905 | { |
899 | { |
906 | op->stats.dam--; |
900 | op->stats.dam--; |
… | |
… | |
931 | || mat & M_LIQUID |
925 | || mat & M_LIQUID |
932 | || (mat & M_IRON && rndm (1, 5) == 1) |
926 | || (mat & M_IRON && rndm (1, 5) == 1) |
933 | || (mat & M_GLASS && rndm (1, 2) == 1) |
927 | || (mat & M_GLASS && rndm (1, 2) == 1) |
934 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
928 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
935 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
929 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
936 | || (mat & M_ICE && temp > 32)) |
930 | //|| (mat & M_ICE && temp > 32) |
|
|
931 | ) |
937 | destroy = 1; |
932 | destroy = 1; |
938 | } |
933 | } |
939 | |
934 | |
940 | /* adjust overall chance below */ |
935 | /* adjust overall chance below */ |
941 | if (destroy && rndm (0, 1)) |
936 | if (destroy && rndm (0, 1)) |
942 | op->destroy (true); |
937 | op->destroy (); |
943 | } |
|
|
944 | } |
|
|
945 | |
|
|
946 | /* |
|
|
947 | * Updates every button on the map (by calling update_button() for them). |
|
|
948 | */ |
|
|
949 | void |
|
|
950 | maptile::update_buttons () |
|
|
951 | { |
|
|
952 | for (oblinkpt *obp = buttons; obp; obp = obp->next) |
|
|
953 | for (objectlink *ol = obp->link; ol; ol = ol->next) |
|
|
954 | { |
|
|
955 | if (!ol->ob) |
|
|
956 | { |
|
|
957 | LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", |
|
|
958 | ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); |
|
|
959 | continue; |
|
|
960 | } |
|
|
961 | |
|
|
962 | if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL) |
|
|
963 | { |
|
|
964 | update_button (ol->ob); |
|
|
965 | break; |
|
|
966 | } |
|
|
967 | } |
938 | } |
968 | } |
939 | } |
969 | |
940 | |
970 | /* |
941 | /* |
971 | * This routine is supposed to find out the difficulty of the map. |
942 | * This routine is supposed to find out the difficulty of the map. |
972 | * difficulty does not have a lot to do with character level, |
943 | * difficulty does not have a lot to do with character level, |
973 | * but does have a lot to do with treasure on the map. |
944 | * but does have a lot to do with treasure on the map. |
974 | * |
945 | * |
975 | * Difficulty can now be set by the map creature. If the value stored |
946 | * Difficulty can now be set by the map creator. If the value stored |
976 | * in the map is zero, then use this routine. Maps should really |
947 | * in the map is zero, then use this routine. Maps should really |
977 | * have a difficulty set than using this function - human calculation |
948 | * have a difficulty set rather than using this function - human calculation |
978 | * is much better than this functions guesswork. |
949 | * is much better than this function's guesswork. |
979 | */ |
950 | */ |
980 | int |
951 | int |
981 | maptile::estimate_difficulty () const |
952 | maptile::estimate_difficulty () const |
982 | { |
953 | { |
983 | long monster_cnt = 0; |
954 | long monster_cnt = 0; |
… | |
… | |
985 | sint64 total_exp = 0; |
956 | sint64 total_exp = 0; |
986 | |
957 | |
987 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
958 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
988 | for (object *op = ms->bot; op; op = op->above) |
959 | for (object *op = ms->bot; op; op = op->above) |
989 | { |
960 | { |
990 | if (QUERY_FLAG (op, FLAG_MONSTER)) |
961 | if (op->flag [FLAG_MONSTER]) |
991 | { |
962 | { |
992 | total_exp += op->stats.exp; |
963 | total_exp += op->stats.exp; |
993 | monster_cnt++; |
964 | monster_cnt++; |
994 | } |
965 | } |
995 | |
966 | |
996 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
967 | if (op->flag [FLAG_GENERATOR]) |
997 | { |
968 | { |
998 | total_exp += op->stats.exp; |
969 | total_exp += op->stats.exp; |
999 | |
970 | |
1000 | if (archetype *at = op->other_arch) |
971 | if (archetype *at = op->other_arch) |
1001 | { |
972 | { |
… | |
… | |
1028 | * postive values make it darker, negative make it brighter |
999 | * postive values make it darker, negative make it brighter |
1029 | */ |
1000 | */ |
1030 | int |
1001 | int |
1031 | maptile::change_map_light (int change) |
1002 | maptile::change_map_light (int change) |
1032 | { |
1003 | { |
1033 | int new_level = darkness + change; |
|
|
1034 | |
|
|
1035 | /* Nothing to do */ |
1004 | /* Nothing to do */ |
1036 | if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) |
1005 | if (!change) |
1037 | return 0; |
1006 | return 0; |
1038 | |
1007 | |
1039 | /* inform all players on the map */ |
1008 | /* inform all players on the map */ |
1040 | if (change > 0) |
1009 | if (change > 0) |
1041 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1010 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1042 | else |
1011 | else |
1043 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1012 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1044 | |
1013 | |
1045 | /* Do extra checking. since darkness is a unsigned value, |
1014 | darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS); |
1046 | * we need to be extra careful about negative values. |
|
|
1047 | * In general, the checks below are only needed if change |
|
|
1048 | * is not +/-1 |
|
|
1049 | */ |
|
|
1050 | if (new_level < 0) |
|
|
1051 | darkness = 0; |
|
|
1052 | else if (new_level >= MAX_DARKNESS) |
|
|
1053 | darkness = MAX_DARKNESS; |
|
|
1054 | else |
|
|
1055 | darkness = new_level; |
|
|
1056 | |
1015 | |
1057 | /* All clients need to get re-updated for the change */ |
1016 | /* All clients need to get re-updated for the change */ |
1058 | update_all_map_los (this); |
1017 | update_all_map_los (this); |
1059 | |
1018 | |
1060 | return 1; |
1019 | return 1; |
… | |
… | |
1068 | */ |
1027 | */ |
1069 | void |
1028 | void |
1070 | mapspace::update_ () |
1029 | mapspace::update_ () |
1071 | { |
1030 | { |
1072 | object *last = 0; |
1031 | object *last = 0; |
1073 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1032 | uint8 flags = P_UPTODATE; |
|
|
1033 | sint8 light = 0; |
1074 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1034 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
|
|
1035 | uint64_t volume = 0; |
|
|
1036 | uint32_t items = 0; |
|
|
1037 | object *anywhere = 0; |
|
|
1038 | uint8_t middle_visibility = 0; |
1075 | |
1039 | |
1076 | //object *middle = 0; |
1040 | //object *middle = 0; |
1077 | //object *top = 0; |
1041 | //object *top = 0; |
1078 | //object *floor = 0; |
1042 | //object *floor = 0; |
1079 | // this seems to generate better code than using locals, above |
1043 | // this seems to generate better code than using locals, above |
1080 | object *&top = faces_obj[0] = 0; |
1044 | object *&top = faces_obj[0] = 0; |
1081 | object *&middle = faces_obj[1] = 0; |
1045 | object *&middle = faces_obj[1] = 0; |
1082 | object *&floor = faces_obj[2] = 0; |
1046 | object *&floor = faces_obj[2] = 0; |
1083 | |
1047 | |
|
|
1048 | object::flags_t allflags; // all flags of all objects or'ed together |
|
|
1049 | |
1084 | for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1050 | for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1085 | { |
1051 | { |
1086 | /* This could be made additive I guess (two lights better than |
1052 | // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C) |
1087 | * one). But if so, it shouldn't be a simple additive - 2 |
|
|
1088 | * light bulbs do not illuminate twice as far as once since |
|
|
1089 | * it is a dissapation factor that is cubed. |
|
|
1090 | */ |
|
|
1091 | light = max (light, tmp->glow_radius); |
1053 | light += tmp->glow_radius; |
1092 | |
1054 | |
1093 | /* This call is needed in order to update objects the player |
1055 | /* This call is needed in order to update objects the player |
1094 | * is standing in that have animations (ie, grass, fire, etc). |
1056 | * is standing in that have animations (ie, grass, fire, etc). |
1095 | * However, it also causes the look window to be re-drawn |
1057 | * However, it also causes the look window to be re-drawn |
1096 | * 3 times each time the player moves, because many of the |
1058 | * 3 times each time the player moves, because many of the |
1097 | * functions the move_player calls eventualy call this. |
1059 | * functions the move_player calls eventualy call this. |
1098 | * |
1060 | * |
1099 | * Always put the player down for drawing. |
1061 | * Always put the player down for drawing. |
1100 | */ |
1062 | */ |
1101 | if (!tmp->invisible) |
1063 | if (expect_true (!tmp->invisible)) |
1102 | { |
1064 | { |
1103 | if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) |
1065 | if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER])) |
1104 | top = tmp; |
1066 | top = tmp; |
1105 | else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1067 | else if (expect_false (tmp->flag [FLAG_IS_FLOOR])) |
1106 | { |
1068 | { |
1107 | /* If we got a floor, that means middle and top were below it, |
1069 | /* If we got a floor, that means middle and top were below it, |
1108 | * so should not be visible, so we clear them. |
1070 | * so should not be visible, so we clear them. |
1109 | */ |
1071 | */ |
1110 | middle = 0; |
1072 | middle = 0; |
1111 | top = 0; |
1073 | top = 0; |
1112 | floor = tmp; |
1074 | floor = tmp; |
|
|
1075 | volume = 0; |
|
|
1076 | items = 0; |
1113 | } |
1077 | } |
1114 | /* Flag anywhere have high priority */ |
1078 | else |
1115 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
|
|
1116 | { |
1079 | { |
|
|
1080 | if (expect_true (!tmp->flag [FLAG_NO_PICK])) |
|
|
1081 | { |
|
|
1082 | ++items; |
|
|
1083 | volume += tmp->volume (); |
|
|
1084 | } |
|
|
1085 | |
|
|
1086 | /* Flag anywhere have high priority */ |
|
|
1087 | if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE])) |
|
|
1088 | anywhere = tmp; |
|
|
1089 | |
|
|
1090 | /* Find the highest visible face around. If equal |
|
|
1091 | * visibilities, we still want the one nearer to the |
|
|
1092 | * top |
|
|
1093 | */ |
|
|
1094 | if (expect_false (::faces [tmp->face].visibility >= middle_visibility)) |
|
|
1095 | { |
|
|
1096 | middle_visibility = ::faces [tmp->face].visibility; |
1117 | middle = tmp; |
1097 | middle = tmp; |
1118 | anywhere = 1; |
1098 | } |
1119 | } |
1099 | } |
1120 | |
|
|
1121 | /* Find the highest visible face around. If equal |
|
|
1122 | * visibilities, we still want the one nearer to the |
|
|
1123 | * top |
|
|
1124 | */ |
|
|
1125 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) |
|
|
1126 | middle = tmp; |
|
|
1127 | } |
|
|
1128 | |
|
|
1129 | if (tmp == tmp->above) |
|
|
1130 | { |
|
|
1131 | LOG (llevError, "Error in structure of map\n"); |
|
|
1132 | exit (-1); |
|
|
1133 | } |
1100 | } |
1134 | |
1101 | |
1135 | move_slow |= tmp->move_slow; |
1102 | move_slow |= tmp->move_slow; |
1136 | move_block |= tmp->move_block; |
1103 | move_block |= tmp->move_block; |
1137 | move_on |= tmp->move_on; |
1104 | move_on |= tmp->move_on; |
1138 | move_off |= tmp->move_off; |
1105 | move_off |= tmp->move_off; |
1139 | move_allow |= tmp->move_allow; |
1106 | move_allow |= tmp->move_allow; |
1140 | |
1107 | |
1141 | if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; |
1108 | allflags |= tmp->flag; |
1142 | if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; |
1109 | |
1143 | if (tmp->type == PLAYER) flags |= P_PLAYER; |
1110 | if (tmp->type == PLAYER) flags |= P_PLAYER; |
1144 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1111 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1145 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
|
|
1146 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
|
|
1147 | } |
1112 | } |
1148 | |
1113 | |
1149 | this->light = light; |
1114 | // FLAG_SEE_ANYWHERE takes precedence |
|
|
1115 | if (anywhere) |
|
|
1116 | middle = anywhere; |
|
|
1117 | |
|
|
1118 | // ORing all flags together and checking them here is much faster |
|
|
1119 | if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW; |
|
|
1120 | if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC; |
|
|
1121 | if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE; |
|
|
1122 | if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC; |
|
|
1123 | |
|
|
1124 | this->light = min (light, MAX_LIGHT_RADIUS); |
1150 | this->flags_ = flags; |
1125 | this->flags_ = flags; |
1151 | this->move_block = move_block & ~move_allow; |
1126 | this->move_block = move_block & ~move_allow; |
1152 | this->move_on = move_on; |
1127 | this->move_on = move_on; |
1153 | this->move_off = move_off; |
1128 | this->move_off = move_off; |
1154 | this->move_slow = move_slow; |
1129 | this->move_slow = move_slow; |
|
|
1130 | this->volume_ = (volume + 1023) / 1024; |
|
|
1131 | this->items_ = upos_min (items, 65535); // assume nrof <= 2**31 |
1155 | |
1132 | |
1156 | /* At this point, we have a floor face (if there is a floor), |
1133 | /* At this point, we have a floor face (if there is a floor), |
1157 | * and the floor is set - we are not going to touch it at |
1134 | * and the floor is set - we are not going to touch it at |
1158 | * this point. |
1135 | * this point. |
1159 | * middle contains the highest visibility face. |
1136 | * middle contains the highest visibility face. |
… | |
… | |
1177 | */ |
1154 | */ |
1178 | |
1155 | |
1179 | for (object *tmp = last; tmp; tmp = tmp->below) |
1156 | for (object *tmp = last; tmp; tmp = tmp->below) |
1180 | { |
1157 | { |
1181 | /* Once we get to a floor, stop, since we already have a floor object */ |
1158 | /* Once we get to a floor, stop, since we already have a floor object */ |
1182 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1159 | if (tmp->flag [FLAG_IS_FLOOR]) |
1183 | break; |
1160 | break; |
1184 | |
1161 | |
1185 | /* If two top faces are already set, quit processing */ |
1162 | /* If two top faces are already set, quit processing */ |
1186 | if (top && middle) |
1163 | if (top && middle) |
1187 | break; |
1164 | break; |
… | |
… | |
1225 | faces_obj [1] = middle; |
1202 | faces_obj [1] = middle; |
1226 | faces_obj [2] = floor; |
1203 | faces_obj [2] = floor; |
1227 | #endif |
1204 | #endif |
1228 | } |
1205 | } |
1229 | |
1206 | |
1230 | uint64 |
1207 | maptile * |
1231 | mapspace::volume () const |
|
|
1232 | { |
|
|
1233 | uint64 vol = 0; |
|
|
1234 | |
|
|
1235 | for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below) |
|
|
1236 | vol += op->volume (); |
|
|
1237 | |
|
|
1238 | return vol; |
|
|
1239 | } |
|
|
1240 | |
|
|
1241 | bool |
|
|
1242 | maptile::tile_available (int dir, bool load) |
1208 | maptile::tile_available (int dir, bool load) |
1243 | { |
1209 | { |
1244 | if (!tile_path[dir]) |
1210 | if (tile_path[dir]) |
1245 | return 0; |
1211 | { |
1246 | |
1212 | // map is there and we don't need to load it OR it's loaded => return what we have |
1247 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1213 | if (tile_map[dir] && (!load || tile_map[dir]->linkable ())) |
1248 | return 1; |
1214 | return tile_map[dir]; |
1249 | |
1215 | |
|
|
1216 | // well, try to locate it then, if possible - maybe it's there already |
1250 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1217 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1251 | return 1; |
1218 | return tile_map[dir]; |
|
|
1219 | } |
1252 | |
1220 | |
1253 | return 0; |
1221 | return 0; |
1254 | } |
1222 | } |
1255 | |
1223 | |
1256 | /* this returns TRUE if the coordinates (x,y) are out of |
1224 | /* this returns TRUE if the coordinates (x,y) are out of |
… | |
… | |
1365 | /** |
1333 | /** |
1366 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1334 | * Return whether map2 is adjacent to map1. If so, store the distance from |
1367 | * map1 to map2 in dx/dy. |
1335 | * map1 to map2 in dx/dy. |
1368 | */ |
1336 | */ |
1369 | int |
1337 | int |
1370 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
1338 | adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy) |
1371 | { |
1339 | { |
1372 | if (!map1 || !map2) |
1340 | if (!map1 || !map2) |
1373 | return 0; |
1341 | return 0; |
1374 | |
1342 | |
1375 | //TODO: this doesn't actually check correctly when intermediate maps are not loaded |
1343 | //TODO: this doesn't actually check correctly when intermediate maps are not loaded |
… | |
… | |
1377 | if (map1 == map2) |
1345 | if (map1 == map2) |
1378 | { |
1346 | { |
1379 | *dx = 0; |
1347 | *dx = 0; |
1380 | *dy = 0; |
1348 | *dy = 0; |
1381 | } |
1349 | } |
1382 | else if (map1->tile_map[0] == map2) |
1350 | else if (map1->tile_available (TILE_NORTH, false) == map2) |
1383 | { /* up */ |
1351 | { |
1384 | *dx = 0; |
1352 | *dx = 0; |
1385 | *dy = -map2->height; |
1353 | *dy = -map2->height; |
1386 | } |
1354 | } |
1387 | else if (map1->tile_map[1] == map2) |
1355 | else if (map1->tile_available (TILE_EAST , false) == map2) |
1388 | { /* right */ |
1356 | { |
1389 | *dx = map1->width; |
1357 | *dx = map1->width; |
1390 | *dy = 0; |
1358 | *dy = 0; |
1391 | } |
1359 | } |
1392 | else if (map1->tile_map[2] == map2) |
1360 | else if (map1->tile_available (TILE_SOUTH, false) == map2) |
1393 | { /* down */ |
1361 | { |
1394 | *dx = 0; |
1362 | *dx = 0; |
1395 | *dy = map1->height; |
1363 | *dy = map1->height; |
1396 | } |
1364 | } |
1397 | else if (map1->tile_map[3] == map2) |
1365 | else if (map1->tile_available (TILE_WEST , false) == map2) |
1398 | { /* left */ |
1366 | { |
1399 | *dx = -map2->width; |
1367 | *dx = -map2->width; |
1400 | *dy = 0; |
1368 | *dy = 0; |
1401 | } |
1369 | } |
1402 | else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) |
1370 | else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2) |
1403 | { /* up right */ |
1371 | { /* up right */ |
1404 | *dx = map1->tile_map[0]->width; |
1372 | *dx = +map1->tile_map[TILE_NORTH]->width; |
1405 | *dy = -map1->tile_map[0]->height; |
1373 | *dy = -map1->tile_map[TILE_NORTH]->height; |
1406 | } |
1374 | } |
1407 | else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) |
1375 | else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2) |
1408 | { /* up left */ |
1376 | { /* up left */ |
1409 | *dx = -map2->width; |
1377 | *dx = -map2->width; |
1410 | *dy = -map1->tile_map[0]->height; |
1378 | *dy = -map1->tile_map[TILE_NORTH]->height; |
1411 | } |
1379 | } |
1412 | else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) |
1380 | else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2) |
1413 | { /* right up */ |
1381 | { /* right up */ |
1414 | *dx = map1->width; |
1382 | *dx = +map1->width; |
1415 | *dy = -map2->height; |
1383 | *dy = -map2->height; |
1416 | } |
1384 | } |
1417 | else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) |
1385 | else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2) |
1418 | { /* right down */ |
1386 | { /* right down */ |
1419 | *dx = map1->width; |
1387 | *dx = +map1->width; |
1420 | *dy = map1->tile_map[1]->height; |
1388 | *dy = +map1->tile_map[TILE_EAST]->height; |
1421 | } |
1389 | } |
1422 | else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) |
1390 | else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2) |
1423 | { /* down right */ |
1391 | { /* down right */ |
1424 | *dx = map1->tile_map[2]->width; |
1392 | *dx = +map1->tile_map[TILE_SOUTH]->width; |
1425 | *dy = map1->height; |
1393 | *dy = +map1->height; |
1426 | } |
1394 | } |
1427 | else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) |
1395 | else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2) |
1428 | { /* down left */ |
1396 | { /* down left */ |
1429 | *dx = -map2->width; |
1397 | *dx = -map2->width; |
1430 | *dy = map1->height; |
1398 | *dy = +map1->height; |
1431 | } |
1399 | } |
1432 | else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) |
1400 | else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2) |
1433 | { /* left up */ |
1401 | { /* left up */ |
1434 | *dx = -map1->tile_map[3]->width; |
1402 | *dx = -map1->tile_map[TILE_WEST]->width; |
1435 | *dy = -map2->height; |
1403 | *dy = -map2->height; |
1436 | } |
1404 | } |
1437 | else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) |
1405 | else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2) |
1438 | { /* left down */ |
1406 | { /* left down */ |
1439 | *dx = -map1->tile_map[3]->width; |
1407 | *dx = -map1->tile_map[TILE_WEST]->width; |
1440 | *dy = map1->tile_map[3]->height; |
1408 | *dy = +map1->tile_map[TILE_WEST]->height; |
1441 | } |
1409 | } |
1442 | else |
1410 | else |
1443 | return 0; |
1411 | return 0; |
1444 | |
1412 | |
1445 | return 1; |
1413 | return 1; |
… | |
… | |
1481 | * |
1449 | * |
1482 | * currently, the only flag supported (0x1) is don't translate for |
1450 | * currently, the only flag supported (0x1) is don't translate for |
1483 | * closest body part of 'op1' |
1451 | * closest body part of 'op1' |
1484 | */ |
1452 | */ |
1485 | void |
1453 | void |
1486 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1454 | get_rangevector (object *op1, object *op2, rv_vector *retval, int flags) |
1487 | { |
1455 | { |
1488 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1456 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1489 | { |
1457 | { |
1490 | /* be conservative and fill in _some_ data */ |
1458 | /* be conservative and fill in _some_ data */ |
1491 | retval->distance = 10000; |
1459 | retval->distance = 10000; |
1492 | retval->distance_x = 10000; |
1460 | retval->distance_x = 10000; |
1493 | retval->distance_y = 10000; |
1461 | retval->distance_y = 10000; |
1494 | retval->direction = 0; |
1462 | retval->direction = 0; |
1495 | retval->part = 0; |
1463 | retval->part = 0; |
1496 | } |
1464 | } |
1497 | else |
1465 | else |
1498 | { |
1466 | { |
1499 | object *best; |
|
|
1500 | |
|
|
1501 | retval->distance_x += op2->x - op1->x; |
1467 | retval->distance_x += op2->x - op1->x; |
1502 | retval->distance_y += op2->y - op1->y; |
1468 | retval->distance_y += op2->y - op1->y; |
1503 | |
1469 | |
1504 | best = op1; |
1470 | object *best = op1; |
|
|
1471 | |
1505 | /* If this is multipart, find the closest part now */ |
1472 | /* If this is multipart, find the closest part now */ |
1506 | if (!(flags & 0x1) && op1->more) |
1473 | if (!(flags & 1) && op1->more) |
1507 | { |
1474 | { |
1508 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1475 | int best_distance = idistance (retval->distance_x, retval->distance_y); |
1509 | |
1476 | |
1510 | /* we just take the offset of the piece to head to figure |
1477 | /* we just take the offset of the piece to head to figure |
1511 | * distance instead of doing all that work above again |
1478 | * distance instead of doing all that work above again |
1512 | * since the distance fields we set above are positive in the |
1479 | * since the distance fields we set above are positive in the |
1513 | * same axis as is used for multipart objects, the simply arithmetic |
1480 | * same axis as is used for multipart objects, the simply arithmetic |
1514 | * below works. |
1481 | * below works. |
1515 | */ |
1482 | */ |
1516 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1483 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1517 | { |
1484 | { |
1518 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1485 | int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y); |
1519 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1486 | |
1520 | if (tmpi < best_distance) |
1487 | if (tmpi < best_distance) |
1521 | { |
1488 | { |
1522 | best_distance = tmpi; |
1489 | best_distance = tmpi; |
1523 | best = tmp; |
1490 | best = tmp; |
1524 | } |
1491 | } |
1525 | } |
1492 | } |
1526 | |
1493 | |
1527 | if (best != op1) |
1494 | if (best != op1) |
1528 | { |
1495 | { |
1529 | retval->distance_x += op1->x - best->x; |
1496 | retval->distance_x += op1->x - best->x; |
1530 | retval->distance_y += op1->y - best->y; |
1497 | retval->distance_y += op1->y - best->y; |
1531 | } |
1498 | } |
1532 | } |
1499 | } |
1533 | |
1500 | |
1534 | retval->part = best; |
1501 | retval->part = best; |
1535 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1502 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1536 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1503 | retval->direction = find_dir_2 (retval->distance_x, retval->distance_y); |
1537 | } |
1504 | } |
1538 | } |
1505 | } |
1539 | |
1506 | |
1540 | /* this is basically the same as get_rangevector above, but instead of |
1507 | /* this is basically the same as get_rangevector above, but instead of |
1541 | * the first parameter being an object, it instead is the map |
1508 | * the first parameter being an object, it instead is the map |
… | |
… | |
1546 | * be more consistant with the above function and also in case they are needed |
1513 | * be more consistant with the above function and also in case they are needed |
1547 | * for something in the future. Also, since no object is pasted, the best |
1514 | * for something in the future. Also, since no object is pasted, the best |
1548 | * field of the rv_vector is set to NULL. |
1515 | * field of the rv_vector is set to NULL. |
1549 | */ |
1516 | */ |
1550 | void |
1517 | void |
1551 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1518 | get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1552 | { |
1519 | { |
1553 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1520 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1554 | { |
1521 | { |
1555 | /* be conservative and fill in _some_ data */ |
1522 | /* be conservative and fill in _some_ data */ |
1556 | retval->distance = 100000; |
1523 | retval->distance = 100000; |
1557 | retval->distance_x = 32767; |
1524 | retval->distance_x = 32767; |
1558 | retval->distance_y = 32767; |
1525 | retval->distance_y = 32767; |
1559 | retval->direction = 0; |
1526 | retval->direction = 0; |
1560 | retval->part = 0; |
1527 | retval->part = 0; |
1561 | } |
1528 | } |
1562 | else |
1529 | else |
1563 | { |
1530 | { |
1564 | retval->distance_x += op2->x - x; |
1531 | retval->distance_x += op2->x - x; |
1565 | retval->distance_y += op2->y - y; |
1532 | retval->distance_y += op2->y - y; |
1566 | |
1533 | |
1567 | retval->part = NULL; |
1534 | retval->part = 0; |
1568 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1535 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1569 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1536 | retval->direction = find_dir_2 (retval->distance_x, retval->distance_y); |
1570 | } |
1537 | } |
1571 | } |
1538 | } |
1572 | |
1539 | |
1573 | /* Returns true of op1 and op2 are effectively on the same map |
1540 | /* Returns true of op1 and op2 are effectively on the same map |
1574 | * (as related to map tiling). Note that this looks for a path from |
1541 | * (as related to map tiling). Note that this looks for a path from |
… | |
… | |
1584 | int dx, dy; |
1551 | int dx, dy; |
1585 | |
1552 | |
1586 | return adjacent_map (op1->map, op2->map, &dx, &dy); |
1553 | return adjacent_map (op1->map, op2->map, &dx, &dy); |
1587 | } |
1554 | } |
1588 | |
1555 | |
|
|
1556 | //-GPL |
|
|
1557 | |
1589 | object * |
1558 | object * |
1590 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1559 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1591 | { |
1560 | { |
1592 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1561 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1593 | } |
1562 | } |
… | |
… | |
1604 | if (default_region) |
1573 | if (default_region) |
1605 | return default_region; |
1574 | return default_region; |
1606 | |
1575 | |
1607 | return ::region::default_region (); |
1576 | return ::region::default_region (); |
1608 | } |
1577 | } |
|
|
1578 | |
|
|
1579 | //+GPL |
1609 | |
1580 | |
1610 | /* picks a random object from a style map. |
1581 | /* picks a random object from a style map. |
1611 | */ |
1582 | */ |
1612 | object * |
1583 | object * |
1613 | maptile::pick_random_object (rand_gen &gen) const |
1584 | maptile::pick_random_object (rand_gen &gen) const |
… | |
… | |
1620 | */ |
1591 | */ |
1621 | for (int i = 1000; --i;) |
1592 | for (int i = 1000; --i;) |
1622 | { |
1593 | { |
1623 | object *pick = at (gen (width), gen (height)).bot; |
1594 | object *pick = at (gen (width), gen (height)).bot; |
1624 | |
1595 | |
1625 | // do not prefer big monsters just because they are big. |
1596 | // must be head: do not prefer big monsters just because they are big. |
1626 | if (pick && pick->is_head ()) |
1597 | if (pick && pick->is_head ()) |
1627 | return pick->head_ (); |
1598 | return pick; |
1628 | } |
1599 | } |
1629 | |
1600 | |
1630 | // instead of crashing in the unlikely(?) case, try to return *something* |
1601 | // instead of crashing in the unlikely(?) case, try to return *something* |
1631 | return archetype::find ("bug"); |
1602 | return archetype::find (shstr_bug); |
1632 | } |
1603 | } |
|
|
1604 | |
|
|
1605 | //-GPL |
1633 | |
1606 | |
1634 | void |
1607 | void |
1635 | maptile::play_sound (faceidx sound, int x, int y) const |
1608 | maptile::play_sound (faceidx sound, int x, int y) const |
1636 | { |
1609 | { |
1637 | if (!sound) |
1610 | if (!sound) |
1638 | return; |
1611 | return; |
1639 | |
1612 | |
|
|
1613 | for_all_players_on_map (pl, this) |
|
|
1614 | if (client *ns = pl->ns) |
|
|
1615 | { |
|
|
1616 | int dx = x - pl->ob->x; |
|
|
1617 | int dy = y - pl->ob->y; |
|
|
1618 | |
|
|
1619 | int distance = idistance (dx, dy); |
|
|
1620 | |
|
|
1621 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1622 | ns->play_sound (sound, dx, dy); |
|
|
1623 | } |
|
|
1624 | } |
|
|
1625 | |
|
|
1626 | void |
|
|
1627 | maptile::say_msg (const char *msg, int x, int y) const |
|
|
1628 | { |
1640 | for_all_players (pl) |
1629 | for_all_players (pl) |
1641 | if (pl->ob->map == this) |
|
|
1642 | if (client *ns = pl->ns) |
1630 | if (client *ns = pl->ns) |
1643 | { |
1631 | { |
1644 | int dx = x - pl->ob->x; |
1632 | int dx = x - pl->ob->x; |
1645 | int dy = y - pl->ob->y; |
1633 | int dy = y - pl->ob->y; |
1646 | |
1634 | |
1647 | int distance = idistance (dx, dy); |
1635 | int distance = idistance (dx, dy); |
1648 | |
1636 | |
1649 | if (distance <= MAX_SOUND_DISTANCE) |
1637 | if (distance <= MAX_SOUND_DISTANCE) |
1650 | ns->play_sound (sound, dx, dy); |
1638 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
1651 | } |
1639 | } |
1652 | } |
1640 | } |
1653 | |
1641 | |
|
|
1642 | dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25); |
|
|
1643 | |
|
|
1644 | static void |
|
|
1645 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
|
|
1646 | { |
|
|
1647 | // clip to map to the left |
|
|
1648 | if (x0 < 0) |
|
|
1649 | { |
|
|
1650 | if (maptile *tile = m->tile_available (TILE_WEST, 1)) |
|
|
1651 | split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy); |
|
|
1652 | |
|
|
1653 | if (x1 < 0) // entirely to the left |
|
|
1654 | return; |
|
|
1655 | |
|
|
1656 | x0 = 0; |
|
|
1657 | } |
|
|
1658 | |
|
|
1659 | // clip to map to the right |
|
|
1660 | if (x1 > m->width) |
|
|
1661 | { |
|
|
1662 | if (maptile *tile = m->tile_available (TILE_EAST, 1)) |
|
|
1663 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
|
|
1664 | |
|
|
1665 | if (x0 > m->width) // entirely to the right |
|
|
1666 | return; |
|
|
1667 | |
|
|
1668 | x1 = m->width; |
|
|
1669 | } |
|
|
1670 | |
|
|
1671 | // clip to map above |
|
|
1672 | if (y0 < 0) |
|
|
1673 | { |
|
|
1674 | if (maptile *tile = m->tile_available (TILE_NORTH, 1)) |
|
|
1675 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
|
|
1676 | |
|
|
1677 | if (y1 < 0) // entirely above |
|
|
1678 | return; |
|
|
1679 | |
|
|
1680 | y0 = 0; |
|
|
1681 | } |
|
|
1682 | |
|
|
1683 | // clip to map below |
|
|
1684 | if (y1 > m->height) |
|
|
1685 | { |
|
|
1686 | if (maptile *tile = m->tile_available (TILE_SOUTH, 1)) |
|
|
1687 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
|
|
1688 | |
|
|
1689 | if (y0 > m->height) // entirely below |
|
|
1690 | return; |
|
|
1691 | |
|
|
1692 | y1 = m->height; |
|
|
1693 | } |
|
|
1694 | |
|
|
1695 | // if we get here, the rect is within the current map |
|
|
1696 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1697 | |
|
|
1698 | r->m = m; |
|
|
1699 | r->x0 = x0; |
|
|
1700 | r->y0 = y0; |
|
|
1701 | r->x1 = x1; |
|
|
1702 | r->y1 = y1; |
|
|
1703 | r->dx = dx; |
|
|
1704 | r->dy = dy; |
|
|
1705 | } |
|
|
1706 | |
|
|
1707 | maprect * |
|
|
1708 | maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1) |
|
|
1709 | { |
|
|
1710 | buf.clear (); |
|
|
1711 | |
|
|
1712 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
|
|
1713 | |
|
|
1714 | // add end marker |
|
|
1715 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1716 | r->m = 0; |
|
|
1717 | |
|
|
1718 | return (maprect *)buf.linearise (); |
|
|
1719 | } |
|
|
1720 | |