[ViewVC] Diff of: cvs/deliantra/server/common/map.C

Comparing deliantra/server/common/map.C (file contents):
Revision 1.107 by root, Mon Jun 4 13:04:00 2007 UTC vs.
Revision 1.164 by root, Fri Oct 16 01:19:12 2009 UTC

…		…
1	/*	1	/*
2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT is free software; you can redistribute it and/or modify it	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* under the terms of the GNU General Public License as published by the Free	9	* the terms of the Affero GNU General Public License as published by the
10	* Software Foundation; either version 2 of the License, or (at your option)	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful, but	13	* This program is distributed in the hope that it will be useful,
14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License along	18	* You should have received a copy of the Affero GNU General Public License
19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51	19	* and the GNU General Public License along with this program. If not, see
20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* The authors can be reached via e-mail to <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	23	*/
24		24
25	#include <unistd.h>	25	#include <unistd.h>
26		26
27	#include "global.h"	27	#include "global.h"
28	#include "funcpoint.h"
29
30	#include "loader.h"	28	#include "loader.h"
31
32	#include "path.h"	29	#include "path.h"
33		30
34	/*	31	sint8 maptile::outdoor_darkness;
35	* This makes a path absolute outside the world of Crossfire.
36	* In other words, it prepends LIBDIR/MAPDIR/ to the given path
37	* and returns the pointer to a static array containing the result.
38	* it really should be called create_mapname
39	*/
40	const char *
41	create_pathname (const char *name)
42	{
43	static char buf[8192];
44	snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
45	return buf;
46	}
47
48	/*
49	* This function checks if a file with the given path exists.
50	* -1 is returned if it fails, otherwise the mode of the file
51	* is returned.
52	* It tries out all the compression suffixes listed in the uncomp[] array.
53	*
54	* If prepend_dir is set, then we call create_pathname (which prepends
55	* libdir & mapdir). Otherwise, we assume the name given is fully
56	* complete.
57	* Only the editor actually cares about the writablity of this -
58	* the rest of the code only cares that the file is readable.
59	* when the editor goes away, the call to stat should probably be
60	* replaced by an access instead (similar to the windows one, but
61	* that seems to be missing the prepend_dir processing
62	*/
63	int
64	check_path (const char *name, int prepend_dir)
65	{
66	char buf[MAX_BUF];
67
68	char *endbuf;
69	struct stat statbuf;
70	int mode = 0;
71
72	if (prepend_dir)
73	assign (buf, create_pathname (name));
74	else
75	assign (buf, name);
76
77	/* old method (strchr(buf, '\0')) seemd very odd to me -
78	* this method should be equivalant and is clearer.
79	* Can not use strcat because we need to cycle through
80	* all the names.
81	*/
82	endbuf = buf + strlen (buf);
83
84	if (stat (buf, &statbuf))
85	return -1;
86	if (!S_ISREG (statbuf.st_mode))
87	return (-1);
88
89	if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) \|\|
90	((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IROTH))
91	mode \|= 4;
92
93	if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) \|\|
94	(statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IWOTH))
95	mode \|= 2;
96
97	return (mode);
98	}
99		32
100	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	33	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
101	* one function that just returns a P_.. value (see map.h)	34	* one function that just returns a P_.. value (see map.h)
102	* it will also do map translation for tiled maps, returning	35	* it will also do map translation for tiled maps, returning
103	* new values into newmap, nx, and ny. Any and all of those	36	* new values into newmap, nx, and ny. Any and all of those
138	* by the caller.	71	* by the caller.
139	*/	72	*/
140	int	73	int
141	blocked_link (object ob, maptile m, int sx, int sy)	74	blocked_link (object ob, maptile m, int sx, int sy)
142	{	75	{
143	object *tmp;
144	int mflags, blocked;
145
146	/* Make sure the coordinates are valid - they should be, as caller should	76	/* Make sure the coordinates are valid - they should be, as caller should
147	* have already checked this.	77	* have already checked this.
148	*/	78	*/
149	if (OUT_OF_REAL_MAP (m, sx, sy))	79	if (OUT_OF_REAL_MAP (m, sx, sy))
150	{	80	{
…		…
153	}	83	}
154		84
155	/* Save some cycles - instead of calling get_map_flags(), just get the value	85	/* Save some cycles - instead of calling get_map_flags(), just get the value
156	* directly.	86	* directly.
157	*/	87	*/
158	mflags = m->at (sx, sy).flags ();	88	mapspace &ms = m->at (sx, sy);
159		89
160	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);	90	int mflags = ms.flags ();
		91	int blocked = ms.move_block;
161		92
162	/* If space is currently not blocked by anything, no need to	93	/* If space is currently not blocked by anything, no need to
163	* go further. Not true for players - all sorts of special	94	* go further. Not true for players - all sorts of special
164	* things we need to do for players.	95	* things we need to do for players.
165	*/	96	*/
166	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	97	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
167	return 0;	98	return 0;
168		99
169	/* if there isn't anytyhing alive on this space, and this space isn't	100	/* if there isn't anything alive on this space, and this space isn't
170	* otherwise blocked, we can return now. Only if there is a living	101	* otherwise blocked, we can return now. Only if there is a living
171	* creature do we need to investigate if it is part of this creature	102	* creature do we need to investigate if it is part of this creature
172	* or another. Likewise, only if something is blocking us do we	103	* or another. Likewise, only if something is blocking us do we
173	* need to investigate if there is a special circumstance that would	104	* need to investigate if there is a special circumstance that would
174	* let the player through (inventory checkers for example)	105	* let the player through (inventory checkers for example)
…		…
181	/* We basically go through the stack of objects, and if there is	112	/* We basically go through the stack of objects, and if there is
182	* some other object that has NO_PASS or FLAG_ALIVE set, return	113	* some other object that has NO_PASS or FLAG_ALIVE set, return
183	* true. If we get through the entire stack, that must mean	114	* true. If we get through the entire stack, that must mean
184	* ob is blocking it, so return 0.	115	* ob is blocking it, so return 0.
185	*/	116	*/
186	for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)	117	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
187	{	118	{
		119	bool block = OB_MOVE_BLOCK (ob, tmp);
188		120
189	/* This must be before the checks below. Code for inventory checkers. */	121	/* This must be before the checks below. Code for inventory checkers. */
190	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))	122	if (block && tmp->type == CHECK_INV)
191	{	123	{
		124	bool have = check_inv_recursive (ob, tmp);
		125
192	/* If last_sp is set, the player/monster needs an object,	126	/* If last_sp is set, the player/monster needs an object,
193	* so we check for it. If they don't have it, they can't	127	* so we check for it. If they don't have it, they can't
194	* pass through this space.	128	* pass through this space.
195	*/	129	*/
196	if (tmp->last_sp)	130	if (tmp->last_sp)
197	{	131	{
198	if (check_inv_recursive (ob, tmp) == NULL)	132	if (!have)
199	return 1;	133	return 1;
200	else
201	continue;
202	}	134	}
203	else	135	else
204	{	136	{
205	/* In this case, the player must not have the object -	137	/* In this case, the player must not have the object -
206	* if they do, they can't pass through.	138	* if they do, they can't pass through.
207	*/	139	*/
208	if (check_inv_recursive (ob, tmp) != NULL) /* player has object */	140	if (have)
209	return 1;	141	return 1;
210	else
211	continue;
212	}	142	}
213	} /* if check_inv */	143	}
		144	else if (block && tmp->type == T_MATCH)
		145	{
		146	//TODO
		147	}
