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

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.45 by root, Tue Dec 19 04:58:05 2006 UTC vs.
Revision 1.74 by root, Wed Mar 14 01:19:10 2007 UTC

…		…
1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* CrossFire, A Multiplayer game for X-windows
3		3	*
		4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4	Copyright (C) 2001 Mark Wedel	5	* Copyright (C) 2001 Mark Wedel
5	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (C) 1992 Frank Tore Johansen
6		7	*
7	This program is free software; you can redistribute it and/or modify	8	* This program is free software; you can redistribute it and/or modify
8	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
9	the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation; either version 2 of the License, or
10	(at your option) any later version.	11	* (at your option) any later version.
11		12	*
12	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,
13	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15	GNU General Public License for more details.	16	* GNU General Public License for more details.
16		17	*
17	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License
18	along with this program; if not, write to the Free Software	19	* along with this program; if not, write to the Free Software
19	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20		21	*
21	The author can be reached via e-mail to <crossfire@schmorp.de>	22	* The author can be reached via e-mail to <crossfire@schmorp.de>
22	*/	23	*/
23		24
24	/**	25	/**
25	* \file	26	* \file
26	* Client handling.	27	* Client handling.
27	*	28	*
35	* have the prototype of (char *data, int datalen, int client_num). This	36	* have the prototype of (char *data, int datalen, int client_num). This
36	* way, we can use one dispatch table.	37	* way, we can use one dispatch table.
37	*	38	*
38	* esrv_map_new starts updating the map	39	* esrv_map_new starts updating the map
39	*	40	*
40	* esrv_map_setbelow allows filling in all of the faces for the map.
41	* if a face has not already been sent to the client, it is sent now.
42	*
43	*/	41	*/
44		42
45	#include <global.h>	43	#include <global.h>
46	#include <sproto.h>	44	#include <sproto.h>
47		45
…		…
100	* that much difference in bandwidth.	98	* that much difference in bandwidth.
101	*/	99	*/
102	mx = ns->mapx;	100	mx = ns->mapx;
103	my = ns->mapy;	101	my = ns->mapy;
104		102
105	if (ns->mapmode == Map1aCmd)
106	{
107	mx += MAX_HEAD_OFFSET;
108	my += MAX_HEAD_OFFSET;
109	}
110
111	/* the x and y here are coordinates for the new map, i.e. if we moved	103	/* the x and y here are coordinates for the new map, i.e. if we moved
112	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,	104	* (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,
113	* if the destination x or y coordinate is outside the viewable	105	* if the destination x or y coordinate is outside the viewable
114	* area, we clear the values - otherwise, the old values	106	* area, we clear the values - otherwise, the old values
115	* are preserved, and the check_head thinks it needs to clear them.	107	* are preserved, and the check_head thinks it needs to clear them.
…		…
138	}	130	}
139		131
140	static void	132	static void
141	clear_map (player *pl)	133	clear_map (player *pl)
142	{	134	{
143	client &socket = *pl->socket;
144
145	memset (&socket.lastmap, 0, sizeof (socket.lastmap));	135	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
146		136
147	if (socket.newmapcmd == 1)	137	if (pl->ns->newmapcmd == 1)
148	socket.send_packet ("newmap");	138	pl->ns->send_packet ("newmap");
149		139
150	socket.update_look = 1;	140	pl->ns->floorbox_reset ();
151	socket.look_position = 0;
152	}	141	}
153		142
154	/** check for map change and send new map data */	143	/** check for map/region change and send new map data */
155	static void	144	static void
156	check_map_change (player *pl)	145	check_map_change (player *pl)
157	{	146	{
158	client &socket = *pl->socket;	147	client &socket = *pl->ns;
159	object *ob = pl->ob;	148	object *ob = pl->ob;
160	char buf[MAX_BUF]; /* eauugggh */	149	char buf[MAX_BUF]; /* eauugggh */
161		150
162	if (socket.current_map != ob->map)	151	if (socket.current_map != ob->map)
163	{	152	{
…		…
179	flags \|= 4;	168	flags \|= 4;
180	if (ob->map->tile_path[3])	169	if (ob->map->tile_path[3])
181	flags \|= 8;	170	flags \|= 8;
182		171
183	snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",	172	snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
184	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path);	173	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
185	}	174	}
186	else	175	else
187	snprintf (buf, MAX_BUF, "mapinfo current");	176	snprintf (buf, MAX_BUF, "mapinfo current");
188		177
189	socket.send_packet (buf);	178	socket.send_packet (buf);
…		…
197	if (socket.buggy_mapscroll && (abs (dx) > 8 \|\| abs (dy) > 8))	186	if (socket.buggy_mapscroll && (abs (dx) > 8 \|\| abs (dy) > 8))
198	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows	187	clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
199	else	188	else
200	{	189	{
201	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);	190	socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
202	socket.update_look = 1;	191	socket.floorbox_reset ();
203	socket.look_position = 0;
204	}	192	}
205	}	193	}
206		194
207	socket.current_x = ob->x;	195	socket.current_x = ob->x;
208	socket.current_y = ob->y;	196	socket.current_y = ob->y;
		197
		198	region *reg = ob->region ();
		199	if (socket.current_region != reg)
		200	{
		201	socket.current_region = reg;
		202	socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
		203	}
