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.38 by root, Thu Dec 14 22:45:41 2006 UTC vs.
Revision 1.72 by root, Mon Mar 12 02:07:43 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2001 Mark Wedel 5 * Copyright (C) 2001 Mark Wedel
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 21 *
21 The author can be reached via e-mail to <crossfire@schmorp.de> 22 * The author can be reached via e-mail to <crossfire@schmorp.de>
22*/ 23 */
23 24
24/** 25/**
25 * \file 26 * \file
26 * Client handling. 27 * Client handling.
27 * 28 *
… …
35 * have the prototype of (char *data, int datalen, int client_num). This 36 * have the prototype of (char *data, int datalen, int client_num). This
36 * way, we can use one dispatch table. 37 * way, we can use one dispatch table.
37 * 38 *
38 * esrv_map_new starts updating the map 39 * esrv_map_new starts updating the map
39 * 40 *
40 * esrv_map_setbelow allows filling in all of the faces for the map.
41 * if a face has not already been sent to the client, it is sent now.
42 *
43 * mapcellchanged, compactlayer, compactstack, perform the map compressing
44 * operations
45 *
46 */ 41 */
47 42
48#include <global.h> 43#include <global.h>
49#include <sproto.h> 44#include <sproto.h>
50 45
51#include <newclient.h>
52#include <newserver.h>
53#include <living.h> 46#include <living.h>
54#include <commands.h> 47#include <commands.h>
55 48
56/* 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,
57 * it should work here. 50 * it should work here.
… …
88 -1, /* life stealing */ 81 -1, /* life stealing */
89 -1 /* Disease - not fully done yet */ 82 -1 /* Disease - not fully done yet */
90}; 83};
91 84
92static void 85static void
93socket_map_scroll (client_socket * ns, int dx, int dy) 86socket_map_scroll (client *ns, int dx, int dy)
94{ 87{
95 struct Map newmap; 88 struct Map newmap;
96 int x, y, mx, my; 89 int x, y, mx, my;
97 90
98 {
99 packet sl;
100
101 sl.printf ("map_scroll %d %d", dx, dy); 91 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
102 ns->send_packet (sl);
103 }
104 92
105 /* If we are using the Map1aCmd, we may in fact send 93 /* If we are using the Map1aCmd, we may in fact send
106 * head information that is outside the viewable map. 94 * head information that is outside the viewable map.
107 * 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
108 * look for. Removed code to do so - it caused extra 96 * look for. Removed code to do so - it caused extra
109 * complexities for the client, and probably doesn't make 97 * complexities for the client, and probably doesn't make
110 * that much difference in bandwidth. 98 * that much difference in bandwidth.
111 */ 99 */
112 mx = ns->mapx; 100 mx = ns->mapx;
113 my = ns->mapy; 101 my = ns->mapy;
114
115 if (ns->mapmode == Map1aCmd)
116 {
117 mx += MAX_HEAD_OFFSET;
118 my += MAX_HEAD_OFFSET;
119 }
120 102
121 /* the x and y here are coordinates for the new map, i.e. if we moved 103 /* the x and y here are coordinates for the new map, i.e. if we moved
122 * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, 104 * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason,
123 * if the destination x or y coordinate is outside the viewable 105 * if the destination x or y coordinate is outside the viewable
124 * area, we clear the values - otherwise, the old values 106 * area, we clear the values - otherwise, the old values
… …
148} 130}
149 131
150static void 132static void
151clear_map (player *pl) 133clear_map (player *pl)
152{ 134{
153 client_socket &socket = *pl->socket;
154
155 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 135 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
156 136
157 if (socket.newmapcmd == 1) 137 if (pl->ns->newmapcmd == 1)
158 socket.send_packet ("newmap"); 138 pl->ns->send_packet ("newmap");
159 139
160 socket.update_look = 1; 140 pl->ns->floorbox_reset ();
161 socket.look_position = 0;
162} 141}
163 142
164/** check for map change and send new map data */ 143/** check for map/region change and send new map data */
165static void 144static void
166check_map_change (player *pl) 145check_map_change (player *pl)
167{ 146{
168 client_socket &socket = *pl->socket; 147 client &socket = *pl->ns;
169 object *ob = pl->ob; 148 object *ob = pl->ob;
170 char buf[MAX_BUF]; /* eauugggh */ 149 char buf[MAX_BUF]; /* eauugggh */
171 150
172 if (socket.current_map != ob->map) 151 if (socket.current_map != ob->map)
173 { 152 {
… …
189 flags |= 4; 168 flags |= 4;
190 if (ob->map->tile_path[3]) 169 if (ob->map->tile_path[3])
191 flags |= 8; 170 flags |= 8;
192 171
193 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", 172 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
194 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path); 173 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
195 } 174 }
196 else 175 else
197 snprintf (buf, MAX_BUF, "mapinfo current"); 176 snprintf (buf, MAX_BUF, "mapinfo current");
198 177
199 socket.send_packet (buf); 178 socket.send_packet (buf);
… …
207 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 186 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
208 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows 187 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
209 else 188 else
210 { 189 {
211 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); 190 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
212 socket.update_look = 1; 191 socket.floorbox_reset ();
213 socket.look_position = 0;
214 } 192 }
215 } 193 }
216 194
217 socket.current_x = ob->x; 195 socket.current_x = ob->x;
218 socket.current_y = ob->y; 196 socket.current_y = ob->y;
197
198 region *reg = ob->region ();
199 if (socket.current_region != reg)
200 {
201 socket.current_region = reg;
202 socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
203 }
204}
205
206/**
207 * RequestInfo is sort of a meta command. There is some specific
208 * request of information, but we call other functions to provide
209 * that information.
210 */
211void
212RequestInfo (char *buf, int len, client * ns)
213{
214 char *params = NULL, *cp;
215
216 /* No match */
217 char bigbuf[MAX_BUF];
218 int slen;
219
220 /* Set up replyinfo before we modify any of the buffers - this is used
221 * if we don't find a match.
222 */
223 strcpy (bigbuf, "replyinfo ");
224 slen = strlen (bigbuf);
225 safe_strcat (bigbuf, buf, &slen, MAX_BUF);
226
227 /* find the first space, make it null, and update the
228 * params pointer.
229 */
230 for (cp = buf; *cp != '\0'; cp++)
231 if (*cp == ' ')
232 {
233 *cp = '\0';
234 params = cp + 1;
235 break;
236 }
237
238 if (!strcmp (buf, "image_info"))
239 send_image_info (ns, params);
240 else if (!strcmp (buf, "image_sums"))
241 send_image_sums (ns, params);
242 else if (!strcmp (buf, "skill_info"))
243 send_skill_info (ns, params);
244 else if (!strcmp (buf, "spell_paths"))
245 send_spell_paths (ns, params);
246 else
247 ns->send_packet (bigbuf, len);
219} 248}
220 249
221void 250void
222ExtCmd (char *buf, int len, player *pl) 251ExtCmd (char *buf, int len, player *pl)
223{ 252{
224 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 253 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
254}
255
256void
257ExtiCmd (char *buf, int len, client *ns)
258{
259 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
225} 260}
226 261
227void 262void
228MapInfoCmd (char *buf, int len, player *pl) 263MapInfoCmd (char *buf, int len, player *pl)
229{ 264{
… …
244 buf += 8; 279 buf += 8;
245 280
246 // initial map and its origin 281 // initial map and its origin
247 maptile *map = pl->ob->map; 282 maptile *map = pl->ob->map;
248 sint16 dx, dy; 283 sint16 dx, dy;
249 int mapx = pl->socket->mapx / 2 - pl->ob->x; 284 int mapx = pl->ns->mapx / 2 - pl->ob->x;
250 int mapy = pl->socket->mapy / 2 - pl->ob->y; 285 int mapy = pl->ns->mapy / 2 - pl->ob->y;
251 int max_distance = 8; // limit maximum path length to something generous 286 int max_distance = 8; // limit maximum path length to something generous
252 287
253 while (*buf && map && max_distance) 288 while (*buf && map && max_distance)
254 { 289 {
255 int dir = *buf++; 290 int dir = *buf++;
256 291
257 switch (dir) 292 switch (dir)
258 { 293 {
259 case '1': 294 case '1':
260 dx = 0; 295 dx = 0;
261 dy = -1; 296 dy = -1;
262 map = get_map_from_coord (map, &dx, &dy); 297 map = map->xy_find (dx, dy);
263 map && (mapy -= map->height); 298 map && (mapy -= map->height);
264 break; 299 break;
265 case '2': 300 case '2':
266 mapx += map->width; 301 mapx += map->width;
267 dx = map->width; 302 dx = map->width;
268 dy = 0; 303 dy = 0;
269 map = get_map_from_coord (map, &dx, &dy); 304 map = map->xy_find (dx, dy);
270 break; 305 break;
271 case '3': 306 case '3':
272 mapy += map->height; 307 mapy += map->height;
273 dx = 0; 308 dx = 0;
274 dy = map->height; 309 dy = map->height;
275 map = get_map_from_coord (map, &dx, &dy); 310 map = map->xy_find (dx, dy);
276 break; 311 break;
277 case '4': 312 case '4':
278 dx = -1; 313 dx = -1;
279 dy = 0; 314 dy = 0;
280 map = get_map_from_coord (map, &dx, &dy); 315 map = map->xy_find (dx, dy);
281 map && (mapx -= map->width); 316 map && (mapx -= map->width);
282 break; 317 break;
283 } 318 }
284 319
285 --max_distance; 320 --max_distance;
286 } 321 }
287 322
… …
298 if (map->tile_path[2]) 333 if (map->tile_path[2])
299 flags |= 4; 334 flags |= 4;
300 if (map->tile_path[3]) 335 if (map->tile_path[3])
301 flags |= 8; 336 flags |= 8;
302 337
303 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, map->path); 338 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
304 } 339 }
305 else 340 else
306 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 341 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
307 } 342 }
308 else 343 else
309 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 344 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
310 345
311 pl->socket->send_packet (bigbuf); 346 pl->ns->send_packet (bigbuf);
312} 347}
313 348
314/** This is the Setup cmd - easy first implementation */ 349/** This is the Setup cmd - easy first implementation */
315void 350void
316SetUp (char *buf, int len, client_socket * ns) 351SetUp (char *buf, int len, client * ns)
317{ 352{
318 int s, slen; 353 int s, slen;
319 char *cmd, *param, cmdback[HUGE_BUF]; 354 char *cmd, *param, cmdback[HUGE_BUF];
320 355
321 /* run through the cmds of setup 356 /* run through the cmds of setup
… …
363 { 398 {
364 ns->sound = atoi (param); 399 ns->sound = atoi (param);
365 safe_strcat (cmdback, param, &slen, HUGE_BUF); 400 safe_strcat (cmdback, param, &slen, HUGE_BUF);
366 } 401 }
367 else if (!strcmp (cmd, "exp64")) 402 else if (!strcmp (cmd, "exp64"))
368 {
369 ns->exp64 = atoi (param);
370 safe_strcat (cmdback, param, &slen, HUGE_BUF); 403 safe_strcat (cmdback, param, &slen, HUGE_BUF);
371 }
372 else if (!strcmp (cmd, "spellmon")) 404 else if (!strcmp (cmd, "spellmon"))
373 { 405 {
374 ns->monitor_spells = atoi (param); 406 ns->monitor_spells = atoi (param);
375 safe_strcat (cmdback, param, &slen, HUGE_BUF); 407 safe_strcat (cmdback, param, &slen, HUGE_BUF);
376 } 408 }
… …
399 } 431 }
400 else if (!strcmp (cmd, "newmapcmd")) 432 else if (!strcmp (cmd, "newmapcmd"))
401 { 433 {
402 ns->newmapcmd = atoi (param); 434 ns->newmapcmd = atoi (param);
403 safe_strcat (cmdback, param, &slen, HUGE_BUF); 435 safe_strcat (cmdback, param, &slen, HUGE_BUF);
404// } else if (!strcmp(cmd,"plugincmd")) {
405// ns->plugincmd = atoi(param);
406// safe_strcat(cmdback, param, &slen, HUGE_BUF);
407 } 436 }
408 else if (!strcmp (cmd, "mapinfocmd")) 437 else if (!strcmp (cmd, "mapinfocmd"))
409 { 438 {
410 ns->mapinfocmd = atoi (param); 439 ns->mapinfocmd = atoi (param);
411 safe_strcat (cmdback, "1", &slen, HUGE_BUF); 440 safe_strcat (cmdback, "1", &slen, HUGE_BUF);
… …
467 if (*cp == 'x' || *cp == 'X') 496 if (*cp == 'x' || *cp == 'X')
468 { 497 {
469 y = atoi (cp + 1); 498 y = atoi (cp + 1);
470 break; 499 break;
471 } 500 }
501
472 if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y) 502 if (x < 9 || y < 9 || x > MAP_CLIENT_X || y > MAP_CLIENT_Y)
473 { 503 {
474 sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y); 504 sprintf (tmpbuf, " %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y);
475 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF); 505 safe_strcat (cmdback, tmpbuf, &slen, HUGE_BUF);
476 } 506 }
… …
531 * This is what takes care of it. We tell the client how things worked out. 561 * This is what takes care of it. We tell the client how things worked out.
532 * I am not sure if this file is the best place for this function. however, 562 * I am not sure if this file is the best place for this function. however,
533 * it either has to be here or init_sockets needs to be exported. 563 * it either has to be here or init_sockets needs to be exported.
534 */ 564 */
535void 565void
536AddMeCmd (char *buf, int len, client_socket * ns) 566AddMeCmd (char *buf, int len, client * ns)
537{ 567{
538 Settings oldsettings; 568 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
539
540 oldsettings = settings;
541 if (ns->status != Ns_Add || add_player (ns))
542 ns->send_packet ("addme_failed");
543 else
544 ns->send_packet ("addme_success");
545
546 settings = oldsettings;
547} 569}
548 570
549/** Reply to ExtendedInfos command */ 571/** Reply to ExtendedInfos command */
550void 572void
551ToggleExtendedInfos (char *buf, int len, client_socket * ns) 573ToggleExtendedInfos (char *buf, int len, client * ns)
552{ 574{
553 char cmdback[MAX_BUF]; 575 char cmdback[MAX_BUF];
554 char command[50]; 576 char command[50];
555 int info, nextinfo; 577 int info, nextinfo;
556 578
… …
607#define MSG_TYPE_MONUMENT 5 629#define MSG_TYPE_MONUMENT 5
608#define MSG_TYPE_SCRIPTED_DIALOG 6*/ 630#define MSG_TYPE_SCRIPTED_DIALOG 6*/
609 631
610/** Reply to ExtendedInfos command */ 632/** Reply to ExtendedInfos command */
611void 633void
612ToggleExtendedText (char *buf, int len, client_socket * ns) 634ToggleExtendedText (char *buf, int len, client * ns)
613{ 635{
614 char cmdback[MAX_BUF]; 636 char cmdback[MAX_BUF];
615 char temp[10]; 637 char temp[10];
616 char command[50]; 638 char command[50];
617 int info, nextinfo, i, flag; 639 int info, nextinfo, i, flag;
… …
668 * a piece of data from us that we know the client wants. So 690 * a piece of data from us that we know the client wants. So
669 * if we know the client wants it, might as well push it to the 691 * if we know the client wants it, might as well push it to the
670 * client. 692 * client.
671 */ 693 */
672static void 694static void
673SendSmooth (client_socket * ns, uint16 face) 695SendSmooth (client *ns, uint16 face)
674{ 696{
675 uint16 smoothface; 697 uint16 smoothface;
676 698
677 /* If we can't find a face, return and set it so we won't try to send this 699 /* If we can't find a face, return and set it so we won't try to send this
678 * again. 700 * again.
679 */ 701 */
680 if ((!FindSmooth (face, &smoothface)) && (!FindSmooth (smooth_face->number, &smoothface))) 702 if (!FindSmooth (face, &smoothface))
681 { 703 {
682 704
683 LOG (llevError, "could not findsmooth for %d. Neither default (%s)\n", face, &smooth_face->name); 705 LOG (llevError, "could not findsmooth for %d.\n", face);
684 ns->faces_sent[face] |= NS_FACESENT_SMOOTH; 706 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
685 return; 707 return;
686 } 708 }
687 709
688 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) 710 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
689 esrv_send_face (ns, smoothface, 0); 711 esrv_send_face (ns, smoothface, 0);
690 712
691 ns->faces_sent[face] |= NS_FACESENT_SMOOTH; 713 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
692 714
693 packet sl; 715 packet sl ("smooth");
694 716
695 sl << "smooth "
696 << uint16 (face) 717 sl << uint16 (face)
697 << uint16 (smoothface); 718 << uint16 (smoothface);
698 719
699 ns->send_packet (sl); 720 ns->send_packet (sl);
700} 721}
701 722
702 /** 723/**
703 * Tells client the picture it has to use 724 * Tells client the picture it has to use
704 * to smooth a picture number given as argument. 725 * to smooth a picture number given as argument.
705 */ 726 */
706void 727void
707AskSmooth (char *buf, int len, client_socket * ns) 728AskSmooth (char *buf, int len, client *ns)
708{ 729{
709 uint16 facenbr; 730 SendSmooth (ns, atoi (buf));
710
711 facenbr = atoi (buf);
712 SendSmooth (ns, facenbr);
713} 731}
714 732
715/** 733/**
716 * This handles the general commands from the client (ie, north, fire, cast, 734 * This handles the general commands from the client (ie, north, fire, cast,
717 * etc.) 735 * etc.)
718 */ 736 */
719void 737void
720PlayerCmd (char *buf, int len, player *pl) 738PlayerCmd (char *buf, int len, player *pl)
721{ 739{
722
723 /* The following should never happen with a proper or honest client.
724 * Therefore, the error message doesn't have to be too clear - if
725 * someone is playing with a hacked/non working client, this gives them
726 * an idea of the problem, but they deserve what they get
727 */
728 if (pl->state != ST_PLAYING)
729 {
730 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
731 return;
732 }
733 /* Check if there is a count. In theory, a zero count could also be 740 /* Check if there is a count. In theory, a zero count could also be
734 * sent, so check for that also. 741 * sent, so check for that also.
735 */ 742 */
736 if (atoi (buf) || buf[0] == '0') 743 if (atoi (buf) || buf[0] == '0')
737 { 744 {
738 pl->count = atoi ((char *) buf); 745 pl->count = atoi ((char *) buf);
746
739 buf = strchr (buf, ' '); /* advance beyond the numbers */ 747 buf = strchr (buf, ' '); /* advance beyond the numbers */
740 if (!buf) 748 if (!buf)
741 {
742#ifdef ESRV_DEBUG
743 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
744#endif
745 return; 749 return;
746 } 750
747 buf++; 751 buf++;
748 } 752 }
749 /* This should not happen anymore. */ 753
750 if (pl->ob->speed_left < -1.0)
751 {
752 LOG (llevError, "Player has negative time - shouldn't do command.\n");
753 }
754 /* In c_new.c */
755 execute_newserver_command (pl->ob, (char *) buf); 754 execute_newserver_command (pl->ob, (char *) buf);
755
756 /* Perhaps something better should be done with a left over count. 756 /* Perhaps something better should be done with a left over count.
757 * Cleaning up the input should probably be done first - all actions 757 * Cleaning up the input should probably be done first - all actions
758 * for the command that issued the count should be done before any other 758 * for the command that issued the count should be done before any other
759 * commands. 759 * commands.
760 */ 760 */
761
762 pl->count = 0; 761 pl->count = 0;
763
764} 762}
765 763
766 764
767/** 765/**
768 * This handles the general commands from the client (ie, north, fire, cast, 766 * This handles the general commands from the client (ie, north, fire, cast,
769 * etc.). It is a lot like PlayerCmd above, but is called with the 767 * etc.). It is a lot like PlayerCmd above, but is called with the
770 * 'ncom' method which gives more information back to the client so it 768 * 'ncom' method which gives more information back to the client so it
771 * can throttle. 769 * can throttle.
772 */ 770 */
773void 771void
774NewPlayerCmd (uint8 * buf, int len, player *pl) 772NewPlayerCmd (char *buf, int len, player *pl)
775{ 773{
776 int time, repeat;
777 char command[MAX_BUF];
778 int pktlen;
779
780 if (len < 7) 774 if (len <= 6)
781 { 775 {
782 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 776 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
783 return; 777 return;
784 } 778 }
785 779
786 pktlen = net_uint16 (buf); 780 uint16 cmdid = net_uint16 ((uint8 *)buf);
787 repeat = net_uint32 (buf + 2); 781 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
788 782
789 /* -1 is special - no repeat, but don't update */ 783 /* -1 is special - no repeat, but don't update */
790 if (repeat != -1) 784 if (repeat != -1)
791 pl->count = repeat; 785 pl->count = repeat;
792 786
793 if ((len - 4) >= MAX_BUF) 787 buf += 6; //len -= 6;
794 len = MAX_BUF - 5;
795 788
796 strncpy ((char *) command, (char *) buf + 6, len - 4);
797 command[len - 4] = '\0';
798
799 /* The following should never happen with a proper or honest client.
800 * Therefore, the error message doesn't have to be too clear - if
801 * someone is playing with a hacked/non working client, this gives them
802 * an idea of the problem, but they deserve what they get
803 */
804 if (pl->state != ST_PLAYING)
805 {
806 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
807 return;
808 }
809
810 /* This should not happen anymore. */
811 if (pl->ob->speed_left < -1.0)
812 LOG (llevError, "Player has negative time - shouldn't do command.\n");
813
814 /* In c_new.c */
815 execute_newserver_command (pl->ob, (char *) command); 789 execute_newserver_command (pl->ob, buf);
790
816 /* Perhaps something better should be done with a left over count. 791 /* Perhaps something better should be done with a left over count.
817 * Cleaning up the input should probably be done first - all actions 792 * Cleaning up the input should probably be done first - all actions
818 * for the command that issued the count should be done before any other 793 * for the command that issued the count should be done before any other
819 * commands. 794 * commands.
820 */ 795 */
821 pl->count = 0; 796 pl->count = 0;
822 797
823 if (FABS (pl->ob->speed) < 0.001) 798 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
799 int time = fabs (pl->ob->speed) < 0.001
824 time = MAX_TIME * 100; 800 ? time = MAX_TIME * 100
825 else
826 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 801 : time = (int) (MAX_TIME / fabs (pl->ob->speed));
827 802
828 /* Send confirmation of command execution now */ 803 /* Send confirmation of command execution now */
829 804 packet sl ("comc");
830 packet sl;
831 sl << "comc " << uint16 (pktlen) << uint32 (time); 805 sl << uint16 (cmdid) << uint32 (time);
832 pl->socket->send_packet (sl); 806 pl->ns->send_packet (sl);
833} 807}
834
835 808
836/** This is a reply to a previous query. */ 809/** This is a reply to a previous query. */
837void 810void
838ReplyCmd (char *buf, int len, player *pl) 811ReplyCmd (char *buf, int len, client *ns)
839{ 812{
813 if (ns->state == ST_CUSTOM)
814 {
815 INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len));
816 return;
817 }
818
819 if (!ns->pl)
820 return; //TODO: depends on the exact reply we are after
821 //TODO: but right now, we always have a ns->pl
822
823 player *pl = ns->pl;
824
840 /* This is to synthesize how the data would be stored if it 825 /* This is to synthesize how the data would be stored if it
841 * was normally entered. A bit of a hack, and should be cleaned up 826 * was normally entered. A bit of a hack, and should be cleaned up
842 * once all the X11 code is removed from the server. 827 * once all the X11 code is removed from the server.
843 * 828 *
844 * We pass 13 to many of the functions because this way they 829 * We pass 13 to many of the functions because this way they
845 * think it was the carriage return that was entered, and the 830 * think it was the carriage return that was entered, and the
846 * function then does not try to do additional input. 831 * function then does not try to do additional input.
847 */ 832 */
848 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); 833 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
849 834
850 /* this avoids any hacking here */ 835 /* this avoids any hacking here */
851 836
852 switch (pl->state) 837 switch (ns->state)
853 { 838 {
854 case ST_PLAYING: 839 case ST_PLAYING:
855 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 840 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
856 break; 841 break;
857 842
858 case ST_PLAY_AGAIN:
859 /* We can check this for return value (2==quit). Maybe we
860 * should, and do something appropriate?
861 */
862 receive_play_again (pl->ob, buf[0]);
863 break;
864
865 case ST_ROLL_STAT:
866 key_roll_stat (pl->ob, buf[0]);
867 break;
868
869 case ST_CHANGE_CLASS: 843 case ST_CHANGE_CLASS:
870
871 key_change_class (pl->ob, buf[0]); 844 key_change_class (pl->ob, buf[0]);
872 break; 845 break;
873 846
874 case ST_CONFIRM_QUIT:
875 key_confirm_quit (pl->ob, buf[0]);
876 break;
877
878 case ST_CONFIGURE:
879 LOG (llevError, "In client input handling, but into configure state\n");
880 pl->state = ST_PLAYING;
881 break;
882
883 case ST_GET_NAME:
884 receive_player_name (pl->ob, 13);
885 break;
886
887 case ST_GET_PASSWORD:
888 case ST_CONFIRM_PASSWORD:
889 receive_player_password (pl->ob, 13);
890 break;
891
892 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 847 case ST_GET_PARTY_PASSWORD: /* Get password for party */
893 receive_party_password (pl->ob, 13); 848 receive_party_password (pl->ob, 13);
894 break; 849 break;
895 850
896 default: 851 default:
897 LOG (llevError, "Unknown input state: %d\n", pl->state); 852 LOG (llevError, "Unknown input state: %d\n", ns->state);
898 } 853 }
899} 854}
900 855
901/** 856/**
902 * Client tells its version. If there is a mismatch, we close the 857 * Client tells its version. If there is a mismatch, we close the
… …
904 * something older than the server. If we assume the client will be 859 * something older than the server. If we assume the client will be
905 * backwards compatible, having it be a later version should not be a 860 * backwards compatible, having it be a later version should not be a
906 * problem. 861 * problem.
907 */ 862 */
908void 863void
909VersionCmd (char *buf, int len, client_socket * ns) 864VersionCmd (char *buf, int len, client * ns)
910{ 865{
911 char *cp;
912 char version_warning[256];
913
914 if (!buf) 866 if (!buf)
915 { 867 {
916 LOG (llevError, "CS: received corrupted version command\n"); 868 LOG (llevError, "CS: received corrupted version command\n");
917 return; 869 return;
918 } 870 }
919 871
920 ns->cs_version = atoi (buf); 872 ns->cs_version = atoi (buf);
921 ns->sc_version = ns->cs_version; 873 ns->sc_version = ns->cs_version;
874
875 LOG (llevDebug, "connection from client <%s>\n", buf);
876
877 //TODO: should log here just for statistics
878
922 if (VERSION_CS != ns->cs_version) 879 //if (VERSION_CS != ns->cs_version)
923 { 880 // unchecked;
924#ifdef ESRV_DEBUG 881
925 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
926#endif
927 }
928 cp = strchr (buf + 1, ' '); 882 char *cp = strchr (buf + 1, ' ');
929 if (!cp) 883 if (!cp)
930 return; 884 return;
885
931 ns->sc_version = atoi (cp); 886 ns->sc_version = atoi (cp);
887
932 if (VERSION_SC != ns->sc_version) 888 //if (VERSION_SC != ns->sc_version)
933 { 889 // unchecked;
934#ifdef ESRV_DEBUG 890
935 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
936#endif
937 }
938 cp = strchr (cp + 1, ' '); 891 cp = strchr (cp + 1, ' ');
892
939 if (cp) 893 if (cp)
940 { 894 {
941 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 895 assign (ns->version, cp + 1);
942 896
943 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1);
944
945 /* This is first implementation - i skip all beta DX clients with it
946 * Add later stuff here for other clients
947 */
948
949 /* these are old dxclients */
950 /* Version 1024 added support for singular + plural name values -
951 * requiing this minimal value reduces complexity of that code, and it
952 * has been around for a long time.
953 */
954 if (ns->sc_version < 1026) 897 if (ns->sc_version < 1026)
955 { 898 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
956 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
957 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 899 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
958 ns->send_packet (version_warning);
959 }
960
961 } 900 }
962} 901}
963 902
964/** sound related functions. */ 903/** sound related functions. */
965
966void 904void
967SetSound (char *buf, int len, client_socket * ns) 905SetSound (char *buf, int len, client * ns)
968{ 906{
969 ns->sound = atoi (buf); 907 ns->sound = atoi (buf);
970} 908}
971 909
972/** client wants the map resent */ 910/** client wants the map resent */
973
974void 911void
975MapRedrawCmd (char *buf, int len, player *pl) 912MapRedrawCmd (char *buf, int len, player *pl)
976{ 913{
977
978/* This function is currently disabled; just clearing the map state results in 914/* This function is currently disabled; just clearing the map state results in
979 * display errors. It should clear the cache and send a newmap command. 915 * display errors. It should clear the cache and send a newmap command.
980 * Unfortunately this solution does not work because some client versions send 916 * Unfortunately this solution does not work because some client versions send
981 * a mapredraw command after receiving a newmap command. 917 * a mapredraw command after receiving a newmap command.
982 */ 918 */
983#if 0
984 /* Okay, this is MAJOR UGLY. but the only way I know how to
985 * clear the "cache"
986 */
987 memset (&pl->socket->lastmap, 0, sizeof (struct Map));
988 draw_client_map (pl->ob);
989#endif
990} 919}
991 920
992/** 921/**
993 * Moves an object (typically, container to inventory). 922 * Moves an object (typically, container to inventory).
994 * syntax is: move (to) (tag) (nrof) 923 * syntax is: move (to) (tag) (nrof)
… …
997MoveCmd (char *buf, int len, player *pl) 926MoveCmd (char *buf, int len, player *pl)
998{ 927{
999 int vals[3], i; 928 int vals[3], i;
1000 929
1001 /* A little funky here. We only cycle for 2 records, because 930 /* A little funky here. We only cycle for 2 records, because
1002 * we obviously am not going to find a space after the third 931 * we obviously are not going to find a space after the third
1003 * record. Perhaps we should just replace this with a 932 * record. Perhaps we should just replace this with a
1004 * sscanf? 933 * sscanf?
1005 */ 934 */
1006 for (i = 0; i < 2; i++) 935 for (i = 0; i < 2; i++)
1007 { 936 {
1008 vals[i] = atoi (buf); 937 vals[i] = atoi (buf);
938
1009 if (!(buf = strchr (buf, ' '))) 939 if (!(buf = strchr (buf, ' ')))
1010 { 940 {
1011 LOG (llevError, "Incomplete move command: %s\n", buf); 941 LOG (llevError, "Incomplete move command: %s\n", buf);
1012 return; 942 return;
1013 } 943 }
944
1014 buf++; 945 buf++;
1015 } 946 }
947
1016 vals[2] = atoi (buf); 948 vals[2] = atoi (buf);
1017 949
1018/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 950/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1019 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 951 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1020} 952}
1021
1022
1023 953
1024/****************************************************************************** 954/******************************************************************************
1025 * 955 *
1026 * Start of commands the server sends to the client. 956 * Start of commands the server sends to the client.
1027 * 957 *
… …
1030/** 960/**
1031 * Asks the client to query the user. This way, the client knows 961 * Asks the client to query the user. This way, the client knows
1032 * it needs to send something back (vs just printing out a message) 962 * it needs to send something back (vs just printing out a message)
1033 */ 963 */
1034void 964void
1035send_query (client_socket * ns, uint8 flags, char *text) 965send_query (client *ns, uint8 flags, char *text)
1036{ 966{
1037 char buf[MAX_BUF];
1038
1039 sprintf (buf, "query %d %s", flags, text ? text : ""); 967 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1040 ns->send_packet (buf);
1041} 968}
1042 969
1043#define AddIfInt64(Old,New,Type) if (Old != New) {\ 970#define AddIfInt64(Old,New,Type) if (Old != New) {\
1044 Old = New; \ 971 Old = New; \
1045 sl << uint8 (Type) << uint64 (New); \ 972 sl << uint8 (Type) << uint64 (New); \
… …
1075esrv_update_stats (player *pl) 1002esrv_update_stats (player *pl)
1076{ 1003{
1077 char buf[MAX_BUF]; 1004 char buf[MAX_BUF];
1078 uint16 flags; 1005 uint16 flags;
1079 1006
1080 packet sl; 1007 client *ns = pl->ns;
1081 sl << "stats "; 1008 if (!ns)
1009 return;
1082 1010
1083 if (pl->ob != NULL) 1011 object *ob = pl->ob;
1084 { 1012 if (!ob)
1013 return;
1014
1015 packet sl ("stats");
1016
1085 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1017 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1086 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1018 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
1087 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1019 AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP);
1088 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1020 AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP);
1089 AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); 1021 AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE);
1090 AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); 1022 AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE);
1091 AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); 1023 AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR);
1092 AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);
1093 AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);
1094 AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);
1095 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 1024 AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX);
1096 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1025 AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON);
1026 AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
1027 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
1028 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
1097 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1029 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1098 }
1099 1030
1100 if (pl->socket->exp64)
1101 {
1102 uint8 s;
1103
1104 for (s = 0; s < NUM_SKILLS; s++) 1031 for (int s = 0; s < NUM_SKILLS; s++)
1105 { 1032 if (object *skill = pl->last_skill_ob[s])
1106 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 1033 if (skill->stats.exp != ns->last_skill_exp [s])
1107 { 1034 {
1035 ns->last_skill_exp [s] = skill->stats.exp;
1036
1108 /* Always send along the level if exp changes. This is only 1037 /* Always send along the level if exp changes. This is only
1109 * 1 extra byte, but keeps processing simpler. 1038 * 1 extra byte, but keeps processing simpler.
1110 */ 1039 */
1111 sl << uint8 (s + CS_STAT_SKILLINFO) 1040 sl << uint8 (s + CS_STAT_SKILLINFO)
1112 << uint8 (pl->last_skill_ob[s]->level) 1041 << uint8 (skill->level)
1113 << uint64 (pl->last_skill_ob[s]->stats.exp); 1042 << uint64 (skill->stats.exp);
1114
1115 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1116 } 1043 }
1117 }
1118 }
1119 1044
1120 if (pl->socket->exp64)
1121 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1045 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1122 else
1123 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1124
1125 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1046 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1126 AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); 1047 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1127 AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); 1048 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1128 AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); 1049 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1129 AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED); 1050 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);
1130 AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD); 1051 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1131 AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); 1052 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);
1132 AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM); 1053 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
1054
1133 flags = 0; 1055 flags = 0;
1134 1056
1135 if (pl->fire_on) 1057 if (pl->fire_on)
1136 flags |= SF_FIREON; 1058 flags |= SF_FIREON;
1137 1059
1138 if (pl->run_on) 1060 if (pl->run_on)
1139 flags |= SF_RUNON; 1061 flags |= SF_RUNON;
1140 1062
1141 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1063 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1142 1064
1143 if (pl->socket->sc_version < 1025) 1065 if (ns->sc_version < 1025)
1144 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1066 { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1145 else 1067 else
1146 {
1147 int i;
1148
1149 for (i = 0; i < NROFATTACKS; i++) 1068 for (int i = 0; i < NROFATTACKS; i++)
1150 { 1069 {
1151 /* Skip ones we won't send */ 1070 /* Skip ones we won't send */
1152 if (atnr_cs_stat[i] == -1) 1071 if (atnr_cs_stat[i] == -1)
1153 continue; 1072 continue;
1154 1073
1155 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1074 AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
1156 } 1075 }
1157 }
1158 1076
1159 if (pl->socket->monitor_spells) 1077 if (pl->ns->monitor_spells)
1160 { 1078 {
1161 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1079 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1162 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1080 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1163 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 1081 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1164 } 1082 }
1165 1083
1166 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 1084 rangetostring (ob, buf); /* we want use the new fire & run system in new client */
1167 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE); 1085 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1168 set_title (pl->ob, buf); 1086 set_title (ob, buf);
1169 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE); 1087 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1170 1088
1171 /* Only send it away if we have some actual data */ 1089 /* Only send it away if we have some actual data */
1172 if (sl.length () > 6) 1090 if (sl.length () > 6)
1173 pl->socket->send_packet (sl); 1091 ns->send_packet (sl);
1174} 1092}
1175 1093
1176/** 1094/**
1177 * Tells the client that here is a player it should start using. 1095 * Tells the client that here is a player it should start using.
1178 */ 1096 */
1179void 1097void
1180esrv_new_player (player *pl, uint32 weight) 1098esrv_new_player (player *pl, uint32 weight)
1181{ 1099{
1182 pl->last_weight = weight; 1100 packet sl ("player");
1183
1184 packet sl;
1185 sl << "player ";
1186 1101
1187 sl << uint32 (pl->ob->count) 1102 sl << uint32 (pl->ob->count)
1188 << uint32 (weight) 1103 << uint32 (weight)
1189 << uint32 (pl->ob->face->number) 1104 << uint32 (pl->ob->face)
1190 << data8 (pl->ob->name); 1105 << data8 (pl->ob->name);
1191 1106
1107 pl->ns->last_weight = weight;
1192 pl->socket->send_packet (sl); 1108 pl->ns->send_packet (sl);
1193 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1109 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1194} 1110}
1195 1111
1196/** 1112/**
1197 * Need to send an animation sequence to the client. 1113 * Need to send an animation sequence to the client.
… …
1199 * sent them the face yet (this can become quite costly in terms of 1115 * sent them the face yet (this can become quite costly in terms of
1200 * how much we are sending - on the other hand, this should only happen 1116 * how much we are sending - on the other hand, this should only happen
1201 * when the player logs in and picks stuff up. 1117 * when the player logs in and picks stuff up.
1202 */ 1118 */
1203void 1119void
1204esrv_send_animation (client_socket * ns, short anim_num) 1120esrv_send_animation (client * ns, short anim_num)
1205{ 1121{
1206 int i;
1207
1208 /* Do some checking on the anim_num we got. Note that the animations 1122 /* Do some checking on the anim_num we got. Note that the animations
1209 * are added in contigous order, so if the number is in the valid 1123 * are added in contigous order, so if the number is in the valid
1210 * range, it must be a valid animation. 1124 * range, it must be a valid animation.
1211 */ 1125 */
1212 if (anim_num < 0 || anim_num > num_animations) 1126 if (anim_num < 0 || anim_num > num_animations)
1213 { 1127 {
1214 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); 1128 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1215 return; 1129 return;
1216 } 1130 }
1217 1131
1218 packet sl; 1132 packet sl ("anim");
1219 1133
1220 sl << "anim "
1221 << uint16 (anim_num) 1134 sl << uint16 (anim_num)
1222 << uint16 (0); /* flags - not used right now */ 1135 << uint16 (0); /* flags - not used right now */
1223 1136
1224 /* Build up the list of faces. Also, send any information (ie, the 1137 /* Build up the list of faces. Also, send any information (ie, the
1225 * the face itself) down to the client. 1138 * the face itself) down to the client.
1226 */ 1139 */
1227 for (i = 0; i < animations[anim_num].num_animations; i++) 1140 for (int i = 0; i < animations[anim_num].num_animations; i++)
1228 { 1141 {
1229 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1142 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1230 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1143 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1144
1231 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 1145 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1232 } 1146 }
1233 1147
1234 ns->send_packet (sl); 1148 ns->send_packet (sl);
1235 1149
… …
1241 * 1155 *
1242 * Start of map related commands. 1156 * Start of map related commands.
1243 * 1157 *
1244 ******************************************************************************/ 1158 ******************************************************************************/
1245 1159
1246/**
1247 * This adds face_num to a map cell at x,y. If the client doesn't have
1248 * the face yet, we will also send it.
1249 */
1250static void
1251esrv_map_setbelow (client_socket * ns, int x, int y, short face_num, struct Map *newmap)
1252{
1253 if (newmap->cells[x][y].count >= MAP_LAYERS)
1254 {
1255 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1256 return;
1257 abort ();
1258 }
1259
1260 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1261 newmap->cells[x][y].count++;
1262
1263 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1264 esrv_send_face (ns, face_num, 0);
1265}
1266
1267struct LayerCell
1268{
1269 uint16 xy;
1270 short face;
1271};
1272
1273struct MapLayer
1274{
1275 int count;
1276 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1277};
1278
1279/** Checkes if map cells have changed */
1280static int
1281mapcellchanged (client_socket * ns, int i, int j, struct Map *newmap)
1282{
1283 int k;
1284
1285 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1286 return 1;
1287 for (k = 0; k < newmap->cells[i][j].count; k++)
1288 {
1289 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1290 {
1291 return 1;
1292 }
1293 }
1294 return 0;
1295}
1296
1297/**
1298 * Basically, what this does is pack the data into layers.
1299 * cnum is the client number, cur is the the buffer we put all of
1300 * this data into. we return the end of the data. layers is
1301 * how many layers of data we should back.
1302 */
1303static uint8 *
1304compactlayer (client_socket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1305{
1306 int x, y, k;
1307 int face;
1308 unsigned char *fcur;
1309 struct MapLayer layers[MAP_LAYERS];
1310
1311 for (k = 0; k < MAP_LAYERS; k++)
1312 layers[k].count = 0;
1313 fcur = cur;
1314 for (x = 0; x < ns->mapx; x++)
1315 {
1316 for (y = 0; y < ns->mapy; y++)
1317 {
1318 if (!mapcellchanged (ns, x, y, newmap))
1319 continue;
1320 if (newmap->cells[x][y].count == 0)
1321 {
1322 *cur = x * ns->mapy + y; /* mark empty space */
1323 cur++;
1324 continue;
1325 }
1326 for (k = 0; k < newmap->cells[x][y].count; k++)
1327 {
1328 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1329 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1330 layers[k].count++;
1331 }
1332 }
1333 }
1334 /* If no data, return now. */
1335 if (fcur == cur && layers[0].count == 0)
1336 return cur;
1337 *cur = 255; /* mark end of explicitly cleared cells */
1338 cur++;
1339 /* First pack by layers. */
1340 for (k = 0; k < numlayers; k++)
1341 {
1342 if (layers[k].count == 0)
1343 break; /* once a layer is entirely empty, no layer below it can
1344 have anything in it either */
1345 /* Pack by entries in thie layer */
1346 for (x = 0; x < layers[k].count;)
1347 {
1348 fcur = cur;
1349 *cur = layers[k].lcells[x].face >> 8;
1350 cur++;
1351 *cur = layers[k].lcells[x].face & 0xFF;
1352 cur++;
1353 face = layers[k].lcells[x].face;
1354 /* Now, we back the redundant data into 1 byte xy pairings */
1355 for (y = x; y < layers[k].count; y++)
1356 {
1357 if (layers[k].lcells[y].face == face)
1358 {
1359 *cur = (uint8) layers[k].lcells[y].xy;
1360 cur++;
1361 layers[k].lcells[y].face = -1;
1362 }
1363 }
1364 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1365 /* forward over the now redundant data */
1366 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1367 x++;
1368 }
1369 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1370 }
1371 return cur;
1372}
1373
1374/** Clears a map cell */ 1160/** Clears a map cell */
1375static void 1161static void
1376map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1162map_clearcell (struct MapCell *cell, int count)
1377{ 1163{
1378 cell->faces[0] = face0; 1164 cell->faces[0] = 0;
1379 cell->faces[1] = face1; 1165 cell->faces[1] = 0;
1380 cell->faces[2] = face2; 1166 cell->faces[2] = 0;
1381 cell->count = count; 1167 cell->count = count;
1382 cell->stat_hp = 0; 1168 cell->stat_hp = 0;
1383 cell->flags = 0; 1169 cell->flags = 0;
1384 cell->player = 0; 1170 cell->player = 0;
1385} 1171}
1386 1172
1387#define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y)
1388#define MAX_LAYERS 3 1173#define MAX_LAYERS 3
1389
1390/* Using a global really isn't a good approach, but saves the over head of
1391 * allocating and deallocating such a block of data each time run through,
1392 * and saves the space of allocating this in the socket object when we only
1393 * need it for this cycle. If the serve is ever threaded, this needs to be
1394 * re-examined.
1395 */
1396
1397static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1398
1399/**
1400 * Returns true if any of the heads for this
1401 * space is set. Returns false if all are blank - this is used
1402 * for empty space checking.
1403 */
1404static inline int
1405have_head (int ax, int ay)
1406{
1407
1408 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1409 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1410 return 1;
1411 return 0;
1412}
1413
1414/**
1415 * check_head is a bit simplistic version of update_space below.
1416 * basically, it only checks the that the head on space ax,ay at layer
1417 * needs to get sent - if so, it adds the data, sending the head
1418 * if needed, and returning 1. If this no data needs to get
1419 * sent, it returns zero.
1420 */
1421static int
1422check_head (packet &sl, client_socket &ns, int ax, int ay, int layer)
1423{
1424 short face_num;
1425
1426 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1427 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
1428 else
1429 face_num = 0;
1430
1431 if (face_num != ns.lastmap.cells[ax][ay].faces[layer])
1432 {
1433 sl << uint16 (face_num);
1434 if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE))
1435 esrv_send_face (&ns, face_num, 0);
1436
1437 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL;
1438 ns.lastmap.cells[ax][ay].faces[layer] = face_num;
1439 return 1;
1440 }
1441
1442 return 0; /* No change */
1443}
1444 1174
1445/** 1175/**
1446 * Removes the need to replicate the same code for each layer. 1176 * Removes the need to replicate the same code for each layer.
1447 * this returns true if this space is now in fact different than 1177 * this returns true if this space is now in fact different than
1448 * it was. 1178 * it was.
… …
1459 * numbers the spaces differently - I think this was a leftover from 1189 * numbers the spaces differently - I think this was a leftover from
1460 * the map command, where the faces stack up. Sinces that is no longer 1190 * the map command, where the faces stack up. Sinces that is no longer
1461 * the case, it seems to make more sense to have these layer values 1191 * the case, it seems to make more sense to have these layer values
1462 * actually match. 1192 * actually match.
1463 */ 1193 */
1464
1465static int 1194static int
1466update_space (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1195update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1467{ 1196{
1468 object *ob, *head;
1469 uint16 face_num; 1197 uint16 face_num;
1470 int bx, by, i; 1198 int bx, by, i;
1471 1199
1472 /* If there is a multipart object stored away, treat that as more important.
1473 * If not, then do the normal processing.
1474 */
1475 head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer];
1476
1477 /* Check to see if this head is part of the set of objects
1478 * we would normally send for this space. If so, then
1479 * don't use the head value. We need to do the check
1480 * here and not when setting up the heads[] value for two reasons -
1481 * 1) the heads[] values will get used even if the space is not visible.
1482 * 2) its possible the head is not on the same map as a part, and I'd
1483 * rather not need to do the map translation overhead.
1484 * 3) We need to do some extra checking to make sure that we will
1485 * otherwise send the image as this layer, eg, either it matches
1486 * the head value, or is not multipart.
1487 */
1488 if (head && !head->more)
1489 {
1490 for (i = 0; i < MAP_LAYERS; i++)
1491 {
1492 ob = GET_MAP_FACE_OBJ (mp, mx, my, i);
1493 if (!ob)
1494 continue;
1495
1496 if (ob->head)
1497 ob = ob->head;
1498
1499 if (ob == head)
1500 {
1501 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL;
1502 head = NULL;
1503 break;
1504 }
1505 }
1506 }
1507
1508 ob = head;
1509 if (!ob)
1510 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1200 object *ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1511 1201
1512 /* If there is no object for this space, or if the face for the object 1202 /* If there is no object for this space, or if the face for the object
1513 * is the blank face, set the face number to zero. 1203 * is the blank face, set the face number to zero.
1514 * else if we have the stored head object for this space, that takes 1204 * else if we have the stored head object for this space, that takes
1515 * precedence over the other object for this space. 1205 * precedence over the other object for this space.
1516 * otherwise, we do special head processing 1206 * otherwise, we do special head processing
1517 */ 1207 */
1518 if (!ob || ob->face == blank_face) 1208 if (!ob || ob->face == blank_face)
1519 face_num = 0; 1209 face_num = 0;
1520 else if (head)
1521 {
1522 /* if this is a head that had previously been stored */
1523 face_num = ob->face->number;
1524 }
1525 else 1210 else
1526 {
1527 /* if the faces for the different parts of a multipart object
1528 * are the same, we only want to send the bottom right most
1529 * portion of the object. That info is in the tail_.. values
1530 * of the head. Note that for the head itself, ob->head will
1531 * be null, so we only do this block if we are working on
1532 * a tail piece.
1533 */
1534
1535 /* tail_x and tail_y will only be set in the head object. If
1536 * this is the head object and these are set, we proceed
1537 * with logic to only send bottom right. Similarly, if
1538 * this is one of the more parts but the head has those values
1539 * set, we want to do the processing. There can be cases where
1540 * the head is not visible but one of its parts is, so we just
1541 * can always expect that ob->arch->tail_x will be true for all
1542 * object we may want to display.
1543 */
1544 if ((ob->arch->tail_x || ob->arch->tail_y) || (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y)))
1545 {
1546
1547 if (ob->head)
1548 head = ob->head;
1549 else
1550 head = ob;
1551
1552 /* Basically figure out where the offset is from where we are right
1553 * now. the ob->arch->clone.{x,y} values hold the offset that this current
1554 * piece is from the head, and the tail is where the tail is from the
1555 * head. Note that bx and by will equal sx and sy if we are already working
1556 * on the bottom right corner. If ob is the head, the clone values
1557 * will be zero, so the right thing will still happen.
1558 */
1559 bx = sx + head->arch->tail_x - ob->arch->clone.x;
1560 by = sy + head->arch->tail_y - ob->arch->clone.y;
1561
1562 /* I don't think this can ever happen, but better to check for it just
1563 * in case.
1564 */
1565 if (bx < sx || by < sy)
1566 {
1567 LOG (llevError, "update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", bx, by, sx, sy);
1568 face_num = 0;
1569 }
1570 /* single part object, multipart object with non merged faces,
1571 * of multipart object already at lower right.
1572 */
1573 else if (bx == sx && by == sy)
1574 {
1575 face_num = ob->face->number;
1576
1577 /* if this face matches one stored away, clear that one away.
1578 * this code relies on the fact that the map1 commands
1579 * goes from 2 down to 0.
1580 */
1581 for (i = 0; i < MAP_LAYERS; i++)
1582 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] &&
1583 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num)
1584 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL;
1585 }
1586 else
1587 {
1588 /* If this head is stored away, clear it - otherwise,
1589 * there can be cases where a object is on multiple layers -
1590 * we only want to send it once.
1591 */
1592 face_num = head->face->number;
1593 for (i = 0; i < MAP_LAYERS; i++)
1594 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] &&
1595 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num)
1596 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL;
1597
1598 /* First, try to put the new head on the same layer. If that is used up,
1599 * then find another layer.
1600 */
1601 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL)
1602 {
1603 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head;
1604 }
1605 else
1606 for (i = 0; i < MAX_LAYERS; i++)
1607 {
1608 if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL ||
1609 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head)
1610 {
1611 heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head;
1612 }
1613 }
1614 face_num = 0; /* Don't send this object - we'll send the head later */
1615 }
1616 }
1617 else
1618 {
1619 /* In this case, we are already at the lower right or single part object, 1211 /* In this case, we are already at the lower right or single part object,
1620 * so nothing special 1212 * so nothing special
1621 */
1622 face_num = ob->face->number;
1623
1624 /* clear out any head entries that have the same face as this one */
1625 for (bx = 0; bx < layer; bx++)
1626 if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] &&
1627 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num)
1628 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL;
1629 }
1630 } /* else not already head object or blank face */
1631
1632 /* This is a real hack. Basically, if we have nothing to send for this layer,
1633 * but there is a head on the next layer, send that instead.
1634 * Without this, what happens is you can get the case where the player stands
1635 * on the same space as the head. However, if you have overlapping big objects
1636 * of the same type, what happens then is it doesn't think it needs to send
1637 * This tends to make stacking also work/look better.
1638 */ 1213 */
1639 if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1])
1640 {
1641 face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1]->face->number;
1642 heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer - 1] = NULL;
1643 }
1644
1645 /* Another hack - because of heads and whatnot, this face may match one
1646 * we already sent for a lower layer. In that case, don't send
1647 * this one.
1648 */
1649 if (face_num && layer + 1 < MAP_LAYERS && ns.lastmap.cells[sx][sy].faces[layer + 1] == face_num)
1650 face_num = 0; 1214 face_num = ob->face;
1651 1215
1652 /* We've gotten what face we want to use for the object. Now see if 1216 /* We've gotten what face we want to use for the object. Now see if
1653 * if it has changed since we last sent it to the client. 1217 * if it has changed since we last sent it to the client.
1654 */ 1218 */
1655 if (ns.lastmap.cells[sx][sy].faces[layer] != face_num) 1219 if (ns.lastmap.cells[sx][sy].faces[layer] != face_num)
… …
1682 * holds the old values. 1246 * holds the old values.
1683 * layer is the layer to update, with 2 being the floor and 0 the 1247 * layer is the layer to update, with 2 being the floor and 0 the
1684 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ 1248 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1685 * take. 1249 * take.
1686 */ 1250 */
1687
1688static inline int 1251static inline int
1689update_smooth (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1252update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1690{ 1253{
1691 object *ob; 1254 object *ob;
1692 int smoothlevel; /* old face_num; */ 1255 int smoothlevel; /* old face_num; */
1693 1256
1694 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1257 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1695 1258
1696 /* If there is no object for this space, or if the face for the object 1259 /* If there is no object for this space, or if the face for the object
1697 * is the blank face, set the smoothlevel to zero. 1260 * is the blank face, set the smoothlevel to zero.
1698 */ 1261 */
1699 if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp)) 1262 if (!ob || ob->face == blank_face)
1700 smoothlevel = 0; 1263 smoothlevel = 0;
1701 else 1264 else
1702 { 1265 {
1703 smoothlevel = ob->smoothlevel; 1266 smoothlevel = ob->smoothlevel;
1704 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH)) 1267 if (smoothlevel && !(ns.faces_sent[ob->face] & NS_FACESENT_SMOOTH))
1705 SendSmooth (&ns, ob->face->number); 1268 SendSmooth (&ns, ob->face);
1706 } /* else not already head object or blank face */ 1269 } /* else not already head object or blank face */
1707 1270
1708 /* We've gotten what face we want to use for the object. Now see if 1271 /* We've gotten what face we want to use for the object. Now see if
1709 * if it has changed since we last sent it to the client. 1272 * if it has changed since we last sent it to the client.
1710 */ 1273 */
… …
1728 * Returns the size of a data for a map square as returned by 1291 * Returns the size of a data for a map square as returned by
1729 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1292 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1730 * available. 1293 * available.
1731 */ 1294 */
1732int 1295int
1733getExtendedMapInfoSize (client_socket * ns) 1296getExtendedMapInfoSize (client * ns)
1734{ 1297{
1735 int result = 0; 1298 int result = 0;
1736 1299
1737 if (ns->ext_mapinfos) 1300 if (ns->ext_mapinfos)
1738 { 1301 {
1739 if (ns->EMI_smooth) 1302 if (ns->EMI_smooth)
1740 result += 1; /*One byte for smoothlevel */ 1303 result += 1; /*One byte for smoothlevel */
1741 } 1304 }
1305
1742 return result; 1306 return result;
1307}
1308
1309// prefetch (and touch) all maps within a specific distancd
1310static void
1311prefetch_surrounding_maps (maptile *map, int distance)
1312{
1313 map->last_access = runtime;
1314
1315 if (--distance)
1316 for (int dir = 4; --dir; )
1317 if (const shstr &path = map->tile_path [dir])
1318 if (maptile *&neigh = map->tile_map [dir])
1319 prefetch_surrounding_maps (neigh, distance);
1320 else
1321 neigh = maptile::find_async (path, map);
1322}
1323
1324// prefetch a generous area around the player
1325static void
1326prefetch_surrounding_maps (object *op)
1327{
1328 prefetch_surrounding_maps (op->map, 3);
1743} 1329}
1744 1330
1745/** 1331/**
1746 * This function uses the new map1 protocol command to send the map 1332 * This function uses the new map1 protocol command to send the map
1747 * to the client. It is necessary because the old map command supports 1333 * to the client. It is necessary because the old map command supports
… …
1753 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off 1339 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1754 * maps no sense. Instead, we actually really only use 12 bits for coordinates, 1340 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1755 * and use the other 4 bits for other informatiion. For full documentation 1341 * and use the other 4 bits for other informatiion. For full documentation
1756 * of what we send, see the doc/Protocol file. 1342 * of what we send, see the doc/Protocol file.
1757 * I will describe internally what we do: 1343 * I will describe internally what we do:
1758 * the socket->lastmap shows how the map last looked when sent to the client. 1344 * the ns->lastmap shows how the map last looked when sent to the client.
1759 * in the lastmap structure, there is a cells array, which is set to the 1345 * in the lastmap structure, there is a cells array, which is set to the
1760 * maximum viewable size (As set in config.h). 1346 * maximum viewable size (As set in config.h).
1761 * in the cells, there are faces and a count value. 1347 * in the cells, there are faces and a count value.
1762 * we use the count value to hold the darkness value. If -1, then this space 1348 * we use the count value to hold the darkness value. If -1, then this space
1763 * is not viewable. 1349 * is not viewable.
… …
1765 * look like. 1351 * look like.
1766 */ 1352 */
1767void 1353void
1768draw_client_map1 (object *pl) 1354draw_client_map1 (object *pl)
1769{ 1355{
1770 int x, y, ax, ay, d, startlen, max_x, max_y, oldlen; 1356 int x, y, ax, ay, startlen, max_x, max_y, oldlen;
1771 sint16 nx, ny; 1357 sint16 nx, ny;
1772 int estartlen, eoldlen; 1358 int estartlen, eoldlen;
1773 uint16 mask, emask;
1774 uint8 eentrysize; 1359 uint8 eentrysize;
1775 uint16 ewhatstart, ewhatflag; 1360 uint16 ewhatstart, ewhatflag;
1776 uint8 extendedinfos; 1361 uint8 extendedinfos;
1777 maptile *m; 1362 maptile *m;
1778 1363
1779 client_socket &socket = *pl->contr->socket; 1364 client &socket = *pl->contr->ns;
1365
1366 if (!pl->active)
1367 return;
1780 1368
1781 check_map_change (pl->contr); 1369 check_map_change (pl->contr);
1370 prefetch_surrounding_maps (pl);
1782 1371
1783 packet sl; 1372 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1784 packet esl; 1373 packet esl;
1785 1374
1786 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1787 startlen = sl.length (); 1375 startlen = sl.length ();
1788 1376
1789 /*Extendedmapinfo structure initialisation */ 1377 /*Extendedmapinfo structure initialisation */
1790 if (socket.ext_mapinfos) 1378 if (socket.ext_mapinfos)
1791 { 1379 {
… …
1810 ewhatstart = 0; 1398 ewhatstart = 0;
1811 ewhatflag = 0; 1399 ewhatflag = 0;
1812 estartlen = 0; 1400 estartlen = 0;
1813 } 1401 }
1814 1402
1815 /* Init data to zero */
1816 memset (heads, 0, sizeof (object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS);
1817
1818 /* x,y are the real map locations. ax, ay are viewport relative 1403 /* x,y are the real map locations. ax, ay are viewport relative
1819 * locations. 1404 * locations.
1820 */ 1405 */
1821 ay = 0; 1406 ay = 0;
1822 1407
… …
1824 * but that started to get a bit messy to look at. 1409 * but that started to get a bit messy to look at.
1825 */ 1410 */
1826 max_x = pl->x + (socket.mapx + 1) / 2; 1411 max_x = pl->x + (socket.mapx + 1) / 2;
1827 max_y = pl->y + (socket.mapy + 1) / 2; 1412 max_y = pl->y + (socket.mapy + 1) / 2;
1828 1413
1829 if (socket.mapmode == Map1aCmd)
1830 {
1831 max_x += MAX_HEAD_OFFSET;
1832 max_y += MAX_HEAD_OFFSET;
1833 }
1834
1835 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) 1414 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1836 { 1415 {
1837 ax = 0; 1416 ax = 0;
1838 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1417 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1839 { 1418 {
1840 1419 int emask, mask;
1841 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1420 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1842 1421
1843 /* If this space is out of the normal viewable area, we only check
1844 * the heads value ax or ay will only be greater than what
1845 * the client wants if using the map1a command - this is because
1846 * if the map1a command is not used, max_x and max_y will be
1847 * set to lower values.
1848 */
1849 if (ax >= socket.mapx || ay >= socket.mapy)
1850 {
1851 int i, got_one;
1852
1853 oldlen = sl.length ();
1854
1855 sl << uint16 (mask);
1856
1857 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1858 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1859 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1860
1861 /* If all we are doing is sending 0 (blank) faces, we don't
1862 * actually need to send that - just the coordinates
1863 * with no faces tells the client to blank out the
1864 * space.
1865 */
1866 got_one = 0;
1867 for (i = oldlen + 2; i < sl.length (); i++)
1868 if (sl[i])
1869 got_one = 1;
1870
1871 if (got_one && (mask & 0xf))
1872 sl[oldlen + 1] = mask & 0xff;
1873 else
1874 { /*either all faces blank, either no face at all */
1875 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1876 sl.reset (oldlen + 2);
1877 else
1878 sl.reset (oldlen);
1879 }
1880
1881 /*What concerns extendinfos, nothing to be done for now
1882 * (perhaps effects layer later)
1883 */
1884 continue; /* don't do processing below */
1885 }
1886
1887 MapCell &lastcell = socket.lastmap.cells[ax][ay]; 1422 MapCell &lastcell = socket.lastmap.cells[ax][ay];
1888
1889 d = pl->contr->blocked_los[ax][ay];
1890 1423
1891 /* If the coordinates are not valid, or it is too dark to see, 1424 /* If the coordinates are not valid, or it is too dark to see,
1892 * we tell the client as such 1425 * we tell the client as such
1893 */ 1426 */
1894 nx = x; 1427 nx = x;
… …
1902 * of the map, it shouldn't have a head 1435 * of the map, it shouldn't have a head
1903 */ 1436 */
1904 if (lastcell.count != -1) 1437 if (lastcell.count != -1)
1905 { 1438 {
1906 sl << uint16 (mask); 1439 sl << uint16 (mask);
1907 map_clearcell (&lastcell, 0, 0, 0, -1); 1440 map_clearcell (&lastcell, -1);
1908 } 1441 }
1442
1443 continue;
1909 } 1444 }
1445
1446 m->touch ();
1447
1448 int d = pl->contr->blocked_los[ax][ay];
1449
1910 else if (d > 3) 1450 if (d > 3)
1911 { 1451 {
1452
1912 int need_send = 0, count; 1453 int need_send = 0, count;
1913 1454
1914 /* This block deals with spaces that are not visible for whatever 1455 /* This block deals with spaces that are not visible for whatever
1915 * reason. Still may need to send the head for this space. 1456 * reason. Still may need to send the head for this space.
1916 */ 1457 */
1917 1458
1918 oldlen = sl.length (); 1459 oldlen = sl.length ();
1919 1460
1920 sl << uint16 (mask); 1461 sl << uint16 (mask);
… …
1922 if (lastcell.count != -1) 1463 if (lastcell.count != -1)
1923 need_send = 1; 1464 need_send = 1;
1924 1465
1925 count = -1; 1466 count = -1;
1926 1467
1927 if (socket.mapmode == Map1aCmd && have_head (ax, ay))
1928 {
1929 /* Now check to see if any heads need to be sent */
1930
1931 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1932 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
1933 if (check_head (sl, socket, ax, ay, 0)) mask |= 0x1;
1934
1935 lastcell.count = count;
1936 }
1937 else
1938 {
1939 /* properly clear a previously sent big face */ 1468 /* properly clear a previously sent big face */
1940 if (lastcell.faces[0] != 0 || lastcell.faces[1] != 0 || lastcell.faces[2] != 0 1469 if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2]
1941 || lastcell.stat_hp || lastcell.flags || lastcell.player) 1470 || lastcell.stat_hp || lastcell.flags || lastcell.player)
1942 need_send = 1; 1471 need_send = 1;
1943 1472
1944 map_clearcell (&lastcell, 0, 0, 0, count); 1473 map_clearcell (&lastcell, count);
1945 }
1946 1474
1947 if ((mask & 0xf) || need_send) 1475 if ((mask & 0xf) || need_send)
1948 sl[oldlen + 1] = mask & 0xff; 1476 sl[oldlen + 1] = mask & 0xff;
1949 else 1477 else
1950 sl.reset (oldlen); 1478 sl.reset (oldlen);
1951 } 1479 }
1952 else 1480 else
1953 { 1481 {
1954 /* In this block, the space is visible or there are head objects 1482 /* In this block, the space is visible.
1955 * we need to send.
1956 */ 1483 */
1957 1484
1958 /* Rather than try to figure out what everything that we might 1485 /* Rather than try to figure out what everything that we might
1959 * need to send is, then form the packet after that, 1486 * need to send is, then form the packet after that,
1960 * we presume that we will in fact form a packet, and update 1487 * we presume that we will in fact form a packet, and update
… …
1963 * is done. 1490 * is done.
1964 * I think this is simpler than doing a bunch of checks to see 1491 * I think this is simpler than doing a bunch of checks to see
1965 * what if anything we need to send, setting the bits, then 1492 * what if anything we need to send, setting the bits, then
1966 * doing those checks again to add the real data. 1493 * doing those checks again to add the real data.
1967 */ 1494 */
1968 oldlen = sl.length (); 1495 oldlen = sl.length ();
1969 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1970 eoldlen = esl.length (); 1496 eoldlen = esl.length ();
1971 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1497
1972 sl << uint16 (mask); 1498 sl << uint16 (mask);
1973 1499
1974 if (socket.ext_mapinfos) 1500 if (socket.ext_mapinfos)
1975 esl << uint16 (emask); 1501 esl << uint16 (emask);
1976 1502
… …
2081 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1)) 1607 if (update_smooth (esl, socket, m, nx, ny, ax, ay, 1))
2082 emask |= 0x2; 1608 emask |= 0x2;
2083 1609
2084 if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1)) 1610 if (nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1))
2085 { 1611 {
2086 if (lastcell.faces[0] != pl->face->number) 1612 if (lastcell.faces[0] != pl->face)
2087 { 1613 {
2088 lastcell.faces[0] = pl->face->number; 1614 lastcell.faces[0] = pl->face;
2089 mask |= 0x1; 1615 mask |= 0x1;
2090 1616
2091 if (!(socket.faces_sent[pl->face->number] & NS_FACESENT_FACE)) 1617 if (!(socket.faces_sent[pl->face] & NS_FACESENT_FACE))
2092 esrv_send_face (&socket, pl->face->number, 0); 1618 esrv_send_face (&socket, pl->face, 0);
2093 1619
2094 sl << uint16 (pl->face->number); 1620 sl << uint16 (pl->face);
2095 } 1621 }
2096 } 1622 }
2097 else 1623 else
2098 { 1624 {
2099 /* Top face */ 1625 /* Top face */
… …
2129 if (!(sl.length () > startlen || socket.sent_scroll)) 1655 if (!(sl.length () > startlen || socket.sent_scroll))
2130 { 1656 {
2131 /* No map data will follow, so don't say the client 1657 /* No map data will follow, so don't say the client
2132 * it doesn't need draw! 1658 * it doesn't need draw!
2133 */ 1659 */
2134 ewhatflag &= (~EMI_NOREDRAW); 1660 ewhatflag &= ~EMI_NOREDRAW;
2135 esl[ewhatstart + 1] = ewhatflag & 0xff; 1661 esl[ewhatstart + 1] = ewhatflag & 0xff;
2136 } 1662 }
2137 1663
2138 if (esl.length () > estartlen) 1664 if (esl.length () > estartlen)
2139 socket.send_packet (esl); 1665 socket.send_packet (esl);
… …
2151 */ 1677 */
2152void 1678void
2153draw_client_map (object *pl) 1679draw_client_map (object *pl)
2154{ 1680{
2155 int i, j; 1681 int i, j;
2156 sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */ 1682 sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */
2157 New_Face *face, *floor;
2158 New_Face *floor2;
2159 int d, mflags; 1683 int mflags;
2160 struct Map newmap; 1684 struct Map newmap;
2161 maptile *m, *pm; 1685 maptile *m, *pm;
2162 1686
2163 if (pl->type != PLAYER) 1687 if (pl->type != PLAYER)
2164 { 1688 {
… …
2175 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 1699 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2176 return; 1700 return;
2177 1701
2178 memset (&newmap, 0, sizeof (struct Map)); 1702 memset (&newmap, 0, sizeof (struct Map));
2179 1703
2180 for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++) 1704 for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)
2181 {
2182 for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++) 1705 for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)
2183 { 1706 {
2184 ax = i; 1707 ax = i;
2185 ay = j; 1708 ay = j;
2186 m = pm; 1709 m = pm;
2187 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 1710 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
1711
2188 if (mflags & P_OUT_OF_MAP) 1712 if (mflags & P_OUT_OF_MAP)
2189 continue; 1713 continue;
2190 if (mflags & P_NEED_UPDATE) 1714
2191 update_position (m, ax, ay);
2192 /* If a map is visible to the player, we don't want to swap it out 1715 /* If a map is visible to the player, we don't want to swap it out
2193 * just to reload it. This should really call something like 1716 * just to reload it. This should really call something like
2194 * swap_map, but this is much more efficient and 'good enough' 1717 * swap_map, but this is much more efficient and 'good enough'
2195 */ 1718 */
2196 if (mflags & P_NEW_MAP) 1719 if (mflags & P_NEW_MAP)
2197 m->timeout = 50; 1720 m->timeout = 50;
2198 } 1721 }
2199 } 1722
2200 /* do LOS after calls to update_position */ 1723 /* do LOS after calls to update_position */
2201 if (pl->contr->do_los) 1724 if (pl->contr->do_los)
2202 { 1725 {
2203 update_los (pl); 1726 update_los (pl);
2204 pl->contr->do_los = 0; 1727 pl->contr->do_los = 0;
… …
2219 1742
2220/*****************************************************************************/ 1743/*****************************************************************************/
2221void 1744void
2222send_plugin_custom_message (object *pl, char *buf) 1745send_plugin_custom_message (object *pl, char *buf)
2223{ 1746{
2224 pl->contr->socket->send_packet (buf); 1747 pl->contr->ns->send_packet (buf);
2225} 1748}
2226 1749
2227/** 1750/**
2228 * This sends the skill number to name mapping. We ignore 1751 * This sends the skill number to name mapping. We ignore
2229 * the params - we always send the same info no matter what. 1752 * the params - we always send the same info no matter what.
2230 */ 1753 */
2231void 1754void
2232send_skill_info (client_socket *ns, char *params) 1755send_skill_info (client *ns, char *params)
2233{ 1756{
2234 packet sl; 1757 packet sl;
2235 sl << "replyinfo skill_info\n"; 1758 sl << "replyinfo skill_info\n";
2236 1759
2237 for (int i = 1; i < NUM_SKILLS; i++) 1760 for (int i = 1; i < NUM_SKILLS; i++)
… …
2249/** 1772/**
2250 * This sends the spell path to name mapping. We ignore 1773 * This sends the spell path to name mapping. We ignore
2251 * the params - we always send the same info no matter what. 1774 * the params - we always send the same info no matter what.
2252 */ 1775 */
2253void 1776void
2254send_spell_paths (client_socket * ns, char *params) 1777send_spell_paths (client * ns, char *params)
2255{ 1778{
2256 packet sl; 1779 packet sl;
2257 1780
2258 sl << "replyinfo spell_paths\n"; 1781 sl << "replyinfo spell_paths\n";
2259 1782
… …
2274 * it then sends an updspell packet for each spell that has changed in this way 1797 * it then sends an updspell packet for each spell that has changed in this way
2275 */ 1798 */
2276void 1799void
2277esrv_update_spells (player *pl) 1800esrv_update_spells (player *pl)
2278{ 1801{
1802 if (!pl->ns)
1803 return;
1804
2279 if (!pl->socket->monitor_spells) 1805 if (!pl->ns->monitor_spells)
2280 return; 1806 return;
2281 1807
2282 for (object *spell = pl->ob->inv; spell; spell = spell->below) 1808 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2283 { 1809 {
2284 if (spell->type == SPELL) 1810 if (spell->type == SPELL)
… …
2314 1840
2315 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 1841 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2316 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 1842 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2317 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 1843 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2318 1844
2319 pl->socket->send_packet (sl); 1845 pl->ns->send_packet (sl);
2320 } 1846 }
2321 } 1847 }
2322 } 1848 }
2323} 1849}
2324 1850
2325void 1851void
2326esrv_remove_spell (player *pl, object *spell) 1852esrv_remove_spell (player *pl, object *spell)
2327{ 1853{
2328 if (!pl->socket->monitor_spells) 1854 if (!pl->ns->monitor_spells)
2329 return; 1855 return;
2330 1856
2331 if (!pl || !spell || spell->env != pl->ob) 1857 if (!pl || !spell || spell->env != pl->ob)
2332 { 1858 {
2333 LOG (llevError, "Invalid call to esrv_remove_spell"); 1859 LOG (llevError, "Invalid call to esrv_remove_spell");
2334 return; 1860 return;
2335 } 1861 }
2336 1862
2337 packet sl; 1863 packet sl ("delspell");
2338 1864
2339 sl << "delspell "
2340 << uint32 (spell->count); 1865 sl << uint32 (spell->count);
2341 1866
2342 pl->socket->send_packet (sl); 1867 pl->ns->send_packet (sl);
2343} 1868}
2344 1869
2345/* appends the spell *spell to the Socklist we will send the data to. */ 1870/* appends the spell *spell to the Socklist we will send the data to. */
2346static void 1871static void
2347append_spell (player *pl, packet &sl, object *spell) 1872append_spell (player *pl, packet &sl, object *spell)
2348{ 1873{
2349 int len, i, skill = 0; 1874 int i, skill = 0;
2350 1875
2351 if (!(spell->name)) 1876 if (!(spell->name))
2352 { 1877 {
2353 LOG (llevError, "item number %d is a spell with no name.\n", spell->count); 1878 LOG (llevError, "item number %d is a spell with no name.\n", spell->count);
2354 return; 1879 return;
… …
2366 if (!strcmp (spell->skill, skill_names[i])) 1891 if (!strcmp (spell->skill, skill_names[i]))
2367 { 1892 {
2368 skill = i + CS_STAT_SKILLINFO; 1893 skill = i + CS_STAT_SKILLINFO;
2369 break; 1894 break;
2370 } 1895 }
1896 }
1897
1898 // spells better have a face
1899 if (!spell->face)
1900 {
1901 LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name);
1902 spell->face = face_find ("burnout.x11", blank_face);
2371 } 1903 }
2372 1904
2373 /* send the current values */ 1905 /* send the current values */
2374 sl << uint32 (spell->count) 1906 sl << uint32 (spell->count)
2375 << uint16 (spell->level) 1907 << uint16 (spell->level)
… …
2377 << uint16 (spell->last_sp) 1909 << uint16 (spell->last_sp)
2378 << uint16 (spell->last_grace) 1910 << uint16 (spell->last_grace)
2379 << uint16 (spell->last_eat) 1911 << uint16 (spell->last_eat)
2380 << uint8 (skill) 1912 << uint8 (skill)
2381 << uint32 (spell->path_attuned) 1913 << uint32 (spell->path_attuned)
2382 << uint32 (spell->face ? spell->face->number : 0) 1914 << uint32 (spell->face)
2383 << data8 (spell->name) 1915 << data8 (spell->name)
2384 << data16 (spell->msg); 1916 << data16 (spell->msg);
2385} 1917}
2386 1918
2387/** 1919/**
… …
2395 { 1927 {
2396 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); 1928 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2397 return; 1929 return;
2398 } 1930 }
2399 1931
2400 if (!pl->socket->monitor_spells) 1932 if (!pl->ns->monitor_spells)
2401 return; 1933 return;
2402 1934
2403 packet sl; 1935 packet sl ("addspell");
2404
2405 sl << "addspell ";
2406 1936
2407 if (!spell) 1937 if (!spell)
2408 { 1938 {
2409 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 1939 for (spell = pl->ob->inv; spell; spell = spell->below)
2410 { 1940 {
2411 /* were we to simply keep appending data here, we could exceed 1941 /* were we to simply keep appending data here, we could exceed
2412 * MAXSOCKBUF if the player has enough spells to add, we know that 1942 * MAXSOCKBUF if the player has enough spells to add, we know that
2413 * append_spells will always append 19 data bytes, plus 4 length 1943 * append_spells will always append 19 data bytes, plus 4 length
2414 * bytes and 3 strings (because that is the spec) so we need to 1944 * bytes and 3 strings (because that is the spec) so we need to
… …
2424 if (spell->type != SPELL) 1954 if (spell->type != SPELL)
2425 continue; 1955 continue;
2426 1956
2427 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 1957 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2428 { 1958 {
2429 pl->socket->send_packet (sl); 1959 pl->ns->send_packet (sl);
2430 1960
2431 sl.reset (); 1961 sl.reset ();
2432 sl << "addspell "; 1962 sl << "addspell ";
2433 } 1963 }
2434 1964
… …
2448 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 1978 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2449 fatal (0); 1979 fatal (0);
2450 } 1980 }
2451 1981
2452 /* finally, we can send the packet */ 1982 /* finally, we can send the packet */
2453 pl->socket->send_packet (sl); 1983 pl->ns->send_packet (sl);
2454} 1984}
2455 1985

Diff Legend

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