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.44 by root, Sat Dec 16 21:40:26 2006 UTC

… …
38 * esrv_map_new starts updating the map 38 * esrv_map_new starts updating the map
39 * 39 *
40 * esrv_map_setbelow allows filling in all of the faces for the map. 40 * esrv_map_setbelow allows filling in all of the faces for the map.
41 * if a face has not already been sent to the client, it is sent now. 41 * if a face has not already been sent to the client, it is sent now.
42 * 42 *
43 * mapcellchanged, compactlayer, compactstack, perform the map compressing
44 * operations
45 *
46 */ 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
… …
575 * it either has to be here or init_sockets needs to be exported. 567 * it either has to be here or init_sockets needs to be exported.
576 */ 568 */
577void 569void
578AddMeCmd (char *buf, int len, client * ns) 570AddMeCmd (char *buf, int len, client * ns)
579{ 571{
580 Settings oldsettings;
581
582 oldsettings = settings;
583 if (ns->status != Ns_Add || add_player (ns)) 572 if (ns->status != Ns_Add || add_player (ns))
584 ns->send_packet ("addme_failed"); 573 ns->send_packet ("addme_failed");
585 else 574 else
586 ns->send_packet ("addme_success"); 575 ns->send_packet ("addme_success");
587
588 settings = oldsettings;
589} 576}
590 577
591/** Reply to ExtendedInfos command */ 578/** Reply to ExtendedInfos command */
592void 579void
593ToggleExtendedInfos (char *buf, int len, client * ns) 580ToggleExtendedInfos (char *buf, int len, client * ns)
… …
710 * a piece of data from us that we know the client wants. So 697 * a piece of data from us that we know the client wants. So
711 * if we know the client wants it, might as well push it to the 698 * if we know the client wants it, might as well push it to the
712 * client. 699 * client.
713 */ 700 */
714static void 701static void
715SendSmooth (client * ns, uint16 face) 702SendSmooth (client *ns, uint16 face)
716{ 703{
717 uint16 smoothface; 704 uint16 smoothface;
718 705
719 /* If we can't find a face, return and set it so we won't try to send this 706 /* If we can't find a face, return and set it so we won't try to send this
720 * again. 707 * again.
… …
744 /** 731 /**
745 * Tells client the picture it has to use 732 * Tells client the picture it has to use
746 * to smooth a picture number given as argument. 733 * to smooth a picture number given as argument.
747 */ 734 */
748void 735void
749AskSmooth (char *buf, int len, client * ns) 736AskSmooth (char *buf, int len, client *ns)
750{ 737{
751 uint16 facenbr; 738 SendSmooth (ns, atoi (buf));
752
753 facenbr = atoi (buf);
754 SendSmooth (ns, facenbr);
755} 739}
756 740
757/** 741/**
758 * This handles the general commands from the client (ie, north, fire, cast, 742 * This handles the general commands from the client (ie, north, fire, cast,
759 * etc.) 743 * etc.)
760 */ 744 */
761void 745void
762PlayerCmd (char *buf, int len, player *pl) 746PlayerCmd (char *buf, int len, player *pl)
763{ 747{
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 748 /* Check if there is a count. In theory, a zero count could also be
776 * sent, so check for that also. 749 * sent, so check for that also.
777 */ 750 */
778 if (atoi (buf) || buf[0] == '0') 751 if (atoi (buf) || buf[0] == '0')
779 { 752 {
780 pl->count = atoi ((char *) buf); 753 pl->count = atoi ((char *) buf);
754
781 buf = strchr (buf, ' '); /* advance beyond the numbers */ 755 buf = strchr (buf, ' '); /* advance beyond the numbers */
782 if (!buf) 756 if (!buf)
783 {
784#ifdef ESRV_DEBUG
785 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
786#endif
787 return; 757 return;
788 } 758
789 buf++; 759 buf++;
790 } 760 }
791 /* This should not happen anymore. */ 761
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); 762 execute_newserver_command (pl->ob, (char *) buf);
763
798 /* Perhaps something better should be done with a left over count. 764 /* Perhaps something better should be done with a left over count.
799 * Cleaning up the input should probably be done first - all actions 765 * 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 766 * for the command that issued the count should be done before any other
801 * commands. 767 * commands.
802 */ 768 */
803
804 pl->count = 0; 769 pl->count = 0;
805
806} 770}
807 771
808 772
809/** 773/**
810 * This handles the general commands from the client (ie, north, fire, cast, 774 * This handles the general commands from the client (ie, north, fire, cast,
… …
813 * can throttle. 777 * can throttle.
814 */ 778 */
815void 779void
816NewPlayerCmd (char *buf, int len, player *pl) 780NewPlayerCmd (char *buf, int len, player *pl)
817{ 781{
818 int time, repeat;
819 char command[MAX_BUF];
820 int pktlen;
821
822 if (len < 7) 782 if (len <= 6)
823 { 783 {
824 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 784 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
825 return; 785 return;
826 } 786 }
827 787
828 pktlen = net_uint16 ((uint8 *)buf); 788 uint16 cmdid = net_uint16 ((uint8 *)buf);
829 repeat = net_uint32 ((uint8 *)buf + 2); 789 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
830 790
831 /* -1 is special - no repeat, but don't update */ 791 /* -1 is special - no repeat, but don't update */
832 if (repeat != -1) 792 if (repeat != -1)
833 pl->count = repeat; 793 pl->count = repeat;
834 794
835 if ((len - 4) >= MAX_BUF) 795 buf += 6; //len -= 6;
836 len = MAX_BUF - 5;
837 796
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); 797 execute_newserver_command (pl->ob, buf);
798
847 /* Perhaps something better should be done with a left over count. 799 /* Perhaps something better should be done with a left over count.
848 * Cleaning up the input should probably be done first - all actions 800 * 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 801 * for the command that issued the count should be done before any other
850 * commands. 802 * commands.
851 */ 803 */
852 pl->count = 0; 804 pl->count = 0;
853 805
806 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
854 if (FABS (pl->ob->speed) < 0.001) 807 int time = FABS (pl->ob->speed) < 0.001
855 time = MAX_TIME * 100; 808 ? time = MAX_TIME * 100
856 else
857 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 809 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
858 810
859 /* Send confirmation of command execution now */ 811 /* Send confirmation of command execution now */
860
861 packet sl; 812 packet sl;
862 sl << "comc " << uint16 (pktlen) << uint32 (time); 813 sl << "comc " << uint16 (cmdid) << uint32 (time);
863 pl->socket->send_packet (sl); 814 pl->socket->send_packet (sl);
864} 815}
865 816
866 817
867/** This is a reply to a previous query. */ 818/** This is a reply to a previous query. */
868void 819void
869ReplyCmd (char *buf, int len, player *pl) 820ReplyCmd (char *buf, int len, player *pl)
870{ 821{
871 /* This is to synthesize how the data would be stored if it 822 /* This is to synthesize how the data would be stored if it
872 * was normally entered. A bit of a hack, and should be cleaned up 823 * was normally entered. A bit of a hack, and should be cleaned up
873 * once all the X11 code is removed from the server. 824 * once all the X11 code is removed from the server.
874 * 825 *
875 * We pass 13 to many of the functions because this way they 826 * We pass 13 to many of the functions because this way they
876 * think it was the carriage return that was entered, and the 827 * think it was the carriage return that was entered, and the
877 * function then does not try to do additional input. 828 * function then does not try to do additional input.
… …
880 831
881 /* this avoids any hacking here */ 832 /* this avoids any hacking here */
882 833
883 switch (pl->state) 834 switch (pl->state)
884 { 835 {
885 case ST_PLAYING: 836 case ST_PLAYING:
886 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 837 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
887 break; 838 break;
888 839
889 case ST_PLAY_AGAIN: 840 case ST_PLAY_AGAIN:
890 /* We can check this for return value (2==quit). Maybe we 841 /* We can check this for return value (2==quit). Maybe we
891 * should, and do something appropriate? 842 * should, and do something appropriate?
892 */ 843 */
893 receive_play_again (pl->ob, buf[0]); 844 receive_play_again (pl->ob, buf[0]);
894 break; 845 break;
895 846
896 case ST_ROLL_STAT: 847 case ST_ROLL_STAT:
897 key_roll_stat (pl->ob, buf[0]); 848 key_roll_stat (pl->ob, buf[0]);
898 break; 849 break;
899 850
900 case ST_CHANGE_CLASS: 851 case ST_CHANGE_CLASS:
901 852
902 key_change_class (pl->ob, buf[0]); 853 key_change_class (pl->ob, buf[0]);
903 break; 854 break;
904 855
905 case ST_CONFIRM_QUIT: 856 case ST_CONFIRM_QUIT:
906 key_confirm_quit (pl->ob, buf[0]); 857 key_confirm_quit (pl->ob, buf[0]);
907 break; 858 break;
908 859
909 case ST_CONFIGURE: 860 case ST_CONFIGURE:
910 LOG (llevError, "In client input handling, but into configure state\n"); 861 LOG (llevError, "In client input handling, but into configure state\n");
911 pl->state = ST_PLAYING; 862 pl->state = ST_PLAYING;
912 break; 863 break;
913 864
914 case ST_GET_NAME: 865 case ST_GET_NAME:
915 receive_player_name (pl->ob, 13); 866 receive_player_name (pl->ob, 13);
916 break; 867 break;
917 868
918 case ST_GET_PASSWORD: 869 case ST_GET_PASSWORD:
919 case ST_CONFIRM_PASSWORD: 870 case ST_CONFIRM_PASSWORD:
920 receive_player_password (pl->ob, 13); 871 receive_player_password (pl->ob, 13);
921 break; 872 break;
922 873
923 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 874 case ST_GET_PARTY_PASSWORD: /* Get password for party */
924 receive_party_password (pl->ob, 13); 875 receive_party_password (pl->ob, 13);
925 break; 876 break;
926 877
927 default: 878 default:
928 LOG (llevError, "Unknown input state: %d\n", pl->state); 879 LOG (llevError, "Unknown input state: %d\n", pl->state);
929 } 880 }
930} 881}
931 882
932/** 883/**
933 * Client tells its version. If there is a mismatch, we close the 884 * Client tells its version. If there is a mismatch, we close the
… …
937 * problem. 888 * problem.
938 */ 889 */
939void 890void
940VersionCmd (char *buf, int len, client * ns) 891VersionCmd (char *buf, int len, client * ns)
941{ 892{
942 char *cp;
943 char version_warning[256];
944
945 if (!buf) 893 if (!buf)
946 { 894 {
947 LOG (llevError, "CS: received corrupted version command\n"); 895 LOG (llevError, "CS: received corrupted version command\n");
948 return; 896 return;
949 } 897 }
950 898
951 ns->cs_version = atoi (buf); 899 ns->cs_version = atoi (buf);
952 ns->sc_version = ns->cs_version; 900 ns->sc_version = ns->cs_version;
901
902 LOG (llevDebug, "connection from client <%s>\n", buf);
903
904
905 //TODO: should log here just for statistics
906
953 if (VERSION_CS != ns->cs_version) 907 //if (VERSION_CS != ns->cs_version)
954 { 908 // unchecked;
955#ifdef ESRV_DEBUG 909
956 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
957#endif
958 }
959 cp = strchr (buf + 1, ' '); 910 char *cp = strchr (buf + 1, ' ');
960 if (!cp) 911 if (!cp)
961 return; 912 return;
913
962 ns->sc_version = atoi (cp); 914 ns->sc_version = atoi (cp);
915
963 if (VERSION_SC != ns->sc_version) 916 //if (VERSION_SC != ns->sc_version)
964 { 917 // unchecked;
965#ifdef ESRV_DEBUG 918
966 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
967#endif
968 }
969 cp = strchr (cp + 1, ' '); 919 cp = strchr (cp + 1, ' ');
920
970 if (cp) 921 if (cp)
971 { 922 {
972 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host);
973
974 assign (ns->version, cp + 1); 923 assign (ns->version, cp + 1);
975 924
976 if (ns->sc_version < 1026) 925 if (ns->sc_version < 1026)
977 { 926 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!! ****"); 927 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
980 ns->send_packet (version_warning);
981 }
982
983 } 928 }
984} 929}
985 930
986/** sound related functions. */ 931/** sound related functions. */
987void 932void
… …
993/** client wants the map resent */ 938/** client wants the map resent */
994 939
995void 940void
996MapRedrawCmd (char *buf, int len, player *pl) 941MapRedrawCmd (char *buf, int len, player *pl)
997{ 942{
998
999/* This function is currently disabled; just clearing the map state results in 943/* This function is currently disabled; just clearing the map state results in
1000 * display errors. It should clear the cache and send a newmap command. 944 * display errors. It should clear the cache and send a newmap command.
1001 * Unfortunately this solution does not work because some client versions send 945 * Unfortunately this solution does not work because some client versions send
1002 * a mapredraw command after receiving a newmap command. 946 * a mapredraw command after receiving a newmap command.
1003 */ 947 */
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} 948}
1012 949
1013/** 950/**
1014 * Moves an object (typically, container to inventory). 951 * Moves an object (typically, container to inventory).
1015 * syntax is: move (to) (tag) (nrof) 952 * syntax is: move (to) (tag) (nrof)
… …
1018MoveCmd (char *buf, int len, player *pl) 955MoveCmd (char *buf, int len, player *pl)
1019{ 956{
1020 int vals[3], i; 957 int vals[3], i;
1021 958
1022 /* A little funky here. We only cycle for 2 records, because 959 /* A little funky here. We only cycle for 2 records, because
1023 * we obviously am not going to find a space after the third 960 * we obviously are not going to find a space after the third
1024 * record. Perhaps we should just replace this with a 961 * record. Perhaps we should just replace this with a
1025 * sscanf? 962 * sscanf?
1026 */ 963 */
1027 for (i = 0; i < 2; i++) 964 for (i = 0; i < 2; i++)
1028 { 965 {
1029 vals[i] = atoi (buf); 966 vals[i] = atoi (buf);
967
1030 if (!(buf = strchr (buf, ' '))) 968 if (!(buf = strchr (buf, ' ')))
1031 { 969 {
1032 LOG (llevError, "Incomplete move command: %s\n", buf); 970 LOG (llevError, "Incomplete move command: %s\n", buf);
1033 return; 971 return;
1034 } 972 }
973
1035 buf++; 974 buf++;
1036 } 975 }
976
1037 vals[2] = atoi (buf); 977 vals[2] = atoi (buf);
1038 978
1039/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 979/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1040 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 980 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1041} 981}
1042
1043
1044 982
1045/****************************************************************************** 983/******************************************************************************
1046 * 984 *
1047 * Start of commands the server sends to the client. 985 * Start of commands the server sends to the client.
1048 * 986 *
… …
1051/** 989/**
1052 * Asks the client to query the user. This way, the client knows 990 * Asks the client to query the user. This way, the client knows
1053 * it needs to send something back (vs just printing out a message) 991 * it needs to send something back (vs just printing out a message)
1054 */ 992 */
1055void 993void
1056send_query (client * ns, uint8 flags, char *text) 994send_query (client *ns, uint8 flags, char *text)
1057{ 995{
1058 char buf[MAX_BUF];
1059
1060 sprintf (buf, "query %d %s", flags, text ? text : ""); 996 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1061 ns->send_packet (buf);
1062} 997}
1063 998
1064#define AddIfInt64(Old,New,Type) if (Old != New) {\ 999#define AddIfInt64(Old,New,Type) if (Old != New) {\
1065 Old = New; \ 1000 Old = New; \
1066 sl << uint8 (Type) << uint64 (New); \ 1001 sl << uint8 (Type) << uint64 (New); \
… …
1099 uint16 flags; 1034 uint16 flags;
1100 1035
1101 packet sl; 1036 packet sl;
1102 sl << "stats "; 1037 sl << "stats ";
1103 1038
1104 if (pl->ob != NULL) 1039 if (pl->ob)
1105 { 1040 {
1106 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1041 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);
1107 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1042 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);
1108 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1043 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);
1109 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1044 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
… …
1117 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1052 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);
1118 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1053 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1119 } 1054 }
1120 1055
1121 if (pl->socket->exp64) 1056 if (pl->socket->exp64)
1122 {
1123 uint8 s;
1124
1125 for (s = 0; s < NUM_SKILLS; s++) 1057 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) 1058 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1128 { 1059 {
1129 /* Always send along the level if exp changes. This is only 1060 /* Always send along the level if exp changes. This is only
1130 * 1 extra byte, but keeps processing simpler. 1061 * 1 extra byte, but keeps processing simpler.
1131 */ 1062 */
1132 sl << uint8 (s + CS_STAT_SKILLINFO) 1063 sl << uint8 (s + CS_STAT_SKILLINFO)
1133 << uint8 (pl->last_skill_ob[s]->level) 1064 << uint8 (pl->last_skill_ob[s]->level)
1134 << uint64 (pl->last_skill_ob[s]->stats.exp); 1065 << uint64 (pl->last_skill_ob[s]->stats.exp);
1135 1066
1136 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; 1067 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1137 } 1068 }
1138 }
1139 }
1140 1069
1141 if (pl->socket->exp64) 1070 if (pl->socket->exp64)
1142 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1071 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }
1143 else 1072 else
1144 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } 1073 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
… …
1162 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1091 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1163 1092
1164 if (pl->socket->sc_version < 1025) 1093 if (pl->socket->sc_version < 1025)
1165 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1094 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1166 else 1095 else
1167 {
1168 int i;
1169
1170 for (i = 0; i < NROFATTACKS; i++) 1096 for (int i = 0; i < NROFATTACKS; i++)
1171 { 1097 {
1172 /* Skip ones we won't send */ 1098 /* Skip ones we won't send */
1173 if (atnr_cs_stat[i] == -1) 1099 if (atnr_cs_stat[i] == -1)
1174 continue; 1100 continue;
1175 1101
1176 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1102 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1177 } 1103 }
1178 }
1179 1104
1180 if (pl->socket->monitor_spells) 1105 if (pl->socket->monitor_spells)
1181 { 1106 {
1182 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1107 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1183 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1108 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
… …
1222 * when the player logs in and picks stuff up. 1147 * when the player logs in and picks stuff up.
1223 */ 1148 */
1224void 1149void
1225esrv_send_animation (client * ns, short anim_num) 1150esrv_send_animation (client * ns, short anim_num)
1226{ 1151{
1227 int i;
1228
1229 /* Do some checking on the anim_num we got. Note that the animations 1152 /* Do some checking on the anim_num we got. Note that the animations
1230 * are added in contigous order, so if the number is in the valid 1153 * are added in contigous order, so if the number is in the valid
1231 * range, it must be a valid animation. 1154 * range, it must be a valid animation.
1232 */ 1155 */
1233 if (anim_num < 0 || anim_num > num_animations) 1156 if (anim_num < 0 || anim_num > num_animations)
… …
1243 << uint16 (0); /* flags - not used right now */ 1166 << uint16 (0); /* flags - not used right now */
1244 1167
1245 /* Build up the list of faces. Also, send any information (ie, the 1168 /* Build up the list of faces. Also, send any information (ie, the
1246 * the face itself) down to the client. 1169 * the face itself) down to the client.
1247 */ 1170 */
1248 for (i = 0; i < animations[anim_num].num_animations; i++) 1171 for (int i = 0; i < animations[anim_num].num_animations; i++)
1249 { 1172 {
1250 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1173 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1251 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1174 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1175
1252 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 1176 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1253 } 1177 }
1254 1178
1255 ns->send_packet (sl); 1179 ns->send_packet (sl);
1256 1180
… …
1271static void 1195static void
1272esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap) 1196esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1273{ 1197{
1274 if (newmap->cells[x][y].count >= MAP_LAYERS) 1198 if (newmap->cells[x][y].count >= MAP_LAYERS)
1275 { 1199 {
1200 //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); 1201 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1277 return; 1202 return;
1278 abort (); 1203 abort ();
1279 } 1204 }
1280 1205
1281 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; 1206 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1282 newmap->cells[x][y].count++; 1207 newmap->cells[x][y].count++;
1283 1208
1284 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1209 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1285 esrv_send_face (ns, face_num, 0); 1210 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} 1211}
1394 1212
1395/** Clears a map cell */ 1213/** Clears a map cell */
1396static void 1214static void
1397map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1215map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
… …
1409#define MAX_LAYERS 3 1227#define MAX_LAYERS 3
1410 1228
1411/* Using a global really isn't a good approach, but saves the over head of 1229/* Using a global really isn't a good approach, but saves the over head of
1412 * allocating and deallocating such a block of data each time run through, 1230 * allocating and deallocating such a block of data each time run through,
1413 * and saves the space of allocating this in the socket object when we only 1231 * and saves the space of allocating this in the socket object when we only
1414 * need it for this cycle. If the serve is ever threaded, this needs to be 1232 * need it for this cycle. If the server is ever threaded, this needs to be
1415 * re-examined. 1233 * re-examined.
1416 */ 1234 */
1417
1418static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1235static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1419 1236
1420/** 1237/**
1421 * Returns true if any of the heads for this 1238 * Returns true if any of the heads for this
1422 * space is set. Returns false if all are blank - this is used 1239 * space is set. Returns false if all are blank - this is used
1423 * for empty space checking. 1240 * for empty space checking.
1424 */ 1241 */
1425static inline int 1242static inline int
1426have_head (int ax, int ay) 1243have_head (int ax, int ay)
1427{ 1244{
1428
1429 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1245 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]) 1246 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1431 return 1; 1247 return 1;
1248
1432 return 0; 1249 return 0;
1433} 1250}
1434 1251
1435/** 1252/**
1436 * check_head is a bit simplistic version of update_space below. 1253 * 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 1254 * 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 1255 * 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 1256 * if needed, and returning 1. If this no data needs to get
1440 * sent, it returns zero. 1257 * sent, it returns zero.
1441 */ 1258 */
1442static int 1259static int
1443check_head (packet &sl, client &ns, int ax, int ay, int layer) 1260check_head (packet &sl, client &ns, int ax, int ay, int layer)
1444{ 1261{
… …
1480 * numbers the spaces differently - I think this was a leftover from 1297 * 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 1298 * 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 1299 * the case, it seems to make more sense to have these layer values
1483 * actually match. 1300 * actually match.
1484 */ 1301 */
1485
1486static int 1302static int
1487update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1303update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1488{ 1304{
1489 object *ob, *head; 1305 object *ob, *head;
1490 uint16 face_num; 1306 uint16 face_num;
… …
1758 if (ns->ext_mapinfos) 1574 if (ns->ext_mapinfos)
1759 { 1575 {
1760 if (ns->EMI_smooth) 1576 if (ns->EMI_smooth)
1761 result += 1; /*One byte for smoothlevel */ 1577 result += 1; /*One byte for smoothlevel */
1762 } 1578 }
1579
1763 return result; 1580 return result;
1764} 1581}
1765 1582
1766/** 1583/**
1767 * This function uses the new map1 protocol command to send the map 1584 * This function uses the new map1 protocol command to send the map
… …
2204 { 2021 {
2205 ax = i; 2022 ax = i;
2206 ay = j; 2023 ay = j;
2207 m = pm; 2024 m = pm;
2208 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2025 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2026
2209 if (mflags & P_OUT_OF_MAP) 2027 if (mflags & P_OUT_OF_MAP)
2210 continue; 2028 continue;
2029
2211 if (mflags & P_NEED_UPDATE) 2030 if (mflags & P_NEED_UPDATE)
2212 update_position (m, ax, ay); 2031 update_position (m, ax, ay);
2032
2213 /* If a map is visible to the player, we don't want to swap it out 2033 /* If a map is visible to the player, we don't want to swap it out
2214 * just to reload it. This should really call something like 2034 * just to reload it. This should really call something like
2215 * swap_map, but this is much more efficient and 'good enough' 2035 * swap_map, but this is much more efficient and 'good enough'
2216 */ 2036 */
2217 if (mflags & P_NEW_MAP) 2037 if (mflags & P_NEW_MAP)
… …
2420 2240
2421 if (!pl->socket->monitor_spells) 2241 if (!pl->socket->monitor_spells)
2422 return; 2242 return;
2423 2243
2424 packet sl; 2244 packet sl;
2425
2426 sl << "addspell "; 2245 sl << "addspell ";
2427 2246
2428 if (!spell) 2247 if (!spell)
2429 { 2248 {
2430 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2249 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)

Diff Legend

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