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.59 by pippijn, Sat Jan 6 14:42:31 2007 UTC vs.
Revision 1.104 by root, Tue Jun 5 13:05:03 2007 UTC

1	/*	1	/*
2	CrossFire, A Multiplayer game for X-windows	2	* This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3		3	*
4	Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5	Copyright (C) 2001 Mark Wedel	5	* Copyright (©) 2001,2007 Mark Wedel
6	Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7		7	*
8	This program is free software; you can redistribute it and/or modify	8	* Crossfire TRT is free software; you can redistribute it and/or modify it
9	it under the terms of the GNU General Public License as published by	9	* under the terms of the GNU General Public License as published by the Free
10	the Free Software Foundation; either version 2 of the License, or	10	* Software Foundation; either version 2 of the License, or (at your option)
11	(at your option) any later version.	11	* any later version.
12		12	*
13	This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful, but
14	but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16	GNU General Public License for more details.	16	* for more details.
17		17	*
18	You should have received a copy of the GNU General Public License	18	* You should have received a copy of the GNU General Public License along
19	along with this program; if not, write to the Free Software	19	* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20	Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.	20	* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21		21	*
22	The author can be reached via e-mail to <crossfire@schmorp.de>	22	* The authors can be reached via e-mail to <crossfire@schmorp.de>
23	*/	23	*/
24		24
25	/**	25	/**
26	* \file	26	* \file
27	* Client handling.	27	* Client handling.
28	*	28	*
…		…
36	* 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
37	* way, we can use one dispatch table.	37	* way, we can use one dispatch table.
38	*	38	*
39	* esrv_map_new starts updating the map	39	* esrv_map_new starts updating the map
40	*	40	*
41	* esrv_map_setbelow allows filling in all of the faces for the map.
42	* if a face has not already been sent to the client, it is sent now.
43	*
44	*/	41	*/
45		42
46	#include <global.h>	43	#include <global.h>
47	#include <sproto.h>	44	#include <sproto.h>
48		45
…		…
101	* that much difference in bandwidth.	98	* that much difference in bandwidth.
102	*/	99	*/
103	mx = ns->mapx;	100	mx = ns->mapx;
104	my = ns->mapy;	101	my = ns->mapy;
105		102
106	if (ns->mapmode == Map1aCmd)
107	{
108	mx += MAX_HEAD_OFFSET;
109	my += MAX_HEAD_OFFSET;
110	}
111
112	/* 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
113	* (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,
114	* if the destination x or y coordinate is outside the viewable	105	* if the destination x or y coordinate is outside the viewable
115	* area, we clear the values - otherwise, the old values	106	* area, we clear the values - otherwise, the old values
116	* 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.
…		…
141	static void	132	static void
142	clear_map (player *pl)	133	clear_map (player *pl)
143	{	134	{
144	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));	135	memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
145		136
		137	pl->ns->force_newmap = false;
		138
146	if (pl->ns->newmapcmd == 1)	139	if (pl->ns->newmapcmd == 1)
147	pl->ns->send_packet ("newmap");	140	pl->ns->send_packet ("newmap");
148		141
149	pl->ns->floorbox_reset ();	142	pl->ns->floorbox_reset ();
150	}	143	}
151		144
152	/** check for map change and send new map data */	145	/** check for map/region change and send new map data */
153	static void	146	static void
154	check_map_change (player *pl)	147	check_map_change (player *pl)
155	{	148	{
156	client &socket = *pl->ns;	149	client &socket = *pl->ns;
157	object *ob = pl->ob;	150	object *ob = pl->observe;
158	char buf[MAX_BUF]; /* eauugggh */
159		151
160	if (socket.current_map != ob->map)	152	if (socket.current_map != ob->map || socket.force_newmap)
161	{	153	{
		154	clear_map (pl);
162	socket.current_map = ob->map;	155	socket.current_map = ob->map;
163
164	clear_map (pl);
165		156
166	if (socket.mapinfocmd)	157	if (socket.mapinfocmd)
167	{	158	{
168	if (ob->map && ob->map->path[0])	159	if (ob->map && ob->map->path[0])
169	{	160	{
170	int flags = 0;	161	int flags = 0;
171		162
172	if (ob->map->tile_path[0])	163	if (ob->map->tile_path[0]) flags |= 1;
173	flags |= 1;
174	if (ob->map->tile_path[1])	164	if (ob->map->tile_path[1]) flags |= 2;
175	flags |= 2;
176	if (ob->map->tile_path[2])	165	if (ob->map->tile_path[2]) flags |= 4;
177	flags |= 4;
178	if (ob->map->tile_path[3])	166	if (ob->map->tile_path[3]) flags |= 8;
179	flags |= 8;
180		167
181	snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",	168	socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s",
182	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);	169	flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y,
		170	ob->map->width, ob->map->height, &ob->map->path);
183	}	171	}
184	else	172	else
185	snprintf (buf, MAX_BUF, "mapinfo current");
186
187	socket.send_packet (buf);	173	socket.send_packet ("mapinfo current");
188	}	174	}
189	}	175	}
190	else if (socket.current_x != ob->x || socket.current_y != ob->y)	176	else if (socket.current_x != ob->x || socket.current_y != ob->y)
191	{	177	{
192	int dx = ob->x - socket.current_x;	178	int dx = ob->x - socket.current_x;
…		…
201	}	187	}
202	}	188	}
203		189
204	socket.current_x = ob->x;	190	socket.current_x = ob->x;
205	socket.current_y = ob->y;	191	socket.current_y = ob->y;
		192
		193	region *reg = ob->region ();
		194	if (socket.current_region != reg)
		195	{
		196	socket.current_region = reg;
		197	socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
		198	}
