ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.144 by root, Thu May 3 10:39:46 2007 UTC vs.
Revision 1.211 by root, Mon Apr 21 21:32:32 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,2008 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.
26	sub/add_weight will transcend the environment updating the carrying
27	variable. */
28	#include <global.h>	24	#include <global.h>
29	#include <stdio.h>	25	#include <stdio.h>
30	#include <sys/types.h>	26	#include <sys/types.h>
31	#include <sys/uio.h>	27	#include <sys/uio.h>
32	#include <object.h>	28	#include <object.h>
33	#include <funcpoint.h>	29	#include <funcpoint.h>
		30	#include <sproto.h>
34	#include <loader.h>	31	#include <loader.h>
35		32
36	#include <bitset>	33	#include <bitset>
37		34
38	int nrofallocobjects = 0;	35	UUID UUID::cur;
39	static UUID uuid;	36	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	37	static const uint64 UUID_GAP = 1<<19;
41		38
42	objectvec objects;	39	objectvec objects;
43	activevec actives;	40	activevec actives;
44		41
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,	42	short freearr_x[SIZEOFFREE] = {
		43	0,
		44	0, 1, 1, 1, 0, -1, -1, -1,
		45	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	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
47	};	47	};
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,	48	short freearr_y[SIZEOFFREE] = {
		49	0,
		50	-1, -1, 0, 1, 1, 1, 0, -1,
		51	-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	52	-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	};	53	};
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,	54	int maxfree[SIZEOFFREE] = {
		55	0,
		56	9, 10, 13, 14, 17, 18, 21, 22,
		57	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	58	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	};	59	};
54	int freedir[SIZEOFFREE] = {	60	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,	61	0,
		62	1, 2, 3, 4, 5, 6, 7, 8,
		63	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	64	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	};	65	};
58		66
59	static void	67	static void
60	write_uuid (void)	68	write_uuid (uval64 skip, bool sync)
61	{	69	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	70	CALL_BEGIN (2);
63		71	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	72	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	73	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		74	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	}	75	}
79		76
80	static void	77	static void
81	read_uuid (void)	78	read_uuid (void)
82	{	79	{
83	char filename[MAX_BUF];	80	char filename[MAX_BUF];
84		81
85	sprintf (filename, "%s/uuid", settings.localdir);	82	sprintf (filename, "%s/uuid", settings.localdir);
86		83
		84	seq_next_save = 0;
		85
87	FILE *fp;	86	FILE *fp;
88		87
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_GAP, 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_GAP, 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 >= seq_next_save))
125	write_uuid ();	126	{
		127	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		128	write_uuid (UUID_GAP, false);
		129	}
		130
126		131
127	return uid;	132	return uid;
128	}	133	}
129		134
130	void	135	void
131	init_uuid ()	136	UUID::init ()
132	{	137	{
133	read_uuid ();	138	read_uuid ();
134	}	139	}
135		140
136	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	141	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
137	static int	142	static bool
138	compare_ob_value_lists_one (const object *wants, const object *has)	143	compare_ob_value_lists_one (const object *wants, const object *has)
139	{	144	{
140	key_value *wants_field;	145	key_value *wants_field;
141		146
142	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	147	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
…		…
150	key_value *has_field;	155	key_value *has_field;
151		156
152	/* Look for a field in has with the same key. */	157	/* Look for a field in has with the same key. */
153	has_field = get_ob_key_link (has, wants_field->key);	158	has_field = get_ob_key_link (has, wants_field->key);
154		159
155	if (has_field == NULL)	160	if (!has_field)
156	{
157	/* No field with that name. */	161	return 0; /* No field with that name. */
158	return FALSE;
159	}
160		162
161	/* Found the matching field. */	163	/* Found the matching field. */
162	if (has_field->value != wants_field->value)	164	if (has_field->value != wants_field->value)
163	{
164	/* Values don't match, so this half of the comparison is false. */	165	return 0; /* Values don't match, so this half of the comparison is false. */
165	return FALSE;
166	}
167		166
168	/* If we get here, we found a match. Now for the next field in wants. */	167	/* If we get here, we found a match. Now for the next field in wants. */
169	}	168	}
170		169
171	/* If we get here, every field in wants has a matching field in has. */	170	/* If we get here, every field in wants has a matching field in has. */
172	return TRUE;	171	return 1;
173	}	172	}
174		173
175	/* Returns TRUE if ob1 has the same key_values as ob2. */	174	/* Returns TRUE if ob1 has the same key_values as ob2. */
176	static int	175	static bool
177	compare_ob_value_lists (const object *ob1, const object *ob2)	176	compare_ob_value_lists (const object *ob1, const object *ob2)
178	{	177	{
179	/* However, there may be fields in has which aren't partnered in wants,	178	/* However, there may be fields in has which aren't partnered in wants,
180	* so we need to run the comparison *twice*. :(	179	* so we need to run the comparison *twice*. :(
181	*/	180	*/
…		…
202	|| ob1->speed != ob2->speed	201	|| ob1->speed != ob2->speed
203	|| ob1->value != ob2->value	202	|| ob1->value != ob2->value
204	|| ob1->name != ob2->name)	203	|| ob1->name != ob2->name)
205	return 0;	204	return 0;
206		205
207	//TODO: this ain't working well, use nicer and correct overflow check	206	/* Do not merge objects if nrof would overflow. First part checks
208	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	207	* for unsigned overflow (2c), second part checks whether the result
209	* value could not be stored in a sint32 (which unfortunately sometimes is	208	* would fit into a 32 bit signed int, which is often used to hold
210	* used to store nrof).	209	* nrof values.
211	*/	210	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)	211	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
213	return 0;	212	return 0;
214		213
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	214	/* If the objects have been identified, set the BEEN_APPLIED flag.
216	* This is to the comparison of the flags below will be OK. We	215	* This is to the comparison of the flags below will be OK. We
217	* just can't ignore the been applied or identified flags, as they	216	* just can't ignore the been applied or identified flags, as they
218	* are not equal - just if it has been identified, the been_applied	217	* are not equal - just if it has been identified, the been_applied
219	* flags lose any meaning.	218	* flags lose any meaning.
220	*/	219	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	220	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
223		222
224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
226		225
227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	226	if (ob1->arch->name != ob2->arch->name
228	|| ob1->arch != ob2->arch
229	|| ob1->name != ob2->name	227	|| ob1->name != ob2->name
230	|| ob1->title != ob2->title	228	|| ob1->title != ob2->title
231	|| ob1->msg != ob2->msg	229	|| ob1->msg != ob2->msg
232	|| ob1->weight != ob2->weight	230	|| ob1->weight != ob2->weight
233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
235	|| ob1->attacktype != ob2->attacktype	231	|| ob1->attacktype != ob2->attacktype
236	|| ob1->magic != ob2->magic	232	|| ob1->magic != ob2->magic
237	|| ob1->slaying != ob2->slaying	233	|| ob1->slaying != ob2->slaying
238	|| ob1->skill != ob2->skill	234	|| ob1->skill != ob2->skill
239	|| ob1->value != ob2->value	235	|| ob1->value != ob2->value
…		…
246	|| ob1->move_block != ob2->move_block	242	|| ob1->move_block != ob2->move_block
247	|| ob1->move_allow != ob2->move_allow	243	|| ob1->move_allow != ob2->move_allow
248	|| ob1->move_on != ob2->move_on	244	|| ob1->move_on != ob2->move_on
249	|| ob1->move_off != ob2->move_off	245	|| ob1->move_off != ob2->move_off
250	|| ob1->move_slow != ob2->move_slow	246	|| ob1->move_slow != ob2->move_slow
251	|| ob1->move_slow_penalty != ob2->move_slow_penalty)	247	|| ob1->move_slow_penalty != ob2->move_slow_penalty
		248	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		249	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
