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.20 by root, Fri Sep 8 18:26:22 2006 UTC vs.
Revision 1.40 by root, Thu Sep 14 00:07:15 2006 UTC

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

Diff Legend

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