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.39 by root, Fri Dec 15 03:53:44 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
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->ns->lastmap, 0, sizeof (pl->ns->lastmap));
156 144
157 if (socket.newmapcmd == 1) 145 if (pl->ns->newmapcmd == 1)
158 socket.send_packet ("newmap"); 146 pl->ns->send_packet ("newmap");
159 147
160 socket.update_look = 1; 148 pl->ns->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->ns;
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;
219} 205}
220 206
207/**
208 * RequestInfo is sort of a meta command. There is some specific
209 * request of information, but we call other functions to provide
210 * that information.
211 */
212void
213RequestInfo (char *buf, int len, client * ns)
214{
215 char *params = NULL, *cp;
216
217 /* No match */
218 char bigbuf[MAX_BUF];
219 int slen;
220
221 /* Set up replyinfo before we modify any of the buffers - this is used
222 * if we don't find a match.
223 */
224 strcpy (bigbuf, "replyinfo ");
225 slen = strlen (bigbuf);
226 safe_strcat (bigbuf, buf, &slen, MAX_BUF);
227
228 /* find the first space, make it null, and update the
229 * params pointer.
230 */
231 for (cp = buf; *cp != '\0'; cp++)
232 if (*cp == ' ')
233 {
234 *cp = '\0';
235 params = cp + 1;
236 break;
237 }
238
239 if (!strcmp (buf, "image_info"))
240 send_image_info (ns, params);
241 else if (!strcmp (buf, "image_sums"))
242 send_image_sums (ns, params);
243 else if (!strcmp (buf, "skill_info"))
244 send_skill_info (ns, params);
245 else if (!strcmp (buf, "spell_paths"))
246 send_spell_paths (ns, params);
247 else
248 ns->send_packet (bigbuf, len);
249}
250
221void 251void
222ExtCmd (char *buf, int len, player *pl) 252ExtCmd (char *buf, int len, player *pl)
223{ 253{
224 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));
225} 261}
226 262
227void 263void
228MapInfoCmd (char *buf, int len, player *pl) 264MapInfoCmd (char *buf, int len, player *pl)
229{ 265{
… …
244 buf += 8; 280 buf += 8;
245 281
246 // initial map and its origin 282 // initial map and its origin
247 maptile *map = pl->ob->map; 283 maptile *map = pl->ob->map;
248 sint16 dx, dy; 284 sint16 dx, dy;
249 int mapx = pl->socket->mapx / 2 - pl->ob->x; 285 int mapx = pl->ns->mapx / 2 - pl->ob->x;
250 int mapy = pl->socket->mapy / 2 - pl->ob->y; 286 int mapy = pl->ns->mapy / 2 - pl->ob->y;
251 int max_distance = 8; // limit maximum path length to something generous 287 int max_distance = 8; // limit maximum path length to something generous
252 288
253 while (*buf && map && max_distance) 289 while (*buf && map && max_distance)
254 { 290 {
255 int dir = *buf++; 291 int dir = *buf++;
… …
306 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 342 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
307 } 343 }
308 else 344 else
309 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 345 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
310 346
311 pl->socket->send_packet (bigbuf); 347 pl->ns->send_packet (bigbuf);
312} 348}
313 349
314/** This is the Setup cmd - easy first implementation */ 350/** This is the Setup cmd - easy first implementation */
315void 351void
316SetUp (char *buf, int len, client_socket * ns) 352SetUp (char *buf, int len, client * ns)
317{ 353{
318 int s, slen; 354 int s, slen;
319 char *cmd, *param, cmdback[HUGE_BUF]; 355 char *cmd, *param, cmdback[HUGE_BUF];
320 356
321 /* run through the cmds of setup 357 /* run through the cmds of setup
… …
531 * 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.
532 * 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,
533 * 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.
534 */ 570 */
535void 571void
536AddMeCmd (char *buf, int len, client_socket * ns) 572AddMeCmd (char *buf, int len, client * ns)
537{ 573{
538 Settings oldsettings; 574 if (INVOKE_CLIENT (ADDME, ns))
575 return;
539 576
540 oldsettings = settings;
541 if (ns->status != Ns_Add || add_player (ns)) 577 if (ns->pl || add_player (ns))
542 ns->send_packet ("addme_failed"); 578 ns->send_packet ("addme_failed");
543 else 579 else
544 ns->send_packet ("addme_success"); 580 ns->send_packet ("addme_success");
545
546 settings = oldsettings;
547} 581}
548 582
549/** Reply to ExtendedInfos command */ 583/** Reply to ExtendedInfos command */
550void 584void
551ToggleExtendedInfos (char *buf, int len, client_socket * ns) 585ToggleExtendedInfos (char *buf, int len, client * ns)
552{ 586{
553 char cmdback[MAX_BUF]; 587 char cmdback[MAX_BUF];
554 char command[50]; 588 char command[50];
555 int info, nextinfo; 589 int info, nextinfo;
556 590
… …
607#define MSG_TYPE_MONUMENT 5 641#define MSG_TYPE_MONUMENT 5
608#define MSG_TYPE_SCRIPTED_DIALOG 6*/ 642#define MSG_TYPE_SCRIPTED_DIALOG 6*/
609 643
610/** Reply to ExtendedInfos command */ 644/** Reply to ExtendedInfos command */
611void 645void
612ToggleExtendedText (char *buf, int len, client_socket * ns) 646ToggleExtendedText (char *buf, int len, client * ns)
613{ 647{
614 char cmdback[MAX_BUF]; 648 char cmdback[MAX_BUF];
615 char temp[10]; 649 char temp[10];
616 char command[50]; 650 char command[50];
617 int info, nextinfo, i, flag; 651 int info, nextinfo, i, flag;
… …
668 * 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
669 * 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
670 * client. 704 * client.
671 */ 705 */
672static void 706static void
673SendSmooth (client_socket * ns, uint16 face) 707SendSmooth (client *ns, uint16 face)
674{ 708{
675 uint16 smoothface; 709 uint16 smoothface;
676 710
677 /* 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
678 * again. 712 * again.
… …
688 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) 722 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
689 esrv_send_face (ns, smoothface, 0); 723 esrv_send_face (ns, smoothface, 0);
690 724
691 ns->faces_sent[face] |= NS_FACESENT_SMOOTH; 725 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
692 726
693 packet sl; 727 packet sl ("smooth");
694 728
695 sl << "smooth "
696 << uint16 (face) 729 sl << uint16 (face)
697 << uint16 (smoothface); 730 << uint16 (smoothface);
698 731
699 ns->send_packet (sl); 732 ns->send_packet (sl);
700} 733}
701 734
702 /** 735 /**
703 * Tells client the picture it has to use 736 * Tells client the picture it has to use
704 * to smooth a picture number given as argument. 737 * to smooth a picture number given as argument.
705 */ 738 */
706void 739void
707AskSmooth (char *buf, int len, client_socket * ns) 740AskSmooth (char *buf, int len, client *ns)
708{ 741{
709 uint16 facenbr; 742 SendSmooth (ns, atoi (buf));
710
711 facenbr = atoi (buf);
712 SendSmooth (ns, facenbr);
713} 743}
714 744
715/** 745/**
716 * 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,
717 * etc.) 747 * etc.)
718 */ 748 */
719void 749void
720PlayerCmd (char *buf, int len, player *pl) 750PlayerCmd (char *buf, int len, player *pl)
721{ 751{
722
723 /* The following should never happen with a proper or honest client.
724 * Therefore, the error message doesn't have to be too clear - if
725 * someone is playing with a hacked/non working client, this gives them
726 * an idea of the problem, but they deserve what they get
727 */
728 if (pl->state != ST_PLAYING)
729 {
730 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
731 return;
732 }
733 /* 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
734 * sent, so check for that also. 753 * sent, so check for that also.
735 */ 754 */
736 if (atoi (buf) || buf[0] == '0') 755 if (atoi (buf) || buf[0] == '0')
737 { 756 {
738 pl->count = atoi ((char *) buf); 757 pl->count = atoi ((char *) buf);
758
739 buf = strchr (buf, ' '); /* advance beyond the numbers */ 759 buf = strchr (buf, ' '); /* advance beyond the numbers */
740 if (!buf) 760 if (!buf)
741 {
742#ifdef ESRV_DEBUG
743 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
744#endif
745 return; 761 return;
746 } 762
747 buf++; 763 buf++;
748 } 764 }
749 /* This should not happen anymore. */ 765
750 if (pl->ob->speed_left < -1.0)
751 {
752 LOG (llevError, "Player has negative time - shouldn't do command.\n");
753 }
754 /* In c_new.c */
755 execute_newserver_command (pl->ob, (char *) buf); 766 execute_newserver_command (pl->ob, (char *) buf);
767
756 /* Perhaps something better should be done with a left over count. 768 /* Perhaps something better should be done with a left over count.
757 * Cleaning up the input should probably be done first - all actions 769 * Cleaning up the input should probably be done first - all actions
758 * 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
759 * commands. 771 * commands.
760 */ 772 */
761
762 pl->count = 0; 773 pl->count = 0;
763
764} 774}
765 775
766 776
767/** 777/**
768 * 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,
… …
771 * can throttle. 781 * can throttle.
772 */ 782 */
773void 783void
774NewPlayerCmd (char *buf, int len, player *pl) 784NewPlayerCmd (char *buf, int len, player *pl)
775{ 785{
776 int time, repeat;
777 char command[MAX_BUF];
778 int pktlen;
779
780 if (len < 7) 786 if (len <= 6)
781 { 787 {
782 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);
783 return; 789 return;
784 } 790 }
785 791
786 pktlen = net_uint16 ((uint8 *)buf); 792 uint16 cmdid = net_uint16 ((uint8 *)buf);
787 repeat = net_uint32 ((uint8 *)buf + 2); 793 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
788 794
789 /* -1 is special - no repeat, but don't update */ 795 /* -1 is special - no repeat, but don't update */
790 if (repeat != -1) 796 if (repeat != -1)
791 pl->count = repeat; 797 pl->count = repeat;
792 798
793 if ((len - 4) >= MAX_BUF) 799 buf += 6; //len -= 6;
794 len = MAX_BUF - 5;
795 800
796 strncpy ((char *) command, (char *) buf + 6, len - 4);
797 command[len - 4] = 0;
798
799 /* This should not happen anymore. */
800 if (pl->ob->speed_left < -1.0)
801 LOG (llevError, "Player has negative time - shouldn't do command.\n");
802
803 /* In c_new.c */
804 execute_newserver_command (pl->ob, (char *) command); 801 execute_newserver_command (pl->ob, buf);
802
805 /* Perhaps something better should be done with a left over count. 803 /* Perhaps something better should be done with a left over count.
806 * Cleaning up the input should probably be done first - all actions 804 * Cleaning up the input should probably be done first - all actions
807 * 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
808 * commands. 806 * commands.
809 */ 807 */
810 pl->count = 0; 808 pl->count = 0;
811 809
810 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
812 if (FABS (pl->ob->speed) < 0.001) 811 int time = FABS (pl->ob->speed) < 0.001
813 time = MAX_TIME * 100; 812 ? time = MAX_TIME * 100
814 else
815 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 813 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
816 814
817 /* Send confirmation of command execution now */ 815 /* Send confirmation of command execution now */
818 816 packet sl ("comc");
819 packet sl;
820 sl << "comc " << uint16 (pktlen) << uint32 (time); 817 sl << uint16 (cmdid) << uint32 (time);
821 pl->socket->send_packet (sl); 818 pl->ns->send_packet (sl);
822} 819}
823
824 820
825/** This is a reply to a previous query. */ 821/** This is a reply to a previous query. */
826void 822void
827ReplyCmd (char *buf, int len, player *pl) 823ReplyCmd (char *buf, int len, client *ns)
828{ 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
829 /* 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
830 * 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
831 * once all the X11 code is removed from the server. 839 * once all the X11 code is removed from the server.
832 * 840 *
833 * 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
834 * think it was the carriage return that was entered, and the 842 * think it was the carriage return that was entered, and the
835 * function then does not try to do additional input. 843 * function then does not try to do additional input.
836 */ 844 */
837 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); 845 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
838 846
839 /* this avoids any hacking here */ 847 /* this avoids any hacking here */
840 848
841 switch (pl->state) 849 switch (ns->state)
842 { 850 {
843 case ST_PLAYING: 851 case ST_PLAYING:
844 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 852 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
845 break; 853 break;
846 854
847 case ST_PLAY_AGAIN: 855 case ST_PLAY_AGAIN:
848 /* We can check this for return value (2==quit). Maybe we 856 /* We can check this for return value (2==quit). Maybe we
849 * should, and do something appropriate? 857 * should, and do something appropriate?
850 */ 858 */
851 receive_play_again (pl->ob, buf[0]); 859 receive_play_again (pl->ob, buf[0]);
852 break; 860 break;
853 861
854 case ST_ROLL_STAT: 862 case ST_ROLL_STAT:
855 key_roll_stat (pl->ob, buf[0]); 863 key_roll_stat (pl->ob, buf[0]);
856 break; 864 break;
857 865
858 case ST_CHANGE_CLASS: 866 case ST_CHANGE_CLASS:
859
860 key_change_class (pl->ob, buf[0]); 867 key_change_class (pl->ob, buf[0]);
861 break; 868 break;
862 869
863 case ST_CONFIRM_QUIT: 870 case ST_CONFIRM_QUIT:
864 key_confirm_quit (pl->ob, buf[0]); 871 key_confirm_quit (pl->ob, buf[0]);
865 break; 872 break;
866 873
867 case ST_CONFIGURE: 874 case ST_CONFIGURE:
868 LOG (llevError, "In client input handling, but into configure state\n"); 875 LOG (llevError, "In client input handling, but into configure state\n");
869 pl->state = ST_PLAYING; 876 ns->state = ST_PLAYING;
870 break; 877 break;
871 878
872 case ST_GET_NAME: 879 case ST_GET_NAME:
873 receive_player_name (pl->ob, 13); 880 receive_player_name (pl->ob, 13);
874 break; 881 break;
875 882
876 case ST_GET_PASSWORD: 883 case ST_GET_PASSWORD:
877 case ST_CONFIRM_PASSWORD: 884 case ST_CONFIRM_PASSWORD:
878 receive_player_password (pl->ob, 13); 885 receive_player_password (pl->ob, 13);
879 break; 886 break;
880 887
881 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 888 case ST_GET_PARTY_PASSWORD: /* Get password for party */
882 receive_party_password (pl->ob, 13); 889 receive_party_password (pl->ob, 13);
883 break; 890 break;
884 891
885 default: 892 default:
886 LOG (llevError, "Unknown input state: %d\n", pl->state); 893 LOG (llevError, "Unknown input state: %d\n", ns->state);
887 } 894 }
888} 895}
889 896
890/** 897/**
891 * 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
… …
893 * something older than the server. If we assume the client will be 900 * something older than the server. If we assume the client will be
894 * backwards compatible, having it be a later version should not be a 901 * backwards compatible, having it be a later version should not be a
895 * problem. 902 * problem.
896 */ 903 */
897void 904void
898VersionCmd (char *buf, int len, client_socket * ns) 905VersionCmd (char *buf, int len, client * ns)
899{ 906{
900 char *cp;
901 char version_warning[256];
902
903 if (!buf) 907 if (!buf)
904 { 908 {
905 LOG (llevError, "CS: received corrupted version command\n"); 909 LOG (llevError, "CS: received corrupted version command\n");
906 return; 910 return;
907 } 911 }
908 912
909 ns->cs_version = atoi (buf); 913 ns->cs_version = atoi (buf);
910 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
911 if (VERSION_CS != ns->cs_version) 921 //if (VERSION_CS != ns->cs_version)
912 { 922 // unchecked;
913#ifdef ESRV_DEBUG 923
914 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
915#endif
916 }
917 cp = strchr (buf + 1, ' '); 924 char *cp = strchr (buf + 1, ' ');
918 if (!cp) 925 if (!cp)
919 return; 926 return;
927
920 ns->sc_version = atoi (cp); 928 ns->sc_version = atoi (cp);
929
921 if (VERSION_SC != ns->sc_version) 930 //if (VERSION_SC != ns->sc_version)
922 { 931 // unchecked;
923#ifdef ESRV_DEBUG 932
924 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
925#endif
926 }
927 cp = strchr (cp + 1, ' '); 933 cp = strchr (cp + 1, ' ');
934
928 if (cp) 935 if (cp)
929 { 936 {
930 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 937 assign (ns->version, cp + 1);
931 938
932 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1);
933
934 /* This is first implementation - i skip all beta DX clients with it
935 * Add later stuff here for other clients
936 */
937
938 /* these are old dxclients */
939 /* Version 1024 added support for singular + plural name values -
940 * requiing this minimal value reduces complexity of that code, and it
941 * has been around for a long time.
942 */
943 if (ns->sc_version < 1026) 939 if (ns->sc_version < 1026)
944 { 940 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
945 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
946 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 941 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
947 ns->send_packet (version_warning);
948 }
949
950 } 942 }
951} 943}
952 944
953/** sound related functions. */ 945/** sound related functions. */
954
955void 946void
956SetSound (char *buf, int len, client_socket * ns) 947SetSound (char *buf, int len, client * ns)
957{ 948{
958 ns->sound = atoi (buf); 949 ns->sound = atoi (buf);
959} 950}
960 951
961/** client wants the map resent */ 952/** client wants the map resent */
962 953
963void 954void
964MapRedrawCmd (char *buf, int len, player *pl) 955MapRedrawCmd (char *buf, int len, player *pl)
965{ 956{
966
967/* 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
968 * 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.
969 * Unfortunately this solution does not work because some client versions send 959 * Unfortunately this solution does not work because some client versions send
970 * a mapredraw command after receiving a newmap command. 960 * a mapredraw command after receiving a newmap command.
971 */ 961 */
972#if 0
973 /* Okay, this is MAJOR UGLY. but the only way I know how to
974 * clear the "cache"
975 */
976 memset (&pl->socket->lastmap, 0, sizeof (struct Map));
977 draw_client_map (pl->ob);
978#endif
979} 962}
980 963
981/** 964/**
982 * Moves an object (typically, container to inventory). 965 * Moves an object (typically, container to inventory).
983 * syntax is: move (to) (tag) (nrof) 966 * syntax is: move (to) (tag) (nrof)
… …
986MoveCmd (char *buf, int len, player *pl) 969MoveCmd (char *buf, int len, player *pl)
987{ 970{
988 int vals[3], i; 971 int vals[3], i;
989 972
990 /* A little funky here. We only cycle for 2 records, because 973 /* A little funky here. We only cycle for 2 records, because
991 * 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
992 * record. Perhaps we should just replace this with a 975 * record. Perhaps we should just replace this with a
993 * sscanf? 976 * sscanf?
994 */ 977 */
995 for (i = 0; i < 2; i++) 978 for (i = 0; i < 2; i++)
996 { 979 {
997 vals[i] = atoi (buf); 980 vals[i] = atoi (buf);
981
998 if (!(buf = strchr (buf, ' '))) 982 if (!(buf = strchr (buf, ' ')))
999 { 983 {
1000 LOG (llevError, "Incomplete move command: %s\n", buf); 984 LOG (llevError, "Incomplete move command: %s\n", buf);
1001 return; 985 return;
1002 } 986 }
987
1003 buf++; 988 buf++;
1004 } 989 }
990
1005 vals[2] = atoi (buf); 991 vals[2] = atoi (buf);
1006 992
1007/* 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]);*/
1008 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 994 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1009} 995}
1010
1011
1012 996
1013/****************************************************************************** 997/******************************************************************************
1014 * 998 *
1015 * Start of commands the server sends to the client. 999 * Start of commands the server sends to the client.
1016 * 1000 *
… …
1019/** 1003/**
1020 * 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
1021 * 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)
1022 */ 1006 */
1023void 1007void
1024send_query (client_socket * ns, uint8 flags, char *text) 1008send_query (client *ns, uint8 flags, char *text)
1025{ 1009{
1026 char buf[MAX_BUF];
1027
1028 sprintf (buf, "query %d %s", flags, text ? text : ""); 1010 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1029 ns->send_packet (buf);
1030} 1011}
1031 1012
1032#define AddIfInt64(Old,New,Type) if (Old != New) {\ 1013#define AddIfInt64(Old,New,Type) if (Old != New) {\
1033 Old = New; \ 1014 Old = New; \
1034 sl << uint8 (Type) << uint64 (New); \ 1015 sl << uint8 (Type) << uint64 (New); \
… …
1064esrv_update_stats (player *pl) 1045esrv_update_stats (player *pl)
1065{ 1046{
1066 char buf[MAX_BUF]; 1047 char buf[MAX_BUF];
1067 uint16 flags; 1048 uint16 flags;
1068 1049
1069 packet sl; 1050 packet sl ("stats");
1070 sl << "stats ";
1071 1051
1072 if (pl->ob != NULL) 1052 if (pl->ob)
1073 { 1053 {
1074 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);
1075 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);
1076 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);
1077 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);
… …
1084 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);
1085 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);
1086 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);
1087 } 1067 }
1088 1068
1089 if (pl->socket->exp64) 1069 if (pl->ns->exp64)
1090 {
1091 uint8 s;
1092
1093 for (s = 0; s < NUM_SKILLS; s++) 1070 for (int s = 0; s < NUM_SKILLS; s++)
1094 {
1095 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)
1096 { 1072 {
1097 /* Always send along the level if exp changes. This is only 1073 /* Always send along the level if exp changes. This is only
1098 * 1 extra byte, but keeps processing simpler. 1074 * 1 extra byte, but keeps processing simpler.
1099 */ 1075 */
1100 sl << uint8 (s + CS_STAT_SKILLINFO) 1076 sl << uint8 (s + CS_STAT_SKILLINFO)
1101 << uint8 (pl->last_skill_ob[s]->level) 1077 << uint8 (pl->last_skill_ob[s]->level)
1102 << uint64 (pl->last_skill_ob[s]->stats.exp); 1078 << uint64 (pl->last_skill_ob[s]->stats.exp);
1103 1079
1104 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;
1105 } 1081 }
1106 }
1107 }
1108 1082
1109 if (pl->socket->exp64) 1083 if (pl->ns->exp64)
1110 { 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) }
1111 else 1085 else
1112 { 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) }
1113 1087
1114 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1088 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);
… …
1127 if (pl->run_on) 1101 if (pl->run_on)
1128 flags |= SF_RUNON; 1102 flags |= SF_RUNON;
1129 1103
1130 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1104 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1131 1105
1132 if (pl->socket->sc_version < 1025) 1106 if (pl->ns->sc_version < 1025)
1133 { 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) }
1134 else 1108 else
1135 {
1136 int i;
1137
1138 for (i = 0; i < NROFATTACKS; i++) 1109 for (int i = 0; i < NROFATTACKS; i++)
1139 { 1110 {
1140 /* Skip ones we won't send */ 1111 /* Skip ones we won't send */
1141 if (atnr_cs_stat[i] == -1) 1112 if (atnr_cs_stat[i] == -1)
1142 continue; 1113 continue;
1143 1114
1144 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]);
1145 } 1116 }
1146 }
1147 1117
1148 if (pl->socket->monitor_spells) 1118 if (pl->ns->monitor_spells)
1149 { 1119 {
1150 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);
1151 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);
1152 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);
1153 } 1123 }
1154 1124
1155 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 */
1156 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE); 1126 AddIfString (pl->ns->stats.range, buf, CS_STAT_RANGE);
1157 set_title (pl->ob, buf); 1127 set_title (pl->ob, buf);
1158 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE); 1128 AddIfString (pl->ns->stats.title, buf, CS_STAT_TITLE);
1159 1129
1160 /* Only send it away if we have some actual data */ 1130 /* Only send it away if we have some actual data */
1161 if (sl.length () > 6) 1131 if (sl.length () > 6)
1162 pl->socket->send_packet (sl); 1132 pl->ns->send_packet (sl);
1163} 1133}
1164 1134
1165/** 1135/**
1166 * 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.
1167 */ 1137 */
1168void 1138void
1169esrv_new_player (player *pl, uint32 weight) 1139esrv_new_player (player *pl, uint32 weight)
1170{ 1140{
1171 pl->last_weight = weight; 1141 pl->last_weight = weight;
1172 1142
1173 packet sl; 1143 packet sl ("player");
1174 sl << "player ";
1175 1144
1176 sl << uint32 (pl->ob->count) 1145 sl << uint32 (pl->ob->count)
1177 << uint32 (weight) 1146 << uint32 (weight)
1178 << uint32 (pl->ob->face->number) 1147 << uint32 (pl->ob->face->number)
1179 << data8 (pl->ob->name); 1148 << data8 (pl->ob->name);
1180 1149
1181 pl->socket->send_packet (sl); 1150 pl->ns->send_packet (sl);
1182 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1151 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1183} 1152}
1184 1153
1185/** 1154/**
1186 * Need to send an animation sequence to the client. 1155 * Need to send an animation sequence to the client.
… …
1188 * sent them the face yet (this can become quite costly in terms of 1157 * sent them the face yet (this can become quite costly in terms of
1189 * how much we are sending - on the other hand, this should only happen 1158 * how much we are sending - on the other hand, this should only happen
1190 * when the player logs in and picks stuff up. 1159 * when the player logs in and picks stuff up.
1191 */ 1160 */
1192void 1161void
1193esrv_send_animation (client_socket * ns, short anim_num) 1162esrv_send_animation (client * ns, short anim_num)
1194{ 1163{
1195 int i;
1196
1197 /* 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
1198 * 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
1199 * range, it must be a valid animation. 1166 * range, it must be a valid animation.
1200 */ 1167 */
1201 if (anim_num < 0 || anim_num > num_animations) 1168 if (anim_num < 0 || anim_num > num_animations)
1202 { 1169 {
1203 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);
1204 return; 1171 return;
1205 } 1172 }
1206 1173
1207 packet sl; 1174 packet sl ("anim");
1208 1175
1209 sl << "anim "
1210 << uint16 (anim_num) 1176 sl << uint16 (anim_num)
1211 << uint16 (0); /* flags - not used right now */ 1177 << uint16 (0); /* flags - not used right now */
1212 1178
1213 /* 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
1214 * the face itself) down to the client. 1180 * the face itself) down to the client.
1215 */ 1181 */
1216 for (i = 0; i < animations[anim_num].num_animations; i++) 1182 for (int i = 0; i < animations[anim_num].num_animations; i++)
1217 { 1183 {
1218 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))
1219 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1185 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1186
1220 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 */
1221 } 1188 }
1222 1189
1223 ns->send_packet (sl); 1190 ns->send_packet (sl);
1224 1191
… …
1235/** 1202/**
1236 * This adds face_num to a map cell at x,y. If the client doesn't have 1203 * This adds face_num to a map cell at x,y. If the client doesn't have
1237 * the face yet, we will also send it. 1204 * the face yet, we will also send it.
1238 */ 1205 */
1239static void 1206static void
1240esrv_map_setbelow (client_socket * 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)
1241{ 1208{
1242 if (newmap->cells[x][y].count >= MAP_LAYERS) 1209 if (newmap->cells[x][y].count >= MAP_LAYERS)
1243 { 1210 {
1211 //TODO: one or the other, can't both have abort and return, verify and act
1244 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);
1245 return; 1213 return;
1246 abort (); 1214 abort ();
1247 } 1215 }
1248 1216
1249 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;
1250 newmap->cells[x][y].count++; 1218 newmap->cells[x][y].count++;
1251 1219
1252 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1220 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1253 esrv_send_face (ns, face_num, 0); 1221 esrv_send_face (ns, face_num, 0);
1254}
1255
1256struct LayerCell
1257{
1258 uint16 xy;
1259 short face;
1260};
1261
1262struct MapLayer
1263{
1264 int count;
1265 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1266};
1267
1268/** Checkes if map cells have changed */
1269static int
1270mapcellchanged (client_socket * ns, int i, int j, struct Map *newmap)
1271{
1272 int k;
1273
1274 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1275 return 1;
1276 for (k = 0; k < newmap->cells[i][j].count; k++)
1277 {
1278 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1279 {
1280 return 1;
1281 }
1282 }
1283 return 0;
1284}
1285
1286/**
1287 * Basically, what this does is pack the data into layers.
1288 * cnum is the client number, cur is the the buffer we put all of
1289 * this data into. we return the end of the data. layers is
1290 * how many layers of data we should back.
1291 */
1292static uint8 *
1293compactlayer (client_socket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1294{
1295 int x, y, k;
1296 int face;
1297 unsigned char *fcur;
1298 struct MapLayer layers[MAP_LAYERS];
1299
1300 for (k = 0; k < MAP_LAYERS; k++)
1301 layers[k].count = 0;
1302 fcur = cur;
1303 for (x = 0; x < ns->mapx; x++)
1304 {
1305 for (y = 0; y < ns->mapy; y++)
1306 {
1307 if (!mapcellchanged (ns, x, y, newmap))
1308 continue;
1309 if (newmap->cells[x][y].count == 0)
1310 {
1311 *cur = x * ns->mapy + y; /* mark empty space */
1312 cur++;
1313 continue;
1314 }
1315 for (k = 0; k < newmap->cells[x][y].count; k++)
1316 {
1317 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1318 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1319 layers[k].count++;
1320 }
1321 }
1322 }
1323 /* If no data, return now. */
1324 if (fcur == cur && layers[0].count == 0)
1325 return cur;
1326 *cur = 255; /* mark end of explicitly cleared cells */
1327 cur++;
1328 /* First pack by layers. */
1329 for (k = 0; k < numlayers; k++)
1330 {
1331 if (layers[k].count == 0)
1332 break; /* once a layer is entirely empty, no layer below it can
1333 have anything in it either */
1334 /* Pack by entries in thie layer */
1335 for (x = 0; x < layers[k].count;)
1336 {
1337 fcur = cur;
1338 *cur = layers[k].lcells[x].face >> 8;
1339 cur++;
1340 *cur = layers[k].lcells[x].face & 0xFF;
1341 cur++;
1342 face = layers[k].lcells[x].face;
1343 /* Now, we back the redundant data into 1 byte xy pairings */
1344 for (y = x; y < layers[k].count; y++)
1345 {
1346 if (layers[k].lcells[y].face == face)
1347 {
1348 *cur = (uint8) layers[k].lcells[y].xy;
1349 cur++;
1350 layers[k].lcells[y].face = -1;
1351 }
1352 }
1353 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1354 /* forward over the now redundant data */
1355 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1356 x++;
1357 }
1358 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1359 }
1360 return cur;
1361} 1222}
1362 1223
1363/** Clears a map cell */ 1224/** Clears a map cell */
1364static void 1225static void
1365map_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)
… …
1377#define MAX_LAYERS 3 1238#define MAX_LAYERS 3
1378 1239
1379/* 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
1380 * 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,
1381 * 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
1382 * 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
1383 * re-examined. 1244 * re-examined.
1384 */ 1245 */
1385
1386static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1246static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1387 1247
1388/** 1248/**
1389 * Returns true if any of the heads for this 1249 * Returns true if any of the heads for this
1390 * 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
1391 * for empty space checking. 1251 * for empty space checking.
1392 */ 1252 */
1393static inline int 1253static inline int
1394have_head (int ax, int ay) 1254have_head (int ax, int ay)
1395{ 1255{
1396
1397 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1256 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1398 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])
1399 return 1; 1258 return 1;
1259
1400 return 0; 1260 return 0;
1401} 1261}
1402 1262
1403/** 1263/**
1404 * check_head is a bit simplistic version of update_space below. 1264 * check_head is a bit simplistic version of update_space below.
1405 * 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
1406 * 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
1407 * 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
1408 * sent, it returns zero. 1268 * sent, it returns zero.
1409 */ 1269 */
1410static int 1270static int
1411check_head (packet &sl, client_socket &ns, int ax, int ay, int layer) 1271check_head (packet &sl, client &ns, int ax, int ay, int layer)
1412{ 1272{
1413 short face_num; 1273 short face_num;
1414 1274
1415 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) 1275 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1416 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; 1276 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
… …
1448 * numbers the spaces differently - I think this was a leftover from 1308 * numbers the spaces differently - I think this was a leftover from
1449 * 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
1450 * 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
1451 * actually match. 1311 * actually match.
1452 */ 1312 */
1453
1454static int 1313static int
1455update_space (packet &sl, client_socket &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)
1456{ 1315{
1457 object *ob, *head; 1316 object *ob, *head;
1458 uint16 face_num; 1317 uint16 face_num;
1459 int bx, by, i; 1318 int bx, by, i;
1460 1319
… …
1673 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ 1532 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1674 * take. 1533 * take.
1675 */ 1534 */
1676 1535
1677static inline int 1536static inline int
1678update_smooth (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1537update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1679{ 1538{
1680 object *ob; 1539 object *ob;
1681 int smoothlevel; /* old face_num; */ 1540 int smoothlevel; /* old face_num; */
1682 1541
1683 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1542 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
… …
1717 * Returns the size of a data for a map square as returned by 1576 * Returns the size of a data for a map square as returned by
1718 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1577 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1719 * available. 1578 * available.
1720 */ 1579 */
1721int 1580int
1722getExtendedMapInfoSize (client_socket * ns) 1581getExtendedMapInfoSize (client * ns)
1723{ 1582{
1724 int result = 0; 1583 int result = 0;
1725 1584
1726 if (ns->ext_mapinfos) 1585 if (ns->ext_mapinfos)
1727 { 1586 {
1728 if (ns->EMI_smooth) 1587 if (ns->EMI_smooth)
1729 result += 1; /*One byte for smoothlevel */ 1588 result += 1; /*One byte for smoothlevel */
1730 } 1589 }
1590
1731 return result; 1591 return result;
1732} 1592}
1733 1593
1734/** 1594/**
1735 * 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
… …
1742 * 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
1743 * 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,
1744 * 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
1745 * of what we send, see the doc/Protocol file. 1605 * of what we send, see the doc/Protocol file.
1746 * I will describe internally what we do: 1606 * I will describe internally what we do:
1747 * 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.
1748 * 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
1749 * maximum viewable size (As set in config.h). 1609 * maximum viewable size (As set in config.h).
1750 * in the cells, there are faces and a count value. 1610 * in the cells, there are faces and a count value.
1751 * 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
1752 * is not viewable. 1612 * is not viewable.
… …
1763 uint8 eentrysize; 1623 uint8 eentrysize;
1764 uint16 ewhatstart, ewhatflag; 1624 uint16 ewhatstart, ewhatflag;
1765 uint8 extendedinfos; 1625 uint8 extendedinfos;
1766 maptile *m; 1626 maptile *m;
1767 1627
1768 client_socket &socket = *pl->contr->socket; 1628 client &socket = *pl->contr->ns;
1769 1629
1770 check_map_change (pl->contr); 1630 check_map_change (pl->contr);
1771 1631
1772 packet sl; 1632 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1773 packet esl; 1633 packet esl;
1774 1634
1775 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1776 startlen = sl.length (); 1635 startlen = sl.length ();
1777 1636
1778 /*Extendedmapinfo structure initialisation */ 1637 /*Extendedmapinfo structure initialisation */
1779 if (socket.ext_mapinfos) 1638 if (socket.ext_mapinfos)
1780 { 1639 {
… …
1824 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++)
1825 { 1684 {
1826 ax = 0; 1685 ax = 0;
1827 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++)
1828 { 1687 {
1829
1830 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1688 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1831 1689
1832 /* 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
1833 * 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
1834 * the client wants if using the map1a command - this is because 1692 * the client wants if using the map1a command - this is because
… …
2164 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 2022 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2165 return; 2023 return;
2166 2024
2167 memset (&newmap, 0, sizeof (struct Map)); 2025 memset (&newmap, 0, sizeof (struct Map));
2168 2026
2169 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++)
2170 {
2171 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++)
2172 { 2029 {
2173 ax = i; 2030 ax = i;
2174 ay = j; 2031 ay = j;
2175 m = pm; 2032 m = pm;
2176 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2033 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2034
2177 if (mflags & P_OUT_OF_MAP) 2035 if (mflags & P_OUT_OF_MAP)
2178 continue; 2036 continue;
2179 if (mflags & P_NEED_UPDATE) 2037
2180 update_position (m, ax, ay);
2181 /* 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
2182 * just to reload it. This should really call something like 2039 * just to reload it. This should really call something like
2183 * swap_map, but this is much more efficient and 'good enough' 2040 * swap_map, but this is much more efficient and 'good enough'
2184 */ 2041 */
2185 if (mflags & P_NEW_MAP) 2042 if (mflags & P_NEW_MAP)
2186 m->timeout = 50; 2043 m->timeout = 50;
2187 } 2044 }
2188 } 2045
2189 /* do LOS after calls to update_position */ 2046 /* do LOS after calls to update_position */
2190 if (pl->contr->do_los) 2047 if (pl->contr->do_los)
2191 { 2048 {
2192 update_los (pl); 2049 update_los (pl);
2193 pl->contr->do_los = 0; 2050 pl->contr->do_los = 0;
… …
2208 2065
2209/*****************************************************************************/ 2066/*****************************************************************************/
2210void 2067void
2211send_plugin_custom_message (object *pl, char *buf) 2068send_plugin_custom_message (object *pl, char *buf)
2212{ 2069{
2213 pl->contr->socket->send_packet (buf); 2070 pl->contr->ns->send_packet (buf);
2214} 2071}
2215 2072
2216/** 2073/**
2217 * This sends the skill number to name mapping. We ignore 2074 * This sends the skill number to name mapping. We ignore
2218 * the params - we always send the same info no matter what. 2075 * the params - we always send the same info no matter what.
2219 */ 2076 */
2220void 2077void
2221send_skill_info (client_socket *ns, char *params) 2078send_skill_info (client *ns, char *params)
2222{ 2079{
2223 packet sl; 2080 packet sl;
2224 sl << "replyinfo skill_info\n"; 2081 sl << "replyinfo skill_info\n";
2225 2082
2226 for (int i = 1; i < NUM_SKILLS; i++) 2083 for (int i = 1; i < NUM_SKILLS; i++)
… …
2238/** 2095/**
2239 * This sends the spell path to name mapping. We ignore 2096 * This sends the spell path to name mapping. We ignore
2240 * the params - we always send the same info no matter what. 2097 * the params - we always send the same info no matter what.
2241 */ 2098 */
2242void 2099void
2243send_spell_paths (client_socket * ns, char *params) 2100send_spell_paths (client * ns, char *params)
2244{ 2101{
2245 packet sl; 2102 packet sl;
2246 2103
2247 sl << "replyinfo spell_paths\n"; 2104 sl << "replyinfo spell_paths\n";
2248 2105
… …
2263 * 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
2264 */ 2121 */
2265void 2122void
2266esrv_update_spells (player *pl) 2123esrv_update_spells (player *pl)
2267{ 2124{
2268 if (!pl->socket->monitor_spells) 2125 if (!pl->ns->monitor_spells)
2269 return; 2126 return;
2270 2127
2271 for (object *spell = pl->ob->inv; spell; spell = spell->below) 2128 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2272 { 2129 {
2273 if (spell->type == SPELL) 2130 if (spell->type == SPELL)
… …
2303 2160
2304 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 2161 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2305 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 2162 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2306 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 2163 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2307 2164
2308 pl->socket->send_packet (sl); 2165 pl->ns->send_packet (sl);
2309 } 2166 }
2310 } 2167 }
2311 } 2168 }
2312} 2169}
2313 2170
2314void 2171void
2315esrv_remove_spell (player *pl, object *spell) 2172esrv_remove_spell (player *pl, object *spell)
2316{ 2173{
2317 if (!pl->socket->monitor_spells) 2174 if (!pl->ns->monitor_spells)
2318 return; 2175 return;
2319 2176
2320 if (!pl || !spell || spell->env != pl->ob) 2177 if (!pl || !spell || spell->env != pl->ob)
2321 { 2178 {
2322 LOG (llevError, "Invalid call to esrv_remove_spell"); 2179 LOG (llevError, "Invalid call to esrv_remove_spell");
2323 return; 2180 return;
2324 } 2181 }
2325 2182
2326 packet sl; 2183 packet sl ("delspell");
2327 2184
2328 sl << "delspell "
2329 << uint32 (spell->count); 2185 sl << uint32 (spell->count);
2330 2186
2331 pl->socket->send_packet (sl); 2187 pl->ns->send_packet (sl);
2332} 2188}
2333 2189
2334/* 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. */
2335static void 2191static void
2336append_spell (player *pl, packet &sl, object *spell) 2192append_spell (player *pl, packet &sl, object *spell)
… …
2384 { 2240 {
2385 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");
2386 return; 2242 return;
2387 } 2243 }
2388 2244
2389 if (!pl->socket->monitor_spells) 2245 if (!pl->ns->monitor_spells)
2390 return; 2246 return;
2391 2247
2392 packet sl; 2248 packet sl ("addspell");
2393
2394 sl << "addspell ";
2395 2249
2396 if (!spell) 2250 if (!spell)
2397 { 2251 {
2398 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2252 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
2399 { 2253 {
… …
2413 if (spell->type != SPELL) 2267 if (spell->type != SPELL)
2414 continue; 2268 continue;
2415 2269
2416 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))))
2417 { 2271 {
2418 pl->socket->send_packet (sl); 2272 pl->ns->send_packet (sl);
2419 2273
2420 sl.reset (); 2274 sl.reset ();
2421 sl << "addspell "; 2275 sl << "addspell ";
2422 } 2276 }
2423 2277
… …
2437 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 2291 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2438 fatal (0); 2292 fatal (0);
2439 } 2293 }
2440 2294
2441 /* finally, we can send the packet */ 2295 /* finally, we can send the packet */
2442 pl->socket->send_packet (sl); 2296 pl->ns->send_packet (sl);
2443} 2297}
2444 2298

Diff Legend

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