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

Diff Legend

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