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.146 by root, Fri May 11 21:07:13 2007 UTC vs.
Revision 1.252 by root, Mon Aug 11 23:23:41 2008 UTC

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

Diff Legend

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