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.5 by root, Sun Aug 27 16:15:11 2006 UTC vs.
Revision 1.53 by root, Tue Nov 7 16:30:54 2006 UTC

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

Diff Legend

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