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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.183 by root, Mon Aug 20 19:13:10 2007 UTC vs.
Revision 1.218 by root, Wed Apr 23 07:25:54 2008 UTC

…		…
1	/*	1	/*
2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Crossfire TRT 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 3 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,
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, see <http://www.gnu.org/licenses/>.	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	*	20	*
21	* The authors can be reached via e-mail to <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	22	*/
23		23
24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying
26	variable. */
27	#include <global.h>	24	#include <global.h>
28	#include <stdio.h>	25	#include <stdio.h>
29	#include <sys/types.h>	26	#include <sys/types.h>
30	#include <sys/uio.h>	27	#include <sys/uio.h>
31	#include <object.h>	28	#include <object.h>
32	#include <funcpoint.h>
33	#include <sproto.h>	29	#include <sproto.h>
34	#include <loader.h>	30	#include <loader.h>
35		31
36	#include <bitset>	32	#include <bitset>
37		33
38	int nrofallocobjects = 0;	34	UUID UUID::cur;
39	static UUID uuid;	35	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	36	static const uint64 UUID_GAP = 1<<19;
41		37
42	objectvec objects;	38	objectvec objects;
43	activevec actives;	39	activevec actives;
44		40
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,	41	short freearr_x[SIZEOFFREE] = {
		42	0,
		43	0, 1, 1, 1, 0, -1, -1, -1,
		44	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	45	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	};	46	};
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,	47	short freearr_y[SIZEOFFREE] = {
		48	0,
		49	-1, -1, 0, 1, 1, 1, 0, -1,
		50	-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	51	-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	};	52	};
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,	53	int maxfree[SIZEOFFREE] = {
		54	0,
		55	9, 10, 13, 14, 17, 18, 21, 22,
		56	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	57	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	};	58	};
54	int freedir[SIZEOFFREE] = {	59	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,	60	0,
		61	1, 2, 3, 4, 5, 6, 7, 8,
		62	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	63	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	};	64	};
58		65
59	static void	66	static void
60	write_uuid (void)	67	write_uuid (uval64 skip, bool sync)
61	{	68	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	69	CALL_BEGIN (2);
63		70	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	71	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	72	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		73	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	}	74	}
79		75
80	static void	76	static void
81	read_uuid (void)	77	read_uuid (void)
82	{	78	{
83	char filename[MAX_BUF];	79	char filename[MAX_BUF];
84		80
85	sprintf (filename, "%s/uuid", settings.localdir);	81	sprintf (filename, "%s/uuid", settings.localdir);
		82
		83	seq_next_save = 0;
86		84
87	FILE *fp;	85	FILE *fp;
88		86
89	if (!(fp = fopen (filename, "r")))	87	if (!(fp = fopen (filename, "r")))
90	{	88	{
91	if (errno == ENOENT)	89	if (errno == ENOENT)
92	{	90	{
93	LOG (llevInfo, "RESET uid to 1\n");	91	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	92	UUID::cur.seq = 0;
95	write_uuid ();	93	write_uuid (UUID_GAP, true);
96	return;	94	return;
97	}	95	}
98		96
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	98	_exit (1);
101	}	99	}
102		100
103	int version;	101	UUID::BUF buf;
104	unsigned long long uid;	102	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) \|\| version != 1)	103	fgets (buf, sizeof (buf), fp);
		104
		105	if (!UUID::cur.parse (buf))
106	{	106	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	107	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	108	_exit (1);
109	}	109	}
110		110
111	uuid.seq = uid;	111	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	112
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	113	write_uuid (UUID_GAP, true);
114	fclose (fp);	114	fclose (fp);
115	}	115	}
116		116
117	UUID	117	UUID
118	gen_uuid ()	118	UUID::gen ()
119	{	119	{
120	UUID uid;	120	UUID uid;
121		121
122	uid.seq = ++uuid.seq;	122	uid.seq = ++cur.seq;
123		123
124	if (!(uuid.seq & (UUID_SKIP - 1)))	124	if (expect_false (cur.seq >= seq_next_save))
125	write_uuid ();	125	{
		126	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		127	write_uuid (UUID_GAP, false);
		128	}
		129
126		130
127	return uid;	131	return uid;
128	}	132	}
129		133
130	void	134	void
131	init_uuid ()	135	UUID::init ()
132	{	136	{
133	read_uuid ();	137	read_uuid ();
134	}	138	}
135		139
136	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	140	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
137	static int	141	static bool
138	compare_ob_value_lists_one (const object wants, const object has)	142	compare_ob_value_lists_one (const object wants, const object has)
139	{	143	{
140	key_value *wants_field;	144	key_value *wants_field;
141		145
142	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	146	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
…		…
150	key_value *has_field;	154	key_value *has_field;
151		155
152	/* Look for a field in has with the same key. */	156	/* Look for a field in has with the same key. */
153	has_field = get_ob_key_link (has, wants_field->key);	157	has_field = get_ob_key_link (has, wants_field->key);
154		158
155	if (has_field == NULL)	159	if (!has_field)
156	{
157	/* No field with that name. */	160	return 0; /* No field with that name. */
158	return FALSE;
159	}
160		161
161	/* Found the matching field. */	162	/* Found the matching field. */
162	if (has_field->value != wants_field->value)	163	if (has_field->value != wants_field->value)
163	{
164	/* Values don't match, so this half of the comparison is false. */	164	return 0; /* Values don't match, so this half of the comparison is false. */
165	return FALSE;
166	}
167		165
168	/* If we get here, we found a match. Now for the next field in wants. */	166	/* If we get here, we found a match. Now for the next field in wants. */
169	}	167	}
170		168
171	/* If we get here, every field in wants has a matching field in has. */	169	/* If we get here, every field in wants has a matching field in has. */
172	return TRUE;	170	return 1;
173	}	171	}
174		172
175	/* Returns TRUE if ob1 has the same key_values as ob2. */	173	/* Returns TRUE if ob1 has the same key_values as ob2. */
176	static int	174	static bool
177	compare_ob_value_lists (const object ob1, const object ob2)	175	compare_ob_value_lists (const object ob1, const object ob2)
178	{	176	{
179	/* However, there may be fields in has which aren't partnered in wants,	177	/* However, there may be fields in has which aren't partnered in wants,
180	* so we need to run the comparison twice. :(	178	* so we need to run the comparison twice. :(
181	*/	179	*/
…		…
202	\|\| ob1->speed != ob2->speed	200	\|\| ob1->speed != ob2->speed
203	\|\| ob1->value != ob2->value	201	\|\| ob1->value != ob2->value
204	\|\| ob1->name != ob2->name)	202	\|\| ob1->name != ob2->name)
205	return 0;	203	return 0;
206		204
207	//TODO: this ain't working well, use nicer and correct overflow check	205	/* 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	206	* for unsigned overflow (2c), second part checks whether the result
209	* value could not be stored in a sint32 (which unfortunately sometimes is	207	* would fit into a 32 bit signed int, which is often used to hold
210	* used to store nrof).	208	* nrof values.
211	*/	209	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)	210	if (~ob1->nrof < ob2->nrof \|\| ob1->nrof + ob2->nrof > (1UL << 31))
213	return 0;	211	return 0;
214		212
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	213	/* 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	214	* 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	215	* 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	216	* are not equal - just if it has been identified, the been_applied
219	* flags lose any meaning.	217	* flags lose any meaning.
220	*/	218	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	219	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
222	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	220	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
223		221
224	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	222	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
225	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	223	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
226		224
227	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()	225	if (ob1->arch->name != ob2->arch->name
228	\|\| ob1->arch != ob2->arch
229	\|\| ob1->name != ob2->name	226	\|\| ob1->name != ob2->name
230	\|\| ob1->title != ob2->title	227	\|\| ob1->title != ob2->title
231	\|\| ob1->msg != ob2->msg	228	\|\| ob1->msg != ob2->msg
232	\|\| ob1->weight != ob2->weight	229	\|\| ob1->weight != ob2->weight
233	\|\| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
234	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
235	\|\| ob1->attacktype != ob2->attacktype	230	\|\| ob1->attacktype != ob2->attacktype
236	\|\| ob1->magic != ob2->magic	231	\|\| ob1->magic != ob2->magic
237	\|\| ob1->slaying != ob2->slaying	232	\|\| ob1->slaying != ob2->slaying
238	\|\| ob1->skill != ob2->skill	233	\|\| ob1->skill != ob2->skill
239	\|\| ob1->value != ob2->value	234	\|\| ob1->value != ob2->value
…		…
246	\|\| ob1->move_block != ob2->move_block	241	\|\| ob1->move_block != ob2->move_block
247	\|\| ob1->move_allow != ob2->move_allow	242	\|\| ob1->move_allow != ob2->move_allow
248	\|\| ob1->move_on != ob2->move_on	243	\|\| ob1->move_on != ob2->move_on
249	\|\| ob1->move_off != ob2->move_off	244	\|\| ob1->move_off != ob2->move_off
250	\|\| ob1->move_slow != ob2->move_slow	245	\|\| ob1->move_slow != ob2->move_slow
251	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty)	246	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty
		247	\|\| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
		248	\|\| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
