ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/map.C

Comparing deliantra/server/common/map.C (file contents):
Revision 1.62 by root, Sun Dec 31 22:23:11 2006 UTC vs.
Revision 1.172 by root, Sun Nov 8 20:55:39 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
…		…
307	* into inventory, but just links them. What this does is go through	223	* into inventory, but just links them. What this does is go through
308	* and insert them properly.	224	* and insert them properly.
309	* The object 'container' is the object that contains the inventory.	225	* The object 'container' is the object that contains the inventory.
310	* This is needed so that we can update the containers weight.	226	* This is needed so that we can update the containers weight.
311	*/	227	*/
312	void	228	static void
313	fix_container (object *container)	229	fix_container (object *container)
314	{	230	{
315	object *tmp = container->inv, *next;	231	object *tmp = container->inv, *next;
316		232
317	container->inv = 0;	233	container->inv = 0;
…		…
323		239
324	insert_ob_in_ob (tmp, container);	240	insert_ob_in_ob (tmp, container);
325	tmp = next;	241	tmp = next;
326	}	242	}
327		243
328	/* sum_weight will go through and calculate what all the containers are	244	// go through and calculate what all the containers are carrying.
329	* carrying.	245	//TODO: remove
330	*/	246	container->update_weight ();
331	sum_weight (container);
332	}	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
333		276
334	/* 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
335	* 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
336	* 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
337	* they are saved). We do have to look for the old maps that did save	280	* they are saved).
338	* the more sections and not re-add sections for them.
339	*/	281	*/
340	void	282	void
341	maptile::link_multipart_objects ()	283	maptile::link_multipart_objects ()
342	{	284	{
343	if (!spaces)	285	if (!spaces)
344	return;	286	return;
345		287
346	for (mapspace *ms = spaces + size (); ms-- > spaces; )	288	for (mapspace *ms = spaces + size (); ms-- > spaces; )
347	for (object *tmp = ms->bot; tmp; )	289	{
		290	object *op = ms->bot;
		291	while (op)
348	{	292	{
349	object *above = tmp->above;
350
351	/* already multipart - don't do anything more */	293	/* already multipart - don't do anything more */
352	if (!tmp->head && !tmp->more)	294	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	{	295	{
363	op = arch_to_object (at);	296	op->remove ();
		297	op->expand_tail ();
364		298
365	/* update x,y coordinates */	299	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
366	op->x += tmp->x;	300	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
367	op->y += tmp->y;	301	// 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);	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
380	}	306	}
		307	else
		308	op = op->above;
381	}	309	}
382
383	tmp = above;
384	}	310	}
385	}	311	}
		312
		313	//-GPL
386		314
387	/*	315	/*
388	* 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
389	* file pointer.	317	* file pointer.
390	* mapflags is the same as we get with load_original_map
391	*/	318	*/
392	bool	319	bool
393	maptile::load_objects (object_thawer &thawer)	320	maptile::_load_objects (object_thawer &f)
394	{	321	{
395	int unique;	322	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	{	323	{
403	/* if the archetype for the object is null, means that we	324	coroapi::cede_to_tick (); // cede once in a while
404	* got an invalid object. Don't do anything with it - the game	325
405	* or editor will not be able to do anything with it either.	326	switch (f.kw)
406	*/
407	if (op->arch == NULL)
408	{	327	{
409	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
410	continue;	360	continue;
411	}
412		361
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:	362	case KW_EOF:
425	insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY);	363	return true;
426	op->head = prev, last_more->more = op, last_more = op;	364
		365	default:
		366	if (!f.parse_error ("map file"))
		367	return false;
427	break;	368	break;
428	}	369	}
429		370
430	op = object::create ();	371	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	}	372	}
451	#endif
452		373
453	return true;	374	return true;
454	}	375	}
455		376
456	void	377	void
457	maptile::activate ()	378	maptile::activate ()
458	{	379	{
459	if (!spaces)	380	if (spaces)
460	return;
461
462	for (mapspace *ms = spaces + size (); ms-- > spaces; )	381	for (mapspace *ms = spaces + size (); ms-- > spaces; )
463	for (object *op = ms->bot; op; op = op->above)	382	for (object *op = ms->bot; op; op = op->above)
464	op->activate_recursive ();	383	op->activate_recursive ();
465	}	384	}
466		385
467	void	386	void
468	maptile::deactivate ()	387	maptile::deactivate ()
469	{	388	{
470	if (!spaces)	389	if (spaces)
471	return;
472
473	for (mapspace *ms = spaces + size (); ms-- > spaces; )	390	for (mapspace *ms = spaces + size (); ms-- > spaces; )
474	for (object *op = ms->bot; op; op = op->above)	391	for (object *op = ms->bot; op; op = op->above)
475	op->deactivate_recursive ();	392	op->deactivate_recursive ();
476	}	393	}
477		394
478	bool	395	bool
479	maptile::save_objects (object_freezer &freezer, int flags)	396	maptile::_save_objects (object_freezer &f, int flags)
480	{	397	{
		398	coroapi::cede_to_tick ();
		399
481	if (flags & IO_HEADER)	400	if (flags & IO_HEADER)
482	save_header (freezer);	401	_save_header (f);
483		402
484	if (!spaces)	403	if (!spaces)
485	return false;	404	return false;
486		405
487	for (int i = 0; i < size (); ++i)	406	for (int i = 0; i < size (); ++i)
488	{	407	{
489	int unique = 0;	408	bool unique = 0;
		409
490	for (object *op = spaces [i].bot; op; op = op->above)	410	for (object *op = spaces [i].bot; op; op = op->above)
491	{	411	{
492	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	412	unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
493	unique = 1;
494		413
495	if (!op->can_map_save ())	414	if (expect_false (!op->can_map_save ()))
496	continue;	415	continue;
497		416
498	if (unique || op->flag [FLAG_UNIQUE])	417	if (expect_false (unique || op->flag [FLAG_UNIQUE]))
499	{	418	{
500	if (flags & IO_UNIQUES)	419	if (flags & IO_UNIQUES)
501	save_object (freezer, op, 1);	420	op->write (f);
502	}	421	}
503	else if (flags & IO_OBJECTS)	422	else if (expect_true (flags & IO_OBJECTS))
504	save_object (freezer, op, 1);	423	op->write (f);
505	}	424	}
506	}	425	}
507		426
		427	coroapi::cede_to_tick ();
		428
508	return true;	429	return true;
509	}	430	}
510		431
511	bool	432	bool
512	maptile::load_objects (const char *path, bool skip_header)	433	maptile::_save_objects (const char *path, int flags)
513	{	434	{
514	object_thawer thawer (path);	435	object_freezer freezer;
515		436
516	if (!thawer)	437	if (!_save_objects (freezer, flags))
517	return false;	438	return false;
518		439
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);	440	return freezer.save (path);
542	}	441	}
543		442
544	maptile::maptile ()	443	maptile::maptile ()
545	{	444	{
546	in_memory = MAP_SWAPPED;	445	in_memory = MAP_SWAPPED;
547		446
548	/* 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
549	* map archetype. Mimic that behaviour.	448	* map archetype. Mimic that behaviour.
550	*/	449	*/
551	width = 16;	450	width = 16;
552	height = 16;	451	height = 16;
553	reset_timeout = 0;
554	timeout = 300;	452	timeout = 300;
555	enter_x = 0;	453	max_nrof = 1000; // 1000 items of anything
556	enter_y = 0;	454	max_items = MAX_ITEM_PER_ACTION;
		455	max_volume = 2000000; // 2m³
557	}	456	}
558		457
559	maptile::maptile (int w, int h)	458	maptile::maptile (int w, int h)
560	{	459	{
561	in_memory = MAP_SWAPPED;	460	in_memory = MAP_SWAPPED;
…		…
581	if (spaces)	480	if (spaces)
582	return;	481	return;
583		482
584	spaces = salloc0<mapspace> (size ());	483	spaces = salloc0<mapspace> (size ());
585	}	484	}
		485
		486	//+GPL
