ViewVC Help

View File | Revision Log | Show Annotations | Download File

/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.195 by root, Wed Apr 21 06:42:33 2010 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,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 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"
30
31	#include "path.h"	28	#include "path.h"
32		29
33	/*	30	//+GPL
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		31
47	/*	32	sint8 maptile::outdoor_darkness;
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		33
99	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	34	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
100	* one function that just returns a P_.. value (see map.h)	35	* one function that just returns a P_.. value (see map.h)
101	* it will also do map translation for tiled maps, returning	36	* it will also do map translation for tiled maps, returning
102	* new values into newmap, nx, and ny. Any and all of those	37	* new values into newmap, nx, and ny. Any and all of those
…		…
137	* by the caller.	72	* by the caller.
138	*/	73	*/
139	int	74	int
140	blocked_link (object *ob, maptile *m, int sx, int sy)	75	blocked_link (object *ob, maptile *m, int sx, int sy)
141	{	76	{
142	object *tmp;
143	int mflags, blocked;
144
145	/* Make sure the coordinates are valid - they should be, as caller should	77	/* Make sure the coordinates are valid - they should be, as caller should
146	* have already checked this.	78	* have already checked this.
147	*/	79	*/
148	if (OUT_OF_REAL_MAP (m, sx, sy))	80	if (OUT_OF_REAL_MAP (m, sx, sy))
149	{	81	{
150	LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");	82	LOG (llevError | logBacktrace, "blocked_link: Passed map, x, y coordinates outside of map\n");
151	return 1;	83	return 1;
152	}	84	}
153		85
154	/* Save some cycles - instead of calling get_map_flags(), just get the value	86	mapspace &ms = m->at (sx, sy);
155	* directly.
156	*/
157	mflags = m->at (sx, sy).flags ();
158		87
159	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);	88	int mflags = ms.flags ();
		89	int blocked = ms.move_block;
160		90
161	/* If space is currently not blocked by anything, no need to	91	/* If space is currently not blocked by anything, no need to
162	* go further. Not true for players - all sorts of special	92	* go further. Not true for players - all sorts of special
163	* things we need to do for players.	93	* things we need to do for players.
164	*/	94	*/
165	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	95	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
166	return 0;	96	return 0;
167		97
168	/* if there isn't anytyhing alive on this space, and this space isn't	98	/* 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	99	* 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	100	* 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	101	* or another. Likewise, only if something is blocking us do we
172	* need to investigate if there is a special circumstance that would	102	* need to investigate if there is a special circumstance that would
173	* let the player through (inventory checkers for example)	103	* let the player through (inventory checkers for example)
…		…
180	/* We basically go through the stack of objects, and if there is	110	/* 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	111	* some other object that has NO_PASS or FLAG_ALIVE set, return
182	* true. If we get through the entire stack, that must mean	112	* true. If we get through the entire stack, that must mean
183	* ob is blocking it, so return 0.	113	* ob is blocking it, so return 0.
184	*/	114	*/
185	for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)	115	for (object *tmp = ms.top; tmp; tmp = tmp->below)
186	{	116	{
187		117	if (OB_MOVE_BLOCK (ob, tmp))
188	/* This must be before the checks below. Code for inventory checkers. */
189	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
190	{	118	{
191	/* If last_sp is set, the player/monster needs an object,	119	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
192	* so we check for it. If they don't have it, they can't	120	if (RESULT_INT (0))
193	* pass through this space.	121	return 1;
194	*/	122	else
195	if (tmp->last_sp)	123	continue;
		124
		125	if (tmp->type == CHECK_INV)
196	{	126	{
197	if (check_inv_recursive (ob, tmp) == NULL)	127	bool have = check_inv_recursive (ob, tmp);
		128
		129	// last_sp set means we block if we don't have.
		130	if (logical_xor (have, tmp->last_sp))
198	return 1;	131	return 1;
199	else	132	}
200	continue;	133	else if (tmp->type == T_MATCH)
		134	{
		135	// T_MATCH allows "entrance" iff the match is true
		136	// == blocks if the match fails
		137
		138	// we could have used an INVOKE_OBJECT, but decided against it, as we
		139	// assume that T_MATCH is relatively common.
		140	if (!match (tmp->slaying, ob, tmp, ob))
		141	return 1;
201	}	142	}
202	else	143	else
203	{	144	return 1; // unconditional block
204	/* In this case, the player must not have the object -	145
205	* if they do, they can't pass through.
206	*/
207	if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
208	return 1;
209	else
210	continue;
211	}
212	} /* if check_inv */
213	else	146	} else {
214	{	147	// space does not block the ob, directly, but
215	/* Broke apart a big nasty if into several here to make	148	// anything alive that is not a door still
216	* this more readable. first check - if the space blocks	149	// blocks anything
217	* movement, can't move here.
218	* second - if a monster, can't move there, unless it is a
219	* hidden dm
220	*/
221	if (OB_MOVE_BLOCK (ob, tmp))
222	return 1;
223		150
224	if (tmp->flag [FLAG_ALIVE]	151	if (tmp->flag [FLAG_ALIVE]
225	&& tmp->head_ () != ob
226	&& tmp != ob
227	&& tmp->type != DOOR	152	&& tmp->type != DOOR
228	&& !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))	153	&& tmp->head_ () != ob) //TODO: maybe move these check up?
229	return 1;	154	return 1;
230	}	155	}
231
232	}	156	}
		157
