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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.105 by root, Mon May 28 05:35:51 2007 UTC vs.
Revision 1.186 by root, Tue Apr 13 02:39:52 2010 UTC

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

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.105 by root, Mon May 28 05:35:51 2007 UTC vs. Revision 1.186 by root, Tue Apr 13 02:39:52 2010 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.105 by root, Mon May 28 05:35:51 2007 UTC vs.
Revision 1.186 by root, Tue Apr 13 02:39:52 2010 UTC