586		487
587	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	488	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
588	* corresponding to that string. Memory is allocated for this, it must be freed	489	* corresponding to that string. Memory is allocated for this, it must be freed
589	* at a later date.	490	* at a later date.
590	* Called by parse_map_headers below.	491	* Called by parse_map_headers below.
…		…
667	return items;	568	return items;
668	}	569	}
669		570
670	/* opposite of parse string, this puts the string that was originally fed in to	571	/* opposite of parse string, this puts the string that was originally fed in to
671	* the map (or something equivilent) into output_string. */	572	* the map (or something equivilent) into output_string. */
672	static void	573	static const char *
673	print_shop_string (maptile *m, char *output_string)	574	print_shop_string (maptile *m)
674	{	575	{
675	int i;	576	static dynbuf_text buf; buf.clear ();
676	char tmp[MAX_BUF];
677		577
678	strcpy (output_string, "");
679	for (i = 0; i < m->shopitems[0].index; i++)	578	for (int i = 0; i < m->shopitems[0].index; i++)
680	{	579	{
681	if (m->shopitems[i].typenum)	580	if (m->shopitems[i].typenum)
682	{	581	{
683	if (m->shopitems[i].strength)	582	if (m->shopitems[i].strength)
684	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	583	buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
685	else	584	else
686	sprintf (tmp, "%s;", m->shopitems[i].name);	585	buf.printf ("%s;", m->shopitems[i].name);
687	}	586	}
688	else	587	else
689	{	588	{
690	if (m->shopitems[i].strength)	589	if (m->shopitems[i].strength)
691	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	590	buf.printf ("*:%d;", m->shopitems[i].strength);
692	else	591	else
693	sprintf (tmp, "*");	592	buf.printf ("*");
694	}	593	}
695
696	strcat (output_string, tmp);
697	}	594	}
		595
		596	return buf;
698	}	597	}
		598
		599	//-GPL
699		600
700	/* This loads the header information of the map. The header	601	/* This loads the header information of the map. The header
701	* contains things like difficulty, size, timeout, etc.	602	* contains things like difficulty, size, timeout, etc.
702	* this used to be stored in the map object, but with the	603	* this used to be stored in the map object, but with the
703	* addition of tiling, fields beyond that easily named in an	604	* addition of tiling, fields beyond that easily named in an
…		…
707	* This could be done in lex (like the object loader), but I think	608	* 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.	609	* currently, there are few enough fields this is not a big deal.
709	* MSW 2001-07-01	610	* MSW 2001-07-01
710	*/	611	*/
711	bool	612	bool
712	maptile::load_header (object_thawer &thawer)	613	maptile::_load_header (object_thawer &thawer)
713	{	614	{
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 (;;)	615	for (;;)
719	{	616	{
720	keyword kw = thawer.get_kv ();
721
722	switch (kw)	617	switch (thawer.kw)
723	{	618	{
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:	619	case KW_msg:
732	thawer.get_ml (KW_endmsg, msg);	620	thawer.get_ml (KW_endmsg, msg);
733	break;	621	break;
734		622
735	case KW_lore: // CF+ extension	623	case KW_lore: // CF+ extension
…		…
766	case KW_winddir: thawer.get (winddir); break;	654	case KW_winddir: thawer.get (winddir); break;
767	case KW_sky: thawer.get (sky); break;	655	case KW_sky: thawer.get (sky); break;
768		656
769	case KW_per_player: thawer.get (per_player); break;	657	case KW_per_player: thawer.get (per_player); break;
770	case KW_per_party: thawer.get (per_party); break;	658	case KW_per_party: thawer.get (per_party); break;
		659	case KW_no_reset: thawer.get (no_reset); break;
		660	case KW_no_drop: thawer.get (no_drop); break;
771		661
772	case KW_region: get_region_by_name (thawer.get_str ()); break;	662	case KW_region: default_region = region::find (thawer.get_str ()); break;
773	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	663	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
774		664
775	// old names new names	665	// old names new names
776	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;	666	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
777	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;	667	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
…		…
786	case KW_tile_path_1: thawer.get (tile_path [0]); break;	676	case KW_tile_path_1: thawer.get (tile_path [0]); break;
787	case KW_tile_path_2: thawer.get (tile_path [1]); break;	677	case KW_tile_path_2: thawer.get (tile_path [1]); break;
788	case KW_tile_path_3: thawer.get (tile_path [2]); break;	678	case KW_tile_path_3: thawer.get (tile_path [2]); break;
789	case KW_tile_path_4: thawer.get (tile_path [3]); break;	679	case KW_tile_path_4: thawer.get (tile_path [3]); break;
790		680
		681	case KW_ERROR:
		682	set_key_text (thawer.kw_str, thawer.value);
		683	break;
		684
		685	case KW_end:
		686	thawer.next ();
		687	return true;
		688
791	default:	689	default:
792	LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]);	690	if (!thawer.parse_error ("map", 0))
		691	return false;
793	break;	692	break;
794	}	693	}
		694
		695	thawer.next ();
795	}	696	}
796		697
797	abort ();	698	abort ();
798	}	699	}
799		700
800	bool	701	//+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		702
811	/******************************************************************************	703	/******************************************************************************
812	* This is the start of unique map handling code	704	* This is the start of unique map handling code
813	*****************************************************************************/	705	*****************************************************************************/
814		706
…		…
824	object *above = op->above;	716	object *above = op->above;
825		717
826	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	718	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
827	unique = 1;	719	unique = 1;
828		720
829	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))	721	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
830	{
831	op->destroy_inv (false);
832	op->destroy ();	722	op->destroy ();
833	}
834		723
835	op = above;	724	op = above;
836	}	725	}
837	}	726	}
838	}	727	}
839		728
		729	//-GPL
		730