252	return 0;	250	return 0;
253		251
		252	if ((ob1->flag ^ ob2->flag)
		253	.reset (FLAG_INV_LOCKED)
		254	.reset (FLAG_CLIENT_SENT)
		255	.reset (FLAG_REMOVED)
		256	.any ())
		257	return 0;
		258
254	/* This is really a spellbook check - really, we should	259	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	260	* not merge objects with real inventories, as splitting them
		261	* is hard.
256	*/	262	*/
257	if (ob1->inv || ob2->inv)	263	if (ob1->inv || ob2->inv)
258	{	264	{
259	/* if one object has inventory but the other doesn't, not equiv */	265	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	266	return 0; /* inventories differ in length */
261	return 0;
262		267
263	/* Now check to see if the two inventory objects could merge */	268	if (ob1->inv->below || ob2->inv->below)
		269	return 0; /* more than one object in inv */
		270
264	if (!object::can_merge (ob1->inv, ob2->inv))	271	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	272	return 0; /* inventory objects differ */
266		273
267	/* inventory ok - still need to check rest of this object to see	274	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	275	* if it is valid.
269	*/	276	*/
270	}	277	}
…		…
289	if (ob1->level != ob2->level)	296	if (ob1->level != ob2->level)
290	return 0;	297	return 0;
291	break;	298	break;
292	}	299	}
293		300
294	if (ob1->key_values != NULL || ob2->key_values != NULL)	301	if (ob1->key_values || ob2->key_values)
295	{	302	{
296	/* At least one of these has key_values. */	303	/* At least one of these has key_values. */
297	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	304	if ((!ob1->key_values) != (!ob2->key_values))
298	/* One has fields, but the other one doesn't. */	305	return 0; /* One has fields, but the other one doesn't. */
		306
		307	if (!compare_ob_value_lists (ob1, ob2))
299	return 0;	308	return 0;
300	else if (!compare_ob_value_lists (ob1, ob2))
301	return 0;
302	}	309	}
303		310
304	//TODO: generate an event or call into perl for additional checks
305	if (ob1->self || ob2->self)	311	if (ob1->self || ob2->self)
306	{	312	{
307	ob1->optimise ();	313	ob1->optimise ();
308	ob2->optimise ();	314	ob2->optimise ();
309		315
310	if (ob1->self || ob2->self)	316	if (ob1->self || ob2->self)
		317	{
		318	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		319	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		320
		321	if (k1 != k2)
311	return 0;	322	return 0;
		323
		324	if (k1 == 0)
		325	return 1;
		326
		327	if (!cfperl_can_merge (ob1, ob2))
		328	return 0;
		329	}
312	}	330	}
313		331
314	/* Everything passes, must be OK. */	332	/* Everything passes, must be OK. */
315	return 1;	333	return 1;
316	}	334	}
317		335
		336	// adjust weight per container type ("of holding")
		337	static sint32
		338	weight_adjust (object *op, sint32 weight)
		339	{
		340	return op->type == CONTAINER
		341	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		342	: weight;
		343	}
		344
318	/*	345	/*
		346	* adjust_weight(object, weight) adds the specified weight to an object,
		347	* and also updates how much the environment(s) is/are carrying.
		348	*/
		349	static void
		350	adjust_weight (object *op, sint32 weight)
		351	{
		352	while (op)
		353	{
		354	weight = weight_adjust (op, weight);
		355
		356	op->carrying += weight;
		357	op = op->env;
		358	}
		359	}
		360
		361	/*
319	* sum_weight() is a recursive function which calculates the weight	362	* this is a recursive function which calculates the weight
320	* an object is carrying. It goes through in figures out how much	363	* an object is carrying. It goes through op and figures out how much
321	* containers are carrying, and sums it up.	364	* containers are carrying, and sums it up.
322	*/	365	*/
323	long	366	void
324	sum_weight (object *op)	367	object::update_weight ()
325	{	368	{
326	long sum;	369	sint32 sum = 0;
327	object *inv;
328		370
329	for (sum = 0, inv = op->inv; inv; inv = inv->below)	371	for (object *op = inv; op; op = op->below)
330	{	372	{
331	if (inv->inv)	373	if (op->inv)
332	sum_weight (inv);	374	op->update_weight ();
333		375
334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	376	sum += op->total_weight ();
335	}	377	}
336		378
337	if (op->type == CONTAINER && op->stats.Str)	379	carrying = weight_adjust (this, sum);
338	sum = (sum * (100 - op->stats.Str)) / 100;
339
340	if (op->carrying != sum)
341	op->carrying = sum;
342
343	return sum;
344	}	380	}
345		381
346	/**	382	/*
347	* Return the outermost environment object for a given object.	383	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
348	*/
349
350	object *
351	object_get_env_recursive (object *op)
352	{
353	while (op->env != NULL)
354	op = op->env;
355	return op;
356	}
357
358	/*
359	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
360	* Some error messages.
361	* The result of the dump is stored in the static global errmsg array.
362	*/	384	*/
363	char *	385	char *
364	dump_object (object *op)	386	dump_object (object *op)
365	{	387	{
366	if (!op)	388	if (!op)
…		…
374	/*	396	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	397	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	398	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	399	* If it's not a multi-object, it is returned.
378	*/	400	*/
379
380	object *	401	object *
381	get_nearest_part (object *op, const object *pl)	402	get_nearest_part (object *op, const object *pl)
382	{	403	{
383	object *tmp, *closest;	404	object *tmp, *closest;
384	int last_dist, i;	405	int last_dist, i;
385		406
386	if (op->more == NULL)	407	if (!op->more)
387	return op;	408	return op;
		409
388	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	410	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		411	tmp;
		412	tmp = tmp->more)
389	if ((i = distance (tmp, pl)) < last_dist)	413	if ((i = distance (tmp, pl)) < last_dist)
390	closest = tmp, last_dist = i;	414	closest = tmp, last_dist = i;
		415
391	return closest;	416	return closest;
392	}	417	}
393		418
394	/*	419	/*
395	* Returns the object which has the count-variable equal to the argument.	420	* Returns the object which has the count-variable equal to the argument.
		421	* VERRRY slow.
396	*/	422	*/
397	object *	423	object *
398	find_object (tag_t i)	424	find_object (tag_t i)
399	{	425	{
400	for_all_objects (op)	426	for_all_objects (op)
…		…
420	break;	446	break;
421		447
422	return op;	448	return op;
423	}	449	}
424		450
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}
430
431	/*	451	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	452	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	453	* skill and experience objects.
		454	* ACTUALLY NO! investigate! TODO
434	*/	455	*/
435	void	456	void
436	object::set_owner (object *owner)	457	object::set_owner (object *owner)
437	{	458	{
		459	// allow objects which own objects
438	if (!owner)	460	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)	461	while (owner->owner)
449	owner = owner->owner;	462	owner = owner->owner;
		463
		464	if (flag [FLAG_FREED])
		465	{
		466	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		467	return;
		468	}
450		469
451	this->owner = owner;	470	this->owner = owner;
452	}	471	}
453		472
454	void	473	int
		474	object::slottype () const
		475	{
		476	if (type == SKILL)
		477	{
		478	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		479	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		480	}
		481	else
		482	{
		483	if (slot [body_combat].info) return slot_combat;
		484	if (slot [body_range ].info) return slot_ranged;
		485	}
		486
		487	return slot_none;
		488	}
		489
		490	bool