252	return 0;	249	return 0;
253		250
		251	if ((ob1->flag ^ ob2->flag)
		252	.reset (FLAG_INV_LOCKED)
		253	.reset (FLAG_CLIENT_SENT)
		254	.reset (FLAG_REMOVED)
		255	.any ())
		256	return 0;
		257
254	/* This is really a spellbook check - really, we should	258	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	259	* not merge objects with real inventories, as splitting them
		260	* is hard.
256	*/	261	*/
257	if (ob1->inv \|\| ob2->inv)	262	if (ob1->inv \|\| ob2->inv)
258	{	263	{
259	/* if one object has inventory but the other doesn't, not equiv */	264	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) \|\| (ob2->inv && !ob1->inv))	265	return 0; /* inventories differ in length */
261	return 0;
262		266
263	/* Now check to see if the two inventory objects could merge */	267	if (ob1->inv->below \|\| ob2->inv->below)
		268	return 0; /* more than one object in inv */
		269
264	if (!object::can_merge (ob1->inv, ob2->inv))	270	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	271	return 0; /* inventory objects differ */
266		272
267	/* inventory ok - still need to check rest of this object to see	273	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	274	* if it is valid.
269	*/	275	*/
270	}	276	}
…		…
289	if (ob1->level != ob2->level)	295	if (ob1->level != ob2->level)
290	return 0;	296	return 0;
291	break;	297	break;
292	}	298	}
293		299
294	if (ob1->key_values != NULL \|\| ob2->key_values != NULL)	300	if (ob1->key_values \|\| ob2->key_values)
295	{	301	{
296	/* At least one of these has key_values. */	302	/* At least one of these has key_values. */
297	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	303	if ((!ob1->key_values) != (!ob2->key_values))
298	/* One has fields, but the other one doesn't. */	304	return 0; /* One has fields, but the other one doesn't. */
299	return 0;	305
300	else if (!compare_ob_value_lists (ob1, ob2))	306	if (!compare_ob_value_lists (ob1, ob2))
301	return 0;	307	return 0;
302	}	308	}
303		309
304	if (ob1->self \|\| ob2->self)	310	if (ob1->self \|\| ob2->self)
305	{	311	{
306	ob1->optimise ();	312	ob1->optimise ();
307	ob2->optimise ();	313	ob2->optimise ();
308		314
309	if (ob1->self \|\| ob2->self)	315	if (ob1->self \|\| ob2->self)
		316	{
		317	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		318	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		319
		320	if (k1 != k2)
		321	return 0;
		322
		323	if (k1 == 0)
		324	return 1;
		325
310	if (!cfperl_can_merge (ob1, ob2))	326	if (!cfperl_can_merge (ob1, ob2))
311	return 0;	327	return 0;
		328	}
312	}	329	}
313		330
314	/* Everything passes, must be OK. */	331	/* Everything passes, must be OK. */
315	return 1;	332	return 1;
316	}	333	}
317		334
		335	// find player who can see this object
		336	object *
		337	object::visible_to () const
		338	{
		339	if (!flag [FLAG_REMOVED])
		340	{
		341	// see if we are in a container of sorts
		342	if (env)
		343	{
		344	// the player inventory itself is always visible
		345	if (env->type == PLAYER)
		346	return env;
		347
		348	// else a player could have our env open
		349	object *envest = env->outer_env ();
		350
		351	// the player itself is always on a map, so we will find him here
		352	// even if our inv is in a player.
		353	if (envest->is_on_map ())
		354	if (object *pl = envest->ms ().player ())
		355	if (pl->container == env)
		356	return pl;
		357	}
		358	else
		359	{
		360	// maybe there is a player standing on the same mapspace
		361	// this will catch the case where "this" is a player
		362	if (object *pl = ms ().player ())
		363	return pl;
		364	}
		365	}
		366
		367	return 0;
		368	}
		369
		370	// adjust weight per container type ("of holding")
		371	static sint32
		372	weight_adjust (object *op, sint32 weight)
		373	{
		374	return op->type == CONTAINER
		375	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		376	: weight;
		377	}
		378
