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.87 by root, Tue Dec 26 08:54:59 2006 UTC vs.
Revision 1.305 by root, Wed Nov 11 04:45:22 2009 UTC

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

Diff Legend

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