[ViewVC] Diff of: cvs/deliantra/server/socket/request.C

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.125 by root, Tue Apr 22 04:33:20 2008 UTC vs.
Revision 1.145 by root, Fri Dec 26 10:44:17 2008 UTC

…		…
1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001,2007 Mark Wedel	5	* Copyright (©) 2001,2007 Mark Wedel
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* Deliantra is free software: you can redistribute it and/or modify	8	* Deliantra 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
98	*/	98	*/
99	mx = ns->mapx;	99	mx = ns->mapx;
100	my = ns->mapy;	100	my = ns->mapy;
101		101
102	/* the x and y here are coordinates for the new map, i.e. if we moved	102	/* the x and y here are coordinates for the new map, i.e. if we moved
103	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,	103	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,
104	* if the destination x or y coordinate is outside the viewable	104	* if the destination x or y coordinate is outside the viewable
105	* area, we clear the values - otherwise, the old values	105	* area, we clear the values - otherwise, the old values
106	* are preserved, and the check_head thinks it needs to clear them.	106	* are preserved, and the check_head thinks it needs to clear them.
107	*/	107	*/
108	for (x = 0; x < mx; x++)	108	for (x = 0; x < mx; x++)
109	{
110	for (y = 0; y < my; y++)	109	for (y = 0; y < my; y++)
111	{
112	if (x >= ns->mapx \|\| y >= ns->mapy)	110	if (x >= ns->mapx \|\| y >= ns->mapy)
113	/* clear cells outside the viewable area */	111	/* clear cells outside the viewable area */
114	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));	112	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));
115	else if ((x + dx) < 0 \|\| (x + dx) >= ns->mapx \|\| (y + dy) < 0 \|\| (y + dy) >= ns->mapy)	113	else if ((x + dx) < 0 \|\| (x + dx) >= ns->mapx \|\| (y + dy) < 0 \|\| (y + dy) >= ns->mapy)
116	/* clear newly visible tiles within the viewable area */	114	/* clear newly visible tiles within the viewable area */
117	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));	115	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
118	else	116	else
119	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));	117	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
120	}
121	}
122		118
123	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));	119	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
124		120
125	/* Make sure that the next "map1" command will be sent (even if it is	121	/* Make sure that the next "map1" command will be sent (even if it is
126	* empty).	122	* empty).
…		…
141	pl->ns->send_packet ("newmap");	137	pl->ns->send_packet ("newmap");
142		138
143	pl->ns->floorbox_reset ();	139	pl->ns->floorbox_reset ();
144	}	140	}
145		141
		142	static void
		143	send_map_info (player *pl)
		144	{
		145	client &socket = *pl->ns;
		146	object *ob = pl->observe;
		147
		148	if (socket.mapinfocmd)
		149	{
		150	if (ob->map && ob->map->path[0])
		151	{
		152	int flags = 0;
		153
		154	if (ob->map->tile_path[0]) flags \|= 1;
		155	if (ob->map->tile_path[1]) flags \|= 2;
		156	if (ob->map->tile_path[2]) flags \|= 4;
		157	if (ob->map->tile_path[3]) flags \|= 8;
		158
		159	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
		160	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
		161	ob->map->width, ob->map->height, &ob->map->path);
		162	}
		163	else
		164	socket.send_packet ("mapinfo current");
		165	}
		166	}
		167
146	/** check for map/region change and send new map data */	168	/** check for map/region change and send new map data */
147	static void	169	static void
148	check_map_change (player *pl)	170	check_map_change (player *pl)
149	{	171	{
150	client &socket = *pl->ns;	172	client &socket = *pl->ns;
151	object *ob = pl->observe;	173	object *ob = pl->observe;
152		174
		175	region *reg = ob->region ();
		176	if (socket.current_region != reg)
		177	{
		178	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
		179	socket.current_region = reg;
		180	}
		181
		182	// first try to aovid a full newmap on tiled map scrolls
		183	if (socket.current_map != ob->map && !socket.force_newmap)
		184	{
		185	rv_vector rv;
		186
		187	get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0);
		188
		189	// manhattan distance is very handy here
		190	if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient
		191	{
		192	socket.current_map = ob->map;
		193	socket.current_x = ob->x;
		194	socket.current_y = ob->y;
		195
		196	socket_map_scroll (&socket, rv.distance_x, rv.distance_y);
		197	socket.floorbox_reset ();
		198	send_map_info (pl);
		199	}
		200	}
		201
153	if (socket.current_map != ob->map \|\| socket.force_newmap)	202	if (socket.current_map != ob->map \|\| socket.force_newmap)
154	{	203	{
155	clear_map (pl);	204	clear_map (pl);
156	socket.current_map = ob->map;	205	socket.current_map = ob->map;
157		206	send_map_info (pl);
158	if (socket.mapinfocmd)
159	{
160	if (ob->map && ob->map->path[0])
161	{
162	int flags = 0;
163
164	if (ob->map->tile_path[0]) flags \|= 1;
165	if (ob->map->tile_path[1]) flags \|= 2;
166	if (ob->map->tile_path[2]) flags \|= 4;
167	if (ob->map->tile_path[3]) flags \|= 8;
168
169	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
170	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
171	ob->map->width, ob->map->height, &ob->map->path);
172	}
173	else
174	socket.send_packet ("mapinfo current");
175	}
176	}	207	}
177	else if (socket.current_x != ob->x \|\| socket.current_y != ob->y)	208	else if (socket.current_x != ob->x \|\| socket.current_y != ob->y)
178	{	209	{
179	int dx = ob->x - socket.current_x;	210	int dx = ob->x - socket.current_x;
180	int dy = ob->y - socket.current_y;	211	int dy = ob->y - socket.current_y;
…		…
188	}	219	}
189	}	220	}
190		221
191	socket.current_x = ob->x;	222	socket.current_x = ob->x;
192	socket.current_y = ob->y;	223	socket.current_y = ob->y;
193
194	region *reg = ob->region ();
195	if (socket.current_region != reg)
196	{
197	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
198	socket.current_region = reg;
199	}
200	}	224	}
201		225
202	/**	226	/**
203	* RequestInfo is sort of a meta command. There is some specific	227	* RequestInfo is sort of a meta command. There is some specific
204	* request of information, but we call other functions to provide	228	* request of information, but we call other functions to provide
…		…
380	AddMeCmd (char buf, int len, client ns)	404	AddMeCmd (char buf, int len, client ns)
381	{	405	{
382	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	406	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
383	}	407	}
384		408
385	/** Reply to ExtendedInfos command */
386	void
387	ToggleExtendedInfos (char buf, int len, client ns)
388	{
389	char cmdback[MAX_BUF];
390	char command[50];
391	int info, nextinfo;
392
393	cmdback[0] = '\0';
394	nextinfo = 0;
395
396	while (1)
397	{
398	/* 1. Extract an info */
399	info = nextinfo;
400
401	while ((info < len) && (buf[info] == ' '))
402	info++;
403
404	if (info >= len)
405	break;
406
407	nextinfo = info + 1;
408
409	while ((nextinfo < len) && (buf[nextinfo] != ' '))
410	nextinfo++;
411
412	if (nextinfo - info >= 49) /Erroneous info asked /
413	continue;
414
415	strncpy (command, &(buf[info]), nextinfo - info);
416
417	/* 2. Interpret info */
418	if (!strcmp ("smooth", command))
419	/* Toggle smoothing */
420	ns->EMI_smooth = !ns->EMI_smooth;
421	else
422	/bad value /;
423
424	/3. Next info /
425	}
426
427	strcpy (cmdback, "ExtendedInfoSet");
428
429	if (ns->EMI_smooth)
430	{
431	strcat (cmdback, " ");
432	strcat (cmdback, "smoothing");
433	}
434
435	ns->send_packet (cmdback);
436	}
437
438	/*	409	/*
439	#define MSG_TYPE_BOOK 1	410	#define MSG_TYPE_BOOK 1
440	#define MSG_TYPE_CARD 2	411	#define MSG_TYPE_CARD 2
441	#define MSG_TYPE_PAPER 3	412	#define MSG_TYPE_PAPER 3
442	#define MSG_TYPE_SIGN 4	413	#define MSG_TYPE_SIGN 4
…		…
686	* syntax is: move (to) (tag) (nrof)	657	* syntax is: move (to) (tag) (nrof)
687	*/	658	*/
688	void	659	void
689	MoveCmd (char buf, int len, player pl)	660	MoveCmd (char buf, int len, player pl)
690	{	661	{
691	int vals[3], i;	662	int to, tag, nrof;
692		663
693	/* A little funky here. We only cycle for 2 records, because	664	if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof))
694	* we obviously are not going to find a space after the third
695	* record. Perhaps we should just replace this with a
696	* sscanf?
697	*/
698	for (i = 0; i < 2; i++)
699	{	665	{
700	vals[i] = atoi (buf);
701
702	if (!(buf = strchr (buf, ' ')))
703	{
704	LOG (llevError, "Incomplete move command: %s\n", buf);	666	LOG (llevError, "Incomplete move command: %s\n", buf);
705	return;	667	return;
706	}
707
708	buf++;
709	}	668	}
710		669
711	vals[2] = atoi (buf);	670	esrv_move_object (pl->ob, to, tag, nrof);
712
713	/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
714	esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
715	}	671	}
716		672
717	/******************************************************************************	673	/******************************************************************************
718	*	674	*
719	* Start of commands the server sends to the client.	675	* Start of commands the server sends to the client.
…		…
820	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	776	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
821	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	777	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
822	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	778	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
823		779
824	for (int s = 0; s < NUM_SKILLS; s++)	780	for (int s = 0; s < NUM_SKILLS; s++)
825	if (object *skill = opl->last_skill_ob[s])	781	if (object *skill = opl->last_skill_ob [s])
826	if (skill->stats.exp != ns->last_skill_exp [s])	782	if (skill->stats.exp != ns->last_skill_exp [s])
827	{	783	{
828	ns->last_skill_exp [s] = skill->stats.exp;	784	ns->last_skill_exp [s] = skill->stats.exp;
829		785
830	/* Always send along the level if exp changes. This is only	786	/* Always send along the level if exp changes. This is only
…		…
886		842
887	/**	843	/**
888	* Tells the client that here is a player it should start using.	844	* Tells the client that here is a player it should start using.
889	*/	845	*/
890	void	846	void
891	esrv_new_player (player *pl, uint32 weight)	847	esrv_new_player (player *pl)
892	{	848	{
		849	sint32 weight = pl->ob->client_weight ();
		850
893	packet sl ("player");	851	packet sl ("player");
894		852
895	sl << uint32 (pl->ob->count)	853	sl << uint32 (pl->ob->count)
896	<< uint32 (weight)	854	<< uint32 (weight)
897	<< uint32 (pl->ob->face)	855	<< uint32 (pl->ob->face)
898	<< data8 (pl->ob->name);	856	<< data8 (pl->ob->name);
899		857
900	pl->ns->last_weight = weight;	858	pl->ns->last_weight = weight;
901	pl->ns->send_packet (sl);	859	pl->ns->send_packet (sl);
902	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
903	}	860	}
904		861
905	/******************************************************************************	862	/******************************************************************************
906	*	863	*
907	* Start of map related commands.	864	* Start of map related commands.
…		…
974		931
975	/* Nothing changed */	932	/* Nothing changed */
976	return 0;	933	return 0;
977	}	934	}
978		935
979	/**
980	* Returns the size of a data for a map square as returned by
981	* mapextended. There are CLIENTMAPXCLIENTMAPYLAYERS entries
982	* available.
983	*/
984	int
985	getExtendedMapInfoSize (client * ns)
986	{
987	int result = 0;
988
989	if (ns->ext_mapinfos)
990	{
991	if (ns->EMI_smooth)
992	result += 1; /One byte for smoothlevel /
993	}
994
995	return result;
996	}
997
998	// prefetch (and touch) all maps within a specific distancd	936	// prefetch (and touch) all maps within a specific distancd
999	static void	937	static void
1000	prefetch_surrounding_maps (maptile *map, int distance)	938	prefetch_surrounding_maps (maptile *map, int distance)
1001	{	939	{
1002	map->last_access = runtime;	940	map->last_access = runtime;
…		…
1025	{	963	{
1026	object *ob = pl->observe;	964	object *ob = pl->observe;
1027	if (!ob->active)	965	if (!ob->active)
1028	return;	966	return;
1029		967
1030	maptile *plmap = ob->map;
1031
1032	/* If player is just joining the game, he isn't here yet, so the map	968	/* If player is just joining the game, he isn't here yet, so the map
1033	* can get swapped out. If so, don't try to send them a map. All will	969	* can get swapped out. If so, don't try to send them a map. All will
1034	* be OK once they really log in.	970	* be OK once they really log in.
1035	*/	971	*/
1036	if (!plmap \|\| plmap->in_memory != MAP_ACTIVE)	972	if (!ob->map \|\| ob->map->in_memory != MAP_ACTIVE)
1037	return;	973	return;
1038		974
1039	int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1040	int estartlen, eoldlen;	975	int startlen, oldlen;
1041	uint8 eentrysize;
1042	uint16 ewhatstart, ewhatflag;
1043	uint8 extendedinfos;
1044		976
1045	check_map_change (pl);	977	check_map_change (pl);
1046	prefetch_surrounding_maps (pl->ob);	978	prefetch_surrounding_maps (pl->ob);
1047		979
1048	/* do LOS after calls to update_position */	980	/* do LOS after calls to update_position */
1049	if (ob != pl->ob)	981	/* unfortunately, we need to udpate los when observing, currently */
1050	clear_los (pl);	982	if (pl->do_los \|\| pl->observe != pl->ob)
1051	else if (pl->do_los)
1052	{	983	{
1053	update_los (ob);
1054	pl->do_los = 0;	984	pl->do_los = 0;
		985	pl->update_los ();
1055	}	986	}
1056		987
1057	/**	988	/**
1058	* This function uses the new map1 protocol command to send the map	989	* This function uses the new map1 protocol command to send the map
1059	* to the client. It is necessary because the old map command supports	990	* to the client. It is necessary because the old map command supports
…		…
1078	*/	1009	*/
1079		1010
1080	client &socket = *pl->ns;	1011	client &socket = *pl->ns;
1081		1012
1082	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");	1013	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1083	packet esl;
1084		1014
1085	startlen = sl.length ();	1015	startlen = sl.length ();
1086		1016
1087	/Extendedmapinfo structure initialisation /	1017	int hx = socket.mapx / 2;
1088	if (socket.ext_mapinfos)	1018	int hy = socket.mapy / 2;
1089	{
1090	extendedinfos = EMI_NOREDRAW;
1091		1019
1092	if (socket.EMI_smooth)	1020	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
1093	extendedinfos \|= EMI_SMOOTH;	1021	int ax = dx + hx;
		1022	int ay = dy + hy;
1094		1023
1095	ewhatstart = esl.length ();	1024	int mask = (ax << 10) \| (ay << 4);
1096	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1097	could need to be taken away */
1098	eentrysize = getExtendedMapInfoSize (&socket);
1099	esl << "mapextended "
1100	<< uint8 (extendedinfos)
1101	<< uint8 (eentrysize);
1102
1103	estartlen = esl.length ();
1104	}
1105
1106	/* x,y are the real map locations. ax, ay are viewport relative
1107	* locations.
1108	*/
1109	ay = 0;
1110
1111	/* We could do this logic as conditionals in the if statement,
1112	* but that started to get a bit messy to look at.
1113	*/
1114	max_x = ob->x + (socket.mapx + 1) / 2;
1115	max_y = ob->y + (socket.mapy + 1) / 2;
1116
1117	for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++)
1118	{
1119	sint16 nx, ny;
1120	maptile *m = 0;
1121
1122	ax = 0;
1123	for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++)
1124	{
1125	// check to see if we can simply go one right quickly
1126	++nx;
1127	if (m && nx >= m->width)
1128	m = 0;
1129
1130	if (!m)
1131	{
1132	nx = x; ny = y; m = plmap;
1133
1134	if (xy_normalise (m, nx, ny))
1135	m->touch ();
1136	else
1137	m = 0;
1138	}
1139
1140	int emask, mask;
1141	emask = mask = (ax & 0x3f) << 10 \| (ay & 0x3f) << 4;
1142
1143	MapCell &lastcell = socket.lastmap.cells[ax][ay];	1025	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1144		1026
1145	/* If the coordinates are not valid, or it is too dark to see,	1027	/* If the coordinates are not valid, or it is too dark to see,
1146	* we tell the client as such	1028	* we tell the client as such
1147	*/	1029	*/
1148	if (!m)	1030	if (!m)
1149	{	1031	{
1150	/* space is out of map. Update space and clear values	1032	/* space is out of map. Update space and clear values
1151	* if this hasn't already been done. If the space is out	1033	* if this hasn't already been done. If the space is out
1152	* of the map, it shouldn't have a head	1034	* of the map, it shouldn't have a head.
1153	*/	1035	*/
1154	if (lastcell.count != -1)	1036	if (lastcell.count != -1)
		1037	{
		1038	sl << uint16 (mask);
		1039	map_clearcell (&lastcell, -1);
		1040	}
		1041
		1042	continue;
		1043	}
		1044
		1045	int d = pl->blocked_los_uc (dx, dy);
		1046
		1047	if (d > 3)
		1048	{
		1049	/* This block deals with spaces that are not visible for whatever
		1050	* reason. Still may need to send the head for this space.
		1051	*/
		1052	if (lastcell.count != -1
		1053	\|\| lastcell.faces[0]
		1054	\|\| lastcell.faces[1]
		1055	\|\| lastcell.faces[2]
		1056	\|\| lastcell.stat_hp
		1057	\|\| lastcell.flags
		1058	\|\| lastcell.player)
		1059	sl << uint16 (mask);
		1060
		1061	/* properly clear a previously sent big face */
		1062	map_clearcell (&lastcell, -1);
		1063	}
		1064	else
		1065	{
		1066	/* In this block, the space is visible.
		1067	*/
		1068
		1069	/* Rather than try to figure out what everything that we might
		1070	* need to send is, then form the packet after that,
		1071	* we presume that we will in fact form a packet, and update
		1072	* the bits by what we do actually send. If we send nothing,
		1073	* we just back out sl.length () to the old value, and no harm
		1074	* is done.
		1075	* I think this is simpler than doing a bunch of checks to see
		1076	* what if anything we need to send, setting the bits, then
		1077	* doing those checks again to add the real data.
		1078	*/
		1079	oldlen = sl.length ();
		1080
		1081	sl << uint16 (mask);
		1082
		1083	unsigned char dummy;
		1084	unsigned char *last_ext = &dummy;
		1085
		1086	/* Darkness changed */
		1087	if (lastcell.count != d && socket.darkness)
		1088	{
		1089	mask \|= 0x8;
		1090
		1091	if (socket.extmap)
		1092	{
		1093	*last_ext \|= 0x80;
		1094	last_ext = &sl[sl.length ()];
		1095	sl << uint8 (d);
		1096	}
		1097	else
		1098	sl << uint8 (255 - 64 * d);
		1099	}
		1100
		1101	lastcell.count = d;
		1102
		1103	mapspace &ms = m->at (nx, ny);
		1104	ms.update ();
		1105
		1106	if (expect_true (socket.extmap))
		1107	{
		1108	uint8 stat_hp = 0;
		1109	uint8 stat_width = 0;
		1110	uint8 flags = 0;
		1111	tag_t player = 0;
		1112
		1113	// send hp information, if applicable
		1114	if (object *op = ms.faces_obj [0])
		1115	if (op->is_head () && !op->invisible)
1155	{	1116	{
1156	sl << uint16 (mask);	1117	if (op->stats.maxhp > op->stats.hp
1157	map_clearcell (&lastcell, -1);	1118	&& op->stats.maxhp > 0
		1119	&& (op->type == PLAYER
		1120	\|\| op->type == DOOR // does not work, have maxhp 0
		1121	\|\| QUERY_FLAG (op, FLAG_MONSTER)
		1122	\|\| QUERY_FLAG (op, FLAG_ALIVE)
		1123	\|\| QUERY_FLAG (op, FLAG_GENERATOR)))
		1124	{
		1125	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1126	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1127	}
		1128
		1129	if (expect_false (op->has_dialogue ()))
		1130	flags \|= 1;
		1131
		1132	if (expect_false (op->type == PLAYER))
		1133	player = op == ob ? pl->ob->count
		1134	: op == pl->ob ? ob->count
		1135	: op->count;
1158	}	1136	}
1159		1137
1160	continue;	1138	if (expect_false (lastcell.stat_hp != stat_hp))
1161	}
1162
1163	int d = pl->blocked_los[ax][ay];
1164
1165	if (d > 3)
1166	{
1167
1168	int need_send = 0, count;
1169
1170	/* This block deals with spaces that are not visible for whatever
1171	* reason. Still may need to send the head for this space.
1172	*/
1173
1174	oldlen = sl.length ();
1175
1176	sl << uint16 (mask);
1177
1178	if (lastcell.count != -1)
1179	need_send = 1;
1180
1181	count = -1;
1182
1183	/* properly clear a previously sent big face */
1184	if (lastcell.faces[0] \|\| lastcell.faces[1] \|\| lastcell.faces[2]
1185	\|\| lastcell.stat_hp \|\| lastcell.flags \|\| lastcell.player)
1186	need_send = 1;
1187
1188	map_clearcell (&lastcell, count);
1189
1190	if ((mask & 0xf) \|\| need_send)
1191	sl[oldlen + 1] = mask & 0xff;
1192	else
1193	sl.reset (oldlen);
1194	}
1195	else
1196	{
1197	/* In this block, the space is visible.
1198	*/
1199
1200	/* Rather than try to figure out what everything that we might
1201	* need to send is, then form the packet after that,
1202	* we presume that we will in fact form a packet, and update
1203	* the bits by what we do actually send. If we send nothing,
1204	* we just back out sl.length () to the old value, and no harm
1205	* is done.
1206	* I think this is simpler than doing a bunch of checks to see
1207	* what if anything we need to send, setting the bits, then
1208	* doing those checks again to add the real data.
1209	*/
1210	oldlen = sl.length ();
1211	eoldlen = esl.length ();
1212
1213	sl << uint16 (mask);
1214
1215	unsigned char dummy;
1216	unsigned char *last_ext = &dummy;
1217
1218	/* Darkness changed */
1219	if (lastcell.count != d && socket.darkness)
1220	{	1139	{
		1140	lastcell.stat_hp = stat_hp;
		1141
1221	mask \|= 0x8;	1142	mask \|= 0x8;
		1143	*last_ext \|= 0x80;
		1144	last_ext = &sl[sl.length ()];
1222		1145
1223	if (socket.extmap)	1146	sl << uint8 (5) << uint8 (stat_hp);
		1147
		1148	if (stat_width > 1)
1224	{	1149	{
1225	*last_ext \|= 0x80;	1150	*last_ext \|= 0x80;
1226	last_ext = &sl[sl.length ()];	1151	last_ext = &sl[sl.length ()];
1227	sl << uint8 (d);
1228	}
1229	else
1230	sl << uint8 (255 - 64 * d);
1231	}
1232		1152
1233	lastcell.count = d;
1234
1235	mapspace &ms = m->at (nx, ny);
1236	ms.update ();
1237
1238	if (socket.extmap)
1239	{
1240	uint8 stat_hp = 0;
1241	uint8 stat_width = 0;
1242	uint8 flags = 0;
1243	tag_t player = 0;
1244
1245	// send hp information, if applicable
1246	if (object *op = ms.faces_obj [0])
1247	if (op->is_head () && !op->invisible)
1248	{
1249	if (op->stats.maxhp > op->stats.hp
1250	&& op->stats.maxhp > 0
1251	&& (op->type == PLAYER
1252	\|\| op->type == DOOR // does not work, have maxhp 0
1253	\|\| QUERY_FLAG (op, FLAG_MONSTER) \|\| QUERY_FLAG (op, FLAG_ALIVE) \|\| QUERY_FLAG (op, FLAG_GENERATOR)))
1254	{
1255	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1256	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1257	}
1258
1259	if (op->msg && op->msg[0] == '@')
1260	flags \|= 1;
1261
1262	if (op->type == PLAYER && op != ob)
1263	player = op->count;
1264	}
1265
1266	if (lastcell.stat_hp != stat_hp)
1267	{
1268	lastcell.stat_hp = stat_hp;
1269
1270	mask \|= 0x8;
1271	*last_ext \|= 0x80;
1272	last_ext = &sl[sl.length ()];
1273
1274	sl << uint8 (5) << uint8 (stat_hp);
1275
1276	if (stat_width > 1)
1277	{
1278	*last_ext \|= 0x80;
1279	last_ext = &sl[sl.length ()];
1280
1281	sl << uint8 (6) << uint8 (stat_width);	1153	sl << uint8 (6) << uint8 (stat_width);
1282	}
1283	}	1154	}
1284
1285	if (lastcell.player != player)
1286	{
1287	lastcell.player = player;
1288
1289	mask \|= 0x8;
1290	*last_ext \|= 0x80;
1291	last_ext = &sl[sl.length ()];
1292
1293	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1294	}
1295
1296	if (lastcell.flags != flags)
1297	{
1298	lastcell.flags = flags;
1299
1300	mask \|= 0x8;
1301	*last_ext \|= 0x80;
1302	last_ext = &sl[sl.length ()];
1303
1304	sl << uint8 (8) << uint8 (flags);
1305	}
1306	}	1155	}
1307		1156
1308	/* Floor face */	1157	if (expect_false (lastcell.player != player))
1309	if (update_space (sl, socket, ms, lastcell, 2))	1158	{
		1159	lastcell.player = player;
		1160
1310	mask \|= 0x4;	1161	mask \|= 0x8;
		1162	*last_ext \|= 0x80;
		1163	last_ext = &sl[sl.length ()];
1311		1164
1312	/* Middle face */	1165	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1313	if (update_space (sl, socket, ms, lastcell, 1))	1166	}
		1167
		1168	if (expect_false (lastcell.flags != flags))
		1169	{
		1170	lastcell.flags = flags;
		1171
1314	mask \|= 0x2;	1172	mask \|= 0x8;
		1173	*last_ext \|= 0x80;
		1174	last_ext = &sl[sl.length ()];
1315		1175
1316	if (ms.player () == ob	1176	sl << uint8 (8) << uint8 (flags);
1317	&& (ob->invisible & (ob->invisible < 50 ? 1 : 7)))
1318	{	1177	}
		1178	}
		1179
		1180	/* Floor face */
		1181	if (update_space (sl, socket, ms, lastcell, 2))
		1182	mask \|= 0x4;
		1183
		1184	/* Middle face */
		1185	if (update_space (sl, socket, ms, lastcell, 1))
		1186	mask \|= 0x2;
		1187
		1188	if (expect_false (ob->invisible)
		1189	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
		1190	&& ms.player () == ob)
		1191	{
1319	// force player to be visible to himself if invisible	1192	// force player to be visible to himself if invisible
1320	if (lastcell.faces[0] != ob->face)	1193	if (lastcell.faces[0] != ob->face)
1321	{	1194	{
1322	lastcell.faces[0] = ob->face;	1195	lastcell.faces[0] = ob->face;
1323		1196
1324	mask \|= 0x1;
1325	sl << uint16 (ob->face);
1326
1327	socket.send_faces (ob);
1328	}
1329	}
1330	/* Top face */
1331	else if (update_space (sl, socket, ms, lastcell, 0))
1332	mask \|= 0x1;	1197	mask \|= 0x1;
		1198	sl << uint16 (ob->face);
1333		1199
		1200	socket.send_faces (ob);
		1201	}
		1202	}
		1203	/* Top face */
		1204	else if (update_space (sl, socket, ms, lastcell, 0))
		1205	mask \|= 0x1;
		1206
1334	/* Check to see if we are in fact sending anything for this	1207	/* Check to see if we are in fact sending anything for this
1335	* space by checking the mask. If so, update the mask.	1208	* space by checking the mask. If so, update the mask.
1336	* if not, reset the len to that from before adding the mask	1209	* if not, reset the len to that from before adding the mask
1337	* value, so we don't send those bits.	1210	* value, so we don't send those bits.
1338	*/	1211	*/
1339	if (mask & 0xf)	1212	if (mask & 0xf)
1340	sl[oldlen + 1] = mask & 0xff;	1213	sl[oldlen + 1] = mask & 0xff;
1341	else	1214	else
1342	sl.reset (oldlen);	1215	sl.reset (oldlen);
1343
1344	if (socket.ext_mapinfos)
1345	esl << uint16 (emask);
1346
1347	if (socket.EMI_smooth)
1348	{
1349	for (int layer = 2+1; layer--; )
1350	{
1351	object *ob = ms.faces_obj [layer];
1352
1353	// If there is no object for this space, or if the face for the object
1354	// is the blank face, set the smoothlevel to zero.
1355	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1356
1357	// We've gotten what face we want to use for the object. Now see if
1358	// if it has changed since we last sent it to the client.
1359	if (lastcell.smooth[layer] != smoothlevel)
1360	{
1361	lastcell.smooth[layer] = smoothlevel;
1362	esl << uint8 (smoothlevel);
1363	emask \|= 1 << layer;
1364	}
1365	}
1366
1367	if (emask & 0xf)
1368	esl[eoldlen + 1] = emask & 0xff;
1369	else
1370	esl.reset (eoldlen);
1371	}
1372	} /* else this is a viewable space */	1216	} /* else this is a viewable space */
1373	} /* for x loop */	1217	ordered_mapwalk_end
1374	} /* for y loop */
1375		1218
1376	socket.flush_fx ();	1219	socket.flush_fx ();
1377
1378	/* Verify that we in fact do need to send this */
1379	if (socket.ext_mapinfos)
1380	{
1381	if (!(sl.length () > startlen \|\| socket.sent_scroll))
1382	{
1383	/* No map data will follow, so don't say the client
1384	* it doesn't need draw!
1385	*/
1386	ewhatflag &= ~EMI_NOREDRAW;
1387	esl[ewhatstart + 1] = ewhatflag & 0xff;
1388	}
1389
1390	if (esl.length () > estartlen)
1391	socket.send_packet (esl);
1392	}
1393		1220
1394	if (sl.length () > startlen \|\| socket.sent_scroll)	1221	if (sl.length () > startlen \|\| socket.sent_scroll)
1395	{	1222	{
1396	socket.send_packet (sl);	1223	socket.send_packet (sl);
1397	socket.sent_scroll = 0;	1224	socket.sent_scroll = 0;
…		…
1418	{	1245	{
1419	packet sl;	1246	packet sl;
1420	sl << "replyinfo skill_info\n";	1247	sl << "replyinfo skill_info\n";
1421		1248
1422	for (int i = 1; i < NUM_SKILLS; i++)	1249	for (int i = 1; i < NUM_SKILLS; i++)
1423	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);	1250	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
1424		1251
1425	if (sl.length () > MAXSOCKBUF)	1252	if (sl.length () > MAXSOCKBUF)
1426	{	1253	{
1427	LOG (llevError, "Buffer overflow in send_skill_info!\n");	1254	LOG (llevError, "Buffer overflow in send_skill_info!\n");
1428	fatal (0);	1255	fatal (0);
…		…
1472	if (spell->type == SPELL)	1299	if (spell->type == SPELL)
1473	{	1300	{
1474	int flags = 0;	1301	int flags = 0;
1475		1302
1476	/* check if we need to update it */	1303	/* check if we need to update it */
1477	if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1304	if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
1478	{	1305	{
1479	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1306	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1480	flags \|= UPD_SP_MANA;	1307	flags \|= UPD_SP_MANA;
1481	}	1308	}
1482		1309
1483	if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1310	if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
1484	{	1311	{
1485	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1312	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1486	flags \|= UPD_SP_GRACE;	1313	flags \|= UPD_SP_GRACE;
1487	}	1314	}
1488		1315
1489	if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1316	if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
1490	{	1317	{
1491	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1318	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1492	flags \|= UPD_SP_DAMAGE;	1319	flags \|= UPD_SP_DAMAGE;
1493	}	1320	}
1494		1321
1495	if (flags)	1322	if (flags)
1496	{	1323	{
…		…
1498		1325
1499	sl << "updspell "	1326	sl << "updspell "
1500	<< uint8 (flags)	1327	<< uint8 (flags)
1501	<< uint32 (spell->count);	1328	<< uint32 (spell->count);
1502		1329
1503	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1330	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1504	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1331	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace);
1505	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1332	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat);
1506		1333
1507	pl->ns->send_packet (sl);	1334	pl->ns->send_packet (sl);
1508	}	1335	}
1509	}	1336	}
1510	}	1337	}
…		…
1540	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1367	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
1541	return;	1368	return;
1542	}	1369	}
1543		1370
1544	/* store costs and damage in the object struct, to compare to later */	1371	/* store costs and damage in the object struct, to compare to later */
1545	spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1372	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1546	spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1373	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1547	spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1374	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
1548		1375
1549	/* figure out which skill it uses, if it uses one */	1376	/* figure out which skill it uses, if it uses one */
1550	if (spell->skill)	1377	if (spell->skill)
1551	{	1378	if (object *tmp = pl->find_skill (spell->skill))
1552	for (i = 1; i < NUM_SKILLS; i++)
1553	if (!strcmp (spell->skill, skill_names[i]))
1554	{
1555	skill = i + CS_STAT_SKILLINFO;	1379	skill = tmp->subtype + CS_STAT_SKILLINFO;
1556	break;
1557	}
1558	}
1559		1380
1560	// spells better have a face	1381	// spells better have a face
1561	if (!spell->face)	1382	if (!spell->face)
1562	{	1383	{
1563	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);	1384	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
…		…
1568		1389
1569	/* send the current values */	1390	/* send the current values */
1570	sl << uint32 (spell->count)	1391	sl << uint32 (spell->count)
1571	<< uint16 (spell->level)	1392	<< uint16 (spell->level)
1572	<< uint16 (spell->casting_time)	1393	<< uint16 (spell->casting_time)
1573	<< uint16 (spell->last_sp)	1394	<< uint16 (spell->cached_sp)
1574	<< uint16 (spell->last_grace)	1395	<< uint16 (spell->cached_grace)
1575	<< uint16 (spell->last_eat)	1396	<< uint16 (spell->cached_eat)
1576	<< uint8 (skill)	1397	<< uint8 (skill)
1577	<< uint32 (spell->path_attuned)	1398	<< uint32 (spell->path_attuned)
1578	<< uint32 (spell->face)	1399	<< uint32 (spell->face)
1579	<< data8 (spell->name)	1400	<< data8 (spell->name)
1580	<< data16 (spell->msg);	1401	<< data16 (spell->msg);

Diff Legend

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

Comparing deliantra/server/socket/request.C (file contents): Revision 1.125 by root, Tue Apr 22 04:33:20 2008 UTC vs. Revision 1.145 by root, Fri Dec 26 10:44:17 2008 UTC

Diff Legend

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.125 by root, Tue Apr 22 04:33:20 2008 UTC vs.
Revision 1.145 by root, Fri Dec 26 10:44:17 2008 UTC