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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.82 by root, Mon Dec 25 11:25:49 2006 UTC vs.
Revision 1.99 by root, Sun Dec 31 18:10:40 2006 UTC

…		…
141	* 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
142	* different structure or at least keep the lists sorted...	142	* different structure or at least keep the lists sorted...
143	*/	143	*/
144		144
145	/* For each field in wants, */	145	/* For each field in wants, */
146	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)
147	{	147	{
148	key_value *has_field;	148	key_value *has_field;
149		149
150	/* Look for a field in has with the same key. */	150	/* Look for a field in has with the same key. */
151	has_field = get_ob_key_link (has, wants_field->key);	151	has_field = get_ob_key_link (has, wants_field->key);
…		…
190	* Check nrof variable before calling can_merge()	190	* Check nrof variable before calling can_merge()
191	*	191	*
192	* Improvements made with merge: Better checking on potion, and also	192	* Improvements made with merge: Better checking on potion, and also
193	* check weight	193	* check weight
194	*/	194	*/
195
196	bool object::can_merge_slow (object ob1, object ob2)	195	bool object::can_merge_slow (object ob1, object ob2)
197	{	196	{
198	/* A couple quicksanity checks */	197	/* A couple quicksanity checks */
199	if (ob1 == ob2	198	if (ob1 == ob2
200	\|\| ob1->type != ob2->type	199	\|\| ob1->type != ob2->type
…		…
277		276
278	/* Note sure why the following is the case - either the object has to	277	/* Note sure why the following is the case - either the object has to
279	* be animated or have a very low speed. Is this an attempted monster	278	* be animated or have a very low speed. Is this an attempted monster
280	* check?	279	* check?
281	*/	280	*/
282	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)	281	if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ())
283	return 0;	282	return 0;
284		283
285	switch (ob1->type)	284	switch (ob1->type)
286	{	285	{
287	case SCROLL:	286	case SCROLL:
…		…
364	{	363	{
365	if (!op)	364	if (!op)
366	return strdup ("[NULLOBJ]");	365	return strdup ("[NULLOBJ]");
367		366
368	object_freezer freezer;	367	object_freezer freezer;
369	save_object (freezer, op, 3);	368	save_object (freezer, op, 1);
370	return freezer.as_string ();	369	return freezer.as_string ();
371	}	370	}
372		371
373	/*	372	/*
374	* get_nearest_part(multi-object, object 2) returns the part of the	373	* get_nearest_part(multi-object, object 2) returns the part of the
…		…
522	tail = new_link;	521	tail = new_link;
523	}	522	}
524	}	523	}
525	}	524	}
526		525
527	update_ob_speed (dst);	526	dst->set_speed (dst->speed);
528	}	527	}
529		528
530	object *	529	object *
531	object::clone ()	530	object::clone ()
532	{	531	{
…		…
538	/*	537	/*
539	* If an object with the IS_TURNABLE() flag needs to be turned due	538	* If an object with the IS_TURNABLE() flag needs to be turned due
540	* to the closest player being on the other side, this function can	539	* to the closest player being on the other side, this function can
541	* be called to update the face variable, _and_ how it looks on the map.	540	* be called to update the face variable, _and_ how it looks on the map.
542	*/	541	*/
543
544	void	542	void
545	update_turn_face (object *op)	543	update_turn_face (object *op)
546	{	544	{
547	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) \|\| op->arch == NULL)	545	if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) \|\| !op->arch)
548	return;	546	return;
		547
549	SET_ANIMATION (op, op->direction);	548	SET_ANIMATION (op, op->direction);
550	update_object (op, UP_OBJ_FACE);	549	update_object (op, UP_OBJ_FACE);
551	}	550	}
552		551
553	/*	552	/*
554	* Updates the speed of an object. If the speed changes from 0 to another	553	* Updates the speed of an object. If the speed changes from 0 to another
555	* value, or vice versa, then add/remove the object from the active list.	554	* value, or vice versa, then add/remove the object from the active list.
556	* This function needs to be called whenever the speed of an object changes.	555	* This function needs to be called whenever the speed of an object changes.
557	*/	556	*/
558	void	557	void
559	update_ob_speed (object *op)	558	object::set_speed (float speed)
560	{	559	{
561	extern int arch_init;	560	if (flag [FLAG_FREED] && speed)
562
563	/* No reason putting the archetypes objects on the speed list,
564	* since they never really need to be updated.
565	*/
566
567	if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
568	{	561	{
569	LOG (llevError, "Object %s is freed but has speed.\n", &op->name);	562	LOG (llevError, "Object %s is freed but has speed.\n", &name);
570	#ifdef MANY_CORES
571	abort ();
572	#else
573	op->speed = 0;	563	speed = 0;
574	#endif
575	}
576
577	if (arch_init)
578	return;
579
580	if (FABS (op->speed) > MIN_ACTIVE_SPEED)
581	{	564	}
582	/* If already on active list, don't do anything */
583	if (op->active_next \|\| op->active_prev \|\| op == active_objects)
584	return;
585		565
586	/* process_events() expects us to insert the object at the beginning	566	this->speed = speed;
587	* of the list. */
588	op->active_next = active_objects;
589		567
590	if (op->active_next != NULL)	568	if (has_active_speed ())
591	op->active_next->active_prev = op;	569	activate ();
592
593	active_objects = op;
594	}
595	else	570	else
596	{	571	deactivate ();
597	/* If not on the active list, nothing needs to be done */
598	if (!op->active_next && !op->active_prev && op != active_objects)
599	return;
600
601	if (op->active_prev == NULL)
602	{
603	active_objects = op->active_next;
604
605	if (op->active_next != NULL)
606	op->active_next->active_prev = NULL;
607	}
608	else
609	{
610	op->active_prev->active_next = op->active_next;
611
612	if (op->active_next)
613	op->active_next->active_prev = op->active_prev;
614	}
615
616	op->active_next = NULL;
617	op->active_prev = NULL;
618	}
619	}
620
621	/* This function removes object 'op' from the list of active
622	* objects.
623	* This should only be used for style maps or other such
624	* reference maps where you don't want an object that isn't
625	* in play chewing up cpu time getting processed.
626	* The reverse of this is to call update_ob_speed, which
627	* will do the right thing based on the speed of the object.
628	*/
629	void
630	remove_from_active_list (object *op)
631	{
632	/* If not on the active list, nothing needs to be done */
633	if (!op->active_next && !op->active_prev && op != active_objects)
634	return;
635
636	if (op->active_prev == NULL)
637	{
638	active_objects = op->active_next;
639	if (op->active_next != NULL)
640	op->active_next->active_prev = NULL;
641	}
642	else
643	{
644	op->active_prev->active_next = op->active_next;
645	if (op->active_next)
646	op->active_next->active_prev = op->active_prev;
647	}
648	op->active_next = NULL;
649	op->active_prev = NULL;
650	}	572	}
651		573
652	/*	574	/*
653	* update_object() updates the the map.	575	* update_object() updates the the map.
654	* It takes into account invisible objects (and represent squares covered	576	* It takes into account invisible objects (and represent squares covered
…		…
691	*/	613	*/
692	if (!op->map \|\| op->map->in_memory == MAP_SAVING)	614	if (!op->map \|\| op->map->in_memory == MAP_SAVING)
693	return;	615	return;
694		616
695	/* make sure the object is within map boundaries */	617	/* make sure the object is within map boundaries */
696	if (op->x < 0 \|\| op->x >= MAP_WIDTH (op->map) \|\| op->y < 0 \|\| op->y >= MAP_HEIGHT (op->map))	618	if (op->x < 0 \|\| op->x >= op->map->width \|\| op->y < 0 \|\| op->y >= op->map->height)
697	{	619	{
698	LOG (llevError, "update_object() called for object out of map!\n");	620	LOG (llevError, "update_object() called for object out of map!\n");
699	#ifdef MANY_CORES	621	#ifdef MANY_CORES
700	abort ();	622	abort ();
701	#endif	623	#endif
702	return;	624	return;
703	}	625	}
704		626
705	mapspace &m = op->ms ();	627	mapspace &m = op->ms ();
706		628
707	if (m.flags_ & P_NEED_UPDATE)	629	if (!(m.flags_ & P_UPTODATE))
708	/* nop */;	630	/* nop */;
709	else if (action == UP_OBJ_INSERT)	631	else if (action == UP_OBJ_INSERT)
710	{	632	{
711	// this is likely overkill, TODO: revisit (schmorp)	633	// this is likely overkill, TODO: revisit (schmorp)
712	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))	634	if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
…		…
721	/* This isn't perfect, but I don't expect a lot of objects to	643	/* This isn't perfect, but I don't expect a lot of objects to
722	* to have move_allow right now.	644	* to have move_allow right now.
723	*/	645	*/
724	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block	646	\|\| ((m.move_block \| op->move_block) & ~op->move_allow) != m.move_block
725	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)	647	\|\| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
726	m.flags_ = P_NEED_UPDATE;	648	m.flags_ = 0;
727	}	649	}
728	/* if the object is being removed, we can't make intelligent	650	/* if the object is being removed, we can't make intelligent
729	* decisions, because remove_ob can't really pass the object	651	* decisions, because remove_ob can't really pass the object
730	* that is being removed.	652	* that is being removed.
731	*/	653	*/
732	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)	654	else if (action == UP_OBJ_CHANGE \|\| action == UP_OBJ_REMOVE)
733	m.flags_ = P_NEED_UPDATE;	655	m.flags_ = 0;
734	else if (action == UP_OBJ_FACE)	656	else if (action == UP_OBJ_FACE)
735	/* Nothing to do for that case */ ;	657	/* Nothing to do for that case */ ;
736	else	658	else
737	LOG (llevError, "update_object called with invalid action: %d\n", action);	659	LOG (llevError, "update_object called with invalid action: %d\n", action);
738		660
739	if (op->more)	661	if (op->more)
740	update_object (op->more, action);	662	update_object (op->more, action);
741	}	663	}
742		664
743	object::vector object::objects; // not yet used
744	object *object::first;	665	object *object::first;
745		666
746	object::object ()	667	object::object ()
747	{	668	{
748	SET_FLAG (this, FLAG_REMOVED);	669	SET_FLAG (this, FLAG_REMOVED);
…		…
781		702
782	prev = 0;	703	prev = 0;
783	next = 0;	704	next = 0;
784	}	705	}
785		706
786	object *object::create ()	707	bool
		708	object::active () const
