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.208 by root, Mon Apr 21 06:16:01 2008 UTC vs.
Revision 1.303 by root, Tue Nov 10 04:38:45 2009 UTC

1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Deliantra is free software: you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	#include <global.h>	25	#include <global.h>
25	#include <stdio.h>	26	#include <stdio.h>
26	#include <sys/types.h>	27	#include <sys/types.h>
27	#include <sys/uio.h>	28	#include <sys/uio.h>
28	#include <object.h>	29	#include <object.h>
29	#include <funcpoint.h>
30	#include <sproto.h>	30	#include <sproto.h>
31	#include <loader.h>	31	#include <loader.h>
32		32
33	#include <bitset>	33	#include <bitset>
34		34
35	UUID UUID::cur;	35	UUID UUID::cur;
36	static uint64_t seq_next_save;	36	static uint64_t seq_next_save;
37	static const uint64 UUID_GAP = 1<<19;	37	static const uint64 UUID_GAP = 1<<19;
		38	uint32_t mapspace::smellcount = 10000;
38		39
39	objectvec objects;	40	objectvec objects;
40	activevec actives;	41	activevec actives;
		42
		43	//+GPL
41		44
42	short freearr_x[SIZEOFFREE] = {	45	short freearr_x[SIZEOFFREE] = {
43	0,	46	0,
44	0, 1, 1, 1, 0, -1, -1, -1,	47	0, 1, 1, 1, 0, -1, -1, -1,
45	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	48	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
…		…
49	0,	52	0,
50	-1, -1, 0, 1, 1, 1, 0, -1,	53	-1, -1, 0, 1, 1, 1, 0, -1,
51	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	54	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
52	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	55	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
53	};	56	};
54	int maxfree[SIZEOFFREE] = {
55	0,
56	9, 10, 13, 14, 17, 18, 21, 22,
57	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
58	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
59	};
60	int freedir[SIZEOFFREE] = {	57	int freedir[SIZEOFFREE] = {
61	0,	58	0,
62	1, 2, 3, 4, 5, 6, 7, 8,	59	1, 2, 3, 4, 5, 6, 7, 8,
63	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	60	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
64	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	61	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
		62	};
		63
		64	static int maxfree[SIZEOFFREE] = {
		65	0,
		66	9, 10, 13, 14, 17, 18, 21, 22,
		67	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
		68	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
65	};	69	};
66		70
67	static void	71	static void
68	write_uuid (uval64 skip, bool sync)	72	write_uuid (uval64 skip, bool sync)
69	{	73	{
…		…
97		101
98	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	102	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
99	_exit (1);	103	_exit (1);
100	}	104	}
101		105
102	UUID::BUF buf;	106	char buf [UUID::MAX_LEN];
103	buf[0] = 0;	107	buf[0] = 0;
104	fgets (buf, sizeof (buf), fp);	108	fgets (buf, sizeof (buf), fp);
105		109
106	if (!UUID::cur.parse (buf))	110	if (!UUID::cur.parse (buf))
107	{	111	{
…		…
134		138
135	void	139	void
136	UUID::init ()	140	UUID::init ()
137	{	141	{
138	read_uuid ();	142	read_uuid ();
		143	}
		144
		145	bool
		146	UUID::parse (const char *s)
		147	{
		148	if (*s++ != '<' || *s++ != '1' || *s++ != '.')
		149	return false;
		150
		151	seq = 0;
		152
		153	while (*s != '>')
		154	{
		155	if (*s < '0')
		156	return false;
		157
		158	// this gives nice branchless code with gcc
		159	assert ('0' < 'a' && '0' == 48 && 'a' == 97);
		160	int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
		161
		162	seq = (seq << 4) | digit;
		163
		164	++s;
		165	}
		166
		167	return true;
		168	}
		169
		170	char *
		171	UUID::append (char *buf) const
		172	{
		173	*buf++ = '<';
		174	*buf++ = '1';
		175	*buf++ = '.';
		176
		177	uint64_t seq = this->seq;
		178	const int bits = 64;
		179	char nz = 0;
		180	static const char tohex [] = "0123456789abcdef";
		181
		182	// assert (len >= 3 + bits / 4 + 1 + 1);
		183	for (int i = bits / 4; --i; )
		184	{
		185	uint8_t digit = seq >> (bits - 4);
		186
		187	*buf = tohex [digit];
		188	nz |= digit;
		189	buf += nz ? 1 : 0;
		190	seq <<= 4;
		191	}
		192
		193	// last digit is special - always emit
		194	uint8_t digit = seq >> (bits - 4);
		195	*buf++ = tohex [digit];
		196
		197	*buf++ = '>';
		198
		199	return buf;
		200	}
		201
		202	char *
		203	UUID::c_str () const
		204	{
		205	static char buf [MAX_LEN];
		206	*append (buf) = 0;
		207	return buf;
139	}	208	}
140		209
141	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	210	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
142	static bool	211	static bool
143	compare_ob_value_lists_one (const object *wants, const object *has)	212	compare_ob_value_lists_one (const object *wants, const object *has)
144	{	213	{
145	key_value *wants_field;
146
147	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	214	/* n-squared behaviour (see kv_get), but I'm hoping both
148	* objects with lists are rare, and lists stay short. If not, use a	215	* objects with lists are rare, and lists stay short. If not, use a
149	* different structure or at least keep the lists sorted...	216	* different structure or at least keep the lists sorted...
150	*/	217	*/
151		218
152	/* For each field in wants, */	219	/* For each field in wants, */
153	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)	220	for (key_value *kv = wants->key_values; kv; kv = kv->next)
154	{	221	if (has->kv_get (kv->key) != kv->value)
155	key_value *has_field;	222	return false;
156
157	/* Look for a field in has with the same key. */
158	has_field = get_ob_key_link (has, wants_field->key);
159
160	if (!has_field)
161	return 0; /* No field with that name. */
162
163	/* Found the matching field. */
164	if (has_field->value != wants_field->value)
165	return 0; /* Values don't match, so this half of the comparison is false. */
166
167	/* If we get here, we found a match. Now for the next field in wants. */
168	}
169		223
170	/* If we get here, every field in wants has a matching field in has. */	224	/* If we get here, every field in wants has a matching field in has. */
171	return 1;	225	return true;
172	}	226	}
173		227
174	/* Returns TRUE if ob1 has the same key_values as ob2. */	228	/* Returns TRUE if ob1 has the same key_values as ob2. */
175	static bool	229	static bool
176	compare_ob_value_lists (const object *ob1, const object *ob2)	230	compare_ob_value_lists (const object *ob1, const object *ob2)
177	{	231	{
178	/* However, there may be fields in has which aren't partnered in wants,	232	/* However, there may be fields in has which aren't partnered in wants,
179	* so we need to run the comparison *twice*. :(	233	* so we need to run the comparison *twice*. :(
180	*/	234	*/
181	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);	235	return compare_ob_value_lists_one (ob1, ob2)
		236	&& compare_ob_value_lists_one (ob2, ob1);
182	}	237	}
183		238
184	/* Function examines the 2 objects given to it, and returns true if	239	/* Function examines the 2 objects given to it, and returns true if
185	* they can be merged together.	240	* they can be merged together.
186	*	241	*
…		…
196	bool object::can_merge_slow (object *ob1, object *ob2)	251	bool object::can_merge_slow (object *ob1, object *ob2)
197	{	252	{
198	/* A couple quicksanity checks */	253	/* A couple quicksanity checks */
199	if (ob1 == ob2	254	if (ob1 == ob2
200	|| ob1->type != ob2->type	255	|| ob1->type != ob2->type
201	|| ob1->speed != ob2->speed	256	|| fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED
202	|| ob1->value != ob2->value	257	|| ob1->value != ob2->value
203	|| ob1->name != ob2->name)	258	|| ob1->name != ob2->name)
204	return 0;	259	return 0;
205		260
206	/* Do not merge objects if nrof would overflow. First part checks	261	/* Do not merge objects if nrof would overflow, assume nrof
207	* for unsigned overflow (2c), second part checks whether the result	262	* is always 0 .. 2**31-1 */
208	* would fit into a 32 bit signed int, which is often used to hold	263	if (ob1->nrof > 0x7fffffff - ob2->nrof)
209	* nrof values.
210	*/
211	if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
212	return 0;	264	return 0;
213		265
214	/* If the objects have been identified, set the BEEN_APPLIED flag.	266	/* If the objects have been identified, set the BEEN_APPLIED flag.
215	* This is to the comparison of the flags below will be OK. We	267	* This is to the comparison of the flags below will be OK. We
216	* just can't ignore the been applied or identified flags, as they	268	* just can't ignore the been applied or identified flags, as they
…		…
221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	273	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
222		274
223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	275	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	276	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
225		277
226	if (ob1->arch->name != ob2->arch->name	278	if (ob1->arch->archname != ob2->arch->archname
227	|| ob1->name != ob2->name	279	|| ob1->name != ob2->name
228	|| ob1->title != ob2->title	280	|| ob1->title != ob2->title
229	|| ob1->msg != ob2->msg	281	|| ob1->msg != ob2->msg
230	|| ob1->weight != ob2->weight	282	|| ob1->weight != ob2->weight
231	|| ob1->attacktype != ob2->attacktype	283	|| ob1->attacktype != ob2->attacktype
232	|| ob1->magic != ob2->magic	284	|| ob1->magic != ob2->magic
233	|| ob1->slaying != ob2->slaying	285	|| ob1->slaying != ob2->slaying
234	|| ob1->skill != ob2->skill	286	|| ob1->skill != ob2->skill
235	|| ob1->value != ob2->value	287	|| ob1->value != ob2->value
236	|| ob1->animation_id != ob2->animation_id	288	|| ob1->animation_id != ob2->animation_id
		289	|| (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
237	|| ob1->client_type != ob2->client_type	290	|| ob1->client_type != ob2->client_type
238	|| ob1->materialname != ob2->materialname	291	|| ob1->material != ob2->material
239	|| ob1->lore != ob2->lore	292	|| ob1->lore != ob2->lore
240	|| ob1->subtype != ob2->subtype	293	|| ob1->subtype != ob2->subtype
241	|| ob1->move_type != ob2->move_type	294	|| ob1->move_type != ob2->move_type
242	|| ob1->move_block != ob2->move_block	295	|| ob1->move_block != ob2->move_block
243	|| ob1->move_allow != ob2->move_allow	296	|| ob1->move_allow != ob2->move_allow
244	|| ob1->move_on != ob2->move_on	297	|| ob1->move_on != ob2->move_on
245	|| ob1->move_off != ob2->move_off	298	|| ob1->move_off != ob2->move_off
246	|| ob1->move_slow != ob2->move_slow	299	|| ob1->move_slow != ob2->move_slow
247	|| ob1->move_slow_penalty != ob2->move_slow_penalty	300	|| fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
248	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))	301	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
249	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))	302	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
250	return 0;	303	return 0;
251		304
252	if ((ob1->flag ^ ob2->flag)	305	if ((ob1->flag ^ ob2->flag)
253	.reset (FLAG_INV_LOCKED)	306	.reset (FLAG_INV_LOCKED)
254	.reset (FLAG_CLIENT_SENT)
255	.reset (FLAG_REMOVED)	307	.reset (FLAG_REMOVED)
256	.any ())	308	.any ())
257	return 0;	309	return 0;
258		310
259	/* This is really a spellbook check - we should in general	311	/* This is really a spellbook check - we should in general
…		…
331		383
332	/* Everything passes, must be OK. */	384	/* Everything passes, must be OK. */
333	return 1;	385	return 1;
334	}	386	}
335		387
		388	// find player who can see this object
		389	object *
		390	object::visible_to () const
		391	{
		392	if (client_visible () && !flag [FLAG_REMOVED])
		393	{
		394	// see if we are in a container of sorts
		395	if (env)
		396	{
		397	// the player inventory itself is always visible
		398	if (env->is_player ())
		399	return env;
		400
		401	// else a player could have our env open
		402	object *envest = env->outer_env_or_self ();
		403
		404	// the player itself is always on a map, so we will find him here
		405	// even if our inv is in a player.
		406	if (envest->is_on_map ())
		407	if (object *pl = envest->ms ().player ())
		408	if (pl->container_ () == env)
		409	return pl;
		410	}
		411	else
		412	{
		413	// maybe there is a player standing on the same mapspace
		414	// this will catch the case where "this" is a player
		415	if (object *pl = ms ().player ())
		416	if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
		417	|| pl->container_ () == this)
		418	return pl;
		419	}
		420	}
		421
		422	return 0;
		423	}
		424