206	}	199	}
207		200
208	/**	201	/**
209	* RequestInfo is sort of a meta command. There is some specific	202	* RequestInfo is sort of a meta command. There is some specific
210	* request of information, but we call other functions to provide	203	* request of information, but we call other functions to provide
…		…
326	snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);	319	snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token);
327	else if (map && map->path[0])	320	else if (map && map->path[0])
328	{	321	{
329	int flags = 0;	322	int flags = 0;
330		323
331	if (map->tile_path[0])	324	if (map->tile_path[0]) flags |= 1;
332	flags |= 1;
333	if (map->tile_path[1])	325	if (map->tile_path[1]) flags |= 2;
334	flags |= 2;
335	if (map->tile_path[2])	326	if (map->tile_path[2]) flags |= 4;
336	flags |= 4;
337	if (map->tile_path[3])	327	if (map->tile_path[3]) flags |= 8;
338	flags |= 8;
339		328
340	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);	329	snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
341	}	330	}
342	else	331	else
343	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);	332	snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
…		…
346	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);	335	snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
347		336
348	pl->ns->send_packet (bigbuf);	337	pl->ns->send_packet (bigbuf);
349	}	338	}
350		339
351	/** This is the Setup cmd - easy first implementation */	340	/** This is the Setup cmd */
352	void	341	void
353	SetUp (char *buf, int len, client * ns)	342	SetUp (char *buf, int len, client * ns)
354	{	343	{
355	int s, slen;	344	INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len));
356	char *cmd, *param, cmdback[HUGE_BUF];
357
358	/* run through the cmds of setup
359	* syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ...
360	*
361	* we send the status of the cmd back, or a FALSE is the cmd is the server unknown
362	* The client then must sort this out
363	*/
364
365	//LOG (llevInfo, "Get SetupCmd:: %s\n", buf);
366
367	strcpy (cmdback, "setup");
368	for (s = 0; s < len; )
369	{
370	cmd = &buf[s];
371
372	/* find the next space, and put a null there */
373	for (; buf[s] && buf[s] != ' '; s++)
374	;
375
376	buf[s++] = 0;
377
378	while (buf[s] == ' ')
379	s++;
380
381	if (s >= len)
382	break;
383
384	param = &buf[s];
385
386	for (; buf[s] && buf[s] != ' '; s++)
387	;
388
389	buf[s++] = 0;
390
391	while (buf[s] == ' ')
392	s++;
393
394	slen = strlen (cmdback);
395	safe_strcat (cmdback, " ", &slen, HUGE_BUF);
396	safe_strcat (cmdback, cmd, &slen, HUGE_BUF);
397	safe_strcat (cmdback, " ", &slen, HUGE_BUF);
398
399	if (!strcmp (cmd, "sound"))
400	{
401	ns->sound = atoi (param);
402	safe_strcat (cmdback, param, &slen, HUGE_BUF);
403	}
404	else if (!strcmp (cmd, "exp64"))
405	safe_strcat (cmdback, param, &slen, HUGE_BUF);
406	else if (!strcmp (cmd, "spellmon"))
407	{
408	ns->monitor_spells = atoi (param);
409	safe_strcat (cmdback, param, &slen, HUGE_BUF);
410	}
411	else if (!strcmp (cmd, "darkness"))
412	{
413	ns->darkness = atoi (param);
414	safe_strcat (cmdback, param, &slen, HUGE_BUF);
415	}
416	else if (!strcmp (cmd, "map1cmd"))
417	{
418	if (atoi (param))
419	ns->mapmode = Map1Cmd;
420	/* if beyond this size, need to use map1cmd no matter what */
421	if (ns->mapx > 11 || ns->mapy > 11)
422	ns->mapmode = Map1Cmd;
423	safe_strcat (cmdback, ns->mapmode == Map1Cmd ? "1" : "0", &slen, HUGE_BUF);
424	}
425	else if (!strcmp (cmd, "map1acmd"))
426	{
427	if (atoi (param))
428	ns->mapmode = Map1aCmd;
429	/* if beyond this size, need to use map1acmd no matter what */
430	if (ns->mapx > 11 || ns->mapy > 11)
431	ns->mapmode = Map1aCmd;
432	safe_strcat (cmdback, ns->mapmode == Map1aCmd ? "1" : "0", &slen, HUGE_BUF);
433	}
434	else if (!strcmp (cmd, "newmapcmd"))
435	{
436	ns->newmapcmd = atoi (param);
437	safe_strcat (cmdback, param, &slen, HUGE_BUF);
438	// } else if (!strcmp(cmd,"plugincmd")) {
439	// ns->plugincmd = atoi(param);
440	// safe_strcat(cmdback, param, &slen, HUGE_BUF);
441	}
442	else if (!strcmp (cmd, "mapinfocmd"))
443	{
444	ns->mapinfocmd = atoi (param);
445	safe_strcat (cmdback, "1", &slen, HUGE_BUF);
446	}
447	else if (!strcmp (cmd, "extcmd"))
448	{
449	ns->extcmd = atoi (param);
450	safe_strcat (cmdback, "1", &slen, HUGE_BUF);
451	}
452	else if (!strcmp (cmd, "extmap"))
453	{
454	ns->extmap = atoi (param);
455	safe_strcat (cmdback, "1", &slen, HUGE_BUF);
456	}
457	else if (!strcmp (cmd, "facecache"))
458	{
459	ns->facecache = atoi (param);
460	safe_strcat (cmdback, param, &slen, HUGE_BUF);
461	}
462	else if (!strcmp (cmd, "faceset"))
463	{
464	char tmpbuf[20];
465	int q = atoi (param);
466
467	if (is_valid_faceset (q))
468	ns->faceset = q;
469	sprintf (tmpbuf, "%d", ns->faceset);
470	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
471	/* if the client is using faceset, it knows about image2 command */
472	ns->image2 = 1;
473	}
474	else if (!strcmp (cmd, "itemcmd"))
475	{
476	/* Version of the item protocol command to use. Currently,
477	* only supported versions are 1 and 2. Using a numeric
478	* value will make it very easy to extend this in the future.
479	*/
480	char tmpbuf[20];
481	int q = atoi (param);
482
483	if (q < 1 || q > 2)
484	{
485	strcpy (tmpbuf, "FALSE");
486	}
487	else
488	{
489	ns->itemcmd = q;
490	sprintf (tmpbuf, "%d", ns->itemcmd);
491	}
492	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
493	}
494	else if (!strcmp (cmd, "mapsize"))
495	{
496	int x, y = 0;
497	char tmpbuf[MAX_BUF], *cp;
498
499	x = atoi (param);
500	for (cp = param; *cp != 0; cp++)
501	if (*cp == 'x' || *cp == 'X')
502	{
503	y = atoi (cp + 1);
504	break;
505	}
506	if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)
507	{
508	sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
509	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
510	}
511	else
512	{
513	ns->mapx = x;
514	ns->mapy = y;
515	/* better to send back what we are really using and not the
516	* param as given to us in case it gets parsed differently.
517	*/
518	sprintf (tmpbuf, "%dx%d", x, y);
519	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
520	/* If beyond this size and still using orig map command, need to
521	* go to map1cmd.
522	*/
523	if ((x > 11 || y > 11) && ns->mapmode == Map0Cmd)
524	ns->mapmode = Map1Cmd;
525	}
526	}
527	else if (!strcmp (cmd, "extendedMapInfos"))
528	{
529	/* Added by tchize
530	* prepare to use the mapextended command
531	*/
532	char tmpbuf[20];
533
534	ns->ext_mapinfos = (atoi (param));
535	sprintf (tmpbuf, "%d", ns->ext_mapinfos);
536	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
537	}
538	else if (!strcmp (cmd, "extendedTextInfos"))
539	{
540	/* Added by tchize
541	* prepare to use the extended text commands
542	* Client toggle this to non zero to get exttext
543	*/
544	char tmpbuf[20];
545
546	ns->has_readable_type = (atoi (param));
547	sprintf (tmpbuf, "%d", ns->has_readable_type);
548	safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
549	}
550	else
551	{
552	/* Didn't get a setup command we understood -
553	* report a failure to the client.
554	*/
555	safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF);
556	}
557	} /* for processing all the setup commands */
558
559	LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback);
560	ns->send_packet (cmdback);
561	}	345	}
562		346
563	/**	347	/**
564	* The client has requested to be added to the game.	348	* The client has requested to be added to the game.
565	* This is what takes care of it. We tell the client how things worked out.	349	* This is what takes care of it. We tell the client how things worked out.
566	* I am not sure if this file is the best place for this function. however,	350	* I am not sure if this file is the best place for this function. however,
567	* it either has to be here or init_sockets needs to be exported.	351	* it either has to be here or init_sockets needs to be exported.
568	*/	352	*/
569	void	353	void
570	AddMeCmd (char *buf, int len, client * ns)	354	AddMeCmd (char *buf, int len, client *ns)
571	{	355	{
572	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));	356	INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
573	}	357	}
574		358
575	/** Reply to ExtendedInfos command */	359	/** Reply to ExtendedInfos command */
…		…
687		471
688	ns->send_packet (cmdback);	472	ns->send_packet (cmdback);
689	}	473	}
690		474
691	/**	475	/**
692	* A lot like the old AskSmooth (in fact, now called by AskSmooth).	476	* client requested an image. send it rate-limited
693	* Basically, it makes no sense to wait for the client to request a	477	* before flushing.
694	* a piece of data from us that we know the client wants. So
695	* if we know the client wants it, might as well push it to the
696	* client.
697	*/
698	static void
699	SendSmooth (client *ns, uint16 face)
700	{
701	uint16 smoothface;
702
703	/* If we can't find a face, return and set it so we won't try to send this
704	* again.
705	*/	478	*/
706	if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface)))	479	void
707	{	480	AskFaceCmd (char *buf, int len, client *ns)
708		481	{
709	LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name);	482	ns->askface.push_back (atoi (buf));
710	ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
711	return;
712	}
713
714	if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
715	esrv_send_face (ns, smoothface, 0);
716
717	ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
718
719	packet sl ("smooth");
720
721	sl << uint16 (face)
722	<< uint16 (smoothface);
723
724	ns->send_packet (sl);
725	}	483	}
726		484
727	/**	485	/**
728	* Tells client the picture it has to use	486	* Tells client the picture it has to use
729	* to smooth a picture number given as argument.	487	* to smooth a picture number given as argument.
730	*/	488	*/
731	void	489	void
732	AskSmooth (char *buf, int len, client *ns)	490	AskSmooth (char *buf, int len, client *ns)
733	{	491	{
734	SendSmooth (ns, atoi (buf));	492	ns->send_face (atoi (buf));
		493	ns->flush_fx ();
735	}	494	}
736		495
737	/**	496	/**
738	* This handles the general commands from the client (ie, north, fire, cast,	497	* This handles the general commands from the client (ie, north, fire, cast,
739	* etc.)	498	* etc.)
…		…
763	* commands.	522	* commands.
764	*/	523	*/
765	pl->count = 0;	524	pl->count = 0;
766	}	525	}
767		526
768
769	/**	527	/**
770	* This handles the general commands from the client (ie, north, fire, cast,	528	* This handles the general commands from the client (ie, north, fire, cast,
771	* etc.). It is a lot like PlayerCmd above, but is called with the	529	* etc.). It is a lot like PlayerCmd above, but is called with the
772	* 'ncom' method which gives more information back to the client so it	530	* 'ncom' method which gives more information back to the client so it
773	* can throttle.	531	* can throttle.
…		…
798	* commands.	556	* commands.
799	*/	557	*/
800	pl->count = 0;	558	pl->count = 0;
801		559
802	//TODO: schmorp thinks whatever this calculates, it makes no sense at all	560	//TODO: schmorp thinks whatever this calculates, it makes no sense at all
803	int time = FABS (pl->ob->speed) < 0.001	561	int time = fabs (pl->ob->speed) < 0.001
804	? time = MAX_TIME * 100	562	? time = MAX_TIME * 100
805	: time = (int) (MAX_TIME / FABS (pl->ob->speed));	563	: time = (int) (MAX_TIME / fabs (pl->ob->speed));
806		564
807	/* Send confirmation of command execution now */	565	/* Send confirmation of command execution now */
808	packet sl ("comc");	566	packet sl ("comc");
809	sl << uint16 (cmdid) << uint32 (time);	567	sl << uint16 (cmdid) << uint32 (time);
810	pl->ns->send_packet (sl);	568	pl->ns->send_packet (sl);
…		…
842	{	600	{
843	case ST_PLAYING:	601	case ST_PLAYING:
844	LOG (llevError, "Got reply message with ST_PLAYING input state\n");	602	LOG (llevError, "Got reply message with ST_PLAYING input state\n");
845	break;	603	break;
846		604
847	case ST_CHANGE_CLASS:
848	key_change_class (pl->ob, buf[0]);
849	break;
850
851	case ST_CONFIRM_QUIT:
852	key_confirm_quit (pl->ob, buf[0]);
853	break;
854
855	case ST_GET_PARTY_PASSWORD: /* Get password for party */	605	case ST_GET_PARTY_PASSWORD: /* Get password for party */
856	receive_party_password (pl->ob, 13);	606	receive_party_password (pl->ob, 13);
857	break;	607	break;
858		608
859	default:	609	default:
…		…
880	ns->cs_version = atoi (buf);	630	ns->cs_version = atoi (buf);
881	ns->sc_version = ns->cs_version;	631	ns->sc_version = ns->cs_version;
882		632
883	LOG (llevDebug, "connection from client <%s>\n", buf);	633	LOG (llevDebug, "connection from client <%s>\n", buf);
884		634
885
886	//TODO: should log here just for statistics	635	//TODO: should log here just for statistics
887		636
888	//if (VERSION_CS != ns->cs_version)	637	//if (VERSION_CS != ns->cs_version)
889	// unchecked;	638	// unchecked;
890		639
…		…
899		648
900	cp = strchr (cp + 1, ' ');	649	cp = strchr (cp + 1, ' ');
901		650
902	if (cp)	651	if (cp)
903	{	652	{
904	assign (ns->version, cp + 1);	653	ns->version = cp + 1;
905		654
906	if (ns->sc_version < 1026)	655	if (ns->sc_version < 1026)
907	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,	656	ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
908	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");	657	"**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
909	}	658	}
…		…
969	/**	718	/**
970	* Asks the client to query the user. This way, the client knows	719	* Asks the client to query the user. This way, the client knows
971	* it needs to send something back (vs just printing out a message)	720	* it needs to send something back (vs just printing out a message)
972	*/	721	*/
973	void	722	void
974	send_query (client *ns, uint8 flags, char *text)	723	send_query (client *ns, uint8 flags, const char *text)
975	{	724	{
976	ns->send_packet_printf ("query %d %s", flags, text ? text : "");	725	ns->send_packet_printf ("query %d %s", flags, text ? text : "");
		726	}
		727
		728	/**
		729	* Get player's current range attack in obuf.
		730	*/
		731	static void
		732	rangetostring (player *pl, char *obuf)
		733	{
		734	dynbuf_text buf;
		735
		736	if (pl->ranged_ob)
		737	buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name;
		738
		739	if (pl->combat_ob)
		740	buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name;
		741
		742	#if 0
		743	//TODO: remove this when slot system is working, this is only for debugging
		744	if (pl->ob->chosen_skill)
		745	buf << " Skill*: " << pl->ob->chosen_skill->name;
		746	#endif
		747
		748	//TODO: maybe golem should become the current_weapon, quite simply?
		749	if (pl->golem)
		750	buf << " Golem*: " << pl->golem->name;
		751
		752	buf.linearise (obuf);
		753	obuf [buf.size ()] = 0;
977	}	754	}
978		755
979	#define AddIfInt64(Old,New,Type) if (Old != New) {\	756	#define AddIfInt64(Old,New,Type) if (Old != New) {\
980	Old = New; \	757	Old = New; \
981	sl << uint8 (Type) << uint64 (New); \	758	sl << uint8 (Type) << uint64 (New); \
…		…
989	#define AddIfShort(Old,New,Type) if (Old != New) {\	766	#define AddIfShort(Old,New,Type) if (Old != New) {\
990	Old = New; \	767	Old = New; \
991	sl << uint8 (Type) << uint16 (New); \	768	sl << uint8 (Type) << uint16 (New); \
992	}	769	}
993		770
994	#define AddIfFloat(Old,New,Type) if (Old != New) {\	771	#define AddIfFloat(Old,New,Type,mult) if (Old != New) {\
995	Old = New; \	772	Old = New; \
996	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \	773	sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \
997	}	774	}
998		775
999	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\	776	#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
1000	free(Old); Old = strdup (New);\	777	free(Old); Old = strdup (New);\
1001	sl << uint8 (Type) << data8 (New); \	778	sl << uint8 (Type) << data8 (New); \
…		…
1011	esrv_update_stats (player *pl)	788	esrv_update_stats (player *pl)
1012	{	789	{
1013	char buf[MAX_BUF];	790	char buf[MAX_BUF];
1014	uint16 flags;	791	uint16 flags;
1015		792
		793	client *ns = pl->ns;
1016	if (!pl->ns)	794	if (!ns)
1017	return;	795	return;
1018		796
		797	object *ob = pl->observe;
		798	if (!ob)
		799	return;
		800
1019	packet sl ("stats");	801	packet sl ("stats");
1020		802
1021	if (pl->ob)
1022	{
1023	AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);	803	AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1024	AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);	804	AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
1025	AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);	805	AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP);
1026	AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);	806	AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP);
1027	AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE);	807	AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE);
1028	AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE);	808	AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE);
1029	AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR);	809	AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR);
1030	AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX);	810	AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX);
1031	AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);	811	AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON);
1032	AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);	812	AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
1033	AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);	813	AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
1034	AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);	814	AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
1035	AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);	815	AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1036	}
1037		816
1038	for (int s = 0; s < NUM_SKILLS; s++)	817	for (int s = 0; s < NUM_SKILLS; s++)
1039	if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)	818	if (object *skill = pl->last_skill_ob[s])
		819	if (skill->stats.exp != ns->last_skill_exp [s])
