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.32 by root, Mon Sep 11 23:53:30 2006 UTC vs.
Revision 1.323 by root, Sun Apr 11 23:56:09 2010 UTC

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

Diff Legend

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