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.48 by root, Thu Sep 14 23:13:48 2006 UTC vs.
Revision 1.204 by root, Fri Apr 11 17:01:52 2008 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3		3	*
		4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
8	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
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	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
18	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
20		21	* The authors can be reached via e-mail to <support@deliantra.net>
21	The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	22	*/
23		23
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
26	variable. */	26	variable. */
27	#include <global.h>	27	#include <global.h>
28	#include <stdio.h>	28	#include <stdio.h>
29	#include <sys/types.h>	29	#include <sys/types.h>
30	#include <sys/uio.h>	30	#include <sys/uio.h>
31	#include <object.h>	31	#include <object.h>
32	#include <funcpoint.h>	32	#include <funcpoint.h>
		33	#include <sproto.h>
33	#include <loader.h>	34	#include <loader.h>
34		35
35	int nrofallocobjects = 0;	36	#include <bitset>
36	static UUID uuid;	37
		38	UUID UUID::cur;
		39	static uint64_t seq_next_save;
37	const uint64 UUID_SKIP = 1<<19;	40	static const uint64 UUID_GAP = 1<<19;
38		41
39	object *active_objects; /* List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
40		44
41	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	45	short freearr_x[SIZEOFFREE] = {
		46	0,
		47	0, 1, 1, 1, 0, -1, -1, -1,
		48	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
42	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	49	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
43	};	50	};
44	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	51	short freearr_y[SIZEOFFREE] = {
		52	0,
		53	-1, -1, 0, 1, 1, 1, 0, -1,
		54	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
45	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	55	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
46	};	56	};
47	int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,	57	int maxfree[SIZEOFFREE] = {
		58	0,
		59	9, 10, 13, 14, 17, 18, 21, 22,
		60	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
48	48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49	61	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
49	};	62	};
50	int freedir[SIZEOFFREE] = {	63	int freedir[SIZEOFFREE] = {
51	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	64	0,
		65	1, 2, 3, 4, 5, 6, 7, 8,
		66	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
52	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	67	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
53	};	68	};
54		69
55	static void	70	static void
56	write_uuid (void)	71	write_uuid (uval64 skip, bool sync)
57	{	72	{
58	char filename1[MAX_BUF], filename2[MAX_BUF];	73	CALL_BEGIN (2);
59		74	CALL_ARG_SV (newSVval64 (skip));
60	sprintf (filename1, "%s/uuid", settings.localdir);	75	CALL_ARG_SV (boolSV (sync));
61	sprintf (filename2, "%s/uuid~", settings.localdir);	76	CALL_CALL ("cf::write_uuid", G_DISCARD);
62		77	CALL_END;
63	FILE *fp;
64
65	if (!(fp = fopen (filename2, "w")))
66	{
67	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
68	return;
69	}
70
71	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
72	fclose (fp);
73	rename (filename2, filename1);
74	}	78	}
75		79
76	static void	80	static void
77	read_uuid (void)	81	read_uuid (void)
78	{	82	{
79	char filename[MAX_BUF];	83	char filename[MAX_BUF];
80		84
81	sprintf (filename, "%s/uuid", settings.localdir);	85	sprintf (filename, "%s/uuid", settings.localdir);
82		86
		87	seq_next_save = 0;
		88
83	FILE *fp;	89	FILE *fp;
84		90
85	if (!(fp = fopen (filename, "r")))	91	if (!(fp = fopen (filename, "r")))
86	{	92	{
87	if (errno == ENOENT)	93	if (errno == ENOENT)
88	{	94	{
89	LOG (llevInfo, "RESET uid to 1\n");	95	LOG (llevInfo, "RESET uid to 1\n");
90	uuid.seq = 0;	96	UUID::cur.seq = 0;
91	write_uuid ();	97	write_uuid (UUID_GAP, true);
92	return;	98	return;
93	}	99	}
94		100
95	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	101	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
96	_exit (1);	102	_exit (1);
97	}	103	}
98		104
99	int version;	105	UUID::BUF buf;
100	unsigned long long uid;	106	buf[0] = 0;
101	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	107	fgets (buf, sizeof (buf), fp);
		108
		109	if (!UUID::cur.parse (buf))
102	{	110	{
103	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	111	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
104	_exit (1);	112	_exit (1);
105	}	113	}
106		114
107	uuid.seq = uid;
108	write_uuid ();
109	LOG (llevDebug, "read UID: %lld\n", uid);	115	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
		116
		117	write_uuid (UUID_GAP, true);
110	fclose (fp);	118	fclose (fp);
111	}	119	}
112		120
113	UUID	121	UUID
114	gen_uuid ()	122	UUID::gen ()
115	{	123	{
116	UUID uid;	124	UUID uid;
117		125
118	uid.seq = ++uuid.seq;	126	uid.seq = ++cur.seq;
119		127
120	if (!(uuid.seq & (UUID_SKIP - 1)))	128	if (expect_false (cur.seq >= seq_next_save))
121	write_uuid ();	129	{
		130	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		131	write_uuid (UUID_GAP, false);
		132	}
		133
122		134
123	return uid;	135	return uid;
124	}	136	}
125		137
126	void	138	void
127	init_uuid ()	139	UUID::init ()
128	{	140	{
129	read_uuid ();	141	read_uuid ();
130	}	142	}
131		143
132	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	144	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
…		…
139	* objects with lists are rare, and lists stay short. If not, use a	151	* objects with lists are rare, and lists stay short. If not, use a
140	* different structure or at least keep the lists sorted...	152	* different structure or at least keep the lists sorted...
141	*/	153	*/
142		154
143	/* For each field in wants, */	155	/* For each field in wants, */
144	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	156	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
145	{	157	{
146	key_value *has_field;	158	key_value *has_field;
147		159
148	/* Look for a field in has with the same key. */	160	/* Look for a field in has with the same key. */
149	has_field = get_ob_key_link (has, wants_field->key);	161	has_field = get_ob_key_link (has, wants_field->key);
…		…
183	*	195	*
184	* Note that this function appears a lot longer than the macro it	196	* Note that this function appears a lot longer than the macro it
185	* replaces - this is mostly for clarity - a decent compiler should hopefully	197	* replaces - this is mostly for clarity - a decent compiler should hopefully
186	* reduce this to the same efficiency.	198	* reduce this to the same efficiency.
187	*	199	*
188	* Check nrof variable *before* calling CAN_MERGE()	200	* Check nrof variable *before* calling can_merge()
189	*	201	*
190	* Improvements made with merge: Better checking on potion, and also	202	* Improvements made with merge: Better checking on potion, and also
191	* check weight	203	* check weight
192	*/	204	*/
193
194	bool object::can_merge (object *ob1, object *ob2)	205	bool object::can_merge_slow (object *ob1, object *ob2)
195	{	206	{
196	/* A couple quicksanity checks */	207	/* A couple quicksanity checks */
197	if ((ob1 == ob2) || (ob1->type != ob2->type))	208	if (ob1 == ob2
		209	|| ob1->type != ob2->type
		210	|| ob1->speed != ob2->speed
		211	|| ob1->value != ob2->value
		212	|| ob1->name != ob2->name)
198	return 0;	213	return 0;
199		214
200	if (ob1->speed != ob2->speed)	215	//TODO: this ain't working well, use nicer and correct overflow check
201	return 0;
202
203	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	216	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
204	* value could not be stored in a sint32 (which unfortunately sometimes is	217	* value could not be stored in a sint32 (which unfortunately sometimes is
205	* used to store nrof).	218	* used to store nrof).
206	*/	219	*/
207	if (ob1->nrof + ob2->nrof >= 1UL << 31)	220	if (ob1->nrof + ob2->nrof >= 1UL << 31)
…		…
217	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	230	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
218		231
219	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	232	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
220	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	233	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
221		234
222		235	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
223	/* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something	236	|| ob1->arch != ob2->arch
224	* being locked in inventory should prevent merging.
225	* 0x4 in flags3 is CLIENT_SENT
226	*/
227	if ((ob1->arch != ob2->arch) ||
228	(ob1->flags[0] != ob2->flags[0]) ||
229	(ob1->flags[1] != ob2->flags[1]) ||
230	((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
231	((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
232	(ob1->name != ob2->name) ||	237	|| ob1->name != ob2->name
233	(ob1->title != ob2->title) ||	238	|| ob1->title != ob2->title
234	(ob1->msg != ob2->msg) ||	239	|| ob1->msg != ob2->msg
235	(ob1->weight != ob2->weight) ||	240	|| ob1->weight != ob2->weight
236	(memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) ||	241	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
237	(memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) ||	242	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
238	(ob1->attacktype != ob2->attacktype) ||	243	|| ob1->attacktype != ob2->attacktype
239	(ob1->magic != ob2->magic) ||	244	|| ob1->magic != ob2->magic
240	(ob1->slaying != ob2->slaying) ||	245	|| ob1->slaying != ob2->slaying
241	(ob1->skill != ob2->skill) ||	246	|| ob1->skill != ob2->skill
242	(ob1->value != ob2->value) ||	247	|| ob1->value != ob2->value
243	(ob1->animation_id != ob2->animation_id) ||	248	|| ob1->animation_id != ob2->animation_id
244	(ob1->client_type != ob2->client_type) ||	249	|| ob1->client_type != ob2->client_type
245	(ob1->materialname != ob2->materialname) ||	250	|| ob1->materialname != ob2->materialname
246	(ob1->lore != ob2->lore) ||	251	|| ob1->lore != ob2->lore
247	(ob1->subtype != ob2->subtype) ||	252	|| ob1->subtype != ob2->subtype
248	(ob1->move_type != ob2->move_type) ||	253	|| ob1->move_type != ob2->move_type
249	(ob1->move_block != ob2->move_block) ||	254	|| ob1->move_block != ob2->move_block
250	(ob1->move_allow != ob2->move_allow) ||	255	|| ob1->move_allow != ob2->move_allow
251	(ob1->move_on != ob2->move_on) ||	256	|| ob1->move_on != ob2->move_on
252	(ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty))	257	|| ob1->move_off != ob2->move_off
		258	|| ob1->move_slow != ob2->move_slow
		259	|| ob1->move_slow_penalty != ob2->move_slow_penalty)
253	return 0;	260	return 0;
254		261
255	/* This is really a spellbook check - really, we should	262	/* This is really a spellbook check - really, we should
256	* check all objects in the inventory.	263	* check all objects in the inventory.
257	*/	264	*/
258	if (ob1->inv || ob2->inv)	265	if (ob1->inv || ob2->inv)
259	{	266	{
260	/* if one object has inventory but the other doesn't, not equiv */
261	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
262	return 0;
263
264	/* Now check to see if the two inventory objects could merge */
265	if (!CAN_MERGE (ob1->inv, ob2->inv))	267	if (!(ob1->inv && ob2->inv))
266	return 0;	268	return 0; /* inventories differ in length */
		269
		270	if (ob1->inv->below || ob2->inv->below)
		271	return 0; /* more than one object in inv */
		272
		273	if (!object::can_merge (ob1->inv, ob2->inv))
		274	return 0; /* inventory objexts differ */
267		275
268	/* inventory ok - still need to check rest of this object to see	276	/* inventory ok - still need to check rest of this object to see
269	* if it is valid.	277	* if it is valid.
270	*/	278	*/
271	}	279	}
…		…
279		287
280	/* Note sure why the following is the case - either the object has to	288	/* Note sure why the following is the case - either the object has to
281	* be animated or have a very low speed. Is this an attempted monster	289	* be animated or have a very low speed. Is this an attempted monster
282	* check?	290	* check?
283	*/	291	*/
284	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	292	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
285	return 0;	293	return 0;
286		294
287	switch (ob1->type)	295	switch (ob1->type)
288	{	296	{
289	case SCROLL:	297	case SCROLL:
…		…
300	return 0;	308	return 0;
301	else if (!compare_ob_value_lists (ob1, ob2))	309	else if (!compare_ob_value_lists (ob1, ob2))
302	return 0;	310	return 0;
303	}	311	}
304		312
305	//TODO: generate an event or call into perl for additional checks
306	if (ob1->self || ob2->self)	313	if (ob1->self || ob2->self)
307	{	314	{
308	ob1->optimise ();	315	ob1->optimise ();
309	ob2->optimise ();	316	ob2->optimise ();
310		317
311	if (ob1->self || ob2->self)	318	if (ob1->self || ob2->self)
		319	{
		320	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		321	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		322
		323	if (k1 != k2)
312	return 0;	324	return 0;
		325	else if (k1 == 0)
		326	return 1;
		327	else if (!cfperl_can_merge (ob1, ob2))
		328	return 0;
		329	}
313	}	330	}
314		331
315	/* Everything passes, must be OK. */	332	/* Everything passes, must be OK. */
316	return 1;	333	return 1;
317	}	334	}
…		…
325	sum_weight (object *op)	342	sum_weight (object *op)
326	{	343	{
327	long sum;	344	long sum;
328	object *inv;	345	object *inv;
329		346
330	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	347	for (sum = 0, inv = op->inv; inv; inv = inv->below)
331	{	348	{
332	if (inv->inv)	349	if (inv->inv)
333	sum_weight (inv);	350	sum_weight (inv);
		351
334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	352	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
335	}	353	}
336		354
337	if (op->type == CONTAINER && op->stats.Str)	355	if (op->type == CONTAINER && op->stats.Str)
338	sum = (sum * (100 - op->stats.Str)) / 100;	356	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
354	op = op->env;	372	op = op->env;
355	return op;	373	return op;
356	}	374	}
357		375
358	/*	376	/*
359	* Eneq(@csd.uu.se): Since we can have items buried in a character we need
360	* a better check. We basically keeping traversing up until we can't
361	* or find a player.
362	*/
363
364	object *
365	is_player_inv (object *op)
366	{
367	for (; op != NULL && op->type != PLAYER; op = op->env)
368	if (op->env == op)
369	op->env = NULL;
370	return op;
371	}
372
373	/*
374	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	377	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
375	* Some error messages.	378	* Some error messages.
376	* The result of the dump is stored in the static global errmsg array.	379	* The result of the dump is stored in the static global errmsg array.
377	*/	380	*/
378		381	char *
379	void
380	dump_object2 (object *op)
381	{
382	errmsg[0] = 0;
383	return;
384	//TODO//D#d#
385	#if 0
386	char *cp;
387
388	/* object *tmp;*/
389
390	if (op->arch != NULL)
391	{
392	strcat (errmsg, "arch ");
393	strcat (errmsg, op->arch->name ? op->arch->name : "(null)");
394	strcat (errmsg, "\n");
395	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
396	strcat (errmsg, cp);
397	# if 0
398	/* Don't dump player diffs - they are too long, mostly meaningless, and
399	* will overflow the buffer.
400	* Changed so that we don't dump inventory either. This may
401	* also overflow the buffer.
402	*/
403	if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
404	strcat (errmsg, cp);
405	for (tmp = op->inv; tmp; tmp = tmp->below)
406	dump_object2 (tmp);
407	# endif
408	strcat (errmsg, "end\n");
409	}
410	else
411	{
412	strcat (errmsg, "Object ");
413	if (op->name == NULL)
414	strcat (errmsg, "(null)");
415	else
416	strcat (errmsg, op->name);
417	strcat (errmsg, "\n");
418	# if 0
419	if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
420	strcat (errmsg, cp);
421	for (tmp = op->inv; tmp; tmp = tmp->below)
422	dump_object2 (tmp);
423	# endif
424	strcat (errmsg, "end\n");
425	}
426	#endif
427	}
428
429	/*
430	* Dumps an object. Returns output in the static global errmsg array.
431	*/
432
433	void
434	dump_object (object *op)	382	dump_object (object *op)
435	{	383	{
436	if (op == NULL)	384	if (!op)
437	{	385	return strdup ("[NULLOBJ]");
438	strcpy (errmsg, "[NULL pointer]");
439	return;
440	}
441	errmsg[0] = '\0';
442	dump_object2 (op);
443	}
444		386
445	void	387	object_freezer freezer;
446	dump_all_objects (void)	388	op->write (freezer);
447	{	389	return freezer.as_string ();
448	object *op;
449
450	for (op = object::first; op != NULL; op = op->next)
451	{
452	dump_object (op);
453	fprintf (logfile, "Object %s\n", errmsg);
454	}
455	}	390	}
456		391
457	/*	392	/*
458	* get_nearest_part(multi-object, object 2) returns the part of the	393	* get_nearest_part(multi-object, object 2) returns the part of the
459	* multi-object 1 which is closest to the second object.	394	* multi-object 1 which is closest to the second object.
460	* If it's not a multi-object, it is returned.	395	* If it's not a multi-object, it is returned.
461	*/	396	*/
462
463	object *	397	object *
464	get_nearest_part (object *op, const object *pl)	398	get_nearest_part (object *op, const object *pl)
465	{	399	{
466	object *tmp, *closest;	400	object *tmp, *closest;
467	int last_dist, i;	401	int last_dist, i;
…		…
475	}	409	}
476		410
477	/*	411	/*
478	* Returns the object which has the count-variable equal to the argument.	412	* Returns the object which has the count-variable equal to the argument.
479	*/	413	*/
480
481	object *	414	object *
482	find_object (tag_t i)	415	find_object (tag_t i)
483	{	416	{
484	object *op;	417	for_all_objects (op)
485
486	for (op = object::first; op != NULL; op = op->next)
487	if (op->count == i)	418	if (op->count == i)
488	break;
489
490	return op;	419	return op;
		420
		421	return 0;
491	}	422	}
492		423
493	/*	424	/*
494	* Returns the first object which has a name equal to the argument.	425	* Returns the first object which has a name equal to the argument.
495	* Used only by the patch command, but not all that useful.	426	* Used only by the patch command, but not all that useful.
496	* Enables features like "patch <name-of-other-player> food 999"	427	* Enables features like "patch <name-of-other-player> food 999"
497	*/	428	*/
498
499	object *	429	object *
500	find_object_name (const char *str)	430	find_object_name (const char *str)
501	{	431	{
502	shstr_cmp str_ (str);	432	shstr_cmp str_ (str);
503	object *op;	433	object *op;
504		434
505	for (op = object::first; op != NULL; op = op->next)	435	for_all_objects (op)
506	if (op->name == str_)	436	if (op->name == str_)
507	break;	437	break;
508		438
509	return op;	439	return op;
510	}	440	}
511		441
512	void
513	free_all_object_data ()
514	{
515	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
516	}
517
518	/*	442	/*
519	* Sets the owner and sets the skill and exp pointers to owner's current	443	* Sets the owner and sets the skill and exp pointers to owner's current
520	* skill and experience objects.	444	* skill and experience objects.
		445	* ACTUALLY NO! investigate! TODO
521	*/	446	*/
522	void	447	void
523	object::set_owner (object *owner)	448	object::set_owner (object *owner)
524	{	449	{
		450	// allow objects which own objects
525	if (!owner)	451	if (owner)
526	return;
527
528	/* next line added to allow objects which own objects */
529	/* Add a check for ownercounts in here, as I got into an endless loop
530	* with the fireball owning a poison cloud which then owned the
531	* fireball. I believe that was caused by one of the objects getting
532	* freed and then another object replacing it. Since the ownercounts
533	* didn't match, this check is valid and I believe that cause is valid.
534	*/
535	while (owner->owner)	452	while (owner->owner)
536	owner = owner->owner;	453	owner = owner->owner;
		454
		455	if (flag [FLAG_FREED])
		456	{
		457	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		458	return;
		459	}
537		460
538	this->owner = owner;	461	this->owner = owner;
		462	}
		463
		464	int
		465	object::slottype () const
		466	{
		467	if (type == SKILL)
		468	{
		469	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		470	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		471	}
		472	else
		473	{
		474	if (slot [body_combat].info) return slot_combat;
		475	if (slot [body_range ].info) return slot_ranged;
		476	}
		477
		478	return slot_none;
		479	}
		480
		481	bool
		482	object::change_weapon (object *ob)
		483	{
		484	if (current_weapon == ob)
		485	return true;
		486
		487	if (chosen_skill)
		488	chosen_skill->flag [FLAG_APPLIED] = false;
		489
		490	current_weapon = ob;
		491	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		492
		493	if (chosen_skill)
		494	chosen_skill->flag [FLAG_APPLIED] = true;
		495
		496	update_stats ();
		497
		498	if (ob)
		499	{
		500	// now check wether any body locations became invalid, in which case
		501	// we cannot apply the weapon at the moment.
		502	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		503	if (slot[i].used < 0)
		504	{
		505	current_weapon = chosen_skill = 0;
		506	update_stats ();
		507
		508	new_draw_info_format (NDI_UNIQUE, 0, this,
		509	"You try to balance all your items at once, "
		510	"but the %s is just too much for your body. "
		511	"[You need to unapply some items first.]", &ob->name);
		512	return false;
		513	}
		514
		515	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		516	}
		517	else
		518	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		519
		520	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		521	{
		522	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		523	&name, ob->debug_desc ());
		524	return false;
		525	}
		526
		527	return true;
539	}	528	}
540		529
541	/* Zero the key_values on op, decrementing the shared-string	530	/* Zero the key_values on op, decrementing the shared-string
542	* refcounts and freeing the links.	531	* refcounts and freeing the links.
543	*/	532	*/
544	static void	533	static void
545	free_key_values (object *op)	534	free_key_values (object *op)
546	{	535	{
547	for (key_value *i = op->key_values; i != 0;)	536	for (key_value *i = op->key_values; i; )
548	{	537	{
549	key_value *next = i->next;	538	key_value *next = i->next;
550	delete i;	539	delete i;
551		540
552	i = next;	541	i = next;
553	}	542	}
554		543
555	op->key_values = 0;	544	op->key_values = 0;
556	}	545	}
557		546
558	void object::clear ()	547	object &
		548	object::operator =(const object &src)
559	{	549	{
560	attachable_base::clear ();	550	bool is_freed = flag [FLAG_FREED];
		551	bool is_removed = flag [FLAG_REMOVED];
561		552
562	free_key_values (this);	553	*(object_copy *)this = src;
563		554
564	owner = 0;	555	flag [FLAG_FREED] = is_freed;
565	name = 0;	556	flag [FLAG_REMOVED] = is_removed;
566	name_pl = 0;
567	title = 0;
568	race = 0;
569	slaying = 0;
570	skill = 0;
571	msg = 0;
572	lore = 0;
573	custom_name = 0;
574	materialname = 0;
575	contr = 0;
576	below = 0;
577	above = 0;
578	inv = 0;
579	container = 0;
580	env = 0;
581	more = 0;
582	head = 0;
583	map = 0;
584	active_next = 0;
585	active_prev = 0;
586
587	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
588
589	SET_FLAG (this, FLAG_REMOVED);
590
591	/* What is not cleared is next, prev, and count */
592
593	expmul = 1.0;
594	face = blank_face;
595
596	if (settings.casting_time)
597	casting_time = -1;
598	}
599
600	void object::clone (object *destination)
601	{
602	*(object_copy *)destination = *this;
603	*(object_pod *)destination = *this;
604
605	if (self || cb)
606	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
607	}
608
609	/*
610	* copy object first frees everything allocated by the second object,
611	* and then copies the contends of the first object into the second
612	* object, allocating what needs to be allocated. Basically, any
613	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
614	* if the first object is freed, the pointers in the new object
615	* will point at garbage.
616	*/
617	void
618	copy_object (object *op2, object *op)
619	{
620	bool is_freed = QUERY_FLAG (op, FLAG_FREED);
621	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
622
623	op2->clone (op);
624
625	if (is_freed)
626	SET_FLAG (op, FLAG_FREED);
627	if (is_removed)
628	SET_FLAG (op, FLAG_REMOVED);
629
630	if (op2->speed < 0)
631	op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0;
632		557
633	/* Copy over key_values, if any. */	558	/* Copy over key_values, if any. */
634	if (op2->key_values)	559	if (src.key_values)
635	{	560	{
636	key_value *tail = 0;	561	key_value *tail = 0;
637	key_value *i;
638
639	op->key_values = 0;	562	key_values = 0;
640		563
641	for (i = op2->key_values; i; i = i->next)	564	for (key_value *i = src.key_values; i; i = i->next)
642	{	565	{
643	key_value *new_link = new key_value;	566	key_value *new_link = new key_value;
644		567
645	new_link->next = 0;	568	new_link->next = 0;
646	new_link->key = i->key;	569	new_link->key = i->key;
647	new_link->value = i->value;	570	new_link->value = i->value;
648		571
649	/* Try and be clever here, too. */	572	/* Try and be clever here, too. */
650	if (!op->key_values)	573	if (!key_values)
651	{	574	{
652	op->key_values = new_link;	575	key_values = new_link;
653	tail = new_link;	576	tail = new_link;
654	}	577	}
655	else	578	else
656	{	579	{
657	tail->next = new_link;	580	tail->next = new_link;
658	tail = new_link;	581	tail = new_link;
659	}	582	}
660	}	583	}
661	}	584	}
		585	}
662		586
663	update_ob_speed (op);	587	/*
		588	* copy_to first frees everything allocated by the dst object,
		589	* and then copies the contents of itself into the second
		590	* object, allocating what needs to be allocated. Basically, any
		591	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		592	* if the first object is freed, the pointers in the new object
		593	* will point at garbage.
		594	*/
		595	void
		596	object::copy_to (object *dst)
		597	{
		598	*dst = *this;
		599
		600	if (speed < 0)
		601	dst->speed_left -= rndm ();
		602
		603	dst->set_speed (dst->speed);
		604	}
		605
		606	void
		607	object::instantiate ()
		608	{
		609	if (!uuid.seq) // HACK
		610	uuid = UUID::gen ();
		611
		612	speed_left = -0.1f;
		613	/* copy the body_info to the body_used - this is only really
		614	* need for monsters, but doesn't hurt to do it for everything.
		615	* by doing so, when a monster is created, it has good starting
		616	* values for the body_used info, so when items are created
		617	* for it, they can be properly equipped.
		618	*/
		619	for (int i = NUM_BODY_LOCATIONS; i--; )
		620	slot[i].used = slot[i].info;
		621
		622	attachable::instantiate ();
		623	}
		624
		625	object *
		626	object::clone ()
		627	{
		628	object *neu = create ();
		629	copy_to (neu);
		630	return neu;
664	}	631	}
665		632
666	/*	633	/*
667	* If an object with the IS_TURNABLE() flag needs to be turned due	634	* If an object with the IS_TURNABLE() flag needs to be turned due
668	* to the closest player being on the other side, this function can	635	* to the closest player being on the other side, this function can
669	* be called to update the face variable, _and_ how it looks on the map.	636	* be called to update the face variable, _and_ how it looks on the map.
670	*/	637	*/
671
672	void	638	void
673	update_turn_face (object *op)	639	update_turn_face (object *op)
674	{	640	{
675	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	641	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
676	return;	642	return;
		643
677	SET_ANIMATION (op, op->direction);	644	SET_ANIMATION (op, op->direction);
678	update_object (op, UP_OBJ_FACE);	645	update_object (op, UP_OBJ_FACE);
679	}	646	}
680		647
681	/*	648	/*
682	* Updates the speed of an object. If the speed changes from 0 to another	649	* Updates the speed of an object. If the speed changes from 0 to another
683	* value, or vice versa, then add/remove the object from the active list.	650	* value, or vice versa, then add/remove the object from the active list.
684	* This function needs to be called whenever the speed of an object changes.	651	* This function needs to be called whenever the speed of an object changes.
685	*/	652	*/
686	void	653	void
687	update_ob_speed (object *op)	654	object::set_speed (float speed)
688	{	655	{
689	extern int arch_init;	656	if (flag [FLAG_FREED] && speed)
690
691	/* No reason putting the archetypes objects on the speed list,
692	* since they never really need to be updated.
693	*/
694
695	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
696	{	657	{
697	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	658	LOG (llevError, "Object %s is freed but has speed.\n", &name);
698	#ifdef MANY_CORES
699	abort ();
700	#else
701	op->speed = 0;	659	speed = 0;
702	#endif
703	}
704
705	if (arch_init)
706	return;
707
708	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
709	{	660	}
710	/* If already on active list, don't do anything */
711	if (op->active_next || op->active_prev || op == active_objects)
712	return;
713		661
714	/* process_events() expects us to insert the object at the beginning	662	this->speed = speed;
715	* of the list. */
716	op->active_next = active_objects;
717		663
718	if (op->active_next != NULL)	664	if (has_active_speed ())
719	op->active_next->active_prev = op;	665	activate ();
720
721	active_objects = op;
722	}
723	else	666	else
724	{	667	deactivate ();
725	/* If not on the active list, nothing needs to be done */
726	if (!op->active_next && !op->active_prev && op != active_objects)
727	return;
728
729	if (op->active_prev == NULL)
730	{
731	active_objects = op->active_next;
732
733	if (op->active_next != NULL)
734	op->active_next->active_prev = NULL;
735	}
736	else
737	{
738	op->active_prev->active_next = op->active_next;
739
740	if (op->active_next)
741	op->active_next->active_prev = op->active_prev;
742	}
743
744	op->active_next = NULL;
745	op->active_prev = NULL;
746	}
747	}	668	}
748		669
749	/* This function removes object 'op' from the list of active
750	* objects.
751	* This should only be used for style maps or other such
752	* reference maps where you don't want an object that isn't
753	* in play chewing up cpu time getting processed.
754	* The reverse of this is to call update_ob_speed, which
755	* will do the right thing based on the speed of the object.
756	*/
757	void
758	remove_from_active_list (object *op)
759	{
760	/* If not on the active list, nothing needs to be done */
761	if (!op->active_next && !op->active_prev && op != active_objects)
762	return;
763
764	if (op->active_prev == NULL)
765	{
766	active_objects = op->active_next;
767	if (op->active_next != NULL)
768	op->active_next->active_prev = NULL;
769	}
770	else
771	{
772	op->active_prev->active_next = op->active_next;
773	if (op->active_next)
774	op->active_next->active_prev = op->active_prev;
775	}
776	op->active_next = NULL;
777	op->active_prev = NULL;
778	}
779
780	/*	670	/*
781	* update_object() updates the array which represents the map.	671	* update_object() updates the the map.
782	* It takes into account invisible objects (and represent squares covered	672	* It takes into account invisible objects (and represent squares covered
783	* by invisible objects by whatever is below them (unless it's another	673	* by invisible objects by whatever is below them (unless it's another
784	* invisible object, etc...)	674	* invisible object, etc...)
785	* If the object being updated is beneath a player, the look-window	675	* If the object being updated is beneath a player, the look-window
786	* of that player is updated (this might be a suboptimal way of	676	* of that player is updated (this might be a suboptimal way of
787	* updating that window, though, since update_object() is called _often_)	677	* updating that window, though, since update_object() is called _often_)
788	*	678	*
789	* action is a hint of what the caller believes need to be done.	679	* action is a hint of what the caller believes need to be done.
790	* For example, if the only thing that has changed is the face (due to
791	* an animation), we don't need to call update_position until that actually
792	* comes into view of a player. OTOH, many other things, like addition/removal
793	* of walls or living creatures may need us to update the flags now.
794	* current action are:	680	* current action are:
795	* UP_OBJ_INSERT: op was inserted	681	* UP_OBJ_INSERT: op was inserted
796	* UP_OBJ_REMOVE: op was removed	682	* UP_OBJ_REMOVE: op was removed
797	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	683	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
798	* as that is easier than trying to look at what may have changed.	684	* as that is easier than trying to look at what may have changed.
799	* UP_OBJ_FACE: only the objects face has changed.	685	* UP_OBJ_FACE: only the objects face has changed.
800	*/	686	*/
801
802	void	687	void
803	update_object (object *op, int action)	688	update_object (object *op, int action)
804	{	689	{
805	int update_now = 0, flags;
806	MoveType move_on, move_off, move_block, move_slow;
807
808	if (op == NULL)	690	if (op == NULL)
809	{	691	{
810	/* this should never happen */	692	/* this should never happen */
811	LOG (llevDebug, "update_object() called for NULL object.\n");	693	LOG (llevDebug, "update_object() called for NULL object.\n");
812	return;	694	return;
813	}	695	}
814		696
815	if (op->env != NULL)	697	if (op->env)
816	{	698	{
817	/* Animation is currently handled by client, so nothing	699	/* Animation is currently handled by client, so nothing
818	* to do in this case.	700	* to do in this case.
819	*/	701	*/
820	return;	702	return;
…		…
825	*/	707	*/
826	if (!op->map || op->map->in_memory == MAP_SAVING)	708	if (!op->map || op->map->in_memory == MAP_SAVING)
827	return;	709	return;
828		710
829	/* make sure the object is within map boundaries */	711	/* make sure the object is within map boundaries */
830	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	712	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
831	{	713	{
832	LOG (llevError, "update_object() called for object out of map!\n");	714	LOG (llevError, "update_object() called for object out of map!\n");
833	#ifdef MANY_CORES	715	#ifdef MANY_CORES
834	abort ();	716	abort ();
835	#endif	717	#endif
836	return;	718	return;
837	}	719	}
838		720
839	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	721	mapspace &m = op->ms ();
840	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
841	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
842	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
843	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
844	move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
845		722
		723	if (!(m.flags_ & P_UPTODATE))
		724	/* nop */;
846	if (action == UP_OBJ_INSERT)	725	else if (action == UP_OBJ_INSERT)
847	{	726	{
		727	// this is likely overkill, TODO: revisit (schmorp)
848	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	728	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
849	update_now = 1;
850
851	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	729	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
852	update_now = 1;	730	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
853		731	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		732	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
854	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	733	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
855	update_now = 1;
856
857	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
858	update_now = 1;
859
860	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
861	update_now = 1;
862
863	if ((move_on | op->move_on) != move_on)	734	|| (m.move_on | op->move_on ) != m.move_on
864	update_now = 1;
865
866	if ((move_off | op->move_off) != move_off)	735	|| (m.move_off | op->move_off ) != m.move_off
867	update_now = 1;	736	|| (m.move_slow | op->move_slow) != m.move_slow
868
869	/* This isn't perfect, but I don't expect a lot of objects to	737	/* This isn't perfect, but I don't expect a lot of objects to
870	* to have move_allow right now.	738	* to have move_allow right now.
871	*/	739	*/
872	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	740	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
873	update_now = 1;	741	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
874		742	m.flags_ = 0;
875	if ((move_slow | op->move_slow) != move_slow)
876	update_now = 1;
877	}	743	}
878	/* if the object is being removed, we can't make intelligent	744	/* if the object is being removed, we can't make intelligent
879	* decisions, because remove_ob can't really pass the object	745	* decisions, because remove_ob can't really pass the object
880	* that is being removed.	746	* that is being removed.
881	*/	747	*/
882	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	748	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
883	update_now = 1;	749	m.flags_ = 0;
884	else if (action == UP_OBJ_FACE)	750	else if (action == UP_OBJ_FACE)
885	/* Nothing to do for that case */ ;	751	/* Nothing to do for that case */ ;
886	else	752	else
887	LOG (llevError, "update_object called with invalid action: %d\n", action);	753	LOG (llevError, "update_object called with invalid action: %d\n", action);
888		754
889	if (update_now)
890	{
891	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
892	update_position (op->map, op->x, op->y);
893	}
894
895	if (op->more != NULL)	755	if (op->more)
896	update_object (op->more, action);	756	update_object (op->more, action);
897	}
898
899	object::vector object::mortals;
900	object::vector object::objects; // not yet used
901	object *object::first;
902
903	void object::free_mortals ()
904	{
905	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
906	if ((*i)->refcnt)
907	++i; // further delay freeing
908	else
909	{
910	delete *i;
911	mortals.erase (i);
912	}
913
914	static int lastmortals = 0;//D
915
916	if (mortals.size() != lastmortals)//D
917	{
918	lastmortals = mortals.size ();//D
919	LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
920	}
921	}	757	}
922		758
923	object::object ()	759	object::object ()
924	{	760	{
925	SET_FLAG (this, FLAG_REMOVED);	761	SET_FLAG (this, FLAG_REMOVED);
…		…
928	face = blank_face;	764	face = blank_face;
929	}	765	}
930		766
931	object::~object ()	767	object::~object ()
932	{	768	{
		769	unlink ();
		770
933	free_key_values (this);	771	free_key_values (this);
934	}	772	}
935		773
		774	static int object_count;
		775
936	void object::link ()	776	void object::link ()
937	{	777	{
		778	assert (!index);//D
		779	uuid = UUID::gen ();
938	count = ++ob_count;	780	count = ++object_count;
939	uuid = gen_uuid ();
940		781
941	prev = 0;	782	refcnt_inc ();
942	next = object::first;	783	objects.insert (this);
943
944	if (object::first)
945	object::first->prev = this;
946
947	object::first = this;
948	}	784	}
949		785
950	void object::unlink ()	786	void object::unlink ()
951	{	787	{
952	if (this == object::first)	788	if (!index)
953	object::first = next;	789	return;
954		790
955	/* Remove this object from the list of used objects */	791	objects.erase (this);
956	if (prev) prev->next = next;	792	refcnt_dec ();
957	if (next) next->prev = prev;	793	}
958		794
959	prev = 0;	795	void
960	next = 0;	796	object::activate ()
		797	{
		798	/* If already on active list, don't do anything */
		799	if (active)
		800	return;
		801
		802	if (has_active_speed ())
		803	actives.insert (this);
		804	}
		805
		806	void
		807	object::activate_recursive ()
		808	{
		809	activate ();
		810
		811	for (object *op = inv; op; op = op->below)
		812	op->activate_recursive ();
		813	}
		814
		815	/* This function removes object 'op' from the list of active
		816	* objects.
		817	* This should only be used for style maps or other such
		818	* reference maps where you don't want an object that isn't
		819	* in play chewing up cpu time getting processed.
		820	* The reverse of this is to call update_ob_speed, which
		821	* will do the right thing based on the speed of the object.
		822	*/
		823	void
		824	object::deactivate ()
		825	{
		826	/* If not on the active list, nothing needs to be done */
		827	if (!active)
		828	return;
		829
		830	actives.erase (this);
		831	}
		832
		833	void
		834	object::deactivate_recursive ()
		835	{
		836	for (object *op = inv; op; op = op->below)
		837	op->deactivate_recursive ();
		838
		839	deactivate ();
		840	}
		841
		842	void
		843	object::set_flag_inv (int flag, int value)
		844	{
		845	for (object *op = inv; op; op = op->below)
		846	{
		847	op->flag [flag] = value;
		848	op->set_flag_inv (flag, value);
		849	}
		850	}
		851
		852	/*
		853	* Remove and free all objects in the inventory of the given object.
		854	* object.c ?
		855	*/
		856	void
		857	object::destroy_inv (bool drop_to_ground)
		858	{
		859	// need to check first, because the checks below might segfault
		860	// as we might be on an invalid mapspace and crossfire code
		861	// is too buggy to ensure that the inventory is empty.
		862	// corollary: if you create arrows etc. with stuff in tis inventory,
		863	// cf will crash below with off-map x and y
		864	if (!inv)
		865	return;
		866
		867	/* Only if the space blocks everything do we not process -
		868	* if some form of movement is allowed, let objects
		869	* drop on that space.
		870	*/
		871	if (!drop_to_ground
		872	|| !map
		873	|| map->in_memory != MAP_IN_MEMORY
		874	|| map->nodrop
		875	|| ms ().move_block == MOVE_ALL)
		876	{
		877	while (inv)
		878	{
		879	inv->destroy_inv (drop_to_ground);
		880	inv->destroy ();
		881	}
		882	}
		883	else
		884	{ /* Put objects in inventory onto this space */
		885	while (inv)
		886	{
		887	object *op = inv;
		888
		889	if (op->flag [FLAG_STARTEQUIP]
		890	|| op->flag [FLAG_NO_DROP]
		891	|| op->type == RUNE
		892	|| op->type == TRAP
		893	|| op->flag [FLAG_IS_A_TEMPLATE]
		894	|| op->flag [FLAG_DESTROY_ON_DEATH])
		895	op->destroy ();
		896	else
		897	map->insert (op, x, y);
		898	}
		899	}
961	}	900	}
962		901
963	object *object::create ()	902	object *object::create ()
964	{	903	{
965	object *op = new object;	904	object *op = new object;
966	op->link ();	905	op->link ();
967	return op;	906	return op;
968	}	907	}
969		908
970	/*	909	void
971	* free_object() frees everything allocated by an object, removes	910	object::do_destroy ()
972	* it from the list of used objects, and puts it on the list of
973	* free objects. The IS_FREED() flag is set in the object.
974	* The object must have been removed by remove_ob() first for
975	* this function to succeed.
976	*
977	* If free_inventory is set, free inventory as well. Else drop items in
978	* inventory to the ground.
979	*/
980	void object::free (bool free_inventory)
981	{	911	{
982	if (QUERY_FLAG (this, FLAG_FREED))	912	attachable::do_destroy ();
		913
		914	if (flag [FLAG_IS_LINKED])
		915	remove_button_link (this);
		916
		917	if (flag [FLAG_FRIENDLY])
		918	remove_friendly_object (this);
		919
		920	if (!flag [FLAG_REMOVED])
		921	remove ();
		922
		923	destroy_inv (true);
		924
		925	deactivate ();
		926	unlink ();
		927
		928	flag [FLAG_FREED] = 1;
		929
		930	// hack to ensure that freed objects still have a valid map
		931	{
		932	static maptile *freed_map; // freed objects are moved here to avoid crashes
		933
		934	if (!freed_map)
		935	{
		936	freed_map = new maptile;
		937
		938	freed_map->path = "<freed objects map>";
		939	freed_map->name = "/internal/freed_objects_map";
		940	freed_map->width = 3;
		941	freed_map->height = 3;
		942	freed_map->nodrop = 1;
		943
		944	freed_map->alloc ();
		945	freed_map->in_memory = MAP_IN_MEMORY;
		946	}
		947
		948	map = freed_map;
		949	x = 1;
		950	y = 1;
		951	}
		952
		953	if (more)
		954	{
		955	more->destroy ();
		956	more = 0;
		957	}
		958
		959	head = 0;
		960
		961	// clear those pointers that likely might cause circular references
		962	owner = 0;
		963	enemy = 0;
		964	attacked_by = 0;
		965	current_weapon = 0;
		966	}
		967
		968	void
		969	object::destroy (bool destroy_inventory)
		970	{
		971	if (destroyed ())
983	return;	972	return;
984		973
985	if (QUERY_FLAG (this, FLAG_FRIENDLY))	974	if (destroy_inventory)
986	remove_friendly_object (this);	975	destroy_inv (false);
987		976
988	if (!QUERY_FLAG (this, FLAG_REMOVED))	977	if (is_head ())
989	remove_ob (this);	978	if (sound_destroy)
		979	play_sound (sound_destroy);
		980	else if (flag [FLAG_MONSTER])
		981	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
990		982
991	SET_FLAG (this, FLAG_FREED);	983	attachable::destroy ();
992
993	if (more)
994	{
995	more->free (free_inventory);
996	more = 0;
997	}
998
999	if (inv)
1000	{
1001	/* Only if the space blocks everything do we not process -
1002	* if some form of movement is allowed, let objects
1003	* drop on that space.
1004	*/
1005	if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1006	{
1007	object *op = inv;
1008
1009	while (op)
1010	{
1011	object *tmp = op->below;
1012	op->free (free_inventory);
1013	op = tmp;
1014	}
1015	}
1016	else
1017	{ /* Put objects in inventory onto this space */
1018	object *op = inv;
1019
1020	while (op)
1021	{
1022	object *tmp = op->below;
1023
1024	remove_ob (op);
1025
1026	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
1027	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
1028	free_object (op);
1029	else
1030	{
1031	op->x = x;
1032	op->y = y;
1033	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
1034	}
1035
1036	op = tmp;
1037	}
1038	}
1039	}
1040
1041	// clear those pointers that likely might have circular references to us
1042	owner = 0;
1043	enemy = 0;
1044	attacked_by = 0;
1045
1046	/* Remove object from the active list */
1047	speed = 0;
1048	update_ob_speed (this);
1049
1050	unlink ();
1051
1052	mortals.push_back (this);
1053	}	984	}
1054		985
1055	/*	986	/*
1056	* sub_weight() recursively (outwards) subtracts a number from the	987	* sub_weight() recursively (outwards) subtracts a number from the
1057	* weight of an object (and what is carried by it's environment(s)).	988	* weight of an object (and what is carried by it's environment(s)).
1058	*/	989	*/
1059
1060	void	990	void
1061	sub_weight (object *op, signed long weight)	991	sub_weight (object *op, signed long weight)
1062	{	992	{
1063	while (op != NULL)	993	while (op != NULL)
1064	{	994	{
…		…
1068	op->carrying -= weight;	998	op->carrying -= weight;
1069	op = op->env;	999	op = op->env;
1070	}	1000	}
1071	}	1001	}
1072		1002
1073	/* remove_ob(op):	1003	/* op->remove ():
1074	* This function removes the object op from the linked list of objects	1004	* This function removes the object op from the linked list of objects
1075	* which it is currently tied to. When this function is done, the	1005	* which it is currently tied to. When this function is done, the
1076	* object will have no environment. If the object previously had an	1006	* object will have no environment. If the object previously had an
1077	* environment, the x and y coordinates will be updated to	1007	* environment, the x and y coordinates will be updated to
1078	* the previous environment.	1008	* the previous environment.
1079	* Beware: This function is called from the editor as well!
1080	*/	1009	*/
1081
1082	void	1010	void
1083	remove_ob (object *op)	1011	object::do_remove ()
1084	{	1012	{
1085	object *tmp, *last = 0;	1013	object *tmp, *last = 0;
1086	object *otmp;	1014	object *otmp;
1087		1015
1088	int check_walk_off;
1089	mapstruct *m;
1090
1091	sint16 x, y;
1092
1093	if (QUERY_FLAG (op, FLAG_REMOVED))	1016	if (QUERY_FLAG (this, FLAG_REMOVED))
1094	return;	1017	return;
1095		1018
1096	SET_FLAG (op, FLAG_REMOVED);	1019	SET_FLAG (this, FLAG_REMOVED);
		1020	INVOKE_OBJECT (REMOVE, this);
1097		1021
1098	if (op->more != NULL)	1022	if (more)
1099	remove_ob (op->more);	1023	more->remove ();
1100		1024
1101	/*	1025	/*
1102	* In this case, the object to be removed is in someones	1026	* In this case, the object to be removed is in someones
1103	* inventory.	1027	* inventory.
1104	*/	1028	*/
1105	if (op->env != NULL)	1029	if (env)
1106	{	1030	{
1107	if (op->nrof)	1031	if (nrof)
1108	sub_weight (op->env, op->weight * op->nrof);	1032	sub_weight (env, weight * nrof);
1109	else	1033	else
1110	sub_weight (op->env, op->weight + op->carrying);	1034	sub_weight (env, weight + carrying);
1111		1035
1112	/* NO_FIX_PLAYER is set when a great many changes are being	1036	/* NO_FIX_PLAYER is set when a great many changes are being
1113	* made to players inventory. If set, avoiding the call	1037	* made to players inventory. If set, avoiding the call
1114	* to save cpu time.	1038	* to save cpu time.
1115	*/	1039	*/
1116	if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1040	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1117	fix_player (otmp);	1041	otmp->update_stats ();
1118		1042
1119	if (op->above != NULL)	1043	if (above)
1120	op->above->below = op->below;	1044	above->below = below;
1121	else	1045	else
1122	op->env->inv = op->below;	1046	env->inv = below;
1123		1047
1124	if (op->below != NULL)	1048	if (below)
1125	op->below->above = op->above;	1049	below->above = above;
1126		1050
1127	/* we set up values so that it could be inserted into	1051	/* we set up values so that it could be inserted into
1128	* the map, but we don't actually do that - it is up	1052	* the map, but we don't actually do that - it is up
1129	* to the caller to decide what we want to do.	1053	* to the caller to decide what we want to do.
1130	*/	1054	*/
1131	op->x = op->env->x, op->y = op->env->y;	1055	x = env->x, y = env->y;
1132	op->map = op->env->map;	1056	map = env->map;
1133	op->above = NULL, op->below = NULL;	1057	above = 0, below = 0;
1134	op->env = NULL;	1058	env = 0;
1135	}	1059	}
1136	else if (op->map)	1060	else if (map)
1137	{	1061	{
1138	x = op->x;	1062	if (type == PLAYER)
1139	y = op->y;
1140	m = get_map_from_coord (op->map, &x, &y);
1141
1142	if (!m)
1143	{
1144	LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1145	op->map->path, op->x, op->y);
1146	/* in old days, we used to set x and y to 0 and continue.
1147	* it seems if we get into this case, something is probablye
1148	* screwed up and should be fixed.
1149	*/
1150	abort ();
1151	}	1063	{
		1064	// leaving a spot always closes any open container on the ground
		1065	if (container && !container->env)
		1066	// this causes spurious floorbox updates, but it ensures
		1067	// that the CLOSE event is being sent.
		1068	close_container ();
1152		1069
1153	if (op->map != m)	1070	--map->players;
1154	LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",	1071	map->touch ();
1155	op->map->path, m->path, op->x, op->y, x, y);
1156
1157	/* Re did the following section of code - it looks like it had
1158	* lots of logic for things we no longer care about
1159	*/	1072	}
		1073
		1074	map->dirty = true;
		1075	mapspace &ms = this->ms ();
1160		1076
1161	/* link the object above us */	1077	/* link the object above us */
1162	if (op->above)	1078	if (above)
1163	op->above->below = op->below;	1079	above->below = below;
1164	else	1080	else
1165	SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */	1081	ms.top = below; /* we were top, set new top */
1166		1082
1167	/* Relink the object below us, if there is one */	1083	/* Relink the object below us, if there is one */
1168	if (op->below)	1084	if (below)
1169	op->below->above = op->above;	1085	below->above = above;
1170	else	1086	else
1171	{	1087	{
1172	/* Nothing below, which means we need to relink map object for this space	1088	/* Nothing below, which means we need to relink map object for this space
1173	* use translated coordinates in case some oddness with map tiling is	1089	* use translated coordinates in case some oddness with map tiling is
1174	* evident	1090	* evident
1175	*/	1091	*/
1176	if (GET_MAP_OB (m, x, y) != op)	1092	if (GET_MAP_OB (map, x, y) != this)
1177	{
1178	dump_object (op);
1179	LOG (llevError,
1180	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg);	1093	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1181	dump_object (GET_MAP_OB (m, x, y));	1094
1182	LOG (llevError, "%s\n", errmsg);	1095	ms.bot = above; /* goes on above it. */
1183	}	1096	}
1184		1097
1185	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1186	}
1187
1188	op->above = 0;	1098	above = 0;
1189	op->below = 0;	1099	below = 0;
1190		1100
1191	if (op->map->in_memory == MAP_SAVING)	1101	if (map->in_memory == MAP_SAVING)
1192	return;	1102	return;
1193		1103
1194	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);	1104	int check_walk_off = !flag [FLAG_NO_APPLY];
1195		1105
1196	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1106	if (object *pl = ms.player ())
		1107	{
		1108	if (pl->container == this)
		1109	/* If a container that the player is currently using somehow gets
		1110	* removed (most likely destroyed), update the player view
		1111	* appropriately.
		1112	*/
		1113	pl->close_container ();
		1114
		1115	pl->contr->ns->floorbox_update ();
		1116	}
		1117
		1118	for (tmp = ms.bot; tmp; tmp = tmp->above)
1197	{	1119	{
1198	/* No point updating the players look faces if he is the object	1120	/* No point updating the players look faces if he is the object
1199	* being removed.	1121	* being removed.
1200	*/	1122	*/
1201		1123
1202	if (tmp->type == PLAYER && tmp != op)	1124	/* See if object moving off should effect something */
		1125	if (check_walk_off
		1126	&& ((move_type & tmp->move_off)
		1127	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1203	{	1128	{
1204	/* If a container that the player is currently using somehow gets	1129	move_apply (tmp, this, 0);
1205	* removed (most likely destroyed), update the player view
1206	* appropriately.
1207	*/
1208	if (tmp->container == op)
1209	{
1210	CLEAR_FLAG (op, FLAG_APPLIED);
1211	tmp->container = NULL;
1212	}
1213		1130
1214	tmp->contr->socket.update_look = 1;	1131	if (destroyed ())
		1132	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1215	}	1133	}
1216		1134
1217	/* See if player moving off should effect something */
1218	if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1219	{
1220	move_apply (tmp, op, NULL);
1221
1222	if (op->destroyed ());
1223	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);
1224	}
1225
1226	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1227
1228	if (tmp->above == tmp)
1229	tmp->above = NULL;
1230
1231	last = tmp;	1135	last = tmp;
1232	}	1136	}
1233		1137
1234	/* last == NULL of there are no objects on this space */	1138	/* last == NULL if there are no objects on this space */
		1139	//TODO: this makes little sense, why only update the topmost object?
1235	if (last == NULL)	1140	if (!last)
1236	{	1141	map->at (x, y).flags_ = 0;
1237	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1238	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1239	* those out anyways, and if there are any flags set right now, they won't
1240	* be correct anyways.
1241	*/
1242	SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1243	update_position (op->map, op->x, op->y);
1244	}
1245	else	1142	else
1246	update_object (last, UP_OBJ_REMOVE);	1143	update_object (last, UP_OBJ_REMOVE);
1247		1144
1248	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))	1145	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1249	update_all_los (op->map, op->x, op->y);	1146	update_all_los (map, x, y);
1250	}	1147	}
1251	}	1148	}
1252		1149
1253	/*	1150	/*
1254	* merge_ob(op,top):	1151	* merge_ob(op,top):
…		…
1262	merge_ob (object *op, object *top)	1159	merge_ob (object *op, object *top)
1263	{	1160	{
1264	if (!op->nrof)	1161	if (!op->nrof)
1265	return 0;	1162	return 0;
1266		1163
1267	if (top == NULL)	1164	if (!top)
1268	for (top = op; top != NULL && top->above != NULL; top = top->above);	1165	for (top = op; top && top->above; top = top->above)
		1166	;
1269		1167
1270	for (; top != NULL; top = top->below)	1168	for (; top; top = top->below)
1271	{	1169	{
1272	if (top == op)	1170	if (top == op)
1273	continue;	1171	continue;
1274	if (CAN_MERGE (op, top))	1172
		1173	if (object::can_merge (op, top))
1275	{	1174	{
1276	top->nrof += op->nrof;	1175	top->nrof += op->nrof;
1277		1176
1278	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1177	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1279	op->weight = 0; /* Don't want any adjustements now */	1178	op->weight = 0; /* Don't want any adjustements now */
1280	remove_ob (op);	1179	op->destroy ();
1281	free_object (op);
1282	return top;	1180	return top;
1283	}	1181	}
1284	}	1182	}
1285		1183
1286	return 0;	1184	return 0;
1287	}	1185	}
1288		1186
		1187	void
		1188	object::expand_tail ()
		1189	{
		1190	if (more)
		1191	return;
		1192
		1193	object *prev = this;
		1194
		1195	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1196	{
		1197	object *op = arch_to_object (at);
		1198
		1199	op->name = name;
		1200	op->name_pl = name_pl;
		1201	op->title = title;
		1202
		1203	op->head = this;
		1204	prev->more = op;
		1205
		1206	prev = op;
		1207	}
		1208	}
		1209