1040	{	820	{
		821	ns->last_skill_exp [s] = skill->stats.exp;
		822
1041	/* Always send along the level if exp changes. This is only	823	/* Always send along the level if exp changes. This is only
1042	* 1 extra byte, but keeps processing simpler.	824	* 1 extra byte, but keeps processing simpler.
1043	*/	825	*/
1044	sl << uint8 (s + CS_STAT_SKILLINFO)	826	sl << uint8 (s + CS_STAT_SKILLINFO)
1045	<< uint8 (pl->last_skill_ob[s]->level)	827	<< uint8 (skill->level)
1046	<< uint64 (pl->last_skill_ob[s]->stats.exp);	828	<< uint64 (skill->stats.exp);
1047
1048	pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1049	}	829	}
1050		830
1051	AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64);	831	AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1052	AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);	832	AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1053	AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC);	833	AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1054	AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC);	834	AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1055	AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM);	835	AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1056	AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED);	836	AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK);
1057	AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD);	837	AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1058	AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);	838	AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK);
1059	AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM);	839	AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
		840
1060	flags = 0;	841	flags = 0;
1061		842
1062	if (pl->fire_on)	843	if (pl->fire_on)
1063	flags |= SF_FIREON;	844	flags |= SF_FIREON;
1064		845
1065	if (pl->run_on)	846	if (pl->run_on)
1066	flags |= SF_RUNON;	847	flags |= SF_RUNON;
1067		848
1068	AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);	849	AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1069		850
1070	if (pl->ns->sc_version < 1025)	851	if (ns->sc_version < 1025)
1071	{ AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }	852	{ AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1072	else	853	else
1073	for (int i = 0; i < NROFATTACKS; i++)	854	for (int i = 0; i < NROFATTACKS; i++)
1074	{	855	{
1075	/* Skip ones we won't send */	856	/* Skip ones we won't send */
1076	if (atnr_cs_stat[i] == -1)	857	if (atnr_cs_stat[i] == -1)
1077	continue;	858	continue;
1078		859
1079	AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);	860	AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
1080	}	861	}
1081		862
1082	if (pl->ns->monitor_spells)	863	if (pl->ns->monitor_spells)
1083	{	864	{
1084	AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);	865	AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1085	AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);	866	AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1086	AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY);	867	AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1087	}	868	}
1088		869
1089	rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */	870	rangetostring (pl, buf); /* we want use the new fire & run system in new client */
1090	AddIfString (pl->ns->stats.range, buf, CS_STAT_RANGE);	871	AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1091	set_title (pl->ob, buf);	872	set_title (ob, buf);
1092	AddIfString (pl->ns->stats.title, buf, CS_STAT_TITLE);	873	AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1093		874
1094	/* Only send it away if we have some actual data */	875	/* Only send it away if we have some actual data */
1095	if (sl.length () > 6)	876	if (sl.length () > 6)
1096	pl->ns->send_packet (sl);	877	ns->send_packet (sl);
1097	}	878	}
1098		879
1099	/**	880	/**
1100	* Tells the client that here is a player it should start using.	881	* Tells the client that here is a player it should start using.
1101	*/	882	*/
1102	void	883	void
1103	esrv_new_player (player *pl, uint32 weight)	884	esrv_new_player (player *pl, uint32 weight)
1104	{	885	{
1105	pl->last_weight = weight;
1106
1107	packet sl ("player");	886	packet sl ("player");
1108		887
1109	sl << uint32 (pl->ob->count)	888	sl << uint32 (pl->ob->count)
1110	<< uint32 (weight)	889	<< uint32 (weight)
1111	<< uint32 (pl->ob->face->number)	890	<< uint32 (pl->ob->face)
1112	<< data8 (pl->ob->name);	891	<< data8 (pl->ob->name);
1113		892
		893	pl->ns->last_weight = weight;
1114	pl->ns->send_packet (sl);	894	pl->ns->send_packet (sl);
1115	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);	895	SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1116	}	896	}
1117
1118	/**
1119	* Need to send an animation sequence to the client.
1120	* We will send appropriate face commands to the client if we haven't
1121	* sent them the face yet (this can become quite costly in terms of
1122	* how much we are sending - on the other hand, this should only happen
1123	* when the player logs in and picks stuff up.
1124	*/
1125	void
1126	esrv_send_animation (client * ns, short anim_num)
1127	{
1128	/* Do some checking on the anim_num we got. Note that the animations
1129	* are added in contigous order, so if the number is in the valid
1130	* range, it must be a valid animation.
1131	*/
1132	if (anim_num < 0 || anim_num > num_animations)
1133	{
1134	LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1135	return;
1136	}
1137
1138	packet sl ("anim");
1139
1140	sl << uint16 (anim_num)
1141	<< uint16 (0); /* flags - not used right now */
1142
1143	/* Build up the list of faces. Also, send any information (ie, the
1144	* the face itself) down to the client.
1145	*/
1146	for (int i = 0; i < animations[anim_num].num_animations; i++)
1147	{
1148	if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1149	esrv_send_face (ns, animations[anim_num].faces[i], 0);
1150
1151	sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1152	}
1153
1154	ns->send_packet (sl);
1155
1156	ns->anims_sent[anim_num] = 1;
1157	}
1158
1159		897
1160	/******************************************************************************	898	/******************************************************************************
1161	*	899	*
1162	* Start of map related commands.	900	* Start of map related commands.
1163	*	901	*
1164	******************************************************************************/	902	******************************************************************************/
1165		903
1166	/**
1167	* This adds face_num to a map cell at x,y. If the client doesn't have
1168	* the face yet, we will also send it.
1169	*/
1170	static void
1171	esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1172	{
1173	if (newmap->cells[x][y].count >= MAP_LAYERS)
1174	{
1175	//TODO: one or the other, can't both have abort and return, verify and act
1176	LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1177	return;
1178	abort ();
1179	}
1180
1181	newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1182	newmap->cells[x][y].count++;
1183
1184	if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1185	esrv_send_face (ns, face_num, 0);
1186	}
1187
1188	/** Clears a map cell */	904	/** Clears a map cell */
1189	static void	905	static void
1190	map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)	906	map_clearcell (struct MapCell *cell, int count)
1191	{	907	{
1192	cell->faces[0] = face0;	908	cell->faces[0] = 0;
1193	cell->faces[1] = face1;	909	cell->faces[1] = 0;
1194	cell->faces[2] = face2;	910	cell->faces[2] = 0;
		911	cell->smooth[0] = 0;
		912	cell->smooth[1] = 0;
		913	cell->smooth[2] = 0;
1195	cell->count = count;	914	cell->count = count;
1196	cell->stat_hp = 0;	915	cell->stat_hp = 0;
1197	cell->flags = 0;	916	cell->flags = 0;
1198	cell->player = 0;	917	cell->player = 0;
1199	}	918	}
1200		919
1201	#define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y)
1202	#define MAX_LAYERS 3	920	#define MAX_LAYERS 3
1203
1204	/* Using a global really isn't a good approach, but saves the over head of
1205	* allocating and deallocating such a block of data each time run through,
1206	* and saves the space of allocating this in the socket object when we only
1207	* need it for this cycle. If the server is ever threaded, this needs to be
1208	* re-examined.
1209	*/
1210	static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1211
1212	/**
1213	* Returns true if any of the heads for this
1214	* space is set. Returns false if all are blank - this is used
1215	* for empty space checking.
1216	*/
1217	static inline int
1218	have_head (int ax, int ay)
1219	{
1220	if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1221	heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1222	return 1;
1223
1224	return 0;
1225	}
1226
1227	/**
1228	* check_head is a bit simplistic version of update_space below.
1229	* basically, it only checks the that the head on space ax,ay at layer
1230	* needs to get sent - if so, it adds the data, sending the head
1231	* if needed, and returning 1. If this no data needs to get
1232	* sent, it returns zero.
1233	*/
1234	static int
1235	check_head (packet &sl, client &ns, int ax, int ay, int layer)
1236	{
1237	short face_num;
1238
1239	if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1240	face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1241	else
1242	face_num = 0;
1243
1244	if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1245	{
1246	sl << uint16 (face_num);
1247	if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1248	esrv_send_face (&ns, face_num, 0);
1249
1250	heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1251	ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1252	return 1;
1253	}
1254
1255	return 0; /* No change */
1256	}
1257		921
1258	/**	922	/**
1259	* Removes the need to replicate the same code for each layer.	923	* Removes the need to replicate the same code for each layer.
1260	* this returns true if this space is now in fact different than	924	* this returns true if this space is now in fact different than
1261	* it was.	925	* it was.
1262	* sl is the socklist this data is going into.	926	* sl is the socklist this data is going into.
1263	* ns is the socket we are working on - all the info we care	927	* ns is the socket we are working on - all the info we care
1264	* about is in this socket structure, so now need not pass the	928	* about is in this socket structure, so now need not pass the
1265	* entire player object.	929	* entire player object.
1266	* mx and my are map coordinate offsets for map mp
1267	* sx and sy are the offsets into the socket structure that
1268	* holds the old values.
1269	* layer is the layer to update, with 2 being the floor and 0 the	930	* layer is the layer to update, with 2 being the floor and 0 the
1270	* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)	931	* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ)
1271	* take. Interesting to note that before this function, the map1 function	932	* take. Interesting to note that before this function, the map1 function
1272	* numbers the spaces differently - I think this was a leftover from	933	* numbers the spaces differently - I think this was a leftover from
1273	* the map command, where the faces stack up. Sinces that is no longer	934	* the map command, where the faces stack up. Sinces that is no longer
1274	* the case, it seems to make more sense to have these layer values	935	* the case, it seems to make more sense to have these layer values
1275	* actually match.	936	* actually match.
1276	*/	937	*/
1277	static int	938	static int
1278	update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)	939	update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer)
1279	{	940	{
1280	object *ob, *head;	941	object *ob = ms.faces_obj [layer];
1281	uint16 face_num;
1282	int bx, by, i;
1283
1284	/* If there is a multipart object stored away, treat that as more important.
1285	* If not, then do the normal processing.
1286	*/
1287	head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1288
1289	/* Check to see if this head is part of the set of objects
1290	* we would normally send for this space. If so, then
1291	* don't use the head value. We need to do the check
1292	* here and not when setting up the heads[] value for two reasons -
1293	* 1) the heads[] values will get used even if the space is not visible.
1294	* 2) its possible the head is not on the same map as a part, and I'd
1295	* rather not need to do the map translation overhead.
1296	* 3) We need to do some extra checking to make sure that we will
1297	* otherwise send the image as this layer, eg, either it matches
1298	* the head value, or is not multipart.
1299	*/
1300	if (head && !head->more)
1301	{
1302	for (i = 0; i < MAP_LAYERS; i++)
1303	{
1304	ob = GET_MAP_FACE_OBJ (mp, mx, my, i);
1305	if (!ob)
1306	continue;
1307
1308	if (ob->head)
1309	ob = ob->head;
1310
1311	if (ob == head)
1312	{
1313	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL;
1314	head = NULL;
1315	break;
1316	}
1317	}
1318	}
1319
1320	ob = head;
1321	if (!ob)
1322	ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1323		942
1324	/* If there is no object for this space, or if the face for the object	943	/* If there is no object for this space, or if the face for the object
1325	* is the blank face, set the face number to zero.	944	* is the blank face, set the face number to zero.
1326	* else if we have the stored head object for this space, that takes	945	* else if we have the stored head object for this space, that takes
1327	* precedence over the other object for this space.	946	* precedence over the other object for this space.
1328	* otherwise, we do special head processing	947	* otherwise, we do special head processing
1329	*/	948	*/
1330	if (!ob || ob->face == blank_face)	949	uint16 face_num = ob && ob->face != blank_face ? ob->face : 0;
1331	face_num = 0;
1332	else if (head)
1333	{
1334	/* if this is a head that had previously been stored */
1335	face_num = ob->face->number;
1336	}
1337	else
1338	{
1339	/* if the faces for the different parts of a multipart object
1340	* are the same, we only want to send the bottom right most
1341	* portion of the object. That info is in the tail_.. values
1342	* of the head. Note that for the head itself, ob->head will
1343	* be null, so we only do this block if we are working on
1344	* a tail piece.
1345	*/
1346
1347	/* tail_x and tail_y will only be set in the head object. If
1348	* this is the head object and these are set, we proceed
1349	* with logic to only send bottom right. Similarly, if
1350	* this is one of the more parts but the head has those values
1351	* set, we want to do the processing. There can be cases where
1352	* the head is not visible but one of its parts is, so we just
1353	* can always expect that ob->arch->tail_x will be true for all
1354	* object we may want to display.
1355	*/
1356	if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y)))
1357	{
1358
1359	if (ob->head)
1360	head = ob->head;
1361	else
1362	head = ob;
1363
1364	/* Basically figure out where the offset is from where we are right
1365	* now. the ob->arch->clone.{x,y} values hold the offset that this current
1366	* piece is from the head, and the tail is where the tail is from the
1367	* head. Note that bx and by will equal sx and sy if we are already working
1368	* on the bottom right corner. If ob is the head, the clone values
1369	* will be zero, so the right thing will still happen.
1370	*/
1371	bx = sx + head->arch->tail_x - ob->arch->clone.x;
1372	by = sy + head->arch->tail_y - ob->arch->clone.y;
1373
1374	/* I don't think this can ever happen, but better to check for it just
1375	* in case.
1376	*/
1377	if (bx < sx || by < sy)
1378	{
1379	LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy);
1380	face_num = 0;
1381	}
1382	/* single part object, multipart object with non merged faces,
1383	* of multipart object already at lower right.
1384	*/
1385	else if (bx == sx && by == sy)
1386	{
1387	face_num = ob->face->number;
1388
1389	/* if this face matches one stored away, clear that one away.
1390	* this code relies on the fact that the map1 commands
1391	* goes from 2 down to 0.
1392	*/
1393	for (i = 0; i < MAP_LAYERS; i++)
1394	if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] &&
1395	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num)
1396	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL;
1397	}
1398	else
1399	{
1400	/* If this head is stored away, clear it - otherwise,
1401	* there can be cases where a object is on multiple layers -
1402	* we only want to send it once.
1403	*/
1404	face_num = head->face->number;
1405	for (i = 0; i < MAP_LAYERS; i++)
1406	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] &&
1407	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num)
1408	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL;
1409
1410	/* First, try to put the new head on the same layer. If that is used up,
1411	* then find another layer.
1412	*/
1413	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL)
1414	{
1415	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head;
1416	}
1417	else
1418	for (i = 0; i < MAX_LAYERS; i++)
1419	{
1420	if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL ||
1421	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head)
1422	{
1423	heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head;
1424	}
1425	}
1426	face_num = 0; /* Don't send this object - we'll send the head later */
1427	}
1428	}
1429	else
1430	{
1431	/* In this case, we are already at the lower right or single part object,
1432	* so nothing special
1433	*/
1434	face_num = ob->face->number;
1435
1436	/* clear out any head entries that have the same face as this one */
1437	for (bx = 0; bx < layer; bx++)
1438	if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] &&
1439	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num)
1440	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL;
1441	}
1442	} /* else not already head object or blank face */
1443
1444	/* This is a real hack. Basically, if we have nothing to send for this layer,
1445	* but there is a head on the next layer, send that instead.
1446	* Without this, what happens is you can get the case where the player stands
1447	* on the same space as the head. However, if you have overlapping big objects
1448	* of the same type, what happens then is it doesn't think it needs to send
1449	* This tends to make stacking also work/look better.
1450	*/
1451	if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1])
1452	{
1453	face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number;
1454	heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL;
1455	}
1456
1457	/* Another hack - because of heads and whatnot, this face may match one
1458	* we already sent for a lower layer. In that case, don't send
1459	* this one.
1460	*/
1461	if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1462	face_num = 0;
1463		950
1464	/* We've gotten what face we want to use for the object. Now see if	951	/* We've gotten what face we want to use for the object. Now see if
1465	* if it has changed since we last sent it to the client.	952	* if it has changed since we last sent it to the client.
1466	*/	953	*/
1467	if (ns.lastmap.cells[sx][sy].faces[layer] != face_num)	954	if (lastcell.faces[layer] != face_num)
1468	{	955	{
1469	ns.lastmap.cells[sx][sy].faces[layer] = face_num;	956	lastcell.faces[layer] = face_num;
		957
1470	if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE))	958	if (!ns.faces_sent[face_num])
		959	if (ob)
		960	ns.send_faces (ob);
		961	else
