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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.161 by root, Wed Jun 13 21:09:39 2007 UTC vs.
Revision 1.207 by root, Sun Apr 20 23:25:09 2008 UTC

…		…
1	/*	1	/*
2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007 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 it	8	* Deliantra is free software: you can redistribute it and/or modify
9	* under the terms of the GNU General Public License as published by the Free	9	* it under the terms of the GNU General Public License as published by
10	* Software Foundation; either version 2 of the License, or (at your option)	10	* the Free Software Foundation, either version 3 of the License, or
11	* 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, but	13	* This program is distributed in the hope that it will be useful,
14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License along	18	* You should have received a copy of the GNU General Public License
19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21	*	20	*
22	* 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>
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. */
		27
28	#include <global.h>	28	#include <global.h>
29	#include <stdio.h>	29	#include <stdio.h>
30	#include <sys/types.h>	30	#include <sys/types.h>
31	#include <sys/uio.h>	31	#include <sys/uio.h>
32	#include <object.h>	32	#include <object.h>
34	#include <sproto.h>	34	#include <sproto.h>
35	#include <loader.h>	35	#include <loader.h>
36		36
37	#include <bitset>	37	#include <bitset>
38		38
39	int nrofallocobjects = 0;	39	UUID UUID::cur;
40	static UUID uuid;	40	static uint64_t seq_next_save;
41	const uint64 UUID_SKIP = 1<<19;	41	static const uint64 UUID_GAP = 1<<19;
42		42
43	objectvec objects;	43	objectvec objects;
44	activevec actives;	44	activevec actives;
45		45
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,	46	short freearr_x[SIZEOFFREE] = {
		47	0,
		48	0, 1, 1, 1, 0, -1, -1, -1,
		49	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	50	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	};	51	};
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,	52	short freearr_y[SIZEOFFREE] = {
		53	0,
		54	-1, -1, 0, 1, 1, 1, 0, -1,
		55	-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	56	-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	};	57	};
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,	58	int maxfree[SIZEOFFREE] = {
		59	0,
		60	9, 10, 13, 14, 17, 18, 21, 22,
		61	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	62	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	};	63	};
55	int freedir[SIZEOFFREE] = {	64	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,	65	0,
		66	1, 2, 3, 4, 5, 6, 7, 8,
		67	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	68	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	};	69	};
59		70
60	static void	71	static void
61	write_uuid (void)	72	write_uuid (uval64 skip, bool sync)
62	{	73	{
63	char filename1[MAX_BUF], filename2[MAX_BUF];	74	CALL_BEGIN (2);
64		75	CALL_ARG_SV (newSVval64 (skip));
65	sprintf (filename1, "%s/uuid", settings.localdir);	76	CALL_ARG_SV (boolSV (sync));
66	sprintf (filename2, "%s/uuid~", settings.localdir);	77	CALL_CALL ("cf::write_uuid", G_DISCARD);
67		78	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	}	79	}
80		80
81	static void	81	static void
82	read_uuid (void)	82	read_uuid (void)
83	{	83	{
84	char filename[MAX_BUF];	84	char filename[MAX_BUF];
85		85
86	sprintf (filename, "%s/uuid", settings.localdir);	86	sprintf (filename, "%s/uuid", settings.localdir);
87		87
		88	seq_next_save = 0;
		89
88	FILE *fp;	90	FILE *fp;
89		91
90	if (!(fp = fopen (filename, "r")))	92	if (!(fp = fopen (filename, "r")))
91	{	93	{
92	if (errno == ENOENT)	94	if (errno == ENOENT)
93	{	95	{
94	LOG (llevInfo, "RESET uid to 1\n");	96	LOG (llevInfo, "RESET uid to 1\n");
95	uuid.seq = 0;	97	UUID::cur.seq = 0;
96	write_uuid ();	98	write_uuid (UUID_GAP, true);
97	return;	99	return;
98	}	100	}
99		101
100	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	102	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
101	_exit (1);	103	_exit (1);
102	}	104	}
103		105
104	int version;	106	UUID::BUF buf;
105	unsigned long long uid;	107	buf[0] = 0;
106	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) \|\| version != 1)	108	fgets (buf, sizeof (buf), fp);
		109
		110	if (!UUID::cur.parse (buf))