336	// adjust weight per container type ("of holding")	425	// adjust weight per container type ("of holding")
337	static sint32	426	static sint32
338	weight_adjust (object *op, sint32 weight)	427	weight_adjust_for (object *op, sint32 weight)
339	{	428	{
340	return op->type == CONTAINER	429	return op->type == CONTAINER
341	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)	430	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
342	: weight;	431	: weight;
343	}	432	}
…		…
349	static void	438	static void
350	adjust_weight (object *op, sint32 weight)	439	adjust_weight (object *op, sint32 weight)
351	{	440	{
352	while (op)	441	while (op)
353	{	442	{
		443	// adjust by actual difference to account for rounding errors
		444	// i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
354	weight = weight_adjust (op, weight);	445	weight = weight_adjust_for (op, op->carrying)
		446	- weight_adjust_for (op, op->carrying - weight);
		447
		448	if (!weight)
		449	return;
355		450
356	op->carrying += weight;	451	op->carrying += weight;
		452
		453	if (object *pl = op->visible_to ())
		454	if (pl != op) // player is handled lazily
		455	esrv_update_item (UPD_WEIGHT, pl, op);
		456
357	op = op->env;	457	op = op->env;
358	}	458	}
359	}	459	}
360		460
361	/*	461	/*
…		…
374	op->update_weight ();	474	op->update_weight ();
375		475
376	sum += op->total_weight ();	476	sum += op->total_weight ();
377	}	477	}
378		478
379	carrying = weight_adjust (this, sum);	479	sum = weight_adjust_for (this, sum);
		480
		481	if (sum != carrying)
		482	{
		483	carrying = sum;
		484
		485	if (object *pl = visible_to ())
		486	if (pl != this) // player is handled lazily
		487	esrv_update_item (UPD_WEIGHT, pl, this);
		488	}
380	}	489	}
381		490
382	/*	491	/*
383	* Used by: Server DM commands: dumpbelow, dump. Some error messages.	492	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
384	*/	493	*/
…		…
391	object_freezer freezer;	500	object_freezer freezer;
392	op->write (freezer);	501	op->write (freezer);
393	return freezer.as_string ();	502	return freezer.as_string ();
394	}	503	}
395		504
396	/*	505	char *
397	* get_nearest_part(multi-object, object 2) returns the part of the	506	object::as_string ()
398	* multi-object 1 which is closest to the second object.
399	* If it's not a multi-object, it is returned.
400	*/
401	object *
402	get_nearest_part (object *op, const object *pl)
403	{	507	{
404	object *tmp, *closest;	508	return dump_object (this);
405	int last_dist, i;
406
407	if (!op->more)
408	return op;
409
410	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
411	tmp;
412	tmp = tmp->more)
413	if ((i = distance (tmp, pl)) < last_dist)
414	closest = tmp, last_dist = i;
415
416	return closest;
417	}	509	}
418		510
419	/*	511	/*
420	* Returns the object which has the count-variable equal to the argument.	512	* Returns the object which has the count-variable equal to the argument.
421	* VERRRY slow.	513	* VERRRY slow.
…		…
437	*/	529	*/
438	object *	530	object *
439	find_object_name (const char *str)	531	find_object_name (const char *str)
440	{	532	{
441	shstr_cmp str_ (str);	533	shstr_cmp str_ (str);
442	object *op;
443		534
		535	if (str_)
444	for_all_objects (op)	536	for_all_objects (op)
445	if (op->name == str_)	537	if (op->name == str_)
446	break;	538	return op;
447		539
448	return op;	540	return 0;
449	}	541	}
450		542
451	/*	543	/*
452	* Sets the owner and sets the skill and exp pointers to owner's current	544	* Sets the owner and sets the skill and exp pointers to owner's current
453	* skill and experience objects.	545	* skill and experience objects.
…		…
515	update_stats ();	607	update_stats ();
516		608
517	new_draw_info_format (NDI_UNIQUE, 0, this,	609	new_draw_info_format (NDI_UNIQUE, 0, this,
518	"You try to balance all your items at once, "	610	"You try to balance all your items at once, "
519	"but the %s is just too much for your body. "	611	"but the %s is just too much for your body. "
520	"[You need to unapply some items first.]", &ob->name);	612	"[You need to unapply some items first - use the 'body' command to see "
		613	"how many items you cna wera on a specific body part.]", &ob->name);
521	return false;	614	return false;
522	}	615	}
523		616
524	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);	617	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
525	}	618	}
…		…
551	}	644	}
552		645
553	op->key_values = 0;	646	op->key_values = 0;
554	}	647	}
555		648
556	object &	649	/*
557	object::operator =(const object &src)	650	* copy_to first frees everything allocated by the dst object,
		651	* and then copies the contents of itself into the second
		652	* object, allocating what needs to be allocated. Basically, any
		653	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
		654	* if the first object is freed, the pointers in the new object
		655	* will point at garbage.
		656	*/
		657	void
		658	object::copy_to (object *dst)
558	{	659	{
559	bool is_freed = flag [FLAG_FREED];	660	dst->remove ();
560	bool is_removed = flag [FLAG_REMOVED];
561
562	*(object_copy *)this = src;	661	*(object_copy *)dst = *this;
563
564	flag [FLAG_FREED] = is_freed;
565	flag [FLAG_REMOVED] = is_removed;	662	dst->flag [FLAG_REMOVED] = true;
566		663
567	/* Copy over key_values, if any. */	664	/* Copy over key_values, if any. */
568	if (src.key_values)	665	if (key_values)
569	{	666	{
570	key_value *tail = 0;	667	key_value *tail = 0;
571	key_values = 0;	668	dst->key_values = 0;
572		669
573	for (key_value *i = src.key_values; i; i = i->next)	670	for (key_value *i = key_values; i; i = i->next)
574	{	671	{
575	key_value *new_link = new key_value;	672	key_value *new_link = new key_value;
576		673
577	new_link->next = 0;	674	new_link->next = 0;
578	new_link->key = i->key;	675	new_link->key = i->key;
579	new_link->value = i->value;	676	new_link->value = i->value;
580		677
581	/* Try and be clever here, too. */	678	/* Try and be clever here, too. */
582	if (!key_values)	679	if (!dst->key_values)
583	{	680	{
584	key_values = new_link;	681	dst->key_values = new_link;
585	tail = new_link;	682	tail = new_link;
586	}	683	}
587	else	684	else
588	{	685	{
589	tail->next = new_link;	686	tail->next = new_link;
590	tail = new_link;	687	tail = new_link;
591	}	688	}
592	}	689	}
593	}	690	}
594	}
595
596	/*
597	* copy_to first frees everything allocated by the dst object,
598	* and then copies the contents of itself into the second
599	* object, allocating what needs to be allocated. Basically, any
600	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
601	* if the first object is freed, the pointers in the new object
602	* will point at garbage.
603	*/
604	void
605	object::copy_to (object *dst)
606	{
607	*dst = *this;
608		691
609	if (speed < 0)	692	if (speed < 0)
610	dst->speed_left -= rndm ();	693	dst->speed_left -= rndm ();
611		694
612	dst->set_speed (dst->speed);	695	dst->activate ();
613	}	696	}
614		697
615	void	698	void
616	object::instantiate ()	699	object::instantiate ()
617	{	700	{
…		…
634	object *	717	object *
635	object::clone ()	718	object::clone ()
636	{	719	{
637	object *neu = create ();	720	object *neu = create ();
638	copy_to (neu);	721	copy_to (neu);
		722	neu->map = map; // not copied by copy_to
639	return neu;	723	return neu;
640	}	724	}
641		725
642	/*	726	/*
643	* If an object with the IS_TURNABLE() flag needs to be turned due	727	* If an object with the IS_TURNABLE() flag needs to be turned due
…		…
660	* This function needs to be called whenever the speed of an object changes.	744	* This function needs to be called whenever the speed of an object changes.
661	*/	745	*/
662	void	746	void
663	object::set_speed (float speed)	747	object::set_speed (float speed)
664	{	748	{
665	if (flag [FLAG_FREED] && speed)
666	{
667	LOG (llevError, "Object %s is freed but has speed.\n", &name);
668	speed = 0;
669	}
670
671	this->speed = speed;	749	this->speed = speed;
672		750
673	if (has_active_speed ())	751	if (has_active_speed ())
674	activate ();	752	activate ();
675	else	753	else
…		…
694	* UP_OBJ_FACE: only the objects face has changed.	772	* UP_OBJ_FACE: only the objects face has changed.
695	*/	773	*/
696	void	774	void
697	update_object (object *op, int action)	775	update_object (object *op, int action)
698	{	776	{
699	if (op == NULL)	777	if (!op)
700	{	778	{
701	/* this should never happen */	779	/* this should never happen */
702	LOG (llevDebug, "update_object() called for NULL object.\n");	780	LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
703	return;	781	return;
704	}	782	}
705		783
706	if (op->env)	784	if (!op->is_on_map ())
707	{	785	{
708	/* Animation is currently handled by client, so nothing	786	/* Animation is currently handled by client, so nothing
709	* to do in this case.	787	* to do in this case.
710	*/	788	*/
711	return;	789	return;
712	}	790	}
713
714	/* If the map is saving, don't do anything as everything is
715	* going to get freed anyways.
716	*/
717	if (!op->map || op->map->in_memory == MAP_SAVING)
718	return;
719		791
720	/* make sure the object is within map boundaries */	792	/* make sure the object is within map boundaries */
721	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)	793	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
722	{	794	{
723	LOG (llevError, "update_object() called for object out of map!\n");	795	LOG (llevError, "update_object() called for object out of map!\n");
…		…
731		803
732	if (!(m.flags_ & P_UPTODATE))	804	if (!(m.flags_ & P_UPTODATE))
733	/* nop */;	805	/* nop */;
734	else if (action == UP_OBJ_INSERT)	806	else if (action == UP_OBJ_INSERT)
735	{	807	{
		808	#if 0
736	// this is likely overkill, TODO: revisit (schmorp)	809	// this is likely overkill, TODO: revisit (schmorp)
737	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	810	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
738	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))	811	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
739	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))	812	|| (op->is_player () && !(m.flags_ & P_PLAYER))
740	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))	813	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
741	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))	814	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
742	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))	815	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
743	|| (m.move_on | op->move_on ) != m.move_on	816	|| (m.move_on | op->move_on ) != m.move_on
744	|| (m.move_off | op->move_off ) != m.move_off	817	|| (m.move_off | op->move_off ) != m.move_off
745	|| (m.move_slow | op->move_slow) != m.move_slow	818	|| (m.move_slow | op->move_slow) != m.move_slow
746	/* This isn't perfect, but I don't expect a lot of objects to	819	/* This isn't perfect, but I don't expect a lot of objects to
747	* to have move_allow right now.	820	* have move_allow right now.
748	*/	821	*/
749	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block	822	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
		823	m.invalidate ();
		824	#else