455	object::set_weapon (object *ob)	491	object::change_weapon (object *ob)
456	{	492	{
457	if (current_weapon == ob)	493	if (current_weapon == ob)
458	return;	494	return true;
		495
		496	if (chosen_skill)
		497	chosen_skill->flag [FLAG_APPLIED] = false;
459		498
460	current_weapon = ob;	499	current_weapon = ob;
461	new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);	500	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		501
		502	if (chosen_skill)
		503	chosen_skill->flag [FLAG_APPLIED] = true;
		504
462	update_stats ();	505	update_stats ();
		506
		507	if (ob)
		508	{
		509	// now check wether any body locations became invalid, in which case
		510	// we cannot apply the weapon at the moment.
		511	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		512	if (slot[i].used < 0)
		513	{
		514	current_weapon = chosen_skill = 0;
		515	update_stats ();
		516
		517	new_draw_info_format (NDI_UNIQUE, 0, this,
		518	"You try to balance all your items at once, "
		519	"but the %s is just too much for your body. "
		520	"[You need to unapply some items first.]", &ob->name);
		521	return false;
		522	}
		523
		524	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		525	}
		526	else
		527	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		528
		529	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		530	{
		531	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		532	&name, ob->debug_desc ());
		533	return false;
		534	}
		535
		536	return true;
