ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/common/object.C

Comparing deliantra/server/common/object.C (file contents):
Revision 1.18 by root, Fri Sep 8 16:51:42 2006 UTC vs.
Revision 1.82 by root, Mon Dec 25 11:25:49 2006 UTC

1	/*
2	* static char *rcsid_object_c =
3	* "$Id: object.C,v 1.18 2006/09/08 16:51:42 root Exp $";
4	*/
5
6	/*	1	/*
7	CrossFire, A Multiplayer game for X-windows	2	CrossFire, A Multiplayer game for X-windows
8		3
9	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	4	Copyright (C) 2001 Mark Wedel & Crossfire Development Team
10	Copyright (C) 1992 Frank Tore Johansen	5	Copyright (C) 1992 Frank Tore Johansen
…		…
21		16
22	You should have received a copy of the GNU General Public License	17	You should have received a copy of the GNU General Public License
23	along with this program; if not, write to the Free Software	18	along with this program; if not, write to the Free Software
24	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25		20
26	The authors can be reached via e-mail at crossfire-devel@real-time.com	21	The authors can be reached via e-mail at <crossfire@schmorp.de>
27	*/	22	*/
28		23
29	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	24	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
30	sub/add_weight will transcend the environment updating the carrying	25	sub/add_weight will transcend the environment updating the carrying
31	variable. */	26	variable. */
32	#include <global.h>	27	#include <global.h>
33	#ifndef WIN32 /* ---win32 exclude headers */
34	#include <stdio.h>	28	#include <stdio.h>
35	#include <sys/types.h>	29	#include <sys/types.h>
36	#include <sys/uio.h>	30	#include <sys/uio.h>
37	#endif /* win32 */
38	#include <object.h>	31	#include <object.h>
39	#include <funcpoint.h>	32	#include <funcpoint.h>
40	#include <skills.h>
41	#include <loader.h>	33	#include <loader.h>
		34
		35	#include <bitset>
		36
42	int nrofallocobjects = 0;	37	int nrofallocobjects = 0;
		38	static UUID uuid;
		39	const uint64 UUID_SKIP = 1<<19;
43		40
44	object *objects; /* Pointer to the list of used objects */
45	object *active_objects; /* List of active objects that need to be processed */	41	object *active_objects; /* List of active objects that need to be processed */
46		42
47	short freearr_x[SIZEOFFREE]=	43	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,
48	{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,
49	0,1,2,3,3,3,3,3,3,3,2,1,0,-1,-2,-3,-3,-3,-3,-3,-3,-3,-2,-1};	44	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	short freearr_y[SIZEOFFREE]=	45	};
51	{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,	46	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	-3,-3,-3,-3,-2,-1,0,1,2,3,3,3,3,3,3,3,2,1,0,-1,-2,-3,-3,-3};	47	-3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
53	int maxfree[SIZEOFFREE]=	48	};
54	{0,9,10,13,14,17,18,21,22,25,26,27,30,31,32,33,36,37,39,39,42,43,44,45,	49	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,
55	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};	50	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
		51	};
56	int freedir[SIZEOFFREE]= {	52	int freedir[SIZEOFFREE] = {
57	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,	53	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,
58	1,2,2,2,2,2,3,4,4,4,4,4,5,6,6,6,6,6,7,8,8,8,8,8};	54	1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
		55	};
59		56
		57	static void
		58	write_uuid (void)
		59	{
		60	char filename1[MAX_BUF], filename2[MAX_BUF];
		61
		62	sprintf (filename1, "%s/uuid", settings.localdir);
		63	sprintf (filename2, "%s/uuid~", settings.localdir);
		64
		65	FILE *fp;
		66
		67	if (!(fp = fopen (filename2, "w")))
		68	{
		69	LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
		70	return;
		71	}
		72
		73	fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
		74	fclose (fp);
		75	rename (filename2, filename1);
		76	}
		77
		78	static void
		79	read_uuid (void)
		80	{
		81	char filename[MAX_BUF];
		82
		83	sprintf (filename, "%s/uuid", settings.localdir);
		84
		85	FILE *fp;
		86
		87	if (!(fp = fopen (filename, "r")))
		88	{
		89	if (errno == ENOENT)
		90	{
		91	LOG (llevInfo, "RESET uid to 1\n");
		92	uuid.seq = 0;
		93	write_uuid ();
		94	return;
		95	}
		96
		97	LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
		98	_exit (1);
		99	}
		100
		101	int version;
		102	unsigned long long uid;
		103	if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)
		104	{
		105	LOG (llevError, "FATAL: error reading uid from %s!\n", filename);
		106	_exit (1);
		107	}
		108
		109	uuid.seq = uid;
		110	write_uuid ();
		111	LOG (llevDebug, "read UID: %" PRId64 "\n", uid);
		112	fclose (fp);
		113	}
		114
		115	UUID
		116	gen_uuid ()
		117	{
		118	UUID uid;
		119
		120	uid.seq = ++uuid.seq;
		121
		122	if (!(uuid.seq & (UUID_SKIP - 1)))
		123	write_uuid ();
		124
		125	return uid;
		126	}
		127
		128	void
		129	init_uuid ()
		130	{
		131	read_uuid ();
		132	}
60		133
61	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */	134	/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
		135	static int
62	static int compare_ob_value_lists_one(const object * wants, const object * has) {	136	compare_ob_value_lists_one (const object *wants, const object *has)
		137	{
63	key_value * wants_field;	138	key_value *wants_field;
64		139
65	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both	140	/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
66	* objects with lists are rare, and lists stay short. If not, use a	141	* objects with lists are rare, and lists stay short. If not, use a
67	* different structure or at least keep the lists sorted...	142	* different structure or at least keep the lists sorted...
68	*/	143	*/
69		144
70	/* For each field in wants, */	145	/* For each field in wants, */
71	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next) {	146	for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)
		147	{
72	key_value * has_field;	148	key_value *has_field;
73		149
74	/* Look for a field in has with the same key. */	150	/* Look for a field in has with the same key. */
75	has_field = get_ob_key_link(has, wants_field->key);	151	has_field = get_ob_key_link (has, wants_field->key);
		152
		153	if (has_field == NULL)
76		154	{
77	if (has_field == NULL) {
78	/* No field with that name. */	155	/* No field with that name. */
79	return FALSE;	156	return FALSE;
80	}	157	}
81		158
82	/* Found the matching field. */	159	/* Found the matching field. */
83	if (has_field->value != wants_field->value) {	160	if (has_field->value != wants_field->value)
		161	{
84	/* Values don't match, so this half of the comparison is false. */	162	/* Values don't match, so this half of the comparison is false. */
85	return FALSE;	163	return FALSE;
86	}	164	}
87		165
88	/* 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. */
89	}
90		167	}
		168
91	/* 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. */
92	return TRUE;	170	return TRUE;
93	}	171	}
94		172
95	/* Returns TRUE if ob1 has the same key_values as ob2. */	173	/* Returns TRUE if ob1 has the same key_values as ob2. */
		174	static int
96	static int compare_ob_value_lists(const object * ob1, const object * ob2) {	175	compare_ob_value_lists (const object *ob1, const object *ob2)
		176	{
97	/* 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,
98	* so we need to run the comparison *twice*. :(	178	* so we need to run the comparison *twice*. :(
99	*/	179	*/
100	return compare_ob_value_lists_one(ob1, ob2) && compare_ob_value_lists_one(ob2, ob1);	180	return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);
101	}	181	}
102		182
103	/* Function examines the 2 objects given to it, and returns true if	183	/* Function examines the 2 objects given to it, and returns true if
104	* they can be merged together.	184	* they can be merged together.
105	*	185	*
106	* Note that this function appears a lot longer than the macro it	186	* Note that this function appears a lot longer than the macro it
107	* replaces - this is mostly for clarity - a decent compiler should hopefully	187	* replaces - this is mostly for clarity - a decent compiler should hopefully
108	* reduce this to the same efficiency.	188	* reduce this to the same efficiency.
109	*	189	*
110	* Check nrof variable *before* calling CAN_MERGE()	190	* Check nrof variable *before* calling can_merge()
111	*	191	*
112	* Improvements made with merge: Better checking on potion, and also	192	* Improvements made with merge: Better checking on potion, and also
113	* check weight	193	* check weight
114	*/	194	*/
115		195
116	bool
117	object::can_merge (object *ob1, object *ob2)	196	bool object::can_merge_slow (object *ob1, object *ob2)
118	{	197	{
119	/* A couple quicksanity checks */	198	/* A couple quicksanity checks */
120	if ((ob1 == ob2) || (ob1->type != ob2->type))	199	if (ob1 == ob2
		200	|| ob1->type != ob2->type
		201	|| ob1->speed != ob2->speed
		202	|| ob1->value != ob2->value
		203	|| ob1->name != ob2->name)
121	return 0;	204	return 0;
122		205
123	if (ob1->speed != ob2->speed)	206	//TODO: this ain't working well, use nicer and correct overflow check
124	return 0;
125
126	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	207	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
127	* value could not be stored in a sint32 (which unfortunately sometimes is	208	* value could not be stored in a sint32 (which unfortunately sometimes is
128	* used to store nrof).	209	* used to store nrof).
129	*/	210	*/
130	if (ob1->nrof + ob2->nrof >= 1UL << 31)	211	if (ob1->nrof + ob2->nrof >= 1UL << 31)
…		…
140	SET_FLAG (ob1, FLAG_BEEN_APPLIED);	221	SET_FLAG (ob1, FLAG_BEEN_APPLIED);
141		222
142	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))	223	if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
143	SET_FLAG (ob2, FLAG_BEEN_APPLIED);	224	SET_FLAG (ob2, FLAG_BEEN_APPLIED);
144		225
145		226	if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
146	/* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something	227	|| ob1->arch != ob2->arch
147	* being locked in inventory should prevent merging.
148	* 0x4 in flags3 is CLIENT_SENT
149	*/
150	if ((ob1->arch != ob2->arch) ||
151	(ob1->flags[0] != ob2->flags[0]) ||
152	(ob1->flags[1] != ob2->flags[1]) ||
153	((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
154	((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
155	(ob1->name != ob2->name) ||	228	|| ob1->name != ob2->name
156	(ob1->title != ob2->title) ||	229	|| ob1->title != ob2->title
157	(ob1->msg != ob2->msg) ||	230	|| ob1->msg != ob2->msg
158	(ob1->weight != ob2->weight) ||	231	|| ob1->weight != ob2->weight
159	(memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) ||	232	|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
160	(memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) ||	233	|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
161	(ob1->attacktype != ob2->attacktype) ||	234	|| ob1->attacktype != ob2->attacktype
162	(ob1->magic != ob2->magic) ||	235	|| ob1->magic != ob2->magic
163	(ob1->slaying != ob2->slaying) ||	236	|| ob1->slaying != ob2->slaying
164	(ob1->skill != ob2->skill) ||	237	|| ob1->skill != ob2->skill
165	(ob1->value != ob2->value) ||	238	|| ob1->value != ob2->value
166	(ob1->animation_id != ob2->animation_id) ||	239	|| ob1->animation_id != ob2->animation_id
167	(ob1->client_type != ob2->client_type) ||	240	|| ob1->client_type != ob2->client_type
168	(ob1->materialname != ob2->materialname) ||	241	|| ob1->materialname != ob2->materialname
169	(ob1->lore != ob2->lore) ||	242	|| ob1->lore != ob2->lore
170	(ob1->subtype != ob2->subtype) ||	243	|| ob1->subtype != ob2->subtype
171	(ob1->move_type != ob2->move_type) ||	244	|| ob1->move_type != ob2->move_type
172	(ob1->move_block != ob2->move_block) ||	245	|| ob1->move_block != ob2->move_block
173	(ob1->move_allow != ob2->move_allow) ||	246	|| ob1->move_allow != ob2->move_allow
174	(ob1->move_on != ob2->move_on) ||	247	|| ob1->move_on != ob2->move_on
175	(ob1->move_off != ob2->move_off) ||	248	|| ob1->move_off != ob2->move_off
176	(ob1->move_slow != ob2->move_slow) ||	249	|| ob1->move_slow != ob2->move_slow
177	(ob1->move_slow_penalty != ob2->move_slow_penalty))	250	|| ob1->move_slow_penalty != ob2->move_slow_penalty)
178	return 0;	251	return 0;
179		252
180	/* This is really a spellbook check - really, we should	253	/* This is really a spellbook check - really, we should
181	* check all objects in the inventory.	254	* check all objects in the inventory.
182	*/	255	*/
183	if (ob1->inv || ob2->inv)	256	if (ob1->inv || ob2->inv)
184	{	257	{
185	/* if one object has inventory but the other doesn't, not equiv */	258	/* if one object has inventory but the other doesn't, not equiv */
186	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))	259	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
187	return 0;	260	return 0;
188		261
189	/* Now check to see if the two inventory objects could merge */	262	/* Now check to see if the two inventory objects could merge */
190	if (!CAN_MERGE (ob1->inv, ob2->inv))	263	if (!object::can_merge (ob1->inv, ob2->inv))
191	return 0;	264	return 0;
192		265
193	/* inventory ok - still need to check rest of this object to see	266	/* inventory ok - still need to check rest of this object to see
194	* if it is valid.	267	* if it is valid.
195	*/	268	*/
196	}	269	}
…		…
204		277
205	/* Note sure why the following is the case - either the object has to	278	/* Note sure why the following is the case - either the object has to
206	* be animated or have a very low speed. Is this an attempted monster	279	* be animated or have a very low speed. Is this an attempted monster
207	* check?	280	* check?
208	*/	281	*/
209	if (!QUERY_FLAG (ob1, FLAG_ANIMATE)	282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)
210	&& FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)
211	return 0;	283	return 0;
212		284
213	switch (ob1->type)	285	switch (ob1->type)
214	{	286	{
215	case SCROLL:	287	case SCROLL:
216	if (ob1->level != ob2->level)	288	if (ob1->level != ob2->level)
217	return 0;	289	return 0;
218	break;	290	break;
219	}	291	}
220		292
221	if (ob1->key_values != NULL || ob2->key_values != NULL)	293	if (ob1->key_values != NULL || ob2->key_values != NULL)
222	{	294	{
223	/* At least one of these has key_values. */	295	/* At least one of these has key_values. */
224	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))	296	if ((ob1->key_values == NULL) != (ob2->key_values == NULL))
225	/* One has fields, but the other one doesn't. */	297	/* One has fields, but the other one doesn't. */
226	return 0;	298	return 0;
227	else if (!compare_ob_value_lists (ob1, ob2))	299	else if (!compare_ob_value_lists (ob1, ob2))
228	return 0;	300	return 0;
229	}	301	}
230		302
231	//TODO: generate an event or call into perl for additional checks	303	//TODO: generate an event or call into perl for additional checks
232	if (ob1->self || ob2->self)	304	if (ob1->self || ob2->self)
233	{	305	{
234	ob1->optimise ();	306	ob1->optimise ();
235	ob2->optimise ();	307	ob2->optimise ();
236		308
237	if (ob1->self || ob2->self)	309	if (ob1->self || ob2->self)
238	return 0;	310	return 0;
239	}	311	}
240		312
241	/* Everything passes, must be OK. */	313	/* Everything passes, must be OK. */
242	return 1;	314	return 1;
243	}	315	}
		316
244	/*	317	/*
245	* sum_weight() is a recursive function which calculates the weight	318	* sum_weight() is a recursive function which calculates the weight
246	* an object is carrying. It goes through in figures out how much	319	* an object is carrying. It goes through in figures out how much
247	* containers are carrying, and sums it up.	320	* containers are carrying, and sums it up.
248	*/	321	*/
249	signed long sum_weight(object *op) {	322	long
		323	sum_weight (object *op)
		324	{
250	signed long sum;	325	long sum;
251	object *inv;	326	object *inv;
		327
252	for(sum = 0, inv = op->inv; inv != NULL; inv = inv->below) {	328	for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)
		329	{
253	if (inv->inv)	330	if (inv->inv)
254	sum_weight(inv);	331	sum_weight (inv);
255	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	332	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
256	}	333	}
		334
257	if (op->type == CONTAINER && op->stats.Str)	335	if (op->type == CONTAINER && op->stats.Str)
258	sum = (sum * (100 - op->stats.Str))/100;	336	sum = (sum * (100 - op->stats.Str)) / 100;
		337
259	if(op->carrying != sum)	338	if (op->carrying != sum)
260	op->carrying = sum;	339	op->carrying = sum;
		340
261	return sum;	341	return sum;
262	}	342	}
263		343
264	/**	344	/**
265	* Return the outermost environment object for a given object.	345	* Return the outermost environment object for a given object.
266	*/	346	*/
267		347
		348	object *
268	object *object_get_env_recursive (object *op) {	349	object_get_env_recursive (object *op)
		350	{
269	while (op->env != NULL)	351	while (op->env != NULL)
270	op = op->env;	352	op = op->env;
271	return op;	353	return op;
272	}
273
274	/*
275	* Eneq(@csd.uu.se): Since we can have items buried in a character we need
276	* a better check. We basically keeping traversing up until we can't
277	* or find a player.
278	*/
279
280	object *is_player_inv (object *op) {
281	for (;op!=NULL&&op->type!=PLAYER; op=op->env)
282	if (op->env==op)
283	op->env = NULL;
284	return op;
285	}	354	}
286		355
287	/*	356	/*
288	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	357	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
289	* Some error messages.	358	* Some error messages.
290	* The result of the dump is stored in the static global errmsg array.	359	* The result of the dump is stored in the static global errmsg array.
291	*/	360	*/
292		361
293	void dump_object2(object *op) {	362	char *
294	errmsg[0] = 0;
295	return;
296	//TODO//D#d#
297	#if 0
298	char *cp;
299	/* object *tmp;*/
300
301	if(op->arch!=NULL) {
302	strcat(errmsg,"arch ");
303	strcat(errmsg,op->arch->name?op->arch->name:"(null)");
304	strcat(errmsg,"\n");
305	if((cp=get_ob_diff(op,&empty_archetype->clone))!=NULL)
306	strcat(errmsg,cp);
307	#if 0
308	/* Don't dump player diffs - they are too long, mostly meaningless, and
309	* will overflow the buffer.
310	* Changed so that we don't dump inventory either. This may
311	* also overflow the buffer.
312	*/
313	if(op->type!=PLAYER && (cp=get_ob_diff(op,&empty_archetype->clone))!=NULL)
314	strcat(errmsg,cp);
315	for (tmp=op->inv; tmp; tmp=tmp->below)
316	dump_object2(tmp);
317	#endif
318	strcat(errmsg,"end\n");
319	} else {
320	strcat(errmsg,"Object ");
321	if (op->name==NULL) strcat(errmsg, "(null)");
322	else strcat(errmsg,op->name);
323	strcat(errmsg,"\n");
324	#if 0
325	if((cp=get_ob_diff(op,&empty_archetype->clone))!=NULL)
326	strcat(errmsg,cp);
327	for (tmp=op->inv; tmp; tmp=tmp->below)
328	dump_object2(tmp);
329	#endif
330	strcat(errmsg,"end\n");
331	}
332	#endif
333	}
334
335	/*
336	* Dumps an object. Returns output in the static global errmsg array.
337	*/
338
339	void dump_object(object *op) {	363	dump_object (object *op)
340	if(op==NULL) {	364	{
341	strcpy(errmsg,"[NULL pointer]");	365	if (!op)
342	return;	366	return strdup ("[NULLOBJ]");
343	}
344	errmsg[0]='\0';
345	dump_object2(op);
346	}
347		367
348	void dump_all_objects(void) {	368	object_freezer freezer;
349	object *op;	369	save_object (freezer, op, 3);
350	for(op=objects;op!=NULL;op=op->next) {	370	return freezer.as_string ();
351	dump_object(op);
352	fprintf(logfile, "Object %d\n:%s\n", op->count, errmsg);
353	}
354	}	371	}
355		372
356	/*	373	/*
357	* get_nearest_part(multi-object, object 2) returns the part of the	374	* get_nearest_part(multi-object, object 2) returns the part of the
358	* multi-object 1 which is closest to the second object.	375	* multi-object 1 which is closest to the second object.
359	* If it's not a multi-object, it is returned.	376	* If it's not a multi-object, it is returned.
360	*/	377	*/
361		378
		379	object *
