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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.88 by root, Fri Feb 16 19:43:40 2007 UTC vs.
Revision 1.174 by root, Tue Nov 10 05:05:22 2009 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 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"	28	#include "loader.h"
31
32	#include "path.h"	29	#include "path.h"
33		30
34	/*	31	//+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		32
48	/*	33	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		34
100	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	35	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
101	* one function that just returns a P_.. value (see map.h)	36	* one function that just returns a P_.. value (see map.h)
102	* it will also do map translation for tiled maps, returning	37	* it will also do map translation for tiled maps, returning
103	* new values into newmap, nx, and ny. Any and all of those	38	* new values into newmap, nx, and ny. Any and all of those
138	* by the caller.	73	* by the caller.
139	*/	74	*/
140	int	75	int
141	blocked_link (object ob, maptile m, int sx, int sy)	76	blocked_link (object ob, maptile m, int sx, int sy)
142	{	77	{
143	object *tmp;
144	int mflags, blocked;
145
146	/* Make sure the coordinates are valid - they should be, as caller should	78	/* Make sure the coordinates are valid - they should be, as caller should
147	* have already checked this.	79	* have already checked this.
148	*/	80	*/
149	if (OUT_OF_REAL_MAP (m, sx, sy))	81	if (OUT_OF_REAL_MAP (m, sx, sy))
150	{	82	{
151	LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");	83	LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");
152	return 1;	84	return 1;
153	}	85	}
154		86
155	/* Save some cycles - instead of calling get_map_flags(), just get the value	87	mapspace &ms = m->at (sx, sy);
156	* directly.
157	*/
158	mflags = m->at (sx, sy).flags ();
159		88
160	blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);	89	int mflags = ms.flags ();
		90	int blocked = ms.move_block;
161		91
162	/* If space is currently not blocked by anything, no need to	92	/* If space is currently not blocked by anything, no need to
163	* go further. Not true for players - all sorts of special	93	* go further. Not true for players - all sorts of special
164	* things we need to do for players.	94	* things we need to do for players.
165	*/	95	*/
166	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))	96	if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
167	return 0;	97	return 0;
168		98
169	/* if there isn't anytyhing alive on this space, and this space isn't	99	/* if there isn't anything alive on this space, and this space isn't
170	* otherwise blocked, we can return now. Only if there is a living	100	* otherwise blocked, we can return now. Only if there is a living
171	* creature do we need to investigate if it is part of this creature	101	* creature do we need to investigate if it is part of this creature
172	* or another. Likewise, only if something is blocking us do we	102	* or another. Likewise, only if something is blocking us do we
173	* need to investigate if there is a special circumstance that would	103	* need to investigate if there is a special circumstance that would
174	* let the player through (inventory checkers for example)	104	* let the player through (inventory checkers for example)
175	*/	105	*/
176	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))	106	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
177	return 0;	107	return 0;
178		108
179	if (ob->head != NULL)
180	ob = ob->head;	109	ob = ob->head_ ();
181		110
182	/* We basically go through the stack of objects, and if there is	111	/* We basically go through the stack of objects, and if there is
183	* some other object that has NO_PASS or FLAG_ALIVE set, return	112	* some other object that has NO_PASS or FLAG_ALIVE set, return
184	* true. If we get through the entire stack, that must mean	113	* true. If we get through the entire stack, that must mean
185	* ob is blocking it, so return 0.	114	* ob is blocking it, so return 0.
186	*/	115	*/
187	for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)	116	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
188	{	117	{
189		118	if (OB_MOVE_BLOCK (ob, tmp))
190	/* This must be before the checks below. Code for inventory checkers. */
191	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
192	{	119	{
193	/* If last_sp is set, the player/monster needs an object,	120	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
194	* so we check for it. If they don't have it, they can't	121	if (RESULT_INT (0))
195	* pass through this space.	122	return 1;
196	*/	123	else
197	if (tmp->last_sp)	124	continue;
		125
		126	if (tmp->type == CHECK_INV)
198	{	127	{
199	if (check_inv_recursive (ob, tmp) == NULL)	128	bool have = check_inv_recursive (ob, tmp);
		129
		130	// last_sp set means we block if we don't have.
		131	if (logical_xor (have, tmp->last_sp))
200	return 1;	132	return 1;
201	else	133	}
202	continue;	134	else if (tmp->type == T_MATCH)
		135	{
		136	// T_MATCH allows "entrance" iff the match is true
		137	// == blocks if the match fails
		138
		139	// we could have used an INVOKE_OBJECT, but decided against it, as we
		140	// assume that T_MATCH is relatively common.
		141	if (!match (tmp->slaying, ob, tmp, ob))
		142	return 1;
203	}	143	}
204	else	144	else
205	{	145	return 1; // unconditional block
206	/* In this case, the player must not have the object -	146
207	* if they do, they can't pass through.
208	*/
209	if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
210	return 1;
211	else
212	continue;
213	}
214	} /* if check_inv */
215	else	147	} else {
216	{	148	// space does not block the ob, directly, but
217	/* Broke apart a big nasty if into several here to make	149	// anything alive that is not a door still
218	* this more readable. first check - if the space blocks	150	// blocks anything but wizards.
219	* movement, can't move here.	151
220	* second - if a monster, can't move there, unles it is a	152	if (tmp->flag [FLAG_ALIVE]
221	* hidden dm	153	&& tmp->head_ () != ob
222	*/	154	&& tmp != ob
223	if (OB_MOVE_BLOCK (ob, tmp))	155	&& tmp->type != DOOR
224	return 1;	156	&& !tmp->flag [FLAG_WIZPASS])
225	if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob &&
226	tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden))
227	return 1;	157	return 1;
228	}	158	}
229
230	}	159	}
		160
