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.17 by root, Mon Sep 4 17:27:13 2006 UTC vs.
Revision 1.112 by root, Mon Jan 8 14:11:04 2007 UTC

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

Diff Legend

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