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

Diff Legend

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