[ViewVC] Diff of: cvs/deliantra/server/random

Comparing deliantra/server/random_maps/special.C (file contents):
Revision 1.2 by root, Tue Aug 29 08:01:36 2006 UTC vs.
Revision 1.51 by root, Wed Jun 30 01:32:57 2010 UTC

…		…
1	/*	1	/*
2	* static char *rcsid_special_c =	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	* "$Id: special.C,v 1.2 2006/08/29 08:01:36 root Exp $";	3	*
		4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
		5	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
		6	* Copyright (©) 1992 Frank Tore Johansen
		7	*
		8	* 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	*
		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 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	*
		22	* The authors can be reached via e-mail to <support@deliantra.net>
4	*/	23	*/
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		24
29	/* Specials in this file:	25	/* Specials in this file:
30	included maps */	26	included maps */
31		27
32	#include <global.h>	28	#include <global.h>
42	#define GLORY_HOLE 1	38	#define GLORY_HOLE 1
43	#define ORC_ZONE 2	39	#define ORC_ZONE 2
44	#define MINING_ZONE 3	40	#define MINING_ZONE 3
45	#define NR_OF_HOLE_TYPES 3	41	#define NR_OF_HOLE_TYPES 3
46		42
47	/* clear map completely of all objects: a rectangular area of xsize, ysize	43	/* clear map completely of all !floor objects:
		44	* a rectangular area of xsize, ysize
48	is cleared with the top left corner at xstart, ystart */	45	* is cleared with the top left corner at xstart, ystart
49		46	*/
		47	static void
50	void nuke_map_region(mapstruct *map,int xstart,int ystart, int xsize, int ysize) {	48	nuke_map_region (maptile map, char *layout, int xstart, int ystart, int xsize, int ysize)
51	int i,j;	49	{
52	object *tmp;
53	for(i=xstart;i<xstart + xsize;i++)	50	for (int i = xstart; i < xstart + xsize; i++)
54	for(j=ystart;j<ystart +ysize;j++) {	51	for (int j = ystart; j < ystart + ysize; j++)
55	for(tmp=get_map_ob(map,i,j);tmp!=NULL;tmp=tmp->above) {	52	{
56	if(!QUERY_FLAG(tmp,FLAG_IS_FLOOR)) {	53	layout[i][j] = 'S';
57	if(tmp->head) tmp=tmp->head;	54
58	remove_ob(tmp);	55	for (object *tmp = map->at (i, j).bot; tmp; )
59	free_object(tmp);	56	if (tmp->flag [FLAG_IS_FLOOR])
60	tmp=get_map_ob(map,i,j);	57	tmp = tmp->above;
		58	else
		59	{
		60	object *head = tmp->head_ ();
		61	tmp = tmp->above;
		62	head->destroy ();
61	}	63	}
62	if(tmp==NULL) break;
63	}	64	}
64	}
65	}	65	}
66		66
67
68
69	/* copy in_map into dest_map at point x,y */	67	/* copy in_map into dest_map at point x,y */
70		68	static void
71
72	void include_map_in_map(mapstruct dest_map, mapstruct in_map,int x, int y) {	69	include_map_in_map (maptile dest_map, maptile in_map, int x, int y)
73	int i,j;	70	{
74	object *tmp;	71	for (int i = 0; i < in_map->width; i++)
75	object *new_ob;	72	for (int j = 0; j < in_map->height; j++)
76		73	for (object *tmp = GET_MAP_OB (in_map, i, j); tmp; tmp = tmp->above)
77	/* First, splatter everything in the dest map at the location */	74	{
78	nuke_map_region(dest_map,x,y,MAP_WIDTH(in_map),MAP_HEIGHT(in_map));	75	/* don't copy tails: must be dealt with specially. */
79		76	if (!tmp->is_head ())
80	for(i=0;i<MAP_WIDTH(in_map);i++)	77	continue;
81	for(j=0;j<MAP_HEIGHT(in_map);j++) {	78
82	for(tmp=get_map_ob(in_map,i,j);tmp!=NULL;tmp=tmp->above) {	79	object *new_ob = tmp->deep_clone ();
83	/* don't copy things with multiple squares: must be dealt with	80
84	specially. */	81	if (tmp->flag [FLAG_IS_LINKED])
85	if(tmp->head!=NULL) continue;	82	new_ob->add_link (dest_map, tmp->find_link ()->id);
86	new_ob = arch_to_object(tmp->arch);	83
87	copy_object_with_inv(tmp,new_ob);	84	dest_map->insert (new_ob, x + i, y + j, 0, INS_NO_MERGE \| INS_NO_WALK_ON);
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	}	85	}
94	}
95	}	86	}
96		87
		88	static int
