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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * 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 | |
|
|
28 | #include "loader.h" |
28 | #include "loader.h" |
29 | |
|
|
30 | #include "path.h" |
29 | #include "path.h" |
|
|
30 | |
|
|
31 | //+GPL |
|
|
32 | |
|
|
33 | sint8 maptile::outdoor_darkness; |
31 | |
34 | |
32 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
35 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
33 | * one function that just returns a P_.. value (see map.h) |
36 | * one function that just returns a P_.. value (see map.h) |
34 | * it will also do map translation for tiled maps, returning |
37 | * it will also do map translation for tiled maps, returning |
35 | * new values into newmap, nx, and ny. Any and all of those |
38 | * new values into newmap, nx, and ny. Any and all of those |
… | |
… | |
70 | * by the caller. |
73 | * by the caller. |
71 | */ |
74 | */ |
72 | int |
75 | int |
73 | blocked_link (object *ob, maptile *m, int sx, int sy) |
76 | blocked_link (object *ob, maptile *m, int sx, int sy) |
74 | { |
77 | { |
75 | object *tmp; |
|
|
76 | int mflags, blocked; |
|
|
77 | |
|
|
78 | /* Make sure the coordinates are valid - they should be, as caller should |
78 | /* Make sure the coordinates are valid - they should be, as caller should |
79 | * have already checked this. |
79 | * have already checked this. |
80 | */ |
80 | */ |
81 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
81 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
82 | { |
82 | { |
83 | LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
83 | LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
84 | return 1; |
84 | return 1; |
85 | } |
85 | } |
86 | |
86 | |
87 | /* Save some cycles - instead of calling get_map_flags(), just get the value |
87 | mapspace &ms = m->at (sx, sy); |
88 | * directly. |
|
|
89 | */ |
|
|
90 | mflags = m->at (sx, sy).flags (); |
|
|
91 | |
88 | |
92 | blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); |
89 | int mflags = ms.flags (); |
|
|
90 | int blocked = ms.move_block; |
93 | |
91 | |
94 | /* If space is currently not blocked by anything, no need to |
92 | /* If space is currently not blocked by anything, no need to |
95 | * go further. Not true for players - all sorts of special |
93 | * go further. Not true for players - all sorts of special |
96 | * things we need to do for players. |
94 | * things we need to do for players. |
97 | */ |
95 | */ |
98 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
96 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
99 | return 0; |
97 | return 0; |
100 | |
98 | |
101 | /* if there isn't anytyhing alive on this space, and this space isn't |
99 | /* if there isn't anything alive on this space, and this space isn't |
102 | * otherwise blocked, we can return now. Only if there is a living |
100 | * otherwise blocked, we can return now. Only if there is a living |
103 | * creature do we need to investigate if it is part of this creature |
101 | * creature do we need to investigate if it is part of this creature |
104 | * or another. Likewise, only if something is blocking us do we |
102 | * or another. Likewise, only if something is blocking us do we |
105 | * need to investigate if there is a special circumstance that would |
103 | * need to investigate if there is a special circumstance that would |
106 | * let the player through (inventory checkers for example) |
104 | * let the player through (inventory checkers for example) |
… | |
… | |
113 | /* We basically go through the stack of objects, and if there is |
111 | /* We basically go through the stack of objects, and if there is |
114 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
112 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
115 | * true. If we get through the entire stack, that must mean |
113 | * true. If we get through the entire stack, that must mean |
116 | * ob is blocking it, so return 0. |
114 | * ob is blocking it, so return 0. |
117 | */ |
115 | */ |
118 | for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) |
116 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
119 | { |
117 | { |
120 | |
118 | if (OB_MOVE_BLOCK (ob, tmp)) |
121 | /* This must be before the checks below. Code for inventory checkers. */ |
|
|
122 | if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp)) |
|
|
123 | { |
119 | { |
124 | /* If last_sp is set, the player/monster needs an object, |
120 | if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob)) |
125 | * so we check for it. If they don't have it, they can't |
121 | if (RESULT_INT (0)) |
126 | * pass through this space. |
122 | return 1; |
127 | */ |
123 | else |
128 | if (tmp->last_sp) |
124 | continue; |
|
|
125 | |
|
|
126 | if (tmp->type == CHECK_INV) |
129 | { |
127 | { |
130 | if (check_inv_recursive (ob, tmp) == NULL) |
128 | bool have = check_inv_recursive (ob, tmp); |
|
|
129 | |
|
|
130 | // last_sp set means we block if we don't have. |
|
|
131 | if (logical_xor (have, tmp->last_sp)) |
131 | return 1; |
132 | return 1; |
132 | else |
133 | } |
133 | continue; |
134 | else if (tmp->type == T_MATCH) |
|
|
135 | { |
|
|
136 | // T_MATCH allows "entrance" iff the match is true |
|
|
137 | // == blocks if the match fails |
|
|
138 | |
|
|
139 | // we could have used an INVOKE_OBJECT, but decided against it, as we |
|
|
140 | // assume that T_MATCH is relatively common. |
|
|
141 | if (!match (tmp->slaying, ob, tmp, ob)) |
|
|
142 | return 1; |
134 | } |
143 | } |
135 | else |
144 | else |
136 | { |
145 | return 1; // unconditional block |
137 | /* In this case, the player must not have the object - |
146 | |
138 | * if they do, they can't pass through. |
|
|
139 | */ |
|
|
140 | if (check_inv_recursive (ob, tmp) != NULL) /* player has object */ |
|
|
141 | return 1; |
|
|
142 | else |
|
|
143 | continue; |
|
|
144 | } |
|
|
145 | } /* if check_inv */ |
|
|
146 | else |
147 | } else { |
147 | { |
148 | // space does not block the ob, directly, but |
148 | /* Broke apart a big nasty if into several here to make |
149 | // anything alive that is not a door still |
149 | * this more readable. first check - if the space blocks |
150 | // blocks anything but wizards. |
150 | * movement, can't move here. |
|
|
151 | * second - if a monster, can't move there, unless it is a |
|
|
152 | * hidden dm |
|
|
153 | */ |
|
|
154 | if (OB_MOVE_BLOCK (ob, tmp)) |
|
|
155 | return 1; |
|
|
156 | |
151 | |
157 | if (tmp->flag [FLAG_ALIVE] |
152 | if (tmp->flag [FLAG_ALIVE] |
158 | && tmp->head_ () != ob |
153 | && tmp->head_ () != ob |
159 | && tmp != ob |
154 | && tmp != ob |
160 | && tmp->type != DOOR |
155 | && tmp->type != DOOR) |
161 | && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) |
|
|
162 | return 1; |
156 | return 1; |
163 | } |
157 | } |
164 | |
|
|
165 | } |
158 | } |
|
|
159 | |
166 | return 0; |
160 | return 0; |
167 | } |
161 | } |
168 | |
162 | |
169 | /* |
163 | /* |
170 | * Returns qthe blocking object if the given object can't fit in the given |
164 | * Returns qthe blocking object if the given object can't fit in the given |
… | |
… | |
222 | } |
216 | } |
223 | |
217 | |
224 | return 0; |
218 | return 0; |
225 | } |
219 | } |
226 | |
220 | |
227 | /* When the map is loaded, load_object does not actually insert objects |
221 | //-GPL |
228 | * into inventory, but just links them. What this does is go through |
|
|
229 | * and insert them properly. |
|
|
230 | * The object 'container' is the object that contains the inventory. |
|
|
231 | * This is needed so that we can update the containers weight. |
|
|
232 | */ |
|
|
233 | void |
|
|
234 | fix_container (object *container) |
|
|
235 | { |
|
|
236 | object *tmp = container->inv, *next; |
|
|
237 | |
|
|
238 | container->inv = 0; |
|
|
239 | while (tmp) |
|
|
240 | { |
|
|
241 | next = tmp->below; |
|
|
242 | if (tmp->inv) |
|
|
243 | fix_container (tmp); |
|
|
244 | |
|
|
245 | insert_ob_in_ob (tmp, container); |
|
|
246 | tmp = next; |
|
|
247 | } |
|
|
248 | |
|
|
249 | // go through and calculate what all the containers are carrying. |
|
|
250 | //TODO: remove |
|
|
251 | container->update_weight (); |
|
|
252 | } |
|
|
253 | |
222 | |
254 | void |
223 | void |
255 | maptile::set_object_flag (int flag, int value) |
224 | maptile::set_object_flag (int flag, int value) |
256 | { |
225 | { |
257 | if (!spaces) |
226 | if (!spaces) |
… | |
… | |
259 | |
228 | |
260 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
229 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
261 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
230 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
262 | tmp->flag [flag] = value; |
231 | tmp->flag [flag] = value; |
263 | } |
232 | } |
|
|
233 | |
|
|
234 | void |
|
|
235 | maptile::post_load_original () |
|
|
236 | { |
|
|
237 | if (!spaces) |
|
|
238 | return; |
|
|
239 | |
|
|
240 | set_object_flag (FLAG_OBJ_ORIGINAL); |
|
|
241 | |
|
|
242 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
243 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
|
|
244 | INVOKE_OBJECT (RESET, tmp); |
|
|
245 | } |
|
|
246 | |
|
|
247 | void |
|
|
248 | maptile::post_load () |
|
|
249 | { |
|
|
250 | #if 0 |
|
|
251 | if (!spaces) |
|
|
252 | return; |
|
|
253 | |
|
|
254 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
255 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
|
|
256 | ; // nop |
|
|
257 | #endif |
|
|
258 | } |
|
|
259 | |
|
|
260 | //+GPL |
264 | |
261 | |
265 | /* link_multipart_objects go through all the objects on the map looking |
262 | /* link_multipart_objects go through all the objects on the map looking |
266 | * for objects whose arch says they are multipart yet according to the |
263 | * for objects whose arch says they are multipart yet according to the |
267 | * info we have, they only have the head (as would be expected when |
264 | * info we have, they only have the head (as would be expected when |
268 | * they are saved). |
265 | * they are saved). |
… | |
… | |
296 | op = op->above; |
293 | op = op->above; |
297 | } |
294 | } |
298 | } |
295 | } |
299 | } |
296 | } |
300 | |
297 | |
|
|
298 | //-GPL |
|
|
299 | |
301 | /* |
300 | /* |
302 | * Loads (ands parses) the objects into a given map from the specified |
301 | * Loads (ands parses) the objects into a given map from the specified |
303 | * file pointer. |
302 | * file pointer. |
304 | */ |
303 | */ |
305 | bool |
304 | bool |
… | |
… | |
321 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
320 | if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) |
322 | { |
321 | { |
323 | // we insert manually because |
322 | // we insert manually because |
324 | // a) its way faster |
323 | // a) its way faster |
325 | // b) we remove manually, too, and there are good reasons for that |
324 | // b) we remove manually, too, and there are good reasons for that |
326 | // c) its correct |
325 | // c) it's correct |
327 | mapspace &ms = at (op->x, op->y); |
326 | mapspace &ms = at (op->x, op->y); |
328 | |
327 | |
329 | op->flag [FLAG_REMOVED] = false; |
328 | op->flag [FLAG_REMOVED] = false; |
330 | |
329 | |
331 | op->above = 0; |
330 | op->above = 0; |
332 | op->below = ms.top; |
331 | op->below = ms.top; |
333 | |
332 | |
334 | if (ms.top) |
|
|
335 | ms.top->above = op; |
333 | *(ms.top ? &ms.top->above : &ms.bot) = op; |
336 | else |
|
|
337 | ms.bot = op; |
|
|
338 | |
334 | |
339 | ms.top = op; |
335 | ms.top = op; |
340 | ms.flags_ = 0; |
336 | ms.flags_ = 0; |
341 | } |
337 | } |
342 | else |
338 | else |
… | |
… | |
437 | * map archetype. Mimic that behaviour. |
433 | * map archetype. Mimic that behaviour. |
438 | */ |
434 | */ |
439 | width = 16; |
435 | width = 16; |
440 | height = 16; |
436 | height = 16; |
441 | timeout = 300; |
437 | timeout = 300; |
442 | max_nrof = 1000; // 1000 items of anything |
438 | max_items = MAX_ITEM_PER_ACTION; |
443 | max_volume = 2000000; // 2m³ |
439 | max_volume = 2000000; // 2m³ |
444 | } |
440 | } |
445 | |
441 | |
446 | maptile::maptile (int w, int h) |
442 | maptile::maptile (int w, int h) |
447 | { |
443 | { |
… | |
… | |
468 | if (spaces) |
464 | if (spaces) |
469 | return; |
465 | return; |
470 | |
466 | |
471 | spaces = salloc0<mapspace> (size ()); |
467 | spaces = salloc0<mapspace> (size ()); |
472 | } |
468 | } |
|
|
469 | |
|
|
470 | //+GPL |
473 | |
471 | |
474 | /* Takes a string from a map definition and outputs a pointer to the array of shopitems |
472 | /* Takes a string from a map definition and outputs a pointer to the array of shopitems |
475 | * corresponding to that string. Memory is allocated for this, it must be freed |
473 | * corresponding to that string. Memory is allocated for this, it must be freed |
476 | * at a later date. |
474 | * at a later date. |
477 | * Called by parse_map_headers below. |
475 | * Called by parse_map_headers below. |
… | |
… | |
554 | return items; |
552 | return items; |
555 | } |
553 | } |
556 | |
554 | |
557 | /* opposite of parse string, this puts the string that was originally fed in to |
555 | /* opposite of parse string, this puts the string that was originally fed in to |
558 | * the map (or something equivilent) into output_string. */ |
556 | * the map (or something equivilent) into output_string. */ |
559 | static void |
557 | static const char * |
560 | print_shop_string (maptile *m, char *output_string) |
558 | print_shop_string (maptile *m) |
561 | { |
559 | { |
562 | int i; |
560 | static dynbuf_text buf; buf.clear (); |
563 | char tmp[MAX_BUF]; |
|
|
564 | |
561 | |
565 | strcpy (output_string, ""); |
|
|
566 | for (i = 0; i < m->shopitems[0].index; i++) |
562 | for (int i = 0; i < m->shopitems[0].index; i++) |
567 | { |
563 | { |
568 | if (m->shopitems[i].typenum) |
564 | if (m->shopitems[i].typenum) |
569 | { |
565 | { |
570 | if (m->shopitems[i].strength) |
566 | if (m->shopitems[i].strength) |
571 | sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
567 | buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
572 | else |
568 | else |
573 | sprintf (tmp, "%s;", m->shopitems[i].name); |
569 | buf.printf ("%s;", m->shopitems[i].name); |
574 | } |
570 | } |
575 | else |
571 | else |
576 | { |
572 | { |
577 | if (m->shopitems[i].strength) |
573 | if (m->shopitems[i].strength) |
578 | sprintf (tmp, "*:%d;", m->shopitems[i].strength); |
574 | buf.printf ("*:%d;", m->shopitems[i].strength); |
579 | else |
575 | else |
580 | sprintf (tmp, "*"); |
576 | buf.printf ("*"); |
581 | } |
577 | } |
582 | |
|
|
583 | strcat (output_string, tmp); |
|
|
584 | } |
578 | } |
|
|
579 | |
|
|
580 | return buf; |
585 | } |
581 | } |
|
|
582 | |
|
|
583 | //-GPL |
586 | |
584 | |
587 | /* This loads the header information of the map. The header |
585 | /* This loads the header information of the map. The header |
588 | * contains things like difficulty, size, timeout, etc. |
586 | * contains things like difficulty, size, timeout, etc. |
589 | * this used to be stored in the map object, but with the |
587 | * this used to be stored in the map object, but with the |
590 | * addition of tiling, fields beyond that easily named in an |
588 | * addition of tiling, fields beyond that easily named in an |
… | |
… | |
631 | case KW_shopgreed: thawer.get (shopgreed); break; |
629 | case KW_shopgreed: thawer.get (shopgreed); break; |
632 | case KW_shopmin: thawer.get (shopmin); break; |
630 | case KW_shopmin: thawer.get (shopmin); break; |
633 | case KW_shopmax: thawer.get (shopmax); break; |
631 | case KW_shopmax: thawer.get (shopmax); break; |
634 | case KW_shoprace: thawer.get (shoprace); break; |
632 | case KW_shoprace: thawer.get (shoprace); break; |
635 | case KW_outdoor: thawer.get (outdoor); break; |
633 | case KW_outdoor: thawer.get (outdoor); break; |
636 | case KW_temp: thawer.get (temp); break; |
|
|
637 | case KW_pressure: thawer.get (pressure); break; |
|
|
638 | case KW_humid: thawer.get (humid); break; |
|
|
639 | case KW_windspeed: thawer.get (windspeed); break; |
|
|
640 | case KW_winddir: thawer.get (winddir); break; |
|
|
641 | case KW_sky: thawer.get (sky); break; |
|
|
642 | |
634 | |
643 | case KW_per_player: thawer.get (per_player); break; |
635 | case KW_per_player: thawer.get (per_player); break; |
644 | case KW_per_party: thawer.get (per_party); break; |
636 | case KW_per_party: thawer.get (per_party); break; |
645 | case KW_no_reset: thawer.get (no_reset); break; |
637 | case KW_no_reset: thawer.get (no_reset); break; |
|
|
638 | case KW_no_drop: thawer.get (no_drop); break; |
646 | |
639 | |
647 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
640 | case KW_region: default_region = region::find (thawer.get_str ()); break; |
648 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
641 | case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; |
649 | |
642 | |
650 | // old names new names |
643 | // old names new names |
… | |
… | |
681 | } |
674 | } |
682 | |
675 | |
683 | abort (); |
676 | abort (); |
684 | } |
677 | } |
685 | |
678 | |
|
|
679 | //+GPL |
|
|
680 | |
686 | /****************************************************************************** |
681 | /****************************************************************************** |
687 | * This is the start of unique map handling code |
682 | * This is the start of unique map handling code |
688 | *****************************************************************************/ |
683 | *****************************************************************************/ |
689 | |
684 | |
690 | /* This goes through the maptile and removed any unique items on the map. */ |
685 | /* This goes through the maptile and removed any unique items on the map. */ |
… | |
… | |
700 | |
695 | |
701 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
696 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
702 | unique = 1; |
697 | unique = 1; |
703 | |
698 | |
704 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
699 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
705 | { |
|
|
706 | op->destroy_inv (false); |
|
|
707 | op->destroy (); |
700 | op->destroy (); |
708 | } |
|
|
709 | |
701 | |
710 | op = above; |
702 | op = above; |
711 | } |
703 | } |
712 | } |
704 | } |
713 | } |
705 | } |
714 | |
706 | |
|
|
707 | //-GPL |
|
|
708 | |
715 | bool |
709 | bool |
716 | maptile::_save_header (object_freezer &freezer) |
710 | maptile::_save_header (object_freezer &freezer) |
717 | { |
711 | { |
718 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
712 | #define MAP_OUT(k) freezer.put (KW(k), k) |
719 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
713 | #define MAP_OUT2(k,v) freezer.put (KW(k), v) |
720 | |
714 | |
721 | MAP_OUT2 (arch, "map"); |
715 | MAP_OUT2 (arch, CS(map)); |
722 | |
716 | |
723 | if (name) MAP_OUT (name); |
717 | if (name) MAP_OUT (name); |
724 | MAP_OUT (swap_time); |
718 | MAP_OUT (swap_time); |
725 | MAP_OUT (reset_time); |
719 | MAP_OUT (reset_time); |
726 | MAP_OUT (reset_timeout); |
720 | MAP_OUT (reset_timeout); |
727 | MAP_OUT (fixed_resettime); |
721 | MAP_OUT (fixed_resettime); |
728 | MAP_OUT (no_reset); |
722 | MAP_OUT (no_reset); |
|
|
723 | MAP_OUT (no_drop); |
729 | MAP_OUT (difficulty); |
724 | MAP_OUT (difficulty); |
730 | |
|
|
731 | if (default_region) MAP_OUT2 (region, default_region->name); |
725 | if (default_region) MAP_OUT2 (region, default_region->name); |
732 | |
726 | |
733 | if (shopitems) |
727 | if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this)); |
734 | { |
|
|
735 | char shop[MAX_BUF]; |
|
|
736 | print_shop_string (this, shop); |
|
|
737 | MAP_OUT2 (shopitems, shop); |
|
|
738 | } |
|
|
739 | |
|
|
740 | MAP_OUT (shopgreed); |
728 | MAP_OUT (shopgreed); |
741 | MAP_OUT (shopmin); |
729 | MAP_OUT (shopmin); |
742 | MAP_OUT (shopmax); |
730 | MAP_OUT (shopmax); |
743 | if (shoprace) MAP_OUT (shoprace); |
731 | if (shoprace) MAP_OUT (shoprace); |
744 | MAP_OUT (darkness); |
732 | |
745 | MAP_OUT (width); |
733 | MAP_OUT (width); |
746 | MAP_OUT (height); |
734 | MAP_OUT (height); |
747 | MAP_OUT (enter_x); |
735 | MAP_OUT (enter_x); |
748 | MAP_OUT (enter_y); |
736 | MAP_OUT (enter_y); |
749 | |
737 | MAP_OUT (darkness); |
750 | if (msg) freezer.put (KW_msg , KW_endmsg , msg); |
|
|
751 | if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore); |
|
|
752 | |
|
|
753 | MAP_OUT (outdoor); |
738 | MAP_OUT (outdoor); |
754 | MAP_OUT (temp); |
739 | |
755 | MAP_OUT (pressure); |
740 | if (msg) freezer.put (KW(msg) , KW(endmsg) , msg); |
756 | MAP_OUT (humid); |
741 | if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore); |
757 | MAP_OUT (windspeed); |
|
|
758 | MAP_OUT (winddir); |
|
|
759 | MAP_OUT (sky); |
|
|
760 | |
742 | |
761 | MAP_OUT (per_player); |
743 | MAP_OUT (per_player); |
762 | MAP_OUT (per_party); |
744 | MAP_OUT (per_party); |
763 | |
745 | |
764 | if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); |
746 | if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); |
765 | if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); |
747 | if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); |
766 | if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); |
748 | if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); |
767 | if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); |
749 | if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); |
768 | |
750 | |
769 | freezer.put (this); |
751 | freezer.put (this); |
770 | freezer.put (KW_end); |
752 | freezer.put (KW(end)); |
771 | |
753 | |
772 | return true; |
754 | return true; |
773 | } |
755 | } |
774 | |
756 | |
775 | bool |
757 | bool |
… | |
… | |
780 | if (!_save_header (freezer)) |
762 | if (!_save_header (freezer)) |
781 | return false; |
763 | return false; |
782 | |
764 | |
783 | return freezer.save (path); |
765 | return freezer.save (path); |
784 | } |
766 | } |
|
|
767 | |
|
|
768 | //+GPL |
785 | |
769 | |
786 | /* |
770 | /* |
787 | * Remove and free all objects in the given map. |
771 | * Remove and free all objects in the given map. |
788 | */ |
772 | */ |
789 | void |
773 | void |
… | |
… | |
800 | |
784 | |
801 | op->flag [FLAG_REMOVED] = true; |
785 | op->flag [FLAG_REMOVED] = true; |
802 | |
786 | |
803 | object *head = op->head_ (); |
787 | object *head = op->head_ (); |
804 | if (op == head) |
788 | if (op == head) |
805 | { |
|
|
806 | op->destroy_inv (false); |
|
|
807 | op->destroy (); |
789 | op->destroy (); |
808 | } |
|
|
809 | else if (head->map != op->map) |
790 | else if (head->map != op->map) |
810 | { |
791 | { |
811 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
792 | LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); |
812 | head->destroy (); |
793 | head->destroy (); |
813 | } |
794 | } |
… | |
… | |
861 | |
842 | |
862 | clear (); |
843 | clear (); |
863 | } |
844 | } |
864 | |
845 | |
865 | /* decay and destroy perishable items in a map */ |
846 | /* decay and destroy perishable items in a map */ |
|
|
847 | // TODO: should be done regularly, not on map load? |
866 | void |
848 | void |
867 | maptile::do_decay_objects () |
849 | maptile::do_decay_objects () |
868 | { |
850 | { |
869 | if (!spaces) |
851 | if (!spaces) |
870 | return; |
852 | return; |
… | |
… | |
917 | || mat & M_LIQUID |
899 | || mat & M_LIQUID |
918 | || (mat & M_IRON && rndm (1, 5) == 1) |
900 | || (mat & M_IRON && rndm (1, 5) == 1) |
919 | || (mat & M_GLASS && rndm (1, 2) == 1) |
901 | || (mat & M_GLASS && rndm (1, 2) == 1) |
920 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
902 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
921 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
903 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
922 | || (mat & M_ICE && temp > 32)) |
904 | //|| (mat & M_ICE && temp > 32) |
|
|
905 | ) |
923 | destroy = 1; |
906 | destroy = 1; |
924 | } |
907 | } |
925 | |
908 | |
926 | /* adjust overall chance below */ |
909 | /* adjust overall chance below */ |
927 | if (destroy && rndm (0, 1)) |
910 | if (destroy && rndm (0, 1)) |
928 | op->destroy (); |
911 | op->destroy (); |
929 | } |
|
|
930 | } |
|
|
931 | |
|
|
932 | /* |
|
|
933 | * Updates every button on the map (by calling update_button() for them). |
|
|
934 | */ |
|
|
935 | void |
|
|
936 | maptile::update_buttons () |
|
|
937 | { |
|
|
938 | for (oblinkpt *obp = buttons; obp; obp = obp->next) |
|
|
939 | for (objectlink *ol = obp->link; ol; ol = ol->next) |
|
|
940 | { |
|
|
941 | if (!ol->ob) |
|
|
942 | { |
|
|
943 | LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", |
|
|
944 | ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); |
|
|
945 | continue; |
|
|
946 | } |
|
|
947 | |
|
|
948 | if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL) |
|
|
949 | { |
|
|
950 | update_button (ol->ob); |
|
|
951 | break; |
|
|
952 | } |
|
|
953 | } |
912 | } |
954 | } |
913 | } |
955 | |
914 | |
956 | /* |
915 | /* |
957 | * This routine is supposed to find out the difficulty of the map. |
916 | * This routine is supposed to find out the difficulty of the map. |
958 | * difficulty does not have a lot to do with character level, |
917 | * difficulty does not have a lot to do with character level, |
959 | * but does have a lot to do with treasure on the map. |
918 | * but does have a lot to do with treasure on the map. |
960 | * |
919 | * |
961 | * Difficulty can now be set by the map creature. If the value stored |
920 | * Difficulty can now be set by the map creator. If the value stored |
962 | * in the map is zero, then use this routine. Maps should really |
921 | * in the map is zero, then use this routine. Maps should really |
963 | * have a difficulty set than using this function - human calculation |
922 | * have a difficulty set rather than using this function - human calculation |
964 | * is much better than this functions guesswork. |
923 | * is much better than this function's guesswork. |
965 | */ |
924 | */ |
966 | int |
925 | int |
967 | maptile::estimate_difficulty () const |
926 | maptile::estimate_difficulty () const |
968 | { |
927 | { |
969 | long monster_cnt = 0; |
928 | long monster_cnt = 0; |
… | |
… | |
981 | |
940 | |
982 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
941 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
983 | { |
942 | { |
984 | total_exp += op->stats.exp; |
943 | total_exp += op->stats.exp; |
985 | |
944 | |
986 | if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) |
945 | if (archetype *at = op->other_arch) |
|
|
946 | { |
987 | total_exp += at->stats.exp * 8; |
947 | total_exp += at->stats.exp * 8; |
988 | |
|
|
989 | monster_cnt++; |
948 | monster_cnt++; |
|
|
949 | } |
|
|
950 | |
|
|
951 | for (object *inv = op->inv; inv; inv = inv->below) |
|
|
952 | { |
|
|
953 | total_exp += op->stats.exp * 8; |
|
|
954 | monster_cnt++; |
|
|
955 | } |
990 | } |
956 | } |
991 | } |
957 | } |
992 | |
958 | |
993 | avgexp = (double) total_exp / monster_cnt; |
959 | avgexp = (double) total_exp / monster_cnt; |
994 | |
960 | |
… | |
… | |
1007 | * postive values make it darker, negative make it brighter |
973 | * postive values make it darker, negative make it brighter |
1008 | */ |
974 | */ |
1009 | int |
975 | int |
1010 | maptile::change_map_light (int change) |
976 | maptile::change_map_light (int change) |
1011 | { |
977 | { |
1012 | int new_level = darkness + change; |
|
|
1013 | |
|
|
1014 | /* Nothing to do */ |
978 | /* Nothing to do */ |
1015 | if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) |
979 | if (!change) |
1016 | return 0; |
980 | return 0; |
1017 | |
981 | |
1018 | /* inform all players on the map */ |
982 | /* inform all players on the map */ |
1019 | if (change > 0) |
983 | if (change > 0) |
1020 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
984 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); |
1021 | else |
985 | else |
1022 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
986 | new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); |
1023 | |
987 | |
1024 | /* Do extra checking. since darkness is a unsigned value, |
988 | darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS); |
1025 | * we need to be extra careful about negative values. |
|
|
1026 | * In general, the checks below are only needed if change |
|
|
1027 | * is not +/-1 |
|
|
1028 | */ |
|
|
1029 | if (new_level < 0) |
|
|
1030 | darkness = 0; |
|
|
1031 | else if (new_level >= MAX_DARKNESS) |
|
|
1032 | darkness = MAX_DARKNESS; |
|
|
1033 | else |
|
|
1034 | darkness = new_level; |
|
|
1035 | |
989 | |
1036 | /* All clients need to get re-updated for the change */ |
990 | /* All clients need to get re-updated for the change */ |
1037 | update_all_map_los (this); |
991 | update_all_map_los (this); |
|
|
992 | |
1038 | return 1; |
993 | return 1; |
1039 | } |
994 | } |
1040 | |
995 | |
1041 | /* |
996 | /* |
1042 | * This function updates various attributes about a specific space |
997 | * This function updates various attributes about a specific space |
… | |
… | |
1045 | * through, etc) |
1000 | * through, etc) |
1046 | */ |
1001 | */ |
1047 | void |
1002 | void |
1048 | mapspace::update_ () |
1003 | mapspace::update_ () |
1049 | { |
1004 | { |
1050 | object *tmp, *last = 0; |
1005 | object *last = 0; |
1051 | uint8 flags = P_UPTODATE, light = 0, anywhere = 0; |
1006 | uint8 flags = P_UPTODATE; |
|
|
1007 | sint8 light = 0; |
1052 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1008 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
|
|
1009 | uint64_t volume = 0; |
|
|
1010 | uint32_t items = 0; |
|
|
1011 | object *anywhere = 0; |
|
|
1012 | uint8_t middle_visibility = 0; |
1053 | |
1013 | |
1054 | //object *middle = 0; |
1014 | //object *middle = 0; |
1055 | //object *top = 0; |
1015 | //object *top = 0; |
1056 | //object *floor = 0; |
1016 | //object *floor = 0; |
1057 | // this seems to generate better code than using locals, above |
1017 | // this seems to generate better code than using locals, above |
1058 | object *&top = faces_obj[0] = 0; |
1018 | object *&top = faces_obj[0] = 0; |
1059 | object *&middle = faces_obj[1] = 0; |
1019 | object *&middle = faces_obj[1] = 0; |
1060 | object *&floor = faces_obj[2] = 0; |
1020 | object *&floor = faces_obj[2] = 0; |
1061 | |
1021 | |
|
|
1022 | object::flags_t allflags; // all flags of all objects or'ed together |
|
|
1023 | |
1062 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1024 | for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1063 | { |
1025 | { |
1064 | /* This could be made additive I guess (two lights better than |
1026 | // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C) |
1065 | * one). But if so, it shouldn't be a simple additive - 2 |
|
|
1066 | * light bulbs do not illuminate twice as far as once since |
|
|
1067 | * it is a dissapation factor that is cubed. |
|
|
1068 | */ |
|
|
1069 | light = max (light, tmp->glow_radius); |
1027 | light += tmp->glow_radius; |
1070 | |
1028 | |
1071 | /* This call is needed in order to update objects the player |
1029 | /* This call is needed in order to update objects the player |
1072 | * is standing in that have animations (ie, grass, fire, etc). |
1030 | * is standing in that have animations (ie, grass, fire, etc). |
1073 | * However, it also causes the look window to be re-drawn |
1031 | * However, it also causes the look window to be re-drawn |
1074 | * 3 times each time the player moves, because many of the |
1032 | * 3 times each time the player moves, because many of the |
1075 | * functions the move_player calls eventualy call this. |
1033 | * functions the move_player calls eventualy call this. |
1076 | * |
1034 | * |
1077 | * Always put the player down for drawing. |
1035 | * Always put the player down for drawing. |
1078 | */ |
1036 | */ |
1079 | if (!tmp->invisible) |
1037 | if (expect_true (!tmp->invisible)) |
1080 | { |
1038 | { |
1081 | if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) |
1039 | if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER])) |
1082 | top = tmp; |
1040 | top = tmp; |
1083 | else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1041 | else if (expect_false (tmp->flag [FLAG_IS_FLOOR])) |
1084 | { |
1042 | { |
1085 | /* If we got a floor, that means middle and top were below it, |
1043 | /* If we got a floor, that means middle and top were below it, |
1086 | * so should not be visible, so we clear them. |
1044 | * so should not be visible, so we clear them. |
1087 | */ |
1045 | */ |
1088 | middle = 0; |
1046 | middle = 0; |
1089 | top = 0; |
1047 | top = 0; |
1090 | floor = tmp; |
1048 | floor = tmp; |
|
|
1049 | volume = 0; |
|
|
1050 | items = 0; |
1091 | } |
1051 | } |
1092 | /* Flag anywhere have high priority */ |
1052 | else |
1093 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
|
|
1094 | { |
1053 | { |
|
|
1054 | if (expect_true (!tmp->flag [FLAG_NO_PICK])) |
|
|
1055 | { |
|
|
1056 | ++items; |
|
|
1057 | volume += tmp->volume (); |
|
|
1058 | } |
|
|
1059 | |
|
|
1060 | /* Flag anywhere have high priority */ |
|
|
1061 | if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE])) |
|
|
1062 | anywhere = tmp; |
|
|
1063 | |
|
|
1064 | /* Find the highest visible face around. If equal |
|
|
1065 | * visibilities, we still want the one nearer to the |
|
|
1066 | * top |
|
|
1067 | */ |
|
|
1068 | if (expect_false (::faces [tmp->face].visibility >= middle_visibility)) |
|
|
1069 | { |
|
|
1070 | middle_visibility = ::faces [tmp->face].visibility; |
1095 | middle = tmp; |
1071 | middle = tmp; |
1096 | anywhere = 1; |
1072 | } |
1097 | } |
1073 | } |
1098 | /* Find the highest visible face around. If equal |
|
|
1099 | * visibilities, we still want the one nearer to the |
|
|
1100 | * top |
|
|
1101 | */ |
|
|
1102 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) |
|
|
1103 | middle = tmp; |
|
|
1104 | } |
|
|
1105 | |
|
|
1106 | if (tmp == tmp->above) |
|
|
1107 | { |
|
|
1108 | LOG (llevError, "Error in structure of map\n"); |
|
|
1109 | exit (-1); |
|
|
1110 | } |
1074 | } |
1111 | |
1075 | |
1112 | move_slow |= tmp->move_slow; |
1076 | move_slow |= tmp->move_slow; |
1113 | move_block |= tmp->move_block; |
1077 | move_block |= tmp->move_block; |
1114 | move_on |= tmp->move_on; |
1078 | move_on |= tmp->move_on; |
1115 | move_off |= tmp->move_off; |
1079 | move_off |= tmp->move_off; |
1116 | move_allow |= tmp->move_allow; |
1080 | move_allow |= tmp->move_allow; |
1117 | |
1081 | |
1118 | if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; |
1082 | allflags |= tmp->flag; |
1119 | if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; |
1083 | |
1120 | if (tmp->type == PLAYER) flags |= P_PLAYER; |
1084 | if (tmp->type == PLAYER) flags |= P_PLAYER; |
1121 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1085 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1122 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
|
|
1123 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
|
|
1124 | } |
1086 | } |
1125 | |
1087 | |
1126 | this->light = light; |
1088 | // FLAG_SEE_ANYWHERE takes precedence |
|
|
1089 | if (anywhere) |
|
|
1090 | middle = anywhere; |
|
|
1091 | |
|
|
1092 | // ORing all flags together and checking them here is much faster |
|
|
1093 | if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW; |
|
|
1094 | if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC; |
|
|
1095 | if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE; |
|
|
1096 | if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC; |
|
|
1097 | |
|
|
1098 | this->light = min (light, MAX_LIGHT_RADIUS); |
1127 | this->flags_ = flags; |
1099 | this->flags_ = flags; |
1128 | this->move_block = move_block & ~move_allow; |
1100 | this->move_block = move_block & ~move_allow; |
1129 | this->move_on = move_on; |
1101 | this->move_on = move_on; |
1130 | this->move_off = move_off; |
1102 | this->move_off = move_off; |
1131 | this->move_slow = move_slow; |
1103 | this->move_slow = move_slow; |
|
|
1104 | this->volume_ = (volume + 1023) / 1024; |
|
|
1105 | this->items_ = upos_min (items, 65535); // assume nrof <= 2**31 |
1132 | |
1106 | |
1133 | /* At this point, we have a floor face (if there is a floor), |
1107 | /* At this point, we have a floor face (if there is a floor), |
1134 | * and the floor is set - we are not going to touch it at |
1108 | * and the floor is set - we are not going to touch it at |
1135 | * this point. |
1109 | * this point. |
1136 | * middle contains the highest visibility face. |
1110 | * middle contains the highest visibility face. |
… | |
… | |
1151 | * 1) top face is set, need middle to be set. |
1125 | * 1) top face is set, need middle to be set. |
1152 | * 2) middle is set, need to set top. |
1126 | * 2) middle is set, need to set top. |
1153 | * 3) neither middle or top is set - need to set both. |
1127 | * 3) neither middle or top is set - need to set both. |
1154 | */ |
1128 | */ |
1155 | |
1129 | |
1156 | for (tmp = last; tmp; tmp = tmp->below) |
1130 | for (object *tmp = last; tmp; tmp = tmp->below) |
1157 | { |
1131 | { |
1158 | /* Once we get to a floor, stop, since we already have a floor object */ |
1132 | /* Once we get to a floor, stop, since we already have a floor object */ |
1159 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1133 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1160 | break; |
1134 | break; |
1161 | |
1135 | |
… | |
… | |
1202 | faces_obj [1] = middle; |
1176 | faces_obj [1] = middle; |
1203 | faces_obj [2] = floor; |
1177 | faces_obj [2] = floor; |
1204 | #endif |
1178 | #endif |
1205 | } |
1179 | } |
1206 | |
1180 | |
1207 | uint64 |
1181 | maptile * |
1208 | mapspace::volume () const |
|
|
1209 | { |
|
|
1210 | uint64 vol = 0; |
|
|
1211 | |
|
|
1212 | for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below) |
|
|
1213 | vol += op->volume (); |
|
|
1214 | |
|
|
1215 | return vol; |
|
|
1216 | } |
|
|
1217 | |
|
|
1218 | bool |
|
|
1219 | maptile::tile_available (int dir, bool load) |
1182 | maptile::tile_available (int dir, bool load) |
1220 | { |
1183 | { |
1221 | if (!tile_path[dir]) |
1184 | if (tile_path[dir]) |
1222 | return 0; |
1185 | { |
1223 | |
|
|
1224 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1186 | if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) |
1225 | return 1; |
1187 | return tile_map[dir]; |
1226 | |
1188 | |
1227 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1189 | if ((tile_map[dir] = find_async (tile_path[dir], this, load))) |
1228 | return 1; |
1190 | return tile_map[dir]; |
|
|
1191 | } |
1229 | |
1192 | |
1230 | return 0; |
1193 | return 0; |
1231 | } |
1194 | } |
1232 | |
1195 | |
1233 | /* this returns TRUE if the coordinates (x,y) are out of |
1196 | /* this returns TRUE if the coordinates (x,y) are out of |
… | |
… | |
1539 | else |
1502 | else |
1540 | { |
1503 | { |
1541 | retval->distance_x += op2->x - x; |
1504 | retval->distance_x += op2->x - x; |
1542 | retval->distance_y += op2->y - y; |
1505 | retval->distance_y += op2->y - y; |
1543 | |
1506 | |
1544 | retval->part = NULL; |
1507 | retval->part = 0; |
1545 | retval->distance = idistance (retval->distance_x, retval->distance_y); |
1508 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1546 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1509 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1547 | } |
1510 | } |
1548 | } |
1511 | } |
1549 | |
1512 | |
1550 | /* Returns true of op1 and op2 are effectively on the same map |
1513 | /* Returns true of op1 and op2 are effectively on the same map |
… | |
… | |
1561 | int dx, dy; |
1524 | int dx, dy; |
1562 | |
1525 | |
1563 | return adjacent_map (op1->map, op2->map, &dx, &dy); |
1526 | return adjacent_map (op1->map, op2->map, &dx, &dy); |
1564 | } |
1527 | } |
1565 | |
1528 | |
|
|
1529 | //-GPL |
|
|
1530 | |
1566 | object * |
1531 | object * |
1567 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1532 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1568 | { |
1533 | { |
1569 | if (!op->flag [FLAG_REMOVED]) |
|
|
1570 | op->remove (); |
|
|
1571 | |
|
|
1572 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1534 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1573 | } |
1535 | } |
1574 | |
1536 | |
1575 | region * |
1537 | region * |
1576 | maptile::region (int x, int y) const |
1538 | maptile::region (int x, int y) const |
… | |
… | |
1584 | if (default_region) |
1546 | if (default_region) |
1585 | return default_region; |
1547 | return default_region; |
1586 | |
1548 | |
1587 | return ::region::default_region (); |
1549 | return ::region::default_region (); |
1588 | } |
1550 | } |
|
|
1551 | |
|
|
1552 | //+GPL |
1589 | |
1553 | |
1590 | /* picks a random object from a style map. |
1554 | /* picks a random object from a style map. |
1591 | */ |
1555 | */ |
1592 | object * |
1556 | object * |
1593 | maptile::pick_random_object (rand_gen &gen) const |
1557 | maptile::pick_random_object (rand_gen &gen) const |
… | |
… | |
1606 | if (pick && pick->is_head ()) |
1570 | if (pick && pick->is_head ()) |
1607 | return pick->head_ (); |
1571 | return pick->head_ (); |
1608 | } |
1572 | } |
1609 | |
1573 | |
1610 | // instead of crashing in the unlikely(?) case, try to return *something* |
1574 | // instead of crashing in the unlikely(?) case, try to return *something* |
1611 | return archetype::find ("bug"); |
1575 | return archetype::find (shstr_bug); |
1612 | } |
1576 | } |
|
|
1577 | |
|
|
1578 | //-GPL |
1613 | |
1579 | |
1614 | void |
1580 | void |
1615 | maptile::play_sound (faceidx sound, int x, int y) const |
1581 | maptile::play_sound (faceidx sound, int x, int y) const |
1616 | { |
1582 | { |
1617 | if (!sound) |
1583 | if (!sound) |
1618 | return; |
1584 | return; |
1619 | |
1585 | |
|
|
1586 | for_all_players_on_map (pl, this) |
|
|
1587 | if (client *ns = pl->ns) |
|
|
1588 | { |
|
|
1589 | int dx = x - pl->ob->x; |
|
|
1590 | int dy = y - pl->ob->y; |
|
|
1591 | |
|
|
1592 | int distance = idistance (dx, dy); |
|
|
1593 | |
|
|
1594 | if (distance <= MAX_SOUND_DISTANCE) |
|
|
1595 | ns->play_sound (sound, dx, dy); |
|
|
1596 | } |
|
|
1597 | } |
|
|
1598 | |
|
|
1599 | void |
|
|
1600 | maptile::say_msg (const char *msg, int x, int y) const |
|
|
1601 | { |
1620 | for_all_players (pl) |
1602 | for_all_players (pl) |
1621 | if (pl->ob->map == this) |
|
|
1622 | if (client *ns = pl->ns) |
1603 | if (client *ns = pl->ns) |
1623 | { |
1604 | { |
1624 | int dx = x - pl->ob->x; |
1605 | int dx = x - pl->ob->x; |
1625 | int dy = y - pl->ob->y; |
1606 | int dy = y - pl->ob->y; |
1626 | |
1607 | |
1627 | int distance = idistance (dx, dy); |
1608 | int distance = idistance (dx, dy); |
1628 | |
1609 | |
1629 | if (distance <= MAX_SOUND_DISTANCE) |
1610 | if (distance <= MAX_SOUND_DISTANCE) |
1630 | ns->play_sound (sound, dx, dy); |
1611 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
1631 | } |
1612 | } |
1632 | } |
1613 | } |
1633 | |
1614 | |
|
|
1615 | static void |
|
|
1616 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
|
|
1617 | { |
|
|
1618 | // clip to map to the left |
|
|
1619 | if (x0 < 0) |
|
|
1620 | { |
|
|
1621 | if (maptile *tile = m->tile_available (TILE_LEFT, 1)) |
|
|
1622 | split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy); |
|
|
1623 | |
|
|
1624 | if (x1 < 0) // entirely to the left |
|
|
1625 | return; |
|
|
1626 | |
|
|
1627 | x0 = 0; |
|
|
1628 | } |
|
|
1629 | |
|
|
1630 | // clip to map to the right |
|
|
1631 | if (x1 > m->width) |
|
|
1632 | { |
|
|
1633 | if (maptile *tile = m->tile_available (TILE_RIGHT, 1)) |
|
|
1634 | split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy); |
|
|
1635 | |
|
|
1636 | if (x0 > m->width) // entirely to the right |
|
|
1637 | return; |
|
|
1638 | |
|
|
1639 | x1 = m->width; |
|
|
1640 | } |
|
|
1641 | |
|
|
1642 | // clip to map above |
|
|
1643 | if (y0 < 0) |
|
|
1644 | { |
|
|
1645 | if (maptile *tile = m->tile_available (TILE_UP, 1)) |
|
|
1646 | split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height); |
|
|
1647 | |
|
|
1648 | if (y1 < 0) // entirely above |
|
|
1649 | return; |
|
|
1650 | |
|
|
1651 | y0 = 0; |
|
|
1652 | } |
|
|
1653 | |
|
|
1654 | // clip to map below |
|
|
1655 | if (y1 > m->height) |
|
|
1656 | { |
|
|
1657 | if (maptile *tile = m->tile_available (TILE_DOWN, 1)) |
|
|
1658 | split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height); |
|
|
1659 | |
|
|
1660 | if (y0 > m->height) // entirely below |
|
|
1661 | return; |
|
|
1662 | |
|
|
1663 | y1 = m->height; |
|
|
1664 | } |
|
|
1665 | |
|
|
1666 | // if we get here, the rect is within the current map |
|
|
1667 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1668 | |
|
|
1669 | r->m = m; |
|
|
1670 | r->x0 = x0; |
|
|
1671 | r->y0 = y0; |
|
|
1672 | r->x1 = x1; |
|
|
1673 | r->y1 = y1; |
|
|
1674 | r->dx = dx; |
|
|
1675 | r->dy = dy; |
|
|
1676 | } |
|
|
1677 | |
|
|
1678 | maprect * |
|
|
1679 | maptile::split_to_tiles (int x0, int y0, int x1, int y1) |
|
|
1680 | { |
|
|
1681 | static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8); |
|
|
1682 | buf.clear (); |
|
|
1683 | |
|
|
1684 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
|
|
1685 | |
|
|
1686 | // add end marker |
|
|
1687 | maprect *r = (maprect *)buf.alloc (sizeof (maprect)); |
|
|
1688 | r->m = 0; |
|
|
1689 | |
|
|
1690 | return (maprect *)buf.linearise (); |
|
|
1691 | } |
|
|
1692 | |