787	{	709	{
788	object *op = new object;	710	return active_next \|\| active_prev \|\| this == active_objects;
789	op->link ();
790	return op;
791	}	711	}
792		712
793	/*
794	* free_object() frees everything allocated by an object, removes
795	* it from the list of used objects, and puts it on the list of
796	* free objects. The IS_FREED() flag is set in the object.
797	* The object must have been removed by remove_ob() first for
798	* this function to succeed.
799	*
800	* If destroy_inventory is set, free inventory as well. Else drop items in
801	* inventory to the ground.
802	*/
803	void	713	void
804	object::do_destroy ()	714	object::activate ()
805	{	715	{
806	attachable::do_destroy ();	716	/* If already on active list, don't do anything */
807		717	if (active ())
808	if (flag [FLAG_IS_LINKED])
809	remove_button_link (this);
810
811	if (flag [FLAG_FRIENDLY])
812	remove_friendly_object (this);
813
814	if (!flag [FLAG_REMOVED])
815	remove ();
816
817	if (flag [FLAG_FREED])
818	return;	718	return;
819		719
820	flag [FLAG_FREED] = 1;	720	if (has_active_speed ())
821
822	// hack to ensure that freed objects still have a valid map
823	{
824	static maptile *freed_map; // freed objects are moved here to avoid crashes
825
826	if (!freed_map)
827	{	721	{
828	freed_map = new maptile;	722	/* process_events() expects us to insert the object at the beginning
		723	* of the list. */
		724	active_next = active_objects;
829		725
830	freed_map->name = "/internal/freed_objects_map";	726	if (active_next)
831	freed_map->width = 3;	727	active_next->active_prev = this;
832	freed_map->height = 3;
833		728
834	freed_map->allocate ();	729	active_objects = this;
835	}	730	}
		731	}
836		732
837	map = freed_map;	733	void
838	x = 1;	734	object::activate_recursive ()
839	y = 1;	735	{
		736	activate ();
		737
		738	for (object *op = inv; op; op = op->above)
		739	op->activate_recursive ();
		740	}
		741
		742	/* This function removes object 'op' from the list of active
		743	* objects.
		744	* This should only be used for style maps or other such
		745	* reference maps where you don't want an object that isn't
		746	* in play chewing up cpu time getting processed.
		747	* The reverse of this is to call update_ob_speed, which
		748	* will do the right thing based on the speed of the object.
		749	*/
		750	void
		751	object::deactivate ()
		752	{
		753	/* If not on the active list, nothing needs to be done */
		754	if (!active ())
		755	return;
		756
		757	if (active_prev == 0)
		758	{
		759	active_objects = active_next;
		760	if (active_next)
		761	active_next->active_prev = 0;
840	}	762	}
		763	else
		764	{
		765	active_prev->active_next = active_next;
		766	if (active_next)
		767	active_next->active_prev = active_prev;
		768	}
841		769
842	more = 0;	770	active_next = 0;
843	head = 0;	771	active_prev = 0;
844	inv = 0;	772	}
845		773
846	// clear those pointers that likely might have circular references to us	774	void
847	owner = 0;	775	object::deactivate_recursive ()
848	enemy = 0;	776	{
849	attacked_by = 0;	777	for (object *op = inv; op; op = op->above)
		778	op->deactivate_recursive ();
850		779
851	// only relevant for players(?), but make sure of it anyways	780	deactivate ();
852	contr = 0;
853
854	/* Remove object from the active list */
855	speed = 0;
856	update_ob_speed (this);
857
858	unlink ();
859	}	781	}
860		782
861	/*	783	/*
862	* Remove and free all objects in the inventory of the given object.	784	* Remove and free all objects in the inventory of the given object.
863	* object.c ?	785	* object.c ?
864	*/	786	*/
865	void	787	void
866	object::destroy_inv (bool drop_to_ground)	788	object::destroy_inv (bool drop_to_ground)
867	{	789	{
		790	// need to check first, because the checks below might segfault
		791	// as we might be on an invalid mapspace and crossfire code
		792	// is too buggy to ensure that the inventory is empty.
		793	// corollary: if you create arrows etc. with stuff in tis inventory,
		794	// cf will crash below with off-map x and y
868	if (!inv)	795	if (!inv)
869	return;	796	return;
870		797
871	/* Only if the space blocks everything do we not process -	798	/* Only if the space blocks everything do we not process -
872	* if some form of movement is allowed, let objects	799	* if some form of movement is allowed, let objects
873	* drop on that space.	800	* drop on that space.
874	*/	801	*/
875	if (!drop_to_ground \|\| !map \|\| map->in_memory != MAP_IN_MEMORY \|\| GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)	802	if (!drop_to_ground
		803	\|\| !map
		804	\|\| map->in_memory != MAP_IN_MEMORY
		805	\|\| ms ().move_block == MOVE_ALL)
876	{	806	{
877	while (inv)	807	while (inv)
878	{	808	{
879	inv->destroy_inv (drop_to_ground);	809	inv->destroy_inv (drop_to_ground);
880	inv->destroy ();	810	inv->destroy ();
…		…
891	\|\| op->type == RUNE	821	\|\| op->type == RUNE
892	\|\| op->type == TRAP	822	\|\| op->type == TRAP
893	\|\| op->flag [FLAG_IS_A_TEMPLATE])	823	\|\| op->flag [FLAG_IS_A_TEMPLATE])
894	op->destroy ();	824	op->destroy ();
895	else	825	else
896	{	826	map->insert (op, x, y);
897	op->remove ();
898	op->x = x;
899	op->y = y;
900	insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
901	}	827	}
		828	}
		829	}
		830
		831	object *object::create ()
		832	{
		833	object *op = new object;
		834	op->link ();
		835	return op;
		836	}
		837
		838	void
		839	object::do_destroy ()
		840	{
		841	if (flag [FLAG_IS_LINKED])
		842	remove_button_link (this);
		843
		844	if (flag [FLAG_FRIENDLY])
		845	remove_friendly_object (this);
		846
		847	if (!flag [FLAG_REMOVED])
		848	remove ();
		849
		850	if (flag [FLAG_FREED])
		851	return;
		852
		853	set_speed (0);
		854
		855	flag [FLAG_FREED] = 1;
		856
		857	attachable::do_destroy ();
		858
		859	destroy_inv (true);
		860	unlink ();
		861
		862	// hack to ensure that freed objects still have a valid map
		863	{
		864	static maptile *freed_map; // freed objects are moved here to avoid crashes
		865
		866	if (!freed_map)
		867	{
		868	freed_map = new maptile;
		869
		870	freed_map->name = "/internal/freed_objects_map";
		871	freed_map->width = 3;
		872	freed_map->height = 3;
		873
		874	freed_map->alloc ();
902	}	875	}
		876
		877	map = freed_map;
		878	x = 1;
		879	y = 1;
		880	}
		881
		882	head = 0;
		883
		884	if (more)
903	}	885	{
		886	more->destroy ();
		887	more = 0;
		888	}
		889
		890	// clear those pointers that likely might have circular references to us
		891	owner = 0;
		892	enemy = 0;
		893	attacked_by = 0;
		894
		895	// only relevant for players(?), but make sure of it anyways
		896	contr = 0;
