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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.156 by root, Fri May 18 01:01:01 2007 UTC vs.
Revision 1.203 by root, Fri Apr 11 13:59:05 2008 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
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 2 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,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	20	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
27	variable. */	26	variable. */
34	#include <sproto.h>	33	#include <sproto.h>
35	#include <loader.h>	34	#include <loader.h>
36		35
37	#include <bitset>	36	#include <bitset>
38		37
39	int nrofallocobjects = 0;	38	UUID UUID::cur;
40	static UUID uuid;
41	const uint64 UUID_SKIP = 1<<19;	39	static const uint64 UUID_SKIP = 1<<19;
42		40
43	objectvec objects;	41	objectvec objects;
44	activevec actives;	42	activevec actives;
45		43
46	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,
47	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
48	};	49	};
49	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,
50	-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
51	};	55	};
52	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,
53	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
54	};	61	};
55	int freedir[SIZEOFFREE] = {	62	int freedir[SIZEOFFREE] = {
56	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,
57	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
58	};	67	};
59		68
60	static void	69	static void
61	write_uuid (void)	70	write_uuid (uval64 skip, bool sync)
62	{	71	{
63	char filename1[MAX_BUF], filename2[MAX_BUF];	72	CALL_BEGIN (2);
64		73	CALL_ARG_SV (newSVval64 (skip));
65	sprintf (filename1, "%s/uuid", settings.localdir);	74	CALL_ARG_SV (boolSV (sync));
66	sprintf (filename2, "%s/uuid~", settings.localdir);	75	CALL_CALL ("cf::write_uuid", G_DISCARD);
67		76	CALL_END;
68	FILE *fp;
69
70	if (!(fp = fopen (filename2, "w")))
71	{
72	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
73	return;
74	}
75
76	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
77	fclose (fp);
78	rename (filename2, filename1);
79	}	77	}
80		78
81	static void	79	static void
82	read_uuid (void)	80	read_uuid (void)
83	{	81	{
…		…
90	if (!(fp = fopen (filename, "r")))	88	if (!(fp = fopen (filename, "r")))
91	{	89	{
92	if (errno == ENOENT)	90	if (errno == ENOENT)
93	{	91	{
94	LOG (llevInfo, "RESET uid to 1\n");	92	LOG (llevInfo, "RESET uid to 1\n");
95	uuid.seq = 0;	93	UUID::cur.seq = 0;
96	write_uuid ();	94	write_uuid (UUID_SKIP, true);
97	return;	95	return;
98	}	96	}
99		97
100	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	98	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
101	_exit (1);	99	_exit (1);
102	}	100	}
103		101
104	int version;	102	UUID::BUF buf;
105	unsigned long long uid;	103	buf[0] = 0;
106	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) \|\| version != 1)	104	fgets (buf, sizeof (buf), fp);
		105
		106	if (!UUID::cur.parse (buf))