214	else	148	else
215	{	149	{
216	/* Broke apart a big nasty if into several here to make	150	/* Broke apart a big nasty if into several here to make
217	* this more readable. first check - if the space blocks	151	* this more readable. first check - if the space blocks
218	* movement, can't move here.	152	* movement, can't move here.
219	* second - if a monster, can't move there, unless it is a	153	* second - if a monster, can't move there, unless it is a
220	* hidden dm	154	* dm.
221	*/	155	*/
222	if (OB_MOVE_BLOCK (ob, tmp))	156	if (block)
223	return 1;	157	return 1;
224		158
225	if (tmp->flag [FLAG_ALIVE]	159	if (tmp->flag [FLAG_ALIVE]
226	&& tmp->head_ () != ob	160	&& tmp->head_ () != ob
227	&& tmp != ob	161	&& tmp != ob
228	&& tmp->type != DOOR	162	&& tmp->type != DOOR
229	&& !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))	163	&& !tmp->flag [FLAG_WIZ])
230	return 1;	164	return 1;
231	}	165	}
232
233	}	166	}
		167
234	return 0;	168	return 0;
235	}	169	}
236		170
237	/*	171	/*
238	* Returns true if the given object can't fit in the given spot.	172	* Returns qthe blocking object if the given object can't fit in the given
239	* This is meant for multi space objects - for single space objecs,	173	* spot. This is meant for multi space objects - for single space objecs,
240	* just calling get_map_blocked and checking that against movement type	174	* just calling get_map_blocked and checking that against movement type
241	* of object. This function goes through all the parts of the	175	* of object. This function goes through all the parts of the multipart
242	* multipart object and makes sure they can be inserted.	176	* object and makes sure they can be inserted.
243	*	177	*
244	* While this doesn't call out of map, the get_map_flags does.	178	* While this doesn't call out of map, the get_map_flags does.
245	*	179	*
246	* This function has been used to deprecate arch_out_of_map -	180	* This function has been used to deprecate arch_out_of_map -
247	* this function also does that check, and since in most cases,	181	* this function also does that check, and since in most cases,
…		…
258	*	192	*
259	* Note this used to be arch_blocked, but with new movement	193	* Note this used to be arch_blocked, but with new movement
260	* code, we need to have actual object to check its move_type	194	* code, we need to have actual object to check its move_type
261	* against the move_block values.	195	* against the move_block values.
262	*/	196	*/
263	int	197	bool
264	ob_blocked (const object ob, maptile m, sint16 x, sint16 y)	198	object::blocked (maptile *m, int x, int y) const
265	{	199	{
266	archetype *tmp;	200	for (archetype tmp = arch; tmp; tmp = (archetype )tmp->more)
267	int flag;
268	maptile *m1;
269	sint16 sx, sy;
270
271	if (!ob)
272	{
273	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
274	if (flag & P_OUT_OF_MAP)
275	return P_OUT_OF_MAP;
276
277	/* don't have object, so don't know what types would block */
278	return m1->at (sx, sy).move_block;
279	}	201	{
		202	mapxy pos (m, x + tmp->x, y + tmp->y);
280		203
281	for (tmp = ob->arch; tmp; tmp = tmp->more)	204	if (!pos.normalise ())
282	{	205	return 1;
283	flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
284		206
285	if (flag & P_OUT_OF_MAP)	207	mapspace &ms = *pos;
286	return P_OUT_OF_MAP;	208
287	if (flag & P_IS_ALIVE)	209	if (ms.flags () & P_IS_ALIVE)
288	return P_IS_ALIVE;	210	return 1;
289		211
290	mapspace &ms = m1->at (sx, sy);	212	/* However, often ob doesn't have any move type
291		213	* (signifying non-moving objects)
292	/* find_first_free_spot() calls this function. However, often
293	* ob doesn't have any move type (when used to place exits)
294	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	214	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
295	*/	215	*/
296
297	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	216	if (!move_type && ms.move_block != MOVE_ALL)
298	continue;	217	continue;
299		218
300	/* Note it is intentional that we check ob - the movement type of the	219	/* Note it is intentional that we check ob - the movement type of the
301	* head of the object should correspond for the entire object.	220	* head of the object should correspond for the entire object.
302	*/	221	*/
303	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	222	if (ms.blocks (move_type))
304	return P_NO_PASS;	223	return 1;
305	}	224	}
306		225
307	return 0;	226	return 0;
308	}	227	}
309		228
…		…
327		246
328	insert_ob_in_ob (tmp, container);	247	insert_ob_in_ob (tmp, container);
329	tmp = next;	248	tmp = next;
330	}	249	}
331		250
332	/* sum_weight will go through and calculate what all the containers are	251	// go through and calculate what all the containers are carrying.
333	* carrying.	252	//TODO: remove
334	*/	253	container->update_weight ();
335	sum_weight (container);
336	}	254	}
337		255
338	void	256	void
339	maptile::set_object_flag (int flag, int value)	257	maptile::set_object_flag (int flag, int value)
340	{	258	{
…		…
342	return;	260	return;
343		261
344	for (mapspace *ms = spaces + size (); ms-- > spaces; )	262	for (mapspace *ms = spaces + size (); ms-- > spaces; )
345	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	263	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
346	tmp->flag [flag] = value;	264	tmp->flag [flag] = value;
		265	}
		266
		267	void
		268	maptile::post_load_original ()
		269	{
		270	if (!spaces)
		271	return;
		272
		273	set_object_flag (FLAG_OBJ_ORIGINAL);
		274
		275	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		276	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		277	INVOKE_OBJECT (RESET, tmp);
347	}	278	}
348		279
349	/* link_multipart_objects go through all the objects on the map looking	280	/* link_multipart_objects go through all the objects on the map looking
350	* for objects whose arch says they are multipart yet according to the	281	* for objects whose arch says they are multipart yet according to the
351	* info we have, they only have the head (as would be expected when	282	* info we have, they only have the head (as would be expected when
…		…
356	{	287	{
357	if (!spaces)	288	if (!spaces)
358	return;	289	return;
359		290
360	for (mapspace *ms = spaces + size (); ms-- > spaces; )	291	for (mapspace *ms = spaces + size (); ms-- > spaces; )
361	for (object *op = ms->bot; op; op = op->above)	292	{
		293	object *op = ms->bot;
		294	while (op)
362	{	295	{
363	/* already multipart - don't do anything more */	296	/* already multipart - don't do anything more */
364	if (op->head_ () == op && !op->more && op->arch->more)	297	if (op->head_ () == op && !op->more && op->arch->more)
365	{	298	{
366	op->remove ();	299	op->remove ();
367	op->expand_tail ();	300	op->expand_tail ();
		301
		302	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
		303	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
		304	// below the pentagrams... hopefully INS_ON_TOP doesn't break anything
368	insert (op, op->x, op->y, 0, INS_NO_MERGE \| INS_ABOVE_FLOOR_ONLY \| INS_NO_WALK_ON);	305	insert (op, op->x, op->y, 0, INS_NO_MERGE \| INS_ON_TOP \| INS_NO_WALK_ON);
		306
		307	op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
		308	// so we have to reset the iteration through the mapspace
369	}	309	}
		310	else
		311	op = op->above;
