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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.90 by root, Fri Feb 16 22:21:46 2007 UTC vs.
Revision 1.173 by root, Mon Nov 9 18:47:56 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
…		…
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; tmp = tmp->above)	289	{
		290	object *op = ms->bot;
		291	while (op)
360	{	292	{
361	/* already multipart - don't do anything more */	293	/* already multipart - don't do anything more */
362	if (!tmp->head && !tmp->more)	294	if (op->head_ () == op && !op->more && op->arch->more)
363	{
364	/* If there is nothing more to this object, this for loop
365	* won't do anything.
366	*/
367	archetype *at;
368	object last, op;
369	for (at = tmp->arch->more, last = tmp;
370	at;
371	at = at->more, last = op)
372	{	295	{
373	op = arch_to_object (at);	296	op->remove ();
		297	op->expand_tail ();
374		298
375	/* update x,y coordinates */	299	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
376	op->x += tmp->x;	300	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
377	op->y += tmp->y;	301	// below the pentagrams... hopefully INS_ON_TOP doesn't break anything
378	op->head = tmp;
379	op->map = this;
380	last->more = op;
381	op->name = tmp->name;
382	op->title = tmp->title;
383
384	/* we could link all the parts onto tmp, and then just
385	* call insert_ob_in_map once, but the effect is the same,
386	* as insert_ob_in_map will call itself with each part, and
387	* the coding is simpler to just to it here with each part.
388	*/
389	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
390	}	306	}
		307	else
		308	op = op->above;
391	}	309	}
392	}	310	}
393	}	311	}
		312
		313	//-GPL