233	return 0;	158	return 0;
234	}	159	}
235		160
236	/*	161	/*
237	* Returns true if the given object can't fit in the given spot.	162	* Returns the blocking object if the given object can't fit in the given
238	* This is meant for multi space objects - for single space objecs,	163	* spot. This is meant for multi space objects - for single space objecs,
239	* just calling get_map_blocked and checking that against movement type	164	* just calling get_map_blocked and checking that against movement type
240	* of object. This function goes through all the parts of the	165	* of object. This function goes through all the parts of the multipart
241	* multipart object and makes sure they can be inserted.	166	* object and makes sure they can be inserted.
242	*	167	*
243	* While this doesn't call out of map, the get_map_flags does.	168	* While this doesn't call out of map, the get_map_flags does.
244	*	169	*
245	* This function has been used to deprecate arch_out_of_map -	170	* This function has been used to deprecate arch_out_of_map -
246	* this function also does that check, and since in most cases,	171	* this function also does that check, and since in most cases,
…		…
257	*	182	*
258	* Note this used to be arch_blocked, but with new movement	183	* Note this used to be arch_blocked, but with new movement
259	* code, we need to have actual object to check its move_type	184	* code, we need to have actual object to check its move_type
260	* against the move_block values.	185	* against the move_block values.
261	*/	186	*/
262	int	187	bool
263	ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y)	188	object::blocked (maptile *m, int x, int y) const
264	{	189	{
265	archetype *tmp;	190	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	}	191	{
		192	mapxy pos (m, x + tmp->x, y + tmp->y);
279		193
280	for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more)	194	if (!pos.normalise ())
281	{	195	return 1;
282	flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
283		196
284	if (flag & P_OUT_OF_MAP)	197	mapspace &ms = *pos;
285	return P_OUT_OF_MAP;	198
286	if (flag & P_IS_ALIVE)	199	if (ms.flags () & P_IS_ALIVE)
287	return P_IS_ALIVE;	200	return 1;
288		201
289	mapspace &ms = m1->at (sx, sy);	202	/* However, often ob doesn't have any move type
290		203	* (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.	204	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
294	*/	205	*/
295
296	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	206	if (!move_type && ms.move_block != MOVE_ALL)
297	continue;	207	continue;
298		208
299	/* Note it is intentional that we check ob - the movement type of the	209	/* Note it is intentional that we check ob - the movement type of the
300	* head of the object should correspond for the entire object.	210	* head of the object should correspond for the entire object.
301	*/	211	*/
302	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	212	if (ms.blocks (move_type))
303	return P_NO_PASS;	213	return 1;
304	}	214	}
305		215
306	return 0;	216	return 0;
307	}	217	}
308		218
309	/* When the map is loaded, load_object does not actually insert objects	219	//-GPL
310	* into inventory, but just links them. What this does is go through
311	* and insert them properly.
312	* The object 'container' is the object that contains the inventory.
313	* This is needed so that we can update the containers weight.
314	*/
315	void
316	fix_container (object *container)
317	{
318	object *tmp = container->inv, *next;
319
320	container->inv = 0;
321	while (tmp)
322	{
323	next = tmp->below;
324	if (tmp->inv)
325	fix_container (tmp);
326
327	insert_ob_in_ob (tmp, container);
328	tmp = next;
329	}
330
331	/* sum_weight will go through and calculate what all the containers are
332	* carrying.
333	*/
334	sum_weight (container);
335	}
336		220
337	void	221	void
338	maptile::set_object_flag (int flag, int value)	222	maptile::set_object_flag (int flag, int value)
339	{	223	{
340	if (!spaces)	224	if (!spaces)
…		…
342		226
343	for (mapspace *ms = spaces + size (); ms-- > spaces; )	227	for (mapspace *ms = spaces + size (); ms-- > spaces; )
344	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	228	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
345	tmp->flag [flag] = value;	229	tmp->flag [flag] = value;
346	}	230	}
		231
		232	void
		233	maptile::post_load_original ()
		234	{
		235	if (!spaces)
		236	return;
		237
		238	set_object_flag (FLAG_OBJ_ORIGINAL);
		239
		240	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		241	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		242	INVOKE_OBJECT (RESET, tmp);
		243	}
		244
		245	void
		246	maptile::post_load ()
		247	{
		248	#if 0
		249	if (!spaces)
		250	return;
		251
		252	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		253	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		254	; // nop
		255	#endif
		256	}
		257
		258	//+GPL
347		259
348	/* link_multipart_objects go through all the objects on the map looking	260	/* 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	261	* 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	262	* info we have, they only have the head (as would be expected when
351	* they are saved).	263	* they are saved).
…		…
379	op = op->above;	291	op = op->above;
380	}	292	}
381	}	293	}
382	}	294	}
383		295
		296	//-GPL
		297
384	/*	298	/*
385	* Loads (ands parses) the objects into a given map from the specified	299	* Loads (ands parses) the objects into a given map from the specified
386	* file pointer.	300	* file pointer.
387	*/	301	*/
388	bool	302	bool
389	maptile::_load_objects (object_thawer &f)	303	maptile::_load_objects (object_thawer &f)
390	{	304	{
391	for (;;)	305	for (;;)
392	{	306	{
393	coroapi::cede_to_tick_every (100); // cede once in a while	307	coroapi::cede_to_tick (); // cede once in a while
394		308
395	switch (f.kw)	309	switch (f.kw)
396	{	310	{
397	case KW_arch:	311	case KW_arch:
398	if (object *op = object::read (f, this))	312	if (object *op = object::read (f, this))
399	{	313	{
		314	// TODO: why?
400	if (op->inv)	315	if (op->inv)
401	sum_weight (op);	316	op->update_weight ();
402		317
403	insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);	318	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
		319	{
		320	// we insert manually because
		321	// a) its way faster
		322	// b) we remove manually, too, and there are good reasons for that
		323	// c) it's correct
		324	mapspace &ms = at (op->x, op->y);
		325
		326	op->flag [FLAG_REMOVED] = false;
		327
		328	op->above = 0;
		329	op->below = ms.top;
		330
		331	*(ms.top ? &ms.top->above : &ms.bot) = op;
		332
		333	ms.top = op;
		334	ms.flags_ = 0;
		335	}
		336	else
		337	{
		338	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		339	op->destroy ();
		340	}
404	}	341	}
405		342
406	continue;	343	continue;
407		344
408	case KW_EOF:	345	case KW_EOF:
…		…
421	}	358	}
422		359
423	void	360	void
424	maptile::activate ()	361	maptile::activate ()
425	{	362	{
426	active = true;
427
428	if (spaces)	363	if (spaces)
429	for (mapspace *ms = spaces + size (); ms-- > spaces; )	364	for (mapspace *ms = spaces + size (); ms-- > spaces; )
430	for (object *op = ms->bot; op; op = op->above)	365	for (object *op = ms->bot; op; op = op->above)
431	op->activate_recursive ();	366	op->activate_recursive ();
432	}	367	}
433		368
434	void	369	void
435	maptile::deactivate ()	370	maptile::deactivate ()
436	{	371	{
437	active = false;
438
439	if (spaces)	372	if (spaces)
440	for (mapspace *ms = spaces + size (); ms-- > spaces; )	373	for (mapspace *ms = spaces + size (); ms-- > spaces; )
441	for (object *op = ms->bot; op; op = op->above)	374	for (object *op = ms->bot; op; op = op->above)
442	op->deactivate_recursive ();	375	op->deactivate_recursive ();
443	}	376	}
…		…
453	if (!spaces)	386	if (!spaces)
454	return false;	387	return false;
455		388
456	for (int i = 0; i < size (); ++i)	389	for (int i = 0; i < size (); ++i)
457	{	390	{
458	int unique = 0;	391	bool unique = 0;
		392
459	for (object *op = spaces [i].bot; op; op = op->above)	393	for (object *op = spaces [i].bot; op; op = op->above)
460	{	394	{
461	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	395	unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
462	unique = 1;
463		396
464	if (!op->can_map_save ())	397	if (expect_false (!op->can_map_save ()))
465	continue;	398	continue;
466		399
467	if (unique || op->flag [FLAG_UNIQUE])	400	if (expect_false (unique || op->flag [FLAG_UNIQUE]))
468	{	401	{
469	if (flags & IO_UNIQUES)	402	if (flags & IO_UNIQUES)
470	op->write (f);	403	op->write (f);
471	}	404	}
472	else if (flags & IO_OBJECTS)	405	else if (expect_true (flags & IO_OBJECTS))
473	op->write (f);	406	op->write (f);
474	}	407	}
475	}	408	}
476		409
477	coroapi::cede_to_tick ();	410	coroapi::cede_to_tick ();
478		411
479	return true;	412	return true;
480	}	413	}
481		414
482	bool	415	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	}
503
504	bool
505	maptile::_save_objects (const char *path, int flags)	416	maptile::_save_objects (const char *path, int flags)
506	{	417	{
507	object_freezer freezer;	418	object_freezer freezer;
508		419
509	if (!_save_objects (freezer, flags))	420	if (!_save_objects (freezer, flags))
510	return false;	421	return false;
511		422
512	return freezer.save (path);	423	return freezer.save (path);
513	}	424	}
514		425
515	maptile::maptile ()	426	void
		427	maptile::init ()
