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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.111 by elmex, Thu Jul 12 18:28:09 2007 UTC vs.
Revision 1.161 by root, Mon Oct 12 21:27:55 2009 UTC

…		…
1	/*	1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.	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 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	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License 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	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* 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>
22	*/	23	*/
23		24
24	#include <unistd.h>	25	#include <unistd.h>
25		26
26	#include "global.h"	27	#include "global.h"
27	#include "funcpoint.h"
28
29	#include "loader.h"	28	#include "loader.h"
30
31	#include "path.h"	29	#include "path.h"
32		30
33	/*	31	sint8 maptile::outdoor_darkness;
34	* This makes a path absolute outside the world of Crossfire.
35	* In other words, it prepends LIBDIR/MAPDIR/ to the given path
36	* and returns the pointer to a static array containing the result.
37	* it really should be called create_mapname
38	*/
39	const char *
40	create_pathname (const char *name)
41	{
42	static char buf[8192];
43	snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
44	return buf;
45	}
46
47	/*
48	* This function checks if a file with the given path exists.
49	* -1 is returned if it fails, otherwise the mode of the file
50	* is returned.
51	* It tries out all the compression suffixes listed in the uncomp[] array.
52	*
53	* If prepend_dir is set, then we call create_pathname (which prepends
54	* libdir & mapdir). Otherwise, we assume the name given is fully
55	* complete.
56	* Only the editor actually cares about the writablity of this -
57	* the rest of the code only cares that the file is readable.
58	* when the editor goes away, the call to stat should probably be
59	* replaced by an access instead (similar to the windows one, but
60	* that seems to be missing the prepend_dir processing
61	*/
62	int
63	check_path (const char *name, int prepend_dir)
64	{
65	char buf[MAX_BUF];
66
67	char *endbuf;
68	struct stat statbuf;
69	int mode = 0;
70
71	if (prepend_dir)
72	assign (buf, create_pathname (name));
73	else
74	assign (buf, name);
75
76	/* old method (strchr(buf, '\0')) seemd very odd to me -
77	* this method should be equivalant and is clearer.
78	* Can not use strcat because we need to cycle through
79	* all the names.
80	*/
81	endbuf = buf + strlen (buf);
82
83	if (stat (buf, &statbuf))
84	return -1;
85	if (!S_ISREG (statbuf.st_mode))
86	return (-1);
87
88	if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) \|\|
89	((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IROTH))
90	mode \|= 4;
91
92	if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) \|\|
93	(statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IWOTH))
94	mode \|= 2;
95
96	return (mode);
97	}
98		32
99	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	33	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
100	* one function that just returns a P_.. value (see map.h)	34	* one function that just returns a P_.. value (see map.h)
101	* it will also do map translation for tiled maps, returning	35	* it will also do map translation for tiled maps, returning
102	* 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
137	* by the caller.	71	* by the caller.
138	*/	72	*/
139	int	73	int
140	blocked_link (object ob, maptile m, int sx, int sy)	74	blocked_link (object ob, maptile m, int sx, int sy)
141	{	75	{
142	object *tmp;
143	int mflags, blocked;
144
145	/* 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
146	* have already checked this.	77	* have already checked this.
147	*/	78	*/
148	if (OUT_OF_REAL_MAP (m, sx, sy))	79	if (OUT_OF_REAL_MAP (m, sx, sy))
149	{	80	{
…		…
152	}	83	}
153		84
154	/* 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
155	* directly.	86	* directly.
156	*/	87	*/
157	mflags = m->at (sx, sy).flags ();	88	mapspace &ms = m->at (sx, sy);
158		89
159	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);	90	int mflags = ms.flags ();
		91	int blocked = ms.move_block;
160		92
161	/* If space is currently not blocked by anything, no need to	93	/* If space is currently not blocked by anything, no need to
162	* go further. Not true for players - all sorts of special	94	* go further. Not true for players - all sorts of special
163	* things we need to do for players.	95	* things we need to do for players.
164	*/	96	*/
165	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	97	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
166	return 0;	98	return 0;
167		99
168	/* 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
169	* 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
170	* 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
171	* or another. Likewise, only if something is blocking us do we	103	* or another. Likewise, only if something is blocking us do we
172	* need to investigate if there is a special circumstance that would	104	* need to investigate if there is a special circumstance that would
173	* let the player through (inventory checkers for example)	105	* let the player through (inventory checkers for example)
…		…
180	/* 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
181	* 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
182	* true. If we get through the entire stack, that must mean	114	* true. If we get through the entire stack, that must mean
183	* ob is blocking it, so return 0.	115	* ob is blocking it, so return 0.
184	*/	116	*/
185	for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)	117	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
186	{	118	{
187
188	/* This must be before the checks below. Code for inventory checkers. */	119	/* This must be before the checks below. Code for inventory checkers. */
189	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))	120	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
190	{	121	{
		122	bool have = check_inv_recursive (ob, tmp);
		123
191	/* If last_sp is set, the player/monster needs an object,	124	/* If last_sp is set, the player/monster needs an object,
192	* so we check for it. If they don't have it, they can't	125	* so we check for it. If they don't have it, they can't
193	* pass through this space.	126	* pass through this space.
194	*/	127	*/
195	if (tmp->last_sp)	128	if (tmp->last_sp)
196	{	129	{
197	if (check_inv_recursive (ob, tmp) == NULL)	130	if (!have)
198	return 1;	131	return 1;
199	else
200	continue;
201	}	132	}
202	else	133	else
203	{	134	{
204	/* In this case, the player must not have the object -	135	/* In this case, the player must not have the object -
205	* if they do, they can't pass through.	136	* if they do, they can't pass through.
206	*/	137	*/
207	if (check_inv_recursive (ob, tmp) != NULL) /* player has object */	138	if (have)
208	return 1;	139	return 1;
209	else
210	continue;
211	}	140	}
212	} /* if check_inv */	141	}
213	else	142	else
214	{	143	{
215	/* Broke apart a big nasty if into several here to make	144	/* Broke apart a big nasty if into several here to make
216	* this more readable. first check - if the space blocks	145	* this more readable. first check - if the space blocks
217	* movement, can't move here.	146	* movement, can't move here.
218	* second - if a monster, can't move there, unless it is a	147	* second - if a monster, can't move there, unless it is a
219	* hidden dm	148	* dm.
220	*/	149	*/
221	if (OB_MOVE_BLOCK (ob, tmp))	150	if (OB_MOVE_BLOCK (ob, tmp))
222	return 1;	151	return 1;
223		152
224	if (tmp->flag [FLAG_ALIVE]	153	if (tmp->flag [FLAG_ALIVE]
225	&& tmp->head_ () != ob	154	&& tmp->head_ () != ob
226	&& tmp != ob	155	&& tmp != ob
227	&& tmp->type != DOOR	156	&& tmp->type != DOOR
228	&& !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))	157	&& !tmp->flag [FLAG_WIZ])
229	return 1;	158	return 1;
230	}	159	}
231
232	}	160	}
		161
