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.59 by root, Wed Dec 6 13:59:00 2006 UTC vs.
Revision 1.204 by root, Fri Apr 11 17:01:52 2008 UTC

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

Diff Legend

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