server/random_maps/wall.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008,2009,2010 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 <random_map.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 ();
}

/* 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)))
    {
      int i, j;
      char *cp;
      int joinedwalls = 0;
      object *thiswall;

      sprintf (RP->wall_name, "%s", &the_wall->arch->archname);
      if ((cp = strchr (RP->wall_name, '_')) != NULL)
        {
          *cp = 0;
          joinedwalls = 1;
        }

      for (i = 0; i < RP->Xsize; i++)
        for (j = 0; j < RP->Ysize; j++)
          {
            if (maze[i][j] == '#')
              {
                if (joinedwalls)
                  thiswall = pick_joined_wall (the_wall, maze, i, j, RP);
                else
                  thiswall = 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 != NULL; 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.40
Committed:	Fri Jul 2 16:36:56 2010 UTC (13 years, 10 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.39:	+4 -2 lines
Log Message:	* empty log message *
#	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.34	* Copyright (©) 2005,2006,2007,2008,2009,2010 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			#include <random_map.h>
27			#include <rproto.h>
28
29			/* Put in the walls and autojoin them. */
30
31	root	1.38	/* given a maze and a coordinate, tell me which squares up/down/right/left
32	root	1.2	are occupied. */
33	root	1.4	int
34	root	1.38	surround_flag (const layout &maze, int i, int j)
35	root	1.4	{
36	elmex	1.1	/* 1 = wall to left,
37	root	1.4	2 = wall to right,
38			4 = wall above
39			8 = wall below */
40	elmex	1.1	int surround_index = 0;
41	root	1.4
42	root	1.38	if (i > 0 && maze[i - 1][j] != 0) surround_index \|= 1;
43			if (i < maze.w - 1 && maze[i + 1][j] != 0) surround_index \|= 2;
44			if (j > 0 && maze[i][j - 1] != 0) surround_index \|= 4;
45			if (j < maze.h - 1 && maze[i][j + 1] != 0) surround_index \|= 8;
46	root	1.36
47	elmex	1.1	return surround_index;
48			}
49
50	root	1.37	/* like surround_flag, but only walls count. */
51	root	1.4	int
52	root	1.38	surround_flag2 (const layout &maze, int i, int j)
53	root	1.4	{
54	elmex	1.1	/* 1 = wall to left,
55	root	1.4	2 = wall to right,
56			4 = wall above
57			8 = wall below */
58	elmex	1.1	int surround_index = 0;
59	root	1.4
60	root	1.38	if (i > 0 && maze[i - 1][j] == '#') surround_index \|= 1;
61			if (i < maze.w - 1 && maze[i + 1][j] == '#') surround_index \|= 2;
62			if (j > 0 && maze[i][j - 1] == '#') surround_index \|= 4;
63			if (j < maze.h - 1 && maze[i][j + 1] == '#') surround_index \|= 8;
64	root	1.36
65	elmex	1.1	return surround_index;
66			}
67
68	root	1.38	/* like surround_flag, except it checks a map, not a maze.
69	elmex	1.1	* Since this is part of the random map code, presumption
70			* is that this is not a tiled map.
71			* What is considered blocking and not is somewhat hard coded.
72			*/
73	root	1.4	int
74	root	1.37	surround_flag3 (maptile *map, int i, int j)
75	root	1.4	{
76			/*
77	root	1.37	* 1 = blocked to left,
78	root	1.4	* 2 = blocked to right,
79			* 4 = blocked above
80			* 8 = blocked below
81			*/
82			int surround_index = 0;
83	elmex	1.1
84	elmex	1.20	// don't forget to update the mapspace!
85	root	1.37	if (i > 0) map->at (i - 1, j ).update ();
86			if (i < map->width - 1) map->at (i + 1, j ).update ();
87			if (j > 0) map->at (i , j - 1).update ();
88			if (j < map->height - 1) map->at (i , j + 1).update ();
89
90			if (i > 0 && (GET_MAP_MOVE_BLOCK (map, i - 1, j) & MOVE_WALK)) surround_index \|= 1;
91			if (i < map->width - 1 && (GET_MAP_MOVE_BLOCK (map, i + 1, j) & MOVE_WALK)) surround_index \|= 2;
92			if (j > 0 && (GET_MAP_MOVE_BLOCK (map, i, j - 1) & MOVE_WALK)) surround_index \|= 4;
93			if (j < map->height - 1 && (GET_MAP_MOVE_BLOCK (map, i, j + 1) & MOVE_WALK)) surround_index \|= 8;
94	root	1.4
95			return surround_index;
96	elmex	1.1	}
97
98	root	1.38	/* like surround_flag2, except it checks a map, not a maze. */
99	root	1.31	static int
100	root	1.37	surround_flag4 (maptile *map, int i, int j)
101	root	1.4	{
102	root	1.37	/* 1 = blocked to left,
103	root	1.4	2 = blocked to right,
104			4 = blocked above
105			8 = blocked below */
106	elmex	1.1	int surround_index = 0;
107
108	root	1.37	if (i > 0 && wall_blocked (map, i - 1, j)) surround_index \|= 1;
109			if (i < map->width - 1 && wall_blocked (map, i + 1, j)) surround_index \|= 2;
110			if (j > 0 && wall_blocked (map, i, j - 1)) surround_index \|= 4;
111			if (j < map->height - 1 && wall_blocked (map, i, j + 1)) surround_index \|= 8;
112	elmex	1.1
113			return surround_index;
114			}
115
116			/* picks the right wall type for this square, to make it look nice,
117	root	1.38	and have everything nicely joined. It uses the maze. */
118	root	1.31	static object *
119	root	1.38	pick_joined_wall (object the_wall, const layout &maze, int i, int j, random_map_params RP)
120	root	1.4	{
121	elmex	1.1	/* 1 = wall to left,
122	root	1.4	2 = wall to right,
123			4 = wall above
124			8 = wall below */
125			int surround_index = 0;
126	elmex	1.1	int l;
127	root	1.14	char wall_name[1024];
128	root	1.4	archetype *wall_arch = 0;
129	elmex	1.1
130	root	1.22	assign (wall_name, the_wall->arch->archname);
131	elmex	1.1
132			/* conventionally, walls are named like this:
133	root	1.4	wallname_wallcode, where wallcode indicates
134			a joinedness, and wallname is the wall.
135			this code depends on the convention for
136			finding the right wall. */
137	elmex	1.1
138			/* extract the wall name, which is the text up to the leading _ */
139	root	1.4	for (l = 0; l < 64; l++)
140			{
141			if (wall_name[l] == '_')
142			{
143	root	1.40	wall_name[l] = 0;
144	root	1.4	break;
145			}
146			}
147
148	root	1.40	strcat (wall_name, "_");
149	root	1.39	strcat (wall_name, wall_suffix [surround_flag2 (maze, i, j)]);
150	root	1.4
151	root	1.5	wall_arch = archetype::find (wall_name);
152	elmex	1.1
153	root	1.32	return wall_arch ? wall_arch->instance () : the_wall->arch->instance ();
154	elmex	1.1	}
155	root	1.4
156	root	1.38	/* takes a map and a maze, and puts walls in the map (picked from
157	root	1.30	w_style) at '#' marks. */
158			void
159	root	1.38	make_map_walls (maptile map, layout &maze, const char w_style, const char m_style, random_map_params RP)
160	root	1.30	{
161			object *the_wall;
162
163			/* get the style map */
164			if (!strcmp (w_style, "none"))
165			return;
166	root	1.35
167	root	1.36	maptile *style_map = find_style ("/styles/wallstyles", w_style, RP->difficulty);
168	root	1.30	if (!style_map)
169			return;
170
171	root	1.35	maptile mining_map = m_style && m_style
172	root	1.36	? find_style ("/styles/miningstyles", m_style, RP->difficulty)
173	root	1.35	: 0;
174
175	root	1.30	if ((the_wall = style_map->pick_random_object (rmg_rndm)))
176			{
177			int i, j;
178			char *cp;
179			int joinedwalls = 0;
180			object *thiswall;
181
182			sprintf (RP->wall_name, "%s", &the_wall->arch->archname);
183			if ((cp = strchr (RP->wall_name, '_')) != NULL)
184			{
185			*cp = 0;
186			joinedwalls = 1;
187			}
188
189			for (i = 0; i < RP->Xsize; i++)
190			for (j = 0; j < RP->Ysize; j++)
191			{
192	root	1.38	if (maze[i][j] == '#')
193	root	1.30	{
194			if (joinedwalls)
195	root	1.38	thiswall = pick_joined_wall (the_wall, maze, i, j, RP);
196	root	1.30	else
197	root	1.32	thiswall = the_wall->arch->instance ();
198	root	1.30
199			thiswall->move_block = MOVE_ALL;
200	root	1.35	map->insert (thiswall, i, j, thiswall, INS_NO_MERGE \| INS_NO_WALK_ON);
201
202			if (mining_map)
203			if (object *vein = mining_map->at (rmg_rndm (mining_map->width), rmg_rndm (mining_map->height)).bot)
204			map->insert (vein->clone (), i, j, thiswall, INS_NO_MERGE \| INS_NO_WALK_ON);
205	root	1.30	}
206			}
207			}
208			}
209	elmex	1.1
210			/* this takes a map, and changes an existing wall to match what's blocked
211			* around it, counting only doors and walls as blocked. If insert_flag is
212			* 1, it will go ahead and insert the wall into the map. If not, it
213			* will only return the wall which would belong there, and doesn't
214			* remove anything. It depends on the
215			* global, previously-set variable, "wall_name"
216			*/
217	root	1.4	object *
218	root	1.13	retrofit_joined_wall (maptile the_map, int i, int j, int insert_flag, random_map_params RP)
219	root	1.4	{
220			/* 1 = wall to left,
221			* 2 = wall to right,
222			* 4 = wall above
223			* 8 = wall below
224			*/
225			int surround_index = 0;
226			int l;
227			object *the_wall = 0;
228			object *new_wall = 0;
229			archetype *wall_arch = 0;
230
231			/* first find the wall */
232	root	1.10	for (the_wall = GET_MAP_OB (the_map, i, j); the_wall != NULL; the_wall = the_wall->above)
233	root	1.4	if ((the_wall->move_type & MOVE_WALK) && the_wall->type != EXIT && the_wall->type != TELEPORTER)
234			break;
235
236
237			/* if what we found is a door, don't remove it, set the_wall to NULL to
238			* signal that later.
239			*/
240			if (the_wall && (the_wall->type == DOOR \|\| the_wall->type == LOCKED_DOOR))
241			{
242			the_wall = NULL;
243			/* if we're not supposed to insert a new wall where there wasn't one,
244			* we've gotta leave.
245			*/
246			if (insert_flag == 0)
247			return 0;
248	elmex	1.1	}
249	root	1.4	else if (the_wall == NULL)
250			return NULL;
251	elmex	1.1
252	root	1.4	/* canonicalize the wall name */
253			for (l = 0; l < 64; l++)
254			{
255			if (RP->wall_name[l] == '_')
256			{
257	root	1.40	RP->wall_name[l] = 0;
258	root	1.4	break;
259	root	1.2	}
260	elmex	1.1	}
261
262	root	1.40	strcat (RP->wall_name, "_");
263	root	1.39	strcat (RP->wall_name, wall_suffix [surround_flag4 (the_map, i, j)]);
264	root	1.11
265	root	1.5	wall_arch = archetype::find (RP->wall_name);
266	root	1.11
267			if (!wall_arch)
268	root	1.4	{
269	root	1.32	new_wall = wall_arch->instance ();
270	root	1.4	new_wall->x = i;
271			new_wall->y = j;
272	root	1.11
273	root	1.4	if (the_wall && the_wall->map)
274	root	1.28	the_wall->destroy ();
275	root	1.11
276	root	1.4	the_wall->move_block = MOVE_ALL;
277			insert_ob_in_map (new_wall, the_map, new_wall, INS_NO_MERGE \| INS_NO_WALK_ON);
278	elmex	1.1	}
279	root	1.11
280	root	1.4	return new_wall;
281	elmex	1.1	}