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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.108 by root, Tue Jun 5 13:05:02 2007 UTC vs.
Revision 1.167 by root, Thu Nov 5 15:43:21 2009 UTC

…		…
1	/*	1	/*
2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT is free software; you can redistribute it and/or modify it	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* under the terms of the GNU General Public License as published by the Free	9	* the terms of the Affero GNU General Public License as published by the
10	* Software Foundation; either version 2 of the License, or (at your option)	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful, but	13	* This program is distributed in the hope that it will be useful,
14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* 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 along	18	* You should have received a copy of the Affero GNU General Public License
19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51	19	* and the GNU General Public License along with this program. If not, see
20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA	20	* <http://www.gnu.org/licenses/>.
21	*	21	*
22	* The authors can be reached via e-mail to <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)
…		…
181	/* 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
182	* 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
183	* true. If we get through the entire stack, that must mean	113	* true. If we get through the entire stack, that must mean
184	* ob is blocking it, so return 0.	114	* ob is blocking it, so return 0.
185	*/	115	*/
186	for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)	116	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
187	{	117	{
188		118	if (OB_MOVE_BLOCK (ob, tmp))
189	/* This must be before the checks below. Code for inventory checkers. */
190	if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
191	{	119	{
192	/* If last_sp is set, the player/monster needs an object,	120	if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
193	* so we check for it. If they don't have it, they can't	121	if (RESULT_INT (0))
194	* pass through this space.	122	return 1;
195	*/	123	else
196	if (tmp->last_sp)	124	continue;
		125
		126	if (tmp->type == CHECK_INV)
197	{	127	{
198	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))
199	return 1;	132	return 1;
200	else	133	}
201	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;
202	}	143	}
203	else	144	else
204	{	145	return 1; // unconditional block
205	/* In this case, the player must not have the object -	146
206	* if they do, they can't pass through.
207	*/
208	if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
209	return 1;
210	else
211	continue;
212	}
213	} /* if check_inv */
214	else	147	} else {
215	{	148	// space does not block the ob, directly, but
216	/* Broke apart a big nasty if into several here to make	149	// anything alive that is not a door still
217	* this more readable. first check - if the space blocks	150	// blocks anything but wizards.
218	* movement, can't move here.
219	* second - if a monster, can't move there, unless it is a
220	* hidden dm
221	*/
222	if (OB_MOVE_BLOCK (ob, tmp))
223	return 1;
224		151
225	if (tmp->flag [FLAG_ALIVE]	152	if (tmp->flag [FLAG_ALIVE]
226	&& tmp->head_ () != ob	153	&& tmp->head_ () != ob
227	&& tmp != ob	154	&& tmp != ob
228	&& tmp->type != DOOR	155	&& tmp->type != DOOR
229	&& !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))	156	&& !tmp->flag [FLAG_WIZPASS])
230	return 1;	157	return 1;
231	}	158	}
232
233	}	159	}
		160
234	return 0;	161	return 0;
235	}	162	}
236		163
237	/*	164	/*
238	* 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
239	* This is meant for multi space objects - for single space objecs,	166	* spot. This is meant for multi space objects - for single space objecs,
240	* just calling get_map_blocked and checking that against movement type	167	* just calling get_map_blocked and checking that against movement type
241	* of object. This function goes through all the parts of the	168	* of object. This function goes through all the parts of the multipart
242	* multipart object and makes sure they can be inserted.	169	* object and makes sure they can be inserted.
243	*	170	*
244	* 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.
245	*	172	*
246	* This function has been used to deprecate arch_out_of_map -	173	* This function has been used to deprecate arch_out_of_map -
247	* this function also does that check, and since in most cases,	174	* this function also does that check, and since in most cases,
…		…
258	*	185	*
259	* Note this used to be arch_blocked, but with new movement	186	* Note this used to be arch_blocked, but with new movement
260	* 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
261	* against the move_block values.	188	* against the move_block values.
262	*/	189	*/
263	int	190	bool
264	ob_blocked (const object ob, maptile m, sint16 x, sint16 y)	191	object::blocked (maptile *m, int x, int y) const
265	{	192	{
266	archetype *tmp;	193	for (archetype tmp = arch; tmp; tmp = (archetype )tmp->more)
267	int flag;
268	maptile *m1;
269	sint16 sx, sy;
270
271	if (!ob)
272	{
273	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
274	if (flag & P_OUT_OF_MAP)
275	return P_OUT_OF_MAP;
276
277	/* don't have object, so don't know what types would block */
278	return m1->at (sx, sy).move_block;
279	}	194	{
		195	mapxy pos (m, x + tmp->x, y + tmp->y);
280		196
281	for (tmp = ob->arch; tmp; tmp = (archetype *)tmp->more)	197	if (!pos.normalise ())
282	{	198	return 1;
283	flag = get_map_flags (m, &m1, x + tmp->x, y + tmp->y, &sx, &sy);
284		199
285	if (flag & P_OUT_OF_MAP)	200	mapspace &ms = *pos;
286	return P_OUT_OF_MAP;	201
287	if (flag & P_IS_ALIVE)	202	if (ms.flags () & P_IS_ALIVE)
288	return P_IS_ALIVE;	203	return 1;
289		204
290	mapspace &ms = m1->at (sx, sy);	205	/* However, often ob doesn't have any move type
291		206	* (signifying non-moving objects)
292	/* find_first_free_spot() calls this function. However, often
293	* ob doesn't have any move type (when used to place exits)
294	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	207	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
295	*/	208	*/
296
297	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	209	if (!move_type && ms.move_block != MOVE_ALL)
298	continue;	210	continue;
299		211
300	/* 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
301	* head of the object should correspond for the entire object.	213	* head of the object should correspond for the entire object.
302	*/	214	*/
303	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	215	if (ms.blocks (move_type))
304	return P_NO_PASS;	216	return 1;
305	}	217	}
306		218
307	return 0;	219	return 0;
308	}	220	}
309		221
…		…
327		239
328	insert_ob_in_ob (tmp, container);	240	insert_ob_in_ob (tmp, container);
329	tmp = next;	241	tmp = next;
330	}	242	}
331		243
332	/* sum_weight will go through and calculate what all the containers are	244	// go through and calculate what all the containers are carrying.
333	* carrying.	245	//TODO: remove
334	*/	246	container->update_weight ();
335	sum_weight (container);
336	}	247	}
		248
		249	//-GPL
