server/random_maps/special.C


/*
    CrossFire, A Multiplayer game for X-windows

    Copyright (C) 2002 Mark Wedel & Crossfire Development Team
    Copyright (C) 1992 Frank Tore Johansen

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 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 GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

    The authors can be reached via e-mail at <crossfire@schmorp.de>
*/

/*  Specials in this file:
         included maps */

#include <global.h>
#include <random_map.h>
#include <rproto.h>

#define NUM_OF_SPECIAL_TYPES 4
#define NO_SPECIAL 0
#define SPECIAL_SUBMAP 1
#define SPECIAL_FOUNTAIN 2
#define SPECIAL_EXIT 3

#define GLORY_HOLE 1
#define ORC_ZONE 2
#define MINING_ZONE 3
#define NR_OF_HOLE_TYPES 3

/* clear map completely of all objects:  a rectangular area of xsize, ysize
is cleared with the top left corner at xstart, ystart */

void
nuke_map_region (maptile *map, int xstart, int ystart, int xsize, int ysize)
{
  int i, j;
  object *tmp;

  for (i = xstart; i < xstart + xsize; i++)
    for (j = ystart; j < ystart + ysize; j++)
      {
        for (tmp = GET_MAP_OB (map, i, j); tmp != NULL; tmp = tmp->above)
          {
            if (!QUERY_FLAG (tmp, FLAG_IS_FLOOR))
              {
                if (tmp->head)
                  tmp = tmp->head;
                tmp->remove ();
                tmp->destroy ();
                tmp = GET_MAP_OB (map, i, j);
              }
            if (tmp == NULL)
              break;
          }
      }
}


/* copy in_map into dest_map at point x,y */


void
include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y)
{
  int i, j;
  object *tmp;
  object *new_ob;

  /* First, splatter everything in the dest map at the location */
  nuke_map_region (dest_map, x, y, in_map->width, in_map->height);

  for (i = 0; i < in_map->width; i++)
    for (j = 0; j < in_map->height; j++)
      {
        for (tmp = GET_MAP_OB (in_map, i, j); tmp != NULL; tmp = tmp->above)
          {
            /* don't copy things with multiple squares:  must be dealt with
               specially. */
            if (tmp->head != NULL)
              continue;
            new_ob = arch_to_object (tmp->arch);
            copy_object_with_inv (tmp, new_ob);
            if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
              add_button_link (new_ob, dest_map, tmp->path_attuned);
            new_ob->x = i + x;
            new_ob->y = j + y;
            insert_multisquare_ob_in_map (new_ob, dest_map);
          }
      }
}

int
find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize)
{
  int tries;
  int i = 0, j = 0;             /* initialization may not be needed but prevents compiler warnings */
  int is_occupied = 0;
  int l, m;

  /* don't even try to place a submap into a map if the big map isn't
     sufficiently large. */
  if (2 * xsize > map->width || 2 * ysize > map->height)
    return 0;

  /* search a bit for a completely free spot. */
  for (tries = 0; tries < 20; tries++)
    {
      /* pick a random location in the layout */
      i = RANDOM () % (map->width - xsize - 2) + 1;
      j = RANDOM () % (map->height - ysize - 2) + 1;
      is_occupied = 0;
      for (l = i; l < i + xsize; l++)
        for (m = j; m < j + ysize; m++)
          is_occupied |= layout[l][m];
      if (!is_occupied)
        break;
    }


  /* if we failed, relax the restrictions */

  if (is_occupied)
    {                           /* failure, try a relaxed placer. */
      /* pick a random location in the layout */
      for (tries = 0; tries < 10; tries++)
        {
          i = RANDOM () % (map->width - xsize - 2) + 1;
          j = RANDOM () % (map->height - ysize - 2) + 1;
          is_occupied = 0;
          for (l = i; l < i + xsize; l++)
            for (m = j; m < j + ysize; m++)
              if (layout[l][m] == 'C' || layout[l][m] == '>' || layout[l][m] == '<')
                is_occupied |= 1;
        }
    }
  if (is_occupied)
    return 0;
  *ix = i;
  *iy = j;
  return 1;
}