209	}	204	}
210		205
211	/**	206	/**
212	* RequestInfo is sort of a meta command. There is some specific	207	* RequestInfo is sort of a meta command. There is some specific
213	* request of information, but we call other functions to provide	208	* request of information, but we call other functions to provide
…		…
284	buf += 8;	279	buf += 8;
285		280
286	// initial map and its origin	281	// initial map and its origin
287	maptile *map = pl->ob->map;	282	maptile *map = pl->ob->map;
288	sint16 dx, dy;	283	sint16 dx, dy;
289	int mapx = pl->socket->mapx / 2 - pl->ob->x;	284	int mapx = pl->ns->mapx / 2 - pl->ob->x;
290	int mapy = pl->socket->mapy / 2 - pl->ob->y;	285	int mapy = pl->ns->mapy / 2 - pl->ob->y;
291	int max_distance = 8; // limit maximum path length to something generous	286	int max_distance = 8; // limit maximum path length to something generous
292		287
293	while (*buf && map && max_distance)	288	while (*buf && map && max_distance)
294	{	289	{
295	int dir = *buf++;	290	int dir = *buf++;
296		291
297	switch (dir)	292	switch (dir)
298	{	293	{
299	case '1':	294	case '1':
300	dx = 0;	295	dx = 0;
301	dy = -1;	296	dy = -1;
302	map = get_map_from_coord (map, &dx, &dy);	297	map = map->xy_find (dx, dy);
303	map && (mapy -= map->height);	298	map && (mapy -= map->height);
304	break;	299	break;
305	case '2':	300	case '2':
306	mapx += map->width;	301	mapx += map->width;
307	dx = map->width;	302	dx = map->width;
308	dy = 0;	303	dy = 0;
309	map = get_map_from_coord (map, &dx, &dy);	304	map = map->xy_find (dx, dy);
310	break;	305	break;
311	case '3':	306	case '3':
312	mapy += map->height;	307	mapy += map->height;
313	dx = 0;	308	dx = 0;
314	dy = map->height;	309	dy = map->height;
315	map = get_map_from_coord (map, &dx, &dy);	310	map = map->xy_find (dx, dy);
316	break;	311	break;
317	case '4':	312	case '4':
318	dx = -1;	313	dx = -1;
319	dy = 0;	314	dy = 0;
320	map = get_map_from_coord (map, &dx, &dy);	315	map = map->xy_find (dx, dy);
321	map && (mapx -= map->width);	316	map && (mapx -= map->width);
322	break;	317	break;
323	}	318	}
324		319
325	--max_distance;	320	--max_distance;
326	}	321	}
327		322
…		…
338	if (map->tile_path[2])	333	if (map->tile_path[2])
339	flags \|= 4;	334	flags \|= 4;
340	if (map->tile_path[3])	335	if (map->tile_path[3])
341	flags \|= 8;	336	flags \|= 8;
342		337
343	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, map->path);	338	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
344	}	339	}
345	else	340	else
346	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	341	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
347	}	342	}
348	else	343	else
349	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);	344	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
350		345
351	pl->socket->send_packet (bigbuf);	346	pl->ns->send_packet (bigbuf);
352	}	347	}
353		348
354	/** This is the Setup cmd - easy first implementation */	349	/** This is the Setup cmd - easy first implementation */
355	void	350	void
356	SetUp (char buf, int len, client ns)	351	SetUp (char buf, int len, client ns)
…		…
403	{	398	{
404	ns->sound = atoi (param);	399	ns->sound = atoi (param);
405	safe_strcat (cmdback, param, &slen, HUGE_BUF);	400	safe_strcat (cmdback, param, &slen, HUGE_BUF);
406	}	401	}
407	else if (!strcmp (cmd, "exp64"))	402	else if (!strcmp (cmd, "exp64"))
408	{
409	ns->exp64 = atoi (param);
410	safe_strcat (cmdback, param, &slen, HUGE_BUF);	403	safe_strcat (cmdback, param, &slen, HUGE_BUF);
411	}
412	else if (!strcmp (cmd, "spellmon"))	404	else if (!strcmp (cmd, "spellmon"))
413	{	405	{
414	ns->monitor_spells = atoi (param);	406	ns->monitor_spells = atoi (param);
415	safe_strcat (cmdback, param, &slen, HUGE_BUF);	407	safe_strcat (cmdback, param, &slen, HUGE_BUF);
416	}	408	}
…		…
439	}	431	}
440	else if (!strcmp (cmd, "newmapcmd"))	432	else if (!strcmp (cmd, "newmapcmd"))
441	{	433	{
442	ns->newmapcmd = atoi (param);	434	ns->newmapcmd = atoi (param);
443	safe_strcat (cmdback, param, &slen, HUGE_BUF);	435	safe_strcat (cmdback, param, &slen, HUGE_BUF);
444	// } else if (!strcmp(cmd,"plugincmd")) {
445	// ns->plugincmd = atoi(param);
446	// safe_strcat(cmdback, param, &slen, HUGE_BUF);
447	}	436	}
448	else if (!strcmp (cmd, "mapinfocmd"))	437	else if (!strcmp (cmd, "mapinfocmd"))
449	{	438	{
450	ns->mapinfocmd = atoi (param);	439	ns->mapinfocmd = atoi (param);
451	safe_strcat (cmdback, "1", &slen, HUGE_BUF);	440	safe_strcat (cmdback, "1", &slen, HUGE_BUF);
…		…
507	if (cp == 'x' \|\| cp == 'X')	496	if (cp == 'x' \|\| cp == 'X')
508	{	497	{
509	y = atoi (cp + 1);	498	y = atoi (cp + 1);
510	break;	499	break;
511	}	500	}
		501
512	if (x < 9 \|\| y < 9 \|\| x > MAP_CLIENT_X \|\| y > MAP_CLIENT_Y)	502	if (x < 9 \|\| y < 9 \|\| x > MAP_CLIENT_X \|\| y > MAP_CLIENT_Y)
513	{	503	{
514	sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);	504	sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
515	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);	505	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
516	}	506	}
…		…
573	* it either has to be here or init_sockets needs to be exported.	563	* it either has to be here or init_sockets needs to be exported.
574	*/	564	*/
575	void	565	void
576	AddMeCmd (char buf, int len, client ns)	566	AddMeCmd (char buf, int len, client ns)
577	{	567	{
578	if (ns->status != Ns_Add \|\| add_player (ns))	568	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
579	ns->send_packet ("addme_failed");
580	else
581	ns->send_packet ("addme_success");
582	}	569	}
583		570
584	/** Reply to ExtendedInfos command */	571	/** Reply to ExtendedInfos command */
585	void	572	void
586	ToggleExtendedInfos (char buf, int len, client ns)	573	ToggleExtendedInfos (char buf, int len, client ns)
…		…
696		683
697	ns->send_packet (cmdback);	684	ns->send_packet (cmdback);
698	}	685	}
699		686
700	/**	687	/**
701	* A lot like the old AskSmooth (in fact, now called by AskSmooth).
702	* Basically, it makes no sense to wait for the client to request a
703	* a piece of data from us that we know the client wants. So
704	* if we know the client wants it, might as well push it to the
705	* client.
706	*/
707	static void
708	SendSmooth (client *ns, uint16 face)
709	{
710	uint16 smoothface;
711
712	/* If we can't find a face, return and set it so we won't try to send this
713	* again.
714	*/
715	if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface)))
716	{
717
718	LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name);
719	ns->faces_sent[face] \|= NS_FACESENT_SMOOTH;
720	return;
721	}
722
723	if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
724	esrv_send_face (ns, smoothface, 0);
725
726	ns->faces_sent[face] \|= NS_FACESENT_SMOOTH;
727
728	packet sl;
729
730	sl << "smooth "
731	<< uint16 (face)
732	<< uint16 (smoothface);
733
734	ns->send_packet (sl);
735	}
736
737	/**
738	* Tells client the picture it has to use	688	* Tells client the picture it has to use
739	* to smooth a picture number given as argument.	689	* to smooth a picture number given as argument.
740	*/	690	*/
741	void	691	void
742	AskSmooth (char buf, int len, client ns)	692	AskSmooth (char buf, int len, client ns)
743	{	693	{
744	SendSmooth (ns, atoi (buf));	694	ns->send_face (atoi (buf));
745	}	695	}
746		696
747	/**	697	/**
748	* This handles the general commands from the client (ie, north, fire, cast,	698	* This handles the general commands from the client (ie, north, fire, cast,
749	* etc.)	699	* etc.)
…		…
808	* commands.	758	* commands.
809	*/	759	*/
810	pl->count = 0;	760	pl->count = 0;
811		761
812	//TODO: schmorp thinks whatever this calculates, it makes no sense at all	762	//TODO: schmorp thinks whatever this calculates, it makes no sense at all
813	int time = FABS (pl->ob->speed) < 0.001	763	int time = fabs (pl->ob->speed) < 0.001
814	? time = MAX_TIME * 100	764	? time = MAX_TIME * 100
815	: time = (int) (MAX_TIME / FABS (pl->ob->speed));	765	: time = (int) (MAX_TIME / fabs (pl->ob->speed));
816		766
817	/* Send confirmation of command execution now */	767	/* Send confirmation of command execution now */
818	packet sl;	768	packet sl ("comc");
819	sl << "comc " << uint16 (cmdid) << uint32 (time);	769	sl << uint16 (cmdid) << uint32 (time);
820	pl->socket->send_packet (sl);	770	pl->ns->send_packet (sl);
821	}	771	}
822
823		772
824	/** This is a reply to a previous query. */	773	/** This is a reply to a previous query. */
825	void	774	void
826	ReplyCmd (char buf, int len, player pl)	775	ReplyCmd (char buf, int len, client ns)
827	{	776	{
		777	if (ns->state == ST_CUSTOM)
		778	{
		779	INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len));
		780	return;
		781	}
		782
		783	if (!ns->pl)
		784	return; //TODO: depends on the exact reply we are after
		785	//TODO: but right now, we always have a ns->pl
		786
		787	player *pl = ns->pl;
		788