107	{	107	{
108	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	108	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
109	_exit (1);	109	_exit (1);
110	}	110	}
111		111
112	uuid.seq = uid;	112	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
113	write_uuid ();	113
114	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	114	write_uuid (UUID_SKIP, true);
115	fclose (fp);	115	fclose (fp);
116	}	116	}
117		117
118	UUID	118	UUID
119	gen_uuid ()	119	UUID::gen ()
120	{	120	{
121	UUID uid;	121	UUID uid;
122		122
123	uid.seq = ++uuid.seq;	123	uid.seq = ++cur.seq;
124		124
125	if (!(uuid.seq & (UUID_SKIP - 1)))	125	if (expect_false (!(cur.seq & (UUID_SKIP - 1))))
126	write_uuid ();	126	write_uuid (UUID_SKIP, false);
127		127
128	return uid;	128	return uid;
129	}	129	}
130		130
131	void	131	void
132	init_uuid ()	132	UUID::init ()
133	{	133	{
134	read_uuid ();	134	read_uuid ();
135	}	135	}
136		136
137	/* 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. */
…		…
255	/* This is really a spellbook check - really, we should	255	/* This is really a spellbook check - really, we should
256	* check all objects in the inventory.	256	* check all objects in the inventory.
257	*/	257	*/
258	if (ob1->inv \|\| ob2->inv)	258	if (ob1->inv \|\| ob2->inv)
259	{	259	{
260	/* if one object has inventory but the other doesn't, not equiv */	260	if (!(ob1->inv && ob2->inv))
261	if ((ob1->inv && !ob2->inv) \|\| (ob2->inv && !ob1->inv))	261	return 0; /* inventories differ in length */
262	return 0;
263		262
264	/* 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
265	if (!object::can_merge (ob1->inv, ob2->inv))	266	if (!object::can_merge (ob1->inv, ob2->inv))
266	return 0;	267	return 0; /* inventory objexts differ */
267		268
268	/* 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
269	* if it is valid.	270	* if it is valid.
270	*/	271	*/
271	}	272	}
…		…
300	return 0;	301	return 0;
301	else if (!compare_ob_value_lists (ob1, ob2))	302	else if (!compare_ob_value_lists (ob1, ob2))
302	return 0;	303	return 0;
303	}	304	}
304		305
305	//TODO: generate an event or call into perl for additional checks
306	if (ob1->self \|\| ob2->self)	306	if (ob1->self \|\| ob2->self)
307	{	307	{
308	ob1->optimise ();	308	ob1->optimise ();
309	ob2->optimise ();	309	ob2->optimise ();
310		310
311	if (ob1->self \|\| ob2->self)	311	if (ob1->self \|\| ob2->self)
		312	{
		313	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		314	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		315
		316	if (k1 != k2)
312	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	}
313	}	323	}
314		324
315	/* Everything passes, must be OK. */	325	/* Everything passes, must be OK. */
316	return 1;	326	return 1;
317	}	327	}
…		…
375	/*	385	/*
376	* 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
377	* multi-object 1 which is closest to the second object.	387	* multi-object 1 which is closest to the second object.
378	* If it's not a multi-object, it is returned.	388	* If it's not a multi-object, it is returned.
379	*/	389	*/
380
381	object *	390	object *
382	get_nearest_part (object op, const object pl)	391	get_nearest_part (object op, const object pl)
383	{	392	{
384	object tmp, closest;	393	object tmp, closest;
385	int last_dist, i;	394	int last_dist, i;
…		…
421	break;	430	break;
422		431
423	return op;	432	return op;
424	}	433	}
425		434
426	void
427	free_all_object_data ()
428	{
429	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
430	}
431
432	/*	435	/*
433	* 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
434	* skill and experience objects.	437	* skill and experience objects.
		438	* ACTUALLY NO! investigate! TODO
435	*/	439	*/
436	void	440	void
437	object::set_owner (object *owner)	441	object::set_owner (object *owner)
438	{	442	{
		443	// allow objects which own objects
439	if (!owner)	444	if (owner)
440	return;
441
442	/* next line added to allow objects which own objects */
443	/* Add a check for ownercounts in here, as I got into an endless loop
444	* with the fireball owning a poison cloud which then owned the
445	* fireball. I believe that was caused by one of the objects getting
446	* freed and then another object replacing it. Since the ownercounts
447	* didn't match, this check is valid and I believe that cause is valid.
448	*/
449	while (owner->owner)	445	while (owner->owner)
450	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	}
451		453
452	this->owner = owner;	454	this->owner = owner;
453	}	455	}
454		456
455	int	457	int
…		…
587	object::copy_to (object *dst)	589	object::copy_to (object *dst)
588	{	590	{
589	dst = this;	591	dst = this;
590		592
591	if (speed < 0)	593	if (speed < 0)
592	dst->speed_left = speed_left - rndm ();	594	dst->speed_left -= rndm ();
593		595
594	dst->set_speed (dst->speed);	596	dst->set_speed (dst->speed);
595	}	597	}
596		598
597	void	599	void
598	object::instantiate ()	600	object::instantiate ()
599	{	601	{
600	if (!uuid.seq) // HACK	602	if (!uuid.seq) // HACK
601	uuid = gen_uuid ();	603	uuid = UUID::gen ();
602		604
603	speed_left = -0.1f;	605	speed_left = -0.1f;
604	/* 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
605	* 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.
606	* 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
…		…
765	static int object_count;	767	static int object_count;
766		768
767	void object::link ()	769	void object::link ()
768	{	770	{
769	assert (!index);//D	771	assert (!index);//D
770	uuid = gen_uuid ();	772	uuid = UUID::gen ();
771	count = ++object_count;	773	count = ++object_count;
772		774
773	refcnt_inc ();	775	refcnt_inc ();
774	objects.insert (this);	776	objects.insert (this);
775	}	777	}
…		…
924		926
925	if (!freed_map)	927	if (!freed_map)
926	{	928	{
927	freed_map = new maptile;	929	freed_map = new maptile;
928		930
		931	freed_map->path = "<freed objects map>";
929	freed_map->name = "/internal/freed_objects_map";	932	freed_map->name = "/internal/freed_objects_map";
930	freed_map->width = 3;	933	freed_map->width = 3;
931	freed_map->height = 3;	934	freed_map->height = 3;
		935	freed_map->nodrop = 1;
932		936
933	freed_map->alloc ();	937	freed_map->alloc ();
934	freed_map->in_memory = MAP_IN_MEMORY;	938	freed_map->in_memory = MAP_IN_MEMORY;
935	}	939	}
936		940
937	map = freed_map;	941	map = freed_map;
938	x = 1;	942	x = 1;
939	y = 1;	943	y = 1;
940	}	944	}
941		945
942	head = 0;
943
944	if (more)	946	if (more)
945	{	947	{
946	more->destroy ();	948	more->destroy ();
947	more = 0;	949	more = 0;
948	}	950	}
949		951
		952	head = 0;
		953
950	// clear those pointers that likely might have circular references to us	954	// clear those pointers that likely might cause circular references
951	owner = 0;	955	owner = 0;
952	enemy = 0;	956	enemy = 0;
953	attacked_by = 0;	957	attacked_by = 0;
		958	current_weapon = 0;
954	}	959	}
955		960
956	void	961	void
957	object::destroy (bool destroy_inventory)	962	object::destroy (bool destroy_inventory)
958	{	963	{
959	if (destroyed ())	964	if (destroyed ())
960	return;	965	return;
961		966
962	if (destroy_inventory)	967	if (destroy_inventory)
963	destroy_inv (false);	968	destroy_inv (false);
		969
		970	if (is_head ())
		971	if (sound_destroy)
		972	play_sound (sound_destroy);
		973	else if (flag [FLAG_MONSTER])
		974	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
964		975
965	attachable::destroy ();	976	attachable::destroy ();
966	}	977	}
967		978
968	/*	979	/*
…		…
1083	if (map->in_memory == MAP_SAVING)	1094	if (map->in_memory == MAP_SAVING)
1084	return;	1095	return;
1085		1096
1086	int check_walk_off = !flag [FLAG_NO_APPLY];	1097	int check_walk_off = !flag [FLAG_NO_APPLY];
1087		1098
		1099	if (object *pl = ms.player ())
		1100	{
		1101	if (pl->container == this)
		1102	/* If a container that the player is currently using somehow gets
		1103	* removed (most likely destroyed), update the player view
		1104	* appropriately.
		1105	*/
		1106	pl->close_container ();
		1107
		1108	pl->contr->ns->floorbox_update ();
		1109	}
		1110
1088	for (tmp = ms.bot; tmp; tmp = tmp->above)	1111	for (tmp = ms.bot; tmp; tmp = tmp->above)
1089	{	1112	{
1090	/* No point updating the players look faces if he is the object	1113	/* No point updating the players look faces if he is the object
1091	* being removed.	1114	* being removed.
1092	*/	1115	*/
1093
1094	if (tmp->type == PLAYER && tmp != this)
1095	{
1096	/* If a container that the player is currently using somehow gets
1097	* removed (most likely destroyed), update the player view
1098	* appropriately.
1099	*/
1100	if (tmp->container == this)
1101	{
1102	flag [FLAG_APPLIED] = 0;
1103	tmp->container = 0;
1104	}
1105
1106	if (tmp->contr->ns)
1107	tmp->contr->ns->floorbox_update ();
1108	}
1109		1116
1110	/* See if object moving off should effect something */	1117	/* See if object moving off should effect something */
1111	if (check_walk_off	1118	if (check_walk_off
1112	&& ((move_type & tmp->move_off)	1119	&& ((move_type & tmp->move_off)
1113	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1120	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1116		1123
1117	if (destroyed ())	1124	if (destroyed ())
1118	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1125	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1119	}	1126	}
1120		1127
1121	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1122	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1123	if (tmp->above == tmp)
1124	tmp->above = 0;
1125
1126	last = tmp;	1128	last = tmp;
1127	}	1129	}
1128		1130
1129	/* last == NULL if there are no objects on this space */	1131	/* last == NULL if there are no objects on this space */
1130	//TODO: this makes little sense, why only update the topmost object?	1132	//TODO: this makes little sense, why only update the topmost object?
…		…
1150	merge_ob (object op, object top)	1152	merge_ob (object op, object top)
1151	{	1153	{
1152	if (!op->nrof)	1154	if (!op->nrof)
1153	return 0;	1155	return 0;
1154		1156
1155	if (top)	1157	if (!top)
1156	for (top = op; top && top->above; top = top->above)	1158	for (top = op; top && top->above; top = top->above)
1157	;	1159	;
1158		1160
1159	for (; top; top = top->below)	1161	for (; top; top = top->below)
1160	{	1162	{
…		…
1181	if (more)	1183	if (more)
1182	return;	1184	return;
1183		1185
1184	object *prev = this;	1186	object *prev = this;
1185		1187
1186	for (archetype *at = arch->more; at; at = at->more)	1188	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)
1187	{	1189	{
1188	object *op = arch_to_object (at);	1190	object *op = arch_to_object (at);
1189		1191
1190	op->name = name;	1192	op->name = name;
1191	op->name_pl = name_pl;	1193	op->name_pl = name_pl;
…		…
1205	object *	1207	object *
1206	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1208	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1207	{	1209	{
1208	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1210	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1209	{	1211	{
1210	tmp->x = x + tmp->arch->clone.x;	1212	tmp->x = x + tmp->arch->x;
1211	tmp->y = y + tmp->arch->clone.y;	1213	tmp->y = y + tmp->arch->y;
1212	}	1214	}
1213		1215
1214	return insert_ob_in_map (op, m, originator, flag);	1216	return insert_ob_in_map (op, m, originator, flag);
1215	}	1217	}
1216		1218
…		…
1241		1243
1242	object top, floor = NULL;	1244	object top, floor = NULL;
1243		1245
1244	op->remove ();	1246	op->remove ();
1245		1247
1246	#if 0
1247	if (!m->active != !op->active)
1248	if (m->active)
1249	op->activate_recursive ();
1250	else
1251	op->deactivate_recursive ();
1252	#endif
1253
1254	if (out_of_map (m, op->x, op->y))
1255	{
1256	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1257	#ifdef MANY_CORES
1258	/* Better to catch this here, as otherwise the next use of this object
1259	* is likely to cause a crash. Better to find out where it is getting
1260	* improperly inserted.
1261	*/
1262	abort ();
1263	#endif
1264	return op;
1265	}
1266
1267	if (object *more = op->more)
1268	if (!insert_ob_in_map (more, m, originator, flag))
1269	return 0;
1270
1271	CLEAR_FLAG (op, FLAG_REMOVED);
1272
1273	/* Ideally, the caller figures this out. However, it complicates a lot	1248	/* Ideally, the caller figures this out. However, it complicates a lot
1274	* 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
1275	* need extra work	1250	* need extra work
1276	*/	1251	*/
1277	if (!xy_normalise (m, op->x, op->y))	1252	if (!xy_normalise (m, op->x, op->y))
		1253	{
		1254	op->destroy ();
1278	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);
1279		1263
1280	op->map = m;	1264	op->map = m;
1281	mapspace &ms = op->ms ();	1265	mapspace &ms = op->ms ();
1282		1266
1283	/* this has to be done after we translate the coordinates.	1267	/* this has to be done after we translate the coordinates.
…		…
1318	else	1302	else
1319	{	1303	{
1320	top = ms.bot;	1304	top = ms.bot;
1321		1305
1322	/* If there are other objects, then */	1306	/* If there are other objects, then */
1323	if ((!(flag & INS_MAP_LOAD)) && top)	1307	if (top)
1324	{	1308	{
1325	object *last = 0;	1309	object *last = 0;
1326		1310
1327	/*	1311	/*
1328	* 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.
…		…
1381	if (last && last->below && last != floor)	1365	if (last && last->below && last != floor)
1382	top = last->below;	1366	top = last->below;
1383	}	1367	}
1384	} /* If objects on this space */	1368	} /* If objects on this space */
1385		1369
1386	if (flag & INS_MAP_LOAD)
1387	top = ms.top;
1388
1389	if (flag & INS_ABOVE_FLOOR_ONLY)	1370	if (flag & INS_ABOVE_FLOOR_ONLY)
1390	top = floor;	1371	top = floor;
1391		1372
1392	/* 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.
1393	*/	1374	*/
…		…
1425	op->map->touch ();	1406	op->map->touch ();
1426	}	1407	}
1427		1408
1428	op->map->dirty = true;	1409	op->map->dirty = true;
1429		1410
1430	/* If we have a floor, we know the player, if any, will be above
1431	* it, so save a few ticks and start from there.
1432	*/
1433	if (!(flag & INS_MAP_LOAD))
1434	if (object *pl = ms.player ())	1411	if (object *pl = ms.player ())
1435	if (pl->contr->ns)
1436	pl->contr->ns->floorbox_update ();	1412	pl->contr->ns->floorbox_update ();
1437		1413
1438	/* If this object glows, it may affect lighting conditions that are	1414	/* If this object glows, it may affect lighting conditions that are
1439	* 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
1440	* 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
1441	* on the map will get recalculated. The players could very well	1417	* on the map will get recalculated. The players could very well
…		…
1488	object tmp, tmp1;	1464	object tmp, tmp1;
1489		1465
1490	/* first search for itself and remove any old instances */	1466	/* first search for itself and remove any old instances */
1491		1467
1492	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1468	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1493	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1469	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1494	tmp->destroy ();	1470	tmp->destroy ();
1495		1471
1496	tmp1 = arch_to_object (archetype::find (arch_string));	1472	tmp1 = arch_to_object (archetype::find (arch_string));
1497		1473
1498	tmp1->x = op->x;	1474	tmp1->x = op->x;
…		…
1679	* be != op, if items are merged. -Tero	1655	* be != op, if items are merged. -Tero
1680	*/	1656	*/
1681	object *	1657	object *
1682	object::insert (object *op)	1658	object::insert (object *op)
1683	{	1659	{
1684	object tmp, otmp;
1685
1686	if (!QUERY_FLAG (op, FLAG_REMOVED))	1660	if (!QUERY_FLAG (op, FLAG_REMOVED))
1687	op->remove ();	1661	op->remove ();
1688		1662
1689	if (op->more)	1663	if (op->more)
1690	{	1664	{
…		…
1692	return op;	1666	return op;
1693	}	1667	}
1694		1668
1695	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1669	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1696	CLEAR_FLAG (op, FLAG_REMOVED);	1670	CLEAR_FLAG (op, FLAG_REMOVED);
		1671
1697	if (op->nrof)	1672	if (op->nrof)
1698	{	1673	{
1699	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1674	for (object *tmp = inv; tmp; tmp = tmp->below)
1700	if (object::can_merge (tmp, op))	1675	if (object::can_merge (tmp, op))
1701	{	1676	{
1702	/* return the original object and remove inserted object	1677	/* return the original object and remove inserted object
1703	(client needs the original object) */	1678	(client needs the original object) */
1704	tmp->nrof += op->nrof;	1679	tmp->nrof += op->nrof;
…		…
1723	add_weight (this, op->weight * op->nrof);	1698	add_weight (this, op->weight * op->nrof);
1724	}	1699	}
1725	else	1700	else
1726	add_weight (this, (op->weight + op->carrying));	1701	add_weight (this, (op->weight + op->carrying));
1727		1702
1728	otmp = this->in_player ();	1703	if (object *otmp = this->in_player ())
1729	if (otmp && otmp->contr)
1730	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1704	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1731	otmp->update_stats ();	1705	otmp->update_stats ();
1732		1706
		1707	op->owner = 0; // its his/hers now. period.
1733	op->map = 0;	1708	op->map = 0;
1734	op->env = this;	1709	op->env = this;
1735	op->above = 0;	1710	op->above = 0;
1736	op->below = 0;	1711	op->below = 0;
1737	op->x = 0, op->y = 0;	1712	op->x = op->y = 0;
1738		1713
1739	/* reset the light list and los of the players on the map */	1714	/* reset the light list and los of the players on the map */
1740	if ((op->glow_radius != 0) && map)	1715	if (op->glow_radius && map)
1741	{	1716	{
1742	#ifdef DEBUG_LIGHTS	1717	#ifdef DEBUG_LIGHTS
1743	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1718	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1744	#endif /* DEBUG_LIGHTS */	1719	#endif /* DEBUG_LIGHTS */
1745	if (map->darkness)	1720	if (map->darkness)
…		…
1979	* activate recursively a flag on an object inventory	1954	* activate recursively a flag on an object inventory
1980	*/	1955	*/
1981	void	1956	void
1982	flag_inv (object *op, int flag)	1957	flag_inv (object *op, int flag)
1983	{	1958	{
1984	if (op->inv)
1985	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1959	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1986	{	1960	{
1987	SET_FLAG (tmp, flag);	1961	SET_FLAG (tmp, flag);
1988	flag_inv (tmp, flag);	1962	flag_inv (tmp, flag);
1989	}	1963	}
1990	}	1964	}
1991		1965
1992	/*	1966	/*
1993	* deactivate recursively a flag on an object inventory	1967	* deactivate recursively a flag on an object inventory
1994	*/	1968	*/
1995	void	1969	void
1996	unflag_inv (object *op, int flag)	1970	unflag_inv (object *op, int flag)
1997	{	1971	{
1998	if (op->inv)
1999	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1972	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2000	{	1973	{
2001	CLEAR_FLAG (tmp, flag);	1974	CLEAR_FLAG (tmp, flag);
2002	unflag_inv (tmp, flag);	1975	unflag_inv (tmp, flag);
2003	}	1976	}
2004	}	1977	}
2005		1978
2006	/*	1979	/*
2007	* 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
2008	* 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
…		…
2010	* to search (see the freearr_x/y[] definition).	1983	* to search (see the freearr_x/y[] definition).
2011	* It returns a random choice among the alternatives found.	1984	* It returns a random choice among the alternatives found.
2012	* 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
2013	* does all 4 immediate directions). This returns the index into the	1986	* does all 4 immediate directions). This returns the index into the
2014	* 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)
2015	* Note - this only checks to see if there is space for the head of the
2016	* object - if it is a multispace object, this should be called for all
2017	* pieces.
2018	* Note2: This function does correctly handle tiled maps, but does not	1988	* Note: This function does correctly handle tiled maps, but does not
2019	* inform the caller. However, insert_ob_in_map will update as	1989	* inform the caller. However, insert_ob_in_map will update as
2020	* 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.
2021	* 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
2022	* 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
2023	* 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
…		…
2025	* customized, changed states, etc.	1995	* customized, changed states, etc.
2026	*/	1996	*/
2027	int	1997	int
2028	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)
2029	{	1999	{
		2000	int altern[SIZEOFFREE];
2030	int index = 0, flag;	2001	int index = 0, flag;
2031	int altern[SIZEOFFREE];
2032		2002
2033	for (int i = start; i < stop; i++)	2003	for (int i = start; i < stop; i++)
2034	{	2004	{
2035	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2005	mapxy pos (m, x, y); pos.move (i);
2036	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	{
2037	altern [index++] = i;	2021	altern [index++] = i;
		2022	continue;
		2023	}
2038		2024
2039	/* 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.
2040	* 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.
2041	* 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 -
2042	* 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
2043	* 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
2044	* to only the spaces immediately surrounding the target area, and	2030	* to only the spaces immediately surrounding the target area, and
2045	* won't look 2 spaces south of the target space.	2031	* won't look 2 spaces south of the target space.
2046	*/	2032	*/
2047	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2033	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2034	{
2048	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;
2049	}	2049	}
2050		2050
2051	if (!index)	2051	if (!index)
2052	return -1;	2052	return -1;
2053		2053
…		…
2062	*/	2062	*/
2063	int	2063	int
2064	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)
2065	{	2065	{
2066	for (int i = 0; i < SIZEOFFREE; i++)	2066	for (int i = 0; i < SIZEOFFREE; i++)
2067	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]))
2068	return i;	2068	return i;
2069		2069
2070	return -1;	2070	return -1;
2071	}	2071	}
2072		2072
…		…
2349	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2349	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2350	* core dumps if they do.	2350	* core dumps if they do.
2351	*	2351	*
2352	* Add a check so we can't pick up invisible objects (0.93.8)	2352	* Add a check so we can't pick up invisible objects (0.93.8)
2353	*/	2353	*/
2354
2355	int	2354	int
2356	can_pick (const object who, const object item)	2355	can_pick (const object who, const object item)
2357	{	2356	{
2358	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2357	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2359	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2358	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2495	/* Basically, if the archetype has this key set,	2494	/* Basically, if the archetype has this key set,
2496	* we need to store the null value so when we save	2495	* we need to store the null value so when we save
2497	* it, we save the empty value so that when we load,	2496	* it, we save the empty value so that when we load,
2498	* we get this value back again.	2497	* we get this value back again.
2499	*/	2498	*/
2500	if (get_ob_key_link (&op->arch->clone, canonical_key))	2499	if (get_ob_key_link (op->arch, canonical_key))
2501	field->value = 0;	2500	field->value = 0;
2502	else	2501	else
2503	{	2502	{
2504	if (last)	2503	if (last)
2505	last->next = field->next;	2504	last->next = field->next;
…		…
2574	}	2573	}
2575	else	2574	else
2576	item = item->env;	2575	item = item->env;
2577	}	2576	}
2578		2577
2579
2580	const char *	2578	const char *
2581	object::flag_desc (char *desc, int len) const	2579	object::flag_desc (char *desc, int len) const
2582	{	2580	{
2583	char *p = desc;	2581	char *p = desc;
2584	bool first = true;	2582	bool first = true;
…		…
2611	{	2609	{
2612	char flagdesc[512];	2610	char flagdesc[512];
2613	char info2[256 * 4];	2611	char info2[256 * 4];
2614	char *p = info;	2612	char *p = info;
2615		2613
2616	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}",
2617	count, uuid.seq,	2615	count,
		2616	uuid.c_str (),
2618	&name,	2617	&name,
2619	title ? "\",title:\"" : "",	2618	title ? "\",title:\"" : "",
2620	title ? (const char *)title : "",	2619	title ? (const char *)title : "",
2621	flag_desc (flagdesc, 512), type);	2620	flag_desc (flagdesc, 512), type);
2622		2621
2623	if (env)	2622	if (!this->flag[FLAG_REMOVED] && env)
2624	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2623	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2625		2624
2626	if (map)	2625	if (map)
2627	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2626	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2628		2627
…		…
2646	}	2645	}
2647		2646
2648	const materialtype_t *	2647	const materialtype_t *
2649	object::dominant_material () const	2648	object::dominant_material () const
2650	{	2649	{
2651	if (materialtype_t *mat = name_to_material (materialname))	2650	if (materialtype_t *mt = name_to_material (materialname))
2652	return mat;	2651	return mt;
2653		2652
2654	// omfg this is slow, this has to be temporary :)
2655	shstr unknown ("unknown");
2656
2657	return name_to_material (unknown);	2653	return name_to_material (shstr_unknown);
2658	}	2654	}
2659		2655
2660	void	2656	void
2661	object::open_container (object *new_container)	2657	object::open_container (object *new_container)
2662	{	2658	{
…		…
2678	old_container->flag [FLAG_APPLIED] = 0;	2674	old_container->flag [FLAG_APPLIED] = 0;
2679	container = 0;	2675	container = 0;
2680		2676
2681	esrv_update_item (UPD_FLAGS, this, old_container);	2677	esrv_update_item (UPD_FLAGS, this, old_container);
2682	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2678	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2679	play_sound (sound_find ("chest_close"));
2683	}	2680	}
2684		2681
2685	if (new_container)	2682	if (new_container)
2686	{	2683	{
2687	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2684	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2703	new_container->flag [FLAG_APPLIED] = 1;	2700	new_container->flag [FLAG_APPLIED] = 1;
2704	container = new_container;	2701	container = new_container;
2705		2702
2706	esrv_update_item (UPD_FLAGS, this, new_container);	2703	esrv_update_item (UPD_FLAGS, this, new_container);
2707	esrv_send_inventory (this, new_container);	2704	esrv_send_inventory (this, new_container);
		2705	play_sound (sound_find ("chest_open"));
		2706	}
		2707	}
		2708
		2709	object *
		2710	object::force_find (const shstr name)
		2711	{
		2712	/* cycle through his inventory to look for the MARK we want to
		2713	* place
		2714	*/
		2715	for (object *tmp = inv; tmp; tmp = tmp->below)
		2716	if (tmp->type == FORCE && tmp->slaying == name)
		2717	return splay (tmp);
		2718
		2719	return 0;
		2720	}
		2721
		2722	void
		2723	object::force_add (const shstr name, int duration)
		2724	{
		2725	if (object *force = force_find (name))
		2726	force->destroy ();
		2727
		2728	object *force = get_archetype (FORCE_NAME);
		2729
		2730	force->slaying = name;
		2731	force->stats.food = 1;
		2732	force->speed_left = -1.f;
		2733
		2734	force->set_speed (duration ? 1.f / duration : 0.f);
		2735	force->flag [FLAG_IS_USED_UP] = true;
		2736	force->flag [FLAG_APPLIED] = true;
		2737
		2738	insert (force);
		2739	}
		2740
		2741	void
		2742	object::play_sound (faceidx sound) const
		2743	{
		2744	if (!sound)
		2745	return;
		2746
		2747	if (flag [FLAG_REMOVED])
		2748	return;
		2749
		2750	if (env)
2708	}	2751	{
		2752	if (object *pl = in_player ())
		2753	pl->contr->play_sound (sound);
		2754	}
		2755	else
		2756	map->play_sound (sound, x, y);
2709	}	2757	}
2710		2758
2711

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.156 by root, Fri May 18 01:01:01 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.156 by root, Fri May 18 01:01:01 2007 UTC vs.
Revision 1.203 by root, Fri Apr 11 13:59:05 2008 UTC