ViewVC Help

View File | Revision Log | Show Annotations | Download File

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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.18 by root, Fri Sep 8 16:51:42 2006 UTC vs.
Revision 1.114 by root, Sun Jan 14 22:06:05 2007 UTC

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

Diff Legend

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