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.63 by root, Tue Dec 12 20:53:02 2006 UTC vs.
Revision 1.164 by root, Thu Jul 5 08:10:29 2007 UTC

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

Diff Legend

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