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.26 by root, Mon Sep 11 11:46:52 2006 UTC vs.
Revision 1.124 by root, Sat Jan 27 02:19:36 2007 UTC

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

Diff Legend

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