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.40 by root, Fri Dec 15 04:21:29 2006 UTC vs.
Revision 1.82 by root, Sun Mar 18 03:05:41 2007 UTC

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

Diff Legend

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