ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/map.C
(Generate patch)

Comparing deliantra/server/common/map.C (file contents):
Revision 1.115 by root, Wed Aug 1 01:53:13 2007 UTC vs.
Revision 1.159 by root, Tue May 5 04:51:56 2009 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your 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,
… …
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 GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24#include <unistd.h> 24#include <unistd.h>
25 25
26#include "global.h" 26#include "global.h"
27#include "funcpoint.h"
28
29#include "loader.h" 27#include "loader.h"
30
31#include "path.h" 28#include "path.h"
29
30sint8 maptile::outdoor_darkness;
32 31
33/* This rolls up wall, blocks_magic, blocks_view, etc, all into 32/* This rolls up wall, blocks_magic, blocks_view, etc, all into
34 * one function that just returns a P_.. value (see map.h) 33 * one function that just returns a P_.. value (see map.h)
35 * it will also do map translation for tiled maps, returning 34 * it will also do map translation for tiled maps, returning
36 * new values into newmap, nx, and ny. Any and all of those 35 * new values into newmap, nx, and ny. Any and all of those
… …
166 } 165 }
167 return 0; 166 return 0;
168} 167}
169 168
170/* 169/*
171 * Returns true if the given object can't fit in the given spot. 170 * Returns qthe blocking object if the given object can't fit in the given
172 * This is meant for multi space objects - for single space objecs, 171 * spot. This is meant for multi space objects - for single space objecs,
173 * just calling get_map_blocked and checking that against movement type 172 * just calling get_map_blocked and checking that against movement type
174 * of object. This function goes through all the parts of the 173 * of object. This function goes through all the parts of the multipart
175 * multipart object and makes sure they can be inserted. 174 * object and makes sure they can be inserted.
176 * 175 *
177 * While this doesn't call out of map, the get_map_flags does. 176 * While this doesn't call out of map, the get_map_flags does.
178 * 177 *
179 * This function has been used to deprecate arch_out_of_map - 178 * This function has been used to deprecate arch_out_of_map -
180 * this function also does that check, and since in most cases, 179 * this function also does that check, and since in most cases,
… …
191 * 190 *
192 * Note this used to be arch_blocked, but with new movement 191 * Note this used to be arch_blocked, but with new movement
193 * code, we need to have actual object to check its move_type 192 * code, we need to have actual object to check its move_type
194 * against the move_block values. 193 * against the move_block values.
195 */ 194 */
196int 195bool
197ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 196object::blocked (maptile *m, int x, int y) const
198{ 197{
199 archetype *tmp; 198 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
200 int flag;
201 maptile *m1;
202 sint16 sx, sy;
203
204 if (!ob)
205 {
206 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
207 if (flag & P_OUT_OF_MAP)
208 return P_OUT_OF_MAP;
209
210 /* don't have object, so don't know what types would block */
211 return m1->at (sx, sy).move_block;
212 } 199 {
200 mapxy pos (m, x + tmp->x, y + tmp->y);
213 201
214 for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more) 202 if (!pos.normalise ())
215 { 203 return 1;
216 flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
217 204
218 if (flag & P_OUT_OF_MAP) 205 mapspace &ms = *pos;
219 return P_OUT_OF_MAP; 206
220 if (flag & P_IS_ALIVE) 207 if (ms.flags () & P_IS_ALIVE)
221 return P_IS_ALIVE; 208 return 1;
222 209
223 mapspace &ms = m1->at (sx, sy); 210 /* However, often ob doesn't have any move type
224 211 * (signifying non-moving objects)
225 /* find_first_free_spot() calls this function. However, often
226 * ob doesn't have any move type (when used to place exits)
227 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 212 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
228 */ 213 */
229
230 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 214 if (!move_type && ms.move_block != MOVE_ALL)
231 continue; 215 continue;
232 216
233 /* Note it is intentional that we check ob - the movement type of the 217 /* Note it is intentional that we check ob - the movement type of the
234 * head of the object should correspond for the entire object. 218 * head of the object should correspond for the entire object.
235 */ 219 */
236 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 220 if (ms.blocks (move_type))
237 return P_NO_PASS; 221 return 1;
238 } 222 }
239 223
240 return 0; 224 return 0;
241} 225}
242 226
… …
260 244
261 insert_ob_in_ob (tmp, container); 245 insert_ob_in_ob (tmp, container);
262 tmp = next; 246 tmp = next;
263 } 247 }
264 248
265 /* sum_weight will go through and calculate what all the containers are 249 // go through and calculate what all the containers are carrying.
266 * carrying. 250 //TODO: remove
267 */ 251 container->update_weight ();
268 sum_weight (container);
269} 252}
270 253
271void 254void
272maptile::set_object_flag (int flag, int value) 255maptile::set_object_flag (int flag, int value)
273{ 256{
… …
275 return; 258 return;
276 259
277 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 260 for (mapspace *ms = spaces + size (); ms-- > spaces; )
278 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 261 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
279 tmp->flag [flag] = value; 262 tmp->flag [flag] = value;
263}
264
265void
266maptile::post_load_original ()
267{
268 if (!spaces)
269 return;
270
271 set_object_flag (FLAG_OBJ_ORIGINAL);
272
273 for (mapspace *ms = spaces + size (); ms-- > spaces; )
274 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
275 INVOKE_OBJECT (RESET, tmp);
280} 276}
281 277
282/* link_multipart_objects go through all the objects on the map looking 278/* link_multipart_objects go through all the objects on the map looking
283 * for objects whose arch says they are multipart yet according to the 279 * for objects whose arch says they are multipart yet according to the
284 * info we have, they only have the head (as would be expected when 280 * info we have, they only have the head (as would be expected when
… …
322bool 318bool
323maptile::_load_objects (object_thawer &f) 319maptile::_load_objects (object_thawer &f)
324{ 320{
325 for (;;) 321 for (;;)
326 { 322 {
327 coroapi::cede_to_tick_every (100); // cede once in a while 323 coroapi::cede_to_tick (); // cede once in a while
328 324
329 switch (f.kw) 325 switch (f.kw)
330 { 326 {
331 case KW_arch: 327 case KW_arch:
332 if (object *op = object::read (f, this)) 328 if (object *op = object::read (f, this))
333 { 329 {
330 // TODO: why?
334 if (op->inv) 331 if (op->inv)
335 sum_weight (op); 332 op->update_weight ();
336 333
337 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 334 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
335 {
336 // we insert manually because
337 // a) its way faster
338 // b) we remove manually, too, and there are good reasons for that
339 // c) it's correct
340 mapspace &ms = at (op->x, op->y);
341
342 op->flag [FLAG_REMOVED] = false;
343
344 op->above = 0;
345 op->below = ms.top;
346
347 *(ms.top ? &ms.top->above : &ms.bot) = op;
348
349 ms.top = op;
350 ms.flags_ = 0;
351 }
352 else
353 {
354 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
355 op->destroy ();
356 }
338 } 357 }
339 358
340 continue; 359 continue;
341 360
342 case KW_EOF: 361 case KW_EOF:
… …
355} 374}
356 375
357void 376void
358maptile::activate () 377maptile::activate ()
359{ 378{
360 active = true;
361
362 if (spaces) 379 if (spaces)
363 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 380 for (mapspace *ms = spaces + size (); ms-- > spaces; )
364 for (object *op = ms->bot; op; op = op->above) 381 for (object *op = ms->bot; op; op = op->above)
365 op->activate_recursive (); 382 op->activate_recursive ();
366} 383}
367 384
368void 385void
369maptile::deactivate () 386maptile::deactivate ()
370{ 387{
371 active = false;
372
373 if (spaces) 388 if (spaces)
374 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 389 for (mapspace *ms = spaces + size (); ms-- > spaces; )
375 for (object *op = ms->bot; op; op = op->above) 390 for (object *op = ms->bot; op; op = op->above)
376 op->deactivate_recursive (); 391 op->deactivate_recursive ();
377} 392}
… …
387 if (!spaces) 402 if (!spaces)
388 return false; 403 return false;
389 404
390 for (int i = 0; i < size (); ++i) 405 for (int i = 0; i < size (); ++i)
391 { 406 {
392 int unique = 0; 407 bool unique = 0;
408
393 for (object *op = spaces [i].bot; op; op = op->above) 409 for (object *op = spaces [i].bot; op; op = op->above)
394 { 410 {
395 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 411 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
396 unique = 1;
397 412
398 if (!op->can_map_save ()) 413 if (expect_false (!op->can_map_save ()))
399 continue; 414 continue;
400 415
401 if (unique || op->flag [FLAG_UNIQUE]) 416 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
402 { 417 {
403 if (flags & IO_UNIQUES) 418 if (flags & IO_UNIQUES)
404 op->write (f); 419 op->write (f);
405 } 420 }
406 else if (flags & IO_OBJECTS) 421 else if (expect_true (flags & IO_OBJECTS))
407 op->write (f); 422 op->write (f);
408 } 423 }
409 } 424 }
410 425
411 coroapi::cede_to_tick (); 426 coroapi::cede_to_tick ();
412 427
413 return true; 428 return true;
414}
415
416bool
417maptile::_load_objects (const char *path, bool skip_header)
418{
419 object_thawer f (path);
420
421 if (!f)
422 return false;
423
424 f.next ();
425
426 if (skip_header)
427 for (;;)
428 {
429 keyword kw = f.kw;
430 f.skip ();
431 if (kw == KW_end)
432 break;
433 }
434
435 return _load_objects (f);
436} 429}
437 430
438bool 431bool
439maptile::_save_objects (const char *path, int flags) 432maptile::_save_objects (const char *path, int flags)
440{ 433{
… …
615bool 608bool
616maptile::_load_header (object_thawer &thawer) 609maptile::_load_header (object_thawer &thawer)
617{ 610{
618 for (;;) 611 for (;;)
619 { 612 {
620 thawer.next ();
621
622 switch (thawer.kw) 613 switch (thawer.kw)
623 { 614 {
624 case KW_msg: 615 case KW_msg:
625 thawer.get_ml (KW_endmsg, msg); 616 thawer.get_ml (KW_endmsg, msg);
626 break; 617 break;
… …
660 case KW_sky: thawer.get (sky); break; 651 case KW_sky: thawer.get (sky); break;
661 652
662 case KW_per_player: thawer.get (per_player); break; 653 case KW_per_player: thawer.get (per_player); break;
663 case KW_per_party: thawer.get (per_party); break; 654 case KW_per_party: thawer.get (per_party); break;
664 case KW_no_reset: thawer.get (no_reset); break; 655 case KW_no_reset: thawer.get (no_reset); break;
656 case KW_no_drop: thawer.get (no_drop); break;
665 657
666 case KW_region: default_region = region::find (thawer.get_str ()); break; 658 case KW_region: default_region = region::find (thawer.get_str ()); break;
667 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 659 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
668 660
669 // old names new names 661 // old names new names
… …
681 case KW_tile_path_2: thawer.get (tile_path [1]); break; 673 case KW_tile_path_2: thawer.get (tile_path [1]); break;
682 case KW_tile_path_3: thawer.get (tile_path [2]); break; 674 case KW_tile_path_3: thawer.get (tile_path [2]); break;
683 case KW_tile_path_4: thawer.get (tile_path [3]); break; 675 case KW_tile_path_4: thawer.get (tile_path [3]); break;
684 676
685 case KW_ERROR: 677 case KW_ERROR:
686 set_key (thawer.kw_str, thawer.value); 678 set_key_text (thawer.kw_str, thawer.value);
687 break; 679 break;
688 680
689 case KW_end: 681 case KW_end:
682 thawer.next ();
690 return true; 683 return true;
691 684
692 default: 685 default:
693 if (!thawer.parse_error ("map", 0)) 686 if (!thawer.parse_error ("map", 0))
694 return false; 687 return false;
695 break; 688 break;
696 } 689 }
690
691 thawer.next ();
697 } 692 }
698 693
699 abort (); 694 abort ();
700}
701
702bool
703maptile::_load_header (const char *path)
704{
705 object_thawer thawer (path);
706
707 if (!thawer)
708 return false;
709
710 return _load_header (thawer);
711} 695}
712 696
713/****************************************************************************** 697/******************************************************************************
714 * This is the start of unique map handling code 698 * This is the start of unique map handling code
715 *****************************************************************************/ 699 *****************************************************************************/
… …
727 711
728 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 712 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
729 unique = 1; 713 unique = 1;
730 714
731 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 715 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
732 {
733 op->destroy_inv (false);
734 op->destroy (); 716 op->destroy ();
735 }
736 717
737 op = above; 718 op = above;
738 } 719 }
739 } 720 }
740} 721}
… …
751 MAP_OUT (swap_time); 732 MAP_OUT (swap_time);
752 MAP_OUT (reset_time); 733 MAP_OUT (reset_time);
753 MAP_OUT (reset_timeout); 734 MAP_OUT (reset_timeout);
754 MAP_OUT (fixed_resettime); 735 MAP_OUT (fixed_resettime);
755 MAP_OUT (no_reset); 736 MAP_OUT (no_reset);
737 MAP_OUT (no_drop);
756 MAP_OUT (difficulty); 738 MAP_OUT (difficulty);
757 739
758 if (default_region) MAP_OUT2 (region, default_region->name); 740 if (default_region) MAP_OUT2 (region, default_region->name);
759 741
760 if (shopitems) 742 if (shopitems)
… …
814 * Remove and free all objects in the given map. 796 * Remove and free all objects in the given map.
815 */ 797 */
816void 798void
817maptile::clear () 799maptile::clear ()
818{ 800{
819 sfree (regions, size ()); regions = 0;
820 delete [] regionmap; regionmap = 0;
821
822 if (spaces) 801 if (spaces)
823 { 802 {
824 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 803 for (mapspace *ms = spaces + size (); ms-- > spaces; )
825 while (object *op = ms->bot) 804 while (object *op = ms->bot)
826 { 805 {
806 // manually remove, as to not trigger anything
807 if (ms->bot = op->above)
808 ms->bot->below = 0;
809
810 op->flag [FLAG_REMOVED] = true;
811
827 op = op->head_ (); 812 object *head = op->head_ ();
828 op->destroy_inv (false); 813 if (op == head)
829 op->destroy (); 814 op->destroy ();
815 else if (head->map != op->map)
816 {
817 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
818 head->destroy ();
819 }
830 } 820 }
831 821
832 sfree (spaces, size ()), spaces = 0; 822 sfree0 (spaces, size ());
833 } 823 }
834 824
835 if (buttons) 825 if (buttons)
836 free_objectlinkpt (buttons), buttons = 0; 826 free_objectlinkpt (buttons), buttons = 0;
827
828 sfree0 (regions, size ());
829 delete [] regionmap; regionmap = 0;
837} 830}
838 831
839void 832void
840maptile::clear_header () 833maptile::clear_header ()
841{ 834{
… …
893 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 886 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
894 break; 887 break;
895 888
896 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 889 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
897 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) 890 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
898 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
899 || QUERY_FLAG (op, FLAG_UNIQUE) 891 || QUERY_FLAG (op, FLAG_UNIQUE)
900 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) 892 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
901 || QUERY_FLAG (op, FLAG_UNPAID) 893 || QUERY_FLAG (op, FLAG_UNPAID)
902 || op->is_alive ()) 894 || op->is_alive ())
903 ; // do not decay 895 ; // do not decay
… …
942 op->destroy (); 934 op->destroy ();
943 } 935 }
944} 936}
945 937
946/* 938/*
947 * Updates every button on the map (by calling update_button() for them).
948 */
949void
950maptile::update_buttons ()
951{
952 for (oblinkpt *obp = buttons; obp; obp = obp->next)
953 for (objectlink *ol = obp->link; ol; ol = ol->next)
954 {
955 if (!ol->ob)
956 {
957 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
958 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
959 continue;
960 }
961
962 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
963 {
964 update_button (ol->ob);
965 break;
966 }
967 }
968}
969
970/*
971 * This routine is supposed to find out the difficulty of the map. 939 * This routine is supposed to find out the difficulty of the map.
972 * difficulty does not have a lot to do with character level, 940 * difficulty does not have a lot to do with character level,
973 * but does have a lot to do with treasure on the map. 941 * but does have a lot to do with treasure on the map.
974 * 942 *
975 * Difficulty can now be set by the map creature. If the value stored 943 * Difficulty can now be set by the map creator. If the value stored
976 * in the map is zero, then use this routine. Maps should really 944 * in the map is zero, then use this routine. Maps should really
977 * have a difficulty set than using this function - human calculation 945 * have a difficulty set rather than using this function - human calculation
978 * is much better than this functions guesswork. 946 * is much better than this function's guesswork.
979 */ 947 */
980int 948int
981maptile::estimate_difficulty () const 949maptile::estimate_difficulty () const
982{ 950{
983 long monster_cnt = 0; 951 long monster_cnt = 0;
… …
995 963
996 if (QUERY_FLAG (op, FLAG_GENERATOR)) 964 if (QUERY_FLAG (op, FLAG_GENERATOR))
997 { 965 {
998 total_exp += op->stats.exp; 966 total_exp += op->stats.exp;
999 967
1000 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 968 if (archetype *at = op->other_arch)
969 {
1001 total_exp += at->stats.exp * 8; 970 total_exp += at->stats.exp * 8;
1002
1003 monster_cnt++; 971 monster_cnt++;
972 }
973
974 for (object *inv = op->inv; inv; inv = inv->below)
975 {
976 total_exp += op->stats.exp * 8;
977 monster_cnt++;
978 }
1004 } 979 }
1005 } 980 }
1006 981
1007 avgexp = (double) total_exp / monster_cnt; 982 avgexp = (double) total_exp / monster_cnt;
1008 983
… …
1021 * postive values make it darker, negative make it brighter 996 * postive values make it darker, negative make it brighter
1022 */ 997 */
1023int 998int
1024maptile::change_map_light (int change) 999maptile::change_map_light (int change)
1025{ 1000{
1026 int new_level = darkness + change;
1027
1028 /* Nothing to do */ 1001 /* Nothing to do */
1029 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1002 if (!change)
1030 return 0; 1003 return 0;
1031 1004
1032 /* inform all players on the map */ 1005 /* inform all players on the map */
1033 if (change > 0) 1006 if (change > 0)
1034 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1007 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1035 else 1008 else
1036 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1009 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1037 1010
1038 /* Do extra checking. since darkness is a unsigned value, 1011 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1039 * we need to be extra careful about negative values.
1040 * In general, the checks below are only needed if change
1041 * is not +/-1
1042 */
1043 if (new_level < 0)
1044 darkness = 0;
1045 else if (new_level >= MAX_DARKNESS)
1046 darkness = MAX_DARKNESS;
1047 else
1048 darkness = new_level;
1049 1012
1050 /* All clients need to get re-updated for the change */ 1013 /* All clients need to get re-updated for the change */
1051 update_all_map_los (this); 1014 update_all_map_los (this);
1015
1052 return 1; 1016 return 1;
1053} 1017}
1054 1018
1055/* 1019/*
1056 * This function updates various attributes about a specific space 1020 * This function updates various attributes about a specific space
… …
1059 * through, etc) 1023 * through, etc)
1060 */ 1024 */
1061void 1025void
1062mapspace::update_ () 1026mapspace::update_ ()
1063{ 1027{
1064 object *tmp, *last = 0; 1028 object *last = 0;
1065 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1029 uint8 flags = P_UPTODATE, anywhere = 0;
1030 sint8 light = 0;
1066 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1031 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1067 1032
1068 //object *middle = 0; 1033 //object *middle = 0;
1069 //object *top = 0; 1034 //object *top = 0;
1070 //object *floor = 0; 1035 //object *floor = 0;
1071 // this seems to generate better code than using locals, above 1036 // this seems to generate better code than using locals, above
1072 object *&top = faces_obj[0] = 0; 1037 object *&top = faces_obj[0] = 0;
1073 object *&middle = faces_obj[1] = 0; 1038 object *&middle = faces_obj[1] = 0;
1074 object *&floor = faces_obj[2] = 0; 1039 object *&floor = faces_obj[2] = 0;
1075 1040
1076 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1041 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1077 { 1042 {
1078 /* This could be made additive I guess (two lights better than 1043 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1079 * one). But if so, it shouldn't be a simple additive - 2
1080 * light bulbs do not illuminate twice as far as once since
1081 * it is a dissapation factor that is cubed.
1082 */
1083 if (tmp->glow_radius > light)
1084 light = tmp->glow_radius; 1044 light += tmp->glow_radius;
1085 1045
1086 /* This call is needed in order to update objects the player 1046 /* This call is needed in order to update objects the player
1087 * is standing in that have animations (ie, grass, fire, etc). 1047 * is standing in that have animations (ie, grass, fire, etc).
1088 * However, it also causes the look window to be re-drawn 1048 * However, it also causes the look window to be re-drawn
1089 * 3 times each time the player moves, because many of the 1049 * 3 times each time the player moves, because many of the
… …
1108 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1068 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1109 { 1069 {
1110 middle = tmp; 1070 middle = tmp;
1111 anywhere = 1; 1071 anywhere = 1;
1112 } 1072 }
1073
1113 /* Find the highest visible face around. If equal 1074 /* Find the highest visible face around. If equal
1114 * visibilities, we still want the one nearer to the 1075 * visibilities, we still want the one nearer to the
1115 * top 1076 * top
1116 */ 1077 */
1117 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere)) 1078 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
… …
1136 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1097 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1137 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1098 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1138 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1099 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1139 } 1100 }
1140 1101
1141 this->light = light; 1102 this->light = min (light, MAX_LIGHT_RADIUS);
1142 this->flags_ = flags; 1103 this->flags_ = flags;
1143 this->move_block = move_block & ~move_allow; 1104 this->move_block = move_block & ~move_allow;
1144 this->move_on = move_on; 1105 this->move_on = move_on;
1145 this->move_off = move_off; 1106 this->move_off = move_off;
1146 this->move_slow = move_slow; 1107 this->move_slow = move_slow;
… …
1166 * 1) top face is set, need middle to be set. 1127 * 1) top face is set, need middle to be set.
1167 * 2) middle is set, need to set top. 1128 * 2) middle is set, need to set top.
1168 * 3) neither middle or top is set - need to set both. 1129 * 3) neither middle or top is set - need to set both.
1169 */ 1130 */
1170 1131
1171 for (tmp = last; tmp; tmp = tmp->below) 1132 for (object *tmp = last; tmp; tmp = tmp->below)
1172 { 1133 {
1173 /* Once we get to a floor, stop, since we already have a floor object */ 1134 /* Once we get to a floor, stop, since we already have a floor object */
1174 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1135 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1175 break; 1136 break;
1176 1137
… …
1228 vol += op->volume (); 1189 vol += op->volume ();
1229 1190
1230 return vol; 1191 return vol;
1231} 1192}
1232 1193
1233/* this updates the orig_map->tile_map[tile_num] value after finding 1194maptile *
1234 * the map. It also takes care of linking back the freshly found 1195maptile::tile_available (int dir, bool load)
1235 * maps tile_map values if it tiles back to this one. It returns
1236 * the value of orig_map->tile_map[tile_num].
1237 */
1238static inline maptile *
1239find_and_link (maptile *orig_map, int tile_num)
1240{ 1196{
1241 maptile *mp = orig_map->tile_map [tile_num]; 1197 if (tile_path[dir])
1242
1243 if (!mp)
1244 {
1245 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1246
1247 if (!mp)
1248 {
1249 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1250 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1251 &orig_map->tile_path[tile_num], &orig_map->path);
1252 mp = new maptile (1, 1);
1253 mp->alloc ();
1254 mp->in_memory = MAP_IN_MEMORY;
1255 }
1256 } 1198 {
1199 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1200 return tile_map[dir];
1257 1201
1258 int dest_tile = (tile_num + 2) % 4; 1202 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1203 return tile_map[dir];
1204 }
1259 1205
1260 orig_map->tile_map [tile_num] = mp;
1261
1262 // optimisation: back-link map to origin map if euclidean
1263 //TODO: non-euclidean maps MUST GO
1264 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1265 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1266
1267 return mp; 1206 return 0;
1268}
1269
1270static inline void
1271load_and_link (maptile *orig_map, int tile_num)
1272{
1273 find_and_link (orig_map, tile_num)->load_sync ();
1274} 1207}
1275 1208
1276/* this returns TRUE if the coordinates (x,y) are out of 1209/* this returns TRUE if the coordinates (x,y) are out of
1277 * map m. This function also takes into account any 1210 * map m. This function also takes into account any
1278 * tiling considerations, loading adjacant maps as needed. 1211 * tiling considerations, loading adjacant maps as needed.
… …
1291 if (!m) 1224 if (!m)
1292 return 0; 1225 return 0;
1293 1226
1294 if (x < 0) 1227 if (x < 0)
1295 { 1228 {
1296 if (!m->tile_path[3]) 1229 if (!m->tile_available (3))
1297 return 1; 1230 return 1;
1298 1231
1299 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1300 find_and_link (m, 3);
1301
1302 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1232 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1303 } 1233 }
1304 1234
1305 if (x >= m->width) 1235 if (x >= m->width)
1306 { 1236 {
1307 if (!m->tile_path[1]) 1237 if (!m->tile_available (1))
1308 return 1; 1238 return 1;
1309 1239
1310 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1311 find_and_link (m, 1);
1312
1313 return out_of_map (m->tile_map[1], x - m->width, y); 1240 return out_of_map (m->tile_map[1], x - m->width, y);
1314 } 1241 }
1315 1242
1316 if (y < 0) 1243 if (y < 0)
1317 { 1244 {
1318 if (!m->tile_path[0]) 1245 if (!m->tile_available (0))
1319 return 1; 1246 return 1;
1320 1247
1321 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1322 find_and_link (m, 0);
1323
1324 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1248 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1325 } 1249 }
1326 1250
1327 if (y >= m->height) 1251 if (y >= m->height)
1328 { 1252 {
1329 if (!m->tile_path[2]) 1253 if (!m->tile_available (2))
1330 return 1; 1254 return 1;
1331
1332 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1333 find_and_link (m, 2);
1334 1255
1335 return out_of_map (m->tile_map[2], x, y - m->height); 1256 return out_of_map (m->tile_map[2], x, y - m->height);
1336 } 1257 }
1337 1258
1338 /* Simple case - coordinates are within this local 1259 /* Simple case - coordinates are within this local
… …
1352maptile * 1273maptile *
1353maptile::xy_find (sint16 &x, sint16 &y) 1274maptile::xy_find (sint16 &x, sint16 &y)
1354{ 1275{
1355 if (x < 0) 1276 if (x < 0)
1356 { 1277 {
1357 if (!tile_path[3]) 1278 if (!tile_available (3))
1358 return 0; 1279 return 0;
1359 1280
1360 find_and_link (this, 3);
1361 x += tile_map[3]->width; 1281 x += tile_map[3]->width;
1362 return tile_map[3]->xy_find (x, y); 1282 return tile_map[3]->xy_find (x, y);
1363 } 1283 }
1364 1284
1365 if (x >= width) 1285 if (x >= width)
1366 { 1286 {
1367 if (!tile_path[1]) 1287 if (!tile_available (1))
1368 return 0; 1288 return 0;
1369 1289
1370 find_and_link (this, 1);
1371 x -= width; 1290 x -= width;
1372 return tile_map[1]->xy_find (x, y); 1291 return tile_map[1]->xy_find (x, y);
1373 } 1292 }
1374 1293
1375 if (y < 0) 1294 if (y < 0)
1376 { 1295 {
1377 if (!tile_path[0]) 1296 if (!tile_available (0))
1378 return 0; 1297 return 0;
1379 1298
1380 find_and_link (this, 0);
1381 y += tile_map[0]->height; 1299 y += tile_map[0]->height;
1382 return tile_map[0]->xy_find (x, y); 1300 return tile_map[0]->xy_find (x, y);
1383 } 1301 }
1384 1302
1385 if (y >= height) 1303 if (y >= height)
1386 { 1304 {
1387 if (!tile_path[2]) 1305 if (!tile_available (2))
1388 return 0; 1306 return 0;
1389 1307
1390 find_and_link (this, 2);
1391 y -= height; 1308 y -= height;
1392 return tile_map[2]->xy_find (x, y); 1309 return tile_map[2]->xy_find (x, y);
1393 } 1310 }
1394 1311
1395 /* Simple case - coordinates are within this local 1312 /* Simple case - coordinates are within this local
… …
1406adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1323adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1407{ 1324{
1408 if (!map1 || !map2) 1325 if (!map1 || !map2)
1409 return 0; 1326 return 0;
1410 1327
1411 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded 1328 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1412 //fix: compare paths instead (this is likely faster, too!) 1329 //fix: compare paths instead (this is likely faster, too!)
1413 if (map1 == map2) 1330 if (map1 == map2)
1414 { 1331 {
1415 *dx = 0; 1332 *dx = 0;
1416 *dy = 0; 1333 *dy = 0;
… …
1598 else 1515 else
1599 { 1516 {
1600 retval->distance_x += op2->x - x; 1517 retval->distance_x += op2->x - x;
1601 retval->distance_y += op2->y - y; 1518 retval->distance_y += op2->y - y;
1602 1519
1603 retval->part = NULL; 1520 retval->part = 0;
1604 retval->distance = idistance (retval->distance_x, retval->distance_y); 1521 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1605 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1522 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1606 } 1523 }
1607} 1524}
1608 1525
1609/* Returns true of op1 and op2 are effectively on the same map 1526/* Returns true of op1 and op2 are effectively on the same map
… …
1623} 1540}
1624 1541
1625object * 1542object *
1626maptile::insert (object *op, int x, int y, object *originator, int flags) 1543maptile::insert (object *op, int x, int y, object *originator, int flags)
1627{ 1544{
1628 if (!op->flag [FLAG_REMOVED])
1629 op->remove ();
1630
1631 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1545 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1632} 1546}
1633 1547
1634region * 1548region *
1635maptile::region (int x, int y) const 1549maptile::region (int x, int y) const
… …
1645 1559
1646 return ::region::default_region (); 1560 return ::region::default_region ();
1647} 1561}
1648 1562
1649/* picks a random object from a style map. 1563/* picks a random object from a style map.
1650 * Redone by MSW so it should be faster and not use static
1651 * variables to generate tables.
1652 */ 1564 */
1653object * 1565object *
1654maptile::pick_random_object () const 1566maptile::pick_random_object (rand_gen &gen) const
1655{ 1567{
1656 /* while returning a null object will result in a crash, that 1568 /* while returning a null object will result in a crash, that
1657 * is actually preferable to an infinite loop. That is because 1569 * is actually preferable to an infinite loop. That is because
1658 * most servers will automatically restart in case of crash. 1570 * most servers will automatically restart in case of crash.
1659 * Change the logic on getting the random space - shouldn't make 1571 * Change the logic on getting the random space - shouldn't make
1660 * any difference, but this seems clearer to me. 1572 * any difference, but this seems clearer to me.
1661 */ 1573 */
1662 for (int i = 1000; --i;) 1574 for (int i = 1000; --i;)
1663 { 1575 {
1664 object *pick = at (rndm (width), rndm (height)).bot; 1576 object *pick = at (gen (width), gen (height)).bot;
1665 1577
1666 // do not prefer big monsters just because they are big. 1578 // do not prefer big monsters just because they are big.
1667 if (pick && pick->head_ () == pick) 1579 if (pick && pick->is_head ())
1668 return pick->head_ (); 1580 return pick->head_ ();
1669 } 1581 }
1670 1582
1671 // instead of crashing in the unlikely(?) case, try to return *something* 1583 // instead of crashing in the unlikely(?) case, try to return *something*
1672 return get_archetype ("blocked"); 1584 return archetype::find ("bug");
1673} 1585}
1674 1586
1675void 1587void
1676maptile::play_sound (faceidx sound, int x, int y) const 1588maptile::play_sound (faceidx sound, int x, int y) const
1677{ 1589{
1678 if (!sound) 1590 if (!sound)
1679 return; 1591 return;
1680 1592
1593 for_all_players_on_map (pl, this)
1594 if (client *ns = pl->ns)
1595 {
1596 int dx = x - pl->ob->x;
1597 int dy = y - pl->ob->y;
1598
1599 int distance = idistance (dx, dy);
1600
1601 if (distance <= MAX_SOUND_DISTANCE)
1602 ns->play_sound (sound, dx, dy);
1603 }
1604}
1605
1606void
1607maptile::say_msg (const char *msg, int x, int y) const
1608{
1681 for_all_players (pl) 1609 for_all_players (pl)
1682 if (pl->ob->map == this)
1683 if (client *ns = pl->ns) 1610 if (client *ns = pl->ns)
1684 { 1611 {
1685 int dx = x - pl->ob->x; 1612 int dx = x - pl->ob->x;
1686 int dy = y - pl->ob->y; 1613 int dy = y - pl->ob->y;
1687 1614
1688 int distance = idistance (dx, dy); 1615 int distance = idistance (dx, dy);
1689 1616
1690 if (distance <= MAX_SOUND_DISTANCE) 1617 if (distance <= MAX_SOUND_DISTANCE)
1691 ns->play_sound (sound, dx, dy); 1618 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1692 } 1619 }
1693} 1620}
1694 1621
1622static void
1623split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1624{
1625 // clip to map to the left
1626 if (x0 < 0)
1627 {
1628 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1629 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1630
1631 if (x1 < 0) // entirely to the left
1632 return;
1633
1634 x0 = 0;
1635 }
1636
1637 // clip to map to the right
1638 if (x1 > m->width)
1639 {
1640 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1641 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1642
1643 if (x0 > m->width) // entirely to the right
1644 return;
1645
1646 x1 = m->width;
1647 }
1648
1649 // clip to map above
1650 if (y0 < 0)
1651 {
1652 if (maptile *tile = m->tile_available (TILE_UP, 1))
1653 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1654
1655 if (y1 < 0) // entirely above
1656 return;
1657
1658 y0 = 0;
1659 }
1660
1661 // clip to map below
1662 if (y1 > m->height)
1663 {
1664 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1665 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1666
1667 if (y0 > m->height) // entirely below
1668 return;
1669
1670 y1 = m->height;
1671 }
1672
1673 // if we get here, the rect is within the current map
1674 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1675
1676 r->m = m;
1677 r->x0 = x0;
1678 r->y0 = y0;
1679 r->x1 = x1;
1680 r->y1 = y1;
1681 r->dx = dx;
1682 r->dy = dy;
1683}
1684
1685maprect *
1686maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1687{
1688 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1689 buf.clear ();
1690
1691 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1692
1693 // add end marker
1694 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1695 r->m = 0;
1696
1697 return (maprect *)buf.linearise ();
1698}
1699

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines