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.10 by root, Thu Aug 31 17:54:14 2006 UTC vs.
Revision 1.24 by root, Sun Sep 10 16:00:23 2006 UTC

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

Diff Legend

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