516	{	428	{
517	in_memory = MAP_SWAPPED;	429	in_memory = MAP_SWAPPED;
518		430
519	/* The maps used to pick up default x and y values from the	431	/* The maps used to pick up default x and y values from the
520	* map archetype. Mimic that behaviour.	432	* map archetype. Mimic that behaviour.
521	*/	433	*/
522	width = 16;	434	width = 16;
523	height = 16;	435	height = 16;
524	timeout = 300;	436	timeout = 300;
525	max_nrof = 1000; // 1000 items of anything	437	max_items = MAX_ITEM_PER_ACTION;
526	max_volume = 2000000; // 2m³	438	max_volume = 2000000; // 2m³
527	}
528
529	maptile::maptile (int w, int h)
530	{
531	in_memory = MAP_SWAPPED;
532
533	width = w;
534	height = h;
535	reset_timeout = 0;	439	reset_timeout = 0;
536	timeout = 300;
537	enter_x = 0;	440	enter_x = 0;
538	enter_y = 0;	441	enter_y = 0;
		442	}
		443
		444	maptile::maptile ()
		445	{
		446	init ();
		447	}
		448
		449	maptile::maptile (int w, int h)
		450	{
		451	init ();
		452
		453	width = w;
		454	height = h;
539		455
540	alloc ();	456	alloc ();
541	}	457	}
542		458
543	/*	459	/*
…		…
551	if (spaces)	467	if (spaces)
552	return;	468	return;
553		469
554	spaces = salloc0<mapspace> (size ());	470	spaces = salloc0<mapspace> (size ());
555	}	471	}
		472
		473	//+GPL
556		474
557	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	475	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
558	* corresponding to that string. Memory is allocated for this, it must be freed	476	* corresponding to that string. Memory is allocated for this, it must be freed
559	* at a later date.	477	* at a later date.
560	* Called by parse_map_headers below.	478	* Called by parse_map_headers below.
…		…
637	return items;	555	return items;
638	}	556	}
639		557
640	/* opposite of parse string, this puts the string that was originally fed in to	558	/* opposite of parse string, this puts the string that was originally fed in to
641	* the map (or something equivilent) into output_string. */	559	* the map (or something equivilent) into output_string. */
642	static void	560	static const char *
643	print_shop_string (maptile *m, char *output_string)	561	print_shop_string (maptile *m)
644	{	562	{
645	int i;	563	static dynbuf_text buf; buf.clear ();
646	char tmp[MAX_BUF];
647		564
648	strcpy (output_string, "");
649	for (i = 0; i < m->shopitems[0].index; i++)	565	for (int i = 0; i < m->shopitems[0].index; i++)
650	{	566	{
651	if (m->shopitems[i].typenum)	567	if (m->shopitems[i].typenum)
652	{	568	{
653	if (m->shopitems[i].strength)	569	if (m->shopitems[i].strength)
654	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	570	buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
655	else	571	else
656	sprintf (tmp, "%s;", m->shopitems[i].name);	572	buf.printf ("%s;", m->shopitems[i].name);
657	}	573	}
658	else	574	else
659	{	575	{
660	if (m->shopitems[i].strength)	576	if (m->shopitems[i].strength)
661	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	577	buf.printf ("*:%d;", m->shopitems[i].strength);
662	else	578	else
663	sprintf (tmp, "*");	579	buf.printf ("*");
664	}	580	}
665
666	strcat (output_string, tmp);
667	}	581	}
		582
		583	return buf;
668	}	584	}
		585
		586	//-GPL
669		587
670	/* This loads the header information of the map. The header	588	/* This loads the header information of the map. The header
671	* contains things like difficulty, size, timeout, etc.	589	* contains things like difficulty, size, timeout, etc.
672	* this used to be stored in the map object, but with the	590	* this used to be stored in the map object, but with the
673	* addition of tiling, fields beyond that easily named in an	591	* addition of tiling, fields beyond that easily named in an
…		…
681	bool	599	bool
682	maptile::_load_header (object_thawer &thawer)	600	maptile::_load_header (object_thawer &thawer)
683	{	601	{
684	for (;;)	602	for (;;)
685	{	603	{
686	thawer.next ();
687
688	switch (thawer.kw)	604	switch (thawer.kw)
689	{	605	{
690	case KW_msg:	606	case KW_msg:
691	thawer.get_ml (KW_endmsg, msg);	607	thawer.get_ml (KW_endmsg, msg);
692	break;	608	break;
…		…
716	case KW_shopgreed: thawer.get (shopgreed); break;	632	case KW_shopgreed: thawer.get (shopgreed); break;
717	case KW_shopmin: thawer.get (shopmin); break;	633	case KW_shopmin: thawer.get (shopmin); break;
718	case KW_shopmax: thawer.get (shopmax); break;	634	case KW_shopmax: thawer.get (shopmax); break;
719	case KW_shoprace: thawer.get (shoprace); break;	635	case KW_shoprace: thawer.get (shoprace); break;
720	case KW_outdoor: thawer.get (outdoor); break;	636	case KW_outdoor: thawer.get (outdoor); break;
721	case KW_temp: thawer.get (temp); break;
722	case KW_pressure: thawer.get (pressure); break;
723	case KW_humid: thawer.get (humid); break;
724	case KW_windspeed: thawer.get (windspeed); break;
725	case KW_winddir: thawer.get (winddir); break;
726	case KW_sky: thawer.get (sky); break;
727		637
728	case KW_per_player: thawer.get (per_player); break;	638	case KW_per_player: thawer.get (per_player); break;
729	case KW_per_party: thawer.get (per_party); break;	639	case KW_per_party: thawer.get (per_party); break;
730	case KW_no_reset: thawer.get (no_reset); break;	640	case KW_no_reset: thawer.get (no_reset); break;
		641	case KW_no_drop: thawer.get (no_drop); break;
731		642
732	case KW_region: default_region = region::find (thawer.get_str ()); break;	643	case KW_region: default_region = region::find (thawer.get_str ()); break;
733	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	644	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
734		645
735	// old names new names	646	// old names new names
…		…
746	case KW_tile_path_1: thawer.get (tile_path [0]); break;	657	case KW_tile_path_1: thawer.get (tile_path [0]); break;
747	case KW_tile_path_2: thawer.get (tile_path [1]); break;	658	case KW_tile_path_2: thawer.get (tile_path [1]); break;
748	case KW_tile_path_3: thawer.get (tile_path [2]); break;	659	case KW_tile_path_3: thawer.get (tile_path [2]); break;
749	case KW_tile_path_4: thawer.get (tile_path [3]); break;	660	case KW_tile_path_4: thawer.get (tile_path [3]); break;
750		661
		662	case KW_ERROR:
		663	set_key_text (thawer.kw_str, thawer.value);
		664	break;
		665
751	case KW_end:	666	case KW_end:
		667	thawer.next ();
752	return true;	668	return true;
753		669
754	default:	670	default:
755	if (!thawer.parse_error ("map", 0))	671	if (!thawer.parse_error ("map"))
756	return false;	672	return false;
757	break;	673	break;
758	}	674	}
		675
		676	thawer.next ();
759	}	677	}
760		678
761	abort ();	679	abort ();
762	}	680	}
763		681
764	bool	682	//+GPL
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	}
774		683
775	/******************************************************************************	684	/******************************************************************************
776	* This is the start of unique map handling code	685	* This is the start of unique map handling code
777	*****************************************************************************/	686	*****************************************************************************/
778		687
…		…
785	int unique = 0;	694	int unique = 0;
786	for (object *op = spaces [i].bot; op; )	695	for (object *op = spaces [i].bot; op; )
787	{	696	{
788	object *above = op->above;	697	object *above = op->above;
789		698
790	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	699	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
791	unique = 1;	700	unique = 1;
792		701
793	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))	702	if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique))
794	{
795	op->destroy_inv (false);
796	op->destroy ();	703	op->destroy ();
797	}
798		704
799	op = above;	705	op = above;
800	}	706	}
801	}	707	}
802	}	708	}
803		709
		710	//-GPL
		711