828	/* This is to synthesize how the data would be stored if it	789	/* This is to synthesize how the data would be stored if it
829	* was normally entered. A bit of a hack, and should be cleaned up	790	* was normally entered. A bit of a hack, and should be cleaned up
830	* once all the X11 code is removed from the server.	791	* once all the X11 code is removed from the server.
831	*	792	*
832	* We pass 13 to many of the functions because this way they	793	* We pass 13 to many of the functions because this way they
…		…
835	*/	796	*/
836	snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);	797	snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
837		798
838	/* this avoids any hacking here */	799	/* this avoids any hacking here */
839		800
840	switch (pl->state)	801	switch (ns->state)
841	{	802	{
842	case ST_PLAYING:	803	case ST_PLAYING:
843	LOG (llevError, "Got reply message with ST_PLAYING input state\n");	804	LOG (llevError, "Got reply message with ST_PLAYING input state\n");
844	break;	805	break;
845		806
846	case ST_PLAY_AGAIN:
847	/* We can check this for return value (2==quit). Maybe we
848	* should, and do something appropriate?
849	*/
850	receive_play_again (pl->ob, buf[0]);
851	break;
852
853	case ST_ROLL_STAT:
854	key_roll_stat (pl->ob, buf[0]);
855	break;
856
857	case ST_CHANGE_CLASS:	807	case ST_CHANGE_CLASS:
858
859	key_change_class (pl->ob, buf[0]);	808	key_change_class (pl->ob, buf[0]);
860	break;
861
862	case ST_CONFIRM_QUIT:
863	key_confirm_quit (pl->ob, buf[0]);
864	break;
865
866	case ST_CONFIGURE:
867	LOG (llevError, "In client input handling, but into configure state\n");
868	pl->state = ST_PLAYING;
869	break;
870
871	case ST_GET_NAME:
872	receive_player_name (pl->ob, 13);
873	break;
874
875	case ST_GET_PASSWORD:
876	case ST_CONFIRM_PASSWORD:
877	receive_player_password (pl->ob, 13);
878	break;	809	break;
879		810
880	case ST_GET_PARTY_PASSWORD: /* Get password for party */	811	case ST_GET_PARTY_PASSWORD: /* Get password for party */
881	receive_party_password (pl->ob, 13);	812	receive_party_password (pl->ob, 13);
882	break;	813	break;
883		814
884	default:	815	default:
885	LOG (llevError, "Unknown input state: %d\n", pl->state);	816	LOG (llevError, "Unknown input state: %d\n", ns->state);
886	}	817	}
887	}	818	}
888		819
889	/**	820	/**
890	* Client tells its version. If there is a mismatch, we close the	821	* Client tells its version. If there is a mismatch, we close the
…		…
905	ns->cs_version = atoi (buf);	836	ns->cs_version = atoi (buf);
906	ns->sc_version = ns->cs_version;	837	ns->sc_version = ns->cs_version;
907		838
908	LOG (llevDebug, "connection from client <%s>\n", buf);	839	LOG (llevDebug, "connection from client <%s>\n", buf);
909		840
910
911	//TODO: should log here just for statistics	841	//TODO: should log here just for statistics
912		842
913	//if (VERSION_CS != ns->cs_version)	843	//if (VERSION_CS != ns->cs_version)
914	// unchecked;	844	// unchecked;
915		845
…		…
940	{	870	{
941	ns->sound = atoi (buf);	871	ns->sound = atoi (buf);
942	}	872	}
943		873
944	/** client wants the map resent */	874	/** client wants the map resent */
945
946	void	875	void
947	MapRedrawCmd (char buf, int len, player pl)	876	MapRedrawCmd (char buf, int len, player pl)
948	{	877	{
949	/* This function is currently disabled; just clearing the map state results in	878	/* This function is currently disabled; just clearing the map state results in
950	* display errors. It should clear the cache and send a newmap command.	879	* display errors. It should clear the cache and send a newmap command.
…		…
1037	esrv_update_stats (player *pl)	966	esrv_update_stats (player *pl)
1038	{	967	{
1039	char buf[MAX_BUF];	968	char buf[MAX_BUF];
1040	uint16 flags;	969	uint16 flags;
1041		970
1042	packet sl;	971	client *ns = pl->ns;
1043	sl << "stats ";	972	if (!ns)
		973	return;
1044		974
		975	object *ob = pl->ob;
1045	if (pl->ob)	976	if (!ob)
1046	{	977	return;
		978
		979	packet sl ("stats");
		980
1047	AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);	981	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1048	AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);	982	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
1049	AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);	983	AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP);
1050	AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);	984	AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP);
1051	AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE);	985	AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE);
1052	AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE);	986	AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE);
1053	AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR);	987	AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR);
1054	AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);
1055	AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);
1056	AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);
1057	AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX);	988	AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX);
1058	AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);	989	AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON);
		990	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
		991	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
		992	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
1059	AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);	993	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1060	}
1061		994
1062	if (pl->socket->exp64)
1063	for (int s = 0; s < NUM_SKILLS; s++)	995	for (int s = 0; s < NUM_SKILLS; s++)
1064	if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)	996	if (object *skill = pl->last_skill_ob[s])
		997	if (skill->stats.exp != ns->last_skill_exp [s])
1065	{	998	{
		999	ns->last_skill_exp [s] = skill->stats.exp;
		1000
1066	/* Always send along the level if exp changes. This is only	1001	/* Always send along the level if exp changes. This is only
1067	* 1 extra byte, but keeps processing simpler.	1002	* 1 extra byte, but keeps processing simpler.
1068	*/	1003	*/
1069	sl << uint8 (s + CS_STAT_SKILLINFO)	1004	sl << uint8 (s + CS_STAT_SKILLINFO)
1070	<< uint8 (pl->last_skill_ob[s]->level)	1005	<< uint8 (skill->level)
1071	<< uint64 (pl->last_skill_ob[s]->stats.exp);	1006	<< uint64 (skill->stats.exp);
1072
1073	pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1074	}	1007	}
1075		1008
1076	if (pl->socket->exp64)
1077	{ AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }	1009	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1078	else
1079	{ AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1080
1081	AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);	1010	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1082	AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC);	1011	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1083	AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC);	1012	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1084	AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM);	1013	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1085	AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED);	1014	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);
1086	AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD);	1015	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1087	AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);	1016	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);
1088	AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM);	1017	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
		1018