337		250
338	void	251	void
339	maptile::set_object_flag (int flag, int value)	252	maptile::set_object_flag (int flag, int value)
340	{	253	{
341	if (!spaces)	254	if (!spaces)
…		…
343		256
344	for (mapspace *ms = spaces + size (); ms-- > spaces; )	257	for (mapspace *ms = spaces + size (); ms-- > spaces; )
345	for (object *tmp = ms->bot; tmp; tmp = tmp->above)	258	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
346	tmp->flag [flag] = value;	259	tmp->flag [flag] = value;
347	}	260	}
		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
348		276
349	/* 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
350	* 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
351	* 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
352	* they are saved).	280	* they are saved).
…		…
356	{	284	{
357	if (!spaces)	285	if (!spaces)
358	return;	286	return;
359		287
360	for (mapspace *ms = spaces + size (); ms-- > spaces; )	288	for (mapspace *ms = spaces + size (); ms-- > spaces; )
361	for (object *op = ms->bot; op; op = op->above)	289	{
		290	object *op = ms->bot;
		291	while (op)
362	{	292	{
363	/* already multipart - don't do anything more */	293	/* already multipart - don't do anything more */
364	if (op->head_ () == op && !op->more && op->arch->more)	294	if (op->head_ () == op && !op->more && op->arch->more)
365	{	295	{
366	op->remove ();	296	op->remove ();
367	op->expand_tail ();	297	op->expand_tail ();
		298
		299	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
		300	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
		301	// below the pentagrams... hopefully INS_ON_TOP doesn't break anything
368	insert (op, op->x, op->y, 0, INS_NO_MERGE \| INS_ABOVE_FLOOR_ONLY \| INS_NO_WALK_ON);	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
369	}	306	}
		307	else
		308	op = op->above;
370	}	309	}
		310	}
371	}	311	}
		312
		313	//-GPL
