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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.96 by root, Thu Mar 15 14:23:02 2007 UTC vs.
Revision 1.171 by root, Sun Nov 8 16:13:45 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 (cede_count >= 500)
470	{
471	cede_count = 0;
472	coroapi::cede ();
473	}
474
475	int unique = 0;	408	bool unique = 0;
		409
476	for (object *op = spaces [i].bot; op; op = op->above)	410	for (object *op = spaces [i].bot; op; op = op->above)
477	{	411	{
478	// count per-object, but cede only when modification-safe
479	cede_count++;
480
481	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	412	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
482	unique = 1;
483		413
484	if (!op->can_map_save ())	414	if (expect_false (!op->can_map_save ()))
485	continue;	415	continue;
486		416
487	if (unique \|\| op->flag [FLAG_UNIQUE])	417	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
488	{	418	{
489	if (flags & IO_UNIQUES)	419	if (flags & IO_UNIQUES)
490	op->write (f);	420	op->write (f);
491	}	421	}
492	else if (flags & IO_OBJECTS)	422	else if (expect_true (flags & IO_OBJECTS))
493	op->write (f);	423	op->write (f);
494	}	424	}
495	}	425	}
496		426
		427	coroapi::cede_to_tick ();
		428
497	return true;	429	return true;
498	}
499
500	bool
501	maptile::_load_objects (const char *path, bool skip_header)
502	{
503	object_thawer f (path);
504
505	if (!f)
506	return false;
507
508	f.next ();
509
510	if (skip_header)
511	for (;;)
512	{
513	keyword kw = f.kw;
514	f.skip ();
515	if (kw == KW_end)
516	break;
517	}
518
519	return _load_objects (f);
520	}	430	}
521		431
522	bool	432	bool
523	maptile::_save_objects (const char *path, int flags)	433	maptile::_save_objects (const char *path, int flags)
524	{	434	{
…		…
539	*/	449	*/
540	width = 16;	450	width = 16;
541	height = 16;	451	height = 16;
542	timeout = 300;	452	timeout = 300;
543	max_nrof = 1000; // 1000 items of anything	453	max_nrof = 1000; // 1000 items of anything
		454	max_items = 25;
544	max_volume = 2000000; // 2m³	455	max_volume = 2000000; // 2m³
545	}	456	}
546		457
547	maptile::maptile (int w, int h)	458	maptile::maptile (int w, int h)
548	{	459	{
…		…
569	if (spaces)	480	if (spaces)
570	return;	481	return;
571		482
572	spaces = salloc0<mapspace> (size ());	483	spaces = salloc0<mapspace> (size ());
573	}	484	}
		485
		486	//+GPL
574		487
575	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	488	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
576	* corresponding to that string. Memory is allocated for this, it must be freed	489	* corresponding to that string. Memory is allocated for this, it must be freed
577	* at a later date.	490	* at a later date.
578	* Called by parse_map_headers below.	491	* Called by parse_map_headers below.
…		…
655	return items;	568	return items;
656	}	569	}
657		570
658	/* opposite of parse string, this puts the string that was originally fed in to	571	/* opposite of parse string, this puts the string that was originally fed in to
659	* the map (or something equivilent) into output_string. */	572	* the map (or something equivilent) into output_string. */
660	static void	573	static const char *
661	print_shop_string (maptile m, char output_string)	574	print_shop_string (maptile *m)
662	{	575	{
663	int i;	576	static dynbuf_text buf; buf.clear ();
664	char tmp[MAX_BUF];
665		577
666	strcpy (output_string, "");
667	for (i = 0; i < m->shopitems[0].index; i++)	578	for (int i = 0; i < m->shopitems[0].index; i++)
668	{	579	{
669	if (m->shopitems[i].typenum)	580	if (m->shopitems[i].typenum)
670	{	581	{
671	if (m->shopitems[i].strength)	582	if (m->shopitems[i].strength)
672	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	583	buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
673	else	584	else
674	sprintf (tmp, "%s;", m->shopitems[i].name);	585	buf.printf ("%s;", m->shopitems[i].name);
675	}	586	}
676	else	587	else
677	{	588	{
678	if (m->shopitems[i].strength)	589	if (m->shopitems[i].strength)
679	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	590	buf.printf ("*:%d;", m->shopitems[i].strength);
680	else	591	else
681	sprintf (tmp, "*");	592	buf.printf ("*");
682	}	593	}
683
684	strcat (output_string, tmp);
685	}	594	}
		595
		596	return buf;
686	}	597	}
		598
		599	//-GPL
