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.18 by root, Fri Sep 8 16:51:42 2006 UTC vs.
Revision 1.42 by root, Thu Sep 14 01:19:47 2006 UTC

1	/*
2	* static char *rcsid_object_c =
3	* "$Id: object.C,v 1.18 2006/09/08 16:51:42 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
…		…
624		685
625	update_ob_speed (op);	686	update_ob_speed (op);
626	}	687	}
627		688
628	/*	689	/*
629	* get_object() grabs an object from the list of unused objects, makes
630	* sure it is initialised, and returns it.
631	* If there are no free objects, expand_objects() is called to get more.
632	*/
633
634	object *get_object ()
635	{
636	object *op = new object;
637
638	op->count = ++ob_count;
639
640	op->next = objects;
641
642	if (objects)
643	objects->prev = op;
644
645	objects = op;
646
647	SET_FLAG (op, FLAG_REMOVED);
648
649	op->expmul = 1.0;
650	op->face = blank_face;
651	op->attacked_by_count = -1;
652
653	return op;
654	}
655
656	/*
657	* 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
658	* 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
659	* 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.
660	*/	693	*/
661		694
		695	void
662	void update_turn_face(object *op) {	696	update_turn_face (object *op)
		697	{
663	if(!QUERY_FLAG(op,FLAG_IS_TURNABLE)||op->arch==NULL)	698	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)
664	return;	699	return;
665	SET_ANIMATION(op, op->direction);	700	SET_ANIMATION (op, op->direction);
666	update_object(op,UP_OBJ_FACE);	701	update_object (op, UP_OBJ_FACE);
667	}	702	}
668		703
669	/*	704	/*
670	* 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
671	* 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.
672	* 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.
673	*/	708	*/
674		709	void
675	void update_ob_speed(object *op) {	710	update_ob_speed (object *op)
		711	{
676	extern int arch_init;	712	extern int arch_init;
677		713
678	/* No reason putting the archetypes objects on the speed list,	714	/* No reason putting the archetypes objects on the speed list,
679	* since they never really need to be updated.	715	* since they never really need to be updated.
680	*/	716	*/
681		717
682	if (QUERY_FLAG(op, FLAG_FREED) && op->speed) {	718	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
		719	{
683	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);
684	#ifdef MANY_CORES	721	#ifdef MANY_CORES
685	abort();	722	abort ();
686	#else	723	#else
687	op->speed = 0;	724	op->speed = 0;
688	#endif	725	#endif
689	}	726	}
		727
690	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)
691	return;	735	return;
692	}
693	if (FABS(op->speed)>MIN_ACTIVE_SPEED) {
694	/* If already on active list, don't do anything */
695	if (op->active_next || op->active_prev || op==active_objects)
696	return;
697		736
698	/* process_events() expects us to insert the object at the beginning	737	/* process_events() expects us to insert the object at the beginning
699	* of the list. */	738	* of the list. */
700	op->active_next = active_objects;	739	op->active_next = active_objects;
		740
701	if (op->active_next!=NULL)	741	if (op->active_next != NULL)
702	op->active_next->active_prev = op;	742	op->active_next->active_prev = op;
		743
703	active_objects = op;	744	active_objects = op;
		745	}
		746	else
704	}	747	{
705	else {
706	/* If not on the active list, nothing needs to be done */	748	/* If not on the active list, nothing needs to be done */
707	if (!op->active_next && !op->active_prev && op!=active_objects)	749	if (!op->active_next && !op->active_prev && op != active_objects)
708	return;	750	return;
709		751
710	if (op->active_prev==NULL) {	752	if (op->active_prev == NULL)
		753	{
711	active_objects = op->active_next;	754	active_objects = op->active_next;
		755
712	if (op->active_next!=NULL)	756	if (op->active_next != NULL)
713	op->active_next->active_prev = NULL;	757	op->active_next->active_prev = NULL;
		758	}
		759	else
714	}	760	{
715	else {
716	op->active_prev->active_next = op->active_next;	761	op->active_prev->active_next = op->active_next;
		762
717	if (op->active_next)	763	if (op->active_next)
718	op->active_next->active_prev = op->active_prev;	764	op->active_next->active_prev = op->active_prev;
719	}	765	}
		766
720	op->active_next = NULL;	767	op->active_next = NULL;
721	op->active_prev = NULL;	768	op->active_prev = NULL;
722	}	769	}
723	}	770	}
724		771
725	/* This function removes object 'op' from the list of active	772	/* This function removes object 'op' from the list of active
726	* objects.	773	* objects.
…		…
728	* 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
729	* in play chewing up cpu time getting processed.	776	* in play chewing up cpu time getting processed.
730	* The reverse of this is to call update_ob_speed, which	777	* The reverse of this is to call update_ob_speed, which
731	* 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.
732	*/	779	*/
		780	void
733	void remove_from_active_list(object *op)	781	remove_from_active_list (object *op)
734	{	782	{
735	/* If not on the active list, nothing needs to be done */	783	/* If not on the active list, nothing needs to be done */
736	if (!op->active_next && !op->active_prev && op!=active_objects)	784	if (!op->active_next && !op->active_prev && op != active_objects)
737	return;	785	return;
738		786
739	if (op->active_prev==NULL) {	787	if (op->active_prev == NULL)
		788	{
740	active_objects = op->active_next;	789	active_objects = op->active_next;
741	if (op->active_next!=NULL)	790	if (op->active_next != NULL)
742	op->active_next->active_prev = NULL;	791	op->active_next->active_prev = NULL;
		792	}
		793	else
743	}	794	{
744	else {
745	op->active_prev->active_next = op->active_next;	795	op->active_prev->active_next = op->active_next;
746	if (op->active_next)	796	if (op->active_next)
747	op->active_next->active_prev = op->active_prev;	797	op->active_next->active_prev = op->active_prev;
748	}	798	}
749	op->active_next = NULL;	799	op->active_next = NULL;
750	op->active_prev = NULL;	800	op->active_prev = NULL;
751	}	801	}
752		802
753	/*	803	/*
754	* update_object() updates the array which represents the map.	804	* update_object() updates the array which represents the map.
755	* It takes into account invisible objects (and represent squares covered	805	* It takes into account invisible objects (and represent squares covered
…		…
770	* 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
771	* 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.
772	* UP_OBJ_FACE: only the objects face has changed.	822	* UP_OBJ_FACE: only the objects face has changed.
773	*/	823	*/
774		824
		825	void
775	void update_object(object *op, int action) {	826	update_object (object *op, int action)
		827	{
776	int update_now=0, flags;	828	int update_now = 0, flags;
777	MoveType move_on, move_off, move_block, move_slow;	829	MoveType move_on, move_off, move_block, move_slow;
778		830
779	if (op == NULL) {	831	if (op == NULL)
		832	{
780	/* this should never happen */	833	/* this should never happen */
781	LOG(llevDebug,"update_object() called for NULL object.\n");	834	LOG (llevDebug, "update_object() called for NULL object.\n");
782	return;	835	return;
783	}
784		836	}
		837
785	if(op->env!=NULL) {	838	if (op->env != NULL)
		839	{
786	/* Animation is currently handled by client, so nothing	840	/* Animation is currently handled by client, so nothing
787	* to do in this case.	841	* to do in this case.
788	*/	842	*/
789	return;	843	return;
790	}	844	}
791		845
792	/* 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
793	* going to get freed anyways.	847	* going to get freed anyways.
794	*/	848	*/
795	if (!op->map || op->map->in_memory == MAP_SAVING) return;	849	if (!op->map || op->map->in_memory == MAP_SAVING)
796		850	return;
		851
797	/* make sure the object is within map boundaries */	852	/* make sure the object is within map boundaries */
798	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))
799	op->y < 0 || op->y >= MAP_HEIGHT(op->map)) {	854	{
800	LOG(llevError,"update_object() called for object out of map!\n");	855	LOG (llevError, "update_object() called for object out of map!\n");
801	#ifdef MANY_CORES	856	#ifdef MANY_CORES
802	abort();	857	abort ();
803	#endif	858	#endif
804	return;	859	return;
805	}
806		860	}
		861
807	flags = GET_MAP_FLAGS(op->map, op->x, op->y);	862	flags = GET_MAP_FLAGS (op->map, op->x, op->y);
808	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);
809	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);
810	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);
811	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);
812	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);
813		868
814	if (action == UP_OBJ_INSERT) {	869	if (action == UP_OBJ_INSERT)
		870	{
815	if (QUERY_FLAG(op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	871	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))
816	update_now=1;	872	update_now = 1;
817		873
818	if (QUERY_FLAG(op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	874	if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))
819	update_now=1;	875	update_now = 1;
820		876
821	if (QUERY_FLAG(op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	877	if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))
822	update_now=1;	878	update_now = 1;
823		879
824	if (QUERY_FLAG(op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))	880	if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
825	update_now=1;	881	update_now = 1;
826		882
		883	if (op->type == SAFE_GROUND && !(flags & P_SAFE))
		884	update_now = 1;
		885
827	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
828	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
829	/* 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
830	* to have move_allow right now.	893	* to have move_allow right now.
831	*/	894	*/
832	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	895	if (((move_block | op->move_block) & ~op->move_allow) != move_block)
833	update_now=1;	896	update_now = 1;
		897
834	if ((move_slow | op->move_slow) != move_slow) update_now=1;	898	if ((move_slow | op->move_slow) != move_slow)
		899	update_now = 1;
835	}	900	}
836	/* if the object is being removed, we can't make intelligent	901	/* if the object is being removed, we can't make intelligent
837	* decisions, because remove_ob can't really pass the object	902	* decisions, because remove_ob can't really pass the object
838	* that is being removed.	903	* that is being removed.
839	*/	904	*/
840	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) {	905	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
841	update_now=1;	906	update_now = 1;
842	} else if (action == UP_OBJ_FACE) {	907	else if (action == UP_OBJ_FACE)
843	/* Nothing to do for that case */	908	/* Nothing to do for that case */ ;
844	}
845	else {	909	else
846	LOG(llevError,"update_object called with invalid action: %d\n", action);	910	LOG (llevError, "update_object called with invalid action: %d\n", action);
847	}
848		911
849	if (update_now) {	912	if (update_now)
		913	{
850	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);
851	update_position(op->map, op->x, op->y);	915	update_position (op->map, op->x, op->y);
852	}	916	}
853		917
854	if(op->more!=NULL)	918	if (op->more != NULL)
855	update_object(op->more, action);	919	update_object (op->more, action);
856	}	920	}
857		921
		922	static unordered_vector<object *> mortals;
		923
		924	void object::free_mortals ()
		925	{
		926	for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();)
		927	if ((*i)->refcnt)
		928	++i; // further delay freeing
		929	else
		930	{
		931	delete *i;
		932	mortals.erase (i);
		933	}
		934
		935	static int lastmortals = 0;//D
		936
		937	if (mortals.size() != lastmortals)//D
		938	{
		939	lastmortals = mortals.size ();//D
		940	LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
		941	}
		942	}
		943
		944	object::object ()
		945	{
		946	SET_FLAG (this, FLAG_REMOVED);
		947
		948	expmul = 1.0;
		949	face = blank_face;
		950	attacked_by_count = -1;
		951	}
		952
		953	object::~object ()
		954	{
		955	free_key_values (this);
		956	}
		957
		958	void object::link ()
		959	{
		960	count = ++ob_count;
		961	uuid = gen_uuid ();
		962
		963	prev = 0;
		964	next = objects;
		965
		966	if (objects)
		967	objects->prev = this;
		968
		969	objects = this;
		970	}
		971
		972	void object::unlink ()
		973	{
		974	//count = 0;//D
		975	if (!prev && !next) return;//D
		976
		977	if (this == objects)
		978	objects = next;
		979
		980	/* Remove this object from the list of used objects */
		981	if (prev) prev->next = next;
		982	if (next) next->prev = prev;
		983
		984	prev = 0;
		985	next = 0;
		986	}
		987
		988	object *object::create ()
		989	{
		990	object *op = new object;
		991	op->link ();
		992	return op;
		993	}
858		994
859	/*	995	/*
860	* free_object() frees everything allocated by an object, removes	996	* free_object() frees everything allocated by an object, removes
861	* it from the list of used objects, and puts it on the list of	997	* it from the list of used objects, and puts it on the list of
862	* free objects. The IS_FREED() flag is set in the object.	998	* free objects. The IS_FREED() flag is set in the object.
…		…
864	* this function to succeed.	1000	* this function to succeed.
865	*	1001	*
866	* If free_inventory is set, free inventory as well. Else drop items in	1002	* If free_inventory is set, free inventory as well. Else drop items in
867	* inventory to the ground.	1003	* inventory to the ground.
868	*/	1004	*/
869		1005	void object::free (bool free_inventory)
870	void
871	free_object (object * ob)
872	{	1006	{
873	free_object2 (ob, 0);
874	}
875
876	void
877	free_object2 (object * ob, int free_inventory)
878	{
879	object *tmp, *op;
880
881	if (!QUERY_FLAG (ob, FLAG_REMOVED))	1007	if (QUERY_FLAG (this, FLAG_FREED))
882	{	1008	return;
883	LOG (llevDebug, "Free object called with non removed object\n");
884	dump_object (ob);
885	#ifdef MANY_CORES
886	abort ();
887	#endif
888	}
889		1009
890	if (QUERY_FLAG (ob, FLAG_FRIENDLY))	1010	if (QUERY_FLAG (this, FLAG_FRIENDLY))
891	{
892	LOG (llevMonster, "Warning: tried to free friendly object.\n");
893	remove_friendly_object (ob);	1011	remove_friendly_object (this);
894	}
895		1012
896	if (QUERY_FLAG (ob, FLAG_FREED))	1013	if (!QUERY_FLAG (this, FLAG_REMOVED))
897	{	1014	remove_ob (this);
898	dump_object (ob);	1015
899	LOG (llevError, "Trying to free freed object.\n%s\n", errmsg);	1016	SET_FLAG (this, FLAG_FREED);
900	return;	1017
		1018	if (more)
901	}	1019	{
902		1020	more->free (free_inventory);
903	if (ob->more != NULL)	1021	more = 0;
904	{	1022	}
905	free_object2 (ob->more, free_inventory);
906	ob->more = NULL;
907	}
908		1023
909	if (ob->inv)	1024	if (inv)
910	{	1025	{
911	/* Only if the space blocks everything do we not process -	1026	/* Only if the space blocks everything do we not process -
912	* if some form of movement is allowed, let objects	1027	* if some form of movement is allowed, let objects
913	* drop on that space.	1028	* drop on that space.
914	*/	1029	*/
915	if (free_inventory || ob->map == NULL	1030	if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
916	|| ob->map->in_memory != MAP_IN_MEMORY	1031	{
917	|| (GET_MAP_MOVE_BLOCK (ob->map, ob->x, ob->y) == MOVE_ALL))	1032	object *op = inv;
918	{
919	op = ob->inv;
920		1033
921	while (op != NULL)	1034	while (op)
922	{	1035	{
923	tmp = op->below;	1036	object *tmp = op->below;
924	remove_ob (op);	1037	op->free (free_inventory);
925	free_object2 (op, free_inventory);
926	op = tmp;	1038	op = tmp;
927	}	1039	}
928	}	1040	}
929	else	1041	else
930	{ /* Put objects in inventory onto this space */	1042	{ /* Put objects in inventory onto this space */
931	op = ob->inv;	1043	object *op = inv;
932		1044
933	while (op != NULL)	1045	while (op)
934	{	1046	{
935	tmp = op->below;	1047	object *tmp = op->below;
		1048
936	remove_ob (op);	1049	remove_ob (op);
937		1050
938	if (QUERY_FLAG (op, FLAG_STARTEQUIP)	1051	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
939	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE	1052	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
940	|| op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))	1053	free_object (op);
941	free_object (op);	1054	else
942	else	1055	{
943	{	1056	op->x = x;
944	op->x = ob->x;	1057	op->y = y;
945	op->y = ob->y;
946	insert_ob_in_map (op, ob->map, NULL, 0); /* Insert in same map as the envir */	1058	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
947	}	1059	}
948		1060
949	op = tmp;	1061	op = tmp;
		1062	}
		1063	}
950	}	1064	}
951	}	1065
952	}	1066	owner = 0;
953		1067
954	/* Remove object from the active list */	1068	/* Remove object from the active list */
955	ob->speed = 0;	1069	speed = 0;
956	update_ob_speed (ob);	1070	update_ob_speed (this);
957		1071
958	SET_FLAG (ob, FLAG_FREED);	1072	unlink ();
959	ob->count = 0;
960		1073
961	/* Remove this object from the list of used objects */	1074	mortals.push_back (this);
962	if (ob->prev == NULL)
963	{
964	objects = ob->next;
965
966	if (objects != NULL)
967	objects->prev = NULL;
968	}
969	else
970	{
971	ob->prev->next = ob->next;
972
973	if (ob->next != NULL)
974	ob->next->prev = ob->prev;
975	}
976
977	free_key_values (ob);
978
979	/* Now link it with the free_objects list: */
980	ob->prev = 0;
981	ob->next = 0;
982
983	delete ob;
984	}	1075	}
985		1076
986	/*	1077	/*
987	* sub_weight() recursively (outwards) subtracts a number from the	1078	* sub_weight() recursively (outwards) subtracts a number from the
988	* weight of an object (and what is carried by it's environment(s)).	1079	* weight of an object (and what is carried by it's environment(s)).
989	*/	1080	*/
990		1081
		1082	void