231	return 0;	161	return 0;
232	}	162	}
233		163
234	/*	164	/*
235	* Returns true if the given object can't fit in the given spot.	165	* Returns qthe blocking object if the given object can't fit in the given
236	* This is meant for multi space objects - for single space objecs,	166	* spot. This is meant for multi space objects - for single space objecs,
237	* just calling get_map_blocked and checking that against movement type	167	* just calling get_map_blocked and checking that against movement type
238	* of object. This function goes through all the parts of the	168	* of object. This function goes through all the parts of the multipart
239	* multipart object and makes sure they can be inserted.	169	* object and makes sure they can be inserted.
240	*	170	*
241	* While this doesn't call out of map, the get_map_flags does.	171	* While this doesn't call out of map, the get_map_flags does.
242	*	172	*
243	* This function has been used to deprecate arch_out_of_map -	173	* This function has been used to deprecate arch_out_of_map -
244	* this function also does that check, and since in most cases,	174	* this function also does that check, and since in most cases,
…		…
255	*	185	*
256	* Note this used to be arch_blocked, but with new movement	186	* Note this used to be arch_blocked, but with new movement
257	* code, we need to have actual object to check its move_type	187	* code, we need to have actual object to check its move_type
258	* against the move_block values.	188	* against the move_block values.
259	*/	189	*/
260	int	190	bool
261	ob_blocked (const object ob, maptile m, sint16 x, sint16 y)	191	object::blocked (maptile *m, int x, int y) const
262	{	192	{
263	archetype *tmp;	193	for (archetype tmp = arch; tmp; tmp = (archetype )tmp->more)
264	int flag;
265	maptile *m1;
266	sint16 sx, sy;
267
268	if (!ob)
269	{
270	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
271	if (flag & P_OUT_OF_MAP)
272	return P_OUT_OF_MAP;
273
274	/* don't have object, so don't know what types would block */
275	return m1->at (sx, sy).move_block;
276	}	194	{
		195	mapxy pos (m, x + tmp->x, y + tmp->y);
277		196
278	for (tmp = ob->arch; tmp; tmp = tmp->more)	197	if (!pos.normalise ())
279	{	198	return 1;
280	flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
281		199
282	if (flag & P_OUT_OF_MAP)	200	mapspace &ms = *pos;
283	return P_OUT_OF_MAP;	201
284	if (flag & P_IS_ALIVE)	202	if (ms.flags () & P_IS_ALIVE)
285	return P_IS_ALIVE;	203	return 1;
286		204
287	mapspace &ms = m1->at (sx, sy);	205	/* However, often ob doesn't have any move type
288		206	* (signifying non-moving objects)
289	/* find_first_free_spot() calls this function. However, often
290	* ob doesn't have any move type (when used to place exits)
291	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	207	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
292	*/	208	*/
293
294	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	209	if (!move_type && ms.move_block != MOVE_ALL)
295	continue;	210	continue;
296		211
297	/* Note it is intentional that we check ob - the movement type of the	212	/* Note it is intentional that we check ob - the movement type of the
298	* head of the object should correspond for the entire object.	213	* head of the object should correspond for the entire object.
299	*/	214	*/
300	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	215	if (ms.blocks (move_type))
301	return P_NO_PASS;	216	return 1;
302	}	217	}
303		218
304	return 0;	219	return 0;
305	}	220	}
306		221
307	/* When the map is loaded, load_object does not actually insert objects	222	/* When the map is loaded, load_object does not actually insert objects
308	* into inventory, but just links them. What this does is go through	223	* into inventory, but just links them. What this does is go through
309	* and insert them properly.	224	* and insert them properly.
310	* The object 'container' is the object that contains the inventory.	225	* The object 'container' is the object that contains the inventory.
311	* This is needed so that we can update the containers weight.	226	* This is needed so that we can update the containers weight.
312	*/	227	*/
313	void	228	static void
314	fix_container (object *container)	229	fix_container (object *container)
315	{	230	{
316	object tmp = container->inv, next;	231	object tmp = container->inv, next;
317		232
318	container->inv = 0;	233	container->inv = 0;
…		…
324		239
325	insert_ob_in_ob (tmp, container);	240	insert_ob_in_ob (tmp, container);
326	tmp = next;	241	tmp = next;
327	}	242	}
328		243
329	/* sum_weight will go through and calculate what all the containers are	244	// go through and calculate what all the containers are carrying.
330	* carrying.	245	//TODO: remove
331	*/	246	container->update_weight ();
332	sum_weight (container);
333	}	247	}
		248
		249	//-GPL
334		250
335	void	251	void
336	maptile::set_object_flag (int flag, int value)	252	maptile::set_object_flag (int flag, int value)
337	{	253	{
338	if (!spaces)	254	if (!spaces)
…		…
341	for (mapspace *ms = spaces + size (); ms-- > spaces; )	257	for (mapspace *ms = spaces + size (); ms-- > spaces; )
342	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	258	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
343	tmp->flag [flag] = value;	259	tmp->flag [flag] = value;
344	}	260	}
345		261
		262	void
		263	maptile::post_load_original ()
		264	{
		265	if (!spaces)
		266	return;
		267
		268	set_object_flag (FLAG_OBJ_ORIGINAL);
		269
		270	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		271	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		272	INVOKE_OBJECT (RESET, tmp);
		273	}
		274
		275	//+GPL
		276
346	/* link_multipart_objects go through all the objects on the map looking	277	/* link_multipart_objects go through all the objects on the map looking
347	* for objects whose arch says they are multipart yet according to the	278	* for objects whose arch says they are multipart yet according to the
348	* info we have, they only have the head (as would be expected when	279	* info we have, they only have the head (as would be expected when
349	* they are saved). We do have to look for the old maps that did save	280	* they are saved).
350	* the more sections and not re-add sections for them.
351	*/	281	*/
352	void	282	void
353	maptile::link_multipart_objects ()	283	maptile::link_multipart_objects ()
354	{	284	{
355	if (!spaces)	285	if (!spaces)
356	return;	286	return;
357		287
358	for (mapspace *ms = spaces + size (); ms-- > spaces; )	288	for (mapspace *ms = spaces + size (); ms-- > spaces; )
359	for (object *tmp = ms->bot; tmp; )	289	{
		290	object *op = ms->bot;
		291	while (op)
360	{	292	{
361	object *above = tmp->above;
362
363	/* already multipart - don't do anything more */	293	/* already multipart - don't do anything more */
364	if (!tmp->head && !tmp->more)	294	if (op->head_ () == op && !op->more && op->arch->more)
365	{
366	/* If there is nothing more to this object, this for loop
367	* won't do anything.
368	*/
369	archetype *at;
370	object last, op;
371	for (at = tmp->arch->more, last = tmp;
372	at;
373	at = at->more, last = op)
374	{	295	{
375	op = arch_to_object (at);	296	op->remove ();
		297	op->expand_tail ();
376		298
377	/* update x,y coordinates */	299	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
378	op->x += tmp->x;	300	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
379	op->y += tmp->y;	301	// below the pentagrams... hopefully INS_ON_TOP doesn't break anything
380	op->head = tmp;
381	op->map = this;
382	last->more = op;
383	op->name = tmp->name;
384	op->title = tmp->title;
385
386	/* we could link all the parts onto tmp, and then just
387	* call insert_ob_in_map once, but the effect is the same,
388	* as insert_ob_in_map will call itself with each part, and
389	* the coding is simpler to just to it here with each part.
390	*/
391	insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE \| INS_ABOVE_FLOOR_ONLY \| INS_NO_WALK_ON);	302	insert (op, op->x, op->y, 0, INS_NO_MERGE \| INS_ON_TOP \| INS_NO_WALK_ON);
		303
		304	op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
		305	// so we have to reset the iteration through the mapspace
392	}	306	}
		307	else
		308	op = op->above;
393	}	309	}
394
395	tmp = above;
396	}	310	}
397	}	311	}
		312
		313	//-GPL
