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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.100 by root, Tue Apr 17 10:06:32 2007 UTC vs.
Revision 1.176 by root, Tue Nov 10 05:11:05 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	//-GPL
308	* into inventory, but just links them. What this does is go through
309	* and insert them properly.
310	* The object 'container' is the object that contains the inventory.
311	* This is needed so that we can update the containers weight.
312	*/
313	void
314	fix_container (object *container)
315	{
316	object tmp = container->inv, next;
317
318	container->inv = 0;
319	while (tmp)
320	{
321	next = tmp->below;
322	if (tmp->inv)
323	fix_container (tmp);
324
325	insert_ob_in_ob (tmp, container);
326	tmp = next;
327	}
328
329	/* sum_weight will go through and calculate what all the containers are
330	* carrying.
331	*/
332	sum_weight (container);
333	}
334		223
335	void	224	void
336	maptile::set_object_flag (int flag, int value)	225	maptile::set_object_flag (int flag, int value)
337	{	226	{
338	if (!spaces)	227	if (!spaces)
…		…
340		229
341	for (mapspace *ms = spaces + size (); ms-- > spaces; )	230	for (mapspace *ms = spaces + size (); ms-- > spaces; )
342	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	231	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
343	tmp->flag [flag] = value;	232	tmp->flag [flag] = value;
344	}	233	}
		234
		235	void
		236	maptile::post_load_original ()
		237	{
		238	if (!spaces)
		239	return;
		240
		241	set_object_flag (FLAG_OBJ_ORIGINAL);
		242
		243	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		244	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		245	INVOKE_OBJECT (RESET, tmp);
		246	}
		247
		248	void
		249	maptile::post_load ()
		250	{
		251	#if 0
		252	if (!spaces)
		253	return;
		254
		255	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		256	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		257	; // nop
		258	#endif
		259	}
		260
		261	//+GPL
345		262
346	/* link_multipart_objects go through all the objects on the map looking	263	/* 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	264	* 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	265	* info we have, they only have the head (as would be expected when
349	* they are saved).	266	* they are saved).
…		…
353	{	270	{
354	if (!spaces)	271	if (!spaces)
355	return;	272	return;
356		273
357	for (mapspace *ms = spaces + size (); ms-- > spaces; )	274	for (mapspace *ms = spaces + size (); ms-- > spaces; )
358	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	275	{
		276	object *op = ms->bot;
		277	while (op)
359	{	278	{
360	/* already multipart - don't do anything more */	279	/* already multipart - don't do anything more */
361	if (!tmp->head && !tmp->more)	280	if (op->head_ () == op && !op->more && op->arch->more)
362	{
363	/* If there is nothing more to this object, this for loop
364	* won't do anything.
365	*/
366	archetype *at;
367	object last, op;
368	for (at = tmp->arch->more, last = tmp;
369	at;
370	at = at->more, last = op)
371	{	281	{
372	op = arch_to_object (at);	282	op->remove ();
		283	op->expand_tail ();
373		284
374	/* update x,y coordinates */	285	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
375	op->x += tmp->x;	286	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
376	op->y += tmp->y;	287	// below the pentagrams... hopefully INS_ON_TOP doesn't break anything
377	op->head = tmp;
378	op->map = this;
379	last->more = op;
380	op->name = tmp->name;
381	op->title = tmp->title;
382
383	/* we could link all the parts onto tmp, and then just
384	* call insert_ob_in_map once, but the effect is the same,
385	* as insert_ob_in_map will call itself with each part, and
386	* the coding is simpler to just to it here with each part.
387	*/
388	insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE \| INS_ABOVE_FLOOR_ONLY \| INS_NO_WALK_ON);	288	insert (op, op->x, op->y, 0, INS_NO_MERGE \| INS_ON_TOP \| INS_NO_WALK_ON);
		289
		290	op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
		291	// so we have to reset the iteration through the mapspace
389	}	292	}
		293	else
		294	op = op->above;
390	}	295	}
391	}	296	}
392	}	297	}
		298
		299	//-GPL