904	}	897	}
905		898
906	void	899	void
907	object::destroy (bool destroy_inventory)	900	object::destroy (bool destroy_inventory)
908	{	901	{
909	if (destroyed ())	902	if (destroyed ())
910	return;	903	return;
911		904
912	if (more)
913	{
914	//TODO: non-head objects must not have inventory
915	more->destroy (destroy_inventory);
916	more = 0;
917	}
918
919	if (destroy_inventory)	905	if (destroy_inventory)
920	destroy_inv (true);	906	destroy_inv (false);
921		907
922	attachable::destroy ();	908	attachable::destroy ();
923	}	909	}
924		910
925	/*	911	/*
…		…
978	* to save cpu time.	964	* to save cpu time.
979	*/	965	*/
980	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))	966	if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
981	otmp->update_stats ();	967	otmp->update_stats ();
982		968
983	if (above != NULL)	969	if (above)
984	above->below = below;	970	above->below = below;
985	else	971	else
986	env->inv = below;	972	env->inv = below;
987		973
988	if (below != NULL)	974	if (below)
989	below->above = above;	975	below->above = above;
990		976
991	/* we set up values so that it could be inserted into	977	/* we set up values so that it could be inserted into
992	* the map, but we don't actually do that - it is up	978	* the map, but we don't actually do that - it is up
993	* to the caller to decide what we want to do.	979	* to the caller to decide what we want to do.
…		…
997	above = 0, below = 0;	983	above = 0, below = 0;
998	env = 0;	984	env = 0;
999	}	985	}
1000	else if (map)	986	else if (map)
1001	{	987	{
1002	/* Re did the following section of code - it looks like it had	988	if (type == PLAYER)
1003	* lots of logic for things we no longer care about
1004	*/	989	{
		990	--map->players;
		991	map->last_access = runtime;
		992	}
		993
		994	map->dirty = true;
