server/random_maps/special.C

/*
 * static char *rcsid_special_c =
 *   "$Id: special.C,v 1.2 2006-08-29 08:01:36 root Exp $";
 */

/*
    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-devel@real-time.com
*/

/*  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(mapstruct *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;
          remove_ob(tmp);
          free_object(tmp);
          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(mapstruct *dest_map, mapstruct *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,MAP_WIDTH(in_map),MAP_HEIGHT(in_map));
                
  for(i=0;i<MAP_WIDTH(in_map);i++) 
    for(j=0;j<MAP_HEIGHT(in_map);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(mapstruct *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(map) || 2*ysize > MAP_HEIGHT(map)) 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(map) - xsize-2)+1;
    j = RANDOM() % (MAP_HEIGHT(map) - 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(map) - xsize-2)+1;
      j = RANDOM() % (MAP_HEIGHT(map) - 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(mapstruct *map) {
  int ix,iy,i=-1,tries=0;
  mapstruct *fountain_style=find_style("/styles/misc","fountains",-1);
  object *fountain=get_archetype("fountain");
  object *potion=get_object();
  copy_object(pick_random_object(fountain_style),potion);
  while(i<0 && tries<10) {
    ix = RANDOM() % (MAP_WIDTH(map) -2) +1;
    iy = RANDOM() % (MAP_HEIGHT(map) -2) +1;
    i = find_first_free_spot(fountain,map,ix,iy);
    tries++;
  };
  if(i==-1) {  /* can't place fountain */
    free_object(fountain);
    free_object(potion);
    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(mapstruct * map, int hole_type,RMParms *RP) {
    int ix,iy,i=-1;
    char buf[HUGE_BUF], *style, *decor, *mon;
    mapstruct *exit_style=find_style("/styles/misc","obscure_exits",-1);
    int g_xsize,g_ysize;
  
    object *the_exit=get_object();
    if(!exit_style) return;
 
    copy_object(pick_random_object(exit_style),the_exit);

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