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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.56 by root, Sat Dec 30 10:16:10 2006 UTC vs.
Revision 1.138 by root, Sun May 4 14:12:37 2008 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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4	Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
8	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
18	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
20		21	* The authors can be reached via e-mail to <support@deliantra.net>
21	The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	22	*/
23		23
24	#include <global.h>
25	#include <funcpoint.h>
26
27	#include <loader.h>
28	#include <unistd.h>	24	#include <unistd.h>
29		25
		26	#include "global.h"
		27
		28	#include "loader.h"
		29
30	#include "path.h"	30	#include "path.h"
31
32	/*
33	* This makes a path absolute outside the world of Crossfire.
34	* In other words, it prepends LIBDIR/MAPDIR/ to the given path
35	* and returns the pointer to a static array containing the result.
36	* it really should be called create_mapname
37	*/
38	const char *
39	create_pathname (const char *name)
40	{
41	static char buf[MAX_BUF];
42
43	/* Why? having extra / doesn't confuse unix anyplace? Dependancies
44	* someplace else in the code? msw 2-17-97
45	*/
46	if (*name == '/')
47	sprintf (buf, "%s/%s%s", settings.datadir, settings.mapdir, name);
48	else
49	sprintf (buf, "%s/%s/%s", settings.datadir, settings.mapdir, name);
50	return (buf);
51	}
52
53	/*
54	* same as create_pathname, but for the overlay maps.
55	*/
56	const char *
57	create_overlay_pathname (const char *name)
58	{
59	static char buf[MAX_BUF];
60
61	/* Why? having extra / doesn't confuse unix anyplace? Dependancies
62	* someplace else in the code? msw 2-17-97
63	*/
64	if (*name == '/')
65	sprintf (buf, "%s/%s%s", settings.localdir, settings.mapdir, name);
66	else
67	sprintf (buf, "%s/%s/%s", settings.localdir, settings.mapdir, name);
68	return (buf);
69	}
70
71	/*
72	* same as create_pathname, but for the template maps.
73	*/
74	const char *
75	create_template_pathname (const char *name)
76	{
77	static char buf[MAX_BUF];
78
79	/* Why? having extra / doesn't confuse unix anyplace? Dependancies
80	* someplace else in the code? msw 2-17-97
81	*/
82	if (*name == '/')
83	sprintf (buf, "%s/%s%s", settings.localdir, settings.templatedir, name);
84	else
85	sprintf (buf, "%s/%s/%s", settings.localdir, settings.templatedir, name);
86	return (buf);
87	}
88
89	/*
90	* This makes absolute path to the itemfile where unique objects
91	* will be saved. Converts '/' to '@'. I think it's essier maintain
92	* files than full directory structure, but if this is problem it can
93	* be changed.
94	*/
95	static const char *
96	create_items_path (const char *s)
97	{
98	static char buf[MAX_BUF];
99	char *t;
100
101	if (*s == '/')
102	s++;
103
104	sprintf (buf, "%s/%s/", settings.localdir, settings.uniquedir);
105
106	for (t = buf + strlen (buf); *s; s++, t++)
107	if (*s == '/')
108	*t = '@';
109	else
110	t = s;
111	*t = 0;
112	return (buf);
113	}
114
115	/*
116	* This function checks if a file with the given path exists.
117	* -1 is returned if it fails, otherwise the mode of the file
118	* is returned.
119	* It tries out all the compression suffixes listed in the uncomp[] array.
120	*
121	* If prepend_dir is set, then we call create_pathname (which prepends
122	* libdir & mapdir). Otherwise, we assume the name given is fully
123	* complete.
124	* Only the editor actually cares about the writablity of this -
125	* the rest of the code only cares that the file is readable.
126	* when the editor goes away, the call to stat should probably be
127	* replaced by an access instead (similar to the windows one, but
128	* that seems to be missing the prepend_dir processing
129	*/
130	int
131	check_path (const char *name, int prepend_dir)
132	{
133	char buf[MAX_BUF];
134
135	char *endbuf;
136	struct stat statbuf;
137	int mode = 0;
138
139	if (prepend_dir)
140	strcpy (buf, create_pathname (name));
141	else
142	strcpy (buf, name);
143
144	/* old method (strchr(buf, '\0')) seemd very odd to me -
145	* this method should be equivalant and is clearer.
146	* Can not use strcat because we need to cycle through
147	* all the names.
148	*/
149	endbuf = buf + strlen (buf);
150
151	if (stat (buf, &statbuf))
152	return -1;
153	if (!S_ISREG (statbuf.st_mode))
154	return (-1);
155
156	if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) \|\|
157	((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IROTH))
158	mode \|= 4;
159
160	if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) \|\|
161	(statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) \|\| (statbuf.st_mode & S_IWOTH))
162	mode \|= 2;
163
164	return (mode);
165	}
166		31
167	/* This rolls up wall, blocks_magic, blocks_view, etc, all into	32	/* This rolls up wall, blocks_magic, blocks_view, etc, all into
168	* one function that just returns a P_.. value (see map.h)	33	* one function that just returns a P_.. value (see map.h)
169	* it will also do map translation for tiled maps, returning	34	* it will also do map translation for tiled maps, returning
170	* new values into newmap, nx, and ny. Any and all of those	35	* new values into newmap, nx, and ny. Any and all of those
241	* let the player through (inventory checkers for example)	106	* let the player through (inventory checkers for example)
242	*/	107	*/
243	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))	108	if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
244	return 0;	109	return 0;
245		110
246	if (ob->head != NULL)
247	ob = ob->head;	111	ob = ob->head_ ();
248		112
249	/* We basically go through the stack of objects, and if there is	113	/* We basically go through the stack of objects, and if there is
250	* some other object that has NO_PASS or FLAG_ALIVE set, return	114	* some other object that has NO_PASS or FLAG_ALIVE set, return
251	* true. If we get through the entire stack, that must mean	115	* true. If we get through the entire stack, that must mean
252	* ob is blocking it, so return 0.	116	* ob is blocking it, so return 0.
…		…
282	else	146	else
283	{	147	{
284	/* Broke apart a big nasty if into several here to make	148	/* Broke apart a big nasty if into several here to make
285	* this more readable. first check - if the space blocks	149	* this more readable. first check - if the space blocks
286	* movement, can't move here.	150	* movement, can't move here.
287	* second - if a monster, can't move there, unles it is a	151	* second - if a monster, can't move there, unless it is a
288	* hidden dm	152	* hidden dm
289	*/	153	*/
290	if (OB_MOVE_BLOCK (ob, tmp))	154	if (OB_MOVE_BLOCK (ob, tmp))
291	return 1;	155	return 1;
292	if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob &&	156
293	tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden))	157	if (tmp->flag [FLAG_ALIVE]
		158	&& tmp->head_ () != ob
		159	&& tmp != ob
		160	&& tmp->type != DOOR
		161	&& !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))