233	return 0;	162	return 0;
234	}	163	}
235		164
236	/*	165	/*
237	* Returns true if the given object can't fit in the given spot.	166	* Returns qthe blocking object if the given object can't fit in the given
238	* This is meant for multi space objects - for single space objecs,	167	* spot. This is meant for multi space objects - for single space objecs,
239	* just calling get_map_blocked and checking that against movement type	168	* just calling get_map_blocked and checking that against movement type
240	* of object. This function goes through all the parts of the	169	* of object. This function goes through all the parts of the multipart
241	* multipart object and makes sure they can be inserted.	170	* object and makes sure they can be inserted.
242	*	171	*
243	* While this doesn't call out of map, the get_map_flags does.	172	* While this doesn't call out of map, the get_map_flags does.
244	*	173	*
245	* This function has been used to deprecate arch_out_of_map -	174	* This function has been used to deprecate arch_out_of_map -
246	* this function also does that check, and since in most cases,	175	* this function also does that check, and since in most cases,
…		…
257	*	186	*
258	* Note this used to be arch_blocked, but with new movement	187	* Note this used to be arch_blocked, but with new movement
259	* code, we need to have actual object to check its move_type	188	* code, we need to have actual object to check its move_type
260	* against the move_block values.	189	* against the move_block values.
261	*/	190	*/
262	int	191	bool
263	ob_blocked (const object ob, maptile m, sint16 x, sint16 y)	192	object::blocked (maptile *m, int x, int y) const
264	{	193	{
265	archetype *tmp;	194	for (archetype tmp = arch; tmp; tmp = (archetype )tmp->more)
266	int flag;
267	maptile *m1;
268	sint16 sx, sy;
269
270	if (!ob)
271	{
272	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
273	if (flag & P_OUT_OF_MAP)
274	return P_OUT_OF_MAP;
275
276	/* don't have object, so don't know what types would block */
277	return m1->at (sx, sy).move_block;
278	}	195	{
		196	mapxy pos (m, x + tmp->x, y + tmp->y);
279		197
280	for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more)	198	if (!pos.normalise ())
281	{	199	return 1;
282	flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
283		200
284	if (flag & P_OUT_OF_MAP)	201	mapspace &ms = *pos;
285	return P_OUT_OF_MAP;	202
286	if (flag & P_IS_ALIVE)	203	if (ms.flags () & P_IS_ALIVE)
287	return P_IS_ALIVE;	204	return 1;
288		205
289	mapspace &ms = m1->at (sx, sy);	206	/* However, often ob doesn't have any move type
290		207	* (signifying non-moving objects)
291	/* find_first_free_spot() calls this function. However, often
292	* ob doesn't have any move type (when used to place exits)
293	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	208	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
294	*/	209	*/
295
296	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	210	if (!move_type && ms.move_block != MOVE_ALL)
297	continue;	211	continue;
298		212
299	/* Note it is intentional that we check ob - the movement type of the	213	/* Note it is intentional that we check ob - the movement type of the
300	* head of the object should correspond for the entire object.	214	* head of the object should correspond for the entire object.
301	*/	215	*/
302	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	216	if (ms.blocks (move_type))
303	return P_NO_PASS;	217	return 1;
304	}	218	}
305		219
306	return 0;	220	return 0;
307	}	221	}
308		222
…		…
326		240
327	insert_ob_in_ob (tmp, container);	241	insert_ob_in_ob (tmp, container);
328	tmp = next;	242	tmp = next;
329	}	243	}
330		244
331	/* sum_weight will go through and calculate what all the containers are	245	// go through and calculate what all the containers are carrying.
332	* carrying.	246	//TODO: remove
333	*/	247	container->update_weight ();
334	sum_weight (container);
335	}	248	}
336		249
337	void	250	void
338	maptile::set_object_flag (int flag, int value)	251	maptile::set_object_flag (int flag, int value)
339	{	252	{
…		…
341	return;	254	return;
342		255
343	for (mapspace *ms = spaces + size (); ms-- > spaces; )	256	for (mapspace *ms = spaces + size (); ms-- > spaces; )
344	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	257	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
345	tmp->flag [flag] = value;	258	tmp->flag [flag] = value;
		259	}
		260
		261	void
		262	maptile::post_load_original ()
		263	{
		264	if (!spaces)
		265	return;
		266
		267	set_object_flag (FLAG_OBJ_ORIGINAL);
		268
		269	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		270	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		271	INVOKE_OBJECT (RESET, tmp);
346	}	272	}
347		273
348	/* link_multipart_objects go through all the objects on the map looking	274	/* link_multipart_objects go through all the objects on the map looking
349	* for objects whose arch says they are multipart yet according to the	275	* for objects whose arch says they are multipart yet according to the
350	* info we have, they only have the head (as would be expected when	276	* info we have, they only have the head (as would be expected when
…		…
388	bool	314	bool
389	maptile::_load_objects (object_thawer &f)	315	maptile::_load_objects (object_thawer &f)
390	{	316	{
391	for (;;)	317	for (;;)
392	{	318	{
393	coroapi::cede_to_tick_every (100); // cede once in a while	319	coroapi::cede_to_tick (); // cede once in a while
394		320
395	switch (f.kw)	321	switch (f.kw)
396	{	322	{
397	case KW_arch:	323	case KW_arch:
398	if (object *op = object::read (f, this))	324	if (object *op = object::read (f, this))
399	{	325	{
		326	// TODO: why?
400	if (op->inv)	327	if (op->inv)
401	sum_weight (op);	328	op->update_weight ();
402		329
403	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ON_TOP \| INS_MAP_LOAD);	330	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
		331	{
		332	// we insert manually because
		333	// a) its way faster
		334	// b) we remove manually, too, and there are good reasons for that
		335	// c) it's correct
		336	mapspace &ms = at (op->x, op->y);
		337
		338	op->flag [FLAG_REMOVED] = false;
		339
		340	op->above = 0;
		341	op->below = ms.top;
		342
		343	*(ms.top ? &ms.top->above : &ms.bot) = op;
		344
		345	ms.top = op;
		346	ms.flags_ = 0;
		347	}
		348	else
		349	{
		350	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		351	op->destroy ();
		352	}
404	}	353	}
405		354
406	continue;	355	continue;
407		356
408	case KW_EOF:	357	case KW_EOF:
…		…
421	}	370	}
422		371
423	void	372	void
424	maptile::activate ()	373	maptile::activate ()
425	{	374	{
426	active = true;
427
428	if (spaces)	375	if (spaces)
429	for (mapspace *ms = spaces + size (); ms-- > spaces; )	376	for (mapspace *ms = spaces + size (); ms-- > spaces; )
430	for (object *op = ms->bot; op; op = op->above)	377	for (object *op = ms->bot; op; op = op->above)
431	op->activate_recursive ();	378	op->activate_recursive ();
432	}	379	}
433		380
434	void	381	void
435	maptile::deactivate ()	382	maptile::deactivate ()
436	{	383	{
437	active = false;
438
439	if (spaces)	384	if (spaces)
440	for (mapspace *ms = spaces + size (); ms-- > spaces; )	385	for (mapspace *ms = spaces + size (); ms-- > spaces; )
441	for (object *op = ms->bot; op; op = op->above)	386	for (object *op = ms->bot; op; op = op->above)
442	op->deactivate_recursive ();	387	op->deactivate_recursive ();
443	}	388	}
…		…
453	if (!spaces)	398	if (!spaces)
454	return false;	399	return false;
455		400
456	for (int i = 0; i < size (); ++i)	401	for (int i = 0; i < size (); ++i)
457	{	402	{
458	int unique = 0;	403	bool unique = 0;
		404
459	for (object *op = spaces [i].bot; op; op = op->above)	405	for (object *op = spaces [i].bot; op; op = op->above)
460	{	406	{
461	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	407	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
462	unique = 1;
463		408
464	if (!op->can_map_save ())	409	if (expect_false (!op->can_map_save ()))
465	continue;	410	continue;
466		411
467	if (unique \|\| op->flag [FLAG_UNIQUE])	412	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
468	{	413	{
469	if (flags & IO_UNIQUES)	414	if (flags & IO_UNIQUES)
470	op->write (f);	415	op->write (f);
471	}	416	}
472	else if (flags & IO_OBJECTS)	417	else if (expect_true (flags & IO_OBJECTS))
473	op->write (f);	418	op->write (f);
474	}	419	}
475	}	420	}
476		421
477	coroapi::cede_to_tick ();	422	coroapi::cede_to_tick ();
478		423
479	return true;	424	return true;
480	}
481
482	bool
483	maptile::_load_objects (const char *path, bool skip_header)
484	{
485	object_thawer f (path);
486
487	if (!f)
488	return false;
489
490	f.next ();
491
492	if (skip_header)
493	for (;;)
494	{
495	keyword kw = f.kw;
496	f.skip ();
497	if (kw == KW_end)
498	break;
499	}
500
501	return _load_objects (f);
502	}	425	}
503		426
504	bool	427	bool
505	maptile::_save_objects (const char *path, int flags)	428	maptile::_save_objects (const char *path, int flags)
506	{	429	{
…		…
681	bool	604	bool
682	maptile::_load_header (object_thawer &thawer)	605	maptile::_load_header (object_thawer &thawer)
683	{	606	{
684	for (;;)	607	for (;;)
685	{	608	{
686	thawer.next ();
687
688	switch (thawer.kw)	609	switch (thawer.kw)
689	{	610	{
690	case KW_msg:	611	case KW_msg:
691	thawer.get_ml (KW_endmsg, msg);	612	thawer.get_ml (KW_endmsg, msg);
692	break;	613	break;
…		…
726	case KW_sky: thawer.get (sky); break;	647	case KW_sky: thawer.get (sky); break;
727		648
728	case KW_per_player: thawer.get (per_player); break;	649	case KW_per_player: thawer.get (per_player); break;
729	case KW_per_party: thawer.get (per_party); break;	650	case KW_per_party: thawer.get (per_party); break;
730	case KW_no_reset: thawer.get (no_reset); break;	651	case KW_no_reset: thawer.get (no_reset); break;
		652	case KW_no_drop: thawer.get (no_drop); break;
731		653
732	case KW_region: default_region = region::find (thawer.get_str ()); break;	654	case KW_region: default_region = region::find (thawer.get_str ()); break;
733	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	655	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
734		656
735	// old names new names	657	// old names new names
…		…
746	case KW_tile_path_1: thawer.get (tile_path [0]); break;	668	case KW_tile_path_1: thawer.get (tile_path [0]); break;
747	case KW_tile_path_2: thawer.get (tile_path [1]); break;	669	case KW_tile_path_2: thawer.get (tile_path [1]); break;
748	case KW_tile_path_3: thawer.get (tile_path [2]); break;	670	case KW_tile_path_3: thawer.get (tile_path [2]); break;
749	case KW_tile_path_4: thawer.get (tile_path [3]); break;	671	case KW_tile_path_4: thawer.get (tile_path [3]); break;
750		672
		673	case KW_ERROR:
		674	set_key_text (thawer.kw_str, thawer.value);
		675	break;
		676
751	case KW_end:	677	case KW_end:
		678	thawer.next ();
752	return true;	679	return true;
753		680
754	default:	681	default:
755	if (!thawer.parse_error ("map", 0))	682	if (!thawer.parse_error ("map", 0))
756	return false;	683	return false;
757	break;	684	break;
758	}	685	}
		686
		687	thawer.next ();
759	}	688	}
760		689
761	abort ();	690	abort ();
762	}
763
764	bool
765	maptile::_load_header (const char *path)
766	{
767	object_thawer thawer (path);
768
769	if (!thawer)
770	return false;
771
772	return _load_header (thawer);
773	}	691	}
774		692
775	/******************************************************************************	693	/******************************************************************************
776	* This is the start of unique map handling code	694	* This is the start of unique map handling code
777	*****************************************************************************/	695	*****************************************************************************/
…		…
789		707
790	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	708	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
791	unique = 1;	709	unique = 1;
792		710
793	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	711	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
794	{
795	op->destroy_inv (false);
796	op->destroy ();	712	op->destroy ();
797	}
798		713
799	op = above;	714	op = above;
800	}	715	}
801	}	716	}
802	}	717	}
…		…
813	MAP_OUT (swap_time);	728	MAP_OUT (swap_time);
814	MAP_OUT (reset_time);	729	MAP_OUT (reset_time);
815	MAP_OUT (reset_timeout);	730	MAP_OUT (reset_timeout);
816	MAP_OUT (fixed_resettime);	731	MAP_OUT (fixed_resettime);
817	MAP_OUT (no_reset);	732	MAP_OUT (no_reset);
		733	MAP_OUT (no_drop);
