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.29 by root, Wed Dec 13 21:27:09 2006 UTC vs.
Revision 1.46 by root, Tue Dec 19 05:12:52 2006 UTC

… …
38 * esrv_map_new starts updating the map 38 * esrv_map_new starts updating the map
39 * 39 *
40 * esrv_map_setbelow allows filling in all of the faces for the map. 40 * esrv_map_setbelow allows filling in all of the faces for the map.
41 * if a face has not already been sent to the client, it is sent now. 41 * if a face has not already been sent to the client, it is sent now.
42 * 42 *
43 * mapcellchanged, compactlayer, compactstack, perform the map compressing
44 * operations
45 *
46 * esrv_map_doneredraw finishes the map update, and ships across the
47 * map updates.
48 *
49 */ 43 */
50 44
51#include <global.h> 45#include <global.h>
52#include <sproto.h> 46#include <sproto.h>
53 47
54#include <newclient.h>
55#include <newserver.h>
56#include <living.h> 48#include <living.h>
57#include <commands.h> 49#include <commands.h>
58 50
59/* 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,
60 * it should work here. 52 * it should work here.
… …
63#include <sys/time.h> 55#include <sys/time.h>
64#include <sys/socket.h> 56#include <sys/socket.h>
65#include <netinet/in.h> 57#include <netinet/in.h>
66#include <netdb.h> 58#include <netdb.h>
67 59
68#ifdef HAVE_UNISTD_H
69# include <unistd.h> 60#include <unistd.h>
70#endif
71
72#ifdef HAVE_SYS_TIME_H
73# include <sys/time.h> 61#include <sys/time.h>
74#endif
75 62
76#include "sounds.h" 63#include "sounds.h"
77 64
78/** 65/**
79 * This table translates the attack numbers as used within the 66 * This table translates the attack numbers as used within the
… …
96 -1, /* life stealing */ 83 -1, /* life stealing */
97 -1 /* Disease - not fully done yet */ 84 -1 /* Disease - not fully done yet */
98}; 85};
99 86
100static void 87static void
101socket_map_scroll (NewSocket * ns, int dx, int dy) 88socket_map_scroll (client *ns, int dx, int dy)
102{ 89{
103 struct Map newmap; 90 struct Map newmap;
104 int x, y, mx, my; 91 int x, y, mx, my;
105 92
106 {
107 char buf[MAXSOCKBUF];
108
109 sprintf (buf, "map_scroll %d %d", dx, dy); 93 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
110 Write_String_To_Socket (ns, buf, strlen (buf));
111 }
112 94
113 /* If we are using the Map1aCmd, we may in fact send 95 /* If we are using the Map1aCmd, we may in fact send
114 * head information that is outside the viewable map. 96 * head information that is outside the viewable map.
115 * 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
116 * look for. Removed code to do so - it caused extra 98 * look for. Removed code to do so - it caused extra
… …
156} 138}
157 139
158static void 140static void
159clear_map (player *pl) 141clear_map (player *pl)
160{ 142{
161 NewSocket & socket = pl->socket;
162
163 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 143 memset (&pl->socket->lastmap, 0, sizeof (pl->socket->lastmap));
164 144
165 if (socket.newmapcmd == 1) 145 if (pl->socket->newmapcmd == 1)
166 Write_String_To_Socket (&socket, "newmap", 6); 146 pl->socket->send_packet ("newmap");
167 147
168 socket.update_look = 1; 148 pl->socket->floorbox_reset ();
169 socket.look_position = 0;
170} 149}
171 150
172/** check for map change and send new map data */ 151/** check for map change and send new map data */
173static void 152static void
174check_map_change (player *pl) 153check_map_change (player *pl)
175{ 154{
176 NewSocket & socket = pl->socket; 155 client &socket = *pl->socket;
177 object *ob = pl->ob; 156 object *ob = pl->ob;
178 char buf[MAX_BUF]; /* eauugggh */ 157 char buf[MAX_BUF]; /* eauugggh */
179 158
180 if (socket.current_map != ob->map) 159 if (socket.current_map != ob->map)
181 { 160 {
… …
202 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path); 181 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path);
203 } 182 }
204 else 183 else
205 snprintf (buf, MAX_BUF, "mapinfo current"); 184 snprintf (buf, MAX_BUF, "mapinfo current");
206 185
207 Write_String_To_Socket (&socket, buf, strlen (buf)); 186 socket.send_packet (buf);
208 } 187 }
209 } 188 }
210 else if (socket.current_x != ob->x || socket.current_y != ob->y) 189 else if (socket.current_x != ob->x || socket.current_y != ob->y)
211 { 190 {
212 int dx = ob->x - socket.current_x; 191 int dx = ob->x - socket.current_x;
… …
215 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 194 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
216 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
217 else 196 else
218 { 197 {
219 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);
220 socket.update_look = 1; 199 socket.floorbox_reset ();
221 socket.look_position = 0;
222 } 200 }
223 } 201 }
224 202
225 socket.current_x = ob->x; 203 socket.current_x = ob->x;
226 socket.current_y = ob->y; 204 socket.current_y = ob->y;
227} 205}
228 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
229void 251void
230ExtCmd (char *buf, int len, player *pl) 252ExtCmd (char *buf, int len, player *pl)
231{ 253{
232 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));
233} 261}
234 262
235void 263void
236MapInfoCmd (char *buf, int len, player *pl) 264MapInfoCmd (char *buf, int len, player *pl)
237{ 265{
… …
252 buf += 8; 280 buf += 8;
253 281
254 // initial map and its origin 282 // initial map and its origin
255 maptile *map = pl->ob->map; 283 maptile *map = pl->ob->map;
256 sint16 dx, dy; 284 sint16 dx, dy;
257 int mapx = pl->socket.mapx / 2 - pl->ob->x; 285 int mapx = pl->socket->mapx / 2 - pl->ob->x;
258 int mapy = pl->socket.mapy / 2 - pl->ob->y; 286 int mapy = pl->socket->mapy / 2 - pl->ob->y;
259 int max_distance = 8; // limit maximum path length to something generous 287 int max_distance = 8; // limit maximum path length to something generous
260 288
261 while (*buf && map && max_distance) 289 while (*buf && map && max_distance)
262 { 290 {
263 int dir = *buf++; 291 int dir = *buf++;
… …
314 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 342 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
315 } 343 }
316 else 344 else
317 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 345 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
318 346
319 Write_String_To_Socket (&pl->socket, bigbuf, strlen (bigbuf)); 347 pl->socket->send_packet (bigbuf);
320} 348}
321 349
322/** This is the Setup cmd - easy first implementation */ 350/** This is the Setup cmd - easy first implementation */
323void 351void
324SetUp (char *buf, int len, NewSocket * ns) 352SetUp (char *buf, int len, client * ns)
325{ 353{
326 int s, slen; 354 int s, slen;
327 char *cmd, *param, cmdback[HUGE_BUF]; 355 char *cmd, *param, cmdback[HUGE_BUF];
328 356
329 /* run through the cmds of setup 357 /* run through the cmds of setup
… …
331 * 359 *
332 * we send the status of the cmd back, or a FALSE is the cmd is the server unknown 360 * we send the status of the cmd back, or a FALSE is the cmd is the server unknown
333 * The client then must sort this out 361 * The client then must sort this out
334 */ 362 */
335 363
336 LOG (llevInfo, "Get SetupCmd:: %s\n", buf); 364 //LOG (llevInfo, "Get SetupCmd:: %s\n", buf);
365
337 strcpy (cmdback, "setup"); 366 strcpy (cmdback, "setup");
338 for (s = 0; s < len;) 367 for (s = 0; s < len; )
339 { 368 {
340
341 cmd = &buf[s]; 369 cmd = &buf[s];
342 370
343 /* find the next space, and put a null there */ 371 /* find the next space, and put a null there */
344 for (; buf[s] && buf[s] != ' '; s++); 372 for (; buf[s] && buf[s] != ' '; s++)
373 ;
374
345 buf[s++] = 0; 375 buf[s++] = 0;
376
346 while (buf[s] == ' ') 377 while (buf[s] == ' ')
347 s++; 378 s++;
348 379
349 if (s >= len) 380 if (s >= len)
350 break; 381 break;
351 382
352 param = &buf[s]; 383 param = &buf[s];
353 384
354 for (; buf[s] && buf[s] != ' '; s++); 385 for (; buf[s] && buf[s] != ' '; s++)
386 ;
387
355 buf[s++] = 0; 388 buf[s++] = 0;
389
356 while (buf[s] == ' ') 390 while (buf[s] == ' ')
357 s++; 391 s++;
358 392
359 slen = strlen (cmdback); 393 slen = strlen (cmdback);
360 safe_strcat (cmdback, " ", &slen, HUGE_BUF); 394 safe_strcat (cmdback, " ", &slen, HUGE_BUF);
… …
521 * report a failure to the client. 555 * report a failure to the client.
522 */ 556 */
523 safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF); 557 safe_strcat (cmdback, "FALSE", &slen, HUGE_BUF);
524 } 558 }
525 } /* for processing all the setup commands */ 559 } /* for processing all the setup commands */
560
526 LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback); 561 LOG (llevInfo, "SendBack SetupCmd:: %s\n", cmdback);
527 Write_String_To_Socket (ns, cmdback, strlen (cmdback)); 562 ns->send_packet (cmdback);
528} 563}
529 564
530/** 565/**
531 * The client has requested to be added to the game. 566 * The client has requested to be added to the game.
532 * 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.
533 * 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,
534 * 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.
535 */ 570 */
536void 571void
537AddMeCmd (char *buf, int len, NewSocket * ns) 572AddMeCmd (char *buf, int len, client * ns)
538{ 573{
539 Settings oldsettings;
540
541 oldsettings = settings;
542 if (ns->status != Ns_Add || add_player (ns)) 574 if (ns->status != Ns_Add || add_player (ns))
543 { 575 ns->send_packet ("addme_failed");
544 Write_String_To_Socket (ns, "addme_failed", 12);
545 }
546 else 576 else
547 { 577 ns->send_packet ("addme_success");
548 /* Basically, the add_player copies the socket structure into
549 * the player structure, so this one (which is from init_sockets)
550 * is not needed anymore. The write below should still work, as the
551 * stuff in ns is still relevant.
552 */
553 Write_String_To_Socket (ns, "addme_success", 13);
554 socket_info.nconns--;
555 ns->status = Ns_Avail;
556 }
557 settings = oldsettings;
558} 578}
559 579
560/** Reply to ExtendedInfos command */ 580/** Reply to ExtendedInfos command */
561void 581void
562ToggleExtendedInfos (char *buf, int len, NewSocket * ns) 582ToggleExtendedInfos (char *buf, int len, client * ns)
563{ 583{
564 char cmdback[MAX_BUF]; 584 char cmdback[MAX_BUF];
565 char command[50]; 585 char command[50];
566 int info, nextinfo; 586 int info, nextinfo;
567 587
… …
605 { 625 {
606 strcat (cmdback, " "); 626 strcat (cmdback, " ");
607 strcat (cmdback, "smoothing"); 627 strcat (cmdback, "smoothing");
608 } 628 }
609 629
610 Write_String_To_Socket (ns, cmdback, strlen (cmdback)); 630 ns->send_packet (cmdback);
611} 631}
612 632
613/* 633/*
614#define MSG_TYPE_BOOK 1 634#define MSG_TYPE_BOOK 1
615#define MSG_TYPE_CARD 2 635#define MSG_TYPE_CARD 2
… …
618#define MSG_TYPE_MONUMENT 5 638#define MSG_TYPE_MONUMENT 5
619#define MSG_TYPE_SCRIPTED_DIALOG 6*/ 639#define MSG_TYPE_SCRIPTED_DIALOG 6*/
620 640
621/** Reply to ExtendedInfos command */ 641/** Reply to ExtendedInfos command */
622void 642void
623ToggleExtendedText (char *buf, int len, NewSocket * ns) 643ToggleExtendedText (char *buf, int len, client * ns)
624{ 644{
625 char cmdback[MAX_BUF]; 645 char cmdback[MAX_BUF];
626 char temp[10]; 646 char temp[10];
627 char command[50]; 647 char command[50];
628 int info, nextinfo, i, flag; 648 int info, nextinfo, i, flag;
… …
668 strcat (cmdback, " "); 688 strcat (cmdback, " ");
669 snprintf (temp, sizeof (temp), "%d", i); 689 snprintf (temp, sizeof (temp), "%d", i);
670 strcat (cmdback, temp); 690 strcat (cmdback, temp);
671 } 691 }
672 692
673 Write_String_To_Socket (ns, cmdback, strlen (cmdback)); 693 ns->send_packet (cmdback);
674} 694}
675 695
676/** 696/**
677 * A lot like the old AskSmooth (in fact, now called by AskSmooth). 697 * A lot like the old AskSmooth (in fact, now called by AskSmooth).
678 * Basically, it makes no sense to wait for the client to request a 698 * Basically, it makes no sense to wait for the client to request a
679 * a piece of data from us that we know the client wants. So 699 * a piece of data from us that we know the client wants. So
680 * if we know the client wants it, might as well push it to the 700 * if we know the client wants it, might as well push it to the
681 * client. 701 * client.
682 */ 702 */
683static void 703static void
684SendSmooth (NewSocket * ns, uint16 face) 704SendSmooth (client *ns, uint16 face)
685{ 705{
686 uint16 smoothface; 706 uint16 smoothface;
687 707
688 /* If we can't find a face, return and set it so we won't try to send this 708 /* If we can't find a face, return and set it so we won't try to send this
689 * again. 709 * again.
… …
699 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) 719 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
700 esrv_send_face (ns, smoothface, 0); 720 esrv_send_face (ns, smoothface, 0);
701 721
702 ns->faces_sent[face] |= NS_FACESENT_SMOOTH; 722 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
703 723
704 SockList sl (MAXSOCKBUF); 724 packet sl;
705 725
706 sl << "smooth " 726 sl << "smooth "
707 << uint16 (face) 727 << uint16 (face)
708 << uint16 (smoothface); 728 << uint16 (smoothface);
709 729
710 Send_With_Handling (ns, &sl); 730 ns->send_packet (sl);
711 sl.free ();
712} 731}
713 732
714 /** 733 /**
715 * Tells client the picture it has to use 734 * Tells client the picture it has to use
716 * to smooth a picture number given as argument. 735 * to smooth a picture number given as argument.
717 */ 736 */
718void 737void
719AskSmooth (char *buf, int len, NewSocket * ns) 738AskSmooth (char *buf, int len, client *ns)
720{ 739{
721 uint16 facenbr; 740 SendSmooth (ns, atoi (buf));
722
723 facenbr = atoi (buf);
724 SendSmooth (ns, facenbr);
725} 741}
726 742
727/** 743/**
728 * This handles the general commands from the client (ie, north, fire, cast, 744 * This handles the general commands from the client (ie, north, fire, cast,
729 * etc.) 745 * etc.)
730 */ 746 */
731void 747void
732PlayerCmd (char *buf, int len, player *pl) 748PlayerCmd (char *buf, int len, player *pl)
733{ 749{
734
735 /* The following should never happen with a proper or honest client.
736 * Therefore, the error message doesn't have to be too clear - if
737 * someone is playing with a hacked/non working client, this gives them
738 * an idea of the problem, but they deserve what they get
739 */
740 if (pl->state != ST_PLAYING)
741 {
742 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
743 return;
744 }
745 /* Check if there is a count. In theory, a zero count could also be 750 /* Check if there is a count. In theory, a zero count could also be
746 * sent, so check for that also. 751 * sent, so check for that also.
747 */ 752 */
748 if (atoi (buf) || buf[0] == '0') 753 if (atoi (buf) || buf[0] == '0')
749 { 754 {
750 pl->count = atoi ((char *) buf); 755 pl->count = atoi ((char *) buf);
756
751 buf = strchr (buf, ' '); /* advance beyond the numbers */ 757 buf = strchr (buf, ' '); /* advance beyond the numbers */
752 if (!buf) 758 if (!buf)
753 {
754#ifdef ESRV_DEBUG
755 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
756#endif
757 return; 759 return;
758 } 760
759 buf++; 761 buf++;
760 } 762 }
761 /* This should not happen anymore. */ 763
762 if (pl->ob->speed_left < -1.0)
763 {
764 LOG (llevError, "Player has negative time - shouldn't do command.\n");
765 }
766 /* In c_new.c */
767 execute_newserver_command (pl->ob, (char *) buf); 764 execute_newserver_command (pl->ob, (char *) buf);
765
768 /* Perhaps something better should be done with a left over count. 766 /* Perhaps something better should be done with a left over count.
769 * Cleaning up the input should probably be done first - all actions 767 * Cleaning up the input should probably be done first - all actions
770 * for the command that issued the count should be done before any other 768 * for the command that issued the count should be done before any other
771 * commands. 769 * commands.
772 */ 770 */
773
774 pl->count = 0; 771 pl->count = 0;
775
776} 772}
777 773
778 774
779/** 775/**
780 * This handles the general commands from the client (ie, north, fire, cast, 776 * This handles the general commands from the client (ie, north, fire, cast,
781 * etc.). It is a lot like PlayerCmd above, but is called with the 777 * etc.). It is a lot like PlayerCmd above, but is called with the
782 * 'ncom' method which gives more information back to the client so it 778 * 'ncom' method which gives more information back to the client so it
783 * can throttle. 779 * can throttle.
784 */ 780 */
785void 781void
786NewPlayerCmd (uint8 * buf, int len, player *pl) 782NewPlayerCmd (char *buf, int len, player *pl)
787{ 783{
788 int time, repeat;
789 char command[MAX_BUF];
790 short packet;
791
792 if (len < 7) 784 if (len <= 6)
793 { 785 {
794 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 786 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
795 return; 787 return;
796 } 788 }
797 789
798 packet = GetShort_String (buf); 790 uint16 cmdid = net_uint16 ((uint8 *)buf);
799 repeat = GetInt_String (buf + 2); 791 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
792
800 /* -1 is special - no repeat, but don't update */ 793 /* -1 is special - no repeat, but don't update */
801 if (repeat != -1) 794 if (repeat != -1)
802 pl->count = repeat; 795 pl->count = repeat;
803 796
804 if ((len - 4) >= MAX_BUF) 797 buf += 6; //len -= 6;
805 len = MAX_BUF - 5;
806 798
807 strncpy ((char *) command, (char *) buf + 6, len - 4);
808 command[len - 4] = '\0';
809
810 /* The following should never happen with a proper or honest client.
811 * Therefore, the error message doesn't have to be too clear - if
812 * someone is playing with a hacked/non working client, this gives them
813 * an idea of the problem, but they deserve what they get
814 */
815 if (pl->state != ST_PLAYING)
816 {
817 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
818 return;
819 }
820
821 /* This should not happen anymore. */
822 if (pl->ob->speed_left < -1.0)
823 LOG (llevError, "Player has negative time - shouldn't do command.\n");
824
825 /* In c_new.c */
826 execute_newserver_command (pl->ob, (char *) command); 799 execute_newserver_command (pl->ob, buf);
800
827 /* Perhaps something better should be done with a left over count. 801 /* Perhaps something better should be done with a left over count.
828 * Cleaning up the input should probably be done first - all actions 802 * Cleaning up the input should probably be done first - all actions
829 * for the command that issued the count should be done before any other 803 * for the command that issued the count should be done before any other
830 * commands. 804 * commands.
831 */ 805 */
832 pl->count = 0; 806 pl->count = 0;
833 807
808 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
834 if (FABS (pl->ob->speed) < 0.001) 809 int time = FABS (pl->ob->speed) < 0.001
835 time = MAX_TIME * 100; 810 ? time = MAX_TIME * 100
836 else
837 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 811 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
838 812
839 /* Send confirmation of command execution now */ 813 /* Send confirmation of command execution now */
840 814 packet sl;
841 SockList sl (MAXSOCKBUF);
842 sl << "comc " << uint16 (packet) << uint32 (time); 815 sl << "comc " << uint16 (cmdid) << uint32 (time);
843 Send_With_Handling (&pl->socket, &sl); 816 pl->socket->send_packet (sl);
844 sl.free ();
845} 817}
846 818
847 819
848/** This is a reply to a previous query. */ 820/** This is a reply to a previous query. */
849void 821void
850ReplyCmd (char *buf, int len, player *pl) 822ReplyCmd (char *buf, int len, player *pl)
851{ 823{
852 /* This is to synthesize how the data would be stored if it 824 /* This is to synthesize how the data would be stored if it
853 * was normally entered. A bit of a hack, and should be cleaned up 825 * was normally entered. A bit of a hack, and should be cleaned up
854 * once all the X11 code is removed from the server. 826 * once all the X11 code is removed from the server.
855 * 827 *
856 * We pass 13 to many of the functions because this way they 828 * We pass 13 to many of the functions because this way they
857 * think it was the carriage return that was entered, and the 829 * think it was the carriage return that was entered, and the
858 * function then does not try to do additional input. 830 * function then does not try to do additional input.
… …
861 833
862 /* this avoids any hacking here */ 834 /* this avoids any hacking here */
863 835
864 switch (pl->state) 836 switch (pl->state)
865 { 837 {
866 case ST_PLAYING: 838 case ST_PLAYING:
867 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 839 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
868 break; 840 break;
869 841
870 case ST_PLAY_AGAIN: 842 case ST_PLAY_AGAIN:
871 /* We can check this for return value (2==quit). Maybe we 843 /* We can check this for return value (2==quit). Maybe we
872 * should, and do something appropriate? 844 * should, and do something appropriate?
873 */ 845 */
874 receive_play_again (pl->ob, buf[0]); 846 receive_play_again (pl->ob, buf[0]);
875 break; 847 break;
876 848
877 case ST_ROLL_STAT: 849 case ST_ROLL_STAT:
878 key_roll_stat (pl->ob, buf[0]); 850 key_roll_stat (pl->ob, buf[0]);
879 break; 851 break;
880 852
881 case ST_CHANGE_CLASS: 853 case ST_CHANGE_CLASS:
882 854
883 key_change_class (pl->ob, buf[0]); 855 key_change_class (pl->ob, buf[0]);
884 break; 856 break;
885 857
886 case ST_CONFIRM_QUIT: 858 case ST_CONFIRM_QUIT:
887 key_confirm_quit (pl->ob, buf[0]); 859 key_confirm_quit (pl->ob, buf[0]);
888 break; 860 break;
889 861
890 case ST_CONFIGURE: 862 case ST_CONFIGURE:
891 LOG (llevError, "In client input handling, but into configure state\n"); 863 LOG (llevError, "In client input handling, but into configure state\n");
892 pl->state = ST_PLAYING; 864 pl->state = ST_PLAYING;
893 break; 865 break;
894 866
895 case ST_GET_NAME: 867 case ST_GET_NAME:
896 receive_player_name (pl->ob, 13); 868 receive_player_name (pl->ob, 13);
897 break; 869 break;
898 870
899 case ST_GET_PASSWORD: 871 case ST_GET_PASSWORD:
900 case ST_CONFIRM_PASSWORD: 872 case ST_CONFIRM_PASSWORD:
901 receive_player_password (pl->ob, 13); 873 receive_player_password (pl->ob, 13);
902 break; 874 break;
903 875
904 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 876 case ST_GET_PARTY_PASSWORD: /* Get password for party */
905 receive_party_password (pl->ob, 13); 877 receive_party_password (pl->ob, 13);
906 break; 878 break;
907 879
908 default: 880 default:
909 LOG (llevError, "Unknown input state: %d\n", pl->state); 881 LOG (llevError, "Unknown input state: %d\n", pl->state);
910 } 882 }
911} 883}
912 884
913/** 885/**
914 * Client tells its version. If there is a mismatch, we close the 886 * Client tells its version. If there is a mismatch, we close the
… …
916 * something older than the server. If we assume the client will be 888 * something older than the server. If we assume the client will be
917 * backwards compatible, having it be a later version should not be a 889 * backwards compatible, having it be a later version should not be a
918 * problem. 890 * problem.
919 */ 891 */
920void 892void
921VersionCmd (char *buf, int len, NewSocket * ns) 893VersionCmd (char *buf, int len, client * ns)
922{ 894{
923 char *cp;
924 char version_warning[256];
925
926 if (!buf) 895 if (!buf)
927 { 896 {
928 LOG (llevError, "CS: received corrupted version command\n"); 897 LOG (llevError, "CS: received corrupted version command\n");
929 return; 898 return;
930 } 899 }
931 900
932 ns->cs_version = atoi (buf); 901 ns->cs_version = atoi (buf);
933 ns->sc_version = ns->cs_version; 902 ns->sc_version = ns->cs_version;
903
904 LOG (llevDebug, "connection from client <%s>\n", buf);
905
906
907 //TODO: should log here just for statistics
908
934 if (VERSION_CS != ns->cs_version) 909 //if (VERSION_CS != ns->cs_version)
935 { 910 // unchecked;
936#ifdef ESRV_DEBUG 911
937 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
938#endif
939 }
940 cp = strchr (buf + 1, ' '); 912 char *cp = strchr (buf + 1, ' ');
941 if (!cp) 913 if (!cp)
942 return; 914 return;
915
943 ns->sc_version = atoi (cp); 916 ns->sc_version = atoi (cp);
917
944 if (VERSION_SC != ns->sc_version) 918 //if (VERSION_SC != ns->sc_version)
945 { 919 // unchecked;
946#ifdef ESRV_DEBUG 920
947 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
948#endif
949 }
950 cp = strchr (cp + 1, ' '); 921 cp = strchr (cp + 1, ' ');
922
951 if (cp) 923 if (cp)
952 { 924 {
953 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 925 assign (ns->version, cp + 1);
954 926
955 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1);
956
957 /* This is first implementation - i skip all beta DX clients with it
958 * Add later stuff here for other clients
959 */
960
961 /* these are old dxclients */
962 /* Version 1024 added support for singular + plural name values -
963 * requiing this minimal value reduces complexity of that code, and it
964 * has been around for a long time.
965 */
966 if (ns->sc_version < 1026) 927 if (ns->sc_version < 1026)
967 { 928 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
968 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
969 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 929 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
970 Write_String_To_Socket (ns, version_warning, strlen (version_warning));
971 }
972
973 } 930 }
974} 931}
975 932
976/** sound related functions. */ 933/** sound related functions. */
977
978void 934void
979SetSound (char *buf, int len, NewSocket * ns) 935SetSound (char *buf, int len, client * ns)
980{ 936{
981 ns->sound = atoi (buf); 937 ns->sound = atoi (buf);
982} 938}
983 939
984/** client wants the map resent */ 940/** client wants the map resent */
985 941
986void 942void
987MapRedrawCmd (char *buf, int len, player *pl) 943MapRedrawCmd (char *buf, int len, player *pl)
988{ 944{
989
990/* This function is currently disabled; just clearing the map state results in 945/* This function is currently disabled; just clearing the map state results in
991 * display errors. It should clear the cache and send a newmap command. 946 * display errors. It should clear the cache and send a newmap command.
992 * Unfortunately this solution does not work because some client versions send 947 * Unfortunately this solution does not work because some client versions send
993 * a mapredraw command after receiving a newmap command. 948 * a mapredraw command after receiving a newmap command.
994 */ 949 */
995#if 0
996 /* Okay, this is MAJOR UGLY. but the only way I know how to
997 * clear the "cache"
998 */
999 memset (&pl->socket.lastmap, 0, sizeof (struct Map));
1000 draw_client_map (pl->ob);
1001#endif
1002} 950}
1003 951
1004/** 952/**
1005 * Moves an object (typically, container to inventory). 953 * Moves an object (typically, container to inventory).
1006 * syntax is: move (to) (tag) (nrof) 954 * syntax is: move (to) (tag) (nrof)
… …
1009MoveCmd (char *buf, int len, player *pl) 957MoveCmd (char *buf, int len, player *pl)
1010{ 958{
1011 int vals[3], i; 959 int vals[3], i;
1012 960
1013 /* A little funky here. We only cycle for 2 records, because 961 /* A little funky here. We only cycle for 2 records, because
1014 * we obviously am not going to find a space after the third 962 * we obviously are not going to find a space after the third
1015 * record. Perhaps we should just replace this with a 963 * record. Perhaps we should just replace this with a
1016 * sscanf? 964 * sscanf?
1017 */ 965 */
1018 for (i = 0; i < 2; i++) 966 for (i = 0; i < 2; i++)
1019 { 967 {
1020 vals[i] = atoi (buf); 968 vals[i] = atoi (buf);
969
1021 if (!(buf = strchr (buf, ' '))) 970 if (!(buf = strchr (buf, ' ')))
1022 { 971 {
1023 LOG (llevError, "Incomplete move command: %s\n", buf); 972 LOG (llevError, "Incomplete move command: %s\n", buf);
1024 return; 973 return;
1025 } 974 }
975
1026 buf++; 976 buf++;
1027 } 977 }
978
1028 vals[2] = atoi (buf); 979 vals[2] = atoi (buf);
1029 980
1030/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 981/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1031 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 982 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1032} 983}
1033
1034
1035 984
1036/****************************************************************************** 985/******************************************************************************
1037 * 986 *
1038 * Start of commands the server sends to the client. 987 * Start of commands the server sends to the client.
1039 * 988 *
… …
1042/** 991/**
1043 * Asks the client to query the user. This way, the client knows 992 * Asks the client to query the user. This way, the client knows
1044 * it needs to send something back (vs just printing out a message) 993 * it needs to send something back (vs just printing out a message)
1045 */ 994 */
1046void 995void
1047send_query (NewSocket * ns, uint8 flags, char *text) 996send_query (client *ns, uint8 flags, char *text)
1048{ 997{
1049 char buf[MAX_BUF];
1050
1051 sprintf (buf, "query %d %s", flags, text ? text : ""); 998 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1052 Write_String_To_Socket (ns, buf, strlen (buf));
1053} 999}
1054 1000
1055#define AddIfInt64(Old,New,Type) if (Old != New) {\ 1001#define AddIfInt64(Old,New,Type) if (Old != New) {\
1056 Old = New; \ 1002 Old = New; \
1057 sl << uint8 (Type) << uint64 (New); \ 1003 sl << uint8 (Type) << uint64 (New); \
… …
1087esrv_update_stats (player *pl) 1033esrv_update_stats (player *pl)
1088{ 1034{
1089 char buf[MAX_BUF]; 1035 char buf[MAX_BUF];
1090 uint16 flags; 1036 uint16 flags;
1091 1037
1092 SockList sl (MAXSOCKBUF); 1038 packet sl;
1093 sl << "stats "; 1039 sl << "stats ";
1094 1040
1095 if (pl->ob != NULL) 1041 if (pl->ob)
1096 { 1042 {
1097 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1043 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);
1098 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1044 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);
1099 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1045 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);
1100 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1046 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
… …
1107 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 1053 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX);
1108 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1054 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);
1109 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1055 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1110 } 1056 }
1111 1057
1112 if (pl->socket.exp64) 1058 if (pl->socket->exp64)
1113 {
1114 uint8 s;
1115
1116 for (s = 0; s < NUM_SKILLS; s++) 1059 for (int s = 0; s < NUM_SKILLS; s++)
1117 {
1118 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 1060 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1119 { 1061 {
1120 /* Always send along the level if exp changes. This is only 1062 /* Always send along the level if exp changes. This is only
1121 * 1 extra byte, but keeps processing simpler. 1063 * 1 extra byte, but keeps processing simpler.
1122 */ 1064 */
1123 sl << uint8 (s + CS_STAT_SKILLINFO) 1065 sl << uint8 (s + CS_STAT_SKILLINFO)
1124 << uint8 (pl->last_skill_ob[s]->level) 1066 << uint8 (pl->last_skill_ob[s]->level)
1125 << uint64 (pl->last_skill_ob[s]->stats.exp); 1067 << uint64 (pl->last_skill_ob[s]->stats.exp);
1126 1068
1127 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; 1069 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1128 } 1070 }
1129 }
1130 }
1131 1071
1132 if (pl->socket.exp64) 1072 if (pl->socket->exp64)
1133 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1073 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }
1134 else 1074 else
1135 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } 1075 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1136 1076
1137 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1077 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);
… …
1150 if (pl->run_on) 1090 if (pl->run_on)
1151 flags |= SF_RUNON; 1091 flags |= SF_RUNON;
1152 1092
1153 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1093 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1154 1094
1155 if (pl->socket.sc_version < 1025) 1095 if (pl->socket->sc_version < 1025)
1156 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1096 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1157 else 1097 else
1158 {
1159 int i;
1160
1161 for (i = 0; i < NROFATTACKS; i++) 1098 for (int i = 0; i < NROFATTACKS; i++)
1162 { 1099 {
1163 /* Skip ones we won't send */ 1100 /* Skip ones we won't send */
1164 if (atnr_cs_stat[i] == -1) 1101 if (atnr_cs_stat[i] == -1)
1165 continue; 1102 continue;
1166 1103
1167 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1104 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1168 } 1105 }
1169 }
1170 1106
1171 if (pl->socket.monitor_spells) 1107 if (pl->socket->monitor_spells)
1172 { 1108 {
1173 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1109 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1174 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1110 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
1175 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 1111 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY);
1176 } 1112 }
1177 1113
1178 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 1114 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */
1179 AddIfString (pl->socket.stats.range, buf, CS_STAT_RANGE); 1115 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE);
1180 set_title (pl->ob, buf); 1116 set_title (pl->ob, buf);
1181 AddIfString (pl->socket.stats.title, buf, CS_STAT_TITLE); 1117 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE);
1182 1118
1183 /* Only send it away if we have some actual data */ 1119 /* Only send it away if we have some actual data */
1184 if (sl.len > 6) 1120 if (sl.length () > 6)
1185 { 1121 pl->socket->send_packet (sl);
1186#ifdef ESRV_DEBUG
1187 LOG (llevDebug, "Sending stats command, %d bytes long.\n", sl.len);
1188#endif
1189 Send_With_Handling (&pl->socket, &sl);
1190 }
1191
1192 sl.free ();
1193} 1122}
1194 1123
1195/** 1124/**
1196 * Tells the client that here is a player it should start using. 1125 * Tells the client that here is a player it should start using.
1197 */ 1126 */
1198void 1127void
1199esrv_new_player (player *pl, uint32 weight) 1128esrv_new_player (player *pl, uint32 weight)
1200{ 1129{
1201 pl->last_weight = weight; 1130 pl->last_weight = weight;
1202 1131
1203 SockList sl (MAXSOCKBUF); 1132 packet sl;
1204 sl << "player "; 1133 sl << "player ";
1205 1134
1206 sl << uint32 (pl->ob->count) 1135 sl << uint32 (pl->ob->count)
1207 << uint32 (weight) 1136 << uint32 (weight)
1208 << uint32 (pl->ob->face->number) 1137 << uint32 (pl->ob->face->number)
1209 << data8 (pl->ob->name); 1138 << data8 (pl->ob->name);
1210 1139
1211 Send_With_Handling (&pl->socket, &sl); 1140 pl->socket->send_packet (sl);
1212 sl.free ();
1213 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1141 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1214} 1142}
1215 1143
1216/** 1144/**
1217 * Need to send an animation sequence to the client. 1145 * Need to send an animation sequence to the client.
… …
1219 * sent them the face yet (this can become quite costly in terms of 1147 * sent them the face yet (this can become quite costly in terms of
1220 * how much we are sending - on the other hand, this should only happen 1148 * how much we are sending - on the other hand, this should only happen
1221 * when the player logs in and picks stuff up. 1149 * when the player logs in and picks stuff up.
1222 */ 1150 */
1223void 1151void
1224esrv_send_animation (NewSocket * ns, short anim_num) 1152esrv_send_animation (client * ns, short anim_num)
1225{ 1153{
1226 int i;
1227
1228 /* Do some checking on the anim_num we got. Note that the animations 1154 /* Do some checking on the anim_num we got. Note that the animations
1229 * are added in contigous order, so if the number is in the valid 1155 * are added in contigous order, so if the number is in the valid
1230 * range, it must be a valid animation. 1156 * range, it must be a valid animation.
1231 */ 1157 */
1232 if (anim_num < 0 || anim_num > num_animations) 1158 if (anim_num < 0 || anim_num > num_animations)
1233 { 1159 {
1234 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); 1160 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1235 return; 1161 return;
1236 } 1162 }
1237 1163
1238 SockList sl (MAXSOCKBUF); 1164 packet sl;
1239 1165
1240 sl << "anim " 1166 sl << "anim "
1241 << uint16 (anim_num) 1167 << uint16 (anim_num)
1242 << uint16 (0); /* flags - not used right now */ 1168 << uint16 (0); /* flags - not used right now */
1243 1169
1244 /* Build up the list of faces. Also, send any information (ie, the 1170 /* Build up the list of faces. Also, send any information (ie, the
1245 * the face itself) down to the client. 1171 * the face itself) down to the client.
1246 */ 1172 */
1247 for (i = 0; i < animations[anim_num].num_animations; i++) 1173 for (int i = 0; i < animations[anim_num].num_animations; i++)
1248 { 1174 {
1249 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1175 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1250 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1176 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1177
1251 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 1178 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1252 } 1179 }
1253 1180
1254 Send_With_Handling (ns, &sl); 1181 ns->send_packet (sl);
1255 sl.free ();
1256 1182
1257 ns->anims_sent[anim_num] = 1; 1183 ns->anims_sent[anim_num] = 1;
1258} 1184}
1259 1185
1260 1186
… …
1267/** 1193/**
1268 * This adds face_num to a map cell at x,y. If the client doesn't have 1194 * This adds face_num to a map cell at x,y. If the client doesn't have
1269 * the face yet, we will also send it. 1195 * the face yet, we will also send it.
1270 */ 1196 */
1271static void 1197static void
1272esrv_map_setbelow (NewSocket * ns, int x, int y, short face_num, struct Map *newmap) 1198esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1273{ 1199{
1274 if (newmap->cells[x][y].count >= MAP_LAYERS) 1200 if (newmap->cells[x][y].count >= MAP_LAYERS)
1275 { 1201 {
1202 //TODO: one or the other, can't both have abort and return, verify and act
1276 LOG (llevError, "Too many faces in map cell %d %d\n", x, y); 1203 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1277 return; 1204 return;
1278 abort (); 1205 abort ();
1279 } 1206 }
1280 1207
… …
1282 newmap->cells[x][y].count++; 1209 newmap->cells[x][y].count++;
1283 1210
1284 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1211 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1285 esrv_send_face (ns, face_num, 0); 1212 esrv_send_face (ns, face_num, 0);
1286} 1213}
1287
1288struct LayerCell
1289{
1290 uint16 xy;
1291 short face;
1292};
1293
1294struct MapLayer
1295{
1296 int count;
1297 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1298};
1299
1300/** Checkes if map cells have changed */
1301static int
1302mapcellchanged (NewSocket * ns, int i, int j, struct Map *newmap)
1303{
1304 int k;
1305
1306 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1307 return 1;
1308 for (k = 0; k < newmap->cells[i][j].count; k++)
1309 {
1310 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1311 {
1312 return 1;
1313 }
1314 }
1315 return 0;
1316}
1317
1318/**
1319 * Basically, what this does is pack the data into layers.
1320 * cnum is the client number, cur is the the buffer we put all of
1321 * this data into. we return the end of the data. layers is
1322 * how many layers of data we should back.
1323 */
1324static uint8 *
1325compactlayer (NewSocket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1326{
1327 int x, y, k;
1328 int face;
1329 unsigned char *fcur;
1330 struct MapLayer layers[MAP_LAYERS];
1331
1332 for (k = 0; k < MAP_LAYERS; k++)
1333 layers[k].count = 0;
1334 fcur = cur;
1335 for (x = 0; x < ns->mapx; x++)
1336 {
1337 for (y = 0; y < ns->mapy; y++)
1338 {
1339 if (!mapcellchanged (ns, x, y, newmap))
1340 continue;
1341 if (newmap->cells[x][y].count == 0)
1342 {
1343 *cur = x * ns->mapy + y; /* mark empty space */
1344 cur++;
1345 continue;
1346 }
1347 for (k = 0; k < newmap->cells[x][y].count; k++)
1348 {
1349 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1350 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1351 layers[k].count++;
1352 }
1353 }
1354 }
1355 /* If no data, return now. */
1356 if (fcur == cur && layers[0].count == 0)
1357 return cur;
1358 *cur = 255; /* mark end of explicitly cleared cells */
1359 cur++;
1360 /* First pack by layers. */
1361 for (k = 0; k < numlayers; k++)
1362 {
1363 if (layers[k].count == 0)
1364 break; /* once a layer is entirely empty, no layer below it can
1365 have anything in it either */
1366 /* Pack by entries in thie layer */
1367 for (x = 0; x < layers[k].count;)
1368 {
1369 fcur = cur;
1370 *cur = layers[k].lcells[x].face >> 8;
1371 cur++;
1372 *cur = layers[k].lcells[x].face & 0xFF;
1373 cur++;
1374 face = layers[k].lcells[x].face;
1375 /* Now, we back the redundant data into 1 byte xy pairings */
1376 for (y = x; y < layers[k].count; y++)
1377 {
1378 if (layers[k].lcells[y].face == face)
1379 {
1380 *cur = (uint8) layers[k].lcells[y].xy;
1381 cur++;
1382 layers[k].lcells[y].face = -1;
1383 }
1384 }
1385 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1386 /* forward over the now redundant data */
1387 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1388 x++;
1389 }
1390 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1391 }
1392 return cur;
1393}
1394
1395static void
1396esrv_map_doneredraw (NewSocket * ns, struct Map *newmap)
1397{
1398 static long frames, bytes, tbytes, tframes;
1399 char *cur;
1400
1401 SockList sl (MAXSOCKBUF);
1402 sl << "map ";
1403
1404 cur = (char *) compactlayer (ns, (unsigned char *) sl.buf + sl.len, MAP_LAYERS, newmap);
1405 sl.len = cur - (char *) sl.buf;
1406
1407/* LOG(llevDebug, "Sending map command.\n");*/
1408
1409 if (sl.len > (int) strlen ("map ") || ns->sent_scroll)
1410 {
1411 /* All of this is just accounting stuff */
1412 if (tframes > 100)
1413 tframes = tbytes = 0;
1414
1415 tframes++;
1416 frames++;
1417 tbytes += sl.len;
1418 bytes += sl.len;
1419 memcpy (&ns->lastmap, newmap, sizeof (struct Map));
1420 Send_With_Handling (ns, &sl);
1421 ns->sent_scroll = 0;
1422 }
1423
1424 sl.free ();
1425}
1426
1427 1214
1428/** Clears a map cell */ 1215/** Clears a map cell */
1429static void 1216static void
1430map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1217map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
1431{ 1218{
… …
1442#define MAX_LAYERS 3 1229#define MAX_LAYERS 3
1443 1230
1444/* Using a global really isn't a good approach, but saves the over head of 1231/* Using a global really isn't a good approach, but saves the over head of
1445 * allocating and deallocating such a block of data each time run through, 1232 * allocating and deallocating such a block of data each time run through,
1446 * and saves the space of allocating this in the socket object when we only 1233 * and saves the space of allocating this in the socket object when we only
1447 * need it for this cycle. If the serve is ever threaded, this needs to be 1234 * need it for this cycle. If the server is ever threaded, this needs to be
1448 * re-examined. 1235 * re-examined.
1449 */ 1236 */
1450
1451static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1237static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1452 1238
1453/** 1239/**
1454 * Returns true if any of the heads for this 1240 * Returns true if any of the heads for this
1455 * space is set. Returns false if all are blank - this is used 1241 * space is set. Returns false if all are blank - this is used
1456 * for empty space checking. 1242 * for empty space checking.
1457 */ 1243 */
1458static inline int 1244static inline int
1459have_head (int ax, int ay) 1245have_head (int ax, int ay)
1460{ 1246{
1461
1462 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1247 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1463 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) 1248 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1464 return 1; 1249 return 1;
1250
1465 return 0; 1251 return 0;
1466} 1252}
1467 1253
1468/** 1254/**
1469 * check_head is a bit simplistic version of update_space below. 1255 * check_head is a bit simplistic version of update_space below.
1470 * basically, it only checks the that the head on space ax,ay at layer 1256 * basically, it only checks the that the head on space ax,ay at layer
1471 * needs to get sent - if so, it adds the data, sending the head 1257 * needs to get sent - if so, it adds the data, sending the head
1472 * if needed, and returning 1. If this no data needs to get 1258 * if needed, and returning 1. If this no data needs to get
1473 * sent, it returns zero. 1259 * sent, it returns zero.
1474 */ 1260 */
1475static int 1261static int
1476check_head (SockList &sl, NewSocket &ns, int ax, int ay, int layer) 1262check_head (packet &sl, client &ns, int ax, int ay, int layer)
1477{ 1263{
1478 short face_num; 1264 short face_num;
1479 1265
1480 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) 1266 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1481 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; 1267 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1482 else 1268 else
1483 face_num = 0; 1269 face_num = 0;
1484 1270
1485 if (face_num != ns.lastmap.cells[ax][ay].faces[layer]) 1271 if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1486 { 1272 {
1487 SockList_AddShort (&sl, face_num); 1273 sl << uint16 (face_num);
1488 if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE)) 1274 if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1489 esrv_send_face (&ns, face_num, 0); 1275 esrv_send_face (&ns, face_num, 0);
1490 1276
1491 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL; 1277 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1492 ns.lastmap.cells[ax][ay].faces[layer] = face_num; 1278 ns.lastmap.cells[ax][ay].faces[layer] = face_num;
… …
1513 * numbers the spaces differently - I think this was a leftover from 1299 * numbers the spaces differently - I think this was a leftover from
1514 * the map command, where the faces stack up. Sinces that is no longer 1300 * the map command, where the faces stack up. Sinces that is no longer
1515 * the case, it seems to make more sense to have these layer values 1301 * the case, it seems to make more sense to have these layer values
1516 * actually match. 1302 * actually match.
1517 */ 1303 */
1518
1519static int 1304static int
1520update_space (SockList &sl, NewSocket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1305update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1521{ 1306{
1522 object *ob, *head; 1307 object *ob, *head;
1523 uint16 face_num; 1308 uint16 face_num;
1524 int bx, by, i; 1309 int bx, by, i;
1525 1310
… …
1738 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ 1523 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1739 * take. 1524 * take.
1740 */ 1525 */
1741 1526
1742static inline int 1527static inline int
1743update_smooth (SockList &sl, NewSocket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1528update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1744{ 1529{
1745 object *ob; 1530 object *ob;
1746 int smoothlevel; /* old face_num; */ 1531 int smoothlevel; /* old face_num; */
1747 1532
1748 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1533 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
… …
1782 * Returns the size of a data for a map square as returned by 1567 * Returns the size of a data for a map square as returned by
1783 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1568 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1784 * available. 1569 * available.
1785 */ 1570 */
1786int 1571int
1787getExtendedMapInfoSize (NewSocket * ns) 1572getExtendedMapInfoSize (client * ns)
1788{ 1573{
1789 int result = 0; 1574 int result = 0;
1790 1575
1791 if (ns->ext_mapinfos) 1576 if (ns->ext_mapinfos)
1792 { 1577 {
1793 if (ns->EMI_smooth) 1578 if (ns->EMI_smooth)
1794 result += 1; /*One byte for smoothlevel */ 1579 result += 1; /*One byte for smoothlevel */
1795 } 1580 }
1581
1796 return result; 1582 return result;
1797} 1583}
1798 1584
1799/** 1585/**
1800 * This function uses the new map1 protocol command to send the map 1586 * This function uses the new map1 protocol command to send the map
… …
1828 uint8 eentrysize; 1614 uint8 eentrysize;
1829 uint16 ewhatstart, ewhatflag; 1615 uint16 ewhatstart, ewhatflag;
1830 uint8 extendedinfos; 1616 uint8 extendedinfos;
1831 maptile *m; 1617 maptile *m;
1832 1618
1833 NewSocket &socket = pl->contr->socket; 1619 client &socket = *pl->contr->socket;
1834 1620
1835 check_map_change (pl->contr); 1621 check_map_change (pl->contr);
1836 1622
1837 SockList sl (MAXSOCKBUF); 1623 packet sl;
1838 SockList esl (MAXSOCKBUF); 1624 packet esl;
1839 1625
1840 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a "); 1626 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1841 startlen = sl.len; 1627 startlen = sl.length ();
1842 1628
1843 /*Extendedmapinfo structure initialisation */ 1629 /*Extendedmapinfo structure initialisation */
1844 if (socket.ext_mapinfos) 1630 if (socket.ext_mapinfos)
1845 { 1631 {
1846 extendedinfos = EMI_NOREDRAW; 1632 extendedinfos = EMI_NOREDRAW;
1847 1633
1848 if (socket.EMI_smooth) 1634 if (socket.EMI_smooth)
1849 extendedinfos |= EMI_SMOOTH; 1635 extendedinfos |= EMI_SMOOTH;
1850 1636
1851 ewhatstart = esl.len; 1637 ewhatstart = esl.length ();
1852 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit 1638 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1853 could need to be taken away */ 1639 could need to be taken away */
1854 eentrysize = getExtendedMapInfoSize (&socket); 1640 eentrysize = getExtendedMapInfoSize (&socket);
1855 esl << "mapextended " 1641 esl << "mapextended "
1856 << uint8 (extendedinfos) 1642 << uint8 (extendedinfos)
1857 << uint8 (eentrysize); 1643 << uint8 (eentrysize);
1644
1858 estartlen = esl.len; 1645 estartlen = esl.length ();
1859 } 1646 }
1860 else 1647 else
1861 { 1648 {
1862 /* suppress compiler warnings */ 1649 /* suppress compiler warnings */
1863 ewhatstart = 0; 1650 ewhatstart = 0;
… …
1901 */ 1688 */
1902 if (ax >= socket.mapx || ay >= socket.mapy) 1689 if (ax >= socket.mapx || ay >= socket.mapy)
1903 { 1690 {
1904 int i, got_one; 1691 int i, got_one;
1905 1692
1906 oldlen = sl.len; 1693 oldlen = sl.length ();
1907 1694
1908 sl << uint16 (mask); 1695 sl << uint16 (mask);
1909 1696
1910 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4; 1697 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1911 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2; 1698 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
… …
1915 * actually need to send that - just the coordinates 1702 * actually need to send that - just the coordinates
1916 * with no faces tells the client to blank out the 1703 * with no faces tells the client to blank out the
1917 * space. 1704 * space.
1918 */ 1705 */
1919 got_one = 0; 1706 got_one = 0;
1920 for (i = oldlen + 2; i < sl.len; i++) 1707 for (i = oldlen + 2; i < sl.length (); i++)
1921 if (sl.buf[i]) 1708 if (sl[i])
1922 got_one = 1; 1709 got_one = 1;
1923 1710
1924 if (got_one && (mask & 0xf)) 1711 if (got_one && (mask & 0xf))
1925 sl.buf[oldlen + 1] = mask & 0xff; 1712 sl[oldlen + 1] = mask & 0xff;
1926 else 1713 else
1927 { /*either all faces blank, either no face at all */ 1714 { /*either all faces blank, either no face at all */
1928 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */ 1715 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1929 sl.len = oldlen + 2; 1716 sl.reset (oldlen + 2);
1930 else 1717 else
1931 sl.len = oldlen; 1718 sl.reset (oldlen);
1932 } 1719 }
1933 1720
1934 /*What concerns extendinfos, nothing to be done for now 1721 /*What concerns extendinfos, nothing to be done for now
1935 * (perhaps effects layer later) 1722 * (perhaps effects layer later)
1936 */ 1723 */
… …
1966 1753
1967 /* This block deals with spaces that are not visible for whatever 1754 /* This block deals with spaces that are not visible for whatever
1968 * reason. Still may need to send the head for this space. 1755 * reason. Still may need to send the head for this space.
1969 */ 1756 */
1970 1757
1971 oldlen = sl.len; 1758 oldlen = sl.length ();
1972 1759
1973 sl << uint16 (mask); 1760 sl << uint16 (mask);
1974 1761
1975 if (lastcell.count != -1) 1762 if (lastcell.count != -1)
1976 need_send = 1; 1763 need_send = 1;
… …
1996 1783
1997 map_clearcell (&lastcell, 0, 0, 0, count); 1784 map_clearcell (&lastcell, 0, 0, 0, count);
1998 } 1785 }
1999 1786
2000 if ((mask & 0xf) || need_send) 1787 if ((mask & 0xf) || need_send)
2001 sl.buf[oldlen + 1] = mask & 0xff; 1788 sl[oldlen + 1] = mask & 0xff;
2002 else 1789 else
2003 sl.len = oldlen; 1790 sl.reset (oldlen);
2004 } 1791 }
2005 else 1792 else
2006 { 1793 {
2007 /* In this block, the space is visible or there are head objects 1794 /* In this block, the space is visible or there are head objects
2008 * we need to send. 1795 * we need to send.
… …
2010 1797
2011 /* Rather than try to figure out what everything that we might 1798 /* Rather than try to figure out what everything that we might
2012 * need to send is, then form the packet after that, 1799 * need to send is, then form the packet after that,
2013 * we presume that we will in fact form a packet, and update 1800 * we presume that we will in fact form a packet, and update
2014 * the bits by what we do actually send. If we send nothing, 1801 * the bits by what we do actually send. If we send nothing,
2015 * we just back out sl.len to the old value, and no harm 1802 * we just back out sl.length () to the old value, and no harm
2016 * is done. 1803 * is done.
2017 * I think this is simpler than doing a bunch of checks to see 1804 * I think this is simpler than doing a bunch of checks to see
2018 * what if anything we need to send, setting the bits, then 1805 * what if anything we need to send, setting the bits, then
2019 * doing those checks again to add the real data. 1806 * doing those checks again to add the real data.
2020 */ 1807 */
2021 oldlen = sl.len; 1808 oldlen = sl.length ();
2022 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1809 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2023 eoldlen = esl.len; 1810 eoldlen = esl.length ();
2024 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1811 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2025 sl << uint16 (mask); 1812 sl << uint16 (mask);
2026 1813
2027 if (socket.ext_mapinfos) 1814 if (socket.ext_mapinfos)
2028 esl << uint16 (emask); 1815 esl << uint16 (emask);
… …
2036 mask |= 0x8; 1823 mask |= 0x8;
2037 1824
2038 if (socket.extmap) 1825 if (socket.extmap)
2039 { 1826 {
2040 *last_ext |= 0x80; 1827 *last_ext |= 0x80;
2041 last_ext = sl.buf + sl.len; 1828 last_ext = &sl[sl.length ()];
2042 sl << uint8 (d); 1829 sl << uint8 (d);
2043 } 1830 }
2044 else 1831 else
2045 sl << uint8 (255 - 64 * d); 1832 sl << uint8 (255 - 64 * d);
2046 } 1833 }
… …
2080 { 1867 {
2081 lastcell.stat_hp = stat_hp; 1868 lastcell.stat_hp = stat_hp;
2082 1869
2083 mask |= 0x8; 1870 mask |= 0x8;
2084 *last_ext |= 0x80; 1871 *last_ext |= 0x80;
2085 last_ext = sl.buf + sl.len; 1872 last_ext = &sl[sl.length ()];
2086 1873
2087 sl << uint8 (5) << uint8 (stat_hp); 1874 sl << uint8 (5) << uint8 (stat_hp);
2088 1875
2089 if (stat_width > 1) 1876 if (stat_width > 1)
2090 { 1877 {
2091 *last_ext |= 0x80; 1878 *last_ext |= 0x80;
2092 last_ext = sl.buf + sl.len; 1879 last_ext = &sl[sl.length ()];
2093 1880
2094 sl << uint8 (6) << uint8 (stat_width); 1881 sl << uint8 (6) << uint8 (stat_width);
2095 } 1882 }
2096 } 1883 }
2097 1884
… …
2099 { 1886 {
2100 lastcell.player = player; 1887 lastcell.player = player;
2101 1888
2102 mask |= 0x8; 1889 mask |= 0x8;
2103 *last_ext |= 0x80; 1890 *last_ext |= 0x80;
2104 last_ext = sl.buf + sl.len; 1891 last_ext = &sl[sl.length ()];
2105 1892
2106 sl << uint8 (0x47) << uint8 (8) << (uint64)player; 1893 sl << uint8 (0x47) << uint8 (8) << (uint64)player;
2107 } 1894 }
2108 1895
2109 if (lastcell.flags != flags) 1896 if (lastcell.flags != flags)
2110 { 1897 {
2111 lastcell.flags = flags; 1898 lastcell.flags = flags;
2112 1899
2113 mask |= 0x8; 1900 mask |= 0x8;
2114 *last_ext |= 0x80; 1901 *last_ext |= 0x80;
2115 last_ext = sl.buf + sl.len; 1902 last_ext = &sl[sl.length ()];
2116 1903
2117 sl << uint8 (8) << uint8 (flags); 1904 sl << uint8 (8) << uint8 (flags);
2118 } 1905 }
2119 } 1906 }
2120 1907
… …
2162 * space by checking the mask. If so, update the mask. 1949 * space by checking the mask. If so, update the mask.
2163 * if not, reset the len to that from before adding the mask 1950 * if not, reset the len to that from before adding the mask
2164 * value, so we don't send those bits. 1951 * value, so we don't send those bits.
2165 */ 1952 */
2166 if (mask & 0xf) 1953 if (mask & 0xf)
2167 sl.buf[oldlen + 1] = mask & 0xff; 1954 sl[oldlen + 1] = mask & 0xff;
2168 else 1955 else
2169 sl.len = oldlen; 1956 sl.reset (oldlen);
2170 1957
2171 if (emask & 0xf) 1958 if (emask & 0xf)
2172 esl.buf[eoldlen + 1] = emask & 0xff; 1959 esl[eoldlen + 1] = emask & 0xff;
2173 else 1960 else
2174 esl.len = eoldlen; 1961 esl.reset (eoldlen);
2175 } /* else this is a viewable space */ 1962 } /* else this is a viewable space */
2176 } /* for x loop */ 1963 } /* for x loop */
2177 } /* for y loop */ 1964 } /* for y loop */
2178 1965
2179 /* Verify that we in fact do need to send this */ 1966 /* Verify that we in fact do need to send this */
2180 if (socket.ext_mapinfos) 1967 if (socket.ext_mapinfos)
2181 { 1968 {
2182 if (!(sl.len > startlen || socket.sent_scroll)) 1969 if (!(sl.length () > startlen || socket.sent_scroll))
2183 { 1970 {
2184 /* No map data will follow, so don't say the client 1971 /* No map data will follow, so don't say the client
2185 * it doesn't need draw! 1972 * it doesn't need draw!
2186 */ 1973 */
2187 ewhatflag &= (~EMI_NOREDRAW); 1974 ewhatflag &= (~EMI_NOREDRAW);
2188 esl.buf[ewhatstart + 1] = ewhatflag & 0xff; 1975 esl[ewhatstart + 1] = ewhatflag & 0xff;
2189 } 1976 }
2190 1977
2191 if (esl.len > estartlen) 1978 if (esl.length () > estartlen)
2192 Send_With_Handling (&socket, &esl); 1979 socket.send_packet (esl);
2193 } 1980 }
2194 1981
2195 if (sl.len > startlen || socket.sent_scroll) 1982 if (sl.length () > startlen || socket.sent_scroll)
2196 { 1983 {
2197 Send_With_Handling (&socket, &sl); 1984 socket.send_packet (sl);
2198 socket.sent_scroll = 0; 1985 socket.sent_scroll = 0;
2199 } 1986 }
2200
2201 sl.free ();
2202 esl.free ();
2203} 1987}
2204 1988
2205/** 1989/**
2206 * Draws client map. 1990 * Draws client map.
2207 */ 1991 */
… …
2231 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 2015 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2232 return; 2016 return;
2233 2017
2234 memset (&newmap, 0, sizeof (struct Map)); 2018 memset (&newmap, 0, sizeof (struct Map));
2235 2019
2236 for (j = (pl->y - pl->contr->socket.mapy / 2); j < (pl->y + (pl->contr->socket.mapy + 1) / 2); j++) 2020 for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++)
2237 { 2021 {
2238 for (i = (pl->x - pl->contr->socket.mapx / 2); i < (pl->x + (pl->contr->socket.mapx + 1) / 2); i++) 2022 for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++)
2239 { 2023 {
2240 ax = i; 2024 ax = i;
2241 ay = j; 2025 ay = j;
2242 m = pm; 2026 m = pm;
2243 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2027 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2028
2244 if (mflags & P_OUT_OF_MAP) 2029 if (mflags & P_OUT_OF_MAP)
2245 continue; 2030 continue;
2031
2246 if (mflags & P_NEED_UPDATE) 2032 if (mflags & P_NEED_UPDATE)
2247 update_position (m, ax, ay); 2033 update_position (m, ax, ay);
2034
2248 /* If a map is visible to the player, we don't want to swap it out 2035 /* If a map is visible to the player, we don't want to swap it out
2249 * just to reload it. This should really call something like 2036 * just to reload it. This should really call something like
2250 * swap_map, but this is much more efficient and 'good enough' 2037 * swap_map, but this is much more efficient and 'good enough'
2251 */ 2038 */
2252 if (mflags & P_NEW_MAP) 2039 if (mflags & P_NEW_MAP)
… …
2258 { 2045 {
2259 update_los (pl); 2046 update_los (pl);
2260 pl->contr->do_los = 0; 2047 pl->contr->do_los = 0;
2261 } 2048 }
2262 2049
2263 if (pl->contr->socket.mapmode == Map1Cmd || pl->contr->socket.mapmode == Map1aCmd)
2264 {
2265 /* Big maps need a different drawing mechanism to work */ 2050 /* Big maps need a different drawing mechanism to work */
2266 draw_client_map1 (pl); 2051 draw_client_map1 (pl);
2267 return;
2268 }
2269
2270 if (pl->invisible & (pl->invisible < 50 ? 4 : 1))
2271 {
2272 esrv_map_setbelow (&pl->contr->socket, pl->contr->socket.mapx / 2, pl->contr->socket.mapy / 2, pl->face->number, &newmap);
2273 }
2274
2275 /* j and i are the y and x coordinates of the real map (which is
2276 * basically some number of spaces around the player)
2277 * ax and ay are values from within the viewport (ie, 0, 0 is upper
2278 * left corner) and are thus disconnected from the map values.
2279 * Subtract 1 from the max values so that we properly handle cases where
2280 * player has specified an even map. Otherwise, we try to send them too
2281 * much, ie, if mapx is 10, we would try to send from -5 to 5, which is actually
2282 * 11 spaces. Now, we would send from -5 to 4, which is properly. If mapx is
2283 * odd, this still works fine.
2284 */
2285 ay = 0;
2286 for (j = pl->y - pl->contr->socket.mapy / 2; j <= pl->y + (pl->contr->socket.mapy - 1) / 2; j++, ay++)
2287 {
2288 ax = 0;
2289 for (i = pl->x - pl->contr->socket.mapx / 2; i <= pl->x + (pl->contr->socket.mapx - 1) / 2; i++, ax++)
2290 {
2291
2292 d = pl->contr->blocked_los[ax][ay];
2293 /* note the out_of_map and d>3 checks are both within the same
2294 * negation check.
2295 */
2296 nx = i;
2297 ny = j;
2298 m = get_map_from_coord (pm, &nx, &ny);
2299 if (m && d < 4)
2300 {
2301 face = GET_MAP_FACE (m, nx, ny, 0);
2302 floor2 = GET_MAP_FACE (m, nx, ny, 1);
2303 floor = GET_MAP_FACE (m, nx, ny, 2);
2304
2305 /* If all is blank, send a blank face. */
2306 if ((!face || face == blank_face) && (!floor2 || floor2 == blank_face) && (!floor || floor == blank_face))
2307 {
2308 esrv_map_setbelow (&pl->contr->socket, ax, ay, blank_face->number, &newmap);
2309 }
2310 else
2311 { /* actually have something interesting */
2312 /* send the darkness mask, if any. */
2313 if (d && pl->contr->socket.darkness)
2314 esrv_map_setbelow (&pl->contr->socket, ax, ay, dark_faces[d - 1]->number, &newmap);
2315
2316 if (face && face != blank_face)
2317 esrv_map_setbelow (&pl->contr->socket, ax, ay, face->number, &newmap);
2318 if (floor2 && floor2 != blank_face)
2319 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor2->number, &newmap);
2320 if (floor && floor != blank_face)
2321 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor->number, &newmap);
2322 }
2323 } /* Is a valid space */
2324 }
2325 }
2326
2327 esrv_map_doneredraw (&pl->contr->socket, &newmap);
2328
2329 check_map_change (pl->contr);
2330} 2052}
2331 2053
2332 2054
2333/*****************************************************************************/ 2055/*****************************************************************************/
2334 2056
… …
2340 2062
2341/*****************************************************************************/ 2063/*****************************************************************************/
2342void 2064void
2343send_plugin_custom_message (object *pl, char *buf) 2065send_plugin_custom_message (object *pl, char *buf)
2344{ 2066{
2345 cs_write_string (&pl->contr->socket, buf, strlen (buf)); 2067 pl->contr->socket->send_packet (buf);
2346} 2068}
2347 2069
2348/** 2070/**
2349 * This sends the skill number to name mapping. We ignore 2071 * This sends the skill number to name mapping. We ignore
2350 * the params - we always send the same info no matter what. 2072 * the params - we always send the same info no matter what.
2351 */ 2073 */
2352void 2074void
2353send_skill_info (NewSocket *ns, char *params) 2075send_skill_info (client *ns, char *params)
2354{ 2076{
2355 SockList sl (MAXSOCKBUF); 2077 packet sl;
2356 sl << "replyinfo skill_info\n"; 2078 sl << "replyinfo skill_info\n";
2357 2079
2358 for (int i = 1; i < NUM_SKILLS; i++) 2080 for (int i = 1; i < NUM_SKILLS; i++)
2359 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); 2081 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
2360 2082
2361 if (sl.len >= MAXSOCKBUF) 2083 if (sl.length () >= MAXSOCKBUF)
2362 { 2084 {
2363 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 2085 LOG (llevError, "Buffer overflow in send_skill_info!\n");
2364 fatal (0); 2086 fatal (0);
2365 } 2087 }
2366 2088
2367 Send_With_Handling (ns, &sl); 2089 ns->send_packet (sl);
2368 sl.free ();
2369} 2090}
2370 2091
2371/** 2092/**
2372 * This sends the spell path to name mapping. We ignore 2093 * This sends the spell path to name mapping. We ignore
2373 * the params - we always send the same info no matter what. 2094 * the params - we always send the same info no matter what.
2374 */ 2095 */
2375void 2096void
2376send_spell_paths (NewSocket * ns, char *params) 2097send_spell_paths (client * ns, char *params)
2377{ 2098{
2378 SockList sl (MAXSOCKBUF); 2099 packet sl;
2379 2100
2380 sl << "replyinfo spell_paths\n"; 2101 sl << "replyinfo spell_paths\n";
2381 2102
2382 for (int i = 0; i < NRSPELLPATHS; i++) 2103 for (int i = 0; i < NRSPELLPATHS; i++)
2383 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); 2104 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
2384 2105
2385 if (sl.len >= MAXSOCKBUF) 2106 if (sl.length () >= MAXSOCKBUF)
2386 { 2107 {
2387 LOG (llevError, "Buffer overflow in send_spell_paths!\n"); 2108 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
2388 fatal (0); 2109 fatal (0);
2389 } 2110 }
2390 2111
2391 Send_With_Handling (ns, &sl); 2112 ns->send_packet (sl);
2392 sl.free ();
2393} 2113}
2394 2114
2395/** 2115/**
2396 * This looks for any spells the player may have that have changed their stats. 2116 * This looks for any spells the player may have that have changed their stats.
2397 * it then sends an updspell packet for each spell that has changed in this way 2117 * it then sends an updspell packet for each spell that has changed in this way
2398 */ 2118 */
2399void 2119void
2400esrv_update_spells (player *pl) 2120esrv_update_spells (player *pl)
2401{ 2121{
2402 if (!pl->socket.monitor_spells) 2122 if (!pl->socket->monitor_spells)
2403 return; 2123 return;
2404 2124
2405 for (object *spell = pl->ob->inv; spell; spell = spell->below) 2125 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2406 { 2126 {
2407 if (spell->type == SPELL) 2127 if (spell->type == SPELL)
… …
2427 flags |= UPD_SP_DAMAGE; 2147 flags |= UPD_SP_DAMAGE;
2428 } 2148 }
2429 2149
2430 if (flags) 2150 if (flags)
2431 { 2151 {
2432 SockList sl (MAXSOCKBUF); 2152 packet sl;
2433 2153
2434 sl << "updspell " 2154 sl << "updspell "
2435 << uint8 (flags) 2155 << uint8 (flags)
2436 << uint32 (spell->count); 2156 << uint32 (spell->count);
2437 2157
2438 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 2158 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2439 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 2159 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2440 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 2160 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2441 2161
2442 Send_With_Handling (&pl->socket, &sl); 2162 pl->socket->send_packet (sl);
2443 sl.free ();
2444 } 2163 }
2445 } 2164 }
2446 } 2165 }
2447} 2166}
2448 2167
2449void 2168void
2450esrv_remove_spell (player *pl, object *spell) 2169esrv_remove_spell (player *pl, object *spell)
2451{ 2170{
2452 if (!pl->socket.monitor_spells) 2171 if (!pl->socket->monitor_spells)
2453 return; 2172 return;
2454 2173
2455 if (!pl || !spell || spell->env != pl->ob) 2174 if (!pl || !spell || spell->env != pl->ob)
2456 { 2175 {
2457 LOG (llevError, "Invalid call to esrv_remove_spell"); 2176 LOG (llevError, "Invalid call to esrv_remove_spell");
2458 return; 2177 return;
2459 } 2178 }
2460 2179
2461 SockList sl (MAXSOCKBUF); 2180 packet sl;
2462 2181
2463 sl << "delspell " 2182 sl << "delspell "
2464 << uint32 (spell->count); 2183 << uint32 (spell->count);
2465 2184
2466 Send_With_Handling (&pl->socket, &sl); 2185 pl->socket->send_packet (sl);
2467 sl.free ();
2468} 2186}
2469 2187
2470/* appends the spell *spell to the Socklist we will send the data to. */ 2188/* appends the spell *spell to the Socklist we will send the data to. */
2471static void 2189static void
2472append_spell (player *pl, SockList &sl, object *spell) 2190append_spell (player *pl, packet &sl, object *spell)
2473{ 2191{
2474 int len, i, skill = 0; 2192 int len, i, skill = 0;
2475 2193
2476 if (!(spell->name)) 2194 if (!(spell->name))
2477 { 2195 {
… …
2520 { 2238 {
2521 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); 2239 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2522 return; 2240 return;
2523 } 2241 }
2524 2242
2525 if (!pl->socket.monitor_spells) 2243 if (!pl->socket->monitor_spells)
2526 return; 2244 return;
2527 2245
2528 SockList sl (MAXSOCKBUF); 2246 packet sl;
2529
2530 sl << "addspell "; 2247 sl << "addspell ";
2531 2248
2532 if (!spell) 2249 if (!spell)
2533 { 2250 {
2534 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2251 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
… …
2547 * like it will fix this 2264 * like it will fix this
2548 */ 2265 */
2549 if (spell->type != SPELL) 2266 if (spell->type != SPELL)
2550 continue; 2267 continue;
2551 2268
2552 if (sl.len >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 2269 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2553 { 2270 {
2554 Send_With_Handling (&pl->socket, &sl); 2271 pl->socket->send_packet (sl);
2555 strcpy ((char *) sl.buf, "addspell "); 2272
2556 sl.len = strlen ((char *) sl.buf); 2273 sl.reset ();
2274 sl << "addspell ";
2557 } 2275 }
2558 2276
2559 append_spell (pl, sl, spell); 2277 append_spell (pl, sl, spell);
2560 } 2278 }
2561 } 2279 }
… …
2572 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 2290 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2573 fatal (0); 2291 fatal (0);
2574 } 2292 }
2575 2293
2576 /* finally, we can send the packet */ 2294 /* finally, we can send the packet */
2577 Send_With_Handling (&pl->socket, &sl); 2295 pl->socket->send_packet (sl);
2578
2579 sl.free ();
2580} 2296}
2581 2297

Diff Legend

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