1005		995
1006	/* link the object above us */	996	/* link the object above us */
1007	if (above)	997	if (above)
1008	above->below = below;	998	above->below = below;
1009	else	999	else
…		…
1027	dump = dump_object (GET_MAP_OB (map, x, y));	1017	dump = dump_object (GET_MAP_OB (map, x, y));
1028	LOG (llevError, "%s\n", dump);	1018	LOG (llevError, "%s\n", dump);
1029	free (dump);	1019	free (dump);
1030	}	1020	}
1031		1021
1032	map->at (x, y).bottom = above; /* goes on above it. */	1022	map->at (x, y).bot = above; /* goes on above it. */
1033	}	1023	}
1034		1024
1035	above = 0;	1025	above = 0;
1036	below = 0;	1026	below = 0;
1037		1027
1038	if (map->in_memory == MAP_SAVING)	1028	if (map->in_memory == MAP_SAVING)
1039	return;	1029	return;
1040		1030
1041	int check_walk_off = !flag [FLAG_NO_APPLY];	1031	int check_walk_off = !flag [FLAG_NO_APPLY];
1042		1032
1043	for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)	1033	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)
1044	{	1034	{
1045	/* No point updating the players look faces if he is the object	1035	/* No point updating the players look faces if he is the object
1046	* being removed.	1036	* being removed.
1047	*/	1037	*/
1048		1038
…		…
1060		1050
1061	if (tmp->contr->ns)	1051	if (tmp->contr->ns)
1062	tmp->contr->ns->floorbox_update ();	1052	tmp->contr->ns->floorbox_update ();
1063	}	1053	}
1064		1054
1065	/* See if player moving off should effect something */	1055	/* See if object moving off should effect something */
1066	if (check_walk_off	1056	if (check_walk_off
1067	&& ((move_type & tmp->move_off)	1057	&& ((move_type & tmp->move_off)
1068	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))	1058	&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1069	{	1059	{
1070	move_apply (tmp, this, 0);	1060	move_apply (tmp, this, 0);
…		…
1072	if (destroyed ())	1062	if (destroyed ())
1073	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());	1063	LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1074	}	1064	}
1075		1065
1076	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */	1066	/* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1077		1067	//TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1078	if (tmp->above == tmp)	1068	if (tmp->above == tmp)
1079	tmp->above = 0;	1069	tmp->above = 0;
1080		1070
1081	last = tmp;	1071	last = tmp;
1082	}	1072	}
1083		1073
1084	/* last == NULL of there are no objects on this space */	1074	/* last == NULL if there are no objects on this space */
		1075	//TODO: this makes little sense, why only update the topmost object?
1085	if (!last)	1076	if (!last)
1086	map->at (x, y).flags_ = P_NEED_UPDATE;	1077	map->at (x, y).flags_ = 0;
1087	else	1078	else
1088	update_object (last, UP_OBJ_REMOVE);	1079	update_object (last, UP_OBJ_REMOVE);
1089		1080
1090	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)	1081	if (flag [FLAG_BLOCKSVIEW] \|\| glow_radius)
1091	update_all_los (map, x, y);	1082	update_all_los (map, x, y);
…		…
1134	* job preparing multi-part monsters	1125	* job preparing multi-part monsters
1135	*/	1126	*/
1136	object *	1127	object *
1137	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1128	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1138	{	1129	{
1139	object *tmp;
1140
1141	if (op->head)
1142	op = op->head;
1143
1144	for (tmp = op; tmp; tmp = tmp->more)	1130	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1145	{	1131	{
1146	tmp->x = x + tmp->arch->clone.x;	1132	tmp->x = x + tmp->arch->clone.x;
1147	tmp->y = y + tmp->arch->clone.y;	1133	tmp->y = y + tmp->arch->clone.y;
1148	}	1134	}
1149		1135
…		…
1180	{	1166	{
1181	LOG (llevError, "Trying to insert freed object!\n");	1167	LOG (llevError, "Trying to insert freed object!\n");
1182	return NULL;	1168	return NULL;
1183	}	1169	}
1184		1170
1185	if (m == NULL)	1171	if (!m)
1186	{	1172	{
1187	char *dump = dump_object (op);	1173	char *dump = dump_object (op);
1188	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1174	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1189	free (dump);	1175	free (dump);
1190	return op;	1176	return op;
…		…
1254	y = op->y;	1240	y = op->y;
1255		1241
1256	/* this has to be done after we translate the coordinates.	1242	/* this has to be done after we translate the coordinates.
1257	*/	1243	*/
1258	if (op->nrof && !(flag & INS_NO_MERGE))	1244	if (op->nrof && !(flag & INS_NO_MERGE))
1259	for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)	1245	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)
1260	if (object::can_merge (op, tmp))	1246	if (object::can_merge (op, tmp))
1261	{	1247	{
1262	op->nrof += tmp->nrof;	1248	op->nrof += tmp->nrof;
1263	tmp->destroy ();	1249	tmp->destroy ();
1264	}	1250	}
…		…
1281	op->below = originator->below;	1267	op->below = originator->below;
1282		1268
1283	if (op->below)	1269	if (op->below)
1284	op->below->above = op;	1270	op->below->above = op;
1285	else	1271	else
1286	op->ms ().bottom = op;	1272	op->ms ().bot = op;
1287		1273
1288	/* since below originator, no need to update top */	1274	/* since below originator, no need to update top */
1289	originator->below = op;	1275	originator->below = op;
1290	}	1276	}
1291	else	1277	else
1292	{	1278	{
1293	/* If there are other objects, then */	1279	/* If there are other objects, then */
1294	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1280	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))
1295	{	1281	{
1296	object *last = NULL;	1282	object *last = 0;
1297		1283
1298	/*	1284	/*
1299	* If there are multiple objects on this space, we do some trickier handling.	1285	* If there are multiple objects on this space, we do some trickier handling.
1300	* We've already dealt with merging if appropriate.	1286	* We've already dealt with merging if appropriate.
1301	* Generally, we want to put the new object on top. But if	1287	* Generally, we want to put the new object on top. But if
…		…
1305	* once we get to them. This reduces the need to traverse over all of	1291	* once we get to them. This reduces the need to traverse over all of
1306	* them when adding another one - this saves quite a bit of cpu time	1292	* them when adding another one - this saves quite a bit of cpu time
1307	* when lots of spells are cast in one area. Currently, it is presumed	1293	* when lots of spells are cast in one area. Currently, it is presumed
1308	* that flying non pickable objects are spell objects.	1294	* that flying non pickable objects are spell objects.
1309	*/	1295	*/
1310
1311	while (top != NULL)	1296	while (top)
1312	{	1297	{
1313	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1298	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1314	floor = top;	1299	floor = top;
1315		1300
1316	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1301	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1369	op->above = GET_MAP_OB (op->map, op->x, op->y);	1354	op->above = GET_MAP_OB (op->map, op->x, op->y);
1370		1355
1371	if (op->above)	1356	if (op->above)
1372	op->above->below = op;	1357	op->above->below = op;
1373		1358
1374	op->below = NULL;	1359	op->below = 0;
1375	op->ms ().bottom = op;	1360	op->ms ().bot = op;
1376	}	1361	}
1377	else	1362	else
1378	{ /* get inserted into the stack above top */	1363	{ /* get inserted into the stack above top */
1379	op->above = top->above;	1364	op->above = top->above;
1380		1365
…		…
1383		1368
1384	op->below = top;	1369	op->below = top;
1385	top->above = op;	1370	top->above = op;
1386	}	1371	}
1387		1372
1388	if (op->above == NULL)	1373	if (!op->above)
1389	op->ms ().top = op;	1374	op->ms ().top = op;
1390	} /* else not INS_BELOW_ORIGINATOR */	1375	} /* else not INS_BELOW_ORIGINATOR */
1391		1376
1392	if (op->type == PLAYER)	1377	if (op->type == PLAYER)
		1378	{
1393	op->contr->do_los = 1;	1379	op->contr->do_los = 1;
		1380	++op->map->players;
		1381	op->map->last_access = runtime;
		1382	}
		1383
		1384	op->map->dirty = true;