97	int find_spot_for_submap(mapstruct map,char layout,int ix, int *iy,int xsize, int ysize) {	89	find_spot_for_submap (maptile map, char layout, int ix, int *iy, int xsize, int ysize)
98	int tries;	90	{
99	int i=0,j=0; /* initialization may not be needed but prevents compiler warnings */	91	int blocked, i, j;
100	int is_occupied=0;	92
101	int l,m;
102	/* don't even try to place a submap into a map if the big map isn't	93	/* don't even try to place a submap into a map if the big map isn't
103	sufficiently large. */	94	sufficiently large. */
104	if(2xsize > MAP_WIDTH(map) \|\| 2ysize > MAP_HEIGHT(map)) return 0;	95	if (2 * xsize > map->width \|\| 2 * ysize > map->height)
105		96	return 0;
		97
106	/* search a bit for a completely free spot. */	98	/* search a bit for a completely free spot. */
107	for(tries=0;tries<20;tries++) {	99	for (int tries = 0; tries < 20; tries++)
		100	{
		101	blocked = 0;
		102
108	/* pick a random location in the layout */	103	/* pick a random location in the layout */
109	i = RANDOM() % (MAP_WIDTH(map) - xsize-2)+1;	104	i = rmg_rndm (1, map->width - xsize - 2);
110	j = RANDOM() % (MAP_HEIGHT(map) - ysize-2)+1;	105	j = rmg_rndm (1, map->height - ysize - 2);
111	is_occupied=0;	106
112	for(l=i;l<i + xsize;l++)	107	for (int l = i; l < i + xsize; l++)
113	for(m=j;m<j + ysize;m++)	108	for (int m = j; m < j + ysize; m++)
114	is_occupied\|=layout[l][m];
115	if(!is_occupied) break;
116	}
117
118		109	{
		110	blocked = 1;
		111	break;
		112	}
		113
		114	if (!blocked)
		115	break;
		116	}
		117
119	/* if we failed, relax the restrictions */	118	/* if we failed, relax the restrictions */
120		119	if (blocked)
121	if(is_occupied) { /* failure, try a relaxed placer. */	120	{ /* failure, try a relaxed placer. */
122	/* pick a random location in the layout */	121	/* pick a random location in the layout */
123	for(tries=0;tries<10;tries++) {	122	for (int tries = 0; tries < 10; tries++)
124	i = RANDOM() % (MAP_WIDTH(map) - xsize-2)+1;	123	{
125	j = RANDOM() % (MAP_HEIGHT(map) - ysize-2)+1;	124	i = rmg_rndm (1, map->width - xsize - 2);
126	is_occupied=0;	125	j = rmg_rndm (1, map->height - ysize - 2);
		126
		127	blocked = 0;
		128
127	for(l=i;l<i + xsize;l++)	129	for (int l = i; l < i + xsize; l++)
128	for(m=j;m<j + ysize;m++)	130	for (int m = j; m < j + ysize; m++)
129	if(layout[l][m]=='C' \|\| layout[l][m]=='>' \|\| layout[l][m]=='<')	131	if (layout[l][m] != '#' && layout[l][m] != 'D' && layout[l][m] != 0)
130	is_occupied\|=1;	132	{
131	}	133	blocked = 1;
		134	break;
		135	}
		136	}
132	}	137	}
133	if(is_occupied) return 0;	138
		139	if (blocked)
		140	return 0;
		141
134	*ix=i;	142	*ix = i;
135	*iy=j;	143	*iy = j;
		144
136	return 1;	145	return 1;
137	}	146	}
138		147
139		148	static void
140	void place_fountain_with_specials(mapstruct *map) {	149	place_fountain_with_specials (maptile *map)
		150	{
141	int ix,iy,i=-1,tries=0;	151	int ix, iy, i = -1, tries = 0;
142	mapstruct *fountain_style=find_style("/styles/misc","fountains",-1);	152	maptile *fountain_style = find_style ("/styles/misc", "fountains", -1);
		153
		154	if (!fountain_style)
		155	{
		156	LOG (llevError, "unable to load stylemap /styles/misc fountains\n");
		157	return;
		158	}
		159
143	object *fountain=get_archetype("fountain");	160	object *fountain = archetype::get (shstr_fountain);
144	object *potion=get_object();	161	object *potion = fountain_style->pick_random_object (rmg_rndm)->clone ();
145	copy_object(pick_random_object(fountain_style),potion);	162
146	while(i<0 && tries<10) {	163	while (i < 0 && tries < 10)
147	ix = RANDOM() % (MAP_WIDTH(map) -2) +1;	164	{
148	iy = RANDOM() % (MAP_HEIGHT(map) -2) +1;	165	ix = rmg_rndm (map->width - 2) + 1;
149	i = find_first_free_spot(fountain,map,ix,iy);	166	iy = rmg_rndm (map->height - 2) + 1;
		167	i = rmg_find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1);
150	tries++;	168	tries++;
151	};	169	}
152	if(i==-1) { /* can't place fountain */	170
153	free_object(fountain);	171	if (i == -1)
154	free_object(potion);	172	{ /* can't place fountain */
		173	fountain->destroy ();
		174	potion->destroy ();
155	return;	175	return;
156	}	176	}
		177
157	ix += freearr_x[i];	178	ix += freearr_x[i];
158	iy += freearr_y[i];	179	iy += freearr_y[i];
159	potion->face=fountain->face;	180	potion->face = fountain->face;
160	SET_FLAG(potion,FLAG_NO_PICK);	181	potion->set_flag (FLAG_NO_PICK);
161	SET_FLAG(potion,FLAG_IDENTIFIED);	182	potion->set_flag (FLAG_IDENTIFIED);
162	potion->name=add_string("fountain");	183	potion->name = potion->name_pl = shstr_fountain;
163	potion->name_pl=add_string("fountain");
164	potion->x = ix;	184	potion->x = ix;
165	potion->y = iy;	185	potion->y = iy;
166	potion->material=M_ADAMANT;	186	potion->material = name_to_material (shstr_adamantium);
167	fountain->x = ix;	187	fountain->x = ix;
168	fountain->y = iy;	188	fountain->y = iy;
169	insert_ob_in_map(fountain,map,NULL,0);	189	insert_ob_in_map (fountain, map, NULL, 0);
170	insert_ob_in_map(potion,map,NULL,0);	190	insert_ob_in_map (potion, map, NULL, 0);
171
172	}	191	}
173		192
		193	static void