991	void sub_weight (object *op, signed long weight) {	1083	sub_weight (object *op, signed long weight)
		1084	{
992	while (op != NULL) {	1085	while (op != NULL)
		1086	{
993	if (op->type == CONTAINER) {	1087	if (op->type == CONTAINER)
		1088	{
994	weight=(signed long)(weight*(100-op->stats.Str)/100);	1089	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
995	}	1090	}
996	op->carrying-=weight;	1091	op->carrying -= weight;
997	op = op->env;	1092	op = op->env;
998	}	1093	}
999	}	1094	}
1000		1095
1001	/* remove_ob(op):	1096	/* remove_ob(op):
1002	* This function removes the object op from the linked list of objects	1097	* This function removes the object op from the linked list of objects
1003	* which it is currently tied to. When this function is done, the	1098	* which it is currently tied to. When this function is done, the
…		…
1005	* environment, the x and y coordinates will be updated to	1100	* environment, the x and y coordinates will be updated to
1006	* the previous environment.	1101	* the previous environment.
1007	* Beware: This function is called from the editor as well!	1102	* Beware: This function is called from the editor as well!
1008	*/	1103	*/
1009		1104
		1105	void
1010	void remove_ob(object *op) {	1106	remove_ob (object *op)
1011	object *tmp,*last=NULL;	1107	{
1012	object *otmp;	1108	object *
1013	tag_t tag;	1109	tmp, *
		1110	last = NULL;
		1111	object *
		1112	otmp;
		1113
		1114	tag_t
		1115	tag;
		1116	int
1014	int check_walk_off;	1117	check_walk_off;
1015	mapstruct *m;	1118	mapstruct *
1016	sint16 x,y;
1017		1119	m;
1018		1120
		1121	sint16
		1122	x,
		1123	y;
		1124
1019	if(QUERY_FLAG(op,FLAG_REMOVED)) {	1125	if (QUERY_FLAG (op, FLAG_REMOVED))
1020	dump_object(op);	1126	return;
1021	LOG(llevError,"Trying to remove removed object.\n%s\n",errmsg);
1022		1127
1023	/* Changed it to always dump core in this case. As has been learned
1024	* in the past, trying to recover from errors almost always
1025	* make things worse, and this is a real error here - something
1026	* that should not happen.
1027	* Yes, if this was a mission critical app, trying to do something
1028	* to recover may make sense, but that is because failure of the app
1029	* may have other disastrous problems. Cf runs out of a script
1030	* so is easily enough restarted without any real problems.
1031	* MSW 2001-07-01
1032	*/
1033	abort();
1034	}
1035	if(op->more!=NULL)
1036	remove_ob(op->more);
1037
1038	SET_FLAG(op, FLAG_REMOVED);	1128	SET_FLAG (op, FLAG_REMOVED);
1039		1129
		1130	if (op->more != NULL)
		1131	remove_ob (op->more);
		1132
1040	/*	1133	/*
1041	* In this case, the object to be removed is in someones	1134	* In this case, the object to be removed is in someones
1042	* inventory.	1135	* inventory.
1043	*/	1136	*/
1044	if(op->env!=NULL) {	1137	if (op->env != NULL)
		1138	{
1045	if(op->nrof)	1139	if (op->nrof)
1046	sub_weight(op->env, op->weight*op->nrof);	1140	sub_weight (op->env, op->weight * op->nrof);
1047	else	1141	else
1048	sub_weight(op->env, op->weight+op->carrying);	1142	sub_weight (op->env, op->weight + op->carrying);
1049		1143
1050	/* NO_FIX_PLAYER is set when a great many changes are being	1144	/* NO_FIX_PLAYER is set when a great many changes are being
1051	* made to players inventory. If set, avoiding the call	1145	* made to players inventory. If set, avoiding the call
1052	* to save cpu time.	1146	* to save cpu time.
1053	*/	1147	*/
1054	if ((otmp=is_player_inv(op->env))!=NULL && otmp->contr &&	1148	if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1055	!QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER))
1056	fix_player(otmp);	1149	fix_player (otmp);
1057		1150
1058	if(op->above!=NULL)	1151	if (op->above != NULL)
1059	op->above->below=op->below;	1152	op->above->below = op->below;
1060	else	1153	else
1061	op->env->inv=op->below;	1154	op->env->inv = op->below;
1062		1155
1063	if(op->below!=NULL)	1156	if (op->below != NULL)
1064	op->below->above=op->above;	1157	op->below->above = op->above;
1065		1158
1066	/* we set up values so that it could be inserted into	1159	/* we set up values so that it could be inserted into
1067	* the map, but we don't actually do that - it is up	1160	* the map, but we don't actually do that - it is up
1068	* to the caller to decide what we want to do.	1161	* to the caller to decide what we want to do.
1069	*/	1162	*/
1070	op->x=op->env->x,op->y=op->env->y;	1163	op->x = op->env->x, op->y = op->env->y;
1071	op->map=op->env->map;	1164	op->map = op->env->map;
1072	op->above=NULL,op->below=NULL;	1165	op->above = NULL, op->below = NULL;
1073	op->env=NULL;	1166	op->env = NULL;
		1167	}
		1168	else if (op->map)
		1169	{
		1170	x = op->x;
		1171	y = op->y;
		1172	m = get_map_from_coord (op->map, &x, &y);
		1173
		1174	if (!m)
		1175	{
		1176	LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
		1177	op->map->path, op->x, op->y);
		1178	/* in old days, we used to set x and y to 0 and continue.
		1179	* it seems if we get into this case, something is probablye
		1180	* screwed up and should be fixed.
		1181	*/
		1182	abort ();
		1183	}
		1184
		1185	if (op->map != m)
		1186	LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
		1187	op->map->path, m->path, op->x, op->y, x, y);
		1188
		1189	/* Re did the following section of code - it looks like it had
		1190	* lots of logic for things we no longer care about
		1191	*/
		1192
		1193	/* link the object above us */
		1194	if (op->above)
		1195	op->above->below = op->below;
		1196	else
		1197	SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */
		1198
		1199	/* Relink the object below us, if there is one */
		1200	if (op->below)
		1201	op->below->above = op->above;
		1202	else
		1203	{
		1204	/* Nothing below, which means we need to relink map object for this space
		1205	* use translated coordinates in case some oddness with map tiling is
		1206	* evident
		1207	*/
		1208	if (GET_MAP_OB (m, x, y) != op)
		1209	{
		1210	dump_object (op);
		1211	LOG (llevError,
		1212	"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);
		1213	dump_object (GET_MAP_OB (m, x, y));
		1214	LOG (llevError, "%s\n", errmsg);
		1215	}
		1216
		1217	SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
		1218	}
		1219
		1220	op->above = 0;
		1221	op->below = 0;
		1222
		1223	if (op->map->in_memory == MAP_SAVING)
1074	return;	1224	return;
1075	}
1076		1225
1077	/* If we get here, we are removing it from a map */
1078	if (op->map == NULL) return;
1079
1080	x = op->x;
1081	y = op->y;
1082	m = get_map_from_coord(op->map, &x, &y);
1083
1084	if (!m) {
1085	LOG(llevError,"remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1086	op->map->path, op->x, op->y);
1087	/* in old days, we used to set x and y to 0 and continue.
1088	* it seems if we get into this case, something is probablye
1089	* screwed up and should be fixed.
1090	*/
1091	abort();
1092	}
1093	if (op->map != m) {
1094	LOG(llevDebug,"remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1095	op->map->path, m->path, op->x, op->y, x, y);
1096	}
1097
1098	/* Re did the following section of code - it looks like it had
1099	* lots of logic for things we no longer care about
1100	*/
1101
1102	/* link the object above us */
1103	if (op->above)
1104	op->above->below=op->below;
1105	else
1106	SET_MAP_TOP(m,x,y,op->below); /* we were top, set new top */
1107
1108	/* Relink the object below us, if there is one */
1109	if(op->below) {
1110	op->below->above=op->above;
1111	} else {
1112	/* Nothing below, which means we need to relink map object for this space
1113	* use translated coordinates in case some oddness with map tiling is
1114	* evident
1115	*/
1116	if(GET_MAP_OB(m,x,y)!=op) {
1117	dump_object(op);
1118	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);
1119	dump_object(GET_MAP_OB(m,x,y));
1120	LOG(llevError,"%s\n",errmsg);
1121	}
1122	SET_MAP_OB(m,x,y,op->above); /* goes on above it. */
1123	}
1124	op->above=NULL;
1125	op->below=NULL;
1126
1127	if (op->map->in_memory == MAP_SAVING)
1128	return;
1129
1130	tag = op->count;	1226	tag = op->count;
1131	check_walk_off = ! QUERY_FLAG (op, FLAG_NO_APPLY);	1227	check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
		1228
1132	for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above) {	1229	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
		1230	{
1133	/* No point updating the players look faces if he is the object	1231	/* No point updating the players look faces if he is the object
1134	* being removed.	1232	* being removed.
1135	*/	1233	*/
1136		1234
1137	if(tmp->type==PLAYER && tmp!=op) {	1235	if (tmp->type == PLAYER && tmp != op)
		1236	{
1138	/* If a container that the player is currently using somehow gets	1237	/* If a container that the player is currently using somehow gets
1139	* removed (most likely destroyed), update the player view	1238	* removed (most likely destroyed), update the player view
1140	* appropriately.	1239	* appropriately.
1141	*/	1240	*/
1142	if (tmp->container==op) {	1241	if (tmp->container == op)
		1242	{
1143	CLEAR_FLAG(op, FLAG_APPLIED);	1243	CLEAR_FLAG (op, FLAG_APPLIED);
1144	tmp->container=NULL;	1244	tmp->container = NULL;
		1245	}
		1246
		1247	tmp->contr->socket.update_look = 1;
1145	}	1248	}
1146	tmp->contr->socket.update_look=1;	1249
1147	}
1148	/* See if player moving off should effect something */	1250	/* See if player moving off should effect something */
1149	if (check_walk_off && ((op->move_type & tmp->move_off) &&	1251	if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1150	(op->move_type & ~tmp->move_off & ~tmp->move_block)==0)) {	1252	{
1151
1152	move_apply(tmp, op, NULL);	1253	move_apply (tmp, op, NULL);
		1254
1153	if (was_destroyed (op, tag)) {	1255	if (was_destroyed (op, tag))
		1256	{
1154	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed "	1257	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);
1155	"leaving object\n", &tmp->name, &tmp->arch->name);	1258	}
1156	}	1259	}
1157	}
1158		1260
1159	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1261	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1160		1262
1161	if(tmp->above == tmp)	1263	if (tmp->above == tmp)
1162	tmp->above = NULL;	1264	tmp->above = NULL;
		1265
1163	last=tmp;	1266	last = tmp;
1164	}	1267	}
		1268
1165	/* last == NULL of there are no objects on this space */	1269	/* last == NULL of there are no objects on this space */
1166	if (last==NULL) {	1270	if (last == NULL)
		1271	{
1167	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,	1272	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1168	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures	1273	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1169	* those out anyways, and if there are any flags set right now, they won't	1274	* those out anyways, and if there are any flags set right now, they won't
1170	* be correct anyways.	1275	* be correct anyways.
1171	*/	1276	*/
1172	SET_MAP_FLAGS(op->map, op->x, op->y, P_NEED_UPDATE);	1277	SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1173	update_position(op->map, op->x, op->y);	1278	update_position (op->map, op->x, op->y);
1174	}	1279	}
1175	else	1280	else
1176	update_object(last, UP_OBJ_REMOVE);	1281	update_object (last, UP_OBJ_REMOVE);
1177		1282
1178	if(QUERY_FLAG(op,FLAG_BLOCKSVIEW)|| (op->glow_radius != 0))	1283	if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))
1179	update_all_los(op->map, op->x, op->y);	1284	update_all_los (op->map, op->x, op->y);
1180		1285	}
1181	}	1286	}
1182		1287
1183	/*	1288	/*
1184	* merge_ob(op,top):	1289	* merge_ob(op,top):
1185	*	1290	*
1186	* This function goes through all objects below and including top, and	1291	* This function goes through all objects below and including top, and
1187	* merges op to the first matching object.	1292	* merges op to the first matching object.
1188	* If top is NULL, it is calculated.	1293	* If top is NULL, it is calculated.
1189	* Returns pointer to object if it succeded in the merge, otherwise NULL	1294	* Returns pointer to object if it succeded in the merge, otherwise NULL
1190	*/	1295	*/
1191		1296	object *
1192	object *merge_ob(object *op, object *top) {	1297	merge_ob (object *op, object *top)
		1298	{
1193	if(!op->nrof)	1299	if (!op->nrof)
1194	return 0;	1300	return 0;
		1301
1195	if(top==NULL)	1302	if (top == NULL)
1196	for(top=op;top!=NULL&&top->above!=NULL;top=top->above);	1303	for (top = op; top != NULL && top->above != NULL; top = top->above);
		1304
1197	for(;top!=NULL;top=top->below) {	1305	for (; top != NULL; top = top->below)
		1306	{
1198	if(top==op)	1307	if (top == op)
1199	continue;	1308	continue;
1200	if (CAN_MERGE(op,top))	1309	if (CAN_MERGE (op, top))
1201	{	1310	{
1202	top->nrof+=op->nrof;	1311	top->nrof += op->nrof;
		1312
1203	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1313	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1204	op->weight = 0; /* Don't want any adjustements now */	1314	op->weight = 0; /* Don't want any adjustements now */
1205	remove_ob(op);	1315	remove_ob (op);
1206	free_object(op);	1316	free_object (op);
1207	return top;	1317	return top;
1208	}	1318	}
1209	}	1319	}
		1320
1210	return NULL;	1321	return NULL;
1211	}	1322	}
1212		1323
1213	/*	1324	/*
1214	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1325	* same as insert_ob_in_map except it handle separate coordinates and do a clean
1215	* job preparing multi-part monsters	1326	* job preparing multi-part monsters
1216	*/	1327	*/
		1328	object *
