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.61 by root, Sun Dec 31 17:17:22 2006 UTC vs.
Revision 1.210 by root, Sat May 7 13:25:02 2011 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3		3	*
		4	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4	Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
8	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
9	the Free Software Foundation; either version 2 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
10	(at your option) any later version.	11	* option) any later version.
11		12	*
12	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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	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
18	along with this program; if not, write to the Free Software	19	* and the GNU General Public License along with this program. If not, see
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* <http://www.gnu.org/licenses/>.
20		21	*
21	The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	#include <global.h>
25	#include <funcpoint.h>
26
27	#include <loader.h>
28	#include <unistd.h>	25	#include <unistd.h>
29		26
		27	#include "global.h"
30	#include "path.h"	28	#include "path.h"
31		29
32	/*	30	//+GPL
33	* This makes a path absolute outside the world of Crossfire.
34	* In other words, it prepends LIBDIR/MAPDIR/ to the given path
35	* and returns the pointer to a static array containing the result.
36	* it really should be called create_mapname
37	*/
38	const char *
39	create_pathname (const char *name)
40	{
41	static char buf[MAX_BUF];
42		31
43	/* Why? having extra / doesn't confuse unix anyplace? Dependancies	32	sint8 maptile::outdoor_darkness;
44	* someplace else in the code? msw 2-17-97
45	*/
46	if (*name == '/')
47	sprintf (buf, "%s/%s%s", settings.datadir, settings.mapdir, name);
48	else
49	sprintf (buf, "%s/%s/%s", settings.datadir, settings.mapdir, name);
50	return (buf);
51	}
52
53	/*
54	* same as create_pathname, but for the overlay maps.
55	*/
56	const char *
57	create_overlay_pathname (const char *name)
58	{
59	static char buf[MAX_BUF];
60
61	/* Why? having extra / doesn't confuse unix anyplace? Dependancies
62	* someplace else in the code? msw 2-17-97
63	*/
64	if (*name == '/')
65	sprintf (buf, "%s/%s%s", settings.localdir, settings.mapdir, name);
66	else
67	sprintf (buf, "%s/%s/%s", settings.localdir, settings.mapdir, name);
68	return (buf);
69	}
70
71	/*
72	* same as create_pathname, but for the template maps.
73	*/
74	const char *
75	create_template_pathname (const char *name)
76	{
77	static char buf[MAX_BUF];
78
79	/* Why? having extra / doesn't confuse unix anyplace? Dependancies
80	* someplace else in the code? msw 2-17-97
81	*/
82	if (*name == '/')
83	sprintf (buf, "%s/%s%s", settings.localdir, settings.templatedir, name);
84	else
85	sprintf (buf, "%s/%s/%s", settings.localdir, settings.templatedir, name);
86	return (buf);
87	}
88
89	/*
90	* This makes absolute path to the itemfile where unique objects
91	* will be saved. Converts '/' to '@'. I think it's essier maintain
92	* files than full directory structure, but if this is problem it can
93	* be changed.
94	*/
95	static const char *
96	create_items_path (const char *s)
97	{
98	static char buf[MAX_BUF];
99	char *t;
100
101	if (*s == '/')
102	s++;
103
104	sprintf (buf, "%s/%s/", settings.localdir, settings.uniquedir);
105
106	for (t = buf + strlen (buf); *s; s++, t++)
107	if (*s == '/')
108	*t = '@';
109	else
110	*t = *s;
111	*t = 0;
112	return (buf);
113	}
114
115	/*
116	* This function checks if a file with the given path exists.
117	* -1 is returned if it fails, otherwise the mode of the file
118	* is returned.
119	* It tries out all the compression suffixes listed in the uncomp[] array.
120	*
121	* If prepend_dir is set, then we call create_pathname (which prepends
122	* libdir & mapdir). Otherwise, we assume the name given is fully
123	* complete.
124	* Only the editor actually cares about the writablity of this -
125	* the rest of the code only cares that the file is readable.
126	* when the editor goes away, the call to stat should probably be
127	* replaced by an access instead (similar to the windows one, but
128	* that seems to be missing the prepend_dir processing
129	*/
130	int
131	check_path (const char *name, int prepend_dir)
132	{
133	char buf[MAX_BUF];
134
135	char *endbuf;
136	struct stat statbuf;
137	int mode = 0;
138
139	if (prepend_dir)
140	strcpy (buf, create_pathname (name));
141	else
142	strcpy (buf, name);
143
144	/* old method (strchr(buf, '\0')) seemd very odd to me -
145	* this method should be equivalant and is clearer.
146	* Can not use strcat because we need to cycle through
147	* all the names.
148	*/
149	endbuf = buf + strlen (buf);
150
151	if (stat (buf, &statbuf))
152	return -1;
153	if (!S_ISREG (statbuf.st_mode))
154	return (-1);
155
156	if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
157	((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
158	mode |= 4;
159
160	if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
161	(statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
162	mode |= 2;
163
164	return (mode);
165	}
166		33
167	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	34	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
168	* one function that just returns a P_.. value (see map.h)	35	* one function that just returns a P_.. value (see map.h)
169	* it will also do map translation for tiled maps, returning	36	* it will also do map translation for tiled maps, returning
170	* 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
…		…
205	* by the caller.	72	* by the caller.
206	*/	73	*/
207	int	74	int
208	blocked_link (object *ob, maptile *m, int sx, int sy)	75	blocked_link (object *ob, maptile *m, int sx, int sy)
209	{	76	{
210	object *tmp;
211	int mflags, blocked;
212
213	/* 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
214	* have already checked this.	78	* have already checked this.
215	*/	79	*/
216	if (OUT_OF_REAL_MAP (m, sx, sy))	80	if (OUT_OF_REAL_MAP (m, sx, sy))
217	{	81	{
218	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");
219	return 1;	83	return 1;
220	}	84	}
221		85
222	/* Save some cycles - instead of calling get_map_flags(), just get the value	86	mapspace &ms = m->at (sx, sy);
223	* directly.
224	*/
225	mflags = m->at (sx, sy).flags ();
226		87
227	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);	88	int mflags = ms.flags ();
		89	int blocked = ms.move_block;
228		90
229	/* If space is currently not blocked by anything, no need to	91	/* If space is currently not blocked by anything, no need to
230	* go further. Not true for players - all sorts of special	92	* go further. Not true for players - all sorts of special
231	* things we need to do for players.	93	* things we need to do for players.
232	*/	94	*/
233	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	95	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
234	return 0;	96	return 0;
235		97
236	/* 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
237	* 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
238	* 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
239	* or another. Likewise, only if something is blocking us do we	101	* or another. Likewise, only if something is blocking us do we
240	* need to investigate if there is a special circumstance that would	102	* need to investigate if there is a special circumstance that would
241	* let the player through (inventory checkers for example)	103	* let the player through (inventory checkers for example)
242	*/	104	*/
243	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))	105	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
244	return 0;	106	return 0;
245		107
246	if (ob->head != NULL)
247	ob = ob->head;	108	ob = ob->head_ ();
248		109
249	/* 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
250	* 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
251	* true. If we get through the entire stack, that must mean	112	* true. If we get through the entire stack, that must mean
252	* ob is blocking it, so return 0.	113	* ob is blocking it, so return 0.
253	*/	114	*/
254	for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)	115	for (object *tmp = ms.top; tmp; tmp = tmp->below)
255	{	116	{
256		117	if (OB_MOVE_BLOCK (ob, tmp))
257	/* This must be before the checks below. Code for inventory checkers. */
258	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
259	{	118	{
260	/* If last_sp is set, the player/monster needs an object,	119	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
261	* so we check for it. If they don't have it, they can't	120	if (RESULT_INT (0))
262	* pass through this space.	121	return 1;
263	*/	122	else
264	if (tmp->last_sp)	123	continue;
		124
		125	if (tmp->type == CHECK_INV)
265	{	126	{
266	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))
267	return 1;	131	return 1;
268	else	132	}
269	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;
270	}	142	}
271	else	143	else
272	{	144	return 1; // unconditional block
273	/* In this case, the player must not have the object -	145
274	* if they do, they can't pass through.
275	*/
276	if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
277	return 1;
278	else
279	continue;
280	}
281	} /* if check_inv */
282	else	146	} else {
283	{	147	// space does not block the ob, directly, but
284	/* Broke apart a big nasty if into several here to make	148	// anything alive that is not a door still
285	* this more readable. first check - if the space blocks	149	// blocks anything
286	* movement, can't move here.	150
287	* second - if a monster, can't move there, unles it is a	151	if (tmp->flag [FLAG_ALIVE]
288	* hidden dm	152	&& tmp->type != DOOR
289	*/	153	&& tmp->head_ () != ob) //TODO: maybe move these check up?
290	if (OB_MOVE_BLOCK (ob, tmp))
291	return 1;
292	if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob &&
293	tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden))
294	return 1;	154	return 1;
295	}	155	}
296
297	}	156	}
		157
