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

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.141 by root, Fri Dec 19 22:47:30 2008 UTC vs.
Revision 1.173 by root, Thu Apr 15 00:37:24 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,2009,2010 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	*
41		44
42	#include <global.h>	45	#include <global.h>
43	#include <sproto.h>	46	#include <sproto.h>
44		47
45	#include <living.h>	48	#include <living.h>
46	#include <commands.h>
47		49
48	/* This block is basically taken from socket.c - I assume if it works there,	50	/* This block is basically taken from socket.c - I assume if it works there,
49	* it should work here.	51	* it should work here.
50	*/	52	*/
51	#include <sys/types.h>	53	#include <sys/types.h>
…		…
63	* This table translates the attack numbers as used within the	65	* This table translates the attack numbers as used within the
64	* program to the value we use when sending STATS command to the	66	* 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	67	* client. If a value is -1, then we don't send that to the
66	* client.	68	* client.
67	*/	69	*/
68	short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS,	70	static short atnr_cs_stat[NROFATTACKS] =
69	CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC,	71	{
70	CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID,	72	CS_STAT_RES_PHYS,
71	CS_STAT_RES_DRAIN, -1 /* weaponmagic */ ,	73	CS_STAT_RES_MAG,
72	CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON,	74	CS_STAT_RES_FIRE,
73	CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD,	75	CS_STAT_RES_ELEC,
74	CS_STAT_RES_FEAR, -1 /* Cancellation */ ,	76	CS_STAT_RES_COLD,
75	CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH,	77	CS_STAT_RES_CONF,
76	-1 /* Chaos / , -1 / Counterspell */ ,	78	CS_STAT_RES_ACID,
77	-1 /* Godpower */ , CS_STAT_RES_HOLYWORD,	79	CS_STAT_RES_DRAIN,
		80	-1 /* weaponmagic */,
		81	CS_STAT_RES_GHOSTHIT,
		82	CS_STAT_RES_POISON,
		83	CS_STAT_RES_SLOW,
		84	CS_STAT_RES_PARA,
		85	CS_STAT_TURN_UNDEAD,
		86	CS_STAT_RES_FEAR,
		87	-1 /* Cancellation */,
		88	CS_STAT_RES_DEPLETE,
		89	CS_STAT_RES_DEATH,
		90	-1 /* Chaos */,
		91	-1 /* Counterspell */,
		92	-1 /* Godpower */,
		93	CS_STAT_RES_HOLYWORD,
78	CS_STAT_RES_BLIND,	94	CS_STAT_RES_BLIND,
79	-1, /* Internal */	95	-1, /* Internal */
80	-1, /* life stealing */	96	-1, /* life stealing */
81	-1 /* Disease - not fully done yet */	97	-1 /* Disease - not fully done yet */
82	};	98	};
…		…
98	*/	114	*/
99	mx = ns->mapx;	115	mx = ns->mapx;
100	my = ns->mapy;	116	my = ns->mapy;
101		117
102	/* the x and y here are coordinates for the new map, i.e. if we moved	118	/* 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,	119	* (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	120	* if the destination x or y coordinate is outside the viewable
105	* area, we clear the values - otherwise, the old values	121	* area, we clear the values - otherwise, the old values
106	* are preserved, and the check_head thinks it needs to clear them.	122	* are preserved, and the check_head thinks it needs to clear them.
107	*/	123	*/
108	for (x = 0; x < mx; x++)	124	for (x = 0; x < mx; x++)
109	{
110	for (y = 0; y < my; y++)	125	for (y = 0; y < my; y++)
111	{
112	if (x >= ns->mapx \|\| y >= ns->mapy)	126	if (x >= ns->mapx \|\| y >= ns->mapy)
113	/* clear cells outside the viewable area */	127	/* clear cells outside the viewable area */
114	memset (&newmap.cells[x][y], 0, sizeof (struct MapCell));	128	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)	129	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 */	130	/* clear newly visible tiles within the viewable area */
117	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));	131	memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell));
118	else	132	else
119	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));	133	memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell));
120	}
121	}
122		134
123	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));	135	memcpy (&(ns->lastmap), &newmap, sizeof (struct Map));
124		136
125	/* Make sure that the next "map1" command will be sent (even if it is	137	/* Make sure that the next "map1" command will be sent (even if it is
126	* empty).	138	* empty).
…		…
145		157
146	static void	158	static void
147	send_map_info (player *pl)	159	send_map_info (player *pl)
148	{	160	{
149	client &socket = *pl->ns;	161	client &socket = *pl->ns;
150	object *ob = pl->observe;	162	object *ob = pl->viewpoint;
151		163
152	if (socket.mapinfocmd)	164	if (socket.mapinfocmd)
153	{	165	{
154	if (ob->map && ob->map->path[0])	166	if (ob->map && ob->map->path[0])
155	{	167	{
…		…
172	/** check for map/region change and send new map data */	184	/** check for map/region change and send new map data */
173	static void	185	static void
174	check_map_change (player *pl)	186	check_map_change (player *pl)
175	{	187	{
176	client &socket = *pl->ns;	188	client &socket = *pl->ns;
177	object *ob = pl->observe;	189	object *ob = pl->viewpoint;
178		190
179	region *reg = ob->region ();	191	region *reg = ob->region ();
180	if (socket.current_region != reg)	192	if (socket.current_region != reg)
181	{	193	{
182	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));	194	INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region));
…		…
212	else if (socket.current_x != ob->x \|\| socket.current_y != ob->y)	224	else if (socket.current_x != ob->x \|\| socket.current_y != ob->y)
213	{	225	{
214	int dx = ob->x - socket.current_x;	226	int dx = ob->x - socket.current_x;
215	int dy = ob->y - socket.current_y;	227	int dy = ob->y - socket.current_y;
216		228
217	if (socket.buggy_mapscroll && (abs (dx) > 8 \|\| abs (dy) > 8))
218	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
219	else
220	{
221	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);	229	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
222	socket.floorbox_reset ();	230	socket.floorbox_reset ();
223	}
224	}	231	}
225		232
226	socket.current_x = ob->x;	233	socket.current_x = ob->x;
227	socket.current_y = ob->y;	234	socket.current_y = ob->y;
		235	}
		236
		237	/**
		238	* This sends the skill number to name mapping. We ignore
		239	* the params - we always send the same info no matter what.
		240	*/
		241	static void
		242	send_skill_info (client ns, char params)
		243	{
		244	packet sl;
		245	sl << "replyinfo skill_info\n";
		246
		247	for (int i = 0; i < skillvec.size (); ++i)
		248	sl.printf ("%d:%s\n", CS_STAT_SKILLINFO + i, &skillvec [i]->name);
		249
		250	if (sl.length () > MAXSOCKBUF)
		251	{
		252	LOG (llevError, "Buffer overflow in send_skill_info!\n");
		253	fatal (0);
		254	}
		255
		256	ns->send_packet (sl);
		257	}
		258
		259	/**
		260	* This sends the spell path to name mapping. We ignore
		261	* the params - we always send the same info no matter what.
		262	*/
		263	static void
		264	send_spell_paths (client * ns, char *params)
		265	{
		266	packet sl;
		267
		268	sl << "replyinfo spell_paths\n";
		269
		270	for (int i = 0; i < NRSPELLPATHS; i++)
		271	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
		272
		273	if (sl.length () > MAXSOCKBUF)
		274	{
		275	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
		276	fatal (0);
		277	}
		278
		279	ns->send_packet (sl);
228	}	280	}
229		281
230	/**	282	/**
231	* RequestInfo is sort of a meta command. There is some specific	283	* RequestInfo is sort of a meta command. There is some specific
232	* request of information, but we call other functions to provide	284	* request of information, but we call other functions to provide
…		…
245	{	297	{
246	*params++ = 0;	298	*params++ = 0;
247	break;	299	break;
248	}	300	}
249		301
250	if (!strcmp (buf, "image_info"))
251	send_image_info (ns, params);
252	else if (!strcmp (buf, "image_sums"))
253	send_image_sums (ns, params);
254	else if (!strcmp (buf, "skill_info"))	302	if (!strcmp (buf, "skill_info"))
255	send_skill_info (ns, params);	303	send_skill_info (ns, params);
256	else if (!strcmp (buf, "spell_paths"))	304	else if (!strcmp (buf, "spell_paths"))
257	send_spell_paths (ns, params);	305	send_spell_paths (ns, params);
258	else	306	else
259	{	307	{
…		…
275	ExtiCmd (char buf, int len, client ns)	323	ExtiCmd (char buf, int len, client ns)
276	{	324	{
277	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));	325	INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
278	}	326	}
279		327
		328	//-GPL
		329
280	void	330	void
281	client::mapinfo_queue_clear ()	331	client::mapinfo_queue_clear ()
282	{	332	{
283	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)	333	for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i)
284	free (*i);	334	free (*i);
…		…
291	{	341	{
292	char *token = buf;	342	char *token = buf;
293	buf += strlen (buf) + 9;	343	buf += strlen (buf) + 9;
294		344
295	// initial map and its origin	345	// initial map and its origin
296	maptile *map = pl->observe->map;	346	maptile *map = pl->viewpoint->map;
297	int mapx = pl->ns->mapx / 2 - pl->observe->x;	347	int mapx = pl->ns->mapx / 2 - pl->viewpoint->x;
298	int mapy = pl->ns->mapy / 2 - pl->observe->y;	348	int mapy = pl->ns->mapy / 2 - pl->viewpoint->y;
299	int max_distance = 8; // limit maximum path length to something generous	349	int max_distance = 8; // limit maximum path length to something generous
300		350
301	while (*buf && map && max_distance)	351	while (*buf && map && max_distance)
302	{	352	{
303	int dir = *buf++ - '1';	353	int dir = *buf++ - '1';
…		…
408	AddMeCmd (char buf, int len, client ns)	458	AddMeCmd (char buf, int len, client ns)
409	{	459	{
410	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	460	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
411	}	461	}
412		462
413	/** Reply to ExtendedInfos command */	463	//+GPL
414	void
415	ToggleExtendedInfos (char buf, int len, client ns)
416	{
417	char cmdback[MAX_BUF];
418	char command[50];
419	int info, nextinfo;
420
421	cmdback[0] = '\0';
422	nextinfo = 0;
423
424	while (1)
425	{
426	/* 1. Extract an info */
427	info = nextinfo;
428
429	while ((info < len) && (buf[info] == ' '))
430	info++;
431
432	if (info >= len)
433	break;
434
435	nextinfo = info + 1;
436
437	while ((nextinfo < len) && (buf[nextinfo] != ' '))
438	nextinfo++;
439
440	if (nextinfo - info >= 49) /Erroneous info asked /
441	continue;
442
443	strncpy (command, &(buf[info]), nextinfo - info);
444
445	/* 2. Interpret info */
446	if (!strcmp ("smooth", command))
447	/* Toggle smoothing */
448	ns->EMI_smooth = !ns->EMI_smooth;
449	else
450	/bad value /;
451
452	/3. Next info /
453	}
454
455	strcpy (cmdback, "ExtendedInfoSet");
456
457	if (ns->EMI_smooth)
458	{
459	strcat (cmdback, " ");
460	strcat (cmdback, "smoothing");
461	}
462
463	ns->send_packet (cmdback);
464	}
465
466	/*
467	#define MSG_TYPE_BOOK 1
468	#define MSG_TYPE_CARD 2
469	#define MSG_TYPE_PAPER 3
470	#define MSG_TYPE_SIGN 4
471	#define MSG_TYPE_MONUMENT 5
472	#define MSG_TYPE_SCRIPTED_DIALOG 6*/
473
474	/** Reply to ExtendedInfos command */
475	void
476	ToggleExtendedText (char buf, int len, client ns)
477	{
478	char cmdback[MAX_BUF];
479	char temp[10];
480	char command[50];
481	int info, nextinfo, i, flag;
482
483	cmdback[0] = '\0';
484
485	nextinfo = 0;
486	while (1)
487	{
488	/* 1. Extract an info */
489	info = nextinfo;
490
491	while ((info < len) && (buf[info] == ' '))
492	info++;
493
494	if (info >= len)
495	break;
496
497	nextinfo = info + 1;
498
499	while ((nextinfo < len) && (buf[nextinfo] != ' '))
500	nextinfo++;
501
502	if (nextinfo - info >= 49) /Erroneous info asked /
503	continue;
504
505	strncpy (command, &(buf[info]), nextinfo - info);
506	command[nextinfo - info] = '\0';
507	/* 2. Interpret info */
508	i = sscanf (command, "%d", &flag);
509
510	if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST))
511	ns->supported_readables \|= (1 << flag);
512	/3. Next info /
513	}
514
515	/* Send resulting state */
516	strcpy (cmdback, "ExtendedTextSet");
517
518	for (i = 0; i <= MSG_TYPE_LAST; i++)
519	if (ns->supported_readables & (1 << i))
520	{
521	strcat (cmdback, " ");
522	snprintf (temp, sizeof (temp), "%d", i);
523	strcat (cmdback, temp);
524	}
525
526	ns->send_packet (cmdback);
527	}
528		464
529	/**	465	/**
530	* This handles the general commands from the client (ie, north, fire, cast,	466	* This handles the general commands from the client (ie, north, fire, cast,
531	* etc.)	467	* etc.)
532	*/	468	*/
…		…
545	return;	481	return;
546		482
547	buf++;	483	buf++;
548	}	484	}
549		485
550	execute_newserver_command (pl->ob, (char *) buf);	486	execute_newserver_command (pl->ob, (char *)buf);
551		487
552	/* Perhaps something better should be done with a left over count.	488	/* Perhaps something better should be done with a left over count.
553	* Cleaning up the input should probably be done first - all actions	489	* Cleaning up the input should probably be done first - all actions
554	* for the command that issued the count should be done before any other	490	* for the command that issued the count should be done before any other
555	* commands.	491	* commands.
…		…
589	* commands.	525	* commands.
590	*/	526	*/
591	pl->count = 0;	527	pl->count = 0;
592		528
593	//TODO: schmorp thinks whatever this calculates, it makes no sense at all	529	//TODO: schmorp thinks whatever this calculates, it makes no sense at all
594	int time = fabs (pl->ob->speed) < 0.001	530	int time = pl->ob->has_active_speed ()
595	? time = MAX_TIME * 100
596	: time = (int) (MAX_TIME / fabs (pl->ob->speed));	531	? (int) (MAX_TIME / pl->ob->speed)
		532	: MAX_TIME * 100;
