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.22 by root, Sun Sep 10 00:51:23 2006 UTC vs.
Revision 1.81 by root, Sat Dec 23 13:56:25 2006 UTC

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

Diff Legend

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