1289	/*	1210	/*
1290	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1211	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1291	* job preparing multi-part monsters	1212	* job preparing multi-part monsters.
1292	*/	1213	*/
1293	object *	1214	object *
1294	insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y)	1215	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1295	{	1216	{
1296	object *tmp;
1297
1298	if (op->head)
1299	op = op->head;
1300
1301	for (tmp = op; tmp; tmp = tmp->more)	1217	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1302	{	1218	{
1303	tmp->x = x + tmp->arch->clone.x;	1219	tmp->x = x + tmp->arch->x;
1304	tmp->y = y + tmp->arch->clone.y;	1220	tmp->y = y + tmp->arch->y;
1305	}	1221	}
1306		1222
1307	return insert_ob_in_map (op, m, originator, flag);	1223	return insert_ob_in_map (op, m, originator, flag);
1308	}	1224	}
1309		1225
…		…
1325	* Return value:	1241	* Return value:
1326	* new object if 'op' was merged with other object	1242	* new object if 'op' was merged with other object
1327	* NULL if 'op' was destroyed	1243	* NULL if 'op' was destroyed
1328	* just 'op' otherwise	1244	* just 'op' otherwise
1329	*/	1245	*/
1330
1331	object *	1246	object *
1332	insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag)	1247	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1333	{	1248	{
		1249	assert (!op->flag [FLAG_FREED]);
		1250
1334	object *tmp, *top, *floor = NULL;	1251	object *top, *floor = NULL;
1335	sint16 x, y;
1336		1252
1337	if (QUERY_FLAG (op, FLAG_FREED))	1253	op->remove ();
1338	{
1339	LOG (llevError, "Trying to insert freed object!\n");
1340	return NULL;
1341	}
1342
1343	if (m == NULL)
1344	{
1345	dump_object (op);
1346	LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg);
1347	return op;
1348	}
1349
1350	if (out_of_map (m, op->x, op->y))
1351	{
1352	dump_object (op);
1353	LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg);
1354	#ifdef MANY_CORES
1355	/* Better to catch this here, as otherwise the next use of this object
1356	* is likely to cause a crash. Better to find out where it is getting
1357	* improperly inserted.
1358	*/
1359	abort ();
1360	#endif
1361	return op;
1362	}
1363
1364	if (!QUERY_FLAG (op, FLAG_REMOVED))
1365	{
1366	dump_object (op);
1367	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg);
1368	return op;
1369	}
1370
1371	if (op->more != NULL)
1372	{
1373	/* The part may be on a different map. */
1374
1375	object *more = op->more;
1376
1377	/* We really need the caller to normalize coordinates - if
1378	* we set the map, that doesn't work if the location is within
1379	* a map and this is straddling an edge. So only if coordinate
1380	* is clear wrong do we normalize it.
1381	*/
1382	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1383	more->map = get_map_from_coord (m, &more->x, &more->y);
1384	else if (!more->map)
1385	{
1386	/* For backwards compatibility - when not dealing with tiled maps,
1387	* more->map should always point to the parent.
1388	*/
1389	more->map = m;
1390	}
1391
1392	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1393	{
1394	if (!op->head)
1395	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1396
1397	return NULL;
1398	}
1399	}
1400
1401	CLEAR_FLAG (op, FLAG_REMOVED);
1402		1254
1403	/* Ideally, the caller figures this out. However, it complicates a lot	1255	/* Ideally, the caller figures this out. However, it complicates a lot
1404	* of areas of callers (eg, anything that uses find_free_spot would now	1256	* of areas of callers (eg, anything that uses find_free_spot would now
1405	* need extra work	1257	* need extra work
1406	*/	1258	*/
1407	op->map = get_map_from_coord (m, &op->x, &op->y);	1259	if (!xy_normalise (m, op->x, op->y))
1408	x = op->x;	1260	{
1409	y = op->y;	1261	op->destroy ();
		1262	return 0;
		1263	}
		1264
		1265	if (object *more = op->more)
		1266	if (!insert_ob_in_map (more, m, originator, flag))
		1267	return 0;
		1268
		1269	CLEAR_FLAG (op, FLAG_REMOVED);
		1270
		1271	op->map = m;
		1272	mapspace &ms = op->ms ();
