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

Diff Legend

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