687		600
688	/* This loads the header information of the map. The header	601	/* This loads the header information of the map. The header
689	* contains things like difficulty, size, timeout, etc.	602	* contains things like difficulty, size, timeout, etc.
690	* this used to be stored in the map object, but with the	603	* this used to be stored in the map object, but with the
691	* addition of tiling, fields beyond that easily named in an	604	* addition of tiling, fields beyond that easily named in an
…		…
699	bool	612	bool
700	maptile::_load_header (object_thawer &thawer)	613	maptile::_load_header (object_thawer &thawer)
701	{	614	{
702	for (;;)	615	for (;;)
703	{	616	{
704	keyword kw = thawer.get_kv ();
705
706	switch (kw)	617	switch (thawer.kw)
707	{	618	{
708	case KW_msg:	619	case KW_msg:
709	thawer.get_ml (KW_endmsg, msg);	620	thawer.get_ml (KW_endmsg, msg);
710	break;	621	break;
711		622
…		…
743	case KW_winddir: thawer.get (winddir); break;	654	case KW_winddir: thawer.get (winddir); break;
744	case KW_sky: thawer.get (sky); break;	655	case KW_sky: thawer.get (sky); break;
745		656
746	case KW_per_player: thawer.get (per_player); break;	657	case KW_per_player: thawer.get (per_player); break;
747	case KW_per_party: thawer.get (per_party); break;	658	case KW_per_party: thawer.get (per_party); break;
		659	case KW_no_reset: thawer.get (no_reset); break;
		660	case KW_no_drop: thawer.get (no_drop); break;
748		661
749	case KW_region: default_region = region::find (thawer.get_str ()); break;	662	case KW_region: default_region = region::find (thawer.get_str ()); break;
750	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	663	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
751		664
752	// old names new names	665	// old names new names
…		…
763	case KW_tile_path_1: thawer.get (tile_path [0]); break;	676	case KW_tile_path_1: thawer.get (tile_path [0]); break;
764	case KW_tile_path_2: thawer.get (tile_path [1]); break;	677	case KW_tile_path_2: thawer.get (tile_path [1]); break;
765	case KW_tile_path_3: thawer.get (tile_path [2]); break;	678	case KW_tile_path_3: thawer.get (tile_path [2]); break;
766	case KW_tile_path_4: thawer.get (tile_path [3]); break;	679	case KW_tile_path_4: thawer.get (tile_path [3]); break;
767		680
		681	case KW_ERROR:
		682	set_key_text (thawer.kw_str, thawer.value);
		683	break;
		684
768	case KW_end:	685	case KW_end:
		686	thawer.next ();
769	return true;	687	return true;
770		688
771	default:	689	default:
772	if (!thawer.parse_error ("map", 0))	690	if (!thawer.parse_error ("map", 0))
773	return false;	691	return false;
774	break;	692	break;
775	}	693	}
		694
		695	thawer.next ();
776	}	696	}
777		697
778	abort ();	698	abort ();
779	}	699	}
780		700
781	bool	701	//+GPL
782	maptile::_load_header (const char *path)
783	{
784	object_thawer thawer (path);
785
786	if (!thawer)
787	return false;
788
789	return _load_header (thawer);
790	}
791		702
792	/******************************************************************************	703	/******************************************************************************
793	* This is the start of unique map handling code	704	* This is the start of unique map handling code
794	*****************************************************************************/	705	*****************************************************************************/
795		706
…		…
805	object *above = op->above;	716	object *above = op->above;
806		717
807	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	718	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
808	unique = 1;	719	unique = 1;
809		720
810	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	721	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
811	{
812	op->destroy_inv (false);
813	op->destroy ();	722	op->destroy ();
814	}
815		723
816	op = above;	724	op = above;
817	}	725	}
818	}	726	}
819	}	727	}
		728
		729	//-GPL
820		730
821	bool	731	bool
822	maptile::_save_header (object_freezer &freezer)	732	maptile::_save_header (object_freezer &freezer)
823	{	733	{
824	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	734	#define MAP_OUT(k) freezer.put (KW_ ## k, k)
…		…
829	if (name) MAP_OUT (name);	739	if (name) MAP_OUT (name);
830	MAP_OUT (swap_time);	740	MAP_OUT (swap_time);
831	MAP_OUT (reset_time);	741	MAP_OUT (reset_time);
832	MAP_OUT (reset_timeout);	742	MAP_OUT (reset_timeout);
833	MAP_OUT (fixed_resettime);	743	MAP_OUT (fixed_resettime);
		744	MAP_OUT (no_reset);
		745	MAP_OUT (no_drop);
834	MAP_OUT (difficulty);	746	MAP_OUT (difficulty);
835
836	if (default_region) MAP_OUT2 (region, default_region->name);	747	if (default_region) MAP_OUT2 (region, default_region->name);
837		748
838	if (shopitems)	749	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
839	{
840	char shop[MAX_BUF];
841	print_shop_string (this, shop);
842	MAP_OUT2 (shopitems, shop);
843	}
844
845	MAP_OUT (shopgreed);	750	MAP_OUT (shopgreed);
846	MAP_OUT (shopmin);	751	MAP_OUT (shopmin);
847	MAP_OUT (shopmax);	752	MAP_OUT (shopmax);
848	if (shoprace) MAP_OUT (shoprace);	753	if (shoprace) MAP_OUT (shoprace);
		754
849	MAP_OUT (darkness);	755	MAP_OUT (darkness);
850	MAP_OUT (width);	756	MAP_OUT (width);
851	MAP_OUT (height);	757	MAP_OUT (height);
852	MAP_OUT (enter_x);	758	MAP_OUT (enter_x);
853	MAP_OUT (enter_y);	759	MAP_OUT (enter_y);
…		…
886	return false;	792	return false;
887		793
888	return freezer.save (path);	794	return freezer.save (path);
889	}	795	}
890		796
		797	//+GPL
		798
