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.31 by root, Thu Dec 14 00:23:59 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 = net_uint16 (buf); 790 uint16 cmdid = net_uint16 ((uint8 *)buf);
799 repeat = net_uint32 (buf + 2); 791 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
800 792
801 /* -1 is special - no repeat, but don't update */ 793 /* -1 is special - no repeat, but don't update */
802 if (repeat != -1) 794 if (repeat != -1)
803 pl->count = repeat; 795 pl->count = repeat;
804 796
805 if ((len - 4) >= MAX_BUF) 797 buf += 6; //len -= 6;
806 len = MAX_BUF - 5;
807 798
808 strncpy ((char *) command, (char *) buf + 6, len - 4);
809 command[len - 4] = '\0';
810
811 /* The following should never happen with a proper or honest client.
812 * Therefore, the error message doesn't have to be too clear - if
813 * someone is playing with a hacked/non working client, this gives them
814 * an idea of the problem, but they deserve what they get
815 */
816 if (pl->state != ST_PLAYING)
817 {
818 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
819 return;
820 }
821
822 /* This should not happen anymore. */
823 if (pl->ob->speed_left < -1.0)
824 LOG (llevError, "Player has negative time - shouldn't do command.\n");
825
826 /* In c_new.c */
827 execute_newserver_command (pl->ob, (char *) command); 799 execute_newserver_command (pl->ob, buf);
800
828 /* Perhaps something better should be done with a left over count. 801 /* Perhaps something better should be done with a left over count.
829 * Cleaning up the input should probably be done first - all actions 802 * Cleaning up the input should probably be done first - all actions
830 * 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
831 * commands. 804 * commands.
832 */ 805 */
833 pl->count = 0; 806 pl->count = 0;
834 807
808 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
835 if (FABS (pl->ob->speed) < 0.001) 809 int time = FABS (pl->ob->speed) < 0.001
836 time = MAX_TIME * 100; 810 ? time = MAX_TIME * 100
837 else
838 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 811 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
839 812
840 /* Send confirmation of command execution now */ 813 /* Send confirmation of command execution now */
841 814 packet sl;
842 SockList sl (MAXSOCKBUF);
843 sl << "comc " << uint16 (packet) << uint32 (time); 815 sl << "comc " << uint16 (cmdid) << uint32 (time);
844 Send_With_Handling (&pl->socket, &sl); 816 pl->socket->send_packet (sl);
845 sl.free ();
846} 817}
847 818
848 819
849/** This is a reply to a previous query. */ 820/** This is a reply to a previous query. */
850void 821void
851ReplyCmd (char *buf, int len, player *pl) 822ReplyCmd (char *buf, int len, player *pl)
852{ 823{
853 /* 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
854 * 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
855 * once all the X11 code is removed from the server. 826 * once all the X11 code is removed from the server.
856 * 827 *
857 * 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
858 * think it was the carriage return that was entered, and the 829 * think it was the carriage return that was entered, and the
859 * function then does not try to do additional input. 830 * function then does not try to do additional input.
… …
862 833
863 /* this avoids any hacking here */ 834 /* this avoids any hacking here */
864 835
865 switch (pl->state) 836 switch (pl->state)
866 { 837 {
867 case ST_PLAYING: 838 case ST_PLAYING:
868 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 839 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
869 break; 840 break;
870 841
871 case ST_PLAY_AGAIN: 842 case ST_PLAY_AGAIN:
872 /* We can check this for return value (2==quit). Maybe we 843 /* We can check this for return value (2==quit). Maybe we
873 * should, and do something appropriate? 844 * should, and do something appropriate?
874 */ 845 */
875 receive_play_again (pl->ob, buf[0]); 846 receive_play_again (pl->ob, buf[0]);
876 break; 847 break;
877 848
878 case ST_ROLL_STAT: 849 case ST_ROLL_STAT:
879 key_roll_stat (pl->ob, buf[0]); 850 key_roll_stat (pl->ob, buf[0]);
880 break; 851 break;
881 852
882 case ST_CHANGE_CLASS: 853 case ST_CHANGE_CLASS:
883 854
884 key_change_class (pl->ob, buf[0]); 855 key_change_class (pl->ob, buf[0]);
885 break; 856 break;
886 857
887 case ST_CONFIRM_QUIT: 858 case ST_CONFIRM_QUIT:
888 key_confirm_quit (pl->ob, buf[0]); 859 key_confirm_quit (pl->ob, buf[0]);
889 break; 860 break;
890 861
891 case ST_CONFIGURE: 862 case ST_CONFIGURE:
892 LOG (llevError, "In client input handling, but into configure state\n"); 863 LOG (llevError, "In client input handling, but into configure state\n");
893 pl->state = ST_PLAYING; 864 pl->state = ST_PLAYING;
894 break; 865 break;
895 866
896 case ST_GET_NAME: 867 case ST_GET_NAME:
897 receive_player_name (pl->ob, 13); 868 receive_player_name (pl->ob, 13);
898 break; 869 break;
899 870
900 case ST_GET_PASSWORD: 871 case ST_GET_PASSWORD:
901 case ST_CONFIRM_PASSWORD: 872 case ST_CONFIRM_PASSWORD:
902 receive_player_password (pl->ob, 13); 873 receive_player_password (pl->ob, 13);
903 break; 874 break;
904 875
905 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 876 case ST_GET_PARTY_PASSWORD: /* Get password for party */
906 receive_party_password (pl->ob, 13); 877 receive_party_password (pl->ob, 13);
907 break; 878 break;
908 879
909 default: 880 default:
910 LOG (llevError, "Unknown input state: %d\n", pl->state); 881 LOG (llevError, "Unknown input state: %d\n", pl->state);
911 } 882 }
912} 883}
913 884
914/** 885/**
915 * 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
… …
917 * 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
918 * 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
919 * problem. 890 * problem.
920 */ 891 */
921void 892void
922VersionCmd (char *buf, int len, NewSocket * ns) 893VersionCmd (char *buf, int len, client * ns)
923{ 894{
924 char *cp;
925 char version_warning[256];
926
927 if (!buf) 895 if (!buf)
928 { 896 {
929 LOG (llevError, "CS: received corrupted version command\n"); 897 LOG (llevError, "CS: received corrupted version command\n");
930 return; 898 return;
931 } 899 }
932 900
933 ns->cs_version = atoi (buf); 901 ns->cs_version = atoi (buf);
934 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
935 if (VERSION_CS != ns->cs_version) 909 //if (VERSION_CS != ns->cs_version)
936 { 910 // unchecked;
937#ifdef ESRV_DEBUG 911
938 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
939#endif
940 }
941 cp = strchr (buf + 1, ' '); 912 char *cp = strchr (buf + 1, ' ');
942 if (!cp) 913 if (!cp)
943 return; 914 return;
915
944 ns->sc_version = atoi (cp); 916 ns->sc_version = atoi (cp);
917
945 if (VERSION_SC != ns->sc_version) 918 //if (VERSION_SC != ns->sc_version)
946 { 919 // unchecked;
947#ifdef ESRV_DEBUG 920
948 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
949#endif
950 }
951 cp = strchr (cp + 1, ' '); 921 cp = strchr (cp + 1, ' ');
922
952 if (cp) 923 if (cp)
953 { 924 {
954 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 925 assign (ns->version, cp + 1);
955 926
956 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1);
957
958 /* This is first implementation - i skip all beta DX clients with it
959 * Add later stuff here for other clients
960 */
961
962 /* these are old dxclients */
963 /* Version 1024 added support for singular + plural name values -
964 * requiing this minimal value reduces complexity of that code, and it
965 * has been around for a long time.
966 */
967 if (ns->sc_version < 1026) 927 if (ns->sc_version < 1026)
968 { 928 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
969 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
970 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 929 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
971 Write_String_To_Socket (ns, version_warning, strlen (version_warning));
972 }
973
974 } 930 }
975} 931}
976 932
977/** sound related functions. */ 933/** sound related functions. */
978
979void 934void
980SetSound (char *buf, int len, NewSocket * ns) 935SetSound (char *buf, int len, client * ns)
981{ 936{
982 ns->sound = atoi (buf); 937 ns->sound = atoi (buf);
983} 938}
984 939
985/** client wants the map resent */ 940/** client wants the map resent */
986 941
987void 942void
988MapRedrawCmd (char *buf, int len, player *pl) 943MapRedrawCmd (char *buf, int len, player *pl)
989{ 944{
990
991/* 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
992 * 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.
993 * Unfortunately this solution does not work because some client versions send 947 * Unfortunately this solution does not work because some client versions send
994 * a mapredraw command after receiving a newmap command. 948 * a mapredraw command after receiving a newmap command.
995 */ 949 */
996#if 0
997 /* Okay, this is MAJOR UGLY. but the only way I know how to
998 * clear the "cache"
999 */
1000 memset (&pl->socket.lastmap, 0, sizeof (struct Map));
1001 draw_client_map (pl->ob);
1002#endif
1003} 950}
1004 951
1005/** 952/**
1006 * Moves an object (typically, container to inventory). 953 * Moves an object (typically, container to inventory).
1007 * syntax is: move (to) (tag) (nrof) 954 * syntax is: move (to) (tag) (nrof)
… …
1010MoveCmd (char *buf, int len, player *pl) 957MoveCmd (char *buf, int len, player *pl)
1011{ 958{
1012 int vals[3], i; 959 int vals[3], i;
1013 960
1014 /* A little funky here. We only cycle for 2 records, because 961 /* A little funky here. We only cycle for 2 records, because
1015 * 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
1016 * record. Perhaps we should just replace this with a 963 * record. Perhaps we should just replace this with a
1017 * sscanf? 964 * sscanf?
1018 */ 965 */
1019 for (i = 0; i < 2; i++) 966 for (i = 0; i < 2; i++)
1020 { 967 {
1021 vals[i] = atoi (buf); 968 vals[i] = atoi (buf);
969
1022 if (!(buf = strchr (buf, ' '))) 970 if (!(buf = strchr (buf, ' ')))
1023 { 971 {
1024 LOG (llevError, "Incomplete move command: %s\n", buf); 972 LOG (llevError, "Incomplete move command: %s\n", buf);
1025 return; 973 return;
1026 } 974 }
975
1027 buf++; 976 buf++;
1028 } 977 }
978
1029 vals[2] = atoi (buf); 979 vals[2] = atoi (buf);
1030 980
1031/* 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]);*/
1032 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 982 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1033} 983}
1034
1035
1036 984
1037/****************************************************************************** 985/******************************************************************************
1038 * 986 *
1039 * Start of commands the server sends to the client. 987 * Start of commands the server sends to the client.
1040 * 988 *
… …
1043/** 991/**
1044 * 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
1045 * 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)
1046 */ 994 */
1047void 995void
1048send_query (NewSocket * ns, uint8 flags, char *text) 996send_query (client *ns, uint8 flags, char *text)
1049{ 997{
1050 char buf[MAX_BUF];
1051
1052 sprintf (buf, "query %d %s", flags, text ? text : ""); 998 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1053 Write_String_To_Socket (ns, buf, strlen (buf));
1054} 999}
1055 1000
1056#define AddIfInt64(Old,New,Type) if (Old != New) {\ 1001#define AddIfInt64(Old,New,Type) if (Old != New) {\
1057 Old = New; \ 1002 Old = New; \
1058 sl << uint8 (Type) << uint64 (New); \ 1003 sl << uint8 (Type) << uint64 (New); \
… …
1088esrv_update_stats (player *pl) 1033esrv_update_stats (player *pl)
1089{ 1034{
1090 char buf[MAX_BUF]; 1035 char buf[MAX_BUF];
1091 uint16 flags; 1036 uint16 flags;
1092 1037
1093 SockList sl (MAXSOCKBUF); 1038 packet sl;
1094 sl << "stats "; 1039 sl << "stats ";
1095 1040
1096 if (pl->ob != NULL) 1041 if (pl->ob)
1097 { 1042 {
1098 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);
1099 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);
1100 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);
1101 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);
… …
1108 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);
1109 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);
1110 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);
1111 } 1056 }
1112 1057
1113 if (pl->socket.exp64) 1058 if (pl->socket->exp64)
1114 {
1115 uint8 s;
1116
1117 for (s = 0; s < NUM_SKILLS; s++) 1059 for (int s = 0; s < NUM_SKILLS; s++)
1118 {
1119 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)
1120 { 1061 {
1121 /* Always send along the level if exp changes. This is only 1062 /* Always send along the level if exp changes. This is only
1122 * 1 extra byte, but keeps processing simpler. 1063 * 1 extra byte, but keeps processing simpler.
1123 */ 1064 */
1124 sl << uint8 (s + CS_STAT_SKILLINFO) 1065 sl << uint8 (s + CS_STAT_SKILLINFO)
1125 << uint8 (pl->last_skill_ob[s]->level) 1066 << uint8 (pl->last_skill_ob[s]->level)
1126 << uint64 (pl->last_skill_ob[s]->stats.exp); 1067 << uint64 (pl->last_skill_ob[s]->stats.exp);
1127 1068
1128 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;
1129 } 1070 }
1130 }
1131 }
1132 1071
1133 if (pl->socket.exp64) 1072 if (pl->socket->exp64)
1134 { 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) }
1135 else 1074 else
1136 { 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) }
1137 1076
1138 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1077 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);
… …
1151 if (pl->run_on) 1090 if (pl->run_on)
1152 flags |= SF_RUNON; 1091 flags |= SF_RUNON;
1153 1092
1154 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1093 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1155 1094
1156 if (pl->socket.sc_version < 1025) 1095 if (pl->socket->sc_version < 1025)
1157 { 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) }
1158 else 1097 else
1159 {
1160 int i;
1161
1162 for (i = 0; i < NROFATTACKS; i++) 1098 for (int i = 0; i < NROFATTACKS; i++)
1163 { 1099 {
1164 /* Skip ones we won't send */ 1100 /* Skip ones we won't send */
1165 if (atnr_cs_stat[i] == -1) 1101 if (atnr_cs_stat[i] == -1)
1166 continue; 1102 continue;
1167 1103
1168 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]);
1169 } 1105 }
1170 }
1171 1106
1172 if (pl->socket.monitor_spells) 1107 if (pl->socket->monitor_spells)
1173 { 1108 {
1174 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);
1175 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);
1176 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);
1177 } 1112 }
1178 1113
1179 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 */
1180 AddIfString (pl->socket.stats.range, buf, CS_STAT_RANGE); 1115 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE);
1181 set_title (pl->ob, buf); 1116 set_title (pl->ob, buf);
1182 AddIfString (pl->socket.stats.title, buf, CS_STAT_TITLE); 1117 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE);
1183 1118
1184 /* Only send it away if we have some actual data */ 1119 /* Only send it away if we have some actual data */
1185 if (sl.len > 6) 1120 if (sl.length () > 6)
1186 { 1121 pl->socket->send_packet (sl);
1187#ifdef ESRV_DEBUG
1188 LOG (llevDebug, "Sending stats command, %d bytes long.\n", sl.len);
1189#endif
1190 Send_With_Handling (&pl->socket, &sl);
1191 }
1192
1193 sl.free ();
1194} 1122}
1195 1123
1196/** 1124/**
1197 * 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.
1198 */ 1126 */
1199void 1127void
1200esrv_new_player (player *pl, uint32 weight) 1128esrv_new_player (player *pl, uint32 weight)
1201{ 1129{
1202 pl->last_weight = weight; 1130 pl->last_weight = weight;
1203 1131
1204 SockList sl (MAXSOCKBUF); 1132 packet sl;
1205 sl << "player "; 1133 sl << "player ";
1206 1134
1207 sl << uint32 (pl->ob->count) 1135 sl << uint32 (pl->ob->count)
1208 << uint32 (weight) 1136 << uint32 (weight)
1209 << uint32 (pl->ob->face->number) 1137 << uint32 (pl->ob->face->number)
1210 << data8 (pl->ob->name); 1138 << data8 (pl->ob->name);
1211 1139
1212 Send_With_Handling (&pl->socket, &sl); 1140 pl->socket->send_packet (sl);
1213 sl.free ();
1214 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1141 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1215} 1142}
1216 1143
1217/** 1144/**
1218 * Need to send an animation sequence to the client. 1145 * Need to send an animation sequence to the client.
… …
1220 * 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
1221 * 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
1222 * when the player logs in and picks stuff up. 1149 * when the player logs in and picks stuff up.
1223 */ 1150 */
1224void 1151void
1225esrv_send_animation (NewSocket * ns, short anim_num) 1152esrv_send_animation (client * ns, short anim_num)
1226{ 1153{
1227 int i;
1228
1229 /* 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
1230 * 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
1231 * range, it must be a valid animation. 1156 * range, it must be a valid animation.
1232 */ 1157 */
1233 if (anim_num < 0 || anim_num > num_animations) 1158 if (anim_num < 0 || anim_num > num_animations)
1234 { 1159 {
1235 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);
1236 return; 1161 return;
1237 } 1162 }
1238 1163
1239 SockList sl (MAXSOCKBUF); 1164 packet sl;
1240 1165
1241 sl << "anim " 1166 sl << "anim "
1242 << uint16 (anim_num) 1167 << uint16 (anim_num)
1243 << uint16 (0); /* flags - not used right now */ 1168 << uint16 (0); /* flags - not used right now */
1244 1169
1245 /* 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
1246 * the face itself) down to the client. 1171 * the face itself) down to the client.
1247 */ 1172 */
1248 for (i = 0; i < animations[anim_num].num_animations; i++) 1173 for (int i = 0; i < animations[anim_num].num_animations; i++)
1249 { 1174 {
1250 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))
1251 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1176 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1177
1252 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 */
1253 } 1179 }
1254 1180
1255 Send_With_Handling (ns, &sl); 1181 ns->send_packet (sl);
1256 sl.free ();
1257 1182
1258 ns->anims_sent[anim_num] = 1; 1183 ns->anims_sent[anim_num] = 1;
1259} 1184}
1260 1185
1261 1186
… …
1268/** 1193/**
1269 * 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
1270 * the face yet, we will also send it. 1195 * the face yet, we will also send it.
1271 */ 1196 */
1272static void 1197static void
1273esrv_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)
1274{ 1199{
1275 if (newmap->cells[x][y].count >= MAP_LAYERS) 1200 if (newmap->cells[x][y].count >= MAP_LAYERS)
1276 { 1201 {
1202 //TODO: one or the other, can't both have abort and return, verify and act
1277 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);
1278 return; 1204 return;
1279 abort (); 1205 abort ();
1280 } 1206 }
1281 1207
… …
1283 newmap->cells[x][y].count++; 1209 newmap->cells[x][y].count++;
1284 1210
1285 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1211 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1286 esrv_send_face (ns, face_num, 0); 1212 esrv_send_face (ns, face_num, 0);
1287} 1213}
1288
1289struct LayerCell
1290{
1291 uint16 xy;
1292 short face;
1293};
1294
1295struct MapLayer
1296{
1297 int count;
1298 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1299};
1300
1301/** Checkes if map cells have changed */
1302static int
1303mapcellchanged (NewSocket * ns, int i, int j, struct Map *newmap)
1304{
1305 int k;
1306
1307 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1308 return 1;
1309 for (k = 0; k < newmap->cells[i][j].count; k++)
1310 {
1311 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1312 {
1313 return 1;
1314 }
1315 }
1316 return 0;
1317}
1318
1319/**
1320 * Basically, what this does is pack the data into layers.
1321 * cnum is the client number, cur is the the buffer we put all of
1322 * this data into. we return the end of the data. layers is
1323 * how many layers of data we should back.
1324 */
1325static uint8 *
1326compactlayer (NewSocket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1327{
1328 int x, y, k;
1329 int face;
1330 unsigned char *fcur;
1331 struct MapLayer layers[MAP_LAYERS];
1332
1333 for (k = 0; k < MAP_LAYERS; k++)
1334 layers[k].count = 0;
1335 fcur = cur;
1336 for (x = 0; x < ns->mapx; x++)
1337 {
1338 for (y = 0; y < ns->mapy; y++)
1339 {
1340 if (!mapcellchanged (ns, x, y, newmap))
1341 continue;
1342 if (newmap->cells[x][y].count == 0)
1343 {
1344 *cur = x * ns->mapy + y; /* mark empty space */
1345 cur++;
1346 continue;
1347 }
1348 for (k = 0; k < newmap->cells[x][y].count; k++)
1349 {
1350 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1351 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1352 layers[k].count++;
1353 }
1354 }
1355 }
1356 /* If no data, return now. */
1357 if (fcur == cur && layers[0].count == 0)
1358 return cur;
1359 *cur = 255; /* mark end of explicitly cleared cells */
1360 cur++;
1361 /* First pack by layers. */
1362 for (k = 0; k < numlayers; k++)
1363 {
1364 if (layers[k].count == 0)
1365 break; /* once a layer is entirely empty, no layer below it can
1366 have anything in it either */
1367 /* Pack by entries in thie layer */
1368 for (x = 0; x < layers[k].count;)
1369 {
1370 fcur = cur;
1371 *cur = layers[k].lcells[x].face >> 8;
1372 cur++;
1373 *cur = layers[k].lcells[x].face & 0xFF;
1374 cur++;
1375 face = layers[k].lcells[x].face;
1376 /* Now, we back the redundant data into 1 byte xy pairings */
1377 for (y = x; y < layers[k].count; y++)
1378 {
1379 if (layers[k].lcells[y].face == face)
1380 {
1381 *cur = (uint8) layers[k].lcells[y].xy;
1382 cur++;
1383 layers[k].lcells[y].face = -1;
1384 }
1385 }
1386 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1387 /* forward over the now redundant data */
1388 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1389 x++;
1390 }
1391 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1392 }
1393 return cur;
1394}
1395
1396static void
1397esrv_map_doneredraw (NewSocket * ns, struct Map *newmap)
1398{
1399 static long frames, bytes, tbytes, tframes;
1400 char *cur;
1401
1402 SockList sl (MAXSOCKBUF);
1403 sl << "map ";
1404
1405 cur = (char *) compactlayer (ns, (unsigned char *) sl.buf + sl.len, MAP_LAYERS, newmap);
1406 sl.len = cur - (char *) sl.buf;
1407
1408/* LOG(llevDebug, "Sending map command.\n");*/
1409
1410 if (sl.len > (int) strlen ("map ") || ns->sent_scroll)
1411 {
1412 /* All of this is just accounting stuff */
1413 if (tframes > 100)
1414 tframes = tbytes = 0;
1415
1416 tframes++;
1417 frames++;
1418 tbytes += sl.len;
1419 bytes += sl.len;
1420 memcpy (&ns->lastmap, newmap, sizeof (struct Map));
1421 Send_With_Handling (ns, &sl);
1422 ns->sent_scroll = 0;
1423 }
1424
1425 sl.free ();
1426}
1427
1428 1214
1429/** Clears a map cell */ 1215/** Clears a map cell */
1430static void 1216static void
1431map_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)
1432{ 1218{
… …
1443#define MAX_LAYERS 3 1229#define MAX_LAYERS 3
1444 1230
1445/* 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
1446 * 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,
1447 * 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
1448 * 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
1449 * re-examined. 1235 * re-examined.
1450 */ 1236 */
1451
1452static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1237static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1453 1238
1454/** 1239/**
1455 * Returns true if any of the heads for this 1240 * Returns true if any of the heads for this
1456 * 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
1457 * for empty space checking. 1242 * for empty space checking.
1458 */ 1243 */
1459static inline int 1244static inline int
1460have_head (int ax, int ay) 1245have_head (int ax, int ay)
1461{ 1246{
1462
1463 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1247 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1464 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])
1465 return 1; 1249 return 1;
1250
1466 return 0; 1251 return 0;
1467} 1252}
1468 1253
1469/** 1254/**
1470 * check_head is a bit simplistic version of update_space below. 1255 * check_head is a bit simplistic version of update_space below.
1471 * 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
1472 * 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
1473 * 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
1474 * sent, it returns zero. 1259 * sent, it returns zero.
1475 */ 1260 */
1476static int 1261static int
1477check_head (SockList &sl, NewSocket &ns, int ax, int ay, int layer) 1262check_head (packet &sl, client &ns, int ax, int ay, int layer)
1478{ 1263{
1479 short face_num; 1264 short face_num;
1480 1265
1481 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) 1266 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1482 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;
… …
1514 * numbers the spaces differently - I think this was a leftover from 1299 * numbers the spaces differently - I think this was a leftover from
1515 * 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
1516 * 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
1517 * actually match. 1302 * actually match.
1518 */ 1303 */
1519
1520static int 1304static int
1521update_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)
1522{ 1306{
1523 object *ob, *head; 1307 object *ob, *head;
1524 uint16 face_num; 1308 uint16 face_num;
1525 int bx, by, i; 1309 int bx, by, i;
1526 1310
… …
1739 * 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
1740 * take. 1524 * take.
1741 */ 1525 */
1742 1526
1743static inline int 1527static inline int
1744update_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)
1745{ 1529{
1746 object *ob; 1530 object *ob;
1747 int smoothlevel; /* old face_num; */ 1531 int smoothlevel; /* old face_num; */
1748 1532
1749 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1533 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
… …
1783 * 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
1784 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1568 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1785 * available. 1569 * available.
1786 */ 1570 */
1787int 1571int
1788getExtendedMapInfoSize (NewSocket * ns) 1572getExtendedMapInfoSize (client * ns)
1789{ 1573{
1790 int result = 0; 1574 int result = 0;
1791 1575
1792 if (ns->ext_mapinfos) 1576 if (ns->ext_mapinfos)
1793 { 1577 {
1794 if (ns->EMI_smooth) 1578 if (ns->EMI_smooth)
1795 result += 1; /*One byte for smoothlevel */ 1579 result += 1; /*One byte for smoothlevel */
1796 } 1580 }
1581
1797 return result; 1582 return result;
1798} 1583}
1799 1584
1800/** 1585/**
1801 * 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
… …
1829 uint8 eentrysize; 1614 uint8 eentrysize;
1830 uint16 ewhatstart, ewhatflag; 1615 uint16 ewhatstart, ewhatflag;
1831 uint8 extendedinfos; 1616 uint8 extendedinfos;
1832 maptile *m; 1617 maptile *m;
1833 1618
1834 NewSocket &socket = pl->contr->socket; 1619 client &socket = *pl->contr->socket;
1835 1620
1836 check_map_change (pl->contr); 1621 check_map_change (pl->contr);
1837 1622
1838 SockList sl (MAXSOCKBUF); 1623 packet sl;
1839 SockList esl (MAXSOCKBUF); 1624 packet esl;
1840 1625
1841 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a "); 1626 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1842 startlen = sl.len; 1627 startlen = sl.length ();
1843 1628
1844 /*Extendedmapinfo structure initialisation */ 1629 /*Extendedmapinfo structure initialisation */
1845 if (socket.ext_mapinfos) 1630 if (socket.ext_mapinfos)
1846 { 1631 {
1847 extendedinfos = EMI_NOREDRAW; 1632 extendedinfos = EMI_NOREDRAW;
1848 1633
1849 if (socket.EMI_smooth) 1634 if (socket.EMI_smooth)
1850 extendedinfos |= EMI_SMOOTH; 1635 extendedinfos |= EMI_SMOOTH;
1851 1636
1852 ewhatstart = esl.len; 1637 ewhatstart = esl.length ();
1853 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit 1638 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1854 could need to be taken away */ 1639 could need to be taken away */
1855 eentrysize = getExtendedMapInfoSize (&socket); 1640 eentrysize = getExtendedMapInfoSize (&socket);
1856 esl << "mapextended " 1641 esl << "mapextended "
1857 << uint8 (extendedinfos) 1642 << uint8 (extendedinfos)
1858 << uint8 (eentrysize); 1643 << uint8 (eentrysize);
1644
1859 estartlen = esl.len; 1645 estartlen = esl.length ();
1860 } 1646 }
1861 else 1647 else
1862 { 1648 {
1863 /* suppress compiler warnings */ 1649 /* suppress compiler warnings */
1864 ewhatstart = 0; 1650 ewhatstart = 0;
… …
1902 */ 1688 */
1903 if (ax >= socket.mapx || ay >= socket.mapy) 1689 if (ax >= socket.mapx || ay >= socket.mapy)
1904 { 1690 {
1905 int i, got_one; 1691 int i, got_one;
1906 1692
1907 oldlen = sl.len; 1693 oldlen = sl.length ();
1908 1694
1909 sl << uint16 (mask); 1695 sl << uint16 (mask);
1910 1696
1911 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4; 1697 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1912 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2; 1698 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
… …
1916 * actually need to send that - just the coordinates 1702 * actually need to send that - just the coordinates
1917 * with no faces tells the client to blank out the 1703 * with no faces tells the client to blank out the
1918 * space. 1704 * space.
1919 */ 1705 */
1920 got_one = 0; 1706 got_one = 0;
1921 for (i = oldlen + 2; i < sl.len; i++) 1707 for (i = oldlen + 2; i < sl.length (); i++)
1922 if (sl.buf[i]) 1708 if (sl[i])
1923 got_one = 1; 1709 got_one = 1;
1924 1710
1925 if (got_one && (mask & 0xf)) 1711 if (got_one && (mask & 0xf))
1926 sl.buf[oldlen + 1] = mask & 0xff; 1712 sl[oldlen + 1] = mask & 0xff;
1927 else 1713 else
1928 { /*either all faces blank, either no face at all */ 1714 { /*either all faces blank, either no face at all */
1929 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 */
1930 sl.len = oldlen + 2; 1716 sl.reset (oldlen + 2);
1931 else 1717 else
1932 sl.len = oldlen; 1718 sl.reset (oldlen);
1933 } 1719 }
1934 1720
1935 /*What concerns extendinfos, nothing to be done for now 1721 /*What concerns extendinfos, nothing to be done for now
1936 * (perhaps effects layer later) 1722 * (perhaps effects layer later)
1937 */ 1723 */
… …
1967 1753
1968 /* This block deals with spaces that are not visible for whatever 1754 /* This block deals with spaces that are not visible for whatever
1969 * reason. Still may need to send the head for this space. 1755 * reason. Still may need to send the head for this space.
1970 */ 1756 */
1971 1757
1972 oldlen = sl.len; 1758 oldlen = sl.length ();
1973 1759
1974 sl << uint16 (mask); 1760 sl << uint16 (mask);
1975 1761
1976 if (lastcell.count != -1) 1762 if (lastcell.count != -1)
1977 need_send = 1; 1763 need_send = 1;
… …
1997 1783
1998 map_clearcell (&lastcell, 0, 0, 0, count); 1784 map_clearcell (&lastcell, 0, 0, 0, count);
1999 } 1785 }
2000 1786
2001 if ((mask & 0xf) || need_send) 1787 if ((mask & 0xf) || need_send)
2002 sl.buf[oldlen + 1] = mask & 0xff; 1788 sl[oldlen + 1] = mask & 0xff;
2003 else 1789 else
2004 sl.len = oldlen; 1790 sl.reset (oldlen);
2005 } 1791 }
2006 else 1792 else
2007 { 1793 {
2008 /* 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
2009 * we need to send. 1795 * we need to send.
… …
2011 1797
2012 /* Rather than try to figure out what everything that we might 1798 /* Rather than try to figure out what everything that we might
2013 * need to send is, then form the packet after that, 1799 * need to send is, then form the packet after that,
2014 * 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
2015 * 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,
2016 * 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
2017 * is done. 1803 * is done.
2018 * 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
2019 * what if anything we need to send, setting the bits, then 1805 * what if anything we need to send, setting the bits, then
2020 * doing those checks again to add the real data. 1806 * doing those checks again to add the real data.
2021 */ 1807 */
2022 oldlen = sl.len; 1808 oldlen = sl.length ();
2023 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1809 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2024 eoldlen = esl.len; 1810 eoldlen = esl.length ();
2025 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1811 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2026 sl << uint16 (mask); 1812 sl << uint16 (mask);
2027 1813
2028 if (socket.ext_mapinfos) 1814 if (socket.ext_mapinfos)
2029 esl << uint16 (emask); 1815 esl << uint16 (emask);
… …
2037 mask |= 0x8; 1823 mask |= 0x8;
2038 1824
2039 if (socket.extmap) 1825 if (socket.extmap)
2040 { 1826 {
2041 *last_ext |= 0x80; 1827 *last_ext |= 0x80;
2042 last_ext = sl.buf + sl.len; 1828 last_ext = &sl[sl.length ()];
2043 sl << uint8 (d); 1829 sl << uint8 (d);
2044 } 1830 }
2045 else 1831 else
2046 sl << uint8 (255 - 64 * d); 1832 sl << uint8 (255 - 64 * d);
2047 } 1833 }
… …
2081 { 1867 {
2082 lastcell.stat_hp = stat_hp; 1868 lastcell.stat_hp = stat_hp;
2083 1869
2084 mask |= 0x8; 1870 mask |= 0x8;
2085 *last_ext |= 0x80; 1871 *last_ext |= 0x80;
2086 last_ext = sl.buf + sl.len; 1872 last_ext = &sl[sl.length ()];
2087 1873
2088 sl << uint8 (5) << uint8 (stat_hp); 1874 sl << uint8 (5) << uint8 (stat_hp);
2089 1875
2090 if (stat_width > 1) 1876 if (stat_width > 1)
2091 { 1877 {
2092 *last_ext |= 0x80; 1878 *last_ext |= 0x80;
2093 last_ext = sl.buf + sl.len; 1879 last_ext = &sl[sl.length ()];
2094 1880
2095 sl << uint8 (6) << uint8 (stat_width); 1881 sl << uint8 (6) << uint8 (stat_width);
2096 } 1882 }
2097 } 1883 }
2098 1884
… …
2100 { 1886 {
2101 lastcell.player = player; 1887 lastcell.player = player;
2102 1888
2103 mask |= 0x8; 1889 mask |= 0x8;
2104 *last_ext |= 0x80; 1890 *last_ext |= 0x80;
2105 last_ext = sl.buf + sl.len; 1891 last_ext = &sl[sl.length ()];
2106 1892
2107 sl << uint8 (0x47) << uint8 (8) << (uint64)player; 1893 sl << uint8 (0x47) << uint8 (8) << (uint64)player;
2108 } 1894 }
2109 1895
2110 if (lastcell.flags != flags) 1896 if (lastcell.flags != flags)
2111 { 1897 {
2112 lastcell.flags = flags; 1898 lastcell.flags = flags;
2113 1899
2114 mask |= 0x8; 1900 mask |= 0x8;
2115 *last_ext |= 0x80; 1901 *last_ext |= 0x80;
2116 last_ext = sl.buf + sl.len; 1902 last_ext = &sl[sl.length ()];
2117 1903
2118 sl << uint8 (8) << uint8 (flags); 1904 sl << uint8 (8) << uint8 (flags);
2119 } 1905 }
2120 } 1906 }
2121 1907
… …
2163 * space by checking the mask. If so, update the mask. 1949 * space by checking the mask. If so, update the mask.
2164 * 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
2165 * value, so we don't send those bits. 1951 * value, so we don't send those bits.
2166 */ 1952 */
2167 if (mask & 0xf) 1953 if (mask & 0xf)
2168 sl.buf[oldlen + 1] = mask & 0xff; 1954 sl[oldlen + 1] = mask & 0xff;
2169 else 1955 else
2170 sl.len = oldlen; 1956 sl.reset (oldlen);
2171 1957
2172 if (emask & 0xf) 1958 if (emask & 0xf)
2173 esl.buf[eoldlen + 1] = emask & 0xff; 1959 esl[eoldlen + 1] = emask & 0xff;
2174 else 1960 else
2175 esl.len = eoldlen; 1961 esl.reset (eoldlen);
2176 } /* else this is a viewable space */ 1962 } /* else this is a viewable space */
2177 } /* for x loop */ 1963 } /* for x loop */
2178 } /* for y loop */ 1964 } /* for y loop */
2179 1965
2180 /* Verify that we in fact do need to send this */ 1966 /* Verify that we in fact do need to send this */
2181 if (socket.ext_mapinfos) 1967 if (socket.ext_mapinfos)
2182 { 1968 {
2183 if (!(sl.len > startlen || socket.sent_scroll)) 1969 if (!(sl.length () > startlen || socket.sent_scroll))
2184 { 1970 {
2185 /* No map data will follow, so don't say the client 1971 /* No map data will follow, so don't say the client
2186 * it doesn't need draw! 1972 * it doesn't need draw!
2187 */ 1973 */
2188 ewhatflag &= (~EMI_NOREDRAW); 1974 ewhatflag &= (~EMI_NOREDRAW);
2189 esl.buf[ewhatstart + 1] = ewhatflag & 0xff; 1975 esl[ewhatstart + 1] = ewhatflag & 0xff;
2190 } 1976 }
2191 1977
2192 if (esl.len > estartlen) 1978 if (esl.length () > estartlen)
2193 Send_With_Handling (&socket, &esl); 1979 socket.send_packet (esl);
2194 } 1980 }
2195 1981
2196 if (sl.len > startlen || socket.sent_scroll) 1982 if (sl.length () > startlen || socket.sent_scroll)
2197 { 1983 {
2198 Send_With_Handling (&socket, &sl); 1984 socket.send_packet (sl);
2199 socket.sent_scroll = 0; 1985 socket.sent_scroll = 0;
2200 } 1986 }
2201
2202 sl.free ();
2203 esl.free ();
2204} 1987}
2205 1988
2206/** 1989/**
2207 * Draws client map. 1990 * Draws client map.
2208 */ 1991 */
… …
2232 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 2015 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2233 return; 2016 return;
2234 2017
2235 memset (&newmap, 0, sizeof (struct Map)); 2018 memset (&newmap, 0, sizeof (struct Map));
2236 2019
2237 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++)
2238 { 2021 {
2239 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++)
2240 { 2023 {
2241 ax = i; 2024 ax = i;
2242 ay = j; 2025 ay = j;
2243 m = pm; 2026 m = pm;
2244 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2027 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2028
2245 if (mflags & P_OUT_OF_MAP) 2029 if (mflags & P_OUT_OF_MAP)
2246 continue; 2030 continue;
2031
2247 if (mflags & P_NEED_UPDATE) 2032 if (mflags & P_NEED_UPDATE)
2248 update_position (m, ax, ay); 2033 update_position (m, ax, ay);
2034
2249 /* 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
2250 * just to reload it. This should really call something like 2036 * just to reload it. This should really call something like
2251 * swap_map, but this is much more efficient and 'good enough' 2037 * swap_map, but this is much more efficient and 'good enough'
2252 */ 2038 */
2253 if (mflags & P_NEW_MAP) 2039 if (mflags & P_NEW_MAP)
… …
2259 { 2045 {
2260 update_los (pl); 2046 update_los (pl);
2261 pl->contr->do_los = 0; 2047 pl->contr->do_los = 0;
2262 } 2048 }
2263 2049
2264 if (pl->contr->socket.mapmode == Map1Cmd || pl->contr->socket.mapmode == Map1aCmd)
2265 {
2266 /* Big maps need a different drawing mechanism to work */ 2050 /* Big maps need a different drawing mechanism to work */
2267 draw_client_map1 (pl); 2051 draw_client_map1 (pl);
2268 return;
2269 }
2270
2271 if (pl->invisible & (pl->invisible < 50 ? 4 : 1))
2272 {
2273 esrv_map_setbelow (&pl->contr->socket, pl->contr->socket.mapx / 2, pl->contr->socket.mapy / 2, pl->face->number, &newmap);
2274 }
2275
2276 /* j and i are the y and x coordinates of the real map (which is
2277 * basically some number of spaces around the player)
2278 * ax and ay are values from within the viewport (ie, 0, 0 is upper
2279 * left corner) and are thus disconnected from the map values.
2280 * Subtract 1 from the max values so that we properly handle cases where
2281 * player has specified an even map. Otherwise, we try to send them too
2282 * much, ie, if mapx is 10, we would try to send from -5 to 5, which is actually
2283 * 11 spaces. Now, we would send from -5 to 4, which is properly. If mapx is
2284 * odd, this still works fine.
2285 */
2286 ay = 0;
2287 for (j = pl->y - pl->contr->socket.mapy / 2; j <= pl->y + (pl->contr->socket.mapy - 1) / 2; j++, ay++)
2288 {
2289 ax = 0;
2290 for (i = pl->x - pl->contr->socket.mapx / 2; i <= pl->x + (pl->contr->socket.mapx - 1) / 2; i++, ax++)
2291 {
2292
2293 d = pl->contr->blocked_los[ax][ay];
2294 /* note the out_of_map and d>3 checks are both within the same
2295 * negation check.
2296 */
2297 nx = i;
2298 ny = j;
2299 m = get_map_from_coord (pm, &nx, &ny);
2300 if (m && d < 4)
2301 {
2302 face = GET_MAP_FACE (m, nx, ny, 0);
2303 floor2 = GET_MAP_FACE (m, nx, ny, 1);
2304 floor = GET_MAP_FACE (m, nx, ny, 2);
2305
2306 /* If all is blank, send a blank face. */
2307 if ((!face || face == blank_face) && (!floor2 || floor2 == blank_face) && (!floor || floor == blank_face))
2308 {
2309 esrv_map_setbelow (&pl->contr->socket, ax, ay, blank_face->number, &newmap);
2310 }
2311 else
2312 { /* actually have something interesting */
2313 /* send the darkness mask, if any. */
2314 if (d && pl->contr->socket.darkness)
2315 esrv_map_setbelow (&pl->contr->socket, ax, ay, dark_faces[d - 1]->number, &newmap);
2316
2317 if (face && face != blank_face)
2318 esrv_map_setbelow (&pl->contr->socket, ax, ay, face->number, &newmap);
2319 if (floor2 && floor2 != blank_face)
2320 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor2->number, &newmap);
2321 if (floor && floor != blank_face)
2322 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor->number, &newmap);
2323 }
2324 } /* Is a valid space */
2325 }
2326 }
2327
2328 esrv_map_doneredraw (&pl->contr->socket, &newmap);
2329
2330 check_map_change (pl->contr);
2331} 2052}
2332 2053
2333 2054
2334/*****************************************************************************/ 2055/*****************************************************************************/
2335 2056
… …
2341 2062
2342/*****************************************************************************/ 2063/*****************************************************************************/
2343void 2064void
2344send_plugin_custom_message (object *pl, char *buf) 2065send_plugin_custom_message (object *pl, char *buf)
2345{ 2066{
2346 cs_write_string (&pl->contr->socket, buf, strlen (buf)); 2067 pl->contr->socket->send_packet (buf);
2347} 2068}
2348 2069
2349/** 2070/**
2350 * This sends the skill number to name mapping. We ignore 2071 * This sends the skill number to name mapping. We ignore
2351 * the params - we always send the same info no matter what. 2072 * the params - we always send the same info no matter what.
2352 */ 2073 */
2353void 2074void
2354send_skill_info (NewSocket *ns, char *params) 2075send_skill_info (client *ns, char *params)
2355{ 2076{
2356 SockList sl (MAXSOCKBUF); 2077 packet sl;
2357 sl << "replyinfo skill_info\n"; 2078 sl << "replyinfo skill_info\n";
2358 2079
2359 for (int i = 1; i < NUM_SKILLS; i++) 2080 for (int i = 1; i < NUM_SKILLS; i++)
2360 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]);
2361 2082
2362 if (sl.len >= MAXSOCKBUF) 2083 if (sl.length () >= MAXSOCKBUF)
2363 { 2084 {
2364 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 2085 LOG (llevError, "Buffer overflow in send_skill_info!\n");
2365 fatal (0); 2086 fatal (0);
2366 } 2087 }
2367 2088
2368 Send_With_Handling (ns, &sl); 2089 ns->send_packet (sl);
2369 sl.free ();
2370} 2090}
2371 2091
2372/** 2092/**
2373 * This sends the spell path to name mapping. We ignore 2093 * This sends the spell path to name mapping. We ignore
2374 * the params - we always send the same info no matter what. 2094 * the params - we always send the same info no matter what.
2375 */ 2095 */
2376void 2096void
2377send_spell_paths (NewSocket * ns, char *params) 2097send_spell_paths (client * ns, char *params)
2378{ 2098{
2379 SockList sl (MAXSOCKBUF); 2099 packet sl;
2380 2100
2381 sl << "replyinfo spell_paths\n"; 2101 sl << "replyinfo spell_paths\n";
2382 2102
2383 for (int i = 0; i < NRSPELLPATHS; i++) 2103 for (int i = 0; i < NRSPELLPATHS; i++)
2384 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); 2104 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
2385 2105
2386 if (sl.len >= MAXSOCKBUF) 2106 if (sl.length () >= MAXSOCKBUF)
2387 { 2107 {
2388 LOG (llevError, "Buffer overflow in send_spell_paths!\n"); 2108 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
2389 fatal (0); 2109 fatal (0);
2390 } 2110 }
2391 2111
2392 Send_With_Handling (ns, &sl); 2112 ns->send_packet (sl);
2393 sl.free ();
2394} 2113}
2395 2114
2396/** 2115/**
2397 * 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.
2398 * 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
2399 */ 2118 */
2400void 2119void
2401esrv_update_spells (player *pl) 2120esrv_update_spells (player *pl)
2402{ 2121{
2403 if (!pl->socket.monitor_spells) 2122 if (!pl->socket->monitor_spells)
2404 return; 2123 return;
2405 2124
2406 for (object *spell = pl->ob->inv; spell; spell = spell->below) 2125 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2407 { 2126 {
2408 if (spell->type == SPELL) 2127 if (spell->type == SPELL)
… …
2428 flags |= UPD_SP_DAMAGE; 2147 flags |= UPD_SP_DAMAGE;
2429 } 2148 }
2430 2149
2431 if (flags) 2150 if (flags)
2432 { 2151 {
2433 SockList sl (MAXSOCKBUF); 2152 packet sl;
2434 2153
2435 sl << "updspell " 2154 sl << "updspell "
2436 << uint8 (flags) 2155 << uint8 (flags)
2437 << uint32 (spell->count); 2156 << uint32 (spell->count);
2438 2157
2439 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 2158 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2440 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 2159 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2441 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 2160 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2442 2161
2443 Send_With_Handling (&pl->socket, &sl); 2162 pl->socket->send_packet (sl);
2444 sl.free ();
2445 } 2163 }
2446 } 2164 }
2447 } 2165 }
2448} 2166}
2449 2167
2450void 2168void
2451esrv_remove_spell (player *pl, object *spell) 2169esrv_remove_spell (player *pl, object *spell)
2452{ 2170{
2453 if (!pl->socket.monitor_spells) 2171 if (!pl->socket->monitor_spells)
2454 return; 2172 return;
2455 2173
2456 if (!pl || !spell || spell->env != pl->ob) 2174 if (!pl || !spell || spell->env != pl->ob)
2457 { 2175 {
2458 LOG (llevError, "Invalid call to esrv_remove_spell"); 2176 LOG (llevError, "Invalid call to esrv_remove_spell");
2459 return; 2177 return;
2460 } 2178 }
2461 2179
2462 SockList sl (MAXSOCKBUF); 2180 packet sl;
2463 2181
2464 sl << "delspell " 2182 sl << "delspell "
2465 << uint32 (spell->count); 2183 << uint32 (spell->count);
2466 2184
2467 Send_With_Handling (&pl->socket, &sl); 2185 pl->socket->send_packet (sl);
2468 sl.free ();
2469} 2186}
2470 2187
2471/* 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. */
2472static void 2189static void
2473append_spell (player *pl, SockList &sl, object *spell) 2190append_spell (player *pl, packet &sl, object *spell)
2474{ 2191{
2475 int len, i, skill = 0; 2192 int len, i, skill = 0;
2476 2193
2477 if (!(spell->name)) 2194 if (!(spell->name))
2478 { 2195 {
… …
2521 { 2238 {
2522 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");
2523 return; 2240 return;
2524 } 2241 }
2525 2242
2526 if (!pl->socket.monitor_spells) 2243 if (!pl->socket->monitor_spells)
2527 return; 2244 return;
2528 2245
2529 SockList sl (MAXSOCKBUF); 2246 packet sl;
2530
2531 sl << "addspell "; 2247 sl << "addspell ";
2532 2248
2533 if (!spell) 2249 if (!spell)
2534 { 2250 {
2535 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2251 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
… …
2548 * like it will fix this 2264 * like it will fix this
2549 */ 2265 */
2550 if (spell->type != SPELL) 2266 if (spell->type != SPELL)
2551 continue; 2267 continue;
2552 2268
2553 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))))
2554 { 2270 {
2555 Send_With_Handling (&pl->socket, &sl); 2271 pl->socket->send_packet (sl);
2556 strcpy ((char *) sl.buf, "addspell "); 2272
2557 sl.len = strlen ((char *) sl.buf); 2273 sl.reset ();
2274 sl << "addspell ";
2558 } 2275 }
2559 2276
2560 append_spell (pl, sl, spell); 2277 append_spell (pl, sl, spell);
2561 } 2278 }
2562 } 2279 }
… …
2573 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 2290 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2574 fatal (0); 2291 fatal (0);
2575 } 2292 }
2576 2293
2577 /* finally, we can send the packet */ 2294 /* finally, we can send the packet */
2578 Send_With_Handling (&pl->socket, &sl); 2295 pl->socket->send_packet (sl);
2579
2580 sl.free ();
2581} 2296}
2582 2297

Diff Legend

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