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