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.19 by root, Fri Sep 8 17:14:07 2006 UTC vs.
Revision 1.110 by root, Sun Jan 7 23:12:03 2007 UTC

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

Diff Legend

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