174	void place_special_exit(mapstruct * map, int hole_type,RMParms *RP) {	194	place_special_exit (maptile map, int hole_type, random_map_params RP)
175	int ix,iy,i=-1;	195	{
176	char buf[HUGE_BUF], style, decor, *mon;
177	mapstruct *exit_style=find_style("/styles/misc","obscure_exits",-1);	196	maptile *exit_style = find_style ("/styles/misc", "obscure_exits", RP->difficulty);
		197	if (!exit_style)
		198	{
		199	LOG (llevError, "unable to load stylemap /styles/misc obscure_exits\n");
		200	return;
		201	}
		202
		203	if (!exit_style)
		204	return;
		205
		206	object *the_exit = exit_style->pick_random_object (rmg_rndm)->clone ();
		207
		208	// put an upper bound here, just in case
		209	for (int repeat = 8192; --repeat; )
		210	{
		211	int ix = rmg_rndm (1, map->width - 2);
		212	int iy = rmg_rndm (1, map->height - 2);
		213
		214	int i = rmg_find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1);
		215	if (i >= 0)
		216	{
		217	the_exit->x = ix + freearr_x[i];
		218	the_exit->y = iy + freearr_y[i];
		219	break;
		220	}
		221	}
		222
		223	if (!hole_type)
		224	hole_type = rmg_rndm (NR_OF_HOLE_TYPES) + 1;
		225
		226	const char style, decor, *mon;
178	int g_xsize,g_ysize;	227	int g_xsize, g_ysize;
179
180	object *the_exit=get_object();
181	if(!exit_style) return;
182
183	copy_object(pick_random_object(exit_style),the_exit);
184		228
185	while(i<0) {
186	ix = RANDOM() % (MAP_WIDTH(map) -2) +1;
187	iy = RANDOM() % (MAP_HEIGHT(map) -2) +1;
188	i = find_first_free_spot(the_exit,map,ix,iy);
189	}
190
191	ix += freearr_x[i];
192	iy += freearr_y[i];
193	the_exit->x = ix;
194	the_exit->y = iy;
195
196	if(!hole_type) hole_type = RANDOM() % NR_OF_HOLE_TYPES + 1 ;
197
198	switch(hole_type) {	229	switch (hole_type)
		230	{
199	case GLORY_HOLE: /* treasures */	231	case GLORY_HOLE: /* treasures */
		232	{
		233	g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4;
		234	g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4;
		235	style = "onion";
		236	decor = "special_wealth";
		237	mon = "none";
		238	break;
		239	}
		240
		241	case ORC_ZONE: /* hole with orcs in it. */
		242	{
		243	g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4;
		244	g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4;
		245	style = "onion";
		246	decor = "special_wealth";
		247	mon = "orc";
		248	break;
		249	}
		250
		251	case MINING_ZONE: /* hole with orcs in it. */
		252	{
		253	g_xsize = rmg_rndm (9) + 4 + RP->difficulty / 4;
		254	g_ysize = rmg_rndm (9) + 4 + RP->difficulty / 4;
		255	style = "maze";
		256	decor = "minerals2";
		257	mon = "none";
		258	break;
		259	}
		260
		261	default: /* undefined */
		262	LOG (llevError, "place_special_exit: undefined hole type %d\n", hole_type);
		263	return;
		264	}
		265
		266	/* Need to be at least this size, otherwise the load
		267	* code will generate new size values which are too large.
		268	*/
		269	max_it (g_xsize, MIN_RANDOM_MAP_SIZE);
		270	max_it (g_ysize, MIN_RANDOM_MAP_SIZE);
		271
		272	dynbuf_text buf;
		273
		274	{
		275	random_map_params &rp = *new random_map_params; // for zero_intiialised to work...
		276
		277	rp.hv = (HV )SvREFCNT_inc_NN ((SV )RP->hv);
		278	rp.hv_clone ();
		279
		280	rp.xsize = g_xsize;
		281	rp.ysize = g_ysize;
		282
		283	rp.set ("treasurestyle", "none");
		284	rp.set ("decorstyle" , decor);
		285	rp.set ("decoroptions" , (IV)-1);
		286
		287	assign (rp.monsterstyle, mon);
		288	assign (rp.layoutstyle , style);
		289
		290	rp.layoutoptions1 = RMOPT_WALLS_ONLY;
		291	rp.symmetry = SYMMETRY_NONE;
		292	rp.dungeon_depth = RP->dungeon_level;
		293	rp.dungeon_level = RP->dungeon_level;
		294	rp.difficulty = RP->difficulty;
		295	rp.difficulty_given = RP->difficulty;
		296	rp.difficulty_increase = RP->difficulty_increase;
		297	rp.orientation = 1;
		298	rp.random_seed = uint32_t (RP->random_seed + 0xdeadbeef);
		299	rp.region = RP->region;
		300
		301	the_exit->slaying = shstr_random_map_exit;
		302	the_exit->msg = rp.as_shstr ();
		303
		304	delete &rp;
		305	}
		306
		307	insert_ob_in_map (the_exit, map, NULL, 0);
		308	}
		309
		310	void
		311	place_specials_in_map (maptile map, char layout, random_map_params RP)
		312	{
		313	switch (rmg_rndm (NUM_OF_SPECIAL_TYPES))
		314	{
		315	case SPECIAL_SUBMAP:
		316	{
		317	/* includes a special map into the random map being made. */
		318	maptile *special_map = find_style ("/styles/specialmaps", 0, RP->difficulty, true);
		319
		320	if (!special_map)
		321	break;
		322
		323	int ix, iy; /* map insertion locatons */
		324
		325	if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height))
200	{	326	{
201	g_xsize = RANDOM() %3 + 4 + RP->difficulty/4;	327	/* First, splatter everything in the dest map at the location */
202	g_ysize = RANDOM() %3 + 4 + RP->difficulty/4;	328	nuke_map_region (map, layout, ix, iy, special_map->width, special_map->height);
203	style = "onion";	329	include_map_in_map (map, special_map, ix, iy);
204	decor = "wealth2";
205	mon = "none";
206	break;
207	}	330	}
208
209	case ORC_ZONE: /* hole with orcs in it. */
210	{
211	g_xsize = RANDOM() %3 + 4 + RP->difficulty/4;
212	g_ysize = RANDOM() %3 + 4 + RP->difficulty/4;
213	style = "onion";
214	decor = "wealth2";
215	mon = "orc";
216	break;
217	}
218
219	case MINING_ZONE: /* hole with orcs in it. */
220	{
221	g_xsize = RANDOM() %9 + 4 + RP->difficulty/4;
222	g_ysize = RANDOM() %9 + 4 + RP->difficulty/4;
223	style = "maze";
224	decor = "minerals2";
225	mon = "none";
226	break;
227	}
228
229	default: /* undefined */
230	LOG(llevError, "place_special_exit: undefined hole type %d\n", hole_type);
231	return;
232	break;
233	}
234
235	/* Need to be at least this size, otherwise the load
236	* code will generate new size values which are too large.
237	*/
238	if (g_xsize < MIN_RANDOM_MAP_SIZE) g_xsize = MIN_RANDOM_MAP_SIZE;
239	if (g_ysize < MIN_RANDOM_MAP_SIZE) g_ysize = MIN_RANDOM_MAP_SIZE;
240
241	write_parameters_to_string(buf, g_xsize, g_ysize,RP->wallstyle,RP->floorstyle,mon,
242	"none",style,decor,"none",RP->exitstyle,0,0,0,
243	OPT_WALLS_ONLY,0,0,1,RP->dungeon_level,RP->dungeon_level,
244	RP->difficulty,RP->difficulty,-1,1,0,0,0,0, RP->difficulty_increase);
245	the_exit->slaying = add_string("/!");
246	the_exit->msg = add_string(buf);
247
248	insert_ob_in_map(the_exit,map,NULL,0);
249	}
250
251
252	void place_specials_in_map(mapstruct map, char layout,RMParms RP) {
253	mapstruct *special_map;
254	int ix,iy; /* map insertion locatons */
255	int special_type; /* type of special to make */
256
257
258	special_type = RANDOM() % NUM_OF_SPECIAL_TYPES;
259	switch(special_type) {
260
261	/* includes a special map into the random map being made. */
262	case SPECIAL_SUBMAP: {
263	special_map = find_style("/styles/specialmaps",0,RP->difficulty);
264	if(special_map==NULL) return;
265		331	}
266	if(find_spot_for_submap(map,layout,&ix,&iy,MAP_WIDTH(special_map),MAP_HEIGHT(special_map)))	332
267	include_map_in_map(map,special_map,ix,iy);
268	break;	333	break;
269	}
270		334
		335	case SPECIAL_FOUNTAIN:
271	/* Make a special fountain: an unpickable potion disguised as	336	/* Make a special fountain: an unpickable potion disguised as
272	a fountain, or rather, colocated with a fountain. */	337	a fountain, or rather, colocated with a fountain. */
273	case SPECIAL_FOUNTAIN: {
274	place_fountain_with_specials(map);	338	place_fountain_with_specials (map);
275	break;	339	break;
276	}
277		340
		341	case SPECIAL_EXIT:
278	/* Make an exit to another random map, e.g. a gloryhole. */	342	/* Make an exit to another random map, e.g. a gloryhole. */
279	case SPECIAL_EXIT: {
280	place_special_exit(map,0,RP);	343	place_special_exit (map, 0, RP);
281	break;	344	break;
282	}	345	}
283	}
284
285	}	346	}
		347

Diff Legend

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

Comparing deliantra/server/random_maps/special.C (file contents): Revision 1.2 by root, Tue Aug 29 08:01:36 2006 UTC vs. Revision 1.51 by root, Wed Jun 30 01:32:57 2010 UTC

Diff Legend

Comparing deliantra/server/random_maps/special.C (file contents):
Revision 1.2 by root, Tue Aug 29 08:01:36 2006 UTC vs.
Revision 1.51 by root, Wed Jun 30 01:32:57 2010 UTC