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.20 by root, Fri Sep 8 18:26:22 2006 UTC vs.
Revision 1.144 by root, Thu May 3 10:39:46 2007 UTC

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

Diff Legend

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