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.38 by root, Wed Sep 13 01:09:24 2006 UTC vs.
Revision 1.133 by root, Fri Feb 16 19:43:40 2007 UTC

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

Diff Legend

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