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.117 by root, Fri Aug 24 00:26:09 2007 UTC vs.
Revision 1.208 by root, Sat May 7 10:50:35 2011 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,2011 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"
		29
		30	//+GPL
		31
		32	sint8 maptile::outdoor_darkness;
32		33
33	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	34	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
34	* one function that just returns a P_.. value (see map.h)	35	* one function that just returns a P_.. value (see map.h)
35	* it will also do map translation for tiled maps, returning	36	* it will also do map translation for tiled maps, returning
36	* 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
…		…
71	* by the caller.	72	* by the caller.
72	*/	73	*/
73	int	74	int
74	blocked_link (object *ob, maptile *m, int sx, int sy)	75	blocked_link (object *ob, maptile *m, int sx, int sy)
75	{	76	{
76	object *tmp;
77	int mflags, blocked;
78
79	/* 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
80	* have already checked this.	78	* have already checked this.
81	*/	79	*/
82	if (OUT_OF_REAL_MAP (m, sx, sy))	80	if (OUT_OF_REAL_MAP (m, sx, sy))
83	{	81	{
84	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");
85	return 1;	83	return 1;
86	}	84	}
87		85
88	/* Save some cycles - instead of calling get_map_flags(), just get the value	86	mapspace &ms = m->at (sx, sy);
89	* directly.
90	*/
91	mflags = m->at (sx, sy).flags ();
92		87
93	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);	88	int mflags = ms.flags ();
		89	int blocked = ms.move_block;
94		90
95	/* If space is currently not blocked by anything, no need to	91	/* If space is currently not blocked by anything, no need to
96	* go further. Not true for players - all sorts of special	92	* go further. Not true for players - all sorts of special
97	* things we need to do for players.	93	* things we need to do for players.
98	*/	94	*/
99	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	95	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
100	return 0;	96	return 0;
101		97
102	/* 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
103	* 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
104	* 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
105	* or another. Likewise, only if something is blocking us do we	101	* or another. Likewise, only if something is blocking us do we
106	* need to investigate if there is a special circumstance that would	102	* need to investigate if there is a special circumstance that would
107	* let the player through (inventory checkers for example)	103	* let the player through (inventory checkers for example)
…		…
114	/* 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
115	* 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
116	* true. If we get through the entire stack, that must mean	112	* true. If we get through the entire stack, that must mean
117	* ob is blocking it, so return 0.	113	* ob is blocking it, so return 0.
118	*/	114	*/
119	for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)	115	for (object *tmp = ms.top; tmp; tmp = tmp->below)
120	{	116	{
121		117	if (OB_MOVE_BLOCK (ob, tmp))
122	/* This must be before the checks below. Code for inventory checkers. */
123	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
124	{	118	{
125	/* If last_sp is set, the player/monster needs an object,	119	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
126	* so we check for it. If they don't have it, they can't	120	if (RESULT_INT (0))
127	* pass through this space.	121	return 1;
128	*/	122	else
129	if (tmp->last_sp)	123	continue;
		124
		125	if (tmp->type == CHECK_INV)
130	{	126	{
131	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))
132	return 1;	131	return 1;
133	else	132	}
134	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;
135	}	142	}
136	else	143	else
137	{	144	return 1; // unconditional block
138	/* In this case, the player must not have the object -	145
139	* if they do, they can't pass through.
140	*/
141	if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
142	return 1;
143	else
144	continue;
145	}
146	} /* if check_inv */
147	else	146	} else {
148	{	147	// space does not block the ob, directly, but
149	/* Broke apart a big nasty if into several here to make	148	// anything alive that is not a door still
150	* this more readable. first check - if the space blocks	149	// blocks anything
151	* movement, can't move here.
152	* second - if a monster, can't move there, unless it is a
153	* hidden dm
154	*/
155	if (OB_MOVE_BLOCK (ob, tmp))
156	return 1;
157		150
158	if (tmp->flag [FLAG_ALIVE]	151	if (tmp->flag [FLAG_ALIVE]
159	&& tmp->head_ () != ob
160	&& tmp != ob
161	&& tmp->type != DOOR	152	&& tmp->type != DOOR
162	&& !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))	153	&& tmp->head_ () != ob) //TODO: maybe move these check up?
163	return 1;	154	return 1;
164	}	155	}
165
166	}	156	}
		157