1394		1385
1395	/* If we have a floor, we know the player, if any, will be above	1386	/* If we have a floor, we know the player, if any, will be above
1396	* it, so save a few ticks and start from there.	1387	* it, so save a few ticks and start from there.
1397	*/	1388	*/
1398	if (!(flag & INS_MAP_LOAD))	1389	if (!(flag & INS_MAP_LOAD))
…		…
1404	* visible to others on this map. But update_all_los is really	1395	* visible to others on this map. But update_all_los is really
1405	* an inefficient way to do this, as it means los for all players	1396	* an inefficient way to do this, as it means los for all players
1406	* on the map will get recalculated. The players could very well	1397	* on the map will get recalculated. The players could very well
1407	* be far away from this change and not affected in any way -	1398	* be far away from this change and not affected in any way -
1408	* this should get redone to only look for players within range,	1399	* this should get redone to only look for players within range,
1409	* or just updating the P_NEED_UPDATE for spaces within this area	1400	* or just updating the P_UPTODATE for spaces within this area
1410	* of effect may be sufficient.	1401	* of effect may be sufficient.
1411	*/	1402	*/
1412	if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))	1403	if (op->map->darkness && (op->glow_radius != 0))
1413	update_all_los (op->map, op->x, op->y);	1404	update_all_los (op->map, op->x, op->y);
1414		1405
1415	/* updates flags (blocked, alive, no magic, etc) for this map space */	1406	/* updates flags (blocked, alive, no magic, etc) for this map space */
1416	update_object (op, UP_OBJ_INSERT);	1407	update_object (op, UP_OBJ_INSERT);
1417		1408
…		…
1463	tmp1->x = op->x;	1454	tmp1->x = op->x;
1464	tmp1->y = op->y;	1455	tmp1->y = op->y;
1465	insert_ob_in_map (tmp1, op->map, op, 0);	1456	insert_ob_in_map (tmp1, op->map, op, 0);
1466	}	1457	}
1467		1458
		1459	object *
		1460	object::insert_at (object where, object originator, int flags)
		1461	{
		1462	where->map->insert (this, where->x, where->y, originator, flags);
		1463	}
		1464