1471	esrv_send_face (&ns, face_num, 0);	962	ns.send_face (face_num);
1472		963
1473	sl << uint16 (face_num);	964	sl << uint16 (face_num);
1474	return 1;
1475	}
1476
1477	/* Nothing changed */
1478	return 0;
1479	}
1480
1481	/**
1482	* This function is mainly a copy of update_space,
1483	* except it handles update of the smoothing updates,
1484	* not the face updates.
1485	* Removes the need to replicate the same code for each layer.
1486	* this returns true if this smooth is now in fact different
1487	* than it was.
1488	* sl is the socklist this data is going into.
1489	* ns is the socket we are working on - all the info we care
1490	* about is in this socket structure, so know need to pass the
1491	* entire player object.
1492	* mx and my are map coordinate offsets for map mp
1493	* sx and sy are the offsets into the socket structure that
1494	* holds the old values.
1495	* layer is the layer to update, with 2 being the floor and 0 the
1496	* top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1497	* take.
1498	*/
1499
1500	static inline int
1501	update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1502	{
1503	object *ob;
1504	int smoothlevel; /* old face_num; */
1505
1506	ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1507
1508	/* If there is no object for this space, or if the face for the object
1509	* is the blank face, set the smoothlevel to zero.
1510	*/
1511	if (!ob || ob->face == blank_face)
1512	smoothlevel = 0;
1513	else
1514	{
1515	smoothlevel = ob->smoothlevel;
1516	if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
1517	SendSmooth (&ns, ob->face->number);
1518	} /* else not already head object or blank face */
1519
1520	/* We've gotten what face we want to use for the object. Now see if
1521	* if it has changed since we last sent it to the client.
1522	*/
1523	if (smoothlevel > 255)
1524	smoothlevel = 255;
1525	else if (smoothlevel < 0)
1526	smoothlevel = 0;
1527
1528	if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel)
1529	{
1530	ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel;
1531	sl << uint8 (smoothlevel);
1532	return 1;	965	return 1;
1533	}	966	}
1534		967
1535	/* Nothing changed */	968	/* Nothing changed */
1536	return 0;	969	return 0;
…		…
1553	}	986	}
1554		987
1555	return result;	988	return result;
1556	}	989	}
1557		990
		991	// prefetch (and touch) all maps within a specific distancd
		992	static void
		993	prefetch_surrounding_maps (maptile *map, int distance)
		994	{
		995	map->last_access = runtime;
		996
		997	if (--distance)
		998	for (int dir = 4; --dir; )
		999	if (const shstr &path = map->tile_path [dir])
		1000	if (maptile *&neigh = map->tile_map [dir])
		1001	prefetch_surrounding_maps (neigh, distance);
		1002	else
		1003	neigh = maptile::find_async (path, map);
		1004	}
		1005
		1006	// prefetch a generous area around the player
		1007	static void
		1008	prefetch_surrounding_maps (object *op)
		1009	{
		1010	prefetch_surrounding_maps (op->map, 3);
		1011	}
		1012
