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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.182 by root, Mon Aug 20 18:11:02 2007 UTC vs.
Revision 1.203 by root, Fri Apr 11 13:59:05 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;
40	const uint64 UUID_SKIP = 1<<19;	39	static const uint64 UUID_SKIP = 1<<19;
41		40
42	objectvec objects;	41	objectvec objects;
43	activevec actives;	42	activevec actives;
44		43
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,	44	short freearr_x[SIZEOFFREE] = {
		45	0,
		46	0, 1, 1, 1, 0, -1, -1, -1,
		47	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	48	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	};	49	};
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,	50	short freearr_y[SIZEOFFREE] = {
		51	0,
		52	-1, -1, 0, 1, 1, 1, 0, -1,
		53	-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	54	-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	};	55	};
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,	56	int maxfree[SIZEOFFREE] = {
		57	0,
		58	9, 10, 13, 14, 17, 18, 21, 22,
		59	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	60	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	};	61	};
54	int freedir[SIZEOFFREE] = {	62	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,	63	0,
		64	1, 2, 3, 4, 5, 6, 7, 8,
		65	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	66	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	};	67	};
58		68
59	static void	69	static void
60	write_uuid (void)	70	write_uuid (uval64 skip, bool sync)
61	{	71	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	72	CALL_BEGIN (2);
63		73	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	74	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	75	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		76	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	}	77	}
79		78
80	static void	79	static void
81	read_uuid (void)	80	read_uuid (void)
82	{	81	{
…		…
89	if (!(fp = fopen (filename, "r")))	88	if (!(fp = fopen (filename, "r")))
90	{	89	{
91	if (errno == ENOENT)	90	if (errno == ENOENT)
92	{	91	{
93	LOG (llevInfo, "RESET uid to 1\n");	92	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	93	UUID::cur.seq = 0;
95	write_uuid ();	94	write_uuid (UUID_SKIP, true);
96	return;	95	return;
97	}	96	}
98		97
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	98	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	99	_exit (1);
101	}	100	}
102		101
103	int version;	102	UUID::BUF buf;
104	unsigned long long uid;	103	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) \|\| version != 1)	104	fgets (buf, sizeof (buf), fp);
		105
		106	if (!UUID::cur.parse (buf))
106	{	107	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	108	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	109	_exit (1);
109	}	110	}
110		111
111	uuid.seq = uid;	112	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	113
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	114	write_uuid (UUID_SKIP, true);
114	fclose (fp);	115	fclose (fp);
115	}	116	}
116		117
117	UUID	118	UUID
118	gen_uuid ()	119	UUID::gen ()
119	{	120	{
120	UUID uid;	121	UUID uid;
121		122
122	uid.seq = ++uuid.seq;	123	uid.seq = ++cur.seq;
123		124
124	if (!(uuid.seq & (UUID_SKIP - 1)))	125	if (expect_false (!(cur.seq & (UUID_SKIP - 1))))
125	write_uuid ();	126	write_uuid (UUID_SKIP, false);
126		127
127	return uid;	128	return uid;
128	}	129	}
129		130
130	void	131	void
131	init_uuid ()	132	UUID::init ()
132	{	133	{
133	read_uuid ();	134	read_uuid ();
134	}	135	}
135		136
136	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	137	/* 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	255	/* This is really a spellbook check - really, we should
255	* check all objects in the inventory.	256	* check all objects in the inventory.
256	*/	257	*/
257	if (ob1->inv \|\| ob2->inv)	258	if (ob1->inv \|\| ob2->inv)
258	{	259	{
259	/* if one object has inventory but the other doesn't, not equiv */	260	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) \|\| (ob2->inv && !ob1->inv))	261	return 0; /* inventories differ in length */
261	return 0;
262		262
263	/* Now check to see if the two inventory objects could merge */	263	if (ob1->inv->below \|\| ob2->inv->below)
		264	return 0; /* more than one object in inv */
		265
