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.33 by root, Thu Dec 14 01:21:58 2006 UTC vs.
Revision 1.71 by root, Mon Mar 12 01:13:10 2007 UTC

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

Diff Legend

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