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.30 by root, Mon Sep 11 20:28:37 2006 UTC vs.
Revision 1.161 by root, Wed Jun 13 21:09:39 2007 UTC

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

Diff Legend

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