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

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.143 by root, Tue Dec 23 06:58:24 2008 UTC vs.
Revision 1.164 by root, Fri Mar 26 00:59:22 2010 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,2008 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 Mark Wedel
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 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 it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* 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 Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
		24
		25	//+GPL
23		26
24	/**	27	/**
25	* \file	28	* \file
26	* Client handling.	29	* Client handling.
27	*	30	*
63	* This table translates the attack numbers as used within the	66	* This table translates the attack numbers as used within the
64	* program to the value we use when sending STATS command to the	67	* program to the value we use when sending STATS command to the
65	* client. If a value is -1, then we don't send that to the	68	* client. If a value is -1, then we don't send that to the
66	* client.	69	* client.
67	*/	70	*/
68	short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,	71	static short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,
69	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,	72	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,
70	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,	73	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,
71	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,	74	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,
72	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,	75	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,
73	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,	76	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,
…		…
141		144
142	static void	145	static void
143	send_map_info (player *pl)	146	send_map_info (player *pl)
144	{	147	{
145	client &socket = *pl->ns;	148	client &socket = *pl->ns;
146	object *ob = pl->observe;	149	object *ob = pl->viewpoint;
147		150
148	if (socket.mapinfocmd)	151	if (socket.mapinfocmd)
149	{	152	{
150	if (ob->map && ob->map->path[0])	153	if (ob->map && ob->map->path[0])
151	{	154	{
…		…
168	/** check for map/region change and send new map data */	171	/** check for map/region change and send new map data */
169	static void	172	static void
170	check_map_change (player *pl)	173	check_map_change (player *pl)
171	{	174	{
172	client &socket = *pl->ns;	175	client &socket = *pl->ns;
173	object *ob = pl->observe;	176	object *ob = pl->viewpoint;
174		177
175	region *reg = ob->region ();	178	region *reg = ob->region ();
176	if (socket.current_region != reg)	179	if (socket.current_region != reg)
177	{	180	{
178	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));	181	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
…		…
208	else if (socket.current_x != ob->x \|\| socket.current_y != ob->y)	211	else if (socket.current_x != ob->x \|\| socket.current_y != ob->y)
209	{	212	{
210	int dx = ob->x - socket.current_x;	213	int dx = ob->x - socket.current_x;
211	int dy = ob->y - socket.current_y;	214	int dy = ob->y - socket.current_y;
212		215
213	if (socket.buggy_mapscroll && (abs (dx) > 8 \|\| abs (dy) > 8))
214	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
215	else
216	{
217	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);	216	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
218	socket.floorbox_reset ();	217	socket.floorbox_reset ();
219	}
220	}	218	}
221		219
222	socket.current_x = ob->x;	220	socket.current_x = ob->x;
223	socket.current_y = ob->y;	221	socket.current_y = ob->y;
		222	}
		223
		224	/**
		225	* This sends the skill number to name mapping. We ignore
		226	* the params - we always send the same info no matter what.
		227	*/
		228	static void
		229	send_skill_info (client ns, char params)
		230	{
		231	packet sl;
		232	sl << "replyinfo skill_info\n";
		233
		234	for (int i = 1; i < NUM_SKILLS; i++)
		235	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
		236
		237	if (sl.length () > MAXSOCKBUF)
		238	{
		239	LOG (llevError, "Buffer overflow in send_skill_info!\n");
		240	fatal (0);
		241	}
		242
		243	ns->send_packet (sl);
		244	}
		245
		246	/**
		247	* This sends the spell path to name mapping. We ignore
		248	* the params - we always send the same info no matter what.
		249	*/
		250	static void
		251	send_spell_paths (client * ns, char *params)
		252	{
		253	packet sl;
		254
		255	sl << "replyinfo spell_paths\n";
		256
		257	for (int i = 0; i < NRSPELLPATHS; i++)
		258	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
		259
		260	if (sl.length () > MAXSOCKBUF)
		261	{
		262	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
		263	fatal (0);
		264	}
		265
		266	ns->send_packet (sl);
224	}	267	}
225		268
226	/**	269	/**
227	* RequestInfo is sort of a meta command. There is some specific	270	* RequestInfo is sort of a meta command. There is some specific
228	* request of information, but we call other functions to provide	271	* request of information, but we call other functions to provide
…		…
241	{	284	{
242	*params++ = 0;	285	*params++ = 0;
243	break;	286	break;
244	}	287	}
245		288
246	if (!strcmp (buf, "image_info"))
247	send_image_info (ns, params);
248	else if (!strcmp (buf, "image_sums"))
249	send_image_sums (ns, params);
250	else if (!strcmp (buf, "skill_info"))	289	if (!strcmp (buf, "skill_info"))
251	send_skill_info (ns, params);	290	send_skill_info (ns, params);
252	else if (!strcmp (buf, "spell_paths"))	291	else if (!strcmp (buf, "spell_paths"))
253	send_spell_paths (ns, params);	292	send_spell_paths (ns, params);
254	else	293	else
255	{	294	{
…		…
271	ExtiCmd (char buf, int len, client ns)	310	ExtiCmd (char buf, int len, client ns)
272	{	311	{
273	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));	312	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
274	}	313	}
275		314
		315	//-GPL
		316
276	void	317	void
277	client::mapinfo_queue_clear ()	318	client::mapinfo_queue_clear ()
278	{	319	{
279	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)	320	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
280	free (*i);	321	free (*i);
…		…
287	{	328	{
288	char *token = buf;	329	char *token = buf;
289	buf += strlen (buf) + 9;	330	buf += strlen (buf) + 9;
290		331
291	// initial map and its origin	332	// initial map and its origin
292	maptile *map = pl->observe->map;	333	maptile *map = pl->viewpoint->map;
293	int mapx = pl->ns->mapx / 2 - pl->observe->x;	334	int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
294	int mapy = pl->ns->mapy / 2 - pl->observe->y;	335	int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
295	int max_distance = 8; // limit maximum path length to something generous	336	int max_distance = 8; // limit maximum path length to something generous
296		337
297	while (*buf && map && max_distance)	338	while (*buf && map && max_distance)
298	{	339	{
299	int dir = *buf++ - '1';	340	int dir = *buf++ - '1';
…		…
404	AddMeCmd (char buf, int len, client ns)	445	AddMeCmd (char buf, int len, client ns)
405	{	446	{
406	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	447	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
407	}	448	}
408		449
409	/** Reply to ExtendedInfos command */	450	//+GPL
410	void
411	ToggleExtendedInfos (char buf, int len, client ns)
412	{
413	char cmdback[MAX_BUF];
414	char command[50];
415	int info, nextinfo;
416
417	cmdback[0] = '\0';
418	nextinfo = 0;
419
420	while (1)
421	{
422	/* 1. Extract an info */
423	info = nextinfo;
424
425	while ((info < len) && (buf[info] == ' '))
426	info++;
427
428	if (info >= len)
429	break;
430
431	nextinfo = info + 1;
432
433	while ((nextinfo < len) && (buf[nextinfo] != ' '))
434	nextinfo++;
435
436	if (nextinfo - info >= 49) /Erroneous info asked /
437	continue;
438
439	strncpy (command, &(buf[info]), nextinfo - info);
440
441	/* 2. Interpret info */
442	if (!strcmp ("smooth", command))
443	/* Toggle smoothing */
444	ns->EMI_smooth = !ns->EMI_smooth;
445	else
446	/bad value /;
447
448	/3. Next info /
449	}
450
451	strcpy (cmdback, "ExtendedInfoSet");
452
453	if (ns->EMI_smooth)
454	{
455	strcat (cmdback, " ");
456	strcat (cmdback, "smoothing");
457	}
458
459	ns->send_packet (cmdback);
460	}
461		451
462	/*	452	/*
463	#define MSG_TYPE_BOOK 1	453	#define MSG_TYPE_BOOK 1
464	#define MSG_TYPE_CARD 2	454	#define MSG_TYPE_CARD 2
465	#define MSG_TYPE_PAPER 3	455	#define MSG_TYPE_PAPER 3
…		…
482	while (1)	472	while (1)
483	{	473	{
484	/* 1. Extract an info */	474	/* 1. Extract an info */
485	info = nextinfo;	475	info = nextinfo;
486		476
487	while ((info < len) && (buf[info] == ' '))	477	while ((info < len) && (buf [info] == ' '))
488	info++;	478	info++;
489		479
490	if (info >= len)	480	if (info >= len)
491	break;	481	break;
492		482
493	nextinfo = info + 1;	483	nextinfo = info + 1;
494		484
495	while ((nextinfo < len) && (buf[nextinfo] != ' '))	485	while ((nextinfo < len) && (buf [nextinfo] != ' '))
496	nextinfo++;	486	nextinfo++;
497		487
498	if (nextinfo - info >= 49) /Erroneous info asked /	488	if (nextinfo - info >= 49) /Erroneous info asked /
499	continue;	489	continue;
500		490
501	strncpy (command, &(buf[info]), nextinfo - info);	491	memcpy (command, buf + info, nextinfo - info);
502	command[nextinfo - info] = '\0';	492	command [nextinfo - info] = 0;
		493
503	/* 2. Interpret info */	494	/* 2. Interpret info */
504	i = sscanf (command, "%d", &flag);	495	i = sscanf (command, "%d", &flag);
505		496
506	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))	497	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
507	ns->supported_readables \|= (1 << flag);	498	ns->supported_readables \|= (1 << flag);
…		…
541	return;	532	return;
542		533
543	buf++;	534	buf++;
544	}	535	}
545		536
546	execute_newserver_command (pl->ob, (char *) buf);	537	execute_newserver_command (pl->ob, (char *)buf);
547		538
548	/* Perhaps something better should be done with a left over count.	539	/* Perhaps something better should be done with a left over count.
549	* Cleaning up the input should probably be done first - all actions	540	* Cleaning up the input should probably be done first - all actions
550	* for the command that issued the count should be done before any other	541	* for the command that issued the count should be done before any other
551	* commands.	542	* commands.
…		…
585	* commands.	576	* commands.
586	*/	577	*/
587	pl->count = 0;	578	pl->count = 0;
588		579
589	//TODO: schmorp thinks whatever this calculates, it makes no sense at all	580	//TODO: schmorp thinks whatever this calculates, it makes no sense at all
590	int time = fabs (pl->ob->speed) < 0.001	581	int time = pl->ob->has_active_speed ()
591	? time = MAX_TIME * 100
592	: time = (int) (MAX_TIME / fabs (pl->ob->speed));	582	? (int) (MAX_TIME / pl->ob->speed)
		583	: MAX_TIME * 100;
593		584
594	/* Send confirmation of command execution now */	585	/* Send confirmation of command execution now */
595	packet sl ("comc");	586	packet sl ("comc");
596	sl << uint16 (cmdid) << uint32 (time);	587	sl << uint16 (cmdid) << uint32 (time);
597	pl->ns->send_packet (sl);	588	pl->ns->send_packet (sl);
…		…
743	* Get player's current range attack in obuf.	734	* Get player's current range attack in obuf.
744	*/	735	*/
745	static void	736	static void
746	rangetostring (player pl, char obuf)	737	rangetostring (player pl, char obuf)
747	{	738	{
748	dynbuf_text buf;	739	dynbuf_text &buf = msg_dynbuf; buf.clear ();
749		740
750	if (pl->ranged_ob)	741	if (pl->ranged_ob)
751	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;	742	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
752		743
753	if (pl->combat_ob)	744	if (pl->combat_ob)
…		…
847	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	838	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
848	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	839	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
849	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	840	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
850	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	841	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
851	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	842	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
852	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);	843	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK);
853	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	844	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
854	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);	845	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK);
855	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);	846	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
856		847
857	flags = 0;	848	flags = 0;
858		849
859	if (opl->fire_on)	850	if (opl->fire_on)
…		…
862	if (opl->run_on)	853	if (opl->run_on)
863	flags \|= SF_RUNON;	854	flags \|= SF_RUNON;
864		855
865	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	856	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
866		857
867	if (ns->sc_version < 1025)
868	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
869	else
870	for (int i = 0; i < NROFATTACKS; i++)	858	for (int i = 0; i < NROFATTACKS; i++)
871	{	859	{
872	/* Skip ones we won't send */	860	/* Skip ones we won't send */
873	if (atnr_cs_stat[i] == -1)	861	if (atnr_cs_stat[i] == -1)
874	continue;	862	continue;
875		863
876	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);	864	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
877	}	865	}
878		866
879	if (pl->ns->monitor_spells)	867	if (pl->ns->monitor_spells)
880	{	868	{
881	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);	869	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
882	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);	870	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
…		…
984		972
985	/* Nothing changed */	973	/* Nothing changed */
986	return 0;	974	return 0;
987	}	975	}
988		976
989	/**	977	//-GPL
990	* Returns the size of a data for a map square as returned by
991	* mapextended. There are CLIENTMAPXCLIENTMAPYLAYERS entries
992	* available.
993	*/
994	int
995	getExtendedMapInfoSize (client * ns)
996	{
997	int result = 0;
998
999	if (ns->ext_mapinfos)
1000	{
1001	if (ns->EMI_smooth)
1002	result += 1; /One byte for smoothlevel /
1003	}
1004
1005	return result;
1006	}
1007		978
1008	// prefetch (and touch) all maps within a specific distancd	979	// prefetch (and touch) all maps within a specific distancd
1009	static void	980	static void
1010	prefetch_surrounding_maps (maptile *map, int distance)	981	prefetch_surrounding_maps (maptile *map, int distance)
1011	{	982	{
1012	map->last_access = runtime;	983	map->touch ();
1013		984
1014	if (--distance)	985	if (--distance)
1015	for (int dir = 4; --dir; )	986	for (int dir = 4; dir--; )
1016	if (const shstr &path = map->tile_path [dir])	987	if (const shstr &path = map->tile_path [dir])
1017	if (maptile *&neigh = map->tile_map [dir])	988	if (maptile *&neigh = map->tile_map [dir])
1018	prefetch_surrounding_maps (neigh, distance);	989	prefetch_surrounding_maps (neigh, distance);
1019	else	990	else
1020	neigh = maptile::find_async (path, map);	991	neigh = maptile::find_async (path, map);
…		…
1025	prefetch_surrounding_maps (object *op)	996	prefetch_surrounding_maps (object *op)
1026	{	997	{
1027	prefetch_surrounding_maps (op->map, 3);	998	prefetch_surrounding_maps (op->map, 3);
1028	}	999	}
1029		1000
		1001	//+GPL
		1002
1030	/**	1003	/**
1031	* Draws client map.	1004	* Draws client map.
1032	*/	1005	*/
1033	void	1006	void
1034	draw_client_map (player *pl)	1007	draw_client_map (player *pl)
1035	{	1008	{
1036	object *ob = pl->observe;	1009	object *ob = pl->viewpoint;
1037	if (!ob->active)	1010	if (!pl->observe->active)
1038	return;	1011	return;
1039		1012
1040	/* If player is just joining the game, he isn't here yet, so the map	1013	/* If player is just joining the game, he isn't here yet, so the map
1041	* can get swapped out. If so, don't try to send them a map. All will	1014	* can get swapped out. If so, don't try to send them a map. All will
1042	* be OK once they really log in.	1015	* be OK once they really log in.
1043	*/	1016	*/
1044	if (!ob->map \|\| ob->map->in_memory != MAP_ACTIVE)	1017	if (!ob->map \|\| ob->map->in_memory != MAP_ACTIVE)
1045	return;	1018	return;
1046		1019
1047	int startlen, oldlen;	1020	int startlen, oldlen;
1048	int estartlen, eoldlen;
1049	uint8 eentrysize;
1050	uint16 ewhatstart, ewhatflag;
1051	uint8 extendedinfos;
1052		1021
1053	check_map_change (pl);	1022	check_map_change (pl);
1054	prefetch_surrounding_maps (pl->ob);	1023	prefetch_surrounding_maps (pl->ob);
1055		1024
1056	/* do LOS after calls to update_position */	1025	/* do LOS after calls to update_position */
1057	/* unfortunately, we need to udpate los when observing, currently */	1026	/* unfortunately, we need to udpate los when observing, currently */
1058	if (pl->do_los \|\| pl->observe != pl->ob)	1027	if (pl->do_los \|\| pl->viewpoint != pl->ob)
1059	{	1028	{
1060	pl->do_los = 0;	1029	pl->do_los = 0;
1061	pl->update_los ();	1030	pl->update_los ();
1062	}	1031	}
1063		1032
…		…
1085	*/	1054	*/
1086		1055
1087	client &socket = *pl->ns;	1056	client &socket = *pl->ns;
1088		1057
1089	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");	1058	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1090	packet esl;
1091		1059
1092	startlen = sl.length ();	1060	startlen = sl.length ();
1093		1061
1094	/Extendedmapinfo structure initialisation /
1095	if (socket.ext_mapinfos)
1096	{
1097	extendedinfos = EMI_NOREDRAW;
1098
1099	if (socket.EMI_smooth)
1100	extendedinfos \|= EMI_SMOOTH;
1101
1102	ewhatstart = esl.length ();
1103	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1104	could need to be taken away */
1105	eentrysize = getExtendedMapInfoSize (&socket);
1106	esl << "mapextended "
1107	<< uint8 (extendedinfos)
1108	<< uint8 (eentrysize);
1109
1110	estartlen = esl.length ();
1111	}
1112
1113	/* We could do this logic as conditionals in the if statement,
1114	* but that started to get a bit messy to look at.
1115	*/
1116	int hx = socket.mapx / 2;	1062	int hx = socket.mapx / 2;
1117	int hy = socket.mapy / 2;	1063	int hy = socket.mapy / 2;
1118		1064
1119	for (int dx = -hx; dx <= hx; dx++)	1065	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
		1066	int ax = dx + hx;
		1067	int ay = dy + hy;
		1068
		1069	int mask = (ax << 10) \| (ay << 4);
		1070	MapCell &lastcell = socket.lastmap.cells[ax][ay];
		1071
		1072	/* If the coordinates are not valid, or it is too dark to see,
		1073	* we tell the client as such
		1074	*/
		1075	if (!m)
1120	{	1076	{
1121	sint16 nx, ny;	1077	/* space is out of map. Update space and clear values
1122	maptile *m = 0;	1078	* if this hasn't already been done. If the space is out
1123		1079	* of the map, it shouldn't have a head.
1124	for (int dy = -hy; dy <= hy; dy++)	1080	*/
		1081	if (lastcell.count != -1)
1125	{	1082	{
1126	// check to see if we can simply go one down quickly	1083	sl << uint16 (mask);
1127	if (m && ++ny >= m->height)	1084	map_clearcell (&lastcell, -1);
		1085	}
		1086
		1087	continue;
		1088	}
		1089
		1090	int d = pl->blocked_los_uc (dx, dy);
		1091
		1092	if (d > 3)
		1093	{
		1094	/* This block deals with spaces that are not visible for whatever
		1095	* reason. Still may need to send the head for this space.
		1096	*/
		1097	if (lastcell.count != -1
		1098	\|\| lastcell.faces[0]
		1099	\|\| lastcell.faces[1]
		1100	\|\| lastcell.faces[2]
		1101	\|\| lastcell.stat_hp
		1102	\|\| lastcell.flags
		1103	\|\| lastcell.player)
		1104	sl << uint16 (mask);
		1105
		1106	/* properly clear a previously sent big face */
		1107	map_clearcell (&lastcell, -1);
		1108	}
		1109	else
		1110	{
		1111	/* In this block, the space is visible.
		1112	*/
		1113
		1114	/* Rather than try to figure out what everything that we might
		1115	* need to send is, then form the packet after that,
		1116	* we presume that we will in fact form a packet, and update
		1117	* the bits by what we do actually send. If we send nothing,
		1118	* we just back out sl.length () to the old value, and no harm
		1119	* is done.
		1120	* I think this is simpler than doing a bunch of checks to see
		1121	* what if anything we need to send, setting the bits, then
		1122	* doing those checks again to add the real data.
		1123	*/
		1124	oldlen = sl.length ();
		1125
		1126	sl << uint16 (mask);
		1127
		1128	unsigned char dummy;
		1129	unsigned char *last_ext = &dummy;
		1130
		1131	/* Darkness changed */
		1132	if (lastcell.count != d)
		1133	{
1128	m = 0;	1134	mask \|= 0x8;
1129		1135
1130	// no, so do it the slow way	1136	*last_ext \|= 0x80;
1131	if (!m)	1137	last_ext = &sl[sl.length ()];
		1138	sl << uint8 (d);
		1139	}
		1140
		1141	lastcell.count = d;
		1142
		1143	mapspace &ms = m->at (nx, ny);
		1144	ms.update ();
		1145
		1146	// extmap handling
		1147	uint8 stat_hp = 0;
		1148	uint8 stat_width = 0;
		1149	uint8 flags = 0;
		1150	tag_t player = 0;
		1151
		1152	// send hp information, if applicable
		1153	if (object *op = ms.faces_obj [0])
		1154	if (op->is_head () && !op->invisible)
1132	{	1155	{
1133	nx = ob->x + dx; ny = ob->y + dy; m = ob->map;	1156	if (op->stats.maxhp > op->stats.hp
1134		1157	&& op->stats.maxhp > 0
1135	if (xy_normalise (m, nx, ny))	1158	&& (op->type == PLAYER
1136	m->touch ();	1159	\|\| op->type == DOOR // does not work, have maxhp 0
1137	else	1160	\|\| QUERY_FLAG (op, FLAG_MONSTER)
		1161	\|\| QUERY_FLAG (op, FLAG_ALIVE)
		1162	\|\| QUERY_FLAG (op, FLAG_GENERATOR)))
1138	m = 0;	1163	{
		1164	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1165	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1166	}
		1167
		1168	if (expect_false (op->has_dialogue ()))
		1169	flags \|= 1;
		1170
		1171	if (expect_false (op->type == PLAYER))
		1172	player = op == ob ? pl->ob->count
		1173	: op == pl->ob ? ob->count
		1174	: op->count;
1139	}	1175	}
1140		1176
1141	int ax = dx + hx;	1177	if (expect_false (lastcell.stat_hp != stat_hp))
1142	int ay = dy + hy;
1143
1144	int emask, mask;
1145	emask = mask = (ax & 0x3f) << 10 \| (ay & 0x3f) << 4;
1146
1147	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1148
1149	/* If the coordinates are not valid, or it is too dark to see,
1150	* we tell the client as such
1151	*/
1152	if (!m)
1153	{	1178	{
1154	/* space is out of map. Update space and clear values	1179	lastcell.stat_hp = stat_hp;
1155	* if this hasn't already been done. If the space is out	1180
1156	* of the map, it shouldn't have a head.	1181	mask \|= 0x8;
1157	*/	1182	*last_ext \|= 0x80;
1158	if (lastcell.count != -1)	1183	last_ext = &sl[sl.length ()];
		1184
		1185	sl << uint8 (5) << uint8 (stat_hp);
		1186
		1187	if (stat_width > 1)
1159	{	1188	{
1160	sl << uint16 (mask);
1161	map_clearcell (&lastcell, -1);
1162	}
1163
1164	continue;
1165	}
1166
1167	int d = pl->blocked_los_uc (dx, dy);
1168
1169	if (d > 3)
1170	{
1171	int need_send = 0, count;
1172
1173	/* This block deals with spaces that are not visible for whatever
1174	* reason. Still may need to send the head for this space.
1175	*/
1176
1177	oldlen = sl.length ();
1178
1179	sl << uint16 (mask);
1180
1181	if (lastcell.count != -1)
1182	need_send = 1;
1183
1184	count = -1;
1185
1186	if (lastcell.faces[0] \|\| lastcell.faces[1] \|\| lastcell.faces[2]
1187	\|\| lastcell.stat_hp \|\| lastcell.flags \|\| lastcell.player)
1188	need_send = 1;
1189
1190	/* properly clear a previously sent big face */
1191	map_clearcell (&lastcell, count);
1192
1193	if ((mask & 0xf) \|\| need_send)
1194	sl[oldlen + 1] = mask & 0xff;
1195	else
1196	sl.reset (oldlen);
1197	}
1198	else
1199	{
1200	/* In this block, the space is visible.
1201	*/
1202
1203	/* Rather than try to figure out what everything that we might
1204	* need to send is, then form the packet after that,
1205	* we presume that we will in fact form a packet, and update
1206	* the bits by what we do actually send. If we send nothing,
1207	* we just back out sl.length () to the old value, and no harm
1208	* is done.
1209	* I think this is simpler than doing a bunch of checks to see
1210	* what if anything we need to send, setting the bits, then
1211	* doing those checks again to add the real data.
1212	*/
1213	oldlen = sl.length ();
1214	eoldlen = esl.length ();
1215
1216	sl << uint16 (mask);
1217
1218	unsigned char dummy;
1219	unsigned char *last_ext = &dummy;
1220
1221	/* Darkness changed */
1222	if (lastcell.count != d && socket.darkness)
1223	{
1224	mask \|= 0x8;
1225
1226	if (socket.extmap)
1227	{
1228	*last_ext \|= 0x80;	1189	*last_ext \|= 0x80;
1229	last_ext = &sl[sl.length ()];	1190	last_ext = &sl[sl.length ()];
1230	sl << uint8 (d);	1191
1231	}	1192	sl << uint8 (6) << uint8 (stat_width);
1232	else
1233	sl << uint8 (255 - 64 * d);
1234	}	1193	}
		1194	}
1235		1195
1236	lastcell.count = d;	1196	if (expect_false (lastcell.player != player))
1237
1238	mapspace &ms = m->at (nx, ny);
1239	ms.update ();
1240
1241	if (socket.extmap)
1242	{	1197	{
1243	uint8 stat_hp = 0;	1198	lastcell.player = player;
1244	uint8 stat_width = 0;
1245	uint8 flags = 0;
1246	tag_t player = 0;
1247		1199
1248	// send hp information, if applicable
1249	if (object *op = ms.faces_obj [0])
1250	if (op->is_head () && !op->invisible)
1251	{
1252	if (op->stats.maxhp > op->stats.hp
1253	&& op->stats.maxhp > 0
1254	&& (op->type == PLAYER
1255	\|\| op->type == DOOR // does not work, have maxhp 0
1256	\|\| QUERY_FLAG (op, FLAG_MONSTER)
1257	\|\| QUERY_FLAG (op, FLAG_ALIVE)
1258	\|\| QUERY_FLAG (op, FLAG_GENERATOR)))
1259	{
1260	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1261	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1262	}
1263
1264	if (op->has_dialogue ())
1265	flags \|= 1;
1266
1267	if (op->type == PLAYER)
1268	player = op == ob ? pl->ob->count
1269	: op == pl->ob ? ob->count
1270	: op->count;
1271	}
1272
1273	if (lastcell.stat_hp != stat_hp)
1274	{
1275	lastcell.stat_hp = stat_hp;
1276
1277	mask \|= 0x8;	1200	mask \|= 0x8;
1278	*last_ext \|= 0x80;	1201	*last_ext \|= 0x80;
1279	last_ext = &sl[sl.length ()];	1202	last_ext = &sl[sl.length ()];
1280		1203
1281	sl << uint8 (5) << uint8 (stat_hp);
1282
1283	if (stat_width > 1)
1284	{
1285	*last_ext \|= 0x80;
1286	last_ext = &sl[sl.length ()];
1287
1288	sl << uint8 (6) << uint8 (stat_width);
1289	}
1290	}
1291
1292	if (lastcell.player != player)
1293	{
1294	lastcell.player = player;
1295
1296	mask \|= 0x8;
1297	*last_ext \|= 0x80;
1298	last_ext = &sl[sl.length ()];
1299
1300	sl << uint8 (0x47) << uint8 (4) << (uint32)player;	1204	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1301	}	1205	}
1302		1206
1303	if (lastcell.flags != flags)	1207	if (expect_false (lastcell.flags != flags))
1304	{	1208	{
1305	lastcell.flags = flags;	1209	lastcell.flags = flags;
1306		1210
1307	mask \|= 0x8;	1211	mask \|= 0x8;
1308	*last_ext \|= 0x80;	1212	*last_ext \|= 0x80;
1309	last_ext = &sl[sl.length ()];	1213	last_ext = &sl[sl.length ()];
1310		1214
1311	sl << uint8 (8) << uint8 (flags);	1215	sl << uint8 (8) << uint8 (flags);
1312	}
1313	}	1216	}
1314		1217
		1218	// faces
		1219
1315	/* Floor face */	1220	/* Floor face */
1316	if (update_space (sl, socket, ms, lastcell, 2))	1221	if (update_space (sl, socket, ms, lastcell, 2))
1317	mask \|= 0x4;	1222	mask \|= 0x4;
1318		1223
1319	/* Middle face */	1224	/* Middle face */
1320	if (update_space (sl, socket, ms, lastcell, 1))	1225	if (update_space (sl, socket, ms, lastcell, 1))
1321	mask \|= 0x2;	1226	mask \|= 0x2;
1322		1227
1323	if (ob->invisible	1228	if (expect_false (ob->invisible)
1324	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)	1229	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
1325	&& ms.player () == ob)	1230	&& ms.player () == ob)
1326	{	1231	{
1327	// force player to be visible to himself if invisible	1232	// force player to be visible to himself if invisible
1328	if (lastcell.faces[0] != ob->face)	1233	if (lastcell.faces[0] != ob->face)
1329	{	1234	{
1330	lastcell.faces[0] = ob->face;	1235	lastcell.faces[0] = ob->face;
1331		1236
1332	mask \|= 0x1;
1333	sl << uint16 (ob->face);
1334
1335	socket.send_faces (ob);
1336	}
1337	}
1338	/* Top face */
1339	else if (update_space (sl, socket, ms, lastcell, 0))
1340	mask \|= 0x1;	1237	mask \|= 0x1;
		1238	sl << uint16 (ob->face);
1341		1239
		1240	socket.send_faces (ob);
		1241	}
		1242	}
		1243	/* Top face */
		1244	else if (update_space (sl, socket, ms, lastcell, 0))
		1245	mask \|= 0x1;
		1246
1342	/* Check to see if we are in fact sending anything for this	1247	/* Check to see if we are in fact sending anything for this
1343	* space by checking the mask. If so, update the mask.	1248	* space by checking the mask. If so, update the mask.
1344	* if not, reset the len to that from before adding the mask	1249	* if not, reset the len to that from before adding the mask
1345	* value, so we don't send those bits.	1250	* value, so we don't send those bits.
1346	*/	1251	*/
1347	if (mask & 0xf)	1252	if (mask & 0xf)
1348	sl[oldlen + 1] = mask & 0xff;	1253	sl[oldlen + 1] = mask & 0xff;
1349	else	1254	else
1350	sl.reset (oldlen);	1255	sl.reset (oldlen);
1351
1352	if (socket.ext_mapinfos)
1353	esl << uint16 (emask);
1354
1355	if (socket.EMI_smooth)
1356	{
1357	for (int layer = 2+1; layer--; )
1358	{
1359	object *ob = ms.faces_obj [layer];
1360
1361	// If there is no object for this space, or if the face for the object
1362	// is the blank face, set the smoothlevel to zero.
1363	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1364
1365	// We've gotten what face we want to use for the object. Now see if
1366	// if it has changed since we last sent it to the client.
1367	if (lastcell.smooth[layer] != smoothlevel)
1368	{
1369	lastcell.smooth[layer] = smoothlevel;
1370	esl << uint8 (smoothlevel);
1371	emask \|= 1 << layer;
1372	}
1373	}
1374
1375	if (emask & 0xf)
1376	esl[eoldlen + 1] = emask & 0xff;
1377	else
1378	esl.reset (eoldlen);
1379	}
1380	} /* else this is a viewable space */	1256	} /* else this is a viewable space */
1381	} /* for x loop */	1257	ordered_mapwalk_end
1382	} /* for y loop */
1383		1258
1384	socket.flush_fx ();	1259	socket.flush_fx ();
1385
1386	/* Verify that we in fact do need to send this */
1387	if (socket.ext_mapinfos)
1388	{
1389	if (!(sl.length () > startlen \|\| socket.sent_scroll))
1390	{
1391	/* No map data will follow, so don't say the client
1392	* it doesn't need draw!
1393	*/
1394	ewhatflag &= ~EMI_NOREDRAW;
1395	esl[ewhatstart + 1] = ewhatflag & 0xff;
1396	}
1397
1398	if (esl.length () > estartlen)
1399	socket.send_packet (esl);
1400	}
1401		1260
1402	if (sl.length () > startlen \|\| socket.sent_scroll)	1261	if (sl.length () > startlen \|\| socket.sent_scroll)
1403	{	1262	{
1404	socket.send_packet (sl);	1263	socket.send_packet (sl);
1405	socket.sent_scroll = 0;	1264	socket.sent_scroll = 0;
1406	}	1265	}
1407	}	1266	}
1408		1267
1409	/*****************************************************************************/
1410	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1411	/* a player. Of course, the client need to know the command to be able to */
1412	/* manage it ! */
1413	/*****************************************************************************/
1414	void
1415	send_plugin_custom_message (object pl, char buf)
1416	{
1417	pl->contr->ns->send_packet (buf);
1418	}
1419
1420	/**
1421	* This sends the skill number to name mapping. We ignore
1422	* the params - we always send the same info no matter what.
1423	*/
1424	void
1425	send_skill_info (client ns, char params)
1426	{
1427	packet sl;
1428	sl << "replyinfo skill_info\n";
1429
1430	for (int i = 1; i < NUM_SKILLS; i++)
1431	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
1432
1433	if (sl.length () > MAXSOCKBUF)
1434	{
1435	LOG (llevError, "Buffer overflow in send_skill_info!\n");
1436	fatal (0);
1437	}
1438
1439	ns->send_packet (sl);
1440	}
1441
1442	/**
1443	* This sends the spell path to name mapping. We ignore
1444	* the params - we always send the same info no matter what.
1445	*/
1446	void
1447	send_spell_paths (client * ns, char *params)
1448	{
1449	packet sl;
1450
1451	sl << "replyinfo spell_paths\n";
1452
1453	for (int i = 0; i < NRSPELLPATHS; i++)
1454	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1455
1456	if (sl.length () > MAXSOCKBUF)
1457	{
1458	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1459	fatal (0);
1460	}
1461
1462	ns->send_packet (sl);
1463	}
1464
1465	/**	1268	/**
1466	* This looks for any spells the player may have that have changed their stats.	1269	* This looks for any spells the player may have that have changed their stats.
1467	* it then sends an updspell packet for each spell that has changed in this way	1270	* it then sends an updspell packet for each spell that has changed in this way
1468	*/	1271	*/
1469	void	1272	void
1470	esrv_update_spells (player *pl)	1273	esrv_update_spells (player *pl)
1471	{	1274	{
1472	if (!pl->ns)	1275	if (!pl->ns)
1473	return;	1276	return;
1474		1277
		1278	pl->ns->update_spells = false;
		1279
1475	if (!pl->ns->monitor_spells)	1280	if (!pl->ns->monitor_spells)
1476	return;	1281	return;
1477		1282
1478	for (object *spell = pl->ob->inv; spell; spell = spell->below)	1283	for (object *spell = pl->ob->inv; spell; spell = spell->below)
1479	{
1480	if (spell->type == SPELL)	1284	if (spell->type == SPELL)
1481	{	1285	{
1482	int flags = 0;	1286	int flags = 0;
		1287	int val;
1483		1288
1484	/* check if we need to update it */	1289	/* check if we need to update it */
1485	if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1290	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
		1291	if (spell->cached_sp != val)
1486	{	1292	{
1487	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1293	spell->cached_sp = val;
1488	flags \|= UPD_SP_MANA;	1294	flags \|= UPD_SP_MANA;
1489	}	1295	}
1490		1296
1491	if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1297	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
		1298	if (spell->cached_grace != val)
1492	{	1299	{
1493	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1300	spell->cached_grace = val;
1494	flags \|= UPD_SP_GRACE;	1301	flags \|= UPD_SP_GRACE;
1495	}	1302	}
1496		1303
1497	if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1304	val = casting_level (pl->ob, spell);
		1305	if (spell->cached_eat != val)
1498	{	1306	{
1499	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1307	spell->cached_eat = val;
1500	flags \|= UPD_SP_DAMAGE;	1308	flags \|= UPD_SP_LEVEL;
1501	}	1309	}
1502		1310
1503	if (flags)	1311	if (flags)
1504	{	1312	{
1505	packet sl;	1313	packet sl;
1506		1314
1507	sl << "updspell "	1315	sl << "updspell "
1508	<< uint8 (flags)	1316	<< uint8 (flags)
1509	<< uint32 (spell->count);	1317	<< uint32 (spell->count);
1510		1318
1511	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);	1319	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1512	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace);	1320	if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace);
1513	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat);	1321	if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat);
1514		1322
1515	pl->ns->send_packet (sl);	1323	pl->ns->send_packet (sl);
1516	}	1324	}
1517	}	1325	}
1518	}
1519	}	1326	}
1520		1327
1521	void	1328	void
1522	esrv_remove_spell (player pl, object spell)	1329	esrv_remove_spell (player pl, object spell)
1523	{	1330	{
…		…
1550	}	1357	}
1551		1358
1552	/* store costs and damage in the object struct, to compare to later */	1359	/* store costs and damage in the object struct, to compare to later */
1553	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1360	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1554	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1361	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1555	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1362	spell->cached_eat = casting_level (pl->ob, spell);
1556		1363
1557	/* figure out which skill it uses, if it uses one */	1364	/* figure out which skill it uses, if it uses one */
1558	if (spell->skill)	1365	if (spell->skill)
1559	if (object *tmp = pl->find_skill (spell->skill))	1366	if (object *tmp = pl->find_skill (spell->skill))
1560	skill = tmp->subtype + CS_STAT_SKILLINFO;	1367	skill = tmp->subtype + CS_STAT_SKILLINFO;
…		…
1649	/* finally, we can send the packet */	1456	/* finally, we can send the packet */
1650	pl->ns->flush_fx ();	1457	pl->ns->flush_fx ();
1651	pl->ns->send_packet (sl);	1458	pl->ns->send_packet (sl);
1652	}	1459	}
1653		1460
		1461	//-GPL
		1462

Diff Legend

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

Comparing deliantra/server/socket/request.C (file contents): Revision 1.143 by root, Tue Dec 23 06:58:24 2008 UTC vs. Revision 1.164 by root, Fri Mar 26 00:59:22 2010 UTC

Diff Legend

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.143 by root, Tue Dec 23 06:58:24 2008 UTC vs.
Revision 1.164 by root, Fri Mar 26 00:59:22 2010 UTC