ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
(Generate patch)

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.26 by pippijn, Mon Dec 11 19:46:47 2006 UTC vs.
Revision 1.63 by root, Fri Jan 19 17:50:11 2007 UTC

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

Diff Legend

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