167	return 0;	158	return 0;
168	}	159	}
169		160
170	/*	161	/*
171	* 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
172	* This is meant for multi space objects - for single space objecs,	163	* spot. This is meant for multi space objects - for single space objecs,
173	* just calling get_map_blocked and checking that against movement type	164	* just calling get_map_blocked and checking that against movement type
174	* of object. This function goes through all the parts of the	165	* of object. This function goes through all the parts of the multipart
175	* multipart object and makes sure they can be inserted.	166	* object and makes sure they can be inserted.
176	*	167	*
177	* 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.
178	*	169	*
179	* This function has been used to deprecate arch_out_of_map -	170	* This function has been used to deprecate arch_out_of_map -
180	* this function also does that check, and since in most cases,	171	* this function also does that check, and since in most cases,
…		…
191	*	182	*
192	* Note this used to be arch_blocked, but with new movement	183	* Note this used to be arch_blocked, but with new movement
193	* 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
194	* against the move_block values.	185	* against the move_block values.
195	*/	186	*/
196	int	187	bool
197	ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y)	188	object::blocked (maptile *m, int x, int y) const
198	{	189	{
199	archetype *tmp;	190	for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
200	int flag;
201	maptile *m1;
202	sint16 sx, sy;
203
204	if (!ob)
205	{
206	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
207	if (flag & P_OUT_OF_MAP)
208	return P_OUT_OF_MAP;
209
210	/* don't have object, so don't know what types would block */
211	return m1->at (sx, sy).move_block;
212	}	191	{
		192	mapxy pos (m, x + tmp->x, y + tmp->y);
213		193
214	for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more)	194	if (!pos.normalise ())
215	{	195	return 1;
216	flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
217		196
218	if (flag & P_OUT_OF_MAP)	197	mapspace &ms = *pos;
219	return P_OUT_OF_MAP;	198
220	if (flag & P_IS_ALIVE)	199	if (ms.flags () & P_IS_ALIVE)
221	return P_IS_ALIVE;	200	return 1;
222		201
223	mapspace &ms = m1->at (sx, sy);	202	/* However, often ob doesn't have any move type
224		203	* (signifying non-moving objects)
225	/* find_first_free_spot() calls this function. However, often
226	* ob doesn't have any move type (when used to place exits)
227	* 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.
228	*/	205	*/
229
230	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	206	if (!move_type && ms.move_block != MOVE_ALL)
231	continue;	207	continue;
232		208
233	/* 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
234	* head of the object should correspond for the entire object.	210	* head of the object should correspond for the entire object.
235	*/	211	*/
236	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	212	if (ms.blocks (move_type))
237	return P_NO_PASS;	213	return 1;
238	}	214	}
239		215
240	return 0;	216	return 0;
241	}	217	}
242		218
243	/* When the map is loaded, load_object does not actually insert objects	219	//-GPL
244	* into inventory, but just links them. What this does is go through
245	* and insert them properly.
246	* The object 'container' is the object that contains the inventory.
247	* This is needed so that we can update the containers weight.
248	*/
249	void
250	fix_container (object *container)
251	{
252	object *tmp = container->inv, *next;
253
254	container->inv = 0;
255	while (tmp)
256	{
257	next = tmp->below;
258	if (tmp->inv)
259	fix_container (tmp);
260
261	insert_ob_in_ob (tmp, container);
262	tmp = next;
263	}
264
265	/* sum_weight will go through and calculate what all the containers are
266	* carrying.
267	*/
268	sum_weight (container);
269	}
270		220
271	void	221	void
272	maptile::set_object_flag (int flag, int value)	222	maptile::set_object_flag (int flag, int value)
273	{	223	{
274	if (!spaces)	224	if (!spaces)
…		…
276		226
277	for (mapspace *ms = spaces + size (); ms-- > spaces; )	227	for (mapspace *ms = spaces + size (); ms-- > spaces; )
278	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	228	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
279	tmp->flag [flag] = value;	229	tmp->flag [flag] = value;
280	}	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
281		259
282	/* 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
283	* 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
284	* 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
285	* they are saved).	263	* they are saved).
…		…
313	op = op->above;	291	op = op->above;
314	}	292	}
315	}	293	}
316	}	294	}
317		295
		296	//-GPL
		297
318	/*	298	/*
319	* 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
320	* file pointer.	300	* file pointer.
321	*/	301	*/
322	bool	302	bool
323	maptile::_load_objects (object_thawer &f)	303	maptile::_load_objects (object_thawer &f)
324	{	304	{
325	for (;;)	305	for (;;)
326	{	306	{
327	coroapi::cede_to_tick_every (100); // cede once in a while	307	coroapi::cede_to_tick (); // cede once in a while
328		308
329	switch (f.kw)	309	switch (f.kw)
330	{	310	{
331	case KW_arch:	311	case KW_arch:
332	if (object *op = object::read (f, this))	312	if (object *op = object::read (f, this))
333	{	313	{
		314	// TODO: why?
334	if (op->inv)	315	if (op->inv)
		316	{
		317	op->carrying = 0;
335	sum_weight (op);	318	op->update_weight ();
		319	}
336		320
337	insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);	321	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
		322	{
		323	// we insert manually because
		324	// a) its way faster
		325	// b) we remove manually, too, and there are good reasons for that
		326	// c) it's correct
		327	mapspace &ms = at (op->x, op->y);
		328
		329	op->flag [FLAG_REMOVED] = false;
		330
		331	op->above = 0;
		332	op->below = ms.top;
		333
		334	*(ms.top ? &ms.top->above : &ms.bot) = op;
		335
		336	ms.top = op;
		337	ms.flags_ = 0;
		338	}
		339	else
		340	{
		341	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		342	op->destroy ();
		343	}
338	}	344	}
339		345
340	continue;	346	continue;
341		347
342	case KW_EOF:	348	case KW_EOF:
…		…
355	}	361	}
356		362
357	void	363	void
358	maptile::activate ()	364	maptile::activate ()
359	{	365	{
360	if (spaces)	366	if (state != MAP_INACTIVE)
		367	return;
		368
361	for (mapspace *ms = spaces + size (); ms-- > spaces; )	369	for (mapspace *ms = spaces + size (); ms-- > spaces; )
362	for (object *op = ms->bot; op; op = op->above)	370	for (object *op = ms->bot; op; op = op->above)
363	op->activate_recursive ();	371	op->activate_recursive ();
		372
		373	state = MAP_ACTIVE;
		374
		375	activate_physics ();
364	}	376	}
365		377
366	void	378	void
367	maptile::deactivate ()	379	maptile::deactivate ()
368	{	380	{
369	if (spaces)	381	if (state != MAP_ACTIVE)
		382	return;
		383
370	for (mapspace *ms = spaces + size (); ms-- > spaces; )	384	for (mapspace *ms = spaces + size (); ms-- > spaces; )
371	for (object *op = ms->bot; op; op = op->above)	385	for (object *op = ms->bot; op; op = op->above)
372	op->deactivate_recursive ();	386	op->deactivate_recursive ();
		387
		388	state = MAP_INACTIVE;
373	}	389	}
374		390
375	bool	391	bool
376	maptile::_save_objects (object_freezer &f, int flags)	392	maptile::_save_objects (object_freezer &f, int flags)
377	{	393	{
…		…
383	if (!spaces)	399	if (!spaces)
384	return false;	400	return false;
385		401
386	for (int i = 0; i < size (); ++i)	402	for (int i = 0; i < size (); ++i)
387	{	403	{
388	int unique = 0;	404	bool unique = 0;
		405
389	for (object *op = spaces [i].bot; op; op = op->above)	406	for (object *op = spaces [i].bot; op; op = op->above)
390	{	407	{
391	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	408	unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
392	unique = 1;
393		409
394	if (!op->can_map_save ())	410	if (expect_false (!op->can_map_save ()))
395	continue;	411	continue;
396		412
397	if (unique || op->flag [FLAG_UNIQUE])	413	if (expect_false (unique || op->flag [FLAG_UNIQUE]))
398	{	414	{
399	if (flags & IO_UNIQUES)	415	if (flags & IO_UNIQUES)
400	op->write (f);	416	op->write (f);
401	}	417	}
402	else if (flags & IO_OBJECTS)	418	else if (expect_true (flags & IO_OBJECTS))
403	op->write (f);	419	op->write (f);
404	}	420	}
405	}	421	}
406		422
407	coroapi::cede_to_tick ();	423	coroapi::cede_to_tick ();
408		424
409	return true;	425	return true;
410	}	426	}
411		427
412	bool	428	bool
413	maptile::_load_objects (const char *path, bool skip_header)
414	{
415	object_thawer f (path);
416
417	if (!f)
418	return false;
419
420	f.next ();
421
422	if (skip_header)
423	for (;;)
424	{
425	keyword kw = f.kw;
426	f.skip ();
427	if (kw == KW_end)
428	break;
429	}
430
431	return _load_objects (f);
432	}
433
434	bool
435	maptile::_save_objects (const char *path, int flags)	429	maptile::_save_objects (const char *path, int flags)
436	{	430	{
437	object_freezer freezer;	431	object_freezer freezer;
438		432
439	if (!_save_objects (freezer, flags))	433	if (!_save_objects (freezer, flags))
440	return false;	434	return false;
441		435
442	return freezer.save (path);	436	return freezer.save (path);
443	}	437	}
444		438
445	maptile::maptile ()	439	void
		440	maptile::init ()
446	{	441	{
447	in_memory = MAP_SWAPPED;	442	state = MAP_SWAPPED;
448		443
449	/* The maps used to pick up default x and y values from the	444	/* The maps used to pick up default x and y values from the
450	* map archetype. Mimic that behaviour.	445	* map archetype. Mimic that behaviour.
451	*/	446	*/
452	width = 16;	447	width = 16;
453	height = 16;	448	height = 16;
454	timeout = 300;	449	timeout = 300;
455	max_nrof = 1000; // 1000 items of anything	450	max_items = MAX_ITEM_PER_ACTION;
456	max_volume = 2000000; // 2m³	451	max_volume = 2000000; // 2m³
457	}
458
459	maptile::maptile (int w, int h)
460	{
461	in_memory = MAP_SWAPPED;
462
463	width = w;
464	height = h;
465	reset_timeout = 0;	452	reset_timeout = 0;
466	timeout = 300;
467	enter_x = 0;	453	enter_x = 0;
468	enter_y = 0;	454	enter_y = 0;
		455	}
		456
		457	maptile::maptile ()
		458	{
		459	init ();
		460	}
		461
		462	maptile::maptile (int w, int h)
		463	{
		464	init ();
		465
		466	width = w;
		467	height = h;
469		468
470	alloc ();	469	alloc ();
471	}	470	}
472		471
473	/*	472	/*
…		…
481	if (spaces)	480	if (spaces)
482	return;	481	return;
483		482
484	spaces = salloc0<mapspace> (size ());	483	spaces = salloc0<mapspace> (size ());
485	}	484	}
		485
		486	//+GPL
486		487
487	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	488	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
488	* corresponding to that string. Memory is allocated for this, it must be freed	489	* corresponding to that string. Memory is allocated for this, it must be freed
489	* at a later date.	490	* at a later date.
490	* Called by parse_map_headers below.	491	* Called by parse_map_headers below.
…		…
567	return items;	568	return items;
568	}	569	}
569		570
570	/* opposite of parse string, this puts the string that was originally fed in to	571	/* opposite of parse string, this puts the string that was originally fed in to
571	* the map (or something equivilent) into output_string. */	572	* the map (or something equivilent) into output_string. */
572	static void	573	static const char *
573	print_shop_string (maptile *m, char *output_string)	574	print_shop_string (maptile *m)
574	{	575	{
575	int i;	576	static dynbuf_text buf; buf.clear ();
576	char tmp[MAX_BUF];	577	bool first = true;
577		578
578	strcpy (output_string, "");
579	for (i = 0; i < m->shopitems[0].index; i++)	579	for (int i = 0; i < m->shopitems[0].index; i++)
580	{	580	{
		581	if (!first)
		582	buf << ';';
		583
		584	first = false;
		585
581	if (m->shopitems[i].typenum)	586	if (m->shopitems[i].typenum)
582	{	587	{
583	if (m->shopitems[i].strength)	588	if (m->shopitems[i].strength)
584	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	589	buf.printf ("%s:%d", m->shopitems[i].name, m->shopitems[i].strength);
585	else	590	else
586	sprintf (tmp, "%s;", m->shopitems[i].name);	591	buf.printf ("%s", m->shopitems[i].name);
587	}	592	}
588	else	593	else
589	{	594	{
590	if (m->shopitems[i].strength)	595	if (m->shopitems[i].strength)
591	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	596	buf.printf ("*:%d", m->shopitems[i].strength);
592	else	597	else
593	sprintf (tmp, "*");	598	buf.printf ("*");
594	}	599	}
595
596	strcat (output_string, tmp);
597	}	600	}
		601
		602	return buf;
598	}	603	}
		604
		605	//-GPL
599		606
600	/* This loads the header information of the map. The header	607	/* This loads the header information of the map. The header
601	* contains things like difficulty, size, timeout, etc.	608	* contains things like difficulty, size, timeout, etc.
602	* this used to be stored in the map object, but with the	609	* this used to be stored in the map object, but with the
603	* addition of tiling, fields beyond that easily named in an	610	* addition of tiling, fields beyond that easily named in an
…		…
611	bool	618	bool
612	maptile::_load_header (object_thawer &thawer)	619	maptile::_load_header (object_thawer &thawer)
613	{	620	{
614	for (;;)	621	for (;;)
615	{	622	{
616	thawer.next ();
617
618	switch (thawer.kw)	623	switch (thawer.kw)
619	{	624	{
620	case KW_msg:	625	case KW_msg:
621	thawer.get_ml (KW_endmsg, msg);	626	thawer.get_ml (KW_endmsg, msg);
622	break;	627	break;
623		628
624	case KW_lore: // CF+ extension	629	case KW_lore: // deliantra extension
625	thawer.get_ml (KW_endlore, maplore);	630	thawer.get_ml (KW_endlore, maplore);
626	break;	631	break;
627		632
628	case KW_maplore:	633	case KW_maplore:
629	thawer.get_ml (KW_endmaplore, maplore);	634	thawer.get_ml (KW_endmaplore, maplore);
…		…
646	case KW_shopgreed: thawer.get (shopgreed); break;	651	case KW_shopgreed: thawer.get (shopgreed); break;
647	case KW_shopmin: thawer.get (shopmin); break;	652	case KW_shopmin: thawer.get (shopmin); break;
648	case KW_shopmax: thawer.get (shopmax); break;	653	case KW_shopmax: thawer.get (shopmax); break;
649	case KW_shoprace: thawer.get (shoprace); break;	654	case KW_shoprace: thawer.get (shoprace); break;
650	case KW_outdoor: thawer.get (outdoor); break;	655	case KW_outdoor: thawer.get (outdoor); break;
651	case KW_temp: thawer.get (temp); break;
652	case KW_pressure: thawer.get (pressure); break;
653	case KW_humid: thawer.get (humid); break;
654	case KW_windspeed: thawer.get (windspeed); break;
655	case KW_winddir: thawer.get (winddir); break;
656	case KW_sky: thawer.get (sky); break;
657		656
658	case KW_per_player: thawer.get (per_player); break;	657	case KW_per_player: thawer.get (per_player); break;
659	case KW_per_party: thawer.get (per_party); break;	658	case KW_per_party: thawer.get (per_party); break;
660	case KW_no_reset: thawer.get (no_reset); break;	659	case KW_no_reset: thawer.get (no_reset); break;
		660	case KW_no_drop: thawer.get (no_drop); break;
661		661
662	case KW_region: default_region = region::find (thawer.get_str ()); break;	662	case KW_region: thawer.get (default_region); break;
663	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	663	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
664		664
665	// old names new names	665	// old names new names
666	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;	666	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
667	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;	667	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
…		…
675		675
676	case KW_tile_path_1: thawer.get (tile_path [0]); break;	676	case KW_tile_path_1: thawer.get (tile_path [0]); break;
677	case KW_tile_path_2: thawer.get (tile_path [1]); break;	677	case KW_tile_path_2: thawer.get (tile_path [1]); break;
678	case KW_tile_path_3: thawer.get (tile_path [2]); break;	678	case KW_tile_path_3: thawer.get (tile_path [2]); break;
679	case KW_tile_path_4: thawer.get (tile_path [3]); break;	679	case KW_tile_path_4: thawer.get (tile_path [3]); break;
		680	case KW_tile_path_5: thawer.get (tile_path [4]); break;
		681	case KW_tile_path_6: thawer.get (tile_path [5]); break;
680		682
681	case KW_ERROR:	683	case KW_ERROR:
682	set_key (thawer.kw_str, thawer.value);	684	set_key_text (thawer.kw_str, thawer.value);
683	break;	685	break;
684		686
685	case KW_end:	687	case KW_end:
		688	thawer.next ();
686	return true;	689	return true;
687		690
688	default:	691	default:
689	if (!thawer.parse_error ("map", 0))	692	if (!thawer.parse_error ("map"))
690	return false;	693	return false;
691	break;	694	break;
692	}	695	}
		696
		697	thawer.next ();
693	}	698	}
694		699
695	abort ();	700	abort ();
696	}	701	}
697		702
698	bool	703	//+GPL
699	maptile::_load_header (const char *path)
700	{
701	object_thawer thawer (path);
702
703	if (!thawer)
704	return false;
705
706	return _load_header (thawer);
707	}
708		704
709	/******************************************************************************	705	/******************************************************************************
710	* This is the start of unique map handling code	706	* This is the start of unique map handling code
711	*****************************************************************************/	707	*****************************************************************************/
712		708
…		…
719	int unique = 0;	715	int unique = 0;
720	for (object *op = spaces [i].bot; op; )	716	for (object *op = spaces [i].bot; op; )
721	{	717	{
722	object *above = op->above;	718	object *above = op->above;
723		719
724	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	720	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
725	unique = 1;	721	unique = 1;
726		722
727	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))	723	if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique))
728	{
729	op->destroy_inv (false);
730	op->destroy ();	724	op->destroy ();
731	}
732		725
733	op = above;	726	op = above;
734	}	727	}
735	}	728	}
736	}	729	}
737		730
		731	//-GPL
		732
