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.64 by root, Tue Dec 12 21:39:56 2006 UTC vs.
Revision 1.139 by root, Sat Apr 21 17:34:22 2007 UTC

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

Diff Legend

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