1217	object *insert_ob_in_map_at(object *op, mapstruct *m, object *originator, int flag, int x, int y){	1329	insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y)
		1330	{
1218	object* tmp;	1331	object *tmp;
		1332
1219	if (op->head)	1333	if (op->head)
1220	op=op->head;	1334	op = op->head;
		1335
1221	for (tmp=op;tmp;tmp=tmp->more){	1336	for (tmp = op; tmp; tmp = tmp->more)
		1337	{
1222	tmp->x=x+tmp->arch->clone.x;	1338	tmp->x = x + tmp->arch->clone.x;
1223	tmp->y=y+tmp->arch->clone.y;	1339	tmp->y = y + tmp->arch->clone.y;
1224	}	1340	}
		1341
1225	return insert_ob_in_map (op, m, originator, flag);	1342	return insert_ob_in_map (op, m, originator, flag);
1226	}	1343	}
1227		1344
1228	/*	1345	/*
1229	* insert_ob_in_map (op, map, originator, flag):	1346	* insert_ob_in_map (op, map, originator, flag):
1230	* This function inserts the object in the two-way linked list	1347	* This function inserts the object in the two-way linked list
…		…
1244	* new object if 'op' was merged with other object	1361	* new object if 'op' was merged with other object
1245	* NULL if 'op' was destroyed	1362	* NULL if 'op' was destroyed
1246	* just 'op' otherwise	1363	* just 'op' otherwise
1247	*/	1364	*/
1248		1365
		1366	object *
1249	object *insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag)	1367	insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag)
1250	{	1368	{
1251	object *tmp, *top, *floor=NULL;	1369	object *tmp, *top, *floor = NULL;
1252	sint16 x,y;	1370	sint16 x, y;
1253		1371
1254	if (QUERY_FLAG (op, FLAG_FREED)) {	1372	if (QUERY_FLAG (op, FLAG_FREED))
		1373	{
1255	LOG (llevError, "Trying to insert freed object!\n");	1374	LOG (llevError, "Trying to insert freed object!\n");
		1375	return NULL;
		1376	}
		1377
		1378	if (m == NULL)
		1379	{
		1380	dump_object (op);
		1381	LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg);
		1382	return op;
		1383	}
		1384
		1385	if (out_of_map (m, op->x, op->y))
		1386	{
		1387	dump_object (op);
		1388	LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg);
		1389	#ifdef MANY_CORES
		1390	/* Better to catch this here, as otherwise the next use of this object
		1391	* is likely to cause a crash. Better to find out where it is getting
		1392	* improperly inserted.
		1393	*/
		1394	abort ();
		1395	#endif
		1396	return op;
		1397	}
		1398
		1399	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1400	{
		1401	dump_object (op);
		1402	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg);
		1403	return op;
		1404	}
		1405
		1406	if (op->more != NULL)
		1407	{
		1408	/* The part may be on a different map. */
		1409
		1410	object *more = op->more;
		1411
		1412	/* We really need the caller to normalize coordinates - if
		1413	* we set the map, that doesn't work if the location is within
		1414	* a map and this is straddling an edge. So only if coordinate
		1415	* is clear wrong do we normalize it.
		1416	*/
		1417	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
		1418	more->map = get_map_from_coord (m, &more->x, &more->y);
		1419	else if (!more->map)
		1420	{
		1421	/* For backwards compatibility - when not dealing with tiled maps,
		1422	* more->map should always point to the parent.
		1423	*/
		1424	more->map = m;
		1425	}
		1426
		1427	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
		1428	{
		1429	if (!op->head)
		1430	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
		1431
		1432	return NULL;
		1433	}
		1434	}
		1435
		1436	CLEAR_FLAG (op, FLAG_REMOVED);
		1437
		1438	/* Ideally, the caller figures this out. However, it complicates a lot
		1439	* of areas of callers (eg, anything that uses find_free_spot would now
		1440	* need extra work
		1441	*/
		1442	op->map = get_map_from_coord (m, &op->x, &op->y);
		1443	x = op->x;
		1444	y = op->y;
		1445
		1446	/* this has to be done after we translate the coordinates.
		1447	*/
		1448	if (op->nrof && !(flag & INS_NO_MERGE))
		1449	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)
		1450	if (CAN_MERGE (op, tmp))
		1451	{
		1452	op->nrof += tmp->nrof;
		1453	remove_ob (tmp);
		1454	free_object (tmp);
		1455	}
		1456
		1457	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
		1458	CLEAR_FLAG (op, FLAG_INV_LOCKED);
		1459
		1460	if (!QUERY_FLAG (op, FLAG_ALIVE))
		1461	CLEAR_FLAG (op, FLAG_NO_STEAL);
		1462
		1463	if (flag & INS_BELOW_ORIGINATOR)
		1464	{
		1465	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)
		1466	{
		1467	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
		1468	abort ();
		1469	}
		1470
		1471	op->above = originator;
		1472	op->below = originator->below;
		1473
		1474	if (op->below)
		1475	op->below->above = op;
		1476	else
		1477	SET_MAP_OB (op->map, op->x, op->y, op);
		1478
		1479	/* since *below* originator, no need to update top */
		1480	originator->below = op;
		1481	}
		1482	else
		1483	{
		1484	/* If there are other objects, then */
		1485	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))
		1486	{
		1487	object *last = NULL;
		1488
		1489	/*
		1490	* If there are multiple objects on this space, we do some trickier handling.
		1491	* We've already dealt with merging if appropriate.
		1492	* Generally, we want to put the new object on top. But if
		1493	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
		1494	* floor, we want to insert above that and no further.
		1495	* Also, if there are spell objects on this space, we stop processing
		1496	* once we get to them. This reduces the need to traverse over all of
		1497	* them when adding another one - this saves quite a bit of cpu time
		1498	* when lots of spells are cast in one area. Currently, it is presumed
		1499	* that flying non pickable objects are spell objects.
		1500	*/
		1501
		1502	while (top != NULL)
		1503	{
		1504	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
		1505	floor = top;
		1506
		1507	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
		1508	{
		1509	/* We insert above top, so we want this object below this */
		1510	top = top->below;
		1511	break;
		1512	}
		1513
		1514	last = top;
		1515	top = top->above;
		1516	}
		1517
		1518	/* Don't want top to be NULL, so set it to the last valid object */
		1519	top = last;
		1520
		1521	/* We let update_position deal with figuring out what the space
		1522	* looks like instead of lots of conditions here.
		1523	* makes things faster, and effectively the same result.
		1524	*/
		1525
		1526	/* Have object 'fall below' other objects that block view.
		1527	* Unless those objects are exits, type 66
		1528	* If INS_ON_TOP is used, don't do this processing
		1529	* Need to find the object that in fact blocks view, otherwise
		1530	* stacking is a bit odd.
		1531	*/
		1532	if (!(flag & INS_ON_TOP) &&
		1533	(get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))
		1534	{
		1535	for (last = top; last != floor; last = last->below)
		1536	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
		1537	break;
		1538	/* Check to see if we found the object that blocks view,
		1539	* and make sure we have a below pointer for it so that
		1540	* we can get inserted below this one, which requires we
		1541	* set top to the object below us.
		1542	*/
		1543	if (last && last->below && last != floor)
		1544	top = last->below;
		1545	}
		1546	} /* If objects on this space */
		1547
		1548	if (flag & INS_MAP_LOAD)
		1549	top = GET_MAP_TOP (op->map, op->x, op->y);
		1550
		1551	if (flag & INS_ABOVE_FLOOR_ONLY)
		1552	top = floor;
		1553
		1554	/* Top is the object that our object (op) is going to get inserted above.
		1555	*/
		1556
		1557	/* First object on this space */
		1558	if (!top)
		1559	{
		1560	op->above = GET_MAP_OB (op->map, op->x, op->y);
		1561
		1562	if (op->above)
		1563	op->above->below = op;
		1564
		1565	op->below = NULL;
		1566	SET_MAP_OB (op->map, op->x, op->y, op);
		1567	}
		1568	else
		1569	{ /* get inserted into the stack above top */
		1570	op->above = top->above;
		1571
		1572	if (op->above)
		1573	op->above->below = op;
		1574
		1575	op->below = top;
		1576	top->above = op;
		1577	}
		1578
		1579	if (op->above == NULL)
		1580	SET_MAP_TOP (op->map, op->x, op->y, op);
		1581	} /* else not INS_BELOW_ORIGINATOR */
		1582
		1583	if (op->type == PLAYER)
		1584	op->contr->do_los = 1;
		1585
		1586	/* If we have a floor, we know the player, if any, will be above
		1587	* it, so save a few ticks and start from there.
		1588	*/
		1589	if (!(flag & INS_MAP_LOAD))
		1590	for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
		1591	if (tmp->type == PLAYER)
		1592	tmp->contr->socket.update_look = 1;
		1593
		1594	/* If this object glows, it may affect lighting conditions that are
		1595	* visible to others on this map. But update_all_los is really
		1596	* an inefficient way to do this, as it means los for all players
		1597	* on the map will get recalculated. The players could very well
		1598	* be far away from this change and not affected in any way -
		1599	* this should get redone to only look for players within range,
		1600	* or just updating the P_NEED_UPDATE for spaces within this area
		1601	* of effect may be sufficient.
		1602	*/
		1603	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))
		1604	update_all_los (op->map, op->x, op->y);
		1605
		1606	/* updates flags (blocked, alive, no magic, etc) for this map space */
		1607	update_object (op, UP_OBJ_INSERT);
		1608
		1609	/* Don't know if moving this to the end will break anything. However,
		1610	* we want to have update_look set above before calling this.
		1611	*
		1612	* check_move_on() must be after this because code called from
		1613	* check_move_on() depends on correct map flags (so functions like
		1614	* blocked() and wall() work properly), and these flags are updated by
		1615	* update_object().
		1616	*/
		1617
		1618	/* if this is not the head or flag has been passed, don't check walk on status */
		1619	if (!(flag & INS_NO_WALK_ON) && !op->head)
		1620	{
		1621	if (check_move_on (op, originator))
1256	return NULL;	1622	return NULL;
1257	}
1258	if(m==NULL) {
1259	dump_object(op);
1260	LOG(llevError,"Trying to insert in null-map!\n%s\n",errmsg);
1261	return op;
1262	}
1263	if(out_of_map(m,op->x,op->y)) {
1264	dump_object(op);
1265	LOG(llevError,"Trying to insert object outside the map.\n%s\n", errmsg);
1266	#ifdef MANY_CORES
1267	/* Better to catch this here, as otherwise the next use of this object
1268	* is likely to cause a crash. Better to find out where it is getting
1269	* improperly inserted.
1270	*/
1271	abort();
1272	#endif
1273	return op;
1274	}
1275	if(!QUERY_FLAG(op,FLAG_REMOVED)) {
1276	dump_object(op);
1277	LOG(llevError,"Trying to insert (map) inserted object.\n%s\n", errmsg);
1278	return op;
1279	}
1280	if(op->more!=NULL) {
1281	/* The part may be on a different map. */
1282		1623
1283	object *more = op->more;
1284
1285	/* We really need the caller to normalize coordinates - if
1286	* we set the map, that doesn't work if the location is within
1287	* a map and this is straddling an edge. So only if coordinate
1288	* is clear wrong do we normalize it.
1289	*/
1290	if (OUT_OF_REAL_MAP(more->map, more->x, more->y)) {
1291	more->map = get_map_from_coord(m, &more->x, &more->y);
1292	} else if (!more->map) {
1293	/* For backwards compatibility - when not dealing with tiled maps,
1294	* more->map should always point to the parent.
1295	*/
1296	more->map = m;
1297	}
1298
1299	if (insert_ob_in_map(more, more->map, originator, flag) == NULL) {
1300	if ( ! op->head)
1301	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1302	return NULL;
1303	}
1304	}
1305	CLEAR_FLAG(op,FLAG_REMOVED);
1306
1307	/* Ideally, the caller figures this out. However, it complicates a lot
1308	* of areas of callers (eg, anything that uses find_free_spot would now
1309	* need extra work
1310	*/
1311	op->map=get_map_from_coord(m, &op->x, &op->y);
1312	x = op->x;
1313	y = op->y;
1314
1315	/* this has to be done after we translate the coordinates.
1316	*/
1317	if(op->nrof && !(flag & INS_NO_MERGE)) {
1318	for(tmp=GET_MAP_OB(op->map,x,y);tmp!=NULL;tmp=tmp->above)
1319	if (CAN_MERGE(op,tmp)) {
1320	op->nrof+=tmp->nrof;
1321	remove_ob(tmp);
1322	free_object(tmp);
1323	}
1324	}
1325
1326	CLEAR_FLAG(op,FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1327	CLEAR_FLAG(op, FLAG_INV_LOCKED);
1328	if (!QUERY_FLAG(op, FLAG_ALIVE))
1329	CLEAR_FLAG(op, FLAG_NO_STEAL);
1330
1331	if (flag & INS_BELOW_ORIGINATOR) {
1332	if (originator->map != op->map || originator->x != op->x ||
1333	originator->y != op->y) {
1334	LOG(llevError,"insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1335	abort();
1336	}
1337	op->above = originator;
1338	op->below = originator->below;
1339	if (op->below) op->below->above = op;
1340	else SET_MAP_OB(op->map, op->x, op->y, op);
1341	/* since *below* originator, no need to update top */
1342	originator->below = op;
1343	} else {
1344	/* If there are other objects, then */
1345	if((! (flag & INS_MAP_LOAD)) && ((top=GET_MAP_OB(op->map,op->x,op->y))!=NULL)) {
1346	object *last=NULL;
1347	/*
1348	* If there are multiple objects on this space, we do some trickier handling.
1349	* We've already dealt with merging if appropriate.
1350	* Generally, we want to put the new object on top. But if
1351	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
1352	* floor, we want to insert above that and no further.
1353	* Also, if there are spell objects on this space, we stop processing
1354	* once we get to them. This reduces the need to traverse over all of
1355	* them when adding another one - this saves quite a bit of cpu time
1356	* when lots of spells are cast in one area. Currently, it is presumed
1357	* that flying non pickable objects are spell objects.
1358	*/
1359
1360	while (top != NULL) {
1361	if (QUERY_FLAG(top, FLAG_IS_FLOOR) ||
1362	QUERY_FLAG(top, FLAG_OVERLAY_FLOOR)) floor = top;
1363	if (QUERY_FLAG(top, FLAG_NO_PICK)
1364	&& (top->move_type & (MOVE_FLY_LOW |MOVE_FLY_HIGH))
1365	&& !QUERY_FLAG(top, FLAG_IS_FLOOR))
1366	{
1367	/* We insert above top, so we want this object below this */
1368	top=top->below;
1369	break;
1370	}
1371	last = top;
1372	top = top->above;
1373	}
1374	/* Don't want top to be NULL, so set it to the last valid object */
1375	top = last;
1376
1377	/* We let update_position deal with figuring out what the space
1378	* looks like instead of lots of conditions here.
1379	* makes things faster, and effectively the same result.
1380	*/
1381
1382	/* Have object 'fall below' other objects that block view.
1383	* Unless those objects are exits, type 66
1384	* If INS_ON_TOP is used, don't do this processing
1385	* Need to find the object that in fact blocks view, otherwise
1386	* stacking is a bit odd.
1387	*/
1388	if (!(flag & INS_ON_TOP) &&
1389	(get_map_flags(op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) &&
1390	(op->face && !op->face->visibility)) {
1391	for (last=top; last != floor; last=last->below)
1392	if (QUERY_FLAG(last, FLAG_BLOCKSVIEW)&&(last->type != EXIT)) break;
1393	/* Check to see if we found the object that blocks view,
1394	* and make sure we have a below pointer for it so that
1395	* we can get inserted below this one, which requires we
1396	* set top to the object below us.
1397	*/
1398	if (last && last->below && last != floor) top=last->below;
1399	}
1400	} /* If objects on this space */
1401	if (flag & INS_MAP_LOAD)
1402	top = GET_MAP_TOP(op->map,op->x,op->y);
1403	if (flag & INS_ABOVE_FLOOR_ONLY) top = floor;
1404
1405	/* Top is the object that our object (op) is going to get inserted above.
1406	*/
1407
1408	/* First object on this space */
1409	if (!top) {
1410	op->above = GET_MAP_OB(op->map, op->x, op->y);
1411	if (op->above) op->above->below = op;
1412	op->below = NULL;
1413	SET_MAP_OB(op->map, op->x, op->y, op);
1414	} else { /* get inserted into the stack above top */
1415	op->above = top->above;
1416	if (op->above) op->above->below = op;
1417	op->below = top;
1418	top->above = op;
1419	}
1420	if (op->above==NULL)
1421	SET_MAP_TOP(op->map,op->x, op->y, op);
1422	} /* else not INS_BELOW_ORIGINATOR */
1423
1424	if(op->type==PLAYER)
1425	op->contr->do_los=1;
1426
1427	/* If we have a floor, we know the player, if any, will be above
1428	* it, so save a few ticks and start from there.
1429	*/
1430	if (!(flag & INS_MAP_LOAD))
1431	for(tmp=floor?floor:GET_MAP_OB(op->map,op->x,op->y);tmp!=NULL;tmp=tmp->above) {
1432	if (tmp->type == PLAYER)
1433	tmp->contr->socket.update_look=1;
1434	}
1435
1436	/* If this object glows, it may affect lighting conditions that are
1437	* visible to others on this map. But update_all_los is really
1438	* an inefficient way to do this, as it means los for all players
1439	* on the map will get recalculated. The players could very well
1440	* be far away from this change and not affected in any way -
1441	* this should get redone to only look for players within range,
1442	* or just updating the P_NEED_UPDATE for spaces within this area
1443	* of effect may be sufficient.
1444	*/
1445	if(MAP_DARKNESS(op->map) && (op->glow_radius != 0))
1446	update_all_los(op->map, op->x, op->y);
1447
1448
1449	/* updates flags (blocked, alive, no magic, etc) for this map space */
1450	update_object(op,UP_OBJ_INSERT);
1451
1452
1453	/* Don't know if moving this to the end will break anything. However,
1454	* we want to have update_look set above before calling this.
1455	*
1456	* check_move_on() must be after this because code called from
1457	* check_move_on() depends on correct map flags (so functions like
1458	* blocked() and wall() work properly), and these flags are updated by
1459	* update_object().
1460	*/
1461
1462	/* if this is not the head or flag has been passed, don't check walk on status */
1463
1464	if (!(flag & INS_NO_WALK_ON) && !op->head) {
1465	if (check_move_on(op, originator))
1466	return NULL;
1467
1468	/* If we are a multi part object, lets work our way through the check	1624	/* If we are a multi part object, lets work our way through the check
1469	* walk on's.	1625	* walk on's.
1470	*/	1626	*/
1471	for (tmp=op->more; tmp!=NULL; tmp=tmp->more)	1627	for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1472	if (check_move_on (tmp, originator))	1628	if (check_move_on (tmp, originator))
1473	return NULL;	1629	return NULL;
1474	}	1630	}
		1631
1475	return op;	1632	return op;
1476	}	1633	}
1477		1634
1478	/* this function inserts an object in the map, but if it	1635	/* this function inserts an object in the map, but if it
1479	* finds an object of its own type, it'll remove that one first.	1636	* finds an object of its own type, it'll remove that one first.
1480	* op is the object to insert it under: supplies x and the map.	1637	* op is the object to insert it under: supplies x and the map.
1481	*/	1638	*/
		1639	void
