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.32 by root, Mon Sep 11 23:53:30 2006 UTC vs.
Revision 1.209 by root, Mon Apr 21 06:35:26 2008 UTC

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

Diff Legend

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