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.19 by root, Fri Sep 8 17:14:07 2006 UTC vs.
Revision 1.41 by root, Thu Sep 14 01:12:28 2006 UTC

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

Diff Legend

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