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.27 by root, Mon Sep 11 12:08:45 2006 UTC vs.
Revision 1.146 by root, Fri May 11 21:07:13 2007 UTC

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

Diff Legend

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