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.21 by root, Sat Sep 9 21:48:28 2006 UTC vs.
Revision 1.141 by root, Sun Apr 29 21:44:34 2007 UTC

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

Diff Legend

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