738	bool	733	bool
739	maptile::_save_header (object_freezer &freezer)	734	maptile::_save_header (object_freezer &freezer)
740	{	735	{
741	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	736	#define MAP_OUT(k) freezer.put (KW(k), k)
742	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)	737	#define MAP_OUT2(k,v) freezer.put (KW(k), v)
743		738
744	MAP_OUT2 (arch, "map");	739	MAP_OUT2 (arch, CS(map));
745		740
746	if (name) MAP_OUT (name);	741	if (name) MAP_OUT (name);
747	MAP_OUT (swap_time);	742	MAP_OUT (swap_time);
748	MAP_OUT (reset_time);	743	MAP_OUT (reset_time);
749	MAP_OUT (reset_timeout);	744	MAP_OUT (reset_timeout);
750	MAP_OUT (fixed_resettime);	745	MAP_OUT (fixed_resettime);
751	MAP_OUT (no_reset);	746	MAP_OUT (no_reset);
		747	MAP_OUT (no_drop);
752	MAP_OUT (difficulty);	748	MAP_OUT (difficulty);
753
754	if (default_region) MAP_OUT2 (region, default_region->name);	749	if (default_region) MAP_OUT2 (region, default_region->name);
755		750
756	if (shopitems)	751	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
757	{
758	char shop[MAX_BUF];
759	print_shop_string (this, shop);
760	MAP_OUT2 (shopitems, shop);
761	}
762
763	MAP_OUT (shopgreed);	752	MAP_OUT (shopgreed);
764	MAP_OUT (shopmin);	753	MAP_OUT (shopmin);
765	MAP_OUT (shopmax);	754	MAP_OUT (shopmax);
766	if (shoprace) MAP_OUT (shoprace);	755	if (shoprace) MAP_OUT (shoprace);
767	MAP_OUT (darkness);	756
768	MAP_OUT (width);	757	MAP_OUT (width);
769	MAP_OUT (height);	758	MAP_OUT (height);
770	MAP_OUT (enter_x);	759	MAP_OUT (enter_x);
771	MAP_OUT (enter_y);	760	MAP_OUT (enter_y);
772		761	MAP_OUT (darkness);
773	if (msg) freezer.put (KW_msg , KW_endmsg , msg);
774	if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
775
776	MAP_OUT (outdoor);	762	MAP_OUT (outdoor);
777	MAP_OUT (temp);	763
778	MAP_OUT (pressure);	764	if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
779	MAP_OUT (humid);	765	if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
780	MAP_OUT (windspeed);
781	MAP_OUT (winddir);
782	MAP_OUT (sky);
783		766
784	MAP_OUT (per_player);	767	MAP_OUT (per_player);
785	MAP_OUT (per_party);	768	MAP_OUT (per_party);
786		769
787	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);	770	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
788	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);	771	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
789	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);	772	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
790	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);	773	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
		774	if (tile_path [4]) MAP_OUT2 (tile_path_5, tile_path [4]);
		775	if (tile_path [5]) MAP_OUT2 (tile_path_6, tile_path [5]);