298	return 0;	158	return 0;
299	}	159	}
300		160
301
302	/*	161	/*
303	* 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
304	* This is meant for multi space objects - for single space objecs,	163	* spot. This is meant for multi space objects - for single space objecs,
305	* just calling get_map_blocked and checking that against movement type	164	* just calling get_map_blocked and checking that against movement type
306	* of object. This function goes through all the parts of the	165	* of object. This function goes through all the parts of the multipart
307	* multipart object and makes sure they can be inserted.	166	* object and makes sure they can be inserted.
308	*	167	*
309	* 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.
310	*	169	*
311	* This function has been used to deprecate arch_out_of_map -	170	* This function has been used to deprecate arch_out_of_map -
312	* this function also does that check, and since in most cases,	171	* this function also does that check, and since in most cases,
…		…
323	*	182	*
324	* Note this used to be arch_blocked, but with new movement	183	* Note this used to be arch_blocked, but with new movement
325	* 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
326	* against the move_block values.	185	* against the move_block values.
327	*/	186	*/
328	int	187	bool
329	ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y)	188	object::blocked (maptile *m, int x, int y) const
330	{	189	{
331	archetype *tmp;	190	for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
332	int flag;
333	maptile *m1;
334	sint16 sx, sy;
335
336	if (!ob)
337	{
338	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
339	if (flag & P_OUT_OF_MAP)
340	return P_OUT_OF_MAP;
341
342	/* don't have object, so don't know what types would block */
343	return m1->at (sx, sy).move_block;
344	}	191	{
		192	mapxy pos (m, x + tmp->x, y + tmp->y);
345		193
346	for (tmp = ob->arch; tmp; tmp = tmp->more)	194	if (!pos.normalise ())
347	{	195	return 1;
348	flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
349		196
350	if (flag & P_OUT_OF_MAP)	197	mapspace &ms = *pos;
351	return P_OUT_OF_MAP;	198
352	if (flag & P_IS_ALIVE)	199	if (ms.flags () & P_IS_ALIVE)
353	return P_IS_ALIVE;	200	return 1;
354		201
355	mapspace &ms = m1->at (sx, sy);	202	/* However, often ob doesn't have any move type
356		203	* (signifying non-moving objects)
357	/* find_first_free_spot() calls this function. However, often
358	* ob doesn't have any move type (when used to place exits)
359	* 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.
360	*/	205	*/
361
362	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	206	if (!move_type && ms.move_block != MOVE_ALL)
363	continue;	207	continue;
364		208
365	/* 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
366	* head of the object should correspond for the entire object.	210	* head of the object should correspond for the entire object.
367	*/	211	*/
368	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	212	if (ms.blocks (move_type))
369	return P_NO_PASS;	213	return 1;
370	}	214	}
371		215
372	return 0;	216	return 0;
373	}	217	}
374		218
375	/* When the map is loaded, load_object does not actually insert objects	219	//-GPL
376	* into inventory, but just links them. What this does is go through
377	* and insert them properly.
378	* The object 'container' is the object that contains the inventory.
379	* This is needed so that we can update the containers weight.
380	*/
381	void
382	fix_container (object *container)
383	{
384	object *tmp = container->inv, *next;
385		220
386	container->inv = 0;	221	void
387	while (tmp)	222	maptile::set_object_flag (int flag, int value)
388	{	223	{
389	next = tmp->below;	224	if (!spaces)
390	if (tmp->inv)	225	return;
391	fix_container (tmp);
392		226
393	insert_ob_in_ob (tmp, container);	227	for (mapspace *ms = spaces + size (); ms-- > spaces; )
394	tmp = next;	228	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
395	}	229	tmp->flag [flag] = value;
396
397	/* sum_weight will go through and calculate what all the containers are
398	* carrying.
399	*/
400	sum_weight (container);
401	}	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
402		259
403	/* 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
404	* 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
405	* 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
406	* they are saved). We do have to look for the old maps that did save	263	* they are saved).
407	* the more sections and not re-add sections for them.
408	*/	264	*/
409	void	265	void
410	maptile::link_multipart_objects ()	266	maptile::link_multipart_objects ()
411	{	267	{
412	if (!spaces)	268	if (!spaces)
413	return;	269	return;
414		270
415	for (mapspace *ms = spaces + size (); ms-- > spaces; )	271	for (mapspace *ms = spaces + size (); ms-- > spaces; )
416	for (object *tmp = ms->bot; tmp; )	272	{
		273	object *op = ms->bot;
		274	while (op)
417	{	275	{
418	object *above = tmp->above;
419
420	/* already multipart - don't do anything more */	276	/* already multipart - don't do anything more */
421	if (!tmp->head && !tmp->more)	277	if (op->head_ () == op && !op->more && op->arch->more)
422	{
423	/* If there is nothing more to this object, this for loop
424	* won't do anything.
425	*/
426	archetype *at;
427	object *last, *op;
428	for (at = tmp->arch->more, last = tmp;
429	at;
430	at = at->more, last = op)
431	{	278	{
432	op = arch_to_object (at);	279	op->remove ();
		280	op->expand_tail ();
433		281
434	/* update x,y coordinates */	282	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
435	op->x += tmp->x;	283	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
436	op->y += tmp->y;	284	// below the pentagrams... hopefully INS_ON_TOP doesn't break anything
437	op->head = tmp;
438	op->map = this;
439	last->more = op;
440	op->name = tmp->name;
441	op->title = tmp->title;
442
443	/* we could link all the parts onto tmp, and then just
444	* call insert_ob_in_map once, but the effect is the same,
445	* as insert_ob_in_map will call itself with each part, and
446	* the coding is simpler to just to it here with each part.
447	*/
448	insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON);	285	insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
		286
		287	op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
		288	// so we have to reset the iteration through the mapspace
449	}	289	}
		290	else
		291	op = op->above;
450	}	292	}
451
452	tmp = above;
453	}	293	}
454	}	294	}
		295
		296	//-GPL
455		297
456	/*	298	/*
457	* 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
458	* file pointer.	300	* file pointer.
459	* mapflags is the same as we get with load_original_map
460	*/	301	*/
461	bool	302	bool
462	maptile::load_objects (object_thawer &thawer)	303	maptile::_load_objects (object_thawer &f)
463	{	304	{
464	int unique;	305	for (;;)
465	object *op, *prev = NULL, *last_more = NULL, *otmp;
466
467	op = object::create ();
468	op->map = this; /* To handle buttons correctly */
469
470	while (int i = load_object (thawer, op, 0))
471	{	306	{
472	/* if the archetype for the object is null, means that we	307	coroapi::cede_to_tick (); // cede once in a while
473	* got an invalid object. Don't do anything with it - the game	308
474	* or editor will not be able to do anything with it either.	309	switch (f.kw)
475	*/
476	if (op->arch == NULL)
477	{	310	{
478	LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");	311	case KW_arch:
		312	if (object *op = object::read (f, this))
		313	{
		314	// TODO: why?
		315	if (op->inv)
		316	{
		317	op->carrying = 0;
		318	op->update_weight ();
		319	}
		320
		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	}
		344	}
		345
479	continue;	346	continue;
480	}
481		347
482	switch (i)
483	{
484	case LL_NORMAL:
485	insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
486
487	if (op->inv)
488	sum_weight (op);
489
490	prev = op, last_more = op;
491	break;
492
493	case LL_MORE:	348	case KW_EOF:
494	insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY);	349	return true;
495	op->head = prev, last_more->more = op, last_more = op;	350
		351	default:
		352	if (!f.parse_error ("map file"))
		353	return false;
496	break;	354	break;
497	}	355	}
498		356
499	op = object::create ();	357	f.next ();
500	op->map = this;
501	}
502
503	op->destroy ();
504
505	#if 0
506	for (i = 0; i < width; i++)
507	for (j = 0; j < height; j++)
508	{
509	unique = 0;
510	/* check for unique items, or unique squares */
511	for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
512	{
513	if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
514	unique = 1;
515
516	if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
517	SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
518	}
519	}	358	}
520	#endif
521		359
522	return true;	360	return true;
523	}	361	}
524		362
525	void	363	void
526	maptile::activate ()	364	maptile::activate ()
527	{	365	{
528	if (!spaces)	366	if (state != MAP_INACTIVE)
529	return;	367	return;
530		368
531	for (mapspace *ms = spaces + size (); ms-- > spaces; )	369	for (mapspace *ms = spaces + size (); ms-- > spaces; )
532	for (object *op = ms->bot; op; op = op->above)	370	for (object *op = ms->bot; op; op = op->above)
533	op->activate_recursive ();	371	op->activate_recursive ();
		372
		373	state = MAP_ACTIVE;
		374
		375	activate_physics ();
534	}	376	}
535		377
536	void	378	void
537	maptile::deactivate ()	379	maptile::deactivate ()
538	{	380	{
539	if (!spaces)	381	if (state != MAP_ACTIVE)
540	return;	382	return;
541		383
542	for (mapspace *ms = spaces + size (); ms-- > spaces; )	384	for (mapspace *ms = spaces + size (); ms-- > spaces; )
543	for (object *op = ms->bot; op; op = op->above)	385	for (object *op = ms->bot; op; op = op->above)
544	op->deactivate_recursive ();	386	op->deactivate_recursive ();
		387
		388	state = MAP_INACTIVE;
545	}	389	}
546		390
547	bool	391	bool
548	maptile::save_objects (object_freezer &freezer, int flags)	392	maptile::_save_objects (object_freezer &f, int flags)
549	{	393	{
		394	coroapi::cede_to_tick ();
		395
550	if (flags & IO_HEADER)	396	if (flags & IO_HEADER)
551	save_header (freezer);	397	_save_header (f);
552		398
553	if (!spaces)	399	if (!spaces)
554	return false;	400	return false;
555		401
556	for (int i = 0; i < size (); ++i)	402	for (int i = 0; i < size (); ++i)
557	{	403	{
558	int unique = 0;	404	bool unique = 0;
		405
559	for (object *op = spaces [i].bot; op; op = op->above)	406	for (object *op = spaces [i].bot; op; op = op->above)
560	{	407	{
561	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	408	unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
562	unique = 1;
563		409
564	if (!op->can_map_save ())	410	if (expect_false (!op->can_map_save ()))
565	continue;	411	continue;
566		412
567	if (unique || op->flag [FLAG_UNIQUE])	413	if (expect_false (unique || op->flag [FLAG_UNIQUE]))
568	{	414	{
569	if (flags & IO_UNIQUES)	415	if (flags & IO_UNIQUES)
570	save_object (freezer, op, 1);	416	op->write (f);
571	}	417	}
572	else if (flags & IO_OBJECTS)	418	else if (expect_true (flags & IO_OBJECTS))
573	save_object (freezer, op, 1);	419	op->write (f);
574	}	420	}
575	}	421	}
576		422
		423	coroapi::cede_to_tick ();
		424
577	return true;	425	return true;
578	}	426	}
579		427
580	bool	428	bool
581	maptile::load_objects (const char *path, bool skip_header)	429	maptile::_save_objects (const char *path, int flags)
582	{	430	{
583	object_thawer thawer (path);	431	object_freezer freezer;
584		432
585	if (!thawer)	433	if (!_save_objects (freezer, flags))
586	return false;	434	return false;
587		435
588	if (skip_header)
589	for (;;)
590	{
591	keyword kw = thawer.get_kv ();
592
593	if (kw == KW_end)
594	break;
595
596	thawer.skip_kv (kw);
597	}
598
599	return load_objects (thawer);
600	}
601
602	bool
603	maptile::save_objects (const char *path, int flags)
604	{
605	object_freezer freezer;
606
607	if (!save_objects (freezer, flags))
608	return false;
609
610	return freezer.save (path);	436	return freezer.save (path);
611	}	437	}
612		438
613	maptile::maptile ()	439	void
		440	maptile::init ()