362	object *get_nearest_part(object *op, const object *pl) {	380	get_nearest_part (object *op, const object *pl)
		381	{
363	object *tmp,*closest;	382	object *tmp, *closest;
364	int last_dist,i;	383	int last_dist, i;
		384
365	if(op->more==NULL)	385	if (op->more == NULL)
366	return op;	386	return op;
367	for(last_dist=distance(op,pl),closest=op,tmp=op->more;tmp!=NULL;tmp=tmp->more)	387	for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)
368	if((i=distance(tmp,pl))<last_dist)	388	if ((i = distance (tmp, pl)) < last_dist)
369	closest=tmp,last_dist=i;	389	closest = tmp, last_dist = i;
370	return closest;	390	return closest;
371	}	391	}
372		392
373	/*	393	/*
374	* Returns the object which has the count-variable equal to the argument.	394	* Returns the object which has the count-variable equal to the argument.
375	*/	395	*/
376		396
		397	object *
377	object *find_object(tag_t i) {	398	find_object (tag_t i)
378	object *op;	399	{
379	for(op=objects;op!=NULL;op=op->next)	400	for (object *op = object::first; op; op = op->next)
380	if(op->count==i)	401	if (op->count == i)
381	break;	402	return op;
		403
382	return op;	404	return 0;
383	}	405	}
384		406
385	/*	407	/*
386	* Returns the first object which has a name equal to the argument.	408	* Returns the first object which has a name equal to the argument.
387	* Used only by the patch command, but not all that useful.	409	* Used only by the patch command, but not all that useful.
388	* Enables features like "patch <name-of-other-player> food 999"	410	* Enables features like "patch <name-of-other-player> food 999"
389	*/	411	*/
390		412
		413	object *
391	object *find_object_name(const char *str) {	414	find_object_name (const char *str)
392	const char *name = shstr::find (str);	415	{
		416	shstr_cmp str_ (str);
393	object *op;	417	object *op;
		418
394	for(op=objects;op!=NULL;op=op->next)	419	for (op = object::first; op != NULL; op = op->next)
395	if(&op->name == name)	420	if (op->name == str_)
396	break;	421	break;
397		422
398	return op;	423	return op;
399	}	424	}
400		425
		426	void
401	void free_all_object_data ()	427	free_all_object_data ()
402	{	428	{
403	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);	429	LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
404	}
405
406	/*
407	* Returns the object which this object marks as being the owner.
408	* A id-scheme is used to avoid pointing to objects which have been
409	* freed and are now reused. If this is detected, the owner is
410	* set to NULL, and NULL is returned.
411	* Changed 2004-02-12 - if the player is setting at the play again
412	* prompt, he is removed, and we don't want to treat him as an owner of
413	* anything, so check removed flag. I don't expect that this should break
414	* anything - once an object is removed, it is basically dead anyways.
415	*/
416
417	object *get_owner(object *op) {
418	if(op->owner==NULL)
419	return NULL;
420
421	if (!QUERY_FLAG(op->owner,FLAG_FREED) && !QUERY_FLAG(op->owner, FLAG_REMOVED) &&
422	op->owner->count==op->ownercount)
423	return op->owner;
424
425	op->owner=NULL;
426	op->ownercount=0;
427	return NULL;
428	}
429
430	void clear_owner(object *op)
431	{
432	if (!op) return;
433
434	if (op->owner && op->ownercount == op->owner->count)
435	op->owner->refcount--;
436
437	op->owner = NULL;
438	op->ownercount = 0;
439	}	430	}
440		431
441	/*	432	/*
442	* Sets the owner and sets the skill and exp pointers to owner's current	433	* Sets the owner and sets the skill and exp pointers to owner's current
443	* skill and experience objects.	434	* skill and experience objects.
444	*/	435	*/
445	void set_owner (object *op, object *owner)	436	void
		437	object::set_owner (object *owner)
446	{	438	{
447	if(owner==NULL||op==NULL)	439	if (!owner)
448	return;	440	return;
449		441
450	/* next line added to allow objects which own objects */	442	/* next line added to allow objects which own objects */
451	/* Add a check for ownercounts in here, as I got into an endless loop	443	/* Add a check for ownercounts in here, as I got into an endless loop
452	* with the fireball owning a poison cloud which then owned the	444	* with the fireball owning a poison cloud which then owned the
453	* fireball. I believe that was caused by one of the objects getting	445	* fireball. I believe that was caused by one of the objects getting
454	* freed and then another object replacing it. Since the ownercounts	446	* freed and then another object replacing it. Since the ownercounts
455	* didn't match, this check is valid and I believe that cause is valid.	447	* didn't match, this check is valid and I believe that cause is valid.
456	*/	448	*/
457	while (owner->owner && owner!=owner->owner &&	449	while (owner->owner)
458	owner->ownercount==owner->owner->count) owner=owner->owner;	450	owner = owner->owner;
459		451
460	/* IF the owner still has an owner, we did not resolve to a final owner.
461	* so lets not add to that.
462	*/
463	if (owner->owner) return;
464
465	op->owner=owner;	452	this->owner = owner;
466
467	op->ownercount=owner->count;
468	owner->refcount++;
469
470	}
471
472	/* Set the owner to clone's current owner and set the skill and experience
473	* objects to clone's objects (typically those objects that where the owner's
474	* current skill and experience objects at the time when clone's owner was
475	* set - not the owner's current skill and experience objects).
476	*
477	* Use this function if player created an object (e.g. fire bullet, swarm
478	* spell), and this object creates further objects whose kills should be
479	* accounted for the player's original skill, even if player has changed
480	* skills meanwhile.
481	*/
482	void copy_owner (object *op, object *clone)
483	{
484	object *owner = get_owner (clone);
485	if (owner == NULL) {
486	/* players don't have owners - they own themselves. Update
487	* as appropriate.
488	*/
489	if (clone->type == PLAYER) owner=clone;
490	else return;
491	}
492	set_owner(op, owner);
493
494	}	453	}
495		454
496	/* Zero the key_values on op, decrementing the shared-string	455	/* Zero the key_values on op, decrementing the shared-string
497	* refcounts and freeing the links.	456	* refcounts and freeing the links.
498	*/	457	*/
		458	static void
499	static void free_key_values(object * op)	459	free_key_values (object *op)
500	{	460	{
501	for (key_value *i = op->key_values; i != 0; )	461	for (key_value *i = op->key_values; i != 0;)
502	{	462	{
503	key_value *next = i->next;	463	key_value *next = i->next;
504	delete i;	464	delete i;
		465
505	i = next;	466	i = next;
506	}	467	}
507		468
508	op->key_values = 0;	469	op->key_values = 0;
509	}	470	}
510		471
511	void object::clear ()
512	{
513	attachable_base::clear ();
514
515	free_key_values (this);
516
517	name = 0;
518	name_pl = 0;
519	title = 0;
520	race = 0;
521	slaying = 0;
522	skill = 0;
523	msg = 0;
524	lore = 0;
525	custom_name = 0;
526	materialname = 0;
527
528	memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
529
530	SET_FLAG (this, FLAG_REMOVED);
531	}
532
533	void object::clone (object *destination)
534	{
535	*(object_copy *)destination = *(object_copy *)this;
536	*(object_pod *)destination = *(object_pod *)this;
537
538	if (self || cb)
539	INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
540	}
541
542	/*	472	/*
543	* clear_object() frees everything allocated by an object, and also
544	* clears all variables and flags to default settings.
545	*/
546
547	void clear_object (object *op)
548	{
549	op->clear ();
550
551	op->contr = NULL;
552	op->below = NULL;
553	op->above = NULL;
554	op->inv = NULL;
555	op->container=NULL;
556	op->env=NULL;
557	op->more=NULL;
558	op->head=NULL;
559	op->map=NULL;
560	op->refcount=0;
561	op->active_next = NULL;
562	op->active_prev = NULL;
563	/* What is not cleared is next, prev, and count */
564
565	op->expmul = 1.0;
566	op->face = blank_face;
567	op->attacked_by_count = -1;
568
569	if (settings.casting_time)
570	op->casting_time = -1;
571	}
572
573	/*
574	* copy object first frees everything allocated by the second object,	473	* copy_to first frees everything allocated by the dst object,
575	* and then copies the contends of the first object into the second	474	* and then copies the contents of itself into the second
576	* object, allocating what needs to be allocated. Basically, any	475	* object, allocating what needs to be allocated. Basically, any
577	* data that is malloc'd needs to be re-malloc/copied. Otherwise,	476	* data that is malloc'd needs to be re-malloc/copied. Otherwise,
578	* if the first object is freed, the pointers in the new object	477	* if the first object is freed, the pointers in the new object
579	* will point at garbage.	478	* will point at garbage.
580	*/	479	*/
581		480	void
582	void copy_object (object *op2, object *op)	481	object::copy_to (object *dst)
583	{	482	{
584	bool is_freed = QUERY_FLAG (op, FLAG_FREED);	483	bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
585	bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);	484	bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
586		485
587	op2->clone (op);	486	*(object_copy *)dst = *this;
588		487
589	if (is_freed) SET_FLAG (op, FLAG_FREED);	488	if (is_freed)
590	if (is_removed) SET_FLAG (op, FLAG_REMOVED);	489	SET_FLAG (dst, FLAG_FREED);
591		490
		491	if (is_removed)
		492	SET_FLAG (dst, FLAG_REMOVED);
		493
592	if (op2->speed < 0)	494	if (speed < 0)
593	op->speed_left = op2->speed_left - RANDOM() % 200 / 100.0;	495	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
594		496
595	/* Copy over key_values, if any. */	497	/* Copy over key_values, if any. */
596	if (op2->key_values != NULL)	498	if (key_values)
597	{	499	{
598	key_value *tail = NULL;	500	key_value *tail = 0;
599	key_value *i;	501	key_value *i;
600		502
601	op->key_values = NULL;	503	dst->key_values = 0;
602		504
603	for (i = op2->key_values; i != NULL; i = i->next)	505	for (i = key_values; i; i = i->next)
604	{	506	{
605	key_value *new_link = new key_value;	507	key_value *new_link = new key_value;
606		508
607	new_link->next = NULL;	509	new_link->next = 0;
608	new_link->key = i->key;	510	new_link->key = i->key;
609	new_link->value = i->value;	511	new_link->value = i->value;
610		512
611	/* Try and be clever here, too. */	513	/* Try and be clever here, too. */
612	if (op->key_values == NULL)	514	if (!dst->key_values)
613	{	515	{
614	op->key_values = new_link;	516	dst->key_values = new_link;
615	tail = new_link;	517	tail = new_link;
616	}	518	}
617	else	519	else
618	{	520	{
619	tail->next = new_link;	521	tail->next = new_link;
620	tail = new_link;	522	tail = new_link;
621	}	523	}
622	}	524	}
623	}	525	}
624		526
625	update_ob_speed (op);	527	update_ob_speed (dst);
626	}	528	}
627		529
628	/*	530	object *
629	* get_object() grabs an object from the list of unused objects, makes	531	object::clone ()
630	* sure it is initialised, and returns it.
631	* If there are no free objects, expand_objects() is called to get more.
632	*/
633
634	object *get_object ()
635	{	532	{
636	object *op = new object;	533	object *neu = create ();
637		534	copy_to (neu);
638	op->count = ++ob_count;
639
640	op->next = objects;
641
642	if (objects)
643	objects->prev = op;
644
645	objects = op;
646
647	SET_FLAG (op, FLAG_REMOVED);
648
649	op->expmul = 1.0;
650	op->face = blank_face;
651	op->attacked_by_count = -1;
652
653	return op;	535	return neu;
654	}	536	}
655		537
656	/*	538	/*
657	* If an object with the IS_TURNABLE() flag needs to be turned due	539	* If an object with the IS_TURNABLE() flag needs to be turned due
658	* to the closest player being on the other side, this function can	540	* to the closest player being on the other side, this function can
659	* be called to update the face variable, _and_ how it looks on the map.	541	* be called to update the face variable, _and_ how it looks on the map.
660	*/	542	*/
661		543
		544	void
662	void update_turn_face(object *op) {	545	update_turn_face (object *op)
		546	{
663	if(!QUERY_FLAG(op,FLAG_IS_TURNABLE)||op->arch==NULL)	547	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)
664	return;	548	return;
665	SET_ANIMATION(op, op->direction);	549	SET_ANIMATION (op, op->direction);
666	update_object(op,UP_OBJ_FACE);	550	update_object (op, UP_OBJ_FACE);
667	}	551	}
668		552
669	/*	553	/*
670	* Updates the speed of an object. If the speed changes from 0 to another	554	* Updates the speed of an object. If the speed changes from 0 to another
671	* value, or vice versa, then add/remove the object from the active list.	555	* value, or vice versa, then add/remove the object from the active list.
672	* This function needs to be called whenever the speed of an object changes.	556	* This function needs to be called whenever the speed of an object changes.
673	*/	557	*/
674		558	void
675	void update_ob_speed(object *op) {	559	update_ob_speed (object *op)
		560	{
676	extern int arch_init;	561	extern int arch_init;
677		562
678	/* No reason putting the archetypes objects on the speed list,	563	/* No reason putting the archetypes objects on the speed list,
679	* since they never really need to be updated.	564	* since they never really need to be updated.
680	*/	565	*/
681		566
682	if (QUERY_FLAG(op, FLAG_FREED) && op->speed) {	567	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
		568	{
683	LOG(llevError,"Object %s is freed but has speed.\n", &op->name);	569	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);
684	#ifdef MANY_CORES	570	#ifdef MANY_CORES
685	abort();	571	abort ();
686	#else	572	#else
687	op->speed = 0;	573	op->speed = 0;
688	#endif	574	#endif
689	}	575	}
		576
690	if (arch_init) {	577	if (arch_init)
		578	return;
		579
		580	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
		581	{
		582	/* If already on active list, don't do anything */
		583	if (op->active_next || op->active_prev || op == active_objects)
691	return;	584	return;
692	}
693	if (FABS(op->speed)>MIN_ACTIVE_SPEED) {
694	/* If already on active list, don't do anything */
695	if (op->active_next || op->active_prev || op==active_objects)
696	return;
697		585
698	/* process_events() expects us to insert the object at the beginning	586	/* process_events() expects us to insert the object at the beginning
699	* of the list. */	587	* of the list. */
700	op->active_next = active_objects;	588	op->active_next = active_objects;
		589
701	if (op->active_next!=NULL)	590	if (op->active_next != NULL)
702	op->active_next->active_prev = op;	591	op->active_next->active_prev = op;
		592
703	active_objects = op;	593	active_objects = op;
		594	}
		595	else
704	}	596	{
705	else {
706	/* If not on the active list, nothing needs to be done */	597	/* If not on the active list, nothing needs to be done */
707	if (!op->active_next && !op->active_prev && op!=active_objects)	598	if (!op->active_next && !op->active_prev && op != active_objects)
708	return;	599	return;
709		600
710	if (op->active_prev==NULL) {	601	if (op->active_prev == NULL)
		602	{
711	active_objects = op->active_next;	603	active_objects = op->active_next;
		604
712	if (op->active_next!=NULL)	605	if (op->active_next != NULL)
713	op->active_next->active_prev = NULL;	606	op->active_next->active_prev = NULL;
714	}	607	}
715	else {	608	else
		609	{
716	op->active_prev->active_next = op->active_next;	610	op->active_prev->active_next = op->active_next;
		611
717	if (op->active_next)	612	if (op->active_next)
718	op->active_next->active_prev = op->active_prev;	613	op->active_next->active_prev = op->active_prev;
719	}	614	}
		615
720	op->active_next = NULL;	616	op->active_next = NULL;
721	op->active_prev = NULL;	617	op->active_prev = NULL;
722	}	618	}
723	}	619	}
724		620
725	/* This function removes object 'op' from the list of active	621	/* This function removes object 'op' from the list of active
726	* objects.	622	* objects.
…		…
728	* reference maps where you don't want an object that isn't	624	* reference maps where you don't want an object that isn't
729	* in play chewing up cpu time getting processed.	625	* in play chewing up cpu time getting processed.
730	* The reverse of this is to call update_ob_speed, which	626	* The reverse of this is to call update_ob_speed, which
731	* will do the right thing based on the speed of the object.	627	* will do the right thing based on the speed of the object.
732	*/	628	*/
		629	void