750	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	825	// the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
751	m.flags_ = 0;	826	m.invalidate ();
		827	#endif
752	}	828	}
753	/* if the object is being removed, we can't make intelligent	829	/* if the object is being removed, we can't make intelligent
754	* decisions, because remove_ob can't really pass the object	830	* decisions, because remove_ob can't really pass the object
755	* that is being removed.	831	* that is being removed.
756	*/	832	*/
757	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	833	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
758	m.flags_ = 0;	834	m.invalidate ();
759	else if (action == UP_OBJ_FACE)	835	else if (action == UP_OBJ_FACE)
760	/* Nothing to do for that case */ ;	836	/* Nothing to do for that case */ ;
761	else	837	else
762	LOG (llevError, "update_object called with invalid action: %d\n", action);	838	LOG (llevError, "update_object called with invalid action: %d\n", action);
763		839
…		…
767		843
768	object::object ()	844	object::object ()
769	{	845	{
770	SET_FLAG (this, FLAG_REMOVED);	846	SET_FLAG (this, FLAG_REMOVED);
771		847
772	expmul = 1.0;	848	//expmul = 1.0; declared const for the time being
773	face = blank_face;	849	face = blank_face;
		850	material = &material_null;
774	}	851	}
775		852
776	object::~object ()	853	object::~object ()
777	{	854	{
778	unlink ();	855	unlink ();
…		…
807	/* If already on active list, don't do anything */	884	/* If already on active list, don't do anything */
808	if (active)	885	if (active)
809	return;	886	return;
810		887
811	if (has_active_speed ())	888	if (has_active_speed ())
		889	{
		890	if (flag [FLAG_FREED])
		891	LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
		892
812	actives.insert (this);	893	actives.insert (this);
		894	}
813	}	895	}
814		896
815	void	897	void
816	object::activate_recursive ()	898	object::activate_recursive ()
817	{	899	{
…		…
866	object::destroy_inv (bool drop_to_ground)	948	object::destroy_inv (bool drop_to_ground)
867	{	949	{
868	// need to check first, because the checks below might segfault	950	// need to check first, because the checks below might segfault
869	// as we might be on an invalid mapspace and crossfire code	951	// as we might be on an invalid mapspace and crossfire code
870	// is too buggy to ensure that the inventory is empty.	952	// is too buggy to ensure that the inventory is empty.
871	// corollary: if you create arrows etc. with stuff in tis inventory,	953	// corollary: if you create arrows etc. with stuff in its inventory,
872	// cf will crash below with off-map x and y	954	// cf will crash below with off-map x and y
873	if (!inv)	955	if (!inv)
874	return;	956	return;
875		957
876	/* Only if the space blocks everything do we not process -	958	/* Only if the space blocks everything do we not process -
…		…
878	* drop on that space.	960	* drop on that space.
879	*/	961	*/
880	if (!drop_to_ground	962	if (!drop_to_ground
881	|| !map	963	|| !map
882	|| map->in_memory != MAP_ACTIVE	964	|| map->in_memory != MAP_ACTIVE
883	|| map->nodrop	965	|| map->no_drop
884	|| ms ().move_block == MOVE_ALL)	966	|| ms ().move_block == MOVE_ALL)
885	{	967	{
886	while (inv)	968	while (inv)
887	{
888	inv->destroy_inv (drop_to_ground);
889	inv->destroy ();	969	inv->destroy ();
890	}
891	}	970	}
892	else	971	else
893	{ /* Put objects in inventory onto this space */	972	{ /* Put objects in inventory onto this space */
894	while (inv)	973	while (inv)
895	{	974	{
…		…
913	object *op = new object;	992	object *op = new object;
914	op->link ();	993	op->link ();
915	return op;	994	return op;
916	}	995	}
917		996
		997	static struct freed_map : maptile
		998	{
		999	freed_map ()
		1000	{
		1001	path = "<freed objects map>";
		1002	name = "/internal/freed_objects_map";
		1003	width = 3;
		1004	height = 3;
		1005	no_drop = 1;
		1006	no_reset = 1;
		1007
		1008	alloc ();
		1009	in_memory = MAP_ACTIVE;
		1010	}
		1011
		1012	~freed_map ()
		1013	{
		1014	destroy ();
		1015	}
		1016	} freed_map; // freed objects are moved here to avoid crashes
		1017
918	void	1018	void
919	object::do_destroy ()	1019	object::do_destroy ()
920	{	1020	{
921	attachable::do_destroy ();
922
923	if (flag [FLAG_IS_LINKED])	1021	if (flag [FLAG_IS_LINKED])
924	remove_button_link (this);	1022	remove_link ();
925		1023
926	if (flag [FLAG_FRIENDLY])	1024	if (flag [FLAG_FRIENDLY])
927	remove_friendly_object (this);	1025	remove_friendly_object (this);
928		1026
929	if (!flag [FLAG_REMOVED])
930	remove ();	1027	remove ();
931		1028
932	destroy_inv (true);	1029	attachable::do_destroy ();
933		1030
934	deactivate ();	1031	deactivate ();
935	unlink ();	1032	unlink ();
936		1033
937	flag [FLAG_FREED] = 1;	1034	flag [FLAG_FREED] = 1;
938		1035
939	// hack to ensure that freed objects still have a valid map	1036	// hack to ensure that freed objects still have a valid map
940	{
941	static maptile *freed_map; // freed objects are moved here to avoid crashes
942
943	if (!freed_map)
944	{
945	freed_map = new maptile;
946
947	freed_map->path = "<freed objects map>";
948	freed_map->name = "/internal/freed_objects_map";
949	freed_map->width = 3;
950	freed_map->height = 3;
951	freed_map->nodrop = 1;
952
953	freed_map->alloc ();
954	freed_map->in_memory = MAP_ACTIVE;
955	}
956
957	map = freed_map;	1037	map = &freed_map;
958	x = 1;	1038	x = 1;
959	y = 1;	1039	y = 1;
960	}
961		1040
962	if (more)	1041	if (more)
963	{	1042	{
964	more->destroy ();	1043	more->destroy ();
965	more = 0;	1044	more = 0;
…		…
973	attacked_by = 0;	1052	attacked_by = 0;
974	current_weapon = 0;	1053	current_weapon = 0;
975	}	1054	}
976		1055
977	void	1056	void
978	object::destroy (bool destroy_inventory)	1057	object::destroy ()
979	{	1058	{
980	if (destroyed ())	1059	if (destroyed ())
981	return;	1060	return;
982		1061
983	if (destroy_inventory)	1062	if (!is_head () && !head->destroyed ())
		1063	{
		1064	LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
		1065	head->destroy ();
		1066	return;
		1067	}
		1068
984	destroy_inv (false);	1069	destroy_inv (false);
985		1070
986	if (is_head ())	1071	if (is_head ())
987	if (sound_destroy)	1072	if (sound_destroy)
988	play_sound (sound_destroy);	1073	play_sound (sound_destroy);
989	else if (flag [FLAG_MONSTER])	1074	else if (flag [FLAG_MONSTER])
…		…
1000	* the previous environment.	1085	* the previous environment.
1001	*/	1086	*/
1002	void	1087	void
1003	object::do_remove ()	1088	object::do_remove ()
1004	{	1089	{
1005	object *tmp, *last = 0;	1090	if (flag [FLAG_REMOVED])
1006	object *otmp;
1007
1008	if (QUERY_FLAG (this, FLAG_REMOVED))
1009	return;	1091	return;
1010		1092
1011	SET_FLAG (this, FLAG_REMOVED);
1012	INVOKE_OBJECT (REMOVE, this);	1093	INVOKE_OBJECT (REMOVE, this);
		1094
		1095	flag [FLAG_REMOVED] = true;
1013		1096
1014	if (more)	1097	if (more)
1015	more->remove ();	1098	more->remove ();
1016		1099
1017	/*	1100	/*
1018	* In this case, the object to be removed is in someones	1101	* In this case, the object to be removed is in someones
1019	* inventory.	1102	* inventory.
1020	*/	1103	*/
1021	if (env)	1104	if (env)
1022	{	1105	{
		1106	flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed
		1107	if (object *pl = visible_to ())
		1108	esrv_del_item (pl->contr, count);
		1109	flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
		1110
1023	adjust_weight (env, -total_weight ());	1111	adjust_weight (env, -total_weight ());
1024		1112
1025	*(above ? &above->below : &env->inv) = below;	1113	object *pl = in_player ();
1026
1027	if (below)
1028	below->above = above;
1029		1114
1030	/* we set up values so that it could be inserted into	1115	/* we set up values so that it could be inserted into
1031	* the map, but we don't actually do that - it is up	1116	* the map, but we don't actually do that - it is up
1032	* to the caller to decide what we want to do.	1117	* to the caller to decide what we want to do.
1033	*/	1118	*/
1034	map = env->map;	1119	map = env->map;
1035	x = env->x;	1120	x = env->x;
1036	y = env->y;	1121	y = env->y;
		1122
		1123	// make sure cmov optimisation is applicable
		1124	*(above ? &above->below : &env->inv) = below;
		1125	*(below ? &below->above : &above ) = above; // &above is just a dummy
		1126
1037	above = 0;	1127	above = 0;
1038	below = 0;	1128	below = 0;
1039	env = 0;	1129	env = 0;
1040		1130
1041	/* NO_FIX_PLAYER is set when a great many changes are being	1131	/* NO_FIX_PLAYER is set when a great many changes are being
1042	* made to players inventory. If set, avoiding the call	1132	* made to players inventory. If set, avoiding the call
1043	* to save cpu time.	1133	* to save cpu time.
1044	*/	1134	*/
1045	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1135	if (pl)
		1136	if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
		1137	{
1046	otmp->update_stats ();	1138	pl->update_stats ();
		1139
		1140	if (glow_radius && pl->is_on_map ())
		1141	update_all_los (pl->map, pl->x, pl->y);
		1142	}
1047	}	1143	}
1048	else if (map)	1144	else if (map)
1049	{	1145	{
1050	if (type == PLAYER)
1051	{
1052	// leaving a spot always closes any open container on the ground
1053	if (container && !container->env)
1054	// this causes spurious floorbox updates, but it ensures
1055	// that the CLOSE event is being sent.
1056	close_container ();
1057
1058	--map->players;
1059	map->touch ();
1060	}
1061
1062	map->dirty = true;	1146	map->dirty = true;
1063	mapspace &ms = this->ms ();	1147	mapspace &ms = this->ms ();
1064		1148
		1149	if (object *pl = ms.player ())
		1150	{
		1151	if (is_player ())
		1152	{
		1153	if (!flag [FLAG_WIZPASS])
		1154	ms.smell = ++mapspace::smellcount; // remember the smell of the player
		1155
		1156	// leaving a spot always closes any open container on the ground
		1157	if (container && !container->env)
		1158	// this causes spurious floorbox updates, but it ensures
		1159	// that the CLOSE event is being sent.
		1160	close_container ();
		1161
		1162	--map->players;
		1163	map->touch ();
		1164	}
		1165	else if (pl->container_ () == this)
		1166	{
		1167	// removing a container should close it
		1168	close_container ();
		1169	}
		1170
		1171	esrv_del_item (pl->contr, count);
		1172	}
		1173
1065	/* link the object above us */	1174	/* link the object above us */
1066	if (above)	1175	// re-link, make sure compiler can easily use cmove
1067	above->below = below;	1176	*(above ? &above->below : &ms.top) = below;
1068	else	1177	*(below ? &below->above : &ms.bot) = above;
1069	ms.top = below; /* we were top, set new top */
1070
1071	/* Relink the object below us, if there is one */
1072	if (below)
1073	below->above = above;
1074	else
1075	{
1076	/* Nothing below, which means we need to relink map object for this space
1077	* use translated coordinates in case some oddness with map tiling is
1078	* evident
1079	*/
1080	if (GET_MAP_OB (map, x, y) != this)
1081	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1082
1083	ms.bot = above; /* goes on above it. */
1084	}
1085		1178
1086	above = 0;	1179	above = 0;
1087	below = 0;	1180	below = 0;
1088		1181
		1182	ms.invalidate ();
		1183
1089	if (map->in_memory == MAP_SAVING)	1184	if (map->in_memory == MAP_SAVING)
1090	return;	1185	return;
1091		1186
1092	int check_walk_off = !flag [FLAG_NO_APPLY];	1187	int check_walk_off = !flag [FLAG_NO_APPLY];
1093		1188
1094	if (object *pl = ms.player ())	1189	if (object *pl = ms.player ())
1095	{	1190	{
1096	if (pl->container == this)	1191	if (pl->container_ () == this)
1097	/* If a container that the player is currently using somehow gets	1192	/* If a container that the player is currently using somehow gets
1098	* removed (most likely destroyed), update the player view	1193	* removed (most likely destroyed), update the player view
1099	* appropriately.	1194	* appropriately.
1100	*/	1195	*/
1101	pl->close_container ();	1196	pl->close_container ();
1102		1197
		1198	//TODO: the floorbox prev/next might need updating
		1199	//esrv_del_item (pl->contr, count);
		1200	//TODO: update floorbox to preserve ordering
		1201	if (pl->contr->ns)
1103	pl->contr->ns->floorbox_update ();	1202	pl->contr->ns->floorbox_update ();
1104	}	1203	}
1105		1204
		1205	if (check_walk_off)
1106	for (tmp = ms.bot; tmp; tmp = tmp->above)	1206	for (object *above, *tmp = ms.bot; tmp; tmp = above)
1107	{	1207	{
		1208	above = tmp->above;
		1209
1108	/* No point updating the players look faces if he is the object	1210	/* No point updating the players look faces if he is the object
1109	* being removed.	1211	* being removed.
1110	*/	1212	*/
1111		1213
1112	/* See if object moving off should effect something */	1214	/* See if object moving off should effect something */
1113	if (check_walk_off
1114	&& ((move_type & tmp->move_off)	1215	if ((move_type & tmp->move_off)
1115	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1216	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1116	{
1117	move_apply (tmp, this, 0);	1217	move_apply (tmp, this, 0);
1118
1119	if (destroyed ())
1120	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1121	}	1218	}
1122		1219
1123	last = tmp;	1220	if (affects_los ())
1124	}
1125
1126	/* last == NULL if there are no objects on this space */
1127	//TODO: this makes little sense, why only update the topmost object?
1128	if (!last)
1129	map->at (x, y).flags_ = 0;
1130	else
1131	update_object (last, UP_OBJ_REMOVE);
1132
1133	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1134	update_all_los (map, x, y);	1221	update_all_los (map, x, y);
1135	}	1222	}
1136	}	1223	}
1137		1224
1138	/*	1225	/*
…		…
1152	if (!top)	1239	if (!top)
1153	for (top = op; top && top->above; top = top->above)	1240	for (top = op; top && top->above; top = top->above)
1154	;	1241	;
1155		1242
1156	for (; top; top = top->below)	1243	for (; top; top = top->below)
1157	{
1158	if (top == op)
1159	continue;
1160
1161	if (object::can_merge (op, top))	1244	if (object::can_merge (op, top))
1162	{	1245	{
1163	top->nrof += op->nrof;	1246	top->nrof += op->nrof;
1164		1247
1165	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1248	if (object *pl = top->visible_to ())
1166	op->weight = 0; /* Don't want any adjustements now */	1249	esrv_update_item (UPD_NROF, pl, top);
		1250
		1251	op->weight = 0; // cancel the addition above
		1252	op->carrying = 0; // must be 0 already
		1253
1167	op->destroy ();	1254	op->destroy ();
		1255
1168	return top;	1256	return top;
1169	}	1257	}
1170	}
1171		1258
1172	return 0;	1259	return 0;
1173	}	1260	}
1174		1261
1175	void	1262	void
…		…
1200	* job preparing multi-part monsters.	1287	* job preparing multi-part monsters.
1201	*/	1288	*/
1202	object *	1289	object *
1203	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1290	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1204	{	1291	{
		1292	op->remove ();
		1293
1205	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1294	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1206	{	1295	{
1207	tmp->x = x + tmp->arch->x;	1296	tmp->x = x + tmp->arch->x;
1208	tmp->y = y + tmp->arch->y;	1297	tmp->y = y + tmp->arch->y;
1209	}	1298	}
…		…
1232	* just 'op' otherwise	1321	* just 'op' otherwise
1233	*/	1322	*/
1234	object *	1323	object *
1235	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1324	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1236	{	1325	{
1237	assert (!op->flag [FLAG_FREED]);
1238
1239	object *top, *floor = NULL;
1240
1241	op->remove ();	1326	op->remove ();
		1327
		1328	if (m == &freed_map)//D TODO: remove soon
		1329	{//D
		1330	LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
		1331	}//D
1242		1332
1243	/* Ideally, the caller figures this out. However, it complicates a lot	1333	/* Ideally, the caller figures this out. However, it complicates a lot
1244	* of areas of callers (eg, anything that uses find_free_spot would now	1334	* of areas of callers (eg, anything that uses find_free_spot would now
1245	* need extra work	1335	* need extra work
1246	*/	1336	*/
		1337	maptile *newmap = m;
1247	if (!xy_normalise (m, op->x, op->y))	1338	if (!xy_normalise (newmap, op->x, op->y))
1248	{	1339	{
1249	op->destroy ();	1340	op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1250	return 0;	1341	return 0;
1251	}	1342	}
1252		1343
1253	if (object *more = op->more)	1344	if (object *more = op->more)
1254	if (!insert_ob_in_map (more, m, originator, flag))	1345	if (!insert_ob_in_map (more, m, originator, flag))
1255	return 0;	1346	return 0;
1256		1347
1257	CLEAR_FLAG (op, FLAG_REMOVED);	1348	op->flag [FLAG_REMOVED] = false;
1258		1349	op->env = 0;
1259	op->map = m;	1350	op->map = newmap;
		1351
1260	mapspace &ms = op->ms ();	1352	mapspace &ms = op->ms ();
1261		1353
1262	/* this has to be done after we translate the coordinates.	1354	/* this has to be done after we translate the coordinates.
1263	*/	1355	*/
1264	if (op->nrof && !(flag & INS_NO_MERGE))	1356	if (op->nrof && !(flag & INS_NO_MERGE))
1265	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1357	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1266	if (object::can_merge (op, tmp))	1358	if (object::can_merge (op, tmp))
1267	{	1359	{
		1360	// TODO: we actually want to update tmp, not op,
		1361	// but some caller surely breaks when we return tmp
		1362	// from here :/
1268	op->nrof += tmp->nrof;	1363	op->nrof += tmp->nrof;
1269	tmp->destroy (1);	1364	tmp->destroy ();
1270	}	1365	}
1271		1366
1272	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1367	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1273	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1368	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1274		1369
…		…
1281	{	1376	{
1282	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1377	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1283	abort ();	1378	abort ();
1284	}	1379	}
1285		1380
		1381	if (!originator->is_on_map ())
		1382	{
		1383	LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
		1384	op->debug_desc (), originator->debug_desc ());
		1385	abort ();
		1386	}
		1387
1286	op->above = originator;	1388	op->above = originator;
1287	op->below = originator->below;	1389	op->below = originator->below;
1288
1289	if (op->below)
1290	op->below->above = op;
1291	else
1292	ms.bot = op;
1293
1294	/* since *below* originator, no need to update top */
1295	originator->below = op;	1390	originator->below = op;
		1391
		1392	*(op->below ? &op->below->above : &ms.bot) = op;
1296	}	1393	}
1297	else	1394	else
1298	{	1395	{
1299	top = ms.bot;	1396	object *floor = 0;
		1397	object *top = ms.top;
1300		1398
1301	/* If there are other objects, then */	1399	/* If there are other objects, then */
1302	if (top)	1400	if (top)
1303	{	1401	{
1304	object *last = 0;
1305
1306	/*	1402	/*
1307	* If there are multiple objects on this space, we do some trickier handling.	1403	* If there are multiple objects on this space, we do some trickier handling.
1308	* We've already dealt with merging if appropriate.	1404	* We've already dealt with merging if appropriate.
1309	* Generally, we want to put the new object on top. But if	1405	* Generally, we want to put the new object on top. But if
1310	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1406	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
…		…
1313	* once we get to them. This reduces the need to traverse over all of	1409	* once we get to them. This reduces the need to traverse over all of
1314	* them when adding another one - this saves quite a bit of cpu time	1410	* them when adding another one - this saves quite a bit of cpu time
1315	* when lots of spells are cast in one area. Currently, it is presumed	1411	* when lots of spells are cast in one area. Currently, it is presumed
1316	* that flying non pickable objects are spell objects.	1412	* that flying non pickable objects are spell objects.
1317	*/	1413	*/
1318	for (top = ms.bot; top; top = top->above)	1414	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1319	{	1415	{
1320	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1416	if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1321	floor = top;	1417	floor = tmp;
1322		1418
1323	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1419	if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1324	{	1420	{
1325	/* We insert above top, so we want this object below this */	1421	/* We insert above top, so we want this object below this */
1326	top = top->below;	1422	top = tmp->below;
1327	break;	1423	break;
1328	}	1424	}
1329		1425
1330	last = top;	1426	top = tmp;
1331	}	1427	}
1332
1333	/* Don't want top to be NULL, so set it to the last valid object */
1334	top = last;
1335		1428
1336	/* We let update_position deal with figuring out what the space	1429	/* We let update_position deal with figuring out what the space
1337	* looks like instead of lots of conditions here.	1430	* looks like instead of lots of conditions here.
1338	* makes things faster, and effectively the same result.	1431	* makes things faster, and effectively the same result.
1339	*/	1432	*/
…		…
1346	*/	1439	*/
1347	if (!(flag & INS_ON_TOP)	1440	if (!(flag & INS_ON_TOP)
1348	&& ms.flags () & P_BLOCKSVIEW	1441	&& ms.flags () & P_BLOCKSVIEW
1349	&& (op->face && !faces [op->face].visibility))	1442	&& (op->face && !faces [op->face].visibility))
1350	{	1443	{
		1444	object *last;
		1445
1351	for (last = top; last != floor; last = last->below)	1446	for (last = top; last != floor; last = last->below)
1352	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1447	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1353	break;	1448	break;
1354		1449
1355	/* Check to see if we found the object that blocks view,	1450	/* Check to see if we found the object that blocks view,
…		…
1363	} /* If objects on this space */	1458	} /* If objects on this space */
1364		1459
1365	if (flag & INS_ABOVE_FLOOR_ONLY)	1460	if (flag & INS_ABOVE_FLOOR_ONLY)
1366	top = floor;	1461	top = floor;
1367		1462
1368	/* Top is the object that our object (op) is going to get inserted above.	1463	// insert object above top, or bottom-most if top = 0
1369	*/
1370
1371	/* First object on this space */
1372	if (!top)	1464	if (!top)
1373	{	1465	{
		1466	op->below = 0;
1374	op->above = ms.bot;	1467	op->above = ms.bot;
1375
1376	if (op->above)
1377	op->above->below = op;
1378
1379	op->below = 0;
1380	ms.bot = op;	1468	ms.bot = op;
		1469
		1470	*(op->above ? &op->above->below : &ms.top) = op;
1381	}	1471	}
1382	else	1472	else
1383	{ /* get inserted into the stack above top */	1473	{
1384	op->above = top->above;	1474	op->above = top->above;
1385
1386	if (op->above)
1387	op->above->below = op;	1475	top->above = op;
1388		1476
1389	op->below = top;	1477	op->below = top;
1390	top->above = op;	1478	*(op->above ? &op->above->below : &ms.top) = op;
1391	}	1479	}
		1480	}
1392		1481
1393	if (!op->above)	1482	if (op->is_player ())
1394	ms.top = op;
1395	} /* else not INS_BELOW_ORIGINATOR */
1396
1397	if (op->type == PLAYER)
1398	{	1483	{
1399	op->contr->do_los = 1;	1484	op->contr->do_los = 1;
1400	++op->map->players;	1485	++op->map->players;
1401	op->map->touch ();	1486	op->map->touch ();
1402	}	1487	}
1403		1488
1404	op->map->dirty = true;	1489	op->map->dirty = true;
1405		1490
1406	if (object *pl = ms.player ())	1491	if (object *pl = ms.player ())
		1492	//TODO: the floorbox prev/next might need updating
		1493	//esrv_send_item (pl, op);
		1494	//TODO: update floorbox to preserve ordering
		1495	if (pl->contr->ns)
1407	pl->contr->ns->floorbox_update ();	1496	pl->contr->ns->floorbox_update ();
1408		1497
1409	/* If this object glows, it may affect lighting conditions that are	1498	/* If this object glows, it may affect lighting conditions that are
1410	* visible to others on this map. But update_all_los is really	1499	* visible to others on this map. But update_all_los is really
1411	* an inefficient way to do this, as it means los for all players	1500	* an inefficient way to do this, as it means los for all players
1412	* on the map will get recalculated. The players could very well	1501	* on the map will get recalculated. The players could very well
1413	* be far away from this change and not affected in any way -	1502	* be far away from this change and not affected in any way -
1414	* this should get redone to only look for players within range,	1503	* this should get redone to only look for players within range,
1415	* or just updating the P_UPTODATE for spaces within this area	1504	* or just updating the P_UPTODATE for spaces within this area
1416	* of effect may be sufficient.	1505	* of effect may be sufficient.
1417	*/	1506	*/
1418	if (op->map->darkness && (op->glow_radius != 0))	1507	if (op->affects_los ())
		1508	{
		1509	op->ms ().invalidate ();
1419	update_all_los (op->map, op->x, op->y);	1510	update_all_los (op->map, op->x, op->y);
		1511	}
1420		1512
1421	/* updates flags (blocked, alive, no magic, etc) for this map space */	1513	/* updates flags (blocked, alive, no magic, etc) for this map space */
1422	update_object (op, UP_OBJ_INSERT);	1514	update_object (op, UP_OBJ_INSERT);
1423		1515
1424	INVOKE_OBJECT (INSERT, op);	1516	INVOKE_OBJECT (INSERT, op);
…		…
1431	* blocked() and wall() work properly), and these flags are updated by	1523	* blocked() and wall() work properly), and these flags are updated by
1432	* update_object().	1524	* update_object().
1433	*/	1525	*/
1434		1526
1435	/* if this is not the head or flag has been passed, don't check walk on status */	1527	/* if this is not the head or flag has been passed, don't check walk on status */
1436	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)	1528	if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1437	{	1529	{
1438	if (check_move_on (op, originator))	1530	if (check_move_on (op, originator))
1439	return 0;	1531	return 0;
1440		1532
1441	/* If we are a multi part object, lets work our way through the check	1533	/* If we are a multi part object, lets work our way through the check
…		…
1452	/* this function inserts an object in the map, but if it	1544	/* this function inserts an object in the map, but if it
1453	* finds an object of its own type, it'll remove that one first.	1545	* finds an object of its own type, it'll remove that one first.
1454	* op is the object to insert it under: supplies x and the map.	1546	* op is the object to insert it under: supplies x and the map.
1455	*/	1547	*/
1456	void	1548	void
1457	replace_insert_ob_in_map (const char *arch_string, object *op)	1549	replace_insert_ob_in_map (shstr_tmp archname, object *op)
1458	{	1550	{
1459	/* first search for itself and remove any old instances */	1551	/* first search for itself and remove any old instances */
1460		1552
1461	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)	1553	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1462	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1554	if (tmp->arch->archname == archname) /* same archetype */
1463	tmp->destroy (1);	1555	tmp->destroy ();
1464		1556
1465	object *tmp = arch_to_object (archetype::find (arch_string));	1557	object *tmp = arch_to_object (archetype::find (archname));
1466		1558
1467	tmp->x = op->x;	1559	tmp->x = op->x;
1468	tmp->y = op->y;	1560	tmp->y = op->y;
1469		1561
1470	insert_ob_in_map (tmp, op->map, op, 0);	1562	insert_ob_in_map (tmp, op->map, op, 0);
…		…
1477	return where->env->insert (this);	1569	return where->env->insert (this);
1478	else	1570	else
1479	return where->map->insert (this, where->x, where->y, originator, flags);	1571	return where->map->insert (this, where->x, where->y, originator, flags);
1480	}	1572	}
1481		1573
1482	/*	1574	// check whether we can put this into the map, respect max_volume, max_items
1483	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1575	bool
1484	* is returned contains nr objects, and the remaining parts contains	1576	object::can_drop_at (maptile *m, int x, int y, object *originator)
1485	* the rest (or is removed and freed if that number is 0).
1486	* On failure, NULL is returned, and the reason put into the
1487	* global static errmsg array.
1488	*/
1489	object *
1490	object::split_nr (sint32 nr)
1491	{	1577	{
1492	if (nrof < nr)	1578	mapspace &ms = m->at (x, y);
		1579
		1580	int items = ms.items ();
		1581
		1582	if (!items // testing !items ensures we can drop at least one item
		1583	|| (items < m->max_items
		1584	&& ms.volume () < m->max_volume))
1493	return 0;	1585	return true;
1494	else if (nrof == nr)
1495	{
1496	remove ();
1497	return this;
1498	}
1499	else
1500	{
1501	decrease_nr (nr);
1502		1586
1503	object *op = object_create_clone (this);	1587	if (originator && originator->is_player ())
1504	op->nrof = nr;	1588	originator->contr->failmsg (format (
1505	return op;	1589	"No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1506	}	1590	query_name ()
1507	}	1591	));
1508		1592
1509	//TODO: remove, but semantics differs from split_nr
1510	object *
1511	get_split_ob (object *orig_ob, uint32 nr)
1512	{
1513	if (orig_ob->nrof < nr)
1514	{
1515	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1516	return 0;
1517	}
1518
1519	return orig_ob->split_nr (nr);
1520	}
1521
1522	// find player who can see this object
1523	static object *
1524	visible_to (object *op)
1525	{
1526	if (!op->flag [FLAG_REMOVED])
1527	{
1528	// see if we are in a container of sorts
1529	if (object *env = op->env)
1530	{
1531	// the player inventory itself is always visible
1532	if (env->type == PLAYER)
1533	return env;
1534
1535	// else a player could have our env open
1536	env = env->outer_env ();
1537
1538	// the player itself is always on a map, so we will find him here
1539	// even if our inv is in a player.
1540	if (env->is_on_map ())
1541	if (object *pl = env->ms ().player ())
1542	if (pl->container == op->env)
1543	return pl;
1544	}
1545	else
1546	{
1547	// maybe there is a player standing on the same mapspace
1548	if (object *pl = env->ms ().player ())
1549	return pl;
1550	}
1551	}
1552
1553	return 0;	1593	return false;
1554	}	1594	}
1555		1595
1556	/*	1596	/*
1557	* decrease_ob_nr(object, number) decreases a specified number from	1597	* decrease(object, number) decreases a specified number from
1558	* the amount of an object. If the amount reaches 0, the object	1598	* the amount of an object. If the amount reaches 0, the object
1559	* is subsequently removed and freed.	1599	* is subsequently removed and freed.
1560	*	1600	*
1561	* Return value: 'op' if something is left, NULL if the amount reached 0	1601	* Return value: 'op' if something is left, NULL if the amount reached 0
1562	*/	1602	*/
1563	bool	1603	bool
1564	object::decrease_nr (sint32 nr)	1604	object::decrease (sint32 nr)
1565	{	1605	{
		1606	if (!nr)
		1607	return true;
		1608
1566	nr = min (nr, nrof);	1609	nr = min (nr, nrof);
1567		1610
1568	if (!nr)	1611	if (nrof > nr)
1569	return 1;	1612	{
1570
1571	nrof -= nr;	1613	nrof -= nr;
1572
1573	object *visible = visible_to (this);
1574
1575	if (nrof)
1576	{
1577	adjust_weight (env, -weight * nr); // carrying == 0	1614	adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1578		1615
1579	if (visible)	1616	if (object *pl = visible_to ())
1580	esrv_send_item (visible, this);	1617	esrv_update_item (UPD_NROF, pl, this);
1581		1618
1582	return 1;	1619	return true;
1583	}	1620	}
1584	else	1621	else
1585	{	1622	{
1586	if (visible)
1587	esrv_del_item (visible->contr, count);
1588
1589	this->destroy (1);	1623	destroy ();
1590	return 0;	1624	return false;
1591	}	1625	}
1592	}	1626	}
1593		1627
1594	//TODO: remove	1628	/*
		1629	* split(ob,nr) splits up ob into two parts. The part which
		1630	* is returned contains nr objects, and the remaining parts contains
		1631	* the rest (or is removed and returned if that number is 0).
		1632	* On failure, NULL is returned.
		1633	*/
1595	object *	1634	object *
1596	decrease_ob_nr (object *op, uint32 i)	1635	object::split (sint32 nr)
1597	{	1636	{
1598	return op->decrease_nr (i) ? op : 0;	1637	int have = number_of ();
		1638
		1639	if (have < nr)
		1640	return 0;
		1641	else if (have == nr)
		1642	{
		1643	remove ();
		1644	return this;
		1645	}
		1646	else
		1647	{
		1648	decrease (nr);
		1649
		1650	object *op = deep_clone ();
		1651	op->nrof = nr;
		1652	return op;
		1653	}
1599	}	1654	}
1600		1655
1601	object *	1656	object *
1602	insert_ob_in_ob (object *op, object *where)	1657	insert_ob_in_ob (object *op, object *where)
1603	{	1658	{
…		…
1644	if (object::can_merge (tmp, op))	1699	if (object::can_merge (tmp, op))
1645	{	1700	{
1646	/* return the original object and remove inserted object	1701	/* return the original object and remove inserted object
1647	(client needs the original object) */	1702	(client needs the original object) */
1648	tmp->nrof += op->nrof;	1703	tmp->nrof += op->nrof;
		1704
		1705	if (object *pl = tmp->visible_to ())
		1706	esrv_update_item (UPD_NROF, pl, tmp);
		1707
		1708	adjust_weight (this, op->total_weight ());
		1709
1649	op->destroy (1);	1710	op->destroy ();
1650	op = tmp;	1711	op = tmp;
1651	goto inserted;	1712	goto inserted;
1652	}	1713	}
1653		1714
1654	op->owner = 0; // it's his/hers now. period.	1715	op->owner = 0; // it's his/hers now. period.
…		…
1665		1726
1666	inv = op;	1727	inv = op;
1667		1728
1668	op->flag [FLAG_REMOVED] = 0;	1729	op->flag [FLAG_REMOVED] = 0;
1669		1730
		1731	if (object *pl = op->visible_to ())
		1732	esrv_send_item (pl, op);
		1733
1670	adjust_weight (this, op->total_weight ());	1734	adjust_weight (this, op->total_weight ());
1671		1735
1672	inserted:	1736	inserted:
1673	/* reset the light list and los of the players on the map */	1737	/* reset the light list and los of the players on the map */
1674	if (op->glow_radius && map && map->darkness)	1738	if (op->glow_radius && is_on_map ())
		1739	{
		1740	update_stats ();
1675	update_all_los (map, x, y);	1741	update_all_los (map, x, y);
1676		1742	}
1677	if (object *otmp = in_player ())	1743	else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1678	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1744	// if this is a player's inventory, update stats
1679	otmp->update_stats ();	1745	update_stats ();
1680		1746
1681	INVOKE_OBJECT (INSERT, this);	1747	INVOKE_OBJECT (INSERT, this);
1682		1748
1683	return op;	1749	return op;
1684	}	1750	}
…		…
1704	* on top.	1770	* on top.
1705	*/	1771	*/
1706	int	1772	int
1707	check_move_on (object *op, object *originator)	1773	check_move_on (object *op, object *originator)
1708	{	1774	{
		1775	if (QUERY_FLAG (op, FLAG_NO_APPLY))
		1776	return 0;
		1777
1709	object *tmp;	1778	object *tmp;
1710	maptile *m = op->map;	1779	maptile *m = op->map;
1711	int x = op->x, y = op->y;	1780	int x = op->x, y = op->y;
1712		1781
1713	MoveType move_on, move_slow, move_block;	1782	mapspace &ms = m->at (x, y);
1714		1783
1715	if (QUERY_FLAG (op, FLAG_NO_APPLY))	1784	ms.update ();
1716	return 0;
1717		1785
1718	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);	1786	MoveType move_on = ms.move_on;
1719	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);	1787	MoveType move_slow = ms.move_slow;
1720	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);	1788	MoveType move_block = ms.move_block;
1721		1789
1722	/* if nothing on this space will slow op down or be applied,	1790	/* if nothing on this space will slow op down or be applied,
1723	* no need to do checking below. have to make sure move_type	1791	* no need to do checking below. have to make sure move_type
1724	* is set, as lots of objects don't have it set - we treat that	1792	* is set, as lots of objects don't have it set - we treat that
1725	* as walking.	1793	* as walking.
…		…
1736	return 0;	1804	return 0;
1737		1805
1738	/* The objects have to be checked from top to bottom.	1806	/* The objects have to be checked from top to bottom.
1739	* Hence, we first go to the top:	1807	* Hence, we first go to the top:
1740	*/	1808	*/
1741		1809	for (object *next, *tmp = ms.top; tmp; tmp = next)
1742	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1743	{
1744	/* Trim the search when we find the first other spell effect
1745	* this helps performance so that if a space has 50 spell objects,
1746	* we don't need to check all of them.
1747	*/
1748	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1749	break;
1750	}	1810	{
		1811	next = tmp->below;
1751		1812
1752	for (; tmp; tmp = tmp->below)
1753	{
1754	if (tmp == op)	1813	if (tmp == op)
1755	continue; /* Can't apply yourself */	1814	continue; /* Can't apply yourself */
1756		1815
1757	/* Check to see if one of the movement types should be slowed down.	1816	/* Check to see if one of the movement types should be slowed down.
1758	* Second check makes sure that the movement types not being slowed	1817	* Second check makes sure that the movement types not being slowed
…		…
1763	if (!QUERY_FLAG (op, FLAG_WIZPASS))	1822	if (!QUERY_FLAG (op, FLAG_WIZPASS))
1764	{	1823	{
1765	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1824	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1766	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1825	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1767	{	1826	{
1768
1769	float
1770	diff = tmp->move_slow_penalty * fabs (op->speed);	1827	float diff = tmp->move_slow_penalty * fabs (op->speed);
1771		1828
1772	if (op->type == PLAYER)	1829	if (op->is_player ())
1773	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1830	if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1774	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1831	(tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1775	diff /= 4.0;	1832	diff /= 4.0;
1776		1833
1777	op->speed_left -= diff;	1834	op->speed_left -= diff;
1778	}	1835	}
1779	}	1836	}
…		…
1812	LOG (llevError, "Present_arch called outside map.\n");	1869	LOG (llevError, "Present_arch called outside map.\n");
1813	return NULL;	1870	return NULL;
1814	}	1871	}
1815		1872
1816	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)	1873	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1817	if (tmp->arch == at)	1874	if (tmp->arch->archname == at->archname)
1818	return tmp;	1875	return tmp;
1819		1876
1820	return NULL;	1877	return NULL;
1821	}	1878	}
1822		1879
…		…
1886	* The first matching object is returned, or NULL if none.	1943	* The first matching object is returned, or NULL if none.
1887	*/	1944	*/
1888	object *	1945	object *
1889	present_arch_in_ob (const archetype *at, const object *op)	1946	present_arch_in_ob (const archetype *at, const object *op)
1890	{	1947	{
1891	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1948	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1892	if (tmp->arch == at)	1949	if (tmp->arch->archname == at->archname)
1893	return tmp;	1950	return tmp;
1894		1951
1895	return NULL;	1952	return NULL;
1896	}	1953	}
1897		1954
…		…
1985	* head of the object should correspond for the entire object.	2042	* head of the object should correspond for the entire object.
1986	*/	2043	*/
1987	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))	2044	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1988	continue;	2045	continue;
1989		2046
1990	if (ob->blocked (m, pos.x, pos.y))	2047	if (ob->blocked (pos.m, pos.x, pos.y))
1991	continue;	2048	continue;
1992		2049
1993	altern [index++] = i;	2050	altern [index++] = i;
1994	}	2051	}
1995		2052
…		…
2063	* there is capable of.	2120	* there is capable of.
2064	*/	2121	*/
2065	int	2122	int
2066	find_dir (maptile *m, int x, int y, object *exclude)	2123	find_dir (maptile *m, int x, int y, object *exclude)
2067	{	2124	{
2068	int i, max = SIZEOFFREE, mflags;	2125	int max = SIZEOFFREE, mflags;
2069
2070	sint16 nx, ny;
2071	object *tmp;
2072	maptile *mp;
2073
2074	MoveType blocked, move_type;	2126	MoveType move_type;
2075		2127
2076	if (exclude && exclude->head_ () != exclude)	2128	if (exclude && exclude->head_ () != exclude)
2077	{	2129	{
2078	exclude = exclude->head;	2130	exclude = exclude->head;
2079	move_type = exclude->move_type;	2131	move_type = exclude->move_type;
…		…
2082	{	2134	{
2083	/* If we don't have anything, presume it can use all movement types. */	2135	/* If we don't have anything, presume it can use all movement types. */
2084	move_type = MOVE_ALL;	2136	move_type = MOVE_ALL;
2085	}	2137	}
2086		2138
2087	for (i = 1; i < max; i++)	2139	for (int i = 1; i < max; i++)
2088	{	2140	{
2089	mp = m;	2141	mapxy pos (m, x, y);
2090	nx = x + freearr_x[i];	2142	pos.move (i);
2091	ny = y + freearr_y[i];
2092		2143
2093	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2144	if (!pos.normalise ())
2094
2095	if (mflags & P_OUT_OF_MAP)
2096	max = maxfree[i];	2145	max = maxfree[i];
2097	else	2146	else
2098	{	2147	{
2099	mapspace &ms = mp->at (nx, ny);	2148	mapspace &ms = *pos;
2100		2149
2101	blocked = ms.move_block;
2102
2103	if ((move_type & blocked) == move_type)	2150	if ((move_type & ms.move_block) == move_type)
2104	max = maxfree[i];	2151	max = maxfree [i];
2105	else if (mflags & P_IS_ALIVE)	2152	else if (ms.flags () & P_IS_ALIVE)
2106	{	2153	{
2107	for (tmp = ms.bot; tmp; tmp = tmp->above)	2154	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2108	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)	2155	if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2109	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))	2156	&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2110	break;
2111
2112	if (tmp)
2113	return freedir[i];	2157	return freedir [i];
2114	}	2158	}
2115	}	2159	}
2116	}	2160	}
2117		2161
2118	return 0;	2162	return 0;
…		…
2193	* This basically means that if direction is 15, then it could either go	2237	* This basically means that if direction is 15, then it could either go
2194	* direction 4, 14, or 16 to get back to where we are.	2238	* direction 4, 14, or 16 to get back to where we are.
2195	* Moved from spell_util.c to object.c with the other related direction	2239	* Moved from spell_util.c to object.c with the other related direction
2196	* functions.	2240	* functions.
2197	*/	2241	*/
2198	int reduction_dir[SIZEOFFREE][3] = {	2242	static const int reduction_dir[SIZEOFFREE][3] = {
2199	{0, 0, 0}, /* 0 */	2243	{0, 0, 0}, /* 0 */
2200	{0, 0, 0}, /* 1 */	2244	{0, 0, 0}, /* 1 */
2201	{0, 0, 0}, /* 2 */	2245	{0, 0, 0}, /* 2 */
2202	{0, 0, 0}, /* 3 */	2246	{0, 0, 0}, /* 3 */
2203	{0, 0, 0}, /* 4 */	2247	{0, 0, 0}, /* 4 */
…		…
2299	int	2343	int
2300	can_pick (const object *who, const object *item)	2344	can_pick (const object *who, const object *item)
2301	{	2345	{
2302	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2346	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2303	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2347	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2304	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2348	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2305	}	2349	}
2306		2350
2307	/*	2351	/*
2308	* create clone from object to another	2352	* create clone from object to another
2309	*/	2353	*/
2310	object *	2354	object *
2311	object_create_clone (object *asrc)	2355	object::deep_clone ()
2312	{	2356	{
2313	object *dst = 0, *tmp, *src, *prev, *item;	2357	assert (("deep_clone called on non-head object", is_head ()));
2314		2358
2315	if (!asrc)	2359	object *dst = clone ();
2316	return 0;
2317		2360
2318	src = asrc->head_ ();	2361	object *prev = dst;
2319
2320	prev = 0;
2321	for (object *part = src; part; part = part->more)	2362	for (object *part = this->more; part; part = part->more)
2322	{	2363	{
2323	tmp = part->clone ();	2364	object *tmp = part->clone ();
2324	tmp->x -= src->x;
2325	tmp->y -= src->y;
2326
2327	if (!part->head)
2328	{
2329	dst = tmp;
2330	tmp->head = 0;
2331	}
2332	else
2333	tmp->head = dst;	2365	tmp->head = dst;
2334
2335	tmp->more = 0;
2336
2337	if (prev)
2338	prev->more = tmp;	2366	prev->more = tmp;
2339
2340	prev = tmp;	2367	prev = tmp;
2341	}	2368	}
2342		2369
2343	for (item = src->inv; item; item = item->below)	2370	for (object *item = inv; item; item = item->below)
2344	insert_ob_in_ob (object_create_clone (item), dst);	2371	insert_ob_in_ob (item->deep_clone (), dst);
2345		2372
2346	return dst;	2373	return dst;
2347	}	2374	}
2348		2375
2349	/* This returns the first object in who's inventory that	2376	/* This returns the first object in who's inventory that
…		…
2358	return tmp;	2385	return tmp;
2359		2386
2360	return 0;	2387	return 0;
2361	}	2388	}
2362		2389
2363	/* If ob has a field named key, return the link from the list,	2390	shstr_tmp
2364	* otherwise return NULL.	2391	object::kv_get (shstr_tmp key) const
2365	*
2366	* key must be a passed in shared string - otherwise, this won't
2367	* do the desired thing.
2368	*/
2369	key_value *
2370	get_ob_key_link (const object *ob, const char *key)
2371	{	2392	{
2372	for (key_value *link = ob->key_values; link; link = link->next)	2393	for (key_value *kv = key_values; kv; kv = kv->next)
2373	if (link->key == key)	2394	if (kv->key == key)
2374	return link;
2375
2376	return 0;
2377	}
2378
2379	/*
2380	* Returns the value of op has an extra_field for key, or NULL.
2381	*
2382	* The argument doesn't need to be a shared string.
2383	*
2384	* The returned string is shared.
2385	*/
2386	const char *
2387	get_ob_key_value (const object *op, const char *const key)
2388	{
2389	key_value *link;
2390	shstr_cmp canonical_key (key);
2391
2392	if (!canonical_key)
2393	{
2394	/* 1. There being a field named key on any object
2395	* implies there'd be a shared string to find.
2396	* 2. Since there isn't, no object has this field.
2397	* 3. Therefore, *this* object doesn't have this field.
2398	*/
2399	return 0;
2400	}
2401
2402	/* This is copied from get_ob_key_link() above -
2403	* only 4 lines, and saves the function call overhead.
2404	*/
2405	for (link = op->key_values; link; link = link->next)
2406	if (link->key == canonical_key)
2407	return link->value;	2395	return kv->value;
2408		2396
2409	return 0;	2397	return shstr ();
2410	}	2398	}
2411		2399
2412	/*	2400	void
2413	* Updates the canonical_key in op to value.	2401	object::kv_set (shstr_tmp key, shstr_tmp value)
2414	*
2415	* canonical_key is a shared string (value doesn't have to be).
2416	*
2417	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2418	* keys.
2419	*
2420	* Returns TRUE on success.
2421	*/
2422	int
2423	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2424	{	2402	{
2425	key_value *field = NULL, *last = NULL;	2403	for (key_value *kv = key_values; kv; kv = kv->next)
2426		2404	if (kv->key == key)
2427	for (field = op->key_values; field != NULL; field = field->next)
2428	{
2429	if (field->key != canonical_key)
2430	{	2405	{
2431	last = field;	2406	kv->value = value;
2432	continue;	2407	return;
2433	}	2408	}
2434		2409
2435	if (value)	2410	key_value *kv = new key_value;
2436	field->value = value;	2411
2437	else	2412	kv->next = key_values;
		2413	kv->key = key;
		2414	kv->value = value;
		2415
		2416	key_values = kv;
		2417	}
		2418
		2419	void
		2420	object::kv_del (shstr_tmp key)
		2421	{
		2422	for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
		2423	if ((*kvp)->key == key)
2438	{	2424	{
2439	/* Basically, if the archetype has this key set,	2425	key_value *kv = *kvp;
2440	* we need to store the null value so when we save	2426	*kvp = (*kvp)->next;
2441	* it, we save the empty value so that when we load,	2427	delete kv;
2442	* we get this value back again.	2428	return;
2443	*/
2444	if (get_ob_key_link (op->arch, canonical_key))
2445	field->value = 0;
2446	else
2447	{
2448	if (last)
2449	last->next = field->next;
2450	else
2451	op->key_values = field->next;
2452
2453	delete field;
2454	}
2455	}	2429	}
2456	return TRUE;
2457	}
2458	/* IF we get here, key doesn't exist */
2459
2460	/* No field, we'll have to add it. */
2461
2462	if (!add_key)
2463	return FALSE;
2464
2465	/* There isn't any good reason to store a null
2466	* value in the key/value list. If the archetype has
2467	* this key, then we should also have it, so shouldn't
2468	* be here. If user wants to store empty strings,
2469	* should pass in ""
2470	*/
2471	if (value == NULL)
2472	return TRUE;
2473
2474	field = new key_value;
2475
2476	field->key = canonical_key;
2477	field->value = value;
2478	/* Usual prepend-addition. */
2479	field->next = op->key_values;
2480	op->key_values = field;
2481
2482	return TRUE;
2483	}
2484
2485	/*
2486	* Updates the key in op to value.
2487	*
2488	* If add_key is FALSE, this will only update existing keys,
2489	* and not add new ones.
2490	* In general, should be little reason FALSE is ever passed in for add_key
2491	*
2492	* Returns TRUE on success.
2493	*/
2494	int
2495	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2496	{
2497	shstr key_ (key);
2498
2499	return set_ob_key_value_s (op, key_, value, add_key);
2500	}	2430	}
2501		2431
2502	object::depth_iterator::depth_iterator (object *container)	2432	object::depth_iterator::depth_iterator (object *container)
2503	: iterator_base (container)	2433	: iterator_base (container)
2504	{	2434	{
…		…
2554	{	2484	{
2555	char flagdesc[512];	2485	char flagdesc[512];
2556	char info2[256 * 4];	2486	char info2[256 * 4];
2557	char *p = info;	2487	char *p = info;
2558		2488
2559	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",	2489	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2560	count,	2490	count,
2561	uuid.c_str (),	2491	uuid.c_str (),
2562	&name,	2492	&name,
2563	title ? "\",title:\"" : "",	2493	title ? ",title:\"" : "",
2564	title ? (const char *)title : "",	2494	title ? (const char *)title : "",
		2495	title ? "\"" : "",
2565	flag_desc (flagdesc, 512), type);	2496	flag_desc (flagdesc, 512), type);
2566		2497
2567	if (!this->flag[FLAG_REMOVED] && env)	2498	if (!flag[FLAG_REMOVED] && env)
2568	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2499	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2569		2500
2570	if (map)	2501	if (map)
2571	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2502	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2572		2503
…		…
2587	{	2518	{
2588	return map ? map->region (x, y)	2519	return map ? map->region (x, y)
2589	: region::default_region ();	2520	: region::default_region ();
2590	}	2521	}
2591		2522
2592	const materialtype_t *
2593	object::dominant_material () const
2594	{
2595	if (materialtype_t *mt = name_to_material (materialname))
2596	return mt;
2597
2598	return name_to_material (shstr_unknown);
2599	}
2600
2601	void	2523	void
2602	object::open_container (object *new_container)	2524	object::open_container (object *new_container)
2603	{	2525	{
2604	if (container == new_container)	2526	if (container == new_container)
2605	return;	2527	return;
2606		2528
2607	if (object *old_container = container)	2529	object *old_container = container;
		2530
		2531	if (old_container)
2608	{	2532	{
2609	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))	2533	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2610	return;	2534	return;
2611		2535
2612	#if 0	2536	#if 0
…		…
2614	if (object *closer = old_container->inv)	2538	if (object *closer = old_container->inv)
2615	if (closer->type == CLOSE_CON)	2539	if (closer->type == CLOSE_CON)
2616	closer->destroy ();	2540	closer->destroy ();
2617	#endif	2541	#endif
2618		2542
		2543	// make sure the container is available
		2544	esrv_send_item (this, old_container);
		2545
2619	old_container->flag [FLAG_APPLIED] = 0;	2546	old_container->flag [FLAG_APPLIED] = false;
2620	container = 0;	2547	container = 0;
2621		2548
		2549	// client needs item update to make it work, client bug requires this to be separate
2622	esrv_update_item (UPD_FLAGS, this, old_container);	2550	esrv_update_item (UPD_FLAGS, this, old_container);
		2551
2623	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2552	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2624	play_sound (sound_find ("chest_close"));	2553	play_sound (sound_find ("chest_close"));
2625	}	2554	}
2626		2555
2627	if (new_container)	2556	if (new_container)
2628	{	2557	{
…		…
2638	closer->flag [FLAG_NO_MAP_SAVE] = 1;	2567	closer->flag [FLAG_NO_MAP_SAVE] = 1;
2639	new_container->insert (closer);	2568	new_container->insert (closer);
2640	}	2569	}
2641	#endif	2570	#endif
2642		2571
2643	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2572	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2644		2573
		2574	// make sure the container is available, client bug requires this to be separate
		2575	esrv_send_item (this, new_container);
		2576
2645	new_container->flag [FLAG_APPLIED] = 1;	2577	new_container->flag [FLAG_APPLIED] = true;
2646	container = new_container;	2578	container = new_container;
2647		2579
		2580	// client needs flag change
2648	esrv_update_item (UPD_FLAGS, this, new_container);	2581	esrv_update_item (UPD_FLAGS, this, new_container);
2649	esrv_send_inventory (this, new_container);	2582	esrv_send_inventory (this, new_container);
2650	play_sound (sound_find ("chest_open"));	2583	play_sound (sound_find ("chest_open"));
2651	}	2584	}
		2585	// else if (!old_container->env && contr && contr->ns)
		2586	// contr->ns->floorbox_reset ();
2652	}	2587	}
2653		2588
2654	object *	2589	object *
2655	object::force_find (const shstr name)	2590	object::force_find (shstr_tmp name)
2656	{	2591	{
2657	/* cycle through his inventory to look for the MARK we want to	2592	/* cycle through his inventory to look for the MARK we want to
2658	* place	2593	* place
2659	*/	2594	*/
2660	for (object *tmp = inv; tmp; tmp = tmp->below)	2595	for (object *tmp = inv; tmp; tmp = tmp->below)
…		…
2662	return splay (tmp);	2597	return splay (tmp);
2663		2598
2664	return 0;	2599	return 0;
2665	}	2600	}
2666		2601
		2602	//-GPL
		2603
2667	void	2604	void
		2605	object::force_set_timer (int duration)
		2606	{
		2607	this->duration = 1;
		2608	this->speed_left = -1.f;
		2609
		2610	this->set_speed (duration ? 1.f / duration : 0.f);
		2611	}
		2612
		2613	object *
2668	object::force_add (const shstr name, int duration)	2614	object::force_add (shstr_tmp name, int duration)
2669	{	2615	{
2670	if (object *force = force_find (name))	2616	if (object *force = force_find (name))
2671	force->destroy ();	2617	force->destroy ();
2672		2618
2673	object *force = get_archetype (FORCE_NAME);	2619	object *force = get_archetype (FORCE_NAME);
2674		2620
2675	force->slaying = name;	2621	force->slaying = name;
2676	force->stats.food = 1;	2622	force->force_set_timer (duration);
2677	force->speed_left = -1.f;
2678
2679	force->set_speed (duration ? 1.f / duration : 0.f);
2680	force->flag [FLAG_IS_USED_UP] = true;
2681	force->flag [FLAG_APPLIED] = true;	2623	force->flag [FLAG_APPLIED] = true;
2682		2624
2683	insert (force);	2625	return insert (force);
2684	}	2626	}
2685		2627
2686	void	2628	void
2687	object::play_sound (faceidx sound)	2629	object::play_sound (faceidx sound) const
2688	{	2630	{
2689	if (!sound)	2631	if (!sound)
2690	return;	2632	return;
2691		2633
2692	if (flag [FLAG_REMOVED])	2634	if (is_on_map ())
		2635	map->play_sound (sound, x, y);
		2636	else if (object *pl = in_player ())
		2637	pl->contr->play_sound (sound);
		2638	}
		2639
		2640	void
		2641	object::say_msg (const char *msg) const
		2642	{
		2643	if (is_on_map ())
		2644	map->say_msg (msg, x, y);
		2645	else if (object *pl = in_player ())
		2646	pl->contr->play_sound (sound);
		2647	}
		2648
		2649	void
		2650	object::make_noise ()
		2651	{
		2652	// we do not model noise in the map, so instead put
		2653	// a temporary light into the noise source
		2654	// could use the map instead, but that's less reliable for our
		2655	// goal, which is to make invisibility a bit harder to exploit
		2656
		2657	// currently only works sensibly for players
		2658	if (!is_player ())
2693	return;	2659	return;
2694		2660
2695	if (env)	2661	// find old force, or create new one
2696	{	2662	object *force = force_find (shstr_noise_force);
2697	if (object *pl = in_player ())	2663
2698	pl->contr->play_sound (sound);	2664	if (force)
2699	}	2665	force->speed_left = -1.f; // patch old speed up
2700	else	2666	else
2701	map->play_sound (sound, x, y);	2667	{
2702	}	2668	force = archetype::get (shstr_noise_force);
2703		2669
		2670	force->slaying = shstr_noise_force;
		2671	force->stats.food = 1;
		2672	force->speed_left = -1.f;
		2673
		2674	force->set_speed (1.f / 4.f);
		2675	force->flag [FLAG_IS_USED_UP] = true;
		2676	force->flag [FLAG_APPLIED] = true;
		2677
		2678	insert (force);
		2679	}
		2680	}
		2681

Diff Legend

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