394		314
395	/*	315	/*
396	* 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
397	* file pointer.	317	* file pointer.
398	*/	318	*/
399	bool	319	bool
400	maptile::_load_objects (object_thawer &f)	320	maptile::_load_objects (object_thawer &f)
401	{	321	{
402	for (;;)	322	for (;;)
403	{	323	{
404	coroapi::cede_every (1000); // cede once in a while	324	coroapi::cede_to_tick (); // cede once in a while
405		325
406	switch (f.kw)	326	switch (f.kw)
407	{	327	{
408	case KW_arch:	328	case KW_arch:
409	if (object *op = object::read (f, this))	329	if (object *op = object::read (f, this))
410	{	330	{
		331	// TODO: why?
411	if (op->inv)	332	if (op->inv)
412	sum_weight (op);	333	op->update_weight ();
413		334
414	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	}
415	}	358	}
416		359
417	continue;	360	continue;
418		361
419	case KW_EOF:	362	case KW_EOF:
…		…
432	}	375	}
433		376
434	void	377	void
435	maptile::activate ()	378	maptile::activate ()
436	{	379	{
437	if (!spaces)	380	if (spaces)
438	return;
439
440	for (mapspace *ms = spaces + size (); ms-- > spaces; )	381	for (mapspace *ms = spaces + size (); ms-- > spaces; )
441	for (object *op = ms->bot; op; op = op->above)	382	for (object *op = ms->bot; op; op = op->above)
442	op->activate_recursive ();	383	op->activate_recursive ();
443	}	384	}
444		385
445	void	386	void
446	maptile::deactivate ()	387	maptile::deactivate ()
447	{	388	{
448	if (!spaces)	389	if (spaces)
449	return;
450
451	for (mapspace *ms = spaces + size (); ms-- > spaces; )	390	for (mapspace *ms = spaces + size (); ms-- > spaces; )
452	for (object *op = ms->bot; op; op = op->above)	391	for (object *op = ms->bot; op; op = op->above)
453	op->deactivate_recursive ();	392	op->deactivate_recursive ();
454	}	393	}
455		394
456	bool	395	bool
457	maptile::_save_objects (object_freezer &f, int flags)	396	maptile::_save_objects (object_freezer &f, int flags)
458	{	397	{
459	static int cede_count = 0;	398	coroapi::cede_to_tick ();
460		399
461	if (flags & IO_HEADER)	400	if (flags & IO_HEADER)
462	_save_header (f);	401	_save_header (f);
463		402
464	if (!spaces)	403	if (!spaces)
465	return false;	404	return false;
466		405
467	for (int i = 0; i < size (); ++i)	406	for (int i = 0; i < size (); ++i)
468	{	407	{
469	#if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D
470	if (cede_count >= 500)
471	{
472	cede_count = 0;
473	coroapi::cede ();
474	}
475	#endif
476
477	int unique = 0;	408	bool unique = 0;
		409
478	for (object *op = spaces [i].bot; op; op = op->above)	410	for (object *op = spaces [i].bot; op; op = op->above)
479	{	411	{
480	// count per-object, but cede only when modification-safe
481	cede_count++;
482
483	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	412	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
484	unique = 1;
485		413
486	if (!op->can_map_save ())	414	if (expect_false (!op->can_map_save ()))
487	continue;	415	continue;
488		416
489	if (unique \|\| op->flag [FLAG_UNIQUE])	417	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
490	{	418	{
491	if (flags & IO_UNIQUES)	419	if (flags & IO_UNIQUES)
492	op->write (f);	420	op->write (f);
493	}	421	}
494	else if (flags & IO_OBJECTS)	422	else if (expect_true (flags & IO_OBJECTS))
495	op->write (f);	423	op->write (f);
496	}	424	}
497	}	425	}
498		426
		427	coroapi::cede_to_tick ();
		428
499	return true;	429	return true;
500	}
501
502	bool
503	maptile::_load_objects (const char *path, bool skip_header)
504	{
505	object_thawer f (path);
506
507	if (!f)
508	return false;
509
510	f.next ();
511
512	if (skip_header)
513	for (;;)
514	{
515	keyword kw = f.kw;
516	f.skip ();
517	if (kw == KW_end)
518	break;
519	}
520
521	return _load_objects (f);
522	}	430	}
523		431
524	bool	432	bool
525	maptile::_save_objects (const char *path, int flags)	433	maptile::_save_objects (const char *path, int flags)
526	{	434	{
…		…
540	* map archetype. Mimic that behaviour.	448	* map archetype. Mimic that behaviour.
541	*/	449	*/
542	width = 16;	450	width = 16;
543	height = 16;	451	height = 16;
544	timeout = 300;	452	timeout = 300;
545	max_nrof = 1000; // 1000 items of anything	453	max_items = MAX_ITEM_PER_ACTION;
546	max_volume = 2000000; // 2m³	454	max_volume = 2000000; // 2m³
547	}	455	}
548		456
549	maptile::maptile (int w, int h)	457	maptile::maptile (int w, int h)
550	{	458	{
…		…
571	if (spaces)	479	if (spaces)
572	return;	480	return;
573		481
574	spaces = salloc0<mapspace> (size ());	482	spaces = salloc0<mapspace> (size ());
575	}	483	}
		484
		485	//+GPL
576		486
577	/* 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
578	* 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
579	* at a later date.	489	* at a later date.
580	* Called by parse_map_headers below.	490	* Called by parse_map_headers below.
…		…
657	return items;	567	return items;
658	}	568	}
659		569
660	/* 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
661	* the map (or something equivilent) into output_string. */	571	* the map (or something equivilent) into output_string. */
662	static void	572	static const char *
663	print_shop_string (maptile m, char output_string)	573	print_shop_string (maptile *m)
664	{	574	{
665	int i;	575	static dynbuf_text buf; buf.clear ();
666	char tmp[MAX_BUF];
667		576
668	strcpy (output_string, "");
669	for (i = 0; i < m->shopitems[0].index; i++)	577	for (int i = 0; i < m->shopitems[0].index; i++)
670	{	578	{
671	if (m->shopitems[i].typenum)	579	if (m->shopitems[i].typenum)
672	{	580	{
673	if (m->shopitems[i].strength)	581	if (m->shopitems[i].strength)
674	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);
675	else	583	else
676	sprintf (tmp, "%s;", m->shopitems[i].name);	584	buf.printf ("%s;", m->shopitems[i].name);
677	}	585	}
678	else	586	else
679	{	587	{
680	if (m->shopitems[i].strength)	588	if (m->shopitems[i].strength)
681	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	589	buf.printf ("*:%d;", m->shopitems[i].strength);
682	else	590	else
683	sprintf (tmp, "*");	591	buf.printf ("*");
684	}	592	}
685
686	strcat (output_string, tmp);
687	}	593	}
		594
		595	return buf;
688	}	596	}
		597
		598	//-GPL
689		599
690	/* This loads the header information of the map. The header	600	/* This loads the header information of the map. The header
691	* contains things like difficulty, size, timeout, etc.	601	* contains things like difficulty, size, timeout, etc.
692	* 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
693	* addition of tiling, fields beyond that easily named in an	603	* addition of tiling, fields beyond that easily named in an
…		…
701	bool	611	bool
702	maptile::_load_header (object_thawer &thawer)	612	maptile::_load_header (object_thawer &thawer)
703	{	613	{
704	for (;;)	614	for (;;)
705	{	615	{
706	keyword kw = thawer.get_kv ();
707
708	switch (kw)	616	switch (thawer.kw)
709	{	617	{
710	case KW_msg:	618	case KW_msg:
711	thawer.get_ml (KW_endmsg, msg);	619	thawer.get_ml (KW_endmsg, msg);
712	break;	620	break;
713		621
…		…
745	case KW_winddir: thawer.get (winddir); break;	653	case KW_winddir: thawer.get (winddir); break;
746	case KW_sky: thawer.get (sky); break;	654	case KW_sky: thawer.get (sky); break;
747		655
748	case KW_per_player: thawer.get (per_player); break;	656	case KW_per_player: thawer.get (per_player); break;
749	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;
750		660
751	case KW_region: default_region = region::find (thawer.get_str ()); break;	661	case KW_region: default_region = region::find (thawer.get_str ()); break;
752	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	662	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
753		663
754	// old names new names	664	// old names new names
…		…
765	case KW_tile_path_1: thawer.get (tile_path [0]); break;	675	case KW_tile_path_1: thawer.get (tile_path [0]); break;
766	case KW_tile_path_2: thawer.get (tile_path [1]); break;	676	case KW_tile_path_2: thawer.get (tile_path [1]); break;
767	case KW_tile_path_3: thawer.get (tile_path [2]); break;	677	case KW_tile_path_3: thawer.get (tile_path [2]); break;
768	case KW_tile_path_4: thawer.get (tile_path [3]); break;	678	case KW_tile_path_4: thawer.get (tile_path [3]); break;
769		679
		680	case KW_ERROR:
		681	set_key_text (thawer.kw_str, thawer.value);
		682	break;
		683
770	case KW_end:	684	case KW_end:
		685	thawer.next ();
771	return true;	686	return true;
772		687
773	default:	688	default:
774	if (!thawer.parse_error ("map", 0))	689	if (!thawer.parse_error ("map", 0))
775	return false;	690	return false;
776	break;	691	break;
777	}	692	}
		693
		694	thawer.next ();
778	}	695	}
779		696
780	abort ();	697	abort ();
781	}	698	}
782		699
783	bool	700	//+GPL
784	maptile::_load_header (const char *path)
785	{
786	object_thawer thawer (path);
787
788	if (!thawer)
789	return false;
790
791	return _load_header (thawer);
792	}
793		701
794	/******************************************************************************	702	/******************************************************************************
795	* This is the start of unique map handling code	703	* This is the start of unique map handling code
796	*****************************************************************************/	704	*****************************************************************************/
797		705
…		…
807	object *above = op->above;	715	object *above = op->above;
808		716
809	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))
810	unique = 1;	718	unique = 1;
811		719
812	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	720	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
813	{
814	op->destroy_inv (false);
815	op->destroy ();	721	op->destroy ();
816	}
817		722
818	op = above;	723	op = above;
819	}	724	}
820	}	725	}
821	}	726	}
		727
		728	//-GPL
