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.65 by root, Wed Dec 13 00:42:03 2006 UTC vs.
Revision 1.112 by root, Mon Jan 8 14:11:04 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
…		…
30	#include <sys/uio.h>	31	#include <sys/uio.h>
31	#include <object.h>	32	#include <object.h>
32	#include <funcpoint.h>	33	#include <funcpoint.h>
33	#include <loader.h>	34	#include <loader.h>
34		35
		36	#include <bitset>
		37
35	int nrofallocobjects = 0;	38	int nrofallocobjects = 0;
36	static UUID uuid;	39	static UUID uuid;
37	const uint64 UUID_SKIP = 1<<19;	40	const uint64 UUID_SKIP = 1<<19;
38		41
39	object *active_objects; /* List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
40		44
41	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	45	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
42	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
43	};	47	};
44	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	48	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
…		…
139	* objects with lists are rare, and lists stay short. If not, use a	143	* objects with lists are rare, and lists stay short. If not, use a
140	* different structure or at least keep the lists sorted...	144	* different structure or at least keep the lists sorted...
141	*/	145	*/
142		146
143	/* For each field in wants, */	147	/* For each field in wants, */
144	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)	148	for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
145	{	149	{
146	key_value *has_field;	150	key_value *has_field;
147		151
148	/* Look for a field in has with the same key. */	152	/* Look for a field in has with the same key. */
149	has_field = get_ob_key_link (has, wants_field->key);	153	has_field = get_ob_key_link (has, wants_field->key);
…		…
183	*	187	*
184	* Note that this function appears a lot longer than the macro it	188	* Note that this function appears a lot longer than the macro it
185	* replaces - this is mostly for clarity - a decent compiler should hopefully	189	* replaces - this is mostly for clarity - a decent compiler should hopefully
186	* reduce this to the same efficiency.	190	* reduce this to the same efficiency.
187	*	191	*
188	* Check nrof variable *before* calling CAN_MERGE()	192	* Check nrof variable *before* calling can_merge()
189	*	193	*
190	* Improvements made with merge: Better checking on potion, and also	194	* Improvements made with merge: Better checking on potion, and also
191	* check weight	195	* check weight
192	*/	196	*/
193
194	bool object::can_merge (object *ob1, object *ob2)	197	bool object::can_merge_slow (object *ob1, object *ob2)
195	{	198	{
196	/* A couple quicksanity checks */	199	/* A couple quicksanity checks */
197	if ((ob1 == ob2) || (ob1->type != ob2->type))	200	if (ob1 == ob2
		201	|| ob1->type != ob2->type
		202	|| ob1->speed != ob2->speed
		203	|| ob1->value != ob2->value
		204	|| ob1->name != ob2->name)
198	return 0;	205	return 0;
199		206
200	if (ob1->speed != ob2->speed)	207	//TODO: this ain't working well, use nicer and correct overflow check
201	return 0;
202
203	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	208	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
204	* value could not be stored in a sint32 (which unfortunately sometimes is	209	* value could not be stored in a sint32 (which unfortunately sometimes is
205	* used to store nrof).	210	* used to store nrof).
206	*/	211	*/
207	if (ob1->nrof + ob2->nrof >= 1UL << 31)	212	if (ob1->nrof + ob2->nrof >= 1UL << 31)
…		…
217	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
218		223
219	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
220	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
221		226
222		227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
223	/* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something	228	|| ob1->arch != ob2->arch
224	* being locked in inventory should prevent merging.
225	* 0x4 in flags3 is CLIENT_SENT
226	*/
227	if ((ob1->arch != ob2->arch) ||
228	(ob1->flags[0] != ob2->flags[0]) ||
229	(ob1->flags[1] != ob2->flags[1]) ||
230	((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
231	((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
232	(ob1->name != ob2->name) ||	229	|| ob1->name != ob2->name
233	(ob1->title != ob2->title) ||	230	|| ob1->title != ob2->title
234	(ob1->msg != ob2->msg) ||	231	|| ob1->msg != ob2->msg
235	(ob1->weight != ob2->weight) ||	232	|| ob1->weight != ob2->weight
236	(memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) ||	233	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
237	(memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) ||	234	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
238	(ob1->attacktype != ob2->attacktype) ||	235	|| ob1->attacktype != ob2->attacktype
239	(ob1->magic != ob2->magic) ||	236	|| ob1->magic != ob2->magic
240	(ob1->slaying != ob2->slaying) ||	237	|| ob1->slaying != ob2->slaying
241	(ob1->skill != ob2->skill) ||	238	|| ob1->skill != ob2->skill
242	(ob1->value != ob2->value) ||	239	|| ob1->value != ob2->value
243	(ob1->animation_id != ob2->animation_id) ||	240	|| ob1->animation_id != ob2->animation_id
244	(ob1->client_type != ob2->client_type) ||	241	|| ob1->client_type != ob2->client_type
245	(ob1->materialname != ob2->materialname) ||	242	|| ob1->materialname != ob2->materialname
246	(ob1->lore != ob2->lore) ||	243	|| ob1->lore != ob2->lore
247	(ob1->subtype != ob2->subtype) ||	244	|| ob1->subtype != ob2->subtype
248	(ob1->move_type != ob2->move_type) ||	245	|| ob1->move_type != ob2->move_type
249	(ob1->move_block != ob2->move_block) ||	246	|| ob1->move_block != ob2->move_block
250	(ob1->move_allow != ob2->move_allow) ||	247	|| ob1->move_allow != ob2->move_allow
251	(ob1->move_on != ob2->move_on) ||	248	|| ob1->move_on != ob2->move_on
252	(ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty))	249	|| ob1->move_off != ob2->move_off
		250	|| ob1->move_slow != ob2->move_slow
		251	|| ob1->move_slow_penalty != ob2->move_slow_penalty)
253	return 0;	252	return 0;
254		253
255	/* This is really a spellbook check - really, we should	254	/* This is really a spellbook check - really, we should
256	* check all objects in the inventory.	255	* check all objects in the inventory.
257	*/	256	*/
…		…
260	/* if one object has inventory but the other doesn't, not equiv */	259	/* if one object has inventory but the other doesn't, not equiv */
261	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	260	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
262	return 0;	261	return 0;
263		262
264	/* Now check to see if the two inventory objects could merge */	263	/* Now check to see if the two inventory objects could merge */
265	if (!CAN_MERGE (ob1->inv, ob2->inv))	264	if (!object::can_merge (ob1->inv, ob2->inv))
266	return 0;	265	return 0;
267		266
268	/* inventory ok - still need to check rest of this object to see	267	/* inventory ok - still need to check rest of this object to see
269	* if it is valid.	268	* if it is valid.
270	*/	269	*/
…		…
279		278
280	/* Note sure why the following is the case - either the object has to	279	/* Note sure why the following is the case - either the object has to
281	* be animated or have a very low speed. Is this an attempted monster	280	* be animated or have a very low speed. Is this an attempted monster
282	* check?	281	* check?
283	*/	282	*/
284	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	283	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
285	return 0;	284	return 0;
286		285
287	switch (ob1->type)	286	switch (ob1->type)
288	{	287	{
289	case SCROLL:	288	case SCROLL:
…		…
354	op = op->env;	353	op = op->env;
355	return op;	354	return op;
356	}	355	}
357		356
358	/*	357	/*
359	* Eneq(@csd.uu.se): Since we can have items buried in a character we need
360	* a better check. We basically keeping traversing up until we can't
361	* or find a player.
362	*/
363
364	object *
365	is_player_inv (object *op)
366	{
367	for (; op != NULL && op->type != PLAYER; op = op->env)
368	if (op->env == op)
369	op->env = NULL;
370	return op;
371	}
372
373	/*
374	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	358	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
375	* Some error messages.	359	* Some error messages.
376	* The result of the dump is stored in the static global errmsg array.	360	* The result of the dump is stored in the static global errmsg array.
377	*/	361	*/
378		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	/*	471	/*
532	* copy_to first frees everything allocated by the dst object,	472	* copy_to first frees everything allocated by the dst object,
533	* and then copies the contents of itself into the second	473	* and then copies the contents of itself into the second
534	* object, allocating what needs to be allocated. Basically, any	474	* object, allocating what needs to be allocated. Basically, any
535	* 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,
…		…
541	{	481	{
542	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);	482	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
543	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);	483	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
544		484
545	*(object_copy *)dst = *this;	485	*(object_copy *)dst = *this;
546	*(object_pod *)dst = *this;
547
548	if (self || cb)
549	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst));
550		486
551	if (is_freed)	487	if (is_freed)
552	SET_FLAG (dst, FLAG_FREED);	488	SET_FLAG (dst, FLAG_FREED);
553		489
554	if (is_removed)	490	if (is_removed)
…		…
585	tail = new_link;	521	tail = new_link;
586	}	522	}
587	}	523	}
588	}	524	}
589		525
590	update_ob_speed (dst);	526	dst->set_speed (dst->speed);
591	}	527	}
592		528
593	object *	529	object *
594	object::clone ()	530	object::clone ()
595	{	531	{
…		…
601	/*	537	/*
602	* 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
603	* 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
604	* 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.
605	*/	541	*/
606
607	void	542	void
608	update_turn_face (object *op)	543	update_turn_face (object *op)
609	{	544	{
610	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)	545	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch)
611	return;	546	return;
		547
612	SET_ANIMATION (op, op->direction);	548	SET_ANIMATION (op, op->direction);
613	update_object (op, UP_OBJ_FACE);	549	update_object (op, UP_OBJ_FACE);
614	}	550	}
615		551
616	/*	552	/*
617	* 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
618	* 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.
619	* 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.
620	*/	556	*/
621	void	557	void
622	update_ob_speed (object *op)	558	object::set_speed (float speed)
623	{	559	{
624	extern int arch_init;	560	if (flag [FLAG_FREED] && speed)
625
626	/* No reason putting the archetypes objects on the speed list,
627	* since they never really need to be updated.
628	*/
629
630	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
631	{	561	{
632	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	562	LOG (llevError, "Object %s is freed but has speed.\n", &name);
633	#ifdef MANY_CORES
634	abort ();
635	#else
636	op->speed = 0;	563	speed = 0;
637	#endif
638	}
639
640	if (arch_init)
641	return;
642
643	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
644	{	564	}
645	/* If already on active list, don't do anything */
646	if (op->active_next || op->active_prev || op == active_objects)
647	return;
648		565
649	/* process_events() expects us to insert the object at the beginning	566	this->speed = speed;
650	* of the list. */
651	op->active_next = active_objects;
652		567
653	if (op->active_next != NULL)	568	if (has_active_speed ())
654	op->active_next->active_prev = op;	569	activate ();
655
656	active_objects = op;
657	}
658	else	570	else
659	{	571	deactivate ();
660	/* If not on the active list, nothing needs to be done */
661	if (!op->active_next && !op->active_prev && op != active_objects)
662	return;
663
664	if (op->active_prev == NULL)
665	{
666	active_objects = op->active_next;
667
668	if (op->active_next != NULL)
669	op->active_next->active_prev = NULL;
670	}
671	else
672	{
673	op->active_prev->active_next = op->active_next;
674
675	if (op->active_next)
676	op->active_next->active_prev = op->active_prev;
677	}
678
679	op->active_next = NULL;
680	op->active_prev = NULL;
681	}
682	}	572	}
683		573
684	/* This function removes object 'op' from the list of active
685	* objects.
686	* This should only be used for style maps or other such
687	* reference maps where you don't want an object that isn't
688	* in play chewing up cpu time getting processed.
689	* The reverse of this is to call update_ob_speed, which
690	* will do the right thing based on the speed of the object.
691	*/
692	void
693	remove_from_active_list (object *op)
694	{
695	/* If not on the active list, nothing needs to be done */
696	if (!op->active_next && !op->active_prev && op != active_objects)
697	return;
698
699	if (op->active_prev == NULL)
700	{
701	active_objects = op->active_next;
702	if (op->active_next != NULL)
703	op->active_next->active_prev = NULL;
704	}
705	else
706	{
707	op->active_prev->active_next = op->active_next;
708	if (op->active_next)
709	op->active_next->active_prev = op->active_prev;
710	}
711	op->active_next = NULL;
712	op->active_prev = NULL;
713	}
714
715	/*	574	/*
716	* update_object() updates the array which represents the map.	575	* update_object() updates the the map.
717	* It takes into account invisible objects (and represent squares covered	576	* It takes into account invisible objects (and represent squares covered
718	* 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
719	* invisible object, etc...)	578	* invisible object, etc...)
720	* 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
721	* 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
722	* updating that window, though, since update_object() is called _often_)	581	* updating that window, though, since update_object() is called _often_)
723	*	582	*
724	* 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.
725	* For example, if the only thing that has changed is the face (due to
726	* an animation), we don't need to call update_position until that actually
727	* comes into view of a player. OTOH, many other things, like addition/removal
728	* of walls or living creatures may need us to update the flags now.
729	* current action are:	584	* current action are:
730	* UP_OBJ_INSERT: op was inserted	585	* UP_OBJ_INSERT: op was inserted
731	* UP_OBJ_REMOVE: op was removed	586	* UP_OBJ_REMOVE: op was removed
732	* 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
733	* 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.
734	* UP_OBJ_FACE: only the objects face has changed.	589	* UP_OBJ_FACE: only the objects face has changed.
735	*/	590	*/
736
737	void	591	void
738	update_object (object *op, int action)	592	update_object (object *op, int action)
739	{	593	{
740	int update_now = 0, flags;
741	MoveType move_on, move_off, move_block, move_slow;	594	MoveType move_on, move_off, move_block, move_slow;
742		595
743	if (op == NULL)	596	if (op == NULL)
744	{	597	{
745	/* this should never happen */	598	/* this should never happen */
746	LOG (llevDebug, "update_object() called for NULL object.\n");	599	LOG (llevDebug, "update_object() called for NULL object.\n");
747	return;	600	return;
748	}	601	}
749		602
750	if (op->env != NULL)	603	if (op->env)
751	{	604	{
752	/* Animation is currently handled by client, so nothing	605	/* Animation is currently handled by client, so nothing
753	* to do in this case.	606	* to do in this case.
754	*/	607	*/
755	return;	608	return;
…		…
760	*/	613	*/
761	if (!op->map || op->map->in_memory == MAP_SAVING)	614	if (!op->map || op->map->in_memory == MAP_SAVING)
762	return;	615	return;
763		616
764	/* make sure the object is within map boundaries */	617	/* make sure the object is within map boundaries */
765	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)
766	{	619	{
767	LOG (llevError, "update_object() called for object out of map!\n");	620	LOG (llevError, "update_object() called for object out of map!\n");
768	#ifdef MANY_CORES	621	#ifdef MANY_CORES
769	abort ();	622	abort ();
770	#endif	623	#endif
771	return;	624	return;
772	}	625	}
773		626
774	flags = GET_MAP_FLAGS (op->map, op->x, op->y);	627	mapspace &m = op->ms ();
775	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
776	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
777	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
778	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
779	move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
780		628
		629	if (!(m.flags_ & P_UPTODATE))
		630	/* nop */;
781	if (action == UP_OBJ_INSERT)	631	else if (action == UP_OBJ_INSERT)
782	{	632	{
		633	// this is likely overkill, TODO: revisit (schmorp)
783	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	634	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
784	update_now = 1;
785
786	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	635	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
787	update_now = 1;	636	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
788		637	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		638	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
789	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	639	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
790	update_now = 1;
791
792	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
793	update_now = 1;
794
795	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
796	update_now = 1;
797
798	if ((move_on | op->move_on) != move_on)	640	|| (m.move_on | op->move_on ) != m.move_on
799	update_now = 1;
800
801	if ((move_off | op->move_off) != move_off)	641	|| (m.move_off | op->move_off ) != m.move_off
802	update_now = 1;	642	|| (m.move_slow | op->move_slow) != m.move_slow
803
804	/* 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
805	* to have move_allow right now.	644	* to have move_allow right now.
806	*/	645	*/
807	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	646	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
808	update_now = 1;	647	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
809		648	m.flags_ = 0;
810	if ((move_slow | op->move_slow) != move_slow)
811	update_now = 1;
812	}	649	}
813
814	/* if the object is being removed, we can't make intelligent	650	/* if the object is being removed, we can't make intelligent
815	* decisions, because remove_ob can't really pass the object	651	* decisions, because remove_ob can't really pass the object
816	* that is being removed.	652	* that is being removed.
817	*/	653	*/
818	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)	654	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
819	update_now = 1;	655	m.flags_ = 0;
820	else if (action == UP_OBJ_FACE)	656	else if (action == UP_OBJ_FACE)
821	/* Nothing to do for that case */ ;	657	/* Nothing to do for that case */ ;
822	else	658	else
823	LOG (llevError, "update_object called with invalid action: %d\n", action);	659	LOG (llevError, "update_object called with invalid action: %d\n", action);
824		660
825	if (update_now)
826	{
827	SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
828	update_position (op->map, op->x, op->y);
829	}
830
831	if (op->more != NULL)	661	if (op->more)
832	update_object (op->more, action);	662	update_object (op->more, action);
833	}	663	}
834		664
835	object::vector object::mortals;
836	object::vector object::objects; // not yet used
837	object *object::first;	665	object *object::first;
838
839	void object::free_mortals ()
840	{
841	for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
842	if ((*i)->refcnt)
843	++i; // further delay freeing
844	else
845	{
846	delete *i;
847	mortals.erase (i);
848	}
849	}
850		666
851	object::object ()	667	object::object ()
852	{	668	{
853	SET_FLAG (this, FLAG_REMOVED);	669	SET_FLAG (this, FLAG_REMOVED);
854		670
…		…
859	object::~object ()	675	object::~object ()
860	{	676	{
861	free_key_values (this);	677	free_key_values (this);
862	}	678	}
863		679
		680	static int object_count;
		681
864	void object::link ()	682	void object::link ()
865	{	683	{
866	count = ++ob_count;	684	assert (!index);//D
867	uuid = gen_uuid ();	685	uuid = gen_uuid ();
		686	count = ++object_count;
868		687
869	prev = 0;	688	refcnt_inc ();
870	next = object::first;	689	objects.insert (this);
871
872	if (object::first)
873	object::first->prev = this;
874
875	object::first = this;
876	}	690	}
877		691
878	void object::unlink ()	692	void object::unlink ()
879	{	693	{
880	if (this == object::first)	694	assert (index);//D
881	object::first = next;	695	objects.erase (this);
		696	refcnt_dec ();
		697	}
882		698
883	/* Remove this object from the list of used objects */	699	void
884	if (prev) prev->next = next;	700	object::activate ()
885	if (next) next->prev = prev;	701	{
		702	/* If already on active list, don't do anything */
		703	if (active)
		704	return;
886		705
887	prev = 0;	706	if (has_active_speed ())
888	next = 0;	707	actives.insert (this);
		708	}
		709
		710	void
		711	object::activate_recursive ()
		712	{
		713	activate ();
		714
		715	for (object *op = inv; op; op = op->below)
		716	op->activate_recursive ();
		717	}
		718
		719	/* This function removes object 'op' from the list of active
		720	* objects.
		721	* This should only be used for style maps or other such
		722	* reference maps where you don't want an object that isn't
		723	* in play chewing up cpu time getting processed.
		724	* The reverse of this is to call update_ob_speed, which
		725	* will do the right thing based on the speed of the object.
		726	*/
		727	void
		728	object::deactivate ()
		729	{
		730	/* If not on the active list, nothing needs to be done */
		731	if (!active)
		732	return;
		733
		734	actives.erase (this);
		735	}
		736
		737	void
		738	object::deactivate_recursive ()
		739	{
		740	for (object *op = inv; op; op = op->below)
		741	op->deactivate_recursive ();
		742
		743	deactivate ();
		744	}
		745
		746	void
		747	object::set_flag_inv (int flag, int value)
		748	{
		749	for (object *op = inv; op; op = op->below)
		750	{
		751	op->flag [flag] = value;
		752	op->set_flag_inv (flag, value);
		753	}
		754	}
		755
		756	/*
		757	* Remove and free all objects in the inventory of the given object.
		758	* object.c ?
		759	*/
		760	void
		761	object::destroy_inv (bool drop_to_ground)
		762	{
		763	// need to check first, because the checks below might segfault
		764	// as we might be on an invalid mapspace and crossfire code
		765	// is too buggy to ensure that the inventory is empty.
		766	// corollary: if you create arrows etc. with stuff in tis inventory,
		767	// cf will crash below with off-map x and y
		768	if (!inv)
		769	return;
		770
		771	/* Only if the space blocks everything do we not process -
		772	* if some form of movement is allowed, let objects
		773	* drop on that space.
		774	*/
		775	if (!drop_to_ground
		776	|| !map
		777	|| map->in_memory != MAP_IN_MEMORY
		778	|| ms ().move_block == MOVE_ALL)
		779	{
		780	while (inv)
		781	{
		782	inv->destroy_inv (drop_to_ground);
		783	inv->destroy ();
		784	}
		785	}
		786	else
		787	{ /* Put objects in inventory onto this space */
		788	while (inv)
		789	{
		790	object *op = inv;
		791
		792	if (op->flag [FLAG_STARTEQUIP]
		793	|| op->flag [FLAG_NO_DROP]
		794	|| op->type == RUNE
		795	|| op->type == TRAP
		796	|| op->flag [FLAG_IS_A_TEMPLATE]
		797	|| op->flag [FLAG_DESTROY_ON_DEATH])
		798	op->destroy ();
		799	else
		800	map->insert (op, x, y);
		801	}
		802	}
889	}	803	}
890		804
891	object *object::create ()	805	object *object::create ()
892	{	806	{
893	object *op = new object;	807	object *op = new object;
894	op->link ();	808	op->link ();
895	return op;	809	return op;
896	}	810	}
897		811
898	/*	812	void
899	* free_object() frees everything allocated by an object, removes	813	object::do_destroy ()
900	* it from the list of used objects, and puts it on the list of
901	* free objects. The IS_FREED() flag is set in the object.
902	* The object must have been removed by remove_ob() first for
903	* this function to succeed.
904	*
905	* If destroy_inventory is set, free inventory as well. Else drop items in
906	* inventory to the ground.
907	*/
908	void object::destroy (bool destroy_inventory)
909	{	814	{
910	if (QUERY_FLAG (this, FLAG_FREED))	815	attachable::do_destroy ();
911	return;
912		816
913	if (QUERY_FLAG (this, FLAG_FRIENDLY))	817	if (flag [FLAG_IS_LINKED])
		818	remove_button_link (this);
		819
		820	if (flag [FLAG_FRIENDLY])
914	remove_friendly_object (this);	821	remove_friendly_object (this);
915		822
916	if (!QUERY_FLAG (this, FLAG_REMOVED))	823	if (!flag [FLAG_REMOVED])
917	remove ();	824	remove ();
918		825
919	SET_FLAG (this, FLAG_FREED);	826	destroy_inv (true);
920		827
921	if (more)	828	deactivate ();
922	{	829	unlink ();
923	more->destroy (destroy_inventory);
924	more = 0;
925	}
926		830
927	if (inv)	831	flag [FLAG_FREED] = 1;
928	{
929	/* Only if the space blocks everything do we not process -
930	* if some form of movement is allowed, let objects
931	* drop on that space.
932	*/
933	if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
934	{
935	object *op = inv;
936
937	while (op)
938	{
939	object *tmp = op->below;
940	op->destroy (destroy_inventory);
941	op = tmp;
942	}
943	}
944	else
945	{ /* Put objects in inventory onto this space */
946	object *op = inv;
947
948	while (op)
949	{
950	object *tmp = op->below;
951
952	op->remove ();
953
954	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
955	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
956	op->destroy ();
957	else
958	{
959	op->x = x;
960	op->y = y;
961	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
962	}
963
964	op = tmp;
965	}
966	}
967	}
968		832
969	// hack to ensure that freed objects still have a valid map	833	// hack to ensure that freed objects still have a valid map
970	{	834	{
971	static maptile *freed_map; // freed objects are moved here to avoid crashes	835	static maptile *freed_map; // freed objects are moved here to avoid crashes
972		836
…		…
976		840
977	freed_map->name = "/internal/freed_objects_map";	841	freed_map->name = "/internal/freed_objects_map";
978	freed_map->width = 3;	842	freed_map->width = 3;
979	freed_map->height = 3;	843	freed_map->height = 3;
980		844
981	freed_map->allocate ();	845	freed_map->alloc ();
		846	freed_map->in_memory = MAP_IN_MEMORY;
982	}	847	}
983		848
984	map = freed_map;	849	map = freed_map;
985	x = 1;	850	x = 1;
986	y = 1;	851	y = 1;
987	}	852	}
988		853
		854	head = 0;
		855
		856	if (more)
		857	{
		858	more->destroy ();
		859	more = 0;
		860	}
		861
989	// clear those pointers that likely might have circular references to us	862	// clear those pointers that likely might have circular references to us
990	owner = 0;	863	owner = 0;
991	enemy = 0;	864	enemy = 0;
992	attacked_by = 0;	865	attacked_by = 0;
		866	}
993		867
994	// only relevant for players(?), but make sure of it anyways	868	void
995	contr = 0;	869	object::destroy (bool destroy_inventory)
		870	{
		871	if (destroyed ())
		872	return;
996		873
997	/* Remove object from the active list */	874	if (destroy_inventory)
998	speed = 0;	875	destroy_inv (false);
999	update_ob_speed (this);
1000		876
1001	unlink ();	877	attachable::destroy ();
1002
1003	mortals.push_back (this);
1004	}	878	}
1005		879
1006	/*	880	/*
1007	* sub_weight() recursively (outwards) subtracts a number from the	881	* sub_weight() recursively (outwards) subtracts a number from the
1008	* weight of an object (and what is carried by it's environment(s)).	882	* weight of an object (and what is carried by it's environment(s)).
…		…
1032	object::remove ()	906	object::remove ()
1033	{	907	{
1034	object *tmp, *last = 0;	908	object *tmp, *last = 0;
1035	object *otmp;	909	object *otmp;
1036		910
1037	int check_walk_off;
1038
1039	if (QUERY_FLAG (this, FLAG_REMOVED))	911	if (QUERY_FLAG (this, FLAG_REMOVED))
1040	return;	912	return;
1041		913
1042	SET_FLAG (this, FLAG_REMOVED);	914	SET_FLAG (this, FLAG_REMOVED);
		915	INVOKE_OBJECT (REMOVE, this);
1043		916
1044	if (more)	917	if (more)
1045	more->remove ();	918	more->remove ();
1046		919
1047	/*	920	/*
…		…
1057		930
1058	/* NO_FIX_PLAYER is set when a great many changes are being	931	/* NO_FIX_PLAYER is set when a great many changes are being
1059	* made to players inventory. If set, avoiding the call	932	* made to players inventory. If set, avoiding the call
1060	* to save cpu time.	933	* to save cpu time.
1061	*/	934	*/
1062	if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	935	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1063	fix_player (otmp);	936	otmp->update_stats ();
1064		937
1065	if (above != NULL)	938	if (above)
1066	above->below = below;	939	above->below = below;
1067	else	940	else
1068	env->inv = below;	941	env->inv = below;
1069		942
1070	if (below != NULL)	943	if (below)
1071	below->above = above;	944	below->above = above;
1072		945
1073	/* we set up values so that it could be inserted into	946	/* we set up values so that it could be inserted into
1074	* the map, but we don't actually do that - it is up	947	* the map, but we don't actually do that - it is up
1075	* to the caller to decide what we want to do.	948	* to the caller to decide what we want to do.
…		…
1079	above = 0, below = 0;	952	above = 0, below = 0;
1080	env = 0;	953	env = 0;
1081	}	954	}
1082	else if (map)	955	else if (map)
1083	{	956	{
1084	/* Re did the following section of code - it looks like it had	957	if (type == PLAYER)
1085	* lots of logic for things we no longer care about
1086	*/	958	{
		959	--map->players;
		960	map->touch ();
		961	}
		962
		963	map->dirty = true;
1087		964
1088	/* link the object above us */	965	/* link the object above us */
1089	if (above)	966	if (above)
1090	above->below = below;	967	above->below = below;
1091	else	968	else
1092	SET_MAP_TOP (map, x, y, below); /* we were top, set new top */	969	map->at (x, y).top = below; /* we were top, set new top */
1093		970
1094	/* Relink the object below us, if there is one */	971	/* Relink the object below us, if there is one */
1095	if (below)	972	if (below)
1096	below->above = above;	973	below->above = above;
1097	else	974	else
…		…
1109	dump = dump_object (GET_MAP_OB (map, x, y));	986	dump = dump_object (GET_MAP_OB (map, x, y));
1110	LOG (llevError, "%s\n", dump);	987	LOG (llevError, "%s\n", dump);
1111	free (dump);	988	free (dump);
1112	}	989	}
1113		990
1114	SET_MAP_OB (map, x, y, above); /* goes on above it. */	991	map->at (x, y).bot = above; /* goes on above it. */
1115	}	992	}
1116		993
1117	above = 0;	994	above = 0;
1118	below = 0;	995	below = 0;
1119		996
1120	if (map->in_memory == MAP_SAVING)	997	if (map->in_memory == MAP_SAVING)
1121	return;	998	return;
1122		999
1123	check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);	1000	int check_walk_off = !flag [FLAG_NO_APPLY];
1124		1001
1125	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1002	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)
1126	{	1003	{
1127	/* No point updating the players look faces if he is the object	1004	/* No point updating the players look faces if he is the object
1128	* being removed.	1005	* being removed.
1129	*/	1006	*/
1130		1007
…		…
1134	* removed (most likely destroyed), update the player view	1011	* removed (most likely destroyed), update the player view
1135	* appropriately.	1012	* appropriately.
1136	*/	1013	*/
1137	if (tmp->container == this)	1014	if (tmp->container == this)
1138	{	1015	{
1139	CLEAR_FLAG (this, FLAG_APPLIED);	1016	flag [FLAG_APPLIED] = 0;
1140	tmp->container = 0;	1017	tmp->container = 0;
1141	}	1018	}
1142		1019
1143	tmp->contr->socket.update_look = 1;	1020	if (tmp->contr->ns)
		1021	tmp->contr->ns->floorbox_update ();
1144	}	1022	}
1145		1023
1146	/* See if player moving off should effect something */	1024	/* See if object moving off should effect something */
1147	if (check_walk_off	1025	if (check_walk_off
1148	&& ((move_type & tmp->move_off)	1026	&& ((move_type & tmp->move_off)
1149	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1027	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1150	{	1028	{
1151	move_apply (tmp, this, 0);	1029	move_apply (tmp, this, 0);
…		…
1153	if (destroyed ())	1031	if (destroyed ())
1154	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1032	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1155	}	1033	}
1156		1034
1157	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1035	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1158		1036	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1159	if (tmp->above == tmp)	1037	if (tmp->above == tmp)
1160	tmp->above = 0;	1038	tmp->above = 0;
1161		1039
1162	last = tmp;	1040	last = tmp;
1163	}	1041	}
1164		1042
1165	/* last == NULL of there are no objects on this space */	1043	/* last == NULL if there are no objects on this space */
		1044	//TODO: this makes little sense, why only update the topmost object?
1166	if (!last)	1045	if (!last)
1167	{	1046	map->at (x, y).flags_ = 0;
1168	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1169	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1170	* those out anyways, and if there are any flags set right now, they won't
1171	* be correct anyways.
1172	*/
1173	SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1174	update_position (map, x, y);
1175	}
1176	else	1047	else
1177	update_object (last, UP_OBJ_REMOVE);	1048	update_object (last, UP_OBJ_REMOVE);
1178		1049
1179	if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)	1050	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1180	update_all_los (map, x, y);	1051	update_all_los (map, x, y);
1181	}	1052	}
1182	}	1053	}
1183		1054
1184	/*	1055	/*
…		…
1193	merge_ob (object *op, object *top)	1064	merge_ob (object *op, object *top)
1194	{	1065	{
1195	if (!op->nrof)	1066	if (!op->nrof)
1196	return 0;	1067	return 0;
1197		1068
1198	if (top == NULL)	1069	if (top)
1199	for (top = op; top != NULL && top->above != NULL; top = top->above);	1070	for (top = op; top && top->above; top = top->above)
		1071	;
1200		1072
1201	for (; top != NULL; top = top->below)	1073	for (; top; top = top->below)
1202	{	1074	{
1203	if (top == op)	1075	if (top == op)
1204	continue;	1076	continue;
1205	if (CAN_MERGE (op, top))	1077
		1078	if (object::can_merge (op, top))
1206	{	1079	{
1207	top->nrof += op->nrof;	1080	top->nrof += op->nrof;
1208		1081
1209	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1082	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1210	op->weight = 0; /* Don't want any adjustements now */	1083	op->weight = 0; /* Don't want any adjustements now */
…		…
1221	* job preparing multi-part monsters	1094	* job preparing multi-part monsters
1222	*/	1095	*/
1223	object *	1096	object *
1224	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)	1097	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1225	{	1098	{
1226	object *tmp;
1227
1228	if (op->head)
1229	op = op->head;
1230
1231	for (tmp = op; tmp; tmp = tmp->more)	1099	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1232	{	1100	{
1233	tmp->x = x + tmp->arch->clone.x;	1101	tmp->x = x + tmp->arch->clone.x;
1234	tmp->y = y + tmp->arch->clone.y;	1102	tmp->y = y + tmp->arch->clone.y;
1235	}	1103	}
1236		1104
…		…
1255	* Return value:	1123	* Return value:
1256	* new object if 'op' was merged with other object	1124	* new object if 'op' was merged with other object
1257	* NULL if 'op' was destroyed	1125	* NULL if 'op' was destroyed
1258	* just 'op' otherwise	1126	* just 'op' otherwise
1259	*/	1127	*/
1260
1261	object *	1128	object *
1262	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)	1129	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1263	{	1130	{
1264	object *tmp, *top, *floor = NULL;	1131	object *tmp, *top, *floor = NULL;
1265	sint16 x, y;	1132	sint16 x, y;
…		…
1268	{	1135	{
1269	LOG (llevError, "Trying to insert freed object!\n");	1136	LOG (llevError, "Trying to insert freed object!\n");
1270	return NULL;	1137	return NULL;
1271	}	1138	}
1272		1139
1273	if (m == NULL)	1140	if (!m)
1274	{	1141	{
1275	char *dump = dump_object (op);	1142	char *dump = dump_object (op);
1276	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1143	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1277	free (dump);	1144	free (dump);
1278	return op;	1145	return op;
…		…
1299	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);	1166	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1300	free (dump);	1167	free (dump);
1301	return op;	1168	return op;
1302	}	1169	}
1303		1170
1304	if (op->more != NULL)	1171	if (op->more)
1305	{	1172	{
1306	/* The part may be on a different map. */	1173	/* The part may be on a different map. */
1307		1174
1308	object *more = op->more;	1175	object *more = op->more;
1309		1176
1310	/* We really need the caller to normalize coordinates - if	1177	/* We really need the caller to normalise coordinates - if
1311	* we set the map, that doesn't work if the location is within	1178	* we set the map, that doesn't work if the location is within
1312	* a map and this is straddling an edge. So only if coordinate	1179	* a map and this is straddling an edge. So only if coordinate
1313	* is clear wrong do we normalize it.	1180	* is clear wrong do we normalise it.
1314	*/	1181	*/
1315	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))	1182	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1316	more->map = get_map_from_coord (m, &more->x, &more->y);	1183	more->map = get_map_from_coord (m, &more->x, &more->y);
1317	else if (!more->map)	1184	else if (!more->map)
1318	{	1185	{
…		…
1325	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1192	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1326	{	1193	{
1327	if (!op->head)	1194	if (!op->head)
1328	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1195	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1329		1196
1330	return NULL;	1197	return 0;
1331	}	1198	}
1332	}	1199	}
1333		1200
1334	CLEAR_FLAG (op, FLAG_REMOVED);	1201	CLEAR_FLAG (op, FLAG_REMOVED);
1335		1202
…		…
1342	y = op->y;	1209	y = op->y;
1343		1210
1344	/* this has to be done after we translate the coordinates.	1211	/* this has to be done after we translate the coordinates.
1345	*/	1212	*/
1346	if (op->nrof && !(flag & INS_NO_MERGE))	1213	if (op->nrof && !(flag & INS_NO_MERGE))
1347	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1214	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)
1348	if (CAN_MERGE (op, tmp))	1215	if (object::can_merge (op, tmp))
1349	{	1216	{
1350	op->nrof += tmp->nrof;	1217	op->nrof += tmp->nrof;
1351	tmp->destroy ();	1218	tmp->destroy ();
1352	}	1219	}
1353		1220
…		…
1369	op->below = originator->below;	1236	op->below = originator->below;
1370		1237
1371	if (op->below)	1238	if (op->below)
1372	op->below->above = op;	1239	op->below->above = op;
1373	else	1240	else
1374	SET_MAP_OB (op->map, op->x, op->y, op);	1241	op->ms ().bot = op;
1375		1242
1376	/* since *below* originator, no need to update top */	1243	/* since *below* originator, no need to update top */
1377	originator->below = op;	1244	originator->below = op;
1378	}	1245	}
1379	else	1246	else
1380	{	1247	{
1381	/* If there are other objects, then */	1248	/* If there are other objects, then */
1382	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1249	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))
1383	{	1250	{
1384	object *last = NULL;	1251	object *last = 0;
1385		1252
1386	/*	1253	/*
1387	* If there are multiple objects on this space, we do some trickier handling.	1254	* If there are multiple objects on this space, we do some trickier handling.
1388	* We've already dealt with merging if appropriate.	1255	* We've already dealt with merging if appropriate.
1389	* Generally, we want to put the new object on top. But if	1256	* Generally, we want to put the new object on top. But if
…		…
1393	* once we get to them. This reduces the need to traverse over all of	1260	* once we get to them. This reduces the need to traverse over all of
1394	* them when adding another one - this saves quite a bit of cpu time	1261	* them when adding another one - this saves quite a bit of cpu time
1395	* when lots of spells are cast in one area. Currently, it is presumed	1262	* when lots of spells are cast in one area. Currently, it is presumed
1396	* that flying non pickable objects are spell objects.	1263	* that flying non pickable objects are spell objects.
1397	*/	1264	*/
1398
1399	while (top != NULL)	1265	while (top)
1400	{	1266	{
1401	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1267	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1402	floor = top;	1268	floor = top;
1403		1269
1404	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1270	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1425	* If INS_ON_TOP is used, don't do this processing	1291	* If INS_ON_TOP is used, don't do this processing
1426	* Need to find the object that in fact blocks view, otherwise	1292	* Need to find the object that in fact blocks view, otherwise
1427	* stacking is a bit odd.	1293	* stacking is a bit odd.
1428	*/	1294	*/
1429	if (!(flag & INS_ON_TOP) &&	1295	if (!(flag & INS_ON_TOP) &&
1430	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1296	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))
1431	{	1297	{
1432	for (last = top; last != floor; last = last->below)	1298	for (last = top; last != floor; last = last->below)
1433	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1299	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1434	break;	1300	break;
1435	/* Check to see if we found the object that blocks view,	1301	/* Check to see if we found the object that blocks view,
…		…
1457	op->above = GET_MAP_OB (op->map, op->x, op->y);	1323	op->above = GET_MAP_OB (op->map, op->x, op->y);
1458		1324
1459	if (op->above)	1325	if (op->above)
1460	op->above->below = op;	1326	op->above->below = op;
1461		1327
1462	op->below = NULL;	1328	op->below = 0;
1463	SET_MAP_OB (op->map, op->x, op->y, op);	1329	op->ms ().bot = op;
1464	}	1330	}
1465	else	1331	else
1466	{ /* get inserted into the stack above top */	1332	{ /* get inserted into the stack above top */
1467	op->above = top->above;	1333	op->above = top->above;
1468		1334
…		…
1471		1337
1472	op->below = top;	1338	op->below = top;
1473	top->above = op;	1339	top->above = op;
1474	}	1340	}
1475		1341
1476	if (op->above == NULL)	1342	if (!op->above)
1477	SET_MAP_TOP (op->map, op->x, op->y, op);	1343	op->ms ().top = op;
1478	} /* else not INS_BELOW_ORIGINATOR */	1344	} /* else not INS_BELOW_ORIGINATOR */
1479		1345
1480	if (op->type == PLAYER)	1346	if (op->type == PLAYER)
		1347	{
1481	op->contr->do_los = 1;	1348	op->contr->do_los = 1;
		1349	++op->map->players;
		1350	op->map->touch ();
		1351	}
		1352
		1353	op->map->dirty = true;
1482		1354
1483	/* If we have a floor, we know the player, if any, will be above	1355	/* If we have a floor, we know the player, if any, will be above
1484	* it, so save a few ticks and start from there.	1356	* it, so save a few ticks and start from there.
1485	*/	1357	*/
1486	if (!(flag & INS_MAP_LOAD))	1358	if (!(flag & INS_MAP_LOAD))
1487	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1359	if (object *pl = op->ms ().player ())
1488	if (tmp->type == PLAYER)	1360	if (pl->contr->ns)
1489	tmp->contr->socket.update_look = 1;	1361	pl->contr->ns->floorbox_update ();
1490		1362
1491	/* If this object glows, it may affect lighting conditions that are	1363	/* If this object glows, it may affect lighting conditions that are
1492	* visible to others on this map. But update_all_los is really	1364	* visible to others on this map. But update_all_los is really
1493	* an inefficient way to do this, as it means los for all players	1365	* an inefficient way to do this, as it means los for all players
1494	* on the map will get recalculated. The players could very well	1366	* on the map will get recalculated. The players could very well
1495	* be far away from this change and not affected in any way -	1367	* be far away from this change and not affected in any way -
1496	* this should get redone to only look for players within range,	1368	* this should get redone to only look for players within range,
1497	* or just updating the P_NEED_UPDATE for spaces within this area	1369	* or just updating the P_UPTODATE for spaces within this area
1498	* of effect may be sufficient.	1370	* of effect may be sufficient.
1499	*/	1371	*/
1500	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1372	if (op->map->darkness && (op->glow_radius != 0))
1501	update_all_los (op->map, op->x, op->y);	1373	update_all_los (op->map, op->x, op->y);
1502		1374
1503	/* updates flags (blocked, alive, no magic, etc) for this map space */	1375	/* updates flags (blocked, alive, no magic, etc) for this map space */
1504	update_object (op, UP_OBJ_INSERT);	1376	update_object (op, UP_OBJ_INSERT);
1505		1377
		1378	INVOKE_OBJECT (INSERT, op);
		1379
1506	/* Don't know if moving this to the end will break anything. However,	1380	/* Don't know if moving this to the end will break anything. However,
1507	* we want to have update_look set above before calling this.	1381	* we want to have floorbox_update called before calling this.
1508	*	1382	*
1509	* check_move_on() must be after this because code called from	1383	* check_move_on() must be after this because code called from
1510	* check_move_on() depends on correct map flags (so functions like	1384	* check_move_on() depends on correct map flags (so functions like
1511	* blocked() and wall() work properly), and these flags are updated by	1385	* blocked() and wall() work properly), and these flags are updated by
1512	* update_object().	1386	* update_object().
…		…
1514		1388
1515	/* if this is not the head or flag has been passed, don't check walk on status */	1389	/* if this is not the head or flag has been passed, don't check walk on status */
1516	if (!(flag & INS_NO_WALK_ON) && !op->head)	1390	if (!(flag & INS_NO_WALK_ON) && !op->head)
1517	{	1391	{
1518	if (check_move_on (op, originator))	1392	if (check_move_on (op, originator))
1519	return NULL;	1393	return 0;
1520		1394
1521	/* If we are a multi part object, lets work our way through the check	1395	/* If we are a multi part object, lets work our way through the check
1522	* walk on's.	1396	* walk on's.
1523	*/	1397	*/
1524	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1398	for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1525	if (check_move_on (tmp, originator))	1399	if (check_move_on (tmp, originator))
1526	return NULL;	1400	return 0;
1527	}	1401	}
1528		1402
1529	return op;	1403	return op;
1530	}	1404	}
1531		1405
1532	/* this function inserts an object in the map, but if it	1406	/* this function inserts an object in the map, but if it
1533	* finds an object of its own type, it'll remove that one first.	1407	* finds an object of its own type, it'll remove that one first.
1534	* op is the object to insert it under: supplies x and the map.	1408	* op is the object to insert it under: supplies x and the map.
1535	*/	1409	*/
1536	void	1410	void
1537	replace_insert_ob_in_map (const char *arch_string, object *op)	1411	replace_insert_ob_in_map (const char *arch_string, object *op)
1538	{	1412	{
1539	object *	1413	object *tmp, *tmp1;
1540	tmp;
1541	object *
1542	tmp1;
1543		1414
1544	/* first search for itself and remove any old instances */	1415	/* first search for itself and remove any old instances */
1545		1416
1546	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)	1417	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1547	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1418	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1548	tmp->destroy ();	1419	tmp->destroy ();
1549		1420
1550	tmp1 = arch_to_object (archetype::find (arch_string));	1421	tmp1 = arch_to_object (archetype::find (arch_string));
1551		1422
1552	tmp1->x = op->x;	1423	tmp1->x = op->x;
1553	tmp1->y = op->y;	1424	tmp1->y = op->y;
1554	insert_ob_in_map (tmp1, op->map, op, 0);	1425	insert_ob_in_map (tmp1, op->map, op, 0);
		1426	}
		1427
		1428	object *
		1429	object::insert_at (object *where, object *originator, int flags)
		1430	{
		1431	where->map->insert (this, where->x, where->y, originator, flags);
1555	}	1432	}
1556		1433
1557	/*	1434	/*
1558	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1435	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1559	* is returned contains nr objects, and the remaining parts contains	1436	* is returned contains nr objects, and the remaining parts contains
1560	* the rest (or is removed and freed if that number is 0).	1437	* the rest (or is removed and freed if that number is 0).
1561	* On failure, NULL is returned, and the reason put into the	1438	* On failure, NULL is returned, and the reason put into the
1562	* global static errmsg array.	1439	* global static errmsg array.
1563	*/	1440	*/
1564
1565	object *	1441	object *
1566	get_split_ob (object *orig_ob, uint32 nr)	1442	get_split_ob (object *orig_ob, uint32 nr)
1567	{	1443	{
1568	object *newob;	1444	object *newob;
1569	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1445	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1605		1481
1606	object *	1482	object *
1607	decrease_ob_nr (object *op, uint32 i)	1483	decrease_ob_nr (object *op, uint32 i)
1608	{	1484	{
1609	object *tmp;	1485	object *tmp;
1610	player *pl;
1611		1486
1612	if (i == 0) /* objects with op->nrof require this check */	1487	if (i == 0) /* objects with op->nrof require this check */
1613	return op;	1488	return op;
1614		1489
1615	if (i > op->nrof)	1490	if (i > op->nrof)
1616	i = op->nrof;	1491	i = op->nrof;
1617		1492
1618	if (QUERY_FLAG (op, FLAG_REMOVED))	1493	if (QUERY_FLAG (op, FLAG_REMOVED))
1619	op->nrof -= i;	1494	op->nrof -= i;
1620	else if (op->env != NULL)	1495	else if (op->env)
1621	{	1496	{
1622	/* is this object in the players inventory, or sub container	1497	/* is this object in the players inventory, or sub container
1623	* therein?	1498	* therein?
1624	*/	1499	*/
1625	tmp = is_player_inv (op->env);	1500	tmp = op->in_player ();
1626	/* nope. Is this a container the player has opened?	1501	/* nope. Is this a container the player has opened?
1627	* If so, set tmp to that player.	1502	* If so, set tmp to that player.
1628	* IMO, searching through all the players will mostly	1503	* IMO, searching through all the players will mostly
1629	* likely be quicker than following op->env to the map,	1504	* likely be quicker than following op->env to the map,
1630	* and then searching the map for a player.	1505	* and then searching the map for a player.
1631	*/	1506	*/
1632	if (!tmp)	1507	if (!tmp)
1633	{	1508	for_all_players (pl)
1634	for (pl = first_player; pl; pl = pl->next)
1635	if (pl->ob->container == op->env)	1509	if (pl->ob->container == op->env)
		1510	{
		1511	tmp = pl->ob;
1636	break;	1512	break;
1637	if (pl)
1638	tmp = pl->ob;
1639	else
1640	tmp = NULL;
1641	}	1513	}
1642		1514
1643	if (i < op->nrof)	1515	if (i < op->nrof)
1644	{	1516	{
1645	sub_weight (op->env, op->weight * i);	1517	sub_weight (op->env, op->weight * i);
1646	op->nrof -= i;	1518	op->nrof -= i;
1647	if (tmp)	1519	if (tmp)
1648	{
1649	esrv_send_item (tmp, op);	1520	esrv_send_item (tmp, op);
1650	}
1651	}	1521	}
1652	else	1522	else
1653	{	1523	{
1654	op->remove ();	1524	op->remove ();
1655	op->nrof = 0;	1525	op->nrof = 0;
1656	if (tmp)	1526	if (tmp)
1657	{
1658	esrv_del_item (tmp->contr, op->count);	1527	esrv_del_item (tmp->contr, op->count);
1659	}
1660	}	1528	}
1661	}	1529	}
1662	else	1530	else
1663	{	1531	{
1664	object *above = op->above;	1532	object *above = op->above;
…		…
1670	op->remove ();	1538	op->remove ();
1671	op->nrof = 0;	1539	op->nrof = 0;
1672	}	1540	}
1673		1541
1674	/* Since we just removed op, op->above is null */	1542	/* Since we just removed op, op->above is null */
1675	for (tmp = above; tmp != NULL; tmp = tmp->above)	1543	for (tmp = above; tmp; tmp = tmp->above)
1676	if (tmp->type == PLAYER)	1544	if (tmp->type == PLAYER)
1677	{	1545	{
1678	if (op->nrof)	1546	if (op->nrof)
1679	esrv_send_item (tmp, op);	1547	esrv_send_item (tmp, op);
1680	else	1548	else
…		…
1685	if (op->nrof)	1553	if (op->nrof)
1686	return op;	1554	return op;
1687	else	1555	else
1688	{	1556	{
1689	op->destroy ();	1557	op->destroy ();
1690	return NULL;	1558	return 0;
1691	}	1559	}
1692	}	1560	}
1693		1561
1694	/*	1562	/*
1695	* add_weight(object, weight) adds the specified weight to an object,	1563	* add_weight(object, weight) adds the specified weight to an object,
…		…
1755	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1623	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1756	CLEAR_FLAG (op, FLAG_REMOVED);	1624	CLEAR_FLAG (op, FLAG_REMOVED);
1757	if (op->nrof)	1625	if (op->nrof)
1758	{	1626	{
1759	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1627	for (tmp = inv; tmp != NULL; tmp = tmp->below)
1760	if (CAN_MERGE (tmp, op))	1628	if (object::can_merge (tmp, op))
1761	{	1629	{
1762	/* return the original object and remove inserted object	1630	/* return the original object and remove inserted object
1763	(client needs the original object) */	1631	(client needs the original object) */
1764	tmp->nrof += op->nrof;	1632	tmp->nrof += op->nrof;
1765	/* Weight handling gets pretty funky. Since we are adding to	1633	/* Weight handling gets pretty funky. Since we are adding to
…		…
1783	add_weight (this, op->weight * op->nrof);	1651	add_weight (this, op->weight * op->nrof);
1784	}	1652	}
1785	else	1653	else
1786	add_weight (this, (op->weight + op->carrying));	1654	add_weight (this, (op->weight + op->carrying));
1787		1655
1788	otmp = is_player_inv (this);	1656	otmp = this->in_player ();
1789	if (otmp && otmp->contr)	1657	if (otmp && otmp->contr)
1790	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1658	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1791	fix_player (otmp);	1659	otmp->update_stats ();
1792		1660
1793	op->map = NULL;	1661	op->map = 0;
1794	op->env = this;	1662	op->env = this;
1795	op->above = NULL;	1663	op->above = 0;
1796	op->below = NULL;	1664	op->below = 0;
1797	op->x = 0, op->y = 0;	1665	op->x = 0, op->y = 0;
1798		1666
1799	/* reset the light list and los of the players on the map */	1667	/* reset the light list and los of the players on the map */
1800	if ((op->glow_radius != 0) && map)	1668	if ((op->glow_radius != 0) && map)
1801	{	1669	{
1802	#ifdef DEBUG_LIGHTS	1670	#ifdef DEBUG_LIGHTS
1803	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1671	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1804	#endif /* DEBUG_LIGHTS */	1672	#endif /* DEBUG_LIGHTS */
1805	if (MAP_DARKNESS (map))	1673	if (map->darkness)
1806	update_all_los (map, x, y);	1674	update_all_los (map, x, y);
1807	}	1675	}
1808		1676
1809	/* Client has no idea of ordering so lets not bother ordering it here.	1677	/* Client has no idea of ordering so lets not bother ordering it here.
1810	* It sure simplifies this function...	1678	* It sure simplifies this function...
…		…
1815	{	1683	{
1816	op->below = inv;	1684	op->below = inv;
1817	op->below->above = op;	1685	op->below->above = op;
1818	inv = op;	1686	inv = op;
1819	}	1687	}
		1688
		1689	INVOKE_OBJECT (INSERT, this);
1820		1690
1821	return op;	1691	return op;
1822	}	1692	}
1823		1693
1824	/*	1694	/*
…		…
1839	*	1709	*
1840	* MSW 2001-07-08: Check all objects on space, not just those below	1710	* MSW 2001-07-08: Check all objects on space, not just those below
1841	* object being inserted. insert_ob_in_map may not put new objects	1711	* object being inserted. insert_ob_in_map may not put new objects
1842	* on top.	1712	* on top.
1843	*/	1713	*/
1844
1845	int	1714	int
1846	check_move_on (object *op, object *originator)	1715	check_move_on (object *op, object *originator)
1847	{	1716	{
1848	object *tmp;	1717	object *tmp;
1849	maptile *m = op->map;	1718	maptile *m = op->map;
…		…
1876		1745
1877	/* The objects have to be checked from top to bottom.	1746	/* The objects have to be checked from top to bottom.
1878	* Hence, we first go to the top:	1747	* Hence, we first go to the top:
1879	*/	1748	*/
1880		1749
1881	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)	1750	for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1882	{	1751	{
1883	/* Trim the search when we find the first other spell effect	1752	/* Trim the search when we find the first other spell effect
1884	* this helps performance so that if a space has 50 spell objects,	1753	* this helps performance so that if a space has 50 spell objects,
1885	* we don't need to check all of them.	1754	* we don't need to check all of them.
1886	*/	1755	*/
…		…
1941	/*	1810	/*
1942	* present_arch(arch, map, x, y) searches for any objects with	1811	* present_arch(arch, map, x, y) searches for any objects with
1943	* a matching archetype at the given map and coordinates.	1812	* a matching archetype at the given map and coordinates.
1944	* The first matching object is returned, or NULL if none.	1813	* The first matching object is returned, or NULL if none.
1945	*/	1814	*/
1946
1947	object *	1815	object *
1948	present_arch (const archetype *at, maptile *m, int x, int y)	1816	present_arch (const archetype *at, maptile *m, int x, int y)
1949	{	1817	{
1950	object *
1951	tmp;
1952
1953	if (m == NULL || out_of_map (m, x, y))	1818	if (!m || out_of_map (m, x, y))
1954	{	1819	{
1955	LOG (llevError, "Present_arch called outside map.\n");	1820	LOG (llevError, "Present_arch called outside map.\n");
1956	return NULL;	1821	return NULL;
1957	}	1822	}
1958	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1823
		1824	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1959	if (tmp->arch == at)	1825	if (tmp->arch == at)
1960	return tmp;	1826	return tmp;
		1827
1961	return NULL;	1828	return NULL;
1962	}	1829	}
1963		1830
1964	/*	1831	/*
1965	* present(type, map, x, y) searches for any objects with	1832	* present(type, map, x, y) searches for any objects with
1966	* a matching type variable at the given map and coordinates.	1833	* a matching type variable at the given map and coordinates.
1967	* The first matching object is returned, or NULL if none.	1834	* The first matching object is returned, or NULL if none.
1968	*/	1835	*/
1969
1970	object *	1836	object *
1971	present (unsigned char type, maptile *m, int x, int y)	1837	present (unsigned char type, maptile *m, int x, int y)
1972	{	1838	{
1973	object *
1974	tmp;
1975
1976	if (out_of_map (m, x, y))	1839	if (out_of_map (m, x, y))
1977	{	1840	{
1978	LOG (llevError, "Present called outside map.\n");	1841	LOG (llevError, "Present called outside map.\n");
1979	return NULL;	1842	return NULL;
1980	}	1843	}
1981	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)	1844
		1845	for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1982	if (tmp->type == type)	1846	if (tmp->type == type)
1983	return tmp;	1847	return tmp;
		1848
1984	return NULL;	1849	return NULL;
1985	}	1850	}
1986		1851
1987	/*	1852	/*
1988	* present_in_ob(type, object) searches for any objects with	1853	* present_in_ob(type, object) searches for any objects with
1989	* a matching type variable in the inventory of the given object.	1854	* a matching type variable in the inventory of the given object.
1990	* The first matching object is returned, or NULL if none.	1855	* The first matching object is returned, or NULL if none.
1991	*/	1856	*/
1992
1993	object *	1857	object *
1994	present_in_ob (unsigned char type, const object *op)	1858	present_in_ob (unsigned char type, const object *op)
1995	{	1859	{
1996	object *
1997	tmp;
1998
1999	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1860	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2000	if (tmp->type == type)	1861	if (tmp->type == type)
2001	return tmp;	1862	return tmp;
		1863
2002	return NULL;	1864	return NULL;
2003	}	1865	}
2004		1866
2005	/*	1867	/*
2006	* present_in_ob (type, str, object) searches for any objects with	1868	* present_in_ob (type, str, object) searches for any objects with
…		…
2014	* str is the string to match against. Note that we match against	1876	* str is the string to match against. Note that we match against
2015	* the object name, not the archetype name. this is so that the	1877	* the object name, not the archetype name. this is so that the
2016	* spell code can use one object type (force), but change it's name	1878	* spell code can use one object type (force), but change it's name
2017	* to be unique.	1879	* to be unique.
2018	*/	1880	*/
2019
2020	object *	1881	object *
2021	present_in_ob_by_name (int type, const char *str, const object *op)	1882	present_in_ob_by_name (int type, const char *str, const object *op)
2022	{	1883	{
2023	object *
2024	tmp;
2025
2026	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1884	for (object *tmp = op->inv; tmp; tmp = tmp->below)
2027	{
2028	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))	1885	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2029	return tmp;	1886	return tmp;
2030	}	1887
2031	return NULL;	1888	return 0;
2032	}	1889	}
2033		1890
2034	/*	1891	/*
2035	* present_arch_in_ob(archetype, object) searches for any objects with	1892	* present_arch_in_ob(archetype, object) searches for any objects with
2036	* a matching archetype in the inventory of the given object.	1893	* a matching archetype in the inventory of the given object.
2037	* The first matching object is returned, or NULL if none.	1894	* The first matching object is returned, or NULL if none.
2038	*/	1895	*/
2039
2040	object *	1896	object *
2041	present_arch_in_ob (const archetype *at, const object *op)	1897	present_arch_in_ob (const archetype *at, const object *op)
2042	{	1898	{
2043	object *
2044	tmp;
2045
2046	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1899	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2047	if (tmp->arch == at)	1900	if (tmp->arch == at)
2048	return tmp;	1901	return tmp;
		1902
2049	return NULL;	1903	return NULL;
2050	}	1904	}
2051		1905
2052	/*	1906	/*
2053	* activate recursively a flag on an object inventory	1907	* activate recursively a flag on an object inventory
2054	*/	1908	*/
2055	void	1909	void
2056	flag_inv (object *op, int flag)	1910	flag_inv (object *op, int flag)
2057	{	1911	{
2058	object *
2059	tmp;
2060
2061	if (op->inv)	1912	if (op->inv)
2062	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1913	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2063	{	1914	{
2064	SET_FLAG (tmp, flag);	1915	SET_FLAG (tmp, flag);
2065	flag_inv (tmp, flag);	1916	flag_inv (tmp, flag);
2066	}	1917	}
2067	} /*	1918	}
		1919
		1920	/*
2068	* desactivate recursively a flag on an object inventory	1921	* deactivate recursively a flag on an object inventory
2069	*/	1922	*/
2070	void	1923	void
2071	unflag_inv (object *op, int flag)	1924	unflag_inv (object *op, int flag)
2072	{	1925	{
2073	object *
2074	tmp;
2075
2076	if (op->inv)	1926	if (op->inv)
2077	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1927	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2078	{	1928	{
2079	CLEAR_FLAG (tmp, flag);	1929	CLEAR_FLAG (tmp, flag);
2080	unflag_inv (tmp, flag);	1930	unflag_inv (tmp, flag);
2081	}	1931	}
2082	}	1932	}
…		…
2085	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in	1935	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2086	* all it's inventory (recursively).	1936	* all it's inventory (recursively).
2087	* If checksums are used, a player will get set_cheat called for	1937	* If checksums are used, a player will get set_cheat called for
2088	* him/her-self and all object carried by a call to this function.	1938	* him/her-self and all object carried by a call to this function.
2089	*/	1939	*/
2090
2091	void	1940	void
2092	set_cheat (object *op)	1941	set_cheat (object *op)
2093	{	1942	{
2094	SET_FLAG (op, FLAG_WAS_WIZ);	1943	SET_FLAG (op, FLAG_WAS_WIZ);
2095	flag_inv (op, FLAG_WAS_WIZ);	1944	flag_inv (op, FLAG_WAS_WIZ);
…		…
2114	* because arch_blocked (now ob_blocked) needs to know the movement type	1963	* because arch_blocked (now ob_blocked) needs to know the movement type
2115	* to know if the space in question will block the object. We can't use	1964	* to know if the space in question will block the object. We can't use
2116	* the archetype because that isn't correct if the monster has been	1965	* the archetype because that isn't correct if the monster has been
2117	* customized, changed states, etc.	1966	* customized, changed states, etc.
2118	*/	1967	*/
2119
2120	int	1968	int
2121	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)	1969	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2122	{	1970	{
2123	int
2124	i,
2125	index = 0, flag;	1971	int index = 0, flag;
2126	static int
2127	altern[SIZEOFFREE];	1972	int altern[SIZEOFFREE];
2128		1973
2129	for (i = start; i < stop; i++)	1974	for (int i = start; i < stop; i++)
2130	{	1975	{
2131	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1976	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2132	if (!flag)	1977	if (!flag)
2133	altern[index++] = i;	1978	altern [index++] = i;
2134		1979
2135	/* Basically, if we find a wall on a space, we cut down the search size.	1980	/* Basically, if we find a wall on a space, we cut down the search size.
2136	* In this way, we won't return spaces that are on another side of a wall.	1981	* In this way, we won't return spaces that are on another side of a wall.
2137	* This mostly work, but it cuts down the search size in all directions -	1982	* This mostly work, but it cuts down the search size in all directions -
2138	* if the space being examined only has a wall to the north and empty	1983	* if the space being examined only has a wall to the north and empty
2139	* spaces in all the other directions, this will reduce the search space	1984	* spaces in all the other directions, this will reduce the search space
2140	* to only the spaces immediately surrounding the target area, and	1985	* to only the spaces immediately surrounding the target area, and
2141	* won't look 2 spaces south of the target space.	1986	* won't look 2 spaces south of the target space.
2142	*/	1987	*/
2143	else if ((flag & AB_NO_PASS) && maxfree[i] < stop)	1988	else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2144	stop = maxfree[i];	1989	stop = maxfree[i];
2145	}	1990	}
		1991
2146	if (!index)	1992	if (!index)
2147	return -1;	1993	return -1;
		1994
2148	return altern[RANDOM () % index];	1995	return altern[RANDOM () % index];
2149	}	1996	}
2150		1997
2151	/*	1998	/*
2152	* find_first_free_spot(archetype, maptile, x, y) works like	1999	* find_first_free_spot(archetype, maptile, x, y) works like
2153	* find_free_spot(), but it will search max number of squares.	2000	* find_free_spot(), but it will search max number of squares.
2154	* But it will return the first available spot, not a random choice.	2001	* But it will return the first available spot, not a random choice.
2155	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2002	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2156	*/	2003	*/
2157
2158	int	2004	int
2159	find_first_free_spot (const object *ob, maptile *m, int x, int y)	2005	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2160	{	2006	{
2161	int
2162	i;
2163
2164	for (i = 0; i < SIZEOFFREE; i++)	2007	for (int i = 0; i < SIZEOFFREE; i++)
2165	{
2166	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2008	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2167	return i;	2009	return i;
2168	}	2010
2169	return -1;	2011	return -1;
2170	}	2012	}
2171		2013
2172	/*	2014	/*
2173	* The function permute(arr, begin, end) randomly reorders the array	2015	* The function permute(arr, begin, end) randomly reorders the array
2174	* arr[begin..end-1].	2016	* arr[begin..end-1].
		2017	* now uses a fisher-yates shuffle, old permute was broken
2175	*/	2018	*/
2176	static void	2019	static void
2177	permute (int *arr, int begin, int end)	2020	permute (int *arr, int begin, int end)
2178	{	2021	{
2179	int	2022	arr += begin;
2180	i,
2181	j,
2182	tmp,
2183	len;
2184
2185	len = end - begin;	2023	end -= begin;
2186	for (i = begin; i < end; i++)
2187	{
2188	j = begin + RANDOM () % len;
2189		2024
2190	tmp = arr[i];	2025	while (--end)
2191	arr[i] = arr[j];	2026	swap (arr [end], arr [RANDOM () % (end + 1)]);
2192	arr[j] = tmp;
2193	}
2194	}	2027	}
2195		2028
2196	/* new function to make monster searching more efficient, and effective!	2029	/* new function to make monster searching more efficient, and effective!
2197	* This basically returns a randomized array (in the passed pointer) of	2030	* This basically returns a randomized array (in the passed pointer) of
2198	* the spaces to find monsters. In this way, it won't always look for	2031	* the spaces to find monsters. In this way, it won't always look for
…		…
2201	* the 3x3 area will be searched, just not in a predictable order.	2034	* the 3x3 area will be searched, just not in a predictable order.
2202	*/	2035	*/
2203	void	2036	void
2204	get_search_arr (int *search_arr)	2037	get_search_arr (int *search_arr)
2205	{	2038	{
2206	int	2039	int i;
2207	i;
2208		2040
2209	for (i = 0; i < SIZEOFFREE; i++)	2041	for (i = 0; i < SIZEOFFREE; i++)
2210	{
2211	search_arr[i] = i;	2042	search_arr[i] = i;
2212	}
2213		2043
2214	permute (search_arr, 1, SIZEOFFREE1 + 1);	2044	permute (search_arr, 1, SIZEOFFREE1 + 1);
2215	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);	2045	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2216	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);	2046	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2217	}	2047	}
…		…
2226	* Perhaps incorrectly, but I'm making the assumption that exclude	2056	* Perhaps incorrectly, but I'm making the assumption that exclude
2227	* is actually want is going to try and move there. We need this info	2057	* is actually want is going to try and move there. We need this info
2228	* because we have to know what movement the thing looking to move	2058	* because we have to know what movement the thing looking to move
2229	* there is capable of.	2059	* there is capable of.
2230	*/	2060	*/
2231
2232	int	2061	int
2233	find_dir (maptile *m, int x, int y, object *exclude)	2062	find_dir (maptile *m, int x, int y, object *exclude)
2234	{	2063	{
2235	int
2236	i,
2237	max = SIZEOFFREE, mflags;	2064	int i, max = SIZEOFFREE, mflags;
2238		2065
2239	sint16 nx, ny;	2066	sint16 nx, ny;
2240	object *	2067	object *tmp;
2241	tmp;
2242	maptile *	2068	maptile *mp;
2243	mp;
2244		2069
2245	MoveType blocked, move_type;	2070	MoveType blocked, move_type;
2246		2071
2247	if (exclude && exclude->head)	2072	if (exclude && exclude->head)
2248	{	2073	{
…		…
2260	mp = m;	2085	mp = m;
2261	nx = x + freearr_x[i];	2086	nx = x + freearr_x[i];
2262	ny = y + freearr_y[i];	2087	ny = y + freearr_y[i];
2263		2088
2264	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);	2089	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2090
2265	if (mflags & P_OUT_OF_MAP)	2091	if (mflags & P_OUT_OF_MAP)
2266	{
2267	max = maxfree[i];	2092	max = maxfree[i];
2268	}
2269	else	2093	else
2270	{	2094	{
2271	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);	2095	mapspace &ms = mp->at (nx, ny);
		2096
		2097	blocked = ms.move_block;
2272		2098
2273	if ((move_type & blocked) == move_type)	2099	if ((move_type & blocked) == move_type)
2274	{
2275	max = maxfree[i];	2100	max = maxfree[i];
2276	}
2277	else if (mflags & P_IS_ALIVE)	2101	else if (mflags & P_IS_ALIVE)
2278	{	2102	{
2279	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)	2103	for (tmp = ms.bot; tmp; tmp = tmp->above)
2280	{	2104	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2281	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))	2105	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))
2282	{
2283	break;	2106	break;
2284	}	2107
2285	}
2286	if (tmp)	2108	if (tmp)
2287	{
2288	return freedir[i];	2109	return freedir[i];
2289	}
2290	}	2110	}
2291	}	2111	}
2292	}	2112	}
		2113
