ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.19 by root, Fri Sep 8 17:14:07 2006 UTC vs.
Revision 1.67 by root, Thu Dec 14 04:30:32 2006 UTC

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

Diff Legend

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