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.6 by root, Mon Aug 28 14:05:23 2006 UTC vs.
Revision 1.9 by root, Wed Aug 30 06:06:26 2006 UTC

1	/*	1	/*
2	* static char *rcsid_object_c =	2	* static char *rcsid_object_c =
3	* "$Id: object.C,v 1.6 2006/08/28 14:05:23 root Exp $";	3	* "$Id: object.C,v 1.9 2006/08/30 06:06:26 root Exp $";
4	*/	4	*/
5		5
6	/*	6	/*
7	CrossFire, A Multiplayer game for X-windows	7	CrossFire, A Multiplayer game for X-windows
8		8
…		…
132	/* Note sure why the following is the case - either the object has to	132	/* Note sure why the following is the case - either the object has to
133	* be animated or have a very low speed. Is this an attempted monster	133	* be animated or have a very low speed. Is this an attempted monster
134	* check?	134	* check?
135	*/	135	*/
136	if (!QUERY_FLAG(ob1,FLAG_ANIMATE) && FABS((ob1)->speed) > MIN_ACTIVE_SPEED)	136	if (!QUERY_FLAG(ob1,FLAG_ANIMATE) && FABS((ob1)->speed) > MIN_ACTIVE_SPEED)
137	return 0;	137	return 0;
138		138
139	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that	139	/* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
140	* value could not be stored in a sint32 (which unfortunately sometimes is	140	* value could not be stored in a sint32 (which unfortunately sometimes is
141	* used to store nrof).	141	* used to store nrof).
142	*/	142	*/
143	if (ob1->nrof+ob2->nrof >= 1UL<<31)	143	if (ob1->nrof+ob2->nrof >= 1UL<<31)
144	return 0;	144	return 0;
145		145
146	/* This is really a spellbook check - really, we should	146	/* This is really a spellbook check - really, we should
147	* check all objects in the inventory.	147	* check all objects in the inventory.
148	*/	148	*/
149	if (ob1->inv || ob2->inv) {	149	if (ob1->inv || ob2->inv) {
150	/* if one object has inventory but the other doesn't, not equiv */	150	/* if one object has inventory but the other doesn't, not equiv */
151	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) return 0;	151	if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) return 0;
152		152
153	/* Now check to see if the two inventory objects could merge */	153	/* Now check to see if the two inventory objects could merge */
154	if (!CAN_MERGE(ob1->inv, ob2->inv)) return 0;	154	if (!CAN_MERGE(ob1->inv, ob2->inv)) return 0;
155		155
156	/* inventory ok - still need to check rest of this object to see	156	/* inventory ok - still need to check rest of this object to see
157	* if it is valid.	157	* if it is valid.
158	*/	158	*/
159	}	159	}
160		160
161	/* If the objects have been identified, set the BEEN_APPLIED flag.	161	/* If the objects have been identified, set the BEEN_APPLIED flag.
162	* This is to the comparison of the flags below will be OK. We	162	* This is to the comparison of the flags below will be OK. We
163	* just can't ignore the been applied or identified flags, as they	163	* just can't ignore the been applied or identified flags, as they
164	* are not equal - just if it has been identified, the been_applied	164	* are not equal - just if it has been identified, the been_applied
165	* flags lose any meaning.	165	* flags lose any meaning.
166	*/	166	*/
167	if (QUERY_FLAG(ob1, FLAG_IDENTIFIED))	167	if (QUERY_FLAG(ob1, FLAG_IDENTIFIED))
168	SET_FLAG(ob1, FLAG_BEEN_APPLIED);	168	SET_FLAG(ob1, FLAG_BEEN_APPLIED);
169		169
170	if (QUERY_FLAG(ob2, FLAG_IDENTIFIED))	170	if (QUERY_FLAG(ob2, FLAG_IDENTIFIED))
171	SET_FLAG(ob2, FLAG_BEEN_APPLIED);	171	SET_FLAG(ob2, FLAG_BEEN_APPLIED);
172		172
173		173
174	/* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something	174	/* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something
175	* being locked in inventory should prevent merging.	175	* being locked in inventory should prevent merging.
176	* 0x4 in flags3 is CLIENT_SENT	176	* 0x4 in flags3 is CLIENT_SENT
177	*/	177	*/
178	if ((ob1->arch != ob2->arch) ||	178	if ((ob1->arch != ob2->arch) ||
179	(ob1->flags[0] != ob2->flags[0]) ||	179	(ob1->flags[0] != ob2->flags[0]) ||
180	(ob1->flags[1] != ob2->flags[1]) ||	180	(ob1->flags[1] != ob2->flags[1]) ||
181	((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~ 0x400000)) ||	181	((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~ 0x400000)) ||
182	((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||	182	((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
183	(ob1->name != ob2->name) ||	183	(ob1->name != ob2->name) ||
184	(ob1->title != ob2->title) ||	184	(ob1->title != ob2->title) ||
185	(ob1->msg != ob2->msg) ||	185	(ob1->msg != ob2->msg) ||
186	(ob1->weight != ob2->weight) ||	186	(ob1->weight != ob2->weight) ||
187	(memcmp(&ob1->resist, &ob2->resist, sizeof(ob1->resist))!=0) ||	187	(memcmp(&ob1->resist, &ob2->resist, sizeof(ob1->resist))!=0) ||
188	(memcmp(&ob1->stats, &ob2->stats, sizeof(ob1->stats))!=0) ||	188	(memcmp(&ob1->stats, &ob2->stats, sizeof(ob1->stats))!=0) ||
189	(ob1->attacktype != ob2->attacktype) ||	189	(ob1->attacktype != ob2->attacktype) ||
190	(ob1->magic != ob2->magic) ||	190	(ob1->magic != ob2->magic) ||
191	(ob1->slaying != ob2->slaying) ||	191	(ob1->slaying != ob2->slaying) ||
192	(ob1->skill != ob2->skill) ||	192	(ob1->skill != ob2->skill) ||
193	(ob1->value != ob2->value) ||	193	(ob1->value != ob2->value) ||
194	(ob1->animation_id != ob2->animation_id) ||	194	(ob1->animation_id != ob2->animation_id) ||
195	(ob1->client_type != ob2->client_type) ||	195	(ob1->client_type != ob2->client_type) ||
196	(ob1->materialname != ob2->materialname) ||	196	(ob1->materialname != ob2->materialname) ||
197	(ob1->lore != ob2->lore) ||	197	(ob1->lore != ob2->lore) ||
198	(ob1->subtype != ob2->subtype) ||	198	(ob1->subtype != ob2->subtype) ||
199	(ob1->move_type != ob2->move_type) ||	199	(ob1->move_type != ob2->move_type) ||
200	(ob1->move_block != ob2->move_block) ||	200	(ob1->move_block != ob2->move_block) ||
201	(ob1->move_allow != ob2->move_allow) ||	201	(ob1->move_allow != ob2->move_allow) ||
202	(ob1->move_on != ob2->move_on) ||	202	(ob1->move_on != ob2->move_on) ||
203	(ob1->move_off != ob2->move_off) ||	203	(ob1->move_off != ob2->move_off) ||
204	(ob1->move_slow != ob2->move_slow) ||	204	(ob1->move_slow != ob2->move_slow) ||
205	(ob1->move_slow_penalty != ob2->move_slow_penalty)	205	(ob1->move_slow_penalty != ob2->move_slow_penalty)
206	)	206	)
207	return 0;	207	return 0;
208		208
209	/* Don't merge objects that are applied. With the new 'body' code,	209	/* Don't merge objects that are applied. With the new 'body' code,
210	* it is possible for most any character to have more than one of	210	* it is possible for most any character to have more than one of
211	* some items equipped, and we don't want those to merge.	211	* some items equipped, and we don't want those to merge.
212	*/	212	*/
213	if (QUERY_FLAG(ob1, FLAG_APPLIED) || QUERY_FLAG(ob2, FLAG_APPLIED))	213	if (QUERY_FLAG(ob1, FLAG_APPLIED) || QUERY_FLAG(ob2, FLAG_APPLIED))
214	return 0;	214	return 0;
215		215
216	switch (ob1->type) {	216	switch (ob1->type) {
217	case SCROLL:	217	case SCROLL:
218	if (ob1->level != ob2->level) return 0;	218	if (ob1->level != ob2->level) return 0;
219	break;	219	break;
220		220
221	}	221	}
222	if (ob1->key_values != NULL || ob2->key_values != NULL) {	222	if (ob1->key_values != NULL || ob2->key_values != NULL) {
223	/* At least one of these has key_values. */	223	/* At least one of these has key_values. */
224	if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) {	224	if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) {
…		…
241	signed long sum_weight(object *op) {	241	signed long sum_weight(object *op) {
242	signed long sum;	242	signed long sum;
243	object *inv;	243	object *inv;
244	for(sum = 0, inv = op->inv; inv != NULL; inv = inv->below) {	244	for(sum = 0, inv = op->inv; inv != NULL; inv = inv->below) {
245	if (inv->inv)	245	if (inv->inv)
246	sum_weight(inv);	246	sum_weight(inv);
247	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);	247	sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
248	}	248	}
249	if (op->type == CONTAINER && op->stats.Str)	249	if (op->type == CONTAINER && op->stats.Str)
250	sum = (sum * (100 - op->stats.Str))/100;	250	sum = (sum * (100 - op->stats.Str))/100;
251	if(op->carrying != sum)	251	if(op->carrying != sum)
…		…
270	*/	270	*/
271		271
272	object *is_player_inv (object *op) {	272	object *is_player_inv (object *op) {
273	for (;op!=NULL&&op->type!=PLAYER; op=op->env)	273	for (;op!=NULL&&op->type!=PLAYER; op=op->env)
274	if (op->env==op)	274	if (op->env==op)
275	op->env = NULL;	275	op->env = NULL;
276	return op;	276	return op;
277	}	277	}
278		278
279	/*	279	/*
280	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.	280	* Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
…		…
289	if(op->arch!=NULL) {	289	if(op->arch!=NULL) {
290	strcat(errmsg,"arch ");	290	strcat(errmsg,"arch ");
291	strcat(errmsg,op->arch->name?op->arch->name:"(null)");	291	strcat(errmsg,op->arch->name?op->arch->name:"(null)");
292	strcat(errmsg,"\n");	292	strcat(errmsg,"\n");
293	if((cp=get_ob_diff(op,&empty_archetype->clone))!=NULL)	293	if((cp=get_ob_diff(op,&empty_archetype->clone))!=NULL)
294	strcat(errmsg,cp);	294	strcat(errmsg,cp);
295	#if 0	295	#if 0
296	/* Don't dump player diffs - they are too long, mostly meaningless, and	296	/* Don't dump player diffs - they are too long, mostly meaningless, and
297	* will overflow the buffer.	297	* will overflow the buffer.
298	* Changed so that we don't dump inventory either. This may	298	* Changed so that we don't dump inventory either. This may
299	* also overflow the buffer.	299	* also overflow the buffer.
…		…
428	void free_all_object_data(void) {	428	void free_all_object_data(void) {
429	#ifdef MEMORY_DEBUG	429	#ifdef MEMORY_DEBUG
430	object *op, *next;	430	object *op, *next;
431		431
432	for (op=free_objects; op!=NULL; ) {	432	for (op=free_objects; op!=NULL; ) {
433	next=op->next;	433	next=op->next;
434	free(op);	434	free(op);
435	nrofallocobjects--;	435	nrofallocobjects--;
436	nroffreeobjects--;	436	nroffreeobjects--;
437	op=next;	437	op=next;
438	}	438	}
439	#endif	439	#endif
440	LOG(llevDebug,"%d allocated objects, %d free objects, STARMAX=%d\n",	440	LOG(llevDebug,"%d allocated objects, %d free objects, STARMAX=%d\n",
441	nrofallocobjects, nroffreeobjects,STARTMAX);	441	nrofallocobjects, nroffreeobjects,STARTMAX);
442	}	442	}
443		443
444	/*	444	/*
445	* Returns the object which this object marks as being the owner.	445	* Returns the object which this object marks as being the owner.
446	* A id-scheme is used to avoid pointing to objects which have been	446	* A id-scheme is used to avoid pointing to objects which have been
…		…
452	* anything - once an object is removed, it is basically dead anyways.	452	* anything - once an object is removed, it is basically dead anyways.
453	*/	453	*/
454		454
455	object *get_owner(object *op) {	455	object *get_owner(object *op) {
456	if(op->owner==NULL)	456	if(op->owner==NULL)
457	return NULL;	457	return NULL;
458		458
459	if (!QUERY_FLAG(op->owner,FLAG_FREED) && !QUERY_FLAG(op->owner, FLAG_REMOVED) &&	459	if (!QUERY_FLAG(op->owner,FLAG_FREED) && !QUERY_FLAG(op->owner, FLAG_REMOVED) &&
460	op->owner->count==op->ownercount)	460	op->owner->count==op->ownercount)
461	return op->owner;	461	return op->owner;
462		462
463	op->owner=NULL;	463	op->owner=NULL;
464	op->ownercount=0;	464	op->ownercount=0;
465	return NULL;	465	return NULL;
466	}	466	}
…		…
468	void clear_owner(object *op)	468	void clear_owner(object *op)
469	{	469	{
470	if (!op) return;	470	if (!op) return;
471		471
472	if (op->owner && op->ownercount == op->owner->count)	472	if (op->owner && op->ownercount == op->owner->count)
473	op->owner->refcount--;	473	op->owner->refcount--;
474		474
475	op->owner = NULL;	475	op->owner = NULL;
476	op->ownercount = 0;	476	op->ownercount = 0;
477	}	477	}
478		478
…		…
483	* skill and experience objects.	483	* skill and experience objects.
484	*/	484	*/
485	void set_owner (object *op, object *owner)	485	void set_owner (object *op, object *owner)
486	{	486	{
487	if(owner==NULL||op==NULL)	487	if(owner==NULL||op==NULL)
488	return;	488	return;
489		489
490	/* next line added to allow objects which own objects */	490	/* next line added to allow objects which own objects */
491	/* Add a check for ownercounts in here, as I got into an endless loop	491	/* Add a check for ownercounts in here, as I got into an endless loop
492	* with the fireball owning a poison cloud which then owned the	492	* with the fireball owning a poison cloud which then owned the
493	* fireball. I believe that was caused by one of the objects getting	493	* fireball. I believe that was caused by one of the objects getting
494	* freed and then another object replacing it. Since the ownercounts	494	* freed and then another object replacing it. Since the ownercounts
495	* didn't match, this check is valid and I believe that cause is valid.	495	* didn't match, this check is valid and I believe that cause is valid.
496	*/	496	*/
497	while (owner->owner && owner!=owner->owner &&	497	while (owner->owner && owner!=owner->owner &&
498	owner->ownercount==owner->owner->count) owner=owner->owner;	498	owner->ownercount==owner->owner->count) owner=owner->owner;
499		499
500	/* IF the owner still has an owner, we did not resolve to a final owner.	500	/* IF the owner still has an owner, we did not resolve to a final owner.
501	* so lets not add to that.	501	* so lets not add to that.
502	*/	502	*/
503	if (owner->owner) return;	503	if (owner->owner) return;
…		…
521	*/	521	*/
522	void copy_owner (object *op, object *clone)	522	void copy_owner (object *op, object *clone)
523	{	523	{
524	object *owner = get_owner (clone);	524	object *owner = get_owner (clone);
525	if (owner == NULL) {	525	if (owner == NULL) {
526	/* players don't have owners - they own themselves. Update	526	/* players don't have owners - they own themselves. Update
527	* as appropriate.	527	* as appropriate.
528	*/	528	*/
529	if (clone->type == PLAYER) owner=clone;	529	if (clone->type == PLAYER) owner=clone;
530	else return;	530	else return;
531	}	531	}
532	set_owner(op, owner);	532	set_owner(op, owner);
533		533
534	}	534	}
535		535
…		…
546	op->slaying = NULL;	546	op->slaying = NULL;
547	op->skill = NULL;	547	op->skill = NULL;
548	op->msg = NULL;	548	op->msg = NULL;
549	op->materialname = NULL;	549	op->materialname = NULL;
550	op->lore = NULL;	550	op->lore = NULL;
551	op->current_weapon_script = NULL;
552	clear_object(op);	551	clear_object(op);
553	}	552	}
554		553
555	/* Zero the key_values on op, decrementing the shared-string	554	/* Zero the key_values on op, decrementing the shared-string
556	* refcounts and freeing the links.	555	* refcounts and freeing the links.
…		…
563		562
564	for (i = op->key_values; i != NULL; i = next) {	563	for (i = op->key_values; i != NULL; i = next) {
565	/* Store next *first*. */	564	/* Store next *first*. */
566	next = i->next;	565	next = i->next;
567		566
568	if (i->key) FREE_AND_CLEAR_STR(i->key);	567	if (i->key) FREE_AND_CLEAR_STR(i->key);
569	if (i->value) FREE_AND_CLEAR_STR(i->value);	568	if (i->value) FREE_AND_CLEAR_STR(i->value);
570	i->next = NULL;	569	i->next = NULL;
571	free(i);	570	free(i);
572	}	571	}
573		572
574	op->key_values = NULL;	573	op->key_values = NULL;
…		…
590	* crashes in the old code. Move this to the top - am	589	* crashes in the old code. Move this to the top - am
591	* seeing periodic crashes in this code, and would like to have	590	* seeing periodic crashes in this code, and would like to have
592	* as much info available as possible (eg, object name).	591	* as much info available as possible (eg, object name).
593	*/	592	*/
594	for (evt = op->events; evt; evt=evt2) {	593	for (evt = op->events; evt; evt=evt2) {
595	evt2 = evt->next;	594	evt2 = evt->next;
596		595
597	if (evt->hook != NULL) FREE_AND_CLEAR_STR(evt->hook);	596	if (evt->hook != NULL) FREE_AND_CLEAR_STR(evt->hook);
598	if (evt->plugin != NULL) FREE_AND_CLEAR_STR(evt->plugin);	597	if (evt->plugin != NULL) FREE_AND_CLEAR_STR(evt->plugin);
599	if (evt->options != NULL) FREE_AND_CLEAR_STR(evt->options);	598	if (evt->options != NULL) FREE_AND_CLEAR_STR(evt->options);
600		599
…		…
643		642
644	op->expmul=1.0;	643	op->expmul=1.0;
645	op->face = blank_face;	644	op->face = blank_face;
646	op->attacked_by_count = (tag_t) -1;	645	op->attacked_by_count = (tag_t) -1;
647	if (settings.casting_time)	646	if (settings.casting_time)
648	op->casting_time = -1;	647	op->casting_time = -1;
649		648
650	}	649	}
651		650
652	/*	651	/*
653	* copy object first frees everything allocated by the second object,	652	* copy object first frees everything allocated by the second object,
…		…
677	if(op->materialname != NULL) free_string(op->materialname);	676	if(op->materialname != NULL) free_string(op->materialname);
678	if(op->custom_name != NULL) free_string(op->custom_name);	677	if(op->custom_name != NULL) free_string(op->custom_name);
679		678
680	/* Basically, same code as from clear_object() */	679	/* Basically, same code as from clear_object() */
681	for (evt = op->events; evt; evt=evt2) {	680	for (evt = op->events; evt; evt=evt2) {
682	evt2 = evt->next;	681	evt2 = evt->next;
683		682
684	if (evt->hook != NULL) FREE_AND_CLEAR_STR(evt->hook);	683	if (evt->hook != NULL) FREE_AND_CLEAR_STR(evt->hook);
685	if (evt->plugin != NULL) FREE_AND_CLEAR_STR(evt->plugin);	684	if (evt->plugin != NULL) FREE_AND_CLEAR_STR(evt->plugin);
686	if (evt->options != NULL) FREE_AND_CLEAR_STR(evt->options);	685	if (evt->options != NULL) FREE_AND_CLEAR_STR(evt->options);
687		686
688	free(evt);	687	free(evt);
689	}	688	}
690	op->events = NULL;	689	op->events = NULL;
691		690
692	free_key_values(op);	691	free_key_values(op);
693		692
…		…
706	if(op->msg!=NULL) add_refcount(op->msg);	705	if(op->msg!=NULL) add_refcount(op->msg);
707	if(op->custom_name!=NULL) add_refcount(op->custom_name);	706	if(op->custom_name!=NULL) add_refcount(op->custom_name);
708	if (op->materialname != NULL) add_refcount(op->materialname);	707	if (op->materialname != NULL) add_refcount(op->materialname);
709		708
710	if((op2->speed<0) && !editor)	709	if((op2->speed<0) && !editor)
711	op->speed_left=op2->speed_left-RANDOM()%200/100.0;	710	op->speed_left=op2->speed_left-RANDOM()%200/100.0;
712		711
713	/* Copy over event information */	712	/* Copy over event information */
714	evt2 = NULL;	713	evt2 = NULL;
715	for (evt = op2->events; evt; evt=evt->next) {	714	for (evt = op2->events; evt; evt=evt->next) {
716	evt_new = (event *) malloc(sizeof(event));	715	evt_new = (event *) malloc(sizeof(event));
717	memcpy(evt_new, evt, sizeof(event));	716	memcpy(evt_new, evt, sizeof(event));
718	if (evt_new->hook) add_refcount(evt_new->hook);	717	if (evt_new->hook) add_refcount(evt_new->hook);
719	if (evt_new->plugin) add_refcount(evt_new->plugin);	718	if (evt_new->plugin) add_refcount(evt_new->plugin);
720	if (evt_new->options) add_refcount(evt_new->options);	719	if (evt_new->options) add_refcount(evt_new->options);
721	evt_new->next = NULL;	720	evt_new->next = NULL;
722		721
723	/* Try to be a little clever here, and store away the	722	/* Try to be a little clever here, and store away the
724	* last event we copied, so that its simpler to update the	723	* last event we copied, so that its simpler to update the
725	* pointer.	724	* pointer.
726	*/	725	*/
727	if (evt2)	726	if (evt2)
728	evt2->next = evt_new;	727	evt2->next = evt_new;
729	else	728	else
730	op->events = evt_new;	729	op->events = evt_new;
731		730
732	evt2 = evt_new;	731	evt2 = evt_new;
733	}	732	}
734	/* Copy over key_values, if any. */	733	/* Copy over key_values, if any. */
735	if (op2->key_values != NULL) {	734	if (op2->key_values != NULL) {
736	key_value * tail = NULL;	735	key_value * tail = NULL;
737	key_value * i;	736	key_value * i;
738		737
739	op->key_values = NULL;	738	op->key_values = NULL;
740		739
741	for (i = op2->key_values; i != NULL; i = i->next) {	740	for (i = op2->key_values; i != NULL; i = i->next) {
742	key_value * new_link = (key_value *) malloc(sizeof(key_value));	741	key_value * new_link = (key_value *) malloc(sizeof(key_value));
743		742
744	new_link->next = NULL;	743	new_link->next = NULL;
745	new_link->key = add_refcount(i->key);	744	new_link->key = add_refcount(i->key);
746	if (i->value)	745	if (i->value)
747	new_link->value = add_refcount(i->value);	746	new_link->value = add_refcount(i->value);
748	else	747	else
749	new_link->value = NULL;	748	new_link->value = NULL;
750		749
751	/* Try and be clever here, too. */	750	/* Try and be clever here, too. */
752	if (op->key_values == NULL) {	751	if (op->key_values == NULL) {
753	op->key_values = new_link;	752	op->key_values = new_link;
754	tail = new_link;	753	tail = new_link;
755	} else {	754	} else {
756	tail->next = new_link;	755	tail->next = new_link;
757	tail = new_link;	756	tail = new_link;
758	}	757	}
759	}	758	}
760	}	759	}
761		760
762	update_ob_speed(op);	761	update_ob_speed(op);
763	}	762	}
764		763
…		…
853	* be called to update the face variable, _and_ how it looks on the map.	852	* be called to update the face variable, _and_ how it looks on the map.
854	*/	853	*/
855		854
856	void update_turn_face(object *op) {	855	void update_turn_face(object *op) {
857	if(!QUERY_FLAG(op,FLAG_IS_TURNABLE)||op->arch==NULL)	856	if(!QUERY_FLAG(op,FLAG_IS_TURNABLE)||op->arch==NULL)
858	return;	857	return;
859	SET_ANIMATION(op, op->direction);	858	SET_ANIMATION(op, op->direction);
860	update_object(op,UP_OBJ_FACE);	859	update_object(op,UP_OBJ_FACE);
861	}	860	}
862		861
863	/*	862	/*
…		…
872	/* No reason putting the archetypes objects on the speed list,	871	/* No reason putting the archetypes objects on the speed list,
873	* since they never really need to be updated.	872	* since they never really need to be updated.
874	*/	873	*/
875		874
876	if (QUERY_FLAG(op, FLAG_FREED) && op->speed) {	875	if (QUERY_FLAG(op, FLAG_FREED) && op->speed) {
877	LOG(llevError,"Object %s is freed but has speed.\n", op->name);	876	LOG(llevError,"Object %s is freed but has speed.\n", op->name);
878	#ifdef MANY_CORES	877	#ifdef MANY_CORES
879	abort();	878	abort();
880	#else	879	#else
881	op->speed = 0;	880	op->speed = 0;
882	#endif	881	#endif
883	}	882	}
884	if (arch_init) {	883	if (arch_init) {
885	return;	884	return;
886	}	885	}
887	if (FABS(op->speed)>MIN_ACTIVE_SPEED) {	886	if (FABS(op->speed)>MIN_ACTIVE_SPEED) {
888	/* If already on active list, don't do anything */	887	/* If already on active list, don't do anything */
889	if (op->active_next || op->active_prev || op==active_objects)	888	if (op->active_next || op->active_prev || op==active_objects)
890	return;	889	return;
891		890
892	/* process_events() expects us to insert the object at the beginning	891	/* process_events() expects us to insert the object at the beginning
893	* of the list. */	892	* of the list. */
894	op->active_next = active_objects;	893	op->active_next = active_objects;
895	if (op->active_next!=NULL)	894	if (op->active_next!=NULL)
896	op->active_next->active_prev = op;	895	op->active_next->active_prev = op;
897	active_objects = op;	896	active_objects = op;
898	}	897	}
899	else {	898	else {
900	/* If not on the active list, nothing needs to be done */	899	/* If not on the active list, nothing needs to be done */
901	if (!op->active_next && !op->active_prev && op!=active_objects)	900	if (!op->active_next && !op->active_prev && op!=active_objects)
902	return;	901	return;
903		902
904	if (op->active_prev==NULL) {	903	if (op->active_prev==NULL) {
905	active_objects = op->active_next;	904	active_objects = op->active_next;
906	if (op->active_next!=NULL)	905	if (op->active_next!=NULL)
907	op->active_next->active_prev = NULL;	906	op->active_next->active_prev = NULL;
908	}	907	}
909	else {	908	else {
910	op->active_prev->active_next = op->active_next;	909	op->active_prev->active_next = op->active_next;
911	if (op->active_next)	910	if (op->active_next)
912	op->active_next->active_prev = op->active_prev;	911	op->active_next->active_prev = op->active_prev;
913	}	912	}
914	op->active_next = NULL;	913	op->active_next = NULL;
915	op->active_prev = NULL;	914	op->active_prev = NULL;
916	}	915	}
917	}	916	}
918		917
919	/* This function removes object 'op' from the list of active	918	/* This function removes object 'op' from the list of active
920	* objects.	919	* objects.
…		…
926	*/	925	*/
927	void remove_from_active_list(object *op)	926	void remove_from_active_list(object *op)
928	{	927	{
929	/* If not on the active list, nothing needs to be done */	928	/* If not on the active list, nothing needs to be done */
930	if (!op->active_next && !op->active_prev && op!=active_objects)	929	if (!op->active_next && !op->active_prev && op!=active_objects)
931	return;	930	return;
932		931
933	if (op->active_prev==NULL) {	932	if (op->active_prev==NULL) {
934	active_objects = op->active_next;	933	active_objects = op->active_next;
935	if (op->active_next!=NULL)	934	if (op->active_next!=NULL)
936	op->active_next->active_prev = NULL;	935	op->active_next->active_prev = NULL;
937	}	936	}
938	else {	937	else {
939	op->active_prev->active_next = op->active_next;	938	op->active_prev->active_next = op->active_next;
940	if (op->active_next)	939	if (op->active_next)
941	op->active_next->active_prev = op->active_prev;	940	op->active_next->active_prev = op->active_prev;
942	}	941	}
943	op->active_next = NULL;	942	op->active_next = NULL;
944	op->active_prev = NULL;	943	op->active_prev = NULL;
945	}	944	}
946		945
…		…
971	MoveType move_on, move_off, move_block, move_slow;	970	MoveType move_on, move_off, move_block, move_slow;
972		971
973	if (op == NULL) {	972	if (op == NULL) {
974	/* this should never happen */	973	/* this should never happen */
975	LOG(llevDebug,"update_object() called for NULL object.\n");	974	LOG(llevDebug,"update_object() called for NULL object.\n");
976	return;	975	return;
977	}	976	}
978		977
979	if(op->env!=NULL) {	978	if(op->env!=NULL) {
980	/* Animation is currently handled by client, so nothing	979	/* Animation is currently handled by client, so nothing
981	* to do in this case.	980	* to do in this case.
982	*/	981	*/
983	return;	982	return;
984	}	983	}
985		984
986	/* If the map is saving, don't do anything as everything is	985	/* If the map is saving, don't do anything as everything is
987	* going to get freed anyways.	986	* going to get freed anyways.
988	*/	987	*/
989	if (!op->map || op->map->in_memory == MAP_SAVING) return;	988	if (!op->map || op->map->in_memory == MAP_SAVING) return;
990		989
991	/* make sure the object is within map boundaries */	990	/* make sure the object is within map boundaries */
992	if (op->x < 0 || op->x >= MAP_WIDTH(op->map) ||	991	if (op->x < 0 || op->x >= MAP_WIDTH(op->map) ||
993	op->y < 0 || op->y >= MAP_HEIGHT(op->map)) {	992	op->y < 0 || op->y >= MAP_HEIGHT(op->map)) {
994	LOG(llevError,"update_object() called for object out of map!\n");	993	LOG(llevError,"update_object() called for object out of map!\n");
995	#ifdef MANY_CORES	994	#ifdef MANY_CORES
996	abort();	995	abort();
997	#endif	996	#endif
998	return;	997	return;
999	}	998	}
1000		999
1001	flags = GET_MAP_FLAGS(op->map, op->x, op->y);	1000	flags = GET_MAP_FLAGS(op->map, op->x, op->y);
1002	SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NEED_UPDATE);	1001	SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NEED_UPDATE);
1003	move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y);	1002	move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y);
…		…
1016	update_now=1;	1015	update_now=1;
1017		1016
1018	if (QUERY_FLAG(op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))	1017	if (QUERY_FLAG(op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
1019	update_now=1;	1018	update_now=1;
1020		1019
1021	if ((move_on | op->move_on) != move_on) update_now=1;	1020	if ((move_on | op->move_on) != move_on) update_now=1;
1022	if ((move_off | op->move_off) != move_off) update_now=1;	1021	if ((move_off | op->move_off) != move_off) update_now=1;
1023	/* This isn't perfect, but I don't expect a lot of objects to	1022	/* This isn't perfect, but I don't expect a lot of objects to
1024	* to have move_allow right now.	1023	* to have move_allow right now.
1025	*/	1024	*/
1026	if (((move_block | op->move_block) & ~op->move_allow) != move_block)	1025	if (((move_block | op->move_block) & ~op->move_allow) != move_block)
1027	update_now=1;	1026	update_now=1;
1028	if ((move_slow | op->move_slow) != move_slow) update_now=1;	1027	if ((move_slow | op->move_slow) != move_slow) update_now=1;
1029	}	1028	}
1030	/* if the object is being removed, we can't make intelligent	1029	/* if the object is being removed, we can't make intelligent
1031	* decisions, because remove_ob can't really pass the object	1030	* decisions, because remove_ob can't really pass the object
1032	* that is being removed.	1031	* that is being removed.
1033	*/	1032	*/
1034	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) {	1033	else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) {
1035	update_now=1;	1034	update_now=1;
1036	} else if (action == UP_OBJ_FACE) {	1035	} else if (action == UP_OBJ_FACE) {
1037	/* Nothing to do for that case */	1036	/* Nothing to do for that case */
1038	}	1037	}
1039	else {	1038	else {
1040	LOG(llevError,"update_object called with invalid action: %d\n", action);	1039	LOG(llevError,"update_object called with invalid action: %d\n", action);
1041	}	1040	}
1042		1041
1043	if (update_now) {	1042	if (update_now) {
1044	SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);	1043	SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
1045	update_position(op->map, op->x, op->y);	1044	update_position(op->map, op->x, op->y);
1046	}	1045	}
1047		1046
1048	if(op->more!=NULL)	1047	if(op->more!=NULL)
1049	update_object(op->more, action);	1048	update_object(op->more, action);
1050	}	1049	}
1051		1050
1052		1051
1053	/*	1052	/*
1054	* free_object() frees everything allocated by an object, removes	1053	* free_object() frees everything allocated by an object, removes
…		…
1068	object *tmp,*op;	1067	object *tmp,*op;
1069		1068
1070	ob->clear ();	1069	ob->clear ();
1071		1070
1072	if (!QUERY_FLAG(ob,FLAG_REMOVED)) {	1071	if (!QUERY_FLAG(ob,FLAG_REMOVED)) {
1073	LOG(llevDebug,"Free object called with non removed object\n");	1072	LOG(llevDebug,"Free object called with non removed object\n");
1074	dump_object(ob);	1073	dump_object(ob);
1075	#ifdef MANY_CORES	1074	#ifdef MANY_CORES
1076	abort();	1075	abort();
1077	#endif	1076	#endif
1078	}	1077	}
1079	if(QUERY_FLAG(ob,FLAG_FRIENDLY)) {	1078	if(QUERY_FLAG(ob,FLAG_FRIENDLY)) {
1080	LOG(llevMonster,"Warning: tried to free friendly object.\n");	1079	LOG(llevMonster,"Warning: tried to free friendly object.\n");
1081	remove_friendly_object(ob);	1080	remove_friendly_object(ob);
1082	}	1081	}
1083	if(QUERY_FLAG(ob,FLAG_FREED)) {	1082	if(QUERY_FLAG(ob,FLAG_FREED)) {
1084	dump_object(ob);	1083	dump_object(ob);
1085	LOG(llevError,"Trying to free freed object.\n%s\n",errmsg);	1084	LOG(llevError,"Trying to free freed object.\n%s\n",errmsg);
1086	return;	1085	return;
1087	}	1086	}
1088	if(ob->more!=NULL) {	1087	if(ob->more!=NULL) {
1089	free_object2(ob->more, free_inventory);	1088	free_object2(ob->more, free_inventory);
1090	ob->more=NULL;	1089	ob->more=NULL;
1091	}	1090	}
1092	if (ob->inv) {	1091	if (ob->inv) {
1093	/* Only if the space blocks everything do we not process -	1092	/* Only if the space blocks everything do we not process -
1094	* if some form of movemnt is allowed, let objects	1093	* if some form of movemnt is allowed, let objects
1095	* drop on that space.	1094	* drop on that space.
1096	*/	1095	*/
1097	if (free_inventory || ob->map==NULL || ob->map->in_memory!=MAP_IN_MEMORY ||	1096	if (free_inventory || ob->map==NULL || ob->map->in_memory!=MAP_IN_MEMORY ||
1098	(GET_MAP_MOVE_BLOCK(ob->map, ob->x, ob->y) == MOVE_ALL))	1097	(GET_MAP_MOVE_BLOCK(ob->map, ob->x, ob->y) == MOVE_ALL))
1099	{	1098	{
1100	op=ob->inv;	1099	op=ob->inv;
1101	while(op!=NULL) {	1100	while(op!=NULL) {
1102	tmp=op->below;	1101	tmp=op->below;
1103	remove_ob(op);	1102	remove_ob(op);
1104	free_object2(op, free_inventory);	1103	free_object2(op, free_inventory);
1105	op=tmp;	1104	op=tmp;
1106	}	1105	}
1107	}	1106	}
1108	else { /* Put objects in inventory onto this space */	1107	else { /* Put objects in inventory onto this space */
1109	op=ob->inv;	1108	op=ob->inv;
1110	while(op!=NULL) {	1109	while(op!=NULL) {
1111	tmp=op->below;	1110	tmp=op->below;
1112	remove_ob(op);	1111	remove_ob(op);
1113	if(QUERY_FLAG(op,FLAG_STARTEQUIP)||QUERY_FLAG(op,FLAG_NO_DROP) ||	1112	if(QUERY_FLAG(op,FLAG_STARTEQUIP)||QUERY_FLAG(op,FLAG_NO_DROP) ||
1114	op->type==RUNE || op->type==TRAP || QUERY_FLAG(op,FLAG_IS_A_TEMPLATE))	1113	op->type==RUNE || op->type==TRAP || QUERY_FLAG(op,FLAG_IS_A_TEMPLATE))
1115	free_object(op);	1114	free_object(op);
1116	else {	1115	else {
1117	op->x=ob->x;	1116	op->x=ob->x;
1118	op->y=ob->y;	1117	op->y=ob->y;
1119	insert_ob_in_map(op,ob->map,NULL,0); /* Insert in same map as the envir */	1118	insert_ob_in_map(op,ob->map,NULL,0); /* Insert in same map as the envir */
1120	}	1119	}
1121	op=tmp;	1120	op=tmp;
1122	}	1121	}
1123	}	1122	}
1124	}	1123	}
1125	/* Remove object from the active list */	1124	/* Remove object from the active list */
1126	ob->speed = 0;	1125	ob->speed = 0;
1127	update_ob_speed(ob);	1126	update_ob_speed(ob);
1128		1127
1129	SET_FLAG(ob, FLAG_FREED);	1128	SET_FLAG(ob, FLAG_FREED);
1130	ob->count = 0;	1129	ob->count = 0;
1131		1130
1132	/* Remove this object from the list of used objects */	1131	/* Remove this object from the list of used objects */
1133	if(ob->prev==NULL) {	1132	if(ob->prev==NULL) {
1134	objects=ob->next;	1133	objects=ob->next;
1135	if(objects!=NULL)	1134	if(objects!=NULL)
1136	objects->prev=NULL;	1135	objects->prev=NULL;
1137	}	1136	}
1138	else {	1137	else {
1139	ob->prev->next=ob->next;	1138	ob->prev->next=ob->next;
1140	if(ob->next!=NULL)	1139	if(ob->next!=NULL)
1141	ob->next->prev=ob->prev;	1140	ob->next->prev=ob->prev;
1142	}	1141	}
1143		1142
1144	if(ob->name!=NULL) FREE_AND_CLEAR_STR(ob->name);	1143	if(ob->name!=NULL) FREE_AND_CLEAR_STR(ob->name);
1145	if(ob->name_pl!=NULL) FREE_AND_CLEAR_STR(ob->name_pl);	1144	if(ob->name_pl!=NULL) FREE_AND_CLEAR_STR(ob->name_pl);
1146	if(ob->title!=NULL) FREE_AND_CLEAR_STR(ob->title);	1145	if(ob->title!=NULL) FREE_AND_CLEAR_STR(ob->title);
…		…
1171		1170
1172	/* Now link it with the free_objects list: */	1171	/* Now link it with the free_objects list: */
1173	ob->prev=NULL;	1172	ob->prev=NULL;
1174	ob->next=free_objects;	1173	ob->next=free_objects;
1175	if(free_objects!=NULL)	1174	if(free_objects!=NULL)
1176	free_objects->prev=ob;	1175	free_objects->prev=ob;
1177	free_objects=ob;	1176	free_objects=ob;
1178	nroffreeobjects++;	1177	nroffreeobjects++;
1179	#endif	1178	#endif
1180	}	1179	}
1181		1180
…		…
1247	mapstruct *m;	1246	mapstruct *m;
1248	sint16 x,y;	1247	sint16 x,y;
1249		1248
1250		1249
1251	if(QUERY_FLAG(op,FLAG_REMOVED)) {	1250	if(QUERY_FLAG(op,FLAG_REMOVED)) {
1252	dump_object(op);	1251	dump_object(op);
1253	LOG(llevError,"Trying to remove removed object.\n%s\n",errmsg);	1252	LOG(llevError,"Trying to remove removed object.\n%s\n",errmsg);
1254		1253
1255	/* Changed it to always dump core in this case. As has been learned	1254	/* Changed it to always dump core in this case. As has been learned
1256	* in the past, trying to recover from errors almost always	1255	* in the past, trying to recover from errors almost always
1257	* make things worse, and this is a real error here - something	1256	* make things worse, and this is a real error here - something
1258	* that should not happen.	1257	* that should not happen.
1259	* Yes, if this was a mission critical app, trying to do something	1258	* Yes, if this was a mission critical app, trying to do something
1260	* to recover may make sense, but that is because failure of the app	1259	* to recover may make sense, but that is because failure of the app
1261	* may have other disastrous problems. Cf runs out of a script	1260	* may have other disastrous problems. Cf runs out of a script
1262	* so is easily enough restarted without any real problems.	1261	* so is easily enough restarted without any real problems.
1263	* MSW 2001-07-01	1262	* MSW 2001-07-01
1264	*/	1263	*/
1265	abort();	1264	abort();
1266	}	1265	}
1267	if(op->more!=NULL)	1266	if(op->more!=NULL)
1268	remove_ob(op->more);	1267	remove_ob(op->more);
1269		1268
1270	SET_FLAG(op, FLAG_REMOVED);	1269	SET_FLAG(op, FLAG_REMOVED);
1271		1270
1272	/*	1271	/*
1273	* In this case, the object to be removed is in someones	1272	* In this case, the object to be removed is in someones
1274	* inventory.	1273	* inventory.
1275	*/	1274	*/
1276	if(op->env!=NULL) {	1275	if(op->env!=NULL) {
1277	if(op->nrof)	1276	if(op->nrof)
1278	sub_weight(op->env, op->weight*op->nrof);	1277	sub_weight(op->env, op->weight*op->nrof);
1279	else	1278	else
1280	sub_weight(op->env, op->weight+op->carrying);	1279	sub_weight(op->env, op->weight+op->carrying);
1281		1280
1282	/* NO_FIX_PLAYER is set when a great many changes are being	1281	/* NO_FIX_PLAYER is set when a great many changes are being
1283	* made to players inventory. If set, avoiding the call	1282	* made to players inventory. If set, avoiding the call
1284	* to save cpu time.	1283	* to save cpu time.
1285	*/	1284	*/
1286	if ((otmp=is_player_inv(op->env))!=NULL && otmp->contr &&	1285	if ((otmp=is_player_inv(op->env))!=NULL && otmp->contr &&
1287	!QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER))	1286	!QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER))
1288	fix_player(otmp);	1287	fix_player(otmp);
1289		1288
1290	if(op->above!=NULL)	1289	if(op->above!=NULL)
1291	op->above->below=op->below;	1290	op->above->below=op->below;
1292	else	1291	else
1293	op->env->inv=op->below;	1292	op->env->inv=op->below;
1294		1293
1295	if(op->below!=NULL)	1294	if(op->below!=NULL)
1296	op->below->above=op->above;	1295	op->below->above=op->above;
1297		1296
1298	/* we set up values so that it could be inserted into	1297	/* we set up values so that it could be inserted into
1299	* the map, but we don't actually do that - it is up	1298	* the map, but we don't actually do that - it is up
1300	* to the caller to decide what we want to do.	1299	* to the caller to decide what we want to do.
1301	*/	1300	*/
1302	op->x=op->env->x,op->y=op->env->y;	1301	op->x=op->env->x,op->y=op->env->y;
1303	op->ox=op->x,op->oy=op->y;	1302	op->ox=op->x,op->oy=op->y;
1304	op->map=op->env->map;	1303	op->map=op->env->map;
1305	op->above=NULL,op->below=NULL;	1304	op->above=NULL,op->below=NULL;
1306	op->env=NULL;	1305	op->env=NULL;
1307	return;	1306	return;
1308	}	1307	}
1309		1308
1310	/* If we get here, we are removing it from a map */	1309	/* If we get here, we are removing it from a map */
1311	if (op->map == NULL) return;	1310	if (op->map == NULL) return;
1312		1311
1313	x = op->x;	1312	x = op->x;
1314	y = op->y;	1313	y = op->y;
1315	m = get_map_from_coord(op->map, &x, &y);	1314	m = get_map_from_coord(op->map, &x, &y);
1316		1315
1317	if (!m) {	1316	if (!m) {
1318	LOG(llevError,"remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",	1317	LOG(llevError,"remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1319	op->map->path, op->x, op->y);	1318	op->map->path, op->x, op->y);
1320	/* in old days, we used to set x and y to 0 and continue.	1319	/* in old days, we used to set x and y to 0 and continue.
1321	* it seems if we get into this case, something is probablye	1320	* it seems if we get into this case, something is probablye
1322	* screwed up and should be fixed.	1321	* screwed up and should be fixed.
1323	*/	1322	*/
1324	abort();	1323	abort();
1325	}	1324	}
1326	if (op->map != m) {	1325	if (op->map != m) {
1327	LOG(llevDebug,"remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",	1326	LOG(llevDebug,"remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1328	op->map->path, m->path, op->x, op->y, x, y);	1327	op->map->path, m->path, op->x, op->y, x, y);
1329	}	1328	}
1330		1329
1331	/* Re did the following section of code - it looks like it had	1330	/* Re did the following section of code - it looks like it had
1332	* lots of logic for things we no longer care about	1331	* lots of logic for things we no longer care about
1333	*/	1332	*/
1334		1333
1335	/* link the object above us */	1334	/* link the object above us */
1336	if (op->above)	1335	if (op->above)
1337	op->above->below=op->below;	1336	op->above->below=op->below;
1338	else	1337	else
1339	SET_MAP_TOP(m,x,y,op->below); /* we were top, set new top */	1338	SET_MAP_TOP(m,x,y,op->below); /* we were top, set new top */
1340		1339
1341	/* Relink the object below us, if there is one */	1340	/* Relink the object below us, if there is one */
1342	if(op->below) {	1341	if(op->below) {
1343	op->below->above=op->above;	1342	op->below->above=op->above;
1344	} else {	1343	} else {
1345	/* Nothing below, which means we need to relink map object for this space	1344	/* Nothing below, which means we need to relink map object for this space
1346	* use translated coordinates in case some oddness with map tiling is	1345	* use translated coordinates in case some oddness with map tiling is
1347	* evident	1346	* evident
1348	*/	1347	*/
1349	if(GET_MAP_OB(m,x,y)!=op) {	1348	if(GET_MAP_OB(m,x,y)!=op) {
1350	dump_object(op);	1349	dump_object(op);
1351	LOG(llevError,"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg);	1350	LOG(llevError,"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg);
1352	dump_object(GET_MAP_OB(m,x,y));	1351	dump_object(GET_MAP_OB(m,x,y));
1353	LOG(llevError,"%s\n",errmsg);	1352	LOG(llevError,"%s\n",errmsg);
1354	}	1353	}
1355	SET_MAP_OB(m,x,y,op->above); /* goes on above it. */	1354	SET_MAP_OB(m,x,y,op->above); /* goes on above it. */
1356	}	1355	}
1357	op->above=NULL;	1356	op->above=NULL;
1358	op->below=NULL;	1357	op->below=NULL;
1359		1358
1360	if (op->map->in_memory == MAP_SAVING)	1359	if (op->map->in_memory == MAP_SAVING)
1361	return;	1360	return;
1362		1361
1363	tag = op->count;	1362	tag = op->count;
1364	check_walk_off = ! QUERY_FLAG (op, FLAG_NO_APPLY);	1363	check_walk_off = ! QUERY_FLAG (op, FLAG_NO_APPLY);
1365	for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above) {	1364	for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above) {
1366	/* No point updating the players look faces if he is the object	1365	/* No point updating the players look faces if he is the object
1367	* being removed.	1366	* being removed.
1368	*/	1367	*/
1369		1368
1370	if(tmp->type==PLAYER && tmp!=op) {	1369	if(tmp->type==PLAYER && tmp!=op) {
1371	/* If a container that the player is currently using somehow gets	1370	/* If a container that the player is currently using somehow gets
1372	* removed (most likely destroyed), update the player view	1371	* removed (most likely destroyed), update the player view
1373	* appropriately.	1372	* appropriately.
1374	*/	1373	*/
1375	if (tmp->container==op) {	1374	if (tmp->container==op) {
1376	CLEAR_FLAG(op, FLAG_APPLIED);	1375	CLEAR_FLAG(op, FLAG_APPLIED);
1377	tmp->container=NULL;	1376	tmp->container=NULL;
1378	}	1377	}
1379	tmp->contr->socket.update_look=1;	1378	tmp->contr->socket.update_look=1;
1380	}	1379	}
1381	/* See if player moving off should effect something */	1380	/* See if player moving off should effect something */
1382	if (check_walk_off && ((op->move_type & tmp->move_off) &&	1381	if (check_walk_off && ((op->move_type & tmp->move_off) &&
1383	(op->move_type & ~tmp->move_off & ~tmp->move_block)==0)) {	1382	(op->move_type & ~tmp->move_off & ~tmp->move_block)==0)) {
1384		1383
1385	move_apply(tmp, op, NULL);	1384	move_apply(tmp, op, NULL);
1386	if (was_destroyed (op, tag)) {	1385	if (was_destroyed (op, tag)) {
1387	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed "	1386	LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed "
1388	"leaving object\n", tmp->name, tmp->arch->name);	1387	"leaving object\n", tmp->name, tmp->arch->name);
1389	}	1388	}
1390	}	1389	}
1391		1390
1392	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1391	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1393		1392
1394	if(tmp->above == tmp)	1393	if(tmp->above == tmp)
1395	tmp->above = NULL;	1394	tmp->above = NULL;
1396	last=tmp;	1395	last=tmp;
1397	}	1396	}
1398	/* last == NULL of there are no objects on this space */	1397	/* last == NULL of there are no objects on this space */
1399	if (last==NULL) {	1398	if (last==NULL) {
1400	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,	1399	/* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1401	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures	1400	* we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1402	* those out anyways, and if there are any flags set right now, they won't	1401	* those out anyways, and if there are any flags set right now, they won't
1403	* be correct anyways.	1402	* be correct anyways.
1404	*/	1403	*/
1405	SET_MAP_FLAGS(op->map, op->x, op->y, P_NEED_UPDATE);	1404	SET_MAP_FLAGS(op->map, op->x, op->y, P_NEED_UPDATE);
1406	update_position(op->map, op->x, op->y);	1405	update_position(op->map, op->x, op->y);
1407	}	1406	}
1408	else	1407	else
1409	update_object(last, UP_OBJ_REMOVE);	1408	update_object(last, UP_OBJ_REMOVE);
1410		1409
1411	if(QUERY_FLAG(op,FLAG_BLOCKSVIEW)|| (op->glow_radius != 0))	1410	if(QUERY_FLAG(op,FLAG_BLOCKSVIEW)|| (op->glow_radius != 0))
1412	update_all_los(op->map, op->x, op->y);	1411	update_all_los(op->map, op->x, op->y);
1413		1412
1414	}	1413	}
1415		1414
1416	/*	1415	/*
1417	* merge_ob(op,top):	1416	* merge_ob(op,top):
…		…
1483	{	1482	{
1484	object *tmp, *top, *floor=NULL;	1483	object *tmp, *top, *floor=NULL;
1485	sint16 x,y;	1484	sint16 x,y;
1486		1485
1487	if (QUERY_FLAG (op, FLAG_FREED)) {	1486	if (QUERY_FLAG (op, FLAG_FREED)) {
1488	LOG (llevError, "Trying to insert freed object!\n");	1487	LOG (llevError, "Trying to insert freed object!\n");
1489	return NULL;	1488	return NULL;
1490	}	1489	}
1491	if(m==NULL) {	1490	if(m==NULL) {
1492	dump_object(op);	1491	dump_object(op);
1493	LOG(llevError,"Trying to insert in null-map!\n%s\n",errmsg);	1492	LOG(llevError,"Trying to insert in null-map!\n%s\n",errmsg);
1494	return op;	1493	return op;
1495	}	1494	}
1496	if(out_of_map(m,op->x,op->y)) {	1495	if(out_of_map(m,op->x,op->y)) {
1497	dump_object(op);	1496	dump_object(op);
1498	LOG(llevError,"Trying to insert object outside the map.\n%s\n", errmsg);	1497	LOG(llevError,"Trying to insert object outside the map.\n%s\n", errmsg);
1499	#ifdef MANY_CORES	1498	#ifdef MANY_CORES
1500	/* Better to catch this here, as otherwise the next use of this object	1499	/* Better to catch this here, as otherwise the next use of this object
1501	* is likely to cause a crash. Better to find out where it is getting	1500	* is likely to cause a crash. Better to find out where it is getting
1502	* improperly inserted.	1501	* improperly inserted.
1503	*/	1502	*/
1504	abort();	1503	abort();
1505	#endif	1504	#endif
1506	return op;	1505	return op;
1507	}	1506	}
1508	if(!QUERY_FLAG(op,FLAG_REMOVED)) {	1507	if(!QUERY_FLAG(op,FLAG_REMOVED)) {
1509	dump_object(op);	1508	dump_object(op);
1510	LOG(llevError,"Trying to insert (map) inserted object.\n%s\n", errmsg);	1509	LOG(llevError,"Trying to insert (map) inserted object.\n%s\n", errmsg);
1511	return op;	1510	return op;
1512	}	1511	}
1513	if(op->more!=NULL) {	1512	if(op->more!=NULL) {
1514	/* The part may be on a different map. */	1513	/* The part may be on a different map. */
1515		1514
1516	object *more = op->more;	1515	object *more = op->more;
1517		1516
1518	/* We really need the caller to normalize coordinates - if	1517	/* We really need the caller to normalize coordinates - if
1519	* we set the map, that doesn't work if the location is within	1518	* we set the map, that doesn't work if the location is within
1520	* a map and this is straddling an edge. So only if coordinate	1519	* a map and this is straddling an edge. So only if coordinate
1521	* is clear wrong do we normalize it.	1520	* is clear wrong do we normalize it.
1522	*/	1521	*/
1523	if (OUT_OF_REAL_MAP(more->map, more->x, more->y)) {	1522	if (OUT_OF_REAL_MAP(more->map, more->x, more->y)) {
1524	/* Debugging information so you can see the last coordinates this object had */	1523	/* Debugging information so you can see the last coordinates this object had */
1525	more->ox = more->x;	1524	more->ox = more->x;
1526	more->oy = more->y;	1525	more->oy = more->y;
1527	more->map = get_map_from_coord(m, &more->x, &more->y);	1526	more->map = get_map_from_coord(m, &more->x, &more->y);
1528	} else if (!more->map) {	1527	} else if (!more->map) {
1529	/* For backwards compatibility - when not dealing with tiled maps,	1528	/* For backwards compatibility - when not dealing with tiled maps,
1530	* more->map should always point to the parent.	1529	* more->map should always point to the parent.
1531	*/	1530	*/
1532	more->map = m;	1531	more->map = m;
1533	}	1532	}
1534		1533
1535	if (insert_ob_in_map(more, more->map, originator, flag) == NULL) {	1534	if (insert_ob_in_map(more, more->map, originator, flag) == NULL) {
1536	if ( ! op->head)	1535	if ( ! op->head)
1537	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1536	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1538	return NULL;	1537	return NULL;
1539	}	1538	}
1540	}	1539	}
1541	CLEAR_FLAG(op,FLAG_REMOVED);	1540	CLEAR_FLAG(op,FLAG_REMOVED);
1542		1541
1543	/* Debugging information so you can see the last coordinates this object had */	1542	/* Debugging information so you can see the last coordinates this object had */
1544	op->ox=op->x;	1543	op->ox=op->x;
…		…
1553	y = op->y;	1552	y = op->y;
1554		1553
1555	/* this has to be done after we translate the coordinates.	1554	/* this has to be done after we translate the coordinates.
1556	*/	1555	*/
1557	if(op->nrof && !(flag & INS_NO_MERGE)) {	1556	if(op->nrof && !(flag & INS_NO_MERGE)) {
1558	for(tmp=GET_MAP_OB(op->map,x,y);tmp!=NULL;tmp=tmp->above)	1557	for(tmp=GET_MAP_OB(op->map,x,y);tmp!=NULL;tmp=tmp->above)
1559	if (CAN_MERGE(op,tmp)) {	1558	if (CAN_MERGE(op,tmp)) {
1560	op->nrof+=tmp->nrof;	1559	op->nrof+=tmp->nrof;
1561	remove_ob(tmp);	1560	remove_ob(tmp);
1562	free_object(tmp);	1561	free_object(tmp);
1563	}	1562	}
1564	}	1563	}
1565		1564
1566	CLEAR_FLAG(op,FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */	1565	CLEAR_FLAG(op,FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1567	CLEAR_FLAG(op, FLAG_INV_LOCKED);	1566	CLEAR_FLAG(op, FLAG_INV_LOCKED);
1568	if (!QUERY_FLAG(op, FLAG_ALIVE))	1567	if (!QUERY_FLAG(op, FLAG_ALIVE))
1569	CLEAR_FLAG(op, FLAG_NO_STEAL);	1568	CLEAR_FLAG(op, FLAG_NO_STEAL);
1570		1569
1571	if (flag & INS_BELOW_ORIGINATOR) {	1570	if (flag & INS_BELOW_ORIGINATOR) {
1572	if (originator->map != op->map || originator->x != op->x ||	1571	if (originator->map != op->map || originator->x != op->x ||
1573	originator->y != op->y) {	1572	originator->y != op->y) {
1574	LOG(llevError,"insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");	1573	LOG(llevError,"insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1575	abort();	1574	abort();
1576	}	1575	}
1577	op->above = originator;	1576	op->above = originator;
1578	op->below = originator->below;	1577	op->below = originator->below;
1579	if (op->below) op->below->above = op;	1578	if (op->below) op->below->above = op;
1580	else SET_MAP_OB(op->map, op->x, op->y, op);	1579	else SET_MAP_OB(op->map, op->x, op->y, op);
1581	/* since *below* originator, no need to update top */	1580	/* since *below* originator, no need to update top */
1582	originator->below = op;	1581	originator->below = op;
1583	} else {	1582	} else {
1584	/* If there are other objects, then */	1583	/* If there are other objects, then */
1585	if((! (flag & INS_MAP_LOAD)) && ((top=GET_MAP_OB(op->map,op->x,op->y))!=NULL)) {	1584	if((! (flag & INS_MAP_LOAD)) && ((top=GET_MAP_OB(op->map,op->x,op->y))!=NULL)) {
1586	object *last=NULL;	1585	object *last=NULL;
1587	/*	1586	/*
1588	* If there are multiple objects on this space, we do some trickier handling.	1587	* If there are multiple objects on this space, we do some trickier handling.
1589	* We've already dealt with merging if appropriate.	1588	* We've already dealt with merging if appropriate.
1590	* Generally, we want to put the new object on top. But if	1589	* Generally, we want to put the new object on top. But if
1591	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last	1590	* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
1592	* floor, we want to insert above that and no further.	1591	* floor, we want to insert above that and no further.
1593	* Also, if there are spell objects on this space, we stop processing	1592	* Also, if there are spell objects on this space, we stop processing
1594	* once we get to them. This reduces the need to traverse over all of	1593	* once we get to them. This reduces the need to traverse over all of
1595	* them when adding another one - this saves quite a bit of cpu time	1594	* them when adding another one - this saves quite a bit of cpu time
1596	* when lots of spells are cast in one area. Currently, it is presumed	1595	* when lots of spells are cast in one area. Currently, it is presumed
1597	* that flying non pickable objects are spell objects.	1596	* that flying non pickable objects are spell objects.
1598	*/	1597	*/
1599		1598
1600	while (top != NULL) {	1599	while (top != NULL) {
1601	if (QUERY_FLAG(top, FLAG_IS_FLOOR) ||	1600	if (QUERY_FLAG(top, FLAG_IS_FLOOR) ||
1602	QUERY_FLAG(top, FLAG_OVERLAY_FLOOR)) floor = top;	1601	QUERY_FLAG(top, FLAG_OVERLAY_FLOOR)) floor = top;
1603	if (QUERY_FLAG(top, FLAG_NO_PICK)	1602	if (QUERY_FLAG(top, FLAG_NO_PICK)
1604	&& (top->move_type & (MOVE_FLY_LOW |MOVE_FLY_HIGH))	1603	&& (top->move_type & (MOVE_FLY_LOW |MOVE_FLY_HIGH))
1605	&& !QUERY_FLAG(top, FLAG_IS_FLOOR))	1604	&& !QUERY_FLAG(top, FLAG_IS_FLOOR))
1606	{	1605	{
1607	/* We insert above top, so we want this object below this */	1606	/* We insert above top, so we want this object below this */
1608	top=top->below;	1607	top=top->below;
1609	break;	1608	break;
1610	}	1609	}
1611	last = top;	1610	last = top;
1612	top = top->above;	1611	top = top->above;
1613	}	1612	}
1614	/* Don't want top to be NULL, so set it to the last valid object */	1613	/* Don't want top to be NULL, so set it to the last valid object */
1615	top = last;	1614	top = last;
1616		1615
1617	/* We let update_position deal with figuring out what the space	1616	/* We let update_position deal with figuring out what the space
1618	* looks like instead of lots of conditions here.	1617	* looks like instead of lots of conditions here.
1619	* makes things faster, and effectively the same result.	1618	* makes things faster, and effectively the same result.
1620	*/	1619	*/
1621		1620
1622	/* Have object 'fall below' other objects that block view.	1621	/* Have object 'fall below' other objects that block view.
1623	* Unless those objects are exits, type 66	1622	* Unless those objects are exits, type 66
1624	* If INS_ON_TOP is used, don't do this processing	1623	* If INS_ON_TOP is used, don't do this processing
1625	* Need to find the object that in fact blocks view, otherwise	1624	* Need to find the object that in fact blocks view, otherwise
1626	* stacking is a bit odd.	1625	* stacking is a bit odd.
1627	*/	1626	*/
1628	if (!(flag & INS_ON_TOP) &&	1627	if (!(flag & INS_ON_TOP) &&
1629	(get_map_flags(op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) &&	1628	(get_map_flags(op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) &&
1630	(op->face && !op->face->visibility)) {	1629	(op->face && !op->face->visibility)) {
1631	for (last=top; last != floor; last=last->below)	1630	for (last=top; last != floor; last=last->below)
1632	if (QUERY_FLAG(last, FLAG_BLOCKSVIEW)&&(last->type != EXIT)) break;	1631	if (QUERY_FLAG(last, FLAG_BLOCKSVIEW)&&(last->type != EXIT)) break;
1633	/* Check to see if we found the object that blocks view,	1632	/* Check to see if we found the object that blocks view,
1634	* and make sure we have a below pointer for it so that	1633	* and make sure we have a below pointer for it so that
1635	* we can get inserted below this one, which requires we	1634	* we can get inserted below this one, which requires we
1636	* set top to the object below us.	1635	* set top to the object below us.
1637	*/	1636	*/
1638	if (last && last->below && last != floor) top=last->below;	1637	if (last && last->below && last != floor) top=last->below;
1639	}	1638	}
1640	} /* If objects on this space */	1639	} /* If objects on this space */
1641	if (flag & INS_MAP_LOAD)	1640	if (flag & INS_MAP_LOAD)
1642	top = GET_MAP_TOP(op->map,op->x,op->y);	1641	top = GET_MAP_TOP(op->map,op->x,op->y);
1643	if (flag & INS_ABOVE_FLOOR_ONLY) top = floor;	1642	if (flag & INS_ABOVE_FLOOR_ONLY) top = floor;
1644		1643
1645	/* Top is the object that our object (op) is going to get inserted above.	1644	/* Top is the object that our object (op) is going to get inserted above.
1646	*/	1645	*/
1647		1646
1648	/* First object on this space */	1647	/* First object on this space */
1649	if (!top) {	1648	if (!top) {
1650	op->above = GET_MAP_OB(op->map, op->x, op->y);	1649	op->above = GET_MAP_OB(op->map, op->x, op->y);
1651	if (op->above) op->above->below = op;	1650	if (op->above) op->above->below = op;
1652	op->below = NULL;	1651	op->below = NULL;
1653	SET_MAP_OB(op->map, op->x, op->y, op);	1652	SET_MAP_OB(op->map, op->x, op->y, op);
1654	} else { /* get inserted into the stack above top */	1653	} else { /* get inserted into the stack above top */
1655	op->above = top->above;	1654	op->above = top->above;
1656	if (op->above) op->above->below = op;	1655	if (op->above) op->above->below = op;
1657	op->below = top;	1656	op->below = top;
1658	top->above = op;	1657	top->above = op;
1659	}	1658	}
1660	if (op->above==NULL)	1659	if (op->above==NULL)
1661	SET_MAP_TOP(op->map,op->x, op->y, op);	1660	SET_MAP_TOP(op->map,op->x, op->y, op);
1662	} /* else not INS_BELOW_ORIGINATOR */	1661	} /* else not INS_BELOW_ORIGINATOR */
1663		1662
1664	if(op->type==PLAYER)	1663	if(op->type==PLAYER)
1665	op->contr->do_los=1;	1664	op->contr->do_los=1;
1666		1665
1667	/* If we have a floor, we know the player, if any, will be above	1666	/* If we have a floor, we know the player, if any, will be above
1668	* it, so save a few ticks and start from there.	1667	* it, so save a few ticks and start from there.
1669	*/	1668	*/
1670	if (!(flag & INS_MAP_LOAD))	1669	if (!(flag & INS_MAP_LOAD))
1671	for(tmp=floor?floor:GET_MAP_OB(op->map,op->x,op->y);tmp!=NULL;tmp=tmp->above) {	1670	for(tmp=floor?floor:GET_MAP_OB(op->map,op->x,op->y);tmp!=NULL;tmp=tmp->above) {
1672	if (tmp->type == PLAYER)	1671	if (tmp->type == PLAYER)
1673	tmp->contr->socket.update_look=1;	1672	tmp->contr->socket.update_look=1;
1674	}	1673	}
1675		1674
1676	/* If this object glows, it may affect lighting conditions that are	1675	/* If this object glows, it may affect lighting conditions that are
1677	* visible to others on this map. But update_all_los is really	1676	* visible to others on this map. But update_all_los is really
1678	* an inefficient way to do this, as it means los for all players	1677	* an inefficient way to do this, as it means los for all players
…		…
1681	* this should get redone to only look for players within range,	1680	* this should get redone to only look for players within range,
1682	* or just updating the P_NEED_UPDATE for spaces within this area	1681	* or just updating the P_NEED_UPDATE for spaces within this area
1683	* of effect may be sufficient.	1682	* of effect may be sufficient.
1684	*/	1683	*/
1685	if(MAP_DARKNESS(op->map) && (op->glow_radius != 0))	1684	if(MAP_DARKNESS(op->map) && (op->glow_radius != 0))
1686	update_all_los(op->map, op->x, op->y);	1685	update_all_los(op->map, op->x, op->y);
1687		1686
1688		1687
1689	/* updates flags (blocked, alive, no magic, etc) for this map space */	1688	/* updates flags (blocked, alive, no magic, etc) for this map space */
1690	update_object(op,UP_OBJ_INSERT);	1689	update_object(op,UP_OBJ_INSERT);
1691		1690
…		…
1701		1700
1702	/* if this is not the head or flag has been passed, don't check walk on status */	1701	/* if this is not the head or flag has been passed, don't check walk on status */
1703		1702
1704	if (!(flag & INS_NO_WALK_ON) && !op->head) {	1703	if (!(flag & INS_NO_WALK_ON) && !op->head) {
1705	if (check_move_on(op, originator))	1704	if (check_move_on(op, originator))
1706	return NULL;	1705	return NULL;
1707		1706
1708	/* If we are a multi part object, lets work our way through the check	1707	/* If we are a multi part object, lets work our way through the check
1709	* walk on's.	1708	* walk on's.
1710	*/	1709	*/
1711	for (tmp=op->more; tmp!=NULL; tmp=tmp->more)	1710	for (tmp=op->more; tmp!=NULL; tmp=tmp->more)
1712	if (check_move_on (tmp, originator))	1711	if (check_move_on (tmp, originator))
1713	return NULL;	1712	return NULL;
1714	}	1713	}
1715	return op;	1714	return op;
1716	}	1715	}
1717		1716
1718	/* this function inserts an object in the map, but if it	1717	/* this function inserts an object in the map, but if it
…		…
1724	object *tmp1;	1723	object *tmp1;
1725		1724
1726	/* first search for itself and remove any old instances */	1725	/* first search for itself and remove any old instances */
1727		1726
1728	for(tmp=GET_MAP_OB(op->map,op->x,op->y); tmp!=NULL; tmp=tmp->above) {	1727	for(tmp=GET_MAP_OB(op->map,op->x,op->y); tmp!=NULL; tmp=tmp->above) {
1729	if(!strcmp(tmp->arch->name,arch_string)) /* same archetype */ {	1728	if(!strcmp(tmp->arch->name,arch_string)) /* same archetype */ {
1730	remove_ob(tmp);	1729	remove_ob(tmp);
1731	free_object(tmp);	1730	free_object(tmp);
1732	}	1731	}
1733	}	1732	}
1734		1733
1735	tmp1=arch_to_object(find_archetype(arch_string));	1734	tmp1=arch_to_object(find_archetype(arch_string));
1736		1735
1737		1736
…		…
1750	object *get_split_ob(object *orig_ob, uint32 nr) {	1749	object *get_split_ob(object *orig_ob, uint32 nr) {
1751	object *newob;	1750	object *newob;
1752	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1751	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1753		1752
1754	if(orig_ob->nrof<nr) {	1753	if(orig_ob->nrof<nr) {
1755	sprintf(errmsg,"There are only %d %ss.",	1754	sprintf(errmsg,"There are only %d %ss.",
1756	orig_ob->nrof?orig_ob->nrof:1, orig_ob->name);	1755	orig_ob->nrof?orig_ob->nrof:1, orig_ob->name);
1757	return NULL;	1756	return NULL;
1758	}	1757	}
1759	newob = object_create_clone(orig_ob);	1758	newob = object_create_clone(orig_ob);
1760	if((orig_ob->nrof-=nr)<1) {	1759	if((orig_ob->nrof-=nr)<1) {
1761	if ( ! is_removed)	1760	if ( ! is_removed)
1762	remove_ob(orig_ob);	1761	remove_ob(orig_ob);
1763	free_object2(orig_ob, 1);	1762	free_object2(orig_ob, 1);
1764	}	1763	}
1765	else if ( ! is_removed) {	1764	else if ( ! is_removed) {
1766	if(orig_ob->env!=NULL)	1765	if(orig_ob->env!=NULL)
1767	sub_weight (orig_ob->env,orig_ob->weight*nr);	1766	sub_weight (orig_ob->env,orig_ob->weight*nr);
1768	if (orig_ob->env == NULL && orig_ob->map->in_memory!=MAP_IN_MEMORY) {	1767	if (orig_ob->env == NULL && orig_ob->map->in_memory!=MAP_IN_MEMORY) {
1769	strcpy(errmsg, "Tried to split object whose map is not in memory.");	1768	strcpy(errmsg, "Tried to split object whose map is not in memory.");
1770	LOG(llevDebug,	1769	LOG(llevDebug,
1771	"Error, Tried to split object whose map is not in memory.\n");	1770	"Error, Tried to split object whose map is not in memory.\n");
1772	return NULL;	1771	return NULL;
1773	}	1772	}
1774	}	1773	}
1775	newob->nrof=nr;	1774	newob->nrof=nr;
1776		1775
1777	return newob;	1776	return newob;
1778	}	1777	}
…		…
1800	{	1799	{
1801	op->nrof -= i;	1800	op->nrof -= i;
1802	}	1801	}
1803	else if (op->env != NULL)	1802	else if (op->env != NULL)
1804	{	1803	{
1805	/* is this object in the players inventory, or sub container	1804	/* is this object in the players inventory, or sub container
1806	* therein?	1805	* therein?
1807	*/	1806	*/
1808	tmp = is_player_inv (op->env);	1807	tmp = is_player_inv (op->env);
1809	/* nope. Is this a container the player has opened?	1808	/* nope. Is this a container the player has opened?
1810	* If so, set tmp to that player.	1809	* If so, set tmp to that player.
1811	* IMO, searching through all the players will mostly	1810	* IMO, searching through all the players will mostly
1812	* likely be quicker than following op->env to the map,	1811	* likely be quicker than following op->env to the map,
1813	* and then searching the map for a player.	1812	* and then searching the map for a player.
1814	*/	1813	*/
1815	if (!tmp) {	1814	if (!tmp) {
1816	for (pl=first_player; pl; pl=pl->next)	1815	for (pl=first_player; pl; pl=pl->next)
1817	if (pl->ob->container == op->env) break;	1816	if (pl->ob->container == op->env) break;
1818	if (pl) tmp=pl->ob;	1817	if (pl) tmp=pl->ob;
1819	else tmp=NULL;	1818	else tmp=NULL;
1820	}	1819	}
1821		1820
1822	if (i < op->nrof) {	1821	if (i < op->nrof) {
1823	sub_weight (op->env, op->weight * i);	1822	sub_weight (op->env, op->weight * i);
1824	op->nrof -= i;	1823	op->nrof -= i;
1825	if (tmp) {	1824	if (tmp) {
…		…
1833	}	1832	}
1834	}	1833	}
1835	}	1834	}
1836	else	1835	else
1837	{	1836	{
1838	object *above = op->above;	1837	object *above = op->above;
1839		1838
1840	if (i < op->nrof) {	1839	if (i < op->nrof) {
1841	op->nrof -= i;	1840	op->nrof -= i;
1842	} else {	1841	} else {
1843	remove_ob (op);	1842	remove_ob (op);
1844	op->nrof = 0;	1843	op->nrof = 0;
1845	}	1844	}
1846	/* Since we just removed op, op->above is null */	1845	/* Since we just removed op, op->above is null */
1847	for (tmp = above; tmp != NULL; tmp = tmp->above)	1846	for (tmp = above; tmp != NULL; tmp = tmp->above)
1848	if (tmp->type == PLAYER) {	1847	if (tmp->type == PLAYER) {
1849	if (op->nrof)	1848	if (op->nrof)
1850	esrv_send_item(tmp, op);	1849	esrv_send_item(tmp, op);
1851	else	1850	else
…		…
1903	LOG(llevError,"Trying to put object in NULL.\n%s\n", errmsg);	1902	LOG(llevError,"Trying to put object in NULL.\n%s\n", errmsg);
1904	return op;	1903	return op;
1905	}	1904	}
1906	if (where->head) {	1905	if (where->head) {
1907	LOG(llevDebug,	1906	LOG(llevDebug,
1908	"Warning: Tried to insert object wrong part of multipart object.\n");	1907	"Warning: Tried to insert object wrong part of multipart object.\n");
1909	where = where->head;	1908	where = where->head;
1910	}	1909	}
1911	if (op->more) {	1910	if (op->more) {
1912	LOG(llevError, "Tried to insert multipart object %s (%d)\n",	1911	LOG(llevError, "Tried to insert multipart object %s (%d)\n",
1913	op->name, op->count);	1912	op->name, op->count);
…		…
1916	CLEAR_FLAG(op, FLAG_OBJ_ORIGINAL);	1915	CLEAR_FLAG(op, FLAG_OBJ_ORIGINAL);
1917	CLEAR_FLAG(op, FLAG_REMOVED);	1916	CLEAR_FLAG(op, FLAG_REMOVED);
1918	if(op->nrof) {	1917	if(op->nrof) {
1919	for(tmp=where->inv;tmp!=NULL;tmp=tmp->below)	1918	for(tmp=where->inv;tmp!=NULL;tmp=tmp->below)
1920	if ( CAN_MERGE(tmp,op) ) {	1919	if ( CAN_MERGE(tmp,op) ) {
1921	/* return the original object and remove inserted object	1920	/* return the original object and remove inserted object
1922	(client needs the original object) */	1921	(client needs the original object) */
1923	tmp->nrof += op->nrof;	1922	tmp->nrof += op->nrof;
1924	/* Weight handling gets pretty funky. Since we are adding to	1923	/* Weight handling gets pretty funky. Since we are adding to
1925	* tmp->nrof, we need to increase the weight.	1924	* tmp->nrof, we need to increase the weight.
1926	*/	1925	*/
1927	add_weight (where, op->weight*op->nrof);	1926	add_weight (where, op->weight*op->nrof);
1928	SET_FLAG(op, FLAG_REMOVED);	1927	SET_FLAG(op, FLAG_REMOVED);
1929	free_object(op); /* free the inserted object */	1928	free_object(op); /* free the inserted object */
1930	op = tmp;	1929	op = tmp;
1931	remove_ob (op); /* and fix old object's links */	1930	remove_ob (op); /* and fix old object's links */
1932	CLEAR_FLAG(op, FLAG_REMOVED);	1931	CLEAR_FLAG(op, FLAG_REMOVED);
1933	break;	1932	break;
1934	}	1933	}
1935		1934
1936	/* I assume combined objects have no inventory	1935	/* I assume combined objects have no inventory
1937	* We add the weight - this object could have just been removed	1936	* We add the weight - this object could have just been removed
1938	* (if it was possible to merge). calling remove_ob will subtract	1937	* (if it was possible to merge). calling remove_ob will subtract
…		…
1959	/* reset the light list and los of the players on the map */	1958	/* reset the light list and los of the players on the map */
1960	if((op->glow_radius!=0)&&where->map)	1959	if((op->glow_radius!=0)&&where->map)
1961	{	1960	{
1962	#ifdef DEBUG_LIGHTS	1961	#ifdef DEBUG_LIGHTS
1963	LOG(llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n",	1962	LOG(llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n",
1964	op->name);	1963	op->name);
1965	#endif /* DEBUG_LIGHTS */	1964	#endif /* DEBUG_LIGHTS */
1966	if (MAP_DARKNESS(where->map)) update_all_los(where->map, where->x, where->y);	1965	if (MAP_DARKNESS(where->map)) update_all_los(where->map, where->x, where->y);
1967	}	1966	}
1968		1967
1969	/* Client has no idea of ordering so lets not bother ordering it here.	1968	/* Client has no idea of ordering so lets not bother ordering it here.
…		…
2007	mapstruct *m=op->map;	2006	mapstruct *m=op->map;
2008	int x=op->x, y=op->y;	2007	int x=op->x, y=op->y;
2009	MoveType move_on, move_slow, move_block;	2008	MoveType move_on, move_slow, move_block;
2010		2009
2011	if(QUERY_FLAG(op,FLAG_NO_APPLY))	2010	if(QUERY_FLAG(op,FLAG_NO_APPLY))
2012	return 0;	2011	return 0;
2013		2012
2014	tag = op->count;	2013	tag = op->count;
2015		2014
2016	move_on = GET_MAP_MOVE_ON(op->map, op->x, op->y);	2015	move_on = GET_MAP_MOVE_ON(op->map, op->x, op->y);
2017	move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y);	2016	move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y);
…		…
2021	* no need to do checking below. have to make sure move_type	2020	* no need to do checking below. have to make sure move_type
2022	* is set, as lots of objects don't have it set - we treat that	2021	* is set, as lots of objects don't have it set - we treat that
2023	* as walking.	2022	* as walking.
2024	*/	2023	*/
2025	if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow))	2024	if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow))
2026	return 0;	2025	return 0;
2027		2026
2028	/* This is basically inverse logic of that below - basically,	2027	/* This is basically inverse logic of that below - basically,
2029	* if the object can avoid the move on or slow move, they do so,	2028	* if the object can avoid the move on or slow move, they do so,
2030	* but can't do it if the alternate movement they are using is	2029	* but can't do it if the alternate movement they are using is
2031	* blocked. Logic on this seems confusing, but does seem correct.	2030	* blocked. Logic on this seems confusing, but does seem correct.
2032	*/	2031	*/
2033	if ((op->move_type & ~move_on & ~move_block) != 0 &&	2032	if ((op->move_type & ~move_on & ~move_block) != 0 &&
2034	(op->move_type & ~move_slow & ~move_block) != 0) return 0;	2033	(op->move_type & ~move_slow & ~move_block) != 0) return 0;
2035		2034
2036	/* The objects have to be checked from top to bottom.	2035	/* The objects have to be checked from top to bottom.
2037	* Hence, we first go to the top:	2036	* Hence, we first go to the top:
2038	*/	2037	*/
2039		2038
2040	for (tmp=GET_MAP_OB(op->map, op->x, op->y); tmp!=NULL &&	2039	for (tmp=GET_MAP_OB(op->map, op->x, op->y); tmp!=NULL &&
2041	tmp->above!=NULL; tmp=tmp->above) {	2040	tmp->above!=NULL; tmp=tmp->above) {
2042	/* Trim the search when we find the first other spell effect	2041	/* Trim the search when we find the first other spell effect
2043	* this helps performance so that if a space has 50 spell objects,	2042	* this helps performance so that if a space has 50 spell objects,
2044	* we don't need to check all of them.	2043	* we don't need to check all of them.
2045	*/	2044	*/
2046	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG(tmp, FLAG_NO_PICK)) break;	2045	if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG(tmp, FLAG_NO_PICK)) break;
2047	}	2046	}
2048	for(;tmp!=NULL; tmp=tmp->below) {	2047	for(;tmp!=NULL; tmp=tmp->below) {
2049	if (tmp == op) continue; /* Can't apply yourself */	2048	if (tmp == op) continue; /* Can't apply yourself */
2050		2049
2051	/* Check to see if one of the movement types should be slowed down.	2050	/* Check to see if one of the movement types should be slowed down.
2052	* Second check makes sure that the movement types not being slowed	2051	* Second check makes sure that the movement types not being slowed
2053	* (~slow_move) is not blocked on this space - just because the	2052	* (~slow_move) is not blocked on this space - just because the
2054	* space doesn't slow down swimming (for example), if you can't actually	2053	* space doesn't slow down swimming (for example), if you can't actually
2055	* swim on that space, can't use it to avoid the penalty.	2054	* swim on that space, can't use it to avoid the penalty.
2056	*/	2055	*/
2057	if (!QUERY_FLAG(op, FLAG_WIZPASS)) {	2056	if (!QUERY_FLAG(op, FLAG_WIZPASS)) {
2058	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||	2057	if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
2059	((op->move_type & tmp->move_slow) &&	2058	((op->move_type & tmp->move_slow) &&
2060	(op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) {	2059	(op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) {
2061		2060
2062	float diff;	2061	float diff;
2063		2062
2064	diff = tmp->move_slow_penalty*FABS(op->speed);	2063	diff = tmp->move_slow_penalty*FABS(op->speed);
2065	if (op->type == PLAYER) {	2064	if (op->type == PLAYER) {
2066	if ((QUERY_FLAG(tmp, FLAG_IS_HILLY) && find_skill_by_number(op, SK_CLIMBING)) ||	2065	if ((QUERY_FLAG(tmp, FLAG_IS_HILLY) && find_skill_by_number(op, SK_CLIMBING)) ||
2067	(QUERY_FLAG(tmp, FLAG_IS_WOODED) && find_skill_by_number(op, SK_WOODSMAN))) {	2066	(QUERY_FLAG(tmp, FLAG_IS_WOODED) && find_skill_by_number(op, SK_WOODSMAN))) {
2068	diff /= 4.0;	2067	diff /= 4.0;
2069	}	2068	}
2070	}	2069	}
2071	op->speed_left -= diff;	2070	op->speed_left -= diff;
2072	}	2071	}
2073	}	2072	}
2074		2073
2075	/* Basically same logic as above, except now for actual apply. */	2074	/* Basically same logic as above, except now for actual apply. */
2076	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||	2075	if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
2077	((op->move_type & tmp->move_on) &&	2076	((op->move_type & tmp->move_on) &&
2078	(op->move_type & ~tmp->move_on & ~tmp->move_block)==0)) {	2077	(op->move_type & ~tmp->move_on & ~tmp->move_block)==0)) {
2079		2078
2080	move_apply(tmp, op, originator);	2079	move_apply(tmp, op, originator);
2081	if (was_destroyed (op, tag))	2080	if (was_destroyed (op, tag))
2082	return 1;	2081	return 1;
2083		2082
2084	/* what the person/creature stepped onto has moved the object	2083	/* what the person/creature stepped onto has moved the object
2085	* someplace new. Don't process any further - if we did,	2084	* someplace new. Don't process any further - if we did,
2086	* have a feeling strange problems would result.	2085	* have a feeling strange problems would result.
2087	*/	2086	*/
2088	if (op->map != m || op->x != x || op->y != y) return 0;	2087	if (op->map != m || op->x != x || op->y != y) return 0;
2089	}	2088	}
2090	}	2089	}
2091	return 0;	2090	return 0;
2092	}	2091	}
2093		2092
2094	/*	2093	/*
…		…
2158		2157
2159	object *present_in_ob_by_name(int type, const char *str, const object *op) {	2158	object *present_in_ob_by_name(int type, const char *str, const object *op) {
2160	object *tmp;	2159	object *tmp;
2161		2160
2162	for(tmp=op->inv; tmp!=NULL; tmp=tmp->below) {	2161	for(tmp=op->inv; tmp!=NULL; tmp=tmp->below) {
2163	if ((type==-1 || tmp->type==type) && (!strcmp(str, tmp->name)))	2162	if ((type==-1 || tmp->type==type) && (!strcmp(str, tmp->name)))
2164	return tmp;	2163	return tmp;
2165	}	2164	}
2166	return NULL;	2165	return NULL;
2167	}	2166	}
2168		2167
2169	/*	2168	/*
…		…
2239	int find_free_spot(const object *ob, mapstruct *m,int x,int y,int start,int stop) {	2238	int find_free_spot(const object *ob, mapstruct *m,int x,int y,int start,int stop) {
2240	int i,index=0, flag;	2239	int i,index=0, flag;
2241	static int altern[SIZEOFFREE];	2240	static int altern[SIZEOFFREE];
2242		2241
2243	for(i=start;i<stop;i++) {	2242	for(i=start;i<stop;i++) {
2244	flag = ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]);	2243	flag = ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]);
2245	if(!flag)	2244	if(!flag)
2246	altern[index++]=i;	2245	altern[index++]=i;
2247		2246
2248	/* Basically, if we find a wall on a space, we cut down the search size.	2247	/* Basically, if we find a wall on a space, we cut down the search size.
2249	* In this way, we won't return spaces that are on another side of a wall.	2248	* In this way, we won't return spaces that are on another side of a wall.
2250	* This mostly work, but it cuts down the search size in all directions -	2249	* This mostly work, but it cuts down the search size in all directions -
2251	* if the space being examined only has a wall to the north and empty	2250	* if the space being examined only has a wall to the north and empty
2252	* spaces in all the other directions, this will reduce the search space	2251	* spaces in all the other directions, this will reduce the search space
2253	* to only the spaces immediately surrounding the target area, and	2252	* to only the spaces immediately surrounding the target area, and
2254	* won't look 2 spaces south of the target space.	2253	* won't look 2 spaces south of the target space.
2255	*/	2254	*/
2256	else if ((flag & AB_NO_PASS) && maxfree[i]<stop)	2255	else if ((flag & AB_NO_PASS) && maxfree[i]<stop)
2257	stop=maxfree[i];	2256	stop=maxfree[i];
2258	}	2257	}
2259	if(!index) return -1;	2258	if(!index) return -1;
2260	return altern[RANDOM()%index];	2259	return altern[RANDOM()%index];
2261	}	2260	}
2262		2261
…		…
2268	*/	2267	*/
2269		2268
2270	int find_first_free_spot(const object *ob, mapstruct *m,int x,int y) {	2269	int find_first_free_spot(const object *ob, mapstruct *m,int x,int y) {
2271	int i;	2270	int i;
2272	for(i=0;i<SIZEOFFREE;i++) {	2271	for(i=0;i<SIZEOFFREE;i++) {
2273	if(!ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]))	2272	if(!ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]))
2274	return i;	2273	return i;
2275	}	2274	}
2276	return -1;	2275	return -1;
2277	}	2276	}
2278		2277
2279	/*	2278	/*
…		…
2285	int i, j, tmp, len;	2284	int i, j, tmp, len;
2286		2285
2287	len = end-begin;	2286	len = end-begin;
2288	for(i = begin; i < end; i++)	2287	for(i = begin; i < end; i++)
2289	{	2288	{
2290	j = begin+RANDOM()%len;	2289	j = begin+RANDOM()%len;
2291		2290
2292	tmp = arr[i];	2291	tmp = arr[i];
2293	arr[i] = arr[j];	2292	arr[i] = arr[j];
2294	arr[j] = tmp;	2293	arr[j] = tmp;
2295	}	2294	}
2296	}	2295	}
2297		2296
2298	/* new function to make monster searching more efficient, and effective!	2297	/* new function to make monster searching more efficient, and effective!
2299	* This basically returns a randomized array (in the passed pointer) of	2298	* This basically returns a randomized array (in the passed pointer) of
…		…
2306	{	2305	{
2307	int i;	2306	int i;
2308		2307
2309	for(i = 0; i < SIZEOFFREE; i++)	2308	for(i = 0; i < SIZEOFFREE; i++)
2310	{	2309	{
2311	search_arr[i] = i;	2310	search_arr[i] = i;
2312	}	2311	}
2313		2312
2314	permute(search_arr, 1, SIZEOFFREE1+1);	2313	permute(search_arr, 1, SIZEOFFREE1+1);
2315	permute(search_arr, SIZEOFFREE1+1, SIZEOFFREE2+1);	2314	permute(search_arr, SIZEOFFREE1+1, SIZEOFFREE2+1);
2316	permute(search_arr, SIZEOFFREE2+1, SIZEOFFREE);	2315	permute(search_arr, SIZEOFFREE2+1, SIZEOFFREE);
…		…
2335	object *tmp;	2334	object *tmp;
2336	mapstruct *mp;	2335	mapstruct *mp;
2337	MoveType blocked, move_type;	2336	MoveType blocked, move_type;
2338		2337
2339	if (exclude && exclude->head) {	2338	if (exclude && exclude->head) {
2340	exclude = exclude->head;	2339	exclude = exclude->head;
2341	move_type = exclude->move_type;	2340	move_type = exclude->move_type;
2342	} else {	2341	} else {
2343	/* If we don't have anything, presume it can use all movement types. */	2342	/* If we don't have anything, presume it can use all movement types. */
2344	move_type=MOVE_ALL;	2343	move_type=MOVE_ALL;
2345	}	2344	}
2346		2345
2347	for(i=1;i<max;i++) {	2346	for(i=1;i<max;i++) {
2348	mp = m;	2347	mp = m;
2349	nx = x + freearr_x[i];	2348	nx = x + freearr_x[i];
2350	ny = y + freearr_y[i];	2349	ny = y + freearr_y[i];
2351		2350
2352	mflags = get_map_flags(m, &mp, nx, ny, &nx, &ny);	2351	mflags = get_map_flags(m, &mp, nx, ny, &nx, &ny);
2353	if (mflags & P_OUT_OF_MAP) {	2352	if (mflags & P_OUT_OF_MAP) {
2354	max = maxfree[i];	2353	max = maxfree[i];
2355	} else {	2354	} else {
2356	blocked = GET_MAP_MOVE_BLOCK(mp, nx, ny);	2355	blocked = GET_MAP_MOVE_BLOCK(mp, nx, ny);
2357		2356
2358	if ((move_type & blocked) == move_type) {	2357	if ((move_type & blocked) == move_type) {
2359	max=maxfree[i];	2358	max=maxfree[i];
2360	} else if (mflags & P_IS_ALIVE) {	2359	} else if (mflags & P_IS_ALIVE) {
2361	for (tmp=GET_MAP_OB(mp,nx,ny); tmp!= NULL; tmp=tmp->above) {	2360	for (tmp=GET_MAP_OB(mp,nx,ny); tmp!= NULL; tmp=tmp->above) {
2362	if ((QUERY_FLAG(tmp,FLAG_MONSTER) || tmp->type==PLAYER) &&	2361	if ((QUERY_FLAG(tmp,FLAG_MONSTER) || tmp->type==PLAYER) &&
2363	(tmp != exclude ||(tmp->head && tmp->head != exclude))) {	2362	(tmp != exclude ||(tmp->head && tmp->head != exclude))) {
2364	break;	2363	break;
2365	}	2364	}
2366	}	2365	}
2367	if(tmp) {	2366	if(tmp) {
2368	return freedir[i];	2367	return freedir[i];
2369	}	2368	}
2370	}	2369	}
2371	}	2370	}
2372	}	2371	}
2373	return 0;	2372	return 0;
2374	}	2373	}
2375		2374
2376	/*	2375	/*
…		…
2540	if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW)) return 0;	2539	if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW)) return 0;
2541		2540
2542	/* yes, can see. */	2541	/* yes, can see. */
2543	if(dir < 9) return 1;	2542	if(dir < 9) return 1;
2544	return can_see_monsterP(m, x, y, reduction_dir[dir][0]) |	2543	return can_see_monsterP(m, x, y, reduction_dir[dir][0]) |
2545	can_see_monsterP(m,x,y, reduction_dir[dir][1]) |	2544	can_see_monsterP(m,x,y, reduction_dir[dir][1]) |
2546	can_see_monsterP(m,x,y, reduction_dir[dir][2]);	2545	can_see_monsterP(m,x,y, reduction_dir[dir][2]);
2547	}	2546	}
2548		2547
2549		2548
2550		2549
2551	/*	2550	/*
2552	* can_pick(picker, item): finds out if an object is possible to be	2551	* can_pick(picker, item): finds out if an object is possible to be
2553	* picked up by the picker. Returnes 1 if it can be	2552	* picked up by the picker. Returnes 1 if it can be
2554	* picked up, otherwise 0.	2553	* picked up, otherwise 0.
2555	*	2554	*
…		…
2560	*/	2559	*/
2561		2560
2562	int can_pick(const object *who, const object *item) {	2561	int can_pick(const object *who, const object *item) {
2563	return /*QUERY_FLAG(who,FLAG_WIZ)||*/	2562	return /*QUERY_FLAG(who,FLAG_WIZ)||*/
2564	(item->weight>0&&!QUERY_FLAG(item,FLAG_NO_PICK)&&	2563	(item->weight>0&&!QUERY_FLAG(item,FLAG_NO_PICK)&&
2565	!QUERY_FLAG(item,FLAG_ALIVE)&&!item->invisible &&	2564	!QUERY_FLAG(item,FLAG_ALIVE)&&!item->invisible &&
2566	(who->type==PLAYER||item->weight<who->weight/3));	2565	(who->type==PLAYER||item->weight<who->weight/3));
2567	}	2566	}
2568		2567
2569		2568
2570	/*	2569	/*
…		…
2595	prev->more = tmp;	2594	prev->more = tmp;
2596	prev = tmp;	2595	prev = tmp;
2597	}	2596	}
2598	/*** copy inventory ***/	2597	/*** copy inventory ***/
2599	for(item = src->inv; item; item = item->below) {	2598	for(item = src->inv; item; item = item->below) {
2600	(void) insert_ob_in_ob(object_create_clone(item),dst);	2599	(void) insert_ob_in_ob(object_create_clone(item),dst);
2601	}	2600	}
2602		2601
2603	return dst;	2602	return dst;
2604	}	2603	}
2605		2604
…		…
2619	/* Also remember that multiparts objects are not supported for now. */	2618	/* Also remember that multiparts objects are not supported for now. */
2620		2619
2621	object* load_object_str(const char *obstr)	2620	object* load_object_str(const char *obstr)
2622	{	2621	{
2623	object *op;	2622	object *op;
2624	FILE *tempfile;
2625	char filename[MAX_BUF];	2623	char filename[MAX_BUF];
2626	sprintf(filename,"%s/cfloadobstr2044",settings.tmpdir);	2624	sprintf(filename,"%s/cfloadobstr2044",settings.tmpdir);
		2625
2627	tempfile=fopen(filename,"w");	2626	FILE *tempfile=fopen(filename,"w");
2628	if (tempfile == NULL)	2627	if (tempfile == NULL)
2629	{	2628	{
2630	LOG(llevError,"Error - Unable to access load object temp file\n");	2629	LOG(llevError,"Error - Unable to access load object temp file\n");
2631	return NULL;	2630	return NULL;
2632	};	2631	};
2633	fprintf(tempfile,obstr);	2632	fprintf(tempfile,obstr);
2634	fclose(tempfile);	2633	fclose(tempfile);
2635		2634
2636	op=get_object();	2635	op=get_object();
2637		2636
2638	tempfile=fopen(filename,"r");
2639	if (tempfile == NULL)
2640	{
2641	LOG(llevError,"Error - Unable to read object temp file\n");
2642	return NULL;
2643	};
2644	object_thawer thawer (tempfile);	2637	object_thawer thawer (filename);
		2638	if (thawer)
2645	load_object(thawer,op,LO_NEWFILE,0);	2639	load_object(thawer,op,LO_NEWFILE,0);
2646	LOG(llevDebug," load str completed, object=%s\n",op->name);	2640	LOG(llevDebug," load str completed, object=%s\n",op->name);
2647	CLEAR_FLAG(op,FLAG_REMOVED);	2641	CLEAR_FLAG(op,FLAG_REMOVED);
2648	fclose(tempfile);	2642
2649	return op;	2643	return op;
2650	}	2644	}
2651		2645
2652	/* This returns the first object in who's inventory that	2646	/* This returns the first object in who's inventory that
2653	* has the same type and subtype match.	2647	* has the same type and subtype match.
…		…
2656	object *find_obj_by_type_subtype(const object *who, int type, int subtype)	2650	object *find_obj_by_type_subtype(const object *who, int type, int subtype)
2657	{	2651	{
2658	object *tmp;	2652	object *tmp;
2659		2653
2660	for (tmp=who->inv; tmp; tmp=tmp->below)	2654	for (tmp=who->inv; tmp; tmp=tmp->below)
2661	if (tmp->type == type && tmp->subtype == subtype) return tmp;	2655	if (tmp->type == type && tmp->subtype == subtype) return tmp;
2662		2656
2663	return NULL;	2657	return NULL;
2664	}	2658	}
2665		2659
2666	/* If ob has a field named key, return the link from the list,	2660	/* If ob has a field named key, return the link from the list,
…		…
2727	*/	2721	*/
2728	int set_ob_key_value_s(object * op, const char * canonical_key, const char * value, int add_key) {	2722	int set_ob_key_value_s(object * op, const char * canonical_key, const char * value, int add_key) {
2729	key_value * field = NULL, *last=NULL;	2723	key_value * field = NULL, *last=NULL;
2730		2724
2731	for (field=op->key_values; field != NULL; field=field->next) {	2725	for (field=op->key_values; field != NULL; field=field->next) {
2732	if (field->key != canonical_key) {	2726	if (field->key != canonical_key) {
2733	last = field;	2727	last = field;
2734	continue;	2728	continue;
2735	}	2729	}
2736		2730
2737	if (field->value) FREE_AND_CLEAR_STR(field->value);	2731	if (field->value) FREE_AND_CLEAR_STR(field->value);
2738	if (value)	2732	if (value)
2739	field->value = add_string(value);	2733	field->value = add_string(value);
2740	else {	2734	else {
2741	/* Basically, if the archetype has this key set,	2735	/* Basically, if the archetype has this key set,
2742	* we need to store the null value so when we save	2736	* we need to store the null value so when we save
2743	* it, we save the empty value so that when we load,	2737	* it, we save the empty value so that when we load,
2744	* we get this value back again.	2738	* we get this value back again.
2745	*/	2739	*/
2746	if (get_ob_key_link(&op->arch->clone, canonical_key))	2740	if (get_ob_key_link(&op->arch->clone, canonical_key))
2747	field->value = NULL;	2741	field->value = NULL;
2748	else {	2742	else {
2749	/* Delete this link */	2743	/* Delete this link */
2750	if (field->key) FREE_AND_CLEAR_STR(field->key);	2744	if (field->key) FREE_AND_CLEAR_STR(field->key);
2751	if (field->value) FREE_AND_CLEAR_STR(field->value);	2745	if (field->value) FREE_AND_CLEAR_STR(field->value);
2752	if (last) last->next = field->next;	2746	if (last) last->next = field->next;
2753	else op->key_values = field->next;	2747	else op->key_values = field->next;
2754	free(field);	2748	free(field);
2755	}	2749	}
2756	}	2750	}
2757	return TRUE;	2751	return TRUE;
2758	}	2752	}
2759	/* IF we get here, key doesn't exist */	2753	/* IF we get here, key doesn't exist */
2760		2754
2761	/* No field, we'll have to add it. */	2755	/* No field, we'll have to add it. */

Diff Legend

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