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.110 by root, Sun Jul 1 05:00:17 2007 UTC vs.
Revision 1.222 by root, Sat Dec 1 20:22:12 2018 UTC

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

Diff Legend

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