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.27 by root, Wed Dec 13 18:08:02 2006 UTC vs.
Revision 1.48 by root, Wed Dec 20 11:36:39 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 ("smooth");
707 strcpy ((char *) sl.buf, "smooth ");
708 sl.len = strlen ((char *) sl.buf);
709 725
710 sl << uint16 (face) << uint16 (smoothface); 726 sl << uint16 (face)
727 << uint16 (smoothface);
711 728
712 Send_With_Handling (ns, &sl); 729 ns->send_packet (sl);
713} 730}
714 731
715 /** 732 /**
716 * Tells client the picture it has to use 733 * Tells client the picture it has to use
717 * to smooth a picture number given as argument. 734 * to smooth a picture number given as argument.
718 */ 735 */
719void 736void
720AskSmooth (char *buf, int len, NewSocket * ns) 737AskSmooth (char *buf, int len, client *ns)
721{ 738{
722 uint16 facenbr; 739 SendSmooth (ns, atoi (buf));
723
724 facenbr = atoi (buf);
725 SendSmooth (ns, facenbr);
726} 740}
727
728
729
730
731 741
732/** 742/**
733 * This handles the general commands from the client (ie, north, fire, cast, 743 * This handles the general commands from the client (ie, north, fire, cast,
734 * etc.) 744 * etc.)
735 */ 745 */
736void 746void
737PlayerCmd (char *buf, int len, player *pl) 747PlayerCmd (char *buf, int len, player *pl)
738{ 748{
739
740 /* The following should never happen with a proper or honest client.
741 * Therefore, the error message doesn't have to be too clear - if
742 * someone is playing with a hacked/non working client, this gives them
743 * an idea of the problem, but they deserve what they get
744 */
745 if (pl->state != ST_PLAYING)
746 {
747 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
748 return;
749 }
750 /* Check if there is a count. In theory, a zero count could also be 749 /* Check if there is a count. In theory, a zero count could also be
751 * sent, so check for that also. 750 * sent, so check for that also.
752 */ 751 */
753 if (atoi (buf) || buf[0] == '0') 752 if (atoi (buf) || buf[0] == '0')
754 { 753 {
755 pl->count = atoi ((char *) buf); 754 pl->count = atoi ((char *) buf);
755
756 buf = strchr (buf, ' '); /* advance beyond the numbers */ 756 buf = strchr (buf, ' '); /* advance beyond the numbers */
757 if (!buf) 757 if (!buf)
758 {
759#ifdef ESRV_DEBUG
760 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
761#endif
762 return; 758 return;
763 } 759
764 buf++; 760 buf++;
765 } 761 }
766 /* This should not happen anymore. */ 762
767 if (pl->ob->speed_left < -1.0)
768 {
769 LOG (llevError, "Player has negative time - shouldn't do command.\n");
770 }
771 /* In c_new.c */
772 execute_newserver_command (pl->ob, (char *) buf); 763 execute_newserver_command (pl->ob, (char *) buf);
764
773 /* Perhaps something better should be done with a left over count. 765 /* Perhaps something better should be done with a left over count.
774 * Cleaning up the input should probably be done first - all actions 766 * Cleaning up the input should probably be done first - all actions
775 * for the command that issued the count should be done before any other 767 * for the command that issued the count should be done before any other
776 * commands. 768 * commands.
777 */ 769 */
778
779 pl->count = 0; 770 pl->count = 0;
780
781} 771}
782 772
783 773
784/** 774/**
785 * This handles the general commands from the client (ie, north, fire, cast, 775 * This handles the general commands from the client (ie, north, fire, cast,
786 * etc.). It is a lot like PlayerCmd above, but is called with the 776 * etc.). It is a lot like PlayerCmd above, but is called with the
787 * 'ncom' method which gives more information back to the client so it 777 * 'ncom' method which gives more information back to the client so it
788 * can throttle. 778 * can throttle.
789 */ 779 */
790void 780void
791NewPlayerCmd (uint8 * buf, int len, player *pl) 781NewPlayerCmd (char *buf, int len, player *pl)
792{ 782{
793 int time, repeat;
794 short packet;
795 unsigned char command[MAX_BUF];
796 SockList sl;
797
798 if (len < 7) 783 if (len <= 6)
799 { 784 {
800 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 785 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
801 return; 786 return;
802 } 787 }
803 788
804 packet = GetShort_String (buf); 789 uint16 cmdid = net_uint16 ((uint8 *)buf);
805 repeat = GetInt_String (buf + 2); 790 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
791
806 /* -1 is special - no repeat, but don't update */ 792 /* -1 is special - no repeat, but don't update */
807 if (repeat != -1) 793 if (repeat != -1)
808 {
809 pl->count = repeat; 794 pl->count = repeat;
810 }
811 if ((len - 4) >= MAX_BUF)
812 len = MAX_BUF - 5;
813 795
814 strncpy ((char *) command, (char *) buf + 6, len - 4); 796 buf += 6; //len -= 6;
815 command[len - 4] = '\0';
816 797
817 /* The following should never happen with a proper or honest client.
818 * Therefore, the error message doesn't have to be too clear - if
819 * someone is playing with a hacked/non working client, this gives them
820 * an idea of the problem, but they deserve what they get
821 */
822 if (pl->state != ST_PLAYING)
823 {
824 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
825 return;
826 }
827
828 /* This should not happen anymore. */
829 if (pl->ob->speed_left < -1.0)
830 {
831 LOG (llevError, "Player has negative time - shouldn't do command.\n");
832 }
833 /* In c_new.c */
834 execute_newserver_command (pl->ob, (char *) command); 798 execute_newserver_command (pl->ob, buf);
799
835 /* Perhaps something better should be done with a left over count. 800 /* Perhaps something better should be done with a left over count.
836 * Cleaning up the input should probably be done first - all actions 801 * Cleaning up the input should probably be done first - all actions
837 * for the command that issued the count should be done before any other 802 * for the command that issued the count should be done before any other
838 * commands. 803 * commands.
839 */ 804 */
840 pl->count = 0; 805 pl->count = 0;
841 806
807 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
808 int time = FABS (pl->ob->speed) < 0.001
809 ? time = MAX_TIME * 100
810 : time = (int) (MAX_TIME / FABS (pl->ob->speed));
811
842 /* Send confirmation of command execution now */ 812 /* Send confirmation of command execution now */
843 sl.buf = command; 813 packet sl ("comc");
844 strcpy ((char *) sl.buf, "comc ");
845 sl.len = 5;
846
847 if (FABS (pl->ob->speed) < 0.001)
848 time = MAX_TIME * 100;
849 else
850 time = (int) (MAX_TIME / FABS (pl->ob->speed));
851
852 sl << uint16 (packet) << uint32 (time); 814 sl << uint16 (cmdid) << uint32 (time);
853 815 pl->socket->send_packet (sl);
854 Send_With_Handling (&pl->socket, &sl);
855} 816}
856 817
857 818
858/** This is a reply to a previous query. */ 819/** This is a reply to a previous query. */
859void 820void
860ReplyCmd (char *buf, int len, player *pl) 821ReplyCmd (char *buf, int len, player *pl)
861{ 822{
862 /* This is to synthesize how the data would be stored if it 823 /* This is to synthesize how the data would be stored if it
863 * was normally entered. A bit of a hack, and should be cleaned up 824 * was normally entered. A bit of a hack, and should be cleaned up
864 * once all the X11 code is removed from the server. 825 * once all the X11 code is removed from the server.
865 * 826 *
866 * We pass 13 to many of the functions because this way they 827 * We pass 13 to many of the functions because this way they
867 * think it was the carriage return that was entered, and the 828 * think it was the carriage return that was entered, and the
868 * function then does not try to do additional input. 829 * function then does not try to do additional input.
… …
871 832
872 /* this avoids any hacking here */ 833 /* this avoids any hacking here */
873 834
874 switch (pl->state) 835 switch (pl->state)
875 { 836 {
876 case ST_PLAYING: 837 case ST_PLAYING:
877 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 838 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
878 break; 839 break;
879 840
880 case ST_PLAY_AGAIN: 841 case ST_PLAY_AGAIN:
881 /* We can check this for return value (2==quit). Maybe we 842 /* We can check this for return value (2==quit). Maybe we
882 * should, and do something appropriate? 843 * should, and do something appropriate?
883 */ 844 */
884 receive_play_again (pl->ob, buf[0]); 845 receive_play_again (pl->ob, buf[0]);
885 break; 846 break;
886 847
887 case ST_ROLL_STAT: 848 case ST_ROLL_STAT:
888 key_roll_stat (pl->ob, buf[0]); 849 key_roll_stat (pl->ob, buf[0]);
889 break; 850 break;
890 851
891 case ST_CHANGE_CLASS: 852 case ST_CHANGE_CLASS:
892 853
893 key_change_class (pl->ob, buf[0]); 854 key_change_class (pl->ob, buf[0]);
894 break; 855 break;
895 856
896 case ST_CONFIRM_QUIT: 857 case ST_CONFIRM_QUIT:
897 key_confirm_quit (pl->ob, buf[0]); 858 key_confirm_quit (pl->ob, buf[0]);
898 break; 859 break;
899 860
900 case ST_CONFIGURE: 861 case ST_CONFIGURE:
901 LOG (llevError, "In client input handling, but into configure state\n"); 862 LOG (llevError, "In client input handling, but into configure state\n");
902 pl->state = ST_PLAYING; 863 pl->state = ST_PLAYING;
903 break; 864 break;
904 865
905 case ST_GET_NAME: 866 case ST_GET_NAME:
906 receive_player_name (pl->ob, 13); 867 receive_player_name (pl->ob, 13);
907 break; 868 break;
908 869
909 case ST_GET_PASSWORD: 870 case ST_GET_PASSWORD:
910 case ST_CONFIRM_PASSWORD: 871 case ST_CONFIRM_PASSWORD:
911 receive_player_password (pl->ob, 13); 872 receive_player_password (pl->ob, 13);
912 break; 873 break;
913 874
914 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 875 case ST_GET_PARTY_PASSWORD: /* Get password for party */
915 receive_party_password (pl->ob, 13); 876 receive_party_password (pl->ob, 13);
916 break; 877 break;
917 878
918 default: 879 default:
919 LOG (llevError, "Unknown input state: %d\n", pl->state); 880 LOG (llevError, "Unknown input state: %d\n", pl->state);
920 } 881 }
921} 882}
922 883
923/** 884/**
924 * Client tells its version. If there is a mismatch, we close the 885 * Client tells its version. If there is a mismatch, we close the
… …
926 * something older than the server. If we assume the client will be 887 * something older than the server. If we assume the client will be
927 * backwards compatible, having it be a later version should not be a 888 * backwards compatible, having it be a later version should not be a
928 * problem. 889 * problem.
929 */ 890 */
930void 891void
931VersionCmd (char *buf, int len, NewSocket * ns) 892VersionCmd (char *buf, int len, client * ns)
932{ 893{
933 char *cp;
934 char version_warning[256];
935
936 if (!buf) 894 if (!buf)
937 { 895 {
938 LOG (llevError, "CS: received corrupted version command\n"); 896 LOG (llevError, "CS: received corrupted version command\n");
939 return; 897 return;
940 } 898 }
941 899
942 ns->cs_version = atoi (buf); 900 ns->cs_version = atoi (buf);
943 ns->sc_version = ns->cs_version; 901 ns->sc_version = ns->cs_version;
902
903 LOG (llevDebug, "connection from client <%s>\n", buf);
904
905
906 //TODO: should log here just for statistics
907
944 if (VERSION_CS != ns->cs_version) 908 //if (VERSION_CS != ns->cs_version)
945 { 909 // unchecked;
946#ifdef ESRV_DEBUG 910
947 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
948#endif
949 }
950 cp = strchr (buf + 1, ' '); 911 char *cp = strchr (buf + 1, ' ');
951 if (!cp) 912 if (!cp)
952 return; 913 return;
914
953 ns->sc_version = atoi (cp); 915 ns->sc_version = atoi (cp);
916
954 if (VERSION_SC != ns->sc_version) 917 //if (VERSION_SC != ns->sc_version)
955 { 918 // unchecked;
956#ifdef ESRV_DEBUG 919
957 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
958#endif
959 }
960 cp = strchr (cp + 1, ' '); 920 cp = strchr (cp + 1, ' ');
921
961 if (cp) 922 if (cp)
962 { 923 {
963 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 924 assign (ns->version, cp + 1);
964 925
965 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1); 926 if (ns->sc_version < 1026)
966 927 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
967 /* This is first implementation - i skip all beta DX clients with it
968 * Add later stuff here for other clients
969 */
970
971 /* these are old dxclients */
972 /* Version 1024 added support for singular + plural name values -
973 * requiing this minimal value reduces complexity of that code, and it
974 * has been around for a long time.
975 */
976 if (!strcmp (" CF DX CLIENT", cp) || ns->sc_version < 1024)
977 {
978 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
979 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 928 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
980 Write_String_To_Socket (ns, version_warning, strlen (version_warning));
981 }
982
983 } 929 }
984} 930}
985 931
986/** sound related functions. */ 932/** sound related functions. */
987
988void 933void
989SetSound (char *buf, int len, NewSocket * ns) 934SetSound (char *buf, int len, client * ns)
990{ 935{
991 ns->sound = atoi (buf); 936 ns->sound = atoi (buf);
992} 937}
993 938
994/** client wants the map resent */ 939/** client wants the map resent */
995 940
996void 941void
997MapRedrawCmd (char *buf, int len, player *pl) 942MapRedrawCmd (char *buf, int len, player *pl)
998{ 943{
999
1000/* This function is currently disabled; just clearing the map state results in 944/* This function is currently disabled; just clearing the map state results in
1001 * display errors. It should clear the cache and send a newmap command. 945 * display errors. It should clear the cache and send a newmap command.
1002 * Unfortunately this solution does not work because some client versions send 946 * Unfortunately this solution does not work because some client versions send
1003 * a mapredraw command after receiving a newmap command. 947 * a mapredraw command after receiving a newmap command.
1004 */ 948 */
1005#if 0
1006 /* Okay, this is MAJOR UGLY. but the only way I know how to
1007 * clear the "cache"
1008 */
1009 memset (&pl->socket.lastmap, 0, sizeof (struct Map));
1010 draw_client_map (pl->ob);
1011#endif
1012} 949}
1013 950
1014/** 951/**
1015 * Moves an object (typically, container to inventory). 952 * Moves an object (typically, container to inventory).
1016 * syntax is: move (to) (tag) (nrof) 953 * syntax is: move (to) (tag) (nrof)
… …
1019MoveCmd (char *buf, int len, player *pl) 956MoveCmd (char *buf, int len, player *pl)
1020{ 957{
1021 int vals[3], i; 958 int vals[3], i;
1022 959
1023 /* A little funky here. We only cycle for 2 records, because 960 /* A little funky here. We only cycle for 2 records, because
1024 * we obviously am not going to find a space after the third 961 * we obviously are not going to find a space after the third
1025 * record. Perhaps we should just replace this with a 962 * record. Perhaps we should just replace this with a
1026 * sscanf? 963 * sscanf?
1027 */ 964 */
1028 for (i = 0; i < 2; i++) 965 for (i = 0; i < 2; i++)
1029 { 966 {
1030 vals[i] = atoi (buf); 967 vals[i] = atoi (buf);
968
1031 if (!(buf = strchr (buf, ' '))) 969 if (!(buf = strchr (buf, ' ')))
1032 { 970 {
1033 LOG (llevError, "Incomplete move command: %s\n", buf); 971 LOG (llevError, "Incomplete move command: %s\n", buf);
1034 return; 972 return;
1035 } 973 }
974
1036 buf++; 975 buf++;
1037 } 976 }
977
1038 vals[2] = atoi (buf); 978 vals[2] = atoi (buf);
1039 979
1040/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 980/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1041 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 981 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1042} 982}
1043
1044
1045 983
1046/****************************************************************************** 984/******************************************************************************
1047 * 985 *
1048 * Start of commands the server sends to the client. 986 * Start of commands the server sends to the client.
1049 * 987 *
… …
1052/** 990/**
1053 * Asks the client to query the user. This way, the client knows 991 * Asks the client to query the user. This way, the client knows
1054 * it needs to send something back (vs just printing out a message) 992 * it needs to send something back (vs just printing out a message)
1055 */ 993 */
1056void 994void
1057send_query (NewSocket * ns, uint8 flags, char *text) 995send_query (client *ns, uint8 flags, char *text)
1058{ 996{
1059 char buf[MAX_BUF];
1060
1061 sprintf (buf, "query %d %s", flags, text ? text : ""); 997 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1062 Write_String_To_Socket (ns, buf, strlen (buf));
1063} 998}
1064 999
1065#define AddIfInt64(Old,New,Type) if (Old != New) {\ 1000#define AddIfInt64(Old,New,Type) if (Old != New) {\
1066 Old = New; \ 1001 Old = New; \
1067 SockList_AddChar(&sl, Type); \ 1002 sl << uint8 (Type) << uint64 (New); \
1068 SockList_AddInt64(&sl, New); \
1069 } 1003 }
1070 1004
1071#define AddIfInt(Old,New,Type) if (Old != New) {\ 1005#define AddIfInt(Old,New,Type) if (Old != New) {\
1072 Old = New; \ 1006 Old = New; \
1073 SockList_AddChar(&sl, Type); \ 1007 sl << uint8 (Type) << uint32 (New); \
1074 SockList_AddInt(&sl, New); \
1075 } 1008 }
1076 1009
1077#define AddIfShort(Old,New,Type) if (Old != New) {\ 1010#define AddIfShort(Old,New,Type) if (Old != New) {\
1078 Old = New; \ 1011 Old = New; \
1079 SockList_AddChar(&sl, Type); \ 1012 sl << uint8 (Type) << uint16 (New); \
1080 SockList_AddShort(&sl, New); \
1081 } 1013 }
1082 1014
1083#define AddIfFloat(Old,New,Type) if (Old != New) {\ 1015#define AddIfFloat(Old,New,Type) if (Old != New) {\
1084 Old = New; \ 1016 Old = New; \
1085 SockList_AddChar(&sl, Type); \ 1017 sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \
1086 SockList_AddInt(&sl,(long)(New*FLOAT_MULTI));\
1087 } 1018 }
1088 1019
1089#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ 1020#define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\
1090 if (Old) free(Old);\
1091 Old = strdup_local(New);\ 1021 free(Old); Old = strdup (New);\
1092 SockList_AddChar(&sl, Type); \ 1022 sl << uint8 (Type) << data8 (New); \
1093 SockList_AddChar(&sl, ( char )strlen(New)); \
1094 strcpy((char*)sl.buf + sl.len, New); \
1095 sl.len += strlen(New); \
1096 } 1023 }
1097 1024
1098/** 1025/**
1099 * Sends a statistics update. We look at the old values, 1026 * Sends a statistics update. We look at the old values,
1100 * and only send what has changed. Stat mapping values are in newclient.h 1027 * and only send what has changed. Stat mapping values are in newclient.h
… …
1102 * commands for now. 1029 * commands for now.
1103 */ 1030 */
1104void 1031void
1105esrv_update_stats (player *pl) 1032esrv_update_stats (player *pl)
1106{ 1033{
1107 SockList sl;
1108 char buf[MAX_BUF]; 1034 char buf[MAX_BUF];
1109 uint16 flags; 1035 uint16 flags;
1110 1036
1111 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 1037 packet sl ("stats");
1112 strcpy ((char *) sl.buf, "stats ");
1113 sl.len = strlen ((char *) sl.buf);
1114 1038
1115 if (pl->ob != NULL) 1039 if (pl->ob)
1116 { 1040 {
1117 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1041 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP);
1118 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1042 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP);
1119 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1043 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP);
1120 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1044 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP);
… …
1127 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 1051 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX);
1128 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1052 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON);
1129 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1053 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA);
1130 } 1054 }
1131 1055
1132 if (pl->socket.exp64) 1056 if (pl->socket->exp64)
1133 {
1134 uint8 s;
1135
1136 for (s = 0; s < NUM_SKILLS; s++) 1057 for (int s = 0; s < NUM_SKILLS; s++)
1137 {
1138 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 1058 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp)
1139 { 1059 {
1140
1141 /* Always send along the level if exp changes. This is only 1060 /* Always send along the level if exp changes. This is only
1142 * 1 extra byte, but keeps processing simpler. 1061 * 1 extra byte, but keeps processing simpler.
1143 */ 1062 */
1144 SockList_AddChar (&sl, (char) (s + CS_STAT_SKILLINFO)); 1063 sl << uint8 (s + CS_STAT_SKILLINFO)
1145 SockList_AddChar (&sl, (char) pl->last_skill_ob[s]->level); 1064 << uint8 (pl->last_skill_ob[s]->level)
1146 SockList_AddInt64 (&sl, pl->last_skill_ob[s]->stats.exp); 1065 << uint64 (pl->last_skill_ob[s]->stats.exp);
1066
1147 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; 1067 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1148 } 1068 }
1149 }
1150 }
1151 1069
1152 if (pl->socket.exp64) 1070 if (pl->socket->exp64)
1153 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1071 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) }
1154 else 1072 else
1155 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } 1073 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1156 1074
1157 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1075 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL);
… …
1170 if (pl->run_on) 1088 if (pl->run_on)
1171 flags |= SF_RUNON; 1089 flags |= SF_RUNON;
1172 1090
1173 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1091 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS);
1174 1092
1175 if (pl->socket.sc_version < 1025) 1093 if (pl->socket->sc_version < 1025)
1176 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1094 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1177 else 1095 else
1178 {
1179 int i;
1180
1181 for (i = 0; i < NROFATTACKS; i++) 1096 for (int i = 0; i < NROFATTACKS; i++)
1182 { 1097 {
1183 /* Skip ones we won't send */ 1098 /* Skip ones we won't send */
1184 if (atnr_cs_stat[i] == -1) 1099 if (atnr_cs_stat[i] == -1)
1185 continue; 1100 continue;
1186 1101
1187 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1102 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]);
1188 } 1103 }
1189 }
1190 1104
1191 if (pl->socket.monitor_spells) 1105 if (pl->socket->monitor_spells)
1192 { 1106 {
1193 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1107 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1194 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1108 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL);
1195 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 1109 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY);
1196 } 1110 }
1197 1111
1198 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 1112 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */
1199 AddIfString (pl->socket.stats.range, buf, CS_STAT_RANGE); 1113 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE);
1200 set_title (pl->ob, buf); 1114 set_title (pl->ob, buf);
1201 AddIfString (pl->socket.stats.title, buf, CS_STAT_TITLE); 1115 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE);
1202 1116
1203 /* Only send it away if we have some actual data */ 1117 /* Only send it away if we have some actual data */
1204 if (sl.len > 6) 1118 if (sl.length () > 6)
1205 { 1119 pl->socket->send_packet (sl);
1206#ifdef ESRV_DEBUG
1207 LOG (llevDebug, "Sending stats command, %d bytes long.\n", sl.len);
1208#endif
1209 Send_With_Handling (&pl->socket, &sl);
1210 }
1211
1212 free (sl.buf);
1213} 1120}
1214 1121
1215/** 1122/**
1216 * Tells the client that here is a player it should start using. 1123 * Tells the client that here is a player it should start using.
1217 */ 1124 */
1218void 1125void
1219esrv_new_player (player *pl, uint32 weight) 1126esrv_new_player (player *pl, uint32 weight)
1220{ 1127{
1221 SockList sl;
1222
1223 pl->last_weight = weight; 1128 pl->last_weight = weight;
1224 1129
1225 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 1130 packet sl ("player");
1226 1131
1227 strcpy ((char *) sl.buf, "player "); 1132 sl << uint32 (pl->ob->count)
1228 sl.len = strlen ((char *) sl.buf); 1133 << uint32 (weight)
1229 SockList_AddInt (&sl, pl->ob->count); 1134 << uint32 (pl->ob->face->number)
1230 SockList_AddInt (&sl, weight); 1135 << data8 (pl->ob->name);
1231 SockList_AddInt (&sl, pl->ob->face->number);
1232 1136
1233 SockList_AddChar (&sl, (char) strlen (pl->ob->name)); 1137 pl->socket->send_packet (sl);
1234 strcpy ((char *) sl.buf + sl.len, pl->ob->name);
1235 sl.len += strlen (pl->ob->name);
1236
1237 Send_With_Handling (&pl->socket, &sl);
1238 free (sl.buf);
1239 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1138 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1240} 1139}
1241 1140
1242/** 1141/**
1243 * Need to send an animation sequence to the client. 1142 * Need to send an animation sequence to the client.
… …
1245 * sent them the face yet (this can become quite costly in terms of 1144 * sent them the face yet (this can become quite costly in terms of
1246 * how much we are sending - on the other hand, this should only happen 1145 * how much we are sending - on the other hand, this should only happen
1247 * when the player logs in and picks stuff up. 1146 * when the player logs in and picks stuff up.
1248 */ 1147 */
1249void 1148void
1250esrv_send_animation (NewSocket * ns, short anim_num) 1149esrv_send_animation (client * ns, short anim_num)
1251{ 1150{
1252 SockList sl;
1253 int i;
1254
1255 /* Do some checking on the anim_num we got. Note that the animations 1151 /* Do some checking on the anim_num we got. Note that the animations
1256 * are added in contigous order, so if the number is in the valid 1152 * are added in contigous order, so if the number is in the valid
1257 * range, it must be a valid animation. 1153 * range, it must be a valid animation.
1258 */ 1154 */
1259 if (anim_num < 0 || anim_num > num_animations) 1155 if (anim_num < 0 || anim_num > num_animations)
1260 { 1156 {
1261 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); 1157 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1262 return; 1158 return;
1263 } 1159 }
1264 1160
1265 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 1161 packet sl ("anim");
1266 strcpy ((char *) sl.buf, "anim "); 1162
1267 sl.len = 5; 1163 sl << uint16 (anim_num)
1268 SockList_AddShort (&sl, anim_num); 1164 << uint16 (0); /* flags - not used right now */
1269 SockList_AddShort (&sl, 0); /* flags - not used right now */ 1165
1270 /* Build up the list of faces. Also, send any information (ie, the 1166 /* Build up the list of faces. Also, send any information (ie, the
1271 * the face itself) down to the client. 1167 * the face itself) down to the client.
1272 */ 1168 */
1273 for (i = 0; i < animations[anim_num].num_animations; i++) 1169 for (int i = 0; i < animations[anim_num].num_animations; i++)
1274 { 1170 {
1275 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1171 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1276 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1172 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1173
1277 SockList_AddShort (&sl, animations[anim_num].faces[i]); /* flags - not used right now */ 1174 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1278 } 1175 }
1279 Send_With_Handling (ns, &sl); 1176
1280 free (sl.buf); 1177 ns->send_packet (sl);
1178
1281 ns->anims_sent[anim_num] = 1; 1179 ns->anims_sent[anim_num] = 1;
1282} 1180}
1283 1181
1284 1182
1285/****************************************************************************** 1183/******************************************************************************
… …
1291/** 1189/**
1292 * This adds face_num to a map cell at x,y. If the client doesn't have 1190 * This adds face_num to a map cell at x,y. If the client doesn't have
1293 * the face yet, we will also send it. 1191 * the face yet, we will also send it.
1294 */ 1192 */
1295static void 1193static void
1296esrv_map_setbelow (NewSocket * ns, int x, int y, short face_num, struct Map *newmap) 1194esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1297{ 1195{
1298 if (newmap->cells[x][y].count >= MAP_LAYERS) 1196 if (newmap->cells[x][y].count >= MAP_LAYERS)
1299 { 1197 {
1198 //TODO: one or the other, can't both have abort and return, verify and act
1300 LOG (llevError, "Too many faces in map cell %d %d\n", x, y); 1199 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1301 return; 1200 return;
1302 abort (); 1201 abort ();
1303 } 1202 }
1203
1304 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; 1204 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1305 newmap->cells[x][y].count++; 1205 newmap->cells[x][y].count++;
1206
1306 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1207 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1307 esrv_send_face (ns, face_num, 0); 1208 esrv_send_face (ns, face_num, 0);
1308} 1209}
1309
1310struct LayerCell
1311{
1312 uint16 xy;
1313 short face;
1314};
1315
1316struct MapLayer
1317{
1318 int count;
1319 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1320};
1321
1322/** Checkes if map cells have changed */
1323static int
1324mapcellchanged (NewSocket * ns, int i, int j, struct Map *newmap)
1325{
1326 int k;
1327
1328 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1329 return 1;
1330 for (k = 0; k < newmap->cells[i][j].count; k++)
1331 {
1332 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1333 {
1334 return 1;
1335 }
1336 }
1337 return 0;
1338}
1339
1340/**
1341 * Basically, what this does is pack the data into layers.
1342 * cnum is the client number, cur is the the buffer we put all of
1343 * this data into. we return the end of the data. layers is
1344 * how many layers of data we should back.
1345 */
1346static uint8 *
1347compactlayer (NewSocket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1348{
1349 int x, y, k;
1350 int face;
1351 unsigned char *fcur;
1352 struct MapLayer layers[MAP_LAYERS];
1353
1354 for (k = 0; k < MAP_LAYERS; k++)
1355 layers[k].count = 0;
1356 fcur = cur;
1357 for (x = 0; x < ns->mapx; x++)
1358 {
1359 for (y = 0; y < ns->mapy; y++)
1360 {
1361 if (!mapcellchanged (ns, x, y, newmap))
1362 continue;
1363 if (newmap->cells[x][y].count == 0)
1364 {
1365 *cur = x * ns->mapy + y; /* mark empty space */
1366 cur++;
1367 continue;
1368 }
1369 for (k = 0; k < newmap->cells[x][y].count; k++)
1370 {
1371 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1372 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1373 layers[k].count++;
1374 }
1375 }
1376 }
1377 /* If no data, return now. */
1378 if (fcur == cur && layers[0].count == 0)
1379 return cur;
1380 *cur = 255; /* mark end of explicitly cleared cells */
1381 cur++;
1382 /* First pack by layers. */
1383 for (k = 0; k < numlayers; k++)
1384 {
1385 if (layers[k].count == 0)
1386 break; /* once a layer is entirely empty, no layer below it can
1387 have anything in it either */
1388 /* Pack by entries in thie layer */
1389 for (x = 0; x < layers[k].count;)
1390 {
1391 fcur = cur;
1392 *cur = layers[k].lcells[x].face >> 8;
1393 cur++;
1394 *cur = layers[k].lcells[x].face & 0xFF;
1395 cur++;
1396 face = layers[k].lcells[x].face;
1397 /* Now, we back the redundant data into 1 byte xy pairings */
1398 for (y = x; y < layers[k].count; y++)
1399 {
1400 if (layers[k].lcells[y].face == face)
1401 {
1402 *cur = (uint8) layers[k].lcells[y].xy;
1403 cur++;
1404 layers[k].lcells[y].face = -1;
1405 }
1406 }
1407 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1408 /* forward over the now redundant data */
1409 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1410 x++;
1411 }
1412 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1413 }
1414 return cur;
1415}
1416
1417static void
1418esrv_map_doneredraw (NewSocket * ns, struct Map *newmap)
1419{
1420 static long frames, bytes, tbytes, tframes;
1421 char *cur;
1422 SockList sl;
1423
1424
1425 sl.buf = (unsigned char *) malloc (MAXSOCKBUF);
1426 strcpy ((char *) sl.buf, "map ");
1427 sl.len = strlen ((char *) sl.buf);
1428
1429 cur = (char *) compactlayer (ns, (unsigned char *) sl.buf + sl.len, MAP_LAYERS, newmap);
1430 sl.len = cur - (char *) sl.buf;
1431
1432/* LOG(llevDebug, "Sending map command.\n");*/
1433
1434 if (sl.len > (int) strlen ("map ") || ns->sent_scroll)
1435 {
1436 /* All of this is just accounting stuff */
1437 if (tframes > 100)
1438 tframes = tbytes = 0;
1439
1440 tframes++;
1441 frames++;
1442 tbytes += sl.len;
1443 bytes += sl.len;
1444 memcpy (&ns->lastmap, newmap, sizeof (struct Map));
1445 Send_With_Handling (ns, &sl);
1446 ns->sent_scroll = 0;
1447 }
1448
1449 free (sl.buf);
1450}
1451
1452 1210
1453/** Clears a map cell */ 1211/** Clears a map cell */
1454static void 1212static void
1455map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1213map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
1456{ 1214{
… …
1467#define MAX_LAYERS 3 1225#define MAX_LAYERS 3
1468 1226
1469/* Using a global really isn't a good approach, but saves the over head of 1227/* Using a global really isn't a good approach, but saves the over head of
1470 * allocating and deallocating such a block of data each time run through, 1228 * allocating and deallocating such a block of data each time run through,
1471 * and saves the space of allocating this in the socket object when we only 1229 * and saves the space of allocating this in the socket object when we only
1472 * need it for this cycle. If the serve is ever threaded, this needs to be 1230 * need it for this cycle. If the server is ever threaded, this needs to be
1473 * re-examined. 1231 * re-examined.
1474 */ 1232 */
1475
1476static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1233static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1477 1234
1478/** 1235/**
1479 * Returns true if any of the heads for this 1236 * Returns true if any of the heads for this
1480 * space is set. Returns false if all are blank - this is used 1237 * space is set. Returns false if all are blank - this is used
1481 * for empty space checking. 1238 * for empty space checking.
1482 */ 1239 */
1483static inline int 1240static inline int
1484have_head (int ax, int ay) 1241have_head (int ax, int ay)
1485{ 1242{
1486
1487 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1243 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1488 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) 1244 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1489 return 1; 1245 return 1;
1246
1490 return 0; 1247 return 0;
1491} 1248}
1492 1249
1493/** 1250/**
1494 * check_head is a bit simplistic version of update_space below. 1251 * check_head is a bit simplistic version of update_space below.
1495 * basically, it only checks the that the head on space ax,ay at layer 1252 * basically, it only checks the that the head on space ax,ay at layer
1496 * needs to get sent - if so, it adds the data, sending the head 1253 * needs to get sent - if so, it adds the data, sending the head
1497 * if needed, and returning 1. If this no data needs to get 1254 * if needed, and returning 1. If this no data needs to get
1498 * sent, it returns zero. 1255 * sent, it returns zero.
1499 */ 1256 */
1500static int 1257static int
1501check_head (SockList & sl, NewSocket & ns, int ax, int ay, int layer) 1258check_head (packet &sl, client &ns, int ax, int ay, int layer)
1502{ 1259{
1503 short face_num; 1260 short face_num;
1504 1261
1505 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) 1262 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1506 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; 1263 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1507 else 1264 else
1508 face_num = 0; 1265 face_num = 0;
1509 1266
1510 if (face_num != ns.lastmap.cells[ax][ay].faces[layer]) 1267 if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1511 { 1268 {
1512 SockList_AddShort (&sl, face_num); 1269 sl << uint16 (face_num);
1513 if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE)) 1270 if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1514 esrv_send_face (&ns, face_num, 0); 1271 esrv_send_face (&ns, face_num, 0);
1272
1515 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL; 1273 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1516 ns.lastmap.cells[ax][ay].faces[layer] = face_num; 1274 ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1517 return 1; 1275 return 1;
1518 } 1276 }
1519 1277
… …
1537 * numbers the spaces differently - I think this was a leftover from 1295 * numbers the spaces differently - I think this was a leftover from
1538 * the map command, where the faces stack up. Sinces that is no longer 1296 * the map command, where the faces stack up. Sinces that is no longer
1539 * the case, it seems to make more sense to have these layer values 1297 * the case, it seems to make more sense to have these layer values
1540 * actually match. 1298 * actually match.
1541 */ 1299 */
1542
1543static int 1300static int
1544update_space (SockList * sl, NewSocket * ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1301update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1545{ 1302{
1546 object *ob, *head; 1303 object *ob, *head;
1547 uint16 face_num; 1304 uint16 face_num;
1548 int bx, by, i; 1305 int bx, by, i;
1549 1306
1550 /* If there is a multipart object stored away, treat that as more important. 1307 /* If there is a multipart object stored away, treat that as more important.
1551 * If not, then do the normal processing. 1308 * If not, then do the normal processing.
1552 */ 1309 */
1553
1554 head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer]; 1310 head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1555 1311
1556 /* Check to see if this head is part of the set of objects 1312 /* Check to see if this head is part of the set of objects
1557 * we would normally send for this space. If so, then 1313 * we would normally send for this space. If so, then
1558 * don't use the head value. We need to do the check 1314 * don't use the head value. We need to do the check
… …
1723 1479
1724 /* Another hack - because of heads and whatnot, this face may match one 1480 /* Another hack - because of heads and whatnot, this face may match one
1725 * we already sent for a lower layer. In that case, don't send 1481 * we already sent for a lower layer. In that case, don't send
1726 * this one. 1482 * this one.
1727 */ 1483 */
1728 if (face_num && layer + 1 < MAP_LAYERS && ns->lastmap.cells[sx][sy].faces[layer + 1] == face_num) 1484 if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1729 {
1730 face_num = 0; 1485 face_num = 0;
1731 }
1732 1486
1733 /* We've gotten what face we want to use for the object. Now see if 1487 /* We've gotten what face we want to use for the object. Now see if
1734 * if it has changed since we last sent it to the client. 1488 * if it has changed since we last sent it to the client.
1735 */ 1489 */
1736 if (ns->lastmap.cells[sx][sy].faces[layer] != face_num) 1490 if (ns.lastmap.cells[sx][sy].faces[layer] != face_num)
1737 { 1491 {
1738 ns->lastmap.cells[sx][sy].faces[layer] = face_num; 1492 ns.lastmap.cells[sx][sy].faces[layer] = face_num;
1739 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1493 if (!(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1740 esrv_send_face (ns, face_num, 0); 1494 esrv_send_face (&ns, face_num, 0);
1741 SockList_AddShort (sl, face_num); 1495
1496 sl << uint16 (face_num);
1742 return 1; 1497 return 1;
1743 } 1498 }
1499
1744 /* Nothing changed */ 1500 /* Nothing changed */
1745 return 0; 1501 return 0;
1746} 1502}
1747 1503
1748/** 1504/**
… …
1763 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ 1519 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1764 * take. 1520 * take.
1765 */ 1521 */
1766 1522
1767static inline int 1523static inline int
1768update_smooth (SockList * sl, NewSocket * ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1524update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1769{ 1525{
1770 object *ob; 1526 object *ob;
1771 int smoothlevel; /* old face_num; */ 1527 int smoothlevel; /* old face_num; */
1772 1528
1773 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1529 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
… …
1778 if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp)) 1534 if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp))
1779 smoothlevel = 0; 1535 smoothlevel = 0;
1780 else 1536 else
1781 { 1537 {
1782 smoothlevel = ob->smoothlevel; 1538 smoothlevel = ob->smoothlevel;
1783 if (smoothlevel && !(ns->faces_sent[ob->face->number] & NS_FACESENT_SMOOTH)) 1539 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
1784 SendSmooth (ns, ob->face->number); 1540 SendSmooth (&ns, ob->face->number);
1785 } /* else not already head object or blank face */ 1541 } /* else not already head object or blank face */
1786 1542
1787 /* We've gotten what face we want to use for the object. Now see if 1543 /* We've gotten what face we want to use for the object. Now see if
1788 * if it has changed since we last sent it to the client. 1544 * if it has changed since we last sent it to the client.
1789 */ 1545 */
1790 if (smoothlevel > 255) 1546 if (smoothlevel > 255)
1791 smoothlevel = 255; 1547 smoothlevel = 255;
1792 else if (smoothlevel < 0) 1548 else if (smoothlevel < 0)
1793 smoothlevel = 0; 1549 smoothlevel = 0;
1550
1794 if (ns->lastmap.cells[sx][sy].smooth[layer] != smoothlevel) 1551 if (ns.lastmap.cells[sx][sy].smooth[layer] != smoothlevel)
1795 { 1552 {
1796 ns->lastmap.cells[sx][sy].smooth[layer] = smoothlevel; 1553 ns.lastmap.cells[sx][sy].smooth[layer] = smoothlevel;
1797 SockList_AddChar (sl, (uint8) (smoothlevel & 0xFF)); 1554 sl << uint8 (smoothlevel);
1798 return 1; 1555 return 1;
1799 } 1556 }
1557
1800 /* Nothing changed */ 1558 /* Nothing changed */
1801 return 0; 1559 return 0;
1802} 1560}
1803 1561
1804/** 1562/**
1805 * Returns the size of a data for a map square as returned by 1563 * Returns the size of a data for a map square as returned by
1806 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1564 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1807 * available. 1565 * available.
1808 */ 1566 */
1809int 1567int
1810getExtendedMapInfoSize (NewSocket * ns) 1568getExtendedMapInfoSize (client * ns)
1811{ 1569{
1812 int result = 0; 1570 int result = 0;
1813 1571
1814 if (ns->ext_mapinfos) 1572 if (ns->ext_mapinfos)
1815 { 1573 {
1816 if (ns->EMI_smooth) 1574 if (ns->EMI_smooth)
1817 result += 1; /*One byte for smoothlevel */ 1575 result += 1; /*One byte for smoothlevel */
1818 } 1576 }
1577
1819 return result; 1578 return result;
1820} 1579}
1821 1580
1822/** 1581/**
1823 * This function uses the new map1 protocol command to send the map 1582 * This function uses the new map1 protocol command to send the map
… …
1845draw_client_map1 (object *pl) 1604draw_client_map1 (object *pl)
1846{ 1605{
1847 int x, y, ax, ay, d, startlen, max_x, max_y, oldlen; 1606 int x, y, ax, ay, d, startlen, max_x, max_y, oldlen;
1848 sint16 nx, ny; 1607 sint16 nx, ny;
1849 int estartlen, eoldlen; 1608 int estartlen, eoldlen;
1850 SockList sl;
1851 SockList esl; /*For extended Map info */
1852 uint16 mask, emask; 1609 uint16 mask, emask;
1853 uint8 eentrysize; 1610 uint8 eentrysize;
1854 uint16 ewhatstart, ewhatflag; 1611 uint16 ewhatstart, ewhatflag;
1855 uint8 extendedinfos; 1612 uint8 extendedinfos;
1856 maptile *m; 1613 maptile *m;
1857 1614
1858 NewSocket & socket = pl->contr->socket; 1615 client &socket = *pl->contr->socket;
1859 1616
1860 check_map_change (pl->contr); 1617 check_map_change (pl->contr);
1861 1618
1862 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 1619 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1863 if (socket.mapmode == Map1Cmd) 1620 packet esl;
1864 strcpy ((char *) sl.buf, "map1 "); 1621
1865 else
1866 strcpy ((char *) sl.buf, "map1a ");
1867 sl.len = strlen ((char *) sl.buf);
1868 startlen = sl.len; 1622 startlen = sl.length ();
1869 1623
1870 /*Extendedmapinfo structure initialisation */ 1624 /*Extendedmapinfo structure initialisation */
1871 if (socket.ext_mapinfos) 1625 if (socket.ext_mapinfos)
1872 { 1626 {
1873 esl.buf = (unsigned char *) malloc (MAXSOCKBUF);
1874 strcpy ((char *) esl.buf, "mapextended ");
1875 esl.len = strlen ((char *) esl.buf);
1876 extendedinfos = EMI_NOREDRAW; 1627 extendedinfos = EMI_NOREDRAW;
1877 1628
1878 if (socket.EMI_smooth) 1629 if (socket.EMI_smooth)
1879 extendedinfos |= EMI_SMOOTH; 1630 extendedinfos |= EMI_SMOOTH;
1880 1631
1881 ewhatstart = esl.len; 1632 ewhatstart = esl.length ();
1882 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit 1633 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1883 could need to be taken away */ 1634 could need to be taken away */
1884 SockList_AddChar (&esl, extendedinfos);
1885 eentrysize = getExtendedMapInfoSize (&socket); 1635 eentrysize = getExtendedMapInfoSize (&socket);
1886 SockList_AddChar (&esl, eentrysize); 1636 esl << "mapextended "
1637 << uint8 (extendedinfos)
1638 << uint8 (eentrysize);
1639
1887 estartlen = esl.len; 1640 estartlen = esl.length ();
1888 } 1641 }
1889 else 1642 else
1890 { 1643 {
1891 /* suppress compiler warnings */ 1644 /* suppress compiler warnings */
1892 ewhatstart = 0; 1645 ewhatstart = 0;
… …
1917 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) 1670 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1918 { 1671 {
1919 ax = 0; 1672 ax = 0;
1920 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1673 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1921 { 1674 {
1922
1923 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1675 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1924 1676
1925 /* If this space is out of the normal viewable area, we only check 1677 /* If this space is out of the normal viewable area, we only check
1926 * the heads value ax or ay will only be greater than what 1678 * the heads value ax or ay will only be greater than what
1927 * the client wants if using the map1a command - this is because 1679 * the client wants if using the map1a command - this is because
… …
1930 */ 1682 */
1931 if (ax >= socket.mapx || ay >= socket.mapy) 1683 if (ax >= socket.mapx || ay >= socket.mapy)
1932 { 1684 {
1933 int i, got_one; 1685 int i, got_one;
1934 1686
1935 oldlen = sl.len; 1687 oldlen = sl.length ();
1936 1688
1937 SockList_AddShort (&sl, mask); 1689 sl << uint16 (mask);
1938 1690
1939 if (check_head (sl, socket, ax, ay, 2)) 1691 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1940 mask |= 0x4;
1941 if (check_head (sl, socket, ax, ay, 1)) 1692 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1942 mask |= 0x2;
1943 if (check_head (sl, socket, ax, ay, 0)) 1693 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1944 mask |= 0x1;
1945 1694
1946 /* If all we are doing is sending 0 (blank) faces, we don't 1695 /* If all we are doing is sending 0 (blank) faces, we don't
1947 * actually need to send that - just the coordinates 1696 * actually need to send that - just the coordinates
1948 * with no faces tells the client to blank out the 1697 * with no faces tells the client to blank out the
1949 * space. 1698 * space.
1950 */ 1699 */
1951 got_one = 0; 1700 got_one = 0;
1952 for (i = oldlen + 2; i < sl.len; i++) 1701 for (i = oldlen + 2; i < sl.length (); i++)
1953 if (sl.buf[i]) 1702 if (sl[i])
1954 got_one = 1; 1703 got_one = 1;
1955 1704
1956 if (got_one && (mask & 0xf)) 1705 if (got_one && (mask & 0xf))
1957 sl.buf[oldlen + 1] = mask & 0xff; 1706 sl[oldlen + 1] = mask & 0xff;
1958 else 1707 else
1959 { /*either all faces blank, either no face at all */ 1708 { /*either all faces blank, either no face at all */
1960 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */ 1709 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1961 sl.len = oldlen + 2; 1710 sl.reset (oldlen + 2);
1962 else 1711 else
1963 sl.len = oldlen; 1712 sl.reset (oldlen);
1964 } 1713 }
1965 1714
1966 /*What concerns extendinfos, nothing to be done for now 1715 /*What concerns extendinfos, nothing to be done for now
1967 * (perhaps effects layer later) 1716 * (perhaps effects layer later)
1968 */ 1717 */
… …
1986 * if this hasn't already been done. If the space is out 1735 * if this hasn't already been done. If the space is out
1987 * of the map, it shouldn't have a head 1736 * of the map, it shouldn't have a head
1988 */ 1737 */
1989 if (lastcell.count != -1) 1738 if (lastcell.count != -1)
1990 { 1739 {
1991 SockList_AddShort (&sl, mask); 1740 sl << uint16 (mask);
1992 map_clearcell (&lastcell, 0, 0, 0, -1); 1741 map_clearcell (&lastcell, 0, 0, 0, -1);
1993 } 1742 }
1994 } 1743 }
1995 else if (d > 3) 1744 else if (d > 3)
1996 { 1745 {
… …
1998 1747
1999 /* This block deals with spaces that are not visible for whatever 1748 /* This block deals with spaces that are not visible for whatever
2000 * reason. Still may need to send the head for this space. 1749 * reason. Still may need to send the head for this space.
2001 */ 1750 */
2002 1751
2003 oldlen = sl.len; 1752 oldlen = sl.length ();
2004 1753
2005 SockList_AddShort (&sl, mask); 1754 sl << uint16 (mask);
2006 1755
2007 if (lastcell.count != -1) 1756 if (lastcell.count != -1)
2008 need_send = 1; 1757 need_send = 1;
2009 1758
2010 count = -1; 1759 count = -1;
2011 1760
2012 if (socket.mapmode == Map1aCmd && have_head (ax, ay)) 1761 if (socket.mapmode == Map1aCmd && have_head (ax, ay))
2013 { 1762 {
2014 /* Now check to see if any heads need to be sent */ 1763 /* Now check to see if any heads need to be sent */
2015 1764
2016 if (check_head (sl, socket, ax, ay, 2)) 1765 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
2017 mask |= 0x4;
2018 if (check_head (sl, socket, ax, ay, 1)) 1766 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
2019 mask |= 0x2;
2020 if (check_head (sl, socket, ax, ay, 0)) 1767 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
2021 mask |= 0x1;
2022 1768
2023 lastcell.count = count; 1769 lastcell.count = count;
2024 } 1770 }
2025 else 1771 else
2026 { 1772 {
… …
2031 1777
2032 map_clearcell (&lastcell, 0, 0, 0, count); 1778 map_clearcell (&lastcell, 0, 0, 0, count);
2033 } 1779 }
2034 1780
2035 if ((mask & 0xf) || need_send) 1781 if ((mask & 0xf) || need_send)
2036 sl.buf[oldlen + 1] = mask & 0xff; 1782 sl[oldlen + 1] = mask & 0xff;
2037 else 1783 else
2038 sl.len = oldlen; 1784 sl.reset (oldlen);
2039 } 1785 }
2040 else 1786 else
2041 { 1787 {
2042 /* In this block, the space is visible or there are head objects 1788 /* In this block, the space is visible or there are head objects
2043 * we need to send. 1789 * we need to send.
… …
2045 1791
2046 /* Rather than try to figure out what everything that we might 1792 /* Rather than try to figure out what everything that we might
2047 * need to send is, then form the packet after that, 1793 * need to send is, then form the packet after that,
2048 * we presume that we will in fact form a packet, and update 1794 * we presume that we will in fact form a packet, and update
2049 * the bits by what we do actually send. If we send nothing, 1795 * the bits by what we do actually send. If we send nothing,
2050 * we just back out sl.len to the old value, and no harm 1796 * we just back out sl.length () to the old value, and no harm
2051 * is done. 1797 * is done.
2052 * I think this is simpler than doing a bunch of checks to see 1798 * I think this is simpler than doing a bunch of checks to see
2053 * what if anything we need to send, setting the bits, then 1799 * what if anything we need to send, setting the bits, then
2054 * doing those checks again to add the real data. 1800 * doing those checks again to add the real data.
2055 */ 1801 */
2056 oldlen = sl.len; 1802 oldlen = sl.length ();
2057 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1803 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2058 eoldlen = esl.len; 1804 eoldlen = esl.length ();
2059 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1805 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2060 SockList_AddShort (&sl, mask); 1806 sl << uint16 (mask);
2061 1807
2062 if (socket.ext_mapinfos) 1808 if (socket.ext_mapinfos)
2063 SockList_AddShort (&esl, emask); 1809 esl << uint16 (emask);
2064 1810
2065 unsigned char dummy; 1811 unsigned char dummy;
2066 unsigned char *last_ext = &dummy; 1812 unsigned char *last_ext = &dummy;
2067 1813
2068 /* Darkness changed */ 1814 /* Darkness changed */
… …
2071 mask |= 0x8; 1817 mask |= 0x8;
2072 1818
2073 if (socket.extmap) 1819 if (socket.extmap)
2074 { 1820 {
2075 *last_ext |= 0x80; 1821 *last_ext |= 0x80;
2076 last_ext = sl.buf + sl.len; 1822 last_ext = &sl[sl.length ()];
2077 SockList_AddChar (&sl, d); 1823 sl << uint8 (d);
2078 } 1824 }
2079 else 1825 else
2080 SockList_AddChar (&sl, 255 - 64 * d); 1826 sl << uint8 (255 - 64 * d);
2081 } 1827 }
2082 1828
2083 lastcell.count = d; 1829 lastcell.count = d;
2084 1830
2085 if (socket.extmap) 1831 if (socket.extmap)
… …
2115 { 1861 {
2116 lastcell.stat_hp = stat_hp; 1862 lastcell.stat_hp = stat_hp;
2117 1863
2118 mask |= 0x8; 1864 mask |= 0x8;
2119 *last_ext |= 0x80; 1865 *last_ext |= 0x80;
2120 last_ext = sl.buf + sl.len; 1866 last_ext = &sl[sl.length ()];
2121 1867
2122 sl << uint8 (5) << uint8 (stat_hp); 1868 sl << uint8 (5) << uint8 (stat_hp);
2123 1869
2124 if (stat_width > 1) 1870 if (stat_width > 1)
2125 { 1871 {
2126 *last_ext |= 0x80; 1872 *last_ext |= 0x80;
2127 last_ext = sl.buf + sl.len; 1873 last_ext = &sl[sl.length ()];
2128 1874
2129 sl << uint8 (6) << uint8 (stat_width); 1875 sl << uint8 (6) << uint8 (stat_width);
2130 } 1876 }
2131 } 1877 }
2132 1878
… …
2134 { 1880 {
2135 lastcell.player = player; 1881 lastcell.player = player;
2136 1882
2137 mask |= 0x8; 1883 mask |= 0x8;
2138 *last_ext |= 0x80; 1884 *last_ext |= 0x80;
2139 last_ext = sl.buf + sl.len; 1885 last_ext = &sl[sl.length ()];
2140 1886
2141 sl << uint8 (0x47) << uint8 (8) << (uint64)player; 1887 sl << uint8 (0x47) << uint8 (8) << (uint64)player;
2142 } 1888 }
2143 1889
2144 if (lastcell.flags != flags) 1890 if (lastcell.flags != flags)
2145 { 1891 {
2146 lastcell.flags = flags; 1892 lastcell.flags = flags;
2147 1893
2148 mask |= 0x8; 1894 mask |= 0x8;
2149 *last_ext |= 0x80; 1895 *last_ext |= 0x80;
2150 last_ext = sl.buf + sl.len; 1896 last_ext = &sl[sl.length ()];
2151 1897
2152 sl << uint8 (8) << uint8 (flags); 1898 sl << uint8 (8) << uint8 (flags);
2153 } 1899 }
2154 } 1900 }
2155 1901
2156 /* Floor face */ 1902 /* Floor face */
2157 if (update_space (&sl, &socket, m, nx, ny, ax, ay, 2)) 1903 if (update_space (sl, socket, m, nx, ny, ax, ay, 2))
2158 mask |= 0x4; 1904 mask |= 0x4;
2159 1905
2160 if (socket.EMI_smooth) 1906 if (socket.EMI_smooth)
2161 if (update_smooth (&esl, &socket, m, nx, ny, ax, ay, 2)) 1907 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 2))
2162 emask |= 0x4; 1908 emask |= 0x4;
2163 1909
2164 /* Middle face */ 1910 /* Middle face */
2165 if (update_space (&sl, &socket, m, nx, ny, ax, ay, 1)) 1911 if (update_space (sl, socket, m, nx, ny, ax, ay, 1))
2166 mask |= 0x2; 1912 mask |= 0x2;
2167 1913
2168 if (socket.EMI_smooth) 1914 if (socket.EMI_smooth)
2169 if (update_smooth (&esl, &socket, m, nx, ny, ax, ay, 1)) 1915 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1))
2170 emask |= 0x2; 1916 emask |= 0x2;
2171 1917
2172 if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1)) 1918 if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
2173 { 1919 {
2174 if (lastcell.faces[0] != pl->face->number) 1920 if (lastcell.faces[0] != pl->face->number)
… …
2183 } 1929 }
2184 } 1930 }
2185 else 1931 else
2186 { 1932 {
2187 /* Top face */ 1933 /* Top face */
2188 if (update_space (&sl, &socket, m, nx, ny, ax, ay, 0)) 1934 if (update_space (sl, socket, m, nx, ny, ax, ay, 0))
2189 mask |= 0x1; 1935 mask |= 0x1;
2190 1936
2191 if (socket.EMI_smooth) 1937 if (socket.EMI_smooth)
2192 if (update_smooth (&esl, &socket, m, nx, ny, ax, ay, 0)) 1938 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 0))
2193 emask |= 0x1; 1939 emask |= 0x1;
2194 } 1940 }
2195 1941
2196 /* Check to see if we are in fact sending anything for this 1942 /* Check to see if we are in fact sending anything for this
2197 * space by checking the mask. If so, update the mask. 1943 * space by checking the mask. If so, update the mask.
2198 * if not, reset the len to that from before adding the mask 1944 * if not, reset the len to that from before adding the mask
2199 * value, so we don't send those bits. 1945 * value, so we don't send those bits.
2200 */ 1946 */
2201 if (mask & 0xf) 1947 if (mask & 0xf)
2202 sl.buf[oldlen + 1] = mask & 0xff; 1948 sl[oldlen + 1] = mask & 0xff;
2203 else 1949 else
2204 sl.len = oldlen; 1950 sl.reset (oldlen);
2205 1951
2206 if (emask & 0xf) 1952 if (emask & 0xf)
2207 esl.buf[eoldlen + 1] = emask & 0xff; 1953 esl[eoldlen + 1] = emask & 0xff;
2208 else 1954 else
2209 esl.len = eoldlen; 1955 esl.reset (eoldlen);
2210 } /* else this is a viewable space */ 1956 } /* else this is a viewable space */
2211 } /* for x loop */ 1957 } /* for x loop */
2212 } /* for y loop */ 1958 } /* for y loop */
2213 1959
2214 /* Verify that we in fact do need to send this */ 1960 /* Verify that we in fact do need to send this */
2215 if (socket.ext_mapinfos) 1961 if (socket.ext_mapinfos)
2216 { 1962 {
2217 if (!(sl.len > startlen || socket.sent_scroll)) 1963 if (!(sl.length () > startlen || socket.sent_scroll))
2218 { 1964 {
2219 /* No map data will follow, so don't say the client 1965 /* No map data will follow, so don't say the client
2220 * it doesn't need draw! 1966 * it doesn't need draw!
2221 */ 1967 */
2222 ewhatflag &= (~EMI_NOREDRAW); 1968 ewhatflag &= (~EMI_NOREDRAW);
2223 esl.buf[ewhatstart + 1] = ewhatflag & 0xff; 1969 esl[ewhatstart + 1] = ewhatflag & 0xff;
2224 } 1970 }
2225 1971
2226 if (esl.len > estartlen) 1972 if (esl.length () > estartlen)
2227 Send_With_Handling (&socket, &esl); 1973 socket.send_packet (esl);
2228
2229 free (esl.buf);
2230 } 1974 }
2231 1975
2232 if (sl.len > startlen || socket.sent_scroll) 1976 if (sl.length () > startlen || socket.sent_scroll)
2233 { 1977 {
2234 Send_With_Handling (&socket, &sl); 1978 socket.send_packet (sl);
2235 socket.sent_scroll = 0; 1979 socket.sent_scroll = 0;
2236 } 1980 }
2237
2238 free (sl.buf);
2239} 1981}
2240 1982
2241/** 1983/**
2242 * Draws client map. 1984 * Draws client map.
2243 */ 1985 */
… …
2267 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 2009 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2268 return; 2010 return;
2269 2011
2270 memset (&newmap, 0, sizeof (struct Map)); 2012 memset (&newmap, 0, sizeof (struct Map));
2271 2013
2272 for (j = (pl->y - pl->contr->socket.mapy / 2); j < (pl->y + (pl->contr->socket.mapy + 1) / 2); j++) 2014 for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++)
2273 {
2274 for (i = (pl->x - pl->contr->socket.mapx / 2); i < (pl->x + (pl->contr->socket.mapx + 1) / 2); i++) 2015 for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++)
2275 { 2016 {
2276 ax = i; 2017 ax = i;
2277 ay = j; 2018 ay = j;
2278 m = pm; 2019 m = pm;
2279 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2020 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2021
2280 if (mflags & P_OUT_OF_MAP) 2022 if (mflags & P_OUT_OF_MAP)
2281 continue; 2023 continue;
2282 if (mflags & P_NEED_UPDATE) 2024
2283 update_position (m, ax, ay);
2284 /* If a map is visible to the player, we don't want to swap it out 2025 /* If a map is visible to the player, we don't want to swap it out
2285 * just to reload it. This should really call something like 2026 * just to reload it. This should really call something like
2286 * swap_map, but this is much more efficient and 'good enough' 2027 * swap_map, but this is much more efficient and 'good enough'
2287 */ 2028 */
2288 if (mflags & P_NEW_MAP) 2029 if (mflags & P_NEW_MAP)
2289 m->timeout = 50; 2030 m->timeout = 50;
2290 } 2031 }
2291 } 2032
2292 /* do LOS after calls to update_position */ 2033 /* do LOS after calls to update_position */
2293 if (pl->contr->do_los) 2034 if (pl->contr->do_los)
2294 { 2035 {
2295 update_los (pl); 2036 update_los (pl);
2296 pl->contr->do_los = 0; 2037 pl->contr->do_los = 0;
2297 } 2038 }
2298 2039
2299 if (pl->contr->socket.mapmode == Map1Cmd || pl->contr->socket.mapmode == Map1aCmd)
2300 {
2301 /* Big maps need a different drawing mechanism to work */ 2040 /* Big maps need a different drawing mechanism to work */
2302 draw_client_map1 (pl); 2041 draw_client_map1 (pl);
2303 return;
2304 }
2305
2306 if (pl->invisible & (pl->invisible < 50 ? 4 : 1))
2307 {
2308 esrv_map_setbelow (&pl->contr->socket, pl->contr->socket.mapx / 2, pl->contr->socket.mapy / 2, pl->face->number, &newmap);
2309 }
2310
2311 /* j and i are the y and x coordinates of the real map (which is
2312 * basically some number of spaces around the player)
2313 * ax and ay are values from within the viewport (ie, 0, 0 is upper
2314 * left corner) and are thus disconnected from the map values.
2315 * Subtract 1 from the max values so that we properly handle cases where
2316 * player has specified an even map. Otherwise, we try to send them too
2317 * much, ie, if mapx is 10, we would try to send from -5 to 5, which is actually
2318 * 11 spaces. Now, we would send from -5 to 4, which is properly. If mapx is
2319 * odd, this still works fine.
2320 */
2321 ay = 0;
2322 for (j = pl->y - pl->contr->socket.mapy / 2; j <= pl->y + (pl->contr->socket.mapy - 1) / 2; j++, ay++)
2323 {
2324 ax = 0;
2325 for (i = pl->x - pl->contr->socket.mapx / 2; i <= pl->x + (pl->contr->socket.mapx - 1) / 2; i++, ax++)
2326 {
2327
2328 d = pl->contr->blocked_los[ax][ay];
2329 /* note the out_of_map and d>3 checks are both within the same
2330 * negation check.
2331 */
2332 nx = i;
2333 ny = j;
2334 m = get_map_from_coord (pm, &nx, &ny);
2335 if (m && d < 4)
2336 {
2337 face = GET_MAP_FACE (m, nx, ny, 0);
2338 floor2 = GET_MAP_FACE (m, nx, ny, 1);
2339 floor = GET_MAP_FACE (m, nx, ny, 2);
2340
2341 /* If all is blank, send a blank face. */
2342 if ((!face || face == blank_face) && (!floor2 || floor2 == blank_face) && (!floor || floor == blank_face))
2343 {
2344 esrv_map_setbelow (&pl->contr->socket, ax, ay, blank_face->number, &newmap);
2345 }
2346 else
2347 { /* actually have something interesting */
2348 /* send the darkness mask, if any. */
2349 if (d && pl->contr->socket.darkness)
2350 esrv_map_setbelow (&pl->contr->socket, ax, ay, dark_faces[d - 1]->number, &newmap);
2351
2352 if (face && face != blank_face)
2353 esrv_map_setbelow (&pl->contr->socket, ax, ay, face->number, &newmap);
2354 if (floor2 && floor2 != blank_face)
2355 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor2->number, &newmap);
2356 if (floor && floor != blank_face)
2357 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor->number, &newmap);
2358 }
2359 } /* Is a valid space */
2360 }
2361 }
2362 esrv_map_doneredraw (&pl->contr->socket, &newmap);
2363
2364 check_map_change (pl->contr);
2365} 2042}
2366 2043
2367 2044
2368/*****************************************************************************/ 2045/*****************************************************************************/
2369 2046
… …
2375 2052
2376/*****************************************************************************/ 2053/*****************************************************************************/
2377void 2054void
2378send_plugin_custom_message (object *pl, char *buf) 2055send_plugin_custom_message (object *pl, char *buf)
2379{ 2056{
2380 cs_write_string (&pl->contr->socket, buf, strlen (buf)); 2057 pl->contr->socket->send_packet (buf);
2381} 2058}
2382 2059
2383/** 2060/**
2384 * This sends the skill number to name mapping. We ignore 2061 * This sends the skill number to name mapping. We ignore
2385 * the params - we always send the same info no matter what. 2062 * the params - we always send the same info no matter what.
2386 */ 2063 */
2387void 2064void
2388send_skill_info (NewSocket * ns, char *params) 2065send_skill_info (client *ns, char *params)
2389{ 2066{
2390 SockList sl; 2067 packet sl;
2391 int i; 2068 sl << "replyinfo skill_info\n";
2392 2069
2393 sl.buf = (unsigned char *) malloc (MAXSOCKBUF);
2394 strcpy ((char *) sl.buf, "replyinfo skill_info\n");
2395 for (i = 1; i < NUM_SKILLS; i++) 2070 for (int i = 1; i < NUM_SKILLS; i++)
2396 { 2071 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
2397 sprintf ((char *) sl.buf + strlen ((char *) sl.buf), "%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); 2072
2398 }
2399 sl.len = strlen ((char *) sl.buf);
2400 if (sl.len >= MAXSOCKBUF) 2073 if (sl.length () >= MAXSOCKBUF)
2401 { 2074 {
2402 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 2075 LOG (llevError, "Buffer overflow in send_skill_info!\n");
2403 fatal (0); 2076 fatal (0);
2404 } 2077 }
2405 Send_With_Handling (ns, &sl); 2078
2406 free (sl.buf); 2079 ns->send_packet (sl);
2407} 2080}
2408 2081
2409/** 2082/**
2410 * This sends the spell path to name mapping. We ignore 2083 * This sends the spell path to name mapping. We ignore
2411 * the params - we always send the same info no matter what. 2084 * the params - we always send the same info no matter what.
2412 */ 2085 */
2413void 2086void
2414send_spell_paths (NewSocket * ns, char *params) 2087send_spell_paths (client * ns, char *params)
2415{ 2088{
2416 SockList sl; 2089 packet sl;
2417 int i;
2418 2090
2419 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 2091 sl << "replyinfo spell_paths\n";
2420 strcpy ((char *) sl.buf, "replyinfo spell_paths\n"); 2092
2421 for (i = 0; i < NRSPELLPATHS; i++) 2093 for (int i = 0; i < NRSPELLPATHS; i++)
2422 sprintf ((char *) sl.buf + strlen ((char *) sl.buf), "%d:%s\n", 1 << i, spellpathnames[i]); 2094 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
2423 sl.len = strlen ((char *) sl.buf); 2095
2424 if (sl.len >= MAXSOCKBUF) 2096 if (sl.length () >= MAXSOCKBUF)
2425 { 2097 {
2426 LOG (llevError, "Buffer overflow in send_spell_paths!\n"); 2098 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
2427 fatal (0); 2099 fatal (0);
2428 } 2100 }
2429 Send_With_Handling (ns, &sl); 2101
2430 free (sl.buf); 2102 ns->send_packet (sl);
2431} 2103}
2432 2104
2433/** 2105/**
2434 * This looks for any spells the player may have that have changed their stats. 2106 * This looks for any spells the player may have that have changed their stats.
2435 * it then sends an updspell packet for each spell that has changed in this way 2107 * it then sends an updspell packet for each spell that has changed in this way
2436 */ 2108 */
2437void 2109void
2438esrv_update_spells (player *pl) 2110esrv_update_spells (player *pl)
2439{ 2111{
2440 SockList sl;
2441 int flags = 0;
2442 object *spell;
2443
2444 if (!pl->socket.monitor_spells) 2112 if (!pl->socket->monitor_spells)
2445 return; 2113 return;
2114
2446 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2115 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2447 { 2116 {
2448 if (spell->type == SPELL) 2117 if (spell->type == SPELL)
2449 { 2118 {
2119 int flags = 0;
2120
2450 /* check if we need to update it */ 2121 /* check if we need to update it */
2451 if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) 2122 if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA))
2452 { 2123 {
2453 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); 2124 spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA);
2454 flags |= UPD_SP_MANA; 2125 flags |= UPD_SP_MANA;
2455 } 2126 }
2127
2456 if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) 2128 if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE))
2457 { 2129 {
2458 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); 2130 spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE);
2459 flags |= UPD_SP_GRACE; 2131 flags |= UPD_SP_GRACE;
2460 } 2132 }
2133
2461 if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) 2134 if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell))
2462 { 2135 {
2463 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); 2136 spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell);
2464 flags |= UPD_SP_DAMAGE; 2137 flags |= UPD_SP_DAMAGE;
2465 } 2138 }
2139
2466 if (flags != 0) 2140 if (flags)
2467 { 2141 {
2468 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 2142 packet sl;
2469 strcpy ((char *) sl.buf, "updspell ");
2470 sl.len = strlen ((char *) sl.buf);
2471 2143
2144 sl << "updspell "
2145 << uint8 (flags)
2472 sl << uint8 (flags) << uint32 (spell->count); 2146 << uint32 (spell->count);
2473 2147
2474 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 2148 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2475 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 2149 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2476 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 2150 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2477 2151
2478 flags = 0; 2152 pl->socket->send_packet (sl);
2479 Send_With_Handling (&pl->socket, &sl);
2480 free (sl.buf);
2481 } 2153 }
2482 } 2154 }
2483 } 2155 }
2484} 2156}
2485 2157
2486void 2158void
2487esrv_remove_spell (player *pl, object *spell) 2159esrv_remove_spell (player *pl, object *spell)
2488{ 2160{
2489 SockList sl;
2490
2491 if (!pl->socket.monitor_spells) 2161 if (!pl->socket->monitor_spells)
2492 return; 2162 return;
2163
2493 if (!pl || !spell || spell->env != pl->ob) 2164 if (!pl || !spell || spell->env != pl->ob)
2494 { 2165 {
2495 LOG (llevError, "Invalid call to esrv_remove_spell"); 2166 LOG (llevError, "Invalid call to esrv_remove_spell");
2496 return; 2167 return;
2497 } 2168 }
2498 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 2169
2499 strcpy ((char *) sl.buf, "delspell "); 2170 packet sl ("delspell");
2500 sl.len = strlen ((char *) sl.buf);
2501 2171
2502 sl << uint32 (spell->count); 2172 sl << uint32 (spell->count);
2503 2173
2504 Send_With_Handling (&pl->socket, &sl); 2174 pl->socket->send_packet (sl);
2505 free (sl.buf);
2506} 2175}
2507 2176
2508/* appends the spell *spell to the Socklist we will send the data to. */ 2177/* appends the spell *spell to the Socklist we will send the data to. */
2509static void 2178static void
2510append_spell (player *pl, SockList &sl, object *spell) 2179append_spell (player *pl, packet &sl, object *spell)
2511{ 2180{
2512 int len, i, skill = 0; 2181 int len, i, skill = 0;
2513 2182
2514 if (!(spell->name)) 2183 if (!(spell->name))
2515 { 2184 {
… …
2552 * all spells in the player's inventory. 2221 * all spells in the player's inventory.
2553 */ 2222 */
2554void 2223void
2555esrv_add_spells (player *pl, object *spell) 2224esrv_add_spells (player *pl, object *spell)
2556{ 2225{
2557 SockList sl;
2558
2559 if (!pl) 2226 if (!pl)
2560 { 2227 {
2561 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); 2228 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2562 return; 2229 return;
2563 } 2230 }
2231
2564 if (!pl->socket.monitor_spells) 2232 if (!pl->socket->monitor_spells)
2565 return; 2233 return;
2566 sl.buf = (unsigned char *) malloc (MAXSOCKBUF); 2234
2567 strcpy ((char *) sl.buf, "addspell "); 2235 packet sl ("addspell");
2568 sl.len = strlen ((char *) sl.buf); 2236
2569 if (!spell) 2237 if (!spell)
2570 { 2238 {
2571 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2239 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
2572 { 2240 {
2573 /* were we to simply keep appending data here, we could exceed 2241 /* were we to simply keep appending data here, we could exceed
… …
2584 * like it will fix this 2252 * like it will fix this
2585 */ 2253 */
2586 if (spell->type != SPELL) 2254 if (spell->type != SPELL)
2587 continue; 2255 continue;
2588 2256
2589 if (sl.len >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 2257 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2590 { 2258 {
2591 Send_With_Handling (&pl->socket, &sl); 2259 pl->socket->send_packet (sl);
2592 strcpy ((char *) sl.buf, "addspell "); 2260
2593 sl.len = strlen ((char *) sl.buf); 2261 sl.reset ();
2262 sl << "addspell ";
2594 } 2263 }
2595 2264
2596 append_spell (pl, sl, spell); 2265 append_spell (pl, sl, spell);
2597 } 2266 }
2598 } 2267 }
… …
2602 return; 2271 return;
2603 } 2272 }
2604 else 2273 else
2605 append_spell (pl, sl, spell); 2274 append_spell (pl, sl, spell);
2606 2275
2607 if (sl.len >= MAXSOCKBUF) 2276 if (sl.length () >= MAXSOCKBUF)
2608 { 2277 {
2609 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 2278 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2610 fatal (0); 2279 fatal (0);
2611 } 2280 }
2612 2281
2613 /* finally, we can send the packet */ 2282 /* finally, we can send the packet */
2614 Send_With_Handling (&pl->socket, &sl); 2283 pl->socket->send_packet (sl);
2615 free (sl.buf);
2616} 2284}
2285

Diff Legend

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