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

Diff Legend

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