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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.179 by root, Wed Aug 15 04:57:48 2007 UTC vs.
Revision 1.213 by root, Tue Apr 22 01:18:10 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);
86		82
		83	seq_next_save = 0;
		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	// adjust weight per container type ("of holding")
		336	static sint32
		337	weight_adjust (object *op, sint32 weight)
		338	{
		339	return op->type == CONTAINER
		340	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		341	: weight;
		342	}
		343
318	/*	344	/*
		345	* adjust_weight(object, weight) adds the specified weight to an object,
		346	* and also updates how much the environment(s) is/are carrying.
		347	*/
		348	static void
		349	adjust_weight (object *op, sint32 weight)
		350	{
		351	while (op)
		352	{
		353	weight = weight_adjust (op, weight);
		354
		355	if (!weight)
		356	return;
		357
		358	op->carrying += weight;
		359
		360	if (object *pl = op->visible_to ())
		361	esrv_update_item (UPD_WEIGHT, pl, op);
		362
		363	op = op->env;
		364	}
		365	}
		366
		367	/*
319	* sum_weight() is a recursive function which calculates the weight	368	* this is a recursive function which calculates the weight
320	* an object is carrying. It goes through in figures out how much	369	* an object is carrying. It goes through op and figures out how much
321	* containers are carrying, and sums it up.	370	* containers are carrying, and sums it up.
322	*/	371	*/
323	long	372	void
324	sum_weight (object *op)	373	object::update_weight ()
325	{	374	{
326	long sum;	375	sint32 sum = 0;
327	object *inv;
328		376
329	for (sum = 0, inv = op->inv; inv; inv = inv->below)	377	for (object *op = inv; op; op = op->below)
330	{	378	{
331	if (inv->inv)	379	if (op->inv)
332	sum_weight (inv);	380	op->update_weight ();
333		381
334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	382	sum += op->total_weight ();
		383	}
		384
		385	sum = weight_adjust (this, sum);
		386
		387	if (sum != carrying)
335	}	388	{
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;	389	carrying = sum;
342		390
343	return sum;	391	if (object *pl = visible_to ())
		392	esrv_update_item (UPD_WEIGHT, pl, this);
		393	}
344	}	394	}
345		395
346	/**	396	/*
347	* Return the outermost environment object for a given object.	397	* 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	*/	398	*/
363	char *	399	char *
364	dump_object (object *op)	400	dump_object (object *op)
365	{	401	{
366	if (!op)	402	if (!op)
…		…
374	/*	410	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	411	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	412	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	413	* If it's not a multi-object, it is returned.
378	*/	414	*/
379
380	object *	415	object *
381	get_nearest_part (object op, const object pl)	416	get_nearest_part (object op, const object pl)
382	{	417	{
383	object tmp, closest;	418	object tmp, closest;
384	int last_dist, i;	419	int last_dist, i;
385		420
386	if (op->more == NULL)	421	if (!op->more)
387	return op;	422	return op;
		423
388	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)	424	for (last_dist = distance (op, pl), closest = op, tmp = op->more;
		425	tmp;
		426	tmp = tmp->more)
389	if ((i = distance (tmp, pl)) < last_dist)	427	if ((i = distance (tmp, pl)) < last_dist)
390	closest = tmp, last_dist = i;	428	closest = tmp, last_dist = i;
		429
391	return closest;	430	return closest;
392	}	431	}
393		432
394	/*	433	/*
395	* Returns the object which has the count-variable equal to the argument.	434	* Returns the object which has the count-variable equal to the argument.
		435	* VERRRY slow.
396	*/	436	*/
397	object *	437	object *
398	find_object (tag_t i)	438	find_object (tag_t i)
399	{	439	{
400	for_all_objects (op)	440	for_all_objects (op)
…		…
420	break;	460	break;
421		461
422	return op;	462	return op;
423	}	463	}
424		464
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}
430
431	/*	465	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	466	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	467	* skill and experience objects.
		468	* ACTUALLY NO! investigate! TODO
434	*/	469	*/
435	void	470	void
436	object::set_owner (object *owner)	471	object::set_owner (object *owner)
437	{	472	{
		473	// allow objects which own objects
438	if (!owner)	474	if (owner)
439	return;
440
441	/* next line added to allow objects which own objects */
442	/* Add a check for ownercounts in here, as I got into an endless loop
443	* with the fireball owning a poison cloud which then owned the
444	* fireball. I believe that was caused by one of the objects getting
445	* freed and then another object replacing it. Since the ownercounts
446	* didn't match, this check is valid and I believe that cause is valid.
447	*/
448	while (owner->owner)	475	while (owner->owner)
449	owner = owner->owner;	476	owner = owner->owner;
		477
		478	if (flag [FLAG_FREED])
		479	{
		480	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		481	return;
		482	}
450		483
451	this->owner = owner;	484	this->owner = owner;
452	}	485	}
453		486
454	int	487	int
…		…
586	object::copy_to (object *dst)	619	object::copy_to (object *dst)
587	{	620	{
588	dst = this;	621	dst = this;
589		622
590	if (speed < 0)	623	if (speed < 0)
591	dst->speed_left = speed_left - rndm ();	624	dst->speed_left -= rndm ();
592		625
593	dst->set_speed (dst->speed);	626	dst->set_speed (dst->speed);
594	}	627	}
595		628
596	void	629	void
597	object::instantiate ()	630	object::instantiate ()
598	{	631	{
599	if (!uuid.seq) // HACK	632	if (!uuid.seq) // HACK
600	uuid = gen_uuid ();	633	uuid = UUID::gen ();
601		634
602	speed_left = -0.1f;	635	speed_left = -0.1f;
603	/* copy the body_info to the body_used - this is only really	636	/* copy the body_info to the body_used - this is only really
604	* need for monsters, but doesn't hurt to do it for everything.	637	* need for monsters, but doesn't hurt to do it for everything.
605	* by doing so, when a monster is created, it has good starting	638	* by doing so, when a monster is created, it has good starting
…		…
764	static int object_count;	797	static int object_count;
765		798
766	void object::link ()	799	void object::link ()
767	{	800	{
768	assert (!index);//D	801	assert (!index);//D
769	uuid = gen_uuid ();	802	uuid = UUID::gen ();
770	count = ++object_count;	803	count = ++object_count;
771		804
772	refcnt_inc ();	805	refcnt_inc ();
773	objects.insert (this);	806	objects.insert (this);
774	}	807	}
…		…
858	* if some form of movement is allowed, let objects	891	* if some form of movement is allowed, let objects
859	* drop on that space.	892	* drop on that space.
860	*/	893	*/
861	if (!drop_to_ground	894	if (!drop_to_ground
862	\|\| !map	895	\|\| !map
863	\|\| map->in_memory != MAP_IN_MEMORY	896	\|\| map->in_memory != MAP_ACTIVE
864	\|\| map->nodrop	897	\|\| map->nodrop
865	\|\| ms ().move_block == MOVE_ALL)	898	\|\| ms ().move_block == MOVE_ALL)
866	{	899	{
867	while (inv)	900	while (inv)
868	{	901	{
…		…
897	}	930	}
898		931
899	void	932	void
900	object::do_destroy ()	933	object::do_destroy ()
901	{	934	{
902	attachable::do_destroy ();
903
904	if (flag [FLAG_IS_LINKED])	935	if (flag [FLAG_IS_LINKED])
905	remove_button_link (this);	936	remove_button_link (this);
906		937
907	if (flag [FLAG_FRIENDLY])	938	if (flag [FLAG_FRIENDLY])
908	remove_friendly_object (this);	939	remove_friendly_object (this);
909		940
910	if (!flag [FLAG_REMOVED])
911	remove ();	941	remove ();
		942
		943	attachable::do_destroy ();
912		944
913	destroy_inv (true);	945	destroy_inv (true);
914		946
915	deactivate ();	947	deactivate ();
916	unlink ();	948	unlink ();
…		…
923		955
924	if (!freed_map)	956	if (!freed_map)
925	{	957	{
926	freed_map = new maptile;	958	freed_map = new maptile;
927		959
		960	freed_map->path = "<freed objects map>";
928	freed_map->name = "/internal/freed_objects_map";	961	freed_map->name = "/internal/freed_objects_map";
929	freed_map->width = 3;	962	freed_map->width = 3;
930	freed_map->height = 3;	963	freed_map->height = 3;
		964	freed_map->nodrop = 1;
931		965
932	freed_map->alloc ();	966	freed_map->alloc ();
933	freed_map->in_memory = MAP_IN_MEMORY;	967	freed_map->in_memory = MAP_ACTIVE;
934	}	968	}
935		969
936	map = freed_map;	970	map = freed_map;
937	x = 1;	971	x = 1;
938	y = 1;	972	y = 1;
…		…
967	play_sound (sound_destroy);	1001	play_sound (sound_destroy);
968	else if (flag [FLAG_MONSTER])	1002	else if (flag [FLAG_MONSTER])
969	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism	1003	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
970		1004
971	attachable::destroy ();	1005	attachable::destroy ();
972	}
973
974	/*
975	* sub_weight() recursively (outwards) subtracts a number from the
976	* weight of an object (and what is carried by it's environment(s)).
977	*/
978	void
979	sub_weight (object *op, signed long weight)
980	{
981	while (op != NULL)
982	{
983	if (op->type == CONTAINER)
984	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
985
986	op->carrying -= weight;
987	op = op->env;
988	}
989	}	1006	}
990		1007
991	/* op->remove ():	1008	/* op->remove ():
992	* This function removes the object op from the linked list of objects	1009	* This function removes the object op from the linked list of objects
993	* which it is currently tied to. When this function is done, the	1010	* which it is currently tied to. When this function is done, the
…		…
999	object::do_remove ()	1016	object::do_remove ()
1000	{	1017	{
1001	object tmp, last = 0;	1018	object tmp, last = 0;
1002	object *otmp;	1019	object *otmp;
1003		1020
1004	if (QUERY_FLAG (this, FLAG_REMOVED))	1021	if (flag [FLAG_REMOVED])
1005	return;	1022	return;
1006		1023
1007	SET_FLAG (this, FLAG_REMOVED);
1008	INVOKE_OBJECT (REMOVE, this);	1024	INVOKE_OBJECT (REMOVE, this);
		1025
		1026	if (object *pl = visible_to ())
		1027	esrv_del_item (pl->contr, count);
		1028
		1029	flag [FLAG_REMOVED] = true;
1009		1030
1010	if (more)	1031	if (more)
1011	more->remove ();	1032	more->remove ();
1012		1033
1013	/*	1034	/*
1014	* In this case, the object to be removed is in someones	1035	* In this case, the object to be removed is in someones
1015	* inventory.	1036	* inventory.
1016	*/	1037	*/
1017	if (env)	1038	if (env)
1018	{	1039	{
		1040	adjust_weight (env, -total_weight ());
		1041
		1042	*(above ? &above->below : &env->inv) = below;
		1043
1019	if (nrof)	1044	if (below)
1020	sub_weight (env, weight * nrof);	1045	below->above = above;
1021	else	1046
1022	sub_weight (env, weight + carrying);	1047	/* we set up values so that it could be inserted into
		1048	* the map, but we don't actually do that - it is up
		1049	* to the caller to decide what we want to do.
		1050	*/
		1051	map = env->map;
		1052	x = env->x;
		1053	y = env->y;
		1054	above = 0;
		1055	below = 0;
		1056	env = 0;
1023		1057
1024	/* NO_FIX_PLAYER is set when a great many changes are being	1058	/* NO_FIX_PLAYER is set when a great many changes are being
1025	* made to players inventory. If set, avoiding the call	1059	* made to players inventory. If set, avoiding the call
1026	* to save cpu time.	1060	* to save cpu time.
1027	*/	1061	*/
1028	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1062	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1029	otmp->update_stats ();	1063	otmp->update_stats ();
1030
1031	if (above)
1032	above->below = below;
1033	else
1034	env->inv = below;
1035
1036	if (below)
1037	below->above = above;
1038
1039	/* we set up values so that it could be inserted into
1040	* the map, but we don't actually do that - it is up
1041	* to the caller to decide what we want to do.
1042	*/
1043	x = env->x, y = env->y;
1044	map = env->map;
1045	above = 0, below = 0;
1046	env = 0;
1047	}	1064	}
1048	else if (map)	1065	else if (map)
1049	{	1066	{
1050	if (type == PLAYER)	1067	if (type == PLAYER)
1051	{	1068	{
…		…
1147	merge_ob (object op, object top)	1164	merge_ob (object op, object top)
1148	{	1165	{
1149	if (!op->nrof)	1166	if (!op->nrof)
1150	return 0;	1167	return 0;
1151		1168
1152	if (top)	1169	if (!top)
1153	for (top = op; top && top->above; top = top->above)	1170	for (top = op; top && top->above; top = top->above)
1154	;	1171	;
1155		1172
1156	for (; top; top = top->below)	1173	for (; top; top = top->below)
1157	{	1174	{
…		…
1238		1255
1239	object top, floor = NULL;	1256	object top, floor = NULL;
1240		1257
1241	op->remove ();	1258	op->remove ();
1242		1259
1243	if (out_of_map (m, op->x, op->y))
1244	{
1245	LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1246	#ifdef MANY_CORES
1247	/* Better to catch this here, as otherwise the next use of this object
1248	* is likely to cause a crash. Better to find out where it is getting
1249	* improperly inserted.
1250	*/
1251	abort ();
1252	#endif
1253	return op;
1254	}
1255
1256	if (object *more = op->more)
1257	if (!insert_ob_in_map (more, m, originator, flag))
1258	return 0;
1259
1260	CLEAR_FLAG (op, FLAG_REMOVED);
1261
1262	/* Ideally, the caller figures this out. However, it complicates a lot	1260	/* Ideally, the caller figures this out. However, it complicates a lot
1263	* of areas of callers (eg, anything that uses find_free_spot would now	1261	* of areas of callers (eg, anything that uses find_free_spot would now
1264	* need extra work	1262	* need extra work
1265	*/	1263	*/
1266	if (!xy_normalise (m, op->x, op->y))	1264	if (!xy_normalise (m, op->x, op->y))
		1265	{
		1266	op->destroy ();
1267	return 0;	1267	return 0;
		1268	}
		1269
		1270	if (object *more = op->more)
		1271	if (!insert_ob_in_map (more, m, originator, flag))
		1272	return 0;
		1273
		1274	CLEAR_FLAG (op, FLAG_REMOVED);
1268		1275
1269	op->map = m;	1276	op->map = m;
1270	mapspace &ms = op->ms ();	1277	mapspace &ms = op->ms ();
1271		1278
1272	/* this has to be done after we translate the coordinates.	1279	/* this has to be done after we translate the coordinates.
…		…
1274	if (op->nrof && !(flag & INS_NO_MERGE))	1281	if (op->nrof && !(flag & INS_NO_MERGE))
1275	for (object *tmp = ms.bot; tmp; tmp = tmp->above)	1282	for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1276	if (object::can_merge (op, tmp))	1283	if (object::can_merge (op, tmp))
1277	{	1284	{
1278	op->nrof += tmp->nrof;	1285	op->nrof += tmp->nrof;
1279	tmp->destroy ();	1286	tmp->destroy (1);
1280	}	1287	}
1281		1288
1282	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1289	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1283	CLEAR_FLAG (op, FLAG_INV_LOCKED);	1290	CLEAR_FLAG (op, FLAG_INV_LOCKED);
1284		1291
…		…
1307	else	1314	else
1308	{	1315	{
1309	top = ms.bot;	1316	top = ms.bot;
1310		1317
1311	/* If there are other objects, then */	1318	/* If there are other objects, then */
1312	if ((!(flag & INS_MAP_LOAD)) && top)	1319	if (top)
1313	{	1320	{
1314	object *last = 0;	1321	object *last = 0;
1315		1322
1316	/*	1323	/*
1317	* If there are multiple objects on this space, we do some trickier handling.	1324	* If there are multiple objects on this space, we do some trickier handling.
…		…
1369	*/	1376	*/
1370	if (last && last->below && last != floor)	1377	if (last && last->below && last != floor)
1371	top = last->below;	1378	top = last->below;
1372	}	1379	}
1373	} /* If objects on this space */	1380	} /* If objects on this space */
1374	if (flag & INS_MAP_LOAD)
1375	top = ms.top;
1376		1381
1377	if (flag & INS_ABOVE_FLOOR_ONLY)	1382	if (flag & INS_ABOVE_FLOOR_ONLY)
1378	top = floor;	1383	top = floor;
1379		1384
1380	/* Top is the object that our object (op) is going to get inserted above.	1385	/* Top is the object that our object (op) is going to get inserted above.
…		…
1413	op->map->touch ();	1418	op->map->touch ();
1414	}	1419	}
1415		1420
1416	op->map->dirty = true;	1421	op->map->dirty = true;
1417		1422
1418	/* If we have a floor, we know the player, if any, will be above
1419	* it, so save a few ticks and start from there.
1420	*/
1421	if (!(flag & INS_MAP_LOAD))
1422	if (object *pl = ms.player ())	1423	if (object *pl = ms.player ())
1423	pl->contr->ns->floorbox_update ();	1424	pl->contr->ns->floorbox_update ();
1424		1425
1425	/* If this object glows, it may affect lighting conditions that are	1426	/* If this object glows, it may affect lighting conditions that are
1426	* visible to others on this map. But update_all_los is really	1427	* visible to others on this map. But update_all_los is really
1427	* an inefficient way to do this, as it means los for all players	1428	* an inefficient way to do this, as it means los for all players
1428	* on the map will get recalculated. The players could very well	1429	* on the map will get recalculated. The players could very well
…		…
1470	* op is the object to insert it under: supplies x and the map.	1471	* op is the object to insert it under: supplies x and the map.
1471	*/	1472	*/
1472	void	1473	void
1473	replace_insert_ob_in_map (const char arch_string, object op)	1474	replace_insert_ob_in_map (const char arch_string, object op)
1474	{	1475	{
1475	object tmp, tmp1;
1476
1477	/* first search for itself and remove any old instances */	1476	/* first search for itself and remove any old instances */
1478		1477
1479	for (tmp = op->ms ().bot; tmp; tmp = tmp->above)	1478	for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1480	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */	1479	if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1481	tmp->destroy ();	1480	tmp->destroy (1);
1482		1481
1483	tmp1 = arch_to_object (archetype::find (arch_string));	1482	object *tmp = arch_to_object (archetype::find (arch_string));
1484		1483
1485	tmp1->x = op->x;	1484	tmp->x = op->x;
1486	tmp1->y = op->y;	1485	tmp->y = op->y;
		1486
1487	insert_ob_in_map (tmp1, op->map, op, 0);	1487	insert_ob_in_map (tmp, op->map, op, 0);
1488	}	1488	}
1489		1489
1490	object *	1490	object *
1491	object::insert_at (object where, object originator, int flags)	1491	object::insert_at (object where, object originator, int flags)
1492	{	1492	{
		1493	if (where->env)
		1494	return where->env->insert (this);
		1495	else
1493	return where->map->insert (this, where->x, where->y, originator, flags);	1496	return where->map->insert (this, where->x, where->y, originator, flags);
1494	}	1497	}
1495		1498
1496	/*	1499	// find player who can see this object
1497	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1498	* is returned contains nr objects, and the remaining parts contains
1499	* the rest (or is removed and freed if that number is 0).
1500	* On failure, NULL is returned, and the reason put into the
1501	* global static errmsg array.
1502	*/
1503	object *	1500	object *
1504	get_split_ob (object *orig_ob, uint32 nr)	1501	object::visible_to () const
1505	{	1502	{
1506	object *newob;	1503	if (!flag [FLAG_REMOVED])
1507	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1508
1509	if (orig_ob->nrof < nr)
1510	{
1511	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1512	return NULL;
1513	}	1504	{
1514		1505	// see if we are in a container of sorts
1515	newob = object_create_clone (orig_ob);	1506	if (env)
1516
1517	if ((orig_ob->nrof -= nr) < 1)
1518	orig_ob->destroy (1);
1519	else if (!is_removed)
1520	{
1521	if (orig_ob->env != NULL)
1522	sub_weight (orig_ob->env, orig_ob->weight * nr);
1523	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1524	{
1525	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1526	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1527	return NULL;
1528	}	1507	{
1529	}	1508	// the player inventory itself is always visible
		1509	if (env->type == PLAYER)
		1510	return env;
1530		1511
1531	newob->nrof = nr;	1512	// else a player could have our env open
		1513	object *envest = env->outer_env ();
1532		1514
		1515	// the player itself is always on a map, so we will find him here
		1516	// even if our inv is in a player.
		1517	if (envest->is_on_map ())
		1518	if (object *pl = envest->ms ().player ())
		1519	if (pl->container == env)
		1520	return pl;
		1521	}
		1522	else
		1523	{
		1524	// maybe there is a player standing on the same mapspace
		1525	// this will catch the case where "this" is a player
		1526	if (object *pl = ms ().player ())
		1527	return pl;
		1528	}
		1529	}
		1530
1533	return newob;	1531	return 0;
1534	}	1532	}
1535		1533
1536	/*	1534	/*
1537	* decrease_ob_nr(object, number) decreases a specified number from	1535	* decrease(object, number) decreases a specified number from
1538	* the amount of an object. If the amount reaches 0, the object	1536	* the amount of an object. If the amount reaches 0, the object
1539	* is subsequently removed and freed.	1537	* is subsequently removed and freed.
1540	*	1538	*
1541	* Return value: 'op' if something is left, NULL if the amount reached 0	1539	* Return value: 'op' if something is left, NULL if the amount reached 0
1542	*/	1540	*/
		1541	bool
		1542	object::decrease (sint32 nr)
		1543	{
		1544	if (!nr)
		1545	return true;
		1546
		1547	nr = min (nr, nrof);
		1548
		1549	nrof -= nr;
		1550
		1551	if (nrof)
		1552	{
		1553	adjust_weight (env, -weight * nr); // carrying == 0
		1554
		1555	if (object *pl = visible_to ())
		1556	esrv_update_item (UPD_NROF, pl, this);
		1557
		1558	return true;
		1559	}
		1560	else
		1561	{
		1562	destroy (1);
		1563	return false;
		1564	}
		1565	}
		1566
		1567	/*
		1568	* split(ob,nr) splits up ob into two parts. The part which
		1569	* is returned contains nr objects, and the remaining parts contains
		1570	* the rest (or is removed and returned if that number is 0).
		1571	* On failure, NULL is returned.
		1572	*/
1543	object *	1573	object *
1544	decrease_ob_nr (object *op, uint32 i)	1574	object::split (sint32 nr)
1545	{	1575	{
1546	object *tmp;	1576	int have = number_of ();
1547		1577
1548	if (i == 0) /* objects with op->nrof require this check */	1578	if (have < nr)
1549	return op;	1579	return 0;
1550		1580	else if (have == nr)
1551	if (i > op->nrof)
1552	i = op->nrof;
1553
1554	if (QUERY_FLAG (op, FLAG_REMOVED))
1555	op->nrof -= i;
1556	else if (op->env)
1557	{	1581	{
1558	/* is this object in the players inventory, or sub container
1559	* therein?
1560	*/
1561	tmp = op->in_player ();
1562	/* nope. Is this a container the player has opened?
1563	* If so, set tmp to that player.
1564	* IMO, searching through all the players will mostly
1565	* likely be quicker than following op->env to the map,
1566	* and then searching the map for a player.
1567	*/
1568	if (!tmp)
1569	for_all_players (pl)
1570	if (pl->ob->container == op->env)
1571	{
1572	tmp = pl->ob;
1573	break;
1574	}
1575
1576	if (i < op->nrof)
1577	{
1578	sub_weight (op->env, op->weight * i);
1579	op->nrof -= i;
1580	if (tmp)
1581	esrv_send_item (tmp, op);
1582	}
1583	else
1584	{
1585	op->remove ();	1582	remove ();
1586	op->nrof = 0;	1583	return this;
1587	if (tmp)
1588	esrv_del_item (tmp->contr, op->count);
1589	}
1590	}	1584	}
1591	else	1585	else
1592	{	1586	{
1593	object *above = op->above;	1587	decrease (nr);
1594		1588
1595	if (i < op->nrof)	1589	object *op = object_create_clone (this);
1596	op->nrof -= i;	1590	op->nrof = nr;
1597	else
1598	{
1599	op->remove ();
1600	op->nrof = 0;
1601	}
1602
1603	/* Since we just removed op, op->above is null */
1604	for (tmp = above; tmp; tmp = tmp->above)
1605	if (tmp->type == PLAYER)
1606	{
1607	if (op->nrof)
1608	esrv_send_item (tmp, op);
1609	else
1610	esrv_del_item (tmp->contr, op->count);
1611	}
1612	}
1613
1614	if (op->nrof)
1615	return op;	1591	return op;
1616	else
1617	{
1618	op->destroy ();
1619	return 0;
1620	}
1621	}
1622
1623	/*
1624	* add_weight(object, weight) adds the specified weight to an object,
1625	* and also updates how much the environment(s) is/are carrying.
1626	*/
1627	void
1628	add_weight (object *op, signed long weight)
1629	{
1630	while (op != NULL)
1631	{
1632	if (op->type == CONTAINER)
1633	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1634
1635	op->carrying += weight;
1636	op = op->env;
1637	}	1592	}
1638	}	1593	}
1639		1594
1640	object *	1595	object *
1641	insert_ob_in_ob (object op, object where)	1596	insert_ob_in_ob (object op, object where)
…		…
1666	* be != op, if items are merged. -Tero	1621	* be != op, if items are merged. -Tero
1667	*/	1622	*/
1668	object *	1623	object *
1669	object::insert (object *op)	1624	object::insert (object *op)
1670	{	1625	{
1671	object tmp, otmp;
1672
1673	if (!QUERY_FLAG (op, FLAG_REMOVED))
1674	op->remove ();
1675
1676	if (op->more)	1626	if (op->more)
1677	{	1627	{
1678	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);	1628	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1679	return op;	1629	return op;
1680	}	1630	}
1681		1631
1682	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);	1632	op->remove ();
1683	CLEAR_FLAG (op, FLAG_REMOVED);	1633
		1634	op->flag [FLAG_OBJ_ORIGINAL] = 0;
		1635
1684	if (op->nrof)	1636	if (op->nrof)
1685	{
1686	for (tmp = inv; tmp != NULL; tmp = tmp->below)	1637	for (object *tmp = inv; tmp; tmp = tmp->below)
1687	if (object::can_merge (tmp, op))	1638	if (object::can_merge (tmp, op))
1688	{	1639	{
1689	/* return the original object and remove inserted object	1640	/* return the original object and remove inserted object
1690	(client needs the original object) */	1641	(client needs the original object) */
1691	tmp->nrof += op->nrof;	1642	tmp->nrof += op->nrof;
1692	/* Weight handling gets pretty funky. Since we are adding to
1693	* tmp->nrof, we need to increase the weight.
1694	*/
1695	add_weight (this, op->weight * op->nrof);	1643	adjust_weight (this, op->total_weight ());
1696	SET_FLAG (op, FLAG_REMOVED);	1644
1697	op->destroy (); /* free the inserted object */	1645	op->destroy (1);
1698	op = tmp;	1646	op = tmp;
1699	op->remove (); /* and fix old object's links */	1647	goto inserted;
1700	CLEAR_FLAG (op, FLAG_REMOVED);
1701	break;
1702	}	1648	}
1703		1649
1704	/* I assume combined objects have no inventory	1650	op->owner = 0; // it's his/hers now. period.
1705	* We add the weight - this object could have just been removed	1651	op->map = 0;
1706	* (if it was possible to merge). calling remove_ob will subtract	1652	op->x = 0;
1707	* the weight, so we need to add it in again, since we actually do	1653	op->y = 0;
1708	* the linking below
1709	*/
1710	add_weight (this, op->weight * op->nrof);
1711	}
1712	else
1713	add_weight (this, (op->weight + op->carrying));
1714		1654
1715	otmp = this->in_player ();	1655	op->above = 0;
1716	if (otmp && otmp->contr)	1656	op->below = inv;
		1657	op->env = this;
		1658
		1659	if (inv)
		1660	inv->above = op;
		1661
		1662	inv = op;
		1663
		1664	op->flag [FLAG_REMOVED] = 0;
		1665
		1666	adjust_weight (this, op->total_weight ());
		1667
		1668	inserted:
		1669	/* reset the light list and los of the players on the map */
		1670	if (op->glow_radius && map && map->darkness)
		1671	update_all_los (map, x, y);
		1672
		1673	if (object *otmp = in_player ())
1717	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	1674	if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1718	otmp->update_stats ();	1675	otmp->update_stats ();
1719
1720	op->map = 0;
1721	op->env = this;
1722	op->above = 0;
1723	op->below = 0;
1724	op->x = 0, op->y = 0;
1725
1726	/* reset the light list and los of the players on the map */
1727	if ((op->glow_radius != 0) && map)
1728	{
1729	#ifdef DEBUG_LIGHTS
1730	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1731	#endif /* DEBUG_LIGHTS */
1732	if (map->darkness)
1733	update_all_los (map, x, y);
1734	}
1735
1736	/* Client has no idea of ordering so lets not bother ordering it here.
1737	* It sure simplifies this function...
1738	*/
1739	if (!inv)
1740	inv = op;
1741	else
1742	{
1743	op->below = inv;
1744	op->below->above = op;
1745	inv = op;
1746	}
1747		1676
1748	INVOKE_OBJECT (INSERT, this);	1677	INVOKE_OBJECT (INSERT, this);
1749		1678
1750	return op;	1679	return op;
1751	}	1680	}
…		…
1966	* activate recursively a flag on an object inventory	1895	* activate recursively a flag on an object inventory
1967	*/	1896	*/
1968	void	1897	void
1969	flag_inv (object *op, int flag)	1898	flag_inv (object *op, int flag)
1970	{	1899	{
1971	if (op->inv)
1972	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1900	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1973	{	1901	{
1974	SET_FLAG (tmp, flag);	1902	SET_FLAG (tmp, flag);
1975	flag_inv (tmp, flag);	1903	flag_inv (tmp, flag);
1976	}	1904	}
1977	}	1905	}
1978		1906
1979	/*	1907	/*
1980	* deactivate recursively a flag on an object inventory	1908	* deactivate recursively a flag on an object inventory
1981	*/	1909	*/
1982	void	1910	void
1983	unflag_inv (object *op, int flag)	1911	unflag_inv (object *op, int flag)
1984	{	1912	{
1985	if (op->inv)
1986	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1913	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1987	{	1914	{
1988	CLEAR_FLAG (tmp, flag);	1915	CLEAR_FLAG (tmp, flag);
1989	unflag_inv (tmp, flag);	1916	unflag_inv (tmp, flag);
1990	}	1917	}
1991	}	1918	}
1992		1919
1993	/*	1920	/*
1994	* find_free_spot(object, map, x, y, start, stop) will search for	1921	* find_free_spot(object, map, x, y, start, stop) will search for
1995	* a spot at the given map and coordinates which will be able to contain	1922	* a spot at the given map and coordinates which will be able to contain
…		…
1997	* to search (see the freearr_x/y[] definition).	1924	* to search (see the freearr_x/y[] definition).
1998	* It returns a random choice among the alternatives found.	1925	* It returns a random choice among the alternatives found.
1999	* start and stop are where to start relative to the free_arr array (1,9	1926	* start and stop are where to start relative to the free_arr array (1,9
2000	* does all 4 immediate directions). This returns the index into the	1927	* does all 4 immediate directions). This returns the index into the
2001	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1928	* array of the free spot, -1 if no spot available (dir 0 = x,y)
2002	* Note - this only checks to see if there is space for the head of the
2003	* object - if it is a multispace object, this should be called for all
2004	* pieces.
2005	* Note2: This function does correctly handle tiled maps, but does not	1929	* Note: This function does correctly handle tiled maps, but does not
2006	* inform the caller. However, insert_ob_in_map will update as	1930	* inform the caller. However, insert_ob_in_map will update as
2007	* necessary, so the caller shouldn't need to do any special work.	1931	* necessary, so the caller shouldn't need to do any special work.
2008	* Note - updated to take an object instead of archetype - this is necessary	1932	* Note - updated to take an object instead of archetype - this is necessary
2009	* because arch_blocked (now ob_blocked) needs to know the movement type	1933	* because arch_blocked (now ob_blocked) needs to know the movement type
2010	* to know if the space in question will block the object. We can't use	1934	* to know if the space in question will block the object. We can't use
…		…
2012	* customized, changed states, etc.	1936	* customized, changed states, etc.
2013	*/	1937	*/
2014	int	1938	int
2015	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)	1939	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
2016	{	1940	{
		1941	int altern[SIZEOFFREE];
2017	int index = 0, flag;	1942	int index = 0, flag;
2018	int altern[SIZEOFFREE];
2019		1943
2020	for (int i = start; i < stop; i++)	1944	for (int i = start; i < stop; i++)
2021	{	1945	{
2022	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1946	mapxy pos (m, x, y); pos.move (i);
2023	if (!flag)	1947
		1948	if (!pos.normalise ())
		1949	continue;
		1950
		1951	mapspace &ms = *pos;
		1952
		1953	if (ms.flags () & P_IS_ALIVE)
		1954	continue;
		1955
		1956	/* However, often
		1957	* ob doesn't have any move type (when used to place exits)
		1958	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		1959	*/
		1960	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		1961	{
2024	altern [index++] = i;	1962	altern [index++] = i;
		1963	continue;
		1964	}
2025		1965
2026	/* Basically, if we find a wall on a space, we cut down the search size.	1966	/* Basically, if we find a wall on a space, we cut down the search size.
2027	* In this way, we won't return spaces that are on another side of a wall.	1967	* In this way, we won't return spaces that are on another side of a wall.
2028	* This mostly work, but it cuts down the search size in all directions -	1968	* This mostly work, but it cuts down the search size in all directions -
2029	* if the space being examined only has a wall to the north and empty	1969	* if the space being examined only has a wall to the north and empty
2030	* spaces in all the other directions, this will reduce the search space	1970	* spaces in all the other directions, this will reduce the search space
2031	* to only the spaces immediately surrounding the target area, and	1971	* to only the spaces immediately surrounding the target area, and
2032	* won't look 2 spaces south of the target space.	1972	* won't look 2 spaces south of the target space.
2033	*/	1973	*/
2034	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	1974	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		1975	{
2035	stop = maxfree[i];	1976	stop = maxfree[i];
		1977	continue;
		1978	}
		1979
		1980	/* Note it is intentional that we check ob - the movement type of the
		1981	* head of the object should correspond for the entire object.
		1982	*/
		1983	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		1984	continue;
		1985
		1986	if (ob->blocked (m, pos.x, pos.y))
		1987	continue;
		1988
		1989	altern [index++] = i;
2036	}	1990	}
2037		1991
2038	if (!index)	1992	if (!index)
2039	return -1;	1993	return -1;
2040		1994
…		…
2049	*/	2003	*/
2050	int	2004	int
2051	find_first_free_spot (const object ob, maptile m, int x, int y)	2005	find_first_free_spot (const object ob, maptile m, int x, int y)
2052	{	2006	{
2053	for (int i = 0; i < SIZEOFFREE; i++)	2007	for (int i = 0; i < SIZEOFFREE; i++)
2054	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2008	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2055	return i;	2009	return i;
2056		2010
2057	return -1;	2011	return -1;
2058	}	2012	}
2059		2013
…		…
2596	{	2550	{
2597	char flagdesc[512];	2551	char flagdesc[512];
2598	char info2[256 * 4];	2552	char info2[256 * 4];
2599	char *p = info;	2553	char *p = info;
2600		2554
2601	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2555	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2602	count, uuid.seq,	2556	count,
		2557	uuid.c_str (),
2603	&name,	2558	&name,
2604	title ? "\",title:\"" : "",	2559	title ? "\",title:\"" : "",
2605	title ? (const char *)title : "",	2560	title ? (const char *)title : "",
2606	flag_desc (flagdesc, 512), type);	2561	flag_desc (flagdesc, 512), type);
2607		2562
2608	if (env)	2563	if (!this->flag[FLAG_REMOVED] && env)
2609	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2564	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2610		2565
2611	if (map)	2566	if (map)
2612	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);	2567	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2613		2568
…		…
2723		2678
2724	insert (force);	2679	insert (force);
2725	}	2680	}
2726		2681
2727	void	2682	void
2728	object::play_sound (faceidx sound) const	2683	object::play_sound (faceidx sound)
2729	{	2684	{
2730	if (!sound)	2685	if (!sound)
2731	return;	2686	return;
2732		2687
2733	if (flag [FLAG_REMOVED])	2688	if (flag [FLAG_REMOVED])

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.179 by root, Wed Aug 15 04:57:48 2007 UTC vs. Revision 1.213 by root, Tue Apr 22 01:18:10 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.179 by root, Wed Aug 15 04:57:48 2007 UTC vs.
Revision 1.213 by root, Tue Apr 22 01:18:10 2008 UTC