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

Diff Legend

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