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.28 by root, Mon Sep 11 12:10:21 2006 UTC vs.
Revision 1.141 by root, Sun Apr 29 21:44:34 2007 UTC

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

Diff Legend

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