1468	/*	1465	/*
1469	* get_split_ob(ob,nr) splits up ob into two parts. The part which	1466	* get_split_ob(ob,nr) splits up ob into two parts. The part which
1470	* is returned contains nr objects, and the remaining parts contains	1467	* is returned contains nr objects, and the remaining parts contains
1471	* the rest (or is removed and freed if that number is 0).	1468	* the rest (or is removed and freed if that number is 0).
1472	* On failure, NULL is returned, and the reason put into the	1469	* On failure, NULL is returned, and the reason put into the
1473	* global static errmsg array.	1470	* global static errmsg array.
1474	*/	1471	*/
1475
1476	object *	1472	object *
1477	get_split_ob (object *orig_ob, uint32 nr)	1473	get_split_ob (object *orig_ob, uint32 nr)
1478	{	1474	{
1479	object *newob;	1475	object *newob;
1480	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);	1476	int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
…		…
1703	if ((op->glow_radius != 0) && map)	1699	if ((op->glow_radius != 0) && map)
1704	{	1700	{
1705	#ifdef DEBUG_LIGHTS	1701	#ifdef DEBUG_LIGHTS
1706	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);	1702	LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1707	#endif /* DEBUG_LIGHTS */	1703	#endif /* DEBUG_LIGHTS */
1708	if (MAP_DARKNESS (map))	1704	if (map->darkness)
1709	update_all_los (map, x, y);	1705	update_all_los (map, x, y);
1710	}	1706	}
1711		1707
1712	/* Client has no idea of ordering so lets not bother ordering it here.	1708	/* Client has no idea of ordering so lets not bother ordering it here.
1713	* It sure simplifies this function...	1709	* It sure simplifies this function...
…		…
1744	*	1740	*
1745	* MSW 2001-07-08: Check all objects on space, not just those below	1741	* MSW 2001-07-08: Check all objects on space, not just those below
1746	* object being inserted. insert_ob_in_map may not put new objects	1742	* object being inserted. insert_ob_in_map may not put new objects
1747	* on top.	1743	* on top.
1748	*/	1744	*/
1749
1750	int	1745	int
1751	check_move_on (object op, object originator)	1746	check_move_on (object op, object originator)
1752	{	1747	{
1753	object *tmp;	1748	object *tmp;
1754	maptile *m = op->map;	1749	maptile *m = op->map;
…		…
1781		1776
1782	/* The objects have to be checked from top to bottom.	1777	/* The objects have to be checked from top to bottom.
1783	* Hence, we first go to the top:	1778	* Hence, we first go to the top:
1784	*/	1779	*/
1785		1780
1786	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)
1787	{	1782	{
1788	/* Trim the search when we find the first other spell effect	1783	/* Trim the search when we find the first other spell effect
1789	* 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,
1790	* we don't need to check all of them.	1785	* we don't need to check all of them.
1791	*/	1786	*/
…		…
1846	/*	1841	/*
1847	* present_arch(arch, map, x, y) searches for any objects with	1842	* present_arch(arch, map, x, y) searches for any objects with
1848	* a matching archetype at the given map and coordinates.	1843	* a matching archetype at the given map and coordinates.
1849	* The first matching object is returned, or NULL if none.	1844	* The first matching object is returned, or NULL if none.
1850	*/	1845	*/
1851
1852	object *	1846	object *
1853	present_arch (const archetype at, maptile m, int x, int y)	1847	present_arch (const archetype at, maptile m, int x, int y)
1854	{	1848	{
1855	object *
1856	tmp;
1857
1858	if (m == NULL \|\| out_of_map (m, x, y))	1849	if (m == NULL \|\| out_of_map (m, x, y))
1859	{	1850	{
1860	LOG (llevError, "Present_arch called outside map.\n");	1851	LOG (llevError, "Present_arch called outside map.\n");
1861	return NULL;	1852	return NULL;
1862	}	1853	}
		1854
1863	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)
1864	if (tmp->arch == at)	1856	if (tmp->arch == at)
1865	return tmp;	1857	return tmp;
		1858
1866	return NULL;	1859	return NULL;
1867	}	1860	}
1868		1861
1869	/*	1862	/*
1870	* present(type, map, x, y) searches for any objects with	1863	* present(type, map, x, y) searches for any objects with
1871	* a matching type variable at the given map and coordinates.	1864	* a matching type variable at the given map and coordinates.
1872	* The first matching object is returned, or NULL if none.	1865	* The first matching object is returned, or NULL if none.
1873	*/	1866	*/
1874
1875	object *	1867	object *
1876	present (unsigned char type, maptile *m, int x, int y)	1868	present (unsigned char type, maptile *m, int x, int y)
1877	{	1869	{
1878	object *
1879	tmp;
1880
1881	if (out_of_map (m, x, y))	1870	if (out_of_map (m, x, y))
1882	{	1871	{
1883	LOG (llevError, "Present called outside map.\n");	1872	LOG (llevError, "Present called outside map.\n");
1884	return NULL;	1873	return NULL;
1885	}	1874	}
		1875
1886	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)
1887	if (tmp->type == type)	1877	if (tmp->type == type)
1888	return tmp;	1878	return tmp;
		1879
1889	return NULL;	1880	return NULL;
1890	}	1881	}
1891		1882
1892	/*	1883	/*
1893	* present_in_ob(type, object) searches for any objects with	1884	* present_in_ob(type, object) searches for any objects with
1894	* a matching type variable in the inventory of the given object.	1885	* a matching type variable in the inventory of the given object.
1895	* The first matching object is returned, or NULL if none.	1886	* The first matching object is returned, or NULL if none.
1896	*/	1887	*/
1897
1898	object *	1888	object *
1899	present_in_ob (unsigned char type, const object *op)	1889	present_in_ob (unsigned char type, const object *op)
1900	{	1890	{
1901	object *
1902	tmp;
1903
1904	for (tmp = op->inv; tmp != NULL; tmp = tmp->below)	1891	for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1905	if (tmp->type == type)	1892	if (tmp->type == type)
1906	return tmp;	1893	return tmp;
		1894
1907	return NULL;	1895	return NULL;
1908	}	1896	}
1909		1897
1910	/*	1898	/*
1911	* present_in_ob (type, str, object) searches for any objects with	1899	* present_in_ob (type, str, object) searches for any objects with
…		…
1922	* to be unique.	1910	* to be unique.
1923	*/	1911	*/
1924	object *	1912	object *
1925	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)
1926	{	1914	{
1927	object *tmp;
1928
1929	for (tmp = op->inv; tmp; tmp = tmp->below)	1915	for (object *tmp = op->inv; tmp; tmp = tmp->below)
1930	if ((type == -1 \|\| tmp->type == type) && (!strcmp (str, tmp->name)))	1916	if ((type == -1 \|\| tmp->type == type) && (!strcmp (str, tmp->name)))
1931	return tmp;	1917	return tmp;
1932		1918
1933	return 0;	1919	return 0;
1934	}	1920	}
…		…
2143		2129
2144	if ((move_type & blocked) == move_type)	2130	if ((move_type & blocked) == move_type)
2145	max = maxfree[i];	2131	max = maxfree[i];
2146	else if (mflags & P_IS_ALIVE)	2132	else if (mflags & P_IS_ALIVE)
2147	{	2133	{
2148	for (tmp = ms.bottom; tmp; tmp = tmp->above)	2134	for (tmp = ms.bot; tmp; tmp = tmp->above)
2149	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)	2135	if ((tmp->flag [FLAG_MONSTER] \|\| tmp->type == PLAYER)
2150	&& (tmp != exclude \|\| (tmp->head && tmp->head != exclude)))	2136	&& (tmp != exclude \|\| (tmp->head && tmp->head != exclude)))
2151	break;	2137	break;
2152		2138
2153	if (tmp)	2139	if (tmp)
…		…
2620	}	2606	}
2621	else	2607	else
2622	item = item->env;	2608	item = item->env;
2623	}	2609	}
2624		2610
		2611
		2612	const char *
		2613	object::flag_desc (char *desc, int len) const
		2614	{
		2615	char *p = desc;
		2616	bool first = true;
		2617
		2618	for (int i = 0; i < NUM_FLAGS; i++)
		2619	{
		2620	if (len <= 10) // magic constant!
		2621	{
		2622	snprintf (p, len, ",...");
		2623	break;
		2624	}
		2625
		2626	if (flag[i])
		2627	{
		2628	int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
		2629	len -= cnt;
		2630	p += cnt;
		2631	first = false;
		2632	}
		2633	}
		2634
		2635	return desc;
		2636	}
		2637
