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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.58 by root, Sat Dec 30 18:45:27 2006 UTC vs.
Revision 1.167 by root, Thu Nov 5 15:43:21 2009 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4	Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 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"
		28	#include "loader.h"
30	#include "path.h"	29	#include "path.h"
31		30
32	/*	31	//+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		32
43	/* Why? having extra / doesn't confuse unix anyplace? Dependancies	33	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		34
167	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	35	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
168	* one function that just returns a P_.. value (see map.h)	36	* one function that just returns a P_.. value (see map.h)
169	* it will also do map translation for tiled maps, returning	37	* it will also do map translation for tiled maps, returning
170	* new values into newmap, nx, and ny. Any and all of those	38	* new values into newmap, nx, and ny. Any and all of those
205	* by the caller.	73	* by the caller.
206	*/	74	*/
207	int	75	int
208	blocked_link (object ob, maptile m, int sx, int sy)	76	blocked_link (object ob, maptile m, int sx, int sy)
209	{	77	{
210	object *tmp;
211	int mflags, blocked;
212
213	/* Make sure the coordinates are valid - they should be, as caller should	78	/* Make sure the coordinates are valid - they should be, as caller should
214	* have already checked this.	79	* have already checked this.
215	*/	80	*/
216	if (OUT_OF_REAL_MAP (m, sx, sy))	81	if (OUT_OF_REAL_MAP (m, sx, sy))
217	{	82	{
218	LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");	83	LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");
219	return 1;	84	return 1;
220	}	85	}
221		86
222	/* Save some cycles - instead of calling get_map_flags(), just get the value	87	mapspace &ms = m->at (sx, sy);
223	* directly.
224	*/
225	mflags = m->at (sx, sy).flags ();
226		88
227	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);	89	int mflags = ms.flags ();
		90	int blocked = ms.move_block;
228		91
229	/* If space is currently not blocked by anything, no need to	92	/* If space is currently not blocked by anything, no need to
230	* go further. Not true for players - all sorts of special	93	* go further. Not true for players - all sorts of special
231	* things we need to do for players.	94	* things we need to do for players.
232	*/	95	*/
233	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	96	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
234	return 0;	97	return 0;
235		98
236	/* if there isn't anytyhing alive on this space, and this space isn't	99	/* 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	100	* 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	101	* 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	102	* or another. Likewise, only if something is blocking us do we
240	* need to investigate if there is a special circumstance that would	103	* need to investigate if there is a special circumstance that would
241	* let the player through (inventory checkers for example)	104	* let the player through (inventory checkers for example)
242	*/	105	*/
243	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))	106	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
244	return 0;	107	return 0;
245		108
246	if (ob->head != NULL)
247	ob = ob->head;	109	ob = ob->head_ ();
248		110
249	/* We basically go through the stack of objects, and if there is	111	/* 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	112	* some other object that has NO_PASS or FLAG_ALIVE set, return
251	* true. If we get through the entire stack, that must mean	113	* true. If we get through the entire stack, that must mean
252	* ob is blocking it, so return 0.	114	* ob is blocking it, so return 0.
253	*/	115	*/
254	for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)	116	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
255	{	117	{
256		118	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	{	119	{
260	/* If last_sp is set, the player/monster needs an object,	120	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
261	* so we check for it. If they don't have it, they can't	121	if (RESULT_INT (0))
262	* pass through this space.	122	return 1;
263	*/	123	else
264	if (tmp->last_sp)	124	continue;
		125
		126	if (tmp->type == CHECK_INV)
265	{	127	{
266	if (check_inv_recursive (ob, tmp) == NULL)	128	bool have = check_inv_recursive (ob, tmp);
		129
		130	// last_sp set means we block if we don't have.
		131	if (logical_xor (have, tmp->last_sp))
267	return 1;	132	return 1;
268	else	133	}
269	continue;	134	else if (tmp->type == T_MATCH)
		135	{
		136	// T_MATCH allows "entrance" iff the match is true
		137	// == blocks if the match fails
		138
		139	// we could have used an INVOKE_OBJECT, but decided against it, as we
		140	// assume that T_MATCH is relatively common.
		141	if (!match (tmp->slaying, ob, tmp, ob))
		142	return 1;
270	}	143	}
271	else	144	else
272	{	145	return 1; // unconditional block
273	/* In this case, the player must not have the object -	146
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	147	} else {
283	{	148	// space does not block the ob, directly, but
284	/* Broke apart a big nasty if into several here to make	149	// anything alive that is not a door still
285	* this more readable. first check - if the space blocks	150	// blocks anything but wizards.
286	* movement, can't move here.	151
287	* second - if a monster, can't move there, unles it is a	152	if (tmp->flag [FLAG_ALIVE]
288	* hidden dm	153	&& tmp->head_ () != ob
289	*/	154	&& tmp != ob
290	if (OB_MOVE_BLOCK (ob, tmp))	155	&& tmp->type != DOOR
291	return 1;	156	&& !tmp->flag [FLAG_WIZPASS])
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;	157	return 1;
295	}	158	}
296
297	}	159	}
		160
