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.145 by root, Mon May 7 03:05:58 2007 UTC

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

Diff Legend

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