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.68 by root, Mon Dec 18 02:35:00 2006 UTC vs.
Revision 1.203 by root, Fri Apr 11 13:59:05 2008 UTC

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

Diff Legend

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