822		729
823	bool	730	bool
824	maptile::_save_header (object_freezer &freezer)	731	maptile::_save_header (object_freezer &freezer)
825	{	732	{
826	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	733	#define MAP_OUT(k) freezer.put (KW_ ## k, k)
…		…
831	if (name) MAP_OUT (name);	738	if (name) MAP_OUT (name);
832	MAP_OUT (swap_time);	739	MAP_OUT (swap_time);
833	MAP_OUT (reset_time);	740	MAP_OUT (reset_time);
834	MAP_OUT (reset_timeout);	741	MAP_OUT (reset_timeout);
835	MAP_OUT (fixed_resettime);	742	MAP_OUT (fixed_resettime);
		743	MAP_OUT (no_reset);
		744	MAP_OUT (no_drop);
836	MAP_OUT (difficulty);	745	MAP_OUT (difficulty);
837
838	if (default_region) MAP_OUT2 (region, default_region->name);	746	if (default_region) MAP_OUT2 (region, default_region->name);
839		747
840	if (shopitems)	748	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
841	{
842	char shop[MAX_BUF];
843	print_shop_string (this, shop);
844	MAP_OUT2 (shopitems, shop);
845	}
846
847	MAP_OUT (shopgreed);	749	MAP_OUT (shopgreed);
848	MAP_OUT (shopmin);	750	MAP_OUT (shopmin);
849	MAP_OUT (shopmax);	751	MAP_OUT (shopmax);
850	if (shoprace) MAP_OUT (shoprace);	752	if (shoprace) MAP_OUT (shoprace);
		753
851	MAP_OUT (darkness);	754	MAP_OUT (darkness);
852	MAP_OUT (width);	755	MAP_OUT (width);
853	MAP_OUT (height);	756	MAP_OUT (height);
854	MAP_OUT (enter_x);	757	MAP_OUT (enter_x);
855	MAP_OUT (enter_y);	758	MAP_OUT (enter_y);
…		…
888	return false;	791	return false;
889		792
890	return freezer.save (path);	793	return freezer.save (path);
891	}	794	}
892		795
		796	//+GPL
		797
893	/*	798	/*
894	* Remove and free all objects in the given map.	799	* Remove and free all objects in the given map.
895	*/	800	*/
896	void	801	void
897	maptile::clear ()	802	maptile::clear ()
898	{	803	{
899	sfree (regions, size ()), regions = 0;
900	free (regionmap), regionmap = 0;
901
902	if (spaces)	804	if (spaces)
903	{	805	{
904	for (mapspace *ms = spaces + size (); ms-- > spaces; )	806	for (mapspace *ms = spaces + size (); ms-- > spaces; )
905	while (object *op = ms->bot)	807	while (object *op = ms->bot)
906	{	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_ ();
907	if (op->head)	816	if (op == head)
908	op = op->head;
909
910	op->destroy_inv (false);
911	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	}
912	}	823	}
913		824
914	sfree (spaces, size ()), spaces = 0;	825	sfree0 (spaces, size ());
915	}	826	}
916		827
917	if (buttons)	828	if (buttons)
918	free_objectlinkpt (buttons), buttons = 0;	829	free_objectlinkpt (buttons), buttons = 0;
		830
		831	sfree0 (regions, size ());
		832	delete [] regionmap; regionmap = 0;
