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

Diff Legend

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