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.75 by root, Wed Dec 20 11:36:38 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	#include <bitset>	36	#include <bitset>
36		37
37	int nrofallocobjects = 0;	38	UUID UUID::cur;
38	static UUID uuid;	39	static uint64_t seq_next_save;
39	const uint64 UUID_SKIP = 1<<19;	40	static const uint64 UUID_GAP = 1<<19;
40		41
41	object *active_objects; /* List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
42		44
43	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,
44	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
45	};	50	};
46	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,
47	-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
48	};	56	};
49	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,
50	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
51	};	62	};
52	int freedir[SIZEOFFREE] = {	63	int freedir[SIZEOFFREE] = {
53	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,
54	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
55	};	68	};
56		69
57	static void	70	static void
58	write_uuid (void)	71	write_uuid (uval64 skip, bool sync)
59	{	72	{
60	char filename1[MAX_BUF], filename2[MAX_BUF];	73	CALL_BEGIN (2);
61		74	CALL_ARG_SV (newSVval64 (skip));
62	sprintf (filename1, "%s/uuid", settings.localdir);	75	CALL_ARG_SV (boolSV (sync));
63	sprintf (filename2, "%s/uuid~", settings.localdir);	76	CALL_CALL ("cf::write_uuid", G_DISCARD);
64		77	CALL_END;
65	FILE *fp;
66
67	if (!(fp = fopen (filename2, "w")))
68	{
69	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
70	return;
71	}
72
73	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
74	fclose (fp);
75	rename (filename2, filename1);
76	}	78	}
77		79
78	static void	80	static void
79	read_uuid (void)	81	read_uuid (void)
80	{	82	{
81	char filename[MAX_BUF];	83	char filename[MAX_BUF];
82		84
83	sprintf (filename, "%s/uuid", settings.localdir);	85	sprintf (filename, "%s/uuid", settings.localdir);
84		86
		87	seq_next_save = 0;
		88
85	FILE *fp;	89	FILE *fp;
86		90
87	if (!(fp = fopen (filename, "r")))	91	if (!(fp = fopen (filename, "r")))
88	{	92	{
89	if (errno == ENOENT)	93	if (errno == ENOENT)
90	{	94	{
91	LOG (llevInfo, "RESET uid to 1\n");	95	LOG (llevInfo, "RESET uid to 1\n");
92	uuid.seq = 0;	96	UUID::cur.seq = 0;
93	write_uuid ();	97	write_uuid (UUID_GAP, true);
94	return;	98	return;
95	}	99	}
96		100
97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	101	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98	_exit (1);	102	_exit (1);
99	}	103	}
100		104
101	int version;	105	UUID::BUF buf;
102	unsigned long long uid;	106	buf[0] = 0;
103	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	107	fgets (buf, sizeof (buf), fp);
		108
		109	if (!UUID::cur.parse (buf))
104	{	110	{
105	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	111	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
106	_exit (1);	112	_exit (1);
107	}	113	}
108		114
109	uuid.seq = uid;	115	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
110	write_uuid ();	116
111	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	117	write_uuid (UUID_GAP, true);
112	fclose (fp);	118	fclose (fp);
113	}	119	}
114		120
115	UUID	121	UUID
116	gen_uuid ()	122	UUID::gen ()
117	{	123	{
118	UUID uid;	124	UUID uid;
119		125
120	uid.seq = ++uuid.seq;	126	uid.seq = ++cur.seq;
121		127
122	if (!(uuid.seq & (UUID_SKIP - 1)))	128	if (expect_false (cur.seq >= seq_next_save))
123	write_uuid ();	129	{
		130	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		131	write_uuid (UUID_GAP, false);
		132	}
		133
124		134
125	return uid;	135	return uid;
126	}	136	}
127		137
128	void	138	void
129	init_uuid ()	139	UUID::init ()
130	{	140	{
131	read_uuid ();	141	read_uuid ();
132	}	142	}
133		143
134	/* 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. */
…		…
141	* 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
142	* different structure or at least keep the lists sorted...	152	* different structure or at least keep the lists sorted...
143	*/	153	*/
144		154
145	/* For each field in wants, */	155	/* For each field in wants, */
146	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)
147	{	157	{
148	key_value *has_field;	158	key_value *has_field;
149		159
150	/* Look for a field in has with the same key. */	160	/* Look for a field in has with the same key. */
151	has_field = get_ob_key_link (has, wants_field->key);	161	has_field = get_ob_key_link (has, wants_field->key);
…		…
190	* Check nrof variable *before* calling can_merge()	200	* Check nrof variable *before* calling can_merge()
191	*	201	*
192	* Improvements made with merge: Better checking on potion, and also	202	* Improvements made with merge: Better checking on potion, and also
193	* check weight	203	* check weight
194	*/	204	*/
195
196	bool object::can_merge_slow (object *ob1, object *ob2)	205	bool object::can_merge_slow (object *ob1, object *ob2)
197	{	206	{
198	/* A couple quicksanity checks */	207	/* A couple quicksanity checks */
199	if (ob1 == ob2	208	if (ob1 == ob2
200	|| ob1->type != ob2->type	209	|| ob1->type != ob2->type
…		…
221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	230	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
222		231
223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	232	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	233	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
225		234
226	if ((ob1->flags ^ ob2->flags).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	235	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
227	|| ob1->arch != ob2->arch	236	|| ob1->arch != ob2->arch
228	|| ob1->name != ob2->name	237	|| ob1->name != ob2->name
229	|| ob1->title != ob2->title	238	|| ob1->title != ob2->title
230	|| ob1->msg != ob2->msg	239	|| ob1->msg != ob2->msg
231	|| ob1->weight != ob2->weight	240	|| ob1->weight != ob2->weight
…		…
253	/* This is really a spellbook check - really, we should	262	/* This is really a spellbook check - really, we should
254	* check all objects in the inventory.	263	* check all objects in the inventory.
255	*/	264	*/
256	if (ob1->inv || ob2->inv)	265	if (ob1->inv || ob2->inv)
257	{	266	{
258	/* if one object has inventory but the other doesn't, not equiv */	267	if (!(ob1->inv && ob2->inv))
259	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	268	return 0; /* inventories differ in length */
260	return 0;
261		269
262	/* Now check to see if the two inventory objects could merge */	270	if (ob1->inv->below || ob2->inv->below)
		271	return 0; /* more than one object in inv */
		272
263	if (!object::can_merge (ob1->inv, ob2->inv))	273	if (!object::can_merge (ob1->inv, ob2->inv))
264	return 0;	274	return 0; /* inventory objexts differ */
265		275
266	/* 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
267	* if it is valid.	277	* if it is valid.
268	*/	278	*/
269	}	279	}
…		…
277		287
278	/* 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
279	* 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
280	* check?	290	* check?
281	*/	291	*/
282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	292	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
283	return 0;	293	return 0;
284		294
285	switch (ob1->type)	295	switch (ob1->type)
286	{	296	{
287	case SCROLL:	297	case SCROLL:
…		…
298	return 0;	308	return 0;
299	else if (!compare_ob_value_lists (ob1, ob2))	309	else if (!compare_ob_value_lists (ob1, ob2))
300	return 0;	310	return 0;
301	}	311	}
302		312
303	//TODO: generate an event or call into perl for additional checks
304	if (ob1->self || ob2->self)	313	if (ob1->self || ob2->self)
305	{	314	{
306	ob1->optimise ();	315	ob1->optimise ();
307	ob2->optimise ();	316	ob2->optimise ();
308		317
309	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)
310	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	}
311	}	330	}
312		331
313	/* Everything passes, must be OK. */	332	/* Everything passes, must be OK. */
314	return 1;	333	return 1;
315	}	334	}
…		…
323	sum_weight (object *op)	342	sum_weight (object *op)
324	{	343	{
325	long sum;	344	long sum;
326	object *inv;	345	object *inv;
327		346
328	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	347	for (sum = 0, inv = op->inv; inv; inv = inv->below)
329	{	348	{
330	if (inv->inv)	349	if (inv->inv)
331	sum_weight (inv);	350	sum_weight (inv);
		351
332	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	352	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
333	}	353	}
334		354
335	if (op->type == CONTAINER && op->stats.Str)	355	if (op->type == CONTAINER && op->stats.Str)
336	sum = (sum * (100 - op->stats.Str)) / 100;	356	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
356	/*	376	/*
357	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	377	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
358	* Some error messages.	378	* Some error messages.
359	* 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.
360	*/	380	*/
361
362	char *	381	char *
363	dump_object (object *op)	382	dump_object (object *op)
364	{	383	{
365	if (!op)	384	if (!op)
366	return strdup ("[NULLOBJ]");	385	return strdup ("[NULLOBJ]");
367		386
368	object_freezer freezer;	387	object_freezer freezer;
369	save_object (freezer, op, 3);	388	op->write (freezer);
370	return freezer.as_string ();	389	return freezer.as_string ();
371	}	390	}
372		391
373	/*	392	/*
374	* 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
375	* multi-object 1 which is closest to the second object.	394	* multi-object 1 which is closest to the second object.
376	* If it's not a multi-object, it is returned.	395	* If it's not a multi-object, it is returned.
377	*/	396	*/
378
379	object *	397	object *
380	get_nearest_part (object *op, const object *pl)	398	get_nearest_part (object *op, const object *pl)
381	{	399	{
382	object *tmp, *closest;	400	object *tmp, *closest;
383	int last_dist, i;	401	int last_dist, i;
…		…
391	}	409	}
392		410
393	/*	411	/*
394	* 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.
395	*/	413	*/
396
397	object *	414	object *
398	find_object (tag_t i)	415	find_object (tag_t i)
399	{	416	{
400	for (object *op = object::first; op; op = op->next)	417	for_all_objects (op)
401	if (op->count == i)	418	if (op->count == i)
402	return op;	419	return op;
403		420
404	return 0;	421	return 0;
405	}	422	}
406		423
407	/*	424	/*
408	* 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.
409	* Used only by the patch command, but not all that useful.	426	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	427	* Enables features like "patch <name-of-other-player> food 999"
411	*/	428	*/
412
413	object *	429	object *
414	find_object_name (const char *str)	430	find_object_name (const char *str)
415	{	431	{
416	shstr_cmp str_ (str);	432	shstr_cmp str_ (str);
417	object *op;	433	object *op;
418		434
419	for (op = object::first; op != NULL; op = op->next)	435	for_all_objects (op)
420	if (op->name == str_)	436	if (op->name == str_)
421	break;	437	break;
422		438
423	return op;	439	return op;
424	}	440	}
425		441
426	void
427	free_all_object_data ()
428	{
429	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
430	}
431
432	/*	442	/*
433	* 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
434	* skill and experience objects.	444	* skill and experience objects.
		445	* ACTUALLY NO! investigate! TODO
435	*/	446	*/
436	void	447	void
437	object::set_owner (object *owner)	448	object::set_owner (object *owner)
438	{	449	{
		450	// allow objects which own objects
439	if (!owner)	451	if (owner)
440	return;
441
442	/* next line added to allow objects which own objects */
443	/* Add a check for ownercounts in here, as I got into an endless loop
444	* with the fireball owning a poison cloud which then owned the
445	* fireball. I believe that was caused by one of the objects getting
446	* freed and then another object replacing it. Since the ownercounts
447	* didn't match, this check is valid and I believe that cause is valid.
448	*/
449	while (owner->owner)	452	while (owner->owner)
450	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	}
451		460
452	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;
453	}	528	}
454		529
455	/* Zero the key_values on op, decrementing the shared-string	530	/* Zero the key_values on op, decrementing the shared-string
456	* refcounts and freeing the links.	531	* refcounts and freeing the links.
457	*/	532	*/
458	static void	533	static void
459	free_key_values (object *op)	534	free_key_values (object *op)
460	{	535	{
461	for (key_value *i = op->key_values; i != 0;)	536	for (key_value *i = op->key_values; i; )
462	{	537	{
463	key_value *next = i->next;	538	key_value *next = i->next;
464	delete i;	539	delete i;
465		540
466	i = next;	541	i = next;
467	}	542	}
468		543
469	op->key_values = 0;	544	op->key_values = 0;
470	}	545	}
471		546
472	void object::clear ()	547	object &
		548	object::operator =(const object &src)
473	{	549	{
474	attachable_base::clear ();	550	bool is_freed = flag [FLAG_FREED];
		551	bool is_removed = flag [FLAG_REMOVED];
475		552
476	free_key_values (this);
477
478	owner = 0;
479	name = 0;
480	name_pl = 0;
481	title = 0;
482	race = 0;
483	slaying = 0;
484	skill = 0;
485	msg = 0;
486	lore = 0;
487	custom_name = 0;
488	materialname = 0;
489	contr = 0;
490	below = 0;
491	above = 0;
492	inv = 0;
493	container = 0;
494	env = 0;
495	more = 0;
496	head = 0;
497	map = 0;
498	active_next = 0;
499	active_prev = 0;
500
501	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
502
503	SET_FLAG (this, FLAG_REMOVED);
504
505	/* What is not cleared is next, prev, and count */
506
507	expmul = 1.0;
508	face = blank_face;
509
510	if (settings.casting_time)
511	casting_time = -1;
512	}
513
514	/*
515	* copy_to first frees everything allocated by the dst object,
516	* and then copies the contents of itself into the second
517	* object, allocating what needs to be allocated. Basically, any
518	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
519	* if the first object is freed, the pointers in the new object
520	* will point at garbage.
521	*/
522	void
523	object::copy_to (object *dst)
524	{
525	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
526	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
527
528	*(object_copy *)dst = *this;	553	*(object_copy *)this = src;
529	*(object_pod *)dst = *this;
530		554
531	if (self || cb)	555	flag [FLAG_FREED] = is_freed;
532	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));	556	flag [FLAG_REMOVED] = is_removed;
533
534	if (is_freed)
535	SET_FLAG (dst, FLAG_FREED);
536
537	if (is_removed)
538	SET_FLAG (dst, FLAG_REMOVED);
539
540	if (speed < 0)
541	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
542		557
543	/* Copy over key_values, if any. */	558	/* Copy over key_values, if any. */
544	if (key_values)	559	if (src.key_values)
545	{	560	{
546	key_value *tail = 0;	561	key_value *tail = 0;
547	key_value *i;
548
549	dst->key_values = 0;	562	key_values = 0;
550		563
551	for (i = key_values; i; i = i->next)	564	for (key_value *i = src.key_values; i; i = i->next)
552	{	565	{
553	key_value *new_link = new key_value;	566	key_value *new_link = new key_value;
554		567
555	new_link->next = 0;	568	new_link->next = 0;
556	new_link->key = i->key;	569	new_link->key = i->key;
557	new_link->value = i->value;	570	new_link->value = i->value;
558		571
559	/* Try and be clever here, too. */	572	/* Try and be clever here, too. */
560	if (!dst->key_values)	573	if (!key_values)
561	{	574	{
562	dst->key_values = new_link;	575	key_values = new_link;
563	tail = new_link;	576	tail = new_link;
564	}	577	}
565	else	578	else
566	{	579	{
567	tail->next = new_link;	580	tail->next = new_link;
568	tail = new_link;	581	tail = new_link;
569	}	582	}
570	}	583	}
571	}	584	}
		585	}
572		586
573	update_ob_speed (dst);	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 ();
574	}	623	}
575		624
576	object *	625	object *
577	object::clone ()	626	object::clone ()
578	{	627	{
…		…
584	/*	633	/*
585	* 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
586	* 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
587	* 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.
588	*/	637	*/
589
590	void	638	void
591	update_turn_face (object *op)	639	update_turn_face (object *op)
592	{	640	{
593	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	641	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
594	return;	642	return;
		643
595	SET_ANIMATION (op, op->direction);	644	SET_ANIMATION (op, op->direction);
596	update_object (op, UP_OBJ_FACE);	645	update_object (op, UP_OBJ_FACE);
597	}	646	}
598		647
599	/*	648	/*
600	* 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
601	* 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.
602	* 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.
603	*/	652	*/
604	void	653	void
605	update_ob_speed (object *op)	654	object::set_speed (float speed)
606	{	655	{
607	extern int arch_init;	656	if (flag [FLAG_FREED] && speed)
608
609	/* No reason putting the archetypes objects on the speed list,
610	* since they never really need to be updated.
611	*/
612
613	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
614	{	657	{
615	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	658	LOG (llevError, "Object %s is freed but has speed.\n", &name);
616	#ifdef MANY_CORES
617	abort ();
618	#else
619	op->speed = 0;	659	speed = 0;
620	#endif
621	}
622
623	if (arch_init)
624	return;
625
626	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
627	{	660	}
628	/* If already on active list, don't do anything */
629	if (op->active_next || op->active_prev || op == active_objects)
630	return;
631		661
632	/* process_events() expects us to insert the object at the beginning	662	this->speed = speed;
633	* of the list. */
634	op->active_next = active_objects;
635		663
636	if (op->active_next != NULL)	664	if (has_active_speed ())
637	op->active_next->active_prev = op;	665	activate ();
638
639	active_objects = op;
640	}
641	else	666	else
642	{	667	deactivate ();
643	/* If not on the active list, nothing needs to be done */
644	if (!op->active_next && !op->active_prev && op != active_objects)
645	return;
646
647	if (op->active_prev == NULL)
648	{
649	active_objects = op->active_next;
650
651	if (op->active_next != NULL)
652	op->active_next->active_prev = NULL;
653	}
654	else
655	{
656	op->active_prev->active_next = op->active_next;
657
658	if (op->active_next)
659	op->active_next->active_prev = op->active_prev;
660	}
661
662	op->active_next = NULL;
663	op->active_prev = NULL;
664	}
665	}
666
667	/* This function removes object 'op' from the list of active
668	* objects.
669	* This should only be used for style maps or other such
670	* reference maps where you don't want an object that isn't
671	* in play chewing up cpu time getting processed.
672	* The reverse of this is to call update_ob_speed, which
673	* will do the right thing based on the speed of the object.
674	*/
675	void
676	remove_from_active_list (object *op)
677	{
678	/* If not on the active list, nothing needs to be done */
679	if (!op->active_next && !op->active_prev && op != active_objects)
680	return;
681
682	if (op->active_prev == NULL)
683	{
684	active_objects = op->active_next;
685	if (op->active_next != NULL)
686	op->active_next->active_prev = NULL;
687	}
688	else
689	{
690	op->active_prev->active_next = op->active_next;
691	if (op->active_next)
692	op->active_next->active_prev = op->active_prev;
693	}
694	op->active_next = NULL;
695	op->active_prev = NULL;
696	}	668	}
697		669
698	/*	670	/*
699	* update_object() updates the the map.	671	* update_object() updates the the map.
700	* It takes into account invisible objects (and represent squares covered	672	* It takes into account invisible objects (and represent squares covered
…		…
713	* UP_OBJ_FACE: only the objects face has changed.	685	* UP_OBJ_FACE: only the objects face has changed.
714	*/	686	*/
715	void	687	void
716	update_object (object *op, int action)	688	update_object (object *op, int action)
717	{	689	{
718	MoveType move_on, move_off, move_block, move_slow;
719
720	if (op == NULL)	690	if (op == NULL)
721	{	691	{
722	/* this should never happen */	692	/* this should never happen */
723	LOG (llevDebug, "update_object() called for NULL object.\n");	693	LOG (llevDebug, "update_object() called for NULL object.\n");
724	return;	694	return;
…		…
737	*/	707	*/
738	if (!op->map || op->map->in_memory == MAP_SAVING)	708	if (!op->map || op->map->in_memory == MAP_SAVING)
739	return;	709	return;
740		710
741	/* make sure the object is within map boundaries */	711	/* make sure the object is within map boundaries */
742	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)
743	{	713	{
744	LOG (llevError, "update_object() called for object out of map!\n");	714	LOG (llevError, "update_object() called for object out of map!\n");
745	#ifdef MANY_CORES	715	#ifdef MANY_CORES
746	abort ();	716	abort ();
747	#endif	717	#endif
748	return;	718	return;
749	}	719	}
750		720
751	mapspace &m = op->map->at (op->x, op->y);	721	mapspace &m = op->ms ();
752		722
753	if (m.flags_ & P_NEED_UPDATE)	723	if (!(m.flags_ & P_UPTODATE))
754	/* nop */;	724	/* nop */;
755	else if (action == UP_OBJ_INSERT)	725	else if (action == UP_OBJ_INSERT)
756	{	726	{
757	// this is likely overkill, TODO: revisit (schmorp)	727	// this is likely overkill, TODO: revisit (schmorp)
758	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	728	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
767	/* 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
768	* to have move_allow right now.	738	* to have move_allow right now.
769	*/	739	*/
770	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	740	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
771	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	741	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
772	m.flags_ = P_NEED_UPDATE;	742	m.flags_ = 0;
773	}	743	}
774	/* if the object is being removed, we can't make intelligent	744	/* if the object is being removed, we can't make intelligent
775	* decisions, because remove_ob can't really pass the object	745	* decisions, because remove_ob can't really pass the object
776	* that is being removed.	746	* that is being removed.
777	*/	747	*/
778	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	748	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
779	m.flags_ = P_NEED_UPDATE;	749	m.flags_ = 0;
780	else if (action == UP_OBJ_FACE)	750	else if (action == UP_OBJ_FACE)
781	/* Nothing to do for that case */ ;	751	/* Nothing to do for that case */ ;
782	else	752	else
783	LOG (llevError, "update_object called with invalid action: %d\n", action);	753	LOG (llevError, "update_object called with invalid action: %d\n", action);
784		754
785	if (op->more)	755	if (op->more)
786	update_object (op->more, action);	756	update_object (op->more, action);
787	}	757	}
788		758
789	object::vector object::mortals;
790	object::vector object::objects; // not yet used
791	object *object::first;
792
793	void object::free_mortals ()
794	{
795	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
796	if ((*i)->refcnt)
797	++i; // further delay freeing
798	else
799	{
800	delete *i;
801	mortals.erase (i);
802	}
803	}
804
805	object::object ()	759	object::object ()
806	{	760	{
807	SET_FLAG (this, FLAG_REMOVED);	761	SET_FLAG (this, FLAG_REMOVED);
808		762
809	expmul = 1.0;	763	expmul = 1.0;
810	face = blank_face;	764	face = blank_face;
811	}	765	}
812		766
813	object::~object ()	767	object::~object ()
814	{	768	{
		769	unlink ();
		770
815	free_key_values (this);	771	free_key_values (this);
816	}	772	}
817		773
		774	static int object_count;
		775
818	void object::link ()	776	void object::link ()
819	{	777	{
		778	assert (!index);//D
		779	uuid = UUID::gen ();
820	count = ++ob_count;	780	count = ++object_count;
821	uuid = gen_uuid ();
822		781
823	prev = 0;	782	refcnt_inc ();
824	next = object::first;	783	objects.insert (this);
825
826	if (object::first)
827	object::first->prev = this;
828
829	object::first = this;
830	}	784	}
831		785
832	void object::unlink ()	786	void object::unlink ()
833	{	787	{
834	if (this == object::first)	788	if (!index)
835	object::first = next;	789	return;
836		790
837	/* Remove this object from the list of used objects */	791	objects.erase (this);
838	if (prev) prev->next = next;	792	refcnt_dec ();
839	if (next) next->prev = prev;	793	}
840		794
841	prev = 0;	795	void
842	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	}
843	}	900	}
844		901
845	object *object::create ()	902	object *object::create ()
846	{	903	{
847	object *op = new object;	904	object *op = new object;
848	op->link ();	905	op->link ();
849	return op;	906	return op;
850	}	907	}
851		908
852	/*	909	void
853	* free_object() frees everything allocated by an object, removes	910	object::do_destroy ()
854	* it from the list of used objects, and puts it on the list of
855	* free objects. The IS_FREED() flag is set in the object.
856	* The object must have been removed by remove_ob() first for
857	* this function to succeed.
858	*
859	* If destroy_inventory is set, free inventory as well. Else drop items in
860	* inventory to the ground.
861	*/
862	void object::destroy (bool destroy_inventory)
863	{	911	{
864	if (QUERY_FLAG (this, FLAG_FREED))	912	attachable::do_destroy ();
865	return;
866		913
867	if (QUERY_FLAG (this, FLAG_FRIENDLY))	914	if (flag [FLAG_IS_LINKED])
		915	remove_button_link (this);
		916
		917	if (flag [FLAG_FRIENDLY])
868	remove_friendly_object (this);	918	remove_friendly_object (this);
869		919
870	if (!QUERY_FLAG (this, FLAG_REMOVED))	920	if (!flag [FLAG_REMOVED])
871	remove ();	921	remove ();
872		922
873	SET_FLAG (this, FLAG_FREED);	923	destroy_inv (true);
874		924
875	if (more)	925	deactivate ();
876	{	926	unlink ();
877	more->destroy (destroy_inventory);
878	more = 0;
879	}
880		927
881	if (inv)	928	flag [FLAG_FREED] = 1;
882	{
883	/* Only if the space blocks everything do we not process -
884	* if some form of movement is allowed, let objects
885	* drop on that space.
886	*/
887	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
888	{
889	object *op = inv;
890
891	while (op)
892	{
893	object *tmp = op->below;
894	op->destroy (destroy_inventory);
895	op = tmp;
896	}
897	}
898	else
899	{ /* Put objects in inventory onto this space */
900	object *op = inv;
901
902	while (op)
903	{
904	object *tmp = op->below;
905
906	op->remove ();
907
908	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
909	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
910	op->destroy ();
911	else
912	{
913	op->x = x;
914	op->y = y;
915	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
916	}
917
918	op = tmp;
919	}
920	}
921	}
922		929
923	// hack to ensure that freed objects still have a valid map	930	// hack to ensure that freed objects still have a valid map
924	{	931	{
925	static maptile *freed_map; // freed objects are moved here to avoid crashes	932	static maptile *freed_map; // freed objects are moved here to avoid crashes
926		933
927	if (!freed_map)	934	if (!freed_map)
928	{	935	{
929	freed_map = new maptile;	936	freed_map = new maptile;
930		937
		938	freed_map->path = "<freed objects map>";
931	freed_map->name = "/internal/freed_objects_map";	939	freed_map->name = "/internal/freed_objects_map";
932	freed_map->width = 3;	940	freed_map->width = 3;
933	freed_map->height = 3;	941	freed_map->height = 3;
		942	freed_map->nodrop = 1;
934		943
935	freed_map->allocate ();	944	freed_map->alloc ();
		945	freed_map->in_memory = MAP_IN_MEMORY;
936	}	946	}
937		947
938	map = freed_map;	948	map = freed_map;
939	x = 1;	949	x = 1;
940	y = 1;	950	y = 1;
941	}	951	}
942		952
		953	if (more)
		954	{
		955	more->destroy ();
		956	more = 0;
		957	}
		958
		959	head = 0;
		960
943	// clear those pointers that likely might have circular references to us	961	// clear those pointers that likely might cause circular references
944	owner = 0;	962	owner = 0;
945	enemy = 0;	963	enemy = 0;
946	attacked_by = 0;	964	attacked_by = 0;
		965	current_weapon = 0;
		966	}
947		967
948	// only relevant for players(?), but make sure of it anyways	968	void
949	contr = 0;	969	object::destroy (bool destroy_inventory)
		970	{
		971	if (destroyed ())
		972	return;
950		973
951	/* Remove object from the active list */	974	if (destroy_inventory)
952	speed = 0;	975	destroy_inv (false);
953	update_ob_speed (this);
954		976
955	unlink ();	977	if (is_head ())
		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
956		982
957	mortals.push_back (this);	983	attachable::destroy ();
958	}	984	}
959		985
960	/*	986	/*
961	* sub_weight() recursively (outwards) subtracts a number from the	987	* sub_weight() recursively (outwards) subtracts a number from the
962	* 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)).
…		…
978	* 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
979	* 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
980	* object will have no environment. If the object previously had an	1006	* object will have no environment. If the object previously had an
981	* environment, the x and y coordinates will be updated to	1007	* environment, the x and y coordinates will be updated to
982	* the previous environment.	1008	* the previous environment.
983	* Beware: This function is called from the editor as well!
984	*/	1009	*/
985	void	1010	void
986	object::remove ()	1011	object::do_remove ()
987	{	1012	{
988	object *tmp, *last = 0;	1013	object *tmp, *last = 0;
989	object *otmp;	1014	object *otmp;
990		1015
991	int check_walk_off;
992
993	if (QUERY_FLAG (this, FLAG_REMOVED))	1016	if (QUERY_FLAG (this, FLAG_REMOVED))
994	return;	1017	return;
995		1018
996	SET_FLAG (this, FLAG_REMOVED);	1019	SET_FLAG (this, FLAG_REMOVED);
		1020	INVOKE_OBJECT (REMOVE, this);
997		1021
998	if (more)	1022	if (more)
999	more->remove ();	1023	more->remove ();
1000		1024
1001	/*	1025	/*
…		…
1012	/* 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
1013	* made to players inventory. If set, avoiding the call	1037	* made to players inventory. If set, avoiding the call
1014	* to save cpu time.	1038	* to save cpu time.
1015	*/	1039	*/
1016	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1040	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1017	fix_player (otmp);	1041	otmp->update_stats ();
1018		1042
1019	if (above != NULL)	1043	if (above)
1020	above->below = below;	1044	above->below = below;
1021	else	1045	else
1022	env->inv = below;	1046	env->inv = below;
1023		1047
1024	if (below != NULL)	1048	if (below)
1025	below->above = above;	1049	below->above = above;
1026		1050
1027	/* we set up values so that it could be inserted into	1051	/* we set up values so that it could be inserted into
1028	* 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
1029	* to the caller to decide what we want to do.	1053	* to the caller to decide what we want to do.
…		…
1033	above = 0, below = 0;	1057	above = 0, below = 0;
1034	env = 0;	1058	env = 0;
1035	}	1059	}
1036	else if (map)	1060	else if (map)
1037	{	1061	{
1038	/* Re did the following section of code - it looks like it had	1062	if (type == PLAYER)
1039	* lots of logic for things we no longer care about
1040	*/	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 ();
		1069
		1070	--map->players;
		1071	map->touch ();
		1072	}
		1073
		1074	map->dirty = true;
		1075	mapspace &ms = this->ms ();
1041		1076
1042	/* link the object above us */	1077	/* link the object above us */
1043	if (above)	1078	if (above)
1044	above->below = below;	1079	above->below = below;
1045	else	1080	else
1046	map->at (x, y).top = below; /* we were top, set new top */	1081	ms.top = below; /* we were top, set new top */
1047		1082
1048	/* Relink the object below us, if there is one */	1083	/* Relink the object below us, if there is one */
1049	if (below)	1084	if (below)
1050	below->above = above;	1085	below->above = above;
1051	else	1086	else
…		…
1053	/* 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
1054	* use translated coordinates in case some oddness with map tiling is	1089	* use translated coordinates in case some oddness with map tiling is
1055	* evident	1090	* evident
1056	*/	1091	*/
1057	if (GET_MAP_OB (map, x, y) != this)	1092	if (GET_MAP_OB (map, x, y) != this)
1058	{
1059	char *dump = dump_object (this);
1060	LOG (llevError,
1061	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);	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 ());
1062	free (dump);
1063	dump = dump_object (GET_MAP_OB (map, x, y));
1064	LOG (llevError, "%s\n", dump);
1065	free (dump);
1066	}
1067		1094
1068	map->at (x, y).bottom = above; /* goes on above it. */	1095	ms.bot = above; /* goes on above it. */
1069	}	1096	}
1070		1097
1071	above = 0;	1098	above = 0;
1072	below = 0;	1099	below = 0;
1073		1100
1074	if (map->in_memory == MAP_SAVING)	1101	if (map->in_memory == MAP_SAVING)
1075	return;	1102	return;
1076		1103
1077	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	1104	int check_walk_off = !flag [FLAG_NO_APPLY];
1078		1105
		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