733	void remove_from_active_list(object *op)	630	remove_from_active_list (object *op)
734	{	631	{
735	/* If not on the active list, nothing needs to be done */	632	/* If not on the active list, nothing needs to be done */
736	if (!op->active_next && !op->active_prev && op!=active_objects)	633	if (!op->active_next && !op->active_prev && op != active_objects)
737	return;	634	return;
738		635
739	if (op->active_prev==NULL) {	636	if (op->active_prev == NULL)
		637	{
740	active_objects = op->active_next;	638	active_objects = op->active_next;
741	if (op->active_next!=NULL)	639	if (op->active_next != NULL)
742	op->active_next->active_prev = NULL;	640	op->active_next->active_prev = NULL;
		641	}
		642	else
743	}	643	{
744	else {
745	op->active_prev->active_next = op->active_next;	644	op->active_prev->active_next = op->active_next;
746	if (op->active_next)	645	if (op->active_next)
747	op->active_next->active_prev = op->active_prev;	646	op->active_next->active_prev = op->active_prev;
748	}	647	}
749	op->active_next = NULL;	648	op->active_next = NULL;
750	op->active_prev = NULL;	649	op->active_prev = NULL;
751	}	650	}
752		651
753	/*	652	/*
754	* update_object() updates the array which represents the map.	653	* update_object() updates the the map.
755	* It takes into account invisible objects (and represent squares covered	654	* It takes into account invisible objects (and represent squares covered
756	* by invisible objects by whatever is below them (unless it's another	655	* by invisible objects by whatever is below them (unless it's another
757	* invisible object, etc...)	656	* invisible object, etc...)
758	* If the object being updated is beneath a player, the look-window	657	* If the object being updated is beneath a player, the look-window
759	* of that player is updated (this might be a suboptimal way of	658	* of that player is updated (this might be a suboptimal way of
760	* updating that window, though, since update_object() is called _often_)	659	* updating that window, though, since update_object() is called _often_)
761	*	660	*
762	* action is a hint of what the caller believes need to be done.	661	* action is a hint of what the caller believes need to be done.
763	* For example, if the only thing that has changed is the face (due to
764	* an animation), we don't need to call update_position until that actually
765	* comes into view of a player. OTOH, many other things, like addition/removal
766	* of walls or living creatures may need us to update the flags now.
767	* current action are:	662	* current action are:
768	* UP_OBJ_INSERT: op was inserted	663	* UP_OBJ_INSERT: op was inserted
769	* UP_OBJ_REMOVE: op was removed	664	* UP_OBJ_REMOVE: op was removed
770	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update	665	* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
771	* as that is easier than trying to look at what may have changed.	666	* as that is easier than trying to look at what may have changed.
772	* UP_OBJ_FACE: only the objects face has changed.	667	* UP_OBJ_FACE: only the objects face has changed.
773	*/	668	*/
774		669	void
775	void update_object(object *op, int action) {	670	update_object (object *op, int action)
776	int update_now=0, flags;	671	{
777	MoveType move_on, move_off, move_block, move_slow;	672	MoveType move_on, move_off, move_block, move_slow;
778		673
779	if (op == NULL) {	674	if (op == NULL)
		675	{
780	/* this should never happen */	676	/* this should never happen */
781	LOG(llevDebug,"update_object() called for NULL object.\n");	677	LOG (llevDebug, "update_object() called for NULL object.\n");
782	return;	678	return;
783	}
784		679	}
785	if(op->env!=NULL) {	680
		681	if (op->env)
		682	{
786	/* Animation is currently handled by client, so nothing	683	/* Animation is currently handled by client, so nothing
787	* to do in this case.	684	* to do in this case.
788	*/	685	*/
789	return;	686	return;
790	}	687	}
791		688
792	/* If the map is saving, don't do anything as everything is	689	/* If the map is saving, don't do anything as everything is
793	* going to get freed anyways.	690	* going to get freed anyways.
794	*/	691	*/
795	if (!op->map || op->map->in_memory == MAP_SAVING) return;	692	if (!op->map || op->map->in_memory == MAP_SAVING)
796		693	return;
		694
797	/* make sure the object is within map boundaries */	695	/* make sure the object is within map boundaries */
798	if (op->x < 0 || op->x >= MAP_WIDTH(op->map) ||	696	if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))
799	op->y < 0 || op->y >= MAP_HEIGHT(op->map)) {	697	{
800	LOG(llevError,"update_object() called for object out of map!\n");	698	LOG (llevError, "update_object() called for object out of map!\n");
801	#ifdef MANY_CORES	699	#ifdef MANY_CORES
802	abort();	700	abort ();
803	#endif	701	#endif
804	return;	702	return;
805	}
806		703	}
807	flags = GET_MAP_FLAGS(op->map, op->x, op->y);
808	SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NEED_UPDATE);
809	move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y);
810	move_on = GET_MAP_MOVE_ON(op->map, op->x, op->y);
811	move_block = GET_MAP_MOVE_BLOCK(op->map, op->x, op->y);
812	move_off = GET_MAP_MOVE_OFF(op->map, op->x, op->y);
813		704
		705	mapspace &m = op->ms ();
		706
		707	if (m.flags_ & P_NEED_UPDATE)
		708	/* nop */;
814	if (action == UP_OBJ_INSERT) {	709	else if (action == UP_OBJ_INSERT)
		710	{
		711	// this is likely overkill, TODO: revisit (schmorp)
815	if (QUERY_FLAG(op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))	712	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
816	update_now=1;
817
818	if (QUERY_FLAG(op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))	713	|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
819	update_now=1;	714	|| (op->type == PLAYER && !(m.flags_ & P_PLAYER))
820		715	|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
		716	|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
821	if (QUERY_FLAG(op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))	717	|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
822	update_now=1;	718	|| (m.move_on | op->move_on ) != m.move_on
823
824	if (QUERY_FLAG(op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
825	update_now=1;
826
827	if ((move_on | op->move_on) != move_on) update_now=1;
828	if ((move_off | op->move_off) != move_off) update_now=1;	719	|| (m.move_off | op->move_off ) != m.move_off
		720	|| (m.move_slow | op->move_slow) != m.move_slow
829	/* This isn't perfect, but I don't expect a lot of objects to	721	/* This isn't perfect, but I don't expect a lot of objects to
830	* to have move_allow right now.	722	* to have move_allow right now.
831	*/	723	*/
832	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	724	|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
833	update_now=1;	725	|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
834	if ((move_slow | op->move_slow) != move_slow) update_now=1;	726	m.flags_ = P_NEED_UPDATE;
835	}	727	}
836	/* if the object is being removed, we can't make intelligent	728	/* if the object is being removed, we can't make intelligent
837	* decisions, because remove_ob can't really pass the object	729	* decisions, because remove_ob can't really pass the object
838	* that is being removed.	730	* that is being removed.
839	*/	731	*/
840	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) {	732	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
841	update_now=1;	733	m.flags_ = P_NEED_UPDATE;
842	} else if (action == UP_OBJ_FACE) {	734	else if (action == UP_OBJ_FACE)
843	/* Nothing to do for that case */	735	/* Nothing to do for that case */ ;
844	}
845	else {	736	else
846	LOG(llevError,"update_object called with invalid action: %d\n", action);	737	LOG (llevError, "update_object called with invalid action: %d\n", action);
847	}
848		738
849	if (update_now) {
850	SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
851	update_position(op->map, op->x, op->y);
852	}
853
854	if(op->more!=NULL)	739	if (op->more)
855	update_object(op->more, action);	740	update_object (op->more, action);
856	}	741	}
857		742
		743	object::vector object::objects; // not yet used
		744	object *object::first;
		745
		746	object::object ()
		747	{
		748	SET_FLAG (this, FLAG_REMOVED);
		749
		750	expmul = 1.0;
		751	face = blank_face;
		752	}
		753
		754	object::~object ()
		755	{
		756	free_key_values (this);
		757	}
		758
		759	void object::link ()
		760	{
		761	count = ++ob_count;
		762	uuid = gen_uuid ();
		763
		764	prev = 0;
		765	next = object::first;
		766
		767	if (object::first)
		768	object::first->prev = this;
		769
		770	object::first = this;
		771	}
		772
		773	void object::unlink ()
		774	{
		775	if (this == object::first)
		776	object::first = next;
		777
		778	/* Remove this object from the list of used objects */
		779	if (prev) prev->next = next;
		780	if (next) next->prev = prev;
		781
		782	prev = 0;
		783	next = 0;
		784	}
		785
		786	object *object::create ()
		787	{
		788	object *op = new object;
		789	op->link ();
		790	return op;
		791	}
858		792
859	/*	793	/*
860	* free_object() frees everything allocated by an object, removes	794	* free_object() frees everything allocated by an object, removes
861	* it from the list of used objects, and puts it on the list of	795	* it from the list of used objects, and puts it on the list of
862	* free objects. The IS_FREED() flag is set in the object.	796	* free objects. The IS_FREED() flag is set in the object.
863	* The object must have been removed by remove_ob() first for	797	* The object must have been removed by remove_ob() first for
864	* this function to succeed.	798	* this function to succeed.
865	*	799	*
866	* If free_inventory is set, free inventory as well. Else drop items in	800	* If destroy_inventory is set, free inventory as well. Else drop items in
867	* inventory to the ground.	801	* inventory to the ground.
868	*/	802	*/
869
870	void	803	void
871	free_object (object * ob)	804	object::do_destroy ()
872	{	805	{
873	free_object2 (ob, 0);	806	attachable::do_destroy ();
874	}
875		807
		808	if (flag [FLAG_IS_LINKED])
		809	remove_button_link (this);
		810
		811	if (flag [FLAG_FRIENDLY])
		812	remove_friendly_object (this);
		813
		814	if (!flag [FLAG_REMOVED])
		815	remove ();
		816
		817	if (flag [FLAG_FREED])
		818	return;
		819
		820	flag [FLAG_FREED] = 1;
		821
		822	// hack to ensure that freed objects still have a valid map
		823	{
		824	static maptile *freed_map; // freed objects are moved here to avoid crashes
		825
		826	if (!freed_map)
		827	{
		828	freed_map = new maptile;
		829
		830	freed_map->name = "/internal/freed_objects_map";
		831	freed_map->width = 3;
		832	freed_map->height = 3;
		833
		834	freed_map->allocate ();
		835	}
		836
		837	map = freed_map;
		838	x = 1;
		839	y = 1;
		840	}
		841
		842	more = 0;
		843	head = 0;
		844	inv = 0;
		845
		846	// clear those pointers that likely might have circular references to us
		847	owner = 0;
		848	enemy = 0;
		849	attacked_by = 0;
		850
		851	// only relevant for players(?), but make sure of it anyways
		852	contr = 0;
		853
		854	/* Remove object from the active list */
		855	speed = 0;
		856	update_ob_speed (this);
		857
		858	unlink ();
		859	}
		860
		861	/*
		862	* Remove and free all objects in the inventory of the given object.
		863	* object.c ?
		864	*/
876	void	865	void
877	free_object2 (object * ob, int free_inventory)	866	object::destroy_inv (bool drop_to_ground)
878	{	867	{
879	object *tmp, *op;	868	if (!inv)
880
881	if (!QUERY_FLAG (ob, FLAG_REMOVED))
882	{
883	LOG (llevDebug, "Free object called with non removed object\n");
884	dump_object (ob);
885	#ifdef MANY_CORES
886	abort ();
887	#endif
888	}
889
890	if (QUERY_FLAG (ob, FLAG_FRIENDLY))
891	{
892	LOG (llevMonster, "Warning: tried to free friendly object.\n");
893	remove_friendly_object (ob);
894	}
895
896	if (QUERY_FLAG (ob, FLAG_FREED))
897	{
898	dump_object (ob);
899	LOG (llevError, "Trying to free freed object.\n%s\n", errmsg);
900	return;	869	return;
901	}
902		870
903	if (ob->more != NULL)
904	{
905	free_object2 (ob->more, free_inventory);
906	ob->more = NULL;
907	}
908
909	if (ob->inv)
910	{
911	/* Only if the space blocks everything do we not process -	871	/* Only if the space blocks everything do we not process -
912	* if some form of movement is allowed, let objects	872	* if some form of movement is allowed, let objects
913	* drop on that space.	873	* drop on that space.
914	*/	874	*/
915	if (free_inventory || ob->map == NULL	875	if (!drop_to_ground || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
916	|| ob->map->in_memory != MAP_IN_MEMORY
917	|| (GET_MAP_MOVE_BLOCK (ob->map, ob->x, ob->y) == MOVE_ALL))
918	{
919	op = ob->inv;
920
921	while (op != NULL)
922	{	876	{
923	tmp = op->below;	877	while (inv)
924	remove_ob (op);	878	{
925	free_object2 (op, free_inventory);	879	inv->destroy_inv (drop_to_ground);
926	op = tmp;	880	inv->destroy ();
927	}	881	}
928	}
929	else
930	{ /* Put objects in inventory onto this space */
931	op = ob->inv;
932
933	while (op != NULL)
934	{
935	tmp = op->below;
936	remove_ob (op);
937
938	if (QUERY_FLAG (op, FLAG_STARTEQUIP)
939	|| QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE
940	|| op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
941	free_object (op);
942	else
943	{
944	op->x = ob->x;
945	op->y = ob->y;
946	insert_ob_in_map (op, ob->map, NULL, 0); /* Insert in same map as the envir */
947	}
948
949	op = tmp;
950	}
951	}
952	}
953
954	/* Remove object from the active list */
955	ob->speed = 0;
956	update_ob_speed (ob);
957
958	SET_FLAG (ob, FLAG_FREED);
959	ob->count = 0;
960
961	/* Remove this object from the list of used objects */
962	if (ob->prev == NULL)
963	{
964	objects = ob->next;
965
966	if (objects != NULL)
967	objects->prev = NULL;
968	}	882	}
969	else	883	else
		884	{ /* Put objects in inventory onto this space */
		885	while (inv)
		886	{
		887	object *op = inv;
		888
		889	if (op->flag [FLAG_STARTEQUIP]
		890	|| op->flag [FLAG_NO_DROP]
		891	|| op->type == RUNE
		892	|| op->type == TRAP
		893	|| op->flag [FLAG_IS_A_TEMPLATE])
		894	op->destroy ();
		895	else
		896	{
		897	op->remove ();
		898	op->x = x;
		899	op->y = y;
		900	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
		901	}
		902	}
970	{	903	}
971	ob->prev->next = ob->next;	904	}
972		905
973	if (ob->next != NULL)	906	void
974	ob->next->prev = ob->prev;	907	object::destroy (bool destroy_inventory)
		908	{
		909	if (destroyed ())
		910	return;
		911
		912	if (more)
975	}	913	{
		914	//TODO: non-head objects must not have inventory
		915	more->destroy (destroy_inventory);
		916	more = 0;
		917	}
976		918
977	free_key_values (ob);	919	if (destroy_inventory)
		920	destroy_inv (true);
978		921
979	/* Now link it with the free_objects list: */	922	attachable::destroy ();
980	ob->prev = 0;
981	ob->next = 0;
982
983	delete ob;
984	}	923	}
985		924
986	/*	925	/*
987	* sub_weight() recursively (outwards) subtracts a number from the	926	* sub_weight() recursively (outwards) subtracts a number from the
988	* weight of an object (and what is carried by it's environment(s)).	927	* weight of an object (and what is carried by it's environment(s)).
989	*/	928	*/
990		929	void
991	void sub_weight (object *op, signed long weight) {	930	sub_weight (object *op, signed long weight)
		931	{
992	while (op != NULL) {	932	while (op != NULL)
		933	{
993	if (op->type == CONTAINER) {	934	if (op->type == CONTAINER)
994	weight=(signed long)(weight*(100-op->stats.Str)/100);	935	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
995	}	936
996	op->carrying-=weight;	937	op->carrying -= weight;
997	op = op->env;	938	op = op->env;
998	}	939	}
999	}	940	}
1000		941
1001	/* remove_ob(op):	942	/* op->remove ():
1002	* This function removes the object op from the linked list of objects	943	* This function removes the object op from the linked list of objects
1003	* which it is currently tied to. When this function is done, the	944	* which it is currently tied to. When this function is done, the
1004	* object will have no environment. If the object previously had an	945	* object will have no environment. If the object previously had an
1005	* environment, the x and y coordinates will be updated to	946	* environment, the x and y coordinates will be updated to
1006	* the previous environment.	947	* the previous environment.
1007	* Beware: This function is called from the editor as well!	948	* Beware: This function is called from the editor as well!
1008	*/	949	*/
1009		950	void
1010	void remove_ob(object *op) {	951	object::remove ()
		952	{
1011	object *tmp,*last=NULL;	953	object *tmp, *last = 0;
1012	object *otmp;	954	object *otmp;
1013	tag_t tag;
1014	int check_walk_off;
1015	mapstruct *m;
1016	sint16 x,y;
1017
1018		955
1019	if(QUERY_FLAG(op,FLAG_REMOVED)) {	956	if (QUERY_FLAG (this, FLAG_REMOVED))
1020	dump_object(op);	957	return;
1021	LOG(llevError,"Trying to remove removed object.\n%s\n",errmsg);
1022		958
1023	/* Changed it to always dump core in this case. As has been learned
1024	* in the past, trying to recover from errors almost always
1025	* make things worse, and this is a real error here - something
1026	* that should not happen.
1027	* Yes, if this was a mission critical app, trying to do something
1028	* to recover may make sense, but that is because failure of the app
1029	* may have other disastrous problems. Cf runs out of a script
1030	* so is easily enough restarted without any real problems.
1031	* MSW 2001-07-01
1032	*/
1033	abort();
1034	}
1035	if(op->more!=NULL)
1036	remove_ob(op->more);
1037
1038	SET_FLAG(op, FLAG_REMOVED);	959	SET_FLAG (this, FLAG_REMOVED);
		960	INVOKE_OBJECT (REMOVE, this);
1039		961
		962	if (more)
		963	more->remove ();
		964
1040	/*	965	/*
1041	* In this case, the object to be removed is in someones	966	* In this case, the object to be removed is in someones
1042	* inventory.	967	* inventory.
1043	*/	968	*/
1044	if(op->env!=NULL) {	969	if (env)
		970	{
1045	if(op->nrof)	971	if (nrof)
1046	sub_weight(op->env, op->weight*op->nrof);	972	sub_weight (env, weight * nrof);
1047	else	973	else
1048	sub_weight(op->env, op->weight+op->carrying);	974	sub_weight (env, weight + carrying);
1049		975
1050	/* NO_FIX_PLAYER is set when a great many changes are being	976	/* NO_FIX_PLAYER is set when a great many changes are being
1051	* made to players inventory. If set, avoiding the call	977	* made to players inventory. If set, avoiding the call
1052	* to save cpu time.	978	* to save cpu time.
1053	*/	979	*/
1054	if ((otmp=is_player_inv(op->env))!=NULL && otmp->contr &&	980	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1055	!QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER))	981	otmp->update_stats ();
1056	fix_player(otmp);
1057		982
1058	if(op->above!=NULL)	983	if (above != NULL)
1059	op->above->below=op->below;	984	above->below = below;
1060	else	985	else
1061	op->env->inv=op->below;	986	env->inv = below;
1062		987
1063	if(op->below!=NULL)	988	if (below != NULL)
1064	op->below->above=op->above;	989	below->above = above;
1065		990
1066	/* we set up values so that it could be inserted into	991	/* we set up values so that it could be inserted into
1067	* the map, but we don't actually do that - it is up	992	* the map, but we don't actually do that - it is up
1068	* to the caller to decide what we want to do.	993	* to the caller to decide what we want to do.
		994	*/
		995	x = env->x, y = env->y;
		996	map = env->map;
		997	above = 0, below = 0;
		998	env = 0;
		999	}
		1000	else if (map)
		1001	{
		1002	/* Re did the following section of code - it looks like it had
		1003	* lots of logic for things we no longer care about
		1004	*/
		1005
		1006	/* link the object above us */
		1007	if (above)
		1008	above->below = below;
		1009	else
		1010	map->at (x, y).top = below; /* we were top, set new top */
		1011
		1012	/* Relink the object below us, if there is one */
		1013	if (below)
		1014	below->above = above;
		1015	else
		1016	{
		1017	/* Nothing below, which means we need to relink map object for this space
		1018	* use translated coordinates in case some oddness with map tiling is
		1019	* evident
1069	*/	1020	*/
1070	op->x=op->env->x,op->y=op->env->y;	1021	if (GET_MAP_OB (map, x, y) != this)
1071	op->map=op->env->map;	1022	{
1072	op->above=NULL,op->below=NULL;	1023	char *dump = dump_object (this);
1073	op->env=NULL;	1024	LOG (llevError,
		1025	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);
		1026	free (dump);
		1027	dump = dump_object (GET_MAP_OB (map, x, y));
		1028	LOG (llevError, "%s\n", dump);
		1029	free (dump);
		1030	}
		1031
		1032	map->at (x, y).bottom = above; /* goes on above it. */
		1033	}
		1034
		1035	above = 0;
		1036	below = 0;
		1037
		1038	if (map->in_memory == MAP_SAVING)
1074	return;	1039	return;
1075	}
1076		1040
1077	/* If we get here, we are removing it from a map */	1041	int check_walk_off = !flag [FLAG_NO_APPLY];
1078	if (op->map == NULL) return;
1079		1042
1080	x = op->x;	1043	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)
1081	y = op->y;	1044	{
1082	m = get_map_from_coord(op->map, &x, &y);	1045	/* No point updating the players look faces if he is the object
1083		1046	* being removed.
1084	if (!m) {
1085	LOG(llevError,"remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1086	op->map->path, op->x, op->y);
1087	/* in old days, we used to set x and y to 0 and continue.
1088	* it seems if we get into this case, something is probablye
1089	* screwed up and should be fixed.
1090	*/	1047	*/
1091	abort();
1092	}
1093	if (op->map != m) {
1094	LOG(llevDebug,"remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1095	op->map->path, m->path, op->x, op->y, x, y);
1096	}
1097		1048
1098	/* Re did the following section of code - it looks like it had	1049	if (tmp->type == PLAYER && tmp != this)
1099	* lots of logic for things we no longer care about	1050	{
1100	*/	1051	/* If a container that the player is currently using somehow gets
1101		1052	* removed (most likely destroyed), update the player view
1102	/* link the object above us */	1053	* appropriately.
1103	if (op->above)
1104	op->above->below=op->below;
1105	else
1106	SET_MAP_TOP(m,x,y,op->below); /* we were top, set new top */
1107
1108	/* Relink the object below us, if there is one */
1109	if(op->below) {
1110	op->below->above=op->above;
1111	} else {
1112	/* Nothing below, which means we need to relink map object for this space
1113	* use translated coordinates in case some oddness with map tiling is
1114	* evident
1115	*/	1054	*/
1116	if(GET_MAP_OB(m,x,y)!=op) {	1055	if (tmp->container == this)
1117	dump_object(op);	1056	{
1118	LOG(llevError,"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg);	1057	flag [FLAG_APPLIED] = 0;
1119	dump_object(GET_MAP_OB(m,x,y));	1058	tmp->container = 0;
1120	LOG(llevError,"%s\n",errmsg);	1059	}
		1060
		1061	if (tmp->contr->ns)
		1062	tmp->contr->ns->floorbox_update ();
		1063	}
		1064
		1065	/* See if player moving off should effect something */
		1066	if (check_walk_off
		1067	&& ((move_type & tmp->move_off)
		1068	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
		1069	{
		1070	move_apply (tmp, this, 0);
		1071
		1072	if (destroyed ())
		1073	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
		1074	}
		1075
		1076	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
		1077
		1078	if (tmp->above == tmp)
		1079	tmp->above = 0;
		1080
		1081	last = tmp;
1121	}	1082	}
1122	SET_MAP_OB(m,x,y,op->above); /* goes on above it. */
1123	}
1124	op->above=NULL;
1125	op->below=NULL;
1126		1083
1127	if (op->map->in_memory == MAP_SAVING)
1128	return;
1129
1130	tag = op->count;
1131	check_walk_off = ! QUERY_FLAG (op, FLAG_NO_APPLY);
1132	for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above) {
1133	/* No point updating the players look faces if he is the object
1134	* being removed.
1135	*/
1136
1137	if(tmp->type==PLAYER && tmp!=op) {
1138	/* If a container that the player is currently using somehow gets
1139	* removed (most likely destroyed), update the player view
1140	* appropriately.
1141	*/
1142	if (tmp->container==op) {
1143	CLEAR_FLAG(op, FLAG_APPLIED);
1144	tmp->container=NULL;
1145	}
1146	tmp->contr->socket.update_look=1;
1147	}
1148	/* See if player moving off should effect something */
1149	if (check_walk_off && ((op->move_type & tmp->move_off) &&
1150	(op->move_type & ~tmp->move_off & ~tmp->move_block)==0)) {
1151
1152	move_apply(tmp, op, NULL);
1153	if (was_destroyed (op, tag)) {
1154	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed "
1155	"leaving object\n", &tmp->name, &tmp->arch->name);
1156	}
1157	}
1158
1159	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1160
1161	if(tmp->above == tmp)
1162	tmp->above = NULL;
1163	last=tmp;
1164	}
1165	/* last == NULL of there are no objects on this space */	1084	/* last == NULL of there are no objects on this space */
1166	if (last==NULL) {	1085	if (!last)
1167	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,	1086	map->at (x, y).flags_ = P_NEED_UPDATE;
1168	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1169	* those out anyways, and if there are any flags set right now, they won't
1170	* be correct anyways.
1171	*/
1172	SET_MAP_FLAGS(op->map, op->x, op->y, P_NEED_UPDATE);
1173	update_position(op->map, op->x, op->y);
1174	}
1175	else	1087	else
1176	update_object(last, UP_OBJ_REMOVE);	1088	update_object (last, UP_OBJ_REMOVE);
1177		1089
1178	if(QUERY_FLAG(op,FLAG_BLOCKSVIEW)|| (op->glow_radius != 0))	1090	if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1179	update_all_los(op->map, op->x, op->y);	1091	update_all_los (map, x, y);
1180		1092	}
1181	}	1093	}
1182		1094
1183	/*	1095	/*
1184	* merge_ob(op,top):	1096	* merge_ob(op,top):
1185	*	1097	*
1186	* This function goes through all objects below and including top, and	1098	* This function goes through all objects below and including top, and
1187	* merges op to the first matching object.	1099	* merges op to the first matching object.
1188	* If top is NULL, it is calculated.	1100	* If top is NULL, it is calculated.
1189	* Returns pointer to object if it succeded in the merge, otherwise NULL	1101	* Returns pointer to object if it succeded in the merge, otherwise NULL
1190	*/	1102	*/
1191		1103	object *
1192	object *merge_ob(object *op, object *top) {	1104	merge_ob (object *op, object *top)
		1105	{
1193	if(!op->nrof)	1106	if (!op->nrof)
1194	return 0;	1107	return 0;
1195	if(top==NULL)	1108
		1109	if (top)
1196	for(top=op;top!=NULL&&top->above!=NULL;top=top->above);	1110	for (top = op; top && top->above; top = top->above)
		1111	;
		1112
1197	for(;top!=NULL;top=top->below) {	1113	for (; top; top = top->below)
		1114	{
1198	if(top==op)	1115	if (top == op)
1199	continue;	1116	continue;
1200	if (CAN_MERGE(op,top))	1117
1201	{	1118	if (object::can_merge (op, top))
		1119	{
1202	top->nrof+=op->nrof;	1120	top->nrof += op->nrof;
		1121
1203	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/	1122	/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1204	op->weight = 0; /* Don't want any adjustements now */	1123	op->weight = 0; /* Don't want any adjustements now */
1205	remove_ob(op);	1124	op->destroy ();
1206	free_object(op);
1207	return top;	1125	return top;
1208	}	1126	}
1209	}	1127	}
		1128
1210	return NULL;	1129	return 0;
1211	}	1130	}
1212		1131
1213	/*	1132	/*
1214	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1133	* same as insert_ob_in_map except it handle separate coordinates and do a clean
1215	* job preparing multi-part monsters	1134	* job preparing multi-part monsters
1216	*/	1135	*/
		1136	object *
