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.36 by root, Thu Dec 14 04:30:33 2006 UTC vs.
Revision 1.82 by root, Sun Mar 18 03:05:41 2007 UTC

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

Diff Legend

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