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.54 by root, Fri Nov 17 19:40:53 2006 UTC vs.
Revision 1.127 by elmex, Mon Jan 29 21:04:32 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,
…		…
104	_exit (1);	108	_exit (1);
105	}	109	}
106		110
107	uuid.seq = uid;	111	uuid.seq = uid;
108	write_uuid ();	112	write_uuid ();
109	LOG (llevDebug, "read UID: %lld\n", uid);	113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);
110	fclose (fp);	114	fclose (fp);
111	}	115	}
112		116
113	UUID	117	UUID
114	gen_uuid ()	118	gen_uuid ()
…		…
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		362
…		…
381	{	365	{
382	if (!op)	366	if (!op)
383	return strdup ("[NULLOBJ]");	367	return strdup ("[NULLOBJ]");
384		368
385	object_freezer freezer;	369	object_freezer freezer;
386	save_object (freezer, op, 3);	370	save_object (freezer, op, 1);
387	return freezer.as_string ();	371	return freezer.as_string ();
388	}	372	}
389		373
390	/*	374	/*
391	* get_nearest_part(multi-object, object 2) returns the part of the	375	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
408	}	392	}
409		393
410	/*	394	/*
411	* Returns the object which has the count-variable equal to the argument.	395	* Returns the object which has the count-variable equal to the argument.
412	*/	396	*/
413
414	object *	397	object *
415	find_object (tag_t i)	398	find_object (tag_t i)
416	{	399	{
417	for (object *op = object::first; op; op = op->next)	400	for_all_objects (op)
418	if (op->count == i)	401	if (op->count == i)
419	return op;	402	return op;
420		403
421	return 0;	404	return 0;
422	}	405	}
423		406
424	/*	407	/*
425	* Returns the first object which has a name equal to the argument.	408	* Returns the first object which has a name equal to the argument.
426	* Used only by the patch command, but not all that useful.	409	* Used only by the patch command, but not all that useful.
427	* Enables features like "patch <name-of-other-player> food 999"	410	* Enables features like "patch <name-of-other-player> food 999"
428	*/	411	*/
429
430	object *	412	object *
431	find_object_name (const char *str)	413	find_object_name (const char *str)
432	{	414	{
433	shstr_cmp str_ (str);	415	shstr_cmp str_ (str);
434	object *op;	416	object *op;
435		417
436	for (op = object::first; op != NULL; op = op->next)	418	for_all_objects (op)
437	if (op->name == str_)	419	if (op->name == str_)
438	break;	420	break;
439		421
440	return op;	422	return op;
441	}	423	}
…		…
484	}	466	}
485		467
486	op->key_values = 0;	468	op->key_values = 0;
487	}	469	}
488		470
489	void object::clear ()
490	{
491	attachable_base::clear ();
492
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	void object::clone (object *destination)
532	{
533	*(object_copy *)destination = *this;
534	*(object_pod *)destination = *this;
535
536	if (self || cb)
537	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
538	}
539
540	/*	471	/*
541	* copy object first frees everything allocated by the second object,	472	* copy_to first frees everything allocated by the dst object,
542	* and then copies the contends of the first object into the second	473	* and then copies the contents of itself into the second
543	* object, allocating what needs to be allocated. Basically, any	474	* object, allocating what needs to be allocated. Basically, any
544	* data that is malloc'd needs to be re-malloc/copied. Otherwise,	475	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
545	* if the first object is freed, the pointers in the new object	476	* if the first object is freed, the pointers in the new object
546	* will point at garbage.	477	* will point at garbage.
547	*/	478	*/
548	void	479	void
549	copy_object (object *op2, object *op)	480	object::copy_to (object *dst)
550	{	481	{
551	bool is_freed = QUERY_FLAG (op, FLAG_FREED);	482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
552	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);	483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
553		484
554	op2->clone (op);	485	*(object_copy *)dst = *this;
555		486
556	if (is_freed)	487	if (is_freed)
557	SET_FLAG (op, FLAG_FREED);	488	SET_FLAG (dst, FLAG_FREED);
		489
558	if (is_removed)	490	if (is_removed)
559	SET_FLAG (op, FLAG_REMOVED);	491	SET_FLAG (dst, FLAG_REMOVED);
560		492
561	if (op2->speed < 0)	493	if (speed < 0)
562	op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0;	494	dst->speed_left = speed_left - rndm ();
563		495
564	/* Copy over key_values, if any. */	496	/* Copy over key_values, if any. */
565	if (op2->key_values)	497	if (key_values)
566	{	498	{
567	key_value *tail = 0;	499	key_value *tail = 0;
568	key_value *i;	500	key_value *i;
569		501
570	op->key_values = 0;	502	dst->key_values = 0;
571		503
572	for (i = op2->key_values; i; i = i->next)	504	for (i = key_values; i; i = i->next)
573	{	505	{
574	key_value *new_link = new key_value;	506	key_value *new_link = new key_value;
575		507
576	new_link->next = 0;	508	new_link->next = 0;
577	new_link->key = i->key;	509	new_link->key = i->key;
578	new_link->value = i->value;	510	new_link->value = i->value;
579		511
580	/* Try and be clever here, too. */	512	/* Try and be clever here, too. */
581	if (!op->key_values)	513	if (!dst->key_values)
582	{	514	{
583	op->key_values = new_link;	515	dst->key_values = new_link;
584	tail = new_link;	516	tail = new_link;
585	}	517	}
586	else	518	else
587	{	519	{
588	tail->next = new_link;	520	tail->next = new_link;
589	tail = new_link;	521	tail = new_link;
590	}	522	}
591	}	523	}
592	}	524	}
593		525
594	update_ob_speed (op);	526	dst->set_speed (dst->speed);
		527	}
		528
		529	object *
		530	object::clone ()
		531	{
		532	object *neu = create ();
		533	copy_to (neu);
		534	return neu;
595	}	535	}
596		536
597	/*	537	/*
598	* If an object with the IS_TURNABLE() flag needs to be turned due	538	* If an object with the IS_TURNABLE() flag needs to be turned due
599	* to the closest player being on the other side, this function can	539	* to the closest player being on the other side, this function can
600	* be called to update the face variable, _and_ how it looks on the map.	540	* be called to update the face variable, _and_ how it looks on the map.
601	*/	541	*/
602
603	void	542	void
604	update_turn_face (object *op)	543	update_turn_face (object *op)
605	{	544	{
606	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	545	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
607	return;	546	return;
		547
608	SET_ANIMATION (op, op->direction);	548	SET_ANIMATION (op, op->direction);
609	update_object (op, UP_OBJ_FACE);	549	update_object (op, UP_OBJ_FACE);
610	}	550	}
611		551
612	/*	552	/*
613	* Updates the speed of an object. If the speed changes from 0 to another	553	* Updates the speed of an object. If the speed changes from 0 to another
614	* value, or vice versa, then add/remove the object from the active list.	554	* value, or vice versa, then add/remove the object from the active list.
615	* This function needs to be called whenever the speed of an object changes.	555	* This function needs to be called whenever the speed of an object changes.
616	*/	556	*/
617	void	557	void
618	update_ob_speed (object *op)	558	object::set_speed (float speed)
619	{	559	{
620	extern int arch_init;	560	if (flag [FLAG_FREED] && speed)
621
622	/* No reason putting the archetypes objects on the speed list,
623	* since they never really need to be updated.
624	*/
625
626	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
627	{	561	{
628	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	562	LOG (llevError, "Object %s is freed but has speed.\n", &name);
629	#ifdef MANY_CORES
630	abort ();
631	#else
632	op->speed = 0;	563	speed = 0;
633	#endif
634	}
635
636	if (arch_init)
637	return;
638
639	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
640	{	564	}
641	/* If already on active list, don't do anything */
642	if (op->active_next || op->active_prev || op == active_objects)
643	return;
644		565
645	/* process_events() expects us to insert the object at the beginning	566	this->speed = speed;
646	* of the list. */
647	op->active_next = active_objects;
648		567
649	if (op->active_next != NULL)	568	if (has_active_speed ())
650	op->active_next->active_prev = op;	569	activate ();
651
652	active_objects = op;
653	}
654	else	570	else
655	{	571	deactivate ();
656	/* If not on the active list, nothing needs to be done */
657	if (!op->active_next && !op->active_prev && op != active_objects)
658	return;
659
660	if (op->active_prev == NULL)
661	{
662	active_objects = op->active_next;
663
664	if (op->active_next != NULL)
665	op->active_next->active_prev = NULL;
666	}
667	else
668	{
669	op->active_prev->active_next = op->active_next;
670
671	if (op->active_next)
672	op->active_next->active_prev = op->active_prev;
673	}
674
675	op->active_next = NULL;
676	op->active_prev = NULL;
677	}
678	}	572	}
679		573
680	/* This function removes object 'op' from the list of active
681	* objects.
682	* This should only be used for style maps or other such
683	* reference maps where you don't want an object that isn't
684	* in play chewing up cpu time getting processed.
685	* The reverse of this is to call update_ob_speed, which
686	* will do the right thing based on the speed of the object.
687	*/
688	void
689	remove_from_active_list (object *op)
690	{
691	/* If not on the active list, nothing needs to be done */
692	if (!op->active_next && !op->active_prev && op != active_objects)
693	return;
694
695	if (op->active_prev == NULL)
696	{
697	active_objects = op->active_next;
698	if (op->active_next != NULL)
699	op->active_next->active_prev = NULL;
700	}
701	else
702	{
703	op->active_prev->active_next = op->active_next;
704	if (op->active_next)
705	op->active_next->active_prev = op->active_prev;
706	}
707	op->active_next = NULL;
708	op->active_prev = NULL;
709	}
710
711	/*	574	/*
712	* update_object() updates the array which represents the map.	575	* update_object() updates the the map.
713	* It takes into account invisible objects (and represent squares covered	576	* It takes into account invisible objects (and represent squares covered
714	* by invisible objects by whatever is below them (unless it's another	577	* by invisible objects by whatever is below them (unless it's another
715	* invisible object, etc...)	578	* invisible object, etc...)
716	* If the object being updated is beneath a player, the look-window	579	* If the object being updated is beneath a player, the look-window
717	* of that player is updated (this might be a suboptimal way of	580	* of that player is updated (this might be a suboptimal way of
718	* updating that window, though, since update_object() is called _often_)	581	* updating that window, though, since update_object() is called _often_)
719	*	582	*
720	* action is a hint of what the caller believes need to be done.	583	* action is a hint of what the caller believes need to be done.
721	* For example, if the only thing that has changed is the face (due to
722	* an animation), we don't need to call update_position until that actually
723	* comes into view of a player. OTOH, many other things, like addition/removal
724	* of walls or living creatures may need us to update the flags now.
725	* current action are:	584	* current action are:
726	* UP_OBJ_INSERT: op was inserted	585	* UP_OBJ_INSERT: op was inserted
727	* UP_OBJ_REMOVE: op was removed	586	* UP_OBJ_REMOVE: op was removed
728	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	587	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
729	* as that is easier than trying to look at what may have changed.	588	* as that is easier than trying to look at what may have changed.
730	* UP_OBJ_FACE: only the objects face has changed.	589	* UP_OBJ_FACE: only the objects face has changed.
731	*/	590	*/
732
733	void	591	void
734	update_object (object *op, int action)	592	update_object (object *op, int action)
735	{	593	{
736	int update_now = 0, flags;
737	MoveType move_on, move_off, move_block, move_slow;	594	MoveType move_on, move_off, move_block, move_slow;
738		595
739	if (op == NULL)	596	if (op == NULL)
740	{	597	{
741	/* this should never happen */	598	/* this should never happen */
742	LOG (llevDebug, "update_object() called for NULL object.\n");	599	LOG (llevDebug, "update_object() called for NULL object.\n");
743	return;	600	return;
744	}	601	}
745		602
746	if (op->env != NULL)	603	if (op->env)
747	{	604	{
748	/* Animation is currently handled by client, so nothing	605	/* Animation is currently handled by client, so nothing
749	* to do in this case.	606	* to do in this case.
750	*/	607	*/
751	return;	608	return;
…		…
756	*/	613	*/
757	if (!op->map || op->map->in_memory == MAP_SAVING)	614	if (!op->map || op->map->in_memory == MAP_SAVING)
758	return;	615	return;
759		616
760	/* make sure the object is within map boundaries */	617	/* make sure the object is within map boundaries */
761	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))	618	if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
762	{	619	{
763	LOG (llevError, "update_object() called for object out of map!\n");	620	LOG (llevError, "update_object() called for object out of map!\n");
764	#ifdef MANY_CORES	621	#ifdef MANY_CORES
765	abort ();	622	abort ();
766	#endif	623	#endif
767	return;	624	return;
768	}	625	}
769		626
770	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	627	mapspace &m = op->ms ();
771	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
772	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
773	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
774	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
775	move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
776		628
		629	if (!(m.flags_ & P_UPTODATE))
		630	/* nop */;
777	if (action == UP_OBJ_INSERT)	631	else if (action == UP_OBJ_INSERT)
778	{	632	{
		633	// this is likely overkill, TODO: revisit (schmorp)
779	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	634	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
780	update_now = 1;
781
782	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	635	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
783	update_now = 1;	636	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
784		637	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		638	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
785	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	639	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
786	update_now = 1;
787
788	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
789	update_now = 1;
790
791	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
792	update_now = 1;
793
794	if ((move_on | op->move_on) != move_on)	640	|| (m.move_on | op->move_on ) != m.move_on
795	update_now = 1;
796
797	if ((move_off | op->move_off) != move_off)	641	|| (m.move_off | op->move_off ) != m.move_off
798	update_now = 1;	642	|| (m.move_slow | op->move_slow) != m.move_slow
799
800	/* This isn't perfect, but I don't expect a lot of objects to	643	/* This isn't perfect, but I don't expect a lot of objects to
801	* to have move_allow right now.	644	* to have move_allow right now.
802	*/	645	*/
803	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	646	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
804	update_now = 1;	647	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
805		648	m.flags_ = 0;
806	if ((move_slow | op->move_slow) != move_slow)
807	update_now = 1;
808	}	649	}
809	/* if the object is being removed, we can't make intelligent	650	/* if the object is being removed, we can't make intelligent
810	* decisions, because remove_ob can't really pass the object	651	* decisions, because remove_ob can't really pass the object
811	* that is being removed.	652	* that is being removed.
812	*/	653	*/
813	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	654	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
814	update_now = 1;	655	m.flags_ = 0;
815	else if (action == UP_OBJ_FACE)	656	else if (action == UP_OBJ_FACE)
816	/* Nothing to do for that case */ ;	657	/* Nothing to do for that case */ ;
817	else	658	else
818	LOG (llevError, "update_object called with invalid action: %d\n", action);	659	LOG (llevError, "update_object called with invalid action: %d\n", action);
819		660
820	if (update_now)
821	{
822	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
823	update_position (op->map, op->x, op->y);
824	}
825
826	if (op->more != NULL)	661	if (op->more)
827	update_object (op->more, action);	662	update_object (op->more, action);
828	}
829
830	object::vector object::mortals;
831	object::vector object::objects; // not yet used
832	object *object::first;
833
834	void object::free_mortals ()
835	{
836	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
837	if ((*i)->refcnt)
838	++i; // further delay freeing
839	else
840	{
841	delete *i;
842	mortals.erase (i);
843	}
844
845	static int lastmortals = 0;//D
846
847	if (mortals.size() != lastmortals && lastmortals > 100)//D
848	{
849	lastmortals = mortals.size ();//D
850	LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
851	}
852	}	663	}
853		664
854	object::object ()	665	object::object ()
855	{	666	{
856	SET_FLAG (this, FLAG_REMOVED);	667	SET_FLAG (this, FLAG_REMOVED);
…		…
859	face = blank_face;	670	face = blank_face;
860	}	671	}
861		672
862	object::~object ()	673	object::~object ()
863	{	674	{
		675	unlink ();
		676
864	free_key_values (this);	677	free_key_values (this);
865	}	678	}
866		679
		680	static int object_count;
		681
