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.65 by root, Wed Dec 13 00:42:03 2006 UTC vs.
Revision 1.205 by root, Sun Apr 13 01:34:08 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 (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
8	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
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	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
18	along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	*
20		21	* The authors can be reached via e-mail to <support@deliantra.net>
21	The authors can be reached via e-mail at <crossfire@schmorp.de>
22	*/	22	*/
23		23
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
26	variable. */	26	variable. */
27	#include <global.h>	27	#include <global.h>
28	#include <stdio.h>	28	#include <stdio.h>
29	#include <sys/types.h>	29	#include <sys/types.h>
30	#include <sys/uio.h>	30	#include <sys/uio.h>
31	#include <object.h>	31	#include <object.h>
32	#include <funcpoint.h>	32	#include <funcpoint.h>
		33	#include <sproto.h>
33	#include <loader.h>	34	#include <loader.h>
34		35
35	int nrofallocobjects = 0;	36	#include <bitset>
36	static UUID uuid;	37
		38	UUID UUID::cur;
		39	static uint64_t seq_next_save;
37	const uint64 UUID_SKIP = 1<<19;	40	static const uint64 UUID_GAP = 1<<19;
38		41
39	object *active_objects; /* List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
40		44
41	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,	45	short freearr_x[SIZEOFFREE] = {
		46	0,
		47	0, 1, 1, 1, 0, -1, -1, -1,
		48	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
42	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	49	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
43	};	50	};
44	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,	51	short freearr_y[SIZEOFFREE] = {
		52	0,
		53	-1, -1, 0, 1, 1, 1, 0, -1,
		54	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
45	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	55	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
46	};	56	};
47	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,	57	int maxfree[SIZEOFFREE] = {
		58	0,
		59	9, 10, 13, 14, 17, 18, 21, 22,
		60	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
48	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	61	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
49	};	62	};
50	int freedir[SIZEOFFREE] = {	63	int freedir[SIZEOFFREE] = {
51	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,	64	0,
		65	1, 2, 3, 4, 5, 6, 7, 8,
		66	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
52	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	67	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
53	};	68	};
54		69
55	static void	70	static void
56	write_uuid (void)	71	write_uuid (uval64 skip, bool sync)
57	{	72	{
58	char filename1[MAX_BUF], filename2[MAX_BUF];	73	CALL_BEGIN (2);
59		74	CALL_ARG_SV (newSVval64 (skip));
60	sprintf (filename1, "%s/uuid", settings.localdir);	75	CALL_ARG_SV (boolSV (sync));
61	sprintf (filename2, "%s/uuid~", settings.localdir);	76	CALL_CALL ("cf::write_uuid", G_DISCARD);
62		77	CALL_END;
63	FILE *fp;
64
65	if (!(fp = fopen (filename2, "w")))
66	{
67	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
68	return;
69	}
70
71	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
72	fclose (fp);
73	rename (filename2, filename1);
74	}	78	}
75		79
76	static void	80	static void
77	read_uuid (void)	81	read_uuid (void)
78	{	82	{
79	char filename[MAX_BUF];	83	char filename[MAX_BUF];
80		84
81	sprintf (filename, "%s/uuid", settings.localdir);	85	sprintf (filename, "%s/uuid", settings.localdir);
82		86
		87	seq_next_save = 0;
		88
83	FILE *fp;	89	FILE *fp;
84		90
85	if (!(fp = fopen (filename, "r")))	91	if (!(fp = fopen (filename, "r")))
86	{	92	{
87	if (errno == ENOENT)	93	if (errno == ENOENT)
88	{	94	{
89	LOG (llevInfo, "RESET uid to 1\n");	95	LOG (llevInfo, "RESET uid to 1\n");
90	uuid.seq = 0;	96	UUID::cur.seq = 0;
91	write_uuid ();	97	write_uuid (UUID_GAP, true);
92	return;	98	return;
93	}	99	}
94		100
95	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	101	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
96	_exit (1);	102	_exit (1);
97	}	103	}
98		104
99	int version;	105	UUID::BUF buf;
100	unsigned long long uid;	106	buf[0] = 0;
101	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)	107	fgets (buf, sizeof (buf), fp);
		108
		109	if (!UUID::cur.parse (buf))
102	{	110	{
103	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	111	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
104	_exit (1);	112	_exit (1);
105	}	113	}
106		114
107	uuid.seq = uid;	115	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
108	write_uuid ();	116
109	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	117	write_uuid (UUID_GAP, true);
110	fclose (fp);	118	fclose (fp);
111	}	119	}
112		120
113	UUID	121	UUID
114	gen_uuid ()	122	UUID::gen ()
115	{	123	{
116	UUID uid;	124	UUID uid;
117		125
118	uid.seq = ++uuid.seq;	126	uid.seq = ++cur.seq;
119		127
120	if (!(uuid.seq & (UUID_SKIP - 1)))	128	if (expect_false (cur.seq >= seq_next_save))
121	write_uuid ();	129	{
		130	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		131	write_uuid (UUID_GAP, false);
		132	}
		133
122		134
123	return uid;	135	return uid;
124	}	136	}
125		137
126	void	138	void
127	init_uuid ()	139	UUID::init ()
128	{	140	{
129	read_uuid ();	141	read_uuid ();
130	}	142	}
131		143
132	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	144	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
133	static int	145	static bool
134	compare_ob_value_lists_one (const object *wants, const object *has)	146	compare_ob_value_lists_one (const object *wants, const object *has)
135	{	147	{
136	key_value *wants_field;	148	key_value *wants_field;
137		149
138	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	150	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
139	* objects with lists are rare, and lists stay short. If not, use a	151	* objects with lists are rare, and lists stay short. If not, use a
140	* different structure or at least keep the lists sorted...	152	* different structure or at least keep the lists sorted...
141	*/	153	*/
142		154
143	/* For each field in wants, */	155	/* For each field in wants, */
144	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	156	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
145	{	157	{
146	key_value *has_field;	158	key_value *has_field;
147		159
148	/* Look for a field in has with the same key. */	160	/* Look for a field in has with the same key. */
149	has_field = get_ob_key_link (has, wants_field->key);	161	has_field = get_ob_key_link (has, wants_field->key);
150		162
151	if (has_field == NULL)	163	if (!has_field)
152	{
153	/* No field with that name. */	164	return 0; /* No field with that name. */
154	return FALSE;
155	}
156		165
157	/* Found the matching field. */	166	/* Found the matching field. */
158	if (has_field->value != wants_field->value)	167	if (has_field->value != wants_field->value)
159	{
160	/* Values don't match, so this half of the comparison is false. */	168	return 0; /* Values don't match, so this half of the comparison is false. */
161	return FALSE;
162	}
163		169
164	/* If we get here, we found a match. Now for the next field in wants. */	170	/* If we get here, we found a match. Now for the next field in wants. */
165	}	171	}
166		172
167	/* If we get here, every field in wants has a matching field in has. */	173	/* If we get here, every field in wants has a matching field in has. */
168	return TRUE;	174	return 1;
169	}	175	}
170		176
171	/* Returns TRUE if ob1 has the same key_values as ob2. */	177	/* Returns TRUE if ob1 has the same key_values as ob2. */
172	static int	178	static bool
173	compare_ob_value_lists (const object *ob1, const object *ob2)	179	compare_ob_value_lists (const object *ob1, const object *ob2)
174	{	180	{
175	/* However, there may be fields in has which aren't partnered in wants,	181	/* However, there may be fields in has which aren't partnered in wants,
176	* so we need to run the comparison *twice*. :(	182	* so we need to run the comparison *twice*. :(
177	*/	183	*/
…		…
183	*	189	*
184	* Note that this function appears a lot longer than the macro it	190	* Note that this function appears a lot longer than the macro it
185	* replaces - this is mostly for clarity - a decent compiler should hopefully	191	* replaces - this is mostly for clarity - a decent compiler should hopefully
186	* reduce this to the same efficiency.	192	* reduce this to the same efficiency.
187	*	193	*
188	* Check nrof variable *before* calling CAN_MERGE()	194	* Check nrof variable *before* calling can_merge()
189	*	195	*
190	* Improvements made with merge: Better checking on potion, and also	196	* Improvements made with merge: Better checking on potion, and also
191	* check weight	197	* check weight
192	*/	198	*/
193
194	bool object::can_merge (object *ob1, object *ob2)	199	bool object::can_merge_slow (object *ob1, object *ob2)
195	{	200	{
196	/* A couple quicksanity checks */	201	/* A couple quicksanity checks */
197	if ((ob1 == ob2) || (ob1->type != ob2->type))	202	if (ob1 == ob2
		203	|| ob1->type != ob2->type
		204	|| ob1->speed != ob2->speed
		205	|| ob1->value != ob2->value
		206	|| ob1->name != ob2->name)
198	return 0;	207	return 0;
199		208
200	if (ob1->speed != ob2->speed)	209	/* Do not merge objects if nrof would overflow. First part checks
		210	* for unsigned overflow (2c), second part checks wether the result
		211	* would fit into a 32 bit signed int, which is often used to hold
		212	* nrof values.
		213	*/
		214	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
201	return 0;	215	return 0;
202		216
203	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
204	* value could not be stored in a sint32 (which unfortunately sometimes is
205	* used to store nrof).
206	*/
207	if (ob1->nrof + ob2->nrof >= 1UL << 31)
208	return 0;
209
210	/* If the objects have been identified, set the BEEN_APPLIED flag.	217	/* If the objects have been identified, set the BEEN_APPLIED flag.
211	* This is to the comparison of the flags below will be OK. We	218	* This is to the comparison of the flags below will be OK. We
212	* just can't ignore the been applied or identified flags, as they	219	* just can't ignore the been applied or identified flags, as they
213	* are not equal - just if it has been identified, the been_applied	220	* are not equal - just if it has been identified, the been_applied
214	* flags lose any meaning.	221	* flags lose any meaning.
215	*/	222	*/
216	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	223	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
217	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	224	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
218		225
219	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	226	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
220	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	227	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
221		228
222		229	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
223	/* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something	230	|| ob1->arch != ob2->arch
224	* being locked in inventory should prevent merging.
225	* 0x4 in flags3 is CLIENT_SENT
226	*/
227	if ((ob1->arch != ob2->arch) ||
228	(ob1->flags[0] != ob2->flags[0]) ||
229	(ob1->flags[1] != ob2->flags[1]) ||
230	((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
231	((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
232	(ob1->name != ob2->name) ||	231	|| ob1->name != ob2->name
233	(ob1->title != ob2->title) ||	232	|| ob1->title != ob2->title
234	(ob1->msg != ob2->msg) ||	233	|| ob1->msg != ob2->msg
235	(ob1->weight != ob2->weight) ||	234	|| ob1->weight != ob2->weight
236	(memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) ||	235	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
237	(memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) ||	236	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
238	(ob1->attacktype != ob2->attacktype) ||	237	|| ob1->attacktype != ob2->attacktype
239	(ob1->magic != ob2->magic) ||	238	|| ob1->magic != ob2->magic
240	(ob1->slaying != ob2->slaying) ||	239	|| ob1->slaying != ob2->slaying
241	(ob1->skill != ob2->skill) ||	240	|| ob1->skill != ob2->skill
242	(ob1->value != ob2->value) ||	241	|| ob1->value != ob2->value
243	(ob1->animation_id != ob2->animation_id) ||	242	|| ob1->animation_id != ob2->animation_id
244	(ob1->client_type != ob2->client_type) ||	243	|| ob1->client_type != ob2->client_type
245	(ob1->materialname != ob2->materialname) ||	244	|| ob1->materialname != ob2->materialname
246	(ob1->lore != ob2->lore) ||	245	|| ob1->lore != ob2->lore
247	(ob1->subtype != ob2->subtype) ||	246	|| ob1->subtype != ob2->subtype
248	(ob1->move_type != ob2->move_type) ||	247	|| ob1->move_type != ob2->move_type
249	(ob1->move_block != ob2->move_block) ||	248	|| ob1->move_block != ob2->move_block
250	(ob1->move_allow != ob2->move_allow) ||	249	|| ob1->move_allow != ob2->move_allow
251	(ob1->move_on != ob2->move_on) ||	250	|| ob1->move_on != ob2->move_on
252	(ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty))	251	|| ob1->move_off != ob2->move_off
		252	|| ob1->move_slow != ob2->move_slow
		253	|| ob1->move_slow_penalty != ob2->move_slow_penalty)
253	return 0;	254	return 0;
254		255
255	/* This is really a spellbook check - really, we should	256	/* This is really a spellbook check - we should in general
256	* check all objects in the inventory.	257	* not merge objects with real inventories, as splitting them
		258	* is hard.
257	*/	259	*/
258	if (ob1->inv || ob2->inv)	260	if (ob1->inv || ob2->inv)
259	{	261	{
260	/* if one object has inventory but the other doesn't, not equiv */
261	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
262	return 0;
263
264	/* Now check to see if the two inventory objects could merge */
265	if (!CAN_MERGE (ob1->inv, ob2->inv))	262	if (!(ob1->inv && ob2->inv))
266	return 0;	263	return 0; /* inventories differ in length */
		264
		265	if (ob1->inv->below || ob2->inv->below)
		266	return 0; /* more than one object in inv */
		267
		268	if (!object::can_merge (ob1->inv, ob2->inv))
		269	return 0; /* inventory objects differ */
267		270
268	/* inventory ok - still need to check rest of this object to see	271	/* inventory ok - still need to check rest of this object to see
269	* if it is valid.	272	* if it is valid.
270	*/	273	*/
271	}	274	}
…		…
279		282
280	/* Note sure why the following is the case - either the object has to	283	/* Note sure why the following is the case - either the object has to
281	* be animated or have a very low speed. Is this an attempted monster	284	* be animated or have a very low speed. Is this an attempted monster
282	* check?	285	* check?
283	*/	286	*/
284	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	287	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
285	return 0;	288	return 0;
286		289
287	switch (ob1->type)	290	switch (ob1->type)
288	{	291	{
289	case SCROLL:	292	case SCROLL:
290	if (ob1->level != ob2->level)	293	if (ob1->level != ob2->level)
291	return 0;	294	return 0;
292	break;	295	break;
293	}	296	}
294		297
295	if (ob1->key_values != NULL || ob2->key_values != NULL)	298	if (ob1->key_values || ob2->key_values)
296	{	299	{
297	/* At least one of these has key_values. */	300	/* At least one of these has key_values. */
298	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	301	if ((!ob1->key_values) != (!ob2->key_values))
299	/* One has fields, but the other one doesn't. */	302	/* One has fields, but the other one doesn't. */
300	return 0;	303	return 0;
301	else if (!compare_ob_value_lists (ob1, ob2))	304	else if (!compare_ob_value_lists (ob1, ob2))
302	return 0;	305	return 0;
303	}	306	}
304		307
305	//TODO: generate an event or call into perl for additional checks
306	if (ob1->self || ob2->self)	308	if (ob1->self || ob2->self)
307	{	309	{
308	ob1->optimise ();	310	ob1->optimise ();
309	ob2->optimise ();	311	ob2->optimise ();
310		312
311	if (ob1->self || ob2->self)	313	if (ob1->self || ob2->self)
		314	{
		315	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		316	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		317
		318	if (k1 != k2)
312	return 0;	319	return 0;
		320	else if (k1 == 0)
		321	return 1;
		322	else if (!cfperl_can_merge (ob1, ob2))
		323	return 0;
		324	}
313	}	325	}
314		326
315	/* Everything passes, must be OK. */	327	/* Everything passes, must be OK. */
316	return 1;	328	return 1;
317	}	329	}
…		…
325	sum_weight (object *op)	337	sum_weight (object *op)
326	{	338	{
327	long sum;	339	long sum;
328	object *inv;	340	object *inv;
329		341
330	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)	342	for (sum = 0, inv = op->inv; inv; inv = inv->below)
331	{	343	{
332	if (inv->inv)	344	if (inv->inv)
333	sum_weight (inv);	345	sum_weight (inv);
		346
334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	347	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
335	}	348	}
336		349
337	if (op->type == CONTAINER && op->stats.Str)	350	if (op->type == CONTAINER && op->stats.Str)
338	sum = (sum * (100 - op->stats.Str)) / 100;	351	sum = (sum * (100 - op->stats.Str)) / 100;
…		…
354	op = op->env;	367	op = op->env;
355	return op;	368	return op;
356	}	369	}
357		370
358	/*	371	/*
359	* Eneq(@csd.uu.se): Since we can have items buried in a character we need
360	* a better check. We basically keeping traversing up until we can't
361	* or find a player.
362	*/
363
364	object *
365	is_player_inv (object *op)
366	{
367	for (; op != NULL && op->type != PLAYER; op = op->env)
368	if (op->env == op)
369	op->env = NULL;
370	return op;
371	}
372
373	/*
374	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	372	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
375	* Some error messages.	373	* Some error messages.
376	* The result of the dump is stored in the static global errmsg array.	374	* The result of the dump is stored in the static global errmsg array.
377	*/	375	*/
378
379	char *	376	char *
380	dump_object (object *op)	377	dump_object (object *op)
381	{	378	{
382	if (!op)	379	if (!op)
383	return strdup ("[NULLOBJ]");	380	return strdup ("[NULLOBJ]");
384		381
385	object_freezer freezer;	382	object_freezer freezer;
386	save_object (freezer, op, 3);	383	op->write (freezer);
387	return freezer.as_string ();	384	return freezer.as_string ();
388	}	385	}
389		386
390	/*	387	/*
391	* get_nearest_part(multi-object, object 2) returns the part of the	388	* get_nearest_part(multi-object, object 2) returns the part of the
392	* multi-object 1 which is closest to the second object.	389	* multi-object 1 which is closest to the second object.
393	* If it's not a multi-object, it is returned.	390	* If it's not a multi-object, it is returned.
394	*/	391	*/
395
396	object *	392	object *
397	get_nearest_part (object *op, const object *pl)	393	get_nearest_part (object *op, const object *pl)
398	{	394	{
399	object *tmp, *closest;	395	object *tmp, *closest;
400	int last_dist, i;	396	int last_dist, i;
…		…
408	}	404	}
409		405
410	/*	406	/*
411	* Returns the object which has the count-variable equal to the argument.	407	* Returns the object which has the count-variable equal to the argument.
412	*/	408	*/
413
414	object *	409	object *
415	find_object (tag_t i)	410	find_object (tag_t i)
416	{	411	{
417	for (object *op = object::first; op; op = op->next)	412	for_all_objects (op)
418	if (op->count == i)	413	if (op->count == i)
419	return op;	414	return op;
420		415
421	return 0;	416	return 0;
422	}	417	}
423		418
424	/*	419	/*
425	* Returns the first object which has a name equal to the argument.	420	* Returns the first object which has a name equal to the argument.
426	* Used only by the patch command, but not all that useful.	421	* Used only by the patch command, but not all that useful.
427	* Enables features like "patch <name-of-other-player> food 999"	422	* Enables features like "patch <name-of-other-player> food 999"
428	*/	423	*/
429
430	object *	424	object *
431	find_object_name (const char *str)	425	find_object_name (const char *str)
432	{	426	{
433	shstr_cmp str_ (str);	427	shstr_cmp str_ (str);
434	object *op;	428	object *op;
435		429
436	for (op = object::first; op != NULL; op = op->next)	430	for_all_objects (op)
437	if (op->name == str_)	431	if (op->name == str_)
438	break;	432	break;
439		433
440	return op;	434	return op;
441	}	435	}
442		436
443	void
444	free_all_object_data ()
445	{
446	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
447	}
448
449	/*	437	/*
450	* Sets the owner and sets the skill and exp pointers to owner's current	438	* Sets the owner and sets the skill and exp pointers to owner's current
451	* skill and experience objects.	439	* skill and experience objects.
		440	* ACTUALLY NO! investigate! TODO
452	*/	441	*/
453	void	442	void
454	object::set_owner (object *owner)	443	object::set_owner (object *owner)
455	{	444	{
		445	// allow objects which own objects
456	if (!owner)	446	if (owner)
457	return;
458
459	/* next line added to allow objects which own objects */
460	/* Add a check for ownercounts in here, as I got into an endless loop
461	* with the fireball owning a poison cloud which then owned the
462	* fireball. I believe that was caused by one of the objects getting
463	* freed and then another object replacing it. Since the ownercounts
464	* didn't match, this check is valid and I believe that cause is valid.
465	*/
466	while (owner->owner)	447	while (owner->owner)
467	owner = owner->owner;	448	owner = owner->owner;
		449
		450	if (flag [FLAG_FREED])
		451	{
		452	LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		453	return;
		454	}
468		455
469	this->owner = owner;	456	this->owner = owner;
		457	}
		458
		459	int
		460	object::slottype () const
		461	{
		462	if (type == SKILL)
		463	{
		464	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		465	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		466	}
		467	else
		468	{
		469	if (slot [body_combat].info) return slot_combat;
		470	if (slot [body_range ].info) return slot_ranged;
		471	}
		472
		473	return slot_none;
		474	}
		475
		476	bool
		477	object::change_weapon (object *ob)
		478	{
		479	if (current_weapon == ob)
		480	return true;
		481
		482	if (chosen_skill)
		483	chosen_skill->flag [FLAG_APPLIED] = false;
		484
		485	current_weapon = ob;
		486	chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		487
		488	if (chosen_skill)
		489	chosen_skill->flag [FLAG_APPLIED] = true;
		490
		491	update_stats ();
		492
		493	if (ob)
		494	{
		495	// now check wether any body locations became invalid, in which case
		496	// we cannot apply the weapon at the moment.
		497	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		498	if (slot[i].used < 0)
		499	{
		500	current_weapon = chosen_skill = 0;
		501	update_stats ();
		502
		503	new_draw_info_format (NDI_UNIQUE, 0, this,
		504	"You try to balance all your items at once, "
		505	"but the %s is just too much for your body. "
		506	"[You need to unapply some items first.]", &ob->name);
		507	return false;
		508	}
		509
		510	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		511	}
		512	else
		513	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		514
		515	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		516	{
		517	LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
		518	&name, ob->debug_desc ());
		519	return false;
		520	}
		521
		522	return true;
470	}	523	}
471		524
472	/* Zero the key_values on op, decrementing the shared-string	525	/* Zero the key_values on op, decrementing the shared-string
473	* refcounts and freeing the links.	526	* refcounts and freeing the links.
474	*/	527	*/
475	static void	528	static void
476	free_key_values (object *op)	529	free_key_values (object *op)
477	{	530	{
478	for (key_value *i = op->key_values; i != 0;)	531	for (key_value *i = op->key_values; i; )
479	{	532	{
480	key_value *next = i->next;	533	key_value *next = i->next;
481	delete i;	534	delete i;
482		535
483	i = next;	536	i = next;
484	}	537	}
485		538
486	op->key_values = 0;	539	op->key_values = 0;
487	}	540	}
488		541
489	void object::clear ()	542	object &
		543	object::operator =(const object &src)
490	{	544	{
491	attachable_base::clear ();	545	bool is_freed = flag [FLAG_FREED];
		546	bool is_removed = flag [FLAG_REMOVED];
492		547
493	free_key_values (this);
494
495	owner = 0;
496	name = 0;
497	name_pl = 0;
498	title = 0;
499	race = 0;
500	slaying = 0;
501	skill = 0;
502	msg = 0;
503	lore = 0;
504	custom_name = 0;
505	materialname = 0;
506	contr = 0;
507	below = 0;
508	above = 0;
509	inv = 0;
510	container = 0;
511	env = 0;
512	more = 0;
513	head = 0;
514	map = 0;
515	active_next = 0;
516	active_prev = 0;
517
518	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
519
520	SET_FLAG (this, FLAG_REMOVED);
521
522	/* What is not cleared is next, prev, and count */
523
524	expmul = 1.0;
525	face = blank_face;
526
527	if (settings.casting_time)
528	casting_time = -1;
529	}
530
531	/*
532	* copy_to first frees everything allocated by the dst object,
533	* and then copies the contents of itself into the second
534	* object, allocating what needs to be allocated. Basically, any
535	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
536	* if the first object is freed, the pointers in the new object
537	* will point at garbage.
538	*/
539	void
540	object::copy_to (object *dst)
541	{
542	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
543	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
544
545	*(object_copy *)dst = *this;	548	*(object_copy *)this = src;
546	*(object_pod *)dst = *this;
547		549
548	if (self || cb)	550	flag [FLAG_FREED] = is_freed;
549	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));	551	flag [FLAG_REMOVED] = is_removed;
550
551	if (is_freed)
552	SET_FLAG (dst, FLAG_FREED);
553
554	if (is_removed)
555	SET_FLAG (dst, FLAG_REMOVED);
556
557	if (speed < 0)
558	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
559		552
560	/* Copy over key_values, if any. */	553	/* Copy over key_values, if any. */
561	if (key_values)	554	if (src.key_values)
562	{	555	{
563	key_value *tail = 0;	556	key_value *tail = 0;
564	key_value *i;
565
566	dst->key_values = 0;	557	key_values = 0;
567		558
568	for (i = key_values; i; i = i->next)	559	for (key_value *i = src.key_values; i; i = i->next)
569	{	560	{
570	key_value *new_link = new key_value;	561	key_value *new_link = new key_value;
571		562
572	new_link->next = 0;	563	new_link->next = 0;
573	new_link->key = i->key;	564	new_link->key = i->key;
574	new_link->value = i->value;	565	new_link->value = i->value;
575		566
576	/* Try and be clever here, too. */	567	/* Try and be clever here, too. */
577	if (!dst->key_values)	568	if (!key_values)
578	{	569	{
579	dst->key_values = new_link;	570	key_values = new_link;
580	tail = new_link;	571	tail = new_link;
581	}	572	}
582	else	573	else
583	{	574	{
584	tail->next = new_link;	575	tail->next = new_link;
585	tail = new_link;	576	tail = new_link;
586	}	577	}
587	}	578	}
588	}	579	}
		580	}
589		581
590	update_ob_speed (dst);	582	/*
		583	* copy_to first frees everything allocated by the dst object,
		584	* and then copies the contents of itself into the second
		585	* object, allocating what needs to be allocated. Basically, any
		586	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		587	* if the first object is freed, the pointers in the new object
		588	* will point at garbage.
		589	*/
		590	void
		591	object::copy_to (object *dst)
		592	{
		593	*dst = *this;
		594
		595	if (speed < 0)
		596	dst->speed_left -= rndm ();
		597
		598	dst->set_speed (dst->speed);
		599	}
		600
		601	void
		602	object::instantiate ()
		603	{
		604	if (!uuid.seq) // HACK
		605	uuid = UUID::gen ();
		606
		607	speed_left = -0.1f;
		608	/* copy the body_info to the body_used - this is only really
		609	* need for monsters, but doesn't hurt to do it for everything.
		610	* by doing so, when a monster is created, it has good starting
		611	* values for the body_used info, so when items are created
		612	* for it, they can be properly equipped.
		613	*/
		614	for (int i = NUM_BODY_LOCATIONS; i--; )
		615	slot[i].used = slot[i].info;
		616
		617	attachable::instantiate ();
591	}	618	}
592		619
593	object *	620	object *
594	object::clone ()	621	object::clone ()
595	{	622	{
…		…
601	/*	628	/*
602	* If an object with the IS_TURNABLE() flag needs to be turned due	629	* If an object with the IS_TURNABLE() flag needs to be turned due
603	* to the closest player being on the other side, this function can	630	* to the closest player being on the other side, this function can
604	* be called to update the face variable, _and_ how it looks on the map.	631	* be called to update the face variable, _and_ how it looks on the map.
605	*/	632	*/
606
607	void	633	void
608	update_turn_face (object *op)	634	update_turn_face (object *op)
609	{	635	{
610	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	636	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
611	return;	637	return;
		638
612	SET_ANIMATION (op, op->direction);	639	SET_ANIMATION (op, op->direction);
613	update_object (op, UP_OBJ_FACE);	640	update_object (op, UP_OBJ_FACE);
614	}	641	}
615		642
616	/*	643	/*
617	* Updates the speed of an object. If the speed changes from 0 to another	644	* Updates the speed of an object. If the speed changes from 0 to another
618	* value, or vice versa, then add/remove the object from the active list.	645	* value, or vice versa, then add/remove the object from the active list.
619	* This function needs to be called whenever the speed of an object changes.	646	* This function needs to be called whenever the speed of an object changes.
620	*/	647	*/
621	void	648	void
622	update_ob_speed (object *op)	649	object::set_speed (float speed)
623	{	650	{
624	extern int arch_init;	651	if (flag [FLAG_FREED] && speed)
625
626	/* No reason putting the archetypes objects on the speed list,
627	* since they never really need to be updated.
628	*/
629
630	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
631	{	652	{
632	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	653	LOG (llevError, "Object %s is freed but has speed.\n", &name);
633	#ifdef MANY_CORES
634	abort ();
635	#else
636	op->speed = 0;	654	speed = 0;
637	#endif
638	}
639
640	if (arch_init)
641	return;
642
643	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
644	{	655	}
645	/* If already on active list, don't do anything */
646	if (op->active_next || op->active_prev || op == active_objects)
647	return;
648		656
649	/* process_events() expects us to insert the object at the beginning	657	this->speed = speed;
650	* of the list. */
651	op->active_next = active_objects;
652		658
653	if (op->active_next != NULL)	659	if (has_active_speed ())
654	op->active_next->active_prev = op;	660	activate ();
655
656	active_objects = op;
657	}
658	else	661	else
659	{	662	deactivate ();
660	/* If not on the active list, nothing needs to be done */
661	if (!op->active_next && !op->active_prev && op != active_objects)
662	return;
663
664	if (op->active_prev == NULL)
665	{
666	active_objects = op->active_next;
667
668	if (op->active_next != NULL)
669	op->active_next->active_prev = NULL;
670	}
671	else
672	{
673	op->active_prev->active_next = op->active_next;
674
675	if (op->active_next)
676	op->active_next->active_prev = op->active_prev;
677	}
678
679	op->active_next = NULL;
680	op->active_prev = NULL;
681	}
682	}	663	}
683		664
684	/* This function removes object 'op' from the list of active
685	* objects.
686	* This should only be used for style maps or other such
687	* reference maps where you don't want an object that isn't
688	* in play chewing up cpu time getting processed.
689	* The reverse of this is to call update_ob_speed, which
690	* will do the right thing based on the speed of the object.
691	*/
692	void
693	remove_from_active_list (object *op)
694	{
695	/* If not on the active list, nothing needs to be done */
696	if (!op->active_next && !op->active_prev && op != active_objects)
697	return;
698
699	if (op->active_prev == NULL)
700	{
701	active_objects = op->active_next;
702	if (op->active_next != NULL)
703	op->active_next->active_prev = NULL;
704	}
705	else
706	{
707	op->active_prev->active_next = op->active_next;
708	if (op->active_next)
709	op->active_next->active_prev = op->active_prev;
710	}
711	op->active_next = NULL;
712	op->active_prev = NULL;
713	}
714
715	/*	665	/*
716	* update_object() updates the array which represents the map.	666	* update_object() updates the the map.
717	* It takes into account invisible objects (and represent squares covered	667	* It takes into account invisible objects (and represent squares covered
718	* by invisible objects by whatever is below them (unless it's another	668	* by invisible objects by whatever is below them (unless it's another
719	* invisible object, etc...)	669	* invisible object, etc...)
720	* If the object being updated is beneath a player, the look-window	670	* If the object being updated is beneath a player, the look-window
721	* of that player is updated (this might be a suboptimal way of	671	* of that player is updated (this might be a suboptimal way of
722	* updating that window, though, since update_object() is called _often_)	672	* updating that window, though, since update_object() is called _often_)
723	*	673	*
724	* action is a hint of what the caller believes need to be done.	674	* action is a hint of what the caller believes need to be done.
725	* For example, if the only thing that has changed is the face (due to
726	* an animation), we don't need to call update_position until that actually
727	* comes into view of a player. OTOH, many other things, like addition/removal
728	* of walls or living creatures may need us to update the flags now.
729	* current action are:	675	* current action are:
730	* UP_OBJ_INSERT: op was inserted	676	* UP_OBJ_INSERT: op was inserted
731	* UP_OBJ_REMOVE: op was removed	677	* UP_OBJ_REMOVE: op was removed
732	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	678	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
733	* as that is easier than trying to look at what may have changed.	679	* as that is easier than trying to look at what may have changed.
734	* UP_OBJ_FACE: only the objects face has changed.	680	* UP_OBJ_FACE: only the objects face has changed.
735	*/	681	*/
736
737	void	682	void
738	update_object (object *op, int action)	683	update_object (object *op, int action)
739	{	684	{
740	int update_now = 0, flags;
741	MoveType move_on, move_off, move_block, move_slow;
742
743	if (op == NULL)	685	if (op == NULL)
744	{	686	{
745	/* this should never happen */	687	/* this should never happen */
746	LOG (llevDebug, "update_object() called for NULL object.\n");	688	LOG (llevDebug, "update_object() called for NULL object.\n");
747	return;	689	return;
748	}	690	}
749		691
750	if (op->env != NULL)	692	if (op->env)
751	{	693	{
752	/* Animation is currently handled by client, so nothing	694	/* Animation is currently handled by client, so nothing
753	* to do in this case.	695	* to do in this case.
754	*/	696	*/
755	return;	697	return;
…		…
760	*/	702	*/
761	if (!op->map || op->map->in_memory == MAP_SAVING)	703	if (!op->map || op->map->in_memory == MAP_SAVING)
762	return;	704	return;
763		705
764	/* make sure the object is within map boundaries */	706	/* make sure the object is within map boundaries */
765	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	707	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
766	{	708	{
767	LOG (llevError, "update_object() called for object out of map!\n");	709	LOG (llevError, "update_object() called for object out of map!\n");
768	#ifdef MANY_CORES	710	#ifdef MANY_CORES
769	abort ();	711	abort ();
770	#endif	712	#endif
771	return;	713	return;
772	}	714	}
773		715
774	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	716	mapspace &m = op->ms ();
775	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
776	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
777	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
778	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
779	move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
780		717
		718	if (!(m.flags_ & P_UPTODATE))
		719	/* nop */;
781	if (action == UP_OBJ_INSERT)	720	else if (action == UP_OBJ_INSERT)
782	{	721	{
		722	// this is likely overkill, TODO: revisit (schmorp)
783	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	723	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
784	update_now = 1;
785
786	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	724	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
787	update_now = 1;	725	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
788		726	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		727	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
789	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	728	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
790	update_now = 1;
791
792	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
793	update_now = 1;
794
795	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
796	update_now = 1;
797
798	if ((move_on | op->move_on) != move_on)	729	|| (m.move_on | op->move_on ) != m.move_on
799	update_now = 1;
800
801	if ((move_off | op->move_off) != move_off)	730	|| (m.move_off | op->move_off ) != m.move_off
802	update_now = 1;	731	|| (m.move_slow | op->move_slow) != m.move_slow
803
804	/* This isn't perfect, but I don't expect a lot of objects to	732	/* This isn't perfect, but I don't expect a lot of objects to
805	* to have move_allow right now.	733	* to have move_allow right now.
806	*/	734	*/
807	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	735	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
808	update_now = 1;	736	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
809		737	m.flags_ = 0;
810	if ((move_slow | op->move_slow) != move_slow)
811	update_now = 1;
812	}	738	}
813
814	/* if the object is being removed, we can't make intelligent	739	/* if the object is being removed, we can't make intelligent
815	* decisions, because remove_ob can't really pass the object	740	* decisions, because remove_ob can't really pass the object
816	* that is being removed.	741	* that is being removed.
817	*/	742	*/
818	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	743	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
819	update_now = 1;	744	m.flags_ = 0;
820	else if (action == UP_OBJ_FACE)	745	else if (action == UP_OBJ_FACE)
821	/* Nothing to do for that case */ ;	746	/* Nothing to do for that case */ ;
822	else	747	else
823	LOG (llevError, "update_object called with invalid action: %d\n", action);	748	LOG (llevError, "update_object called with invalid action: %d\n", action);
824		749
825	if (update_now)
826	{
827	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
828	update_position (op->map, op->x, op->y);
829	}
830
831	if (op->more != NULL)	750	if (op->more)
832	update_object (op->more, action);	751	update_object (op->more, action);
833	}
834
835	object::vector object::mortals;
836	object::vector object::objects; // not yet used
837	object *object::first;
838
839	void object::free_mortals ()
840	{
841	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
842	if ((*i)->refcnt)
843	++i; // further delay freeing
844	else
845	{
846	delete *i;
847	mortals.erase (i);
848	}
849	}	752	}
850		753
851	object::object ()	754	object::object ()
852	{	755	{
853	SET_FLAG (this, FLAG_REMOVED);	756	SET_FLAG (this, FLAG_REMOVED);
…		…
856	face = blank_face;	759	face = blank_face;
857	}	760	}
858		761
859	object::~object ()	762	object::~object ()
860	{	763	{
		764	unlink ();
		765
861	free_key_values (this);	766	free_key_values (this);
862	}	767	}
863		768
		769	static int object_count;
		770
864	void object::link ()	771	void object::link ()
865	{	772	{
		773	assert (!index);//D
		774	uuid = UUID::gen ();
866	count = ++ob_count;	775	count = ++object_count;
867	uuid = gen_uuid ();
868		776
869	prev = 0;	777	refcnt_inc ();
870	next = object::first;	778	objects.insert (this);
871
872	if (object::first)
873	object::first->prev = this;
874
875	object::first = this;
876	}	779	}
877		780
878	void object::unlink ()	781	void object::unlink ()
879	{	782	{
880	if (this == object::first)	783	if (!index)
881	object::first = next;	784	return;
882		785
883	/* Remove this object from the list of used objects */	786	objects.erase (this);
884	if (prev) prev->next = next;	787	refcnt_dec ();
885	if (next) next->prev = prev;	788	}
886		789
887	prev = 0;	790	void
888	next = 0;	791	object::activate ()
		792	{
		793	/* If already on active list, don't do anything */
		794	if (active)
		795	return;
		796
		797	if (has_active_speed ())
		798	actives.insert (this);
		799	}
		800
		801	void
		802	object::activate_recursive ()
		803	{
		804	activate ();
		805
		806	for (object *op = inv; op; op = op->below)
		807	op->activate_recursive ();
		808	}
		809
		810	/* This function removes object 'op' from the list of active
		811	* objects.
		812	* This should only be used for style maps or other such
		813	* reference maps where you don't want an object that isn't
		814	* in play chewing up cpu time getting processed.
		815	* The reverse of this is to call update_ob_speed, which
		816	* will do the right thing based on the speed of the object.
		817	*/
		818	void
		819	object::deactivate ()
		820	{
		821	/* If not on the active list, nothing needs to be done */
		822	if (!active)
		823	return;
		824
		825	actives.erase (this);
		826	}
		827
		828	void
		829	object::deactivate_recursive ()
		830	{
		831	for (object *op = inv; op; op = op->below)
		832	op->deactivate_recursive ();
		833
		834	deactivate ();
		835	}
		836
		837	void
		838	object::set_flag_inv (int flag, int value)
		839	{
		840	for (object *op = inv; op; op = op->below)
		841	{
		842	op->flag [flag] = value;
		843	op->set_flag_inv (flag, value);
		844	}
		845	}
		846
		847	/*
		848	* Remove and free all objects in the inventory of the given object.
		849	* object.c ?
		850	*/
		851	void
		852	object::destroy_inv (bool drop_to_ground)
		853	{
		854	// need to check first, because the checks below might segfault
		855	// as we might be on an invalid mapspace and crossfire code
		856	// is too buggy to ensure that the inventory is empty.
		857	// corollary: if you create arrows etc. with stuff in tis inventory,
		858	// cf will crash below with off-map x and y
		859	if (!inv)
		860	return;
		861
		862	/* Only if the space blocks everything do we not process -
		863	* if some form of movement is allowed, let objects
		864	* drop on that space.
		865	*/
		866	if (!drop_to_ground
		867	|| !map
		868	|| map->in_memory != MAP_IN_MEMORY
		869	|| map->nodrop
		870	|| ms ().move_block == MOVE_ALL)
		871	{
		872	while (inv)
		873	{
		874	inv->destroy_inv (drop_to_ground);
		875	inv->destroy ();
		876	}
		877	}
		878	else
		879	{ /* Put objects in inventory onto this space */
		880	while (inv)
		881	{
		882	object *op = inv;
		883
		884	if (op->flag [FLAG_STARTEQUIP]
		885	|| op->flag [FLAG_NO_DROP]
		886	|| op->type == RUNE
		887	|| op->type == TRAP
		888	|| op->flag [FLAG_IS_A_TEMPLATE]
		889	|| op->flag [FLAG_DESTROY_ON_DEATH])
		890	op->destroy ();
		891	else
		892	map->insert (op, x, y);
		893	}
		894	}
889	}	895	}
890		896
891	object *object::create ()	897	object *object::create ()
892	{	898	{
893	object *op = new object;	899	object *op = new object;
894	op->link ();	900	op->link ();
895	return op;	901	return op;
896	}	902	}
897		903
898	/*	904	void
899	* free_object() frees everything allocated by an object, removes	905	object::do_destroy ()
900	* it from the list of used objects, and puts it on the list of
901	* free objects. The IS_FREED() flag is set in the object.
902	* The object must have been removed by remove_ob() first for
903	* this function to succeed.
904	*
905	* If destroy_inventory is set, free inventory as well. Else drop items in
906	* inventory to the ground.
907	*/
908	void object::destroy (bool destroy_inventory)
909	{	906	{
910	if (QUERY_FLAG (this, FLAG_FREED))	907	attachable::do_destroy ();
911	return;
912		908
913	if (QUERY_FLAG (this, FLAG_FRIENDLY))	909	if (flag [FLAG_IS_LINKED])
		910	remove_button_link (this);
		911
		912	if (flag [FLAG_FRIENDLY])
914	remove_friendly_object (this);	913	remove_friendly_object (this);
915		914
916	if (!QUERY_FLAG (this, FLAG_REMOVED))	915	if (!flag [FLAG_REMOVED])
917	remove ();	916	remove ();
918		917
919	SET_FLAG (this, FLAG_FREED);	918	destroy_inv (true);
920		919
921	if (more)	920	deactivate ();
922	{	921	unlink ();
923	more->destroy (destroy_inventory);
924	more = 0;
925	}
926		922
927	if (inv)	923	flag [FLAG_FREED] = 1;
928	{
929	/* Only if the space blocks everything do we not process -
930	* if some form of movement is allowed, let objects
931	* drop on that space.
932	*/
933	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
934	{
935	object *op = inv;
936
937	while (op)
938	{
939	object *tmp = op->below;
940	op->destroy (destroy_inventory);
941	op = tmp;
942	}
943	}
944	else
945	{ /* Put objects in inventory onto this space */
946	object *op = inv;
947
948	while (op)
949	{
950	object *tmp = op->below;
951
952	op->remove ();
953
954	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
955	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
956	op->destroy ();
957	else
958	{
959	op->x = x;
960	op->y = y;
961	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
962	}
963
964	op = tmp;
965	}
966	}
967	}
968		924
969	// hack to ensure that freed objects still have a valid map	925	// hack to ensure that freed objects still have a valid map
970	{	926	{
971	static maptile *freed_map; // freed objects are moved here to avoid crashes	927	static maptile *freed_map; // freed objects are moved here to avoid crashes
972		928
973	if (!freed_map)	929	if (!freed_map)
974	{	930	{
975	freed_map = new maptile;	931	freed_map = new maptile;
976		932
		933	freed_map->path = "<freed objects map>";
977	freed_map->name = "/internal/freed_objects_map";	934	freed_map->name = "/internal/freed_objects_map";
978	freed_map->width = 3;	935	freed_map->width = 3;
979	freed_map->height = 3;	936	freed_map->height = 3;
		937	freed_map->nodrop = 1;
980		938
981	freed_map->allocate ();	939	freed_map->alloc ();
		940	freed_map->in_memory = MAP_IN_MEMORY;
982	}	941	}
983		942
984	map = freed_map;	943	map = freed_map;
985	x = 1;	944	x = 1;
986	y = 1;	945	y = 1;
987	}	946	}
988		947
		948	if (more)
		949	{
		950	more->destroy ();
		951	more = 0;
		952	}
		953
		954	head = 0;
		955
989	// clear those pointers that likely might have circular references to us	956	// clear those pointers that likely might cause circular references
990	owner = 0;	957	owner = 0;
991	enemy = 0;	958	enemy = 0;
992	attacked_by = 0;	959	attacked_by = 0;
		960	current_weapon = 0;
		961	}
993		962
994	// only relevant for players(?), but make sure of it anyways	963	void
995	contr = 0;	964	object::destroy (bool destroy_inventory)
		965	{
		966	if (destroyed ())
		967	return;
996		968
997	/* Remove object from the active list */	969	if (destroy_inventory)
998	speed = 0;	970	destroy_inv (false);
999	update_ob_speed (this);
1000		971
1001	unlink ();	972	if (is_head ())
		973	if (sound_destroy)
		974	play_sound (sound_destroy);
		975	else if (flag [FLAG_MONSTER])
		976	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
1002		977
1003	mortals.push_back (this);	978	attachable::destroy ();
1004	}	979	}
1005		980
1006	/*	981	/*
1007	* sub_weight() recursively (outwards) subtracts a number from the	982	* sub_weight() recursively (outwards) subtracts a number from the
1008	* weight of an object (and what is carried by it's environment(s)).	983	* weight of an object (and what is carried by it's environment(s)).
…		…
1024	* This function removes the object op from the linked list of objects	999	* This function removes the object op from the linked list of objects
1025	* which it is currently tied to. When this function is done, the	1000	* which it is currently tied to. When this function is done, the
1026	* object will have no environment. If the object previously had an	1001	* object will have no environment. If the object previously had an
1027	* environment, the x and y coordinates will be updated to	1002	* environment, the x and y coordinates will be updated to
1028	* the previous environment.	1003	* the previous environment.
1029	* Beware: This function is called from the editor as well!
1030	*/	1004	*/
1031	void	1005	void
1032	object::remove ()	1006	object::do_remove ()
1033	{	1007	{
1034	object *tmp, *last = 0;	1008	object *tmp, *last = 0;
1035	object *otmp;	1009	object *otmp;
1036		1010
1037	int check_walk_off;
1038
1039	if (QUERY_FLAG (this, FLAG_REMOVED))	1011	if (QUERY_FLAG (this, FLAG_REMOVED))
1040	return;	1012	return;
1041		1013
1042	SET_FLAG (this, FLAG_REMOVED);	1014	SET_FLAG (this, FLAG_REMOVED);
		1015	INVOKE_OBJECT (REMOVE, this);
1043		1016
1044	if (more)	1017	if (more)
1045	more->remove ();	1018	more->remove ();
1046		1019
1047	/*	1020	/*
…		…
1057		1030
1058	/* NO_FIX_PLAYER is set when a great many changes are being	1031	/* NO_FIX_PLAYER is set when a great many changes are being
1059	* made to players inventory. If set, avoiding the call	1032	* made to players inventory. If set, avoiding the call
1060	* to save cpu time.	1033	* to save cpu time.
1061	*/	1034	*/
1062	if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1035	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1063	fix_player (otmp);	1036	otmp->update_stats ();
1064		1037
1065	if (above != NULL)	1038	if (above)
1066	above->below = below;	1039	above->below = below;
1067	else	1040	else
1068	env->inv = below;	1041	env->inv = below;
1069		1042
1070	if (below != NULL)	1043	if (below)
1071	below->above = above;	1044	below->above = above;
1072		1045
1073	/* we set up values so that it could be inserted into	1046	/* we set up values so that it could be inserted into
1074	* the map, but we don't actually do that - it is up	1047	* the map, but we don't actually do that - it is up
1075	* to the caller to decide what we want to do.	1048	* to the caller to decide what we want to do.
…		…
1079	above = 0, below = 0;	1052	above = 0, below = 0;
1080	env = 0;	1053	env = 0;
1081	}	1054	}
1082	else if (map)	1055	else if (map)
1083	{	1056	{
1084	/* Re did the following section of code - it looks like it had	1057	if (type == PLAYER)
1085	* lots of logic for things we no longer care about
1086	*/	1058	{
		1059	// leaving a spot always closes any open container on the ground
		1060	if (container && !container->env)
		1061	// this causes spurious floorbox updates, but it ensures
		1062	// that the CLOSE event is being sent.
		1063	close_container ();
		1064
		1065	--map->players;
		1066	map->touch ();
		1067	}
		1068
		1069	map->dirty = true;
		1070	mapspace &ms = this->ms ();
1087		1071
1088	/* link the object above us */	1072	/* link the object above us */
1089	if (above)	1073	if (above)
1090	above->below = below;	1074	above->below = below;
1091	else	1075	else
1092	SET_MAP_TOP (map, x, y, below); /* we were top, set new top */	1076	ms.top = below; /* we were top, set new top */
1093		1077
1094	/* Relink the object below us, if there is one */	1078	/* Relink the object below us, if there is one */
1095	if (below)	1079	if (below)
1096	below->above = above;	1080	below->above = above;
1097	else	1081	else
…		…
1099	/* Nothing below, which means we need to relink map object for this space	1083	/* Nothing below, which means we need to relink map object for this space
1100	* use translated coordinates in case some oddness with map tiling is	1084	* use translated coordinates in case some oddness with map tiling is
1101	* evident	1085	* evident
1102	*/	1086	*/
1103	if (GET_MAP_OB (map, x, y) != this)	1087	if (GET_MAP_OB (map, x, y) != this)
1104	{
1105	char *dump = dump_object (this);
1106	LOG (llevError,
1107	"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);	1088	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1108	free (dump);
1109	dump = dump_object (GET_MAP_OB (map, x, y));
1110	LOG (llevError, "%s\n", dump);
1111	free (dump);
1112	}
1113		1089
1114	SET_MAP_OB (map, x, y, above); /* goes on above it. */	1090	ms.bot = above; /* goes on above it. */
1115	}	1091	}
1116		1092
1117	above = 0;	1093	above = 0;
1118	below = 0;	1094	below = 0;
1119		1095
1120	if (map->in_memory == MAP_SAVING)	1096	if (map->in_memory == MAP_SAVING)
1121	return;	1097	return;
1122		1098
1123	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	1099	int check_walk_off = !flag [FLAG_NO_APPLY];
1124		1100
		1101	if (object *pl = ms.player ())
		1102	{
		1103	if (pl->container == this)
		1104	/* If a container that the player is currently using somehow gets
		1105	* removed (most likely destroyed), update the player view
		1106	* appropriately.
		1107	*/
		1108	pl->close_container ();
		1109
		1110	pl->contr->ns->floorbox_update ();
		1111	}
		1112
1125	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1113	for (tmp = ms.bot; tmp; tmp = tmp->above)
1126	{	1114	{
1127	/* No point updating the players look faces if he is the object	1115	/* No point updating the players look faces if he is the object
1128	* being removed.	1116	* being removed.
1129	*/	1117	*/
1130		1118
1131	if (tmp->type == PLAYER && tmp != this)
1132	{
1133	/* If a container that the player is currently using somehow gets
1134	* removed (most likely destroyed), update the player view
1135	* appropriately.
1136	*/
1137	if (tmp->container == this)
1138	{
1139	CLEAR_FLAG (this, FLAG_APPLIED);
1140	tmp->container = 0;
1141	}
1142
1143	tmp->contr->socket.update_look = 1;
1144	}
1145
1146	/* See if player moving off should effect something */	1119	/* See if object moving off should effect something */
1147	if (check_walk_off	1120	if (check_walk_off
1148	&& ((move_type & tmp->move_off)	1121	&& ((move_type & tmp->move_off)
1149	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1122	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1150	{	1123	{
1151	move_apply (tmp, this, 0);	1124	move_apply (tmp, this, 0);
1152		1125
1153	if (destroyed ())	1126	if (destroyed ())
1154	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1127	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1155	}	1128	}
1156		1129
1157	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1158
1159	if (tmp->above == tmp)
1160	tmp->above = 0;
1161
1162	last = tmp;	1130	last = tmp;
1163	}	1131	}
1164		1132
1165	/* last == NULL of there are no objects on this space */	1133	/* last == NULL if there are no objects on this space */
		1134	//TODO: this makes little sense, why only update the topmost object?
1166	if (!last)	1135	if (!last)
1167	{	1136	map->at (x, y).flags_ = 0;
1168	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1169	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1170	* those out anyways, and if there are any flags set right now, they won't
1171	* be correct anyways.
1172	*/
1173	SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1174	update_position (map, x, y);
1175	}
1176	else	1137	else
1177	update_object (last, UP_OBJ_REMOVE);	1138	update_object (last, UP_OBJ_REMOVE);
1178		1139
1179	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1140	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1180	update_all_los (map, x, y);	1141	update_all_los (map, x, y);
1181	}	1142	}
1182	}	1143	}
1183		1144
1184	/*	1145	/*
…		…
1193	merge_ob (object *op, object *top)	1154	merge_ob (object *op, object *top)
1194	{	1155	{
1195	if (!op->nrof)	1156	if (!op->nrof)
1196	return 0;	1157	return 0;
1197		1158
1198	if (top == NULL)	1159	if (!top)
1199	for (top = op; top != NULL && top->above != NULL; top = top->above);	1160	for (top = op; top && top->above; top = top->above)
		1161	;
1200		1162
1201	for (; top != NULL; top = top->below)	1163	for (; top; top = top->below)
1202	{	1164	{
1203	if (top == op)	1165	if (top == op)
1204	continue;	1166	continue;
1205	if (CAN_MERGE (op, top))	1167
		1168	if (object::can_merge (op, top))
1206	{	1169	{
1207	top->nrof += op->nrof;	1170	top->nrof += op->nrof;
1208		1171
1209	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1172	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1210	op->weight = 0; /* Don't want any adjustements now */	1173	op->weight = 0; /* Don't want any adjustements now */
…		…
1214	}	1177	}
1215		1178
1216	return 0;	1179	return 0;
1217	}	1180	}
1218		1181
		1182	void
		1183	object::expand_tail ()
		1184	{
		1185	if (more)
		1186	return;
		1187
		1188	object *prev = this;
		1189
		1190	for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
		1191	{
		1192	object *op = arch_to_object (at);
		1193
		1194	op->name = name;
		1195	op->name_pl = name_pl;
		1196	op->title = title;
		1197
		1198	op->head = this;
		1199	prev->more = op;
		1200
		1201	prev = op;
		1202	}
		1203	}
		1204
1219	/*	1205	/*
1220	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1206	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1221	* job preparing multi-part monsters	1207	* job preparing multi-part monsters.
1222	*/	1208	*/
1223	object *	1209	object *
1224	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1210	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1225	{	1211	{
1226	object *tmp;
1227
1228	if (op->head)
1229	op = op->head;
1230
1231	for (tmp = op; tmp; tmp = tmp->more)	1212	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1232	{	1213	{
1233	tmp->x = x + tmp->arch->clone.x;	1214	tmp->x = x + tmp->arch->x;
1234	tmp->y = y + tmp->arch->clone.y;	1215	tmp->y = y + tmp->arch->y;
1235	}	1216	}
1236		1217
1237	return insert_ob_in_map (op, m, originator, flag);	1218	return insert_ob_in_map (op, m, originator, flag);
1238	}	1219	}
1239		1220
…		…
1255	* Return value:	1236	* Return value:
1256	* new object if 'op' was merged with other object	1237	* new object if 'op' was merged with other object
1257	* NULL if 'op' was destroyed	1238	* NULL if 'op' was destroyed
1258	* just 'op' otherwise	1239	* just 'op' otherwise
1259	*/	1240	*/
1260
1261	object *	1241	object *
1262	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1242	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1263	{	1243	{
		1244	assert (!op->flag [FLAG_FREED]);
		1245
1264	object *tmp, *top, *floor = NULL;	1246	object *top, *floor = NULL;
1265	sint16 x, y;
1266		1247
1267	if (QUERY_FLAG (op, FLAG_FREED))	1248	op->remove ();
1268	{
1269	LOG (llevError, "Trying to insert freed object!\n");
1270	return NULL;
1271	}
1272
1273	if (m == NULL)
1274	{
1275	char *dump = dump_object (op);
1276	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1277	free (dump);
1278	return op;
1279	}
1280
1281	if (out_of_map (m, op->x, op->y))
1282	{
1283	char *dump = dump_object (op);
1284	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1285	#ifdef MANY_CORES
1286	/* Better to catch this here, as otherwise the next use of this object
1287	* is likely to cause a crash. Better to find out where it is getting
1288	* improperly inserted.
1289	*/
1290	abort ();
1291	#endif
1292	free (dump);
1293	return op;
1294	}
1295
1296	if (!QUERY_FLAG (op, FLAG_REMOVED))
1297	{
1298	char *dump = dump_object (op);
1299	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1300	free (dump);
1301	return op;
1302	}
1303
1304	if (op->more != NULL)
1305	{
1306	/* The part may be on a different map. */
1307
1308	object *more = op->more;
1309
1310	/* We really need the caller to normalize coordinates - if
1311	* we set the map, that doesn't work if the location is within
1312	* a map and this is straddling an edge. So only if coordinate
1313	* is clear wrong do we normalize it.
1314	*/
1315	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1316	more->map = get_map_from_coord (m, &more->x, &more->y);
1317	else if (!more->map)
1318	{
1319	/* For backwards compatibility - when not dealing with tiled maps,
1320	* more->map should always point to the parent.
1321	*/
1322	more->map = m;
1323	}
1324
1325	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1326	{
1327	if (!op->head)
1328	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1329
1330	return NULL;
1331	}
1332	}
1333
1334	CLEAR_FLAG (op, FLAG_REMOVED);
1335		1249
1336	/* Ideally, the caller figures this out. However, it complicates a lot	1250	/* Ideally, the caller figures this out. However, it complicates a lot
1337	* of areas of callers (eg, anything that uses find_free_spot would now	1251	* of areas of callers (eg, anything that uses find_free_spot would now
1338	* need extra work	1252	* need extra work
1339	*/	1253	*/
1340	op->map = get_map_from_coord (m, &op->x, &op->y);	1254	if (!xy_normalise (m, op->x, op->y))
1341	x = op->x;	1255	{
1342	y = op->y;	1256	op->destroy ();
		1257	return 0;
		1258	}
		1259
		1260	if (object *more = op->more)
		1261	if (!insert_ob_in_map (more, m, originator, flag))
		1262	return 0;
		1263
		1264	CLEAR_FLAG (op, FLAG_REMOVED);
		1265
		1266	op->map = m;
		1267	mapspace &ms = op->ms ();
1343		1268
1344	/* this has to be done after we translate the coordinates.	1269	/* this has to be done after we translate the coordinates.
1345	*/	1270	*/
1346	if (op->nrof && !(flag & INS_NO_MERGE))	1271	if (op->nrof && !(flag & INS_NO_MERGE))
1347	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1272	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1348	if (CAN_MERGE (op, tmp))	1273	if (object::can_merge (op, tmp))
1349	{	1274	{
1350	op->nrof += tmp->nrof;	1275	op->nrof += tmp->nrof;
1351	tmp->destroy ();	1276	tmp->destroy ();
1352	}	1277	}
1353		1278
…		…
1369	op->below = originator->below;	1294	op->below = originator->below;
1370		1295
1371	if (op->below)	1296	if (op->below)
1372	op->below->above = op;	1297	op->below->above = op;
1373	else	1298	else
1374	SET_MAP_OB (op->map, op->x, op->y, op);	1299	ms.bot = op;
1375		1300
1376	/* since *below* originator, no need to update top */	1301	/* since *below* originator, no need to update top */
1377	originator->below = op;	1302	originator->below = op;
1378	}	1303	}
1379	else	1304	else
1380	{	1305	{
		1306	top = ms.bot;
		1307
1381	/* If there are other objects, then */	1308	/* If there are other objects, then */
1382	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1309	if (top)
1383	{	1310	{
1384	object *last = NULL;	1311	object *last = 0;
1385		1312
1386	/*	1313	/*
1387	* If there are multiple objects on this space, we do some trickier handling.	1314	* If there are multiple objects on this space, we do some trickier handling.
1388	* We've already dealt with merging if appropriate.	1315	* We've already dealt with merging if appropriate.
1389	* Generally, we want to put the new object on top. But if	1316	* Generally, we want to put the new object on top. But if
…		…
1393	* once we get to them. This reduces the need to traverse over all of	1320	* once we get to them. This reduces the need to traverse over all of
1394	* them when adding another one - this saves quite a bit of cpu time	1321	* them when adding another one - this saves quite a bit of cpu time
1395	* when lots of spells are cast in one area. Currently, it is presumed	1322	* when lots of spells are cast in one area. Currently, it is presumed
1396	* that flying non pickable objects are spell objects.	1323	* that flying non pickable objects are spell objects.
1397	*/	1324	*/
1398		1325	for (top = ms.bot; top; top = top->above)
1399	while (top != NULL)
1400	{	1326	{
1401	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1327	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1402	floor = top;	1328	floor = top;
1403		1329
1404	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1330	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1407	top = top->below;	1333	top = top->below;
1408	break;	1334	break;
1409	}	1335	}
1410		1336
1411	last = top;	1337	last = top;
1412	top = top->above;
1413	}	1338	}
1414		1339
1415	/* Don't want top to be NULL, so set it to the last valid object */	1340	/* Don't want top to be NULL, so set it to the last valid object */
1416	top = last;	1341	top = last;
1417		1342
…		…
1419	* looks like instead of lots of conditions here.	1344	* looks like instead of lots of conditions here.
1420	* makes things faster, and effectively the same result.	1345	* makes things faster, and effectively the same result.
1421	*/	1346	*/
1422		1347
1423	/* Have object 'fall below' other objects that block view.	1348	/* Have object 'fall below' other objects that block view.
1424	* Unless those objects are exits, type 66	1349	* Unless those objects are exits.
1425	* If INS_ON_TOP is used, don't do this processing	1350	* If INS_ON_TOP is used, don't do this processing
1426	* Need to find the object that in fact blocks view, otherwise	1351	* Need to find the object that in fact blocks view, otherwise
1427	* stacking is a bit odd.	1352	* stacking is a bit odd.
1428	*/	1353	*/
1429	if (!(flag & INS_ON_TOP) &&	1354	if (!(flag & INS_ON_TOP)
1430	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1355	&& ms.flags () & P_BLOCKSVIEW
		1356	&& (op->face && !faces [op->face].visibility))
1431	{	1357	{
1432	for (last = top; last != floor; last = last->below)	1358	for (last = top; last != floor; last = last->below)
1433	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1359	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1434	break;	1360	break;
		1361
1435	/* Check to see if we found the object that blocks view,	1362	/* Check to see if we found the object that blocks view,
1436	* and make sure we have a below pointer for it so that	1363	* and make sure we have a below pointer for it so that
1437	* we can get inserted below this one, which requires we	1364	* we can get inserted below this one, which requires we
1438	* set top to the object below us.	1365	* set top to the object below us.
1439	*/	1366	*/
1440	if (last && last->below && last != floor)	1367	if (last && last->below && last != floor)
1441	top = last->below;	1368	top = last->below;
1442	}	1369	}
1443	} /* If objects on this space */	1370	} /* If objects on this space */
1444		1371
1445	if (flag & INS_MAP_LOAD)
1446	top = GET_MAP_TOP (op->map, op->x, op->y);
1447
1448	if (flag & INS_ABOVE_FLOOR_ONLY)	1372	if (flag & INS_ABOVE_FLOOR_ONLY)
1449	top = floor;	1373	top = floor;
1450		1374
1451	/* Top is the object that our object (op) is going to get inserted above.	1375	/* Top is the object that our object (op) is going to get inserted above.
1452	*/	1376	*/
1453		1377
1454	/* First object on this space */	1378	/* First object on this space */
1455	if (!top)	1379	if (!top)
1456	{	1380	{
1457	op->above = GET_MAP_OB (op->map, op->x, op->y);	1381	op->above = ms.bot;
1458		1382
1459	if (op->above)	1383	if (op->above)
1460	op->above->below = op;	1384	op->above->below = op;
1461		1385
1462	op->below = NULL;	1386	op->below = 0;
1463	SET_MAP_OB (op->map, op->x, op->y, op);	1387	ms.bot = op;
1464	}	1388	}
1465	else	1389	else
1466	{ /* get inserted into the stack above top */	1390	{ /* get inserted into the stack above top */
1467	op->above = top->above;	1391	op->above = top->above;
1468		1392
…		…
1471		1395
1472	op->below = top;	1396	op->below = top;
1473	top->above = op;	1397	top->above = op;
1474	}	1398	}
1475		1399
1476	if (op->above == NULL)	1400	if (!op->above)
1477	SET_MAP_TOP (op->map, op->x, op->y, op);	1401	ms.top = op;
1478	} /* else not INS_BELOW_ORIGINATOR */	1402	} /* else not INS_BELOW_ORIGINATOR */
1479		1403
1480	if (op->type == PLAYER)	1404	if (op->type == PLAYER)
		1405	{
1481	op->contr->do_los = 1;	1406	op->contr->do_los = 1;
		1407	++op->map->players;
		1408	op->map->touch ();
		1409	}
1482		1410
1483	/* If we have a floor, we know the player, if any, will be above	1411	op->map->dirty = true;
1484	* it, so save a few ticks and start from there.	1412
1485	*/	1413	if (object *pl = ms.player ())
1486	if (!(flag & INS_MAP_LOAD))	1414	pl->contr->ns->floorbox_update ();
1487	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1488	if (tmp->type == PLAYER)
1489	tmp->contr->socket.update_look = 1;
1490		1415
1491	/* If this object glows, it may affect lighting conditions that are	1416	/* If this object glows, it may affect lighting conditions that are
1492	* visible to others on this map. But update_all_los is really	1417	* visible to others on this map. But update_all_los is really
1493	* an inefficient way to do this, as it means los for all players	1418	* an inefficient way to do this, as it means los for all players
1494	* on the map will get recalculated. The players could very well	1419	* on the map will get recalculated. The players could very well
1495	* be far away from this change and not affected in any way -	1420	* be far away from this change and not affected in any way -
1496	* this should get redone to only look for players within range,	1421	* this should get redone to only look for players within range,
1497	* or just updating the P_NEED_UPDATE for spaces within this area	1422	* or just updating the P_UPTODATE for spaces within this area
1498	* of effect may be sufficient.	1423	* of effect may be sufficient.
1499	*/	1424	*/
1500	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1425	if (op->map->darkness && (op->glow_radius != 0))
1501	update_all_los (op->map, op->x, op->y);	1426	update_all_los (op->map, op->x, op->y);
1502		1427
1503	/* updates flags (blocked, alive, no magic, etc) for this map space */	1428	/* updates flags (blocked, alive, no magic, etc) for this map space */
1504	update_object (op, UP_OBJ_INSERT);	1429	update_object (op, UP_OBJ_INSERT);
1505		1430
		1431	INVOKE_OBJECT (INSERT, op);
		1432
1506	/* Don't know if moving this to the end will break anything. However,	1433	/* Don't know if moving this to the end will break anything. However,
1507	* we want to have update_look set above before calling this.	1434	* we want to have floorbox_update called before calling this.
1508	*	1435	*
1509	* check_move_on() must be after this because code called from	1436	* check_move_on() must be after this because code called from
1510	* check_move_on() depends on correct map flags (so functions like	1437	* check_move_on() depends on correct map flags (so functions like
1511	* blocked() and wall() work properly), and these flags are updated by	1438	* blocked() and wall() work properly), and these flags are updated by
1512	* update_object().	1439	* update_object().
1513	*/	1440	*/
1514		1441
1515	/* if this is not the head or flag has been passed, don't check walk on status */	1442	/* if this is not the head or flag has been passed, don't check walk on status */
1516	if (!(flag & INS_NO_WALK_ON) && !op->head)	1443	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1517	{	1444	{
1518	if (check_move_on (op, originator))	1445	if (check_move_on (op, originator))
1519	return NULL;	1446	return 0;
1520		1447
1521	/* If we are a multi part object, lets work our way through the check	1448	/* If we are a multi part object, lets work our way through the check
1522	* walk on's.	1449	* walk on's.
1523	*/	1450	*/
1524	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1451	for (object *tmp = op->more; tmp; tmp = tmp->more)
1525	if (check_move_on (tmp, originator))	1452	if (check_move_on (tmp, originator))
1526	return NULL;	1453	return 0;
1527	}	1454	}
1528		1455
1529	return op;	1456	return op;
1530	}	1457	}
1531		1458
1532	/* this function inserts an object in the map, but if it	1459	/* this function inserts an object in the map, but if it
1533	* finds an object of its own type, it'll remove that one first.	1460	* finds an object of its own type, it'll remove that one first.
1534	* op is the object to insert it under: supplies x and the map.	1461	* op is the object to insert it under: supplies x and the map.
1535	*/	1462	*/
1536	void	1463	void
1537	replace_insert_ob_in_map (const char *arch_string, object *op)	1464	replace_insert_ob_in_map (const char *arch_string, object *op)
1538	{	1465	{
1539	object *	1466	object *tmp, *tmp1;
1540	tmp;
1541	object *
1542	tmp1;
1543		1467
1544	/* first search for itself and remove any old instances */	1468	/* first search for itself and remove any old instances */
1545		1469
1546	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1470	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1547	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1471	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1548	tmp->destroy ();	1472	tmp->destroy ();
1549		1473
1550	tmp1 = arch_to_object (archetype::find (arch_string));	1474	tmp1 = arch_to_object (archetype::find (arch_string));
1551		1475
1552	tmp1->x = op->x;	1476	tmp1->x = op->x;
1553	tmp1->y = op->y;	1477	tmp1->y = op->y;
1554	insert_ob_in_map (tmp1, op->map, op, 0);	1478	insert_ob_in_map (tmp1, op->map, op, 0);
		1479	}
		1480
		1481	object *
		1482	object::insert_at (object *where, object *originator, int flags)
		1483	{
		1484	if (where->env)
		1485	return where->env->insert (this);
		1486	else
		1487	return where->map->insert (this, where->x, where->y, originator, flags);
1555	}	1488	}
1556		1489
1557	/*	1490	/*
1558	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1491	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1559	* is returned contains nr objects, and the remaining parts contains	1492	* is returned contains nr objects, and the remaining parts contains
1560	* the rest (or is removed and freed if that number is 0).	1493	* the rest (or is removed and freed if that number is 0).
1561	* On failure, NULL is returned, and the reason put into the	1494	* On failure, NULL is returned, and the reason put into the
1562	* global static errmsg array.	1495	* global static errmsg array.
1563	*/	1496	*/
1564
1565	object *	1497	object *
1566	get_split_ob (object *orig_ob, uint32 nr)	1498	get_split_ob (object *orig_ob, uint32 nr)
1567	{	1499	{
1568	object *newob;	1500	object *newob;
1569	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1501	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1600	* the amount of an object. If the amount reaches 0, the object	1532	* the amount of an object. If the amount reaches 0, the object
1601	* is subsequently removed and freed.	1533	* is subsequently removed and freed.
1602	*	1534	*
1603	* Return value: 'op' if something is left, NULL if the amount reached 0	1535	* Return value: 'op' if something is left, NULL if the amount reached 0
1604	*/	1536	*/
1605
1606	object *	1537	object *
1607	decrease_ob_nr (object *op, uint32 i)	1538	decrease_ob_nr (object *op, uint32 i)
1608	{	1539	{
1609	object *tmp;	1540	object *tmp;
1610	player *pl;
1611		1541
1612	if (i == 0) /* objects with op->nrof require this check */	1542	if (i == 0) /* objects with op->nrof require this check */
1613	return op;	1543	return op;
1614		1544
1615	if (i > op->nrof)	1545	if (i > op->nrof)
1616	i = op->nrof;	1546	i = op->nrof;
1617		1547
1618	if (QUERY_FLAG (op, FLAG_REMOVED))	1548	if (QUERY_FLAG (op, FLAG_REMOVED))
1619	op->nrof -= i;	1549	op->nrof -= i;
1620	else if (op->env != NULL)	1550	else if (op->env)
1621	{	1551	{
1622	/* is this object in the players inventory, or sub container	1552	/* is this object in the players inventory, or sub container
1623	* therein?	1553	* therein?
1624	*/	1554	*/
1625	tmp = is_player_inv (op->env);	1555	tmp = op->in_player ();
1626	/* nope. Is this a container the player has opened?	1556	/* nope. Is this a container the player has opened?
1627	* If so, set tmp to that player.	1557	* If so, set tmp to that player.
1628	* IMO, searching through all the players will mostly	1558	* IMO, searching through all the players will mostly
1629	* likely be quicker than following op->env to the map,	1559	* likely be quicker than following op->env to the map,
1630	* and then searching the map for a player.	1560	* and then searching the map for a player.
1631	*/	1561	*/
1632	if (!tmp)	1562	if (!tmp)
1633	{	1563	for_all_players (pl)
1634	for (pl = first_player; pl; pl = pl->next)
1635	if (pl->ob->container == op->env)	1564	if (pl->ob->container == op->env)
		1565	{
		1566	tmp = pl->ob;
1636	break;	1567	break;
1637	if (pl)
1638	tmp = pl->ob;
1639	else
1640	tmp = NULL;
1641	}	1568	}
1642		1569
1643	if (i < op->nrof)	1570	if (i < op->nrof)
1644	{	1571	{
1645	sub_weight (op->env, op->weight * i);	1572	sub_weight (op->env, op->weight * i);
1646	op->nrof -= i;	1573	op->nrof -= i;
1647	if (tmp)	1574	if (tmp)
1648	{
1649	esrv_send_item (tmp, op);	1575	esrv_send_item (tmp, op);
1650	}
1651	}	1576	}
1652	else	1577	else
1653	{	1578	{
1654	op->remove ();	1579	op->remove ();
1655	op->nrof = 0;	1580	op->nrof = 0;
1656	if (tmp)	1581	if (tmp)
1657	{
1658	esrv_del_item (tmp->contr, op->count);	1582	esrv_del_item (tmp->contr, op->count);
1659	}
1660	}	1583	}
1661	}	1584	}
1662	else	1585	else
1663	{	1586	{
1664	object *above = op->above;	1587	object *above = op->above;
…		…
1670	op->remove ();	1593	op->remove ();
1671	op->nrof = 0;	1594	op->nrof = 0;
1672	}	1595	}
1673		1596
1674	/* Since we just removed op, op->above is null */	1597	/* Since we just removed op, op->above is null */
1675	for (tmp = above; tmp != NULL; tmp = tmp->above)	1598	for (tmp = above; tmp; tmp = tmp->above)
1676	if (tmp->type == PLAYER)	1599	if (tmp->type == PLAYER)
1677	{	1600	{
1678	if (op->nrof)	1601	if (op->nrof)
1679	esrv_send_item (tmp, op);	1602	esrv_send_item (tmp, op);
1680	else	1603	else
…		…
1685	if (op->nrof)	1608	if (op->nrof)
1686	return op;	1609	return op;
1687	else	1610	else
1688	{	1611	{
1689	op->destroy ();	1612	op->destroy ();
1690	return NULL;	1613	return 0;
1691	}	1614	}
1692	}	1615	}
1693		1616
1694	/*	1617	/*
1695	* add_weight(object, weight) adds the specified weight to an object,	1618	* add_weight(object, weight) adds the specified weight to an object,
1696	* and also updates how much the environment(s) is/are carrying.	1619	* and also updates how much the environment(s) is/are carrying.
1697	*/	1620	*/
1698
1699	void	1621	void
1700	add_weight (object *op, signed long weight)	1622	add_weight (object *op, signed long weight)
1701	{	1623	{
1702	while (op != NULL)	1624	while (op != NULL)
1703	{	1625	{
…		…
1718	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1640	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1719	free (dump);	1641	free (dump);
1720	return op;	1642	return op;
1721	}	1643	}
1722		1644
1723	if (where->head)	1645	if (where->head_ () != where)
1724	{	1646	{
1725	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1647	LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1726	where = where->head;	1648	where = where->head;
1727	}	1649	}
1728		1650
1729	return where->insert (op);	1651	return where->insert (op);
1730	}	1652	}
…		…
1735	* inside the object environment.	1657	* inside the object environment.
1736	*	1658	*
1737	* The function returns now pointer to inserted item, and return value can	1659	* The function returns now pointer to inserted item, and return value can
1738	* be != op, if items are merged. -Tero	1660	* be != op, if items are merged. -Tero
1739	*/	1661	*/
1740
1741	object *	1662	object *
1742	object::insert (object *op)	1663	object::insert (object *op)
1743	{	1664	{
1744	object *tmp, *otmp;
1745
1746	if (!QUERY_FLAG (op, FLAG_REMOVED))	1665	if (!QUERY_FLAG (op, FLAG_REMOVED))
1747	op->remove ();	1666	op->remove ();
1748		1667
1749	if (op->more)	1668	if (op->more)
1750	{	1669	{
…		…
1752	return op;	1671	return op;
1753	}	1672	}
1754		1673
1755	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1674	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1756	CLEAR_FLAG (op, FLAG_REMOVED);	1675	CLEAR_FLAG (op, FLAG_REMOVED);
		1676
1757	if (op->nrof)	1677	if (op->nrof)
1758	{	1678	{
1759	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1679	for (object *tmp = inv; tmp; tmp = tmp->below)
1760	if (CAN_MERGE (tmp, op))	1680	if (object::can_merge (tmp, op))
1761	{	1681	{
1762	/* return the original object and remove inserted object	1682	/* return the original object and remove inserted object
1763	(client needs the original object) */	1683	(client needs the original object) */
1764	tmp->nrof += op->nrof;	1684	tmp->nrof += op->nrof;
1765	/* Weight handling gets pretty funky. Since we are adding to	1685	/* Weight handling gets pretty funky. Since we are adding to
…		…
1783	add_weight (this, op->weight * op->nrof);	1703	add_weight (this, op->weight * op->nrof);
1784	}	1704	}
1785	else	1705	else
1786	add_weight (this, (op->weight + op->carrying));	1706	add_weight (this, (op->weight + op->carrying));
1787		1707
1788	otmp = is_player_inv (this);	1708	if (object *otmp = this->in_player ())
1789	if (otmp && otmp->contr)
1790	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1709	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1791	fix_player (otmp);	1710	otmp->update_stats ();
1792		1711
		1712	op->owner = 0; // its his/hers now. period.
1793	op->map = NULL;	1713	op->map = 0;
1794	op->env = this;	1714	op->env = this;
1795	op->above = NULL;	1715	op->above = 0;
1796	op->below = NULL;	1716	op->below = 0;
1797	op->x = 0, op->y = 0;	1717	op->x = op->y = 0;
1798		1718
1799	/* reset the light list and los of the players on the map */	1719	/* reset the light list and los of the players on the map */
1800	if ((op->glow_radius != 0) && map)	1720	if (op->glow_radius && map)
1801	{	1721	{
1802	#ifdef DEBUG_LIGHTS	1722	#ifdef DEBUG_LIGHTS
1803	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1723	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1804	#endif /* DEBUG_LIGHTS */	1724	#endif /* DEBUG_LIGHTS */
1805	if (MAP_DARKNESS (map))	1725	if (map->darkness)
1806	update_all_los (map, x, y);	1726	update_all_los (map, x, y);
1807	}	1727	}
1808		1728
1809	/* Client has no idea of ordering so lets not bother ordering it here.	1729	/* Client has no idea of ordering so lets not bother ordering it here.
1810	* It sure simplifies this function...	1730	* It sure simplifies this function...
…		…
1815	{	1735	{
1816	op->below = inv;	1736	op->below = inv;
1817	op->below->above = op;	1737	op->below->above = op;
1818	inv = op;	1738	inv = op;
1819	}	1739	}
		1740
		1741	INVOKE_OBJECT (INSERT, this);
1820		1742
1821	return op;	1743	return op;
1822	}	1744	}
1823		1745
1824	/*	1746	/*
…		…
1839	*	1761	*
1840	* MSW 2001-07-08: Check all objects on space, not just those below	1762	* MSW 2001-07-08: Check all objects on space, not just those below
1841	* object being inserted. insert_ob_in_map may not put new objects	1763	* object being inserted. insert_ob_in_map may not put new objects
1842	* on top.	1764	* on top.
1843	*/	1765	*/
1844
1845	int	1766	int
1846	check_move_on (object *op, object *originator)	1767	check_move_on (object *op, object *originator)
1847	{	1768	{
1848	object *tmp;	1769	object *tmp;
1849	maptile *m = op->map;	1770	maptile *m = op->map;
…		…
1876		1797
1877	/* The objects have to be checked from top to bottom.	1798	/* The objects have to be checked from top to bottom.
1878	* Hence, we first go to the top:	1799	* Hence, we first go to the top:
1879	*/	1800	*/
1880		1801
1881	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1802	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1882	{	1803	{
1883	/* Trim the search when we find the first other spell effect	1804	/* Trim the search when we find the first other spell effect
1884	* this helps performance so that if a space has 50 spell objects,	1805	* this helps performance so that if a space has 50 spell objects,
1885	* we don't need to check all of them.	1806	* we don't need to check all of them.
1886	*/	1807	*/
…		…
1904	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1825	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1905	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1826	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1906	{	1827	{
1907		1828
1908	float	1829	float
1909	diff = tmp->move_slow_penalty * FABS (op->speed);	1830	diff = tmp->move_slow_penalty * fabs (op->speed);
1910		1831
1911	if (op->type == PLAYER)	1832	if (op->type == PLAYER)
1912	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1833	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1913	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1834	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1914	diff /= 4.0;	1835	diff /= 4.0;
…		…
1941	/*	1862	/*
1942	* present_arch(arch, map, x, y) searches for any objects with	1863	* present_arch(arch, map, x, y) searches for any objects with
1943	* a matching archetype at the given map and coordinates.	1864	* a matching archetype at the given map and coordinates.
1944	* The first matching object is returned, or NULL if none.	1865	* The first matching object is returned, or NULL if none.
1945	*/	1866	*/
1946
1947	object *	1867	object *
1948	present_arch (const archetype *at, maptile *m, int x, int y)	1868	present_arch (const archetype *at, maptile *m, int x, int y)
1949	{	1869	{
1950	object *
1951	tmp;
1952
1953	if (m == NULL || out_of_map (m, x, y))	1870	if (!m || out_of_map (m, x, y))
1954	{	1871	{
1955	LOG (llevError, "Present_arch called outside map.\n");	1872	LOG (llevError, "Present_arch called outside map.\n");
1956	return NULL;	1873	return NULL;
1957	}	1874	}
1958	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1875
		1876	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1959	if (tmp->arch == at)	1877	if (tmp->arch == at)
1960	return tmp;	1878	return tmp;
		1879
1961	return NULL;	1880	return NULL;
1962	}	1881	}
1963		1882
1964	/*	1883	/*
1965	* present(type, map, x, y) searches for any objects with	1884	* present(type, map, x, y) searches for any objects with
1966	* a matching type variable at the given map and coordinates.	1885	* a matching type variable at the given map and coordinates.
1967	* The first matching object is returned, or NULL if none.	1886	* The first matching object is returned, or NULL if none.
1968	*/	1887	*/
1969
1970	object *	1888	object *
1971	present (unsigned char type, maptile *m, int x, int y)	1889	present (unsigned char type, maptile *m, int x, int y)
1972	{	1890	{
1973	object *
1974	tmp;
1975
1976	if (out_of_map (m, x, y))	1891	if (out_of_map (m, x, y))
1977	{	1892	{
1978	LOG (llevError, "Present called outside map.\n");	1893	LOG (llevError, "Present called outside map.\n");
1979	return NULL;	1894	return NULL;
1980	}	1895	}
1981	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1896
		1897	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1982	if (tmp->type == type)	1898	if (tmp->type == type)
1983	return tmp;	1899	return tmp;
		1900
1984	return NULL;	1901	return NULL;
1985	}	1902	}
1986		1903
1987	/*	1904	/*
1988	* present_in_ob(type, object) searches for any objects with	1905	* present_in_ob(type, object) searches for any objects with
1989	* a matching type variable in the inventory of the given object.	1906	* a matching type variable in the inventory of the given object.
1990	* The first matching object is returned, or NULL if none.	1907	* The first matching object is returned, or NULL if none.
1991	*/	1908	*/
1992
1993	object *	1909	object *
1994	present_in_ob (unsigned char type, const object *op)	1910	present_in_ob (unsigned char type, const object *op)
1995	{	1911	{
1996	object *
1997	tmp;
1998
1999	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1912	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2000	if (tmp->type == type)	1913	if (tmp->type == type)
2001	return tmp;	1914	return tmp;
		1915
2002	return NULL;	1916	return NULL;
2003	}	1917	}
2004		1918
2005	/*	1919	/*
2006	* present_in_ob (type, str, object) searches for any objects with	1920	* present_in_ob (type, str, object) searches for any objects with
…		…
2014	* str is the string to match against. Note that we match against	1928	* str is the string to match against. Note that we match against
2015	* the object name, not the archetype name. this is so that the	1929	* the object name, not the archetype name. this is so that the
2016	* spell code can use one object type (force), but change it's name	1930	* spell code can use one object type (force), but change it's name
2017	* to be unique.	1931	* to be unique.
2018	*/	1932	*/
2019
2020	object *	1933	object *
2021	present_in_ob_by_name (int type, const char *str, const object *op)	1934	present_in_ob_by_name (int type, const char *str, const object *op)
2022	{	1935	{
2023	object *
2024	tmp;
2025
2026	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1936	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2027	{
2028	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1937	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2029	return tmp;	1938	return tmp;
2030	}	1939
2031	return NULL;	1940	return 0;
2032	}	1941	}
2033		1942
2034	/*	1943	/*
2035	* present_arch_in_ob(archetype, object) searches for any objects with	1944	* present_arch_in_ob(archetype, object) searches for any objects with
2036	* a matching archetype in the inventory of the given object.	1945	* a matching archetype in the inventory of the given object.
2037	* The first matching object is returned, or NULL if none.	1946	* The first matching object is returned, or NULL if none.
2038	*/	1947	*/
2039
2040	object *	1948	object *
2041	present_arch_in_ob (const archetype *at, const object *op)	1949	present_arch_in_ob (const archetype *at, const object *op)
2042	{	1950	{
2043	object *
2044	tmp;
2045
2046	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1951	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2047	if (tmp->arch == at)	1952	if (tmp->arch == at)
2048	return tmp;	1953	return tmp;
		1954
2049	return NULL;	1955	return NULL;
2050	}	1956	}
2051		1957
2052	/*	1958	/*
2053	* activate recursively a flag on an object inventory	1959	* activate recursively a flag on an object inventory
2054	*/	1960	*/
2055	void	1961	void
2056	flag_inv (object *op, int flag)	1962	flag_inv (object *op, int flag)
2057	{	1963	{
2058	object *
2059	tmp;
2060
2061	if (op->inv)
2062	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1964	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2063	{	1965	{
2064	SET_FLAG (tmp, flag);	1966	SET_FLAG (tmp, flag);
2065	flag_inv (tmp, flag);	1967	flag_inv (tmp, flag);
2066	}	1968	}
2067	} /*	1969	}
		1970
		1971	/*
2068	* desactivate recursively a flag on an object inventory	1972	* deactivate recursively a flag on an object inventory
2069	*/	1973	*/
2070	void	1974	void
2071	unflag_inv (object *op, int flag)	1975	unflag_inv (object *op, int flag)
2072	{	1976	{
2073	object *
2074	tmp;
2075
2076	if (op->inv)
2077	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1977	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2078	{	1978	{
2079	CLEAR_FLAG (tmp, flag);	1979	CLEAR_FLAG (tmp, flag);
2080	unflag_inv (tmp, flag);	1980	unflag_inv (tmp, flag);
2081	}	1981	}
2082	}
2083
2084	/*
2085	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2086	* all it's inventory (recursively).
2087	* If checksums are used, a player will get set_cheat called for
2088	* him/her-self and all object carried by a call to this function.
2089	*/
2090
2091	void
2092	set_cheat (object *op)
2093	{
2094	SET_FLAG (op, FLAG_WAS_WIZ);
2095	flag_inv (op, FLAG_WAS_WIZ);
2096	}	1982	}
2097		1983
2098	/*	1984	/*
2099	* find_free_spot(object, map, x, y, start, stop) will search for	1985	* find_free_spot(object, map, x, y, start, stop) will search for
2100	* a spot at the given map and coordinates which will be able to contain	1986	* a spot at the given map and coordinates which will be able to contain
…		…
2102	* to search (see the freearr_x/y[] definition).	1988	* to search (see the freearr_x/y[] definition).
2103	* It returns a random choice among the alternatives found.	1989	* It returns a random choice among the alternatives found.
2104	* start and stop are where to start relative to the free_arr array (1,9	1990	* start and stop are where to start relative to the free_arr array (1,9
2105	* does all 4 immediate directions). This returns the index into the	1991	* does all 4 immediate directions). This returns the index into the
2106	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1992	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2107	* Note - this only checks to see if there is space for the head of the
2108	* object - if it is a multispace object, this should be called for all
2109	* pieces.
2110	* Note2: This function does correctly handle tiled maps, but does not	1993	* Note: This function does correctly handle tiled maps, but does not
2111	* inform the caller. However, insert_ob_in_map will update as	1994	* inform the caller. However, insert_ob_in_map will update as
2112	* necessary, so the caller shouldn't need to do any special work.	1995	* necessary, so the caller shouldn't need to do any special work.
2113	* Note - updated to take an object instead of archetype - this is necessary	1996	* Note - updated to take an object instead of archetype - this is necessary
2114	* because arch_blocked (now ob_blocked) needs to know the movement type	1997	* because arch_blocked (now ob_blocked) needs to know the movement type
2115	* to know if the space in question will block the object. We can't use	1998	* to know if the space in question will block the object. We can't use
2116	* the archetype because that isn't correct if the monster has been	1999	* the archetype because that isn't correct if the monster has been
2117	* customized, changed states, etc.	2000	* customized, changed states, etc.
2118	*/	2001	*/
2119
2120	int	2002	int
2121	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	2003	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2122	{	2004	{
2123	int
2124	i,
2125	index = 0, flag;
2126	static int
2127	altern[SIZEOFFREE];	2005	int altern[SIZEOFFREE];
		2006	int index = 0, flag;
2128		2007
2129	for (i = start; i < stop; i++)	2008	for (int i = start; i < stop; i++)
2130	{	2009	{
2131	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	2010	mapxy pos (m, x, y); pos.move (i);
2132	if (!flag)	2011
		2012	if (!pos.normalise ())
		2013	continue;
		2014
		2015	mapspace &ms = *pos;
		2016
		2017	if (ms.flags () & P_IS_ALIVE)
		2018	continue;
		2019
		2020	/* However, often
		2021	* ob doesn't have any move type (when used to place exits)
		2022	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2023	*/
		2024	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2025	{
2133	altern[index++] = i;	2026	altern [index++] = i;
		2027	continue;
		2028	}
2134		2029
2135	/* Basically, if we find a wall on a space, we cut down the search size.	2030	/* Basically, if we find a wall on a space, we cut down the search size.
2136	* In this way, we won't return spaces that are on another side of a wall.	2031	* In this way, we won't return spaces that are on another side of a wall.
2137	* This mostly work, but it cuts down the search size in all directions -	2032	* This mostly work, but it cuts down the search size in all directions -
2138	* if the space being examined only has a wall to the north and empty	2033	* if the space being examined only has a wall to the north and empty
2139	* spaces in all the other directions, this will reduce the search space	2034	* spaces in all the other directions, this will reduce the search space
2140	* to only the spaces immediately surrounding the target area, and	2035	* to only the spaces immediately surrounding the target area, and
2141	* won't look 2 spaces south of the target space.	2036	* won't look 2 spaces south of the target space.
2142	*/	2037	*/
2143	else if ((flag & AB_NO_PASS) && maxfree[i] < stop)	2038	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2039	{
2144	stop = maxfree[i];	2040	stop = maxfree[i];
		2041	continue;
		2042	}
		2043
		2044	/* Note it is intentional that we check ob - the movement type of the
		2045	* head of the object should correspond for the entire object.
		2046	*/
		2047	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2048	continue;
		2049
		2050	if (ob->blocked (m, pos.x, pos.y))
		2051	continue;
		2052
		2053	altern [index++] = i;
2145	}	2054	}
		2055
2146	if (!index)	2056	if (!index)
2147	return -1;	2057	return -1;
		2058
2148	return altern[RANDOM () % index];	2059	return altern [rndm (index)];
2149	}	2060	}
2150		2061
2151	/*	2062	/*
2152	* find_first_free_spot(archetype, maptile, x, y) works like	2063	* find_first_free_spot(archetype, maptile, x, y) works like
2153	* find_free_spot(), but it will search max number of squares.	2064	* find_free_spot(), but it will search max number of squares.
2154	* But it will return the first available spot, not a random choice.	2065	* But it will return the first available spot, not a random choice.
2155	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2066	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2156	*/	2067	*/
2157
2158	int	2068	int
2159	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2069	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2160	{	2070	{
2161	int
2162	i;
2163
2164	for (i = 0; i < SIZEOFFREE; i++)	2071	for (int i = 0; i < SIZEOFFREE; i++)
2165	{
2166	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2072	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2167	return i;	2073	return i;
2168	}	2074
2169	return -1;	2075	return -1;
2170	}	2076	}
2171		2077
2172	/*	2078	/*
2173	* The function permute(arr, begin, end) randomly reorders the array	2079	* The function permute(arr, begin, end) randomly reorders the array
2174	* arr[begin..end-1].	2080	* arr[begin..end-1].
		2081	* now uses a fisher-yates shuffle, old permute was broken
2175	*/	2082	*/
2176	static void	2083	static void
2177	permute (int *arr, int begin, int end)	2084	permute (int *arr, int begin, int end)
2178	{	2085	{
2179	int	2086	arr += begin;
2180	i,
2181	j,
2182	tmp,
2183	len;
2184
2185	len = end - begin;	2087	end -= begin;
2186	for (i = begin; i < end; i++)
2187	{
2188	j = begin + RANDOM () % len;
2189		2088
2190	tmp = arr[i];	2089	while (--end)
2191	arr[i] = arr[j];	2090	swap (arr [end], arr [rndm (end + 1)]);
2192	arr[j] = tmp;
2193	}
2194	}	2091	}
2195		2092
2196	/* new function to make monster searching more efficient, and effective!	2093	/* new function to make monster searching more efficient, and effective!
2197	* This basically returns a randomized array (in the passed pointer) of	2094	* This basically returns a randomized array (in the passed pointer) of
2198	* the spaces to find monsters. In this way, it won't always look for	2095	* the spaces to find monsters. In this way, it won't always look for
…		…
2201	* the 3x3 area will be searched, just not in a predictable order.	2098	* the 3x3 area will be searched, just not in a predictable order.
2202	*/	2099	*/
2203	void	2100	void
2204	get_search_arr (int *search_arr)	2101	get_search_arr (int *search_arr)
2205	{	2102	{
2206	int	2103	int i;
2207	i;
2208		2104
2209	for (i = 0; i < SIZEOFFREE; i++)	2105	for (i = 0; i < SIZEOFFREE; i++)
2210	{
2211	search_arr[i] = i;	2106	search_arr[i] = i;
2212	}
2213		2107
2214	permute (search_arr, 1, SIZEOFFREE1 + 1);	2108	permute (search_arr, 1, SIZEOFFREE1 + 1);
2215	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2109	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2216	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2110	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2217	}	2111	}
…		…
2226	* Perhaps incorrectly, but I'm making the assumption that exclude	2120	* Perhaps incorrectly, but I'm making the assumption that exclude
2227	* is actually want is going to try and move there. We need this info	2121	* is actually want is going to try and move there. We need this info
2228	* because we have to know what movement the thing looking to move	2122	* because we have to know what movement the thing looking to move
2229	* there is capable of.	2123	* there is capable of.
2230	*/	2124	*/
2231
2232	int	2125	int
2233	find_dir (maptile *m, int x, int y, object *exclude)	2126	find_dir (maptile *m, int x, int y, object *exclude)
2234	{	2127	{
2235	int
2236	i,
2237	max = SIZEOFFREE, mflags;	2128	int i, max = SIZEOFFREE, mflags;
2238		2129
2239	sint16 nx, ny;	2130	sint16 nx, ny;
2240	object *	2131	object *tmp;
2241	tmp;
2242	maptile *	2132	maptile *mp;
2243	mp;
2244		2133
2245	MoveType blocked, move_type;	2134	MoveType blocked, move_type;
2246		2135
2247	if (exclude && exclude->head)	2136	if (exclude && exclude->head_ () != exclude)
2248	{	2137	{
2249	exclude = exclude->head;	2138	exclude = exclude->head;
2250	move_type = exclude->move_type;	2139	move_type = exclude->move_type;
2251	}	2140	}
2252	else	2141	else
…		…
2260	mp = m;	2149	mp = m;
2261	nx = x + freearr_x[i];	2150	nx = x + freearr_x[i];
2262	ny = y + freearr_y[i];	2151	ny = y + freearr_y[i];
2263		2152
2264	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2153	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2154
2265	if (mflags & P_OUT_OF_MAP)	2155	if (mflags & P_OUT_OF_MAP)
2266	{
2267	max = maxfree[i];	2156	max = maxfree[i];
2268	}
2269	else	2157	else
2270	{	2158	{
2271	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2159	mapspace &ms = mp->at (nx, ny);
		2160
		2161	blocked = ms.move_block;
2272		2162
2273	if ((move_type & blocked) == move_type)	2163	if ((move_type & blocked) == move_type)
2274	{
2275	max = maxfree[i];	2164	max = maxfree[i];
2276	}
2277	else if (mflags & P_IS_ALIVE)	2165	else if (mflags & P_IS_ALIVE)
2278	{	2166	{
2279	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2167	for (tmp = ms.bot; tmp; tmp = tmp->above)
2280	{	2168	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2281	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2169	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2282	{
2283	break;	2170	break;
2284	}	2171
2285	}
2286	if (tmp)	2172	if (tmp)
2287	{
2288	return freedir[i];	2173	return freedir[i];
2289	}
2290	}	2174	}
2291	}	2175	}
2292	}	2176	}
		2177
2293	return 0;	2178	return 0;
2294	}	2179	}
2295		2180
2296	/*	2181	/*
2297	* distance(object 1, object 2) will return the square of the	2182	* distance(object 1, object 2) will return the square of the
2298	* distance between the two given objects.	2183	* distance between the two given objects.
2299	*/	2184	*/
2300
2301	int	2185	int
2302	distance (const object *ob1, const object *ob2)	2186	distance (const object *ob1, const object *ob2)
2303	{	2187	{
2304	int
2305	i;
2306
2307	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2188	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2308	return i;
2309	}	2189	}
2310		2190
2311	/*	2191	/*
2312	* find_dir_2(delta-x,delta-y) will return a direction in which	2192	* find_dir_2(delta-x,delta-y) will return a direction in which
2313	* an object which has subtracted the x and y coordinates of another	2193	* an object which has subtracted the x and y coordinates of another
2314	* object, needs to travel toward it.	2194	* object, needs to travel toward it.
2315	*/	2195	*/
2316
2317	int	2196	int
2318	find_dir_2 (int x, int y)	2197	find_dir_2 (int x, int y)
2319	{	2198	{
2320	int	2199	int q;
2321	q;
2322		2200
2323	if (y)	2201	if (y)
2324	q = x * 100 / y;	2202	q = x * 100 / y;
2325	else if (x)	2203	else if (x)
2326	q = -300 * x;	2204	q = -300 * x;
…		…
2351		2229
2352	return 3;	2230	return 3;
2353	}	2231	}
2354		2232
2355	/*	2233	/*
2356	* absdir(int): Returns a number between 1 and 8, which represent
2357	* the "absolute" direction of a number (it actually takes care of
2358	* "overflow" in previous calculations of a direction).
2359	*/
2360
2361	int
2362	absdir (int d)
2363	{
2364	while (d < 1)
2365	d += 8;
2366	while (d > 8)
2367	d -= 8;
2368	return d;
2369	}
2370
2371	/*
2372	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2234	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2373	* between two directions (which are expected to be absolute (see absdir())	2235	* between two directions (which are expected to be absolute (see absdir())
2374	*/	2236	*/
2375
2376	int	2237	int
2377	dirdiff (int dir1, int dir2)	2238	dirdiff (int dir1, int dir2)
2378	{	2239	{
2379	int	2240	int d;
2380	d;
2381		2241
2382	d = abs (dir1 - dir2);	2242	d = abs (dir1 - dir2);
2383	if (d > 4)	2243	if (d > 4)
2384	d = 8 - d;	2244	d = 8 - d;
		2245
2385	return d;	2246	return d;
2386	}	2247	}
2387		2248
2388	/* peterm:	2249	/* peterm:
2389	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2250	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2392	* This basically means that if direction is 15, then it could either go	2253	* This basically means that if direction is 15, then it could either go
2393	* direction 4, 14, or 16 to get back to where we are.	2254	* direction 4, 14, or 16 to get back to where we are.
2394	* Moved from spell_util.c to object.c with the other related direction	2255	* Moved from spell_util.c to object.c with the other related direction
2395	* functions.	2256	* functions.
2396	*/	2257	*/
2397
2398	int
2399	reduction_dir[SIZEOFFREE][3] = {	2258	int reduction_dir[SIZEOFFREE][3] = {
2400	{0, 0, 0}, /* 0 */	2259	{0, 0, 0}, /* 0 */
2401	{0, 0, 0}, /* 1 */	2260	{0, 0, 0}, /* 1 */
2402	{0, 0, 0}, /* 2 */	2261	{0, 0, 0}, /* 2 */
2403	{0, 0, 0}, /* 3 */	2262	{0, 0, 0}, /* 3 */
2404	{0, 0, 0}, /* 4 */	2263	{0, 0, 0}, /* 4 */
…		…
2452	* find a path to that monster that we found. If not,	2311	* find a path to that monster that we found. If not,
2453	* we don't bother going toward it. Returns 1 if we	2312	* we don't bother going toward it. Returns 1 if we
2454	* can see a direct way to get it	2313	* can see a direct way to get it
2455	* Modified to be map tile aware -.MSW	2314	* Modified to be map tile aware -.MSW
2456	*/	2315	*/
2457
2458
2459	int	2316	int
2460	can_see_monsterP (maptile *m, int x, int y, int dir)	2317	can_see_monsterP (maptile *m, int x, int y, int dir)
2461	{	2318	{
2462	sint16 dx, dy;	2319	sint16 dx, dy;
2463	int
2464	mflags;	2320	int mflags;
2465		2321
2466	if (dir < 0)	2322	if (dir < 0)
2467	return 0; /* exit condition: invalid direction */	2323	return 0; /* exit condition: invalid direction */
2468		2324
2469	dx = x + freearr_x[dir];	2325	dx = x + freearr_x[dir];
…		…
2482	return 0;	2338	return 0;
2483		2339
2484	/* yes, can see. */	2340	/* yes, can see. */
2485	if (dir < 9)	2341	if (dir < 9)
2486	return 1;	2342	return 1;
		2343
2487	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2344	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2488	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2345	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2346	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2489	}	2347	}
2490
2491
2492		2348
2493	/*	2349	/*
2494	* can_pick(picker, item): finds out if an object is possible to be	2350	* can_pick(picker, item): finds out if an object is possible to be
2495	* picked up by the picker. Returnes 1 if it can be	2351	* picked up by the picker. Returnes 1 if it can be
2496	* picked up, otherwise 0.	2352	* picked up, otherwise 0.
…		…
2498	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2354	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2499	* core dumps if they do.	2355	* core dumps if they do.
2500	*	2356	*
2501	* Add a check so we can't pick up invisible objects (0.93.8)	2357	* Add a check so we can't pick up invisible objects (0.93.8)
2502	*/	2358	*/
2503
2504	int	2359	int
2505	can_pick (const object *who, const object *item)	2360	can_pick (const object *who, const object *item)
2506	{	2361	{
2507	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2362	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2508	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2363	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2509	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2364	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2510	}	2365	}
2511		2366
2512
2513	/*	2367	/*
2514	* create clone from object to another	2368	* create clone from object to another
2515	*/	2369	*/
2516	object *	2370	object *
2517	object_create_clone (object *asrc)	2371	object_create_clone (object *asrc)
2518	{	2372	{
2519	object *dst = 0, *tmp, *src, *part, *prev, *item;	2373	object *dst = 0, *tmp, *src, *prev, *item;
2520		2374
2521	if (!asrc)	2375	if (!asrc)
2522	return 0;	2376	return 0;
2523		2377
2524	src = asrc;
2525	if (src->head)
2526	src = src->head;	2378	src = asrc->head_ ();
2527		2379
2528	prev = 0;	2380	prev = 0;
2529	for (part = src; part; part = part->more)	2381	for (object *part = src; part; part = part->more)
2530	{	2382	{
2531	tmp = part->clone ();	2383	tmp = part->clone ();
2532	tmp->x -= src->x;	2384	tmp->x -= src->x;
2533	tmp->y -= src->y;	2385	tmp->y -= src->y;
2534		2386
…		…
2536	{	2388	{
2537	dst = tmp;	2389	dst = tmp;
2538	tmp->head = 0;	2390	tmp->head = 0;
2539	}	2391	}
2540	else	2392	else
2541	{
2542	tmp->head = dst;	2393	tmp->head = dst;
2543	}
2544		2394
2545	tmp->more = 0;	2395	tmp->more = 0;
2546		2396
2547	if (prev)	2397	if (prev)
2548	prev->more = tmp;	2398	prev->more = tmp;
…		…
2552		2402
2553	for (item = src->inv; item; item = item->below)	2403	for (item = src->inv; item; item = item->below)
2554	insert_ob_in_ob (object_create_clone (item), dst);	2404	insert_ob_in_ob (object_create_clone (item), dst);
2555		2405
2556	return dst;	2406	return dst;
2557	}
2558
2559	/* GROS - Creates an object using a string representing its content. */
2560	/* Basically, we save the content of the string to a temp file, then call */
2561	/* load_object on it. I admit it is a highly inefficient way to make things, */
2562	/* but it was simple to make and allows reusing the load_object function. */
2563	/* Remember not to use load_object_str in a time-critical situation. */
2564	/* Also remember that multiparts objects are not supported for now. */
2565
2566	object *
2567	load_object_str (const char *obstr)
2568	{
2569	object *op;
2570	char filename[MAX_BUF];
2571
2572	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2573
2574	FILE *tempfile = fopen (filename, "w");
2575
2576	if (tempfile == NULL)
2577	{
2578	LOG (llevError, "Error - Unable to access load object temp file\n");
2579	return NULL;
2580	}
2581
2582	fprintf (tempfile, obstr);
2583	fclose (tempfile);
2584
2585	op = object::create ();
2586
2587	object_thawer thawer (filename);
2588
2589	if (thawer)
2590	load_object (thawer, op, 0);
2591
2592	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2593	CLEAR_FLAG (op, FLAG_REMOVED);
2594
2595	return op;
2596	}	2407	}
2597		2408
2598	/* This returns the first object in who's inventory that	2409	/* This returns the first object in who's inventory that
2599	* has the same type and subtype match.	2410	* has the same type and subtype match.
2600	* returns NULL if no match.	2411	* returns NULL if no match.
2601	*/	2412	*/
2602	object *	2413	object *
2603	find_obj_by_type_subtype (const object *who, int type, int subtype)	2414	find_obj_by_type_subtype (const object *who, int type, int subtype)
2604	{	2415	{
2605	object *tmp;
2606
2607	for (tmp = who->inv; tmp; tmp = tmp->below)	2416	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2608	if (tmp->type == type && tmp->subtype == subtype)	2417	if (tmp->type == type && tmp->subtype == subtype)
2609	return tmp;	2418	return tmp;
2610		2419
2611	return NULL;	2420	return 0;
2612	}	2421	}
2613		2422
2614	/* If ob has a field named key, return the link from the list,	2423	/* If ob has a field named key, return the link from the list,
2615	* otherwise return NULL.	2424	* otherwise return NULL.
2616	*	2425	*
…		…
2618	* do the desired thing.	2427	* do the desired thing.
2619	*/	2428	*/
2620	key_value *	2429	key_value *
2621	get_ob_key_link (const object *ob, const char *key)	2430	get_ob_key_link (const object *ob, const char *key)
2622	{	2431	{
2623	key_value *link;
2624
2625	for (link = ob->key_values; link != NULL; link = link->next)	2432	for (key_value *link = ob->key_values; link; link = link->next)
2626	if (link->key == key)	2433	if (link->key == key)
2627	return link;	2434	return link;
2628		2435
2629	return NULL;	2436	return 0;
2630	}	2437	}
2631		2438
2632	/*	2439	/*
2633	* Returns the value of op has an extra_field for key, or NULL.	2440	* Returns the value of op has an extra_field for key, or NULL.
2634	*	2441	*
…		…
2659	if (link->key == canonical_key)	2466	if (link->key == canonical_key)
2660	return link->value;	2467	return link->value;
2661		2468
2662	return 0;	2469	return 0;
2663	}	2470	}
2664
2665		2471
2666	/*	2472	/*
2667	* Updates the canonical_key in op to value.	2473	* Updates the canonical_key in op to value.
2668	*	2474	*
2669	* canonical_key is a shared string (value doesn't have to be).	2475	* canonical_key is a shared string (value doesn't have to be).
…		…
2674	* Returns TRUE on success.	2480	* Returns TRUE on success.
2675	*/	2481	*/
2676	int	2482	int
2677	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2483	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2678	{	2484	{
2679	key_value *
2680	field = NULL, *last = NULL;	2485	key_value *field = NULL, *last = NULL;
2681		2486
2682	for (field = op->key_values; field != NULL; field = field->next)	2487	for (field = op->key_values; field != NULL; field = field->next)
2683	{	2488	{
2684	if (field->key != canonical_key)	2489	if (field->key != canonical_key)
2685	{	2490	{
…		…
2694	/* Basically, if the archetype has this key set,	2499	/* Basically, if the archetype has this key set,
2695	* we need to store the null value so when we save	2500	* we need to store the null value so when we save
2696	* it, we save the empty value so that when we load,	2501	* it, we save the empty value so that when we load,
2697	* we get this value back again.	2502	* we get this value back again.
2698	*/	2503	*/
2699	if (get_ob_key_link (&op->arch->clone, canonical_key))	2504	if (get_ob_key_link (op->arch, canonical_key))
2700	field->value = 0;	2505	field->value = 0;
2701	else	2506	else
2702	{	2507	{
2703	if (last)	2508	if (last)
2704	last->next = field->next;	2509	last->next = field->next;
…		…
2713	/* IF we get here, key doesn't exist */	2518	/* IF we get here, key doesn't exist */
2714		2519
2715	/* No field, we'll have to add it. */	2520	/* No field, we'll have to add it. */
2716		2521
2717	if (!add_key)	2522	if (!add_key)
2718	{
2719	return FALSE;	2523	return FALSE;
2720	}	2524
2721	/* There isn't any good reason to store a null	2525	/* There isn't any good reason to store a null
2722	* value in the key/value list. If the archetype has	2526	* value in the key/value list. If the archetype has
2723	* this key, then we should also have it, so shouldn't	2527	* this key, then we should also have it, so shouldn't
2724	* be here. If user wants to store empty strings,	2528	* be here. If user wants to store empty strings,
2725	* should pass in ""	2529	* should pass in ""
…		…
2774	}	2578	}
2775	else	2579	else
2776	item = item->env;	2580	item = item->env;
2777	}	2581	}
2778		2582
		2583	const char *
		2584	object::flag_desc (char *desc, int len) const
		2585	{
		2586	char *p = desc;
		2587	bool first = true;
		2588
		2589	*p = 0;
		2590
		2591	for (int i = 0; i < NUM_FLAGS; i++)
		2592	{
		2593	if (len <= 10) // magic constant!
		2594	{
		2595	snprintf (p, len, ",...");
		2596	break;
		2597	}
		2598
		2599	if (flag [i])
		2600	{
		2601	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2602	len -= cnt;
		2603	p += cnt;
		2604	first = false;
		2605	}
		2606	}
		2607
		2608	return desc;
		2609	}
		2610
2779	// return a suitable string describing an objetc in enough detail to find it	2611	// return a suitable string describing an object in enough detail to find it
2780	const char *	2612	const char *
2781	object::debug_desc (char *info) const	2613	object::debug_desc (char *info) const
2782	{	2614	{
		2615	char flagdesc[512];
2783	char info2[256 * 3];	2616	char info2[256 * 4];
2784	char *p = info;	2617	char *p = info;
2785		2618
2786	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2619	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2787	count,	2620	count,
		2621	uuid.c_str (),
2788	&name,	2622	&name,
2789	title ? " " : "",	2623	title ? "\",title:\"" : "",
2790	title ? (const char *)title : "");	2624	title ? (const char *)title : "",
		2625	flag_desc (flagdesc, 512), type);
2791		2626
2792	if (env)	2627	if (!this->flag[FLAG_REMOVED] && env)
2793	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2628	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2794		2629
2795	if (map)	2630	if (map)
2796	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2631	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2797		2632
2798	return info;	2633	return info;
2799	}	2634	}
2800		2635
2801	const char *	2636	const char *
2802	object::debug_desc () const	2637	object::debug_desc () const
2803	{	2638	{
2804	static char info[256 * 3];	2639	static char info[3][256 * 4];
		2640	static int info_idx;
		2641
2805	return debug_desc (info);	2642	return debug_desc (info [++info_idx % 3]);
2806	}	2643	}
2807		2644
		2645	struct region *
		2646	object::region () const
		2647	{
		2648	return map ? map->region (x, y)
		2649	: region::default_region ();
		2650	}
		2651
		2652	const materialtype_t *
		2653	object::dominant_material () const
		2654	{
		2655	if (materialtype_t *mt = name_to_material (materialname))
		2656	return mt;
		2657
		2658	return name_to_material (shstr_unknown);
		2659	}
		2660
		2661	void
		2662	object::open_container (object *new_container)
		2663	{
		2664	if (container == new_container)
		2665	return;
		2666
		2667	if (object *old_container = container)
		2668	{
		2669	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2670	return;
		2671
		2672	#if 0
		2673	// remove the "Close old_container" object.
		2674	if (object *closer = old_container->inv)
		2675	if (closer->type == CLOSE_CON)
		2676	closer->destroy ();
		2677	#endif
		2678
		2679	old_container->flag [FLAG_APPLIED] = 0;
		2680	container = 0;
		2681
		2682	esrv_update_item (UPD_FLAGS, this, old_container);
		2683	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2684	play_sound (sound_find ("chest_close"));
		2685	}
		2686
		2687	if (new_container)
		2688	{
		2689	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2690	return;
		2691
		2692	// TODO: this does not seem to serve any purpose anymore?
		2693	#if 0
		2694	// insert the "Close Container" object.
		2695	if (archetype *closer = new_container->other_arch)
		2696	{
		2697	object *closer = arch_to_object (new_container->other_arch);
		2698	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2699	new_container->insert (closer);
		2700	}
		2701	#endif
		2702
		2703	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2704
		2705	new_container->flag [FLAG_APPLIED] = 1;
		2706	container = new_container;
		2707
		2708	esrv_update_item (UPD_FLAGS, this, new_container);
		2709	esrv_send_inventory (this, new_container);
		2710	play_sound (sound_find ("chest_open"));
		2711	}
		2712	}
		2713
		2714	object *
		2715	object::force_find (const shstr name)
		2716	{
		2717	/* cycle through his inventory to look for the MARK we want to
		2718	* place
		2719	*/
		2720	for (object *tmp = inv; tmp; tmp = tmp->below)
		2721	if (tmp->type == FORCE && tmp->slaying == name)
		2722	return splay (tmp);
		2723
		2724	return 0;
		2725	}
		2726
		2727	void
		2728	object::force_add (const shstr name, int duration)
		2729	{
		2730	if (object *force = force_find (name))
		2731	force->destroy ();
		2732
		2733	object *force = get_archetype (FORCE_NAME);
		2734
		2735	force->slaying = name;
		2736	force->stats.food = 1;
		2737	force->speed_left = -1.f;
		2738
		2739	force->set_speed (duration ? 1.f / duration : 0.f);
		2740	force->flag [FLAG_IS_USED_UP] = true;
		2741	force->flag [FLAG_APPLIED] = true;
		2742
		2743	insert (force);
		2744	}
		2745
		2746	void
		2747	object::play_sound (faceidx sound) const
		2748	{
		2749	if (!sound)
		2750	return;
		2751
		2752	if (flag [FLAG_REMOVED])
		2753	return;
		2754
		2755	if (env)
		2756	{
		2757	if (object *pl = in_player ())
		2758	pl->contr->play_sound (sound);
		2759	}
		2760	else
		2761	map->play_sound (sound, x, y);
		2762	}
		2763

Diff Legend

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