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.2 by root, Fri Aug 25 17:11:52 2006 UTC vs.
Revision 1.32 by root, Mon Sep 11 23:53:30 2006 UTC

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

Diff Legend

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