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

Diff Legend

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