867	void object::link ()	682	void object::link ()
868	{	683	{
869	count = ++ob_count;	684	assert (!index);//D
870	uuid = gen_uuid ();	685	uuid = gen_uuid ();
		686	count = ++object_count;
871		687
872	prev = 0;	688	refcnt_inc ();
873	next = object::first;	689	objects.insert (this);
874
875	if (object::first)
876	object::first->prev = this;
877
878	object::first = this;
879	}	690	}
880		691
881	void object::unlink ()	692	void object::unlink ()
882	{	693	{
883	if (this == object::first)	694	if (!index)
884	object::first = next;	695	return;
885		696
886	/* Remove this object from the list of used objects */	697	objects.erase (this);
887	if (prev) prev->next = next;	698	refcnt_dec ();
888	if (next) next->prev = prev;	699	}
889		700
890	prev = 0;	701	void
891	next = 0;	702	object::activate ()
		703	{
		704	/* If already on active list, don't do anything */
		705	if (active)
		706	return;
		707
		708	if (has_active_speed ())
		709	actives.insert (this);
		710	}
		711
		712	void
		713	object::activate_recursive ()
		714	{
		715	activate ();
		716
		717	for (object *op = inv; op; op = op->below)
		718	op->activate_recursive ();
		719	}
		720
		721	/* This function removes object 'op' from the list of active
		722	* objects.
		723	* This should only be used for style maps or other such
		724	* reference maps where you don't want an object that isn't
		725	* in play chewing up cpu time getting processed.
		726	* The reverse of this is to call update_ob_speed, which
		727	* will do the right thing based on the speed of the object.
		728	*/
		729	void
		730	object::deactivate ()
		731	{
		732	/* If not on the active list, nothing needs to be done */
		733	if (!active)
		734	return;
		735
		736	actives.erase (this);
		737	}
		738
		739	void
		740	object::deactivate_recursive ()
		741	{
		742	for (object *op = inv; op; op = op->below)
		743	op->deactivate_recursive ();
		744
		745	deactivate ();
		746	}
		747
		748	void
		749	object::set_flag_inv (int flag, int value)
		750	{
		751	for (object *op = inv; op; op = op->below)
		752	{
		753	op->flag [flag] = value;
		754	op->set_flag_inv (flag, value);
		755	}
		756	}
		757
		758	/*
		759	* Remove and free all objects in the inventory of the given object.
		760	* object.c ?
		761	*/
		762	void
		763	object::destroy_inv (bool drop_to_ground)
		764	{
		765	// need to check first, because the checks below might segfault
		766	// as we might be on an invalid mapspace and crossfire code
		767	// is too buggy to ensure that the inventory is empty.
		768	// corollary: if you create arrows etc. with stuff in tis inventory,
		769	// cf will crash below with off-map x and y
		770	if (!inv)
		771	return;
		772
		773	/* Only if the space blocks everything do we not process -
		774	* if some form of movement is allowed, let objects
		775	* drop on that space.
		776	*/
		777	if (!drop_to_ground
		778	|| !map
		779	|| map->in_memory != MAP_IN_MEMORY
		780	|| map->nodrop
		781	|| ms ().move_block == MOVE_ALL)
		782	{
		783	while (inv)
		784	{
		785	inv->destroy_inv (drop_to_ground);
		786	inv->destroy ();
		787	}
		788	}
		789	else
		790	{ /* Put objects in inventory onto this space */
		791	while (inv)
		792	{
		793	object *op = inv;
		794
		795	if (op->flag [FLAG_STARTEQUIP]
		796	|| op->flag [FLAG_NO_DROP]
		797	|| op->type == RUNE
		798	|| op->type == TRAP
		799	|| op->flag [FLAG_IS_A_TEMPLATE]
		800	|| op->flag [FLAG_DESTROY_ON_DEATH])
		801	op->destroy ();
		802	else
		803	map->insert (op, x, y);
		804	}
		805	}
892	}	806	}
893		807
894	object *object::create ()	808	object *object::create ()
895	{	809	{
896	object *op = new object;	810	object *op = new object;
897	op->link ();	811	op->link ();
898	return op;	812	return op;
899	}	813	}
900		814
901	/*	815	void
902	* free_object() frees everything allocated by an object, removes	816	object::do_destroy ()
903	* it from the list of used objects, and puts it on the list of
904	* free objects. The IS_FREED() flag is set in the object.
905	* The object must have been removed by remove_ob() first for
906	* this function to succeed.
907	*
908	* If destroy_inventory is set, free inventory as well. Else drop items in
909	* inventory to the ground.
910	*/
911	void object::destroy (bool destroy_inventory)
912	{	817	{
913	if (QUERY_FLAG (this, FLAG_FREED))	818	attachable::do_destroy ();
914	return;
915		819
916	if (QUERY_FLAG (this, FLAG_FRIENDLY))	820	if (flag [FLAG_IS_LINKED])
		821	remove_button_link (this);
		822
		823	if (flag [FLAG_FRIENDLY])
		824	{
917	remove_friendly_object (this);	825	remove_friendly_object (this);
918		826
919	if (!QUERY_FLAG (this, FLAG_REMOVED))	827	if (type == GOLEM
		828	&& owner
		829	&& owner->type == PLAYER
		830	&& owner->contr->ranges[range_golem] == this)
		831	owner->contr->ranges[range_golem] = 0;
		832	}
		833
		834	if (!flag [FLAG_REMOVED])
920	remove_ob (this);	835	remove ();
921		836
922	SET_FLAG (this, FLAG_FREED);	837	destroy_inv (true);
		838
		839	deactivate ();
		840	unlink ();
		841
		842	flag [FLAG_FREED] = 1;
		843
		844	// hack to ensure that freed objects still have a valid map
		845	{
		846	static maptile *freed_map; // freed objects are moved here to avoid crashes
		847
		848	if (!freed_map)
		849	{
		850	freed_map = new maptile;
		851
		852	freed_map->name = "/internal/freed_objects_map";
		853	freed_map->width = 3;
		854	freed_map->height = 3;
		855
		856	freed_map->alloc ();
		857	freed_map->in_memory = MAP_IN_MEMORY;
		858	}
		859
		860	map = freed_map;
		861	x = 1;
		862	y = 1;
		863	}
		864
		865	head = 0;
923		866
924	if (more)	867	if (more)
925	{	868	{
926	more->destroy (destroy_inventory);	869	more->destroy ();
927	more = 0;	870	more = 0;
928	}
929
930	if (inv)
931	{
932	/* Only if the space blocks everything do we not process -
933	* if some form of movement is allowed, let objects
934	* drop on that space.
935	*/
936	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
937	{
938	object *op = inv;
939
940	while (op)
941	{
942	object *tmp = op->below;
943	op->destroy (destroy_inventory);
944	op = tmp;
945	}
946	}
947	else
948	{ /* Put objects in inventory onto this space */
949	object *op = inv;
950
951	while (op)
952	{
953	object *tmp = op->below;
954
955	remove_ob (op);
956
957	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
958	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
959	free_object (op);
960	else
961	{
962	op->x = x;
963	op->y = y;
964	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
965	}
966
967	op = tmp;
968	}
969	}
970	}	871	}
971		872
972	// clear those pointers that likely might have circular references to us	873	// clear those pointers that likely might have circular references to us
973	owner = 0;	874	owner = 0;
974	enemy = 0;	875	enemy = 0;
975	attacked_by = 0;	876	attacked_by = 0;
		877	}
976		878
977	// only relevant for players(?), but make sure of it anyways	879	void
978	contr = 0;	880	object::destroy (bool destroy_inventory)
		881	{
		882	if (destroyed ())
		883	return;
979		884
980	/* Remove object from the active list */	885	if (destroy_inventory)
981	speed = 0;	886	destroy_inv (false);
982	update_ob_speed (this);
983		887
984	unlink ();	888	attachable::destroy ();
985
986	mortals.push_back (this);
987	}	889	}
988		890
989	/*	891	/*
990	* sub_weight() recursively (outwards) subtracts a number from the	892	* sub_weight() recursively (outwards) subtracts a number from the
991	* weight of an object (and what is carried by it's environment(s)).	893	* weight of an object (and what is carried by it's environment(s)).
992	*/	894	*/
993
994	void	895	void
995	sub_weight (object *op, signed long weight)	896	sub_weight (object *op, signed long weight)
996	{	897	{
997	while (op != NULL)	898	while (op != NULL)
998	{	899	{
…		…
1002	op->carrying -= weight;	903	op->carrying -= weight;
1003	op = op->env;	904	op = op->env;
1004	}	905	}
1005	}	906	}
1006		907
1007	/* remove_ob(op):	908	/* op->remove ():
1008	* This function removes the object op from the linked list of objects	909	* This function removes the object op from the linked list of objects
1009	* which it is currently tied to. When this function is done, the	910	* which it is currently tied to. When this function is done, the
1010	* object will have no environment. If the object previously had an	911	* object will have no environment. If the object previously had an
1011	* environment, the x and y coordinates will be updated to	912	* environment, the x and y coordinates will be updated to
1012	* the previous environment.	913	* the previous environment.
1013	* Beware: This function is called from the editor as well!
1014	*/	914	*/
1015
1016	void	915	void
1017	remove_ob (object *op)	916	object::remove_slow ()
1018	{	917	{
1019	object *tmp, *last = 0;	918	object *tmp, *last = 0;
1020	object *otmp;	919	object *otmp;
1021		920
1022	int check_walk_off;
1023	maptile *m;
1024
1025	sint16 x, y;
1026
1027	if (QUERY_FLAG (op, FLAG_REMOVED))	921	if (QUERY_FLAG (this, FLAG_REMOVED))
1028	return;	922	return;
1029		923
1030	SET_FLAG (op, FLAG_REMOVED);	924	SET_FLAG (this, FLAG_REMOVED);
		925	INVOKE_OBJECT (REMOVE, this);
1031		926
1032	if (op->more != NULL)	927	if (more)
1033	remove_ob (op->more);	928	more->remove ();
1034		929
1035	/*	930	/*
1036	* In this case, the object to be removed is in someones	931	* In this case, the object to be removed is in someones
1037	* inventory.	932	* inventory.
1038	*/	933	*/
1039	if (op->env != NULL)	934	if (env)
1040	{	935	{
1041	if (op->nrof)	936	if (nrof)
1042	sub_weight (op->env, op->weight * op->nrof);	937	sub_weight (env, weight * nrof);
1043	else	938	else
1044	sub_weight (op->env, op->weight + op->carrying);	939	sub_weight (env, weight + carrying);
1045		940
1046	/* NO_FIX_PLAYER is set when a great many changes are being	941	/* NO_FIX_PLAYER is set when a great many changes are being
1047	* made to players inventory. If set, avoiding the call	942	* made to players inventory. If set, avoiding the call
1048	* to save cpu time.	943	* to save cpu time.
1049	*/	944	*/
1050	if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	945	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1051	fix_player (otmp);	946	otmp->update_stats ();
1052		947
1053	if (op->above != NULL)	948	if (above)
1054	op->above->below = op->below;	949	above->below = below;
1055	else	950	else
1056	op->env->inv = op->below;	951	env->inv = below;
1057		952
1058	if (op->below != NULL)	953	if (below)
1059	op->below->above = op->above;	954	below->above = above;
1060		955
1061	/* we set up values so that it could be inserted into	956	/* we set up values so that it could be inserted into
1062	* the map, but we don't actually do that - it is up	957	* the map, but we don't actually do that - it is up
1063	* to the caller to decide what we want to do.	958	* to the caller to decide what we want to do.
1064	*/	959	*/
1065	op->x = op->env->x, op->y = op->env->y;	960	x = env->x, y = env->y;
1066	op->map = op->env->map;	961	map = env->map;
1067	op->above = NULL, op->below = NULL;	962	above = 0, below = 0;
1068	op->env = NULL;	963	env = 0;
1069	}	964	}
1070	else if (op->map)	965	else if (map)
1071	{	966	{
1072	x = op->x;	967	if (type == PLAYER)
1073	y = op->y;
1074	m = get_map_from_coord (op->map, &x, &y);
1075
1076	if (!m)
1077	{	968	{
1078	LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",	969	--map->players;
1079	op->map->path, op->x, op->y);	970	map->touch ();
1080	/* in old days, we used to set x and y to 0 and continue.
1081	* it seems if we get into this case, something is probablye
1082	* screwed up and should be fixed.
1083	*/
1084	abort ();
1085	}	971	}
1086		972
1087	if (op->map != m)	973	map->dirty = true;
1088	LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",	974	mapspace &ms = this->ms ();
1089	op->map->path, m->path, op->x, op->y, x, y);
1090
1091	/* Re did the following section of code - it looks like it had
1092	* lots of logic for things we no longer care about
1093	*/
1094		975
1095	/* link the object above us */	976	/* link the object above us */
1096	if (op->above)	977	if (above)
1097	op->above->below = op->below;	978	above->below = below;
1098	else	979	else
1099	SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */	980	ms.top = below; /* we were top, set new top */
1100		981
1101	/* Relink the object below us, if there is one */	982	/* Relink the object below us, if there is one */
1102	if (op->below)	983	if (below)
1103	op->below->above = op->above;	984	below->above = above;
1104	else	985	else
1105	{	986	{
1106	/* Nothing below, which means we need to relink map object for this space	987	/* Nothing below, which means we need to relink map object for this space
1107	* use translated coordinates in case some oddness with map tiling is	988	* use translated coordinates in case some oddness with map tiling is
1108	* evident	989	* evident
1109	*/	990	*/
1110	if (GET_MAP_OB (m, x, y) != op)	991	if (GET_MAP_OB (map, x, y) != this)
1111	{
1112	char *dump = dump_object (op);
1113	LOG (llevError,
1114	"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);	992	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 ());
1115	free (dump);
1116	dump = dump_object (GET_MAP_OB (m, x, y));
1117	LOG (llevError, "%s\n", dump);
1118	free (dump);
1119	}
1120		993
1121	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */	994	ms.bot = above; /* goes on above it. */
1122	}	995	}
1123		996
1124	op->above = 0;	997	above = 0;
1125	op->below = 0;	998	below = 0;
1126		999
1127	if (op->map->in_memory == MAP_SAVING)	1000	if (map->in_memory == MAP_SAVING)
1128	return;	1001	return;
1129		1002
1130	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);	1003	int check_walk_off = !flag [FLAG_NO_APPLY];
1131		1004
1132	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1005	for (tmp = ms.bot; tmp; tmp = tmp->above)
1133	{	1006	{
1134	/* No point updating the players look faces if he is the object	1007	/* No point updating the players look faces if he is the object
1135	* being removed.	1008	* being removed.
1136	*/	1009	*/
1137		1010
1138	if (tmp->type == PLAYER && tmp != op)	1011	if (tmp->type == PLAYER && tmp != this)
1139	{	1012	{
1140	/* If a container that the player is currently using somehow gets	1013	/* If a container that the player is currently using somehow gets
1141	* removed (most likely destroyed), update the player view	1014	* removed (most likely destroyed), update the player view
1142	* appropriately.	1015	* appropriately.
1143	*/	1016	*/
1144	if (tmp->container == op)	1017	if (tmp->container == this)
1145	{	1018	{
1146	CLEAR_FLAG (op, FLAG_APPLIED);	1019	flag [FLAG_APPLIED] = 0;
1147	tmp->container = NULL;	1020	tmp->container = 0;
1148	}	1021	}
1149		1022
1150	tmp->contr->socket.update_look = 1;	1023	if (tmp->contr->ns)
		1024	tmp->contr->ns->floorbox_update ();
1151	}	1025	}
1152		1026
1153	/* See if player moving off should effect something */	1027	/* See if object moving off should effect something */
1154	if (check_walk_off	1028	if (check_walk_off
1155	&& ((op->move_type & tmp->move_off)	1029	&& ((move_type & tmp->move_off)
1156	&& (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1030	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1157	{	1031	{
1158	move_apply (tmp, op, NULL);	1032	move_apply (tmp, this, 0);
1159		1033
1160	if (op->destroyed ())	1034	if (destroyed ())
1161	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1035	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1162	}	1036	}
1163		1037
1164	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1038	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1165		1039	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1166	if (tmp->above == tmp)	1040	if (tmp->above == tmp)
1167	tmp->above = NULL;	1041	tmp->above = 0;
1168		1042
1169	last = tmp;	1043	last = tmp;
1170	}	1044	}
1171		1045
1172	/* last == NULL of there are no objects on this space */	1046	/* last == NULL if there are no objects on this space */
		1047	//TODO: this makes little sense, why only update the topmost object?
1173	if (last == NULL)	1048	if (!last)
1174	{	1049	map->at (x, y).flags_ = 0;
1175	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1176	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1177	* those out anyways, and if there are any flags set right now, they won't
1178	* be correct anyways.
1179	*/
1180	SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1181	update_position (op->map, op->x, op->y);
1182	}
1183	else	1050	else
1184	update_object (last, UP_OBJ_REMOVE);	1051	update_object (last, UP_OBJ_REMOVE);
1185		1052
1186	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))	1053	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1187	update_all_los (op->map, op->x, op->y);	1054	update_all_los (map, x, y);
1188	}	1055	}
1189	}	1056	}
1190		1057
1191	/*	1058	/*
1192	* merge_ob(op,top):	1059	* merge_ob(op,top):
…		…
1200	merge_ob (object *op, object *top)	1067	merge_ob (object *op, object *top)
1201	{	1068	{
1202	if (!op->nrof)	1069	if (!op->nrof)
1203	return 0;	1070	return 0;
1204		1071
1205	if (top == NULL)	1072	if (top)
1206	for (top = op; top != NULL && top->above != NULL; top = top->above);	1073	for (top = op; top && top->above; top = top->above)
		1074	;
1207		1075
1208	for (; top != NULL; top = top->below)	1076	for (; top; top = top->below)
1209	{	1077	{
1210	if (top == op)	1078	if (top == op)
1211	continue;	1079	continue;
1212	if (CAN_MERGE (op, top))	1080
		1081	if (object::can_merge (op, top))
1213	{	1082	{
1214	top->nrof += op->nrof;	1083	top->nrof += op->nrof;
1215		1084
1216	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1085	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1217	op->weight = 0; /* Don't want any adjustements now */	1086	op->weight = 0; /* Don't want any adjustements now */
1218	remove_ob (op);	1087	op->destroy ();
1219	free_object (op);
1220	return top;	1088	return top;
1221	}	1089	}
1222	}	1090	}
1223		1091
1224	return 0;	1092	return 0;
1225	}	1093	}
1226		1094
1227	/*	1095	/*
1228	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1096	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1229	* job preparing multi-part monsters	1097	* job preparing multi-part monsters.
1230	*/	1098	*/
1231	object *	1099	object *
1232	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1100	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1233	{	1101	{
1234	object *tmp;
1235
1236	if (op->head)
1237	op = op->head;
1238
1239	for (tmp = op; tmp; tmp = tmp->more)	1102	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1240	{	1103	{
1241	tmp->x = x + tmp->arch->clone.x;	1104	tmp->x = x + tmp->arch->clone.x;
1242	tmp->y = y + tmp->arch->clone.y;	1105	tmp->y = y + tmp->arch->clone.y;
1243	}	1106	}
1244		1107
…		…
1263	* Return value:	1126	* Return value:
1264	* new object if 'op' was merged with other object	1127	* new object if 'op' was merged with other object
1265	* NULL if 'op' was destroyed	1128	* NULL if 'op' was destroyed
1266	* just 'op' otherwise	1129	* just 'op' otherwise
1267	*/	1130	*/
1268
1269	object *	1131	object *
1270	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1132	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1271	{	1133	{
1272	object *tmp, *top, *floor = NULL;	1134	object *tmp, *top, *floor = NULL;
1273	sint16 x, y;
1274		1135
1275	if (QUERY_FLAG (op, FLAG_FREED))	1136	if (QUERY_FLAG (op, FLAG_FREED))
1276	{	1137	{
1277	LOG (llevError, "Trying to insert freed object!\n");	1138	LOG (llevError, "Trying to insert freed object!\n");
1278	return NULL;	1139	return NULL;
1279	}	1140	}
1280		1141
1281	if (m == NULL)	1142	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1143	LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
		1144
		1145	op->remove ();
		1146
		1147	if (!m)
1282	{	1148	{
1283	char *dump = dump_object (op);	1149	char *dump = dump_object (op);
1284	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1150	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1285	free (dump);	1151	free (dump);
1286	return op;	1152	return op;
…		…
1299	#endif	1165	#endif
1300	free (dump);	1166	free (dump);
1301	return op;	1167	return op;
1302	}	1168	}
1303		1169
1304	if (!QUERY_FLAG (op, FLAG_REMOVED))
1305	{
1306	char *dump = dump_object (op);
1307	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1308	free (dump);
1309	return op;
1310	}
1311
1312	if (op->more != NULL)
1313	{
1314	/* The part may be on a different map. */
1315
1316	object *more = op->more;	1170	if (object *more = op->more)
1317		1171	{
1318	/* We really need the caller to normalize coordinates - if
1319	* we set the map, that doesn't work if the location is within
1320	* a map and this is straddling an edge. So only if coordinate
1321	* is clear wrong do we normalize it.
1322	*/
1323	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1324	more->map = get_map_from_coord (m, &more->x, &more->y);
1325	else if (!more->map)
1326	{
1327	/* For backwards compatibility - when not dealing with tiled maps,
1328	* more->map should always point to the parent.
1329	*/
1330	more->map = m;
1331	}
1332
1333	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1172	if (!insert_ob_in_map (more, m, originator, flag))
1334	{	1173	{
1335	if (!op->head)	1174	if (!op->head)
1336	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1175	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1337		1176
1338	return NULL;	1177	return 0;
1339	}	1178	}
1340	}	1179	}
1341		1180
1342	CLEAR_FLAG (op, FLAG_REMOVED);	1181	CLEAR_FLAG (op, FLAG_REMOVED);
1343		1182
1344	/* Ideally, the caller figures this out. However, it complicates a lot	1183	/* Ideally, the caller figures this out. However, it complicates a lot
1345	* of areas of callers (eg, anything that uses find_free_spot would now	1184	* of areas of callers (eg, anything that uses find_free_spot would now
1346	* need extra work	1185	* need extra work
1347	*/	1186	*/
1348	op->map = get_map_from_coord (m, &op->x, &op->y);	1187	if (!xy_normalise (m, op->x, op->y))
1349	x = op->x;	1188	return 0;
1350	y = op->y;	1189
		1190	op->map = m;
		1191	mapspace &ms = op->ms ();
1351		1192
1352	/* this has to be done after we translate the coordinates.	1193	/* this has to be done after we translate the coordinates.
1353	*/	1194	*/
1354	if (op->nrof && !(flag & INS_NO_MERGE))	1195	if (op->nrof && !(flag & INS_NO_MERGE))
1355	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1196	for (tmp = ms.bot; tmp; tmp = tmp->above)
1356	if (CAN_MERGE (op, tmp))	1197	if (object::can_merge (op, tmp))
1357	{	1198	{
1358	op->nrof += tmp->nrof;	1199	op->nrof += tmp->nrof;
1359	remove_ob (tmp);	1200	tmp->destroy ();
1360	free_object (tmp);
1361	}	1201	}
1362		1202
1363	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1203	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1364	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1204	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1365		1205
…		…
1378	op->below = originator->below;	1218	op->below = originator->below;
1379		1219
1380	if (op->below)	1220	if (op->below)
1381	op->below->above = op;	1221	op->below->above = op;
1382	else	1222	else
1383	SET_MAP_OB (op->map, op->x, op->y, op);	1223	ms.bot = op;
1384		1224
1385	/* since *below* originator, no need to update top */	1225	/* since *below* originator, no need to update top */
1386	originator->below = op;	1226	originator->below = op;
1387	}	1227	}
1388	else	1228	else
1389	{	1229	{
		1230	top = ms.bot;
		1231
1390	/* If there are other objects, then */	1232	/* If there are other objects, then */
1391	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1233	if ((!(flag & INS_MAP_LOAD)) && top)
1392	{	1234	{
1393	object *last = NULL;	1235	object *last = 0;
1394		1236
1395	/*	1237	/*
1396	* If there are multiple objects on this space, we do some trickier handling.	1238	* If there are multiple objects on this space, we do some trickier handling.
1397	* We've already dealt with merging if appropriate.	1239	* We've already dealt with merging if appropriate.
1398	* Generally, we want to put the new object on top. But if	1240	* Generally, we want to put the new object on top. But if
…		…
1402	* once we get to them. This reduces the need to traverse over all of	1244	* once we get to them. This reduces the need to traverse over all of
1403	* them when adding another one - this saves quite a bit of cpu time	1245	* them when adding another one - this saves quite a bit of cpu time
1404	* when lots of spells are cast in one area. Currently, it is presumed	1246	* when lots of spells are cast in one area. Currently, it is presumed
1405	* that flying non pickable objects are spell objects.	1247	* that flying non pickable objects are spell objects.
1406	*/	1248	*/
1407		1249	for (top = ms.bot; top; top = top->above)
1408	while (top != NULL)
1409	{	1250	{
1410	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1251	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1411	floor = top;	1252	floor = top;
1412		1253
1413	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1254	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1416	top = top->below;	1257	top = top->below;
1417	break;	1258	break;
1418	}	1259	}
1419		1260
1420	last = top;	1261	last = top;
1421	top = top->above;
1422	}	1262	}
1423		1263
1424	/* Don't want top to be NULL, so set it to the last valid object */	1264	/* Don't want top to be NULL, so set it to the last valid object */
1425	top = last;	1265	top = last;
1426		1266
…		…
1433	* Unless those objects are exits, type 66	1273	* Unless those objects are exits, type 66
1434	* If INS_ON_TOP is used, don't do this processing	1274	* If INS_ON_TOP is used, don't do this processing
1435	* Need to find the object that in fact blocks view, otherwise	1275	* Need to find the object that in fact blocks view, otherwise
1436	* stacking is a bit odd.	1276	* stacking is a bit odd.
1437	*/	1277	*/
1438	if (!(flag & INS_ON_TOP) &&	1278	if (!(flag & INS_ON_TOP)
1439	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1279	&& ms.flags () & P_BLOCKSVIEW
		1280	&& (op->face && !op->face->visibility))
1440	{	1281	{
1441	for (last = top; last != floor; last = last->below)	1282	for (last = top; last != floor; last = last->below)
1442	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1283	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1443	break;	1284	break;
		1285
1444	/* Check to see if we found the object that blocks view,	1286	/* Check to see if we found the object that blocks view,
1445	* and make sure we have a below pointer for it so that	1287	* and make sure we have a below pointer for it so that
1446	* we can get inserted below this one, which requires we	1288	* we can get inserted below this one, which requires we
1447	* set top to the object below us.	1289	* set top to the object below us.
1448	*/	1290	*/
…		…
1450	top = last->below;	1292	top = last->below;
1451	}	1293	}
1452	} /* If objects on this space */	1294	} /* If objects on this space */
1453		1295
1454	if (flag & INS_MAP_LOAD)	1296	if (flag & INS_MAP_LOAD)
1455	top = GET_MAP_TOP (op->map, op->x, op->y);	1297	top = ms.top;
1456		1298
1457	if (flag & INS_ABOVE_FLOOR_ONLY)	1299	if (flag & INS_ABOVE_FLOOR_ONLY)
1458	top = floor;	1300	top = floor;
1459		1301
1460	/* Top is the object that our object (op) is going to get inserted above.	1302	/* Top is the object that our object (op) is going to get inserted above.
1461	*/	1303	*/
1462		1304
1463	/* First object on this space */	1305	/* First object on this space */
1464	if (!top)	1306	if (!top)
1465	{	1307	{
1466	op->above = GET_MAP_OB (op->map, op->x, op->y);	1308	op->above = ms.bot;
1467		1309
1468	if (op->above)	1310	if (op->above)
1469	op->above->below = op;	1311	op->above->below = op;
1470		1312
1471	op->below = NULL;	1313	op->below = 0;
1472	SET_MAP_OB (op->map, op->x, op->y, op);	1314	ms.bot = op;
1473	}	1315	}
1474	else	1316	else
1475	{ /* get inserted into the stack above top */	1317	{ /* get inserted into the stack above top */
1476	op->above = top->above;	1318	op->above = top->above;
1477		1319
…		…
1480		1322
1481	op->below = top;	1323	op->below = top;
1482	top->above = op;	1324	top->above = op;
1483	}	1325	}
1484		1326
1485	if (op->above == NULL)	1327	if (!op->above)
1486	SET_MAP_TOP (op->map, op->x, op->y, op);	1328	ms.top = op;
1487	} /* else not INS_BELOW_ORIGINATOR */	1329	} /* else not INS_BELOW_ORIGINATOR */
1488		1330
1489	if (op->type == PLAYER)	1331	if (op->type == PLAYER)
		1332	{
1490	op->contr->do_los = 1;	1333	op->contr->do_los = 1;
		1334	++op->map->players;
		1335	op->map->touch ();
		1336	}
		1337
		1338	op->map->dirty = true;
1491		1339
1492	/* If we have a floor, we know the player, if any, will be above	1340	/* If we have a floor, we know the player, if any, will be above
1493	* it, so save a few ticks and start from there.	1341	* it, so save a few ticks and start from there.
1494	*/	1342	*/
1495	if (!(flag & INS_MAP_LOAD))	1343	if (!(flag & INS_MAP_LOAD))
1496	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1344	if (object *pl = ms.player ())
1497	if (tmp->type == PLAYER)	1345	if (pl->contr->ns)
1498	tmp->contr->socket.update_look = 1;	1346	pl->contr->ns->floorbox_update ();
1499		1347
1500	/* If this object glows, it may affect lighting conditions that are	1348	/* If this object glows, it may affect lighting conditions that are
1501	* visible to others on this map. But update_all_los is really	1349	* visible to others on this map. But update_all_los is really
1502	* an inefficient way to do this, as it means los for all players	1350	* an inefficient way to do this, as it means los for all players
1503	* on the map will get recalculated. The players could very well	1351	* on the map will get recalculated. The players could very well
1504	* be far away from this change and not affected in any way -	1352	* be far away from this change and not affected in any way -
1505	* this should get redone to only look for players within range,	1353	* this should get redone to only look for players within range,
1506	* or just updating the P_NEED_UPDATE for spaces within this area	1354	* or just updating the P_UPTODATE for spaces within this area
1507	* of effect may be sufficient.	1355	* of effect may be sufficient.
1508	*/	1356	*/
1509	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1357	if (op->map->darkness && (op->glow_radius != 0))
1510	update_all_los (op->map, op->x, op->y);	1358	update_all_los (op->map, op->x, op->y);
1511		1359
1512	/* updates flags (blocked, alive, no magic, etc) for this map space */	1360	/* updates flags (blocked, alive, no magic, etc) for this map space */
1513	update_object (op, UP_OBJ_INSERT);	1361	update_object (op, UP_OBJ_INSERT);
1514		1362
		1363	INVOKE_OBJECT (INSERT, op);
		1364
1515	/* Don't know if moving this to the end will break anything. However,	1365	/* Don't know if moving this to the end will break anything. However,
1516	* we want to have update_look set above before calling this.	1366	* we want to have floorbox_update called before calling this.
1517	*	1367	*
1518	* check_move_on() must be after this because code called from	1368	* check_move_on() must be after this because code called from
1519	* check_move_on() depends on correct map flags (so functions like	1369	* check_move_on() depends on correct map flags (so functions like
1520	* blocked() and wall() work properly), and these flags are updated by	1370	* blocked() and wall() work properly), and these flags are updated by
1521	* update_object().	1371	* update_object().
…		…
1523		1373
1524	/* if this is not the head or flag has been passed, don't check walk on status */	1374	/* if this is not the head or flag has been passed, don't check walk on status */
1525	if (!(flag & INS_NO_WALK_ON) && !op->head)	1375	if (!(flag & INS_NO_WALK_ON) && !op->head)
1526	{	1376	{
1527	if (check_move_on (op, originator))	1377	if (check_move_on (op, originator))
1528	return NULL;	1378	return 0;
1529		1379
1530	/* If we are a multi part object, lets work our way through the check	1380	/* If we are a multi part object, lets work our way through the check
1531	* walk on's.	1381	* walk on's.
1532	*/	1382	*/
1533	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1383	for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1534	if (check_move_on (tmp, originator))	1384	if (check_move_on (tmp, originator))
1535	return NULL;	1385	return 0;
1536	}	1386	}
1537		1387
1538	return op;	1388	return op;
1539	}	1389	}
1540		1390
1541	/* this function inserts an object in the map, but if it	1391	/* this function inserts an object in the map, but if it
1542	* finds an object of its own type, it'll remove that one first.	1392	* finds an object of its own type, it'll remove that one first.
1543	* op is the object to insert it under: supplies x and the map.	1393	* op is the object to insert it under: supplies x and the map.
1544	*/	1394	*/
1545	void	1395	void
1546	replace_insert_ob_in_map (const char *arch_string, object *op)	1396	replace_insert_ob_in_map (const char *arch_string, object *op)
1547	{	1397	{
1548	object *	1398	object *tmp, *tmp1;
1549	tmp;
1550	object *
1551	tmp1;
1552		1399
1553	/* first search for itself and remove any old instances */	1400	/* first search for itself and remove any old instances */
1554		1401
1555	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1402	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1556	{
1557	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1403	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1558	{	1404	tmp->destroy ();
1559	remove_ob (tmp);
1560	free_object (tmp);
1561	}
1562	}
1563		1405
1564	tmp1 = arch_to_object (archetype::find (arch_string));	1406	tmp1 = arch_to_object (archetype::find (arch_string));
1565		1407
1566	tmp1->x = op->x;	1408	tmp1->x = op->x;
1567	tmp1->y = op->y;	1409	tmp1->y = op->y;
1568	insert_ob_in_map (tmp1, op->map, op, 0);	1410	insert_ob_in_map (tmp1, op->map, op, 0);
		1411	}
		1412
		1413	object *
		1414	object::insert_at (object *where, object *originator, int flags)
		1415	{
		1416	where->map->insert (this, where->x, where->y, originator, flags);
1569	}	1417	}
1570		1418
1571	/*	1419	/*
1572	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1420	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1573	* is returned contains nr objects, and the remaining parts contains	1421	* is returned contains nr objects, and the remaining parts contains
1574	* the rest (or is removed and freed if that number is 0).	1422	* the rest (or is removed and freed if that number is 0).
1575	* On failure, NULL is returned, and the reason put into the	1423	* On failure, NULL is returned, and the reason put into the
1576	* global static errmsg array.	1424	* global static errmsg array.
1577	*/	1425	*/
1578
1579	object *	1426	object *
1580	get_split_ob (object *orig_ob, uint32 nr)	1427	get_split_ob (object *orig_ob, uint32 nr)
1581	{	1428	{
1582	object *	1429	object *newob;
1583	newob;
1584	int
1585	is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1430	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1586		1431
1587	if (orig_ob->nrof < nr)	1432	if (orig_ob->nrof < nr)
1588	{	1433	{
1589	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);	1434	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1590	return NULL;	1435	return NULL;
1591	}	1436	}
1592		1437
1593	newob = object_create_clone (orig_ob);	1438	newob = object_create_clone (orig_ob);
1594		1439
1595	if ((orig_ob->nrof -= nr) < 1)	1440	if ((orig_ob->nrof -= nr) < 1)
1596	{	1441	orig_ob->destroy (1);
1597	if (!is_removed)
1598	remove_ob (orig_ob);
1599	free_object2 (orig_ob, 1);
1600	}
1601	else if (!is_removed)	1442	else if (!is_removed)
1602	{	1443	{
1603	if (orig_ob->env != NULL)	1444	if (orig_ob->env != NULL)
1604	sub_weight (orig_ob->env, orig_ob->weight * nr);	1445	sub_weight (orig_ob->env, orig_ob->weight * nr);
1605	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)	1446	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
…		…
1625		1466
1626	object *	1467	object *
1627	decrease_ob_nr (object *op, uint32 i)	1468	decrease_ob_nr (object *op, uint32 i)
1628	{	1469	{
1629	object *tmp;	1470	object *tmp;
1630	player *pl;
1631		1471
1632	if (i == 0) /* objects with op->nrof require this check */	1472	if (i == 0) /* objects with op->nrof require this check */
1633	return op;	1473	return op;
1634		1474
1635	if (i > op->nrof)	1475	if (i > op->nrof)
1636	i = op->nrof;	1476	i = op->nrof;
1637		1477
1638	if (QUERY_FLAG (op, FLAG_REMOVED))	1478	if (QUERY_FLAG (op, FLAG_REMOVED))
1639	op->nrof -= i;	1479	op->nrof -= i;
1640	else if (op->env != NULL)	1480	else if (op->env)
1641	{	1481	{
1642	/* is this object in the players inventory, or sub container	1482	/* is this object in the players inventory, or sub container
1643	* therein?	1483	* therein?
1644	*/	1484	*/
1645	tmp = is_player_inv (op->env);	1485	tmp = op->in_player ();
1646	/* nope. Is this a container the player has opened?	1486	/* nope. Is this a container the player has opened?
1647	* If so, set tmp to that player.	1487	* If so, set tmp to that player.
1648	* IMO, searching through all the players will mostly	1488	* IMO, searching through all the players will mostly
1649	* likely be quicker than following op->env to the map,	1489	* likely be quicker than following op->env to the map,
1650	* and then searching the map for a player.	1490	* and then searching the map for a player.
1651	*/	1491	*/
1652	if (!tmp)	1492	if (!tmp)
1653	{	1493	for_all_players (pl)
1654	for (pl = first_player; pl; pl = pl->next)
1655	if (pl->ob->container == op->env)	1494	if (pl->ob->container == op->env)
		1495	{
		1496	tmp = pl->ob;
1656	break;	1497	break;
1657	if (pl)
1658	tmp = pl->ob;
1659	else
1660	tmp = NULL;
1661	}	1498	}
1662		1499
1663	if (i < op->nrof)	1500	if (i < op->nrof)
1664	{	1501	{
1665	sub_weight (op->env, op->weight * i);	1502	sub_weight (op->env, op->weight * i);
1666	op->nrof -= i;	1503	op->nrof -= i;
1667	if (tmp)	1504	if (tmp)
1668	{
1669	esrv_send_item (tmp, op);	1505	esrv_send_item (tmp, op);
1670	}
1671	}	1506	}
1672	else	1507	else
1673	{	1508	{
1674	remove_ob (op);	1509	op->remove ();
1675	op->nrof = 0;	1510	op->nrof = 0;
1676	if (tmp)	1511	if (tmp)
1677	{
1678	esrv_del_item (tmp->contr, op->count);	1512	esrv_del_item (tmp->contr, op->count);
1679	}
1680	}	1513	}
1681	}	1514	}
1682	else	1515	else
1683	{	1516	{
1684	object *above = op->above;	1517	object *above = op->above;
1685		1518
1686	if (i < op->nrof)	1519	if (i < op->nrof)
1687	op->nrof -= i;	1520	op->nrof -= i;
1688	else	1521	else
1689	{	1522	{
1690	remove_ob (op);	1523	op->remove ();
1691	op->nrof = 0;	1524	op->nrof = 0;
1692	}	1525	}
1693		1526
1694	/* Since we just removed op, op->above is null */	1527	/* Since we just removed op, op->above is null */
1695	for (tmp = above; tmp != NULL; tmp = tmp->above)	1528	for (tmp = above; tmp; tmp = tmp->above)
1696	if (tmp->type == PLAYER)	1529	if (tmp->type == PLAYER)
1697	{	1530	{
1698	if (op->nrof)	1531	if (op->nrof)
1699	esrv_send_item (tmp, op);	1532	esrv_send_item (tmp, op);
1700	else	1533	else
…		…
1704		1537
1705	if (op->nrof)	1538	if (op->nrof)
1706	return op;	1539	return op;
1707	else	1540	else
1708	{	1541	{
1709	free_object (op);	1542	op->destroy ();
1710	return NULL;	1543	return 0;
1711	}	1544	}
1712	}	1545	}
1713		1546
1714	/*	1547	/*
1715	* add_weight(object, weight) adds the specified weight to an object,	1548	* add_weight(object, weight) adds the specified weight to an object,
…		…
1727	op->carrying += weight;	1560	op->carrying += weight;
1728	op = op->env;	1561	op = op->env;
1729	}	1562	}
1730	}	1563	}
1731		1564
1732	/*
1733	* insert_ob_in_ob(op,environment):
1734	* This function inserts the object op in the linked list
1735	* inside the object environment.
1736	*
1737	* Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter
1738	* the inventory at the last position or next to other objects of the same
1739	* type.
1740	* Frank: Now sorted by type, archetype and magic!
1741	*
1742	* The function returns now pointer to inserted item, and return value can
1743	* be != op, if items are merged. -Tero
1744	*/
1745
1746	object *	1565	object *
1747	insert_ob_in_ob (object *op, object *where)	1566	insert_ob_in_ob (object *op, object *where)
1748	{	1567	{
1749	object *	1568	if (!where)
1750	tmp, *
1751	otmp;
1752
1753	if (!QUERY_FLAG (op, FLAG_REMOVED))
1754	{
1755	char *dump = dump_object (op);
1756	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump);
1757	free (dump);
1758	return op;
1759	}
1760
1761	if (where == NULL)
1762	{	1569	{
1763	char *dump = dump_object (op);	1570	char *dump = dump_object (op);
1764	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1571	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1765	free (dump);	1572	free (dump);
1766	return op;	1573	return op;
1767	}	1574	}
1768		1575
1769	if (where->head)	1576	if (where->head)
1770	{	1577	{
1771	LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");	1578	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");
1772	where = where->head;	1579	where = where->head;
1773	}	1580	}
		1581
		1582	return where->insert (op);
		1583	}
		1584
		1585	/*
		1586	* env->insert (op)
		1587	* This function inserts the object op in the linked list
		1588	* inside the object environment.
		1589	*
		1590	* The function returns now pointer to inserted item, and return value can
		1591	* be != op, if items are merged. -Tero
		1592	*/
		1593
		1594	object *
		1595	object::insert (object *op)
		1596	{
		1597	object *tmp, *otmp;
		1598
		1599	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1600	op->remove ();
1774		1601
1775	if (op->more)	1602	if (op->more)
1776	{	1603	{
1777	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1604	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1778	return op;	1605	return op;
…		…
1780		1607
1781	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1608	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1782	CLEAR_FLAG (op, FLAG_REMOVED);	1609	CLEAR_FLAG (op, FLAG_REMOVED);
1783	if (op->nrof)	1610	if (op->nrof)
1784	{	1611	{
1785	for (tmp = where->inv; tmp != NULL; tmp = tmp->below)	1612	for (tmp = inv; tmp != NULL; tmp = tmp->below)
1786	if (CAN_MERGE (tmp, op))	1613	if (object::can_merge (tmp, op))
1787	{	1614	{
1788	/* return the original object and remove inserted object	1615	/* return the original object and remove inserted object
1789	(client needs the original object) */	1616	(client needs the original object) */
1790	tmp->nrof += op->nrof;	1617	tmp->nrof += op->nrof;
1791	/* Weight handling gets pretty funky. Since we are adding to	1618	/* Weight handling gets pretty funky. Since we are adding to
1792	* tmp->nrof, we need to increase the weight.	1619	* tmp->nrof, we need to increase the weight.
1793	*/	1620	*/
1794	add_weight (where, op->weight * op->nrof);	1621	add_weight (this, op->weight * op->nrof);
1795	SET_FLAG (op, FLAG_REMOVED);	1622	SET_FLAG (op, FLAG_REMOVED);
1796	free_object (op); /* free the inserted object */	1623	op->destroy (); /* free the inserted object */
1797	op = tmp;	1624	op = tmp;
1798	remove_ob (op); /* and fix old object's links */	1625	op->remove (); /* and fix old object's links */
1799	CLEAR_FLAG (op, FLAG_REMOVED);	1626	CLEAR_FLAG (op, FLAG_REMOVED);
1800	break;	1627	break;
1801	}	1628	}
1802		1629
1803	/* I assume combined objects have no inventory	1630	/* I assume combined objects have no inventory
1804	* We add the weight - this object could have just been removed	1631	* We add the weight - this object could have just been removed
1805	* (if it was possible to merge). calling remove_ob will subtract	1632	* (if it was possible to merge). calling remove_ob will subtract
1806	* the weight, so we need to add it in again, since we actually do	1633	* the weight, so we need to add it in again, since we actually do
1807	* the linking below	1634	* the linking below
1808	*/	1635	*/
1809	add_weight (where, op->weight * op->nrof);	1636	add_weight (this, op->weight * op->nrof);
1810	}	1637	}
1811	else	1638	else
1812	add_weight (where, (op->weight + op->carrying));	1639	add_weight (this, (op->weight + op->carrying));
1813		1640
1814	otmp = is_player_inv (where);	1641	otmp = this->in_player ();
1815	if (otmp && otmp->contr != NULL)	1642	if (otmp && otmp->contr)
1816	{
1817	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1643	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1818	fix_player (otmp);	1644	otmp->update_stats ();
1819	}
1820		1645
1821	op->map = NULL;	1646	op->map = 0;
1822	op->env = where;	1647	op->env = this;
1823	op->above = NULL;	1648	op->above = 0;
1824	op->below = NULL;	1649	op->below = 0;
1825	op->x = 0, op->y = 0;	1650	op->x = 0, op->y = 0;
1826		1651
1827	/* reset the light list and los of the players on the map */	1652	/* reset the light list and los of the players on the map */
1828	if ((op->glow_radius != 0) && where->map)	1653	if ((op->glow_radius != 0) && map)
1829	{	1654	{
1830	#ifdef DEBUG_LIGHTS	1655	#ifdef DEBUG_LIGHTS
1831	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1656	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1832	#endif /* DEBUG_LIGHTS */	1657	#endif /* DEBUG_LIGHTS */
1833	if (MAP_DARKNESS (where->map))	1658	if (map->darkness)
1834	update_all_los (where->map, where->x, where->y);	1659	update_all_los (map, x, y);
1835	}	1660	}
1836		1661
1837	/* Client has no idea of ordering so lets not bother ordering it here.	1662	/* Client has no idea of ordering so lets not bother ordering it here.
1838	* It sure simplifies this function...	1663	* It sure simplifies this function...
1839	*/	1664	*/
1840	if (where->inv == NULL)	1665	if (!inv)
1841	where->inv = op;	1666	inv = op;
1842	else	1667	else
1843	{	1668	{
1844	op->below = where->inv;	1669	op->below = inv;
1845	op->below->above = op;	1670	op->below->above = op;
1846	where->inv = op;	1671	inv = op;
1847	}	1672	}
		1673
		1674	INVOKE_OBJECT (INSERT, this);
		1675
1848	return op;	1676	return op;
1849	}	1677	}
1850		1678
1851	/*	1679	/*
1852	* Checks if any objects has a move_type that matches objects	1680	* Checks if any objects has a move_type that matches objects
…		…
1866	*	1694	*
1867	* MSW 2001-07-08: Check all objects on space, not just those below	1695	* MSW 2001-07-08: Check all objects on space, not just those below
1868	* object being inserted. insert_ob_in_map may not put new objects	1696	* object being inserted. insert_ob_in_map may not put new objects
1869	* on top.	1697	* on top.
1870	*/	1698	*/
1871
1872	int	1699	int
1873	check_move_on (object *op, object *originator)	1700	check_move_on (object *op, object *originator)
1874	{	1701	{
1875	object *tmp;	1702	object *tmp;
1876	maptile *m = op->map;	1703	maptile *m = op->map;
…		…
1903		1730
1904	/* The objects have to be checked from top to bottom.	1731	/* The objects have to be checked from top to bottom.
1905	* Hence, we first go to the top:	1732	* Hence, we first go to the top:
1906	*/	1733	*/
1907		1734
1908	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1735	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1909	{	1736	{
1910	/* Trim the search when we find the first other spell effect	1737	/* Trim the search when we find the first other spell effect
1911	* this helps performance so that if a space has 50 spell objects,	1738	* this helps performance so that if a space has 50 spell objects,
1912	* we don't need to check all of them.	1739	* we don't need to check all of them.
1913	*/	1740	*/
…		…
1931	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1758	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1932	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1759	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1933	{	1760	{
1934		1761
1935	float	1762	float
1936	diff = tmp->move_slow_penalty * FABS (op->speed);	1763	diff = tmp->move_slow_penalty * fabs (op->speed);
1937		1764
1938	if (op->type == PLAYER)	1765	if (op->type == PLAYER)
1939	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1766	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1940	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1767	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1941	diff /= 4.0;	1768	diff /= 4.0;
…		…
1968	/*	1795	/*
1969	* present_arch(arch, map, x, y) searches for any objects with	1796	* present_arch(arch, map, x, y) searches for any objects with
1970	* a matching archetype at the given map and coordinates.	1797	* a matching archetype at the given map and coordinates.
1971	* The first matching object is returned, or NULL if none.	1798	* The first matching object is returned, or NULL if none.
1972	*/	1799	*/
1973
1974	object *	1800	object *
1975	present_arch (const archetype *at, maptile *m, int x, int y)	1801	present_arch (const archetype *at, maptile *m, int x, int y)
1976	{	1802	{
1977	object *
1978	tmp;
1979
1980	if (m == NULL || out_of_map (m, x, y))	1803	if (!m || out_of_map (m, x, y))
1981	{	1804	{
1982	LOG (llevError, "Present_arch called outside map.\n");	1805	LOG (llevError, "Present_arch called outside map.\n");
1983	return NULL;	1806	return NULL;
1984	}	1807	}
1985	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1808
		1809	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1986	if (tmp->arch == at)	1810	if (tmp->arch == at)
1987	return tmp;	1811	return tmp;
		1812
1988	return NULL;	1813	return NULL;
1989	}	1814	}
1990		1815
1991	/*	1816	/*
1992	* present(type, map, x, y) searches for any objects with	1817	* present(type, map, x, y) searches for any objects with
1993	* a matching type variable at the given map and coordinates.	1818	* a matching type variable at the given map and coordinates.
1994	* The first matching object is returned, or NULL if none.	1819	* The first matching object is returned, or NULL if none.
1995	*/	1820	*/
1996
1997	object *	1821	object *
1998	present (unsigned char type, maptile *m, int x, int y)	1822	present (unsigned char type, maptile *m, int x, int y)
1999	{	1823	{
2000	object *
2001	tmp;
2002
2003	if (out_of_map (m, x, y))	1824	if (out_of_map (m, x, y))
2004	{	1825	{
2005	LOG (llevError, "Present called outside map.\n");	1826	LOG (llevError, "Present called outside map.\n");
2006	return NULL;	1827	return NULL;
2007	}	1828	}
2008	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1829
		1830	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
2009	if (tmp->type == type)	1831	if (tmp->type == type)
2010	return tmp;	1832	return tmp;
		1833
2011	return NULL;	1834	return NULL;
2012	}	1835	}
2013		1836
2014	/*	1837	/*
2015	* present_in_ob(type, object) searches for any objects with	1838	* present_in_ob(type, object) searches for any objects with
2016	* a matching type variable in the inventory of the given object.	1839	* a matching type variable in the inventory of the given object.
2017	* The first matching object is returned, or NULL if none.	1840	* The first matching object is returned, or NULL if none.
2018	*/	1841	*/
2019
2020	object *	1842	object *
2021	present_in_ob (unsigned char type, const object *op)	1843	present_in_ob (unsigned char type, const object *op)
2022	{	1844	{
2023	object *
2024	tmp;
2025
2026	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1845	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2027	if (tmp->type == type)	1846	if (tmp->type == type)
2028	return tmp;	1847	return tmp;
		1848
2029	return NULL;	1849	return NULL;
2030	}	1850	}
2031		1851
2032	/*	1852	/*
2033	* present_in_ob (type, str, object) searches for any objects with	1853	* present_in_ob (type, str, object) searches for any objects with
…		…
2041	* str is the string to match against. Note that we match against	1861	* str is the string to match against. Note that we match against
2042	* the object name, not the archetype name. this is so that the	1862	* the object name, not the archetype name. this is so that the
2043	* spell code can use one object type (force), but change it's name	1863	* spell code can use one object type (force), but change it's name
2044	* to be unique.	1864	* to be unique.
2045	*/	1865	*/
2046
2047	object *	1866	object *
2048	present_in_ob_by_name (int type, const char *str, const object *op)	1867	present_in_ob_by_name (int type, const char *str, const object *op)
2049	{	1868	{
2050	object *
2051	tmp;
2052
2053	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1869	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2054	{
2055	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1870	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2056	return tmp;	1871	return tmp;
2057	}	1872
2058	return NULL;	1873	return 0;
2059	}	1874	}
2060		1875
2061	/*	1876	/*
2062	* present_arch_in_ob(archetype, object) searches for any objects with	1877	* present_arch_in_ob(archetype, object) searches for any objects with
2063	* a matching archetype in the inventory of the given object.	1878	* a matching archetype in the inventory of the given object.
2064	* The first matching object is returned, or NULL if none.	1879	* The first matching object is returned, or NULL if none.
2065	*/	1880	*/
2066
2067	object *	1881	object *
2068	present_arch_in_ob (const archetype *at, const object *op)	1882	present_arch_in_ob (const archetype *at, const object *op)
2069	{	1883	{
2070	object *
2071	tmp;
2072
2073	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1884	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2074	if (tmp->arch == at)	1885	if (tmp->arch == at)
2075	return tmp;	1886	return tmp;
		1887
2076	return NULL;	1888	return NULL;
2077	}	1889	}
2078		1890
2079	/*	1891	/*
2080	* activate recursively a flag on an object inventory	1892	* activate recursively a flag on an object inventory
2081	*/	1893	*/
2082	void	1894	void
2083	flag_inv (object *op, int flag)	1895	flag_inv (object *op, int flag)
2084	{	1896	{
2085	object *
2086	tmp;
2087
2088	if (op->inv)	1897	if (op->inv)
2089	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1898	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2090	{	1899	{
2091	SET_FLAG (tmp, flag);	1900	SET_FLAG (tmp, flag);
2092	flag_inv (tmp, flag);	1901	flag_inv (tmp, flag);
2093	}	1902	}
2094	} /*	1903	}
		1904
		1905	/*
2095	* desactivate recursively a flag on an object inventory	1906	* deactivate recursively a flag on an object inventory
2096	*/	1907	*/
2097	void	1908	void
2098	unflag_inv (object *op, int flag)	1909	unflag_inv (object *op, int flag)
2099	{	1910	{
2100	object *
2101	tmp;
2102
2103	if (op->inv)	1911	if (op->inv)
2104	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1912	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2105	{	1913	{
2106	CLEAR_FLAG (tmp, flag);	1914	CLEAR_FLAG (tmp, flag);
2107	unflag_inv (tmp, flag);	1915	unflag_inv (tmp, flag);
2108	}	1916	}
2109	}	1917	}
…		…
2112	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in	1920	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2113	* all it's inventory (recursively).	1921	* all it's inventory (recursively).
2114	* If checksums are used, a player will get set_cheat called for	1922	* If checksums are used, a player will get set_cheat called for
2115	* him/her-self and all object carried by a call to this function.	1923	* him/her-self and all object carried by a call to this function.
2116	*/	1924	*/
2117
2118	void	1925	void
2119	set_cheat (object *op)	1926	set_cheat (object *op)
2120	{	1927	{
2121	SET_FLAG (op, FLAG_WAS_WIZ);	1928	SET_FLAG (op, FLAG_WAS_WIZ);
2122	flag_inv (op, FLAG_WAS_WIZ);	1929	flag_inv (op, FLAG_WAS_WIZ);
…		…
2141	* because arch_blocked (now ob_blocked) needs to know the movement type	1948	* because arch_blocked (now ob_blocked) needs to know the movement type
2142	* to know if the space in question will block the object. We can't use	1949	* to know if the space in question will block the object. We can't use
2143	* the archetype because that isn't correct if the monster has been	1950	* the archetype because that isn't correct if the monster has been
2144	* customized, changed states, etc.	1951	* customized, changed states, etc.
2145	*/	1952	*/
2146
2147	int	1953	int
2148	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1954	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2149	{	1955	{
2150	int
2151	i,
2152	index = 0, flag;	1956	int index = 0, flag;
2153	static int
2154	altern[SIZEOFFREE];	1957	int altern[SIZEOFFREE];
2155		1958
2156	for (i = start; i < stop; i++)	1959	for (int i = start; i < stop; i++)
2157	{	1960	{
2158	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1961	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2159	if (!flag)	1962	if (!flag)
2160	altern[index++] = i;	1963	altern [index++] = i;
2161		1964
2162	/* Basically, if we find a wall on a space, we cut down the search size.	1965	/* Basically, if we find a wall on a space, we cut down the search size.
2163	* In this way, we won't return spaces that are on another side of a wall.	1966	* In this way, we won't return spaces that are on another side of a wall.
2164	* This mostly work, but it cuts down the search size in all directions -	1967	* This mostly work, but it cuts down the search size in all directions -
2165	* if the space being examined only has a wall to the north and empty	1968	* if the space being examined only has a wall to the north and empty
2166	* spaces in all the other directions, this will reduce the search space	1969	* spaces in all the other directions, this will reduce the search space
2167	* to only the spaces immediately surrounding the target area, and	1970	* to only the spaces immediately surrounding the target area, and
2168	* won't look 2 spaces south of the target space.	1971	* won't look 2 spaces south of the target space.
2169	*/	1972	*/
2170	else if ((flag & AB_NO_PASS) && maxfree[i] < stop)	1973	else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2171	stop = maxfree[i];	1974	stop = maxfree[i];
2172	}	1975	}
		1976
2173	if (!index)	1977	if (!index)
2174	return -1;	1978	return -1;
		1979
2175	return altern[RANDOM () % index];	1980	return altern [rndm (index)];
2176	}	1981	}
2177		1982
2178	/*	1983	/*
2179	* find_first_free_spot(archetype, maptile, x, y) works like	1984	* find_first_free_spot(archetype, maptile, x, y) works like
2180	* find_free_spot(), but it will search max number of squares.	1985	* find_free_spot(), but it will search max number of squares.
2181	* But it will return the first available spot, not a random choice.	1986	* But it will return the first available spot, not a random choice.
2182	* Changed 0.93.2: Have it return -1 if there is no free spot available.	1987	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2183	*/	1988	*/
2184
2185	int	1989	int
2186	find_first_free_spot (const object *ob, maptile *m, int x, int y)	1990	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2187	{	1991	{
2188	int
2189	i;
2190
2191	for (i = 0; i < SIZEOFFREE; i++)	1992	for (int i = 0; i < SIZEOFFREE; i++)
2192	{
2193	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	1993	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2194	return i;	1994	return i;
2195	}	1995
2196	return -1;	1996	return -1;
2197	}	1997	}
2198		1998
2199	/*	1999	/*
2200	* The function permute(arr, begin, end) randomly reorders the array	2000	* The function permute(arr, begin, end) randomly reorders the array
2201	* arr[begin..end-1].	2001	* arr[begin..end-1].
		2002	* now uses a fisher-yates shuffle, old permute was broken
2202	*/	2003	*/
2203	static void	2004	static void
2204	permute (int *arr, int begin, int end)	2005	permute (int *arr, int begin, int end)
2205	{	2006	{
2206	int	2007	arr += begin;
2207	i,
2208	j,
2209	tmp,
2210	len;
2211
2212	len = end - begin;	2008	end -= begin;
2213	for (i = begin; i < end; i++)
2214	{
2215	j = begin + RANDOM () % len;
2216		2009
2217	tmp = arr[i];	2010	while (--end)
2218	arr[i] = arr[j];	2011	swap (arr [end], arr [rndm (end + 1)]);
2219	arr[j] = tmp;
2220	}
2221	}	2012	}
2222		2013
2223	/* new function to make monster searching more efficient, and effective!	2014	/* new function to make monster searching more efficient, and effective!
2224	* This basically returns a randomized array (in the passed pointer) of	2015	* This basically returns a randomized array (in the passed pointer) of
2225	* the spaces to find monsters. In this way, it won't always look for	2016	* the spaces to find monsters. In this way, it won't always look for
…		…
2228	* the 3x3 area will be searched, just not in a predictable order.	2019	* the 3x3 area will be searched, just not in a predictable order.
2229	*/	2020	*/
2230	void	2021	void
2231	get_search_arr (int *search_arr)	2022	get_search_arr (int *search_arr)
2232	{	2023	{
2233	int	2024	int i;
2234	i;
2235		2025
2236	for (i = 0; i < SIZEOFFREE; i++)	2026	for (i = 0; i < SIZEOFFREE; i++)
2237	{
2238	search_arr[i] = i;	2027	search_arr[i] = i;
2239	}
2240		2028
2241	permute (search_arr, 1, SIZEOFFREE1 + 1);	2029	permute (search_arr, 1, SIZEOFFREE1 + 1);
2242	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2030	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2243	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2031	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2244	}	2032	}
…		…
2253	* Perhaps incorrectly, but I'm making the assumption that exclude	2041	* Perhaps incorrectly, but I'm making the assumption that exclude
2254	* is actually want is going to try and move there. We need this info	2042	* is actually want is going to try and move there. We need this info
2255	* because we have to know what movement the thing looking to move	2043	* because we have to know what movement the thing looking to move
2256	* there is capable of.	2044	* there is capable of.
2257	*/	2045	*/
2258
2259	int	2046	int
2260	find_dir (maptile *m, int x, int y, object *exclude)	2047	find_dir (maptile *m, int x, int y, object *exclude)
2261	{	2048	{
2262	int
2263	i,
2264	max = SIZEOFFREE, mflags;	2049	int i, max = SIZEOFFREE, mflags;
2265		2050
2266	sint16 nx, ny;	2051	sint16 nx, ny;
2267	object *	2052	object *tmp;
2268	tmp;
2269	maptile *	2053	maptile *mp;
2270	mp;
2271		2054
2272	MoveType blocked, move_type;	2055	MoveType blocked, move_type;
2273		2056
2274	if (exclude && exclude->head)	2057	if (exclude && exclude->head)
2275	{	2058	{
…		…
2287	mp = m;	2070	mp = m;
2288	nx = x + freearr_x[i];	2071	nx = x + freearr_x[i];
2289	ny = y + freearr_y[i];	2072	ny = y + freearr_y[i];
2290		2073
2291	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2074	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2075
2292	if (mflags & P_OUT_OF_MAP)	2076	if (mflags & P_OUT_OF_MAP)
2293	{
2294	max = maxfree[i];	2077	max = maxfree[i];
2295	}
2296	else	2078	else
2297	{	2079	{
2298	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2080	mapspace &ms = mp->at (nx, ny);
		2081
		2082	blocked = ms.move_block;
2299		2083
2300	if ((move_type & blocked) == move_type)	2084	if ((move_type & blocked) == move_type)
2301	{
2302	max = maxfree[i];	2085	max = maxfree[i];
2303	}
2304	else if (mflags & P_IS_ALIVE)	2086	else if (mflags & P_IS_ALIVE)
2305	{	2087	{
2306	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2088	for (tmp = ms.bot; tmp; tmp = tmp->above)
2307	{	2089	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2308	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2090	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))
2309	{
2310	break;	2091	break;
2311	}	2092
2312	}
2313	if (tmp)	2093	if (tmp)
2314	{
2315	return freedir[i];	2094	return freedir[i];
2316	}
2317	}	2095	}
2318	}	2096	}
2319	}	2097	}
		2098
2320	return 0;	2099	return 0;
2321	}	2100	}
2322		2101
2323	/*	2102	/*
2324	* distance(object 1, object 2) will return the square of the	2103	* distance(object 1, object 2) will return the square of the
2325	* distance between the two given objects.	2104	* distance between the two given objects.
2326	*/	2105	*/
2327
2328	int	2106	int
2329	distance (const object *ob1, const object *ob2)	2107	distance (const object *ob1, const object *ob2)
2330	{	2108	{
2331	int
2332	i;
2333
2334	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2109	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2335	return i;
2336	}	2110	}
2337		2111
2338	/*	2112	/*
2339	* find_dir_2(delta-x,delta-y) will return a direction in which	2113	* find_dir_2(delta-x,delta-y) will return a direction in which
2340	* an object which has subtracted the x and y coordinates of another	2114	* an object which has subtracted the x and y coordinates of another
2341	* object, needs to travel toward it.	2115	* object, needs to travel toward it.
2342	*/	2116	*/
2343
2344	int	2117	int
2345	find_dir_2 (int x, int y)	2118	find_dir_2 (int x, int y)
2346	{	2119	{
2347	int	2120	int q;
2348	q;
2349		2121
2350	if (y)	2122	if (y)
2351	q = x * 100 / y;	2123	q = x * 100 / y;
2352	else if (x)	2124	else if (x)
2353	q = -300 * x;	2125	q = -300 * x;
…		…
2378		2150
2379	return 3;	2151	return 3;
2380	}	2152	}
2381		2153
2382	/*	2154	/*
2383	* absdir(int): Returns a number between 1 and 8, which represent
2384	* the "absolute" direction of a number (it actually takes care of
2385	* "overflow" in previous calculations of a direction).
2386	*/
2387
2388	int
2389	absdir (int d)
2390	{
2391	while (d < 1)
2392	d += 8;
2393	while (d > 8)
2394	d -= 8;
2395	return d;
2396	}
2397
2398	/*
2399	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2155	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2400	* between two directions (which are expected to be absolute (see absdir())	2156	* between two directions (which are expected to be absolute (see absdir())
2401	*/	2157	*/
2402
2403	int	2158	int
2404	dirdiff (int dir1, int dir2)	2159	dirdiff (int dir1, int dir2)
2405	{	2160	{
2406	int	2161	int d;
2407	d;
2408		2162
2409	d = abs (dir1 - dir2);	2163	d = abs (dir1 - dir2);
2410	if (d > 4)	2164	if (d > 4)
2411	d = 8 - d;	2165	d = 8 - d;
		2166
2412	return d;	2167	return d;
2413	}	2168	}
2414		2169
2415	/* peterm:	2170	/* peterm:
2416	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2171	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2419	* This basically means that if direction is 15, then it could either go	2174	* This basically means that if direction is 15, then it could either go
2420	* direction 4, 14, or 16 to get back to where we are.	2175	* direction 4, 14, or 16 to get back to where we are.
2421	* Moved from spell_util.c to object.c with the other related direction	2176	* Moved from spell_util.c to object.c with the other related direction
2422	* functions.	2177	* functions.
2423	*/	2178	*/
2424
2425	int
2426	reduction_dir[SIZEOFFREE][3] = {	2179	int reduction_dir[SIZEOFFREE][3] = {
2427	{0, 0, 0}, /* 0 */	2180	{0, 0, 0}, /* 0 */
2428	{0, 0, 0}, /* 1 */	2181	{0, 0, 0}, /* 1 */
2429	{0, 0, 0}, /* 2 */	2182	{0, 0, 0}, /* 2 */
2430	{0, 0, 0}, /* 3 */	2183	{0, 0, 0}, /* 3 */
2431	{0, 0, 0}, /* 4 */	2184	{0, 0, 0}, /* 4 */
…		…
2479	* find a path to that monster that we found. If not,	2232	* find a path to that monster that we found. If not,
2480	* we don't bother going toward it. Returns 1 if we	2233	* we don't bother going toward it. Returns 1 if we
2481	* can see a direct way to get it	2234	* can see a direct way to get it
2482	* Modified to be map tile aware -.MSW	2235	* Modified to be map tile aware -.MSW
2483	*/	2236	*/
2484
2485
2486	int	2237	int
2487	can_see_monsterP (maptile *m, int x, int y, int dir)	2238	can_see_monsterP (maptile *m, int x, int y, int dir)
2488	{	2239	{
2489	sint16 dx, dy;	2240	sint16 dx, dy;
2490	int
2491	mflags;	2241	int mflags;
2492		2242
2493	if (dir < 0)	2243	if (dir < 0)
2494	return 0; /* exit condition: invalid direction */	2244	return 0; /* exit condition: invalid direction */
2495		2245
2496	dx = x + freearr_x[dir];	2246	dx = x + freearr_x[dir];
…		…
2509	return 0;	2259	return 0;
2510		2260
2511	/* yes, can see. */	2261	/* yes, can see. */
2512	if (dir < 9)	2262	if (dir < 9)
2513	return 1;	2263	return 1;
		2264
2514	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2265	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2515	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2266	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2267	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2516	}	2268	}
2517
2518
2519		2269
2520	/*	2270	/*
2521	* can_pick(picker, item): finds out if an object is possible to be	2271	* can_pick(picker, item): finds out if an object is possible to be
2522	* picked up by the picker. Returnes 1 if it can be	2272	* picked up by the picker. Returnes 1 if it can be
2523	* picked up, otherwise 0.	2273	* picked up, otherwise 0.
…		…
2534	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2284	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2535	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2285	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2536	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2286	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2537	}	2287	}
2538		2288
2539
2540	/*	2289	/*
2541	* create clone from object to another	2290	* create clone from object to another
2542	*/	2291	*/
2543	object *	2292	object *
2544	object_create_clone (object *asrc)	2293	object_create_clone (object *asrc)
2545	{	2294	{
2546	object *
2547	dst = NULL, *tmp, *src, *part, *prev, *item;	2295	object *dst = 0, *tmp, *src, *part, *prev, *item;
2548		2296
2549	if (!asrc)	2297	if (!asrc)
2550	return NULL;	2298	return 0;
		2299
2551	src = asrc;	2300	src = asrc;
2552	if (src->head)	2301	if (src->head)
2553	src = src->head;	2302	src = src->head;
2554		2303
2555	prev = NULL;	2304	prev = 0;
2556	for (part = src; part; part = part->more)	2305	for (part = src; part; part = part->more)
2557	{	2306	{
2558	tmp = get_object ();	2307	tmp = part->clone ();
2559	copy_object (part, tmp);
2560	tmp->x -= src->x;	2308	tmp->x -= src->x;
2561	tmp->y -= src->y;	2309	tmp->y -= src->y;
		2310
2562	if (!part->head)	2311	if (!part->head)
2563	{	2312	{
2564	dst = tmp;	2313	dst = tmp;
2565	tmp->head = NULL;	2314	tmp->head = 0;
2566	}	2315	}
2567	else	2316	else
2568	{
2569	tmp->head = dst;	2317	tmp->head = dst;
2570	}	2318
2571	tmp->more = NULL;	2319	tmp->more = 0;
		2320
2572	if (prev)	2321	if (prev)
2573	prev->more = tmp;	2322	prev->more = tmp;
		2323
2574	prev = tmp;	2324	prev = tmp;
2575	}	2325	}
2576		2326
2577	for (item = src->inv; item; item = item->below)	2327	for (item = src->inv; item; item = item->below)
2578	insert_ob_in_ob (object_create_clone (item), dst);	2328	insert_ob_in_ob (object_create_clone (item), dst);
…		…
2584	/* Basically, we save the content of the string to a temp file, then call */	2334	/* Basically, we save the content of the string to a temp file, then call */
2585	/* load_object on it. I admit it is a highly inefficient way to make things, */	2335	/* load_object on it. I admit it is a highly inefficient way to make things, */
2586	/* but it was simple to make and allows reusing the load_object function. */	2336	/* but it was simple to make and allows reusing the load_object function. */
2587	/* Remember not to use load_object_str in a time-critical situation. */	2337	/* Remember not to use load_object_str in a time-critical situation. */
2588	/* Also remember that multiparts objects are not supported for now. */	2338	/* Also remember that multiparts objects are not supported for now. */
2589
2590	object *	2339	object *
2591	load_object_str (const char *obstr)	2340	load_object_str (const char *obstr)
2592	{	2341	{
2593	object *op;	2342	object *op;
2594	char filename[MAX_BUF];	2343	char filename[MAX_BUF];
…		…
2604	}	2353	}
2605		2354
2606	fprintf (tempfile, obstr);	2355	fprintf (tempfile, obstr);
2607	fclose (tempfile);	2356	fclose (tempfile);
2608		2357
2609	op = get_object ();	2358	op = object::create ();
2610		2359
2611	object_thawer thawer (filename);	2360	object_thawer thawer (filename);
2612		2361
2613	if (thawer)	2362	if (thawer)
2614	load_object (thawer, op, 0);	2363	load_object (thawer, op, 0);
…		…
2624	* returns NULL if no match.	2373	* returns NULL if no match.
2625	*/	2374	*/
2626	object *	2375	object *
2627	find_obj_by_type_subtype (const object *who, int type, int subtype)	2376	find_obj_by_type_subtype (const object *who, int type, int subtype)
2628	{	2377	{
2629	object *tmp;
2630
2631	for (tmp = who->inv; tmp; tmp = tmp->below)	2378	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2632	if (tmp->type == type && tmp->subtype == subtype)	2379	if (tmp->type == type && tmp->subtype == subtype)
2633	return tmp;	2380	return tmp;
2634		2381
2635	return NULL;	2382	return 0;
2636	}	2383	}
2637		2384
2638	/* If ob has a field named key, return the link from the list,	2385	/* If ob has a field named key, return the link from the list,
2639	* otherwise return NULL.	2386	* otherwise return NULL.
2640	*	2387	*
…		…
2642	* do the desired thing.	2389	* do the desired thing.
2643	*/	2390	*/
2644	key_value *	2391	key_value *
2645	get_ob_key_link (const object *ob, const char *key)	2392	get_ob_key_link (const object *ob, const char *key)
2646	{	2393	{
2647	key_value *link;
2648
2649	for (link = ob->key_values; link != NULL; link = link->next)	2394	for (key_value *link = ob->key_values; link; link = link->next)
2650	if (link->key == key)	2395	if (link->key == key)
2651	return link;	2396	return link;
2652		2397
2653	return NULL;	2398	return 0;
2654	}	2399	}
2655		2400
2656	/*	2401	/*
2657	* Returns the value of op has an extra_field for key, or NULL.	2402	* Returns the value of op has an extra_field for key, or NULL.
2658	*	2403	*
…		…
2698	* Returns TRUE on success.	2443	* Returns TRUE on success.
2699	*/	2444	*/
2700	int	2445	int
2701	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2446	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2702	{	2447	{
2703	key_value *
2704	field = NULL, *last = NULL;	2448	key_value *field = NULL, *last = NULL;
2705		2449
2706	for (field = op->key_values; field != NULL; field = field->next)	2450	for (field = op->key_values; field != NULL; field = field->next)
2707	{	2451	{
2708	if (field->key != canonical_key)	2452	if (field->key != canonical_key)
2709	{	2453	{
…		…
2737	/* IF we get here, key doesn't exist */	2481	/* IF we get here, key doesn't exist */
2738		2482
2739	/* No field, we'll have to add it. */	2483	/* No field, we'll have to add it. */
2740		2484
2741	if (!add_key)	2485	if (!add_key)
2742	{
2743	return FALSE;	2486	return FALSE;
2744	}	2487
2745	/* There isn't any good reason to store a null	2488	/* There isn't any good reason to store a null
2746	* value in the key/value list. If the archetype has	2489	* value in the key/value list. If the archetype has
2747	* this key, then we should also have it, so shouldn't	2490	* this key, then we should also have it, so shouldn't
2748	* be here. If user wants to store empty strings,	2491	* be here. If user wants to store empty strings,
2749	* should pass in ""	2492	* should pass in ""
…		…
2798	}	2541	}
2799	else	2542	else
2800	item = item->env;	2543	item = item->env;
2801	}	2544	}
2802		2545
		2546
		2547	const char *
		2548	object::flag_desc (char *desc, int len) const
		2549	{
		2550	char *p = desc;
		2551	bool first = true;
		2552
		2553	*p = 0;
		2554
		2555	for (int i = 0; i < NUM_FLAGS; i++)
		2556	{
		2557	if (len <= 10) // magic constant!
		2558	{
		2559	snprintf (p, len, ",...");
		2560	break;
		2561	}
		2562
		2563	if (flag [i])
		2564	{
		2565	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2566	len -= cnt;
		2567	p += cnt;
		2568	first = false;
		2569	}
		2570	}
		2571
		2572	return desc;
		2573	}
		2574
2803	// return a suitable string describing an objetc in enough detail to find it	2575	// return a suitable string describing an object in enough detail to find it
2804	const char *	2576	const char *
2805	object::debug_desc (char *info) const	2577	object::debug_desc (char *info) const
2806	{	2578	{
		2579	char flagdesc[512];
2807	char info2[256 * 3];	2580	char info2[256 * 4];
2808	char *p = info;	2581	char *p = info;
2809		2582
2810	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2583	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2811	count,	2584	count, uuid.seq,
2812	&name,	2585	&name,
2813	title ? " " : "",	2586	title ? "\",title:\"" : "",
2814	title ? (const char *)title : "");	2587	title ? (const char *)title : "",
		2588	flag_desc (flagdesc, 512), type);
2815		2589
2816	if (env)	2590	if (env)
2817	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2591	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2818		2592
2819	if (map)	2593	if (map)
2820	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2594	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2821		2595
2822	return info;	2596	return info;
2823	}	2597	}
2824		2598
2825	const char *	2599	const char *
2826	object::debug_desc () const	2600	object::debug_desc () const
2827	{	2601	{
2828	static char info[256 * 3];	2602	static char info[256 * 4];
2829	return debug_desc (info);	2603	return debug_desc (info);
2830	}	2604	}
2831		2605
		2606	const char *
		2607	object::debug_desc2 () const
		2608	{
		2609	static char info[256 * 4];
		2610	return debug_desc (info);
		2611	}
		2612
		2613	struct region *
		2614	object::region () const
		2615	{
		2616	return map ? map->region (x, y)
		2617	: region::default_region ();
		2618	}
		2619

Diff Legend

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