2625	// return a suitable string describing an objetc in enough detail to find it	2638	// return a suitable string describing an objetc in enough detail to find it
2626	const char *	2639	const char *
2627	object::debug_desc (char *info) const	2640	object::debug_desc (char *info) const
2628	{	2641	{
		2642	char flagdesc[512];
2629	char info2[256 * 3];	2643	char info2[256 * 4];
2630	char *p = info;	2644	char *p = info;
2631		2645
2632	p += snprintf (p, 256, "%d=\"%s%s%s\"",	2646	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",
2633	count,	2647	count, uuid.seq,
2634	&name,	2648	&name,
2635	title ? " " : "",	2649	title ? "\",title:" : "",
2636	title ? (const char *)title : "");	2650	title ? (const char *)title : "",
		2651	flag_desc (flagdesc, 512), type);
2637		2652
2638	if (env)	2653	if (env)
2639	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2654	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2640		2655
2641	if (map)	2656	if (map)
2642	p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);	2657	p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2643		2658
2644	return info;	2659	return info;
2645	}	2660	}
2646		2661
2647	const char *	2662	const char *

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.82 by root, Mon Dec 25 11:25:49 2006 UTC vs. Revision 1.99 by root, Sun Dec 31 18:10:40 2006 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.82 by root, Mon Dec 25 11:25:49 2006 UTC vs.
Revision 1.99 by root, Sun Dec 31 18:10:40 2006 UTC