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.43 by root, Sat Dec 16 20:16:37 2006 UTC vs.
Revision 1.44 by root, Sat Dec 16 21:40:26 2006 UTC

… …
37 * 37 *
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 *
43 * mapcellchanged, compactlayer, compactstack, perform the map compressing
44 * operations
45 * 42 *
46 */ 43 */
47 44
48#include <global.h> 45#include <global.h>
49#include <sproto.h> 46#include <sproto.h>
… …
700 * 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
701 * 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
702 * client. 699 * client.
703 */ 700 */
704static void 701static void
705SendSmooth (client * ns, uint16 face) 702SendSmooth (client *ns, uint16 face)
706{ 703{
707 uint16 smoothface; 704 uint16 smoothface;
708 705
709 /* 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
710 * again. 707 * again.
… …
734 /** 731 /**
735 * Tells client the picture it has to use 732 * Tells client the picture it has to use
736 * to smooth a picture number given as argument. 733 * to smooth a picture number given as argument.
737 */ 734 */
738void 735void
739AskSmooth (char *buf, int len, client * ns) 736AskSmooth (char *buf, int len, client *ns)
740{ 737{
741 uint16 facenbr; 738 SendSmooth (ns, atoi (buf));
742
743 facenbr = atoi (buf);
744 SendSmooth (ns, facenbr);
745} 739}
746 740
747/** 741/**
748 * 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,
749 * etc.) 743 * etc.)
750 */ 744 */
751void 745void
752PlayerCmd (char *buf, int len, player *pl) 746PlayerCmd (char *buf, int len, player *pl)
753{ 747{
754
755 /* The following should never happen with a proper or honest client.
756 * Therefore, the error message doesn't have to be too clear - if
757 * someone is playing with a hacked/non working client, this gives them
758 * an idea of the problem, but they deserve what they get
759 */
760 if (pl->state != ST_PLAYING)
761 {
762 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
763 return;
764 }
765 /* 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
766 * sent, so check for that also. 749 * sent, so check for that also.
767 */ 750 */
768 if (atoi (buf) || buf[0] == '0') 751 if (atoi (buf) || buf[0] == '0')
769 { 752 {
770 pl->count = atoi ((char *) buf); 753 pl->count = atoi ((char *) buf);
754
771 buf = strchr (buf, ' '); /* advance beyond the numbers */ 755 buf = strchr (buf, ' '); /* advance beyond the numbers */
772 if (!buf) 756 if (!buf)
773 {
774#ifdef ESRV_DEBUG
775 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
776#endif
777 return; 757 return;
778 } 758
779 buf++; 759 buf++;
780 } 760 }
781 /* This should not happen anymore. */ 761
782 if (pl->ob->speed_left < -1.0)
783 {
784 LOG (llevError, "Player has negative time - shouldn't do command.\n");
785 }
786 /* In c_new.c */
787 execute_newserver_command (pl->ob, (char *) buf); 762 execute_newserver_command (pl->ob, (char *) buf);
763
788 /* Perhaps something better should be done with a left over count. 764 /* Perhaps something better should be done with a left over count.
789 * Cleaning up the input should probably be done first - all actions 765 * Cleaning up the input should probably be done first - all actions
790 * 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
791 * commands. 767 * commands.
792 */ 768 */
793
794 pl->count = 0; 769 pl->count = 0;
795
796} 770}
797 771
798 772
799/** 773/**
800 * 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,
… …
803 * can throttle. 777 * can throttle.
804 */ 778 */
805void 779void
806NewPlayerCmd (char *buf, int len, player *pl) 780NewPlayerCmd (char *buf, int len, player *pl)
807{ 781{
808 int time, repeat;
809 char command[MAX_BUF];
810 int pktlen;
811
812 if (len < 7) 782 if (len <= 6)
813 { 783 {
814 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);
815 return; 785 return;
816 } 786 }
817 787
818 pktlen = net_uint16 ((uint8 *)buf); 788 uint16 cmdid = net_uint16 ((uint8 *)buf);
819 repeat = net_uint32 ((uint8 *)buf + 2); 789 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
820 790
821 /* -1 is special - no repeat, but don't update */ 791 /* -1 is special - no repeat, but don't update */
822 if (repeat != -1) 792 if (repeat != -1)
823 pl->count = repeat; 793 pl->count = repeat;
824 794
825 if ((len - 4) >= MAX_BUF) 795 buf += 6; //len -= 6;
826 len = MAX_BUF - 5;
827 796
828 strncpy ((char *) command, (char *) buf + 6, len - 4);
829 command[len - 4] = 0;
830
831 /* This should not happen anymore. */
832 if (pl->ob->speed_left < -1.0)
833 LOG (llevError, "Player has negative time - shouldn't do command.\n");
834
835 /* In c_new.c */
836 execute_newserver_command (pl->ob, (char *) command); 797 execute_newserver_command (pl->ob, buf);
798
837 /* Perhaps something better should be done with a left over count. 799 /* Perhaps something better should be done with a left over count.
838 * Cleaning up the input should probably be done first - all actions 800 * Cleaning up the input should probably be done first - all actions
839 * 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
840 * commands. 802 * commands.
841 */ 803 */
842 pl->count = 0; 804 pl->count = 0;
843 805
806 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
844 if (FABS (pl->ob->speed) < 0.001) 807 int time = FABS (pl->ob->speed) < 0.001
845 time = MAX_TIME * 100; 808 ? time = MAX_TIME * 100
846 else
847 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 809 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
848 810
849 /* Send confirmation of command execution now */ 811 /* Send confirmation of command execution now */
850
851 packet sl; 812 packet sl;
852 sl << "comc " << uint16 (pktlen) << uint32 (time); 813 sl << "comc " << uint16 (cmdid) << uint32 (time);
853 pl->socket->send_packet (sl); 814 pl->socket->send_packet (sl);
854} 815}
855 816
856 817
857/** This is a reply to a previous query. */ 818/** This is a reply to a previous query. */
858void 819void
859ReplyCmd (char *buf, int len, player *pl) 820ReplyCmd (char *buf, int len, player *pl)
860{ 821{
861 /* 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
862 * 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
863 * once all the X11 code is removed from the server. 824 * once all the X11 code is removed from the server.
864 * 825 *
865 * 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
866 * think it was the carriage return that was entered, and the 827 * think it was the carriage return that was entered, and the
867 * function then does not try to do additional input. 828 * function then does not try to do additional input.
… …
870 831
871 /* this avoids any hacking here */ 832 /* this avoids any hacking here */
872 833
873 switch (pl->state) 834 switch (pl->state)
874 { 835 {
875 case ST_PLAYING: 836 case ST_PLAYING:
876 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 837 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
877 break; 838 break;
878 839
879 case ST_PLAY_AGAIN: 840 case ST_PLAY_AGAIN:
880 /* We can check this for return value (2==quit). Maybe we 841 /* We can check this for return value (2==quit). Maybe we
881 * should, and do something appropriate? 842 * should, and do something appropriate?
882 */ 843 */
883 receive_play_again (pl->ob, buf[0]); 844 receive_play_again (pl->ob, buf[0]);
884 break; 845 break;
885 846
886 case ST_ROLL_STAT: 847 case ST_ROLL_STAT:
887 key_roll_stat (pl->ob, buf[0]); 848 key_roll_stat (pl->ob, buf[0]);
888 break; 849 break;
889 850
890 case ST_CHANGE_CLASS: 851 case ST_CHANGE_CLASS:
891 852
892 key_change_class (pl->ob, buf[0]); 853 key_change_class (pl->ob, buf[0]);
893 break; 854 break;
894 855
895 case ST_CONFIRM_QUIT: 856 case ST_CONFIRM_QUIT:
896 key_confirm_quit (pl->ob, buf[0]); 857 key_confirm_quit (pl->ob, buf[0]);
897 break; 858 break;
898 859
899 case ST_CONFIGURE: 860 case ST_CONFIGURE:
900 LOG (llevError, "In client input handling, but into configure state\n"); 861 LOG (llevError, "In client input handling, but into configure state\n");
901 pl->state = ST_PLAYING; 862 pl->state = ST_PLAYING;
902 break; 863 break;
903 864
904 case ST_GET_NAME: 865 case ST_GET_NAME:
905 receive_player_name (pl->ob, 13); 866 receive_player_name (pl->ob, 13);
906 break; 867 break;
907 868
908 case ST_GET_PASSWORD: 869 case ST_GET_PASSWORD:
909 case ST_CONFIRM_PASSWORD: 870 case ST_CONFIRM_PASSWORD:
910 receive_player_password (pl->ob, 13); 871 receive_player_password (pl->ob, 13);
911 break; 872 break;
912 873
913 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 874 case ST_GET_PARTY_PASSWORD: /* Get password for party */
914 receive_party_password (pl->ob, 13); 875 receive_party_password (pl->ob, 13);
915 break; 876 break;
916 877
917 default: 878 default:
918 LOG (llevError, "Unknown input state: %d\n", pl->state); 879 LOG (llevError, "Unknown input state: %d\n", pl->state);
919 } 880 }
920} 881}
921 882
922/** 883/**
923 * 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
… …
927 * problem. 888 * problem.
928 */ 889 */
929void 890void
930VersionCmd (char *buf, int len, client * ns) 891VersionCmd (char *buf, int len, client * ns)
931{ 892{
932 char *cp;
933 char version_warning[256];
934
935 if (!buf) 893 if (!buf)
936 { 894 {
937 LOG (llevError, "CS: received corrupted version command\n"); 895 LOG (llevError, "CS: received corrupted version command\n");
938 return; 896 return;
939 } 897 }
940 898
941 ns->cs_version = atoi (buf); 899 ns->cs_version = atoi (buf);
942 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
943 if (VERSION_CS != ns->cs_version) 907 //if (VERSION_CS != ns->cs_version)
944 { 908 // unchecked;
945#ifdef ESRV_DEBUG 909
946 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
947#endif
948 }
949 cp = strchr (buf + 1, ' '); 910 char *cp = strchr (buf + 1, ' ');
950 if (!cp) 911 if (!cp)
951 return; 912 return;
913
952 ns->sc_version = atoi (cp); 914 ns->sc_version = atoi (cp);
915
953 if (VERSION_SC != ns->sc_version) 916 //if (VERSION_SC != ns->sc_version)
954 { 917 // unchecked;
955#ifdef ESRV_DEBUG 918
956 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
957#endif
958 }
959 cp = strchr (cp + 1, ' '); 919 cp = strchr (cp + 1, ' ');
920
960 if (cp) 921 if (cp)
961 { 922 {
962 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host);
963
964 assign (ns->version, cp + 1); 923 assign (ns->version, cp + 1);
965 924
966 if (ns->sc_version < 1026) 925 if (ns->sc_version < 1026)
967 { 926 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
968 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
969 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 927 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
970 ns->send_packet (version_warning);
971 }
972
973 } 928 }
974} 929}
975 930
976/** sound related functions. */ 931/** sound related functions. */
977void 932void
… …
983/** client wants the map resent */ 938/** client wants the map resent */
984 939
985void 940void
986MapRedrawCmd (char *buf, int len, player *pl) 941MapRedrawCmd (char *buf, int len, player *pl)
987{ 942{
988
989/* 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
990 * 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.
991 * Unfortunately this solution does not work because some client versions send 945 * Unfortunately this solution does not work because some client versions send
992 * a mapredraw command after receiving a newmap command. 946 * a mapredraw command after receiving a newmap command.
993 */ 947 */
994#if 0
995 /* Okay, this is MAJOR UGLY. but the only way I know how to
996 * clear the "cache"
997 */
998 memset (&pl->socket->lastmap, 0, sizeof (struct Map));
999 draw_client_map (pl->ob);
1000#endif
1001} 948}
1002 949
1003/** 950/**
1004 * Moves an object (typically, container to inventory). 951 * Moves an object (typically, container to inventory).
1005 * syntax is: move (to) (tag) (nrof) 952 * syntax is: move (to) (tag) (nrof)
… …
1008MoveCmd (char *buf, int len, player *pl) 955MoveCmd (char *buf, int len, player *pl)
1009{ 956{
1010 int vals[3], i; 957 int vals[3], i;
1011 958
1012 /* A little funky here. We only cycle for 2 records, because 959 /* A little funky here. We only cycle for 2 records, because
1013 * 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
1014 * record. Perhaps we should just replace this with a 961 * record. Perhaps we should just replace this with a
1015 * sscanf? 962 * sscanf?
1016 */ 963 */
1017 for (i = 0; i < 2; i++) 964 for (i = 0; i < 2; i++)
1018 { 965 {
1019 vals[i] = atoi (buf); 966 vals[i] = atoi (buf);
967
1020 if (!(buf = strchr (buf, ' '))) 968 if (!(buf = strchr (buf, ' ')))
1021 { 969 {
1022 LOG (llevError, "Incomplete move command: %s\n", buf); 970 LOG (llevError, "Incomplete move command: %s\n", buf);
1023 return; 971 return;
1024 } 972 }
973
1025 buf++; 974 buf++;
1026 } 975 }
976
1027 vals[2] = atoi (buf); 977 vals[2] = atoi (buf);
1028 978
1029/* 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]);*/
1030 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 980 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1031} 981}
1032
1033
1034 982
1035/****************************************************************************** 983/******************************************************************************
1036 * 984 *
1037 * Start of commands the server sends to the client. 985 * Start of commands the server sends to the client.
1038 * 986 *
… …
1041/** 989/**
1042 * 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
1043 * 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)
1044 */ 992 */
1045void 993void
1046send_query (client * ns, uint8 flags, char *text) 994send_query (client *ns, uint8 flags, char *text)
1047{ 995{
1048 char buf[MAX_BUF];
1049
1050 sprintf (buf, "query %d %s", flags, text ? text : ""); 996 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1051 ns->send_packet (buf);
1052} 997}
1053 998
1054#define AddIfInt64(Old,New,Type) if (Old != New) {\ 999#define AddIfInt64(Old,New,Type) if (Old != New) {\
1055 Old = New; \ 1000 Old = New; \
1056 sl << uint8 (Type) << uint64 (New); \ 1001 sl << uint8 (Type) << uint64 (New); \
… …
1089 uint16 flags; 1034 uint16 flags;
1090 1035
1091 packet sl; 1036 packet sl;
1092 sl << "stats "; 1037 sl << "stats ";
1093 1038
1094 if (pl->ob != NULL) 1039 if (pl->ob)
1095 { 1040 {
1096 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);
1097 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);
1098 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);
1099 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);
… …
1107 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);
1108 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);
1109 } 1054 }
1110 1055
1111 if (pl->socket->exp64) 1056 if (pl->socket->exp64)
1112 {
1113 uint8 s;
1114
1115 for (s = 0; s < NUM_SKILLS; s++) 1057 for (int s = 0; s < NUM_SKILLS; s++)
1116 {
1117 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)
1118 { 1059 {
1119 /* Always send along the level if exp changes. This is only 1060 /* Always send along the level if exp changes. This is only
1120 * 1 extra byte, but keeps processing simpler. 1061 * 1 extra byte, but keeps processing simpler.
1121 */ 1062 */
1122 sl << uint8 (s + CS_STAT_SKILLINFO) 1063 sl << uint8 (s + CS_STAT_SKILLINFO)
1123 << uint8 (pl->last_skill_ob[s]->level) 1064 << uint8 (pl->last_skill_ob[s]->level)
1124 << uint64 (pl->last_skill_ob[s]->stats.exp); 1065 << uint64 (pl->last_skill_ob[s]->stats.exp);
1125 1066
1126 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;
1127 } 1068 }
1128 }
1129 }
1130 1069
1131 if (pl->socket->exp64) 1070 if (pl->socket->exp64)
1132 { 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) }
1133 else 1072 else
1134 { 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) }
… …
1152 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1091 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1153 1092
1154 if (pl->socket->sc_version < 1025) 1093 if (pl->socket->sc_version < 1025)
1155 { 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) }
1156 else 1095 else
1157 {
1158 int i;
1159
1160 for (i = 0; i < NROFATTACKS; i++) 1096 for (int i = 0; i < NROFATTACKS; i++)
1161 { 1097 {
1162 /* Skip ones we won't send */ 1098 /* Skip ones we won't send */
1163 if (atnr_cs_stat[i] == -1) 1099 if (atnr_cs_stat[i] == -1)
1164 continue; 1100 continue;
1165 1101
1166 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]);
1167 } 1103 }
1168 }
1169 1104
1170 if (pl->socket->monitor_spells) 1105 if (pl->socket->monitor_spells)
1171 { 1106 {
1172 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);
1173 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);
… …
1212 * when the player logs in and picks stuff up. 1147 * when the player logs in and picks stuff up.
1213 */ 1148 */
1214void 1149void
1215esrv_send_animation (client * ns, short anim_num) 1150esrv_send_animation (client * ns, short anim_num)
1216{ 1151{
1217 int i;
1218
1219 /* 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
1220 * 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
1221 * range, it must be a valid animation. 1154 * range, it must be a valid animation.
1222 */ 1155 */
1223 if (anim_num < 0 || anim_num > num_animations) 1156 if (anim_num < 0 || anim_num > num_animations)
… …
1233 << uint16 (0); /* flags - not used right now */ 1166 << uint16 (0); /* flags - not used right now */
1234 1167
1235 /* 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
1236 * the face itself) down to the client. 1169 * the face itself) down to the client.
1237 */ 1170 */
1238 for (i = 0; i < animations[anim_num].num_animations; i++) 1171 for (int i = 0; i < animations[anim_num].num_animations; i++)
1239 { 1172 {
1240 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))
1241 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1174 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1175
1242 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 */
1243 } 1177 }
1244 1178
1245 ns->send_packet (sl); 1179 ns->send_packet (sl);
1246 1180
… …
1261static void 1195static void
1262esrv_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)
1263{ 1197{
1264 if (newmap->cells[x][y].count >= MAP_LAYERS) 1198 if (newmap->cells[x][y].count >= MAP_LAYERS)
1265 { 1199 {
1200 //TODO: one or the other, can't both have abort and return, verify and act
1266 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);
1267 return; 1202 return;
1268 abort (); 1203 abort ();
1269 } 1204 }
1270 1205
1271 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;
1272 newmap->cells[x][y].count++; 1207 newmap->cells[x][y].count++;
1273 1208
1274 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1209 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1275 esrv_send_face (ns, face_num, 0); 1210 esrv_send_face (ns, face_num, 0);
1276}
1277
1278struct LayerCell
1279{
1280 uint16 xy;
1281 short face;
1282};
1283
1284struct MapLayer
1285{
1286 int count;
1287 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1288};
1289
1290/** Checkes if map cells have changed */
1291static int
1292mapcellchanged (client * ns, int i, int j, struct Map *newmap)
1293{
1294 int k;
1295
1296 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1297 return 1;
1298 for (k = 0; k < newmap->cells[i][j].count; k++)
1299 {
1300 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1301 {
1302 return 1;
1303 }
1304 }
1305 return 0;
1306}
1307
1308/**
1309 * Basically, what this does is pack the data into layers.
1310 * cnum is the client number, cur is the the buffer we put all of
1311 * this data into. we return the end of the data. layers is
1312 * how many layers of data we should back.
1313 */
1314static uint8 *
1315compactlayer (client * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1316{
1317 int x, y, k;
1318 int face;
1319 unsigned char *fcur;
1320 struct MapLayer layers[MAP_LAYERS];
1321
1322 for (k = 0; k < MAP_LAYERS; k++)
1323 layers[k].count = 0;
1324 fcur = cur;
1325 for (x = 0; x < ns->mapx; x++)
1326 {
1327 for (y = 0; y < ns->mapy; y++)
1328 {
1329 if (!mapcellchanged (ns, x, y, newmap))
1330 continue;
1331 if (newmap->cells[x][y].count == 0)
1332 {
1333 *cur = x * ns->mapy + y; /* mark empty space */
1334 cur++;
1335 continue;
1336 }
1337 for (k = 0; k < newmap->cells[x][y].count; k++)
1338 {
1339 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1340 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1341 layers[k].count++;
1342 }
1343 }
1344 }
1345 /* If no data, return now. */
1346 if (fcur == cur && layers[0].count == 0)
1347 return cur;
1348 *cur = 255; /* mark end of explicitly cleared cells */
1349 cur++;
1350 /* First pack by layers. */
1351 for (k = 0; k < numlayers; k++)
1352 {
1353 if (layers[k].count == 0)
1354 break; /* once a layer is entirely empty, no layer below it can
1355 have anything in it either */
1356 /* Pack by entries in thie layer */
1357 for (x = 0; x < layers[k].count;)
1358 {
1359 fcur = cur;
1360 *cur = layers[k].lcells[x].face >> 8;
1361 cur++;
1362 *cur = layers[k].lcells[x].face & 0xFF;
1363 cur++;
1364 face = layers[k].lcells[x].face;
1365 /* Now, we back the redundant data into 1 byte xy pairings */
1366 for (y = x; y < layers[k].count; y++)
1367 {
1368 if (layers[k].lcells[y].face == face)
1369 {
1370 *cur = (uint8) layers[k].lcells[y].xy;
1371 cur++;
1372 layers[k].lcells[y].face = -1;
1373 }
1374 }
1375 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1376 /* forward over the now redundant data */
1377 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1378 x++;
1379 }
1380 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1381 }
1382 return cur;
1383} 1211}
1384 1212
1385/** Clears a map cell */ 1213/** Clears a map cell */
1386static void 1214static void
1387map_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)
… …
1399#define MAX_LAYERS 3 1227#define MAX_LAYERS 3
1400 1228
1401/* 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
1402 * 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,
1403 * 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
1404 * 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
1405 * re-examined. 1233 * re-examined.
1406 */ 1234 */
1407
1408static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1235static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1409 1236
1410/** 1237/**
1411 * Returns true if any of the heads for this 1238 * Returns true if any of the heads for this
1412 * 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
1413 * for empty space checking. 1240 * for empty space checking.
1414 */ 1241 */
1415static inline int 1242static inline int
1416have_head (int ax, int ay) 1243have_head (int ax, int ay)
1417{ 1244{
1418
1419 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1245 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1420 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])
1421 return 1; 1247 return 1;
1248
1422 return 0; 1249 return 0;
1423} 1250}
1424 1251
1425/** 1252/**
1426 * check_head is a bit simplistic version of update_space below. 1253 * check_head is a bit simplistic version of update_space below.
1427 * 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
1428 * 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
1429 * 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
1430 * sent, it returns zero. 1257 * sent, it returns zero.
1431 */ 1258 */
1432static int 1259static int
1433check_head (packet &sl, client &ns, int ax, int ay, int layer) 1260check_head (packet &sl, client &ns, int ax, int ay, int layer)
1434{ 1261{
… …
1470 * numbers the spaces differently - I think this was a leftover from 1297 * numbers the spaces differently - I think this was a leftover from
1471 * 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
1472 * 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
1473 * actually match. 1300 * actually match.
1474 */ 1301 */
1475
1476static int 1302static int
1477update_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)
1478{ 1304{
1479 object *ob, *head; 1305 object *ob, *head;
1480 uint16 face_num; 1306 uint16 face_num;
… …
1748 if (ns->ext_mapinfos) 1574 if (ns->ext_mapinfos)
1749 { 1575 {
1750 if (ns->EMI_smooth) 1576 if (ns->EMI_smooth)
1751 result += 1; /*One byte for smoothlevel */ 1577 result += 1; /*One byte for smoothlevel */
1752 } 1578 }
1579
1753 return result; 1580 return result;
1754} 1581}
1755 1582
1756/** 1583/**
1757 * 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
… …
2194 { 2021 {
2195 ax = i; 2022 ax = i;
2196 ay = j; 2023 ay = j;
2197 m = pm; 2024 m = pm;
2198 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2025 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2026
2199 if (mflags & P_OUT_OF_MAP) 2027 if (mflags & P_OUT_OF_MAP)
2200 continue; 2028 continue;
2029
2201 if (mflags & P_NEED_UPDATE) 2030 if (mflags & P_NEED_UPDATE)
2202 update_position (m, ax, ay); 2031 update_position (m, ax, ay);
2032
2203 /* 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
2204 * just to reload it. This should really call something like 2034 * just to reload it. This should really call something like
2205 * swap_map, but this is much more efficient and 'good enough' 2035 * swap_map, but this is much more efficient and 'good enough'
2206 */ 2036 */
2207 if (mflags & P_NEW_MAP) 2037 if (mflags & P_NEW_MAP)
… …
2410 2240
2411 if (!pl->socket->monitor_spells) 2241 if (!pl->socket->monitor_spells)
2412 return; 2242 return;
2413 2243
2414 packet sl; 2244 packet sl;
2415
2416 sl << "addspell "; 2245 sl << "addspell ";
2417 2246
2418 if (!spell) 2247 if (!spell)
2419 { 2248 {
2420 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