318	/*	379	/*
		380	* adjust_weight(object, weight) adds the specified weight to an object,
		381	* and also updates how much the environment(s) is/are carrying.
		382	*/
		383	static void
		384	adjust_weight (object *op, sint32 weight)
		385	{
		386	while (op)
		387	{
		388	weight = weight_adjust (op, weight);
		389
		390	if (!weight)
		391	return;
		392
		393	op->carrying += weight;
		394
		395	if (object *pl = op->visible_to ())
		396	if (pl != op) // player is handled lazily
		397	esrv_update_item (UPD_WEIGHT, pl, op);
		398
		399	op = op->env;
		400	}
		401	}
		402
		403	/*
319	* sum_weight() is a recursive function which calculates the weight	404	* this is a recursive function which calculates the weight
320	* an object is carrying. It goes through in figures out how much	405	* an object is carrying. It goes through op and figures out how much
321	* containers are carrying, and sums it up.	406	* containers are carrying, and sums it up.
322	*/	407	*/
323	long	408	void
324	sum_weight (object *op)	409	object::update_weight ()
325	{	410	{
326	long sum;	411	sint32 sum = 0;
327	object *inv;
328		412
329	for (sum = 0, inv = op->inv; inv; inv = inv->below)	413	for (object *op = inv; op; op = op->below)
330	{	414	{
331	if (inv->inv)	415	if (op->inv)
332	sum_weight (inv);	416	op->update_weight ();
333		417
334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	418	sum += op->total_weight ();
		419	}
		420
		421	sum = weight_adjust (this, sum);
		422
		423	if (sum != carrying)
335	}	424	{
336
337	if (op->type == CONTAINER && op->stats.Str)
338	sum = (sum * (100 - op->stats.Str)) / 100;
339
340	if (op->carrying != sum)
341	op->carrying = sum;	425	carrying = sum;
342		426
343	return sum;	427	if (object *pl = visible_to ())
		428	if (pl != this) // player is handled lazily
		429	esrv_update_item (UPD_WEIGHT, pl, this);
		430	}
344	}	431	}
345		432
346	/**	433	/*
347	* Return the outermost environment object for a given object.	434	* Used by: Server DM commands: dumpbelow, dump. Some error messages.
348	*/
349
350	object *
351	object_get_env_recursive (object *op)
352	{
353	while (op->env != NULL)
354	op = op->env;
355	return op;
356	}
357
358	/*
359	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
360	* Some error messages.
361	* The result of the dump is stored in the static global errmsg array.
362	*/	435	*/
363	char *	436	char *
364	dump_object (object *op)	437	dump_object (object *op)
365	{	438	{
366	if (!op)	439	if (!op)
…		…
374	/*	447	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	448	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	449	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	450	* If it's not a multi-object, it is returned.
378	*/	451	*/
379
380	object *	452	object *
381	get_nearest_part (object op, const object pl)	453	get_nearest_part (object op, const object pl)
382	{	454	{
383	object tmp, closest;	455	object tmp, closest;
384	int last_dist, i;	456	int last_dist, i;
385		457
386	if (op->more == NULL)	458	if (!op->more)
387	return op;	459	return op;
		460
388	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	461	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		462	tmp;
		463	tmp = tmp->more)
389	if ((i = distance (tmp, pl)) < last_dist)	464	if ((i = distance (tmp, pl)) < last_dist)
390	closest = tmp, last_dist = i;	465	closest = tmp, last_dist = i;
		466
391	return closest;	467	return closest;
392	}	468	}
393		469
394	/*	470	/*
395	* Returns the object which has the count-variable equal to the argument.	471	* Returns the object which has the count-variable equal to the argument.
		472	* VERRRY slow.
396	*/	473	*/
397	object *	474	object *
398	find_object (tag_t i)	475	find_object (tag_t i)
399	{	476	{
400	for_all_objects (op)	477	for_all_objects (op)
…		…
418	for_all_objects (op)	495	for_all_objects (op)
419	if (op->name == str_)	496	if (op->name == str_)
420	break;	497	break;
421		498
422	return op;	499	return op;
423	}
424
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}	500	}
430		501
431	/*	502	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	503	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	504	* skill and experience objects.
…		…
438	{	509	{
439	// allow objects which own objects	510	// allow objects which own objects
440	if (owner)	511	if (owner)
441	while (owner->owner)	512	while (owner->owner)
442	owner = owner->owner;	513	owner = owner->owner;
		514
		515	if (flag [FLAG_FREED])
		516	{
		517	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		518	return;
		519	}
443		520
444	this->owner = owner;	521	this->owner = owner;
445	}	522	}
446		523
447	int	524	int
…		…
579	object::copy_to (object *dst)	656	object::copy_to (object *dst)
580	{	657	{
581	dst = this;	658	dst = this;
582		659
583	if (speed < 0)	660	if (speed < 0)
584	dst->speed_left = speed_left - rndm ();	661	dst->speed_left -= rndm ();
585		662
586	dst->set_speed (dst->speed);	663	dst->set_speed (dst->speed);
587	}	664	}
588		665
589	void	666	void
590	object::instantiate ()	667	object::instantiate ()
591	{	668	{
592	if (!uuid.seq) // HACK	669	if (!uuid.seq) // HACK
593	uuid = gen_uuid ();	670	uuid = UUID::gen ();
594		671
595	speed_left = -0.1f;	672	speed_left = -0.1f;
596	/* copy the body_info to the body_used - this is only really	673	/* copy the body_info to the body_used - this is only really
597	* need for monsters, but doesn't hurt to do it for everything.	674	* need for monsters, but doesn't hurt to do it for everything.
598	* by doing so, when a monster is created, it has good starting	675	* by doing so, when a monster is created, it has good starting
…		…
757	static int object_count;	834	static int object_count;
758		835
759	void object::link ()	836	void object::link ()
760	{	837	{
761	assert (!index);//D	838	assert (!index);//D
762	uuid = gen_uuid ();	839	uuid = UUID::gen ();
763	count = ++object_count;	840	count = ++object_count;
764		841
765	refcnt_inc ();	842	refcnt_inc ();
766	objects.insert (this);	843	objects.insert (this);
767	}	844	}
…		…
840	object::destroy_inv (bool drop_to_ground)	917	object::destroy_inv (bool drop_to_ground)
841	{	918	{
842	// need to check first, because the checks below might segfault	919	// need to check first, because the checks below might segfault
843	// as we might be on an invalid mapspace and crossfire code	920	// as we might be on an invalid mapspace and crossfire code
844	// is too buggy to ensure that the inventory is empty.	921	// is too buggy to ensure that the inventory is empty.
845	// corollary: if you create arrows etc. with stuff in tis inventory,	922	// corollary: if you create arrows etc. with stuff in its inventory,
846	// cf will crash below with off-map x and y	923	// cf will crash below with off-map x and y
847	if (!inv)	924	if (!inv)
848	return;	925	return;
849		926
850	/* Only if the space blocks everything do we not process -	927	/* Only if the space blocks everything do we not process -
851	* if some form of movement is allowed, let objects	928	* if some form of movement is allowed, let objects
852	* drop on that space.	929	* drop on that space.
853	*/	930	*/
854	if (!drop_to_ground	931	if (!drop_to_ground
855	\|\| !map	932	\|\| !map
856	\|\| map->in_memory != MAP_IN_MEMORY	933	\|\| map->in_memory != MAP_ACTIVE
857	\|\| map->nodrop	934	\|\| map->nodrop
858	\|\| ms ().move_block == MOVE_ALL)	935	\|\| ms ().move_block == MOVE_ALL)
859	{	936	{
860	while (inv)	937	while (inv)
861	{	938	{
862	inv->destroy_inv (drop_to_ground);	939	inv->destroy_inv (false);
863	inv->destroy ();	940	inv->destroy ();
864	}	941	}
865	}	942	}
866	else	943	else
867	{ /* Put objects in inventory onto this space */	944	{ /* Put objects in inventory onto this space */
…		…
873	\|\| op->flag [FLAG_NO_DROP]	950	\|\| op->flag [FLAG_NO_DROP]
874	\|\| op->type == RUNE	951	\|\| op->type == RUNE
875	\|\| op->type == TRAP	952	\|\| op->type == TRAP
876	\|\| op->flag [FLAG_IS_A_TEMPLATE]	953	\|\| op->flag [FLAG_IS_A_TEMPLATE]
877	\|\| op->flag [FLAG_DESTROY_ON_DEATH])	954	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
878	op->destroy ();	955	op->destroy (true);
879	else	956	else
880	map->insert (op, x, y);	957	map->insert (op, x, y);
881	}	958	}
882	}	959	}
883	}	960	}
…		…
890	}	967	}
891		968
892	void	969	void
893	object::do_destroy ()	970	object::do_destroy ()
894	{	971	{
895	attachable::do_destroy ();
896
897	if (flag [FLAG_IS_LINKED])	972	if (flag [FLAG_IS_LINKED])
898	remove_button_link (this);	973	remove_button_link (this);
899		974
900	if (flag [FLAG_FRIENDLY])	975	if (flag [FLAG_FRIENDLY])
901	remove_friendly_object (this);	976	remove_friendly_object (this);
902		977
903	if (!flag [FLAG_REMOVED])
904	remove ();	978	remove ();
905		979
906	destroy_inv (true);	980	attachable::do_destroy ();
907		981
908	deactivate ();	982	deactivate ();
909	unlink ();	983	unlink ();
910		984
911	flag [FLAG_FREED] = 1;	985	flag [FLAG_FREED] = 1;
…		…
916		990
917	if (!freed_map)	991	if (!freed_map)
918	{	992	{
919	freed_map = new maptile;	993	freed_map = new maptile;
920		994
		995	freed_map->path = "<freed objects map>";
921	freed_map->name = "/internal/freed_objects_map";	996	freed_map->name = "/internal/freed_objects_map";
922	freed_map->width = 3;	997	freed_map->width = 3;
923	freed_map->height = 3;	998	freed_map->height = 3;
		999	freed_map->nodrop = 1;
924		1000
925	freed_map->alloc ();	1001	freed_map->alloc ();
926	freed_map->in_memory = MAP_IN_MEMORY;	1002	freed_map->in_memory = MAP_ACTIVE;
927	}	1003	}
928		1004
929	map = freed_map;	1005	map = freed_map;
930	x = 1;	1006	x = 1;
931	y = 1;	1007	y = 1;
…		…
950	object::destroy (bool destroy_inventory)	1026	object::destroy (bool destroy_inventory)
951	{	1027	{
952	if (destroyed ())	1028	if (destroyed ())
953	return;	1029	return;
954		1030
955	if (destroy_inventory)	1031	destroy_inv (!destroy_inventory);
956	destroy_inv (false);
957		1032
958	if (is_head ())	1033	if (is_head ())
959	if (sound_destroy)	1034	if (sound_destroy)
960	play_sound (sound_destroy);	1035	play_sound (sound_destroy);
961	else if (flag [FLAG_MONSTER])	1036	else if (flag [FLAG_MONSTER])
962	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism	1037	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
963		1038
964	attachable::destroy ();	1039	attachable::destroy ();
965	}
966
967	/*
968	* sub_weight() recursively (outwards) subtracts a number from the
969	* weight of an object (and what is carried by it's environment(s)).
970	*/
971	void
972	sub_weight (object *op, signed long weight)
973	{
974	while (op != NULL)
975	{
976	if (op->type == CONTAINER)
977	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
978
979	op->carrying -= weight;
980	op = op->env;
981	}
982	}	1040	}
983		1041
984	/* op->remove ():	1042	/* op->remove ():
985	* This function removes the object op from the linked list of objects	1043	* This function removes the object op from the linked list of objects
986	* which it is currently tied to. When this function is done, the	1044	* which it is currently tied to. When this function is done, the
…		…
992	object::do_remove ()	1050	object::do_remove ()
993	{	1051	{
994	object tmp, last = 0;	1052	object tmp, last = 0;
995	object *otmp;	1053	object *otmp;
996		1054
997	if (QUERY_FLAG (this, FLAG_REMOVED))	1055	if (flag [FLAG_REMOVED])
998	return;	1056	return;
999		1057
1000	SET_FLAG (this, FLAG_REMOVED);
1001	INVOKE_OBJECT (REMOVE, this);	1058	INVOKE_OBJECT (REMOVE, this);
		1059
		1060	if (object *pl = visible_to ())
		1061	esrv_del_item (pl->contr, count);
		1062
		1063	flag [FLAG_REMOVED] = true;
1002		1064
1003	if (more)	1065	if (more)
1004	more->remove ();	1066	more->remove ();
1005		1067
1006	/*	1068	/*
1007	* In this case, the object to be removed is in someones	1069	* In this case, the object to be removed is in someones
1008	* inventory.	1070	* inventory.
1009	*/	1071	*/
1010	if (env)	1072	if (env)
1011	{	1073	{
		1074	adjust_weight (env, -total_weight ());
		1075
		1076	*(above ? &above->below : &env->inv) = below;
		1077
1012	if (nrof)	1078	if (below)
1013	sub_weight (env, weight * nrof);	1079	below->above = above;
1014	else	1080
1015	sub_weight (env, weight + carrying);	1081	/* we set up values so that it could be inserted into
		1082	* the map, but we don't actually do that - it is up
		1083	* to the caller to decide what we want to do.
		1084	*/
		1085	map = env->map;
		1086	x = env->x;
		1087	y = env->y;
		1088	above = 0;
		1089	below = 0;
		1090	env = 0;
1016		1091
1017	/* NO_FIX_PLAYER is set when a great many changes are being	1092	/* NO_FIX_PLAYER is set when a great many changes are being
1018	* made to players inventory. If set, avoiding the call	1093	* made to players inventory. If set, avoiding the call
1019	* to save cpu time.	1094	* to save cpu time.
1020	*/	1095	*/
1021	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1096	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1022	otmp->update_stats ();	1097	otmp->update_stats ();
1023
1024	if (above)
1025	above->below = below;
1026	else
1027	env->inv = below;
1028
1029	if (below)
1030	below->above = above;
1031
1032	/* we set up values so that it could be inserted into
1033	* the map, but we don't actually do that - it is up
1034	* to the caller to decide what we want to do.
1035	*/
1036	x = env->x, y = env->y;
1037	map = env->map;
1038	above = 0, below = 0;
1039	env = 0;
1040	}	1098	}
1041	else if (map)	1099	else if (map)
1042	{	1100	{
1043	if (type == PLAYER)	1101	if (type == PLAYER)
1044	{	1102	{
…		…
1091	* removed (most likely destroyed), update the player view	1149	* removed (most likely destroyed), update the player view
1092	* appropriately.	1150	* appropriately.
1093	*/	1151	*/
1094	pl->close_container ();	1152	pl->close_container ();
1095		1153
1096	pl->contr->ns->floorbox_update ();	1154	//TODO: the floorbox prev/next might need updating
		1155	esrv_del_item (pl->contr, count);
1097	}	1156	}
1098		1157
1099	for (tmp = ms.bot; tmp; tmp = tmp->above)	1158	for (tmp = ms.bot; tmp; tmp = tmp->above)
1100	{	1159	{
1101	/* No point updating the players look faces if he is the object	1160	/* No point updating the players look faces if he is the object
…		…
1140	merge_ob (object op, object top)	1199	merge_ob (object op, object top)
1141	{	1200	{
1142	if (!op->nrof)	1201	if (!op->nrof)
1143	return 0;	1202	return 0;
1144		1203
1145	if (top)	1204	if (!top)
1146	for (top = op; top && top->above; top = top->above)	1205	for (top = op; top && top->above; top = top->above)
1147	;	1206	;
1148		1207
1149	for (; top; top = top->below)	1208	for (; top; top = top->below)
1150	{
1151	if (top == op)
1152	continue;
1153
1154	if (object::can_merge (op, top))	1209	if (object::can_merge (op, top))
1155	{	1210	{
1156	top->nrof += op->nrof;	1211	top->nrof += op->nrof;
1157		1212
1158	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1213	if (object *pl = top->visible_to ())
1159	op->weight = 0; /* Don't want any adjustements now */	1214	esrv_update_item (UPD_NROF, pl, top);
		1215
		1216	op->weight = 0; // cancel the addition above
		1217	op->carrying = 0; // must be 0 already
		1218
1160	op->destroy ();	1219	op->destroy (1);
		1220
1161	return top;	1221	return top;
1162	}	1222	}
1163	}
1164		1223
1165	return 0;	1224	return 0;
1166	}	1225	}
1167		1226
1168	void	1227	void
…		…
1227	object *	1286	object *
1228	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1287	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1229	{	1288	{
1230	assert (!op->flag [FLAG_FREED]);	1289	assert (!op->flag [FLAG_FREED]);
1231		1290
1232	object top, floor = NULL;
1233
1234	op->remove ();	1291	op->remove ();
1235
1236	if (out_of_map (m, op->x, op->y))
1237	{
1238	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1239	#ifdef MANY_CORES
1240	/* Better to catch this here, as otherwise the next use of this object
1241	* is likely to cause a crash. Better to find out where it is getting
1242	* improperly inserted.
1243	*/
1244	abort ();
1245	#endif
1246	return op;
1247	}
1248
1249	if (object *more = op->more)
1250	if (!insert_ob_in_map (more, m, originator, flag))
1251	return 0;
1252
1253	CLEAR_FLAG (op, FLAG_REMOVED);
1254		1292
1255	/* Ideally, the caller figures this out. However, it complicates a lot	1293	/* Ideally, the caller figures this out. However, it complicates a lot
1256	* of areas of callers (eg, anything that uses find_free_spot would now	1294	* of areas of callers (eg, anything that uses find_free_spot would now
1257	* need extra work	1295	* need extra work
1258	*/	1296	*/
1259	if (!xy_normalise (m, op->x, op->y))	1297	if (!xy_normalise (m, op->x, op->y))
		1298	{
		1299	op->destroy (1);
1260	return 0;	1300	return 0;
		1301	}
		1302
		1303	if (object *more = op->more)
		1304	if (!insert_ob_in_map (more, m, originator, flag))
		1305	return 0;
		1306
		1307	CLEAR_FLAG (op, FLAG_REMOVED);
1261		1308
1262	op->map = m;	1309	op->map = m;
1263	mapspace &ms = op->ms ();	1310	mapspace &ms = op->ms ();
1264		1311
1265	/* this has to be done after we translate the coordinates.	1312	/* this has to be done after we translate the coordinates.
1266	*/	1313	*/
1267	if (op->nrof && !(flag & INS_NO_MERGE))	1314	if (op->nrof && !(flag & INS_NO_MERGE))
1268	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1315	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1269	if (object::can_merge (op, tmp))	1316	if (object::can_merge (op, tmp))
1270	{	1317	{
		1318	// TODO: we atcually want to update tmp, not op,
		1319	// but some caller surely breaks when we return tmp
		1320	// from here :/
1271	op->nrof += tmp->nrof;	1321	op->nrof += tmp->nrof;
1272	tmp->destroy ();	1322	tmp->destroy (1);
1273	}	1323	}
1274		1324
1275	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1325	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1276	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1326	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1277		1327
…		…
1297	/* since below originator, no need to update top */	1347	/* since below originator, no need to update top */
1298	originator->below = op;	1348	originator->below = op;
1299	}	1349	}
1300	else	1350	else
1301	{	1351	{
		1352	object top, floor = NULL;
		1353
1302	top = ms.bot;	1354	top = ms.bot;
1303		1355
1304	/* If there are other objects, then */	1356	/* If there are other objects, then */
1305	if ((!(flag & INS_MAP_LOAD)) && top)	1357	if (top)
1306	{	1358	{
1307	object *last = 0;	1359	object *last = 0;
1308		1360
1309	/*	1361	/*
1310	* If there are multiple objects on this space, we do some trickier handling.	1362	* If there are multiple objects on this space, we do some trickier handling.
…		…
1362	*/	1414	*/
1363	if (last && last->below && last != floor)	1415	if (last && last->below && last != floor)
1364	top = last->below;	1416	top = last->below;
1365	}	1417	}
1366	} /* If objects on this space */	1418	} /* If objects on this space */
1367	if (flag & INS_MAP_LOAD)
1368	top = ms.top;
1369		1419
1370	if (flag & INS_ABOVE_FLOOR_ONLY)	1420	if (flag & INS_ABOVE_FLOOR_ONLY)
1371	top = floor;	1421	top = floor;
1372		1422
1373	/* Top is the object that our object (op) is going to get inserted above.	1423	/* Top is the object that our object (op) is going to get inserted above.
…		…
1406	op->map->touch ();	1456	op->map->touch ();
1407	}	1457	}
1408		1458
1409	op->map->dirty = true;	1459	op->map->dirty = true;
1410		1460
1411	if (!(flag & INS_MAP_LOAD))
1412	if (object *pl = ms.player ())	1461	if (object *pl = ms.player ())
1413	pl->contr->ns->floorbox_update ();	1462	//TODO: the floorbox prev/next might need updating
		1463	esrv_send_item (pl, op);
1414		1464
1415	/* If this object glows, it may affect lighting conditions that are	1465	/* If this object glows, it may affect lighting conditions that are
1416	* visible to others on this map. But update_all_los is really	1466	* visible to others on this map. But update_all_los is really
1417	* an inefficient way to do this, as it means los for all players	1467	* an inefficient way to do this, as it means los for all players
1418	* on the map will get recalculated. The players could very well	1468	* on the map will get recalculated. The players could very well
…		…
1460	* op is the object to insert it under: supplies x and the map.	1510	* op is the object to insert it under: supplies x and the map.
1461	*/	1511	*/
1462	void	1512	void
1463	replace_insert_ob_in_map (const char arch_string, object op)	1513	replace_insert_ob_in_map (const char arch_string, object op)
1464	{	1514	{
1465	object tmp, tmp1;
1466
1467	/* first search for itself and remove any old instances */	1515	/* first search for itself and remove any old instances */
1468		1516
1469	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1517	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1470	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1518	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1471	tmp->destroy ();	1519	tmp->destroy (1);
1472		1520
1473	tmp1 = arch_to_object (archetype::find (arch_string));	1521	object *tmp = arch_to_object (archetype::find (arch_string));
1474		1522
1475	tmp1->x = op->x;	1523	tmp->x = op->x;
1476	tmp1->y = op->y;	1524	tmp->y = op->y;
		1525
1477	insert_ob_in_map (tmp1, op->map, op, 0);	1526	insert_ob_in_map (tmp, op->map, op, 0);
1478	}	1527	}
1479		1528
1480	object *	1529	object *
1481	object::insert_at (object where, object originator, int flags)	1530	object::insert_at (object where, object originator, int flags)
1482	{	1531	{
		1532	if (where->env)
		1533	return where->env->insert (this);
		1534	else
1483	return where->map->insert (this, where->x, where->y, originator, flags);	1535	return where->map->insert (this, where->x, where->y, originator, flags);
1484	}	1536	}
1485		1537
1486	/*	1538	/*
1487	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1488	* is returned contains nr objects, and the remaining parts contains
1489	* the rest (or is removed and freed if that number is 0).
1490	* On failure, NULL is returned, and the reason put into the
1491	* global static errmsg array.
1492	*/
1493	object *
1494	get_split_ob (object *orig_ob, uint32 nr)
1495	{
1496	object *newob;
1497	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1498
1499	if (orig_ob->nrof < nr)
1500	{
1501	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1502	return NULL;
1503	}
1504
1505	newob = object_create_clone (orig_ob);
1506
1507	if ((orig_ob->nrof -= nr) < 1)
1508	orig_ob->destroy (1);
1509	else if (!is_removed)
1510	{
1511	if (orig_ob->env != NULL)
1512	sub_weight (orig_ob->env, orig_ob->weight * nr);
1513	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1514	{
1515	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1516	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1517	return NULL;
1518	}
1519	}
1520
1521	newob->nrof = nr;
1522
1523	return newob;
1524	}
1525
1526	/*
1527	* decrease_ob_nr(object, number) decreases a specified number from	1539	* decrease(object, number) decreases a specified number from
1528	* the amount of an object. If the amount reaches 0, the object	1540	* the amount of an object. If the amount reaches 0, the object
1529	* is subsequently removed and freed.	1541	* is subsequently removed and freed.
1530	*	1542	*
1531	* Return value: 'op' if something is left, NULL if the amount reached 0	1543	* Return value: 'op' if something is left, NULL if the amount reached 0
1532	*/	1544	*/
		1545	bool
		1546	object::decrease (sint32 nr)
		1547	{
		1548	if (!nr)
		1549	return true;
		1550
		1551	nr = min (nr, nrof);
		1552
		1553	nrof -= nr;
		1554
		1555	if (nrof)
		1556	{
		1557	adjust_weight (env, -weight * nr); // carrying == 0
		1558
		1559	if (object *pl = visible_to ())
		1560	esrv_update_item (UPD_NROF, pl, this);
		1561
		1562	return true;
		1563	}
		1564	else
		1565	{
		1566	destroy (1);
		1567	return false;
		1568	}
		1569	}
		1570
		1571	/*
		1572	* split(ob,nr) splits up ob into two parts. The part which
		1573	* is returned contains nr objects, and the remaining parts contains
		1574	* the rest (or is removed and returned if that number is 0).
		1575	* On failure, NULL is returned.
		1576	*/
1533	object *	1577	object *
1534	decrease_ob_nr (object *op, uint32 i)	1578	object::split (sint32 nr)
1535	{	1579	{
1536	object *tmp;	1580	int have = number_of ();
1537		1581
1538	if (i == 0) /* objects with op->nrof require this check */	1582	if (have < nr)
1539	return op;	1583	return 0;
1540		1584	else if (have == nr)
1541	if (i > op->nrof)
1542	i = op->nrof;
1543
1544	if (QUERY_FLAG (op, FLAG_REMOVED))
1545	op->nrof -= i;
1546	else if (op->env)
1547	{	1585	{
1548	/* is this object in the players inventory, or sub container
1549	* therein?
1550	*/
1551	tmp = op->in_player ();
1552	/* nope. Is this a container the player has opened?
1553	* If so, set tmp to that player.
1554	* IMO, searching through all the players will mostly
1555	* likely be quicker than following op->env to the map,
1556	* and then searching the map for a player.
1557	*/
1558	if (!tmp)
1559	for_all_players (pl)
1560	if (pl->ob->container == op->env)
1561	{
1562	tmp = pl->ob;
1563	break;
1564	}
1565
1566	if (i < op->nrof)
1567	{
1568	sub_weight (op->env, op->weight * i);
1569	op->nrof -= i;
1570	if (tmp)
1571	esrv_send_item (tmp, op);
1572	}
1573	else
1574	{
1575	op->remove ();	1586	remove ();
1576	op->nrof = 0;	1587	return this;
1577	if (tmp)
1578	esrv_del_item (tmp->contr, op->count);
1579	}
1580	}	1588	}
1581	else	1589	else
1582	{	1590	{
1583	object *above = op->above;	1591	decrease (nr);
1584		1592
1585	if (i < op->nrof)	1593	object *op = object_create_clone (this);
1586	op->nrof -= i;	1594	op->nrof = nr;
1587	else
1588	{
1589	op->remove ();
1590	op->nrof = 0;
1591	}
1592
1593	/* Since we just removed op, op->above is null */
1594	for (tmp = above; tmp; tmp = tmp->above)
1595	if (tmp->type == PLAYER)
1596	{
1597	if (op->nrof)
1598	esrv_send_item (tmp, op);
1599	else
1600	esrv_del_item (tmp->contr, op->count);
1601	}
1602	}
1603
1604	if (op->nrof)
1605	return op;	1595	return op;
1606	else
1607	{
1608	op->destroy ();
1609	return 0;
1610	}
1611	}
1612
1613	/*
1614	* add_weight(object, weight) adds the specified weight to an object,
1615	* and also updates how much the environment(s) is/are carrying.
1616	*/
1617	void
1618	add_weight (object *op, signed long weight)
1619	{
1620	while (op != NULL)
1621	{
1622	if (op->type == CONTAINER)
1623	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1624
1625	op->carrying += weight;
1626	op = op->env;
1627	}	1596	}
1628	}	1597	}
1629		1598
1630	object *	1599	object *
1631	insert_ob_in_ob (object op, object where)	1600	insert_ob_in_ob (object op, object where)
…		…
1656	* be != op, if items are merged. -Tero	1625	* be != op, if items are merged. -Tero
1657	*/	1626	*/
1658	object *	1627	object *
1659	object::insert (object *op)	1628	object::insert (object *op)
1660	{	1629	{
1661	if (!QUERY_FLAG (op, FLAG_REMOVED))
1662	op->remove ();
1663
1664	if (op->more)	1630	if (op->more)
1665	{	1631	{
1666	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1632	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1667	return op;	1633	return op;
1668	}	1634	}
1669		1635
1670	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1636	op->remove ();
1671	CLEAR_FLAG (op, FLAG_REMOVED);	1637
		1638	op->flag [FLAG_OBJ_ORIGINAL] = 0;
1672		1639
1673	if (op->nrof)	1640	if (op->nrof)
1674	{
1675	for (object *tmp = inv; tmp; tmp = tmp->below)	1641	for (object *tmp = inv; tmp; tmp = tmp->below)
1676	if (object::can_merge (tmp, op))	1642	if (object::can_merge (tmp, op))
1677	{	1643	{
1678	/* return the original object and remove inserted object	1644	/* return the original object and remove inserted object
1679	(client needs the original object) */	1645	(client needs the original object) */
1680	tmp->nrof += op->nrof;	1646	tmp->nrof += op->nrof;
1681	/* Weight handling gets pretty funky. Since we are adding to	1647
1682	* tmp->nrof, we need to increase the weight.	1648	if (object *pl = tmp->visible_to ())
1683	*/	1649	esrv_update_item (UPD_NROF, pl, tmp);
		1650
1684	add_weight (this, op->weight * op->nrof);	1651	adjust_weight (this, op->total_weight ());
1685	SET_FLAG (op, FLAG_REMOVED);	1652
1686	op->destroy (); /* free the inserted object */	1653	op->destroy (1);
1687	op = tmp;	1654	op = tmp;
1688	op->remove (); /* and fix old object's links */	1655	goto inserted;
1689	CLEAR_FLAG (op, FLAG_REMOVED);
1690	break;
1691	}	1656	}
1692		1657
1693	/* I assume combined objects have no inventory
1694	* We add the weight - this object could have just been removed
1695	* (if it was possible to merge). calling remove_ob will subtract
1696	* the weight, so we need to add it in again, since we actually do
1697	* the linking below
1698	*/
1699	add_weight (this, op->weight * op->nrof);
1700	}
1701	else
1702	add_weight (this, (op->weight + op->carrying));
1703
1704	if (object *otmp = this->in_player ())
1705	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1706	otmp->update_stats ();
1707
1708	op->owner = 0; // its his/hers now. period.	1658	op->owner = 0; // it's his/hers now. period.
1709	op->map = 0;	1659	op->map = 0;
		1660	op->x = 0;
		1661	op->y = 0;
		1662
		1663	op->above = 0;
		1664	op->below = inv;
1710	op->env = this;	1665	op->env = this;
1711	op->above = 0;
1712	op->below = 0;
1713	op->x = op->y = 0;
1714		1666
		1667	if (inv)
		1668	inv->above = op;
		1669
		1670	inv = op;
		1671
		1672	op->flag [FLAG_REMOVED] = 0;
		1673
		1674	if (object *pl = op->visible_to ())
		1675	esrv_send_item (pl, op);
		1676
		1677	adjust_weight (this, op->total_weight ());
		1678
		1679	inserted:
1715	/* reset the light list and los of the players on the map */	1680	/* reset the light list and los of the players on the map */
1716	if (op->glow_radius && map)	1681	if (op->glow_radius && map && map->darkness)
1717	{
1718	#ifdef DEBUG_LIGHTS
1719	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1720	#endif /* DEBUG_LIGHTS */
1721	if (map->darkness)
1722	update_all_los (map, x, y);	1682	update_all_los (map, x, y);
1723	}
1724		1683
1725	/* Client has no idea of ordering so lets not bother ordering it here.	1684	// if this is a player's inventory, update stats
1726	* It sure simplifies this function...	1685	if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1727	*/	1686	update_stats ();
1728	if (!inv)
1729	inv = op;
1730	else
1731	{
1732	op->below = inv;
1733	op->below->above = op;
1734	inv = op;
1735	}
1736		1687
1737	INVOKE_OBJECT (INSERT, this);	1688	INVOKE_OBJECT (INSERT, this);
1738		1689
1739	return op;	1690	return op;
1740	}	1691	}
…		…
1955	* activate recursively a flag on an object inventory	1906	* activate recursively a flag on an object inventory
1956	*/	1907	*/
1957	void	1908	void
1958	flag_inv (object *op, int flag)	1909	flag_inv (object *op, int flag)
1959	{	1910	{
1960	if (op->inv)
1961	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1911	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1962	{	1912	{
1963	SET_FLAG (tmp, flag);	1913	SET_FLAG (tmp, flag);
1964	flag_inv (tmp, flag);	1914	flag_inv (tmp, flag);
1965	}	1915	}
1966	}	1916	}
1967		1917
1968	/*	1918	/*
1969	* deactivate recursively a flag on an object inventory	1919	* deactivate recursively a flag on an object inventory
1970	*/	1920	*/
1971	void	1921	void
1972	unflag_inv (object *op, int flag)	1922	unflag_inv (object *op, int flag)
1973	{	1923	{
1974	if (op->inv)
1975	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1924	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1976	{	1925	{
1977	CLEAR_FLAG (tmp, flag);	1926	CLEAR_FLAG (tmp, flag);
1978	unflag_inv (tmp, flag);	1927	unflag_inv (tmp, flag);
1979	}	1928	}
1980	}	1929	}
1981		1930
1982	/*	1931	/*
1983	* find_free_spot(object, map, x, y, start, stop) will search for	1932	* find_free_spot(object, map, x, y, start, stop) will search for
1984	* a spot at the given map and coordinates which will be able to contain	1933	* a spot at the given map and coordinates which will be able to contain
…		…
1986	* to search (see the freearr_x/y[] definition).	1935	* to search (see the freearr_x/y[] definition).
1987	* It returns a random choice among the alternatives found.	1936	* It returns a random choice among the alternatives found.
1988	* start and stop are where to start relative to the free_arr array (1,9	1937	* start and stop are where to start relative to the free_arr array (1,9
1989	* does all 4 immediate directions). This returns the index into the	1938	* does all 4 immediate directions). This returns the index into the
1990	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1939	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1991	* Note - this only checks to see if there is space for the head of the
1992	* object - if it is a multispace object, this should be called for all
1993	* pieces.
1994	* Note2: This function does correctly handle tiled maps, but does not	1940	* Note: This function does correctly handle tiled maps, but does not
1995	* inform the caller. However, insert_ob_in_map will update as	1941	* inform the caller. However, insert_ob_in_map will update as
1996	* necessary, so the caller shouldn't need to do any special work.	1942	* necessary, so the caller shouldn't need to do any special work.
1997	* Note - updated to take an object instead of archetype - this is necessary	1943	* Note - updated to take an object instead of archetype - this is necessary
1998	* because arch_blocked (now ob_blocked) needs to know the movement type	1944	* because arch_blocked (now ob_blocked) needs to know the movement type
1999	* to know if the space in question will block the object. We can't use	1945	* to know if the space in question will block the object. We can't use
…		…
2001	* customized, changed states, etc.	1947	* customized, changed states, etc.
2002	*/	1948	*/
2003	int	1949	int
2004	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)	1950	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
2005	{	1951	{
		1952	int altern[SIZEOFFREE];
2006	int index = 0, flag;	1953	int index = 0, flag;
2007	int altern[SIZEOFFREE];
2008		1954
2009	for (int i = start; i < stop; i++)	1955	for (int i = start; i < stop; i++)
2010	{	1956	{
2011	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1957	mapxy pos (m, x, y); pos.move (i);
2012	if (!flag)	1958
		1959	if (!pos.normalise ())
		1960	continue;
		1961
		1962	mapspace &ms = *pos;
		1963
		1964	if (ms.flags () & P_IS_ALIVE)
		1965	continue;
		1966
		1967	/* However, often
		1968	* ob doesn't have any move type (when used to place exits)
		1969	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1970	*/
		1971	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1972	{
2013	altern [index++] = i;	1973	altern [index++] = i;
		1974	continue;
		1975	}
2014		1976
2015	/* Basically, if we find a wall on a space, we cut down the search size.	1977	/* Basically, if we find a wall on a space, we cut down the search size.
2016	* In this way, we won't return spaces that are on another side of a wall.	1978	* In this way, we won't return spaces that are on another side of a wall.
2017	* This mostly work, but it cuts down the search size in all directions -	1979	* This mostly work, but it cuts down the search size in all directions -
2018	* if the space being examined only has a wall to the north and empty	1980	* if the space being examined only has a wall to the north and empty
2019	* spaces in all the other directions, this will reduce the search space	1981	* spaces in all the other directions, this will reduce the search space
2020	* to only the spaces immediately surrounding the target area, and	1982	* to only the spaces immediately surrounding the target area, and
2021	* won't look 2 spaces south of the target space.	1983	* won't look 2 spaces south of the target space.
2022	*/	1984	*/
2023	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1985	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1986	{
2024	stop = maxfree[i];	1987	stop = maxfree[i];
		1988	continue;
		1989	}
		1990
		1991	/* Note it is intentional that we check ob - the movement type of the
		1992	* head of the object should correspond for the entire object.
		1993	*/
		1994	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1995	continue;
		1996
		1997	if (ob->blocked (m, pos.x, pos.y))
		1998	continue;
		1999
		2000	altern [index++] = i;
2025	}	2001	}
2026		2002
2027	if (!index)	2003	if (!index)
2028	return -1;	2004	return -1;
2029		2005
…		…
2038	*/	2014	*/
2039	int	2015	int
2040	find_first_free_spot (const object ob, maptile m, int x, int y)	2016	find_first_free_spot (const object ob, maptile m, int x, int y)
2041	{	2017	{
2042	for (int i = 0; i < SIZEOFFREE; i++)	2018	for (int i = 0; i < SIZEOFFREE; i++)
2043	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2019	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2044	return i;	2020	return i;
2045		2021
2046	return -1;	2022	return -1;
2047	}	2023	}
2048		2024
…		…
2585	{	2561	{
2586	char flagdesc[512];	2562	char flagdesc[512];
2587	char info2[256 * 4];	2563	char info2[256 * 4];
2588	char *p = info;	2564	char *p = info;
2589		2565
2590	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2566	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2591	count, uuid.seq,	2567	count,
		2568	uuid.c_str (),
2592	&name,	2569	&name,
2593	title ? "\",title:\"" : "",	2570	title ? "\",title:\"" : "",
2594	title ? (const char *)title : "",	2571	title ? (const char *)title : "",
2595	flag_desc (flagdesc, 512), type);	2572	flag_desc (flagdesc, 512), type);
2596		2573
2597	if (!this->flag[FLAG_REMOVED] && env)	2574	if (!flag[FLAG_REMOVED] && env)
2598	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2575	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2599		2576
2600	if (map)	2577	if (map)
2601	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2578	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2602		2579
…		…
2644	if (object *closer = old_container->inv)	2621	if (object *closer = old_container->inv)
2645	if (closer->type == CLOSE_CON)	2622	if (closer->type == CLOSE_CON)
2646	closer->destroy ();	2623	closer->destroy ();
2647	#endif	2624	#endif
2648		2625
2649	old_container->flag [FLAG_APPLIED] = 0;	2626	old_container->flag [FLAG_APPLIED] = false;
2650	container = 0;	2627	container = 0;
2651		2628
2652	esrv_update_item (UPD_FLAGS, this, old_container);	2629	esrv_update_item (UPD_FLAGS, this, old_container);
2653	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));	2630	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2654	play_sound (sound_find ("chest_close"));	2631	play_sound (sound_find ("chest_close"));
…		…
2670	}	2647	}
2671	#endif	2648	#endif
2672		2649
2673	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));	2650	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2674		2651
2675	new_container->flag [FLAG_APPLIED] = 1;	2652	new_container->flag [FLAG_APPLIED] = true;
2676	container = new_container;	2653	container = new_container;
2677		2654
2678	esrv_update_item (UPD_FLAGS, this, new_container);	2655	esrv_update_item (UPD_FLAGS, this, new_container);
2679	esrv_send_inventory (this, new_container);	2656	esrv_send_inventory (this, new_container);
2680	play_sound (sound_find ("chest_open"));	2657	play_sound (sound_find ("chest_open"));
…		…
2712		2689
2713	insert (force);	2690	insert (force);
2714	}	2691	}
2715		2692
2716	void	2693	void
2717	object::play_sound (faceidx sound) const	2694	object::play_sound (faceidx sound)
2718	{	2695	{
2719	if (!sound)	2696	if (!sound)
2720	return;	2697	return;
2721		2698
2722	if (flag [FLAG_REMOVED])	2699	if (flag [FLAG_REMOVED])

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.183 by root, Mon Aug 20 19:13:10 2007 UTC vs. Revision 1.218 by root, Wed Apr 23 07:25:54 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.183 by root, Mon Aug 20 19:13:10 2007 UTC vs.
Revision 1.218 by root, Wed Apr 23 07:25:54 2008 UTC