298	return 0;	161	return 0;
299	}	162	}
300		163
301
302	/*	164	/*
303	* Returns true if the given object can't fit in the given spot.	165	* Returns qthe blocking object if the given object can't fit in the given
304	* This is meant for multi space objects - for single space objecs,	166	* spot. This is meant for multi space objects - for single space objecs,
305	* just calling get_map_blocked and checking that against movement type	167	* just calling get_map_blocked and checking that against movement type
306	* of object. This function goes through all the parts of the	168	* of object. This function goes through all the parts of the multipart
307	* multipart object and makes sure they can be inserted.	169	* object and makes sure they can be inserted.
308	*	170	*
309	* While this doesn't call out of map, the get_map_flags does.	171	* While this doesn't call out of map, the get_map_flags does.
310	*	172	*
311	* This function has been used to deprecate arch_out_of_map -	173	* This function has been used to deprecate arch_out_of_map -
312	* this function also does that check, and since in most cases,	174	* this function also does that check, and since in most cases,
…		…
323	*	185	*
324	* Note this used to be arch_blocked, but with new movement	186	* Note this used to be arch_blocked, but with new movement
325	* code, we need to have actual object to check its move_type	187	* code, we need to have actual object to check its move_type
326	* against the move_block values.	188	* against the move_block values.
327	*/	189	*/
328	int	190	bool
329	ob_blocked (const object ob, maptile m, sint16 x, sint16 y)	191	object::blocked (maptile *m, int x, int y) const
330	{	192	{
331	archetype *tmp;	193	for (archetype tmp = arch; tmp; tmp = (archetype )tmp->more)
332	int flag;
333	maptile *m1;
334	sint16 sx, sy;
335
336	if (ob == NULL)
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	}	194	{
		195	mapxy pos (m, x + tmp->x, y + tmp->y);
345		196
346	for (tmp = ob->arch; tmp; tmp = tmp->more)	197	if (!pos.normalise ())
347	{	198	return 1;
348	flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
349		199
350	if (flag & P_OUT_OF_MAP)	200	mapspace &ms = *pos;
351	return P_OUT_OF_MAP;	201
352	if (flag & P_IS_ALIVE)	202	if (ms.flags () & P_IS_ALIVE)
353	return P_IS_ALIVE;	203	return 1;
354		204
355	mapspace &ms = m1->at (sx, sy);	205	/* However, often ob doesn't have any move type
356		206	* (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.	207	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
360	*/	208	*/
361
362	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	209	if (!move_type && ms.move_block != MOVE_ALL)
363	continue;	210	continue;
364		211
365	/* Note it is intentional that we check ob - the movement type of the	212	/* Note it is intentional that we check ob - the movement type of the
366	* head of the object should correspond for the entire object.	213	* head of the object should correspond for the entire object.
367	*/	214	*/
368	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	215	if (ms.blocks (move_type))
369	return P_NO_PASS;	216	return 1;
370	}	217	}
371		218
372	return 0;	219	return 0;
373	}	220	}
374		221
…		…
392		239
393	insert_ob_in_ob (tmp, container);	240	insert_ob_in_ob (tmp, container);
394	tmp = next;	241	tmp = next;
395	}	242	}
396		243
397	/* sum_weight will go through and calculate what all the containers are	244	// go through and calculate what all the containers are carrying.
398	* carrying.	245	//TODO: remove
399	*/	246	container->update_weight ();
400	sum_weight (container);
401	}	247	}
		248
		249	//-GPL
		250
		251	void
		252	maptile::set_object_flag (int flag, int value)
		253	{
		254	if (!spaces)
		255	return;
		256
		257	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		258	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		259	tmp->flag [flag] = value;
		260	}
		261
		262	void
		263	maptile::post_load_original ()
		264	{
		265	if (!spaces)
		266	return;
		267
		268	set_object_flag (FLAG_OBJ_ORIGINAL);
		269
		270	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		271	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		272	INVOKE_OBJECT (RESET, tmp);
		273	}
		274
		275	//+GPL
402		276
403	/* link_multipart_objects go through all the objects on the map looking	277	/* 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	278	* 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	279	* 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	280	* they are saved).
407	* the more sections and not re-add sections for them.
408	*/	281	*/
409	void	282	void
410	maptile::link_multipart_objects ()	283	maptile::link_multipart_objects ()
411	{	284	{
412	if (!spaces)	285	if (!spaces)
413	return;	286	return;
414		287
415	for (mapspace *ms = spaces + size (); ms-- > spaces; )	288	for (mapspace *ms = spaces + size (); ms-- > spaces; )
416	for (object *tmp = ms->bot; tmp; )	289	{
		290	object *op = ms->bot;
		291	while (op)
417	{	292	{
418	object *above = tmp->above;
419
420	/* already multipart - don't do anything more */	293	/* already multipart - don't do anything more */
421	if (!tmp->head && !tmp->more)	294	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	{	295	{
432	op = arch_to_object (at);	296	op->remove ();
		297	op->expand_tail ();
433		298
434	/* update x,y coordinates */	299	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
435	op->x += tmp->x;	300	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
436	op->y += tmp->y;	301	// 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);	302	insert (op, op->x, op->y, 0, INS_NO_MERGE \| INS_ON_TOP \| INS_NO_WALK_ON);
		303
		304	op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
		305	// so we have to reset the iteration through the mapspace
449	}	306	}
		307	else
		308	op = op->above;
450	}	309	}
451
452	tmp = above;
453	}	310	}
454	}	311	}
		312
		313	//-GPL
