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.40 by root, Thu Sep 14 00:07:15 2006 UTC vs.
Revision 1.139 by root, Sat Apr 21 17:34:22 2007 UTC

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

Diff Legend

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