ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
(Generate patch)

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.33 by root, Thu Dec 14 01:21:58 2006 UTC vs.
Revision 1.50 by root, Thu Dec 21 23:37:06 2006 UTC

… …
38 * esrv_map_new starts updating the map 38 * esrv_map_new starts updating the map
39 * 39 *
40 * esrv_map_setbelow allows filling in all of the faces for the map. 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. 41 * if a face has not already been sent to the client, it is sent now.
42 * 42 *
43 * mapcellchanged, compactlayer, compactstack, perform the map compressing
44 * operations
45 *
46 * esrv_map_doneredraw finishes the map update, and ships across the
47 * map updates.
48 *
49 */ 43 */
50 44
51#include <global.h> 45#include <global.h>
52#include <sproto.h> 46#include <sproto.h>
53 47
54#include <newclient.h>
55#include <newserver.h>
56#include <living.h> 48#include <living.h>
57#include <commands.h> 49#include <commands.h>
58 50
59/* This block is basically taken from socket.c - I assume if it works there, 51/* This block is basically taken from socket.c - I assume if it works there,
60 * it should work here. 52 * it should work here.
… …
63#include <sys/time.h> 55#include <sys/time.h>
64#include <sys/socket.h> 56#include <sys/socket.h>
65#include <netinet/in.h> 57#include <netinet/in.h>
66#include <netdb.h> 58#include <netdb.h>
67 59
68#ifdef HAVE_UNISTD_H
69# include <unistd.h> 60#include <unistd.h>
70#endif
71
72#ifdef HAVE_SYS_TIME_H
73# include <sys/time.h> 61#include <sys/time.h>
74#endif
75 62
76#include "sounds.h" 63#include "sounds.h"
77 64
78/** 65/**
79 * This table translates the attack numbers as used within the 66 * This table translates the attack numbers as used within the
… …
96 -1, /* life stealing */ 83 -1, /* life stealing */
97 -1 /* Disease - not fully done yet */ 84 -1 /* Disease - not fully done yet */
98}; 85};
99 86
100static void 87static void
101socket_map_scroll (NewSocket * ns, int dx, int dy) 88socket_map_scroll (client *ns, int dx, int dy)
102{ 89{
103 struct Map newmap; 90 struct Map newmap;
104 int x, y, mx, my; 91 int x, y, mx, my;
105 92
106 {
107 packet sl;
108
109 sl.printf ("map_scroll %d %d", dx, dy); 93 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
110 ns->send_packet (sl);
111 }
112 94
113 /* If we are using the Map1aCmd, we may in fact send 95 /* If we are using the Map1aCmd, we may in fact send
114 * head information that is outside the viewable map. 96 * head information that is outside the viewable map.
115 * So set the mx,my to the max value we want to 97 * So set the mx,my to the max value we want to
116 * look for. Removed code to do so - it caused extra 98 * look for. Removed code to do so - it caused extra
… …
156} 138}
157 139
158static void 140static void
159clear_map (player *pl) 141clear_map (player *pl)
160{ 142{
161 NewSocket & socket = pl->socket;
162
163 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 143 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
164 144
165 if (socket.newmapcmd == 1) 145 if (pl->ns->newmapcmd == 1)
166 socket.send_packet ("newmap"); 146 pl->ns->send_packet ("newmap");
167 147
168 socket.update_look = 1; 148 pl->ns->floorbox_reset ();
169 socket.look_position = 0;
170} 149}
171 150
172/** check for map change and send new map data */ 151/** check for map change and send new map data */
173static void 152static void
174check_map_change (player *pl) 153check_map_change (player *pl)
175{ 154{
176 NewSocket & socket = pl->socket; 155 client &socket = *pl->ns;
177 object *ob = pl->ob; 156 object *ob = pl->ob;
178 char buf[MAX_BUF]; /* eauugggh */ 157 char buf[MAX_BUF]; /* eauugggh */
179 158
180 if (socket.current_map != ob->map) 159 if (socket.current_map != ob->map)
181 { 160 {
… …
215 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 194 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
216 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows 195 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
217 else 196 else
218 { 197 {
219 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); 198 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
220 socket.update_look = 1; 199 socket.floorbox_reset ();
221 socket.look_position = 0;
222 } 200 }
223 } 201 }
224 202
225 socket.current_x = ob->x; 203 socket.current_x = ob->x;
226 socket.current_y = ob->y; 204 socket.current_y = ob->y;
227} 205}
228 206
207/**
208 * RequestInfo is sort of a meta command. There is some specific
209 * request of information, but we call other functions to provide
210 * that information.
211 */
212void
213RequestInfo (char *buf, int len, client * ns)
214{
215 char *params = NULL, *cp;
216
217 /* No match */
218 char bigbuf[MAX_BUF];
219 int slen;
220
221 /* Set up replyinfo before we modify any of the buffers - this is used
222 * if we don't find a match.
223 */
224 strcpy (bigbuf, "replyinfo ");
225 slen = strlen (bigbuf);
226 safe_strcat (bigbuf, buf, &slen, MAX_BUF);
227
228 /* find the first space, make it null, and update the
229 * params pointer.
230 */
231 for (cp = buf; *cp != '\0'; cp++)
232 if (*cp == ' ')
233 {
234 *cp = '\0';
235 params = cp + 1;
236 break;
237 }
238
239 if (!strcmp (buf, "image_info"))
240 send_image_info (ns, params);
241 else if (!strcmp (buf, "image_sums"))
242 send_image_sums (ns, params);
243 else if (!strcmp (buf, "skill_info"))
244 send_skill_info (ns, params);
245 else if (!strcmp (buf, "spell_paths"))
246 send_spell_paths (ns, params);
247 else
248 ns->send_packet (bigbuf, len);
249}
250
229void 251void
230ExtCmd (char *buf, int len, player *pl) 252ExtCmd (char *buf, int len, player *pl)
231{ 253{
232 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 254 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
255}
256
257void
258ExtiCmd (char *buf, int len, client *ns)
259{
260 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
233} 261}
234 262
235void 263void
236MapInfoCmd (char *buf, int len, player *pl) 264MapInfoCmd (char *buf, int len, player *pl)
237{ 265{
… …
252 buf += 8; 280 buf += 8;
253 281
254 // initial map and its origin 282 // initial map and its origin
255 maptile *map = pl->ob->map; 283 maptile *map = pl->ob->map;
256 sint16 dx, dy; 284 sint16 dx, dy;
257 int mapx = pl->socket.mapx / 2 - pl->ob->x; 285 int mapx = pl->ns->mapx / 2 - pl->ob->x;
258 int mapy = pl->socket.mapy / 2 - pl->ob->y; 286 int mapy = pl->ns->mapy / 2 - pl->ob->y;
259 int max_distance = 8; // limit maximum path length to something generous 287 int max_distance = 8; // limit maximum path length to something generous
260 288
261 while (*buf && map && max_distance) 289 while (*buf && map && max_distance)
262 { 290 {
263 int dir = *buf++; 291 int dir = *buf++;
… …
314 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 342 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
315 } 343 }
316 else 344 else
317 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 345 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
318 346
319 pl->socket.send_packet (bigbuf); 347 pl->ns->send_packet (bigbuf);
320} 348}
321 349
322/** This is the Setup cmd - easy first implementation */ 350/** This is the Setup cmd - easy first implementation */
323void 351void
324SetUp (char *buf, int len, NewSocket * ns) 352SetUp (char *buf, int len, client * ns)
325{ 353{
326 int s, slen; 354 int s, slen;
327 char *cmd, *param, cmdback[HUGE_BUF]; 355 char *cmd, *param, cmdback[HUGE_BUF];
328 356
329 /* run through the cmds of setup 357 /* run through the cmds of setup
… …
539 * This is what takes care of it. We tell the client how things worked out. 567 * This is what takes care of it. We tell the client how things worked out.
540 * I am not sure if this file is the best place for this function. however, 568 * I am not sure if this file is the best place for this function. however,
541 * it either has to be here or init_sockets needs to be exported. 569 * it either has to be here or init_sockets needs to be exported.
542 */ 570 */
543void 571void
544AddMeCmd (char *buf, int len, NewSocket * ns) 572AddMeCmd (char *buf, int len, client * ns)
545{ 573{
546 Settings oldsettings; 574 if (INVOKE_CLIENT (ADDME, ns))
575 return;
547 576
548 oldsettings = settings;
549 if (ns->status != Ns_Add || add_player (ns)) 577 if (ns->pl || add_player (ns))
550 ns->send_packet ("addme_failed"); 578 ns->send_packet ("addme_failed");
551 else 579 else
552 {
553 /* Basically, the add_player copies the socket structure into
554 * the player structure, so this one (which is from init_sockets)
555 * is not needed anymore. The write below should still work, as the
556 * stuff in ns is still relevant.
557 */
558 ns->send_packet ("addme_success"); 580 ns->send_packet ("addme_success");
559 socket_info.nconns--;
560 ns->status = Ns_Avail;
561 }
562
563 settings = oldsettings;
564} 581}
565 582
566/** Reply to ExtendedInfos command */ 583/** Reply to ExtendedInfos command */
567void 584void
568ToggleExtendedInfos (char *buf, int len, NewSocket * ns) 585ToggleExtendedInfos (char *buf, int len, client * ns)
569{ 586{
570 char cmdback[MAX_BUF]; 587 char cmdback[MAX_BUF];
571 char command[50]; 588 char command[50];
572 int info, nextinfo; 589 int info, nextinfo;
573 590
… …
624#define MSG_TYPE_MONUMENT 5 641#define MSG_TYPE_MONUMENT 5
625#define MSG_TYPE_SCRIPTED_DIALOG 6*/ 642#define MSG_TYPE_SCRIPTED_DIALOG 6*/
626 643
627/** Reply to ExtendedInfos command */ 644/** Reply to ExtendedInfos command */
628void 645void
629ToggleExtendedText (char *buf, int len, NewSocket * ns) 646ToggleExtendedText (char *buf, int len, client * ns)
630{ 647{
631 char cmdback[MAX_BUF]; 648 char cmdback[MAX_BUF];
632 char temp[10]; 649 char temp[10];
633 char command[50]; 650 char command[50];
634 int info, nextinfo, i, flag; 651 int info, nextinfo, i, flag;
… …
685 * a piece of data from us that we know the client wants. So 702 * a piece of data from us that we know the client wants. So
686 * if we know the client wants it, might as well push it to the 703 * if we know the client wants it, might as well push it to the
687 * client. 704 * client.
688 */ 705 */
689static void 706static void
690SendSmooth (NewSocket * ns, uint16 face) 707SendSmooth (client *ns, uint16 face)
691{ 708{
692 uint16 smoothface; 709 uint16 smoothface;
693 710
694 /* If we can't find a face, return and set it so we won't try to send this 711 /* If we can't find a face, return and set it so we won't try to send this
695 * again. 712 * again.
… …
705 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) 722 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
706 esrv_send_face (ns, smoothface, 0); 723 esrv_send_face (ns, smoothface, 0);
707 724
708 ns->faces_sent[face] |= NS_FACESENT_SMOOTH; 725 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
709 726
710 packet sl; 727 packet sl ("smooth");
711 728
712 sl << "smooth "
713 << uint16 (face) 729 sl << uint16 (face)
714 << uint16 (smoothface); 730 << uint16 (smoothface);
715 731
716 Send_With_Handling (ns, &sl); 732 ns->send_packet (sl);
717} 733}
718 734
719 /** 735 /**
720 * Tells client the picture it has to use 736 * Tells client the picture it has to use
721 * to smooth a picture number given as argument. 737 * to smooth a picture number given as argument.
722 */ 738 */
723void 739void
724AskSmooth (char *buf, int len, NewSocket * ns) 740AskSmooth (char *buf, int len, client *ns)
725{ 741{
726 uint16 facenbr; 742 SendSmooth (ns, atoi (buf));
727
728 facenbr = atoi (buf);
729 SendSmooth (ns, facenbr);
730} 743}
731 744
732/** 745/**
733 * This handles the general commands from the client (ie, north, fire, cast, 746 * This handles the general commands from the client (ie, north, fire, cast,
734 * etc.) 747 * etc.)
735 */ 748 */
736void 749void
737PlayerCmd (char *buf, int len, player *pl) 750PlayerCmd (char *buf, int len, player *pl)
738{ 751{
739
740 /* The following should never happen with a proper or honest client.
741 * Therefore, the error message doesn't have to be too clear - if
742 * someone is playing with a hacked/non working client, this gives them
743 * an idea of the problem, but they deserve what they get
744 */
745 if (pl->state != ST_PLAYING)
746 {
747 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
748 return;
749 }
750 /* Check if there is a count. In theory, a zero count could also be 752 /* Check if there is a count. In theory, a zero count could also be
751 * sent, so check for that also. 753 * sent, so check for that also.
752 */ 754 */
753 if (atoi (buf) || buf[0] == '0') 755 if (atoi (buf) || buf[0] == '0')
754 { 756 {
755 pl->count = atoi ((char *) buf); 757 pl->count = atoi ((char *) buf);
758
756 buf = strchr (buf, ' '); /* advance beyond the numbers */ 759 buf = strchr (buf, ' '); /* advance beyond the numbers */
757 if (!buf) 760 if (!buf)
758 {
759#ifdef ESRV_DEBUG
760 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
761#endif
762 return; 761 return;
763 } 762
764 buf++; 763 buf++;
765 } 764 }
766 /* This should not happen anymore. */ 765
767 if (pl->ob->speed_left < -1.0)
768 {
769 LOG (llevError, "Player has negative time - shouldn't do command.\n");
770 }
771 /* In c_new.c */
772 execute_newserver_command (pl->ob, (char *) buf); 766 execute_newserver_command (pl->ob, (char *) buf);
767
773 /* Perhaps something better should be done with a left over count. 768 /* Perhaps something better should be done with a left over count.
774 * Cleaning up the input should probably be done first - all actions 769 * Cleaning up the input should probably be done first - all actions
775 * for the command that issued the count should be done before any other 770 * for the command that issued the count should be done before any other
776 * commands. 771 * commands.
777 */ 772 */
778
779 pl->count = 0; 773 pl->count = 0;
780
781} 774}
782 775
783 776
784/** 777/**
785 * This handles the general commands from the client (ie, north, fire, cast, 778 * This handles the general commands from the client (ie, north, fire, cast,
786 * etc.). It is a lot like PlayerCmd above, but is called with the 779 * etc.). It is a lot like PlayerCmd above, but is called with the
787 * 'ncom' method which gives more information back to the client so it 780 * 'ncom' method which gives more information back to the client so it
788 * can throttle. 781 * can throttle.
789 */ 782 */
790void 783void
791NewPlayerCmd (uint8 * buf, int len, player *pl) 784NewPlayerCmd (char *buf, int len, player *pl)
792{ 785{
793 int time, repeat;
794 char command[MAX_BUF];
795 int pktlen;
796
797 if (len < 7) 786 if (len <= 6)
798 { 787 {
799 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 788 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
800 return; 789 return;
801 } 790 }
802 791
803 pktlen = net_uint16 (buf); 792 uint16 cmdid = net_uint16 ((uint8 *)buf);
804 repeat = net_uint32 (buf + 2); 793 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
805 794
806 /* -1 is special - no repeat, but don't update */ 795 /* -1 is special - no repeat, but don't update */
807 if (repeat != -1) 796 if (repeat != -1)
808 pl->count = repeat; 797 pl->count = repeat;
809 798
810 if ((len - 4) >= MAX_BUF) 799 buf += 6; //len -= 6;
811 len = MAX_BUF - 5;
812 800
813 strncpy ((char *) command, (char *) buf + 6, len - 4);
814 command[len - 4] = '\0';
815
816 /* The following should never happen with a proper or honest client.
817 * Therefore, the error message doesn't have to be too clear - if
818 * someone is playing with a hacked/non working client, this gives them
819 * an idea of the problem, but they deserve what they get
820 */
821 if (pl->state != ST_PLAYING)
822 {
823 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
824 return;
825 }
826
827 /* This should not happen anymore. */
828 if (pl->ob->speed_left < -1.0)
829 LOG (llevError, "Player has negative time - shouldn't do command.\n");
830
831 /* In c_new.c */
832 execute_newserver_command (pl->ob, (char *) command); 801 execute_newserver_command (pl->ob, buf);
802
833 /* Perhaps something better should be done with a left over count. 803 /* Perhaps something better should be done with a left over count.
834 * Cleaning up the input should probably be done first - all actions 804 * Cleaning up the input should probably be done first - all actions
835 * for the command that issued the count should be done before any other 805 * for the command that issued the count should be done before any other
836 * commands. 806 * commands.
837 */ 807 */
838 pl->count = 0; 808 pl->count = 0;
839 809
810 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
840 if (FABS (pl->ob->speed) < 0.001) 811 int time = FABS (pl->ob->speed) < 0.001
841 time = MAX_TIME * 100; 812 ? time = MAX_TIME * 100
842 else
843 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 813 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
844 814
845 /* Send confirmation of command execution now */ 815 /* Send confirmation of command execution now */
846 816 packet sl ("comc");
847 packet sl;
848 sl << "comc " << uint16 (pktlen) << uint32 (time); 817 sl << uint16 (cmdid) << uint32 (time);
849 Send_With_Handling (&pl->socket, &sl); 818 pl->ns->send_packet (sl);
850} 819}
851
852 820
853/** This is a reply to a previous query. */ 821/** This is a reply to a previous query. */
854void 822void
855ReplyCmd (char *buf, int len, player *pl) 823ReplyCmd (char *buf, int len, client *ns)
856{ 824{
825 if (ns->state == ST_CUSTOM)
826 {
827 INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len));
828 return;
829 }
830
831 if (!ns->pl)
832 return; //TODO: depends on the exact reply we are after
833 //TODO: but right now, we always have a ns->pl
834
835 player *pl = ns->pl;
836
857 /* This is to synthesize how the data would be stored if it 837 /* This is to synthesize how the data would be stored if it
858 * was normally entered. A bit of a hack, and should be cleaned up 838 * was normally entered. A bit of a hack, and should be cleaned up
859 * once all the X11 code is removed from the server. 839 * once all the X11 code is removed from the server.
860 * 840 *
861 * We pass 13 to many of the functions because this way they 841 * We pass 13 to many of the functions because this way they
862 * think it was the carriage return that was entered, and the 842 * think it was the carriage return that was entered, and the
863 * function then does not try to do additional input. 843 * function then does not try to do additional input.
864 */ 844 */
865 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); 845 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
866 846
867 /* this avoids any hacking here */ 847 /* this avoids any hacking here */
868 848
869 switch (pl->state) 849 switch (ns->state)
870 { 850 {
871 case ST_PLAYING: 851 case ST_PLAYING:
872 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 852 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
873 break; 853 break;
874 854
875 case ST_PLAY_AGAIN: 855 case ST_PLAY_AGAIN:
876 /* We can check this for return value (2==quit). Maybe we 856 /* We can check this for return value (2==quit). Maybe we
877 * should, and do something appropriate? 857 * should, and do something appropriate?
878 */ 858 */
879 receive_play_again (pl->ob, buf[0]); 859 receive_play_again (pl->ob, buf[0]);
880 break; 860 break;
881 861
882 case ST_ROLL_STAT: 862 case ST_ROLL_STAT:
883 key_roll_stat (pl->ob, buf[0]); 863 key_roll_stat (pl->ob, buf[0]);
884 break; 864 break;
885 865
886 case ST_CHANGE_CLASS: 866 case ST_CHANGE_CLASS:
887
888 key_change_class (pl->ob, buf[0]); 867 key_change_class (pl->ob, buf[0]);
889 break; 868 break;
890 869
891 case ST_CONFIRM_QUIT: 870 case ST_CONFIRM_QUIT:
892 key_confirm_quit (pl->ob, buf[0]); 871 key_confirm_quit (pl->ob, buf[0]);
893 break; 872 break;
894 873
895 case ST_CONFIGURE: 874 case ST_CONFIGURE:
896 LOG (llevError, "In client input handling, but into configure state\n"); 875 LOG (llevError, "In client input handling, but into configure state\n");
897 pl->state = ST_PLAYING; 876 ns->state = ST_PLAYING;
898 break; 877 break;
899 878
900 case ST_GET_NAME: 879 case ST_GET_NAME:
901 receive_player_name (pl->ob, 13); 880 receive_player_name (pl->ob, 13);
902 break; 881 break;
903 882
904 case ST_GET_PASSWORD: 883 case ST_GET_PASSWORD:
905 case ST_CONFIRM_PASSWORD: 884 case ST_CONFIRM_PASSWORD:
906 receive_player_password (pl->ob, 13); 885 receive_player_password (pl->ob, 13);
907 break; 886 break;
908 887
909 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 888 case ST_GET_PARTY_PASSWORD: /* Get password for party */
910 receive_party_password (pl->ob, 13); 889 receive_party_password (pl->ob, 13);
911 break; 890 break;
912 891
913 default: 892 default:
914 LOG (llevError, "Unknown input state: %d\n", pl->state); 893 LOG (llevError, "Unknown input state: %d\n", ns->state);
915 } 894 }
916} 895}
917 896
918/** 897/**
919 * Client tells its version. If there is a mismatch, we close the 898 * Client tells its version. If there is a mismatch, we close the
… …
921 * something older than the server. If we assume the client will be 900 * something older than the server. If we assume the client will be
922 * backwards compatible, having it be a later version should not be a 901 * backwards compatible, having it be a later version should not be a
923 * problem. 902 * problem.
924 */ 903 */
925void 904void
926VersionCmd (char *buf, int len, NewSocket * ns) 905VersionCmd (char *buf, int len, client * ns)
927{ 906{
928 char *cp;
929 char version_warning[256];
930
931 if (!buf) 907 if (!buf)
932 { 908 {
933 LOG (llevError, "CS: received corrupted version command\n"); 909 LOG (llevError, "CS: received corrupted version command\n");
934 return; 910 return;
935 } 911 }
936 912
937 ns->cs_version = atoi (buf); 913 ns->cs_version = atoi (buf);
938 ns->sc_version = ns->cs_version; 914 ns->sc_version = ns->cs_version;
915
916 LOG (llevDebug, "connection from client <%s>\n", buf);
917
918
919 //TODO: should log here just for statistics
920
939 if (VERSION_CS != ns->cs_version) 921 //if (VERSION_CS != ns->cs_version)
940 { 922 // unchecked;
941#ifdef ESRV_DEBUG 923
942 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
943#endif
944 }
945 cp = strchr (buf + 1, ' '); 924 char *cp = strchr (buf + 1, ' ');
946 if (!cp) 925 if (!cp)
947 return; 926 return;
927
948 ns->sc_version = atoi (cp); 928 ns->sc_version = atoi (cp);
929
949 if (VERSION_SC != ns->sc_version) 930 //if (VERSION_SC != ns->sc_version)
950 { 931 // unchecked;
951#ifdef ESRV_DEBUG 932
952 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
953#endif
954 }
955 cp = strchr (cp + 1, ' '); 933 cp = strchr (cp + 1, ' ');
934
956 if (cp) 935 if (cp)
957 { 936 {
958 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 937 assign (ns->version, cp + 1);
959 938
960 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1);
961
962 /* This is first implementation - i skip all beta DX clients with it
963 * Add later stuff here for other clients
964 */
965
966 /* these are old dxclients */
967 /* Version 1024 added support for singular + plural name values -
968 * requiing this minimal value reduces complexity of that code, and it
969 * has been around for a long time.
970 */
971 if (ns->sc_version < 1026) 939 if (ns->sc_version < 1026)
972 { 940 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
973 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
974 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 941 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
975 ns->send_packet (version_warning);
976 }
977
978 } 942 }
979} 943}
980 944
981/** sound related functions. */ 945/** sound related functions. */
982
983void 946void
984SetSound (char *buf, int len, NewSocket * ns) 947SetSound (char *buf, int len, client * ns)
985{ 948{
986 ns->sound = atoi (buf); 949 ns->sound = atoi (buf);
987} 950}
988 951
989/** client wants the map resent */ 952/** client wants the map resent */
990 953
991void 954void
992MapRedrawCmd (char *buf, int len, player *pl) 955MapRedrawCmd (char *buf, int len, player *pl)
993{ 956{
994
995/* This function is currently disabled; just clearing the map state results in 957/* This function is currently disabled; just clearing the map state results in
996 * display errors. It should clear the cache and send a newmap command. 958 * display errors. It should clear the cache and send a newmap command.
997 * Unfortunately this solution does not work because some client versions send 959 * Unfortunately this solution does not work because some client versions send
998 * a mapredraw command after receiving a newmap command. 960 * a mapredraw command after receiving a newmap command.
999 */ 961 */
1000#if 0
1001 /* Okay, this is MAJOR UGLY. but the only way I know how to
1002 * clear the "cache"
1003 */
1004 memset (&pl->socket.lastmap, 0, sizeof (struct Map));
1005 draw_client_map (pl->ob);
1006#endif
1007} 962}
1008 963
1009/** 964/**
1010 * Moves an object (typically, container to inventory). 965 * Moves an object (typically, container to inventory).
1011 * syntax is: move (to) (tag) (nrof) 966 * syntax is: move (to) (tag) (nrof)
… …
1014MoveCmd (char *buf, int len, player *pl) 969MoveCmd (char *buf, int len, player *pl)
1015{ 970{
1016 int vals[3], i; 971 int vals[3], i;
1017 972
1018 /* A little funky here. We only cycle for 2 records, because 973 /* A little funky here. We only cycle for 2 records, because
1019 * we obviously am not going to find a space after the third 974 * we obviously are not going to find a space after the third
1020 * record. Perhaps we should just replace this with a 975 * record. Perhaps we should just replace this with a
1021 * sscanf? 976 * sscanf?
1022 */ 977 */
1023 for (i = 0; i < 2; i++) 978 for (i = 0; i < 2; i++)
1024 { 979 {
1025 vals[i] = atoi (buf); 980 vals[i] = atoi (buf);
981
1026 if (!(buf = strchr (buf, ' '))) 982 if (!(buf = strchr (buf, ' ')))
1027 { 983 {
1028 LOG (llevError, "Incomplete move command: %s\n", buf); 984 LOG (llevError, "Incomplete move command: %s\n", buf);
1029 return; 985 return;
1030 } 986 }
987
1031 buf++; 988 buf++;
1032 } 989 }
990
1033 vals[2] = atoi (buf); 991 vals[2] = atoi (buf);
1034 992
1035/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 993/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1036 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 994 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1037} 995}
1038
1039
1040 996
1041/****************************************************************************** 997/******************************************************************************
1042 * 998 *
1043 * Start of commands the server sends to the client. 999 * Start of commands the server sends to the client.
1044 * 1000 *
… …
1047/** 1003/**
1048 * Asks the client to query the user. This way, the client knows 1004 * Asks the client to query the user. This way, the client knows
1049 * it needs to send something back (vs just printing out a message) 1005 * it needs to send something back (vs just printing out a message)
1050 */ 1006 */
1051void 1007void
1052send_query (NewSocket * ns, uint8 flags, char *text) 1008send_query (client *ns, uint8 flags, char *text)
1053{ 1009{
1054 char buf[MAX_BUF];
1055
1056 sprintf (buf, "query %d %s", flags, text ? text : ""); 1010 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1057 ns->send_packet (buf);
1058} 1011}
1059 1012
1060#define AddIfInt64(Old,New,Type) if (Old != New) {\ 1013#define AddIfInt64(Old,New,Type) if (Old != New) {\
1061 Old = New; \ 1014 Old = New; \
1062 sl << uint8 (Type) << uint64 (New); \ 1015 sl << uint8 (Type) << uint64 (New); \
… …
1092esrv_update_stats (player *pl) 1045esrv_update_stats (player *pl)
1093{ 1046{
1094 char buf[MAX_BUF]; 1047 char buf[MAX_BUF];
1095 uint16 flags; 1048 uint16 flags;
1096 1049
1097 packet sl; 1050 packet sl ("stats");
1098 sl << "stats ";
1099 1051
1100 if (pl->ob != NULL) 1052 if (pl->ob)
1101 { 1053 {
1102 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1054 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);
1103 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1055 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);
1104 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1056 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);
1105 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1057 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
… …
1112 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 1064 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX);
1113 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1065 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);
1114 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1066 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1115 } 1067 }
1116 1068
1117 if (pl->socket.exp64) 1069 if (pl->ns->exp64)
1118 {
1119 uint8 s;
1120
1121 for (s = 0; s < NUM_SKILLS; s++) 1070 for (int s = 0; s < NUM_SKILLS; s++)
1122 {
1123 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 1071 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1124 { 1072 {
1125 /* Always send along the level if exp changes. This is only 1073 /* Always send along the level if exp changes. This is only
1126 * 1 extra byte, but keeps processing simpler. 1074 * 1 extra byte, but keeps processing simpler.
1127 */ 1075 */
1128 sl << uint8 (s + CS_STAT_SKILLINFO) 1076 sl << uint8 (s + CS_STAT_SKILLINFO)
1129 << uint8 (pl->last_skill_ob[s]->level) 1077 << uint8 (pl->last_skill_ob[s]->level)
1130 << uint64 (pl->last_skill_ob[s]->stats.exp); 1078 << uint64 (pl->last_skill_ob[s]->stats.exp);
1131 1079
1132 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; 1080 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1133 } 1081 }
1134 }
1135 }
1136 1082
1137 if (pl->socket.exp64) 1083 if (pl->ns->exp64)
1138 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1084 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }
1139 else 1085 else
1140 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } 1086 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1141 1087
1142 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1088 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);
… …
1155 if (pl->run_on) 1101 if (pl->run_on)
1156 flags |= SF_RUNON; 1102 flags |= SF_RUNON;
1157 1103
1158 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1104 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1159 1105
1160 if (pl->socket.sc_version < 1025) 1106 if (pl->ns->sc_version < 1025)
1161 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1107 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1162 else 1108 else
1163 {
1164 int i;
1165
1166 for (i = 0; i < NROFATTACKS; i++) 1109 for (int i = 0; i < NROFATTACKS; i++)
1167 { 1110 {
1168 /* Skip ones we won't send */ 1111 /* Skip ones we won't send */
1169 if (atnr_cs_stat[i] == -1) 1112 if (atnr_cs_stat[i] == -1)
1170 continue; 1113 continue;
1171 1114
1172 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1115 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1173 } 1116 }
1174 }
1175 1117
1176 if (pl->socket.monitor_spells) 1118 if (pl->ns->monitor_spells)
1177 { 1119 {
1178 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1120 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1179 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1121 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
1180 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 1122 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY);
1181 } 1123 }
1182 1124
1183 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 1125 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */
1184 AddIfString (pl->socket.stats.range, buf, CS_STAT_RANGE); 1126 AddIfString (pl->ns->stats.range, buf, CS_STAT_RANGE);
1185 set_title (pl->ob, buf); 1127 set_title (pl->ob, buf);
1186 AddIfString (pl->socket.stats.title, buf, CS_STAT_TITLE); 1128 AddIfString (pl->ns->stats.title, buf, CS_STAT_TITLE);
1187 1129
1188 /* Only send it away if we have some actual data */ 1130 /* Only send it away if we have some actual data */
1189 if (sl.len > 6) 1131 if (sl.length () > 6)
1190 { 1132 pl->ns->send_packet (sl);
1191#ifdef ESRV_DEBUG
1192 LOG (llevDebug, "Sending stats command, %d bytes long.\n", sl.len);
1193#endif
1194 Send_With_Handling (&pl->socket, &sl);
1195 }
1196
1197} 1133}
1198 1134
1199/** 1135/**
1200 * Tells the client that here is a player it should start using. 1136 * Tells the client that here is a player it should start using.
1201 */ 1137 */
1202void 1138void
1203esrv_new_player (player *pl, uint32 weight) 1139esrv_new_player (player *pl, uint32 weight)
1204{ 1140{
1205 pl->last_weight = weight; 1141 pl->last_weight = weight;
1206 1142
1207 packet sl; 1143 packet sl ("player");
1208 sl << "player ";
1209 1144
1210 sl << uint32 (pl->ob->count) 1145 sl << uint32 (pl->ob->count)
1211 << uint32 (weight) 1146 << uint32 (weight)
1212 << uint32 (pl->ob->face->number) 1147 << uint32 (pl->ob->face->number)
1213 << data8 (pl->ob->name); 1148 << data8 (pl->ob->name);
1214 1149
1215 Send_With_Handling (&pl->socket, &sl); 1150 pl->ns->send_packet (sl);
1216 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1151 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1217} 1152}
1218 1153
1219/** 1154/**
1220 * Need to send an animation sequence to the client. 1155 * Need to send an animation sequence to the client.
… …
1222 * sent them the face yet (this can become quite costly in terms of 1157 * sent them the face yet (this can become quite costly in terms of
1223 * how much we are sending - on the other hand, this should only happen 1158 * how much we are sending - on the other hand, this should only happen
1224 * when the player logs in and picks stuff up. 1159 * when the player logs in and picks stuff up.
1225 */ 1160 */
1226void 1161void
1227esrv_send_animation (NewSocket * ns, short anim_num) 1162esrv_send_animation (client * ns, short anim_num)
1228{ 1163{
1229 int i;
1230
1231 /* Do some checking on the anim_num we got. Note that the animations 1164 /* Do some checking on the anim_num we got. Note that the animations
1232 * are added in contigous order, so if the number is in the valid 1165 * are added in contigous order, so if the number is in the valid
1233 * range, it must be a valid animation. 1166 * range, it must be a valid animation.
1234 */ 1167 */
1235 if (anim_num < 0 || anim_num > num_animations) 1168 if (anim_num < 0 || anim_num > num_animations)
1236 { 1169 {
1237 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); 1170 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1238 return; 1171 return;
1239 } 1172 }
1240 1173
1241 packet sl; 1174 packet sl ("anim");
1242 1175
1243 sl << "anim "
1244 << uint16 (anim_num) 1176 sl << uint16 (anim_num)
1245 << uint16 (0); /* flags - not used right now */ 1177 << uint16 (0); /* flags - not used right now */
1246 1178
1247 /* Build up the list of faces. Also, send any information (ie, the 1179 /* Build up the list of faces. Also, send any information (ie, the
1248 * the face itself) down to the client. 1180 * the face itself) down to the client.
1249 */ 1181 */
1250 for (i = 0; i < animations[anim_num].num_animations; i++) 1182 for (int i = 0; i < animations[anim_num].num_animations; i++)
1251 { 1183 {
1252 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1184 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1253 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1185 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1186
1254 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 1187 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1255 } 1188 }
1256 1189
1257 Send_With_Handling (ns, &sl); 1190 ns->send_packet (sl);
1258 1191
1259 ns->anims_sent[anim_num] = 1; 1192 ns->anims_sent[anim_num] = 1;
1260} 1193}
1261 1194
1262 1195
… …
1269/** 1202/**
1270 * This adds face_num to a map cell at x,y. If the client doesn't have 1203 * This adds face_num to a map cell at x,y. If the client doesn't have
1271 * the face yet, we will also send it. 1204 * the face yet, we will also send it.
1272 */ 1205 */
1273static void 1206static void
1274esrv_map_setbelow (NewSocket * ns, int x, int y, short face_num, struct Map *newmap) 1207esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1275{ 1208{
1276 if (newmap->cells[x][y].count >= MAP_LAYERS) 1209 if (newmap->cells[x][y].count >= MAP_LAYERS)
1277 { 1210 {
1211 //TODO: one or the other, can't both have abort and return, verify and act
1278 LOG (llevError, "Too many faces in map cell %d %d\n", x, y); 1212 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1279 return; 1213 return;
1280 abort (); 1214 abort ();
1281 } 1215 }
1282 1216
… …
1284 newmap->cells[x][y].count++; 1218 newmap->cells[x][y].count++;
1285 1219
1286 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1220 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1287 esrv_send_face (ns, face_num, 0); 1221 esrv_send_face (ns, face_num, 0);
1288} 1222}
1289
1290struct LayerCell
1291{
1292 uint16 xy;
1293 short face;
1294};
1295
1296struct MapLayer
1297{
1298 int count;
1299 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1300};
1301
1302/** Checkes if map cells have changed */
1303static int
1304mapcellchanged (NewSocket * ns, int i, int j, struct Map *newmap)
1305{
1306 int k;
1307
1308 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1309 return 1;
1310 for (k = 0; k < newmap->cells[i][j].count; k++)
1311 {
1312 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1313 {
1314 return 1;
1315 }
1316 }
1317 return 0;
1318}
1319
1320/**
1321 * Basically, what this does is pack the data into layers.
1322 * cnum is the client number, cur is the the buffer we put all of
1323 * this data into. we return the end of the data. layers is
1324 * how many layers of data we should back.
1325 */
1326static uint8 *
1327compactlayer (NewSocket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1328{
1329 int x, y, k;
1330 int face;
1331 unsigned char *fcur;
1332 struct MapLayer layers[MAP_LAYERS];
1333
1334 for (k = 0; k < MAP_LAYERS; k++)
1335 layers[k].count = 0;
1336 fcur = cur;
1337 for (x = 0; x < ns->mapx; x++)
1338 {
1339 for (y = 0; y < ns->mapy; y++)
1340 {
1341 if (!mapcellchanged (ns, x, y, newmap))
1342 continue;
1343 if (newmap->cells[x][y].count == 0)
1344 {
1345 *cur = x * ns->mapy + y; /* mark empty space */
1346 cur++;
1347 continue;
1348 }
1349 for (k = 0; k < newmap->cells[x][y].count; k++)
1350 {
1351 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1352 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1353 layers[k].count++;
1354 }
1355 }
1356 }
1357 /* If no data, return now. */
1358 if (fcur == cur && layers[0].count == 0)
1359 return cur;
1360 *cur = 255; /* mark end of explicitly cleared cells */
1361 cur++;
1362 /* First pack by layers. */
1363 for (k = 0; k < numlayers; k++)
1364 {
1365 if (layers[k].count == 0)
1366 break; /* once a layer is entirely empty, no layer below it can
1367 have anything in it either */
1368 /* Pack by entries in thie layer */
1369 for (x = 0; x < layers[k].count;)
1370 {
1371 fcur = cur;
1372 *cur = layers[k].lcells[x].face >> 8;
1373 cur++;
1374 *cur = layers[k].lcells[x].face & 0xFF;
1375 cur++;
1376 face = layers[k].lcells[x].face;
1377 /* Now, we back the redundant data into 1 byte xy pairings */
1378 for (y = x; y < layers[k].count; y++)
1379 {
1380 if (layers[k].lcells[y].face == face)
1381 {
1382 *cur = (uint8) layers[k].lcells[y].xy;
1383 cur++;
1384 layers[k].lcells[y].face = -1;
1385 }
1386 }
1387 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1388 /* forward over the now redundant data */
1389 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1390 x++;
1391 }
1392 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1393 }
1394 return cur;
1395}
1396
1397static void
1398esrv_map_doneredraw (NewSocket * ns, struct Map *newmap)
1399{
1400 static long frames, bytes, tbytes, tframes;
1401 char *cur;
1402
1403 packet sl;
1404 sl << "map ";
1405
1406 cur = (char *) compactlayer (ns, (unsigned char *) sl.buf + sl.len, MAP_LAYERS, newmap);
1407 sl.len = cur - (char *) sl.buf;
1408
1409/* LOG(llevDebug, "Sending map command.\n");*/
1410
1411 if (sl.len > (int) strlen ("map ") || ns->sent_scroll)
1412 {
1413 /* All of this is just accounting stuff */
1414 if (tframes > 100)
1415 tframes = tbytes = 0;
1416
1417 tframes++;
1418 frames++;
1419 tbytes += sl.len;
1420 bytes += sl.len;
1421 memcpy (&ns->lastmap, newmap, sizeof (struct Map));
1422 Send_With_Handling (ns, &sl);
1423 ns->sent_scroll = 0;
1424 }
1425
1426}
1427
1428 1223
1429/** Clears a map cell */ 1224/** Clears a map cell */
1430static void 1225static void
1431map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1226map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
1432{ 1227{
… …
1443#define MAX_LAYERS 3 1238#define MAX_LAYERS 3
1444 1239
1445/* Using a global really isn't a good approach, but saves the over head of 1240/* Using a global really isn't a good approach, but saves the over head of
1446 * allocating and deallocating such a block of data each time run through, 1241 * allocating and deallocating such a block of data each time run through,
1447 * and saves the space of allocating this in the socket object when we only 1242 * and saves the space of allocating this in the socket object when we only
1448 * need it for this cycle. If the serve is ever threaded, this needs to be 1243 * need it for this cycle. If the server is ever threaded, this needs to be
1449 * re-examined. 1244 * re-examined.
1450 */ 1245 */
1451
1452static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1246static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1453 1247
1454/** 1248/**
1455 * Returns true if any of the heads for this 1249 * Returns true if any of the heads for this
1456 * space is set. Returns false if all are blank - this is used 1250 * space is set. Returns false if all are blank - this is used
1457 * for empty space checking. 1251 * for empty space checking.
1458 */ 1252 */
1459static inline int 1253static inline int
1460have_head (int ax, int ay) 1254have_head (int ax, int ay)
1461{ 1255{
1462
1463 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1256 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1464 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) 1257 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1465 return 1; 1258 return 1;
1259
1466 return 0; 1260 return 0;
1467} 1261}
1468 1262
1469/** 1263/**
1470 * check_head is a bit simplistic version of update_space below. 1264 * check_head is a bit simplistic version of update_space below.
1471 * basically, it only checks the that the head on space ax,ay at layer 1265 * basically, it only checks the that the head on space ax,ay at layer
1472 * needs to get sent - if so, it adds the data, sending the head 1266 * needs to get sent - if so, it adds the data, sending the head
1473 * if needed, and returning 1. If this no data needs to get 1267 * if needed, and returning 1. If this no data needs to get
1474 * sent, it returns zero. 1268 * sent, it returns zero.
1475 */ 1269 */
1476static int 1270static int
1477check_head (packet &sl, NewSocket &ns, int ax, int ay, int layer) 1271check_head (packet &sl, client &ns, int ax, int ay, int layer)
1478{ 1272{
1479 short face_num; 1273 short face_num;
1480 1274
1481 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) 1275 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1482 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; 1276 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
… …
1514 * numbers the spaces differently - I think this was a leftover from 1308 * numbers the spaces differently - I think this was a leftover from
1515 * the map command, where the faces stack up. Sinces that is no longer 1309 * the map command, where the faces stack up. Sinces that is no longer
1516 * the case, it seems to make more sense to have these layer values 1310 * the case, it seems to make more sense to have these layer values
1517 * actually match. 1311 * actually match.
1518 */ 1312 */
1519
1520static int 1313static int
1521update_space (packet &sl, NewSocket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1314update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1522{ 1315{
1523 object *ob, *head; 1316 object *ob, *head;
1524 uint16 face_num; 1317 uint16 face_num;
1525 int bx, by, i; 1318 int bx, by, i;
1526 1319
… …
1739 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ 1532 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1740 * take. 1533 * take.
1741 */ 1534 */
1742 1535
1743static inline int 1536static inline int
1744update_smooth (packet &sl, NewSocket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1537update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1745{ 1538{
1746 object *ob; 1539 object *ob;
1747 int smoothlevel; /* old face_num; */ 1540 int smoothlevel; /* old face_num; */
1748 1541
1749 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1542 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
… …
1783 * Returns the size of a data for a map square as returned by 1576 * Returns the size of a data for a map square as returned by
1784 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1577 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1785 * available. 1578 * available.
1786 */ 1579 */
1787int 1580int
1788getExtendedMapInfoSize (NewSocket * ns) 1581getExtendedMapInfoSize (client * ns)
1789{ 1582{
1790 int result = 0; 1583 int result = 0;
1791 1584
1792 if (ns->ext_mapinfos) 1585 if (ns->ext_mapinfos)
1793 { 1586 {
1794 if (ns->EMI_smooth) 1587 if (ns->EMI_smooth)
1795 result += 1; /*One byte for smoothlevel */ 1588 result += 1; /*One byte for smoothlevel */
1796 } 1589 }
1590
1797 return result; 1591 return result;
1798} 1592}
1799 1593
1800/** 1594/**
1801 * This function uses the new map1 protocol command to send the map 1595 * This function uses the new map1 protocol command to send the map
… …
1808 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off 1602 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1809 * maps no sense. Instead, we actually really only use 12 bits for coordinates, 1603 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1810 * and use the other 4 bits for other informatiion. For full documentation 1604 * and use the other 4 bits for other informatiion. For full documentation
1811 * of what we send, see the doc/Protocol file. 1605 * of what we send, see the doc/Protocol file.
1812 * I will describe internally what we do: 1606 * I will describe internally what we do:
1813 * the socket->lastmap shows how the map last looked when sent to the client. 1607 * the ns->lastmap shows how the map last looked when sent to the client.
1814 * in the lastmap structure, there is a cells array, which is set to the 1608 * in the lastmap structure, there is a cells array, which is set to the
1815 * maximum viewable size (As set in config.h). 1609 * maximum viewable size (As set in config.h).
1816 * in the cells, there are faces and a count value. 1610 * in the cells, there are faces and a count value.
1817 * we use the count value to hold the darkness value. If -1, then this space 1611 * we use the count value to hold the darkness value. If -1, then this space
1818 * is not viewable. 1612 * is not viewable.
… …
1829 uint8 eentrysize; 1623 uint8 eentrysize;
1830 uint16 ewhatstart, ewhatflag; 1624 uint16 ewhatstart, ewhatflag;
1831 uint8 extendedinfos; 1625 uint8 extendedinfos;
1832 maptile *m; 1626 maptile *m;
1833 1627
1834 NewSocket &socket = pl->contr->socket; 1628 client &socket = *pl->contr->ns;
1835 1629
1836 check_map_change (pl->contr); 1630 check_map_change (pl->contr);
1837 1631
1838 packet sl; 1632 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1839 packet esl; 1633 packet esl;
1840 1634
1841 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1842 startlen = sl.len; 1635 startlen = sl.length ();
1843 1636
1844 /*Extendedmapinfo structure initialisation */ 1637 /*Extendedmapinfo structure initialisation */
1845 if (socket.ext_mapinfos) 1638 if (socket.ext_mapinfos)
1846 { 1639 {
1847 extendedinfos = EMI_NOREDRAW; 1640 extendedinfos = EMI_NOREDRAW;
1848 1641
1849 if (socket.EMI_smooth) 1642 if (socket.EMI_smooth)
1850 extendedinfos |= EMI_SMOOTH; 1643 extendedinfos |= EMI_SMOOTH;
1851 1644
1852 ewhatstart = esl.len; 1645 ewhatstart = esl.length ();
1853 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit 1646 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1854 could need to be taken away */ 1647 could need to be taken away */
1855 eentrysize = getExtendedMapInfoSize (&socket); 1648 eentrysize = getExtendedMapInfoSize (&socket);
1856 esl << "mapextended " 1649 esl << "mapextended "
1857 << uint8 (extendedinfos) 1650 << uint8 (extendedinfos)
1858 << uint8 (eentrysize); 1651 << uint8 (eentrysize);
1652
1859 estartlen = esl.len; 1653 estartlen = esl.length ();
1860 } 1654 }
1861 else 1655 else
1862 { 1656 {
1863 /* suppress compiler warnings */ 1657 /* suppress compiler warnings */
1864 ewhatstart = 0; 1658 ewhatstart = 0;
… …
1889 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) 1683 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1890 { 1684 {
1891 ax = 0; 1685 ax = 0;
1892 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1686 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1893 { 1687 {
1894
1895 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1688 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1896 1689
1897 /* If this space is out of the normal viewable area, we only check 1690 /* If this space is out of the normal viewable area, we only check
1898 * the heads value ax or ay will only be greater than what 1691 * the heads value ax or ay will only be greater than what
1899 * the client wants if using the map1a command - this is because 1692 * the client wants if using the map1a command - this is because
… …
1902 */ 1695 */
1903 if (ax >= socket.mapx || ay >= socket.mapy) 1696 if (ax >= socket.mapx || ay >= socket.mapy)
1904 { 1697 {
1905 int i, got_one; 1698 int i, got_one;
1906 1699
1907 oldlen = sl.len; 1700 oldlen = sl.length ();
1908 1701
1909 sl << uint16 (mask); 1702 sl << uint16 (mask);
1910 1703
1911 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4; 1704 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1912 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2; 1705 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
… …
1916 * actually need to send that - just the coordinates 1709 * actually need to send that - just the coordinates
1917 * with no faces tells the client to blank out the 1710 * with no faces tells the client to blank out the
1918 * space. 1711 * space.
1919 */ 1712 */
1920 got_one = 0; 1713 got_one = 0;
1921 for (i = oldlen + 2; i < sl.len; i++) 1714 for (i = oldlen + 2; i < sl.length (); i++)
1922 if (sl.buf[i]) 1715 if (sl[i])
1923 got_one = 1; 1716 got_one = 1;
1924 1717
1925 if (got_one && (mask & 0xf)) 1718 if (got_one && (mask & 0xf))
1926 sl.buf[oldlen + 1] = mask & 0xff; 1719 sl[oldlen + 1] = mask & 0xff;
1927 else 1720 else
1928 { /*either all faces blank, either no face at all */ 1721 { /*either all faces blank, either no face at all */
1929 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */ 1722 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1930 sl.len = oldlen + 2; 1723 sl.reset (oldlen + 2);
1931 else 1724 else
1932 sl.len = oldlen; 1725 sl.reset (oldlen);
1933 } 1726 }
1934 1727
1935 /*What concerns extendinfos, nothing to be done for now 1728 /*What concerns extendinfos, nothing to be done for now
1936 * (perhaps effects layer later) 1729 * (perhaps effects layer later)
1937 */ 1730 */
… …
1967 1760
1968 /* This block deals with spaces that are not visible for whatever 1761 /* This block deals with spaces that are not visible for whatever
1969 * reason. Still may need to send the head for this space. 1762 * reason. Still may need to send the head for this space.
1970 */ 1763 */
1971 1764
1972 oldlen = sl.len; 1765 oldlen = sl.length ();
1973 1766
1974 sl << uint16 (mask); 1767 sl << uint16 (mask);
1975 1768
1976 if (lastcell.count != -1) 1769 if (lastcell.count != -1)
1977 need_send = 1; 1770 need_send = 1;
… …
1997 1790
1998 map_clearcell (&lastcell, 0, 0, 0, count); 1791 map_clearcell (&lastcell, 0, 0, 0, count);
1999 } 1792 }
2000 1793
2001 if ((mask & 0xf) || need_send) 1794 if ((mask & 0xf) || need_send)
2002 sl.buf[oldlen + 1] = mask & 0xff; 1795 sl[oldlen + 1] = mask & 0xff;
2003 else 1796 else
2004 sl.len = oldlen; 1797 sl.reset (oldlen);
2005 } 1798 }
2006 else 1799 else
2007 { 1800 {
2008 /* In this block, the space is visible or there are head objects 1801 /* In this block, the space is visible or there are head objects
2009 * we need to send. 1802 * we need to send.
… …
2011 1804
2012 /* Rather than try to figure out what everything that we might 1805 /* Rather than try to figure out what everything that we might
2013 * need to send is, then form the packet after that, 1806 * need to send is, then form the packet after that,
2014 * we presume that we will in fact form a packet, and update 1807 * we presume that we will in fact form a packet, and update
2015 * the bits by what we do actually send. If we send nothing, 1808 * the bits by what we do actually send. If we send nothing,
2016 * we just back out sl.len to the old value, and no harm 1809 * we just back out sl.length () to the old value, and no harm
2017 * is done. 1810 * is done.
2018 * I think this is simpler than doing a bunch of checks to see 1811 * I think this is simpler than doing a bunch of checks to see
2019 * what if anything we need to send, setting the bits, then 1812 * what if anything we need to send, setting the bits, then
2020 * doing those checks again to add the real data. 1813 * doing those checks again to add the real data.
2021 */ 1814 */
2022 oldlen = sl.len; 1815 oldlen = sl.length ();
2023 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1816 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2024 eoldlen = esl.len; 1817 eoldlen = esl.length ();
2025 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1818 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2026 sl << uint16 (mask); 1819 sl << uint16 (mask);
2027 1820
2028 if (socket.ext_mapinfos) 1821 if (socket.ext_mapinfos)
2029 esl << uint16 (emask); 1822 esl << uint16 (emask);
… …
2037 mask |= 0x8; 1830 mask |= 0x8;
2038 1831
2039 if (socket.extmap) 1832 if (socket.extmap)
2040 { 1833 {
2041 *last_ext |= 0x80; 1834 *last_ext |= 0x80;
2042 last_ext = sl.buf + sl.len; 1835 last_ext = &sl[sl.length ()];
2043 sl << uint8 (d); 1836 sl << uint8 (d);
2044 } 1837 }
2045 else 1838 else
2046 sl << uint8 (255 - 64 * d); 1839 sl << uint8 (255 - 64 * d);
2047 } 1840 }
… …
2081 { 1874 {
2082 lastcell.stat_hp = stat_hp; 1875 lastcell.stat_hp = stat_hp;
2083 1876
2084 mask |= 0x8; 1877 mask |= 0x8;
2085 *last_ext |= 0x80; 1878 *last_ext |= 0x80;
2086 last_ext = sl.buf + sl.len; 1879 last_ext = &sl[sl.length ()];
2087 1880
2088 sl << uint8 (5) << uint8 (stat_hp); 1881 sl << uint8 (5) << uint8 (stat_hp);
2089 1882
2090 if (stat_width > 1) 1883 if (stat_width > 1)
2091 { 1884 {
2092 *last_ext |= 0x80; 1885 *last_ext |= 0x80;
2093 last_ext = sl.buf + sl.len; 1886 last_ext = &sl[sl.length ()];
2094 1887
2095 sl << uint8 (6) << uint8 (stat_width); 1888 sl << uint8 (6) << uint8 (stat_width);
2096 } 1889 }
2097 } 1890 }
2098 1891
… …
2100 { 1893 {
2101 lastcell.player = player; 1894 lastcell.player = player;
2102 1895
2103 mask |= 0x8; 1896 mask |= 0x8;
2104 *last_ext |= 0x80; 1897 *last_ext |= 0x80;
2105 last_ext = sl.buf + sl.len; 1898 last_ext = &sl[sl.length ()];
2106 1899
2107 sl << uint8 (0x47) << uint8 (8) << (uint64)player; 1900 sl << uint8 (0x47) << uint8 (8) << (uint64)player;
2108 } 1901 }
2109 1902
2110 if (lastcell.flags != flags) 1903 if (lastcell.flags != flags)
2111 { 1904 {
2112 lastcell.flags = flags; 1905 lastcell.flags = flags;
2113 1906
2114 mask |= 0x8; 1907 mask |= 0x8;
2115 *last_ext |= 0x80; 1908 *last_ext |= 0x80;
2116 last_ext = sl.buf + sl.len; 1909 last_ext = &sl[sl.length ()];
2117 1910
2118 sl << uint8 (8) << uint8 (flags); 1911 sl << uint8 (8) << uint8 (flags);
2119 } 1912 }
2120 } 1913 }
2121 1914
… …
2163 * space by checking the mask. If so, update the mask. 1956 * space by checking the mask. If so, update the mask.
2164 * if not, reset the len to that from before adding the mask 1957 * if not, reset the len to that from before adding the mask
2165 * value, so we don't send those bits. 1958 * value, so we don't send those bits.
2166 */ 1959 */
2167 if (mask & 0xf) 1960 if (mask & 0xf)
2168 sl.buf[oldlen + 1] = mask & 0xff; 1961 sl[oldlen + 1] = mask & 0xff;
2169 else 1962 else
2170 sl.len = oldlen; 1963 sl.reset (oldlen);
2171 1964
2172 if (emask & 0xf) 1965 if (emask & 0xf)
2173 esl.buf[eoldlen + 1] = emask & 0xff; 1966 esl[eoldlen + 1] = emask & 0xff;
2174 else 1967 else
2175 esl.len = eoldlen; 1968 esl.reset (eoldlen);
2176 } /* else this is a viewable space */ 1969 } /* else this is a viewable space */
2177 } /* for x loop */ 1970 } /* for x loop */
2178 } /* for y loop */ 1971 } /* for y loop */
2179 1972
2180 /* Verify that we in fact do need to send this */ 1973 /* Verify that we in fact do need to send this */
2181 if (socket.ext_mapinfos) 1974 if (socket.ext_mapinfos)
2182 { 1975 {
2183 if (!(sl.len > startlen || socket.sent_scroll)) 1976 if (!(sl.length () > startlen || socket.sent_scroll))
2184 { 1977 {
2185 /* No map data will follow, so don't say the client 1978 /* No map data will follow, so don't say the client
2186 * it doesn't need draw! 1979 * it doesn't need draw!
2187 */ 1980 */
2188 ewhatflag &= (~EMI_NOREDRAW); 1981 ewhatflag &= (~EMI_NOREDRAW);
2189 esl.buf[ewhatstart + 1] = ewhatflag & 0xff; 1982 esl[ewhatstart + 1] = ewhatflag & 0xff;
2190 } 1983 }
2191 1984
2192 if (esl.len > estartlen) 1985 if (esl.length () > estartlen)
2193 Send_With_Handling (&socket, &esl); 1986 socket.send_packet (esl);
2194 } 1987 }
2195 1988
2196 if (sl.len > startlen || socket.sent_scroll) 1989 if (sl.length () > startlen || socket.sent_scroll)
2197 { 1990 {
2198 Send_With_Handling (&socket, &sl); 1991 socket.send_packet (sl);
2199 socket.sent_scroll = 0; 1992 socket.sent_scroll = 0;
2200 } 1993 }
2201} 1994}
2202 1995
2203/** 1996/**
… …
2229 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 2022 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2230 return; 2023 return;
2231 2024
2232 memset (&newmap, 0, sizeof (struct Map)); 2025 memset (&newmap, 0, sizeof (struct Map));
2233 2026
2234 for (j = (pl->y - pl->contr->socket.mapy / 2); j < (pl->y + (pl->contr->socket.mapy + 1) / 2); j++) 2027 for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)
2235 {
2236 for (i = (pl->x - pl->contr->socket.mapx / 2); i < (pl->x + (pl->contr->socket.mapx + 1) / 2); i++) 2028 for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)
2237 { 2029 {
2238 ax = i; 2030 ax = i;
2239 ay = j; 2031 ay = j;
2240 m = pm; 2032 m = pm;
2241 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2033 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2034
2242 if (mflags & P_OUT_OF_MAP) 2035 if (mflags & P_OUT_OF_MAP)
2243 continue; 2036 continue;
2244 if (mflags & P_NEED_UPDATE) 2037
2245 update_position (m, ax, ay);
2246 /* If a map is visible to the player, we don't want to swap it out 2038 /* If a map is visible to the player, we don't want to swap it out
2247 * just to reload it. This should really call something like 2039 * just to reload it. This should really call something like
2248 * swap_map, but this is much more efficient and 'good enough' 2040 * swap_map, but this is much more efficient and 'good enough'
2249 */ 2041 */
2250 if (mflags & P_NEW_MAP) 2042 if (mflags & P_NEW_MAP)
2251 m->timeout = 50; 2043 m->timeout = 50;
2252 } 2044 }
2253 } 2045
2254 /* do LOS after calls to update_position */ 2046 /* do LOS after calls to update_position */
2255 if (pl->contr->do_los) 2047 if (pl->contr->do_los)
2256 { 2048 {
2257 update_los (pl); 2049 update_los (pl);
2258 pl->contr->do_los = 0; 2050 pl->contr->do_los = 0;
2259 } 2051 }
2260 2052
2261 if (pl->contr->socket.mapmode == Map1Cmd || pl->contr->socket.mapmode == Map1aCmd)
2262 {
2263 /* Big maps need a different drawing mechanism to work */ 2053 /* Big maps need a different drawing mechanism to work */
2264 draw_client_map1 (pl); 2054 draw_client_map1 (pl);
2265 return;
2266 }
2267
2268 if (pl->invisible & (pl->invisible < 50 ? 4 : 1))
2269 {
2270 esrv_map_setbelow (&pl->contr->socket, pl->contr->socket.mapx / 2, pl->contr->socket.mapy / 2, pl->face->number, &newmap);
2271 }
2272
2273 /* j and i are the y and x coordinates of the real map (which is
2274 * basically some number of spaces around the player)
2275 * ax and ay are values from within the viewport (ie, 0, 0 is upper
2276 * left corner) and are thus disconnected from the map values.
2277 * Subtract 1 from the max values so that we properly handle cases where
2278 * player has specified an even map. Otherwise, we try to send them too
2279 * much, ie, if mapx is 10, we would try to send from -5 to 5, which is actually
2280 * 11 spaces. Now, we would send from -5 to 4, which is properly. If mapx is
2281 * odd, this still works fine.
2282 */
2283 ay = 0;
2284 for (j = pl->y - pl->contr->socket.mapy / 2; j <= pl->y + (pl->contr->socket.mapy - 1) / 2; j++, ay++)
2285 {
2286 ax = 0;
2287 for (i = pl->x - pl->contr->socket.mapx / 2; i <= pl->x + (pl->contr->socket.mapx - 1) / 2; i++, ax++)
2288 {
2289
2290 d = pl->contr->blocked_los[ax][ay];
2291 /* note the out_of_map and d>3 checks are both within the same
2292 * negation check.
2293 */
2294 nx = i;
2295 ny = j;
2296 m = get_map_from_coord (pm, &nx, &ny);
2297 if (m && d < 4)
2298 {
2299 face = GET_MAP_FACE (m, nx, ny, 0);
2300 floor2 = GET_MAP_FACE (m, nx, ny, 1);
2301 floor = GET_MAP_FACE (m, nx, ny, 2);
2302
2303 /* If all is blank, send a blank face. */
2304 if ((!face || face == blank_face) && (!floor2 || floor2 == blank_face) && (!floor || floor == blank_face))
2305 {
2306 esrv_map_setbelow (&pl->contr->socket, ax, ay, blank_face->number, &newmap);
2307 }
2308 else
2309 { /* actually have something interesting */
2310 /* send the darkness mask, if any. */
2311 if (d && pl->contr->socket.darkness)
2312 esrv_map_setbelow (&pl->contr->socket, ax, ay, dark_faces[d - 1]->number, &newmap);
2313
2314 if (face && face != blank_face)
2315 esrv_map_setbelow (&pl->contr->socket, ax, ay, face->number, &newmap);
2316 if (floor2 && floor2 != blank_face)
2317 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor2->number, &newmap);
2318 if (floor && floor != blank_face)
2319 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor->number, &newmap);
2320 }
2321 } /* Is a valid space */
2322 }
2323 }
2324
2325 esrv_map_doneredraw (&pl->contr->socket, &newmap);
2326
2327 check_map_change (pl->contr);
2328} 2055}
2329 2056
2330 2057
2331/*****************************************************************************/ 2058/*****************************************************************************/
2332 2059
… …
2338 2065
2339/*****************************************************************************/ 2066/*****************************************************************************/
2340void 2067void
2341send_plugin_custom_message (object *pl, char *buf) 2068send_plugin_custom_message (object *pl, char *buf)
2342{ 2069{
2343 pl->contr->socket.send_packet (buf); 2070 pl->contr->ns->send_packet (buf);
2344} 2071}
2345 2072
2346/** 2073/**
2347 * This sends the skill number to name mapping. We ignore 2074 * This sends the skill number to name mapping. We ignore
2348 * the params - we always send the same info no matter what. 2075 * the params - we always send the same info no matter what.
2349 */ 2076 */
2350void 2077void
2351send_skill_info (NewSocket *ns, char *params) 2078send_skill_info (client *ns, char *params)
2352{ 2079{
2353 packet sl; 2080 packet sl;
2354 sl << "replyinfo skill_info\n"; 2081 sl << "replyinfo skill_info\n";
2355 2082
2356 for (int i = 1; i < NUM_SKILLS; i++) 2083 for (int i = 1; i < NUM_SKILLS; i++)
2357 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); 2084 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
2358 2085
2359 if (sl.len >= MAXSOCKBUF) 2086 if (sl.length () >= MAXSOCKBUF)
2360 { 2087 {
2361 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 2088 LOG (llevError, "Buffer overflow in send_skill_info!\n");
2362 fatal (0); 2089 fatal (0);
2363 } 2090 }
2364 2091
2365 Send_With_Handling (ns, &sl); 2092 ns->send_packet (sl);
2366} 2093}
2367 2094
2368/** 2095/**
2369 * This sends the spell path to name mapping. We ignore 2096 * This sends the spell path to name mapping. We ignore
2370 * the params - we always send the same info no matter what. 2097 * the params - we always send the same info no matter what.
2371 */ 2098 */
2372void 2099void
2373send_spell_paths (NewSocket * ns, char *params) 2100send_spell_paths (client * ns, char *params)
2374{ 2101{
2375 packet sl; 2102 packet sl;
2376 2103
2377 sl << "replyinfo spell_paths\n"; 2104 sl << "replyinfo spell_paths\n";
2378 2105
2379 for (int i = 0; i < NRSPELLPATHS; i++) 2106 for (int i = 0; i < NRSPELLPATHS; i++)
2380 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); 2107 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
2381 2108
2382 if (sl.len >= MAXSOCKBUF) 2109 if (sl.length () >= MAXSOCKBUF)
2383 { 2110 {
2384 LOG (llevError, "Buffer overflow in send_spell_paths!\n"); 2111 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
2385 fatal (0); 2112 fatal (0);
2386 } 2113 }
2387 2114
2388 Send_With_Handling (ns, &sl); 2115 ns->send_packet (sl);
2389} 2116}
2390 2117
2391/** 2118/**
2392 * This looks for any spells the player may have that have changed their stats. 2119 * This looks for any spells the player may have that have changed their stats.
2393 * it then sends an updspell packet for each spell that has changed in this way 2120 * it then sends an updspell packet for each spell that has changed in this way
2394 */ 2121 */
2395void 2122void
2396esrv_update_spells (player *pl) 2123esrv_update_spells (player *pl)
2397{ 2124{
2398 if (!pl->socket.monitor_spells) 2125 if (!pl->ns->monitor_spells)
2399 return; 2126 return;
2400 2127
2401 for (object *spell = pl->ob->inv; spell; spell = spell->below) 2128 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2402 { 2129 {
2403 if (spell->type == SPELL) 2130 if (spell->type == SPELL)
… …
2433 2160
2434 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 2161 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2435 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 2162 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2436 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 2163 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2437 2164
2438 Send_With_Handling (&pl->socket, &sl); 2165 pl->ns->send_packet (sl);
2439 } 2166 }
2440 } 2167 }
2441 } 2168 }
2442} 2169}
2443 2170
2444void 2171void
2445esrv_remove_spell (player *pl, object *spell) 2172esrv_remove_spell (player *pl, object *spell)
2446{ 2173{
2447 if (!pl->socket.monitor_spells) 2174 if (!pl->ns->monitor_spells)
2448 return; 2175 return;
2449 2176
2450 if (!pl || !spell || spell->env != pl->ob) 2177 if (!pl || !spell || spell->env != pl->ob)
2451 { 2178 {
2452 LOG (llevError, "Invalid call to esrv_remove_spell"); 2179 LOG (llevError, "Invalid call to esrv_remove_spell");
2453 return; 2180 return;
2454 } 2181 }
2455 2182
2456 packet sl; 2183 packet sl ("delspell");
2457 2184
2458 sl << "delspell "
2459 << uint32 (spell->count); 2185 sl << uint32 (spell->count);
2460 2186
2461 Send_With_Handling (&pl->socket, &sl); 2187 pl->ns->send_packet (sl);
2462} 2188}
2463 2189
2464/* appends the spell *spell to the Socklist we will send the data to. */ 2190/* appends the spell *spell to the Socklist we will send the data to. */
2465static void 2191static void
2466append_spell (player *pl, packet &sl, object *spell) 2192append_spell (player *pl, packet &sl, object *spell)
… …
2514 { 2240 {
2515 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); 2241 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2516 return; 2242 return;
2517 } 2243 }
2518 2244
2519 if (!pl->socket.monitor_spells) 2245 if (!pl->ns->monitor_spells)
2520 return; 2246 return;
2521 2247
2522 packet sl; 2248 packet sl ("addspell");
2523
2524 sl << "addspell ";
2525 2249
2526 if (!spell) 2250 if (!spell)
2527 { 2251 {
2528 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2252 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
2529 { 2253 {
… …
2541 * like it will fix this 2265 * like it will fix this
2542 */ 2266 */
2543 if (spell->type != SPELL) 2267 if (spell->type != SPELL)
2544 continue; 2268 continue;
2545 2269
2546 if (sl.len >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 2270 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2547 { 2271 {
2548 Send_With_Handling (&pl->socket, &sl); 2272 pl->ns->send_packet (sl);
2549 strcpy ((char *) sl.buf, "addspell "); 2273
2550 sl.len = strlen ((char *) sl.buf); 2274 sl.reset ();
2275 sl << "addspell ";
2551 } 2276 }
2552 2277
2553 append_spell (pl, sl, spell); 2278 append_spell (pl, sl, spell);
2554 } 2279 }
2555 } 2280 }
… …
2566 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 2291 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2567 fatal (0); 2292 fatal (0);
2568 } 2293 }
2569 2294
2570 /* finally, we can send the packet */ 2295 /* finally, we can send the packet */
2571 Send_With_Handling (&pl->socket, &sl); 2296 pl->ns->send_packet (sl);
2572
2573} 2297}
2574 2298

Diff Legend

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