1482	void replace_insert_ob_in_map(const char *arch_string, object *op) {	1640	replace_insert_ob_in_map (const char *arch_string, object *op)
		1641	{
1483	object *tmp;	1642	object *
1484	object *tmp1;	1643	tmp;
		1644	object *
		1645	tmp1;
1485		1646
1486	/* first search for itself and remove any old instances */	1647	/* first search for itself and remove any old instances */
1487		1648
1488	for(tmp=GET_MAP_OB(op->map,op->x,op->y); tmp!=NULL; tmp=tmp->above) {	1649	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
		1650	{
1489	if(!strcmp(tmp->arch->name,arch_string)) /* same archetype */ {	1651	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
		1652	{
1490	remove_ob(tmp);	1653	remove_ob (tmp);
1491	free_object(tmp);	1654	free_object (tmp);
1492	}	1655	}
1493	}	1656	}
1494		1657
1495	tmp1=arch_to_object(find_archetype(arch_string));	1658	tmp1 = arch_to_object (find_archetype (arch_string));
1496		1659
1497		1660	tmp1->x = op->x;
1498	tmp1->x = op->x; tmp1->y = op->y;	1661	tmp1->y = op->y;
1499	insert_ob_in_map(tmp1,op->map,op,0);	1662	insert_ob_in_map (tmp1, op->map, op, 0);
1500	}	1663	}
1501		1664
1502	/*	1665	/*
1503	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1666	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1504	* is returned contains nr objects, and the remaining parts contains	1667	* is returned contains nr objects, and the remaining parts contains
1505	* the rest (or is removed and freed if that number is 0).	1668	* the rest (or is removed and freed if that number is 0).
1506	* On failure, NULL is returned, and the reason put into the	1669	* On failure, NULL is returned, and the reason put into the
1507	* global static errmsg array.	1670	* global static errmsg array.
1508	*/	1671	*/
1509		1672
		1673	object *
1510	object *get_split_ob(object *orig_ob, uint32 nr) {	1674	get_split_ob (object *orig_ob, uint32 nr)
1511	object *newob;	1675	{
		1676	object *
		1677	newob;
		1678	int
1512	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1679	is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1513		1680
1514	if(orig_ob->nrof<nr) {	1681	if (orig_ob->nrof < nr)
1515	sprintf(errmsg,"There are only %d %ss.",	1682	{
1516	orig_ob->nrof?orig_ob->nrof:1, &orig_ob->name);	1683	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1517	return NULL;	1684	return NULL;
1518	}	1685	}
		1686
1519	newob = object_create_clone(orig_ob);	1687	newob = object_create_clone (orig_ob);
		1688
1520	if((orig_ob->nrof-=nr)<1) {	1689	if ((orig_ob->nrof -= nr) < 1)
		1690	{
1521	if ( ! is_removed)	1691	if (!is_removed)
1522	remove_ob(orig_ob);	1692	remove_ob (orig_ob);
1523	free_object2(orig_ob, 1);	1693	free_object2 (orig_ob, 1);
1524	}	1694	}
1525	else if ( ! is_removed) {	1695	else if (!is_removed)
		1696	{
1526	if(orig_ob->env!=NULL)	1697	if (orig_ob->env != NULL)
1527	sub_weight (orig_ob->env,orig_ob->weight*nr);	1698	sub_weight (orig_ob->env, orig_ob->weight * nr);
1528	if (orig_ob->env == NULL && orig_ob->map->in_memory!=MAP_IN_MEMORY) {	1699	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
		1700	{
1529	strcpy(errmsg, "Tried to split object whose map is not in memory.");	1701	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1530	LOG(llevDebug,
1531	"Error, Tried to split object whose map is not in memory.\n");	1702	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1532	return NULL;	1703	return NULL;
1533	}	1704	}
1534	}	1705	}
		1706
1535	newob->nrof=nr;	1707	newob->nrof = nr;
1536		1708
1537	return newob;	1709	return newob;
1538	}	1710	}
1539		1711
1540	/*	1712	/*
1541	* decrease_ob_nr(object, number) decreases a specified number from	1713	* decrease_ob_nr(object, number) decreases a specified number from
1542	* the amount of an object. If the amount reaches 0, the object	1714	* the amount of an object. If the amount reaches 0, the object
1543	* is subsequently removed and freed.	1715	* is subsequently removed and freed.
1544	*	1716	*
1545	* Return value: 'op' if something is left, NULL if the amount reached 0	1717	* Return value: 'op' if something is left, NULL if the amount reached 0
1546	*/	1718	*/
1547		1719
		1720	object *
1548	object *decrease_ob_nr (object *op, uint32 i)	1721	decrease_ob_nr (object *op, uint32 i)
1549	{	1722	{
1550	object *tmp;	1723	object *tmp;
1551	player *pl;	1724	player *pl;
1552		1725
1553	if (i == 0) /* objects with op->nrof require this check */	1726	if (i == 0) /* objects with op->nrof require this check */
1554	return op;	1727	return op;
1555		1728
1556	if (i > op->nrof)	1729	if (i > op->nrof)
1557	i = op->nrof;	1730	i = op->nrof;
1558		1731
1559	if (QUERY_FLAG (op, FLAG_REMOVED))	1732	if (QUERY_FLAG (op, FLAG_REMOVED))
		1733	op->nrof -= i;
		1734	else if (op->env != NULL)
		1735	{
		1736	/* is this object in the players inventory, or sub container
		1737	* therein?
		1738	*/
		1739	tmp = is_player_inv (op->env);
		1740	/* nope. Is this a container the player has opened?
		1741	* If so, set tmp to that player.
		1742	* IMO, searching through all the players will mostly
		1743	* likely be quicker than following op->env to the map,
		1744	* and then searching the map for a player.
		1745	*/
		1746	if (!tmp)
		1747	{
		1748	for (pl = first_player; pl; pl = pl->next)
		1749	if (pl->ob->container == op->env)
		1750	break;
		1751	if (pl)
		1752	tmp = pl->ob;
		1753	else
		1754	tmp = NULL;
		1755	}
		1756
		1757	if (i < op->nrof)
		1758	{
		1759	sub_weight (op->env, op->weight * i);
		1760	op->nrof -= i;
		1761	if (tmp)
		1762	{
		1763	esrv_send_item (tmp, op);
		1764	}
		1765	}
		1766	else
		1767	{
		1768	remove_ob (op);
		1769	op->nrof = 0;
		1770	if (tmp)
		1771	{
		1772	esrv_del_item (tmp->contr, op->count);
		1773	}
		1774	}
1560	{	1775	}
		1776	else
		1777	{
		1778	object *above = op->above;
		1779
		1780	if (i < op->nrof)
1561	op->nrof -= i;	1781	op->nrof -= i;
1562	}	1782	else
1563	else if (op->env != NULL)
1564	{
1565	/* is this object in the players inventory, or sub container
1566	* therein?
1567	*/
1568	tmp = is_player_inv (op->env);
1569	/* nope. Is this a container the player has opened?
1570	* If so, set tmp to that player.
1571	* IMO, searching through all the players will mostly
1572	* likely be quicker than following op->env to the map,
1573	* and then searching the map for a player.
1574	*/
1575	if (!tmp) {
1576	for (pl=first_player; pl; pl=pl->next)
1577	if (pl->ob->container == op->env) break;
1578	if (pl) tmp=pl->ob;
1579	else tmp=NULL;
1580	}	1783	{
1581
1582	if (i < op->nrof) {
1583	sub_weight (op->env, op->weight * i);
1584	op->nrof -= i;
1585	if (tmp) {
1586	esrv_send_item(tmp, op);
1587	}
1588	} else {
1589	remove_ob (op);	1784	remove_ob (op);
1590	op->nrof = 0;	1785	op->nrof = 0;
1591	if (tmp) {
1592	esrv_del_item(tmp->contr, op->count);
1593	}	1786	}
1594	}
1595	}
1596	else
1597	{
1598	object *above = op->above;
1599		1787
1600	if (i < op->nrof) {
1601	op->nrof -= i;
1602	} else {
1603	remove_ob (op);
1604	op->nrof = 0;
1605	}
1606	/* Since we just removed op, op->above is null */	1788	/* Since we just removed op, op->above is null */
1607	for (tmp = above; tmp != NULL; tmp = tmp->above)	1789	for (tmp = above; tmp != NULL; tmp = tmp->above)
1608	if (tmp->type == PLAYER) {	1790	if (tmp->type == PLAYER)
		1791	{
1609	if (op->nrof)	1792	if (op->nrof)
1610	esrv_send_item(tmp, op);	1793	esrv_send_item (tmp, op);
1611	else	1794	else
1612	esrv_del_item(tmp->contr, op->count);	1795	esrv_del_item (tmp->contr, op->count);
1613	}	1796	}
1614	}	1797	}
1615		1798
1616	if (op->nrof) {	1799	if (op->nrof)
1617	return op;	1800	return op;
1618	} else {	1801	else
		1802	{
1619	free_object (op);	1803	free_object (op);
1620	return NULL;	1804	return NULL;
1621	}	1805	}
1622	}	1806	}
1623		1807
1624	/*	1808	/*
1625	* add_weight(object, weight) adds the specified weight to an object,	1809	* add_weight(object, weight) adds the specified weight to an object,
1626	* and also updates how much the environment(s) is/are carrying.	1810	* and also updates how much the environment(s) is/are carrying.
1627	*/	1811	*/
1628		1812
		1813	void