614	{	441	{
615	in_memory = MAP_SWAPPED;	442	state = MAP_SWAPPED;
616		443
617	/* 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
618	* map archetype. Mimic that behaviour.	445	* map archetype. Mimic that behaviour.
619	*/	446	*/
620	width = 16;	447	width = 16;
621	height = 16;	448	height = 16;
		449	timeout = 300;
		450	max_items = MAX_ITEM_PER_ACTION;
		451	max_volume = 2000000; // 2m³
622	reset_timeout = 0;	452	reset_timeout = 0;
623	timeout = 300;
624	enter_x = 0;	453	enter_x = 0;
625	enter_y = 0;	454	enter_y = 0;
626	}	455	}
627		456
		457	maptile::maptile ()
		458	{
		459	init ();
		460	}
		461
628	maptile::maptile (int w, int h)	462	maptile::maptile (int w, int h)
629	{	463	{
630	in_memory = MAP_SWAPPED;	464	init ();
631		465
632	width = w;	466	width = w;
633	height = h;	467	height = h;
634	reset_timeout = 0;
635	timeout = 300;
636	enter_x = 0;
637	enter_y = 0;
638		468
639	alloc ();	469	alloc ();
640	}	470	}
641		471
642	/*	472	/*
…		…
650	if (spaces)	480	if (spaces)
651	return;	481	return;
652		482
653	spaces = salloc0<mapspace> (size ());	483	spaces = salloc0<mapspace> (size ());
654	}	484	}
		485
		486	//+GPL
655		487
656	/* 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
657	* 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
658	* at a later date.	490	* at a later date.
659	* Called by parse_map_headers below.	491	* Called by parse_map_headers below.
…		…
736	return items;	568	return items;
737	}	569	}
738		570
739	/* 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
740	* the map (or something equivilent) into output_string. */	572	* the map (or something equivilent) into output_string. */
741	static void	573	static const char *
742	print_shop_string (maptile *m, char *output_string)	574	print_shop_string (maptile *m)
743	{	575	{
744	int i;	576	static dynbuf_text buf; buf.clear ();
745	char tmp[MAX_BUF];	577	bool first = true;
746		578
747	strcpy (output_string, "");
748	for (i = 0; i < m->shopitems[0].index; i++)	579	for (int i = 0; i < m->shopitems[0].index; i++)
749	{	580	{
		581	if (!first)
		582	buf << ';';
		583
		584	first = false;
		585
750	if (m->shopitems[i].typenum)	586	if (m->shopitems[i].typenum)
751	{	587	{
752	if (m->shopitems[i].strength)	588	if (m->shopitems[i].strength)
753	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);
754	else	590	else
755	sprintf (tmp, "%s;", m->shopitems[i].name);	591	buf.printf ("%s", m->shopitems[i].name);
756	}	592	}
757	else	593	else
758	{	594	{
759	if (m->shopitems[i].strength)	595	if (m->shopitems[i].strength)
760	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	596	buf.printf ("*:%d", m->shopitems[i].strength);
761	else	597	else
762	sprintf (tmp, "*");	598	buf.printf ("*");
763	}	599	}
764
765	strcat (output_string, tmp);
766	}	600	}
		601
		602	return buf;
767	}	603	}
		604
		605	//-GPL
768		606
769	/* This loads the header information of the map. The header	607	/* This loads the header information of the map. The header
770	* contains things like difficulty, size, timeout, etc.	608	* contains things like difficulty, size, timeout, etc.
771	* 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
772	* addition of tiling, fields beyond that easily named in an	610	* addition of tiling, fields beyond that easily named in an
…		…
776	* This could be done in lex (like the object loader), but I think	614	* This could be done in lex (like the object loader), but I think
777	* currently, there are few enough fields this is not a big deal.	615	* currently, there are few enough fields this is not a big deal.
778	* MSW 2001-07-01	616	* MSW 2001-07-01
779	*/	617	*/
780	bool	618	bool
781	maptile::load_header (object_thawer &thawer)	619	maptile::_load_header (object_thawer &thawer)
782	{	620	{
783	char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
784	int msgpos = 0;
785	int maplorepos = 0;
786
787	for (;;)	621	for (;;)
788	{	622	{
789	keyword kw = thawer.get_kv ();
790
791	switch (kw)	623	switch (thawer.kw)
792	{	624	{
793	case KW_EOF:
794	LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
795	return false;
796
797	case KW_end:
798	return true;
799
800	case KW_msg:	625	case KW_msg:
801	thawer.get_ml (KW_endmsg, msg);	626	thawer.get_ml (KW_endmsg, msg);
802	break;	627	break;
803		628
804	case KW_lore: // CF+ extension	629	case KW_lore: // deliantra extension
805	thawer.get_ml (KW_endlore, maplore);	630	thawer.get_ml (KW_endlore, maplore);
806	break;	631	break;
807		632
808	case KW_maplore:	633	case KW_maplore:
809	thawer.get_ml (KW_endmaplore, maplore);	634	thawer.get_ml (KW_endmaplore, maplore);
…		…
826	case KW_shopgreed: thawer.get (shopgreed); break;	651	case KW_shopgreed: thawer.get (shopgreed); break;
827	case KW_shopmin: thawer.get (shopmin); break;	652	case KW_shopmin: thawer.get (shopmin); break;
828	case KW_shopmax: thawer.get (shopmax); break;	653	case KW_shopmax: thawer.get (shopmax); break;
829	case KW_shoprace: thawer.get (shoprace); break;	654	case KW_shoprace: thawer.get (shoprace); break;
830	case KW_outdoor: thawer.get (outdoor); break;	655	case KW_outdoor: thawer.get (outdoor); break;
831	case KW_temp: thawer.get (temp); break;
832	case KW_pressure: thawer.get (pressure); break;
833	case KW_humid: thawer.get (humid); break;
834	case KW_windspeed: thawer.get (windspeed); break;
835	case KW_winddir: thawer.get (winddir); break;
836	case KW_sky: thawer.get (sky); break;
837		656
838	case KW_per_player: thawer.get (per_player); break;	657	case KW_per_player: thawer.get (per_player); break;
839	case KW_per_party: thawer.get (per_party); break;	658	case KW_per_party: thawer.get (per_party); break;
		659	case KW_no_reset: thawer.get (no_reset); break;
		660	case KW_no_drop: thawer.get (no_drop); break;
840		661
841	case KW_region: get_region_by_name (thawer.get_str ()); break;	662	case KW_region: thawer.get (default_region); break;
842	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	663	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
843		664
844	// old names new names	665	// old names new names
845	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;
846	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;
…		…
854		675
855	case KW_tile_path_1: thawer.get (tile_path [0]); break;	676	case KW_tile_path_1: thawer.get (tile_path [0]); break;
856	case KW_tile_path_2: thawer.get (tile_path [1]); break;	677	case KW_tile_path_2: thawer.get (tile_path [1]); break;
857	case KW_tile_path_3: thawer.get (tile_path [2]); break;	678	case KW_tile_path_3: thawer.get (tile_path [2]); break;
858	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;
		682
		683	case KW_ERROR:
		684	set_key_text (thawer.kw_str, thawer.value);
		685	break;
		686
		687	case KW_end:
		688	thawer.next ();
		689	return true;
859		690
860	default:	691	default:
861	LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]);	692	if (!thawer.parse_error ("map"))
		693	return false;
862	break;	694	break;
863	}	695	}
		696
		697	thawer.next ();
864	}	698	}
865		699
866	abort ();	700	abort ();
867	}	701	}
868		702
869	bool	703	//+GPL
870	maptile::load_header (const char *path)
871	{
872	object_thawer thawer (path);
873
874	if (!thawer)
875	return false;
876
877	return load_header (thawer);
878	}
879		704
880	/******************************************************************************	705	/******************************************************************************
881	* This is the start of unique map handling code	706	* This is the start of unique map handling code
882	*****************************************************************************/	707	*****************************************************************************/
883		708
…		…
890	int unique = 0;	715	int unique = 0;
891	for (object *op = spaces [i].bot; op; )	716	for (object *op = spaces [i].bot; op; )
892	{	717	{
893	object *above = op->above;	718	object *above = op->above;
894		719
895	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	720	if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
896	unique = 1;	721	unique = 1;
897		722
898	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))	723	if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique))
899	{
900	op->destroy_inv (false);
901	op->destroy ();	724	op->destroy ();
902	}
903		725
904	op = above;	726	op = above;
905	}	727	}
906	}	728	}
907	}	729	}
908		730
		731	//-GPL
		732