791		776
792	freezer.put (this);	777	freezer.put (this);
793	freezer.put (KW_end);	778	freezer.put (KW(end));
794		779
795	return true;	780	return true;
796	}	781	}
797		782
798	bool	783	bool
…		…
804	return false;	789	return false;
805		790
806	return freezer.save (path);	791	return freezer.save (path);
807	}	792	}
808		793
		794	//+GPL
		795
809	/*	796	/*
810	* Remove and free all objects in the given map.	797	* Remove and free all objects in the given map.
811	*/	798	*/
812	void	799	void
813	maptile::clear ()	800	maptile::clear ()
814	{	801	{
815	sfree (regions, size ()); regions = 0;
816	delete [] regionmap; regionmap = 0;
817
818	if (spaces)	802	if (spaces)
819	{	803	{
820	for (mapspace *ms = spaces + size (); ms-- > spaces; )	804	for (mapspace *ms = spaces + size (); ms-- > spaces; )
821	while (object *op = ms->bot)	805	while (object *op = ms->bot)
822	{	806	{
		807	// manually remove, as to not trigger anything
		808	if (ms->bot = op->above)
		809	ms->bot->below = 0;
		810
		811	op->flag [FLAG_REMOVED] = true;
		812
823	op = op->head_ ();	813	object *head = op->head_ ();
824	op->destroy_inv (false);	814	if (op == head)
825	op->destroy ();	815	op->destroy ();
		816	else if (head->map != op->map)
		817	{
		818	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		819	head->destroy ();
		820	}
826	}	821	}
827		822
828	sfree (spaces, size ()), spaces = 0;	823	sfree0 (spaces, size ());
829	}	824	}
830		825
831	if (buttons)	826	if (buttons)
832	free_objectlinkpt (buttons), buttons = 0;	827	free_objectlinkpt (buttons), buttons = 0;
		828
		829	sfree0 (regions, size ());
		830	delete [] regionmap; regionmap = 0;
833	}	831	}
834		832
835	void	833	void
836	maptile::clear_header ()	834	maptile::clear_header ()
837	{	835	{
…		…
839	msg = 0;	837	msg = 0;
840	maplore = 0;	838	maplore = 0;
841	shoprace = 0;	839	shoprace = 0;
842	delete [] shopitems, shopitems = 0;	840	delete [] shopitems, shopitems = 0;
843		841
844	for (int i = 0; i < 4; i++)	842	for (int i = 0; i < array_length (tile_path); i++)
845	tile_path [i] = 0;	843	tile_path [i] = 0;
846	}	844	}
847		845
848	maptile::~maptile ()	846	maptile::~maptile ()
849	{	847	{
…		…
856	/* We need to look through all the maps and see if any maps	854	/* We need to look through all the maps and see if any maps
857	* are pointing at this one for tiling information. Since	855	* are pointing at this one for tiling information. Since
858	* tiling can be asymetric, we just can not look to see which	856	* tiling can be asymetric, we just can not look to see which
859	* maps this map tiles with and clears those.	857	* maps this map tiles with and clears those.
860	*/	858	*/
861	for (int i = 0; i < 4; i++)	859	for (int i = 0; i < array_length (tile_path); i++)
862	if (tile_map[i] == m)	860	if (tile_map[i] == m)
863	tile_map[i] = 0;	861	tile_map[i] = 0;
864	}	862	}
865		863
866	void	864	void
…		…
870		868
871	clear ();	869	clear ();
872	}	870	}
873		871
874	/* decay and destroy perishable items in a map */	872	/* decay and destroy perishable items in a map */
		873	// TODO: should be done regularly, not on map load?
