ViewVC Help

View File | Revision Log | Show Annotations | Download File

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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.20 by root, Fri Sep 8 18:26:22 2006 UTC vs.
Revision 1.53 by root, Tue Nov 7 16:30:54 2006 UTC

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

Diff Legend

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