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.15 by root, Mon Sep 4 13:55:54 2006 UTC vs.
Revision 1.25 by root, Mon Sep 11 01:16:20 2006 UTC

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

Diff Legend

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