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.35 by root, Thu Dec 14 02:37:37 2006 UTC vs.
Revision 1.50 by root, Thu Dec 21 23:37:06 2006 UTC

… …
38 * esrv_map_new starts updating the map 38 * esrv_map_new starts updating the map
39 * 39 *
40 * esrv_map_setbelow allows filling in all of the faces for the map. 40 * esrv_map_setbelow allows filling in all of the faces for the map.
41 * if a face has not already been sent to the client, it is sent now. 41 * if a face has not already been sent to the client, it is sent now.
42 * 42 *
43 * mapcellchanged, compactlayer, compactstack, perform the map compressing
44 * operations
45 *
46 */ 43 */
47 44
48#include <global.h> 45#include <global.h>
49#include <sproto.h> 46#include <sproto.h>
50 47
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.
… …
60#include <sys/time.h> 55#include <sys/time.h>
61#include <sys/socket.h> 56#include <sys/socket.h>
62#include <netinet/in.h> 57#include <netinet/in.h>
63#include <netdb.h> 58#include <netdb.h>
64 59
65#ifdef HAVE_UNISTD_H
66# include <unistd.h> 60#include <unistd.h>
67#endif
68
69#ifdef HAVE_SYS_TIME_H
70# include <sys/time.h> 61#include <sys/time.h>
71#endif
72 62
73#include "sounds.h" 63#include "sounds.h"
74 64
75/** 65/**
76 * This table translates the attack numbers as used within the 66 * This table translates the attack numbers as used within the
… …
93 -1, /* life stealing */ 83 -1, /* life stealing */
94 -1 /* Disease - not fully done yet */ 84 -1 /* Disease - not fully done yet */
95}; 85};
96 86
97static void 87static void
98socket_map_scroll (client_socket * ns, int dx, int dy) 88socket_map_scroll (client *ns, int dx, int dy)
99{ 89{
100 struct Map newmap; 90 struct Map newmap;
101 int x, y, mx, my; 91 int x, y, mx, my;
102 92
103 {
104 packet sl;
105
106 sl.printf ("map_scroll %d %d", dx, dy); 93 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
107 ns->send_packet (sl);
108 }
109 94
110 /* If we are using the Map1aCmd, we may in fact send 95 /* If we are using the Map1aCmd, we may in fact send
111 * head information that is outside the viewable map. 96 * head information that is outside the viewable map.
112 * 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
113 * look for. Removed code to do so - it caused extra 98 * look for. Removed code to do so - it caused extra
… …
153} 138}
154 139
155static void 140static void
156clear_map (player *pl) 141clear_map (player *pl)
157{ 142{
158 client_socket & socket = pl->socket;
159
160 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 143 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
161 144
162 if (socket.newmapcmd == 1) 145 if (pl->ns->newmapcmd == 1)
163 socket.send_packet ("newmap"); 146 pl->ns->send_packet ("newmap");
164 147
165 socket.update_look = 1; 148 pl->ns->floorbox_reset ();
166 socket.look_position = 0;
167} 149}
168 150
169/** check for map change and send new map data */ 151/** check for map change and send new map data */
170static void 152static void
171check_map_change (player *pl) 153check_map_change (player *pl)
172{ 154{
173 client_socket & socket = pl->socket; 155 client &socket = *pl->ns;
174 object *ob = pl->ob; 156 object *ob = pl->ob;
175 char buf[MAX_BUF]; /* eauugggh */ 157 char buf[MAX_BUF]; /* eauugggh */
176 158
177 if (socket.current_map != ob->map) 159 if (socket.current_map != ob->map)
178 { 160 {
… …
212 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 194 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
213 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
214 else 196 else
215 { 197 {
216 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);
217 socket.update_look = 1; 199 socket.floorbox_reset ();
218 socket.look_position = 0;
219 } 200 }
220 } 201 }
221 202
222 socket.current_x = ob->x; 203 socket.current_x = ob->x;
223 socket.current_y = ob->y; 204 socket.current_y = ob->y;
224} 205}
225 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
226void 251void
227ExtCmd (char *buf, int len, player *pl) 252ExtCmd (char *buf, int len, player *pl)
228{ 253{
229 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));
230} 261}
231 262
232void 263void
233MapInfoCmd (char *buf, int len, player *pl) 264MapInfoCmd (char *buf, int len, player *pl)
234{ 265{
… …
249 buf += 8; 280 buf += 8;
250 281
251 // initial map and its origin 282 // initial map and its origin
252 maptile *map = pl->ob->map; 283 maptile *map = pl->ob->map;
253 sint16 dx, dy; 284 sint16 dx, dy;
254 int mapx = pl->socket.mapx / 2 - pl->ob->x; 285 int mapx = pl->ns->mapx / 2 - pl->ob->x;
255 int mapy = pl->socket.mapy / 2 - pl->ob->y; 286 int mapy = pl->ns->mapy / 2 - pl->ob->y;
256 int max_distance = 8; // limit maximum path length to something generous 287 int max_distance = 8; // limit maximum path length to something generous
257 288
258 while (*buf && map && max_distance) 289 while (*buf && map && max_distance)
259 { 290 {
260 int dir = *buf++; 291 int dir = *buf++;
… …
311 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 342 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
312 } 343 }
313 else 344 else
314 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 345 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
315 346
316 pl->socket.send_packet (bigbuf); 347 pl->ns->send_packet (bigbuf);
317} 348}
318 349
319/** This is the Setup cmd - easy first implementation */ 350/** This is the Setup cmd - easy first implementation */
320void 351void
321SetUp (char *buf, int len, client_socket * ns) 352SetUp (char *buf, int len, client * ns)
322{ 353{
323 int s, slen; 354 int s, slen;
324 char *cmd, *param, cmdback[HUGE_BUF]; 355 char *cmd, *param, cmdback[HUGE_BUF];
325 356
326 /* run through the cmds of setup 357 /* run through the cmds of setup
… …
536 * 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.
537 * 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,
538 * 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.
539 */ 570 */
540void 571void
541AddMeCmd (char *buf, int len, client_socket * ns) 572AddMeCmd (char *buf, int len, client * ns)
542{ 573{
543 Settings oldsettings; 574 if (INVOKE_CLIENT (ADDME, ns))
575 return;
544 576
545 oldsettings = settings;
546 if (ns->status != Ns_Add || add_player (ns)) 577 if (ns->pl || add_player (ns))
547 ns->send_packet ("addme_failed"); 578 ns->send_packet ("addme_failed");
548 else 579 else
549 {
550 /* Basically, the add_player copies the socket structure into
551 * the player structure, so this one (which is from init_sockets)
552 * is not needed anymore. The write below should still work, as the
553 * stuff in ns is still relevant.
554 */
555 ns->send_packet ("addme_success"); 580 ns->send_packet ("addme_success");
556 socket_info.nconns--;
557 ns->status = Ns_Avail;
558 }
559
560 settings = oldsettings;
561} 581}
562 582
563/** Reply to ExtendedInfos command */ 583/** Reply to ExtendedInfos command */
564void 584void
565ToggleExtendedInfos (char *buf, int len, client_socket * ns) 585ToggleExtendedInfos (char *buf, int len, client * ns)
566{ 586{
567 char cmdback[MAX_BUF]; 587 char cmdback[MAX_BUF];
568 char command[50]; 588 char command[50];
569 int info, nextinfo; 589 int info, nextinfo;
570 590
… …
621#define MSG_TYPE_MONUMENT 5 641#define MSG_TYPE_MONUMENT 5
622#define MSG_TYPE_SCRIPTED_DIALOG 6*/ 642#define MSG_TYPE_SCRIPTED_DIALOG 6*/
623 643
624/** Reply to ExtendedInfos command */ 644/** Reply to ExtendedInfos command */
625void 645void
626ToggleExtendedText (char *buf, int len, client_socket * ns) 646ToggleExtendedText (char *buf, int len, client * ns)
627{ 647{
628 char cmdback[MAX_BUF]; 648 char cmdback[MAX_BUF];
629 char temp[10]; 649 char temp[10];
630 char command[50]; 650 char command[50];
631 int info, nextinfo, i, flag; 651 int info, nextinfo, i, flag;
… …
682 * 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
683 * 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
684 * client. 704 * client.
685 */ 705 */
686static void 706static void
687SendSmooth (client_socket * ns, uint16 face) 707SendSmooth (client *ns, uint16 face)
688{ 708{
689 uint16 smoothface; 709 uint16 smoothface;
690 710
691 /* 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
692 * again. 712 * again.
… …
702 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) 722 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
703 esrv_send_face (ns, smoothface, 0); 723 esrv_send_face (ns, smoothface, 0);
704 724
705 ns->faces_sent[face] |= NS_FACESENT_SMOOTH; 725 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
706 726
707 packet sl; 727 packet sl ("smooth");
708 728
709 sl << "smooth "
710 << uint16 (face) 729 sl << uint16 (face)
711 << uint16 (smoothface); 730 << uint16 (smoothface);
712 731
713 Send_With_Handling (ns, &sl); 732 ns->send_packet (sl);
714} 733}
715 734
716 /** 735 /**
717 * Tells client the picture it has to use 736 * Tells client the picture it has to use
718 * to smooth a picture number given as argument. 737 * to smooth a picture number given as argument.
719 */ 738 */
720void 739void
721AskSmooth (char *buf, int len, client_socket * ns) 740AskSmooth (char *buf, int len, client *ns)
722{ 741{
723 uint16 facenbr; 742 SendSmooth (ns, atoi (buf));
724
725 facenbr = atoi (buf);
726 SendSmooth (ns, facenbr);
727} 743}
728 744
729/** 745/**
730 * 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,
731 * etc.) 747 * etc.)
732 */ 748 */
733void 749void
734PlayerCmd (char *buf, int len, player *pl) 750PlayerCmd (char *buf, int len, player *pl)
735{ 751{
736
737 /* The following should never happen with a proper or honest client.
738 * Therefore, the error message doesn't have to be too clear - if
739 * someone is playing with a hacked/non working client, this gives them
740 * an idea of the problem, but they deserve what they get
741 */
742 if (pl->state != ST_PLAYING)
743 {
744 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
745 return;
746 }
747 /* 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
748 * sent, so check for that also. 753 * sent, so check for that also.
749 */ 754 */
750 if (atoi (buf) || buf[0] == '0') 755 if (atoi (buf) || buf[0] == '0')
751 { 756 {
752 pl->count = atoi ((char *) buf); 757 pl->count = atoi ((char *) buf);
758
753 buf = strchr (buf, ' '); /* advance beyond the numbers */ 759 buf = strchr (buf, ' '); /* advance beyond the numbers */
754 if (!buf) 760 if (!buf)
755 {
756#ifdef ESRV_DEBUG
757 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
758#endif
759 return; 761 return;
760 } 762
761 buf++; 763 buf++;
762 } 764 }
763 /* This should not happen anymore. */ 765
764 if (pl->ob->speed_left < -1.0)
765 {
766 LOG (llevError, "Player has negative time - shouldn't do command.\n");
767 }
768 /* In c_new.c */
769 execute_newserver_command (pl->ob, (char *) buf); 766 execute_newserver_command (pl->ob, (char *) buf);
767
770 /* Perhaps something better should be done with a left over count. 768 /* Perhaps something better should be done with a left over count.
771 * Cleaning up the input should probably be done first - all actions 769 * Cleaning up the input should probably be done first - all actions
772 * 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
773 * commands. 771 * commands.
774 */ 772 */
775
776 pl->count = 0; 773 pl->count = 0;
777
778} 774}
779 775
780 776
781/** 777/**
782 * 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,
783 * etc.). It is a lot like PlayerCmd above, but is called with the 779 * etc.). It is a lot like PlayerCmd above, but is called with the
784 * 'ncom' method which gives more information back to the client so it 780 * 'ncom' method which gives more information back to the client so it
785 * can throttle. 781 * can throttle.
786 */ 782 */
787void 783void
788NewPlayerCmd (uint8 * buf, int len, player *pl) 784NewPlayerCmd (char *buf, int len, player *pl)
789{ 785{
790 int time, repeat;
791 char command[MAX_BUF];
792 int pktlen;
793
794 if (len < 7) 786 if (len <= 6)
795 { 787 {
796 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);
797 return; 789 return;
798 } 790 }
799 791
800 pktlen = net_uint16 (buf); 792 uint16 cmdid = net_uint16 ((uint8 *)buf);
801 repeat = net_uint32 (buf + 2); 793 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
802 794
803 /* -1 is special - no repeat, but don't update */ 795 /* -1 is special - no repeat, but don't update */
804 if (repeat != -1) 796 if (repeat != -1)
805 pl->count = repeat; 797 pl->count = repeat;
806 798
807 if ((len - 4) >= MAX_BUF) 799 buf += 6; //len -= 6;
808 len = MAX_BUF - 5;
809 800
810 strncpy ((char *) command, (char *) buf + 6, len - 4);
811 command[len - 4] = '\0';
812
813 /* The following should never happen with a proper or honest client.
814 * Therefore, the error message doesn't have to be too clear - if
815 * someone is playing with a hacked/non working client, this gives them
816 * an idea of the problem, but they deserve what they get
817 */
818 if (pl->state != ST_PLAYING)
819 {
820 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
821 return;
822 }
823
824 /* This should not happen anymore. */
825 if (pl->ob->speed_left < -1.0)
826 LOG (llevError, "Player has negative time - shouldn't do command.\n");
827
828 /* In c_new.c */
829 execute_newserver_command (pl->ob, (char *) command); 801 execute_newserver_command (pl->ob, buf);
802
830 /* Perhaps something better should be done with a left over count. 803 /* Perhaps something better should be done with a left over count.
831 * Cleaning up the input should probably be done first - all actions 804 * Cleaning up the input should probably be done first - all actions
832 * 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
833 * commands. 806 * commands.
834 */ 807 */
835 pl->count = 0; 808 pl->count = 0;
836 809
810 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
837 if (FABS (pl->ob->speed) < 0.001) 811 int time = FABS (pl->ob->speed) < 0.001
838 time = MAX_TIME * 100; 812 ? time = MAX_TIME * 100
839 else
840 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 813 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
841 814
842 /* Send confirmation of command execution now */ 815 /* Send confirmation of command execution now */
843 816 packet sl ("comc");
844 packet sl;
845 sl << "comc " << uint16 (pktlen) << uint32 (time); 817 sl << uint16 (cmdid) << uint32 (time);
846 Send_With_Handling (&pl->socket, &sl); 818 pl->ns->send_packet (sl);
847} 819}
848
849 820
850/** This is a reply to a previous query. */ 821/** This is a reply to a previous query. */
851void 822void
852ReplyCmd (char *buf, int len, player *pl) 823ReplyCmd (char *buf, int len, client *ns)
853{ 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
854 /* 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
855 * 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
856 * once all the X11 code is removed from the server. 839 * once all the X11 code is removed from the server.
857 * 840 *
858 * 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
859 * think it was the carriage return that was entered, and the 842 * think it was the carriage return that was entered, and the
860 * function then does not try to do additional input. 843 * function then does not try to do additional input.
861 */ 844 */
862 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); 845 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
863 846
864 /* this avoids any hacking here */ 847 /* this avoids any hacking here */
865 848
866 switch (pl->state) 849 switch (ns->state)
867 { 850 {
868 case ST_PLAYING: 851 case ST_PLAYING:
869 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 852 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
870 break; 853 break;
871 854
872 case ST_PLAY_AGAIN: 855 case ST_PLAY_AGAIN:
873 /* We can check this for return value (2==quit). Maybe we 856 /* We can check this for return value (2==quit). Maybe we
874 * should, and do something appropriate? 857 * should, and do something appropriate?
875 */ 858 */
876 receive_play_again (pl->ob, buf[0]); 859 receive_play_again (pl->ob, buf[0]);
877 break; 860 break;
878 861
879 case ST_ROLL_STAT: 862 case ST_ROLL_STAT:
880 key_roll_stat (pl->ob, buf[0]); 863 key_roll_stat (pl->ob, buf[0]);
881 break; 864 break;
882 865
883 case ST_CHANGE_CLASS: 866 case ST_CHANGE_CLASS:
884
885 key_change_class (pl->ob, buf[0]); 867 key_change_class (pl->ob, buf[0]);
886 break; 868 break;
887 869
888 case ST_CONFIRM_QUIT: 870 case ST_CONFIRM_QUIT:
889 key_confirm_quit (pl->ob, buf[0]); 871 key_confirm_quit (pl->ob, buf[0]);
890 break; 872 break;
891 873
892 case ST_CONFIGURE: 874 case ST_CONFIGURE:
893 LOG (llevError, "In client input handling, but into configure state\n"); 875 LOG (llevError, "In client input handling, but into configure state\n");
894 pl->state = ST_PLAYING; 876 ns->state = ST_PLAYING;
895 break; 877 break;
896 878
897 case ST_GET_NAME: 879 case ST_GET_NAME:
898 receive_player_name (pl->ob, 13); 880 receive_player_name (pl->ob, 13);
899 break; 881 break;
900 882
901 case ST_GET_PASSWORD: 883 case ST_GET_PASSWORD:
902 case ST_CONFIRM_PASSWORD: 884 case ST_CONFIRM_PASSWORD:
903 receive_player_password (pl->ob, 13); 885 receive_player_password (pl->ob, 13);
904 break; 886 break;
905 887
906 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 888 case ST_GET_PARTY_PASSWORD: /* Get password for party */
907 receive_party_password (pl->ob, 13); 889 receive_party_password (pl->ob, 13);
908 break; 890 break;
909 891
910 default: 892 default:
911 LOG (llevError, "Unknown input state: %d\n", pl->state); 893 LOG (llevError, "Unknown input state: %d\n", ns->state);
912 } 894 }
913} 895}
914 896
915/** 897/**
916 * 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
… …
918 * 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
919 * 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
920 * problem. 902 * problem.
921 */ 903 */
922void 904void
923VersionCmd (char *buf, int len, client_socket * ns) 905VersionCmd (char *buf, int len, client * ns)
924{ 906{
925 char *cp;
926 char version_warning[256];
927
928 if (!buf) 907 if (!buf)
929 { 908 {
930 LOG (llevError, "CS: received corrupted version command\n"); 909 LOG (llevError, "CS: received corrupted version command\n");
931 return; 910 return;
932 } 911 }
933 912
934 ns->cs_version = atoi (buf); 913 ns->cs_version = atoi (buf);
935 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
936 if (VERSION_CS != ns->cs_version) 921 //if (VERSION_CS != ns->cs_version)
937 { 922 // unchecked;
938#ifdef ESRV_DEBUG 923
939 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
940#endif
941 }
942 cp = strchr (buf + 1, ' '); 924 char *cp = strchr (buf + 1, ' ');
943 if (!cp) 925 if (!cp)
944 return; 926 return;
927
945 ns->sc_version = atoi (cp); 928 ns->sc_version = atoi (cp);
929
946 if (VERSION_SC != ns->sc_version) 930 //if (VERSION_SC != ns->sc_version)
947 { 931 // unchecked;
948#ifdef ESRV_DEBUG 932
949 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
950#endif
951 }
952 cp = strchr (cp + 1, ' '); 933 cp = strchr (cp + 1, ' ');
934
953 if (cp) 935 if (cp)
954 { 936 {
955 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 937 assign (ns->version, cp + 1);
956 938
957 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1);
958
959 /* This is first implementation - i skip all beta DX clients with it
960 * Add later stuff here for other clients
961 */
962
963 /* these are old dxclients */
964 /* Version 1024 added support for singular + plural name values -
965 * requiing this minimal value reduces complexity of that code, and it
966 * has been around for a long time.
967 */
968 if (ns->sc_version < 1026) 939 if (ns->sc_version < 1026)
969 { 940 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
970 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
971 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 941 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
972 ns->send_packet (version_warning);
973 }
974
975 } 942 }
976} 943}
977 944
978/** sound related functions. */ 945/** sound related functions. */
979
980void 946void
981SetSound (char *buf, int len, client_socket * ns) 947SetSound (char *buf, int len, client * ns)
982{ 948{
983 ns->sound = atoi (buf); 949 ns->sound = atoi (buf);
984} 950}
985 951
986/** client wants the map resent */ 952/** client wants the map resent */
987 953
988void 954void
989MapRedrawCmd (char *buf, int len, player *pl) 955MapRedrawCmd (char *buf, int len, player *pl)
990{ 956{
991
992/* 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
993 * 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.
994 * Unfortunately this solution does not work because some client versions send 959 * Unfortunately this solution does not work because some client versions send
995 * a mapredraw command after receiving a newmap command. 960 * a mapredraw command after receiving a newmap command.
996 */ 961 */
997#if 0
998 /* Okay, this is MAJOR UGLY. but the only way I know how to
999 * clear the "cache"
1000 */
1001 memset (&pl->socket.lastmap, 0, sizeof (struct Map));
1002 draw_client_map (pl->ob);
1003#endif
1004} 962}
1005 963
1006/** 964/**
1007 * Moves an object (typically, container to inventory). 965 * Moves an object (typically, container to inventory).
1008 * syntax is: move (to) (tag) (nrof) 966 * syntax is: move (to) (tag) (nrof)
… …
1011MoveCmd (char *buf, int len, player *pl) 969MoveCmd (char *buf, int len, player *pl)
1012{ 970{
1013 int vals[3], i; 971 int vals[3], i;
1014 972
1015 /* A little funky here. We only cycle for 2 records, because 973 /* A little funky here. We only cycle for 2 records, because
1016 * 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
1017 * record. Perhaps we should just replace this with a 975 * record. Perhaps we should just replace this with a
1018 * sscanf? 976 * sscanf?
1019 */ 977 */
1020 for (i = 0; i < 2; i++) 978 for (i = 0; i < 2; i++)
1021 { 979 {
1022 vals[i] = atoi (buf); 980 vals[i] = atoi (buf);
981
1023 if (!(buf = strchr (buf, ' '))) 982 if (!(buf = strchr (buf, ' ')))
1024 { 983 {
1025 LOG (llevError, "Incomplete move command: %s\n", buf); 984 LOG (llevError, "Incomplete move command: %s\n", buf);
1026 return; 985 return;
1027 } 986 }
987
1028 buf++; 988 buf++;
1029 } 989 }
990
1030 vals[2] = atoi (buf); 991 vals[2] = atoi (buf);
1031 992
1032/* 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]);*/
1033 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 994 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1034} 995}
1035
1036
1037 996
1038/****************************************************************************** 997/******************************************************************************
1039 * 998 *
1040 * Start of commands the server sends to the client. 999 * Start of commands the server sends to the client.
1041 * 1000 *
… …
1044/** 1003/**
1045 * 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
1046 * 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)
1047 */ 1006 */
1048void 1007void
1049send_query (client_socket * ns, uint8 flags, char *text) 1008send_query (client *ns, uint8 flags, char *text)
1050{ 1009{
1051 char buf[MAX_BUF];
1052
1053 sprintf (buf, "query %d %s", flags, text ? text : ""); 1010 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1054 ns->send_packet (buf);
1055} 1011}
1056 1012
1057#define AddIfInt64(Old,New,Type) if (Old != New) {\ 1013#define AddIfInt64(Old,New,Type) if (Old != New) {\
1058 Old = New; \ 1014 Old = New; \
1059 sl << uint8 (Type) << uint64 (New); \ 1015 sl << uint8 (Type) << uint64 (New); \
… …
1089esrv_update_stats (player *pl) 1045esrv_update_stats (player *pl)
1090{ 1046{
1091 char buf[MAX_BUF]; 1047 char buf[MAX_BUF];
1092 uint16 flags; 1048 uint16 flags;
1093 1049
1094 packet sl; 1050 packet sl ("stats");
1095 sl << "stats ";
1096 1051
1097 if (pl->ob != NULL) 1052 if (pl->ob)
1098 { 1053 {
1099 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);
1100 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);
1101 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);
1102 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);
… …
1109 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);
1110 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);
1111 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);
1112 } 1067 }
1113 1068
1114 if (pl->socket.exp64) 1069 if (pl->ns->exp64)
1115 {
1116 uint8 s;
1117
1118 for (s = 0; s < NUM_SKILLS; s++) 1070 for (int s = 0; s < NUM_SKILLS; s++)
1119 {
1120 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)
1121 { 1072 {
1122 /* Always send along the level if exp changes. This is only 1073 /* Always send along the level if exp changes. This is only
1123 * 1 extra byte, but keeps processing simpler. 1074 * 1 extra byte, but keeps processing simpler.
1124 */ 1075 */
1125 sl << uint8 (s + CS_STAT_SKILLINFO) 1076 sl << uint8 (s + CS_STAT_SKILLINFO)
1126 << uint8 (pl->last_skill_ob[s]->level) 1077 << uint8 (pl->last_skill_ob[s]->level)
1127 << uint64 (pl->last_skill_ob[s]->stats.exp); 1078 << uint64 (pl->last_skill_ob[s]->stats.exp);
1128 1079
1129 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;
1130 } 1081 }
1131 }
1132 }
1133 1082
1134 if (pl->socket.exp64) 1083 if (pl->ns->exp64)
1135 { 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) }
1136 else 1085 else
1137 { 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) }
1138 1087
1139 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1088 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);
… …
1152 if (pl->run_on) 1101 if (pl->run_on)
1153 flags |= SF_RUNON; 1102 flags |= SF_RUNON;
1154 1103
1155 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1104 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1156 1105
1157 if (pl->socket.sc_version < 1025) 1106 if (pl->ns->sc_version < 1025)
1158 { 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) }
1159 else 1108 else
1160 {
1161 int i;
1162
1163 for (i = 0; i < NROFATTACKS; i++) 1109 for (int i = 0; i < NROFATTACKS; i++)
1164 { 1110 {
1165 /* Skip ones we won't send */ 1111 /* Skip ones we won't send */
1166 if (atnr_cs_stat[i] == -1) 1112 if (atnr_cs_stat[i] == -1)
1167 continue; 1113 continue;
1168 1114
1169 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]);
1170 } 1116 }
1171 }
1172 1117
1173 if (pl->socket.monitor_spells) 1118 if (pl->ns->monitor_spells)
1174 { 1119 {
1175 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);
1176 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);
1177 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);
1178 } 1123 }
1179 1124
1180 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 */
1181 AddIfString (pl->socket.stats.range, buf, CS_STAT_RANGE); 1126 AddIfString (pl->ns->stats.range, buf, CS_STAT_RANGE);
1182 set_title (pl->ob, buf); 1127 set_title (pl->ob, buf);
1183 AddIfString (pl->socket.stats.title, buf, CS_STAT_TITLE); 1128 AddIfString (pl->ns->stats.title, buf, CS_STAT_TITLE);
1184 1129
1185 /* Only send it away if we have some actual data */ 1130 /* Only send it away if we have some actual data */
1186 if (sl.length () > 6) 1131 if (sl.length () > 6)
1187 Send_With_Handling (&pl->socket, &sl); 1132 pl->ns->send_packet (sl);
1188} 1133}
1189 1134
1190/** 1135/**
1191 * 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.
1192 */ 1137 */
1193void 1138void
1194esrv_new_player (player *pl, uint32 weight) 1139esrv_new_player (player *pl, uint32 weight)
1195{ 1140{
1196 pl->last_weight = weight; 1141 pl->last_weight = weight;
1197 1142
1198 packet sl; 1143 packet sl ("player");
1199 sl << "player ";
1200 1144
1201 sl << uint32 (pl->ob->count) 1145 sl << uint32 (pl->ob->count)
1202 << uint32 (weight) 1146 << uint32 (weight)
1203 << uint32 (pl->ob->face->number) 1147 << uint32 (pl->ob->face->number)
1204 << data8 (pl->ob->name); 1148 << data8 (pl->ob->name);
1205 1149
1206 Send_With_Handling (&pl->socket, &sl); 1150 pl->ns->send_packet (sl);
1207 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1151 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1208} 1152}
1209 1153
1210/** 1154/**
1211 * Need to send an animation sequence to the client. 1155 * Need to send an animation sequence to the client.
… …
1213 * 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
1214 * 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
1215 * when the player logs in and picks stuff up. 1159 * when the player logs in and picks stuff up.
1216 */ 1160 */
1217void 1161void
1218esrv_send_animation (client_socket * ns, short anim_num) 1162esrv_send_animation (client * ns, short anim_num)
1219{ 1163{
1220 int i;
1221
1222 /* 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
1223 * 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
1224 * range, it must be a valid animation. 1166 * range, it must be a valid animation.
1225 */ 1167 */
1226 if (anim_num < 0 || anim_num > num_animations) 1168 if (anim_num < 0 || anim_num > num_animations)
1227 { 1169 {
1228 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);
1229 return; 1171 return;
1230 } 1172 }
1231 1173
1232 packet sl; 1174 packet sl ("anim");
1233 1175
1234 sl << "anim "
1235 << uint16 (anim_num) 1176 sl << uint16 (anim_num)
1236 << uint16 (0); /* flags - not used right now */ 1177 << uint16 (0); /* flags - not used right now */
1237 1178
1238 /* 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
1239 * the face itself) down to the client. 1180 * the face itself) down to the client.
1240 */ 1181 */
1241 for (i = 0; i < animations[anim_num].num_animations; i++) 1182 for (int i = 0; i < animations[anim_num].num_animations; i++)
1242 { 1183 {
1243 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))
1244 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1185 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1186
1245 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 */
1246 } 1188 }
1247 1189
1248 Send_With_Handling (ns, &sl); 1190 ns->send_packet (sl);
1249 1191
1250 ns->anims_sent[anim_num] = 1; 1192 ns->anims_sent[anim_num] = 1;
1251} 1193}
1252 1194
1253 1195
… …
1260/** 1202/**
1261 * 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
1262 * the face yet, we will also send it. 1204 * the face yet, we will also send it.
1263 */ 1205 */
1264static void 1206static void
1265esrv_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)
1266{ 1208{
1267 if (newmap->cells[x][y].count >= MAP_LAYERS) 1209 if (newmap->cells[x][y].count >= MAP_LAYERS)
1268 { 1210 {
1211 //TODO: one or the other, can't both have abort and return, verify and act
1269 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);
1270 return; 1213 return;
1271 abort (); 1214 abort ();
1272 } 1215 }
1273 1216
1274 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;
1275 newmap->cells[x][y].count++; 1218 newmap->cells[x][y].count++;
1276 1219
1277 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1220 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1278 esrv_send_face (ns, face_num, 0); 1221 esrv_send_face (ns, face_num, 0);
1279}
1280
1281struct LayerCell
1282{
1283 uint16 xy;
1284 short face;
1285};
1286
1287struct MapLayer
1288{
1289 int count;
1290 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1291};
1292
1293/** Checkes if map cells have changed */
1294static int
1295mapcellchanged (client_socket * ns, int i, int j, struct Map *newmap)
1296{
1297 int k;
1298
1299 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1300 return 1;
1301 for (k = 0; k < newmap->cells[i][j].count; k++)
1302 {
1303 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1304 {
1305 return 1;
1306 }
1307 }
1308 return 0;
1309}
1310
1311/**
1312 * Basically, what this does is pack the data into layers.
1313 * cnum is the client number, cur is the the buffer we put all of
1314 * this data into. we return the end of the data. layers is
1315 * how many layers of data we should back.
1316 */
1317static uint8 *
1318compactlayer (client_socket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1319{
1320 int x, y, k;
1321 int face;
1322 unsigned char *fcur;
1323 struct MapLayer layers[MAP_LAYERS];
1324
1325 for (k = 0; k < MAP_LAYERS; k++)
1326 layers[k].count = 0;
1327 fcur = cur;
1328 for (x = 0; x < ns->mapx; x++)
1329 {
1330 for (y = 0; y < ns->mapy; y++)
1331 {
1332 if (!mapcellchanged (ns, x, y, newmap))
1333 continue;
1334 if (newmap->cells[x][y].count == 0)
1335 {
1336 *cur = x * ns->mapy + y; /* mark empty space */
1337 cur++;
1338 continue;
1339 }
1340 for (k = 0; k < newmap->cells[x][y].count; k++)
1341 {
1342 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1343 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1344 layers[k].count++;
1345 }
1346 }
1347 }
1348 /* If no data, return now. */
1349 if (fcur == cur && layers[0].count == 0)
1350 return cur;
1351 *cur = 255; /* mark end of explicitly cleared cells */
1352 cur++;
1353 /* First pack by layers. */
1354 for (k = 0; k < numlayers; k++)
1355 {
1356 if (layers[k].count == 0)
1357 break; /* once a layer is entirely empty, no layer below it can
1358 have anything in it either */
1359 /* Pack by entries in thie layer */
1360 for (x = 0; x < layers[k].count;)
1361 {
1362 fcur = cur;
1363 *cur = layers[k].lcells[x].face >> 8;
1364 cur++;
1365 *cur = layers[k].lcells[x].face & 0xFF;
1366 cur++;
1367 face = layers[k].lcells[x].face;
1368 /* Now, we back the redundant data into 1 byte xy pairings */
1369 for (y = x; y < layers[k].count; y++)
1370 {
1371 if (layers[k].lcells[y].face == face)
1372 {
1373 *cur = (uint8) layers[k].lcells[y].xy;
1374 cur++;
1375 layers[k].lcells[y].face = -1;
1376 }
1377 }
1378 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1379 /* forward over the now redundant data */
1380 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1381 x++;
1382 }
1383 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1384 }
1385 return cur;
1386} 1222}
1387 1223
1388/** Clears a map cell */ 1224/** Clears a map cell */
1389static void 1225static void
1390map_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)
… …
1402#define MAX_LAYERS 3 1238#define MAX_LAYERS 3
1403 1239
1404/* 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
1405 * 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,
1406 * 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
1407 * 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
1408 * re-examined. 1244 * re-examined.
1409 */ 1245 */
1410
1411static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1246static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1412 1247
1413/** 1248/**
1414 * Returns true if any of the heads for this 1249 * Returns true if any of the heads for this
1415 * 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
1416 * for empty space checking. 1251 * for empty space checking.
1417 */ 1252 */
1418static inline int 1253static inline int
1419have_head (int ax, int ay) 1254have_head (int ax, int ay)
1420{ 1255{
1421
1422 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1256 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1423 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])
1424 return 1; 1258 return 1;
1259
1425 return 0; 1260 return 0;
1426} 1261}
1427 1262
1428/** 1263/**
1429 * check_head is a bit simplistic version of update_space below. 1264 * check_head is a bit simplistic version of update_space below.
1430 * 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
1431 * 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
1432 * 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
1433 * sent, it returns zero. 1268 * sent, it returns zero.
1434 */ 1269 */
1435static int 1270static int
1436check_head (packet &sl, client_socket &ns, int ax, int ay, int layer) 1271check_head (packet &sl, client &ns, int ax, int ay, int layer)
1437{ 1272{
1438 short face_num; 1273 short face_num;
1439 1274
1440 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) 1275 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1441 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;
… …
1473 * numbers the spaces differently - I think this was a leftover from 1308 * numbers the spaces differently - I think this was a leftover from
1474 * 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
1475 * 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
1476 * actually match. 1311 * actually match.
1477 */ 1312 */
1478
1479static int 1313static int
1480update_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)
1481{ 1315{
1482 object *ob, *head; 1316 object *ob, *head;
1483 uint16 face_num; 1317 uint16 face_num;
1484 int bx, by, i; 1318 int bx, by, i;
1485 1319
… …
1698 * 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
1699 * take. 1533 * take.
1700 */ 1534 */
1701 1535
1702static inline int 1536static inline int
1703update_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)
1704{ 1538{
1705 object *ob; 1539 object *ob;
1706 int smoothlevel; /* old face_num; */ 1540 int smoothlevel; /* old face_num; */
1707 1541
1708 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1542 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
… …
1742 * 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
1743 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1577 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1744 * available. 1578 * available.
1745 */ 1579 */
1746int 1580int
1747getExtendedMapInfoSize (client_socket * ns) 1581getExtendedMapInfoSize (client * ns)
1748{ 1582{
1749 int result = 0; 1583 int result = 0;
1750 1584
1751 if (ns->ext_mapinfos) 1585 if (ns->ext_mapinfos)
1752 { 1586 {
1753 if (ns->EMI_smooth) 1587 if (ns->EMI_smooth)
1754 result += 1; /*One byte for smoothlevel */ 1588 result += 1; /*One byte for smoothlevel */
1755 } 1589 }
1590
1756 return result; 1591 return result;
1757} 1592}
1758 1593
1759/** 1594/**
1760 * 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
… …
1767 * 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
1768 * 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,
1769 * 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
1770 * of what we send, see the doc/Protocol file. 1605 * of what we send, see the doc/Protocol file.
1771 * I will describe internally what we do: 1606 * I will describe internally what we do:
1772 * 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.
1773 * 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
1774 * maximum viewable size (As set in config.h). 1609 * maximum viewable size (As set in config.h).
1775 * in the cells, there are faces and a count value. 1610 * in the cells, there are faces and a count value.
1776 * 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
1777 * is not viewable. 1612 * is not viewable.
… …
1788 uint8 eentrysize; 1623 uint8 eentrysize;
1789 uint16 ewhatstart, ewhatflag; 1624 uint16 ewhatstart, ewhatflag;
1790 uint8 extendedinfos; 1625 uint8 extendedinfos;
1791 maptile *m; 1626 maptile *m;
1792 1627
1793 client_socket &socket = pl->contr->socket; 1628 client &socket = *pl->contr->ns;
1794 1629
1795 check_map_change (pl->contr); 1630 check_map_change (pl->contr);
1796 1631
1797 packet sl; 1632 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1798 packet esl; 1633 packet esl;
1799 1634
1800 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1801 startlen = sl.length (); 1635 startlen = sl.length ();
1802 1636
1803 /*Extendedmapinfo structure initialisation */ 1637 /*Extendedmapinfo structure initialisation */
1804 if (socket.ext_mapinfos) 1638 if (socket.ext_mapinfos)
1805 { 1639 {
… …
1849 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++)
1850 { 1684 {
1851 ax = 0; 1685 ax = 0;
1852 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++)
1853 { 1687 {
1854
1855 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1688 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1856 1689
1857 /* 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
1858 * 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
1859 * the client wants if using the map1a command - this is because 1692 * the client wants if using the map1a command - this is because
… …
1877 * with no faces tells the client to blank out the 1710 * with no faces tells the client to blank out the
1878 * space. 1711 * space.
1879 */ 1712 */
1880 got_one = 0; 1713 got_one = 0;
1881 for (i = oldlen + 2; i < sl.length (); i++) 1714 for (i = oldlen + 2; i < sl.length (); i++)
1882 if (sl.buf[i]) 1715 if (sl[i])
1883 got_one = 1; 1716 got_one = 1;
1884 1717
1885 if (got_one && (mask & 0xf)) 1718 if (got_one && (mask & 0xf))
1886 sl.buf[oldlen + 1] = mask & 0xff; 1719 sl[oldlen + 1] = mask & 0xff;
1887 else 1720 else
1888 { /*either all faces blank, either no face at all */ 1721 { /*either all faces blank, either no face at all */
1889 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */ 1722 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1890 sl.reset (oldlen + 2); 1723 sl.reset (oldlen + 2);
1891 else 1724 else
… …
1957 1790
1958 map_clearcell (&lastcell, 0, 0, 0, count); 1791 map_clearcell (&lastcell, 0, 0, 0, count);
1959 } 1792 }
1960 1793
1961 if ((mask & 0xf) || need_send) 1794 if ((mask & 0xf) || need_send)
1962 sl.buf[oldlen + 1] = mask & 0xff; 1795 sl[oldlen + 1] = mask & 0xff;
1963 else 1796 else
1964 sl.reset (oldlen); 1797 sl.reset (oldlen);
1965 } 1798 }
1966 else 1799 else
1967 { 1800 {
… …
1997 mask |= 0x8; 1830 mask |= 0x8;
1998 1831
1999 if (socket.extmap) 1832 if (socket.extmap)
2000 { 1833 {
2001 *last_ext |= 0x80; 1834 *last_ext |= 0x80;
2002 last_ext = sl.buf + sl.length (); 1835 last_ext = &sl[sl.length ()];
2003 sl << uint8 (d); 1836 sl << uint8 (d);
2004 } 1837 }
2005 else 1838 else
2006 sl << uint8 (255 - 64 * d); 1839 sl << uint8 (255 - 64 * d);
2007 } 1840 }
… …
2041 { 1874 {
2042 lastcell.stat_hp = stat_hp; 1875 lastcell.stat_hp = stat_hp;
2043 1876
2044 mask |= 0x8; 1877 mask |= 0x8;
2045 *last_ext |= 0x80; 1878 *last_ext |= 0x80;
2046 last_ext = sl.buf + sl.length (); 1879 last_ext = &sl[sl.length ()];
2047 1880
2048 sl << uint8 (5) << uint8 (stat_hp); 1881 sl << uint8 (5) << uint8 (stat_hp);
2049 1882
2050 if (stat_width > 1) 1883 if (stat_width > 1)
2051 { 1884 {
2052 *last_ext |= 0x80; 1885 *last_ext |= 0x80;
2053 last_ext = sl.buf + sl.length (); 1886 last_ext = &sl[sl.length ()];
2054 1887
2055 sl << uint8 (6) << uint8 (stat_width); 1888 sl << uint8 (6) << uint8 (stat_width);
2056 } 1889 }
2057 } 1890 }
2058 1891
… …
2060 { 1893 {
2061 lastcell.player = player; 1894 lastcell.player = player;
2062 1895
2063 mask |= 0x8; 1896 mask |= 0x8;
2064 *last_ext |= 0x80; 1897 *last_ext |= 0x80;
2065 last_ext = sl.buf + sl.length (); 1898 last_ext = &sl[sl.length ()];
2066 1899
2067 sl << uint8 (0x47) << uint8 (8) << (uint64)player; 1900 sl << uint8 (0x47) << uint8 (8) << (uint64)player;
2068 } 1901 }
2069 1902
2070 if (lastcell.flags != flags) 1903 if (lastcell.flags != flags)
2071 { 1904 {
2072 lastcell.flags = flags; 1905 lastcell.flags = flags;
2073 1906
2074 mask |= 0x8; 1907 mask |= 0x8;
2075 *last_ext |= 0x80; 1908 *last_ext |= 0x80;
2076 last_ext = sl.buf + sl.length (); 1909 last_ext = &sl[sl.length ()];
2077 1910
2078 sl << uint8 (8) << uint8 (flags); 1911 sl << uint8 (8) << uint8 (flags);
2079 } 1912 }
2080 } 1913 }
2081 1914
… …
2123 * space by checking the mask. If so, update the mask. 1956 * space by checking the mask. If so, update the mask.
2124 * if not, reset the len to that from before adding the mask 1957 * if not, reset the len to that from before adding the mask
2125 * value, so we don't send those bits. 1958 * value, so we don't send those bits.
2126 */ 1959 */
2127 if (mask & 0xf) 1960 if (mask & 0xf)
2128 sl.buf[oldlen + 1] = mask & 0xff; 1961 sl[oldlen + 1] = mask & 0xff;
2129 else 1962 else
2130 sl.reset (oldlen); 1963 sl.reset (oldlen);
2131 1964
2132 if (emask & 0xf) 1965 if (emask & 0xf)
2133 esl.buf[eoldlen + 1] = emask & 0xff; 1966 esl[eoldlen + 1] = emask & 0xff;
2134 else 1967 else
2135 esl.reset (eoldlen); 1968 esl.reset (eoldlen);
2136 } /* else this is a viewable space */ 1969 } /* else this is a viewable space */
2137 } /* for x loop */ 1970 } /* for x loop */
2138 } /* for y loop */ 1971 } /* for y loop */
… …
2144 { 1977 {
2145 /* No map data will follow, so don't say the client 1978 /* No map data will follow, so don't say the client
2146 * it doesn't need draw! 1979 * it doesn't need draw!
2147 */ 1980 */
2148 ewhatflag &= (~EMI_NOREDRAW); 1981 ewhatflag &= (~EMI_NOREDRAW);
2149 esl.buf[ewhatstart + 1] = ewhatflag & 0xff; 1982 esl[ewhatstart + 1] = ewhatflag & 0xff;
2150 } 1983 }
2151 1984
2152 if (esl.length () > estartlen) 1985 if (esl.length () > estartlen)
2153 Send_With_Handling (&socket, &esl); 1986 socket.send_packet (esl);
2154 } 1987 }
2155 1988
2156 if (sl.length () > startlen || socket.sent_scroll) 1989 if (sl.length () > startlen || socket.sent_scroll)
2157 { 1990 {
2158 Send_With_Handling (&socket, &sl); 1991 socket.send_packet (sl);
2159 socket.sent_scroll = 0; 1992 socket.sent_scroll = 0;
2160 } 1993 }
2161} 1994}
2162 1995
2163/** 1996/**
… …
2189 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 2022 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2190 return; 2023 return;
2191 2024
2192 memset (&newmap, 0, sizeof (struct Map)); 2025 memset (&newmap, 0, sizeof (struct Map));
2193 2026
2194 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++)
2195 {
2196 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++)
2197 { 2029 {
2198 ax = i; 2030 ax = i;
2199 ay = j; 2031 ay = j;
2200 m = pm; 2032 m = pm;
2201 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2033 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2034
2202 if (mflags & P_OUT_OF_MAP) 2035 if (mflags & P_OUT_OF_MAP)
2203 continue; 2036 continue;
2204 if (mflags & P_NEED_UPDATE) 2037
2205 update_position (m, ax, ay);
2206 /* 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
2207 * just to reload it. This should really call something like 2039 * just to reload it. This should really call something like
2208 * swap_map, but this is much more efficient and 'good enough' 2040 * swap_map, but this is much more efficient and 'good enough'
2209 */ 2041 */
2210 if (mflags & P_NEW_MAP) 2042 if (mflags & P_NEW_MAP)
2211 m->timeout = 50; 2043 m->timeout = 50;
2212 } 2044 }
2213 } 2045
2214 /* do LOS after calls to update_position */ 2046 /* do LOS after calls to update_position */
2215 if (pl->contr->do_los) 2047 if (pl->contr->do_los)
2216 { 2048 {
2217 update_los (pl); 2049 update_los (pl);
2218 pl->contr->do_los = 0; 2050 pl->contr->do_los = 0;
… …
2233 2065
2234/*****************************************************************************/ 2066/*****************************************************************************/
2235void 2067void
2236send_plugin_custom_message (object *pl, char *buf) 2068send_plugin_custom_message (object *pl, char *buf)
2237{ 2069{
2238 pl->contr->socket.send_packet (buf); 2070 pl->contr->ns->send_packet (buf);
2239} 2071}
2240 2072
2241/** 2073/**
2242 * This sends the skill number to name mapping. We ignore 2074 * This sends the skill number to name mapping. We ignore
2243 * the params - we always send the same info no matter what. 2075 * the params - we always send the same info no matter what.
2244 */ 2076 */
2245void 2077void
2246send_skill_info (client_socket *ns, char *params) 2078send_skill_info (client *ns, char *params)
2247{ 2079{
2248 packet sl; 2080 packet sl;
2249 sl << "replyinfo skill_info\n"; 2081 sl << "replyinfo skill_info\n";
2250 2082
2251 for (int i = 1; i < NUM_SKILLS; i++) 2083 for (int i = 1; i < NUM_SKILLS; i++)
… …
2255 { 2087 {
2256 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 2088 LOG (llevError, "Buffer overflow in send_skill_info!\n");
2257 fatal (0); 2089 fatal (0);
2258 } 2090 }
2259 2091
2260 Send_With_Handling (ns, &sl); 2092 ns->send_packet (sl);
2261} 2093}
2262 2094
2263/** 2095/**
2264 * This sends the spell path to name mapping. We ignore 2096 * This sends the spell path to name mapping. We ignore
2265 * the params - we always send the same info no matter what. 2097 * the params - we always send the same info no matter what.
2266 */ 2098 */
2267void 2099void
2268send_spell_paths (client_socket * ns, char *params) 2100send_spell_paths (client * ns, char *params)
2269{ 2101{
2270 packet sl; 2102 packet sl;
2271 2103
2272 sl << "replyinfo spell_paths\n"; 2104 sl << "replyinfo spell_paths\n";
2273 2105
… …
2278 { 2110 {
2279 LOG (llevError, "Buffer overflow in send_spell_paths!\n"); 2111 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
2280 fatal (0); 2112 fatal (0);
2281 } 2113 }
2282 2114
2283 Send_With_Handling (ns, &sl); 2115 ns->send_packet (sl);
2284} 2116}
2285 2117
2286/** 2118/**
2287 * This looks for any spells the player may have that have changed their stats. 2119 * This looks for any spells the player may have that have changed their stats.
2288 * 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
2289 */ 2121 */
2290void 2122void
2291esrv_update_spells (player *pl) 2123esrv_update_spells (player *pl)
2292{ 2124{
2293 if (!pl->socket.monitor_spells) 2125 if (!pl->ns->monitor_spells)
2294 return; 2126 return;
2295 2127
2296 for (object *spell = pl->ob->inv; spell; spell = spell->below) 2128 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2297 { 2129 {
2298 if (spell->type == SPELL) 2130 if (spell->type == SPELL)
… …
2328 2160
2329 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 2161 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2330 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 2162 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2331 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 2163 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2332 2164
2333 Send_With_Handling (&pl->socket, &sl); 2165 pl->ns->send_packet (sl);
2334 } 2166 }
2335 } 2167 }
2336 } 2168 }
2337} 2169}
2338 2170
2339void 2171void
2340esrv_remove_spell (player *pl, object *spell) 2172esrv_remove_spell (player *pl, object *spell)
2341{ 2173{
2342 if (!pl->socket.monitor_spells) 2174 if (!pl->ns->monitor_spells)
2343 return; 2175 return;
2344 2176
2345 if (!pl || !spell || spell->env != pl->ob) 2177 if (!pl || !spell || spell->env != pl->ob)
2346 { 2178 {
2347 LOG (llevError, "Invalid call to esrv_remove_spell"); 2179 LOG (llevError, "Invalid call to esrv_remove_spell");
2348 return; 2180 return;
2349 } 2181 }
2350 2182
2351 packet sl; 2183 packet sl ("delspell");
2352 2184
2353 sl << "delspell "
2354 << uint32 (spell->count); 2185 sl << uint32 (spell->count);
2355 2186
2356 Send_With_Handling (&pl->socket, &sl); 2187 pl->ns->send_packet (sl);
2357} 2188}
2358 2189
2359/* 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. */
2360static void 2191static void
2361append_spell (player *pl, packet &sl, object *spell) 2192append_spell (player *pl, packet &sl, object *spell)
… …
2409 { 2240 {
2410 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");
2411 return; 2242 return;
2412 } 2243 }
2413 2244
2414 if (!pl->socket.monitor_spells) 2245 if (!pl->ns->monitor_spells)
2415 return; 2246 return;
2416 2247
2417 packet sl; 2248 packet sl ("addspell");
2418
2419 sl << "addspell ";
2420 2249
2421 if (!spell) 2250 if (!spell)
2422 { 2251 {
2423 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2252 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
2424 { 2253 {
… …
2438 if (spell->type != SPELL) 2267 if (spell->type != SPELL)
2439 continue; 2268 continue;
2440 2269
2441 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))))
2442 { 2271 {
2443 Send_With_Handling (&pl->socket, &sl); 2272 pl->ns->send_packet (sl);
2444 2273
2445 sl.reset (); 2274 sl.reset ();
2446 sl << "addspell "; 2275 sl << "addspell ";
2447 } 2276 }
2448 2277
… …
2462 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 2291 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2463 fatal (0); 2292 fatal (0);
2464 } 2293 }
2465 2294
2466 /* finally, we can send the packet */ 2295 /* finally, we can send the packet */
2467 Send_With_Handling (&pl->socket, &sl); 2296 pl->ns->send_packet (sl);
2468
2469} 2297}
2470 2298

Diff Legend

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