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.23 by root, Sun Sep 10 14:54:02 2006 UTC vs.
Revision 1.342 by sf-kernelpanic, Sun Apr 10 20:30:53 2011 UTC

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

Diff Legend

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