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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.182 by root, Mon Aug 20 18:11:02 2007 UTC vs.
Revision 1.207 by root, Sun Apr 20 23:25:09 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 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.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
26	variable. */	26	variable. */
		27
27	#include <global.h>	28	#include <global.h>
28	#include <stdio.h>	29	#include <stdio.h>
29	#include <sys/types.h>	30	#include <sys/types.h>
30	#include <sys/uio.h>	31	#include <sys/uio.h>
31	#include <object.h>	32	#include <object.h>
…		…
33	#include <sproto.h>	34	#include <sproto.h>
34	#include <loader.h>	35	#include <loader.h>
35		36
36	#include <bitset>	37	#include <bitset>
37		38
38	int nrofallocobjects = 0;	39	UUID UUID::cur;
39	static UUID uuid;	40	static uint64_t seq_next_save;
40	const uint64 UUID_SKIP = 1<<19;	41	static const uint64 UUID_GAP = 1<<19;
41		42
42	objectvec objects;	43	objectvec objects;
43	activevec actives;	44	activevec actives;
44		45
45	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	46	short freearr_x[SIZEOFFREE] = {
		47	0,
		48	0, 1, 1, 1, 0, -1, -1, -1,
		49	0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	50	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
47	};	51	};
48	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	52	short freearr_y[SIZEOFFREE] = {
		53	0,
		54	-1, -1, 0, 1, 1, 1, 0, -1,
		55	-2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
49	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3	56	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
50	};	57	};
51	int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,	58	int maxfree[SIZEOFFREE] = {
		59	0,
		60	9, 10, 13, 14, 17, 18, 21, 22,
		61	25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
52	48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49	62	49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
53	};	63	};
54	int freedir[SIZEOFFREE] = {	64	int freedir[SIZEOFFREE] = {
55	0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,	65	0,
		66	1, 2, 3, 4, 5, 6, 7, 8,
		67	1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
56	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8	68	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
57	};	69	};
58		70
59	static void	71	static void
60	write_uuid (void)	72	write_uuid (uval64 skip, bool sync)
61	{	73	{
62	char filename1[MAX_BUF], filename2[MAX_BUF];	74	CALL_BEGIN (2);
63		75	CALL_ARG_SV (newSVval64 (skip));
64	sprintf (filename1, "%s/uuid", settings.localdir);	76	CALL_ARG_SV (boolSV (sync));
65	sprintf (filename2, "%s/uuid~", settings.localdir);	77	CALL_CALL ("cf::write_uuid", G_DISCARD);
66		78	CALL_END;
67	FILE *fp;
68
69	if (!(fp = fopen (filename2, "w")))
70	{
71	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
72	return;
73	}
74
75	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
76	fclose (fp);
77	rename (filename2, filename1);
78	}	79	}
79		80
80	static void	81	static void
81	read_uuid (void)	82	read_uuid (void)
82	{	83	{
83	char filename[MAX_BUF];	84	char filename[MAX_BUF];
84		85
85	sprintf (filename, "%s/uuid", settings.localdir);	86	sprintf (filename, "%s/uuid", settings.localdir);
86		87
		88	seq_next_save = 0;
		89
87	FILE *fp;	90	FILE *fp;
88		91
89	if (!(fp = fopen (filename, "r")))	92	if (!(fp = fopen (filename, "r")))
90	{	93	{
91	if (errno == ENOENT)	94	if (errno == ENOENT)
92	{	95	{
93	LOG (llevInfo, "RESET uid to 1\n");	96	LOG (llevInfo, "RESET uid to 1\n");
94	uuid.seq = 0;	97	UUID::cur.seq = 0;
95	write_uuid ();	98	write_uuid (UUID_GAP, true);
96	return;	99	return;
97	}	100	}
98		101
99	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);	102	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
100	_exit (1);	103	_exit (1);
101	}	104	}
102		105
103	int version;	106	UUID::BUF buf;
104	unsigned long long uid;	107	buf[0] = 0;
105	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) \|\| version != 1)	108	fgets (buf, sizeof (buf), fp);
		109
		110	if (!UUID::cur.parse (buf))
