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.37 by root, Thu Dec 14 20:39:54 2006 UTC vs.
Revision 1.49 by root, Thu Dec 21 06:12:37 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;
159
160 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 143 memset (&pl->socket->lastmap, 0, sizeof (pl->socket->lastmap));
161 144
162 if (socket.newmapcmd == 1) 145 if (pl->socket->newmapcmd == 1)
163 socket.send_packet ("newmap"); 146 pl->socket->send_packet ("newmap");
164 147
165 socket.update_look = 1; 148 pl->socket->floorbox_reset ();
166 socket.look_position = 0;
167} 149}
168 150
169/** check for map change and send new map data */ 151/** check for map change and send new map data */
170static void 152static void
171check_map_change (player *pl) 153check_map_change (player *pl)
172{ 154{
173 client_socket &socket = *pl->socket; 155 client &socket = *pl->socket;
174 object *ob = pl->ob; 156 object *ob = pl->ob;
175 char buf[MAX_BUF]; /* eauugggh */ 157 char buf[MAX_BUF]; /* eauugggh */
176 158
177 if (socket.current_map != ob->map) 159 if (socket.current_map != ob->map)
178 { 160 {
… …
212 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 194 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
213 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows 195 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
214 else 196 else
215 { 197 {
216 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); 198 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
217 socket.update_look = 1; 199 socket.floorbox_reset ();
218 socket.look_position = 0;
219 } 200 }
220 } 201 }
221 202
222 socket.current_x = ob->x; 203 socket.current_x = ob->x;
223 socket.current_y = ob->y; 204 socket.current_y = ob->y;
224} 205}
225 206
207/**
208 * RequestInfo is sort of a meta command. There is some specific
209 * request of information, but we call other functions to provide
210 * that information.
211 */
212void
213RequestInfo (char *buf, int len, client * ns)
214{
215 char *params = NULL, *cp;
216
217 /* No match */
218 char bigbuf[MAX_BUF];
219 int slen;
220
221 /* Set up replyinfo before we modify any of the buffers - this is used
222 * if we don't find a match.
223 */
224 strcpy (bigbuf, "replyinfo ");
225 slen = strlen (bigbuf);
226 safe_strcat (bigbuf, buf, &slen, MAX_BUF);
227
228 /* find the first space, make it null, and update the
229 * params pointer.
230 */
231 for (cp = buf; *cp != '\0'; cp++)
232 if (*cp == ' ')
233 {
234 *cp = '\0';
235 params = cp + 1;
236 break;
237 }
238
239 if (!strcmp (buf, "image_info"))
240 send_image_info (ns, params);
241 else if (!strcmp (buf, "image_sums"))
242 send_image_sums (ns, params);
243 else if (!strcmp (buf, "skill_info"))
244 send_skill_info (ns, params);
245 else if (!strcmp (buf, "spell_paths"))
246 send_spell_paths (ns, params);
247 else
248 ns->send_packet (bigbuf, len);
249}
250
226void 251void
227ExtCmd (char *buf, int len, player *pl) 252ExtCmd (char *buf, int len, player *pl)
228{ 253{
229 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 254 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
255}
256
257void
258ExtiCmd (char *buf, int len, client *ns)
259{
260 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
230} 261}
231 262
232void 263void
233MapInfoCmd (char *buf, int len, player *pl) 264MapInfoCmd (char *buf, int len, player *pl)
234{ 265{
… …
316 pl->socket->send_packet (bigbuf); 347 pl->socket->send_packet (bigbuf);
317} 348}
318 349
319/** This is the Setup cmd - easy first implementation */ 350/** This is the Setup cmd - easy first implementation */
320void 351void
321SetUp (char *buf, int len, client_socket * ns) 352SetUp (char *buf, int len, client * ns)
322{ 353{
323 int s, slen; 354 int s, slen;
324 char *cmd, *param, cmdback[HUGE_BUF]; 355 char *cmd, *param, cmdback[HUGE_BUF];
325 356
326 /* run through the cmds of setup 357 /* run through the cmds of setup
… …
536 * This is what takes care of it. We tell the client how things worked out. 567 * This is what takes care of it. We tell the client how things worked out.
537 * I am not sure if this file is the best place for this function. however, 568 * I am not sure if this file is the best place for this function. however,
538 * it either has to be here or init_sockets needs to be exported. 569 * it either has to be here or init_sockets needs to be exported.
539 */ 570 */
540void 571void
541AddMeCmd (char *buf, int len, client_socket * ns) 572AddMeCmd (char *buf, int len, client * ns)
542{ 573{
543 Settings oldsettings; 574 if (INVOKE_CLIENT (ADDME, ns))
575 return;
544 576
545 oldsettings = settings;
546 if (ns->status != Ns_Add || add_player (ns)) 577 if (ns->pl || add_player (ns))
547 ns->send_packet ("addme_failed"); 578 ns->send_packet ("addme_failed");
548 else 579 else
549 ns->send_packet ("addme_success"); 580 ns->send_packet ("addme_success");
550
551 settings = oldsettings;
552} 581}
553 582
554/** Reply to ExtendedInfos command */ 583/** Reply to ExtendedInfos command */
555void 584void
556ToggleExtendedInfos (char *buf, int len, client_socket * ns) 585ToggleExtendedInfos (char *buf, int len, client * ns)
557{ 586{
558 char cmdback[MAX_BUF]; 587 char cmdback[MAX_BUF];
559 char command[50]; 588 char command[50];
560 int info, nextinfo; 589 int info, nextinfo;
561 590
… …
612#define MSG_TYPE_MONUMENT 5 641#define MSG_TYPE_MONUMENT 5
613#define MSG_TYPE_SCRIPTED_DIALOG 6*/ 642#define MSG_TYPE_SCRIPTED_DIALOG 6*/
614 643
615/** Reply to ExtendedInfos command */ 644/** Reply to ExtendedInfos command */
616void 645void
617ToggleExtendedText (char *buf, int len, client_socket * ns) 646ToggleExtendedText (char *buf, int len, client * ns)
618{ 647{
619 char cmdback[MAX_BUF]; 648 char cmdback[MAX_BUF];
620 char temp[10]; 649 char temp[10];
621 char command[50]; 650 char command[50];
622 int info, nextinfo, i, flag; 651 int info, nextinfo, i, flag;
… …
673 * a piece of data from us that we know the client wants. So 702 * a piece of data from us that we know the client wants. So
674 * if we know the client wants it, might as well push it to the 703 * if we know the client wants it, might as well push it to the
675 * client. 704 * client.
676 */ 705 */
677static void 706static void
678SendSmooth (client_socket * ns, uint16 face) 707SendSmooth (client *ns, uint16 face)
679{ 708{
680 uint16 smoothface; 709 uint16 smoothface;
681 710
682 /* If we can't find a face, return and set it so we won't try to send this 711 /* If we can't find a face, return and set it so we won't try to send this
683 * again. 712 * again.
… …
693 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) 722 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
694 esrv_send_face (ns, smoothface, 0); 723 esrv_send_face (ns, smoothface, 0);
695 724
696 ns->faces_sent[face] |= NS_FACESENT_SMOOTH; 725 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
697 726
698 packet sl; 727 packet sl ("smooth");
699 728
700 sl << "smooth "
701 << uint16 (face) 729 sl << uint16 (face)
702 << uint16 (smoothface); 730 << uint16 (smoothface);
703 731
704 ns->send_packet (sl); 732 ns->send_packet (sl);
705} 733}
706 734
707 /** 735 /**
708 * Tells client the picture it has to use 736 * Tells client the picture it has to use
709 * to smooth a picture number given as argument. 737 * to smooth a picture number given as argument.
710 */ 738 */
711void 739void
712AskSmooth (char *buf, int len, client_socket * ns) 740AskSmooth (char *buf, int len, client *ns)
713{ 741{
714 uint16 facenbr; 742 SendSmooth (ns, atoi (buf));
715
716 facenbr = atoi (buf);
717 SendSmooth (ns, facenbr);
718} 743}
719 744
720/** 745/**
721 * This handles the general commands from the client (ie, north, fire, cast, 746 * This handles the general commands from the client (ie, north, fire, cast,
722 * etc.) 747 * etc.)
723 */ 748 */
724void 749void
725PlayerCmd (char *buf, int len, player *pl) 750PlayerCmd (char *buf, int len, player *pl)
726{ 751{
727
728 /* The following should never happen with a proper or honest client.
729 * Therefore, the error message doesn't have to be too clear - if
730 * someone is playing with a hacked/non working client, this gives them
731 * an idea of the problem, but they deserve what they get
732 */
733 if (pl->state != ST_PLAYING)
734 {
735 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
736 return;
737 }
738 /* Check if there is a count. In theory, a zero count could also be 752 /* Check if there is a count. In theory, a zero count could also be
739 * sent, so check for that also. 753 * sent, so check for that also.
740 */ 754 */
741 if (atoi (buf) || buf[0] == '0') 755 if (atoi (buf) || buf[0] == '0')
742 { 756 {
743 pl->count = atoi ((char *) buf); 757 pl->count = atoi ((char *) buf);
758
744 buf = strchr (buf, ' '); /* advance beyond the numbers */ 759 buf = strchr (buf, ' '); /* advance beyond the numbers */
745 if (!buf) 760 if (!buf)
746 {
747#ifdef ESRV_DEBUG
748 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
749#endif
750 return; 761 return;
751 } 762
752 buf++; 763 buf++;
753 } 764 }
754 /* This should not happen anymore. */ 765
755 if (pl->ob->speed_left < -1.0)
756 {
757 LOG (llevError, "Player has negative time - shouldn't do command.\n");
758 }
759 /* In c_new.c */
760 execute_newserver_command (pl->ob, (char *) buf); 766 execute_newserver_command (pl->ob, (char *) buf);
767
761 /* Perhaps something better should be done with a left over count. 768 /* Perhaps something better should be done with a left over count.
762 * Cleaning up the input should probably be done first - all actions 769 * Cleaning up the input should probably be done first - all actions
763 * for the command that issued the count should be done before any other 770 * for the command that issued the count should be done before any other
764 * commands. 771 * commands.
765 */ 772 */
766
767 pl->count = 0; 773 pl->count = 0;
768
769} 774}
770 775
771 776
772/** 777/**
773 * This handles the general commands from the client (ie, north, fire, cast, 778 * This handles the general commands from the client (ie, north, fire, cast,
774 * etc.). It is a lot like PlayerCmd above, but is called with the 779 * etc.). It is a lot like PlayerCmd above, but is called with the
775 * 'ncom' method which gives more information back to the client so it 780 * 'ncom' method which gives more information back to the client so it
776 * can throttle. 781 * can throttle.
777 */ 782 */
778void 783void
779NewPlayerCmd (uint8 * buf, int len, player *pl) 784NewPlayerCmd (char *buf, int len, player *pl)
780{ 785{
781 int time, repeat;
782 char command[MAX_BUF];
783 int pktlen;
784
785 if (len < 7) 786 if (len <= 6)
786 { 787 {
787 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 788 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
788 return; 789 return;
789 } 790 }
790 791
791 pktlen = net_uint16 (buf); 792 uint16 cmdid = net_uint16 ((uint8 *)buf);
792 repeat = net_uint32 (buf + 2); 793 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
793 794
794 /* -1 is special - no repeat, but don't update */ 795 /* -1 is special - no repeat, but don't update */
795 if (repeat != -1) 796 if (repeat != -1)
796 pl->count = repeat; 797 pl->count = repeat;
797 798
798 if ((len - 4) >= MAX_BUF) 799 buf += 6; //len -= 6;
799 len = MAX_BUF - 5;
800 800
801 strncpy ((char *) command, (char *) buf + 6, len - 4);
802 command[len - 4] = '\0';
803
804 /* The following should never happen with a proper or honest client.
805 * Therefore, the error message doesn't have to be too clear - if
806 * someone is playing with a hacked/non working client, this gives them
807 * an idea of the problem, but they deserve what they get
808 */
809 if (pl->state != ST_PLAYING)
810 {
811 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
812 return;
813 }
814
815 /* This should not happen anymore. */
816 if (pl->ob->speed_left < -1.0)
817 LOG (llevError, "Player has negative time - shouldn't do command.\n");
818
819 /* In c_new.c */
820 execute_newserver_command (pl->ob, (char *) command); 801 execute_newserver_command (pl->ob, buf);
802
821 /* Perhaps something better should be done with a left over count. 803 /* Perhaps something better should be done with a left over count.
822 * Cleaning up the input should probably be done first - all actions 804 * Cleaning up the input should probably be done first - all actions
823 * for the command that issued the count should be done before any other 805 * for the command that issued the count should be done before any other
824 * commands. 806 * commands.
825 */ 807 */
826 pl->count = 0; 808 pl->count = 0;
827 809
810 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
828 if (FABS (pl->ob->speed) < 0.001) 811 int time = FABS (pl->ob->speed) < 0.001
829 time = MAX_TIME * 100; 812 ? time = MAX_TIME * 100
830 else
831 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 813 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
832 814
833 /* Send confirmation of command execution now */ 815 /* Send confirmation of command execution now */
834 816 packet sl ("comc");
835 packet sl;
836 sl << "comc " << uint16 (pktlen) << uint32 (time); 817 sl << uint16 (cmdid) << uint32 (time);
837 pl->socket->send_packet (sl); 818 pl->socket->send_packet (sl);
838} 819}
839 820
840
841/** This is a reply to a previous query. */ 821/** This is a reply to a previous query. */
842void 822void
843ReplyCmd (char *buf, int len, player *pl) 823ReplyCmd (char *buf, int len, client *ns)
844{ 824{
825 if (!ns->pl)
826 return; //TODO: depends on the exact reply we are after
827 //TODO: but right now, we always have a ns->pl
828
829 player *pl = ns->pl;
830
845 /* This is to synthesize how the data would be stored if it 831 /* This is to synthesize how the data would be stored if it
846 * was normally entered. A bit of a hack, and should be cleaned up 832 * was normally entered. A bit of a hack, and should be cleaned up
847 * once all the X11 code is removed from the server. 833 * once all the X11 code is removed from the server.
848 * 834 *
849 * We pass 13 to many of the functions because this way they 835 * We pass 13 to many of the functions because this way they
850 * think it was the carriage return that was entered, and the 836 * think it was the carriage return that was entered, and the
851 * function then does not try to do additional input. 837 * function then does not try to do additional input.
… …
854 840
855 /* this avoids any hacking here */ 841 /* this avoids any hacking here */
856 842
857 switch (pl->state) 843 switch (pl->state)
858 { 844 {
859 case ST_PLAYING: 845 case ST_PLAYING:
860 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 846 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
861 break; 847 break;
862 848
863 case ST_PLAY_AGAIN: 849 case ST_PLAY_AGAIN:
864 /* We can check this for return value (2==quit). Maybe we 850 /* We can check this for return value (2==quit). Maybe we
865 * should, and do something appropriate? 851 * should, and do something appropriate?
866 */ 852 */
867 receive_play_again (pl->ob, buf[0]); 853 receive_play_again (pl->ob, buf[0]);
868 break; 854 break;
869 855
870 case ST_ROLL_STAT: 856 case ST_ROLL_STAT:
871 key_roll_stat (pl->ob, buf[0]); 857 key_roll_stat (pl->ob, buf[0]);
872 break; 858 break;
873 859
874 case ST_CHANGE_CLASS: 860 case ST_CHANGE_CLASS:
875
876 key_change_class (pl->ob, buf[0]); 861 key_change_class (pl->ob, buf[0]);
877 break; 862 break;
878 863
879 case ST_CONFIRM_QUIT: 864 case ST_CONFIRM_QUIT:
880 key_confirm_quit (pl->ob, buf[0]); 865 key_confirm_quit (pl->ob, buf[0]);
881 break; 866 break;
882 867
883 case ST_CONFIGURE: 868 case ST_CONFIGURE:
884 LOG (llevError, "In client input handling, but into configure state\n"); 869 LOG (llevError, "In client input handling, but into configure state\n");
885 pl->state = ST_PLAYING; 870 pl->state = ST_PLAYING;
886 break; 871 break;
887 872
888 case ST_GET_NAME: 873 case ST_GET_NAME:
889 receive_player_name (pl->ob, 13); 874 receive_player_name (pl->ob, 13);
890 break; 875 break;
891 876
892 case ST_GET_PASSWORD: 877 case ST_GET_PASSWORD:
893 case ST_CONFIRM_PASSWORD: 878 case ST_CONFIRM_PASSWORD:
894 receive_player_password (pl->ob, 13); 879 receive_player_password (pl->ob, 13);
895 break; 880 break;
896 881
897 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 882 case ST_GET_PARTY_PASSWORD: /* Get password for party */
898 receive_party_password (pl->ob, 13); 883 receive_party_password (pl->ob, 13);
899 break; 884 break;
900 885
901 default: 886 default:
902 LOG (llevError, "Unknown input state: %d\n", pl->state); 887 LOG (llevError, "Unknown input state: %d\n", pl->state);
903 } 888 }
904} 889}
905 890
906/** 891/**
907 * Client tells its version. If there is a mismatch, we close the 892 * Client tells its version. If there is a mismatch, we close the
… …
909 * something older than the server. If we assume the client will be 894 * something older than the server. If we assume the client will be
910 * backwards compatible, having it be a later version should not be a 895 * backwards compatible, having it be a later version should not be a
911 * problem. 896 * problem.
912 */ 897 */
913void 898void
914VersionCmd (char *buf, int len, client_socket * ns) 899VersionCmd (char *buf, int len, client * ns)
915{ 900{
916 char *cp;
917 char version_warning[256];
918
919 if (!buf) 901 if (!buf)
920 { 902 {
921 LOG (llevError, "CS: received corrupted version command\n"); 903 LOG (llevError, "CS: received corrupted version command\n");
922 return; 904 return;
923 } 905 }
924 906
925 ns->cs_version = atoi (buf); 907 ns->cs_version = atoi (buf);
926 ns->sc_version = ns->cs_version; 908 ns->sc_version = ns->cs_version;
909
910 LOG (llevDebug, "connection from client <%s>\n", buf);
911
912
913 //TODO: should log here just for statistics
914
927 if (VERSION_CS != ns->cs_version) 915 //if (VERSION_CS != ns->cs_version)
928 { 916 // unchecked;
929#ifdef ESRV_DEBUG 917
930 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
931#endif
932 }
933 cp = strchr (buf + 1, ' '); 918 char *cp = strchr (buf + 1, ' ');
934 if (!cp) 919 if (!cp)
935 return; 920 return;
921
936 ns->sc_version = atoi (cp); 922 ns->sc_version = atoi (cp);
923
937 if (VERSION_SC != ns->sc_version) 924 //if (VERSION_SC != ns->sc_version)
938 { 925 // unchecked;
939#ifdef ESRV_DEBUG 926
940 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
941#endif
942 }
943 cp = strchr (cp + 1, ' '); 927 cp = strchr (cp + 1, ' ');
928
944 if (cp) 929 if (cp)
945 { 930 {
946 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 931 assign (ns->version, cp + 1);
947 932
948 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1);
949
950 /* This is first implementation - i skip all beta DX clients with it
951 * Add later stuff here for other clients
952 */
953
954 /* these are old dxclients */
955 /* Version 1024 added support for singular + plural name values -
956 * requiing this minimal value reduces complexity of that code, and it
957 * has been around for a long time.
958 */
959 if (ns->sc_version < 1026) 933 if (ns->sc_version < 1026)
960 { 934 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
961 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
962 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 935 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
963 ns->send_packet (version_warning);
964 }
965
966 } 936 }
967} 937}
968 938
969/** sound related functions. */ 939/** sound related functions. */
970
971void 940void
972SetSound (char *buf, int len, client_socket * ns) 941SetSound (char *buf, int len, client * ns)
973{ 942{
974 ns->sound = atoi (buf); 943 ns->sound = atoi (buf);
975} 944}
976 945
977/** client wants the map resent */ 946/** client wants the map resent */
978 947
979void 948void
980MapRedrawCmd (char *buf, int len, player *pl) 949MapRedrawCmd (char *buf, int len, player *pl)
981{ 950{
982
983/* This function is currently disabled; just clearing the map state results in 951/* This function is currently disabled; just clearing the map state results in
984 * display errors. It should clear the cache and send a newmap command. 952 * display errors. It should clear the cache and send a newmap command.
985 * Unfortunately this solution does not work because some client versions send 953 * Unfortunately this solution does not work because some client versions send
986 * a mapredraw command after receiving a newmap command. 954 * a mapredraw command after receiving a newmap command.
987 */ 955 */
988#if 0
989 /* Okay, this is MAJOR UGLY. but the only way I know how to
990 * clear the "cache"
991 */
992 memset (&pl->socket->lastmap, 0, sizeof (struct Map));
993 draw_client_map (pl->ob);
994#endif
995} 956}
996 957
997/** 958/**
998 * Moves an object (typically, container to inventory). 959 * Moves an object (typically, container to inventory).
999 * syntax is: move (to) (tag) (nrof) 960 * syntax is: move (to) (tag) (nrof)
… …
1002MoveCmd (char *buf, int len, player *pl) 963MoveCmd (char *buf, int len, player *pl)
1003{ 964{
1004 int vals[3], i; 965 int vals[3], i;
1005 966
1006 /* A little funky here. We only cycle for 2 records, because 967 /* A little funky here. We only cycle for 2 records, because
1007 * we obviously am not going to find a space after the third 968 * we obviously are not going to find a space after the third
1008 * record. Perhaps we should just replace this with a 969 * record. Perhaps we should just replace this with a
1009 * sscanf? 970 * sscanf?
1010 */ 971 */
1011 for (i = 0; i < 2; i++) 972 for (i = 0; i < 2; i++)
1012 { 973 {
1013 vals[i] = atoi (buf); 974 vals[i] = atoi (buf);
975
1014 if (!(buf = strchr (buf, ' '))) 976 if (!(buf = strchr (buf, ' ')))
1015 { 977 {
1016 LOG (llevError, "Incomplete move command: %s\n", buf); 978 LOG (llevError, "Incomplete move command: %s\n", buf);
1017 return; 979 return;
1018 } 980 }
981
1019 buf++; 982 buf++;
1020 } 983 }
984
1021 vals[2] = atoi (buf); 985 vals[2] = atoi (buf);
1022 986
1023/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 987/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1024 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 988 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1025} 989}
1026
1027
1028 990
1029/****************************************************************************** 991/******************************************************************************
1030 * 992 *
1031 * Start of commands the server sends to the client. 993 * Start of commands the server sends to the client.
1032 * 994 *
… …
1035/** 997/**
1036 * Asks the client to query the user. This way, the client knows 998 * Asks the client to query the user. This way, the client knows
1037 * it needs to send something back (vs just printing out a message) 999 * it needs to send something back (vs just printing out a message)
1038 */ 1000 */
1039void 1001void
1040send_query (client_socket * ns, uint8 flags, char *text) 1002send_query (client *ns, uint8 flags, char *text)
1041{ 1003{
1042 char buf[MAX_BUF];
1043
1044 sprintf (buf, "query %d %s", flags, text ? text : ""); 1004 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1045 ns->send_packet (buf);
1046} 1005}
1047 1006
1048#define AddIfInt64(Old,New,Type) if (Old != New) {\ 1007#define AddIfInt64(Old,New,Type) if (Old != New) {\
1049 Old = New; \ 1008 Old = New; \
1050 sl << uint8 (Type) << uint64 (New); \ 1009 sl << uint8 (Type) << uint64 (New); \
… …
1080esrv_update_stats (player *pl) 1039esrv_update_stats (player *pl)
1081{ 1040{
1082 char buf[MAX_BUF]; 1041 char buf[MAX_BUF];
1083 uint16 flags; 1042 uint16 flags;
1084 1043
1085 packet sl; 1044 packet sl ("stats");
1086 sl << "stats ";
1087 1045
1088 if (pl->ob != NULL) 1046 if (pl->ob)
1089 { 1047 {
1090 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1048 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);
1091 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1049 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);
1092 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1050 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);
1093 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1051 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
… …
1101 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1059 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);
1102 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1060 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1103 } 1061 }
1104 1062
1105 if (pl->socket->exp64) 1063 if (pl->socket->exp64)
1106 {
1107 uint8 s;
1108
1109 for (s = 0; s < NUM_SKILLS; s++) 1064 for (int s = 0; s < NUM_SKILLS; s++)
1110 {
1111 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 1065 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1112 { 1066 {
1113 /* Always send along the level if exp changes. This is only 1067 /* Always send along the level if exp changes. This is only
1114 * 1 extra byte, but keeps processing simpler. 1068 * 1 extra byte, but keeps processing simpler.
1115 */ 1069 */
1116 sl << uint8 (s + CS_STAT_SKILLINFO) 1070 sl << uint8 (s + CS_STAT_SKILLINFO)
1117 << uint8 (pl->last_skill_ob[s]->level) 1071 << uint8 (pl->last_skill_ob[s]->level)
1118 << uint64 (pl->last_skill_ob[s]->stats.exp); 1072 << uint64 (pl->last_skill_ob[s]->stats.exp);
1119 1073
1120 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; 1074 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1121 } 1075 }
1122 }
1123 }
1124 1076
1125 if (pl->socket->exp64) 1077 if (pl->socket->exp64)
1126 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1078 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }
1127 else 1079 else
1128 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } 1080 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
… …
1146 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1098 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1147 1099
1148 if (pl->socket->sc_version < 1025) 1100 if (pl->socket->sc_version < 1025)
1149 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1101 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1150 else 1102 else
1151 {
1152 int i;
1153
1154 for (i = 0; i < NROFATTACKS; i++) 1103 for (int i = 0; i < NROFATTACKS; i++)
1155 { 1104 {
1156 /* Skip ones we won't send */ 1105 /* Skip ones we won't send */
1157 if (atnr_cs_stat[i] == -1) 1106 if (atnr_cs_stat[i] == -1)
1158 continue; 1107 continue;
1159 1108
1160 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1109 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1161 } 1110 }
1162 }
1163 1111
1164 if (pl->socket->monitor_spells) 1112 if (pl->socket->monitor_spells)
1165 { 1113 {
1166 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1114 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1167 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1115 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
… …
1184void 1132void
1185esrv_new_player (player *pl, uint32 weight) 1133esrv_new_player (player *pl, uint32 weight)
1186{ 1134{
1187 pl->last_weight = weight; 1135 pl->last_weight = weight;
1188 1136
1189 packet sl; 1137 packet sl ("player");
1190 sl << "player ";
1191 1138
1192 sl << uint32 (pl->ob->count) 1139 sl << uint32 (pl->ob->count)
1193 << uint32 (weight) 1140 << uint32 (weight)
1194 << uint32 (pl->ob->face->number) 1141 << uint32 (pl->ob->face->number)
1195 << data8 (pl->ob->name); 1142 << data8 (pl->ob->name);
… …
1204 * 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
1205 * 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
1206 * when the player logs in and picks stuff up. 1153 * when the player logs in and picks stuff up.
1207 */ 1154 */
1208void 1155void
1209esrv_send_animation (client_socket * ns, short anim_num) 1156esrv_send_animation (client * ns, short anim_num)
1210{ 1157{
1211 int i;
1212
1213 /* 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
1214 * 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
1215 * range, it must be a valid animation. 1160 * range, it must be a valid animation.
1216 */ 1161 */
1217 if (anim_num < 0 || anim_num > num_animations) 1162 if (anim_num < 0 || anim_num > num_animations)
1218 { 1163 {
1219 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); 1164 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1220 return; 1165 return;
1221 } 1166 }
1222 1167
1223 packet sl; 1168 packet sl ("anim");
1224 1169
1225 sl << "anim "
1226 << uint16 (anim_num) 1170 sl << uint16 (anim_num)
1227 << uint16 (0); /* flags - not used right now */ 1171 << uint16 (0); /* flags - not used right now */
1228 1172
1229 /* Build up the list of faces. Also, send any information (ie, the 1173 /* Build up the list of faces. Also, send any information (ie, the
1230 * the face itself) down to the client. 1174 * the face itself) down to the client.
1231 */ 1175 */
1232 for (i = 0; i < animations[anim_num].num_animations; i++) 1176 for (int i = 0; i < animations[anim_num].num_animations; i++)
1233 { 1177 {
1234 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1178 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1235 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1179 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1180
1236 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 1181 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1237 } 1182 }
1238 1183
1239 ns->send_packet (sl); 1184 ns->send_packet (sl);
1240 1185
… …
1251/** 1196/**
1252 * This adds face_num to a map cell at x,y. If the client doesn't have 1197 * This adds face_num to a map cell at x,y. If the client doesn't have
1253 * the face yet, we will also send it. 1198 * the face yet, we will also send it.
1254 */ 1199 */
1255static void 1200static void
1256esrv_map_setbelow (client_socket * ns, int x, int y, short face_num, struct Map *newmap) 1201esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1257{ 1202{
1258 if (newmap->cells[x][y].count >= MAP_LAYERS) 1203 if (newmap->cells[x][y].count >= MAP_LAYERS)
1259 { 1204 {
1205 //TODO: one or the other, can't both have abort and return, verify and act
1260 LOG (llevError, "Too many faces in map cell %d %d\n", x, y); 1206 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1261 return; 1207 return;
1262 abort (); 1208 abort ();
1263 } 1209 }
1264 1210
1265 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; 1211 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1266 newmap->cells[x][y].count++; 1212 newmap->cells[x][y].count++;
1267 1213
1268 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1214 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1269 esrv_send_face (ns, face_num, 0); 1215 esrv_send_face (ns, face_num, 0);
1270}
1271
1272struct LayerCell
1273{
1274 uint16 xy;
1275 short face;
1276};
1277
1278struct MapLayer
1279{
1280 int count;
1281 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1282};
1283
1284/** Checkes if map cells have changed */
1285static int
1286mapcellchanged (client_socket * ns, int i, int j, struct Map *newmap)
1287{
1288 int k;
1289
1290 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1291 return 1;
1292 for (k = 0; k < newmap->cells[i][j].count; k++)
1293 {
1294 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1295 {
1296 return 1;
1297 }
1298 }
1299 return 0;
1300}
1301
1302/**
1303 * Basically, what this does is pack the data into layers.
1304 * cnum is the client number, cur is the the buffer we put all of
1305 * this data into. we return the end of the data. layers is
1306 * how many layers of data we should back.
1307 */
1308static uint8 *
1309compactlayer (client_socket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1310{
1311 int x, y, k;
1312 int face;
1313 unsigned char *fcur;
1314 struct MapLayer layers[MAP_LAYERS];
1315
1316 for (k = 0; k < MAP_LAYERS; k++)
1317 layers[k].count = 0;
1318 fcur = cur;
1319 for (x = 0; x < ns->mapx; x++)
1320 {
1321 for (y = 0; y < ns->mapy; y++)
1322 {
1323 if (!mapcellchanged (ns, x, y, newmap))
1324 continue;
1325 if (newmap->cells[x][y].count == 0)
1326 {
1327 *cur = x * ns->mapy + y; /* mark empty space */
1328 cur++;
1329 continue;
1330 }
1331 for (k = 0; k < newmap->cells[x][y].count; k++)
1332 {
1333 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1334 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1335 layers[k].count++;
1336 }
1337 }
1338 }
1339 /* If no data, return now. */
1340 if (fcur == cur && layers[0].count == 0)
1341 return cur;
1342 *cur = 255; /* mark end of explicitly cleared cells */
1343 cur++;
1344 /* First pack by layers. */
1345 for (k = 0; k < numlayers; k++)
1346 {
1347 if (layers[k].count == 0)
1348 break; /* once a layer is entirely empty, no layer below it can
1349 have anything in it either */
1350 /* Pack by entries in thie layer */
1351 for (x = 0; x < layers[k].count;)
1352 {
1353 fcur = cur;
1354 *cur = layers[k].lcells[x].face >> 8;
1355 cur++;
1356 *cur = layers[k].lcells[x].face & 0xFF;
1357 cur++;
1358 face = layers[k].lcells[x].face;
1359 /* Now, we back the redundant data into 1 byte xy pairings */
1360 for (y = x; y < layers[k].count; y++)
1361 {
1362 if (layers[k].lcells[y].face == face)
1363 {
1364 *cur = (uint8) layers[k].lcells[y].xy;
1365 cur++;
1366 layers[k].lcells[y].face = -1;
1367 }
1368 }
1369 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1370 /* forward over the now redundant data */
1371 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1372 x++;
1373 }
1374 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1375 }
1376 return cur;
1377} 1216}
1378 1217
1379/** Clears a map cell */ 1218/** Clears a map cell */
1380static void 1219static void
1381map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1220map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
… …
1393#define MAX_LAYERS 3 1232#define MAX_LAYERS 3
1394 1233
1395/* Using a global really isn't a good approach, but saves the over head of 1234/* Using a global really isn't a good approach, but saves the over head of
1396 * allocating and deallocating such a block of data each time run through, 1235 * allocating and deallocating such a block of data each time run through,
1397 * and saves the space of allocating this in the socket object when we only 1236 * and saves the space of allocating this in the socket object when we only
1398 * need it for this cycle. If the serve is ever threaded, this needs to be 1237 * need it for this cycle. If the server is ever threaded, this needs to be
1399 * re-examined. 1238 * re-examined.
1400 */ 1239 */
1401
1402static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1240static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1403 1241
1404/** 1242/**
1405 * Returns true if any of the heads for this 1243 * Returns true if any of the heads for this
1406 * space is set. Returns false if all are blank - this is used 1244 * space is set. Returns false if all are blank - this is used
1407 * for empty space checking. 1245 * for empty space checking.
1408 */ 1246 */
1409static inline int 1247static inline int
1410have_head (int ax, int ay) 1248have_head (int ax, int ay)
1411{ 1249{
1412
1413 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1250 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1414 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) 1251 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1415 return 1; 1252 return 1;
1253
1416 return 0; 1254 return 0;
1417} 1255}
1418 1256
1419/** 1257/**
1420 * check_head is a bit simplistic version of update_space below. 1258 * check_head is a bit simplistic version of update_space below.
1421 * basically, it only checks the that the head on space ax,ay at layer 1259 * basically, it only checks the that the head on space ax,ay at layer
1422 * needs to get sent - if so, it adds the data, sending the head 1260 * needs to get sent - if so, it adds the data, sending the head
1423 * if needed, and returning 1. If this no data needs to get 1261 * if needed, and returning 1. If this no data needs to get
1424 * sent, it returns zero. 1262 * sent, it returns zero.
1425 */ 1263 */
1426static int 1264static int
1427check_head (packet &sl, client_socket &ns, int ax, int ay, int layer) 1265check_head (packet &sl, client &ns, int ax, int ay, int layer)
1428{ 1266{
1429 short face_num; 1267 short face_num;
1430 1268
1431 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) 1269 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1432 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; 1270 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
… …
1464 * numbers the spaces differently - I think this was a leftover from 1302 * numbers the spaces differently - I think this was a leftover from
1465 * the map command, where the faces stack up. Sinces that is no longer 1303 * the map command, where the faces stack up. Sinces that is no longer
1466 * the case, it seems to make more sense to have these layer values 1304 * the case, it seems to make more sense to have these layer values
1467 * actually match. 1305 * actually match.
1468 */ 1306 */
1469
1470static int 1307static int
1471update_space (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1308update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1472{ 1309{
1473 object *ob, *head; 1310 object *ob, *head;
1474 uint16 face_num; 1311 uint16 face_num;
1475 int bx, by, i; 1312 int bx, by, i;
1476 1313
… …
1689 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ 1526 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1690 * take. 1527 * take.
1691 */ 1528 */
1692 1529
1693static inline int 1530static inline int
1694update_smooth (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1531update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1695{ 1532{
1696 object *ob; 1533 object *ob;
1697 int smoothlevel; /* old face_num; */ 1534 int smoothlevel; /* old face_num; */
1698 1535
1699 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1536 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
… …
1733 * Returns the size of a data for a map square as returned by 1570 * Returns the size of a data for a map square as returned by
1734 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1571 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1735 * available. 1572 * available.
1736 */ 1573 */
1737int 1574int
1738getExtendedMapInfoSize (client_socket * ns) 1575getExtendedMapInfoSize (client * ns)
1739{ 1576{
1740 int result = 0; 1577 int result = 0;
1741 1578
1742 if (ns->ext_mapinfos) 1579 if (ns->ext_mapinfos)
1743 { 1580 {
1744 if (ns->EMI_smooth) 1581 if (ns->EMI_smooth)
1745 result += 1; /*One byte for smoothlevel */ 1582 result += 1; /*One byte for smoothlevel */
1746 } 1583 }
1584
1747 return result; 1585 return result;
1748} 1586}
1749 1587
1750/** 1588/**
1751 * This function uses the new map1 protocol command to send the map 1589 * This function uses the new map1 protocol command to send the map
… …
1779 uint8 eentrysize; 1617 uint8 eentrysize;
1780 uint16 ewhatstart, ewhatflag; 1618 uint16 ewhatstart, ewhatflag;
1781 uint8 extendedinfos; 1619 uint8 extendedinfos;
1782 maptile *m; 1620 maptile *m;
1783 1621
1784 client_socket &socket = *pl->contr->socket; 1622 client &socket = *pl->contr->socket;
1785 1623
1786 check_map_change (pl->contr); 1624 check_map_change (pl->contr);
1787 1625
1788 packet sl; 1626 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1789 packet esl; 1627 packet esl;
1790 1628
1791 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1792 startlen = sl.length (); 1629 startlen = sl.length ();
1793 1630
1794 /*Extendedmapinfo structure initialisation */ 1631 /*Extendedmapinfo structure initialisation */
1795 if (socket.ext_mapinfos) 1632 if (socket.ext_mapinfos)
1796 { 1633 {
… …
1840 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) 1677 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1841 { 1678 {
1842 ax = 0; 1679 ax = 0;
1843 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1680 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1844 { 1681 {
1845
1846 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1682 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1847 1683
1848 /* If this space is out of the normal viewable area, we only check 1684 /* If this space is out of the normal viewable area, we only check
1849 * the heads value ax or ay will only be greater than what 1685 * the heads value ax or ay will only be greater than what
1850 * the client wants if using the map1a command - this is because 1686 * the client wants if using the map1a command - this is because
… …
2181 return; 2017 return;
2182 2018
2183 memset (&newmap, 0, sizeof (struct Map)); 2019 memset (&newmap, 0, sizeof (struct Map));
2184 2020
2185 for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++) 2021 for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++)
2186 {
2187 for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++) 2022 for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++)
2188 { 2023 {
2189 ax = i; 2024 ax = i;
2190 ay = j; 2025 ay = j;
2191 m = pm; 2026 m = pm;
2192 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2027 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2028
2193 if (mflags & P_OUT_OF_MAP) 2029 if (mflags & P_OUT_OF_MAP)
2194 continue; 2030 continue;
2195 if (mflags & P_NEED_UPDATE) 2031
2196 update_position (m, ax, ay);
2197 /* If a map is visible to the player, we don't want to swap it out 2032 /* If a map is visible to the player, we don't want to swap it out
2198 * just to reload it. This should really call something like 2033 * just to reload it. This should really call something like
2199 * swap_map, but this is much more efficient and 'good enough' 2034 * swap_map, but this is much more efficient and 'good enough'
2200 */ 2035 */
2201 if (mflags & P_NEW_MAP) 2036 if (mflags & P_NEW_MAP)
2202 m->timeout = 50; 2037 m->timeout = 50;
2203 } 2038 }
2204 } 2039
2205 /* do LOS after calls to update_position */ 2040 /* do LOS after calls to update_position */
2206 if (pl->contr->do_los) 2041 if (pl->contr->do_los)
2207 { 2042 {
2208 update_los (pl); 2043 update_los (pl);
2209 pl->contr->do_los = 0; 2044 pl->contr->do_los = 0;
… …
2232/** 2067/**
2233 * This sends the skill number to name mapping. We ignore 2068 * This sends the skill number to name mapping. We ignore
2234 * the params - we always send the same info no matter what. 2069 * the params - we always send the same info no matter what.
2235 */ 2070 */
2236void 2071void
2237send_skill_info (client_socket *ns, char *params) 2072send_skill_info (client *ns, char *params)
2238{ 2073{
2239 packet sl; 2074 packet sl;
2240 sl << "replyinfo skill_info\n"; 2075 sl << "replyinfo skill_info\n";
2241 2076
2242 for (int i = 1; i < NUM_SKILLS; i++) 2077 for (int i = 1; i < NUM_SKILLS; i++)
… …
2254/** 2089/**
2255 * This sends the spell path to name mapping. We ignore 2090 * This sends the spell path to name mapping. We ignore
2256 * the params - we always send the same info no matter what. 2091 * the params - we always send the same info no matter what.
2257 */ 2092 */
2258void 2093void
2259send_spell_paths (client_socket * ns, char *params) 2094send_spell_paths (client * ns, char *params)
2260{ 2095{
2261 packet sl; 2096 packet sl;
2262 2097
2263 sl << "replyinfo spell_paths\n"; 2098 sl << "replyinfo spell_paths\n";
2264 2099
… …
2337 { 2172 {
2338 LOG (llevError, "Invalid call to esrv_remove_spell"); 2173 LOG (llevError, "Invalid call to esrv_remove_spell");
2339 return; 2174 return;
2340 } 2175 }
2341 2176
2342 packet sl; 2177 packet sl ("delspell");
2343 2178
2344 sl << "delspell "
2345 << uint32 (spell->count); 2179 sl << uint32 (spell->count);
2346 2180
2347 pl->socket->send_packet (sl); 2181 pl->socket->send_packet (sl);
2348} 2182}
2349 2183
2350/* appends the spell *spell to the Socklist we will send the data to. */ 2184/* appends the spell *spell to the Socklist we will send the data to. */
… …
2403 } 2237 }
2404 2238
2405 if (!pl->socket->monitor_spells) 2239 if (!pl->socket->monitor_spells)
2406 return; 2240 return;
2407 2241
2408 packet sl; 2242 packet sl ("addspell");
2409
2410 sl << "addspell ";
2411 2243
2412 if (!spell) 2244 if (!spell)
2413 { 2245 {
2414 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2246 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
2415 { 2247 {

Diff Legend

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