840	bool	731	bool
841	maptile::save_header (object_freezer &freezer)	732	maptile::_save_header (object_freezer &freezer)
842	{	733	{
843	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	734	#define MAP_OUT(k) freezer.put (KW_ ## k, k)
844	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)	735	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
845		736
846	MAP_OUT2 (arch, "map");	737	MAP_OUT2 (arch, "map");
…		…
848	if (name) MAP_OUT (name);	739	if (name) MAP_OUT (name);
849	MAP_OUT (swap_time);	740	MAP_OUT (swap_time);
850	MAP_OUT (reset_time);	741	MAP_OUT (reset_time);
851	MAP_OUT (reset_timeout);	742	MAP_OUT (reset_timeout);
852	MAP_OUT (fixed_resettime);	743	MAP_OUT (fixed_resettime);
		744	MAP_OUT (no_reset);
		745	MAP_OUT (no_drop);
853	MAP_OUT (difficulty);	746	MAP_OUT (difficulty);
854
855	if (region) MAP_OUT2 (region, region->name);	747	if (default_region) MAP_OUT2 (region, default_region->name);
856		748
857	if (shopitems)	749	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);	750	MAP_OUT (shopgreed);
865	MAP_OUT (shopmin);	751	MAP_OUT (shopmin);
866	MAP_OUT (shopmax);	752	MAP_OUT (shopmax);
867	if (shoprace) MAP_OUT (shoprace);	753	if (shoprace) MAP_OUT (shoprace);
		754
868	MAP_OUT (darkness);	755	MAP_OUT (darkness);
869	MAP_OUT (width);	756	MAP_OUT (width);
870	MAP_OUT (height);	757	MAP_OUT (height);
871	MAP_OUT (enter_x);	758	MAP_OUT (enter_x);
872	MAP_OUT (enter_y);	759	MAP_OUT (enter_y);
…		…
888	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);	775	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]);	776	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]);	777	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]);	778	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
892		779
		780	freezer.put (this);
893	freezer.put (KW_end);	781	freezer.put (KW_end);
894		782
895	return true;	783	return true;
896	}	784	}
897		785
898	bool	786	bool
899	maptile::save_header (const char *path)	787	maptile::_save_header (const char *path)
900	{	788	{
901	object_freezer freezer;	789	object_freezer freezer;
902		790
903	if (!save_header (freezer))	791	if (!_save_header (freezer))
904	return false;	792	return false;
905		793
906	return freezer.save (path);	794	return freezer.save (path);
907	}	795	}
		796
		797	//+GPL
