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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.107 by pippijn, Sat Jan 6 14:42:29 2007 UTC vs.
Revision 1.130 by root, Sat Feb 10 01:52:25 2007 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game for X-windows
3		3	*
4	Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5	Copyright (C) 2001 Mark Wedel & Crossfire Development Team	5	* Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
7		7	*
8	This program is free software; you can redistribute it and/or modify	8	* This program is free software; you can redistribute it and/or modify
9	it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
10	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation; either version 2 of the License, or
11	(at your option) any later version.	11	* (at your option) any later version.
12		12	*
13	This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	GNU General Public License for more details.	16	* GNU General Public License for more details.
17		17	*
18	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
19	along with this program; if not, write to the Free Software	19	* along with this program; if not, write to the Free Software
20	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21		21	*
22	The authors can be reached via e-mail at <crossfire@schmorp.de>	22	* The authors can be reached via e-mail at <crossfire@schmorp.de>
23	*/	23	*/
24		24
25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.	25	/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26	sub/add_weight will transcend the environment updating the carrying	26	sub/add_weight will transcend the environment updating the carrying
27	variable. */	27	variable. */
28	#include <global.h>	28	#include <global.h>
37		37
38	int nrofallocobjects = 0;	38	int nrofallocobjects = 0;
39	static UUID uuid;	39	static UUID uuid;
40	const uint64 UUID_SKIP = 1<<19;	40	const uint64 UUID_SKIP = 1<<19;
41		41
42	object active_objects; / List of active objects that need to be processed */	42	objectvec objects;
		43	activevec actives;
43		44
44	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,	45	short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
45	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1	46	0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
46	};	47	};
47	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,	48	short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
…		…
391	}	392	}
392		393
393	/*	394	/*
394	* Returns the object which has the count-variable equal to the argument.	395	* Returns the object which has the count-variable equal to the argument.
395	*/	396	*/
396
397	object *	397	object *
398	find_object (tag_t i)	398	find_object (tag_t i)
399	{	399	{
400	for (object *op = object::first; op; op = op->next)	400	for_all_objects (op)
401	if (op->count == i)	401	if (op->count == i)
402	return op;	402	return op;
403		403
404	return 0;	404	return 0;
405	}	405	}
406		406
407	/*	407	/*
408	* Returns the first object which has a name equal to the argument.	408	* Returns the first object which has a name equal to the argument.
409	* Used only by the patch command, but not all that useful.	409	* Used only by the patch command, but not all that useful.
410	* Enables features like "patch <name-of-other-player> food 999"	410	* Enables features like "patch <name-of-other-player> food 999"
411	*/	411	*/
412
413	object *	412	object *
414	find_object_name (const char *str)	413	find_object_name (const char *str)
415	{	414	{
416	shstr_cmp str_ (str);	415	shstr_cmp str_ (str);
417	object *op;	416	object *op;
418		417
419	for (op = object::first; op != NULL; op = op->next)	418	for_all_objects (op)
420	if (op->name == str_)	419	if (op->name == str_)
421	break;	420	break;
422		421
423	return op;	422	return op;
424	}	423	}
…		…
490		489
491	if (is_removed)	490	if (is_removed)
492	SET_FLAG (dst, FLAG_REMOVED);	491	SET_FLAG (dst, FLAG_REMOVED);
493		492
494	if (speed < 0)	493	if (speed < 0)
495	dst->speed_left = speed_left - RANDOM () % 200 / 100.0;	494	dst->speed_left = speed_left - rndm ();
496		495
497	/* Copy over key_values, if any. */	496	/* Copy over key_values, if any. */
498	if (key_values)	497	if (key_values)
499	{	498	{
500	key_value *tail = 0;	499	key_value *tail = 0;
…		…
661		660
662	if (op->more)	661	if (op->more)
663	update_object (op->more, action);	662	update_object (op->more, action);
664	}	663	}
665		664
666	object *object::first;
667
668	object::object ()	665	object::object ()
669	{	666	{
670	SET_FLAG (this, FLAG_REMOVED);	667	SET_FLAG (this, FLAG_REMOVED);
671		668
672	expmul = 1.0;	669	expmul = 1.0;
673	face = blank_face;	670	face = blank_face;
674	}	671	}
675		672
676	object::~object ()	673	object::~object ()
677	{	674	{
		675	unlink ();
		676
678	free_key_values (this);	677	free_key_values (this);
679	}	678	}
680		679
		680	static int object_count;
		681
