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 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 |
29 | |
31 | |
30 | sint8 maptile::outdoor_darkness; |
32 | sint8 maptile::outdoor_darkness; |
31 | |
33 | |
32 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
34 | /* This rolls up wall, blocks_magic, blocks_view, etc, all into |
33 | * one function that just returns a P_.. value (see map.h) |
35 | * one function that just returns a P_.. value (see map.h) |
… | |
… | |
70 | * by the caller. |
72 | * by the caller. |
71 | */ |
73 | */ |
72 | int |
74 | int |
73 | blocked_link (object *ob, maptile *m, int sx, int sy) |
75 | blocked_link (object *ob, maptile *m, int sx, int sy) |
74 | { |
76 | { |
75 | object *tmp; |
|
|
76 | int mflags, blocked; |
|
|
77 | |
|
|
78 | /* 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 |
79 | * have already checked this. |
78 | * have already checked this. |
80 | */ |
79 | */ |
81 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
80 | if (OUT_OF_REAL_MAP (m, sx, sy)) |
82 | { |
81 | { |
83 | LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
82 | LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); |
84 | return 1; |
83 | return 1; |
85 | } |
84 | } |
86 | |
85 | |
87 | /* Save some cycles - instead of calling get_map_flags(), just get the value |
86 | mapspace &ms = m->at (sx, sy); |
88 | * directly. |
|
|
89 | */ |
|
|
90 | mflags = m->at (sx, sy).flags (); |
|
|
91 | |
87 | |
92 | blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); |
88 | int mflags = ms.flags (); |
|
|
89 | int blocked = ms.move_block; |
93 | |
90 | |
94 | /* If space is currently not blocked by anything, no need to |
91 | /* If space is currently not blocked by anything, no need to |
95 | * go further. Not true for players - all sorts of special |
92 | * go further. Not true for players - all sorts of special |
96 | * things we need to do for players. |
93 | * things we need to do for players. |
97 | */ |
94 | */ |
98 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
95 | if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) |
99 | return 0; |
96 | return 0; |
100 | |
97 | |
101 | /* 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 |
102 | * 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 |
103 | * 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 |
104 | * or another. Likewise, only if something is blocking us do we |
101 | * or another. Likewise, only if something is blocking us do we |
105 | * need to investigate if there is a special circumstance that would |
102 | * need to investigate if there is a special circumstance that would |
106 | * let the player through (inventory checkers for example) |
103 | * let the player through (inventory checkers for example) |
… | |
… | |
113 | /* 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 |
114 | * 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 |
115 | * true. If we get through the entire stack, that must mean |
112 | * true. If we get through the entire stack, that must mean |
116 | * ob is blocking it, so return 0. |
113 | * ob is blocking it, so return 0. |
117 | */ |
114 | */ |
118 | for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) |
115 | for (object *tmp = ms.top; tmp; tmp = tmp->below) |
119 | { |
116 | { |
120 | |
117 | 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 | { |
118 | { |
124 | /* If last_sp is set, the player/monster needs an object, |
119 | if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob)) |
125 | * so we check for it. If they don't have it, they can't |
120 | if (RESULT_INT (0)) |
126 | * pass through this space. |
121 | return 1; |
127 | */ |
122 | else |
128 | if (tmp->last_sp) |
123 | continue; |
|
|
124 | |
|
|
125 | if (tmp->type == CHECK_INV) |
129 | { |
126 | { |
130 | 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)) |
131 | return 1; |
131 | return 1; |
132 | else |
132 | } |
133 | 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; |
134 | } |
142 | } |
135 | else |
143 | else |
136 | { |
144 | return 1; // unconditional block |
137 | /* In this case, the player must not have the object - |
145 | |
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 |
146 | } else { |
147 | { |
147 | // space does not block the ob, directly, but |
148 | /* Broke apart a big nasty if into several here to make |
148 | // anything alive that is not a door still |
149 | * this more readable. first check - if the space blocks |
149 | // blocks anything |
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 | |
150 | |
157 | if (tmp->flag [FLAG_ALIVE] |
151 | if (tmp->flag [FLAG_ALIVE] |
158 | && tmp->head_ () != ob |
|
|
159 | && tmp != ob |
|
|
160 | && tmp->type != DOOR |
152 | && tmp->type != DOOR |
161 | && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) |
153 | && tmp->head_ () != ob) //TODO: maybe move these check up? |
162 | return 1; |
154 | return 1; |
163 | } |
155 | } |
164 | |
|
|
165 | } |
156 | } |
|
|
157 | |
166 | return 0; |
158 | return 0; |
167 | } |
159 | } |
168 | |
160 | |
169 | /* |
161 | /* |
170 | * 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 |
171 | * 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, |
172 | * just calling get_map_blocked and checking that against movement type |
164 | * just calling get_map_blocked and checking that against movement type |
173 | * 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 |
174 | * object and makes sure they can be inserted. |
166 | * object and makes sure they can be inserted. |
175 | * |
167 | * |
… | |
… | |
222 | } |
214 | } |
223 | |
215 | |
224 | return 0; |
216 | return 0; |
225 | } |
217 | } |
226 | |
218 | |
227 | /* When the map is loaded, load_object does not actually insert objects |
219 | //-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 | |
220 | |
254 | void |
221 | void |
255 | maptile::set_object_flag (int flag, int value) |
222 | maptile::set_object_flag (int flag, int value) |
256 | { |
223 | { |
257 | if (!spaces) |
224 | if (!spaces) |
… | |
… | |
272 | |
239 | |
273 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
240 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
274 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
241 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
275 | INVOKE_OBJECT (RESET, tmp); |
242 | INVOKE_OBJECT (RESET, tmp); |
276 | } |
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 |
277 | |
259 | |
278 | /* 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 |
279 | * 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 |
280 | * 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 |
281 | * they are saved). |
263 | * they are saved). |
… | |
… | |
308 | else |
290 | else |
309 | op = op->above; |
291 | op = op->above; |
310 | } |
292 | } |
311 | } |
293 | } |
312 | } |
294 | } |
|
|
295 | |
|
|
296 | //-GPL |
313 | |
297 | |
314 | /* |
298 | /* |
315 | * 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 |
316 | * file pointer. |
300 | * file pointer. |
317 | */ |
301 | */ |
… | |
… | |
437 | return false; |
421 | return false; |
438 | |
422 | |
439 | return freezer.save (path); |
423 | return freezer.save (path); |
440 | } |
424 | } |
441 | |
425 | |
442 | maptile::maptile () |
426 | void |
|
|
427 | maptile::init () |
443 | { |
428 | { |
444 | in_memory = MAP_SWAPPED; |
429 | in_memory = MAP_SWAPPED; |
445 | |
430 | |
446 | /* The maps used to pick up default x and y values from the |
431 | /* The maps used to pick up default x and y values from the |
447 | * map archetype. Mimic that behaviour. |
432 | * map archetype. Mimic that behaviour. |
448 | */ |
433 | */ |
449 | width = 16; |
434 | width = 16; |
450 | height = 16; |
435 | height = 16; |
451 | timeout = 300; |
436 | timeout = 300; |
452 | max_nrof = 1000; // 1000 items of anything |
437 | max_items = MAX_ITEM_PER_ACTION; |
453 | max_volume = 2000000; // 2m³ |
438 | max_volume = 2000000; // 2m³ |
454 | } |
|
|
455 | |
|
|
456 | maptile::maptile (int w, int h) |
|
|
457 | { |
|
|
458 | in_memory = MAP_SWAPPED; |
|
|
459 | |
|
|
460 | width = w; |
|
|
461 | height = h; |
|
|
462 | reset_timeout = 0; |
439 | reset_timeout = 0; |
463 | timeout = 300; |
|
|
464 | enter_x = 0; |
440 | enter_x = 0; |
465 | enter_y = 0; |
441 | enter_y = 0; |
|
|
442 | } |
|
|
443 | |
|
|
444 | maptile::maptile () |
|
|
445 | { |
|
|
446 | init (); |
|
|
447 | } |
|
|
448 | |
|
|
449 | maptile::maptile (int w, int h) |
|
|
450 | { |
|
|
451 | init (); |
|
|
452 | |
|
|
453 | width = w; |
|
|
454 | height = h; |
466 | |
455 | |
467 | alloc (); |
456 | alloc (); |
468 | } |
457 | } |
469 | |
458 | |
470 | /* |
459 | /* |
… | |
… | |
478 | if (spaces) |
467 | if (spaces) |
479 | return; |
468 | return; |
480 | |
469 | |
481 | spaces = salloc0<mapspace> (size ()); |
470 | spaces = salloc0<mapspace> (size ()); |
482 | } |
471 | } |
|
|
472 | |
|
|
473 | //+GPL |
483 | |
474 | |
484 | /* Takes a string from a map definition and outputs a pointer to the array of shopitems |
475 | /* Takes a string from a map definition and outputs a pointer to the array of shopitems |
485 | * corresponding to that string. Memory is allocated for this, it must be freed |
476 | * corresponding to that string. Memory is allocated for this, it must be freed |
486 | * at a later date. |
477 | * at a later date. |
487 | * Called by parse_map_headers below. |
478 | * Called by parse_map_headers below. |
… | |
… | |
564 | return items; |
555 | return items; |
565 | } |
556 | } |
566 | |
557 | |
567 | /* opposite of parse string, this puts the string that was originally fed in to |
558 | /* opposite of parse string, this puts the string that was originally fed in to |
568 | * the map (or something equivilent) into output_string. */ |
559 | * the map (or something equivilent) into output_string. */ |
569 | static void |
560 | static const char * |
570 | print_shop_string (maptile *m, char *output_string) |
561 | print_shop_string (maptile *m) |
571 | { |
562 | { |
572 | int i; |
563 | static dynbuf_text buf; buf.clear (); |
573 | char tmp[MAX_BUF]; |
|
|
574 | |
564 | |
575 | strcpy (output_string, ""); |
|
|
576 | for (i = 0; i < m->shopitems[0].index; i++) |
565 | for (int i = 0; i < m->shopitems[0].index; i++) |
577 | { |
566 | { |
578 | if (m->shopitems[i].typenum) |
567 | if (m->shopitems[i].typenum) |
579 | { |
568 | { |
580 | if (m->shopitems[i].strength) |
569 | if (m->shopitems[i].strength) |
581 | sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
570 | buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); |
582 | else |
571 | else |
583 | sprintf (tmp, "%s;", m->shopitems[i].name); |
572 | buf.printf ("%s;", m->shopitems[i].name); |
584 | } |
573 | } |
585 | else |
574 | else |
586 | { |
575 | { |
587 | if (m->shopitems[i].strength) |
576 | if (m->shopitems[i].strength) |
588 | sprintf (tmp, "*:%d;", m->shopitems[i].strength); |
577 | buf.printf ("*:%d;", m->shopitems[i].strength); |
589 | else |
578 | else |
590 | sprintf (tmp, "*"); |
579 | buf.printf ("*"); |
591 | } |
580 | } |
592 | |
|
|
593 | strcat (output_string, tmp); |
|
|
594 | } |
581 | } |
|
|
582 | |
|
|
583 | return buf; |
595 | } |
584 | } |
|
|
585 | |
|
|
586 | //-GPL |
596 | |
587 | |
597 | /* This loads the header information of the map. The header |
588 | /* This loads the header information of the map. The header |
598 | * contains things like difficulty, size, timeout, etc. |
589 | * contains things like difficulty, size, timeout, etc. |
599 | * this used to be stored in the map object, but with the |
590 | * this used to be stored in the map object, but with the |
600 | * addition of tiling, fields beyond that easily named in an |
591 | * addition of tiling, fields beyond that easily named in an |
… | |
… | |
641 | case KW_shopgreed: thawer.get (shopgreed); break; |
632 | case KW_shopgreed: thawer.get (shopgreed); break; |
642 | case KW_shopmin: thawer.get (shopmin); break; |
633 | case KW_shopmin: thawer.get (shopmin); break; |
643 | case KW_shopmax: thawer.get (shopmax); break; |
634 | case KW_shopmax: thawer.get (shopmax); break; |
644 | case KW_shoprace: thawer.get (shoprace); break; |
635 | case KW_shoprace: thawer.get (shoprace); break; |
645 | case KW_outdoor: thawer.get (outdoor); break; |
636 | case KW_outdoor: thawer.get (outdoor); break; |
646 | case KW_temp: thawer.get (temp); break; |
|
|
647 | case KW_pressure: thawer.get (pressure); break; |
|
|
648 | case KW_humid: thawer.get (humid); break; |
|
|
649 | case KW_windspeed: thawer.get (windspeed); break; |
|
|
650 | case KW_winddir: thawer.get (winddir); break; |
|
|
651 | case KW_sky: thawer.get (sky); break; |
|
|
652 | |
637 | |
653 | case KW_per_player: thawer.get (per_player); break; |
638 | case KW_per_player: thawer.get (per_player); break; |
654 | case KW_per_party: thawer.get (per_party); break; |
639 | case KW_per_party: thawer.get (per_party); break; |
655 | case KW_no_reset: thawer.get (no_reset); break; |
640 | case KW_no_reset: thawer.get (no_reset); break; |
656 | case KW_no_drop: thawer.get (no_drop); break; |
641 | case KW_no_drop: thawer.get (no_drop); break; |
… | |
… | |
681 | case KW_end: |
666 | case KW_end: |
682 | thawer.next (); |
667 | thawer.next (); |
683 | return true; |
668 | return true; |
684 | |
669 | |
685 | default: |
670 | default: |
686 | if (!thawer.parse_error ("map", 0)) |
671 | if (!thawer.parse_error ("map")) |
687 | return false; |
672 | return false; |
688 | break; |
673 | break; |
689 | } |
674 | } |
690 | |
675 | |
691 | thawer.next (); |
676 | thawer.next (); |
692 | } |
677 | } |
693 | |
678 | |
694 | abort (); |
679 | abort (); |
695 | } |
680 | } |
|
|
681 | |
|
|
682 | //+GPL |
696 | |
683 | |
697 | /****************************************************************************** |
684 | /****************************************************************************** |
698 | * This is the start of unique map handling code |
685 | * This is the start of unique map handling code |
699 | *****************************************************************************/ |
686 | *****************************************************************************/ |
700 | |
687 | |
… | |
… | |
707 | int unique = 0; |
694 | int unique = 0; |
708 | for (object *op = spaces [i].bot; op; ) |
695 | for (object *op = spaces [i].bot; op; ) |
709 | { |
696 | { |
710 | object *above = op->above; |
697 | object *above = op->above; |
711 | |
698 | |
712 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
699 | if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE]) |
713 | unique = 1; |
700 | unique = 1; |
714 | |
701 | |
715 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
702 | if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique)) |
716 | op->destroy (); |
703 | op->destroy (); |
717 | |
704 | |
718 | op = above; |
705 | op = above; |
719 | } |
706 | } |
720 | } |
707 | } |
721 | } |
708 | } |
722 | |
709 | |
|
|
710 | //-GPL |
|
|
711 | |
723 | bool |
712 | bool |
724 | maptile::_save_header (object_freezer &freezer) |
713 | maptile::_save_header (object_freezer &freezer) |
725 | { |
714 | { |
726 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
715 | #define MAP_OUT(k) freezer.put (KW(k), k) |
727 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
716 | #define MAP_OUT2(k,v) freezer.put (KW(k), v) |
728 | |
717 | |
729 | MAP_OUT2 (arch, "map"); |
718 | MAP_OUT2 (arch, CS(map)); |
730 | |
719 | |
731 | if (name) MAP_OUT (name); |
720 | if (name) MAP_OUT (name); |
732 | MAP_OUT (swap_time); |
721 | MAP_OUT (swap_time); |
733 | MAP_OUT (reset_time); |
722 | MAP_OUT (reset_time); |
734 | MAP_OUT (reset_timeout); |
723 | MAP_OUT (reset_timeout); |
735 | MAP_OUT (fixed_resettime); |
724 | MAP_OUT (fixed_resettime); |
736 | MAP_OUT (no_reset); |
725 | MAP_OUT (no_reset); |
737 | MAP_OUT (no_drop); |
726 | MAP_OUT (no_drop); |
738 | MAP_OUT (difficulty); |
727 | MAP_OUT (difficulty); |
739 | |
|
|
740 | if (default_region) MAP_OUT2 (region, default_region->name); |
728 | if (default_region) MAP_OUT2 (region, default_region->name); |
741 | |
729 | |
742 | if (shopitems) |
730 | if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this)); |
743 | { |
|
|
744 | char shop[MAX_BUF]; |
|
|
745 | print_shop_string (this, shop); |
|
|
746 | MAP_OUT2 (shopitems, shop); |
|
|
747 | } |
|
|
748 | |
|
|
749 | MAP_OUT (shopgreed); |
731 | MAP_OUT (shopgreed); |
750 | MAP_OUT (shopmin); |
732 | MAP_OUT (shopmin); |
751 | MAP_OUT (shopmax); |
733 | MAP_OUT (shopmax); |
752 | if (shoprace) MAP_OUT (shoprace); |
734 | if (shoprace) MAP_OUT (shoprace); |
753 | MAP_OUT (darkness); |
735 | |
754 | MAP_OUT (width); |
736 | MAP_OUT (width); |
755 | MAP_OUT (height); |
737 | MAP_OUT (height); |
756 | MAP_OUT (enter_x); |
738 | MAP_OUT (enter_x); |
757 | MAP_OUT (enter_y); |
739 | MAP_OUT (enter_y); |
758 | |
740 | MAP_OUT (darkness); |
759 | if (msg) freezer.put (KW_msg , KW_endmsg , msg); |
|
|
760 | if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore); |
|
|
761 | |
|
|
762 | MAP_OUT (outdoor); |
741 | MAP_OUT (outdoor); |
763 | MAP_OUT (temp); |
742 | |
764 | MAP_OUT (pressure); |
743 | if (msg) freezer.put (KW(msg) , KW(endmsg) , msg); |
765 | MAP_OUT (humid); |
744 | if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore); |
766 | MAP_OUT (windspeed); |
|
|
767 | MAP_OUT (winddir); |
|
|
768 | MAP_OUT (sky); |
|
|
769 | |
745 | |
770 | MAP_OUT (per_player); |
746 | MAP_OUT (per_player); |
771 | MAP_OUT (per_party); |
747 | MAP_OUT (per_party); |
772 | |
748 | |
773 | if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); |
749 | if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); |
774 | if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); |
750 | if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); |
775 | if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); |
751 | if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); |
776 | if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); |
752 | if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); |
777 | |
753 | |
778 | freezer.put (this); |
754 | freezer.put (this); |
779 | freezer.put (KW_end); |
755 | freezer.put (KW(end)); |
780 | |
756 | |
781 | return true; |
757 | return true; |
782 | } |
758 | } |
783 | |
759 | |
784 | bool |
760 | bool |
… | |
… | |
789 | if (!_save_header (freezer)) |
765 | if (!_save_header (freezer)) |
790 | return false; |
766 | return false; |
791 | |
767 | |
792 | return freezer.save (path); |
768 | return freezer.save (path); |
793 | } |
769 | } |
|
|
770 | |
|
|
771 | //+GPL |
794 | |
772 | |
795 | /* |
773 | /* |
796 | * Remove and free all objects in the given map. |
774 | * Remove and free all objects in the given map. |
797 | */ |
775 | */ |
798 | void |
776 | void |
… | |
… | |
867 | |
845 | |
868 | clear (); |
846 | clear (); |
869 | } |
847 | } |
870 | |
848 | |
871 | /* decay and destroy perishable items in a map */ |
849 | /* decay and destroy perishable items in a map */ |
|
|
850 | // TODO: should be done regularly, not on map load? |
872 | void |
851 | void |
873 | maptile::do_decay_objects () |
852 | maptile::do_decay_objects () |
874 | { |
853 | { |
875 | if (!spaces) |
854 | if (!spaces) |
876 | return; |
855 | return; |
… | |
… | |
878 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
857 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
879 | for (object *above, *op = ms->bot; op; op = above) |
858 | for (object *above, *op = ms->bot; op; op = above) |
880 | { |
859 | { |
881 | above = op->above; |
860 | above = op->above; |
882 | |
861 | |
|
|
862 | // do not decay anything above unique floor tiles (yet :) |
|
|
863 | if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE]) |
|
|
864 | break; |
|
|
865 | |
883 | bool destroy = 0; |
866 | bool destroy = 0; |
884 | |
867 | |
885 | // do not decay anything above unique floor tiles (yet :) |
868 | if (op->flag [FLAG_IS_FLOOR] |
886 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
869 | || op->flag [FLAG_OBJ_ORIGINAL] |
887 | break; |
870 | || op->flag [FLAG_UNIQUE] |
888 | |
871 | || op->flag [FLAG_OVERLAY_FLOOR] |
889 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
872 | || op->flag [FLAG_UNPAID] |
890 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
|
|
891 | || QUERY_FLAG (op, FLAG_UNIQUE) |
|
|
892 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
|
|
893 | || QUERY_FLAG (op, FLAG_UNPAID) |
|
|
894 | || op->is_alive ()) |
873 | || op->is_alive ()) |
895 | ; // do not decay |
874 | ; // do not decay |
896 | else if (op->is_weapon ()) |
875 | else if (op->is_weapon ()) |
897 | { |
876 | { |
898 | op->stats.dam--; |
877 | op->stats.dam--; |
… | |
… | |
923 | || mat & M_LIQUID |
902 | || mat & M_LIQUID |
924 | || (mat & M_IRON && rndm (1, 5) == 1) |
903 | || (mat & M_IRON && rndm (1, 5) == 1) |
925 | || (mat & M_GLASS && rndm (1, 2) == 1) |
904 | || (mat & M_GLASS && rndm (1, 2) == 1) |
926 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
905 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
927 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
906 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
928 | || (mat & M_ICE && temp > 32)) |
907 | //|| (mat & M_ICE && temp > 32) |
|
|
908 | ) |
929 | destroy = 1; |
909 | destroy = 1; |
930 | } |
910 | } |
931 | |
911 | |
932 | /* adjust overall chance below */ |
912 | /* adjust overall chance below */ |
933 | if (destroy && rndm (0, 1)) |
913 | if (destroy && rndm (0, 1)) |
… | |
… | |
953 | sint64 total_exp = 0; |
933 | sint64 total_exp = 0; |
954 | |
934 | |
955 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
935 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
956 | for (object *op = ms->bot; op; op = op->above) |
936 | for (object *op = ms->bot; op; op = op->above) |
957 | { |
937 | { |
958 | if (QUERY_FLAG (op, FLAG_MONSTER)) |
938 | if (op->flag [FLAG_MONSTER]) |
959 | { |
939 | { |
960 | total_exp += op->stats.exp; |
940 | total_exp += op->stats.exp; |
961 | monster_cnt++; |
941 | monster_cnt++; |
962 | } |
942 | } |
963 | |
943 | |
964 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
944 | if (op->flag [FLAG_GENERATOR]) |
965 | { |
945 | { |
966 | total_exp += op->stats.exp; |
946 | total_exp += op->stats.exp; |
967 | |
947 | |
968 | if (archetype *at = op->other_arch) |
948 | if (archetype *at = op->other_arch) |
969 | { |
949 | { |
… | |
… | |
1024 | */ |
1004 | */ |
1025 | void |
1005 | void |
1026 | mapspace::update_ () |
1006 | mapspace::update_ () |
1027 | { |
1007 | { |
1028 | object *last = 0; |
1008 | object *last = 0; |
1029 | uint8 flags = P_UPTODATE, anywhere = 0; |
1009 | uint8 flags = P_UPTODATE; |
1030 | sint8 light = 0; |
1010 | sint8 light = 0; |
1031 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1011 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
|
|
1012 | uint64_t volume = 0; |
|
|
1013 | uint32_t items = 0; |
|
|
1014 | object *anywhere = 0; |
|
|
1015 | uint8_t middle_visibility = 0; |
1032 | |
1016 | |
1033 | //object *middle = 0; |
1017 | //object *middle = 0; |
1034 | //object *top = 0; |
1018 | //object *top = 0; |
1035 | //object *floor = 0; |
1019 | //object *floor = 0; |
1036 | // this seems to generate better code than using locals, above |
1020 | // this seems to generate better code than using locals, above |
1037 | object *&top = faces_obj[0] = 0; |
1021 | object *&top = faces_obj[0] = 0; |
1038 | object *&middle = faces_obj[1] = 0; |
1022 | object *&middle = faces_obj[1] = 0; |
1039 | object *&floor = faces_obj[2] = 0; |
1023 | object *&floor = faces_obj[2] = 0; |
|
|
1024 | |
|
|
1025 | object::flags_t allflags; // all flags of all objects or'ed together |
1040 | |
1026 | |
1041 | for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1027 | for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1042 | { |
1028 | { |
1043 | // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C) |
1029 | // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C) |
1044 | light += tmp->glow_radius; |
1030 | light += tmp->glow_radius; |
… | |
… | |
1049 | * 3 times each time the player moves, because many of the |
1035 | * 3 times each time the player moves, because many of the |
1050 | * functions the move_player calls eventualy call this. |
1036 | * functions the move_player calls eventualy call this. |
1051 | * |
1037 | * |
1052 | * Always put the player down for drawing. |
1038 | * Always put the player down for drawing. |
1053 | */ |
1039 | */ |
1054 | if (!tmp->invisible) |
1040 | if (expect_true (!tmp->invisible)) |
1055 | { |
1041 | { |
1056 | if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) |
1042 | if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER])) |
1057 | top = tmp; |
1043 | top = tmp; |
1058 | else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1044 | else if (expect_false (tmp->flag [FLAG_IS_FLOOR])) |
1059 | { |
1045 | { |
1060 | /* If we got a floor, that means middle and top were below it, |
1046 | /* If we got a floor, that means middle and top were below it, |
1061 | * so should not be visible, so we clear them. |
1047 | * so should not be visible, so we clear them. |
1062 | */ |
1048 | */ |
1063 | middle = 0; |
1049 | middle = 0; |
1064 | top = 0; |
1050 | top = 0; |
1065 | floor = tmp; |
1051 | floor = tmp; |
|
|
1052 | volume = 0; |
|
|
1053 | items = 0; |
1066 | } |
1054 | } |
1067 | /* Flag anywhere have high priority */ |
1055 | else |
1068 | else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) |
|
|
1069 | { |
1056 | { |
|
|
1057 | if (expect_true (!tmp->flag [FLAG_NO_PICK])) |
|
|
1058 | { |
|
|
1059 | ++items; |
|
|
1060 | volume += tmp->volume (); |
|
|
1061 | } |
|
|
1062 | |
|
|
1063 | /* Flag anywhere have high priority */ |
|
|
1064 | if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE])) |
|
|
1065 | anywhere = tmp; |
|
|
1066 | |
|
|
1067 | /* Find the highest visible face around. If equal |
|
|
1068 | * visibilities, we still want the one nearer to the |
|
|
1069 | * top |
|
|
1070 | */ |
|
|
1071 | if (expect_false (::faces [tmp->face].visibility >= middle_visibility)) |
|
|
1072 | { |
|
|
1073 | middle_visibility = ::faces [tmp->face].visibility; |
1070 | middle = tmp; |
1074 | middle = tmp; |
1071 | anywhere = 1; |
1075 | } |
1072 | } |
1076 | } |
1073 | |
|
|
1074 | /* Find the highest visible face around. If equal |
|
|
1075 | * visibilities, we still want the one nearer to the |
|
|
1076 | * top |
|
|
1077 | */ |
|
|
1078 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) |
|
|
1079 | middle = tmp; |
|
|
1080 | } |
|
|
1081 | |
|
|
1082 | if (tmp == tmp->above) |
|
|
1083 | { |
|
|
1084 | LOG (llevError, "Error in structure of map\n"); |
|
|
1085 | exit (-1); |
|
|
1086 | } |
1077 | } |
1087 | |
1078 | |
1088 | move_slow |= tmp->move_slow; |
1079 | move_slow |= tmp->move_slow; |
1089 | move_block |= tmp->move_block; |
1080 | move_block |= tmp->move_block; |
1090 | move_on |= tmp->move_on; |
1081 | move_on |= tmp->move_on; |
1091 | move_off |= tmp->move_off; |
1082 | move_off |= tmp->move_off; |
1092 | move_allow |= tmp->move_allow; |
1083 | move_allow |= tmp->move_allow; |
1093 | |
1084 | |
1094 | if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; |
1085 | allflags |= tmp->flag; |
1095 | if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; |
1086 | |
1096 | if (tmp->type == PLAYER) flags |= P_PLAYER; |
1087 | if (tmp->type == PLAYER) flags |= P_PLAYER; |
1097 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1088 | if (tmp->type == SAFE_GROUND) flags |= P_SAFE; |
1098 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; |
|
|
1099 | if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; |
|
|
1100 | } |
1089 | } |
|
|
1090 | |
|
|
1091 | // FLAG_SEE_ANYWHERE takes precedence |
|
|
1092 | if (anywhere) |
|
|
1093 | middle = anywhere; |
|
|
1094 | |
|
|
1095 | // ORing all flags together and checking them here is much faster |
|
|
1096 | if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW; |
|
|
1097 | if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC; |
|
|
1098 | if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE; |
|
|
1099 | if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC; |
1101 | |
1100 | |
1102 | this->light = min (light, MAX_LIGHT_RADIUS); |
1101 | this->light = min (light, MAX_LIGHT_RADIUS); |
1103 | this->flags_ = flags; |
1102 | this->flags_ = flags; |
1104 | this->move_block = move_block & ~move_allow; |
1103 | this->move_block = move_block & ~move_allow; |
1105 | this->move_on = move_on; |
1104 | this->move_on = move_on; |
1106 | this->move_off = move_off; |
1105 | this->move_off = move_off; |
1107 | this->move_slow = move_slow; |
1106 | this->move_slow = move_slow; |
|
|
1107 | this->volume_ = (volume + 1023) / 1024; |
|
|
1108 | this->items_ = upos_min (items, 65535); // assume nrof <= 2**31 |
1108 | |
1109 | |
1109 | /* At this point, we have a floor face (if there is a floor), |
1110 | /* At this point, we have a floor face (if there is a floor), |
1110 | * and the floor is set - we are not going to touch it at |
1111 | * and the floor is set - we are not going to touch it at |
1111 | * this point. |
1112 | * this point. |
1112 | * middle contains the highest visibility face. |
1113 | * middle contains the highest visibility face. |
… | |
… | |
1130 | */ |
1131 | */ |
1131 | |
1132 | |
1132 | for (object *tmp = last; tmp; tmp = tmp->below) |
1133 | for (object *tmp = last; tmp; tmp = tmp->below) |
1133 | { |
1134 | { |
1134 | /* Once we get to a floor, stop, since we already have a floor object */ |
1135 | /* Once we get to a floor, stop, since we already have a floor object */ |
1135 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1136 | if (tmp->flag [FLAG_IS_FLOOR]) |
1136 | break; |
1137 | break; |
1137 | |
1138 | |
1138 | /* If two top faces are already set, quit processing */ |
1139 | /* If two top faces are already set, quit processing */ |
1139 | if (top && middle) |
1140 | if (top && middle) |
1140 | break; |
1141 | break; |
… | |
… | |
1178 | faces_obj [1] = middle; |
1179 | faces_obj [1] = middle; |
1179 | faces_obj [2] = floor; |
1180 | faces_obj [2] = floor; |
1180 | #endif |
1181 | #endif |
1181 | } |
1182 | } |
1182 | |
1183 | |
1183 | uint64 |
|
|
1184 | mapspace::volume () const |
|
|
1185 | { |
|
|
1186 | uint64 vol = 0; |
|
|
1187 | |
|
|
1188 | for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below) |
|
|
1189 | vol += op->volume (); |
|
|
1190 | |
|
|
1191 | return vol; |
|
|
1192 | } |
|
|
1193 | |
|
|
1194 | maptile * |
1184 | maptile * |
1195 | maptile::tile_available (int dir, bool load) |
1185 | maptile::tile_available (int dir, bool load) |
1196 | { |
1186 | { |
1197 | if (tile_path[dir]) |
1187 | if (tile_path[dir]) |
1198 | { |
1188 | { |
… | |
… | |
1434 | * |
1424 | * |
1435 | * currently, the only flag supported (0x1) is don't translate for |
1425 | * currently, the only flag supported (0x1) is don't translate for |
1436 | * closest body part of 'op1' |
1426 | * closest body part of 'op1' |
1437 | */ |
1427 | */ |
1438 | void |
1428 | void |
1439 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1429 | get_rangevector (object *op1, object *op2, rv_vector *retval, int flags) |
1440 | { |
1430 | { |
1441 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1431 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1442 | { |
1432 | { |
1443 | /* be conservative and fill in _some_ data */ |
1433 | /* be conservative and fill in _some_ data */ |
1444 | retval->distance = 10000; |
1434 | retval->distance = 10000; |
1445 | retval->distance_x = 10000; |
1435 | retval->distance_x = 10000; |
1446 | retval->distance_y = 10000; |
1436 | retval->distance_y = 10000; |
1447 | retval->direction = 0; |
1437 | retval->direction = 0; |
1448 | retval->part = 0; |
1438 | retval->part = 0; |
1449 | } |
1439 | } |
1450 | else |
1440 | else |
1451 | { |
1441 | { |
1452 | object *best; |
|
|
1453 | |
|
|
1454 | retval->distance_x += op2->x - op1->x; |
1442 | retval->distance_x += op2->x - op1->x; |
1455 | retval->distance_y += op2->y - op1->y; |
1443 | retval->distance_y += op2->y - op1->y; |
1456 | |
1444 | |
1457 | best = op1; |
1445 | object *best = op1; |
|
|
1446 | |
1458 | /* If this is multipart, find the closest part now */ |
1447 | /* If this is multipart, find the closest part now */ |
1459 | if (!(flags & 0x1) && op1->more) |
1448 | if (!(flags & 1) && op1->more) |
1460 | { |
1449 | { |
1461 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1450 | int best_distance = idistance (retval->distance_x, retval->distance_y); |
1462 | |
1451 | |
1463 | /* we just take the offset of the piece to head to figure |
1452 | /* we just take the offset of the piece to head to figure |
1464 | * distance instead of doing all that work above again |
1453 | * distance instead of doing all that work above again |
1465 | * since the distance fields we set above are positive in the |
1454 | * since the distance fields we set above are positive in the |
1466 | * same axis as is used for multipart objects, the simply arithmetic |
1455 | * same axis as is used for multipart objects, the simply arithmetic |
1467 | * below works. |
1456 | * below works. |
1468 | */ |
1457 | */ |
1469 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1458 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1470 | { |
1459 | { |
1471 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1460 | int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y); |
1472 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1461 | |
1473 | if (tmpi < best_distance) |
1462 | if (tmpi < best_distance) |
1474 | { |
1463 | { |
1475 | best_distance = tmpi; |
1464 | best_distance = tmpi; |
1476 | best = tmp; |
1465 | best = tmp; |
1477 | } |
1466 | } |
1478 | } |
1467 | } |
1479 | |
1468 | |
1480 | if (best != op1) |
1469 | if (best != op1) |
1481 | { |
1470 | { |
1482 | retval->distance_x += op1->x - best->x; |
1471 | retval->distance_x += op1->x - best->x; |
1483 | retval->distance_y += op1->y - best->y; |
1472 | retval->distance_y += op1->y - best->y; |
1484 | } |
1473 | } |
1485 | } |
1474 | } |
1486 | |
1475 | |
1487 | retval->part = best; |
1476 | retval->part = best; |
1488 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1477 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1489 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1478 | retval->direction = find_dir_2 (retval->distance_x, retval->distance_y); |
1490 | } |
1479 | } |
1491 | } |
1480 | } |
1492 | |
1481 | |
1493 | /* this is basically the same as get_rangevector above, but instead of |
1482 | /* this is basically the same as get_rangevector above, but instead of |
1494 | * the first parameter being an object, it instead is the map |
1483 | * the first parameter being an object, it instead is the map |
… | |
… | |
1504 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1493 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) |
1505 | { |
1494 | { |
1506 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1495 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
1507 | { |
1496 | { |
1508 | /* be conservative and fill in _some_ data */ |
1497 | /* be conservative and fill in _some_ data */ |
1509 | retval->distance = 100000; |
1498 | retval->distance = 100000; |
1510 | retval->distance_x = 32767; |
1499 | retval->distance_x = 32767; |
1511 | retval->distance_y = 32767; |
1500 | retval->distance_y = 32767; |
1512 | retval->direction = 0; |
1501 | retval->direction = 0; |
1513 | retval->part = 0; |
1502 | retval->part = 0; |
1514 | } |
1503 | } |
1515 | else |
1504 | else |
1516 | { |
1505 | { |
1517 | retval->distance_x += op2->x - x; |
1506 | retval->distance_x += op2->x - x; |
1518 | retval->distance_y += op2->y - y; |
1507 | retval->distance_y += op2->y - y; |
1519 | |
1508 | |
1520 | retval->part = 0; |
1509 | retval->part = 0; |
1521 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1510 | retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); |
1522 | retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); |
1511 | retval->direction = find_dir_2 (retval->distance_x, retval->distance_y); |
1523 | } |
1512 | } |
1524 | } |
1513 | } |
1525 | |
1514 | |
1526 | /* Returns true of op1 and op2 are effectively on the same map |
1515 | /* Returns true of op1 and op2 are effectively on the same map |
1527 | * (as related to map tiling). Note that this looks for a path from |
1516 | * (as related to map tiling). Note that this looks for a path from |
… | |
… | |
1537 | int dx, dy; |
1526 | int dx, dy; |
1538 | |
1527 | |
1539 | return adjacent_map (op1->map, op2->map, &dx, &dy); |
1528 | return adjacent_map (op1->map, op2->map, &dx, &dy); |
1540 | } |
1529 | } |
1541 | |
1530 | |
|
|
1531 | //-GPL |
|
|
1532 | |
1542 | object * |
1533 | object * |
1543 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1534 | maptile::insert (object *op, int x, int y, object *originator, int flags) |
1544 | { |
1535 | { |
1545 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1536 | return insert_ob_in_map_at (op, this, originator, flags, x, y); |
1546 | } |
1537 | } |
… | |
… | |
1557 | if (default_region) |
1548 | if (default_region) |
1558 | return default_region; |
1549 | return default_region; |
1559 | |
1550 | |
1560 | return ::region::default_region (); |
1551 | return ::region::default_region (); |
1561 | } |
1552 | } |
|
|
1553 | |
|
|
1554 | //+GPL |
1562 | |
1555 | |
1563 | /* picks a random object from a style map. |
1556 | /* picks a random object from a style map. |
1564 | */ |
1557 | */ |
1565 | object * |
1558 | object * |
1566 | maptile::pick_random_object (rand_gen &gen) const |
1559 | maptile::pick_random_object (rand_gen &gen) const |
… | |
… | |
1573 | */ |
1566 | */ |
1574 | for (int i = 1000; --i;) |
1567 | for (int i = 1000; --i;) |
1575 | { |
1568 | { |
1576 | object *pick = at (gen (width), gen (height)).bot; |
1569 | object *pick = at (gen (width), gen (height)).bot; |
1577 | |
1570 | |
1578 | // do not prefer big monsters just because they are big. |
1571 | // must be head: do not prefer big monsters just because they are big. |
1579 | if (pick && pick->is_head ()) |
1572 | if (pick && pick->is_head ()) |
1580 | return pick->head_ (); |
1573 | return pick; |
1581 | } |
1574 | } |
1582 | |
1575 | |
1583 | // instead of crashing in the unlikely(?) case, try to return *something* |
1576 | // instead of crashing in the unlikely(?) case, try to return *something* |
1584 | return archetype::find ("bug"); |
1577 | return archetype::find (shstr_bug); |
1585 | } |
1578 | } |
|
|
1579 | |
|
|
1580 | //-GPL |
1586 | |
1581 | |
1587 | void |
1582 | void |
1588 | maptile::play_sound (faceidx sound, int x, int y) const |
1583 | maptile::play_sound (faceidx sound, int x, int y) const |
1589 | { |
1584 | { |
1590 | if (!sound) |
1585 | if (!sound) |
… | |
… | |
1616 | |
1611 | |
1617 | if (distance <= MAX_SOUND_DISTANCE) |
1612 | if (distance <= MAX_SOUND_DISTANCE) |
1618 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
1613 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
1619 | } |
1614 | } |
1620 | } |
1615 | } |
|
|
1616 | |
|
|
1617 | dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25); |
1621 | |
1618 | |
1622 | static void |
1619 | static void |
1623 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
1620 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
1624 | { |
1621 | { |
1625 | // clip to map to the left |
1622 | // clip to map to the left |
… | |
… | |
1681 | r->dx = dx; |
1678 | r->dx = dx; |
1682 | r->dy = dy; |
1679 | r->dy = dy; |
1683 | } |
1680 | } |
1684 | |
1681 | |
1685 | maprect * |
1682 | maprect * |
1686 | maptile::split_to_tiles (int x0, int y0, int x1, int y1) |
1683 | maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1) |
1687 | { |
1684 | { |
1688 | static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8); |
|
|
1689 | buf.clear (); |
1685 | buf.clear (); |
1690 | |
1686 | |
1691 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
1687 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
1692 | |
1688 | |
1693 | // add end marker |
1689 | // add end marker |