1558	/**	1013	/**
1559	* This function uses the new map1 protocol command to send the map	1014	* Draws client map.
1560	* to the client. It is necessary because the old map command supports
1561	* a maximum map size of 15x15.
1562	* This function is much simpler than the old one. This is because
1563	* the old function optimized to send as few face identifiers as possible,
1564	* at the expense of sending more coordinate location (coordinates were
1565	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
1566	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1567	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
1568	* and use the other 4 bits for other informatiion. For full documentation
1569	* of what we send, see the doc/Protocol file.
1570	* I will describe internally what we do:
1571	* the ns->lastmap shows how the map last looked when sent to the client.
1572	* in the lastmap structure, there is a cells array, which is set to the
1573	* maximum viewable size (As set in config.h).
1574	* in the cells, there are faces and a count value.
1575	* we use the count value to hold the darkness value. If -1, then this space
1576	* is not viewable.
1577	* we use faces[0] faces[1] faces[2] to hold what the three layers
1578	* look like.
1579	*/	1015	*/
1580	void	1016	void
1581	draw_client_map1 (object *pl)	1017	draw_client_map (player *pl)
1582	{	1018	{
		1019	object *ob = pl->observe;
		1020	if (!ob->active)
		1021	return;
		1022
		1023	maptile *plmap = ob->map;
		1024
		1025	/* If player is just joining the game, he isn't here yet, so the map
		1026	* can get swapped out. If so, don't try to send them a map. All will
		1027	* be OK once they really log in.
		1028	*/
		1029	if (!plmap || plmap->in_memory != MAP_IN_MEMORY)
		1030	return;
		1031
1583	int x, y, ax, ay, d, startlen, max_x, max_y, oldlen;	1032	int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1584	sint16 nx, ny;	1033	sint16 nx, ny;
1585	int estartlen, eoldlen;	1034	int estartlen, eoldlen;
1586	uint16 mask, emask;
1587	uint8 eentrysize;	1035	uint8 eentrysize;
1588	uint16 ewhatstart, ewhatflag;	1036	uint16 ewhatstart, ewhatflag;
1589	uint8 extendedinfos;	1037	uint8 extendedinfos;
1590	maptile *m;	1038	maptile *m;
1591		1039
		1040	check_map_change (pl);
		1041	prefetch_surrounding_maps (pl->ob);
		1042
		1043	/* do LOS after calls to update_position */
		1044	if (ob != pl->ob)
		1045	clear_los (pl);
		1046	else if (pl->do_los)
		1047	{
		1048	update_los (ob);
		1049	pl->do_los = 0;
		1050	}
		1051
		1052	/**
		1053	* This function uses the new map1 protocol command to send the map
		1054	* to the client. It is necessary because the old map command supports
		1055	* a maximum map size of 15x15.
		1056	* This function is much simpler than the old one. This is because
		1057	* the old function optimized to send as few face identifiers as possible,
		1058	* at the expense of sending more coordinate location (coordinates were
		1059	* only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since
		1060	* we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
		1061	* maps no sense. Instead, we actually really only use 12 bits for coordinates,
		1062	* and use the other 4 bits for other informatiion. For full documentation
		1063	* of what we send, see the doc/Protocol file.
		1064	* I will describe internally what we do:
		1065	* the ns->lastmap shows how the map last looked when sent to the client.
		1066	* in the lastmap structure, there is a cells array, which is set to the
		1067	* maximum viewable size (As set in config.h).
		1068	* in the cells, there are faces and a count value.
		1069	* we use the count value to hold the darkness value. If -1, then this space
		1070	* is not viewable.
		1071	* we use faces[0] faces[1] faces[2] to hold what the three layers
		1072	* look like.
		1073	*/
		1074
1592	client &socket = *pl->contr->ns;	1075	client &socket = *pl->ns;
1593
1594	if (!pl->active ())
1595	return;
1596
1597	check_map_change (pl->contr);
1598		1076
1599	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");	1077	packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1600	packet esl;	1078	packet esl;
1601		1079
1602	startlen = sl.length ();	1080	startlen = sl.length ();
…		…
1617	<< uint8 (extendedinfos)	1095	<< uint8 (extendedinfos)
1618	<< uint8 (eentrysize);	1096	<< uint8 (eentrysize);
1619		1097
1620	estartlen = esl.length ();	1098	estartlen = esl.length ();
1621	}	1099	}
1622	else
1623	{
1624	/* suppress compiler warnings */
1625	ewhatstart = 0;
1626	ewhatflag = 0;
1627	estartlen = 0;
1628	}
1629
1630	/* Init data to zero */
1631	memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS);
1632		1100
1633	/* x,y are the real map locations. ax, ay are viewport relative	1101	/* x,y are the real map locations. ax, ay are viewport relative
1634	* locations.	1102	* locations.
1635	*/	1103	*/
1636	ay = 0;	1104	ay = 0;
1637		1105
1638	/* We could do this logic as conditionals in the if statement,	1106	/* We could do this logic as conditionals in the if statement,
1639	* but that started to get a bit messy to look at.	1107	* but that started to get a bit messy to look at.
1640	*/	1108	*/
1641	max_x = pl->x + (socket.mapx + 1) / 2;	1109	max_x = ob->x + (socket.mapx + 1) / 2;
1642	max_y = pl->y + (socket.mapy + 1) / 2;	1110	max_y = ob->y + (socket.mapy + 1) / 2;
1643		1111
1644	if (socket.mapmode == Map1aCmd)
1645	{
1646	max_x += MAX_HEAD_OFFSET;
1647	max_y += MAX_HEAD_OFFSET;
1648	}
1649
1650	for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)	1112	for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++)
1651	{	1113	{
1652	ax = 0;	1114	ax = 0;
1653	for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)	1115	for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++)
1654	{	1116	{
		1117	int emask, mask;
1655	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;	1118	emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1656		1119
1657	/* If this space is out of the normal viewable area, we only check
1658	* the heads value ax or ay will only be greater than what
1659	* the client wants if using the map1a command - this is because
1660	* if the map1a command is not used, max_x and max_y will be
1661	* set to lower values.
1662	*/
1663	if (ax >= socket.mapx || ay >= socket.mapy)
1664	{
1665	int i, got_one;
1666
1667	oldlen = sl.length ();
1668
1669	sl << uint16 (mask);
1670
1671	if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1672	if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1673	if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1674
1675	/* If all we are doing is sending 0 (blank) faces, we don't
1676	* actually need to send that - just the coordinates
1677	* with no faces tells the client to blank out the
1678	* space.
1679	*/
1680	got_one = 0;
1681	for (i = oldlen + 2; i < sl.length (); i++)
1682	if (sl[i])
1683	got_one = 1;
1684
1685	if (got_one && (mask & 0xf))
1686	sl[oldlen + 1] = mask & 0xff;
1687	else
1688	{ /*either all faces blank, either no face at all */
1689	if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1690	sl.reset (oldlen + 2);
1691	else
1692	sl.reset (oldlen);
1693	}
1694
1695	/*What concerns extendinfos, nothing to be done for now
1696	* (perhaps effects layer later)
1697	*/
1698	continue; /* don't do processing below */
1699	}
1700
1701	MapCell &lastcell = socket.lastmap.cells[ax][ay];	1120	MapCell &lastcell = socket.lastmap.cells[ax][ay];
1702
1703	d = pl->contr->blocked_los[ax][ay];
1704		1121
1705	/* If the coordinates are not valid, or it is too dark to see,	1122	/* If the coordinates are not valid, or it is too dark to see,
1706	* we tell the client as such	1123	* we tell the client as such
1707	*/	1124	*/
1708	nx = x;	1125	nx = x;
1709	ny = y;	1126	ny = y;
1710	m = get_map_from_coord (pl->map, &nx, &ny);	1127	m = get_map_from_coord (plmap, &nx, &ny);
1711		1128
1712	if (!m)	1129	if (!m)
1713	{	1130	{
1714	/* space is out of map. Update space and clear values	1131	/* space is out of map. Update space and clear values
1715	* if this hasn't already been done. If the space is out	1132	* if this hasn't already been done. If the space is out
1716	* of the map, it shouldn't have a head	1133	* of the map, it shouldn't have a head
1717	*/	1134	*/
1718	if (lastcell.count != -1)	1135	if (lastcell.count != -1)
1719	{	1136	{
1720	sl << uint16 (mask);	1137	sl << uint16 (mask);
1721	map_clearcell (&lastcell, 0, 0, 0, -1);	1138	map_clearcell (&lastcell, -1);
1722	}	1139	}
		1140
		1141	continue;
1723	}	1142	}
		1143
		1144	m->touch ();
		1145
		1146	int d = pl->blocked_los[ax][ay];
		1147
1724	else if (d > 3)	1148	if (d > 3)
1725	{	1149	{
1726	m->touch ();
1727		1150
1728	int need_send = 0, count;	1151	int need_send = 0, count;
1729		1152
1730	/* This block deals with spaces that are not visible for whatever	1153	/* This block deals with spaces that are not visible for whatever
1731	* reason. Still may need to send the head for this space.	1154	* reason. Still may need to send the head for this space.
1732	*/	1155	*/
1733		1156
1734	oldlen = sl.length ();	1157	oldlen = sl.length ();
1735		1158
1736	sl << uint16 (mask);	1159	sl << uint16 (mask);
…		…
1738	if (lastcell.count != -1)	1161	if (lastcell.count != -1)
1739	need_send = 1;	1162	need_send = 1;
1740		1163
1741	count = -1;	1164	count = -1;
1742		1165
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 */	1166	/* properly clear a previously sent big face */
1756	if (lastcell.faces[0] != 0 || lastcell.faces[1] != 0 || lastcell.faces[2] != 0	1167	if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1757	|| lastcell.stat_hp || lastcell.flags || lastcell.player)	1168	|| lastcell.stat_hp || lastcell.flags || lastcell.player)
1758	need_send = 1;	1169	need_send = 1;
1759		1170
1760	map_clearcell (&lastcell, 0, 0, 0, count);	1171	map_clearcell (&lastcell, count);
1761	}
1762		1172
1763	if ((mask & 0xf) || need_send)	1173	if ((mask & 0xf) || need_send)
1764	sl[oldlen + 1] = mask & 0xff;	1174	sl[oldlen + 1] = mask & 0xff;
1765	else	1175	else
1766	sl.reset (oldlen);	1176	sl.reset (oldlen);
1767	}	1177	}
1768	else	1178	else
1769	{	1179	{
1770	m->touch ();
1771
1772	/* In this block, the space is visible or there are head objects	1180	/* In this block, the space is visible.
1773	* we need to send.
1774	*/	1181	*/
1775		1182
1776	/* Rather than try to figure out what everything that we might	1183	/* Rather than try to figure out what everything that we might
1777	* need to send is, then form the packet after that,	1184	* need to send is, then form the packet after that,
1778	* we presume that we will in fact form a packet, and update	1185	* we presume that we will in fact form a packet, and update
…		…
1781	* is done.	1188	* is done.
1782	* I think this is simpler than doing a bunch of checks to see	1189	* I think this is simpler than doing a bunch of checks to see
1783	* what if anything we need to send, setting the bits, then	1190	* what if anything we need to send, setting the bits, then
1784	* doing those checks again to add the real data.	1191	* doing those checks again to add the real data.
1785	*/	1192	*/
1786	oldlen = sl.length ();	1193	oldlen = sl.length ();
1787	mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1788	eoldlen = esl.length ();	1194	eoldlen = esl.length ();
1789	emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;	1195
1790	sl << uint16 (mask);	1196	sl << uint16 (mask);
1791
1792	if (socket.ext_mapinfos)
1793	esl << uint16 (emask);
1794		1197
1795	unsigned char dummy;	1198	unsigned char dummy;
1796	unsigned char *last_ext = &dummy;	1199	unsigned char *last_ext = &dummy;
1797		1200
1798	/* Darkness changed */	1201	/* Darkness changed */
…		…
1810	sl << uint8 (255 - 64 * d);	1213	sl << uint8 (255 - 64 * d);
1811	}	1214	}
1812		1215
1813	lastcell.count = d;	1216	lastcell.count = d;
1814		1217
		1218	mapspace &ms = m->at (nx, ny);
		1219
