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.18 by root, Thu Sep 14 19:08:41 2006 UTC vs.
Revision 1.70 by root, Sun Mar 11 21:26:05 2007 UTC

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

Diff Legend

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