1410		1273
1411	/* this has to be done after we translate the coordinates.	1274	/* this has to be done after we translate the coordinates.
1412	*/	1275	*/
1413	if (op->nrof && !(flag & INS_NO_MERGE))	1276	if (op->nrof && !(flag & INS_NO_MERGE))
1414	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1277	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1415	if (CAN_MERGE (op, tmp))	1278	if (object::can_merge (op, tmp))
1416	{	1279	{
1417	op->nrof += tmp->nrof;	1280	op->nrof += tmp->nrof;
1418	remove_ob (tmp);	1281	tmp->destroy ();
1419	free_object (tmp);
1420	}	1282	}
1421		1283
1422	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1284	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1423	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1285	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1424		1286
…		…
1437	op->below = originator->below;	1299	op->below = originator->below;
1438		1300
1439	if (op->below)	1301	if (op->below)
1440	op->below->above = op;	1302	op->below->above = op;
1441	else	1303	else
1442	SET_MAP_OB (op->map, op->x, op->y, op);	1304	ms.bot = op;
1443		1305
1444	/* since *below* originator, no need to update top */	1306	/* since *below* originator, no need to update top */
1445	originator->below = op;	1307	originator->below = op;
1446	}	1308	}
1447	else	1309	else
1448	{	1310	{
		1311	top = ms.bot;
		1312
1449	/* If there are other objects, then */	1313	/* If there are other objects, then */
1450	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1314	if (top)
1451	{	1315	{
1452	object *last = NULL;	1316	object *last = 0;
1453		1317
1454	/*	1318	/*
1455	* If there are multiple objects on this space, we do some trickier handling.	1319	* If there are multiple objects on this space, we do some trickier handling.
1456	* We've already dealt with merging if appropriate.	1320	* We've already dealt with merging if appropriate.
1457	* Generally, we want to put the new object on top. But if	1321	* Generally, we want to put the new object on top. But if
…		…
1461	* once we get to them. This reduces the need to traverse over all of	1325	* once we get to them. This reduces the need to traverse over all of
1462	* them when adding another one - this saves quite a bit of cpu time	1326	* them when adding another one - this saves quite a bit of cpu time
1463	* when lots of spells are cast in one area. Currently, it is presumed	1327	* when lots of spells are cast in one area. Currently, it is presumed
1464	* that flying non pickable objects are spell objects.	1328	* that flying non pickable objects are spell objects.
1465	*/	1329	*/
1466		1330	for (top = ms.bot; top; top = top->above)
1467	while (top != NULL)
1468	{	1331	{
1469	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1332	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1470	floor = top;	1333	floor = top;
1471		1334
1472	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1335	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1475	top = top->below;	1338	top = top->below;
1476	break;	1339	break;
1477	}	1340	}
1478		1341
1479	last = top;	1342	last = top;
1480	top = top->above;
1481	}	1343	}
1482		1344
1483	/* Don't want top to be NULL, so set it to the last valid object */	1345	/* Don't want top to be NULL, so set it to the last valid object */
1484	top = last;	1346	top = last;
1485		1347
…		…
1487	* looks like instead of lots of conditions here.	1349	* looks like instead of lots of conditions here.
1488	* makes things faster, and effectively the same result.	1350	* makes things faster, and effectively the same result.
1489	*/	1351	*/
1490		1352
1491	/* Have object 'fall below' other objects that block view.	1353	/* Have object 'fall below' other objects that block view.
1492	* Unless those objects are exits, type 66	1354	* Unless those objects are exits.
1493	* If INS_ON_TOP is used, don't do this processing	1355	* If INS_ON_TOP is used, don't do this processing
1494	* Need to find the object that in fact blocks view, otherwise	1356	* Need to find the object that in fact blocks view, otherwise
1495	* stacking is a bit odd.	1357	* stacking is a bit odd.
1496	*/	1358	*/
1497	if (!(flag & INS_ON_TOP) &&	1359	if (!(flag & INS_ON_TOP)
1498	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1360	&& ms.flags () & P_BLOCKSVIEW
		1361	&& (op->face && !faces [op->face].visibility))
1499	{	1362	{
1500	for (last = top; last != floor; last = last->below)	1363	for (last = top; last != floor; last = last->below)
1501	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1364	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1502	break;	1365	break;
		1366
1503	/* Check to see if we found the object that blocks view,	1367	/* Check to see if we found the object that blocks view,
1504	* and make sure we have a below pointer for it so that	1368	* and make sure we have a below pointer for it so that
1505	* we can get inserted below this one, which requires we	1369	* we can get inserted below this one, which requires we
1506	* set top to the object below us.	1370	* set top to the object below us.
1507	*/	1371	*/
1508	if (last && last->below && last != floor)	1372	if (last && last->below && last != floor)
1509	top = last->below;	1373	top = last->below;
1510	}	1374	}
1511	} /* If objects on this space */	1375	} /* If objects on this space */
1512		1376
1513	if (flag & INS_MAP_LOAD)
1514	top = GET_MAP_TOP (op->map, op->x, op->y);
1515
1516	if (flag & INS_ABOVE_FLOOR_ONLY)	1377	if (flag & INS_ABOVE_FLOOR_ONLY)
1517	top = floor;	1378	top = floor;
1518		1379
1519	/* Top is the object that our object (op) is going to get inserted above.	1380	/* Top is the object that our object (op) is going to get inserted above.
1520	*/	1381	*/
1521		1382
1522	/* First object on this space */	1383	/* First object on this space */
1523	if (!top)	1384	if (!top)
1524	{	1385	{
1525	op->above = GET_MAP_OB (op->map, op->x, op->y);	1386	op->above = ms.bot;
1526		1387
1527	if (op->above)	1388	if (op->above)
1528	op->above->below = op;	1389	op->above->below = op;
1529		1390
1530	op->below = NULL;	1391	op->below = 0;
1531	SET_MAP_OB (op->map, op->x, op->y, op);	1392	ms.bot = op;
1532	}	1393	}
1533	else	1394	else
1534	{ /* get inserted into the stack above top */	1395	{ /* get inserted into the stack above top */
1535	op->above = top->above;	1396	op->above = top->above;
1536		1397
…		…
1539		1400
1540	op->below = top;	1401	op->below = top;
1541	top->above = op;	1402	top->above = op;
1542	}	1403	}
1543		1404
1544	if (op->above == NULL)	1405	if (!op->above)
1545	SET_MAP_TOP (op->map, op->x, op->y, op);	1406	ms.top = op;
1546	} /* else not INS_BELOW_ORIGINATOR */	1407	} /* else not INS_BELOW_ORIGINATOR */
1547		1408
1548	if (op->type == PLAYER)	1409	if (op->type == PLAYER)
		1410	{
1549	op->contr->do_los = 1;	1411	op->contr->do_los = 1;
		1412	++op->map->players;
		1413	op->map->touch ();
		1414	}
