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