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.32 by root, Thu Dec 14 01:12:35 2006 UTC vs.
Revision 1.56 by root, Mon Jan 1 12:28:47 2007 UTC

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

Diff Legend

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