[ViewVC] Diff of: cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.141 by root, Sun Apr 29 21:44:34 2007 UTC vs.
Revision 1.207 by root, Sun Apr 20 23:25:09 2008 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify
9	* it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
10	* the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	20	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/	22	*/
24		23
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
27	variable. */	26	variable. */
		27
28	#include <global.h>	28	#include <global.h>
29	#include <stdio.h>	29	#include <stdio.h>
30	#include <sys/types.h>	30	#include <sys/types.h>
31	#include <sys/uio.h>	31	#include <sys/uio.h>
32	#include <object.h>	32	#include <object.h>
33	#include <funcpoint.h>	33	#include <funcpoint.h>
		34	#include <sproto.h>
34	#include <loader.h>	35	#include <loader.h>
35		36
36	#include <bitset>	37	#include <bitset>
37		38
38	int nrofallocobjects = 0;	39	UUID UUID::cur;
39	static UUID uuid;	40	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	41	static const uint64 UUID_GAP = 1<<19;
41		42
42	objectvec objects;	43	objectvec objects;
43	activevec actives;	44	activevec actives;
44		45
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,	46	short freearr_x[SIZEOFFREE] = {
		47	0,
		48	0, 1, 1, 1, 0, -1, -1, -1,
		49	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -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	50	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
47	};	51	};
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,	52	short freearr_y[SIZEOFFREE] = {
		53	0,
		54	-1, -1, 0, 1, 1, 1, 0, -1,
		55	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
49	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	56	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
50	};	57	};
51	int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,	58	int maxfree[SIZEOFFREE] = {
		59	0,
		60	9, 10, 13, 14, 17, 18, 21, 22,
		61	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
52	48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49	62	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
53	};	63	};
54	int freedir[SIZEOFFREE] = {	64	int freedir[SIZEOFFREE] = {
55	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	65	0,
		66	1, 2, 3, 4, 5, 6, 7, 8,
		67	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
56	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	68	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
57	};	69	};
58		70
59	static void	71	static void
60	write_uuid (void)	72	write_uuid (uval64 skip, bool sync)
61	{	73	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	74	CALL_BEGIN (2);
63		75	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	76	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	77	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		78	CALL_END;
67	FILE *fp;
68
69	if (!(fp = fopen (filename2, "w")))
70	{
71	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
72	return;
73	}
74
75	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
76	fclose (fp);
77	rename (filename2, filename1);
78	}	79	}
79		80
80	static void	81	static void
81	read_uuid (void)	82	read_uuid (void)
82	{	83	{
83	char filename[MAX_BUF];	84	char filename[MAX_BUF];
84		85
85	sprintf (filename, "%s/uuid", settings.localdir);	86	sprintf (filename, "%s/uuid", settings.localdir);
86		87
		88	seq_next_save = 0;
		89
87	FILE *fp;	90	FILE *fp;
88		91
89	if (!(fp = fopen (filename, "r")))	92	if (!(fp = fopen (filename, "r")))
90	{	93	{
91	if (errno == ENOENT)	94	if (errno == ENOENT)
92	{	95	{
93	LOG (llevInfo, "RESET uid to 1\n");	96	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	97	UUID::cur.seq = 0;
95	write_uuid ();	98	write_uuid (UUID_GAP, true);
96	return;	99	return;
97	}	100	}
98		101
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	102	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	103	_exit (1);
101	}	104	}
102		105
103	int version;	106	UUID::BUF buf;
104	unsigned long long uid;	107	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) \|\| version != 1)	108	fgets (buf, sizeof (buf), fp);
		109
		110	if (!UUID::cur.parse (buf))
106	{	111	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	112	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	113	_exit (1);
109	}	114	}
110		115
111	uuid.seq = uid;	116	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	117
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	118	write_uuid (UUID_GAP, true);
114	fclose (fp);	119	fclose (fp);
115	}	120	}
116		121
117	UUID	122	UUID
118	gen_uuid ()	123	UUID::gen ()
119	{	124	{
120	UUID uid;	125	UUID uid;
121		126
122	uid.seq = ++uuid.seq;	127	uid.seq = ++cur.seq;
123		128
124	if (!(uuid.seq & (UUID_SKIP - 1)))	129	if (expect_false (cur.seq >= seq_next_save))
125	write_uuid ();	130	{
		131	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		132	write_uuid (UUID_GAP, false);
		133	}
		134
126		135
127	return uid;	136	return uid;
128	}	137	}
129		138
130	void	139	void
131	init_uuid ()	140	UUID::init ()
132	{	141	{
133	read_uuid ();	142	read_uuid ();
134	}	143	}
135		144
136	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	145	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
137	static int	146	static bool
138	compare_ob_value_lists_one (const object wants, const object has)	147	compare_ob_value_lists_one (const object wants, const object has)
139	{	148	{
140	key_value *wants_field;	149	key_value *wants_field;
141		150
142	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	151	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
150	key_value *has_field;	159	key_value *has_field;
151		160
152	/* Look for a field in has with the same key. */	161	/* Look for a field in has with the same key. */
153	has_field = get_ob_key_link (has, wants_field->key);	162	has_field = get_ob_key_link (has, wants_field->key);
154		163
155	if (has_field == NULL)	164	if (!has_field)
156	{
157	/* No field with that name. */	165	return 0; /* No field with that name. */
158	return FALSE;
159	}
160		166
161	/* Found the matching field. */	167	/* Found the matching field. */
162	if (has_field->value != wants_field->value)	168	if (has_field->value != wants_field->value)
163	{
164	/* Values don't match, so this half of the comparison is false. */	169	return 0; /* Values don't match, so this half of the comparison is false. */
165	return FALSE;
166	}
167		170
168	/* If we get here, we found a match. Now for the next field in wants. */	171	/* If we get here, we found a match. Now for the next field in wants. */
169	}	172	}
170		173
171	/* If we get here, every field in wants has a matching field in has. */	174	/* If we get here, every field in wants has a matching field in has. */
172	return TRUE;	175	return 1;
173	}	176	}
174		177
175	/* Returns TRUE if ob1 has the same key_values as ob2. */	178	/* Returns TRUE if ob1 has the same key_values as ob2. */
176	static int	179	static bool
177	compare_ob_value_lists (const object ob1, const object ob2)	180	compare_ob_value_lists (const object ob1, const object ob2)
178	{	181	{
179	/* However, there may be fields in has which aren't partnered in wants,	182	/* However, there may be fields in has which aren't partnered in wants,
180	* so we need to run the comparison twice. :(	183	* so we need to run the comparison twice. :(
181	*/	184	*/
…		…
202	\|\| ob1->speed != ob2->speed	205	\|\| ob1->speed != ob2->speed
203	\|\| ob1->value != ob2->value	206	\|\| ob1->value != ob2->value
204	\|\| ob1->name != ob2->name)	207	\|\| ob1->name != ob2->name)
205	return 0;	208	return 0;
206		209
207	//TODO: this ain't working well, use nicer and correct overflow check	210	/* Do not merge objects if nrof would overflow. First part checks
208	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	211	* for unsigned overflow (2c), second part checks wether the result
209	* value could not be stored in a sint32 (which unfortunately sometimes is	212	* would fit into a 32 bit signed int, which is often used to hold
210	* used to store nrof).	213	* nrof values.
211	*/	214	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)	215	if (~ob1->nrof < ob2->nrof \|\| ob1->nrof + ob2->nrof > (1UL << 31))
213	return 0;	216	return 0;
214		217
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	218	/* If the objects have been identified, set the BEEN_APPLIED flag.
216	* This is to the comparison of the flags below will be OK. We	219	* This is to the comparison of the flags below will be OK. We
217	* just can't ignore the been applied or identified flags, as they	220	* just can't ignore the been applied or identified flags, as they
218	* are not equal - just if it has been identified, the been_applied	221	* are not equal - just if it has been identified, the been_applied
219	* flags lose any meaning.	222	* flags lose any meaning.
220	*/	223	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	224	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
…		…
249	\|\| ob1->move_off != ob2->move_off	252	\|\| ob1->move_off != ob2->move_off
250	\|\| ob1->move_slow != ob2->move_slow	253	\|\| ob1->move_slow != ob2->move_slow
251	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty)	254	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty)
252	return 0;	255	return 0;
253		256
254	/* This is really a spellbook check - really, we should	257	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	258	* not merge objects with real inventories, as splitting them
		259	* is hard.
256	*/	260	*/
257	if (ob1->inv \|\| ob2->inv)	261	if (ob1->inv \|\| ob2->inv)
258	{	262	{
259	/* if one object has inventory but the other doesn't, not equiv */	263	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) \|\| (ob2->inv && !ob1->inv))	264	return 0; /* inventories differ in length */
261	return 0;
262		265
263	/* Now check to see if the two inventory objects could merge */	266	if (ob1->inv->below \|\| ob2->inv->below)
		267	return 0; /* more than one object in inv */
		268