370	}	312	}
		313	}
371	}	314	}
372		315
373	/*	316	/*
374	* Loads (ands parses) the objects into a given map from the specified	317	* Loads (ands parses) the objects into a given map from the specified
375	* file pointer.	318	* file pointer.
…		…
377	bool	320	bool
378	maptile::_load_objects (object_thawer &f)	321	maptile::_load_objects (object_thawer &f)
379	{	322	{
380	for (;;)	323	for (;;)
381	{	324	{
382	coroapi::cede_to_tick_every (100); // cede once in a while	325	coroapi::cede_to_tick (); // cede once in a while
383		326
384	switch (f.kw)	327	switch (f.kw)
385	{	328	{
386	case KW_arch:	329	case KW_arch:
387	if (object *op = object::read (f, this))	330	if (object *op = object::read (f, this))
388	{	331	{
		332	// TODO: why?
389	if (op->inv)	333	if (op->inv)
390	sum_weight (op);	334	op->update_weight ();
391		335
392	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ON_TOP \| INS_MAP_LOAD);	336	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
		337	{
		338	// we insert manually because
		339	// a) its way faster
		340	// b) we remove manually, too, and there are good reasons for that
		341	// c) it's correct
		342	mapspace &ms = at (op->x, op->y);
		343
		344	op->flag [FLAG_REMOVED] = false;
		345
		346	op->above = 0;
		347	op->below = ms.top;
		348
		349	*(ms.top ? &ms.top->above : &ms.bot) = op;
		350
		351	ms.top = op;
		352	ms.flags_ = 0;
		353	}
		354	else
		355	{
		356	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		357	op->destroy ();
		358	}
393	}	359	}
394		360
395	continue;	361	continue;
396		362
397	case KW_EOF:	363	case KW_EOF:
…		…
410	}	376	}
411		377
412	void	378	void
413	maptile::activate ()	379	maptile::activate ()
414	{	380	{
415	active = true;
416
417	if (spaces)	381	if (spaces)
418	for (mapspace *ms = spaces + size (); ms-- > spaces; )	382	for (mapspace *ms = spaces + size (); ms-- > spaces; )
419	for (object *op = ms->bot; op; op = op->above)	383	for (object *op = ms->bot; op; op = op->above)
420	op->activate_recursive ();	384	op->activate_recursive ();
421	}	385	}
422		386
423	void	387	void
424	maptile::deactivate ()	388	maptile::deactivate ()
425	{	389	{
426	active = false;
427
428	if (spaces)	390	if (spaces)
429	for (mapspace *ms = spaces + size (); ms-- > spaces; )	391	for (mapspace *ms = spaces + size (); ms-- > spaces; )
430	for (object *op = ms->bot; op; op = op->above)	392	for (object *op = ms->bot; op; op = op->above)
431	op->deactivate_recursive ();	393	op->deactivate_recursive ();
432	}	394	}
…		…
442	if (!spaces)	404	if (!spaces)
443	return false;	405	return false;
444		406
445	for (int i = 0; i < size (); ++i)	407	for (int i = 0; i < size (); ++i)
446	{	408	{
447	int unique = 0;	409	bool unique = 0;
		410
448	for (object *op = spaces [i].bot; op; op = op->above)	411	for (object *op = spaces [i].bot; op; op = op->above)
449	{	412	{
450	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	413	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
451	unique = 1;
452		414
453	if (!op->can_map_save ())	415	if (expect_false (!op->can_map_save ()))
454	continue;	416	continue;
455		417
456	if (unique \|\| op->flag [FLAG_UNIQUE])	418	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
457	{	419	{
458	if (flags & IO_UNIQUES)	420	if (flags & IO_UNIQUES)
459	op->write (f);	421	op->write (f);
460	}	422	}
461	else if (flags & IO_OBJECTS)	423	else if (expect_true (flags & IO_OBJECTS))
462	op->write (f);	424	op->write (f);
463	}	425	}
464	}	426	}
465		427
466	coroapi::cede_to_tick ();	428	coroapi::cede_to_tick ();
467		429
468	return true;	430	return true;
469	}
470
471	bool
472	maptile::_load_objects (const char *path, bool skip_header)
473	{
474	object_thawer f (path);
475
476	if (!f)
477	return false;
478
479	f.next ();
480
481	if (skip_header)
482	for (;;)
483	{
484	keyword kw = f.kw;
485	f.skip ();
486	if (kw == KW_end)
487	break;
488	}
489
490	return _load_objects (f);
491	}	431	}
492		432
493	bool	433	bool
494	maptile::_save_objects (const char *path, int flags)	434	maptile::_save_objects (const char *path, int flags)
495	{	435	{
…		…
626	return items;	566	return items;
627	}	567	}
628		568
629	/* opposite of parse string, this puts the string that was originally fed in to	569	/* opposite of parse string, this puts the string that was originally fed in to
630	* the map (or something equivilent) into output_string. */	570	* the map (or something equivilent) into output_string. */
631	static void	571	static const char *
632	print_shop_string (maptile m, char output_string)	572	print_shop_string (maptile *m)
633	{	573	{
634	int i;	574	static dynbuf_text buf; buf.clear ();
635	char tmp[MAX_BUF];
636		575
637	strcpy (output_string, "");
638	for (i = 0; i < m->shopitems[0].index; i++)	576	for (int i = 0; i < m->shopitems[0].index; i++)
639	{	577	{
640	if (m->shopitems[i].typenum)	578	if (m->shopitems[i].typenum)
641	{	579	{
642	if (m->shopitems[i].strength)	580	if (m->shopitems[i].strength)
643	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	581	buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
644	else	582	else
645	sprintf (tmp, "%s;", m->shopitems[i].name);	583	buf.printf ("%s;", m->shopitems[i].name);
646	}	584	}
647	else	585	else
648	{	586	{
649	if (m->shopitems[i].strength)	587	if (m->shopitems[i].strength)
650	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	588	buf.printf ("*:%d;", m->shopitems[i].strength);
651	else	589	else
652	sprintf (tmp, "*");	590	buf.printf ("*");
653	}	591	}
654
655	strcat (output_string, tmp);
656	}	592	}
		593
		594	return buf;
657	}	595	}
658		596
659	/* This loads the header information of the map. The header	597	/* This loads the header information of the map. The header
660	* contains things like difficulty, size, timeout, etc.	598	* contains things like difficulty, size, timeout, etc.
661	* this used to be stored in the map object, but with the	599	* this used to be stored in the map object, but with the
…		…
670	bool	608	bool
671	maptile::_load_header (object_thawer &thawer)	609	maptile::_load_header (object_thawer &thawer)
672	{	610	{
673	for (;;)	611	for (;;)
674	{	612	{
675	thawer.next ();
676
677	switch (thawer.kw)	613	switch (thawer.kw)
678	{	614	{
679	case KW_msg:	615	case KW_msg:
680	thawer.get_ml (KW_endmsg, msg);	616	thawer.get_ml (KW_endmsg, msg);
681	break;	617	break;
…		…
714	case KW_winddir: thawer.get (winddir); break;	650	case KW_winddir: thawer.get (winddir); break;
715	case KW_sky: thawer.get (sky); break;	651	case KW_sky: thawer.get (sky); break;
716		652
717	case KW_per_player: thawer.get (per_player); break;	653	case KW_per_player: thawer.get (per_player); break;
718	case KW_per_party: thawer.get (per_party); break;	654	case KW_per_party: thawer.get (per_party); break;
		655	case KW_no_reset: thawer.get (no_reset); break;
		656	case KW_no_drop: thawer.get (no_drop); break;
719		657
720	case KW_region: default_region = region::find (thawer.get_str ()); break;	658	case KW_region: default_region = region::find (thawer.get_str ()); break;
721	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	659	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
722		660
723	// old names new names	661	// old names new names
…		…
734	case KW_tile_path_1: thawer.get (tile_path [0]); break;	672	case KW_tile_path_1: thawer.get (tile_path [0]); break;
735	case KW_tile_path_2: thawer.get (tile_path [1]); break;	673	case KW_tile_path_2: thawer.get (tile_path [1]); break;
736	case KW_tile_path_3: thawer.get (tile_path [2]); break;	674	case KW_tile_path_3: thawer.get (tile_path [2]); break;
737	case KW_tile_path_4: thawer.get (tile_path [3]); break;	675	case KW_tile_path_4: thawer.get (tile_path [3]); break;
738		676
		677	case KW_ERROR:
		678	set_key_text (thawer.kw_str, thawer.value);
		679	break;
		680
739	case KW_end:	681	case KW_end:
		682	thawer.next ();
740	return true;	683	return true;
741		684
742	default:	685	default:
743	if (!thawer.parse_error ("map", 0))	686	if (!thawer.parse_error ("map", 0))
744	return false;	687	return false;
745	break;	688	break;
746	}	689	}
		690
		691	thawer.next ();
747	}	692	}
748		693
749	abort ();	694	abort ();
750	}
751
752	bool
753	maptile::_load_header (const char *path)
754	{
755	object_thawer thawer (path);
756
757	if (!thawer)
758	return false;
759
760	return _load_header (thawer);
761	}	695	}
762		696
763	/******************************************************************************	697	/******************************************************************************
764	* This is the start of unique map handling code	698	* This is the start of unique map handling code
765	*****************************************************************************/	699	*****************************************************************************/
…		…
777		711
778	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	712	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
779	unique = 1;	713	unique = 1;
780		714
781	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	715	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
782	{
783	op->destroy_inv (false);
784	op->destroy ();	716	op->destroy ();
785	}
786		717
787	op = above;	718	op = above;
788	}	719	}
789	}	720	}
790	}	721	}
…		…
800	if (name) MAP_OUT (name);	731	if (name) MAP_OUT (name);
801	MAP_OUT (swap_time);	732	MAP_OUT (swap_time);
802	MAP_OUT (reset_time);	733	MAP_OUT (reset_time);
803	MAP_OUT (reset_timeout);	734	MAP_OUT (reset_timeout);
804	MAP_OUT (fixed_resettime);	735	MAP_OUT (fixed_resettime);
		736	MAP_OUT (no_reset);
		737	MAP_OUT (no_drop);