398		314
399	/*	315	/*
400	* Loads (ands parses) the objects into a given map from the specified	316	* Loads (ands parses) the objects into a given map from the specified
401	* file pointer.	317	* file pointer.
402	*/	318	*/
403	bool	319	bool
404	maptile::_load_objects (object_thawer &f)	320	maptile::_load_objects (object_thawer &f)
405	{	321	{
406	for (;;)	322	for (;;)
407	{	323	{
408	coroapi::cede_every (1000); // cede once in a while	324	coroapi::cede_to_tick (); // cede once in a while
409		325
410	switch (f.kw)	326	switch (f.kw)
411	{	327	{
412	case KW_arch:	328	case KW_arch:
413	if (object *op = object::read (f))	329	if (object *op = object::read (f, this))
414	{	330	{
		331	// TODO: why?
415	if (op->inv)	332	if (op->inv)
416	sum_weight (op);	333	op->update_weight ();
417		334
418	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ON_TOP \| INS_MAP_LOAD);	335	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
		336	{
		337	// we insert manually because
		338	// a) its way faster
		339	// b) we remove manually, too, and there are good reasons for that
		340	// c) it's correct
		341	mapspace &ms = at (op->x, op->y);
		342
		343	op->flag [FLAG_REMOVED] = false;
		344
		345	op->above = 0;
		346	op->below = ms.top;
		347
		348	*(ms.top ? &ms.top->above : &ms.bot) = op;
		349
		350	ms.top = op;
		351	ms.flags_ = 0;
		352	}
		353	else
		354	{
		355	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		356	op->destroy ();
		357	}
419	}	358	}
420		359
421	continue;	360	continue;
422		361
423	case KW_EOF:	362	case KW_EOF:
…		…
436	}	375	}
437		376
438	void	377	void
439	maptile::activate ()	378	maptile::activate ()
440	{	379	{
441	if (!spaces)	380	if (spaces)
442	return;
443
444	for (mapspace *ms = spaces + size (); ms-- > spaces; )	381	for (mapspace *ms = spaces + size (); ms-- > spaces; )
445	for (object *op = ms->bot; op; op = op->above)	382	for (object *op = ms->bot; op; op = op->above)
446	op->activate_recursive ();	383	op->activate_recursive ();
447	}	384	}
448		385
449	void	386	void
450	maptile::deactivate ()	387	maptile::deactivate ()
451	{	388	{
452	if (!spaces)	389	if (spaces)
453	return;
454
455	for (mapspace *ms = spaces + size (); ms-- > spaces; )	390	for (mapspace *ms = spaces + size (); ms-- > spaces; )
456	for (object *op = ms->bot; op; op = op->above)	391	for (object *op = ms->bot; op; op = op->above)
457	op->deactivate_recursive ();	392	op->deactivate_recursive ();
458	}	393	}
459		394
460	bool	395	bool
461	maptile::_save_objects (object_freezer &f, int flags)	396	maptile::_save_objects (object_freezer &f, int flags)
462	{	397	{
463	static int cede_count = 0;	398	coroapi::cede_to_tick ();
464		399
465	if (flags & IO_HEADER)	400	if (flags & IO_HEADER)
466	_save_header (f);	401	_save_header (f);
467		402
468	if (!spaces)	403	if (!spaces)
469	return false;	404	return false;
470		405
471	for (int i = 0; i < size (); ++i)	406	for (int i = 0; i < size (); ++i)
472	{	407	{
473	#if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D
474	if (cede_count >= 500)
475	{
476	cede_count = 0;
477	coroapi::cede ();
478	}
479	#endif
480
481	int unique = 0;	408	bool unique = 0;
		409
482	for (object *op = spaces [i].bot; op; op = op->above)	410	for (object *op = spaces [i].bot; op; op = op->above)
483	{	411	{
484	// count per-object, but cede only when modification-safe
485	cede_count++;
486
487	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	412	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
488	unique = 1;
489		413
490	if (!op->can_map_save ())	414	if (expect_false (!op->can_map_save ()))
491	continue;	415	continue;
492		416
493	if (unique \|\| op->flag [FLAG_UNIQUE])	417	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
494	{	418	{
495	if (flags & IO_UNIQUES)	419	if (flags & IO_UNIQUES)
496	op->write (f);	420	op->write (f);
497	}	421	}
498	else if (flags & IO_OBJECTS)	422	else if (expect_true (flags & IO_OBJECTS))
499	op->write (f);	423	op->write (f);
500	}	424	}
501	}	425	}
502		426
		427	coroapi::cede_to_tick ();
		428
503	return true;	429	return true;
504	}
505
506	bool
507	maptile::_load_objects (const char *path, bool skip_header)
508	{
509	object_thawer f (path);
510
511	if (!f)
512	return false;
513
514	f.next ();
515
516	if (skip_header)
517	for (;;)
518	{
519	keyword kw = f.kw;
520	f.skip ();
521	if (kw == KW_end)
522	break;
523	}
524
525	return _load_objects (f);
526	}	430	}
527		431
528	bool	432	bool
529	maptile::_save_objects (const char *path, int flags)	433	maptile::_save_objects (const char *path, int flags)
530	{	434	{
…		…
544	* map archetype. Mimic that behaviour.	448	* map archetype. Mimic that behaviour.
545	*/	449	*/
546	width = 16;	450	width = 16;
547	height = 16;	451	height = 16;
548	timeout = 300;	452	timeout = 300;
549	max_nrof = 1000; // 1000 items of anything	453	max_items = MAX_ITEM_PER_ACTION;
550	max_volume = 2000000; // 2m³	454	max_volume = 2000000; // 2m³
551	}	455	}
552		456
553	maptile::maptile (int w, int h)	457	maptile::maptile (int w, int h)
554	{	458	{
…		…
575	if (spaces)	479	if (spaces)
576	return;	480	return;
577		481
578	spaces = salloc0<mapspace> (size ());	482	spaces = salloc0<mapspace> (size ());
579	}	483	}
		484
		485	//+GPL
580		486
581	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	487	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
582	* corresponding to that string. Memory is allocated for this, it must be freed	488	* corresponding to that string. Memory is allocated for this, it must be freed
583	* at a later date.	489	* at a later date.
584	* Called by parse_map_headers below.	490	* Called by parse_map_headers below.
…		…
661	return items;	567	return items;
662	}	568	}
663		569
664	/* opposite of parse string, this puts the string that was originally fed in to	570	/* opposite of parse string, this puts the string that was originally fed in to
665	* the map (or something equivilent) into output_string. */	571	* the map (or something equivilent) into output_string. */
666	static void	572	static const char *
667	print_shop_string (maptile m, char output_string)	573	print_shop_string (maptile *m)
668	{	574	{
669	int i;	575	static dynbuf_text buf; buf.clear ();
670	char tmp[MAX_BUF];
671		576
672	strcpy (output_string, "");
673	for (i = 0; i < m->shopitems[0].index; i++)	577	for (int i = 0; i < m->shopitems[0].index; i++)
674	{	578	{
675	if (m->shopitems[i].typenum)	579	if (m->shopitems[i].typenum)
676	{	580	{
677	if (m->shopitems[i].strength)	581	if (m->shopitems[i].strength)
678	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	582	buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
679	else	583	else
680	sprintf (tmp, "%s;", m->shopitems[i].name);	584	buf.printf ("%s;", m->shopitems[i].name);
681	}	585	}
682	else	586	else
683	{	587	{
684	if (m->shopitems[i].strength)	588	if (m->shopitems[i].strength)
685	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	589	buf.printf ("*:%d;", m->shopitems[i].strength);
686	else	590	else
687	sprintf (tmp, "*");	591	buf.printf ("*");
688	}	592	}
689
690	strcat (output_string, tmp);
691	}	593	}
		594
		595	return buf;
692	}	596	}
		597
		598	//-GPL
693		599
694	/* This loads the header information of the map. The header	600	/* This loads the header information of the map. The header
695	* contains things like difficulty, size, timeout, etc.	601	* contains things like difficulty, size, timeout, etc.
696	* this used to be stored in the map object, but with the	602	* this used to be stored in the map object, but with the
697	* addition of tiling, fields beyond that easily named in an	603	* addition of tiling, fields beyond that easily named in an
…		…
705	bool	611	bool
706	maptile::_load_header (object_thawer &thawer)	612	maptile::_load_header (object_thawer &thawer)
707	{	613	{
708	for (;;)	614	for (;;)
709	{	615	{
710	keyword kw = thawer.get_kv ();
711
712	switch (kw)	616	switch (thawer.kw)
713	{	617	{
714	case KW_msg:	618	case KW_msg:
715	thawer.get_ml (KW_endmsg, msg);	619	thawer.get_ml (KW_endmsg, msg);
716	break;	620	break;
717		621
…		…
749	case KW_winddir: thawer.get (winddir); break;	653	case KW_winddir: thawer.get (winddir); break;
750	case KW_sky: thawer.get (sky); break;	654	case KW_sky: thawer.get (sky); break;
751		655
752	case KW_per_player: thawer.get (per_player); break;	656	case KW_per_player: thawer.get (per_player); break;
753	case KW_per_party: thawer.get (per_party); break;	657	case KW_per_party: thawer.get (per_party); break;
		658	case KW_no_reset: thawer.get (no_reset); break;
		659	case KW_no_drop: thawer.get (no_drop); break;
754		660
755	case KW_region: default_region = region::find (thawer.get_str ()); break;	661	case KW_region: default_region = region::find (thawer.get_str ()); break;
756	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	662	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
757		663
758	// old names new names	664	// old names new names
…		…
769	case KW_tile_path_1: thawer.get (tile_path [0]); break;	675	case KW_tile_path_1: thawer.get (tile_path [0]); break;
770	case KW_tile_path_2: thawer.get (tile_path [1]); break;	676	case KW_tile_path_2: thawer.get (tile_path [1]); break;
771	case KW_tile_path_3: thawer.get (tile_path [2]); break;	677	case KW_tile_path_3: thawer.get (tile_path [2]); break;
772	case KW_tile_path_4: thawer.get (tile_path [3]); break;	678	case KW_tile_path_4: thawer.get (tile_path [3]); break;
773		679
		680	case KW_ERROR:
		681	set_key_text (thawer.kw_str, thawer.value);
		682	break;
		683
774	case KW_end:	684	case KW_end:
		685	thawer.next ();
775	return true;	686	return true;
776		687
777	default:	688	default:
778	if (!thawer.parse_error ("map", 0))	689	if (!thawer.parse_error ("map", 0))
779	return false;	690	return false;
780	break;	691	break;
781	}	692	}
		693
		694	thawer.next ();
782	}	695	}
783		696
784	abort ();	697	abort ();
785	}	698	}
786		699
787	bool	700	//+GPL
788	maptile::_load_header (const char *path)
789	{
790	object_thawer thawer (path);
791
792	if (!thawer)
793	return false;
794
795	return _load_header (thawer);
796	}
797		701
798	/******************************************************************************	702	/******************************************************************************
799	* This is the start of unique map handling code	703	* This is the start of unique map handling code
800	*****************************************************************************/	704	*****************************************************************************/
801		705
…		…
811	object *above = op->above;	715	object *above = op->above;
812		716
813	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	717	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
814	unique = 1;	718	unique = 1;
815		719
816	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	720	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
817	{
818	op->destroy_inv (false);
819	op->destroy ();	721	op->destroy ();
820	}
821		722
822	op = above;	723	op = above;
823	}	724	}
824	}	725	}
825	}	726	}
		727
		728	//-GPL
