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.141 by root, Sun Apr 29 21:44:34 2007 UTC vs.
Revision 1.248 by root, Mon Jul 14 23:47:06 2008 UTC

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

Diff Legend

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