805	MAP_OUT (difficulty);	738	MAP_OUT (difficulty);
806
807	if (default_region) MAP_OUT2 (region, default_region->name);	739	if (default_region) MAP_OUT2 (region, default_region->name);
808		740
809	if (shopitems)	741	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
810	{
811	char shop[MAX_BUF];
812	print_shop_string (this, shop);
813	MAP_OUT2 (shopitems, shop);
814	}
815
816	MAP_OUT (shopgreed);	742	MAP_OUT (shopgreed);
817	MAP_OUT (shopmin);	743	MAP_OUT (shopmin);
818	MAP_OUT (shopmax);	744	MAP_OUT (shopmax);
819	if (shoprace) MAP_OUT (shoprace);	745	if (shoprace) MAP_OUT (shoprace);
		746
820	MAP_OUT (darkness);	747	MAP_OUT (darkness);
821	MAP_OUT (width);	748	MAP_OUT (width);
822	MAP_OUT (height);	749	MAP_OUT (height);
823	MAP_OUT (enter_x);	750	MAP_OUT (enter_x);
824	MAP_OUT (enter_y);	751	MAP_OUT (enter_y);
…		…
863	* Remove and free all objects in the given map.	790	* Remove and free all objects in the given map.
864	*/	791	*/
865	void	792	void
866	maptile::clear ()	793	maptile::clear ()
867	{	794	{
868	sfree (regions, size ()), regions = 0;
869	free (regionmap), regionmap = 0;
870
871	if (spaces)	795	if (spaces)
872	{	796	{
873	for (mapspace *ms = spaces + size (); ms-- > spaces; )	797	for (mapspace *ms = spaces + size (); ms-- > spaces; )
874	while (object *op = ms->bot)	798	while (object *op = ms->bot)
875	{	799	{
		800	// manually remove, as to not trigger anything
		801	if (ms->bot = op->above)
		802	ms->bot->below = 0;
		803
		804	op->flag [FLAG_REMOVED] = true;
		805
876	op = op->head_ ();	806	object *head = op->head_ ();
877	op->destroy_inv (false);	807	if (op == head)
878	op->destroy ();	808	op->destroy ();
		809	else if (head->map != op->map)
		810	{
		811	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		812	head->destroy ();
		813	}
879	}	814	}
880		815
881	sfree (spaces, size ()), spaces = 0;	816	sfree0 (spaces, size ());
882	}	817	}
883		818
884	if (buttons)	819	if (buttons)
885	free_objectlinkpt (buttons), buttons = 0;	820	free_objectlinkpt (buttons), buttons = 0;
		821
		822	sfree0 (regions, size ());
		823	delete [] regionmap; regionmap = 0;
886	}	824	}
887		825
888	void	826	void
889	maptile::clear_header ()	827	maptile::clear_header ()
890	{	828	{
…		…
922	attachable::do_destroy ();	860	attachable::do_destroy ();
923		861
924	clear ();	862	clear ();
925	}	863	}
926		864
927	/*	865	/* decay and destroy perishable items in a map */
928	* Updates every button on the map (by calling update_button() for them).
929	*/
930	void	866	void
931	maptile::update_buttons ()	867	maptile::do_decay_objects ()
932	{	868	{
933	for (oblinkpt *obp = buttons; obp; obp = obp->next)	869	if (!spaces)
934	for (objectlink *ol = obp->link; ol; ol = ol->next)	870	return;
		871
		872	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		873	for (object above, op = ms->bot; op; op = above)
935	{	874	{
936	if (!ol->ob)	875	above = op->above;
		876
		877	bool destroy = 0;
		878
		879	// do not decay anything above unique floor tiles (yet :)
		880	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
		881	break;
		882
		883	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
		884	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
		885	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
		886	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
		887	\|\| QUERY_FLAG (op, FLAG_UNPAID)
		888	\|\| op->is_alive ())
		889	; // do not decay
		890	else if (op->is_weapon ())
937	{	891	{
938	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",	892	op->stats.dam--;
939	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);	893	if (op->stats.dam < 0)
940	continue;	894	destroy = 1;
941	}	895	}
942		896	else if (op->is_armor ())
943	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
944	{	897	{
945	update_button (ol->ob);	898	op->stats.ac--;
946	break;	899	if (op->stats.ac < 0)
		900	destroy = 1;
947	}	901	}
		902	else if (op->type == FOOD)
		903	{
		904	op->stats.food -= rndm (5, 20);
		905	if (op->stats.food < 0)
		906	destroy = 1;
		907	}
		908	else
		909	{
		910	int mat = op->materials;
		911
		912	if (mat & M_PAPER
		913	\|\| mat & M_LEATHER
		914	\|\| mat & M_WOOD
		915	\|\| mat & M_ORGANIC
		916	\|\| mat & M_CLOTH
		917	\|\| mat & M_LIQUID
		918	\|\| (mat & M_IRON && rndm (1, 5) == 1)
		919	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
		920	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
		921	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
		922	\|\| (mat & M_ICE && temp > 32))
		923	destroy = 1;
		924	}
		925
		926	/* adjust overall chance below */
		927	if (destroy && rndm (0, 1))
		928	op->destroy ();
948	}	929	}
949	}	930	}
950		931
951	/*	932	/*
952	* This routine is supposed to find out the difficulty of the map.	933	* This routine is supposed to find out the difficulty of the map.
953	* difficulty does not have a lot to do with character level,	934	* difficulty does not have a lot to do with character level,
954	* but does have a lot to do with treasure on the map.	935	* but does have a lot to do with treasure on the map.
955	*	936	*
956	* Difficulty can now be set by the map creature. If the value stored	937	* Difficulty can now be set by the map creator. If the value stored
957	* in the map is zero, then use this routine. Maps should really	938	* in the map is zero, then use this routine. Maps should really
958	* have a difficulty set than using this function - human calculation	939	* have a difficulty set rather than using this function - human calculation
959	* is much better than this functions guesswork.	940	* is much better than this function's guesswork.
960	*/	941	*/
961	int	942	int
962	maptile::estimate_difficulty () const	943	maptile::estimate_difficulty () const
963	{	944	{
964	long monster_cnt = 0;	945	long monster_cnt = 0;
…		…
976		957
977	if (QUERY_FLAG (op, FLAG_GENERATOR))	958	if (QUERY_FLAG (op, FLAG_GENERATOR))
978	{	959	{
979	total_exp += op->stats.exp;	960	total_exp += op->stats.exp;
980		961
981	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	962	if (archetype *at = op->other_arch)
		963	{
982	total_exp += at->stats.exp * 8;	964	total_exp += at->stats.exp * 8;
983
984	monster_cnt++;	965	monster_cnt++;
		966	}
		967
		968	for (object *inv = op->inv; inv; inv = inv->below)
		969	{
		970	total_exp += op->stats.exp * 8;
		971	monster_cnt++;
		972	}
985	}	973	}
986	}	974	}
987		975
988	avgexp = (double) total_exp / monster_cnt;	976	avgexp = (double) total_exp / monster_cnt;
989		977
…		…
1002	* postive values make it darker, negative make it brighter	990	* postive values make it darker, negative make it brighter
1003	*/	991	*/
1004	int	992	int
1005	maptile::change_map_light (int change)	993	maptile::change_map_light (int change)
1006	{	994	{
1007	int new_level = darkness + change;
1008
1009	/* Nothing to do */	995	/* Nothing to do */
1010	if (!change \|\| (new_level <= 0 && darkness == 0) \|\| (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	996	if (!change)
1011	return 0;	997	return 0;
1012		998
1013	/* inform all players on the map */	999	/* inform all players on the map */
1014	if (change > 0)	1000	if (change > 0)
1015	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");	1001	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");
1016	else	1002	else
1017	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");	1003	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");
1018		1004
1019	/* Do extra checking. since darkness is a unsigned value,	1005	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1020	* we need to be extra careful about negative values.
1021	* In general, the checks below are only needed if change
1022	* is not +/-1
1023	*/
1024	if (new_level < 0)
1025	darkness = 0;
1026	else if (new_level >= MAX_DARKNESS)
1027	darkness = MAX_DARKNESS;
1028	else
1029	darkness = new_level;
1030		1006
1031	/* All clients need to get re-updated for the change */	1007	/* All clients need to get re-updated for the change */
1032	update_all_map_los (this);	1008	update_all_map_los (this);
		1009
1033	return 1;	1010	return 1;
1034	}	1011	}
1035		1012
1036	/*	1013	/*
1037	* This function updates various attributes about a specific space	1014	* This function updates various attributes about a specific space
…		…
1040	* through, etc)	1017	* through, etc)
1041	*/	1018	*/
1042	void	1019	void
1043	mapspace::update_ ()	1020	mapspace::update_ ()
1044	{	1021	{
1045	object tmp, last = 0;	1022	object *last = 0;
1046	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1023	uint8 flags = P_UPTODATE, anywhere = 0;
		1024	sint8 light = 0;
1047	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1025	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1048		1026
1049	//object *middle = 0;	1027	//object *middle = 0;
1050	//object *top = 0;	1028	//object *top = 0;
1051	//object *floor = 0;	1029	//object *floor = 0;
1052	// this seems to generate better code than using locals, above	1030	// this seems to generate better code than using locals, above
1053	object *&top = faces_obj[0] = 0;	1031	object *&top = faces_obj[0] = 0;
1054	object *&middle = faces_obj[1] = 0;	1032	object *&middle = faces_obj[1] = 0;
1055	object *&floor = faces_obj[2] = 0;	1033	object *&floor = faces_obj[2] = 0;
1056		1034
1057	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1035	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1058	{	1036	{
1059	/* This could be made additive I guess (two lights better than	1037	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1060	* one). But if so, it shouldn't be a simple additive - 2
1061	* light bulbs do not illuminate twice as far as once since
1062	* it is a dissapation factor that is cubed.
1063	*/
1064	if (tmp->glow_radius > light)
1065	light = tmp->glow_radius;	1038	light += tmp->glow_radius;
1066		1039
1067	/* This call is needed in order to update objects the player	1040	/* This call is needed in order to update objects the player
1068	* is standing in that have animations (ie, grass, fire, etc).	1041	* is standing in that have animations (ie, grass, fire, etc).
1069	* However, it also causes the look window to be re-drawn	1042	* However, it also causes the look window to be re-drawn
1070	* 3 times each time the player moves, because many of the	1043	* 3 times each time the player moves, because many of the
…		…
1089	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))	1062	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1090	{	1063	{
1091	middle = tmp;	1064	middle = tmp;
1092	anywhere = 1;	1065	anywhere = 1;
1093	}	1066	}
		1067
1094	/* Find the highest visible face around. If equal	1068	/* Find the highest visible face around. If equal
1095	* visibilities, we still want the one nearer to the	1069	* visibilities, we still want the one nearer to the
1096	* top	1070	* top
1097	*/	1071	*/
1098	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))	1072	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
…		…
1117	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1091	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1118	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;	1092	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1119	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;	1093	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1120	}	1094	}
1121		1095
1122	this->light = light;	1096	this->light = min (light, MAX_LIGHT_RADIUS);
1123	this->flags_ = flags;	1097	this->flags_ = flags;
1124	this->move_block = move_block & ~move_allow;	1098	this->move_block = move_block & ~move_allow;
1125	this->move_on = move_on;	1099	this->move_on = move_on;
1126	this->move_off = move_off;	1100	this->move_off = move_off;
1127	this->move_slow = move_slow;	1101	this->move_slow = move_slow;
…		…
1147	* 1) top face is set, need middle to be set.	1121	* 1) top face is set, need middle to be set.
1148	* 2) middle is set, need to set top.	1122	* 2) middle is set, need to set top.
1149	* 3) neither middle or top is set - need to set both.	1123	* 3) neither middle or top is set - need to set both.
1150	*/	1124	*/
1151		1125
1152	for (tmp = last; tmp; tmp = tmp->below)	1126	for (object *tmp = last; tmp; tmp = tmp->below)
1153	{	1127	{
1154	/* Once we get to a floor, stop, since we already have a floor object */	1128	/* Once we get to a floor, stop, since we already have a floor object */
1155	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1129	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1156	break;	1130	break;
1157		1131
…		…
1209	vol += op->volume ();	1183	vol += op->volume ();
1210		1184
1211	return vol;	1185	return vol;
1212	}	1186	}
1213		1187
1214	/* this updates the orig_map->tile_map[tile_num] value after finding	1188	maptile *
1215	* the map. It also takes care of linking back the freshly found	1189	maptile::tile_available (int dir, bool load)
1216	* maps tile_map values if it tiles back to this one. It returns
1217	* the value of orig_map->tile_map[tile_num].
1218	*/
1219	static inline maptile *
1220	find_and_link (maptile *orig_map, int tile_num)
1221	{	1190	{
1222	maptile *mp = orig_map->tile_map [tile_num];	1191	if (tile_path[dir])
1223
1224	if (!mp)
1225	{
1226	mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1227
1228	if (!mp)
1229	{
1230	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1231	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1232	&orig_map->tile_path[tile_num], &orig_map->path);
1233	mp = new maptile (1, 1);
1234	mp->alloc ();
1235	mp->in_memory = MAP_IN_MEMORY;
1236	}
1237	}	1192	{
		1193	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
		1194	return tile_map[dir];
1238		1195
1239	int dest_tile = (tile_num + 2) % 4;	1196	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1197	return tile_map[dir];
		1198	}
1240		1199
1241	orig_map->tile_map [tile_num] = mp;
1242
1243	// optimisation: back-link map to origin map if euclidean
1244	//TODO: non-euclidean maps MUST GO
1245	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1246	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1247
1248	return mp;	1200	return 0;
1249	}
1250
1251	static inline void
1252	load_and_link (maptile *orig_map, int tile_num)
1253	{
1254	find_and_link (orig_map, tile_num)->load_sync ();
1255	}	1201	}
1256		1202
1257	/* this returns TRUE if the coordinates (x,y) are out of	1203	/* this returns TRUE if the coordinates (x,y) are out of
1258	* map m. This function also takes into account any	1204	* map m. This function also takes into account any
1259	* tiling considerations, loading adjacant maps as needed.	1205	* tiling considerations, loading adjacant maps as needed.
…		…
1272	if (!m)	1218	if (!m)
1273	return 0;	1219	return 0;
1274		1220
1275	if (x < 0)	1221	if (x < 0)
1276	{	1222	{
1277	if (!m->tile_path[3])	1223	if (!m->tile_available (3))
1278	return 1;	1224	return 1;
1279		1225
1280	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1281	find_and_link (m, 3);
1282
1283	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1226	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1284	}	1227	}
1285		1228
1286	if (x >= m->width)	1229	if (x >= m->width)
1287	{	1230	{
1288	if (!m->tile_path[1])	1231	if (!m->tile_available (1))
1289	return 1;	1232	return 1;
1290		1233
1291	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1292	find_and_link (m, 1);
1293
1294	return out_of_map (m->tile_map[1], x - m->width, y);	1234	return out_of_map (m->tile_map[1], x - m->width, y);
1295	}	1235	}
1296		1236
1297	if (y < 0)	1237	if (y < 0)
1298	{	1238	{
1299	if (!m->tile_path[0])	1239	if (!m->tile_available (0))
1300	return 1;	1240	return 1;
1301		1241
1302	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1303	find_and_link (m, 0);
1304
1305	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1242	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1306	}	1243	}
1307		1244
1308	if (y >= m->height)	1245	if (y >= m->height)
1309	{	1246	{
1310	if (!m->tile_path[2])	1247	if (!m->tile_available (2))
1311	return 1;	1248	return 1;
1312
1313	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1314	find_and_link (m, 2);
1315		1249
1316	return out_of_map (m->tile_map[2], x, y - m->height);	1250	return out_of_map (m->tile_map[2], x, y - m->height);
1317	}	1251	}
1318		1252
1319	/* Simple case - coordinates are within this local	1253	/* Simple case - coordinates are within this local
…		…
1333	maptile *	1267	maptile *
1334	maptile::xy_find (sint16 &x, sint16 &y)	1268	maptile::xy_find (sint16 &x, sint16 &y)
1335	{	1269	{
1336	if (x < 0)	1270	if (x < 0)
1337	{	1271	{
1338	if (!tile_path[3])	1272	if (!tile_available (3))
1339	return 0;	1273	return 0;
1340		1274
1341	find_and_link (this, 3);
1342	x += tile_map[3]->width;	1275	x += tile_map[3]->width;
1343	return tile_map[3]->xy_find (x, y);	1276	return tile_map[3]->xy_find (x, y);
1344	}	1277	}
1345		1278
1346	if (x >= width)	1279	if (x >= width)
1347	{	1280	{
1348	if (!tile_path[1])	1281	if (!tile_available (1))
1349	return 0;	1282	return 0;
1350		1283
1351	find_and_link (this, 1);
1352	x -= width;	1284	x -= width;
1353	return tile_map[1]->xy_find (x, y);	1285	return tile_map[1]->xy_find (x, y);
1354	}	1286	}
1355		1287
1356	if (y < 0)	1288	if (y < 0)
1357	{	1289	{
1358	if (!tile_path[0])	1290	if (!tile_available (0))
1359	return 0;	1291	return 0;
1360		1292
1361	find_and_link (this, 0);
1362	y += tile_map[0]->height;	1293	y += tile_map[0]->height;
1363	return tile_map[0]->xy_find (x, y);	1294	return tile_map[0]->xy_find (x, y);
1364	}	1295	}
1365		1296
1366	if (y >= height)	1297	if (y >= height)
1367	{	1298	{
1368	if (!tile_path[2])	1299	if (!tile_available (2))
1369	return 0;	1300	return 0;
1370		1301
1371	find_and_link (this, 2);
1372	y -= height;	1302	y -= height;
1373	return tile_map[2]->xy_find (x, y);	1303	return tile_map[2]->xy_find (x, y);
1374	}	1304	}
1375		1305
1376	/* Simple case - coordinates are within this local	1306	/* Simple case - coordinates are within this local
…		…
1387	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1317	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1388	{	1318	{
1389	if (!map1 \|\| !map2)	1319	if (!map1 \|\| !map2)
1390	return 0;	1320	return 0;
1391		1321
1392	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1322	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1393	//fix: compare paths instead (this is likely faster, too!)	1323	//fix: compare paths instead (this is likely faster, too!)
1394	if (map1 == map2)	1324	if (map1 == map2)
1395	{	1325	{
1396	*dx = 0;	1326	*dx = 0;
1397	*dy = 0;	1327	*dy = 0;
…		…
1579	else	1509	else
1580	{	1510	{
1581	retval->distance_x += op2->x - x;	1511	retval->distance_x += op2->x - x;
1582	retval->distance_y += op2->y - y;	1512	retval->distance_y += op2->y - y;
1583		1513
1584	retval->part = NULL;	1514	retval->part = 0;
1585	retval->distance = idistance (retval->distance_x, retval->distance_y);	1515	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1586	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1516	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1587	}	1517	}
1588	}	1518	}
1589		1519
1590	/* Returns true of op1 and op2 are effectively on the same map	1520	/* Returns true of op1 and op2 are effectively on the same map
…		…
1604	}	1534	}
1605		1535
1606	object *	1536	object *
1607	maptile::insert (object op, int x, int y, object originator, int flags)	1537	maptile::insert (object op, int x, int y, object originator, int flags)
1608	{	1538	{
1609	if (!op->flag [FLAG_REMOVED])
1610	op->remove ();
1611
1612	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1539	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1613	}	1540	}
1614		1541
1615	region *	1542	region *
1616	maptile::region (int x, int y) const	1543	maptile::region (int x, int y) const
…		…
1626		1553
1627	return ::region::default_region ();	1554	return ::region::default_region ();
1628	}	1555	}
1629		1556
1630	/* picks a random object from a style map.	1557	/* picks a random object from a style map.
1631	* Redone by MSW so it should be faster and not use static
1632	* variables to generate tables.
1633	*/	1558	*/
1634	object *	1559	object *
1635	maptile::pick_random_object () const	1560	maptile::pick_random_object (rand_gen &gen) const
1636	{	1561	{
1637	/* while returning a null object will result in a crash, that	1562	/* while returning a null object will result in a crash, that
1638	* is actually preferable to an infinite loop. That is because	1563	* is actually preferable to an infinite loop. That is because
1639	* most servers will automatically restart in case of crash.	1564	* most servers will automatically restart in case of crash.
1640	* Change the logic on getting the random space - shouldn't make	1565	* Change the logic on getting the random space - shouldn't make
1641	* any difference, but this seems clearer to me.	1566	* any difference, but this seems clearer to me.
1642	*/	1567	*/
1643	for (int i = 1000; --i;)	1568	for (int i = 1000; --i;)
1644	{	1569	{
1645	object *pick = at (rndm (width), rndm (height)).bot;	1570	object *pick = at (gen (width), gen (height)).bot;
1646		1571
1647	// do not prefer big monsters just because they are big.	1572	// do not prefer big monsters just because they are big.
1648	if (pick && pick->head_ () == pick)	1573	if (pick && pick->is_head ())
1649	return pick->head_ ();	1574	return pick->head_ ();
1650	}	1575	}
1651		1576
1652	// instead of crashing in the unlikely(?) case, try to return something	1577	// instead of crashing in the unlikely(?) case, try to return something
1653	return get_archetype ("blocked");	1578	return archetype::find ("bug");
1654	}	1579	}
1655		1580
		1581	void
		1582	maptile::play_sound (faceidx sound, int x, int y) const
		1583	{
		1584	if (!sound)
		1585	return;
		1586
		1587	for_all_players_on_map (pl, this)
		1588	if (client *ns = pl->ns)
		1589	{
		1590	int dx = x - pl->ob->x;
		1591	int dy = y - pl->ob->y;
		1592
		1593	int distance = idistance (dx, dy);
		1594
		1595	if (distance <= MAX_SOUND_DISTANCE)
		1596	ns->play_sound (sound, dx, dy);
		1597	}
		1598	}
		1599
		1600	void
		1601	maptile::say_msg (const char *msg, int x, int y) const
		1602	{
		1603	for_all_players (pl)
		1604	if (client *ns = pl->ns)
		1605	{
		1606	int dx = x - pl->ob->x;
		1607	int dy = y - pl->ob->y;
		1608
		1609	int distance = idistance (dx, dy);
		1610
		1611	if (distance <= MAX_SOUND_DISTANCE)
		1612	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
		1613	}
		1614	}
		1615
		1616	static void
		1617	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1618	{
		1619	// clip to map to the left
		1620	if (x0 < 0)
		1621	{
		1622	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1623	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1624
		1625	if (x1 < 0) // entirely to the left
		1626	return;
		1627
		1628	x0 = 0;
		1629	}
		1630
		1631	// clip to map to the right
		1632	if (x1 > m->width)
		1633	{
		1634	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1635	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1636
		1637	if (x0 > m->width) // entirely to the right
		1638	return;
		1639
		1640	x1 = m->width;
		1641	}
		1642
		1643	// clip to map above
		1644	if (y0 < 0)
		1645	{
		1646	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1647	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1648
		1649	if (y1 < 0) // entirely above
		1650	return;
		1651
		1652	y0 = 0;
		1653	}
		1654
		1655	// clip to map below
		1656	if (y1 > m->height)
		1657	{
		1658	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1659	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1660
		1661	if (y0 > m->height) // entirely below
		1662	return;
		1663
		1664	y1 = m->height;
		1665	}
		1666
		1667	// if we get here, the rect is within the current map
		1668	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1669
		1670	r->m = m;
		1671	r->x0 = x0;
		1672	r->y0 = y0;
		1673	r->x1 = x1;
		1674	r->y1 = y1;
		1675	r->dx = dx;
		1676	r->dy = dy;
		1677	}
		1678
		1679	maprect *
		1680	maptile::split_to_tiles (int x0, int y0, int x1, int y1)
		1681	{
		1682	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
		1683	buf.clear ();
		1684
		1685	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1686
		1687	// add end marker
		1688	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1689	r->m = 0;
		1690
		1691	return (maprect *)buf.linearise ();
		1692	}
		1693

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.107 by root, Mon Jun 4 13:04:00 2007 UTC vs. Revision 1.164 by root, Fri Oct 16 01:19:12 2009 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.107 by root, Mon Jun 4 13:04:00 2007 UTC vs.
Revision 1.164 by root, Fri Oct 16 01:19:12 2009 UTC