875	void	874	void
876	maptile::do_decay_objects ()	875	maptile::do_decay_objects ()
877	{	876	{
878	if (!spaces)	877	if (!spaces)
879	return;	878	return;
…		…
881	for (mapspace *ms = spaces + size (); ms-- > spaces; )	880	for (mapspace *ms = spaces + size (); ms-- > spaces; )
882	for (object *above, *op = ms->bot; op; op = above)	881	for (object *above, *op = ms->bot; op; op = above)
883	{	882	{
884	above = op->above;	883	above = op->above;
885		884
		885	// do not decay anything above unique floor tiles (yet :)
		886	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
		887	break;
		888
886	bool destroy = 0;	889	bool destroy = 0;
887		890
888	// do not decay anything above unique floor tiles (yet :)	891	if (op->flag [FLAG_IS_FLOOR]
889	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	892	|| op->flag [FLAG_OBJ_ORIGINAL]
890	break;	893	|| op->flag [FLAG_UNIQUE]
891		894	|| op->flag [FLAG_OVERLAY_FLOOR]
892	if (QUERY_FLAG (op, FLAG_IS_FLOOR)	895	|| op->flag [FLAG_UNPAID]
893	|| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
894	|| QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
895	|| QUERY_FLAG (op, FLAG_UNIQUE)
896	|| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
897	|| QUERY_FLAG (op, FLAG_UNPAID)
898	|| op->is_alive ())	896	|| op->is_alive ())
899	; // do not decay	897	; // do not decay
900	else if (op->is_weapon ())	898	else if (op->is_weapon ())
901	{	899	{
902	op->stats.dam--;	900	op->stats.dam--;
…		…
927	|| mat & M_LIQUID	925	|| mat & M_LIQUID
928	|| (mat & M_IRON && rndm (1, 5) == 1)	926	|| (mat & M_IRON && rndm (1, 5) == 1)
929	|| (mat & M_GLASS && rndm (1, 2) == 1)	927	|| (mat & M_GLASS && rndm (1, 2) == 1)
930	|| ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)	928	|| ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
931	|| ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)	929	|| ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
932	|| (mat & M_ICE && temp > 32))	930	//|| (mat & M_ICE && temp > 32)
		931	)
933	destroy = 1;	932	destroy = 1;
934	}	933	}
935		934
936	/* adjust overall chance below */	935	/* adjust overall chance below */
937	if (destroy && rndm (0, 1))	936	if (destroy && rndm (0, 1))
938	op->destroy ();	937	op->destroy ();
939	}
940	}
941
942	/*
943	* Updates every button on the map (by calling update_button() for them).
944	*/
945	void
946	maptile::update_buttons ()
947	{
948	for (oblinkpt *obp = buttons; obp; obp = obp->next)
949	for (objectlink *ol = obp->link; ol; ol = ol->next)
950	{
951	if (!ol->ob)
952	{
953	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
954	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
955	continue;
956	}
957
958	if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
959	{
960	update_button (ol->ob);
961	break;
962	}
963	}	938	}
964	}	939	}
965		940
966	/*	941	/*
967	* This routine is supposed to find out the difficulty of the map.	942	* This routine is supposed to find out the difficulty of the map.
968	* difficulty does not have a lot to do with character level,	943	* difficulty does not have a lot to do with character level,
969	* but does have a lot to do with treasure on the map.	944	* but does have a lot to do with treasure on the map.
970	*	945	*
971	* Difficulty can now be set by the map creature. If the value stored	946	* Difficulty can now be set by the map creator. If the value stored
972	* in the map is zero, then use this routine. Maps should really	947	* in the map is zero, then use this routine. Maps should really
973	* have a difficulty set than using this function - human calculation	948	* have a difficulty set rather than using this function - human calculation
974	* is much better than this functions guesswork.	949	* is much better than this function's guesswork.
975	*/	950	*/
976	int	951	int
977	maptile::estimate_difficulty () const	952	maptile::estimate_difficulty () const
978	{	953	{
979	long monster_cnt = 0;	954	long monster_cnt = 0;
…		…
981	sint64 total_exp = 0;	956	sint64 total_exp = 0;
982		957
983	for (mapspace *ms = spaces + size (); ms-- > spaces; )	958	for (mapspace *ms = spaces + size (); ms-- > spaces; )
984	for (object *op = ms->bot; op; op = op->above)	959	for (object *op = ms->bot; op; op = op->above)
985	{	960	{
986	if (QUERY_FLAG (op, FLAG_MONSTER))	961	if (op->flag [FLAG_MONSTER])
987	{	962	{
988	total_exp += op->stats.exp;	963	total_exp += op->stats.exp;
989	monster_cnt++;	964	monster_cnt++;
990	}	965	}
991		966
992	if (QUERY_FLAG (op, FLAG_GENERATOR))	967	if (op->flag [FLAG_GENERATOR])
993	{	968	{
994	total_exp += op->stats.exp;	969	total_exp += op->stats.exp;
995		970
996	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	971	if (archetype *at = op->other_arch)
		972	{
997	total_exp += at->stats.exp * 8;	973	total_exp += at->stats.exp * 8;
998
999	monster_cnt++;	974	monster_cnt++;
		975	}
		976
		977	for (object *inv = op->inv; inv; inv = inv->below)
		978	{
		979	total_exp += op->stats.exp * 8;
		980	monster_cnt++;
		981	}
1000	}	982	}
1001	}	983	}
1002		984
1003	avgexp = (double) total_exp / monster_cnt;	985	avgexp = (double) total_exp / monster_cnt;
1004		986
…		…
1017	* postive values make it darker, negative make it brighter	999	* postive values make it darker, negative make it brighter
1018	*/	1000	*/
1019	int	1001	int
1020	maptile::change_map_light (int change)	1002	maptile::change_map_light (int change)
1021	{	1003	{
1022	int new_level = darkness + change;
1023
1024	/* Nothing to do */	1004	/* Nothing to do */
1025	if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	1005	if (!change)
1026	return 0;	1006	return 0;
1027		1007
1028	/* inform all players on the map */	1008	/* inform all players on the map */
1029	if (change > 0)	1009	if (change > 0)
1030	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");	1010	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1031	else	1011	else
1032	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");	1012	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1033		1013
1034	/* Do extra checking. since darkness is a unsigned value,	1014	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1035	* we need to be extra careful about negative values.
1036	* In general, the checks below are only needed if change
1037	* is not +/-1
1038	*/
1039	if (new_level < 0)
1040	darkness = 0;
1041	else if (new_level >= MAX_DARKNESS)
1042	darkness = MAX_DARKNESS;
1043	else
1044	darkness = new_level;
1045		1015
1046	/* All clients need to get re-updated for the change */	1016	/* All clients need to get re-updated for the change */
1047	update_all_map_los (this);	1017	update_all_map_los (this);
		1018
1048	return 1;	1019	return 1;
1049	}	1020	}
1050		1021
1051	/*	1022	/*
1052	* This function updates various attributes about a specific space	1023	* This function updates various attributes about a specific space
…		…
1055	* through, etc)	1026	* through, etc)
1056	*/	1027	*/
1057	void	1028	void
1058	mapspace::update_ ()	1029	mapspace::update_ ()
1059	{	1030	{
1060	object *tmp, *last = 0;	1031	object *last = 0;
1061	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1032	uint8 flags = P_UPTODATE;
		1033	sint8 light = 0;
1062	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1034	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
		1035	uint64_t volume = 0;
		1036	uint32_t items = 0;
		1037	object *anywhere = 0;
		1038	uint8_t middle_visibility = 0;
1063		1039
1064	//object *middle = 0;	1040	//object *middle = 0;
1065	//object *top = 0;	1041	//object *top = 0;
1066	//object *floor = 0;	1042	//object *floor = 0;
1067	// this seems to generate better code than using locals, above	1043	// this seems to generate better code than using locals, above
1068	object *&top = faces_obj[0] = 0;	1044	object *&top = faces_obj[0] = 0;
1069	object *&middle = faces_obj[1] = 0;	1045	object *&middle = faces_obj[1] = 0;
1070	object *&floor = faces_obj[2] = 0;	1046	object *&floor = faces_obj[2] = 0;
1071		1047
		1048	object::flags_t allflags; // all flags of all objects or'ed together
		1049
1072	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1050	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1073	{	1051	{
1074	/* This could be made additive I guess (two lights better than	1052	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1075	* one). But if so, it shouldn't be a simple additive - 2
1076	* light bulbs do not illuminate twice as far as once since
1077	* it is a dissapation factor that is cubed.
1078	*/
1079	if (tmp->glow_radius > light)
1080	light = tmp->glow_radius;	1053	light += tmp->glow_radius;
1081		1054
1082	/* This call is needed in order to update objects the player	1055	/* This call is needed in order to update objects the player
1083	* is standing in that have animations (ie, grass, fire, etc).	1056	* is standing in that have animations (ie, grass, fire, etc).
1084	* However, it also causes the look window to be re-drawn	1057	* However, it also causes the look window to be re-drawn
1085	* 3 times each time the player moves, because many of the	1058	* 3 times each time the player moves, because many of the
1086	* functions the move_player calls eventualy call this.	1059	* functions the move_player calls eventualy call this.
1087	*	1060	*
1088	* Always put the player down for drawing.	1061	* Always put the player down for drawing.
1089	*/	1062	*/
1090	if (!tmp->invisible)	1063	if (expect_true (!tmp->invisible))
1091	{	1064	{
1092	if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))	1065	if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]))
1093	top = tmp;	1066	top = tmp;
1094	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1067	else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1095	{	1068	{
1096	/* If we got a floor, that means middle and top were below it,	1069	/* If we got a floor, that means middle and top were below it,
1097	* so should not be visible, so we clear them.	1070	* so should not be visible, so we clear them.
1098	*/	1071	*/
1099	middle = 0;	1072	middle = 0;
1100	top = 0;	1073	top = 0;
1101	floor = tmp;	1074	floor = tmp;
		1075	volume = 0;
		1076	items = 0;
1102	}	1077	}
1103	/* Flag anywhere have high priority */	1078	else
1104	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1105	{	1079	{
		1080	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1081	{
		1082	++items;
		1083	volume += tmp->volume ();
		1084	}
		1085
		1086	/* Flag anywhere have high priority */
		1087	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
		1088	anywhere = tmp;
		1089
		1090	/* Find the highest visible face around. If equal
		1091	* visibilities, we still want the one nearer to the
		1092	* top
		1093	*/
		1094	if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
		1095	{
		1096	middle_visibility = ::faces [tmp->face].visibility;
1106	middle = tmp;	1097	middle = tmp;
1107	anywhere = 1;	1098	}
1108	}	1099	}
1109	/* Find the highest visible face around. If equal
1110	* visibilities, we still want the one nearer to the
1111	* top
1112	*/
1113	else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1114	middle = tmp;
1115	}
1116
1117	if (tmp == tmp->above)
1118	{
1119	LOG (llevError, "Error in structure of map\n");
1120	exit (-1);
1121	}	1100	}
1122		1101
1123	move_slow |= tmp->move_slow;	1102	move_slow |= tmp->move_slow;
1124	move_block |= tmp->move_block;	1103	move_block |= tmp->move_block;
1125	move_on |= tmp->move_on;	1104	move_on |= tmp->move_on;
1126	move_off |= tmp->move_off;	1105	move_off |= tmp->move_off;
1127	move_allow |= tmp->move_allow;	1106	move_allow |= tmp->move_allow;
1128		1107
1129	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW;	1108	allflags |= tmp->flag;
1130	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC;	1109
1131	if (tmp->type == PLAYER) flags |= P_PLAYER;	1110	if (tmp->type == PLAYER) flags |= P_PLAYER;
1132	if (tmp->type == SAFE_GROUND) flags |= P_SAFE;	1111	if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1133	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1134	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1135	}	1112	}
1136		1113
1137	this->light = light;	1114	// FLAG_SEE_ANYWHERE takes precedence
		1115	if (anywhere)
		1116	middle = anywhere;
		1117
		1118	// ORing all flags together and checking them here is much faster
		1119	if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
		1120	if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC;
		1121	if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE;
		1122	if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC;
		1123
		1124	this->light = min (light, MAX_LIGHT_RADIUS);