818	MAP_OUT (difficulty);	734	MAP_OUT (difficulty);
819		735
820	if (default_region) MAP_OUT2 (region, default_region->name);	736	if (default_region) MAP_OUT2 (region, default_region->name);
821		737
822	if (shopitems)	738	if (shopitems)
…		…
876	* Remove and free all objects in the given map.	792	* Remove and free all objects in the given map.
877	*/	793	*/
878	void	794	void
879	maptile::clear ()	795	maptile::clear ()
880	{	796	{
881	sfree (regions, size ()), regions = 0;
882	free (regionmap), regionmap = 0;
883
884	if (spaces)	797	if (spaces)
885	{	798	{
886	for (mapspace *ms = spaces + size (); ms-- > spaces; )	799	for (mapspace *ms = spaces + size (); ms-- > spaces; )
887	while (object *op = ms->bot)	800	while (object *op = ms->bot)
888	{	801	{
		802	// manually remove, as to not trigger anything
		803	if (ms->bot = op->above)
		804	ms->bot->below = 0;
		805
		806	op->flag [FLAG_REMOVED] = true;
		807
889	op = op->head_ ();	808	object *head = op->head_ ();
890	op->destroy_inv (false);	809	if (op == head)
891	op->destroy ();	810	op->destroy ();
		811	else if (head->map != op->map)
		812	{
		813	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		814	head->destroy ();
		815	}
892	}	816	}
893		817
894	sfree (spaces, size ()), spaces = 0;	818	sfree0 (spaces, size ());
895	}	819	}
896		820
897	if (buttons)	821	if (buttons)
898	free_objectlinkpt (buttons), buttons = 0;	822	free_objectlinkpt (buttons), buttons = 0;
		823
		824	sfree0 (regions, size ());
		825	delete [] regionmap; regionmap = 0;
899	}	826	}
900		827
901	void	828	void
902	maptile::clear_header ()	829	maptile::clear_header ()
903	{	830	{
…		…
955	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	882	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
956	break;	883	break;
957		884
958	if (QUERY_FLAG (op, FLAG_IS_FLOOR)	885	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
959	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)	886	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
960	\|\| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
961	\|\| QUERY_FLAG (op, FLAG_UNIQUE)	887	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
962	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)	888	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
963	\|\| QUERY_FLAG (op, FLAG_UNPAID)	889	\|\| QUERY_FLAG (op, FLAG_UNPAID)
964	\|\| op->is_alive ())	890	\|\| op->is_alive ())
965	; // do not decay	891	; // do not decay
…		…
1004	op->destroy ();	930	op->destroy ();
1005	}	931	}
1006	}	932	}
1007		933
1008	/*	934	/*
1009	* Updates every button on the map (by calling update_button() for them).
1010	*/
1011	void
1012	maptile::update_buttons ()
1013	{
1014	for (oblinkpt *obp = buttons; obp; obp = obp->next)
1015	for (objectlink *ol = obp->link; ol; ol = ol->next)
1016	{
1017	if (!ol->ob)
1018	{
1019	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
1020	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
1021	continue;
1022	}
1023
1024	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
1025	{
1026	update_button (ol->ob);
1027	break;
1028	}
1029	}
1030	}
1031
1032	/*
1033	* This routine is supposed to find out the difficulty of the map.	935	* This routine is supposed to find out the difficulty of the map.
1034	* difficulty does not have a lot to do with character level,	936	* difficulty does not have a lot to do with character level,
1035	* but does have a lot to do with treasure on the map.	937	* but does have a lot to do with treasure on the map.
1036	*	938	*
1037	* Difficulty can now be set by the map creature. If the value stored	939	* Difficulty can now be set by the map creator. If the value stored
1038	* in the map is zero, then use this routine. Maps should really	940	* in the map is zero, then use this routine. Maps should really
1039	* have a difficulty set than using this function - human calculation	941	* have a difficulty set rather than using this function - human calculation
1040	* is much better than this functions guesswork.	942	* is much better than this function's guesswork.
1041	*/	943	*/
1042	int	944	int
1043	maptile::estimate_difficulty () const	945	maptile::estimate_difficulty () const
1044	{	946	{
1045	long monster_cnt = 0;	947	long monster_cnt = 0;
…		…
1057		959
1058	if (QUERY_FLAG (op, FLAG_GENERATOR))	960	if (QUERY_FLAG (op, FLAG_GENERATOR))
1059	{	961	{
1060	total_exp += op->stats.exp;	962	total_exp += op->stats.exp;
1061		963
1062	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	964	if (archetype *at = op->other_arch)
		965	{
1063	total_exp += at->stats.exp * 8;	966	total_exp += at->stats.exp * 8;
1064
1065	monster_cnt++;	967	monster_cnt++;
		968	}
		969
		970	for (object *inv = op->inv; inv; inv = inv->below)
		971	{
		972	total_exp += op->stats.exp * 8;
		973	monster_cnt++;
		974	}
1066	}	975	}
1067	}	976	}
1068		977
1069	avgexp = (double) total_exp / monster_cnt;	978	avgexp = (double) total_exp / monster_cnt;
1070		979
…		…
1083	* postive values make it darker, negative make it brighter	992	* postive values make it darker, negative make it brighter
1084	*/	993	*/
1085	int	994	int
1086	maptile::change_map_light (int change)	995	maptile::change_map_light (int change)
1087	{	996	{
1088	int new_level = darkness + change;
1089
1090	/* Nothing to do */	997	/* Nothing to do */
1091	if (!change \|\| (new_level <= 0 && darkness == 0) \|\| (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	998	if (!change)
1092	return 0;	999	return 0;
1093		1000
1094	/* inform all players on the map */	1001	/* inform all players on the map */
1095	if (change > 0)	1002	if (change > 0)
1096	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");	1003	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");
1097	else	1004	else
1098	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");	1005	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");
1099		1006
1100	/* Do extra checking. since darkness is a unsigned value,	1007	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1101	* we need to be extra careful about negative values.
1102	* In general, the checks below are only needed if change
1103	* is not +/-1
1104	*/
1105	if (new_level < 0)
1106	darkness = 0;
1107	else if (new_level >= MAX_DARKNESS)
1108	darkness = MAX_DARKNESS;
1109	else
1110	darkness = new_level;
1111		1008
1112	/* All clients need to get re-updated for the change */	1009	/* All clients need to get re-updated for the change */
1113	update_all_map_los (this);	1010	update_all_map_los (this);
		1011
1114	return 1;	1012	return 1;
1115	}	1013	}
1116		1014
1117	/*	1015	/*
1118	* This function updates various attributes about a specific space	1016	* This function updates various attributes about a specific space
…		…
1121	* through, etc)	1019	* through, etc)
1122	*/	1020	*/
1123	void	1021	void
1124	mapspace::update_ ()	1022	mapspace::update_ ()
1125	{	1023	{
1126	object tmp, last = 0;	1024	object *last = 0;
1127	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1025	uint8 flags = P_UPTODATE, anywhere = 0;
		1026	sint8 light = 0;
1128	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1027	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1129		1028
1130	//object *middle = 0;	1029	//object *middle = 0;
1131	//object *top = 0;	1030	//object *top = 0;
1132	//object *floor = 0;	1031	//object *floor = 0;
1133	// this seems to generate better code than using locals, above	1032	// this seems to generate better code than using locals, above
1134	object *&top = faces_obj[0] = 0;	1033	object *&top = faces_obj[0] = 0;
1135	object *&middle = faces_obj[1] = 0;	1034	object *&middle = faces_obj[1] = 0;
1136	object *&floor = faces_obj[2] = 0;	1035	object *&floor = faces_obj[2] = 0;
1137		1036
1138	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1037	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1139	{	1038	{
1140	/* This could be made additive I guess (two lights better than	1039	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1141	* one). But if so, it shouldn't be a simple additive - 2
1142	* light bulbs do not illuminate twice as far as once since
1143	* it is a dissapation factor that is cubed.
1144	*/
1145	if (tmp->glow_radius > light)
1146	light = tmp->glow_radius;	1040	light += tmp->glow_radius;
1147		1041
1148	/* This call is needed in order to update objects the player	1042	/* This call is needed in order to update objects the player
1149	* is standing in that have animations (ie, grass, fire, etc).	1043	* is standing in that have animations (ie, grass, fire, etc).
1150	* However, it also causes the look window to be re-drawn	1044	* However, it also causes the look window to be re-drawn
1151	* 3 times each time the player moves, because many of the	1045	* 3 times each time the player moves, because many of the
…		…
1170	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))	1064	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1171	{	1065	{
1172	middle = tmp;	1066	middle = tmp;
1173	anywhere = 1;	1067	anywhere = 1;
1174	}	1068	}
		1069
1175	/* Find the highest visible face around. If equal	1070	/* Find the highest visible face around. If equal
1176	* visibilities, we still want the one nearer to the	1071	* visibilities, we still want the one nearer to the
1177	* top	1072	* top
1178	*/	1073	*/
1179	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))	1074	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
…		…
1198	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1093	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1199	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;	1094	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1200	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;	1095	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1201	}	1096	}
1202		1097
1203	this->light = light;	1098	this->light = min (light, MAX_LIGHT_RADIUS);
1204	this->flags_ = flags;	1099	this->flags_ = flags;
1205	this->move_block = move_block & ~move_allow;	1100	this->move_block = move_block & ~move_allow;
1206	this->move_on = move_on;	1101	this->move_on = move_on;
1207	this->move_off = move_off;	1102	this->move_off = move_off;
1208	this->move_slow = move_slow;	1103	this->move_slow = move_slow;
…		…
1228	* 1) top face is set, need middle to be set.	1123	* 1) top face is set, need middle to be set.
1229	* 2) middle is set, need to set top.	1124	* 2) middle is set, need to set top.
1230	* 3) neither middle or top is set - need to set both.	1125	* 3) neither middle or top is set - need to set both.
1231	*/	1126	*/
1232		1127
1233	for (tmp = last; tmp; tmp = tmp->below)	1128	for (object *tmp = last; tmp; tmp = tmp->below)
1234	{	1129	{
1235	/* Once we get to a floor, stop, since we already have a floor object */	1130	/* Once we get to a floor, stop, since we already have a floor object */
1236	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1131	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1237	break;	1132	break;
1238		1133
…		…
1290	vol += op->volume ();	1185	vol += op->volume ();
1291		1186
1292	return vol;	1187	return vol;
1293	}	1188	}
1294		1189
1295	/* this updates the orig_map->tile_map[tile_num] value after finding	1190	maptile *
1296	* the map. It also takes care of linking back the freshly found	1191	maptile::tile_available (int dir, bool load)
1297	* maps tile_map values if it tiles back to this one. It returns
1298	* the value of orig_map->tile_map[tile_num].
1299	*/
1300	static inline maptile *
1301	find_and_link (maptile *orig_map, int tile_num)
1302	{	1192	{
1303	maptile *mp = orig_map->tile_map [tile_num];	1193	if (tile_path[dir])
1304
1305	if (!mp)
1306	{
1307	mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1308
1309	if (!mp)
1310	{
1311	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1312	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1313	&orig_map->tile_path[tile_num], &orig_map->path);
1314	mp = new maptile (1, 1);
1315	mp->alloc ();
1316	mp->in_memory = MAP_IN_MEMORY;
1317	}
1318	}	1194	{
		1195	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
		1196	return tile_map[dir];
1319		1197
1320	int dest_tile = (tile_num + 2) % 4;	1198	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1199	return tile_map[dir];
		1200	}
1321		1201
1322	orig_map->tile_map [tile_num] = mp;
1323
1324	// optimisation: back-link map to origin map if euclidean
1325	//TODO: non-euclidean maps MUST GO
1326	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1327	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1328
1329	return mp;	1202	return 0;
1330	}
1331
1332	static inline void
1333	load_and_link (maptile *orig_map, int tile_num)
1334	{
1335	find_and_link (orig_map, tile_num)->load_sync ();
1336	}	1203	}
1337		1204
1338	/* this returns TRUE if the coordinates (x,y) are out of	1205	/* this returns TRUE if the coordinates (x,y) are out of
1339	* map m. This function also takes into account any	1206	* map m. This function also takes into account any
1340	* tiling considerations, loading adjacant maps as needed.	1207	* tiling considerations, loading adjacant maps as needed.
…		…
1353	if (!m)	1220	if (!m)
1354	return 0;	1221	return 0;
1355		1222
1356	if (x < 0)	1223	if (x < 0)
1357	{	1224	{
1358	if (!m->tile_path[3])	1225	if (!m->tile_available (3))
1359	return 1;	1226	return 1;
1360		1227
1361	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1362	find_and_link (m, 3);
1363
1364	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1228	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1365	}	1229	}
1366		1230
1367	if (x >= m->width)	1231	if (x >= m->width)
1368	{	1232	{
1369	if (!m->tile_path[1])	1233	if (!m->tile_available (1))
1370	return 1;	1234	return 1;
1371		1235
1372	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1373	find_and_link (m, 1);
1374
1375	return out_of_map (m->tile_map[1], x - m->width, y);	1236	return out_of_map (m->tile_map[1], x - m->width, y);
1376	}	1237	}
1377		1238
1378	if (y < 0)	1239	if (y < 0)
1379	{	1240	{
1380	if (!m->tile_path[0])	1241	if (!m->tile_available (0))
1381	return 1;	1242	return 1;
1382		1243
1383	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1384	find_and_link (m, 0);
1385
1386	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1244	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1387	}	1245	}
1388		1246
1389	if (y >= m->height)	1247	if (y >= m->height)
1390	{	1248	{
1391	if (!m->tile_path[2])	1249	if (!m->tile_available (2))
1392	return 1;	1250	return 1;
1393
1394	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1395	find_and_link (m, 2);
1396		1251
1397	return out_of_map (m->tile_map[2], x, y - m->height);	1252	return out_of_map (m->tile_map[2], x, y - m->height);
1398	}	1253	}
1399		1254
1400	/* Simple case - coordinates are within this local	1255	/* Simple case - coordinates are within this local
…		…
1414	maptile *	1269	maptile *
1415	maptile::xy_find (sint16 &x, sint16 &y)	1270	maptile::xy_find (sint16 &x, sint16 &y)
1416	{	1271	{
1417	if (x < 0)	1272	if (x < 0)
1418	{	1273	{
1419	if (!tile_path[3])	1274	if (!tile_available (3))
1420	return 0;	1275	return 0;
1421		1276
1422	find_and_link (this, 3);
1423	x += tile_map[3]->width;	1277	x += tile_map[3]->width;
1424	return tile_map[3]->xy_find (x, y);	1278	return tile_map[3]->xy_find (x, y);
1425	}	1279	}
1426		1280
1427	if (x >= width)	1281	if (x >= width)
1428	{	1282	{
1429	if (!tile_path[1])	1283	if (!tile_available (1))
1430	return 0;	1284	return 0;
1431		1285
1432	find_and_link (this, 1);
1433	x -= width;	1286	x -= width;
1434	return tile_map[1]->xy_find (x, y);	1287	return tile_map[1]->xy_find (x, y);
1435	}	1288	}
1436		1289
1437	if (y < 0)	1290	if (y < 0)
1438	{	1291	{
1439	if (!tile_path[0])	1292	if (!tile_available (0))
1440	return 0;	1293	return 0;
1441		1294
1442	find_and_link (this, 0);
1443	y += tile_map[0]->height;	1295	y += tile_map[0]->height;
1444	return tile_map[0]->xy_find (x, y);	1296	return tile_map[0]->xy_find (x, y);
1445	}	1297	}
1446		1298
1447	if (y >= height)	1299	if (y >= height)
1448	{	1300	{
1449	if (!tile_path[2])	1301	if (!tile_available (2))
1450	return 0;	1302	return 0;
1451		1303
1452	find_and_link (this, 2);
1453	y -= height;	1304	y -= height;
1454	return tile_map[2]->xy_find (x, y);	1305	return tile_map[2]->xy_find (x, y);
1455	}	1306	}
1456		1307
1457	/* Simple case - coordinates are within this local	1308	/* Simple case - coordinates are within this local
…		…
1468	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1319	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1469	{	1320	{
1470	if (!map1 \|\| !map2)	1321	if (!map1 \|\| !map2)
1471	return 0;	1322	return 0;
1472		1323
1473	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1324	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1474	//fix: compare paths instead (this is likely faster, too!)	1325	//fix: compare paths instead (this is likely faster, too!)
1475	if (map1 == map2)	1326	if (map1 == map2)
1476	{	1327	{
1477	*dx = 0;	1328	*dx = 0;
1478	*dy = 0;	1329	*dy = 0;
…		…
1660	else	1511	else
1661	{	1512	{
1662	retval->distance_x += op2->x - x;	1513	retval->distance_x += op2->x - x;
1663	retval->distance_y += op2->y - y;	1514	retval->distance_y += op2->y - y;
1664		1515
1665	retval->part = NULL;	1516	retval->part = 0;
1666	retval->distance = idistance (retval->distance_x, retval->distance_y);	1517	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1667	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1518	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1668	}	1519	}
1669	}	1520	}
1670		1521
1671	/* Returns true of op1 and op2 are effectively on the same map	1522	/* Returns true of op1 and op2 are effectively on the same map
…		…
1685	}	1536	}
1686		1537
1687	object *	1538	object *
1688	maptile::insert (object op, int x, int y, object originator, int flags)	1539	maptile::insert (object op, int x, int y, object originator, int flags)
1689	{	1540	{
1690	if (!op->flag [FLAG_REMOVED])
1691	op->remove ();
1692
1693	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1541	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1694	}	1542	}
1695		1543
1696	region *	1544	region *
1697	maptile::region (int x, int y) const	1545	maptile::region (int x, int y) const
…		…
1707		1555
1708	return ::region::default_region ();	1556	return ::region::default_region ();
1709	}	1557	}
1710		1558
1711	/* picks a random object from a style map.	1559	/* picks a random object from a style map.
1712	* Redone by MSW so it should be faster and not use static
1713	* variables to generate tables.
1714	*/	1560	*/
1715	object *	1561	object *
1716	maptile::pick_random_object () const	1562	maptile::pick_random_object (rand_gen &gen) const
1717	{	1563	{
1718	/* while returning a null object will result in a crash, that	1564	/* while returning a null object will result in a crash, that
1719	* is actually preferable to an infinite loop. That is because	1565	* is actually preferable to an infinite loop. That is because
1720	* most servers will automatically restart in case of crash.	1566	* most servers will automatically restart in case of crash.
1721	* Change the logic on getting the random space - shouldn't make	1567	* Change the logic on getting the random space - shouldn't make
1722	* any difference, but this seems clearer to me.	1568	* any difference, but this seems clearer to me.
1723	*/	1569	*/
1724	for (int i = 1000; --i;)	1570	for (int i = 1000; --i;)
1725	{	1571	{
1726	object *pick = at (rndm (width), rndm (height)).bot;	1572	object *pick = at (gen (width), gen (height)).bot;
1727		1573
1728	// do not prefer big monsters just because they are big.	1574	// do not prefer big monsters just because they are big.
1729	if (pick && pick->head_ () == pick)	1575	if (pick && pick->is_head ())
1730	return pick->head_ ();	1576	return pick->head_ ();
1731	}	1577	}
1732		1578
1733	// instead of crashing in the unlikely(?) case, try to return something	1579	// instead of crashing in the unlikely(?) case, try to return something
1734	return get_archetype ("blocked");	1580	return archetype::find ("bug");
1735	}	1581	}
1736		1582
		1583	void
		1584	maptile::play_sound (faceidx sound, int x, int y) const
		1585	{
		1586	if (!sound)
		1587	return;
		1588
		1589	for_all_players_on_map (pl, this)
		1590	if (client *ns = pl->ns)
		1591	{
		1592	int dx = x - pl->ob->x;
		1593	int dy = y - pl->ob->y;
		1594
		1595	int distance = idistance (dx, dy);
		1596
		1597	if (distance <= MAX_SOUND_DISTANCE)
		1598	ns->play_sound (sound, dx, dy);
		1599	}
		1600	}
		1601
		1602	void
		1603	maptile::say_msg (const char *msg, int x, int y) const
		1604	{
		1605	for_all_players (pl)
		1606	if (client *ns = pl->ns)
		1607	{
		1608	int dx = x - pl->ob->x;
		1609	int dy = y - pl->ob->y;
		1610
		1611	int distance = idistance (dx, dy);
		1612
		1613	if (distance <= MAX_SOUND_DISTANCE)
		1614	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
		1615	}
		1616	}
		1617
		1618	static void
		1619	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1620	{
		1621	// clip to map to the left
		1622	if (x0 < 0)
		1623	{
		1624	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1625	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1626
		1627	if (x1 < 0) // entirely to the left
		1628	return;
		1629
		1630	x0 = 0;
		1631	}
		1632
		1633	// clip to map to the right
		1634	if (x1 > m->width)
		1635	{
		1636	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1637	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1638
		1639	if (x0 > m->width) // entirely to the right
		1640	return;
		1641
		1642	x1 = m->width;
		1643	}
		1644
		1645	// clip to map above
		1646	if (y0 < 0)
		1647	{
		1648	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1649	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1650
		1651	if (y1 < 0) // entirely above
		1652	return;
		1653
		1654	y0 = 0;
		1655	}
		1656
		1657	// clip to map below
		1658	if (y1 > m->height)
		1659	{
		1660	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1661	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1662
		1663	if (y0 > m->height) // entirely below
		1664	return;
		1665
		1666	y1 = m->height;
		1667	}
		1668
		1669	// if we get here, the rect is within the current map
		1670	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1671
		1672	r->m = m;
		1673	r->x0 = x0;
		1674	r->y0 = y0;
		1675	r->x1 = x1;
		1676	r->y1 = y1;
		1677	r->dx = dx;
		1678	r->dy = dy;
		1679	}
		1680
		1681	maprect *
		1682	maptile::split_to_tiles (int x0, int y0, int x1, int y1)
		1683	{
		1684	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
		1685	buf.clear ();
		1686
		1687	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1688
		1689	// add end marker
		1690	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1691	r->m = 0;
		1692
		1693	return (maprect *)buf.linearise ();
		1694	}
		1695

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.111 by elmex, Thu Jul 12 18:28:09 2007 UTC vs. Revision 1.161 by root, Mon Oct 12 21:27:55 2009 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.111 by elmex, Thu Jul 12 18:28:09 2007 UTC vs.
Revision 1.161 by root, Mon Oct 12 21:27:55 2009 UTC