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

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.21 by root, Sat Sep 16 22:24:13 2006 UTC vs.
Revision 1.62 by root, Wed Jan 10 01:16:54 2007 UTC

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

Diff Legend

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