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.184 by root, Wed Aug 22 20:46:46 2007 UTC vs.
Revision 1.247 by root, Mon Jul 14 18:36:43 2008 UTC

1	/*	1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT 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 3 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,
…		…
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, see <http://www.gnu.org/licenses/>.	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	*	20	*
21	* The authors can be reached via e-mail to <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	22	*/
23		23
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying
26	variable. */
27	#include <global.h>	24	#include <global.h>
28	#include <stdio.h>	25	#include <stdio.h>
29	#include <sys/types.h>	26	#include <sys/types.h>
30	#include <sys/uio.h>	27	#include <sys/uio.h>
31	#include <object.h>	28	#include <object.h>
32	#include <funcpoint.h>
33	#include <sproto.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. */
299	return 0;	292
300	else if (!compare_ob_value_lists (ob1, ob2))	293	if (!compare_ob_value_lists (ob1, ob2))
301	return 0;	294	return 0;
302	}	295	}
303		296
304	if (ob1->self || ob2->self)	297	if (ob1->self || ob2->self)
305	{	298	{
306	ob1->optimise ();	299	ob1->optimise ();
307	ob2->optimise ();	300	ob2->optimise ();
308		301
309	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)
		308	return 0;
		309
		310	if (k1 == 0)
		311	return 1;
		312
310	if (!cfperl_can_merge (ob1, ob2))	313	if (!cfperl_can_merge (ob1, ob2))
311	return 0;	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
		322	// find player who can see this object
		323	object *
		324	object::visible_to () const
		325	{
		326	if (client_visible () && !flag [FLAG_REMOVED])
		327	{
		328	// see if we are in a container of sorts
		329	if (env)
		330	{
		331	// the player inventory itself is always visible
		332	if (env->type == PLAYER)
		333	return env;
		334
		335	// else a player could have our env open
		336	object *envest = env->outer_env ();
		337
		338	// the player itself is always on a map, so we will find him here
		339	// even if our inv is in a player.
		340	if (envest->is_on_map ())
		341	if (object *pl = envest->ms ().player ())
		342	if (pl->container == env)
		343	return pl;
		344	}
		345	else
		346	{
		347	// maybe there is a player standing on the same mapspace
		348	// this will catch the case where "this" is a player
		349	if (object *pl = ms ().player ())
		350	if (!pl->container || this == pl->container)
		351	return pl;
		352	}
		353	}
		354
		355	return 0;
		356	}
		357
		358	// adjust weight per container type ("of holding")
		359	static sint32
		360	weight_adjust_for (object *op, sint32 weight)
		361	{
		362	return op->type == CONTAINER
		363	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		364	: weight;
		365	}
		366
318	/*	367	/*
		368	* adjust_weight(object, weight) adds the specified weight to an object,
		369	* and also updates how much the environment(s) is/are carrying.
		370	*/
		371	static void
		372	adjust_weight (object *op, sint32 weight)
		373	{
		374	while (op)
		375	{
		376	// adjust by actual difference to account for rounding errors
		377	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
		378	weight = weight_adjust_for (op, op->carrying)
		379	- weight_adjust_for (op, op->carrying - weight);
		380
		381	if (!weight)
		382	return;
		383
		384	op->carrying += weight;
		385
		386	if (object *pl = op->visible_to ())
		387	if (pl != op) // player is handled lazily
		388	esrv_update_item (UPD_WEIGHT, pl, op);
		389
		390	op = op->env;
		391	}
		392	}
		393
		394	/*
319	* sum_weight() is a recursive function which calculates the weight	395	* this is a recursive function which calculates the weight
320	* an object is carrying. It goes through in figures out how much	396	* an object is carrying. It goes through op and figures out how much
321	* containers are carrying, and sums it up.	397	* containers are carrying, and sums it up.
322	*/	398	*/
323	long	399	void
324	sum_weight (object *op)	400	object::update_weight ()
325	{	401	{
326	long sum;	402	sint32 sum = 0;
327	object *inv;
328		403
329	for (sum = 0, inv = op->inv; inv; inv = inv->below)	404	for (object *op = inv; op; op = op->below)
330	{	405	{
331	if (inv->inv)	406	if (op->inv)
332	sum_weight (inv);	407	op->update_weight ();
333		408
334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	409	sum += op->total_weight ();
		410	}
		411
		412	sum = weight_adjust_for (this, sum);
		413
		414	if (sum != carrying)
335	}	415	{
336
337	if (op->type == CONTAINER && op->stats.Str)
338	sum = (sum * (100 - op->stats.Str)) / 100;
339
340	if (op->carrying != sum)
341	op->carrying = sum;	416	carrying = sum;
342		417
343	return sum;	418	if (object *pl = visible_to ())
		419	if (pl != this) // player is handled lazily
		420	esrv_update_item (UPD_WEIGHT, pl, this);
		421	}
344	}	422	}
345		423
346	/**	424	/*
347	* Return the outermost environment object for a given object.	425	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
348	*/
349
350	object *
351	object_get_env_recursive (object *op)
352	{
353	while (op->env != NULL)
354	op = op->env;
355	return op;
356	}
357
358	/*
359	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
360	* Some error messages.
361	* The result of the dump is stored in the static global errmsg array.
362	*/	426	*/
363	char *	427	char *
364	dump_object (object *op)	428	dump_object (object *op)
365	{	429	{
366	if (!op)	430	if (!op)
…		…
380	get_nearest_part (object *op, const object *pl)	444	get_nearest_part (object *op, const object *pl)
381	{	445	{
382	object *tmp, *closest;	446	object *tmp, *closest;
383	int last_dist, i;	447	int last_dist, i;
384		448
385	if (op->more == NULL)	449	if (!op->more)
386	return op;	450	return op;
		451
387	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	452	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		453	tmp;
		454	tmp = tmp->more)
388	if ((i = distance (tmp, pl)) < last_dist)	455	if ((i = distance (tmp, pl)) < last_dist)
389	closest = tmp, last_dist = i;	456	closest = tmp, last_dist = i;
		457
390	return closest;	458	return closest;
391	}	459	}
392		460
393	/*	461	/*
394	* Returns the object which has the count-variable equal to the argument.	462	* Returns the object which has the count-variable equal to the argument.
		463	* VERRRY slow.
395	*/	464	*/
396	object *	465	object *
397	find_object (tag_t i)	466	find_object (tag_t i)
398	{	467	{
399	for_all_objects (op)	468	for_all_objects (op)
…		…
410	*/	479	*/
411	object *	480	object *
412	find_object_name (const char *str)	481	find_object_name (const char *str)
413	{	482	{
414	shstr_cmp str_ (str);	483	shstr_cmp str_ (str);
415	object *op;
416		484
		485	if (str_)
417	for_all_objects (op)	486	for_all_objects (op)
418	if (op->name == str_)	487	if (op->name == str_)
419	break;	488	return op;
420		489
421	return op;	490	return 0;
422	}
423
424	void
425	free_all_object_data ()
426	{
427	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
428	}	491	}
429		492
430	/*	493	/*
431	* Sets the owner and sets the skill and exp pointers to owner's current	494	* Sets the owner and sets the skill and exp pointers to owner's current
432	* skill and experience objects.	495	* skill and experience objects.
…		…
437	{	500	{
438	// allow objects which own objects	501	// allow objects which own objects
439	if (owner)	502	if (owner)
440	while (owner->owner)	503	while (owner->owner)
441	owner = owner->owner;	504	owner = owner->owner;
		505
		506	if (flag [FLAG_FREED])
		507	{
		508	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		509	return;
		510	}
442		511
443	this->owner = owner;	512	this->owner = owner;
444	}	513	}
445		514
446	int	515	int
…		…
524	}	593	}
525		594
526	op->key_values = 0;	595	op->key_values = 0;
527	}	596	}
528		597
529	object &	598	/*
530	object::operator =(const object &src)	599	* copy_to first frees everything allocated by the dst object,
		600	* and then copies the contents of itself into the second
		601	* object, allocating what needs to be allocated. Basically, any
		602	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		603	* if the first object is freed, the pointers in the new object
		604	* will point at garbage.
		605	*/
		606	void
		607	object::copy_to (object *dst)
531	{	608	{
532	bool is_freed = flag [FLAG_FREED];	609	dst->remove ();
533	bool is_removed = flag [FLAG_REMOVED];
534
535	*(object_copy *)this = src;	610	*(object_copy *)dst = *this;
536
537	flag [FLAG_FREED] = is_freed;
538	flag [FLAG_REMOVED] = is_removed;	611	dst->flag [FLAG_REMOVED] = true;
539		612
540	/* Copy over key_values, if any. */	613	/* Copy over key_values, if any. */
541	if (src.key_values)	614	if (key_values)
542	{	615	{
543	key_value *tail = 0;	616	key_value *tail = 0;
544	key_values = 0;	617	dst->key_values = 0;
545		618
546	for (key_value *i = src.key_values; i; i = i->next)	619	for (key_value *i = key_values; i; i = i->next)
547	{	620	{
548	key_value *new_link = new key_value;	621	key_value *new_link = new key_value;
549		622
550	new_link->next = 0;	623	new_link->next = 0;
551	new_link->key = i->key;	624	new_link->key = i->key;
552	new_link->value = i->value;	625	new_link->value = i->value;
553		626
554	/* Try and be clever here, too. */	627	/* Try and be clever here, too. */
555	if (!key_values)	628	if (!dst->key_values)
556	{	629	{
557	key_values = new_link;	630	dst->key_values = new_link;
558	tail = new_link;	631	tail = new_link;
559	}	632	}
560	else	633	else
561	{	634	{
562	tail->next = new_link;	635	tail->next = new_link;
563	tail = new_link;	636	tail = new_link;
564	}	637	}
565	}	638	}
566	}	639	}
567	}
568
569	/*
570	* copy_to first frees everything allocated by the dst object,
571	* and then copies the contents of itself into the second
572	* object, allocating what needs to be allocated. Basically, any
573	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
574	* if the first object is freed, the pointers in the new object
575	* will point at garbage.
576	*/
577	void
578	object::copy_to (object *dst)
579	{
580	*dst = *this;
581		640
582	if (speed < 0)	641	if (speed < 0)
583	dst->speed_left = speed_left - rndm ();	642	dst->speed_left -= rndm ();
584		643
585	dst->set_speed (dst->speed);	644	dst->set_speed (dst->speed);
586	}	645	}
587		646
588	void	647	void
589	object::instantiate ()	648	object::instantiate ()
590	{	649	{
591	if (!uuid.seq) // HACK	650	if (!uuid.seq) // HACK
592	uuid = gen_uuid ();	651	uuid = UUID::gen ();
593		652
594	speed_left = -0.1f;	653	speed_left = -0.1f;
595	/* copy the body_info to the body_used - this is only really	654	/* copy the body_info to the body_used - this is only really
596	* need for monsters, but doesn't hurt to do it for everything.	655	* need for monsters, but doesn't hurt to do it for everything.
597	* by doing so, when a monster is created, it has good starting	656	* by doing so, when a monster is created, it has good starting
…		…
607	object *	666	object *
608	object::clone ()	667	object::clone ()
609	{	668	{
610	object *neu = create ();	669	object *neu = create ();
611	copy_to (neu);	670	copy_to (neu);
		671	neu->map = map; // not copied by copy_to
612	return neu;	672	return neu;
613	}	673	}
614		674
615	/*	675	/*
616	* If an object with the IS_TURNABLE() flag needs to be turned due	676	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
667	* UP_OBJ_FACE: only the objects face has changed.	727	* UP_OBJ_FACE: only the objects face has changed.
668	*/	728	*/
669	void	729	void
670	update_object (object *op, int action)	730	update_object (object *op, int action)
671	{	731	{
672	if (op == NULL)	732	if (!op)
673	{	733	{
674	/* this should never happen */	734	/* this should never happen */
675	LOG (llevDebug, "update_object() called for NULL object.\n");	735	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
676	return;	736	return;
677	}	737	}
678		738
679	if (op->env)	739	if (!op->is_on_map ())
680	{	740	{
681	/* Animation is currently handled by client, so nothing	741	/* Animation is currently handled by client, so nothing
682	* to do in this case.	742	* to do in this case.
683	*/	743	*/
684	return;	744	return;
685	}	745	}
686
687	/* If the map is saving, don't do anything as everything is
688	* going to get freed anyways.
689	*/
690	if (!op->map || op->map->in_memory == MAP_SAVING)
691	return;
692		746
693	/* make sure the object is within map boundaries */	747	/* make sure the object is within map boundaries */
694	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	748	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
695	{	749	{
696	LOG (llevError, "update_object() called for object out of map!\n");	750	LOG (llevError, "update_object() called for object out of map!\n");
…		…
756	static int object_count;	810	static int object_count;
757		811
758	void object::link ()	812	void object::link ()
759	{	813	{
760	assert (!index);//D	814	assert (!index);//D
761	uuid = gen_uuid ();	815	uuid = UUID::gen ();
762	count = ++object_count;	816	count = ++object_count;
763		817
764	refcnt_inc ();	818	refcnt_inc ();
765	objects.insert (this);	819	objects.insert (this);
766	}	820	}
…		…
839	object::destroy_inv (bool drop_to_ground)	893	object::destroy_inv (bool drop_to_ground)
840	{	894	{
841	// need to check first, because the checks below might segfault	895	// need to check first, because the checks below might segfault
842	// as we might be on an invalid mapspace and crossfire code	896	// as we might be on an invalid mapspace and crossfire code
843	// is too buggy to ensure that the inventory is empty.	897	// is too buggy to ensure that the inventory is empty.
844	// corollary: if you create arrows etc. with stuff in tis inventory,	898	// corollary: if you create arrows etc. with stuff in its inventory,
845	// cf will crash below with off-map x and y	899	// cf will crash below with off-map x and y
846	if (!inv)	900	if (!inv)
847	return;	901	return;
848		902
849	/* Only if the space blocks everything do we not process -	903	/* Only if the space blocks everything do we not process -
850	* if some form of movement is allowed, let objects	904	* if some form of movement is allowed, let objects
851	* drop on that space.	905	* drop on that space.
852	*/	906	*/
853	if (!drop_to_ground	907	if (!drop_to_ground
854	|| !map	908	|| !map
855	|| map->in_memory != MAP_IN_MEMORY	909	|| map->in_memory != MAP_ACTIVE
856	|| map->nodrop	910	|| map->no_drop
857	|| ms ().move_block == MOVE_ALL)	911	|| ms ().move_block == MOVE_ALL)
858	{	912	{
859	while (inv)	913	while (inv)
860	{	914	{
861	inv->destroy_inv (drop_to_ground);	915	inv->destroy_inv (false);
862	inv->destroy ();	916	inv->destroy ();
863	}	917	}
864	}	918	}
865	else	919	else
866	{ /* Put objects in inventory onto this space */	920	{ /* Put objects in inventory onto this space */
…		…
872	|| op->flag [FLAG_NO_DROP]	926	|| op->flag [FLAG_NO_DROP]
873	|| op->type == RUNE	927	|| op->type == RUNE
874	|| op->type == TRAP	928	|| op->type == TRAP
875	|| op->flag [FLAG_IS_A_TEMPLATE]	929	|| op->flag [FLAG_IS_A_TEMPLATE]
876	|| op->flag [FLAG_DESTROY_ON_DEATH])	930	|| op->flag [FLAG_DESTROY_ON_DEATH])
877	op->destroy ();	931	op->destroy (true);
878	else	932	else
879	map->insert (op, x, y);	933	map->insert (op, x, y);
880	}	934	}
881	}	935	}
882	}	936	}
…		…
886	object *op = new object;	940	object *op = new object;
887	op->link ();	941	op->link ();
888	return op;	942	return op;
889	}	943	}
890		944
		945	static struct freed_map : maptile
		946	{
		947	freed_map ()
		948	{
		949	path = "<freed objects map>";
		950	name = "/internal/freed_objects_map";
		951	width = 3;
		952	height = 3;
		953	no_drop = 1;
		954	no_reset = 1;
		955
		956	alloc ();
		957	in_memory = MAP_ACTIVE;
		958	}
		959
		960	~freed_map ()
		961	{
		962	destroy ();
		963	}
		964	} freed_map; // freed objects are moved here to avoid crashes
		965
891	void	966	void
892	object::do_destroy ()	967	object::do_destroy ()
893	{	968	{
894	attachable::do_destroy ();
895
896	if (flag [FLAG_IS_LINKED])	969	if (flag [FLAG_IS_LINKED])
897	remove_button_link (this);	970	remove_button_link (this);
898		971
899	if (flag [FLAG_FRIENDLY])	972	if (flag [FLAG_FRIENDLY])
900	remove_friendly_object (this);	973	remove_friendly_object (this);
901		974
902	if (!flag [FLAG_REMOVED])
903	remove ();	975	remove ();
904		976
905	destroy_inv (true);	977	attachable::do_destroy ();
906		978
907	deactivate ();	979	deactivate ();
908	unlink ();	980	unlink ();
909		981
910	flag [FLAG_FREED] = 1;	982	flag [FLAG_FREED] = 1;
911		983
912	// hack to ensure that freed objects still have a valid map	984	// hack to ensure that freed objects still have a valid map
913	{
914	static maptile *freed_map; // freed objects are moved here to avoid crashes
915
916	if (!freed_map)
917	{
918	freed_map = new maptile;
919
920	freed_map->name = "/internal/freed_objects_map";
921	freed_map->width = 3;
922	freed_map->height = 3;
923
924	freed_map->alloc ();
925	freed_map->in_memory = MAP_IN_MEMORY;
926	}
927
928	map = freed_map;	985	map = &freed_map;
929	x = 1;	986	x = 1;
930	y = 1;	987	y = 1;
931	}
932		988
933	if (more)	989	if (more)
934	{	990	{
935	more->destroy ();	991	more->destroy ();
936	more = 0;	992	more = 0;
…		…
949	object::destroy (bool destroy_inventory)	1005	object::destroy (bool destroy_inventory)
950	{	1006	{
951	if (destroyed ())	1007	if (destroyed ())
952	return;	1008	return;
953		1009
		1010	if (!is_head () && !head->destroyed ())
		1011	{
		1012	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1013	head->destroy (destroy_inventory);
		1014	return;
		1015	}
		1016
954	if (destroy_inventory)	1017	destroy_inv (!destroy_inventory);
955	destroy_inv (false);
956		1018
957	if (is_head ())	1019	if (is_head ())
958	if (sound_destroy)	1020	if (sound_destroy)
959	play_sound (sound_destroy);	1021	play_sound (sound_destroy);
960	else if (flag [FLAG_MONSTER])	1022	else if (flag [FLAG_MONSTER])
961	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism	1023	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
962		1024
963	attachable::destroy ();	1025	attachable::destroy ();
964	}
965
966	/*
967	* sub_weight() recursively (outwards) subtracts a number from the
968	* weight of an object (and what is carried by it's environment(s)).
969	*/
970	void
971	sub_weight (object *op, signed long weight)
972	{
973	while (op != NULL)
974	{
975	if (op->type == CONTAINER)
976	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
977
978	op->carrying -= weight;
979	op = op->env;
980	}
981	}	1026	}
982		1027
983	/* op->remove ():	1028	/* op->remove ():
984	* This function removes the object op from the linked list of objects	1029	* This function removes the object op from the linked list of objects
985	* which it is currently tied to. When this function is done, the	1030	* which it is currently tied to. When this function is done, the
…		…
991	object::do_remove ()	1036	object::do_remove ()
992	{	1037	{
993	object *tmp, *last = 0;	1038	object *tmp, *last = 0;
994	object *otmp;	1039	object *otmp;
995		1040
996	if (QUERY_FLAG (this, FLAG_REMOVED))	1041	if (flag [FLAG_REMOVED])
997	return;	1042	return;
998		1043
999	SET_FLAG (this, FLAG_REMOVED);
1000	INVOKE_OBJECT (REMOVE, this);	1044	INVOKE_OBJECT (REMOVE, this);
		1045
		1046	flag [FLAG_REMOVED] = true;
1001		1047
1002	if (more)	1048	if (more)
1003	more->remove ();	1049	more->remove ();
1004		1050
1005	/*	1051	/*
1006	* In this case, the object to be removed is in someones	1052	* In this case, the object to be removed is in someones
1007	* inventory.	1053	* inventory.
1008	*/	1054	*/
1009	if (env)	1055	if (env)
1010	{	1056	{
1011	if (nrof)	1057	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
1012	sub_weight (env, weight * nrof);	1058	if (object *pl = visible_to ())
1013	else	1059	esrv_del_item (pl->contr, count);
1014	sub_weight (env, weight + carrying);	1060	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1061
		1062	adjust_weight (env, -total_weight ());
		1063
		1064	/* we set up values so that it could be inserted into
		1065	* the map, but we don't actually do that - it is up
		1066	* to the caller to decide what we want to do.
		1067	*/
		1068	map = env->map;
		1069	x = env->x;
		1070	y = env->y;
		1071
		1072	// make sure cmov optimisation is applicable
		1073	*(above ? &above->below : &env->inv) = below;
		1074	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1075
		1076	above = 0;
		1077	below = 0;
		1078	env = 0;
1015		1079
1016	/* NO_FIX_PLAYER is set when a great many changes are being	1080	/* NO_FIX_PLAYER is set when a great many changes are being
1017	* made to players inventory. If set, avoiding the call	1081	* made to players inventory. If set, avoiding the call
1018	* to save cpu time.	1082	* to save cpu time.
1019	*/	1083	*/
1020	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1084	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1021	otmp->update_stats ();	1085	otmp->update_stats ();
1022
1023	if (above)
1024	above->below = below;
1025	else
1026	env->inv = below;
1027
1028	if (below)
1029	below->above = above;
1030
1031	/* we set up values so that it could be inserted into
1032	* the map, but we don't actually do that - it is up
1033	* to the caller to decide what we want to do.
1034	*/
1035	x = env->x, y = env->y;
1036	map = env->map;
1037	above = 0, below = 0;
1038	env = 0;
1039	}	1086	}
1040	else if (map)	1087	else if (map)
1041	{	1088	{
1042	if (type == PLAYER)
1043	{
1044	// leaving a spot always closes any open container on the ground
1045	if (container && !container->env)
1046	// this causes spurious floorbox updates, but it ensures
1047	// that the CLOSE event is being sent.
1048	close_container ();
1049
1050	--map->players;
1051	map->touch ();
1052	}
1053
1054	map->dirty = true;	1089	map->dirty = true;
1055	mapspace &ms = this->ms ();	1090	mapspace &ms = this->ms ();
1056		1091
		1092	if (object *pl = ms.player ())
		1093	{
		1094	if (type == PLAYER) // this == pl(!)
		1095	{
		1096	// leaving a spot always closes any open container on the ground
		1097	if (container && !container->env)
		1098	// this causes spurious floorbox updates, but it ensures
		1099	// that the CLOSE event is being sent.
		1100	close_container ();
		1101
		1102	--map->players;
		1103	map->touch ();
		1104	}
		1105	else if (pl->container == this)
		1106	{
		1107	// removing a container should close it
		1108	close_container ();
		1109	}
		1110
		1111	esrv_del_item (pl->contr, count);
		1112	}
		1113
1057	/* link the object above us */	1114	/* link the object above us */
1058	if (above)	1115	// re-link, make sure compiler can easily use cmove
1059	above->below = below;	1116	*(above ? &above->below : &ms.top) = below;
1060	else	1117	*(below ? &below->above : &ms.bot) = above;
1061	ms.top = below; /* we were top, set new top */
1062
1063	/* Relink the object below us, if there is one */
1064	if (below)
1065	below->above = above;
1066	else
1067	{
1068	/* Nothing below, which means we need to relink map object for this space
1069	* use translated coordinates in case some oddness with map tiling is
1070	* evident
1071	*/
1072	if (GET_MAP_OB (map, x, y) != this)
1073	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 ());
1074
1075	ms.bot = above; /* goes on above it. */
1076	}
1077		1118
1078	above = 0;	1119	above = 0;
1079	below = 0;	1120	below = 0;
1080		1121
1081	if (map->in_memory == MAP_SAVING)	1122	if (map->in_memory == MAP_SAVING)
…		…
1090	* removed (most likely destroyed), update the player view	1131	* removed (most likely destroyed), update the player view
1091	* appropriately.	1132	* appropriately.
1092	*/	1133	*/
1093	pl->close_container ();	1134	pl->close_container ();
1094		1135
		1136	//TODO: the floorbox prev/next might need updating
		1137	//esrv_del_item (pl->contr, count);
		1138	//TODO: update floorbox to preserve ordering
		1139	if (pl->contr->ns)
1095	pl->contr->ns->floorbox_update ();	1140	pl->contr->ns->floorbox_update ();
1096	}	1141	}
1097		1142
1098	for (tmp = ms.bot; tmp; tmp = tmp->above)	1143	for (tmp = ms.bot; tmp; tmp = tmp->above)
1099	{	1144	{
1100	/* No point updating the players look faces if he is the object	1145	/* No point updating the players look faces if he is the object
…		…
1139	merge_ob (object *op, object *top)	1184	merge_ob (object *op, object *top)
1140	{	1185	{
1141	if (!op->nrof)	1186	if (!op->nrof)
1142	return 0;	1187	return 0;
1143		1188
1144	if (top)	1189	if (!top)
1145	for (top = op; top && top->above; top = top->above)	1190	for (top = op; top && top->above; top = top->above)
1146	;	1191	;
1147		1192
1148	for (; top; top = top->below)	1193	for (; top; top = top->below)
1149	{
1150	if (top == op)
1151	continue;
1152
1153	if (object::can_merge (op, top))	1194	if (object::can_merge (op, top))
1154	{	1195	{
1155	top->nrof += op->nrof;	1196	top->nrof += op->nrof;
1156		1197
1157	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1198	if (object *pl = top->visible_to ())
1158	op->weight = 0; /* Don't want any adjustements now */	1199	esrv_update_item (UPD_NROF, pl, top);
		1200
		1201	op->weight = 0; // cancel the addition above
		1202	op->carrying = 0; // must be 0 already
		1203
1159	op->destroy ();	1204	op->destroy (1);
		1205
1160	return top;	1206	return top;
1161	}	1207	}
1162	}
1163		1208
1164	return 0;	1209	return 0;
1165	}	1210	}
1166		1211
1167	void	1212	void
…		…
1192	* job preparing multi-part monsters.	1237	* job preparing multi-part monsters.
1193	*/	1238	*/
1194	object *	1239	object *
1195	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1240	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1196	{	1241	{
		1242	op->remove ();
		1243
1197	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1244	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1198	{	1245	{
1199	tmp->x = x + tmp->arch->x;	1246	tmp->x = x + tmp->arch->x;
1200	tmp->y = y + tmp->arch->y;	1247	tmp->y = y + tmp->arch->y;
1201	}	1248	}
…		…
1224	* just 'op' otherwise	1271	* just 'op' otherwise
1225	*/	1272	*/
1226	object *	1273	object *
1227	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1274	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1228	{	1275	{
1229	assert (!op->flag [FLAG_FREED]);	1276	if (op->is_on_map ())
1230
1231	object *top, *floor = NULL;
1232
1233	op->remove ();
1234
1235	if (out_of_map (m, op->x, op->y))
1236	{	1277	{
1237	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());	1278	LOG (llevError, "insert_ob_in_map called for object already on map");
1238	#ifdef MANY_CORES
1239	/* Better to catch this here, as otherwise the next use of this object
1240	* is likely to cause a crash. Better to find out where it is getting
1241	* improperly inserted.
1242	*/
1243	abort ();	1279	abort ();
1244	#endif	1280	}
1245	return op;	1281
		1282	if (op->env)
1246	}	1283	{
		1284	LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
		1285	op->remove ();
		1286	}
1247		1287
1248	if (object *more = op->more)	1288	if (op->face && !face_info (op->face))//D TODO: remove soon
1249	if (!insert_ob_in_map (more, m, originator, flag))	1289	{//D
1250	return 0;	1290	LOG (llevError | logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D
1251		1291	op->face = 1;//D
1252	CLEAR_FLAG (op, FLAG_REMOVED);	1292	}//D
1253		1293
1254	/* Ideally, the caller figures this out. However, it complicates a lot	1294	/* Ideally, the caller figures this out. However, it complicates a lot
1255	* of areas of callers (eg, anything that uses find_free_spot would now	1295	* of areas of callers (eg, anything that uses find_free_spot would now
1256	* need extra work	1296	* need extra work
1257	*/	1297	*/
1258	if (!xy_normalise (m, op->x, op->y))	1298	if (!xy_normalise (m, op->x, op->y))
		1299	{
		1300	op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1259	return 0;	1301	return 0;
		1302	}
		1303
		1304	if (object *more = op->more)
		1305	if (!insert_ob_in_map (more, m, originator, flag))
		1306	return 0;
		1307
		1308	CLEAR_FLAG (op, FLAG_REMOVED);
1260		1309
1261	op->map = m;	1310	op->map = m;
1262	mapspace &ms = op->ms ();	1311	mapspace &ms = op->ms ();
1263		1312
1264	/* this has to be done after we translate the coordinates.	1313	/* this has to be done after we translate the coordinates.
1265	*/	1314	*/
1266	if (op->nrof && !(flag & INS_NO_MERGE))	1315	if (op->nrof && !(flag & INS_NO_MERGE))
1267	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1316	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1268	if (object::can_merge (op, tmp))	1317	if (object::can_merge (op, tmp))
1269	{	1318	{
		1319	// TODO: we actually want to update tmp, not op,
		1320	// but some caller surely breaks when we return tmp
		1321	// from here :/
1270	op->nrof += tmp->nrof;	1322	op->nrof += tmp->nrof;
1271	tmp->destroy ();	1323	tmp->destroy (1);
1272	}	1324	}
1273		1325
1274	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1326	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1275	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1327	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1276		1328
…		…
1283	{	1335	{
1284	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1336	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1285	abort ();	1337	abort ();
1286	}	1338	}
1287		1339
		1340	if (!originator->is_on_map ())
		1341	LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1342	op->debug_desc (), originator->debug_desc ());
		1343
1288	op->above = originator;	1344	op->above = originator;
1289	op->below = originator->below;	1345	op->below = originator->below;
1290
1291	if (op->below)
1292	op->below->above = op;
1293	else
1294	ms.bot = op;
1295
1296	/* since *below* originator, no need to update top */
1297	originator->below = op;	1346	originator->below = op;
		1347
		1348	*(op->below ? &op->below->above : &ms.bot) = op;
1298	}	1349	}
1299	else	1350	else
1300	{	1351	{
1301	top = ms.bot;	1352	object *floor = 0;
		1353	object *top = ms.top;
1302		1354
1303	/* If there are other objects, then */	1355	/* If there are other objects, then */
1304	if ((!(flag & INS_MAP_LOAD)) && top)	1356	if (top)
1305	{	1357	{
1306	object *last = 0;
1307
1308	/*	1358	/*
1309	* If there are multiple objects on this space, we do some trickier handling.	1359	* If there are multiple objects on this space, we do some trickier handling.
1310	* We've already dealt with merging if appropriate.	1360	* We've already dealt with merging if appropriate.
1311	* Generally, we want to put the new object on top. But if	1361	* Generally, we want to put the new object on top. But if
1312	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1362	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1315	* once we get to them. This reduces the need to traverse over all of	1365	* once we get to them. This reduces the need to traverse over all of
1316	* them when adding another one - this saves quite a bit of cpu time	1366	* them when adding another one - this saves quite a bit of cpu time
1317	* when lots of spells are cast in one area. Currently, it is presumed	1367	* when lots of spells are cast in one area. Currently, it is presumed
1318	* that flying non pickable objects are spell objects.	1368	* that flying non pickable objects are spell objects.
1319	*/	1369	*/
1320	for (top = ms.bot; top; top = top->above)	1370	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1321	{	1371	{
1322	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1372	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1323	floor = top;	1373	floor = tmp;
1324		1374
1325	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1375	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1326	{	1376	{
1327	/* We insert above top, so we want this object below this */	1377	/* We insert above top, so we want this object below this */
1328	top = top->below;	1378	top = tmp->below;
1329	break;	1379	break;
1330	}	1380	}
1331		1381
1332	last = top;	1382	top = tmp;
1333	}	1383	}
1334
1335	/* Don't want top to be NULL, so set it to the last valid object */
1336	top = last;
1337		1384
1338	/* We let update_position deal with figuring out what the space	1385	/* We let update_position deal with figuring out what the space
1339	* looks like instead of lots of conditions here.	1386	* looks like instead of lots of conditions here.
1340	* makes things faster, and effectively the same result.	1387	* makes things faster, and effectively the same result.
1341	*/	1388	*/
…		…
1348	*/	1395	*/
1349	if (!(flag & INS_ON_TOP)	1396	if (!(flag & INS_ON_TOP)
1350	&& ms.flags () & P_BLOCKSVIEW	1397	&& ms.flags () & P_BLOCKSVIEW
1351	&& (op->face && !faces [op->face].visibility))	1398	&& (op->face && !faces [op->face].visibility))
1352	{	1399	{
		1400	object *last;
		1401
1353	for (last = top; last != floor; last = last->below)	1402	for (last = top; last != floor; last = last->below)
1354	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1403	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1355	break;	1404	break;
1356		1405
1357	/* Check to see if we found the object that blocks view,	1406	/* Check to see if we found the object that blocks view,
…		…
1361	*/	1410	*/
1362	if (last && last->below && last != floor)	1411	if (last && last->below && last != floor)
1363	top = last->below;	1412	top = last->below;
1364	}	1413	}
1365	} /* If objects on this space */	1414	} /* If objects on this space */
1366	if (flag & INS_MAP_LOAD)
1367	top = ms.top;
1368		1415
1369	if (flag & INS_ABOVE_FLOOR_ONLY)	1416	if (flag & INS_ABOVE_FLOOR_ONLY)
1370	top = floor;	1417	top = floor;
1371		1418
1372	/* Top is the object that our object (op) is going to get inserted above.	1419	// insert object above top, or bottom-most if top = 0
1373	*/
1374
1375	/* First object on this space */
1376	if (!top)	1420	if (!top)
1377	{	1421	{
		1422	op->below = 0;
1378	op->above = ms.bot;	1423	op->above = ms.bot;
1379
1380	if (op->above)
1381	op->above->below = op;
1382
1383	op->below = 0;
1384	ms.bot = op;	1424	ms.bot = op;
		1425
		1426	*(op->above ? &op->above->below : &ms.top) = op;
1385	}	1427	}
1386	else	1428	else
1387	{ /* get inserted into the stack above top */	1429	{
1388	op->above = top->above;	1430	op->above = top->above;
1389
1390	if (op->above)
1391	op->above->below = op;	1431	top->above = op;
1392		1432
1393	op->below = top;	1433	op->below = top;
1394	top->above = op;	1434	*(op->above ? &op->above->below : &ms.top) = op;
1395	}	1435	}
1396		1436	}
1397	if (!op->above)
1398	ms.top = op;
1399	} /* else not INS_BELOW_ORIGINATOR */
1400		1437
1401	if (op->type == PLAYER)	1438	if (op->type == PLAYER)
1402	{	1439	{
1403	op->contr->do_los = 1;	1440	op->contr->do_los = 1;
1404	++op->map->players;	1441	++op->map->players;
1405	op->map->touch ();	1442	op->map->touch ();
1406	}	1443	}
1407		1444
1408	op->map->dirty = true;	1445	op->map->dirty = true;
1409		1446
1410	if (!(flag & INS_MAP_LOAD))
1411	if (object *pl = ms.player ())	1447	if (object *pl = ms.player ())
		1448	//TODO: the floorbox prev/next might need updating
		1449	//esrv_send_item (pl, op);
		1450	//TODO: update floorbox to preserve ordering
		1451	if (pl->contr->ns)
1412	pl->contr->ns->floorbox_update ();	1452	pl->contr->ns->floorbox_update ();
1413		1453
1414	/* If this object glows, it may affect lighting conditions that are	1454	/* If this object glows, it may affect lighting conditions that are
1415	* visible to others on this map. But update_all_los is really	1455	* visible to others on this map. But update_all_los is really
1416	* an inefficient way to do this, as it means los for all players	1456	* an inefficient way to do this, as it means los for all players
…		…
1459	* op is the object to insert it under: supplies x and the map.	1499	* op is the object to insert it under: supplies x and the map.
1460	*/	1500	*/
1461	void	1501	void
1462	replace_insert_ob_in_map (const char *arch_string, object *op)	1502	replace_insert_ob_in_map (const char *arch_string, object *op)
1463	{	1503	{
1464	object *tmp, *tmp1;
1465
1466	/* first search for itself and remove any old instances */	1504	/* first search for itself and remove any old instances */
1467		1505
1468	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1506	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1469	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1507	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1470	tmp->destroy ();	1508	tmp->destroy (1);
1471		1509
1472	tmp1 = arch_to_object (archetype::find (arch_string));	1510	object *tmp = arch_to_object (archetype::find (arch_string));
1473		1511
1474	tmp1->x = op->x;	1512	tmp->x = op->x;
1475	tmp1->y = op->y;	1513	tmp->y = op->y;
		1514
1476	insert_ob_in_map (tmp1, op->map, op, 0);	1515	insert_ob_in_map (tmp, op->map, op, 0);
1477	}	1516	}
1478		1517
1479	object *	1518	object *
1480	object::insert_at (object *where, object *originator, int flags)	1519	object::insert_at (object *where, object *originator, int flags)
1481	{	1520	{
		1521	if (where->env)
		1522	return where->env->insert (this);
		1523	else
1482	return where->map->insert (this, where->x, where->y, originator, flags);	1524	return where->map->insert (this, where->x, where->y, originator, flags);
1483	}	1525	}
1484		1526
1485	/*	1527	/*
1486	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1487	* is returned contains nr objects, and the remaining parts contains
1488	* the rest (or is removed and freed if that number is 0).
1489	* On failure, NULL is returned, and the reason put into the
1490	* global static errmsg array.
1491	*/
1492	object *
1493	get_split_ob (object *orig_ob, uint32 nr)
1494	{
1495	object *newob;
1496	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1497
1498	if (orig_ob->nrof < nr)
1499	{
1500	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1501	return NULL;
1502	}
1503
1504	newob = object_create_clone (orig_ob);
1505
1506	if ((orig_ob->nrof -= nr) < 1)
1507	orig_ob->destroy (1);
1508	else if (!is_removed)
1509	{
1510	if (orig_ob->env != NULL)
1511	sub_weight (orig_ob->env, orig_ob->weight * nr);
1512	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1513	{
1514	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1515	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1516	return NULL;
1517	}
1518	}
1519
1520	newob->nrof = nr;
1521
1522	return newob;
1523	}
1524
1525	/*
1526	* decrease_ob_nr(object, number) decreases a specified number from	1528	* decrease(object, number) decreases a specified number from
1527	* the amount of an object. If the amount reaches 0, the object	1529	* the amount of an object. If the amount reaches 0, the object
1528	* is subsequently removed and freed.	1530	* is subsequently removed and freed.
1529	*	1531	*
1530	* Return value: 'op' if something is left, NULL if the amount reached 0	1532	* Return value: 'op' if something is left, NULL if the amount reached 0
1531	*/	1533	*/
		1534	bool
		1535	object::decrease (sint32 nr)
		1536	{
		1537	if (!nr)
		1538	return true;
		1539
		1540	nr = min (nr, nrof);
		1541
		1542	nrof -= nr;
		1543
		1544	if (nrof)
		1545	{
		1546	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
		1547
		1548	if (object *pl = visible_to ())
		1549	esrv_update_item (UPD_NROF, pl, this);
		1550
		1551	return true;
		1552	}
		1553	else
		1554	{
		1555	destroy (1);
		1556	return false;
		1557	}
		1558	}
		1559
		1560	/*
		1561	* split(ob,nr) splits up ob into two parts. The part which
		1562	* is returned contains nr objects, and the remaining parts contains
		1563	* the rest (or is removed and returned if that number is 0).
		1564	* On failure, NULL is returned.
		1565	*/
1532	object *	1566	object *
1533	decrease_ob_nr (object *op, uint32 i)	1567	object::split (sint32 nr)
1534	{	1568	{
1535	object *tmp;	1569	int have = number_of ();
1536		1570
1537	if (i == 0) /* objects with op->nrof require this check */	1571	if (have < nr)
1538	return op;	1572	return 0;
1539		1573	else if (have == nr)
1540	if (i > op->nrof)
1541	i = op->nrof;
1542
1543	if (QUERY_FLAG (op, FLAG_REMOVED))
1544	op->nrof -= i;
1545	else if (op->env)
1546	{	1574	{
1547	/* is this object in the players inventory, or sub container
1548	* therein?
1549	*/
1550	tmp = op->in_player ();
1551	/* nope. Is this a container the player has opened?
1552	* If so, set tmp to that player.
1553	* IMO, searching through all the players will mostly
1554	* likely be quicker than following op->env to the map,
1555	* and then searching the map for a player.
1556	*/
1557	if (!tmp)
1558	for_all_players (pl)
1559	if (pl->ob->container == op->env)
1560	{
1561	tmp = pl->ob;
1562	break;
1563	}
1564
1565	if (i < op->nrof)
1566	{
1567	sub_weight (op->env, op->weight * i);
1568	op->nrof -= i;
1569	if (tmp)
1570	esrv_send_item (tmp, op);
1571	}
1572	else
1573	{
1574	op->remove ();	1575	remove ();
1575	op->nrof = 0;	1576	return this;
1576	if (tmp)
1577	esrv_del_item (tmp->contr, op->count);
1578	}
1579	}	1577	}
1580	else	1578	else
1581	{	1579	{
1582	object *above = op->above;	1580	decrease (nr);
1583		1581
1584	if (i < op->nrof)	1582	object *op = deep_clone ();
1585	op->nrof -= i;	1583	op->nrof = nr;
1586	else
1587	{
1588	op->remove ();
1589	op->nrof = 0;
1590	}
1591
1592	/* Since we just removed op, op->above is null */
1593	for (tmp = above; tmp; tmp = tmp->above)
1594	if (tmp->type == PLAYER)
1595	{
1596	if (op->nrof)
1597	esrv_send_item (tmp, op);
1598	else
1599	esrv_del_item (tmp->contr, op->count);
1600	}
1601	}
1602
1603	if (op->nrof)
1604	return op;	1584	return op;
1605	else
1606	{
1607	op->destroy ();
1608	return 0;
1609	}
1610	}
1611
1612	/*
1613	* add_weight(object, weight) adds the specified weight to an object,
1614	* and also updates how much the environment(s) is/are carrying.
1615	*/
1616	void
1617	add_weight (object *op, signed long weight)
1618	{
1619	while (op != NULL)
1620	{
1621	if (op->type == CONTAINER)
1622	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1623
1624	op->carrying += weight;
1625	op = op->env;
1626	}	1585	}
1627	}	1586	}
1628		1587
1629	object *	1588	object *
1630	insert_ob_in_ob (object *op, object *where)	1589	insert_ob_in_ob (object *op, object *where)
…		…
1655	* be != op, if items are merged. -Tero	1614	* be != op, if items are merged. -Tero
1656	*/	1615	*/
1657	object *	1616	object *
1658	object::insert (object *op)	1617	object::insert (object *op)
1659	{	1618	{
1660	if (!QUERY_FLAG (op, FLAG_REMOVED))
1661	op->remove ();
1662
1663	if (op->more)	1619	if (op->more)
1664	{	1620	{
1665	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1621	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1666	return op;	1622	return op;
1667	}	1623	}
1668		1624
1669	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1625	op->remove ();
1670	CLEAR_FLAG (op, FLAG_REMOVED);	1626
		1627	op->flag [FLAG_OBJ_ORIGINAL] = 0;
1671		1628
1672	if (op->nrof)	1629	if (op->nrof)
1673	{
1674	for (object *tmp = inv; tmp; tmp = tmp->below)	1630	for (object *tmp = inv; tmp; tmp = tmp->below)
1675	if (object::can_merge (tmp, op))	1631	if (object::can_merge (tmp, op))
1676	{	1632	{
1677	/* return the original object and remove inserted object	1633	/* return the original object and remove inserted object
1678	(client needs the original object) */	1634	(client needs the original object) */
1679	tmp->nrof += op->nrof;	1635	tmp->nrof += op->nrof;
1680	/* Weight handling gets pretty funky. Since we are adding to	1636
1681	* tmp->nrof, we need to increase the weight.	1637	if (object *pl = tmp->visible_to ())
1682	*/	1638	esrv_update_item (UPD_NROF, pl, tmp);
		1639
1683	add_weight (this, op->weight * op->nrof);	1640	adjust_weight (this, op->total_weight ());
1684	SET_FLAG (op, FLAG_REMOVED);	1641
1685	op->destroy (); /* free the inserted object */	1642	op->destroy (1);
1686	op = tmp;	1643	op = tmp;
1687	op->remove (); /* and fix old object's links */	1644	goto inserted;
1688	CLEAR_FLAG (op, FLAG_REMOVED);
1689	break;
1690	}	1645	}
1691		1646
1692	/* I assume combined objects have no inventory
1693	* We add the weight - this object could have just been removed
1694	* (if it was possible to merge). calling remove_ob will subtract
1695	* the weight, so we need to add it in again, since we actually do
1696	* the linking below
1697	*/
1698	add_weight (this, op->weight * op->nrof);
1699	}
1700	else
1701	add_weight (this, (op->weight + op->carrying));
1702
1703	if (object *otmp = this->in_player ())
1704	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1705	otmp->update_stats ();
1706
1707	op->owner = 0; // its his/hers now. period.	1647	op->owner = 0; // it's his/hers now. period.
1708	op->map = 0;	1648	op->map = 0;
		1649	op->x = 0;
		1650	op->y = 0;
		1651
		1652	op->above = 0;
		1653	op->below = inv;
1709	op->env = this;	1654	op->env = this;
1710	op->above = 0;
1711	op->below = 0;
1712	op->x = op->y = 0;
1713		1655
		1656	if (inv)
		1657	inv->above = op;
		1658
		1659	inv = op;
		1660
		1661	op->flag [FLAG_REMOVED] = 0;
		1662
		1663	if (object *pl = op->visible_to ())
		1664	esrv_send_item (pl, op);
		1665
		1666	adjust_weight (this, op->total_weight ());
		1667
		1668	inserted:
1714	/* reset the light list and los of the players on the map */	1669	/* reset the light list and los of the players on the map */
1715	if (op->glow_radius && map)	1670	if (op->glow_radius && map && map->darkness)
1716	{
1717	#ifdef DEBUG_LIGHTS
1718	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1719	#endif /* DEBUG_LIGHTS */
1720	if (map->darkness)
1721	update_all_los (map, x, y);	1671	update_all_los (map, x, y);
1722	}
1723		1672
1724	/* Client has no idea of ordering so lets not bother ordering it here.	1673	// if this is a player's inventory, update stats
1725	* It sure simplifies this function...	1674	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1726	*/	1675	update_stats ();
1727	if (!inv)
1728	inv = op;
1729	else
1730	{
1731	op->below = inv;
1732	op->below->above = op;
1733	inv = op;
1734	}
1735		1676
1736	INVOKE_OBJECT (INSERT, this);	1677	INVOKE_OBJECT (INSERT, this);
1737		1678
1738	return op;	1679	return op;
1739	}	1680	}
…		…
1867	LOG (llevError, "Present_arch called outside map.\n");	1808	LOG (llevError, "Present_arch called outside map.\n");
1868	return NULL;	1809	return NULL;
1869	}	1810	}
1870		1811
1871	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1812	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1872	if (tmp->arch == at)	1813	if (tmp->arch->archname == at->archname)
1873	return tmp;	1814	return tmp;
1874		1815
1875	return NULL;	1816	return NULL;
1876	}	1817	}
1877		1818
…		…
1941	* The first matching object is returned, or NULL if none.	1882	* The first matching object is returned, or NULL if none.
1942	*/	1883	*/
1943	object *	1884	object *
1944	present_arch_in_ob (const archetype *at, const object *op)	1885	present_arch_in_ob (const archetype *at, const object *op)
1945	{	1886	{
1946	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1887	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1947	if (tmp->arch == at)	1888	if (tmp->arch->archname == at->archname)
1948	return tmp;	1889	return tmp;
1949		1890
1950	return NULL;	1891	return NULL;
1951	}	1892	}
1952		1893
…		…
1954	* activate recursively a flag on an object inventory	1895	* activate recursively a flag on an object inventory
1955	*/	1896	*/
1956	void	1897	void
1957	flag_inv (object *op, int flag)	1898	flag_inv (object *op, int flag)
1958	{	1899	{
1959	if (op->inv)
1960	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1900	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1961	{	1901	{
1962	SET_FLAG (tmp, flag);	1902	SET_FLAG (tmp, flag);
1963	flag_inv (tmp, flag);	1903	flag_inv (tmp, flag);
1964	}	1904	}
1965	}	1905	}
1966		1906
1967	/*	1907	/*
1968	* deactivate recursively a flag on an object inventory	1908	* deactivate recursively a flag on an object inventory
1969	*/	1909	*/
1970	void	1910	void
1971	unflag_inv (object *op, int flag)	1911	unflag_inv (object *op, int flag)
1972	{	1912	{
1973	if (op->inv)
1974	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1913	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1975	{	1914	{
1976	CLEAR_FLAG (tmp, flag);	1915	CLEAR_FLAG (tmp, flag);
1977	unflag_inv (tmp, flag);	1916	unflag_inv (tmp, flag);
1978	}	1917	}
1979	}	1918	}
1980		1919
1981	/*	1920	/*
1982	* find_free_spot(object, map, x, y, start, stop) will search for	1921	* find_free_spot(object, map, x, y, start, stop) will search for
1983	* a spot at the given map and coordinates which will be able to contain	1922	* a spot at the given map and coordinates which will be able to contain
…		…
1985	* to search (see the freearr_x/y[] definition).	1924	* to search (see the freearr_x/y[] definition).
1986	* It returns a random choice among the alternatives found.	1925	* It returns a random choice among the alternatives found.
1987	* start and stop are where to start relative to the free_arr array (1,9	1926	* start and stop are where to start relative to the free_arr array (1,9
1988	* does all 4 immediate directions). This returns the index into the	1927	* does all 4 immediate directions). This returns the index into the
1989	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1928	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1990	* Note - this only checks to see if there is space for the head of the
1991	* object - if it is a multispace object, this should be called for all
1992	* pieces.
1993	* Note2: This function does correctly handle tiled maps, but does not	1929	* Note: This function does correctly handle tiled maps, but does not
1994	* inform the caller. However, insert_ob_in_map will update as	1930	* inform the caller. However, insert_ob_in_map will update as
1995	* necessary, so the caller shouldn't need to do any special work.	1931	* necessary, so the caller shouldn't need to do any special work.
1996	* Note - updated to take an object instead of archetype - this is necessary	1932	* Note - updated to take an object instead of archetype - this is necessary
1997	* because arch_blocked (now ob_blocked) needs to know the movement type	1933	* because arch_blocked (now ob_blocked) needs to know the movement type
1998	* to know if the space in question will block the object. We can't use	1934	* to know if the space in question will block the object. We can't use
…		…
2000	* customized, changed states, etc.	1936	* customized, changed states, etc.
2001	*/	1937	*/
2002	int	1938	int
2003	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1939	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2004	{	1940	{
		1941	int altern[SIZEOFFREE];
2005	int index = 0, flag;	1942	int index = 0, flag;
2006	int altern[SIZEOFFREE];
2007		1943
2008	for (int i = start; i < stop; i++)	1944	for (int i = start; i < stop; i++)
2009	{	1945	{
2010	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1946	mapxy pos (m, x, y); pos.move (i);
2011	if (!flag)	1947
		1948	if (!pos.normalise ())
		1949	continue;
		1950
		1951	mapspace &ms = *pos;
		1952
		1953	if (ms.flags () & P_IS_ALIVE)
		1954	continue;
		1955
		1956	/* However, often
		1957	* ob doesn't have any move type (when used to place exits)
		1958	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1959	*/
		1960	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1961	{
2012	altern [index++] = i;	1962	altern [index++] = i;
		1963	continue;
		1964	}
2013		1965
2014	/* Basically, if we find a wall on a space, we cut down the search size.	1966	/* Basically, if we find a wall on a space, we cut down the search size.
2015	* In this way, we won't return spaces that are on another side of a wall.	1967	* In this way, we won't return spaces that are on another side of a wall.
2016	* This mostly work, but it cuts down the search size in all directions -	1968	* This mostly work, but it cuts down the search size in all directions -
2017	* if the space being examined only has a wall to the north and empty	1969	* if the space being examined only has a wall to the north and empty
2018	* spaces in all the other directions, this will reduce the search space	1970	* spaces in all the other directions, this will reduce the search space
2019	* to only the spaces immediately surrounding the target area, and	1971	* to only the spaces immediately surrounding the target area, and
2020	* won't look 2 spaces south of the target space.	1972	* won't look 2 spaces south of the target space.
2021	*/	1973	*/
2022	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1974	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1975	{
2023	stop = maxfree[i];	1976	stop = maxfree[i];
		1977	continue;
		1978	}
		1979
		1980	/* Note it is intentional that we check ob - the movement type of the
		1981	* head of the object should correspond for the entire object.
		1982	*/
		1983	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1984	continue;
		1985
		1986	if (ob->blocked (m, pos.x, pos.y))
		1987	continue;
		1988
		1989	altern [index++] = i;
2024	}	1990	}
2025		1991
2026	if (!index)	1992	if (!index)
2027	return -1;	1993	return -1;
2028		1994
…		…
2037	*/	2003	*/
2038	int	2004	int
2039	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2005	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2040	{	2006	{
2041	for (int i = 0; i < SIZEOFFREE; i++)	2007	for (int i = 0; i < SIZEOFFREE; i++)
2042	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2008	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2043	return i;	2009	return i;
2044		2010
2045	return -1;	2011	return -1;
2046	}	2012	}
2047		2013
…		…
2336		2302
2337	/*	2303	/*
2338	* create clone from object to another	2304	* create clone from object to another
2339	*/	2305	*/
2340	object *	2306	object *
2341	object_create_clone (object *asrc)	2307	object::deep_clone ()
2342	{	2308	{
2343	object *dst = 0, *tmp, *src, *prev, *item;	2309	assert (("deep_clone called on non-head object", is_head ()));
2344		2310
2345	if (!asrc)	2311	object *dst = clone ();
2346	return 0;
2347		2312
2348	src = asrc->head_ ();	2313	object *prev = dst;
2349
2350	prev = 0;
2351	for (object *part = src; part; part = part->more)	2314	for (object *part = this->more; part; part = part->more)
2352	{	2315	{
2353	tmp = part->clone ();	2316	object *tmp = part->clone ();
2354	tmp->x -= src->x;
2355	tmp->y -= src->y;
2356
2357	if (!part->head)
2358	{
2359	dst = tmp;
2360	tmp->head = 0;
2361	}
2362	else
2363	tmp->head = dst;	2317	tmp->head = dst;
2364
2365	tmp->more = 0;
2366
2367	if (prev)
2368	prev->more = tmp;	2318	prev->more = tmp;
2369
2370	prev = tmp;	2319	prev = tmp;
2371	}	2320	}
2372		2321
2373	for (item = src->inv; item; item = item->below)	2322	for (object *item = inv; item; item = item->below)
2374	insert_ob_in_ob (object_create_clone (item), dst);	2323	insert_ob_in_ob (item->deep_clone (), dst);
2375		2324
2376	return dst;	2325	return dst;
2377	}	2326	}
2378		2327
2379	/* This returns the first object in who's inventory that	2328	/* This returns the first object in who's inventory that
…		…
2388	return tmp;	2337	return tmp;
2389		2338
2390	return 0;	2339	return 0;
2391	}	2340	}
2392		2341
2393	/* If ob has a field named key, return the link from the list,	2342	const shstr &
2394	* otherwise return NULL.	2343	object::kv_get (const shstr &key) const
2395	*
2396	* key must be a passed in shared string - otherwise, this won't
2397	* do the desired thing.
2398	*/
2399	key_value *
2400	get_ob_key_link (const object *ob, const char *key)
2401	{	2344	{
2402	for (key_value *link = ob->key_values; link; link = link->next)	2345	for (key_value *kv = key_values; kv; kv = kv->next)
2403	if (link->key == key)	2346	if (kv->key == key)
2404	return link;
2405
2406	return 0;
2407	}
2408
2409	/*
2410	* Returns the value of op has an extra_field for key, or NULL.
2411	*
2412	* The argument doesn't need to be a shared string.
2413	*
2414	* The returned string is shared.
2415	*/
2416	const char *
2417	get_ob_key_value (const object *op, const char *const key)
2418	{
2419	key_value *link;
2420	shstr_cmp canonical_key (key);
2421
2422	if (!canonical_key)
2423	{
2424	/* 1. There being a field named key on any object
2425	* implies there'd be a shared string to find.
2426	* 2. Since there isn't, no object has this field.
2427	* 3. Therefore, *this* object doesn't have this field.
2428	*/
2429	return 0;
2430	}
2431
2432	/* This is copied from get_ob_key_link() above -
2433	* only 4 lines, and saves the function call overhead.
2434	*/
2435	for (link = op->key_values; link; link = link->next)
2436	if (link->key == canonical_key)
2437	return link->value;	2347	return kv->value;
2438		2348
2439	return 0;	2349	return shstr_null;
2440	}	2350	}
2441		2351
2442	/*	2352	void
2443	* Updates the canonical_key in op to value.	2353	object::kv_set (const shstr &key, const shstr &value)
2444	*
2445	* canonical_key is a shared string (value doesn't have to be).
2446	*
2447	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2448	* keys.
2449	*
2450	* Returns TRUE on success.
2451	*/
2452	int
2453	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2454	{	2354	{
2455	key_value *field = NULL, *last = NULL;	2355	for (key_value *kv = key_values; kv; kv = kv->next)
2456		2356	if (kv->key == key)
2457	for (field = op->key_values; field != NULL; field = field->next)
2458	{
2459	if (field->key != canonical_key)
2460	{	2357	{
2461	last = field;	2358	kv->value = value;
2462	continue;	2359	return;
2463	}	2360	}
2464		2361
2465	if (value)	2362	key_value *kv = new key_value;
2466	field->value = value;	2363
2467	else	2364	kv->next = key_values;
		2365	kv->key = key;
		2366	kv->value = value;
		2367
		2368	key_values = kv;
		2369	}
		2370
		2371	void
		2372	object::kv_del (const shstr &key)
		2373	{
		2374	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2375	if ((*kvp)->key == key)
2468	{	2376	{
2469	/* Basically, if the archetype has this key set,	2377	key_value *kv = *kvp;
2470	* we need to store the null value so when we save	2378	*kvp = (*kvp)->next;
2471	* it, we save the empty value so that when we load,	2379	delete kv;
2472	* we get this value back again.	2380	return;
2473	*/
2474	if (get_ob_key_link (op->arch, canonical_key))
2475	field->value = 0;
2476	else
2477	{
2478	if (last)
2479	last->next = field->next;
2480	else
2481	op->key_values = field->next;
2482
2483	delete field;
2484	}
2485	}	2381	}
2486	return TRUE;
2487	}
2488	/* IF we get here, key doesn't exist */
2489
2490	/* No field, we'll have to add it. */
2491
2492	if (!add_key)
2493	return FALSE;
2494
2495	/* There isn't any good reason to store a null
2496	* value in the key/value list. If the archetype has
2497	* this key, then we should also have it, so shouldn't
2498	* be here. If user wants to store empty strings,
2499	* should pass in ""
2500	*/
2501	if (value == NULL)
2502	return TRUE;
2503
2504	field = new key_value;
2505
2506	field->key = canonical_key;
2507	field->value = value;
2508	/* Usual prepend-addition. */
2509	field->next = op->key_values;
2510	op->key_values = field;
2511
2512	return TRUE;
2513	}
2514
2515	/*
2516	* Updates the key in op to value.
2517	*
2518	* If add_key is FALSE, this will only update existing keys,
2519	* and not add new ones.
2520	* In general, should be little reason FALSE is ever passed in for add_key
2521	*
2522	* Returns TRUE on success.
2523	*/
2524	int
2525	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2526	{
2527	shstr key_ (key);
2528
2529	return set_ob_key_value_s (op, key_, value, add_key);
2530	}	2382	}
2531		2383
2532	object::depth_iterator::depth_iterator (object *container)	2384	object::depth_iterator::depth_iterator (object *container)
2533	: iterator_base (container)	2385	: iterator_base (container)
2534	{	2386	{
…		…
2584	{	2436	{
2585	char flagdesc[512];	2437	char flagdesc[512];
2586	char info2[256 * 4];	2438	char info2[256 * 4];
2587	char *p = info;	2439	char *p = info;
2588		2440
2589	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2441	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2590	count, uuid.seq,	2442	count,
		2443	uuid.c_str (),
2591	&name,	2444	&name,
2592	title ? "\",title:\"" : "",	2445	title ? ",title:\"" : "",
2593	title ? (const char *)title : "",	2446	title ? (const char *)title : "",
		2447	title ? "\"" : "",
2594	flag_desc (flagdesc, 512), type);	2448	flag_desc (flagdesc, 512), type);
2595		2449
2596	if (!this->flag[FLAG_REMOVED] && env)	2450	if (!flag[FLAG_REMOVED] && env)
2597	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2451	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2598		2452
2599	if (map)	2453	if (map)
2600	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2454	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2601		2455
…		…
2631	object::open_container (object *new_container)	2485	object::open_container (object *new_container)
2632	{	2486	{
2633	if (container == new_container)	2487	if (container == new_container)
2634	return;	2488	return;
2635		2489
2636	if (object *old_container = container)	2490	object *old_container = container;
		2491
		2492	if (old_container)
2637	{	2493	{
2638	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2494	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2639	return;	2495	return;
2640		2496
2641	#if 0	2497	#if 0
…		…
2643	if (object *closer = old_container->inv)	2499	if (object *closer = old_container->inv)
2644	if (closer->type == CLOSE_CON)	2500	if (closer->type == CLOSE_CON)
2645	closer->destroy ();	2501	closer->destroy ();
2646	#endif	2502	#endif
2647		2503
		2504	// make sure the container is available
		2505	esrv_send_item (this, old_container);
		2506
2648	old_container->flag [FLAG_APPLIED] = 0;	2507	old_container->flag [FLAG_APPLIED] = false;
2649	container = 0;	2508	container = 0;
2650		2509
		2510	// client needs item update to make it work, client bug requires this to be separate
2651	esrv_update_item (UPD_FLAGS, this, old_container);	2511	esrv_update_item (UPD_FLAGS, this, old_container);
		2512
2652	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2513	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2653	play_sound (sound_find ("chest_close"));	2514	play_sound (sound_find ("chest_close"));
2654	}	2515	}
2655		2516
2656	if (new_container)	2517	if (new_container)
…		…
2669	}	2530	}
2670	#endif	2531	#endif
2671		2532
2672	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2533	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2673		2534
		2535	// make sure the container is available, client bug requires this to be separate
		2536	esrv_send_item (this, new_container);
		2537
2674	new_container->flag [FLAG_APPLIED] = 1;	2538	new_container->flag [FLAG_APPLIED] = true;
2675	container = new_container;	2539	container = new_container;
2676		2540
		2541	// client needs flag change
2677	esrv_update_item (UPD_FLAGS, this, new_container);	2542	esrv_update_item (UPD_FLAGS, this, new_container);
2678	esrv_send_inventory (this, new_container);	2543	esrv_send_inventory (this, new_container);
2679	play_sound (sound_find ("chest_open"));	2544	play_sound (sound_find ("chest_open"));
2680	}	2545	}
		2546	// else if (!old_container->env && contr && contr->ns)
		2547	// contr->ns->floorbox_reset ();
2681	}	2548	}
2682		2549
2683	object *	2550	object *
2684	object::force_find (const shstr name)	2551	object::force_find (const shstr name)
2685	{	2552	{
…		…
2711		2578
2712	insert (force);	2579	insert (force);
2713	}	2580	}
2714		2581
2715	void	2582	void
2716	object::play_sound (faceidx sound) const	2583	object::play_sound (faceidx sound)
2717	{	2584	{
2718	if (!sound)	2585	if (!sound)
2719	return;	2586	return;
2720		2587
2721	if (flag [FLAG_REMOVED])	2588	if (flag [FLAG_REMOVED])

Diff Legend

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