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.41 by root, Thu Sep 14 01:12:28 2006 UTC vs.
Revision 1.244 by root, Sun May 18 17:52:53 2008 UTC

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

Diff Legend

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