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.58 by pippijn, Mon Dec 4 17:48:35 2006 UTC vs.
Revision 1.120 by root, Sun Jan 21 21:28:27 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	}	663	}
845		664
846	object::object ()	665	object::object ()
847	{	666	{
848	SET_FLAG (this, FLAG_REMOVED);	667	SET_FLAG (this, FLAG_REMOVED);
…		…
851	face = blank_face;	670	face = blank_face;
852	}	671	}
853		672
854	object::~object ()	673	object::~object ()
855	{	674	{
		675	if (index)
		676	unlink ();
		677
856	free_key_values (this);	678	free_key_values (this);
857	}	679	}
858		680
		681	static int object_count;
		682
859	void object::link ()	683	void object::link ()
860	{	684	{
861	count = ++ob_count;	685	assert (!index);//D
862	uuid = gen_uuid ();	686	uuid = gen_uuid ();
		687	count = ++object_count;
863		688
864	prev = 0;	689	refcnt_inc ();
865	next = object::first;	690	objects.insert (this);
866
867	if (object::first)
868	object::first->prev = this;
869
870	object::first = this;
871	}	691	}
872		692
873	void object::unlink ()	693	void object::unlink ()
874	{	694	{
875	if (this == object::first)	695	assert (index);//D
876	object::first = next;	696	objects.erase (this);
		697	refcnt_dec ();
		698	}
877		699
878	/* Remove this object from the list of used objects */	700	void
879	if (prev) prev->next = next;	701	object::activate ()
880	if (next) next->prev = prev;	702	{
		703	/* If already on active list, don't do anything */
		704	if (active)
		705	return;
881		706
882	prev = 0;	707	if (has_active_speed ())
883	next = 0;	708	actives.insert (this);
		709	}
		710
		711	void
		712	object::activate_recursive ()
		713	{
		714	activate ();
		715
		716	for (object *op = inv; op; op = op->below)
		717	op->activate_recursive ();
		718	}
		719
		720	/* This function removes object 'op' from the list of active
		721	* objects.
		722	* This should only be used for style maps or other such
		723	* reference maps where you don't want an object that isn't
		724	* in play chewing up cpu time getting processed.
		725	* The reverse of this is to call update_ob_speed, which
		726	* will do the right thing based on the speed of the object.
		727	*/
		728	void
		729	object::deactivate ()
		730	{
		731	/* If not on the active list, nothing needs to be done */
		732	if (!active)
		733	return;
		734
		735	actives.erase (this);
		736	}
		737
		738	void
		739	object::deactivate_recursive ()
		740	{
		741	for (object *op = inv; op; op = op->below)
		742	op->deactivate_recursive ();
		743
		744	deactivate ();
		745	}
		746
		747	void
		748	object::set_flag_inv (int flag, int value)
		749	{
		750	for (object *op = inv; op; op = op->below)
		751	{
		752	op->flag [flag] = value;
		753	op->set_flag_inv (flag, value);
		754	}
		755	}
		756
		757	/*
		758	* Remove and free all objects in the inventory of the given object.
		759	* object.c ?
		760	*/
		761	void
		762	object::destroy_inv (bool drop_to_ground)
		763	{
		764	// need to check first, because the checks below might segfault
		765	// as we might be on an invalid mapspace and crossfire code
		766	// is too buggy to ensure that the inventory is empty.
		767	// corollary: if you create arrows etc. with stuff in tis inventory,
		768	// cf will crash below with off-map x and y
		769	if (!inv)
		770	return;
		771
		772	/* Only if the space blocks everything do we not process -
		773	* if some form of movement is allowed, let objects
		774	* drop on that space.
		775	*/
		776	if (!drop_to_ground
		777	|| !map
		778	|| map->in_memory != MAP_IN_MEMORY
		779	|| ms ().move_block == MOVE_ALL)
		780	{
		781	while (inv)
		782	{
		783	inv->destroy_inv (drop_to_ground);
		784	inv->destroy ();
		785	}
		786	}
		787	else
		788	{ /* Put objects in inventory onto this space */
		789	while (inv)
		790	{
		791	object *op = inv;
		792
		793	if (op->flag [FLAG_STARTEQUIP]
		794	|| op->flag [FLAG_NO_DROP]
		795	|| op->type == RUNE
		796	|| op->type == TRAP
		797	|| op->flag [FLAG_IS_A_TEMPLATE]
		798	|| op->flag [FLAG_DESTROY_ON_DEATH])
		799	op->destroy ();
		800	else
		801	map->insert (op, x, y);
		802	}
		803	}
884	}	804	}
885		805
886	object *object::create ()	806	object *object::create ()
887	{	807	{
888	object *op = new object;	808	object *op = new object;
889	op->link ();	809	op->link ();
890	return op;	810	return op;
891	}	811	}
892		812
893	/*	813	void
894	* free_object() frees everything allocated by an object, removes	814	object::do_destroy ()
895	* it from the list of used objects, and puts it on the list of
896	* free objects. The IS_FREED() flag is set in the object.
897	* The object must have been removed by remove_ob() first for
898	* this function to succeed.
899	*
900	* If destroy_inventory is set, free inventory as well. Else drop items in
901	* inventory to the ground.
902	*/
903	void object::destroy (bool destroy_inventory)
904	{	815	{
905	if (QUERY_FLAG (this, FLAG_FREED))	816	attachable::do_destroy ();
906	return;
907		817
908	if (QUERY_FLAG (this, FLAG_FRIENDLY))	818	if (flag [FLAG_IS_LINKED])
		819	remove_button_link (this);
		820
		821	if (flag [FLAG_FRIENDLY])
909	remove_friendly_object (this);	822	remove_friendly_object (this);
910		823
911	if (!QUERY_FLAG (this, FLAG_REMOVED))	824	if (!flag [FLAG_REMOVED])
912	remove_ob (this);	825	remove ();
913		826
914	SET_FLAG (this, FLAG_FREED);	827	destroy_inv (true);
915		828
916	if (more)	829	deactivate ();
917	{	830	unlink ();
918	more->destroy (destroy_inventory);
919	more = 0;
920	}
921		831
922	if (inv)	832	flag [FLAG_FREED] = 1;
923	{
924	/* Only if the space blocks everything do we not process -
925	* if some form of movement is allowed, let objects
926	* drop on that space.
927	*/
928	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
929	{
930	object *op = inv;
931
932	while (op)
933	{
934	object *tmp = op->below;
935	op->destroy (destroy_inventory);
936	op = tmp;
937	}
938	}
939	else
940	{ /* Put objects in inventory onto this space */
941	object *op = inv;
942
943	while (op)
944	{
945	object *tmp = op->below;
946
947	remove_ob (op);
948
949	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
950	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
951	free_object (op);
952	else
953	{
954	op->x = x;
955	op->y = y;
956	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
957	}
958
959	op = tmp;
960	}
961	}
962	}
963		833
964	// hack to ensure that freed objects still have a valid map	834	// hack to ensure that freed objects still have a valid map
965	{	835	{
966	static maptile *freed_map; // freed objects are moved here to avoid crashes	836	static maptile *freed_map; // freed objects are moved here to avoid crashes
967		837
…		…
971		841
972	freed_map->name = "/internal/freed_objects_map";	842	freed_map->name = "/internal/freed_objects_map";
973	freed_map->width = 3;	843	freed_map->width = 3;
974	freed_map->height = 3;	844	freed_map->height = 3;
975		845
976	freed_map->allocate ();	846	freed_map->alloc ();
		847	freed_map->in_memory = MAP_IN_MEMORY;
977	}	848	}
978		849
979	map = freed_map;	850	map = freed_map;
980	x = 1;	851	x = 1;
981	y = 1;	852	y = 1;
982	}	853	}
983		854
		855	head = 0;
		856
		857	if (more)
		858	{
		859	more->destroy ();
		860	more = 0;
		861	}
		862
984	// clear those pointers that likely might have circular references to us	863	// clear those pointers that likely might have circular references to us
985	owner = 0;	864	owner = 0;
986	enemy = 0;	865	enemy = 0;
987	attacked_by = 0;	866	attacked_by = 0;
		867	}
