ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.87 by root, Tue Dec 26 08:54:59 2006 UTC vs.
Revision 1.285 by root, Tue Sep 1 20:56:05 2009 UTC

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

Diff Legend

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