891	/*	799	/*
892	* Remove and free all objects in the given map.	800	* Remove and free all objects in the given map.
893	*/	801	*/
894	void	802	void
895	maptile::clear ()	803	maptile::clear ()
896	{	804	{
897	sfree (regions, size ()), regions = 0;
898	free (regionmap), regionmap = 0;
899
900	if (spaces)	805	if (spaces)
901	{	806	{
902	for (mapspace *ms = spaces + size (); ms-- > spaces; )	807	for (mapspace *ms = spaces + size (); ms-- > spaces; )
903	while (object *op = ms->bot)	808	while (object *op = ms->bot)
904	{	809	{
		810	// manually remove, as to not trigger anything
		811	if (ms->bot = op->above)
		812	ms->bot->below = 0;
		813
		814	op->flag [FLAG_REMOVED] = true;
		815
		816	object *head = op->head_ ();
905	if (op->head)	817	if (op == head)
906	op = op->head;
907
908	op->destroy_inv (false);
909	op->destroy ();	818	op->destroy ();
		819	else if (head->map != op->map)
		820	{
		821	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		822	head->destroy ();
		823	}
910	}	824	}
911		825
912	sfree (spaces, size ()), spaces = 0;	826	sfree0 (spaces, size ());
913	}	827	}
914		828
915	if (buttons)	829	if (buttons)
916	free_objectlinkpt (buttons), buttons = 0;	830	free_objectlinkpt (buttons), buttons = 0;
		831
		832	sfree0 (regions, size ());
		833	delete [] regionmap; regionmap = 0;
917	}	834	}
918		835
919	void	836	void
920	maptile::clear_header ()	837	maptile::clear_header ()
921	{	838	{
…		…
953	attachable::do_destroy ();	870	attachable::do_destroy ();
954		871
955	clear ();	872	clear ();
956	}	873	}
957		874
958	/*	875	/* decay and destroy perishable items in a map */
959	* Updates every button on the map (by calling update_button() for them).
960	*/
961	void	876	void
962	maptile::update_buttons ()	877	maptile::do_decay_objects ()
963	{	878	{
964	for (oblinkpt *obp = buttons; obp; obp = obp->next)	879	if (!spaces)
965	for (objectlink *ol = obp->link; ol; ol = ol->next)	880	return;
		881
		882	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		883	for (object above, op = ms->bot; op; op = above)
966	{	884	{
967	if (!ol->ob)	885	above = op->above;
		886
		887	bool destroy = 0;
		888
		889	// do not decay anything above unique floor tiles (yet :)
		890	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
		891	break;
		892
		893	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
		894	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
		895	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
		896	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
		897	\|\| QUERY_FLAG (op, FLAG_UNPAID)
		898	\|\| op->is_alive ())
		899	; // do not decay
		900	else if (op->is_weapon ())
968	{	901	{
969	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",	902	op->stats.dam--;
970	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);	903	if (op->stats.dam < 0)
971	continue;	904	destroy = 1;
972	}	905	}
973		906	else if (op->is_armor ())
974	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
975	{	907	{
976	update_button (ol->ob);	908	op->stats.ac--;
977	break;	909	if (op->stats.ac < 0)
		910	destroy = 1;
978	}	911	}
		912	else if (op->type == FOOD)
		913	{
		914	op->stats.food -= rndm (5, 20);
		915	if (op->stats.food < 0)
		916	destroy = 1;
		917	}
		918	else
		919	{
		920	int mat = op->materials;
		921
		922	if (mat & M_PAPER
		923	\|\| mat & M_LEATHER
		924	\|\| mat & M_WOOD
		925	\|\| mat & M_ORGANIC
		926	\|\| mat & M_CLOTH
		927	\|\| mat & M_LIQUID
		928	\|\| (mat & M_IRON && rndm (1, 5) == 1)
		929	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
		930	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
		931	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
		932	\|\| (mat & M_ICE && temp > 32))
		933	destroy = 1;
		934	}
		935
		936	/* adjust overall chance below */
		937	if (destroy && rndm (0, 1))
		938	op->destroy ();
979	}	939	}
980	}	940	}
981		941
982	/*	942	/*
983	* This routine is supposed to find out the difficulty of the map.	943	* This routine is supposed to find out the difficulty of the map.
984	* difficulty does not have a lot to do with character level,	944	* difficulty does not have a lot to do with character level,
985	* but does have a lot to do with treasure on the map.	945	* but does have a lot to do with treasure on the map.
986	*	946	*
987	* Difficulty can now be set by the map creature. If the value stored	947	* Difficulty can now be set by the map creator. If the value stored
988	* in the map is zero, then use this routine. Maps should really	948	* in the map is zero, then use this routine. Maps should really
989	* have a difficulty set than using this function - human calculation	949	* have a difficulty set rather than using this function - human calculation
990	* is much better than this functions guesswork.	950	* is much better than this function's guesswork.
991	*/	951	*/
992	int	952	int
993	maptile::estimate_difficulty () const	953	maptile::estimate_difficulty () const
994	{	954	{
995	long monster_cnt = 0;	955	long monster_cnt = 0;
…		…
1007		967
1008	if (QUERY_FLAG (op, FLAG_GENERATOR))	968	if (QUERY_FLAG (op, FLAG_GENERATOR))
1009	{	969	{
1010	total_exp += op->stats.exp;	970	total_exp += op->stats.exp;
1011		971
1012	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	972	if (archetype *at = op->other_arch)
		973	{
1013	total_exp += at->clone.stats.exp * 8;	974	total_exp += at->stats.exp * 8;
1014
1015	monster_cnt++;	975	monster_cnt++;
		976	}
		977
		978	for (object *inv = op->inv; inv; inv = inv->below)
		979	{
		980	total_exp += op->stats.exp * 8;
		981	monster_cnt++;
		982	}
1016	}	983	}
1017	}	984	}
1018		985
1019	avgexp = (double) total_exp / monster_cnt;	986	avgexp = (double) total_exp / monster_cnt;
1020		987
…		…
1033	* postive values make it darker, negative make it brighter	1000	* postive values make it darker, negative make it brighter
1034	*/	1001	*/
1035	int	1002	int
1036	maptile::change_map_light (int change)	1003	maptile::change_map_light (int change)
1037	{	1004	{
1038	int new_level = darkness + change;
1039
1040	/* Nothing to do */	1005	/* Nothing to do */
1041	if (!change \|\| (new_level <= 0 && darkness == 0) \|\| (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	1006	if (!change)
1042	return 0;	1007	return 0;
1043		1008
1044	/* inform all players on the map */	1009	/* inform all players on the map */
1045	if (change > 0)	1010	if (change > 0)
1046	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");	1011	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");
1047	else	1012	else
1048	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");	1013	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");
1049		1014
1050	/* Do extra checking. since darkness is a unsigned value,	1015	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1051	* we need to be extra careful about negative values.
1052	* In general, the checks below are only needed if change
1053	* is not +/-1
1054	*/
1055	if (new_level < 0)
1056	darkness = 0;
1057	else if (new_level >= MAX_DARKNESS)
1058	darkness = MAX_DARKNESS;
1059	else
1060	darkness = new_level;
1061		1016
1062	/* All clients need to get re-updated for the change */	1017	/* All clients need to get re-updated for the change */
1063	update_all_map_los (this);	1018	update_all_map_los (this);
		1019
1064	return 1;	1020	return 1;
1065	}	1021	}
1066		1022
1067	/*	1023	/*
1068	* This function updates various attributes about a specific space	1024	* This function updates various attributes about a specific space
…		…
1071	* through, etc)	1027	* through, etc)
1072	*/	1028	*/
1073	void	1029	void
1074	mapspace::update_ ()	1030	mapspace::update_ ()
1075	{	1031	{
1076	object tmp, last = 0;	1032	object *last = 0;
1077	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1033	uint8 flags = P_UPTODATE;
		1034	sint8 light = 0;
1078	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1035	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
		1036	uint64_t volume = 0;
		1037	uint32_t nrof = 0;
		1038	object *anywhere = 0;
1079		1039
1080	//object *middle = 0;	1040	//object *middle = 0;
1081	//object *top = 0;	1041	//object *top = 0;
1082	//object *floor = 0;	1042	//object *floor = 0;
1083	// this seems to generate better code than using locals, above	1043	// this seems to generate better code than using locals, above
1084	object *&top = faces_obj[0] = 0;	1044	object *&top = faces_obj[0] = 0;
1085	object *&middle = faces_obj[1] = 0;	1045	object *&middle = faces_obj[1] = 0;
1086	object *&floor = faces_obj[2] = 0;	1046	object *&floor = faces_obj[2] = 0;
1087		1047
		1048	object::flags_t allflags; // all flags of all objects or'ed together
		1049
1088	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1050	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1089	{	1051	{
1090	/* This could be made additive I guess (two lights better than	1052	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1091	* one). But if so, it shouldn't be a simple additive - 2
1092	* light bulbs do not illuminate twice as far as once since
1093	* it is a dissapation factor that is cubed.
1094	*/
1095	if (tmp->glow_radius > light)
1096	light = tmp->glow_radius;	1053	light += tmp->glow_radius;
1097		1054
1098	/* This call is needed in order to update objects the player	1055	/* This call is needed in order to update objects the player
1099	* is standing in that have animations (ie, grass, fire, etc).	1056	* is standing in that have animations (ie, grass, fire, etc).
1100	* However, it also causes the look window to be re-drawn	1057	* However, it also causes the look window to be re-drawn
1101	* 3 times each time the player moves, because many of the	1058	* 3 times each time the player moves, because many of the
1102	* functions the move_player calls eventualy call this.	1059	* functions the move_player calls eventualy call this.
1103	*	1060	*
1104	* Always put the player down for drawing.	1061	* Always put the player down for drawing.
1105	*/	1062	*/
1106	if (!tmp->invisible)	1063	if (expect_true (!tmp->invisible))
1107	{	1064	{
1108	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))	1065	if (tmp->type == PLAYER \|\| tmp->flag [FLAG_MONSTER])
1109	top = tmp;	1066	top = tmp;
1110	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1067	else
1111	{	1068	{
		1069	if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
		1070	{
1112	/* If we got a floor, that means middle and top were below it,	1071	/* If we got a floor, that means middle and top were below it,
1113	* so should not be visible, so we clear them.	1072	* so should not be visible, so we clear them.
1114	*/	1073	*/
1115	middle = 0;	1074	middle = 0;
1116	top = 0;	1075	top = 0;
1117	floor = tmp;	1076	floor = tmp;
		1077	volume = 0;
		1078	nrof = 0;
		1079	}
		1080	else
		1081	{
		1082	if (expect_true (!tmp->flag [FLAG_NO_PICK]))
		1083	{
		1084	++nrof;
		1085	volume += tmp->volume ();
		1086	}
		1087
		1088	/* Flag anywhere have high priority */
		1089	if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
		1090	anywhere = tmp;
		1091	/* Find the highest visible face around. If equal
		1092	* visibilities, we still want the one nearer to the
		1093	* top
		1094	*/
		1095	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility))
		1096	middle = tmp;
		1097	}
1118	}	1098	}
1119	/* Flag anywhere have high priority */
1120	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1121	{
1122	middle = tmp;
1123	anywhere = 1;
1124	}
1125	/* Find the highest visible face around. If equal
1126	* visibilities, we still want the one nearer to the
1127	* top
1128	*/
1129	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1130	middle = tmp;
1131	}
1132
1133	if (tmp == tmp->above)
1134	{
1135	LOG (llevError, "Error in structure of map\n");
1136	exit (-1);
1137	}	1099	}
1138		1100
1139	move_slow \|= tmp->move_slow;	1101	move_slow \|= tmp->move_slow;
1140	move_block \|= tmp->move_block;	1102	move_block \|= tmp->move_block;
1141	move_on \|= tmp->move_on;	1103	move_on \|= tmp->move_on;
1142	move_off \|= tmp->move_off;	1104	move_off \|= tmp->move_off;
1143	move_allow \|= tmp->move_allow;	1105	move_allow \|= tmp->move_allow;
1144		1106
1145	if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags \|= P_BLOCKSVIEW;	1107	allflags \|= tmp->flag;
1146	if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags \|= P_NO_MAGIC;	1108
1147	if (tmp->type == PLAYER) flags \|= P_PLAYER;	1109	if (tmp->type == PLAYER) flags \|= P_PLAYER;
1148	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1110	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1149	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1150	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1151	}	1111	}
1152		1112
1153	this->light = light;	1113	// FLAG_SEE_ANYWHERE takes precedence
		1114	if (anywhere)
		1115	middle = anywhere;
		1116
		1117	// ORing all flags together and checking them here is much faster
		1118	if (allflags [FLAG_BLOCKSVIEW]) flags \|= P_BLOCKSVIEW;
		1119	if (allflags [FLAG_NO_MAGIC] ) flags \|= P_NO_MAGIC;
		1120	if (allflags [FLAG_ALIVE] ) flags \|= P_IS_ALIVE;
		1121	if (allflags [FLAG_DAMNED] ) flags \|= P_NO_CLERIC;
		1122
		1123	this->light = min (light, MAX_LIGHT_RADIUS);