1629	void add_weight (object *op, signed long weight) {	1814	add_weight (object *op, signed long weight)
		1815	{
1630	while (op!=NULL) {	1816	while (op != NULL)
		1817	{
1631	if (op->type == CONTAINER) {	1818	if (op->type == CONTAINER)
1632	weight=(signed long)(weight*(100-op->stats.Str)/100);	1819	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1633	}	1820
1634	op->carrying+=weight;	1821	op->carrying += weight;
1635	op=op->env;	1822	op = op->env;
1636	}	1823	}
1637	}	1824	}
1638		1825
1639	/*	1826	/*
1640	* insert_ob_in_ob(op,environment):	1827	* insert_ob_in_ob(op,environment):
1641	* This function inserts the object op in the linked list	1828	* This function inserts the object op in the linked list
…		…
1648	*	1835	*
1649	* The function returns now pointer to inserted item, and return value can	1836	* The function returns now pointer to inserted item, and return value can
1650	* be != op, if items are merged. -Tero	1837	* be != op, if items are merged. -Tero
1651	*/	1838	*/
1652		1839
		1840	object *
1653	object *insert_ob_in_ob(object *op,object *where) {	1841	insert_ob_in_ob (object *op, object *where)
1654	object *tmp, *otmp;	1842	{
		1843	object *
		1844	tmp, *
		1845	otmp;
1655		1846
1656	if(!QUERY_FLAG(op,FLAG_REMOVED)) {	1847	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1848	{
1657	dump_object(op);	1849	dump_object (op);
1658	LOG(llevError,"Trying to insert (ob) inserted object.\n%s\n", errmsg);	1850	LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);
1659	return op;	1851	return op;
1660	}	1852	}
		1853
1661	if(where==NULL) {	1854	if (where == NULL)
		1855	{
1662	dump_object(op);	1856	dump_object (op);
1663	LOG(llevError,"Trying to put object in NULL.\n%s\n", errmsg);	1857	LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);
1664	return op;	1858	return op;
1665	}	1859	}
		1860
1666	if (where->head) {	1861	if (where->head)
1667	LOG(llevDebug,	1862	{
1668	"Warning: Tried to insert object wrong part of multipart object.\n");	1863	LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");
1669	where = where->head;	1864	where = where->head;
1670	}	1865	}
		1866
1671	if (op->more) {	1867	if (op->more)
		1868	{
1672	LOG(llevError, "Tried to insert multipart object %s (%d)\n",	1869	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1673	&op->name, op->count);
1674	return op;	1870	return op;
1675	}	1871	}
		1872
1676	CLEAR_FLAG(op, FLAG_OBJ_ORIGINAL);	1873	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1677	CLEAR_FLAG(op, FLAG_REMOVED);	1874	CLEAR_FLAG (op, FLAG_REMOVED);
1678	if(op->nrof) {	1875	if (op->nrof)
		1876	{
1679	for(tmp=where->inv;tmp!=NULL;tmp=tmp->below)	1877	for (tmp = where->inv; tmp != NULL; tmp = tmp->below)
1680	if ( CAN_MERGE(tmp,op) ) {	1878	if (CAN_MERGE (tmp, op))
		1879	{
1681	/* return the original object and remove inserted object	1880	/* return the original object and remove inserted object
1682	(client needs the original object) */	1881	(client needs the original object) */
1683	tmp->nrof += op->nrof;	1882	tmp->nrof += op->nrof;
1684	/* Weight handling gets pretty funky. Since we are adding to	1883	/* Weight handling gets pretty funky. Since we are adding to
1685	* tmp->nrof, we need to increase the weight.	1884	* tmp->nrof, we need to increase the weight.
1686	*/	1885	*/
1687	add_weight (where, op->weight*op->nrof);	1886	add_weight (where, op->weight * op->nrof);
1688	SET_FLAG(op, FLAG_REMOVED);	1887	SET_FLAG (op, FLAG_REMOVED);
1689	free_object(op); /* free the inserted object */	1888	free_object (op); /* free the inserted object */
1690	op = tmp;	1889	op = tmp;
1691	remove_ob (op); /* and fix old object's links */	1890	remove_ob (op); /* and fix old object's links */
1692	CLEAR_FLAG(op, FLAG_REMOVED);	1891	CLEAR_FLAG (op, FLAG_REMOVED);
1693	break;	1892	break;
1694	}	1893	}
1695		1894
1696	/* I assume combined objects have no inventory	1895	/* I assume combined objects have no inventory
1697	* We add the weight - this object could have just been removed	1896	* We add the weight - this object could have just been removed
1698	* (if it was possible to merge). calling remove_ob will subtract	1897	* (if it was possible to merge). calling remove_ob will subtract
1699	* the weight, so we need to add it in again, since we actually do	1898	* the weight, so we need to add it in again, since we actually do
1700	* the linking below	1899	* the linking below
1701	*/	1900	*/
1702	add_weight (where, op->weight*op->nrof);	1901	add_weight (where, op->weight * op->nrof);
		1902	}
1703	} else	1903	else
1704	add_weight (where, (op->weight+op->carrying));	1904	add_weight (where, (op->weight + op->carrying));
1705		1905
1706	otmp=is_player_inv(where);	1906	otmp = is_player_inv (where);
1707	if (otmp&&otmp->contr!=NULL) {	1907	if (otmp && otmp->contr != NULL)
		1908	{
1708	if (!QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER))	1909	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1709	fix_player(otmp);	1910	fix_player (otmp);
1710	}	1911	}
1711		1912
1712	op->map=NULL;	1913	op->map = NULL;
1713	op->env=where;	1914	op->env = where;
1714	op->above=NULL;	1915	op->above = NULL;
1715	op->below=NULL;	1916	op->below = NULL;
1716	op->x=0,op->y=0;	1917	op->x = 0, op->y = 0;
1717		1918
1718	/* reset the light list and los of the players on the map */	1919	/* reset the light list and los of the players on the map */
1719	if((op->glow_radius!=0)&&where->map)	1920	if ((op->glow_radius != 0) && where->map)
1720	{	1921	{
1721	#ifdef DEBUG_LIGHTS	1922	#ifdef DEBUG_LIGHTS
1722	LOG(llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n",	1923	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1723	op->name);
1724	#endif /* DEBUG_LIGHTS */	1924	#endif /* DEBUG_LIGHTS */
		1925	if (MAP_DARKNESS (where->map))
1725	if (MAP_DARKNESS(where->map)) update_all_los(where->map, where->x, where->y);	1926	update_all_los (where->map, where->x, where->y);
1726	}	1927	}
1727		1928
1728	/* Client has no idea of ordering so lets not bother ordering it here.	1929	/* Client has no idea of ordering so lets not bother ordering it here.
1729	* It sure simplifies this function...	1930	* It sure simplifies this function...
1730	*/	1931	*/
1731	if (where->inv==NULL)	1932	if (where->inv == NULL)
1732	where->inv=op;	1933	where->inv = op;
1733	else {	1934	else
		1935	{
1734	op->below = where->inv;	1936	op->below = where->inv;
1735	op->below->above = op;	1937	op->below->above = op;
1736	where->inv = op;	1938	where->inv = op;
1737	}	1939	}
1738	return op;	1940	return op;
1739	}	1941	}
1740		1942
1741	/*	1943	/*
1742	* Checks if any objects has a move_type that matches objects	1944	* Checks if any objects has a move_type that matches objects
…		…
1757	* MSW 2001-07-08: Check all objects on space, not just those below	1959	* MSW 2001-07-08: Check all objects on space, not just those below
1758	* object being inserted. insert_ob_in_map may not put new objects	1960	* object being inserted. insert_ob_in_map may not put new objects
1759	* on top.	1961	* on top.
1760	*/	1962	*/
1761		1963
		1964	int
1762	int check_move_on (object *op, object *originator)	1965	check_move_on (object *op, object *originator)
1763	{	1966	{
1764	object *tmp;	1967	object *
1765	tag_t tag;	1968	tmp;
1766	mapstruct *m=op->map;	1969	tag_t
		1970	tag;
		1971	mapstruct *
		1972	m = op->map;
		1973	int
1767	int x=op->x, y=op->y;	1974	x = op->x, y = op->y;
1768	MoveType move_on, move_slow, move_block;
1769		1975
		1976	MoveType
		1977	move_on,
		1978	move_slow,
		1979	move_block;
		1980
1770	if(QUERY_FLAG(op,FLAG_NO_APPLY))	1981	if (QUERY_FLAG (op, FLAG_NO_APPLY))
1771	return 0;	1982	return 0;
1772		1983
1773	tag = op->count;	1984	tag = op->count;
1774		1985
1775	move_on = GET_MAP_MOVE_ON(op->map, op->x, op->y);	1986	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1776	move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y);	1987	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1777	move_block = GET_MAP_MOVE_BLOCK(op->map, op->x, op->y);	1988	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1778		1989
1779	/* if nothing on this space will slow op down or be applied,	1990	/* if nothing on this space will slow op down or be applied,
1780	* no need to do checking below. have to make sure move_type	1991	* no need to do checking below. have to make sure move_type
1781	* is set, as lots of objects don't have it set - we treat that	1992	* is set, as lots of objects don't have it set - we treat that
1782	* as walking.	1993	* as walking.
1783	*/	1994	*/
1784	if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow))	1995	if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow))
1785	return 0;	1996	return 0;
1786		1997
1787	/* This is basically inverse logic of that below - basically,	1998	/* This is basically inverse logic of that below - basically,
1788	* if the object can avoid the move on or slow move, they do so,	1999	* if the object can avoid the move on or slow move, they do so,
1789	* but can't do it if the alternate movement they are using is	2000	* but can't do it if the alternate movement they are using is
1790	* blocked. Logic on this seems confusing, but does seem correct.	2001	* blocked. Logic on this seems confusing, but does seem correct.
1791	*/	2002	*/
1792	if ((op->move_type & ~move_on & ~move_block) != 0 &&	2003	if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0)
1793	(op->move_type & ~move_slow & ~move_block) != 0) return 0;	2004	return 0;
1794		2005
1795	/* The objects have to be checked from top to bottom.	2006	/* The objects have to be checked from top to bottom.
1796	* Hence, we first go to the top:	2007	* Hence, we first go to the top:
1797	*/	2008	*/
1798		2009
1799	for (tmp=GET_MAP_OB(op->map, op->x, op->y); tmp!=NULL &&	2010	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)
1800	tmp->above!=NULL; tmp=tmp->above) {	2011	{
1801	/* Trim the search when we find the first other spell effect	2012	/* Trim the search when we find the first other spell effect
1802	* this helps performance so that if a space has 50 spell objects,	2013	* this helps performance so that if a space has 50 spell objects,
1803	* we don't need to check all of them.	2014	* we don't need to check all of them.
1804	*/	2015	*/
1805	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG(tmp, FLAG_NO_PICK)) break;	2016	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
		2017	break;
		2018	}
		2019
		2020	for (; tmp; tmp = tmp->below)
1806	}	2021	{
1807	for(;tmp!=NULL; tmp=tmp->below) {	2022	if (tmp == op)
1808	if (tmp == op) continue; /* Can't apply yourself */	2023	continue; /* Can't apply yourself */
1809		2024
1810	/* Check to see if one of the movement types should be slowed down.	2025	/* Check to see if one of the movement types should be slowed down.
1811	* Second check makes sure that the movement types not being slowed	2026	* Second check makes sure that the movement types not being slowed
1812	* (~slow_move) is not blocked on this space - just because the	2027	* (~slow_move) is not blocked on this space - just because the
1813	* space doesn't slow down swimming (for example), if you can't actually	2028	* space doesn't slow down swimming (for example), if you can't actually
1814	* swim on that space, can't use it to avoid the penalty.	2029	* swim on that space, can't use it to avoid the penalty.
1815	*/	2030	*/
1816	if (!QUERY_FLAG(op, FLAG_WIZPASS)) {	2031	if (!QUERY_FLAG (op, FLAG_WIZPASS))
		2032	{
1817	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	2033	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1818	((op->move_type & tmp->move_slow) &&
1819	(op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) {	2034	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
		2035	{
1820		2036
1821	float diff;	2037	float
1822
1823	diff = tmp->move_slow_penalty*FABS(op->speed);	2038	diff = tmp->move_slow_penalty * FABS (op->speed);
		2039
1824	if (op->type == PLAYER) {	2040	if (op->type == PLAYER)
1825	if ((QUERY_FLAG(tmp, FLAG_IS_HILLY) && find_skill_by_number(op, SK_CLIMBING)) ||	2041	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1826	(QUERY_FLAG(tmp, FLAG_IS_WOODED) && find_skill_by_number(op, SK_WOODSMAN))) {	2042	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1827	diff /= 4.0;	2043	diff /= 4.0;
1828	}	2044
1829	}
1830	op->speed_left -= diff;	2045	op->speed_left -= diff;
1831	}	2046	}
1832	}	2047	}
1833		2048
1834	/* Basically same logic as above, except now for actual apply. */	2049	/* Basically same logic as above, except now for actual apply. */
1835	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||	2050	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
1836	((op->move_type & tmp->move_on) &&
1837	(op->move_type & ~tmp->move_on & ~tmp->move_block)==0)) {	2051	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1838		2052	{
1839	move_apply(tmp, op, originator);	2053	move_apply (tmp, op, originator);
		2054
1840	if (was_destroyed (op, tag))	2055	if (was_destroyed (op, tag))
1841	return 1;	2056	return 1;
1842		2057
1843	/* what the person/creature stepped onto has moved the object	2058	/* what the person/creature stepped onto has moved the object
1844	* someplace new. Don't process any further - if we did,	2059	* someplace new. Don't process any further - if we did,
1845	* have a feeling strange problems would result.	2060	* have a feeling strange problems would result.
1846	*/	2061	*/
1847	if (op->map != m || op->x != x || op->y != y) return 0;	2062	if (op->map != m || op->x != x || op->y != y)
		2063	return 0;
1848	}	2064	}
1849	}	2065	}
		2066
1850	return 0;	2067	return 0;
1851	}	2068	}
1852		2069
1853	/*	2070	/*
1854	* present_arch(arch, map, x, y) searches for any objects with	2071	* present_arch(arch, map, x, y) searches for any objects with
1855	* a matching archetype at the given map and coordinates.	2072	* a matching archetype at the given map and coordinates.
1856	* The first matching object is returned, or NULL if none.	2073	* The first matching object is returned, or NULL if none.
1857	*/	2074	*/
1858		2075
		2076	object *