106	{	111	{
107	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);	112	LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf);
108	_exit (1);	113	_exit (1);
109	}	114	}
110		115
111	uuid.seq = uid;	116	LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ());
112	write_uuid ();	117
113	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);	118	write_uuid (UUID_GAP, true);
114	fclose (fp);	119	fclose (fp);
115	}	120	}
116		121
117	UUID	122	UUID
118	gen_uuid ()	123	UUID::gen ()
119	{	124	{
120	UUID uid;	125	UUID uid;
121		126
122	uid.seq = ++uuid.seq;	127	uid.seq = ++cur.seq;
123		128
124	if (!(uuid.seq & (UUID_SKIP - 1)))	129	if (expect_false (cur.seq >= seq_next_save))
125	write_uuid ();	130	{
		131	seq_next_save = UUID::cur.seq + (UUID_GAP >> 1);
		132	write_uuid (UUID_GAP, false);
		133	}
		134
126		135
127	return uid;	136	return uid;
128	}	137	}
129		138
130	void	139	void
131	init_uuid ()	140	UUID::init ()
132	{	141	{
133	read_uuid ();	142	read_uuid ();
134	}	143	}
135		144
136	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	145	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
137	static int	146	static bool
138	compare_ob_value_lists_one (const object wants, const object has)	147	compare_ob_value_lists_one (const object wants, const object has)
139	{	148	{
140	key_value *wants_field;	149	key_value *wants_field;
141		150
142	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	151	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
…		…
150	key_value *has_field;	159	key_value *has_field;
151		160
152	/* Look for a field in has with the same key. */	161	/* Look for a field in has with the same key. */
153	has_field = get_ob_key_link (has, wants_field->key);	162	has_field = get_ob_key_link (has, wants_field->key);
154		163
155	if (has_field == NULL)	164	if (!has_field)
156	{
157	/* No field with that name. */	165	return 0; /* No field with that name. */
158	return FALSE;
159	}
160		166
161	/* Found the matching field. */	167	/* Found the matching field. */
162	if (has_field->value != wants_field->value)	168	if (has_field->value != wants_field->value)
163	{
164	/* Values don't match, so this half of the comparison is false. */	169	return 0; /* Values don't match, so this half of the comparison is false. */
165	return FALSE;
166	}
167		170
168	/* If we get here, we found a match. Now for the next field in wants. */	171	/* If we get here, we found a match. Now for the next field in wants. */
169	}	172	}
170		173
171	/* If we get here, every field in wants has a matching field in has. */	174	/* If we get here, every field in wants has a matching field in has. */
172	return TRUE;	175	return 1;
173	}	176	}
174		177
175	/* Returns TRUE if ob1 has the same key_values as ob2. */	178	/* Returns TRUE if ob1 has the same key_values as ob2. */
176	static int	179	static bool
177	compare_ob_value_lists (const object ob1, const object ob2)	180	compare_ob_value_lists (const object ob1, const object ob2)
178	{	181	{
179	/* However, there may be fields in has which aren't partnered in wants,	182	/* However, there may be fields in has which aren't partnered in wants,
180	* so we need to run the comparison twice. :(	183	* so we need to run the comparison twice. :(
181	*/	184	*/
…		…
202	\|\| ob1->speed != ob2->speed	205	\|\| ob1->speed != ob2->speed
203	\|\| ob1->value != ob2->value	206	\|\| ob1->value != ob2->value
204	\|\| ob1->name != ob2->name)	207	\|\| ob1->name != ob2->name)
205	return 0;	208	return 0;
206		209
207	//TODO: this ain't working well, use nicer and correct overflow check	210	/* Do not merge objects if nrof would overflow. First part checks
208	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	211	* for unsigned overflow (2c), second part checks wether the result
209	* value could not be stored in a sint32 (which unfortunately sometimes is	212	* would fit into a 32 bit signed int, which is often used to hold
210	* used to store nrof).	213	* nrof values.
211	*/	214	*/
212	if (ob1->nrof + ob2->nrof >= 1UL << 31)	215	if (~ob1->nrof < ob2->nrof \|\| ob1->nrof + ob2->nrof > (1UL << 31))
213	return 0;	216	return 0;
214		217
215	/* If the objects have been identified, set the BEEN_APPLIED flag.	218	/* If the objects have been identified, set the BEEN_APPLIED flag.
216	* This is to the comparison of the flags below will be OK. We	219	* This is to the comparison of the flags below will be OK. We
217	* just can't ignore the been applied or identified flags, as they	220	* just can't ignore the been applied or identified flags, as they
218	* are not equal - just if it has been identified, the been_applied	221	* are not equal - just if it has been identified, the been_applied
219	* flags lose any meaning.	222	* flags lose any meaning.
220	*/	223	*/
221	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))	224	if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
…		…
249	\|\| ob1->move_off != ob2->move_off	252	\|\| ob1->move_off != ob2->move_off
250	\|\| ob1->move_slow != ob2->move_slow	253	\|\| ob1->move_slow != ob2->move_slow
251	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty)	254	\|\| ob1->move_slow_penalty != ob2->move_slow_penalty)
252	return 0;	255	return 0;
253		256
254	/* This is really a spellbook check - really, we should	257	/* This is really a spellbook check - we should in general
255	* check all objects in the inventory.	258	* not merge objects with real inventories, as splitting them
		259	* is hard.
256	*/	260	*/
257	if (ob1->inv \|\| ob2->inv)	261	if (ob1->inv \|\| ob2->inv)
258	{	262	{
259	/* if one object has inventory but the other doesn't, not equiv */	263	if (!(ob1->inv && ob2->inv))
260	if ((ob1->inv && !ob2->inv) \|\| (ob2->inv && !ob1->inv))	264	return 0; /* inventories differ in length */
261	return 0;
262		265
263	/* Now check to see if the two inventory objects could merge */	266	if (ob1->inv->below \|\| ob2->inv->below)
		267	return 0; /* more than one object in inv */
		268
264	if (!object::can_merge (ob1->inv, ob2->inv))	269	if (!object::can_merge (ob1->inv, ob2->inv))
265	return 0;	270	return 0; /* inventory objects differ */
266		271
267	/* inventory ok - still need to check rest of this object to see	272	/* inventory ok - still need to check rest of this object to see
268	* if it is valid.	273	* if it is valid.
269	*/	274	*/
270	}	275	}
…		…
289	if (ob1->level != ob2->level)	294	if (ob1->level != ob2->level)
290	return 0;	295	return 0;
291	break;	296	break;
292	}	297	}
293		298
294	if (ob1->key_values != NULL \|\| ob2->key_values != NULL)	299	if (ob1->key_values \|\| ob2->key_values)
295	{	300	{
296	/* At least one of these has key_values. */	301	/* At least one of these has key_values. */
297	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	302	if ((!ob1->key_values) != (!ob2->key_values))
298	/* One has fields, but the other one doesn't. */	303	/* One has fields, but the other one doesn't. */
299	return 0;	304	return 0;
300	else if (!compare_ob_value_lists (ob1, ob2))	305	else if (!compare_ob_value_lists (ob1, ob2))
301	return 0;	306	return 0;
302	}	307	}
…		…
305	{	310	{
306	ob1->optimise ();	311	ob1->optimise ();
307	ob2->optimise ();	312	ob2->optimise ();
308		313
309	if (ob1->self \|\| ob2->self)	314	if (ob1->self \|\| ob2->self)
310	if (!cfperl_can_merge (ob1, ob2))	315	{
		316	int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
		317	int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
		318
		319	if (k1 != k2)
311	return 0;	320	return 0;
		321	else if (k1 == 0)
		322	return 1;
		323	else if (!cfperl_can_merge (ob1, ob2))
		324	return 0;
		325	}
312	}	326	}
313		327
314	/* Everything passes, must be OK. */	328	/* Everything passes, must be OK. */
315	return 1;	329	return 1;
316	}	330	}
317		331
		332	static sint32
		333	weight_adjust (object *op, sint32 weight)
		334	{
		335	return op->type == CONTAINER
		336	? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
		337	: weight;
		338	}
		339