1079	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1118	for (tmp = ms.bot; tmp; tmp = tmp->above)
1080	{	1119	{
1081	/* 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
1082	* being removed.	1121	* being removed.
1083	*/	1122	*/
1084		1123
1085	if (tmp->type == PLAYER && tmp != this)
1086	{
1087	/* If a container that the player is currently using somehow gets
1088	* removed (most likely destroyed), update the player view
1089	* appropriately.
1090	*/
1091	if (tmp->container == this)
1092	{
1093	CLEAR_FLAG (this, FLAG_APPLIED);
1094	tmp->container = 0;
1095	}
1096
1097	tmp->contr->socket->floorbox_update ();
1098	}
1099
1100	/* See if player moving off should effect something */	1124	/* See if object moving off should effect something */
1101	if (check_walk_off	1125	if (check_walk_off
1102	&& ((move_type & tmp->move_off)	1126	&& ((move_type & tmp->move_off)
1103	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1127	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1104	{	1128	{
1105	move_apply (tmp, this, 0);	1129	move_apply (tmp, this, 0);
1106		1130
1107	if (destroyed ())	1131	if (destroyed ())
1108	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1132	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1109	}	1133	}
1110		1134
1111	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1112
1113	if (tmp->above == tmp)
1114	tmp->above = 0;
1115
1116	last = tmp;	1135	last = tmp;
1117	}	1136	}
1118		1137
1119	/* 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?
1120	if (!last)	1140	if (!last)
1121	map->at (x, y).flags_ = P_NEED_UPDATE;	1141	map->at (x, y).flags_ = 0;
1122	else	1142	else
1123	update_object (last, UP_OBJ_REMOVE);	1143	update_object (last, UP_OBJ_REMOVE);
1124		1144
1125	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1145	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1126	update_all_los (map, x, y);	1146	update_all_los (map, x, y);
1127	}	1147	}
1128	}	1148	}
1129		1149
1130	/*	1150	/*
…		…
1139	merge_ob (object *op, object *top)	1159	merge_ob (object *op, object *top)
1140	{	1160	{
1141	if (!op->nrof)	1161	if (!op->nrof)
1142	return 0;	1162	return 0;
1143		1163
1144	if (top == NULL)	1164	if (!top)
1145	for (top = op; top != NULL && top->above != NULL; top = top->above);	1165	for (top = op; top && top->above; top = top->above)
		1166	;
1146		1167
1147	for (; top != NULL; top = top->below)	1168	for (; top; top = top->below)
1148	{	1169	{
1149	if (top == op)	1170	if (top == op)
1150	continue;	1171	continue;
1151		1172
1152	if (object::can_merge (op, top))	1173	if (object::can_merge (op, top))
…		…
1161	}	1182	}
1162		1183
1163	return 0;	1184	return 0;
1164	}	1185	}
1165		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
1166	/*	1210	/*
1167	* 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
1168	* job preparing multi-part monsters	1212	* job preparing multi-part monsters.
1169	*/	1213	*/
1170	object *	1214	object *
1171	insert_ob_in_map_at (object *op, maptile *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)
1172	{	1216	{
1173	object *tmp;
1174
1175	if (op->head)
1176	op = op->head;
1177
1178	for (tmp = op; tmp; tmp = tmp->more)	1217	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1179	{	1218	{
1180	tmp->x = x + tmp->arch->clone.x;	1219	tmp->x = x + tmp->arch->x;
1181	tmp->y = y + tmp->arch->clone.y;	1220	tmp->y = y + tmp->arch->y;
1182	}	1221	}
1183		1222
1184	return insert_ob_in_map (op, m, originator, flag);	1223	return insert_ob_in_map (op, m, originator, flag);
1185	}	1224	}
1186		1225
…		…
1202	* Return value:	1241	* Return value:
1203	* new object if 'op' was merged with other object	1242	* new object if 'op' was merged with other object
1204	* NULL if 'op' was destroyed	1243	* NULL if 'op' was destroyed
1205	* just 'op' otherwise	1244	* just 'op' otherwise
1206	*/	1245	*/
1207
1208	object *	1246	object *
1209	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1247	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1210	{	1248	{
		1249	assert (!op->flag [FLAG_FREED]);
		1250
1211	object *tmp, *top, *floor = NULL;	1251	object *top, *floor = NULL;
1212	sint16 x, y;
1213		1252
1214	if (QUERY_FLAG (op, FLAG_FREED))	1253	op->remove ();
1215	{
1216	LOG (llevError, "Trying to insert freed object!\n");
1217	return NULL;
1218	}
1219
1220	if (m == NULL)
1221	{
1222	char *dump = dump_object (op);
1223	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1224	free (dump);
1225	return op;
1226	}
1227
1228	if (out_of_map (m, op->x, op->y))
1229	{
1230	char *dump = dump_object (op);
1231	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1232	#ifdef MANY_CORES
1233	/* Better to catch this here, as otherwise the next use of this object
1234	* is likely to cause a crash. Better to find out where it is getting
1235	* improperly inserted.
1236	*/
1237	abort ();
1238	#endif
1239	free (dump);
1240	return op;
1241	}
1242
1243	if (!QUERY_FLAG (op, FLAG_REMOVED))
1244	{
1245	char *dump = dump_object (op);
1246	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1247	free (dump);
1248	return op;
1249	}
1250
1251	if (op->more != NULL)
1252	{
1253	/* The part may be on a different map. */
1254
1255	object *more = op->more;
1256
1257	/* We really need the caller to normalize coordinates - if
1258	* we set the map, that doesn't work if the location is within
1259	* a map and this is straddling an edge. So only if coordinate
1260	* is clear wrong do we normalize it.
1261	*/
1262	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1263	more->map = get_map_from_coord (m, &more->x, &more->y);
1264	else if (!more->map)
1265	{
1266	/* For backwards compatibility - when not dealing with tiled maps,
1267	* more->map should always point to the parent.
1268	*/
1269	more->map = m;
1270	}
1271
1272	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1273	{
1274	if (!op->head)
1275	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1276
1277	return NULL;
1278	}
1279	}
1280
1281	CLEAR_FLAG (op, FLAG_REMOVED);
1282		1254
1283	/* Ideally, the caller figures this out. However, it complicates a lot	1255	/* Ideally, the caller figures this out. However, it complicates a lot
1284	* 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
1285	* need extra work	1257	* need extra work
1286	*/	1258	*/
1287	op->map = get_map_from_coord (m, &op->x, &op->y);	1259	if (!xy_normalise (m, op->x, op->y))
1288	x = op->x;	1260	{
1289	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 ();
1290		1273
1291	/* this has to be done after we translate the coordinates.	1274	/* this has to be done after we translate the coordinates.
1292	*/	1275	*/
1293	if (op->nrof && !(flag & INS_NO_MERGE))	1276	if (op->nrof && !(flag & INS_NO_MERGE))
1294	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1277	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1295	if (object::can_merge (op, tmp))	1278	if (object::can_merge (op, tmp))
1296	{	1279	{
1297	op->nrof += tmp->nrof;	1280	op->nrof += tmp->nrof;
1298	tmp->destroy ();	1281	tmp->destroy ();
1299	}	1282	}
…		…
1316	op->below = originator->below;	1299	op->below = originator->below;
1317		1300
1318	if (op->below)	1301	if (op->below)
1319	op->below->above = op;	1302	op->below->above = op;
1320	else	1303	else
1321	op->map->at (op->x, op->y).bottom = op;	1304	ms.bot = op;
1322		1305
1323	/* since *below* originator, no need to update top */	1306	/* since *below* originator, no need to update top */
1324	originator->below = op;	1307	originator->below = op;
1325	}	1308	}
1326	else	1309	else
1327	{	1310	{
		1311	top = ms.bot;
		1312
1328	/* If there are other objects, then */	1313	/* If there are other objects, then */
1329	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1314	if (top)
1330	{	1315	{
1331	object *last = NULL;	1316	object *last = 0;
1332		1317
1333	/*	1318	/*
1334	* 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.
1335	* We've already dealt with merging if appropriate.	1320	* We've already dealt with merging if appropriate.
1336	* 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
…		…
1340	* 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
1341	* 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
1342	* 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
1343	* that flying non pickable objects are spell objects.	1328	* that flying non pickable objects are spell objects.
1344	*/	1329	*/
1345		1330	for (top = ms.bot; top; top = top->above)
1346	while (top != NULL)
1347	{	1331	{
1348	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))
1349	floor = top;	1333	floor = top;
1350		1334
1351	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))
…		…
1354	top = top->below;	1338	top = top->below;
1355	break;	1339	break;
1356	}	1340	}
1357		1341
1358	last = top;	1342	last = top;
1359	top = top->above;
1360	}	1343	}
1361		1344
1362	/* 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 */
1363	top = last;	1346	top = last;
1364		1347
…		…
1366	* looks like instead of lots of conditions here.	1349	* looks like instead of lots of conditions here.
1367	* makes things faster, and effectively the same result.	1350	* makes things faster, and effectively the same result.
1368	*/	1351	*/
1369		1352
1370	/* Have object 'fall below' other objects that block view.	1353	/* Have object 'fall below' other objects that block view.
1371	* Unless those objects are exits, type 66	1354	* Unless those objects are exits.
1372	* If INS_ON_TOP is used, don't do this processing	1355	* If INS_ON_TOP is used, don't do this processing
1373	* Need to find the object that in fact blocks view, otherwise	1356	* Need to find the object that in fact blocks view, otherwise
1374	* stacking is a bit odd.	1357	* stacking is a bit odd.
1375	*/	1358	*/
1376	if (!(flag & INS_ON_TOP) &&	1359	if (!(flag & INS_ON_TOP)
1377	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1360	&& ms.flags () & P_BLOCKSVIEW
		1361	&& (op->face && !faces [op->face].visibility))
1378	{	1362	{
1379	for (last = top; last != floor; last = last->below)	1363	for (last = top; last != floor; last = last->below)
1380	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1364	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1381	break;	1365	break;
		1366
1382	/* Check to see if we found the object that blocks view,	1367	/* Check to see if we found the object that blocks view,
1383	* 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
1384	* we can get inserted below this one, which requires we	1369	* we can get inserted below this one, which requires we
1385	* set top to the object below us.	1370	* set top to the object below us.
1386	*/	1371	*/
1387	if (last && last->below && last != floor)	1372	if (last && last->below && last != floor)
1388	top = last->below;	1373	top = last->below;
1389	}	1374	}
1390	} /* If objects on this space */	1375	} /* If objects on this space */
1391		1376
1392	if (flag & INS_MAP_LOAD)
1393	top = GET_MAP_TOP (op->map, op->x, op->y);
1394
1395	if (flag & INS_ABOVE_FLOOR_ONLY)	1377	if (flag & INS_ABOVE_FLOOR_ONLY)
1396	top = floor;	1378	top = floor;
1397		1379
1398	/* 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.
1399	*/	1381	*/
1400		1382
1401	/* First object on this space */	1383	/* First object on this space */
1402	if (!top)	1384	if (!top)
1403	{	1385	{
1404	op->above = GET_MAP_OB (op->map, op->x, op->y);	1386	op->above = ms.bot;
1405		1387
1406	if (op->above)	1388	if (op->above)
1407	op->above->below = op;	1389	op->above->below = op;
1408		1390
1409	op->below = NULL;	1391	op->below = 0;
1410	op->map->at (op->x, op->y).bottom = op;	1392	ms.bot = op;
1411	}	1393	}
1412	else	1394	else
1413	{ /* get inserted into the stack above top */	1395	{ /* get inserted into the stack above top */
1414	op->above = top->above;	1396	op->above = top->above;
1415		1397
…		…
1418		1400
1419	op->below = top;	1401	op->below = top;
1420	top->above = op;	1402	top->above = op;
1421	}	1403	}
1422		1404
1423	if (op->above == NULL)	1405	if (!op->above)
1424	op->map->at (op->x, op->y).top = op;	1406	ms.top = op;
1425	} /* else not INS_BELOW_ORIGINATOR */	1407	} /* else not INS_BELOW_ORIGINATOR */
1426		1408
1427	if (op->type == PLAYER)	1409	if (op->type == PLAYER)
		1410	{
1428	op->contr->do_los = 1;	1411	op->contr->do_los = 1;
		1412	++op->map->players;
		1413	op->map->touch ();
		1414	}
