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.7 by root, Tue Aug 29 05:03:54 2006 UTC vs.
Revision 1.28 by root, Mon Sep 11 12:10:21 2006 UTC

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

Diff Legend

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