1138	this->flags_ = flags;	1125	this->flags_ = flags;
1139	this->move_block = move_block & ~move_allow;	1126	this->move_block = move_block & ~move_allow;
1140	this->move_on = move_on;	1127	this->move_on = move_on;
1141	this->move_off = move_off;	1128	this->move_off = move_off;
1142	this->move_slow = move_slow;	1129	this->move_slow = move_slow;
		1130	this->volume_ = (volume + 1023) / 1024;
		1131	this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1143		1132
1144	/* At this point, we have a floor face (if there is a floor),	1133	/* At this point, we have a floor face (if there is a floor),
1145	* and the floor is set - we are not going to touch it at	1134	* and the floor is set - we are not going to touch it at
1146	* this point.	1135	* this point.
1147	* middle contains the highest visibility face.	1136	* middle contains the highest visibility face.
…		…
1162	* 1) top face is set, need middle to be set.	1151	* 1) top face is set, need middle to be set.
1163	* 2) middle is set, need to set top.	1152	* 2) middle is set, need to set top.
1164	* 3) neither middle or top is set - need to set both.	1153	* 3) neither middle or top is set - need to set both.
1165	*/	1154	*/
1166		1155
1167	for (tmp = last; tmp; tmp = tmp->below)	1156	for (object *tmp = last; tmp; tmp = tmp->below)
1168	{	1157	{
1169	/* Once we get to a floor, stop, since we already have a floor object */	1158	/* Once we get to a floor, stop, since we already have a floor object */
1170	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1159	if (tmp->flag [FLAG_IS_FLOOR])
1171	break;	1160	break;
1172		1161
1173	/* If two top faces are already set, quit processing */	1162	/* If two top faces are already set, quit processing */
1174	if (top && middle)	1163	if (top && middle)
1175	break;	1164	break;
…		…
1213	faces_obj [1] = middle;	1202	faces_obj [1] = middle;
1214	faces_obj [2] = floor;	1203	faces_obj [2] = floor;
1215	#endif	1204	#endif
1216	}	1205	}
1217		1206
1218	uint64	1207	maptile *
1219	mapspace::volume () const
1220	{
1221	uint64 vol = 0;
1222
1223	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1224	vol += op->volume ();
1225
1226	return vol;
1227	}
1228
1229	bool
1230	maptile::tile_available (int dir, bool load)	1208	maptile::tile_available (int dir, bool load)
1231	{	1209	{
1232	if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY))
1233	return 1;
1234
1235	if (!tile_path[dir])	1210	if (tile_path[dir])
1236	return 0;	1211	{
		1212	// map is there and we don't need to load it OR it's loaded => return what we have
		1213	if (tile_map[dir] && (!load || tile_map[dir]->linkable ()))
		1214	return tile_map[dir];
1237		1215
		1216	// well, try to locate it then, if possible - maybe it's there already
1238	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))	1217	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1239	return 1;	1218	return tile_map[dir];
		1219	}
