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.35 by root, Thu Dec 14 02:37:37 2006 UTC vs.
Revision 1.45 by root, Tue Dec 19 04:58:05 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 */ 43 */
47 44
48#include <global.h> 45#include <global.h>
49#include <sproto.h> 46#include <sproto.h>
50 47
51#include <newclient.h>
52#include <newserver.h>
53#include <living.h> 48#include <living.h>
54#include <commands.h> 49#include <commands.h>
55 50
56/* 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,
57 * it should work here. 52 * it should work here.
… …
60#include <sys/time.h> 55#include <sys/time.h>
61#include <sys/socket.h> 56#include <sys/socket.h>
62#include <netinet/in.h> 57#include <netinet/in.h>
63#include <netdb.h> 58#include <netdb.h>
64 59
65#ifdef HAVE_UNISTD_H
66# include <unistd.h> 60#include <unistd.h>
67#endif
68
69#ifdef HAVE_SYS_TIME_H
70# include <sys/time.h> 61#include <sys/time.h>
71#endif
72 62
73#include "sounds.h" 63#include "sounds.h"
74 64
75/** 65/**
76 * This table translates the attack numbers as used within the 66 * This table translates the attack numbers as used within the
… …
93 -1, /* life stealing */ 83 -1, /* life stealing */
94 -1 /* Disease - not fully done yet */ 84 -1 /* Disease - not fully done yet */
95}; 85};
96 86
97static void 87static void
98socket_map_scroll (client_socket * ns, int dx, int dy) 88socket_map_scroll (client *ns, int dx, int dy)
99{ 89{
100 struct Map newmap; 90 struct Map newmap;
101 int x, y, mx, my; 91 int x, y, mx, my;
102 92
103 {
104 packet sl;
105
106 sl.printf ("map_scroll %d %d", dx, dy); 93 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
107 ns->send_packet (sl);
108 }
109 94
110 /* If we are using the Map1aCmd, we may in fact send 95 /* If we are using the Map1aCmd, we may in fact send
111 * head information that is outside the viewable map. 96 * head information that is outside the viewable map.
112 * 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
113 * look for. Removed code to do so - it caused extra 98 * look for. Removed code to do so - it caused extra
… …
153} 138}
154 139
155static void 140static void
156clear_map (player *pl) 141clear_map (player *pl)
157{ 142{
158 client_socket & socket = pl->socket; 143 client &socket = *pl->socket;
159 144
160 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 145 memset (&socket.lastmap, 0, sizeof (socket.lastmap));
161 146
162 if (socket.newmapcmd == 1) 147 if (socket.newmapcmd == 1)
163 socket.send_packet ("newmap"); 148 socket.send_packet ("newmap");
… …
168 153
169/** check for map change and send new map data */ 154/** check for map change and send new map data */
170static void 155static void
171check_map_change (player *pl) 156check_map_change (player *pl)
172{ 157{
173 client_socket & socket = pl->socket; 158 client &socket = *pl->socket;
174 object *ob = pl->ob; 159 object *ob = pl->ob;
175 char buf[MAX_BUF]; /* eauugggh */ 160 char buf[MAX_BUF]; /* eauugggh */
176 161
177 if (socket.current_map != ob->map) 162 if (socket.current_map != ob->map)
178 { 163 {
… …
221 206
222 socket.current_x = ob->x; 207 socket.current_x = ob->x;
223 socket.current_y = ob->y; 208 socket.current_y = ob->y;
224} 209}
225 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
226void 255void
227ExtCmd (char *buf, int len, player *pl) 256ExtCmd (char *buf, int len, player *pl)
228{ 257{
229 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 258 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
259}
260
261void
262ExtiCmd (char *buf, int len, client *ns)
263{
264 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
230} 265}
231 266
232void 267void
233MapInfoCmd (char *buf, int len, player *pl) 268MapInfoCmd (char *buf, int len, player *pl)
234{ 269{
… …
249 buf += 8; 284 buf += 8;
250 285
251 // initial map and its origin 286 // initial map and its origin
252 maptile *map = pl->ob->map; 287 maptile *map = pl->ob->map;
253 sint16 dx, dy; 288 sint16 dx, dy;
254 int mapx = pl->socket.mapx / 2 - pl->ob->x; 289 int mapx = pl->socket->mapx / 2 - pl->ob->x;
255 int mapy = pl->socket.mapy / 2 - pl->ob->y; 290 int mapy = pl->socket->mapy / 2 - pl->ob->y;
256 int max_distance = 8; // limit maximum path length to something generous 291 int max_distance = 8; // limit maximum path length to something generous
257 292
258 while (*buf && map && max_distance) 293 while (*buf && map && max_distance)
259 { 294 {
260 int dir = *buf++; 295 int dir = *buf++;
… …
311 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 346 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
312 } 347 }
313 else 348 else
314 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 349 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
315 350
316 pl->socket.send_packet (bigbuf); 351 pl->socket->send_packet (bigbuf);
317} 352}
318 353
319/** This is the Setup cmd - easy first implementation */ 354/** This is the Setup cmd - easy first implementation */
320void 355void
321SetUp (char *buf, int len, client_socket * ns) 356SetUp (char *buf, int len, client * ns)
322{ 357{
323 int s, slen; 358 int s, slen;
324 char *cmd, *param, cmdback[HUGE_BUF]; 359 char *cmd, *param, cmdback[HUGE_BUF];
325 360
326 /* run through the cmds of setup 361 /* run through the cmds of setup
… …
536 * This is what takes care of it. We tell the client how things worked out. 571 * This is what takes care of it. We tell the client how things worked out.
537 * I am not sure if this file is the best place for this function. however, 572 * I am not sure if this file is the best place for this function. however,
538 * it either has to be here or init_sockets needs to be exported. 573 * it either has to be here or init_sockets needs to be exported.
539 */ 574 */
540void 575void
541AddMeCmd (char *buf, int len, client_socket * ns) 576AddMeCmd (char *buf, int len, client * ns)
542{ 577{
543 Settings oldsettings;
544
545 oldsettings = settings;
546 if (ns->status != Ns_Add || add_player (ns)) 578 if (ns->status != Ns_Add || add_player (ns))
547 ns->send_packet ("addme_failed"); 579 ns->send_packet ("addme_failed");
548 else 580 else
549 {
550 /* Basically, the add_player copies the socket structure into
551 * the player structure, so this one (which is from init_sockets)
552 * is not needed anymore. The write below should still work, as the
553 * stuff in ns is still relevant.
554 */
555 ns->send_packet ("addme_success"); 581 ns->send_packet ("addme_success");
556 socket_info.nconns--;
557 ns->status = Ns_Avail;
558 }
559
560 settings = oldsettings;
561} 582}
562 583
563/** Reply to ExtendedInfos command */ 584/** Reply to ExtendedInfos command */
564void 585void
565ToggleExtendedInfos (char *buf, int len, client_socket * ns) 586ToggleExtendedInfos (char *buf, int len, client * ns)
566{ 587{
567 char cmdback[MAX_BUF]; 588 char cmdback[MAX_BUF];
568 char command[50]; 589 char command[50];
569 int info, nextinfo; 590 int info, nextinfo;
570 591
… …
621#define MSG_TYPE_MONUMENT 5 642#define MSG_TYPE_MONUMENT 5
622#define MSG_TYPE_SCRIPTED_DIALOG 6*/ 643#define MSG_TYPE_SCRIPTED_DIALOG 6*/
623 644
624/** Reply to ExtendedInfos command */ 645/** Reply to ExtendedInfos command */
625void 646void
626ToggleExtendedText (char *buf, int len, client_socket * ns) 647ToggleExtendedText (char *buf, int len, client * ns)
627{ 648{
628 char cmdback[MAX_BUF]; 649 char cmdback[MAX_BUF];
629 char temp[10]; 650 char temp[10];
630 char command[50]; 651 char command[50];
631 int info, nextinfo, i, flag; 652 int info, nextinfo, i, flag;
… …
682 * a piece of data from us that we know the client wants. So 703 * a piece of data from us that we know the client wants. So
683 * if we know the client wants it, might as well push it to the 704 * if we know the client wants it, might as well push it to the
684 * client. 705 * client.
685 */ 706 */
686static void 707static void
687SendSmooth (client_socket * ns, uint16 face) 708SendSmooth (client *ns, uint16 face)
688{ 709{
689 uint16 smoothface; 710 uint16 smoothface;
690 711
691 /* If we can't find a face, return and set it so we won't try to send this 712 /* If we can't find a face, return and set it so we won't try to send this
692 * again. 713 * again.
… …
708 729
709 sl << "smooth " 730 sl << "smooth "
710 << uint16 (face) 731 << uint16 (face)
711 << uint16 (smoothface); 732 << uint16 (smoothface);
712 733
713 Send_With_Handling (ns, &sl); 734 ns->send_packet (sl);
714} 735}
715 736
716 /** 737 /**
717 * Tells client the picture it has to use 738 * Tells client the picture it has to use
718 * to smooth a picture number given as argument. 739 * to smooth a picture number given as argument.
719 */ 740 */
720void 741void
721AskSmooth (char *buf, int len, client_socket * ns) 742AskSmooth (char *buf, int len, client *ns)
722{ 743{
723 uint16 facenbr; 744 SendSmooth (ns, atoi (buf));
724
725 facenbr = atoi (buf);
726 SendSmooth (ns, facenbr);
727} 745}
728 746
729/** 747/**
730 * This handles the general commands from the client (ie, north, fire, cast, 748 * This handles the general commands from the client (ie, north, fire, cast,
731 * etc.) 749 * etc.)
732 */ 750 */
733void 751void
734PlayerCmd (char *buf, int len, player *pl) 752PlayerCmd (char *buf, int len, player *pl)
735{ 753{
736
737 /* The following should never happen with a proper or honest client.
738 * Therefore, the error message doesn't have to be too clear - if
739 * someone is playing with a hacked/non working client, this gives them
740 * an idea of the problem, but they deserve what they get
741 */
742 if (pl->state != ST_PLAYING)
743 {
744 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
745 return;
746 }
747 /* Check if there is a count. In theory, a zero count could also be 754 /* Check if there is a count. In theory, a zero count could also be
748 * sent, so check for that also. 755 * sent, so check for that also.
749 */ 756 */
750 if (atoi (buf) || buf[0] == '0') 757 if (atoi (buf) || buf[0] == '0')
751 { 758 {
752 pl->count = atoi ((char *) buf); 759 pl->count = atoi ((char *) buf);
760
753 buf = strchr (buf, ' '); /* advance beyond the numbers */ 761 buf = strchr (buf, ' '); /* advance beyond the numbers */
754 if (!buf) 762 if (!buf)
755 {
756#ifdef ESRV_DEBUG
757 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
758#endif
759 return; 763 return;
760 } 764
761 buf++; 765 buf++;
762 } 766 }
763 /* This should not happen anymore. */ 767
764 if (pl->ob->speed_left < -1.0)
765 {
766 LOG (llevError, "Player has negative time - shouldn't do command.\n");
767 }
768 /* In c_new.c */
769 execute_newserver_command (pl->ob, (char *) buf); 768 execute_newserver_command (pl->ob, (char *) buf);
769
770 /* Perhaps something better should be done with a left over count. 770 /* Perhaps something better should be done with a left over count.
771 * Cleaning up the input should probably be done first - all actions 771 * Cleaning up the input should probably be done first - all actions
772 * for the command that issued the count should be done before any other 772 * for the command that issued the count should be done before any other
773 * commands. 773 * commands.
774 */ 774 */
775
776 pl->count = 0; 775 pl->count = 0;
777
778} 776}
779 777
780 778
781/** 779/**
782 * This handles the general commands from the client (ie, north, fire, cast, 780 * This handles the general commands from the client (ie, north, fire, cast,
783 * etc.). It is a lot like PlayerCmd above, but is called with the 781 * etc.). It is a lot like PlayerCmd above, but is called with the
784 * 'ncom' method which gives more information back to the client so it 782 * 'ncom' method which gives more information back to the client so it
785 * can throttle. 783 * can throttle.
786 */ 784 */
787void 785void
788NewPlayerCmd (uint8 * buf, int len, player *pl) 786NewPlayerCmd (char *buf, int len, player *pl)
789{ 787{
790 int time, repeat;
791 char command[MAX_BUF];
792 int pktlen;
793
794 if (len < 7) 788 if (len <= 6)
795 { 789 {
796 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 790 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
797 return; 791 return;
798 } 792 }
799 793
800 pktlen = net_uint16 (buf); 794 uint16 cmdid = net_uint16 ((uint8 *)buf);
801 repeat = net_uint32 (buf + 2); 795 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
802 796
803 /* -1 is special - no repeat, but don't update */ 797 /* -1 is special - no repeat, but don't update */
804 if (repeat != -1) 798 if (repeat != -1)
805 pl->count = repeat; 799 pl->count = repeat;
806 800
807 if ((len - 4) >= MAX_BUF) 801 buf += 6; //len -= 6;
808 len = MAX_BUF - 5;
809 802
810 strncpy ((char *) command, (char *) buf + 6, len - 4);
811 command[len - 4] = '\0';
812
813 /* The following should never happen with a proper or honest client.
814 * Therefore, the error message doesn't have to be too clear - if
815 * someone is playing with a hacked/non working client, this gives them
816 * an idea of the problem, but they deserve what they get
817 */
818 if (pl->state != ST_PLAYING)
819 {
820 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
821 return;
822 }
823
824 /* This should not happen anymore. */
825 if (pl->ob->speed_left < -1.0)
826 LOG (llevError, "Player has negative time - shouldn't do command.\n");
827
828 /* In c_new.c */
829 execute_newserver_command (pl->ob, (char *) command); 803 execute_newserver_command (pl->ob, buf);
804
830 /* Perhaps something better should be done with a left over count. 805 /* Perhaps something better should be done with a left over count.
831 * Cleaning up the input should probably be done first - all actions 806 * Cleaning up the input should probably be done first - all actions
832 * for the command that issued the count should be done before any other 807 * for the command that issued the count should be done before any other
833 * commands. 808 * commands.
834 */ 809 */
835 pl->count = 0; 810 pl->count = 0;
836 811
812 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
837 if (FABS (pl->ob->speed) < 0.001) 813 int time = FABS (pl->ob->speed) < 0.001
838 time = MAX_TIME * 100; 814 ? time = MAX_TIME * 100
839 else
840 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 815 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
841 816
842 /* Send confirmation of command execution now */ 817 /* Send confirmation of command execution now */
843
844 packet sl; 818 packet sl;
845 sl << "comc " << uint16 (pktlen) << uint32 (time); 819 sl << "comc " << uint16 (cmdid) << uint32 (time);
846 Send_With_Handling (&pl->socket, &sl); 820 pl->socket->send_packet (sl);
847} 821}
848 822
849 823
850/** This is a reply to a previous query. */ 824/** This is a reply to a previous query. */
851void 825void
852ReplyCmd (char *buf, int len, player *pl) 826ReplyCmd (char *buf, int len, player *pl)
853{ 827{
854 /* This is to synthesize how the data would be stored if it 828 /* This is to synthesize how the data would be stored if it
855 * was normally entered. A bit of a hack, and should be cleaned up 829 * was normally entered. A bit of a hack, and should be cleaned up
856 * once all the X11 code is removed from the server. 830 * once all the X11 code is removed from the server.
857 * 831 *
858 * We pass 13 to many of the functions because this way they 832 * We pass 13 to many of the functions because this way they
859 * think it was the carriage return that was entered, and the 833 * think it was the carriage return that was entered, and the
860 * function then does not try to do additional input. 834 * function then does not try to do additional input.
… …
863 837
864 /* this avoids any hacking here */ 838 /* this avoids any hacking here */
865 839
866 switch (pl->state) 840 switch (pl->state)
867 { 841 {
868 case ST_PLAYING: 842 case ST_PLAYING:
869 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 843 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
870 break; 844 break;
871 845
872 case ST_PLAY_AGAIN: 846 case ST_PLAY_AGAIN:
873 /* We can check this for return value (2==quit). Maybe we 847 /* We can check this for return value (2==quit). Maybe we
874 * should, and do something appropriate? 848 * should, and do something appropriate?
875 */ 849 */
876 receive_play_again (pl->ob, buf[0]); 850 receive_play_again (pl->ob, buf[0]);
877 break; 851 break;
878 852
879 case ST_ROLL_STAT: 853 case ST_ROLL_STAT:
880 key_roll_stat (pl->ob, buf[0]); 854 key_roll_stat (pl->ob, buf[0]);
881 break; 855 break;
882 856
883 case ST_CHANGE_CLASS: 857 case ST_CHANGE_CLASS:
884 858
885 key_change_class (pl->ob, buf[0]); 859 key_change_class (pl->ob, buf[0]);
886 break; 860 break;
887 861
888 case ST_CONFIRM_QUIT: 862 case ST_CONFIRM_QUIT:
889 key_confirm_quit (pl->ob, buf[0]); 863 key_confirm_quit (pl->ob, buf[0]);
890 break; 864 break;
891 865
892 case ST_CONFIGURE: 866 case ST_CONFIGURE:
893 LOG (llevError, "In client input handling, but into configure state\n"); 867 LOG (llevError, "In client input handling, but into configure state\n");
894 pl->state = ST_PLAYING; 868 pl->state = ST_PLAYING;
895 break; 869 break;
896 870
897 case ST_GET_NAME: 871 case ST_GET_NAME:
898 receive_player_name (pl->ob, 13); 872 receive_player_name (pl->ob, 13);
899 break; 873 break;
900 874
901 case ST_GET_PASSWORD: 875 case ST_GET_PASSWORD:
902 case ST_CONFIRM_PASSWORD: 876 case ST_CONFIRM_PASSWORD:
903 receive_player_password (pl->ob, 13); 877 receive_player_password (pl->ob, 13);
904 break; 878 break;
905 879
906 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 880 case ST_GET_PARTY_PASSWORD: /* Get password for party */
907 receive_party_password (pl->ob, 13); 881 receive_party_password (pl->ob, 13);
908 break; 882 break;
909 883
910 default: 884 default:
911 LOG (llevError, "Unknown input state: %d\n", pl->state); 885 LOG (llevError, "Unknown input state: %d\n", pl->state);
912 } 886 }
913} 887}
914 888
915/** 889/**
916 * Client tells its version. If there is a mismatch, we close the 890 * Client tells its version. If there is a mismatch, we close the
… …
918 * something older than the server. If we assume the client will be 892 * something older than the server. If we assume the client will be
919 * backwards compatible, having it be a later version should not be a 893 * backwards compatible, having it be a later version should not be a
920 * problem. 894 * problem.
921 */ 895 */
922void 896void
923VersionCmd (char *buf, int len, client_socket * ns) 897VersionCmd (char *buf, int len, client * ns)
924{ 898{
925 char *cp;
926 char version_warning[256];
927
928 if (!buf) 899 if (!buf)
929 { 900 {
930 LOG (llevError, "CS: received corrupted version command\n"); 901 LOG (llevError, "CS: received corrupted version command\n");
931 return; 902 return;
932 } 903 }
933 904
934 ns->cs_version = atoi (buf); 905 ns->cs_version = atoi (buf);
935 ns->sc_version = ns->cs_version; 906 ns->sc_version = ns->cs_version;
907
908 LOG (llevDebug, "connection from client <%s>\n", buf);
909
910
911 //TODO: should log here just for statistics
912
936 if (VERSION_CS != ns->cs_version) 913 //if (VERSION_CS != ns->cs_version)
937 { 914 // unchecked;
938#ifdef ESRV_DEBUG 915
939 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
940#endif
941 }
942 cp = strchr (buf + 1, ' '); 916 char *cp = strchr (buf + 1, ' ');
943 if (!cp) 917 if (!cp)
944 return; 918 return;
919
945 ns->sc_version = atoi (cp); 920 ns->sc_version = atoi (cp);
921
946 if (VERSION_SC != ns->sc_version) 922 //if (VERSION_SC != ns->sc_version)
947 { 923 // unchecked;
948#ifdef ESRV_DEBUG 924
949 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
950#endif
951 }
952 cp = strchr (cp + 1, ' '); 925 cp = strchr (cp + 1, ' ');
926
953 if (cp) 927 if (cp)
954 { 928 {
955 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 929 assign (ns->version, cp + 1);
956 930
957 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1);
958
959 /* This is first implementation - i skip all beta DX clients with it
960 * Add later stuff here for other clients
961 */
962
963 /* these are old dxclients */
964 /* Version 1024 added support for singular + plural name values -
965 * requiing this minimal value reduces complexity of that code, and it
966 * has been around for a long time.
967 */
968 if (ns->sc_version < 1026) 931 if (ns->sc_version < 1026)
969 { 932 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
970 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
971 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 933 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
972 ns->send_packet (version_warning);
973 }
974
975 } 934 }
976} 935}
977 936
978/** sound related functions. */ 937/** sound related functions. */
979
980void 938void
981SetSound (char *buf, int len, client_socket * ns) 939SetSound (char *buf, int len, client * ns)
982{ 940{
983 ns->sound = atoi (buf); 941 ns->sound = atoi (buf);
984} 942}
985 943
986/** client wants the map resent */ 944/** client wants the map resent */
987 945
988void 946void
989MapRedrawCmd (char *buf, int len, player *pl) 947MapRedrawCmd (char *buf, int len, player *pl)
990{ 948{
991
992/* This function is currently disabled; just clearing the map state results in 949/* This function is currently disabled; just clearing the map state results in
993 * display errors. It should clear the cache and send a newmap command. 950 * display errors. It should clear the cache and send a newmap command.
994 * Unfortunately this solution does not work because some client versions send 951 * Unfortunately this solution does not work because some client versions send
995 * a mapredraw command after receiving a newmap command. 952 * a mapredraw command after receiving a newmap command.
996 */ 953 */
997#if 0
998 /* Okay, this is MAJOR UGLY. but the only way I know how to
999 * clear the "cache"
1000 */
1001 memset (&pl->socket.lastmap, 0, sizeof (struct Map));
1002 draw_client_map (pl->ob);
1003#endif
1004} 954}
1005 955
1006/** 956/**
1007 * Moves an object (typically, container to inventory). 957 * Moves an object (typically, container to inventory).
1008 * syntax is: move (to) (tag) (nrof) 958 * syntax is: move (to) (tag) (nrof)
… …
1011MoveCmd (char *buf, int len, player *pl) 961MoveCmd (char *buf, int len, player *pl)
1012{ 962{
1013 int vals[3], i; 963 int vals[3], i;
1014 964
1015 /* A little funky here. We only cycle for 2 records, because 965 /* A little funky here. We only cycle for 2 records, because
1016 * we obviously am not going to find a space after the third 966 * we obviously are not going to find a space after the third
1017 * record. Perhaps we should just replace this with a 967 * record. Perhaps we should just replace this with a
1018 * sscanf? 968 * sscanf?
1019 */ 969 */
1020 for (i = 0; i < 2; i++) 970 for (i = 0; i < 2; i++)
1021 { 971 {
1022 vals[i] = atoi (buf); 972 vals[i] = atoi (buf);
973
1023 if (!(buf = strchr (buf, ' '))) 974 if (!(buf = strchr (buf, ' ')))
1024 { 975 {
1025 LOG (llevError, "Incomplete move command: %s\n", buf); 976 LOG (llevError, "Incomplete move command: %s\n", buf);
1026 return; 977 return;
1027 } 978 }
979
1028 buf++; 980 buf++;
1029 } 981 }
982
1030 vals[2] = atoi (buf); 983 vals[2] = atoi (buf);
1031 984
1032/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 985/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1033 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 986 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1034} 987}
1035
1036
1037 988
1038/****************************************************************************** 989/******************************************************************************
1039 * 990 *
1040 * Start of commands the server sends to the client. 991 * Start of commands the server sends to the client.
1041 * 992 *
… …
1044/** 995/**
1045 * Asks the client to query the user. This way, the client knows 996 * Asks the client to query the user. This way, the client knows
1046 * it needs to send something back (vs just printing out a message) 997 * it needs to send something back (vs just printing out a message)
1047 */ 998 */
1048void 999void
1049send_query (client_socket * ns, uint8 flags, char *text) 1000send_query (client *ns, uint8 flags, char *text)
1050{ 1001{
1051 char buf[MAX_BUF];
1052
1053 sprintf (buf, "query %d %s", flags, text ? text : ""); 1002 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1054 ns->send_packet (buf);
1055} 1003}
1056 1004
1057#define AddIfInt64(Old,New,Type) if (Old != New) {\ 1005#define AddIfInt64(Old,New,Type) if (Old != New) {\
1058 Old = New; \ 1006 Old = New; \
1059 sl << uint8 (Type) << uint64 (New); \ 1007 sl << uint8 (Type) << uint64 (New); \
… …
1092 uint16 flags; 1040 uint16 flags;
1093 1041
1094 packet sl; 1042 packet sl;
1095 sl << "stats "; 1043 sl << "stats ";
1096 1044
1097 if (pl->ob != NULL) 1045 if (pl->ob)
1098 { 1046 {
1099 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1047 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);
1100 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1048 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);
1101 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1049 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);
1102 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1050 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
… …
1109 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 1057 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX);
1110 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1058 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);
1111 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1059 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1112 } 1060 }
1113 1061
1114 if (pl->socket.exp64) 1062 if (pl->socket->exp64)
1115 {
1116 uint8 s;
1117
1118 for (s = 0; s < NUM_SKILLS; s++) 1063 for (int s = 0; s < NUM_SKILLS; s++)
1119 {
1120 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 1064 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1121 { 1065 {
1122 /* Always send along the level if exp changes. This is only 1066 /* Always send along the level if exp changes. This is only
1123 * 1 extra byte, but keeps processing simpler. 1067 * 1 extra byte, but keeps processing simpler.
1124 */ 1068 */
1125 sl << uint8 (s + CS_STAT_SKILLINFO) 1069 sl << uint8 (s + CS_STAT_SKILLINFO)
1126 << uint8 (pl->last_skill_ob[s]->level) 1070 << uint8 (pl->last_skill_ob[s]->level)
1127 << uint64 (pl->last_skill_ob[s]->stats.exp); 1071 << uint64 (pl->last_skill_ob[s]->stats.exp);
1128 1072
1129 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; 1073 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1130 } 1074 }
1131 }
1132 }
1133 1075
1134 if (pl->socket.exp64) 1076 if (pl->socket->exp64)
1135 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1077 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }
1136 else 1078 else
1137 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } 1079 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1138 1080
1139 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1081 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);
… …
1152 if (pl->run_on) 1094 if (pl->run_on)
1153 flags |= SF_RUNON; 1095 flags |= SF_RUNON;
1154 1096
1155 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1097 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1156 1098
1157 if (pl->socket.sc_version < 1025) 1099 if (pl->socket->sc_version < 1025)
1158 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1100 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1159 else 1101 else
1160 {
1161 int i;
1162
1163 for (i = 0; i < NROFATTACKS; i++) 1102 for (int i = 0; i < NROFATTACKS; i++)
1164 { 1103 {
1165 /* Skip ones we won't send */ 1104 /* Skip ones we won't send */
1166 if (atnr_cs_stat[i] == -1) 1105 if (atnr_cs_stat[i] == -1)
1167 continue; 1106 continue;
1168 1107
1169 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1108 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1170 } 1109 }
1171 }
1172 1110
1173 if (pl->socket.monitor_spells) 1111 if (pl->socket->monitor_spells)
1174 { 1112 {
1175 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1113 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1176 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1114 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
1177 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 1115 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY);
1178 } 1116 }
1179 1117
1180 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 1118 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */
1181 AddIfString (pl->socket.stats.range, buf, CS_STAT_RANGE); 1119 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE);
1182 set_title (pl->ob, buf); 1120 set_title (pl->ob, buf);
1183 AddIfString (pl->socket.stats.title, buf, CS_STAT_TITLE); 1121 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE);
1184 1122
1185 /* Only send it away if we have some actual data */ 1123 /* Only send it away if we have some actual data */
1186 if (sl.length () > 6) 1124 if (sl.length () > 6)
1187 Send_With_Handling (&pl->socket, &sl); 1125 pl->socket->send_packet (sl);
1188} 1126}
1189 1127
1190/** 1128/**
1191 * Tells the client that here is a player it should start using. 1129 * Tells the client that here is a player it should start using.
1192 */ 1130 */
… …
1201 sl << uint32 (pl->ob->count) 1139 sl << uint32 (pl->ob->count)
1202 << uint32 (weight) 1140 << uint32 (weight)
1203 << uint32 (pl->ob->face->number) 1141 << uint32 (pl->ob->face->number)
1204 << data8 (pl->ob->name); 1142 << data8 (pl->ob->name);
1205 1143
1206 Send_With_Handling (&pl->socket, &sl); 1144 pl->socket->send_packet (sl);
1207 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1145 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1208} 1146}
1209 1147
1210/** 1148/**
1211 * Need to send an animation sequence to the client. 1149 * Need to send an animation sequence to the client.
… …
1213 * sent them the face yet (this can become quite costly in terms of 1151 * sent them the face yet (this can become quite costly in terms of
1214 * how much we are sending - on the other hand, this should only happen 1152 * how much we are sending - on the other hand, this should only happen
1215 * when the player logs in and picks stuff up. 1153 * when the player logs in and picks stuff up.
1216 */ 1154 */
1217void 1155void
1218esrv_send_animation (client_socket * ns, short anim_num) 1156esrv_send_animation (client * ns, short anim_num)
1219{ 1157{
1220 int i;
1221
1222 /* Do some checking on the anim_num we got. Note that the animations 1158 /* Do some checking on the anim_num we got. Note that the animations
1223 * are added in contigous order, so if the number is in the valid 1159 * are added in contigous order, so if the number is in the valid
1224 * range, it must be a valid animation. 1160 * range, it must be a valid animation.
1225 */ 1161 */
1226 if (anim_num < 0 || anim_num > num_animations) 1162 if (anim_num < 0 || anim_num > num_animations)
… …
1236 << uint16 (0); /* flags - not used right now */ 1172 << uint16 (0); /* flags - not used right now */
1237 1173
1238 /* Build up the list of faces. Also, send any information (ie, the 1174 /* Build up the list of faces. Also, send any information (ie, the
1239 * the face itself) down to the client. 1175 * the face itself) down to the client.
1240 */ 1176 */
1241 for (i = 0; i < animations[anim_num].num_animations; i++) 1177 for (int i = 0; i < animations[anim_num].num_animations; i++)
1242 { 1178 {
1243 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1179 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1244 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1180 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1181
1245 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 1182 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1246 } 1183 }
1247 1184
1248 Send_With_Handling (ns, &sl); 1185 ns->send_packet (sl);
1249 1186
1250 ns->anims_sent[anim_num] = 1; 1187 ns->anims_sent[anim_num] = 1;
1251} 1188}
1252 1189
1253 1190
… …
1260/** 1197/**
1261 * This adds face_num to a map cell at x,y. If the client doesn't have 1198 * This adds face_num to a map cell at x,y. If the client doesn't have
1262 * the face yet, we will also send it. 1199 * the face yet, we will also send it.
1263 */ 1200 */
1264static void 1201static void
1265esrv_map_setbelow (client_socket * ns, int x, int y, short face_num, struct Map *newmap) 1202esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1266{ 1203{
1267 if (newmap->cells[x][y].count >= MAP_LAYERS) 1204 if (newmap->cells[x][y].count >= MAP_LAYERS)
1268 { 1205 {
1206 //TODO: one or the other, can't both have abort and return, verify and act
1269 LOG (llevError, "Too many faces in map cell %d %d\n", x, y); 1207 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1270 return; 1208 return;
1271 abort (); 1209 abort ();
1272 } 1210 }
1273 1211
1274 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; 1212 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1275 newmap->cells[x][y].count++; 1213 newmap->cells[x][y].count++;
1276 1214
1277 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1215 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1278 esrv_send_face (ns, face_num, 0); 1216 esrv_send_face (ns, face_num, 0);
1279}
1280
1281struct LayerCell
1282{
1283 uint16 xy;
1284 short face;
1285};
1286
1287struct MapLayer
1288{
1289 int count;
1290 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1291};
1292
1293/** Checkes if map cells have changed */
1294static int
1295mapcellchanged (client_socket * ns, int i, int j, struct Map *newmap)
1296{
1297 int k;
1298
1299 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1300 return 1;
1301 for (k = 0; k < newmap->cells[i][j].count; k++)
1302 {
1303 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1304 {
1305 return 1;
1306 }
1307 }
1308 return 0;
1309}
1310
1311/**
1312 * Basically, what this does is pack the data into layers.
1313 * cnum is the client number, cur is the the buffer we put all of
1314 * this data into. we return the end of the data. layers is
1315 * how many layers of data we should back.
1316 */
1317static uint8 *
1318compactlayer (client_socket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1319{
1320 int x, y, k;
1321 int face;
1322 unsigned char *fcur;
1323 struct MapLayer layers[MAP_LAYERS];
1324
1325 for (k = 0; k < MAP_LAYERS; k++)
1326 layers[k].count = 0;
1327 fcur = cur;
1328 for (x = 0; x < ns->mapx; x++)
1329 {
1330 for (y = 0; y < ns->mapy; y++)
1331 {
1332 if (!mapcellchanged (ns, x, y, newmap))
1333 continue;
1334 if (newmap->cells[x][y].count == 0)
1335 {
1336 *cur = x * ns->mapy + y; /* mark empty space */
1337 cur++;
1338 continue;
1339 }
1340 for (k = 0; k < newmap->cells[x][y].count; k++)
1341 {
1342 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1343 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1344 layers[k].count++;
1345 }
1346 }
1347 }
1348 /* If no data, return now. */
1349 if (fcur == cur && layers[0].count == 0)
1350 return cur;
1351 *cur = 255; /* mark end of explicitly cleared cells */
1352 cur++;
1353 /* First pack by layers. */
1354 for (k = 0; k < numlayers; k++)
1355 {
1356 if (layers[k].count == 0)
1357 break; /* once a layer is entirely empty, no layer below it can
1358 have anything in it either */
1359 /* Pack by entries in thie layer */
1360 for (x = 0; x < layers[k].count;)
1361 {
1362 fcur = cur;
1363 *cur = layers[k].lcells[x].face >> 8;
1364 cur++;
1365 *cur = layers[k].lcells[x].face & 0xFF;
1366 cur++;
1367 face = layers[k].lcells[x].face;
1368 /* Now, we back the redundant data into 1 byte xy pairings */
1369 for (y = x; y < layers[k].count; y++)
1370 {
1371 if (layers[k].lcells[y].face == face)
1372 {
1373 *cur = (uint8) layers[k].lcells[y].xy;
1374 cur++;
1375 layers[k].lcells[y].face = -1;
1376 }
1377 }
1378 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1379 /* forward over the now redundant data */
1380 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1381 x++;
1382 }
1383 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1384 }
1385 return cur;
1386} 1217}
1387 1218
1388/** Clears a map cell */ 1219/** Clears a map cell */
1389static void 1220static void
1390map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1221map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
… …
1402#define MAX_LAYERS 3 1233#define MAX_LAYERS 3
1403 1234
1404/* Using a global really isn't a good approach, but saves the over head of 1235/* Using a global really isn't a good approach, but saves the over head of
1405 * allocating and deallocating such a block of data each time run through, 1236 * allocating and deallocating such a block of data each time run through,
1406 * and saves the space of allocating this in the socket object when we only 1237 * and saves the space of allocating this in the socket object when we only
1407 * need it for this cycle. If the serve is ever threaded, this needs to be 1238 * need it for this cycle. If the server is ever threaded, this needs to be
1408 * re-examined. 1239 * re-examined.
1409 */ 1240 */
1410
1411static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1241static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1412 1242
1413/** 1243/**
1414 * Returns true if any of the heads for this 1244 * Returns true if any of the heads for this
1415 * space is set. Returns false if all are blank - this is used 1245 * space is set. Returns false if all are blank - this is used
1416 * for empty space checking. 1246 * for empty space checking.
1417 */ 1247 */
1418static inline int 1248static inline int
1419have_head (int ax, int ay) 1249have_head (int ax, int ay)
1420{ 1250{
1421
1422 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1251 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1423 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) 1252 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1424 return 1; 1253 return 1;
1254
1425 return 0; 1255 return 0;
1426} 1256}
1427 1257
1428/** 1258/**
1429 * check_head is a bit simplistic version of update_space below. 1259 * check_head is a bit simplistic version of update_space below.
1430 * basically, it only checks the that the head on space ax,ay at layer 1260 * basically, it only checks the that the head on space ax,ay at layer
1431 * needs to get sent - if so, it adds the data, sending the head 1261 * needs to get sent - if so, it adds the data, sending the head
1432 * if needed, and returning 1. If this no data needs to get 1262 * if needed, and returning 1. If this no data needs to get
1433 * sent, it returns zero. 1263 * sent, it returns zero.
1434 */ 1264 */
1435static int 1265static int
1436check_head (packet &sl, client_socket &ns, int ax, int ay, int layer) 1266check_head (packet &sl, client &ns, int ax, int ay, int layer)
1437{ 1267{
1438 short face_num; 1268 short face_num;
1439 1269
1440 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) 1270 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1441 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; 1271 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
… …
1473 * numbers the spaces differently - I think this was a leftover from 1303 * numbers the spaces differently - I think this was a leftover from
1474 * the map command, where the faces stack up. Sinces that is no longer 1304 * the map command, where the faces stack up. Sinces that is no longer
1475 * the case, it seems to make more sense to have these layer values 1305 * the case, it seems to make more sense to have these layer values
1476 * actually match. 1306 * actually match.
1477 */ 1307 */
1478
1479static int 1308static int
1480update_space (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1309update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1481{ 1310{
1482 object *ob, *head; 1311 object *ob, *head;
1483 uint16 face_num; 1312 uint16 face_num;
1484 int bx, by, i; 1313 int bx, by, i;
1485 1314
… …
1698 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ 1527 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1699 * take. 1528 * take.
1700 */ 1529 */
1701 1530
1702static inline int 1531static inline int
1703update_smooth (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1532update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1704{ 1533{
1705 object *ob; 1534 object *ob;
1706 int smoothlevel; /* old face_num; */ 1535 int smoothlevel; /* old face_num; */
1707 1536
1708 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1537 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
… …
1742 * Returns the size of a data for a map square as returned by 1571 * Returns the size of a data for a map square as returned by
1743 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1572 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1744 * available. 1573 * available.
1745 */ 1574 */
1746int 1575int
1747getExtendedMapInfoSize (client_socket * ns) 1576getExtendedMapInfoSize (client * ns)
1748{ 1577{
1749 int result = 0; 1578 int result = 0;
1750 1579
1751 if (ns->ext_mapinfos) 1580 if (ns->ext_mapinfos)
1752 { 1581 {
1753 if (ns->EMI_smooth) 1582 if (ns->EMI_smooth)
1754 result += 1; /*One byte for smoothlevel */ 1583 result += 1; /*One byte for smoothlevel */
1755 } 1584 }
1585
1756 return result; 1586 return result;
1757} 1587}
1758 1588
1759/** 1589/**
1760 * This function uses the new map1 protocol command to send the map 1590 * This function uses the new map1 protocol command to send the map
… …
1788 uint8 eentrysize; 1618 uint8 eentrysize;
1789 uint16 ewhatstart, ewhatflag; 1619 uint16 ewhatstart, ewhatflag;
1790 uint8 extendedinfos; 1620 uint8 extendedinfos;
1791 maptile *m; 1621 maptile *m;
1792 1622
1793 client_socket &socket = pl->contr->socket; 1623 client &socket = *pl->contr->socket;
1794 1624
1795 check_map_change (pl->contr); 1625 check_map_change (pl->contr);
1796 1626
1797 packet sl; 1627 packet sl;
1798 packet esl; 1628 packet esl;
… …
1877 * with no faces tells the client to blank out the 1707 * with no faces tells the client to blank out the
1878 * space. 1708 * space.
1879 */ 1709 */
1880 got_one = 0; 1710 got_one = 0;
1881 for (i = oldlen + 2; i < sl.length (); i++) 1711 for (i = oldlen + 2; i < sl.length (); i++)
1882 if (sl.buf[i]) 1712 if (sl[i])
1883 got_one = 1; 1713 got_one = 1;
1884 1714
1885 if (got_one && (mask & 0xf)) 1715 if (got_one && (mask & 0xf))
1886 sl.buf[oldlen + 1] = mask & 0xff; 1716 sl[oldlen + 1] = mask & 0xff;
1887 else 1717 else
1888 { /*either all faces blank, either no face at all */ 1718 { /*either all faces blank, either no face at all */
1889 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */ 1719 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1890 sl.reset (oldlen + 2); 1720 sl.reset (oldlen + 2);
1891 else 1721 else
… …
1957 1787
1958 map_clearcell (&lastcell, 0, 0, 0, count); 1788 map_clearcell (&lastcell, 0, 0, 0, count);
1959 } 1789 }
1960 1790
1961 if ((mask & 0xf) || need_send) 1791 if ((mask & 0xf) || need_send)
1962 sl.buf[oldlen + 1] = mask & 0xff; 1792 sl[oldlen + 1] = mask & 0xff;
1963 else 1793 else
1964 sl.reset (oldlen); 1794 sl.reset (oldlen);
1965 } 1795 }
1966 else 1796 else
1967 { 1797 {
… …
1997 mask |= 0x8; 1827 mask |= 0x8;
1998 1828
1999 if (socket.extmap) 1829 if (socket.extmap)
2000 { 1830 {
2001 *last_ext |= 0x80; 1831 *last_ext |= 0x80;
2002 last_ext = sl.buf + sl.length (); 1832 last_ext = &sl[sl.length ()];
2003 sl << uint8 (d); 1833 sl << uint8 (d);
2004 } 1834 }
2005 else 1835 else
2006 sl << uint8 (255 - 64 * d); 1836 sl << uint8 (255 - 64 * d);
2007 } 1837 }
… …
2041 { 1871 {
2042 lastcell.stat_hp = stat_hp; 1872 lastcell.stat_hp = stat_hp;
2043 1873
2044 mask |= 0x8; 1874 mask |= 0x8;
2045 *last_ext |= 0x80; 1875 *last_ext |= 0x80;
2046 last_ext = sl.buf + sl.length (); 1876 last_ext = &sl[sl.length ()];
2047 1877
2048 sl << uint8 (5) << uint8 (stat_hp); 1878 sl << uint8 (5) << uint8 (stat_hp);
2049 1879
2050 if (stat_width > 1) 1880 if (stat_width > 1)
2051 { 1881 {
2052 *last_ext |= 0x80; 1882 *last_ext |= 0x80;
2053 last_ext = sl.buf + sl.length (); 1883 last_ext = &sl[sl.length ()];
2054 1884
2055 sl << uint8 (6) << uint8 (stat_width); 1885 sl << uint8 (6) << uint8 (stat_width);
2056 } 1886 }
2057 } 1887 }
2058 1888
… …
2060 { 1890 {
2061 lastcell.player = player; 1891 lastcell.player = player;
2062 1892
2063 mask |= 0x8; 1893 mask |= 0x8;
2064 *last_ext |= 0x80; 1894 *last_ext |= 0x80;
2065 last_ext = sl.buf + sl.length (); 1895 last_ext = &sl[sl.length ()];
2066 1896
2067 sl << uint8 (0x47) << uint8 (8) << (uint64)player; 1897 sl << uint8 (0x47) << uint8 (8) << (uint64)player;
2068 } 1898 }
2069 1899
2070 if (lastcell.flags != flags) 1900 if (lastcell.flags != flags)
2071 { 1901 {
2072 lastcell.flags = flags; 1902 lastcell.flags = flags;
2073 1903
2074 mask |= 0x8; 1904 mask |= 0x8;
2075 *last_ext |= 0x80; 1905 *last_ext |= 0x80;
2076 last_ext = sl.buf + sl.length (); 1906 last_ext = &sl[sl.length ()];
2077 1907
2078 sl << uint8 (8) << uint8 (flags); 1908 sl << uint8 (8) << uint8 (flags);
2079 } 1909 }
2080 } 1910 }
2081 1911
… …
2123 * space by checking the mask. If so, update the mask. 1953 * space by checking the mask. If so, update the mask.
2124 * if not, reset the len to that from before adding the mask 1954 * if not, reset the len to that from before adding the mask
2125 * value, so we don't send those bits. 1955 * value, so we don't send those bits.
2126 */ 1956 */
2127 if (mask & 0xf) 1957 if (mask & 0xf)
2128 sl.buf[oldlen + 1] = mask & 0xff; 1958 sl[oldlen + 1] = mask & 0xff;
2129 else 1959 else
2130 sl.reset (oldlen); 1960 sl.reset (oldlen);
2131 1961
2132 if (emask & 0xf) 1962 if (emask & 0xf)
2133 esl.buf[eoldlen + 1] = emask & 0xff; 1963 esl[eoldlen + 1] = emask & 0xff;
2134 else 1964 else
2135 esl.reset (eoldlen); 1965 esl.reset (eoldlen);
2136 } /* else this is a viewable space */ 1966 } /* else this is a viewable space */
2137 } /* for x loop */ 1967 } /* for x loop */
2138 } /* for y loop */ 1968 } /* for y loop */
… …
2144 { 1974 {
2145 /* No map data will follow, so don't say the client 1975 /* No map data will follow, so don't say the client
2146 * it doesn't need draw! 1976 * it doesn't need draw!
2147 */ 1977 */
2148 ewhatflag &= (~EMI_NOREDRAW); 1978 ewhatflag &= (~EMI_NOREDRAW);
2149 esl.buf[ewhatstart + 1] = ewhatflag & 0xff; 1979 esl[ewhatstart + 1] = ewhatflag & 0xff;
2150 } 1980 }
2151 1981
2152 if (esl.length () > estartlen) 1982 if (esl.length () > estartlen)
2153 Send_With_Handling (&socket, &esl); 1983 socket.send_packet (esl);
2154 } 1984 }
2155 1985
2156 if (sl.length () > startlen || socket.sent_scroll) 1986 if (sl.length () > startlen || socket.sent_scroll)
2157 { 1987 {
2158 Send_With_Handling (&socket, &sl); 1988 socket.send_packet (sl);
2159 socket.sent_scroll = 0; 1989 socket.sent_scroll = 0;
2160 } 1990 }
2161} 1991}
2162 1992
2163/** 1993/**
… …
2189 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 2019 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2190 return; 2020 return;
2191 2021
2192 memset (&newmap, 0, sizeof (struct Map)); 2022 memset (&newmap, 0, sizeof (struct Map));
2193 2023
2194 for (j = (pl->y - pl->contr->socket.mapy / 2); j < (pl->y + (pl->contr->socket.mapy + 1) / 2); j++) 2024 for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++)
2195 { 2025 {
2196 for (i = (pl->x - pl->contr->socket.mapx / 2); i < (pl->x + (pl->contr->socket.mapx + 1) / 2); i++) 2026 for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++)
2197 { 2027 {
2198 ax = i; 2028 ax = i;
2199 ay = j; 2029 ay = j;
2200 m = pm; 2030 m = pm;
2201 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2031 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2032
2202 if (mflags & P_OUT_OF_MAP) 2033 if (mflags & P_OUT_OF_MAP)
2203 continue; 2034 continue;
2035
2204 if (mflags & P_NEED_UPDATE) 2036 if (mflags & P_NEED_UPDATE)
2205 update_position (m, ax, ay); 2037 update_position (m, ax, ay);
2038
2206 /* If a map is visible to the player, we don't want to swap it out 2039 /* If a map is visible to the player, we don't want to swap it out
2207 * just to reload it. This should really call something like 2040 * just to reload it. This should really call something like
2208 * swap_map, but this is much more efficient and 'good enough' 2041 * swap_map, but this is much more efficient and 'good enough'
2209 */ 2042 */
2210 if (mflags & P_NEW_MAP) 2043 if (mflags & P_NEW_MAP)
… …
2233 2066
2234/*****************************************************************************/ 2067/*****************************************************************************/
2235void 2068void
2236send_plugin_custom_message (object *pl, char *buf) 2069send_plugin_custom_message (object *pl, char *buf)
2237{ 2070{
2238 pl->contr->socket.send_packet (buf); 2071 pl->contr->socket->send_packet (buf);
2239} 2072}
2240 2073
2241/** 2074/**
2242 * This sends the skill number to name mapping. We ignore 2075 * This sends the skill number to name mapping. We ignore
2243 * the params - we always send the same info no matter what. 2076 * the params - we always send the same info no matter what.
2244 */ 2077 */
2245void 2078void
2246send_skill_info (client_socket *ns, char *params) 2079send_skill_info (client *ns, char *params)
2247{ 2080{
2248 packet sl; 2081 packet sl;
2249 sl << "replyinfo skill_info\n"; 2082 sl << "replyinfo skill_info\n";
2250 2083
2251 for (int i = 1; i < NUM_SKILLS; i++) 2084 for (int i = 1; i < NUM_SKILLS; i++)
… …
2255 { 2088 {
2256 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 2089 LOG (llevError, "Buffer overflow in send_skill_info!\n");
2257 fatal (0); 2090 fatal (0);
2258 } 2091 }
2259 2092
2260 Send_With_Handling (ns, &sl); 2093 ns->send_packet (sl);
2261} 2094}
2262 2095
2263/** 2096/**
2264 * This sends the spell path to name mapping. We ignore 2097 * This sends the spell path to name mapping. We ignore
2265 * the params - we always send the same info no matter what. 2098 * the params - we always send the same info no matter what.
2266 */ 2099 */
2267void 2100void
2268send_spell_paths (client_socket * ns, char *params) 2101send_spell_paths (client * ns, char *params)
2269{ 2102{
2270 packet sl; 2103 packet sl;
2271 2104
2272 sl << "replyinfo spell_paths\n"; 2105 sl << "replyinfo spell_paths\n";
2273 2106
… …
2278 { 2111 {
2279 LOG (llevError, "Buffer overflow in send_spell_paths!\n"); 2112 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
2280 fatal (0); 2113 fatal (0);
2281 } 2114 }
2282 2115
2283 Send_With_Handling (ns, &sl); 2116 ns->send_packet (sl);
2284} 2117}
2285 2118
2286/** 2119/**
2287 * This looks for any spells the player may have that have changed their stats. 2120 * This looks for any spells the player may have that have changed their stats.
2288 * it then sends an updspell packet for each spell that has changed in this way 2121 * it then sends an updspell packet for each spell that has changed in this way
2289 */ 2122 */
2290void 2123void
2291esrv_update_spells (player *pl) 2124esrv_update_spells (player *pl)
2292{ 2125{
2293 if (!pl->socket.monitor_spells) 2126 if (!pl->socket->monitor_spells)
2294 return; 2127 return;
2295 2128
2296 for (object *spell = pl->ob->inv; spell; spell = spell->below) 2129 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2297 { 2130 {
2298 if (spell->type == SPELL) 2131 if (spell->type == SPELL)
… …
2328 2161
2329 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 2162 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2330 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 2163 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2331 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 2164 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2332 2165
2333 Send_With_Handling (&pl->socket, &sl); 2166 pl->socket->send_packet (sl);
2334 } 2167 }
2335 } 2168 }
2336 } 2169 }
2337} 2170}
2338 2171
2339void 2172void
2340esrv_remove_spell (player *pl, object *spell) 2173esrv_remove_spell (player *pl, object *spell)
2341{ 2174{
2342 if (!pl->socket.monitor_spells) 2175 if (!pl->socket->monitor_spells)
2343 return; 2176 return;
2344 2177
2345 if (!pl || !spell || spell->env != pl->ob) 2178 if (!pl || !spell || spell->env != pl->ob)
2346 { 2179 {
2347 LOG (llevError, "Invalid call to esrv_remove_spell"); 2180 LOG (llevError, "Invalid call to esrv_remove_spell");
… …
2351 packet sl; 2184 packet sl;
2352 2185
2353 sl << "delspell " 2186 sl << "delspell "
2354 << uint32 (spell->count); 2187 << uint32 (spell->count);
2355 2188
2356 Send_With_Handling (&pl->socket, &sl); 2189 pl->socket->send_packet (sl);
2357} 2190}
2358 2191
2359/* appends the spell *spell to the Socklist we will send the data to. */ 2192/* appends the spell *spell to the Socklist we will send the data to. */
2360static void 2193static void
2361append_spell (player *pl, packet &sl, object *spell) 2194append_spell (player *pl, packet &sl, object *spell)
… …
2409 { 2242 {
2410 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); 2243 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2411 return; 2244 return;
2412 } 2245 }
2413 2246
2414 if (!pl->socket.monitor_spells) 2247 if (!pl->socket->monitor_spells)
2415 return; 2248 return;
2416 2249
2417 packet sl; 2250 packet sl;
2418
2419 sl << "addspell "; 2251 sl << "addspell ";
2420 2252
2421 if (!spell) 2253 if (!spell)
2422 { 2254 {
2423 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2255 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
… …
2438 if (spell->type != SPELL) 2270 if (spell->type != SPELL)
2439 continue; 2271 continue;
2440 2272
2441 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 2273 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2442 { 2274 {
2443 Send_With_Handling (&pl->socket, &sl); 2275 pl->socket->send_packet (sl);
2444 2276
2445 sl.reset (); 2277 sl.reset ();
2446 sl << "addspell "; 2278 sl << "addspell ";
2447 } 2279 }
2448 2280
… …
2462 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 2294 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2463 fatal (0); 2295 fatal (0);
2464 } 2296 }
2465 2297
2466 /* finally, we can send the packet */ 2298 /* finally, we can send the packet */
2467 Send_With_Handling (&pl->socket, &sl); 2299 pl->socket->send_packet (sl);
2468
2469} 2300}
2470 2301

Diff Legend

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