294	return 1;	162	return 1;
295	}	163	}
296		164
297	}	165	}
298	return 0;	166	return 0;
299	}	167	}
300		168
301
302	/*	169	/*
303	* Returns true if the given object can't fit in the given spot.	170	* Returns qthe blocking object if the given object can't fit in the given
304	* This is meant for multi space objects - for single space objecs,	171	* spot. This is meant for multi space objects - for single space objecs,
305	* just calling get_map_blocked and checking that against movement type	172	* just calling get_map_blocked and checking that against movement type
306	* of object. This function goes through all the parts of the	173	* of object. This function goes through all the parts of the multipart
307	* multipart object and makes sure they can be inserted.	174	* object and makes sure they can be inserted.
308	*	175	*
309	* While this doesn't call out of map, the get_map_flags does.	176	* While this doesn't call out of map, the get_map_flags does.
310	*	177	*
311	* This function has been used to deprecate arch_out_of_map -	178	* This function has been used to deprecate arch_out_of_map -
312	* this function also does that check, and since in most cases,	179	* this function also does that check, and since in most cases,
…		…
323	*	190	*
324	* Note this used to be arch_blocked, but with new movement	191	* Note this used to be arch_blocked, but with new movement
325	* code, we need to have actual object to check its move_type	192	* code, we need to have actual object to check its move_type
326	* against the move_block values.	193	* against the move_block values.
327	*/	194	*/
328	int	195	bool
329	ob_blocked (const object ob, maptile m, sint16 x, sint16 y)	196	object::blocked (maptile *m, int x, int y) const
330	{	197	{
331	archetype *tmp;	198	for (archetype tmp = arch; tmp; tmp = (archetype )tmp->more)
332	int flag;
333	maptile *m1;
334	sint16 sx, sy;
335
336	if (ob == NULL)
337	{
338	flag = get_map_flags (m, &m1, x, y, &sx, &sy);
339	if (flag & P_OUT_OF_MAP)
340	return P_OUT_OF_MAP;
341
342	/* don't have object, so don't know what types would block */
343	return m1->at (sx, sy).move_block;
344	}	199	{
		200	mapxy pos (m, x + tmp->x, y + tmp->y);
345		201
346	for (tmp = ob->arch; tmp; tmp = tmp->more)	202	if (!pos.normalise ())
347	{	203	return 1;
348	flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
349		204
350	if (flag & P_OUT_OF_MAP)	205	mapspace &ms = *pos;
351	return P_OUT_OF_MAP;	206
352	if (flag & P_IS_ALIVE)	207	if (ms.flags () & P_IS_ALIVE)
353	return P_IS_ALIVE;	208	return 1;
354		209
355	mapspace &ms = m1->at (sx, sy);	210	/* However, often ob doesn't have any move type
356		211	* (signifying non-moving objects)
357	/* find_first_free_spot() calls this function. However, often
358	* ob doesn't have any move type (when used to place exits)
359	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.	212	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
360	*/	213	*/
361
362	if (ob->move_type == 0 && ms.move_block != MOVE_ALL)	214	if (!move_type && ms.move_block != MOVE_ALL)
363	continue;	215	continue;
364		216
365	/* Note it is intentional that we check ob - the movement type of the	217	/* Note it is intentional that we check ob - the movement type of the
366	* head of the object should correspond for the entire object.	218	* head of the object should correspond for the entire object.
367	*/	219	*/
368	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	220	if (ms.blocks (move_type))
369	return P_NO_PASS;	221	return 1;
370	}	222	}
371		223
372	return 0;	224	return 0;
373	}	225	}
374		226
…		…
392		244
393	insert_ob_in_ob (tmp, container);	245	insert_ob_in_ob (tmp, container);
394	tmp = next;	246	tmp = next;
395	}	247	}
396		248
397	/* sum_weight will go through and calculate what all the containers are	249	// go through and calculate what all the containers are carrying.
398	* carrying.	250	//TODO: remove
399	*/	251	container->update_weight ();
400	sum_weight (container);	252	}
		253
		254	void
		255	maptile::set_object_flag (int flag, int value)
		256	{
		257	if (!spaces)
		258	return;
		259
		260	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		261	for (object *tmp = ms->bot; tmp; tmp = tmp->above)
		262	tmp->flag [flag] = value;
401	}	263	}
402		264
403	/* link_multipart_objects go through all the objects on the map looking	265	/* link_multipart_objects go through all the objects on the map looking
404	* for objects whose arch says they are multipart yet according to the	266	* for objects whose arch says they are multipart yet according to the
405	* info we have, they only have the head (as would be expected when	267	* info we have, they only have the head (as would be expected when
406	* they are saved). We do have to look for the old maps that did save	268	* they are saved).
407	* the more sections and not re-add sections for them.
408	*/	269	*/
409	void	270	void
410	maptile::link_multipart_objects ()	271	maptile::link_multipart_objects ()
411	{	272	{
412	if (!spaces)	273	if (!spaces)
413	return;	274	return;
414		275
415	for (mapspace *ms = spaces + size (); ms-- > spaces; )	276	for (mapspace *ms = spaces + size (); ms-- > spaces; )
416	for (object *tmp = ms->bot; tmp; )	277	{
		278	object *op = ms->bot;
		279	while (op)
417	{	280	{
418	object *above = tmp->above;
419
420	/* already multipart - don't do anything more */	281	/* already multipart - don't do anything more */
421	if (!tmp->head && !tmp->more)	282	if (op->head_ () == op && !op->more && op->arch->more)
422	{
423	/* If there is nothing more to this object, this for loop
424	* won't do anything.
425	*/
426	archetype *at;
427	object last, op;
428	for (at = tmp->arch->more, last = tmp;
429	at;
430	at = at->more, last = op)
431	{	283	{
432	op = arch_to_object (at);	284	op->remove ();
		285	op->expand_tail ();
433		286
434	/* update x,y coordinates */	287	// FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
435	op->x += tmp->x;	288	// multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
436	op->y += tmp->y;	289	// below the pentagrams... hopefully INS_ON_TOP doesn't break anything
437	op->head = tmp;
438	op->map = this;
439	last->more = op;
440	op->name = tmp->name;
441	op->title = tmp->title;
442
443	/* we could link all the parts onto tmp, and then just
444	* call insert_ob_in_map once, but the effect is the same,
445	* as insert_ob_in_map will call itself with each part, and
446	* the coding is simpler to just to it here with each part.
447	*/
448	insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE \| INS_ABOVE_FLOOR_ONLY \| INS_NO_WALK_ON);	290	insert (op, op->x, op->y, 0, INS_NO_MERGE \| INS_ON_TOP \| INS_NO_WALK_ON);
		291
		292	op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
		293	// so we have to reset the iteration through the mapspace
449	}	294	}
		295	else
		296	op = op->above;
450	}	297	}
451
452	tmp = above;
453	}	298	}
454	}	299	}
455		300
456	/*	301	/*
457	* Loads (ands parses) the objects into a given map from the specified	302	* Loads (ands parses) the objects into a given map from the specified
458	* file pointer.	303	* file pointer.
459	* mapflags is the same as we get with load_original_map
460	*/	304	*/
461	bool	305	bool
462	maptile::load_objects (object_thawer &thawer)	306	maptile::_load_objects (object_thawer &f)
463	{	307	{
464	int unique;	308	for (;;)
465	object op, prev = NULL, last_more = NULL, otmp;
466
467	op = object::create ();
468	op->map = this; /* To handle buttons correctly */
469
470	while (int i = load_object (thawer, op, 0))
471	{	309	{
472	/* if the archetype for the object is null, means that we	310	coroapi::cede_to_tick (); // cede once in a while
473	* got an invalid object. Don't do anything with it - the game	311
474	* or editor will not be able to do anything with it either.	312	switch (f.kw)
475	*/
476	if (op->arch == NULL)
477	{	313	{
478	LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");	314	case KW_arch:
		315	if (object *op = object::read (f, this))
		316	{
		317	// TODO: why?
		318	if (op->inv)
		319	op->update_weight ();
		320
		321	if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
		322	{
		323	// we insert manually because
		324	// a) its way faster
		325	// b) we remove manually, too, and there are good reasons for that
		326	// c) its correct
		327	mapspace &ms = at (op->x, op->y);
		328
		329	op->flag [FLAG_REMOVED] = false;
		330
		331	op->above = 0;
		332	op->below = ms.top;
		333
		334	if (ms.top)
		335	ms.top->above = op;
		336	else
		337	ms.bot = op;
		338
		339	ms.top = op;
		340	ms.flags_ = 0;
		341	}
		342	else
		343	{
		344	f.parse_warn (format ("object %s out of range", op->debug_desc ()));
		345	op->destroy ();
		346	}
		347	}
		348
479	continue;	349	continue;
480	}
481		350
482	switch (i)
483	{
484	case LL_NORMAL:
485	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ON_TOP \| INS_MAP_LOAD);
486
487	if (op->inv)
488	sum_weight (op);
489
490	prev = op, last_more = op;
491	break;
492
493	case LL_MORE:	351	case KW_EOF:
494	insert_ob_in_map (op, this, op, INS_NO_MERGE \| INS_NO_WALK_ON \| INS_ABOVE_FLOOR_ONLY);	352	return true;
495	op->head = prev, last_more->more = op, last_more = op;	353
		354	default:
		355	if (!f.parse_error ("map file"))
		356	return false;
496	break;	357	break;
497	}	358	}
498		359
499	op = object::create ();	360	f.next ();
500	op->map = this;
501	}
502
503	op->destroy ();
504
505	#if 0
506	for (i = 0; i < width; i++)
507	for (j = 0; j < height; j++)
508	{
509	unique = 0;
510	/* check for unique items, or unique squares */
511	for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
512	{
513	if (QUERY_FLAG (otmp, FLAG_UNIQUE) \|\| QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
514	unique = 1;
515
516	if (!(mapflags & (MAP_OVERLAY \| MAP_PLAYER_UNIQUE) \|\| unique))
517	SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
518	}
519	}	361	}
520	#endif
521		362
522	return true;	363	return true;
523	}	364	}
524		365
525	void	366	void
526	maptile::activate ()	367	maptile::activate ()
527	{	368	{
528	if (!spaces)	369	if (spaces)
529	return;
530
531	for (mapspace *ms = spaces + size (); ms-- > spaces; )	370	for (mapspace *ms = spaces + size (); ms-- > spaces; )
532	for (object *op = ms->bot; op; op = op->above)	371	for (object *op = ms->bot; op; op = op->above)
533	op->activate (1);	372	op->activate_recursive ();
534	}	373	}
535		374
536	void	375	void
537	maptile::deactivate ()	376	maptile::deactivate ()
538	{	377	{
539	if (!spaces)	378	if (spaces)
540	return;
541
542	for (mapspace *ms = spaces + size (); ms-- > spaces; )	379	for (mapspace *ms = spaces + size (); ms-- > spaces; )
543	for (object *op = ms->bot; op; op = op->above)	380	for (object *op = ms->bot; op; op = op->above)
544	op->deactivate (1);	381	op->deactivate_recursive ();
545	}	382	}
546		383
547	bool	384	bool
548	maptile::save_objects (object_freezer &freezer, int flags)	385	maptile::_save_objects (object_freezer &f, int flags)
549	{	386	{
		387	coroapi::cede_to_tick ();
		388
550	if (flags & IO_HEADER)	389	if (flags & IO_HEADER)
551	save_header (freezer);	390	_save_header (f);
552		391
553	if (!spaces)	392	if (!spaces)
554	return false;	393	return false;
555		394
556	for (int i = 0; i < size (); ++i)	395	for (int i = 0; i < size (); ++i)
557	{	396	{
558	int unique = 0;	397	bool unique = 0;
		398
559	for (object *op = spaces [i].bot; op; op = op->above)	399	for (object *op = spaces [i].bot; op; op = op->above)
560	{	400	{
561	if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR])	401	unique \|= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
562	unique = 1;
563		402
564	if (!op->can_map_save ())	403	if (expect_false (!op->can_map_save ()))
565	continue;	404	continue;
566		405
567	if (unique \|\| op->flag [FLAG_UNIQUE])	406	if (expect_false (unique \|\| op->flag [FLAG_UNIQUE]))
568	{	407	{
569	if (flags & IO_UNIQUES)	408	if (flags & IO_UNIQUES)
570	save_object (freezer, op, 1);	409	op->write (f);
571	}	410	}
572	else if (flags & IO_OBJECTS)	411	else if (expect_true (flags & IO_OBJECTS))
573	save_object (freezer, op, 1);	412	op->write (f);
574	}	413	}
575	}	414	}
576		415
		416	coroapi::cede_to_tick ();
		417