372		314
373	/*	315	/*
374	* 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
375	* file pointer.	317	* file pointer.
376	*/	318	*/
377	bool	319	bool
378	maptile::_load_objects (object_thawer &f)	320	maptile::_load_objects (object_thawer &f)
379	{	321	{
380	for (;;)	322	for (;;)
381	{	323	{
382	coroapi::cede_to_tick_every (100); // cede once in a while	324	coroapi::cede_to_tick (); // cede once in a while
383		325
384	switch (f.kw)	326	switch (f.kw)
385	{	327	{
386	case KW_arch:	328	case KW_arch:
387	if (object *op = object::read (f, this))	329	if (object *op = object::read (f, this))
388	{	330	{
		331	// TODO: why?
389	if (op->inv)	332	if (op->inv)
390	sum_weight (op);	333	op->update_weight ();
391		334
392	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	}
393	}	358	}
394		359
395	continue;	360	continue;
396		361
397	case KW_EOF:	362	case KW_EOF:
…		…
410	}	375	}
411		376
412	void	377	void
413	maptile::activate ()	378	maptile::activate ()
414	{	379	{
415	active = true;
416
417	if (spaces)	380	if (spaces)
418	for (mapspace *ms = spaces + size (); ms-- > spaces; )	381	for (mapspace *ms = spaces + size (); ms-- > spaces; )
419	for (object *op = ms->bot; op; op = op->above)	382	for (object *op = ms->bot; op; op = op->above)
420	op->activate_recursive ();	383	op->activate_recursive ();
421	}	384	}
422		385
423	void	386	void
424	maptile::deactivate ()	387	maptile::deactivate ()
425	{	388	{
426	active = false;
427
428	if (spaces)	389	if (spaces)
429	for (mapspace *ms = spaces + size (); ms-- > spaces; )	390	for (mapspace *ms = spaces + size (); ms-- > spaces; )
430	for (object *op = ms->bot; op; op = op->above)	391	for (object *op = ms->bot; op; op = op->above)
431	op->deactivate_recursive ();	392	op->deactivate_recursive ();
432	}	393	}
…		…
442	if (!spaces)	403	if (!spaces)
443	return false;	404	return false;
444		405
445	for (int i = 0; i < size (); ++i)	406	for (int i = 0; i < size (); ++i)
446	{	407	{
447	int unique = 0;	408	bool unique = 0;
		409
448	for (object *op = spaces [i].bot; op; op = op->above)	410	for (object *op = spaces [i].bot; op; op = op->above)
449	{	411	{
450	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	412	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
451	unique = 1;
452		413
453	if (!op->can_map_save ())	414	if (expect_false (!op->can_map_save ()))
454	continue;	415	continue;
455		416
456	if (unique \|\| op->flag [FLAG_UNIQUE])	417	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
457	{	418	{
458	if (flags & IO_UNIQUES)	419	if (flags & IO_UNIQUES)
459	op->write (f);	420	op->write (f);
460	}	421	}
461	else if (flags & IO_OBJECTS)	422	else if (expect_true (flags & IO_OBJECTS))
462	op->write (f);	423	op->write (f);
463	}	424	}
464	}	425	}
465		426
466	coroapi::cede_to_tick ();	427	coroapi::cede_to_tick ();
467		428
468	return true;	429	return true;
469	}
470
471	bool
472	maptile::_load_objects (const char *path, bool skip_header)
473	{
474	object_thawer f (path);
475
476	if (!f)
477	return false;
478
479	f.next ();
480
481	if (skip_header)
482	for (;;)
483	{
484	keyword kw = f.kw;
485	f.skip ();
486	if (kw == KW_end)
487	break;
488	}
489
490	return _load_objects (f);
491	}	430	}
492		431
493	bool	432	bool
494	maptile::_save_objects (const char *path, int flags)	433	maptile::_save_objects (const char *path, int flags)
495	{	434	{
…		…
540	if (spaces)	479	if (spaces)
541	return;	480	return;
542		481
543	spaces = salloc0<mapspace> (size ());	482	spaces = salloc0<mapspace> (size ());
544	}	483	}
		484
		485	//+GPL
545		486
546	/* Takes a string from a map definition and outputs a pointer to the array of shopitems	487	/* Takes a string from a map definition and outputs a pointer to the array of shopitems
547	* corresponding to that string. Memory is allocated for this, it must be freed	488	* corresponding to that string. Memory is allocated for this, it must be freed
548	* at a later date.	489	* at a later date.
549	* Called by parse_map_headers below.	490	* Called by parse_map_headers below.
…		…
626	return items;	567	return items;
627	}	568	}
628		569
629	/* opposite of parse string, this puts the string that was originally fed in to	570	/* opposite of parse string, this puts the string that was originally fed in to
630	* the map (or something equivilent) into output_string. */	571	* the map (or something equivilent) into output_string. */
631	static void	572	static const char *
632	print_shop_string (maptile m, char output_string)	573	print_shop_string (maptile *m)
633	{	574	{
634	int i;	575	static dynbuf_text buf; buf.clear ();
635	char tmp[MAX_BUF];
636		576
637	strcpy (output_string, "");
638	for (i = 0; i < m->shopitems[0].index; i++)	577	for (int i = 0; i < m->shopitems[0].index; i++)
639	{	578	{
640	if (m->shopitems[i].typenum)	579	if (m->shopitems[i].typenum)
641	{	580	{
642	if (m->shopitems[i].strength)	581	if (m->shopitems[i].strength)
643	sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);	582	buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
644	else	583	else
645	sprintf (tmp, "%s;", m->shopitems[i].name);	584	buf.printf ("%s;", m->shopitems[i].name);
646	}	585	}
647	else	586	else
648	{	587	{
649	if (m->shopitems[i].strength)	588	if (m->shopitems[i].strength)
650	sprintf (tmp, "*:%d;", m->shopitems[i].strength);	589	buf.printf ("*:%d;", m->shopitems[i].strength);
651	else	590	else
652	sprintf (tmp, "*");	591	buf.printf ("*");
653	}	592	}
654
655	strcat (output_string, tmp);
656	}	593	}
		594
		595	return buf;
657	}	596	}
		597
		598	//-GPL
658		599
659	/* This loads the header information of the map. The header	600	/* This loads the header information of the map. The header
660	* contains things like difficulty, size, timeout, etc.	601	* contains things like difficulty, size, timeout, etc.
661	* this used to be stored in the map object, but with the	602	* this used to be stored in the map object, but with the
662	* addition of tiling, fields beyond that easily named in an	603	* addition of tiling, fields beyond that easily named in an
…		…
670	bool	611	bool
671	maptile::_load_header (object_thawer &thawer)	612	maptile::_load_header (object_thawer &thawer)
672	{	613	{
673	for (;;)	614	for (;;)
674	{	615	{
675	thawer.next ();
676
677	switch (thawer.kw)	616	switch (thawer.kw)
678	{	617	{
679	case KW_msg:	618	case KW_msg:
680	thawer.get_ml (KW_endmsg, msg);	619	thawer.get_ml (KW_endmsg, msg);
681	break;	620	break;
…		…
714	case KW_winddir: thawer.get (winddir); break;	653	case KW_winddir: thawer.get (winddir); break;
715	case KW_sky: thawer.get (sky); break;	654	case KW_sky: thawer.get (sky); break;
716		655
717	case KW_per_player: thawer.get (per_player); break;	656	case KW_per_player: thawer.get (per_player); break;
718	case KW_per_party: thawer.get (per_party); break;	657	case KW_per_party: thawer.get (per_party); break;
		658	case KW_no_reset: thawer.get (no_reset); break;
		659	case KW_no_drop: thawer.get (no_drop); break;
719		660
720	case KW_region: default_region = region::find (thawer.get_str ()); break;	661	case KW_region: default_region = region::find (thawer.get_str ()); break;
721	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	662	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
722		663
723	// old names new names	664	// old names new names
…		…
734	case KW_tile_path_1: thawer.get (tile_path [0]); break;	675	case KW_tile_path_1: thawer.get (tile_path [0]); break;
735	case KW_tile_path_2: thawer.get (tile_path [1]); break;	676	case KW_tile_path_2: thawer.get (tile_path [1]); break;
736	case KW_tile_path_3: thawer.get (tile_path [2]); break;	677	case KW_tile_path_3: thawer.get (tile_path [2]); break;
737	case KW_tile_path_4: thawer.get (tile_path [3]); break;	678	case KW_tile_path_4: thawer.get (tile_path [3]); break;
738		679
		680	case KW_ERROR:
		681	set_key_text (thawer.kw_str, thawer.value);
		682	break;
		683
739	case KW_end:	684	case KW_end:
		685	thawer.next ();
740	return true;	686	return true;
741		687
742	default:	688	default:
743	if (!thawer.parse_error ("map", 0))	689	if (!thawer.parse_error ("map", 0))
744	return false;	690	return false;
745	break;	691	break;
746	}	692	}
		693
		694	thawer.next ();
747	}	695	}
748		696
749	abort ();	697	abort ();
750	}	698	}
751		699
752	bool	700	//+GPL
753	maptile::_load_header (const char *path)
754	{
755	object_thawer thawer (path);
756
757	if (!thawer)
758	return false;
759
760	return _load_header (thawer);
761	}
762		701
763	/******************************************************************************	702	/******************************************************************************
764	* This is the start of unique map handling code	703	* This is the start of unique map handling code
765	*****************************************************************************/	704	*****************************************************************************/
766		705
…		…
777		716
778	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	717	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
779	unique = 1;	718	unique = 1;
780		719
781	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	720	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
782	{
783	op->destroy_inv (false);
784	op->destroy ();	721	op->destroy ();
785	}
786		722
787	op = above;	723	op = above;
788	}	724	}
789	}	725	}
790	}	726	}
		727
		728	//-GPL
