ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/socket/request.C

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.51 by root, Fri Dec 22 16:34:00 2006 UTC vs.
Revision 1.80 by root, Fri Mar 16 02:51:08 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.
…		…
140	static void	132	static void
141	clear_map (player *pl)	133	clear_map (player *pl)
142	{	134	{
143	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));	135	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
144		136
		137	pl->ns->force_newmap = false;
		138
145	if (pl->ns->newmapcmd == 1)	139	if (pl->ns->newmapcmd == 1)
146	pl->ns->send_packet ("newmap");	140	pl->ns->send_packet ("newmap");
147		141
148	pl->ns->floorbox_reset ();	142	pl->ns->floorbox_reset ();
149	}	143	}
150		144
151	/** check for map change and send new map data */	145	/** check for map/region change and send new map data */
152	static void	146	static void
153	check_map_change (player *pl)	147	check_map_change (player *pl)
154	{	148	{
155	client &socket = *pl->ns;	149	client &socket = *pl->ns;
156	object *ob = pl->ob;	150	object *ob = pl->ob;
157	char buf[MAX_BUF]; /* eauugggh */	151	char buf[MAX_BUF]; /* eauugggh */
158		152
159	if (socket.current_map != ob->map)	153	if (socket.force_newmap && 0)
160	{	154	{
		155	// force newmap is used for clients that do not redraw their map
		156	// after image uploads.
161	socket.current_map = ob->map;	157	socket.current_map = ob->map;
162
163	clear_map (pl);	158	clear_map (pl);
		159	}
		160	else if (socket.current_map != ob->map)
		161	{
		162	clear_map (pl);
		163	socket.current_map = ob->map;
164		164
165	if (socket.mapinfocmd)	165	if (socket.mapinfocmd)
166	{	166	{
167	if (ob->map && ob->map->path[0])	167	if (ob->map && ob->map->path[0])
168	{	168	{
…		…
176	flags |= 4;	176	flags |= 4;
177	if (ob->map->tile_path[3])	177	if (ob->map->tile_path[3])
178	flags |= 8;	178	flags |= 8;
179		179
180	snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",	180	snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
181	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path);	181	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
182	}	182	}
183	else	183	else
184	snprintf (buf, MAX_BUF, "mapinfo current");	184	snprintf (buf, MAX_BUF, "mapinfo current");
185		185
186	socket.send_packet (buf);	186	socket.send_packet (buf);
…		…
200	}	200	}
201	}	201	}
202		202
203	socket.current_x = ob->x;	203	socket.current_x = ob->x;
204	socket.current_y = ob->y;	204	socket.current_y = ob->y;
		205
		206	region *reg = ob->region ();
		207	if (socket.current_region != reg)
		208	{
		209	socket.current_region = reg;
		210	socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
		211	}
205	}	212	}
206		213
207	/**	214	/**
208	* RequestInfo is sort of a meta command. There is some specific	215	* RequestInfo is sort of a meta command. There is some specific
209	* request of information, but we call other functions to provide	216	* request of information, but we call other functions to provide
…		…
290	{	297	{
291	int dir = *buf++;	298	int dir = *buf++;
292		299
293	switch (dir)	300	switch (dir)
294	{	301	{
295	case '1':	302	case '1':
296	dx = 0;	303	dx = 0;
297	dy = -1;	304	dy = -1;
298	map = get_map_from_coord (map, &dx, &dy);	305	map = map->xy_find (dx, dy);
299	map && (mapy -= map->height);	306	map && (mapy -= map->height);
300	break;	307	break;
301	case '2':	308	case '2':
302	mapx += map->width;	309	mapx += map->width;
303	dx = map->width;	310	dx = map->width;
304	dy = 0;	311	dy = 0;
305	map = get_map_from_coord (map, &dx, &dy);	312	map = map->xy_find (dx, dy);
306	break;	313	break;
307	case '3':	314	case '3':
308	mapy += map->height;	315	mapy += map->height;
309	dx = 0;	316	dx = 0;
310	dy = map->height;	317	dy = map->height;
311	map = get_map_from_coord (map, &dx, &dy);	318	map = map->xy_find (dx, dy);
312	break;	319	break;
313	case '4':	320	case '4':
314	dx = -1;	321	dx = -1;
315	dy = 0;	322	dy = 0;
316	map = get_map_from_coord (map, &dx, &dy);	323	map = map->xy_find (dx, dy);
317	map && (mapx -= map->width);	324	map && (mapx -= map->width);
318	break;	325	break;
319	}	326	}
320		327
321	--max_distance;	328	--max_distance;
322	}	329	}
323		330
…		…
334	if (map->tile_path[2])	341	if (map->tile_path[2])
335	flags |= 4;	342	flags |= 4;
336	if (map->tile_path[3])	343	if (map->tile_path[3])
337	flags |= 8;	344	flags |= 8;
338		345
339	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, map->path);	346	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
340	}	347	}
341	else	348	else
342	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	349	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
343	}	350	}
344	else	351	else
…		…
399	{	406	{
400	ns->sound = atoi (param);	407	ns->sound = atoi (param);
401	safe_strcat (cmdback, param, &slen, HUGE_BUF);	408	safe_strcat (cmdback, param, &slen, HUGE_BUF);
402	}	409	}
403	else if (!strcmp (cmd, "exp64"))	410	else if (!strcmp (cmd, "exp64"))
404	{
405	ns->exp64 = atoi (param);
406	safe_strcat (cmdback, param, &slen, HUGE_BUF);	411	safe_strcat (cmdback, param, &slen, HUGE_BUF);
407	}
408	else if (!strcmp (cmd, "spellmon"))	412	else if (!strcmp (cmd, "spellmon"))
409	{	413	{
410	ns->monitor_spells = atoi (param);	414	ns->monitor_spells = atoi (param);
411	safe_strcat (cmdback, param, &slen, HUGE_BUF);	415	safe_strcat (cmdback, param, &slen, HUGE_BUF);
412	}	416	}
…		…
435	}	439	}
436	else if (!strcmp (cmd, "newmapcmd"))	440	else if (!strcmp (cmd, "newmapcmd"))
437	{	441	{
438	ns->newmapcmd = atoi (param);	442	ns->newmapcmd = atoi (param);
439	safe_strcat (cmdback, param, &slen, HUGE_BUF);	443	safe_strcat (cmdback, param, &slen, HUGE_BUF);
440	// } else if (!strcmp(cmd,"plugincmd")) {
441	// ns->plugincmd = atoi(param);
442	// safe_strcat(cmdback, param, &slen, HUGE_BUF);
443	}	444	}
444	else if (!strcmp (cmd, "mapinfocmd"))	445	else if (!strcmp (cmd, "mapinfocmd"))
445	{	446	{
446	ns->mapinfocmd = atoi (param);	447	ns->mapinfocmd = atoi (param);
447	safe_strcat (cmdback, "1", &slen, HUGE_BUF);	448	safe_strcat (cmdback, "1", &slen, HUGE_BUF);
…		…
466	char tmpbuf[20];	467	char tmpbuf[20];
467	int q = atoi (param);	468	int q = atoi (param);
468		469
469	if (is_valid_faceset (q))	470	if (is_valid_faceset (q))
470	ns->faceset = q;	471	ns->faceset = q;
		472
471	sprintf (tmpbuf, "%d", ns->faceset);	473	sprintf (tmpbuf, "%d", ns->faceset);
472	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);	474	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
473	/* if the client is using faceset, it knows about image2 command */	475	/* if the client is using faceset, it knows about image2 command */
474	ns->image2 = 1;	476	ns->image2 = 1;
475	}	477	}
…		…
503	if (*cp == 'x' || *cp == 'X')	505	if (*cp == 'x' || *cp == 'X')
504	{	506	{
505	y = atoi (cp + 1);	507	y = atoi (cp + 1);
506	break;	508	break;
507	}	509	}
		510
