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.22 by root, Tue Sep 19 10:12:50 2006 UTC vs.
Revision 1.66 by root, Thu Feb 15 04:04:23 2007 UTC

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

Diff Legend

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