909	bool	733	bool
910	maptile::save_header (object_freezer &freezer)	734	maptile::_save_header (object_freezer &freezer)
911	{	735	{
912	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	736	#define MAP_OUT(k) freezer.put (KW(k), k)
913	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)	737	#define MAP_OUT2(k,v) freezer.put (KW(k), v)
914		738
915	MAP_OUT2 (arch, "map");	739	MAP_OUT2 (arch, CS(map));
916		740
917	if (name) MAP_OUT (name);	741	if (name) MAP_OUT (name);
918	MAP_OUT (swap_time);	742	MAP_OUT (swap_time);
919	MAP_OUT (reset_time);	743	MAP_OUT (reset_time);
920	MAP_OUT (reset_timeout);	744	MAP_OUT (reset_timeout);
921	MAP_OUT (fixed_resettime);	745	MAP_OUT (fixed_resettime);
		746	MAP_OUT (no_reset);
		747	MAP_OUT (no_drop);
922	MAP_OUT (difficulty);	748	MAP_OUT (difficulty);
923
924	if (region) MAP_OUT2 (region, region->name);	749	if (default_region) MAP_OUT2 (region, default_region->name);
925		750
926	if (shopitems)	751	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
927	{
928	char shop[MAX_BUF];
929	print_shop_string (this, shop);
930	MAP_OUT2 (shopitems, shop);
931	}
932
933	MAP_OUT (shopgreed);	752	MAP_OUT (shopgreed);
934	MAP_OUT (shopmin);	753	MAP_OUT (shopmin);
935	MAP_OUT (shopmax);	754	MAP_OUT (shopmax);
936	if (shoprace) MAP_OUT (shoprace);	755	if (shoprace) MAP_OUT (shoprace);
937	MAP_OUT (darkness);	756
938	MAP_OUT (width);	757	MAP_OUT (width);
939	MAP_OUT (height);	758	MAP_OUT (height);
940	MAP_OUT (enter_x);	759	MAP_OUT (enter_x);
941	MAP_OUT (enter_y);	760	MAP_OUT (enter_y);
942		761	MAP_OUT (darkness);
943	if (msg) freezer.put (KW_msg , KW_endmsg , msg);
944	if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
945
946	MAP_OUT (outdoor);	762	MAP_OUT (outdoor);
947	MAP_OUT (temp);	763
948	MAP_OUT (pressure);	764	if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
949	MAP_OUT (humid);	765	if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
950	MAP_OUT (windspeed);
951	MAP_OUT (winddir);
952	MAP_OUT (sky);
953		766
954	MAP_OUT (per_player);	767	MAP_OUT (per_player);
955	MAP_OUT (per_party);	768	MAP_OUT (per_party);
956		769
957	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]);
958	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]);
959	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]);
960	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]);
961		776
		777	freezer.put (this);
962	freezer.put (KW_end);	778	freezer.put (KW(end));
963		779
964	return true;	780	return true;
965	}	781	}
966		782
967	bool	783	bool
968	maptile::save_header (const char *path)	784	maptile::_save_header (const char *path)
969	{	785	{
970	object_freezer freezer;	786	object_freezer freezer;
971		787
972	if (!save_header (freezer))	788	if (!_save_header (freezer))
973	return false;	789	return false;
974		790
975	return freezer.save (path);	791	return freezer.save (path);
976	}	792	}
		793
		794	//+GPL
977		795
978	/*	796	/*
979	* Remove and free all objects in the given map.	797	* Remove and free all objects in the given map.
980	*/	798	*/
981	void	799	void
982	maptile::clear ()	800	maptile::clear ()
983	{	801	{
984	if (!spaces)	802	if (spaces)
985	return;	803	{
986
987	for (mapspace *ms = spaces + size (); ms-- > spaces; )	804	for (mapspace *ms = spaces + size (); ms-- > spaces; )
988	while (object *op = ms->bot)	805	while (object *op = ms->bot)
989	{	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
		813	object *head = op->head_ ();
990	if (op->head)	814	if (op == head)
991	op = op->head;
992
993	op->destroy_inv (false);
994	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	}
		821	}
		822
		823	sfree0 (spaces, size ());
995	}	824	}
996
997	sfree (spaces, size ()), spaces = 0;
998		825
999	if (buttons)	826	if (buttons)
1000	free_objectlinkpt (buttons), buttons = 0;	827	free_objectlinkpt (buttons), buttons = 0;
		828
		829	sfree0 (regions, size ());
		830	delete [] regionmap; regionmap = 0;