826		729
827	bool	730	bool
828	maptile::_save_header (object_freezer &freezer)	731	maptile::_save_header (object_freezer &freezer)
829	{	732	{
830	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	733	#define MAP_OUT(k) freezer.put (KW_ ## k, k)
…		…
835	if (name) MAP_OUT (name);	738	if (name) MAP_OUT (name);
836	MAP_OUT (swap_time);	739	MAP_OUT (swap_time);
837	MAP_OUT (reset_time);	740	MAP_OUT (reset_time);
838	MAP_OUT (reset_timeout);	741	MAP_OUT (reset_timeout);
839	MAP_OUT (fixed_resettime);	742	MAP_OUT (fixed_resettime);
		743	MAP_OUT (no_reset);
		744	MAP_OUT (no_drop);
840	MAP_OUT (difficulty);	745	MAP_OUT (difficulty);
841
842	if (default_region) MAP_OUT2 (region, default_region->name);	746	if (default_region) MAP_OUT2 (region, default_region->name);
843		747
844	if (shopitems)	748	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
845	{
846	char shop[MAX_BUF];
847	print_shop_string (this, shop);
848	MAP_OUT2 (shopitems, shop);
849	}
850
851	MAP_OUT (shopgreed);	749	MAP_OUT (shopgreed);
852	MAP_OUT (shopmin);	750	MAP_OUT (shopmin);
853	MAP_OUT (shopmax);	751	MAP_OUT (shopmax);
854	if (shoprace) MAP_OUT (shoprace);	752	if (shoprace) MAP_OUT (shoprace);
		753
855	MAP_OUT (darkness);	754	MAP_OUT (darkness);
856	MAP_OUT (width);	755	MAP_OUT (width);
857	MAP_OUT (height);	756	MAP_OUT (height);
858	MAP_OUT (enter_x);	757	MAP_OUT (enter_x);
859	MAP_OUT (enter_y);	758	MAP_OUT (enter_y);
…		…
892	return false;	791	return false;
893		792
894	return freezer.save (path);	793	return freezer.save (path);
895	}	794	}
896		795
		796	//+GPL
		797