463	}	537	}
464		538
465	/* Zero the key_values on op, decrementing the shared-string	539	/* Zero the key_values on op, decrementing the shared-string
466	* refcounts and freeing the links.	540	* refcounts and freeing the links.
467	*/	541	*/
…		…
531	object::copy_to (object *dst)	605	object::copy_to (object *dst)
532	{	606	{
533	*dst = *this;	607	*dst = *this;
534		608
535	if (speed < 0)	609	if (speed < 0)
536	dst->speed_left = speed_left - rndm ();	610	dst->speed_left -= rndm ();
537		611
538	dst->set_speed (dst->speed);	612	dst->set_speed (dst->speed);
539	}	613	}
540		614
541	void	615	void
542	object::instantiate ()	616	object::instantiate ()
543	{	617	{
544	if (!uuid.seq) // HACK	618	if (!uuid.seq) // HACK
545	uuid = gen_uuid ();	619	uuid = UUID::gen ();
546		620
547	speed_left = -0.1f;	621	speed_left = -0.1f;
548	/* copy the body_info to the body_used - this is only really	622	/* copy the body_info to the body_used - this is only really
549	* need for monsters, but doesn't hurt to do it for everything.	623	* need for monsters, but doesn't hurt to do it for everything.
550	* by doing so, when a monster is created, it has good starting	624	* by doing so, when a monster is created, it has good starting
551	* values for the body_used info, so when items are created	625	* values for the body_used info, so when items are created
552	* for it, they can be properly equipped.	626	* for it, they can be properly equipped.
553	*/	627	*/
554	memcpy (body_used, body_info, sizeof (body_used));	628	for (int i = NUM_BODY_LOCATIONS; i--; )
		629	slot[i].used = slot[i].info;
555		630
556	attachable::instantiate ();	631	attachable::instantiate ();
557	}	632	}
558		633
559	object *	634	object *
…		…
708	static int object_count;	783	static int object_count;
709		784
710	void object::link ()	785	void object::link ()
711	{	786	{
712	assert (!index);//D	787	assert (!index);//D
713	uuid = gen_uuid ();	788	uuid = UUID::gen ();
714	count = ++object_count;	789	count = ++object_count;
715		790
716	refcnt_inc ();	791	refcnt_inc ();
717	objects.insert (this);	792	objects.insert (this);
718	}	793	}
…		…
802	* if some form of movement is allowed, let objects	877	* if some form of movement is allowed, let objects
803	* drop on that space.	878	* drop on that space.
804	*/	879	*/
805	if (!drop_to_ground	880	if (!drop_to_ground
806	|| !map	881	|| !map
807	|| map->in_memory != MAP_IN_MEMORY	882	|| map->in_memory != MAP_ACTIVE
808	|| map->nodrop	883	|| map->nodrop
809	|| ms ().move_block == MOVE_ALL)	884	|| ms ().move_block == MOVE_ALL)
810	{	885	{
811	while (inv)	886	while (inv)
812	{	887	{
…		…
867		942
868	if (!freed_map)	943	if (!freed_map)
869	{	944	{
870	freed_map = new maptile;	945	freed_map = new maptile;
871		946
		947	freed_map->path = "<freed objects map>";
872	freed_map->name = "/internal/freed_objects_map";	948	freed_map->name = "/internal/freed_objects_map";
873	freed_map->width = 3;	949	freed_map->width = 3;
874	freed_map->height = 3;	950	freed_map->height = 3;
		951	freed_map->nodrop = 1;
875		952
876	freed_map->alloc ();	953	freed_map->alloc ();
877	freed_map->in_memory = MAP_IN_MEMORY;	954	freed_map->in_memory = MAP_ACTIVE;
878	}	955	}
879		956
880	map = freed_map;	957	map = freed_map;
881	x = 1;	958	x = 1;
882	y = 1;	959	y = 1;
883	}	960	}
884		961
885	head = 0;
886
887	if (more)	962	if (more)
888	{	963	{
889	more->destroy ();	964	more->destroy ();
890	more = 0;	965	more = 0;
891	}	966	}
892		967
		968	head = 0;
		969
893	// clear those pointers that likely might have circular references to us	970	// clear those pointers that likely might cause circular references
894	owner = 0;	971	owner = 0;
895	enemy = 0;	972	enemy = 0;
896	attacked_by = 0;	973	attacked_by = 0;
		974	current_weapon = 0;
897	}	975	}
898		976
899	void	977	void
900	object::destroy (bool destroy_inventory)	978	object::destroy (bool destroy_inventory)
901	{	979	{
…		…
903	return;	981	return;
904		982
905	if (destroy_inventory)	983	if (destroy_inventory)
906	destroy_inv (false);	984	destroy_inv (false);
907		985
		986	if (is_head ())
		987	if (sound_destroy)
		988	play_sound (sound_destroy);
		989	else if (flag [FLAG_MONSTER])
		990	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
		991
908	attachable::destroy ();	992	attachable::destroy ();
909	}
910
911	/*
912	* sub_weight() recursively (outwards) subtracts a number from the
913	* weight of an object (and what is carried by it's environment(s)).
914	*/
915	void
916	sub_weight (object *op, signed long weight)
917	{
918	while (op != NULL)
919	{
920	if (op->type == CONTAINER)
921	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
922
923	op->carrying -= weight;
924	op = op->env;
925	}
926	}	993	}
927		994
928	/* op->remove ():	995	/* op->remove ():
929	* This function removes the object op from the linked list of objects	996	* This function removes the object op from the linked list of objects
930	* which it is currently tied to. When this function is done, the	997	* which it is currently tied to. When this function is done, the
…		…
951	* In this case, the object to be removed is in someones	1018	* In this case, the object to be removed is in someones
952	* inventory.	1019	* inventory.
953	*/	1020	*/
954	if (env)	1021	if (env)
955	{	1022	{
		1023	adjust_weight (env, -total_weight ());
		1024
		1025	*(above ? &above->below : &env->inv) = below;
		1026
956	if (nrof)	1027	if (below)
957	sub_weight (env, weight * nrof);	1028	below->above = above;
958	else	1029
959	sub_weight (env, weight + carrying);	1030	/* we set up values so that it could be inserted into
		1031	* the map, but we don't actually do that - it is up
		1032	* to the caller to decide what we want to do.
		1033	*/
		1034	map = env->map;
		1035	x = env->x;
		1036	y = env->y;
		1037	above = 0;
		1038	below = 0;
		1039	env = 0;
960		1040
961	/* NO_FIX_PLAYER is set when a great many changes are being	1041	/* NO_FIX_PLAYER is set when a great many changes are being
962	* made to players inventory. If set, avoiding the call	1042	* made to players inventory. If set, avoiding the call
963	* to save cpu time.	1043	* to save cpu time.
964	*/	1044	*/
965	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1045	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
966	otmp->update_stats ();	1046	otmp->update_stats ();
967
968	if (above)
969	above->below = below;
970	else
971	env->inv = below;
972
973	if (below)
974	below->above = above;
975
976	/* we set up values so that it could be inserted into
977	* the map, but we don't actually do that - it is up
978	* to the caller to decide what we want to do.
979	*/
980	x = env->x, y = env->y;
981	map = env->map;
982	above = 0, below = 0;
983	env = 0;
984	}	1047	}
985	else if (map)	1048	else if (map)
986	{	1049	{
987	if (type == PLAYER)	1050	if (type == PLAYER)
988	{	1051	{
…		…
1026	if (map->in_memory == MAP_SAVING)	1089	if (map->in_memory == MAP_SAVING)
1027	return;	1090	return;
1028		1091
1029	int check_walk_off = !flag [FLAG_NO_APPLY];	1092	int check_walk_off = !flag [FLAG_NO_APPLY];
1030		1093
		1094	if (object *pl = ms.player ())
		1095	{
		1096	if (pl->container == this)
		1097	/* If a container that the player is currently using somehow gets
		1098	* removed (most likely destroyed), update the player view
		1099	* appropriately.
		1100	*/
		1101	pl->close_container ();
		1102
		1103	pl->contr->ns->floorbox_update ();
		1104	}
		1105
1031	for (tmp = ms.bot; tmp; tmp = tmp->above)	1106	for (tmp = ms.bot; tmp; tmp = tmp->above)
1032	{	1107	{
1033	/* No point updating the players look faces if he is the object	1108	/* No point updating the players look faces if he is the object
1034	* being removed.	1109	* being removed.
1035	*/	1110	*/
1036
1037	if (tmp->type == PLAYER && tmp != this)
1038	{
1039	/* If a container that the player is currently using somehow gets
1040	* removed (most likely destroyed), update the player view
1041	* appropriately.
1042	*/
1043	if (tmp->container == this)
1044	{
1045	flag [FLAG_APPLIED] = 0;
1046	tmp->container = 0;
1047	}
1048
1049	if (tmp->contr->ns)
1050	tmp->contr->ns->floorbox_update ();
1051	}
1052		1111
1053	/* See if object moving off should effect something */	1112	/* See if object moving off should effect something */
1054	if (check_walk_off	1113	if (check_walk_off
1055	&& ((move_type & tmp->move_off)	1114	&& ((move_type & tmp->move_off)
1056	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1115	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1059		1118
1060	if (destroyed ())	1119	if (destroyed ())
1061	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1120	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1062	}	1121	}
1063		1122
1064	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1065	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1066	if (tmp->above == tmp)
1067	tmp->above = 0;
1068
1069	last = tmp;	1123	last = tmp;
1070	}	1124	}
1071		1125
1072	/* last == NULL if there are no objects on this space */	1126	/* last == NULL if there are no objects on this space */
1073	//TODO: this makes little sense, why only update the topmost object?	1127	//TODO: this makes little sense, why only update the topmost object?
…		…
1093	merge_ob (object *op, object *top)	1147	merge_ob (object *op, object *top)
1094	{	1148	{
1095	if (!op->nrof)	1149	if (!op->nrof)
1096	return 0;	1150	return 0;
1097		1151
1098	if (top)	1152	if (!top)
1099	for (top = op; top && top->above; top = top->above)	1153	for (top = op; top && top->above; top = top->above)
1100	;	1154	;
1101		1155
1102	for (; top; top = top->below)	1156	for (; top; top = top->below)
1103	{	1157	{
…		…
1124	if (more)	1178	if (more)
1125	return;	1179	return;
1126		1180
1127	object *prev = this;	1181	object *prev = this;
1128		1182
1129	for (archetype *at = arch->more; at; at = at->more)	1183	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1130	{	1184	{
1131	object *op = arch_to_object (at);	1185	object *op = arch_to_object (at);
1132		1186
1133	op->name = name;	1187	op->name = name;
1134	op->name_pl = name_pl;	1188	op->name_pl = name_pl;
…		…
1148	object *	1202	object *
1149	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1203	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1150	{	1204	{
1151	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1205	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1152	{	1206	{
1153	tmp->x = x + tmp->arch->clone.x;	1207	tmp->x = x + tmp->arch->x;
1154	tmp->y = y + tmp->arch->clone.y;	1208	tmp->y = y + tmp->arch->y;
1155	}	1209	}
1156		1210
1157	return insert_ob_in_map (op, m, originator, flag);	1211	return insert_ob_in_map (op, m, originator, flag);
1158	}	1212	}
1159		1213
…		…
1180	object *	1234	object *
1181	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1235	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1182	{	1236	{
1183	assert (!op->flag [FLAG_FREED]);	1237	assert (!op->flag [FLAG_FREED]);
1184		1238
1185	object *tmp, *top, *floor = NULL;	1239	object *top, *floor = NULL;
1186		1240
1187	op->remove ();	1241	op->remove ();
1188
1189	#if 0
1190	if (!m->active != !op->active)
1191	if (m->active)
1192	op->activate_recursive ();
1193	else
1194	op->deactivate_recursive ();
1195	#endif
1196
1197	if (out_of_map (m, op->x, op->y))
1198	{
1199	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1200	#ifdef MANY_CORES
1201	/* Better to catch this here, as otherwise the next use of this object
1202	* is likely to cause a crash. Better to find out where it is getting
1203	* improperly inserted.
1204	*/
1205	abort ();
1206	#endif
1207	return op;
1208	}
1209
1210	if (object *more = op->more)
1211	{
1212	if (!insert_ob_in_map (more, m, originator, flag))
1213	{
1214	if (!op->head)
1215	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1216
1217	return 0;
1218	}
1219	}
1220
1221	CLEAR_FLAG (op, FLAG_REMOVED);
1222		1242
1223	/* Ideally, the caller figures this out. However, it complicates a lot	1243	/* Ideally, the caller figures this out. However, it complicates a lot
1224	* of areas of callers (eg, anything that uses find_free_spot would now	1244	* of areas of callers (eg, anything that uses find_free_spot would now
1225	* need extra work	1245	* need extra work
1226	*/	1246	*/
1227	if (!xy_normalise (m, op->x, op->y))	1247	if (!xy_normalise (m, op->x, op->y))
		1248	{
		1249	op->destroy ();
1228	return 0;	1250	return 0;
		1251	}
		1252
		1253	if (object *more = op->more)
		1254	if (!insert_ob_in_map (more, m, originator, flag))
		1255	return 0;
		1256
		1257	CLEAR_FLAG (op, FLAG_REMOVED);
1229		1258
1230	op->map = m;	1259	op->map = m;
1231	mapspace &ms = op->ms ();	1260	mapspace &ms = op->ms ();
1232		1261
1233	/* this has to be done after we translate the coordinates.	1262	/* this has to be done after we translate the coordinates.
1234	*/	1263	*/
1235	if (op->nrof && !(flag & INS_NO_MERGE))	1264	if (op->nrof && !(flag & INS_NO_MERGE))
1236	for (tmp = ms.bot; tmp; tmp = tmp->above)	1265	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1237	if (object::can_merge (op, tmp))	1266	if (object::can_merge (op, tmp))
1238	{	1267	{
1239	op->nrof += tmp->nrof;	1268	op->nrof += tmp->nrof;
1240	tmp->destroy ();	1269	tmp->destroy (1);
1241	}	1270	}
1242		1271
1243	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1272	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1244	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1273	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1245		1274
…		…
1268	else	1297	else
1269	{	1298	{
1270	top = ms.bot;	1299	top = ms.bot;
1271		1300
1272	/* If there are other objects, then */	1301	/* If there are other objects, then */
1273	if ((!(flag & INS_MAP_LOAD)) && top)	1302	if (top)
1274	{	1303	{
1275	object *last = 0;	1304	object *last = 0;
1276		1305
1277	/*	1306	/*
1278	* If there are multiple objects on this space, we do some trickier handling.	1307	* If there are multiple objects on this space, we do some trickier handling.
…		…
1331	if (last && last->below && last != floor)	1360	if (last && last->below && last != floor)
1332	top = last->below;	1361	top = last->below;
1333	}	1362	}
1334	} /* If objects on this space */	1363	} /* If objects on this space */
1335		1364
1336	if (flag & INS_MAP_LOAD)
1337	top = ms.top;
1338
1339	if (flag & INS_ABOVE_FLOOR_ONLY)	1365	if (flag & INS_ABOVE_FLOOR_ONLY)
1340	top = floor;	1366	top = floor;
1341		1367
1342	/* Top is the object that our object (op) is going to get inserted above.	1368	/* Top is the object that our object (op) is going to get inserted above.
1343	*/	1369	*/
…		…
1375	op->map->touch ();	1401	op->map->touch ();
1376	}	1402	}
1377		1403
1378	op->map->dirty = true;	1404	op->map->dirty = true;
1379		1405
1380	/* If we have a floor, we know the player, if any, will be above
1381	* it, so save a few ticks and start from there.
1382	*/
1383	if (!(flag & INS_MAP_LOAD))
1384	if (object *pl = ms.player ())	1406	if (object *pl = ms.player ())
1385	if (pl->contr->ns)
1386	pl->contr->ns->floorbox_update ();	1407	pl->contr->ns->floorbox_update ();
1387		1408
1388	/* If this object glows, it may affect lighting conditions that are	1409	/* If this object glows, it may affect lighting conditions that are
1389	* visible to others on this map. But update_all_los is really	1410	* visible to others on this map. But update_all_los is really
1390	* an inefficient way to do this, as it means los for all players	1411	* an inefficient way to do this, as it means los for all players
1391	* on the map will get recalculated. The players could very well	1412	* on the map will get recalculated. The players could very well
…		…
1410	* blocked() and wall() work properly), and these flags are updated by	1431	* blocked() and wall() work properly), and these flags are updated by
1411	* update_object().	1432	* update_object().
1412	*/	1433	*/
1413		1434
1414	/* if this is not the head or flag has been passed, don't check walk on status */	1435	/* if this is not the head or flag has been passed, don't check walk on status */
1415	if (!(flag & INS_NO_WALK_ON) && !op->head)	1436	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1416	{	1437	{
1417	if (check_move_on (op, originator))	1438	if (check_move_on (op, originator))
1418	return 0;	1439	return 0;
1419		1440
1420	/* If we are a multi part object, lets work our way through the check	1441	/* If we are a multi part object, lets work our way through the check
1421	* walk on's.	1442	* walk on's.
1422	*/	1443	*/
1423	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1444	for (object *tmp = op->more; tmp; tmp = tmp->more)
1424	if (check_move_on (tmp, originator))	1445	if (check_move_on (tmp, originator))
1425	return 0;	1446	return 0;
1426	}	1447	}
1427		1448
1428	return op;	1449	return op;
…		…
1433	* op is the object to insert it under: supplies x and the map.	1454	* op is the object to insert it under: supplies x and the map.
1434	*/	1455	*/
1435	void	1456	void
1436	replace_insert_ob_in_map (const char *arch_string, object *op)	1457	replace_insert_ob_in_map (const char *arch_string, object *op)
1437	{	1458	{
1438	object *tmp, *tmp1;
1439
1440	/* first search for itself and remove any old instances */	1459	/* first search for itself and remove any old instances */
1441		1460
1442	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1461	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1443	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1462	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1444	tmp->destroy ();	1463	tmp->destroy (1);
1445		1464
1446	tmp1 = arch_to_object (archetype::find (arch_string));	1465	object *tmp = arch_to_object (archetype::find (arch_string));
1447		1466
1448	tmp1->x = op->x;	1467	tmp->x = op->x;
1449	tmp1->y = op->y;	1468	tmp->y = op->y;
		1469
1450	insert_ob_in_map (tmp1, op->map, op, 0);	1470	insert_ob_in_map (tmp, op->map, op, 0);
1451	}	1471	}
1452		1472
1453	object *	1473	object *
1454	object::insert_at (object *where, object *originator, int flags)	1474	object::insert_at (object *where, object *originator, int flags)
1455	{	1475	{
		1476	if (where->env)
		1477	return where->env->insert (this);
		1478	else
1456	return where->map->insert (this, where->x, where->y, originator, flags);	1479	return where->map->insert (this, where->x, where->y, originator, flags);
1457	}	1480	}
1458		1481
1459	/*	1482	// find player who can see this object
1460	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1483	static object *
1461	* is returned contains nr objects, and the remaining parts contains	1484	visible_to (object *op)
1462	* the rest (or is removed and freed if that number is 0).
1463	* On failure, NULL is returned, and the reason put into the
1464	* global static errmsg array.
1465	*/
1466	object *
1467	get_split_ob (object *orig_ob, uint32 nr)
1468	{	1485	{
1469	object *newob;	1486	if (!op->flag [FLAG_REMOVED])
1470	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1471
1472	if (orig_ob->nrof < nr)
1473	{
1474	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1475	return NULL;
1476	}	1487	{
1477		1488	// see if we are in a container of sorts
1478	newob = object_create_clone (orig_ob);	1489	if (object *env = op->env)
1479
1480	if ((orig_ob->nrof -= nr) < 1)
1481	orig_ob->destroy (1);
1482	else if (!is_removed)
1483	{
1484	if (orig_ob->env != NULL)
1485	sub_weight (orig_ob->env, orig_ob->weight * nr);
1486	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1487	{
1488	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1489	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1490	return NULL;
1491	}	1490	{
1492	}	1491	// the player inventory itself is always visible
		1492	if (env->type == PLAYER)
		1493	return env;
1493		1494
1494	newob->nrof = nr;	1495	// else a player could have our env open
		1496	env = env->outer_env ();
1495		1497
		1498	// the player itself is always on a map, so we will find him here
		1499	// even if our inv is in a player.
		1500	if (env->is_on_map ())
		1501	if (object *pl = env->ms ().player ())
		1502	if (pl->container == op->env)
		1503	return pl;
		1504	}
		1505	else
		1506	{
		1507	// maybe there is a player standing on the same mapspace
		1508	if (object *pl = op->ms ().player ())
		1509	return pl;
		1510	}
		1511	}
		1512
1496	return newob;	1513	return 0;
1497	}	1514	}
1498		1515
1499	/*	1516	/*
1500	* decrease_ob_nr(object, number) decreases a specified number from	1517	* decrease(object, number) decreases a specified number from
1501	* the amount of an object. If the amount reaches 0, the object	1518	* the amount of an object. If the amount reaches 0, the object
1502	* is subsequently removed and freed.	1519	* is subsequently removed and freed.
1503	*	1520	*
1504	* Return value: 'op' if something is left, NULL if the amount reached 0	1521	* Return value: 'op' if something is left, NULL if the amount reached 0
1505	*/	1522	*/
		1523	bool
		1524	object::decrease (sint32 nr)
		1525	{
		1526	nr = min (nr, nrof);
		1527
		1528	if (!nr)
		1529	return 1;
		1530
		1531	nrof -= nr;
		1532
		1533	object *visible = visible_to (this);
		1534
		1535	if (nrof)
		1536	{
		1537	adjust_weight (env, -weight * nr); // carrying == 0
		1538
		1539	if (visible)
		1540	esrv_send_item (visible, this);
		1541
		1542	return 1;
		1543	}
		1544	else
		1545	{
		1546	if (visible)
		1547	esrv_del_item (visible->contr, count);
		1548
		1549	this->destroy (1);
		1550	return 0;
		1551	}
		1552	}
		1553
		1554	/*
		1555	* split(ob,nr) splits up ob into two parts. The part which
		1556	* is returned contains nr objects, and the remaining parts contains
		1557	* the rest (or is removed and returned if that number is 0).
		1558	* On failure, NULL is returned.
		1559	*/
1506	object *	1560	object *
1507	decrease_ob_nr (object *op, uint32 i)	1561	object::split (sint32 nr)
1508	{	1562	{
1509	object *tmp;	1563	if (nrof < nr)
1510
1511	if (i == 0) /* objects with op->nrof require this check */
1512	return op;	1564	return 0;
1513		1565	else if (nrof == nr)
1514	if (i > op->nrof)
1515	i = op->nrof;
1516
1517	if (QUERY_FLAG (op, FLAG_REMOVED))
1518	op->nrof -= i;
1519	else if (op->env)
1520	{	1566	{
1521	/* is this object in the players inventory, or sub container
1522	* therein?
1523	*/
1524	tmp = op->in_player ();
1525	/* nope. Is this a container the player has opened?
1526	* If so, set tmp to that player.
1527	* IMO, searching through all the players will mostly
1528	* likely be quicker than following op->env to the map,
1529	* and then searching the map for a player.
1530	*/
1531	if (!tmp)
1532	for_all_players (pl)
1533	if (pl->ob->container == op->env)
1534	{
1535	tmp = pl->ob;
1536	break;
1537	}
1538
1539	if (i < op->nrof)
1540	{
1541	sub_weight (op->env, op->weight * i);
1542	op->nrof -= i;
1543	if (tmp)
1544	esrv_send_item (tmp, op);
1545	}
1546	else
1547	{
1548	op->remove ();	1567	remove ();
1549	op->nrof = 0;	1568	return this;
1550	if (tmp)
1551	esrv_del_item (tmp->contr, op->count);
1552	}
1553	}	1569	}
1554	else	1570	else
1555	{	1571	{
1556	object *above = op->above;	1572	decrease (nr);
1557		1573
1558	if (i < op->nrof)	1574	object *op = object_create_clone (this);
1559	op->nrof -= i;	1575	op->nrof = nr;
1560	else
1561	{
1562	op->remove ();
1563	op->nrof = 0;
1564	}
1565
1566	/* Since we just removed op, op->above is null */
1567	for (tmp = above; tmp; tmp = tmp->above)
1568	if (tmp->type == PLAYER)
1569	{
1570	if (op->nrof)
1571	esrv_send_item (tmp, op);
1572	else
1573	esrv_del_item (tmp->contr, op->count);
1574	}
1575	}
1576
1577	if (op->nrof)
1578	return op;	1576	return op;
1579	else
1580	{
1581	op->destroy ();
1582	return 0;
1583	}
1584	}
1585
1586	/*
1587	* add_weight(object, weight) adds the specified weight to an object,
1588	* and also updates how much the environment(s) is/are carrying.
1589	*/
1590	void
1591	add_weight (object *op, signed long weight)
1592	{
1593	while (op != NULL)
1594	{
1595	if (op->type == CONTAINER)
1596	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1597
1598	op->carrying += weight;
1599	op = op->env;
1600	}	1577	}
1601	}	1578	}
1602		1579
1603	object *	1580	object *
1604	insert_ob_in_ob (object *op, object *where)	1581	insert_ob_in_ob (object *op, object *where)
…		…
1609	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1586	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1610	free (dump);	1587	free (dump);
1611	return op;	1588	return op;
1612	}	1589	}
1613		1590
1614	if (where->head)	1591	if (where->head_ () != where)
1615	{	1592	{
1616	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1593	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1617	where = where->head;	1594	where = where->head;
1618	}	1595	}
1619		1596
1620	return where->insert (op);	1597	return where->insert (op);
1621	}	1598	}
…		…
1629	* be != op, if items are merged. -Tero	1606	* be != op, if items are merged. -Tero
1630	*/	1607	*/
1631	object *	1608	object *
1632	object::insert (object *op)	1609	object::insert (object *op)
1633	{	1610	{
1634	object *tmp, *otmp;
1635
1636	if (!QUERY_FLAG (op, FLAG_REMOVED))
1637	op->remove ();
1638
1639	if (op->more)	1611	if (op->more)
1640	{	1612	{
1641	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1613	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1642	return op;	1614	return op;
1643	}	1615	}
1644		1616
1645	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1617	op->remove ();
1646	CLEAR_FLAG (op, FLAG_REMOVED);	1618
		1619	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1620
1647	if (op->nrof)	1621	if (op->nrof)
1648	{
1649	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1622	for (object *tmp = inv; tmp; tmp = tmp->below)
1650	if (object::can_merge (tmp, op))	1623	if (object::can_merge (tmp, op))
1651	{	1624	{
1652	/* return the original object and remove inserted object	1625	/* return the original object and remove inserted object
1653	(client needs the original object) */	1626	(client needs the original object) */
1654	tmp->nrof += op->nrof;	1627	tmp->nrof += op->nrof;
1655	/* Weight handling gets pretty funky. Since we are adding to
1656	* tmp->nrof, we need to increase the weight.
1657	*/
1658	add_weight (this, op->weight * op->nrof);	1628	adjust_weight (this, op->total_weight ());
1659	SET_FLAG (op, FLAG_REMOVED);	1629
1660	op->destroy (); /* free the inserted object */	1630	op->destroy (1);
1661	op = tmp;	1631	op = tmp;
1662	op->remove (); /* and fix old object's links */	1632	goto inserted;
1663	CLEAR_FLAG (op, FLAG_REMOVED);
1664	break;
1665	}	1633	}
1666		1634
1667	/* I assume combined objects have no inventory	1635	op->owner = 0; // it's his/hers now. period.
1668	* We add the weight - this object could have just been removed	1636	op->map = 0;
1669	* (if it was possible to merge). calling remove_ob will subtract	1637	op->x = 0;
1670	* the weight, so we need to add it in again, since we actually do	1638	op->y = 0;
1671	* the linking below
1672	*/
1673	add_weight (this, op->weight * op->nrof);
1674	}
1675	else
1676	add_weight (this, (op->weight + op->carrying));
1677		1639
1678	otmp = this->in_player ();	1640	op->above = 0;
1679	if (otmp && otmp->contr)	1641	op->below = inv;
		1642	op->env = this;
		1643
		1644	if (inv)
		1645	inv->above = op;
		1646
		1647	inv = op;
		1648
		1649	op->flag [FLAG_REMOVED] = 0;
		1650
		1651	adjust_weight (this, op->total_weight ());
		1652
		1653	inserted:
		1654	/* reset the light list and los of the players on the map */
		1655	if (op->glow_radius && map && map->darkness)
		1656	update_all_los (map, x, y);
		1657
		1658	if (object *otmp = in_player ())
1680	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1659	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1681	otmp->update_stats ();	1660	otmp->update_stats ();
1682
1683	op->map = 0;
1684	op->env = this;
1685	op->above = 0;
1686	op->below = 0;
1687	op->x = 0, op->y = 0;
1688
1689	/* reset the light list and los of the players on the map */
1690	if ((op->glow_radius != 0) && map)
1691	{
1692	#ifdef DEBUG_LIGHTS
1693	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1694	#endif /* DEBUG_LIGHTS */
1695	if (map->darkness)
1696	update_all_los (map, x, y);
1697	}
1698
1699	/* Client has no idea of ordering so lets not bother ordering it here.
1700	* It sure simplifies this function...
1701	*/
1702	if (!inv)
1703	inv = op;
1704	else
1705	{
1706	op->below = inv;
1707	op->below->above = op;
1708	inv = op;
1709	}
1710		1661
1711	INVOKE_OBJECT (INSERT, this);	1662	INVOKE_OBJECT (INSERT, this);
1712		1663
1713	return op;	1664	return op;
1714	}	1665	}
…		…
1929	* activate recursively a flag on an object inventory	1880	* activate recursively a flag on an object inventory
1930	*/	1881	*/
1931	void	1882	void
1932	flag_inv (object *op, int flag)	1883	flag_inv (object *op, int flag)
1933	{	1884	{
1934	if (op->inv)
1935	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1885	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1936	{	1886	{
1937	SET_FLAG (tmp, flag);	1887	SET_FLAG (tmp, flag);
1938	flag_inv (tmp, flag);	1888	flag_inv (tmp, flag);
1939	}	1889	}
1940	}	1890	}
1941		1891
1942	/*	1892	/*
1943	* deactivate recursively a flag on an object inventory	1893	* deactivate recursively a flag on an object inventory
1944	*/	1894	*/
1945	void	1895	void
1946	unflag_inv (object *op, int flag)	1896	unflag_inv (object *op, int flag)
1947	{	1897	{
1948	if (op->inv)
1949	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1898	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1950	{	1899	{
1951	CLEAR_FLAG (tmp, flag);	1900	CLEAR_FLAG (tmp, flag);
1952	unflag_inv (tmp, flag);	1901	unflag_inv (tmp, flag);
1953	}	1902	}
1954	}
1955
1956	/*
1957	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1958	* all it's inventory (recursively).
1959	* If checksums are used, a player will get set_cheat called for
1960	* him/her-self and all object carried by a call to this function.
1961	*/
1962	void
1963	set_cheat (object *op)
1964	{
1965	SET_FLAG (op, FLAG_WAS_WIZ);
1966	flag_inv (op, FLAG_WAS_WIZ);
1967	}	1903	}
1968		1904
1969	/*	1905	/*
1970	* find_free_spot(object, map, x, y, start, stop) will search for	1906	* find_free_spot(object, map, x, y, start, stop) will search for
1971	* a spot at the given map and coordinates which will be able to contain	1907	* a spot at the given map and coordinates which will be able to contain
…		…
1973	* to search (see the freearr_x/y[] definition).	1909	* to search (see the freearr_x/y[] definition).
1974	* It returns a random choice among the alternatives found.	1910	* It returns a random choice among the alternatives found.
1975	* start and stop are where to start relative to the free_arr array (1,9	1911	* start and stop are where to start relative to the free_arr array (1,9
1976	* does all 4 immediate directions). This returns the index into the	1912	* does all 4 immediate directions). This returns the index into the
1977	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1913	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1978	* Note - this only checks to see if there is space for the head of the
1979	* object - if it is a multispace object, this should be called for all
1980	* pieces.
1981	* Note2: This function does correctly handle tiled maps, but does not	1914	* Note: This function does correctly handle tiled maps, but does not
1982	* inform the caller. However, insert_ob_in_map will update as	1915	* inform the caller. However, insert_ob_in_map will update as
1983	* necessary, so the caller shouldn't need to do any special work.	1916	* necessary, so the caller shouldn't need to do any special work.
1984	* Note - updated to take an object instead of archetype - this is necessary	1917	* Note - updated to take an object instead of archetype - this is necessary
1985	* because arch_blocked (now ob_blocked) needs to know the movement type	1918	* because arch_blocked (now ob_blocked) needs to know the movement type
1986	* to know if the space in question will block the object. We can't use	1919	* to know if the space in question will block the object. We can't use
…		…
1988	* customized, changed states, etc.	1921	* customized, changed states, etc.
1989	*/	1922	*/
1990	int	1923	int
1991	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1924	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
1992	{	1925	{
		1926	int altern[SIZEOFFREE];
1993	int index = 0, flag;	1927	int index = 0, flag;
1994	int altern[SIZEOFFREE];
1995		1928
1996	for (int i = start; i < stop; i++)	1929	for (int i = start; i < stop; i++)
1997	{	1930	{
1998	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1931	mapxy pos (m, x, y); pos.move (i);
1999	if (!flag)	1932
		1933	if (!pos.normalise ())
		1934	continue;
		1935
		1936	mapspace &ms = *pos;
		1937
		1938	if (ms.flags () & P_IS_ALIVE)
		1939	continue;
		1940
		1941	/* However, often
		1942	* ob doesn't have any move type (when used to place exits)
		1943	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1944	*/
		1945	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1946	{
2000	altern [index++] = i;	1947	altern [index++] = i;
		1948	continue;
		1949	}
2001		1950
2002	/* Basically, if we find a wall on a space, we cut down the search size.	1951	/* Basically, if we find a wall on a space, we cut down the search size.
2003	* In this way, we won't return spaces that are on another side of a wall.	1952	* In this way, we won't return spaces that are on another side of a wall.
2004	* This mostly work, but it cuts down the search size in all directions -	1953	* This mostly work, but it cuts down the search size in all directions -
2005	* if the space being examined only has a wall to the north and empty	1954	* if the space being examined only has a wall to the north and empty
2006	* spaces in all the other directions, this will reduce the search space	1955	* spaces in all the other directions, this will reduce the search space
2007	* to only the spaces immediately surrounding the target area, and	1956	* to only the spaces immediately surrounding the target area, and
2008	* won't look 2 spaces south of the target space.	1957	* won't look 2 spaces south of the target space.
2009	*/	1958	*/
2010	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1959	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1960	{
2011	stop = maxfree[i];	1961	stop = maxfree[i];
		1962	continue;
		1963	}
		1964
		1965	/* Note it is intentional that we check ob - the movement type of the
		1966	* head of the object should correspond for the entire object.
		1967	*/
		1968	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1969	continue;
		1970
		1971	if (ob->blocked (m, pos.x, pos.y))
		1972	continue;
		1973
		1974	altern [index++] = i;
2012	}	1975	}
2013		1976
2014	if (!index)	1977	if (!index)
2015	return -1;	1978	return -1;
2016		1979
…		…
2025	*/	1988	*/
2026	int	1989	int
2027	find_first_free_spot (const object *ob, maptile *m, int x, int y)	1990	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2028	{	1991	{
2029	for (int i = 0; i < SIZEOFFREE; i++)	1992	for (int i = 0; i < SIZEOFFREE; i++)
2030	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	1993	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2031	return i;	1994	return i;
2032		1995
2033	return -1;	1996	return -1;
2034	}	1997	}
2035		1998
…		…
2089	object *tmp;	2052	object *tmp;
2090	maptile *mp;	2053	maptile *mp;
2091		2054
2092	MoveType blocked, move_type;	2055	MoveType blocked, move_type;
2093		2056
2094	if (exclude && exclude->head)	2057	if (exclude && exclude->head_ () != exclude)
2095	{	2058	{
2096	exclude = exclude->head;	2059	exclude = exclude->head;
2097	move_type = exclude->move_type;	2060	move_type = exclude->move_type;
2098	}	2061	}
2099	else	2062	else
…		…
2122	max = maxfree[i];	2085	max = maxfree[i];
2123	else if (mflags & P_IS_ALIVE)	2086	else if (mflags & P_IS_ALIVE)
2124	{	2087	{
2125	for (tmp = ms.bot; tmp; tmp = tmp->above)	2088	for (tmp = ms.bot; tmp; tmp = tmp->above)
2126	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2089	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2127	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))	2090	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2128	break;	2091	break;
2129		2092
2130	if (tmp)	2093	if (tmp)
2131	return freedir[i];	2094	return freedir[i];
2132	}	2095	}
…		…
2312	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2275	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2313	* core dumps if they do.	2276	* core dumps if they do.
2314	*	2277	*
2315	* Add a check so we can't pick up invisible objects (0.93.8)	2278	* Add a check so we can't pick up invisible objects (0.93.8)
2316	*/	2279	*/
2317
2318	int	2280	int
2319	can_pick (const object *who, const object *item)	2281	can_pick (const object *who, const object *item)
2320	{	2282	{
2321	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2283	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2322	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2284	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2327	* create clone from object to another	2289	* create clone from object to another
2328	*/	2290	*/
2329	object *	2291	object *
2330	object_create_clone (object *asrc)	2292	object_create_clone (object *asrc)
2331	{	2293	{
2332	object *dst = 0, *tmp, *src, *part, *prev, *item;	2294	object *dst = 0, *tmp, *src, *prev, *item;
2333		2295
2334	if (!asrc)	2296	if (!asrc)
2335	return 0;	2297	return 0;
2336		2298
2337	src = asrc;
2338	if (src->head)
2339	src = src->head;	2299	src = asrc->head_ ();
2340		2300
2341	prev = 0;	2301	prev = 0;
2342	for (part = src; part; part = part->more)	2302	for (object *part = src; part; part = part->more)
2343	{	2303	{
2344	tmp = part->clone ();	2304	tmp = part->clone ();
2345	tmp->x -= src->x;	2305	tmp->x -= src->x;
2346	tmp->y -= src->y;	2306	tmp->y -= src->y;
2347		2307
…		…
2460	/* Basically, if the archetype has this key set,	2420	/* Basically, if the archetype has this key set,
2461	* we need to store the null value so when we save	2421	* we need to store the null value so when we save
2462	* it, we save the empty value so that when we load,	2422	* it, we save the empty value so that when we load,
2463	* we get this value back again.	2423	* we get this value back again.
2464	*/	2424	*/
2465	if (get_ob_key_link (&op->arch->clone, canonical_key))	2425	if (get_ob_key_link (op->arch, canonical_key))
2466	field->value = 0;	2426	field->value = 0;
2467	else	2427	else
2468	{	2428	{
2469	if (last)	2429	if (last)
2470	last->next = field->next;	2430	last->next = field->next;
…		…
2539	}	2499	}
2540	else	2500	else
2541	item = item->env;	2501	item = item->env;
2542	}	2502	}
2543		2503
2544
2545	const char *	2504	const char *
2546	object::flag_desc (char *desc, int len) const	2505	object::flag_desc (char *desc, int len) const
2547	{	2506	{
2548	char *p = desc;	2507	char *p = desc;
2549	bool first = true;	2508	bool first = true;
…		…
2576	{	2535	{
2577	char flagdesc[512];	2536	char flagdesc[512];
2578	char info2[256 * 4];	2537	char info2[256 * 4];
2579	char *p = info;	2538	char *p = info;
2580		2539
2581	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2540	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2582	count, uuid.seq,	2541	count,
		2542	uuid.c_str (),
2583	&name,	2543	&name,
2584	title ? "\",title:\"" : "",	2544	title ? "\",title:\"" : "",
2585	title ? (const char *)title : "",	2545	title ? (const char *)title : "",
2586	flag_desc (flagdesc, 512), type);	2546	flag_desc (flagdesc, 512), type);
2587		2547
2588	if (env)	2548	if (!this->flag[FLAG_REMOVED] && env)
2589	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2549	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2590		2550
2591	if (map)	2551	if (map)
2592	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2552	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2593		2553
…		…
2611	}	2571	}
2612		2572
2613	const materialtype_t *	2573	const materialtype_t *
2614	object::dominant_material () const	2574	object::dominant_material () const
2615	{	2575	{
2616	if (materialtype_t *mat = name_to_material (materialname))	2576	if (materialtype_t *mt = name_to_material (materialname))
2617	return mat;	2577	return mt;
2618		2578
2619	// omfg this is slow, this has to be temporary :)
2620	shstr unknown ("unknown");
2621
2622	return name_to_material (unknown);	2579	return name_to_material (shstr_unknown);
2623	}	2580	}
2624		2581
2625	void	2582	void
2626	object::open_container (object *new_container)	2583	object::open_container (object *new_container)
2627	{	2584	{
…		…
2643	old_container->flag [FLAG_APPLIED] = 0;	2600	old_container->flag [FLAG_APPLIED] = 0;
2644	container = 0;	2601	container = 0;
2645		2602
2646	esrv_update_item (UPD_FLAGS, this, old_container);	2603	esrv_update_item (UPD_FLAGS, this, old_container);
2647	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2604	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2605	play_sound (sound_find ("chest_close"));
2648	}	2606	}
2649		2607
2650	if (new_container)	2608	if (new_container)
2651	{	2609	{
2652	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2610	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2668	new_container->flag [FLAG_APPLIED] = 1;	2626	new_container->flag [FLAG_APPLIED] = 1;
2669	container = new_container;	2627	container = new_container;
2670		2628
2671	esrv_update_item (UPD_FLAGS, this, new_container);	2629	esrv_update_item (UPD_FLAGS, this, new_container);
2672	esrv_send_inventory (this, new_container);	2630	esrv_send_inventory (this, new_container);
		2631	play_sound (sound_find ("chest_open"));
		2632	}
		2633	}
		2634
		2635	object *
		2636	object::force_find (const shstr name)
		2637	{
		2638	/* cycle through his inventory to look for the MARK we want to
		2639	* place
		2640	*/
		2641	for (object *tmp = inv; tmp; tmp = tmp->below)
		2642	if (tmp->type == FORCE && tmp->slaying == name)
		2643	return splay (tmp);
		2644
		2645	return 0;
		2646	}
		2647
		2648	void
		2649	object::force_add (const shstr name, int duration)
		2650	{
		2651	if (object *force = force_find (name))
		2652	force->destroy ();
		2653
		2654	object *force = get_archetype (FORCE_NAME);
		2655
		2656	force->slaying = name;
		2657	force->stats.food = 1;
		2658	force->speed_left = -1.f;
		2659
		2660	force->set_speed (duration ? 1.f / duration : 0.f);
		2661	force->flag [FLAG_IS_USED_UP] = true;
		2662	force->flag [FLAG_APPLIED] = true;
		2663
		2664	insert (force);
		2665	}
		2666
		2667	void
		2668	object::play_sound (faceidx sound)
		2669	{
		2670	if (!sound)
		2671	return;
		2672
		2673	if (flag [FLAG_REMOVED])
		2674	return;
		2675
		2676	if (env)
2673	}	2677	{
		2678	if (object *pl = in_player ())
		2679	pl->contr->play_sound (sound);
		2680	}
		2681	else
		2682	map->play_sound (sound, x, y);
2674	}	2683	}
2675		2684
2676

Diff Legend

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