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.10 by root, Thu Aug 31 17:54:14 2006 UTC vs.
Revision 1.137 by root, Mon Apr 16 06:23:40 2007 UTC

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

Diff Legend

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