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.20 by root, Fri Sep 8 18:26:22 2006 UTC vs.
Revision 1.203 by root, Fri Apr 11 13:59:05 2008 UTC

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

Diff Legend

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