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.41 by root, Fri Dec 15 19:59:20 2006 UTC vs.
Revision 1.45 by root, Tue Dec 19 04:58:05 2006 UTC

… …
38 * esrv_map_new starts updating the map 38 * esrv_map_new starts updating the map
39 * 39 *
40 * esrv_map_setbelow allows filling in all of the faces for the map. 40 * esrv_map_setbelow allows filling in all of the faces for the map.
41 * if a face has not already been sent to the client, it is sent now. 41 * if a face has not already been sent to the client, it is sent now.
42 * 42 *
43 * mapcellchanged, compactlayer, compactstack, perform the map compressing
44 * operations
45 *
46 */ 43 */
47 44
48#include <global.h> 45#include <global.h>
49#include <sproto.h> 46#include <sproto.h>
50 47
… …
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 {
97 packet sl;
98
99 sl.printf ("map_scroll %d %d", dx, dy); 93 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
100 ns->send_packet (sl);
101 }
102 94
103 /* If we are using the Map1aCmd, we may in fact send 95 /* If we are using the Map1aCmd, we may in fact send
104 * head information that is outside the viewable map. 96 * head information that is outside the viewable map.
105 * 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
106 * look for. Removed code to do so - it caused extra 98 * look for. Removed code to do so - it caused extra
… …
262 254
263void 255void
264ExtCmd (char *buf, int len, player *pl) 256ExtCmd (char *buf, int len, player *pl)
265{ 257{
266 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 258 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
259}
260
261void
262ExtiCmd (char *buf, int len, client *ns)
263{
264 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
267} 265}
268 266
269void 267void
270MapInfoCmd (char *buf, int len, player *pl) 268MapInfoCmd (char *buf, int len, player *pl)
271{ 269{
… …
575 * it either has to be here or init_sockets needs to be exported. 573 * it either has to be here or init_sockets needs to be exported.
576 */ 574 */
577void 575void
578AddMeCmd (char *buf, int len, client * ns) 576AddMeCmd (char *buf, int len, client * ns)
579{ 577{
580 Settings oldsettings;
581
582 oldsettings = settings;
583 if (ns->status != Ns_Add || add_player (ns)) 578 if (ns->status != Ns_Add || add_player (ns))
584 ns->send_packet ("addme_failed"); 579 ns->send_packet ("addme_failed");
585 else 580 else
586 ns->send_packet ("addme_success"); 581 ns->send_packet ("addme_success");
587
588 settings = oldsettings;
589} 582}
590 583
591/** Reply to ExtendedInfos command */ 584/** Reply to ExtendedInfos command */
592void 585void
593ToggleExtendedInfos (char *buf, int len, client * ns) 586ToggleExtendedInfos (char *buf, int len, client * ns)
… …
710 * a piece of data from us that we know the client wants. So 703 * a piece of data from us that we know the client wants. So
711 * if we know the client wants it, might as well push it to the 704 * if we know the client wants it, might as well push it to the
712 * client. 705 * client.
713 */ 706 */
714static void 707static void
715SendSmooth (client * ns, uint16 face) 708SendSmooth (client *ns, uint16 face)
716{ 709{
717 uint16 smoothface; 710 uint16 smoothface;
718 711
719 /* If we can't find a face, return and set it so we won't try to send this 712 /* If we can't find a face, return and set it so we won't try to send this
720 * again. 713 * again.
… …
744 /** 737 /**
745 * Tells client the picture it has to use 738 * Tells client the picture it has to use
746 * to smooth a picture number given as argument. 739 * to smooth a picture number given as argument.
747 */ 740 */
748void 741void
749AskSmooth (char *buf, int len, client * ns) 742AskSmooth (char *buf, int len, client *ns)
750{ 743{
751 uint16 facenbr; 744 SendSmooth (ns, atoi (buf));
752
753 facenbr = atoi (buf);
754 SendSmooth (ns, facenbr);
755} 745}
756 746
757/** 747/**
758 * This handles the general commands from the client (ie, north, fire, cast, 748 * This handles the general commands from the client (ie, north, fire, cast,
759 * etc.) 749 * etc.)
760 */ 750 */
761void 751void
762PlayerCmd (char *buf, int len, player *pl) 752PlayerCmd (char *buf, int len, player *pl)
763{ 753{
764
765 /* The following should never happen with a proper or honest client.
766 * Therefore, the error message doesn't have to be too clear - if
767 * someone is playing with a hacked/non working client, this gives them
768 * an idea of the problem, but they deserve what they get
769 */
770 if (pl->state != ST_PLAYING)
771 {
772 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
773 return;
774 }
775 /* Check if there is a count. In theory, a zero count could also be 754 /* Check if there is a count. In theory, a zero count could also be
776 * sent, so check for that also. 755 * sent, so check for that also.
777 */ 756 */
778 if (atoi (buf) || buf[0] == '0') 757 if (atoi (buf) || buf[0] == '0')
779 { 758 {
780 pl->count = atoi ((char *) buf); 759 pl->count = atoi ((char *) buf);
760
781 buf = strchr (buf, ' '); /* advance beyond the numbers */ 761 buf = strchr (buf, ' '); /* advance beyond the numbers */
782 if (!buf) 762 if (!buf)
783 {
784#ifdef ESRV_DEBUG
785 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
786#endif
787 return; 763 return;
788 } 764
789 buf++; 765 buf++;
790 } 766 }
791 /* This should not happen anymore. */ 767
792 if (pl->ob->speed_left < -1.0)
793 {
794 LOG (llevError, "Player has negative time - shouldn't do command.\n");
795 }
796 /* In c_new.c */
797 execute_newserver_command (pl->ob, (char *) buf); 768 execute_newserver_command (pl->ob, (char *) buf);
769
798 /* Perhaps something better should be done with a left over count. 770 /* Perhaps something better should be done with a left over count.
799 * Cleaning up the input should probably be done first - all actions 771 * Cleaning up the input should probably be done first - all actions
800 * for the command that issued the count should be done before any other 772 * for the command that issued the count should be done before any other
801 * commands. 773 * commands.
802 */ 774 */
803
804 pl->count = 0; 775 pl->count = 0;
805
806} 776}
807 777
808 778
809/** 779/**
810 * This handles the general commands from the client (ie, north, fire, cast, 780 * This handles the general commands from the client (ie, north, fire, cast,
… …
813 * can throttle. 783 * can throttle.
814 */ 784 */
815void 785void
816NewPlayerCmd (char *buf, int len, player *pl) 786NewPlayerCmd (char *buf, int len, player *pl)
817{ 787{
818 int time, repeat;
819 char command[MAX_BUF];
820 int pktlen;
821
822 if (len < 7) 788 if (len <= 6)
823 { 789 {
824 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 790 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
825 return; 791 return;
826 } 792 }
827 793
828 pktlen = net_uint16 ((uint8 *)buf); 794 uint16 cmdid = net_uint16 ((uint8 *)buf);
829 repeat = net_uint32 ((uint8 *)buf + 2); 795 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
830 796
831 /* -1 is special - no repeat, but don't update */ 797 /* -1 is special - no repeat, but don't update */
832 if (repeat != -1) 798 if (repeat != -1)
833 pl->count = repeat; 799 pl->count = repeat;
834 800
835 if ((len - 4) >= MAX_BUF) 801 buf += 6; //len -= 6;
836 len = MAX_BUF - 5;
837 802
838 strncpy ((char *) command, (char *) buf + 6, len - 4);
839 command[len - 4] = 0;
840
841 /* This should not happen anymore. */
842 if (pl->ob->speed_left < -1.0)
843 LOG (llevError, "Player has negative time - shouldn't do command.\n");
844
845 /* In c_new.c */
846 execute_newserver_command (pl->ob, (char *) command); 803 execute_newserver_command (pl->ob, buf);
804
847 /* Perhaps something better should be done with a left over count. 805 /* Perhaps something better should be done with a left over count.
848 * Cleaning up the input should probably be done first - all actions 806 * Cleaning up the input should probably be done first - all actions
849 * for the command that issued the count should be done before any other 807 * for the command that issued the count should be done before any other
850 * commands. 808 * commands.
851 */ 809 */
852 pl->count = 0; 810 pl->count = 0;
853 811
812 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
854 if (FABS (pl->ob->speed) < 0.001) 813 int time = FABS (pl->ob->speed) < 0.001
855 time = MAX_TIME * 100; 814 ? time = MAX_TIME * 100
856 else
857 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 815 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
858 816
859 /* Send confirmation of command execution now */ 817 /* Send confirmation of command execution now */
860
861 packet sl; 818 packet sl;
862 sl << "comc " << uint16 (pktlen) << uint32 (time); 819 sl << "comc " << uint16 (cmdid) << uint32 (time);
863 pl->socket->send_packet (sl); 820 pl->socket->send_packet (sl);
864} 821}
865 822
866 823
867/** This is a reply to a previous query. */ 824/** This is a reply to a previous query. */
868void 825void
869ReplyCmd (char *buf, int len, player *pl) 826ReplyCmd (char *buf, int len, player *pl)
870{ 827{
871 /* 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
872 * 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
873 * once all the X11 code is removed from the server. 830 * once all the X11 code is removed from the server.
874 * 831 *
875 * 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
876 * think it was the carriage return that was entered, and the 833 * think it was the carriage return that was entered, and the
877 * function then does not try to do additional input. 834 * function then does not try to do additional input.
… …
880 837
881 /* this avoids any hacking here */ 838 /* this avoids any hacking here */
882 839
883 switch (pl->state) 840 switch (pl->state)
884 { 841 {
885 case ST_PLAYING: 842 case ST_PLAYING:
886 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 843 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
887 break; 844 break;
888 845
889 case ST_PLAY_AGAIN: 846 case ST_PLAY_AGAIN:
890 /* We can check this for return value (2==quit). Maybe we 847 /* We can check this for return value (2==quit). Maybe we
891 * should, and do something appropriate? 848 * should, and do something appropriate?
892 */ 849 */
893 receive_play_again (pl->ob, buf[0]); 850 receive_play_again (pl->ob, buf[0]);
894 break; 851 break;
895 852
896 case ST_ROLL_STAT: 853 case ST_ROLL_STAT:
897 key_roll_stat (pl->ob, buf[0]); 854 key_roll_stat (pl->ob, buf[0]);
898 break; 855 break;
899 856
900 case ST_CHANGE_CLASS: 857 case ST_CHANGE_CLASS:
901 858
902 key_change_class (pl->ob, buf[0]); 859 key_change_class (pl->ob, buf[0]);
903 break; 860 break;
904 861
905 case ST_CONFIRM_QUIT: 862 case ST_CONFIRM_QUIT:
906 key_confirm_quit (pl->ob, buf[0]); 863 key_confirm_quit (pl->ob, buf[0]);
907 break; 864 break;
908 865
909 case ST_CONFIGURE: 866 case ST_CONFIGURE:
910 LOG (llevError, "In client input handling, but into configure state\n"); 867 LOG (llevError, "In client input handling, but into configure state\n");
911 pl->state = ST_PLAYING; 868 pl->state = ST_PLAYING;
912 break; 869 break;
913 870
914 case ST_GET_NAME: 871 case ST_GET_NAME:
915 receive_player_name (pl->ob, 13); 872 receive_player_name (pl->ob, 13);
916 break; 873 break;
917 874
918 case ST_GET_PASSWORD: 875 case ST_GET_PASSWORD:
919 case ST_CONFIRM_PASSWORD: 876 case ST_CONFIRM_PASSWORD:
920 receive_player_password (pl->ob, 13); 877 receive_player_password (pl->ob, 13);
921 break; 878 break;
922 879
923 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 880 case ST_GET_PARTY_PASSWORD: /* Get password for party */
924 receive_party_password (pl->ob, 13); 881 receive_party_password (pl->ob, 13);
925 break; 882 break;
926 883
927 default: 884 default:
928 LOG (llevError, "Unknown input state: %d\n", pl->state); 885 LOG (llevError, "Unknown input state: %d\n", pl->state);
929 } 886 }
930} 887}
931 888
932/** 889/**
933 * Client tells its version. If there is a mismatch, we close the 890 * Client tells its version. If there is a mismatch, we close the
… …
937 * problem. 894 * problem.
938 */ 895 */
939void 896void
940VersionCmd (char *buf, int len, client * ns) 897VersionCmd (char *buf, int len, client * ns)
941{ 898{
942 char *cp;
943 char version_warning[256];
944
945 if (!buf) 899 if (!buf)
946 { 900 {
947 LOG (llevError, "CS: received corrupted version command\n"); 901 LOG (llevError, "CS: received corrupted version command\n");
948 return; 902 return;
949 } 903 }
950 904
951 ns->cs_version = atoi (buf); 905 ns->cs_version = atoi (buf);
952 ns->sc_version = ns->cs_version; 906 ns->sc_version = ns->cs_version;
907
908 LOG (llevDebug, "connection from client <%s>\n", buf);
909
910
911 //TODO: should log here just for statistics
912
953 if (VERSION_CS != ns->cs_version) 913 //if (VERSION_CS != ns->cs_version)
954 { 914 // unchecked;
955#ifdef ESRV_DEBUG 915
956 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
957#endif
958 }
959 cp = strchr (buf + 1, ' '); 916 char *cp = strchr (buf + 1, ' ');
960 if (!cp) 917 if (!cp)
961 return; 918 return;
919
962 ns->sc_version = atoi (cp); 920 ns->sc_version = atoi (cp);
921
963 if (VERSION_SC != ns->sc_version) 922 //if (VERSION_SC != ns->sc_version)
964 { 923 // unchecked;
965#ifdef ESRV_DEBUG 924
966 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
967#endif
968 }
969 cp = strchr (cp + 1, ' '); 925 cp = strchr (cp + 1, ' ');
926
970 if (cp) 927 if (cp)
971 { 928 {
972 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host);
973
974 assign (ns->version, cp + 1); 929 assign (ns->version, cp + 1);
975 930
976 if (ns->sc_version < 1026) 931 if (ns->sc_version < 1026)
977 { 932 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
978 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
979 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 933 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
980 ns->send_packet (version_warning);
981 }
982
983 } 934 }
984} 935}
985 936
986/** sound related functions. */ 937/** sound related functions. */
987void 938void
… …
993/** client wants the map resent */ 944/** client wants the map resent */
994 945
995void 946void
996MapRedrawCmd (char *buf, int len, player *pl) 947MapRedrawCmd (char *buf, int len, player *pl)
997{ 948{
998
999/* This function is currently disabled; just clearing the map state results in 949/* This function is currently disabled; just clearing the map state results in
1000 * display errors. It should clear the cache and send a newmap command. 950 * display errors. It should clear the cache and send a newmap command.
1001 * Unfortunately this solution does not work because some client versions send 951 * Unfortunately this solution does not work because some client versions send
1002 * a mapredraw command after receiving a newmap command. 952 * a mapredraw command after receiving a newmap command.
1003 */ 953 */
1004#if 0
1005 /* Okay, this is MAJOR UGLY. but the only way I know how to
1006 * clear the "cache"
1007 */
1008 memset (&pl->socket->lastmap, 0, sizeof (struct Map));
1009 draw_client_map (pl->ob);
1010#endif
1011} 954}
1012 955
1013/** 956/**
1014 * Moves an object (typically, container to inventory). 957 * Moves an object (typically, container to inventory).
1015 * syntax is: move (to) (tag) (nrof) 958 * syntax is: move (to) (tag) (nrof)
… …
1018MoveCmd (char *buf, int len, player *pl) 961MoveCmd (char *buf, int len, player *pl)
1019{ 962{
1020 int vals[3], i; 963 int vals[3], i;
1021 964
1022 /* A little funky here. We only cycle for 2 records, because 965 /* A little funky here. We only cycle for 2 records, because
1023 * we obviously am not going to find a space after the third 966 * we obviously are not going to find a space after the third
1024 * record. Perhaps we should just replace this with a 967 * record. Perhaps we should just replace this with a
1025 * sscanf? 968 * sscanf?
1026 */ 969 */
1027 for (i = 0; i < 2; i++) 970 for (i = 0; i < 2; i++)
1028 { 971 {
1029 vals[i] = atoi (buf); 972 vals[i] = atoi (buf);
973
1030 if (!(buf = strchr (buf, ' '))) 974 if (!(buf = strchr (buf, ' ')))
1031 { 975 {
1032 LOG (llevError, "Incomplete move command: %s\n", buf); 976 LOG (llevError, "Incomplete move command: %s\n", buf);
1033 return; 977 return;
1034 } 978 }
979
1035 buf++; 980 buf++;
1036 } 981 }
982
1037 vals[2] = atoi (buf); 983 vals[2] = atoi (buf);
1038 984
1039/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 985/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1040 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 986 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1041} 987}
1042
1043
1044 988
1045/****************************************************************************** 989/******************************************************************************
1046 * 990 *
1047 * Start of commands the server sends to the client. 991 * Start of commands the server sends to the client.
1048 * 992 *
… …
1051/** 995/**
1052 * Asks the client to query the user. This way, the client knows 996 * Asks the client to query the user. This way, the client knows
1053 * it needs to send something back (vs just printing out a message) 997 * it needs to send something back (vs just printing out a message)
1054 */ 998 */
1055void 999void
1056send_query (client * ns, uint8 flags, char *text) 1000send_query (client *ns, uint8 flags, char *text)
1057{ 1001{
1058 char buf[MAX_BUF];
1059
1060 sprintf (buf, "query %d %s", flags, text ? text : ""); 1002 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1061 ns->send_packet (buf);
1062} 1003}
1063 1004
1064#define AddIfInt64(Old,New,Type) if (Old != New) {\ 1005#define AddIfInt64(Old,New,Type) if (Old != New) {\
1065 Old = New; \ 1006 Old = New; \
1066 sl << uint8 (Type) << uint64 (New); \ 1007 sl << uint8 (Type) << uint64 (New); \
… …
1099 uint16 flags; 1040 uint16 flags;
1100 1041
1101 packet sl; 1042 packet sl;
1102 sl << "stats "; 1043 sl << "stats ";
1103 1044
1104 if (pl->ob != NULL) 1045 if (pl->ob)
1105 { 1046 {
1106 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1047 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);
1107 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1048 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);
1108 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1049 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);
1109 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1050 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
… …
1117 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1058 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);
1118 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1059 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1119 } 1060 }
1120 1061
1121 if (pl->socket->exp64) 1062 if (pl->socket->exp64)
1122 {
1123 uint8 s;
1124
1125 for (s = 0; s < NUM_SKILLS; s++) 1063 for (int s = 0; s < NUM_SKILLS; s++)
1126 {
1127 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 1064 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1128 { 1065 {
1129 /* Always send along the level if exp changes. This is only 1066 /* Always send along the level if exp changes. This is only
1130 * 1 extra byte, but keeps processing simpler. 1067 * 1 extra byte, but keeps processing simpler.
1131 */ 1068 */
1132 sl << uint8 (s + CS_STAT_SKILLINFO) 1069 sl << uint8 (s + CS_STAT_SKILLINFO)
1133 << uint8 (pl->last_skill_ob[s]->level) 1070 << uint8 (pl->last_skill_ob[s]->level)
1134 << uint64 (pl->last_skill_ob[s]->stats.exp); 1071 << uint64 (pl->last_skill_ob[s]->stats.exp);
1135 1072
1136 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; 1073 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1137 } 1074 }
1138 }
1139 }
1140 1075
1141 if (pl->socket->exp64) 1076 if (pl->socket->exp64)
1142 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1077 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }
1143 else 1078 else
1144 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } 1079 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
… …
1162 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1097 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1163 1098
1164 if (pl->socket->sc_version < 1025) 1099 if (pl->socket->sc_version < 1025)
1165 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1100 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1166 else 1101 else
1167 {
1168 int i;
1169
1170 for (i = 0; i < NROFATTACKS; i++) 1102 for (int i = 0; i < NROFATTACKS; i++)
1171 { 1103 {
1172 /* Skip ones we won't send */ 1104 /* Skip ones we won't send */
1173 if (atnr_cs_stat[i] == -1) 1105 if (atnr_cs_stat[i] == -1)
1174 continue; 1106 continue;
1175 1107
1176 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1108 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1177 } 1109 }
1178 }
1179 1110
1180 if (pl->socket->monitor_spells) 1111 if (pl->socket->monitor_spells)
1181 { 1112 {
1182 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1113 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1183 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1114 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
… …
1222 * when the player logs in and picks stuff up. 1153 * when the player logs in and picks stuff up.
1223 */ 1154 */
1224void 1155void
1225esrv_send_animation (client * ns, short anim_num) 1156esrv_send_animation (client * ns, short anim_num)
1226{ 1157{
1227 int i;
1228
1229 /* 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
1230 * 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
1231 * range, it must be a valid animation. 1160 * range, it must be a valid animation.
1232 */ 1161 */
1233 if (anim_num < 0 || anim_num > num_animations) 1162 if (anim_num < 0 || anim_num > num_animations)
… …
1243 << uint16 (0); /* flags - not used right now */ 1172 << uint16 (0); /* flags - not used right now */
1244 1173
1245 /* Build up the list of faces. Also, send any information (ie, the 1174 /* Build up the list of faces. Also, send any information (ie, the
1246 * the face itself) down to the client. 1175 * the face itself) down to the client.
1247 */ 1176 */
1248 for (i = 0; i < animations[anim_num].num_animations; i++) 1177 for (int i = 0; i < animations[anim_num].num_animations; i++)
1249 { 1178 {
1250 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1179 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1251 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1180 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1181
1252 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 1182 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1253 } 1183 }
1254 1184
1255 ns->send_packet (sl); 1185 ns->send_packet (sl);
1256 1186
… …
1271static void 1201static void
1272esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap) 1202esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1273{ 1203{
1274 if (newmap->cells[x][y].count >= MAP_LAYERS) 1204 if (newmap->cells[x][y].count >= MAP_LAYERS)
1275 { 1205 {
1206 //TODO: one or the other, can't both have abort and return, verify and act
1276 LOG (llevError, "Too many faces in map cell %d %d\n", x, y); 1207 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1277 return; 1208 return;
1278 abort (); 1209 abort ();
1279 } 1210 }
1280 1211
1281 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; 1212 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1282 newmap->cells[x][y].count++; 1213 newmap->cells[x][y].count++;
1283 1214
1284 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1215 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1285 esrv_send_face (ns, face_num, 0); 1216 esrv_send_face (ns, face_num, 0);
1286}
1287
1288struct LayerCell
1289{
1290 uint16 xy;
1291 short face;
1292};
1293
1294struct MapLayer
1295{
1296 int count;
1297 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1298};
1299
1300/** Checkes if map cells have changed */
1301static int
1302mapcellchanged (client * ns, int i, int j, struct Map *newmap)
1303{
1304 int k;
1305
1306 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1307 return 1;
1308 for (k = 0; k < newmap->cells[i][j].count; k++)
1309 {
1310 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1311 {
1312 return 1;
1313 }
1314 }
1315 return 0;
1316}
1317
1318/**
1319 * Basically, what this does is pack the data into layers.
1320 * cnum is the client number, cur is the the buffer we put all of
1321 * this data into. we return the end of the data. layers is
1322 * how many layers of data we should back.
1323 */
1324static uint8 *
1325compactlayer (client * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1326{
1327 int x, y, k;
1328 int face;
1329 unsigned char *fcur;
1330 struct MapLayer layers[MAP_LAYERS];
1331
1332 for (k = 0; k < MAP_LAYERS; k++)
1333 layers[k].count = 0;
1334 fcur = cur;
1335 for (x = 0; x < ns->mapx; x++)
1336 {
1337 for (y = 0; y < ns->mapy; y++)
1338 {
1339 if (!mapcellchanged (ns, x, y, newmap))
1340 continue;
1341 if (newmap->cells[x][y].count == 0)
1342 {
1343 *cur = x * ns->mapy + y; /* mark empty space */
1344 cur++;
1345 continue;
1346 }
1347 for (k = 0; k < newmap->cells[x][y].count; k++)
1348 {
1349 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1350 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1351 layers[k].count++;
1352 }
1353 }
1354 }
1355 /* If no data, return now. */
1356 if (fcur == cur && layers[0].count == 0)
1357 return cur;
1358 *cur = 255; /* mark end of explicitly cleared cells */
1359 cur++;
1360 /* First pack by layers. */
1361 for (k = 0; k < numlayers; k++)
1362 {
1363 if (layers[k].count == 0)
1364 break; /* once a layer is entirely empty, no layer below it can
1365 have anything in it either */
1366 /* Pack by entries in thie layer */
1367 for (x = 0; x < layers[k].count;)
1368 {
1369 fcur = cur;
1370 *cur = layers[k].lcells[x].face >> 8;
1371 cur++;
1372 *cur = layers[k].lcells[x].face & 0xFF;
1373 cur++;
1374 face = layers[k].lcells[x].face;
1375 /* Now, we back the redundant data into 1 byte xy pairings */
1376 for (y = x; y < layers[k].count; y++)
1377 {
1378 if (layers[k].lcells[y].face == face)
1379 {
1380 *cur = (uint8) layers[k].lcells[y].xy;
1381 cur++;
1382 layers[k].lcells[y].face = -1;
1383 }
1384 }
1385 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1386 /* forward over the now redundant data */
1387 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1388 x++;
1389 }
1390 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1391 }
1392 return cur;
1393} 1217}
1394 1218
1395/** Clears a map cell */ 1219/** Clears a map cell */
1396static void 1220static void
1397map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1221map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
… …
1409#define MAX_LAYERS 3 1233#define MAX_LAYERS 3
1410 1234
1411/* Using a global really isn't a good approach, but saves the over head of 1235/* Using a global really isn't a good approach, but saves the over head of
1412 * allocating and deallocating such a block of data each time run through, 1236 * allocating and deallocating such a block of data each time run through,
1413 * and saves the space of allocating this in the socket object when we only 1237 * and saves the space of allocating this in the socket object when we only
1414 * need it for this cycle. If the serve is ever threaded, this needs to be 1238 * need it for this cycle. If the server is ever threaded, this needs to be
1415 * re-examined. 1239 * re-examined.
1416 */ 1240 */
1417
1418static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1241static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1419 1242
1420/** 1243/**
1421 * Returns true if any of the heads for this 1244 * Returns true if any of the heads for this
1422 * space is set. Returns false if all are blank - this is used 1245 * space is set. Returns false if all are blank - this is used
1423 * for empty space checking. 1246 * for empty space checking.
1424 */ 1247 */
1425static inline int 1248static inline int
1426have_head (int ax, int ay) 1249have_head (int ax, int ay)
1427{ 1250{
1428
1429 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1251 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1430 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) 1252 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1431 return 1; 1253 return 1;
1254
1432 return 0; 1255 return 0;
1433} 1256}
1434 1257
1435/** 1258/**
1436 * check_head is a bit simplistic version of update_space below. 1259 * check_head is a bit simplistic version of update_space below.
1437 * basically, it only checks the that the head on space ax,ay at layer 1260 * basically, it only checks the that the head on space ax,ay at layer
1438 * needs to get sent - if so, it adds the data, sending the head 1261 * needs to get sent - if so, it adds the data, sending the head
1439 * if needed, and returning 1. If this no data needs to get 1262 * if needed, and returning 1. If this no data needs to get
1440 * sent, it returns zero. 1263 * sent, it returns zero.
1441 */ 1264 */
1442static int 1265static int
1443check_head (packet &sl, client &ns, int ax, int ay, int layer) 1266check_head (packet &sl, client &ns, int ax, int ay, int layer)
1444{ 1267{
… …
1480 * numbers the spaces differently - I think this was a leftover from 1303 * numbers the spaces differently - I think this was a leftover from
1481 * the map command, where the faces stack up. Sinces that is no longer 1304 * the map command, where the faces stack up. Sinces that is no longer
1482 * the case, it seems to make more sense to have these layer values 1305 * the case, it seems to make more sense to have these layer values
1483 * actually match. 1306 * actually match.
1484 */ 1307 */
1485
1486static int 1308static int
1487update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1309update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1488{ 1310{
1489 object *ob, *head; 1311 object *ob, *head;
1490 uint16 face_num; 1312 uint16 face_num;
… …
1758 if (ns->ext_mapinfos) 1580 if (ns->ext_mapinfos)
1759 { 1581 {
1760 if (ns->EMI_smooth) 1582 if (ns->EMI_smooth)
1761 result += 1; /*One byte for smoothlevel */ 1583 result += 1; /*One byte for smoothlevel */
1762 } 1584 }
1585
1763 return result; 1586 return result;
1764} 1587}
1765 1588
1766/** 1589/**
1767 * This function uses the new map1 protocol command to send the map 1590 * This function uses the new map1 protocol command to send the map
… …
2204 { 2027 {
2205 ax = i; 2028 ax = i;
2206 ay = j; 2029 ay = j;
2207 m = pm; 2030 m = pm;
2208 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2031 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2032
2209 if (mflags & P_OUT_OF_MAP) 2033 if (mflags & P_OUT_OF_MAP)
2210 continue; 2034 continue;
2035
2211 if (mflags & P_NEED_UPDATE) 2036 if (mflags & P_NEED_UPDATE)
2212 update_position (m, ax, ay); 2037 update_position (m, ax, ay);
2038
2213 /* If a map is visible to the player, we don't want to swap it out 2039 /* If a map is visible to the player, we don't want to swap it out
2214 * just to reload it. This should really call something like 2040 * just to reload it. This should really call something like
2215 * swap_map, but this is much more efficient and 'good enough' 2041 * swap_map, but this is much more efficient and 'good enough'
2216 */ 2042 */
2217 if (mflags & P_NEW_MAP) 2043 if (mflags & P_NEW_MAP)
… …
2420 2246
2421 if (!pl->socket->monitor_spells) 2247 if (!pl->socket->monitor_spells)
2422 return; 2248 return;
2423 2249
2424 packet sl; 2250 packet sl;
2425
2426 sl << "addspell "; 2251 sl << "addspell ";
2427 2252
2428 if (!spell) 2253 if (!spell)
2429 { 2254 {
2430 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2255 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)

Diff Legend

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