577	return true;	418	return true;
578	}	419	}
579		420
580	bool	421	bool
581	maptile::load_objects (const char *path, bool skip_header)	422	maptile::_save_objects (const char *path, int flags)
582	{	423	{
583	object_thawer thawer (path);	424	object_freezer freezer;
584		425
585	if (!thawer)	426	if (!_save_objects (freezer, flags))
586	return false;	427	return false;
587		428
588	if (skip_header)
589	for (;;)
590	{
591	keyword kw = thawer.get_kv ();
592
593	if (kw == KW_end)
594	break;
595
596	thawer.skip_kv (kw);
597	}
598
599	return load_objects (thawer);
600	}
601
602	bool
603	maptile::save_objects (const char *path, int flags)
604	{
605	object_freezer freezer;
606
607	if (!save_objects (freezer, flags))
608	return false;
609
610	return freezer.save (path);	429	return freezer.save (path);
611	}	430	}
612		431
613	maptile::maptile ()	432	maptile::maptile ()
614	{	433	{
615	in_memory = MAP_SWAPPED;	434	in_memory = MAP_SWAPPED;
616		435
617	/* The maps used to pick up default x and y values from the	436	/* The maps used to pick up default x and y values from the
618	* map archetype. Mimic that behaviour.	437	* map archetype. Mimic that behaviour.
619	*/	438	*/
620	width = 16;	439	width = 16;
621	height = 16;	440	height = 16;
622	reset_timeout = 0;
623	timeout = 300;	441	timeout = 300;
624	enter_x = 0;	442	max_nrof = 1000; // 1000 items of anything
625	enter_y = 0;	443	max_volume = 2000000; // 2m³
626	}	444	}
627		445
628	maptile::maptile (int w, int h)	446	maptile::maptile (int w, int h)
629	{	447	{
630	in_memory = MAP_SWAPPED;	448	in_memory = MAP_SWAPPED;
…		…
776	* This could be done in lex (like the object loader), but I think	594	* This could be done in lex (like the object loader), but I think
777	* currently, there are few enough fields this is not a big deal.	595	* currently, there are few enough fields this is not a big deal.
778	* MSW 2001-07-01	596	* MSW 2001-07-01
779	*/	597	*/
780	bool	598	bool
781	maptile::load_header (object_thawer &thawer)	599	maptile::_load_header (object_thawer &thawer)
782	{	600	{
783	char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], key = NULL, value, *end;
784	int msgpos = 0;
785	int maplorepos = 0;
786
787	for (;;)	601	for (;;)
788	{	602	{
789	keyword kw = thawer.get_kv ();
790
791	switch (kw)	603	switch (thawer.kw)
792	{	604	{
793	case KW_EOF:
794	LOG (llevError, "%s: end of file while reading map header, aborting header load.", &path);
795	return false;
796
797	case KW_end:
798	return true;
799
800	case KW_msg:	605	case KW_msg:
801	thawer.get_ml (KW_endmsg, msg);	606	thawer.get_ml (KW_endmsg, msg);
802	break;	607	break;
803		608
804	case KW_lore: // CF+ extension	609	case KW_lore: // CF+ extension
…		…
835	case KW_winddir: thawer.get (winddir); break;	640	case KW_winddir: thawer.get (winddir); break;
836	case KW_sky: thawer.get (sky); break;	641	case KW_sky: thawer.get (sky); break;
837		642
838	case KW_per_player: thawer.get (per_player); break;	643	case KW_per_player: thawer.get (per_player); break;
839	case KW_per_party: thawer.get (per_party); break;	644	case KW_per_party: thawer.get (per_party); break;
		645	case KW_no_reset: thawer.get (no_reset); break;
840		646
841	case KW_region: get_region_by_name (thawer.get_str ()); break;	647	case KW_region: default_region = region::find (thawer.get_str ()); break;
842	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;	648	case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
843		649
844	// old names new names	650	// old names new names
845	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;	651	case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
846	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;	652	case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
…		…
855	case KW_tile_path_1: thawer.get (tile_path [0]); break;	661	case KW_tile_path_1: thawer.get (tile_path [0]); break;
856	case KW_tile_path_2: thawer.get (tile_path [1]); break;	662	case KW_tile_path_2: thawer.get (tile_path [1]); break;
857	case KW_tile_path_3: thawer.get (tile_path [2]); break;	663	case KW_tile_path_3: thawer.get (tile_path [2]); break;
858	case KW_tile_path_4: thawer.get (tile_path [3]); break;	664	case KW_tile_path_4: thawer.get (tile_path [3]); break;
859		665
		666	case KW_ERROR:
		667	set_key_text (thawer.kw_str, thawer.value);
		668	break;
		669
		670	case KW_end:
		671	thawer.next ();
		672	return true;
		673
860	default:	674	default:
861	LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]);	675	if (!thawer.parse_error ("map", 0))
		676	return false;
862	break;	677	break;
863	}	678	}
		679
		680	thawer.next ();
864	}	681	}
865		682
866	abort ();	683	abort ();
867	}
868
869	bool
870	maptile::load_header (const char *path)
871	{
872	object_thawer thawer (path);
873
874	if (!thawer)
875	return false;
876
877	return load_header (thawer);
878	}	684	}
879		685
880	/******************************************************************************	686	/******************************************************************************
881	* This is the start of unique map handling code	687	* This is the start of unique map handling code
882	*****************************************************************************/	688	*****************************************************************************/
…		…
893	object *above = op->above;	699	object *above = op->above;
894		700
895	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))	701	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
896	unique = 1;	702	unique = 1;
897		703
898	if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))	704	if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) \|\| unique))
899	{	705	{
900	op->destroy_inv (false);	706	op->destroy_inv (false);
901	op->destroy ();	707	op->destroy ();
902	}	708	}
903		709
…		…
905	}	711	}
906	}	712	}
907	}	713	}
908		714
909	bool	715	bool
910	maptile::save_header (object_freezer &freezer)	716	maptile::_save_header (object_freezer &freezer)
911	{	717	{
912	#define MAP_OUT(k) freezer.put (KW_ ## k, k)	718	#define MAP_OUT(k) freezer.put (KW_ ## k, k)
913	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)	719	#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
914		720
915	MAP_OUT2 (arch, "map");	721	MAP_OUT2 (arch, "map");
…		…
917	if (name) MAP_OUT (name);	723	if (name) MAP_OUT (name);
918	MAP_OUT (swap_time);	724	MAP_OUT (swap_time);
919	MAP_OUT (reset_time);	725	MAP_OUT (reset_time);
920	MAP_OUT (reset_timeout);	726	MAP_OUT (reset_timeout);
921	MAP_OUT (fixed_resettime);	727	MAP_OUT (fixed_resettime);
		728	MAP_OUT (no_reset);
922	MAP_OUT (difficulty);	729	MAP_OUT (difficulty);
923		730
924	if (region) MAP_OUT2 (region, region->name);	731	if (default_region) MAP_OUT2 (region, default_region->name);
925		732
926	if (shopitems)	733	if (shopitems)
927	{	734	{
928	char shop[MAX_BUF];	735	char shop[MAX_BUF];
929	print_shop_string (this, shop);	736	print_shop_string (this, shop);
…		…
957	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);	764	if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
958	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);	765	if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
959	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);	766	if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
960	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);	767	if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
961		768
962	MAP_OUT2 (end, 0);	769	freezer.put (this);
		770	freezer.put (KW_end);