508	if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)	511	if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)
509	{	512	{
510	sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);	513	sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
511	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);	514	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
512	}	515	}
…		…
567	* This is what takes care of it. We tell the client how things worked out.	570	* This is what takes care of it. We tell the client how things worked out.
568	* I am not sure if this file is the best place for this function. however,	571	* I am not sure if this file is the best place for this function. however,
569	* it either has to be here or init_sockets needs to be exported.	572	* it either has to be here or init_sockets needs to be exported.
570	*/	573	*/
571	void	574	void
572	AddMeCmd (char *buf, int len, client * ns)	575	AddMeCmd (char *buf, int len, client *ns)
573	{	576	{
		577	// face caching is mandatory
		578	if (!ns->facecache)
		579	{
		580	ns->send_drawinfo (
		581	"\n"
		582	"\n"
		583	"***\n"
		584	"*** WARNING:\n"
		585	"*** Your client does not support face/image caching,\n"
		586	"*** or it has been disabled. Face caching is mandatory\n"
		587	"*** so please enable it or use a newer client.\n"
		588	"***\n"
		589	"*** Look at your client preferences:\n"
		590	"***\n"
		591	"*** CFPlus: all known versions automatically enable the facecache.\n"
		592	"*** cfclient: use the -cache commandline option.\n"
		593	"*** cfclient: map will not redraw automatically (bug).\n"
		594	"*** gcfclient: use -cache commandline option, or enable\n"
		595	"*** gcfclient: Client=>Configure=>Map & Image=>Cache Images.\n"
		596	"*** jcrossclient: your client is broken, use CFPlus or gcfclient.\n"
		597	"***\n"
		598	"***\n",
		599	NDI_RED
		600	);
		601
		602	if (strstr (ns->version, "jcrossclient"))
		603	/* let them, for now*/;
		604	else
		605	{
		606	ns->flush ();
		607	//ns->destroy ();
		608	}
		609	//ns->facecache = true;
		610	}
		611
574	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	612	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
575	}	613	}
576		614
577	/** Reply to ExtendedInfos command */	615	/** Reply to ExtendedInfos command */
578	void	616	void
…		…
689		727
690	ns->send_packet (cmdback);	728	ns->send_packet (cmdback);
691	}	729	}
692		730
693	/**	731	/**
694	* A lot like the old AskSmooth (in fact, now called by AskSmooth).	732	* client requested an image. send it rate-limited
695	* Basically, it makes no sense to wait for the client to request a	733	* before flushing.
696	* a piece of data from us that we know the client wants. So
697	* if we know the client wants it, might as well push it to the
698	* client.
699	*/
700	static void
701	SendSmooth (client *ns, uint16 face)
702	{
703	uint16 smoothface;
704
705	/* If we can't find a face, return and set it so we won't try to send this
706	* again.
707	*/	734	*/
708	if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface)))	735	void
709	{	736	AskFaceCmd (char *buf, int len, client *ns)
710		737	{
711	LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name);	738	ns->askface.push_back (atoi (buf));
712	ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
713	return;
714	}
715
716	if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
717	esrv_send_face (ns, smoothface, 0);
718
719	ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
720
721	packet sl ("smooth");
722
723	sl << uint16 (face)
724	<< uint16 (smoothface);
725
726	ns->send_packet (sl);
727	}	739	}
728		740
729	/**	741	/**
730	* Tells client the picture it has to use	742	* Tells client the picture it has to use
731	* to smooth a picture number given as argument.	743	* to smooth a picture number given as argument.
732	*/	744	*/
733	void	745	void
734	AskSmooth (char *buf, int len, client *ns)	746	AskSmooth (char *buf, int len, client *ns)
735	{	747	{
736	SendSmooth (ns, atoi (buf));	748	ns->send_face (atoi (buf));
737	}	749	}
738		750
739	/**	751	/**
740	* This handles the general commands from the client (ie, north, fire, cast,	752	* This handles the general commands from the client (ie, north, fire, cast,
741	* etc.)	753	* etc.)
…		…
800	* commands.	812	* commands.
801	*/	813	*/
802	pl->count = 0;	814	pl->count = 0;
803		815
804	//TODO: schmorp thinks whatever this calculates, it makes no sense at all	816	//TODO: schmorp thinks whatever this calculates, it makes no sense at all
805	int time = FABS (pl->ob->speed) < 0.001	817	int time = fabs (pl->ob->speed) < 0.001
806	? time = MAX_TIME * 100	818	? time = MAX_TIME * 100
807	: time = (int) (MAX_TIME / FABS (pl->ob->speed));	819	: time = (int) (MAX_TIME / fabs (pl->ob->speed));
808		820
809	/* Send confirmation of command execution now */	821	/* Send confirmation of command execution now */
810	packet sl ("comc");	822	packet sl ("comc");
811	sl << uint16 (cmdid) << uint32 (time);	823	sl << uint16 (cmdid) << uint32 (time);
812	pl->ns->send_packet (sl);	824	pl->ns->send_packet (sl);
…		…
848		860
849	case ST_CHANGE_CLASS:	861	case ST_CHANGE_CLASS:
850	key_change_class (pl->ob, buf[0]);	862	key_change_class (pl->ob, buf[0]);
851	break;	863	break;
852		864
853	case ST_CONFIRM_QUIT:
854	key_confirm_quit (pl->ob, buf[0]);
855	break;
856
857	case ST_GET_PARTY_PASSWORD: /* Get password for party */	865	case ST_GET_PARTY_PASSWORD: /* Get password for party */
858	receive_party_password (pl->ob, 13);	866	receive_party_password (pl->ob, 13);
859	break;	867	break;
860		868
861	default:	869	default:
…		…
882	ns->cs_version = atoi (buf);	890	ns->cs_version = atoi (buf);
883	ns->sc_version = ns->cs_version;	891	ns->sc_version = ns->cs_version;
884		892
885	LOG (llevDebug, "connection from client <%s>\n", buf);	893	LOG (llevDebug, "connection from client <%s>\n", buf);
886		894
887
888	//TODO: should log here just for statistics	895	//TODO: should log here just for statistics
889		896
890	//if (VERSION_CS != ns->cs_version)	897	//if (VERSION_CS != ns->cs_version)
891	// unchecked;	898	// unchecked;
892		899
…		…
917	{	924	{
918	ns->sound = atoi (buf);	925	ns->sound = atoi (buf);
919	}	926	}
920		927
921	/** client wants the map resent */	928	/** client wants the map resent */
922
923	void	929	void
924	MapRedrawCmd (char *buf, int len, player *pl)	930	MapRedrawCmd (char *buf, int len, player *pl)
925	{	931	{
926	/* This function is currently disabled; just clearing the map state results in	932	/* This function is currently disabled; just clearing the map state results in
927	* display errors. It should clear the cache and send a newmap command.	933	* display errors. It should clear the cache and send a newmap command.
…		…
1014	esrv_update_stats (player *pl)	1020	esrv_update_stats (player *pl)
1015	{	1021	{
1016	char buf[MAX_BUF];	1022	char buf[MAX_BUF];
1017	uint16 flags;	1023	uint16 flags;
1018		1024
		1025	client *ns = pl->ns;
		1026	if (!ns)
		1027	return;
		1028
		1029	object *ob = pl->ob;
		1030	if (!ob)
		1031	return;
		1032
1019	packet sl ("stats");	1033	packet sl ("stats");
1020		1034
1021	if (pl->ob)
1022	{
1023	AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);	1035	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1024	AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);	1036	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
1025	AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);	1037	AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP);
1026	AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);	1038	AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP);
1027	AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE);	1039	AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE);
1028	AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE);	1040	AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE);
1029	AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR);	1041	AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR);
1030	AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX);	1042	AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX);
1031	AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);	1043	AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON);
1032	AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);	1044	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
1033	AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);	1045	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
1034	AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);	1046	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
1035	AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);	1047	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1036	}
1037		1048
1038	if (pl->ns->exp64)
1039	for (int s = 0; s < NUM_SKILLS; s++)	1049	for (int s = 0; s < NUM_SKILLS; s++)
1040	if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)	1050	if (object *skill = pl->last_skill_ob[s])
		1051	if (skill->stats.exp != ns->last_skill_exp [s])
1041	{	1052	{
		1053	ns->last_skill_exp [s] = skill->stats.exp;
		1054
1042	/* Always send along the level if exp changes. This is only	1055	/* Always send along the level if exp changes. This is only
1043	* 1 extra byte, but keeps processing simpler.	1056	* 1 extra byte, but keeps processing simpler.
1044	*/	1057	*/
1045	sl << uint8 (s + CS_STAT_SKILLINFO)	1058	sl << uint8 (s + CS_STAT_SKILLINFO)
1046	<< uint8 (pl->last_skill_ob[s]->level)	1059	<< uint8 (skill->level)
1047	<< uint64 (pl->last_skill_ob[s]->stats.exp);	1060	<< uint64 (skill->stats.exp);
1048
1049	pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1050	}	1061	}
1051		1062
1052	if (pl->ns->exp64)
1053	{ AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }	1063	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1054	else
1055	{ AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1056
1057	AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);	1064	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1058	AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC);	1065	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1059	AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC);	1066	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1060	AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM);	1067	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1061	AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED);	1068	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);
1062	AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD);	1069	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1063	AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);	1070	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);
1064	AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM);	1071	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
		1072
