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.14 by root, Mon Sep 4 11:07:59 2006 UTC vs.
Revision 1.108 by root, Sun Jan 7 02:39:13 2007 UTC

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

Diff Legend

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