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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.185 by root, Fri Aug 24 01:23:29 2007 UTC vs.
Revision 1.204 by root, Fri Apr 11 17:01:52 2008 UTC

…		…
1	/*	1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.	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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,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	8	* Deliantra is free software: you can redistribute it and/or modify
9	* 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
10	* the Free Software Foundation, either version 3 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	*	20	*
21	* The authors can be reached via e-mail to <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	22	*/
23		23
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
26	variable. */	26	variable. */
…		…
33	#include <sproto.h>	33	#include <sproto.h>
34	#include <loader.h>	34	#include <loader.h>
35		35
36	#include <bitset>	36	#include <bitset>
37		37
38	int nrofallocobjects = 0;	38	UUID UUID::cur;
39	static UUID uuid;	39	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	40	static const uint64 UUID_GAP = 1<<19;
41		41
42	objectvec objects;	42	objectvec objects;
43	activevec actives;	43	activevec actives;
44		44
45	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	45	short freearr_x[SIZEOFFREE] = {
		46	0,
		47	0, 1, 1, 1, 0, -1, -1, -1,
		48	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	49	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
47	};	50	};
48	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	51	short freearr_y[SIZEOFFREE] = {
		52	0,
		53	-1, -1, 0, 1, 1, 1, 0, -1,
		54	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
49	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	55	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
50	};	56	};
51	int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,	57	int maxfree[SIZEOFFREE] = {
		58	0,
		59	9, 10, 13, 14, 17, 18, 21, 22,
		60	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
52	48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49	61	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
53	};	62	};
54	int freedir[SIZEOFFREE] = {	63	int freedir[SIZEOFFREE] = {
55	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	64	0,
		65	1, 2, 3, 4, 5, 6, 7, 8,
		66	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
56	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	67	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
57	};	68	};
58		69
59	static void	70	static void
60	write_uuid (void)	71	write_uuid (uval64 skip, bool sync)
61	{	72	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	73	CALL_BEGIN (2);
63		74	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	75	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	76	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		77	CALL_END;
67	FILE *fp;
68
69	if (!(fp = fopen (filename2, "w")))
70	{
71	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
72	return;
73	}
74
75	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
76	fclose (fp);
77	rename (filename2, filename1);
78	}	78	}
79		79
80	static void	80	static void
81	read_uuid (void)	81	read_uuid (void)
82	{	82	{
83	char filename[MAX_BUF];	83	char filename[MAX_BUF];
84		84
85	sprintf (filename, "%s/uuid", settings.localdir);	85	sprintf (filename, "%s/uuid", settings.localdir);
86		86
		87	seq_next_save = 0;
		88
87	FILE *fp;	89	FILE *fp;
88		90
89	if (!(fp = fopen (filename, "r")))	91	if (!(fp = fopen (filename, "r")))
90	{	92	{
91	if (errno == ENOENT)	93	if (errno == ENOENT)
92	{	94	{
93	LOG (llevInfo, "RESET uid to 1\n");	95	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	96	UUID::cur.seq = 0;
95	write_uuid ();	97	write_uuid (UUID_GAP, true);
96	return;	98	return;
97	}	99	}
98		100
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	101	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	102	_exit (1);
101	}	103	}
102		104
103	int version;	105	UUID::BUF buf;
104	unsigned long long uid;	106	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) \|\| version != 1)	107	fgets (buf, sizeof (buf), fp);
		108
		109	if (!UUID::cur.parse (buf))