1065	flags = 0;	1073	flags = 0;
1066		1074
1067	if (pl->fire_on)	1075	if (pl->fire_on)
1068	flags |= SF_FIREON;	1076	flags |= SF_FIREON;
1069		1077
1070	if (pl->run_on)	1078	if (pl->run_on)
1071	flags |= SF_RUNON;	1079	flags |= SF_RUNON;
1072		1080
1073	AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);	1081	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1074		1082
1075	if (pl->ns->sc_version < 1025)	1083	if (ns->sc_version < 1025)
1076	{ AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }	1084	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1077	else	1085	else
1078	for (int i = 0; i < NROFATTACKS; i++)	1086	for (int i = 0; i < NROFATTACKS; i++)
1079	{	1087	{
1080	/* Skip ones we won't send */	1088	/* Skip ones we won't send */
1081	if (atnr_cs_stat[i] == -1)	1089	if (atnr_cs_stat[i] == -1)
1082	continue;	1090	continue;
1083		1091
1084	AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);	1092	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
1085	}	1093	}
1086		1094
1087	if (pl->ns->monitor_spells)	1095	if (pl->ns->monitor_spells)
1088	{	1096	{
1089	AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);	1097	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1090	AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);	1098	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1091	AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY);	1099	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1092	}	1100	}
1093		1101
1094	rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */	1102	rangetostring (ob, buf); /* we want use the new fire & run system in new client */
1095	AddIfString (pl->ns->stats.range, buf, CS_STAT_RANGE);	1103	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1096	set_title (pl->ob, buf);	1104	set_title (ob, buf);
1097	AddIfString (pl->ns->stats.title, buf, CS_STAT_TITLE);	1105	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1098		1106
1099	/* Only send it away if we have some actual data */	1107	/* Only send it away if we have some actual data */
1100	if (sl.length () > 6)	1108	if (sl.length () > 6)
1101	pl->ns->send_packet (sl);	1109	ns->send_packet (sl);
1102	}	1110	}
1103		1111
1104	/**	1112	/**
1105	* Tells the client that here is a player it should start using.	1113	* Tells the client that here is a player it should start using.
1106	*/	1114	*/
1107	void	1115	void
1108	esrv_new_player (player *pl, uint32 weight)	1116	esrv_new_player (player *pl, uint32 weight)
1109	{	1117	{
1110	pl->last_weight = weight;
1111
1112	packet sl ("player");	1118	packet sl ("player");
1113		1119
1114	sl << uint32 (pl->ob->count)	1120	sl << uint32 (pl->ob->count)
1115	<< uint32 (weight)	1121	<< uint32 (weight)
1116	<< uint32 (pl->ob->face->number)	1122	<< uint32 (pl->ob->face)
1117	<< data8 (pl->ob->name);	1123	<< data8 (pl->ob->name);
1118		1124
		1125	pl->ns->last_weight = weight;
1119	pl->ns->send_packet (sl);	1126	pl->ns->send_packet (sl);
1120	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);	1127	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1121	}	1128	}
1122
1123	/**
1124	* Need to send an animation sequence to the client.
1125	* We will send appropriate face commands to the client if we haven't
1126	* sent them the face yet (this can become quite costly in terms of
1127	* how much we are sending - on the other hand, this should only happen
1128	* when the player logs in and picks stuff up.
1129	*/
1130	void
1131	esrv_send_animation (client * ns, short anim_num)
1132	{
1133	/* Do some checking on the anim_num we got. Note that the animations
1134	* are added in contigous order, so if the number is in the valid
1135	* range, it must be a valid animation.
1136	*/
1137	if (anim_num < 0 || anim_num > num_animations)
1138	{
1139	LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1140	return;
1141	}
1142
1143	packet sl ("anim");
1144
1145	sl << uint16 (anim_num)
1146	<< uint16 (0); /* flags - not used right now */
1147
1148	/* Build up the list of faces. Also, send any information (ie, the
1149	* the face itself) down to the client.
1150	*/
1151	for (int i = 0; i < animations[anim_num].num_animations; i++)
1152	{
1153	if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1154	esrv_send_face (ns, animations[anim_num].faces[i], 0);
1155
1156	sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1157	}
1158
1159	ns->send_packet (sl);
1160
1161	ns->anims_sent[anim_num] = 1;
1162	}
1163
1164		1129
1165	/******************************************************************************	1130	/******************************************************************************
1166	*	1131	*
1167	* Start of map related commands.	1132	* Start of map related commands.
1168	*	1133	*
1169	******************************************************************************/	1134	******************************************************************************/
1170		1135
1171	/**
1172	* This adds face_num to a map cell at x,y. If the client doesn't have
1173	* the face yet, we will also send it.
1174	*/
1175	static void
1176	esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1177	{
1178	if (newmap->cells[x][y].count >= MAP_LAYERS)
1179	{
1180	//TODO: one or the other, can't both have abort and return, verify and act
1181	LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1182	return;
1183	abort ();
1184	}
1185
1186	newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1187	newmap->cells[x][y].count++;
1188
1189	if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1190	esrv_send_face (ns, face_num, 0);
1191	}
1192
1193	/** Clears a map cell */	1136	/** Clears a map cell */
1194	static void	1137	static void
1195	map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)	1138	map_clearcell (struct MapCell *cell, int count)
1196	{	1139	{
1197	cell->faces[0] = face0;	1140	cell->faces[0] = 0;
1198	cell->faces[1] = face1;	1141	cell->faces[1] = 0;
1199	cell->faces[2] = face2;	1142	cell->faces[2] = 0;
		1143	cell->smooth[0] = 0;
		1144	cell->smooth[1] = 0;
		1145	cell->smooth[2] = 0;
1200	cell->count = count;	1146	cell->count = count;
1201	cell->stat_hp = 0;	1147	cell->stat_hp = 0;
1202	cell->flags = 0;	1148	cell->flags = 0;
1203	cell->player = 0;	1149	cell->player = 0;
1204	}	1150	}
1205		1151
1206	#define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y)
1207	#define MAX_LAYERS 3	1152	#define MAX_LAYERS 3
1208
1209	/* Using a global really isn't a good approach, but saves the over head of
1210	* allocating and deallocating such a block of data each time run through,
1211	* and saves the space of allocating this in the socket object when we only
1212	* need it for this cycle. If the server is ever threaded, this needs to be
1213	* re-examined.
1214	*/
1215	static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1216
1217	/**
1218	* Returns true if any of the heads for this
1219	* space is set. Returns false if all are blank - this is used
1220	* for empty space checking.
1221	*/
1222	static inline int
1223	have_head (int ax, int ay)
1224	{
1225	if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1226	heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1227	return 1;
1228
1229	return 0;
1230	}
1231
1232	/**
1233	* check_head is a bit simplistic version of update_space below.
1234	* basically, it only checks the that the head on space ax,ay at layer
1235	* needs to get sent - if so, it adds the data, sending the head
1236	* if needed, and returning 1. If this no data needs to get
1237	* sent, it returns zero.
1238	*/
1239	static int
1240	check_head (packet &sl, client &ns, int ax, int ay, int layer)
1241	{
1242	short face_num;
1243
1244	if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1245	face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1246	else
1247	face_num = 0;
1248
1249	if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1250	{
1251	sl << uint16 (face_num);
1252	if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1253	esrv_send_face (&ns, face_num, 0);
1254
1255	heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1256	ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1257	return 1;
1258	}
1259
1260	return 0; /* No change */
1261	}
1262		1153
1263	/**	1154	/**
1264	* Removes the need to replicate the same code for each layer.	1155	* Removes the need to replicate the same code for each layer.
1265	* this returns true if this space is now in fact different than	1156	* this returns true if this space is now in fact different than
1266	* it was.	1157	* it was.
1267	* sl is the socklist this data is going into.	1158	* sl is the socklist this data is going into.
1268	* ns is the socket we are working on - all the info we care	1159	* ns is the socket we are working on - all the info we care
1269	* about is in this socket structure, so now need not pass the	1160	* about is in this socket structure, so now need not pass the
1270	* entire player object.	1161	* entire player object.
1271	* mx and my are map coordinate offsets for map mp
1272	* sx and sy are the offsets into the socket structure that
1273	* holds the old values.
1274	* layer is the layer to update, with 2 being the floor and 0 the	1162	* layer is the layer to update, with 2 being the floor and 0 the
1275	* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)	1163	* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)
1276	* take. Interesting to note that before this function, the map1 function	1164	* take. Interesting to note that before this function, the map1 function
1277	* numbers the spaces differently - I think this was a leftover from	1165	* numbers the spaces differently - I think this was a leftover from
1278	* the map command, where the faces stack up. Sinces that is no longer	1166	* the map command, where the faces stack up. Sinces that is no longer
1279	* the case, it seems to make more sense to have these layer values	1167	* the case, it seems to make more sense to have these layer values
1280	* actually match.	1168	* actually match.
1281	*/	1169	*/
1282	static int	1170	static int
1283	update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)	1171	update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer)
1284	{	1172	{
1285	object *ob, *head;	1173	object *ob = ms.faces_obj [layer];
1286	uint16 face_num;
1287	int bx, by, i;
1288
1289	/* If there is a multipart object stored away, treat that as more important.
1290	* If not, then do the normal processing.
1291	*/
1292	head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1293
1294	/* Check to see if this head is part of the set of objects
1295	* we would normally send for this space. If so, then
1296	* don't use the head value. We need to do the check
1297	* here and not when setting up the heads[] value for two reasons -
1298	* 1) the heads[] values will get used even if the space is not visible.
1299	* 2) its possible the head is not on the same map as a part, and I'd
1300	* rather not need to do the map translation overhead.
1301	* 3) We need to do some extra checking to make sure that we will
1302	* otherwise send the image as this layer, eg, either it matches
1303	* the head value, or is not multipart.
1304	*/
1305	if (head && !head->more)
1306	{
1307	for (i = 0; i < MAP_LAYERS; i++)
1308	{
1309	ob = GET_MAP_FACE_OBJ (mp, mx, my, i);
1310	if (!ob)
1311	continue;
1312
1313	if (ob->head)
1314	ob = ob->head;
1315
1316	if (ob == head)
1317	{
1318	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL;
1319	head = NULL;
1320	break;
1321	}
1322	}
1323	}
1324
1325	ob = head;
1326	if (!ob)
1327	ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1328		1174
1329	/* If there is no object for this space, or if the face for the object	1175	/* If there is no object for this space, or if the face for the object
1330	* is the blank face, set the face number to zero.	1176	* is the blank face, set the face number to zero.
1331	* else if we have the stored head object for this space, that takes	1177	* else if we have the stored head object for this space, that takes
1332	* precedence over the other object for this space.	1178	* precedence over the other object for this space.
1333	* otherwise, we do special head processing	1179	* otherwise, we do special head processing
1334	*/	1180	*/
1335	if (!ob || ob->face == blank_face)	1181	uint16 face_num = ob && ob->face != blank_face ? ob->face : 0;
1336	face_num = 0;
1337	else if (head)
1338	{
1339	/* if this is a head that had previously been stored */
1340	face_num = ob->face->number;
1341	}
1342	else
1343	{
1344	/* if the faces for the different parts of a multipart object
1345	* are the same, we only want to send the bottom right most
1346	* portion of the object. That info is in the tail_.. values
1347	* of the head. Note that for the head itself, ob->head will
1348	* be null, so we only do this block if we are working on
1349	* a tail piece.
1350	*/
1351
1352	/* tail_x and tail_y will only be set in the head object. If
1353	* this is the head object and these are set, we proceed
1354	* with logic to only send bottom right. Similarly, if
1355	* this is one of the more parts but the head has those values
1356	* set, we want to do the processing. There can be cases where
1357	* the head is not visible but one of its parts is, so we just
1358	* can always expect that ob->arch->tail_x will be true for all
1359	* object we may want to display.
1360	*/
1361	if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y)))
1362	{
1363
1364	if (ob->head)
1365	head = ob->head;
1366	else
1367	head = ob;
1368
1369	/* Basically figure out where the offset is from where we are right
1370	* now. the ob->arch->clone.{x,y} values hold the offset that this current
1371	* piece is from the head, and the tail is where the tail is from the
1372	* head. Note that bx and by will equal sx and sy if we are already working
1373	* on the bottom right corner. If ob is the head, the clone values
1374	* will be zero, so the right thing will still happen.
1375	*/
1376	bx = sx + head->arch->tail_x - ob->arch->clone.x;
1377	by = sy + head->arch->tail_y - ob->arch->clone.y;
1378
1379	/* I don't think this can ever happen, but better to check for it just
1380	* in case.
1381	*/
1382	if (bx < sx || by < sy)
1383	{
1384	LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy);
1385	face_num = 0;
1386	}
1387	/* single part object, multipart object with non merged faces,
1388	* of multipart object already at lower right.
1389	*/
1390	else if (bx == sx && by == sy)
1391	{
1392	face_num = ob->face->number;
1393
1394	/* if this face matches one stored away, clear that one away.
1395	* this code relies on the fact that the map1 commands
1396	* goes from 2 down to 0.
1397	*/
1398	for (i = 0; i < MAP_LAYERS; i++)
1399	if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] &&
1400	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num)
1401	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL;
1402	}
1403	else
1404	{
1405	/* If this head is stored away, clear it - otherwise,
1406	* there can be cases where a object is on multiple layers -
1407	* we only want to send it once.
1408	*/
1409	face_num = head->face->number;
1410	for (i = 0; i < MAP_LAYERS; i++)
1411	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] &&
1412	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num)
1413	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL;
1414
1415	/* First, try to put the new head on the same layer. If that is used up,
1416	* then find another layer.
1417	*/
1418	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL)
1419	{
1420	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head;
1421	}
1422	else
1423	for (i = 0; i < MAX_LAYERS; i++)
1424	{
1425	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL ||
1426	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head)
1427	{
1428	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head;
1429	}
1430	}
1431	face_num = 0; /* Don't send this object - we'll send the head later */
1432	}
1433	}
1434	else
1435	{
1436	/* In this case, we are already at the lower right or single part object,
1437	* so nothing special
1438	*/
1439	face_num = ob->face->number;
1440
1441	/* clear out any head entries that have the same face as this one */
1442	for (bx = 0; bx < layer; bx++)
1443	if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] &&
1444	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num)
1445	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL;
1446	}
1447	} /* else not already head object or blank face */
1448
1449	/* This is a real hack. Basically, if we have nothing to send for this layer,
1450	* but there is a head on the next layer, send that instead.
1451	* Without this, what happens is you can get the case where the player stands
1452	* on the same space as the head. However, if you have overlapping big objects
1453	* of the same type, what happens then is it doesn't think it needs to send
1454	* This tends to make stacking also work/look better.
1455	*/
1456	if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1])
1457	{
1458	face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number;
1459	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL;
1460	}
1461
1462	/* Another hack - because of heads and whatnot, this face may match one
1463	* we already sent for a lower layer. In that case, don't send
1464	* this one.
1465	*/
1466	if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1467	face_num = 0;
1468		1182
1469	/* We've gotten what face we want to use for the object. Now see if	1183	/* We've gotten what face we want to use for the object. Now see if
1470	* if it has changed since we last sent it to the client.	1184	* if it has changed since we last sent it to the client.
1471	*/	1185	*/
1472	if (ns.lastmap.cells[sx][sy].faces[layer] != face_num)	1186	if (lastcell.faces[layer] != face_num)
1473	{	1187	{
1474	ns.lastmap.cells[sx][sy].faces[layer] = face_num;	1188	lastcell.faces[layer] = face_num;
		1189
1475	if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE))	1190	if (!ns.faces_sent[face_num])
		1191	if (ob)
		1192	ns.send_faces (ob);
		1193	else
