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

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

Diff Legend

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