1089	flags = 0;	1019	flags = 0;
1090		1020
1091	if (pl->fire_on)	1021	if (pl->fire_on)
1092	flags \|= SF_FIREON;	1022	flags \|= SF_FIREON;
1093		1023
1094	if (pl->run_on)	1024	if (pl->run_on)
1095	flags \|= SF_RUNON;	1025	flags \|= SF_RUNON;
1096		1026
1097	AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);	1027	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1098		1028
1099	if (pl->socket->sc_version < 1025)	1029	if (ns->sc_version < 1025)
1100	{ AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }	1030	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1101	else	1031	else
1102	for (int i = 0; i < NROFATTACKS; i++)	1032	for (int i = 0; i < NROFATTACKS; i++)
1103	{	1033	{
1104	/* Skip ones we won't send */	1034	/* Skip ones we won't send */
1105	if (atnr_cs_stat[i] == -1)	1035	if (atnr_cs_stat[i] == -1)
1106	continue;	1036	continue;
1107		1037
1108	AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);	1038	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
1109	}	1039	}
1110		1040
1111	if (pl->socket->monitor_spells)	1041	if (pl->ns->monitor_spells)
1112	{	1042	{
1113	AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);	1043	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1114	AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);	1044	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1115	AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY);	1045	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1116	}	1046	}
1117		1047
1118	rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */	1048	rangetostring (ob, buf); /* we want use the new fire & run system in new client */
1119	AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE);	1049	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1120	set_title (pl->ob, buf);	1050	set_title (ob, buf);
1121	AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE);	1051	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1122		1052
1123	/* Only send it away if we have some actual data */	1053	/* Only send it away if we have some actual data */
1124	if (sl.length () > 6)	1054	if (sl.length () > 6)
1125	pl->socket->send_packet (sl);	1055	ns->send_packet (sl);
1126	}	1056	}
1127		1057
1128	/**	1058	/**
1129	* Tells the client that here is a player it should start using.	1059	* Tells the client that here is a player it should start using.
1130	*/	1060	*/
1131	void	1061	void
1132	esrv_new_player (player *pl, uint32 weight)	1062	esrv_new_player (player *pl, uint32 weight)
1133	{	1063	{
1134	pl->last_weight = weight;	1064	packet sl ("player");
1135
1136	packet sl;
1137	sl << "player ";
1138		1065
1139	sl << uint32 (pl->ob->count)	1066	sl << uint32 (pl->ob->count)
1140	<< uint32 (weight)	1067	<< uint32 (weight)
1141	<< uint32 (pl->ob->face->number)	1068	<< uint32 (pl->ob->face)
1142	<< data8 (pl->ob->name);	1069	<< data8 (pl->ob->name);
1143		1070
		1071	pl->ns->last_weight = weight;
1144	pl->socket->send_packet (sl);	1072	pl->ns->send_packet (sl);
1145	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);	1073	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1146	}	1074	}
1147
1148	/**
1149	* Need to send an animation sequence to the client.
1150	* We will send appropriate face commands to the client if we haven't
1151	* sent them the face yet (this can become quite costly in terms of
1152	* how much we are sending - on the other hand, this should only happen
1153	* when the player logs in and picks stuff up.
1154	*/
1155	void
1156	esrv_send_animation (client * ns, short anim_num)
1157	{
1158	/* Do some checking on the anim_num we got. Note that the animations
1159	* are added in contigous order, so if the number is in the valid
1160	* range, it must be a valid animation.
1161	*/
1162	if (anim_num < 0 \|\| anim_num > num_animations)
1163	{
1164	LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1165	return;
1166	}
1167
1168	packet sl;
1169
1170	sl << "anim "
1171	<< uint16 (anim_num)
1172	<< uint16 (0); /* flags - not used right now */
1173
1174	/* Build up the list of faces. Also, send any information (ie, the
1175	* the face itself) down to the client.
1176	*/
1177	for (int i = 0; i < animations[anim_num].num_animations; i++)
1178	{
1179	if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1180	esrv_send_face (ns, animations[anim_num].faces[i], 0);
1181
1182	sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1183	}
1184
1185	ns->send_packet (sl);
1186
1187	ns->anims_sent[anim_num] = 1;
1188	}
1189
1190		1075
1191	/******************************************************************************	1076	/******************************************************************************
1192	*	1077	*
1193	* Start of map related commands.	1078	* Start of map related commands.
1194	*	1079	*
1195	******************************************************************************/	1080	******************************************************************************/
1196		1081
1197	/**
1198	* This adds face_num to a map cell at x,y. If the client doesn't have
1199	* the face yet, we will also send it.
1200	*/
1201	static void
1202	esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1203	{
1204	if (newmap->cells[x][y].count >= MAP_LAYERS)
1205	{
1206	//TODO: one or the other, can't both have abort and return, verify and act
1207	LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1208	return;
1209	abort ();
1210	}
1211
1212	newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1213	newmap->cells[x][y].count++;
1214
1215	if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1216	esrv_send_face (ns, face_num, 0);
1217	}
1218
1219	/** Clears a map cell */	1082	/** Clears a map cell */
1220	static void	1083	static void
1221	map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)	1084	map_clearcell (struct MapCell *cell, int count)
1222	{	1085	{
1223	cell->faces[0] = face0;	1086	cell->faces[0] = 0;
1224	cell->faces[1] = face1;	1087	cell->faces[1] = 0;
1225	cell->faces[2] = face2;	1088	cell->faces[2] = 0;
1226	cell->count = count;	1089	cell->count = count;
1227	cell->stat_hp = 0;	1090	cell->stat_hp = 0;
1228	cell->flags = 0;	1091	cell->flags = 0;
1229	cell->player = 0;	1092	cell->player = 0;
1230	}	1093	}
1231		1094
1232	#define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y)
1233	#define MAX_LAYERS 3	1095	#define MAX_LAYERS 3
1234
1235	/* Using a global really isn't a good approach, but saves the over head of
1236	* allocating and deallocating such a block of data each time run through,
1237	* and saves the space of allocating this in the socket object when we only
1238	* need it for this cycle. If the server is ever threaded, this needs to be
1239	* re-examined.
1240	*/
1241	static object heads[MAX_HEAD_POS MAX_HEAD_POS * MAX_LAYERS];
1242
1243	/**
1244	* Returns true if any of the heads for this
1245	* space is set. Returns false if all are blank - this is used
1246	* for empty space checking.
1247	*/
1248	static inline int
1249	have_head (int ax, int ay)
1250	{
1251	if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] \|\|
1252	heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] \|\| heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1253	return 1;
1254
1255	return 0;
1256	}
1257
1258	/**
1259	* check_head is a bit simplistic version of update_space below.
1260	* basically, it only checks the that the head on space ax,ay at layer
1261	* needs to get sent - if so, it adds the data, sending the head
1262	* if needed, and returning 1. If this no data needs to get
1263	* sent, it returns zero.
1264	*/
1265	static int
1266	check_head (packet &sl, client &ns, int ax, int ay, int layer)
1267	{
1268	short face_num;
1269
1270	if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1271	face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1272	else
1273	face_num = 0;
1274
1275	if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1276	{
1277	sl << uint16 (face_num);
1278	if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1279	esrv_send_face (&ns, face_num, 0);
1280
1281	heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1282	ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1283	return 1;
1284	}
1285
1286	return 0; /* No change */
1287	}
1288		1096
1289	/**	1097	/**
1290	* Removes the need to replicate the same code for each layer.	1098	* Removes the need to replicate the same code for each layer.
1291	* this returns true if this space is now in fact different than	1099	* this returns true if this space is now in fact different than
1292	* it was.	1100	* it was.
…		…
1306	* actually match.	1114	* actually match.
1307	*/	1115	*/
1308	static int	1116	static int
1309	update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)	1117	update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1310	{	1118	{
1311	object ob, head;
1312	uint16 face_num;	1119	uint16 face_num;
1313	int bx, by, i;	1120	int bx, by, i;
1314		1121
1315	/* If there is a multipart object stored away, treat that as more important.
1316	* If not, then do the normal processing.
1317	*/
1318	head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1319
1320	/* Check to see if this head is part of the set of objects
1321	* we would normally send for this space. If so, then
1322	* don't use the head value. We need to do the check
1323	* here and not when setting up the heads[] value for two reasons -
1324	* 1) the heads[] values will get used even if the space is not visible.
1325	* 2) its possible the head is not on the same map as a part, and I'd
1326	* rather not need to do the map translation overhead.
1327	* 3) We need to do some extra checking to make sure that we will
1328	* otherwise send the image as this layer, eg, either it matches
1329	* the head value, or is not multipart.
1330	*/
1331	if (head && !head->more)
1332	{
1333	for (i = 0; i < MAP_LAYERS; i++)
1334	{
1335	ob = GET_MAP_FACE_OBJ (mp, mx, my, i);
1336	if (!ob)
1337	continue;
1338
1339	if (ob->head)
1340	ob = ob->head;
1341
1342	if (ob == head)
1343	{
1344	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL;
1345	head = NULL;
1346	break;
1347	}
1348	}
1349	}
1350
1351	ob = head;
1352	if (!ob)
1353	ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);	1122	object *ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1354		1123
1355	/* If there is no object for this space, or if the face for the object	1124	/* If there is no object for this space, or if the face for the object
1356	* is the blank face, set the face number to zero.	1125	* is the blank face, set the face number to zero.
1357	* else if we have the stored head object for this space, that takes	1126	* else if we have the stored head object for this space, that takes
1358	* precedence over the other object for this space.	1127	* precedence over the other object for this space.
1359	* otherwise, we do special head processing	1128	* otherwise, we do special head processing
1360	*/	1129	*/
1361	if (!ob \|\| ob->face == blank_face)	1130	if (!ob \|\| ob->face == blank_face)
1362	face_num = 0;	1131	face_num = 0;
1363	else if (head)
1364	{
1365	/* if this is a head that had previously been stored */
1366	face_num = ob->face->number;
1367	}
1368	else	1132	else
1369	{
1370	/* if the faces for the different parts of a multipart object
1371	* are the same, we only want to send the bottom right most
1372	* portion of the object. That info is in the tail_.. values
1373	* of the head. Note that for the head itself, ob->head will
1374	* be null, so we only do this block if we are working on
1375	* a tail piece.
1376	*/
1377
1378	/* tail_x and tail_y will only be set in the head object. If
1379	* this is the head object and these are set, we proceed
1380	* with logic to only send bottom right. Similarly, if
1381	* this is one of the more parts but the head has those values
1382	* set, we want to do the processing. There can be cases where
1383	* the head is not visible but one of its parts is, so we just
1384	* can always expect that ob->arch->tail_x will be true for all
1385	* object we may want to display.
1386	*/
1387	if ((ob->arch->tail_x \|\| ob->arch->tail_y) \|\| (ob->head && (ob->head->arch->tail_x \|\| ob->head->arch->tail_y)))
1388	{
1389
1390	if (ob->head)
1391	head = ob->head;
1392	else
1393	head = ob;
1394
1395	/* Basically figure out where the offset is from where we are right
1396	* now. the ob->arch->clone.{x,y} values hold the offset that this current
1397	* piece is from the head, and the tail is where the tail is from the
1398	* head. Note that bx and by will equal sx and sy if we are already working
1399	* on the bottom right corner. If ob is the head, the clone values
1400	* will be zero, so the right thing will still happen.
1401	*/
1402	bx = sx + head->arch->tail_x - ob->arch->clone.x;
1403	by = sy + head->arch->tail_y - ob->arch->clone.y;
1404
1405	/* I don't think this can ever happen, but better to check for it just
1406	* in case.
1407	*/
1408	if (bx < sx \|\| by < sy)
1409	{
1410	LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy);
1411	face_num = 0;
1412	}
1413	/* single part object, multipart object with non merged faces,
1414	* of multipart object already at lower right.
1415	*/
1416	else if (bx == sx && by == sy)
1417	{
1418	face_num = ob->face->number;
1419
1420	/* if this face matches one stored away, clear that one away.
1421	* this code relies on the fact that the map1 commands
1422	* goes from 2 down to 0.
1423	*/
1424	for (i = 0; i < MAP_LAYERS; i++)
1425	if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] &&
1426	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num)
1427	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL;
1428	}
1429	else
1430	{
1431	/* If this head is stored away, clear it - otherwise,
1432	* there can be cases where a object is on multiple layers -
1433	* we only want to send it once.
1434	*/
1435	face_num = head->face->number;
1436	for (i = 0; i < MAP_LAYERS; i++)
1437	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] &&
1438	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num)
1439	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL;
1440
1441	/* First, try to put the new head on the same layer. If that is used up,
1442	* then find another layer.
1443	*/
1444	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL)
1445	{
1446	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head;
1447	}
1448	else
1449	for (i = 0; i < MAX_LAYERS; i++)
1450	{
1451	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL \|\|
1452	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head)
1453	{
1454	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head;
1455	}
1456	}
1457	face_num = 0; /* Don't send this object - we'll send the head later */
1458	}
1459	}
1460	else
1461	{
1462	/* In this case, we are already at the lower right or single part object,	1133	/* In this case, we are already at the lower right or single part object,
1463	* so nothing special	1134	* so nothing special
1464	*/
1465	face_num = ob->face->number;
1466
1467	/* clear out any head entries that have the same face as this one */
1468	for (bx = 0; bx < layer; bx++)
1469	if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] &&
1470	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num)
1471	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL;
1472	}
1473	} /* else not already head object or blank face */
1474
1475	/* This is a real hack. Basically, if we have nothing to send for this layer,
1476	* but there is a head on the next layer, send that instead.
1477	* Without this, what happens is you can get the case where the player stands
1478	* on the same space as the head. However, if you have overlapping big objects
1479	* of the same type, what happens then is it doesn't think it needs to send
1480	* This tends to make stacking also work/look better.
1481	*/	1135	*/
1482	if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1])
1483	{
1484	face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number;
1485	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL;
1486	}
1487
1488	/* Another hack - because of heads and whatnot, this face may match one
1489	* we already sent for a lower layer. In that case, don't send
1490	* this one.
1491	*/
1492	if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1493	face_num = 0;	1136	face_num = ob->face;
1494		1137
1495	/* We've gotten what face we want to use for the object. Now see if	1138	/* We've gotten what face we want to use for the object. Now see if
1496	* if it has changed since we last sent it to the client.	1139	* if it has changed since we last sent it to the client.
1497	*/	1140	*/
1498	if (ns.lastmap.cells[sx][sy].faces[layer] != face_num)	1141	if (ns.lastmap.cells[sx][sy].faces[layer] != face_num)
1499	{	1142	{
1500	ns.lastmap.cells[sx][sy].faces[layer] = face_num;	1143	ns.lastmap.cells[sx][sy].faces[layer] = face_num;
		1144
1501	if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE))	1145	if (!ns.faces_sent[face_num])
		1146	if (ob)
		1147	ns.send_faces (ob);
		1148	else