804	bool	712	bool
805	maptile::_save_header (object_freezer &freezer)	713	maptile::_save_header (object_freezer &freezer)
806	{	714	{
807	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	715	#define MAP_OUT(k) freezer.put (KW(k), k)
808	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)	716	#define MAP_OUT2(k,v) freezer.put (KW(k), v)
809		717
810	MAP_OUT2 (arch, "map");	718	MAP_OUT2 (arch, CS(map));
811		719
812	if (name) MAP_OUT (name);	720	if (name) MAP_OUT (name);
813	MAP_OUT (swap_time);	721	MAP_OUT (swap_time);
814	MAP_OUT (reset_time);	722	MAP_OUT (reset_time);
815	MAP_OUT (reset_timeout);	723	MAP_OUT (reset_timeout);
816	MAP_OUT (fixed_resettime);	724	MAP_OUT (fixed_resettime);
817	MAP_OUT (no_reset);	725	MAP_OUT (no_reset);
		726	MAP_OUT (no_drop);
818	MAP_OUT (difficulty);	727	MAP_OUT (difficulty);
819
820	if (default_region) MAP_OUT2 (region, default_region->name);	728	if (default_region) MAP_OUT2 (region, default_region->name);
821		729
822	if (shopitems)	730	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
823	{
824	char shop[MAX_BUF];
825	print_shop_string (this, shop);
826	MAP_OUT2 (shopitems, shop);
827	}
828
829	MAP_OUT (shopgreed);	731	MAP_OUT (shopgreed);
830	MAP_OUT (shopmin);	732	MAP_OUT (shopmin);
831	MAP_OUT (shopmax);	733	MAP_OUT (shopmax);
832	if (shoprace) MAP_OUT (shoprace);	734	if (shoprace) MAP_OUT (shoprace);
833	MAP_OUT (darkness);	735
834	MAP_OUT (width);	736	MAP_OUT (width);
835	MAP_OUT (height);	737	MAP_OUT (height);
836	MAP_OUT (enter_x);	738	MAP_OUT (enter_x);
837	MAP_OUT (enter_y);	739	MAP_OUT (enter_y);
838		740	MAP_OUT (darkness);
839	if (msg) freezer.put (KW_msg , KW_endmsg , msg);
840	if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
841
842	MAP_OUT (outdoor);	741	MAP_OUT (outdoor);
843	MAP_OUT (temp);	742
844	MAP_OUT (pressure);	743	if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
845	MAP_OUT (humid);	744	if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
846	MAP_OUT (windspeed);
847	MAP_OUT (winddir);
848	MAP_OUT (sky);
849		745
850	MAP_OUT (per_player);	746	MAP_OUT (per_player);
851	MAP_OUT (per_party);	747	MAP_OUT (per_party);
852		748
853	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);	749	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
854	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);	750	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
855	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);	751	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
856	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);	752	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
857		753
858	freezer.put (this);	754	freezer.put (this);
859	freezer.put (KW_end);	755	freezer.put (KW(end));
860		756
861	return true;	757	return true;
862	}	758	}
863		759
864	bool	760	bool
…		…
870	return false;	766	return false;
871		767
872	return freezer.save (path);	768	return freezer.save (path);
873	}	769	}
874		770
		771	//+GPL
		772
875	/*	773	/*
876	* Remove and free all objects in the given map.	774	* Remove and free all objects in the given map.
877	*/	775	*/
878	void	776	void
879	maptile::clear ()	777	maptile::clear ()
880	{	778	{
881	sfree (regions, size ()), regions = 0;
882	free (regionmap), regionmap = 0;
883
884	if (spaces)	779	if (spaces)
885	{	780	{
886	for (mapspace *ms = spaces + size (); ms-- > spaces; )	781	for (mapspace *ms = spaces + size (); ms-- > spaces; )
887	while (object *op = ms->bot)	782	while (object *op = ms->bot)
888	{	783	{
		784	// manually remove, as to not trigger anything
		785	if (ms->bot = op->above)
		786	ms->bot->below = 0;
		787
		788	op->flag [FLAG_REMOVED] = true;
		789
889	op = op->head_ ();	790	object *head = op->head_ ();
890	op->destroy_inv (false);	791	if (op == head)
891	op->destroy ();	792	op->destroy ();
		793	else if (head->map != op->map)
		794	{
		795	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		796	head->destroy ();
		797	}
892	}	798	}
893		799
894	sfree (spaces, size ()), spaces = 0;	800	sfree0 (spaces, size ());
895	}	801	}
896		802
897	if (buttons)	803	if (buttons)
898	free_objectlinkpt (buttons), buttons = 0;	804	free_objectlinkpt (buttons), buttons = 0;
		805
		806	sfree0 (regions, size ());
		807	delete [] regionmap; regionmap = 0;
899	}	808	}
900		809
901	void	810	void
902	maptile::clear_header ()	811	maptile::clear_header ()
903	{	812	{
…		…
936		845
937	clear ();	846	clear ();
938	}	847	}
939		848
940	/* decay and destroy perishable items in a map */	849	/* decay and destroy perishable items in a map */
		850	// TODO: should be done regularly, not on map load?