1429		1415
1430	/* If we have a floor, we know the player, if any, will be above	1416	op->map->dirty = true;
1431	* it, so save a few ticks and start from there.	1417
1432	*/	1418	if (object *pl = ms.player ())
1433	if (!(flag & INS_MAP_LOAD))
1434	if (object *pl = op->map->at (op->x, op->y).player ())
1435	pl->contr->socket->floorbox_update ();	1419	pl->contr->ns->floorbox_update ();
1436		1420
1437	/* If this object glows, it may affect lighting conditions that are	1421	/* If this object glows, it may affect lighting conditions that are
1438	* 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
1439	* 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
1440	* on the map will get recalculated. The players could very well	1424	* on the map will get recalculated. The players could very well
1441	* 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 -
1442	* this should get redone to only look for players within range,	1426	* this should get redone to only look for players within range,
1443	* or just updating the P_NEED_UPDATE for spaces within this area	1427	* or just updating the P_UPTODATE for spaces within this area
1444	* of effect may be sufficient.	1428	* of effect may be sufficient.
1445	*/	1429	*/
1446	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1430	if (op->map->darkness && (op->glow_radius != 0))
1447	update_all_los (op->map, op->x, op->y);	1431	update_all_los (op->map, op->x, op->y);
1448		1432
1449	/* updates flags (blocked, alive, no magic, etc) for this map space */	1433	/* updates flags (blocked, alive, no magic, etc) for this map space */
1450	update_object (op, UP_OBJ_INSERT);	1434	update_object (op, UP_OBJ_INSERT);
		1435
		1436	INVOKE_OBJECT (INSERT, op);