908		798
909	/*	799	/*
910	* Remove and free all objects in the given map.	800	* Remove and free all objects in the given map.
911	*/	801	*/
912	void	802	void
913	maptile::clear ()	803	maptile::clear ()
914	{	804	{
915	if (!spaces)	805	if (spaces)
916	return;	806	{
917
918	for (mapspace *ms = spaces + size (); ms-- > spaces; )	807	for (mapspace *ms = spaces + size (); ms-- > spaces; )
919	while (object *op = ms->bot)	808	while (object *op = ms->bot)
920	{	809	{
		810	// manually remove, as to not trigger anything
		811	if (ms->bot = op->above)
		812	ms->bot->below = 0;
		813
		814	op->flag [FLAG_REMOVED] = true;
		815
		816	object *head = op->head_ ();
921	if (op->head)	817	if (op == head)
922	op = op->head;
923
924	op->destroy_inv (false);
925	op->destroy ();	818	op->destroy ();
		819	else if (head->map != op->map)
		820	{
		821	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		822	head->destroy ();
		823	}
		824	}
		825
		826	sfree0 (spaces, size ());
926	}	827	}
927
928	sfree (spaces, size ()), spaces = 0;
929		828
930	if (buttons)	829	if (buttons)
931	free_objectlinkpt (buttons), buttons = 0;	830	free_objectlinkpt (buttons), buttons = 0;
		831
		832	sfree0 (regions, size ());
		833	delete [] regionmap; regionmap = 0;
932	}	834	}
933		835
934	void	836	void
935	maptile::clear_header ()	837	maptile::clear_header ()
936	{	838	{
…		…
968	attachable::do_destroy ();	870	attachable::do_destroy ();
969		871
970	clear ();	872	clear ();
971	}	873	}
972		874
973	/*	875	/* decay and destroy perishable items in a map */
974	* Updates every button on the map (by calling update_button() for them).
975	*/
976	void	876	void
977	maptile::update_buttons ()	877	maptile::do_decay_objects ()
978	{	878	{
979	for (oblinkpt *obp = buttons; obp; obp = obp->next)	879	if (!spaces)
980	for (objectlink *ol = obp->link; ol; ol = ol->next)	880	return;
		881
		882	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		883	for (object *above, *op = ms->bot; op; op = above)
981	{	884	{
982	if (!ol->ob)	885	above = op->above;
		886
		887	bool destroy = 0;
		888
		889	// do not decay anything above unique floor tiles (yet :)
		890	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
		891	break;
		892
		893	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
		894	|| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
		895	|| QUERY_FLAG (op, FLAG_UNIQUE)
		896	|| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
		897	|| QUERY_FLAG (op, FLAG_UNPAID)
		898	|| op->is_alive ())
		899	; // do not decay
		900	else if (op->is_weapon ())
983	{	901	{
984	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",	902	op->stats.dam--;
985	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);	903	if (op->stats.dam < 0)
986	continue;	904	destroy = 1;
987	}	905	}
988		906	else if (op->is_armor ())
989	if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
990	{	907	{
991	update_button (ol->ob);	908	op->stats.ac--;
992	break;	909	if (op->stats.ac < 0)
		910	destroy = 1;
993	}	911	}
		912	else if (op->type == FOOD)
		913	{
		914	op->stats.food -= rndm (5, 20);
		915	if (op->stats.food < 0)
		916	destroy = 1;
		917	}
		918	else
		919	{
		920	int mat = op->materials;
		921
		922	if (mat & M_PAPER
		923	|| mat & M_LEATHER
		924	|| mat & M_WOOD
		925	|| mat & M_ORGANIC
		926	|| mat & M_CLOTH
		927	|| mat & M_LIQUID
		928	|| (mat & M_IRON && rndm (1, 5) == 1)
		929	|| (mat & M_GLASS && rndm (1, 2) == 1)
		930	|| ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
		931	|| ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
		932	|| (mat & M_ICE && temp > 32))
		933	destroy = 1;
		934	}
		935
		936	/* adjust overall chance below */
		937	if (destroy && rndm (0, 1))
		938	op->destroy ();
994	}	939	}
995	}	940	}
996		941
997	/*	942	/*
998	* This routine is supposed to find out the difficulty of the map.	943	* This routine is supposed to find out the difficulty of the map.
999	* difficulty does not have a lot to do with character level,	944	* difficulty does not have a lot to do with character level,
1000	* but does have a lot to do with treasure on the map.	945	* but does have a lot to do with treasure on the map.
1001	*	946	*
1002	* Difficulty can now be set by the map creature. If the value stored	947	* Difficulty can now be set by the map creator. If the value stored
1003	* in the map is zero, then use this routine. Maps should really	948	* in the map is zero, then use this routine. Maps should really
1004	* have a difficulty set than using this function - human calculation	949	* have a difficulty set rather than using this function - human calculation
1005	* is much better than this functions guesswork.	950	* is much better than this function's guesswork.
1006	*/	951	*/
1007	int	952	int
1008	maptile::estimate_difficulty () const	953	maptile::estimate_difficulty () const
1009	{	954	{
1010	long monster_cnt = 0;	955	long monster_cnt = 0;
…		…
1022		967
1023	if (QUERY_FLAG (op, FLAG_GENERATOR))	968	if (QUERY_FLAG (op, FLAG_GENERATOR))
1024	{	969	{
1025	total_exp += op->stats.exp;	970	total_exp += op->stats.exp;
1026		971
1027	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	972	if (archetype *at = op->other_arch)
		973	{
1028	total_exp += at->clone.stats.exp * 8;	974	total_exp += at->stats.exp * 8;
1029
1030	monster_cnt++;	975	monster_cnt++;
		976	}
		977
		978	for (object *inv = op->inv; inv; inv = inv->below)
		979	{
		980	total_exp += op->stats.exp * 8;
		981	monster_cnt++;
		982	}
1031	}	983	}
1032	}	984	}
1033		985
1034	avgexp = (double) total_exp / monster_cnt;	986	avgexp = (double) total_exp / monster_cnt;
1035		987
…		…
1048	* postive values make it darker, negative make it brighter	1000	* postive values make it darker, negative make it brighter
1049	*/	1001	*/
1050	int	1002	int
1051	maptile::change_map_light (int change)	1003	maptile::change_map_light (int change)
1052	{	1004	{
1053	int new_level = darkness + change;
1054
1055	/* Nothing to do */	1005	/* Nothing to do */
1056	if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	1006	if (!change)
1057	return 0;	1007	return 0;
1058		1008
1059	/* inform all players on the map */	1009	/* inform all players on the map */
1060	if (change > 0)	1010	if (change > 0)
1061	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");	1011	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1062	else	1012	else
1063	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");	1013	new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1064		1014
1065	/* Do extra checking. since darkness is a unsigned value,	1015	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1066	* we need to be extra careful about negative values.
1067	* In general, the checks below are only needed if change
1068	* is not +/-1
1069	*/
1070	if (new_level < 0)
1071	darkness = 0;
1072	else if (new_level >= MAX_DARKNESS)
1073	darkness = MAX_DARKNESS;
1074	else
1075	darkness = new_level;
1076		1016
1077	/* All clients need to get re-updated for the change */	1017	/* All clients need to get re-updated for the change */
1078	update_all_map_los (this);	1018	update_all_map_los (this);
		1019
1079	return 1;	1020	return 1;
1080	}	1021	}
1081		1022
1082	/*	1023	/*
1083	* This function updates various attributes about a specific space	1024	* This function updates various attributes about a specific space
…		…
1086	* through, etc)	1027	* through, etc)
1087	*/	1028	*/
1088	void	1029	void
1089	mapspace::update_ ()	1030	mapspace::update_ ()
1090	{	1031	{
1091	object *tmp, *last = 0;	1032	object *last = 0;
1092	uint8 flags = 0, light = 0, anywhere = 0;	1033	uint8 flags = P_UPTODATE;
1093	New_Face *top, *floor, *middle;	1034	sint8 light = 0;
1094	object *top_obj, *floor_obj, *middle_obj;
1095	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1035	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
		1036	uint64_t volume = 0;
		1037	uint32_t items = 0;
		1038	object *anywhere = 0;
1096		1039
1097	middle = blank_face;	1040	//object *middle = 0;
1098	top = blank_face;	1041	//object *top = 0;
1099	floor = blank_face;	1042	//object *floor = 0;
		1043	// this seems to generate better code than using locals, above
		1044	object *&top = faces_obj[0] = 0;
		1045	object *&middle = faces_obj[1] = 0;
		1046	object *&floor = faces_obj[2] = 0;
1100		1047
1101	middle_obj = 0;	1048	object::flags_t allflags; // all flags of all objects or'ed together
1102	top_obj = 0;
1103	floor_obj = 0;
1104		1049
1105	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1050	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1106	{	1051	{
1107	/* This could be made additive I guess (two lights better than	1052	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1108	* one). But if so, it shouldn't be a simple additive - 2
1109	* light bulbs do not illuminate twice as far as once since
1110	* it is a dissapation factor that is cubed.
1111	*/
1112	if (tmp->glow_radius > light)
1113	light = tmp->glow_radius;	1053	light += tmp->glow_radius;
1114		1054
1115	/* This call is needed in order to update objects the player	1055	/* This call is needed in order to update objects the player
1116	* is standing in that have animations (ie, grass, fire, etc).	1056	* is standing in that have animations (ie, grass, fire, etc).
1117	* However, it also causes the look window to be re-drawn	1057	* However, it also causes the look window to be re-drawn
1118	* 3 times each time the player moves, because many of the	1058	* 3 times each time the player moves, because many of the
1119	* functions the move_player calls eventualy call this.	1059	* functions the move_player calls eventualy call this.
1120	*	1060	*
1121	* Always put the player down for drawing.	1061	* Always put the player down for drawing.
1122	*/	1062	*/
1123	if (!tmp->invisible)	1063	if (expect_true (!tmp->invisible))
1124	{	1064	{
1125	if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))	1065	if (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER])
		1066	top = tmp;
		1067	else
1126	{	1068	{
1127	top = tmp->face;	1069	if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
		1070	{
		1071	/* If we got a floor, that means middle and top were below it,
		1072	* so should not be visible, so we clear them.
		1073	*/
		1074	middle = 0;
		1075	top = 0;
1128	top_obj = tmp;	1076	floor = tmp;
		1077	volume = 0;
		1078	items = 0;
		1079	}
		1080	else
		1081	{
		1082	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1083	{
		1084	++items;
		1085	volume += tmp->volume ();
		1086	}
		1087
		1088	/* Flag anywhere have high priority */
		1089	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
		1090	anywhere = tmp;
		1091	/* Find the highest visible face around. If equal
		1092	* visibilities, we still want the one nearer to the
		1093	* top
		1094	*/
		1095	else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility))
		1096	middle = tmp;
		1097	}
1129	}	1098	}
1130	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1131	{
1132	/* If we got a floor, that means middle and top were below it,
1133	* so should not be visible, so we clear them.
1134	*/
1135	middle = blank_face;
1136	top = blank_face;
1137	floor = tmp->face;
1138	floor_obj = tmp;
1139	}
1140	/* Flag anywhere have high priority */
1141	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1142	{
1143	middle = tmp->face;
1144
1145	middle_obj = tmp;
1146	anywhere = 1;
1147	}
1148	/* Find the highest visible face around. If equal
1149	* visibilities, we still want the one nearer to the
1150	* top
1151	*/
1152	else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere))
1153	{
1154	middle = tmp->face;
1155	middle_obj = tmp;
1156	}
1157	}
1158
1159	if (tmp == tmp->above)
1160	{
1161	LOG (llevError, "Error in structure of map\n");
1162	exit (-1);
1163	}	1099	}
1164		1100
1165	move_slow |= tmp->move_slow;	1101	move_slow |= tmp->move_slow;
1166	move_block |= tmp->move_block;	1102	move_block |= tmp->move_block;
1167	move_on |= tmp->move_on;	1103	move_on |= tmp->move_on;
1168	move_off |= tmp->move_off;	1104	move_off |= tmp->move_off;
1169	move_allow |= tmp->move_allow;	1105	move_allow |= tmp->move_allow;
1170		1106
1171	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW;	1107	allflags |= tmp->flag;
1172	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC;	1108
1173	if (tmp->type == PLAYER) flags |= P_PLAYER;	1109	if (tmp->type == PLAYER) flags |= P_PLAYER;
1174	if (tmp->type == SAFE_GROUND) flags |= P_SAFE;	1110	if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1175	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1176	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1177	}	1111	}
1178		1112
1179	this->light = light;	1113	// FLAG_SEE_ANYWHERE takes precedence
		1114	if (anywhere)
		1115	middle = anywhere;
		1116
		1117	// ORing all flags together and checking them here is much faster
		1118	if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
		1119	if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC;
		1120	if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE;
		1121	if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC;
		1122
		1123	this->light = min (light, MAX_LIGHT_RADIUS);