919	}	833	}
920		834
921	void	835	void
922	maptile::clear_header ()	836	maptile::clear_header ()
923	{	837	{
…		…
955	attachable::do_destroy ();	869	attachable::do_destroy ();
956		870
957	clear ();	871	clear ();
958	}	872	}
959		873
960	/*	874	/* decay and destroy perishable items in a map */
961	* Updates every button on the map (by calling update_button() for them).
962	*/
963	void	875	void
964	maptile::update_buttons ()	876	maptile::do_decay_objects ()
965	{	877	{
966	for (oblinkpt *obp = buttons; obp; obp = obp->next)	878	if (!spaces)
967	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)
968	{	883	{
969	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 ())
970	{	900	{
971	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",	901	op->stats.dam--;
972	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)
973	continue;	903	destroy = 1;
974	}	904	}
975		905	else if (op->is_armor ())
976	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
977	{	906	{
978	update_button (ol->ob);	907	op->stats.ac--;
979	break;	908	if (op->stats.ac < 0)
		909	destroy = 1;
980	}	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 ();
981	}	938	}
982	}	939	}
983		940
984	/*	941	/*
985	* 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.
986	* difficulty does not have a lot to do with character level,	943	* difficulty does not have a lot to do with character level,
987	* 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.
988	*	945	*
989	* 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
990	* 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
991	* have a difficulty set than using this function - human calculation	948	* have a difficulty set rather than using this function - human calculation
992	* is much better than this functions guesswork.	949	* is much better than this function's guesswork.
993	*/	950	*/
994	int	951	int
995	maptile::estimate_difficulty () const	952	maptile::estimate_difficulty () const
996	{	953	{
997	long monster_cnt = 0;	954	long monster_cnt = 0;
…		…
1009		966
1010	if (QUERY_FLAG (op, FLAG_GENERATOR))	967	if (QUERY_FLAG (op, FLAG_GENERATOR))
1011	{	968	{
1012	total_exp += op->stats.exp;	969	total_exp += op->stats.exp;
1013		970
1014	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	971	if (archetype *at = op->other_arch)
		972	{
1015	total_exp += at->clone.stats.exp * 8;	973	total_exp += at->stats.exp * 8;
1016
1017	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	}
1018	}	982	}
1019	}	983	}
1020		984
1021	avgexp = (double) total_exp / monster_cnt;	985	avgexp = (double) total_exp / monster_cnt;
1022		986
…		…
1035	* postive values make it darker, negative make it brighter	999	* postive values make it darker, negative make it brighter
1036	*/	1000	*/
1037	int	1001	int
1038	maptile::change_map_light (int change)	1002	maptile::change_map_light (int change)
1039	{	1003	{
1040	int new_level = darkness + change;
1041
1042	/* Nothing to do */	1004	/* Nothing to do */
1043	if (!change \|\| (new_level <= 0 && darkness == 0) \|\| (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	1005	if (!change)
1044	return 0;	1006	return 0;
1045		1007
1046	/* inform all players on the map */	1008	/* inform all players on the map */
1047	if (change > 0)	1009	if (change > 0)
1048	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");	1010	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");
1049	else	1011	else
1050	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");	1012	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");
1051		1013
1052	/* Do extra checking. since darkness is a unsigned value,	1014	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1053	* we need to be extra careful about negative values.
1054	* In general, the checks below are only needed if change
1055	* is not +/-1
1056	*/
1057	if (new_level < 0)
1058	darkness = 0;
1059	else if (new_level >= MAX_DARKNESS)
1060	darkness = MAX_DARKNESS;
1061	else
1062	darkness = new_level;
1063		1015
1064	/* All clients need to get re-updated for the change */	1016	/* All clients need to get re-updated for the change */
1065	update_all_map_los (this);	1017	update_all_map_los (this);
		1018
1066	return 1;	1019	return 1;
1067	}	1020	}
1068		1021
1069	/*	1022	/*
1070	* This function updates various attributes about a specific space	1023	* This function updates various attributes about a specific space
…		…
1073	* through, etc)	1026	* through, etc)
1074	*/	1027	*/
1075	void	1028	void
1076	mapspace::update_ ()	1029	mapspace::update_ ()
1077	{	1030	{
1078	object tmp, last = 0;	1031	object *last = 0;
1079	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1032	uint8 flags = P_UPTODATE;
1080	facetile top, floor, *middle;	1033	sint8 light = 0;
1081	object top_obj, floor_obj, *middle_obj;
1082	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;
1083		1038
1084	middle = blank_face;	1039	//object *middle = 0;
1085	top = blank_face;	1040	//object *top = 0;
1086	floor = blank_face;	1041	//object *floor = 0;
		1042	// this seems to generate better code than using locals, above
		1043	object *&top = faces_obj[0] = 0;
		1044	object *&middle = faces_obj[1] = 0;
		1045	object *&floor = faces_obj[2] = 0;
1087		1046
1088	middle_obj = 0;	1047	object::flags_t allflags; // all flags of all objects or'ed together
1089	top_obj = 0;
1090	floor_obj = 0;
1091		1048
1092	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1049	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1093	{	1050	{
1094	/* This could be made additive I guess (two lights better than	1051	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1095	* one). But if so, it shouldn't be a simple additive - 2
1096	* light bulbs do not illuminate twice as far as once since
1097	* it is a dissapation factor that is cubed.
1098	*/
1099	if (tmp->glow_radius > light)
1100	light = tmp->glow_radius;	1052	light += tmp->glow_radius;
1101		1053
1102	/* This call is needed in order to update objects the player	1054	/* This call is needed in order to update objects the player
1103	* is standing in that have animations (ie, grass, fire, etc).	1055	* is standing in that have animations (ie, grass, fire, etc).
1104	* However, it also causes the look window to be re-drawn	1056	* However, it also causes the look window to be re-drawn
1105	* 3 times each time the player moves, because many of the	1057	* 3 times each time the player moves, because many of the
1106	* functions the move_player calls eventualy call this.	1058	* functions the move_player calls eventualy call this.
1107	*	1059	*
1108	* Always put the player down for drawing.	1060	* Always put the player down for drawing.
1109	*/	1061	*/
1110	if (!tmp->invisible)	1062	if (expect_true (!tmp->invisible))
1111	{	1063	{
1112	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))	1064	if (tmp->type == PLAYER \|\| tmp->flag [FLAG_MONSTER])
		1065	top = tmp;
		1066	else
1113	{	1067	{
1114	top = tmp->face;	1068	if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
		1069	{
		1070	/* If we got a floor, that means middle and top were below it,
		1071	* so should not be visible, so we clear them.
		1072	*/
		1073	middle = 0;
		1074	top = 0;
1115	top_obj = tmp;	1075	floor = tmp;
		1076	volume = 0;
		1077	items = 0;
		1078	}
		1079	else
		1080	{
		1081	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1082	{
		1083	++items;
		1084	volume += tmp->volume ();
		1085	}
		1086
		1087	/* Flag anywhere have high priority */
		1088	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
		1089	anywhere = tmp;
		1090	/* Find the highest visible face around. If equal
		1091	* visibilities, we still want the one nearer to the
		1092	* top
		1093	*/
		1094	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility))
		1095	middle = tmp;
		1096	}
1116	}	1097	}
1117	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1118	{
1119	/* If we got a floor, that means middle and top were below it,
1120	* so should not be visible, so we clear them.
1121	*/
1122	middle = blank_face;
1123	top = blank_face;
1124	floor = tmp->face;
1125	floor_obj = tmp;
1126	}
1127	/* Flag anywhere have high priority */
1128	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1129	{
1130	middle = tmp->face;
1131
1132	middle_obj = tmp;
1133	anywhere = 1;
1134	}
1135	/* Find the highest visible face around. If equal
1136	* visibilities, we still want the one nearer to the
1137	* top
1138	*/
1139	else if (middle == blank_face \|\| (tmp->face->visibility > middle->visibility && !anywhere))
1140	{
1141	middle = tmp->face;
1142	middle_obj = tmp;
1143	}
1144	}
1145
1146	if (tmp == tmp->above)
1147	{
1148	LOG (llevError, "Error in structure of map\n");
1149	exit (-1);
1150	}	1098	}
1151		1099
1152	move_slow \|= tmp->move_slow;	1100	move_slow \|= tmp->move_slow;
1153	move_block \|= tmp->move_block;	1101	move_block \|= tmp->move_block;
1154	move_on \|= tmp->move_on;	1102	move_on \|= tmp->move_on;
1155	move_off \|= tmp->move_off;	1103	move_off \|= tmp->move_off;
1156	move_allow \|= tmp->move_allow;	1104	move_allow \|= tmp->move_allow;
1157		1105
1158	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags \|= P_BLOCKSVIEW;	1106	allflags \|= tmp->flag;
1159	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags \|= P_NO_MAGIC;	1107
1160	if (tmp->type == PLAYER) flags \|= P_PLAYER;	1108	if (tmp->type == PLAYER) flags \|= P_PLAYER;
1161	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1109	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1162	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1163	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1164	}	1110	}
1165		1111
1166	this->light = light;	1112	// FLAG_SEE_ANYWHERE takes precedence
		1113	if (anywhere)
		1114	middle = anywhere;
		1115
		1116	// ORing all flags together and checking them here is much faster
		1117	if (allflags [FLAG_BLOCKSVIEW]) flags \|= P_BLOCKSVIEW;
		1118	if (allflags [FLAG_NO_MAGIC] ) flags \|= P_NO_MAGIC;
		1119	if (allflags [FLAG_ALIVE] ) flags \|= P_IS_ALIVE;
		1120	if (allflags [FLAG_DAMNED] ) flags \|= P_NO_CLERIC;
		1121
		1122	this->light = min (light, MAX_LIGHT_RADIUS);