393		300
394	/*	301	/*
395	* Loads (ands parses) the objects into a given map from the specified	302	* Loads (ands parses) the objects into a given map from the specified
396	* file pointer.	303	* file pointer.
397	*/	304	*/
398	bool	305	bool
399	maptile::_load_objects (object_thawer &f)	306	maptile::_load_objects (object_thawer &f)
400	{	307	{
401	for (;;)	308	for (;;)
402	{	309	{
403	coroapi::cede_to_tick_every (100); // cede once in a while	310	coroapi::cede_to_tick (); // cede once in a while
404		311
405	switch (f.kw)	312	switch (f.kw)
406	{	313	{
407	case KW_arch:	314	case KW_arch:
408	if (object *op = object::read (f, this))	315	if (object *op = object::read (f, this))
409	{	316	{
		317	// TODO: why?
410	if (op->inv)	318	if (op->inv)
411	sum_weight (op);	319	op->update_weight ();
412		320
413	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ON_TOP \| INS_MAP_LOAD);	321	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
		322	{
		323	// we insert manually because
		324	// a) its way faster
		325	// b) we remove manually, too, and there are good reasons for that
		326	// c) it's correct
		327	mapspace &ms = at (op->x, op->y);
		328
		329	op->flag [FLAG_REMOVED] = false;
		330
		331	op->above = 0;
		332	op->below = ms.top;
		333
		334	*(ms.top ? &ms.top->above : &ms.bot) = op;
		335
		336	ms.top = op;
		337	ms.flags_ = 0;
		338	}
		339	else
		340	{
		341	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		342	op->destroy ();
		343	}
414	}	344	}
415		345
416	continue;	346	continue;
417		347
418	case KW_EOF:	348	case KW_EOF:
…		…
431	}	361	}
432		362
433	void	363	void
434	maptile::activate ()	364	maptile::activate ()
435	{	365	{
436	if (!spaces)	366	if (spaces)
437	return;
438
439	for (mapspace *ms = spaces + size (); ms-- > spaces; )	367	for (mapspace *ms = spaces + size (); ms-- > spaces; )
440	for (object *op = ms->bot; op; op = op->above)	368	for (object *op = ms->bot; op; op = op->above)
441	op->activate_recursive ();	369	op->activate_recursive ();
442	}	370	}
443		371
444	void	372	void
445	maptile::deactivate ()	373	maptile::deactivate ()
446	{	374	{
447	if (!spaces)	375	if (spaces)
448	return;
449
450	for (mapspace *ms = spaces + size (); ms-- > spaces; )	376	for (mapspace *ms = spaces + size (); ms-- > spaces; )
451	for (object *op = ms->bot; op; op = op->above)	377	for (object *op = ms->bot; op; op = op->above)
452	op->deactivate_recursive ();	378	op->deactivate_recursive ();
453	}	379	}
454		380
455	bool	381	bool
456	maptile::_save_objects (object_freezer &f, int flags)	382	maptile::_save_objects (object_freezer &f, int flags)
457	{	383	{
…		…
463	if (!spaces)	389	if (!spaces)
464	return false;	390	return false;
465		391
466	for (int i = 0; i < size (); ++i)	392	for (int i = 0; i < size (); ++i)
467	{	393	{
468	int unique = 0;	394	bool unique = 0;
		395
469	for (object *op = spaces [i].bot; op; op = op->above)	396	for (object *op = spaces [i].bot; op; op = op->above)
470	{	397	{
471	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	398	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
472	unique = 1;
473		399
474	if (!op->can_map_save ())	400	if (expect_false (!op->can_map_save ()))
475	continue;	401	continue;
476		402
477	if (unique \|\| op->flag [FLAG_UNIQUE])	403	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
478	{	404	{
479	if (flags & IO_UNIQUES)	405	if (flags & IO_UNIQUES)
480	op->write (f);	406	op->write (f);
481	}	407	}
482	else if (flags & IO_OBJECTS)	408	else if (expect_true (flags & IO_OBJECTS))
483	op->write (f);	409	op->write (f);
484	}	410	}
485	}	411	}
486		412
487	coroapi::cede_to_tick ();	413	coroapi::cede_to_tick ();
488		414
489	return true;	415	return true;
490	}
491
492	bool
493	maptile::_load_objects (const char *path, bool skip_header)
494	{
495	object_thawer f (path);
496
497	if (!f)
498	return false;
499
500	f.next ();
501
502	if (skip_header)
503	for (;;)
504	{
505	keyword kw = f.kw;
506	f.skip ();
507	if (kw == KW_end)
508	break;
509	}
510
511	return _load_objects (f);
512	}	416	}
513		417
514	bool	418	bool
515	maptile::_save_objects (const char *path, int flags)	419	maptile::_save_objects (const char *path, int flags)
516	{	420	{
…		…
530	* map archetype. Mimic that behaviour.	434	* map archetype. Mimic that behaviour.
531	*/	435	*/
532	width = 16;	436	width = 16;
533	height = 16;	437	height = 16;
534	timeout = 300;	438	timeout = 300;
535	max_nrof = 1000; // 1000 items of anything	439	max_items = MAX_ITEM_PER_ACTION;
536	max_volume = 2000000; // 2m³	440	max_volume = 2000000; // 2m³
537	}	441	}
538		442
539	maptile::maptile (int w, int h)	443	maptile::maptile (int w, int h)
540	{	444	{
…		…
561	if (spaces)	465	if (spaces)
562	return;	466	return;
563		467
564	spaces = salloc0<mapspace> (size ());	468	spaces = salloc0<mapspace> (size ());
565	}	469	}
		470
		471	//+GPL
566		472
567	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	473	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
568	* corresponding to that string. Memory is allocated for this, it must be freed	474	* corresponding to that string. Memory is allocated for this, it must be freed
569	* at a later date.	475	* at a later date.
570	* Called by parse_map_headers below.	476	* Called by parse_map_headers below.
…		…
647	return items;	553	return items;
648	}	554	}
649		555
650	/* opposite of parse string, this puts the string that was originally fed in to	556	/* opposite of parse string, this puts the string that was originally fed in to
651	* the map (or something equivilent) into output_string. */	557	* the map (or something equivilent) into output_string. */
652	static void	558	static const char *
653	print_shop_string (maptile m, char output_string)	559	print_shop_string (maptile *m)
654	{	560	{
655	int i;	561	static dynbuf_text buf; buf.clear ();
656	char tmp[MAX_BUF];
657		562
658	strcpy (output_string, "");
659	for (i = 0; i < m->shopitems[0].index; i++)	563	for (int i = 0; i < m->shopitems[0].index; i++)
660	{	564	{
661	if (m->shopitems[i].typenum)	565	if (m->shopitems[i].typenum)
662	{	566	{
663	if (m->shopitems[i].strength)	567	if (m->shopitems[i].strength)
664	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	568	buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
665	else	569	else
666	sprintf (tmp, "%s;", m->shopitems[i].name);	570	buf.printf ("%s;", m->shopitems[i].name);
667	}	571	}
668	else	572	else
669	{	573	{
670	if (m->shopitems[i].strength)	574	if (m->shopitems[i].strength)
671	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	575	buf.printf ("*:%d;", m->shopitems[i].strength);
672	else	576	else
673	sprintf (tmp, "*");	577	buf.printf ("*");
674	}	578	}
675
676	strcat (output_string, tmp);
677	}	579	}
		580
		581	return buf;
678	}	582	}
		583
		584	//-GPL
679		585
680	/* This loads the header information of the map. The header	586	/* This loads the header information of the map. The header
681	* contains things like difficulty, size, timeout, etc.	587	* contains things like difficulty, size, timeout, etc.
682	* this used to be stored in the map object, but with the	588	* this used to be stored in the map object, but with the
683	* addition of tiling, fields beyond that easily named in an	589	* addition of tiling, fields beyond that easily named in an
…		…
691	bool	597	bool
692	maptile::_load_header (object_thawer &thawer)	598	maptile::_load_header (object_thawer &thawer)
693	{	599	{
694	for (;;)	600	for (;;)
695	{	601	{
696	keyword kw = thawer.get_kv ();
697
698	switch (kw)	602	switch (thawer.kw)
699	{	603	{
700	case KW_msg:	604	case KW_msg:
701	thawer.get_ml (KW_endmsg, msg);	605	thawer.get_ml (KW_endmsg, msg);
702	break;	606	break;
703		607
…		…
735	case KW_winddir: thawer.get (winddir); break;	639	case KW_winddir: thawer.get (winddir); break;
736	case KW_sky: thawer.get (sky); break;	640	case KW_sky: thawer.get (sky); break;
737		641
738	case KW_per_player: thawer.get (per_player); break;	642	case KW_per_player: thawer.get (per_player); break;
739	case KW_per_party: thawer.get (per_party); break;	643	case KW_per_party: thawer.get (per_party); break;
		644	case KW_no_reset: thawer.get (no_reset); break;
		645	case KW_no_drop: thawer.get (no_drop); break;
740		646
741	case KW_region: default_region = region::find (thawer.get_str ()); break;	647	case KW_region: default_region = region::find (thawer.get_str ()); break;
742	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	648	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
743		649
744	// old names new names	650	// old names new names
…		…
755	case KW_tile_path_1: thawer.get (tile_path [0]); break;	661	case KW_tile_path_1: thawer.get (tile_path [0]); break;
756	case KW_tile_path_2: thawer.get (tile_path [1]); break;	662	case KW_tile_path_2: thawer.get (tile_path [1]); break;
757	case KW_tile_path_3: thawer.get (tile_path [2]); break;	663	case KW_tile_path_3: thawer.get (tile_path [2]); break;
758	case KW_tile_path_4: thawer.get (tile_path [3]); break;	664	case KW_tile_path_4: thawer.get (tile_path [3]); break;
759		665
		666	case KW_ERROR:
		667	set_key_text (thawer.kw_str, thawer.value);
		668	break;
		669
760	case KW_end:	670	case KW_end:
		671	thawer.next ();
761	return true;	672	return true;
762		673
763	default:	674	default:
764	if (!thawer.parse_error ("map", 0))	675	if (!thawer.parse_error ("map", 0))
765	return false;	676	return false;
766	break;	677	break;
767	}	678	}
		679
		680	thawer.next ();
768	}	681	}
769		682
770	abort ();	683	abort ();
771	}	684	}
772		685
773	bool	686	//+GPL
774	maptile::_load_header (const char *path)
775	{
776	object_thawer thawer (path);
777
778	if (!thawer)
779	return false;
780
781	return _load_header (thawer);
782	}
783		687
784	/******************************************************************************	688	/******************************************************************************
785	* This is the start of unique map handling code	689	* This is the start of unique map handling code
786	*****************************************************************************/	690	*****************************************************************************/
787		691
…		…
797	object *above = op->above;	701	object *above = op->above;
798		702
799	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	703	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
800	unique = 1;	704	unique = 1;
801		705
802	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	706	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
803	{
804	op->destroy_inv (false);
805	op->destroy ();	707	op->destroy ();
806	}
807		708
808	op = above;	709	op = above;
809	}	710	}
810	}	711	}
811	}	712	}
		713
		714	//-GPL
