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

Diff Legend

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