1180	this->flags_ = flags;	1124	this->flags_ = flags;
1181	this->move_block = move_block & ~move_allow;	1125	this->move_block = move_block & ~move_allow;
1182	this->move_on = move_on;	1126	this->move_on = move_on;
1183	this->move_off = move_off;	1127	this->move_off = move_off;
1184	this->move_slow = move_slow;	1128	this->move_slow = move_slow;
		1129	this->volume_ = (volume + 1023) / 1024;
		1130	this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1185		1131
1186	/* At this point, we have a floor face (if there is a floor),	1132	/* At this point, we have a floor face (if there is a floor),
1187	* and the floor is set - we are not going to touch it at	1133	* and the floor is set - we are not going to touch it at
1188	* this point.	1134	* this point.
1189	* middle contains the highest visibility face.	1135	* middle contains the highest visibility face.
…		…
1196	* middle face. This should not happen, as we already have the	1142	* middle face. This should not happen, as we already have the
1197	* else statement above so middle should not get set. OTOH, it	1143	* else statement above so middle should not get set. OTOH, it
1198	* may be possible for the faces to match but be different objects.	1144	* may be possible for the faces to match but be different objects.
1199	*/	1145	*/
1200	if (top == middle)	1146	if (top == middle)
1201	middle = blank_face;	1147	middle = 0;
1202		1148
1203	/* There are three posibilities at this point:	1149	/* There are three posibilities at this point:
1204	* 1) top face is set, need middle to be set.	1150	* 1) top face is set, need middle to be set.
1205	* 2) middle is set, need to set top.	1151	* 2) middle is set, need to set top.
1206	* 3) neither middle or top is set - need to set both.	1152	* 3) neither middle or top is set - need to set both.
1207	*/	1153	*/
1208		1154
1209	for (tmp = last; tmp; tmp = tmp->below)	1155	for (object *tmp = last; tmp; tmp = tmp->below)
1210	{	1156	{
1211	/* Once we get to a floor, stop, since we already have a floor object */	1157	/* Once we get to a floor, stop, since we already have a floor object */
1212	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1158	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1213	break;	1159	break;
1214		1160
1215	/* If two top faces are already set, quit processing */	1161	/* If two top faces are already set, quit processing */
1216	if ((top != blank_face) && (middle != blank_face))	1162	if (top && middle)
1217	break;	1163	break;
1218		1164
1219	/* Only show visible faces, unless its the editor - show all */	1165	/* Only show visible faces */
1220	if (!tmp->invisible || editor)	1166	if (!tmp->invisible)
1221	{	1167	{
1222	/* Fill in top if needed */	1168	/* Fill in top if needed */
1223	if (top == blank_face)	1169	if (!top)
1224	{	1170	{
1225	top = tmp->face;
1226	top_obj = tmp;	1171	top = tmp;
1227	if (top == middle)	1172	if (top == middle)
1228	middle = blank_face;	1173	middle = 0;
1229	}	1174	}
1230	else	1175	else
1231	{	1176	{
1232	/* top is already set - we should only get here if	1177	/* top is already set - we should only get here if
1233	* middle is not set	1178	* middle is not set
1234	*	1179	*
1235	* Set the middle face and break out, since there is nothing	1180	* Set the middle face and break out, since there is nothing
1236	* more to fill in. We don't check visiblity here, since	1181	* more to fill in. We don't check visiblity here, since
1237	*	1182	*
1238	*/	1183	*/
1239	if (tmp->face != top)	1184	if (tmp != top)
1240	{	1185	{
1241	middle = tmp->face;
1242	middle_obj = tmp;	1186	middle = tmp;
1243	break;	1187	break;
1244	}	1188	}
1245	}	1189	}
1246	}	1190	}
1247	}	1191	}
1248		1192
1249	if (middle == floor)	1193	if (middle == floor)
1250	middle = blank_face;	1194	middle = 0;
1251		1195
1252	if (top == middle)	1196	if (top == middle)
1253	middle = blank_face;	1197	middle = 0;
1254		1198
1255	faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;	1199	#if 0
1256	faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;	1200	faces_obj [0] = top;
1257	faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;	1201	faces_obj [1] = middle;
		1202	faces_obj [2] = floor;
		1203	#endif