1154	this->flags_ = flags;	1124	this->flags_ = flags;
1155	this->move_block = move_block & ~move_allow;	1125	this->move_block = move_block & ~move_allow;
1156	this->move_on = move_on;	1126	this->move_on = move_on;
1157	this->move_off = move_off;	1127	this->move_off = move_off;
1158	this->move_slow = move_slow;	1128	this->move_slow = move_slow;
		1129	this->volume_ = volume / 1024;
		1130	this->nrof_ = upos_min (nrof, 65535); // assume nrof <= 2**31
1159		1131
1160	/* At this point, we have a floor face (if there is a floor),	1132	/* At this point, we have a floor face (if there is a floor),
1161	* and the floor is set - we are not going to touch it at	1133	* and the floor is set - we are not going to touch it at
1162	* this point.	1134	* this point.
1163	* middle contains the highest visibility face.	1135	* middle contains the highest visibility face.
…		…
1178	* 1) top face is set, need middle to be set.	1150	* 1) top face is set, need middle to be set.
1179	* 2) middle is set, need to set top.	1151	* 2) middle is set, need to set top.
1180	* 3) neither middle or top is set - need to set both.	1152	* 3) neither middle or top is set - need to set both.
1181	*/	1153	*/
1182		1154
1183	for (tmp = last; tmp; tmp = tmp->below)	1155	for (object *tmp = last; tmp; tmp = tmp->below)
1184	{	1156	{
1185	/* Once we get to a floor, stop, since we already have a floor object */	1157	/* Once we get to a floor, stop, since we already have a floor object */
1186	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1158	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1187	break;	1159	break;
1188		1160
…		…
1229	faces_obj [1] = middle;	1201	faces_obj [1] = middle;
1230	faces_obj [2] = floor;	1202	faces_obj [2] = floor;
1231	#endif	1203	#endif
1232	}	1204	}
1233		1205
1234	uint64	1206	maptile *
1235	mapspace::volume () const	1207	maptile::tile_available (int dir, bool load)
1236	{	1208	{
1237	uint64 vol = 0;	1209	if (tile_path[dir])
1238
1239	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1240	vol += op->volume ();
1241
1242	return vol;
1243	}
1244
1245	/* this updates the orig_map->tile_map[tile_num] value after finding
1246	* the map. It also takes care of linking back the freshly found
1247	* maps tile_map values if it tiles back to this one. It returns
1248	* the value of orig_map->tile_map[tile_num].
1249	*/
1250	static inline maptile *
1251	find_and_link (maptile *orig_map, int tile_num)
1252	{
1253	maptile *mp = orig_map->tile_map [tile_num];
1254
1255	if (!mp)
1256	{
1257	mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1258
1259	if (!mp)
1260	{
1261	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1262	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1263	&orig_map->tile_path[tile_num], &orig_map->path);
1264	mp = new maptile (1, 1);
1265	mp->alloc ();
1266	mp->in_memory = MAP_IN_MEMORY;
1267	}
1268	}	1210	{
		1211	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
		1212	return tile_map[dir];
1269		1213
1270	int dest_tile = (tile_num + 2) % 4;	1214	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1215	return tile_map[dir];
		1216	}
1271		1217
1272	orig_map->tile_map [tile_num] = mp;
1273
1274	// optimisation: back-link map to origin map if euclidean
1275	//TODO: non-euclidean maps MUST GO
1276	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1277	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1278
1279	return mp;	1218	return 0;
1280	}
1281
1282	static inline void
1283	load_and_link (maptile *orig_map, int tile_num)
1284	{
1285	find_and_link (orig_map, tile_num)->load_sync ();
1286	}	1219	}
1287		1220
1288	/* this returns TRUE if the coordinates (x,y) are out of	1221	/* this returns TRUE if the coordinates (x,y) are out of
1289	* map m. This function also takes into account any	1222	* map m. This function also takes into account any
1290	* tiling considerations, loading adjacant maps as needed.	1223	* tiling considerations, loading adjacant maps as needed.
…		…
1303	if (!m)	1236	if (!m)
1304	return 0;	1237	return 0;
1305		1238
1306	if (x < 0)	1239	if (x < 0)
1307	{	1240	{
1308	if (!m->tile_path[3])	1241	if (!m->tile_available (3))
1309	return 1;	1242	return 1;
1310		1243
1311	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1312	find_and_link (m, 3);
1313
1314	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1244	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1315	}	1245	}
1316		1246
1317	if (x >= m->width)	1247	if (x >= m->width)
1318	{	1248	{
1319	if (!m->tile_path[1])	1249	if (!m->tile_available (1))
1320	return 1;	1250	return 1;
1321		1251
1322	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1323	find_and_link (m, 1);
1324
1325	return out_of_map (m->tile_map[1], x - m->width, y);	1252	return out_of_map (m->tile_map[1], x - m->width, y);
1326	}	1253	}
1327		1254
1328	if (y < 0)	1255	if (y < 0)
1329	{	1256	{
1330	if (!m->tile_path[0])	1257	if (!m->tile_available (0))
1331	return 1;	1258	return 1;
1332		1259
1333	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1334	find_and_link (m, 0);
1335
1336	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1260	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1337	}	1261	}
1338		1262
1339	if (y >= m->height)	1263	if (y >= m->height)
1340	{	1264	{
1341	if (!m->tile_path[2])	1265	if (!m->tile_available (2))
1342	return 1;	1266	return 1;
1343
1344	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1345	find_and_link (m, 2);
1346		1267
1347	return out_of_map (m->tile_map[2], x, y - m->height);	1268	return out_of_map (m->tile_map[2], x, y - m->height);
1348	}	1269	}
1349		1270
1350	/* Simple case - coordinates are within this local	1271	/* Simple case - coordinates are within this local
…		…
1364	maptile *	1285	maptile *
1365	maptile::xy_find (sint16 &x, sint16 &y)	1286	maptile::xy_find (sint16 &x, sint16 &y)
1366	{	1287	{
1367	if (x < 0)	1288	if (x < 0)
1368	{	1289	{
1369	if (!tile_path[3])	1290	if (!tile_available (3))
1370	return 0;	1291	return 0;
1371		1292
1372	find_and_link (this, 3);
1373	x += tile_map[3]->width;	1293	x += tile_map[3]->width;
1374	return tile_map[3]->xy_find (x, y);	1294	return tile_map[3]->xy_find (x, y);
1375	}	1295	}
1376		1296
1377	if (x >= width)	1297	if (x >= width)
1378	{	1298	{
1379	if (!tile_path[1])	1299	if (!tile_available (1))
1380	return 0;	1300	return 0;
1381		1301
1382	find_and_link (this, 1);
1383	x -= width;	1302	x -= width;
1384	return tile_map[1]->xy_find (x, y);	1303	return tile_map[1]->xy_find (x, y);
1385	}	1304	}
1386		1305
1387	if (y < 0)	1306	if (y < 0)
1388	{	1307	{
1389	if (!tile_path[0])	1308	if (!tile_available (0))
1390	return 0;	1309	return 0;
1391		1310
1392	find_and_link (this, 0);
1393	y += tile_map[0]->height;	1311	y += tile_map[0]->height;
1394	return tile_map[0]->xy_find (x, y);	1312	return tile_map[0]->xy_find (x, y);
1395	}	1313	}
1396		1314
1397	if (y >= height)	1315	if (y >= height)
1398	{	1316	{
1399	if (!tile_path[2])	1317	if (!tile_available (2))
1400	return 0;	1318	return 0;
1401		1319
1402	find_and_link (this, 2);
1403	y -= height;	1320	y -= height;
1404	return tile_map[2]->xy_find (x, y);	1321	return tile_map[2]->xy_find (x, y);
1405	}	1322	}
1406		1323
1407	/* Simple case - coordinates are within this local	1324	/* Simple case - coordinates are within this local
…		…
1418	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1335	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1419	{	1336	{
1420	if (!map1 \|\| !map2)	1337	if (!map1 \|\| !map2)
1421	return 0;	1338	return 0;
1422		1339
1423	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1340	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1424	//fix: compare paths instead (this is likely faster, too!)	1341	//fix: compare paths instead (this is likely faster, too!)
1425	if (map1 == map2)	1342	if (map1 == map2)
1426	{	1343	{
1427	*dx = 0;	1344	*dx = 0;
1428	*dy = 0;	1345	*dy = 0;
…		…
1610	else	1527	else
1611	{	1528	{
1612	retval->distance_x += op2->x - x;	1529	retval->distance_x += op2->x - x;
1613	retval->distance_y += op2->y - y;	1530	retval->distance_y += op2->y - y;
1614		1531
1615	retval->part = NULL;	1532	retval->part = 0;
1616	retval->distance = idistance (retval->distance_x, retval->distance_y);	1533	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1617	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1534	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1618	}	1535	}
1619	}	1536	}
1620		1537
1621	/* Returns true of op1 and op2 are effectively on the same map	1538	/* Returns true of op1 and op2 are effectively on the same map
…		…
1632	int dx, dy;	1549	int dx, dy;
1633		1550
1634	return adjacent_map (op1->map, op2->map, &dx, &dy);	1551	return adjacent_map (op1->map, op2->map, &dx, &dy);
1635	}	1552	}
1636		1553
		1554	//-GPL
		1555
1637	object *	1556	object *
1638	maptile::insert (object op, int x, int y, object originator, int flags)	1557	maptile::insert (object op, int x, int y, object originator, int flags)
1639	{	1558	{
1640	if (!op->flag [FLAG_REMOVED])
1641	op->remove ();
1642
1643	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1559	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1644	}	1560	}
1645		1561
1646	region *	1562	region *
1647	maptile::region (int x, int y) const	1563	maptile::region (int x, int y) const
…		…
1656	return default_region;	1572	return default_region;
1657		1573
1658	return ::region::default_region ();	1574	return ::region::default_region ();
1659	}	1575	}
1660		1576
		1577	//+GPL
		1578
1661	/* picks a random object from a style map.	1579	/* picks a random object from a style map.
1662	* Redone by MSW so it should be faster and not use static
1663	* variables to generate tables.
1664	*/	1580	*/
1665	object *	1581	object *
1666	maptile::pick_random_object () const	1582	maptile::pick_random_object (rand_gen &gen) const
1667	{	1583	{
1668	/* while returning a null object will result in a crash, that	1584	/* while returning a null object will result in a crash, that
1669	* is actually preferable to an infinite loop. That is because	1585	* is actually preferable to an infinite loop. That is because
1670	* most servers will automatically restart in case of crash.	1586	* most servers will automatically restart in case of crash.
1671	* Change the logic on getting the random space - shouldn't make	1587	* Change the logic on getting the random space - shouldn't make
1672	* any difference, but this seems clearer to me.	1588	* any difference, but this seems clearer to me.
1673	*/	1589	*/
1674	for (int i = 1000; --i;)	1590	for (int i = 1000; --i;)
1675	{	1591	{
1676	object *pick = at (rndm (width), rndm (height)).bot;	1592	object *pick = at (gen (width), gen (height)).bot;
1677		1593
1678	// do not prefer big monsters just because they are big.	1594	// do not prefer big monsters just because they are big.
1679	if (pick && pick->head_ () == pick)	1595	if (pick && pick->is_head ())
1680	return pick->head_ ();	1596	return pick->head_ ();
1681	}	1597	}
1682		1598
1683	// instead of crashing in the unlikely(?) case, try to return something	1599	// instead of crashing in the unlikely(?) case, try to return something
1684	return get_archetype ("blocked");	1600	return archetype::find (shstr_bug);
1685	}	1601	}
1686		1602
		1603	//-GPL
		1604
		1605	void
		1606	maptile::play_sound (faceidx sound, int x, int y) const
		1607	{
		1608	if (!sound)
		1609	return;
		1610
		1611	for_all_players_on_map (pl, this)
		1612	if (client *ns = pl->ns)
		1613	{
		1614	int dx = x - pl->ob->x;
		1615	int dy = y - pl->ob->y;
		1616
		1617	int distance = idistance (dx, dy);
		1618
		1619	if (distance <= MAX_SOUND_DISTANCE)
		1620	ns->play_sound (sound, dx, dy);
		1621	}
		1622	}
		1623
		1624	void
		1625	maptile::say_msg (const char *msg, int x, int y) const
		1626	{
		1627	for_all_players (pl)
		1628	if (client *ns = pl->ns)
		1629	{
		1630	int dx = x - pl->ob->x;
		1631	int dy = y - pl->ob->y;
		1632
		1633	int distance = idistance (dx, dy);
		1634
		1635	if (distance <= MAX_SOUND_DISTANCE)
		1636	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
		1637	}
		1638	}
		1639
		1640	static void
		1641	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1642	{
		1643	// clip to map to the left
		1644	if (x0 < 0)
		1645	{
		1646	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1647	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1648
		1649	if (x1 < 0) // entirely to the left
		1650	return;
		1651
		1652	x0 = 0;
		1653	}
		1654
		1655	// clip to map to the right
		1656	if (x1 > m->width)
		1657	{
		1658	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1659	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1660
		1661	if (x0 > m->width) // entirely to the right
		1662	return;
		1663
		1664	x1 = m->width;
		1665	}
		1666
		1667	// clip to map above
		1668	if (y0 < 0)
		1669	{
		1670	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1671	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1672
		1673	if (y1 < 0) // entirely above
		1674	return;
		1675
		1676	y0 = 0;
		1677	}
		1678
		1679	// clip to map below
		1680	if (y1 > m->height)
		1681	{
		1682	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1683	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1684
		1685	if (y0 > m->height) // entirely below
		1686	return;
		1687
		1688	y1 = m->height;
		1689	}
		1690
		1691	// if we get here, the rect is within the current map
		1692	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1693
		1694	r->m = m;
		1695	r->x0 = x0;
		1696	r->y0 = y0;
		1697	r->x1 = x1;
		1698	r->y1 = y1;
		1699	r->dx = dx;
		1700	r->dy = dy;
		1701	}
		1702
		1703	maprect *
		1704	maptile::split_to_tiles (int x0, int y0, int x1, int y1)
		1705	{
		1706	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
		1707	buf.clear ();
		1708
		1709	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1710
		1711	// add end marker
		1712	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1713	r->m = 0;
		1714
		1715	return (maprect *)buf.linearise ();
		1716	}
		1717

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.96 by root, Thu Mar 15 14:23:02 2007 UTC vs. Revision 1.171 by root, Sun Nov 8 16:13:45 2009 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.96 by root, Thu Mar 15 14:23:02 2007 UTC vs.
Revision 1.171 by root, Sun Nov 8 16:13:45 2009 UTC