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.26 by pippijn, Mon Dec 11 19:46:47 2006 UTC vs.
Revision 1.46 by root, Tue Dec 19 05:12:52 2006 UTC

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

Diff Legend

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