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.57 by root, Sun Dec 3 02:46:33 2006 UTC vs.
Revision 1.183 by root, Mon Aug 20 19:13:10 2007 UTC

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

Diff Legend

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