1815	if (socket.extmap)	1220	if (socket.extmap)
1816	{	1221	{
1817	uint8 stat_hp = 0;	1222	uint8 stat_hp = 0;
1818	uint8 stat_width = 0;	1223	uint8 stat_width = 0;
1819	uint8 flags = 0;	1224	uint8 flags = 0;
1820	UUID player = 0;	1225	tag_t player = 0;
1821		1226
1822	// send hp information, if applicable	1227	// send hp information, if applicable
1823	if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0))	1228	if (object *op = ms.faces_obj [0])
1824	{	1229	{
1825	if (op->head || op->invisible)	1230	if (op->head || op->invisible)
1826	; // do not show	1231	; // do not show
1827	else if (op->type == PLAYER	1232	else if (op->type == PLAYER
1828	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))	1233	|| QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))
1829	{	1234	{
1830	if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)	1235	if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp)
1831	{	1236	{
1832	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;	1237	stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp;
1833	stat_width = op->arch->tail_x;	1238	stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge
1834	}	1239	}
1835	}	1240	}
1836		1241
1837	if (op->msg && op->msg[0] == '@')	1242	if (op->msg && op->msg[0] == '@')
1838	flags |= 1;	1243	flags |= 1;
1839		1244
1840	if (op->type == PLAYER && op != pl)	1245	if (op->type == PLAYER && op != ob)
1841	player = op->count;	1246	player = op->count;
1842	}	1247	}
1843		1248
1844	if (lastcell.stat_hp != stat_hp)	1249	if (lastcell.stat_hp != stat_hp)
1845	{	1250	{
…		…
1866		1271
1867	mask |= 0x8;	1272	mask |= 0x8;
1868	*last_ext |= 0x80;	1273	*last_ext |= 0x80;
1869	last_ext = &sl[sl.length ()];	1274	last_ext = &sl[sl.length ()];
1870		1275
1871	sl << uint8 (0x47) << uint8 (8) << (uint64)player;	1276	sl << uint8 (0x47) << uint8 (4) << (uint32)player;
1872	}	1277	}
1873		1278
1874	if (lastcell.flags != flags)	1279	if (lastcell.flags != flags)
1875	{	1280	{
1876	lastcell.flags = flags;	1281	lastcell.flags = flags;
…		…
1882	sl << uint8 (8) << uint8 (flags);	1287	sl << uint8 (8) << uint8 (flags);
1883	}	1288	}
1884	}	1289	}
1885		1290
1886	/* Floor face */	1291	/* Floor face */
1887	if (update_space (sl, socket, m, nx, ny, ax, ay, 2))	1292	if (update_space (sl, socket, ms, lastcell, 2))
1888	mask |= 0x4;	1293	mask |= 0x4;
1889		1294
1890	if (socket.EMI_smooth)
1891	if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2))
1892	emask |= 0x4;
1893
1894	/* Middle face */	1295	/* Middle face */
1895	if (update_space (sl, socket, m, nx, ny, ax, ay, 1))	1296	if (update_space (sl, socket, ms, lastcell, 1))
1896	mask |= 0x2;	1297	mask |= 0x2;
1897		1298
1898	if (socket.EMI_smooth)	1299	if (ms.player () == ob
1899	if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1))	1300	&& (ob->invisible & (ob->invisible < 50 ? 1 : 7)))
1900	emask |= 0x2;
1901
1902	if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
1903	{	1301	{
		1302	// force player to be visible to himself if invisible
1904	if (lastcell.faces[0] != pl->face->number)	1303	if (lastcell.faces[0] != ob->face)
1905	{	1304	{
1906	lastcell.faces[0] = pl->face->number;	1305	lastcell.faces[0] = ob->face;
		1306
1907	mask |= 0x1;	1307	mask |= 0x1;
1908
1909	if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE))
1910	esrv_send_face (&socket, pl->face->number, 0);
1911
1912	sl << uint16 (pl->face->number);	1308	sl << uint16 (ob->face);
		1309
		1310	socket.send_faces (ob);
1913	}	1311	}
1914	}	1312	}
1915	else
1916	{
1917	/* Top face */	1313	/* Top face */
1918	if (update_space (sl, socket, m, nx, ny, ax, ay, 0))	1314	else if (update_space (sl, socket, ms, lastcell, 0))
1919	mask |= 0x1;	1315	mask |= 0x1;
1920
1921	if (socket.EMI_smooth)
1922	if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0))
1923	emask |= 0x1;
1924	}
1925		1316
1926	/* Check to see if we are in fact sending anything for this	1317	/* Check to see if we are in fact sending anything for this
1927	* space by checking the mask. If so, update the mask.	1318	* space by checking the mask. If so, update the mask.
1928	* if not, reset the len to that from before adding the mask	1319	* if not, reset the len to that from before adding the mask
1929	* value, so we don't send those bits.	1320	* value, so we don't send those bits.
…		…
1931	if (mask & 0xf)	1322	if (mask & 0xf)
1932	sl[oldlen + 1] = mask & 0xff;	1323	sl[oldlen + 1] = mask & 0xff;
1933	else	1324	else
1934	sl.reset (oldlen);	1325	sl.reset (oldlen);
1935		1326
		1327	if (socket.ext_mapinfos)
		1328	esl << uint16 (emask);
		1329
		1330	if (socket.EMI_smooth)
		1331	{
		1332	for (int layer = 2+1; layer--; )
		1333	{
		1334	object *ob = ms.faces_obj [layer];
		1335
		1336	// If there is no object for this space, or if the face for the object
		1337	// is the blank face, set the smoothlevel to zero.
		1338	int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0;
		1339
		1340	// We've gotten what face we want to use for the object. Now see if
		1341	// if it has changed since we last sent it to the client.
		1342	if (lastcell.smooth[layer] != smoothlevel)
		1343	{
		1344	lastcell.smooth[layer] = smoothlevel;
		1345	esl << uint8 (smoothlevel);
		1346	emask |= 1 << layer;
		1347	}
		1348	}
		1349
1936	if (emask & 0xf)	1350	if (emask & 0xf)
1937	esl[eoldlen + 1] = emask & 0xff;	1351	esl[eoldlen + 1] = emask & 0xff;
1938	else	1352	else
1939	esl.reset (eoldlen);	1353	esl.reset (eoldlen);
		1354	}
1940	} /* else this is a viewable space */	1355	} /* else this is a viewable space */
1941	} /* for x loop */	1356	} /* for x loop */
1942	} /* for y loop */	1357	} /* for y loop */
		1358
		1359	socket.flush_fx ();