1217	object *insert_ob_in_map_at(object *op, mapstruct *m, object *originator, int flag, int x, int y){	1137	insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
		1138	{
1218	object* tmp;	1139	object *tmp;
		1140
1219	if (op->head)	1141	if (op->head)
1220	op=op->head;	1142	op = op->head;
		1143
1221	for (tmp=op;tmp;tmp=tmp->more){	1144	for (tmp = op; tmp; tmp = tmp->more)
		1145	{
1222	tmp->x=x+tmp->arch->clone.x;	1146	tmp->x = x + tmp->arch->clone.x;
1223	tmp->y=y+tmp->arch->clone.y;	1147	tmp->y = y + tmp->arch->clone.y;
1224	}	1148	}
		1149
1225	return insert_ob_in_map (op, m, originator, flag);	1150	return insert_ob_in_map (op, m, originator, flag);
1226	}	1151	}
1227		1152
1228	/*	1153	/*
1229	* insert_ob_in_map (op, map, originator, flag):	1154	* insert_ob_in_map (op, map, originator, flag):
1230	* This function inserts the object in the two-way linked list	1155	* This function inserts the object in the two-way linked list
…		…
1243	* Return value:	1168	* Return value:
1244	* new object if 'op' was merged with other object	1169	* new object if 'op' was merged with other object
1245	* NULL if 'op' was destroyed	1170	* NULL if 'op' was destroyed
1246	* just 'op' otherwise	1171	* just 'op' otherwise
1247	*/	1172	*/
1248		1173	object *
1249	object *insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag)	1174	insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1250	{	1175	{
1251	object *tmp, *top, *floor=NULL;	1176	object *tmp, *top, *floor = NULL;
1252	sint16 x,y;	1177	sint16 x, y;
1253		1178
1254	if (QUERY_FLAG (op, FLAG_FREED)) {	1179	if (QUERY_FLAG (op, FLAG_FREED))
		1180	{
1255	LOG (llevError, "Trying to insert freed object!\n");	1181	LOG (llevError, "Trying to insert freed object!\n");
1256	return NULL;	1182	return NULL;
		1183	}
		1184
		1185	if (m == NULL)
1257	}	1186	{
1258	if(m==NULL) {
1259	dump_object(op);	1187	char *dump = dump_object (op);
1260	LOG(llevError,"Trying to insert in null-map!\n%s\n",errmsg);	1188	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
		1189	free (dump);
1261	return op;	1190	return op;
1262	}	1191	}
		1192
1263	if(out_of_map(m,op->x,op->y)) {	1193	if (out_of_map (m, op->x, op->y))
		1194	{
1264	dump_object(op);	1195	char *dump = dump_object (op);
1265	LOG(llevError,"Trying to insert object outside the map.\n%s\n", errmsg);	1196	LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1266	#ifdef MANY_CORES	1197	#ifdef MANY_CORES
1267	/* Better to catch this here, as otherwise the next use of this object	1198	/* Better to catch this here, as otherwise the next use of this object
1268	* is likely to cause a crash. Better to find out where it is getting	1199	* is likely to cause a crash. Better to find out where it is getting
1269	* improperly inserted.	1200	* improperly inserted.
1270	*/	1201	*/
1271	abort();	1202	abort ();
1272	#endif	1203	#endif
		1204	free (dump);
1273	return op;	1205	return op;
1274	}	1206	}
		1207
1275	if(!QUERY_FLAG(op,FLAG_REMOVED)) {	1208	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1209	{
1276	dump_object(op);	1210	char *dump = dump_object (op);
1277	LOG(llevError,"Trying to insert (map) inserted object.\n%s\n", errmsg);	1211	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
		1212	free (dump);
1278	return op;	1213	return op;
		1214	}
		1215
		1216	if (op->more)
1279	}	1217	{
1280	if(op->more!=NULL) {
1281	/* The part may be on a different map. */	1218	/* The part may be on a different map. */
1282		1219
1283	object *more = op->more;	1220	object *more = op->more;
1284		1221
1285	/* We really need the caller to normalize coordinates - if	1222	/* We really need the caller to normalize coordinates - if
1286	* we set the map, that doesn't work if the location is within	1223	* we set the map, that doesn't work if the location is within
1287	* a map and this is straddling an edge. So only if coordinate	1224	* a map and this is straddling an edge. So only if coordinate
1288	* is clear wrong do we normalize it.	1225	* is clear wrong do we normalize it.
1289	*/	1226	*/
1290	if (OUT_OF_REAL_MAP(more->map, more->x, more->y)) {	1227	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1291	more->map = get_map_from_coord(m, &more->x, &more->y);	1228	more->map = get_map_from_coord (m, &more->x, &more->y);
1292	} else if (!more->map) {	1229	else if (!more->map)
		1230	{
1293	/* For backwards compatibility - when not dealing with tiled maps,	1231	/* For backwards compatibility - when not dealing with tiled maps,
1294	* more->map should always point to the parent.	1232	* more->map should always point to the parent.
1295	*/	1233	*/
1296	more->map = m;	1234	more->map = m;
1297	}	1235	}
1298		1236
1299	if (insert_ob_in_map(more, more->map, originator, flag) == NULL) {	1237	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
		1238	{
1300	if ( ! op->head)	1239	if (!op->head)
1301	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1240	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
		1241
1302	return NULL;	1242	return 0;
1303	}	1243	}
1304	}	1244	}
		1245
1305	CLEAR_FLAG(op,FLAG_REMOVED);	1246	CLEAR_FLAG (op, FLAG_REMOVED);
1306		1247
1307	/* Ideally, the caller figures this out. However, it complicates a lot	1248	/* Ideally, the caller figures this out. However, it complicates a lot
1308	* of areas of callers (eg, anything that uses find_free_spot would now	1249	* of areas of callers (eg, anything that uses find_free_spot would now
1309	* need extra work	1250	* need extra work
1310	*/	1251	*/
1311	op->map=get_map_from_coord(m, &op->x, &op->y);	1252	op->map = get_map_from_coord (m, &op->x, &op->y);
1312	x = op->x;	1253	x = op->x;
1313	y = op->y;	1254	y = op->y;
1314		1255
1315	/* this has to be done after we translate the coordinates.	1256	/* this has to be done after we translate the coordinates.
1316	*/	1257	*/
1317	if(op->nrof && !(flag & INS_NO_MERGE)) {	1258	if (op->nrof && !(flag & INS_NO_MERGE))
1318	for(tmp=GET_MAP_OB(op->map,x,y);tmp!=NULL;tmp=tmp->above)	1259	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)
1319	if (CAN_MERGE(op,tmp)) {	1260	if (object::can_merge (op, tmp))
		1261	{
1320	op->nrof+=tmp->nrof;	1262	op->nrof += tmp->nrof;
1321	remove_ob(tmp);	1263	tmp->destroy ();
1322	free_object(tmp);	1264	}
		1265
		1266	CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
		1267	CLEAR_FLAG (op, FLAG_INV_LOCKED);
		1268
		1269	if (!QUERY_FLAG (op, FLAG_ALIVE))
		1270	CLEAR_FLAG (op, FLAG_NO_STEAL);
		1271
		1272	if (flag & INS_BELOW_ORIGINATOR)
		1273	{
		1274	if (originator->map != op->map || originator->x != op->x || originator->y != op->y)
		1275	{
		1276	LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
		1277	abort ();
		1278	}
		1279
		1280	op->above = originator;
		1281	op->below = originator->below;
		1282
		1283	if (op->below)
		1284	op->below->above = op;
		1285	else
		1286	op->ms ().bottom = op;
		1287
		1288	/* since *below* originator, no need to update top */
		1289	originator->below = op;
		1290	}
		1291	else
		1292	{
		1293	/* If there are other objects, then */
		1294	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))
		1295	{
		1296	object *last = NULL;
		1297
		1298	/*
		1299	* If there are multiple objects on this space, we do some trickier handling.
		1300	* We've already dealt with merging if appropriate.
		1301	* Generally, we want to put the new object on top. But if
		1302	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
		1303	* floor, we want to insert above that and no further.
		1304	* Also, if there are spell objects on this space, we stop processing
		1305	* once we get to them. This reduces the need to traverse over all of
		1306	* them when adding another one - this saves quite a bit of cpu time
		1307	* when lots of spells are cast in one area. Currently, it is presumed
		1308	* that flying non pickable objects are spell objects.
		1309	*/
		1310
		1311	while (top != NULL)
		1312	{
		1313	if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
		1314	floor = top;
		1315
		1316	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
		1317	{
		1318	/* We insert above top, so we want this object below this */
		1319	top = top->below;
		1320	break;
		1321	}
		1322
		1323	last = top;
		1324	top = top->above;
1323	}	1325	}
1324	}
1325		1326
1326	CLEAR_FLAG(op,FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1327	/* Don't want top to be NULL, so set it to the last valid object */
1327	CLEAR_FLAG(op, FLAG_INV_LOCKED);	1328	top = last;
1328	if (!QUERY_FLAG(op, FLAG_ALIVE))
1329	CLEAR_FLAG(op, FLAG_NO_STEAL);
1330		1329
1331	if (flag & INS_BELOW_ORIGINATOR) {	1330	/* We let update_position deal with figuring out what the space
1332	if (originator->map != op->map || originator->x != op->x ||	1331	* looks like instead of lots of conditions here.
1333	originator->y != op->y) {	1332	* makes things faster, and effectively the same result.
1334	LOG(llevError,"insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1333	*/
1335	abort();	1334
		1335	/* Have object 'fall below' other objects that block view.
		1336	* Unless those objects are exits, type 66
		1337	* If INS_ON_TOP is used, don't do this processing
		1338	* Need to find the object that in fact blocks view, otherwise
		1339	* stacking is a bit odd.
		1340	*/
		1341	if (!(flag & INS_ON_TOP) &&
		1342	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))
		1343	{
		1344	for (last = top; last != floor; last = last->below)
		1345	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
		1346	break;
		1347	/* Check to see if we found the object that blocks view,
		1348	* and make sure we have a below pointer for it so that
		1349	* we can get inserted below this one, which requires we
		1350	* set top to the object below us.
		1351	*/
		1352	if (last && last->below && last != floor)
		1353	top = last->below;
		1354	}
		1355	} /* If objects on this space */
		1356
		1357	if (flag & INS_MAP_LOAD)
		1358	top = GET_MAP_TOP (op->map, op->x, op->y);
		1359
		1360	if (flag & INS_ABOVE_FLOOR_ONLY)
		1361	top = floor;
		1362
		1363	/* Top is the object that our object (op) is going to get inserted above.
		1364	*/
		1365
		1366	/* First object on this space */
		1367	if (!top)
		1368	{
		1369	op->above = GET_MAP_OB (op->map, op->x, op->y);
		1370
		1371	if (op->above)
		1372	op->above->below = op;
		1373
		1374	op->below = NULL;
		1375	op->ms ().bottom = op;
1336	}	1376	}
1337	op->above = originator;
1338	op->below = originator->below;
1339	if (op->below) op->below->above = op;
1340	else SET_MAP_OB(op->map, op->x, op->y, op);
1341	/* since *below* originator, no need to update top */
1342	originator->below = op;
1343	} else {	1377	else
1344	/* If there are other objects, then */
1345	if((! (flag & INS_MAP_LOAD)) && ((top=GET_MAP_OB(op->map,op->x,op->y))!=NULL)) {
1346	object *last=NULL;
1347	/*
1348	* If there are multiple objects on this space, we do some trickier handling.
1349	* We've already dealt with merging if appropriate.
1350	* Generally, we want to put the new object on top. But if
1351	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
1352	* floor, we want to insert above that and no further.
1353	* Also, if there are spell objects on this space, we stop processing
1354	* once we get to them. This reduces the need to traverse over all of
1355	* them when adding another one - this saves quite a bit of cpu time
1356	* when lots of spells are cast in one area. Currently, it is presumed
1357	* that flying non pickable objects are spell objects.
1358	*/
1359
1360	while (top != NULL) {
1361	if (QUERY_FLAG(top, FLAG_IS_FLOOR) ||
1362	QUERY_FLAG(top, FLAG_OVERLAY_FLOOR)) floor = top;
1363	if (QUERY_FLAG(top, FLAG_NO_PICK)
1364	&& (top->move_type & (MOVE_FLY_LOW |MOVE_FLY_HIGH))
1365	&& !QUERY_FLAG(top, FLAG_IS_FLOOR))
1366	{
1367	/* We insert above top, so we want this object below this */
1368	top=top->below;
1369	break;
1370	}
1371	last = top;
1372	top = top->above;
1373	}
1374	/* Don't want top to be NULL, so set it to the last valid object */
1375	top = last;
1376
1377	/* We let update_position deal with figuring out what the space
1378	* looks like instead of lots of conditions here.
1379	* makes things faster, and effectively the same result.
1380	*/
1381
1382	/* Have object 'fall below' other objects that block view.
1383	* Unless those objects are exits, type 66
1384	* If INS_ON_TOP is used, don't do this processing
1385	* Need to find the object that in fact blocks view, otherwise
1386	* stacking is a bit odd.
1387	*/
1388	if (!(flag & INS_ON_TOP) &&
1389	(get_map_flags(op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) &&
1390	(op->face && !op->face->visibility)) {
1391	for (last=top; last != floor; last=last->below)
1392	if (QUERY_FLAG(last, FLAG_BLOCKSVIEW)&&(last->type != EXIT)) break;
1393	/* Check to see if we found the object that blocks view,
1394	* and make sure we have a below pointer for it so that
1395	* we can get inserted below this one, which requires we
1396	* set top to the object below us.
1397	*/
1398	if (last && last->below && last != floor) top=last->below;
1399	}
1400	} /* If objects on this space */
1401	if (flag & INS_MAP_LOAD)
1402	top = GET_MAP_TOP(op->map,op->x,op->y);
1403	if (flag & INS_ABOVE_FLOOR_ONLY) top = floor;
1404
1405	/* Top is the object that our object (op) is going to get inserted above.
1406	*/
1407
1408	/* First object on this space */
1409	if (!top) {
1410	op->above = GET_MAP_OB(op->map, op->x, op->y);
1411	if (op->above) op->above->below = op;
1412	op->below = NULL;
1413	SET_MAP_OB(op->map, op->x, op->y, op);
1414	} else { /* get inserted into the stack above top */	1378	{ /* get inserted into the stack above top */
1415	op->above = top->above;	1379	op->above = top->above;
		1380
		1381	if (op->above)
1416	if (op->above) op->above->below = op;	1382	op->above->below = op;
		1383
1417	op->below = top;	1384	op->below = top;
1418	top->above = op;	1385	top->above = op;
1419	}	1386	}
		1387
1420	if (op->above==NULL)	1388	if (op->above == NULL)
1421	SET_MAP_TOP(op->map,op->x, op->y, op);	1389	op->ms ().top = op;
1422	} /* else not INS_BELOW_ORIGINATOR */	1390	} /* else not INS_BELOW_ORIGINATOR */
1423		1391
1424	if(op->type==PLAYER)	1392	if (op->type == PLAYER)
1425	op->contr->do_los=1;	1393	op->contr->do_los = 1;
1426		1394
1427	/* If we have a floor, we know the player, if any, will be above	1395	/* If we have a floor, we know the player, if any, will be above
1428	* it, so save a few ticks and start from there.	1396	* it, so save a few ticks and start from there.
1429	*/	1397	*/
1430	if (!(flag & INS_MAP_LOAD))	1398	if (!(flag & INS_MAP_LOAD))
1431	for(tmp=floor?floor:GET_MAP_OB(op->map,op->x,op->y);tmp!=NULL;tmp=tmp->above) {	1399	if (object *pl = op->ms ().player ())
1432	if (tmp->type == PLAYER)	1400	if (pl->contr->ns)
1433	tmp->contr->socket.update_look=1;	1401	pl->contr->ns->floorbox_update ();
1434	}
1435		1402
1436	/* If this object glows, it may affect lighting conditions that are	1403	/* If this object glows, it may affect lighting conditions that are
1437	* visible to others on this map. But update_all_los is really	1404	* visible to others on this map. But update_all_los is really
1438	* an inefficient way to do this, as it means los for all players	1405	* an inefficient way to do this, as it means los for all players
1439	* on the map will get recalculated. The players could very well	1406	* on the map will get recalculated. The players could very well
1440	* be far away from this change and not affected in any way -	1407	* be far away from this change and not affected in any way -
1441	* this should get redone to only look for players within range,	1408	* this should get redone to only look for players within range,
1442	* or just updating the P_NEED_UPDATE for spaces within this area	1409	* or just updating the P_NEED_UPDATE for spaces within this area
1443	* of effect may be sufficient.	1410	* of effect may be sufficient.
1444	*/	1411	*/
1445	if(MAP_DARKNESS(op->map) && (op->glow_radius != 0))	1412	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))
1446	update_all_los(op->map, op->x, op->y);	1413	update_all_los (op->map, op->x, op->y);
1447		1414
1448
1449	/* updates flags (blocked, alive, no magic, etc) for this map space */	1415	/* updates flags (blocked, alive, no magic, etc) for this map space */
1450	update_object(op,UP_OBJ_INSERT);	1416	update_object (op, UP_OBJ_INSERT);
1451		1417
		1418	INVOKE_OBJECT (INSERT, op);
