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.110 by root, Sun Jan 7 23:12:03 2007 UTC vs.
Revision 1.244 by root, Sun May 18 17:52:53 2008 UTC

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

Diff Legend

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