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

Diff Legend

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