1240		1220
1241	return 0;	1221	return 0;
1242	}	1222	}
1243		1223
1244	/* this returns TRUE if the coordinates (x,y) are out of	1224	/* this returns TRUE if the coordinates (x,y) are out of
…		…
1259	if (!m)	1239	if (!m)
1260	return 0;	1240	return 0;
1261		1241
1262	if (x < 0)	1242	if (x < 0)
1263	{	1243	{
1264	if (!m->tile_available (3, 0))	1244	if (!m->tile_available (3))
1265	return 1;	1245	return 1;
1266		1246
1267	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1247	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1268	}	1248	}
1269		1249
1270	if (x >= m->width)	1250	if (x >= m->width)
1271	{	1251	{
1272	if (!m->tile_available (1, 0))	1252	if (!m->tile_available (1))
1273	return 1;	1253	return 1;
1274		1254
1275	return out_of_map (m->tile_map[1], x - m->width, y);	1255	return out_of_map (m->tile_map[1], x - m->width, y);
1276	}	1256	}
1277		1257
1278	if (y < 0)	1258	if (y < 0)
1279	{	1259	{
1280	if (!m->tile_available (0, 0))	1260	if (!m->tile_available (0))
1281	return 1;	1261	return 1;
1282		1262
1283	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1263	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1284	}	1264	}
1285		1265
1286	if (y >= m->height)	1266	if (y >= m->height)
1287	{	1267	{
1288	if (!m->tile_available (2, 0))	1268	if (!m->tile_available (2))
1289	return 1;	1269	return 1;
1290		1270
1291	return out_of_map (m->tile_map[2], x, y - m->height);	1271	return out_of_map (m->tile_map[2], x, y - m->height);
1292	}	1272	}
1293		1273
…		…
1308	maptile *	1288	maptile *
1309	maptile::xy_find (sint16 &x, sint16 &y)	1289	maptile::xy_find (sint16 &x, sint16 &y)
1310	{	1290	{
1311	if (x < 0)	1291	if (x < 0)
1312	{	1292	{
1313	if (!tile_available (3, 1))	1293	if (!tile_available (3))
1314	return 0;	1294	return 0;
1315		1295
1316	x += tile_map[3]->width;	1296	x += tile_map[3]->width;
1317	return tile_map[3]->xy_find (x, y);	1297	return tile_map[3]->xy_find (x, y);
1318	}	1298	}
1319		1299
1320	if (x >= width)	1300	if (x >= width)
1321	{	1301	{
1322	if (!tile_available (1, 1))	1302	if (!tile_available (1))
1323	return 0;	1303	return 0;
1324		1304
1325	x -= width;	1305	x -= width;
1326	return tile_map[1]->xy_find (x, y);	1306	return tile_map[1]->xy_find (x, y);
1327	}	1307	}
1328		1308
1329	if (y < 0)	1309	if (y < 0)
1330	{	1310	{
1331	if (!tile_available (0, 1))	1311	if (!tile_available (0))
1332	return 0;	1312	return 0;
1333		1313
1334	y += tile_map[0]->height;	1314	y += tile_map[0]->height;
1335	return tile_map[0]->xy_find (x, y);	1315	return tile_map[0]->xy_find (x, y);
1336	}	1316	}
1337		1317
1338	if (y >= height)	1318	if (y >= height)
1339	{	1319	{
1340	if (!tile_available (2, 1))	1320	if (!tile_available (2))
1341	return 0;	1321	return 0;
1342		1322
1343	y -= height;	1323	y -= height;
1344	return tile_map[2]->xy_find (x, y);	1324	return tile_map[2]->xy_find (x, y);
1345	}	1325	}
…		…
1353	/**	1333	/**
1354	* Return whether map2 is adjacent to map1. If so, store the distance from	1334	* Return whether map2 is adjacent to map1. If so, store the distance from
1355	* map1 to map2 in dx/dy.	1335	* map1 to map2 in dx/dy.
1356	*/	1336	*/
1357	int	1337	int
1358	adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)	1338	adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy)
1359	{	1339	{
1360	if (!map1 || !map2)	1340	if (!map1 || !map2)
1361	return 0;	1341	return 0;
1362		1342
1363	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1343	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1364	//fix: compare paths instead (this is likely faster, too!)	1344	//fix: compare paths instead (this is likely faster, too!)
1365	if (map1 == map2)	1345	if (map1 == map2)
1366	{	1346	{
1367	*dx = 0;	1347	*dx = 0;
1368	*dy = 0;	1348	*dy = 0;
1369	}	1349	}
1370	else if (map1->tile_map[0] == map2)	1350	else if (map1->tile_available (TILE_NORTH, false) == map2)
1371	{ /* up */	1351	{
1372	*dx = 0;	1352	*dx = 0;
1373	*dy = -map2->height;	1353	*dy = -map2->height;
1374	}	1354	}
1375	else if (map1->tile_map[1] == map2)	1355	else if (map1->tile_available (TILE_EAST , false) == map2)
1376	{ /* right */	1356	{
1377	*dx = map1->width;	1357	*dx = map1->width;
1378	*dy = 0;	1358	*dy = 0;
1379	}	1359	}
1380	else if (map1->tile_map[2] == map2)	1360	else if (map1->tile_available (TILE_SOUTH, false) == map2)
1381	{ /* down */	1361	{
1382	*dx = 0;	1362	*dx = 0;
1383	*dy = map1->height;	1363	*dy = map1->height;
1384	}	1364	}
1385	else if (map1->tile_map[3] == map2)	1365	else if (map1->tile_available (TILE_WEST , false) == map2)
1386	{ /* left */	1366	{
1387	*dx = -map2->width;	1367	*dx = -map2->width;
1388	*dy = 0;	1368	*dy = 0;
1389	}	1369	}
1390	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)	1370	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2)
1391	{ /* up right */	1371	{ /* up right */
1392	*dx = map1->tile_map[0]->width;	1372	*dx = +map1->tile_map[TILE_NORTH]->width;
1393	*dy = -map1->tile_map[0]->height;	1373	*dy = -map1->tile_map[TILE_NORTH]->height;
1394	}	1374	}
1395	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)	1375	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2)
1396	{ /* up left */	1376	{ /* up left */
1397	*dx = -map2->width;	1377	*dx = -map2->width;
1398	*dy = -map1->tile_map[0]->height;	1378	*dy = -map1->tile_map[TILE_NORTH]->height;
1399	}	1379	}
1400	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)	1380	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2)
1401	{ /* right up */	1381	{ /* right up */
1402	*dx = map1->width;	1382	*dx = +map1->width;
1403	*dy = -map2->height;	1383	*dy = -map2->height;
1404	}	1384	}
1405	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)	1385	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2)
1406	{ /* right down */	1386	{ /* right down */
1407	*dx = map1->width;	1387	*dx = +map1->width;
1408	*dy = map1->tile_map[1]->height;	1388	*dy = +map1->tile_map[TILE_EAST]->height;
1409	}	1389	}
1410	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)	1390	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2)
1411	{ /* down right */	1391	{ /* down right */
1412	*dx = map1->tile_map[2]->width;	1392	*dx = +map1->tile_map[TILE_SOUTH]->width;
1413	*dy = map1->height;	1393	*dy = +map1->height;
1414	}	1394	}
1415	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)	1395	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2)
1416	{ /* down left */	1396	{ /* down left */
1417	*dx = -map2->width;	1397	*dx = -map2->width;
1418	*dy = map1->height;	1398	*dy = +map1->height;
1419	}	1399	}
1420	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)	1400	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2)
1421	{ /* left up */	1401	{ /* left up */
1422	*dx = -map1->tile_map[3]->width;	1402	*dx = -map1->tile_map[TILE_WEST]->width;
1423	*dy = -map2->height;	1403	*dy = -map2->height;
1424	}	1404	}
1425	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)	1405	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2)
1426	{ /* left down */	1406	{ /* left down */
1427	*dx = -map1->tile_map[3]->width;	1407	*dx = -map1->tile_map[TILE_WEST]->width;
1428	*dy = map1->tile_map[3]->height;	1408	*dy = +map1->tile_map[TILE_WEST]->height;
1429	}	1409	}
1430	else	1410	else
1431	return 0;	1411	return 0;
1432		1412
1433	return 1;	1413	return 1;
…		…
1469	*	1449	*
1470	* currently, the only flag supported (0x1) is don't translate for	1450	* currently, the only flag supported (0x1) is don't translate for
1471	* closest body part of 'op1'	1451	* closest body part of 'op1'
1472	*/	1452	*/
1473	void	1453	void
1474	get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)	1454	get_rangevector (object *op1, object *op2, rv_vector *retval, int flags)
1475	{	1455	{
1476	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1456	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1477	{	1457	{
1478	/* be conservative and fill in _some_ data */	1458	/* be conservative and fill in _some_ data */
1479	retval->distance = 10000;	1459	retval->distance = 10000;
1480	retval->distance_x = 10000;	1460	retval->distance_x = 10000;
1481	retval->distance_y = 10000;	1461	retval->distance_y = 10000;
1482	retval->direction = 0;	1462	retval->direction = 0;
1483	retval->part = 0;	1463	retval->part = 0;
1484	}	1464	}
1485	else	1465	else
1486	{	1466	{
1487	object *best;
1488
1489	retval->distance_x += op2->x - op1->x;	1467	retval->distance_x += op2->x - op1->x;
1490	retval->distance_y += op2->y - op1->y;	1468	retval->distance_y += op2->y - op1->y;
1491		1469
1492	best = op1;	1470	object *best = op1;
		1471
1493	/* If this is multipart, find the closest part now */	1472	/* If this is multipart, find the closest part now */
1494	if (!(flags & 0x1) && op1->more)	1473	if (!(flags & 1) && op1->more)
1495	{	1474	{
1496	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;	1475	int best_distance = idistance (retval->distance_x, retval->distance_y);
1497		1476
1498	/* we just take the offset of the piece to head to figure	1477	/* we just take the offset of the piece to head to figure
1499	* distance instead of doing all that work above again	1478	* distance instead of doing all that work above again
1500	* since the distance fields we set above are positive in the	1479	* since the distance fields we set above are positive in the
1501	* same axis as is used for multipart objects, the simply arithmetic	1480	* same axis as is used for multipart objects, the simply arithmetic
1502	* below works.	1481	* below works.
1503	*/	1482	*/
1504	for (object *tmp = op1->more; tmp; tmp = tmp->more)	1483	for (object *tmp = op1->more; tmp; tmp = tmp->more)
1505	{	1484	{
1506	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +	1485	int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
1507	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1486
1508	if (tmpi < best_distance)	1487	if (tmpi < best_distance)
1509	{	1488	{
1510	best_distance = tmpi;	1489	best_distance = tmpi;
1511	best = tmp;	1490	best = tmp;
1512	}	1491	}
1513	}	1492	}
1514		1493
1515	if (best != op1)	1494	if (best != op1)
1516	{	1495	{
1517	retval->distance_x += op1->x - best->x;	1496	retval->distance_x += op1->x - best->x;
1518	retval->distance_y += op1->y - best->y;	1497	retval->distance_y += op1->y - best->y;
1519	}	1498	}
1520	}	1499	}
1521		1500
1522	retval->part = best;	1501	retval->part = best;
1523	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));	1502	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1524	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1503	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1525	}	1504	}
1526	}	1505	}
1527		1506
1528	/* this is basically the same as get_rangevector above, but instead of	1507	/* this is basically the same as get_rangevector above, but instead of
1529	* the first parameter being an object, it instead is the map	1508	* the first parameter being an object, it instead is the map
…		…
1534	* be more consistant with the above function and also in case they are needed	1513	* be more consistant with the above function and also in case they are needed
1535	* for something in the future. Also, since no object is pasted, the best	1514	* for something in the future. Also, since no object is pasted, the best
1536	* field of the rv_vector is set to NULL.	1515	* field of the rv_vector is set to NULL.
1537	*/	1516	*/
1538	void	1517	void
1539	get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)	1518	get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1540	{	1519	{
1541	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))	1520	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1542	{	1521	{
1543	/* be conservative and fill in _some_ data */	1522	/* be conservative and fill in _some_ data */
1544	retval->distance = 100000;	1523	retval->distance = 100000;
1545	retval->distance_x = 32767;	1524	retval->distance_x = 32767;
1546	retval->distance_y = 32767;	1525	retval->distance_y = 32767;
1547	retval->direction = 0;	1526	retval->direction = 0;
1548	retval->part = 0;	1527	retval->part = 0;
1549	}	1528	}
1550	else	1529	else
1551	{	1530	{
1552	retval->distance_x += op2->x - x;	1531	retval->distance_x += op2->x - x;
1553	retval->distance_y += op2->y - y;	1532	retval->distance_y += op2->y - y;
1554		1533
1555	retval->part = NULL;	1534	retval->part = 0;
1556	retval->distance = idistance (retval->distance_x, retval->distance_y);	1535	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1557	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1536	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1558	}	1537	}
1559	}	1538	}
1560		1539
1561	/* Returns true of op1 and op2 are effectively on the same map	1540	/* Returns true of op1 and op2 are effectively on the same map
1562	* (as related to map tiling). Note that this looks for a path from	1541	* (as related to map tiling). Note that this looks for a path from
…		…
1572	int dx, dy;	1551	int dx, dy;
1573		1552
1574	return adjacent_map (op1->map, op2->map, &dx, &dy);	1553	return adjacent_map (op1->map, op2->map, &dx, &dy);
1575	}	1554	}
1576		1555
		1556	//-GPL
		1557
1577	object *	1558	object *
1578	maptile::insert (object *op, int x, int y, object *originator, int flags)	1559	maptile::insert (object *op, int x, int y, object *originator, int flags)
1579	{	1560	{
1580	if (!op->flag [FLAG_REMOVED])
1581	op->remove ();
1582
1583	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1561	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1584	}	1562	}
1585		1563
1586	region *	1564	region *
1587	maptile::region (int x, int y) const	1565	maptile::region (int x, int y) const
…		…
1596	return default_region;	1574	return default_region;
1597		1575
1598	return ::region::default_region ();	1576	return ::region::default_region ();
1599	}	1577	}
1600		1578
		1579	//+GPL
		1580
1601	/* picks a random object from a style map.	1581	/* picks a random object from a style map.
1602	* Redone by MSW so it should be faster and not use static
1603	* variables to generate tables.
1604	*/	1582	*/
1605	object *	1583	object *
1606	maptile::pick_random_object () const	1584	maptile::pick_random_object (rand_gen &gen) const
1607	{	1585	{
1608	/* while returning a null object will result in a crash, that	1586	/* while returning a null object will result in a crash, that
1609	* is actually preferable to an infinite loop. That is because	1587	* is actually preferable to an infinite loop. That is because
1610	* most servers will automatically restart in case of crash.	1588	* most servers will automatically restart in case of crash.
1611	* Change the logic on getting the random space - shouldn't make	1589	* Change the logic on getting the random space - shouldn't make
1612	* any difference, but this seems clearer to me.	1590	* any difference, but this seems clearer to me.
1613	*/	1591	*/
1614	for (int i = 1000; --i;)	1592	for (int i = 1000; --i;)
1615	{	1593	{
1616	object *pick = at (rndm (width), rndm (height)).bot;	1594	object *pick = at (gen (width), gen (height)).bot;
1617		1595
1618	// do not prefer big monsters just because they are big.	1596	// must be head: do not prefer big monsters just because they are big.
1619	if (pick && pick->head_ () == pick)	1597	if (pick && pick->is_head ())
1620	return pick->head_ ();	1598	return pick;
1621	}	1599	}
1622		1600
1623	// instead of crashing in the unlikely(?) case, try to return *something*	1601	// instead of crashing in the unlikely(?) case, try to return *something*
1624	return get_archetype ("blocked");	1602	return archetype::find (shstr_bug);
1625	}	1603	}
		1604
		1605	//-GPL