597		533
598	/* Send confirmation of command execution now */	534	/* Send confirmation of command execution now */
599	packet sl ("comc");	535	packet sl ("comc");
600	sl << uint16 (cmdid) << uint32 (time);	536	sl << uint16 (cmdid) << uint32 (time);
601	pl->ns->send_packet (sl);	537	pl->ns->send_packet (sl);
…		…
643	LOG (llevError, "Unknown input state: %d\n", ns->state);	579	LOG (llevError, "Unknown input state: %d\n", ns->state);
644	}	580	}
645	}	581	}
646		582
647	/**	583	/**
648	* Client tells its version. If there is a mismatch, we close the	584	* Client tells its version info.
649	* socket. In real life, all we should care about is the client having
650	* something older than the server. If we assume the client will be
651	* backwards compatible, having it be a later version should not be a
652	* problem.
653	*/	585	*/
654	void	586	void
655	VersionCmd (char buf, int len, client ns)	587	VersionCmd (char buf, int len, client ns)
656	{	588	{
657	if (!buf)	589	INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len));
658	{
659	LOG (llevError, "CS: received corrupted version command\n");
660	return;
661	}
662
663	ns->cs_version = atoi (buf);
664	ns->sc_version = ns->cs_version;
665
666	LOG (llevDebug, "connection from client <%s>\n", buf);
667
668	//TODO: should log here just for statistics
669
670	//if (VERSION_CS != ns->cs_version)
671	// unchecked;
672
673	char *cp = strchr (buf + 1, ' ');
674	if (!cp)
675	return;
676
677	ns->sc_version = atoi (cp);
678
679	//if (VERSION_SC != ns->sc_version)
680	// unchecked;
681
682	cp = strchr (cp + 1, ' ');
683
684	if (cp)
685	{
686	ns->version = cp + 1;
687
688	if (ns->sc_version < 1026)
689	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
690	"** VERSION WARNING \n CLIENT IS TOO OLD!! UPDATE THE CLIENT!! **");
691	}
692	}	590	}
693		591
694	/** sound related functions. */	592	/** sound related functions. */
695	void	593	void
696	SetSound (char buf, int len, client ns)	594	SetSound (char buf, int len, client ns)
…		…
747	* Get player's current range attack in obuf.	645	* Get player's current range attack in obuf.
748	*/	646	*/
749	static void	647	static void
750	rangetostring (player pl, char obuf)	648	rangetostring (player pl, char obuf)
751	{	649	{
752	dynbuf_text buf;	650	dynbuf_text &buf = msg_dynbuf; buf.clear ();
		651
		652	#if 0
		653	// print ranged/chosen_skill etc. objects every call
		654	printf ("%s %s => %s (%s)\n",
		655	pl->ranged_ob ? &pl->ranged_ob->name : "-",
		656	pl->combat_ob ? &pl->combat_ob->name : "-",
		657	pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-",
		658	pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-"
		659	);
		660	#endif
753		661
754	if (pl->ranged_ob)	662	if (pl->ranged_ob)
755	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;	663	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
756		664
757	if (pl->combat_ob)	665	if (pl->combat_ob)
…		…
832	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);	740	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
833	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);	741	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
834	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);	742	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
835	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);	743	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
836		744
837	for (int s = 0; s < NUM_SKILLS; s++)	745	for (int s = 0; s < CS_NUM_SKILLS; s++)
838	if (object *skill = opl->last_skill_ob [s])	746	if (object *skill = opl->last_skill_ob [s])
839	if (skill->stats.exp != ns->last_skill_exp [s])	747	if (skill->stats.exp != ns->last_skill_exp [s])
840	{	748	{
841	ns->last_skill_exp [s] = skill->stats.exp;	749	ns->last_skill_exp [s] = skill->stats.exp;
842		750
843	/* Always send along the level if exp changes. This is only	751	/* Always send along the level if exp changes. This is only
844	* 1 extra byte, but keeps processing simpler.	752	* 1 extra byte, but keeps processing simpler.
845	*/	753	*/
846	sl << uint8 (s + CS_STAT_SKILLINFO)	754	sl << uint8 (CS_STAT_SKILLINFO + s)
847	<< uint8 (skill->level)	755	<< uint8 (skill->level)
848	<< uint64 (skill->stats.exp);	756	<< uint64 (skill->stats.exp);
849	}	757	}
850		758
851	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);	759	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
852	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);	760	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
853	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);	761	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
854	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);	762	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
855	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);	763	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
856	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);	764	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK);
857	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);	765	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
858	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);	766	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK);
859	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);	767	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
860		768
861	flags = 0;	769	flags = (opl->fire_on ? SF_FIREON : 0)
862		770	\| (opl->run_on ? SF_RUNON : 0);
863	if (opl->fire_on)
864	flags \|= SF_FIREON;
865
866	if (opl->run_on)
867	flags \|= SF_RUNON;
868		771
869	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);	772	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
870		773
871	if (ns->sc_version < 1025)
872	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
873	else
874	for (int i = 0; i < NROFATTACKS; i++)	774	for (int i = 0; i < NROFATTACKS; i++)
875	{
876	/* Skip ones we won't send */	775	/* Skip ones we won't send */
877	if (atnr_cs_stat[i] == -1)	776	if (atnr_cs_stat[i] >= 0)
878	continue;
879
880	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);	777	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
881	}
882		778
883	if (pl->ns->monitor_spells)	779	if (pl->ns->monitor_spells)
884	{	780	{
885	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);	781	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
886	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);	782	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
…		…
988		884
989	/* Nothing changed */	885	/* Nothing changed */
990	return 0;	886	return 0;
991	}	887	}
992		888
993	/**	889	//-GPL
994	* Returns the size of a data for a map square as returned by
995	* mapextended. There are CLIENTMAPXCLIENTMAPYLAYERS entries
996	* available.
997	*/
998	int
999	getExtendedMapInfoSize (client * ns)
1000	{
1001	int result = 0;
1002
1003	if (ns->ext_mapinfos)
1004	{
1005	if (ns->EMI_smooth)
1006	result += 1; /One byte for smoothlevel /
1007	}
1008
1009	return result;
1010	}
1011		890
1012	// prefetch (and touch) all maps within a specific distancd	891	// prefetch (and touch) all maps within a specific distancd
1013	static void	892	static void
1014	prefetch_surrounding_maps (maptile *map, int distance)	893	prefetch_surrounding_maps (maptile *map, int distance)
1015	{	894	{
1016	map->last_access = runtime;	895	map->touch ();
1017		896
1018	if (--distance)	897	if (--distance)
1019	for (int dir = 4; --dir; )	898	for (int dir = 4; dir--; )
1020	if (const shstr &path = map->tile_path [dir])	899	if (const shstr &path = map->tile_path [dir])
1021	if (maptile *&neigh = map->tile_map [dir])	900	if (maptile *&neigh = map->tile_map [dir])
1022	prefetch_surrounding_maps (neigh, distance);	901	prefetch_surrounding_maps (neigh, distance);
1023	else	902	else
1024	neigh = maptile::find_async (path, map);	903	neigh = maptile::find_async (path, map);
…		…
1029	prefetch_surrounding_maps (object *op)	908	prefetch_surrounding_maps (object *op)
1030	{	909	{
1031	prefetch_surrounding_maps (op->map, 3);	910	prefetch_surrounding_maps (op->map, 3);
1032	}	911	}
1033		912
		913	//+GPL
		914
1034	/**	915	/**
1035	* Draws client map.	916	* Draws client map.
1036	*/	917	*/
1037	void	918	void
1038	draw_client_map (player *pl)	919	draw_client_map (player *pl)
1039	{	920	{
1040	object *ob = pl->observe;	921	object *ob = pl->viewpoint;
1041	if (!ob->active)	922	if (!pl->observe->active)
1042	return;	923	return;
1043		924
1044	/* If player is just joining the game, he isn't here yet, so the map	925	/* If player is just joining the game, he isn't here yet, so the map
1045	* can get swapped out. If so, don't try to send them a map. All will	926	* can get swapped out. If so, don't try to send them a map. All will
1046	* be OK once they really log in.	927	* be OK once they really log in.
1047	*/	928	*/
1048	if (!ob->map \|\| ob->map->in_memory != MAP_ACTIVE)	929	if (!ob->map \|\| ob->map->in_memory != MAP_ACTIVE)
1049	return;	930	return;
1050		931
1051	int startlen, oldlen;	932	int startlen, oldlen;
1052	int estartlen, eoldlen;
1053	uint8 eentrysize;
1054	uint16 ewhatstart, ewhatflag;
1055	uint8 extendedinfos;
1056		933
1057	check_map_change (pl);	934	check_map_change (pl);
1058	prefetch_surrounding_maps (pl->ob);	935	prefetch_surrounding_maps (pl->ob);
1059		936
1060	/* do LOS after calls to update_position */	937	/* do LOS after calls to update_position */
1061	if (ob != pl->ob)	938	/* unfortunately, we need to udpate los when observing, currently */
1062	clear_los (pl);	939	if (pl->do_los \|\| pl->viewpoint != pl->ob)
1063	else if (pl->do_los)
1064	{	940	{
1065	update_los (ob);
1066	pl->do_los = 0;	941	pl->do_los = 0;
		942	pl->update_los ();
1067	}	943	}
1068		944
1069	/**	945	/**
1070	* This function uses the new map1 protocol command to send the map	946	* This function uses the new map1 protocol command to send the map
1071	* to the client. It is necessary because the old map command supports	947	* to the client. It is necessary because the old map command supports
…		…
1090	*/	966	*/
1091		967
1092	client &socket = *pl->ns;	968	client &socket = *pl->ns;
1093		969
1094	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");	970	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1095	packet esl;
1096		971
1097	startlen = sl.length ();	972	startlen = sl.length ();
1098		973
1099	/Extendedmapinfo structure initialisation /
1100	if (socket.ext_mapinfos)
1101	{
1102	extendedinfos = EMI_NOREDRAW;
1103
1104	if (socket.EMI_smooth)
1105	extendedinfos \|= EMI_SMOOTH;
1106
1107	ewhatstart = esl.length ();
1108	ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1109	could need to be taken away */
1110	eentrysize = getExtendedMapInfoSize (&socket);
1111	esl << "mapextended "
1112	<< uint8 (extendedinfos)
1113	<< uint8 (eentrysize);
1114
1115	estartlen = esl.length ();
1116	}
1117
1118	/* We could do this logic as conditionals in the if statement,
1119	* but that started to get a bit messy to look at.
1120	*/
1121	int hx = socket.mapx / 2;	974	int hx = socket.mapx / 2;
1122	int hy = socket.mapy / 2;	975	int hy = socket.mapy / 2;
1123		976
1124	for (int dx = -hx; dx <= hx; dx++)	977	ordered_mapwalk_begin (ob, -hx, -hy, hx, hy)
		978	int ax = dx + hx;
		979	int ay = dy + hy;
		980
		981	int mask = (ax << 10) \| (ay << 4);
		982	MapCell &lastcell = socket.lastmap.cells[ax][ay];
		983
		984	/* If the coordinates are not valid, or it is too dark to see,
		985	* we tell the client as such
		986	*/
		987	if (!m)
1125	{	988	{
1126	sint16 nx, ny;	989	/* space is out of map. Update space and clear values
1127	maptile *m = 0;	990	* if this hasn't already been done. If the space is out
1128		991	* of the map, it shouldn't have a head.
1129	for (int dy = -hy; dy <= hy; dy++)	992	*/
		993	if (lastcell.count != -1)
1130	{	994	{
1131	// check to see if we can simply go one down quickly	995	sl << uint16 (mask);
1132	if (m && ++ny >= m->height)	996	map_clearcell (&lastcell, -1);
		997	}
		998
		999	continue;
		1000	}
		1001
		1002	int d = pl->blocked_los_uc (dx, dy);
		1003
		1004	if (d > 3)
		1005	{
		1006	/* This block deals with spaces that are not visible for whatever
		1007	* reason. Still may need to send the head for this space.
		1008	*/
		1009	if (lastcell.count != -1
		1010	\|\| lastcell.faces[0]
		1011	\|\| lastcell.faces[1]
		1012	\|\| lastcell.faces[2]
		1013	\|\| lastcell.stat_hp
		1014	\|\| lastcell.flags
		1015	\|\| lastcell.player)
		1016	sl << uint16 (mask);
		1017
		1018	/* properly clear a previously sent big face */
		1019	map_clearcell (&lastcell, -1);
		1020	}
		1021	else
		1022	{
		1023	/* In this block, the space is visible.
		1024	*/
		1025
		1026	/* Rather than try to figure out what everything that we might
		1027	* need to send is, then form the packet after that,
		1028	* we presume that we will in fact form a packet, and update
		1029	* the bits by what we do actually send. If we send nothing,
		1030	* we just back out sl.length () to the old value, and no harm
		1031	* is done.
		1032	* I think this is simpler than doing a bunch of checks to see
		1033	* what if anything we need to send, setting the bits, then
		1034	* doing those checks again to add the real data.
		1035	*/
		1036	oldlen = sl.length ();
		1037
		1038	sl << uint16 (mask);
		1039
		1040	unsigned char dummy;
		1041	unsigned char *last_ext = &dummy;
		1042
		1043	/* Darkness changed */
		1044	if (lastcell.count != d)
		1045	{
1133	m = 0;	1046	mask \|= 0x8;
1134		1047
1135	// no, so do it the slow way	1048	*last_ext \|= 0x80;
1136	if (!m)	1049	last_ext = &sl[sl.length ()];
		1050	sl << uint8 (d);
		1051	}
		1052
		1053	lastcell.count = d;
		1054
		1055	mapspace &ms = m->at (nx, ny);
		1056	ms.update ();
		1057
		1058	// extmap handling
		1059	uint8 stat_hp = 0;
		1060	uint8 stat_width = 0;
		1061	uint8 flags = 0;
		1062	tag_t player = 0;
		1063
		1064	// send hp information, if applicable
		1065	if (object *op = ms.faces_obj [0])
		1066	if (op->is_head () && !op->invisible)
1137	{	1067	{
1138	nx = ob->x + dx; ny = ob->y + dy; m = ob->map;	1068	if (op->stats.maxhp > op->stats.hp
1139		1069	&& op->stats.maxhp > 0
1140	if (xy_normalise (m, nx, ny))	1070	&& (op->type == PLAYER
1141	m->touch ();	1071	\|\| op->type == DOOR // does not work, have maxhp 0
1142	else	1072	\|\| op->flag [FLAG_MONSTER]
		1073	\|\| op->flag [FLAG_ALIVE]
		1074	\|\| op->flag [FLAG_GENERATOR]))
1143	m = 0;	1075	{
		1076	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
		1077	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
		1078	}
		1079
		1080	if (expect_false (op->has_dialogue ()))
		1081	flags \|= 1;
		1082
		1083	if (expect_false (op->type == PLAYER))
		1084	player = op == ob ? pl->ob->count
		1085	: op == pl->ob ? ob->count
		1086	: op->count;
1144	}	1087	}
1145		1088
1146	int ax = dx + hx;	1089	if (expect_false (lastcell.stat_hp != stat_hp))
1147	int ay = dy + hy;
1148
1149	int emask, mask;
1150	emask = mask = (ax & 0x3f) << 10 \| (ay & 0x3f) << 4;
1151
1152	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1153
1154	/* If the coordinates are not valid, or it is too dark to see,
1155	* we tell the client as such
1156	*/
1157	if (!m)
1158	{	1090	{
1159	/* space is out of map. Update space and clear values	1091	lastcell.stat_hp = stat_hp;
1160	* if this hasn't already been done. If the space is out	1092
1161	* of the map, it shouldn't have a head.	1093	mask \|= 0x8;
1162	*/	1094	*last_ext \|= 0x80;
1163	if (lastcell.count != -1)	1095	last_ext = &sl[sl.length ()];
		1096
		1097	sl << uint8 (5) << uint8 (stat_hp);
		1098
		1099	if (stat_width > 1)
1164	{	1100	{
1165	sl << uint16 (mask);
1166	map_clearcell (&lastcell, -1);
1167	}
1168
1169	continue;
1170	}
1171
1172	int d = pl->blocked_los_uc (dx, dy);
1173
1174	if (d > 3)
1175	{
1176	int need_send = 0, count;
1177
1178	/* This block deals with spaces that are not visible for whatever
1179	* reason. Still may need to send the head for this space.
1180	*/
1181
1182	oldlen = sl.length ();
1183
1184	sl << uint16 (mask);
1185
1186	if (lastcell.count != -1)
1187	need_send = 1;
1188
1189	count = -1;
1190
1191	if (lastcell.faces[0] \|\| lastcell.faces[1] \|\| lastcell.faces[2]
1192	\|\| lastcell.stat_hp \|\| lastcell.flags \|\| lastcell.player)
1193	need_send = 1;
1194
1195	/* properly clear a previously sent big face */
1196	map_clearcell (&lastcell, count);
1197
1198	if ((mask & 0xf) \|\| need_send)
1199	sl[oldlen + 1] = mask & 0xff;
1200	else
1201	sl.reset (oldlen);
1202	}
1203	else
1204	{
1205	/* In this block, the space is visible.
1206	*/
1207
1208	/* Rather than try to figure out what everything that we might
1209	* need to send is, then form the packet after that,
1210	* we presume that we will in fact form a packet, and update
1211	* the bits by what we do actually send. If we send nothing,
1212	* we just back out sl.length () to the old value, and no harm
1213	* is done.
1214	* I think this is simpler than doing a bunch of checks to see
1215	* what if anything we need to send, setting the bits, then
1216	* doing those checks again to add the real data.
1217	*/
1218	oldlen = sl.length ();
1219	eoldlen = esl.length ();
1220
1221	sl << uint16 (mask);
1222
1223	unsigned char dummy;
1224	unsigned char *last_ext = &dummy;
1225
1226	/* Darkness changed */
1227	if (lastcell.count != d && socket.darkness)
1228	{
1229	mask \|= 0x8;
1230
1231	if (socket.extmap)
1232	{
1233	*last_ext \|= 0x80;	1101	*last_ext \|= 0x80;
1234	last_ext = &sl[sl.length ()];	1102	last_ext = &sl[sl.length ()];
1235	sl << uint8 (d);	1103
1236	}	1104	sl << uint8 (6) << uint8 (stat_width);
1237	else
1238	sl << uint8 (255 - 64 * d);
1239	}	1105	}
		1106	}
1240		1107
1241	lastcell.count = d;	1108	if (expect_false (lastcell.player != player))
1242
1243	mapspace &ms = m->at (nx, ny);
1244	ms.update ();
1245
1246	if (socket.extmap)
1247	{	1109	{
1248	uint8 stat_hp = 0;	1110	lastcell.player = player;
1249	uint8 stat_width = 0;
1250	uint8 flags = 0;
1251	tag_t player = 0;
1252		1111
1253	// send hp information, if applicable
1254	if (object *op = ms.faces_obj [0])
1255	if (op->is_head () && !op->invisible)
1256	{
1257	if (op->stats.maxhp > op->stats.hp
1258	&& op->stats.maxhp > 0
1259	&& (op->type == PLAYER
1260	\|\| op->type == DOOR // does not work, have maxhp 0
1261	\|\| QUERY_FLAG (op, FLAG_MONSTER)
1262	\|\| QUERY_FLAG (op, FLAG_ALIVE)
1263	\|\| QUERY_FLAG (op, FLAG_GENERATOR)))
1264	{
1265	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1266	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1267	}
1268
1269	if (op->has_dialogue ())
1270	flags \|= 1;
1271
1272	if (op->type == PLAYER)
1273	player = op == ob ? pl->ob->count
1274	: op == pl->ob ? ob->count
1275	: op->count;
1276	}
1277
1278	if (lastcell.stat_hp != stat_hp)
1279	{
1280	lastcell.stat_hp = stat_hp;
1281
1282	mask \|= 0x8;	1112	mask \|= 0x8;
1283	*last_ext \|= 0x80;	1113	*last_ext \|= 0x80;
1284	last_ext = &sl[sl.length ()];	1114	last_ext = &sl[sl.length ()];
1285		1115
1286	sl << uint8 (5) << uint8 (stat_hp);
1287
1288	if (stat_width > 1)
1289	{
1290	*last_ext \|= 0x80;
1291	last_ext = &sl[sl.length ()];
1292
1293	sl << uint8 (6) << uint8 (stat_width);
1294	}
1295	}
1296
1297	if (lastcell.player != player)
1298	{
1299	lastcell.player = player;
1300
1301	mask \|= 0x8;
1302	*last_ext \|= 0x80;
1303	last_ext = &sl[sl.length ()];
1304
1305	sl << uint8 (0x47) << uint8 (4) << (uint32)player;	1116	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1306	}	1117	}
1307		1118
1308	if (lastcell.flags != flags)	1119	if (expect_false (lastcell.flags != flags))
1309	{	1120	{
1310	lastcell.flags = flags;	1121	lastcell.flags = flags;
1311		1122
1312	mask \|= 0x8;	1123	mask \|= 0x8;
1313	*last_ext \|= 0x80;	1124	*last_ext \|= 0x80;
1314	last_ext = &sl[sl.length ()];	1125	last_ext = &sl[sl.length ()];
1315		1126
1316	sl << uint8 (8) << uint8 (flags);	1127	sl << uint8 (8) << uint8 (flags);
1317	}
1318	}	1128	}
1319		1129
		1130	// faces
		1131
1320	/* Floor face */	1132	/* Floor face */
1321	if (update_space (sl, socket, ms, lastcell, 2))	1133	if (update_space (sl, socket, ms, lastcell, 2))
1322	mask \|= 0x4;	1134	mask \|= 0x4;
1323		1135
1324	/* Middle face */	1136	/* Middle face */
1325	if (update_space (sl, socket, ms, lastcell, 1))	1137	if (update_space (sl, socket, ms, lastcell, 1))
1326	mask \|= 0x2;	1138	mask \|= 0x2;
1327		1139
1328	if (ob->invisible	1140	if (expect_false (ob->invisible)
1329	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)	1141	&& ob->invisible & (ob->invisible < 50 ? 1 : 7)
1330	&& ms.player () == ob)	1142	&& ms.player () == ob)
1331	{	1143	{
1332	// force player to be visible to himself if invisible	1144	// force player to be visible to himself if invisible
1333	if (lastcell.faces[0] != ob->face)	1145	if (lastcell.faces[0] != ob->face)
1334	{	1146	{
1335	lastcell.faces[0] = ob->face;	1147	lastcell.faces[0] = ob->face;
1336		1148
1337	mask \|= 0x1;
1338	sl << uint16 (ob->face);
1339
1340	socket.send_faces (ob);
1341	}
1342	}
1343	/* Top face */
1344	else if (update_space (sl, socket, ms, lastcell, 0))
1345	mask \|= 0x1;	1149	mask \|= 0x1;
		1150	sl << uint16 (ob->face);
1346		1151
		1152	socket.send_faces (ob);
		1153	}
		1154	}
		1155	/* Top face */
		1156	else if (update_space (sl, socket, ms, lastcell, 0))
		1157	mask \|= 0x1;
		1158
1347	/* Check to see if we are in fact sending anything for this	1159	/* Check to see if we are in fact sending anything for this
1348	* space by checking the mask. If so, update the mask.	1160	* space by checking the mask. If so, update the mask.
1349	* if not, reset the len to that from before adding the mask	1161	* if not, reset the len to that from before adding the mask
1350	* value, so we don't send those bits.	1162	* value, so we don't send those bits.
1351	*/	1163	*/
1352	if (mask & 0xf)	1164	if (mask & 0xf)
1353	sl[oldlen + 1] = mask & 0xff;	1165	sl[oldlen + 1] = mask & 0xff;
1354	else	1166	else
1355	sl.reset (oldlen);	1167	sl.reset (oldlen);
1356
1357	if (socket.ext_mapinfos)
1358	esl << uint16 (emask);
1359
1360	if (socket.EMI_smooth)
1361	{
1362	for (int layer = 2+1; layer--; )
1363	{
1364	object *ob = ms.faces_obj [layer];
1365
1366	// If there is no object for this space, or if the face for the object
1367	// is the blank face, set the smoothlevel to zero.
1368	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1369
1370	// We've gotten what face we want to use for the object. Now see if
1371	// if it has changed since we last sent it to the client.
1372	if (lastcell.smooth[layer] != smoothlevel)
1373	{
1374	lastcell.smooth[layer] = smoothlevel;
1375	esl << uint8 (smoothlevel);
1376	emask \|= 1 << layer;
1377	}
1378	}
1379
1380	if (emask & 0xf)
1381	esl[eoldlen + 1] = emask & 0xff;
1382	else
1383	esl.reset (eoldlen);
1384	}
1385	} /* else this is a viewable space */	1168	} /* else this is a viewable space */
1386	} /* for x loop */	1169	ordered_mapwalk_end
1387	} /* for y loop */
1388		1170
1389	socket.flush_fx ();	1171	socket.flush_fx ();
1390
1391	/* Verify that we in fact do need to send this */
1392	if (socket.ext_mapinfos)
1393	{
1394	if (!(sl.length () > startlen \|\| socket.sent_scroll))
1395	{
1396	/* No map data will follow, so don't say the client
1397	* it doesn't need draw!
1398	*/
1399	ewhatflag &= ~EMI_NOREDRAW;
1400	esl[ewhatstart + 1] = ewhatflag & 0xff;
1401	}
1402
1403	if (esl.length () > estartlen)
1404	socket.send_packet (esl);
1405	}
1406		1172
1407	if (sl.length () > startlen \|\| socket.sent_scroll)	1173	if (sl.length () > startlen \|\| socket.sent_scroll)
1408	{	1174	{
1409	socket.send_packet (sl);	1175	socket.send_packet (sl);
1410	socket.sent_scroll = 0;	1176	socket.sent_scroll = 0;
1411	}	1177	}
1412	}	1178	}
1413		1179
1414	/*****************************************************************************/
1415	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
1416	/* a player. Of course, the client need to know the command to be able to */
1417	/* manage it ! */
1418	/*****************************************************************************/
1419	void
1420	send_plugin_custom_message (object pl, char buf)
1421	{
1422	pl->contr->ns->send_packet (buf);
1423	}
1424
1425	/**
1426	* This sends the skill number to name mapping. We ignore
1427	* the params - we always send the same info no matter what.
1428	*/
1429	void
1430	send_skill_info (client ns, char params)
1431	{
1432	packet sl;
1433	sl << "replyinfo skill_info\n";
1434
1435	for (int i = 1; i < NUM_SKILLS; i++)
1436	sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]);
1437
1438	if (sl.length () > MAXSOCKBUF)
1439	{
1440	LOG (llevError, "Buffer overflow in send_skill_info!\n");
1441	fatal (0);
1442	}
1443
1444	ns->send_packet (sl);
1445	}
1446
1447	/**
1448	* This sends the spell path to name mapping. We ignore
1449	* the params - we always send the same info no matter what.
1450	*/
1451	void
1452	send_spell_paths (client * ns, char *params)
1453	{
1454	packet sl;
1455
1456	sl << "replyinfo spell_paths\n";
1457
1458	for (int i = 0; i < NRSPELLPATHS; i++)
1459	sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
1460
1461	if (sl.length () > MAXSOCKBUF)
1462	{
1463	LOG (llevError, "Buffer overflow in send_spell_paths!\n");
1464	fatal (0);
1465	}
1466
1467	ns->send_packet (sl);
1468	}
1469
1470	/**	1180	/**
1471	* This looks for any spells the player may have that have changed their stats.	1181	* This looks for any spells the player may have that have changed their stats.
1472	* it then sends an updspell packet for each spell that has changed in this way	1182	* it then sends an updspell packet for each spell that has changed in this way
1473	*/	1183	*/
1474	void	1184	void
1475	esrv_update_spells (player *pl)	1185	esrv_update_spells (player *pl)
1476	{	1186	{
1477	if (!pl->ns)	1187	if (!pl->ns)
1478	return;	1188	return;
1479		1189
		1190	pl->ns->update_spells = false;
		1191
1480	if (!pl->ns->monitor_spells)	1192	if (!pl->ns->monitor_spells)
1481	return;	1193	return;
1482		1194
1483	for (object *spell = pl->ob->inv; spell; spell = spell->below)	1195	for (object *spell = pl->ob->inv; spell; spell = spell->below)
1484	{
1485	if (spell->type == SPELL)	1196	if (spell->type == SPELL)
1486	{	1197	{
1487	int flags = 0;	1198	int flags = 0;
		1199	int val;
1488		1200
1489	/* check if we need to update it */	1201	/* check if we need to update it */
1490	if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))	1202	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
		1203	if (spell->cached_sp != val)
1491	{	1204	{
1492	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1205	spell->cached_sp = val;
1493	flags \|= UPD_SP_MANA;	1206	flags \|= UPD_SP_MANA;
1494	}	1207	}
1495		1208
1496	if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))	1209	val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
		1210	if (spell->cached_grace != val)
1497	{	1211	{
1498	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1212	spell->cached_grace = val;
1499	flags \|= UPD_SP_GRACE;	1213	flags \|= UPD_SP_GRACE;
1500	}	1214	}
1501		1215
1502	if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))	1216	val = casting_level (pl->ob, spell);
		1217	if (spell->cached_eat != val)
