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.50 by root, Thu Dec 21 23:37:06 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
… …
141} 138}
142 139
143static void 140static void
144clear_map (player *pl) 141clear_map (player *pl)
145{ 142{
146 client &socket = *pl->socket;
147
148 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 143 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
149 144
150 if (socket.newmapcmd == 1) 145 if (pl->ns->newmapcmd == 1)
151 socket.send_packet ("newmap"); 146 pl->ns->send_packet ("newmap");
152 147
153 socket.update_look = 1; 148 pl->ns->floorbox_reset ();
154 socket.look_position = 0;
155} 149}
156 150
157/** check for map change and send new map data */ 151/** check for map change and send new map data */
158static void 152static void
159check_map_change (player *pl) 153check_map_change (player *pl)
160{ 154{
161 client &socket = *pl->socket; 155 client &socket = *pl->ns;
162 object *ob = pl->ob; 156 object *ob = pl->ob;
163 char buf[MAX_BUF]; /* eauugggh */ 157 char buf[MAX_BUF]; /* eauugggh */
164 158
165 if (socket.current_map != ob->map) 159 if (socket.current_map != ob->map)
166 { 160 {
… …
200 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 194 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
201 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows 195 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
202 else 196 else
203 { 197 {
204 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); 198 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
205 socket.update_look = 1; 199 socket.floorbox_reset ();
206 socket.look_position = 0;
207 } 200 }
208 } 201 }
209 202
210 socket.current_x = ob->x; 203 socket.current_x = ob->x;
211 socket.current_y = ob->y; 204 socket.current_y = ob->y;
… …
260{ 253{
261 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 254 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
262} 255}
263 256
264void 257void
258ExtiCmd (char *buf, int len, client *ns)
259{
260 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
261}
262
263void
265MapInfoCmd (char *buf, int len, player *pl) 264MapInfoCmd (char *buf, int len, player *pl)
266{ 265{
267 // <mapinfo tag spatial tile-path 266 // <mapinfo tag spatial tile-path
268 // >mapinfo tag spatial flags x y w h hash 267 // >mapinfo tag spatial flags x y w h hash
269 268
… …
281 buf += 8; 280 buf += 8;
282 281
283 // initial map and its origin 282 // initial map and its origin
284 maptile *map = pl->ob->map; 283 maptile *map = pl->ob->map;
285 sint16 dx, dy; 284 sint16 dx, dy;
286 int mapx = pl->socket->mapx / 2 - pl->ob->x; 285 int mapx = pl->ns->mapx / 2 - pl->ob->x;
287 int mapy = pl->socket->mapy / 2 - pl->ob->y; 286 int mapy = pl->ns->mapy / 2 - pl->ob->y;
288 int max_distance = 8; // limit maximum path length to something generous 287 int max_distance = 8; // limit maximum path length to something generous
289 288
290 while (*buf && map && max_distance) 289 while (*buf && map && max_distance)
291 { 290 {
292 int dir = *buf++; 291 int dir = *buf++;
… …
343 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 342 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
344 } 343 }
345 else 344 else
346 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 345 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
347 346
348 pl->socket->send_packet (bigbuf); 347 pl->ns->send_packet (bigbuf);
349} 348}
350 349
351/** This is the Setup cmd - easy first implementation */ 350/** This is the Setup cmd - easy first implementation */
352void 351void
353SetUp (char *buf, int len, client * ns) 352SetUp (char *buf, int len, client * ns)
… …
570 * it either has to be here or init_sockets needs to be exported. 569 * it either has to be here or init_sockets needs to be exported.
571 */ 570 */
572void 571void
573AddMeCmd (char *buf, int len, client * ns) 572AddMeCmd (char *buf, int len, client * ns)
574{ 573{
574 if (INVOKE_CLIENT (ADDME, ns))
575 return;
576
575 if (ns->status != Ns_Add || add_player (ns)) 577 if (ns->pl || add_player (ns))
576 ns->send_packet ("addme_failed"); 578 ns->send_packet ("addme_failed");
577 else 579 else
578 ns->send_packet ("addme_success"); 580 ns->send_packet ("addme_success");
579} 581}
580 582
… …
700 * a piece of data from us that we know the client wants. So 702 * 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 703 * if we know the client wants it, might as well push it to the
702 * client. 704 * client.
703 */ 705 */
704static void 706static void
705SendSmooth (client * ns, uint16 face) 707SendSmooth (client *ns, uint16 face)
706{ 708{
707 uint16 smoothface; 709 uint16 smoothface;
708 710
709 /* If we can't find a face, return and set it so we won't try to send this 711 /* If we can't find a face, return and set it so we won't try to send this
710 * again. 712 * again.
… …
720 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) 722 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
721 esrv_send_face (ns, smoothface, 0); 723 esrv_send_face (ns, smoothface, 0);
722 724
723 ns->faces_sent[face] |= NS_FACESENT_SMOOTH; 725 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
724 726
725 packet sl; 727 packet sl ("smooth");
726 728
727 sl << "smooth "
728 << uint16 (face) 729 sl << uint16 (face)
729 << uint16 (smoothface); 730 << uint16 (smoothface);
730 731
731 ns->send_packet (sl); 732 ns->send_packet (sl);
732} 733}
733 734
734 /** 735 /**
735 * Tells client the picture it has to use 736 * Tells client the picture it has to use
736 * to smooth a picture number given as argument. 737 * to smooth a picture number given as argument.
737 */ 738 */
738void 739void
739AskSmooth (char *buf, int len, client * ns) 740AskSmooth (char *buf, int len, client *ns)
740{ 741{
741 uint16 facenbr; 742 SendSmooth (ns, atoi (buf));
742
743 facenbr = atoi (buf);
744 SendSmooth (ns, facenbr);
745} 743}
746 744
747/** 745/**
748 * This handles the general commands from the client (ie, north, fire, cast, 746 * This handles the general commands from the client (ie, north, fire, cast,
749 * etc.) 747 * etc.)
750 */ 748 */
751void 749void
752PlayerCmd (char *buf, int len, player *pl) 750PlayerCmd (char *buf, int len, player *pl)
753{ 751{
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 752 /* Check if there is a count. In theory, a zero count could also be
766 * sent, so check for that also. 753 * sent, so check for that also.
767 */ 754 */
768 if (atoi (buf) || buf[0] == '0') 755 if (atoi (buf) || buf[0] == '0')
769 { 756 {
770 pl->count = atoi ((char *) buf); 757 pl->count = atoi ((char *) buf);
758
771 buf = strchr (buf, ' '); /* advance beyond the numbers */ 759 buf = strchr (buf, ' '); /* advance beyond the numbers */
772 if (!buf) 760 if (!buf)
773 {
774#ifdef ESRV_DEBUG
775 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
776#endif
777 return; 761 return;
778 } 762
779 buf++; 763 buf++;
780 } 764 }
781 /* This should not happen anymore. */ 765
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); 766 execute_newserver_command (pl->ob, (char *) buf);
767
788 /* Perhaps something better should be done with a left over count. 768 /* Perhaps something better should be done with a left over count.
789 * Cleaning up the input should probably be done first - all actions 769 * 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 770 * for the command that issued the count should be done before any other
791 * commands. 771 * commands.
792 */ 772 */
793
794 pl->count = 0; 773 pl->count = 0;
795
796} 774}
797 775
798 776
799/** 777/**
800 * This handles the general commands from the client (ie, north, fire, cast, 778 * This handles the general commands from the client (ie, north, fire, cast,
… …
803 * can throttle. 781 * can throttle.
804 */ 782 */
805void 783void
806NewPlayerCmd (char *buf, int len, player *pl) 784NewPlayerCmd (char *buf, int len, player *pl)
807{ 785{
808 int time, repeat;
809 char command[MAX_BUF];
810 int pktlen;
811
812 if (len < 7) 786 if (len <= 6)
813 { 787 {
814 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 788 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
815 return; 789 return;
816 } 790 }
817 791
818 pktlen = net_uint16 ((uint8 *)buf); 792 uint16 cmdid = net_uint16 ((uint8 *)buf);
819 repeat = net_uint32 ((uint8 *)buf + 2); 793 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
820 794
821 /* -1 is special - no repeat, but don't update */ 795 /* -1 is special - no repeat, but don't update */
822 if (repeat != -1) 796 if (repeat != -1)
823 pl->count = repeat; 797 pl->count = repeat;
824 798
825 if ((len - 4) >= MAX_BUF) 799 buf += 6; //len -= 6;
826 len = MAX_BUF - 5;
827 800
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); 801 execute_newserver_command (pl->ob, buf);
802
837 /* Perhaps something better should be done with a left over count. 803 /* Perhaps something better should be done with a left over count.
838 * Cleaning up the input should probably be done first - all actions 804 * 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 805 * for the command that issued the count should be done before any other
840 * commands. 806 * commands.
841 */ 807 */
842 pl->count = 0; 808 pl->count = 0;
843 809
810 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
844 if (FABS (pl->ob->speed) < 0.001) 811 int time = FABS (pl->ob->speed) < 0.001
845 time = MAX_TIME * 100; 812 ? time = MAX_TIME * 100
846 else
847 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 813 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
848 814
849 /* Send confirmation of command execution now */ 815 /* Send confirmation of command execution now */
850 816 packet sl ("comc");
851 packet sl;
852 sl << "comc " << uint16 (pktlen) << uint32 (time); 817 sl << uint16 (cmdid) << uint32 (time);
853 pl->socket->send_packet (sl); 818 pl->ns->send_packet (sl);
854} 819}
855
856 820
857/** This is a reply to a previous query. */ 821/** This is a reply to a previous query. */
858void 822void
859ReplyCmd (char *buf, int len, player *pl) 823ReplyCmd (char *buf, int len, client *ns)
860{ 824{
825 if (ns->state == ST_CUSTOM)
826 {
827 INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len));
828 return;
829 }
830
831 if (!ns->pl)
832 return; //TODO: depends on the exact reply we are after
833 //TODO: but right now, we always have a ns->pl
834
835 player *pl = ns->pl;
836
861 /* This is to synthesize how the data would be stored if it 837 /* 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 838 * was normally entered. A bit of a hack, and should be cleaned up
863 * once all the X11 code is removed from the server. 839 * once all the X11 code is removed from the server.
864 * 840 *
865 * We pass 13 to many of the functions because this way they 841 * We pass 13 to many of the functions because this way they
866 * think it was the carriage return that was entered, and the 842 * think it was the carriage return that was entered, and the
867 * function then does not try to do additional input. 843 * function then does not try to do additional input.
868 */ 844 */
869 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); 845 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
870 846
871 /* this avoids any hacking here */ 847 /* this avoids any hacking here */
872 848
873 switch (pl->state) 849 switch (ns->state)
874 { 850 {
875 case ST_PLAYING: 851 case ST_PLAYING:
876 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 852 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
877 break; 853 break;
878 854
879 case ST_PLAY_AGAIN: 855 case ST_PLAY_AGAIN:
880 /* We can check this for return value (2==quit). Maybe we 856 /* We can check this for return value (2==quit). Maybe we
881 * should, and do something appropriate? 857 * should, and do something appropriate?
882 */ 858 */
883 receive_play_again (pl->ob, buf[0]); 859 receive_play_again (pl->ob, buf[0]);
884 break; 860 break;
885 861
886 case ST_ROLL_STAT: 862 case ST_ROLL_STAT:
887 key_roll_stat (pl->ob, buf[0]); 863 key_roll_stat (pl->ob, buf[0]);
888 break; 864 break;
889 865
890 case ST_CHANGE_CLASS: 866 case ST_CHANGE_CLASS:
891
892 key_change_class (pl->ob, buf[0]); 867 key_change_class (pl->ob, buf[0]);
893 break; 868 break;
894 869
895 case ST_CONFIRM_QUIT: 870 case ST_CONFIRM_QUIT:
896 key_confirm_quit (pl->ob, buf[0]); 871 key_confirm_quit (pl->ob, buf[0]);
897 break; 872 break;
898 873
899 case ST_CONFIGURE: 874 case ST_CONFIGURE:
900 LOG (llevError, "In client input handling, but into configure state\n"); 875 LOG (llevError, "In client input handling, but into configure state\n");
901 pl->state = ST_PLAYING; 876 ns->state = ST_PLAYING;
902 break; 877 break;
903 878
904 case ST_GET_NAME: 879 case ST_GET_NAME:
905 receive_player_name (pl->ob, 13); 880 receive_player_name (pl->ob, 13);
906 break; 881 break;
907 882
908 case ST_GET_PASSWORD: 883 case ST_GET_PASSWORD:
909 case ST_CONFIRM_PASSWORD: 884 case ST_CONFIRM_PASSWORD:
910 receive_player_password (pl->ob, 13); 885 receive_player_password (pl->ob, 13);
911 break; 886 break;
912 887
913 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 888 case ST_GET_PARTY_PASSWORD: /* Get password for party */
914 receive_party_password (pl->ob, 13); 889 receive_party_password (pl->ob, 13);
915 break; 890 break;
916 891
917 default: 892 default:
918 LOG (llevError, "Unknown input state: %d\n", pl->state); 893 LOG (llevError, "Unknown input state: %d\n", ns->state);
919 } 894 }
920} 895}
921 896
922/** 897/**
923 * Client tells its version. If there is a mismatch, we close the 898 * Client tells its version. If there is a mismatch, we close the
… …
927 * problem. 902 * problem.
928 */ 903 */
929void 904void
930VersionCmd (char *buf, int len, client * ns) 905VersionCmd (char *buf, int len, client * ns)
931{ 906{
932 char *cp;
933 char version_warning[256];
934
935 if (!buf) 907 if (!buf)
936 { 908 {
937 LOG (llevError, "CS: received corrupted version command\n"); 909 LOG (llevError, "CS: received corrupted version command\n");
938 return; 910 return;
939 } 911 }
940 912
941 ns->cs_version = atoi (buf); 913 ns->cs_version = atoi (buf);
942 ns->sc_version = ns->cs_version; 914 ns->sc_version = ns->cs_version;
915
916 LOG (llevDebug, "connection from client <%s>\n", buf);
917
918
919 //TODO: should log here just for statistics
920
943 if (VERSION_CS != ns->cs_version) 921 //if (VERSION_CS != ns->cs_version)
944 { 922 // unchecked;
945#ifdef ESRV_DEBUG 923
946 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
947#endif
948 }
949 cp = strchr (buf + 1, ' '); 924 char *cp = strchr (buf + 1, ' ');
950 if (!cp) 925 if (!cp)
951 return; 926 return;
927
952 ns->sc_version = atoi (cp); 928 ns->sc_version = atoi (cp);
929
953 if (VERSION_SC != ns->sc_version) 930 //if (VERSION_SC != ns->sc_version)
954 { 931 // unchecked;
955#ifdef ESRV_DEBUG 932
956 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
957#endif
958 }
959 cp = strchr (cp + 1, ' '); 933 cp = strchr (cp + 1, ' ');
934
960 if (cp) 935 if (cp)
961 { 936 {
962 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host);
963
964 assign (ns->version, cp + 1); 937 assign (ns->version, cp + 1);
965 938
966 if (ns->sc_version < 1026) 939 if (ns->sc_version < 1026)
967 { 940 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!! ****"); 941 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
970 ns->send_packet (version_warning);
971 }
972
973 } 942 }
974} 943}
975 944
976/** sound related functions. */ 945/** sound related functions. */
977void 946void
… …
983/** client wants the map resent */ 952/** client wants the map resent */
984 953
985void 954void
986MapRedrawCmd (char *buf, int len, player *pl) 955MapRedrawCmd (char *buf, int len, player *pl)
987{ 956{
988
989/* This function is currently disabled; just clearing the map state results in 957/* 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. 958 * display errors. It should clear the cache and send a newmap command.
991 * Unfortunately this solution does not work because some client versions send 959 * Unfortunately this solution does not work because some client versions send
992 * a mapredraw command after receiving a newmap command. 960 * a mapredraw command after receiving a newmap command.
993 */ 961 */
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} 962}
1002 963
1003/** 964/**
1004 * Moves an object (typically, container to inventory). 965 * Moves an object (typically, container to inventory).
1005 * syntax is: move (to) (tag) (nrof) 966 * syntax is: move (to) (tag) (nrof)
… …
1008MoveCmd (char *buf, int len, player *pl) 969MoveCmd (char *buf, int len, player *pl)
1009{ 970{
1010 int vals[3], i; 971 int vals[3], i;
1011 972
1012 /* A little funky here. We only cycle for 2 records, because 973 /* A little funky here. We only cycle for 2 records, because
1013 * we obviously am not going to find a space after the third 974 * we obviously are not going to find a space after the third
1014 * record. Perhaps we should just replace this with a 975 * record. Perhaps we should just replace this with a
1015 * sscanf? 976 * sscanf?
1016 */ 977 */
1017 for (i = 0; i < 2; i++) 978 for (i = 0; i < 2; i++)
1018 { 979 {
1019 vals[i] = atoi (buf); 980 vals[i] = atoi (buf);
981
1020 if (!(buf = strchr (buf, ' '))) 982 if (!(buf = strchr (buf, ' ')))
1021 { 983 {
1022 LOG (llevError, "Incomplete move command: %s\n", buf); 984 LOG (llevError, "Incomplete move command: %s\n", buf);
1023 return; 985 return;
1024 } 986 }
987
1025 buf++; 988 buf++;
1026 } 989 }
990
1027 vals[2] = atoi (buf); 991 vals[2] = atoi (buf);
1028 992
1029/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 993/* 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]); 994 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1031} 995}
1032
1033
1034 996
1035/****************************************************************************** 997/******************************************************************************
1036 * 998 *
1037 * Start of commands the server sends to the client. 999 * Start of commands the server sends to the client.
1038 * 1000 *
… …
1041/** 1003/**
1042 * Asks the client to query the user. This way, the client knows 1004 * 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) 1005 * it needs to send something back (vs just printing out a message)
1044 */ 1006 */
1045void 1007void
1046send_query (client * ns, uint8 flags, char *text) 1008send_query (client *ns, uint8 flags, char *text)
1047{ 1009{
1048 char buf[MAX_BUF];
1049
1050 sprintf (buf, "query %d %s", flags, text ? text : ""); 1010 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1051 ns->send_packet (buf);
1052} 1011}
1053 1012
1054#define AddIfInt64(Old,New,Type) if (Old != New) {\ 1013#define AddIfInt64(Old,New,Type) if (Old != New) {\
1055 Old = New; \ 1014 Old = New; \
1056 sl << uint8 (Type) << uint64 (New); \ 1015 sl << uint8 (Type) << uint64 (New); \
… …
1086esrv_update_stats (player *pl) 1045esrv_update_stats (player *pl)
1087{ 1046{
1088 char buf[MAX_BUF]; 1047 char buf[MAX_BUF];
1089 uint16 flags; 1048 uint16 flags;
1090 1049
1091 packet sl; 1050 packet sl ("stats");
1092 sl << "stats ";
1093 1051
1094 if (pl->ob != NULL) 1052 if (pl->ob)
1095 { 1053 {
1096 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1054 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); 1055 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); 1056 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); 1057 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
… …
1106 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 1064 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX);
1107 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1065 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); 1066 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1109 } 1067 }
1110 1068
1111 if (pl->socket->exp64) 1069 if (pl->ns->exp64)
1112 {
1113 uint8 s;
1114
1115 for (s = 0; s < NUM_SKILLS; s++) 1070 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) 1071 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1118 { 1072 {
1119 /* Always send along the level if exp changes. This is only 1073 /* Always send along the level if exp changes. This is only
1120 * 1 extra byte, but keeps processing simpler. 1074 * 1 extra byte, but keeps processing simpler.
1121 */ 1075 */
1122 sl << uint8 (s + CS_STAT_SKILLINFO) 1076 sl << uint8 (s + CS_STAT_SKILLINFO)
1123 << uint8 (pl->last_skill_ob[s]->level) 1077 << uint8 (pl->last_skill_ob[s]->level)
1124 << uint64 (pl->last_skill_ob[s]->stats.exp); 1078 << uint64 (pl->last_skill_ob[s]->stats.exp);
1125 1079
1126 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; 1080 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1127 } 1081 }
1128 }
1129 }
1130 1082
1131 if (pl->socket->exp64) 1083 if (pl->ns->exp64)
1132 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1084 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }
1133 else 1085 else
1134 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } 1086 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1135 1087
1136 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1088 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);
… …
1149 if (pl->run_on) 1101 if (pl->run_on)
1150 flags |= SF_RUNON; 1102 flags |= SF_RUNON;
1151 1103
1152 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1104 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1153 1105
1154 if (pl->socket->sc_version < 1025) 1106 if (pl->ns->sc_version < 1025)
1155 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1107 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1156 else 1108 else
1157 {
1158 int i;
1159
1160 for (i = 0; i < NROFATTACKS; i++) 1109 for (int i = 0; i < NROFATTACKS; i++)
1161 { 1110 {
1162 /* Skip ones we won't send */ 1111 /* Skip ones we won't send */
1163 if (atnr_cs_stat[i] == -1) 1112 if (atnr_cs_stat[i] == -1)
1164 continue; 1113 continue;
1165 1114
1166 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1115 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1167 } 1116 }
1168 }
1169 1117
1170 if (pl->socket->monitor_spells) 1118 if (pl->ns->monitor_spells)
1171 { 1119 {
1172 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1120 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); 1121 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
1174 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 1122 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY);
1175 } 1123 }
1176 1124
1177 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 1125 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */
1178 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE); 1126 AddIfString (pl->ns->stats.range, buf, CS_STAT_RANGE);
1179 set_title (pl->ob, buf); 1127 set_title (pl->ob, buf);
1180 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE); 1128 AddIfString (pl->ns->stats.title, buf, CS_STAT_TITLE);
1181 1129
1182 /* Only send it away if we have some actual data */ 1130 /* Only send it away if we have some actual data */
1183 if (sl.length () > 6) 1131 if (sl.length () > 6)
1184 pl->socket->send_packet (sl); 1132 pl->ns->send_packet (sl);
1185} 1133}
1186 1134
1187/** 1135/**
1188 * Tells the client that here is a player it should start using. 1136 * Tells the client that here is a player it should start using.
1189 */ 1137 */
1190void 1138void
1191esrv_new_player (player *pl, uint32 weight) 1139esrv_new_player (player *pl, uint32 weight)
1192{ 1140{
1193 pl->last_weight = weight; 1141 pl->last_weight = weight;
1194 1142
1195 packet sl; 1143 packet sl ("player");
1196 sl << "player ";
1197 1144
1198 sl << uint32 (pl->ob->count) 1145 sl << uint32 (pl->ob->count)
1199 << uint32 (weight) 1146 << uint32 (weight)
1200 << uint32 (pl->ob->face->number) 1147 << uint32 (pl->ob->face->number)
1201 << data8 (pl->ob->name); 1148 << data8 (pl->ob->name);
1202 1149
1203 pl->socket->send_packet (sl); 1150 pl->ns->send_packet (sl);
1204 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1151 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1205} 1152}
1206 1153
1207/** 1154/**
1208 * Need to send an animation sequence to the client. 1155 * Need to send an animation sequence to the client.
… …
1212 * when the player logs in and picks stuff up. 1159 * when the player logs in and picks stuff up.
1213 */ 1160 */
1214void 1161void
1215esrv_send_animation (client * ns, short anim_num) 1162esrv_send_animation (client * ns, short anim_num)
1216{ 1163{
1217 int i;
1218
1219 /* Do some checking on the anim_num we got. Note that the animations 1164 /* 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 1165 * are added in contigous order, so if the number is in the valid
1221 * range, it must be a valid animation. 1166 * range, it must be a valid animation.
1222 */ 1167 */
1223 if (anim_num < 0 || anim_num > num_animations) 1168 if (anim_num < 0 || anim_num > num_animations)
1224 { 1169 {
1225 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); 1170 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1226 return; 1171 return;
1227 } 1172 }
1228 1173
1229 packet sl; 1174 packet sl ("anim");
1230 1175
1231 sl << "anim "
1232 << uint16 (anim_num) 1176 sl << uint16 (anim_num)
1233 << uint16 (0); /* flags - not used right now */ 1177 << uint16 (0); /* flags - not used right now */
1234 1178
1235 /* Build up the list of faces. Also, send any information (ie, the 1179 /* Build up the list of faces. Also, send any information (ie, the
1236 * the face itself) down to the client. 1180 * the face itself) down to the client.
1237 */ 1181 */
1238 for (i = 0; i < animations[anim_num].num_animations; i++) 1182 for (int i = 0; i < animations[anim_num].num_animations; i++)
1239 { 1183 {
1240 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1184 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1241 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1185 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1186
1242 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 1187 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1243 } 1188 }
1244 1189
1245 ns->send_packet (sl); 1190 ns->send_packet (sl);
1246 1191
… …
1261static void 1206static void
1262esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap) 1207esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1263{ 1208{
1264 if (newmap->cells[x][y].count >= MAP_LAYERS) 1209 if (newmap->cells[x][y].count >= MAP_LAYERS)
1265 { 1210 {
1211 //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); 1212 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1267 return; 1213 return;
1268 abort (); 1214 abort ();
1269 } 1215 }
1270 1216
1271 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; 1217 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1272 newmap->cells[x][y].count++; 1218 newmap->cells[x][y].count++;
1273 1219
1274 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1220 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1275 esrv_send_face (ns, face_num, 0); 1221 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} 1222}
1384 1223
1385/** Clears a map cell */ 1224/** Clears a map cell */
1386static void 1225static void
1387map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1226map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
… …
1399#define MAX_LAYERS 3 1238#define MAX_LAYERS 3
1400 1239
1401/* Using a global really isn't a good approach, but saves the over head of 1240/* 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, 1241 * 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 1242 * 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 1243 * need it for this cycle. If the server is ever threaded, this needs to be
1405 * re-examined. 1244 * re-examined.
1406 */ 1245 */
1407
1408static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1246static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1409 1247
1410/** 1248/**
1411 * Returns true if any of the heads for this 1249 * Returns true if any of the heads for this
1412 * space is set. Returns false if all are blank - this is used 1250 * space is set. Returns false if all are blank - this is used
1413 * for empty space checking. 1251 * for empty space checking.
1414 */ 1252 */
1415static inline int 1253static inline int
1416have_head (int ax, int ay) 1254have_head (int ax, int ay)
1417{ 1255{
1418
1419 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1256 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]) 1257 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1421 return 1; 1258 return 1;
1259
1422 return 0; 1260 return 0;
1423} 1261}
1424 1262
1425/** 1263/**
1426 * check_head is a bit simplistic version of update_space below. 1264 * 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 1265 * 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 1266 * 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 1267 * if needed, and returning 1. If this no data needs to get
1430 * sent, it returns zero. 1268 * sent, it returns zero.
1431 */ 1269 */
1432static int 1270static int
1433check_head (packet &sl, client &ns, int ax, int ay, int layer) 1271check_head (packet &sl, client &ns, int ax, int ay, int layer)
1434{ 1272{
… …
1470 * numbers the spaces differently - I think this was a leftover from 1308 * 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 1309 * 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 1310 * the case, it seems to make more sense to have these layer values
1473 * actually match. 1311 * actually match.
1474 */ 1312 */
1475
1476static int 1313static int
1477update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1314update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1478{ 1315{
1479 object *ob, *head; 1316 object *ob, *head;
1480 uint16 face_num; 1317 uint16 face_num;
… …
1748 if (ns->ext_mapinfos) 1585 if (ns->ext_mapinfos)
1749 { 1586 {
1750 if (ns->EMI_smooth) 1587 if (ns->EMI_smooth)
1751 result += 1; /*One byte for smoothlevel */ 1588 result += 1; /*One byte for smoothlevel */
1752 } 1589 }
1590
1753 return result; 1591 return result;
1754} 1592}
1755 1593
1756/** 1594/**
1757 * This function uses the new map1 protocol command to send the map 1595 * This function uses the new map1 protocol command to send the map
… …
1764 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off 1602 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1765 * maps no sense. Instead, we actually really only use 12 bits for coordinates, 1603 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1766 * and use the other 4 bits for other informatiion. For full documentation 1604 * and use the other 4 bits for other informatiion. For full documentation
1767 * of what we send, see the doc/Protocol file. 1605 * of what we send, see the doc/Protocol file.
1768 * I will describe internally what we do: 1606 * I will describe internally what we do:
1769 * the socket->lastmap shows how the map last looked when sent to the client. 1607 * the ns->lastmap shows how the map last looked when sent to the client.
1770 * in the lastmap structure, there is a cells array, which is set to the 1608 * in the lastmap structure, there is a cells array, which is set to the
1771 * maximum viewable size (As set in config.h). 1609 * maximum viewable size (As set in config.h).
1772 * in the cells, there are faces and a count value. 1610 * in the cells, there are faces and a count value.
1773 * we use the count value to hold the darkness value. If -1, then this space 1611 * we use the count value to hold the darkness value. If -1, then this space
1774 * is not viewable. 1612 * is not viewable.
… …
1785 uint8 eentrysize; 1623 uint8 eentrysize;
1786 uint16 ewhatstart, ewhatflag; 1624 uint16 ewhatstart, ewhatflag;
1787 uint8 extendedinfos; 1625 uint8 extendedinfos;
1788 maptile *m; 1626 maptile *m;
1789 1627
1790 client &socket = *pl->contr->socket; 1628 client &socket = *pl->contr->ns;
1791 1629
1792 check_map_change (pl->contr); 1630 check_map_change (pl->contr);
1793 1631
1794 packet sl; 1632 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1795 packet esl; 1633 packet esl;
1796 1634
1797 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1798 startlen = sl.length (); 1635 startlen = sl.length ();
1799 1636
1800 /*Extendedmapinfo structure initialisation */ 1637 /*Extendedmapinfo structure initialisation */
1801 if (socket.ext_mapinfos) 1638 if (socket.ext_mapinfos)
1802 { 1639 {
… …
1846 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) 1683 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1847 { 1684 {
1848 ax = 0; 1685 ax = 0;
1849 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1686 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1850 { 1687 {
1851
1852 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1688 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1853 1689
1854 /* If this space is out of the normal viewable area, we only check 1690 /* If this space is out of the normal viewable area, we only check
1855 * the heads value ax or ay will only be greater than what 1691 * the heads value ax or ay will only be greater than what
1856 * the client wants if using the map1a command - this is because 1692 * the client wants if using the map1a command - this is because
… …
2186 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 2022 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2187 return; 2023 return;
2188 2024
2189 memset (&newmap, 0, sizeof (struct Map)); 2025 memset (&newmap, 0, sizeof (struct Map));
2190 2026
2191 for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++) 2027 for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)
2192 {
2193 for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++) 2028 for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)
2194 { 2029 {
2195 ax = i; 2030 ax = i;
2196 ay = j; 2031 ay = j;
2197 m = pm; 2032 m = pm;
2198 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2033 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2034
2199 if (mflags & P_OUT_OF_MAP) 2035 if (mflags & P_OUT_OF_MAP)
2200 continue; 2036 continue;
2201 if (mflags & P_NEED_UPDATE) 2037
2202 update_position (m, ax, ay);
2203 /* If a map is visible to the player, we don't want to swap it out 2038 /* 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 2039 * just to reload it. This should really call something like
2205 * swap_map, but this is much more efficient and 'good enough' 2040 * swap_map, but this is much more efficient and 'good enough'
2206 */ 2041 */
2207 if (mflags & P_NEW_MAP) 2042 if (mflags & P_NEW_MAP)
2208 m->timeout = 50; 2043 m->timeout = 50;
2209 } 2044 }
2210 } 2045
2211 /* do LOS after calls to update_position */ 2046 /* do LOS after calls to update_position */
2212 if (pl->contr->do_los) 2047 if (pl->contr->do_los)
2213 { 2048 {
2214 update_los (pl); 2049 update_los (pl);
2215 pl->contr->do_los = 0; 2050 pl->contr->do_los = 0;
… …
2230 2065
2231/*****************************************************************************/ 2066/*****************************************************************************/
2232void 2067void
2233send_plugin_custom_message (object *pl, char *buf) 2068send_plugin_custom_message (object *pl, char *buf)
2234{ 2069{
2235 pl->contr->socket->send_packet (buf); 2070 pl->contr->ns->send_packet (buf);
2236} 2071}
2237 2072
2238/** 2073/**
2239 * This sends the skill number to name mapping. We ignore 2074 * This sends the skill number to name mapping. We ignore
2240 * the params - we always send the same info no matter what. 2075 * the params - we always send the same info no matter what.
… …
2285 * it then sends an updspell packet for each spell that has changed in this way 2120 * it then sends an updspell packet for each spell that has changed in this way
2286 */ 2121 */
2287void 2122void
2288esrv_update_spells (player *pl) 2123esrv_update_spells (player *pl)
2289{ 2124{
2290 if (!pl->socket->monitor_spells) 2125 if (!pl->ns->monitor_spells)
2291 return; 2126 return;
2292 2127
2293 for (object *spell = pl->ob->inv; spell; spell = spell->below) 2128 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2294 { 2129 {
2295 if (spell->type == SPELL) 2130 if (spell->type == SPELL)
… …
2325 2160
2326 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 2161 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2327 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 2162 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2328 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 2163 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2329 2164
2330 pl->socket->send_packet (sl); 2165 pl->ns->send_packet (sl);
2331 } 2166 }
2332 } 2167 }
2333 } 2168 }
2334} 2169}
2335 2170
2336void 2171void
2337esrv_remove_spell (player *pl, object *spell) 2172esrv_remove_spell (player *pl, object *spell)
2338{ 2173{
2339 if (!pl->socket->monitor_spells) 2174 if (!pl->ns->monitor_spells)
2340 return; 2175 return;
2341 2176
2342 if (!pl || !spell || spell->env != pl->ob) 2177 if (!pl || !spell || spell->env != pl->ob)
2343 { 2178 {
2344 LOG (llevError, "Invalid call to esrv_remove_spell"); 2179 LOG (llevError, "Invalid call to esrv_remove_spell");
2345 return; 2180 return;
2346 } 2181 }
2347 2182
2348 packet sl; 2183 packet sl ("delspell");
2349 2184
2350 sl << "delspell "
2351 << uint32 (spell->count); 2185 sl << uint32 (spell->count);
2352 2186
2353 pl->socket->send_packet (sl); 2187 pl->ns->send_packet (sl);
2354} 2188}
2355 2189
2356/* appends the spell *spell to the Socklist we will send the data to. */ 2190/* appends the spell *spell to the Socklist we will send the data to. */
2357static void 2191static void
2358append_spell (player *pl, packet &sl, object *spell) 2192append_spell (player *pl, packet &sl, object *spell)
… …
2406 { 2240 {
2407 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); 2241 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2408 return; 2242 return;
2409 } 2243 }
2410 2244
2411 if (!pl->socket->monitor_spells) 2245 if (!pl->ns->monitor_spells)
2412 return; 2246 return;
2413 2247
2414 packet sl; 2248 packet sl ("addspell");
2415
2416 sl << "addspell ";
2417 2249
2418 if (!spell) 2250 if (!spell)
2419 { 2251 {
2420 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2252 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
2421 { 2253 {
… …
2435 if (spell->type != SPELL) 2267 if (spell->type != SPELL)
2436 continue; 2268 continue;
2437 2269
2438 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 2270 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2439 { 2271 {
2440 pl->socket->send_packet (sl); 2272 pl->ns->send_packet (sl);
2441 2273
2442 sl.reset (); 2274 sl.reset ();
2443 sl << "addspell "; 2275 sl << "addspell ";
2444 } 2276 }
2445 2277
… …
2459 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 2291 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2460 fatal (0); 2292 fatal (0);
2461 } 2293 }
2462 2294
2463 /* finally, we can send the packet */ 2295 /* finally, we can send the packet */
2464 pl->socket->send_packet (sl); 2296 pl->ns->send_packet (sl);
2465} 2297}
2466 2298

Diff Legend

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