void
place_fountain_with_specials (maptile *map)
{
  int ix, iy, i = -1, tries = 0;
  maptile *fountain_style = find_style ("/styles/misc", "fountains", -1);
  object *fountain = get_archetype ("fountain");
  object *potion = object::create ();

  pick_random_object (fountain_style)->copy_to (potion);

  while (i < 0 && tries < 10)
    {
      ix = RANDOM () % (map->width - 2) + 1;
      iy = RANDOM () % (map->height - 2) + 1;
      i = find_first_free_spot (fountain, map, ix, iy);
      tries++;
    }

  if (i == -1)
    {                           /* can't place fountain */
      fountain->destroy ();
      potion->destroy ();
      return;
    }

  ix += freearr_x[i];
  iy += freearr_y[i];
  potion->face = fountain->face;
  SET_FLAG (potion, FLAG_NO_PICK);
  SET_FLAG (potion, FLAG_IDENTIFIED);
  potion->name = potion->name_pl = "fountain";
  potion->x = ix;
  potion->y = iy;
  potion->material = M_ADAMANT;
  fountain->x = ix;
  fountain->y = iy;
  insert_ob_in_map (fountain, map, NULL, 0);
  insert_ob_in_map (potion, map, NULL, 0);

}

void
place_special_exit (maptile *map, int hole_type, random_map_params *RP)
{
  int ix, iy, i = -1;
  char buf[HUGE_BUF], *style, *decor, *mon;
  maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1);
  int g_xsize, g_ysize;

  object *the_exit = object::create ();

  if (!exit_style)
    return;

  pick_random_object (exit_style)->copy_to (the_exit);

  while (i < 0)
    {
      ix = RANDOM () % (map->width - 2) + 1;
      iy = RANDOM () % (map->height - 2) + 1;
      i = find_first_free_spot (the_exit, map, ix, iy);
    }

  ix += freearr_x[i];
  iy += freearr_y[i];
  the_exit->x = ix;
  the_exit->y = iy;

  if (!hole_type)
    hole_type = RANDOM () % NR_OF_HOLE_TYPES + 1;

  switch (hole_type)
    {
      case GLORY_HOLE:         /* treasures */
        {
          g_xsize = RANDOM () % 3 + 4 + RP->difficulty / 4;
          g_ysize = RANDOM () % 3 + 4 + RP->difficulty / 4;
          style = "onion";
          decor = "wealth2";
          mon = "none";
          break;
        }

      case ORC_ZONE:           /* hole with orcs in it. */
        {
          g_xsize = RANDOM () % 3 + 4 + RP->difficulty / 4;
          g_ysize = RANDOM () % 3 + 4 + RP->difficulty / 4;
          style = "onion";
          decor = "wealth2";
          mon = "orc";
          break;
        }

      case MINING_ZONE:        /* hole with orcs in it. */
        {
          g_xsize = RANDOM () % 9 + 4 + RP->difficulty / 4;
          g_ysize = RANDOM () % 9 + 4 + RP->difficulty / 4;
          style = "maze";
          decor = "minerals2";
          mon = "none";
          break;
        }

      default:                 /* undefined */
        LOG (llevError, "place_special_exit: undefined hole type %d\n", hole_type);
        return;
        break;
    }

  /* Need to be at least this size, otherwise the load
   * code will generate new size values which are too large.
   */
  if (g_xsize < MIN_RANDOM_MAP_SIZE)
    g_xsize = MIN_RANDOM_MAP_SIZE;
  if (g_ysize < MIN_RANDOM_MAP_SIZE)
    g_ysize = MIN_RANDOM_MAP_SIZE;

  write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon,
                              "none", style, decor, "none", RP->exitstyle, 0, 0, 0,
                              RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level,
                              RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase);
  the_exit->slaying = "/!";
  the_exit->msg = buf;

  insert_ob_in_map (the_exit, map, NULL, 0);
}