1476	esrv_send_face (&ns, face_num, 0);	1194	ns.send_face (face_num);
1477		1195
1478	sl << uint16 (face_num);	1196	sl << uint16 (face_num);
1479	return 1;
1480	}
1481
1482	/* Nothing changed */
1483	return 0;
1484	}
1485
1486	/**
1487	* This function is mainly a copy of update_space,
1488	* except it handles update of the smoothing updates,
1489	* not the face updates.
1490	* Removes the need to replicate the same code for each layer.
1491	* this returns true if this smooth is now in fact different
1492	* than it was.
1493	* sl is the socklist this data is going into.
1494	* ns is the socket we are working on - all the info we care
1495	* about is in this socket structure, so know need to pass the
1496	* entire player object.
1497	* mx and my are map coordinate offsets for map mp
1498	* sx and sy are the offsets into the socket structure that
1499	* holds the old values.
1500	* layer is the layer to update, with 2 being the floor and 0 the
1501	* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1502	* take.
1503	*/
1504
1505	static inline int
1506	update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1507	{
1508	object *ob;
1509	int smoothlevel; /* old face_num; */
1510
1511	ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1512
1513	/* If there is no object for this space, or if the face for the object
1514	* is the blank face, set the smoothlevel to zero.
1515	*/
1516	if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp))
1517	smoothlevel = 0;
1518	else
1519	{
1520	smoothlevel = ob->smoothlevel;
1521	if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
1522	SendSmooth (&ns, ob->face->number);
1523	} /* else not already head object or blank face */
1524
1525	/* We've gotten what face we want to use for the object. Now see if
1526	* if it has changed since we last sent it to the client.
1527	*/
1528	if (smoothlevel > 255)
1529	smoothlevel = 255;
1530	else if (smoothlevel < 0)
1531	smoothlevel = 0;
1532
1533	if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel)
1534	{
1535	ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel;
1536	sl << uint8 (smoothlevel);
1537	return 1;	1197	return 1;
1538	}	1198	}
1539		1199
1540	/* Nothing changed */	1200	/* Nothing changed */
1541	return 0;	1201	return 0;
…		…
1556	if (ns->EMI_smooth)	1216	if (ns->EMI_smooth)
1557	result += 1; /*One byte for smoothlevel */	1217	result += 1; /*One byte for smoothlevel */
1558	}	1218	}
1559		1219
1560	return result;	1220	return result;
		1221	}
		1222
		1223	// prefetch (and touch) all maps within a specific distancd
		1224	static void
		1225	prefetch_surrounding_maps (maptile *map, int distance)
		1226	{
		1227	map->last_access = runtime;
		1228
		1229	if (--distance)
		1230	for (int dir = 4; --dir; )
		1231	if (const shstr &path = map->tile_path [dir])
		1232	if (maptile *&neigh = map->tile_map [dir])
		1233	prefetch_surrounding_maps (neigh, distance);
		1234	else
		1235	neigh = maptile::find_async (path, map);
		1236	}
		1237
		1238	// prefetch a generous area around the player
		1239	static void
		1240	prefetch_surrounding_maps (object *op)
		1241	{
		1242	prefetch_surrounding_maps (op->map, 3);
1561	}	1243	}
1562		1244
1563	/**	1245	/**
1564	* This function uses the new map1 protocol command to send the map	1246	* This function uses the new map1 protocol command to send the map
1565	* to the client. It is necessary because the old map command supports	1247	* to the client. It is necessary because the old map command supports
…		…
1583	* look like.	1265	* look like.
1584	*/	1266	*/
1585	void	1267	void
1586	draw_client_map1 (object *pl)	1268	draw_client_map1 (object *pl)
1587	{	1269	{
1588	int x, y, ax, ay, d, startlen, max_x, max_y, oldlen;	1270	int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1589	sint16 nx, ny;	1271	sint16 nx, ny;
1590	int estartlen, eoldlen;	1272	int estartlen, eoldlen;
1591	uint16 mask, emask;
1592	uint8 eentrysize;	1273	uint8 eentrysize;
1593	uint16 ewhatstart, ewhatflag;	1274	uint16 ewhatstart, ewhatflag;
1594	uint8 extendedinfos;	1275	uint8 extendedinfos;
1595	maptile *m;	1276	maptile *m;
1596		1277
1597	client &socket = *pl->contr->ns;	1278	client &socket = *pl->contr->ns;
1598		1279
		1280	if (!pl->active)
		1281	return;
		1282
1599	check_map_change (pl->contr);	1283	check_map_change (pl->contr);
		1284	prefetch_surrounding_maps (pl);
1600		1285
1601	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");	1286	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1602	packet esl;	1287	packet esl;
1603		1288
1604	startlen = sl.length ();	1289	startlen = sl.length ();
…		…
1619	<< uint8 (extendedinfos)	1304	<< uint8 (extendedinfos)
1620	<< uint8 (eentrysize);	1305	<< uint8 (eentrysize);
1621		1306
1622	estartlen = esl.length ();	1307	estartlen = esl.length ();
1623	}	1308	}
1624	else
1625	{
1626	/* suppress compiler warnings */
1627	ewhatstart = 0;
1628	ewhatflag = 0;
1629	estartlen = 0;
1630	}
1631
1632	/* Init data to zero */
1633	memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS);
1634		1309
1635	/* x,y are the real map locations. ax, ay are viewport relative	1310	/* x,y are the real map locations. ax, ay are viewport relative
1636	* locations.	1311	* locations.
1637	*/	1312	*/
1638	ay = 0;	1313	ay = 0;
…		…
1641	* but that started to get a bit messy to look at.	1316	* but that started to get a bit messy to look at.
1642	*/	1317	*/
1643	max_x = pl->x + (socket.mapx + 1) / 2;	1318	max_x = pl->x + (socket.mapx + 1) / 2;
1644	max_y = pl->y + (socket.mapy + 1) / 2;	1319	max_y = pl->y + (socket.mapy + 1) / 2;
1645		1320
1646	if (socket.mapmode == Map1aCmd)	1321	maptile *plmap = pl->map;
1647	{
1648	max_x += MAX_HEAD_OFFSET;
1649	max_y += MAX_HEAD_OFFSET;
1650	}
1651		1322
1652	for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)	1323	for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1653	{	1324	{
1654	ax = 0;	1325	ax = 0;
1655	for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)	1326	for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1656	{	1327	{
		1328	int emask, mask;
1657	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;	1329	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1658		1330
1659	/* If this space is out of the normal viewable area, we only check
1660	* the heads value ax or ay will only be greater than what
1661	* the client wants if using the map1a command - this is because
1662	* if the map1a command is not used, max_x and max_y will be
1663	* set to lower values.
1664	*/
1665	if (ax >= socket.mapx || ay >= socket.mapy)
1666	{
1667	int i, got_one;
1668
1669	oldlen = sl.length ();
1670
1671	sl << uint16 (mask);
1672
1673	if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1674	if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1675	if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1676
1677	/* If all we are doing is sending 0 (blank) faces, we don't
1678	* actually need to send that - just the coordinates
1679	* with no faces tells the client to blank out the
1680	* space.
1681	*/
1682	got_one = 0;
1683	for (i = oldlen + 2; i < sl.length (); i++)
1684	if (sl[i])
1685	got_one = 1;
1686
1687	if (got_one && (mask & 0xf))
1688	sl[oldlen + 1] = mask & 0xff;
1689	else
1690	{ /*either all faces blank, either no face at all */
1691	if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1692	sl.reset (oldlen + 2);
1693	else
1694	sl.reset (oldlen);
1695	}
1696
1697	/*What concerns extendinfos, nothing to be done for now
1698	* (perhaps effects layer later)
1699	*/
1700	continue; /* don't do processing below */
1701	}
1702
1703	MapCell &lastcell = socket.lastmap.cells[ax][ay];	1331	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1704
1705	d = pl->contr->blocked_los[ax][ay];
1706		1332
1707	/* If the coordinates are not valid, or it is too dark to see,	1333	/* If the coordinates are not valid, or it is too dark to see,
1708	* we tell the client as such	1334	* we tell the client as such
1709	*/	1335	*/
1710	nx = x;	1336	nx = x;
1711	ny = y;	1337	ny = y;
1712	m = get_map_from_coord (pl->map, &nx, &ny);	1338	m = get_map_from_coord (plmap, &nx, &ny);
1713		1339
1714	if (!m)	1340	if (!m)
1715	{	1341	{
1716	/* space is out of map. Update space and clear values	1342	/* space is out of map. Update space and clear values
1717	* if this hasn't already been done. If the space is out	1343	* if this hasn't already been done. If the space is out
1718	* of the map, it shouldn't have a head	1344	* of the map, it shouldn't have a head
1719	*/	1345	*/
1720	if (lastcell.count != -1)	1346	if (lastcell.count != -1)
1721	{	1347	{
1722	sl << uint16 (mask);	1348	sl << uint16 (mask);
1723	map_clearcell (&lastcell, 0, 0, 0, -1);	1349	map_clearcell (&lastcell, -1);
1724	}	1350	}
		1351
		1352	continue;
1725	}	1353	}
		1354
		1355	m->touch ();
		1356
		1357	int d = pl->contr->blocked_los[ax][ay];
		1358
1726	else if (d > 3)	1359	if (d > 3)
1727	{	1360	{
		1361
1728	int need_send = 0, count;	1362	int need_send = 0, count;
1729		1363
1730	/* This block deals with spaces that are not visible for whatever	1364	/* This block deals with spaces that are not visible for whatever
1731	* reason. Still may need to send the head for this space.	1365	* reason. Still may need to send the head for this space.
1732	*/	1366	*/
1733		1367
1734	oldlen = sl.length ();	1368	oldlen = sl.length ();
1735		1369
1736	sl << uint16 (mask);	1370	sl << uint16 (mask);
…		…
1738	if (lastcell.count != -1)	1372	if (lastcell.count != -1)
1739	need_send = 1;	1373	need_send = 1;
1740		1374
1741	count = -1;	1375	count = -1;
1742		1376
1743	if (socket.mapmode == Map1aCmd && have_head (ax, ay))
1744	{
1745	/* Now check to see if any heads need to be sent */
1746
1747	if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1748	if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1749	if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1750
1751	lastcell.count = count;
1752	}
1753	else
1754	{
1755	/* properly clear a previously sent big face */	1377	/* properly clear a previously sent big face */
1756	if (lastcell.faces[0] != 0 || lastcell.faces[1] != 0 || lastcell.faces[2] != 0	1378	if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1757	|| lastcell.stat_hp || lastcell.flags || lastcell.player)	1379	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1758	need_send = 1;	1380	need_send = 1;
1759		1381
1760	map_clearcell (&lastcell, 0, 0, 0, count);	1382	map_clearcell (&lastcell, count);
1761	}
1762		1383
1763	if ((mask & 0xf) || need_send)	1384	if ((mask & 0xf) || need_send)
1764	sl[oldlen + 1] = mask & 0xff;	1385	sl[oldlen + 1] = mask & 0xff;
1765	else	1386	else
1766	sl.reset (oldlen);	1387	sl.reset (oldlen);
1767	}	1388	}
1768	else	1389	else
1769	{	1390	{
1770	/* In this block, the space is visible or there are head objects	1391	/* In this block, the space is visible.
1771	* we need to send.
1772	*/	1392	*/
1773		1393
1774	/* Rather than try to figure out what everything that we might	1394	/* Rather than try to figure out what everything that we might
1775	* need to send is, then form the packet after that,	1395	* need to send is, then form the packet after that,
1776	* we presume that we will in fact form a packet, and update	1396	* we presume that we will in fact form a packet, and update
…		…
1779	* is done.	1399	* is done.
1780	* I think this is simpler than doing a bunch of checks to see	1400	* I think this is simpler than doing a bunch of checks to see
1781	* what if anything we need to send, setting the bits, then	1401	* what if anything we need to send, setting the bits, then
1782	* doing those checks again to add the real data.	1402	* doing those checks again to add the real data.
1783	*/	1403	*/
1784	oldlen = sl.length ();	1404	oldlen = sl.length ();
1785	mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1786	eoldlen = esl.length ();	1405	eoldlen = esl.length ();
1787	emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;	1406
1788	sl << uint16 (mask);	1407	sl << uint16 (mask);
1789
1790	if (socket.ext_mapinfos)
1791	esl << uint16 (emask);
1792		1408
1793	unsigned char dummy;	1409	unsigned char dummy;
1794	unsigned char *last_ext = &dummy;	1410	unsigned char *last_ext = &dummy;
1795		1411
1796	/* Darkness changed */	1412	/* Darkness changed */
…		…
1808	sl << uint8 (255 - 64 * d);	1424	sl << uint8 (255 - 64 * d);
1809	}	1425	}
1810		1426
1811	lastcell.count = d;	1427	lastcell.count = d;
1812		1428
		1429	mapspace &ms = m->at (nx, ny);
		1430
1813	if (socket.extmap)	1431	if (socket.extmap)
1814	{	1432	{
1815	uint8 stat_hp = 0;	1433	uint8 stat_hp = 0;
1816	uint8 stat_width = 0;	1434	uint8 stat_width = 0;
1817	uint8 flags = 0;	1435	uint8 flags = 0;
1818	UUID player = 0;	1436	UUID player = 0;
1819		1437
1820	// send hp information, if applicable	1438	// send hp information, if applicable
1821	if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0))	1439	if (object *op = ms.faces_obj [0])
1822	{	1440	{
1823	if (op->head || op->invisible)	1441	if (op->head || op->invisible)
1824	; // do not show	1442	; // do not show
1825	else if (op->type == PLAYER	1443	else if (op->type == PLAYER
1826	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))	1444	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
…		…
1880	sl << uint8 (8) << uint8 (flags);	1498	sl << uint8 (8) << uint8 (flags);
1881	}	1499	}
1882	}	1500	}
1883		1501
1884	/* Floor face */	1502	/* Floor face */
1885	if (update_space (sl, socket, m, nx, ny, ax, ay, 2))	1503	if (update_space (sl, socket, ms, lastcell, 2))
1886	mask |= 0x4;	1504	mask |= 0x4;
1887		1505
1888	if (socket.EMI_smooth)
1889	if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2))
1890	emask |= 0x4;
1891
1892	/* Middle face */	1506	/* Middle face */
1893	if (update_space (sl, socket, m, nx, ny, ax, ay, 1))	1507	if (update_space (sl, socket, ms, lastcell, 1))
1894	mask |= 0x2;	1508	mask |= 0x2;
1895		1509
1896	if (socket.EMI_smooth)	1510	if (ms.player () == pl
1897	if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1))	1511	&& (pl->invisible & (pl->invisible < 50 ? 1 : 7)))
1898	emask |= 0x2;
1899
1900	if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
1901	{	1512	{
		1513	// force player to be visible to himself if invisible
1902	if (lastcell.faces[0] != pl->face->number)	1514	if (lastcell.faces[0] != pl->face)
1903	{	1515	{
1904	lastcell.faces[0] = pl->face->number;	1516	lastcell.faces[0] = pl->face;
		1517
1905	mask |= 0x1;	1518	mask |= 0x1;
1906
1907	if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE))
1908	esrv_send_face (&socket, pl->face->number, 0);
1909
1910	sl << uint16 (pl->face->number);	1519	sl << uint16 (pl->face);
		1520
		1521	socket.send_faces (pl);
1911	}	1522	}
1912	}	1523	}
1913	else
1914	{
1915	/* Top face */	1524	/* Top face */
1916	if (update_space (sl, socket, m, nx, ny, ax, ay, 0))	1525	else if (update_space (sl, socket, ms, lastcell, 0))
1917	mask |= 0x1;	1526	mask |= 0x1;
1918
1919	if (socket.EMI_smooth)
1920	if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0))
1921	emask |= 0x1;
1922	}	1527
1923		1528
1924	/* Check to see if we are in fact sending anything for this	1529	/* Check to see if we are in fact sending anything for this
1925	* space by checking the mask. If so, update the mask.	1530	* space by checking the mask. If so, update the mask.
1926	* if not, reset the len to that from before adding the mask	1531	* if not, reset the len to that from before adding the mask
1927	* value, so we don't send those bits.	1532	* value, so we don't send those bits.
…		…
1929	if (mask & 0xf)	1534	if (mask & 0xf)
1930	sl[oldlen + 1] = mask & 0xff;	1535	sl[oldlen + 1] = mask & 0xff;
1931	else	1536	else
1932	sl.reset (oldlen);	1537	sl.reset (oldlen);
1933		1538
		1539	if (socket.ext_mapinfos)
		1540	esl << uint16 (emask);
		1541
		1542	if (socket.EMI_smooth)
		1543	{
		1544	for (int layer = 2+1; layer--; )
		1545	{
		1546	object *ob = ms.faces_obj [layer];
		1547
		1548	// If there is no object for this space, or if the face for the object
		1549	// is the blank face, set the smoothlevel to zero.
		1550	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
		1551
		1552	// We've gotten what face we want to use for the object. Now see if
		1553	// if it has changed since we last sent it to the client.
		1554	if (lastcell.smooth[layer] != smoothlevel)
		1555	{
		1556	lastcell.smooth[layer] = smoothlevel;
		1557	esl << uint8 (smoothlevel);
		1558	emask |= 1 << layer;
		1559	}
		1560	}
		1561
1934	if (emask & 0xf)	1562	if (emask & 0xf)
1935	esl[eoldlen + 1] = emask & 0xff;	1563	esl[eoldlen + 1] = emask & 0xff;
1936	else	1564	else
1937	esl.reset (eoldlen);	1565	esl.reset (eoldlen);
		1566	}
1938	} /* else this is a viewable space */	1567	} /* else this is a viewable space */
1939	} /* for x loop */	1568	} /* for x loop */
1940	} /* for y loop */	1569	} /* for y loop */
1941		1570
1942	/* Verify that we in fact do need to send this */	1571	/* Verify that we in fact do need to send this */
…		…
1945	if (!(sl.length () > startlen || socket.sent_scroll))	1574	if (!(sl.length () > startlen || socket.sent_scroll))
1946	{	1575	{
1947	/* No map data will follow, so don't say the client	1576	/* No map data will follow, so don't say the client
1948	* it doesn't need draw!	1577	* it doesn't need draw!
1949	*/	1578	*/
1950	ewhatflag &= (~EMI_NOREDRAW);	1579	ewhatflag &= ~EMI_NOREDRAW;
1951	esl[ewhatstart + 1] = ewhatflag & 0xff;	1580	esl[ewhatstart + 1] = ewhatflag & 0xff;
1952	}	1581	}
1953		1582
1954	if (esl.length () > estartlen)	1583	if (esl.length () > estartlen)
1955	socket.send_packet (esl);	1584	socket.send_packet (esl);
…		…
1967	*/	1596	*/
1968	void	1597	void
1969	draw_client_map (object *pl)	1598	draw_client_map (object *pl)
1970	{	1599	{
1971	int i, j;	1600	int i, j;
1972	sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */	1601	sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
1973	New_Face *face, *floor;
1974	New_Face *floor2;
1975	int d, mflags;	1602	int mflags;
1976	struct Map newmap;	1603	struct Map newmap;
1977	maptile *m, *pm;	1604	maptile *m, *pm;
1978		1605
1979	if (pl->type != PLAYER)	1606	if (pl->type != PLAYER)
1980	{	1607	{
…		…
2089	* it then sends an updspell packet for each spell that has changed in this way	1716	* it then sends an updspell packet for each spell that has changed in this way
2090	*/	1717	*/
2091	void	1718	void
2092	esrv_update_spells (player *pl)	1719	esrv_update_spells (player *pl)
2093	{	1720	{
		1721	if (!pl->ns)
		1722	return;
		1723
2094	if (!pl->ns->monitor_spells)	1724	if (!pl->ns->monitor_spells)
2095	return;	1725	return;
2096		1726
2097	for (object *spell = pl->ob->inv; spell; spell = spell->below)	1727	for (object *spell = pl->ob->inv; spell; spell = spell->below)
2098	{	1728	{
…		…
2158		1788
2159	/* appends the spell *spell to the Socklist we will send the data to. */	1789	/* appends the spell *spell to the Socklist we will send the data to. */
2160	static void	1790	static void
2161	append_spell (player *pl, packet &sl, object *spell)	1791	append_spell (player *pl, packet &sl, object *spell)
2162	{	1792	{
2163	int len, i, skill = 0;	1793	int i, skill = 0;
2164		1794
2165	if (!(spell->name))	1795	if (!(spell->name))
2166	{	1796	{
2167	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1797	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
2168	return;	1798	return;
…		…
2180	if (!strcmp (spell->skill, skill_names[i]))	1810	if (!strcmp (spell->skill, skill_names[i]))
2181	{	1811	{
2182	skill = i + CS_STAT_SKILLINFO;	1812	skill = i + CS_STAT_SKILLINFO;
2183	break;	1813	break;
2184	}	1814	}
		1815	}
		1816
		1817	// spells better have a face
		1818	if (!spell->face)
		1819	{
		1820	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
		1821	spell->face = face_find ("burnout.x11", blank_face);
2185	}	1822	}
2186		1823
2187	/* send the current values */	1824	/* send the current values */
2188	sl << uint32 (spell->count)	1825	sl << uint32 (spell->count)
2189	<< uint16 (spell->level)	1826	<< uint16 (spell->level)
…		…
2191	<< uint16 (spell->last_sp)	1828	<< uint16 (spell->last_sp)
2192	<< uint16 (spell->last_grace)	1829	<< uint16 (spell->last_grace)
2193	<< uint16 (spell->last_eat)	1830	<< uint16 (spell->last_eat)
2194	<< uint8 (skill)	1831	<< uint8 (skill)
2195	<< uint32 (spell->path_attuned)	1832	<< uint32 (spell->path_attuned)
2196	<< uint32 (spell->face ? spell->face->number : 0)	1833	<< uint32 (spell->face)
2197	<< data8 (spell->name)	1834	<< data8 (spell->name)
2198	<< data16 (spell->msg);	1835	<< data16 (spell->msg);
2199	}	1836	}
2200		1837
2201	/**	1838	/**
…		…
2216		1853
2217	packet sl ("addspell");	1854	packet sl ("addspell");
2218		1855
2219	if (!spell)	1856	if (!spell)
2220	{	1857	{
2221	for (spell = pl->ob->inv; spell != NULL; spell = spell->below)	1858	for (spell = pl->ob->inv; spell; spell = spell->below)
2222	{	1859	{
2223	/* were we to simply keep appending data here, we could exceed	1860	/* were we to simply keep appending data here, we could exceed
2224	* MAXSOCKBUF if the player has enough spells to add, we know that	1861	* MAXSOCKBUF if the player has enough spells to add, we know that
2225	* append_spells will always append 19 data bytes, plus 4 length	1862	* append_spells will always append 19 data bytes, plus 4 length
2226	* bytes and 3 strings (because that is the spec) so we need to	1863	* bytes and 3 strings (because that is the spec) so we need to

Diff Legend

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