791		729
792	bool	730	bool
793	maptile::_save_header (object_freezer &freezer)	731	maptile::_save_header (object_freezer &freezer)
794	{	732	{
795	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	733	#define MAP_OUT(k) freezer.put (KW_ ## k, k)
…		…
800	if (name) MAP_OUT (name);	738	if (name) MAP_OUT (name);
801	MAP_OUT (swap_time);	739	MAP_OUT (swap_time);
802	MAP_OUT (reset_time);	740	MAP_OUT (reset_time);
803	MAP_OUT (reset_timeout);	741	MAP_OUT (reset_timeout);
804	MAP_OUT (fixed_resettime);	742	MAP_OUT (fixed_resettime);
		743	MAP_OUT (no_reset);
		744	MAP_OUT (no_drop);
805	MAP_OUT (difficulty);	745	MAP_OUT (difficulty);
806
807	if (default_region) MAP_OUT2 (region, default_region->name);	746	if (default_region) MAP_OUT2 (region, default_region->name);
808		747
809	if (shopitems)	748	if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
810	{
811	char shop[MAX_BUF];
812	print_shop_string (this, shop);
813	MAP_OUT2 (shopitems, shop);
814	}
815
816	MAP_OUT (shopgreed);	749	MAP_OUT (shopgreed);
817	MAP_OUT (shopmin);	750	MAP_OUT (shopmin);
818	MAP_OUT (shopmax);	751	MAP_OUT (shopmax);
819	if (shoprace) MAP_OUT (shoprace);	752	if (shoprace) MAP_OUT (shoprace);
		753
820	MAP_OUT (darkness);	754	MAP_OUT (darkness);
821	MAP_OUT (width);	755	MAP_OUT (width);
822	MAP_OUT (height);	756	MAP_OUT (height);
823	MAP_OUT (enter_x);	757	MAP_OUT (enter_x);
824	MAP_OUT (enter_y);	758	MAP_OUT (enter_y);
…		…
857	return false;	791	return false;
858		792
859	return freezer.save (path);	793	return freezer.save (path);
860	}	794	}
861		795
		796	//+GPL
		797