318	/*	340	/*
		341	* add_weight(object, weight) adds the specified weight to an object,
		342	* and also updates how much the environment(s) is/are carrying.
		343	*/
		344	static void
		345	add_weight (object *op, sint32 weight)
		346	{
		347	while (op)
		348	{
		349	weight = weight_adjust (op, weight);
		350
		351	op->carrying += weight;
		352	op = op->env;
		353	}
		354	}
		355
		356	/*
		357	* sub_weight() recursively (outwards) subtracts a number from the
		358	* weight of an object (and what is carried by it's environment(s)).
		359	*/
		360	static void
		361	sub_weight (object *op, long weight)
		362	{
		363	add_weight (op, -weight);
		364	}
		365
		366	/*
319	* sum_weight() is a recursive function which calculates the weight	367	* this is a recursive function which calculates the weight
320	* an object is carrying. It goes through in figures out how much	368	* an object is carrying. It goes through op and figures out how much
321	* containers are carrying, and sums it up.	369	* containers are carrying, and sums it up.
322	*/	370	*/
323	long	371	void
324	sum_weight (object *op)	372	object::update_weight ()
325	{	373	{
326	long sum;	374	sint32 sum = 0;
327	object *inv;
328		375
329	for (sum = 0, inv = op->inv; inv; inv = inv->below)	376	for (object *op = inv; op; op = op->below)
330	{	377	{
331	if (inv->inv)	378	if (op->inv)
332	sum_weight (inv);	379	op->update_weight ();
333		380
334	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	381	sum += op->total_weight ();
335	}	382	}
336		383
337	if (op->type == CONTAINER && op->stats.Str)	384	carrying = weight_adjust (this, sum);
338	sum = (sum * (100 - op->stats.Str)) / 100;
339
340	if (op->carrying != sum)
341	op->carrying = sum;
342
343	return sum;
344	}
345
346	/**
347	* Return the outermost environment object for a given object.
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	}	385	}
357		386
358	/*	387	/*
359	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	388	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
360	* Some error messages.	389	* Some error messages.
…		…
374	/*	403	/*
375	* get_nearest_part(multi-object, object 2) returns the part of the	404	* get_nearest_part(multi-object, object 2) returns the part of the
376	* multi-object 1 which is closest to the second object.	405	* multi-object 1 which is closest to the second object.
377	* If it's not a multi-object, it is returned.	406	* If it's not a multi-object, it is returned.
378	*/	407	*/
379
380	object *	408	object *
381	get_nearest_part (object op, const object pl)	409	get_nearest_part (object op, const object pl)
382	{	410	{
383	object tmp, closest;	411	object tmp, closest;
384	int last_dist, i;	412	int last_dist, i;
…		…
420	break;	448	break;
421		449
422	return op;	450	return op;
423	}	451	}
424		452
425	void
426	free_all_object_data ()
427	{
428	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
429	}
430
431	/*	453	/*
432	* Sets the owner and sets the skill and exp pointers to owner's current	454	* Sets the owner and sets the skill and exp pointers to owner's current
433	* skill and experience objects.	455	* skill and experience objects.
		456	* ACTUALLY NO! investigate! TODO
434	*/	457	*/
435	void	458	void
436	object::set_owner (object *owner)	459	object::set_owner (object *owner)
437	{	460	{
		461	// allow objects which own objects
438	if (!owner)	462	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)	463	while (owner->owner)
449	owner = owner->owner;	464	owner = owner->owner;
		465
		466	if (flag [FLAG_FREED])
		467	{
		468	LOG (llevError \| logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
		469	return;
		470	}
450		471
451	this->owner = owner;	472	this->owner = owner;
452	}	473	}
453		474
454	int	475	int
…		…
586	object::copy_to (object *dst)	607	object::copy_to (object *dst)
587	{	608	{
588	dst = this;	609	dst = this;
589		610
590	if (speed < 0)	611	if (speed < 0)
591	dst->speed_left = speed_left - rndm ();	612	dst->speed_left -= rndm ();
592		613
593	dst->set_speed (dst->speed);	614	dst->set_speed (dst->speed);
594	}	615	}
595		616
596	void	617	void
597	object::instantiate ()	618	object::instantiate ()
598	{	619	{
599	if (!uuid.seq) // HACK	620	if (!uuid.seq) // HACK
600	uuid = gen_uuid ();	621	uuid = UUID::gen ();
601		622
602	speed_left = -0.1f;	623	speed_left = -0.1f;
603	/* copy the body_info to the body_used - this is only really	624	/* copy the body_info to the body_used - this is only really
604	* need for monsters, but doesn't hurt to do it for everything.	625	* need for monsters, but doesn't hurt to do it for everything.
605	* by doing so, when a monster is created, it has good starting	626	* by doing so, when a monster is created, it has good starting
…		…
764	static int object_count;	785	static int object_count;
765		786
766	void object::link ()	787	void object::link ()
767	{	788	{
768	assert (!index);//D	789	assert (!index);//D
769	uuid = gen_uuid ();	790	uuid = UUID::gen ();
770	count = ++object_count;	791	count = ++object_count;
771		792
772	refcnt_inc ();	793	refcnt_inc ();
773	objects.insert (this);	794	objects.insert (this);
774	}	795	}
…		…
858	* if some form of movement is allowed, let objects	879	* if some form of movement is allowed, let objects
859	* drop on that space.	880	* drop on that space.
860	*/	881	*/
861	if (!drop_to_ground	882	if (!drop_to_ground
862	\|\| !map	883	\|\| !map
863	\|\| map->in_memory != MAP_IN_MEMORY	884	\|\| map->in_memory != MAP_ACTIVE
864	\|\| map->nodrop	885	\|\| map->nodrop
865	\|\| ms ().move_block == MOVE_ALL)	886	\|\| ms ().move_block == MOVE_ALL)
866	{	887	{
867	while (inv)	888	while (inv)
868	{	889	{
…		…
923		944
924	if (!freed_map)	945	if (!freed_map)
925	{	946	{
926	freed_map = new maptile;	947	freed_map = new maptile;
927		948
		949	freed_map->path = "<freed objects map>";
928	freed_map->name = "/internal/freed_objects_map";	950	freed_map->name = "/internal/freed_objects_map";
929	freed_map->width = 3;	951	freed_map->width = 3;
930	freed_map->height = 3;	952	freed_map->height = 3;
		953	freed_map->nodrop = 1;
931		954
932	freed_map->alloc ();	955	freed_map->alloc ();
933	freed_map->in_memory = MAP_IN_MEMORY;	956	freed_map->in_memory = MAP_ACTIVE;
934	}	957	}
935		958
936	map = freed_map;	959	map = freed_map;
937	x = 1;	960	x = 1;
938	y = 1;	961	y = 1;
…		…
967	play_sound (sound_destroy);	990	play_sound (sound_destroy);
968	else if (flag [FLAG_MONSTER])	991	else if (flag [FLAG_MONSTER])
969	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism	992	play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
970		993
971	attachable::destroy ();	994	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	}	995	}
990		996
991	/* op->remove ():	997	/* op->remove ():
992	* This function removes the object op from the linked list of objects	998	* This function removes the object op from the linked list of objects
993	* which it is currently tied to. When this function is done, the	999	* which it is currently tied to. When this function is done, the
…		…
1147	merge_ob (object op, object top)	1153	merge_ob (object op, object top)
1148	{	1154	{
1149	if (!op->nrof)	1155	if (!op->nrof)
1150	return 0;	1156	return 0;
1151		1157
1152	if (top)	1158	if (!top)
1153	for (top = op; top && top->above; top = top->above)	1159	for (top = op; top && top->above; top = top->above)
1154	;	1160	;
1155		1161
1156	for (; top; top = top->below)	1162	for (; top; top = top->below)
1157	{	1163	{
…		…
1238		1244
1239	object top, floor = NULL;	1245	object top, floor = NULL;
1240		1246
1241	op->remove ();	1247	op->remove ();
1242		1248
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	1249	/* 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	1250	* of areas of callers (eg, anything that uses find_free_spot would now
1264	* need extra work	1251	* need extra work
1265	*/	1252	*/
1266	if (!xy_normalise (m, op->x, op->y))	1253	if (!xy_normalise (m, op->x, op->y))
		1254	{
		1255	op->destroy ();
1267	return 0;	1256	return 0;
		1257	}
		1258
		1259	if (object *more = op->more)
		1260	if (!insert_ob_in_map (more, m, originator, flag))
		1261	return 0;
		1262
		1263	CLEAR_FLAG (op, FLAG_REMOVED);
1268		1264
1269	op->map = m;	1265	op->map = m;
1270	mapspace &ms = op->ms ();	1266	mapspace &ms = op->ms ();
1271		1267
1272	/* this has to be done after we translate the coordinates.	1268	/* this has to be done after we translate the coordinates.
…		…
1307	else	1303	else
1308	{	1304	{
1309	top = ms.bot;	1305	top = ms.bot;
1310		1306
1311	/* If there are other objects, then */	1307	/* If there are other objects, then */
1312	if ((!(flag & INS_MAP_LOAD)) && top)	1308	if (top)
1313	{	1309	{
1314	object *last = 0;	1310	object *last = 0;
1315		1311
1316	/*	1312	/*
1317	* If there are multiple objects on this space, we do some trickier handling.	1313	* If there are multiple objects on this space, we do some trickier handling.
…		…
1369	*/	1365	*/
1370	if (last && last->below && last != floor)	1366	if (last && last->below && last != floor)
1371	top = last->below;	1367	top = last->below;
1372	}	1368	}
1373	} /* If objects on this space */	1369	} /* If objects on this space */
1374	if (flag & INS_MAP_LOAD)
1375	top = ms.top;
1376		1370
1377	if (flag & INS_ABOVE_FLOOR_ONLY)	1371	if (flag & INS_ABOVE_FLOOR_ONLY)
1378	top = floor;	1372	top = floor;
1379		1373
1380	/* Top is the object that our object (op) is going to get inserted above.	1374	/* Top is the object that our object (op) is going to get inserted above.
…		…
1413	op->map->touch ();	1407	op->map->touch ();
1414	}	1408	}
1415		1409
1416	op->map->dirty = true;	1410	op->map->dirty = true;
1417		1411
1418	if (!(flag & INS_MAP_LOAD))
1419	if (object *pl = ms.player ())	1412	if (object *pl = ms.player ())
1420	pl->contr->ns->floorbox_update ();	1413	pl->contr->ns->floorbox_update ();
1421		1414
1422	/* If this object glows, it may affect lighting conditions that are	1415	/* If this object glows, it may affect lighting conditions that are
1423	* visible to others on this map. But update_all_los is really	1416	* visible to others on this map. But update_all_los is really
1424	* an inefficient way to do this, as it means los for all players	1417	* an inefficient way to do this, as it means los for all players
1425	* on the map will get recalculated. The players could very well	1418	* on the map will get recalculated. The players could very well
…		…
1485	}	1478	}
1486		1479
1487	object *	1480	object *
1488	object::insert_at (object where, object originator, int flags)	1481	object::insert_at (object where, object originator, int flags)
1489	{	1482	{
		1483	if (where->env)
		1484	return where->env->insert (this);
		1485	else
1490	return where->map->insert (this, where->x, where->y, originator, flags);	1486	return where->map->insert (this, where->x, where->y, originator, flags);
1491	}	1487	}
1492		1488
1493	/*	1489	/*
1494	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1490	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1495	* is returned contains nr objects, and the remaining parts contains	1491	* is returned contains nr objects, and the remaining parts contains
…		…
1515	orig_ob->destroy (1);	1511	orig_ob->destroy (1);
1516	else if (!is_removed)	1512	else if (!is_removed)
1517	{	1513	{
1518	if (orig_ob->env != NULL)	1514	if (orig_ob->env != NULL)
1519	sub_weight (orig_ob->env, orig_ob->weight * nr);	1515	sub_weight (orig_ob->env, orig_ob->weight * nr);
1520	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)	1516	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_ACTIVE)
1521	{	1517	{
1522	strcpy (errmsg, "Tried to split object whose map is not in memory.");	1518	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1523	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");	1519	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1524	return NULL;	1520	return NULL;
1525	}	1521	}
…		…
1612	return op;	1608	return op;
1613	else	1609	else
1614	{	1610	{
1615	op->destroy ();	1611	op->destroy ();
1616	return 0;	1612	return 0;
1617	}
1618	}
1619
1620	/*
1621	* add_weight(object, weight) adds the specified weight to an object,
1622	* and also updates how much the environment(s) is/are carrying.
1623	*/
1624	void
1625	add_weight (object *op, signed long weight)
1626	{
1627	while (op != NULL)
1628	{
1629	if (op->type == CONTAINER)
1630	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1631
1632	op->carrying += weight;
1633	op = op->env;
1634	}	1613	}
1635	}	1614	}
1636		1615
1637	object *	1616	object *
1638	insert_ob_in_ob (object op, object where)	1617	insert_ob_in_ob (object op, object where)
…		…
1962	* activate recursively a flag on an object inventory	1941	* activate recursively a flag on an object inventory
1963	*/	1942	*/
1964	void	1943	void
1965	flag_inv (object *op, int flag)	1944	flag_inv (object *op, int flag)
1966	{	1945	{
1967	if (op->inv)
1968	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1946	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1969	{	1947	{
1970	SET_FLAG (tmp, flag);	1948	SET_FLAG (tmp, flag);
1971	flag_inv (tmp, flag);	1949	flag_inv (tmp, flag);
1972	}	1950	}
1973	}	1951	}
1974		1952
1975	/*	1953	/*
1976	* deactivate recursively a flag on an object inventory	1954	* deactivate recursively a flag on an object inventory
1977	*/	1955	*/
1978	void	1956	void
1979	unflag_inv (object *op, int flag)	1957	unflag_inv (object *op, int flag)
1980	{	1958	{
1981	if (op->inv)
1982	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)	1959	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1983	{	1960	{
1984	CLEAR_FLAG (tmp, flag);	1961	CLEAR_FLAG (tmp, flag);
1985	unflag_inv (tmp, flag);	1962	unflag_inv (tmp, flag);
1986	}	1963	}
1987	}	1964	}
1988		1965
1989	/*	1966	/*
1990	* find_free_spot(object, map, x, y, start, stop) will search for	1967	* find_free_spot(object, map, x, y, start, stop) will search for
1991	* a spot at the given map and coordinates which will be able to contain	1968	* a spot at the given map and coordinates which will be able to contain
…		…
1993	* to search (see the freearr_x/y[] definition).	1970	* to search (see the freearr_x/y[] definition).
1994	* It returns a random choice among the alternatives found.	1971	* It returns a random choice among the alternatives found.
1995	* start and stop are where to start relative to the free_arr array (1,9	1972	* start and stop are where to start relative to the free_arr array (1,9
1996	* does all 4 immediate directions). This returns the index into the	1973	* does all 4 immediate directions). This returns the index into the
1997	* array of the free spot, -1 if no spot available (dir 0 = x,y)	1974	* array of the free spot, -1 if no spot available (dir 0 = x,y)
1998	* Note - this only checks to see if there is space for the head of the
1999	* object - if it is a multispace object, this should be called for all
2000	* pieces.
2001	* Note2: This function does correctly handle tiled maps, but does not	1975	* Note: This function does correctly handle tiled maps, but does not
2002	* inform the caller. However, insert_ob_in_map will update as	1976	* inform the caller. However, insert_ob_in_map will update as
2003	* necessary, so the caller shouldn't need to do any special work.	1977	* necessary, so the caller shouldn't need to do any special work.
2004	* Note - updated to take an object instead of archetype - this is necessary	1978	* Note - updated to take an object instead of archetype - this is necessary
2005	* because arch_blocked (now ob_blocked) needs to know the movement type	1979	* because arch_blocked (now ob_blocked) needs to know the movement type
2006	* to know if the space in question will block the object. We can't use	1980	* to know if the space in question will block the object. We can't use
…		…
2008	* customized, changed states, etc.	1982	* customized, changed states, etc.
2009	*/	1983	*/
2010	int	1984	int
2011	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)	1985	find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
2012	{	1986	{
		1987	int altern[SIZEOFFREE];
2013	int index = 0, flag;	1988	int index = 0, flag;
2014	int altern[SIZEOFFREE];
2015		1989
2016	for (int i = start; i < stop; i++)	1990	for (int i = start; i < stop; i++)
2017	{	1991	{
2018	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);	1992	mapxy pos (m, x, y); pos.move (i);
2019	if (!flag)	1993
		1994	if (!pos.normalise ())
		1995	continue;
		1996
		1997	mapspace &ms = *pos;
		1998
		1999	if (ms.flags () & P_IS_ALIVE)
		2000	continue;
		2001
		2002	/* However, often
		2003	* ob doesn't have any move type (when used to place exits)
		2004	* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
		2005	*/
		2006	if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
		2007	{
2020	altern [index++] = i;	2008	altern [index++] = i;
		2009	continue;
		2010	}
2021		2011
2022	/* Basically, if we find a wall on a space, we cut down the search size.	2012	/* Basically, if we find a wall on a space, we cut down the search size.
2023	* In this way, we won't return spaces that are on another side of a wall.	2013	* In this way, we won't return spaces that are on another side of a wall.
2024	* This mostly work, but it cuts down the search size in all directions -	2014	* This mostly work, but it cuts down the search size in all directions -
2025	* if the space being examined only has a wall to the north and empty	2015	* if the space being examined only has a wall to the north and empty
2026	* spaces in all the other directions, this will reduce the search space	2016	* spaces in all the other directions, this will reduce the search space
2027	* to only the spaces immediately surrounding the target area, and	2017	* to only the spaces immediately surrounding the target area, and
2028	* won't look 2 spaces south of the target space.	2018	* won't look 2 spaces south of the target space.
2029	*/	2019	*/
2030	else if ((flag & P_NO_PASS) && maxfree[i] < stop)	2020	if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
		2021	{
2031	stop = maxfree[i];	2022	stop = maxfree[i];
		2023	continue;
		2024	}
		2025
		2026	/* Note it is intentional that we check ob - the movement type of the
		2027	* head of the object should correspond for the entire object.
		2028	*/
		2029	if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
		2030	continue;
		2031
		2032	if (ob->blocked (m, pos.x, pos.y))
		2033	continue;
		2034
		2035	altern [index++] = i;
2032	}	2036	}
2033		2037
2034	if (!index)	2038	if (!index)
2035	return -1;	2039	return -1;
2036		2040
…		…
2045	*/	2049	*/
2046	int	2050	int
2047	find_first_free_spot (const object ob, maptile m, int x, int y)	2051	find_first_free_spot (const object ob, maptile m, int x, int y)
2048	{	2052	{
2049	for (int i = 0; i < SIZEOFFREE; i++)	2053	for (int i = 0; i < SIZEOFFREE; i++)
2050	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))	2054	if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2051	return i;	2055	return i;
2052		2056
2053	return -1;	2057	return -1;
2054	}	2058	}
2055		2059
…		…
2592	{	2596	{
2593	char flagdesc[512];	2597	char flagdesc[512];
2594	char info2[256 * 4];	2598	char info2[256 * 4];
2595	char *p = info;	2599	char *p = info;
2596		2600
2597	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",	2601	p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}",
2598	count, uuid.seq,	2602	count,
		2603	uuid.c_str (),
2599	&name,	2604	&name,
2600	title ? "\",title:\"" : "",	2605	title ? "\",title:\"" : "",
2601	title ? (const char *)title : "",	2606	title ? (const char *)title : "",
2602	flag_desc (flagdesc, 512), type);	2607	flag_desc (flagdesc, 512), type);
2603		2608

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.182 by root, Mon Aug 20 18:11:02 2007 UTC vs. Revision 1.207 by root, Sun Apr 20 23:25:09 2008 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.182 by root, Mon Aug 20 18:11:02 2007 UTC vs.
Revision 1.207 by root, Sun Apr 20 23:25:09 2008 UTC