264	if (!object::can_merge (ob1->inv, ob2->inv))	269	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	270	return 0; /* inventory objects differ */
266		271
267	/* inventory ok - still need to check rest of this object to see	272	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	273	* if it is valid.
269	*/	274	*/
270	}	275	}
…		…
289	if (ob1->level != ob2->level)	294	if (ob1->level != ob2->level)
290	return 0;	295	return 0;
291	break;	296	break;
292	}	297	}
293		298
294	if (ob1->key_values != NULL \|\| ob2->key_values != NULL)	299	if (ob1->key_values \|\| ob2->key_values)
295	{	300	{
296	/* At least one of these has key_values. */	301	/* At least one of these has key_values. */
297	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	302	if ((!ob1->key_values) != (!ob2->key_values))
298	/* One has fields, but the other one doesn't. */	303	/* One has fields, but the other one doesn't. */
299	return 0;	304	return 0;
300	else if (!compare_ob_value_lists (ob1, ob2))	305	else if (!compare_ob_value_lists (ob1, ob2))
301	return 0;	306	return 0;
302	}	307	}
303		308
304	//TODO: generate an event or call into perl for additional checks
305	if (ob1->self \|\| ob2->self)	309	if (ob1->self \|\| ob2->self)
306	{	310	{
307	ob1->optimise ();	311	ob1->optimise ();
308	ob2->optimise ();	312	ob2->optimise ();
309		313
310	if (ob1->self \|\| ob2->self)	314	if (ob1->self \|\| ob2->self)
		315	{
		316	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		317	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		318
		319	if (k1 != k2)
311	return 0;	320	return 0;
		321	else if (k1 == 0)
		322	return 1;
		323	else if (!cfperl_can_merge (ob1, ob2))
		324	return 0;
		325	}
312	}	326	}
313		327
314	/* Everything passes, must be OK. */	328	/* Everything passes, must be OK. */
315	return 1;	329	return 1;
316	}	330	}
317		331
		332	static sint32
		333	weight_adjust (object *op, sint32 weight)
		334	{
		335	return op->type == CONTAINER
		336	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		337	: weight;
		338	}
		339
		340	/*
		341	* add_weight(object, weight) adds the specified weight to an object,
		342	* and also updates how much the environment(s) is/are carrying.
		343	*/
		344	static void
		345	add_weight (object *op, sint32 weight)
		346	{
		347	while (op)
		348	{
		349	weight = weight_adjust (op, weight);
		350
		351	op->carrying += weight;
		352	op = op->env;
		353	}
		354	}
		355
		356	/*
		357	* sub_weight() recursively (outwards) subtracts a number from the
		358	* weight of an object (and what is carried by it's environment(s)).
		359	*/
		360	static void
		361	sub_weight (object *op, long weight)
		362	{
		363	add_weight (op, -weight);
		364	}
		365
		366	/*
		367	* this is a recursive function which calculates the weight
		368	* an object is carrying. It goes through op and figures out how much
		369	* containers are carrying, and sums it up.
		370	*/