1258	}	1204	}
1259		1205
1260	/* this updates the orig_map->tile_map[tile_num] value after loading	1206	maptile *
1261	* the map. It also takes care of linking back the freshly loaded	1207	maptile::tile_available (int dir, bool load)
1262	* maps tile_map values if it tiles back to this one. It returns
1263	* the value of orig_map->tile_map[tile_num]. It really only does this
1264	* so that it is easier for calling functions to verify success.
1265	*/
1266	static maptile *
1267	load_and_link_tiled_map (maptile *orig_map, int tile_num)
1268	{	1208	{
1269	maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map);	1209	if (tile_path[dir])
1270
1271	if (!mp || mp->in_memory != MAP_IN_MEMORY)
1272	{
1273	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1274	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1275	&orig_map->tile_path[tile_num], &orig_map->path);
1276	mp = new maptile (1, 1);
1277	mp->alloc ();
1278	mp->in_memory = MAP_IN_MEMORY;
1279	}	1210	{
		1211	if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
		1212	return tile_map[dir];
1280		1213
1281	int dest_tile = (tile_num + 2) % 4;	1214	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1215	return tile_map[dir];
		1216	}
1282		1217
1283	orig_map->tile_map[tile_num] = mp;
1284
1285	// optimisation: back-link map to origin map if euclidean
1286	//TODO: non-euclidean maps MUST GO
1287	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1288	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1289
1290	return mp;	1218	return 0;
1291	}	1219	}
1292		1220
1293	/* this returns TRUE if the coordinates (x,y) are out of	1221	/* this returns TRUE if the coordinates (x,y) are out of
1294	* map m. This function also takes into account any	1222	* map m. This function also takes into account any
1295	* tiling considerations, loading adjacant maps as needed.	1223	* tiling considerations, loading adjacant maps as needed.
…		…
1308	if (!m)	1236	if (!m)
1309	return 0;	1237	return 0;
1310		1238
1311	if (x < 0)	1239	if (x < 0)
1312	{	1240	{
1313	if (!m->tile_path[3])	1241	if (!m->tile_available (3))
1314	return 1;	1242	return 1;
1315		1243
1316	if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1317	load_and_link_tiled_map (m, 3);
1318
1319	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1244	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1320	}	1245	}
1321		1246
1322	if (x >= m->width)	1247	if (x >= m->width)
1323	{	1248	{
1324	if (!m->tile_path[1])	1249	if (!m->tile_available (1))
1325	return 1;	1250	return 1;
1326		1251
1327	if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1328	load_and_link_tiled_map (m, 1);
1329
1330	return out_of_map (m->tile_map[1], x - m->width, y);	1252	return out_of_map (m->tile_map[1], x - m->width, y);
1331	}	1253	}
1332		1254
1333	if (y < 0)	1255	if (y < 0)
1334	{	1256	{
1335	if (!m->tile_path[0])	1257	if (!m->tile_available (0))
1336	return 1;	1258	return 1;
1337		1259
1338	if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1339	load_and_link_tiled_map (m, 0);
1340
1341	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1260	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1342	}	1261	}
1343		1262
1344	if (y >= m->height)	1263	if (y >= m->height)
1345	{	1264	{
1346	if (!m->tile_path[2])	1265	if (!m->tile_available (2))
1347	return 1;	1266	return 1;
1348
1349	if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1350	load_and_link_tiled_map (m, 2);
1351		1267
1352	return out_of_map (m->tile_map[2], x, y - m->height);	1268	return out_of_map (m->tile_map[2], x, y - m->height);
1353	}	1269	}
1354		1270
1355	/* Simple case - coordinates are within this local	1271	/* Simple case - coordinates are within this local
…		…
1360		1276
1361	/* This is basically the same as out_of_map above, but	1277	/* This is basically the same as out_of_map above, but
1362	* instead we return NULL if no map is valid (coordinates	1278	* instead we return NULL if no map is valid (coordinates
1363	* out of bounds and no tiled map), otherwise it returns	1279	* out of bounds and no tiled map), otherwise it returns
1364	* the map as that the coordinates are really on, and	1280	* the map as that the coordinates are really on, and
1365	* updates x and y to be the localized coordinates.	1281	* updates x and y to be the localised coordinates.
1366	* Using this is more efficient of calling out_of_map	1282	* Using this is more efficient of calling out_of_map
1367	* and then figuring out what the real map is	1283	* and then figuring out what the real map is
1368	*/	1284	*/
1369	maptile *	1285	maptile *
1370	get_map_from_coord (maptile *m, sint16 *x, sint16 *y)	1286	maptile::xy_find (sint16 &x, sint16 &y)
1371	{	1287	{
1372	if (*x < 0)	1288	if (x < 0)
1373	{	1289	{
1374	if (!m->tile_path[3])	1290	if (!tile_available (3))
1375	return 0;	1291	return 0;
1376		1292
1377	if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1378	load_and_link_tiled_map (m, 3);
1379
1380	*x += m->tile_map[3]->width;	1293	x += tile_map[3]->width;
1381	return (get_map_from_coord (m->tile_map[3], x, y));	1294	return tile_map[3]->xy_find (x, y);
1382	}	1295	}
1383		1296
1384	if (*x >= m->width)	1297	if (x >= width)
1385	{	1298	{
1386	if (!m->tile_path[1])	1299	if (!tile_available (1))
1387	return 0;	1300	return 0;
1388		1301
1389	if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1390	load_and_link_tiled_map (m, 1);
1391
1392	*x -= m->width;	1302	x -= width;
1393	return (get_map_from_coord (m->tile_map[1], x, y));	1303	return tile_map[1]->xy_find (x, y);
1394	}	1304	}
1395		1305
1396	if (*y < 0)	1306	if (y < 0)
1397	{	1307	{
1398	if (!m->tile_path[0])	1308	if (!tile_available (0))
1399	return 0;	1309	return 0;
1400		1310
1401	if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1402	load_and_link_tiled_map (m, 0);
1403
1404	*y += m->tile_map[0]->height;	1311	y += tile_map[0]->height;
1405	return (get_map_from_coord (m->tile_map[0], x, y));	1312	return tile_map[0]->xy_find (x, y);
1406	}	1313	}
1407		1314
1408	if (*y >= m->height)	1315	if (y >= height)
1409	{	1316	{
1410	if (!m->tile_path[2])	1317	if (!tile_available (2))
1411	return 0;	1318	return 0;
1412		1319
1413	if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1414	load_and_link_tiled_map (m, 2);
1415
1416	*y -= m->height;	1320	y -= height;
1417	return (get_map_from_coord (m->tile_map[2], x, y));	1321	return tile_map[2]->xy_find (x, y);
1418	}	1322	}
1419		1323
1420	/* Simple case - coordinates are within this local	1324	/* Simple case - coordinates are within this local
1421	* map.	1325	* map.
1422	*/	1326	*/
1423	return m;	1327	return this;
1424	}	1328	}
1425		1329
1426	/**	1330	/**
1427	* Return whether map2 is adjacent to map1. If so, store the distance from	1331	* Return whether map2 is adjacent to map1. If so, store the distance from
1428	* map1 to map2 in dx/dy.	1332	* map1 to map2 in dx/dy.
1429	*/	1333	*/
1430	static int	1334	int
1431	adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)	1335	adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1432	{	1336	{
1433	if (!map1 || !map2)	1337	if (!map1 || !map2)
1434	return 0;	1338	return 0;
1435		1339
		1340	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
		1341	//fix: compare paths instead (this is likely faster, too!)
1436	if (map1 == map2)	1342	if (map1 == map2)
1437	{	1343	{
1438	*dx = 0;	1344	*dx = 0;
1439	*dy = 0;	1345	*dy = 0;
1440	}	1346	}
…		…
1500	}	1406	}
1501	else	1407	else
1502	return 0;	1408	return 0;
1503		1409
1504	return 1;	1410	return 1;
		1411	}
		1412
		1413	maptile *
		1414	maptile::xy_load (sint16 &x, sint16 &y)
		1415	{
		1416	maptile *map = xy_find (x, y);
		1417
		1418	if (map)
		1419	map->load_sync ();
		1420
		1421	return map;
		1422	}
		1423
		1424	maptile *
		1425	get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
		1426	{
		1427	return m->xy_load (*x, *y);
1505	}	1428	}
1506		1429
1507	/* From map.c	1430	/* From map.c
1508	* This is used by get_player to determine where the other	1431	* This is used by get_player to determine where the other
1509	* creature is. get_rangevector takes into account map tiling,	1432	* creature is. get_rangevector takes into account map tiling,
1510	* so you just can not look the the map coordinates and get the	1433	* so you just can not look the the map coordinates and get the
1511	* righte value. distance_x/y are distance away, which	1434	* righte value. distance_x/y are distance away, which
1512	* can be negativbe. direction is the crossfire direction scheme	1435	* can be negative. direction is the crossfire direction scheme
1513	* that the creature should head. part is the part of the	1436	* that the creature should head. part is the part of the
1514	* monster that is closest.	1437	* monster that is closest.
1515	*	1438	*
1516	* get_rangevector looks at op1 and op2, and fills in the	1439	* get_rangevector looks at op1 and op2, and fills in the
1517	* structure for op1 to get to op2.	1440	* structure for op1 to get to op2.
…		…
1528	get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)	1451	get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1529	{	1452	{
1530	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1453	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1531	{	1454	{
1532	/* be conservative and fill in _some_ data */	1455	/* be conservative and fill in _some_ data */
1533	retval->distance = 100000;	1456	retval->distance = 10000;
1534	retval->distance_x = 32767;	1457	retval->distance_x = 10000;
1535	retval->distance_y = 32767;	1458	retval->distance_y = 10000;
1536	retval->direction = 0;	1459	retval->direction = 0;
1537	retval->part = 0;	1460	retval->part = 0;
1538	}	1461	}
1539	else	1462	else
1540	{	1463	{
…		…
1545		1468
1546	best = op1;	1469	best = op1;
1547	/* If this is multipart, find the closest part now */	1470	/* If this is multipart, find the closest part now */
1548	if (!(flags & 0x1) && op1->more)	1471	if (!(flags & 0x1) && op1->more)
1549	{	1472	{
1550	object *tmp;
1551	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;	1473	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1552		1474
1553	/* we just take the offset of the piece to head to figure	1475	/* we just take the offset of the piece to head to figure
1554	* distance instead of doing all that work above again	1476	* distance instead of doing all that work above again
1555	* since the distance fields we set above are positive in the	1477	* since the distance fields we set above are positive in the
1556	* same axis as is used for multipart objects, the simply arithmetic	1478	* same axis as is used for multipart objects, the simply arithmetic
1557	* below works.	1479	* below works.
1558	*/	1480	*/
1559	for (tmp = op1->more; tmp != NULL; tmp = tmp->more)	1481	for (object *tmp = op1->more; tmp; tmp = tmp->more)
1560	{	1482	{
1561	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +	1483	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1562	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1484	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1563	if (tmpi < best_distance)	1485	if (tmpi < best_distance)
1564	{	1486	{
1565	best_distance = tmpi;	1487	best_distance = tmpi;
1566	best = tmp;	1488	best = tmp;
1567	}	1489	}
1568	}	1490	}
		1491
1569	if (best != op1)	1492	if (best != op1)
1570	{	1493	{
1571	retval->distance_x += op1->x - best->x;	1494	retval->distance_x += op1->x - best->x;
1572	retval->distance_y += op1->y - best->y;	1495	retval->distance_y += op1->y - best->y;
1573	}	1496	}
1574	}	1497	}
		1498
1575	retval->part = best;	1499	retval->part = best;
1576	retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);	1500	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1577	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1501	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1578	}	1502	}
1579	}	1503	}
1580		1504
1581	/* this is basically the same as get_rangevector above, but instead of	1505	/* this is basically the same as get_rangevector above, but instead of
…		…
1586	* flags has no meaning for this function at this time - I kept it in to	1510	* flags has no meaning for this function at this time - I kept it in to
1587	* be more consistant with the above function and also in case they are needed	1511	* be more consistant with the above function and also in case they are needed
1588	* for something in the future. Also, since no object is pasted, the best	1512	* for something in the future. Also, since no object is pasted, the best
1589	* field of the rv_vector is set to NULL.	1513	* field of the rv_vector is set to NULL.
1590	*/	1514	*/
1591
1592	void	1515	void
1593	get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags)	1516	get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1594	{	1517	{
1595	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))	1518	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1596	{	1519	{
1597	/* be conservative and fill in _some_ data */	1520	/* be conservative and fill in _some_ data */
1598	retval->distance = 100000;	1521	retval->distance = 100000;
…		…
1604	else	1527	else
1605	{	1528	{
1606	retval->distance_x += op2->x - x;	1529	retval->distance_x += op2->x - x;
1607	retval->distance_y += op2->y - y;	1530	retval->distance_y += op2->y - y;
1608		1531
1609	retval->part = NULL;	1532	retval->part = 0;
1610	retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);	1533	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1611	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1534	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1612	}	1535	}
1613	}	1536	}
1614		1537
1615	/* Returns true of op1 and op2 are effectively on the same map	1538	/* Returns true of op1 and op2 are effectively on the same map
…		…
1626	int dx, dy;	1549	int dx, dy;
1627		1550
1628	return adjacent_map (op1->map, op2->map, &dx, &dy);	1551	return adjacent_map (op1->map, op2->map, &dx, &dy);
1629	}	1552	}
1630		1553
		1554	//-GPL
		1555
1631	object *	1556	object *
1632	maptile::insert (object *op, int x, int y, object *originator, int flags)	1557	maptile::insert (object *op, int x, int y, object *originator, int flags)
1633	{	1558	{
1634	if (!op->flag [FLAG_REMOVED])
1635	op->remove ();
1636
1637	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1559	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1638	}	1560	}
1639		1561
		1562	region *
		1563	maptile::region (int x, int y) const
		1564	{
		1565	if (regions
		1566	&& regionmap
		1567	&& !OUT_OF_REAL_MAP (this, x, y))
		1568	if (struct region *reg = regionmap [regions [y * width + x]])
		1569	return reg;
		1570
		1571	if (default_region)
		1572	return default_region;
		1573
		1574	return ::region::default_region ();
		1575	}
		1576
		1577	//+GPL
		1578
		1579	/* picks a random object from a style map.
		1580	*/
		1581	object *
		1582	maptile::pick_random_object (rand_gen &gen) const
		1583	{
		1584	/* while returning a null object will result in a crash, that
		1585	* is actually preferable to an infinite loop. That is because
		1586	* most servers will automatically restart in case of crash.
		1587	* Change the logic on getting the random space - shouldn't make
		1588	* any difference, but this seems clearer to me.
		1589	*/
		1590	for (int i = 1000; --i;)
		1591	{
		1592	object *pick = at (gen (width), gen (height)).bot;
		1593
		1594	// do not prefer big monsters just because they are big.
		1595	if (pick && pick->is_head ())
		1596	return pick->head_ ();
		1597	}
		1598
		1599	// instead of crashing in the unlikely(?) case, try to return *something*
		1600	return archetype::find (shstr_bug);
		1601	}
		1602
		1603	//-GPL
		1604
		1605	void
		1606	maptile::play_sound (faceidx sound, int x, int y) const
		1607	{
		1608	if (!sound)
		1609	return;
		1610
		1611	for_all_players_on_map (pl, this)
		1612	if (client *ns = pl->ns)
		1613	{
		1614	int dx = x - pl->ob->x;
		1615	int dy = y - pl->ob->y;
		1616
		1617	int distance = idistance (dx, dy);
		1618
		1619	if (distance <= MAX_SOUND_DISTANCE)
		1620	ns->play_sound (sound, dx, dy);
		1621	}
		1622	}
		1623
		1624	void
		1625	maptile::say_msg (const char *msg, int x, int y) const
		1626	{
		1627	for_all_players (pl)
		1628	if (client *ns = pl->ns)
		1629	{
		1630	int dx = x - pl->ob->x;
		1631	int dy = y - pl->ob->y;
		1632
		1633	int distance = idistance (dx, dy);
		1634
		1635	if (distance <= MAX_SOUND_DISTANCE)
		1636	ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
		1637	}
		1638	}
		1639
		1640	static void
		1641	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1642	{
		1643	// clip to map to the left
		1644	if (x0 < 0)
		1645	{
		1646	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1647	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1648
		1649	if (x1 < 0) // entirely to the left
		1650	return;
		1651
		1652	x0 = 0;
		1653	}
		1654
		1655	// clip to map to the right
		1656	if (x1 > m->width)
		1657	{
		1658	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1659	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1660
		1661	if (x0 > m->width) // entirely to the right
		1662	return;
		1663
		1664	x1 = m->width;
		1665	}
		1666
		1667	// clip to map above
		1668	if (y0 < 0)
		1669	{
		1670	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1671	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1672
		1673	if (y1 < 0) // entirely above
		1674	return;
		1675
		1676	y0 = 0;
		1677	}
		1678
		1679	// clip to map below
		1680	if (y1 > m->height)
		1681	{
		1682	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1683	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1684
		1685	if (y0 > m->height) // entirely below
		1686	return;
		1687
		1688	y1 = m->height;
		1689	}
		1690
		1691	// if we get here, the rect is within the current map
		1692	maprect *r = (maprect *)buf.alloc (sizeof (maprect));
		1693
		1694	r->m = m;
		1695	r->x0 = x0;
		1696	r->y0 = y0;
		1697	r->x1 = x1;
		1698	r->y1 = y1;
		1699	r->dx = dx;
		1700	r->dy = dy;
		1701	}
		1702
		1703	maprect *
		1704	maptile::split_to_tiles (int x0, int y0, int x1, int y1)
		1705	{
		1706	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
		1707	buf.clear ();
		1708
		1709	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1710
		1711	// add end marker
		1712	maprect *r = (maprect *)buf.alloc (sizeof (maprect));
		1713	r->m = 0;
		1714
		1715	return (maprect *)buf.linearise ();
		1716	}
		1717

Diff Legend

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