264	if (!object::can_merge (ob1->inv, ob2->inv))	266	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	267	return 0; /* inventory objexts differ */
266		268
267	/* inventory ok - still need to check rest of this object to see	269	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	270	* if it is valid.
269	*/	271	*/
270	}	272	}
…		…
305	{	307	{
306	ob1->optimise ();	308	ob1->optimise ();
307	ob2->optimise ();	309	ob2->optimise ();
308		310
309	if (ob1->self \|\| ob2->self)	311	if (ob1->self \|\| ob2->self)
310	if (!cfperl_can_merge (ob1, ob2))	312	{
		313	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		314	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		315
		316	if (k1 != k2)
311	return 0;	317	return 0;
		318	else if (k1 == 0)
		319	return 1;
		320	else if (!cfperl_can_merge (ob1, ob2))
		321	return 0;
		322	}
312	}	323	}
313		324
314	/* Everything passes, must be OK. */	325	/* Everything passes, must be OK. */
315	return 1;	326	return 1;
316	}	327	}
…		…
374	/*	385	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	386	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	387	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	388	* If it's not a multi-object, it is returned.
378	*/	389	*/
379
380	object *	390	object *
381	get_nearest_part (object op, const object pl)	391	get_nearest_part (object op, const object pl)
382	{	392	{
383	object tmp, closest;	393	object tmp, closest;
384	int last_dist, i;	394	int last_dist, i;
…		…
420	break;	430	break;
421		431
422	return op;	432	return op;
423	}	433	}
424		434
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}
430
431	/*	435	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	436	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	437	* skill and experience objects.
		438	* ACTUALLY NO! investigate! TODO
434	*/	439	*/
435	void	440	void
436	object::set_owner (object *owner)	441	object::set_owner (object *owner)
437	{	442	{
		443	// allow objects which own objects
438	if (!owner)	444	if (owner)
439	return;
440
441	/* next line added to allow objects which own objects */
442	/* Add a check for ownercounts in here, as I got into an endless loop
443	* with the fireball owning a poison cloud which then owned the
444	* fireball. I believe that was caused by one of the objects getting
445	* freed and then another object replacing it. Since the ownercounts
446	* didn't match, this check is valid and I believe that cause is valid.
447	*/
448	while (owner->owner)	445	while (owner->owner)
449	owner = owner->owner;	446	owner = owner->owner;
		447
		448	if (flag [FLAG_FREED])
		449	{
		450	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		451	return;
		452	}
450		453
451	this->owner = owner;	454	this->owner = owner;
452	}	455	}
453		456
454	int	457	int
…		…
586	object::copy_to (object *dst)	589	object::copy_to (object *dst)
587	{	590	{
588	dst = this;	591	dst = this;
589		592
590	if (speed < 0)	593	if (speed < 0)
591	dst->speed_left = speed_left - rndm ();	594	dst->speed_left -= rndm ();
592		595
593	dst->set_speed (dst->speed);	596	dst->set_speed (dst->speed);
594	}	597	}
595		598
596	void	599	void
597	object::instantiate ()	600	object::instantiate ()
598	{	601	{
599	if (!uuid.seq) // HACK	602	if (!uuid.seq) // HACK
600	uuid = gen_uuid ();	603	uuid = UUID::gen ();
601		604
602	speed_left = -0.1f;	605	speed_left = -0.1f;
603	/* copy the body_info to the body_used - this is only really	606	/* copy the body_info to the body_used - this is only really
604	* need for monsters, but doesn't hurt to do it for everything.	607	* need for monsters, but doesn't hurt to do it for everything.
605	* by doing so, when a monster is created, it has good starting	608	* by doing so, when a monster is created, it has good starting
…		…
764	static int object_count;	767	static int object_count;
765		768
766	void object::link ()	769	void object::link ()
767	{	770	{
768	assert (!index);//D	771	assert (!index);//D
769	uuid = gen_uuid ();	772	uuid = UUID::gen ();
770	count = ++object_count;	773	count = ++object_count;
771		774
772	refcnt_inc ();	775	refcnt_inc ();
773	objects.insert (this);	776	objects.insert (this);
774	}	777	}
…		…
923		926
924	if (!freed_map)	927	if (!freed_map)
925	{	928	{
926	freed_map = new maptile;	929	freed_map = new maptile;
927		930
		931	freed_map->path = "<freed objects map>";
928	freed_map->name = "/internal/freed_objects_map";	932	freed_map->name = "/internal/freed_objects_map";
929	freed_map->width = 3;	933	freed_map->width = 3;
930	freed_map->height = 3;	934	freed_map->height = 3;
		935	freed_map->nodrop = 1;
931		936
932	freed_map->alloc ();	937	freed_map->alloc ();
933	freed_map->in_memory = MAP_IN_MEMORY;	938	freed_map->in_memory = MAP_IN_MEMORY;
934	}	939	}
935		940
…		…
1147	merge_ob (object op, object top)	1152	merge_ob (object op, object top)
1148	{	1153	{
1149	if (!op->nrof)	1154	if (!op->nrof)
1150	return 0;	1155	return 0;
1151		1156
1152	if (top)	1157	if (!top)
1153	for (top = op; top && top->above; top = top->above)	1158	for (top = op; top && top->above; top = top->above)
1154	;	1159	;
1155		1160
1156	for (; top; top = top->below)	1161	for (; top; top = top->below)
1157	{	1162	{
…		…
1238		1243
1239	object top, floor = NULL;	1244	object top, floor = NULL;
1240		1245
1241	op->remove ();	1246	op->remove ();
1242		1247
1243	if (out_of_map (m, op->x, op->y))
1244	{
1245	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1246	#ifdef MANY_CORES
1247	/* Better to catch this here, as otherwise the next use of this object
1248	* is likely to cause a crash. Better to find out where it is getting
1249	* improperly inserted.
1250	*/
1251	abort ();
1252	#endif
1253	return op;
1254	}
1255
1256	if (object *more = op->more)
1257	if (!insert_ob_in_map (more, m, originator, flag))
1258	return 0;
1259
1260	CLEAR_FLAG (op, FLAG_REMOVED);
1261
1262	/* Ideally, the caller figures this out. However, it complicates a lot	1248	/* Ideally, the caller figures this out. However, it complicates a lot
1263	* of areas of callers (eg, anything that uses find_free_spot would now	1249	* of areas of callers (eg, anything that uses find_free_spot would now
1264	* need extra work	1250	* need extra work
1265	*/	1251	*/
1266	if (!xy_normalise (m, op->x, op->y))	1252	if (!xy_normalise (m, op->x, op->y))
		1253	{
		1254	op->destroy ();
1267	return 0;	1255	return 0;
		1256	}
		1257
		1258	if (object *more = op->more)
		1259	if (!insert_ob_in_map (more, m, originator, flag))
		1260	return 0;
		1261
		1262	CLEAR_FLAG (op, FLAG_REMOVED);
1268		1263
1269	op->map = m;	1264	op->map = m;
1270	mapspace &ms = op->ms ();	1265	mapspace &ms = op->ms ();
1271		1266
1272	/* this has to be done after we translate the coordinates.	1267	/* this has to be done after we translate the coordinates.
…		…
1307	else	1302	else
1308	{	1303	{
1309	top = ms.bot;	1304	top = ms.bot;
1310		1305
1311	/* If there are other objects, then */	1306	/* If there are other objects, then */
1312	if ((!(flag & INS_MAP_LOAD)) && top)	1307	if (top)
1313	{	1308	{
1314	object *last = 0;	1309	object *last = 0;
1315		1310
1316	/*	1311	/*
1317	* If there are multiple objects on this space, we do some trickier handling.	1312	* If there are multiple objects on this space, we do some trickier handling.
…		…
1369	*/	1364	*/
1370	if (last && last->below && last != floor)	1365	if (last && last->below && last != floor)
1371	top = last->below;	1366	top = last->below;
1372	}	1367	}
1373	} /* If objects on this space */	1368	} /* If objects on this space */
1374	if (flag & INS_MAP_LOAD)
1375	top = ms.top;
1376		1369
1377	if (flag & INS_ABOVE_FLOOR_ONLY)	1370	if (flag & INS_ABOVE_FLOOR_ONLY)
1378	top = floor;	1371	top = floor;
1379		1372
1380	/* Top is the object that our object (op) is going to get inserted above.	1373	/* Top is the object that our object (op) is going to get inserted above.
…		…
1413	op->map->touch ();	1406	op->map->touch ();
1414	}	1407	}
1415		1408
1416	op->map->dirty = true;	1409	op->map->dirty = true;
1417		1410
1418	if (!(flag & INS_MAP_LOAD))
1419	if (object *pl = ms.player ())	1411	if (object *pl = ms.player ())
1420	pl->contr->ns->floorbox_update ();	1412	pl->contr->ns->floorbox_update ();
1421		1413
1422	/* If this object glows, it may affect lighting conditions that are	1414	/* If this object glows, it may affect lighting conditions that are
1423	* visible to others on this map. But update_all_los is really	1415	* visible to others on this map. But update_all_los is really
1424	* an inefficient way to do this, as it means los for all players	1416	* an inefficient way to do this, as it means los for all players
1425	* on the map will get recalculated. The players could very well	1417	* on the map will get recalculated. The players could very well
…		…
1962	* activate recursively a flag on an object inventory	1954	* activate recursively a flag on an object inventory
1963	*/	1955	*/
1964	void	1956	void
1965	flag_inv (object *op, int flag)	1957	flag_inv (object *op, int flag)
1966	{	1958	{
1967	if (op->inv)
1968	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1959	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1969	{	1960	{
1970	SET_FLAG (tmp, flag);	1961	SET_FLAG (tmp, flag);
1971	flag_inv (tmp, flag);	1962	flag_inv (tmp, flag);
1972	}	1963	}
1973	}	1964	}
1974		1965
1975	/*	1966	/*
1976	* deactivate recursively a flag on an object inventory	1967	* deactivate recursively a flag on an object inventory
1977	*/	1968	*/
1978	void	1969	void
1979	unflag_inv (object *op, int flag)	1970	unflag_inv (object *op, int flag)
1980	{	1971	{
1981	if (op->inv)
1982	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1972	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1983	{	1973	{
1984	CLEAR_FLAG (tmp, flag);	1974	CLEAR_FLAG (tmp, flag);
1985	unflag_inv (tmp, flag);	1975	unflag_inv (tmp, flag);
1986	}	1976	}
1987	}	1977	}
1988		1978
1989	/*	1979	/*
1990	* find_free_spot(object, map, x, y, start, stop) will search for	1980	* find_free_spot(object, map, x, y, start, stop) will search for
1991	* a spot at the given map and coordinates which will be able to contain	1981	* a spot at the given map and coordinates which will be able to contain
…		…
1993	* to search (see the freearr_x/y[] definition).	1983	* to search (see the freearr_x/y[] definition).
1994	* It returns a random choice among the alternatives found.	1984	* It returns a random choice among the alternatives found.
1995	* start and stop are where to start relative to the free_arr array (1,9	1985	* start and stop are where to start relative to the free_arr array (1,9
1996	* does all 4 immediate directions). This returns the index into the	1986	* does all 4 immediate directions). This returns the index into the
1997	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1987	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1998	* Note - this only checks to see if there is space for the head of the
1999	* object - if it is a multispace object, this should be called for all
2000	* pieces.
2001	* Note2: This function does correctly handle tiled maps, but does not	1988	* Note: This function does correctly handle tiled maps, but does not
2002	* inform the caller. However, insert_ob_in_map will update as	1989	* inform the caller. However, insert_ob_in_map will update as
2003	* necessary, so the caller shouldn't need to do any special work.	1990	* necessary, so the caller shouldn't need to do any special work.
2004	* Note - updated to take an object instead of archetype - this is necessary	1991	* Note - updated to take an object instead of archetype - this is necessary
2005	* because arch_blocked (now ob_blocked) needs to know the movement type	1992	* because arch_blocked (now ob_blocked) needs to know the movement type
2006	* to know if the space in question will block the object. We can't use	1993	* to know if the space in question will block the object. We can't use
…		…
2008	* customized, changed states, etc.	1995	* customized, changed states, etc.
2009	*/	1996	*/
2010	int	1997	int
2011	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)	1998	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
2012	{	1999	{
		2000	int altern[SIZEOFFREE];
2013	int index = 0, flag;	2001	int index = 0, flag;
2014	int altern[SIZEOFFREE];
2015		2002
2016	for (int i = start; i < stop; i++)	2003	for (int i = start; i < stop; i++)
2017	{	2004	{
2018	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2005	mapxy pos (m, x, y); pos.move (i);
2019	if (!flag)	2006
		2007	if (!pos.normalise ())
		2008	continue;
		2009
		2010	mapspace &ms = *pos;
		2011
		2012	if (ms.flags () & P_IS_ALIVE)
		2013	continue;
		2014
		2015	/* However, often
		2016	* ob doesn't have any move type (when used to place exits)
		2017	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2018	*/
		2019	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2020	{
2020	altern [index++] = i;	2021	altern [index++] = i;
		2022	continue;
		2023	}
2021		2024
2022	/* Basically, if we find a wall on a space, we cut down the search size.	2025	/* Basically, if we find a wall on a space, we cut down the search size.
2023	* In this way, we won't return spaces that are on another side of a wall.	2026	* In this way, we won't return spaces that are on another side of a wall.
2024	* This mostly work, but it cuts down the search size in all directions -	2027	* This mostly work, but it cuts down the search size in all directions -
2025	* if the space being examined only has a wall to the north and empty	2028	* if the space being examined only has a wall to the north and empty
2026	* spaces in all the other directions, this will reduce the search space	2029	* spaces in all the other directions, this will reduce the search space
2027	* to only the spaces immediately surrounding the target area, and	2030	* to only the spaces immediately surrounding the target area, and
2028	* won't look 2 spaces south of the target space.	2031	* won't look 2 spaces south of the target space.
2029	*/	2032	*/
2030	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2033	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2034	{
2031	stop = maxfree[i];	2035	stop = maxfree[i];
		2036	continue;
		2037	}
		2038
		2039	/* Note it is intentional that we check ob - the movement type of the
		2040	* head of the object should correspond for the entire object.
		2041	*/
		2042	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2043	continue;
		2044
		2045	if (ob->blocked (m, pos.x, pos.y))
		2046	continue;
		2047
		2048	altern [index++] = i;
2032	}	2049	}
2033		2050
2034	if (!index)	2051	if (!index)
2035	return -1;	2052	return -1;
2036		2053
…		…
2045	*/	2062	*/
2046	int	2063	int
2047	find_first_free_spot (const object ob, maptile m, int x, int y)	2064	find_first_free_spot (const object ob, maptile m, int x, int y)
2048	{	2065	{
2049	for (int i = 0; i < SIZEOFFREE; i++)	2066	for (int i = 0; i < SIZEOFFREE; i++)
2050	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2067	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2051	return i;	2068	return i;
2052		2069
2053	return -1;	2070	return -1;
2054	}	2071	}
2055		2072
…		…
2592	{	2609	{
2593	char flagdesc[512];	2610	char flagdesc[512];
2594	char info2[256 * 4];	2611	char info2[256 * 4];
2595	char *p = info;	2612	char *p = info;
2596		2613
2597	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2614	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2598	count, uuid.seq,	2615	count,
		2616	uuid.c_str (),
2599	&name,	2617	&name,
2600	title ? "\",title:\"" : "",	2618	title ? "\",title:\"" : "",
2601	title ? (const char *)title : "",	2619	title ? (const char *)title : "",
2602	flag_desc (flagdesc, 512), type);	2620	flag_desc (flagdesc, 512), type);
2603		2621

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.182 by root, Mon Aug 20 18:11:02 2007 UTC vs. Revision 1.203 by root, Fri Apr 11 13:59:05 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.182 by root, Mon Aug 20 18:11:02 2007 UTC vs.
Revision 1.203 by root, Fri Apr 11 13:59:05 2008 UTC