812		715
813	bool	716	bool
814	maptile::_save_header (object_freezer &freezer)	717	maptile::_save_header (object_freezer &freezer)
815	{	718	{
816	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	719	#define MAP_OUT(k) freezer.put (KW_ ## k, k)
…		…
821	if (name) MAP_OUT (name);	724	if (name) MAP_OUT (name);
822	MAP_OUT (swap_time);	725	MAP_OUT (swap_time);
823	MAP_OUT (reset_time);	726	MAP_OUT (reset_time);
824	MAP_OUT (reset_timeout);	727	MAP_OUT (reset_timeout);
825	MAP_OUT (fixed_resettime);	728	MAP_OUT (fixed_resettime);
		729	MAP_OUT (no_reset);
		730	MAP_OUT (no_drop);
826	MAP_OUT (difficulty);	731	MAP_OUT (difficulty);
827
828	if (default_region) MAP_OUT2 (region, default_region->name);	732	if (default_region) MAP_OUT2 (region, default_region->name);
829		733
830	if (shopitems)	734	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
831	{
832	char shop[MAX_BUF];
833	print_shop_string (this, shop);
834	MAP_OUT2 (shopitems, shop);
835	}
836
837	MAP_OUT (shopgreed);	735	MAP_OUT (shopgreed);
838	MAP_OUT (shopmin);	736	MAP_OUT (shopmin);
839	MAP_OUT (shopmax);	737	MAP_OUT (shopmax);
840	if (shoprace) MAP_OUT (shoprace);	738	if (shoprace) MAP_OUT (shoprace);
		739
841	MAP_OUT (darkness);	740	MAP_OUT (darkness);
842	MAP_OUT (width);	741	MAP_OUT (width);
843	MAP_OUT (height);	742	MAP_OUT (height);
844	MAP_OUT (enter_x);	743	MAP_OUT (enter_x);
845	MAP_OUT (enter_y);	744	MAP_OUT (enter_y);
…		…
878	return false;	777	return false;
879		778
880	return freezer.save (path);	779	return freezer.save (path);
881	}	780	}
882		781
		782	//+GPL
		783