1943		1360
1944	/* Verify that we in fact do need to send this */	1361	/* Verify that we in fact do need to send this */
1945	if (socket.ext_mapinfos)	1362	if (socket.ext_mapinfos)
1946	{	1363	{
1947	if (!(sl.length () > startlen || socket.sent_scroll))	1364	if (!(sl.length () > startlen || socket.sent_scroll))
1948	{	1365	{
1949	/* No map data will follow, so don't say the client	1366	/* No map data will follow, so don't say the client
1950	* it doesn't need draw!	1367	* it doesn't need draw!
1951	*/	1368	*/
1952	ewhatflag &= (~EMI_NOREDRAW);	1369	ewhatflag &= ~EMI_NOREDRAW;
1953	esl[ewhatstart + 1] = ewhatflag & 0xff;	1370	esl[ewhatstart + 1] = ewhatflag & 0xff;
1954	}	1371	}
1955		1372
1956	if (esl.length () > estartlen)	1373	if (esl.length () > estartlen)
1957	socket.send_packet (esl);	1374	socket.send_packet (esl);
…		…
1962	socket.send_packet (sl);	1379	socket.send_packet (sl);
1963	socket.sent_scroll = 0;	1380	socket.sent_scroll = 0;
1964	}	1381	}
1965	}	1382	}
1966		1383
1967	/**
1968	* Draws client map.
1969	*/
1970	void
1971	draw_client_map (object *pl)
1972	{
1973	int i, j;
1974	sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */
1975	New_Face *face, *floor;
1976	New_Face *floor2;
1977	int d, mflags;
1978	struct Map newmap;
1979	maptile *m, *pm;
1980
1981	if (pl->type != PLAYER)
1982	{
1983	LOG (llevError, "draw_client_map called with non player/non eric-server\n");
1984	return;
1985	}
1986
1987	pm = pl->map;
1988
1989	/* If player is just joining the game, he isn't here yet, so the map
1990	* can get swapped out. If so, don't try to send them a map. All will
1991	* be OK once they really log in.
1992	*/
1993	if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
1994	return;
1995
1996	memset (&newmap, 0, sizeof (struct Map));
1997
1998	for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)
1999	for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)
2000	{
2001	ax = i;
2002	ay = j;
2003	m = pm;
2004	mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2005
2006	if (mflags & P_OUT_OF_MAP)
2007	continue;
2008
2009	/* If a map is visible to the player, we don't want to swap it out
2010	* just to reload it. This should really call something like
2011	* swap_map, but this is much more efficient and 'good enough'
2012	*/
2013	if (mflags & P_NEW_MAP)
2014	m->timeout = 50;
2015	}
2016
2017	/* do LOS after calls to update_position */
2018	if (pl->contr->do_los)
2019	{
2020	update_los (pl);
2021	pl->contr->do_los = 0;
2022	}
2023
2024	/* Big maps need a different drawing mechanism to work */
2025	draw_client_map1 (pl);
2026	}
2027
2028
2029	/*****************************************************************************/	1384	/*****************************************************************************/
2030
2031	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/	1385	/* GROS: The following one is used to allow a plugin to send a generic cmd to*/
2032
2033	/* a player. Of course, the client need to know the command to be able to */	1386	/* a player. Of course, the client need to know the command to be able to */
2034
2035	/* manage it ! */	1387	/* manage it ! */
2036
2037	/*****************************************************************************/	1388	/*****************************************************************************/
2038	void	1389	void
2039	send_plugin_custom_message (object *pl, char *buf)	1390	send_plugin_custom_message (object *pl, char *buf)
2040	{	1391	{
2041	pl->contr->ns->send_packet (buf);	1392	pl->contr->ns->send_packet (buf);
…		…
2163		1514
2164	/* appends the spell *spell to the Socklist we will send the data to. */	1515	/* appends the spell *spell to the Socklist we will send the data to. */
2165	static void	1516	static void
2166	append_spell (player *pl, packet &sl, object *spell)	1517	append_spell (player *pl, packet &sl, object *spell)
2167	{	1518	{
2168	int len, i, skill = 0;	1519	int i, skill = 0;
2169		1520
2170	if (!(spell->name))	1521	if (!(spell->name))
2171	{	1522	{
2172	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);	1523	LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
2173	return;	1524	return;
…		…
2185	if (!strcmp (spell->skill, skill_names[i]))	1536	if (!strcmp (spell->skill, skill_names[i]))
2186	{	1537	{
2187	skill = i + CS_STAT_SKILLINFO;	1538	skill = i + CS_STAT_SKILLINFO;
2188	break;	1539	break;
2189	}	1540	}
		1541	}
		1542
		1543	// spells better have a face
		1544	if (!spell->face)
		1545	{
		1546	LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
		1547	spell->face = face_find ("burnout.x11", blank_face);
2190	}	1548	}
2191		1549
2192	/* send the current values */	1550	/* send the current values */
2193	sl << uint32 (spell->count)	1551	sl << uint32 (spell->count)
2194	<< uint16 (spell->level)	1552	<< uint16 (spell->level)
…		…
2196	<< uint16 (spell->last_sp)	1554	<< uint16 (spell->last_sp)
2197	<< uint16 (spell->last_grace)	1555	<< uint16 (spell->last_grace)
2198	<< uint16 (spell->last_eat)	1556	<< uint16 (spell->last_eat)
2199	<< uint8 (skill)	1557	<< uint8 (skill)
2200	<< uint32 (spell->path_attuned)	1558	<< uint32 (spell->path_attuned)
2201	<< uint32 (spell->face ? spell->face->number : 0)	1559	<< uint32 (spell->face)
2202	<< data8 (spell->name)	1560	<< data8 (spell->name)
2203	<< data16 (spell->msg);	1561	<< data16 (spell->msg);
2204	}	1562	}
2205		1563
2206	/**	1564	/**
…		…
2221		1579
2222	packet sl ("addspell");	1580	packet sl ("addspell");
2223		1581
2224	if (!spell)	1582	if (!spell)
2225	{	1583	{
2226	for (spell = pl->ob->inv; spell != NULL; spell = spell->below)	1584	for (spell = pl->ob->inv; spell; spell = spell->below)
2227	{	1585	{
2228	/* were we to simply keep appending data here, we could exceed	1586	/* were we to simply keep appending data here, we could exceed
2229	* MAXSOCKBUF if the player has enough spells to add, we know that	1587	* MAXSOCKBUF if the player has enough spells to add, we know that
2230	* append_spells will always append 19 data bytes, plus 4 length	1588	* append_spells will always append 19 data bytes, plus 4 length
2231	* bytes and 3 strings (because that is the spec) so we need to	1589	* bytes and 3 strings (because that is the spec) so we need to

Diff Legend

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