1859	object *present_arch(const archetype *at, mapstruct *m, int x, int y) {	2077	present_arch (const archetype *at, mapstruct *m, int x, int y)
		2078	{
1860	object *tmp;	2079	object *
		2080	tmp;
		2081
1861	if(m==NULL || out_of_map(m,x,y)) {	2082	if (m == NULL || out_of_map (m, x, y))
		2083	{
1862	LOG(llevError,"Present_arch called outside map.\n");	2084	LOG (llevError, "Present_arch called outside map.\n");
1863	return NULL;	2085	return NULL;
1864	}	2086	}
1865	for(tmp=GET_MAP_OB(m,x,y); tmp != NULL; tmp = tmp->above)	2087	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1866	if(tmp->arch == at)	2088	if (tmp->arch == at)
1867	return tmp;	2089	return tmp;
1868	return NULL;	2090	return NULL;
1869	}	2091	}
1870		2092
1871	/*	2093	/*
1872	* present(type, map, x, y) searches for any objects with	2094	* present(type, map, x, y) searches for any objects with
1873	* a matching type variable at the given map and coordinates.	2095	* a matching type variable at the given map and coordinates.
1874	* The first matching object is returned, or NULL if none.	2096	* The first matching object is returned, or NULL if none.
1875	*/	2097	*/
1876		2098
		2099	object *
1877	object *present(unsigned char type,mapstruct *m, int x,int y) {	2100	present (unsigned char type, mapstruct *m, int x, int y)
		2101	{
1878	object *tmp;	2102	object *
		2103	tmp;
		2104
1879	if(out_of_map(m,x,y)) {	2105	if (out_of_map (m, x, y))
		2106	{
1880	LOG(llevError,"Present called outside map.\n");	2107	LOG (llevError, "Present called outside map.\n");
1881	return NULL;	2108	return NULL;
1882	}	2109	}
1883	for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above)	2110	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1884	if(tmp->type==type)	2111	if (tmp->type == type)
1885	return tmp;	2112	return tmp;
1886	return NULL;	2113	return NULL;
1887	}	2114	}
1888		2115
1889	/*	2116	/*
1890	* present_in_ob(type, object) searches for any objects with	2117	* present_in_ob(type, object) searches for any objects with
1891	* a matching type variable in the inventory of the given object.	2118	* a matching type variable in the inventory of the given object.
1892	* The first matching object is returned, or NULL if none.	2119	* The first matching object is returned, or NULL if none.
1893	*/	2120	*/
1894		2121
		2122	object *
1895	object *present_in_ob(unsigned char type, const object *op) {	2123	present_in_ob (unsigned char type, const object *op)
		2124	{
1896	object *tmp;	2125	object *
		2126	tmp;
		2127
1897	for(tmp=op->inv;tmp!=NULL;tmp=tmp->below)	2128	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
1898	if(tmp->type==type)	2129	if (tmp->type == type)
1899	return tmp;	2130	return tmp;
1900	return NULL;	2131	return NULL;
1901	}	2132	}
1902		2133
1903	/*	2134	/*
…		…
1913	* the object name, not the archetype name. this is so that the	2144	* the object name, not the archetype name. this is so that the
1914	* spell code can use one object type (force), but change it's name	2145	* spell code can use one object type (force), but change it's name
1915	* to be unique.	2146	* to be unique.
1916	*/	2147	*/
1917		2148
		2149	object *
1918	object *present_in_ob_by_name(int type, const char *str, const object *op) {	2150	present_in_ob_by_name (int type, const char *str, const object *op)
		2151	{
1919	object *tmp;	2152	object *
		2153	tmp;
1920		2154
1921	for(tmp=op->inv; tmp!=NULL; tmp=tmp->below) {	2155	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
		2156	{
1922	if ((type==-1 || tmp->type==type) && (!strcmp(str, tmp->name)))	2157	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
1923	return tmp;	2158	return tmp;
1924	}	2159	}
1925	return NULL;	2160	return NULL;
1926	}	2161	}
1927		2162
1928	/*	2163	/*
1929	* present_arch_in_ob(archetype, object) searches for any objects with	2164	* present_arch_in_ob(archetype, object) searches for any objects with
1930	* a matching archetype in the inventory of the given object.	2165	* a matching archetype in the inventory of the given object.
1931	* The first matching object is returned, or NULL if none.	2166	* The first matching object is returned, or NULL if none.
1932	*/	2167	*/
1933		2168
		2169	object *
1934	object *present_arch_in_ob(const archetype *at, const object *op) {	2170	present_arch_in_ob (const archetype *at, const object *op)
		2171	{
1935	object *tmp;	2172	object *
		2173	tmp;
		2174
1936	for(tmp=op->inv;tmp!=NULL;tmp=tmp->below)	2175	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
1937	if( tmp->arch == at)	2176	if (tmp->arch == at)
1938	return tmp;	2177	return tmp;
1939	return NULL;	2178	return NULL;
1940	}	2179	}
1941		2180
1942	/*	2181	/*
1943	* activate recursively a flag on an object inventory	2182	* activate recursively a flag on an object inventory
1944	*/	2183	*/
		2184	void
1945	void flag_inv(object*op, int flag){	2185	flag_inv (object *op, int flag)
		2186	{
1946	object *tmp;	2187	object *
		2188	tmp;
		2189
1947	if(op->inv)	2190	if (op->inv)
1948	for(tmp = op->inv; tmp != NULL; tmp = tmp->below){	2191	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
		2192	{
1949	SET_FLAG(tmp, flag);	2193	SET_FLAG (tmp, flag);
1950	flag_inv(tmp,flag);	2194	flag_inv (tmp, flag);
1951	}	2195	}
1952	}/*	2196	} /*
1953	* desactivate recursively a flag on an object inventory	2197	* desactivate recursively a flag on an object inventory
1954	*/	2198	*/
		2199	void
1955	void unflag_inv(object*op, int flag){	2200	unflag_inv (object *op, int flag)
		2201	{
1956	object *tmp;	2202	object *
		2203	tmp;
		2204
1957	if(op->inv)	2205	if (op->inv)
1958	for(tmp = op->inv; tmp != NULL; tmp = tmp->below){	2206	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
		2207	{
1959	CLEAR_FLAG(tmp, flag);	2208	CLEAR_FLAG (tmp, flag);
1960	unflag_inv(tmp,flag);	2209	unflag_inv (tmp, flag);
1961	}	2210	}
1962	}	2211	}
1963		2212
1964	/*	2213	/*
1965	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in	2214	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1966	* all it's inventory (recursively).	2215	* all it's inventory (recursively).
1967	* If checksums are used, a player will get set_cheat called for	2216	* If checksums are used, a player will get set_cheat called for
1968	* him/her-self and all object carried by a call to this function.	2217	* him/her-self and all object carried by a call to this function.
1969	*/	2218	*/
1970		2219
		2220	void
1971	void set_cheat(object *op) {	2221	set_cheat (object *op)
		2222	{
1972	SET_FLAG(op, FLAG_WAS_WIZ);	2223	SET_FLAG (op, FLAG_WAS_WIZ);
1973	flag_inv(op, FLAG_WAS_WIZ);	2224	flag_inv (op, FLAG_WAS_WIZ);
1974	}	2225	}
1975		2226
1976	/*	2227	/*
1977	* find_free_spot(object, map, x, y, start, stop) will search for	2228	* find_free_spot(object, map, x, y, start, stop) will search for
1978	* a spot at the given map and coordinates which will be able to contain	2229	* a spot at the given map and coordinates which will be able to contain
…		…
1993	* to know if the space in question will block the object. We can't use	2244	* to know if the space in question will block the object. We can't use
1994	* the archetype because that isn't correct if the monster has been	2245	* the archetype because that isn't correct if the monster has been
1995	* customized, changed states, etc.	2246	* customized, changed states, etc.
1996	*/	2247	*/
1997		2248
		2249	int
1998	int find_free_spot(const object *ob, mapstruct *m,int x,int y,int start,int stop) {	2250	find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop)
		2251	{
		2252	int
		2253	i,
1999	int i,index=0, flag;	2254	index = 0, flag;
		2255	static int
2000	static int altern[SIZEOFFREE];	2256	altern[SIZEOFFREE];
2001		2257
2002	for(i=start;i<stop;i++) {	2258	for (i = start; i < stop; i++)
		2259	{
2003	flag = ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]);	2260	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2004	if(!flag)	2261	if (!flag)
2005	altern[index++]=i;	2262	altern[index++] = i;
2006		2263
2007	/* Basically, if we find a wall on a space, we cut down the search size.	2264	/* Basically, if we find a wall on a space, we cut down the search size.
2008	* In this way, we won't return spaces that are on another side of a wall.	2265	* In this way, we won't return spaces that are on another side of a wall.
2009	* This mostly work, but it cuts down the search size in all directions -	2266	* This mostly work, but it cuts down the search size in all directions -
2010	* if the space being examined only has a wall to the north and empty	2267	* if the space being examined only has a wall to the north and empty
2011	* spaces in all the other directions, this will reduce the search space	2268	* spaces in all the other directions, this will reduce the search space
2012	* to only the spaces immediately surrounding the target area, and	2269	* to only the spaces immediately surrounding the target area, and
2013	* won't look 2 spaces south of the target space.	2270	* won't look 2 spaces south of the target space.
2014	*/	2271	*/
2015	else if ((flag & AB_NO_PASS) && maxfree[i]<stop)	2272	else if ((flag & AB_NO_PASS) && maxfree[i] < stop)
2016	stop=maxfree[i];	2273	stop = maxfree[i];
2017	}	2274	}
2018	if(!index) return -1;	2275	if (!index)
		2276	return -1;
2019	return altern[RANDOM()%index];	2277	return altern[RANDOM () % index];
2020	}	2278	}
2021		2279
2022	/*	2280	/*
2023	* find_first_free_spot(archetype, mapstruct, x, y) works like	2281	* find_first_free_spot(archetype, mapstruct, x, y) works like
2024	* find_free_spot(), but it will search max number of squares.	2282	* find_free_spot(), but it will search max number of squares.
2025	* But it will return the first available spot, not a random choice.	2283	* But it will return the first available spot, not a random choice.
2026	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2284	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2027	*/	2285	*/
2028		2286
		2287	int
2029	int find_first_free_spot(const object *ob, mapstruct *m,int x,int y) {	2288	find_first_free_spot (const object *ob, mapstruct *m, int x, int y)
		2289	{
		2290	int
2030	int i;	2291	i;
		2292
2031	for(i=0;i<SIZEOFFREE;i++) {	2293	for (i = 0; i < SIZEOFFREE; i++)
		2294	{
2032	if(!ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]))	2295	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2033	return i;	2296	return i;
2034	}	2297	}
2035	return -1;	2298	return -1;
2036	}	2299	}
2037		2300
2038	/*	2301	/*
2039	* The function permute(arr, begin, end) randomly reorders the array	2302	* The function permute(arr, begin, end) randomly reorders the array
2040	* arr[begin..end-1].	2303	* arr[begin..end-1].
2041	*/	2304	*/
		2305	static void
2042	static void permute(int *arr, int begin, int end)	2306	permute (int *arr, int begin, int end)
2043	{	2307	{
2044	int i, j, tmp, len;	2308	int
		2309	i,
		2310	j,
		2311	tmp,
		2312	len;
2045		2313
2046	len = end-begin;	2314	len = end - begin;
2047	for(i = begin; i < end; i++)	2315	for (i = begin; i < end; i++)
2048	{	2316	{
2049	j = begin+RANDOM()%len;	2317	j = begin + RANDOM () % len;
2050		2318
2051	tmp = arr[i];	2319	tmp = arr[i];
2052	arr[i] = arr[j];	2320	arr[i] = arr[j];
2053	arr[j] = tmp;	2321	arr[j] = tmp;
2054	}	2322	}
2055	}	2323	}
2056		2324
2057	/* new function to make monster searching more efficient, and effective!	2325	/* new function to make monster searching more efficient, and effective!
2058	* This basically returns a randomized array (in the passed pointer) of	2326	* This basically returns a randomized array (in the passed pointer) of
2059	* the spaces to find monsters. In this way, it won't always look for	2327	* the spaces to find monsters. In this way, it won't always look for
2060	* monsters to the north first. However, the size of the array passed	2328	* monsters to the north first. However, the size of the array passed
2061	* covers all the spaces, so within that size, all the spaces within	2329	* covers all the spaces, so within that size, all the spaces within
2062	* the 3x3 area will be searched, just not in a predictable order.	2330	* the 3x3 area will be searched, just not in a predictable order.
2063	*/	2331	*/
		2332	void
2064	void get_search_arr(int *search_arr)	2333	get_search_arr (int *search_arr)
2065	{	2334	{
		2335	int
2066	int i;	2336	i;
2067		2337
2068	for(i = 0; i < SIZEOFFREE; i++)	2338	for (i = 0; i < SIZEOFFREE; i++)
2069	{	2339	{
2070	search_arr[i] = i;	2340	search_arr[i] = i;
2071	}	2341	}
2072		2342
2073	permute(search_arr, 1, SIZEOFFREE1+1);	2343	permute (search_arr, 1, SIZEOFFREE1 + 1);
2074	permute(search_arr, SIZEOFFREE1+1, SIZEOFFREE2+1);	2344	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2075	permute(search_arr, SIZEOFFREE2+1, SIZEOFFREE);	2345	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2076	}	2346	}
2077		2347
2078	/*	2348	/*
2079	* find_dir(map, x, y, exclude) will search some close squares in the	2349	* find_dir(map, x, y, exclude) will search some close squares in the
2080	* given map at the given coordinates for live objects.	2350	* given map at the given coordinates for live objects.
…		…
2086	* is actually want is going to try and move there. We need this info	2356	* is actually want is going to try and move there. We need this info
2087	* because we have to know what movement the thing looking to move	2357	* because we have to know what movement the thing looking to move
2088	* there is capable of.	2358	* there is capable of.
2089	*/	2359	*/
2090		2360
		2361	int