1001	}	831	}
1002		832
1003	void	833	void
1004	maptile::clear_header ()	834	maptile::clear_header ()
1005	{	835	{
…		…
1007	msg = 0;	837	msg = 0;
1008	maplore = 0;	838	maplore = 0;
1009	shoprace = 0;	839	shoprace = 0;
1010	delete [] shopitems, shopitems = 0;	840	delete [] shopitems, shopitems = 0;
1011		841
1012	for (int i = 0; i < 4; i++)	842	for (int i = 0; i < array_length (tile_path); i++)
1013	tile_path [i] = 0;	843	tile_path [i] = 0;
1014	}	844	}
1015		845
1016	maptile::~maptile ()	846	maptile::~maptile ()
1017	{	847	{
…		…
1024	/* 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
1025	* are pointing at this one for tiling information. Since	855	* are pointing at this one for tiling information. Since
1026	* 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
1027	* maps this map tiles with and clears those.	857	* maps this map tiles with and clears those.
1028	*/	858	*/
1029	for (int i = 0; i < 4; i++)	859	for (int i = 0; i < array_length (tile_path); i++)
1030	if (tile_map[i] == m)	860	if (tile_map[i] == m)
1031	tile_map[i] = 0;	861	tile_map[i] = 0;
1032	}	862	}
1033		863
1034	void	864	void
…		…
1037	attachable::do_destroy ();	867	attachable::do_destroy ();
1038		868
1039	clear ();	869	clear ();
1040	}	870	}
1041		871
1042	/*	872	/* decay and destroy perishable items in a map */
1043	* Updates every button on the map (by calling update_button() for them).	873	// TODO: should be done regularly, not on map load?
1044	*/
1045	void	874	void
1046	maptile::update_buttons ()	875	maptile::do_decay_objects ()
1047	{	876	{
1048	for (oblinkpt *obp = buttons; obp; obp = obp->next)	877	if (!spaces)
1049	for (objectlink *ol = obp->link; ol; ol = ol->next)	878	return;
		879
		880	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		881	for (object *above, *op = ms->bot; op; op = above)
1050	{	882	{
1051	if (!ol->ob)	883	above = op->above;
		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
		889	bool destroy = 0;
		890
		891	if (op->flag [FLAG_IS_FLOOR]
		892	|| op->flag [FLAG_OBJ_ORIGINAL]
		893	|| op->flag [FLAG_UNIQUE]
		894	|| op->flag [FLAG_OVERLAY_FLOOR]
		895	|| op->flag [FLAG_UNPAID]
		896	|| op->is_alive ())
		897	; // do not decay
		898	else if (op->is_weapon ())
1052	{	899	{
1053	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",	900	op->stats.dam--;
1054	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);	901	if (op->stats.dam < 0)
1055	continue;	902	destroy = 1;
1056	}	903	}
1057		904	else if (op->is_armor ())
1058	if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
1059	{	905	{
1060	update_button (ol->ob);	906	op->stats.ac--;
1061	break;	907	if (op->stats.ac < 0)
		908	destroy = 1;
1062	}	909	}
		910	else if (op->type == FOOD)
		911	{
		912	op->stats.food -= rndm (5, 20);
		913	if (op->stats.food < 0)
		914	destroy = 1;
		915	}
		916	else
		917	{
		918	int mat = op->materials;
		919
		920	if (mat & M_PAPER
		921	|| mat & M_LEATHER
		922	|| mat & M_WOOD
		923	|| mat & M_ORGANIC
		924	|| mat & M_CLOTH
		925	|| mat & M_LIQUID
		926	|| (mat & M_IRON && rndm (1, 5) == 1)
		927	|| (mat & M_GLASS && rndm (1, 2) == 1)
		928	|| ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
		929	|| ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
		930	//|| (mat & M_ICE && temp > 32)
		931	)
		932	destroy = 1;
		933	}
		934
		935	/* adjust overall chance below */
		936	if (destroy && rndm (0, 1))
		937	op->destroy ();
1063	}	938	}
1064	}	939	}
1065		940
1066	/*	941	/*
1067	* 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.
1068	* difficulty does not have a lot to do with character level,	943	* difficulty does not have a lot to do with character level,
1069	* 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.
1070	*	945	*
1071	* 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
1072	* 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
1073	* have a difficulty set than using this function - human calculation	948	* have a difficulty set rather than using this function - human calculation
1074	* is much better than this functions guesswork.	949	* is much better than this function's guesswork.
1075	*/	950	*/
1076	int	951	int
1077	maptile::estimate_difficulty () const	952	maptile::estimate_difficulty () const
1078	{	953	{
1079	long monster_cnt = 0;	954	long monster_cnt = 0;
…		…
1081	sint64 total_exp = 0;	956	sint64 total_exp = 0;
1082		957
1083	for (mapspace *ms = spaces + size (); ms-- > spaces; )	958	for (mapspace *ms = spaces + size (); ms-- > spaces; )
1084	for (object *op = ms->bot; op; op = op->above)	959	for (object *op = ms->bot; op; op = op->above)
1085	{	960	{
1086	if (QUERY_FLAG (op, FLAG_MONSTER))	961	if (op->flag [FLAG_MONSTER])
1087	{	962	{
1088	total_exp += op->stats.exp;	963	total_exp += op->stats.exp;
1089	monster_cnt++;	964	monster_cnt++;
1090	}	965	}
1091		966
1092	if (QUERY_FLAG (op, FLAG_GENERATOR))	967	if (op->flag [FLAG_GENERATOR])
1093	{	968	{
1094	total_exp += op->stats.exp;	969	total_exp += op->stats.exp;
1095		970
1096	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	971	if (archetype *at = op->other_arch)
		972	{
1097	total_exp += at->clone.stats.exp * 8;	973	total_exp += at->stats.exp * 8;
1098
1099	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	}
1100	}	982	}
1101	}	983	}
1102		984
1103	avgexp = (double) total_exp / monster_cnt;	985	avgexp = (double) total_exp / monster_cnt;
1104		986
…		…
1117	* postive values make it darker, negative make it brighter	999	* postive values make it darker, negative make it brighter
1118	*/	1000	*/
1119	int	1001	int
1120	maptile::change_map_light (int change)	1002	maptile::change_map_light (int change)
1121	{	1003	{
1122	int new_level = darkness + change;
1123
1124	/* Nothing to do */	1004	/* Nothing to do */
1125	if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	1005	if (!change)
1126	return 0;	1006	return 0;
1127		1007
1128	/* inform all players on the map */	1008	/* inform all players on the map */
1129	if (change > 0)	1009	if (change > 0)
1130	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");	1010	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1131	else	1011	else
1132	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");	1012	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1133		1013
1134	/* Do extra checking. since darkness is a unsigned value,	1014	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1135	* we need to be extra careful about negative values.
1136	* In general, the checks below are only needed if change
1137	* is not +/-1
1138	*/
1139	if (new_level < 0)
1140	darkness = 0;
1141	else if (new_level >= MAX_DARKNESS)
1142	darkness = MAX_DARKNESS;
1143	else
1144	darkness = new_level;
1145		1015
1146	/* All clients need to get re-updated for the change */	1016	/* All clients need to get re-updated for the change */
1147	update_all_map_los (this);	1017	update_all_map_los (this);
		1018
1148	return 1;	1019	return 1;
1149	}	1020	}
1150		1021
1151	/*	1022	/*
1152	* This function updates various attributes about a specific space	1023	* This function updates various attributes about a specific space
…		…
1155	* through, etc)	1026	* through, etc)
1156	*/	1027	*/
1157	void	1028	void
1158	mapspace::update_ ()	1029	mapspace::update_ ()
1159	{	1030	{
1160	object *tmp, *last = 0;	1031	object *last = 0;
1161	uint8 flags = 0, light = 0, anywhere = 0;	1032	uint8 flags = P_UPTODATE;
1162	New_Face *top, *floor, *middle;	1033	sint8 light = 0;
1163	object *top_obj, *floor_obj, *middle_obj;
1164	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;
1165		1039
1166	middle = blank_face;	1040	//object *middle = 0;
1167	top = blank_face;	1041	//object *top = 0;
1168	floor = blank_face;	1042	//object *floor = 0;
		1043	// this seems to generate better code than using locals, above
		1044	object *&top = faces_obj[0] = 0;
		1045	object *&middle = faces_obj[1] = 0;
		1046	object *&floor = faces_obj[2] = 0;
1169		1047
1170	middle_obj = 0;	1048	object::flags_t allflags; // all flags of all objects or'ed together
1171	top_obj = 0;
1172	floor_obj = 0;
1173		1049
1174	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1050	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1175	{	1051	{
1176	/* This could be made additive I guess (two lights better than	1052	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1177	* one). But if so, it shouldn't be a simple additive - 2
1178	* light bulbs do not illuminate twice as far as once since
1179	* it is a dissapation factor that is cubed.
1180	*/
1181	if (tmp->glow_radius > light)
1182	light = tmp->glow_radius;	1053	light += tmp->glow_radius;
1183		1054
1184	/* This call is needed in order to update objects the player	1055	/* This call is needed in order to update objects the player
1185	* is standing in that have animations (ie, grass, fire, etc).	1056	* is standing in that have animations (ie, grass, fire, etc).
1186	* However, it also causes the look window to be re-drawn	1057	* However, it also causes the look window to be re-drawn
1187	* 3 times each time the player moves, because many of the	1058	* 3 times each time the player moves, because many of the
1188	* functions the move_player calls eventualy call this.	1059	* functions the move_player calls eventualy call this.
1189	*	1060	*
1190	* Always put the player down for drawing.	1061	* Always put the player down for drawing.
1191	*/	1062	*/
1192	if (!tmp->invisible)	1063	if (expect_true (!tmp->invisible))
1193	{	1064	{
1194	if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))	1065	if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]))
1195	{
1196	top = tmp->face;
1197	top_obj = tmp;	1066	top = tmp;
1198	}	1067	else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1199	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1200	{	1068	{
1201	/* 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,
1202	* so should not be visible, so we clear them.	1070	* so should not be visible, so we clear them.
1203	*/	1071	*/
1204	middle = blank_face;	1072	middle = 0;
1205	top = blank_face;	1073	top = 0;
1206	floor = tmp->face;
1207	floor_obj = tmp;	1074	floor = tmp;
		1075	volume = 0;
		1076	items = 0;
1208	}	1077	}
1209	/* Flag anywhere have high priority */	1078	else
1210	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1211	{	1079	{
1212	middle = tmp->face;	1080	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1081	{
		1082	++items;
		1083	volume += tmp->volume ();
		1084	}
1213		1085
1214	middle_obj = tmp;	1086	/* Flag anywhere have high priority */
		1087	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1215	anywhere = 1;	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;
		1097	middle = tmp;
		1098	}
1216	}	1099	}
1217	/* Find the highest visible face around. If equal
1218	* visibilities, we still want the one nearer to the
1219	* top
1220	*/
1221	else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere))
1222	{
1223	middle = tmp->face;
1224	middle_obj = tmp;
1225	}
1226	}
1227
1228	if (tmp == tmp->above)
1229	{
1230	LOG (llevError, "Error in structure of map\n");
1231	exit (-1);
1232	}	1100	}
1233		1101
1234	move_slow |= tmp->move_slow;	1102	move_slow |= tmp->move_slow;
1235	move_block |= tmp->move_block;	1103	move_block |= tmp->move_block;
1236	move_on |= tmp->move_on;	1104	move_on |= tmp->move_on;
1237	move_off |= tmp->move_off;	1105	move_off |= tmp->move_off;
1238	move_allow |= tmp->move_allow;	1106	move_allow |= tmp->move_allow;
1239		1107
1240	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW;	1108	allflags |= tmp->flag;
1241	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC;	1109
1242	if (tmp->type == PLAYER) flags |= P_PLAYER;	1110	if (tmp->type == PLAYER) flags |= P_PLAYER;
1243	if (tmp->type == SAFE_GROUND) flags |= P_SAFE;	1111	if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1244	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1245	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1246	}	1112	}
1247		1113
1248	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);
1249	this->flags_ = flags;	1125	this->flags_ = flags;
1250	this->move_block = move_block & ~move_allow;	1126	this->move_block = move_block & ~move_allow;
1251	this->move_on = move_on;	1127	this->move_on = move_on;
1252	this->move_off = move_off;	1128	this->move_off = move_off;
1253	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
1254		1132
1255	/* 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),
1256	* 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
1257	* this point.	1135	* this point.
1258	* middle contains the highest visibility face.	1136	* middle contains the highest visibility face.
…		…
1265	* middle face. This should not happen, as we already have the	1143	* middle face. This should not happen, as we already have the
1266	* else statement above so middle should not get set. OTOH, it	1144	* else statement above so middle should not get set. OTOH, it
1267	* may be possible for the faces to match but be different objects.	1145	* may be possible for the faces to match but be different objects.
1268	*/	1146	*/
1269	if (top == middle)	1147	if (top == middle)
1270	middle = blank_face;	1148	middle = 0;
1271		1149
1272	/* There are three posibilities at this point:	1150	/* There are three posibilities at this point:
1273	* 1) top face is set, need middle to be set.	1151	* 1) top face is set, need middle to be set.
1274	* 2) middle is set, need to set top.	1152	* 2) middle is set, need to set top.
1275	* 3) neither middle or top is set - need to set both.	1153	* 3) neither middle or top is set - need to set both.
1276	*/	1154	*/
1277		1155
1278	for (tmp = last; tmp; tmp = tmp->below)	1156	for (object *tmp = last; tmp; tmp = tmp->below)
1279	{	1157	{
1280	/* 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 */
1281	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1159	if (tmp->flag [FLAG_IS_FLOOR])
1282	break;	1160	break;
1283		1161
1284	/* If two top faces are already set, quit processing */	1162	/* If two top faces are already set, quit processing */
1285	if ((top != blank_face) && (middle != blank_face))	1163	if (top && middle)
1286	break;	1164	break;
1287		1165
1288	/* Only show visible faces, unless its the editor - show all */	1166	/* Only show visible faces */
1289	if (!tmp->invisible || editor)	1167	if (!tmp->invisible)
1290	{	1168	{
1291	/* Fill in top if needed */	1169	/* Fill in top if needed */
1292	if (top == blank_face)	1170	if (!top)
1293	{	1171	{
1294	top = tmp->face;
1295	top_obj = tmp;	1172	top = tmp;
1296	if (top == middle)	1173	if (top == middle)
1297	middle = blank_face;	1174	middle = 0;
1298	}	1175	}
1299	else	1176	else
1300	{	1177	{
1301	/* top is already set - we should only get here if	1178	/* top is already set - we should only get here if
1302	* middle is not set	1179	* middle is not set
1303	*	1180	*
1304	* Set the middle face and break out, since there is nothing	1181	* Set the middle face and break out, since there is nothing
1305	* more to fill in. We don't check visiblity here, since	1182	* more to fill in. We don't check visiblity here, since
1306	*	1183	*
1307	*/	1184	*/
1308	if (tmp->face != top)	1185	if (tmp != top)
1309	{	1186	{
1310	middle = tmp->face;
1311	middle_obj = tmp;	1187	middle = tmp;
1312	break;	1188	break;
1313	}	1189	}
1314	}	1190	}
1315	}	1191	}
1316	}	1192	}
1317		1193
1318	if (middle == floor)	1194	if (middle == floor)
1319	middle = blank_face;	1195	middle = 0;
1320		1196
1321	if (top == middle)	1197	if (top == middle)
1322	middle = blank_face;	1198	middle = 0;
1323		1199
1324	faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;	1200	// dire hack to handle "transparent" floors - currently only open_space
1325	faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;	1201	if (floor && floor->arch->archname == shstr_quad_open_space)
1326	faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
1327	}
1328
1329	/* this updates the orig_map->tile_map[tile_num] value after loading
1330	* the map. It also takes care of linking back the freshly loaded
1331	* maps tile_map values if it tiles back to this one. It returns
1332	* the value of orig_map->tile_map[tile_num]. It really only does this
1333	* so that it is easier for calling functions to verify success.
1334	*/
1335	static maptile *
1336	load_and_link_tiled_map (maptile *orig_map, int tile_num)
1337	{
1338	maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map);
1339
1340	if (!mp || mp->in_memory != MAP_IN_MEMORY)
1341	{
1342	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1343	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1344	&orig_map->tile_path[tile_num], &orig_map->path);
1345	mp = new maptile (1, 1);
1346	mp->alloc ();
1347	mp->in_memory = MAP_IN_MEMORY;
1348	}	1202	{
		1203	floor->set_anim_frame (0);
1349		1204
1350	int dest_tile = (tile_num + 2) % 4;	1205	if (maptile *m = floor->map->tile_map [TILE_DOWN])
		1206	{
		1207	// mirror the floor - very unreliable because usually outdated,
		1208	// but somewhta works because floors do not change often :/
		1209	middle = floor;
1351		1210
1352	orig_map->tile_map[tile_num] = mp;	1211	mapspace &ms = m->at (floor->x, floor->y);
1353		1212
1354	// optimisation: back-link map to origin map if euclidean	1213	ms.update ();
1355	//TODO: non-euclidean maps MUST GO
1356	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1357	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1358		1214
		1215	if (object *floor2 = ms.faces_obj [2])
		1216	if (floor2->arch->archname != shstr_quad_open_space && !middle)
		1217	{
		1218	floor->set_anim_frame (1);
		1219	middle = floor;
		1220	floor = floor2;
		1221	}
		1222	}
		1223	}
		1224
		1225	#if 0
		1226	faces_obj [0] = top;
		1227	faces_obj [1] = middle;
		1228	faces_obj [2] = floor;
		1229	#endif
		1230	}
		1231
		1232	maptile *
		1233	maptile::tile_available (int dir, bool load)
		1234	{
		1235	if (tile_path[dir])
		1236	{
		1237	// map is there and we don't need to load it OR it's loaded => return what we have
		1238	if (tile_map[dir] && (!load || tile_map[dir]->linkable ()))
		1239	return tile_map[dir];
		1240
		1241	// well, try to locate it then, if possible - maybe it's there already
		1242	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1243	return tile_map[dir];
		1244	}
		1245
1359	return mp;	1246	return 0;
1360	}	1247	}
1361		1248
1362	/* this returns TRUE if the coordinates (x,y) are out of	1249	/* this returns TRUE if the coordinates (x,y) are out of
1363	* map m. This function also takes into account any	1250	* map m. This function also takes into account any
1364	* tiling considerations, loading adjacant maps as needed.	1251	* tiling considerations, loading adjacant maps as needed.
…		…
1377	if (!m)	1264	if (!m)
1378	return 0;	1265	return 0;
1379		1266
1380	if (x < 0)	1267	if (x < 0)
1381	{	1268	{
1382	if (!m->tile_path[3])	1269	if (!m->tile_available (3))
1383	return 1;	1270	return 1;
1384		1271
1385	if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1386	load_and_link_tiled_map (m, 3);
1387
1388	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1272	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1389	}	1273	}
1390		1274
1391	if (x >= m->width)	1275	if (x >= m->width)
1392	{	1276	{
1393	if (!m->tile_path[1])	1277	if (!m->tile_available (1))
1394	return 1;	1278	return 1;
1395		1279
1396	if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1397	load_and_link_tiled_map (m, 1);
1398
1399	return out_of_map (m->tile_map[1], x - m->width, y);	1280	return out_of_map (m->tile_map[1], x - m->width, y);
1400	}	1281	}
1401		1282
1402	if (y < 0)	1283	if (y < 0)
1403	{	1284	{
1404	if (!m->tile_path[0])	1285	if (!m->tile_available (0))
1405	return 1;	1286	return 1;
1406		1287
1407	if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1408	load_and_link_tiled_map (m, 0);
1409
1410	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1288	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1411	}	1289	}
1412		1290
1413	if (y >= m->height)	1291	if (y >= m->height)
1414	{	1292	{
1415	if (!m->tile_path[2])	1293	if (!m->tile_available (2))
1416	return 1;	1294	return 1;
1417
1418	if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1419	load_and_link_tiled_map (m, 2);
1420		1295
1421	return out_of_map (m->tile_map[2], x, y - m->height);	1296	return out_of_map (m->tile_map[2], x, y - m->height);
1422	}	1297	}
1423		1298
1424	/* Simple case - coordinates are within this local	1299	/* Simple case - coordinates are within this local
…		…
1429		1304
1430	/* This is basically the same as out_of_map above, but	1305	/* This is basically the same as out_of_map above, but
1431	* instead we return NULL if no map is valid (coordinates	1306	* instead we return NULL if no map is valid (coordinates
1432	* out of bounds and no tiled map), otherwise it returns	1307	* out of bounds and no tiled map), otherwise it returns
1433	* the map as that the coordinates are really on, and	1308	* the map as that the coordinates are really on, and
1434	* updates x and y to be the localized coordinates.	1309	* updates x and y to be the localised coordinates.
1435	* Using this is more efficient of calling out_of_map	1310	* Using this is more efficient of calling out_of_map
1436	* and then figuring out what the real map is	1311	* and then figuring out what the real map is
1437	*/	1312	*/
1438	maptile *	1313	maptile *
1439	get_map_from_coord (maptile *m, sint16 *x, sint16 *y)	1314	maptile::xy_find (sint16 &x, sint16 &y)
1440	{	1315	{
1441	if (*x < 0)	1316	if (x < 0)
1442	{	1317	{
1443	if (!m->tile_path[3])	1318	if (!tile_available (3))
1444	return 0;	1319	return 0;
1445		1320
1446	if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1447	load_and_link_tiled_map (m, 3);
1448
1449	*x += m->tile_map[3]->width;	1321	x += tile_map[3]->width;
1450	return (get_map_from_coord (m->tile_map[3], x, y));	1322	return tile_map[3]->xy_find (x, y);
1451	}	1323	}
1452		1324
1453	if (*x >= m->width)	1325	if (x >= width)
1454	{	1326	{
1455	if (!m->tile_path[1])	1327	if (!tile_available (1))
1456	return 0;	1328	return 0;
1457		1329
1458	if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1459	load_and_link_tiled_map (m, 1);
1460
1461	*x -= m->width;	1330	x -= width;
1462	return (get_map_from_coord (m->tile_map[1], x, y));	1331	return tile_map[1]->xy_find (x, y);
1463	}	1332	}
1464		1333
1465	if (*y < 0)	1334	if (y < 0)
1466	{	1335	{
1467	if (!m->tile_path[0])	1336	if (!tile_available (0))
1468	return 0;	1337	return 0;
1469		1338
1470	if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1471	load_and_link_tiled_map (m, 0);
1472
1473	*y += m->tile_map[0]->height;	1339	y += tile_map[0]->height;
1474	return (get_map_from_coord (m->tile_map[0], x, y));	1340	return tile_map[0]->xy_find (x, y);
1475	}	1341	}
1476		1342
1477	if (*y >= m->height)	1343	if (y >= height)
1478	{	1344	{
1479	if (!m->tile_path[2])	1345	if (!tile_available (2))
1480	return 0;	1346	return 0;
1481		1347
1482	if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1483	load_and_link_tiled_map (m, 2);
1484
1485	*y -= m->height;	1348	y -= height;
1486	return (get_map_from_coord (m->tile_map[2], x, y));	1349	return tile_map[2]->xy_find (x, y);
1487	}	1350	}
1488		1351
1489	/* Simple case - coordinates are within this local	1352	/* Simple case - coordinates are within this local
1490	* map.	1353	* map.
1491	*/	1354	*/
1492	return m;	1355	return this;
1493	}	1356	}
1494		1357
1495	/**	1358	/**
1496	* Return whether map2 is adjacent to map1. If so, store the distance from	1359	* Return whether map2 is adjacent to map1. If so, store the distance from
1497	* map1 to map2 in dx/dy.	1360	* map1 to map2 in dx/dy.
1498	*/	1361	*/
1499	static int	1362	int
1500	adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)	1363	adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy)
1501	{	1364	{
1502	if (!map1 || !map2)	1365	if (!map1 || !map2)
1503	return 0;	1366	return 0;
1504		1367
		1368	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
		1369	//fix: compare paths instead (this is likely faster, too!)
1505	if (map1 == map2)	1370	if (map1 == map2)
1506	{	1371	{
1507	*dx = 0;	1372	*dx = 0;
1508	*dy = 0;	1373	*dy = 0;
1509	}	1374	}
1510	else if (map1->tile_map[0] == map2)	1375	else if (map1->tile_available (TILE_NORTH, false) == map2)
1511	{ /* up */	1376	{
1512	*dx = 0;	1377	*dx = 0;
1513	*dy = -map2->height;	1378	*dy = -map2->height;
1514	}	1379	}
1515	else if (map1->tile_map[1] == map2)	1380	else if (map1->tile_available (TILE_EAST , false) == map2)
1516	{ /* right */	1381	{
1517	*dx = map1->width;	1382	*dx = map1->width;
1518	*dy = 0;	1383	*dy = 0;
1519	}	1384	}
1520	else if (map1->tile_map[2] == map2)	1385	else if (map1->tile_available (TILE_SOUTH, false) == map2)
1521	{ /* down */	1386	{
1522	*dx = 0;	1387	*dx = 0;
1523	*dy = map1->height;	1388	*dy = map1->height;
1524	}	1389	}
1525	else if (map1->tile_map[3] == map2)	1390	else if (map1->tile_available (TILE_WEST , false) == map2)
1526	{ /* left */	1391	{
1527	*dx = -map2->width;	1392	*dx = -map2->width;
1528	*dy = 0;	1393	*dy = 0;
1529	}	1394	}
1530	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)	1395	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2)
1531	{ /* up right */	1396	{ /* up right */
1532	*dx = map1->tile_map[0]->width;	1397	*dx = +map1->tile_map[TILE_NORTH]->width;
1533	*dy = -map1->tile_map[0]->height;	1398	*dy = -map1->tile_map[TILE_NORTH]->height;
1534	}	1399	}
1535	else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)	1400	else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2)
1536	{ /* up left */	1401	{ /* up left */
1537	*dx = -map2->width;	1402	*dx = -map2->width;
1538	*dy = -map1->tile_map[0]->height;	1403	*dy = -map1->tile_map[TILE_NORTH]->height;
1539	}	1404	}
1540	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)	1405	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2)
1541	{ /* right up */	1406	{ /* right up */
1542	*dx = map1->width;	1407	*dx = +map1->width;
1543	*dy = -map2->height;	1408	*dy = -map2->height;
1544	}	1409	}
1545	else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)	1410	else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2)
1546	{ /* right down */	1411	{ /* right down */
1547	*dx = map1->width;	1412	*dx = +map1->width;
1548	*dy = map1->tile_map[1]->height;	1413	*dy = +map1->tile_map[TILE_EAST]->height;
1549	}	1414	}
1550	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)	1415	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2)
1551	{ /* down right */	1416	{ /* down right */
1552	*dx = map1->tile_map[2]->width;	1417	*dx = +map1->tile_map[TILE_SOUTH]->width;
1553	*dy = map1->height;	1418	*dy = +map1->height;
1554	}	1419	}
1555	else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)	1420	else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2)
1556	{ /* down left */	1421	{ /* down left */
1557	*dx = -map2->width;	1422	*dx = -map2->width;
1558	*dy = map1->height;	1423	*dy = +map1->height;
1559	}	1424	}
1560	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)	1425	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2)
1561	{ /* left up */	1426	{ /* left up */
1562	*dx = -map1->tile_map[3]->width;	1427	*dx = -map1->tile_map[TILE_WEST]->width;
1563	*dy = -map2->height;	1428	*dy = -map2->height;
1564	}	1429	}
1565	else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)	1430	else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2)
1566	{ /* left down */	1431	{ /* left down */
1567	*dx = -map1->tile_map[3]->width;	1432	*dx = -map1->tile_map[TILE_WEST]->width;
1568	*dy = map1->tile_map[3]->height;	1433	*dy = +map1->tile_map[TILE_WEST]->height;
1569	}	1434	}
1570	else	1435	else
1571	return 0;	1436	return 0;
1572		1437
1573	return 1;	1438	return 1;
		1439	}
		1440
		1441	maptile *
		1442	maptile::xy_load (sint16 &x, sint16 &y)
		1443	{
		1444	maptile *map = xy_find (x, y);
		1445
		1446	if (map)
		1447	map->load_sync ();
		1448
		1449	return map;
		1450	}
		1451
		1452	maptile *
		1453	get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
		1454	{
		1455	return m->xy_load (*x, *y);
1574	}	1456	}
1575		1457
1576	/* From map.c	1458	/* From map.c
1577	* This is used by get_player to determine where the other	1459	* This is used by get_player to determine where the other
1578	* creature is. get_rangevector takes into account map tiling,	1460	* creature is. get_rangevector takes into account map tiling,
1579	* so you just can not look the the map coordinates and get the	1461	* so you just can not look the the map coordinates and get the
1580	* righte value. distance_x/y are distance away, which	1462	* righte value. distance_x/y are distance away, which
1581	* can be negativbe. direction is the crossfire direction scheme	1463	* can be negative. direction is the crossfire direction scheme
1582	* that the creature should head. part is the part of the	1464	* that the creature should head. part is the part of the
1583	* monster that is closest.	1465	* monster that is closest.
1584	*	1466	*
1585	* get_rangevector looks at op1 and op2, and fills in the	1467	* get_rangevector looks at op1 and op2, and fills in the
1586	* structure for op1 to get to op2.	1468	* structure for op1 to get to op2.
…		…
1592	*	1474	*
1593	* currently, the only flag supported (0x1) is don't translate for	1475	* currently, the only flag supported (0x1) is don't translate for
1594	* closest body part of 'op1'	1476	* closest body part of 'op1'
1595	*/	1477	*/
1596	void	1478	void
1597	get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)	1479	get_rangevector (object *op1, object *op2, rv_vector *retval, int flags)
1598	{	1480	{
1599	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1481	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1600	{	1482	{
1601	/* be conservative and fill in _some_ data */	1483	/* be conservative and fill in _some_ data */
1602	retval->distance = 100000;	1484	retval->distance = 10000;
1603	retval->distance_x = 32767;	1485	retval->distance_x = 10000;
1604	retval->distance_y = 32767;	1486	retval->distance_y = 10000;
1605	retval->direction = 0;	1487	retval->direction = 0;
1606	retval->part = 0;	1488	retval->part = 0;
1607	}	1489	}
1608	else	1490	else
1609	{	1491	{
1610	object *best;
1611
1612	retval->distance_x += op2->x - op1->x;	1492	retval->distance_x += op2->x - op1->x;
1613	retval->distance_y += op2->y - op1->y;	1493	retval->distance_y += op2->y - op1->y;
1614		1494
1615	best = op1;	1495	object *best = op1;
		1496
1616	/* If this is multipart, find the closest part now */	1497	/* If this is multipart, find the closest part now */
1617	if (!(flags & 0x1) && op1->more)	1498	if (!(flags & 1) && op1->more)
1618	{	1499	{
1619	object *tmp;	1500	int best_distance = idistance (retval->distance_x, retval->distance_y);
1620	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1621		1501
1622	/* we just take the offset of the piece to head to figure	1502	/* we just take the offset of the piece to head to figure
1623	* distance instead of doing all that work above again	1503	* distance instead of doing all that work above again
1624	* since the distance fields we set above are positive in the	1504	* since the distance fields we set above are positive in the
1625	* same axis as is used for multipart objects, the simply arithmetic	1505	* same axis as is used for multipart objects, the simply arithmetic
1626	* below works.	1506	* below works.
1627	*/	1507	*/
1628	for (tmp = op1->more; tmp != NULL; tmp = tmp->more)	1508	for (object *tmp = op1->more; tmp; tmp = tmp->more)
1629	{	1509	{
1630	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +	1510	int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
1631	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1511
1632	if (tmpi < best_distance)	1512	if (tmpi < best_distance)
1633	{	1513	{
1634	best_distance = tmpi;	1514	best_distance = tmpi;
1635	best = tmp;	1515	best = tmp;
1636	}	1516	}
1637	}	1517	}
		1518
1638	if (best != op1)	1519	if (best != op1)
1639	{	1520	{
1640	retval->distance_x += op1->x - best->x;	1521	retval->distance_x += op1->x - best->x;
1641	retval->distance_y += op1->y - best->y;	1522	retval->distance_y += op1->y - best->y;
1642	}	1523	}
1643	}	1524	}
		1525
1644	retval->part = best;	1526	retval->part = best;
1645	retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);	1527	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1646	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1528	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1647	}	1529	}
1648	}	1530	}
1649		1531
1650	/* this is basically the same as get_rangevector above, but instead of	1532	/* this is basically the same as get_rangevector above, but instead of
1651	* the first parameter being an object, it instead is the map	1533	* the first parameter being an object, it instead is the map
…		…
1655	* flags has no meaning for this function at this time - I kept it in to	1537	* flags has no meaning for this function at this time - I kept it in to
1656	* be more consistant with the above function and also in case they are needed	1538	* be more consistant with the above function and also in case they are needed
1657	* for something in the future. Also, since no object is pasted, the best	1539	* for something in the future. Also, since no object is pasted, the best
1658	* field of the rv_vector is set to NULL.	1540	* field of the rv_vector is set to NULL.
1659	*/	1541	*/
1660
1661	void	1542	void
1662	get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags)	1543	get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1663	{	1544	{
1664	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))	1545	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1665	{	1546	{
1666	/* be conservative and fill in _some_ data */	1547	/* be conservative and fill in _some_ data */
1667	retval->distance = 100000;	1548	retval->distance = 100000;
1668	retval->distance_x = 32767;	1549	retval->distance_x = 32767;
1669	retval->distance_y = 32767;	1550	retval->distance_y = 32767;
1670	retval->direction = 0;	1551	retval->direction = 0;
1671	retval->part = 0;	1552	retval->part = 0;
1672	}	1553	}
1673	else	1554	else
1674	{	1555	{
1675	retval->distance_x += op2->x - x;	1556	retval->distance_x += op2->x - x;
1676	retval->distance_y += op2->y - y;	1557	retval->distance_y += op2->y - y;
1677		1558
1678	retval->part = NULL;	1559	retval->part = 0;
1679	retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);	1560	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1680	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1561	retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1681	}	1562	}
1682	}	1563	}
1683		1564
1684	/* Returns true of op1 and op2 are effectively on the same map	1565	/* Returns true of op1 and op2 are effectively on the same map
1685	* (as related to map tiling). Note that this looks for a path from	1566	* (as related to map tiling). Note that this looks for a path from
…		…
1695	int dx, dy;	1576	int dx, dy;
1696		1577
1697	return adjacent_map (op1->map, op2->map, &dx, &dy);	1578	return adjacent_map (op1->map, op2->map, &dx, &dy);
1698	}	1579	}
1699		1580
		1581	//-GPL
		1582
1700	object *	1583	object *
1701	maptile::insert (object *op, int x, int y, object *originator, int flags)	1584	maptile::insert (object *op, int x, int y, object *originator, int flags)
1702	{	1585	{
1703	if (!op->flag [FLAG_REMOVED])
1704	op->remove ();
1705
1706	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1586	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1707	}	1587	}
1708		1588
		1589	region *
		1590	maptile::region (int x, int y) const
		1591	{
		1592	if (regions
		1593	&& regionmap
		1594	&& !OUT_OF_REAL_MAP (this, x, y))
		1595	if (struct region *reg = regionmap [regions [y * width + x]])
		1596	return reg;
		1597
		1598	if (default_region)
		1599	return default_region;
		1600
		1601	return ::region::default_region ();
		1602	}
		1603
		1604	//+GPL
		1605
		1606	/* picks a random object from a style map.
		1607	*/
		1608	object *
		1609	maptile::pick_random_object (rand_gen &gen) const
		1610	{
		1611	/* while returning a null object will result in a crash, that
		1612	* is actually preferable to an infinite loop. That is because
		1613	* most servers will automatically restart in case of crash.
		1614	* Change the logic on getting the random space - shouldn't make
		1615	* any difference, but this seems clearer to me.
		1616	*/
		1617	for (int i = 1000; --i;)
		1618	{
		1619	object *pick = at (gen (width), gen (height)).bot;
		1620
		1621	// must be head: do not prefer big monsters just because they are big.
		1622	if (pick && pick->is_head ())
		1623	return pick;
		1624	}
		1625
		1626	// instead of crashing in the unlikely(?) case, try to return *something*
		1627	return archetype::find (shstr_bug);
		1628	}
		1629
		1630	//-GPL
		1631
		1632	void
		1633	maptile::play_sound (faceidx sound, int x, int y) const
		1634	{
		1635	if (!sound)
		1636	return;
		1637
		1638	for_all_players_on_map (pl, this)
		1639	if (client *ns = pl->ns)
		1640	{
		1641	int dx = x - pl->ob->x;
		1642	int dy = y - pl->ob->y;
		1643
		1644	int distance = idistance (dx, dy);
		1645
		1646	if (distance <= MAX_SOUND_DISTANCE)
		1647	ns->play_sound (sound, dx, dy);
		1648	}
		1649	}
		1650
		1651	void
		1652	maptile::say_msg (const char *msg, int x, int y) const
		1653	{
		1654	for_all_players (pl)
		1655	if (client *ns = pl->ns)
		1656	{
		1657	int dx = x - pl->ob->x;
		1658	int dy = y - pl->ob->y;
		1659
		1660	int distance = idistance (dx, dy);
		1661
		1662	if (distance <= MAX_SOUND_DISTANCE)
		1663	ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
		1664	}
		1665	}
		1666
		1667	dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
		1668
		1669	static void
		1670	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1671	{
		1672	// clip to map to the left
		1673	if (x0 < 0)
		1674	{
		1675	if (maptile *tile = m->tile_available (TILE_WEST, 1))
		1676	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1677
		1678	if (x1 < 0) // entirely to the left
		1679	return;
		1680
		1681	x0 = 0;
		1682	}
		1683
		1684	// clip to map to the right
		1685	if (x1 > m->width)
		1686	{
		1687	if (maptile *tile = m->tile_available (TILE_EAST, 1))
		1688	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1689
		1690	if (x0 > m->width) // entirely to the right
		1691	return;
		1692
		1693	x1 = m->width;
		1694	}
		1695
		1696	// clip to map above
		1697	if (y0 < 0)
		1698	{
		1699	if (maptile *tile = m->tile_available (TILE_NORTH, 1))
		1700	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1701
		1702	if (y1 < 0) // entirely above
		1703	return;
		1704
		1705	y0 = 0;
		1706	}
		1707
		1708	// clip to map below
		1709	if (y1 > m->height)
		1710	{
		1711	if (maptile *tile = m->tile_available (TILE_SOUTH, 1))
		1712	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1713
		1714	if (y0 > m->height) // entirely below
		1715	return;
		1716
		1717	y1 = m->height;
		1718	}
		1719
		1720	// if we get here, the rect is within the current map
		1721	maprect *r = (maprect *)buf.alloc (sizeof (maprect));
		1722
		1723	r->m = m;
		1724	r->x0 = x0;
		1725	r->y0 = y0;
		1726	r->x1 = x1;
		1727	r->y1 = y1;
		1728	r->dx = dx;
		1729	r->dy = dy;
		1730	}
		1731
		1732	maprect *
		1733	maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
		1734	{
		1735	buf.clear ();
		1736
		1737	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1738
		1739	// add end marker
		1740	maprect *r = (maprect *)buf.alloc (sizeof (maprect));
		1741	r->m = 0;
		1742
		1743	return (maprect *)buf.linearise ();
		1744	}
		1745

Diff Legend

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