ViewVC Help

View File | Revision Log | Show Annotations | Download File

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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.18 by root, Fri Sep 8 16:51:42 2006 UTC vs.
Revision 1.108 by root, Sun Jan 7 02:39:13 2007 UTC

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

Diff Legend

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