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.21 by root, Sat Sep 16 22:24:13 2006 UTC vs.
Revision 1.44 by root, Sat Dec 16 21:40:26 2006 UTC

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

Diff Legend

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