1167	this->flags_ = flags;	1123	this->flags_ = flags;
1168	this->move_block = move_block & ~move_allow;	1124	this->move_block = move_block & ~move_allow;
1169	this->move_on = move_on;	1125	this->move_on = move_on;
1170	this->move_off = move_off;	1126	this->move_off = move_off;
1171	this->move_slow = move_slow;	1127	this->move_slow = move_slow;
		1128	this->volume_ = (volume + 1023) / 1024;
		1129	this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1172		1130
1173	/* At this point, we have a floor face (if there is a floor),	1131	/* At this point, we have a floor face (if there is a floor),
1174	* and the floor is set - we are not going to touch it at	1132	* and the floor is set - we are not going to touch it at
1175	* this point.	1133	* this point.
1176	* middle contains the highest visibility face.	1134	* middle contains the highest visibility face.
…		…
1183	* middle face. This should not happen, as we already have the	1141	* middle face. This should not happen, as we already have the
1184	* else statement above so middle should not get set. OTOH, it	1142	* else statement above so middle should not get set. OTOH, it
1185	* may be possible for the faces to match but be different objects.	1143	* may be possible for the faces to match but be different objects.
1186	*/	1144	*/
1187	if (top == middle)	1145	if (top == middle)
1188	middle = blank_face;	1146	middle = 0;
1189		1147
1190	/* There are three posibilities at this point:	1148	/* There are three posibilities at this point:
1191	* 1) top face is set, need middle to be set.	1149	* 1) top face is set, need middle to be set.
1192	* 2) middle is set, need to set top.	1150	* 2) middle is set, need to set top.
1193	* 3) neither middle or top is set - need to set both.	1151	* 3) neither middle or top is set - need to set both.
1194	*/	1152	*/
1195		1153
1196	for (tmp = last; tmp; tmp = tmp->below)	1154	for (object *tmp = last; tmp; tmp = tmp->below)
1197	{	1155	{
1198	/* Once we get to a floor, stop, since we already have a floor object */	1156	/* Once we get to a floor, stop, since we already have a floor object */
1199	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1157	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1200	break;	1158	break;
1201		1159
1202	/* If two top faces are already set, quit processing */	1160	/* If two top faces are already set, quit processing */
1203	if ((top != blank_face) && (middle != blank_face))	1161	if (top && middle)
1204	break;	1162	break;
1205		1163
1206	/* Only show visible faces */	1164	/* Only show visible faces */
1207	if (!tmp->invisible)	1165	if (!tmp->invisible)
1208	{	1166	{
1209	/* Fill in top if needed */	1167	/* Fill in top if needed */
1210	if (top == blank_face)	1168	if (!top)
1211	{	1169	{
1212	top = tmp->face;
1213	top_obj = tmp;	1170	top = tmp;
1214	if (top == middle)	1171	if (top == middle)
1215	middle = blank_face;	1172	middle = 0;
1216	}	1173	}
1217	else	1174	else
1218	{	1175	{
1219	/* top is already set - we should only get here if	1176	/* top is already set - we should only get here if
1220	* middle is not set	1177	* middle is not set
1221	*	1178	*
1222	* Set the middle face and break out, since there is nothing	1179	* Set the middle face and break out, since there is nothing
1223	* more to fill in. We don't check visiblity here, since	1180	* more to fill in. We don't check visiblity here, since
1224	*	1181	*
1225	*/	1182	*/
1226	if (tmp->face != top)	1183	if (tmp != top)
1227	{	1184	{
1228	middle = tmp->face;
1229	middle_obj = tmp;	1185	middle = tmp;
1230	break;	1186	break;
1231	}	1187	}
1232	}	1188	}
1233	}	1189	}
1234	}	1190	}
1235		1191
1236	if (middle == floor)	1192	if (middle == floor)
1237	middle = blank_face;	1193	middle = 0;
1238		1194
1239	if (top == middle)	1195	if (top == middle)
1240	middle = blank_face;	1196	middle = 0;
1241		1197
1242	faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;	1198	#if 0
1243	faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;	1199	faces_obj [0] = top;
1244	faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;	1200	faces_obj [1] = middle;
		1201	faces_obj [2] = floor;
		1202	#endif