2091	int find_dir(mapstruct *m, int x, int y, object *exclude) {	2362	find_dir (mapstruct *m, int x, int y, object *exclude)
		2363	{
		2364	int
		2365	i,
2092	int i,max=SIZEOFFREE, mflags;	2366	max = SIZEOFFREE, mflags;
		2367
2093	sint16 nx, ny;	2368	sint16 nx, ny;
2094	object *tmp;	2369	object *
		2370	tmp;
2095	mapstruct *mp;	2371	mapstruct *
		2372	mp;
		2373
2096	MoveType blocked, move_type;	2374	MoveType blocked, move_type;
2097		2375
2098	if (exclude && exclude->head) {	2376	if (exclude && exclude->head)
		2377	{
2099	exclude = exclude->head;	2378	exclude = exclude->head;
2100	move_type = exclude->move_type;	2379	move_type = exclude->move_type;
2101	} else {	2380	}
		2381	else
		2382	{
2102	/* If we don't have anything, presume it can use all movement types. */	2383	/* If we don't have anything, presume it can use all movement types. */
2103	move_type=MOVE_ALL;	2384	move_type = MOVE_ALL;
		2385	}
		2386
		2387	for (i = 1; i < max; i++)
2104	}	2388	{
2105
2106	for(i=1;i<max;i++) {
2107	mp = m;	2389	mp = m;
2108	nx = x + freearr_x[i];	2390	nx = x + freearr_x[i];
2109	ny = y + freearr_y[i];	2391	ny = y + freearr_y[i];
2110		2392
2111	mflags = get_map_flags(m, &mp, nx, ny, &nx, &ny);	2393	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
2112	if (mflags & P_OUT_OF_MAP) {	2394	if (mflags & P_OUT_OF_MAP)
		2395	{
2113	max = maxfree[i];	2396	max = maxfree[i];
		2397	}
2114	} else {	2398	else
		2399	{
2115	blocked = GET_MAP_MOVE_BLOCK(mp, nx, ny);	2400	blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);
2116		2401
2117	if ((move_type & blocked) == move_type) {	2402	if ((move_type & blocked) == move_type)
		2403	{
2118	max=maxfree[i];	2404	max = maxfree[i];
		2405	}
2119	} else if (mflags & P_IS_ALIVE) {	2406	else if (mflags & P_IS_ALIVE)
		2407	{
2120	for (tmp=GET_MAP_OB(mp,nx,ny); tmp!= NULL; tmp=tmp->above) {	2408	for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)
2121	if ((QUERY_FLAG(tmp,FLAG_MONSTER) || tmp->type==PLAYER) &&	2409	{
2122	(tmp != exclude ||(tmp->head && tmp->head != exclude))) {	2410	if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))
		2411	{
2123	break;	2412	break;
2124	}	2413	}
2125	}	2414	}
2126	if(tmp) {	2415	if (tmp)
		2416	{
2127	return freedir[i];	2417	return freedir[i];
2128	}	2418	}
2129	}	2419	}
2130	}	2420	}
2131	}	2421	}
2132	return 0;	2422	return 0;
2133	}	2423	}
2134		2424
2135	/*	2425	/*
2136	* distance(object 1, object 2) will return the square of the	2426	* distance(object 1, object 2) will return the square of the
2137	* distance between the two given objects.	2427	* distance between the two given objects.
2138	*/	2428	*/
2139		2429
		2430	int
2140	int distance(const object *ob1, const object *ob2) {	2431	distance (const object *ob1, const object *ob2)
		2432	{
2141	int i;	2433	int
2142	i= (ob1->x - ob2->x)*(ob1->x - ob2->x)+	2434	i;
2143	(ob1->y - ob2->y)*(ob1->y - ob2->y);	2435
		2436	i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2144	return i;	2437	return i;
2145	}	2438	}
2146		2439
2147	/*	2440	/*
2148	* find_dir_2(delta-x,delta-y) will return a direction in which	2441	* find_dir_2(delta-x,delta-y) will return a direction in which
2149	* an object which has subtracted the x and y coordinates of another	2442	* an object which has subtracted the x and y coordinates of another
2150	* object, needs to travel toward it.	2443	* object, needs to travel toward it.
2151	*/	2444	*/
2152		2445
		2446	int
2153	int find_dir_2(int x, int y) {	2447	find_dir_2 (int x, int y)
		2448	{
2154	int q;	2449	int
		2450	q;
2155		2451
2156	if(y)	2452	if (y)
2157	q=x*100/y;	2453	q = x * 100 / y;
2158	else if (x)	2454	else if (x)
2159	q= -300*x;	2455	q = -300 * x;
2160	else	2456	else
2161	return 0;	2457	return 0;
2162		2458
2163	if(y>0) {	2459	if (y > 0)
		2460	{
2164	if(q < -242)	2461	if (q < -242)
2165	return 3 ;	2462	return 3;
2166	if (q < -41)	2463	if (q < -41)
2167	return 2 ;	2464	return 2;
2168	if (q < 41)	2465	if (q < 41)
2169	return 1 ;	2466	return 1;
2170	if (q < 242)	2467	if (q < 242)
2171	return 8 ;	2468	return 8;
2172	return 7 ;	2469	return 7;
2173	}	2470	}
2174		2471
2175	if (q < -242)	2472	if (q < -242)
2176	return 7 ;	2473	return 7;
2177	if (q < -41)	2474	if (q < -41)
2178	return 6 ;	2475	return 6;
2179	if (q < 41)	2476	if (q < 41)
2180	return 5 ;	2477	return 5;
2181	if (q < 242)	2478	if (q < 242)
2182	return 4 ;	2479	return 4;
2183		2480
2184	return 3 ;	2481	return 3;
2185	}	2482	}
2186		2483
2187	/*	2484	/*
2188	* absdir(int): Returns a number between 1 and 8, which represent	2485	* absdir(int): Returns a number between 1 and 8, which represent
2189	* the "absolute" direction of a number (it actually takes care of	2486	* the "absolute" direction of a number (it actually takes care of
2190	* "overflow" in previous calculations of a direction).	2487	* "overflow" in previous calculations of a direction).
2191	*/	2488	*/
2192		2489
		2490	int
2193	int absdir(int d) {	2491	absdir (int d)
2194	while(d<1) d+=8;	2492	{
2195	while(d>8) d-=8;	2493	while (d < 1)
		2494	d += 8;
		2495	while (d > 8)
		2496	d -= 8;
2196	return d;	2497	return d;
2197	}	2498	}
2198		2499
2199	/*	2500	/*
2200	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2501	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2201	* between two directions (which are expected to be absolute (see absdir())	2502	* between two directions (which are expected to be absolute (see absdir())
2202	*/	2503	*/
2203		2504
		2505	int
2204	int dirdiff(int dir1, int dir2) {	2506	dirdiff (int dir1, int dir2)
		2507	{
2205	int d;	2508	int
		2509	d;
		2510
2206	d = abs(dir1 - dir2);	2511	d = abs (dir1 - dir2);
2207	if(d>4)	2512	if (d > 4)
2208	d = 8 - d;	2513	d = 8 - d;
2209	return d;	2514	return d;
2210	}	2515	}
2211		2516
2212	/* peterm:	2517	/* peterm:
…		…
2217	* direction 4, 14, or 16 to get back to where we are.	2522	* direction 4, 14, or 16 to get back to where we are.
2218	* Moved from spell_util.c to object.c with the other related direction	2523	* Moved from spell_util.c to object.c with the other related direction
2219	* functions.	2524	* functions.
2220	*/	2525	*/
2221		2526
		2527	int
2222	int reduction_dir[SIZEOFFREE][3] = {	2528	reduction_dir[SIZEOFFREE][3] = {
2223	{0,0,0}, /* 0 */	2529	{0, 0, 0}, /* 0 */
2224	{0,0,0}, /* 1 */	2530	{0, 0, 0}, /* 1 */
2225	{0,0,0}, /* 2 */	2531	{0, 0, 0}, /* 2 */
2226	{0,0,0}, /* 3 */	2532	{0, 0, 0}, /* 3 */
2227	{0,0,0}, /* 4 */	2533	{0, 0, 0}, /* 4 */
2228	{0,0,0}, /* 5 */	2534	{0, 0, 0}, /* 5 */
2229	{0,0,0}, /* 6 */	2535	{0, 0, 0}, /* 6 */
2230	{0,0,0}, /* 7 */	2536	{0, 0, 0}, /* 7 */
2231	{0,0,0}, /* 8 */	2537	{0, 0, 0}, /* 8 */
2232	{8,1,2}, /* 9 */	2538	{8, 1, 2}, /* 9 */
2233	{1,2,-1}, /* 10 */	2539	{1, 2, -1}, /* 10 */
2234	{2,10,12}, /* 11 */	2540	{2, 10, 12}, /* 11 */
2235	{2,3,-1}, /* 12 */	2541	{2, 3, -1}, /* 12 */
2236	{2,3,4}, /* 13 */	2542	{2, 3, 4}, /* 13 */
2237	{3,4,-1}, /* 14 */	2543	{3, 4, -1}, /* 14 */
2238	{4,14,16}, /* 15 */	2544	{4, 14, 16}, /* 15 */
2239	{5,4,-1}, /* 16 */	2545	{5, 4, -1}, /* 16 */
2240	{4,5,6}, /* 17 */	2546	{4, 5, 6}, /* 17 */
2241	{6,5,-1}, /* 18 */	2547	{6, 5, -1}, /* 18 */
2242	{6,20,18}, /* 19 */	2548	{6, 20, 18}, /* 19 */
2243	{7,6,-1}, /* 20 */	2549	{7, 6, -1}, /* 20 */
2244	{6,7,8}, /* 21 */	2550	{6, 7, 8}, /* 21 */
2245	{7,8,-1}, /* 22 */	2551	{7, 8, -1}, /* 22 */
2246	{8,22,24}, /* 23 */	2552	{8, 22, 24}, /* 23 */
2247	{8,1,-1}, /* 24 */	2553	{8, 1, -1}, /* 24 */
2248	{24,9,10}, /* 25 */	2554	{24, 9, 10}, /* 25 */
2249	{9,10,-1}, /* 26 */	2555	{9, 10, -1}, /* 26 */
2250	{10,11,-1}, /* 27 */	2556	{10, 11, -1}, /* 27 */
2251	{27,11,29}, /* 28 */	2557	{27, 11, 29}, /* 28 */
2252	{11,12,-1}, /* 29 */	2558	{11, 12, -1}, /* 29 */
2253	{12,13,-1}, /* 30 */	2559	{12, 13, -1}, /* 30 */
2254	{12,13,14}, /* 31 */	2560	{12, 13, 14}, /* 31 */
2255	{13,14,-1}, /* 32 */	2561	{13, 14, -1}, /* 32 */
2256	{14,15,-1}, /* 33 */	2562	{14, 15, -1}, /* 33 */
2257	{33,15,35}, /* 34 */	2563	{33, 15, 35}, /* 34 */
2258	{16,15,-1}, /* 35 */	2564	{16, 15, -1}, /* 35 */
2259	{17,16,-1}, /* 36 */	2565	{17, 16, -1}, /* 36 */
2260	{18,17,16}, /* 37 */	2566	{18, 17, 16}, /* 37 */
2261	{18,17,-1}, /* 38 */	2567	{18, 17, -1}, /* 38 */
2262	{18,19,-1}, /* 39 */	2568	{18, 19, -1}, /* 39 */
2263	{41,19,39}, /* 40 */	2569	{41, 19, 39}, /* 40 */
2264	{19,20,-1}, /* 41 */	2570	{19, 20, -1}, /* 41 */
2265	{20,21,-1}, /* 42 */	2571	{20, 21, -1}, /* 42 */
2266	{20,21,22}, /* 43 */	2572	{20, 21, 22}, /* 43 */
2267	{21,22,-1}, /* 44 */	2573	{21, 22, -1}, /* 44 */
2268	{23,22,-1}, /* 45 */	2574	{23, 22, -1}, /* 45 */
2269	{45,47,23}, /* 46 */	2575	{45, 47, 23}, /* 46 */
2270	{23,24,-1}, /* 47 */	2576	{23, 24, -1}, /* 47 */
2271	{24,9,-1}}; /* 48 */	2577	{24, 9, -1}
		2578	}; /* 48 */
2272		2579
2273	/* Recursive routine to step back and see if we can	2580	/* Recursive routine to step back and see if we can
2274	* find a path to that monster that we found. If not,	2581	* find a path to that monster that we found. If not,
2275	* we don't bother going toward it. Returns 1 if we	2582	* we don't bother going toward it. Returns 1 if we
2276	* can see a direct way to get it	2583	* can see a direct way to get it
2277	* Modified to be map tile aware -.MSW	2584	* Modified to be map tile aware -.MSW
2278	*/	2585	*/
2279
2280		2586
		2587
		2588	int
2281	int can_see_monsterP(mapstruct *m, int x, int y,int dir) {	2589	can_see_monsterP (mapstruct *m, int x, int y, int dir)
		2590	{
2282	sint16 dx, dy;	2591	sint16 dx, dy;
		2592	int
2283	int mflags;	2593	mflags;
2284		2594
		2595	if (dir < 0)
2285	if(dir<0) return 0; /* exit condition: invalid direction */	2596	return 0; /* exit condition: invalid direction */
2286		2597
2287	dx = x + freearr_x[dir];	2598	dx = x + freearr_x[dir];
2288	dy = y + freearr_y[dir];	2599	dy = y + freearr_y[dir];
2289		2600
2290	mflags = get_map_flags(m, &m, dx, dy, &dx, &dy);	2601	mflags = get_map_flags (m, &m, dx, dy, &dx, &dy);
2291		2602
2292	/* This functional arguably was incorrect before - it was	2603	/* This functional arguably was incorrect before - it was
2293	* checking for P_WALL - that was basically seeing if	2604	* checking for P_WALL - that was basically seeing if
2294	* we could move to the monster - this is being more	2605	* we could move to the monster - this is being more
2295	* literal on if we can see it. To know if we can actually	2606	* literal on if we can see it. To know if we can actually
2296	* move to the monster, we'd need the monster passed in or	2607	* move to the monster, we'd need the monster passed in or
2297	* at least its move type.	2608	* at least its move type.
2298	*/	2609	*/
2299	if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW)) return 0;	2610	if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW))
		2611	return 0;
2300		2612
2301	/* yes, can see. */	2613	/* yes, can see. */
2302	if(dir < 9) return 1;	2614	if (dir < 9)
		2615	return 1;
2303	return can_see_monsterP(m, x, y, reduction_dir[dir][0]) |	2616	return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |
2304	can_see_monsterP(m,x,y, reduction_dir[dir][1]) |	2617	can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2305	can_see_monsterP(m,x,y, reduction_dir[dir][2]);
2306	}	2618	}
2307		2619
2308		2620
2309		2621
2310	/*	2622	/*
2311	* can_pick(picker, item): finds out if an object is possible to be	2623	* can_pick(picker, item): finds out if an object is possible to be
2312	* picked up by the picker. Returnes 1 if it can be	2624	* picked up by the picker. Returnes 1 if it can be
2313	* picked up, otherwise 0.	2625	* picked up, otherwise 0.
2314	*	2626	*
…		…
2316	* core dumps if they do.	2628	* core dumps if they do.
2317	*	2629	*
2318	* Add a check so we can't pick up invisible objects (0.93.8)	2630	* Add a check so we can't pick up invisible objects (0.93.8)
2319	*/	2631	*/
2320		2632
		2633	int
2321	int can_pick(const object *who, const object *item) {	2634	can_pick (const object *who, const object *item)
		2635	{
2322	return /*QUERY_FLAG(who,FLAG_WIZ)||*/	2636	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2323	(item->weight>0&&!QUERY_FLAG(item,FLAG_NO_PICK)&&	2637	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2324	!QUERY_FLAG(item,FLAG_ALIVE)&&!item->invisible &&	2638	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2325	(who->type==PLAYER||item->weight<who->weight/3));
2326	}	2639	}
2327		2640
2328		2641
2329	/*	2642	/*
2330	* create clone from object to another	2643	* create clone from object to another
2331	*/	2644	*/
		2645	object *
