ViewVC Help

View File | Revision Log | Show Annotations | Download File

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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.18 by root, Fri Sep 8 16:51:42 2006 UTC vs.
Revision 1.139 by root, Sat Apr 21 17:34:22 2007 UTC

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

Diff Legend

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