1245	}	1203	}
1246		1204
1247	uint64	1205	maptile *
1248	mapspace::volume () const	1206	maptile::tile_available (int dir, bool load)
1249	{	1207	{
1250	uint64 vol = 0;	1208	if (tile_path[dir])
1251
1252	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1253	vol += op->volume ();
1254
1255	return vol;
1256	}
1257
1258	/* this updates the orig_map->tile_map[tile_num] value after finding
1259	* the map. It also takes care of linking back the freshly found
1260	* maps tile_map values if it tiles back to this one. It returns
1261	* the value of orig_map->tile_map[tile_num].
1262	*/
1263	static inline maptile *
1264	find_and_link (maptile *orig_map, int tile_num)
1265	{
1266	maptile *mp = orig_map->tile_map [tile_num];
1267
1268	if (!mp)
1269	{
1270	mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1271
1272	if (!mp)
1273	{
1274	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1275	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1276	&orig_map->tile_path[tile_num], &orig_map->path);
1277	mp = new maptile (1, 1);
1278	mp->alloc ();
1279	mp->in_memory = MAP_IN_MEMORY;
1280	}
1281	}	1209	{
		1210	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
		1211	return tile_map[dir];
1282		1212
1283	int dest_tile = (tile_num + 2) % 4;	1213	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1214	return tile_map[dir];
		1215	}
1284		1216
1285	orig_map->tile_map [tile_num] = mp;
1286
1287	// optimisation: back-link map to origin map if euclidean
1288	//TODO: non-euclidean maps MUST GO
1289	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1290	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1291
1292	return mp;	1217	return 0;
1293	}
1294
1295	static inline void
1296	load_and_link (maptile *orig_map, int tile_num)
1297	{
1298	find_and_link (orig_map, tile_num)->load_sync ();
1299	}	1218	}
1300		1219
1301	/* this returns TRUE if the coordinates (x,y) are out of	1220	/* this returns TRUE if the coordinates (x,y) are out of
1302	* map m. This function also takes into account any	1221	* map m. This function also takes into account any
1303	* tiling considerations, loading adjacant maps as needed.	1222	* tiling considerations, loading adjacant maps as needed.
…		…
1316	if (!m)	1235	if (!m)
1317	return 0;	1236	return 0;
1318		1237
1319	if (x < 0)	1238	if (x < 0)
1320	{	1239	{
1321	if (!m->tile_path[3])	1240	if (!m->tile_available (3))
1322	return 1;	1241	return 1;
1323		1242
1324	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1325	find_and_link (m, 3);
1326
1327	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1243	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1328	}	1244	}
1329		1245
1330	if (x >= m->width)	1246	if (x >= m->width)
1331	{	1247	{
1332	if (!m->tile_path[1])	1248	if (!m->tile_available (1))
1333	return 1;	1249	return 1;
1334		1250
1335	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1336	find_and_link (m, 1);
1337
1338	return out_of_map (m->tile_map[1], x - m->width, y);	1251	return out_of_map (m->tile_map[1], x - m->width, y);
1339	}	1252	}
1340		1253
1341	if (y < 0)	1254	if (y < 0)
1342	{	1255	{
1343	if (!m->tile_path[0])	1256	if (!m->tile_available (0))
1344	return 1;	1257	return 1;
1345		1258
1346	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1347	find_and_link (m, 0);
1348
1349	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1259	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1350	}	1260	}
1351		1261
1352	if (y >= m->height)	1262	if (y >= m->height)
1353	{	1263	{
1354	if (!m->tile_path[2])	1264	if (!m->tile_available (2))
1355	return 1;	1265	return 1;
1356
1357	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1358	find_and_link (m, 2);
1359		1266
1360	return out_of_map (m->tile_map[2], x, y - m->height);	1267	return out_of_map (m->tile_map[2], x, y - m->height);
1361	}	1268	}
1362		1269
1363	/* Simple case - coordinates are within this local	1270	/* Simple case - coordinates are within this local
…		…
1377	maptile *	1284	maptile *
1378	maptile::xy_find (sint16 &x, sint16 &y)	1285	maptile::xy_find (sint16 &x, sint16 &y)
1379	{	1286	{
1380	if (x < 0)	1287	if (x < 0)
1381	{	1288	{
1382	if (!tile_path[3])	1289	if (!tile_available (3))
1383	return 0;	1290	return 0;
1384		1291
1385	find_and_link (this, 3);
1386	x += tile_map[3]->width;	1292	x += tile_map[3]->width;
1387	return tile_map[3]->xy_find (x, y);	1293	return tile_map[3]->xy_find (x, y);
1388	}	1294	}
1389		1295
1390	if (x >= width)	1296	if (x >= width)
1391	{	1297	{
1392	if (!tile_path[1])	1298	if (!tile_available (1))
1393	return 0;	1299	return 0;
1394		1300
1395	find_and_link (this, 1);
1396	x -= width;	1301	x -= width;
1397	return tile_map[1]->xy_find (x, y);	1302	return tile_map[1]->xy_find (x, y);
1398	}	1303	}
1399		1304
1400	if (y < 0)	1305	if (y < 0)
1401	{	1306	{
1402	if (!tile_path[0])	1307	if (!tile_available (0))
1403	return 0;	1308	return 0;
1404		1309
1405	find_and_link (this, 0);
1406	y += tile_map[0]->height;	1310	y += tile_map[0]->height;
1407	return tile_map[0]->xy_find (x, y);	1311	return tile_map[0]->xy_find (x, y);
1408	}	1312	}
1409		1313
1410	if (y >= height)	1314	if (y >= height)
1411	{	1315	{
1412	if (!tile_path[2])	1316	if (!tile_available (2))
1413	return 0;	1317	return 0;
1414		1318
1415	find_and_link (this, 2);
1416	y -= height;	1319	y -= height;
1417	return tile_map[2]->xy_find (x, y);	1320	return tile_map[2]->xy_find (x, y);
1418	}	1321	}
1419		1322
1420	/* Simple case - coordinates are within this local	1323	/* Simple case - coordinates are within this local
…		…
1431	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1334	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1432	{	1335	{
1433	if (!map1 \|\| !map2)	1336	if (!map1 \|\| !map2)
1434	return 0;	1337	return 0;
1435		1338
1436	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1339	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1437	//fix: compare paths instead (this is likely faster, too!)	1340	//fix: compare paths instead (this is likely faster, too!)
1438	if (map1 == map2)	1341	if (map1 == map2)
1439	{	1342	{
1440	*dx = 0;	1343	*dx = 0;
1441	*dy = 0;	1344	*dy = 0;
…		…
1623	else	1526	else
1624	{	1527	{
1625	retval->distance_x += op2->x - x;	1528	retval->distance_x += op2->x - x;
1626	retval->distance_y += op2->y - y;	1529	retval->distance_y += op2->y - y;
1627		1530
1628	retval->part = NULL;	1531	retval->part = 0;
1629	retval->distance = idistance (retval->distance_x, retval->distance_y);	1532	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1630	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1533	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1631	}	1534	}
1632	}	1535	}
1633		1536
1634	/* Returns true of op1 and op2 are effectively on the same map	1537	/* Returns true of op1 and op2 are effectively on the same map
…		…
1645	int dx, dy;	1548	int dx, dy;
1646		1549
1647	return adjacent_map (op1->map, op2->map, &dx, &dy);	1550	return adjacent_map (op1->map, op2->map, &dx, &dy);
1648	}	1551	}
1649		1552
		1553	//-GPL
		1554
1650	object *	1555	object *
1651	maptile::insert (object op, int x, int y, object originator, int flags)	1556	maptile::insert (object op, int x, int y, object originator, int flags)
1652	{	1557	{
1653	if (!op->flag [FLAG_REMOVED])
1654	op->remove ();
1655
1656	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1558	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1657	}	1559	}
1658		1560
1659	region *	1561	region *
1660	maptile::region (int x, int y) const	1562	maptile::region (int x, int y) const
…		…
1669	return default_region;	1571	return default_region;
1670		1572
1671	return ::region::default_region ();	1573	return ::region::default_region ();
1672	}	1574	}
1673		1575
		1576	//+GPL
1674		1577
		1578	/* picks a random object from a style map.
		1579	*/
		1580	object *
		1581	maptile::pick_random_object (rand_gen &gen) const
		1582	{
		1583	/* while returning a null object will result in a crash, that
		1584	* is actually preferable to an infinite loop. That is because
		1585	* most servers will automatically restart in case of crash.
		1586	* Change the logic on getting the random space - shouldn't make
		1587	* any difference, but this seems clearer to me.
		1588	*/
		1589	for (int i = 1000; --i;)
		1590	{
		1591	object *pick = at (gen (width), gen (height)).bot;
		1592
		1593	// do not prefer big monsters just because they are big.
		1594	if (pick && pick->is_head ())
		1595	return pick->head_ ();
		1596	}
		1597
		1598	// instead of crashing in the unlikely(?) case, try to return something
		1599	return archetype::find (shstr_bug);
		1600	}
		1601
		1602	//-GPL
		1603
		1604	void
		1605	maptile::play_sound (faceidx sound, int x, int y) const
		1606	{
		1607	if (!sound)
		1608	return;
		1609
		1610	for_all_players_on_map (pl, this)
		1611	if (client *ns = pl->ns)
		1612	{
		1613	int dx = x - pl->ob->x;
		1614	int dy = y - pl->ob->y;
		1615
		1616	int distance = idistance (dx, dy);
		1617
		1618	if (distance <= MAX_SOUND_DISTANCE)
		1619	ns->play_sound (sound, dx, dy);
		1620	}
		1621	}
		1622
		1623	void
		1624	maptile::say_msg (const char *msg, int x, int y) const
		1625	{
		1626	for_all_players (pl)
		1627	if (client *ns = pl->ns)
		1628	{
		1629	int dx = x - pl->ob->x;
		1630	int dy = y - pl->ob->y;
		1631
		1632	int distance = idistance (dx, dy);
		1633
		1634	if (distance <= MAX_SOUND_DISTANCE)
		1635	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
		1636	}
		1637	}
		1638
		1639	static void
		1640	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1641	{
		1642	// clip to map to the left
		1643	if (x0 < 0)
		1644	{
		1645	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1646	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1647
		1648	if (x1 < 0) // entirely to the left
		1649	return;
		1650
		1651	x0 = 0;
		1652	}
		1653
		1654	// clip to map to the right
		1655	if (x1 > m->width)
		1656	{
		1657	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1658	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1659
		1660	if (x0 > m->width) // entirely to the right
		1661	return;
		1662
		1663	x1 = m->width;
		1664	}
		1665
		1666	// clip to map above
		1667	if (y0 < 0)
		1668	{
		1669	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1670	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1671
		1672	if (y1 < 0) // entirely above
		1673	return;
		1674
		1675	y0 = 0;
		1676	}
		1677
		1678	// clip to map below
		1679	if (y1 > m->height)
		1680	{
		1681	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1682	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1683
		1684	if (y0 > m->height) // entirely below
		1685	return;
		1686
		1687	y1 = m->height;
		1688	}
		1689
		1690	// if we get here, the rect is within the current map
		1691	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1692
		1693	r->m = m;
		1694	r->x0 = x0;
		1695	r->y0 = y0;
		1696	r->x1 = x1;
		1697	r->y1 = y1;
		1698	r->dx = dx;
		1699	r->dy = dy;
		1700	}
		1701
		1702	maprect *
		1703	maptile::split_to_tiles (int x0, int y0, int x1, int y1)
		1704	{
		1705	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
		1706	buf.clear ();
		1707
		1708	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1709
		1710	// add end marker
		1711	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1712	r->m = 0;
		1713
		1714	return (maprect *)buf.linearise ();
		1715	}
		1716

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.90 by root, Fri Feb 16 22:21:46 2007 UTC vs. Revision 1.173 by root, Mon Nov 9 18:47:56 2009 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.90 by root, Fri Feb 16 22:21:46 2007 UTC vs.
Revision 1.173 by root, Mon Nov 9 18:47:56 2009 UTC