107	{	111	{
108	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	112	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
109	_exit (1);	113	_exit (1);
110	}	114	}
111		115
112	uuid.seq = uid;	116	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
113	write_uuid ();	117
114	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	118	write_uuid (UUID_GAP, true);
115	fclose (fp);	119	fclose (fp);
116	}	120	}
117		121
118	UUID	122	UUID
119	gen_uuid ()	123	UUID::gen ()
120	{	124	{
121	UUID uid;	125	UUID uid;
122		126
123	uid.seq = ++uuid.seq;	127	uid.seq = ++cur.seq;
124		128
125	if (!(uuid.seq & (UUID_SKIP - 1)))	129	if (expect_false (cur.seq >= seq_next_save))
126	write_uuid ();	130	{
		131	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		132	write_uuid (UUID_GAP, false);
		133	}
		134
127		135
128	return uid;	136	return uid;
129	}	137	}
130		138
131	void	139	void
132	init_uuid ()	140	UUID::init ()
133	{	141	{
134	read_uuid ();	142	read_uuid ();
135	}	143	}
136		144
137	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	145	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
138	static int	146	static bool
139	compare_ob_value_lists_one (const object wants, const object has)	147	compare_ob_value_lists_one (const object wants, const object has)
140	{	148	{
141	key_value *wants_field;	149	key_value *wants_field;
142		150
143	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	151	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
…		…
151	key_value *has_field;	159	key_value *has_field;
152		160
153	/* Look for a field in has with the same key. */	161	/* Look for a field in has with the same key. */
154	has_field = get_ob_key_link (has, wants_field->key);	162	has_field = get_ob_key_link (has, wants_field->key);
155		163
156	if (has_field == NULL)	164	if (!has_field)
157	{
158	/* No field with that name. */	165	return 0; /* No field with that name. */
159	return FALSE;
160	}
161		166
162	/* Found the matching field. */	167	/* Found the matching field. */
163	if (has_field->value != wants_field->value)	168	if (has_field->value != wants_field->value)
164	{
165	/* Values don't match, so this half of the comparison is false. */	169	return 0; /* Values don't match, so this half of the comparison is false. */
166	return FALSE;
167	}
168		170
169	/* If we get here, we found a match. Now for the next field in wants. */	171	/* If we get here, we found a match. Now for the next field in wants. */
170	}	172	}
171		173
172	/* If we get here, every field in wants has a matching field in has. */	174	/* If we get here, every field in wants has a matching field in has. */
173	return TRUE;	175	return 1;
174	}	176	}
175		177
176	/* Returns TRUE if ob1 has the same key_values as ob2. */	178	/* Returns TRUE if ob1 has the same key_values as ob2. */
177	static int	179	static bool
178	compare_ob_value_lists (const object ob1, const object ob2)	180	compare_ob_value_lists (const object ob1, const object ob2)
179	{	181	{
180	/* However, there may be fields in has which aren't partnered in wants,	182	/* However, there may be fields in has which aren't partnered in wants,
181	* so we need to run the comparison twice. :(	183	* so we need to run the comparison twice. :(
182	*/	184	*/
…		…
203	\|\| ob1->speed != ob2->speed	205	\|\| ob1->speed != ob2->speed
204	\|\| ob1->value != ob2->value	206	\|\| ob1->value != ob2->value
205	\|\| ob1->name != ob2->name)	207	\|\| ob1->name != ob2->name)
206	return 0;	208	return 0;
207		209
208	//TODO: this ain't working well, use nicer and correct overflow check	210	/* Do not merge objects if nrof would overflow. First part checks
209	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	211	* for unsigned overflow (2c), second part checks wether the result
210	* value could not be stored in a sint32 (which unfortunately sometimes is	212	* would fit into a 32 bit signed int, which is often used to hold
211	* used to store nrof).	213	* nrof values.
212	*/	214	*/
213	if (ob1->nrof + ob2->nrof >= 1UL << 31)	215	if (~ob1->nrof < ob2->nrof \|\| ob1->nrof + ob2->nrof > (1UL << 31))
214	return 0;	216	return 0;
215		217
216	/* If the objects have been identified, set the BEEN_APPLIED flag.	218	/* If the objects have been identified, set the BEEN_APPLIED flag.
217	* This is to the comparison of the flags below will be OK. We	219	* This is to the comparison of the flags below will be OK. We
218	* just can't ignore the been applied or identified flags, as they	220	* just can't ignore the been applied or identified flags, as they
219	* are not equal - just if it has been identified, the been_applied	221	* are not equal - just if it has been identified, the been_applied
220	* flags lose any meaning.	222	* flags lose any meaning.
221	*/	223	*/
222	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	224	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
…		…
250	\|\| ob1->move_off != ob2->move_off	252	\|\| ob1->move_off != ob2->move_off
251	\|\| ob1->move_slow != ob2->move_slow	253	\|\| ob1->move_slow != ob2->move_slow
252	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty)	254	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty)
253	return 0;	255	return 0;
254		256
255	/* This is really a spellbook check - really, we should	257	/* This is really a spellbook check - we should in general
256	* check all objects in the inventory.	258	* not merge objects with real inventories, as splitting them
		259	* is hard.
257	*/	260	*/
258	if (ob1->inv \|\| ob2->inv)	261	if (ob1->inv \|\| ob2->inv)
259	{	262	{
260	/* if one object has inventory but the other doesn't, not equiv */	263	if (!(ob1->inv && ob2->inv))
261	if ((ob1->inv && !ob2->inv) \|\| (ob2->inv && !ob1->inv))	264	return 0; /* inventories differ in length */
262	return 0;
263		265
264	/* Now check to see if the two inventory objects could merge */	266	if (ob1->inv->below \|\| ob2->inv->below)
		267	return 0; /* more than one object in inv */
		268
265	if (!object::can_merge (ob1->inv, ob2->inv))	269	if (!object::can_merge (ob1->inv, ob2->inv))
266	return 0;	270	return 0; /* inventory objects differ */
267		271
268	/* inventory ok - still need to check rest of this object to see	272	/* inventory ok - still need to check rest of this object to see
269	* if it is valid.	273	* if it is valid.
270	*/	274	*/
271	}	275	}
…		…
290	if (ob1->level != ob2->level)	294	if (ob1->level != ob2->level)
291	return 0;	295	return 0;
292	break;	296	break;
293	}	297	}
294		298
295	if (ob1->key_values != NULL \|\| ob2->key_values != NULL)	299	if (ob1->key_values \|\| ob2->key_values)
296	{	300	{
297	/* At least one of these has key_values. */	301	/* At least one of these has key_values. */
298	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	302	if ((!ob1->key_values) != (!ob2->key_values))
299	/* One has fields, but the other one doesn't. */	303	/* One has fields, but the other one doesn't. */
300	return 0;	304	return 0;
301	else if (!compare_ob_value_lists (ob1, ob2))	305	else if (!compare_ob_value_lists (ob1, ob2))
302	return 0;	306	return 0;
303	}	307	}
304		308
305	//TODO: generate an event or call into perl for additional checks
306	if (ob1->self \|\| ob2->self)	309	if (ob1->self \|\| ob2->self)
307	{	310	{
308	ob1->optimise ();	311	ob1->optimise ();
309	ob2->optimise ();	312	ob2->optimise ();
310		313
311	if (ob1->self \|\| ob2->self)	314	if (ob1->self \|\| ob2->self)
		315	{
		316	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		317	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		318
		319	if (k1 != k2)
312	return 0;	320	return 0;
		321	else if (k1 == 0)
		322	return 1;
		323	else if (!cfperl_can_merge (ob1, ob2))
		324	return 0;
		325	}
313	}	326	}
314		327
315	/* Everything passes, must be OK. */	328	/* Everything passes, must be OK. */
316	return 1;	329	return 1;
317	}	330	}
318		331
		332	static sint32
		333	weight_adjust (object *op, sint32 weight)
		334	{
		335	return op->type == CONTAINER
		336	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		337	: weight;
		338	}
		339
