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.44 by root, Thu Sep 14 17:29:27 2006 UTC vs.
Revision 1.142 by root, Mon Apr 30 04:25:29 2007 UTC

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