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.104 by root, Fri May 18 00:09:16 2007 UTC vs.
Revision 1.114 by root, Thu Jul 26 00:27:07 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT 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 2 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,
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 GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 22 */
24 23
25#include <unistd.h> 24#include <unistd.h>
26 25
27#include "global.h" 26#include "global.h"
28#include "funcpoint.h" 27#include "funcpoint.h"
29 28
30#include "loader.h" 29#include "loader.h"
31 30
32#include "path.h" 31#include "path.h"
33
34/*
35 * This makes a path absolute outside the world of Crossfire.
36 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
37 * and returns the pointer to a static array containing the result.
38 * it really should be called create_mapname
39 */
40const char *
41create_pathname (const char *name)
42{
43 static char buf[8192];
44 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
45 return buf;
46}
47
48/*
49 * This function checks if a file with the given path exists.
50 * -1 is returned if it fails, otherwise the mode of the file
51 * is returned.
52 * It tries out all the compression suffixes listed in the uncomp[] array.
53 *
54 * If prepend_dir is set, then we call create_pathname (which prepends
55 * libdir & mapdir). Otherwise, we assume the name given is fully
56 * complete.
57 * Only the editor actually cares about the writablity of this -
58 * the rest of the code only cares that the file is readable.
59 * when the editor goes away, the call to stat should probably be
60 * replaced by an access instead (similar to the windows one, but
61 * that seems to be missing the prepend_dir processing
62 */
63int
64check_path (const char *name, int prepend_dir)
65{
66 char buf[MAX_BUF];
67
68 char *endbuf;
69 struct stat statbuf;
70 int mode = 0;
71
72 if (prepend_dir)
73 assign (buf, create_pathname (name));
74 else
75 assign (buf, name);
76
77 /* old method (strchr(buf, '\0')) seemd very odd to me -
78 * this method should be equivalant and is clearer.
79 * Can not use strcat because we need to cycle through
80 * all the names.
81 */
82 endbuf = buf + strlen (buf);
83
84 if (stat (buf, &statbuf))
85 return -1;
86 if (!S_ISREG (statbuf.st_mode))
87 return (-1);
88
89 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
90 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
91 mode |= 4;
92
93 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
94 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
95 mode |= 2;
96
97 return (mode);
98}
99 32
100/* This rolls up wall, blocks_magic, blocks_view, etc, all into 33/* This rolls up wall, blocks_magic, blocks_view, etc, all into
101 * one function that just returns a P_.. value (see map.h) 34 * one function that just returns a P_.. value (see map.h)
102 * it will also do map translation for tiled maps, returning 35 * it will also do map translation for tiled maps, returning
103 * new values into newmap, nx, and ny. Any and all of those 36 * new values into newmap, nx, and ny. Any and all of those
… …
276 209
277 /* don't have object, so don't know what types would block */ 210 /* don't have object, so don't know what types would block */
278 return m1->at (sx, sy).move_block; 211 return m1->at (sx, sy).move_block;
279 } 212 }
280 213
281 for (tmp = ob->arch; tmp; tmp = tmp->more) 214 for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more)
282 { 215 {
283 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy); 216 flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
284 217
285 if (flag & P_OUT_OF_MAP) 218 if (flag & P_OUT_OF_MAP)
286 return P_OUT_OF_MAP; 219 return P_OUT_OF_MAP;
287 if (flag & P_IS_ALIVE) 220 if (flag & P_IS_ALIVE)
288 return P_IS_ALIVE; 221 return P_IS_ALIVE;
… …
356{ 289{
357 if (!spaces) 290 if (!spaces)
358 return; 291 return;
359 292
360 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 293 for (mapspace *ms = spaces + size (); ms-- > spaces; )
361 for (object *op = ms->bot; op; op = op->above) 294 {
295 object *op = ms->bot;
296 while (op)
362 { 297 {
363 /* already multipart - don't do anything more */ 298 /* already multipart - don't do anything more */
364 if (op->head_ () == op && !op->more && op->arch->more) 299 if (op->head_ () == op && !op->more && op->arch->more)
365 { 300 {
366 op->remove (); 301 op->remove ();
367 op->expand_tail (); 302 op->expand_tail ();
303
304 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
305 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
306 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
368 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 307 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
308
309 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
310 // so we have to reset the iteration through the mapspace
369 } 311 }
312 else
313 op = op->above;
370 } 314 }
315 }
371} 316}
372 317
373/* 318/*
374 * Loads (ands parses) the objects into a given map from the specified 319 * Loads (ands parses) the objects into a given map from the specified
375 * file pointer. 320 * file pointer.
… …
670bool 615bool
671maptile::_load_header (object_thawer &thawer) 616maptile::_load_header (object_thawer &thawer)
672{ 617{
673 for (;;) 618 for (;;)
674 { 619 {
675 keyword kw = thawer.get_kv (); 620 thawer.next ();
676 621
677 switch (kw) 622 switch (thawer.kw)
678 { 623 {
679 case KW_msg: 624 case KW_msg:
680 thawer.get_ml (KW_endmsg, msg); 625 thawer.get_ml (KW_endmsg, msg);
681 break; 626 break;
682 627
… …
714 case KW_winddir: thawer.get (winddir); break; 659 case KW_winddir: thawer.get (winddir); break;
715 case KW_sky: thawer.get (sky); break; 660 case KW_sky: thawer.get (sky); break;
716 661
717 case KW_per_player: thawer.get (per_player); break; 662 case KW_per_player: thawer.get (per_player); break;
718 case KW_per_party: thawer.get (per_party); break; 663 case KW_per_party: thawer.get (per_party); break;
664 case KW_no_reset: thawer.get (no_reset); break;
719 665
720 case KW_region: default_region = region::find (thawer.get_str ()); break; 666 case KW_region: default_region = region::find (thawer.get_str ()); break;
721 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 667 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
722 668
723 // old names new names 669 // old names new names
… …
734 case KW_tile_path_1: thawer.get (tile_path [0]); break; 680 case KW_tile_path_1: thawer.get (tile_path [0]); break;
735 case KW_tile_path_2: thawer.get (tile_path [1]); break; 681 case KW_tile_path_2: thawer.get (tile_path [1]); break;
736 case KW_tile_path_3: thawer.get (tile_path [2]); break; 682 case KW_tile_path_3: thawer.get (tile_path [2]); break;
737 case KW_tile_path_4: thawer.get (tile_path [3]); break; 683 case KW_tile_path_4: thawer.get (tile_path [3]); break;
738 684
685 case KW_ERROR:
686 set_key (thawer.kw_str, thawer.value);
687 break;
688
739 case KW_end: 689 case KW_end:
740 return true; 690 return true;
741 691
742 default: 692 default:
743 if (!thawer.parse_error ("map", 0)) 693 if (!thawer.parse_error ("map", 0))
… …
800 if (name) MAP_OUT (name); 750 if (name) MAP_OUT (name);
801 MAP_OUT (swap_time); 751 MAP_OUT (swap_time);
802 MAP_OUT (reset_time); 752 MAP_OUT (reset_time);
803 MAP_OUT (reset_timeout); 753 MAP_OUT (reset_timeout);
804 MAP_OUT (fixed_resettime); 754 MAP_OUT (fixed_resettime);
755 MAP_OUT (no_reset);
805 MAP_OUT (difficulty); 756 MAP_OUT (difficulty);
806 757
807 if (default_region) MAP_OUT2 (region, default_region->name); 758 if (default_region) MAP_OUT2 (region, default_region->name);
808 759
809 if (shopitems) 760 if (shopitems)
… …
863 * Remove and free all objects in the given map. 814 * Remove and free all objects in the given map.
864 */ 815 */
865void 816void
866maptile::clear () 817maptile::clear ()
867{ 818{
868 sfree (regions, size ()), regions = 0; 819 sfree (regions, size ()); regions = 0;
869 free (regionmap), regionmap = 0; 820 delete [] regionmap; regionmap = 0;
870 821
871 if (spaces) 822 if (spaces)
872 { 823 {
873 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 824 for (mapspace *ms = spaces + size (); ms-- > spaces; )
874 while (object *op = ms->bot) 825 while (object *op = ms->bot)
… …
920maptile::do_destroy () 871maptile::do_destroy ()
921{ 872{
922 attachable::do_destroy (); 873 attachable::do_destroy ();
923 874
924 clear (); 875 clear ();
876}
877
878/* decay and destroy perishable items in a map */
879void
880maptile::do_decay_objects ()
881{
882 if (!spaces)
883 return;
884
885 for (mapspace *ms = spaces + size (); ms-- > spaces; )
886 for (object *above, *op = ms->bot; op; op = above)
887 {
888 above = op->above;
889
890 bool destroy = 0;
891
892 // do not decay anything above unique floor tiles (yet :)
893 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
894 break;
895
896 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
897 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
898 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
899 || QUERY_FLAG (op, FLAG_UNIQUE)
900 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
901 || QUERY_FLAG (op, FLAG_UNPAID)
902 || op->is_alive ())
903 ; // do not decay
904 else if (op->is_weapon ())
905 {
906 op->stats.dam--;
907 if (op->stats.dam < 0)
908 destroy = 1;
909 }
910 else if (op->is_armor ())
911 {
912 op->stats.ac--;
913 if (op->stats.ac < 0)
914 destroy = 1;
915 }
916 else if (op->type == FOOD)
917 {
918 op->stats.food -= rndm (5, 20);
919 if (op->stats.food < 0)
920 destroy = 1;
921 }
922 else
923 {
924 int mat = op->materials;
925
926 if (mat & M_PAPER
927 || mat & M_LEATHER
928 || mat & M_WOOD
929 || mat & M_ORGANIC
930 || mat & M_CLOTH
931 || mat & M_LIQUID
932 || (mat & M_IRON && rndm (1, 5) == 1)
933 || (mat & M_GLASS && rndm (1, 2) == 1)
934 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
935 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
936 || (mat & M_ICE && temp > 32))
937 destroy = 1;
938 }
939
940 /* adjust overall chance below */
941 if (destroy && rndm (0, 1))
942 op->destroy ();
943 }
925} 944}
926 945
927/* 946/*
928 * Updates every button on the map (by calling update_button() for them). 947 * Updates every button on the map (by calling update_button() for them).
929 */ 948 */
… …
977 if (QUERY_FLAG (op, FLAG_GENERATOR)) 996 if (QUERY_FLAG (op, FLAG_GENERATOR))
978 { 997 {
979 total_exp += op->stats.exp; 998 total_exp += op->stats.exp;
980 999
981 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 1000 if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))
982 total_exp += at->clone.stats.exp * 8; 1001 total_exp += at->stats.exp * 8;
983 1002
984 monster_cnt++; 1003 monster_cnt++;
985 } 1004 }
986 } 1005 }
987 1006
… …
1651 1670
1652 // instead of crashing in the unlikely(?) case, try to return *something* 1671 // instead of crashing in the unlikely(?) case, try to return *something*
1653 return get_archetype ("blocked"); 1672 return get_archetype ("blocked");
1654} 1673}
1655 1674
1675/**
1676 * Maximum distance a player may hear a sound from.
1677 * This is only used for new client/server sound. If the sound source
1678 * on the map is farther away than this, we don't sent it to the client.
1679 */
1680#define MAX_SOUND_DISTANCE 10
1681
1682void
1683maptile::play_sound (faceidx sound, int x, int y) const
1684{
1685 if (!sound)
1686 return;
1687
1688 for_all_players (pl)
1689 if (pl->ob->map == this)
1690 if (client *ns = pl->ns)
1691 {
1692 int dx = x - pl->ob->x;
1693 int dy = y - pl->ob->y;
1694
1695 int distance = idistance (dx, dy);
1696
1697 if (distance <= MAX_SOUND_DISTANCE)
1698 ns->play_sound (sound, dx, dy);
1699 }
1700}
1701

Diff Legend

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