897	/*	798	/*
898	* Remove and free all objects in the given map.	799	* Remove and free all objects in the given map.
899	*/	800	*/
900	void	801	void
901	maptile::clear ()	802	maptile::clear ()
902	{	803	{
903	sfree (regions, size ()), regions = 0;
904	free (regionmap), regionmap = 0;
905
906	if (spaces)	804	if (spaces)
907	{	805	{
908	for (mapspace *ms = spaces + size (); ms-- > spaces; )	806	for (mapspace *ms = spaces + size (); ms-- > spaces; )
909	while (object *op = ms->bot)	807	while (object *op = ms->bot)
910	{	808	{
		809	// manually remove, as to not trigger anything
		810	if (ms->bot = op->above)
		811	ms->bot->below = 0;
		812
		813	op->flag [FLAG_REMOVED] = true;
		814
		815	object *head = op->head_ ();
911	if (op->head)	816	if (op == head)
912	op = op->head;
913
914	op->destroy_inv (false);
915	op->destroy ();	817	op->destroy ();
		818	else if (head->map != op->map)
		819	{
		820	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		821	head->destroy ();
		822	}
916	}	823	}
917		824
918	sfree (spaces, size ()), spaces = 0;	825	sfree0 (spaces, size ());
919	}	826	}
920		827
921	if (buttons)	828	if (buttons)
922	free_objectlinkpt (buttons), buttons = 0;	829	free_objectlinkpt (buttons), buttons = 0;
		830
		831	sfree0 (regions, size ());
		832	delete [] regionmap; regionmap = 0;
923	}	833	}
924		834
925	void	835	void
926	maptile::clear_header ()	836	maptile::clear_header ()
927	{	837	{
…		…
959	attachable::do_destroy ();	869	attachable::do_destroy ();
960		870
961	clear ();	871	clear ();
962	}	872	}
963		873
964	/*	874	/* decay and destroy perishable items in a map */
965	* Updates every button on the map (by calling update_button() for them).
966	*/
967	void	875	void
968	maptile::update_buttons ()	876	maptile::do_decay_objects ()
969	{	877	{
970	for (oblinkpt *obp = buttons; obp; obp = obp->next)	878	if (!spaces)
971	for (objectlink *ol = obp->link; ol; ol = ol->next)	879	return;
		880
		881	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		882	for (object above, op = ms->bot; op; op = above)
972	{	883	{
973	if (!ol->ob)	884	above = op->above;
		885
		886	bool destroy = 0;
		887
		888	// do not decay anything above unique floor tiles (yet :)
		889	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
		890	break;
		891
		892	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
		893	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
		894	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
		895	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
		896	\|\| QUERY_FLAG (op, FLAG_UNPAID)
		897	\|\| op->is_alive ())
		898	; // do not decay
		899	else if (op->is_weapon ())
974	{	900	{
975	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",	901	op->stats.dam--;
976	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);	902	if (op->stats.dam < 0)
977	continue;	903	destroy = 1;
978	}	904	}
979		905	else if (op->is_armor ())
980	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
981	{	906	{
982	update_button (ol->ob);	907	op->stats.ac--;
983	break;	908	if (op->stats.ac < 0)
		909	destroy = 1;
984	}	910	}
		911	else if (op->type == FOOD)
		912	{
		913	op->stats.food -= rndm (5, 20);
		914	if (op->stats.food < 0)
		915	destroy = 1;
		916	}
		917	else
		918	{
		919	int mat = op->materials;
		920
		921	if (mat & M_PAPER
		922	\|\| mat & M_LEATHER
		923	\|\| mat & M_WOOD
		924	\|\| mat & M_ORGANIC
		925	\|\| mat & M_CLOTH
		926	\|\| mat & M_LIQUID
		927	\|\| (mat & M_IRON && rndm (1, 5) == 1)
		928	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
		929	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
		930	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
		931	\|\| (mat & M_ICE && temp > 32))
		932	destroy = 1;
		933	}
		934
		935	/* adjust overall chance below */
		936	if (destroy && rndm (0, 1))
		937	op->destroy ();
985	}	938	}
986	}	939	}
987		940
988	/*	941	/*
989	* 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.
990	* difficulty does not have a lot to do with character level,	943	* difficulty does not have a lot to do with character level,
991	* 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.
992	*	945	*
993	* 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
994	* 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
995	* have a difficulty set than using this function - human calculation	948	* have a difficulty set rather than using this function - human calculation
996	* is much better than this functions guesswork.	949	* is much better than this function's guesswork.
997	*/	950	*/
998	int	951	int
999	maptile::estimate_difficulty () const	952	maptile::estimate_difficulty () const
1000	{	953	{
1001	long monster_cnt = 0;	954	long monster_cnt = 0;
…		…
1013		966
1014	if (QUERY_FLAG (op, FLAG_GENERATOR))	967	if (QUERY_FLAG (op, FLAG_GENERATOR))
1015	{	968	{
1016	total_exp += op->stats.exp;	969	total_exp += op->stats.exp;
1017		970
1018	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	971	if (archetype *at = op->other_arch)
		972	{
1019	total_exp += at->clone.stats.exp * 8;	973	total_exp += at->stats.exp * 8;
1020
1021	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	}
1022	}	982	}
1023	}	983	}
1024		984
1025	avgexp = (double) total_exp / monster_cnt;	985	avgexp = (double) total_exp / monster_cnt;
1026		986
…		…
1039	* postive values make it darker, negative make it brighter	999	* postive values make it darker, negative make it brighter
1040	*/	1000	*/
1041	int	1001	int
1042	maptile::change_map_light (int change)	1002	maptile::change_map_light (int change)
1043	{	1003	{
1044	int new_level = darkness + change;
1045
1046	/* Nothing to do */	1004	/* Nothing to do */
1047	if (!change \|\| (new_level <= 0 && darkness == 0) \|\| (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	1005	if (!change)
1048	return 0;	1006	return 0;
1049		1007
1050	/* inform all players on the map */	1008	/* inform all players on the map */
1051	if (change > 0)	1009	if (change > 0)
1052	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");	1010	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");
1053	else	1011	else
1054	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");	1012	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");
1055		1013
1056	/* Do extra checking. since darkness is a unsigned value,	1014	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1057	* we need to be extra careful about negative values.
1058	* In general, the checks below are only needed if change
1059	* is not +/-1
1060	*/
1061	if (new_level < 0)
1062	darkness = 0;
1063	else if (new_level >= MAX_DARKNESS)
1064	darkness = MAX_DARKNESS;
1065	else
1066	darkness = new_level;
1067		1015
1068	/* All clients need to get re-updated for the change */	1016	/* All clients need to get re-updated for the change */
1069	update_all_map_los (this);	1017	update_all_map_los (this);
		1018
1070	return 1;	1019	return 1;
1071	}	1020	}
1072		1021
1073	/*	1022	/*
1074	* This function updates various attributes about a specific space	1023	* This function updates various attributes about a specific space
…		…
1077	* through, etc)	1026	* through, etc)
1078	*/	1027	*/
1079	void	1028	void
1080	mapspace::update_ ()	1029	mapspace::update_ ()
1081	{	1030	{
1082	object tmp, last = 0;	1031	object *last = 0;
1083	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1032	uint8 flags = P_UPTODATE;
1084	facetile top, floor, *middle;	1033	sint8 light = 0;
1085	object top_obj, floor_obj, *middle_obj;
1086	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;
1087		1039
1088	middle = blank_face;	1040	//object *middle = 0;
1089	top = blank_face;	1041	//object *top = 0;
1090	floor = blank_face;	1042	//object *floor = 0;
		1043	// this seems to generate better code than using locals, above
		1044	object *&top = faces_obj[0] = 0;
		1045	object *&middle = faces_obj[1] = 0;
		1046	object *&floor = faces_obj[2] = 0;
1091		1047
1092	middle_obj = 0;	1048	object::flags_t allflags; // all flags of all objects or'ed together
1093	top_obj = 0;
1094	floor_obj = 0;
1095		1049
1096	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1050	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1097	{	1051	{
1098	/* This could be made additive I guess (two lights better than	1052	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1099	* one). But if so, it shouldn't be a simple additive - 2
1100	* light bulbs do not illuminate twice as far as once since
1101	* it is a dissapation factor that is cubed.
1102	*/
1103	if (tmp->glow_radius > light)
1104	light = tmp->glow_radius;	1053	light += tmp->glow_radius;
1105		1054
1106	/* This call is needed in order to update objects the player	1055	/* This call is needed in order to update objects the player
1107	* is standing in that have animations (ie, grass, fire, etc).	1056	* is standing in that have animations (ie, grass, fire, etc).
1108	* However, it also causes the look window to be re-drawn	1057	* However, it also causes the look window to be re-drawn
1109	* 3 times each time the player moves, because many of the	1058	* 3 times each time the player moves, because many of the
1110	* functions the move_player calls eventualy call this.	1059	* functions the move_player calls eventualy call this.
1111	*	1060	*
1112	* Always put the player down for drawing.	1061	* Always put the player down for drawing.
1113	*/	1062	*/
1114	if (!tmp->invisible)	1063	if (expect_true (!tmp->invisible))
1115	{	1064	{
1116	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))	1065	if (expect_false (tmp->type == PLAYER \|\| tmp->flag [FLAG_MONSTER]))
1117	{
1118	top = tmp->face;
1119	top_obj = tmp;	1066	top = tmp;
1120	}	1067	else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1121	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1122	{	1068	{
1123	/* 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,
1124	* so should not be visible, so we clear them.	1070	* so should not be visible, so we clear them.
1125	*/	1071	*/
1126	middle = blank_face;	1072	middle = 0;
1127	top = blank_face;	1073	top = 0;
1128	floor = tmp->face;
1129	floor_obj = tmp;	1074	floor = tmp;
		1075	volume = 0;
		1076	items = 0;
1130	}	1077	}
1131	/* Flag anywhere have high priority */	1078	else
1132	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1133	{	1079	{
1134	middle = tmp->face;	1080	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1081	{
		1082	++items;
		1083	volume += tmp->volume ();
		1084	}
1135		1085
1136	middle_obj = tmp;	1086	/* Flag anywhere have high priority */
		1087	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1137	anywhere = 1;	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;
		1097	middle = tmp;
		1098	}
1138	}	1099	}
1139	/* Find the highest visible face around. If equal
1140	* visibilities, we still want the one nearer to the
1141	* top
1142	*/
1143	else if (middle == blank_face \|\| (tmp->face->visibility > middle->visibility && !anywhere))
1144	{
1145	middle = tmp->face;
1146	middle_obj = tmp;
1147	}
1148	}
1149
1150	if (tmp == tmp->above)
1151	{
1152	LOG (llevError, "Error in structure of map\n");
1153	exit (-1);
1154	}	1100	}
1155		1101
1156	move_slow \|= tmp->move_slow;	1102	move_slow \|= tmp->move_slow;
1157	move_block \|= tmp->move_block;	1103	move_block \|= tmp->move_block;
1158	move_on \|= tmp->move_on;	1104	move_on \|= tmp->move_on;
1159	move_off \|= tmp->move_off;	1105	move_off \|= tmp->move_off;
1160	move_allow \|= tmp->move_allow;	1106	move_allow \|= tmp->move_allow;
1161		1107
1162	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags \|= P_BLOCKSVIEW;	1108	allflags \|= tmp->flag;
1163	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags \|= P_NO_MAGIC;	1109
1164	if (tmp->type == PLAYER) flags \|= P_PLAYER;	1110	if (tmp->type == PLAYER) flags \|= P_PLAYER;
1165	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1111	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1166	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1167	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1168	}	1112	}
1169		1113
1170	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);
1171	this->flags_ = flags;	1125	this->flags_ = flags;
1172	this->move_block = move_block & ~move_allow;	1126	this->move_block = move_block & ~move_allow;
1173	this->move_on = move_on;	1127	this->move_on = move_on;
1174	this->move_off = move_off;	1128	this->move_off = move_off;
1175	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
1176		1132
1177	/* 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),
1178	* 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
1179	* this point.	1135	* this point.
1180	* middle contains the highest visibility face.	1136	* middle contains the highest visibility face.
…		…
1187	* middle face. This should not happen, as we already have the	1143	* middle face. This should not happen, as we already have the
1188	* else statement above so middle should not get set. OTOH, it	1144	* else statement above so middle should not get set. OTOH, it
1189	* may be possible for the faces to match but be different objects.	1145	* may be possible for the faces to match but be different objects.
1190	*/	1146	*/
1191	if (top == middle)	1147	if (top == middle)
1192	middle = blank_face;	1148	middle = 0;
1193		1149
1194	/* There are three posibilities at this point:	1150	/* There are three posibilities at this point:
1195	* 1) top face is set, need middle to be set.	1151	* 1) top face is set, need middle to be set.
1196	* 2) middle is set, need to set top.	1152	* 2) middle is set, need to set top.
1197	* 3) neither middle or top is set - need to set both.	1153	* 3) neither middle or top is set - need to set both.
1198	*/	1154	*/
1199		1155
1200	for (tmp = last; tmp; tmp = tmp->below)	1156	for (object *tmp = last; tmp; tmp = tmp->below)
1201	{	1157	{
1202	/* 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 */
1203	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1159	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1204	break;	1160	break;
1205		1161
1206	/* If two top faces are already set, quit processing */	1162	/* If two top faces are already set, quit processing */
1207	if ((top != blank_face) && (middle != blank_face))	1163	if (top && middle)
1208	break;	1164	break;
1209		1165
1210	/* Only show visible faces */	1166	/* Only show visible faces */
1211	if (!tmp->invisible)	1167	if (!tmp->invisible)
1212	{	1168	{
1213	/* Fill in top if needed */	1169	/* Fill in top if needed */
1214	if (top == blank_face)	1170	if (!top)
1215	{	1171	{
1216	top = tmp->face;
1217	top_obj = tmp;	1172	top = tmp;
1218	if (top == middle)	1173	if (top == middle)
1219	middle = blank_face;	1174	middle = 0;
1220	}	1175	}
1221	else	1176	else
1222	{	1177	{
1223	/* top is already set - we should only get here if	1178	/* top is already set - we should only get here if
1224	* middle is not set	1179	* middle is not set
1225	*	1180	*
1226	* Set the middle face and break out, since there is nothing	1181	* Set the middle face and break out, since there is nothing
1227	* more to fill in. We don't check visiblity here, since	1182	* more to fill in. We don't check visiblity here, since
1228	*	1183	*
1229	*/	1184	*/
1230	if (tmp->face != top)	1185	if (tmp != top)
1231	{	1186	{
1232	middle = tmp->face;
1233	middle_obj = tmp;	1187	middle = tmp;
1234	break;	1188	break;
1235	}	1189	}
1236	}	1190	}
1237	}	1191	}
1238	}	1192	}
1239		1193
1240	if (middle == floor)	1194	if (middle == floor)
1241	middle = blank_face;	1195	middle = 0;
1242		1196
1243	if (top == middle)	1197	if (top == middle)
1244	middle = blank_face;	1198	middle = 0;
1245		1199
1246	faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;	1200	#if 0
1247	faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;	1201	faces_obj [0] = top;
1248	faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;	1202	faces_obj [1] = middle;
		1203	faces_obj [2] = floor;
		1204	#endif
