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.26 by root, Mon Sep 11 11:46:52 2006 UTC vs.
Revision 1.207 by root, Sun Apr 20 23:25:09 2008 UTC

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

Diff Legend

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