455		314
456	/*	315	/*
457	* Loads (ands parses) the objects into a given map from the specified	316	* Loads (ands parses) the objects into a given map from the specified
458	* file pointer.	317	* file pointer.
459	* mapflags is the same as we get with load_original_map
460	*/	318	*/
461	bool	319	bool
462	maptile::load_objects (object_thawer &thawer)	320	maptile::_load_objects (object_thawer &f)
463	{	321	{
464	int unique;	322	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	{	323	{
472	/* if the archetype for the object is null, means that we	324	coroapi::cede_to_tick (); // cede once in a while
473	* got an invalid object. Don't do anything with it - the game	325
474	* or editor will not be able to do anything with it either.	326	switch (f.kw)
475	*/
476	if (op->arch == NULL)
477	{	327	{
478	LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");	328	case KW_arch:
		329	if (object *op = object::read (f, this))
		330	{
		331	// TODO: why?
		332	if (op->inv)
		333	op->update_weight ();
		334
		335	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
		336	{
		337	// we insert manually because
		338	// a) its way faster
		339	// b) we remove manually, too, and there are good reasons for that
		340	// c) it's correct
		341	mapspace &ms = at (op->x, op->y);
		342
		343	op->flag [FLAG_REMOVED] = false;
		344
		345	op->above = 0;
		346	op->below = ms.top;
		347
		348	*(ms.top ? &ms.top->above : &ms.bot) = op;
		349
		350	ms.top = op;
		351	ms.flags_ = 0;
		352	}
		353	else
		354	{
		355	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		356	op->destroy ();
		357	}
		358	}
		359
479	continue;	360	continue;
480	}
481		361
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:	362	case KW_EOF:
494	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ABOVE_FLOOR_ONLY);	363	return true;
495	op->head = prev, last_more->more = op, last_more = op;	364
		365	default:
		366	if (!f.parse_error ("map file"))
		367	return false;
496	break;	368	break;
497	}	369	}
498		370
499	op = object::create ();	371	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	}	372	}
520	#endif
521		373
522	return true;	374	return true;
523	}	375	}
524		376
525	void	377	void
526	maptile::activate ()	378	maptile::activate ()
527	{	379	{
528	if (!spaces)	380	if (spaces)
529	return;
530
531	for (mapspace *ms = spaces + size (); ms-- > spaces; )	381	for (mapspace *ms = spaces + size (); ms-- > spaces; )
532	for (object *op = ms->bot; op; op = op->above)	382	for (object *op = ms->bot; op; op = op->above)
533	op->activate (1);	383	op->activate_recursive ();
534	}	384	}
535		385
536	void	386	void
537	maptile::deactivate ()	387	maptile::deactivate ()
538	{	388	{
539	if (!spaces)	389	if (spaces)
540	return;
541
542	for (mapspace *ms = spaces + size (); ms-- > spaces; )	390	for (mapspace *ms = spaces + size (); ms-- > spaces; )
543	for (object *op = ms->bot; op; op = op->above)	391	for (object *op = ms->bot; op; op = op->above)
544	op->deactivate (1);	392	op->deactivate_recursive ();
545	}	393	}
546		394
547	bool	395	bool
548	maptile::save_objects (object_freezer &freezer, int flags)	396	maptile::_save_objects (object_freezer &f, int flags)
549	{	397	{
		398	coroapi::cede_to_tick ();
		399
550	if (flags & IO_HEADER)	400	if (flags & IO_HEADER)
551	save_header (freezer);	401	_save_header (f);
552		402
553	if (!spaces)	403	if (!spaces)
554	return false;	404	return false;
555		405
556	for (int i = 0; i < size (); ++i)	406	for (int i = 0; i < size (); ++i)
557	{	407	{
558	int unique = 0;	408	bool unique = 0;
		409
559	for (object *op = spaces [i].bot; op; op = op->above)	410	for (object *op = spaces [i].bot; op; op = op->above)
560	{	411	{
561	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	412	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
562	unique = 1;
563		413
564	if (!op->can_map_save ())	414	if (expect_false (!op->can_map_save ()))
565	continue;	415	continue;
566		416
567	if (unique \|\| op->flag [FLAG_UNIQUE])	417	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
568	{	418	{
569	if (flags & IO_UNIQUES)	419	if (flags & IO_UNIQUES)
570	save_object (freezer, op, 1);	420	op->write (f);
571	}	421	}
572	else if (flags & IO_OBJECTS)	422	else if (expect_true (flags & IO_OBJECTS))
573	save_object (freezer, op, 1);	423	op->write (f);
574	}	424	}
575	}	425	}
576		426
		427	coroapi::cede_to_tick ();
		428
577	return true;	429	return true;
578	}	430	}
579		431
580	bool	432	bool
581	maptile::load_objects (const char *path, bool skip_header)	433	maptile::_save_objects (const char *path, int flags)
582	{	434	{
583	object_thawer thawer (path);	435	object_freezer freezer;
584		436
585	if (!thawer)	437	if (!_save_objects (freezer, flags))
586	return false;	438	return false;
587		439
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);	440	return freezer.save (path);
611	}	441	}
612		442
613	maptile::maptile ()	443	maptile::maptile ()
614	{	444	{
615	in_memory = MAP_SWAPPED;	445	in_memory = MAP_SWAPPED;
616		446
617	/* The maps used to pick up default x and y values from the	447	/* The maps used to pick up default x and y values from the
618	* map archetype. Mimic that behaviour.	448	* map archetype. Mimic that behaviour.
619	*/	449	*/
620	width = 16;	450	width = 16;
621	height = 16;	451	height = 16;
622	reset_timeout = 0;
623	timeout = 300;	452	timeout = 300;
624	enter_x = 0;	453	max_nrof = 1000; // 1000 items of anything
625	enter_y = 0;	454	max_volume = 2000000; // 2m³
626	}	455	}
627		456
628	maptile::maptile (int w, int h)	457	maptile::maptile (int w, int h)
629	{	458	{
630	in_memory = MAP_SWAPPED;	459	in_memory = MAP_SWAPPED;
…		…
650	if (spaces)	479	if (spaces)
651	return;	480	return;
652		481
653	spaces = salloc0<mapspace> (size ());	482	spaces = salloc0<mapspace> (size ());
654	}	483	}
		484
		485	//+GPL
655		486
656	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	487	/* 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	488	* corresponding to that string. Memory is allocated for this, it must be freed
658	* at a later date.	489	* at a later date.
659	* Called by parse_map_headers below.	490	* Called by parse_map_headers below.
…		…
736	return items;	567	return items;
737	}	568	}
738		569
739	/* opposite of parse string, this puts the string that was originally fed in to	570	/* opposite of parse string, this puts the string that was originally fed in to
740	* the map (or something equivilent) into output_string. */	571	* the map (or something equivilent) into output_string. */
741	static void	572	static const char *
742	print_shop_string (maptile m, char output_string)	573	print_shop_string (maptile *m)
743	{	574	{
744	int i;	575	static dynbuf_text buf; buf.clear ();
745	char tmp[MAX_BUF];
746		576
747	strcpy (output_string, "");
748	for (i = 0; i < m->shopitems[0].index; i++)	577	for (int i = 0; i < m->shopitems[0].index; i++)
749	{	578	{
750	if (m->shopitems[i].typenum)	579	if (m->shopitems[i].typenum)
751	{	580	{
752	if (m->shopitems[i].strength)	581	if (m->shopitems[i].strength)
753	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	582	buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
754	else	583	else
755	sprintf (tmp, "%s;", m->shopitems[i].name);	584	buf.printf ("%s;", m->shopitems[i].name);
756	}	585	}
757	else	586	else
758	{	587	{
759	if (m->shopitems[i].strength)	588	if (m->shopitems[i].strength)
760	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	589	buf.printf ("*:%d;", m->shopitems[i].strength);
761	else	590	else
762	sprintf (tmp, "*");	591	buf.printf ("*");
763	}	592	}
764
765	strcat (output_string, tmp);
766	}	593	}
		594
		595	return buf;
767	}	596	}
		597
		598	//-GPL
