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

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

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.63 by root, Mon Jan 1 00:41:02 2007 UTC vs. Revision 1.178 by root, Sun Nov 29 09:41:27 2009 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.63 by root, Mon Jan 1 00:41:02 2007 UTC vs.
Revision 1.178 by root, Sun Nov 29 09:41:27 2009 UTC