1249	}	1205	}
1250		1206
1251	uint64	1207	maptile *
1252	mapspace::volume () const	1208	maptile::tile_available (int dir, bool load)
1253	{	1209	{
1254	uint64 vol = 0;	1210	if (tile_path[dir])
1255
1256	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1257	vol += op->volume ();
1258
1259	return vol;
1260	}
1261
1262	/* this updates the orig_map->tile_map[tile_num] value after finding
1263	* the map. It also takes care of linking back the freshly found
1264	* maps tile_map values if it tiles back to this one. It returns
1265	* the value of orig_map->tile_map[tile_num].
1266	*/
1267	static inline maptile *
1268	find_and_link (maptile *orig_map, int tile_num)
1269	{
1270	maptile *mp = orig_map->tile_map [tile_num];
1271
1272	if (!mp)
1273	{
1274	mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1275
1276	if (!mp)
1277	{
1278	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1279	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1280	&orig_map->tile_path[tile_num], &orig_map->path);
1281	mp = new maptile (1, 1);
1282	mp->alloc ();
1283	mp->in_memory = MAP_IN_MEMORY;
1284	}
1285	}	1211	{
		1212	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
		1213	return tile_map[dir];
1286		1214
1287	int dest_tile = (tile_num + 2) % 4;	1215	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1216	return tile_map[dir];
		1217	}
1288		1218
1289	orig_map->tile_map [tile_num] = mp;
1290
1291	// optimisation: back-link map to origin map if euclidean
1292	//TODO: non-euclidean maps MUST GO
1293	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1294	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1295
1296	return mp;	1219	return 0;
1297	}
1298
1299	static inline void
1300	load_and_link (maptile *orig_map, int tile_num)
1301	{
1302	find_and_link (orig_map, tile_num)->load_sync ();
1303	}	1220	}
1304		1221
1305	/* this returns TRUE if the coordinates (x,y) are out of	1222	/* this returns TRUE if the coordinates (x,y) are out of
1306	* map m. This function also takes into account any	1223	* map m. This function also takes into account any
1307	* tiling considerations, loading adjacant maps as needed.	1224	* tiling considerations, loading adjacant maps as needed.
…		…
1320	if (!m)	1237	if (!m)
1321	return 0;	1238	return 0;
1322		1239
1323	if (x < 0)	1240	if (x < 0)
1324	{	1241	{
1325	if (!m->tile_path[3])	1242	if (!m->tile_available (3))
1326	return 1;	1243	return 1;
1327		1244
1328	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1329	find_and_link (m, 3);
1330
1331	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1245	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1332	}	1246	}
1333		1247
1334	if (x >= m->width)	1248	if (x >= m->width)
1335	{	1249	{
1336	if (!m->tile_path[1])	1250	if (!m->tile_available (1))
1337	return 1;	1251	return 1;
1338		1252
1339	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1340	find_and_link (m, 1);
1341
1342	return out_of_map (m->tile_map[1], x - m->width, y);	1253	return out_of_map (m->tile_map[1], x - m->width, y);
1343	}	1254	}
1344		1255
1345	if (y < 0)	1256	if (y < 0)
1346	{	1257	{
1347	if (!m->tile_path[0])	1258	if (!m->tile_available (0))
1348	return 1;	1259	return 1;
1349		1260
1350	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1351	find_and_link (m, 0);
1352
1353	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1261	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1354	}	1262	}
1355		1263
1356	if (y >= m->height)	1264	if (y >= m->height)
1357	{	1265	{
1358	if (!m->tile_path[2])	1266	if (!m->tile_available (2))
1359	return 1;	1267	return 1;
1360
1361	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1362	find_and_link (m, 2);
1363		1268
1364	return out_of_map (m->tile_map[2], x, y - m->height);	1269	return out_of_map (m->tile_map[2], x, y - m->height);
1365	}	1270	}
1366		1271
1367	/* Simple case - coordinates are within this local	1272	/* Simple case - coordinates are within this local
…		…
1381	maptile *	1286	maptile *
1382	maptile::xy_find (sint16 &x, sint16 &y)	1287	maptile::xy_find (sint16 &x, sint16 &y)
1383	{	1288	{
1384	if (x < 0)	1289	if (x < 0)
1385	{	1290	{
1386	if (!tile_path[3])	1291	if (!tile_available (3))
1387	return 0;	1292	return 0;
1388		1293
1389	find_and_link (this, 3);
1390	x += tile_map[3]->width;	1294	x += tile_map[3]->width;
1391	return tile_map[3]->xy_find (x, y);	1295	return tile_map[3]->xy_find (x, y);
1392	}	1296	}
1393		1297
1394	if (x >= width)	1298	if (x >= width)
1395	{	1299	{
1396	if (!tile_path[1])	1300	if (!tile_available (1))
1397	return 0;	1301	return 0;
1398		1302
1399	find_and_link (this, 1);
1400	x -= width;	1303	x -= width;
1401	return tile_map[1]->xy_find (x, y);	1304	return tile_map[1]->xy_find (x, y);
1402	}	1305	}
1403		1306
1404	if (y < 0)	1307	if (y < 0)
1405	{	1308	{
1406	if (!tile_path[0])	1309	if (!tile_available (0))
1407	return 0;	1310	return 0;
1408		1311
1409	find_and_link (this, 0);
1410	y += tile_map[0]->height;	1312	y += tile_map[0]->height;
1411	return tile_map[0]->xy_find (x, y);	1313	return tile_map[0]->xy_find (x, y);
1412	}	1314	}
1413		1315
1414	if (y >= height)	1316	if (y >= height)
1415	{	1317	{
1416	if (!tile_path[2])	1318	if (!tile_available (2))
1417	return 0;	1319	return 0;
1418		1320
1419	find_and_link (this, 2);
1420	y -= height;	1321	y -= height;
1421	return tile_map[2]->xy_find (x, y);	1322	return tile_map[2]->xy_find (x, y);
1422	}	1323	}
1423		1324
1424	/* Simple case - coordinates are within this local	1325	/* Simple case - coordinates are within this local
…		…
1435	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1336	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1436	{	1337	{
1437	if (!map1 \|\| !map2)	1338	if (!map1 \|\| !map2)
1438	return 0;	1339	return 0;
1439		1340
1440	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1341	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1441	//fix: compare paths instead (this is likely faster, too!)	1342	//fix: compare paths instead (this is likely faster, too!)
1442	if (map1 == map2)	1343	if (map1 == map2)
1443	{	1344	{
1444	*dx = 0;	1345	*dx = 0;
1445	*dy = 0;	1346	*dy = 0;
…		…
1627	else	1528	else
1628	{	1529	{
1629	retval->distance_x += op2->x - x;	1530	retval->distance_x += op2->x - x;
1630	retval->distance_y += op2->y - y;	1531	retval->distance_y += op2->y - y;
1631		1532
1632	retval->part = NULL;	1533	retval->part = 0;
1633	retval->distance = idistance (retval->distance_x, retval->distance_y);	1534	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1634	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1535	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1635	}	1536	}
1636	}	1537	}
1637		1538
1638	/* Returns true of op1 and op2 are effectively on the same map	1539	/* Returns true of op1 and op2 are effectively on the same map
…		…
1649	int dx, dy;	1550	int dx, dy;
1650		1551
1651	return adjacent_map (op1->map, op2->map, &dx, &dy);	1552	return adjacent_map (op1->map, op2->map, &dx, &dy);
1652	}	1553	}
1653		1554
		1555	//-GPL
		1556
1654	object *	1557	object *
1655	maptile::insert (object op, int x, int y, object originator, int flags)	1558	maptile::insert (object op, int x, int y, object originator, int flags)
1656	{	1559	{
1657	if (!op->flag [FLAG_REMOVED])
1658	op->remove ();
1659
1660	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1560	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1661	}	1561	}
1662		1562
1663	region *	1563	region *
1664	maptile::region (int x, int y) const	1564	maptile::region (int x, int y) const
…		…
1673	return default_region;	1573	return default_region;
1674		1574
1675	return ::region::default_region ();	1575	return ::region::default_region ();
1676	}	1576	}
1677		1577
		1578	//+GPL
1678		1579
		1580	/* picks a random object from a style map.
		1581	*/
		1582	object *
		1583	maptile::pick_random_object (rand_gen &gen) const
		1584	{
		1585	/* while returning a null object will result in a crash, that
		1586	* is actually preferable to an infinite loop. That is because
		1587	* most servers will automatically restart in case of crash.
		1588	* Change the logic on getting the random space - shouldn't make
		1589	* any difference, but this seems clearer to me.
		1590	*/
		1591	for (int i = 1000; --i;)
		1592	{
		1593	object *pick = at (gen (width), gen (height)).bot;
		1594
		1595	// do not prefer big monsters just because they are big.
		1596	if (pick && pick->is_head ())
		1597	return pick->head_ ();
		1598	}
		1599
		1600	// instead of crashing in the unlikely(?) case, try to return something
		1601	return archetype::find (shstr_bug);
		1602	}
		1603
		1604	//-GPL
		1605
		1606	void
		1607	maptile::play_sound (faceidx sound, int x, int y) const
		1608	{
		1609	if (!sound)
		1610	return;
		1611
		1612	for_all_players_on_map (pl, this)
		1613	if (client *ns = pl->ns)
		1614	{
		1615	int dx = x - pl->ob->x;
		1616	int dy = y - pl->ob->y;
		1617
		1618	int distance = idistance (dx, dy);
		1619
		1620	if (distance <= MAX_SOUND_DISTANCE)
		1621	ns->play_sound (sound, dx, dy);
		1622	}
		1623	}
		1624
		1625	void
		1626	maptile::say_msg (const char *msg, int x, int y) const
		1627	{
		1628	for_all_players (pl)
		1629	if (client *ns = pl->ns)
		1630	{
		1631	int dx = x - pl->ob->x;
		1632	int dy = y - pl->ob->y;
		1633
		1634	int distance = idistance (dx, dy);
		1635
		1636	if (distance <= MAX_SOUND_DISTANCE)
		1637	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
		1638	}
		1639	}
		1640
		1641	static void
		1642	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1643	{
		1644	// clip to map to the left
		1645	if (x0 < 0)
		1646	{
		1647	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1648	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1649
		1650	if (x1 < 0) // entirely to the left
		1651	return;
		1652
		1653	x0 = 0;
		1654	}
		1655
		1656	// clip to map to the right
		1657	if (x1 > m->width)
		1658	{
		1659	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1660	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1661
		1662	if (x0 > m->width) // entirely to the right
		1663	return;
		1664
		1665	x1 = m->width;
		1666	}
		1667
		1668	// clip to map above
		1669	if (y0 < 0)
		1670	{
		1671	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1672	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1673
		1674	if (y1 < 0) // entirely above
		1675	return;
		1676
		1677	y0 = 0;
		1678	}
		1679
		1680	// clip to map below
		1681	if (y1 > m->height)
		1682	{
		1683	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1684	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1685
		1686	if (y0 > m->height) // entirely below
		1687	return;
		1688
		1689	y1 = m->height;
		1690	}
		1691
		1692	// if we get here, the rect is within the current map
		1693	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1694
		1695	r->m = m;
		1696	r->x0 = x0;
		1697	r->y0 = y0;
		1698	r->x1 = x1;
		1699	r->y1 = y1;
		1700	r->dx = dx;
		1701	r->dy = dy;
		1702	}
		1703
		1704	maprect *
		1705	maptile::split_to_tiles (int x0, int y0, int x1, int y1)
		1706	{
		1707	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
		1708	buf.clear ();
		1709
		1710	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1711
		1712	// add end marker
		1713	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1714	r->m = 0;
		1715
		1716	return (maprect *)buf.linearise ();
		1717	}
		1718

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.88 by root, Fri Feb 16 19:43:40 2007 UTC vs. Revision 1.174 by root, Tue Nov 10 05:05:22 2009 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.88 by root, Fri Feb 16 19:43:40 2007 UTC vs.
Revision 1.174 by root, Tue Nov 10 05:05:22 2009 UTC