2332	object *object_create_clone (object *asrc) {	2646	object_create_clone (object *asrc)
		2647	{
		2648	object *
2333	object *dst = NULL,*tmp,*src,*part,*prev, *item;	2649	dst = NULL, *tmp, *src, *part, *prev, *item;
2334		2650
		2651	if (!asrc)
2335	if(!asrc) return NULL;	2652	return NULL;
2336	src = asrc;	2653	src = asrc;
2337	if(src->head)	2654	if (src->head)
2338	src = src->head;	2655	src = src->head;
2339		2656
2340	prev = NULL;	2657	prev = NULL;
2341	for(part = src; part; part = part->more) {	2658	for (part = src; part; part = part->more)
		2659	{
2342	tmp = get_object();	2660	tmp = get_object ();
2343	copy_object(part,tmp);	2661	copy_object (part, tmp);
2344	tmp->x -= src->x;	2662	tmp->x -= src->x;
2345	tmp->y -= src->y;	2663	tmp->y -= src->y;
2346	if(!part->head) {	2664	if (!part->head)
		2665	{
2347	dst = tmp;	2666	dst = tmp;
2348	tmp->head = NULL;	2667	tmp->head = NULL;
		2668	}
2349	} else {	2669	else
		2670	{
2350	tmp->head = dst;	2671	tmp->head = dst;
2351	}	2672	}
2352	tmp->more = NULL;	2673	tmp->more = NULL;
2353	if(prev)	2674	if (prev)
2354	prev->more = tmp;	2675	prev->more = tmp;
2355	prev = tmp;	2676	prev = tmp;
2356	}	2677	}
		2678
2357	/*** copy inventory ***/	2679	/*** copy inventory ***/
2358	for(item = src->inv; item; item = item->below) {	2680	for (item = src->inv; item; item = item->below)
		2681	{
2359	(void) insert_ob_in_ob(object_create_clone(item),dst);	2682	(void) insert_ob_in_ob (object_create_clone (item), dst);
2360	}	2683	}
2361		2684
2362	return dst;	2685	return dst;
2363	}	2686	}
2364		2687
2365	/* return true if the object was destroyed, 0 otherwise */	2688	/* return true if the object was destroyed, 0 otherwise */
		2689	int
2366	int was_destroyed (const object *op, tag_t old_tag)	2690	was_destroyed (const object *op, tag_t old_tag)
2367	{	2691	{
2368	/* checking for FLAG_FREED isn't necessary, but makes this function more	2692	/* checking for FLAG_FREED isn't necessary, but makes this function more
2369	* robust */	2693	* robust */
2370	return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);	2694	return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);
2371	}	2695	}
2372		2696
2373	/* GROS - Creates an object using a string representing its content. */	2697	/* GROS - Creates an object using a string representing its content. */
		2698
2374	/* Basically, we save the content of the string to a temp file, then call */	2699	/* Basically, we save the content of the string to a temp file, then call */
		2700
2375	/* load_object on it. I admit it is a highly inefficient way to make things, */	2701	/* load_object on it. I admit it is a highly inefficient way to make things, */
		2702
2376	/* but it was simple to make and allows reusing the load_object function. */	2703	/* but it was simple to make and allows reusing the load_object function. */
		2704
2377	/* Remember not to use load_object_str in a time-critical situation. */	2705	/* Remember not to use load_object_str in a time-critical situation. */
		2706
2378	/* Also remember that multiparts objects are not supported for now. */	2707	/* Also remember that multiparts objects are not supported for now. */
2379		2708
		2709	object *
2380	object* load_object_str(const char *obstr)	2710	load_object_str (const char *obstr)
2381	{	2711	{
2382	object *op;	2712	object *
		2713	op;
		2714	char
2383	char filename[MAX_BUF];	2715	filename[MAX_BUF];
		2716
2384	sprintf(filename,"%s/cfloadobstr2044",settings.tmpdir);	2717	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2385		2718
		2719	FILE *
2386	FILE *tempfile=fopen(filename,"w");	2720	tempfile = fopen (filename, "w");
		2721
2387	if (tempfile == NULL)	2722	if (tempfile == NULL)
2388	{	2723	{
2389	LOG(llevError,"Error - Unable to access load object temp file\n");	2724	LOG (llevError, "Error - Unable to access load object temp file\n");
2390	return NULL;	2725	return NULL;
2391	};	2726	}
		2727
2392	fprintf(tempfile,obstr);	2728	fprintf (tempfile, obstr);
2393	fclose(tempfile);	2729	fclose (tempfile);
2394		2730
2395	op=get_object();	2731	op = get_object ();
2396		2732
2397	object_thawer thawer (filename);	2733	object_thawer thawer (filename);
2398		2734
2399	if (thawer)	2735	if (thawer)
2400	load_object(thawer,op,0);	2736	load_object (thawer, op, 0);
2401		2737
2402	LOG(llevDebug," load str completed, object=%s\n", &op->name);	2738	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2403	CLEAR_FLAG(op,FLAG_REMOVED);	2739	CLEAR_FLAG (op, FLAG_REMOVED);
2404		2740
2405	return op;	2741	return op;
2406	}	2742	}
2407		2743
2408	/* This returns the first object in who's inventory that	2744	/* This returns the first object in who's inventory that
2409	* has the same type and subtype match.	2745	* has the same type and subtype match.
2410	* returns NULL if no match.	2746	* returns NULL if no match.
2411	*/	2747	*/
		2748	object *
2412	object *find_obj_by_type_subtype(const object *who, int type, int subtype)	2749	find_obj_by_type_subtype (const object *who, int type, int subtype)
2413	{	2750	{
2414	object *tmp;	2751	object *
		2752	tmp;
2415		2753
2416	for (tmp=who->inv; tmp; tmp=tmp->below)	2754	for (tmp = who->inv; tmp; tmp = tmp->below)
2417	if (tmp->type == type && tmp->subtype == subtype) return tmp;	2755	if (tmp->type == type && tmp->subtype == subtype)
		2756	return tmp;
2418		2757
2419	return NULL;	2758	return NULL;
2420	}	2759	}
2421		2760
2422	/* If ob has a field named key, return the link from the list,	2761	/* If ob has a field named key, return the link from the list,
2423	* otherwise return NULL.	2762	* otherwise return NULL.
2424	*	2763	*
2425	* key must be a passed in shared string - otherwise, this won't	2764	* key must be a passed in shared string - otherwise, this won't
2426	* do the desired thing.	2765	* do the desired thing.
2427	*/	2766	*/
		2767	key_value *
2428	key_value * get_ob_key_link(const object * ob, const char * key) {	2768	get_ob_key_link (const object *ob, const char *key)
		2769	{
2429	key_value * link;	2770	key_value *
2430		2771	link;
		2772
2431	for (link = ob->key_values; link != NULL; link = link->next) {	2773	for (link = ob->key_values; link != NULL; link = link->next)
		2774	{
2432	if (link->key == key) {	2775	if (link->key == key)
		2776	{
2433	return link;	2777	return link;
2434	}	2778	}
2435	}
2436		2779	}
		2780
2437	return NULL;	2781	return NULL;
2438	}	2782	}
2439		2783
2440	/*	2784	/*
2441	* Returns the value of op has an extra_field for key, or NULL.	2785	* Returns the value of op has an extra_field for key, or NULL.
2442	*	2786	*
2443	* The argument doesn't need to be a shared string.	2787	* The argument doesn't need to be a shared string.
2444	*	2788	*
2445	* The returned string is shared.	2789	* The returned string is shared.
2446	*/	2790	*/
		2791	const char *
2447	const char * get_ob_key_value(const object * op, const char * const key) {	2792	get_ob_key_value (const object *op, const char *const key)
		2793	{
2448	key_value * link;	2794	key_value *link;
2449	const char * canonical_key;	2795	shstr_cmp canonical_key (key);
		2796
		2797	if (!canonical_key)
2450		2798	{
2451	canonical_key = shstr::find (key);
2452
2453	if (canonical_key == NULL) {
2454	/* 1. There being a field named key on any object	2799	/* 1. There being a field named key on any object
2455	* implies there'd be a shared string to find.	2800	* implies there'd be a shared string to find.
2456	* 2. Since there isn't, no object has this field.	2801	* 2. Since there isn't, no object has this field.
2457	* 3. Therefore, *this* object doesn't have this field.	2802	* 3. Therefore, *this* object doesn't have this field.
2458	*/	2803	*/
2459	return NULL;	2804	return 0;
2460	}	2805	}
2461		2806
2462	/* This is copied from get_ob_key_link() above -	2807	/* This is copied from get_ob_key_link() above -
2463	* only 4 lines, and saves the function call overhead.	2808	* only 4 lines, and saves the function call overhead.
2464	*/	2809	*/
2465	for (link = op->key_values; link != NULL; link = link->next) {	2810	for (link = op->key_values; link; link = link->next)
2466	if (link->key == canonical_key) {	2811	if (link->key == canonical_key)
2467	return link->value;	2812	return link->value;
2468	}	2813
2469	}	2814	return 0;
2470	return NULL;
2471	}	2815	}
2472		2816
2473		2817
2474	/*	2818	/*
2475	* Updates the canonical_key in op to value.	2819	* Updates the canonical_key in op to value.
…		…
2479	* Unless add_key is TRUE, it won't add fields, only change the value of existing	2823	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2480	* keys.	2824	* keys.
2481	*	2825	*
2482	* Returns TRUE on success.	2826	* Returns TRUE on success.
2483	*/	2827	*/
		2828	int
2484	int set_ob_key_value_s(object * op, const shstr &canonical_key, const char * value, int add_key) {	2829	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
		2830	{
		2831	key_value *
2485	key_value * field = NULL, *last=NULL;	2832	field = NULL, *last = NULL;
2486		2833
2487	for (field=op->key_values; field != NULL; field=field->next) {	2834	for (field = op->key_values; field != NULL; field = field->next)
		2835	{
2488	if (field->key != canonical_key) {	2836	if (field->key != canonical_key)
		2837	{
2489	last = field;	2838	last = field;
2490	continue;	2839	continue;
2491	}	2840	}
2492		2841
2493	if (value)	2842	if (value)
2494	field->value = value;	2843	field->value = value;
2495	else {	2844	else
		2845	{
2496	/* Basically, if the archetype has this key set,	2846	/* Basically, if the archetype has this key set,
2497	* we need to store the null value so when we save	2847	* we need to store the null value so when we save
2498	* it, we save the empty value so that when we load,	2848	* it, we save the empty value so that when we load,
2499	* we get this value back again.	2849	* we get this value back again.
2500	*/	2850	*/
2501	if (get_ob_key_link (&op->arch->clone, canonical_key))	2851	if (get_ob_key_link (&op->arch->clone, canonical_key))
2502	field->value = 0;	2852	field->value = 0;
		2853	else
		2854	{
		2855	if (last)
		2856	last->next = field->next;
2503	else	2857	else
2504	{
2505	if (last) last->next = field->next;
2506	else op->key_values = field->next;	2858	op->key_values = field->next;
2507		2859
2508	delete field;	2860	delete field;
2509	}	2861	}
2510	}	2862	}
2511	return TRUE;	2863	return TRUE;
2512	}	2864	}
2513	/* IF we get here, key doesn't exist */	2865	/* IF we get here, key doesn't exist */
2514		2866
2515	/* No field, we'll have to add it. */	2867	/* No field, we'll have to add it. */
		2868
		2869	if (!add_key)
2516		2870	{
2517	if (!add_key) {
2518	return FALSE;	2871	return FALSE;
2519	}	2872	}
2520	/* There isn't any good reason to store a null	2873	/* There isn't any good reason to store a null
2521	* value in the key/value list. If the archetype has	2874	* value in the key/value list. If the archetype has
2522	* this key, then we should also have it, so shouldn't	2875	* this key, then we should also have it, so shouldn't
2523	* be here. If user wants to store empty strings,	2876	* be here. If user wants to store empty strings,
2524	* should pass in ""	2877	* should pass in ""
2525	*/	2878	*/
2526	if (value == NULL) return TRUE;	2879	if (value == NULL)
2527
2528	field = new key_value;
2529
2530	field->key = canonical_key;
2531	field->value = value;
2532	/* Usual prepend-addition. */
2533	field->next = op->key_values;
2534	op->key_values = field;
2535
2536	return TRUE;	2880	return TRUE;
		2881
		2882	field = new key_value;
		2883
		2884	field->key = canonical_key;
		2885	field->value = value;
		2886	/* Usual prepend-addition. */
		2887	field->next = op->key_values;
		2888	op->key_values = field;
		2889
		2890	return TRUE;
2537	}	2891	}
2538		2892
2539	/*	2893	/*
2540	* Updates the key in op to value.	2894	* Updates the key in op to value.
2541	*	2895	*
…		…
2543	* and not add new ones.	2897	* and not add new ones.
2544	* In general, should be little reason FALSE is ever passed in for add_key	2898	* In general, should be little reason FALSE is ever passed in for add_key
2545	*	2899	*
2546	* Returns TRUE on success.	2900	* Returns TRUE on success.
2547	*/	2901	*/
		2902	int
2548	int set_ob_key_value(object * op, const char *key, const char * value, int add_key)	2903	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2549	{	2904	{
2550	shstr key_ (key);	2905	shstr key_ (key);
		2906
2551	return set_ob_key_value_s (op, key_, value, add_key);	2907	return set_ob_key_value_s (op, key_, value, add_key);
2552	}	2908	}
		2909
		2910	object::depth_iterator::depth_iterator (object *container)
		2911	: iterator_base (container)
		2912	{
		2913	while (item->inv)
		2914	item = item->inv;
		2915	}
		2916
		2917	void
		2918	object::depth_iterator::next ()
		2919	{
		2920	if (item->below)
		2921	{
		2922	item = item->below;
		2923
		2924	while (item->inv)
		2925	item = item->inv;
		2926	}
		2927	else
		2928	item = item->env;
		2929	}
		2930
		2931	// return a suitable string describing an objetc in enough detail to find it
		2932	const char *
		2933	object::debug_desc (char *info) const
		2934	{
		2935	char info2[256 * 3];
		2936	char *p = info;
		2937
		2938	p += snprintf (p, 256, "%d=\"%s%s%s\"",
		2939	count,
		2940	&name,
		2941	title ? " " : "",
		2942	title ? (const char *)title : "");
		2943
		2944	if (env)
		2945	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
		2946
		2947	if (map)
		2948	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);
		2949
		2950	return info;
		2951	}
		2952
		2953	const char *
		2954	object::debug_desc () const
		2955	{
		2956	static char info[256 * 3];
		2957	return debug_desc (info);
		2958	}
		2959

Diff Legend

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