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

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

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.113 by root, Fri Jul 13 15:54:40 2007 UTC vs. Revision 1.215 by root, Sun May 8 12:40:41 2011 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.113 by root, Fri Jul 13 15:54:40 2007 UTC vs.
Revision 1.215 by root, Sun May 8 12:40:41 2011 UTC