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.40 by root, Fri Dec 15 04:21:29 2006 UTC vs.
Revision 1.46 by root, Tue Dec 19 05:12:52 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
51#include <newclient.h>
52#include <newserver.h>
53#include <living.h> 48#include <living.h>
54#include <commands.h> 49#include <commands.h>
55 50
56/* This block is basically taken from socket.c - I assume if it works there, 51/* This block is basically taken from socket.c - I assume if it works there,
57 * it should work here. 52 * it should work here.
… …
88 -1, /* life stealing */ 83 -1, /* life stealing */
89 -1 /* Disease - not fully done yet */ 84 -1 /* Disease - not fully done yet */
90}; 85};
91 86
92static void 87static void
93socket_map_scroll (client_socket * ns, int dx, int dy) 88socket_map_scroll (client *ns, int dx, int dy)
94{ 89{
95 struct Map newmap; 90 struct Map newmap;
96 int x, y, mx, my; 91 int x, y, mx, my;
97 92
98 {
99 packet sl;
100
101 sl.printf ("map_scroll %d %d", dx, dy); 93 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
102 ns->send_packet (sl);
103 }
104 94
105 /* If we are using the Map1aCmd, we may in fact send 95 /* If we are using the Map1aCmd, we may in fact send
106 * head information that is outside the viewable map. 96 * head information that is outside the viewable map.
107 * So set the mx,my to the max value we want to 97 * So set the mx,my to the max value we want to
108 * look for. Removed code to do so - it caused extra 98 * look for. Removed code to do so - it caused extra
… …
148} 138}
149 139
150static void 140static void
151clear_map (player *pl) 141clear_map (player *pl)
152{ 142{
153 client_socket &socket = *pl->socket;
154
155 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 143 memset (&pl->socket->lastmap, 0, sizeof (pl->socket->lastmap));
156 144
157 if (socket.newmapcmd == 1) 145 if (pl->socket->newmapcmd == 1)
158 socket.send_packet ("newmap"); 146 pl->socket->send_packet ("newmap");
159 147
160 socket.update_look = 1; 148 pl->socket->floorbox_reset ();
161 socket.look_position = 0;
162} 149}
163 150
164/** check for map change and send new map data */ 151/** check for map change and send new map data */
165static void 152static void
166check_map_change (player *pl) 153check_map_change (player *pl)
167{ 154{
168 client_socket &socket = *pl->socket; 155 client &socket = *pl->socket;
169 object *ob = pl->ob; 156 object *ob = pl->ob;
170 char buf[MAX_BUF]; /* eauugggh */ 157 char buf[MAX_BUF]; /* eauugggh */
171 158
172 if (socket.current_map != ob->map) 159 if (socket.current_map != ob->map)
173 { 160 {
… …
207 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 194 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
208 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
209 else 196 else
210 { 197 {
211 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);
212 socket.update_look = 1; 199 socket.floorbox_reset ();
213 socket.look_position = 0;
214 } 200 }
215 } 201 }
216 202
217 socket.current_x = ob->x; 203 socket.current_x = ob->x;
218 socket.current_y = ob->y; 204 socket.current_y = ob->y;
… …
222 * RequestInfo is sort of a meta command. There is some specific 208 * RequestInfo is sort of a meta command. There is some specific
223 * request of information, but we call other functions to provide 209 * request of information, but we call other functions to provide
224 * that information. 210 * that information.
225 */ 211 */
226void 212void
227RequestInfo (char *buf, int len, client_socket * ns) 213RequestInfo (char *buf, int len, client * ns)
228{ 214{
229 char *params = NULL, *cp; 215 char *params = NULL, *cp;
230 216
231 /* No match */ 217 /* No match */
232 char bigbuf[MAX_BUF]; 218 char bigbuf[MAX_BUF];
… …
264 250
265void 251void
266ExtCmd (char *buf, int len, player *pl) 252ExtCmd (char *buf, int len, player *pl)
267{ 253{
268 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 254 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
255}
256
257void
258ExtiCmd (char *buf, int len, client *ns)
259{
260 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
269} 261}
270 262
271void 263void
272MapInfoCmd (char *buf, int len, player *pl) 264MapInfoCmd (char *buf, int len, player *pl)
273{ 265{
… …
355 pl->socket->send_packet (bigbuf); 347 pl->socket->send_packet (bigbuf);
356} 348}
357 349
358/** This is the Setup cmd - easy first implementation */ 350/** This is the Setup cmd - easy first implementation */
359void 351void
360SetUp (char *buf, int len, client_socket * ns) 352SetUp (char *buf, int len, client * ns)
361{ 353{
362 int s, slen; 354 int s, slen;
363 char *cmd, *param, cmdback[HUGE_BUF]; 355 char *cmd, *param, cmdback[HUGE_BUF];
364 356
365 /* run through the cmds of setup 357 /* run through the cmds of setup
… …
575 * This is what takes care of it. We tell the client how things worked out. 567 * This is what takes care of it. We tell the client how things worked out.
576 * I am not sure if this file is the best place for this function. however, 568 * I am not sure if this file is the best place for this function. however,
577 * 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.
578 */ 570 */
579void 571void
580AddMeCmd (char *buf, int len, client_socket * ns) 572AddMeCmd (char *buf, int len, client * ns)
581{ 573{
582 Settings oldsettings;
583
584 oldsettings = settings;
585 if (ns->status != Ns_Add || add_player (ns)) 574 if (ns->status != Ns_Add || add_player (ns))
586 ns->send_packet ("addme_failed"); 575 ns->send_packet ("addme_failed");
587 else 576 else
588 ns->send_packet ("addme_success"); 577 ns->send_packet ("addme_success");
589
590 settings = oldsettings;
591} 578}
592 579
593/** Reply to ExtendedInfos command */ 580/** Reply to ExtendedInfos command */
594void 581void
595ToggleExtendedInfos (char *buf, int len, client_socket * ns) 582ToggleExtendedInfos (char *buf, int len, client * ns)
596{ 583{
597 char cmdback[MAX_BUF]; 584 char cmdback[MAX_BUF];
598 char command[50]; 585 char command[50];
599 int info, nextinfo; 586 int info, nextinfo;
600 587
… …
651#define MSG_TYPE_MONUMENT 5 638#define MSG_TYPE_MONUMENT 5
652#define MSG_TYPE_SCRIPTED_DIALOG 6*/ 639#define MSG_TYPE_SCRIPTED_DIALOG 6*/
653 640
654/** Reply to ExtendedInfos command */ 641/** Reply to ExtendedInfos command */
655void 642void
656ToggleExtendedText (char *buf, int len, client_socket * ns) 643ToggleExtendedText (char *buf, int len, client * ns)
657{ 644{
658 char cmdback[MAX_BUF]; 645 char cmdback[MAX_BUF];
659 char temp[10]; 646 char temp[10];
660 char command[50]; 647 char command[50];
661 int info, nextinfo, i, flag; 648 int info, nextinfo, i, flag;
… …
712 * a piece of data from us that we know the client wants. So 699 * a piece of data from us that we know the client wants. So
713 * if we know the client wants it, might as well push it to the 700 * if we know the client wants it, might as well push it to the
714 * client. 701 * client.
715 */ 702 */
716static void 703static void
717SendSmooth (client_socket * ns, uint16 face) 704SendSmooth (client *ns, uint16 face)
718{ 705{
719 uint16 smoothface; 706 uint16 smoothface;
720 707
721 /* If we can't find a face, return and set it so we won't try to send this 708 /* If we can't find a face, return and set it so we won't try to send this
722 * again. 709 * again.
… …
746 /** 733 /**
747 * Tells client the picture it has to use 734 * Tells client the picture it has to use
748 * to smooth a picture number given as argument. 735 * to smooth a picture number given as argument.
749 */ 736 */
750void 737void
751AskSmooth (char *buf, int len, client_socket * ns) 738AskSmooth (char *buf, int len, client *ns)
752{ 739{
753 uint16 facenbr; 740 SendSmooth (ns, atoi (buf));
754
755 facenbr = atoi (buf);
756 SendSmooth (ns, facenbr);
757} 741}
758 742
759/** 743/**
760 * This handles the general commands from the client (ie, north, fire, cast, 744 * This handles the general commands from the client (ie, north, fire, cast,
761 * etc.) 745 * etc.)
762 */ 746 */
763void 747void
764PlayerCmd (char *buf, int len, player *pl) 748PlayerCmd (char *buf, int len, player *pl)
765{ 749{
766
767 /* The following should never happen with a proper or honest client.
768 * Therefore, the error message doesn't have to be too clear - if
769 * someone is playing with a hacked/non working client, this gives them
770 * an idea of the problem, but they deserve what they get
771 */
772 if (pl->state != ST_PLAYING)
773 {
774 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
775 return;
776 }
777 /* Check if there is a count. In theory, a zero count could also be 750 /* Check if there is a count. In theory, a zero count could also be
778 * sent, so check for that also. 751 * sent, so check for that also.
779 */ 752 */
780 if (atoi (buf) || buf[0] == '0') 753 if (atoi (buf) || buf[0] == '0')
781 { 754 {
782 pl->count = atoi ((char *) buf); 755 pl->count = atoi ((char *) buf);
756
783 buf = strchr (buf, ' '); /* advance beyond the numbers */ 757 buf = strchr (buf, ' '); /* advance beyond the numbers */
784 if (!buf) 758 if (!buf)
785 {
786#ifdef ESRV_DEBUG
787 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
788#endif
789 return; 759 return;
790 } 760
791 buf++; 761 buf++;
792 } 762 }
793 /* This should not happen anymore. */ 763
794 if (pl->ob->speed_left < -1.0)
795 {
796 LOG (llevError, "Player has negative time - shouldn't do command.\n");
797 }
798 /* In c_new.c */
799 execute_newserver_command (pl->ob, (char *) buf); 764 execute_newserver_command (pl->ob, (char *) buf);
765
800 /* Perhaps something better should be done with a left over count. 766 /* Perhaps something better should be done with a left over count.
801 * Cleaning up the input should probably be done first - all actions 767 * Cleaning up the input should probably be done first - all actions
802 * for the command that issued the count should be done before any other 768 * for the command that issued the count should be done before any other
803 * commands. 769 * commands.
804 */ 770 */
805
806 pl->count = 0; 771 pl->count = 0;
807
808} 772}
809 773
810 774
811/** 775/**
812 * This handles the general commands from the client (ie, north, fire, cast, 776 * This handles the general commands from the client (ie, north, fire, cast,
… …
815 * can throttle. 779 * can throttle.
816 */ 780 */
817void 781void
818NewPlayerCmd (char *buf, int len, player *pl) 782NewPlayerCmd (char *buf, int len, player *pl)
819{ 783{
820 int time, repeat;
821 char command[MAX_BUF];
822 int pktlen;
823
824 if (len < 7) 784 if (len <= 6)
825 { 785 {
826 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 786 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
827 return; 787 return;
828 } 788 }
829 789
830 pktlen = net_uint16 ((uint8 *)buf); 790 uint16 cmdid = net_uint16 ((uint8 *)buf);
831 repeat = net_uint32 ((uint8 *)buf + 2); 791 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
832 792
833 /* -1 is special - no repeat, but don't update */ 793 /* -1 is special - no repeat, but don't update */
834 if (repeat != -1) 794 if (repeat != -1)
835 pl->count = repeat; 795 pl->count = repeat;
836 796
837 if ((len - 4) >= MAX_BUF) 797 buf += 6; //len -= 6;
838 len = MAX_BUF - 5;
839 798
840 strncpy ((char *) command, (char *) buf + 6, len - 4);
841 command[len - 4] = 0;
842
843 /* This should not happen anymore. */
844 if (pl->ob->speed_left < -1.0)
845 LOG (llevError, "Player has negative time - shouldn't do command.\n");
846
847 /* In c_new.c */
848 execute_newserver_command (pl->ob, (char *) command); 799 execute_newserver_command (pl->ob, buf);
800
849 /* Perhaps something better should be done with a left over count. 801 /* Perhaps something better should be done with a left over count.
850 * Cleaning up the input should probably be done first - all actions 802 * Cleaning up the input should probably be done first - all actions
851 * for the command that issued the count should be done before any other 803 * for the command that issued the count should be done before any other
852 * commands. 804 * commands.
853 */ 805 */
854 pl->count = 0; 806 pl->count = 0;
855 807
808 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
856 if (FABS (pl->ob->speed) < 0.001) 809 int time = FABS (pl->ob->speed) < 0.001
857 time = MAX_TIME * 100; 810 ? time = MAX_TIME * 100
858 else
859 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 811 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
860 812
861 /* Send confirmation of command execution now */ 813 /* Send confirmation of command execution now */
862
863 packet sl; 814 packet sl;
864 sl << "comc " << uint16 (pktlen) << uint32 (time); 815 sl << "comc " << uint16 (cmdid) << uint32 (time);
865 pl->socket->send_packet (sl); 816 pl->socket->send_packet (sl);
866} 817}
867 818
868 819
869/** This is a reply to a previous query. */ 820/** This is a reply to a previous query. */
870void 821void
871ReplyCmd (char *buf, int len, player *pl) 822ReplyCmd (char *buf, int len, player *pl)
872{ 823{
873 /* This is to synthesize how the data would be stored if it 824 /* This is to synthesize how the data would be stored if it
874 * was normally entered. A bit of a hack, and should be cleaned up 825 * was normally entered. A bit of a hack, and should be cleaned up
875 * once all the X11 code is removed from the server. 826 * once all the X11 code is removed from the server.
876 * 827 *
877 * We pass 13 to many of the functions because this way they 828 * We pass 13 to many of the functions because this way they
878 * think it was the carriage return that was entered, and the 829 * think it was the carriage return that was entered, and the
879 * function then does not try to do additional input. 830 * function then does not try to do additional input.
… …
882 833
883 /* this avoids any hacking here */ 834 /* this avoids any hacking here */
884 835
885 switch (pl->state) 836 switch (pl->state)
886 { 837 {
887 case ST_PLAYING: 838 case ST_PLAYING:
888 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 839 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
889 break; 840 break;
890 841
891 case ST_PLAY_AGAIN: 842 case ST_PLAY_AGAIN:
892 /* We can check this for return value (2==quit). Maybe we 843 /* We can check this for return value (2==quit). Maybe we
893 * should, and do something appropriate? 844 * should, and do something appropriate?
894 */ 845 */
895 receive_play_again (pl->ob, buf[0]); 846 receive_play_again (pl->ob, buf[0]);
896 break; 847 break;
897 848
898 case ST_ROLL_STAT: 849 case ST_ROLL_STAT:
899 key_roll_stat (pl->ob, buf[0]); 850 key_roll_stat (pl->ob, buf[0]);
900 break; 851 break;
901 852
902 case ST_CHANGE_CLASS: 853 case ST_CHANGE_CLASS:
903 854
904 key_change_class (pl->ob, buf[0]); 855 key_change_class (pl->ob, buf[0]);
905 break; 856 break;
906 857
907 case ST_CONFIRM_QUIT: 858 case ST_CONFIRM_QUIT:
908 key_confirm_quit (pl->ob, buf[0]); 859 key_confirm_quit (pl->ob, buf[0]);
909 break; 860 break;
910 861
911 case ST_CONFIGURE: 862 case ST_CONFIGURE:
912 LOG (llevError, "In client input handling, but into configure state\n"); 863 LOG (llevError, "In client input handling, but into configure state\n");
913 pl->state = ST_PLAYING; 864 pl->state = ST_PLAYING;
914 break; 865 break;
915 866
916 case ST_GET_NAME: 867 case ST_GET_NAME:
917 receive_player_name (pl->ob, 13); 868 receive_player_name (pl->ob, 13);
918 break; 869 break;
919 870
920 case ST_GET_PASSWORD: 871 case ST_GET_PASSWORD:
921 case ST_CONFIRM_PASSWORD: 872 case ST_CONFIRM_PASSWORD:
922 receive_player_password (pl->ob, 13); 873 receive_player_password (pl->ob, 13);
923 break; 874 break;
924 875
925 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 876 case ST_GET_PARTY_PASSWORD: /* Get password for party */
926 receive_party_password (pl->ob, 13); 877 receive_party_password (pl->ob, 13);
927 break; 878 break;
928 879
929 default: 880 default:
930 LOG (llevError, "Unknown input state: %d\n", pl->state); 881 LOG (llevError, "Unknown input state: %d\n", pl->state);
931 } 882 }
932} 883}
933 884
934/** 885/**
935 * Client tells its version. If there is a mismatch, we close the 886 * Client tells its version. If there is a mismatch, we close the
… …
937 * something older than the server. If we assume the client will be 888 * something older than the server. If we assume the client will be
938 * backwards compatible, having it be a later version should not be a 889 * backwards compatible, having it be a later version should not be a
939 * problem. 890 * problem.
940 */ 891 */
941void 892void
942VersionCmd (char *buf, int len, client_socket * ns) 893VersionCmd (char *buf, int len, client * ns)
943{ 894{
944 char *cp;
945 char version_warning[256];
946
947 if (!buf) 895 if (!buf)
948 { 896 {
949 LOG (llevError, "CS: received corrupted version command\n"); 897 LOG (llevError, "CS: received corrupted version command\n");
950 return; 898 return;
951 } 899 }
952 900
953 ns->cs_version = atoi (buf); 901 ns->cs_version = atoi (buf);
954 ns->sc_version = ns->cs_version; 902 ns->sc_version = ns->cs_version;
903
904 LOG (llevDebug, "connection from client <%s>\n", buf);
905
906
907 //TODO: should log here just for statistics
908
955 if (VERSION_CS != ns->cs_version) 909 //if (VERSION_CS != ns->cs_version)
956 { 910 // unchecked;
957#ifdef ESRV_DEBUG 911
958 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
959#endif
960 }
961 cp = strchr (buf + 1, ' '); 912 char *cp = strchr (buf + 1, ' ');
962 if (!cp) 913 if (!cp)
963 return; 914 return;
915
964 ns->sc_version = atoi (cp); 916 ns->sc_version = atoi (cp);
917
965 if (VERSION_SC != ns->sc_version) 918 //if (VERSION_SC != ns->sc_version)
966 { 919 // unchecked;
967#ifdef ESRV_DEBUG 920
968 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
969#endif
970 }
971 cp = strchr (cp + 1, ' '); 921 cp = strchr (cp + 1, ' ');
922
972 if (cp) 923 if (cp)
973 { 924 {
974 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 925 assign (ns->version, cp + 1);
975 926
976 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1);
977
978 /* This is first implementation - i skip all beta DX clients with it
979 * Add later stuff here for other clients
980 */
981
982 /* these are old dxclients */
983 /* Version 1024 added support for singular + plural name values -
984 * requiing this minimal value reduces complexity of that code, and it
985 * has been around for a long time.
986 */
987 if (ns->sc_version < 1026) 927 if (ns->sc_version < 1026)
988 { 928 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
989 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
990 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 929 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
991 ns->send_packet (version_warning);
992 }
993
994 } 930 }
995} 931}
996 932
997/** sound related functions. */ 933/** sound related functions. */
998
999void 934void
1000SetSound (char *buf, int len, client_socket * ns) 935SetSound (char *buf, int len, client * ns)
1001{ 936{
1002 ns->sound = atoi (buf); 937 ns->sound = atoi (buf);
1003} 938}
1004 939
1005/** client wants the map resent */ 940/** client wants the map resent */
1006 941
1007void 942void
1008MapRedrawCmd (char *buf, int len, player *pl) 943MapRedrawCmd (char *buf, int len, player *pl)
1009{ 944{
1010
1011/* This function is currently disabled; just clearing the map state results in 945/* This function is currently disabled; just clearing the map state results in
1012 * display errors. It should clear the cache and send a newmap command. 946 * display errors. It should clear the cache and send a newmap command.
1013 * Unfortunately this solution does not work because some client versions send 947 * Unfortunately this solution does not work because some client versions send
1014 * a mapredraw command after receiving a newmap command. 948 * a mapredraw command after receiving a newmap command.
1015 */ 949 */
1016#if 0
1017 /* Okay, this is MAJOR UGLY. but the only way I know how to
1018 * clear the "cache"
1019 */
1020 memset (&pl->socket->lastmap, 0, sizeof (struct Map));
1021 draw_client_map (pl->ob);
1022#endif
1023} 950}
1024 951
1025/** 952/**
1026 * Moves an object (typically, container to inventory). 953 * Moves an object (typically, container to inventory).
1027 * syntax is: move (to) (tag) (nrof) 954 * syntax is: move (to) (tag) (nrof)
… …
1030MoveCmd (char *buf, int len, player *pl) 957MoveCmd (char *buf, int len, player *pl)
1031{ 958{
1032 int vals[3], i; 959 int vals[3], i;
1033 960
1034 /* A little funky here. We only cycle for 2 records, because 961 /* A little funky here. We only cycle for 2 records, because
1035 * we obviously am not going to find a space after the third 962 * we obviously are not going to find a space after the third
1036 * record. Perhaps we should just replace this with a 963 * record. Perhaps we should just replace this with a
1037 * sscanf? 964 * sscanf?
1038 */ 965 */
1039 for (i = 0; i < 2; i++) 966 for (i = 0; i < 2; i++)
1040 { 967 {
1041 vals[i] = atoi (buf); 968 vals[i] = atoi (buf);
969
1042 if (!(buf = strchr (buf, ' '))) 970 if (!(buf = strchr (buf, ' ')))
1043 { 971 {
1044 LOG (llevError, "Incomplete move command: %s\n", buf); 972 LOG (llevError, "Incomplete move command: %s\n", buf);
1045 return; 973 return;
1046 } 974 }
975
1047 buf++; 976 buf++;
1048 } 977 }
978
1049 vals[2] = atoi (buf); 979 vals[2] = atoi (buf);
1050 980
1051/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 981/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1052 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 982 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1053} 983}
1054
1055
1056 984
1057/****************************************************************************** 985/******************************************************************************
1058 * 986 *
1059 * Start of commands the server sends to the client. 987 * Start of commands the server sends to the client.
1060 * 988 *
… …
1063/** 991/**
1064 * Asks the client to query the user. This way, the client knows 992 * Asks the client to query the user. This way, the client knows
1065 * it needs to send something back (vs just printing out a message) 993 * it needs to send something back (vs just printing out a message)
1066 */ 994 */
1067void 995void
1068send_query (client_socket * ns, uint8 flags, char *text) 996send_query (client *ns, uint8 flags, char *text)
1069{ 997{
1070 char buf[MAX_BUF];
1071
1072 sprintf (buf, "query %d %s", flags, text ? text : ""); 998 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1073 ns->send_packet (buf);
1074} 999}
1075 1000
1076#define AddIfInt64(Old,New,Type) if (Old != New) {\ 1001#define AddIfInt64(Old,New,Type) if (Old != New) {\
1077 Old = New; \ 1002 Old = New; \
1078 sl << uint8 (Type) << uint64 (New); \ 1003 sl << uint8 (Type) << uint64 (New); \
… …
1111 uint16 flags; 1036 uint16 flags;
1112 1037
1113 packet sl; 1038 packet sl;
1114 sl << "stats "; 1039 sl << "stats ";
1115 1040
1116 if (pl->ob != NULL) 1041 if (pl->ob)
1117 { 1042 {
1118 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1043 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);
1119 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1044 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);
1120 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1045 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);
1121 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1046 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
… …
1129 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1054 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);
1130 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1055 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1131 } 1056 }
1132 1057
1133 if (pl->socket->exp64) 1058 if (pl->socket->exp64)
1134 {
1135 uint8 s;
1136
1137 for (s = 0; s < NUM_SKILLS; s++) 1059 for (int s = 0; s < NUM_SKILLS; s++)
1138 {
1139 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 1060 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1140 { 1061 {
1141 /* Always send along the level if exp changes. This is only 1062 /* Always send along the level if exp changes. This is only
1142 * 1 extra byte, but keeps processing simpler. 1063 * 1 extra byte, but keeps processing simpler.
1143 */ 1064 */
1144 sl << uint8 (s + CS_STAT_SKILLINFO) 1065 sl << uint8 (s + CS_STAT_SKILLINFO)
1145 << uint8 (pl->last_skill_ob[s]->level) 1066 << uint8 (pl->last_skill_ob[s]->level)
1146 << uint64 (pl->last_skill_ob[s]->stats.exp); 1067 << uint64 (pl->last_skill_ob[s]->stats.exp);
1147 1068
1148 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; 1069 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1149 } 1070 }
1150 }
1151 }
1152 1071
1153 if (pl->socket->exp64) 1072 if (pl->socket->exp64)
1154 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1073 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }
1155 else 1074 else
1156 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } 1075 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
… …
1174 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1093 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1175 1094
1176 if (pl->socket->sc_version < 1025) 1095 if (pl->socket->sc_version < 1025)
1177 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1096 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1178 else 1097 else
1179 {
1180 int i;
1181
1182 for (i = 0; i < NROFATTACKS; i++) 1098 for (int i = 0; i < NROFATTACKS; i++)
1183 { 1099 {
1184 /* Skip ones we won't send */ 1100 /* Skip ones we won't send */
1185 if (atnr_cs_stat[i] == -1) 1101 if (atnr_cs_stat[i] == -1)
1186 continue; 1102 continue;
1187 1103
1188 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1104 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1189 } 1105 }
1190 }
1191 1106
1192 if (pl->socket->monitor_spells) 1107 if (pl->socket->monitor_spells)
1193 { 1108 {
1194 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1109 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1195 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1110 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
… …
1232 * sent them the face yet (this can become quite costly in terms of 1147 * sent them the face yet (this can become quite costly in terms of
1233 * how much we are sending - on the other hand, this should only happen 1148 * how much we are sending - on the other hand, this should only happen
1234 * when the player logs in and picks stuff up. 1149 * when the player logs in and picks stuff up.
1235 */ 1150 */
1236void 1151void
1237esrv_send_animation (client_socket * ns, short anim_num) 1152esrv_send_animation (client * ns, short anim_num)
1238{ 1153{
1239 int i;
1240
1241 /* Do some checking on the anim_num we got. Note that the animations 1154 /* Do some checking on the anim_num we got. Note that the animations
1242 * are added in contigous order, so if the number is in the valid 1155 * are added in contigous order, so if the number is in the valid
1243 * range, it must be a valid animation. 1156 * range, it must be a valid animation.
1244 */ 1157 */
1245 if (anim_num < 0 || anim_num > num_animations) 1158 if (anim_num < 0 || anim_num > num_animations)
… …
1255 << uint16 (0); /* flags - not used right now */ 1168 << uint16 (0); /* flags - not used right now */
1256 1169
1257 /* Build up the list of faces. Also, send any information (ie, the 1170 /* Build up the list of faces. Also, send any information (ie, the
1258 * the face itself) down to the client. 1171 * the face itself) down to the client.
1259 */ 1172 */
1260 for (i = 0; i < animations[anim_num].num_animations; i++) 1173 for (int i = 0; i < animations[anim_num].num_animations; i++)
1261 { 1174 {
1262 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1175 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1263 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1176 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1177
1264 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 1178 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1265 } 1179 }
1266 1180
1267 ns->send_packet (sl); 1181 ns->send_packet (sl);
1268 1182
… …
1279/** 1193/**
1280 * This adds face_num to a map cell at x,y. If the client doesn't have 1194 * This adds face_num to a map cell at x,y. If the client doesn't have
1281 * the face yet, we will also send it. 1195 * the face yet, we will also send it.
1282 */ 1196 */
1283static void 1197static void
1284esrv_map_setbelow (client_socket * ns, int x, int y, short face_num, struct Map *newmap) 1198esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1285{ 1199{
1286 if (newmap->cells[x][y].count >= MAP_LAYERS) 1200 if (newmap->cells[x][y].count >= MAP_LAYERS)
1287 { 1201 {
1202 //TODO: one or the other, can't both have abort and return, verify and act
1288 LOG (llevError, "Too many faces in map cell %d %d\n", x, y); 1203 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1289 return; 1204 return;
1290 abort (); 1205 abort ();
1291 } 1206 }
1292 1207
1293 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; 1208 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1294 newmap->cells[x][y].count++; 1209 newmap->cells[x][y].count++;
1295 1210
1296 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1211 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1297 esrv_send_face (ns, face_num, 0); 1212 esrv_send_face (ns, face_num, 0);
1298}
1299
1300struct LayerCell
1301{
1302 uint16 xy;
1303 short face;
1304};
1305
1306struct MapLayer
1307{
1308 int count;
1309 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1310};
1311
1312/** Checkes if map cells have changed */
1313static int
1314mapcellchanged (client_socket * ns, int i, int j, struct Map *newmap)
1315{
1316 int k;
1317
1318 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1319 return 1;
1320 for (k = 0; k < newmap->cells[i][j].count; k++)
1321 {
1322 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1323 {
1324 return 1;
1325 }
1326 }
1327 return 0;
1328}
1329
1330/**
1331 * Basically, what this does is pack the data into layers.
1332 * cnum is the client number, cur is the the buffer we put all of
1333 * this data into. we return the end of the data. layers is
1334 * how many layers of data we should back.
1335 */
1336static uint8 *
1337compactlayer (client_socket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1338{
1339 int x, y, k;
1340 int face;
1341 unsigned char *fcur;
1342 struct MapLayer layers[MAP_LAYERS];
1343
1344 for (k = 0; k < MAP_LAYERS; k++)
1345 layers[k].count = 0;
1346 fcur = cur;
1347 for (x = 0; x < ns->mapx; x++)
1348 {
1349 for (y = 0; y < ns->mapy; y++)
1350 {
1351 if (!mapcellchanged (ns, x, y, newmap))
1352 continue;
1353 if (newmap->cells[x][y].count == 0)
1354 {
1355 *cur = x * ns->mapy + y; /* mark empty space */
1356 cur++;
1357 continue;
1358 }
1359 for (k = 0; k < newmap->cells[x][y].count; k++)
1360 {
1361 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1362 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1363 layers[k].count++;
1364 }
1365 }
1366 }
1367 /* If no data, return now. */
1368 if (fcur == cur && layers[0].count == 0)
1369 return cur;
1370 *cur = 255; /* mark end of explicitly cleared cells */
1371 cur++;
1372 /* First pack by layers. */
1373 for (k = 0; k < numlayers; k++)
1374 {
1375 if (layers[k].count == 0)
1376 break; /* once a layer is entirely empty, no layer below it can
1377 have anything in it either */
1378 /* Pack by entries in thie layer */
1379 for (x = 0; x < layers[k].count;)
1380 {
1381 fcur = cur;
1382 *cur = layers[k].lcells[x].face >> 8;
1383 cur++;
1384 *cur = layers[k].lcells[x].face & 0xFF;
1385 cur++;
1386 face = layers[k].lcells[x].face;
1387 /* Now, we back the redundant data into 1 byte xy pairings */
1388 for (y = x; y < layers[k].count; y++)
1389 {
1390 if (layers[k].lcells[y].face == face)
1391 {
1392 *cur = (uint8) layers[k].lcells[y].xy;
1393 cur++;
1394 layers[k].lcells[y].face = -1;
1395 }
1396 }
1397 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1398 /* forward over the now redundant data */
1399 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1400 x++;
1401 }
1402 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1403 }
1404 return cur;
1405} 1213}
1406 1214
1407/** Clears a map cell */ 1215/** Clears a map cell */
1408static void 1216static void
1409map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1217map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
… …
1421#define MAX_LAYERS 3 1229#define MAX_LAYERS 3
1422 1230
1423/* Using a global really isn't a good approach, but saves the over head of 1231/* Using a global really isn't a good approach, but saves the over head of
1424 * allocating and deallocating such a block of data each time run through, 1232 * allocating and deallocating such a block of data each time run through,
1425 * and saves the space of allocating this in the socket object when we only 1233 * and saves the space of allocating this in the socket object when we only
1426 * need it for this cycle. If the serve is ever threaded, this needs to be 1234 * need it for this cycle. If the server is ever threaded, this needs to be
1427 * re-examined. 1235 * re-examined.
1428 */ 1236 */
1429
1430static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1237static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1431 1238
1432/** 1239/**
1433 * Returns true if any of the heads for this 1240 * Returns true if any of the heads for this
1434 * space is set. Returns false if all are blank - this is used 1241 * space is set. Returns false if all are blank - this is used
1435 * for empty space checking. 1242 * for empty space checking.
1436 */ 1243 */
1437static inline int 1244static inline int
1438have_head (int ax, int ay) 1245have_head (int ax, int ay)
1439{ 1246{
1440
1441 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1247 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1442 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) 1248 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1443 return 1; 1249 return 1;
1250
1444 return 0; 1251 return 0;
1445} 1252}
1446 1253
1447/** 1254/**
1448 * check_head is a bit simplistic version of update_space below. 1255 * check_head is a bit simplistic version of update_space below.
1449 * basically, it only checks the that the head on space ax,ay at layer 1256 * basically, it only checks the that the head on space ax,ay at layer
1450 * needs to get sent - if so, it adds the data, sending the head 1257 * needs to get sent - if so, it adds the data, sending the head
1451 * if needed, and returning 1. If this no data needs to get 1258 * if needed, and returning 1. If this no data needs to get
1452 * sent, it returns zero. 1259 * sent, it returns zero.
1453 */ 1260 */
1454static int 1261static int
1455check_head (packet &sl, client_socket &ns, int ax, int ay, int layer) 1262check_head (packet &sl, client &ns, int ax, int ay, int layer)
1456{ 1263{
1457 short face_num; 1264 short face_num;
1458 1265
1459 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) 1266 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1460 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; 1267 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
… …
1492 * numbers the spaces differently - I think this was a leftover from 1299 * numbers the spaces differently - I think this was a leftover from
1493 * the map command, where the faces stack up. Sinces that is no longer 1300 * the map command, where the faces stack up. Sinces that is no longer
1494 * the case, it seems to make more sense to have these layer values 1301 * the case, it seems to make more sense to have these layer values
1495 * actually match. 1302 * actually match.
1496 */ 1303 */
1497
1498static int 1304static int
1499update_space (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1305update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1500{ 1306{
1501 object *ob, *head; 1307 object *ob, *head;
1502 uint16 face_num; 1308 uint16 face_num;
1503 int bx, by, i; 1309 int bx, by, i;
1504 1310
… …
1717 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ 1523 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1718 * take. 1524 * take.
1719 */ 1525 */
1720 1526
1721static inline int 1527static inline int
1722update_smooth (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1528update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1723{ 1529{
1724 object *ob; 1530 object *ob;
1725 int smoothlevel; /* old face_num; */ 1531 int smoothlevel; /* old face_num; */
1726 1532
1727 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1533 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
… …
1761 * Returns the size of a data for a map square as returned by 1567 * Returns the size of a data for a map square as returned by
1762 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1568 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1763 * available. 1569 * available.
1764 */ 1570 */
1765int 1571int
1766getExtendedMapInfoSize (client_socket * ns) 1572getExtendedMapInfoSize (client * ns)
1767{ 1573{
1768 int result = 0; 1574 int result = 0;
1769 1575
1770 if (ns->ext_mapinfos) 1576 if (ns->ext_mapinfos)
1771 { 1577 {
1772 if (ns->EMI_smooth) 1578 if (ns->EMI_smooth)
1773 result += 1; /*One byte for smoothlevel */ 1579 result += 1; /*One byte for smoothlevel */
1774 } 1580 }
1581
1775 return result; 1582 return result;
1776} 1583}
1777 1584
1778/** 1585/**
1779 * This function uses the new map1 protocol command to send the map 1586 * This function uses the new map1 protocol command to send the map
… …
1807 uint8 eentrysize; 1614 uint8 eentrysize;
1808 uint16 ewhatstart, ewhatflag; 1615 uint16 ewhatstart, ewhatflag;
1809 uint8 extendedinfos; 1616 uint8 extendedinfos;
1810 maptile *m; 1617 maptile *m;
1811 1618
1812 client_socket &socket = *pl->contr->socket; 1619 client &socket = *pl->contr->socket;
1813 1620
1814 check_map_change (pl->contr); 1621 check_map_change (pl->contr);
1815 1622
1816 packet sl; 1623 packet sl;
1817 packet esl; 1624 packet esl;
… …
2216 { 2023 {
2217 ax = i; 2024 ax = i;
2218 ay = j; 2025 ay = j;
2219 m = pm; 2026 m = pm;
2220 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2027 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2028
2221 if (mflags & P_OUT_OF_MAP) 2029 if (mflags & P_OUT_OF_MAP)
2222 continue; 2030 continue;
2031
2223 if (mflags & P_NEED_UPDATE) 2032 if (mflags & P_NEED_UPDATE)
2224 update_position (m, ax, ay); 2033 update_position (m, ax, ay);
2034
2225 /* If a map is visible to the player, we don't want to swap it out 2035 /* If a map is visible to the player, we don't want to swap it out
2226 * just to reload it. This should really call something like 2036 * just to reload it. This should really call something like
2227 * swap_map, but this is much more efficient and 'good enough' 2037 * swap_map, but this is much more efficient and 'good enough'
2228 */ 2038 */
2229 if (mflags & P_NEW_MAP) 2039 if (mflags & P_NEW_MAP)
… …
2260/** 2070/**
2261 * This sends the skill number to name mapping. We ignore 2071 * This sends the skill number to name mapping. We ignore
2262 * the params - we always send the same info no matter what. 2072 * the params - we always send the same info no matter what.
2263 */ 2073 */
2264void 2074void
2265send_skill_info (client_socket *ns, char *params) 2075send_skill_info (client *ns, char *params)
2266{ 2076{
2267 packet sl; 2077 packet sl;
2268 sl << "replyinfo skill_info\n"; 2078 sl << "replyinfo skill_info\n";
2269 2079
2270 for (int i = 1; i < NUM_SKILLS; i++) 2080 for (int i = 1; i < NUM_SKILLS; i++)
… …
2282/** 2092/**
2283 * This sends the spell path to name mapping. We ignore 2093 * This sends the spell path to name mapping. We ignore
2284 * the params - we always send the same info no matter what. 2094 * the params - we always send the same info no matter what.
2285 */ 2095 */
2286void 2096void
2287send_spell_paths (client_socket * ns, char *params) 2097send_spell_paths (client * ns, char *params)
2288{ 2098{
2289 packet sl; 2099 packet sl;
2290 2100
2291 sl << "replyinfo spell_paths\n"; 2101 sl << "replyinfo spell_paths\n";
2292 2102
… …
2432 2242
2433 if (!pl->socket->monitor_spells) 2243 if (!pl->socket->monitor_spells)
2434 return; 2244 return;
2435 2245
2436 packet sl; 2246 packet sl;
2437
2438 sl << "addspell "; 2247 sl << "addspell ";
2439 2248
2440 if (!spell) 2249 if (!spell)
2441 { 2250 {
2442 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2251 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)

Diff Legend

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