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.13 by root, Sun Sep 3 22:45:55 2006 UTC vs.
Revision 1.288 by root, Sat Oct 3 22:36:08 2009 UTC

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

Diff Legend

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