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

Diff Legend

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