318	void	371	void
319	player::set_range (rangetype r)	372	object::update_weight ()
320	{	373	{
321	shoottype = r;	374	sint32 sum = 0;
322	}
323		375
324	/*	376	for (object *op = inv; op; op = op->below)
325	* sum_weight() is a recursive function which calculates the weight
326	* an object is carrying. It goes through in figures out how much
327	* containers are carrying, and sums it up.
328	*/
329	long
330	sum_weight (object *op)
331	{
332	long sum;
333	object *inv;
334
335	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)
336	{	377	{
337	if (inv->inv)	378	if (op->inv)
338	sum_weight (inv);	379	op->update_weight ();
339	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
340	}
341		380
342	if (op->type == CONTAINER && op->stats.Str)	381	sum += op->total_weight ();
343	sum = (sum * (100 - op->stats.Str)) / 100;	382	}
344		383
345	if (op->carrying != sum)	384	carrying = weight_adjust (this, sum);
346	op->carrying = sum;
347
348	return sum;
349	}
350
351	/**
352	* Return the outermost environment object for a given object.
353	*/
354
355	object *
356	object_get_env_recursive (object *op)
357	{
358	while (op->env != NULL)
359	op = op->env;
360	return op;
361	}	385	}
362		386
363	/*	387	/*
364	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	388	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
365	* Some error messages.	389	* Some error messages.
…		…
379	/*	403	/*
380	* get_nearest_part(multi-object, object 2) returns the part of the	404	* get_nearest_part(multi-object, object 2) returns the part of the
381	* multi-object 1 which is closest to the second object.	405	* multi-object 1 which is closest to the second object.
382	* If it's not a multi-object, it is returned.	406	* If it's not a multi-object, it is returned.
383	*/	407	*/
384
385	object *	408	object *
386	get_nearest_part (object op, const object pl)	409	get_nearest_part (object op, const object pl)
387	{	410	{
388	object tmp, closest;	411	object tmp, closest;
389	int last_dist, i;	412	int last_dist, i;
…		…
425	break;	448	break;
426		449
427	return op;	450	return op;
428	}	451	}
429		452
430	void
431	free_all_object_data ()
432	{
433	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
434	}
435
436	/*	453	/*
437	* Sets the owner and sets the skill and exp pointers to owner's current	454	* Sets the owner and sets the skill and exp pointers to owner's current
438	* skill and experience objects.	455	* skill and experience objects.
		456	* ACTUALLY NO! investigate! TODO
439	*/	457	*/
440	void	458	void
441	object::set_owner (object *owner)	459	object::set_owner (object *owner)
442	{	460	{
		461	// allow objects which own objects
443	if (!owner)	462	if (owner)
444	return;
445
446	/* next line added to allow objects which own objects */
447	/* Add a check for ownercounts in here, as I got into an endless loop
448	* with the fireball owning a poison cloud which then owned the
449	* fireball. I believe that was caused by one of the objects getting
450	* freed and then another object replacing it. Since the ownercounts
451	* didn't match, this check is valid and I believe that cause is valid.
452	*/
453	while (owner->owner)	463	while (owner->owner)
454	owner = owner->owner;	464	owner = owner->owner;
		465
		466	if (flag [FLAG_FREED])
		467	{
		468	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		469	return;
		470	}
455		471
456	this->owner = owner;	472	this->owner = owner;
		473	}
		474
		475	int
		476	object::slottype () const
		477	{
		478	if (type == SKILL)
		479	{
		480	if (IS_COMBAT_SKILL (subtype)) return slot_combat;
		481	if (IS_RANGED_SKILL (subtype)) return slot_ranged;
		482	}
		483	else
		484	{
		485	if (slot [body_combat].info) return slot_combat;
		486	if (slot [body_range ].info) return slot_ranged;
		487	}
		488
		489	return slot_none;
		490	}
		491
		492	bool
		493	object::change_weapon (object *ob)
		494	{
		495	if (current_weapon == ob)
		496	return true;
		497
		498	if (chosen_skill)
		499	chosen_skill->flag [FLAG_APPLIED] = false;
		500
		501	current_weapon = ob;
		502	chosen_skill = !ob \|\| ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
		503
		504	if (chosen_skill)
		505	chosen_skill->flag [FLAG_APPLIED] = true;
		506
		507	update_stats ();
		508
		509	if (ob)
		510	{
		511	// now check wether any body locations became invalid, in which case
		512	// we cannot apply the weapon at the moment.
		513	for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
		514	if (slot[i].used < 0)
		515	{
		516	current_weapon = chosen_skill = 0;
		517	update_stats ();
		518
		519	new_draw_info_format (NDI_UNIQUE, 0, this,
		520	"You try to balance all your items at once, "
		521	"but the %s is just too much for your body. "
		522	"[You need to unapply some items first.]", &ob->name);
		523	return false;
		524	}
		525
		526	//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
		527	}
		528	else
		529	;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
		530
		531	if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
		532	{
		533	LOG (llevError \| logBacktrace, "%s changed to unapplied weapon %s",
		534	&name, ob->debug_desc ());
		535	return false;
		536	}
		537
		538	return true;
457	}	539	}
458		540
459	/* Zero the key_values on op, decrementing the shared-string	541	/* Zero the key_values on op, decrementing the shared-string
460	* refcounts and freeing the links.	542	* refcounts and freeing the links.
461	*/	543	*/
…		…
525	object::copy_to (object *dst)	607	object::copy_to (object *dst)
526	{	608	{
527	dst = this;	609	dst = this;
528		610
529	if (speed < 0)	611	if (speed < 0)
530	dst->speed_left = speed_left - rndm ();	612	dst->speed_left -= rndm ();
531		613
532	dst->set_speed (dst->speed);	614	dst->set_speed (dst->speed);
533	}	615	}
534		616
535	void	617	void
536	object::instantiate ()	618	object::instantiate ()
537	{	619	{
538	if (!uuid.seq) // HACK	620	if (!uuid.seq) // HACK
539	uuid = gen_uuid ();	621	uuid = UUID::gen ();
540		622
541	speed_left = -0.1f;	623	speed_left = -0.1f;
542	/* copy the body_info to the body_used - this is only really	624	/* copy the body_info to the body_used - this is only really
543	* need for monsters, but doesn't hurt to do it for everything.	625	* need for monsters, but doesn't hurt to do it for everything.
544	* by doing so, when a monster is created, it has good starting	626	* by doing so, when a monster is created, it has good starting
545	* values for the body_used info, so when items are created	627	* values for the body_used info, so when items are created
546	* for it, they can be properly equipped.	628	* for it, they can be properly equipped.
547	*/	629	*/
548	memcpy (body_used, body_info, sizeof (body_used));	630	for (int i = NUM_BODY_LOCATIONS; i--; )
		631	slot[i].used = slot[i].info;
549		632
550	attachable::instantiate ();	633	attachable::instantiate ();
551	}	634	}
552		635
553	object *	636	object *
…		…
702	static int object_count;	785	static int object_count;
703		786
704	void object::link ()	787	void object::link ()
705	{	788	{
706	assert (!index);//D	789	assert (!index);//D
707	uuid = gen_uuid ();	790	uuid = UUID::gen ();
708	count = ++object_count;	791	count = ++object_count;
709		792
710	refcnt_inc ();	793	refcnt_inc ();
711	objects.insert (this);	794	objects.insert (this);
712	}	795	}
…		…
796	* if some form of movement is allowed, let objects	879	* if some form of movement is allowed, let objects
797	* drop on that space.	880	* drop on that space.
798	*/	881	*/
799	if (!drop_to_ground	882	if (!drop_to_ground
800	\|\| !map	883	\|\| !map
801	\|\| map->in_memory != MAP_IN_MEMORY	884	\|\| map->in_memory != MAP_ACTIVE
802	\|\| map->nodrop	885	\|\| map->nodrop
803	\|\| ms ().move_block == MOVE_ALL)	886	\|\| ms ().move_block == MOVE_ALL)
804	{	887	{
805	while (inv)	888	while (inv)
806	{	889	{
…		…
861		944
862	if (!freed_map)	945	if (!freed_map)
863	{	946	{
864	freed_map = new maptile;	947	freed_map = new maptile;
865		948
		949	freed_map->path = "<freed objects map>";
866	freed_map->name = "/internal/freed_objects_map";	950	freed_map->name = "/internal/freed_objects_map";
867	freed_map->width = 3;	951	freed_map->width = 3;
868	freed_map->height = 3;	952	freed_map->height = 3;
		953	freed_map->nodrop = 1;
869		954
870	freed_map->alloc ();	955	freed_map->alloc ();
871	freed_map->in_memory = MAP_IN_MEMORY;	956	freed_map->in_memory = MAP_ACTIVE;
872	}	957	}
873		958
874	map = freed_map;	959	map = freed_map;
875	x = 1;	960	x = 1;
876	y = 1;	961	y = 1;
877	}	962	}
878		963
879	head = 0;
880
881	if (more)	964	if (more)
882	{	965	{
883	more->destroy ();	966	more->destroy ();
884	more = 0;	967	more = 0;
885	}	968	}
886		969
		970	head = 0;
		971
887	// clear those pointers that likely might have circular references to us	972	// clear those pointers that likely might cause circular references
888	owner = 0;	973	owner = 0;
889	enemy = 0;	974	enemy = 0;
890	attacked_by = 0;	975	attacked_by = 0;
		976	current_weapon = 0;
891	}	977	}
892		978
893	void	979	void
894	object::destroy (bool destroy_inventory)	980	object::destroy (bool destroy_inventory)
895	{	981	{
…		…
897	return;	983	return;
898		984
899	if (destroy_inventory)	985	if (destroy_inventory)
900	destroy_inv (false);	986	destroy_inv (false);
901		987
		988	if (is_head ())
		989	if (sound_destroy)
		990	play_sound (sound_destroy);
		991	else if (flag [FLAG_MONSTER])
		992	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
		993
902	attachable::destroy ();	994	attachable::destroy ();
903	}
904
905	/*
906	* sub_weight() recursively (outwards) subtracts a number from the
907	* weight of an object (and what is carried by it's environment(s)).
908	*/
909	void
910	sub_weight (object *op, signed long weight)
911	{
912	while (op != NULL)
913	{
914	if (op->type == CONTAINER)
915	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
916
917	op->carrying -= weight;
918	op = op->env;
919	}
920	}	995	}
921		996
922	/* op->remove ():	997	/* op->remove ():
923	* This function removes the object op from the linked list of objects	998	* This function removes the object op from the linked list of objects
924	* which it is currently tied to. When this function is done, the	999	* which it is currently tied to. When this function is done, the
…		…
1020	if (map->in_memory == MAP_SAVING)	1095	if (map->in_memory == MAP_SAVING)
1021	return;	1096	return;
1022		1097
1023	int check_walk_off = !flag [FLAG_NO_APPLY];	1098	int check_walk_off = !flag [FLAG_NO_APPLY];
1024		1099
		1100	if (object *pl = ms.player ())
		1101	{
		1102	if (pl->container == this)
		1103	/* If a container that the player is currently using somehow gets
		1104	* removed (most likely destroyed), update the player view
		1105	* appropriately.
		1106	*/
		1107	pl->close_container ();
		1108
		1109	pl->contr->ns->floorbox_update ();
		1110	}
		1111