void
place_specials_in_map (maptile *map, char **layout, random_map_params *RP)
{
  maptile *special_map;
  int ix, iy;                   /* map insertion locatons */
  int special_type;             /* type of special to make */


  special_type = RANDOM () % NUM_OF_SPECIAL_TYPES;
  switch (special_type)
    {

        /* includes a special map into the random map being made. */
      case SPECIAL_SUBMAP:
        {
          special_map = find_style ("/styles/specialmaps", 0, RP->difficulty);
          if (special_map == NULL)
            return;

          if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height))
            include_map_in_map (map, special_map, ix, iy);
          break;
        }

        /* Make a special fountain:  an unpickable potion disguised as
           a fountain, or rather, colocated with a fountain. */
      case SPECIAL_FOUNTAIN:
        {
          place_fountain_with_specials (map);
          break;
        }

        /* Make an exit to another random map, e.g. a gloryhole. */
      case SPECIAL_EXIT:
        {
          place_special_exit (map, 0, RP);
          break;
        }
    }

}
Revision:	1.12
Committed:	Sun Dec 31 19:02:24 2006 UTC (17 years, 5 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.11:	+58 -57 lines
Log Message:	reindent, minor changes
#	User	Rev	Content
1	root	1.12
2	elmex	1.1	/*
3			CrossFire, A Multiplayer game for X-windows
4
5			Copyright (C) 2002 Mark Wedel & Crossfire Development Team
6			Copyright (C) 1992 Frank Tore Johansen
7
8			This program is free software; you can redistribute it and/or modify
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
11			(at your option) any later version.
12
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			MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16			GNU General Public License for more details.
17
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
20			Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21
22	root	1.5	The authors can be reached via e-mail at <crossfire@schmorp.de>
23	elmex	1.1	*/
24
25			/* Specials in this file:
26	root	1.2	included maps */
27	elmex	1.1
28			#include <global.h>
29			#include <random_map.h>
30			#include <rproto.h>
31
32			#define NUM_OF_SPECIAL_TYPES 4
33			#define NO_SPECIAL 0
34			#define SPECIAL_SUBMAP 1
35			#define SPECIAL_FOUNTAIN 2
36			#define SPECIAL_EXIT 3
37
38			#define GLORY_HOLE 1
39			#define ORC_ZONE 2
40			#define MINING_ZONE 3
41			#define NR_OF_HOLE_TYPES 3
42
43			/* clear map completely of all objects: a rectangular area of xsize, ysize
44			is cleared with the top left corner at xstart, ystart */
45
46	root	1.4	void
47	root	1.6	nuke_map_region (maptile *map, int xstart, int ystart, int xsize, int ysize)
48	root	1.4	{
49			int i, j;
50	elmex	1.1	object *tmp;
51	root	1.4
52			for (i = xstart; i < xstart + xsize; i++)
53			for (j = ystart; j < ystart + ysize; j++)
54			{
55	root	1.9	for (tmp = GET_MAP_OB (map, i, j); tmp != NULL; tmp = tmp->above)
56	root	1.4	{
57			if (!QUERY_FLAG (tmp, FLAG_IS_FLOOR))
58			{
59			if (tmp->head)
60			tmp = tmp->head;
61	root	1.7	tmp->remove ();
62	root	1.8	tmp->destroy ();
63	root	1.9	tmp = GET_MAP_OB (map, i, j);
64	root	1.4	}
65			if (tmp == NULL)
66			break;
67			}
68	elmex	1.1	}
69			}
70
71
72
73	root	1.4	/* copy in_map into dest_map at point x,y */
74	elmex	1.1
75
76	root	1.4	void
77	root	1.6	include_map_in_map (maptile dest_map, maptile in_map, int x, int y)
78	root	1.4	{
79			int i, j;
80	elmex	1.1	object *tmp;
81			object *new_ob;
82	root	1.4
83	elmex	1.1	/* First, splatter everything in the dest map at the location */
84	root	1.10	nuke_map_region (dest_map, x, y, in_map->width, in_map->height);
85	root	1.4
86	root	1.10	for (i = 0; i < in_map->width; i++)
87			for (j = 0; j < in_map->height; j++)
88	root	1.4	{
89	root	1.9	for (tmp = GET_MAP_OB (in_map, i, j); tmp != NULL; tmp = tmp->above)
90	root	1.4	{
91			/* don't copy things with multiple squares: must be dealt with
92			specially. */
93			if (tmp->head != NULL)
94			continue;
95			new_ob = arch_to_object (tmp->arch);
96			copy_object_with_inv (tmp, new_ob);
97			if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
98			add_button_link (new_ob, dest_map, tmp->path_attuned);
99			new_ob->x = i + x;
100			new_ob->y = j + y;
101			insert_multisquare_ob_in_map (new_ob, dest_map);
102			}
103	elmex	1.1	}
104			}
105
106	root	1.4	int
107	root	1.6	find_spot_for_submap (maptile map, char layout, int ix, int *iy, int xsize, int ysize)
108	root	1.4	{
109	elmex	1.1	int tries;
110	root	1.4	int i = 0, j = 0; /* initialization may not be needed but prevents compiler warnings */
111			int is_occupied = 0;
112			int l, m;
113
114	elmex	1.1	/* don't even try to place a submap into a map if the big map isn't
115			sufficiently large. */
116	root	1.10	if (2 * xsize > map->width \|\| 2 * ysize > map->height)
117	root	1.4	return 0;
118
119	elmex	1.1	/* search a bit for a completely free spot. */
120	root	1.4	for (tries = 0; tries < 20; tries++)
121			{
122			/* pick a random location in the layout */
123	root	1.10	i = RANDOM () % (map->width - xsize - 2) + 1;
124			j = RANDOM () % (map->height - ysize - 2) + 1;
125	root	1.4	is_occupied = 0;
126			for (l = i; l < i + xsize; l++)
127			for (m = j; m < j + ysize; m++)
128			is_occupied \|= layout[l][m];
129			if (!is_occupied)
130			break;
131			}
132
133	elmex	1.1
134			/* if we failed, relax the restrictions */
135	root	1.4
136			if (is_occupied)
137			{ /* failure, try a relaxed placer. */
138			/* pick a random location in the layout */
139			for (tries = 0; tries < 10; tries++)
140			{
141	root	1.10	i = RANDOM () % (map->width - xsize - 2) + 1;
142			j = RANDOM () % (map->height - ysize - 2) + 1;
143	root	1.4	is_occupied = 0;
144			for (l = i; l < i + xsize; l++)
145			for (m = j; m < j + ysize; m++)
146			if (layout[l][m] == 'C' \|\| layout[l][m] == '>' \|\| layout[l][m] == '<')
147			is_occupied \|= 1;
148			}
149	elmex	1.1	}
150	root	1.4	if (is_occupied)
151			return 0;
152			*ix = i;
153			*iy = j;
154	elmex	1.1	return 1;
155	root	1.4	}
156	elmex	1.1
157
158	root	1.4	void
159	root	1.6	place_fountain_with_specials (maptile *map)
160	root	1.4	{
161			int ix, iy, i = -1, tries = 0;
162	root	1.6	maptile *fountain_style = find_style ("/styles/misc", "fountains", -1);
163	root	1.4	object *fountain = get_archetype ("fountain");
164	root	1.8	object *potion = object::create ();
165
166			pick_random_object (fountain_style)->copy_to (potion);
167	root	1.4
168			while (i < 0 && tries < 10)
169			{
170	root	1.10	ix = RANDOM () % (map->width - 2) + 1;
171			iy = RANDOM () % (map->height - 2) + 1;
172	root	1.4	i = find_first_free_spot (fountain, map, ix, iy);
173			tries++;
174	root	1.8	}
175
176	root	1.4	if (i == -1)
177			{ /* can't place fountain */
178	root	1.8	fountain->destroy ();
179			potion->destroy ();
180	root	1.4	return;
181			}
182	root	1.8
183	elmex	1.1	ix += freearr_x[i];
184			iy += freearr_y[i];
185	root	1.4	potion->face = fountain->face;
186			SET_FLAG (potion, FLAG_NO_PICK);
187			SET_FLAG (potion, FLAG_IDENTIFIED);
188	root	1.3	potion->name = potion->name_pl = "fountain";
189	elmex	1.1	potion->x = ix;
190			potion->y = iy;
191	root	1.4	potion->material = M_ADAMANT;
192	elmex	1.1	fountain->x = ix;
193			fountain->y = iy;
194	root	1.4	insert_ob_in_map (fountain, map, NULL, 0);
195			insert_ob_in_map (potion, map, NULL, 0);
196	elmex	1.1
197			}
198
199	root	1.4	void
200	root	1.12	place_special_exit (maptile map, int hole_type, random_map_params RP)
201	root	1.4	{
202			int ix, iy, i = -1;
203			char buf[HUGE_BUF], style, decor, *mon;
204	root	1.6	maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1);
205	root	1.4	int g_xsize, g_ysize;
206
207	root	1.8	object *the_exit = object::create ();
208	root	1.4
209			if (!exit_style)
210			return;
211
212	root	1.8	pick_random_object (exit_style)->copy_to (the_exit);
213	root	1.4
214			while (i < 0)
215			{
216	root	1.10	ix = RANDOM () % (map->width - 2) + 1;
217			iy = RANDOM () % (map->height - 2) + 1;
218	root	1.4	i = find_first_free_spot (the_exit, map, ix, iy);
219	elmex	1.1	}
220	root	1.4
221			ix += freearr_x[i];
222			iy += freearr_y[i];
223			the_exit->x = ix;
224			the_exit->y = iy;
225
226			if (!hole_type)
227			hole_type = RANDOM () % NR_OF_HOLE_TYPES + 1;
228
229			switch (hole_type)
230			{
231	root	1.12	case GLORY_HOLE: /* treasures */
232			{
233			g_xsize = RANDOM () % 3 + 4 + RP->difficulty / 4;
234			g_ysize = RANDOM () % 3 + 4 + RP->difficulty / 4;
235			style = "onion";
236			decor = "wealth2";
237			mon = "none";
238			break;
239			}
240	root	1.4
241	root	1.12	case ORC_ZONE: /* hole with orcs in it. */
242			{
243			g_xsize = RANDOM () % 3 + 4 + RP->difficulty / 4;
244			g_ysize = RANDOM () % 3 + 4 + RP->difficulty / 4;
245			style = "onion";
246			decor = "wealth2";
247			mon = "orc";
248			break;
249			}
250	root	1.4
251	root	1.12	case MINING_ZONE: /* hole with orcs in it. */
252			{
253			g_xsize = RANDOM () % 9 + 4 + RP->difficulty / 4;
254			g_ysize = RANDOM () % 9 + 4 + RP->difficulty / 4;
255			style = "maze";
256			decor = "minerals2";
257			mon = "none";
258			break;
259			}
260	root	1.4
261	root	1.12	default: /* undefined */
262			LOG (llevError, "place_special_exit: undefined hole type %d\n", hole_type);
263			return;
264			break;
265	elmex	1.1	}
266
267	root	1.4	/* Need to be at least this size, otherwise the load
268			* code will generate new size values which are too large.
269			*/
270			if (g_xsize < MIN_RANDOM_MAP_SIZE)
271			g_xsize = MIN_RANDOM_MAP_SIZE;
272			if (g_ysize < MIN_RANDOM_MAP_SIZE)
273			g_ysize = MIN_RANDOM_MAP_SIZE;
274
275			write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon,
276			"none", style, decor, "none", RP->exitstyle, 0, 0, 0,
277	root	1.11	RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level,
278	root	1.4	RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase);
279			the_exit->slaying = "/!";
280			the_exit->msg = buf;
281	elmex	1.1
282	root	1.4	insert_ob_in_map (the_exit, map, NULL, 0);
283	elmex	1.1	}
284	root	1.4
285
286			void
287	root	1.12	place_specials_in_map (maptile map, char layout, random_map_params RP)
288	root	1.4	{
289	root	1.6	maptile *special_map;
290	root	1.4	int ix, iy; /* map insertion locatons */
291			int special_type; /* type of special to make */
292
293
294			special_type = RANDOM () % NUM_OF_SPECIAL_TYPES;
295			switch (special_type)
296			{
297
298	root	1.12	/* includes a special map into the random map being made. */
299			case SPECIAL_SUBMAP:
300			{
301			special_map = find_style ("/styles/specialmaps", 0, RP->difficulty);
302			if (special_map == NULL)
303			return;
304
305			if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height))
306			include_map_in_map (map, special_map, ix, iy);
307			break;
308			}
309	root	1.4
310	root	1.12	/* Make a special fountain: an unpickable potion disguised as
311			a fountain, or rather, colocated with a fountain. */
312			case SPECIAL_FOUNTAIN:
313			{
314			place_fountain_with_specials (map);
315			break;
316			}
317	root	1.4
318	root	1.12	/* Make an exit to another random map, e.g. a gloryhole. */
319			case SPECIAL_EXIT:
320			{
321			place_special_exit (map, 0, RP);
322			break;
323			}
324	root	1.4	}
325	elmex	1.1
326			}