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.114 by root, Sun Jan 14 22:06:05 2007 UTC vs.
Revision 1.256 by root, Sun Aug 31 05:47:14 2008 UTC

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

Diff Legend

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