1025	for (tmp = ms.bot; tmp; tmp = tmp->above)	1112	for (tmp = ms.bot; tmp; tmp = tmp->above)
1026	{	1113	{
1027	/* No point updating the players look faces if he is the object	1114	/* No point updating the players look faces if he is the object
1028	* being removed.	1115	* being removed.
1029	*/	1116	*/
1030
1031	if (tmp->type == PLAYER && tmp != this)
1032	{
1033	/* If a container that the player is currently using somehow gets
1034	* removed (most likely destroyed), update the player view
1035	* appropriately.
1036	*/
1037	if (tmp->container == this)
1038	{
1039	flag [FLAG_APPLIED] = 0;
1040	tmp->container = 0;
1041	}
1042
1043	if (tmp->contr->ns)
1044	tmp->contr->ns->floorbox_update ();
1045	}
1046		1117
1047	/* See if object moving off should effect something */	1118	/* See if object moving off should effect something */
1048	if (check_walk_off	1119	if (check_walk_off
1049	&& ((move_type & tmp->move_off)	1120	&& ((move_type & tmp->move_off)
1050	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1121	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
…		…
1053		1124
1054	if (destroyed ())	1125	if (destroyed ())
1055	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1126	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1056	}	1127	}
1057		1128
1058	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1059	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1060	if (tmp->above == tmp)
1061	tmp->above = 0;
1062
1063	last = tmp;	1129	last = tmp;
1064	}	1130	}
1065		1131
1066	/* last == NULL if there are no objects on this space */	1132	/* last == NULL if there are no objects on this space */
1067	//TODO: this makes little sense, why only update the topmost object?	1133	//TODO: this makes little sense, why only update the topmost object?
…		…
1087	merge_ob (object op, object top)	1153	merge_ob (object op, object top)
1088	{	1154	{
1089	if (!op->nrof)	1155	if (!op->nrof)
1090	return 0;	1156	return 0;
1091		1157
1092	if (top)	1158	if (!top)
1093	for (top = op; top && top->above; top = top->above)	1159	for (top = op; top && top->above; top = top->above)
1094	;	1160	;
1095		1161
1096	for (; top; top = top->below)	1162	for (; top; top = top->below)
1097	{	1163	{
…		…
1118	if (more)	1184	if (more)
1119	return;	1185	return;
1120		1186
1121	object *prev = this;	1187	object *prev = this;
1122		1188
1123	for (archetype *at = arch->more; at; at = at->more)	1189	for (archetype at = (archetype )arch->more; at; at = (archetype *)at->more)
1124	{	1190	{
1125	object *op = arch_to_object (at);	1191	object *op = arch_to_object (at);
1126		1192
1127	op->name = name;	1193	op->name = name;
1128	op->name_pl = name_pl;	1194	op->name_pl = name_pl;
…		…
1142	object *	1208	object *
1143	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1209	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1144	{	1210	{
1145	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1211	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1146	{	1212	{
1147	tmp->x = x + tmp->arch->clone.x;	1213	tmp->x = x + tmp->arch->x;
1148	tmp->y = y + tmp->arch->clone.y;	1214	tmp->y = y + tmp->arch->y;
1149	}	1215	}
1150		1216
1151	return insert_ob_in_map (op, m, originator, flag);	1217	return insert_ob_in_map (op, m, originator, flag);
1152	}	1218	}
1153		1219
…		…
1174	object *	1240	object *
1175	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1241	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1176	{	1242	{
1177	assert (!op->flag [FLAG_FREED]);	1243	assert (!op->flag [FLAG_FREED]);
1178		1244
1179	object tmp, top, *floor = NULL;	1245	object top, floor = NULL;
1180		1246
1181	op->remove ();	1247	op->remove ();
1182
1183	#if 0
1184	if (!m->active != !op->active)
1185	if (m->active)
1186	op->activate_recursive ();
1187	else
1188	op->deactivate_recursive ();
1189	#endif
1190
1191	if (out_of_map (m, op->x, op->y))
1192	{
1193	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1194	#ifdef MANY_CORES
1195	/* Better to catch this here, as otherwise the next use of this object
1196	* is likely to cause a crash. Better to find out where it is getting
1197	* improperly inserted.
1198	*/
1199	abort ();
1200	#endif
1201	return op;
1202	}
1203
1204	if (object *more = op->more)
1205	{
1206	if (!insert_ob_in_map (more, m, originator, flag))
1207	{
1208	if (!op->head)
1209	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1210
1211	return 0;
1212	}
1213	}
1214
1215	CLEAR_FLAG (op, FLAG_REMOVED);
1216		1248
1217	/* Ideally, the caller figures this out. However, it complicates a lot	1249	/* Ideally, the caller figures this out. However, it complicates a lot
1218	* of areas of callers (eg, anything that uses find_free_spot would now	1250	* of areas of callers (eg, anything that uses find_free_spot would now
1219	* need extra work	1251	* need extra work
1220	*/	1252	*/
1221	if (!xy_normalise (m, op->x, op->y))	1253	if (!xy_normalise (m, op->x, op->y))
		1254	{
		1255	op->destroy ();
1222	return 0;	1256	return 0;
		1257	}
		1258
		1259	if (object *more = op->more)
		1260	if (!insert_ob_in_map (more, m, originator, flag))
		1261	return 0;
		1262
		1263	CLEAR_FLAG (op, FLAG_REMOVED);
1223		1264
1224	op->map = m;	1265	op->map = m;
1225	mapspace &ms = op->ms ();	1266	mapspace &ms = op->ms ();
1226		1267
1227	/* this has to be done after we translate the coordinates.	1268	/* this has to be done after we translate the coordinates.
1228	*/	1269	*/
1229	if (op->nrof && !(flag & INS_NO_MERGE))	1270	if (op->nrof && !(flag & INS_NO_MERGE))
1230	for (tmp = ms.bot; tmp; tmp = tmp->above)	1271	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1231	if (object::can_merge (op, tmp))	1272	if (object::can_merge (op, tmp))
1232	{	1273	{
1233	op->nrof += tmp->nrof;	1274	op->nrof += tmp->nrof;
1234	tmp->destroy ();	1275	tmp->destroy ();
1235	}	1276	}
…		…
1262	else	1303	else
1263	{	1304	{
1264	top = ms.bot;	1305	top = ms.bot;
1265		1306
1266	/* If there are other objects, then */	1307	/* If there are other objects, then */
1267	if ((!(flag & INS_MAP_LOAD)) && top)	1308	if (top)
1268	{	1309	{
1269	object *last = 0;	1310	object *last = 0;
1270		1311
1271	/*	1312	/*
1272	* If there are multiple objects on this space, we do some trickier handling.	1313	* If there are multiple objects on this space, we do some trickier handling.
…		…
1325	if (last && last->below && last != floor)	1366	if (last && last->below && last != floor)
1326	top = last->below;	1367	top = last->below;
1327	}	1368	}
1328	} /* If objects on this space */	1369	} /* If objects on this space */
1329		1370
1330	if (flag & INS_MAP_LOAD)
1331	top = ms.top;
1332
1333	if (flag & INS_ABOVE_FLOOR_ONLY)	1371	if (flag & INS_ABOVE_FLOOR_ONLY)
1334	top = floor;	1372	top = floor;
1335		1373
1336	/* Top is the object that our object (op) is going to get inserted above.	1374	/* Top is the object that our object (op) is going to get inserted above.
1337	*/	1375	*/
…		…
1369	op->map->touch ();	1407	op->map->touch ();
1370	}	1408	}
1371		1409
1372	op->map->dirty = true;	1410	op->map->dirty = true;
1373		1411
1374	/* If we have a floor, we know the player, if any, will be above
1375	* it, so save a few ticks and start from there.
1376	*/
1377	if (!(flag & INS_MAP_LOAD))
1378	if (object *pl = ms.player ())	1412	if (object *pl = ms.player ())
1379	if (pl->contr->ns)
1380	pl->contr->ns->floorbox_update ();	1413	pl->contr->ns->floorbox_update ();
1381		1414
1382	/* If this object glows, it may affect lighting conditions that are	1415	/* If this object glows, it may affect lighting conditions that are
1383	* visible to others on this map. But update_all_los is really	1416	* visible to others on this map. But update_all_los is really
1384	* an inefficient way to do this, as it means los for all players	1417	* an inefficient way to do this, as it means los for all players
1385	* on the map will get recalculated. The players could very well	1418	* on the map will get recalculated. The players could very well
…		…
1404	* blocked() and wall() work properly), and these flags are updated by	1437	* blocked() and wall() work properly), and these flags are updated by
1405	* update_object().	1438	* update_object().
1406	*/	1439	*/
1407		1440
1408	/* if this is not the head or flag has been passed, don't check walk on status */	1441	/* if this is not the head or flag has been passed, don't check walk on status */
1409	if (!(flag & INS_NO_WALK_ON) && !op->head)	1442	if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1410	{	1443	{
1411	if (check_move_on (op, originator))	1444	if (check_move_on (op, originator))
1412	return 0;	1445	return 0;
1413		1446
1414	/* If we are a multi part object, lets work our way through the check	1447	/* If we are a multi part object, lets work our way through the check
1415	* walk on's.	1448	* walk on's.
1416	*/	1449	*/
1417	for (tmp = op->more; tmp != NULL; tmp = tmp->more)	1450	for (object *tmp = op->more; tmp; tmp = tmp->more)
1418	if (check_move_on (tmp, originator))	1451	if (check_move_on (tmp, originator))
1419	return 0;	1452	return 0;
1420	}	1453	}
1421		1454
1422	return op;	1455	return op;
…		…
1432	object tmp, tmp1;	1465	object tmp, tmp1;
1433		1466
1434	/* first search for itself and remove any old instances */	1467	/* first search for itself and remove any old instances */
1435		1468
1436	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1469	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1437	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */	1470	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1438	tmp->destroy ();	1471	tmp->destroy ();
1439		1472
1440	tmp1 = arch_to_object (archetype::find (arch_string));	1473	tmp1 = arch_to_object (archetype::find (arch_string));
1441		1474
1442	tmp1->x = op->x;	1475	tmp1->x = op->x;
…		…
1445	}	1478	}
1446		1479
1447	object *	1480	object *
1448	object::insert_at (object where, object originator, int flags)	1481	object::insert_at (object where, object originator, int flags)
1449	{	1482	{
		1483	if (where->env)
		1484	return where->env->insert (this);
		1485	else
1450	return where->map->insert (this, where->x, where->y, originator, flags);	1486	return where->map->insert (this, where->x, where->y, originator, flags);
1451	}	1487	}
1452		1488
1453	/*	1489	/*
1454	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1490	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1455	* is returned contains nr objects, and the remaining parts contains	1491	* is returned contains nr objects, and the remaining parts contains
…		…
1475	orig_ob->destroy (1);	1511	orig_ob->destroy (1);
1476	else if (!is_removed)	1512	else if (!is_removed)
1477	{	1513	{
1478	if (orig_ob->env != NULL)	1514	if (orig_ob->env != NULL)
1479	sub_weight (orig_ob->env, orig_ob->weight * nr);	1515	sub_weight (orig_ob->env, orig_ob->weight * nr);
1480	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)	1516	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_ACTIVE)
1481	{	1517	{
1482	strcpy (errmsg, "Tried to split object whose map is not in memory.");	1518	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1483	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");	1519	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1484	return NULL;	1520	return NULL;
1485	}	1521	}
…		…
1575	op->destroy ();	1611	op->destroy ();
1576	return 0;	1612	return 0;
1577	}	1613	}
1578	}	1614	}
1579		1615
1580	/*
1581	* add_weight(object, weight) adds the specified weight to an object,
1582	* and also updates how much the environment(s) is/are carrying.
1583	*/
1584	void
1585	add_weight (object *op, signed long weight)
1586	{
1587	while (op != NULL)
1588	{
1589	if (op->type == CONTAINER)
1590	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1591
1592	op->carrying += weight;
1593	op = op->env;
1594	}
1595	}
1596
1597	object *	1616	object *
1598	insert_ob_in_ob (object op, object where)	1617	insert_ob_in_ob (object op, object where)
1599	{	1618	{
1600	if (!where)	1619	if (!where)
1601	{	1620	{
…		…
1603	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);	1622	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1604	free (dump);	1623	free (dump);
1605	return op;	1624	return op;
1606	}	1625	}
1607		1626
1608	if (where->head)	1627	if (where->head_ () != where)
1609	{	1628	{
1610	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");	1629	LOG (llevError \| logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1611	where = where->head;	1630	where = where->head;
1612	}	1631	}
1613		1632
1614	return where->insert (op);	1633	return where->insert (op);
1615	}	1634	}
…		…
1623	* be != op, if items are merged. -Tero	1642	* be != op, if items are merged. -Tero
1624	*/	1643	*/
1625	object *	1644	object *
1626	object::insert (object *op)	1645	object::insert (object *op)
1627	{	1646	{
1628	object tmp, otmp;
1629
1630	if (!QUERY_FLAG (op, FLAG_REMOVED))	1647	if (!QUERY_FLAG (op, FLAG_REMOVED))
1631	op->remove ();	1648	op->remove ();
1632		1649
1633	if (op->more)	1650	if (op->more)
1634	{	1651	{
…		…
1636	return op;	1653	return op;
1637	}	1654	}
1638		1655
1639	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1656	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1640	CLEAR_FLAG (op, FLAG_REMOVED);	1657	CLEAR_FLAG (op, FLAG_REMOVED);
		1658
1641	if (op->nrof)	1659	if (op->nrof)
1642	{	1660	{
1643	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1661	for (object *tmp = inv; tmp; tmp = tmp->below)
1644	if (object::can_merge (tmp, op))	1662	if (object::can_merge (tmp, op))
1645	{	1663	{
1646	/* return the original object and remove inserted object	1664	/* return the original object and remove inserted object
1647	(client needs the original object) */	1665	(client needs the original object) */
1648	tmp->nrof += op->nrof;	1666	tmp->nrof += op->nrof;
…		…
1667	add_weight (this, op->weight * op->nrof);	1685	add_weight (this, op->weight * op->nrof);
1668	}	1686	}
1669	else	1687	else
1670	add_weight (this, (op->weight + op->carrying));	1688	add_weight (this, (op->weight + op->carrying));
1671		1689
1672	otmp = this->in_player ();	1690	if (object *otmp = this->in_player ())
1673	if (otmp && otmp->contr)
1674	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1691	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1675	otmp->update_stats ();	1692	otmp->update_stats ();
1676		1693
		1694	op->owner = 0; // its his/hers now. period.
1677	op->map = 0;	1695	op->map = 0;
1678	op->env = this;	1696	op->env = this;
1679	op->above = 0;	1697	op->above = 0;
1680	op->below = 0;	1698	op->below = 0;
1681	op->x = 0, op->y = 0;	1699	op->x = op->y = 0;
1682		1700
1683	/* reset the light list and los of the players on the map */	1701	/* reset the light list and los of the players on the map */
1684	if ((op->glow_radius != 0) && map)	1702	if (op->glow_radius && map)
1685	{	1703	{
1686	#ifdef DEBUG_LIGHTS	1704	#ifdef DEBUG_LIGHTS
1687	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1705	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1688	#endif /* DEBUG_LIGHTS */	1706	#endif /* DEBUG_LIGHTS */
1689	if (map->darkness)	1707	if (map->darkness)
…		…
1923	* activate recursively a flag on an object inventory	1941	* activate recursively a flag on an object inventory
1924	*/	1942	*/
1925	void	1943	void
1926	flag_inv (object *op, int flag)	1944	flag_inv (object *op, int flag)
1927	{	1945	{
1928	if (op->inv)
1929	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1946	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1930	{	1947	{
1931	SET_FLAG (tmp, flag);	1948	SET_FLAG (tmp, flag);
1932	flag_inv (tmp, flag);	1949	flag_inv (tmp, flag);
1933	}	1950	}
1934	}	1951	}
1935		1952
1936	/*	1953	/*
1937	* deactivate recursively a flag on an object inventory	1954	* deactivate recursively a flag on an object inventory
1938	*/	1955	*/
1939	void	1956	void
1940	unflag_inv (object *op, int flag)	1957	unflag_inv (object *op, int flag)
1941	{	1958	{
1942	if (op->inv)
1943	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1959	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1944	{	1960	{
1945	CLEAR_FLAG (tmp, flag);	1961	CLEAR_FLAG (tmp, flag);
1946	unflag_inv (tmp, flag);	1962	unflag_inv (tmp, flag);
1947	}	1963	}
1948	}
1949
1950	/*
1951	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1952	* all it's inventory (recursively).
1953	* If checksums are used, a player will get set_cheat called for
1954	* him/her-self and all object carried by a call to this function.
1955	*/
1956	void
1957	set_cheat (object *op)
1958	{
1959	SET_FLAG (op, FLAG_WAS_WIZ);
1960	flag_inv (op, FLAG_WAS_WIZ);
1961	}	1964	}
1962		1965
1963	/*	1966	/*
1964	* find_free_spot(object, map, x, y, start, stop) will search for	1967	* find_free_spot(object, map, x, y, start, stop) will search for
1965	* a spot at the given map and coordinates which will be able to contain	1968	* a spot at the given map and coordinates which will be able to contain
…		…
1967	* to search (see the freearr_x/y[] definition).	1970	* to search (see the freearr_x/y[] definition).
1968	* It returns a random choice among the alternatives found.	1971	* It returns a random choice among the alternatives found.
1969	* start and stop are where to start relative to the free_arr array (1,9	1972	* start and stop are where to start relative to the free_arr array (1,9
1970	* does all 4 immediate directions). This returns the index into the	1973	* does all 4 immediate directions). This returns the index into the
1971	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1974	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1972	* Note - this only checks to see if there is space for the head of the
1973	* object - if it is a multispace object, this should be called for all
1974	* pieces.
1975	* Note2: This function does correctly handle tiled maps, but does not	1975	* Note: This function does correctly handle tiled maps, but does not
1976	* inform the caller. However, insert_ob_in_map will update as	1976	* inform the caller. However, insert_ob_in_map will update as
1977	* necessary, so the caller shouldn't need to do any special work.	1977	* necessary, so the caller shouldn't need to do any special work.
1978	* Note - updated to take an object instead of archetype - this is necessary	1978	* Note - updated to take an object instead of archetype - this is necessary
1979	* because arch_blocked (now ob_blocked) needs to know the movement type	1979	* because arch_blocked (now ob_blocked) needs to know the movement type
1980	* to know if the space in question will block the object. We can't use	1980	* to know if the space in question will block the object. We can't use
…		…
1982	* customized, changed states, etc.	1982	* customized, changed states, etc.
1983	*/	1983	*/
1984	int	1984	int
1985	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)	1985	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
1986	{	1986	{
		1987	int altern[SIZEOFFREE];
1987	int index = 0, flag;	1988	int index = 0, flag;
1988	int altern[SIZEOFFREE];
1989		1989
1990	for (int i = start; i < stop; i++)	1990	for (int i = start; i < stop; i++)
1991	{	1991	{
1992	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1992	mapxy pos (m, x, y); pos.move (i);
1993	if (!flag)	1993
		1994	if (!pos.normalise ())
		1995	continue;
		1996
		1997	mapspace &ms = *pos;
		1998
		1999	if (ms.flags () & P_IS_ALIVE)
		2000	continue;
		2001
		2002	/* However, often
		2003	* ob doesn't have any move type (when used to place exits)
		2004	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2005	*/
		2006	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2007	{
1994	altern [index++] = i;	2008	altern [index++] = i;
		2009	continue;
		2010	}
1995		2011
1996	/* Basically, if we find a wall on a space, we cut down the search size.	2012	/* Basically, if we find a wall on a space, we cut down the search size.
1997	* In this way, we won't return spaces that are on another side of a wall.	2013	* In this way, we won't return spaces that are on another side of a wall.
1998	* This mostly work, but it cuts down the search size in all directions -	2014	* This mostly work, but it cuts down the search size in all directions -
1999	* if the space being examined only has a wall to the north and empty	2015	* if the space being examined only has a wall to the north and empty
2000	* spaces in all the other directions, this will reduce the search space	2016	* spaces in all the other directions, this will reduce the search space
2001	* to only the spaces immediately surrounding the target area, and	2017	* to only the spaces immediately surrounding the target area, and
2002	* won't look 2 spaces south of the target space.	2018	* won't look 2 spaces south of the target space.
2003	*/	2019	*/
2004	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2020	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2021	{
2005	stop = maxfree[i];	2022	stop = maxfree[i];
		2023	continue;
		2024	}
		2025
		2026	/* Note it is intentional that we check ob - the movement type of the
		2027	* head of the object should correspond for the entire object.
		2028	*/
		2029	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2030	continue;
		2031
		2032	if (ob->blocked (m, pos.x, pos.y))
		2033	continue;
		2034
		2035	altern [index++] = i;
2006	}	2036	}
2007		2037
2008	if (!index)	2038	if (!index)
2009	return -1;	2039	return -1;
2010		2040
…		…
2019	*/	2049	*/
2020	int	2050	int
2021	find_first_free_spot (const object ob, maptile m, int x, int y)	2051	find_first_free_spot (const object ob, maptile m, int x, int y)
2022	{	2052	{
2023	for (int i = 0; i < SIZEOFFREE; i++)	2053	for (int i = 0; i < SIZEOFFREE; i++)
2024	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2054	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2025	return i;	2055	return i;
2026		2056
2027	return -1;	2057	return -1;
2028	}	2058	}
2029		2059
…		…
2083	object *tmp;	2113	object *tmp;
2084	maptile *mp;	2114	maptile *mp;
2085		2115
2086	MoveType blocked, move_type;	2116	MoveType blocked, move_type;
2087		2117
2088	if (exclude && exclude->head)	2118	if (exclude && exclude->head_ () != exclude)
2089	{	2119	{
2090	exclude = exclude->head;	2120	exclude = exclude->head;
2091	move_type = exclude->move_type;	2121	move_type = exclude->move_type;
2092	}	2122	}
2093	else	2123	else
…		…
2116	max = maxfree[i];	2146	max = maxfree[i];
2117	else if (mflags & P_IS_ALIVE)	2147	else if (mflags & P_IS_ALIVE)
2118	{	2148	{
2119	for (tmp = ms.bot; tmp; tmp = tmp->above)	2149	for (tmp = ms.bot; tmp; tmp = tmp->above)
2120	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2150	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)
2121	&& (tmp != exclude \|\| (tmp->head && tmp->head != exclude)))	2151	&& (tmp != exclude \|\| (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2122	break;	2152	break;
2123		2153
2124	if (tmp)	2154	if (tmp)
2125	return freedir[i];	2155	return freedir[i];
2126	}	2156	}
…		…
2306	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause	2336	* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2307	* core dumps if they do.	2337	* core dumps if they do.
2308	*	2338	*
2309	* Add a check so we can't pick up invisible objects (0.93.8)	2339	* Add a check so we can't pick up invisible objects (0.93.8)
2310	*/	2340	*/
2311
2312	int	2341	int
2313	can_pick (const object who, const object item)	2342	can_pick (const object who, const object item)
2314	{	2343	{
2315	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /	2344	return /QUERY_FLAG(who,FLAG_WIZ)\|\| /
2316	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&	2345	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
…		…
2321	* create clone from object to another	2350	* create clone from object to another
2322	*/	2351	*/
2323	object *	2352	object *
2324	object_create_clone (object *asrc)	2353	object_create_clone (object *asrc)
2325	{	2354	{
2326	object dst = 0, tmp, src, part, prev, item;	2355	object dst = 0, tmp, src, prev, *item;
2327		2356
2328	if (!asrc)	2357	if (!asrc)
2329	return 0;	2358	return 0;
2330		2359
2331	src = asrc;
2332	if (src->head)
2333	src = src->head;	2360	src = asrc->head_ ();
2334		2361
2335	prev = 0;	2362	prev = 0;
2336	for (part = src; part; part = part->more)	2363	for (object *part = src; part; part = part->more)
2337	{	2364	{
2338	tmp = part->clone ();	2365	tmp = part->clone ();
2339	tmp->x -= src->x;	2366	tmp->x -= src->x;
2340	tmp->y -= src->y;	2367	tmp->y -= src->y;
2341		2368
…		…
2454	/* Basically, if the archetype has this key set,	2481	/* Basically, if the archetype has this key set,
2455	* we need to store the null value so when we save	2482	* we need to store the null value so when we save
2456	* it, we save the empty value so that when we load,	2483	* it, we save the empty value so that when we load,
2457	* we get this value back again.	2484	* we get this value back again.
2458	*/	2485	*/
2459	if (get_ob_key_link (&op->arch->clone, canonical_key))	2486	if (get_ob_key_link (op->arch, canonical_key))
2460	field->value = 0;	2487	field->value = 0;
2461	else	2488	else
2462	{	2489	{
2463	if (last)	2490	if (last)
2464	last->next = field->next;	2491	last->next = field->next;
…		…
2533	}	2560	}
2534	else	2561	else
2535	item = item->env;	2562	item = item->env;
2536	}	2563	}
2537		2564
2538
2539	const char *	2565	const char *
2540	object::flag_desc (char *desc, int len) const	2566	object::flag_desc (char *desc, int len) const
2541	{	2567	{
2542	char *p = desc;	2568	char *p = desc;
2543	bool first = true;	2569	bool first = true;
…		…
2570	{	2596	{
2571	char flagdesc[512];	2597	char flagdesc[512];
2572	char info2[256 * 4];	2598	char info2[256 * 4];
2573	char *p = info;	2599	char *p = info;
2574		2600
2575	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2601	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2576	count, uuid.seq,	2602	count,
		2603	uuid.c_str (),
2577	&name,	2604	&name,
2578	title ? "\",title:\"" : "",	2605	title ? "\",title:\"" : "",
2579	title ? (const char *)title : "",	2606	title ? (const char *)title : "",
2580	flag_desc (flagdesc, 512), type);	2607	flag_desc (flagdesc, 512), type);
2581		2608
2582	if (env)	2609	if (!this->flag[FLAG_REMOVED] && env)
2583	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2610	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2584		2611
2585	if (map)	2612	if (map)
2586	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2613	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2587		2614
…		…
2589	}	2616	}
2590		2617
2591	const char *	2618	const char *
2592	object::debug_desc () const	2619	object::debug_desc () const
2593	{	2620	{
2594	static char info[256 * 4];	2621	static char info[3][256 * 4];
		2622	static int info_idx;
		2623
2595	return debug_desc (info);	2624	return debug_desc (info [++info_idx % 3]);
2596	}
2597
2598	const char *
2599	object::debug_desc2 () const
2600	{
2601	static char info[256 * 4];
2602	return debug_desc (info);
2603	}	2625	}
2604		2626
2605	struct region *	2627	struct region *
2606	object::region () const	2628	object::region () const
2607	{	2629	{
…		…
2610	}	2632	}
2611		2633
2612	const materialtype_t *	2634	const materialtype_t *
2613	object::dominant_material () const	2635	object::dominant_material () const
2614	{	2636	{
2615	if (materialtype_t *mat = name_to_material (materialname))	2637	if (materialtype_t *mt = name_to_material (materialname))
2616	return mat;	2638	return mt;
2617		2639
2618	// omfg this is slow, this has to be temporary :)
2619	shstr unknown ("unknown");
2620
2621	return name_to_material (unknown);	2640	return name_to_material (shstr_unknown);
2622	}	2641	}
2623		2642
2624	void	2643	void
2625	object::open_container (object *new_container)	2644	object::open_container (object *new_container)
2626	{	2645	{
…		…
2642	old_container->flag [FLAG_APPLIED] = 0;	2661	old_container->flag [FLAG_APPLIED] = 0;
2643	container = 0;	2662	container = 0;
2644		2663
2645	esrv_update_item (UPD_FLAGS, this, old_container);	2664	esrv_update_item (UPD_FLAGS, this, old_container);
2646	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2665	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2666	play_sound (sound_find ("chest_close"));
2647	}	2667	}
2648		2668
2649	if (new_container)	2669	if (new_container)
2650	{	2670	{
2651	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))	2671	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
…		…
2667	new_container->flag [FLAG_APPLIED] = 1;	2687	new_container->flag [FLAG_APPLIED] = 1;
2668	container = new_container;	2688	container = new_container;
2669		2689
2670	esrv_update_item (UPD_FLAGS, this, new_container);	2690	esrv_update_item (UPD_FLAGS, this, new_container);
2671	esrv_send_inventory (this, new_container);	2691	esrv_send_inventory (this, new_container);
		2692	play_sound (sound_find ("chest_open"));
		2693	}
		2694	}
		2695
		2696	object *
		2697	object::force_find (const shstr name)
		2698	{
		2699	/* cycle through his inventory to look for the MARK we want to
		2700	* place
		2701	*/
		2702	for (object *tmp = inv; tmp; tmp = tmp->below)
		2703	if (tmp->type == FORCE && tmp->slaying == name)
		2704	return splay (tmp);
		2705
		2706	return 0;
		2707	}
		2708
		2709	void
		2710	object::force_add (const shstr name, int duration)
		2711	{
		2712	if (object *force = force_find (name))
		2713	force->destroy ();
		2714
		2715	object *force = get_archetype (FORCE_NAME);
		2716
		2717	force->slaying = name;
		2718	force->stats.food = 1;
		2719	force->speed_left = -1.f;
		2720
		2721	force->set_speed (duration ? 1.f / duration : 0.f);
		2722	force->flag [FLAG_IS_USED_UP] = true;
		2723	force->flag [FLAG_APPLIED] = true;
		2724
		2725	insert (force);
		2726	}
		2727
		2728	void
		2729	object::play_sound (faceidx sound) const
		2730	{
		2731	if (!sound)
		2732	return;
		2733
		2734	if (flag [FLAG_REMOVED])
		2735	return;
		2736
		2737	if (env)
2672	}	2738	{
		2739	if (object *pl = in_player ())
		2740	pl->contr->play_sound (sound);
		2741	}
		2742	else
		2743	map->play_sound (sound, x, y);
2673	}	2744	}
2674		2745
2675

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.141 by root, Sun Apr 29 21:44:34 2007 UTC vs. Revision 1.207 by root, Sun Apr 20 23:25:09 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.141 by root, Sun Apr 29 21:44:34 2007 UTC vs.
Revision 1.207 by root, Sun Apr 20 23:25:09 2008 UTC