1626		1606
1627	void	1607	void
1628	maptile::play_sound (faceidx sound, int x, int y) const	1608	maptile::play_sound (faceidx sound, int x, int y) const
1629	{	1609	{
1630	if (!sound)	1610	if (!sound)
1631	return;	1611	return;
1632		1612
		1613	for_all_players_on_map (pl, this)
		1614	if (client *ns = pl->ns)
		1615	{
		1616	int dx = x - pl->ob->x;
		1617	int dy = y - pl->ob->y;
		1618
		1619	int distance = idistance (dx, dy);
		1620
		1621	if (distance <= MAX_SOUND_DISTANCE)
		1622	ns->play_sound (sound, dx, dy);
		1623	}
		1624	}
		1625
		1626	void
		1627	maptile::say_msg (const char *msg, int x, int y) const
		1628	{
1633	for_all_players (pl)	1629	for_all_players (pl)
1634	if (pl->ob->map == this)
1635	if (client *ns = pl->ns)	1630	if (client *ns = pl->ns)
1636	{	1631	{
1637	int dx = x - pl->ob->x;	1632	int dx = x - pl->ob->x;
1638	int dy = y - pl->ob->y;	1633	int dy = y - pl->ob->y;
1639		1634
1640	int distance = idistance (dx, dy);	1635	int distance = idistance (dx, dy);
1641		1636
1642	if (distance <= MAX_SOUND_DISTANCE)	1637	if (distance <= MAX_SOUND_DISTANCE)
1643	ns->play_sound (sound, dx, dy);	1638	ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1644	}	1639	}
1645	}	1640	}
1646		1641
		1642	dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
		1643
		1644	static void
		1645	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1646	{
		1647	// clip to map to the left
		1648	if (x0 < 0)
		1649	{
		1650	if (maptile *tile = m->tile_available (TILE_WEST, 1))
		1651	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1652
		1653	if (x1 < 0) // entirely to the left
		1654	return;
		1655
		1656	x0 = 0;
		1657	}
		1658
		1659	// clip to map to the right
		1660	if (x1 > m->width)
		1661	{
		1662	if (maptile *tile = m->tile_available (TILE_EAST, 1))
		1663	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1664
		1665	if (x0 > m->width) // entirely to the right
		1666	return;
		1667
		1668	x1 = m->width;
		1669	}
		1670
		1671	// clip to map above
		1672	if (y0 < 0)
		1673	{
		1674	if (maptile *tile = m->tile_available (TILE_NORTH, 1))
		1675	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1676
		1677	if (y1 < 0) // entirely above
		1678	return;
		1679
		1680	y0 = 0;
		1681	}
		1682
		1683	// clip to map below
		1684	if (y1 > m->height)
		1685	{
		1686	if (maptile *tile = m->tile_available (TILE_SOUTH, 1))
		1687	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1688
		1689	if (y0 > m->height) // entirely below
		1690	return;
		1691
		1692	y1 = m->height;
		1693	}
		1694
		1695	// if we get here, the rect is within the current map
		1696	maprect *r = (maprect *)buf.alloc (sizeof (maprect));
		1697
		1698	r->m = m;
		1699	r->x0 = x0;
		1700	r->y0 = y0;
		1701	r->x1 = x1;
		1702	r->y1 = y1;
		1703	r->dx = dx;
		1704	r->dy = dy;
		1705	}
		1706
		1707	maprect *
		1708	maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
		1709	{
		1710	buf.clear ();
		1711
		1712	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1713
		1714	// add end marker
		1715	maprect *r = (maprect *)buf.alloc (sizeof (maprect));
		1716	r->m = 0;
		1717
		1718	return (maprect *)buf.linearise ();
		1719	}
		1720

Diff Legend

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