1452		1419
1453	/* Don't know if moving this to the end will break anything. However,	1420	/* Don't know if moving this to the end will break anything. However,
1454	* we want to have update_look set above before calling this.	1421	* we want to have floorbox_update called before calling this.
1455	*	1422	*
1456	* check_move_on() must be after this because code called from	1423	* check_move_on() must be after this because code called from
1457	* check_move_on() depends on correct map flags (so functions like	1424	* check_move_on() depends on correct map flags (so functions like
1458	* blocked() and wall() work properly), and these flags are updated by	1425	* blocked() and wall() work properly), and these flags are updated by
1459	* update_object().	1426	* update_object().
1460	*/	1427	*/
1461		1428
1462	/* if this is not the head or flag has been passed, don't check walk on status */	1429	/* if this is not the head or flag has been passed, don't check walk on status */
1463
1464	if (!(flag & INS_NO_WALK_ON) && !op->head) {	1430	if (!(flag & INS_NO_WALK_ON) && !op->head)
		1431	{
1465	if (check_move_on(op, originator))	1432	if (check_move_on (op, originator))
1466	return NULL;	1433	return 0;
1467		1434
1468	/* If we are a multi part object, lets work our way through the check	1435	/* If we are a multi part object, lets work our way through the check
1469	* walk on's.	1436	* walk on's.
1470	*/	1437	*/
1471	for (tmp=op->more; tmp!=NULL; tmp=tmp->more)	1438	for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1472	if (check_move_on (tmp, originator))	1439	if (check_move_on (tmp, originator))
1473	return NULL;	1440	return 0;
1474	}	1441	}
		1442
1475	return op;	1443	return op;
1476	}	1444	}
1477		1445
1478	/* this function inserts an object in the map, but if it	1446	/* this function inserts an object in the map, but if it
1479	* finds an object of its own type, it'll remove that one first.	1447	* finds an object of its own type, it'll remove that one first.
1480	* op is the object to insert it under: supplies x and the map.	1448	* op is the object to insert it under: supplies x and the map.
1481	*/	1449	*/
		1450	void
1482	void replace_insert_ob_in_map(const char *arch_string, object *op) {	1451	replace_insert_ob_in_map (const char *arch_string, object *op)
1483	object *tmp;	1452	{
1484	object *tmp1;	1453	object *tmp, *tmp1;
1485		1454
1486	/* first search for itself and remove any old instances */	1455	/* first search for itself and remove any old instances */
1487		1456
1488	for(tmp=GET_MAP_OB(op->map,op->x,op->y); tmp!=NULL; tmp=tmp->above) {	1457	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1489	if(!strcmp(tmp->arch->name,arch_string)) /* same archetype */ {	1458	if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1490	remove_ob(tmp);	1459	tmp->destroy ();
1491	free_object(tmp);
1492	}
1493	}
1494		1460
1495	tmp1=arch_to_object(find_archetype(arch_string));	1461	tmp1 = arch_to_object (archetype::find (arch_string));
1496		1462
1497		1463	tmp1->x = op->x;
1498	tmp1->x = op->x; tmp1->y = op->y;	1464	tmp1->y = op->y;
1499	insert_ob_in_map(tmp1,op->map,op,0);	1465	insert_ob_in_map (tmp1, op->map, op, 0);
1500	}	1466	}
1501		1467
1502	/*	1468	/*
1503	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1469	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1504	* is returned contains nr objects, and the remaining parts contains	1470	* is returned contains nr objects, and the remaining parts contains
1505	* the rest (or is removed and freed if that number is 0).	1471	* the rest (or is removed and freed if that number is 0).
1506	* On failure, NULL is returned, and the reason put into the	1472	* On failure, NULL is returned, and the reason put into the
1507	* global static errmsg array.	1473	* global static errmsg array.
1508	*/	1474	*/
1509		1475
		1476	object *
1510	object *get_split_ob(object *orig_ob, uint32 nr) {	1477	get_split_ob (object *orig_ob, uint32 nr)
		1478	{
1511	object *newob;	1479	object *newob;
1512	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1480	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1513		1481
1514	if(orig_ob->nrof<nr) {	1482	if (orig_ob->nrof < nr)
1515	sprintf(errmsg,"There are only %d %ss.",	1483	{
1516	orig_ob->nrof?orig_ob->nrof:1, &orig_ob->name);	1484	sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1517	return NULL;	1485	return NULL;
1518	}	1486	}
		1487
1519	newob = object_create_clone(orig_ob);	1488	newob = object_create_clone (orig_ob);
		1489
1520	if((orig_ob->nrof-=nr)<1) {	1490	if ((orig_ob->nrof -= nr) < 1)
1521	if ( ! is_removed)	1491	orig_ob->destroy (1);
1522	remove_ob(orig_ob);
1523	free_object2(orig_ob, 1);
1524	}
1525	else if ( ! is_removed) {	1492	else if (!is_removed)
		1493	{
1526	if(orig_ob->env!=NULL)	1494	if (orig_ob->env != NULL)
1527	sub_weight (orig_ob->env,orig_ob->weight*nr);	1495	sub_weight (orig_ob->env, orig_ob->weight * nr);
1528	if (orig_ob->env == NULL && orig_ob->map->in_memory!=MAP_IN_MEMORY) {	1496	if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
		1497	{
1529	strcpy(errmsg, "Tried to split object whose map is not in memory.");	1498	strcpy (errmsg, "Tried to split object whose map is not in memory.");
1530	LOG(llevDebug,
1531	"Error, Tried to split object whose map is not in memory.\n");	1499	LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1532	return NULL;	1500	return NULL;
1533	}	1501	}
1534	}	1502	}
		1503
1535	newob->nrof=nr;	1504	newob->nrof = nr;
1536		1505
1537	return newob;	1506	return newob;
1538	}	1507	}
1539		1508
1540	/*	1509	/*
1541	* decrease_ob_nr(object, number) decreases a specified number from	1510	* decrease_ob_nr(object, number) decreases a specified number from
1542	* the amount of an object. If the amount reaches 0, the object	1511	* the amount of an object. If the amount reaches 0, the object
1543	* is subsequently removed and freed.	1512	* is subsequently removed and freed.
1544	*	1513	*
1545	* Return value: 'op' if something is left, NULL if the amount reached 0	1514	* Return value: 'op' if something is left, NULL if the amount reached 0
1546	*/	1515	*/
1547		1516
		1517	object *
1548	object *decrease_ob_nr (object *op, uint32 i)	1518	decrease_ob_nr (object *op, uint32 i)
1549	{	1519	{
1550	object *tmp;	1520	object *tmp;
1551	player *pl;
1552		1521
1553	if (i == 0) /* objects with op->nrof require this check */	1522	if (i == 0) /* objects with op->nrof require this check */
1554	return op;	1523	return op;
1555		1524
1556	if (i > op->nrof)	1525	if (i > op->nrof)
1557	i = op->nrof;	1526	i = op->nrof;
1558		1527
1559	if (QUERY_FLAG (op, FLAG_REMOVED))	1528	if (QUERY_FLAG (op, FLAG_REMOVED))
		1529	op->nrof -= i;
		1530	else if (op->env)
		1531	{
		1532	/* is this object in the players inventory, or sub container
		1533	* therein?
		1534	*/
		1535	tmp = op->in_player ();
		1536	/* nope. Is this a container the player has opened?
		1537	* If so, set tmp to that player.
		1538	* IMO, searching through all the players will mostly
		1539	* likely be quicker than following op->env to the map,
		1540	* and then searching the map for a player.
		1541	*/
		1542	if (!tmp)
		1543	for_all_players (pl)
		1544	if (pl->ob->container == op->env)
		1545	{
		1546	tmp = pl->ob;
		1547	break;
		1548	}
		1549
		1550	if (i < op->nrof)
		1551	{
		1552	sub_weight (op->env, op->weight * i);
		1553	op->nrof -= i;
		1554	if (tmp)
		1555	esrv_send_item (tmp, op);
		1556	}
		1557	else
		1558	{
		1559	op->remove ();
		1560	op->nrof = 0;
		1561	if (tmp)
		1562	esrv_del_item (tmp->contr, op->count);
		1563	}
1560	{	1564	}
		1565	else
		1566	{
		1567	object *above = op->above;
		1568
		1569	if (i < op->nrof)
1561	op->nrof -= i;	1570	op->nrof -= i;
1562	}	1571	else
1563	else if (op->env != NULL)
1564	{
1565	/* is this object in the players inventory, or sub container
1566	* therein?
1567	*/	1572	{
1568	tmp = is_player_inv (op->env);	1573	op->remove ();
1569	/* nope. Is this a container the player has opened?	1574	op->nrof = 0;
1570	* If so, set tmp to that player.
1571	* IMO, searching through all the players will mostly
1572	* likely be quicker than following op->env to the map,
1573	* and then searching the map for a player.
1574	*/
1575	if (!tmp) {
1576	for (pl=first_player; pl; pl=pl->next)
1577	if (pl->ob->container == op->env) break;
1578	if (pl) tmp=pl->ob;
1579	else tmp=NULL;
1580	}	1575	}
1581		1576
1582	if (i < op->nrof) {
1583	sub_weight (op->env, op->weight * i);
1584	op->nrof -= i;
1585	if (tmp) {
1586	esrv_send_item(tmp, op);
1587	}
1588	} else {
1589	remove_ob (op);
1590	op->nrof = 0;
1591	if (tmp) {
1592	esrv_del_item(tmp->contr, op->count);
1593	}
1594	}
1595	}
1596	else
1597	{
1598	object *above = op->above;
1599
1600	if (i < op->nrof) {
1601	op->nrof -= i;
1602	} else {
1603	remove_ob (op);
1604	op->nrof = 0;
1605	}
1606	/* Since we just removed op, op->above is null */	1577	/* Since we just removed op, op->above is null */
1607	for (tmp = above; tmp != NULL; tmp = tmp->above)	1578	for (tmp = above; tmp; tmp = tmp->above)
1608	if (tmp->type == PLAYER) {	1579	if (tmp->type == PLAYER)
		1580	{
1609	if (op->nrof)	1581	if (op->nrof)
1610	esrv_send_item(tmp, op);	1582	esrv_send_item (tmp, op);
1611	else	1583	else
1612	esrv_del_item(tmp->contr, op->count);	1584	esrv_del_item (tmp->contr, op->count);
1613	}	1585	}
1614	}	1586	}
1615		1587
1616	if (op->nrof) {	1588	if (op->nrof)
1617	return op;	1589	return op;
1618	} else {	1590	else
1619	free_object (op);	1591	{
		1592	op->destroy ();
1620	return NULL;	1593	return 0;
1621	}	1594	}
1622	}	1595	}
1623		1596
1624	/*	1597	/*
1625	* add_weight(object, weight) adds the specified weight to an object,	1598	* add_weight(object, weight) adds the specified weight to an object,
1626	* and also updates how much the environment(s) is/are carrying.	1599	* and also updates how much the environment(s) is/are carrying.
1627	*/	1600	*/
1628		1601
		1602	void
1629	void add_weight (object *op, signed long weight) {	1603	add_weight (object *op, signed long weight)
		1604	{
1630	while (op!=NULL) {	1605	while (op != NULL)
		1606	{
1631	if (op->type == CONTAINER) {	1607	if (op->type == CONTAINER)
1632	weight=(signed long)(weight*(100-op->stats.Str)/100);	1608	weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1633	}	1609
1634	op->carrying+=weight;	1610	op->carrying += weight;
1635	op=op->env;	1611	op = op->env;
1636	}	1612	}
1637	}	1613	}
1638		1614
		1615	object *
		1616	insert_ob_in_ob (object *op, object *where)
		1617	{
		1618	if (!where)
		1619	{
		1620	char *dump = dump_object (op);
		1621	LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
		1622	free (dump);
		1623	return op;
		1624	}
		1625
		1626	if (where->head)
		1627	{
		1628	LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");
		1629	where = where->head;
		1630	}
		1631
		1632	return where->insert (op);
		1633	}
		1634