2293	return 0;	2114	return 0;
2294	}	2115	}
2295		2116
2296	/*	2117	/*
2297	* distance(object 1, object 2) will return the square of the	2118	* distance(object 1, object 2) will return the square of the
2298	* distance between the two given objects.	2119	* distance between the two given objects.
2299	*/	2120	*/
2300
2301	int	2121	int
2302	distance (const object *ob1, const object *ob2)	2122	distance (const object *ob1, const object *ob2)
2303	{	2123	{
2304	int
2305	i;
2306
2307	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);	2124	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2308	return i;
2309	}	2125	}
2310		2126
2311	/*	2127	/*
2312	* find_dir_2(delta-x,delta-y) will return a direction in which	2128	* find_dir_2(delta-x,delta-y) will return a direction in which
2313	* an object which has subtracted the x and y coordinates of another	2129	* an object which has subtracted the x and y coordinates of another
2314	* object, needs to travel toward it.	2130	* object, needs to travel toward it.
2315	*/	2131	*/
2316
2317	int	2132	int
2318	find_dir_2 (int x, int y)	2133	find_dir_2 (int x, int y)
2319	{	2134	{
2320	int	2135	int q;
2321	q;
2322		2136
2323	if (y)	2137	if (y)
2324	q = x * 100 / y;	2138	q = x * 100 / y;
2325	else if (x)	2139	else if (x)
2326	q = -300 * x;	2140	q = -300 * x;
…		…
2361	int	2175	int
2362	absdir (int d)	2176	absdir (int d)
2363	{	2177	{
2364	while (d < 1)	2178	while (d < 1)
2365	d += 8;	2179	d += 8;
		2180
2366	while (d > 8)	2181	while (d > 8)
2367	d -= 8;	2182	d -= 8;
		2183
2368	return d;	2184	return d;
2369	}	2185	}
2370		2186
2371	/*	2187	/*
2372	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2188	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
…		…
2374	*/	2190	*/
2375		2191
2376	int	2192	int
2377	dirdiff (int dir1, int dir2)	2193	dirdiff (int dir1, int dir2)
2378	{	2194	{
2379	int	2195	int d;
2380	d;
2381		2196
2382	d = abs (dir1 - dir2);	2197	d = abs (dir1 - dir2);
2383	if (d > 4)	2198	if (d > 4)
2384	d = 8 - d;	2199	d = 8 - d;
		2200
2385	return d;	2201	return d;
2386	}	2202	}
2387		2203
2388	/* peterm:	2204	/* peterm:
2389	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2205	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2392	* This basically means that if direction is 15, then it could either go	2208	* This basically means that if direction is 15, then it could either go
2393	* direction 4, 14, or 16 to get back to where we are.	2209	* direction 4, 14, or 16 to get back to where we are.
2394	* Moved from spell_util.c to object.c with the other related direction	2210	* Moved from spell_util.c to object.c with the other related direction
2395	* functions.	2211	* functions.
2396	*/	2212	*/
2397
2398	int
2399	reduction_dir[SIZEOFFREE][3] = {	2213	int reduction_dir[SIZEOFFREE][3] = {
2400	{0, 0, 0}, /* 0 */	2214	{0, 0, 0}, /* 0 */
2401	{0, 0, 0}, /* 1 */	2215	{0, 0, 0}, /* 1 */
2402	{0, 0, 0}, /* 2 */	2216	{0, 0, 0}, /* 2 */
2403	{0, 0, 0}, /* 3 */	2217	{0, 0, 0}, /* 3 */
2404	{0, 0, 0}, /* 4 */	2218	{0, 0, 0}, /* 4 */
…		…
2452	* find a path to that monster that we found. If not,	2266	* find a path to that monster that we found. If not,
2453	* we don't bother going toward it. Returns 1 if we	2267	* we don't bother going toward it. Returns 1 if we
2454	* can see a direct way to get it	2268	* can see a direct way to get it
2455	* Modified to be map tile aware -.MSW	2269	* Modified to be map tile aware -.MSW
2456	*/	2270	*/
2457
2458
2459	int	2271	int
2460	can_see_monsterP (maptile *m, int x, int y, int dir)	2272	can_see_monsterP (maptile *m, int x, int y, int dir)
2461	{	2273	{
2462	sint16 dx, dy;	2274	sint16 dx, dy;
2463	int
2464	mflags;	2275	int mflags;
2465		2276
2466	if (dir < 0)	2277	if (dir < 0)
2467	return 0; /* exit condition: invalid direction */	2278	return 0; /* exit condition: invalid direction */
2468		2279
2469	dx = x + freearr_x[dir];	2280	dx = x + freearr_x[dir];
…		…
2482	return 0;	2293	return 0;
2483		2294
2484	/* yes, can see. */	2295	/* yes, can see. */
2485	if (dir < 9)	2296	if (dir < 9)
2486	return 1;	2297	return 1;
		2298
2487	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |	2299	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2488	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);	2300	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
		2301	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2489	}	2302	}
2490
2491
2492		2303
2493	/*	2304	/*
2494	* can_pick(picker, item): finds out if an object is possible to be	2305	* can_pick(picker, item): finds out if an object is possible to be
2495	* picked up by the picker. Returnes 1 if it can be	2306	* picked up by the picker. Returnes 1 if it can be
2496	* picked up, otherwise 0.	2307	* picked up, otherwise 0.
…		…
2507	return /*QUERY_FLAG(who,FLAG_WIZ)|| */	2318	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2508	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2319	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2509	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));	2320	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2510	}	2321	}
2511		2322
2512
2513	/*	2323	/*
2514	* create clone from object to another	2324	* create clone from object to another
2515	*/	2325	*/
2516	object *	2326	object *
2517	object_create_clone (object *asrc)	2327	object_create_clone (object *asrc)
…		…
2536	{	2346	{
2537	dst = tmp;	2347	dst = tmp;
2538	tmp->head = 0;	2348	tmp->head = 0;
2539	}	2349	}
2540	else	2350	else
2541	{
2542	tmp->head = dst;	2351	tmp->head = dst;
2543	}
2544		2352
2545	tmp->more = 0;	2353	tmp->more = 0;
2546		2354
2547	if (prev)	2355	if (prev)
2548	prev->more = tmp;	2356	prev->more = tmp;
…		…
2560	/* Basically, we save the content of the string to a temp file, then call */	2368	/* Basically, we save the content of the string to a temp file, then call */
2561	/* load_object on it. I admit it is a highly inefficient way to make things, */	2369	/* load_object on it. I admit it is a highly inefficient way to make things, */
2562	/* but it was simple to make and allows reusing the load_object function. */	2370	/* but it was simple to make and allows reusing the load_object function. */
2563	/* Remember not to use load_object_str in a time-critical situation. */	2371	/* Remember not to use load_object_str in a time-critical situation. */
2564	/* Also remember that multiparts objects are not supported for now. */	2372	/* Also remember that multiparts objects are not supported for now. */
2565
2566	object *	2373	object *
2567	load_object_str (const char *obstr)	2374	load_object_str (const char *obstr)
2568	{	2375	{
2569	object *op;	2376	object *op;
2570	char filename[MAX_BUF];	2377	char filename[MAX_BUF];
…		…
2600	* returns NULL if no match.	2407	* returns NULL if no match.
2601	*/	2408	*/
2602	object *	2409	object *
2603	find_obj_by_type_subtype (const object *who, int type, int subtype)	2410	find_obj_by_type_subtype (const object *who, int type, int subtype)
2604	{	2411	{
2605	object *tmp;
2606
2607	for (tmp = who->inv; tmp; tmp = tmp->below)	2412	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2608	if (tmp->type == type && tmp->subtype == subtype)	2413	if (tmp->type == type && tmp->subtype == subtype)
2609	return tmp;	2414	return tmp;
2610		2415
2611	return NULL;	2416	return 0;
2612	}	2417	}
2613		2418
2614	/* If ob has a field named key, return the link from the list,	2419	/* If ob has a field named key, return the link from the list,
2615	* otherwise return NULL.	2420	* otherwise return NULL.
2616	*	2421	*
…		…
2618	* do the desired thing.	2423	* do the desired thing.
2619	*/	2424	*/
2620	key_value *	2425	key_value *
2621	get_ob_key_link (const object *ob, const char *key)	2426	get_ob_key_link (const object *ob, const char *key)
2622	{	2427	{
2623	key_value *link;
2624
2625	for (link = ob->key_values; link != NULL; link = link->next)	2428	for (key_value *link = ob->key_values; link; link = link->next)
2626	if (link->key == key)	2429	if (link->key == key)
2627	return link;	2430	return link;
2628		2431
2629	return NULL;	2432	return 0;
2630	}	2433	}
2631		2434
2632	/*	2435	/*
2633	* Returns the value of op has an extra_field for key, or NULL.	2436	* Returns the value of op has an extra_field for key, or NULL.
2634	*	2437	*
…		…
2674	* Returns TRUE on success.	2477	* Returns TRUE on success.
2675	*/	2478	*/
2676	int	2479	int
2677	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)	2480	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2678	{	2481	{
2679	key_value *
2680	field = NULL, *last = NULL;	2482	key_value *field = NULL, *last = NULL;
2681		2483
2682	for (field = op->key_values; field != NULL; field = field->next)	2484	for (field = op->key_values; field != NULL; field = field->next)
2683	{	2485	{
2684	if (field->key != canonical_key)	2486	if (field->key != canonical_key)
2685	{	2487	{
…		…
2713	/* IF we get here, key doesn't exist */	2515	/* IF we get here, key doesn't exist */
2714		2516
2715	/* No field, we'll have to add it. */	2517	/* No field, we'll have to add it. */
2716		2518
2717	if (!add_key)	2519	if (!add_key)
2718	{
2719	return FALSE;	2520	return FALSE;
2720	}	2521
2721	/* There isn't any good reason to store a null	2522	/* There isn't any good reason to store a null
2722	* value in the key/value list. If the archetype has	2523	* value in the key/value list. If the archetype has
2723	* this key, then we should also have it, so shouldn't	2524	* this key, then we should also have it, so shouldn't
2724	* be here. If user wants to store empty strings,	2525	* be here. If user wants to store empty strings,
2725	* should pass in ""	2526	* should pass in ""
…		…
2774	}	2575	}
2775	else	2576	else
2776	item = item->env;	2577	item = item->env;
2777	}	2578	}
2778		2579
		2580
		2581	const char *
		2582	object::flag_desc (char *desc, int len) const
		2583	{
		2584	char *p = desc;
		2585	bool first = true;
		2586
		2587	*p = 0;
		2588
		2589	for (int i = 0; i < NUM_FLAGS; i++)
		2590	{
		2591	if (len <= 10) // magic constant!
		2592	{
		2593	snprintf (p, len, ",...");
		2594	break;
		2595	}
		2596
		2597	if (flag [i])
		2598	{
		2599	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2600	len -= cnt;
		2601	p += cnt;
		2602	first = false;
		2603	}
		2604	}
		2605
		2606	return desc;
		2607	}
		2608
2779	// return a suitable string describing an objetc in enough detail to find it	2609	// return a suitable string describing an object in enough detail to find it
2780	const char *	2610	const char *
2781	object::debug_desc (char *info) const	2611	object::debug_desc (char *info) const
2782	{	2612	{
		2613	char flagdesc[512];
2783	char info2[256 * 3];	2614	char info2[256 * 4];
2784	char *p = info;	2615	char *p = info;
2785		2616
2786	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2617	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",
2787	count,	2618	count, uuid.seq,
2788	&name,	2619	&name,
2789	title ? " " : "",	2620	title ? "\",title:" : "",
2790	title ? (const char *)title : "");	2621	title ? (const char *)title : "",
		2622	flag_desc (flagdesc, 512), type);
2791		2623
2792	if (env)	2624	if (env)
2793	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2625	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2794		2626
2795	if (map)	2627	if (map)
2796	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2628	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2797		2629
2798	return info;	2630	return info;
2799	}	2631	}
2800		2632
2801	const char *	2633	const char *
2802	object::debug_desc () const	2634	object::debug_desc () const
2803	{	2635	{
2804	static char info[256 * 3];	2636	static char info[256 * 4];
2805	return debug_desc (info);	2637	return debug_desc (info);
2806	}	2638	}
2807		2639

Diff Legend

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