ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.30 by root, Mon Sep 11 20:28:37 2006 UTC vs.
Revision 1.106 by root, Wed Jan 3 20:08:04 2007 UTC

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

Diff Legend

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