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.64 by root, Tue Dec 12 21:39:56 2006 UTC vs.
Revision 1.145 by root, Mon May 7 03:05:58 2007 UTC

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

Diff Legend

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