963		771
964	return true;	772	return true;
965	}	773	}
966		774
967	bool	775	bool
968	maptile::save_header (const char *path)	776	maptile::_save_header (const char *path)
969	{	777	{
970	object_freezer freezer;	778	object_freezer freezer;
971		779
972	if (!save_header (freezer))	780	if (!_save_header (freezer))
973	return false;	781	return false;
974		782
975	return freezer.save (path);	783	return freezer.save (path);
976	}	784	}
977		785
…		…
979	* Remove and free all objects in the given map.	787	* Remove and free all objects in the given map.
980	*/	788	*/
981	void	789	void
982	maptile::clear ()	790	maptile::clear ()
983	{	791	{
984	if (!spaces)	792	if (spaces)
985	return;	793	{
986
987	for (mapspace *ms = spaces + size (); ms-- > spaces; )	794	for (mapspace *ms = spaces + size (); ms-- > spaces; )
988	while (object *op = ms->bot)	795	while (object *op = ms->bot)
989	{	796	{
		797	// manually remove, as to not trigger anything
		798	if (ms->bot = op->above)
		799	ms->bot->below = 0;
		800
		801	op->flag [FLAG_REMOVED] = true;
		802
		803	object *head = op->head_ ();
990	if (op->head)	804	if (op == head)
991	op = op->head;	805	{
992
993	op->destroy_inv (false);	806	op->destroy_inv (false);
994	op->destroy ();	807	op->destroy ();
		808	}
		809	else if (head->map != op->map)
		810	{
		811	LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
		812	head->destroy ();
		813	}
		814	}
		815
		816	sfree0 (spaces, size ());
995	}	817	}
996
997	sfree (spaces, size ()), spaces = 0;
998		818
999	if (buttons)	819	if (buttons)
1000	free_objectlinkpt (buttons), buttons = 0;	820	free_objectlinkpt (buttons), buttons = 0;
		821
		822	sfree0 (regions, size ());
		823	delete [] regionmap; regionmap = 0;
1001	}	824	}
1002		825
1003	void	826	void
1004	maptile::clear_header ()	827	maptile::clear_header ()
1005	{	828	{
…		…
1035	maptile::do_destroy ()	858	maptile::do_destroy ()
1036	{	859	{
1037	attachable::do_destroy ();	860	attachable::do_destroy ();
1038		861
1039	clear ();	862	clear ();
		863	}
		864
		865	/* decay and destroy perishable items in a map */
		866	void
		867	maptile::do_decay_objects ()
		868	{
		869	if (!spaces)
		870	return;
		871
		872	for (mapspace *ms = spaces + size (); ms-- > spaces; )
		873	for (object above, op = ms->bot; op; op = above)
		874	{
		875	above = op->above;
		876
		877	bool destroy = 0;
		878
		879	// do not decay anything above unique floor tiles (yet :)
		880	if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
		881	break;
		882
		883	if (QUERY_FLAG (op, FLAG_IS_FLOOR)
		884	\|\| QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
		885	\|\| QUERY_FLAG (op, FLAG_UNIQUE)
		886	\|\| QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
		887	\|\| QUERY_FLAG (op, FLAG_UNPAID)
		888	\|\| op->is_alive ())
		889	; // do not decay
		890	else if (op->is_weapon ())
		891	{
		892	op->stats.dam--;
		893	if (op->stats.dam < 0)
		894	destroy = 1;
		895	}
		896	else if (op->is_armor ())
		897	{
		898	op->stats.ac--;
		899	if (op->stats.ac < 0)
		900	destroy = 1;
		901	}
		902	else if (op->type == FOOD)
		903	{
		904	op->stats.food -= rndm (5, 20);
		905	if (op->stats.food < 0)
		906	destroy = 1;
		907	}
		908	else
		909	{
		910	int mat = op->materials;
		911
		912	if (mat & M_PAPER
		913	\|\| mat & M_LEATHER
		914	\|\| mat & M_WOOD
		915	\|\| mat & M_ORGANIC
		916	\|\| mat & M_CLOTH
		917	\|\| mat & M_LIQUID
		918	\|\| (mat & M_IRON && rndm (1, 5) == 1)
		919	\|\| (mat & M_GLASS && rndm (1, 2) == 1)
		920	\|\| ((mat & M_STONE \|\| mat & M_ADAMANT) && rndm (1, 10) == 1)
		921	\|\| ((mat & M_SOFT_METAL \|\| mat & M_BONE) && rndm (1, 3) == 1)
		922	\|\| (mat & M_ICE && temp > 32))
		923	destroy = 1;
		924	}
		925
		926	/* adjust overall chance below */
		927	if (destroy && rndm (0, 1))
		928	op->destroy ();
		929	}
1040	}	930	}
1041		931
1042	/*	932	/*
1043	* Updates every button on the map (by calling update_button() for them).	933	* Updates every button on the map (by calling update_button() for them).
1044	*/	934	*/
…		…
1092	if (QUERY_FLAG (op, FLAG_GENERATOR))	982	if (QUERY_FLAG (op, FLAG_GENERATOR))
1093	{	983	{
1094	total_exp += op->stats.exp;	984	total_exp += op->stats.exp;
1095		985
1096	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))	986	if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))
1097	total_exp += at->clone.stats.exp * 8;	987	total_exp += at->stats.exp * 8;
1098		988
1099	monster_cnt++;	989	monster_cnt++;
1100	}	990	}
1101	}	991	}
1102		992
…		…
1156	*/	1046	*/
1157	void	1047	void
1158	mapspace::update_ ()	1048	mapspace::update_ ()
1159	{	1049	{
1160	object tmp, last = 0;	1050	object tmp, last = 0;
1161	uint8 flags = 0, light = 0, anywhere = 0;	1051	uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1162	New_Face top, floor, *middle;
1163	object top_obj, floor_obj, *middle_obj;
1164	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;	1052	MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1165		1053
1166	middle = blank_face;	1054	//object *middle = 0;
1167	top = blank_face;	1055	//object *top = 0;
1168	floor = blank_face;	1056	//object *floor = 0;
1169		1057	// this seems to generate better code than using locals, above
1170	middle_obj = 0;	1058	object *&top = faces_obj[0] = 0;
1171	top_obj = 0;	1059	object *&middle = faces_obj[1] = 0;
1172	floor_obj = 0;	1060	object *&floor = faces_obj[2] = 0;
1173		1061
1174	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)	1062	for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1175	{	1063	{
1176	/* This could be made additive I guess (two lights better than	1064	/* This could be made additive I guess (two lights better than
1177	* one). But if so, it shouldn't be a simple additive - 2	1065	* one). But if so, it shouldn't be a simple additive - 2
…		…
1190	* Always put the player down for drawing.	1078	* Always put the player down for drawing.
1191	*/	1079	*/
1192	if (!tmp->invisible)	1080	if (!tmp->invisible)
1193	{	1081	{
1194	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))	1082	if ((tmp->type == PLAYER \|\| QUERY_FLAG (tmp, FLAG_MONSTER)))
1195	{
1196	top = tmp->face;
1197	top_obj = tmp;	1083	top = tmp;
1198	}
1199	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1084	else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1200	{	1085	{
1201	/* If we got a floor, that means middle and top were below it,	1086	/* If we got a floor, that means middle and top were below it,
1202	* so should not be visible, so we clear them.	1087	* so should not be visible, so we clear them.
1203	*/	1088	*/
1204	middle = blank_face;	1089	middle = 0;
1205	top = blank_face;	1090	top = 0;
1206	floor = tmp->face;
1207	floor_obj = tmp;	1091	floor = tmp;
1208	}	1092	}
1209	/* Flag anywhere have high priority */	1093	/* Flag anywhere have high priority */
1210	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))	1094	else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1211	{	1095	{
1212	middle = tmp->face;
1213
1214	middle_obj = tmp;	1096	middle = tmp;
1215	anywhere = 1;	1097	anywhere = 1;
1216	}	1098	}
1217	/* Find the highest visible face around. If equal	1099	/* Find the highest visible face around. If equal
1218	* visibilities, we still want the one nearer to the	1100	* visibilities, we still want the one nearer to the
1219	* top	1101	* top
1220	*/	1102	*/
1221	else if (middle == blank_face \|\| (tmp->face->visibility > middle->visibility && !anywhere))	1103	else if (!middle \|\| (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1222	{
1223	middle = tmp->face;
1224	middle_obj = tmp;	1104	middle = tmp;
1225	}
1226	}	1105	}
1227		1106
1228	if (tmp == tmp->above)	1107	if (tmp == tmp->above)
1229	{	1108	{
1230	LOG (llevError, "Error in structure of map\n");	1109	LOG (llevError, "Error in structure of map\n");
…		…
1265	* middle face. This should not happen, as we already have the	1144	* middle face. This should not happen, as we already have the
1266	* else statement above so middle should not get set. OTOH, it	1145	* else statement above so middle should not get set. OTOH, it
1267	* may be possible for the faces to match but be different objects.	1146	* may be possible for the faces to match but be different objects.
1268	*/	1147	*/
1269	if (top == middle)	1148	if (top == middle)
1270	middle = blank_face;	1149	middle = 0;
1271		1150
1272	/* There are three posibilities at this point:	1151	/* There are three posibilities at this point:
1273	* 1) top face is set, need middle to be set.	1152	* 1) top face is set, need middle to be set.
1274	* 2) middle is set, need to set top.	1153	* 2) middle is set, need to set top.
1275	* 3) neither middle or top is set - need to set both.	1154	* 3) neither middle or top is set - need to set both.
…		…
1280	/* Once we get to a floor, stop, since we already have a floor object */	1159	/* Once we get to a floor, stop, since we already have a floor object */
1281	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))	1160	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1282	break;	1161	break;
1283		1162
1284	/* If two top faces are already set, quit processing */	1163	/* If two top faces are already set, quit processing */
1285	if ((top != blank_face) && (middle != blank_face))	1164	if (top && middle)
1286	break;	1165	break;
1287		1166
1288	/* Only show visible faces, unless its the editor - show all */	1167	/* Only show visible faces */
1289	if (!tmp->invisible \|\| editor)	1168	if (!tmp->invisible)
1290	{	1169	{
1291	/* Fill in top if needed */	1170	/* Fill in top if needed */
1292	if (top == blank_face)	1171	if (!top)
1293	{	1172	{
1294	top = tmp->face;
1295	top_obj = tmp;	1173	top = tmp;
1296	if (top == middle)	1174	if (top == middle)
1297	middle = blank_face;	1175	middle = 0;
1298	}	1176	}
1299	else	1177	else
1300	{	1178	{
1301	/* top is already set - we should only get here if	1179	/* top is already set - we should only get here if
1302	* middle is not set	1180	* middle is not set
1303	*	1181	*
1304	* Set the middle face and break out, since there is nothing	1182	* Set the middle face and break out, since there is nothing
1305	* more to fill in. We don't check visiblity here, since	1183	* more to fill in. We don't check visiblity here, since
1306	*	1184	*
1307	*/	1185	*/
1308	if (tmp->face != top)	1186	if (tmp != top)
1309	{	1187	{
1310	middle = tmp->face;
1311	middle_obj = tmp;	1188	middle = tmp;
1312	break;	1189	break;
1313	}	1190	}
1314	}	1191	}
1315	}	1192	}
1316	}	1193	}
1317		1194
1318	if (middle == floor)	1195	if (middle == floor)
1319	middle = blank_face;	1196	middle = 0;
1320		1197
1321	if (top == middle)	1198	if (top == middle)
1322	middle = blank_face;	1199	middle = 0;
1323		1200
1324	faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;	1201	#if 0
1325	faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;	1202	faces_obj [0] = top;
1326	faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;	1203	faces_obj [1] = middle;
		1204	faces_obj [2] = floor;
		1205	#endif