1639	/*	1635	/*
1640	* insert_ob_in_ob(op,environment):	1636	* env->insert (op)
1641	* This function inserts the object op in the linked list	1637	* This function inserts the object op in the linked list
1642	* inside the object environment.	1638	* inside the object environment.
1643	*	1639	*
1644	* Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter
1645	* the inventory at the last position or next to other objects of the same
1646	* type.
1647	* Frank: Now sorted by type, archetype and magic!
1648	*
1649	* The function returns now pointer to inserted item, and return value can	1640	* The function returns now pointer to inserted item, and return value can
1650	* be != op, if items are merged. -Tero	1641	* be != op, if items are merged. -Tero
1651	*/	1642	*/
1652		1643
1653	object *insert_ob_in_ob(object *op,object *where) {	1644	object *
		1645	object::insert (object *op)
		1646	{
1654	object *tmp, *otmp;	1647	object *tmp, *otmp;
1655		1648
1656	if(!QUERY_FLAG(op,FLAG_REMOVED)) {	1649	if (!QUERY_FLAG (op, FLAG_REMOVED))
1657	dump_object(op);	1650	op->remove ();
1658	LOG(llevError,"Trying to insert (ob) inserted object.\n%s\n", errmsg);	1651
1659	return op;
1660	}
1661	if(where==NULL) {
1662	dump_object(op);
1663	LOG(llevError,"Trying to put object in NULL.\n%s\n", errmsg);
1664	return op;
1665	}
1666	if (where->head) {
1667	LOG(llevDebug,
1668	"Warning: Tried to insert object wrong part of multipart object.\n");
1669	where = where->head;
1670	}
1671	if (op->more) {	1652	if (op->more)
		1653	{
1672	LOG(llevError, "Tried to insert multipart object %s (%d)\n",	1654	LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1673	&op->name, op->count);
1674	return op;	1655	return op;
1675	}	1656	}
		1657
1676	CLEAR_FLAG(op, FLAG_OBJ_ORIGINAL);	1658	CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1677	CLEAR_FLAG(op, FLAG_REMOVED);	1659	CLEAR_FLAG (op, FLAG_REMOVED);
1678	if(op->nrof) {	1660	if (op->nrof)
		1661	{
1679	for(tmp=where->inv;tmp!=NULL;tmp=tmp->below)	1662	for (tmp = inv; tmp != NULL; tmp = tmp->below)
1680	if ( CAN_MERGE(tmp,op) ) {	1663	if (object::can_merge (tmp, op))
		1664	{
1681	/* return the original object and remove inserted object	1665	/* return the original object and remove inserted object
1682	(client needs the original object) */	1666	(client needs the original object) */
1683	tmp->nrof += op->nrof;	1667	tmp->nrof += op->nrof;
1684	/* Weight handling gets pretty funky. Since we are adding to	1668	/* Weight handling gets pretty funky. Since we are adding to
1685	* tmp->nrof, we need to increase the weight.	1669	* tmp->nrof, we need to increase the weight.
1686	*/	1670	*/
1687	add_weight (where, op->weight*op->nrof);	1671	add_weight (this, op->weight * op->nrof);
1688	SET_FLAG(op, FLAG_REMOVED);	1672	SET_FLAG (op, FLAG_REMOVED);
1689	free_object(op); /* free the inserted object */	1673	op->destroy (); /* free the inserted object */
1690	op = tmp;	1674	op = tmp;
1691	remove_ob (op); /* and fix old object's links */	1675	op->remove (); /* and fix old object's links */
1692	CLEAR_FLAG(op, FLAG_REMOVED);	1676	CLEAR_FLAG (op, FLAG_REMOVED);
1693	break;	1677	break;
1694	}	1678	}
1695		1679
1696	/* I assume combined objects have no inventory	1680	/* I assume combined objects have no inventory
1697	* We add the weight - this object could have just been removed	1681	* We add the weight - this object could have just been removed
1698	* (if it was possible to merge). calling remove_ob will subtract	1682	* (if it was possible to merge). calling remove_ob will subtract
1699	* the weight, so we need to add it in again, since we actually do	1683	* the weight, so we need to add it in again, since we actually do
1700	* the linking below	1684	* the linking below
1701	*/	1685	*/
1702	add_weight (where, op->weight*op->nrof);	1686	add_weight (this, op->weight * op->nrof);
		1687	}
1703	} else	1688	else
1704	add_weight (where, (op->weight+op->carrying));	1689	add_weight (this, (op->weight + op->carrying));
1705		1690
1706	otmp=is_player_inv(where);	1691	otmp = this->in_player ();
1707	if (otmp&&otmp->contr!=NULL) {	1692	if (otmp && otmp->contr)
1708	if (!QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER))	1693	if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1709	fix_player(otmp);	1694	otmp->update_stats ();
1710	}
1711		1695
1712	op->map=NULL;	1696	op->map = 0;
1713	op->env=where;	1697	op->env = this;
1714	op->above=NULL;	1698	op->above = 0;
1715	op->below=NULL;	1699	op->below = 0;
1716	op->x=0,op->y=0;	1700	op->x = 0, op->y = 0;
1717		1701
1718	/* reset the light list and los of the players on the map */	1702	/* reset the light list and los of the players on the map */
1719	if((op->glow_radius!=0)&&where->map)	1703	if ((op->glow_radius != 0) && map)
1720	{	1704	{
1721	#ifdef DEBUG_LIGHTS	1705	#ifdef DEBUG_LIGHTS
1722	LOG(llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n",	1706	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1723	op->name);
1724	#endif /* DEBUG_LIGHTS */	1707	#endif /* DEBUG_LIGHTS */
1725	if (MAP_DARKNESS(where->map)) update_all_los(where->map, where->x, where->y);	1708	if (MAP_DARKNESS (map))
		1709	update_all_los (map, x, y);
1726	}	1710	}
1727		1711
1728	/* Client has no idea of ordering so lets not bother ordering it here.	1712	/* Client has no idea of ordering so lets not bother ordering it here.
1729	* It sure simplifies this function...	1713	* It sure simplifies this function...
1730	*/	1714	*/
1731	if (where->inv==NULL)	1715	if (!inv)
1732	where->inv=op;	1716	inv = op;
1733	else {	1717	else
		1718	{
1734	op->below = where->inv;	1719	op->below = inv;
1735	op->below->above = op;	1720	op->below->above = op;
1736	where->inv = op;	1721	inv = op;
1737	}	1722	}
		1723
		1724	INVOKE_OBJECT (INSERT, this);
		1725
1738	return op;	1726	return op;
1739	}	1727	}
1740		1728
1741	/*	1729	/*
1742	* Checks if any objects has a move_type that matches objects	1730	* Checks if any objects has a move_type that matches objects
…		…
1757	* MSW 2001-07-08: Check all objects on space, not just those below	1745	* MSW 2001-07-08: Check all objects on space, not just those below
1758	* object being inserted. insert_ob_in_map may not put new objects	1746	* object being inserted. insert_ob_in_map may not put new objects
1759	* on top.	1747	* on top.
1760	*/	1748	*/
1761		1749
		1750	int
1762	int check_move_on (object *op, object *originator)	1751	check_move_on (object *op, object *originator)
1763	{	1752	{
1764	object *tmp;	1753	object *tmp;
1765	tag_t tag;
1766	mapstruct *m=op->map;	1754	maptile *m = op->map;
1767	int x=op->x, y=op->y;	1755	int x = op->x, y = op->y;
		1756
1768	MoveType move_on, move_slow, move_block;	1757	MoveType move_on, move_slow, move_block;
1769		1758
1770	if(QUERY_FLAG(op,FLAG_NO_APPLY))	1759	if (QUERY_FLAG (op, FLAG_NO_APPLY))
1771	return 0;	1760	return 0;
1772		1761
1773	tag = op->count;
1774
1775	move_on = GET_MAP_MOVE_ON(op->map, op->x, op->y);	1762	move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1776	move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y);	1763	move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1777	move_block = GET_MAP_MOVE_BLOCK(op->map, op->x, op->y);	1764	move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1778		1765
1779	/* if nothing on this space will slow op down or be applied,	1766	/* if nothing on this space will slow op down or be applied,
1780	* no need to do checking below. have to make sure move_type	1767	* no need to do checking below. have to make sure move_type
1781	* is set, as lots of objects don't have it set - we treat that	1768	* is set, as lots of objects don't have it set - we treat that
1782	* as walking.	1769	* as walking.
1783	*/	1770	*/
1784	if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow))	1771	if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow))
1785	return 0;	1772	return 0;
1786		1773
1787	/* This is basically inverse logic of that below - basically,	1774	/* This is basically inverse logic of that below - basically,
1788	* if the object can avoid the move on or slow move, they do so,	1775	* if the object can avoid the move on or slow move, they do so,
1789	* but can't do it if the alternate movement they are using is	1776	* but can't do it if the alternate movement they are using is
1790	* blocked. Logic on this seems confusing, but does seem correct.	1777	* blocked. Logic on this seems confusing, but does seem correct.
1791	*/	1778	*/
1792	if ((op->move_type & ~move_on & ~move_block) != 0 &&	1779	if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0)
1793	(op->move_type & ~move_slow & ~move_block) != 0) return 0;	1780	return 0;
1794		1781
1795	/* The objects have to be checked from top to bottom.	1782	/* The objects have to be checked from top to bottom.
1796	* Hence, we first go to the top:	1783	* Hence, we first go to the top:
1797	*/	1784	*/
1798		1785
1799	for (tmp=GET_MAP_OB(op->map, op->x, op->y); tmp!=NULL &&	1786	for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)
1800	tmp->above!=NULL; tmp=tmp->above) {	1787	{
1801	/* Trim the search when we find the first other spell effect	1788	/* Trim the search when we find the first other spell effect
1802	* this helps performance so that if a space has 50 spell objects,	1789	* this helps performance so that if a space has 50 spell objects,
1803	* we don't need to check all of them.	1790	* we don't need to check all of them.
1804	*/	1791	*/
1805	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG(tmp, FLAG_NO_PICK)) break;	1792	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
		1793	break;
		1794	}
		1795
		1796	for (; tmp; tmp = tmp->below)
1806	}	1797	{
1807	for(;tmp!=NULL; tmp=tmp->below) {	1798	if (tmp == op)
1808	if (tmp == op) continue; /* Can't apply yourself */	1799	continue; /* Can't apply yourself */
1809		1800
1810	/* Check to see if one of the movement types should be slowed down.	1801	/* Check to see if one of the movement types should be slowed down.
1811	* Second check makes sure that the movement types not being slowed	1802	* Second check makes sure that the movement types not being slowed
1812	* (~slow_move) is not blocked on this space - just because the	1803	* (~slow_move) is not blocked on this space - just because the
1813	* space doesn't slow down swimming (for example), if you can't actually	1804	* space doesn't slow down swimming (for example), if you can't actually
1814	* swim on that space, can't use it to avoid the penalty.	1805	* swim on that space, can't use it to avoid the penalty.
1815	*/	1806	*/
1816	if (!QUERY_FLAG(op, FLAG_WIZPASS)) {	1807	if (!QUERY_FLAG (op, FLAG_WIZPASS))
		1808	{
1817	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	1809	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1818	((op->move_type & tmp->move_slow) &&
1819	(op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) {	1810	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
		1811	{
1820		1812
1821	float diff;	1813	float
1822
1823	diff = tmp->move_slow_penalty*FABS(op->speed);	1814	diff = tmp->move_slow_penalty * FABS (op->speed);
		1815
1824	if (op->type == PLAYER) {	1816	if (op->type == PLAYER)
1825	if ((QUERY_FLAG(tmp, FLAG_IS_HILLY) && find_skill_by_number(op, SK_CLIMBING)) ||	1817	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1826	(QUERY_FLAG(tmp, FLAG_IS_WOODED) && find_skill_by_number(op, SK_WOODSMAN))) {	1818	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1827	diff /= 4.0;	1819	diff /= 4.0;
1828	}	1820
1829	}
1830	op->speed_left -= diff;	1821	op->speed_left -= diff;
1831	}	1822	}
1832	}	1823	}
1833		1824
1834	/* Basically same logic as above, except now for actual apply. */	1825	/* Basically same logic as above, except now for actual apply. */
1835	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||	1826	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
1836	((op->move_type & tmp->move_on) &&
1837	(op->move_type & ~tmp->move_on & ~tmp->move_block)==0)) {	1827	((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1838		1828	{
1839	move_apply(tmp, op, originator);	1829	move_apply (tmp, op, originator);
		1830
1840	if (was_destroyed (op, tag))	1831	if (op->destroyed ())
1841	return 1;	1832	return 1;
1842		1833
1843	/* what the person/creature stepped onto has moved the object	1834	/* what the person/creature stepped onto has moved the object
1844	* someplace new. Don't process any further - if we did,	1835	* someplace new. Don't process any further - if we did,
1845	* have a feeling strange problems would result.	1836	* have a feeling strange problems would result.
1846	*/	1837	*/
1847	if (op->map != m || op->x != x || op->y != y) return 0;	1838	if (op->map != m || op->x != x || op->y != y)
		1839	return 0;
1848	}	1840	}
1849	}	1841	}
		1842
1850	return 0;	1843	return 0;
1851	}	1844	}
1852		1845
1853	/*	1846	/*
1854	* present_arch(arch, map, x, y) searches for any objects with	1847	* present_arch(arch, map, x, y) searches for any objects with
1855	* a matching archetype at the given map and coordinates.	1848	* a matching archetype at the given map and coordinates.
1856	* The first matching object is returned, or NULL if none.	1849	* The first matching object is returned, or NULL if none.
1857	*/	1850	*/
1858		1851
		1852	object *
1859	object *present_arch(const archetype *at, mapstruct *m, int x, int y) {	1853	present_arch (const archetype *at, maptile *m, int x, int y)
		1854	{
1860	object *tmp;	1855	object *
		1856	tmp;
		1857
1861	if(m==NULL || out_of_map(m,x,y)) {	1858	if (m == NULL || out_of_map (m, x, y))
		1859	{
1862	LOG(llevError,"Present_arch called outside map.\n");	1860	LOG (llevError, "Present_arch called outside map.\n");
1863	return NULL;	1861	return NULL;
1864	}	1862	}
1865	for(tmp=GET_MAP_OB(m,x,y); tmp != NULL; tmp = tmp->above)	1863	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1866	if(tmp->arch == at)	1864	if (tmp->arch == at)
1867	return tmp;	1865	return tmp;
1868	return NULL;	1866	return NULL;
1869	}	1867	}
1870		1868
1871	/*	1869	/*
1872	* present(type, map, x, y) searches for any objects with	1870	* present(type, map, x, y) searches for any objects with
1873	* a matching type variable at the given map and coordinates.	1871	* a matching type variable at the given map and coordinates.
1874	* The first matching object is returned, or NULL if none.	1872	* The first matching object is returned, or NULL if none.
1875	*/	1873	*/
1876		1874
		1875	object *
1877	object *present(unsigned char type,mapstruct *m, int x,int y) {	1876	present (unsigned char type, maptile *m, int x, int y)
		1877	{
1878	object *tmp;	1878	object *
		1879	tmp;
		1880
1879	if(out_of_map(m,x,y)) {	1881	if (out_of_map (m, x, y))
		1882	{
1880	LOG(llevError,"Present called outside map.\n");	1883	LOG (llevError, "Present called outside map.\n");
1881	return NULL;	1884	return NULL;
1882	}	1885	}
1883	for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above)	1886	for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1884	if(tmp->type==type)	1887	if (tmp->type == type)
1885	return tmp;	1888	return tmp;
1886	return NULL;	1889	return NULL;
1887	}	1890	}
1888		1891
1889	/*	1892	/*
1890	* present_in_ob(type, object) searches for any objects with	1893	* present_in_ob(type, object) searches for any objects with
1891	* a matching type variable in the inventory of the given object.	1894	* a matching type variable in the inventory of the given object.
1892	* The first matching object is returned, or NULL if none.	1895	* The first matching object is returned, or NULL if none.
1893	*/	1896	*/
1894		1897
		1898	object *
1895	object *present_in_ob(unsigned char type, const object *op) {	1899	present_in_ob (unsigned char type, const object *op)
		1900	{
1896	object *tmp;	1901	object *
		1902	tmp;
		1903
1897	for(tmp=op->inv;tmp!=NULL;tmp=tmp->below)	1904	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
1898	if(tmp->type==type)	1905	if (tmp->type == type)
1899	return tmp;	1906	return tmp;
1900	return NULL;	1907	return NULL;
1901	}	1908	}
1902		1909
1903	/*	1910	/*
…		…
1912	* str is the string to match against. Note that we match against	1919	* str is the string to match against. Note that we match against
1913	* the object name, not the archetype name. this is so that the	1920	* the object name, not the archetype name. this is so that the
1914	* spell code can use one object type (force), but change it's name	1921	* spell code can use one object type (force), but change it's name
1915	* to be unique.	1922	* to be unique.
1916	*/	1923	*/
1917		1924	object *
1918	object *present_in_ob_by_name(int type, const char *str, const object *op) {	1925	present_in_ob_by_name (int type, const char *str, const object *op)
		1926	{
1919	object *tmp;	1927	object *tmp;
1920		1928
1921	for(tmp=op->inv; tmp!=NULL; tmp=tmp->below) {	1929	for (tmp = op->inv; tmp; tmp = tmp->below)
1922	if ((type==-1 || tmp->type==type) && (!strcmp(str, tmp->name)))	1930	if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
1923	return tmp;	1931	return tmp;
1924	}	1932
1925	return NULL;	1933	return 0;
1926	}	1934	}
1927		1935
1928	/*	1936	/*
1929	* present_arch_in_ob(archetype, object) searches for any objects with	1937	* present_arch_in_ob(archetype, object) searches for any objects with
1930	* a matching archetype in the inventory of the given object.	1938	* a matching archetype in the inventory of the given object.
1931	* The first matching object is returned, or NULL if none.	1939	* The first matching object is returned, or NULL if none.
1932	*/	1940	*/
1933		1941	object *
1934	object *present_arch_in_ob(const archetype *at, const object *op) {	1942	present_arch_in_ob (const archetype *at, const object *op)
1935	object *tmp;	1943	{
1936	for(tmp=op->inv;tmp!=NULL;tmp=tmp->below)	1944	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1937	if( tmp->arch == at)	1945	if (tmp->arch == at)
1938	return tmp;	1946	return tmp;
		1947
1939	return NULL;	1948	return NULL;
1940	}	1949	}
1941		1950
1942	/*	1951	/*
1943	* activate recursively a flag on an object inventory	1952	* activate recursively a flag on an object inventory
1944	*/	1953	*/
		1954	void
1945	void flag_inv(object*op, int flag){	1955	flag_inv (object *op, int flag)
1946	object *tmp;	1956	{
1947	if(op->inv)	1957	if (op->inv)
1948	for(tmp = op->inv; tmp != NULL; tmp = tmp->below){	1958	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
		1959	{
1949	SET_FLAG(tmp, flag);	1960	SET_FLAG (tmp, flag);
1950	flag_inv(tmp,flag);	1961	flag_inv (tmp, flag);
1951	}	1962	}
		1963	}
		1964
1952	}/*	1965	/*
1953	* desactivate recursively a flag on an object inventory	1966	* deactivate recursively a flag on an object inventory
1954	*/	1967	*/
		1968	void