1502	esrv_send_face (&ns, face_num, 0);	1149	ns.send_face (face_num);
1503		1150
1504	sl << uint16 (face_num);	1151	sl << uint16 (face_num);
1505	return 1;	1152	return 1;
1506	}	1153	}
1507		1154
…		…
1525	* holds the old values.	1172	* holds the old values.
1526	* layer is the layer to update, with 2 being the floor and 0 the	1173	* layer is the layer to update, with 2 being the floor and 0 the
1527	* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ	1174	* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1528	* take.	1175	* take.
1529	*/	1176	*/
1530
1531	static inline int	1177	static inline int
1532	update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)	1178	update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1533	{	1179	{
1534	object *ob;
1535	int smoothlevel; /* old face_num; */
1536
1537	ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);	1180	object *ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1538		1181
1539	/* If there is no object for this space, or if the face for the object	1182	/* If there is no object for this space, or if the face for the object
1540	* is the blank face, set the smoothlevel to zero.	1183	* is the blank face, set the smoothlevel to zero.
1541	*/	1184	*/
1542	if (!ob \|\| ob->face == blank_face \|\| MAP_NOSMOOTH (mp))	1185	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
1543	smoothlevel = 0;
1544	else
1545	{
1546	smoothlevel = ob->smoothlevel;
1547	if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
1548	SendSmooth (&ns, ob->face->number);
1549	} /* else not already head object or blank face */
1550		1186
1551	/* We've gotten what face we want to use for the object. Now see if	1187	/* We've gotten what face we want to use for the object. Now see if
1552	* if it has changed since we last sent it to the client.	1188	* if it has changed since we last sent it to the client.
1553	*/	1189	*/
1554	if (smoothlevel > 255)	1190	if (smoothlevel > 255)
…		…
1582	if (ns->EMI_smooth)	1218	if (ns->EMI_smooth)
1583	result += 1; /One byte for smoothlevel /	1219	result += 1; /One byte for smoothlevel /
1584	}	1220	}
1585		1221
1586	return result;	1222	return result;
		1223	}
		1224
		1225	// prefetch (and touch) all maps within a specific distancd
		1226	static void
		1227	prefetch_surrounding_maps (maptile *map, int distance)
		1228	{
		1229	map->last_access = runtime;
		1230
		1231	if (--distance)
		1232	for (int dir = 4; --dir; )
		1233	if (const shstr &path = map->tile_path [dir])
		1234	if (maptile *&neigh = map->tile_map [dir])
		1235	prefetch_surrounding_maps (neigh, distance);
		1236	else
		1237	neigh = maptile::find_async (path, map);
		1238	}
		1239
		1240	// prefetch a generous area around the player
		1241	static void
		1242	prefetch_surrounding_maps (object *op)
		1243	{
		1244	prefetch_surrounding_maps (op->map, 3);
1587	}	1245	}
1588		1246
1589	/**	1247	/**
1590	* This function uses the new map1 protocol command to send the map	1248	* This function uses the new map1 protocol command to send the map
1591	* to the client. It is necessary because the old map command supports	1249	* to the client. It is necessary because the old map command supports
…		…
1597	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off	1255	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1598	* maps no sense. Instead, we actually really only use 12 bits for coordinates,	1256	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
1599	* and use the other 4 bits for other informatiion. For full documentation	1257	* and use the other 4 bits for other informatiion. For full documentation
1600	* of what we send, see the doc/Protocol file.	1258	* of what we send, see the doc/Protocol file.
1601	* I will describe internally what we do:	1259	* I will describe internally what we do:
1602	* the socket->lastmap shows how the map last looked when sent to the client.	1260	* the ns->lastmap shows how the map last looked when sent to the client.
1603	* in the lastmap structure, there is a cells array, which is set to the	1261	* in the lastmap structure, there is a cells array, which is set to the
1604	* maximum viewable size (As set in config.h).	1262	* maximum viewable size (As set in config.h).
1605	* in the cells, there are faces and a count value.	1263	* in the cells, there are faces and a count value.
1606	* we use the count value to hold the darkness value. If -1, then this space	1264	* we use the count value to hold the darkness value. If -1, then this space
1607	* is not viewable.	1265	* is not viewable.
…		…
1609	* look like.	1267	* look like.
1610	*/	1268	*/
1611	void	1269	void
1612	draw_client_map1 (object *pl)	1270	draw_client_map1 (object *pl)
1613	{	1271	{
1614	int x, y, ax, ay, d, startlen, max_x, max_y, oldlen;	1272	int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1615	sint16 nx, ny;	1273	sint16 nx, ny;
1616	int estartlen, eoldlen;	1274	int estartlen, eoldlen;
1617	uint16 mask, emask;
1618	uint8 eentrysize;	1275	uint8 eentrysize;
1619	uint16 ewhatstart, ewhatflag;	1276	uint16 ewhatstart, ewhatflag;
1620	uint8 extendedinfos;	1277	uint8 extendedinfos;
1621	maptile *m;	1278	maptile *m;
1622		1279
1623	client &socket = *pl->contr->socket;	1280	client &socket = *pl->contr->ns;
		1281
		1282	if (!pl->active)
		1283	return;
1624		1284
1625	check_map_change (pl->contr);	1285	check_map_change (pl->contr);
		1286	prefetch_surrounding_maps (pl);
1626		1287
1627	packet sl;	1288	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1628	packet esl;	1289	packet esl;
1629		1290
1630	sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1631	startlen = sl.length ();	1291	startlen = sl.length ();
1632		1292
1633	/Extendedmapinfo structure initialisation /	1293	/Extendedmapinfo structure initialisation /
1634	if (socket.ext_mapinfos)	1294	if (socket.ext_mapinfos)
1635	{	1295	{
…		…
1654	ewhatstart = 0;	1314	ewhatstart = 0;
1655	ewhatflag = 0;	1315	ewhatflag = 0;
1656	estartlen = 0;	1316	estartlen = 0;
1657	}	1317	}
1658		1318
1659	/* Init data to zero */
1660	memset (heads, 0, sizeof (object ) MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS);
1661
1662	/* x,y are the real map locations. ax, ay are viewport relative	1319	/* x,y are the real map locations. ax, ay are viewport relative
1663	* locations.	1320	* locations.
1664	*/	1321	*/
1665	ay = 0;	1322	ay = 0;
1666		1323
…		…
1668	* but that started to get a bit messy to look at.	1325	* but that started to get a bit messy to look at.
1669	*/	1326	*/
1670	max_x = pl->x + (socket.mapx + 1) / 2;	1327	max_x = pl->x + (socket.mapx + 1) / 2;
1671	max_y = pl->y + (socket.mapy + 1) / 2;	1328	max_y = pl->y + (socket.mapy + 1) / 2;
1672		1329
1673	if (socket.mapmode == Map1aCmd)
1674	{
1675	max_x += MAX_HEAD_OFFSET;
1676	max_y += MAX_HEAD_OFFSET;
1677	}
1678
1679	for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)	1330	for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1680	{	1331	{
1681	ax = 0;	1332	ax = 0;
1682	for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)	1333	for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1683	{	1334	{
1684		1335	int emask, mask;
1685	emask = mask = (ax & 0x3f) << 10 \| (ay & 0x3f) << 4;	1336	emask = mask = (ax & 0x3f) << 10 \| (ay & 0x3f) << 4;
1686		1337
1687	/* If this space is out of the normal viewable area, we only check
1688	* the heads value ax or ay will only be greater than what
1689	* the client wants if using the map1a command - this is because
1690	* if the map1a command is not used, max_x and max_y will be
1691	* set to lower values.
1692	*/
1693	if (ax >= socket.mapx \|\| ay >= socket.mapy)
1694	{
1695	int i, got_one;
1696
1697	oldlen = sl.length ();
1698
1699	sl << uint16 (mask);
1700
1701	if (check_head (sl, socket, ax, ay, 2)) mask \|= 0x4;
1702	if (check_head (sl, socket, ax, ay, 1)) mask \|= 0x2;
1703	if (check_head (sl, socket, ax, ay, 0)) mask \|= 0x1;
1704
1705	/* If all we are doing is sending 0 (blank) faces, we don't
1706	* actually need to send that - just the coordinates
1707	* with no faces tells the client to blank out the
1708	* space.
1709	*/
1710	got_one = 0;
1711	for (i = oldlen + 2; i < sl.length (); i++)
1712	if (sl[i])
1713	got_one = 1;
1714
1715	if (got_one && (mask & 0xf))
1716	sl[oldlen + 1] = mask & 0xff;
1717	else
1718	{ /either all faces blank, either no face at all /
1719	if (mask & 0xf) /at least 1 face, we know it's blank, only send coordinates /
1720	sl.reset (oldlen + 2);
1721	else
1722	sl.reset (oldlen);
1723	}
1724
1725	/*What concerns extendinfos, nothing to be done for now
1726	* (perhaps effects layer later)
1727	*/
1728	continue; /* don't do processing below */
1729	}
1730
1731	MapCell &lastcell = socket.lastmap.cells[ax][ay];	1338	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1732
1733	d = pl->contr->blocked_los[ax][ay];
1734		1339
1735	/* If the coordinates are not valid, or it is too dark to see,	1340	/* If the coordinates are not valid, or it is too dark to see,
1736	* we tell the client as such	1341	* we tell the client as such
1737	*/	1342	*/
1738	nx = x;	1343	nx = x;
…		…
1746	* of the map, it shouldn't have a head	1351	* of the map, it shouldn't have a head
1747	*/	1352	*/
1748	if (lastcell.count != -1)	1353	if (lastcell.count != -1)
1749	{	1354	{
1750	sl << uint16 (mask);	1355	sl << uint16 (mask);
1751	map_clearcell (&lastcell, 0, 0, 0, -1);	1356	map_clearcell (&lastcell, -1);
1752	}	1357	}
		1358
		1359	continue;
1753	}	1360	}
		1361
		1362	m->touch ();
		1363
		1364	int d = pl->contr->blocked_los[ax][ay];
		1365
1754	else if (d > 3)	1366	if (d > 3)
1755	{	1367	{
		1368
1756	int need_send = 0, count;	1369	int need_send = 0, count;
1757		1370
1758	/* This block deals with spaces that are not visible for whatever	1371	/* This block deals with spaces that are not visible for whatever
1759	* reason. Still may need to send the head for this space.	1372	* reason. Still may need to send the head for this space.
1760	*/	1373	*/
1761		1374
1762	oldlen = sl.length ();	1375	oldlen = sl.length ();
1763		1376
1764	sl << uint16 (mask);	1377	sl << uint16 (mask);
…		…
1766	if (lastcell.count != -1)	1379	if (lastcell.count != -1)
1767	need_send = 1;	1380	need_send = 1;
1768		1381
1769	count = -1;	1382	count = -1;
1770		1383
1771	if (socket.mapmode == Map1aCmd && have_head (ax, ay))
1772	{
1773	/* Now check to see if any heads need to be sent */
1774
1775	if (check_head (sl, socket, ax, ay, 2)) mask \|= 0x4;
1776	if (check_head (sl, socket, ax, ay, 1)) mask \|= 0x2;
1777	if (check_head (sl, socket, ax, ay, 0)) mask \|= 0x1;
1778
1779	lastcell.count = count;
1780	}
1781	else
1782	{
1783	/* properly clear a previously sent big face */	1384	/* properly clear a previously sent big face */
1784	if (lastcell.faces[0] != 0 \|\| lastcell.faces[1] != 0 \|\| lastcell.faces[2] != 0	1385	if (lastcell.faces[0] \|\| lastcell.faces[1] \|\| lastcell.faces[2]
1785	\|\| lastcell.stat_hp \|\| lastcell.flags \|\| lastcell.player)	1386	\|\| lastcell.stat_hp \|\| lastcell.flags \|\| lastcell.player)
1786	need_send = 1;	1387	need_send = 1;
1787		1388
1788	map_clearcell (&lastcell, 0, 0, 0, count);	1389	map_clearcell (&lastcell, count);
1789	}
1790		1390
1791	if ((mask & 0xf) \|\| need_send)	1391	if ((mask & 0xf) \|\| need_send)
1792	sl[oldlen + 1] = mask & 0xff;	1392	sl[oldlen + 1] = mask & 0xff;
1793	else	1393	else
1794	sl.reset (oldlen);	1394	sl.reset (oldlen);
1795	}	1395	}
1796	else	1396	else
1797	{	1397	{
1798	/* In this block, the space is visible or there are head objects	1398	/* In this block, the space is visible.
1799	* we need to send.
1800	*/	1399	*/
1801		1400
1802	/* Rather than try to figure out what everything that we might	1401	/* Rather than try to figure out what everything that we might
1803	* need to send is, then form the packet after that,	1402	* need to send is, then form the packet after that,
1804	* we presume that we will in fact form a packet, and update	1403	* we presume that we will in fact form a packet, and update
…		…
1807	* is done.	1406	* is done.
1808	* I think this is simpler than doing a bunch of checks to see	1407	* I think this is simpler than doing a bunch of checks to see
1809	* what if anything we need to send, setting the bits, then	1408	* what if anything we need to send, setting the bits, then
1810	* doing those checks again to add the real data.	1409	* doing those checks again to add the real data.
1811	*/	1410	*/
1812	oldlen = sl.length ();	1411	oldlen = sl.length ();
1813	mask = (ax & 0x3f) << 10 \| (ay & 0x3f) << 4;
1814	eoldlen = esl.length ();	1412	eoldlen = esl.length ();
1815	emask = (ax & 0x3f) << 10 \| (ay & 0x3f) << 4;	1413
1816	sl << uint16 (mask);	1414	sl << uint16 (mask);
1817		1415
1818	if (socket.ext_mapinfos)	1416	if (socket.ext_mapinfos)
1819	esl << uint16 (emask);	1417	esl << uint16 (emask);
1820		1418
…		…
1925	if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1))	1523	if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1))
1926	emask \|= 0x2;	1524	emask \|= 0x2;
1927		1525
1928	if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))	1526	if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
1929	{	1527	{
1930	if (lastcell.faces[0] != pl->face->number)	1528	if (lastcell.faces[0] != pl->face)
1931	{	1529	{
1932	lastcell.faces[0] = pl->face->number;	1530	lastcell.faces[0] = pl->face;
1933	mask \|= 0x1;	1531	mask \|= 0x1;
1934		1532
1935	if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE))	1533	socket.send_faces (pl);
1936	esrv_send_face (&socket, pl->face->number, 0);
1937		1534
1938	sl << uint16 (pl->face->number);	1535	sl << uint16 (pl->face);
1939	}	1536	}
1940	}	1537	}
1941	else	1538	else
1942	{	1539	{
1943	/* Top face */	1540	/* Top face */
…		…
1973	if (!(sl.length () > startlen \|\| socket.sent_scroll))	1570	if (!(sl.length () > startlen \|\| socket.sent_scroll))
1974	{	1571	{
1975	/* No map data will follow, so don't say the client	1572	/* No map data will follow, so don't say the client
1976	* it doesn't need draw!	1573	* it doesn't need draw!
1977	*/	1574	*/
1978	ewhatflag &= (~EMI_NOREDRAW);	1575	ewhatflag &= ~EMI_NOREDRAW;
1979	esl[ewhatstart + 1] = ewhatflag & 0xff;	1576	esl[ewhatstart + 1] = ewhatflag & 0xff;
1980	}	1577	}
1981		1578
1982	if (esl.length () > estartlen)	1579	if (esl.length () > estartlen)
1983	socket.send_packet (esl);	1580	socket.send_packet (esl);
…		…
1995	*/	1592	*/
1996	void	1593	void
1997	draw_client_map (object *pl)	1594	draw_client_map (object *pl)
1998	{	1595	{
1999	int i, j;	1596	int i, j;
2000	sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */	1597	sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
2001	New_Face face, floor;
2002	New_Face *floor2;
2003	int d, mflags;	1598	int mflags;
2004	struct Map newmap;	1599	struct Map newmap;
2005	maptile m, pm;	1600	maptile m, pm;
2006		1601
2007	if (pl->type != PLAYER)	1602	if (pl->type != PLAYER)
2008	{	1603	{
…		…
2019	if (pm == NULL \|\| pm->in_memory != MAP_IN_MEMORY)	1614	if (pm == NULL \|\| pm->in_memory != MAP_IN_MEMORY)
2020	return;	1615	return;
2021		1616
2022	memset (&newmap, 0, sizeof (struct Map));	1617	memset (&newmap, 0, sizeof (struct Map));
2023		1618
2024	for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++)	1619	for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)
2025	{
2026	for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++)	1620	for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)
2027	{	1621	{
2028	ax = i;	1622	ax = i;
2029	ay = j;	1623	ay = j;
2030	m = pm;	1624	m = pm;
2031	mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);	1625	mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2032		1626
2033	if (mflags & P_OUT_OF_MAP)	1627	if (mflags & P_OUT_OF_MAP)
2034	continue;	1628	continue;
2035		1629
2036	if (mflags & P_NEED_UPDATE)
2037	update_position (m, ax, ay);
2038
2039	/* If a map is visible to the player, we don't want to swap it out	1630	/* If a map is visible to the player, we don't want to swap it out
2040	* just to reload it. This should really call something like	1631	* just to reload it. This should really call something like
2041	* swap_map, but this is much more efficient and 'good enough'	1632	* swap_map, but this is much more efficient and 'good enough'
2042	*/	1633	*/
2043	if (mflags & P_NEW_MAP)	1634	if (mflags & P_NEW_MAP)
2044	m->timeout = 50;	1635	m->timeout = 50;
2045	}	1636	}
2046	}	1637
2047	/* do LOS after calls to update_position */	1638	/* do LOS after calls to update_position */
2048	if (pl->contr->do_los)	1639	if (pl->contr->do_los)
2049	{	1640	{
2050	update_los (pl);	1641	update_los (pl);
2051	pl->contr->do_los = 0;	1642	pl->contr->do_los = 0;
…		…
2066		1657
2067	/*****************************************************************************/	1658	/*****************************************************************************/
2068	void	1659	void
2069	send_plugin_custom_message (object pl, char buf)	1660	send_plugin_custom_message (object pl, char buf)
2070	{	1661	{
2071	pl->contr->socket->send_packet (buf);	1662	pl->contr->ns->send_packet (buf);
2072	}	1663	}
2073		1664
2074	/**	1665	/**
2075	* This sends the skill number to name mapping. We ignore	1666	* This sends the skill number to name mapping. We ignore
2076	* the params - we always send the same info no matter what.	1667	* the params - we always send the same info no matter what.
…		…
2121	* it then sends an updspell packet for each spell that has changed in this way	1712	* it then sends an updspell packet for each spell that has changed in this way
2122	*/	1713	*/
2123	void	1714	void
2124	esrv_update_spells (player *pl)	1715	esrv_update_spells (player *pl)
2125	{	1716	{
		1717	if (!pl->ns)
		1718	return;
		1719
2126	if (!pl->socket->monitor_spells)	1720	if (!pl->ns->monitor_spells)
2127	return;	1721	return;
2128		1722
2129	for (object *spell = pl->ob->inv; spell; spell = spell->below)	1723	for (object *spell = pl->ob->inv; spell; spell = spell->below)
2130	{	1724	{
2131	if (spell->type == SPELL)	1725	if (spell->type == SPELL)
…		…
2161		1755
2162	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);	1756	if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2163	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);	1757	if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2164	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);	1758	if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2165		1759
2166	pl->socket->send_packet (sl);	1760	pl->ns->send_packet (sl);
2167	}	1761	}
2168	}	1762	}
2169	}	1763	}
2170	}	1764	}
2171		1765
2172	void	1766	void
2173	esrv_remove_spell (player pl, object spell)	1767	esrv_remove_spell (player pl, object spell)
2174	{	1768	{
2175	if (!pl->socket->monitor_spells)	1769	if (!pl->ns->monitor_spells)
2176	return;	1770	return;
2177		1771
2178	if (!pl \|\| !spell \|\| spell->env != pl->ob)	1772	if (!pl \|\| !spell \|\| spell->env != pl->ob)
2179	{	1773	{
2180	LOG (llevError, "Invalid call to esrv_remove_spell");	1774	LOG (llevError, "Invalid call to esrv_remove_spell");
2181	return;	1775	return;
2182	}	1776	}
2183		1777
2184	packet sl;	1778	packet sl ("delspell");
2185		1779
2186	sl << "delspell "
2187	<< uint32 (spell->count);	1780	sl << uint32 (spell->count);
2188		1781
2189	pl->socket->send_packet (sl);	1782	pl->ns->send_packet (sl);
2190	}	1783	}
2191		1784
2192	/* appends the spell spell to the Socklist we will send the data to. /	1785	/* appends the spell spell to the Socklist we will send the data to. /
2193	static void	1786	static void
2194	append_spell (player pl, packet &sl, object spell)	1787	append_spell (player pl, packet &sl, object spell)
2195	{	1788	{
2196	int len, i, skill = 0;	1789	int i, skill = 0;
2197		1790
2198	if (!(spell->name))	1791	if (!(spell->name))
2199	{	1792	{
2200	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1793	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
2201	return;	1794	return;
…		…
2213	if (!strcmp (spell->skill, skill_names[i]))	1806	if (!strcmp (spell->skill, skill_names[i]))
2214	{	1807	{
2215	skill = i + CS_STAT_SKILLINFO;	1808	skill = i + CS_STAT_SKILLINFO;
2216	break;	1809	break;
2217	}	1810	}
		1811	}
		1812
		1813	// spells better have a face
		1814	if (!spell->face)
		1815	{
		1816	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
		1817	spell->face = face_find ("burnout.x11", blank_face);
2218	}	1818	}
2219		1819
2220	/* send the current values */	1820	/* send the current values */
2221	sl << uint32 (spell->count)	1821	sl << uint32 (spell->count)
2222	<< uint16 (spell->level)	1822	<< uint16 (spell->level)
…		…
2224	<< uint16 (spell->last_sp)	1824	<< uint16 (spell->last_sp)
2225	<< uint16 (spell->last_grace)	1825	<< uint16 (spell->last_grace)
2226	<< uint16 (spell->last_eat)	1826	<< uint16 (spell->last_eat)
2227	<< uint8 (skill)	1827	<< uint8 (skill)
2228	<< uint32 (spell->path_attuned)	1828	<< uint32 (spell->path_attuned)
2229	<< uint32 (spell->face ? spell->face->number : 0)	1829	<< uint32 (spell->face)
2230	<< data8 (spell->name)	1830	<< data8 (spell->name)
2231	<< data16 (spell->msg);	1831	<< data16 (spell->msg);
2232	}	1832	}
2233		1833
2234	/**	1834	/**
…		…
2242	{	1842	{
2243	LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");	1843	LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2244	return;	1844	return;
2245	}	1845	}
2246		1846
2247	if (!pl->socket->monitor_spells)	1847	if (!pl->ns->monitor_spells)
2248	return;	1848	return;
2249		1849
2250	packet sl;	1850	packet sl ("addspell");
2251	sl << "addspell ";
2252		1851
2253	if (!spell)	1852	if (!spell)
2254	{	1853	{
2255	for (spell = pl->ob->inv; spell != NULL; spell = spell->below)	1854	for (spell = pl->ob->inv; spell; spell = spell->below)
2256	{	1855	{
2257	/* were we to simply keep appending data here, we could exceed	1856	/* were we to simply keep appending data here, we could exceed
2258	* MAXSOCKBUF if the player has enough spells to add, we know that	1857	* MAXSOCKBUF if the player has enough spells to add, we know that
2259	* append_spells will always append 19 data bytes, plus 4 length	1858	* append_spells will always append 19 data bytes, plus 4 length
2260	* bytes and 3 strings (because that is the spec) so we need to	1859	* bytes and 3 strings (because that is the spec) so we need to
…		…
2270	if (spell->type != SPELL)	1869	if (spell->type != SPELL)
2271	continue;	1870	continue;
2272		1871
2273	if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))	1872	if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2274	{	1873	{
2275	pl->socket->send_packet (sl);	1874	pl->ns->send_packet (sl);
2276		1875
2277	sl.reset ();	1876	sl.reset ();
2278	sl << "addspell ";	1877	sl << "addspell ";
2279	}	1878	}
2280		1879
…		…
2294	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");	1893	LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2295	fatal (0);	1894	fatal (0);
2296	}	1895	}
2297		1896
2298	/* finally, we can send the packet */	1897	/* finally, we can send the packet */
2299	pl->socket->send_packet (sl);	1898	pl->ns->send_packet (sl);
2300	}	1899	}
2301		1900

Diff Legend

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

Comparing deliantra/server/socket/request.C (file contents): Revision 1.45 by root, Tue Dec 19 04:58:05 2006 UTC vs. Revision 1.74 by root, Wed Mar 14 01:19:10 2007 UTC

Diff Legend

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.45 by root, Tue Dec 19 04:58:05 2006 UTC vs.
Revision 1.74 by root, Wed Mar 14 01:19:10 2007 UTC