1327	}	1206	}
1328		1207
1329	void	1208	uint64
1330	set_map_reset_time (maptile *map)	1209	mapspace::volume () const
1331	{	1210	{
1332	int timeout = map->reset_timeout;	1211	uint64 vol = 0;
1333		1212
1334	if (timeout <= 0)	1213	for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1335	timeout = MAP_DEFAULTRESET;	1214	vol += op->volume ();
1336	if (timeout >= MAP_MAXRESET)
1337	timeout = MAP_MAXRESET;
1338		1215
1339	map->reset_time = time (0) + timeout;	1216	return vol;
1340	}	1217	}
1341		1218
1342	/* this updates the orig_map->tile_map[tile_num] value after loading	1219	bool
1343	* the map. It also takes care of linking back the freshly loaded	1220	maptile::tile_available (int dir, bool load)
1344	* maps tile_map values if it tiles back to this one. It returns
1345	* the value of orig_map->tile_map[tile_num]. It really only does this
1346	* so that it is easier for calling functions to verify success.
1347	*/
1348	static maptile *
1349	load_and_link_tiled_map (maptile *orig_map, int tile_num)
1350	{	1221	{
1351	maptile *mp = orig_map->find_map (orig_map->tile_path[tile_num]);	1222	if (!tile_path[dir])
1352	mp->load ();	1223	return 0;
1353		1224
1354	int dest_tile = (tile_num + 2) % 4;	1225	if (tile_map[dir] && (!load \|\| tile_map[dir]->in_memory == MAP_ACTIVE))
		1226	return 1;
1355		1227
1356	orig_map->tile_map[tile_num] = mp;	1228	if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
		1229	return 1;
1357		1230
1358	/* need to do a strcmp here as the orig_map->path is not a shared string */
1359	if (orig_map->tile_map[tile_num]->tile_path[dest_tile] && orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1360	orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1361
1362	return mp;	1231	return 0;
1363	}	1232	}
1364		1233
1365	/* this returns TRUE if the coordinates (x,y) are out of	1234	/* this returns TRUE if the coordinates (x,y) are out of
1366	* map m. This function also takes into account any	1235	* map m. This function also takes into account any
1367	* tiling considerations, loading adjacant maps as needed.	1236	* tiling considerations, loading adjacant maps as needed.
…		…
1380	if (!m)	1249	if (!m)
1381	return 0;	1250	return 0;
1382		1251
1383	if (x < 0)	1252	if (x < 0)
1384	{	1253	{
1385	if (!m->tile_path[3])	1254	if (!m->tile_available (3))
1386	return 1;	1255	return 1;
1387		1256
1388	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1389	load_and_link_tiled_map (m, 3);
1390
1391	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);	1257	return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1392	}	1258	}
1393		1259
1394	if (x >= m->width)	1260	if (x >= m->width)
1395	{	1261	{
1396	if (!m->tile_path[1])	1262	if (!m->tile_available (1))
1397	return 1;	1263	return 1;
1398		1264
1399	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1400	load_and_link_tiled_map (m, 1);
1401
1402	return out_of_map (m->tile_map[1], x - m->width, y);	1265	return out_of_map (m->tile_map[1], x - m->width, y);
1403	}	1266	}
1404		1267
1405	if (y < 0)	1268	if (y < 0)
1406	{	1269	{
1407	if (!m->tile_path[0])	1270	if (!m->tile_available (0))
1408	return 1;	1271	return 1;
1409		1272
1410	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1411	load_and_link_tiled_map (m, 0);
1412
1413	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);	1273	return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1414	}	1274	}
1415		1275
1416	if (y >= m->height)	1276	if (y >= m->height)
1417	{	1277	{
1418	if (!m->tile_path[2])	1278	if (!m->tile_available (2))
1419	return 1;	1279	return 1;
1420
1421	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1422	load_and_link_tiled_map (m, 2);
1423		1280
1424	return out_of_map (m->tile_map[2], x, y - m->height);	1281	return out_of_map (m->tile_map[2], x, y - m->height);
1425	}	1282	}
1426		1283
1427	/* Simple case - coordinates are within this local	1284	/* Simple case - coordinates are within this local
…		…
1432		1289
1433	/* This is basically the same as out_of_map above, but	1290	/* This is basically the same as out_of_map above, but
1434	* instead we return NULL if no map is valid (coordinates	1291	* instead we return NULL if no map is valid (coordinates
1435	* out of bounds and no tiled map), otherwise it returns	1292	* out of bounds and no tiled map), otherwise it returns
1436	* the map as that the coordinates are really on, and	1293	* the map as that the coordinates are really on, and
1437	* updates x and y to be the localized coordinates.	1294	* updates x and y to be the localised coordinates.
1438	* Using this is more efficient of calling out_of_map	1295	* Using this is more efficient of calling out_of_map
1439	* and then figuring out what the real map is	1296	* and then figuring out what the real map is
1440	*/	1297	*/
1441	maptile *	1298	maptile *
1442	get_map_from_coord (maptile m, sint16 x, sint16 *y)	1299	maptile::xy_find (sint16 &x, sint16 &y)
1443	{	1300	{
1444	if (*x < 0)	1301	if (x < 0)
1445	{	1302	{
1446	if (!m->tile_path[3])	1303	if (!tile_available (3))
1447	return 0;	1304	return 0;
1448		1305
1449	if (!m->tile_map[3] \|\| m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1450	load_and_link_tiled_map (m, 3);
1451
1452	*x += m->tile_map[3]->width;	1306	x += tile_map[3]->width;
1453	return (get_map_from_coord (m->tile_map[3], x, y));	1307	return tile_map[3]->xy_find (x, y);
1454	}	1308	}
1455		1309
1456	if (*x >= m->width)	1310	if (x >= width)
1457	{	1311	{
1458	if (!m->tile_path[1])	1312	if (!tile_available (1))
1459	return 0;	1313	return 0;
1460		1314
1461	if (!m->tile_map[1] \|\| m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1462	load_and_link_tiled_map (m, 1);
1463
1464	*x -= m->width;	1315	x -= width;
1465	return (get_map_from_coord (m->tile_map[1], x, y));	1316	return tile_map[1]->xy_find (x, y);
1466	}	1317	}
1467		1318
1468	if (*y < 0)	1319	if (y < 0)
1469	{	1320	{
1470	if (!m->tile_path[0])	1321	if (!tile_available (0))
1471	return 0;	1322	return 0;
1472		1323
1473	if (!m->tile_map[0] \|\| m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1474	load_and_link_tiled_map (m, 0);
1475
1476	*y += m->tile_map[0]->height;	1324	y += tile_map[0]->height;
1477	return (get_map_from_coord (m->tile_map[0], x, y));	1325	return tile_map[0]->xy_find (x, y);
1478	}	1326	}
1479		1327
1480	if (*y >= m->height)	1328	if (y >= height)
1481	{	1329	{
1482	if (!m->tile_path[2])	1330	if (!tile_available (2))
1483	return 0;	1331	return 0;
1484		1332
1485	if (!m->tile_map[2] \|\| m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1486	load_and_link_tiled_map (m, 2);
1487
1488	*y -= m->height;	1333	y -= height;
1489	return (get_map_from_coord (m->tile_map[2], x, y));	1334	return tile_map[2]->xy_find (x, y);
1490	}	1335	}
1491		1336
1492	/* Simple case - coordinates are within this local	1337	/* Simple case - coordinates are within this local
1493	* map.	1338	* map.
1494	*/	1339	*/
1495
1496	m->last_access = runtime;
1497	return m;	1340	return this;
1498	}	1341	}
1499		1342
1500	/**	1343	/**
1501	* Return whether map2 is adjacent to map1. If so, store the distance from	1344	* Return whether map2 is adjacent to map1. If so, store the distance from
1502	* map1 to map2 in dx/dy.	1345	* map1 to map2 in dx/dy.
1503	*/	1346	*/
1504	static int	1347	int
1505	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)	1348	adjacent_map (const maptile map1, const maptile map2, int dx, int dy)
1506	{	1349	{
1507	if (!map1 \|\| !map2)	1350	if (!map1 \|\| !map2)
1508	return 0;	1351	return 0;
1509		1352
		1353	//TODO: this doesn't actually check correctly when intermediate maps are not loaded
		1354	//fix: compare paths instead (this is likely faster, too!)
1510	if (map1 == map2)	1355	if (map1 == map2)
1511	{	1356	{
1512	*dx = 0;	1357	*dx = 0;
1513	*dy = 0;	1358	*dy = 0;
1514	}	1359	}
…		…
1574	}	1419	}
1575	else	1420	else
1576	return 0;	1421	return 0;
1577		1422
1578	return 1;	1423	return 1;
		1424	}
		1425
		1426	maptile *
		1427	maptile::xy_load (sint16 &x, sint16 &y)
		1428	{
		1429	maptile *map = xy_find (x, y);
		1430
		1431	if (map)
		1432	map->load_sync ();
		1433
		1434	return map;
		1435	}
		1436
		1437	maptile *
		1438	get_map_from_coord (maptile m, sint16 x, sint16 *y)
		1439	{
		1440	return m->xy_load (x, y);
1579	}	1441	}
1580		1442
1581	/* From map.c	1443	/* From map.c
1582	* This is used by get_player to determine where the other	1444	* This is used by get_player to determine where the other
1583	* creature is. get_rangevector takes into account map tiling,	1445	* creature is. get_rangevector takes into account map tiling,
1584	* so you just can not look the the map coordinates and get the	1446	* so you just can not look the the map coordinates and get the
1585	* righte value. distance_x/y are distance away, which	1447	* righte value. distance_x/y are distance away, which
1586	* can be negativbe. direction is the crossfire direction scheme	1448	* can be negative. direction is the crossfire direction scheme
1587	* that the creature should head. part is the part of the	1449	* that the creature should head. part is the part of the
1588	* monster that is closest.	1450	* monster that is closest.
1589	*	1451	*
1590	* get_rangevector looks at op1 and op2, and fills in the	1452	* get_rangevector looks at op1 and op2, and fills in the
1591	* structure for op1 to get to op2.	1453	* structure for op1 to get to op2.
…		…
1602	get_rangevector (object op1, object op2, rv_vector * retval, int flags)	1464	get_rangevector (object op1, object op2, rv_vector * retval, int flags)
1603	{	1465	{
1604	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))	1466	if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1605	{	1467	{
1606	/* be conservative and fill in _some_ data */	1468	/* be conservative and fill in _some_ data */
1607	retval->distance = 100000;	1469	retval->distance = 10000;
1608	retval->distance_x = 32767;	1470	retval->distance_x = 10000;
1609	retval->distance_y = 32767;	1471	retval->distance_y = 10000;
1610	retval->direction = 0;	1472	retval->direction = 0;
1611	retval->part = 0;	1473	retval->part = 0;
1612	}	1474	}
1613	else	1475	else
1614	{	1476	{
…		…
1619		1481
1620	best = op1;	1482	best = op1;
1621	/* If this is multipart, find the closest part now */	1483	/* If this is multipart, find the closest part now */
1622	if (!(flags & 0x1) && op1->more)	1484	if (!(flags & 0x1) && op1->more)
1623	{	1485	{
1624	object *tmp;
1625	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;	1486	int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1626		1487
1627	/* we just take the offset of the piece to head to figure	1488	/* we just take the offset of the piece to head to figure
1628	* distance instead of doing all that work above again	1489	* distance instead of doing all that work above again
1629	* since the distance fields we set above are positive in the	1490	* since the distance fields we set above are positive in the
1630	* same axis as is used for multipart objects, the simply arithmetic	1491	* same axis as is used for multipart objects, the simply arithmetic
1631	* below works.	1492	* below works.
1632	*/	1493	*/
1633	for (tmp = op1->more; tmp != NULL; tmp = tmp->more)	1494	for (object *tmp = op1->more; tmp; tmp = tmp->more)
1634	{	1495	{
1635	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +	1496	tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1636	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);	1497	(op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1637	if (tmpi < best_distance)	1498	if (tmpi < best_distance)
1638	{	1499	{
1639	best_distance = tmpi;	1500	best_distance = tmpi;
1640	best = tmp;	1501	best = tmp;
1641	}	1502	}
1642	}	1503	}
		1504
1643	if (best != op1)	1505	if (best != op1)
1644	{	1506	{
1645	retval->distance_x += op1->x - best->x;	1507	retval->distance_x += op1->x - best->x;
1646	retval->distance_y += op1->y - best->y;	1508	retval->distance_y += op1->y - best->y;
1647	}	1509	}
1648	}	1510	}
		1511
1649	retval->part = best;	1512	retval->part = best;
1650	retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);	1513	retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1651	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1514	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1652	}	1515	}
1653	}	1516	}
1654		1517
1655	/* this is basically the same as get_rangevector above, but instead of	1518	/* this is basically the same as get_rangevector above, but instead of
…		…
1660	* flags has no meaning for this function at this time - I kept it in to	1523	* flags has no meaning for this function at this time - I kept it in to
1661	* be more consistant with the above function and also in case they are needed	1524	* be more consistant with the above function and also in case they are needed
1662	* for something in the future. Also, since no object is pasted, the best	1525	* for something in the future. Also, since no object is pasted, the best
1663	* field of the rv_vector is set to NULL.	1526	* field of the rv_vector is set to NULL.
1664	*/	1527	*/
1665
1666	void	1528	void
1667	get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector * retval, int flags)	1529	get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags)
1668	{	1530	{
1669	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))	1531	if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1670	{	1532	{
1671	/* be conservative and fill in _some_ data */	1533	/* be conservative and fill in _some_ data */
1672	retval->distance = 100000;	1534	retval->distance = 100000;
…		…
1679	{	1541	{
1680	retval->distance_x += op2->x - x;	1542	retval->distance_x += op2->x - x;
1681	retval->distance_y += op2->y - y;	1543	retval->distance_y += op2->y - y;
1682		1544
1683	retval->part = NULL;	1545	retval->part = NULL;
1684	retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);	1546	retval->distance = idistance (retval->distance_x, retval->distance_y);
1685	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);	1547	retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1686	}	1548	}
1687	}	1549	}
1688		1550
1689	/* Returns true of op1 and op2 are effectively on the same map	1551	/* Returns true of op1 and op2 are effectively on the same map
…		…
1709	op->remove ();	1571	op->remove ();
1710		1572
1711	return insert_ob_in_map_at (op, this, originator, flags, x, y);	1573	return insert_ob_in_map_at (op, this, originator, flags, x, y);
1712	}	1574	}
1713		1575
		1576	region *
		1577	maptile::region (int x, int y) const
		1578	{
		1579	if (regions
		1580	&& regionmap
		1581	&& !OUT_OF_REAL_MAP (this, x, y))
		1582	if (struct region reg = regionmap [regions [y width + x]])
		1583	return reg;
		1584
		1585	if (default_region)
		1586	return default_region;
		1587
		1588	return ::region::default_region ();
		1589	}
		1590
		1591	/* picks a random object from a style map.
		1592	*/
		1593	object *
		1594	maptile::pick_random_object (rand_gen &gen) const
		1595	{
		1596	/* while returning a null object will result in a crash, that
		1597	* is actually preferable to an infinite loop. That is because
		1598	* most servers will automatically restart in case of crash.
		1599	* Change the logic on getting the random space - shouldn't make
		1600	* any difference, but this seems clearer to me.
		1601	*/
		1602	for (int i = 1000; --i;)
		1603	{
		1604	object *pick = at (gen (width), gen (height)).bot;
		1605
		1606	// do not prefer big monsters just because they are big.
		1607	if (pick && pick->is_head ())
		1608	return pick->head_ ();
		1609	}
		1610
		1611	// instead of crashing in the unlikely(?) case, try to return something
		1612	return archetype::find ("bug");
		1613	}
		1614
		1615	void
		1616	maptile::play_sound (faceidx sound, int x, int y) const
		1617	{
		1618	if (!sound)
		1619	return;
		1620
		1621	for_all_players (pl)
		1622	if (pl->ob->map == this)
		1623	if (client *ns = pl->ns)
		1624	{
		1625	int dx = x - pl->ob->x;
		1626	int dy = y - pl->ob->y;
		1627
		1628	int distance = idistance (dx, dy);
		1629
		1630	if (distance <= MAX_SOUND_DISTANCE)
		1631	ns->play_sound (sound, dx, dy);
		1632	}
		1633	}
		1634

Diff Legend

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

Comparing deliantra/server/common/map.C (file contents): Revision 1.56 by root, Sat Dec 30 10:16:10 2006 UTC vs. Revision 1.138 by root, Sun May 4 14:12:37 2008 UTC

Diff Legend

Comparing deliantra/server/common/map.C (file contents):
Revision 1.56 by root, Sat Dec 30 10:16:10 2006 UTC vs.
Revision 1.138 by root, Sun May 4 14:12:37 2008 UTC