1955	void unflag_inv(object*op, int flag){	1969	unflag_inv (object *op, int flag)
1956	object *tmp;	1970	{
1957	if(op->inv)	1971	if (op->inv)
1958	for(tmp = op->inv; tmp != NULL; tmp = tmp->below){	1972	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
		1973	{
1959	CLEAR_FLAG(tmp, flag);	1974	CLEAR_FLAG (tmp, flag);
1960	unflag_inv(tmp,flag);	1975	unflag_inv (tmp, flag);
1961	}	1976	}
1962	}	1977	}
1963		1978
1964	/*	1979	/*
1965	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in	1980	* set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1966	* all it's inventory (recursively).	1981	* all it's inventory (recursively).
1967	* If checksums are used, a player will get set_cheat called for	1982	* If checksums are used, a player will get set_cheat called for
1968	* him/her-self and all object carried by a call to this function.	1983	* him/her-self and all object carried by a call to this function.
1969	*/	1984	*/
1970		1985	void
1971	void set_cheat(object *op) {	1986	set_cheat (object *op)
		1987	{
1972	SET_FLAG(op, FLAG_WAS_WIZ);	1988	SET_FLAG (op, FLAG_WAS_WIZ);
1973	flag_inv(op, FLAG_WAS_WIZ);	1989	flag_inv (op, FLAG_WAS_WIZ);
1974	}	1990	}
1975		1991
1976	/*	1992	/*
1977	* find_free_spot(object, map, x, y, start, stop) will search for	1993	* find_free_spot(object, map, x, y, start, stop) will search for
1978	* a spot at the given map and coordinates which will be able to contain	1994	* a spot at the given map and coordinates which will be able to contain
…		…
1992	* because arch_blocked (now ob_blocked) needs to know the movement type	2008	* because arch_blocked (now ob_blocked) needs to know the movement type
1993	* to know if the space in question will block the object. We can't use	2009	* to know if the space in question will block the object. We can't use
1994	* the archetype because that isn't correct if the monster has been	2010	* the archetype because that isn't correct if the monster has been
1995	* customized, changed states, etc.	2011	* customized, changed states, etc.
1996	*/	2012	*/
1997		2013	int
1998	int find_free_spot(const object *ob, mapstruct *m,int x,int y,int start,int stop) {	2014	find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
		2015	{
1999	int i,index=0, flag;	2016	int index = 0, flag;
2000	static int altern[SIZEOFFREE];	2017	int altern[SIZEOFFREE];
2001		2018
2002	for(i=start;i<stop;i++) {	2019	for (int i = start; i < stop; i++)
		2020	{
2003	flag = ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]);	2021	flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2004	if(!flag)	2022	if (!flag)
2005	altern[index++]=i;	2023	altern [index++] = i;
2006		2024
2007	/* Basically, if we find a wall on a space, we cut down the search size.	2025	/* Basically, if we find a wall on a space, we cut down the search size.
2008	* In this way, we won't return spaces that are on another side of a wall.	2026	* In this way, we won't return spaces that are on another side of a wall.
2009	* This mostly work, but it cuts down the search size in all directions -	2027	* This mostly work, but it cuts down the search size in all directions -
2010	* if the space being examined only has a wall to the north and empty	2028	* if the space being examined only has a wall to the north and empty
2011	* spaces in all the other directions, this will reduce the search space	2029	* spaces in all the other directions, this will reduce the search space
2012	* to only the spaces immediately surrounding the target area, and	2030	* to only the spaces immediately surrounding the target area, and
2013	* won't look 2 spaces south of the target space.	2031	* won't look 2 spaces south of the target space.
2014	*/	2032	*/
2015	else if ((flag & AB_NO_PASS) && maxfree[i]<stop)	2033	else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2016	stop=maxfree[i];	2034	stop = maxfree[i];
2017	}	2035	}
2018	if(!index) return -1;	2036
		2037	if (!index)
		2038	return -1;
		2039
2019	return altern[RANDOM()%index];	2040	return altern[RANDOM () % index];
2020	}	2041	}
2021		2042
2022	/*	2043	/*
2023	* find_first_free_spot(archetype, mapstruct, x, y) works like	2044	* find_first_free_spot(archetype, maptile, x, y) works like
2024	* find_free_spot(), but it will search max number of squares.	2045	* find_free_spot(), but it will search max number of squares.
2025	* But it will return the first available spot, not a random choice.	2046	* But it will return the first available spot, not a random choice.
2026	* Changed 0.93.2: Have it return -1 if there is no free spot available.	2047	* Changed 0.93.2: Have it return -1 if there is no free spot available.
2027	*/	2048	*/
2028		2049	int
2029	int find_first_free_spot(const object *ob, mapstruct *m,int x,int y) {	2050	find_first_free_spot (const object *ob, maptile *m, int x, int y)
2030	int i;	2051	{
2031	for(i=0;i<SIZEOFFREE;i++) {	2052	for (int i = 0; i < SIZEOFFREE; i++)
2032	if(!ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]))	2053	if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2033	return i;	2054	return i;
2034	}	2055
2035	return -1;	2056	return -1;
2036	}	2057	}
2037		2058
2038	/*	2059	/*
2039	* The function permute(arr, begin, end) randomly reorders the array	2060	* The function permute(arr, begin, end) randomly reorders the array
2040	* arr[begin..end-1].	2061	* arr[begin..end-1].
		2062	* now uses a fisher-yates shuffle, old permute was broken
2041	*/	2063	*/
		2064	static void
2042	static void permute(int *arr, int begin, int end)	2065	permute (int *arr, int begin, int end)
2043	{	2066	{
2044	int i, j, tmp, len;	2067	arr += begin;
		2068	end -= begin;
2045		2069
2046	len = end-begin;	2070	while (--end)
2047	for(i = begin; i < end; i++)	2071	swap (arr [end], arr [RANDOM () % (end + 1)]);
2048	{
2049	j = begin+RANDOM()%len;
2050
2051	tmp = arr[i];
2052	arr[i] = arr[j];
2053	arr[j] = tmp;
2054	}
2055	}	2072	}
2056		2073
2057	/* new function to make monster searching more efficient, and effective!	2074	/* new function to make monster searching more efficient, and effective!
2058	* This basically returns a randomized array (in the passed pointer) of	2075	* This basically returns a randomized array (in the passed pointer) of
2059	* the spaces to find monsters. In this way, it won't always look for	2076	* the spaces to find monsters. In this way, it won't always look for
2060	* monsters to the north first. However, the size of the array passed	2077	* monsters to the north first. However, the size of the array passed
2061	* covers all the spaces, so within that size, all the spaces within	2078	* covers all the spaces, so within that size, all the spaces within
2062	* the 3x3 area will be searched, just not in a predictable order.	2079	* the 3x3 area will be searched, just not in a predictable order.
2063	*/	2080	*/
		2081	void
2064	void get_search_arr(int *search_arr)	2082	get_search_arr (int *search_arr)
2065	{	2083	{
2066	int i;	2084	int i;
2067		2085
2068	for(i = 0; i < SIZEOFFREE; i++)	2086	for (i = 0; i < SIZEOFFREE; i++)
2069	{
2070	search_arr[i] = i;	2087	search_arr[i] = i;
2071	}
2072		2088
2073	permute(search_arr, 1, SIZEOFFREE1+1);	2089	permute (search_arr, 1, SIZEOFFREE1 + 1);
2074	permute(search_arr, SIZEOFFREE1+1, SIZEOFFREE2+1);	2090	permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2075	permute(search_arr, SIZEOFFREE2+1, SIZEOFFREE);	2091	permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2076	}	2092	}
2077		2093
2078	/*	2094	/*
2079	* find_dir(map, x, y, exclude) will search some close squares in the	2095	* find_dir(map, x, y, exclude) will search some close squares in the
2080	* given map at the given coordinates for live objects.	2096	* given map at the given coordinates for live objects.
…		…
2085	* Perhaps incorrectly, but I'm making the assumption that exclude	2101	* Perhaps incorrectly, but I'm making the assumption that exclude
2086	* is actually want is going to try and move there. We need this info	2102	* is actually want is going to try and move there. We need this info
2087	* because we have to know what movement the thing looking to move	2103	* because we have to know what movement the thing looking to move
2088	* there is capable of.	2104	* there is capable of.
2089	*/	2105	*/
2090		2106	int
2091	int find_dir(mapstruct *m, int x, int y, object *exclude) {	2107	find_dir (maptile *m, int x, int y, object *exclude)
		2108	{
2092	int i,max=SIZEOFFREE, mflags;	2109	int i, max = SIZEOFFREE, mflags;
		2110
2093	sint16 nx, ny;	2111	sint16 nx, ny;
2094	object *tmp;	2112	object *tmp;
2095	mapstruct *mp;	2113	maptile *mp;
		2114
2096	MoveType blocked, move_type;	2115	MoveType blocked, move_type;
2097		2116
2098	if (exclude && exclude->head) {	2117	if (exclude && exclude->head)
		2118	{
2099	exclude = exclude->head;	2119	exclude = exclude->head;
2100	move_type = exclude->move_type;	2120	move_type = exclude->move_type;
2101	} else {	2121	}
		2122	else
		2123	{
2102	/* If we don't have anything, presume it can use all movement types. */	2124	/* If we don't have anything, presume it can use all movement types. */
2103	move_type=MOVE_ALL;	2125	move_type = MOVE_ALL;
		2126	}
		2127
		2128	for (i = 1; i < max; i++)
2104	}	2129	{
2105
2106	for(i=1;i<max;i++) {
2107	mp = m;	2130	mp = m;
2108	nx = x + freearr_x[i];	2131	nx = x + freearr_x[i];
2109	ny = y + freearr_y[i];	2132	ny = y + freearr_y[i];
2110		2133
2111	mflags = get_map_flags(m, &mp, nx, ny, &nx, &ny);	2134	mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
		2135
2112	if (mflags & P_OUT_OF_MAP) {	2136	if (mflags & P_OUT_OF_MAP)
		2137	max = maxfree[i];
		2138	else
		2139	{
		2140	mapspace &ms = mp->at (nx, ny);
		2141
		2142	blocked = ms.move_block;
		2143
		2144	if ((move_type & blocked) == move_type)
2113	max = maxfree[i];	2145	max = maxfree[i];
2114	} else {
2115	blocked = GET_MAP_MOVE_BLOCK(mp, nx, ny);
2116
2117	if ((move_type & blocked) == move_type) {
2118	max=maxfree[i];
2119	} else if (mflags & P_IS_ALIVE) {	2146	else if (mflags & P_IS_ALIVE)
2120	for (tmp=GET_MAP_OB(mp,nx,ny); tmp!= NULL; tmp=tmp->above) {	2147	{
		2148	for (tmp = ms.bottom; tmp; tmp = tmp->above)
2121	if ((QUERY_FLAG(tmp,FLAG_MONSTER) || tmp->type==PLAYER) &&	2149	if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2122	(tmp != exclude ||(tmp->head && tmp->head != exclude))) {	2150	&& (tmp != exclude || (tmp->head && tmp->head != exclude)))
2123	break;	2151	break;
2124	}	2152
2125	}
2126	if(tmp) {	2153	if (tmp)
2127	return freedir[i];	2154	return freedir[i];
2128	}
2129	}	2155	}
2130	}	2156	}
2131	}	2157	}
		2158
2132	return 0;	2159	return 0;
2133	}	2160	}
2134		2161
2135	/*	2162	/*
2136	* distance(object 1, object 2) will return the square of the	2163	* distance(object 1, object 2) will return the square of the
2137	* distance between the two given objects.	2164	* distance between the two given objects.
2138	*/	2165	*/
2139		2166	int
2140	int distance(const object *ob1, const object *ob2) {	2167	distance (const object *ob1, const object *ob2)
2141	int i;	2168	{
2142	i= (ob1->x - ob2->x)*(ob1->x - ob2->x)+	2169	return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2143	(ob1->y - ob2->y)*(ob1->y - ob2->y);
2144	return i;
2145	}	2170	}
2146		2171
2147	/*	2172	/*
2148	* find_dir_2(delta-x,delta-y) will return a direction in which	2173	* find_dir_2(delta-x,delta-y) will return a direction in which
2149	* an object which has subtracted the x and y coordinates of another	2174	* an object which has subtracted the x and y coordinates of another
2150	* object, needs to travel toward it.	2175	* object, needs to travel toward it.
2151	*/	2176	*/
2152		2177	int
2153	int find_dir_2(int x, int y) {	2178	find_dir_2 (int x, int y)
		2179	{
2154	int q;	2180	int q;
2155		2181
2156	if(y)	2182	if (y)
2157	q=x*100/y;	2183	q = x * 100 / y;
2158	else if (x)	2184	else if (x)
2159	q= -300*x;	2185	q = -300 * x;
2160	else	2186	else
2161	return 0;	2187	return 0;
2162		2188
2163	if(y>0) {	2189	if (y > 0)
		2190	{
2164	if(q < -242)	2191	if (q < -242)
2165	return 3 ;	2192	return 3;
2166	if (q < -41)	2193	if (q < -41)
2167	return 2 ;	2194	return 2;
2168	if (q < 41)	2195	if (q < 41)
2169	return 1 ;	2196	return 1;
2170	if (q < 242)	2197	if (q < 242)
2171	return 8 ;	2198	return 8;
2172	return 7 ;	2199	return 7;
2173	}	2200	}
2174		2201
2175	if (q < -242)	2202	if (q < -242)
2176	return 7 ;	2203	return 7;
2177	if (q < -41)	2204	if (q < -41)
2178	return 6 ;	2205	return 6;
2179	if (q < 41)	2206	if (q < 41)
2180	return 5 ;	2207	return 5;
2181	if (q < 242)	2208	if (q < 242)
2182	return 4 ;	2209	return 4;
2183		2210
2184	return 3 ;	2211	return 3;
2185	}	2212	}
2186		2213
2187	/*	2214	/*
2188	* absdir(int): Returns a number between 1 and 8, which represent	2215	* absdir(int): Returns a number between 1 and 8, which represent
2189	* the "absolute" direction of a number (it actually takes care of	2216	* the "absolute" direction of a number (it actually takes care of
2190	* "overflow" in previous calculations of a direction).	2217	* "overflow" in previous calculations of a direction).
2191	*/	2218	*/
2192		2219
		2220	int
2193	int absdir(int d) {	2221	absdir (int d)
2194	while(d<1) d+=8;	2222	{
2195	while(d>8) d-=8;	2223	while (d < 1)
		2224	d += 8;
		2225
		2226	while (d > 8)
		2227	d -= 8;
		2228
2196	return d;	2229	return d;
2197	}	2230	}
2198		2231
2199	/*	2232	/*
2200	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2233	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2201	* between two directions (which are expected to be absolute (see absdir())	2234	* between two directions (which are expected to be absolute (see absdir())
2202	*/	2235	*/
2203		2236
		2237	int
2204	int dirdiff(int dir1, int dir2) {	2238	dirdiff (int dir1, int dir2)
		2239	{
2205	int d;	2240	int d;
		2241
2206	d = abs(dir1 - dir2);	2242	d = abs (dir1 - dir2);
2207	if(d>4)	2243	if (d > 4)
2208	d = 8 - d;	2244	d = 8 - d;
		2245
2209	return d;	2246	return d;
2210	}	2247	}
2211		2248
2212	/* peterm:	2249	/* peterm:
2213	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.	2250	* do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
…		…
2216	* This basically means that if direction is 15, then it could either go	2253	* This basically means that if direction is 15, then it could either go
2217	* direction 4, 14, or 16 to get back to where we are.	2254	* direction 4, 14, or 16 to get back to where we are.
2218	* Moved from spell_util.c to object.c with the other related direction	2255	* Moved from spell_util.c to object.c with the other related direction
2219	* functions.	2256	* functions.
2220	*/	2257	*/
2221
2222	int reduction_dir[SIZEOFFREE][3] = {	2258	int reduction_dir[SIZEOFFREE][3] = {
2223	{0,0,0}, /* 0 */	2259	{0, 0, 0}, /* 0 */
2224	{0,0,0}, /* 1 */	2260	{0, 0, 0}, /* 1 */
2225	{0,0,0}, /* 2 */	2261	{0, 0, 0}, /* 2 */
2226	{0,0,0}, /* 3 */	2262	{0, 0, 0}, /* 3 */
2227	{0,0,0}, /* 4 */	2263	{0, 0, 0}, /* 4 */
2228	{0,0,0}, /* 5 */	2264	{0, 0, 0}, /* 5 */
2229	{0,0,0}, /* 6 */	2265	{0, 0, 0}, /* 6 */
2230	{0,0,0}, /* 7 */	2266	{0, 0, 0}, /* 7 */
2231	{0,0,0}, /* 8 */	2267	{0, 0, 0}, /* 8 */
2232	{8,1,2}, /* 9 */	2268	{8, 1, 2}, /* 9 */
2233	{1,2,-1}, /* 10 */	2269	{1, 2, -1}, /* 10 */
2234	{2,10,12}, /* 11 */	2270	{2, 10, 12}, /* 11 */
2235	{2,3,-1}, /* 12 */	2271	{2, 3, -1}, /* 12 */
2236	{2,3,4}, /* 13 */	2272	{2, 3, 4}, /* 13 */
2237	{3,4,-1}, /* 14 */	2273	{3, 4, -1}, /* 14 */
2238	{4,14,16}, /* 15 */	2274	{4, 14, 16}, /* 15 */
2239	{5,4,-1}, /* 16 */	2275	{5, 4, -1}, /* 16 */
2240	{4,5,6}, /* 17 */	2276	{4, 5, 6}, /* 17 */
2241	{6,5,-1}, /* 18 */	2277	{6, 5, -1}, /* 18 */
2242	{6,20,18}, /* 19 */	2278	{6, 20, 18}, /* 19 */
2243	{7,6,-1}, /* 20 */	2279	{7, 6, -1}, /* 20 */
2244	{6,7,8}, /* 21 */	2280	{6, 7, 8}, /* 21 */
2245	{7,8,-1}, /* 22 */	2281	{7, 8, -1}, /* 22 */
2246	{8,22,24}, /* 23 */	2282	{8, 22, 24}, /* 23 */
2247	{8,1,-1}, /* 24 */	2283	{8, 1, -1}, /* 24 */
2248	{24,9,10}, /* 25 */	2284	{24, 9, 10}, /* 25 */
2249	{9,10,-1}, /* 26 */	2285	{9, 10, -1}, /* 26 */
2250	{10,11,-1}, /* 27 */	2286	{10, 11, -1}, /* 27 */
2251	{27,11,29}, /* 28 */	2287	{27, 11, 29}, /* 28 */
2252	{11,12,-1}, /* 29 */	2288	{11, 12, -1}, /* 29 */
2253	{12,13,-1}, /* 30 */	2289	{12, 13, -1}, /* 30 */
2254	{12,13,14}, /* 31 */	2290	{12, 13, 14}, /* 31 */
2255	{13,14,-1}, /* 32 */	2291	{13, 14, -1}, /* 32 */
2256	{14,15,-1}, /* 33 */	2292	{14, 15, -1}, /* 33 */
2257	{33,15,35}, /* 34 */	2293	{33, 15, 35}, /* 34 */
2258	{16,15,-1}, /* 35 */	2294	{16, 15, -1}, /* 35 */
2259	{17,16,-1}, /* 36 */	2295	{17, 16, -1}, /* 36 */
2260	{18,17,16}, /* 37 */	2296	{18, 17, 16}, /* 37 */
2261	{18,17,-1}, /* 38 */	2297	{18, 17, -1}, /* 38 */
2262	{18,19,-1}, /* 39 */	2298	{18, 19, -1}, /* 39 */
2263	{41,19,39}, /* 40 */	2299	{41, 19, 39}, /* 40 */
2264	{19,20,-1}, /* 41 */	2300	{19, 20, -1}, /* 41 */
2265	{20,21,-1}, /* 42 */	2301	{20, 21, -1}, /* 42 */
2266	{20,21,22}, /* 43 */	2302	{20, 21, 22}, /* 43 */
2267	{21,22,-1}, /* 44 */	2303	{21, 22, -1}, /* 44 */
2268	{23,22,-1}, /* 45 */	2304	{23, 22, -1}, /* 45 */
2269	{45,47,23}, /* 46 */	2305	{45, 47, 23}, /* 46 */
2270	{23,24,-1}, /* 47 */	2306	{23, 24, -1}, /* 47 */
2271	{24,9,-1}}; /* 48 */	2307	{24, 9, -1}
		2308	}; /* 48 */