319	/*	340	/*
		341	* add_weight(object, weight) adds the specified weight to an object,
		342	* and also updates how much the environment(s) is/are carrying.
		343	*/
		344	static void
		345	add_weight (object *op, sint32 weight)
		346	{
		347	while (op)
		348	{
		349	weight = weight_adjust (op, weight);
		350
		351	op->carrying += weight;
		352	op = op->env;
		353	}
		354	}
		355
		356	/*
		357	* sub_weight() recursively (outwards) subtracts a number from the
		358	* weight of an object (and what is carried by it's environment(s)).
		359	*/
		360	static void
		361	sub_weight (object *op, long weight)
		362	{
		363	add_weight (op, -weight);
		364	}
		365
		366	/*
320	* sum_weight() is a recursive function which calculates the weight	367	* this is a recursive function which calculates the weight
321	* an object is carrying. It goes through in figures out how much	368	* an object is carrying. It goes through op and figures out how much
322	* containers are carrying, and sums it up.	369	* containers are carrying, and sums it up.
323	*/	370	*/
324	long	371	void
325	sum_weight (object *op)	372	object::update_weight ()
326	{	373	{
327	long sum;	374	sint32 sum = 0;
328	object *inv;
329		375
330	for (sum = 0, inv = op->inv; inv; inv = inv->below)	376	for (object *op = inv; op; op = op->below)
331	{	377	{
332	if (inv->inv)	378	if (op->inv)
333	sum_weight (inv);	379	op->update_weight ();
334		380
335	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	381	sum += op->total_weight ();
336	}	382	}
337		383
338	if (op->type == CONTAINER && op->stats.Str)	384	carrying = weight_adjust (this, sum);
339	sum = (sum * (100 - op->stats.Str)) / 100;
340
341	if (op->carrying != sum)
342	op->carrying = sum;
343
344	return sum;
345	}
346
347	/**
348	* Return the outermost environment object for a given object.
349	*/
350
351	object *
352	object_get_env_recursive (object *op)
353	{
354	while (op->env != NULL)
355	op = op->env;
356	return op;
357	}	385	}
358		386
359	/*	387	/*
360	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	388	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
361	* Some error messages.	389	* Some error messages.
…		…
375	/*	403	/*
376	* get_nearest_part(multi-object, object 2) returns the part of the	404	* get_nearest_part(multi-object, object 2) returns the part of the
377	* multi-object 1 which is closest to the second object.	405	* multi-object 1 which is closest to the second object.
378	* If it's not a multi-object, it is returned.	406	* If it's not a multi-object, it is returned.
379	*/	407	*/
380
381	object *	408	object *
382	get_nearest_part (object op, const object pl)	409	get_nearest_part (object op, const object pl)
383	{	410	{
384	object tmp, closest;	411	object tmp, closest;
385	int last_dist, i;	412	int last_dist, i;
…		…
421	break;	448	break;
422		449
423	return op;	450	return op;
424	}	451	}
425		452
426	void
427	free_all_object_data ()
428	{
429	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
430	}
431
432	/*	453	/*
433	* Sets the owner and sets the skill and exp pointers to owner's current	454	* Sets the owner and sets the skill and exp pointers to owner's current
434	* skill and experience objects.	455	* skill and experience objects.
		456	* ACTUALLY NO! investigate! TODO
435	*/	457	*/
436	void	458	void
437	object::set_owner (object *owner)	459	object::set_owner (object *owner)
438	{	460	{
		461	// allow objects which own objects
439	if (!owner)	462	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)	463	while (owner->owner)
450	owner = owner->owner;	464	owner = owner->owner;
		465
		466	if (flag [FLAG_FREED])
		467	{
		468	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		469	return;
		470	}
451		471
452	this->owner = owner;	472	this->owner = owner;
453	}	473	}
454		474
455	int	475	int
…		…
587	object::copy_to (object *dst)	607	object::copy_to (object *dst)
588	{	608	{
589	dst = this;	609	dst = this;
590		610
591	if (speed < 0)	611	if (speed < 0)
592	dst->speed_left = speed_left - rndm ();	612	dst->speed_left -= rndm ();
593		613
594	dst->set_speed (dst->speed);	614	dst->set_speed (dst->speed);
595	}	615	}
596		616
597	void	617	void
598	object::instantiate ()	618	object::instantiate ()
599	{	619	{
600	if (!uuid.seq) // HACK	620	if (!uuid.seq) // HACK
601	uuid = gen_uuid ();	621	uuid = UUID::gen ();
602		622
603	speed_left = -0.1f;	623	speed_left = -0.1f;
604	/* copy the body_info to the body_used - this is only really	624	/* 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.	625	* 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	626	* by doing so, when a monster is created, it has good starting
…		…
765	static int object_count;	785	static int object_count;
766		786
767	void object::link ()	787	void object::link ()
768	{	788	{
769	assert (!index);//D	789	assert (!index);//D
770	uuid = gen_uuid ();	790	uuid = UUID::gen ();
771	count = ++object_count;	791	count = ++object_count;
772		792
773	refcnt_inc ();	793	refcnt_inc ();
774	objects.insert (this);	794	objects.insert (this);
775	}	795	}
…		…
859	* if some form of movement is allowed, let objects	879	* if some form of movement is allowed, let objects
860	* drop on that space.	880	* drop on that space.
861	*/	881	*/
862	if (!drop_to_ground	882	if (!drop_to_ground
863	\|\| !map	883	\|\| !map
864	\|\| map->in_memory != MAP_IN_MEMORY	884	\|\| map->in_memory != MAP_ACTIVE
865	\|\| map->nodrop	885	\|\| map->nodrop
866	\|\| ms ().move_block == MOVE_ALL)	886	\|\| ms ().move_block == MOVE_ALL)
867	{	887	{
868	while (inv)	888	while (inv)
869	{	889	{
…		…
924		944
925	if (!freed_map)	945	if (!freed_map)
926	{	946	{
927	freed_map = new maptile;	947	freed_map = new maptile;
928		948
		949	freed_map->path = "<freed objects map>";
929	freed_map->name = "/internal/freed_objects_map";	950	freed_map->name = "/internal/freed_objects_map";
930	freed_map->width = 3;	951	freed_map->width = 3;
931	freed_map->height = 3;	952	freed_map->height = 3;
		953	freed_map->nodrop = 1;
932		954
933	freed_map->alloc ();	955	freed_map->alloc ();
934	freed_map->in_memory = MAP_IN_MEMORY;	956	freed_map->in_memory = MAP_ACTIVE;
935	}	957	}
936		958
937	map = freed_map;	959	map = freed_map;
938	x = 1;	960	x = 1;
939	y = 1;	961	y = 1;
940	}	962	}
941		963
942	head = 0;
943
944	if (more)	964	if (more)
945	{	965	{
946	more->destroy ();	966	more->destroy ();
947	more = 0;	967	more = 0;
948	}	968	}
949		969
		970	head = 0;
		971
950	// clear those pointers that likely might have circular references to us	972	// clear those pointers that likely might cause circular references
951	owner = 0;	973	owner = 0;
952	enemy = 0;	974	enemy = 0;
953	attacked_by = 0;	975	attacked_by = 0;
		976	current_weapon = 0;
954	}	977	}
955		978
956	void	979	void
957	object::destroy (bool destroy_inventory)	980	object::destroy (bool destroy_inventory)
958	{	981	{
…		…
960	return;	983	return;
961		984
962	if (destroy_inventory)	985	if (destroy_inventory)
963	destroy_inv (false);	986	destroy_inv (false);
964		987
		988	if (is_head ())
		989	if (sound_destroy)
		990	play_sound (sound_destroy);
		991	else if (flag [FLAG_MONSTER])
		992	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
		993
965	attachable::destroy ();	994	attachable::destroy ();
966	}
967
968	/*
969	* sub_weight() recursively (outwards) subtracts a number from the
970	* weight of an object (and what is carried by it's environment(s)).
971	*/
972	void
973	sub_weight (object *op, signed long weight)
974	{
975	while (op != NULL)
976	{
977	if (op->type == CONTAINER)
978	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
979
980	op->carrying -= weight;
981	op = op->env;
982	}
983	}	995	}
984		996
985	/* op->remove ():	997	/* op->remove ():
986	* This function removes the object op from the linked list of objects	998	* This function removes the object op from the linked list of objects
987	* which it is currently tied to. When this function is done, the	999	* which it is currently tied to. When this function is done, the
…		…
1083	if (map->in_memory == MAP_SAVING)	1095	if (map->in_memory == MAP_SAVING)
1084	return;	1096	return;
1085		1097
1086	int check_walk_off = !flag [FLAG_NO_APPLY];	1098	int check_walk_off = !flag [FLAG_NO_APPLY];
1087		1099
		1100	if (object *pl = ms.player ())
		1101	{
		1102	if (pl->container == this)
		1103	/* If a container that the player is currently using somehow gets
		1104	* removed (most likely destroyed), update the player view
		1105	* appropriately.
		1106	*/
		1107	pl->close_container ();
		1108
		1109	pl->contr->ns->floorbox_update ();
		1110	}
		1111
1088	for (tmp = ms.bot; tmp; tmp = tmp->above)	1112	for (tmp = ms.bot; tmp; tmp = tmp->above)
1089	{	1113	{
1090	/* No point updating the players look faces if he is the object	1114	/* No point updating the players look faces if he is the object
1091	* being removed.	1115	* being removed.
1092	*/	1116	*/
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		1117
1110	/* See if object moving off should effect something */	1118	/* See if object moving off should effect something */
1111	if (check_walk_off	1119	if (check_walk_off
1112	&& ((move_type & tmp->move_off)	1120	&& ((move_type & tmp->move_off)
1113	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1121	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1145	merge_ob (object op, object top)	1153	merge_ob (object op, object top)
1146	{	1154	{
1147	if (!op->nrof)	1155	if (!op->nrof)
1148	return 0;	1156	return 0;
1149		1157
1150	if (top)	1158	if (!top)
1151	for (top = op; top && top->above; top = top->above)	1159	for (top = op; top && top->above; top = top->above)
1152	;	1160	;
1153		1161
1154	for (; top; top = top->below)	1162	for (; top; top = top->below)
1155	{	1163	{
…		…
1236		1244
1237	object top, floor = NULL;	1245	object top, floor = NULL;
1238		1246
1239	op->remove ();	1247	op->remove ();
1240		1248
1241	#if 0
1242	if (!m->active != !op->active)
1243	if (m->active)
1244	op->activate_recursive ();
1245	else
1246	op->deactivate_recursive ();
1247	#endif
1248
1249	if (out_of_map (m, op->x, op->y))
1250	{
1251	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1252	#ifdef MANY_CORES
1253	/* Better to catch this here, as otherwise the next use of this object
1254	* is likely to cause a crash. Better to find out where it is getting
1255	* improperly inserted.
1256	*/
1257	abort ();
1258	#endif
1259	return op;
1260	}
1261
1262	if (object *more = op->more)
1263	if (!insert_ob_in_map (more, m, originator, flag))
1264	return 0;
1265
1266	CLEAR_FLAG (op, FLAG_REMOVED);
1267
1268	/* Ideally, the caller figures this out. However, it complicates a lot	1249	/* Ideally, the caller figures this out. However, it complicates a lot
1269	* of areas of callers (eg, anything that uses find_free_spot would now	1250	* of areas of callers (eg, anything that uses find_free_spot would now
1270	* need extra work	1251	* need extra work
1271	*/	1252	*/
1272	if (!xy_normalise (m, op->x, op->y))	1253	if (!xy_normalise (m, op->x, op->y))
		1254	{
		1255	op->destroy ();
1273	return 0;	1256	return 0;
		1257	}
		1258
		1259	if (object *more = op->more)
		1260	if (!insert_ob_in_map (more, m, originator, flag))
		1261	return 0;
		1262
		1263	CLEAR_FLAG (op, FLAG_REMOVED);
1274		1264
1275	op->map = m;	1265	op->map = m;
1276	mapspace &ms = op->ms ();	1266	mapspace &ms = op->ms ();
1277		1267
1278	/* this has to be done after we translate the coordinates.	1268	/* this has to be done after we translate the coordinates.
…		…
1313	else	1303	else
1314	{	1304	{
1315	top = ms.bot;	1305	top = ms.bot;
1316		1306
1317	/* If there are other objects, then */	1307	/* If there are other objects, then */
1318	if ((!(flag & INS_MAP_LOAD)) && top)	1308	if (top)
1319	{	1309	{
1320	object *last = 0;	1310	object *last = 0;
1321		1311
1322	/*	1312	/*
1323	* If there are multiple objects on this space, we do some trickier handling.	1313	* If there are multiple objects on this space, we do some trickier handling.
…		…
1376	if (last && last->below && last != floor)	1366	if (last && last->below && last != floor)
1377	top = last->below;	1367	top = last->below;
1378	}	1368	}
1379	} /* If objects on this space */	1369	} /* If objects on this space */
1380		1370
1381	if (flag & INS_MAP_LOAD)
1382	top = ms.top;
1383
1384	if (flag & INS_ABOVE_FLOOR_ONLY)	1371	if (flag & INS_ABOVE_FLOOR_ONLY)
1385	top = floor;	1372	top = floor;
1386		1373
1387	/* Top is the object that our object (op) is going to get inserted above.	1374	/* Top is the object that our object (op) is going to get inserted above.
1388	*/	1375	*/
…		…
1420	op->map->touch ();	1407	op->map->touch ();
1421	}	1408	}
1422		1409
1423	op->map->dirty = true;	1410	op->map->dirty = true;
1424		1411
1425	/* If we have a floor, we know the player, if any, will be above
1426	* it, so save a few ticks and start from there.
1427	*/
1428	if (!(flag & INS_MAP_LOAD))
1429	if (object *pl = ms.player ())	1412	if (object *pl = ms.player ())
1430	if (pl->contr->ns)
1431	pl->contr->ns->floorbox_update ();	1413	pl->contr->ns->floorbox_update ();
1432		1414
1433	/* If this object glows, it may affect lighting conditions that are	1415	/* If this object glows, it may affect lighting conditions that are
1434	* visible to others on this map. But update_all_los is really	1416	* visible to others on this map. But update_all_los is really
1435	* an inefficient way to do this, as it means los for all players	1417	* an inefficient way to do this, as it means los for all players
1436	* on the map will get recalculated. The players could very well	1418	* on the map will get recalculated. The players could very well
…		…
1496	}	1478	}
1497		1479
1498	object *	1480	object *
1499	object::insert_at (object where, object originator, int flags)	1481	object::insert_at (object where, object originator, int flags)
1500	{	1482	{
		1483	if (where->env)
		1484	return where->env->insert (this);
		1485	else
1501	return where->map->insert (this, where->x, where->y, originator, flags);	1486	return where->map->insert (this, where->x, where->y, originator, flags);
1502	}	1487	}
1503		1488
1504	/*	1489	/*
1505	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1490	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1506	* is returned contains nr objects, and the remaining parts contains	1491	* is returned contains nr objects, and the remaining parts contains
…		…
1526	orig_ob->destroy (1);	1511	orig_ob->destroy (1);
1527	else if (!is_removed)	1512	else if (!is_removed)
1528	{	1513	{
1529	if (orig_ob->env != NULL)	1514	if (orig_ob->env != NULL)
1530	sub_weight (orig_ob->env, orig_ob->weight * nr);	1515	sub_weight (orig_ob->env, orig_ob->weight * nr);
1531	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)	1516	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_ACTIVE)
1532	{	1517	{
1533	strcpy (errmsg, "Tried to split object whose map is not in memory.");	1518	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1534	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");	1519	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1535	return NULL;	1520	return NULL;
1536	}	1521	}
…		…
1626	op->destroy ();	1611	op->destroy ();
1627	return 0;	1612	return 0;
1628	}	1613	}
1629	}	1614	}
1630		1615
1631	/*
1632	* add_weight(object, weight) adds the specified weight to an object,
1633	* and also updates how much the environment(s) is/are carrying.
1634	*/
1635	void
1636	add_weight (object *op, signed long weight)
1637	{
1638	while (op != NULL)
1639	{
1640	if (op->type == CONTAINER)
1641	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1642
1643	op->carrying += weight;
1644	op = op->env;
1645	}
1646	}
1647
1648	object *	1616	object *
1649	insert_ob_in_ob (object op, object where)	1617	insert_ob_in_ob (object op, object where)
1650	{	1618	{
1651	if (!where)	1619	if (!where)
1652	{	1620	{
…		…
1674	* be != op, if items are merged. -Tero	1642	* be != op, if items are merged. -Tero
1675	*/	1643	*/
1676	object *	1644	object *
1677	object::insert (object *op)	1645	object::insert (object *op)
1678	{	1646	{
1679	object tmp, otmp;
1680
1681	if (!QUERY_FLAG (op, FLAG_REMOVED))	1647	if (!QUERY_FLAG (op, FLAG_REMOVED))
1682	op->remove ();	1648	op->remove ();
1683		1649
1684	if (op->more)	1650	if (op->more)
1685	{	1651	{
…		…
1687	return op;	1653	return op;
1688	}	1654	}
1689		1655
1690	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1656	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1691	CLEAR_FLAG (op, FLAG_REMOVED);	1657	CLEAR_FLAG (op, FLAG_REMOVED);
		1658
1692	if (op->nrof)	1659	if (op->nrof)
1693	{	1660	{
1694	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1661	for (object *tmp = inv; tmp; tmp = tmp->below)
1695	if (object::can_merge (tmp, op))	1662	if (object::can_merge (tmp, op))
1696	{	1663	{
1697	/* return the original object and remove inserted object	1664	/* return the original object and remove inserted object
1698	(client needs the original object) */	1665	(client needs the original object) */
1699	tmp->nrof += op->nrof;	1666	tmp->nrof += op->nrof;
…		…
1718	add_weight (this, op->weight * op->nrof);	1685	add_weight (this, op->weight * op->nrof);
1719	}	1686	}
1720	else	1687	else
1721	add_weight (this, (op->weight + op->carrying));	1688	add_weight (this, (op->weight + op->carrying));
1722		1689
1723	otmp = this->in_player ();	1690	if (object *otmp = this->in_player ())
1724	if (otmp && otmp->contr)
1725	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1691	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1726	otmp->update_stats ();	1692	otmp->update_stats ();
1727		1693
		1694	op->owner = 0; // its his/hers now. period.
1728	op->map = 0;	1695	op->map = 0;
1729	op->env = this;	1696	op->env = this;
1730	op->above = 0;	1697	op->above = 0;
1731	op->below = 0;	1698	op->below = 0;
1732	op->x = 0, op->y = 0;	1699	op->x = op->y = 0;
1733		1700
1734	/* reset the light list and los of the players on the map */	1701	/* reset the light list and los of the players on the map */
1735	if ((op->glow_radius != 0) && map)	1702	if (op->glow_radius && map)
1736	{	1703	{
1737	#ifdef DEBUG_LIGHTS	1704	#ifdef DEBUG_LIGHTS
1738	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1705	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1739	#endif /* DEBUG_LIGHTS */	1706	#endif /* DEBUG_LIGHTS */
1740	if (map->darkness)	1707	if (map->darkness)
…		…
1974	* activate recursively a flag on an object inventory	1941	* activate recursively a flag on an object inventory
1975	*/	1942	*/
1976	void	1943	void
1977	flag_inv (object *op, int flag)	1944	flag_inv (object *op, int flag)
1978	{	1945	{
1979	if (op->inv)
1980	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1946	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1981	{	1947	{
1982	SET_FLAG (tmp, flag);	1948	SET_FLAG (tmp, flag);
1983	flag_inv (tmp, flag);	1949	flag_inv (tmp, flag);
1984	}	1950	}
1985	}	1951	}
1986		1952
1987	/*	1953	/*
1988	* deactivate recursively a flag on an object inventory	1954	* deactivate recursively a flag on an object inventory
1989	*/	1955	*/
1990	void	1956	void
1991	unflag_inv (object *op, int flag)	1957	unflag_inv (object *op, int flag)
1992	{	1958	{
1993	if (op->inv)
1994	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1959	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1995	{	1960	{
1996	CLEAR_FLAG (tmp, flag);	1961	CLEAR_FLAG (tmp, flag);
1997	unflag_inv (tmp, flag);	1962	unflag_inv (tmp, flag);
1998	}	1963	}
1999	}	1964	}
2000		1965
2001	/*	1966	/*
2002	* find_free_spot(object, map, x, y, start, stop) will search for	1967	* find_free_spot(object, map, x, y, start, stop) will search for
2003	* a spot at the given map and coordinates which will be able to contain	1968	* a spot at the given map and coordinates which will be able to contain
…		…
2005	* to search (see the freearr_x/y[] definition).	1970	* to search (see the freearr_x/y[] definition).
2006	* It returns a random choice among the alternatives found.	1971	* It returns a random choice among the alternatives found.
2007	* start and stop are where to start relative to the free_arr array (1,9	1972	* start and stop are where to start relative to the free_arr array (1,9
2008	* does all 4 immediate directions). This returns the index into the	1973	* does all 4 immediate directions). This returns the index into the
2009	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1974	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2010	* Note - this only checks to see if there is space for the head of the
2011	* object - if it is a multispace object, this should be called for all
2012	* pieces.
2013	* Note2: This function does correctly handle tiled maps, but does not	1975	* Note: This function does correctly handle tiled maps, but does not
2014	* inform the caller. However, insert_ob_in_map will update as	1976	* inform the caller. However, insert_ob_in_map will update as
2015	* necessary, so the caller shouldn't need to do any special work.	1977	* necessary, so the caller shouldn't need to do any special work.
2016	* Note - updated to take an object instead of archetype - this is necessary	1978	* Note - updated to take an object instead of archetype - this is necessary
2017	* because arch_blocked (now ob_blocked) needs to know the movement type	1979	* because arch_blocked (now ob_blocked) needs to know the movement type
2018	* to know if the space in question will block the object. We can't use	1980	* to know if the space in question will block the object. We can't use
…		…
2020	* customized, changed states, etc.	1982	* customized, changed states, etc.
2021	*/	1983	*/
2022	int	1984	int
2023	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)	1985	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
2024	{	1986	{
		1987	int altern[SIZEOFFREE];
2025	int index = 0, flag;	1988	int index = 0, flag;
2026	int altern[SIZEOFFREE];
2027		1989
2028	for (int i = start; i < stop; i++)	1990	for (int i = start; i < stop; i++)
2029	{	1991	{
2030	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1992	mapxy pos (m, x, y); pos.move (i);
2031	if (!flag)	1993
		1994	if (!pos.normalise ())
		1995	continue;
		1996
		1997	mapspace &ms = *pos;
		1998
		1999	if (ms.flags () & P_IS_ALIVE)
		2000	continue;
		2001
		2002	/* However, often
		2003	* ob doesn't have any move type (when used to place exits)
		2004	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2005	*/
		2006	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2007	{
2032	altern [index++] = i;	2008	altern [index++] = i;
		2009	continue;
		2010	}
2033		2011
2034	/* Basically, if we find a wall on a space, we cut down the search size.	2012	/* Basically, if we find a wall on a space, we cut down the search size.
2035	* In this way, we won't return spaces that are on another side of a wall.	2013	* In this way, we won't return spaces that are on another side of a wall.
2036	* This mostly work, but it cuts down the search size in all directions -	2014	* This mostly work, but it cuts down the search size in all directions -
2037	* if the space being examined only has a wall to the north and empty	2015	* if the space being examined only has a wall to the north and empty
2038	* spaces in all the other directions, this will reduce the search space	2016	* spaces in all the other directions, this will reduce the search space
2039	* to only the spaces immediately surrounding the target area, and	2017	* to only the spaces immediately surrounding the target area, and
2040	* won't look 2 spaces south of the target space.	2018	* won't look 2 spaces south of the target space.
2041	*/	2019	*/
2042	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2020	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2021	{
2043	stop = maxfree[i];	2022	stop = maxfree[i];
		2023	continue;
		2024	}
		2025
		2026	/* Note it is intentional that we check ob - the movement type of the
		2027	* head of the object should correspond for the entire object.
		2028	*/
		2029	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2030	continue;
		2031
		2032	if (ob->blocked (m, pos.x, pos.y))
		2033	continue;
		2034
		2035	altern [index++] = i;
2044	}	2036	}
2045		2037
2046	if (!index)	2038	if (!index)
2047	return -1;	2039	return -1;
2048		2040
…		…
2057	*/	2049	*/
2058	int	2050	int
2059	find_first_free_spot (const object ob, maptile m, int x, int y)	2051	find_first_free_spot (const object ob, maptile m, int x, int y)
2060	{	2052	{
2061	for (int i = 0; i < SIZEOFFREE; i++)	2053	for (int i = 0; i < SIZEOFFREE; i++)
2062	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2054	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2063	return i;	2055	return i;
2064		2056
2065	return -1;	2057	return -1;
2066	}	2058	}
2067		2059
…		…
2344	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2336	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2345	* core dumps if they do.	2337	* core dumps if they do.
2346	*	2338	*
2347	* Add a check so we can't pick up invisible objects (0.93.8)	2339	* Add a check so we can't pick up invisible objects (0.93.8)
2348	*/	2340	*/
2349
2350	int	2341	int
2351	can_pick (const object who, const object item)	2342	can_pick (const object who, const object item)
2352	{	2343	{
2353	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2344	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2354	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2345	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2569	}	2560	}
2570	else	2561	else
2571	item = item->env;	2562	item = item->env;
2572	}	2563	}
2573		2564
2574
2575	const char *	2565	const char *
2576	object::flag_desc (char *desc, int len) const	2566	object::flag_desc (char *desc, int len) const
2577	{	2567	{
2578	char *p = desc;	2568	char *p = desc;
2579	bool first = true;	2569	bool first = true;
…		…
2606	{	2596	{
2607	char flagdesc[512];	2597	char flagdesc[512];
2608	char info2[256 * 4];	2598	char info2[256 * 4];
2609	char *p = info;	2599	char *p = info;
2610		2600
2611	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2601	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2612	count, uuid.seq,	2602	count,
		2603	uuid.c_str (),
2613	&name,	2604	&name,
2614	title ? "\",title:\"" : "",	2605	title ? "\",title:\"" : "",
2615	title ? (const char *)title : "",	2606	title ? (const char *)title : "",
2616	flag_desc (flagdesc, 512), type);	2607	flag_desc (flagdesc, 512), type);
2617		2608
2618	if (env)	2609	if (!this->flag[FLAG_REMOVED] && env)
2619	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2610	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2620		2611
2621	if (map)	2612	if (map)
2622	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2613	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2623		2614
…		…
2641	}	2632	}
2642		2633
2643	const materialtype_t *	2634	const materialtype_t *
2644	object::dominant_material () const	2635	object::dominant_material () const
2645	{	2636	{
2646	if (materialtype_t *mat = name_to_material (materialname))	2637	if (materialtype_t *mt = name_to_material (materialname))
2647	return mat;	2638	return mt;
2648		2639
2649	// omfg this is slow, this has to be temporary :)
2650	shstr unknown ("unknown");
2651
2652	return name_to_material (unknown);	2640	return name_to_material (shstr_unknown);
2653	}	2641	}
2654		2642
2655	void	2643	void
2656	object::open_container (object *new_container)	2644	object::open_container (object *new_container)
2657	{	2645	{
…		…
2673	old_container->flag [FLAG_APPLIED] = 0;	2661	old_container->flag [FLAG_APPLIED] = 0;
2674	container = 0;	2662	container = 0;
2675		2663
2676	esrv_update_item (UPD_FLAGS, this, old_container);	2664	esrv_update_item (UPD_FLAGS, this, old_container);
2677	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2665	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2666	play_sound (sound_find ("chest_close"));
2678	}	2667	}
2679		2668
2680	if (new_container)	2669	if (new_container)
2681	{	2670	{
2682	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2671	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2698	new_container->flag [FLAG_APPLIED] = 1;	2687	new_container->flag [FLAG_APPLIED] = 1;
2699	container = new_container;	2688	container = new_container;
2700		2689
2701	esrv_update_item (UPD_FLAGS, this, new_container);	2690	esrv_update_item (UPD_FLAGS, this, new_container);
2702	esrv_send_inventory (this, new_container);	2691	esrv_send_inventory (this, new_container);
		2692	play_sound (sound_find ("chest_open"));
		2693	}
		2694	}
		2695
		2696	object *
		2697	object::force_find (const shstr name)
		2698	{
		2699	/* cycle through his inventory to look for the MARK we want to
		2700	* place
		2701	*/
		2702	for (object *tmp = inv; tmp; tmp = tmp->below)
		2703	if (tmp->type == FORCE && tmp->slaying == name)
		2704	return splay (tmp);
		2705
		2706	return 0;
		2707	}
		2708
		2709	void
		2710	object::force_add (const shstr name, int duration)
		2711	{
		2712	if (object *force = force_find (name))
		2713	force->destroy ();
		2714
		2715	object *force = get_archetype (FORCE_NAME);
		2716
		2717	force->slaying = name;
		2718	force->stats.food = 1;
		2719	force->speed_left = -1.f;
		2720
		2721	force->set_speed (duration ? 1.f / duration : 0.f);
		2722	force->flag [FLAG_IS_USED_UP] = true;
		2723	force->flag [FLAG_APPLIED] = true;
		2724
		2725	insert (force);
		2726	}
		2727
		2728	void
		2729	object::play_sound (faceidx sound) const
		2730	{
		2731	if (!sound)
		2732	return;
		2733
		2734	if (flag [FLAG_REMOVED])
		2735	return;
		2736
		2737	if (env)
2703	}	2738	{
		2739	if (object *pl = in_player ())
		2740	pl->contr->play_sound (sound);
		2741	}
		2742	else
		2743	map->play_sound (sound, x, y);
2704	}	2744	}
2705		2745
2706

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.161 by root, Wed Jun 13 21:09:39 2007 UTC vs. Revision 1.207 by root, Sun Apr 20 23:25:09 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.161 by root, Wed Jun 13 21:09:39 2007 UTC vs.
Revision 1.207 by root, Sun Apr 20 23:25:09 2008 UTC