883	/*	784	/*
884	* Remove and free all objects in the given map.	785	* Remove and free all objects in the given map.
885	*/	786	*/
886	void	787	void
887	maptile::clear ()	788	maptile::clear ()
888	{	789	{
889	sfree (regions, size ()), regions = 0;
890	free (regionmap), regionmap = 0;
891
892	if (spaces)	790	if (spaces)
893	{	791	{
894	for (mapspace *ms = spaces + size (); ms-- > spaces; )	792	for (mapspace *ms = spaces + size (); ms-- > spaces; )
895	while (object *op = ms->bot)	793	while (object *op = ms->bot)
896	{	794	{
		795	// manually remove, as to not trigger anything
		796	if (ms->bot = op->above)
		797	ms->bot->below = 0;
		798
		799	op->flag [FLAG_REMOVED] = true;
		800
		801	object *head = op->head_ ();
897	if (op->head)	802	if (op == head)
898	op = op->head;
899
900	op->destroy_inv (false);
901	op->destroy ();	803	op->destroy ();
		804	else if (head->map != op->map)
		805	{
		806	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		807	head->destroy ();
		808	}
902	}	809	}
903		810
904	sfree (spaces, size ()), spaces = 0;	811	sfree0 (spaces, size ());
905	}	812	}
906		813
907	if (buttons)	814	if (buttons)
908	free_objectlinkpt (buttons), buttons = 0;	815	free_objectlinkpt (buttons), buttons = 0;
		816
		817	sfree0 (regions, size ());
		818	delete [] regionmap; regionmap = 0;
909	}	819	}
910		820
911	void	821	void
912	maptile::clear_header ()	822	maptile::clear_header ()
913	{	823	{
…		…
945	attachable::do_destroy ();	855	attachable::do_destroy ();
946		856
947	clear ();	857	clear ();
948	}	858	}
949		859
950	/*	860	/* decay and destroy perishable items in a map */
951	* Updates every button on the map (by calling update_button() for them).
952	*/
953	void	861	void
954	maptile::update_buttons ()	862	maptile::do_decay_objects ()
955	{	863	{
956	for (oblinkpt *obp = buttons; obp; obp = obp->next)	864	if (!spaces)
957	for (objectlink *ol = obp->link; ol; ol = ol->next)	865	return;
		866
		867	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		868	for (object above, op = ms->bot; op; op = above)
958	{	869	{
959	if (!ol->ob)	870	above = op->above;
		871
		872	bool destroy = 0;
		873
		874	// do not decay anything above unique floor tiles (yet :)
		875	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
		876	break;
		877
		878	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
		879	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
		880	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
		881	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
		882	\|\| QUERY_FLAG (op, FLAG_UNPAID)
		883	\|\| op->is_alive ())
		884	; // do not decay
		885	else if (op->is_weapon ())
960	{	886	{
961	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",	887	op->stats.dam--;
962	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);	888	if (op->stats.dam < 0)
963	continue;	889	destroy = 1;
964	}	890	}
965		891	else if (op->is_armor ())
966	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
967	{	892	{
968	update_button (ol->ob);	893	op->stats.ac--;
969	break;	894	if (op->stats.ac < 0)
		895	destroy = 1;
970	}	896	}
		897	else if (op->type == FOOD)
		898	{
		899	op->stats.food -= rndm (5, 20);
		900	if (op->stats.food < 0)
		901	destroy = 1;
		902	}
		903	else
		904	{
		905	int mat = op->materials;
		906
		907	if (mat & M_PAPER
		908	\|\| mat & M_LEATHER
		909	\|\| mat & M_WOOD
		910	\|\| mat & M_ORGANIC
		911	\|\| mat & M_CLOTH
		912	\|\| mat & M_LIQUID
		913	\|\| (mat & M_IRON && rndm (1, 5) == 1)
		914	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
		915	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
		916	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
		917	\|\| (mat & M_ICE && temp > 32))
		918	destroy = 1;
		919	}
		920
		921	/* adjust overall chance below */
		922	if (destroy && rndm (0, 1))
		923	op->destroy ();
971	}	924	}
972	}	925	}
973		926
974	/*	927	/*
975	* This routine is supposed to find out the difficulty of the map.	928	* This routine is supposed to find out the difficulty of the map.
976	* difficulty does not have a lot to do with character level,	929	* difficulty does not have a lot to do with character level,
977	* but does have a lot to do with treasure on the map.	930	* but does have a lot to do with treasure on the map.
978	*	931	*
979	* Difficulty can now be set by the map creature. If the value stored	932	* Difficulty can now be set by the map creator. If the value stored
980	* in the map is zero, then use this routine. Maps should really	933	* in the map is zero, then use this routine. Maps should really
981	* have a difficulty set than using this function - human calculation	934	* have a difficulty set rather than using this function - human calculation
982	* is much better than this functions guesswork.	935	* is much better than this function's guesswork.
983	*/	936	*/
984	int	937	int
985	maptile::estimate_difficulty () const	938	maptile::estimate_difficulty () const
986	{	939	{
987	long monster_cnt = 0;	940	long monster_cnt = 0;
…		…
999		952
1000	if (QUERY_FLAG (op, FLAG_GENERATOR))	953	if (QUERY_FLAG (op, FLAG_GENERATOR))
1001	{	954	{
1002	total_exp += op->stats.exp;	955	total_exp += op->stats.exp;
1003		956
1004	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	957	if (archetype *at = op->other_arch)
		958	{
1005	total_exp += at->clone.stats.exp * 8;	959	total_exp += at->stats.exp * 8;
1006
1007	monster_cnt++;	960	monster_cnt++;
		961	}
		962
		963	for (object *inv = op->inv; inv; inv = inv->below)
		964	{
		965	total_exp += op->stats.exp * 8;
		966	monster_cnt++;
		967	}
1008	}	968	}
1009	}	969	}
1010		970
1011	avgexp = (double) total_exp / monster_cnt;	971	avgexp = (double) total_exp / monster_cnt;
1012		972
…		…
1025	* postive values make it darker, negative make it brighter	985	* postive values make it darker, negative make it brighter
1026	*/	986	*/
1027	int	987	int
1028	maptile::change_map_light (int change)	988	maptile::change_map_light (int change)
1029	{	989	{
1030	int new_level = darkness + change;
1031
1032	/* Nothing to do */	990	/* Nothing to do */
1033	if (!change \|\| (new_level <= 0 && darkness == 0) \|\| (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	991	if (!change)
1034	return 0;	992	return 0;
1035		993
1036	/* inform all players on the map */	994	/* inform all players on the map */
1037	if (change > 0)	995	if (change > 0)
1038	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");	996	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");
1039	else	997	else
1040	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");	998	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");
1041		999
1042	/* Do extra checking. since darkness is a unsigned value,	1000	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1043	* we need to be extra careful about negative values.
1044	* In general, the checks below are only needed if change
1045	* is not +/-1
1046	*/
1047	if (new_level < 0)
1048	darkness = 0;
1049	else if (new_level >= MAX_DARKNESS)
1050	darkness = MAX_DARKNESS;
1051	else
1052	darkness = new_level;
1053		1001
1054	/* All clients need to get re-updated for the change */	1002	/* All clients need to get re-updated for the change */
1055	update_all_map_los (this);	1003	update_all_map_los (this);
		1004
1056	return 1;	1005	return 1;
1057	}	1006	}
1058		1007
1059	/*	1008	/*
1060	* This function updates various attributes about a specific space	1009	* This function updates various attributes about a specific space
…		…
1063	* through, etc)	1012	* through, etc)
1064	*/	1013	*/
1065	void	1014	void
1066	mapspace::update_ ()	1015	mapspace::update_ ()
1067	{	1016	{
1068	object tmp, last = 0;	1017	object *last = 0;
1069	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1018	uint8 flags = P_UPTODATE;
		1019	sint8 light = 0;
1070	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1020	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
		1021	uint64_t volume = 0;
		1022	uint32_t items = 0;
		1023	object *anywhere = 0;
		1024	uint8_t middle_visibility = 0;
1071		1025
1072	//object *middle = 0;	1026	//object *middle = 0;
1073	//object *top = 0;	1027	//object *top = 0;
1074	//object *floor = 0;	1028	//object *floor = 0;
1075	// this seems to generate better code than using locals, above	1029	// this seems to generate better code than using locals, above
1076	object *&top = faces_obj[0] = 0;	1030	object *&top = faces_obj[0] = 0;
1077	object *&middle = faces_obj[1] = 0;	1031	object *&middle = faces_obj[1] = 0;
1078	object *&floor = faces_obj[2] = 0;	1032	object *&floor = faces_obj[2] = 0;
1079		1033
		1034	object::flags_t allflags; // all flags of all objects or'ed together
		1035
1080	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1036	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1081	{	1037	{
1082	/* This could be made additive I guess (two lights better than	1038	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1083	* one). But if so, it shouldn't be a simple additive - 2
1084	* light bulbs do not illuminate twice as far as once since
1085	* it is a dissapation factor that is cubed.
1086	*/
1087	if (tmp->glow_radius > light)
1088	light = tmp->glow_radius;	1039	light += tmp->glow_radius;
1089		1040
1090	/* This call is needed in order to update objects the player	1041	/* This call is needed in order to update objects the player
1091	* is standing in that have animations (ie, grass, fire, etc).	1042	* is standing in that have animations (ie, grass, fire, etc).
1092	* However, it also causes the look window to be re-drawn	1043	* However, it also causes the look window to be re-drawn
1093	* 3 times each time the player moves, because many of the	1044	* 3 times each time the player moves, because many of the
1094	* functions the move_player calls eventualy call this.	1045	* functions the move_player calls eventualy call this.
1095	*	1046	*
1096	* Always put the player down for drawing.	1047	* Always put the player down for drawing.
1097	*/	1048	*/
1098	if (!tmp->invisible)	1049	if (expect_true (!tmp->invisible))
1099	{	1050	{
1100	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))	1051	if (expect_false (tmp->type == PLAYER \|\| tmp->flag [FLAG_MONSTER]))
1101	top = tmp;	1052	top = tmp;
1102	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1053	else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1103	{	1054	{
1104	/* If we got a floor, that means middle and top were below it,	1055	/* If we got a floor, that means middle and top were below it,
1105	* so should not be visible, so we clear them.	1056	* so should not be visible, so we clear them.
1106	*/	1057	*/
1107	middle = 0;	1058	middle = 0;
1108	top = 0;	1059	top = 0;
1109	floor = tmp;	1060	floor = tmp;
		1061	volume = 0;
		1062	items = 0;
1110	}	1063	}
1111	/* Flag anywhere have high priority */	1064	else
1112	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1113	{	1065	{
		1066	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1067	{
		1068	++items;
		1069	volume += tmp->volume ();
		1070	}
		1071
		1072	/* Flag anywhere have high priority */
		1073	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
		1074	anywhere = tmp;
		1075
		1076	/* Find the highest visible face around. If equal
		1077	* visibilities, we still want the one nearer to the
		1078	* top
		1079	*/
		1080	if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
		1081	{
		1082	middle_visibility = ::faces [tmp->face].visibility;
1114	middle = tmp;	1083	middle = tmp;
1115	anywhere = 1;	1084	}
1116	}	1085	}
1117	/* Find the highest visible face around. If equal
1118	* visibilities, we still want the one nearer to the
1119	* top
1120	*/
1121	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1122	middle = tmp;
1123	}
1124
1125	if (tmp == tmp->above)
1126	{
1127	LOG (llevError, "Error in structure of map\n");
1128	exit (-1);
1129	}	1086	}
1130		1087
1131	move_slow \|= tmp->move_slow;	1088	move_slow \|= tmp->move_slow;
1132	move_block \|= tmp->move_block;	1089	move_block \|= tmp->move_block;
1133	move_on \|= tmp->move_on;	1090	move_on \|= tmp->move_on;
1134	move_off \|= tmp->move_off;	1091	move_off \|= tmp->move_off;
1135	move_allow \|= tmp->move_allow;	1092	move_allow \|= tmp->move_allow;
1136		1093
1137	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags \|= P_BLOCKSVIEW;	1094	allflags \|= tmp->flag;
1138	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags \|= P_NO_MAGIC;	1095
1139	if (tmp->type == PLAYER) flags \|= P_PLAYER;	1096	if (tmp->type == PLAYER) flags \|= P_PLAYER;
1140	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1097	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1141	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1142	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1143	}	1098	}
1144		1099
1145	this->light = light;	1100	// FLAG_SEE_ANYWHERE takes precedence
		1101	if (anywhere)
		1102	middle = anywhere;
		1103
		1104	// ORing all flags together and checking them here is much faster
		1105	if (allflags [FLAG_BLOCKSVIEW]) flags \|= P_BLOCKSVIEW;
		1106	if (allflags [FLAG_NO_MAGIC] ) flags \|= P_NO_MAGIC;
		1107	if (allflags [FLAG_ALIVE] ) flags \|= P_IS_ALIVE;
		1108	if (allflags [FLAG_DAMNED] ) flags \|= P_NO_CLERIC;
		1109
		1110	this->light = min (light, MAX_LIGHT_RADIUS);