768		599
769	/* This loads the header information of the map. The header	600	/* This loads the header information of the map. The header
770	* contains things like difficulty, size, timeout, etc.	601	* contains things like difficulty, size, timeout, etc.
771	* this used to be stored in the map object, but with the	602	* this used to be stored in the map object, but with the
772	* addition of tiling, fields beyond that easily named in an	603	* addition of tiling, fields beyond that easily named in an
…		…
776	* This could be done in lex (like the object loader), but I think	607	* 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.	608	* currently, there are few enough fields this is not a big deal.
778	* MSW 2001-07-01	609	* MSW 2001-07-01
779	*/	610	*/
780	bool	611	bool
781	maptile::load_header (object_thawer &thawer)	612	maptile::_load_header (object_thawer &thawer)
782	{	613	{
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 (;;)	614	for (;;)
788	{	615	{
789	keyword kw = thawer.get_kv ();
790
791	switch (kw)	616	switch (thawer.kw)
792	{	617	{
793	case KW_EOF:
794	LOG (llevError, "%s: end of file while reading map header, aborting header load.", &path);
795	return false;
796
797	case KW_end:
798	return true;
799
800	case KW_msg:	618	case KW_msg:
801	thawer.get_ml (KW_endmsg, msg);	619	thawer.get_ml (KW_endmsg, msg);
802	break;	620	break;
803		621
804	case KW_lore: // CF+ extension	622	case KW_lore: // CF+ extension
…		…
835	case KW_winddir: thawer.get (winddir); break;	653	case KW_winddir: thawer.get (winddir); break;
836	case KW_sky: thawer.get (sky); break;	654	case KW_sky: thawer.get (sky); break;
837		655
838	case KW_per_player: thawer.get (per_player); break;	656	case KW_per_player: thawer.get (per_player); break;
839	case KW_per_party: thawer.get (per_party); break;	657	case KW_per_party: thawer.get (per_party); break;
		658	case KW_no_reset: thawer.get (no_reset); break;
		659	case KW_no_drop: thawer.get (no_drop); break;
840		660
841	case KW_region: get_region_by_name (thawer.get_str ()); break;	661	case KW_region: default_region = region::find (thawer.get_str ()); break;
842	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	662	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
843		663
844	// old names new names	664	// old names new names
845	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;	665	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;	666	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
…		…
855	case KW_tile_path_1: thawer.get (tile_path [0]); break;	675	case KW_tile_path_1: thawer.get (tile_path [0]); break;
856	case KW_tile_path_2: thawer.get (tile_path [1]); break;	676	case KW_tile_path_2: thawer.get (tile_path [1]); break;
857	case KW_tile_path_3: thawer.get (tile_path [2]); break;	677	case KW_tile_path_3: thawer.get (tile_path [2]); break;
858	case KW_tile_path_4: thawer.get (tile_path [3]); break;	678	case KW_tile_path_4: thawer.get (tile_path [3]); break;
859		679
		680	case KW_ERROR:
		681	set_key_text (thawer.kw_str, thawer.value);
		682	break;
		683
		684	case KW_end:
		685	thawer.next ();
		686	return true;
		687
860	default:	688	default:
861	LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]);	689	if (!thawer.parse_error ("map", 0))
		690	return false;
862	break;	691	break;
863	}	692	}
		693
		694	thawer.next ();
864	}	695	}
865		696
866	abort ();	697	abort ();
867	}	698	}
868		699
869	bool	700	//+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		701
880	/******************************************************************************	702	/******************************************************************************
881	* This is the start of unique map handling code	703	* This is the start of unique map handling code
882	*****************************************************************************/	704	*****************************************************************************/
883		705
…		…
893	object *above = op->above;	715	object *above = op->above;
894		716
895	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	717	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
896	unique = 1;	718	unique = 1;
897		719
898	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	720	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
899	{
900	op->destroy_inv (false);
901	op->destroy ();	721	op->destroy ();
902	}
903		722
904	op = above;	723	op = above;
905	}	724	}
906	}	725	}
907	}	726	}
908		727
		728	//-GPL
		729
909	bool	730	bool
910	maptile::save_header (object_freezer &freezer)	731	maptile::_save_header (object_freezer &freezer)
911	{	732	{
912	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	733	#define MAP_OUT(k) freezer.put (KW_ ## k, k)
913	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)	734	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
914		735
915	MAP_OUT2 (arch, "map");	736	MAP_OUT2 (arch, "map");
…		…
917	if (name) MAP_OUT (name);	738	if (name) MAP_OUT (name);
918	MAP_OUT (swap_time);	739	MAP_OUT (swap_time);
919	MAP_OUT (reset_time);	740	MAP_OUT (reset_time);
920	MAP_OUT (reset_timeout);	741	MAP_OUT (reset_timeout);
921	MAP_OUT (fixed_resettime);	742	MAP_OUT (fixed_resettime);
		743	MAP_OUT (no_reset);
		744	MAP_OUT (no_drop);
922	MAP_OUT (difficulty);	745	MAP_OUT (difficulty);
923
924	if (region) MAP_OUT2 (region, region->name);	746	if (default_region) MAP_OUT2 (region, default_region->name);
925		747
926	if (shopitems)	748	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);	749	MAP_OUT (shopgreed);
934	MAP_OUT (shopmin);	750	MAP_OUT (shopmin);
935	MAP_OUT (shopmax);	751	MAP_OUT (shopmax);
936	if (shoprace) MAP_OUT (shoprace);	752	if (shoprace) MAP_OUT (shoprace);
		753
937	MAP_OUT (darkness);	754	MAP_OUT (darkness);
938	MAP_OUT (width);	755	MAP_OUT (width);
939	MAP_OUT (height);	756	MAP_OUT (height);
940	MAP_OUT (enter_x);	757	MAP_OUT (enter_x);
941	MAP_OUT (enter_y);	758	MAP_OUT (enter_y);
…		…
957	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);	774	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]);	775	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]);	776	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]);	777	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
961		778
962	MAP_OUT2 (end, 0);	779	freezer.put (this);
		780	freezer.put (KW_end);
963		781
964	return true;	782	return true;
965	}	783	}
966		784
967	bool	785	bool
968	maptile::save_header (const char *path)	786	maptile::_save_header (const char *path)
969	{	787	{
970	object_freezer freezer;	788	object_freezer freezer;
971		789
972	if (!save_header (freezer))	790	if (!_save_header (freezer))
973	return false;	791	return false;
974		792
975	return freezer.save (path);	793	return freezer.save (path);
976	}	794	}
		795
		796	//+GPL
