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

Diff Legend

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