862	/*	798	/*
863	* Remove and free all objects in the given map.	799	* Remove and free all objects in the given map.
864	*/	800	*/
865	void	801	void
866	maptile::clear ()	802	maptile::clear ()
867	{	803	{
868	sfree (regions, size ()), regions = 0;
869	free (regionmap), regionmap = 0;
870
871	if (spaces)	804	if (spaces)
872	{	805	{
873	for (mapspace *ms = spaces + size (); ms-- > spaces; )	806	for (mapspace *ms = spaces + size (); ms-- > spaces; )
874	while (object *op = ms->bot)	807	while (object *op = ms->bot)
875	{	808	{
		809	// manually remove, as to not trigger anything
		810	if (ms->bot = op->above)
		811	ms->bot->below = 0;
		812
		813	op->flag [FLAG_REMOVED] = true;
		814
876	op = op->head_ ();	815	object *head = op->head_ ();
877	op->destroy_inv (false);	816	if (op == head)
878	op->destroy ();	817	op->destroy ();
		818	else if (head->map != op->map)
		819	{
		820	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		821	head->destroy ();
		822	}
879	}	823	}
880		824
881	sfree (spaces, size ()), spaces = 0;	825	sfree0 (spaces, size ());
882	}	826	}
883		827
884	if (buttons)	828	if (buttons)
885	free_objectlinkpt (buttons), buttons = 0;	829	free_objectlinkpt (buttons), buttons = 0;
		830
		831	sfree0 (regions, size ());
		832	delete [] regionmap; regionmap = 0;
886	}	833	}
887		834
888	void	835	void
889	maptile::clear_header ()	836	maptile::clear_header ()
890	{	837	{
…		…
922	attachable::do_destroy ();	869	attachable::do_destroy ();
923		870
924	clear ();	871	clear ();
925	}	872	}
926		873
927	/*	874	/* decay and destroy perishable items in a map */
928	* Updates every button on the map (by calling update_button() for them).
929	*/
930	void	875	void
931	maptile::update_buttons ()	876	maptile::do_decay_objects ()
932	{	877	{
933	for (oblinkpt *obp = buttons; obp; obp = obp->next)	878	if (!spaces)
934	for (objectlink *ol = obp->link; ol; ol = ol->next)	879	return;
		880
		881	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		882	for (object above, op = ms->bot; op; op = above)
935	{	883	{
936	if (!ol->ob)	884	above = op->above;
		885
		886	bool destroy = 0;
		887
		888	// do not decay anything above unique floor tiles (yet :)
		889	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
		890	break;
		891
		892	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
		893	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
		894	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
		895	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
		896	\|\| QUERY_FLAG (op, FLAG_UNPAID)
		897	\|\| op->is_alive ())
		898	; // do not decay
		899	else if (op->is_weapon ())
937	{	900	{
938	LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",	901	op->stats.dam--;
939	ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);	902	if (op->stats.dam < 0)
940	continue;	903	destroy = 1;
941	}	904	}
942		905	else if (op->is_armor ())
943	if (ol->ob->type == BUTTON \|\| ol->ob->type == PEDESTAL)
944	{	906	{
945	update_button (ol->ob);	907	op->stats.ac--;
946	break;	908	if (op->stats.ac < 0)
		909	destroy = 1;
947	}	910	}
		911	else if (op->type == FOOD)
		912	{
		913	op->stats.food -= rndm (5, 20);
		914	if (op->stats.food < 0)
		915	destroy = 1;
		916	}
		917	else
		918	{
		919	int mat = op->materials;
		920
		921	if (mat & M_PAPER
		922	\|\| mat & M_LEATHER
		923	\|\| mat & M_WOOD
		924	\|\| mat & M_ORGANIC
		925	\|\| mat & M_CLOTH
		926	\|\| mat & M_LIQUID
		927	\|\| (mat & M_IRON && rndm (1, 5) == 1)
		928	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
		929	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
		930	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
		931	\|\| (mat & M_ICE && temp > 32))
		932	destroy = 1;
		933	}
		934
		935	/* adjust overall chance below */
		936	if (destroy && rndm (0, 1))
		937	op->destroy ();
948	}	938	}
949	}	939	}
950		940
951	/*	941	/*
952	* This routine is supposed to find out the difficulty of the map.	942	* This routine is supposed to find out the difficulty of the map.
953	* difficulty does not have a lot to do with character level,	943	* difficulty does not have a lot to do with character level,
954	* but does have a lot to do with treasure on the map.	944	* but does have a lot to do with treasure on the map.
955	*	945	*
956	* Difficulty can now be set by the map creature. If the value stored	946	* Difficulty can now be set by the map creator. If the value stored
957	* in the map is zero, then use this routine. Maps should really	947	* in the map is zero, then use this routine. Maps should really
958	* have a difficulty set than using this function - human calculation	948	* have a difficulty set rather than using this function - human calculation
959	* is much better than this functions guesswork.	949	* is much better than this function's guesswork.
960	*/	950	*/
961	int	951	int
962	maptile::estimate_difficulty () const	952	maptile::estimate_difficulty () const
963	{	953	{
964	long monster_cnt = 0;	954	long monster_cnt = 0;
…		…
976		966
977	if (QUERY_FLAG (op, FLAG_GENERATOR))	967	if (QUERY_FLAG (op, FLAG_GENERATOR))
978	{	968	{
979	total_exp += op->stats.exp;	969	total_exp += op->stats.exp;
980		970
981	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	971	if (archetype *at = op->other_arch)
		972	{
982	total_exp += at->stats.exp * 8;	973	total_exp += at->stats.exp * 8;
983
984	monster_cnt++;	974	monster_cnt++;
		975	}
		976
		977	for (object *inv = op->inv; inv; inv = inv->below)
		978	{
		979	total_exp += op->stats.exp * 8;
		980	monster_cnt++;
		981	}
985	}	982	}
986	}	983	}
987		984
988	avgexp = (double) total_exp / monster_cnt;	985	avgexp = (double) total_exp / monster_cnt;
989		986
…		…
1002	* postive values make it darker, negative make it brighter	999	* postive values make it darker, negative make it brighter
1003	*/	1000	*/
1004	int	1001	int
1005	maptile::change_map_light (int change)	1002	maptile::change_map_light (int change)
1006	{	1003	{
1007	int new_level = darkness + change;
1008
1009	/* Nothing to do */	1004	/* Nothing to do */
1010	if (!change \|\| (new_level <= 0 && darkness == 0) \|\| (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS))	1005	if (!change)
1011	return 0;	1006	return 0;
1012		1007
1013	/* inform all players on the map */	1008	/* inform all players on the map */
1014	if (change > 0)	1009	if (change > 0)
1015	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");	1010	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes darker.");
1016	else	1011	else
1017	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");	1012	new_info_map (NDI_BLACK \| NDI_UNIQUE, this, "It becomes brighter.");
1018		1013
1019	/* Do extra checking. since darkness is a unsigned value,	1014	darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1020	* we need to be extra careful about negative values.
1021	* In general, the checks below are only needed if change
1022	* is not +/-1
1023	*/
1024	if (new_level < 0)
1025	darkness = 0;
1026	else if (new_level >= MAX_DARKNESS)
1027	darkness = MAX_DARKNESS;
1028	else
1029	darkness = new_level;
1030		1015
1031	/* All clients need to get re-updated for the change */	1016	/* All clients need to get re-updated for the change */
1032	update_all_map_los (this);	1017	update_all_map_los (this);
		1018
1033	return 1;	1019	return 1;
1034	}	1020	}
1035		1021
1036	/*	1022	/*
1037	* This function updates various attributes about a specific space	1023	* This function updates various attributes about a specific space
…		…
1040	* through, etc)	1026	* through, etc)
1041	*/	1027	*/
1042	void	1028	void
1043	mapspace::update_ ()	1029	mapspace::update_ ()
1044	{	1030	{
1045	object tmp, last = 0;	1031	object *last = 0;
1046	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;	1032	uint8 flags = P_UPTODATE, anywhere = 0;
		1033	sint8 light = 0;
1047	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1034	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1048		1035
1049	//object *middle = 0;	1036	//object *middle = 0;
1050	//object *top = 0;	1037	//object *top = 0;
1051	//object *floor = 0;	1038	//object *floor = 0;
1052	// this seems to generate better code than using locals, above	1039	// this seems to generate better code than using locals, above
1053	object *&top = faces_obj[0] = 0;	1040	object *&top = faces_obj[0] = 0;
1054	object *&middle = faces_obj[1] = 0;	1041	object *&middle = faces_obj[1] = 0;
1055	object *&floor = faces_obj[2] = 0;	1042	object *&floor = faces_obj[2] = 0;
1056		1043
1057	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1044	for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1058	{	1045	{
1059	/* This could be made additive I guess (two lights better than	1046	// Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1060	* one). But if so, it shouldn't be a simple additive - 2
1061	* light bulbs do not illuminate twice as far as once since
1062	* it is a dissapation factor that is cubed.
1063	*/
1064	if (tmp->glow_radius > light)
1065	light = tmp->glow_radius;	1047	light += tmp->glow_radius;
1066		1048
1067	/* This call is needed in order to update objects the player	1049	/* This call is needed in order to update objects the player
1068	* is standing in that have animations (ie, grass, fire, etc).	1050	* is standing in that have animations (ie, grass, fire, etc).
1069	* However, it also causes the look window to be re-drawn	1051	* However, it also causes the look window to be re-drawn
1070	* 3 times each time the player moves, because many of the	1052	* 3 times each time the player moves, because many of the
…		…
1089	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))	1071	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1090	{	1072	{
1091	middle = tmp;	1073	middle = tmp;
1092	anywhere = 1;	1074	anywhere = 1;
1093	}	1075	}
		1076
1094	/* Find the highest visible face around. If equal	1077	/* Find the highest visible face around. If equal
1095	* visibilities, we still want the one nearer to the	1078	* visibilities, we still want the one nearer to the
1096	* top	1079	* top
1097	*/	1080	*/
1098	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))	1081	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
…		…
1117	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;	1100	if (tmp->type == SAFE_GROUND) flags \|= P_SAFE;
1118	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;	1101	if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags \|= P_IS_ALIVE;
1119	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;	1102	if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags \|= P_NO_CLERIC;
1120	}	1103	}
1121		1104
1122	this->light = light;	1105	this->light = min (light, MAX_LIGHT_RADIUS);
1123	this->flags_ = flags;	1106	this->flags_ = flags;
1124	this->move_block = move_block & ~move_allow;	1107	this->move_block = move_block & ~move_allow;
1125	this->move_on = move_on;	1108	this->move_on = move_on;
1126	this->move_off = move_off;	1109	this->move_off = move_off;
1127	this->move_slow = move_slow;	1110	this->move_slow = move_slow;
…		…
1147	* 1) top face is set, need middle to be set.	1130	* 1) top face is set, need middle to be set.
1148	* 2) middle is set, need to set top.	1131	* 2) middle is set, need to set top.
1149	* 3) neither middle or top is set - need to set both.	1132	* 3) neither middle or top is set - need to set both.
1150	*/	1133	*/
1151		1134
1152	for (tmp = last; tmp; tmp = tmp->below)	1135	for (object *tmp = last; tmp; tmp = tmp->below)
1153	{	1136	{
1154	/* Once we get to a floor, stop, since we already have a floor object */	1137	/* Once we get to a floor, stop, since we already have a floor object */
1155	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1138	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1156	break;	1139	break;
1157		1140
…		…
1209	vol += op->volume ();	1192	vol += op->volume ();
1210		1193
1211	return vol;	1194	return vol;
1212	}	1195	}
1213		1196
1214	/* this updates the orig_map->tile_map[tile_num] value after finding	1197	maptile *
1215	* the map. It also takes care of linking back the freshly found	1198	maptile::tile_available (int dir, bool load)
1216	* maps tile_map values if it tiles back to this one. It returns
1217	* the value of orig_map->tile_map[tile_num].
1218	*/
1219	static inline maptile *
1220	find_and_link (maptile *orig_map, int tile_num)
1221	{	1199	{
1222	maptile *mp = orig_map->tile_map [tile_num];	1200	if (tile_path[dir])
1223
1224	if (!mp)
1225	{
1226	mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1227
1228	if (!mp)
1229	{
1230	// emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1231	LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1232	&orig_map->tile_path[tile_num], &orig_map->path);
1233	mp = new maptile (1, 1);
1234	mp->alloc ();
1235	mp->in_memory = MAP_IN_MEMORY;
1236	}
1237	}	1201	{
		1202	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
		1203	return tile_map[dir];
1238		1204
1239	int dest_tile = (tile_num + 2) % 4;	1205	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1206	return tile_map[dir];
		1207	}
1240		1208
1241	orig_map->tile_map [tile_num] = mp;
1242
1243	// optimisation: back-link map to origin map if euclidean
1244	//TODO: non-euclidean maps MUST GO
1245	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1246	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1247
1248	return mp;	1209	return 0;
1249	}
1250
1251	static inline void
1252	load_and_link (maptile *orig_map, int tile_num)
1253	{
1254	find_and_link (orig_map, tile_num)->load_sync ();
1255	}	1210	}
1256		1211
1257	/* this returns TRUE if the coordinates (x,y) are out of	1212	/* this returns TRUE if the coordinates (x,y) are out of
1258	* map m. This function also takes into account any	1213	* map m. This function also takes into account any
1259	* tiling considerations, loading adjacant maps as needed.	1214	* tiling considerations, loading adjacant maps as needed.
…		…
1272	if (!m)	1227	if (!m)
1273	return 0;	1228	return 0;
1274		1229
1275	if (x < 0)	1230	if (x < 0)
1276	{	1231	{
1277	if (!m->tile_path[3])	1232	if (!m->tile_available (3))
1278	return 1;	1233	return 1;
1279		1234
1280	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1281	find_and_link (m, 3);
1282
1283	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1235	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1284	}	1236	}
1285		1237
1286	if (x >= m->width)	1238	if (x >= m->width)
1287	{	1239	{
1288	if (!m->tile_path[1])	1240	if (!m->tile_available (1))
1289	return 1;	1241	return 1;
1290		1242
1291	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1292	find_and_link (m, 1);
1293
1294	return out_of_map (m->tile_map[1], x - m->width, y);	1243	return out_of_map (m->tile_map[1], x - m->width, y);
1295	}	1244	}
1296		1245
1297	if (y < 0)	1246	if (y < 0)
1298	{	1247	{
1299	if (!m->tile_path[0])	1248	if (!m->tile_available (0))
1300	return 1;	1249	return 1;
1301		1250
1302	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1303	find_and_link (m, 0);
1304
1305	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1251	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1306	}	1252	}
1307		1253
1308	if (y >= m->height)	1254	if (y >= m->height)
1309	{	1255	{
1310	if (!m->tile_path[2])	1256	if (!m->tile_available (2))
1311	return 1;	1257	return 1;
1312
1313	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1314	find_and_link (m, 2);
1315		1258
1316	return out_of_map (m->tile_map[2], x, y - m->height);	1259	return out_of_map (m->tile_map[2], x, y - m->height);
1317	}	1260	}
1318		1261
1319	/* Simple case - coordinates are within this local	1262	/* Simple case - coordinates are within this local
…		…
1333	maptile *	1276	maptile *
1334	maptile::xy_find (sint16 &x, sint16 &y)	1277	maptile::xy_find (sint16 &x, sint16 &y)
1335	{	1278	{
1336	if (x < 0)	1279	if (x < 0)
1337	{	1280	{
1338	if (!tile_path[3])	1281	if (!tile_available (3))
1339	return 0;	1282	return 0;
1340		1283
1341	find_and_link (this, 3);
1342	x += tile_map[3]->width;	1284	x += tile_map[3]->width;
1343	return tile_map[3]->xy_find (x, y);	1285	return tile_map[3]->xy_find (x, y);
1344	}	1286	}
1345		1287
1346	if (x >= width)	1288	if (x >= width)
1347	{	1289	{
1348	if (!tile_path[1])	1290	if (!tile_available (1))
1349	return 0;	1291	return 0;
1350		1292
1351	find_and_link (this, 1);
1352	x -= width;	1293	x -= width;
1353	return tile_map[1]->xy_find (x, y);	1294	return tile_map[1]->xy_find (x, y);
1354	}	1295	}
1355		1296
1356	if (y < 0)	1297	if (y < 0)
1357	{	1298	{
1358	if (!tile_path[0])	1299	if (!tile_available (0))
1359	return 0;	1300	return 0;
1360		1301
1361	find_and_link (this, 0);
1362	y += tile_map[0]->height;	1302	y += tile_map[0]->height;
1363	return tile_map[0]->xy_find (x, y);	1303	return tile_map[0]->xy_find (x, y);
1364	}	1304	}
1365		1305
1366	if (y >= height)	1306	if (y >= height)
1367	{	1307	{
1368	if (!tile_path[2])	1308	if (!tile_available (2))
1369	return 0;	1309	return 0;
1370		1310
1371	find_and_link (this, 2);
1372	y -= height;	1311	y -= height;
1373	return tile_map[2]->xy_find (x, y);	1312	return tile_map[2]->xy_find (x, y);
1374	}	1313	}
1375		1314
1376	/* Simple case - coordinates are within this local	1315	/* Simple case - coordinates are within this local
…		…
1387	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1326	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1388	{	1327	{
1389	if (!map1 \|\| !map2)	1328	if (!map1 \|\| !map2)
1390	return 0;	1329	return 0;
1391		1330
1392	//TODO: this doesn't actually check corretcly when intermediate maps are not loaded	1331	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
1393	//fix: compare paths instead (this is likely faster, too!)	1332	//fix: compare paths instead (this is likely faster, too!)
1394	if (map1 == map2)	1333	if (map1 == map2)
1395	{	1334	{
1396	*dx = 0;	1335	*dx = 0;
1397	*dy = 0;	1336	*dy = 0;
…		…
1579	else	1518	else
1580	{	1519	{
1581	retval->distance_x += op2->x - x;	1520	retval->distance_x += op2->x - x;
1582	retval->distance_y += op2->y - y;	1521	retval->distance_y += op2->y - y;
1583		1522
1584	retval->part = NULL;	1523	retval->part = 0;
1585	retval->distance = idistance (retval->distance_x, retval->distance_y);	1524	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1586	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1525	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1587	}	1526	}
1588	}	1527	}
1589		1528
1590	/* Returns true of op1 and op2 are effectively on the same map	1529	/* Returns true of op1 and op2 are effectively on the same map
…		…
1601	int dx, dy;	1540	int dx, dy;
1602		1541
1603	return adjacent_map (op1->map, op2->map, &dx, &dy);	1542	return adjacent_map (op1->map, op2->map, &dx, &dy);
1604	}	1543	}
1605		1544
		1545	//-GPL
		1546
1606	object *	1547	object *
1607	maptile::insert (object op, int x, int y, object originator, int flags)	1548	maptile::insert (object op, int x, int y, object originator, int flags)
1608	{	1549	{
1609	if (!op->flag [FLAG_REMOVED])
1610	op->remove ();
1611
1612	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1550	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1613	}	1551	}
1614		1552
1615	region *	1553	region *
1616	maptile::region (int x, int y) const	1554	maptile::region (int x, int y) const
…		…
1625	return default_region;	1563	return default_region;
1626		1564
1627	return ::region::default_region ();	1565	return ::region::default_region ();
1628	}	1566	}
1629		1567
		1568	//+GPL
		1569
1630	/* picks a random object from a style map.	1570	/* picks a random object from a style map.
1631	* Redone by MSW so it should be faster and not use static
1632	* variables to generate tables.
1633	*/	1571	*/
1634	object *	1572	object *
1635	maptile::pick_random_object () const	1573	maptile::pick_random_object (rand_gen &gen) const
1636	{	1574	{
1637	/* while returning a null object will result in a crash, that	1575	/* while returning a null object will result in a crash, that
1638	* is actually preferable to an infinite loop. That is because	1576	* is actually preferable to an infinite loop. That is because
1639	* most servers will automatically restart in case of crash.	1577	* most servers will automatically restart in case of crash.
1640	* Change the logic on getting the random space - shouldn't make	1578	* Change the logic on getting the random space - shouldn't make
1641	* any difference, but this seems clearer to me.	1579	* any difference, but this seems clearer to me.
1642	*/	1580	*/
1643	for (int i = 1000; --i;)	1581	for (int i = 1000; --i;)
1644	{	1582	{
1645	object *pick = at (rndm (width), rndm (height)).bot;	1583	object *pick = at (gen (width), gen (height)).bot;
1646		1584
1647	// do not prefer big monsters just because they are big.	1585	// do not prefer big monsters just because they are big.
1648	if (pick && pick->head_ () == pick)	1586	if (pick && pick->is_head ())
1649	return pick->head_ ();	1587	return pick->head_ ();
1650	}	1588	}
1651		1589
1652	// instead of crashing in the unlikely(?) case, try to return something	1590	// instead of crashing in the unlikely(?) case, try to return something
1653	return get_archetype ("blocked");	1591	return archetype::find ("bug");
1654	}	1592	}
1655		1593
		1594	//-GPL
		1595
		1596	void
		1597	maptile::play_sound (faceidx sound, int x, int y) const
		1598	{
		1599	if (!sound)
		1600	return;
		1601
		1602	for_all_players_on_map (pl, this)
		1603	if (client *ns = pl->ns)
		1604	{
		1605	int dx = x - pl->ob->x;
		1606	int dy = y - pl->ob->y;
		1607
		1608	int distance = idistance (dx, dy);
		1609
		1610	if (distance <= MAX_SOUND_DISTANCE)
		1611	ns->play_sound (sound, dx, dy);
		1612	}
		1613	}
		1614
		1615	void
		1616	maptile::say_msg (const char *msg, int x, int y) const
		1617	{
		1618	for_all_players (pl)
		1619	if (client *ns = pl->ns)
		1620	{
		1621	int dx = x - pl->ob->x;
		1622	int dy = y - pl->ob->y;
		1623
		1624	int distance = idistance (dx, dy);
		1625
		1626	if (distance <= MAX_SOUND_DISTANCE)
		1627	ns->send_msg (NDI_GREY \| NDI_DEF, SAY_CHANNEL, msg);
		1628	}
		1629	}
		1630
		1631	static void
		1632	split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
		1633	{
		1634	// clip to map to the left
		1635	if (x0 < 0)
		1636	{
		1637	if (maptile *tile = m->tile_available (TILE_LEFT, 1))
		1638	split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
		1639
		1640	if (x1 < 0) // entirely to the left
		1641	return;
		1642
		1643	x0 = 0;
		1644	}
		1645
		1646	// clip to map to the right
		1647	if (x1 > m->width)
		1648	{
		1649	if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
		1650	split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
		1651
		1652	if (x0 > m->width) // entirely to the right
		1653	return;
		1654
		1655	x1 = m->width;
		1656	}
		1657
		1658	// clip to map above
		1659	if (y0 < 0)
		1660	{
		1661	if (maptile *tile = m->tile_available (TILE_UP, 1))
		1662	split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
		1663
		1664	if (y1 < 0) // entirely above
		1665	return;
		1666
		1667	y0 = 0;
		1668	}
		1669
		1670	// clip to map below
		1671	if (y1 > m->height)
		1672	{
		1673	if (maptile *tile = m->tile_available (TILE_DOWN, 1))
		1674	split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
		1675
		1676	if (y0 > m->height) // entirely below
		1677	return;
		1678
		1679	y1 = m->height;
		1680	}
		1681
		1682	// if we get here, the rect is within the current map
		1683	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1684
		1685	r->m = m;
		1686	r->x0 = x0;
		1687	r->y0 = y0;
		1688	r->x1 = x1;
		1689	r->y1 = y1;
		1690	r->dx = dx;
		1691	r->dy = dy;
		1692	}
		1693
		1694	maprect *
		1695	maptile::split_to_tiles (int x0, int y0, int x1, int y1)
		1696	{
		1697	static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
		1698	buf.clear ();
		1699
		1700	::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
		1701
		1702	// add end marker
		1703	maprect r = (maprect )buf.alloc (sizeof (maprect));
		1704	r->m = 0;
		1705
		1706	return (maprect *)buf.linearise ();
		1707	}
		1708

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.108 by root, Tue Jun 5 13:05:02 2007 UTC vs. Revision 1.167 by root, Thu Nov 5 15:43:21 2009 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.108 by root, Tue Jun 5 13:05:02 2007 UTC vs.
Revision 1.167 by root, Thu Nov 5 15:43:21 2009 UTC