server/random_maps/wall.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
 * Copyright (©) 1992 Frank Tore Johansen
 * 
 * Deliantra is free software: you can redistribute it and/or modify it under
 * the terms of the Affero GNU General Public License as published by the
 * Free Software Foundation, either version 3 of the License, or (at your
 * option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the Affero GNU General Public License
 * and the GNU General Public License along with this program. If not, see
 * <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <support@deliantra.net>
 */

#include <global.h>
#include <util.h>
#include <rmg.h>
#include <rproto.h>

/*  Put in the walls and autojoin them.  */

/* given a maze and a coordinate, tell me which squares up/down/right/left
        are occupied. */
int
surround_flag (const layout &maze, int i, int j)
{
  /* 1 = wall to left,
     2 = wall to right,
     4 = wall above
     8 = wall below */
  int surround_index = 0;

  if (i >          0 && maze[i - 1][j] != 0) surround_index |= 1;
  if (i < maze.w - 1 && maze[i + 1][j] != 0) surround_index |= 2;
  if (j >          0 && maze[i][j - 1] != 0) surround_index |= 4;
  if (j < maze.h - 1 && maze[i][j + 1] != 0) surround_index |= 8;

  return surround_index;
}

/* like surround_flag, but only walls count.  */
int
surround_flag2 (const layout &maze, int i, int j)
{
  /* 1 = wall to left,
     2 = wall to right,
     4 = wall above
     8 = wall below */
  int surround_index = 0;

  if (i >          0 && maze[i - 1][j] == '#') surround_index |= 1;
  if (i < maze.w - 1 && maze[i + 1][j] == '#') surround_index |= 2;
  if (j >          0 && maze[i][j - 1] == '#') surround_index |= 4;
  if (j < maze.h - 1 && maze[i][j + 1] == '#') surround_index |= 8;

  return surround_index;
}

/* like surround_flag, except it checks  a map, not a maze.
 * Since this is part of the random map code, presumption
 * is that this is not a tiled map.
 * What is considered blocking and not is somewhat hard coded.
 */
int
surround_flag3 (maptile *map, int i, int j)
{
  /*
   * 1 = blocked to left,
   * 2 = blocked to right,
   * 4 = blocked above
   * 8 = blocked below 
   */
  int surround_index = 0;

  // don't forget to update the mapspace!
  if (i >               0) map->at (i - 1, j    ).update ();
  if (i < map->width  - 1) map->at (i + 1, j    ).update ();
  if (j >               0) map->at (i    , j - 1).update ();
  if (j < map->height - 1) map->at (i    , j + 1).update ();

  if (i >               0 && (GET_MAP_MOVE_BLOCK (map, i - 1, j) & MOVE_WALK)) surround_index |= 1;
  if (i < map->width  - 1 && (GET_MAP_MOVE_BLOCK (map, i + 1, j) & MOVE_WALK)) surround_index |= 2;
  if (j >               0 && (GET_MAP_MOVE_BLOCK (map, i, j - 1) & MOVE_WALK)) surround_index |= 4;
  if (j < map->height - 1 && (GET_MAP_MOVE_BLOCK (map, i, j + 1) & MOVE_WALK)) surround_index |= 8;

  return surround_index;
}

/* like surround_flag2, except it checks a map, not a maze. */
static int
surround_flag4 (maptile *map, int i, int j)
{
  /* 1 = blocked to left,
     2 = blocked to right,
     4 = blocked above
     8 = blocked below */
  int surround_index = 0;

  if (i >               0 && wall_blocked (map, i - 1, j)) surround_index |= 1;
  if (i < map->width  - 1 && wall_blocked (map, i + 1, j)) surround_index |= 2;
  if (j >               0 && wall_blocked (map, i, j - 1)) surround_index |= 4;
  if (j < map->height - 1 && wall_blocked (map, i, j + 1)) surround_index |= 8;

  return surround_index;
}

/* picks the right wall type for this square, to make it look nice,
        and have everything nicely joined.  It uses the maze.  */
static object *
pick_joined_wall (object *the_wall, const layout &maze, int i, int j, random_map_params *RP)
{
  /* 1 = wall to left,
     2 = wall to right,
     4 = wall above
     8 = wall below */
  int surround_index = 0;
  int l;
  char wall_name[1024];
  archetype *wall_arch = 0;

  assign (wall_name, the_wall->arch->archname);

  /* conventionally, walls are named like this:
     wallname_wallcode, where wallcode indicates
     a joinedness, and wallname is the wall.
     this code depends on the convention for
     finding the right wall. */

  /* extract the wall name, which is the text up to the leading _ */
  for (l = 0; l < 64; l++)
    {
      if (wall_name[l] == '_')
        {
          wall_name[l] = 0;
          break;
        }
    }

  strcat (wall_name, "_");
  strcat (wall_name, wall_suffix [surround_flag2 (maze, i, j)]);

  wall_arch = archetype::find (wall_name);

  return wall_arch ? wall_arch->instance () : the_wall->arch->instance ();
}

// checks whether the layout has a "reachable" space at a given point, i.e.
// not a wall that is completely surrounded by walls.
static bool inline
is_visible (layout &maze, int i, int j)
{
  for (int dx = -1; dx <= 1; ++dx)
    for (int dy = -1; dy <= 1; ++dy)
      {
        int x = i + dx;
        int y = j + dy;

        if (IN_RANGE_EXC (x, 0, maze.w)
            && IN_RANGE_EXC (y, 0, maze.h)
            && maze [x][y] != '#')
          return true;
      }

  return false;
}

/* takes a map and a maze, and puts walls in the map (picked from
        w_style) at '#' marks. */
void
make_map_walls (maptile *map, layout &maze, const char *w_style, const char *m_style, random_map_params *RP)
{
  object *the_wall;

  /* get the style map */
  if (!strcmp (w_style, "none"))
    return;

  maptile *style_map = find_style ("/styles/wallstyles", w_style, RP->difficulty);
  if (!style_map)
    return;

  maptile *mining_map = m_style && *m_style
      ? find_style ("/styles/miningstyles", m_style, RP->difficulty)
      : 0;

  if ((the_wall = style_map->pick_random_object (rmg_rndm)))
    {
      // first pass, remove all "unreachable" (in-rock) walls
      // and replace them by "blocked" spaces.

      layout clean_maze (maze);

      if (archetype *blocked = archetype::find ("blocked"))
        for (int x = 0; x < maze.w; ++x)
          for (int y = 0; y < maze.h; ++y)
            if (maze [x][y] == '#' && !is_visible (maze, x, y))
              {
                clean_maze [x][y] = 'X';

                // erase everything on this space ad replace it by blocked
                mapspace &ms = map->at (x, y);

                while (ms.top)
                  ms.top->destroy ();

                map->insert (blocked->instance (), x, y, 0, INS_NO_MERGE | INS_NO_WALK_ON);
              }

      // second pass, add in walls

      int joinedwalls = 0;

      assign (RP->wall_name, the_wall->arch->archname);
      if (char *cp = strchr (RP->wall_name, '_'))
        {
          *cp = 0;
          joinedwalls = 1;
        }

      for (int i = 0; i < RP->Xsize; i++)
        for (int j = 0; j < RP->Ysize; j++)
          if (clean_maze [i][j] == '#')
            {
              object *thiswall = joinedwalls ? pick_joined_wall (the_wall, clean_maze, i, j, RP)
                                             : the_wall->arch->instance ();

              thiswall->move_block = MOVE_ALL;
              map->insert (thiswall, i, j, thiswall, INS_NO_MERGE | INS_NO_WALK_ON);

              if (mining_map)
                if (object *vein = mining_map->at (rmg_rndm (mining_map->width), rmg_rndm (mining_map->height)).bot)
                  map->insert (vein->clone (), i, j, thiswall, INS_NO_MERGE | INS_NO_WALK_ON);
            }
    }
}

/* this takes a map, and changes an existing wall to match what's blocked
 * around it, counting only doors and walls as blocked.  If insert_flag is
 * 1, it will go ahead and insert the wall into the map.  If not, it
 * will only return the wall which would belong there, and doesn't
 * remove anything.  It depends on the
 * global, previously-set variable, "wall_name"  
 */
object *
retrofit_joined_wall (maptile *the_map, int i, int j, int insert_flag, random_map_params *RP)
{
  /* 1 = wall to left,
   * 2 = wall to right,
   * 4 = wall above
   * 8 = wall below 
   */
  int surround_index = 0;
  int l;
  object *the_wall = 0;
  object *new_wall = 0;
  archetype *wall_arch = 0;

  /* first find the wall */
  for (the_wall = GET_MAP_OB (the_map, i, j); the_wall; the_wall = the_wall->above)
    if ((the_wall->move_type & MOVE_WALK) && the_wall->type != EXIT && the_wall->type != TELEPORTER)
      break;

  /* if what we found is a door, don't remove it, set the_wall to NULL to
   * signal that later. 
   */
  if (the_wall && (the_wall->type == DOOR || the_wall->type == LOCKED_DOOR))
    {
      the_wall = NULL;
      /* if we're not supposed to insert a new wall where there wasn't one, 
       * we've gotta leave. 
       */
      if (insert_flag == 0)
        return 0;
    }
  else if (the_wall == NULL)
    return NULL;

  /* canonicalize the wall name */
  for (l = 0; l < 64; l++)
    {
      if (RP->wall_name[l] == '_')
        {
          RP->wall_name[l] = 0;
          break;
        }
    }

  strcat (RP->wall_name, "_");
  strcat (RP->wall_name, wall_suffix [surround_flag4 (the_map, i, j)]);

  wall_arch = archetype::find (RP->wall_name);

  if (!wall_arch)
    {
      new_wall = wall_arch->instance ();
      new_wall->x = i;
      new_wall->y = j;

      if (the_wall && the_wall->map)
        the_wall->destroy ();

      the_wall->move_block = MOVE_ALL;
      insert_ob_in_map (new_wall, the_map, new_wall, INS_NO_MERGE | INS_NO_WALK_ON);
    }

  return new_wall;
}
Revision:	1.46
Committed:	Tue Jan 3 11:25:34 2012 UTC (12 years, 5 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.45:	+1 -1 lines
Log Message:	update copyrights to 2012
#	User	Rev	Content
1	elmex	1.1	/*
2	root	1.24	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	pippijn	1.16	*
4	root	1.46	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	root	1.33	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6			* Copyright (©) 1992 Frank Tore Johansen
7	pippijn	1.16	*
8	root	1.29	* 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
10			* Free Software Foundation, either version 3 of the License, or (at your
11			* option) any later version.
12	pippijn	1.16	*
13			* This program is distributed in the hope that it will be useful,
14			* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	root	1.23	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	pippijn	1.16	* GNU General Public License for more details.
17			*
18	root	1.29	* You should have received a copy of the Affero GNU General Public License
19			* and the GNU General Public License along with this program. If not, see
20			* <http://www.gnu.org/licenses/>.
21	root	1.23	*
22	root	1.24	* The authors can be reached via e-mail to <support@deliantra.net>
23	pippijn	1.16	*/
24	elmex	1.1
25			#include <global.h>
26	root	1.43	#include <util.h>
27	root	1.44	#include <rmg.h>
28	elmex	1.1	#include <rproto.h>
29
30			/* Put in the walls and autojoin them. */
31
32	root	1.38	/* given a maze and a coordinate, tell me which squares up/down/right/left
33	root	1.2	are occupied. */
34	root	1.4	int
35	root	1.38	surround_flag (const layout &maze, int i, int j)
36	root	1.4	{
37	elmex	1.1	/* 1 = wall to left,
38	root	1.4	2 = wall to right,
39			4 = wall above
40			8 = wall below */
41	elmex	1.1	int surround_index = 0;
42	root	1.4
43	root	1.41	if (i > 0 && maze[i - 1][j] != 0) surround_index \|= 1;
44	root	1.38	if (i < maze.w - 1 && maze[i + 1][j] != 0) surround_index \|= 2;
45	root	1.41	if (j > 0 && maze[i][j - 1] != 0) surround_index \|= 4;
46	root	1.38	if (j < maze.h - 1 && maze[i][j + 1] != 0) surround_index \|= 8;
47	root	1.36
48	elmex	1.1	return surround_index;
49			}
50
51	root	1.37	/* like surround_flag, but only walls count. */
52	root	1.4	int
53	root	1.38	surround_flag2 (const layout &maze, int i, int j)
54	root	1.4	{
55	elmex	1.1	/* 1 = wall to left,
56	root	1.4	2 = wall to right,
57			4 = wall above
58			8 = wall below */
59	elmex	1.1	int surround_index = 0;
60	root	1.4
61	root	1.41	if (i > 0 && maze[i - 1][j] == '#') surround_index \|= 1;
62	root	1.38	if (i < maze.w - 1 && maze[i + 1][j] == '#') surround_index \|= 2;
63	root	1.41	if (j > 0 && maze[i][j - 1] == '#') surround_index \|= 4;
64	root	1.38	if (j < maze.h - 1 && maze[i][j + 1] == '#') surround_index \|= 8;
65	root	1.36
66	elmex	1.1	return surround_index;
67			}
68
69	root	1.38	/* like surround_flag, except it checks a map, not a maze.
70	elmex	1.1	* Since this is part of the random map code, presumption
71			* is that this is not a tiled map.
72			* What is considered blocking and not is somewhat hard coded.
73			*/
74	root	1.4	int
75	root	1.37	surround_flag3 (maptile *map, int i, int j)
76	root	1.4	{
77			/*
78	root	1.37	* 1 = blocked to left,
79	root	1.4	* 2 = blocked to right,
80			* 4 = blocked above
81			* 8 = blocked below
82			*/
83			int surround_index = 0;
84	elmex	1.1
85	elmex	1.20	// don't forget to update the mapspace!
86	root	1.37	if (i > 0) map->at (i - 1, j ).update ();
87			if (i < map->width - 1) map->at (i + 1, j ).update ();
88			if (j > 0) map->at (i , j - 1).update ();
89			if (j < map->height - 1) map->at (i , j + 1).update ();
90
91			if (i > 0 && (GET_MAP_MOVE_BLOCK (map, i - 1, j) & MOVE_WALK)) surround_index \|= 1;
92			if (i < map->width - 1 && (GET_MAP_MOVE_BLOCK (map, i + 1, j) & MOVE_WALK)) surround_index \|= 2;
93			if (j > 0 && (GET_MAP_MOVE_BLOCK (map, i, j - 1) & MOVE_WALK)) surround_index \|= 4;
94			if (j < map->height - 1 && (GET_MAP_MOVE_BLOCK (map, i, j + 1) & MOVE_WALK)) surround_index \|= 8;
95	root	1.4
96			return surround_index;
97	elmex	1.1	}
98
99	root	1.38	/* like surround_flag2, except it checks a map, not a maze. */
100	root	1.31	static int
101	root	1.37	surround_flag4 (maptile *map, int i, int j)
102	root	1.4	{
103	root	1.37	/* 1 = blocked to left,
104	root	1.4	2 = blocked to right,
105			4 = blocked above
106			8 = blocked below */
107	elmex	1.1	int surround_index = 0;
108
109	root	1.37	if (i > 0 && wall_blocked (map, i - 1, j)) surround_index \|= 1;
110			if (i < map->width - 1 && wall_blocked (map, i + 1, j)) surround_index \|= 2;
111			if (j > 0 && wall_blocked (map, i, j - 1)) surround_index \|= 4;
112			if (j < map->height - 1 && wall_blocked (map, i, j + 1)) surround_index \|= 8;
113	elmex	1.1
114			return surround_index;
115			}
116
117			/* picks the right wall type for this square, to make it look nice,
118	root	1.38	and have everything nicely joined. It uses the maze. */
119	root	1.31	static object *
120	root	1.38	pick_joined_wall (object the_wall, const layout &maze, int i, int j, random_map_params RP)
121	root	1.4	{
122	elmex	1.1	/* 1 = wall to left,
123	root	1.4	2 = wall to right,
124			4 = wall above
125			8 = wall below */
126			int surround_index = 0;
127	elmex	1.1	int l;
128	root	1.14	char wall_name[1024];
129	root	1.4	archetype *wall_arch = 0;
130	elmex	1.1
131	root	1.22	assign (wall_name, the_wall->arch->archname);
132	elmex	1.1
133			/* conventionally, walls are named like this:
134	root	1.4	wallname_wallcode, where wallcode indicates
135			a joinedness, and wallname is the wall.
136			this code depends on the convention for
137			finding the right wall. */
138	elmex	1.1
139			/* extract the wall name, which is the text up to the leading _ */
140	root	1.4	for (l = 0; l < 64; l++)
141			{
142			if (wall_name[l] == '_')
143			{
144	root	1.40	wall_name[l] = 0;
145	root	1.4	break;
146			}
147			}
148
149	root	1.40	strcat (wall_name, "_");
150	root	1.39	strcat (wall_name, wall_suffix [surround_flag2 (maze, i, j)]);
151	root	1.4
152	root	1.5	wall_arch = archetype::find (wall_name);
153	elmex	1.1
154	root	1.32	return wall_arch ? wall_arch->instance () : the_wall->arch->instance ();
155	elmex	1.1	}
156	root	1.4
157	root	1.42	// checks whether the layout has a "reachable" space at a given point, i.e.
158			// not a wall that is completely surrounded by walls.
159	root	1.41	static bool inline
160			is_visible (layout &maze, int i, int j)
161			{
162			for (int dx = -1; dx <= 1; ++dx)
163			for (int dy = -1; dy <= 1; ++dy)
164			{
165			int x = i + dx;
166			int y = j + dy;
167
168	root	1.43	if (IN_RANGE_EXC (x, 0, maze.w)
169			&& IN_RANGE_EXC (y, 0, maze.h)
170	root	1.42	&& maze [x][y] != '#')
171			return true;
172	root	1.41	}
173
174	root	1.42	return false;
175	root	1.41	}
176
177	root	1.38	/* takes a map and a maze, and puts walls in the map (picked from
178	root	1.30	w_style) at '#' marks. */
179			void
180	root	1.38	make_map_walls (maptile map, layout &maze, const char w_style, const char m_style, random_map_params RP)
181	root	1.30	{
182			object *the_wall;
183
184			/* get the style map */
185			if (!strcmp (w_style, "none"))
186			return;
187	root	1.35
188	root	1.36	maptile *style_map = find_style ("/styles/wallstyles", w_style, RP->difficulty);
189	root	1.30	if (!style_map)
190			return;
191
192	root	1.35	maptile mining_map = m_style && m_style
193	root	1.36	? find_style ("/styles/miningstyles", m_style, RP->difficulty)
194	root	1.35	: 0;
195
196	root	1.30	if ((the_wall = style_map->pick_random_object (rmg_rndm)))
197			{
198	root	1.41	// first pass, remove all "unreachable" (in-rock) walls
199			// and replace them by "blocked" spaces.
200
201			layout clean_maze (maze);
202
203			if (archetype *blocked = archetype::find ("blocked"))
204			for (int x = 0; x < maze.w; ++x)
205			for (int y = 0; y < maze.h; ++y)
206			if (maze [x][y] == '#' && !is_visible (maze, x, y))
207			{
208			clean_maze [x][y] = 'X';
209
210			// erase everything on this space ad replace it by blocked
211			mapspace &ms = map->at (x, y);
212
213			while (ms.top)
214			ms.top->destroy ();
215
216			map->insert (blocked->instance (), x, y, 0, INS_NO_MERGE \| INS_NO_WALK_ON);
217			}
218
219			// second pass, add in walls
220
221	root	1.30	int joinedwalls = 0;
222
223	root	1.41	assign (RP->wall_name, the_wall->arch->archname);
224			if (char *cp = strchr (RP->wall_name, '_'))
225	root	1.30	{
226			*cp = 0;
227			joinedwalls = 1;
228			}
229
230	root	1.41	for (int i = 0; i < RP->Xsize; i++)
231			for (int j = 0; j < RP->Ysize; j++)
232			if (clean_maze [i][j] == '#')
233			{
234			object *thiswall = joinedwalls ? pick_joined_wall (the_wall, clean_maze, i, j, RP)
235			: the_wall->arch->instance ();
236
237			thiswall->move_block = MOVE_ALL;
238			map->insert (thiswall, i, j, thiswall, INS_NO_MERGE \| INS_NO_WALK_ON);
239
240			if (mining_map)
241			if (object *vein = mining_map->at (rmg_rndm (mining_map->width), rmg_rndm (mining_map->height)).bot)
242			map->insert (vein->clone (), i, j, thiswall, INS_NO_MERGE \| INS_NO_WALK_ON);
243			}
244	root	1.30	}
245			}
246	elmex	1.1
247			/* this takes a map, and changes an existing wall to match what's blocked
248			* around it, counting only doors and walls as blocked. If insert_flag is
249			* 1, it will go ahead and insert the wall into the map. If not, it
250			* will only return the wall which would belong there, and doesn't
251			* remove anything. It depends on the
252			* global, previously-set variable, "wall_name"
253			*/
254	root	1.4	object *
255	root	1.13	retrofit_joined_wall (maptile the_map, int i, int j, int insert_flag, random_map_params RP)
256	root	1.4	{
257			/* 1 = wall to left,
258			* 2 = wall to right,
259			* 4 = wall above
260			* 8 = wall below
261			*/
262			int surround_index = 0;
263			int l;
264			object *the_wall = 0;
265			object *new_wall = 0;
266			archetype *wall_arch = 0;
267
268			/* first find the wall */
269	root	1.41	for (the_wall = GET_MAP_OB (the_map, i, j); the_wall; the_wall = the_wall->above)
270	root	1.4	if ((the_wall->move_type & MOVE_WALK) && the_wall->type != EXIT && the_wall->type != TELEPORTER)
271			break;
272
273			/* if what we found is a door, don't remove it, set the_wall to NULL to
274			* signal that later.
275			*/
276			if (the_wall && (the_wall->type == DOOR \|\| the_wall->type == LOCKED_DOOR))
277			{
278			the_wall = NULL;
279			/* if we're not supposed to insert a new wall where there wasn't one,
280			* we've gotta leave.
281			*/
282			if (insert_flag == 0)
283			return 0;
284	elmex	1.1	}
285	root	1.4	else if (the_wall == NULL)
286			return NULL;
287	elmex	1.1
288	root	1.4	/* canonicalize the wall name */
289			for (l = 0; l < 64; l++)
290			{
291			if (RP->wall_name[l] == '_')
292			{
293	root	1.40	RP->wall_name[l] = 0;
294	root	1.4	break;
295	root	1.2	}
296	elmex	1.1	}
297
298	root	1.40	strcat (RP->wall_name, "_");
299	root	1.39	strcat (RP->wall_name, wall_suffix [surround_flag4 (the_map, i, j)]);
300	root	1.11
301	root	1.5	wall_arch = archetype::find (RP->wall_name);
302	root	1.11
303			if (!wall_arch)
304	root	1.4	{
305	root	1.32	new_wall = wall_arch->instance ();
306	root	1.4	new_wall->x = i;
307			new_wall->y = j;
308	root	1.11
309	root	1.4	if (the_wall && the_wall->map)
310	root	1.28	the_wall->destroy ();
311	root	1.11
312	root	1.4	the_wall->move_block = MOVE_ALL;
313			insert_ob_in_map (new_wall, the_map, new_wall, INS_NO_MERGE \| INS_NO_WALK_ON);
314	elmex	1.1	}
315	root	1.11
316	root	1.4	return new_wall;
317	elmex	1.1	}