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.30 by root, Mon Sep 11 20:28:37 2006 UTC vs.
Revision 1.86 by root, Tue Dec 26 08:17:58 2006 UTC

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

Diff Legend

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