106	{	110	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	111	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	112	_exit (1);
109	}	113	}
110		114
111	uuid.seq = uid;	115	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	116
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	117	write_uuid (UUID_GAP, true);
114	fclose (fp);	118	fclose (fp);
115	}	119	}
116		120
117	UUID	121	UUID
118	gen_uuid ()	122	UUID::gen ()
119	{	123	{
120	UUID uid;	124	UUID uid;
121		125
122	uid.seq = ++uuid.seq;	126	uid.seq = ++cur.seq;
123		127
124	if (!(uuid.seq & (UUID_SKIP - 1)))	128	if (expect_false (cur.seq >= seq_next_save))
125	write_uuid ();	129	{
		130	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		131	write_uuid (UUID_GAP, false);
		132	}
		133
126		134
127	return uid;	135	return uid;
128	}	136	}
129		137
130	void	138	void
131	init_uuid ()	139	UUID::init ()
132	{	140	{
133	read_uuid ();	141	read_uuid ();
134	}	142	}
135		143
136	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	144	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
…		…
254	/* This is really a spellbook check - really, we should	262	/* This is really a spellbook check - really, we should
255	* check all objects in the inventory.	263	* check all objects in the inventory.
256	*/	264	*/
257	if (ob1->inv \|\| ob2->inv)	265	if (ob1->inv \|\| ob2->inv)
258	{	266	{
259	/* if one object has inventory but the other doesn't, not equiv */	267	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) \|\| (ob2->inv && !ob1->inv))	268	return 0; /* inventories differ in length */
261	return 0;
262		269
263	/* Now check to see if the two inventory objects could merge */	270	if (ob1->inv->below \|\| ob2->inv->below)
		271	return 0; /* more than one object in inv */
		272
