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

Diff Legend

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