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

Diff Legend

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