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.47 by root, Thu Sep 14 22:33:59 2006 UTC vs.
Revision 1.198 by root, Mon Oct 22 02:52:48 2007 UTC

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

Diff Legend

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