1146	this->flags_ = flags;	1111	this->flags_ = flags;
1147	this->move_block = move_block & ~move_allow;	1112	this->move_block = move_block & ~move_allow;
1148	this->move_on = move_on;	1113	this->move_on = move_on;
1149	this->move_off = move_off;	1114	this->move_off = move_off;
1150	this->move_slow = move_slow;	1115	this->move_slow = move_slow;
		1116	this->volume_ = (volume + 1023) / 1024;
		1117	this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1151		1118
1152	/* At this point, we have a floor face (if there is a floor),	1119	/* At this point, we have a floor face (if there is a floor),
1153	* and the floor is set - we are not going to touch it at	1120	* and the floor is set - we are not going to touch it at
1154	* this point.	1121	* this point.
1155	* middle contains the highest visibility face.	1122	* middle contains the highest visibility face.
…		…
1170	* 1) top face is set, need middle to be set.	1137	* 1) top face is set, need middle to be set.
1171	* 2) middle is set, need to set top.	1138	* 2) middle is set, need to set top.
1172	* 3) neither middle or top is set - need to set both.	1139	* 3) neither middle or top is set - need to set both.
1173	*/	1140	*/
1174		1141
1175	for (tmp = last; tmp; tmp = tmp->below)	1142	for (object *tmp = last; tmp; tmp = tmp->below)
1176	{	1143	{
1177	/* Once we get to a floor, stop, since we already have a floor object */	1144	/* Once we get to a floor, stop, since we already have a floor object */
1178	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1145	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1179	break;	1146	break;
1180		1147
…		…
1221	faces_obj [1] = middle;	1188	faces_obj [1] = middle;
1222	faces_obj [2] = floor;	1189	faces_obj [2] = floor;
1223	#endif	1190	#endif
1224	}	1191	}
1225		1192
1226	uint64	1193	maptile *
1227	mapspace::volume () const	1194	maptile::tile_available (int dir, bool load)
1228	{	1195	{
1229	uint64 vol = 0;	1196	if (tile_path[dir])
1230
1231	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1232	vol += op->volume ();
1233
1234	return vol;
1235	}
1236
1237	/* this updates the orig_map->tile_map[tile_num] value after finding
1238	* the map. It also takes care of linking back the freshly found
1239	* maps tile_map values if it tiles back to this one. It returns
1240	* the value of orig_map->tile_map[tile_num].
1241	*/
1242	static inline maptile *
1243	find_and_link (maptile *orig_map, int tile_num)
1244	{
1245	maptile *mp = orig_map->tile_map [tile_num];
1246
1247	if (!mp)
1248	{
1249	mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1250
1251	if (!mp)
1252	{
1253	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1254	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1255	&orig_map->tile_path[tile_num], &orig_map->path);
1256	mp = new maptile (1, 1);
1257	mp->alloc ();
1258	mp->in_memory = MAP_IN_MEMORY;
1259	}
1260	}	1197	{
		1198	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
		1199	return tile_map[dir];
1261		1200
1262	int dest_tile = (tile_num + 2) % 4;	1201	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1202	return tile_map[dir];
		1203	}
1263		1204
1264	orig_map->tile_map [tile_num] = mp;
1265
1266	// optimisation: back-link map to origin map if euclidean
1267	//TODO: non-euclidean maps MUST GO
1268	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1269	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1270
1271	return mp;	1205	return 0;
1272	}
1273
1274	static inline void
1275	load_and_link (maptile *orig_map, int tile_num)
1276	{
1277	find_and_link (orig_map, tile_num)->load_sync ();
1278	}	1206	}
1279		1207
1280	/* this returns TRUE if the coordinates (x,y) are out of	1208	/* this returns TRUE if the coordinates (x,y) are out of
1281	* map m. This function also takes into account any	1209	* map m. This function also takes into account any
1282	* tiling considerations, loading adjacant maps as needed.	1210	* tiling considerations, loading adjacant maps as needed.
…		…
1295	if (!m)	1223	if (!m)
1296	return 0;	1224	return 0;
1297		1225
1298	if (x < 0)	1226	if (x < 0)
1299	{	1227	{
1300	if (!m->tile_path[3])	1228	if (!m->tile_available (3))
1301	return 1;	1229	return 1;
1302		1230
1303	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1304	find_and_link (m, 3);
1305
1306	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1231	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1307	}	1232	}
1308		1233
1309	if (x >= m->width)	1234	if (x >= m->width)
1310	{	1235	{
1311	if (!m->tile_path[1])	1236	if (!m->tile_available (1))
1312	return 1;	1237	return 1;
1313		1238
1314	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1315	find_and_link (m, 1);
1316
1317	return out_of_map (m->tile_map[1], x - m->width, y);	1239	return out_of_map (m->tile_map[1], x - m->width, y);
1318	}	1240	}
1319		1241
1320	if (y < 0)	1242	if (y < 0)
1321	{	1243	{
1322	if (!m->tile_path[0])	1244	if (!m->tile_available (0))
1323	return 1;	1245	return 1;
1324		1246
1325	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1326	find_and_link (m, 0);
1327
1328	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1247	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1329	}	1248	}
1330		1249
1331	if (y >= m->height)	1250	if (y >= m->height)
1332	{	1251	{
1333	if (!m->tile_path[2])	1252	if (!m->tile_available (2))
1334	return 1;	1253	return 1;
1335
1336	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1337	find_and_link (m, 2);
1338		1254
1339	return out_of_map (m->tile_map[2], x, y - m->height);	1255	return out_of_map (m->tile_map[2], x, y - m->height);
1340	}	1256	}
1341		1257
1342	/* Simple case - coordinates are within this local	1258	/* Simple case - coordinates are within this local
…		…
1356	maptile *	1272	maptile *
1357	maptile::xy_find (sint16 &x, sint16 &y)	1273	maptile::xy_find (sint16 &x, sint16 &y)
1358	{	1274	{
1359	if (x < 0)	1275	if (x < 0)
1360	{	1276	{
1361	if (!tile_path[3])	1277	if (!tile_available (3))
1362	return 0;	1278	return 0;
1363		1279
1364	find_and_link (this, 3);
1365	x += tile_map[3]->width;	1280	x += tile_map[3]->width;
1366	return tile_map[3]->xy_find (x, y);	1281	return tile_map[3]->xy_find (x, y);
1367	}	1282	}
1368		1283
1369	if (x >= width)	1284	if (x >= width)
1370	{	1285	{
1371	if (!tile_path[1])	1286	if (!tile_available (1))
1372	return 0;	1287	return 0;
1373		1288
1374	find_and_link (this, 1);
1375	x -= width;	1289	x -= width;
1376	return tile_map[1]->xy_find (x, y);	1290	return tile_map[1]->xy_find (x, y);
1377	}	1291	}
1378		1292
1379	if (y < 0)	1293	if (y < 0)
1380	{	1294	{
1381	if (!tile_path[0])	1295	if (!tile_available (0))
1382	return 0;	1296	return 0;
1383		1297
1384	find_and_link (this, 0);
1385	y += tile_map[0]->height;	1298	y += tile_map[0]->height;
1386	return tile_map[0]->xy_find (x, y);	1299	return tile_map[0]->xy_find (x, y);
1387	}	1300	}
1388		1301
1389	if (y >= height)	1302	if (y >= height)
1390	{	1303	{
1391	if (!tile_path[2])	1304	if (!tile_available (2))
1392	return 0;	1305	return 0;
1393		1306
1394	find_and_link (this, 2);
1395	y -= height;	1307	y -= height;
1396	return tile_map[2]->xy_find (x, y);	1308	return tile_map[2]->xy_find (x, y);
1397	}	1309	}
1398		1310
1399	/* Simple case - coordinates are within this local	1311	/* Simple case - coordinates are within this local
…		…
1410	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1322	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1411	{	1323	{
1412	if (!map1 \|\| !map2)	1324	if (!map1 \|\| !map2)
1413	return 0;	1325	return 0;
1414		1326
1415	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1327	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1416	//fix: compare paths instead (this is likely faster, too!)	1328	//fix: compare paths instead (this is likely faster, too!)
1417	if (map1 == map2)	1329	if (map1 == map2)
1418	{	1330	{
1419	*dx = 0;	1331	*dx = 0;
1420	*dy = 0;	1332	*dy = 0;
…		…
1602	else	1514	else
1603	{	1515	{
1604	retval->distance_x += op2->x - x;	1516	retval->distance_x += op2->x - x;
1605	retval->distance_y += op2->y - y;	1517	retval->distance_y += op2->y - y;
1606		1518
1607	retval->part = NULL;	1519	retval->part = 0;
1608	retval->distance = idistance (retval->distance_x, retval->distance_y);	1520	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1609	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1521	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1610	}	1522	}
1611	}	1523	}
1612		1524
1613	/* Returns true of op1 and op2 are effectively on the same map	1525	/* Returns true of op1 and op2 are effectively on the same map
…		…
1624	int dx, dy;	1536	int dx, dy;
1625		1537
1626	return adjacent_map (op1->map, op2->map, &dx, &dy);	1538	return adjacent_map (op1->map, op2->map, &dx, &dy);
1627	}	1539	}
1628		1540
		1541	//-GPL
		1542
1629	object *	1543	object *
1630	maptile::insert (object op, int x, int y, object originator, int flags)	1544	maptile::insert (object op, int x, int y, object originator, int flags)
1631	{	1545	{
1632	if (!op->flag [FLAG_REMOVED])
1633	op->remove ();
1634
1635	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1546	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1636	}	1547	}
1637		1548
1638	region *	1549	region *
1639	maptile::region (int x, int y) const	1550	maptile::region (int x, int y) const
…		…
1648	return default_region;	1559	return default_region;
1649		1560
1650	return ::region::default_region ();	1561	return ::region::default_region ();
1651	}	1562	}
1652		1563
		1564	//+GPL
		1565
1653	/* picks a random object from a style map.	1566	/* picks a random object from a style map.
1654	* Redone by MSW so it should be faster and not use static
1655	* variables to generate tables.
1656	*/	1567	*/
1657	object *	1568	object *
1658	maptile::pick_random_object () const	1569	maptile::pick_random_object (rand_gen &gen) const
1659	{	1570	{
1660	/* while returning a null object will result in a crash, that	1571	/* while returning a null object will result in a crash, that
1661	* is actually preferable to an infinite loop. That is because	1572	* is actually preferable to an infinite loop. That is because
1662	* most servers will automatically restart in case of crash.	1573	* most servers will automatically restart in case of crash.
1663	* Change the logic on getting the random space - shouldn't make	1574	* Change the logic on getting the random space - shouldn't make
1664	* any difference, but this seems clearer to me.	1575	* any difference, but this seems clearer to me.
1665	*/	1576	*/
1666	for (int i = 1000; --i;)	1577	for (int i = 1000; --i;)
1667	{	1578	{
1668	object *pick = at (rndm (width), rndm (height)).bot;	1579	object *pick = at (gen (width), gen (height)).bot;
1669		1580
1670	// do not prefer big monsters just because they are big.	1581	// do not prefer big monsters just because they are big.
1671	if (pick && pick->head_ () == pick)	1582	if (pick && pick->is_head ())
1672	return pick->head_ ();	1583	return pick->head_ ();
1673	}	1584	}
1674		1585
1675	// instead of crashing in the unlikely(?) case, try to return something	1586	// instead of crashing in the unlikely(?) case, try to return something
1676	return get_archetype ("blocked");	1587	return archetype::find (shstr_bug);
1677	}	1588	}
1678		1589
		1590	//-GPL
		1591
		1592	void
		1593	maptile::play_sound (faceidx sound, int x, int y) const
		1594	{
		1595	if (!sound)
		1596	return;
		1597
		1598	for_all_players_on_map (pl, this)
		1599	if (client *ns = pl->ns)
		1600	{
		1601	int dx = x - pl->ob->x;
		1602	int dy = y - pl->ob->y;
		1603
		1604	int distance = idistance (dx, dy);
		1605
		1606	if (distance <= MAX_SOUND_DISTANCE)
		1607	ns->play_sound (sound, dx, dy);
		1608	}
		1609	}
		1610
		1611	void
		1612	maptile::say_msg (const char *msg, int x, int y) const
		1613	{
		1614	for_all_players (pl)
		1615	if (client *ns = pl->ns)
		1616	{
		1617	int dx = x - pl->ob->x;
		1618	int dy = y - pl->ob->y;
		1619
		1620	int distance = idistance (dx, dy);
		1621
		1622	if (distance <= MAX_SOUND_DISTANCE)
		1623	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
		1624	}
		1625	}
		1626
		1627	static void
		1628	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1629	{
		1630	// clip to map to the left
		1631	if (x0 < 0)
		1632	{
		1633	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1634	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1635
		1636	if (x1 < 0) // entirely to the left
		1637	return;
		1638
		1639	x0 = 0;
		1640	}
		1641
		1642	// clip to map to the right
		1643	if (x1 > m->width)
		1644	{
		1645	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1646	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1647
		1648	if (x0 > m->width) // entirely to the right
		1649	return;
		1650
		1651	x1 = m->width;
		1652	}
		1653
		1654	// clip to map above
		1655	if (y0 < 0)
		1656	{
		1657	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1658	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1659
		1660	if (y1 < 0) // entirely above
		1661	return;
		1662
		1663	y0 = 0;
		1664	}
		1665
		1666	// clip to map below
		1667	if (y1 > m->height)
		1668	{
		1669	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1670	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1671
		1672	if (y0 > m->height) // entirely below
		1673	return;
		1674
		1675	y1 = m->height;
		1676	}
		1677
		1678	// if we get here, the rect is within the current map
		1679	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1680
		1681	r->m = m;
		1682	r->x0 = x0;
		1683	r->y0 = y0;
		1684	r->x1 = x1;
		1685	r->y1 = y1;
		1686	r->dx = dx;
		1687	r->dy = dy;
		1688	}
		1689
		1690	maprect *
		1691	maptile::split_to_tiles (int x0, int y0, int x1, int y1)
		1692	{
		1693	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
		1694	buf.clear ();
		1695
		1696	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1697
		1698	// add end marker
		1699	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1700	r->m = 0;
		1701
		1702	return (maprect *)buf.linearise ();
		1703	}
		1704

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.100 by root, Tue Apr 17 10:06:32 2007 UTC vs. Revision 1.176 by root, Tue Nov 10 05:11:05 2009 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.100 by root, Tue Apr 17 10:06:32 2007 UTC vs.
Revision 1.176 by root, Tue Nov 10 05:11:05 2009 UTC