264	if (!object::can_merge (ob1->inv, ob2->inv))	273	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	274	return 0; /* inventory objexts differ */
266		275
267	/* inventory ok - still need to check rest of this object to see	276	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	277	* if it is valid.
269	*/	278	*/
270	}	279	}
…		…
305	{	314	{
306	ob1->optimise ();	315	ob1->optimise ();
307	ob2->optimise ();	316	ob2->optimise ();
308		317
309	if (ob1->self \|\| ob2->self)	318	if (ob1->self \|\| ob2->self)
310	if (!cfperl_can_merge (ob1, ob2))	319	{
		320	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		321	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		322
		323	if (k1 != k2)
311	return 0;	324	return 0;
		325	else if (k1 == 0)
		326	return 1;
		327	else if (!cfperl_can_merge (ob1, ob2))
		328	return 0;
		329	}
312	}	330	}
313		331
314	/* Everything passes, must be OK. */	332	/* Everything passes, must be OK. */
315	return 1;	333	return 1;
316	}	334	}
…		…
419	break;	437	break;
420		438
421	return op;	439	return op;
422	}	440	}
423		441
424	void
425	free_all_object_data ()
426	{
427	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
428	}
429
430	/*	442	/*
431	* Sets the owner and sets the skill and exp pointers to owner's current	443	* Sets the owner and sets the skill and exp pointers to owner's current
432	* skill and experience objects.	444	* skill and experience objects.
433	* ACTUALLY NO! investigate! TODO	445	* ACTUALLY NO! investigate! TODO
434	*/	446	*/
…		…
437	{	449	{
438	// allow objects which own objects	450	// allow objects which own objects
439	if (owner)	451	if (owner)
440	while (owner->owner)	452	while (owner->owner)
441	owner = owner->owner;	453	owner = owner->owner;
		454
		455	if (flag [FLAG_FREED])
		456	{
		457	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		458	return;
		459	}
442		460
443	this->owner = owner;	461	this->owner = owner;
444	}	462	}
445		463
446	int	464	int
…		…
587		605
588	void	606	void
589	object::instantiate ()	607	object::instantiate ()
590	{	608	{
591	if (!uuid.seq) // HACK	609	if (!uuid.seq) // HACK
592	uuid = gen_uuid ();	610	uuid = UUID::gen ();
593		611
594	speed_left = -0.1f;	612	speed_left = -0.1f;
595	/* copy the body_info to the body_used - this is only really	613	/* copy the body_info to the body_used - this is only really
596	* need for monsters, but doesn't hurt to do it for everything.	614	* need for monsters, but doesn't hurt to do it for everything.
597	* by doing so, when a monster is created, it has good starting	615	* by doing so, when a monster is created, it has good starting
…		…
756	static int object_count;	774	static int object_count;
757		775
758	void object::link ()	776	void object::link ()
759	{	777	{
760	assert (!index);//D	778	assert (!index);//D
761	uuid = gen_uuid ();	779	uuid = UUID::gen ();
762	count = ++object_count;	780	count = ++object_count;
763		781
764	refcnt_inc ();	782	refcnt_inc ();
765	objects.insert (this);	783	objects.insert (this);
766	}	784	}
…		…
915		933
916	if (!freed_map)	934	if (!freed_map)
917	{	935	{
918	freed_map = new maptile;	936	freed_map = new maptile;
919		937
		938	freed_map->path = "<freed objects map>";
920	freed_map->name = "/internal/freed_objects_map";	939	freed_map->name = "/internal/freed_objects_map";
921	freed_map->width = 3;	940	freed_map->width = 3;
922	freed_map->height = 3;	941	freed_map->height = 3;
		942	freed_map->nodrop = 1;
923		943
924	freed_map->alloc ();	944	freed_map->alloc ();
925	freed_map->in_memory = MAP_IN_MEMORY;	945	freed_map->in_memory = MAP_IN_MEMORY;
926	}	946	}
927		947
…		…
1139	merge_ob (object op, object top)	1159	merge_ob (object op, object top)
1140	{	1160	{
1141	if (!op->nrof)	1161	if (!op->nrof)
1142	return 0;	1162	return 0;
1143		1163
1144	if (top)	1164	if (!top)
1145	for (top = op; top && top->above; top = top->above)	1165	for (top = op; top && top->above; top = top->above)
1146	;	1166	;
1147		1167
1148	for (; top; top = top->below)	1168	for (; top; top = top->below)
1149	{	1169	{
…		…
1230		1250
1231	object top, floor = NULL;	1251	object top, floor = NULL;
1232		1252
1233	op->remove ();	1253	op->remove ();
1234		1254
1235	if (out_of_map (m, op->x, op->y))
1236	{
1237	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1238	#ifdef MANY_CORES
1239	/* Better to catch this here, as otherwise the next use of this object
1240	* is likely to cause a crash. Better to find out where it is getting
1241	* improperly inserted.
1242	*/
1243	abort ();
1244	#endif
1245	return op;
1246	}
1247
1248	if (object *more = op->more)
1249	if (!insert_ob_in_map (more, m, originator, flag))
1250	return 0;
1251
1252	CLEAR_FLAG (op, FLAG_REMOVED);
1253
1254	/* Ideally, the caller figures this out. However, it complicates a lot	1255	/* Ideally, the caller figures this out. However, it complicates a lot
1255	* of areas of callers (eg, anything that uses find_free_spot would now	1256	* of areas of callers (eg, anything that uses find_free_spot would now
1256	* need extra work	1257	* need extra work
1257	*/	1258	*/
1258	if (!xy_normalise (m, op->x, op->y))	1259	if (!xy_normalise (m, op->x, op->y))
		1260	{
		1261	op->destroy ();
1259	return 0;	1262	return 0;
		1263	}
		1264
		1265	if (object *more = op->more)
		1266	if (!insert_ob_in_map (more, m, originator, flag))
		1267	return 0;
		1268
		1269	CLEAR_FLAG (op, FLAG_REMOVED);
1260		1270
1261	op->map = m;	1271	op->map = m;
1262	mapspace &ms = op->ms ();	1272	mapspace &ms = op->ms ();
1263		1273
1264	/* this has to be done after we translate the coordinates.	1274	/* this has to be done after we translate the coordinates.
…		…
1299	else	1309	else
1300	{	1310	{
1301	top = ms.bot;	1311	top = ms.bot;
1302		1312
1303	/* If there are other objects, then */	1313	/* If there are other objects, then */
1304	if ((!(flag & INS_MAP_LOAD)) && top)	1314	if (top)
1305	{	1315	{
1306	object *last = 0;	1316	object *last = 0;
1307		1317
1308	/*	1318	/*
1309	* If there are multiple objects on this space, we do some trickier handling.	1319	* If there are multiple objects on this space, we do some trickier handling.
…		…
1361	*/	1371	*/
1362	if (last && last->below && last != floor)	1372	if (last && last->below && last != floor)
1363	top = last->below;	1373	top = last->below;
1364	}	1374	}
1365	} /* If objects on this space */	1375	} /* If objects on this space */
1366	if (flag & INS_MAP_LOAD)
1367	top = ms.top;
1368		1376
1369	if (flag & INS_ABOVE_FLOOR_ONLY)	1377	if (flag & INS_ABOVE_FLOOR_ONLY)
1370	top = floor;	1378	top = floor;
1371		1379
1372	/* Top is the object that our object (op) is going to get inserted above.	1380	/* Top is the object that our object (op) is going to get inserted above.
…		…
1405	op->map->touch ();	1413	op->map->touch ();
1406	}	1414	}
1407		1415
1408	op->map->dirty = true;	1416	op->map->dirty = true;
1409		1417
1410	if (!(flag & INS_MAP_LOAD))
1411	if (object *pl = ms.player ())	1418	if (object *pl = ms.player ())
1412	pl->contr->ns->floorbox_update ();	1419	pl->contr->ns->floorbox_update ();
1413		1420
1414	/* If this object glows, it may affect lighting conditions that are	1421	/* If this object glows, it may affect lighting conditions that are
1415	* visible to others on this map. But update_all_los is really	1422	* visible to others on this map. But update_all_los is really
1416	* an inefficient way to do this, as it means los for all players	1423	* an inefficient way to do this, as it means los for all players
1417	* on the map will get recalculated. The players could very well	1424	* on the map will get recalculated. The players could very well
…		…
1954	* activate recursively a flag on an object inventory	1961	* activate recursively a flag on an object inventory
1955	*/	1962	*/
1956	void	1963	void
1957	flag_inv (object *op, int flag)	1964	flag_inv (object *op, int flag)
1958	{	1965	{
1959	if (op->inv)
1960	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1966	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1961	{	1967	{
1962	SET_FLAG (tmp, flag);	1968	SET_FLAG (tmp, flag);
1963	flag_inv (tmp, flag);	1969	flag_inv (tmp, flag);
1964	}	1970	}
1965	}	1971	}
1966		1972
1967	/*	1973	/*
1968	* deactivate recursively a flag on an object inventory	1974	* deactivate recursively a flag on an object inventory
1969	*/	1975	*/
1970	void	1976	void
1971	unflag_inv (object *op, int flag)	1977	unflag_inv (object *op, int flag)
1972	{	1978	{
1973	if (op->inv)
1974	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1979	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1975	{	1980	{
1976	CLEAR_FLAG (tmp, flag);	1981	CLEAR_FLAG (tmp, flag);
1977	unflag_inv (tmp, flag);	1982	unflag_inv (tmp, flag);
1978	}	1983	}
1979	}	1984	}
1980		1985
1981	/*	1986	/*
1982	* find_free_spot(object, map, x, y, start, stop) will search for	1987	* find_free_spot(object, map, x, y, start, stop) will search for
1983	* a spot at the given map and coordinates which will be able to contain	1988	* a spot at the given map and coordinates which will be able to contain
…		…
1985	* to search (see the freearr_x/y[] definition).	1990	* to search (see the freearr_x/y[] definition).
1986	* It returns a random choice among the alternatives found.	1991	* It returns a random choice among the alternatives found.
1987	* start and stop are where to start relative to the free_arr array (1,9	1992	* start and stop are where to start relative to the free_arr array (1,9
1988	* does all 4 immediate directions). This returns the index into the	1993	* does all 4 immediate directions). This returns the index into the
1989	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1994	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1990	* Note - this only checks to see if there is space for the head of the
1991	* object - if it is a multispace object, this should be called for all
1992	* pieces.
1993	* Note2: This function does correctly handle tiled maps, but does not	1995	* Note: This function does correctly handle tiled maps, but does not
1994	* inform the caller. However, insert_ob_in_map will update as	1996	* inform the caller. However, insert_ob_in_map will update as
1995	* necessary, so the caller shouldn't need to do any special work.	1997	* necessary, so the caller shouldn't need to do any special work.
1996	* Note - updated to take an object instead of archetype - this is necessary	1998	* Note - updated to take an object instead of archetype - this is necessary
1997	* because arch_blocked (now ob_blocked) needs to know the movement type	1999	* because arch_blocked (now ob_blocked) needs to know the movement type
1998	* to know if the space in question will block the object. We can't use	2000	* to know if the space in question will block the object. We can't use
…		…
2000	* customized, changed states, etc.	2002	* customized, changed states, etc.
2001	*/	2003	*/
2002	int	2004	int
2003	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)	2005	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
2004	{	2006	{
		2007	int altern[SIZEOFFREE];
2005	int index = 0, flag;	2008	int index = 0, flag;
2006	int altern[SIZEOFFREE];
2007		2009
2008	for (int i = start; i < stop; i++)	2010	for (int i = start; i < stop; i++)
2009	{	2011	{
2010	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2012	mapxy pos (m, x, y); pos.move (i);
2011	if (!flag)	2013
		2014	if (!pos.normalise ())
		2015	continue;
		2016
		2017	mapspace &ms = *pos;
		2018
		2019	if (ms.flags () & P_IS_ALIVE)
		2020	continue;
		2021
		2022	/* However, often
		2023	* ob doesn't have any move type (when used to place exits)
		2024	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2025	*/
		2026	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2027	{
2012	altern [index++] = i;	2028	altern [index++] = i;
		2029	continue;
		2030	}
2013		2031
2014	/* Basically, if we find a wall on a space, we cut down the search size.	2032	/* Basically, if we find a wall on a space, we cut down the search size.
2015	* In this way, we won't return spaces that are on another side of a wall.	2033	* In this way, we won't return spaces that are on another side of a wall.
2016	* This mostly work, but it cuts down the search size in all directions -	2034	* This mostly work, but it cuts down the search size in all directions -
2017	* if the space being examined only has a wall to the north and empty	2035	* if the space being examined only has a wall to the north and empty
2018	* spaces in all the other directions, this will reduce the search space	2036	* spaces in all the other directions, this will reduce the search space
2019	* to only the spaces immediately surrounding the target area, and	2037	* to only the spaces immediately surrounding the target area, and
2020	* won't look 2 spaces south of the target space.	2038	* won't look 2 spaces south of the target space.
2021	*/	2039	*/
2022	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2040	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2041	{
2023	stop = maxfree[i];	2042	stop = maxfree[i];
		2043	continue;
		2044	}
		2045
		2046	/* Note it is intentional that we check ob - the movement type of the
		2047	* head of the object should correspond for the entire object.
		2048	*/
		2049	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2050	continue;
		2051
		2052	if (ob->blocked (m, pos.x, pos.y))
		2053	continue;
		2054
		2055	altern [index++] = i;
2024	}	2056	}
2025		2057
2026	if (!index)	2058	if (!index)
2027	return -1;	2059	return -1;
2028		2060
…		…
2037	*/	2069	*/
2038	int	2070	int
2039	find_first_free_spot (const object ob, maptile m, int x, int y)	2071	find_first_free_spot (const object ob, maptile m, int x, int y)
2040	{	2072	{
2041	for (int i = 0; i < SIZEOFFREE; i++)	2073	for (int i = 0; i < SIZEOFFREE; i++)
2042	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2074	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2043	return i;	2075	return i;
2044		2076
2045	return -1;	2077	return -1;
2046	}	2078	}
2047		2079
…		…
2584	{	2616	{
2585	char flagdesc[512];	2617	char flagdesc[512];
2586	char info2[256 * 4];	2618	char info2[256 * 4];
2587	char *p = info;	2619	char *p = info;
2588		2620
2589	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2621	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2590	count, uuid.seq,	2622	count,
		2623	uuid.c_str (),
2591	&name,	2624	&name,
2592	title ? "\",title:\"" : "",	2625	title ? "\",title:\"" : "",
2593	title ? (const char *)title : "",	2626	title ? (const char *)title : "",
2594	flag_desc (flagdesc, 512), type);	2627	flag_desc (flagdesc, 512), type);
2595		2628

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.185 by root, Fri Aug 24 01:23:29 2007 UTC vs. Revision 1.204 by root, Fri Apr 11 17:01:52 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.185 by root, Fri Aug 24 01:23:29 2007 UTC vs.
Revision 1.204 by root, Fri Apr 11 17:01:52 2008 UTC