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.62 by root, Mon Dec 11 23:35:37 2006 UTC vs.
Revision 1.201 by root, Tue Jan 22 16:22:45 2008 UTC

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

Diff Legend

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