681	void object::link ()	682	void object::link ()
682	{	683	{
683	count = ++ob_count;	684	assert (!index);//D
684	uuid = gen_uuid ();	685	uuid = gen_uuid ();
		686	count = ++object_count;
685		687
686	prev = 0;	688	refcnt_inc ();
687	next = object::first;	689	objects.insert (this);
688
689	if (object::first)
690	object::first->prev = this;
691
692	object::first = this;
693	}	690	}
694		691
695	void object::unlink ()	692	void object::unlink ()
696	{	693	{
697	if (this == object::first)	694	if (!index)
698	object::first = next;	695	return;
699		696
700	/* Remove this object from the list of used objects */	697	objects.erase (this);
701	if (prev) prev->next = next;	698	refcnt_dec ();
702	if (next) next->prev = prev;
703
704	prev = 0;
705	next = 0;
706	}
707
708	bool
709	object::active () const
710	{
711	return active_next \|\| active_prev \|\| this == active_objects;
712	}	699	}
713		700
714	void	701	void
715	object::activate ()	702	object::activate ()
716	{	703	{
717	/* If already on active list, don't do anything */	704	/* If already on active list, don't do anything */
718	if (active ())	705	if (active)
719	return;	706	return;
720		707
721	if (has_active_speed ())	708	if (has_active_speed ())
722	{	709	actives.insert (this);
723	/* process_events() expects us to insert the object at the beginning
724	* of the list. */
725	active_next = active_objects;
726
727	if (active_next)
728	active_next->active_prev = this;
729
730	active_objects = this;
731	}
732	}	710	}
733		711
734	void	712	void
735	object::activate_recursive ()	713	object::activate_recursive ()
736	{	714	{
…		…
750	*/	728	*/
751	void	729	void
752	object::deactivate ()	730	object::deactivate ()
753	{	731	{
754	/* If not on the active list, nothing needs to be done */	732	/* If not on the active list, nothing needs to be done */
755	if (!active ())	733	if (!active)
756	return;	734	return;
757		735
758	if (active_prev == 0)	736	actives.erase (this);
759	{
760	active_objects = active_next;
761	if (active_next)
762	active_next->active_prev = 0;
763	}
764	else
765	{
766	active_prev->active_next = active_next;
767	if (active_next)
768	active_next->active_prev = active_prev;
769	}
770
771	active_next = 0;
772	active_prev = 0;
773	}	737	}
774		738
775	void	739	void
776	object::deactivate_recursive ()	740	object::deactivate_recursive ()
777	{	741	{
…		…
811	* drop on that space.	775	* drop on that space.
812	*/	776	*/
813	if (!drop_to_ground	777	if (!drop_to_ground
814	\|\| !map	778	\|\| !map
815	\|\| map->in_memory != MAP_IN_MEMORY	779	\|\| map->in_memory != MAP_IN_MEMORY
		780	\|\| map->nodrop
816	\|\| ms ().move_block == MOVE_ALL)	781	\|\| ms ().move_block == MOVE_ALL)
817	{	782	{
818	while (inv)	783	while (inv)
819	{	784	{
820	inv->destroy_inv (drop_to_ground);	785	inv->destroy_inv (drop_to_ground);
…		…
829		794
830	if (op->flag [FLAG_STARTEQUIP]	795	if (op->flag [FLAG_STARTEQUIP]
831	\|\| op->flag [FLAG_NO_DROP]	796	\|\| op->flag [FLAG_NO_DROP]
832	\|\| op->type == RUNE	797	\|\| op->type == RUNE
833	\|\| op->type == TRAP	798	\|\| op->type == TRAP
834	\|\| op->flag [FLAG_IS_A_TEMPLATE])	799	\|\| op->flag [FLAG_IS_A_TEMPLATE]
		800	\|\| op->flag [FLAG_DESTROY_ON_DEATH])
835	op->destroy ();	801	op->destroy ();
836	else	802	else
837	map->insert (op, x, y);	803	map->insert (op, x, y);
838	}	804	}
839	}	805	}
…		…
847	}	813	}
848		814
849	void	815	void
850	object::do_destroy ()	816	object::do_destroy ()
851	{	817	{
		818	attachable::do_destroy ();
		819
852	if (flag [FLAG_IS_LINKED])	820	if (flag [FLAG_IS_LINKED])
853	remove_button_link (this);	821	remove_button_link (this);
854		822
855	if (flag [FLAG_FRIENDLY])	823	if (flag [FLAG_FRIENDLY])
		824	{
856	remove_friendly_object (this);	825	remove_friendly_object (this);
		826
		827	if (type == GOLEM
		828	&& owner
		829	&& owner->type == PLAYER
		830	&& owner->contr->ranges[range_golem] == this)
		831	owner->contr->ranges[range_golem] = 0;
		832	}
857		833
858	if (!flag [FLAG_REMOVED])	834	if (!flag [FLAG_REMOVED])
859	remove ();	835	remove ();
860		836
861	if (flag [FLAG_FREED])	837	destroy_inv (true);
862	return;
863		838
864	set_speed (0);	839	deactivate ();
		840	unlink ();
865		841
866	flag [FLAG_FREED] = 1;	842	flag [FLAG_FREED] = 1;
867
868	attachable::do_destroy ();
869
870	destroy_inv (true);
871	unlink ();
872		843
873	// hack to ensure that freed objects still have a valid map	844	// hack to ensure that freed objects still have a valid map
874	{	845	{
875	static maptile *freed_map; // freed objects are moved here to avoid crashes	846	static maptile *freed_map; // freed objects are moved here to avoid crashes
876		847
…		…
901		872
902	// clear those pointers that likely might have circular references to us	873	// clear those pointers that likely might have circular references to us
903	owner = 0;	874	owner = 0;
904	enemy = 0;	875	enemy = 0;
905	attacked_by = 0;	876	attacked_by = 0;
906
907	// only relevant for players(?), but make sure of it anyways
908	contr = 0;
909	}	877	}
910		878
911	void	879	void
912	object::destroy (bool destroy_inventory)	880	object::destroy (bool destroy_inventory)
913	{	881	{
…		…
941	* This function removes the object op from the linked list of objects	909	* This function removes the object op from the linked list of objects
942	* which it is currently tied to. When this function is done, the	910	* which it is currently tied to. When this function is done, the
943	* object will have no environment. If the object previously had an	911	* object will have no environment. If the object previously had an
944	* environment, the x and y coordinates will be updated to	912	* environment, the x and y coordinates will be updated to
945	* the previous environment.	913	* the previous environment.
946	* Beware: This function is called from the editor as well!
947	*/	914	*/
948	void	915	void
949	object::remove ()	916	object::do_remove ()
950	{	917	{
951	object tmp, last = 0;	918	object tmp, last = 0;
952	object *otmp;	919	object *otmp;
953		920
954	if (QUERY_FLAG (this, FLAG_REMOVED))	921	if (QUERY_FLAG (this, FLAG_REMOVED))
…		…
997	}	964	}
998	else if (map)	965	else if (map)
999	{	966	{
1000	if (type == PLAYER)	967	if (type == PLAYER)
1001	{	968	{
		969	// leaving a spot always closes any open container on the ground
		970	if (container && !container->env)
		971	// this causes spurious floorbox updates, but it ensures
		972	// that the CLOSE event is being sent.
		973	close_container ();
		974
1002	--map->players;	975	--map->players;
1003	map->touch ();	976	map->touch ();
1004	}	977	}
1005		978
1006	map->dirty = true;	979	map->dirty = true;
		980	mapspace &ms = this->ms ();
1007		981
1008	/* link the object above us */	982	/* link the object above us */
1009	if (above)	983	if (above)
1010	above->below = below;	984	above->below = below;
1011	else	985	else
1012	map->at (x, y).top = below; /* we were top, set new top */	986	ms.top = below; /* we were top, set new top */
1013		987
1014	/* Relink the object below us, if there is one */	988	/* Relink the object below us, if there is one */
1015	if (below)	989	if (below)
1016	below->above = above;	990	below->above = above;
1017	else	991	else
…		…
1019	/* Nothing below, which means we need to relink map object for this space	993	/* Nothing below, which means we need to relink map object for this space
1020	* use translated coordinates in case some oddness with map tiling is	994	* use translated coordinates in case some oddness with map tiling is
1021	* evident	995	* evident
1022	*/	996	*/
1023	if (GET_MAP_OB (map, x, y) != this)	997	if (GET_MAP_OB (map, x, y) != this)
1024	{
1025	char *dump = dump_object (this);
1026	LOG (llevError,
1027	"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);	998	LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1028	free (dump);
1029	dump = dump_object (GET_MAP_OB (map, x, y));
1030	LOG (llevError, "%s\n", dump);
1031	free (dump);
1032	}
1033		999
1034	map->at (x, y).bot = above; /* goes on above it. */	1000	ms.bot = above; /* goes on above it. */
1035	}	1001	}
1036		1002
1037	above = 0;	1003	above = 0;
1038	below = 0;	1004	below = 0;
1039		1005
1040	if (map->in_memory == MAP_SAVING)	1006	if (map->in_memory == MAP_SAVING)
1041	return;	1007	return;
1042		1008
1043	int check_walk_off = !flag [FLAG_NO_APPLY];	1009	int check_walk_off = !flag [FLAG_NO_APPLY];
1044		1010
1045	for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)	1011	for (tmp = ms.bot; tmp; tmp = tmp->above)
1046	{	1012	{
1047	/* No point updating the players look faces if he is the object	1013	/* No point updating the players look faces if he is the object
1048	* being removed.	1014	* being removed.
1049	*/	1015	*/
1050		1016
…		…
1131		1097
1132	return 0;	1098	return 0;
1133	}	1099	}
1134		1100
1135	/*	1101	/*
1136	* same as insert_ob_in_map except it handle separate coordinates and do a clean	1102	* same as insert_ob_in_map except it handles separate coordinates and does a clean
1137	* job preparing multi-part monsters	1103	* job preparing multi-part monsters.
1138	*/	1104	*/
1139	object *	1105	object *
1140	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)	1106	insert_ob_in_map_at (object op, maptile m, object *originator, int flag, int x, int y)
1141	{	1107	{
1142	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)	1108	for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
…		…
1170	*/	1136	*/
1171	object *	1137	object *
1172	insert_ob_in_map (object op, maptile m, object *originator, int flag)	1138	insert_ob_in_map (object op, maptile m, object *originator, int flag)
1173	{	1139	{
1174	object tmp, top, *floor = NULL;	1140	object tmp, top, *floor = NULL;
1175	sint16 x, y;
1176		1141
1177	if (QUERY_FLAG (op, FLAG_FREED))	1142	if (QUERY_FLAG (op, FLAG_FREED))
1178	{	1143	{
1179	LOG (llevError, "Trying to insert freed object!\n");	1144	LOG (llevError, "Trying to insert freed object!\n");
1180	return NULL;	1145	return NULL;
1181	}	1146	}
		1147
		1148	if (!QUERY_FLAG (op, FLAG_REMOVED))
		1149	LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
		1150
		1151	op->remove ();
1182		1152
1183	if (!m)	1153	if (!m)
1184	{	1154	{
1185	char *dump = dump_object (op);	1155	char *dump = dump_object (op);
1186	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);	1156	LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
…		…
1201	#endif	1171	#endif
1202	free (dump);	1172	free (dump);
1203	return op;	1173	return op;
1204	}	1174	}
1205		1175
1206	if (!QUERY_FLAG (op, FLAG_REMOVED))
1207	{
1208	char *dump = dump_object (op);
1209	LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1210	free (dump);
1211	return op;
1212	}
1213
1214	if (op->more)
1215	{
1216	/* The part may be on a different map. */
1217
1218	object *more = op->more;	1176	if (object *more = op->more)
1219		1177	{
1220	/* We really need the caller to normalise coordinates - if
1221	* we set the map, that doesn't work if the location is within
1222	* a map and this is straddling an edge. So only if coordinate
1223	* is clear wrong do we normalise it.
1224	*/
1225	if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1226	more->map = get_map_from_coord (m, &more->x, &more->y);
1227	else if (!more->map)
1228	{
1229	/* For backwards compatibility - when not dealing with tiled maps,
1230	* more->map should always point to the parent.
1231	*/
1232	more->map = m;
1233	}
1234
1235	if (insert_ob_in_map (more, more->map, originator, flag) == NULL)	1178	if (!insert_ob_in_map (more, m, originator, flag))
1236	{	1179	{
1237	if (!op->head)	1180	if (!op->head)
1238	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");	1181	LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1239		1182
1240	return 0;	1183	return 0;
…		…
1245		1188
1246	/* Ideally, the caller figures this out. However, it complicates a lot	1189	/* Ideally, the caller figures this out. However, it complicates a lot
1247	* of areas of callers (eg, anything that uses find_free_spot would now	1190	* of areas of callers (eg, anything that uses find_free_spot would now
1248	* need extra work	1191	* need extra work
1249	*/	1192	*/
1250	op->map = get_map_from_coord (m, &op->x, &op->y);	1193	if (!xy_normalise (m, op->x, op->y))
1251	x = op->x;	1194	return 0;
1252	y = op->y;	1195
		1196	op->map = m;
		1197	mapspace &ms = op->ms ();
1253		1198
1254	/* this has to be done after we translate the coordinates.	1199	/* this has to be done after we translate the coordinates.
1255	*/	1200	*/
1256	if (op->nrof && !(flag & INS_NO_MERGE))	1201	if (op->nrof && !(flag & INS_NO_MERGE))
1257	for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)	1202	for (tmp = ms.bot; tmp; tmp = tmp->above)
1258	if (object::can_merge (op, tmp))	1203	if (object::can_merge (op, tmp))
1259	{	1204	{
1260	op->nrof += tmp->nrof;	1205	op->nrof += tmp->nrof;
1261	tmp->destroy ();	1206	tmp->destroy ();
1262	}	1207	}
…		…
1279	op->below = originator->below;	1224	op->below = originator->below;
1280		1225
1281	if (op->below)	1226	if (op->below)
1282	op->below->above = op;	1227	op->below->above = op;
1283	else	1228	else
1284	op->ms ().bot = op;	1229	ms.bot = op;
1285		1230
1286	/* since below originator, no need to update top */	1231	/* since below originator, no need to update top */
1287	originator->below = op;	1232	originator->below = op;
1288	}	1233	}
1289	else	1234	else
1290	{	1235	{
		1236	top = ms.bot;
		1237
1291	/* If there are other objects, then */	1238	/* If there are other objects, then */
1292	if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))	1239	if ((!(flag & INS_MAP_LOAD)) && top)
1293	{	1240	{
1294	object *last = 0;	1241	object *last = 0;
1295		1242
1296	/*	1243	/*
1297	* If there are multiple objects on this space, we do some trickier handling.	1244	* If there are multiple objects on this space, we do some trickier handling.
…		…
1303	* once we get to them. This reduces the need to traverse over all of	1250	* once we get to them. This reduces the need to traverse over all of
1304	* them when adding another one - this saves quite a bit of cpu time	1251	* them when adding another one - this saves quite a bit of cpu time
1305	* when lots of spells are cast in one area. Currently, it is presumed	1252	* when lots of spells are cast in one area. Currently, it is presumed
1306	* that flying non pickable objects are spell objects.	1253	* that flying non pickable objects are spell objects.
1307	*/	1254	*/
1308	while (top)	1255	for (top = ms.bot; top; top = top->above)
1309	{	1256	{
1310	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))	1257	if (QUERY_FLAG (top, FLAG_IS_FLOOR) \|\| QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1311	floor = top;	1258	floor = top;
1312		1259
1313	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))	1260	if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW \| MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
…		…
1316	top = top->below;	1263	top = top->below;
1317	break;	1264	break;
1318	}	1265	}
1319		1266
1320	last = top;	1267	last = top;
1321	top = top->above;
1322	}	1268	}
1323		1269
1324	/* Don't want top to be NULL, so set it to the last valid object */	1270	/* Don't want top to be NULL, so set it to the last valid object */
1325	top = last;	1271	top = last;
1326		1272
…		…
1333	* Unless those objects are exits, type 66	1279	* Unless those objects are exits, type 66
1334	* If INS_ON_TOP is used, don't do this processing	1280	* If INS_ON_TOP is used, don't do this processing
1335	* Need to find the object that in fact blocks view, otherwise	1281	* Need to find the object that in fact blocks view, otherwise
1336	* stacking is a bit odd.	1282	* stacking is a bit odd.
1337	*/	1283	*/
1338	if (!(flag & INS_ON_TOP) &&	1284	if (!(flag & INS_ON_TOP)
1339	(get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))	1285	&& ms.flags () & P_BLOCKSVIEW
		1286	&& (op->face && !op->face->visibility))
1340	{	1287	{
1341	for (last = top; last != floor; last = last->below)	1288	for (last = top; last != floor; last = last->below)
1342	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))	1289	if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1343	break;	1290	break;
		1291
1344	/* Check to see if we found the object that blocks view,	1292	/* Check to see if we found the object that blocks view,
1345	* and make sure we have a below pointer for it so that	1293	* and make sure we have a below pointer for it so that
1346	* we can get inserted below this one, which requires we	1294	* we can get inserted below this one, which requires we
1347	* set top to the object below us.	1295	* set top to the object below us.
1348	*/	1296	*/
…		…
1350	top = last->below;	1298	top = last->below;
1351	}	1299	}
1352	} /* If objects on this space */	1300	} /* If objects on this space */
1353		1301
1354	if (flag & INS_MAP_LOAD)	1302	if (flag & INS_MAP_LOAD)
1355	top = GET_MAP_TOP (op->map, op->x, op->y);	1303	top = ms.top;
1356		1304
1357	if (flag & INS_ABOVE_FLOOR_ONLY)	1305	if (flag & INS_ABOVE_FLOOR_ONLY)
1358	top = floor;	1306	top = floor;
1359		1307
1360	/* Top is the object that our object (op) is going to get inserted above.	1308	/* Top is the object that our object (op) is going to get inserted above.
1361	*/	1309	*/
1362		1310
1363	/* First object on this space */	1311	/* First object on this space */
1364	if (!top)	1312	if (!top)
1365	{	1313	{
1366	op->above = GET_MAP_OB (op->map, op->x, op->y);	1314	op->above = ms.bot;
1367		1315
1368	if (op->above)	1316	if (op->above)
1369	op->above->below = op;	1317	op->above->below = op;
1370		1318
1371	op->below = 0;	1319	op->below = 0;
1372	op->ms ().bot = op;	1320	ms.bot = op;
1373	}	1321	}
1374	else	1322	else
1375	{ /* get inserted into the stack above top */	1323	{ /* get inserted into the stack above top */
1376	op->above = top->above;	1324	op->above = top->above;
1377		1325
…		…
1381	op->below = top;	1329	op->below = top;
1382	top->above = op;	1330	top->above = op;
1383	}	1331	}
1384		1332
1385	if (!op->above)	1333	if (!op->above)
1386	op->ms ().top = op;	1334	ms.top = op;
1387	} /* else not INS_BELOW_ORIGINATOR */	1335	} /* else not INS_BELOW_ORIGINATOR */
1388		1336
1389	if (op->type == PLAYER)	1337	if (op->type == PLAYER)
1390	{	1338	{
1391	op->contr->do_los = 1;	1339	op->contr->do_los = 1;
…		…
1397		1345
1398	/* If we have a floor, we know the player, if any, will be above	1346	/* If we have a floor, we know the player, if any, will be above
1399	* it, so save a few ticks and start from there.	1347	* it, so save a few ticks and start from there.
1400	*/	1348	*/
1401	if (!(flag & INS_MAP_LOAD))	1349	if (!(flag & INS_MAP_LOAD))
1402	if (object *pl = op->ms ().player ())	1350	if (object *pl = ms.player ())
1403	if (pl->contr->ns)	1351	if (pl->contr->ns)
1404	pl->contr->ns->floorbox_update ();	1352	pl->contr->ns->floorbox_update ();
1405		1353
1406	/* If this object glows, it may affect lighting conditions that are	1354	/* If this object glows, it may affect lighting conditions that are
1407	* visible to others on this map. But update_all_los is really	1355	* visible to others on this map. But update_all_los is really
…		…
1816	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|	1764	if ((!op->move_type && tmp->move_slow & MOVE_WALK) \|\|
1817	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))	1765	((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1818	{	1766	{
1819		1767
1820	float	1768	float
1821	diff = tmp->move_slow_penalty * FABS (op->speed);	1769	diff = tmp->move_slow_penalty * fabs (op->speed);
1822		1770
1823	if (op->type == PLAYER)	1771	if (op->type == PLAYER)
1824	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|	1772	if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) \|\|
1825	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))	1773	(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1826	diff /= 4.0;	1774	diff /= 4.0;
…		…
2033	}	1981	}
2034		1982
2035	if (!index)	1983	if (!index)
2036	return -1;	1984	return -1;
2037		1985
2038	return altern[RANDOM () % index];	1986	return altern [rndm (index)];
2039	}	1987	}
2040		1988
2041	/*	1989	/*
2042	* find_first_free_spot(archetype, maptile, x, y) works like	1990	* find_first_free_spot(archetype, maptile, x, y) works like
2043	* find_free_spot(), but it will search max number of squares.	1991	* find_free_spot(), but it will search max number of squares.
…		…
2064	{	2012	{
2065	arr += begin;	2013	arr += begin;
2066	end -= begin;	2014	end -= begin;
2067		2015
2068	while (--end)	2016	while (--end)
2069	swap (arr [end], arr [RANDOM () % (end + 1)]);	2017	swap (arr [end], arr [rndm (end + 1)]);
2070	}	2018	}
2071		2019
2072	/* new function to make monster searching more efficient, and effective!	2020	/* new function to make monster searching more efficient, and effective!
2073	* This basically returns a randomized array (in the passed pointer) of	2021	* This basically returns a randomized array (in the passed pointer) of
2074	* the spaces to find monsters. In this way, it won't always look for	2022	* the spaces to find monsters. In this way, it won't always look for
…		…
2208		2156
2209	return 3;	2157	return 3;
2210	}	2158	}
2211		2159
2212	/*	2160	/*
2213	* absdir(int): Returns a number between 1 and 8, which represent
2214	* the "absolute" direction of a number (it actually takes care of
2215	* "overflow" in previous calculations of a direction).
2216	*/
2217
2218	int
2219	absdir (int d)
2220	{
2221	while (d < 1)
2222	d += 8;
2223
2224	while (d > 8)
2225	d -= 8;
2226
2227	return d;
2228	}
2229
2230	/*
2231	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is	2161	* dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2232	* between two directions (which are expected to be absolute (see absdir())	2162	* between two directions (which are expected to be absolute (see absdir())
2233	*/	2163	*/
2234
2235	int	2164	int
2236	dirdiff (int dir1, int dir2)	2165	dirdiff (int dir1, int dir2)
2237	{	2166	{
2238	int d;	2167	int d;
2239		2168
…		…
2655	{	2584	{
2656	char flagdesc[512];	2585	char flagdesc[512];
2657	char info2[256 * 4];	2586	char info2[256 * 4];
2658	char *p = info;	2587	char *p = info;
2659		2588
2660	p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",	2589	p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2661	count, uuid.seq,	2590	count, uuid.seq,
2662	&name,	2591	&name,
2663	title ? "\",title:" : "",	2592	title ? "\",title:\"" : "",
2664	title ? (const char *)title : "",	2593	title ? (const char *)title : "",
2665	flag_desc (flagdesc, 512), type);	2594	flag_desc (flagdesc, 512), type);
2666		2595
2667	if (env)	2596	if (env)
2668	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));	2597	p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
…		…
2678	{	2607	{
2679	static char info[256 * 4];	2608	static char info[256 * 4];
2680	return debug_desc (info);	2609	return debug_desc (info);
2681	}	2610	}
2682		2611
		2612	const char *
		2613	object::debug_desc2 () const
		2614	{
		2615	static char info[256 * 4];
		2616	return debug_desc (info);
		2617	}
		2618
		2619	struct region *
		2620	object::region () const
		2621	{
		2622	return map ? map->region (x, y)
		2623	: region::default_region ();
		2624	}
		2625
		2626	const materialtype_t *
		2627	object::dominant_material () const
		2628	{
		2629	if (materialtype_t *mat = name_to_material (materialname))
		2630	return mat;
		2631
		2632	// omfg this is slow, this has to be temporary :)
		2633	shstr unknown ("unknown");
		2634
		2635	return name_to_material (unknown);
		2636	}
		2637
		2638	void
		2639	object::open_container (object *new_container)
		2640	{
		2641	if (container == new_container)
		2642	return;
		2643
		2644	if (object *old_container = container)
		2645	{
		2646	if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
		2647	return;
		2648
		2649	#if 0
		2650	// remove the "Close old_container" object.
		2651	if (object *closer = old_container->inv)
		2652	if (closer->type == CLOSE_CON)
		2653	closer->destroy ();
		2654	#endif
		2655
		2656	old_container->flag [FLAG_APPLIED] = 0;
		2657	container = 0;
		2658
		2659	esrv_update_item (UPD_FLAGS, this, old_container);
		2660	new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
		2661	}
		2662
		2663	if (new_container)
		2664	{
		2665	if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
		2666	return;
		2667
		2668	// TODO: this does not seem to serve any purpose anymore?
		2669	#if 0
		2670	// insert the "Close Container" object.
		2671	if (archetype *closer = new_container->other_arch)
		2672	{
		2673	object *closer = arch_to_object (new_container->other_arch);
		2674	closer->flag [FLAG_NO_MAP_SAVE] = 1;
		2675	new_container->insert (closer);
		2676	}
		2677	#endif
		2678
		2679	new_container->flag [FLAG_APPLIED] = 1;
		2680	container = new_container;
		2681
		2682	esrv_update_item (UPD_FLAGS, this, new_container);
		2683	new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
		2684	}
		2685
		2686	if (contr && contr->ns)
		2687	contr->ns->floorbox_update ();
		2688	}
		2689
		2690

Diff Legend

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

Comparing deliantra/server/common/object.C (file contents): Revision 1.107 by pippijn, Sat Jan 6 14:42:29 2007 UTC vs. Revision 1.130 by root, Sat Feb 10 01:52:25 2007 UTC

Diff Legend

Comparing deliantra/server/common/object.C (file contents):
Revision 1.107 by pippijn, Sat Jan 6 14:42:29 2007 UTC vs.
Revision 1.130 by root, Sat Feb 10 01:52:25 2007 UTC