941	void	851	void
942	maptile::do_decay_objects ()	852	maptile::do_decay_objects ()
943	{	853	{
944	if (!spaces)	854	if (!spaces)
945	return;	855	return;
…		…
947	for (mapspace *ms = spaces + size (); ms-- > spaces; )	857	for (mapspace *ms = spaces + size (); ms-- > spaces; )
948	for (object *above, *op = ms->bot; op; op = above)	858	for (object *above, *op = ms->bot; op; op = above)
949	{	859	{
950	above = op->above;	860	above = op->above;
951		861
		862	// do not decay anything above unique floor tiles (yet :)
		863	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
		864	break;
		865
952	bool destroy = 0;	866	bool destroy = 0;
953		867
954	// do not decay anything above unique floor tiles (yet :)	868	if (op->flag [FLAG_IS_FLOOR]
955	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	869	|| op->flag [FLAG_OBJ_ORIGINAL]
956	break;	870	|| op->flag [FLAG_UNIQUE]
957		871	|| op->flag [FLAG_OVERLAY_FLOOR]
958	if (QUERY_FLAG (op, FLAG_IS_FLOOR)	872	|| op->flag [FLAG_UNPAID]
959	|| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
960	|| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
961	|| QUERY_FLAG (op, FLAG_UNIQUE)
962	|| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
963	|| QUERY_FLAG (op, FLAG_UNPAID)
964	|| op->is_alive ())	873	|| op->is_alive ())
965	; // do not decay	874	; // do not decay
966	else if (op->is_weapon ())	875	else if (op->is_weapon ())
967	{	876	{
968	op->stats.dam--;	877	op->stats.dam--;
…		…
993	|| mat & M_LIQUID	902	|| mat & M_LIQUID
994	|| (mat & M_IRON && rndm (1, 5) == 1)	903	|| (mat & M_IRON && rndm (1, 5) == 1)
995	|| (mat & M_GLASS && rndm (1, 2) == 1)	904	|| (mat & M_GLASS && rndm (1, 2) == 1)
996	|| ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)	905	|| ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
997	|| ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)	906	|| ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
998	|| (mat & M_ICE && temp > 32))	907	//|| (mat & M_ICE && temp > 32)
		908	)
999	destroy = 1;	909	destroy = 1;
1000	}	910	}
1001		911
1002	/* adjust overall chance below */	912	/* adjust overall chance below */
1003	if (destroy && rndm (0, 1))	913	if (destroy && rndm (0, 1))
1004	op->destroy ();	914	op->destroy ();
1005	}
1006	}
1007
1008	/*
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	}	915	}
1030	}	916	}
1031		917
1032	/*	918	/*
1033	* This routine is supposed to find out the difficulty of the map.	919	* This routine is supposed to find out the difficulty of the map.
1034	* difficulty does not have a lot to do with character level,	920	* difficulty does not have a lot to do with character level,
1035	* but does have a lot to do with treasure on the map.	921	* but does have a lot to do with treasure on the map.
1036	*	922	*
1037	* Difficulty can now be set by the map creature. If the value stored	923	* 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	924	* in the map is zero, then use this routine. Maps should really
1039	* have a difficulty set than using this function - human calculation	925	* have a difficulty set rather than using this function - human calculation
1040	* is much better than this functions guesswork.	926	* is much better than this function's guesswork.
1041	*/	927	*/
1042	int	928	int
1043	maptile::estimate_difficulty () const	929	maptile::estimate_difficulty () const
1044	{	930	{
1045	long monster_cnt = 0;	931	long monster_cnt = 0;
…		…
1047	sint64 total_exp = 0;	933	sint64 total_exp = 0;
1048		934
1049	for (mapspace *ms = spaces + size (); ms-- > spaces; )	935	for (mapspace *ms = spaces + size (); ms-- > spaces; )
1050	for (object *op = ms->bot; op; op = op->above)	936	for (object *op = ms->bot; op; op = op->above)
1051	{	937	{
1052	if (QUERY_FLAG (op, FLAG_MONSTER))	938	if (op->flag [FLAG_MONSTER])
1053	{	939	{
1054	total_exp += op->stats.exp;	940	total_exp += op->stats.exp;
1055	monster_cnt++;	941	monster_cnt++;
1056	}	942	}
1057		943
1058	if (QUERY_FLAG (op, FLAG_GENERATOR))	944	if (op->flag [FLAG_GENERATOR])
1059	{	945	{
1060	total_exp += op->stats.exp;	946	total_exp += op->stats.exp;
1061		947
1062	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	948	if (archetype *at = op->other_arch)
		949	{
1063	total_exp += at->stats.exp * 8;	950	total_exp += at->stats.exp * 8;
1064
1065	monster_cnt++;	951	monster_cnt++;
		952	}
		953
		954	for (object *inv = op->inv; inv; inv = inv->below)
		955	{
		956	total_exp += op->stats.exp * 8;
		957	monster_cnt++;
		958	}
1066	}	959	}
1067	}	960	}
1068		961
1069	avgexp = (double) total_exp / monster_cnt;	962	avgexp = (double) total_exp / monster_cnt;
1070		963
…		…
1083	* postive values make it darker, negative make it brighter	976	* postive values make it darker, negative make it brighter
1084	*/	977	*/
1085	int	978	int
1086	maptile::change_map_light (int change)	979	maptile::change_map_light (int change)
1087	{	980	{
1088	int new_level = darkness + change;
1089
1090	/* Nothing to do */	981	/* Nothing to do */
1091	if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	982	if (!change)
1092	return 0;	983	return 0;
1093		984
1094	/* inform all players on the map */	985	/* inform all players on the map */
1095	if (change > 0)	986	if (change > 0)
1096	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");	987	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1097	else	988	else
1098	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");	989	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1099		990
1100	/* Do extra checking. since darkness is a unsigned value,	991	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		992
1112	/* All clients need to get re-updated for the change */	993	/* All clients need to get re-updated for the change */
1113	update_all_map_los (this);	994	update_all_map_los (this);
		995
1114	return 1;	996	return 1;
1115	}	997	}
1116		998
1117	/*	999	/*
1118	* This function updates various attributes about a specific space	1000	* This function updates various attributes about a specific space
…		…
1121	* through, etc)	1003	* through, etc)
1122	*/	1004	*/
1123	void	1005	void
1124	mapspace::update_ ()	1006	mapspace::update_ ()
1125	{	1007	{
1126	object *tmp, *last = 0;	1008	object *last = 0;
1127	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1009	uint8 flags = P_UPTODATE;
		1010	sint8 light = 0;
1128	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1011	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
		1012	uint64_t volume = 0;
		1013	uint32_t items = 0;
		1014	object *anywhere = 0;
		1015	uint8_t middle_visibility = 0;
1129		1016
1130	//object *middle = 0;	1017	//object *middle = 0;
1131	//object *top = 0;	1018	//object *top = 0;
1132	//object *floor = 0;	1019	//object *floor = 0;
1133	// this seems to generate better code than using locals, above	1020	// this seems to generate better code than using locals, above
1134	object *&top = faces_obj[0] = 0;	1021	object *&top = faces_obj[0] = 0;
1135	object *&middle = faces_obj[1] = 0;	1022	object *&middle = faces_obj[1] = 0;
1136	object *&floor = faces_obj[2] = 0;	1023	object *&floor = faces_obj[2] = 0;
1137		1024
		1025	object::flags_t allflags; // all flags of all objects or'ed together
		1026
1138	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1027	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1139	{	1028	{
1140	/* This could be made additive I guess (two lights better than	1029	// 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;	1030	light += tmp->glow_radius;
1147		1031
1148	/* This call is needed in order to update objects the player	1032	/* This call is needed in order to update objects the player
1149	* is standing in that have animations (ie, grass, fire, etc).	1033	* is standing in that have animations (ie, grass, fire, etc).
1150	* However, it also causes the look window to be re-drawn	1034	* However, it also causes the look window to be re-drawn
1151	* 3 times each time the player moves, because many of the	1035	* 3 times each time the player moves, because many of the
1152	* functions the move_player calls eventualy call this.	1036	* functions the move_player calls eventualy call this.
1153	*	1037	*
1154	* Always put the player down for drawing.	1038	* Always put the player down for drawing.
1155	*/	1039	*/
1156	if (!tmp->invisible)	1040	if (expect_true (!tmp->invisible))
1157	{	1041	{
1158	if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))	1042	if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]))
1159	top = tmp;	1043	top = tmp;
1160	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1044	else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1161	{	1045	{
1162	/* If we got a floor, that means middle and top were below it,	1046	/* If we got a floor, that means middle and top were below it,
1163	* so should not be visible, so we clear them.	1047	* so should not be visible, so we clear them.
1164	*/	1048	*/
1165	middle = 0;	1049	middle = 0;
1166	top = 0;	1050	top = 0;
1167	floor = tmp;	1051	floor = tmp;
		1052	volume = 0;
		1053	items = 0;
1168	}	1054	}
1169	/* Flag anywhere have high priority */	1055	else
1170	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1171	{	1056	{
		1057	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1058	{
		1059	++items;
		1060	volume += tmp->volume ();
		1061	}
		1062
		1063	/* Flag anywhere have high priority */
		1064	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
		1065	anywhere = tmp;
		1066
		1067	/* Find the highest visible face around. If equal
		1068	* visibilities, we still want the one nearer to the
		1069	* top
		1070	*/
		1071	if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
		1072	{
		1073	middle_visibility = ::faces [tmp->face].visibility;
1172	middle = tmp;	1074	middle = tmp;
1173	anywhere = 1;	1075	}
1174	}	1076	}
1175	/* Find the highest visible face around. If equal
1176	* visibilities, we still want the one nearer to the
1177	* top
1178	*/
1179	else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1180	middle = tmp;
1181	}
1182
1183	if (tmp == tmp->above)
1184	{
1185	LOG (llevError, "Error in structure of map\n");
1186	exit (-1);
1187	}	1077	}
1188		1078
1189	move_slow |= tmp->move_slow;	1079	move_slow |= tmp->move_slow;
1190	move_block |= tmp->move_block;	1080	move_block |= tmp->move_block;
1191	move_on |= tmp->move_on;	1081	move_on |= tmp->move_on;
1192	move_off |= tmp->move_off;	1082	move_off |= tmp->move_off;
1193	move_allow |= tmp->move_allow;	1083	move_allow |= tmp->move_allow;
1194		1084
1195	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW;	1085	allflags |= tmp->flag;
1196	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC;	1086
1197	if (tmp->type == PLAYER) flags |= P_PLAYER;	1087	if (tmp->type == PLAYER) flags |= P_PLAYER;
1198	if (tmp->type == SAFE_GROUND) flags |= P_SAFE;	1088	if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1199	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1200	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1201	}	1089	}
1202		1090
1203	this->light = light;	1091	// FLAG_SEE_ANYWHERE takes precedence
		1092	if (anywhere)
		1093	middle = anywhere;
		1094
		1095	// ORing all flags together and checking them here is much faster
		1096	if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
		1097	if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC;
		1098	if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE;
		1099	if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC;
		1100
		1101	this->light = min (light, MAX_LIGHT_RADIUS);