2272		2309
2273	/* Recursive routine to step back and see if we can	2310	/* Recursive routine to step back and see if we can
2274	* find a path to that monster that we found. If not,	2311	* find a path to that monster that we found. If not,
2275	* we don't bother going toward it. Returns 1 if we	2312	* we don't bother going toward it. Returns 1 if we
2276	* can see a direct way to get it	2313	* can see a direct way to get it
2277	* Modified to be map tile aware -.MSW	2314	* Modified to be map tile aware -.MSW
2278	*/	2315	*/
2279		2316	int
2280
2281	int can_see_monsterP(mapstruct *m, int x, int y,int dir) {	2317	can_see_monsterP (maptile *m, int x, int y, int dir)
		2318	{
2282	sint16 dx, dy;	2319	sint16 dx, dy;
2283	int mflags;	2320	int mflags;
2284		2321
		2322	if (dir < 0)
2285	if(dir<0) return 0; /* exit condition: invalid direction */	2323	return 0; /* exit condition: invalid direction */
2286		2324
2287	dx = x + freearr_x[dir];	2325	dx = x + freearr_x[dir];
2288	dy = y + freearr_y[dir];	2326	dy = y + freearr_y[dir];
2289		2327
2290	mflags = get_map_flags(m, &m, dx, dy, &dx, &dy);	2328	mflags = get_map_flags (m, &m, dx, dy, &dx, &dy);
2291		2329
2292	/* This functional arguably was incorrect before - it was	2330	/* This functional arguably was incorrect before - it was
2293	* checking for P_WALL - that was basically seeing if	2331	* checking for P_WALL - that was basically seeing if
2294	* we could move to the monster - this is being more	2332	* we could move to the monster - this is being more
2295	* literal on if we can see it. To know if we can actually	2333	* literal on if we can see it. To know if we can actually
2296	* move to the monster, we'd need the monster passed in or	2334	* move to the monster, we'd need the monster passed in or
2297	* at least its move type.	2335	* at least its move type.
2298	*/	2336	*/
2299	if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW)) return 0;	2337	if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW))
		2338	return 0;
2300		2339
2301	/* yes, can see. */	2340	/* yes, can see. */
2302	if(dir < 9) return 1;	2341	if (dir < 9)
		2342	return 1;
		2343
2303	return can_see_monsterP(m, x, y, reduction_dir[dir][0]) |	2344	return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2304	can_see_monsterP(m,x,y, reduction_dir[dir][1]) |	2345	| can_see_monsterP (m, x, y, reduction_dir[dir][1])
2305	can_see_monsterP(m,x,y, reduction_dir[dir][2]);	2346	| can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2306	}	2347	}
2307		2348
2308
2309
2310	/*	2349	/*
2311	* can_pick(picker, item): finds out if an object is possible to be	2350	* can_pick(picker, item): finds out if an object is possible to be
2312	* picked up by the picker. Returnes 1 if it can be	2351	* picked up by the picker. Returnes 1 if it can be
2313	* picked up, otherwise 0.	2352	* picked up, otherwise 0.
2314	*	2353	*
…		…
2316	* core dumps if they do.	2355	* core dumps if they do.
2317	*	2356	*
2318	* Add a check so we can't pick up invisible objects (0.93.8)	2357	* Add a check so we can't pick up invisible objects (0.93.8)
2319	*/	2358	*/
2320		2359
		2360	int
2321	int can_pick(const object *who, const object *item) {	2361	can_pick (const object *who, const object *item)
		2362	{
2322	return /*QUERY_FLAG(who,FLAG_WIZ)||*/	2363	return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2323	(item->weight>0&&!QUERY_FLAG(item,FLAG_NO_PICK)&&	2364	(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2324	!QUERY_FLAG(item,FLAG_ALIVE)&&!item->invisible &&	2365	!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2325	(who->type==PLAYER||item->weight<who->weight/3));
2326	}	2366	}
2327
2328		2367
2329	/*	2368	/*
2330	* create clone from object to another	2369	* create clone from object to another
2331	*/	2370	*/
		2371	object *
2332	object *object_create_clone (object *asrc) {	2372	object_create_clone (object *asrc)
		2373	{
2333	object *dst = NULL,*tmp,*src,*part,*prev, *item;	2374	object *dst = 0, *tmp, *src, *part, *prev, *item;
2334		2375
2335	if(!asrc) return NULL;	2376	if (!asrc)
		2377	return 0;
		2378
2336	src = asrc;	2379	src = asrc;
2337	if(src->head)	2380	if (src->head)
2338	src = src->head;	2381	src = src->head;
2339		2382
2340	prev = NULL;	2383	prev = 0;
2341	for(part = src; part; part = part->more) {	2384	for (part = src; part; part = part->more)
2342	tmp = get_object();	2385	{
2343	copy_object(part,tmp);	2386	tmp = part->clone ();
2344	tmp->x -= src->x;	2387	tmp->x -= src->x;
2345	tmp->y -= src->y;	2388	tmp->y -= src->y;
		2389
2346	if(!part->head) {	2390	if (!part->head)
		2391	{
2347	dst = tmp;	2392	dst = tmp;
2348	tmp->head = NULL;
2349	} else {
2350	tmp->head = dst;	2393	tmp->head = 0;
2351	}	2394	}
		2395	else
		2396	tmp->head = dst;
		2397
2352	tmp->more = NULL;	2398	tmp->more = 0;
		2399
2353	if(prev)	2400	if (prev)
2354	prev->more = tmp;	2401	prev->more = tmp;
		2402
2355	prev = tmp;	2403	prev = tmp;
2356	}	2404	}
2357	/*** copy inventory ***/	2405
2358	for(item = src->inv; item; item = item->below) {	2406	for (item = src->inv; item; item = item->below)
2359	(void) insert_ob_in_ob(object_create_clone(item),dst);	2407	insert_ob_in_ob (object_create_clone (item), dst);
2360	}
2361		2408
2362	return dst;	2409	return dst;
2363	}
2364
2365	/* return true if the object was destroyed, 0 otherwise */
2366	int was_destroyed (const object *op, tag_t old_tag)
2367	{
2368	/* checking for FLAG_FREED isn't necessary, but makes this function more
2369	* robust */
2370	return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);
2371	}	2410	}
2372		2411
2373	/* GROS - Creates an object using a string representing its content. */	2412	/* GROS - Creates an object using a string representing its content. */
2374	/* Basically, we save the content of the string to a temp file, then call */	2413	/* Basically, we save the content of the string to a temp file, then call */
2375	/* load_object on it. I admit it is a highly inefficient way to make things, */	2414	/* load_object on it. I admit it is a highly inefficient way to make things, */
2376	/* but it was simple to make and allows reusing the load_object function. */	2415	/* but it was simple to make and allows reusing the load_object function. */
2377	/* Remember not to use load_object_str in a time-critical situation. */	2416	/* Remember not to use load_object_str in a time-critical situation. */
2378	/* Also remember that multiparts objects are not supported for now. */	2417	/* Also remember that multiparts objects are not supported for now. */
2379		2418	object *
2380	object* load_object_str(const char *obstr)	2419	load_object_str (const char *obstr)
2381	{	2420	{
2382	object *op;	2421	object *op;
2383	char filename[MAX_BUF];	2422	char filename[MAX_BUF];
		2423
2384	sprintf(filename,"%s/cfloadobstr2044",settings.tmpdir);	2424	sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2385		2425
2386	FILE *tempfile=fopen(filename,"w");	2426	FILE *tempfile = fopen (filename, "w");
		2427
2387	if (tempfile == NULL)	2428	if (tempfile == NULL)
2388	{	2429	{
2389	LOG(llevError,"Error - Unable to access load object temp file\n");	2430	LOG (llevError, "Error - Unable to access load object temp file\n");
2390	return NULL;	2431	return NULL;
2391	};	2432	}
		2433
2392	fprintf(tempfile,obstr);	2434	fprintf (tempfile, obstr);
2393	fclose(tempfile);	2435	fclose (tempfile);
2394		2436
2395	op=get_object();	2437	op = object::create ();
2396		2438
2397	object_thawer thawer (filename);	2439	object_thawer thawer (filename);
2398		2440
2399	if (thawer)	2441	if (thawer)
2400	load_object(thawer,op,0);	2442	load_object (thawer, op, 0);
2401		2443
2402	LOG(llevDebug," load str completed, object=%s\n", &op->name);	2444	LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2403	CLEAR_FLAG(op,FLAG_REMOVED);	2445	CLEAR_FLAG (op, FLAG_REMOVED);
2404		2446
2405	return op;	2447	return op;
2406	}	2448	}
2407		2449
2408	/* This returns the first object in who's inventory that	2450	/* This returns the first object in who's inventory that
2409	* has the same type and subtype match.	2451	* has the same type and subtype match.
2410	* returns NULL if no match.	2452	* returns NULL if no match.
2411	*/	2453	*/
		2454	object *
2412	object *find_obj_by_type_subtype(const object *who, int type, int subtype)	2455	find_obj_by_type_subtype (const object *who, int type, int subtype)
2413	{	2456	{
2414	object *tmp;
2415
2416	for (tmp=who->inv; tmp; tmp=tmp->below)	2457	for (object *tmp = who->inv; tmp; tmp = tmp->below)
2417	if (tmp->type == type && tmp->subtype == subtype) return tmp;	2458	if (tmp->type == type && tmp->subtype == subtype)
		2459	return tmp;
2418		2460
2419	return NULL;	2461	return 0;
2420	}	2462	}
2421		2463
2422	/* If ob has a field named key, return the link from the list,	2464	/* If ob has a field named key, return the link from the list,
2423	* otherwise return NULL.	2465	* otherwise return NULL.
2424	*	2466	*
2425	* key must be a passed in shared string - otherwise, this won't	2467	* key must be a passed in shared string - otherwise, this won't
2426	* do the desired thing.	2468	* do the desired thing.
2427	*/	2469	*/
		2470	key_value *
2428	key_value * get_ob_key_link(const object * ob, const char * key) {	2471	get_ob_key_link (const object *ob, const char *key)
2429	key_value * link;	2472	{
2430
2431	for (link = ob->key_values; link != NULL; link = link->next) {	2473	for (key_value *link = ob->key_values; link; link = link->next)
2432	if (link->key == key) {	2474	if (link->key == key)
2433	return link;	2475	return link;
2434	}	2476
2435	}	2477	return 0;
2436		2478	}
2437	return NULL;
2438	}
2439		2479
2440	/*	2480	/*
2441	* Returns the value of op has an extra_field for key, or NULL.	2481	* Returns the value of op has an extra_field for key, or NULL.
2442	*	2482	*
2443	* The argument doesn't need to be a shared string.	2483	* The argument doesn't need to be a shared string.
2444	*	2484	*
2445	* The returned string is shared.	2485	* The returned string is shared.
2446	*/	2486	*/
		2487	const char *
2447	const char * get_ob_key_value(const object * op, const char * const key) {	2488	get_ob_key_value (const object *op, const char *const key)
		2489	{
2448	key_value * link;	2490	key_value *link;
2449	const char * canonical_key;	2491	shstr_cmp canonical_key (key);
		2492
		2493	if (!canonical_key)
2450		2494	{
2451	canonical_key = shstr::find (key);
2452
2453	if (canonical_key == NULL) {
2454	/* 1. There being a field named key on any object	2495	/* 1. There being a field named key on any object
2455	* implies there'd be a shared string to find.	2496	* implies there'd be a shared string to find.
2456	* 2. Since there isn't, no object has this field.	2497	* 2. Since there isn't, no object has this field.
2457	* 3. Therefore, *this* object doesn't have this field.	2498	* 3. Therefore, *this* object doesn't have this field.
2458	*/	2499	*/
2459	return NULL;	2500	return 0;
2460	}	2501	}
2461		2502
2462	/* This is copied from get_ob_key_link() above -	2503	/* This is copied from get_ob_key_link() above -
2463	* only 4 lines, and saves the function call overhead.	2504	* only 4 lines, and saves the function call overhead.
2464	*/	2505	*/
2465	for (link = op->key_values; link != NULL; link = link->next) {	2506	for (link = op->key_values; link; link = link->next)
2466	if (link->key == canonical_key) {	2507	if (link->key == canonical_key)
2467	return link->value;	2508	return link->value;
2468	}	2509
2469	}	2510	return 0;
2470	return NULL;
2471	}	2511	}
2472		2512
2473		2513
2474	/*	2514	/*
2475	* Updates the canonical_key in op to value.	2515	* Updates the canonical_key in op to value.
…		…
2479	* Unless add_key is TRUE, it won't add fields, only change the value of existing	2519	* Unless add_key is TRUE, it won't add fields, only change the value of existing
2480	* keys.	2520	* keys.
2481	*	2521	*
2482	* Returns TRUE on success.	2522	* Returns TRUE on success.
2483	*/	2523	*/
		2524	int
2484	int set_ob_key_value_s(object * op, const shstr &canonical_key, const char * value, int add_key) {	2525	set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
		2526	{
2485	key_value * field = NULL, *last=NULL;	2527	key_value *field = NULL, *last = NULL;
2486		2528
2487	for (field=op->key_values; field != NULL; field=field->next) {	2529	for (field = op->key_values; field != NULL; field = field->next)
		2530	{
2488	if (field->key != canonical_key) {	2531	if (field->key != canonical_key)
		2532	{
2489	last = field;	2533	last = field;
2490	continue;	2534	continue;
2491	}	2535	}
2492		2536
2493	if (value)	2537	if (value)
2494	field->value = value;	2538	field->value = value;
2495	else {	2539	else
		2540	{
2496	/* Basically, if the archetype has this key set,	2541	/* Basically, if the archetype has this key set,
2497	* we need to store the null value so when we save	2542	* we need to store the null value so when we save
2498	* it, we save the empty value so that when we load,	2543	* it, we save the empty value so that when we load,
2499	* we get this value back again.	2544	* we get this value back again.
2500	*/	2545	*/
2501	if (get_ob_key_link (&op->arch->clone, canonical_key))	2546	if (get_ob_key_link (&op->arch->clone, canonical_key))
2502	field->value = 0;	2547	field->value = 0;
		2548	else
		2549	{
		2550	if (last)
		2551	last->next = field->next;
2503	else	2552	else
2504	{
2505	if (last) last->next = field->next;
2506	else op->key_values = field->next;	2553	op->key_values = field->next;
2507		2554
2508	delete field;	2555	delete field;
2509	}	2556	}
2510	}	2557	}
2511	return TRUE;	2558	return TRUE;
2512	}	2559	}
2513	/* IF we get here, key doesn't exist */	2560	/* IF we get here, key doesn't exist */
2514		2561
2515	/* No field, we'll have to add it. */	2562	/* No field, we'll have to add it. */
2516		2563
2517	if (!add_key) {	2564	if (!add_key)
2518	return FALSE;	2565	return FALSE;
2519	}	2566
2520	/* There isn't any good reason to store a null	2567	/* There isn't any good reason to store a null
2521	* value in the key/value list. If the archetype has	2568	* value in the key/value list. If the archetype has
2522	* this key, then we should also have it, so shouldn't	2569	* this key, then we should also have it, so shouldn't
2523	* be here. If user wants to store empty strings,	2570	* be here. If user wants to store empty strings,
2524	* should pass in ""	2571	* should pass in ""
2525	*/	2572	*/
2526	if (value == NULL) return TRUE;	2573	if (value == NULL)
2527
2528	field = new key_value;
2529
2530	field->key = canonical_key;
2531	field->value = value;
2532	/* Usual prepend-addition. */
2533	field->next = op->key_values;
2534	op->key_values = field;
2535
2536	return TRUE;	2574	return TRUE;
		2575
		2576	field = new key_value;
		2577
		2578	field->key = canonical_key;
		2579	field->value = value;
		2580	/* Usual prepend-addition. */
		2581	field->next = op->key_values;
		2582	op->key_values = field;
		2583
		2584	return TRUE;
2537	}	2585	}
2538		2586
2539	/*	2587	/*
2540	* Updates the key in op to value.	2588	* Updates the key in op to value.
2541	*	2589	*
…		…
2543	* and not add new ones.	2591	* and not add new ones.
2544	* In general, should be little reason FALSE is ever passed in for add_key	2592	* In general, should be little reason FALSE is ever passed in for add_key
2545	*	2593	*
2546	* Returns TRUE on success.	2594	* Returns TRUE on success.
2547	*/	2595	*/
		2596	int
2548	int set_ob_key_value(object * op, const char *key, const char * value, int add_key)	2597	set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2549	{	2598	{
2550	shstr key_ (key);	2599	shstr key_ (key);
		2600
2551	return set_ob_key_value_s (op, key_, value, add_key);	2601	return set_ob_key_value_s (op, key_, value, add_key);
2552	}	2602	}
		2603
		2604	object::depth_iterator::depth_iterator (object *container)
		2605	: iterator_base (container)
		2606	{
		2607	while (item->inv)
		2608	item = item->inv;
		2609	}
		2610
		2611	void
		2612	object::depth_iterator::next ()
		2613	{
		2614	if (item->below)
		2615	{
		2616	item = item->below;
		2617
		2618	while (item->inv)
		2619	item = item->inv;
		2620	}
		2621	else
		2622	item = item->env;
		2623	}
		2624
		2625	// return a suitable string describing an objetc in enough detail to find it
		2626	const char *
		2627	object::debug_desc (char *info) const
		2628	{
		2629	char info2[256 * 3];
		2630	char *p = info;
		2631
		2632	p += snprintf (p, 256, "%d=\"%s%s%s\"",
		2633	count,
		2634	&name,
		2635	title ? " " : "",
		2636	title ? (const char *)title : "");
		2637
		2638	if (env)
		2639	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
		2640
		2641	if (map)
		2642	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);
		2643
		2644	return info;
		2645	}
		2646
		2647	const char *
		2648	object::debug_desc () const
		2649	{
		2650	static char info[256 * 3];
		2651	return debug_desc (info);
		2652	}
		2653

Diff Legend

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