1503	{	1218	{
1504	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1219	spell->cached_eat = val;
1505	flags \|= UPD_SP_DAMAGE;	1220	flags \|= UPD_SP_LEVEL;
1506	}	1221	}
1507		1222
1508	if (flags)	1223	if (flags)
1509	{	1224	{
1510	packet sl;	1225	packet sl;
1511		1226
1512	sl << "updspell "	1227	sl << "updspell "
1513	<< uint8 (flags)	1228	<< uint8 (flags)
1514	<< uint32 (spell->count);	1229	<< uint32 (spell->count);
1515		1230
1516	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);	1231	if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp);
1517	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace);	1232	if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace);
1518	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat);	1233	if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat);
1519		1234
1520	pl->ns->send_packet (sl);	1235	pl->ns->send_packet (sl);
1521	}	1236	}
1522	}	1237	}
1523	}
1524	}	1238	}
1525		1239
1526	void	1240	void
1527	esrv_remove_spell (player pl, object spell)	1241	esrv_remove_spell (player pl, object spell)
1528	{	1242	{
…		…
1555	}	1269	}
1556		1270
1557	/* store costs and damage in the object struct, to compare to later */	1271	/* store costs and damage in the object struct, to compare to later */
1558	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);	1272	spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
1559	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);	1273	spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
1560	spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);	1274	spell->cached_eat = casting_level (pl->ob, spell);
1561		1275
1562	/* figure out which skill it uses, if it uses one */	1276	/* figure out which skill it uses, if it uses one */
1563	if (spell->skill)	1277	if (spell->skill)
1564	if (object *tmp = pl->find_skill (spell->skill))	1278	if (object *tmp = pl->find_skill (spell->skill))
1565	skill = tmp->subtype + CS_STAT_SKILLINFO;	1279	skill = CS_STAT_SKILLINFO + SKILL_INDEX (tmp);
1566		1280
1567	// spells better have a face	1281	// spells better have a face
1568	if (!spell->face)	1282	if (!spell->face)
1569	{	1283	{
1570	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);	1284	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
…		…
1654	/* finally, we can send the packet */	1368	/* finally, we can send the packet */
1655	pl->ns->flush_fx ();	1369	pl->ns->flush_fx ();
1656	pl->ns->send_packet (sl);	1370	pl->ns->send_packet (sl);
1657	}	1371	}
1658		1372
		1373	//-GPL
		1374

Diff Legend

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

Comparing deliantra/server/socket/request.C (file contents): Revision 1.141 by root, Fri Dec 19 22:47:30 2008 UTC vs. Revision 1.173 by root, Thu Apr 15 00:37:24 2010 UTC

Diff Legend

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.141 by root, Fri Dec 19 22:47:30 2008 UTC vs.
Revision 1.173 by root, Thu Apr 15 00:37:24 2010 UTC