988		868
989	// only relevant for players(?), but make sure of it anyways	869	void
990	contr = 0;	870	object::destroy (bool destroy_inventory)
		871	{
		872	if (destroyed ())
		873	return;
991		874
992	/* Remove object from the active list */	875	if (destroy_inventory)
993	speed = 0;	876	destroy_inv (false);
994	update_ob_speed (this);
995		877
996	unlink ();	878	attachable::destroy ();
997
998	mortals.push_back (this);
999	}	879	}
1000		880
1001	/*	881	/*
1002	* sub_weight() recursively (outwards) subtracts a number from the	882	* sub_weight() recursively (outwards) subtracts a number from the
1003	* weight of an object (and what is carried by it's environment(s)).	883	* weight of an object (and what is carried by it's environment(s)).
1004	*/	884	*/
1005
1006	void	885	void
1007	sub_weight (object *op, signed long weight)	886	sub_weight (object *op, signed long weight)
1008	{	887	{
1009	while (op != NULL)	888	while (op != NULL)
1010	{	889	{
…		…
1014	op->carrying -= weight;	893	op->carrying -= weight;
1015	op = op->env;	894	op = op->env;
1016	}	895	}
1017	}	896	}
1018		897
1019	/* remove_ob(op):	898	/* op->remove ():
1020	* This function removes the object op from the linked list of objects	899	* This function removes the object op from the linked list of objects
1021	* which it is currently tied to. When this function is done, the	900	* which it is currently tied to. When this function is done, the
1022	* object will have no environment. If the object previously had an	901	* object will have no environment. If the object previously had an
1023	* environment, the x and y coordinates will be updated to	902	* environment, the x and y coordinates will be updated to
1024	* the previous environment.	903	* the previous environment.
1025	* Beware: This function is called from the editor as well!	904	* Beware: This function is called from the editor as well!
1026	*/	905	*/
1027
1028	void	906	void
1029	remove_ob (object *op)	907	object::remove_slow ()
1030	{	908	{
1031	object *tmp, *last = 0;	909	object *tmp, *last = 0;
1032	object *otmp;	910	object *otmp;
1033		911
1034	int check_walk_off;
1035	maptile *m;
1036
1037	sint16 x, y;
1038
1039	if (QUERY_FLAG (op, FLAG_REMOVED))	912	if (QUERY_FLAG (this, FLAG_REMOVED))
1040	return;	913	return;
1041		914
1042	SET_FLAG (op, FLAG_REMOVED);	915	SET_FLAG (this, FLAG_REMOVED);
		916	INVOKE_OBJECT (REMOVE, this);
1043		917
1044	if (op->more != NULL)	918	if (more)
1045	remove_ob (op->more);	919	more->remove ();
1046		920
1047	/*	921	/*
1048	* In this case, the object to be removed is in someones	922	* In this case, the object to be removed is in someones
1049	* inventory.	923	* inventory.
1050	*/	924	*/
1051	if (op->env != NULL)	925	if (env)
1052	{	926	{
1053	if (op->nrof)	927	if (nrof)
1054	sub_weight (op->env, op->weight * op->nrof);	928	sub_weight (env, weight * nrof);
1055	else	929	else
1056	sub_weight (op->env, op->weight + op->carrying);	930	sub_weight (env, weight + carrying);
1057		931
1058	/* NO_FIX_PLAYER is set when a great many changes are being	932	/* NO_FIX_PLAYER is set when a great many changes are being
1059	* made to players inventory. If set, avoiding the call	933	* made to players inventory. If set, avoiding the call
1060	* to save cpu time.	934	* to save cpu time.
1061	*/	935	*/
1062	if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	936	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1063	fix_player (otmp);	937	otmp->update_stats ();
1064		938
1065	if (op->above != NULL)	939	if (above)
1066	op->above->below = op->below;	940	above->below = below;
1067	else	941	else
1068	op->env->inv = op->below;	942	env->inv = below;
1069		943
1070	if (op->below != NULL)	944	if (below)
1071	op->below->above = op->above;	945	below->above = above;
1072		946
1073	/* we set up values so that it could be inserted into	947	/* we set up values so that it could be inserted into
1074	* the map, but we don't actually do that - it is up	948	* the map, but we don't actually do that - it is up
1075	* to the caller to decide what we want to do.	949	* to the caller to decide what we want to do.
1076	*/	950	*/
1077	op->x = op->env->x, op->y = op->env->y;	951	x = env->x, y = env->y;
1078	op->map = op->env->map;	952	map = env->map;
1079	op->above = NULL, op->below = NULL;	953	above = 0, below = 0;
1080	op->env = NULL;	954	env = 0;
1081	}	955	}
1082	else if (op->map)	956	else if (map)
1083	{	957	{
1084	x = op->x;	958	if (type == PLAYER)
1085	y = op->y;
1086	m = get_map_from_coord (op->map, &x, &y);
1087
1088	if (!m)
1089	{	959	{
1090	LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",	960	--map->players;
1091	op->map->path, op->x, op->y);	961	map->touch ();
1092	/* in old days, we used to set x and y to 0 and continue.
1093	* it seems if we get into this case, something is probablye
1094	* screwed up and should be fixed.
1095	*/
1096	abort ();
1097	}	962	}
1098		963
1099	if (op->map != m)	964	map->dirty = true;
1100	LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",	965	mapspace &ms = this->ms ();
1101	op->map->path, m->path, op->x, op->y, x, y);
1102
1103	/* Re did the following section of code - it looks like it had
1104	* lots of logic for things we no longer care about
1105	*/
1106		966
1107	/* link the object above us */	967	/* link the object above us */
1108	if (op->above)	968	if (above)
1109	op->above->below = op->below;	969	above->below = below;
1110	else	970	else
1111	SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */	971	ms.top = below; /* we were top, set new top */
1112		972
1113	/* Relink the object below us, if there is one */	973	/* Relink the object below us, if there is one */
1114	if (op->below)	974	if (below)
1115	op->below->above = op->above;	975	below->above = above;
1116	else	976	else
1117	{	977	{
1118	/* Nothing below, which means we need to relink map object for this space	978	/* Nothing below, which means we need to relink map object for this space
1119	* use translated coordinates in case some oddness with map tiling is	979	* use translated coordinates in case some oddness with map tiling is
1120	* evident	980	* evident
1121	*/	981	*/
1122	if (GET_MAP_OB (m, x, y) != op)	982	if (GET_MAP_OB (map, x, y) != this)
1123	{
1124	char *dump = dump_object (op);
1125	LOG (llevError,
1126	"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);	983	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 ());
1127	free (dump);
1128	dump = dump_object (GET_MAP_OB (m, x, y));
1129	LOG (llevError, "%s\n", dump);
1130	free (dump);
1131	}
1132		984
1133	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */	985	ms.bot = above; /* goes on above it. */
1134	}	986	}
1135		987
1136	op->above = 0;	988	above = 0;
1137	op->below = 0;	989	below = 0;
1138		990
1139	if (op->map->in_memory == MAP_SAVING)	991	if (map->in_memory == MAP_SAVING)
1140	return;	992	return;
1141		993
1142	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);	994	int check_walk_off = !flag [FLAG_NO_APPLY];
1143		995
1144	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	996	for (tmp = ms.bot; tmp; tmp = tmp->above)
1145	{	997	{
1146	/* No point updating the players look faces if he is the object	998	/* No point updating the players look faces if he is the object
1147	* being removed.	999	* being removed.
1148	*/	1000	*/
1149		1001
1150	if (tmp->type == PLAYER && tmp != op)	1002	if (tmp->type == PLAYER && tmp != this)
1151	{	1003	{
1152	/* If a container that the player is currently using somehow gets	1004	/* If a container that the player is currently using somehow gets
1153	* removed (most likely destroyed), update the player view	1005	* removed (most likely destroyed), update the player view
1154	* appropriately.	1006	* appropriately.
1155	*/	1007	*/
1156	if (tmp->container == op)	1008	if (tmp->container == this)
1157	{	1009	{
1158	CLEAR_FLAG (op, FLAG_APPLIED);	1010	flag [FLAG_APPLIED] = 0;
1159	tmp->container = NULL;	1011	tmp->container = 0;
1160	}	1012	}
1161		1013
1162	tmp->contr->socket.update_look = 1;	1014	if (tmp->contr->ns)
		1015	tmp->contr->ns->floorbox_update ();
1163	}	1016	}
1164		1017
1165	/* See if player moving off should effect something */	1018	/* See if object moving off should effect something */
1166	if (check_walk_off	1019	if (check_walk_off
1167	&& ((op->move_type & tmp->move_off)	1020	&& ((move_type & tmp->move_off)
1168	&& (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1021	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1169	{	1022	{
1170	move_apply (tmp, op, NULL);	1023	move_apply (tmp, this, 0);
1171		1024
1172	if (op->destroyed ())	1025	if (destroyed ())
1173	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1026	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1174	}	1027	}
1175		1028
1176	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1029	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1177		1030	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1178	if (tmp->above == tmp)	1031	if (tmp->above == tmp)
1179	tmp->above = NULL;	1032	tmp->above = 0;
1180		1033
1181	last = tmp;	1034	last = tmp;
1182	}	1035	}
1183		1036
1184	/* last == NULL of there are no objects on this space */	1037	/* last == NULL if there are no objects on this space */
		1038	//TODO: this makes little sense, why only update the topmost object?
1185	if (last == NULL)	1039	if (!last)
1186	{	1040	map->at (x, y).flags_ = 0;
1187	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1188	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1189	* those out anyways, and if there are any flags set right now, they won't
1190	* be correct anyways.
1191	*/
1192	SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1193	update_position (op->map, op->x, op->y);
1194	}
1195	else	1041	else
1196	update_object (last, UP_OBJ_REMOVE);	1042	update_object (last, UP_OBJ_REMOVE);
1197		1043
1198	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))	1044	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1199	update_all_los (op->map, op->x, op->y);	1045	update_all_los (map, x, y);
1200	}	1046	}
1201	}	1047	}
1202		1048
1203	/*	1049	/*
1204	* merge_ob(op,top):	1050	* merge_ob(op,top):
…		…
1212	merge_ob (object *op, object *top)	1058	merge_ob (object *op, object *top)
1213	{	1059	{
1214	if (!op->nrof)	1060	if (!op->nrof)
1215	return 0;	1061	return 0;
1216		1062
1217	if (top == NULL)	1063	if (top)
1218	for (top = op; top != NULL && top->above != NULL; top = top->above);	1064	for (top = op; top && top->above; top = top->above)
		1065	;
1219		1066
1220	for (; top != NULL; top = top->below)	1067	for (; top; top = top->below)
1221	{	1068	{
1222	if (top == op)	1069	if (top == op)
1223	continue;	1070	continue;
1224	if (CAN_MERGE (op, top))	1071
		1072	if (object::can_merge (op, top))
1225	{	1073	{
1226	top->nrof += op->nrof;	1074	top->nrof += op->nrof;
1227		1075
1228	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1076	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1229	op->weight = 0; /* Don't want any adjustements now */	1077	op->weight = 0; /* Don't want any adjustements now */
1230	remove_ob (op);	1078	op->destroy ();
1231	free_object (op);
1232	return top;	1079	return top;
1233	}	1080	}
1234	}	1081	}
1235		1082
1236	return 0;	1083	return 0;
1237	}	1084	}
1238		1085
1239	/*	1086	/*
1240	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1087	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1241	* job preparing multi-part monsters	1088	* job preparing multi-part monsters.
1242	*/	1089	*/
1243	object *	1090	object *
1244	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1091	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1245	{	1092	{
1246	object *tmp;
1247
1248	if (op->head)
1249	op = op->head;
1250
1251	for (tmp = op; tmp; tmp = tmp->more)	1093	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1252	{	1094	{
1253	tmp->x = x + tmp->arch->clone.x;	1095	tmp->x = x + tmp->arch->clone.x;
1254	tmp->y = y + tmp->arch->clone.y;	1096	tmp->y = y + tmp->arch->clone.y;
1255	}	1097	}
1256		1098
…		…
1275	* Return value:	1117	* Return value:
1276	* new object if 'op' was merged with other object	1118	* new object if 'op' was merged with other object
1277	* NULL if 'op' was destroyed	1119	* NULL if 'op' was destroyed
1278	* just 'op' otherwise	1120	* just 'op' otherwise
1279	*/	1121	*/
1280
1281	object *	1122	object *
1282	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1123	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1283	{	1124	{
1284	object *tmp, *top, *floor = NULL;	1125	object *tmp, *top, *floor = NULL;
1285	sint16 x, y;
1286		1126
1287	if (QUERY_FLAG (op, FLAG_FREED))	1127	if (QUERY_FLAG (op, FLAG_FREED))
1288	{	1128	{
1289	LOG (llevError, "Trying to insert freed object!\n");	1129	LOG (llevError, "Trying to insert freed object!\n");
1290	return NULL;	1130	return NULL;
1291	}	1131	}
1292		1132
1293	if (m == NULL)	1133	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1134	LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
		1135
		1136	op->remove ();
		1137
		1138	if (!m)
1294	{	1139	{
1295	char *dump = dump_object (op);	1140	char *dump = dump_object (op);
1296	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1141	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1297	free (dump);	1142	free (dump);
1298	return op;	1143	return op;
…		…
1311	#endif	1156	#endif
1312	free (dump);	1157	free (dump);
1313	return op;	1158	return op;
1314	}	1159	}
1315		1160
1316	if (!QUERY_FLAG (op, FLAG_REMOVED))
1317	{
1318	char *dump = dump_object (op);
1319	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1320	free (dump);
1321	return op;
1322	}
1323
1324	if (op->more != NULL)
1325	{
1326	/* The part may be on a different map. */
1327
1328	object *more = op->more;	1161	if (object *more = op->more)
1329		1162	{
1330	/* We really need the caller to normalize coordinates - if
1331	* we set the map, that doesn't work if the location is within
1332	* a map and this is straddling an edge. So only if coordinate
1333	* is clear wrong do we normalize it.
1334	*/
1335	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1336	more->map = get_map_from_coord (m, &more->x, &more->y);
1337	else if (!more->map)
1338	{
1339	/* For backwards compatibility - when not dealing with tiled maps,
1340	* more->map should always point to the parent.
1341	*/
1342	more->map = m;
1343	}
1344
1345	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1163	if (!insert_ob_in_map (more, m, originator, flag))
1346	{	1164	{
1347	if (!op->head)	1165	if (!op->head)
1348	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1166	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1349		1167
1350	return NULL;	1168	return 0;
1351	}	1169	}
1352	}	1170	}
1353		1171
1354	CLEAR_FLAG (op, FLAG_REMOVED);	1172	CLEAR_FLAG (op, FLAG_REMOVED);
1355		1173
1356	/* Ideally, the caller figures this out. However, it complicates a lot	1174	/* Ideally, the caller figures this out. However, it complicates a lot
1357	* of areas of callers (eg, anything that uses find_free_spot would now	1175	* of areas of callers (eg, anything that uses find_free_spot would now
1358	* need extra work	1176	* need extra work
1359	*/	1177	*/
1360	op->map = get_map_from_coord (m, &op->x, &op->y);	1178	if (!xy_normalise (m, op->x, op->y))
1361	x = op->x;	1179	return 0;
1362	y = op->y;	1180
		1181	op->map = m;
		1182	mapspace &ms = op->ms ();
1363		1183
1364	/* this has to be done after we translate the coordinates.	1184	/* this has to be done after we translate the coordinates.
1365	*/	1185	*/
1366	if (op->nrof && !(flag & INS_NO_MERGE))	1186	if (op->nrof && !(flag & INS_NO_MERGE))
1367	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1187	for (tmp = ms.bot; tmp; tmp = tmp->above)
1368	if (CAN_MERGE (op, tmp))	1188	if (object::can_merge (op, tmp))
1369	{	1189	{
1370	op->nrof += tmp->nrof;	1190	op->nrof += tmp->nrof;
1371	remove_ob (tmp);	1191	tmp->destroy ();
1372	free_object (tmp);
1373	}	1192	}
1374		1193
1375	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1194	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1376	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1195	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1377		1196
…		…
1390	op->below = originator->below;	1209	op->below = originator->below;
1391		1210
1392	if (op->below)	1211	if (op->below)
1393	op->below->above = op;	1212	op->below->above = op;
1394	else	1213	else
1395	SET_MAP_OB (op->map, op->x, op->y, op);	1214	ms.bot = op;
1396		1215
1397	/* since *below* originator, no need to update top */	1216	/* since *below* originator, no need to update top */
1398	originator->below = op;	1217	originator->below = op;
1399	}	1218	}
1400	else	1219	else
1401	{	1220	{
		1221	top = ms.bot;
		1222
1402	/* If there are other objects, then */	1223	/* If there are other objects, then */
1403	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1224	if ((!(flag & INS_MAP_LOAD)) && top)
1404	{	1225	{
1405	object *last = NULL;	1226	object *last = 0;
1406		1227
1407	/*	1228	/*
1408	* If there are multiple objects on this space, we do some trickier handling.	1229	* If there are multiple objects on this space, we do some trickier handling.
1409	* We've already dealt with merging if appropriate.	1230	* We've already dealt with merging if appropriate.
1410	* Generally, we want to put the new object on top. But if	1231	* Generally, we want to put the new object on top. But if
…		…
1414	* once we get to them. This reduces the need to traverse over all of	1235	* once we get to them. This reduces the need to traverse over all of
1415	* them when adding another one - this saves quite a bit of cpu time	1236	* them when adding another one - this saves quite a bit of cpu time
1416	* when lots of spells are cast in one area. Currently, it is presumed	1237	* when lots of spells are cast in one area. Currently, it is presumed
1417	* that flying non pickable objects are spell objects.	1238	* that flying non pickable objects are spell objects.
1418	*/	1239	*/
1419		1240	for (top = ms.bot; top; top = top->above)
1420	while (top != NULL)
1421	{	1241	{
1422	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1242	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1423	floor = top;	1243	floor = top;
1424		1244
1425	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1245	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1428	top = top->below;	1248	top = top->below;
1429	break;	1249	break;
1430	}	1250	}
1431		1251
1432	last = top;	1252	last = top;
1433	top = top->above;
1434	}	1253	}
1435		1254
1436	/* Don't want top to be NULL, so set it to the last valid object */	1255	/* Don't want top to be NULL, so set it to the last valid object */
1437	top = last;	1256	top = last;
1438		1257
…		…
1445	* Unless those objects are exits, type 66	1264	* Unless those objects are exits, type 66
1446	* If INS_ON_TOP is used, don't do this processing	1265	* If INS_ON_TOP is used, don't do this processing
1447	* Need to find the object that in fact blocks view, otherwise	1266	* Need to find the object that in fact blocks view, otherwise
1448	* stacking is a bit odd.	1267	* stacking is a bit odd.
1449	*/	1268	*/
1450	if (!(flag & INS_ON_TOP) &&	1269	if (!(flag & INS_ON_TOP)
1451	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1270	&& ms.flags () & P_BLOCKSVIEW
		1271	&& (op->face && !op->face->visibility))
1452	{	1272	{
1453	for (last = top; last != floor; last = last->below)	1273	for (last = top; last != floor; last = last->below)
1454	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1274	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1455	break;	1275	break;
		1276
1456	/* Check to see if we found the object that blocks view,	1277	/* Check to see if we found the object that blocks view,
1457	* and make sure we have a below pointer for it so that	1278	* and make sure we have a below pointer for it so that
1458	* we can get inserted below this one, which requires we	1279	* we can get inserted below this one, which requires we
1459	* set top to the object below us.	1280	* set top to the object below us.
1460	*/	1281	*/
…		…
1462	top = last->below;	1283	top = last->below;
1463	}	1284	}
1464	} /* If objects on this space */	1285	} /* If objects on this space */
1465		1286
1466	if (flag & INS_MAP_LOAD)	1287	if (flag & INS_MAP_LOAD)
1467	top = GET_MAP_TOP (op->map, op->x, op->y);	1288	top = ms.top;
1468		1289
1469	if (flag & INS_ABOVE_FLOOR_ONLY)	1290	if (flag & INS_ABOVE_FLOOR_ONLY)
1470	top = floor;	1291	top = floor;
1471		1292
1472	/* Top is the object that our object (op) is going to get inserted above.	1293	/* Top is the object that our object (op) is going to get inserted above.
1473	*/	1294	*/
1474		1295
1475	/* First object on this space */	1296	/* First object on this space */
1476	if (!top)	1297	if (!top)
1477	{	1298	{
1478	op->above = GET_MAP_OB (op->map, op->x, op->y);	1299	op->above = ms.bot;
1479		1300
1480	if (op->above)	1301	if (op->above)
1481	op->above->below = op;	1302	op->above->below = op;
1482		1303
1483	op->below = NULL;	1304	op->below = 0;
1484	SET_MAP_OB (op->map, op->x, op->y, op);	1305	ms.bot = op;
1485	}	1306	}
1486	else	1307	else
1487	{ /* get inserted into the stack above top */	1308	{ /* get inserted into the stack above top */
1488	op->above = top->above;	1309	op->above = top->above;
1489		1310
…		…
1492		1313
1493	op->below = top;	1314	op->below = top;
1494	top->above = op;	1315	top->above = op;
1495	}	1316	}
1496		1317
1497	if (op->above == NULL)	1318	if (!op->above)
1498	SET_MAP_TOP (op->map, op->x, op->y, op);	1319	ms.top = op;
1499	} /* else not INS_BELOW_ORIGINATOR */	1320	} /* else not INS_BELOW_ORIGINATOR */
1500		1321
1501	if (op->type == PLAYER)	1322	if (op->type == PLAYER)
		1323	{
1502	op->contr->do_los = 1;	1324	op->contr->do_los = 1;
		1325	++op->map->players;
		1326	op->map->touch ();
		1327	}
		1328
		1329	op->map->dirty = true;
1503		1330
1504	/* If we have a floor, we know the player, if any, will be above	1331	/* If we have a floor, we know the player, if any, will be above
1505	* it, so save a few ticks and start from there.	1332	* it, so save a few ticks and start from there.
1506	*/	1333	*/
1507	if (!(flag & INS_MAP_LOAD))	1334	if (!(flag & INS_MAP_LOAD))
1508	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1335	if (object *pl = ms.player ())
1509	if (tmp->type == PLAYER)	1336	if (pl->contr->ns)
1510	tmp->contr->socket.update_look = 1;	1337	pl->contr->ns->floorbox_update ();
1511		1338
1512	/* If this object glows, it may affect lighting conditions that are	1339	/* If this object glows, it may affect lighting conditions that are
1513	* visible to others on this map. But update_all_los is really	1340	* visible to others on this map. But update_all_los is really
1514	* an inefficient way to do this, as it means los for all players	1341	* an inefficient way to do this, as it means los for all players
1515	* on the map will get recalculated. The players could very well	1342	* on the map will get recalculated. The players could very well
1516	* be far away from this change and not affected in any way -	1343	* be far away from this change and not affected in any way -
1517	* this should get redone to only look for players within range,	1344	* this should get redone to only look for players within range,
1518	* or just updating the P_NEED_UPDATE for spaces within this area	1345	* or just updating the P_UPTODATE for spaces within this area
1519	* of effect may be sufficient.	1346	* of effect may be sufficient.
1520	*/	1347	*/
1521	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1348	if (op->map->darkness && (op->glow_radius != 0))
1522	update_all_los (op->map, op->x, op->y);	1349	update_all_los (op->map, op->x, op->y);
1523		1350
1524	/* updates flags (blocked, alive, no magic, etc) for this map space */	1351	/* updates flags (blocked, alive, no magic, etc) for this map space */
1525	update_object (op, UP_OBJ_INSERT);	1352	update_object (op, UP_OBJ_INSERT);
1526		1353
		1354	INVOKE_OBJECT (INSERT, op);
		1355
1527	/* Don't know if moving this to the end will break anything. However,	1356	/* Don't know if moving this to the end will break anything. However,
1528	* we want to have update_look set above before calling this.	1357	* we want to have floorbox_update called before calling this.
1529	*	1358	*
1530	* check_move_on() must be after this because code called from	1359	* check_move_on() must be after this because code called from
1531	* check_move_on() depends on correct map flags (so functions like	1360	* check_move_on() depends on correct map flags (so functions like
1532	* blocked() and wall() work properly), and these flags are updated by	1361	* blocked() and wall() work properly), and these flags are updated by
1533	* update_object().	1362	* update_object().
…		…
1535		1364
1536	/* if this is not the head or flag has been passed, don't check walk on status */	1365	/* if this is not the head or flag has been passed, don't check walk on status */
1537	if (!(flag & INS_NO_WALK_ON) && !op->head)	1366	if (!(flag & INS_NO_WALK_ON) && !op->head)
1538	{	1367	{
1539	if (check_move_on (op, originator))	1368	if (check_move_on (op, originator))
1540	return NULL;	1369	return 0;
1541		1370
1542	/* If we are a multi part object, lets work our way through the check	1371	/* If we are a multi part object, lets work our way through the check
1543	* walk on's.	1372	* walk on's.
1544	*/	1373	*/
1545	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1374	for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1546	if (check_move_on (tmp, originator))	1375	if (check_move_on (tmp, originator))
1547	return NULL;	1376	return 0;
1548	}	1377	}
1549		1378
1550	return op;	1379	return op;
1551	}	1380	}
1552		1381
1553	/* this function inserts an object in the map, but if it	1382	/* this function inserts an object in the map, but if it
1554	* finds an object of its own type, it'll remove that one first.	1383	* finds an object of its own type, it'll remove that one first.
1555	* op is the object to insert it under: supplies x and the map.	1384	* op is the object to insert it under: supplies x and the map.
1556	*/	1385	*/
1557	void	1386	void
1558	replace_insert_ob_in_map (const char *arch_string, object *op)	1387	replace_insert_ob_in_map (const char *arch_string, object *op)
1559	{	1388	{
1560	object *	1389	object *tmp, *tmp1;
1561	tmp;
1562	object *
1563	tmp1;
1564		1390
1565	/* first search for itself and remove any old instances */	1391	/* first search for itself and remove any old instances */
1566		1392
1567	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1393	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1568	{
1569	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1394	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1570	{	1395	tmp->destroy ();
1571	remove_ob (tmp);
1572	free_object (tmp);
1573	}
1574	}
1575		1396
1576	tmp1 = arch_to_object (archetype::find (arch_string));	1397	tmp1 = arch_to_object (archetype::find (arch_string));
1577		1398
1578	tmp1->x = op->x;	1399	tmp1->x = op->x;
1579	tmp1->y = op->y;	1400	tmp1->y = op->y;
1580	insert_ob_in_map (tmp1, op->map, op, 0);	1401	insert_ob_in_map (tmp1, op->map, op, 0);
		1402	}
		1403
		1404	object *
		1405	object::insert_at (object *where, object *originator, int flags)
		1406	{
		1407	where->map->insert (this, where->x, where->y, originator, flags);
1581	}	1408	}
1582		1409
1583	/*	1410	/*
1584	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1411	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1585	* is returned contains nr objects, and the remaining parts contains	1412	* is returned contains nr objects, and the remaining parts contains
1586	* the rest (or is removed and freed if that number is 0).	1413	* the rest (or is removed and freed if that number is 0).
1587	* On failure, NULL is returned, and the reason put into the	1414	* On failure, NULL is returned, and the reason put into the
1588	* global static errmsg array.	1415	* global static errmsg array.
1589	*/	1416	*/
1590
1591	object *	1417	object *
1592	get_split_ob (object *orig_ob, uint32 nr)	1418	get_split_ob (object *orig_ob, uint32 nr)
1593	{	1419	{
1594	object *	1420	object *newob;
1595	newob;
1596	int
1597	is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1421	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1598		1422
1599	if (orig_ob->nrof < nr)	1423	if (orig_ob->nrof < nr)
1600	{	1424	{
1601	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);	1425	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1602	return NULL;	1426	return NULL;
1603	}	1427	}
1604		1428
1605	newob = object_create_clone (orig_ob);	1429	newob = object_create_clone (orig_ob);
1606		1430
1607	if ((orig_ob->nrof -= nr) < 1)	1431	if ((orig_ob->nrof -= nr) < 1)
1608	{	1432	orig_ob->destroy (1);
1609	if (!is_removed)
1610	remove_ob (orig_ob);
1611	free_object2 (orig_ob, 1);
1612	}
1613	else if (!is_removed)	1433	else if (!is_removed)
1614	{	1434	{
1615	if (orig_ob->env != NULL)	1435	if (orig_ob->env != NULL)
1616	sub_weight (orig_ob->env, orig_ob->weight * nr);	1436	sub_weight (orig_ob->env, orig_ob->weight * nr);
1617	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)	1437	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
…		…
1637		1457
1638	object *	1458	object *
1639	decrease_ob_nr (object *op, uint32 i)	1459	decrease_ob_nr (object *op, uint32 i)
1640	{	1460	{
1641	object *tmp;	1461	object *tmp;
1642	player *pl;
1643		1462
1644	if (i == 0) /* objects with op->nrof require this check */	1463	if (i == 0) /* objects with op->nrof require this check */
1645	return op;	1464	return op;
1646		1465
1647	if (i > op->nrof)	1466	if (i > op->nrof)
1648	i = op->nrof;	1467	i = op->nrof;
1649		1468
1650	if (QUERY_FLAG (op, FLAG_REMOVED))	1469	if (QUERY_FLAG (op, FLAG_REMOVED))
1651	op->nrof -= i;	1470	op->nrof -= i;
1652	else if (op->env != NULL)	1471	else if (op->env)
1653	{	1472	{
1654	/* is this object in the players inventory, or sub container	1473	/* is this object in the players inventory, or sub container
1655	* therein?	1474	* therein?
1656	*/	1475	*/
1657	tmp = is_player_inv (op->env);	1476	tmp = op->in_player ();
1658	/* nope. Is this a container the player has opened?	1477	/* nope. Is this a container the player has opened?
1659	* If so, set tmp to that player.	1478	* If so, set tmp to that player.
1660	* IMO, searching through all the players will mostly	1479	* IMO, searching through all the players will mostly
1661	* likely be quicker than following op->env to the map,	1480	* likely be quicker than following op->env to the map,
1662	* and then searching the map for a player.	1481	* and then searching the map for a player.
1663	*/	1482	*/
1664	if (!tmp)	1483	if (!tmp)
1665	{	1484	for_all_players (pl)
1666	for (pl = first_player; pl; pl = pl->next)
1667	if (pl->ob->container == op->env)	1485	if (pl->ob->container == op->env)
		1486	{
		1487	tmp = pl->ob;
1668	break;	1488	break;
1669	if (pl)
1670	tmp = pl->ob;
1671	else
1672	tmp = NULL;
1673	}	1489	}
1674		1490
1675	if (i < op->nrof)	1491	if (i < op->nrof)
1676	{	1492	{
1677	sub_weight (op->env, op->weight * i);	1493	sub_weight (op->env, op->weight * i);
1678	op->nrof -= i;	1494	op->nrof -= i;
1679	if (tmp)	1495	if (tmp)
1680	{
1681	esrv_send_item (tmp, op);	1496	esrv_send_item (tmp, op);
1682	}
1683	}	1497	}
1684	else	1498	else
1685	{	1499	{
1686	remove_ob (op);	1500	op->remove ();
1687	op->nrof = 0;	1501	op->nrof = 0;
1688	if (tmp)	1502	if (tmp)
1689	{
1690	esrv_del_item (tmp->contr, op->count);	1503	esrv_del_item (tmp->contr, op->count);
1691	}
1692	}	1504	}
1693	}	1505	}
1694	else	1506	else
1695	{	1507	{
1696	object *above = op->above;	1508	object *above = op->above;
1697		1509
1698	if (i < op->nrof)	1510	if (i < op->nrof)
1699	op->nrof -= i;	1511	op->nrof -= i;
1700	else	1512	else
1701	{	1513	{
1702	remove_ob (op);	1514	op->remove ();
1703	op->nrof = 0;	1515	op->nrof = 0;
1704	}	1516	}
1705		1517
1706	/* Since we just removed op, op->above is null */	1518	/* Since we just removed op, op->above is null */
1707	for (tmp = above; tmp != NULL; tmp = tmp->above)	1519	for (tmp = above; tmp; tmp = tmp->above)
1708	if (tmp->type == PLAYER)	1520	if (tmp->type == PLAYER)
1709	{	1521	{
1710	if (op->nrof)	1522	if (op->nrof)
1711	esrv_send_item (tmp, op);	1523	esrv_send_item (tmp, op);
1712	else	1524	else
…		…
1716		1528
1717	if (op->nrof)	1529	if (op->nrof)
1718	return op;	1530	return op;
1719	else	1531	else
1720	{	1532	{
1721	free_object (op);	1533	op->destroy ();
1722	return NULL;	1534	return 0;
1723	}	1535	}
1724	}	1536	}
1725		1537
1726	/*	1538	/*
1727	* add_weight(object, weight) adds the specified weight to an object,	1539	* add_weight(object, weight) adds the specified weight to an object,
…		…
1739	op->carrying += weight;	1551	op->carrying += weight;
1740	op = op->env;	1552	op = op->env;
1741	}	1553	}
1742	}	1554	}
1743		1555
1744	/*
1745	* insert_ob_in_ob(op,environment):
1746	* This function inserts the object op in the linked list
1747	* inside the object environment.
1748	*
1749	* Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter
1750	* the inventory at the last position or next to other objects of the same
1751	* type.
1752	* Frank: Now sorted by type, archetype and magic!
1753	*
1754	* The function returns now pointer to inserted item, and return value can
1755	* be != op, if items are merged. -Tero
1756	*/
1757
1758	object *	1556	object *
1759	insert_ob_in_ob (object *op, object *where)	1557	insert_ob_in_ob (object *op, object *where)
1760	{	1558	{
1761	object *	1559	if (!where)
1762	tmp, *
1763	otmp;
1764
1765	if (!QUERY_FLAG (op, FLAG_REMOVED))
1766	{
1767	char *dump = dump_object (op);
1768	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump);
1769	free (dump);
1770	return op;
1771	}
1772
1773	if (where == NULL)
1774	{	1560	{
1775	char *dump = dump_object (op);	1561	char *dump = dump_object (op);
1776	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1562	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1777	free (dump);	1563	free (dump);
1778	return op;	1564	return op;
1779	}	1565	}
1780		1566
1781	if (where->head)	1567	if (where->head)
1782	{	1568	{
1783	LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");	1569	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");
1784	where = where->head;	1570	where = where->head;
1785	}	1571	}
		1572
		1573	return where->insert (op);
		1574	}
		1575
		1576	/*
		1577	* env->insert (op)
		1578	* This function inserts the object op in the linked list
		1579	* inside the object environment.
		1580	*
		1581	* The function returns now pointer to inserted item, and return value can
		1582	* be != op, if items are merged. -Tero
		1583	*/
		1584
		1585	object *
		1586	object::insert (object *op)
		1587	{
		1588	object *tmp, *otmp;
		1589
		1590	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1591	op->remove ();
1786		1592
1787	if (op->more)	1593	if (op->more)
1788	{	1594	{
1789	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1595	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1790	return op;	1596	return op;
…		…
1792		1598
1793	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1599	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1794	CLEAR_FLAG (op, FLAG_REMOVED);	1600	CLEAR_FLAG (op, FLAG_REMOVED);
1795	if (op->nrof)	1601	if (op->nrof)
1796	{	1602	{
1797	for (tmp = where->inv; tmp != NULL; tmp = tmp->below)	1603	for (tmp = inv; tmp != NULL; tmp = tmp->below)
1798	if (CAN_MERGE (tmp, op))	1604	if (object::can_merge (tmp, op))
1799	{	1605	{
1800	/* return the original object and remove inserted object	1606	/* return the original object and remove inserted object
1801	(client needs the original object) */	1607	(client needs the original object) */
1802	tmp->nrof += op->nrof;	1608	tmp->nrof += op->nrof;
1803	/* Weight handling gets pretty funky. Since we are adding to	1609	/* Weight handling gets pretty funky. Since we are adding to
1804	* tmp->nrof, we need to increase the weight.	1610	* tmp->nrof, we need to increase the weight.
1805	*/	1611	*/
1806	add_weight (where, op->weight * op->nrof);	1612	add_weight (this, op->weight * op->nrof);
1807	SET_FLAG (op, FLAG_REMOVED);	1613	SET_FLAG (op, FLAG_REMOVED);
1808	free_object (op); /* free the inserted object */	1614	op->destroy (); /* free the inserted object */
1809	op = tmp;	1615	op = tmp;
1810	remove_ob (op); /* and fix old object's links */	1616	op->remove (); /* and fix old object's links */
1811	CLEAR_FLAG (op, FLAG_REMOVED);	1617	CLEAR_FLAG (op, FLAG_REMOVED);
1812	break;	1618	break;
1813	}	1619	}
1814		1620
1815	/* I assume combined objects have no inventory	1621	/* I assume combined objects have no inventory
1816	* We add the weight - this object could have just been removed	1622	* We add the weight - this object could have just been removed
1817	* (if it was possible to merge). calling remove_ob will subtract	1623	* (if it was possible to merge). calling remove_ob will subtract
1818	* the weight, so we need to add it in again, since we actually do	1624	* the weight, so we need to add it in again, since we actually do
1819	* the linking below	1625	* the linking below
1820	*/	1626	*/
1821	add_weight (where, op->weight * op->nrof);	1627	add_weight (this, op->weight * op->nrof);
1822	}	1628	}
1823	else	1629	else
1824	add_weight (where, (op->weight + op->carrying));	1630	add_weight (this, (op->weight + op->carrying));
1825		1631
1826	otmp = is_player_inv (where);	1632	otmp = this->in_player ();
1827	if (otmp && otmp->contr != NULL)	1633	if (otmp && otmp->contr)
1828	{
1829	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1634	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1830	fix_player (otmp);	1635	otmp->update_stats ();
1831	}
1832		1636
1833	op->map = NULL;	1637	op->map = 0;
1834	op->env = where;	1638	op->env = this;
1835	op->above = NULL;	1639	op->above = 0;
1836	op->below = NULL;	1640	op->below = 0;
1837	op->x = 0, op->y = 0;	1641	op->x = 0, op->y = 0;
1838		1642
1839	/* reset the light list and los of the players on the map */	1643	/* reset the light list and los of the players on the map */
1840	if ((op->glow_radius != 0) && where->map)	1644	if ((op->glow_radius != 0) && map)
1841	{	1645	{
1842	#ifdef DEBUG_LIGHTS	1646	#ifdef DEBUG_LIGHTS
1843	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1647	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1844	#endif /* DEBUG_LIGHTS */	1648	#endif /* DEBUG_LIGHTS */
1845	if (MAP_DARKNESS (where->map))	1649	if (map->darkness)
1846	update_all_los (where->map, where->x, where->y);	1650	update_all_los (map, x, y);
1847	}	1651	}
1848		1652
1849	/* Client has no idea of ordering so lets not bother ordering it here.	1653	/* Client has no idea of ordering so lets not bother ordering it here.
1850	* It sure simplifies this function...	1654	* It sure simplifies this function...
1851	*/	1655	*/
1852	if (where->inv == NULL)	1656	if (!inv)
1853	where->inv = op;	1657	inv = op;
1854	else	1658	else
1855	{	1659	{
1856	op->below = where->inv;	1660	op->below = inv;
1857	op->below->above = op;	1661	op->below->above = op;
1858	where->inv = op;	1662	inv = op;
1859	}	1663	}
		1664
		1665	INVOKE_OBJECT (INSERT, this);
		1666
1860	return op;	1667	return op;
1861	}	1668	}
1862		1669
1863	/*	1670	/*
1864	* Checks if any objects has a move_type that matches objects	1671	* Checks if any objects has a move_type that matches objects
…		…
1878	*	1685	*
1879	* MSW 2001-07-08: Check all objects on space, not just those below	1686	* MSW 2001-07-08: Check all objects on space, not just those below
1880	* object being inserted. insert_ob_in_map may not put new objects	1687	* object being inserted. insert_ob_in_map may not put new objects
1881	* on top.	1688	* on top.
1882	*/	1689	*/
1883
1884	int	1690	int
1885	check_move_on (object *op, object *originator)	1691	check_move_on (object *op, object *originator)
1886	{	1692	{
1887	object *tmp;	1693	object *tmp;
1888	maptile *m = op->map;	1694	maptile *m = op->map;
…		…
1915		1721
1916	/* The objects have to be checked from top to bottom.	1722	/* The objects have to be checked from top to bottom.
1917	* Hence, we first go to the top:	1723	* Hence, we first go to the top:
1918	*/	1724	*/
1919		1725
1920	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1726	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1921	{	1727	{
1922	/* Trim the search when we find the first other spell effect	1728	/* Trim the search when we find the first other spell effect
1923	* this helps performance so that if a space has 50 spell objects,	1729	* this helps performance so that if a space has 50 spell objects,
1924	* we don't need to check all of them.	1730	* we don't need to check all of them.
1925	*/	1731	*/
…		…
1943	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1749	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1944	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1750	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1945	{	1751	{
1946		1752
1947	float	1753	float
1948	diff = tmp->move_slow_penalty * FABS (op->speed);	1754	diff = tmp->move_slow_penalty * fabs (op->speed);
1949		1755
1950	if (op->type == PLAYER)	1756	if (op->type == PLAYER)
1951	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||	1757	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1952	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1758	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1953	diff /= 4.0;	1759	diff /= 4.0;
…		…
1980	/*	1786	/*
1981	* present_arch(arch, map, x, y) searches for any objects with	1787	* present_arch(arch, map, x, y) searches for any objects with
1982	* a matching archetype at the given map and coordinates.	1788	* a matching archetype at the given map and coordinates.
1983	* The first matching object is returned, or NULL if none.	1789	* The first matching object is returned, or NULL if none.
1984	*/	1790	*/
1985
1986	object *	1791	object *
1987	present_arch (const archetype *at, maptile *m, int x, int y)	1792	present_arch (const archetype *at, maptile *m, int x, int y)
1988	{	1793	{
1989	object *
1990	tmp;
1991
1992	if (m == NULL || out_of_map (m, x, y))	1794	if (!m || out_of_map (m, x, y))
1993	{	1795	{
1994	LOG (llevError, "Present_arch called outside map.\n");	1796	LOG (llevError, "Present_arch called outside map.\n");
1995	return NULL;	1797	return NULL;
1996	}	1798	}
1997	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1799
		1800	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1998	if (tmp->arch == at)	1801	if (tmp->arch == at)
1999	return tmp;	1802	return tmp;
		1803
2000	return NULL;	1804	return NULL;
2001	}	1805	}
2002		1806
2003	/*	1807	/*
2004	* present(type, map, x, y) searches for any objects with	1808	* present(type, map, x, y) searches for any objects with
2005	* a matching type variable at the given map and coordinates.	1809	* a matching type variable at the given map and coordinates.
2006	* The first matching object is returned, or NULL if none.	1810	* The first matching object is returned, or NULL if none.
2007	*/	1811	*/
2008
2009	object *	1812	object *
2010	present (unsigned char type, maptile *m, int x, int y)	1813	present (unsigned char type, maptile *m, int x, int y)
2011	{	1814	{
2012	object *
2013	tmp;
2014
2015	if (out_of_map (m, x, y))	1815	if (out_of_map (m, x, y))
2016	{	1816	{
2017	LOG (llevError, "Present called outside map.\n");	1817	LOG (llevError, "Present called outside map.\n");
2018	return NULL;	1818	return NULL;
2019	}	1819	}
2020	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1820
		1821	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
2021	if (tmp->type == type)	1822	if (tmp->type == type)
2022	return tmp;	1823	return tmp;
		1824
2023	return NULL;	1825	return NULL;
2024	}	1826	}
2025		1827
2026	/*	1828	/*
2027	* present_in_ob(type, object) searches for any objects with	1829	* present_in_ob(type, object) searches for any objects with
2028	* a matching type variable in the inventory of the given object.	1830	* a matching type variable in the inventory of the given object.
2029	* The first matching object is returned, or NULL if none.	1831	* The first matching object is returned, or NULL if none.
2030	*/	1832	*/
2031
2032	object *	1833	object *
2033	present_in_ob (unsigned char type, const object *op)	1834	present_in_ob (unsigned char type, const object *op)
2034	{	1835	{
2035	object *
2036	tmp;
2037
2038	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1836	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2039	if (tmp->type == type)	1837	if (tmp->type == type)
2040	return tmp;	1838	return tmp;
		1839
2041	return NULL;	1840	return NULL;
2042	}	1841	}
2043		1842
2044	/*	1843	/*
2045	* present_in_ob (type, str, object) searches for any objects with	1844	* present_in_ob (type, str, object) searches for any objects with
…		…
2053	* str is the string to match against. Note that we match against	1852	* str is the string to match against. Note that we match against
2054	* the object name, not the archetype name. this is so that the	1853	* the object name, not the archetype name. this is so that the
2055	* spell code can use one object type (force), but change it's name	1854	* spell code can use one object type (force), but change it's name
2056	* to be unique.	1855	* to be unique.
2057	*/	1856	*/
2058
2059	object *	1857	object *
2060	present_in_ob_by_name (int type, const char *str, const object *op)	1858	present_in_ob_by_name (int type, const char *str, const object *op)
2061	{	1859	{
2062	object *
2063	tmp;
2064
2065	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1860	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2066	{
2067	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1861	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2068	return tmp;	1862	return tmp;
2069	}	1863
2070	return NULL;	1864	return 0;
2071	}	1865	}
2072		1866
2073	/*	1867	/*
2074	* present_arch_in_ob(archetype, object) searches for any objects with	1868	* present_arch_in_ob(archetype, object) searches for any objects with
2075	* a matching archetype in the inventory of the given object.	1869	* a matching archetype in the inventory of the given object.
2076	* The first matching object is returned, or NULL if none.	1870	* The first matching object is returned, or NULL if none.
2077	*/	1871	*/
2078
2079	object *	1872	object *
2080	present_arch_in_ob (const archetype *at, const object *op)	1873	present_arch_in_ob (const archetype *at, const object *op)
2081	{	1874	{
2082	object *
2083	tmp;
2084
2085	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1875	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2086	if (tmp->arch == at)	1876	if (tmp->arch == at)
2087	return tmp;	1877	return tmp;
		1878
2088	return NULL;	1879	return NULL;
2089	}	1880	}
2090		1881
2091	/*	1882	/*
2092	* activate recursively a flag on an object inventory	1883	* activate recursively a flag on an object inventory
2093	*/	1884	*/
2094	void	1885	void
2095	flag_inv (object *op, int flag)	1886	flag_inv (object *op, int flag)
2096	{	1887	{
2097	object *
2098	tmp;
2099
2100	if (op->inv)	1888	if (op->inv)
2101	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1889	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2102	{	1890	{
2103	SET_FLAG (tmp, flag);	1891	SET_FLAG (tmp, flag);
2104	flag_inv (tmp, flag);	1892	flag_inv (tmp, flag);
2105	}	1893	}
2106	} /*	1894	}
		1895
		1896	/*
2107	* desactivate recursively a flag on an object inventory	1897	* deactivate recursively a flag on an object inventory
2108	*/	1898	*/
2109	void	1899	void
2110	unflag_inv (object *op, int flag)	1900	unflag_inv (object *op, int flag)
2111	{	1901	{
2112	object *
2113	tmp;
2114
2115	if (op->inv)	1902	if (op->inv)
2116	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1903	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2117	{	1904	{
2118	CLEAR_FLAG (tmp, flag);	1905	CLEAR_FLAG (tmp, flag);
2119	unflag_inv (tmp, flag);	1906	unflag_inv (tmp, flag);
2120	}	1907	}
2121	}	1908	}
…		…
2124	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in	1911	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2125	* all it's inventory (recursively).	1912	* all it's inventory (recursively).
2126	* If checksums are used, a player will get set_cheat called for	1913	* If checksums are used, a player will get set_cheat called for
2127	* him/her-self and all object carried by a call to this function.	1914	* him/her-self and all object carried by a call to this function.
2128	*/	1915	*/
2129
2130	void	1916	void
2131	set_cheat (object *op)	1917	set_cheat (object *op)
2132	{	1918	{
2133	SET_FLAG (op, FLAG_WAS_WIZ);	1919	SET_FLAG (op, FLAG_WAS_WIZ);
2134	flag_inv (op, FLAG_WAS_WIZ);	1920	flag_inv (op, FLAG_WAS_WIZ);
…		…
2153	* because arch_blocked (now ob_blocked) needs to know the movement type	1939	* because arch_blocked (now ob_blocked) needs to know the movement type
2154	* to know if the space in question will block the object. We can't use	1940	* to know if the space in question will block the object. We can't use
2155	* the archetype because that isn't correct if the monster has been	1941	* the archetype because that isn't correct if the monster has been
2156	* customized, changed states, etc.	1942	* customized, changed states, etc.
2157	*/	1943	*/
2158
2159	int	1944	int
2160	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1945	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2161	{	1946	{
2162	int
2163	i,
2164	index = 0, flag;	1947	int index = 0, flag;
2165	static int
2166	altern[SIZEOFFREE];	1948	int altern[SIZEOFFREE];
2167		1949
2168	for (i = start; i < stop; i++)	1950	for (int i = start; i < stop; i++)
2169	{	1951	{
2170	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1952	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2171	if (!flag)	1953	if (!flag)
2172	altern[index++] = i;	1954	altern [index++] = i;
2173		1955
2174	/* Basically, if we find a wall on a space, we cut down the search size.	1956	/* Basically, if we find a wall on a space, we cut down the search size.
2175	* In this way, we won't return spaces that are on another side of a wall.	1957	* In this way, we won't return spaces that are on another side of a wall.
2176	* This mostly work, but it cuts down the search size in all directions -	1958	* This mostly work, but it cuts down the search size in all directions -
2177	* if the space being examined only has a wall to the north and empty	1959	* if the space being examined only has a wall to the north and empty
2178	* spaces in all the other directions, this will reduce the search space	1960	* spaces in all the other directions, this will reduce the search space
2179	* to only the spaces immediately surrounding the target area, and	1961	* to only the spaces immediately surrounding the target area, and
2180	* won't look 2 spaces south of the target space.	1962	* won't look 2 spaces south of the target space.
2181	*/	1963	*/
2182	else if ((flag & AB_NO_PASS) && maxfree[i] < stop)	1964	else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2183	stop = maxfree[i];	1965	stop = maxfree[i];
2184	}	1966	}
		1967
2185	if (!index)	1968	if (!index)
2186	return -1;	1969	return -1;
		1970
2187	return altern[RANDOM () % index];	1971	return altern[RANDOM () % index];
2188	}	1972	}
2189		1973
2190	/*	1974	/*
2191	* find_first_free_spot(archetype, maptile, x, y) works like	1975	* find_first_free_spot(archetype, maptile, x, y) works like
2192	* find_free_spot(), but it will search max number of squares.	1976	* find_free_spot(), but it will search max number of squares.
2193	* But it will return the first available spot, not a random choice.	1977	* But it will return the first available spot, not a random choice.
2194	* Changed 0.93.2: Have it return -1 if there is no free spot available.	1978	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2195	*/	1979	*/
2196
2197	int	1980	int
2198	find_first_free_spot (const object *ob, maptile *m, int x, int y)	1981	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2199	{	1982	{
2200	int
2201	i;
2202
2203	for (i = 0; i < SIZEOFFREE; i++)	1983	for (int i = 0; i < SIZEOFFREE; i++)
2204	{
2205	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	1984	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2206	return i;	1985	return i;
2207	}	1986
2208	return -1;	1987	return -1;
2209	}	1988	}
2210		1989
2211	/*	1990	/*
2212	* The function permute(arr, begin, end) randomly reorders the array	1991	* The function permute(arr, begin, end) randomly reorders the array
2213	* arr[begin..end-1].	1992	* arr[begin..end-1].
		1993	* now uses a fisher-yates shuffle, old permute was broken
2214	*/	1994	*/
2215	static void	1995	static void
2216	permute (int *arr, int begin, int end)	1996	permute (int *arr, int begin, int end)
2217	{	1997	{
2218	int	1998	arr += begin;
2219	i,
2220	j,
2221	tmp,
2222	len;
2223
2224	len = end - begin;	1999	end -= begin;
2225	for (i = begin; i < end; i++)
2226	{
2227	j = begin + RANDOM () % len;
2228		2000
2229	tmp = arr[i];	2001	while (--end)
2230	arr[i] = arr[j];	2002	swap (arr [end], arr [RANDOM () % (end + 1)]);
2231	arr[j] = tmp;
2232	}
2233	}	2003	}
2234		2004
2235	/* new function to make monster searching more efficient, and effective!	2005	/* new function to make monster searching more efficient, and effective!
2236	* This basically returns a randomized array (in the passed pointer) of	2006	* This basically returns a randomized array (in the passed pointer) of
2237	* the spaces to find monsters. In this way, it won't always look for	2007	* the spaces to find monsters. In this way, it won't always look for
…		…
2240	* the 3x3 area will be searched, just not in a predictable order.	2010	* the 3x3 area will be searched, just not in a predictable order.
2241	*/	2011	*/
2242	void	2012	void
2243	get_search_arr (int *search_arr)	2013	get_search_arr (int *search_arr)
2244	{	2014	{
2245	int	2015	int i;
2246	i;
2247		2016
2248	for (i = 0; i < SIZEOFFREE; i++)	2017	for (i = 0; i < SIZEOFFREE; i++)
2249	{
2250	search_arr[i] = i;	2018	search_arr[i] = i;
2251	}
2252		2019
2253	permute (search_arr, 1, SIZEOFFREE1 + 1);	2020	permute (search_arr, 1, SIZEOFFREE1 + 1);
2254	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2021	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2255	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2022	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2256	}	2023	}
…		…
2265	* Perhaps incorrectly, but I'm making the assumption that exclude	2032	* Perhaps incorrectly, but I'm making the assumption that exclude
2266	* is actually want is going to try and move there. We need this info	2033	* is actually want is going to try and move there. We need this info
2267	* because we have to know what movement the thing looking to move	2034	* because we have to know what movement the thing looking to move
2268	* there is capable of.	2035	* there is capable of.
2269	*/	2036	*/
2270
2271	int	2037	int
2272	find_dir (maptile *m, int x, int y, object *exclude)	2038	find_dir (maptile *m, int x, int y, object *exclude)
2273	{	2039	{
2274	int
2275	i,
2276	max = SIZEOFFREE, mflags;	2040	int i, max = SIZEOFFREE, mflags;
2277		2041
2278	sint16 nx, ny;	2042	sint16 nx, ny;
2279	object *	2043	object *tmp;
2280	tmp;
2281	maptile *	2044	maptile *mp;
2282	mp;
2283		2045
2284	MoveType blocked, move_type;	2046	MoveType blocked, move_type;
2285		2047
2286	if (exclude && exclude->head)	2048	if (exclude && exclude->head)
2287	{	2049	{
…		…
2299	mp = m;	2061	mp = m;
2300	nx = x + freearr_x[i];	2062	nx = x + freearr_x[i];
2301	ny = y + freearr_y[i];	2063	ny = y + freearr_y[i];
2302		2064
2303	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2065	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2066
2304	if (mflags & P_OUT_OF_MAP)	2067	if (mflags & P_OUT_OF_MAP)
2305	{
2306	max = maxfree[i];	2068	max = maxfree[i];
2307	}
2308	else	2069	else
2309	{	2070	{
2310	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2071	mapspace &ms = mp->at (nx, ny);
		2072
		2073	blocked = ms.move_block;
2311		2074
2312	if ((move_type & blocked) == move_type)	2075	if ((move_type & blocked) == move_type)
2313	{
2314	max = maxfree[i];	2076	max = maxfree[i];
2315	}
2316	else if (mflags & P_IS_ALIVE)	2077	else if (mflags & P_IS_ALIVE)
2317	{	2078	{
2318	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2079	for (tmp = ms.bot; tmp; tmp = tmp->above)
2319	{	2080	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2320	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2081	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))
2321	{
2322	break;	2082	break;
2323	}	2083
2324	}
2325	if (tmp)	2084	if (tmp)
2326	{
2327	return freedir[i];	2085	return freedir[i];
2328	}
2329	}	2086	}
2330	}	2087	}
2331	}	2088	}
		2089
2332	return 0;	2090	return 0;
2333	}	2091	}
2334		2092
2335	/*	2093	/*
2336	* distance(object 1, object 2) will return the square of the	2094	* distance(object 1, object 2) will return the square of the
2337	* distance between the two given objects.	2095	* distance between the two given objects.
2338	*/	2096	*/
2339
2340	int	2097	int
2341	distance (const object *ob1, const object *ob2)	2098	distance (const object *ob1, const object *ob2)
2342	{	2099	{
2343	int
2344	i;
2345
2346	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2100	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2347	return i;
2348	}	2101	}
2349		2102
2350	/*	2103	/*
2351	* find_dir_2(delta-x,delta-y) will return a direction in which	2104	* find_dir_2(delta-x,delta-y) will return a direction in which
2352	* an object which has subtracted the x and y coordinates of another	2105	* an object which has subtracted the x and y coordinates of another
2353	* object, needs to travel toward it.	2106	* object, needs to travel toward it.
2354	*/	2107	*/
2355
2356	int	2108	int
2357	find_dir_2 (int x, int y)	2109	find_dir_2 (int x, int y)
2358	{	2110	{
2359	int	2111	int q;
2360	q;
2361		2112
2362	if (y)	2113	if (y)
2363	q = x * 100 / y;	2114	q = x * 100 / y;
2364	else if (x)	2115	else if (x)
2365	q = -300 * x;	2116	q = -300 * x;
…		…
2390		2141
2391	return 3;	2142	return 3;
2392	}	2143	}
2393		2144
2394	/*	2145	/*
2395	* absdir(int): Returns a number between 1 and 8, which represent
2396	* the "absolute" direction of a number (it actually takes care of
2397	* "overflow" in previous calculations of a direction).
2398	*/
2399
2400	int
2401	absdir (int d)
2402	{
2403	while (d < 1)
2404	d += 8;
2405	while (d > 8)
2406	d -= 8;
2407	return d;
2408	}
2409
2410	/*
2411	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2146	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2412	* between two directions (which are expected to be absolute (see absdir())	2147	* between two directions (which are expected to be absolute (see absdir())
2413	*/	2148	*/
2414
2415	int	2149	int
2416	dirdiff (int dir1, int dir2)	2150	dirdiff (int dir1, int dir2)
2417	{	2151	{
2418	int	2152	int d;
2419	d;
2420		2153
2421	d = abs (dir1 - dir2);	2154	d = abs (dir1 - dir2);
2422	if (d > 4)	2155	if (d > 4)
2423	d = 8 - d;	2156	d = 8 - d;
		2157
2424	return d;	2158	return d;
2425	}	2159	}
2426		2160
2427	/* peterm:	2161	/* peterm:
2428	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2162	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2431	* This basically means that if direction is 15, then it could either go	2165	* This basically means that if direction is 15, then it could either go
2432	* direction 4, 14, or 16 to get back to where we are.	2166	* direction 4, 14, or 16 to get back to where we are.
2433	* Moved from spell_util.c to object.c with the other related direction	2167	* Moved from spell_util.c to object.c with the other related direction
2434	* functions.	2168	* functions.
2435	*/	2169	*/
2436
2437	int
2438	reduction_dir[SIZEOFFREE][3] = {	2170	int reduction_dir[SIZEOFFREE][3] = {
2439	{0, 0, 0}, /* 0 */	2171	{0, 0, 0}, /* 0 */
2440	{0, 0, 0}, /* 1 */	2172	{0, 0, 0}, /* 1 */
2441	{0, 0, 0}, /* 2 */	2173	{0, 0, 0}, /* 2 */
2442	{0, 0, 0}, /* 3 */	2174	{0, 0, 0}, /* 3 */
2443	{0, 0, 0}, /* 4 */	2175	{0, 0, 0}, /* 4 */
…		…
2491	* find a path to that monster that we found. If not,	2223	* find a path to that monster that we found. If not,
2492	* we don't bother going toward it. Returns 1 if we	2224	* we don't bother going toward it. Returns 1 if we
2493	* can see a direct way to get it	2225	* can see a direct way to get it
2494	* Modified to be map tile aware -.MSW	2226	* Modified to be map tile aware -.MSW
2495	*/	2227	*/
2496
2497
2498	int	2228	int
2499	can_see_monsterP (maptile *m, int x, int y, int dir)	2229	can_see_monsterP (maptile *m, int x, int y, int dir)
2500	{	2230	{
2501	sint16 dx, dy;	2231	sint16 dx, dy;
2502	int
2503	mflags;	2232	int mflags;
2504		2233
2505	if (dir < 0)	2234	if (dir < 0)
2506	return 0; /* exit condition: invalid direction */	2235	return 0; /* exit condition: invalid direction */
2507		2236
2508	dx = x + freearr_x[dir];	2237	dx = x + freearr_x[dir];
…		…
2521	return 0;	2250	return 0;
2522		2251
2523	/* yes, can see. */	2252	/* yes, can see. */
2524	if (dir < 9)	2253	if (dir < 9)
2525	return 1;	2254	return 1;
		2255
2526	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2256	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2527	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2257	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2258	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2528	}	2259	}
2529
2530
2531		2260
2532	/*	2261	/*
2533	* can_pick(picker, item): finds out if an object is possible to be	2262	* can_pick(picker, item): finds out if an object is possible to be
2534	* picked up by the picker. Returnes 1 if it can be	2263	* picked up by the picker. Returnes 1 if it can be
2535	* picked up, otherwise 0.	2264	* picked up, otherwise 0.
…		…
2546	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2275	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2547	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2276	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2548	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2277	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2549	}	2278	}
2550		2279
2551
2552	/*	2280	/*
2553	* create clone from object to another	2281	* create clone from object to another
2554	*/	2282	*/
2555	object *	2283	object *
2556	object_create_clone (object *asrc)	2284	object_create_clone (object *asrc)
2557	{	2285	{
2558	object *
2559	dst = NULL, *tmp, *src, *part, *prev, *item;	2286	object *dst = 0, *tmp, *src, *part, *prev, *item;
2560		2287
2561	if (!asrc)	2288	if (!asrc)
2562	return NULL;	2289	return 0;
		2290
2563	src = asrc;	2291	src = asrc;
2564	if (src->head)	2292	if (src->head)
2565	src = src->head;	2293	src = src->head;
2566		2294
2567	prev = NULL;	2295	prev = 0;
2568	for (part = src; part; part = part->more)	2296	for (part = src; part; part = part->more)
2569	{	2297	{
2570	tmp = get_object ();	2298	tmp = part->clone ();
2571	copy_object (part, tmp);
2572	tmp->x -= src->x;	2299	tmp->x -= src->x;
2573	tmp->y -= src->y;	2300	tmp->y -= src->y;
		2301
2574	if (!part->head)	2302	if (!part->head)
2575	{	2303	{
2576	dst = tmp;	2304	dst = tmp;
2577	tmp->head = NULL;	2305	tmp->head = 0;
2578	}	2306	}
2579	else	2307	else
2580	{
2581	tmp->head = dst;	2308	tmp->head = dst;
2582	}	2309
2583	tmp->more = NULL;	2310	tmp->more = 0;
		2311
2584	if (prev)	2312	if (prev)
2585	prev->more = tmp;	2313	prev->more = tmp;
		2314
2586	prev = tmp;	2315	prev = tmp;
2587	}	2316	}
2588		2317
2589	for (item = src->inv; item; item = item->below)	2318	for (item = src->inv; item; item = item->below)
2590	insert_ob_in_ob (object_create_clone (item), dst);	2319	insert_ob_in_ob (object_create_clone (item), dst);
…		…
2596	/* Basically, we save the content of the string to a temp file, then call */	2325	/* Basically, we save the content of the string to a temp file, then call */
2597	/* load_object on it. I admit it is a highly inefficient way to make things, */	2326	/* load_object on it. I admit it is a highly inefficient way to make things, */
2598	/* but it was simple to make and allows reusing the load_object function. */	2327	/* but it was simple to make and allows reusing the load_object function. */
2599	/* Remember not to use load_object_str in a time-critical situation. */	2328	/* Remember not to use load_object_str in a time-critical situation. */
2600	/* Also remember that multiparts objects are not supported for now. */	2329	/* Also remember that multiparts objects are not supported for now. */
2601
2602	object *	2330	object *
2603	load_object_str (const char *obstr)	2331	load_object_str (const char *obstr)
2604	{	2332	{
2605	object *op;	2333	object *op;
2606	char filename[MAX_BUF];	2334	char filename[MAX_BUF];
…		…
2616	}	2344	}
2617		2345
2618	fprintf (tempfile, obstr);	2346	fprintf (tempfile, obstr);
2619	fclose (tempfile);	2347	fclose (tempfile);
2620		2348
2621	op = get_object ();	2349	op = object::create ();
2622		2350
2623	object_thawer thawer (filename);	2351	object_thawer thawer (filename);
2624		2352
2625	if (thawer)	2353	if (thawer)
2626	load_object (thawer, op, 0);	2354	load_object (thawer, op, 0);
…		…
2636	* returns NULL if no match.	2364	* returns NULL if no match.
2637	*/	2365	*/
2638	object *	2366	object *
2639	find_obj_by_type_subtype (const object *who, int type, int subtype)	2367	find_obj_by_type_subtype (const object *who, int type, int subtype)
2640	{	2368	{
2641	object *tmp;
2642
2643	for (tmp = who->inv; tmp; tmp = tmp->below)	2369	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2644	if (tmp->type == type && tmp->subtype == subtype)	2370	if (tmp->type == type && tmp->subtype == subtype)
2645	return tmp;	2371	return tmp;
2646		2372
2647	return NULL;	2373	return 0;
2648	}	2374	}
2649		2375
2650	/* If ob has a field named key, return the link from the list,	2376	/* If ob has a field named key, return the link from the list,
2651	* otherwise return NULL.	2377	* otherwise return NULL.
2652	*	2378	*
…		…
2654	* do the desired thing.	2380	* do the desired thing.
2655	*/	2381	*/
2656	key_value *	2382	key_value *
2657	get_ob_key_link (const object *ob, const char *key)	2383	get_ob_key_link (const object *ob, const char *key)
2658	{	2384	{
2659	key_value *link;
2660
2661	for (link = ob->key_values; link != NULL; link = link->next)	2385	for (key_value *link = ob->key_values; link; link = link->next)
2662	if (link->key == key)	2386	if (link->key == key)
2663	return link;	2387	return link;
2664		2388
2665	return NULL;	2389	return 0;
2666	}	2390	}
2667		2391
2668	/*	2392	/*
2669	* Returns the value of op has an extra_field for key, or NULL.	2393	* Returns the value of op has an extra_field for key, or NULL.
2670	*	2394	*
…		…
2710	* Returns TRUE on success.	2434	* Returns TRUE on success.
2711	*/	2435	*/
2712	int	2436	int
2713	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2437	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2714	{	2438	{
2715	key_value *
2716	field = NULL, *last = NULL;	2439	key_value *field = NULL, *last = NULL;
2717		2440
2718	for (field = op->key_values; field != NULL; field = field->next)	2441	for (field = op->key_values; field != NULL; field = field->next)
2719	{	2442	{
2720	if (field->key != canonical_key)	2443	if (field->key != canonical_key)
2721	{	2444	{
…		…
2749	/* IF we get here, key doesn't exist */	2472	/* IF we get here, key doesn't exist */
2750		2473
2751	/* No field, we'll have to add it. */	2474	/* No field, we'll have to add it. */
2752		2475
2753	if (!add_key)	2476	if (!add_key)
2754	{
2755	return FALSE;	2477	return FALSE;
2756	}	2478
2757	/* There isn't any good reason to store a null	2479	/* There isn't any good reason to store a null
2758	* value in the key/value list. If the archetype has	2480	* value in the key/value list. If the archetype has
2759	* this key, then we should also have it, so shouldn't	2481	* this key, then we should also have it, so shouldn't
2760	* be here. If user wants to store empty strings,	2482	* be here. If user wants to store empty strings,
2761	* should pass in ""	2483	* should pass in ""
…		…
2810	}	2532	}
2811	else	2533	else
2812	item = item->env;	2534	item = item->env;
2813	}	2535	}
2814		2536
		2537
		2538	const char *
		2539	object::flag_desc (char *desc, int len) const
		2540	{
		2541	char *p = desc;
		2542	bool first = true;
		2543
		2544	*p = 0;
		2545
		2546	for (int i = 0; i < NUM_FLAGS; i++)
		2547	{
		2548	if (len <= 10) // magic constant!
		2549	{
		2550	snprintf (p, len, ",...");
		2551	break;
		2552	}
		2553
		2554	if (flag [i])
		2555	{
		2556	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2557	len -= cnt;
		2558	p += cnt;
		2559	first = false;
		2560	}
		2561	}
		2562
		2563	return desc;
		2564	}
		2565
2815	// return a suitable string describing an objetc in enough detail to find it	2566	// return a suitable string describing an object in enough detail to find it
2816	const char *	2567	const char *
2817	object::debug_desc (char *info) const	2568	object::debug_desc (char *info) const
2818	{	2569	{
		2570	char flagdesc[512];
2819	char info2[256 * 3];	2571	char info2[256 * 4];
2820	char *p = info;	2572	char *p = info;
2821		2573
2822	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2574	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2823	count,	2575	count, uuid.seq,
2824	&name,	2576	&name,
2825	title ? " " : "",	2577	title ? "\",title:\"" : "",
2826	title ? (const char *)title : "");	2578	title ? (const char *)title : "",
		2579	flag_desc (flagdesc, 512), type);
2827		2580
2828	if (env)	2581	if (env)
2829	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2582	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2830		2583
2831	if (map)	2584	if (map)
2832	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2585	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2833		2586
2834	return info;	2587	return info;
2835	}	2588	}
2836		2589
2837	const char *	2590	const char *
2838	object::debug_desc () const	2591	object::debug_desc () const
2839	{	2592	{
2840	static char info[256 * 3];	2593	static char info[256 * 4];
2841	return debug_desc (info);	2594	return debug_desc (info);
2842	}	2595	}
2843		2596
		2597	const char *
		2598	object::debug_desc2 () const
		2599	{
		2600	static char info[256 * 4];
		2601	return debug_desc (info);
		2602	}
		2603

Diff Legend

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