1550		1415
1551	/* If we have a floor, we know the player, if any, will be above	1416	op->map->dirty = true;
1552	* it, so save a few ticks and start from there.	1417
1553	*/	1418	if (object *pl = ms.player ())
1554	if (!(flag & INS_MAP_LOAD))	1419	pl->contr->ns->floorbox_update ();
1555	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1556	if (tmp->type == PLAYER)
1557	tmp->contr->socket.update_look = 1;
1558		1420
1559	/* If this object glows, it may affect lighting conditions that are	1421	/* If this object glows, it may affect lighting conditions that are
1560	* visible to others on this map. But update_all_los is really	1422	* visible to others on this map. But update_all_los is really
1561	* an inefficient way to do this, as it means los for all players	1423	* an inefficient way to do this, as it means los for all players
1562	* on the map will get recalculated. The players could very well	1424	* on the map will get recalculated. The players could very well
1563	* be far away from this change and not affected in any way -	1425	* be far away from this change and not affected in any way -
1564	* this should get redone to only look for players within range,	1426	* this should get redone to only look for players within range,
1565	* or just updating the P_NEED_UPDATE for spaces within this area	1427	* or just updating the P_UPTODATE for spaces within this area
1566	* of effect may be sufficient.	1428	* of effect may be sufficient.
1567	*/	1429	*/
1568	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1430	if (op->map->darkness && (op->glow_radius != 0))
1569	update_all_los (op->map, op->x, op->y);	1431	update_all_los (op->map, op->x, op->y);
1570		1432
1571	/* updates flags (blocked, alive, no magic, etc) for this map space */	1433	/* updates flags (blocked, alive, no magic, etc) for this map space */
1572	update_object (op, UP_OBJ_INSERT);	1434	update_object (op, UP_OBJ_INSERT);
1573		1435
		1436	INVOKE_OBJECT (INSERT, op);
		1437
