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.42 by root, Sat Dec 16 03:08:26 2006 UTC vs.
Revision 1.54 by root, Mon Dec 25 14:54:44 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
… …
86 -1, /* life stealing */ 83 -1, /* life stealing */
87 -1 /* Disease - not fully done yet */ 84 -1 /* Disease - not fully done yet */
88}; 85};
89 86
90static void 87static void
91socket_map_scroll (client * ns, int dx, int dy) 88socket_map_scroll (client *ns, int dx, int dy)
92{ 89{
93 struct Map newmap; 90 struct Map newmap;
94 int x, y, mx, my; 91 int x, y, mx, my;
95 92
96 ns->send_packet_printf ("map_scroll %d %d", dx, dy); 93 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
… …
141} 138}
142 139
143static void 140static void
144clear_map (player *pl) 141clear_map (player *pl)
145{ 142{
146 client &socket = *pl->socket;
147
148 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 143 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
149 144
150 if (socket.newmapcmd == 1) 145 if (pl->ns->newmapcmd == 1)
151 socket.send_packet ("newmap"); 146 pl->ns->send_packet ("newmap");
152 147
153 socket.update_look = 1; 148 pl->ns->floorbox_reset ();
154 socket.look_position = 0;
155} 149}
156 150
157/** check for map change and send new map data */ 151/** check for map change and send new map data */
158static void 152static void
159check_map_change (player *pl) 153check_map_change (player *pl)
160{ 154{
161 client &socket = *pl->socket; 155 client &socket = *pl->ns;
162 object *ob = pl->ob; 156 object *ob = pl->ob;
163 char buf[MAX_BUF]; /* eauugggh */ 157 char buf[MAX_BUF]; /* eauugggh */
164 158
165 if (socket.current_map != ob->map) 159 if (socket.current_map != ob->map)
166 { 160 {
… …
200 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 194 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
201 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
202 else 196 else
203 { 197 {
204 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);
205 socket.update_look = 1; 199 socket.floorbox_reset ();
206 socket.look_position = 0;
207 } 200 }
208 } 201 }
209 202
210 socket.current_x = ob->x; 203 socket.current_x = ob->x;
211 socket.current_y = ob->y; 204 socket.current_y = ob->y;
… …
260{ 253{
261 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 254 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
262} 255}
263 256
264void 257void
258ExtiCmd (char *buf, int len, client *ns)
259{
260 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
261}
262
263void
265MapInfoCmd (char *buf, int len, player *pl) 264MapInfoCmd (char *buf, int len, player *pl)
266{ 265{
267 // <mapinfo tag spatial tile-path 266 // <mapinfo tag spatial tile-path
268 // >mapinfo tag spatial flags x y w h hash 267 // >mapinfo tag spatial flags x y w h hash
269 268
… …
281 buf += 8; 280 buf += 8;
282 281
283 // initial map and its origin 282 // initial map and its origin
284 maptile *map = pl->ob->map; 283 maptile *map = pl->ob->map;
285 sint16 dx, dy; 284 sint16 dx, dy;
286 int mapx = pl->socket->mapx / 2 - pl->ob->x; 285 int mapx = pl->ns->mapx / 2 - pl->ob->x;
287 int mapy = pl->socket->mapy / 2 - pl->ob->y; 286 int mapy = pl->ns->mapy / 2 - pl->ob->y;
288 int max_distance = 8; // limit maximum path length to something generous 287 int max_distance = 8; // limit maximum path length to something generous
289 288
290 while (*buf && map && max_distance) 289 while (*buf && map && max_distance)
291 { 290 {
292 int dir = *buf++; 291 int dir = *buf++;
… …
343 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 342 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
344 } 343 }
345 else 344 else
346 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 345 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
347 346
348 pl->socket->send_packet (bigbuf); 347 pl->ns->send_packet (bigbuf);
349} 348}
350 349
351/** This is the Setup cmd - easy first implementation */ 350/** This is the Setup cmd - easy first implementation */
352void 351void
353SetUp (char *buf, int len, client * ns) 352SetUp (char *buf, int len, client * ns)
… …
400 { 399 {
401 ns->sound = atoi (param); 400 ns->sound = atoi (param);
402 safe_strcat (cmdback, param, &slen, HUGE_BUF); 401 safe_strcat (cmdback, param, &slen, HUGE_BUF);
403 } 402 }
404 else if (!strcmp (cmd, "exp64")) 403 else if (!strcmp (cmd, "exp64"))
405 {
406 ns->exp64 = atoi (param);
407 safe_strcat (cmdback, param, &slen, HUGE_BUF); 404 safe_strcat (cmdback, param, &slen, HUGE_BUF);
408 }
409 else if (!strcmp (cmd, "spellmon")) 405 else if (!strcmp (cmd, "spellmon"))
410 { 406 {
411 ns->monitor_spells = atoi (param); 407 ns->monitor_spells = atoi (param);
412 safe_strcat (cmdback, param, &slen, HUGE_BUF); 408 safe_strcat (cmdback, param, &slen, HUGE_BUF);
413 } 409 }
… …
570 * it either has to be here or init_sockets needs to be exported. 566 * it either has to be here or init_sockets needs to be exported.
571 */ 567 */
572void 568void
573AddMeCmd (char *buf, int len, client * ns) 569AddMeCmd (char *buf, int len, client * ns)
574{ 570{
575 Settings oldsettings; 571 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
576
577 oldsettings = settings;
578 if (ns->status != Ns_Add || add_player (ns))
579 ns->send_packet ("addme_failed");
580 else
581 ns->send_packet ("addme_success");
582
583 settings = oldsettings;
584} 572}
585 573
586/** Reply to ExtendedInfos command */ 574/** Reply to ExtendedInfos command */
587void 575void
588ToggleExtendedInfos (char *buf, int len, client * ns) 576ToggleExtendedInfos (char *buf, int len, client * ns)
… …
705 * a piece of data from us that we know the client wants. So 693 * a piece of data from us that we know the client wants. So
706 * if we know the client wants it, might as well push it to the 694 * if we know the client wants it, might as well push it to the
707 * client. 695 * client.
708 */ 696 */
709static void 697static void
710SendSmooth (client * ns, uint16 face) 698SendSmooth (client *ns, uint16 face)
711{ 699{
712 uint16 smoothface; 700 uint16 smoothface;
713 701
714 /* If we can't find a face, return and set it so we won't try to send this 702 /* If we can't find a face, return and set it so we won't try to send this
715 * again. 703 * again.
… …
725 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) 713 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
726 esrv_send_face (ns, smoothface, 0); 714 esrv_send_face (ns, smoothface, 0);
727 715
728 ns->faces_sent[face] |= NS_FACESENT_SMOOTH; 716 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
729 717
730 packet sl; 718 packet sl ("smooth");
731 719
732 sl << "smooth "
733 << uint16 (face) 720 sl << uint16 (face)
734 << uint16 (smoothface); 721 << uint16 (smoothface);
735 722
736 ns->send_packet (sl); 723 ns->send_packet (sl);
737} 724}
738 725
739 /** 726 /**
740 * Tells client the picture it has to use 727 * Tells client the picture it has to use
741 * to smooth a picture number given as argument. 728 * to smooth a picture number given as argument.
742 */ 729 */
743void 730void
744AskSmooth (char *buf, int len, client * ns) 731AskSmooth (char *buf, int len, client *ns)
745{ 732{
746 uint16 facenbr; 733 SendSmooth (ns, atoi (buf));
747
748 facenbr = atoi (buf);
749 SendSmooth (ns, facenbr);
750} 734}
751 735
752/** 736/**
753 * This handles the general commands from the client (ie, north, fire, cast, 737 * This handles the general commands from the client (ie, north, fire, cast,
754 * etc.) 738 * etc.)
755 */ 739 */
756void 740void
757PlayerCmd (char *buf, int len, player *pl) 741PlayerCmd (char *buf, int len, player *pl)
758{ 742{
759
760 /* The following should never happen with a proper or honest client.
761 * Therefore, the error message doesn't have to be too clear - if
762 * someone is playing with a hacked/non working client, this gives them
763 * an idea of the problem, but they deserve what they get
764 */
765 if (pl->state != ST_PLAYING)
766 {
767 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
768 return;
769 }
770 /* Check if there is a count. In theory, a zero count could also be 743 /* Check if there is a count. In theory, a zero count could also be
771 * sent, so check for that also. 744 * sent, so check for that also.
772 */ 745 */
773 if (atoi (buf) || buf[0] == '0') 746 if (atoi (buf) || buf[0] == '0')
774 { 747 {
775 pl->count = atoi ((char *) buf); 748 pl->count = atoi ((char *) buf);
749
776 buf = strchr (buf, ' '); /* advance beyond the numbers */ 750 buf = strchr (buf, ' '); /* advance beyond the numbers */
777 if (!buf) 751 if (!buf)
778 {
779#ifdef ESRV_DEBUG
780 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
781#endif
782 return; 752 return;
783 } 753
784 buf++; 754 buf++;
785 } 755 }
786 /* This should not happen anymore. */ 756
787 if (pl->ob->speed_left < -1.0)
788 {
789 LOG (llevError, "Player has negative time - shouldn't do command.\n");
790 }
791 /* In c_new.c */
792 execute_newserver_command (pl->ob, (char *) buf); 757 execute_newserver_command (pl->ob, (char *) buf);
758
793 /* Perhaps something better should be done with a left over count. 759 /* Perhaps something better should be done with a left over count.
794 * Cleaning up the input should probably be done first - all actions 760 * Cleaning up the input should probably be done first - all actions
795 * for the command that issued the count should be done before any other 761 * for the command that issued the count should be done before any other
796 * commands. 762 * commands.
797 */ 763 */
798
799 pl->count = 0; 764 pl->count = 0;
800
801} 765}
802 766
803 767
804/** 768/**
805 * This handles the general commands from the client (ie, north, fire, cast, 769 * This handles the general commands from the client (ie, north, fire, cast,
… …
808 * can throttle. 772 * can throttle.
809 */ 773 */
810void 774void
811NewPlayerCmd (char *buf, int len, player *pl) 775NewPlayerCmd (char *buf, int len, player *pl)
812{ 776{
813 int time, repeat;
814 char command[MAX_BUF];
815 int pktlen;
816
817 if (len < 7) 777 if (len <= 6)
818 { 778 {
819 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 779 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
820 return; 780 return;
821 } 781 }
822 782
823 pktlen = net_uint16 ((uint8 *)buf); 783 uint16 cmdid = net_uint16 ((uint8 *)buf);
824 repeat = net_uint32 ((uint8 *)buf + 2); 784 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
825 785
826 /* -1 is special - no repeat, but don't update */ 786 /* -1 is special - no repeat, but don't update */
827 if (repeat != -1) 787 if (repeat != -1)
828 pl->count = repeat; 788 pl->count = repeat;
829 789
830 if ((len - 4) >= MAX_BUF) 790 buf += 6; //len -= 6;
831 len = MAX_BUF - 5;
832 791
833 strncpy ((char *) command, (char *) buf + 6, len - 4);
834 command[len - 4] = 0;
835
836 /* This should not happen anymore. */
837 if (pl->ob->speed_left < -1.0)
838 LOG (llevError, "Player has negative time - shouldn't do command.\n");
839
840 /* In c_new.c */
841 execute_newserver_command (pl->ob, (char *) command); 792 execute_newserver_command (pl->ob, buf);
793
842 /* Perhaps something better should be done with a left over count. 794 /* Perhaps something better should be done with a left over count.
843 * Cleaning up the input should probably be done first - all actions 795 * Cleaning up the input should probably be done first - all actions
844 * for the command that issued the count should be done before any other 796 * for the command that issued the count should be done before any other
845 * commands. 797 * commands.
846 */ 798 */
847 pl->count = 0; 799 pl->count = 0;
848 800
801 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
849 if (FABS (pl->ob->speed) < 0.001) 802 int time = FABS (pl->ob->speed) < 0.001
850 time = MAX_TIME * 100; 803 ? time = MAX_TIME * 100
851 else
852 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 804 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
853 805
854 /* Send confirmation of command execution now */ 806 /* Send confirmation of command execution now */
855 807 packet sl ("comc");
856 packet sl;
857 sl << "comc " << uint16 (pktlen) << uint32 (time); 808 sl << uint16 (cmdid) << uint32 (time);
858 pl->socket->send_packet (sl); 809 pl->ns->send_packet (sl);
859} 810}
860
861 811
862/** This is a reply to a previous query. */ 812/** This is a reply to a previous query. */
863void 813void
864ReplyCmd (char *buf, int len, player *pl) 814ReplyCmd (char *buf, int len, client *ns)
865{ 815{
816 if (ns->state == ST_CUSTOM)
817 {
818 INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len));
819 return;
820 }
821
822 if (!ns->pl)
823 return; //TODO: depends on the exact reply we are after
824 //TODO: but right now, we always have a ns->pl
825
826 player *pl = ns->pl;
827
866 /* 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
867 * 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
868 * once all the X11 code is removed from the server. 830 * once all the X11 code is removed from the server.
869 * 831 *
870 * 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
871 * think it was the carriage return that was entered, and the 833 * think it was the carriage return that was entered, and the
872 * function then does not try to do additional input. 834 * function then does not try to do additional input.
873 */ 835 */
874 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); 836 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
875 837
876 /* this avoids any hacking here */ 838 /* this avoids any hacking here */
877 839
878 switch (pl->state) 840 switch (ns->state)
879 { 841 {
880 case ST_PLAYING: 842 case ST_PLAYING:
881 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 843 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
882 break; 844 break;
883 845
884 case ST_PLAY_AGAIN:
885 /* We can check this for return value (2==quit). Maybe we
886 * should, and do something appropriate?
887 */
888 receive_play_again (pl->ob, buf[0]);
889 break;
890
891 case ST_ROLL_STAT:
892 key_roll_stat (pl->ob, buf[0]);
893 break;
894
895 case ST_CHANGE_CLASS: 846 case ST_CHANGE_CLASS:
896
897 key_change_class (pl->ob, buf[0]); 847 key_change_class (pl->ob, buf[0]);
898 break; 848 break;
899 849
900 case ST_CONFIRM_QUIT: 850 case ST_CONFIRM_QUIT:
901 key_confirm_quit (pl->ob, buf[0]); 851 key_confirm_quit (pl->ob, buf[0]);
902 break; 852 break;
903 853
904 case ST_CONFIGURE:
905 LOG (llevError, "In client input handling, but into configure state\n");
906 pl->state = ST_PLAYING;
907 break;
908
909 case ST_GET_NAME:
910 receive_player_name (pl->ob, 13);
911 break;
912
913 case ST_GET_PASSWORD:
914 case ST_CONFIRM_PASSWORD:
915 receive_player_password (pl->ob, 13);
916 break;
917
918 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 854 case ST_GET_PARTY_PASSWORD: /* Get password for party */
919 receive_party_password (pl->ob, 13); 855 receive_party_password (pl->ob, 13);
920 break; 856 break;
921 857
922 default: 858 default:
923 LOG (llevError, "Unknown input state: %d\n", pl->state); 859 LOG (llevError, "Unknown input state: %d\n", ns->state);
924 } 860 }
925} 861}
926 862
927/** 863/**
928 * Client tells its version. If there is a mismatch, we close the 864 * Client tells its version. If there is a mismatch, we close the
… …
932 * problem. 868 * problem.
933 */ 869 */
934void 870void
935VersionCmd (char *buf, int len, client * ns) 871VersionCmd (char *buf, int len, client * ns)
936{ 872{
937 char *cp;
938 char version_warning[256];
939
940 if (!buf) 873 if (!buf)
941 { 874 {
942 LOG (llevError, "CS: received corrupted version command\n"); 875 LOG (llevError, "CS: received corrupted version command\n");
943 return; 876 return;
944 } 877 }
945 878
946 ns->cs_version = atoi (buf); 879 ns->cs_version = atoi (buf);
947 ns->sc_version = ns->cs_version; 880 ns->sc_version = ns->cs_version;
881
882 LOG (llevDebug, "connection from client <%s>\n", buf);
883
884
885 //TODO: should log here just for statistics
886
948 if (VERSION_CS != ns->cs_version) 887 //if (VERSION_CS != ns->cs_version)
949 { 888 // unchecked;
950#ifdef ESRV_DEBUG 889
951 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
952#endif
953 }
954 cp = strchr (buf + 1, ' '); 890 char *cp = strchr (buf + 1, ' ');
955 if (!cp) 891 if (!cp)
956 return; 892 return;
893
957 ns->sc_version = atoi (cp); 894 ns->sc_version = atoi (cp);
895
958 if (VERSION_SC != ns->sc_version) 896 //if (VERSION_SC != ns->sc_version)
959 { 897 // unchecked;
960#ifdef ESRV_DEBUG 898
961 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
962#endif
963 }
964 cp = strchr (cp + 1, ' '); 899 cp = strchr (cp + 1, ' ');
900
965 if (cp) 901 if (cp)
966 { 902 {
967 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host);
968
969 assign (ns->version, cp + 1); 903 assign (ns->version, cp + 1);
970 904
971 if (ns->sc_version < 1026) 905 if (ns->sc_version < 1026)
972 { 906 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
973 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
974 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 907 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
975 ns->send_packet (version_warning);
976 }
977
978 } 908 }
979} 909}
980 910
981/** sound related functions. */ 911/** sound related functions. */
982void 912void
… …
988/** client wants the map resent */ 918/** client wants the map resent */
989 919
990void 920void
991MapRedrawCmd (char *buf, int len, player *pl) 921MapRedrawCmd (char *buf, int len, player *pl)
992{ 922{
993
994/* This function is currently disabled; just clearing the map state results in 923/* This function is currently disabled; just clearing the map state results in
995 * display errors. It should clear the cache and send a newmap command. 924 * display errors. It should clear the cache and send a newmap command.
996 * Unfortunately this solution does not work because some client versions send 925 * Unfortunately this solution does not work because some client versions send
997 * a mapredraw command after receiving a newmap command. 926 * a mapredraw command after receiving a newmap command.
998 */ 927 */
999#if 0
1000 /* Okay, this is MAJOR UGLY. but the only way I know how to
1001 * clear the "cache"
1002 */
1003 memset (&pl->socket->lastmap, 0, sizeof (struct Map));
1004 draw_client_map (pl->ob);
1005#endif
1006} 928}
1007 929
1008/** 930/**
1009 * Moves an object (typically, container to inventory). 931 * Moves an object (typically, container to inventory).
1010 * syntax is: move (to) (tag) (nrof) 932 * syntax is: move (to) (tag) (nrof)
… …
1013MoveCmd (char *buf, int len, player *pl) 935MoveCmd (char *buf, int len, player *pl)
1014{ 936{
1015 int vals[3], i; 937 int vals[3], i;
1016 938
1017 /* A little funky here. We only cycle for 2 records, because 939 /* A little funky here. We only cycle for 2 records, because
1018 * we obviously am not going to find a space after the third 940 * we obviously are not going to find a space after the third
1019 * record. Perhaps we should just replace this with a 941 * record. Perhaps we should just replace this with a
1020 * sscanf? 942 * sscanf?
1021 */ 943 */
1022 for (i = 0; i < 2; i++) 944 for (i = 0; i < 2; i++)
1023 { 945 {
1024 vals[i] = atoi (buf); 946 vals[i] = atoi (buf);
947
1025 if (!(buf = strchr (buf, ' '))) 948 if (!(buf = strchr (buf, ' ')))
1026 { 949 {
1027 LOG (llevError, "Incomplete move command: %s\n", buf); 950 LOG (llevError, "Incomplete move command: %s\n", buf);
1028 return; 951 return;
1029 } 952 }
953
1030 buf++; 954 buf++;
1031 } 955 }
956
1032 vals[2] = atoi (buf); 957 vals[2] = atoi (buf);
1033 958
1034/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 959/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1035 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 960 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1036} 961}
1037
1038
1039 962
1040/****************************************************************************** 963/******************************************************************************
1041 * 964 *
1042 * Start of commands the server sends to the client. 965 * Start of commands the server sends to the client.
1043 * 966 *
… …
1046/** 969/**
1047 * Asks the client to query the user. This way, the client knows 970 * Asks the client to query the user. This way, the client knows
1048 * it needs to send something back (vs just printing out a message) 971 * it needs to send something back (vs just printing out a message)
1049 */ 972 */
1050void 973void
1051send_query (client * ns, uint8 flags, char *text) 974send_query (client *ns, uint8 flags, char *text)
1052{ 975{
1053 char buf[MAX_BUF];
1054
1055 sprintf (buf, "query %d %s", flags, text ? text : ""); 976 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1056 ns->send_packet (buf);
1057} 977}
1058 978
1059#define AddIfInt64(Old,New,Type) if (Old != New) {\ 979#define AddIfInt64(Old,New,Type) if (Old != New) {\
1060 Old = New; \ 980 Old = New; \
1061 sl << uint8 (Type) << uint64 (New); \ 981 sl << uint8 (Type) << uint64 (New); \
… …
1091esrv_update_stats (player *pl) 1011esrv_update_stats (player *pl)
1092{ 1012{
1093 char buf[MAX_BUF]; 1013 char buf[MAX_BUF];
1094 uint16 flags; 1014 uint16 flags;
1095 1015
1096 packet sl; 1016 if (!pl->ns)
1097 sl << "stats "; 1017 return;
1098 1018
1019 packet sl ("stats");
1020
1099 if (pl->ob != NULL) 1021 if (pl->ob)
1100 { 1022 {
1101 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1023 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);
1102 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1024 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);
1103 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1025 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);
1104 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1026 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
1105 AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); 1027 AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE);
1106 AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); 1028 AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE);
1107 AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); 1029 AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR);
1108 AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);
1109 AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);
1110 AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);
1111 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 1030 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX);
1112 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1031 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);
1032 AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);
1033 AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);
1034 AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);
1113 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1035 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1114 } 1036 }
1115 1037
1116 if (pl->socket->exp64)
1117 {
1118 uint8 s;
1119
1120 for (s = 0; s < NUM_SKILLS; s++) 1038 for (int s = 0; s < NUM_SKILLS; s++)
1121 {
1122 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 1039 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1123 { 1040 {
1124 /* Always send along the level if exp changes. This is only 1041 /* Always send along the level if exp changes. This is only
1125 * 1 extra byte, but keeps processing simpler. 1042 * 1 extra byte, but keeps processing simpler.
1126 */ 1043 */
1127 sl << uint8 (s + CS_STAT_SKILLINFO) 1044 sl << uint8 (s + CS_STAT_SKILLINFO)
1128 << uint8 (pl->last_skill_ob[s]->level) 1045 << uint8 (pl->last_skill_ob[s]->level)
1129 << uint64 (pl->last_skill_ob[s]->stats.exp); 1046 << uint64 (pl->last_skill_ob[s]->stats.exp);
1130 1047
1131 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; 1048 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1132 }
1133 } 1049 }
1134 }
1135 1050
1136 if (pl->socket->exp64)
1137 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1051 AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64);
1138 else
1139 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1140
1141 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1052 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);
1142 AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); 1053 AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC);
1143 AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); 1054 AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC);
1144 AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); 1055 AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM);
1145 AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED); 1056 AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED);
… …
1154 if (pl->run_on) 1065 if (pl->run_on)
1155 flags |= SF_RUNON; 1066 flags |= SF_RUNON;
1156 1067
1157 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1068 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1158 1069
1159 if (pl->socket->sc_version < 1025) 1070 if (pl->ns->sc_version < 1025)
1160 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1071 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1161 else 1072 else
1162 {
1163 int i;
1164
1165 for (i = 0; i < NROFATTACKS; i++) 1073 for (int i = 0; i < NROFATTACKS; i++)
1166 { 1074 {
1167 /* Skip ones we won't send */ 1075 /* Skip ones we won't send */
1168 if (atnr_cs_stat[i] == -1) 1076 if (atnr_cs_stat[i] == -1)
1169 continue; 1077 continue;
1170 1078
1171 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1079 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1172 } 1080 }
1173 }
1174 1081
1175 if (pl->socket->monitor_spells) 1082 if (pl->ns->monitor_spells)
1176 { 1083 {
1177 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1084 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1178 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1085 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
1179 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 1086 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY);
1180 } 1087 }
1181 1088
1182 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 1089 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */
1183 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE); 1090 AddIfString (pl->ns->stats.range, buf, CS_STAT_RANGE);
1184 set_title (pl->ob, buf); 1091 set_title (pl->ob, buf);
1185 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE); 1092 AddIfString (pl->ns->stats.title, buf, CS_STAT_TITLE);
1186 1093
1187 /* Only send it away if we have some actual data */ 1094 /* Only send it away if we have some actual data */
1188 if (sl.length () > 6) 1095 if (sl.length () > 6)
1189 pl->socket->send_packet (sl); 1096 pl->ns->send_packet (sl);
1190} 1097}
1191 1098
1192/** 1099/**
1193 * Tells the client that here is a player it should start using. 1100 * Tells the client that here is a player it should start using.
1194 */ 1101 */
1195void 1102void
1196esrv_new_player (player *pl, uint32 weight) 1103esrv_new_player (player *pl, uint32 weight)
1197{ 1104{
1198 pl->last_weight = weight; 1105 pl->last_weight = weight;
1199 1106
1200 packet sl; 1107 packet sl ("player");
1201 sl << "player ";
1202 1108
1203 sl << uint32 (pl->ob->count) 1109 sl << uint32 (pl->ob->count)
1204 << uint32 (weight) 1110 << uint32 (weight)
1205 << uint32 (pl->ob->face->number) 1111 << uint32 (pl->ob->face->number)
1206 << data8 (pl->ob->name); 1112 << data8 (pl->ob->name);
1207 1113
1208 pl->socket->send_packet (sl); 1114 pl->ns->send_packet (sl);
1209 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1115 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1210} 1116}
1211 1117
1212/** 1118/**
1213 * Need to send an animation sequence to the client. 1119 * Need to send an animation sequence to the client.
… …
1217 * when the player logs in and picks stuff up. 1123 * when the player logs in and picks stuff up.
1218 */ 1124 */
1219void 1125void
1220esrv_send_animation (client * ns, short anim_num) 1126esrv_send_animation (client * ns, short anim_num)
1221{ 1127{
1222 int i;
1223
1224 /* Do some checking on the anim_num we got. Note that the animations 1128 /* Do some checking on the anim_num we got. Note that the animations
1225 * are added in contigous order, so if the number is in the valid 1129 * are added in contigous order, so if the number is in the valid
1226 * range, it must be a valid animation. 1130 * range, it must be a valid animation.
1227 */ 1131 */
1228 if (anim_num < 0 || anim_num > num_animations) 1132 if (anim_num < 0 || anim_num > num_animations)
1229 { 1133 {
1230 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); 1134 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1231 return; 1135 return;
1232 } 1136 }
1233 1137
1234 packet sl; 1138 packet sl ("anim");
1235 1139
1236 sl << "anim "
1237 << uint16 (anim_num) 1140 sl << uint16 (anim_num)
1238 << uint16 (0); /* flags - not used right now */ 1141 << uint16 (0); /* flags - not used right now */
1239 1142
1240 /* Build up the list of faces. Also, send any information (ie, the 1143 /* Build up the list of faces. Also, send any information (ie, the
1241 * the face itself) down to the client. 1144 * the face itself) down to the client.
1242 */ 1145 */
1243 for (i = 0; i < animations[anim_num].num_animations; i++) 1146 for (int i = 0; i < animations[anim_num].num_animations; i++)
1244 { 1147 {
1245 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1148 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1246 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1149 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1150
1247 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 1151 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1248 } 1152 }
1249 1153
1250 ns->send_packet (sl); 1154 ns->send_packet (sl);
1251 1155
… …
1266static void 1170static void
1267esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap) 1171esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1268{ 1172{
1269 if (newmap->cells[x][y].count >= MAP_LAYERS) 1173 if (newmap->cells[x][y].count >= MAP_LAYERS)
1270 { 1174 {
1175 //TODO: one or the other, can't both have abort and return, verify and act
1271 LOG (llevError, "Too many faces in map cell %d %d\n", x, y); 1176 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1272 return; 1177 return;
1273 abort (); 1178 abort ();
1274 } 1179 }
1275 1180
1276 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; 1181 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1277 newmap->cells[x][y].count++; 1182 newmap->cells[x][y].count++;
1278 1183
1279 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1184 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1280 esrv_send_face (ns, face_num, 0); 1185 esrv_send_face (ns, face_num, 0);
1281}
1282
1283struct LayerCell
1284{
1285 uint16 xy;
1286 short face;
1287};
1288
1289struct MapLayer
1290{
1291 int count;
1292 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1293};
1294
1295/** Checkes if map cells have changed */
1296static int
1297mapcellchanged (client * ns, int i, int j, struct Map *newmap)
1298{
1299 int k;
1300
1301 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1302 return 1;
1303 for (k = 0; k < newmap->cells[i][j].count; k++)
1304 {
1305 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1306 {
1307 return 1;
1308 }
1309 }
1310 return 0;
1311}
1312
1313/**
1314 * Basically, what this does is pack the data into layers.
1315 * cnum is the client number, cur is the the buffer we put all of
1316 * this data into. we return the end of the data. layers is
1317 * how many layers of data we should back.
1318 */
1319static uint8 *
1320compactlayer (client * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1321{
1322 int x, y, k;
1323 int face;
1324 unsigned char *fcur;
1325 struct MapLayer layers[MAP_LAYERS];
1326
1327 for (k = 0; k < MAP_LAYERS; k++)
1328 layers[k].count = 0;
1329 fcur = cur;
1330 for (x = 0; x < ns->mapx; x++)
1331 {
1332 for (y = 0; y < ns->mapy; y++)
1333 {
1334 if (!mapcellchanged (ns, x, y, newmap))
1335 continue;
1336 if (newmap->cells[x][y].count == 0)
1337 {
1338 *cur = x * ns->mapy + y; /* mark empty space */
1339 cur++;
1340 continue;
1341 }
1342 for (k = 0; k < newmap->cells[x][y].count; k++)
1343 {
1344 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1345 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1346 layers[k].count++;
1347 }
1348 }
1349 }
1350 /* If no data, return now. */
1351 if (fcur == cur && layers[0].count == 0)
1352 return cur;
1353 *cur = 255; /* mark end of explicitly cleared cells */
1354 cur++;
1355 /* First pack by layers. */
1356 for (k = 0; k < numlayers; k++)
1357 {
1358 if (layers[k].count == 0)
1359 break; /* once a layer is entirely empty, no layer below it can
1360 have anything in it either */
1361 /* Pack by entries in thie layer */
1362 for (x = 0; x < layers[k].count;)
1363 {
1364 fcur = cur;
1365 *cur = layers[k].lcells[x].face >> 8;
1366 cur++;
1367 *cur = layers[k].lcells[x].face & 0xFF;
1368 cur++;
1369 face = layers[k].lcells[x].face;
1370 /* Now, we back the redundant data into 1 byte xy pairings */
1371 for (y = x; y < layers[k].count; y++)
1372 {
1373 if (layers[k].lcells[y].face == face)
1374 {
1375 *cur = (uint8) layers[k].lcells[y].xy;
1376 cur++;
1377 layers[k].lcells[y].face = -1;
1378 }
1379 }
1380 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1381 /* forward over the now redundant data */
1382 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1383 x++;
1384 }
1385 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1386 }
1387 return cur;
1388} 1186}
1389 1187
1390/** Clears a map cell */ 1188/** Clears a map cell */
1391static void 1189static void
1392map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1190map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
… …
1404#define MAX_LAYERS 3 1202#define MAX_LAYERS 3
1405 1203
1406/* Using a global really isn't a good approach, but saves the over head of 1204/* Using a global really isn't a good approach, but saves the over head of
1407 * allocating and deallocating such a block of data each time run through, 1205 * allocating and deallocating such a block of data each time run through,
1408 * and saves the space of allocating this in the socket object when we only 1206 * and saves the space of allocating this in the socket object when we only
1409 * need it for this cycle. If the serve is ever threaded, this needs to be 1207 * need it for this cycle. If the server is ever threaded, this needs to be
1410 * re-examined. 1208 * re-examined.
1411 */ 1209 */
1412
1413static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1210static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1414 1211
1415/** 1212/**
1416 * Returns true if any of the heads for this 1213 * Returns true if any of the heads for this
1417 * space is set. Returns false if all are blank - this is used 1214 * space is set. Returns false if all are blank - this is used
1418 * for empty space checking. 1215 * for empty space checking.
1419 */ 1216 */
1420static inline int 1217static inline int
1421have_head (int ax, int ay) 1218have_head (int ax, int ay)
1422{ 1219{
1423
1424 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1220 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1425 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) 1221 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1426 return 1; 1222 return 1;
1223
1427 return 0; 1224 return 0;
1428} 1225}
1429 1226
1430/** 1227/**
1431 * check_head is a bit simplistic version of update_space below. 1228 * check_head is a bit simplistic version of update_space below.
1432 * basically, it only checks the that the head on space ax,ay at layer 1229 * basically, it only checks the that the head on space ax,ay at layer
1433 * needs to get sent - if so, it adds the data, sending the head 1230 * needs to get sent - if so, it adds the data, sending the head
1434 * if needed, and returning 1. If this no data needs to get 1231 * if needed, and returning 1. If this no data needs to get
1435 * sent, it returns zero. 1232 * sent, it returns zero.
1436 */ 1233 */
1437static int 1234static int
1438check_head (packet &sl, client &ns, int ax, int ay, int layer) 1235check_head (packet &sl, client &ns, int ax, int ay, int layer)
1439{ 1236{
… …
1475 * numbers the spaces differently - I think this was a leftover from 1272 * numbers the spaces differently - I think this was a leftover from
1476 * the map command, where the faces stack up. Sinces that is no longer 1273 * the map command, where the faces stack up. Sinces that is no longer
1477 * the case, it seems to make more sense to have these layer values 1274 * the case, it seems to make more sense to have these layer values
1478 * actually match. 1275 * actually match.
1479 */ 1276 */
1480
1481static int 1277static int
1482update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1278update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1483{ 1279{
1484 object *ob, *head; 1280 object *ob, *head;
1485 uint16 face_num; 1281 uint16 face_num;
… …
1710 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1506 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1711 1507
1712 /* If there is no object for this space, or if the face for the object 1508 /* If there is no object for this space, or if the face for the object
1713 * is the blank face, set the smoothlevel to zero. 1509 * is the blank face, set the smoothlevel to zero.
1714 */ 1510 */
1715 if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp)) 1511 if (!ob || ob->face == blank_face || mp->nosmooth)
1716 smoothlevel = 0; 1512 smoothlevel = 0;
1717 else 1513 else
1718 { 1514 {
1719 smoothlevel = ob->smoothlevel; 1515 smoothlevel = ob->smoothlevel;
1720 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH)) 1516 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
… …
1753 if (ns->ext_mapinfos) 1549 if (ns->ext_mapinfos)
1754 { 1550 {
1755 if (ns->EMI_smooth) 1551 if (ns->EMI_smooth)
1756 result += 1; /*One byte for smoothlevel */ 1552 result += 1; /*One byte for smoothlevel */
1757 } 1553 }
1554
1758 return result; 1555 return result;
1759} 1556}
1760 1557
1761/** 1558/**
1762 * This function uses the new map1 protocol command to send the map 1559 * This function uses the new map1 protocol command to send the map
… …
1769 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off 1566 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1770 * maps no sense. Instead, we actually really only use 12 bits for coordinates, 1567 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1771 * and use the other 4 bits for other informatiion. For full documentation 1568 * and use the other 4 bits for other informatiion. For full documentation
1772 * of what we send, see the doc/Protocol file. 1569 * of what we send, see the doc/Protocol file.
1773 * I will describe internally what we do: 1570 * I will describe internally what we do:
1774 * the socket->lastmap shows how the map last looked when sent to the client. 1571 * the ns->lastmap shows how the map last looked when sent to the client.
1775 * in the lastmap structure, there is a cells array, which is set to the 1572 * in the lastmap structure, there is a cells array, which is set to the
1776 * maximum viewable size (As set in config.h). 1573 * maximum viewable size (As set in config.h).
1777 * in the cells, there are faces and a count value. 1574 * in the cells, there are faces and a count value.
1778 * we use the count value to hold the darkness value. If -1, then this space 1575 * we use the count value to hold the darkness value. If -1, then this space
1779 * is not viewable. 1576 * is not viewable.
… …
1790 uint8 eentrysize; 1587 uint8 eentrysize;
1791 uint16 ewhatstart, ewhatflag; 1588 uint16 ewhatstart, ewhatflag;
1792 uint8 extendedinfos; 1589 uint8 extendedinfos;
1793 maptile *m; 1590 maptile *m;
1794 1591
1795 client &socket = *pl->contr->socket; 1592 client &socket = *pl->contr->ns;
1796 1593
1797 check_map_change (pl->contr); 1594 check_map_change (pl->contr);
1798 1595
1799 packet sl; 1596 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1800 packet esl; 1597 packet esl;
1801 1598
1802 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1803 startlen = sl.length (); 1599 startlen = sl.length ();
1804 1600
1805 /*Extendedmapinfo structure initialisation */ 1601 /*Extendedmapinfo structure initialisation */
1806 if (socket.ext_mapinfos) 1602 if (socket.ext_mapinfos)
1807 { 1603 {
… …
1851 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) 1647 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1852 { 1648 {
1853 ax = 0; 1649 ax = 0;
1854 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1650 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1855 { 1651 {
1856
1857 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1652 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1858 1653
1859 /* If this space is out of the normal viewable area, we only check 1654 /* If this space is out of the normal viewable area, we only check
1860 * the heads value ax or ay will only be greater than what 1655 * the heads value ax or ay will only be greater than what
1861 * the client wants if using the map1a command - this is because 1656 * the client wants if using the map1a command - this is because
… …
2191 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 1986 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2192 return; 1987 return;
2193 1988
2194 memset (&newmap, 0, sizeof (struct Map)); 1989 memset (&newmap, 0, sizeof (struct Map));
2195 1990
2196 for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++) 1991 for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)
2197 {
2198 for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++) 1992 for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)
2199 { 1993 {
2200 ax = i; 1994 ax = i;
2201 ay = j; 1995 ay = j;
2202 m = pm; 1996 m = pm;
2203 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 1997 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1998
2204 if (mflags & P_OUT_OF_MAP) 1999 if (mflags & P_OUT_OF_MAP)
2205 continue; 2000 continue;
2206 if (mflags & P_NEED_UPDATE) 2001
2207 update_position (m, ax, ay);
2208 /* If a map is visible to the player, we don't want to swap it out 2002 /* If a map is visible to the player, we don't want to swap it out
2209 * just to reload it. This should really call something like 2003 * just to reload it. This should really call something like
2210 * swap_map, but this is much more efficient and 'good enough' 2004 * swap_map, but this is much more efficient and 'good enough'
2211 */ 2005 */
2212 if (mflags & P_NEW_MAP) 2006 if (mflags & P_NEW_MAP)
2213 m->timeout = 50; 2007 m->timeout = 50;
2214 } 2008 }
2215 } 2009
2216 /* do LOS after calls to update_position */ 2010 /* do LOS after calls to update_position */
2217 if (pl->contr->do_los) 2011 if (pl->contr->do_los)
2218 { 2012 {
2219 update_los (pl); 2013 update_los (pl);
2220 pl->contr->do_los = 0; 2014 pl->contr->do_los = 0;
… …
2235 2029
2236/*****************************************************************************/ 2030/*****************************************************************************/
2237void 2031void
2238send_plugin_custom_message (object *pl, char *buf) 2032send_plugin_custom_message (object *pl, char *buf)
2239{ 2033{
2240 pl->contr->socket->send_packet (buf); 2034 pl->contr->ns->send_packet (buf);
2241} 2035}
2242 2036
2243/** 2037/**
2244 * This sends the skill number to name mapping. We ignore 2038 * This sends the skill number to name mapping. We ignore
2245 * the params - we always send the same info no matter what. 2039 * the params - we always send the same info no matter what.
… …
2290 * it then sends an updspell packet for each spell that has changed in this way 2084 * it then sends an updspell packet for each spell that has changed in this way
2291 */ 2085 */
2292void 2086void
2293esrv_update_spells (player *pl) 2087esrv_update_spells (player *pl)
2294{ 2088{
2089 if (!pl->ns)
2090 return;
2091
2295 if (!pl->socket->monitor_spells) 2092 if (!pl->ns->monitor_spells)
2296 return; 2093 return;
2297 2094
2298 for (object *spell = pl->ob->inv; spell; spell = spell->below) 2095 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2299 { 2096 {
2300 if (spell->type == SPELL) 2097 if (spell->type == SPELL)
… …
2330 2127
2331 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 2128 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2332 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 2129 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2333 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 2130 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2334 2131
2335 pl->socket->send_packet (sl); 2132 pl->ns->send_packet (sl);
2336 } 2133 }
2337 } 2134 }
2338 } 2135 }
2339} 2136}
2340 2137
2341void 2138void
2342esrv_remove_spell (player *pl, object *spell) 2139esrv_remove_spell (player *pl, object *spell)
2343{ 2140{
2344 if (!pl->socket->monitor_spells) 2141 if (!pl->ns->monitor_spells)
2345 return; 2142 return;
2346 2143
2347 if (!pl || !spell || spell->env != pl->ob) 2144 if (!pl || !spell || spell->env != pl->ob)
2348 { 2145 {
2349 LOG (llevError, "Invalid call to esrv_remove_spell"); 2146 LOG (llevError, "Invalid call to esrv_remove_spell");
2350 return; 2147 return;
2351 } 2148 }
2352 2149
2353 packet sl; 2150 packet sl ("delspell");
2354 2151
2355 sl << "delspell "
2356 << uint32 (spell->count); 2152 sl << uint32 (spell->count);
2357 2153
2358 pl->socket->send_packet (sl); 2154 pl->ns->send_packet (sl);
2359} 2155}
2360 2156
2361/* appends the spell *spell to the Socklist we will send the data to. */ 2157/* appends the spell *spell to the Socklist we will send the data to. */
2362static void 2158static void
2363append_spell (player *pl, packet &sl, object *spell) 2159append_spell (player *pl, packet &sl, object *spell)
… …
2411 { 2207 {
2412 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); 2208 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2413 return; 2209 return;
2414 } 2210 }
2415 2211
2416 if (!pl->socket->monitor_spells) 2212 if (!pl->ns->monitor_spells)
2417 return; 2213 return;
2418 2214
2419 packet sl; 2215 packet sl ("addspell");
2420
2421 sl << "addspell ";
2422 2216
2423 if (!spell) 2217 if (!spell)
2424 { 2218 {
2425 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2219 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
2426 { 2220 {
… …
2440 if (spell->type != SPELL) 2234 if (spell->type != SPELL)
2441 continue; 2235 continue;
2442 2236
2443 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 2237 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2444 { 2238 {
2445 pl->socket->send_packet (sl); 2239 pl->ns->send_packet (sl);
2446 2240
2447 sl.reset (); 2241 sl.reset ();
2448 sl << "addspell "; 2242 sl << "addspell ";
2449 } 2243 }
2450 2244
… …
2464 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 2258 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2465 fatal (0); 2259 fatal (0);
2466 } 2260 }
2467 2261
2468 /* finally, we can send the packet */ 2262 /* finally, we can send the packet */
2469 pl->socket->send_packet (sl); 2263 pl->ns->send_packet (sl);
2470} 2264}
2471 2265

Diff Legend

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