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

Diff Legend

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