1574	/* Don't know if moving this to the end will break anything. However,	1438	/* Don't know if moving this to the end will break anything. However,
1575	* we want to have update_look set above before calling this.	1439	* we want to have floorbox_update called before calling this.
1576	*	1440	*
1577	* check_move_on() must be after this because code called from	1441	* check_move_on() must be after this because code called from
1578	* check_move_on() depends on correct map flags (so functions like	1442	* check_move_on() depends on correct map flags (so functions like
1579	* blocked() and wall() work properly), and these flags are updated by	1443	* blocked() and wall() work properly), and these flags are updated by
1580	* update_object().	1444	* update_object().
1581	*/	1445	*/
1582		1446
1583	/* if this is not the head or flag has been passed, don't check walk on status */	1447	/* if this is not the head or flag has been passed, don't check walk on status */
1584	if (!(flag & INS_NO_WALK_ON) && !op->head)	1448	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1585	{	1449	{
1586	if (check_move_on (op, originator))	1450	if (check_move_on (op, originator))
1587	return NULL;	1451	return 0;
1588		1452
1589	/* If we are a multi part object, lets work our way through the check	1453	/* If we are a multi part object, lets work our way through the check
1590	* walk on's.	1454	* walk on's.
1591	*/	1455	*/
1592	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1456	for (object *tmp = op->more; tmp; tmp = tmp->more)
1593	if (check_move_on (tmp, originator))	1457	if (check_move_on (tmp, originator))
1594	return NULL;	1458	return 0;
1595	}	1459	}
1596		1460
1597	return op;	1461	return op;
1598	}	1462	}
1599		1463
1600	/* this function inserts an object in the map, but if it	1464	/* this function inserts an object in the map, but if it
1601	* finds an object of its own type, it'll remove that one first.	1465	* finds an object of its own type, it'll remove that one first.
1602	* op is the object to insert it under: supplies x and the map.	1466	* op is the object to insert it under: supplies x and the map.
1603	*/	1467	*/
1604	void	1468	void
1605	replace_insert_ob_in_map (const char *arch_string, object *op)	1469	replace_insert_ob_in_map (const char *arch_string, object *op)
1606	{	1470	{
1607	object *	1471	object *tmp, *tmp1;
1608	tmp;
1609	object *
1610	tmp1;
1611		1472
1612	/* first search for itself and remove any old instances */	1473	/* first search for itself and remove any old instances */
1613		1474
1614	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1475	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1615	{
1616	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1476	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1617	{	1477	tmp->destroy ();
1618	remove_ob (tmp);
1619	free_object (tmp);
1620	}
1621	}
1622		1478
1623	tmp1 = arch_to_object (archetype::find (arch_string));	1479	tmp1 = arch_to_object (archetype::find (arch_string));
1624		1480
1625	tmp1->x = op->x;	1481	tmp1->x = op->x;
1626	tmp1->y = op->y;	1482	tmp1->y = op->y;
1627	insert_ob_in_map (tmp1, op->map, op, 0);	1483	insert_ob_in_map (tmp1, op->map, op, 0);
		1484	}
		1485
		1486	object *
		1487	object::insert_at (object *where, object *originator, int flags)
		1488	{
		1489	return where->map->insert (this, where->x, where->y, originator, flags);
1628	}	1490	}
1629		1491
1630	/*	1492	/*
1631	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1493	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1632	* is returned contains nr objects, and the remaining parts contains	1494	* is returned contains nr objects, and the remaining parts contains
1633	* the rest (or is removed and freed if that number is 0).	1495	* the rest (or is removed and freed if that number is 0).
1634	* On failure, NULL is returned, and the reason put into the	1496	* On failure, NULL is returned, and the reason put into the
1635	* global static errmsg array.	1497	* global static errmsg array.
1636	*/	1498	*/
1637
1638	object *	1499	object *
1639	get_split_ob (object *orig_ob, uint32 nr)	1500	get_split_ob (object *orig_ob, uint32 nr)
1640	{	1501	{
1641	object *	1502	object *newob;
1642	newob;
1643	int
1644	is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1503	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1645		1504
1646	if (orig_ob->nrof < nr)	1505	if (orig_ob->nrof < nr)
1647	{	1506	{
1648	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);	1507	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1649	return NULL;	1508	return NULL;
1650	}	1509	}
1651		1510
1652	newob = object_create_clone (orig_ob);	1511	newob = object_create_clone (orig_ob);
1653		1512
1654	if ((orig_ob->nrof -= nr) < 1)	1513	if ((orig_ob->nrof -= nr) < 1)
1655	{	1514	orig_ob->destroy (1);
1656	if (!is_removed)
1657	remove_ob (orig_ob);
1658	free_object2 (orig_ob, 1);
1659	}
1660	else if (!is_removed)	1515	else if (!is_removed)
1661	{	1516	{
1662	if (orig_ob->env != NULL)	1517	if (orig_ob->env != NULL)
1663	sub_weight (orig_ob->env, orig_ob->weight * nr);	1518	sub_weight (orig_ob->env, orig_ob->weight * nr);
1664	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)	1519	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
…		…
1679	* the amount of an object. If the amount reaches 0, the object	1534	* the amount of an object. If the amount reaches 0, the object
1680	* is subsequently removed and freed.	1535	* is subsequently removed and freed.
1681	*	1536	*
1682	* Return value: 'op' if something is left, NULL if the amount reached 0	1537	* Return value: 'op' if something is left, NULL if the amount reached 0
1683	*/	1538	*/
1684
1685	object *	1539	object *
1686	decrease_ob_nr (object *op, uint32 i)	1540	decrease_ob_nr (object *op, uint32 i)
1687	{	1541	{
1688	object *tmp;	1542	object *tmp;
1689	player *pl;
1690		1543
1691	if (i == 0) /* objects with op->nrof require this check */	1544	if (i == 0) /* objects with op->nrof require this check */
1692	return op;	1545	return op;
1693		1546
1694	if (i > op->nrof)	1547	if (i > op->nrof)
1695	i = op->nrof;	1548	i = op->nrof;
1696		1549
1697	if (QUERY_FLAG (op, FLAG_REMOVED))	1550	if (QUERY_FLAG (op, FLAG_REMOVED))
1698	op->nrof -= i;	1551	op->nrof -= i;
1699	else if (op->env != NULL)	1552	else if (op->env)
1700	{	1553	{
1701	/* is this object in the players inventory, or sub container	1554	/* is this object in the players inventory, or sub container
1702	* therein?	1555	* therein?
1703	*/	1556	*/
1704	tmp = is_player_inv (op->env);	1557	tmp = op->in_player ();
1705	/* nope. Is this a container the player has opened?	1558	/* nope. Is this a container the player has opened?
1706	* If so, set tmp to that player.	1559	* If so, set tmp to that player.
1707	* IMO, searching through all the players will mostly	1560	* IMO, searching through all the players will mostly
1708	* likely be quicker than following op->env to the map,	1561	* likely be quicker than following op->env to the map,
1709	* and then searching the map for a player.	1562	* and then searching the map for a player.
1710	*/	1563	*/
1711	if (!tmp)	1564	if (!tmp)
1712	{	1565	for_all_players (pl)
1713	for (pl = first_player; pl; pl = pl->next)
1714	if (pl->ob->container == op->env)	1566	if (pl->ob->container == op->env)
		1567	{
		1568	tmp = pl->ob;
1715	break;	1569	break;
1716	if (pl)
1717	tmp = pl->ob;
1718	else
1719	tmp = NULL;
1720	}	1570	}
1721		1571
1722	if (i < op->nrof)	1572	if (i < op->nrof)
1723	{	1573	{
1724	sub_weight (op->env, op->weight * i);	1574	sub_weight (op->env, op->weight * i);
1725	op->nrof -= i;	1575	op->nrof -= i;
1726	if (tmp)	1576	if (tmp)
1727	{
1728	esrv_send_item (tmp, op);	1577	esrv_send_item (tmp, op);
1729	}
1730	}	1578	}
1731	else	1579	else
1732	{	1580	{
1733	remove_ob (op);	1581	op->remove ();
1734	op->nrof = 0;	1582	op->nrof = 0;
1735	if (tmp)	1583	if (tmp)
1736	{
1737	esrv_del_item (tmp->contr, op->count);	1584	esrv_del_item (tmp->contr, op->count);
1738	}
1739	}	1585	}
1740	}	1586	}
1741	else	1587	else
1742	{	1588	{
1743	object *above = op->above;	1589	object *above = op->above;
1744		1590
1745	if (i < op->nrof)	1591	if (i < op->nrof)
1746	op->nrof -= i;	1592	op->nrof -= i;
1747	else	1593	else
1748	{	1594	{
1749	remove_ob (op);	1595	op->remove ();
1750	op->nrof = 0;	1596	op->nrof = 0;
1751	}	1597	}
1752		1598
1753	/* Since we just removed op, op->above is null */	1599	/* Since we just removed op, op->above is null */
1754	for (tmp = above; tmp != NULL; tmp = tmp->above)	1600	for (tmp = above; tmp; tmp = tmp->above)
1755	if (tmp->type == PLAYER)	1601	if (tmp->type == PLAYER)
1756	{	1602	{
1757	if (op->nrof)	1603	if (op->nrof)
1758	esrv_send_item (tmp, op);	1604	esrv_send_item (tmp, op);
1759	else	1605	else
…		…
1763		1609
1764	if (op->nrof)	1610	if (op->nrof)
1765	return op;	1611	return op;
1766	else	1612	else
1767	{	1613	{
1768	free_object (op);	1614	op->destroy ();
1769	return NULL;	1615	return 0;
1770	}	1616	}
1771	}	1617	}
1772		1618
1773	/*	1619	/*
1774	* add_weight(object, weight) adds the specified weight to an object,	1620	* add_weight(object, weight) adds the specified weight to an object,
1775	* and also updates how much the environment(s) is/are carrying.	1621	* and also updates how much the environment(s) is/are carrying.
1776	*/	1622	*/
1777
1778	void	1623	void
1779	add_weight (object *op, signed long weight)	1624	add_weight (object *op, signed long weight)
1780	{	1625	{
1781	while (op != NULL)	1626	while (op != NULL)
1782	{	1627	{
…		…
1786	op->carrying += weight;	1631	op->carrying += weight;
1787	op = op->env;	1632	op = op->env;
1788	}	1633	}
1789	}	1634	}
1790		1635
		1636	object *
		1637	insert_ob_in_ob (object *op, object *where)
		1638	{
		1639	if (!where)
		1640	{
		1641	char *dump = dump_object (op);
		1642	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
		1643	free (dump);
		1644	return op;
		1645	}
		1646
		1647	if (where->head_ () != where)
		1648	{
		1649	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
		1650	where = where->head;
		1651	}
		1652
		1653	return where->insert (op);
		1654	}
		1655
1791	/*	1656	/*
1792	* insert_ob_in_ob(op,environment):	1657	* env->insert (op)
1793	* This function inserts the object op in the linked list	1658	* This function inserts the object op in the linked list
1794	* inside the object environment.	1659	* inside the object environment.
1795	*	1660	*
1796	* Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter
1797	* the inventory at the last position or next to other objects of the same
1798	* type.
1799	* Frank: Now sorted by type, archetype and magic!
1800	*
1801	* The function returns now pointer to inserted item, and return value can	1661	* The function returns now pointer to inserted item, and return value can
1802	* be != op, if items are merged. -Tero	1662	* be != op, if items are merged. -Tero
1803	*/	1663	*/
1804
1805	object *	1664	object *
1806	insert_ob_in_ob (object *op, object *where)	1665	object::insert (object *op)
1807	{	1666	{
1808	object *
1809	tmp, *
1810	otmp;
1811
1812	if (!QUERY_FLAG (op, FLAG_REMOVED))	1667	if (!QUERY_FLAG (op, FLAG_REMOVED))
1813	{	1668	op->remove ();
1814	dump_object (op);
1815	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);
1816	return op;
1817	}
1818
1819	if (where == NULL)
1820	{
1821	dump_object (op);
1822	LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);
1823	return op;
1824	}
1825
1826	if (where->head)
1827	{
1828	LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");
1829	where = where->head;
1830	}
1831		1669
1832	if (op->more)	1670	if (op->more)
1833	{	1671	{
1834	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1672	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1835	return op;	1673	return op;
1836	}	1674	}
1837		1675
1838	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1676	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1839	CLEAR_FLAG (op, FLAG_REMOVED);	1677	CLEAR_FLAG (op, FLAG_REMOVED);
		1678
1840	if (op->nrof)	1679	if (op->nrof)
1841	{	1680	{
1842	for (tmp = where->inv; tmp != NULL; tmp = tmp->below)	1681	for (object *tmp = inv; tmp; tmp = tmp->below)
1843	if (CAN_MERGE (tmp, op))	1682	if (object::can_merge (tmp, op))
1844	{	1683	{
1845	/* return the original object and remove inserted object	1684	/* return the original object and remove inserted object
1846	(client needs the original object) */	1685	(client needs the original object) */
1847	tmp->nrof += op->nrof;	1686	tmp->nrof += op->nrof;
1848	/* Weight handling gets pretty funky. Since we are adding to	1687	/* Weight handling gets pretty funky. Since we are adding to
1849	* tmp->nrof, we need to increase the weight.	1688	* tmp->nrof, we need to increase the weight.
1850	*/	1689	*/
1851	add_weight (where, op->weight * op->nrof);	1690	add_weight (this, op->weight * op->nrof);
1852	SET_FLAG (op, FLAG_REMOVED);	1691	SET_FLAG (op, FLAG_REMOVED);
1853	free_object (op); /* free the inserted object */	1692	op->destroy (); /* free the inserted object */
1854	op = tmp;	1693	op = tmp;
1855	remove_ob (op); /* and fix old object's links */	1694	op->remove (); /* and fix old object's links */
1856	CLEAR_FLAG (op, FLAG_REMOVED);	1695	CLEAR_FLAG (op, FLAG_REMOVED);
1857	break;	1696	break;
1858	}	1697	}
1859		1698
1860	/* I assume combined objects have no inventory	1699	/* I assume combined objects have no inventory
1861	* We add the weight - this object could have just been removed	1700	* We add the weight - this object could have just been removed
1862	* (if it was possible to merge). calling remove_ob will subtract	1701	* (if it was possible to merge). calling remove_ob will subtract
1863	* the weight, so we need to add it in again, since we actually do	1702	* the weight, so we need to add it in again, since we actually do
1864	* the linking below	1703	* the linking below
1865	*/	1704	*/
1866	add_weight (where, op->weight * op->nrof);	1705	add_weight (this, op->weight * op->nrof);
1867	}	1706	}
1868	else	1707	else
1869	add_weight (where, (op->weight + op->carrying));	1708	add_weight (this, (op->weight + op->carrying));
1870		1709
1871	otmp = is_player_inv (where);	1710	if (object *otmp = this->in_player ())
1872	if (otmp && otmp->contr != NULL)
1873	{
1874	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1711	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1875	fix_player (otmp);	1712	otmp->update_stats ();
1876	}
1877		1713
		1714	op->owner = 0; // its his/hers now. period.
1878	op->map = NULL;	1715	op->map = 0;
1879	op->env = where;	1716	op->env = this;
1880	op->above = NULL;	1717	op->above = 0;
1881	op->below = NULL;	1718	op->below = 0;
1882	op->x = 0, op->y = 0;	1719	op->x = op->y = 0;
1883		1720
1884	/* reset the light list and los of the players on the map */	1721	/* reset the light list and los of the players on the map */
1885	if ((op->glow_radius != 0) && where->map)	1722	if (op->glow_radius && map)
1886	{	1723	{
1887	#ifdef DEBUG_LIGHTS	1724	#ifdef DEBUG_LIGHTS
1888	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1725	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1889	#endif /* DEBUG_LIGHTS */	1726	#endif /* DEBUG_LIGHTS */
1890	if (MAP_DARKNESS (where->map))	1727	if (map->darkness)
1891	update_all_los (where->map, where->x, where->y);	1728	update_all_los (map, x, y);
1892	}	1729	}
1893		1730
1894	/* Client has no idea of ordering so lets not bother ordering it here.	1731	/* Client has no idea of ordering so lets not bother ordering it here.
1895	* It sure simplifies this function...	1732	* It sure simplifies this function...
1896	*/	1733	*/
1897	if (where->inv == NULL)	1734	if (!inv)
1898	where->inv = op;	1735	inv = op;
1899	else	1736	else
1900	{	1737	{
1901	op->below = where->inv;	1738	op->below = inv;
1902	op->below->above = op;	1739	op->below->above = op;
1903	where->inv = op;	1740	inv = op;
1904	}	1741	}
		1742
		1743	INVOKE_OBJECT (INSERT, this);
		1744
1905	return op;	1745	return op;
1906	}	1746	}
1907		1747
1908	/*	1748	/*
1909	* Checks if any objects has a move_type that matches objects	1749	* Checks if any objects has a move_type that matches objects
…		…
1923	*	1763	*
1924	* MSW 2001-07-08: Check all objects on space, not just those below	1764	* MSW 2001-07-08: Check all objects on space, not just those below
1925	* object being inserted. insert_ob_in_map may not put new objects	1765	* object being inserted. insert_ob_in_map may not put new objects
1926	* on top.	1766	* on top.
1927	*/	1767	*/
1928
1929	int	1768	int
1930	check_move_on (object *op, object *originator)	1769	check_move_on (object *op, object *originator)
1931	{	1770	{
1932	object *tmp;	1771	object *tmp;
1933	mapstruct *m = op->map;	1772	maptile *m = op->map;
1934	int x = op->x, y = op->y;	1773	int x = op->x, y = op->y;
1935		1774
1936	MoveType move_on, move_slow, move_block;	1775	MoveType move_on, move_slow, move_block;
1937		1776
1938	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1777	if (QUERY_FLAG (op, FLAG_NO_APPLY))
…		…
1960		1799
1961	/* The objects have to be checked from top to bottom.	1800	/* The objects have to be checked from top to bottom.
1962	* Hence, we first go to the top:	1801	* Hence, we first go to the top:
1963	*/	1802	*/
1964		1803
1965	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1804	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1966	{	1805	{
1967	/* Trim the search when we find the first other spell effect	1806	/* Trim the search when we find the first other spell effect
1968	* this helps performance so that if a space has 50 spell objects,	1807	* this helps performance so that if a space has 50 spell objects,
1969	* we don't need to check all of them.	1808	* we don't need to check all of them.
1970	*/	1809	*/
…		…
1988	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1827	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1989	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1828	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1990	{	1829	{
1991		1830
1992	float	1831	float
1993	diff = tmp->move_slow_penalty * FABS (op->speed);	1832	diff = tmp->move_slow_penalty * fabs (op->speed);
1994		1833
1995	if (op->type == PLAYER)	1834	if (op->type == PLAYER)
1996	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1835	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1997	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1836	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1998	diff /= 4.0;	1837	diff /= 4.0;
…		…
2025	/*	1864	/*
2026	* present_arch(arch, map, x, y) searches for any objects with	1865	* present_arch(arch, map, x, y) searches for any objects with
2027	* a matching archetype at the given map and coordinates.	1866	* a matching archetype at the given map and coordinates.
2028	* The first matching object is returned, or NULL if none.	1867	* The first matching object is returned, or NULL if none.
2029	*/	1868	*/
2030
2031	object *	1869	object *
2032	present_arch (const archetype *at, mapstruct *m, int x, int y)	1870	present_arch (const archetype *at, maptile *m, int x, int y)
2033	{	1871	{
2034	object *
2035	tmp;
2036
2037	if (m == NULL || out_of_map (m, x, y))	1872	if (!m || out_of_map (m, x, y))
2038	{	1873	{
2039	LOG (llevError, "Present_arch called outside map.\n");	1874	LOG (llevError, "Present_arch called outside map.\n");
2040	return NULL;	1875	return NULL;
2041	}	1876	}
2042	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1877
		1878	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
2043	if (tmp->arch == at)	1879	if (tmp->arch == at)
2044	return tmp;	1880	return tmp;
		1881
2045	return NULL;	1882	return NULL;
2046	}	1883	}
2047		1884
2048	/*	1885	/*
2049	* present(type, map, x, y) searches for any objects with	1886	* present(type, map, x, y) searches for any objects with
2050	* a matching type variable at the given map and coordinates.	1887	* a matching type variable at the given map and coordinates.
2051	* The first matching object is returned, or NULL if none.	1888	* The first matching object is returned, or NULL if none.
2052	*/	1889	*/
2053
2054	object *	1890	object *
2055	present (unsigned char type, mapstruct *m, int x, int y)	1891	present (unsigned char type, maptile *m, int x, int y)
2056	{	1892	{
2057	object *
2058	tmp;
2059
2060	if (out_of_map (m, x, y))	1893	if (out_of_map (m, x, y))
2061	{	1894	{
2062	LOG (llevError, "Present called outside map.\n");	1895	LOG (llevError, "Present called outside map.\n");
2063	return NULL;	1896	return NULL;
2064	}	1897	}
2065	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1898
		1899	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
2066	if (tmp->type == type)	1900	if (tmp->type == type)
2067	return tmp;	1901	return tmp;
		1902
2068	return NULL;	1903	return NULL;
2069	}	1904	}
2070		1905
2071	/*	1906	/*
2072	* present_in_ob(type, object) searches for any objects with	1907	* present_in_ob(type, object) searches for any objects with
2073	* a matching type variable in the inventory of the given object.	1908	* a matching type variable in the inventory of the given object.
2074	* The first matching object is returned, or NULL if none.	1909	* The first matching object is returned, or NULL if none.
2075	*/	1910	*/
2076
2077	object *	1911	object *
2078	present_in_ob (unsigned char type, const object *op)	1912	present_in_ob (unsigned char type, const object *op)
2079	{	1913	{
2080	object *
2081	tmp;
2082
2083	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1914	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2084	if (tmp->type == type)	1915	if (tmp->type == type)
2085	return tmp;	1916	return tmp;
		1917
2086	return NULL;	1918	return NULL;
2087	}	1919	}
2088		1920
2089	/*	1921	/*
2090	* present_in_ob (type, str, object) searches for any objects with	1922	* present_in_ob (type, str, object) searches for any objects with
…		…
2098	* str is the string to match against. Note that we match against	1930	* str is the string to match against. Note that we match against
2099	* the object name, not the archetype name. this is so that the	1931	* the object name, not the archetype name. this is so that the
2100	* spell code can use one object type (force), but change it's name	1932	* spell code can use one object type (force), but change it's name
2101	* to be unique.	1933	* to be unique.
2102	*/	1934	*/
2103
2104	object *	1935	object *
2105	present_in_ob_by_name (int type, const char *str, const object *op)	1936	present_in_ob_by_name (int type, const char *str, const object *op)
2106	{	1937	{
2107	object *
2108	tmp;
2109
2110	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1938	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2111	{
2112	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1939	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2113	return tmp;	1940	return tmp;
2114	}	1941
2115	return NULL;	1942	return 0;
2116	}	1943	}
2117		1944
2118	/*	1945	/*
2119	* present_arch_in_ob(archetype, object) searches for any objects with	1946	* present_arch_in_ob(archetype, object) searches for any objects with
2120	* a matching archetype in the inventory of the given object.	1947	* a matching archetype in the inventory of the given object.
2121	* The first matching object is returned, or NULL if none.	1948	* The first matching object is returned, or NULL if none.
2122	*/	1949	*/
2123
2124	object *	1950	object *
2125	present_arch_in_ob (const archetype *at, const object *op)	1951	present_arch_in_ob (const archetype *at, const object *op)
2126	{	1952	{
2127	object *
2128	tmp;
2129
2130	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1953	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2131	if (tmp->arch == at)	1954	if (tmp->arch == at)
2132	return tmp;	1955	return tmp;
		1956
2133	return NULL;	1957	return NULL;
2134	}	1958	}
2135		1959
2136	/*	1960	/*
2137	* activate recursively a flag on an object inventory	1961	* activate recursively a flag on an object inventory
2138	*/	1962	*/
2139	void	1963	void
2140	flag_inv (object *op, int flag)	1964	flag_inv (object *op, int flag)
2141	{	1965	{
2142	object *
2143	tmp;
2144
2145	if (op->inv)
2146	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1966	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2147	{	1967	{
2148	SET_FLAG (tmp, flag);	1968	SET_FLAG (tmp, flag);
2149	flag_inv (tmp, flag);	1969	flag_inv (tmp, flag);
2150	}	1970	}
2151	} /*	1971	}
		1972
		1973	/*
2152	* desactivate recursively a flag on an object inventory	1974	* deactivate recursively a flag on an object inventory
2153	*/	1975	*/
2154	void	1976	void
2155	unflag_inv (object *op, int flag)	1977	unflag_inv (object *op, int flag)
2156	{	1978	{
2157	object *
2158	tmp;
2159
2160	if (op->inv)
2161	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1979	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2162	{	1980	{
2163	CLEAR_FLAG (tmp, flag);	1981	CLEAR_FLAG (tmp, flag);
2164	unflag_inv (tmp, flag);	1982	unflag_inv (tmp, flag);
2165	}	1983	}
2166	}
2167
2168	/*
2169	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2170	* all it's inventory (recursively).
2171	* If checksums are used, a player will get set_cheat called for
2172	* him/her-self and all object carried by a call to this function.
2173	*/
2174
2175	void
2176	set_cheat (object *op)
2177	{
2178	SET_FLAG (op, FLAG_WAS_WIZ);
2179	flag_inv (op, FLAG_WAS_WIZ);
2180	}	1984	}
2181		1985
2182	/*	1986	/*
2183	* find_free_spot(object, map, x, y, start, stop) will search for	1987	* find_free_spot(object, map, x, y, start, stop) will search for
2184	* a spot at the given map and coordinates which will be able to contain	1988	* a spot at the given map and coordinates which will be able to contain
…		…
2186	* to search (see the freearr_x/y[] definition).	1990	* to search (see the freearr_x/y[] definition).
2187	* It returns a random choice among the alternatives found.	1991	* It returns a random choice among the alternatives found.
2188	* start and stop are where to start relative to the free_arr array (1,9	1992	* start and stop are where to start relative to the free_arr array (1,9
2189	* does all 4 immediate directions). This returns the index into the	1993	* does all 4 immediate directions). This returns the index into the
2190	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1994	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2191	* Note - this only checks to see if there is space for the head of the
2192	* object - if it is a multispace object, this should be called for all
2193	* pieces.
2194	* Note2: This function does correctly handle tiled maps, but does not	1995	* Note: This function does correctly handle tiled maps, but does not
2195	* inform the caller. However, insert_ob_in_map will update as	1996	* inform the caller. However, insert_ob_in_map will update as
2196	* necessary, so the caller shouldn't need to do any special work.	1997	* necessary, so the caller shouldn't need to do any special work.
2197	* Note - updated to take an object instead of archetype - this is necessary	1998	* Note - updated to take an object instead of archetype - this is necessary
2198	* because arch_blocked (now ob_blocked) needs to know the movement type	1999	* because arch_blocked (now ob_blocked) needs to know the movement type
2199	* to know if the space in question will block the object. We can't use	2000	* to know if the space in question will block the object. We can't use
2200	* the archetype because that isn't correct if the monster has been	2001	* the archetype because that isn't correct if the monster has been
2201	* customized, changed states, etc.	2002	* customized, changed states, etc.
2202	*/	2003	*/
2203
2204	int	2004	int
2205	find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop)	2005	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2206	{	2006	{
2207	int
2208	i,
2209	index = 0, flag;
2210	static int
2211	altern[SIZEOFFREE];	2007	int altern[SIZEOFFREE];
		2008	int index = 0, flag;
2212		2009
2213	for (i = start; i < stop; i++)	2010	for (int i = start; i < stop; i++)
2214	{	2011	{
2215	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2012	mapxy pos (m, x, y); pos.move (i);
2216	if (!flag)	2013
		2014	if (!pos.normalise ())
		2015	continue;
		2016
		2017	mapspace &ms = *pos;
		2018
		2019	if (ms.flags () & P_IS_ALIVE)
		2020	continue;
		2021
		2022	/* However, often
		2023	* ob doesn't have any move type (when used to place exits)
		2024	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2025	*/
		2026	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2027	{
2217	altern[index++] = i;	2028	altern [index++] = i;
		2029	continue;
		2030	}
2218		2031
2219	/* Basically, if we find a wall on a space, we cut down the search size.	2032	/* Basically, if we find a wall on a space, we cut down the search size.
2220	* In this way, we won't return spaces that are on another side of a wall.	2033	* In this way, we won't return spaces that are on another side of a wall.
2221	* This mostly work, but it cuts down the search size in all directions -	2034	* This mostly work, but it cuts down the search size in all directions -
2222	* if the space being examined only has a wall to the north and empty	2035	* if the space being examined only has a wall to the north and empty
2223	* spaces in all the other directions, this will reduce the search space	2036	* spaces in all the other directions, this will reduce the search space
2224	* to only the spaces immediately surrounding the target area, and	2037	* to only the spaces immediately surrounding the target area, and
2225	* won't look 2 spaces south of the target space.	2038	* won't look 2 spaces south of the target space.
2226	*/	2039	*/
2227	else if ((flag & AB_NO_PASS) && maxfree[i] < stop)	2040	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2041	{
2228	stop = maxfree[i];	2042	stop = maxfree[i];
		2043	continue;
		2044	}
		2045
		2046	/* Note it is intentional that we check ob - the movement type of the
		2047	* head of the object should correspond for the entire object.
		2048	*/
		2049	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2050	continue;
		2051
		2052	if (ob->blocked (m, pos.x, pos.y))
		2053	continue;
		2054
		2055	altern [index++] = i;
2229	}	2056	}
		2057
2230	if (!index)	2058	if (!index)
2231	return -1;	2059	return -1;
		2060
2232	return altern[RANDOM () % index];	2061	return altern [rndm (index)];
2233	}	2062	}
2234		2063
2235	/*	2064	/*
2236	* find_first_free_spot(archetype, mapstruct, x, y) works like	2065	* find_first_free_spot(archetype, maptile, x, y) works like
2237	* find_free_spot(), but it will search max number of squares.	2066	* find_free_spot(), but it will search max number of squares.
2238	* But it will return the first available spot, not a random choice.	2067	* But it will return the first available spot, not a random choice.
2239	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2068	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2240	*/	2069	*/
2241
2242	int	2070	int
2243	find_first_free_spot (const object *ob, mapstruct *m, int x, int y)	2071	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2244	{	2072	{
2245	int
2246	i;
2247
2248	for (i = 0; i < SIZEOFFREE; i++)	2073	for (int i = 0; i < SIZEOFFREE; i++)
2249	{
2250	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2074	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2251	return i;	2075	return i;
2252	}	2076
2253	return -1;	2077	return -1;
2254	}	2078	}
2255		2079
2256	/*	2080	/*
2257	* The function permute(arr, begin, end) randomly reorders the array	2081	* The function permute(arr, begin, end) randomly reorders the array
2258	* arr[begin..end-1].	2082	* arr[begin..end-1].
		2083	* now uses a fisher-yates shuffle, old permute was broken
2259	*/	2084	*/
2260	static void	2085	static void
2261	permute (int *arr, int begin, int end)	2086	permute (int *arr, int begin, int end)
2262	{	2087	{
2263	int	2088	arr += begin;
2264	i,
2265	j,
2266	tmp,
2267	len;
2268
2269	len = end - begin;	2089	end -= begin;
2270	for (i = begin; i < end; i++)
2271	{
2272	j = begin + RANDOM () % len;
2273		2090
2274	tmp = arr[i];	2091	while (--end)
2275	arr[i] = arr[j];	2092	swap (arr [end], arr [rndm (end + 1)]);
2276	arr[j] = tmp;
2277	}
2278	}	2093	}
2279		2094
2280	/* new function to make monster searching more efficient, and effective!	2095	/* new function to make monster searching more efficient, and effective!
2281	* This basically returns a randomized array (in the passed pointer) of	2096	* This basically returns a randomized array (in the passed pointer) of
2282	* the spaces to find monsters. In this way, it won't always look for	2097	* the spaces to find monsters. In this way, it won't always look for
…		…
2285	* the 3x3 area will be searched, just not in a predictable order.	2100	* the 3x3 area will be searched, just not in a predictable order.
2286	*/	2101	*/
2287	void	2102	void
2288	get_search_arr (int *search_arr)	2103	get_search_arr (int *search_arr)
2289	{	2104	{
2290	int	2105	int i;
2291	i;
2292		2106
2293	for (i = 0; i < SIZEOFFREE; i++)	2107	for (i = 0; i < SIZEOFFREE; i++)
2294	{
2295	search_arr[i] = i;	2108	search_arr[i] = i;
2296	}
2297		2109
2298	permute (search_arr, 1, SIZEOFFREE1 + 1);	2110	permute (search_arr, 1, SIZEOFFREE1 + 1);
2299	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2111	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2300	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2112	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2301	}	2113	}
…		…
2310	* Perhaps incorrectly, but I'm making the assumption that exclude	2122	* Perhaps incorrectly, but I'm making the assumption that exclude
2311	* is actually want is going to try and move there. We need this info	2123	* is actually want is going to try and move there. We need this info
2312	* because we have to know what movement the thing looking to move	2124	* because we have to know what movement the thing looking to move
2313	* there is capable of.	2125	* there is capable of.
2314	*/	2126	*/
2315
2316	int	2127	int
2317	find_dir (mapstruct *m, int x, int y, object *exclude)	2128	find_dir (maptile *m, int x, int y, object *exclude)
2318	{	2129	{
2319	int
2320	i,
2321	max = SIZEOFFREE, mflags;	2130	int i, max = SIZEOFFREE, mflags;
2322		2131
2323	sint16 nx, ny;	2132	sint16 nx, ny;
2324	object *	2133	object *tmp;
2325	tmp;	2134	maptile *mp;
2326	mapstruct *
2327	mp;
2328		2135
2329	MoveType blocked, move_type;	2136	MoveType blocked, move_type;
2330		2137
2331	if (exclude && exclude->head)	2138	if (exclude && exclude->head_ () != exclude)
2332	{	2139	{
2333	exclude = exclude->head;	2140	exclude = exclude->head;
2334	move_type = exclude->move_type;	2141	move_type = exclude->move_type;
2335	}	2142	}
2336	else	2143	else
…		…
2344	mp = m;	2151	mp = m;
2345	nx = x + freearr_x[i];	2152	nx = x + freearr_x[i];
2346	ny = y + freearr_y[i];	2153	ny = y + freearr_y[i];
2347		2154
2348	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2155	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2156
2349	if (mflags & P_OUT_OF_MAP)	2157	if (mflags & P_OUT_OF_MAP)
2350	{
2351	max = maxfree[i];	2158	max = maxfree[i];
2352	}
2353	else	2159	else
2354	{	2160	{
2355	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2161	mapspace &ms = mp->at (nx, ny);
		2162
		2163	blocked = ms.move_block;
2356		2164
2357	if ((move_type & blocked) == move_type)	2165	if ((move_type & blocked) == move_type)
2358	{
2359	max = maxfree[i];	2166	max = maxfree[i];
2360	}
2361	else if (mflags & P_IS_ALIVE)	2167	else if (mflags & P_IS_ALIVE)
2362	{	2168	{
2363	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2169	for (tmp = ms.bot; tmp; tmp = tmp->above)
2364	{	2170	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2365	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2171	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2366	{
2367	break;	2172	break;
2368	}	2173
2369	}
2370	if (tmp)	2174	if (tmp)
2371	{
2372	return freedir[i];	2175	return freedir[i];
2373	}
2374	}	2176	}
2375	}	2177	}
2376	}	2178	}
		2179
2377	return 0;	2180	return 0;
2378	}	2181	}
2379		2182
2380	/*	2183	/*
2381	* distance(object 1, object 2) will return the square of the	2184	* distance(object 1, object 2) will return the square of the
2382	* distance between the two given objects.	2185	* distance between the two given objects.
2383	*/	2186	*/
2384
2385	int	2187	int
2386	distance (const object *ob1, const object *ob2)	2188	distance (const object *ob1, const object *ob2)
2387	{	2189	{
2388	int
2389	i;
2390
2391	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2190	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2392	return i;
2393	}	2191	}
2394		2192
2395	/*	2193	/*
2396	* find_dir_2(delta-x,delta-y) will return a direction in which	2194	* find_dir_2(delta-x,delta-y) will return a direction in which
2397	* an object which has subtracted the x and y coordinates of another	2195	* an object which has subtracted the x and y coordinates of another
2398	* object, needs to travel toward it.	2196	* object, needs to travel toward it.
2399	*/	2197	*/
2400
2401	int	2198	int
2402	find_dir_2 (int x, int y)	2199	find_dir_2 (int x, int y)
2403	{	2200	{
2404	int	2201	int q;
2405	q;
2406		2202
2407	if (y)	2203	if (y)
2408	q = x * 100 / y;	2204	q = x * 100 / y;
2409	else if (x)	2205	else if (x)
2410	q = -300 * x;	2206	q = -300 * x;
…		…
2435		2231
2436	return 3;	2232	return 3;
2437	}	2233	}
2438		2234
2439	/*	2235	/*
2440	* absdir(int): Returns a number between 1 and 8, which represent
2441	* the "absolute" direction of a number (it actually takes care of
2442	* "overflow" in previous calculations of a direction).
2443	*/
2444
2445	int
2446	absdir (int d)
2447	{
2448	while (d < 1)
2449	d += 8;
2450	while (d > 8)
2451	d -= 8;
2452	return d;
2453	}
2454
2455	/*
2456	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2236	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2457	* between two directions (which are expected to be absolute (see absdir())	2237	* between two directions (which are expected to be absolute (see absdir())
2458	*/	2238	*/
2459
2460	int	2239	int
2461	dirdiff (int dir1, int dir2)	2240	dirdiff (int dir1, int dir2)
2462	{	2241	{
2463	int	2242	int d;
2464	d;
2465		2243
2466	d = abs (dir1 - dir2);	2244	d = abs (dir1 - dir2);
2467	if (d > 4)	2245	if (d > 4)
2468	d = 8 - d;	2246	d = 8 - d;
		2247
2469	return d;	2248	return d;
2470	}	2249	}
2471		2250
2472	/* peterm:	2251	/* peterm:
2473	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2252	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2476	* This basically means that if direction is 15, then it could either go	2255	* This basically means that if direction is 15, then it could either go
2477	* direction 4, 14, or 16 to get back to where we are.	2256	* direction 4, 14, or 16 to get back to where we are.
2478	* Moved from spell_util.c to object.c with the other related direction	2257	* Moved from spell_util.c to object.c with the other related direction
2479	* functions.	2258	* functions.
2480	*/	2259	*/
2481
2482	int
2483	reduction_dir[SIZEOFFREE][3] = {	2260	int reduction_dir[SIZEOFFREE][3] = {
2484	{0, 0, 0}, /* 0 */	2261	{0, 0, 0}, /* 0 */
2485	{0, 0, 0}, /* 1 */	2262	{0, 0, 0}, /* 1 */
2486	{0, 0, 0}, /* 2 */	2263	{0, 0, 0}, /* 2 */
2487	{0, 0, 0}, /* 3 */	2264	{0, 0, 0}, /* 3 */
2488	{0, 0, 0}, /* 4 */	2265	{0, 0, 0}, /* 4 */
…		…
2536	* find a path to that monster that we found. If not,	2313	* find a path to that monster that we found. If not,
2537	* we don't bother going toward it. Returns 1 if we	2314	* we don't bother going toward it. Returns 1 if we
2538	* can see a direct way to get it	2315	* can see a direct way to get it
2539	* Modified to be map tile aware -.MSW	2316	* Modified to be map tile aware -.MSW
2540	*/	2317	*/
2541
2542
2543	int	2318	int
2544	can_see_monsterP (mapstruct *m, int x, int y, int dir)	2319	can_see_monsterP (maptile *m, int x, int y, int dir)
2545	{	2320	{
2546	sint16 dx, dy;	2321	sint16 dx, dy;
2547	int
2548	mflags;	2322	int mflags;
2549		2323
2550	if (dir < 0)	2324	if (dir < 0)
2551	return 0; /* exit condition: invalid direction */	2325	return 0; /* exit condition: invalid direction */
2552		2326
2553	dx = x + freearr_x[dir];	2327	dx = x + freearr_x[dir];
…		…
2566	return 0;	2340	return 0;
2567		2341
2568	/* yes, can see. */	2342	/* yes, can see. */
2569	if (dir < 9)	2343	if (dir < 9)
2570	return 1;	2344	return 1;
		2345
2571	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2346	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2572	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2347	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2348	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2573	}	2349	}
2574
2575
2576		2350
2577	/*	2351	/*
2578	* can_pick(picker, item): finds out if an object is possible to be	2352	* can_pick(picker, item): finds out if an object is possible to be
2579	* picked up by the picker. Returnes 1 if it can be	2353	* picked up by the picker. Returnes 1 if it can be
2580	* picked up, otherwise 0.	2354	* picked up, otherwise 0.
…		…
2582	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2356	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2583	* core dumps if they do.	2357	* core dumps if they do.
2584	*	2358	*
2585	* Add a check so we can't pick up invisible objects (0.93.8)	2359	* Add a check so we can't pick up invisible objects (0.93.8)
2586	*/	2360	*/
2587
2588	int	2361	int
2589	can_pick (const object *who, const object *item)	2362	can_pick (const object *who, const object *item)
2590	{	2363	{
2591	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2364	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2592	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2365	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2593	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2366	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2594	}	2367	}
2595		2368
2596
2597	/*	2369	/*
2598	* create clone from object to another	2370	* create clone from object to another
2599	*/	2371	*/
2600	object *	2372	object *
2601	object_create_clone (object *asrc)	2373	object_create_clone (object *asrc)
2602	{	2374	{
2603	object *
2604	dst = NULL, *tmp, *src, *part, *prev, *item;	2375	object *dst = 0, *tmp, *src, *prev, *item;
2605		2376
2606	if (!asrc)	2377	if (!asrc)
2607	return NULL;	2378	return 0;
2608	src = asrc;	2379
2609	if (src->head)
2610	src = src->head;	2380	src = asrc->head_ ();
2611		2381
2612	prev = NULL;	2382	prev = 0;
2613	for (part = src; part; part = part->more)	2383	for (object *part = src; part; part = part->more)
2614	{	2384	{
2615	tmp = get_object ();	2385	tmp = part->clone ();
2616	copy_object (part, tmp);
2617	tmp->x -= src->x;	2386	tmp->x -= src->x;
2618	tmp->y -= src->y;	2387	tmp->y -= src->y;
		2388
2619	if (!part->head)	2389	if (!part->head)
2620	{	2390	{
2621	dst = tmp;	2391	dst = tmp;
2622	tmp->head = NULL;	2392	tmp->head = 0;
2623	}	2393	}
2624	else	2394	else
2625	{
2626	tmp->head = dst;	2395	tmp->head = dst;
2627	}	2396
2628	tmp->more = NULL;	2397	tmp->more = 0;
		2398
2629	if (prev)	2399	if (prev)
2630	prev->more = tmp;	2400	prev->more = tmp;
		2401
2631	prev = tmp;	2402	prev = tmp;
2632	}	2403	}
2633		2404
2634	for (item = src->inv; item; item = item->below)	2405	for (item = src->inv; item; item = item->below)
2635	insert_ob_in_ob (object_create_clone (item), dst);	2406	insert_ob_in_ob (object_create_clone (item), dst);
2636		2407
2637	return dst;	2408	return dst;
2638	}
2639
2640	/* GROS - Creates an object using a string representing its content. */
2641	/* Basically, we save the content of the string to a temp file, then call */
2642	/* load_object on it. I admit it is a highly inefficient way to make things, */
2643	/* but it was simple to make and allows reusing the load_object function. */
2644	/* Remember not to use load_object_str in a time-critical situation. */
2645	/* Also remember that multiparts objects are not supported for now. */
2646
2647	object *
2648	load_object_str (const char *obstr)
2649	{
2650	object *op;
2651	char filename[MAX_BUF];
2652
2653	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2654
2655	FILE *tempfile = fopen (filename, "w");
2656
2657	if (tempfile == NULL)
2658	{
2659	LOG (llevError, "Error - Unable to access load object temp file\n");
2660	return NULL;
2661	}
2662
2663	fprintf (tempfile, obstr);
2664	fclose (tempfile);
2665
2666	op = get_object ();
2667
2668	object_thawer thawer (filename);
2669
2670	if (thawer)
2671	load_object (thawer, op, 0);
2672
2673	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2674	CLEAR_FLAG (op, FLAG_REMOVED);
2675
2676	return op;
2677	}	2409	}
2678		2410
2679	/* This returns the first object in who's inventory that	2411	/* This returns the first object in who's inventory that
2680	* has the same type and subtype match.	2412	* has the same type and subtype match.
2681	* returns NULL if no match.	2413	* returns NULL if no match.
2682	*/	2414	*/
2683	object *	2415	object *
2684	find_obj_by_type_subtype (const object *who, int type, int subtype)	2416	find_obj_by_type_subtype (const object *who, int type, int subtype)
2685	{	2417	{
2686	object *tmp;
2687
2688	for (tmp = who->inv; tmp; tmp = tmp->below)	2418	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2689	if (tmp->type == type && tmp->subtype == subtype)	2419	if (tmp->type == type && tmp->subtype == subtype)
2690	return tmp;	2420	return tmp;
2691		2421
2692	return NULL;	2422	return 0;
2693	}	2423	}
2694		2424
2695	/* If ob has a field named key, return the link from the list,	2425	/* If ob has a field named key, return the link from the list,
2696	* otherwise return NULL.	2426	* otherwise return NULL.
2697	*	2427	*
…		…
2699	* do the desired thing.	2429	* do the desired thing.
2700	*/	2430	*/
2701	key_value *	2431	key_value *
2702	get_ob_key_link (const object *ob, const char *key)	2432	get_ob_key_link (const object *ob, const char *key)
2703	{	2433	{
2704	key_value *link;
2705
2706	for (link = ob->key_values; link != NULL; link = link->next)	2434	for (key_value *link = ob->key_values; link; link = link->next)
2707	if (link->key == key)	2435	if (link->key == key)
2708	return link;	2436	return link;
2709		2437
2710	return NULL;	2438	return 0;
2711	}	2439	}
2712		2440
2713	/*	2441	/*
2714	* Returns the value of op has an extra_field for key, or NULL.	2442	* Returns the value of op has an extra_field for key, or NULL.
2715	*	2443	*
…		…
2740	if (link->key == canonical_key)	2468	if (link->key == canonical_key)
2741	return link->value;	2469	return link->value;
2742		2470
2743	return 0;	2471	return 0;
2744	}	2472	}
2745
2746		2473
2747	/*	2474	/*
2748	* Updates the canonical_key in op to value.	2475	* Updates the canonical_key in op to value.
2749	*	2476	*
2750	* canonical_key is a shared string (value doesn't have to be).	2477	* canonical_key is a shared string (value doesn't have to be).
…		…
2755	* Returns TRUE on success.	2482	* Returns TRUE on success.
2756	*/	2483	*/
2757	int	2484	int
2758	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2485	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2759	{	2486	{
2760	key_value *
2761	field = NULL, *last = NULL;	2487	key_value *field = NULL, *last = NULL;
2762		2488
2763	for (field = op->key_values; field != NULL; field = field->next)	2489	for (field = op->key_values; field != NULL; field = field->next)
2764	{	2490	{
2765	if (field->key != canonical_key)	2491	if (field->key != canonical_key)
2766	{	2492	{
…		…
2775	/* Basically, if the archetype has this key set,	2501	/* Basically, if the archetype has this key set,
2776	* we need to store the null value so when we save	2502	* we need to store the null value so when we save
2777	* it, we save the empty value so that when we load,	2503	* it, we save the empty value so that when we load,
2778	* we get this value back again.	2504	* we get this value back again.
2779	*/	2505	*/
2780	if (get_ob_key_link (&op->arch->clone, canonical_key))	2506	if (get_ob_key_link (op->arch, canonical_key))
2781	field->value = 0;	2507	field->value = 0;
2782	else	2508	else
2783	{	2509	{
2784	if (last)	2510	if (last)
2785	last->next = field->next;	2511	last->next = field->next;
…		…
2794	/* IF we get here, key doesn't exist */	2520	/* IF we get here, key doesn't exist */
2795		2521
2796	/* No field, we'll have to add it. */	2522	/* No field, we'll have to add it. */
2797		2523
2798	if (!add_key)	2524	if (!add_key)
2799	{
2800	return FALSE;	2525	return FALSE;
2801	}	2526
2802	/* There isn't any good reason to store a null	2527	/* There isn't any good reason to store a null
2803	* value in the key/value list. If the archetype has	2528	* value in the key/value list. If the archetype has
2804	* this key, then we should also have it, so shouldn't	2529	* this key, then we should also have it, so shouldn't
2805	* be here. If user wants to store empty strings,	2530	* be here. If user wants to store empty strings,
2806	* should pass in ""	2531	* should pass in ""
…		…
2855	}	2580	}
2856	else	2581	else
2857	item = item->env;	2582	item = item->env;
2858	}	2583	}
2859		2584
		2585	const char *
		2586	object::flag_desc (char *desc, int len) const
		2587	{
		2588	char *p = desc;
		2589	bool first = true;
		2590
		2591	*p = 0;
		2592
		2593	for (int i = 0; i < NUM_FLAGS; i++)
		2594	{
		2595	if (len <= 10) // magic constant!
		2596	{
		2597	snprintf (p, len, ",...");
		2598	break;
		2599	}
		2600
		2601	if (flag [i])
		2602	{
		2603	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2604	len -= cnt;
		2605	p += cnt;
		2606	first = false;
		2607	}
		2608	}
		2609
		2610	return desc;
		2611	}
		2612
2860	// return a suitable string describing an objetc in enough detail to find it	2613	// return a suitable string describing an object in enough detail to find it
2861	const char *	2614	const char *
2862	object::debug_desc (char *info) const	2615	object::debug_desc (char *info) const
2863	{	2616	{
		2617	char flagdesc[512];
2864	char info2[256 * 3];	2618	char info2[256 * 4];
2865	char *p = info;	2619	char *p = info;
2866		2620
2867	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2621	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2868	count,	2622	count,
		2623	uuid.c_str (),
2869	&name,	2624	&name,
2870	title ? " " : "",	2625	title ? "\",title:\"" : "",
2871	title ? (const char *)title : "");	2626	title ? (const char *)title : "",
		2627	flag_desc (flagdesc, 512), type);
2872		2628
2873	if (env)	2629	if (!this->flag[FLAG_REMOVED] && env)
2874	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2630	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2875		2631
2876	if (map)	2632	if (map)
2877	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2633	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2878		2634
2879	return info;	2635	return info;
2880	}	2636	}
2881		2637
2882	const char *	2638	const char *
2883	object::debug_desc () const	2639	object::debug_desc () const
2884	{	2640	{
2885	static char info[256 * 3];	2641	static char info[3][256 * 4];
		2642	static int info_idx;
		2643
2886	return debug_desc (info);	2644	return debug_desc (info [++info_idx % 3]);
2887	}	2645	}
2888		2646
		2647	struct region *
		2648	object::region () const
		2649	{
		2650	return map ? map->region (x, y)
		2651	: region::default_region ();
		2652	}
		2653
		2654	const materialtype_t *
		2655	object::dominant_material () const
		2656	{
		2657	if (materialtype_t *mt = name_to_material (materialname))
		2658	return mt;
		2659
		2660	return name_to_material (shstr_unknown);
		2661	}
		2662
		2663	void
		2664	object::open_container (object *new_container)
		2665	{
		2666	if (container == new_container)
		2667	return;
		2668
		2669	if (object *old_container = container)
		2670	{
		2671	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2672	return;
		2673
		2674	#if 0
		2675	// remove the "Close old_container" object.
		2676	if (object *closer = old_container->inv)
		2677	if (closer->type == CLOSE_CON)
		2678	closer->destroy ();
		2679	#endif
		2680
		2681	old_container->flag [FLAG_APPLIED] = 0;
		2682	container = 0;
		2683
		2684	esrv_update_item (UPD_FLAGS, this, old_container);
		2685	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2686	play_sound (sound_find ("chest_close"));
		2687	}
		2688
		2689	if (new_container)
		2690	{
		2691	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2692	return;
		2693
		2694	// TODO: this does not seem to serve any purpose anymore?
		2695	#if 0
		2696	// insert the "Close Container" object.
		2697	if (archetype *closer = new_container->other_arch)
		2698	{
		2699	object *closer = arch_to_object (new_container->other_arch);
		2700	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2701	new_container->insert (closer);
		2702	}
		2703	#endif
		2704
		2705	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2706
		2707	new_container->flag [FLAG_APPLIED] = 1;
		2708	container = new_container;
		2709
		2710	esrv_update_item (UPD_FLAGS, this, new_container);
		2711	esrv_send_inventory (this, new_container);
		2712	play_sound (sound_find ("chest_open"));
		2713	}
		2714	}
		2715
		2716	object *
		2717	object::force_find (const shstr name)
		2718	{
		2719	/* cycle through his inventory to look for the MARK we want to
		2720	* place
		2721	*/
		2722	for (object *tmp = inv; tmp; tmp = tmp->below)
		2723	if (tmp->type == FORCE && tmp->slaying == name)
		2724	return splay (tmp);
		2725
		2726	return 0;
		2727	}
		2728
		2729	void
		2730	object::force_add (const shstr name, int duration)
		2731	{
		2732	if (object *force = force_find (name))
		2733	force->destroy ();
		2734
		2735	object *force = get_archetype (FORCE_NAME);
		2736
		2737	force->slaying = name;
		2738	force->stats.food = 1;
		2739	force->speed_left = -1.f;
		2740
		2741	force->set_speed (duration ? 1.f / duration : 0.f);
		2742	force->flag [FLAG_IS_USED_UP] = true;
		2743	force->flag [FLAG_APPLIED] = true;
		2744
		2745	insert (force);
		2746	}
		2747
		2748	void
		2749	object::play_sound (faceidx sound) const
		2750	{
		2751	if (!sound)
		2752	return;
		2753
		2754	if (flag [FLAG_REMOVED])
		2755	return;
		2756
		2757	if (env)
		2758	{
		2759	if (object *pl = in_player ())
		2760	pl->contr->play_sound (sound);
		2761	}
		2762	else
		2763	map->play_sound (sound, x, y);
		2764	}
		2765

Diff Legend

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