977		797
978	/*	798	/*
979	* Remove and free all objects in the given map.	799	* Remove and free all objects in the given map.
980	*/	800	*/
981	void	801	void
982	maptile::clear ()	802	maptile::clear ()
983	{	803	{
984	if (!spaces)	804	if (spaces)
985	return;	805	{
986
987	for (mapspace *ms = spaces + size (); ms-- > spaces; )	806	for (mapspace *ms = spaces + size (); ms-- > spaces; )
988	while (object *op = ms->bot)	807	while (object *op = ms->bot)
989	{	808	{
		809	// manually remove, as to not trigger anything
		810	if (ms->bot = op->above)
		811	ms->bot->below = 0;
		812
		813	op->flag [FLAG_REMOVED] = true;
		814
		815	object *head = op->head_ ();
990	if (op->head)	816	if (op == head)
991	op = op->head;
992
993	op->destroy_inv (false);
994	op->destroy ();	817	op->destroy ();
		818	else if (head->map != op->map)
		819	{
		820	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		821	head->destroy ();
		822	}
		823	}
		824
		825	sfree0 (spaces, size ());
995	}	826	}
996
997	sfree (spaces, size ()), spaces = 0;
998		827
999	if (buttons)	828	if (buttons)
1000	free_objectlinkpt (buttons), buttons = 0;	829	free_objectlinkpt (buttons), buttons = 0;
		830
		831	sfree0 (regions, size ());
		832	delete [] regionmap; regionmap = 0;
1001	}	833	}
1002		834
1003	void	835	void
1004	maptile::clear_header ()	836	maptile::clear_header ()
1005	{	837	{
…		…
1037	attachable::do_destroy ();	869	attachable::do_destroy ();
1038		870
1039	clear ();	871	clear ();
1040	}	872	}
1041		873
1042	/*	874	/* decay and destroy perishable items in a map */
1043	* Updates every button on the map (by calling update_button() for them).
1044	*/
1045	void	875	void
1046	maptile::update_buttons ()	876	maptile::do_decay_objects ()
1047	{	877	{
1048	for (oblinkpt *obp = buttons; obp; obp = obp->next)	878	if (!spaces)
1049	for (objectlink *ol = obp->link; ol; ol = ol->next)	879	return;
		880
		881	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		882	for (object above, op = ms->bot; op; op = above)
1050	{	883	{
1051	if (!ol->ob)	884	above = op->above;
		885
		886	bool destroy = 0;
		887
		888	// do not decay anything above unique floor tiles (yet :)
		889	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
		890	break;
		891
		892	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
		893	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
		894	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
		895	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
		896	\|\| QUERY_FLAG (op, FLAG_UNPAID)
		897	\|\| op->is_alive ())
		898	; // do not decay
		899	else if (op->is_weapon ())
1052	{	900	{
1053	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",	901	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);	902	if (op->stats.dam < 0)
1055	continue;	903	destroy = 1;
1056	}	904	}
1057		905	else if (op->is_armor ())
1058	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
1059	{	906	{
1060	update_button (ol->ob);	907	op->stats.ac--;
1061	break;	908	if (op->stats.ac < 0)
		909	destroy = 1;
1062	}	910	}
		911	else if (op->type == FOOD)
		912	{
		913	op->stats.food -= rndm (5, 20);
		914	if (op->stats.food < 0)
		915	destroy = 1;
		916	}
		917	else
		918	{
		919	int mat = op->materials;
		920
		921	if (mat & M_PAPER
		922	\|\| mat & M_LEATHER
		923	\|\| mat & M_WOOD
		924	\|\| mat & M_ORGANIC
		925	\|\| mat & M_CLOTH
		926	\|\| mat & M_LIQUID
		927	\|\| (mat & M_IRON && rndm (1, 5) == 1)
		928	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
		929	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
		930	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
		931	\|\| (mat & M_ICE && temp > 32))
		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;
…		…
1091		966
1092	if (QUERY_FLAG (op, FLAG_GENERATOR))	967	if (QUERY_FLAG (op, 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, anywhere = 0;
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;
1165		1035
1166	middle = blank_face;	1036	//object *middle = 0;
1167	top = blank_face;	1037	//object *top = 0;
1168	floor = blank_face;	1038	//object *floor = 0;
		1039	// this seems to generate better code than using locals, above
		1040	object *&top = faces_obj[0] = 0;
		1041	object *&middle = faces_obj[1] = 0;
		1042	object *&floor = faces_obj[2] = 0;
1169		1043
1170	middle_obj = 0;
1171	top_obj = 0;
1172	floor_obj = 0;
1173
1174	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1044	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1175	{	1045	{
1176	/* This could be made additive I guess (two lights better than	1046	// 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;	1047	light += tmp->glow_radius;
1183		1048
1184	/* This call is needed in order to update objects the player	1049	/* This call is needed in order to update objects the player
1185	* is standing in that have animations (ie, grass, fire, etc).	1050	* is standing in that have animations (ie, grass, fire, etc).
1186	* However, it also causes the look window to be re-drawn	1051	* However, it also causes the look window to be re-drawn
1187	* 3 times each time the player moves, because many of the	1052	* 3 times each time the player moves, because many of the
…		…
1190	* Always put the player down for drawing.	1055	* Always put the player down for drawing.
1191	*/	1056	*/
1192	if (!tmp->invisible)	1057	if (!tmp->invisible)
1193	{	1058	{
1194	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))	1059	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))
1195	{
1196	top = tmp->face;
1197	top_obj = tmp;	1060	top = tmp;
1198	}
1199	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1061	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1200	{	1062	{
1201	/* If we got a floor, that means middle and top were below it,	1063	/* If we got a floor, that means middle and top were below it,
1202	* so should not be visible, so we clear them.	1064	* so should not be visible, so we clear them.
1203	*/	1065	*/
1204	middle = blank_face;	1066	middle = 0;
1205	top = blank_face;	1067	top = 0;
1206	floor = tmp->face;
1207	floor_obj = tmp;	1068	floor = tmp;
1208	}	1069	}
1209	/* Flag anywhere have high priority */	1070	/* Flag anywhere have high priority */
1210	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))	1071	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1211	{	1072	{
1212	middle = tmp->face;
1213
1214	middle_obj = tmp;	1073	middle = tmp;
1215	anywhere = 1;	1074	anywhere = 1;
1216	}	1075	}
		1076
1217	/* Find the highest visible face around. If equal	1077	/* Find the highest visible face around. If equal
1218	* visibilities, we still want the one nearer to the	1078	* visibilities, we still want the one nearer to the
1219	* top	1079	* top
1220	*/	1080	*/
1221	else if (middle == blank_face \|\| (tmp->face->visibility > middle->visibility && !anywhere))	1081	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1222	{
1223	middle = tmp->face;
1224	middle_obj = tmp;	1082	middle = tmp;
1225	}
1226	}	1083	}
1227		1084
1228	if (tmp == tmp->above)	1085	if (tmp == tmp->above)
1229	{	1086	{
1230	LOG (llevError, "Error in structure of map\n");	1087	LOG (llevError, "Error in structure of map\n");
…		…
1243	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1100	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1244	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;	1101	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1245	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;	1102	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1246	}	1103	}
1247		1104
1248	this->light = light;	1105	this->light = min (light, MAX_LIGHT_RADIUS);
1249	this->flags_ = flags;	1106	this->flags_ = flags;
1250	this->move_block = move_block & ~move_allow;	1107	this->move_block = move_block & ~move_allow;
1251	this->move_on = move_on;	1108	this->move_on = move_on;
1252	this->move_off = move_off;	1109	this->move_off = move_off;
1253	this->move_slow = move_slow;	1110	this->move_slow = move_slow;
…		…
1265	* middle face. This should not happen, as we already have the	1122	* middle face. This should not happen, as we already have the
1266	* else statement above so middle should not get set. OTOH, it	1123	* else statement above so middle should not get set. OTOH, it
1267	* may be possible for the faces to match but be different objects.	1124	* may be possible for the faces to match but be different objects.
1268	*/	1125	*/
1269	if (top == middle)	1126	if (top == middle)
1270	middle = blank_face;	1127	middle = 0;
1271		1128
1272	/* There are three posibilities at this point:	1129	/* There are three posibilities at this point:
1273	* 1) top face is set, need middle to be set.	1130	* 1) top face is set, need middle to be set.
1274	* 2) middle is set, need to set top.	1131	* 2) middle is set, need to set top.
1275	* 3) neither middle or top is set - need to set both.	1132	* 3) neither middle or top is set - need to set both.
1276	*/	1133	*/
1277		1134
1278	for (tmp = last; tmp; tmp = tmp->below)	1135	for (object *tmp = last; tmp; tmp = tmp->below)
1279	{	1136	{
1280	/* Once we get to a floor, stop, since we already have a floor object */	1137	/* Once we get to a floor, stop, since we already have a floor object */
1281	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1138	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1282	break;	1139	break;
1283		1140
1284	/* If two top faces are already set, quit processing */	1141	/* If two top faces are already set, quit processing */
1285	if ((top != blank_face) && (middle != blank_face))	1142	if (top && middle)
1286	break;	1143	break;
1287		1144
1288	/* Only show visible faces, unless its the editor - show all */	1145	/* Only show visible faces */
1289	if (!tmp->invisible \|\| editor)	1146	if (!tmp->invisible)
1290	{	1147	{
1291	/* Fill in top if needed */	1148	/* Fill in top if needed */
1292	if (top == blank_face)	1149	if (!top)
1293	{	1150	{
1294	top = tmp->face;
1295	top_obj = tmp;	1151	top = tmp;
1296	if (top == middle)	1152	if (top == middle)
1297	middle = blank_face;	1153	middle = 0;
1298	}	1154	}
1299	else	1155	else
1300	{	1156	{
1301	/* top is already set - we should only get here if	1157	/* top is already set - we should only get here if
1302	* middle is not set	1158	* middle is not set
1303	*	1159	*
1304	* Set the middle face and break out, since there is nothing	1160	* Set the middle face and break out, since there is nothing
1305	* more to fill in. We don't check visiblity here, since	1161	* more to fill in. We don't check visiblity here, since
1306	*	1162	*
1307	*/	1163	*/
1308	if (tmp->face != top)	1164	if (tmp != top)
1309	{	1165	{
1310	middle = tmp->face;
1311	middle_obj = tmp;	1166	middle = tmp;
1312	break;	1167	break;
1313	}	1168	}
1314	}	1169	}
1315	}	1170	}
1316	}	1171	}
1317		1172
1318	if (middle == floor)	1173	if (middle == floor)
1319	middle = blank_face;	1174	middle = 0;
1320		1175
1321	if (top == middle)	1176	if (top == middle)
1322	middle = blank_face;	1177	middle = 0;
1323		1178
1324	faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;	1179	#if 0
1325	faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;	1180	faces_obj [0] = top;
1326	faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;	1181	faces_obj [1] = middle;
		1182	faces_obj [2] = floor;
		1183	#endif
1327	}	1184	}
1328		1185
1329	/* this updates the orig_map->tile_map[tile_num] value after loading	1186	uint64
1330	* the map. It also takes care of linking back the freshly loaded	1187	mapspace::volume () const
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	{	1188	{
1338	maptile *mp = orig_map->find_map (orig_map->tile_path[tile_num]);	1189	uint64 vol = 0;
1339	mp->load ();
1340		1190
1341	int dest_tile = (tile_num + 2) % 4;	1191	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
		1192	vol += op->volume ();
1342		1193
1343	orig_map->tile_map[tile_num] = mp;	1194	return vol;
		1195	}
1344		1196
1345	/* need to do a strcmp here as the orig_map->path is not a shared string */	1197	maptile *
1346	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] && orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)	1198	maptile::tile_available (int dir, bool load)
1347	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;	1199	{
		1200	if (tile_path[dir])
		1201	{
		1202	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
		1203	return tile_map[dir];
1348		1204
		1205	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1206	return tile_map[dir];
		1207	}
		1208
1349	return mp;	1209	return 0;
1350	}	1210	}
1351		1211
1352	/* this returns TRUE if the coordinates (x,y) are out of	1212	/* this returns TRUE if the coordinates (x,y) are out of
1353	* map m. This function also takes into account any	1213	* map m. This function also takes into account any
1354	* tiling considerations, loading adjacant maps as needed.	1214	* tiling considerations, loading adjacant maps as needed.
…		…
1367	if (!m)	1227	if (!m)
1368	return 0;	1228	return 0;
1369		1229
1370	if (x < 0)	1230	if (x < 0)
1371	{	1231	{
1372	if (!m->tile_path[3])	1232	if (!m->tile_available (3))
1373	return 1;	1233	return 1;
1374		1234
1375	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1376	load_and_link_tiled_map (m, 3);
1377
1378	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1235	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1379	}	1236	}
1380		1237
1381	if (x >= m->width)	1238	if (x >= m->width)
1382	{	1239	{
1383	if (!m->tile_path[1])	1240	if (!m->tile_available (1))
1384	return 1;	1241	return 1;
1385		1242
1386	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1387	load_and_link_tiled_map (m, 1);
1388
1389	return out_of_map (m->tile_map[1], x - m->width, y);	1243	return out_of_map (m->tile_map[1], x - m->width, y);
1390	}	1244	}
1391		1245
1392	if (y < 0)	1246	if (y < 0)
1393	{	1247	{
1394	if (!m->tile_path[0])	1248	if (!m->tile_available (0))
1395	return 1;	1249	return 1;
1396		1250
1397	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1398	load_and_link_tiled_map (m, 0);
1399
1400	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1251	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1401	}	1252	}
1402		1253
1403	if (y >= m->height)	1254	if (y >= m->height)
1404	{	1255	{
1405	if (!m->tile_path[2])	1256	if (!m->tile_available (2))
1406	return 1;	1257	return 1;
1407
1408	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1409	load_and_link_tiled_map (m, 2);
1410		1258
1411	return out_of_map (m->tile_map[2], x, y - m->height);	1259	return out_of_map (m->tile_map[2], x, y - m->height);
1412	}	1260	}
1413		1261
1414	/* Simple case - coordinates are within this local	1262	/* Simple case - coordinates are within this local
…		…
1419		1267
1420	/* This is basically the same as out_of_map above, but	1268	/* This is basically the same as out_of_map above, but
1421	* instead we return NULL if no map is valid (coordinates	1269	* instead we return NULL if no map is valid (coordinates
1422	* out of bounds and no tiled map), otherwise it returns	1270	* out of bounds and no tiled map), otherwise it returns
1423	* the map as that the coordinates are really on, and	1271	* the map as that the coordinates are really on, and
1424	* updates x and y to be the localized coordinates.	1272	* updates x and y to be the localised coordinates.
1425	* Using this is more efficient of calling out_of_map	1273	* Using this is more efficient of calling out_of_map
1426	* and then figuring out what the real map is	1274	* and then figuring out what the real map is
1427	*/	1275	*/
1428	maptile *	1276	maptile *
1429	get_map_from_coord (maptile m, sint16 x, sint16 *y)	1277	maptile::xy_find (sint16 &x, sint16 &y)
1430	{	1278	{
1431	if (*x < 0)	1279	if (x < 0)
1432	{	1280	{
1433	if (!m->tile_path[3])	1281	if (!tile_available (3))
1434	return 0;	1282	return 0;
1435		1283
1436	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1437	load_and_link_tiled_map (m, 3);
1438
1439	*x += m->tile_map[3]->width;	1284	x += tile_map[3]->width;
1440	return (get_map_from_coord (m->tile_map[3], x, y));	1285	return tile_map[3]->xy_find (x, y);
1441	}	1286	}
1442		1287
1443	if (*x >= m->width)	1288	if (x >= width)
1444	{	1289	{
1445	if (!m->tile_path[1])	1290	if (!tile_available (1))
1446	return 0;	1291	return 0;
1447		1292
1448	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1449	load_and_link_tiled_map (m, 1);
1450
1451	*x -= m->width;	1293	x -= width;
1452	return (get_map_from_coord (m->tile_map[1], x, y));	1294	return tile_map[1]->xy_find (x, y);
1453	}	1295	}
1454		1296
1455	if (*y < 0)	1297	if (y < 0)
1456	{	1298	{
1457	if (!m->tile_path[0])	1299	if (!tile_available (0))
1458	return 0;	1300	return 0;
1459		1301
1460	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1461	load_and_link_tiled_map (m, 0);
1462
1463	*y += m->tile_map[0]->height;	1302	y += tile_map[0]->height;
1464	return (get_map_from_coord (m->tile_map[0], x, y));	1303	return tile_map[0]->xy_find (x, y);
1465	}	1304	}
1466		1305
1467	if (*y >= m->height)	1306	if (y >= height)
1468	{	1307	{
1469	if (!m->tile_path[2])	1308	if (!tile_available (2))
1470	return 0;	1309	return 0;
1471		1310
1472	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1473	load_and_link_tiled_map (m, 2);
1474
1475	*y -= m->height;	1311	y -= height;
1476	return (get_map_from_coord (m->tile_map[2], x, y));	1312	return tile_map[2]->xy_find (x, y);
1477	}	1313	}
1478		1314
1479	/* Simple case - coordinates are within this local	1315	/* Simple case - coordinates are within this local
1480	* map.	1316	* map.
1481	*/	1317	*/
1482	return m;	1318	return this;
1483	}	1319	}
1484		1320
1485	/**	1321	/**
1486	* Return whether map2 is adjacent to map1. If so, store the distance from	1322	* Return whether map2 is adjacent to map1. If so, store the distance from
1487	* map1 to map2 in dx/dy.	1323	* map1 to map2 in dx/dy.
1488	*/	1324	*/
1489	static int	1325	int
1490	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1326	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1491	{	1327	{
1492	if (!map1 \|\| !map2)	1328	if (!map1 \|\| !map2)
1493	return 0;	1329	return 0;
1494		1330
		1331	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
		1332	//fix: compare paths instead (this is likely faster, too!)
1495	if (map1 == map2)	1333	if (map1 == map2)
1496	{	1334	{
1497	*dx = 0;	1335	*dx = 0;
1498	*dy = 0;	1336	*dy = 0;
1499	}	1337	}
…		…
1559	}	1397	}
1560	else	1398	else
1561	return 0;	1399	return 0;
1562		1400
1563	return 1;	1401	return 1;
		1402	}
		1403
		1404	maptile *
		1405	maptile::xy_load (sint16 &x, sint16 &y)
		1406	{
		1407	maptile *map = xy_find (x, y);
		1408
		1409	if (map)
		1410	map->load_sync ();
		1411
		1412	return map;
		1413	}
		1414
		1415	maptile *
		1416	get_map_from_coord (maptile m, sint16 x, sint16 *y)
		1417	{
		1418	return m->xy_load (x, y);
1564	}	1419	}
1565		1420
1566	/* From map.c	1421	/* From map.c
1567	* This is used by get_player to determine where the other	1422	* This is used by get_player to determine where the other
1568	* creature is. get_rangevector takes into account map tiling,	1423	* creature is. get_rangevector takes into account map tiling,
1569	* so you just can not look the the map coordinates and get the	1424	* so you just can not look the the map coordinates and get the
1570	* righte value. distance_x/y are distance away, which	1425	* righte value. distance_x/y are distance away, which
1571	* can be negativbe. direction is the crossfire direction scheme	1426	* can be negative. direction is the crossfire direction scheme
1572	* that the creature should head. part is the part of the	1427	* that the creature should head. part is the part of the
1573	* monster that is closest.	1428	* monster that is closest.
1574	*	1429	*
1575	* get_rangevector looks at op1 and op2, and fills in the	1430	* get_rangevector looks at op1 and op2, and fills in the
1576	* structure for op1 to get to op2.	1431	* structure for op1 to get to op2.
…		…
1587	get_rangevector (object op1, object op2, rv_vector * retval, int flags)	1442	get_rangevector (object op1, object op2, rv_vector * retval, int flags)
1588	{	1443	{
1589	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1444	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1590	{	1445	{
1591	/* be conservative and fill in _some_ data */	1446	/* be conservative and fill in _some_ data */
1592	retval->distance = 100000;	1447	retval->distance = 10000;
1593	retval->distance_x = 32767;	1448	retval->distance_x = 10000;
1594	retval->distance_y = 32767;	1449	retval->distance_y = 10000;
1595	retval->direction = 0;	1450	retval->direction = 0;
1596	retval->part = 0;	1451	retval->part = 0;
1597	}	1452	}
1598	else	1453	else
1599	{	1454	{
…		…
1604		1459
1605	best = op1;	1460	best = op1;
1606	/* If this is multipart, find the closest part now */	1461	/* If this is multipart, find the closest part now */
1607	if (!(flags & 0x1) && op1->more)	1462	if (!(flags & 0x1) && op1->more)
1608	{	1463	{
1609	object *tmp;
1610	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;	1464	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1611		1465
1612	/* we just take the offset of the piece to head to figure	1466	/* we just take the offset of the piece to head to figure
1613	* distance instead of doing all that work above again	1467	* distance instead of doing all that work above again
1614	* since the distance fields we set above are positive in the	1468	* since the distance fields we set above are positive in the
1615	* same axis as is used for multipart objects, the simply arithmetic	1469	* same axis as is used for multipart objects, the simply arithmetic
1616	* below works.	1470	* below works.
1617	*/	1471	*/
1618	for (tmp = op1->more; tmp != NULL; tmp = tmp->more)	1472	for (object *tmp = op1->more; tmp; tmp = tmp->more)
1619	{	1473	{
1620	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +	1474	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1621	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1475	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1622	if (tmpi < best_distance)	1476	if (tmpi < best_distance)
1623	{	1477	{
1624	best_distance = tmpi;	1478	best_distance = tmpi;
1625	best = tmp;	1479	best = tmp;
1626	}	1480	}
1627	}	1481	}
		1482
1628	if (best != op1)	1483	if (best != op1)
1629	{	1484	{
1630	retval->distance_x += op1->x - best->x;	1485	retval->distance_x += op1->x - best->x;
1631	retval->distance_y += op1->y - best->y;	1486	retval->distance_y += op1->y - best->y;
1632	}	1487	}
1633	}	1488	}
		1489
1634	retval->part = best;	1490	retval->part = best;
1635	retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);	1491	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1636	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1492	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1637	}	1493	}
1638	}	1494	}
1639		1495
1640	/* this is basically the same as get_rangevector above, but instead of	1496	/* this is basically the same as get_rangevector above, but instead of
…		…
1645	* flags has no meaning for this function at this time - I kept it in to	1501	* flags has no meaning for this function at this time - I kept it in to
1646	* be more consistant with the above function and also in case they are needed	1502	* be more consistant with the above function and also in case they are needed
1647	* for something in the future. Also, since no object is pasted, the best	1503	* for something in the future. Also, since no object is pasted, the best
1648	* field of the rv_vector is set to NULL.	1504	* field of the rv_vector is set to NULL.
1649	*/	1505	*/
1650
1651	void	1506	void
1652	get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector * retval, int flags)	1507	get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags)
1653	{	1508	{
1654	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))	1509	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1655	{	1510	{
1656	/* be conservative and fill in _some_ data */	1511	/* be conservative and fill in _some_ data */
1657	retval->distance = 100000;	1512	retval->distance = 100000;
…		…
1663	else	1518	else
1664	{	1519	{
1665	retval->distance_x += op2->x - x;	1520	retval->distance_x += op2->x - x;
1666	retval->distance_y += op2->y - y;	1521	retval->distance_y += op2->y - y;
1667		1522
1668	retval->part = NULL;	1523	retval->part = 0;
1669	retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);	1524	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1670	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1525	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1671	}	1526	}
1672	}	1527	}
1673		1528
1674	/* Returns true of op1 and op2 are effectively on the same map	1529	/* Returns true of op1 and op2 are effectively on the same map
…		…
1685	int dx, dy;	1540	int dx, dy;
1686		1541
1687	return adjacent_map (op1->map, op2->map, &dx, &dy);	1542	return adjacent_map (op1->map, op2->map, &dx, &dy);
1688	}	1543	}
1689		1544
		1545	//-GPL
		1546
1690	object *	1547	object *
1691	maptile::insert (object op, int x, int y, object originator, int flags)	1548	maptile::insert (object op, int x, int y, object originator, int flags)
1692	{	1549	{
1693	if (!op->flag [FLAG_REMOVED])
1694	op->remove ();
1695
1696	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1550	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1697	}	1551	}
1698		1552
		1553	region *
		1554	maptile::region (int x, int y) const
		1555	{
		1556	if (regions
		1557	&& regionmap
		1558	&& !OUT_OF_REAL_MAP (this, x, y))
		1559	if (struct region reg = regionmap [regions [y width + x]])
		1560	return reg;
		1561
		1562	if (default_region)
		1563	return default_region;
		1564
		1565	return ::region::default_region ();
		1566	}
		1567
		1568	//+GPL
		1569
		1570	/* picks a random object from a style map.
		1571	*/
		1572	object *
		1573	maptile::pick_random_object (rand_gen &gen) const
		1574	{
		1575	/* while returning a null object will result in a crash, that
		1576	* is actually preferable to an infinite loop. That is because
		1577	* most servers will automatically restart in case of crash.
		1578	* Change the logic on getting the random space - shouldn't make
		1579	* any difference, but this seems clearer to me.
		1580	*/
		1581	for (int i = 1000; --i;)
		1582	{
		1583	object *pick = at (gen (width), gen (height)).bot;
		1584
		1585	// do not prefer big monsters just because they are big.
		1586	if (pick && pick->is_head ())
		1587	return pick->head_ ();
		1588	}
		1589
		1590	// instead of crashing in the unlikely(?) case, try to return something
		1591	return archetype::find ("bug");
		1592	}
		1593
		1594	//-GPL
		1595
		1596	void
		1597	maptile::play_sound (faceidx sound, int x, int y) const
		1598	{
		1599	if (!sound)
		1600	return;
		1601
		1602	for_all_players_on_map (pl, this)
		1603	if (client *ns = pl->ns)
		1604	{
		1605	int dx = x - pl->ob->x;
		1606	int dy = y - pl->ob->y;
		1607
		1608	int distance = idistance (dx, dy);
		1609
		1610	if (distance <= MAX_SOUND_DISTANCE)
		1611	ns->play_sound (sound, dx, dy);
		1612	}
		1613	}
		1614
		1615	void
		1616	maptile::say_msg (const char *msg, int x, int y) const
		1617	{
		1618	for_all_players (pl)
		1619	if (client *ns = pl->ns)
		1620	{
		1621	int dx = x - pl->ob->x;
		1622	int dy = y - pl->ob->y;
		1623
		1624	int distance = idistance (dx, dy);
		1625
		1626	if (distance <= MAX_SOUND_DISTANCE)
		1627	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
		1628	}
		1629	}
		1630
		1631	static void
		1632	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1633	{
		1634	// clip to map to the left
		1635	if (x0 < 0)
		1636	{
		1637	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1638	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1639
		1640	if (x1 < 0) // entirely to the left
		1641	return;
		1642
		1643	x0 = 0;
		1644	}
		1645
		1646	// clip to map to the right
		1647	if (x1 > m->width)
		1648	{
		1649	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1650	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1651
		1652	if (x0 > m->width) // entirely to the right
		1653	return;
		1654
		1655	x1 = m->width;
		1656	}
		1657
		1658	// clip to map above
		1659	if (y0 < 0)
		1660	{
		1661	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1662	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1663
		1664	if (y1 < 0) // entirely above
		1665	return;
		1666
		1667	y0 = 0;
		1668	}
		1669
		1670	// clip to map below
		1671	if (y1 > m->height)
		1672	{
		1673	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1674	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1675
		1676	if (y0 > m->height) // entirely below
		1677	return;
		1678
		1679	y1 = m->height;
		1680	}
		1681
		1682	// if we get here, the rect is within the current map
		1683	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1684
		1685	r->m = m;
		1686	r->x0 = x0;
		1687	r->y0 = y0;
		1688	r->x1 = x1;
		1689	r->y1 = y1;
		1690	r->dx = dx;
		1691	r->dy = dy;
		1692	}
		1693
		1694	maprect *
		1695	maptile::split_to_tiles (int x0, int y0, int x1, int y1)
		1696	{
		1697	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
		1698	buf.clear ();
		1699
		1700	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1701
		1702	// add end marker
		1703	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1704	r->m = 0;
		1705
		1706	return (maprect *)buf.linearise ();
		1707	}
		1708

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.58 by root, Sat Dec 30 18:45:27 2006 UTC vs. Revision 1.167 by root, Thu Nov 5 15:43:21 2009 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.58 by root, Sat Dec 30 18:45:27 2006 UTC vs.
Revision 1.167 by root, Thu Nov 5 15:43:21 2009 UTC