1204	this->flags_ = flags;	1102	this->flags_ = flags;
1205	this->move_block = move_block & ~move_allow;	1103	this->move_block = move_block & ~move_allow;
1206	this->move_on = move_on;	1104	this->move_on = move_on;
1207	this->move_off = move_off;	1105	this->move_off = move_off;
1208	this->move_slow = move_slow;	1106	this->move_slow = move_slow;
		1107	this->volume_ = (volume + 1023) / 1024;
		1108	this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1209		1109
1210	/* At this point, we have a floor face (if there is a floor),	1110	/* At this point, we have a floor face (if there is a floor),
1211	* and the floor is set - we are not going to touch it at	1111	* and the floor is set - we are not going to touch it at
1212	* this point.	1112	* this point.
1213	* middle contains the highest visibility face.	1113	* middle contains the highest visibility face.
…		…
1228	* 1) top face is set, need middle to be set.	1128	* 1) top face is set, need middle to be set.
1229	* 2) middle is set, need to set top.	1129	* 2) middle is set, need to set top.
1230	* 3) neither middle or top is set - need to set both.	1130	* 3) neither middle or top is set - need to set both.
1231	*/	1131	*/
1232		1132
1233	for (tmp = last; tmp; tmp = tmp->below)	1133	for (object *tmp = last; tmp; tmp = tmp->below)
1234	{	1134	{
1235	/* Once we get to a floor, stop, since we already have a floor object */	1135	/* Once we get to a floor, stop, since we already have a floor object */
1236	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1136	if (tmp->flag [FLAG_IS_FLOOR])
1237	break;	1137	break;
1238		1138
1239	/* If two top faces are already set, quit processing */	1139	/* If two top faces are already set, quit processing */
1240	if (top && middle)	1140	if (top && middle)
1241	break;	1141	break;
…		…
1279	faces_obj [1] = middle;	1179	faces_obj [1] = middle;
1280	faces_obj [2] = floor;	1180	faces_obj [2] = floor;
1281	#endif	1181	#endif
1282	}	1182	}
1283		1183
1284	uint64	1184	maptile *
1285	mapspace::volume () const	1185	maptile::tile_available (int dir, bool load)
1286	{	1186	{
1287	uint64 vol = 0;	1187	if (tile_path[dir])
1288
1289	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1290	vol += op->volume ();
1291
1292	return vol;
1293	}
1294
1295	/* this updates the orig_map->tile_map[tile_num] value after finding
1296	* the map. It also takes care of linking back the freshly found
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	{
1303	maptile *mp = orig_map->tile_map [tile_num];
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	}	1188	{
		1189	if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
		1190	return tile_map[dir];
1319		1191
1320	int dest_tile = (tile_num + 2) % 4;	1192	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1193	return tile_map[dir];
		1194	}
1321		1195
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;	1196	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	}	1197	}
1337		1198
1338	/* this returns TRUE if the coordinates (x,y) are out of	1199	/* this returns TRUE if the coordinates (x,y) are out of
1339	* map m. This function also takes into account any	1200	* map m. This function also takes into account any
1340	* tiling considerations, loading adjacant maps as needed.	1201	* tiling considerations, loading adjacant maps as needed.
…		…
1353	if (!m)	1214	if (!m)
1354	return 0;	1215	return 0;
1355		1216
1356	if (x < 0)	1217	if (x < 0)
1357	{	1218	{
1358	if (!m->tile_path[3])	1219	if (!m->tile_available (3))
1359	return 1;	1220	return 1;
1360		1221
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);	1222	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1365	}	1223	}
1366		1224
1367	if (x >= m->width)	1225	if (x >= m->width)
1368	{	1226	{
1369	if (!m->tile_path[1])	1227	if (!m->tile_available (1))
1370	return 1;	1228	return 1;
1371		1229
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);	1230	return out_of_map (m->tile_map[1], x - m->width, y);
1376	}	1231	}
1377		1232
1378	if (y < 0)	1233	if (y < 0)
1379	{	1234	{
1380	if (!m->tile_path[0])	1235	if (!m->tile_available (0))
1381	return 1;	1236	return 1;
1382		1237
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);	1238	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1387	}	1239	}
1388		1240
1389	if (y >= m->height)	1241	if (y >= m->height)
1390	{	1242	{
1391	if (!m->tile_path[2])	1243	if (!m->tile_available (2))
1392	return 1;	1244	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		1245
1397	return out_of_map (m->tile_map[2], x, y - m->height);	1246	return out_of_map (m->tile_map[2], x, y - m->height);
1398	}	1247	}
1399		1248
1400	/* Simple case - coordinates are within this local	1249	/* Simple case - coordinates are within this local
…		…
1414	maptile *	1263	maptile *
1415	maptile::xy_find (sint16 &x, sint16 &y)	1264	maptile::xy_find (sint16 &x, sint16 &y)
1416	{	1265	{
1417	if (x < 0)	1266	if (x < 0)
1418	{	1267	{
1419	if (!tile_path[3])	1268	if (!tile_available (3))
1420	return 0;	1269	return 0;
1421		1270
1422	find_and_link (this, 3);
1423	x += tile_map[3]->width;	1271	x += tile_map[3]->width;
1424	return tile_map[3]->xy_find (x, y);	1272	return tile_map[3]->xy_find (x, y);
1425	}	1273	}
1426		1274
1427	if (x >= width)	1275	if (x >= width)
1428	{	1276	{
1429	if (!tile_path[1])	1277	if (!tile_available (1))
1430	return 0;	1278	return 0;
1431		1279
1432	find_and_link (this, 1);
1433	x -= width;	1280	x -= width;
1434	return tile_map[1]->xy_find (x, y);	1281	return tile_map[1]->xy_find (x, y);
1435	}	1282	}
1436		1283
1437	if (y < 0)	1284	if (y < 0)
1438	{	1285	{
1439	if (!tile_path[0])	1286	if (!tile_available (0))
1440	return 0;	1287	return 0;
1441		1288
1442	find_and_link (this, 0);
1443	y += tile_map[0]->height;	1289	y += tile_map[0]->height;
1444	return tile_map[0]->xy_find (x, y);	1290	return tile_map[0]->xy_find (x, y);
1445	}	1291	}
1446		1292
1447	if (y >= height)	1293	if (y >= height)
1448	{	1294	{
1449	if (!tile_path[2])	1295	if (!tile_available (2))
1450	return 0;	1296	return 0;
1451		1297
1452	find_and_link (this, 2);
1453	y -= height;	1298	y -= height;
1454	return tile_map[2]->xy_find (x, y);	1299	return tile_map[2]->xy_find (x, y);
1455	}	1300	}
1456		1301
1457	/* Simple case - coordinates are within this local	1302	/* Simple case - coordinates are within this local
…		…
1468	adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)	1313	adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1469	{	1314	{
1470	if (!map1 || !map2)	1315	if (!map1 || !map2)
1471	return 0;	1316	return 0;
1472		1317
1473	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1318	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1474	//fix: compare paths instead (this is likely faster, too!)	1319	//fix: compare paths instead (this is likely faster, too!)
1475	if (map1 == map2)	1320	if (map1 == map2)
1476	{	1321	{
1477	*dx = 0;	1322	*dx = 0;
1478	*dy = 0;	1323	*dy = 0;
…		…
1579	*	1424	*
1580	* currently, the only flag supported (0x1) is don't translate for	1425	* currently, the only flag supported (0x1) is don't translate for
1581	* closest body part of 'op1'	1426	* closest body part of 'op1'
1582	*/	1427	*/
1583	void	1428	void
1584	get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)	1429	get_rangevector (object *op1, object *op2, rv_vector *retval, int flags)
1585	{	1430	{
1586	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1431	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1587	{	1432	{
1588	/* be conservative and fill in _some_ data */	1433	/* be conservative and fill in _some_ data */
1589	retval->distance = 10000;	1434	retval->distance = 10000;
1590	retval->distance_x = 10000;	1435	retval->distance_x = 10000;
1591	retval->distance_y = 10000;	1436	retval->distance_y = 10000;
1592	retval->direction = 0;	1437	retval->direction = 0;
1593	retval->part = 0;	1438	retval->part = 0;
1594	}	1439	}
1595	else	1440	else
1596	{	1441	{
1597	object *best;
1598
1599	retval->distance_x += op2->x - op1->x;	1442	retval->distance_x += op2->x - op1->x;
1600	retval->distance_y += op2->y - op1->y;	1443	retval->distance_y += op2->y - op1->y;
1601		1444
1602	best = op1;	1445	object *best = op1;
		1446
1603	/* If this is multipart, find the closest part now */	1447	/* If this is multipart, find the closest part now */
1604	if (!(flags & 0x1) && op1->more)	1448	if (!(flags & 1) && op1->more)
1605	{	1449	{
1606	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;	1450	int best_distance = idistance (retval->distance_x, retval->distance_y);
1607		1451
1608	/* we just take the offset of the piece to head to figure	1452	/* we just take the offset of the piece to head to figure
1609	* distance instead of doing all that work above again	1453	* distance instead of doing all that work above again
1610	* since the distance fields we set above are positive in the	1454	* since the distance fields we set above are positive in the
1611	* same axis as is used for multipart objects, the simply arithmetic	1455	* same axis as is used for multipart objects, the simply arithmetic
1612	* below works.	1456	* below works.
1613	*/	1457	*/
1614	for (object *tmp = op1->more; tmp; tmp = tmp->more)	1458	for (object *tmp = op1->more; tmp; tmp = tmp->more)
1615	{	1459	{
1616	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +	1460	int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
1617	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1461
1618	if (tmpi < best_distance)	1462	if (tmpi < best_distance)
1619	{	1463	{
1620	best_distance = tmpi;	1464	best_distance = tmpi;
1621	best = tmp;	1465	best = tmp;
1622	}	1466	}
1623	}	1467	}
1624		1468
1625	if (best != op1)	1469	if (best != op1)
1626	{	1470	{
1627	retval->distance_x += op1->x - best->x;	1471	retval->distance_x += op1->x - best->x;
1628	retval->distance_y += op1->y - best->y;	1472	retval->distance_y += op1->y - best->y;
1629	}	1473	}
1630	}	1474	}
1631		1475
1632	retval->part = best;	1476	retval->part = best;
1633	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));	1477	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1634	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1478	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1635	}	1479	}
1636	}	1480	}
1637		1481
1638	/* this is basically the same as get_rangevector above, but instead of	1482	/* this is basically the same as get_rangevector above, but instead of
1639	* the first parameter being an object, it instead is the map	1483	* the first parameter being an object, it instead is the map
…		…
1649	get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)	1493	get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1650	{	1494	{
1651	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))	1495	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1652	{	1496	{
1653	/* be conservative and fill in _some_ data */	1497	/* be conservative and fill in _some_ data */
1654	retval->distance = 100000;	1498	retval->distance = 100000;
1655	retval->distance_x = 32767;	1499	retval->distance_x = 32767;
1656	retval->distance_y = 32767;	1500	retval->distance_y = 32767;
1657	retval->direction = 0;	1501	retval->direction = 0;
1658	retval->part = 0;	1502	retval->part = 0;
1659	}	1503	}
1660	else	1504	else
1661	{	1505	{
1662	retval->distance_x += op2->x - x;	1506	retval->distance_x += op2->x - x;
1663	retval->distance_y += op2->y - y;	1507	retval->distance_y += op2->y - y;
1664		1508
1665	retval->part = NULL;	1509	retval->part = 0;
1666	retval->distance = idistance (retval->distance_x, retval->distance_y);	1510	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1667	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1511	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1668	}	1512	}
1669	}	1513	}
1670		1514
1671	/* Returns true of op1 and op2 are effectively on the same map	1515	/* Returns true of op1 and op2 are effectively on the same map
1672	* (as related to map tiling). Note that this looks for a path from	1516	* (as related to map tiling). Note that this looks for a path from
…		…
1682	int dx, dy;	1526	int dx, dy;
1683		1527
1684	return adjacent_map (op1->map, op2->map, &dx, &dy);	1528	return adjacent_map (op1->map, op2->map, &dx, &dy);
1685	}	1529	}
1686		1530
		1531	//-GPL
		1532
1687	object *	1533	object *
1688	maptile::insert (object *op, int x, int y, object *originator, int flags)	1534	maptile::insert (object *op, int x, int y, object *originator, int flags)
1689	{	1535	{
1690	if (!op->flag [FLAG_REMOVED])
1691	op->remove ();
1692
1693	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1536	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1694	}	1537	}
1695		1538
1696	region *	1539	region *
1697	maptile::region (int x, int y) const	1540	maptile::region (int x, int y) const
…		…
1706	return default_region;	1549	return default_region;
1707		1550
1708	return ::region::default_region ();	1551	return ::region::default_region ();
1709	}	1552	}
1710		1553
		1554	//+GPL
		1555
1711	/* picks a random object from a style map.	1556	/* 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	*/	1557	*/
1715	object *	1558	object *
1716	maptile::pick_random_object () const	1559	maptile::pick_random_object (rand_gen &gen) const
1717	{	1560	{
1718	/* while returning a null object will result in a crash, that	1561	/* while returning a null object will result in a crash, that
1719	* is actually preferable to an infinite loop. That is because	1562	* is actually preferable to an infinite loop. That is because
1720	* most servers will automatically restart in case of crash.	1563	* most servers will automatically restart in case of crash.
1721	* Change the logic on getting the random space - shouldn't make	1564	* Change the logic on getting the random space - shouldn't make
1722	* any difference, but this seems clearer to me.	1565	* any difference, but this seems clearer to me.
1723	*/	1566	*/
1724	for (int i = 1000; --i;)	1567	for (int i = 1000; --i;)
1725	{	1568	{
1726	object *pick = at (rndm (width), rndm (height)).bot;	1569	object *pick = at (gen (width), gen (height)).bot;
1727		1570
1728	// do not prefer big monsters just because they are big.	1571	// must be head: do not prefer big monsters just because they are big.
1729	if (pick && pick->head_ () == pick)	1572	if (pick && pick->is_head ())
1730	return pick->head_ ();	1573	return pick;
1731	}	1574	}
1732		1575
1733	// instead of crashing in the unlikely(?) case, try to return *something*	1576	// instead of crashing in the unlikely(?) case, try to return *something*
1734	return get_archetype ("blocked");	1577	return archetype::find (shstr_bug);
1735	}	1578	}
1736		1579
		1580	//-GPL
		1581
		1582	void
		1583	maptile::play_sound (faceidx sound, int x, int y) const
		1584	{
		1585	if (!sound)
		1586	return;
		1587
		1588	for_all_players_on_map (pl, this)
		1589	if (client *ns = pl->ns)
		1590	{
		1591	int dx = x - pl->ob->x;
		1592	int dy = y - pl->ob->y;
		1593
		1594	int distance = idistance (dx, dy);
		1595
		1596	if (distance <= MAX_SOUND_DISTANCE)
		1597	ns->play_sound (sound, dx, dy);
		1598	}
		1599	}
		1600
		1601	void
		1602	maptile::say_msg (const char *msg, int x, int y) const
		1603	{
		1604	for_all_players (pl)
		1605	if (client *ns = pl->ns)
		1606	{
		1607	int dx = x - pl->ob->x;
		1608	int dy = y - pl->ob->y;
		1609
		1610	int distance = idistance (dx, dy);
		1611
		1612	if (distance <= MAX_SOUND_DISTANCE)
		1613	ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
		1614	}
		1615	}
		1616
		1617	dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
		1618
		1619	static void
		1620	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1621	{
		1622	// clip to map to the left
		1623	if (x0 < 0)
		1624	{
		1625	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1626	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1627
		1628	if (x1 < 0) // entirely to the left
		1629	return;
		1630
		1631	x0 = 0;
		1632	}
		1633
		1634	// clip to map to the right
		1635	if (x1 > m->width)
		1636	{
		1637	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1638	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1639
		1640	if (x0 > m->width) // entirely to the right
		1641	return;
		1642
		1643	x1 = m->width;
		1644	}
		1645
		1646	// clip to map above
		1647	if (y0 < 0)
		1648	{
		1649	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1650	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1651
		1652	if (y1 < 0) // entirely above
		1653	return;
		1654
		1655	y0 = 0;
		1656	}
		1657
		1658	// clip to map below
		1659	if (y1 > m->height)
		1660	{
		1661	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1662	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1663
		1664	if (y0 > m->height) // entirely below
		1665	return;
		1666
		1667	y1 = m->height;
		1668	}
		1669
		1670	// if we get here, the rect is within the current map
		1671	maprect *r = (maprect *)buf.alloc (sizeof (maprect));
		1672
		1673	r->m = m;
		1674	r->x0 = x0;
		1675	r->y0 = y0;
		1676	r->x1 = x1;
		1677	r->y1 = y1;
		1678	r->dx = dx;
		1679	r->dy = dy;
		1680	}
		1681
		1682	maprect *
		1683	maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
		1684	{
		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