1451		1437
1452	/* 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,
1453	* we want to have floorbox_update called before calling this.	1439	* we want to have floorbox_update called before calling this.
1454	*	1440	*
1455	* check_move_on() must be after this because code called from	1441	* check_move_on() must be after this because code called from
…		…
1457	* blocked() and wall() work properly), and these flags are updated by	1443	* blocked() and wall() work properly), and these flags are updated by
1458	* update_object().	1444	* update_object().
1459	*/	1445	*/
1460		1446
1461	/* 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 */
1462	if (!(flag & INS_NO_WALK_ON) && !op->head)	1448	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1463	{	1449	{
1464	if (check_move_on (op, originator))	1450	if (check_move_on (op, originator))
1465	return NULL;	1451	return 0;
1466		1452
1467	/* 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
1468	* walk on's.	1454	* walk on's.
1469	*/	1455	*/
1470	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1456	for (object *tmp = op->more; tmp; tmp = tmp->more)
1471	if (check_move_on (tmp, originator))	1457	if (check_move_on (tmp, originator))
1472	return NULL;	1458	return 0;
1473	}	1459	}
1474		1460
1475	return op;	1461	return op;
1476	}	1462	}
1477		1463
…		…
1484	{	1470	{
1485	object *tmp, *tmp1;	1471	object *tmp, *tmp1;
1486		1472
1487	/* first search for itself and remove any old instances */	1473	/* first search for itself and remove any old instances */
1488		1474
1489	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)
1490	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1476	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1491	tmp->destroy ();	1477	tmp->destroy ();
1492		1478
1493	tmp1 = arch_to_object (archetype::find (arch_string));	1479	tmp1 = arch_to_object (archetype::find (arch_string));
1494		1480
1495	tmp1->x = op->x;	1481	tmp1->x = op->x;
1496	tmp1->y = op->y;	1482	tmp1->y = op->y;
1497	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);
1498	}	1490	}
1499		1491
1500	/*	1492	/*
1501	* 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
1502	* is returned contains nr objects, and the remaining parts contains	1494	* is returned contains nr objects, and the remaining parts contains
1503	* 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).
1504	* On failure, NULL is returned, and the reason put into the	1496	* On failure, NULL is returned, and the reason put into the
1505	* global static errmsg array.	1497	* global static errmsg array.
1506	*/	1498	*/
1507
1508	object *	1499	object *
1509	get_split_ob (object *orig_ob, uint32 nr)	1500	get_split_ob (object *orig_ob, uint32 nr)
1510	{	1501	{
1511	object *newob;	1502	object *newob;
1512	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1503	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1543	* 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
1544	* is subsequently removed and freed.	1535	* is subsequently removed and freed.
1545	*	1536	*
1546	* 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
1547	*/	1538	*/
1548
1549	object *	1539	object *
1550	decrease_ob_nr (object *op, uint32 i)	1540	decrease_ob_nr (object *op, uint32 i)
1551	{	1541	{
1552	object *tmp;	1542	object *tmp;
1553	player *pl;
1554		1543
1555	if (i == 0) /* objects with op->nrof require this check */	1544	if (i == 0) /* objects with op->nrof require this check */
1556	return op;	1545	return op;
1557		1546
1558	if (i > op->nrof)	1547	if (i > op->nrof)
…		…
1571	* IMO, searching through all the players will mostly	1560	* IMO, searching through all the players will mostly
1572	* likely be quicker than following op->env to the map,	1561	* likely be quicker than following op->env to the map,
1573	* and then searching the map for a player.	1562	* and then searching the map for a player.
1574	*/	1563	*/
1575	if (!tmp)	1564	if (!tmp)
1576	{	1565	for_all_players (pl)
1577	for (pl = first_player; pl; pl = pl->next)
1578	if (pl->ob->container == op->env)	1566	if (pl->ob->container == op->env)
1579	{	1567	{
1580	tmp = pl->ob;	1568	tmp = pl->ob;
1581	break;	1569	break;
1582	}	1570	}
1583	}
1584		1571
1585	if (i < op->nrof)	1572	if (i < op->nrof)
1586	{	1573	{
1587	sub_weight (op->env, op->weight * i);	1574	sub_weight (op->env, op->weight * i);
1588	op->nrof -= i;	1575	op->nrof -= i;
…		…
1631		1618
1632	/*	1619	/*
1633	* add_weight(object, weight) adds the specified weight to an object,	1620	* add_weight(object, weight) adds the specified weight to an object,
1634	* and also updates how much the environment(s) is/are carrying.	1621	* and also updates how much the environment(s) is/are carrying.
1635	*/	1622	*/
1636
1637	void	1623	void
1638	add_weight (object *op, signed long weight)	1624	add_weight (object *op, signed long weight)
1639	{	1625	{
1640	while (op != NULL)	1626	while (op != NULL)
1641	{	1627	{
…		…
1656	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1642	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1657	free (dump);	1643	free (dump);
1658	return op;	1644	return op;
1659	}	1645	}
1660		1646
1661	if (where->head)	1647	if (where->head_ () != where)
1662	{	1648	{
1663	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1649	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1664	where = where->head;	1650	where = where->head;
1665	}	1651	}
1666		1652
1667	return where->insert (op);	1653	return where->insert (op);
1668	}	1654	}
…		…
1673	* inside the object environment.	1659	* inside the object environment.
1674	*	1660	*
1675	* 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
1676	* be != op, if items are merged. -Tero	1662	* be != op, if items are merged. -Tero
1677	*/	1663	*/
1678
1679	object *	1664	object *
1680	object::insert (object *op)	1665	object::insert (object *op)
1681	{	1666	{
1682	object *tmp, *otmp;
1683
1684	if (!QUERY_FLAG (op, FLAG_REMOVED))	1667	if (!QUERY_FLAG (op, FLAG_REMOVED))
1685	op->remove ();	1668	op->remove ();
1686		1669
1687	if (op->more)	1670	if (op->more)
1688	{	1671	{
…		…
1690	return op;	1673	return op;
1691	}	1674	}
1692		1675
1693	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1676	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1694	CLEAR_FLAG (op, FLAG_REMOVED);	1677	CLEAR_FLAG (op, FLAG_REMOVED);
		1678
1695	if (op->nrof)	1679	if (op->nrof)
1696	{	1680	{
1697	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1681	for (object *tmp = inv; tmp; tmp = tmp->below)
1698	if (object::can_merge (tmp, op))	1682	if (object::can_merge (tmp, op))
1699	{	1683	{
1700	/* return the original object and remove inserted object	1684	/* return the original object and remove inserted object
1701	(client needs the original object) */	1685	(client needs the original object) */
1702	tmp->nrof += op->nrof;	1686	tmp->nrof += op->nrof;
…		…
1721	add_weight (this, op->weight * op->nrof);	1705	add_weight (this, op->weight * op->nrof);
1722	}	1706	}
1723	else	1707	else
1724	add_weight (this, (op->weight + op->carrying));	1708	add_weight (this, (op->weight + op->carrying));
1725		1709
1726	otmp = this->in_player ();	1710	if (object *otmp = this->in_player ())
1727	if (otmp && otmp->contr)
1728	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1711	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1729	fix_player (otmp);	1712	otmp->update_stats ();
1730		1713
		1714	op->owner = 0; // its his/hers now. period.
1731	op->map = 0;	1715	op->map = 0;
1732	op->env = this;	1716	op->env = this;
1733	op->above = 0;	1717	op->above = 0;
1734	op->below = 0;	1718	op->below = 0;
1735	op->x = 0, op->y = 0;	1719	op->x = op->y = 0;
1736		1720
1737	/* 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 */
1738	if ((op->glow_radius != 0) && map)	1722	if (op->glow_radius && map)
1739	{	1723	{
1740	#ifdef DEBUG_LIGHTS	1724	#ifdef DEBUG_LIGHTS
1741	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);
1742	#endif /* DEBUG_LIGHTS */	1726	#endif /* DEBUG_LIGHTS */
1743	if (MAP_DARKNESS (map))	1727	if (map->darkness)
1744	update_all_los (map, x, y);	1728	update_all_los (map, x, y);
1745	}	1729	}
1746		1730
1747	/* 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.
1748	* It sure simplifies this function...	1732	* It sure simplifies this function...
…		…
1753	{	1737	{
1754	op->below = inv;	1738	op->below = inv;
1755	op->below->above = op;	1739	op->below->above = op;
1756	inv = op;	1740	inv = op;
1757	}	1741	}
		1742
		1743	INVOKE_OBJECT (INSERT, this);
1758		1744
1759	return op;	1745	return op;
1760	}	1746	}
1761		1747
1762	/*	1748	/*
…		…
1777	*	1763	*
1778	* 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
1779	* 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
1780	* on top.	1766	* on top.
1781	*/	1767	*/
1782
1783	int	1768	int
1784	check_move_on (object *op, object *originator)	1769	check_move_on (object *op, object *originator)
1785	{	1770	{
1786	object *tmp;	1771	object *tmp;
1787	maptile *m = op->map;	1772	maptile *m = op->map;
…		…
1814		1799
1815	/* The objects have to be checked from top to bottom.	1800	/* The objects have to be checked from top to bottom.
1816	* Hence, we first go to the top:	1801	* Hence, we first go to the top:
1817	*/	1802	*/
1818		1803
1819	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)
1820	{	1805	{
1821	/* Trim the search when we find the first other spell effect	1806	/* Trim the search when we find the first other spell effect
1822	* 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,
1823	* we don't need to check all of them.	1808	* we don't need to check all of them.
1824	*/	1809	*/
…		…
1842	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1827	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1843	((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))
1844	{	1829	{
1845		1830
1846	float	1831	float
1847	diff = tmp->move_slow_penalty * FABS (op->speed);	1832	diff = tmp->move_slow_penalty * fabs (op->speed);
1848		1833
1849	if (op->type == PLAYER)	1834	if (op->type == PLAYER)
1850	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)) ||
1851	(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)))
1852	diff /= 4.0;	1837	diff /= 4.0;
…		…
1879	/*	1864	/*
1880	* present_arch(arch, map, x, y) searches for any objects with	1865	* present_arch(arch, map, x, y) searches for any objects with
1881	* a matching archetype at the given map and coordinates.	1866	* a matching archetype at the given map and coordinates.
1882	* The first matching object is returned, or NULL if none.	1867	* The first matching object is returned, or NULL if none.
1883	*/	1868	*/
1884
1885	object *	1869	object *
1886	present_arch (const archetype *at, maptile *m, int x, int y)	1870	present_arch (const archetype *at, maptile *m, int x, int y)
1887	{	1871	{
1888	object *
1889	tmp;
1890
1891	if (m == NULL || out_of_map (m, x, y))	1872	if (!m || out_of_map (m, x, y))
1892	{	1873	{
1893	LOG (llevError, "Present_arch called outside map.\n");	1874	LOG (llevError, "Present_arch called outside map.\n");
1894	return NULL;	1875	return NULL;
1895	}	1876	}
1896	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)
1897	if (tmp->arch == at)	1879	if (tmp->arch == at)
1898	return tmp;	1880	return tmp;
		1881
1899	return NULL;	1882	return NULL;
1900	}	1883	}
1901		1884
1902	/*	1885	/*
1903	* present(type, map, x, y) searches for any objects with	1886	* present(type, map, x, y) searches for any objects with
1904	* a matching type variable at the given map and coordinates.	1887	* a matching type variable at the given map and coordinates.
1905	* The first matching object is returned, or NULL if none.	1888	* The first matching object is returned, or NULL if none.
1906	*/	1889	*/
1907
1908	object *	1890	object *
1909	present (unsigned char type, maptile *m, int x, int y)	1891	present (unsigned char type, maptile *m, int x, int y)
1910	{	1892	{
1911	object *
1912	tmp;
1913
1914	if (out_of_map (m, x, y))	1893	if (out_of_map (m, x, y))
1915	{	1894	{
1916	LOG (llevError, "Present called outside map.\n");	1895	LOG (llevError, "Present called outside map.\n");
1917	return NULL;	1896	return NULL;
1918	}	1897	}
1919	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)
1920	if (tmp->type == type)	1900	if (tmp->type == type)
1921	return tmp;	1901	return tmp;
		1902
1922	return NULL;	1903	return NULL;
1923	}	1904	}
1924		1905
1925	/*	1906	/*
1926	* present_in_ob(type, object) searches for any objects with	1907	* present_in_ob(type, object) searches for any objects with
1927	* a matching type variable in the inventory of the given object.	1908	* a matching type variable in the inventory of the given object.
1928	* The first matching object is returned, or NULL if none.	1909	* The first matching object is returned, or NULL if none.
1929	*/	1910	*/
1930
1931	object *	1911	object *
1932	present_in_ob (unsigned char type, const object *op)	1912	present_in_ob (unsigned char type, const object *op)
1933	{	1913	{
1934	object *
1935	tmp;
1936
1937	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1914	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1938	if (tmp->type == type)	1915	if (tmp->type == type)
1939	return tmp;	1916	return tmp;
		1917
1940	return NULL;	1918	return NULL;
1941	}	1919	}
1942		1920
1943	/*	1921	/*
1944	* present_in_ob (type, str, object) searches for any objects with	1922	* present_in_ob (type, str, object) searches for any objects with
…		…
1952	* 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
1953	* 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
1954	* 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
1955	* to be unique.	1933	* to be unique.
1956	*/	1934	*/
1957
1958	object *	1935	object *
1959	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)
1960	{	1937	{
1961	object *
1962	tmp;
1963
1964	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1938	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1965	{
1966	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1939	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
1967	return tmp;	1940	return tmp;
1968	}	1941
1969	return NULL;	1942	return 0;
1970	}	1943	}
1971		1944
1972	/*	1945	/*
1973	* present_arch_in_ob(archetype, object) searches for any objects with	1946	* present_arch_in_ob(archetype, object) searches for any objects with
1974	* a matching archetype in the inventory of the given object.	1947	* a matching archetype in the inventory of the given object.
1975	* The first matching object is returned, or NULL if none.	1948	* The first matching object is returned, or NULL if none.
1976	*/	1949	*/
1977
1978	object *	1950	object *
1979	present_arch_in_ob (const archetype *at, const object *op)	1951	present_arch_in_ob (const archetype *at, const object *op)
1980	{	1952	{
1981	object *
1982	tmp;
1983
1984	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1953	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1985	if (tmp->arch == at)	1954	if (tmp->arch == at)
1986	return tmp;	1955	return tmp;
		1956
1987	return NULL;	1957	return NULL;
1988	}	1958	}
1989		1959
1990	/*	1960	/*
1991	* activate recursively a flag on an object inventory	1961	* activate recursively a flag on an object inventory
1992	*/	1962	*/
1993	void	1963	void
1994	flag_inv (object *op, int flag)	1964	flag_inv (object *op, int flag)
1995	{	1965	{
1996	object *
1997	tmp;
1998
1999	if (op->inv)
2000	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1966	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2001	{	1967	{
2002	SET_FLAG (tmp, flag);	1968	SET_FLAG (tmp, flag);
2003	flag_inv (tmp, flag);	1969	flag_inv (tmp, flag);
2004	}	1970	}
2005	} /*	1971	}
		1972
		1973	/*
2006	* desactivate recursively a flag on an object inventory	1974	* deactivate recursively a flag on an object inventory
2007	*/	1975	*/
2008	void	1976	void
2009	unflag_inv (object *op, int flag)	1977	unflag_inv (object *op, int flag)
2010	{	1978	{
2011	object *
2012	tmp;
2013
2014	if (op->inv)
2015	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1979	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2016	{	1980	{
2017	CLEAR_FLAG (tmp, flag);	1981	CLEAR_FLAG (tmp, flag);
2018	unflag_inv (tmp, flag);	1982	unflag_inv (tmp, flag);
2019	}	1983	}
2020	}
2021
2022	/*
2023	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2024	* all it's inventory (recursively).
2025	* If checksums are used, a player will get set_cheat called for
2026	* him/her-self and all object carried by a call to this function.
2027	*/
2028
2029	void
2030	set_cheat (object *op)
2031	{
2032	SET_FLAG (op, FLAG_WAS_WIZ);
2033	flag_inv (op, FLAG_WAS_WIZ);
2034	}	1984	}
2035		1985
2036	/*	1986	/*
2037	* 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
2038	* 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
…		…
2040	* to search (see the freearr_x/y[] definition).	1990	* to search (see the freearr_x/y[] definition).
2041	* It returns a random choice among the alternatives found.	1991	* It returns a random choice among the alternatives found.
2042	* 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
2043	* does all 4 immediate directions). This returns the index into the	1993	* does all 4 immediate directions). This returns the index into the
2044	* 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)
2045	* Note - this only checks to see if there is space for the head of the
2046	* object - if it is a multispace object, this should be called for all
2047	* pieces.
2048	* Note2: This function does correctly handle tiled maps, but does not	1995	* Note: This function does correctly handle tiled maps, but does not
2049	* inform the caller. However, insert_ob_in_map will update as	1996	* inform the caller. However, insert_ob_in_map will update as
2050	* 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.
2051	* 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
2052	* 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
2053	* 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
2054	* 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
2055	* customized, changed states, etc.	2002	* customized, changed states, etc.
2056	*/	2003	*/
2057
2058	int	2004	int
2059	find_free_spot (const object *ob, maptile *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)
2060	{	2006	{
2061	int
2062	i,
2063	index = 0, flag;
2064	static int
2065	altern[SIZEOFFREE];	2007	int altern[SIZEOFFREE];
		2008	int index = 0, flag;
2066		2009
2067	for (i = start; i < stop; i++)	2010	for (int i = start; i < stop; i++)
2068	{	2011	{
2069	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2012	mapxy pos (m, x, y); pos.move (i);
2070	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	{
2071	altern[index++] = i;	2028	altern [index++] = i;
		2029	continue;
		2030	}
2072		2031
2073	/* 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.
2074	* 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.
2075	* 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 -
2076	* 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
2077	* 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
2078	* to only the spaces immediately surrounding the target area, and	2037	* to only the spaces immediately surrounding the target area, and
2079	* won't look 2 spaces south of the target space.	2038	* won't look 2 spaces south of the target space.
2080	*/	2039	*/
2081	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2040	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2041	{
2082	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;
2083	}	2056	}
2084		2057
2085	if (!index)	2058	if (!index)
2086	return -1;	2059	return -1;
2087		2060
2088	return altern[RANDOM () % index];	2061	return altern [rndm (index)];
2089	}	2062	}
2090		2063
2091	/*	2064	/*
2092	* find_first_free_spot(archetype, maptile, x, y) works like	2065	* find_first_free_spot(archetype, maptile, x, y) works like
2093	* find_free_spot(), but it will search max number of squares.	2066	* find_free_spot(), but it will search max number of squares.
2094	* 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.
2095	* 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.
2096	*/	2069	*/
2097
2098	int	2070	int
2099	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2071	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2100	{	2072	{
2101	int
2102	i;
2103
2104	for (i = 0; i < SIZEOFFREE; i++)	2073	for (int i = 0; i < SIZEOFFREE; i++)
2105	{
2106	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]))
2107	return i;	2075	return i;
2108	}	2076
2109	return -1;	2077	return -1;
2110	}	2078	}
2111		2079
2112	/*	2080	/*
2113	* The function permute(arr, begin, end) randomly reorders the array	2081	* The function permute(arr, begin, end) randomly reorders the array
2114	* arr[begin..end-1].	2082	* arr[begin..end-1].
		2083	* now uses a fisher-yates shuffle, old permute was broken
2115	*/	2084	*/
2116	static void	2085	static void
2117	permute (int *arr, int begin, int end)	2086	permute (int *arr, int begin, int end)
2118	{	2087	{
2119	int	2088	arr += begin;
2120	i,
2121	j,
2122	tmp,
2123	len;
2124
2125	len = end - begin;	2089	end -= begin;
2126	for (i = begin; i < end; i++)
2127	{
2128	j = begin + RANDOM () % len;
2129		2090
2130	tmp = arr[i];	2091	while (--end)
2131	arr[i] = arr[j];	2092	swap (arr [end], arr [rndm (end + 1)]);
2132	arr[j] = tmp;
2133	}
2134	}	2093	}
2135		2094
2136	/* new function to make monster searching more efficient, and effective!	2095	/* new function to make monster searching more efficient, and effective!
2137	* This basically returns a randomized array (in the passed pointer) of	2096	* This basically returns a randomized array (in the passed pointer) of
2138	* 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
…		…
2141	* 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.
2142	*/	2101	*/
2143	void	2102	void
2144	get_search_arr (int *search_arr)	2103	get_search_arr (int *search_arr)
2145	{	2104	{
2146	int	2105	int i;
2147	i;
2148		2106
2149	for (i = 0; i < SIZEOFFREE; i++)	2107	for (i = 0; i < SIZEOFFREE; i++)
2150	{
2151	search_arr[i] = i;	2108	search_arr[i] = i;
2152	}
2153		2109
2154	permute (search_arr, 1, SIZEOFFREE1 + 1);	2110	permute (search_arr, 1, SIZEOFFREE1 + 1);
2155	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2111	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2156	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2112	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2157	}	2113	}
…		…
2166	* Perhaps incorrectly, but I'm making the assumption that exclude	2122	* Perhaps incorrectly, but I'm making the assumption that exclude
2167	* 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
2168	* 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
2169	* there is capable of.	2125	* there is capable of.
2170	*/	2126	*/
2171
2172	int	2127	int
2173	find_dir (maptile *m, int x, int y, object *exclude)	2128	find_dir (maptile *m, int x, int y, object *exclude)
2174	{	2129	{
2175	int
2176	i,
2177	max = SIZEOFFREE, mflags;	2130	int i, max = SIZEOFFREE, mflags;
2178		2131
2179	sint16 nx, ny;	2132	sint16 nx, ny;
2180	object *	2133	object *tmp;
2181	tmp;
2182	maptile *	2134	maptile *mp;
2183	mp;
2184		2135
2185	MoveType blocked, move_type;	2136	MoveType blocked, move_type;
2186		2137
2187	if (exclude && exclude->head)	2138	if (exclude && exclude->head_ () != exclude)
2188	{	2139	{
2189	exclude = exclude->head;	2140	exclude = exclude->head;
2190	move_type = exclude->move_type;	2141	move_type = exclude->move_type;
2191	}	2142	}
2192	else	2143	else
…		…
2205		2156
2206	if (mflags & P_OUT_OF_MAP)	2157	if (mflags & P_OUT_OF_MAP)
2207	max = maxfree[i];	2158	max = maxfree[i];
2208	else	2159	else
2209	{	2160	{
2210	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2161	mapspace &ms = mp->at (nx, ny);
		2162
		2163	blocked = ms.move_block;
2211		2164
2212	if ((move_type & blocked) == move_type)	2165	if ((move_type & blocked) == move_type)
2213	max = maxfree[i];	2166	max = maxfree[i];
2214	else if (mflags & P_IS_ALIVE)	2167	else if (mflags & P_IS_ALIVE)
2215	{	2168	{
2216	for (tmp = GET_MAP_OB (mp, nx, ny); tmp; tmp = tmp->above)	2169	for (tmp = ms.bot; tmp; tmp = tmp->above)
2217	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2170	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
		2171	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2218	break;	2172	break;
2219		2173
2220	if (tmp)	2174	if (tmp)
2221	return freedir[i];	2175	return freedir[i];
2222	}	2176	}
…		…
2228		2182
2229	/*	2183	/*
2230	* distance(object 1, object 2) will return the square of the	2184	* distance(object 1, object 2) will return the square of the
2231	* distance between the two given objects.	2185	* distance between the two given objects.
2232	*/	2186	*/
2233
2234	int	2187	int
2235	distance (const object *ob1, const object *ob2)	2188	distance (const object *ob1, const object *ob2)
2236	{	2189	{
2237	int i;
2238
2239	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);
2240	return i;
2241	}	2191	}
2242		2192
2243	/*	2193	/*
2244	* 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
2245	* 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
2246	* object, needs to travel toward it.	2196	* object, needs to travel toward it.
2247	*/	2197	*/
2248
2249	int	2198	int
2250	find_dir_2 (int x, int y)	2199	find_dir_2 (int x, int y)
2251	{	2200	{
2252	int q;	2201	int q;
2253		2202
…		…
2282		2231
2283	return 3;	2232	return 3;
2284	}	2233	}
2285		2234
2286	/*	2235	/*
2287	* absdir(int): Returns a number between 1 and 8, which represent
2288	* the "absolute" direction of a number (it actually takes care of
2289	* "overflow" in previous calculations of a direction).
2290	*/
2291
2292	int
2293	absdir (int d)
2294	{
2295	while (d < 1)
2296	d += 8;
2297	while (d > 8)
2298	d -= 8;
2299	return d;
2300	}
2301
2302	/*
2303	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2236	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2304	* between two directions (which are expected to be absolute (see absdir())	2237	* between two directions (which are expected to be absolute (see absdir())
2305	*/	2238	*/
2306
2307	int	2239	int
2308	dirdiff (int dir1, int dir2)	2240	dirdiff (int dir1, int dir2)
2309	{	2241	{
2310	int	2242	int d;
2311	d;
2312		2243
2313	d = abs (dir1 - dir2);	2244	d = abs (dir1 - dir2);
2314	if (d > 4)	2245	if (d > 4)
2315	d = 8 - d;	2246	d = 8 - d;
		2247
2316	return d;	2248	return d;
2317	}	2249	}
2318		2250
2319	/* peterm:	2251	/* peterm:
2320	* 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.
…		…
2323	* 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
2324	* 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.
2325	* 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
2326	* functions.	2258	* functions.
2327	*/	2259	*/
2328
2329	int
2330	reduction_dir[SIZEOFFREE][3] = {	2260	int reduction_dir[SIZEOFFREE][3] = {
2331	{0, 0, 0}, /* 0 */	2261	{0, 0, 0}, /* 0 */
2332	{0, 0, 0}, /* 1 */	2262	{0, 0, 0}, /* 1 */
2333	{0, 0, 0}, /* 2 */	2263	{0, 0, 0}, /* 2 */
2334	{0, 0, 0}, /* 3 */	2264	{0, 0, 0}, /* 3 */
2335	{0, 0, 0}, /* 4 */	2265	{0, 0, 0}, /* 4 */
…		…
2426	* 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
2427	* core dumps if they do.	2357	* core dumps if they do.
2428	*	2358	*
2429	* 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)
2430	*/	2360	*/
2431
2432	int	2361	int
2433	can_pick (const object *who, const object *item)	2362	can_pick (const object *who, const object *item)
2434	{	2363	{
2435	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2364	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2436	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2365	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2441	* create clone from object to another	2370	* create clone from object to another
2442	*/	2371	*/
2443	object *	2372	object *
2444	object_create_clone (object *asrc)	2373	object_create_clone (object *asrc)
2445	{	2374	{
2446	object *dst = 0, *tmp, *src, *part, *prev, *item;	2375	object *dst = 0, *tmp, *src, *prev, *item;
2447		2376
2448	if (!asrc)	2377	if (!asrc)
2449	return 0;	2378	return 0;
2450		2379
2451	src = asrc;
2452	if (src->head)
2453	src = src->head;	2380	src = asrc->head_ ();
2454		2381
2455	prev = 0;	2382	prev = 0;
2456	for (part = src; part; part = part->more)	2383	for (object *part = src; part; part = part->more)
2457	{	2384	{
2458	tmp = part->clone ();	2385	tmp = part->clone ();
2459	tmp->x -= src->x;	2386	tmp->x -= src->x;
2460	tmp->y -= src->y;	2387	tmp->y -= src->y;
2461		2388
…		…
2479	insert_ob_in_ob (object_create_clone (item), dst);	2406	insert_ob_in_ob (object_create_clone (item), dst);
2480		2407
2481	return dst;	2408	return dst;
2482	}	2409	}
2483		2410
2484	/* GROS - Creates an object using a string representing its content. */
2485	/* Basically, we save the content of the string to a temp file, then call */
2486	/* load_object on it. I admit it is a highly inefficient way to make things, */
2487	/* but it was simple to make and allows reusing the load_object function. */
2488	/* Remember not to use load_object_str in a time-critical situation. */
2489	/* Also remember that multiparts objects are not supported for now. */
2490
2491	object *
2492	load_object_str (const char *obstr)
2493	{
2494	object *op;
2495	char filename[MAX_BUF];
2496
2497	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2498
2499	FILE *tempfile = fopen (filename, "w");
2500
2501	if (tempfile == NULL)
2502	{
2503	LOG (llevError, "Error - Unable to access load object temp file\n");
2504	return NULL;
2505	}
2506
2507	fprintf (tempfile, obstr);
2508	fclose (tempfile);
2509
2510	op = object::create ();
2511
2512	object_thawer thawer (filename);
2513
2514	if (thawer)
2515	load_object (thawer, op, 0);
2516
2517	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2518	CLEAR_FLAG (op, FLAG_REMOVED);
2519
2520	return op;
2521	}
2522
2523	/* This returns the first object in who's inventory that	2411	/* This returns the first object in who's inventory that
2524	* has the same type and subtype match.	2412	* has the same type and subtype match.
2525	* returns NULL if no match.	2413	* returns NULL if no match.
2526	*/	2414	*/
2527	object *	2415	object *
2528	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)
2529	{	2417	{
2530	object *tmp;
2531
2532	for (tmp = who->inv; tmp; tmp = tmp->below)	2418	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2533	if (tmp->type == type && tmp->subtype == subtype)	2419	if (tmp->type == type && tmp->subtype == subtype)
2534	return tmp;	2420	return tmp;
2535		2421
2536	return NULL;	2422	return 0;
2537	}	2423	}
2538		2424
2539	/* 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,
2540	* otherwise return NULL.	2426	* otherwise return NULL.
2541	*	2427	*
…		…
2543	* do the desired thing.	2429	* do the desired thing.
2544	*/	2430	*/
2545	key_value *	2431	key_value *
2546	get_ob_key_link (const object *ob, const char *key)	2432	get_ob_key_link (const object *ob, const char *key)
2547	{	2433	{
2548	key_value *link;
2549
2550	for (link = ob->key_values; link != NULL; link = link->next)	2434	for (key_value *link = ob->key_values; link; link = link->next)
2551	if (link->key == key)	2435	if (link->key == key)
2552	return link;	2436	return link;
2553		2437
2554	return NULL;	2438	return 0;
2555	}	2439	}
2556		2440
2557	/*	2441	/*
2558	* 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.
2559	*	2443	*
…		…
2584	if (link->key == canonical_key)	2468	if (link->key == canonical_key)
2585	return link->value;	2469	return link->value;
2586		2470
2587	return 0;	2471	return 0;
2588	}	2472	}
2589
2590		2473
2591	/*	2474	/*
2592	* Updates the canonical_key in op to value.	2475	* Updates the canonical_key in op to value.
2593	*	2476	*
2594	* 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).
…		…
2599	* Returns TRUE on success.	2482	* Returns TRUE on success.
2600	*/	2483	*/
2601	int	2484	int
2602	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)
2603	{	2486	{
2604	key_value *
2605	field = NULL, *last = NULL;	2487	key_value *field = NULL, *last = NULL;
2606		2488
2607	for (field = op->key_values; field != NULL; field = field->next)	2489	for (field = op->key_values; field != NULL; field = field->next)
2608	{	2490	{
2609	if (field->key != canonical_key)	2491	if (field->key != canonical_key)
2610	{	2492	{
…		…
2619	/* Basically, if the archetype has this key set,	2501	/* Basically, if the archetype has this key set,
2620	* we need to store the null value so when we save	2502	* we need to store the null value so when we save
2621	* it, we save the empty value so that when we load,	2503	* it, we save the empty value so that when we load,
2622	* we get this value back again.	2504	* we get this value back again.
2623	*/	2505	*/
2624	if (get_ob_key_link (&op->arch->clone, canonical_key))	2506	if (get_ob_key_link (op->arch, canonical_key))
2625	field->value = 0;	2507	field->value = 0;
2626	else	2508	else
2627	{	2509	{
2628	if (last)	2510	if (last)
2629	last->next = field->next;	2511	last->next = field->next;
…		…
2638	/* IF we get here, key doesn't exist */	2520	/* IF we get here, key doesn't exist */
2639		2521
2640	/* No field, we'll have to add it. */	2522	/* No field, we'll have to add it. */
2641		2523
2642	if (!add_key)	2524	if (!add_key)
2643	{
2644	return FALSE;	2525	return FALSE;
2645	}	2526
2646	/* There isn't any good reason to store a null	2527	/* There isn't any good reason to store a null
2647	* value in the key/value list. If the archetype has	2528	* value in the key/value list. If the archetype has
2648	* this key, then we should also have it, so shouldn't	2529	* this key, then we should also have it, so shouldn't
2649	* be here. If user wants to store empty strings,	2530	* be here. If user wants to store empty strings,
2650	* should pass in ""	2531	* should pass in ""
…		…
2699	}	2580	}
2700	else	2581	else
2701	item = item->env;	2582	item = item->env;
2702	}	2583	}
2703		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
2704	// 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
2705	const char *	2614	const char *
2706	object::debug_desc (char *info) const	2615	object::debug_desc (char *info) const
2707	{	2616	{
		2617	char flagdesc[512];
2708	char info2[256 * 3];	2618	char info2[256 * 4];
2709	char *p = info;	2619	char *p = info;
2710		2620
2711	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}",
2712	count,	2622	count,
		2623	uuid.c_str (),
2713	&name,	2624	&name,
2714	title ? " " : "",	2625	title ? "\",title:\"" : "",
2715	title ? (const char *)title : "");	2626	title ? (const char *)title : "",
		2627	flag_desc (flagdesc, 512), type);
2716		2628
2717	if (env)	2629	if (!this->flag[FLAG_REMOVED] && env)
2718	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2630	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2719		2631
2720	if (map)	2632	if (map)
2721	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);
2722		2634
2723	return info;	2635	return info;
2724	}	2636	}
2725		2637
2726	const char *	2638	const char *
2727	object::debug_desc () const	2639	object::debug_desc () const
2728	{	2640	{
2729	static char info[256 * 3];	2641	static char info[3][256 * 4];
		2642	static int info_idx;
		2643
2730	return debug_desc (info);	2644	return debug_desc (info [++info_idx % 3]);
2731	}	2645	}
2732		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