ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/request.C
(Generate patch)

Comparing deliantra/server/socket/request.C (file contents):
Revision 1.33 by root, Thu Dec 14 01:21:58 2006 UTC vs.
Revision 1.66 by root, Thu Feb 15 04:04:23 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 *
… …
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 * 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 * if a face has not already been sent to the client, it is sent now.
42 * 43 *
43 * mapcellchanged, compactlayer, compactstack, perform the map compressing
44 * operations
45 *
46 * esrv_map_doneredraw finishes the map update, and ships across the
47 * map updates.
48 *
49 */ 44 */
50 45
51#include <global.h> 46#include <global.h>
52#include <sproto.h> 47#include <sproto.h>
53 48
54#include <newclient.h>
55#include <newserver.h>
56#include <living.h> 49#include <living.h>
57#include <commands.h> 50#include <commands.h>
58 51
59/* This block is basically taken from socket.c - I assume if it works there, 52/* This block is basically taken from socket.c - I assume if it works there,
60 * it should work here. 53 * it should work here.
… …
63#include <sys/time.h> 56#include <sys/time.h>
64#include <sys/socket.h> 57#include <sys/socket.h>
65#include <netinet/in.h> 58#include <netinet/in.h>
66#include <netdb.h> 59#include <netdb.h>
67 60
68#ifdef HAVE_UNISTD_H
69# include <unistd.h> 61#include <unistd.h>
70#endif
71
72#ifdef HAVE_SYS_TIME_H
73# include <sys/time.h> 62#include <sys/time.h>
74#endif
75 63
76#include "sounds.h" 64#include "sounds.h"
77 65
78/** 66/**
79 * This table translates the attack numbers as used within the 67 * This table translates the attack numbers as used within the
… …
96 -1, /* life stealing */ 84 -1, /* life stealing */
97 -1 /* Disease - not fully done yet */ 85 -1 /* Disease - not fully done yet */
98}; 86};
99 87
100static void 88static void
101socket_map_scroll (NewSocket * ns, int dx, int dy) 89socket_map_scroll (client *ns, int dx, int dy)
102{ 90{
103 struct Map newmap; 91 struct Map newmap;
104 int x, y, mx, my; 92 int x, y, mx, my;
105 93
106 {
107 packet sl;
108
109 sl.printf ("map_scroll %d %d", dx, dy); 94 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
110 ns->send_packet (sl);
111 }
112 95
113 /* If we are using the Map1aCmd, we may in fact send 96 /* If we are using the Map1aCmd, we may in fact send
114 * head information that is outside the viewable map. 97 * head information that is outside the viewable map.
115 * So set the mx,my to the max value we want to 98 * So set the mx,my to the max value we want to
116 * look for. Removed code to do so - it caused extra 99 * look for. Removed code to do so - it caused extra
… …
156} 139}
157 140
158static void 141static void
159clear_map (player *pl) 142clear_map (player *pl)
160{ 143{
161 NewSocket & socket = pl->socket;
162
163 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 144 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
164 145
165 if (socket.newmapcmd == 1) 146 if (pl->ns->newmapcmd == 1)
166 socket.send_packet ("newmap"); 147 pl->ns->send_packet ("newmap");
167 148
168 socket.update_look = 1; 149 pl->ns->floorbox_reset ();
169 socket.look_position = 0;
170} 150}
171 151
172/** check for map change and send new map data */ 152/** check for map/region change and send new map data */
173static void 153static void
174check_map_change (player *pl) 154check_map_change (player *pl)
175{ 155{
176 NewSocket & socket = pl->socket; 156 client &socket = *pl->ns;
177 object *ob = pl->ob; 157 object *ob = pl->ob;
178 char buf[MAX_BUF]; /* eauugggh */ 158 char buf[MAX_BUF]; /* eauugggh */
179 159
180 if (socket.current_map != ob->map) 160 if (socket.current_map != ob->map)
181 { 161 {
… …
197 flags |= 4; 177 flags |= 4;
198 if (ob->map->tile_path[3]) 178 if (ob->map->tile_path[3])
199 flags |= 8; 179 flags |= 8;
200 180
201 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", 181 snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s",
202 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, ob->map->path); 182 flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path);
203 } 183 }
204 else 184 else
205 snprintf (buf, MAX_BUF, "mapinfo current"); 185 snprintf (buf, MAX_BUF, "mapinfo current");
206 186
207 socket.send_packet (buf); 187 socket.send_packet (buf);
… …
215 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 195 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
216 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows 196 clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows
217 else 197 else
218 { 198 {
219 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); 199 socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y);
220 socket.update_look = 1; 200 socket.floorbox_reset ();
221 socket.look_position = 0;
222 } 201 }
223 } 202 }
224 203
225 socket.current_x = ob->x; 204 socket.current_x = ob->x;
226 socket.current_y = ob->y; 205 socket.current_y = ob->y;
206
207 region *reg = ob->region ();
208 if (socket.current_region != reg)
209 {
210 socket.current_region = reg;
211 socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", &reg->longname);
212 }
213}
214
215/**
216 * RequestInfo is sort of a meta command. There is some specific
217 * request of information, but we call other functions to provide
218 * that information.
219 */
220void
221RequestInfo (char *buf, int len, client * ns)
222{
223 char *params = NULL, *cp;
224
225 /* No match */
226 char bigbuf[MAX_BUF];
227 int slen;
228
229 /* Set up replyinfo before we modify any of the buffers - this is used
230 * if we don't find a match.
231 */
232 strcpy (bigbuf, "replyinfo ");
233 slen = strlen (bigbuf);
234 safe_strcat (bigbuf, buf, &slen, MAX_BUF);
235
236 /* find the first space, make it null, and update the
237 * params pointer.
238 */
239 for (cp = buf; *cp != '\0'; cp++)
240 if (*cp == ' ')
241 {
242 *cp = '\0';
243 params = cp + 1;
244 break;
245 }
246
247 if (!strcmp (buf, "image_info"))
248 send_image_info (ns, params);
249 else if (!strcmp (buf, "image_sums"))
250 send_image_sums (ns, params);
251 else if (!strcmp (buf, "skill_info"))
252 send_skill_info (ns, params);
253 else if (!strcmp (buf, "spell_paths"))
254 send_spell_paths (ns, params);
255 else
256 ns->send_packet (bigbuf, len);
227} 257}
228 258
229void 259void
230ExtCmd (char *buf, int len, player *pl) 260ExtCmd (char *buf, int len, player *pl)
231{ 261{
232 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 262 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
263}
264
265void
266ExtiCmd (char *buf, int len, client *ns)
267{
268 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
233} 269}
234 270
235void 271void
236MapInfoCmd (char *buf, int len, player *pl) 272MapInfoCmd (char *buf, int len, player *pl)
237{ 273{
… …
252 buf += 8; 288 buf += 8;
253 289
254 // initial map and its origin 290 // initial map and its origin
255 maptile *map = pl->ob->map; 291 maptile *map = pl->ob->map;
256 sint16 dx, dy; 292 sint16 dx, dy;
257 int mapx = pl->socket.mapx / 2 - pl->ob->x; 293 int mapx = pl->ns->mapx / 2 - pl->ob->x;
258 int mapy = pl->socket.mapy / 2 - pl->ob->y; 294 int mapy = pl->ns->mapy / 2 - pl->ob->y;
259 int max_distance = 8; // limit maximum path length to something generous 295 int max_distance = 8; // limit maximum path length to something generous
260 296
261 while (*buf && map && max_distance) 297 while (*buf && map && max_distance)
262 { 298 {
263 int dir = *buf++; 299 int dir = *buf++;
264 300
265 switch (dir) 301 switch (dir)
266 { 302 {
267 case '1': 303 case '1':
268 dx = 0; 304 dx = 0;
269 dy = -1; 305 dy = -1;
270 map = get_map_from_coord (map, &dx, &dy); 306 map = map->xy_find (dx, dy);
271 map && (mapy -= map->height); 307 map && (mapy -= map->height);
272 break; 308 break;
273 case '2': 309 case '2':
274 mapx += map->width; 310 mapx += map->width;
275 dx = map->width; 311 dx = map->width;
276 dy = 0; 312 dy = 0;
277 map = get_map_from_coord (map, &dx, &dy); 313 map = map->xy_find (dx, dy);
278 break; 314 break;
279 case '3': 315 case '3':
280 mapy += map->height; 316 mapy += map->height;
281 dx = 0; 317 dx = 0;
282 dy = map->height; 318 dy = map->height;
283 map = get_map_from_coord (map, &dx, &dy); 319 map = map->xy_find (dx, dy);
284 break; 320 break;
285 case '4': 321 case '4':
286 dx = -1; 322 dx = -1;
287 dy = 0; 323 dy = 0;
288 map = get_map_from_coord (map, &dx, &dy); 324 map = map->xy_find (dx, dy);
289 map && (mapx -= map->width); 325 map && (mapx -= map->width);
290 break; 326 break;
291 } 327 }
292 328
293 --max_distance; 329 --max_distance;
294 } 330 }
295 331
… …
306 if (map->tile_path[2]) 342 if (map->tile_path[2])
307 flags |= 4; 343 flags |= 4;
308 if (map->tile_path[3]) 344 if (map->tile_path[3])
309 flags |= 8; 345 flags |= 8;
310 346
311 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, map->path); 347 snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path);
312 } 348 }
313 else 349 else
314 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 350 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
315 } 351 }
316 else 352 else
317 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 353 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
318 354
319 pl->socket.send_packet (bigbuf); 355 pl->ns->send_packet (bigbuf);
320} 356}
321 357
322/** This is the Setup cmd - easy first implementation */ 358/** This is the Setup cmd - easy first implementation */
323void 359void
324SetUp (char *buf, int len, NewSocket * ns) 360SetUp (char *buf, int len, client * ns)
325{ 361{
326 int s, slen; 362 int s, slen;
327 char *cmd, *param, cmdback[HUGE_BUF]; 363 char *cmd, *param, cmdback[HUGE_BUF];
328 364
329 /* run through the cmds of setup 365 /* run through the cmds of setup
… …
371 { 407 {
372 ns->sound = atoi (param); 408 ns->sound = atoi (param);
373 safe_strcat (cmdback, param, &slen, HUGE_BUF); 409 safe_strcat (cmdback, param, &slen, HUGE_BUF);
374 } 410 }
375 else if (!strcmp (cmd, "exp64")) 411 else if (!strcmp (cmd, "exp64"))
376 {
377 ns->exp64 = atoi (param);
378 safe_strcat (cmdback, param, &slen, HUGE_BUF); 412 safe_strcat (cmdback, param, &slen, HUGE_BUF);
379 }
380 else if (!strcmp (cmd, "spellmon")) 413 else if (!strcmp (cmd, "spellmon"))
381 { 414 {
382 ns->monitor_spells = atoi (param); 415 ns->monitor_spells = atoi (param);
383 safe_strcat (cmdback, param, &slen, HUGE_BUF); 416 safe_strcat (cmdback, param, &slen, HUGE_BUF);
384 } 417 }
… …
539 * This is what takes care of it. We tell the client how things worked out. 572 * This is what takes care of it. We tell the client how things worked out.
540 * I am not sure if this file is the best place for this function. however, 573 * I am not sure if this file is the best place for this function. however,
541 * it either has to be here or init_sockets needs to be exported. 574 * it either has to be here or init_sockets needs to be exported.
542 */ 575 */
543void 576void
544AddMeCmd (char *buf, int len, NewSocket * ns) 577AddMeCmd (char *buf, int len, client * ns)
545{ 578{
546 Settings oldsettings; 579 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
547
548 oldsettings = settings;
549 if (ns->status != Ns_Add || add_player (ns))
550 ns->send_packet ("addme_failed");
551 else
552 {
553 /* Basically, the add_player copies the socket structure into
554 * the player structure, so this one (which is from init_sockets)
555 * is not needed anymore. The write below should still work, as the
556 * stuff in ns is still relevant.
557 */
558 ns->send_packet ("addme_success");
559 socket_info.nconns--;
560 ns->status = Ns_Avail;
561 }
562
563 settings = oldsettings;
564} 580}
565 581
566/** Reply to ExtendedInfos command */ 582/** Reply to ExtendedInfos command */
567void 583void
568ToggleExtendedInfos (char *buf, int len, NewSocket * ns) 584ToggleExtendedInfos (char *buf, int len, client * ns)
569{ 585{
570 char cmdback[MAX_BUF]; 586 char cmdback[MAX_BUF];
571 char command[50]; 587 char command[50];
572 int info, nextinfo; 588 int info, nextinfo;
573 589
… …
624#define MSG_TYPE_MONUMENT 5 640#define MSG_TYPE_MONUMENT 5
625#define MSG_TYPE_SCRIPTED_DIALOG 6*/ 641#define MSG_TYPE_SCRIPTED_DIALOG 6*/
626 642
627/** Reply to ExtendedInfos command */ 643/** Reply to ExtendedInfos command */
628void 644void
629ToggleExtendedText (char *buf, int len, NewSocket * ns) 645ToggleExtendedText (char *buf, int len, client * ns)
630{ 646{
631 char cmdback[MAX_BUF]; 647 char cmdback[MAX_BUF];
632 char temp[10]; 648 char temp[10];
633 char command[50]; 649 char command[50];
634 int info, nextinfo, i, flag; 650 int info, nextinfo, i, flag;
… …
685 * a piece of data from us that we know the client wants. So 701 * a piece of data from us that we know the client wants. So
686 * if we know the client wants it, might as well push it to the 702 * if we know the client wants it, might as well push it to the
687 * client. 703 * client.
688 */ 704 */
689static void 705static void
690SendSmooth (NewSocket * ns, uint16 face) 706SendSmooth (client *ns, uint16 face)
691{ 707{
692 uint16 smoothface; 708 uint16 smoothface;
693 709
694 /* If we can't find a face, return and set it so we won't try to send this 710 /* If we can't find a face, return and set it so we won't try to send this
695 * again. 711 * again.
… …
705 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) 721 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
706 esrv_send_face (ns, smoothface, 0); 722 esrv_send_face (ns, smoothface, 0);
707 723
708 ns->faces_sent[face] |= NS_FACESENT_SMOOTH; 724 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
709 725
710 packet sl; 726 packet sl ("smooth");
711 727
712 sl << "smooth "
713 << uint16 (face) 728 sl << uint16 (face)
714 << uint16 (smoothface); 729 << uint16 (smoothface);
715 730
716 Send_With_Handling (ns, &sl); 731 ns->send_packet (sl);
717} 732}
718 733
719 /** 734 /**
720 * Tells client the picture it has to use 735 * Tells client the picture it has to use
721 * to smooth a picture number given as argument. 736 * to smooth a picture number given as argument.
722 */ 737 */
723void 738void
724AskSmooth (char *buf, int len, NewSocket * ns) 739AskSmooth (char *buf, int len, client *ns)
725{ 740{
726 uint16 facenbr; 741 SendSmooth (ns, atoi (buf));
727
728 facenbr = atoi (buf);
729 SendSmooth (ns, facenbr);
730} 742}
731 743
732/** 744/**
733 * This handles the general commands from the client (ie, north, fire, cast, 745 * This handles the general commands from the client (ie, north, fire, cast,
734 * etc.) 746 * etc.)
735 */ 747 */
736void 748void
737PlayerCmd (char *buf, int len, player *pl) 749PlayerCmd (char *buf, int len, player *pl)
738{ 750{
739
740 /* The following should never happen with a proper or honest client.
741 * Therefore, the error message doesn't have to be too clear - if
742 * someone is playing with a hacked/non working client, this gives them
743 * an idea of the problem, but they deserve what they get
744 */
745 if (pl->state != ST_PLAYING)
746 {
747 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
748 return;
749 }
750 /* Check if there is a count. In theory, a zero count could also be 751 /* Check if there is a count. In theory, a zero count could also be
751 * sent, so check for that also. 752 * sent, so check for that also.
752 */ 753 */
753 if (atoi (buf) || buf[0] == '0') 754 if (atoi (buf) || buf[0] == '0')
754 { 755 {
755 pl->count = atoi ((char *) buf); 756 pl->count = atoi ((char *) buf);
757
756 buf = strchr (buf, ' '); /* advance beyond the numbers */ 758 buf = strchr (buf, ' '); /* advance beyond the numbers */
757 if (!buf) 759 if (!buf)
758 {
759#ifdef ESRV_DEBUG
760 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
761#endif
762 return; 760 return;
763 } 761
764 buf++; 762 buf++;
765 } 763 }
766 /* This should not happen anymore. */ 764
767 if (pl->ob->speed_left < -1.0)
768 {
769 LOG (llevError, "Player has negative time - shouldn't do command.\n");
770 }
771 /* In c_new.c */
772 execute_newserver_command (pl->ob, (char *) buf); 765 execute_newserver_command (pl->ob, (char *) buf);
766
773 /* Perhaps something better should be done with a left over count. 767 /* Perhaps something better should be done with a left over count.
774 * Cleaning up the input should probably be done first - all actions 768 * Cleaning up the input should probably be done first - all actions
775 * for the command that issued the count should be done before any other 769 * for the command that issued the count should be done before any other
776 * commands. 770 * commands.
777 */ 771 */
778
779 pl->count = 0; 772 pl->count = 0;
780
781} 773}
782 774
783 775
784/** 776/**
785 * This handles the general commands from the client (ie, north, fire, cast, 777 * This handles the general commands from the client (ie, north, fire, cast,
786 * etc.). It is a lot like PlayerCmd above, but is called with the 778 * etc.). It is a lot like PlayerCmd above, but is called with the
787 * 'ncom' method which gives more information back to the client so it 779 * 'ncom' method which gives more information back to the client so it
788 * can throttle. 780 * can throttle.
789 */ 781 */
790void 782void
791NewPlayerCmd (uint8 * buf, int len, player *pl) 783NewPlayerCmd (char *buf, int len, player *pl)
792{ 784{
793 int time, repeat;
794 char command[MAX_BUF];
795 int pktlen;
796
797 if (len < 7) 785 if (len <= 6)
798 { 786 {
799 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); 787 LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf);
800 return; 788 return;
801 } 789 }
802 790
803 pktlen = net_uint16 (buf); 791 uint16 cmdid = net_uint16 ((uint8 *)buf);
804 repeat = net_uint32 (buf + 2); 792 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
805 793
806 /* -1 is special - no repeat, but don't update */ 794 /* -1 is special - no repeat, but don't update */
807 if (repeat != -1) 795 if (repeat != -1)
808 pl->count = repeat; 796 pl->count = repeat;
809 797
810 if ((len - 4) >= MAX_BUF) 798 buf += 6; //len -= 6;
811 len = MAX_BUF - 5;
812 799
813 strncpy ((char *) command, (char *) buf + 6, len - 4);
814 command[len - 4] = '\0';
815
816 /* The following should never happen with a proper or honest client.
817 * Therefore, the error message doesn't have to be too clear - if
818 * someone is playing with a hacked/non working client, this gives them
819 * an idea of the problem, but they deserve what they get
820 */
821 if (pl->state != ST_PLAYING)
822 {
823 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
824 return;
825 }
826
827 /* This should not happen anymore. */
828 if (pl->ob->speed_left < -1.0)
829 LOG (llevError, "Player has negative time - shouldn't do command.\n");
830
831 /* In c_new.c */
832 execute_newserver_command (pl->ob, (char *) command); 800 execute_newserver_command (pl->ob, buf);
801
833 /* Perhaps something better should be done with a left over count. 802 /* Perhaps something better should be done with a left over count.
834 * Cleaning up the input should probably be done first - all actions 803 * Cleaning up the input should probably be done first - all actions
835 * for the command that issued the count should be done before any other 804 * for the command that issued the count should be done before any other
836 * commands. 805 * commands.
837 */ 806 */
838 pl->count = 0; 807 pl->count = 0;
839 808
840 if (FABS (pl->ob->speed) < 0.001) 809 //TODO: schmorp thinks whatever this calculates, it makes no sense at all
810 int time = fabs (pl->ob->speed) < 0.001
841 time = MAX_TIME * 100; 811 ? time = MAX_TIME * 100
842 else
843 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 812 : time = (int) (MAX_TIME / fabs (pl->ob->speed));
844 813
845 /* Send confirmation of command execution now */ 814 /* Send confirmation of command execution now */
846 815 packet sl ("comc");
847 packet sl;
848 sl << "comc " << uint16 (pktlen) << uint32 (time); 816 sl << uint16 (cmdid) << uint32 (time);
849 Send_With_Handling (&pl->socket, &sl); 817 pl->ns->send_packet (sl);
850} 818}
851
852 819
853/** This is a reply to a previous query. */ 820/** This is a reply to a previous query. */
854void 821void
855ReplyCmd (char *buf, int len, player *pl) 822ReplyCmd (char *buf, int len, client *ns)
856{ 823{
824 if (ns->state == ST_CUSTOM)
825 {
826 INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len));
827 return;
828 }
829
830 if (!ns->pl)
831 return; //TODO: depends on the exact reply we are after
832 //TODO: but right now, we always have a ns->pl
833
834 player *pl = ns->pl;
835
857 /* This is to synthesize how the data would be stored if it 836 /* This is to synthesize how the data would be stored if it
858 * was normally entered. A bit of a hack, and should be cleaned up 837 * was normally entered. A bit of a hack, and should be cleaned up
859 * once all the X11 code is removed from the server. 838 * once all the X11 code is removed from the server.
860 * 839 *
861 * We pass 13 to many of the functions because this way they 840 * We pass 13 to many of the functions because this way they
862 * think it was the carriage return that was entered, and the 841 * think it was the carriage return that was entered, and the
863 * function then does not try to do additional input. 842 * function then does not try to do additional input.
864 */ 843 */
865 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); 844 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
866 845
867 /* this avoids any hacking here */ 846 /* this avoids any hacking here */
868 847
869 switch (pl->state) 848 switch (ns->state)
870 { 849 {
871 case ST_PLAYING: 850 case ST_PLAYING:
872 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 851 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
873 break; 852 break;
874 853
875 case ST_PLAY_AGAIN:
876 /* We can check this for return value (2==quit). Maybe we
877 * should, and do something appropriate?
878 */
879 receive_play_again (pl->ob, buf[0]);
880 break;
881
882 case ST_ROLL_STAT:
883 key_roll_stat (pl->ob, buf[0]);
884 break;
885
886 case ST_CHANGE_CLASS: 854 case ST_CHANGE_CLASS:
887
888 key_change_class (pl->ob, buf[0]); 855 key_change_class (pl->ob, buf[0]);
889 break; 856 break;
890 857
891 case ST_CONFIRM_QUIT:
892 key_confirm_quit (pl->ob, buf[0]);
893 break;
894
895 case ST_CONFIGURE:
896 LOG (llevError, "In client input handling, but into configure state\n");
897 pl->state = ST_PLAYING;
898 break;
899
900 case ST_GET_NAME:
901 receive_player_name (pl->ob, 13);
902 break;
903
904 case ST_GET_PASSWORD:
905 case ST_CONFIRM_PASSWORD:
906 receive_player_password (pl->ob, 13);
907 break;
908
909 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 858 case ST_GET_PARTY_PASSWORD: /* Get password for party */
910 receive_party_password (pl->ob, 13); 859 receive_party_password (pl->ob, 13);
911 break; 860 break;
912 861
913 default: 862 default:
914 LOG (llevError, "Unknown input state: %d\n", pl->state); 863 LOG (llevError, "Unknown input state: %d\n", ns->state);
915 } 864 }
916} 865}
917 866
918/** 867/**
919 * Client tells its version. If there is a mismatch, we close the 868 * Client tells its version. If there is a mismatch, we close the
… …
921 * something older than the server. If we assume the client will be 870 * something older than the server. If we assume the client will be
922 * backwards compatible, having it be a later version should not be a 871 * backwards compatible, having it be a later version should not be a
923 * problem. 872 * problem.
924 */ 873 */
925void 874void
926VersionCmd (char *buf, int len, NewSocket * ns) 875VersionCmd (char *buf, int len, client * ns)
927{ 876{
928 char *cp;
929 char version_warning[256];
930
931 if (!buf) 877 if (!buf)
932 { 878 {
933 LOG (llevError, "CS: received corrupted version command\n"); 879 LOG (llevError, "CS: received corrupted version command\n");
934 return; 880 return;
935 } 881 }
936 882
937 ns->cs_version = atoi (buf); 883 ns->cs_version = atoi (buf);
938 ns->sc_version = ns->cs_version; 884 ns->sc_version = ns->cs_version;
885
886 LOG (llevDebug, "connection from client <%s>\n", buf);
887
888
889 //TODO: should log here just for statistics
890
939 if (VERSION_CS != ns->cs_version) 891 //if (VERSION_CS != ns->cs_version)
940 { 892 // unchecked;
941#ifdef ESRV_DEBUG 893
942 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
943#endif
944 }
945 cp = strchr (buf + 1, ' '); 894 char *cp = strchr (buf + 1, ' ');
946 if (!cp) 895 if (!cp)
947 return; 896 return;
897
948 ns->sc_version = atoi (cp); 898 ns->sc_version = atoi (cp);
899
949 if (VERSION_SC != ns->sc_version) 900 //if (VERSION_SC != ns->sc_version)
950 { 901 // unchecked;
951#ifdef ESRV_DEBUG 902
952 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
953#endif
954 }
955 cp = strchr (cp + 1, ' '); 903 cp = strchr (cp + 1, ' ');
904
956 if (cp) 905 if (cp)
957 { 906 {
958 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); 907 assign (ns->version, cp + 1);
959 908
960 snprintf (ns->client, sizeof (ns->client), "%s", cp + 1);
961
962 /* This is first implementation - i skip all beta DX clients with it
963 * Add later stuff here for other clients
964 */
965
966 /* these are old dxclients */
967 /* Version 1024 added support for singular + plural name values -
968 * requiing this minimal value reduces complexity of that code, and it
969 * has been around for a long time.
970 */
971 if (ns->sc_version < 1026) 909 if (ns->sc_version < 1026)
972 { 910 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
973 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
974 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 911 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
975 ns->send_packet (version_warning);
976 }
977
978 } 912 }
979} 913}
980 914
981/** sound related functions. */ 915/** sound related functions. */
982
983void 916void
984SetSound (char *buf, int len, NewSocket * ns) 917SetSound (char *buf, int len, client * ns)
985{ 918{
986 ns->sound = atoi (buf); 919 ns->sound = atoi (buf);
987} 920}
988 921
989/** client wants the map resent */ 922/** client wants the map resent */
990
991void 923void
992MapRedrawCmd (char *buf, int len, player *pl) 924MapRedrawCmd (char *buf, int len, player *pl)
993{ 925{
994
995/* This function is currently disabled; just clearing the map state results in 926/* This function is currently disabled; just clearing the map state results in
996 * display errors. It should clear the cache and send a newmap command. 927 * display errors. It should clear the cache and send a newmap command.
997 * Unfortunately this solution does not work because some client versions send 928 * Unfortunately this solution does not work because some client versions send
998 * a mapredraw command after receiving a newmap command. 929 * a mapredraw command after receiving a newmap command.
999 */ 930 */
1000#if 0
1001 /* Okay, this is MAJOR UGLY. but the only way I know how to
1002 * clear the "cache"
1003 */
1004 memset (&pl->socket.lastmap, 0, sizeof (struct Map));
1005 draw_client_map (pl->ob);
1006#endif
1007} 931}
1008 932
1009/** 933/**
1010 * Moves an object (typically, container to inventory). 934 * Moves an object (typically, container to inventory).
1011 * syntax is: move (to) (tag) (nrof) 935 * syntax is: move (to) (tag) (nrof)
… …
1014MoveCmd (char *buf, int len, player *pl) 938MoveCmd (char *buf, int len, player *pl)
1015{ 939{
1016 int vals[3], i; 940 int vals[3], i;
1017 941
1018 /* A little funky here. We only cycle for 2 records, because 942 /* A little funky here. We only cycle for 2 records, because
1019 * we obviously am not going to find a space after the third 943 * we obviously are not going to find a space after the third
1020 * record. Perhaps we should just replace this with a 944 * record. Perhaps we should just replace this with a
1021 * sscanf? 945 * sscanf?
1022 */ 946 */
1023 for (i = 0; i < 2; i++) 947 for (i = 0; i < 2; i++)
1024 { 948 {
1025 vals[i] = atoi (buf); 949 vals[i] = atoi (buf);
950
1026 if (!(buf = strchr (buf, ' '))) 951 if (!(buf = strchr (buf, ' ')))
1027 { 952 {
1028 LOG (llevError, "Incomplete move command: %s\n", buf); 953 LOG (llevError, "Incomplete move command: %s\n", buf);
1029 return; 954 return;
1030 } 955 }
956
1031 buf++; 957 buf++;
1032 } 958 }
959
1033 vals[2] = atoi (buf); 960 vals[2] = atoi (buf);
1034 961
1035/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ 962/* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/
1036 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 963 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1037} 964}
1038
1039
1040 965
1041/****************************************************************************** 966/******************************************************************************
1042 * 967 *
1043 * Start of commands the server sends to the client. 968 * Start of commands the server sends to the client.
1044 * 969 *
… …
1047/** 972/**
1048 * Asks the client to query the user. This way, the client knows 973 * Asks the client to query the user. This way, the client knows
1049 * it needs to send something back (vs just printing out a message) 974 * it needs to send something back (vs just printing out a message)
1050 */ 975 */
1051void 976void
1052send_query (NewSocket * ns, uint8 flags, char *text) 977send_query (client *ns, uint8 flags, char *text)
1053{ 978{
1054 char buf[MAX_BUF];
1055
1056 sprintf (buf, "query %d %s", flags, text ? text : ""); 979 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1057 ns->send_packet (buf);
1058} 980}
1059 981
1060#define AddIfInt64(Old,New,Type) if (Old != New) {\ 982#define AddIfInt64(Old,New,Type) if (Old != New) {\
1061 Old = New; \ 983 Old = New; \
1062 sl << uint8 (Type) << uint64 (New); \ 984 sl << uint8 (Type) << uint64 (New); \
… …
1092esrv_update_stats (player *pl) 1014esrv_update_stats (player *pl)
1093{ 1015{
1094 char buf[MAX_BUF]; 1016 char buf[MAX_BUF];
1095 uint16 flags; 1017 uint16 flags;
1096 1018
1097 packet sl; 1019 client *ns = pl->ns;
1098 sl << "stats "; 1020 if (!ns)
1021 return;
1099 1022
1100 if (pl->ob != NULL) 1023 object *ob = pl->ob;
1101 { 1024 if (!ob)
1025 return;
1026
1027 packet sl ("stats");
1028
1102 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1029 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1103 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1030 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
1104 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1031 AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP);
1105 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1032 AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP);
1106 AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); 1033 AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE);
1107 AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); 1034 AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE);
1108 AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); 1035 AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR);
1109 AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);
1110 AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);
1111 AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);
1112 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 1036 AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX);
1113 AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); 1037 AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON);
1038 AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT);
1039 AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS);
1040 AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW);
1114 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1041 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1115 }
1116 1042
1117 if (pl->socket.exp64)
1118 {
1119 uint8 s;
1120
1121 for (s = 0; s < NUM_SKILLS; s++) 1043 for (int s = 0; s < NUM_SKILLS; s++)
1122 { 1044 if (object *skill = pl->last_skill_ob[s])
1123 if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) 1045 if (skill->stats.exp != ns->last_skill_exp [s])
1124 { 1046 {
1047 ns->last_skill_exp [s] = skill->stats.exp;
1048
1125 /* Always send along the level if exp changes. This is only 1049 /* Always send along the level if exp changes. This is only
1126 * 1 extra byte, but keeps processing simpler. 1050 * 1 extra byte, but keeps processing simpler.
1127 */ 1051 */
1128 sl << uint8 (s + CS_STAT_SKILLINFO) 1052 sl << uint8 (s + CS_STAT_SKILLINFO)
1129 << uint8 (pl->last_skill_ob[s]->level) 1053 << uint8 (skill->level)
1130 << uint64 (pl->last_skill_ob[s]->stats.exp); 1054 << uint64 (skill->stats.exp);
1131
1132 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1133 } 1055 }
1134 }
1135 }
1136 1056
1137 if (pl->socket.exp64)
1138 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1057 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1139 else
1140 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1141
1142 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1058 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1143 AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); 1059 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1144 AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); 1060 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1145 AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); 1061 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1146 AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED); 1062 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);
1147 AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD); 1063 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1148 AddIfFloat (pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); 1064 AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP);
1149 AddIfInt (pl->last_weight_limit, (sint32) weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM); 1065 AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM);
1066
1150 flags = 0; 1067 flags = 0;
1151 1068
1152 if (pl->fire_on) 1069 if (pl->fire_on)
1153 flags |= SF_FIREON; 1070 flags |= SF_FIREON;
1154 1071
1155 if (pl->run_on) 1072 if (pl->run_on)
1156 flags |= SF_RUNON; 1073 flags |= SF_RUNON;
1157 1074
1158 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1075 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1159 1076
1160 if (pl->socket.sc_version < 1025) 1077 if (ns->sc_version < 1025)
1161 { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } 1078 { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) }
1162 else 1079 else
1163 {
1164 int i;
1165
1166 for (i = 0; i < NROFATTACKS; i++) 1080 for (int i = 0; i < NROFATTACKS; i++)
1167 { 1081 {
1168 /* Skip ones we won't send */ 1082 /* Skip ones we won't send */
1169 if (atnr_cs_stat[i] == -1) 1083 if (atnr_cs_stat[i] == -1)
1170 continue; 1084 continue;
1171 1085
1172 AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); 1086 AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]);
1173 } 1087 }
1174 }
1175 1088
1176 if (pl->socket.monitor_spells) 1089 if (pl->ns->monitor_spells)
1177 { 1090 {
1178 AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); 1091 AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE);
1179 AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); 1092 AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL);
1180 AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); 1093 AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY);
1181 } 1094 }
1182 1095
1183 rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ 1096 rangetostring (ob, buf); /* we want use the new fire & run system in new client */
1184 AddIfString (pl->socket.stats.range, buf, CS_STAT_RANGE); 1097 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1185 set_title (pl->ob, buf); 1098 set_title (ob, buf);
1186 AddIfString (pl->socket.stats.title, buf, CS_STAT_TITLE); 1099 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1187 1100
1188 /* Only send it away if we have some actual data */ 1101 /* Only send it away if we have some actual data */
1189 if (sl.len > 6) 1102 if (sl.length () > 6)
1190 { 1103 ns->send_packet (sl);
1191#ifdef ESRV_DEBUG
1192 LOG (llevDebug, "Sending stats command, %d bytes long.\n", sl.len);
1193#endif
1194 Send_With_Handling (&pl->socket, &sl);
1195 }
1196
1197} 1104}
1198 1105
1199/** 1106/**
1200 * Tells the client that here is a player it should start using. 1107 * Tells the client that here is a player it should start using.
1201 */ 1108 */
1202void 1109void
1203esrv_new_player (player *pl, uint32 weight) 1110esrv_new_player (player *pl, uint32 weight)
1204{ 1111{
1205 pl->last_weight = weight; 1112 packet sl ("player");
1206
1207 packet sl;
1208 sl << "player ";
1209 1113
1210 sl << uint32 (pl->ob->count) 1114 sl << uint32 (pl->ob->count)
1211 << uint32 (weight) 1115 << uint32 (weight)
1212 << uint32 (pl->ob->face->number) 1116 << uint32 (pl->ob->face->number)
1213 << data8 (pl->ob->name); 1117 << data8 (pl->ob->name);
1214 1118
1215 Send_With_Handling (&pl->socket, &sl); 1119 pl->ns->last_weight = weight;
1120 pl->ns->send_packet (sl);
1216 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1121 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1217} 1122}
1218 1123
1219/** 1124/**
1220 * Need to send an animation sequence to the client. 1125 * Need to send an animation sequence to the client.
… …
1222 * sent them the face yet (this can become quite costly in terms of 1127 * sent them the face yet (this can become quite costly in terms of
1223 * how much we are sending - on the other hand, this should only happen 1128 * how much we are sending - on the other hand, this should only happen
1224 * when the player logs in and picks stuff up. 1129 * when the player logs in and picks stuff up.
1225 */ 1130 */
1226void 1131void
1227esrv_send_animation (NewSocket * ns, short anim_num) 1132esrv_send_animation (client * ns, short anim_num)
1228{ 1133{
1229 int i;
1230
1231 /* Do some checking on the anim_num we got. Note that the animations 1134 /* Do some checking on the anim_num we got. Note that the animations
1232 * are added in contigous order, so if the number is in the valid 1135 * are added in contigous order, so if the number is in the valid
1233 * range, it must be a valid animation. 1136 * range, it must be a valid animation.
1234 */ 1137 */
1235 if (anim_num < 0 || anim_num > num_animations) 1138 if (anim_num < 0 || anim_num > num_animations)
1236 { 1139 {
1237 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); 1140 LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num);
1238 return; 1141 return;
1239 } 1142 }
1240 1143
1241 packet sl; 1144 packet sl ("anim");
1242 1145
1243 sl << "anim "
1244 << uint16 (anim_num) 1146 sl << uint16 (anim_num)
1245 << uint16 (0); /* flags - not used right now */ 1147 << uint16 (0); /* flags - not used right now */
1246 1148
1247 /* Build up the list of faces. Also, send any information (ie, the 1149 /* Build up the list of faces. Also, send any information (ie, the
1248 * the face itself) down to the client. 1150 * the face itself) down to the client.
1249 */ 1151 */
1250 for (i = 0; i < animations[anim_num].num_animations; i++) 1152 for (int i = 0; i < animations[anim_num].num_animations; i++)
1251 { 1153 {
1252 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) 1154 if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE))
1253 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1155 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1156
1254 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ 1157 sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */
1255 } 1158 }
1256 1159
1257 Send_With_Handling (ns, &sl); 1160 ns->send_packet (sl);
1258 1161
1259 ns->anims_sent[anim_num] = 1; 1162 ns->anims_sent[anim_num] = 1;
1260} 1163}
1261 1164
1262 1165
… …
1269/** 1172/**
1270 * This adds face_num to a map cell at x,y. If the client doesn't have 1173 * This adds face_num to a map cell at x,y. If the client doesn't have
1271 * the face yet, we will also send it. 1174 * the face yet, we will also send it.
1272 */ 1175 */
1273static void 1176static void
1274esrv_map_setbelow (NewSocket * ns, int x, int y, short face_num, struct Map *newmap) 1177esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap)
1275{ 1178{
1276 if (newmap->cells[x][y].count >= MAP_LAYERS) 1179 if (newmap->cells[x][y].count >= MAP_LAYERS)
1277 { 1180 {
1181 //TODO: one or the other, can't both have abort and return, verify and act
1278 LOG (llevError, "Too many faces in map cell %d %d\n", x, y); 1182 LOG (llevError, "Too many faces in map cell %d %d\n", x, y);
1279 return; 1183 return;
1280 abort (); 1184 abort ();
1281 } 1185 }
1282 1186
… …
1284 newmap->cells[x][y].count++; 1188 newmap->cells[x][y].count++;
1285 1189
1286 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1190 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1287 esrv_send_face (ns, face_num, 0); 1191 esrv_send_face (ns, face_num, 0);
1288} 1192}
1289
1290struct LayerCell
1291{
1292 uint16 xy;
1293 short face;
1294};
1295
1296struct MapLayer
1297{
1298 int count;
1299 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1300};
1301
1302/** Checkes if map cells have changed */
1303static int
1304mapcellchanged (NewSocket * ns, int i, int j, struct Map *newmap)
1305{
1306 int k;
1307
1308 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1309 return 1;
1310 for (k = 0; k < newmap->cells[i][j].count; k++)
1311 {
1312 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1313 {
1314 return 1;
1315 }
1316 }
1317 return 0;
1318}
1319
1320/**
1321 * Basically, what this does is pack the data into layers.
1322 * cnum is the client number, cur is the the buffer we put all of
1323 * this data into. we return the end of the data. layers is
1324 * how many layers of data we should back.
1325 */
1326static uint8 *
1327compactlayer (NewSocket * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1328{
1329 int x, y, k;
1330 int face;
1331 unsigned char *fcur;
1332 struct MapLayer layers[MAP_LAYERS];
1333
1334 for (k = 0; k < MAP_LAYERS; k++)
1335 layers[k].count = 0;
1336 fcur = cur;
1337 for (x = 0; x < ns->mapx; x++)
1338 {
1339 for (y = 0; y < ns->mapy; y++)
1340 {
1341 if (!mapcellchanged (ns, x, y, newmap))
1342 continue;
1343 if (newmap->cells[x][y].count == 0)
1344 {
1345 *cur = x * ns->mapy + y; /* mark empty space */
1346 cur++;
1347 continue;
1348 }
1349 for (k = 0; k < newmap->cells[x][y].count; k++)
1350 {
1351 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1352 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1353 layers[k].count++;
1354 }
1355 }
1356 }
1357 /* If no data, return now. */
1358 if (fcur == cur && layers[0].count == 0)
1359 return cur;
1360 *cur = 255; /* mark end of explicitly cleared cells */
1361 cur++;
1362 /* First pack by layers. */
1363 for (k = 0; k < numlayers; k++)
1364 {
1365 if (layers[k].count == 0)
1366 break; /* once a layer is entirely empty, no layer below it can
1367 have anything in it either */
1368 /* Pack by entries in thie layer */
1369 for (x = 0; x < layers[k].count;)
1370 {
1371 fcur = cur;
1372 *cur = layers[k].lcells[x].face >> 8;
1373 cur++;
1374 *cur = layers[k].lcells[x].face & 0xFF;
1375 cur++;
1376 face = layers[k].lcells[x].face;
1377 /* Now, we back the redundant data into 1 byte xy pairings */
1378 for (y = x; y < layers[k].count; y++)
1379 {
1380 if (layers[k].lcells[y].face == face)
1381 {
1382 *cur = (uint8) layers[k].lcells[y].xy;
1383 cur++;
1384 layers[k].lcells[y].face = -1;
1385 }
1386 }
1387 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1388 /* forward over the now redundant data */
1389 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1390 x++;
1391 }
1392 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1393 }
1394 return cur;
1395}
1396
1397static void
1398esrv_map_doneredraw (NewSocket * ns, struct Map *newmap)
1399{
1400 static long frames, bytes, tbytes, tframes;
1401 char *cur;
1402
1403 packet sl;
1404 sl << "map ";
1405
1406 cur = (char *) compactlayer (ns, (unsigned char *) sl.buf + sl.len, MAP_LAYERS, newmap);
1407 sl.len = cur - (char *) sl.buf;
1408
1409/* LOG(llevDebug, "Sending map command.\n");*/
1410
1411 if (sl.len > (int) strlen ("map ") || ns->sent_scroll)
1412 {
1413 /* All of this is just accounting stuff */
1414 if (tframes > 100)
1415 tframes = tbytes = 0;
1416
1417 tframes++;
1418 frames++;
1419 tbytes += sl.len;
1420 bytes += sl.len;
1421 memcpy (&ns->lastmap, newmap, sizeof (struct Map));
1422 Send_With_Handling (ns, &sl);
1423 ns->sent_scroll = 0;
1424 }
1425
1426}
1427
1428 1193
1429/** Clears a map cell */ 1194/** Clears a map cell */
1430static void 1195static void
1431map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) 1196map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count)
1432{ 1197{
… …
1443#define MAX_LAYERS 3 1208#define MAX_LAYERS 3
1444 1209
1445/* Using a global really isn't a good approach, but saves the over head of 1210/* Using a global really isn't a good approach, but saves the over head of
1446 * allocating and deallocating such a block of data each time run through, 1211 * allocating and deallocating such a block of data each time run through,
1447 * and saves the space of allocating this in the socket object when we only 1212 * and saves the space of allocating this in the socket object when we only
1448 * need it for this cycle. If the serve is ever threaded, this needs to be 1213 * need it for this cycle. If the server is ever threaded, this needs to be
1449 * re-examined. 1214 * re-examined.
1450 */ 1215 */
1451
1452static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1216static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1453 1217
1454/** 1218/**
1455 * Returns true if any of the heads for this 1219 * Returns true if any of the heads for this
1456 * space is set. Returns false if all are blank - this is used 1220 * space is set. Returns false if all are blank - this is used
1457 * for empty space checking. 1221 * for empty space checking.
1458 */ 1222 */
1459static inline int 1223static inline int
1460have_head (int ax, int ay) 1224have_head (int ax, int ay)
1461{ 1225{
1462
1463 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1226 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1464 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) 1227 heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2])
1465 return 1; 1228 return 1;
1229
1466 return 0; 1230 return 0;
1467} 1231}
1468 1232
1469/** 1233/**
1470 * check_head is a bit simplistic version of update_space below. 1234 * check_head is a bit simplistic version of update_space below.
1471 * basically, it only checks the that the head on space ax,ay at layer 1235 * basically, it only checks the that the head on space ax,ay at layer
1472 * needs to get sent - if so, it adds the data, sending the head 1236 * needs to get sent - if so, it adds the data, sending the head
1473 * if needed, and returning 1. If this no data needs to get 1237 * if needed, and returning 1. If this no data needs to get
1474 * sent, it returns zero. 1238 * sent, it returns zero.
1475 */ 1239 */
1476static int 1240static int
1477check_head (packet &sl, NewSocket &ns, int ax, int ay, int layer) 1241check_head (packet &sl, client &ns, int ax, int ay, int layer)
1478{ 1242{
1479 short face_num; 1243 short face_num;
1480 1244
1481 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) 1245 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer])
1482 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; 1246 face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number;
… …
1514 * numbers the spaces differently - I think this was a leftover from 1278 * numbers the spaces differently - I think this was a leftover from
1515 * the map command, where the faces stack up. Sinces that is no longer 1279 * the map command, where the faces stack up. Sinces that is no longer
1516 * the case, it seems to make more sense to have these layer values 1280 * the case, it seems to make more sense to have these layer values
1517 * actually match. 1281 * actually match.
1518 */ 1282 */
1519
1520static int 1283static int
1521update_space (packet &sl, NewSocket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1284update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1522{ 1285{
1523 object *ob, *head; 1286 object *ob, *head;
1524 uint16 face_num; 1287 uint16 face_num;
1525 int bx, by, i; 1288 int bx, by, i;
1526 1289
… …
1739 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ 1502 * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ
1740 * take. 1503 * take.
1741 */ 1504 */
1742 1505
1743static inline int 1506static inline int
1744update_smooth (packet &sl, NewSocket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) 1507update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer)
1745{ 1508{
1746 object *ob; 1509 object *ob;
1747 int smoothlevel; /* old face_num; */ 1510 int smoothlevel; /* old face_num; */
1748 1511
1749 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1512 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1750 1513
1751 /* If there is no object for this space, or if the face for the object 1514 /* If there is no object for this space, or if the face for the object
1752 * is the blank face, set the smoothlevel to zero. 1515 * is the blank face, set the smoothlevel to zero.
1753 */ 1516 */
1754 if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp)) 1517 if (!ob || ob->face == blank_face)
1755 smoothlevel = 0; 1518 smoothlevel = 0;
1756 else 1519 else
1757 { 1520 {
1758 smoothlevel = ob->smoothlevel; 1521 smoothlevel = ob->smoothlevel;
1759 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH)) 1522 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
… …
1783 * Returns the size of a data for a map square as returned by 1546 * Returns the size of a data for a map square as returned by
1784 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries 1547 * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries
1785 * available. 1548 * available.
1786 */ 1549 */
1787int 1550int
1788getExtendedMapInfoSize (NewSocket * ns) 1551getExtendedMapInfoSize (client * ns)
1789{ 1552{
1790 int result = 0; 1553 int result = 0;
1791 1554
1792 if (ns->ext_mapinfos) 1555 if (ns->ext_mapinfos)
1793 { 1556 {
1794 if (ns->EMI_smooth) 1557 if (ns->EMI_smooth)
1795 result += 1; /*One byte for smoothlevel */ 1558 result += 1; /*One byte for smoothlevel */
1796 } 1559 }
1560
1797 return result; 1561 return result;
1562}
1563
1564// prefetch (and touch) all maps within a specific distancd
1565static void
1566prefetch_surrounding_maps (maptile *map, int distance)
1567{
1568 map->last_access = runtime;
1569
1570 if (--distance)
1571 for (int dir = 4; --dir; )
1572 if (const shstr &path = map->tile_path [dir])
1573 if (maptile *&neigh = map->tile_map [dir])
1574 prefetch_surrounding_maps (neigh, distance);
1575 else
1576 neigh = maptile::find_async (path, map);
1577}
1578
1579// prefetch a generous area around the player
1580static void
1581prefetch_surrounding_maps (object *op)
1582{
1583 prefetch_surrounding_maps (op->map, 3);
1798} 1584}
1799 1585
1800/** 1586/**
1801 * This function uses the new map1 protocol command to send the map 1587 * This function uses the new map1 protocol command to send the map
1802 * to the client. It is necessary because the old map command supports 1588 * to the client. It is necessary because the old map command supports
… …
1808 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off 1594 * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off
1809 * maps no sense. Instead, we actually really only use 12 bits for coordinates, 1595 * maps no sense. Instead, we actually really only use 12 bits for coordinates,
1810 * and use the other 4 bits for other informatiion. For full documentation 1596 * and use the other 4 bits for other informatiion. For full documentation
1811 * of what we send, see the doc/Protocol file. 1597 * of what we send, see the doc/Protocol file.
1812 * I will describe internally what we do: 1598 * I will describe internally what we do:
1813 * the socket->lastmap shows how the map last looked when sent to the client. 1599 * the ns->lastmap shows how the map last looked when sent to the client.
1814 * in the lastmap structure, there is a cells array, which is set to the 1600 * in the lastmap structure, there is a cells array, which is set to the
1815 * maximum viewable size (As set in config.h). 1601 * maximum viewable size (As set in config.h).
1816 * in the cells, there are faces and a count value. 1602 * in the cells, there are faces and a count value.
1817 * we use the count value to hold the darkness value. If -1, then this space 1603 * we use the count value to hold the darkness value. If -1, then this space
1818 * is not viewable. 1604 * is not viewable.
… …
1829 uint8 eentrysize; 1615 uint8 eentrysize;
1830 uint16 ewhatstart, ewhatflag; 1616 uint16 ewhatstart, ewhatflag;
1831 uint8 extendedinfos; 1617 uint8 extendedinfos;
1832 maptile *m; 1618 maptile *m;
1833 1619
1834 NewSocket &socket = pl->contr->socket; 1620 client &socket = *pl->contr->ns;
1621
1622 if (!pl->active)
1623 return;
1835 1624
1836 check_map_change (pl->contr); 1625 check_map_change (pl->contr);
1626 prefetch_surrounding_maps (pl);
1837 1627
1838 packet sl; 1628 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1839 packet esl; 1629 packet esl;
1840 1630
1841 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1842 startlen = sl.len; 1631 startlen = sl.length ();
1843 1632
1844 /*Extendedmapinfo structure initialisation */ 1633 /*Extendedmapinfo structure initialisation */
1845 if (socket.ext_mapinfos) 1634 if (socket.ext_mapinfos)
1846 { 1635 {
1847 extendedinfos = EMI_NOREDRAW; 1636 extendedinfos = EMI_NOREDRAW;
1848 1637
1849 if (socket.EMI_smooth) 1638 if (socket.EMI_smooth)
1850 extendedinfos |= EMI_SMOOTH; 1639 extendedinfos |= EMI_SMOOTH;
1851 1640
1852 ewhatstart = esl.len; 1641 ewhatstart = esl.length ();
1853 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit 1642 ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit
1854 could need to be taken away */ 1643 could need to be taken away */
1855 eentrysize = getExtendedMapInfoSize (&socket); 1644 eentrysize = getExtendedMapInfoSize (&socket);
1856 esl << "mapextended " 1645 esl << "mapextended "
1857 << uint8 (extendedinfos) 1646 << uint8 (extendedinfos)
1858 << uint8 (eentrysize); 1647 << uint8 (eentrysize);
1648
1859 estartlen = esl.len; 1649 estartlen = esl.length ();
1860 } 1650 }
1861 else 1651 else
1862 { 1652 {
1863 /* suppress compiler warnings */ 1653 /* suppress compiler warnings */
1864 ewhatstart = 0; 1654 ewhatstart = 0;
… …
1889 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) 1679 for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++)
1890 { 1680 {
1891 ax = 0; 1681 ax = 0;
1892 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) 1682 for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++)
1893 { 1683 {
1894
1895 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1684 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1896 1685
1897 /* If this space is out of the normal viewable area, we only check 1686 /* If this space is out of the normal viewable area, we only check
1898 * the heads value ax or ay will only be greater than what 1687 * the heads value ax or ay will only be greater than what
1899 * the client wants if using the map1a command - this is because 1688 * the client wants if using the map1a command - this is because
… …
1902 */ 1691 */
1903 if (ax >= socket.mapx || ay >= socket.mapy) 1692 if (ax >= socket.mapx || ay >= socket.mapy)
1904 { 1693 {
1905 int i, got_one; 1694 int i, got_one;
1906 1695
1907 oldlen = sl.len; 1696 oldlen = sl.length ();
1908 1697
1909 sl << uint16 (mask); 1698 sl << uint16 (mask);
1910 1699
1911 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4; 1700 if (check_head (sl, socket, ax, ay, 2)) mask |= 0x4;
1912 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2; 1701 if (check_head (sl, socket, ax, ay, 1)) mask |= 0x2;
… …
1916 * actually need to send that - just the coordinates 1705 * actually need to send that - just the coordinates
1917 * with no faces tells the client to blank out the 1706 * with no faces tells the client to blank out the
1918 * space. 1707 * space.
1919 */ 1708 */
1920 got_one = 0; 1709 got_one = 0;
1921 for (i = oldlen + 2; i < sl.len; i++) 1710 for (i = oldlen + 2; i < sl.length (); i++)
1922 if (sl.buf[i]) 1711 if (sl[i])
1923 got_one = 1; 1712 got_one = 1;
1924 1713
1925 if (got_one && (mask & 0xf)) 1714 if (got_one && (mask & 0xf))
1926 sl.buf[oldlen + 1] = mask & 0xff; 1715 sl[oldlen + 1] = mask & 0xff;
1927 else 1716 else
1928 { /*either all faces blank, either no face at all */ 1717 { /*either all faces blank, either no face at all */
1929 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */ 1718 if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates */
1930 sl.len = oldlen + 2; 1719 sl.reset (oldlen + 2);
1931 else 1720 else
1932 sl.len = oldlen; 1721 sl.reset (oldlen);
1933 } 1722 }
1934 1723
1935 /*What concerns extendinfos, nothing to be done for now 1724 /*What concerns extendinfos, nothing to be done for now
1936 * (perhaps effects layer later) 1725 * (perhaps effects layer later)
1937 */ 1726 */
… …
1961 map_clearcell (&lastcell, 0, 0, 0, -1); 1750 map_clearcell (&lastcell, 0, 0, 0, -1);
1962 } 1751 }
1963 } 1752 }
1964 else if (d > 3) 1753 else if (d > 3)
1965 { 1754 {
1755 m->touch ();
1756
1966 int need_send = 0, count; 1757 int need_send = 0, count;
1967 1758
1968 /* This block deals with spaces that are not visible for whatever 1759 /* This block deals with spaces that are not visible for whatever
1969 * reason. Still may need to send the head for this space. 1760 * reason. Still may need to send the head for this space.
1970 */ 1761 */
1971 1762
1972 oldlen = sl.len; 1763 oldlen = sl.length ();
1973 1764
1974 sl << uint16 (mask); 1765 sl << uint16 (mask);
1975 1766
1976 if (lastcell.count != -1) 1767 if (lastcell.count != -1)
1977 need_send = 1; 1768 need_send = 1;
… …
1997 1788
1998 map_clearcell (&lastcell, 0, 0, 0, count); 1789 map_clearcell (&lastcell, 0, 0, 0, count);
1999 } 1790 }
2000 1791
2001 if ((mask & 0xf) || need_send) 1792 if ((mask & 0xf) || need_send)
2002 sl.buf[oldlen + 1] = mask & 0xff; 1793 sl[oldlen + 1] = mask & 0xff;
2003 else 1794 else
2004 sl.len = oldlen; 1795 sl.reset (oldlen);
2005 } 1796 }
2006 else 1797 else
2007 { 1798 {
1799 m->touch ();
1800
2008 /* In this block, the space is visible or there are head objects 1801 /* In this block, the space is visible or there are head objects
2009 * we need to send. 1802 * we need to send.
2010 */ 1803 */
2011 1804
2012 /* Rather than try to figure out what everything that we might 1805 /* Rather than try to figure out what everything that we might
2013 * need to send is, then form the packet after that, 1806 * need to send is, then form the packet after that,
2014 * we presume that we will in fact form a packet, and update 1807 * we presume that we will in fact form a packet, and update
2015 * the bits by what we do actually send. If we send nothing, 1808 * the bits by what we do actually send. If we send nothing,
2016 * we just back out sl.len to the old value, and no harm 1809 * we just back out sl.length () to the old value, and no harm
2017 * is done. 1810 * is done.
2018 * I think this is simpler than doing a bunch of checks to see 1811 * I think this is simpler than doing a bunch of checks to see
2019 * what if anything we need to send, setting the bits, then 1812 * what if anything we need to send, setting the bits, then
2020 * doing those checks again to add the real data. 1813 * doing those checks again to add the real data.
2021 */ 1814 */
2022 oldlen = sl.len; 1815 oldlen = sl.length ();
2023 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1816 mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2024 eoldlen = esl.len; 1817 eoldlen = esl.length ();
2025 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1818 emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
2026 sl << uint16 (mask); 1819 sl << uint16 (mask);
2027 1820
2028 if (socket.ext_mapinfos) 1821 if (socket.ext_mapinfos)
2029 esl << uint16 (emask); 1822 esl << uint16 (emask);
… …
2037 mask |= 0x8; 1830 mask |= 0x8;
2038 1831
2039 if (socket.extmap) 1832 if (socket.extmap)
2040 { 1833 {
2041 *last_ext |= 0x80; 1834 *last_ext |= 0x80;
2042 last_ext = sl.buf + sl.len; 1835 last_ext = &sl[sl.length ()];
2043 sl << uint8 (d); 1836 sl << uint8 (d);
2044 } 1837 }
2045 else 1838 else
2046 sl << uint8 (255 - 64 * d); 1839 sl << uint8 (255 - 64 * d);
2047 } 1840 }
… …
2081 { 1874 {
2082 lastcell.stat_hp = stat_hp; 1875 lastcell.stat_hp = stat_hp;
2083 1876
2084 mask |= 0x8; 1877 mask |= 0x8;
2085 *last_ext |= 0x80; 1878 *last_ext |= 0x80;
2086 last_ext = sl.buf + sl.len; 1879 last_ext = &sl[sl.length ()];
2087 1880
2088 sl << uint8 (5) << uint8 (stat_hp); 1881 sl << uint8 (5) << uint8 (stat_hp);
2089 1882
2090 if (stat_width > 1) 1883 if (stat_width > 1)
2091 { 1884 {
2092 *last_ext |= 0x80; 1885 *last_ext |= 0x80;
2093 last_ext = sl.buf + sl.len; 1886 last_ext = &sl[sl.length ()];
2094 1887
2095 sl << uint8 (6) << uint8 (stat_width); 1888 sl << uint8 (6) << uint8 (stat_width);
2096 } 1889 }
2097 } 1890 }
2098 1891
… …
2100 { 1893 {
2101 lastcell.player = player; 1894 lastcell.player = player;
2102 1895
2103 mask |= 0x8; 1896 mask |= 0x8;
2104 *last_ext |= 0x80; 1897 *last_ext |= 0x80;
2105 last_ext = sl.buf + sl.len; 1898 last_ext = &sl[sl.length ()];
2106 1899
2107 sl << uint8 (0x47) << uint8 (8) << (uint64)player; 1900 sl << uint8 (0x47) << uint8 (8) << (uint64)player;
2108 } 1901 }
2109 1902
2110 if (lastcell.flags != flags) 1903 if (lastcell.flags != flags)
2111 { 1904 {
2112 lastcell.flags = flags; 1905 lastcell.flags = flags;
2113 1906
2114 mask |= 0x8; 1907 mask |= 0x8;
2115 *last_ext |= 0x80; 1908 *last_ext |= 0x80;
2116 last_ext = sl.buf + sl.len; 1909 last_ext = &sl[sl.length ()];
2117 1910
2118 sl << uint8 (8) << uint8 (flags); 1911 sl << uint8 (8) << uint8 (flags);
2119 } 1912 }
2120 } 1913 }
2121 1914
… …
2163 * space by checking the mask. If so, update the mask. 1956 * space by checking the mask. If so, update the mask.
2164 * if not, reset the len to that from before adding the mask 1957 * if not, reset the len to that from before adding the mask
2165 * value, so we don't send those bits. 1958 * value, so we don't send those bits.
2166 */ 1959 */
2167 if (mask & 0xf) 1960 if (mask & 0xf)
2168 sl.buf[oldlen + 1] = mask & 0xff; 1961 sl[oldlen + 1] = mask & 0xff;
2169 else 1962 else
2170 sl.len = oldlen; 1963 sl.reset (oldlen);
2171 1964
2172 if (emask & 0xf) 1965 if (emask & 0xf)
2173 esl.buf[eoldlen + 1] = emask & 0xff; 1966 esl[eoldlen + 1] = emask & 0xff;
2174 else 1967 else
2175 esl.len = eoldlen; 1968 esl.reset (eoldlen);
2176 } /* else this is a viewable space */ 1969 } /* else this is a viewable space */
2177 } /* for x loop */ 1970 } /* for x loop */
2178 } /* for y loop */ 1971 } /* for y loop */
2179 1972
2180 /* Verify that we in fact do need to send this */ 1973 /* Verify that we in fact do need to send this */
2181 if (socket.ext_mapinfos) 1974 if (socket.ext_mapinfos)
2182 { 1975 {
2183 if (!(sl.len > startlen || socket.sent_scroll)) 1976 if (!(sl.length () > startlen || socket.sent_scroll))
2184 { 1977 {
2185 /* No map data will follow, so don't say the client 1978 /* No map data will follow, so don't say the client
2186 * it doesn't need draw! 1979 * it doesn't need draw!
2187 */ 1980 */
2188 ewhatflag &= (~EMI_NOREDRAW); 1981 ewhatflag &= (~EMI_NOREDRAW);
2189 esl.buf[ewhatstart + 1] = ewhatflag & 0xff; 1982 esl[ewhatstart + 1] = ewhatflag & 0xff;
2190 } 1983 }
2191 1984
2192 if (esl.len > estartlen) 1985 if (esl.length () > estartlen)
2193 Send_With_Handling (&socket, &esl); 1986 socket.send_packet (esl);
2194 } 1987 }
2195 1988
2196 if (sl.len > startlen || socket.sent_scroll) 1989 if (sl.length () > startlen || socket.sent_scroll)
2197 { 1990 {
2198 Send_With_Handling (&socket, &sl); 1991 socket.send_packet (sl);
2199 socket.sent_scroll = 0; 1992 socket.sent_scroll = 0;
2200 } 1993 }
2201} 1994}
2202 1995
2203/** 1996/**
… …
2206void 1999void
2207draw_client_map (object *pl) 2000draw_client_map (object *pl)
2208{ 2001{
2209 int i, j; 2002 int i, j;
2210 sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */ 2003 sint16 ax, ay, nx, ny; /* ax and ay goes from 0 to max-size of arrays */
2211 New_Face *face, *floor; 2004 facetile *face, *floor;
2212 New_Face *floor2; 2005 facetile *floor2;
2213 int d, mflags; 2006 int d, mflags;
2214 struct Map newmap; 2007 struct Map newmap;
2215 maptile *m, *pm; 2008 maptile *m, *pm;
2216 2009
2217 if (pl->type != PLAYER) 2010 if (pl->type != PLAYER)
… …
2229 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 2022 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2230 return; 2023 return;
2231 2024
2232 memset (&newmap, 0, sizeof (struct Map)); 2025 memset (&newmap, 0, sizeof (struct Map));
2233 2026
2234 for (j = (pl->y - pl->contr->socket.mapy / 2); j < (pl->y + (pl->contr->socket.mapy + 1) / 2); j++) 2027 for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++)
2235 {
2236 for (i = (pl->x - pl->contr->socket.mapx / 2); i < (pl->x + (pl->contr->socket.mapx + 1) / 2); i++) 2028 for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++)
2237 { 2029 {
2238 ax = i; 2030 ax = i;
2239 ay = j; 2031 ay = j;
2240 m = pm; 2032 m = pm;
2241 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2033 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2034
2242 if (mflags & P_OUT_OF_MAP) 2035 if (mflags & P_OUT_OF_MAP)
2243 continue; 2036 continue;
2244 if (mflags & P_NEED_UPDATE) 2037
2245 update_position (m, ax, ay);
2246 /* If a map is visible to the player, we don't want to swap it out 2038 /* If a map is visible to the player, we don't want to swap it out
2247 * just to reload it. This should really call something like 2039 * just to reload it. This should really call something like
2248 * swap_map, but this is much more efficient and 'good enough' 2040 * swap_map, but this is much more efficient and 'good enough'
2249 */ 2041 */
2250 if (mflags & P_NEW_MAP) 2042 if (mflags & P_NEW_MAP)
2251 m->timeout = 50; 2043 m->timeout = 50;
2252 } 2044 }
2253 } 2045
2254 /* do LOS after calls to update_position */ 2046 /* do LOS after calls to update_position */
2255 if (pl->contr->do_los) 2047 if (pl->contr->do_los)
2256 { 2048 {
2257 update_los (pl); 2049 update_los (pl);
2258 pl->contr->do_los = 0; 2050 pl->contr->do_los = 0;
2259 } 2051 }
2260 2052
2261 if (pl->contr->socket.mapmode == Map1Cmd || pl->contr->socket.mapmode == Map1aCmd)
2262 {
2263 /* Big maps need a different drawing mechanism to work */ 2053 /* Big maps need a different drawing mechanism to work */
2264 draw_client_map1 (pl); 2054 draw_client_map1 (pl);
2265 return;
2266 }
2267
2268 if (pl->invisible & (pl->invisible < 50 ? 4 : 1))
2269 {
2270 esrv_map_setbelow (&pl->contr->socket, pl->contr->socket.mapx / 2, pl->contr->socket.mapy / 2, pl->face->number, &newmap);
2271 }
2272
2273 /* j and i are the y and x coordinates of the real map (which is
2274 * basically some number of spaces around the player)
2275 * ax and ay are values from within the viewport (ie, 0, 0 is upper
2276 * left corner) and are thus disconnected from the map values.
2277 * Subtract 1 from the max values so that we properly handle cases where
2278 * player has specified an even map. Otherwise, we try to send them too
2279 * much, ie, if mapx is 10, we would try to send from -5 to 5, which is actually
2280 * 11 spaces. Now, we would send from -5 to 4, which is properly. If mapx is
2281 * odd, this still works fine.
2282 */
2283 ay = 0;
2284 for (j = pl->y - pl->contr->socket.mapy / 2; j <= pl->y + (pl->contr->socket.mapy - 1) / 2; j++, ay++)
2285 {
2286 ax = 0;
2287 for (i = pl->x - pl->contr->socket.mapx / 2; i <= pl->x + (pl->contr->socket.mapx - 1) / 2; i++, ax++)
2288 {
2289
2290 d = pl->contr->blocked_los[ax][ay];
2291 /* note the out_of_map and d>3 checks are both within the same
2292 * negation check.
2293 */
2294 nx = i;
2295 ny = j;
2296 m = get_map_from_coord (pm, &nx, &ny);
2297 if (m && d < 4)
2298 {
2299 face = GET_MAP_FACE (m, nx, ny, 0);
2300 floor2 = GET_MAP_FACE (m, nx, ny, 1);
2301 floor = GET_MAP_FACE (m, nx, ny, 2);
2302
2303 /* If all is blank, send a blank face. */
2304 if ((!face || face == blank_face) && (!floor2 || floor2 == blank_face) && (!floor || floor == blank_face))
2305 {
2306 esrv_map_setbelow (&pl->contr->socket, ax, ay, blank_face->number, &newmap);
2307 }
2308 else
2309 { /* actually have something interesting */
2310 /* send the darkness mask, if any. */
2311 if (d && pl->contr->socket.darkness)
2312 esrv_map_setbelow (&pl->contr->socket, ax, ay, dark_faces[d - 1]->number, &newmap);
2313
2314 if (face && face != blank_face)
2315 esrv_map_setbelow (&pl->contr->socket, ax, ay, face->number, &newmap);
2316 if (floor2 && floor2 != blank_face)
2317 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor2->number, &newmap);
2318 if (floor && floor != blank_face)
2319 esrv_map_setbelow (&pl->contr->socket, ax, ay, floor->number, &newmap);
2320 }
2321 } /* Is a valid space */
2322 }
2323 }
2324
2325 esrv_map_doneredraw (&pl->contr->socket, &newmap);
2326
2327 check_map_change (pl->contr);
2328} 2055}
2329 2056
2330 2057
2331/*****************************************************************************/ 2058/*****************************************************************************/
2332 2059
… …
2338 2065
2339/*****************************************************************************/ 2066/*****************************************************************************/
2340void 2067void
2341send_plugin_custom_message (object *pl, char *buf) 2068send_plugin_custom_message (object *pl, char *buf)
2342{ 2069{
2343 pl->contr->socket.send_packet (buf); 2070 pl->contr->ns->send_packet (buf);
2344} 2071}
2345 2072
2346/** 2073/**
2347 * This sends the skill number to name mapping. We ignore 2074 * This sends the skill number to name mapping. We ignore
2348 * the params - we always send the same info no matter what. 2075 * the params - we always send the same info no matter what.
2349 */ 2076 */
2350void 2077void
2351send_skill_info (NewSocket *ns, char *params) 2078send_skill_info (client *ns, char *params)
2352{ 2079{
2353 packet sl; 2080 packet sl;
2354 sl << "replyinfo skill_info\n"; 2081 sl << "replyinfo skill_info\n";
2355 2082
2356 for (int i = 1; i < NUM_SKILLS; i++) 2083 for (int i = 1; i < NUM_SKILLS; i++)
2357 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); 2084 sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]);
2358 2085
2359 if (sl.len >= MAXSOCKBUF) 2086 if (sl.length () >= MAXSOCKBUF)
2360 { 2087 {
2361 LOG (llevError, "Buffer overflow in send_skill_info!\n"); 2088 LOG (llevError, "Buffer overflow in send_skill_info!\n");
2362 fatal (0); 2089 fatal (0);
2363 } 2090 }
2364 2091
2365 Send_With_Handling (ns, &sl); 2092 ns->send_packet (sl);
2366} 2093}
2367 2094
2368/** 2095/**
2369 * This sends the spell path to name mapping. We ignore 2096 * This sends the spell path to name mapping. We ignore
2370 * the params - we always send the same info no matter what. 2097 * the params - we always send the same info no matter what.
2371 */ 2098 */
2372void 2099void
2373send_spell_paths (NewSocket * ns, char *params) 2100send_spell_paths (client * ns, char *params)
2374{ 2101{
2375 packet sl; 2102 packet sl;
2376 2103
2377 sl << "replyinfo spell_paths\n"; 2104 sl << "replyinfo spell_paths\n";
2378 2105
2379 for (int i = 0; i < NRSPELLPATHS; i++) 2106 for (int i = 0; i < NRSPELLPATHS; i++)
2380 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); 2107 sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]);
2381 2108
2382 if (sl.len >= MAXSOCKBUF) 2109 if (sl.length () >= MAXSOCKBUF)
2383 { 2110 {
2384 LOG (llevError, "Buffer overflow in send_spell_paths!\n"); 2111 LOG (llevError, "Buffer overflow in send_spell_paths!\n");
2385 fatal (0); 2112 fatal (0);
2386 } 2113 }
2387 2114
2388 Send_With_Handling (ns, &sl); 2115 ns->send_packet (sl);
2389} 2116}
2390 2117
2391/** 2118/**
2392 * This looks for any spells the player may have that have changed their stats. 2119 * This looks for any spells the player may have that have changed their stats.
2393 * it then sends an updspell packet for each spell that has changed in this way 2120 * it then sends an updspell packet for each spell that has changed in this way
2394 */ 2121 */
2395void 2122void
2396esrv_update_spells (player *pl) 2123esrv_update_spells (player *pl)
2397{ 2124{
2125 if (!pl->ns)
2126 return;
2127
2398 if (!pl->socket.monitor_spells) 2128 if (!pl->ns->monitor_spells)
2399 return; 2129 return;
2400 2130
2401 for (object *spell = pl->ob->inv; spell; spell = spell->below) 2131 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2402 { 2132 {
2403 if (spell->type == SPELL) 2133 if (spell->type == SPELL)
… …
2433 2163
2434 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 2164 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2435 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 2165 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2436 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 2166 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2437 2167
2438 Send_With_Handling (&pl->socket, &sl); 2168 pl->ns->send_packet (sl);
2439 } 2169 }
2440 } 2170 }
2441 } 2171 }
2442} 2172}
2443 2173
2444void 2174void
2445esrv_remove_spell (player *pl, object *spell) 2175esrv_remove_spell (player *pl, object *spell)
2446{ 2176{
2447 if (!pl->socket.monitor_spells) 2177 if (!pl->ns->monitor_spells)
2448 return; 2178 return;
2449 2179
2450 if (!pl || !spell || spell->env != pl->ob) 2180 if (!pl || !spell || spell->env != pl->ob)
2451 { 2181 {
2452 LOG (llevError, "Invalid call to esrv_remove_spell"); 2182 LOG (llevError, "Invalid call to esrv_remove_spell");
2453 return; 2183 return;
2454 } 2184 }
2455 2185
2456 packet sl; 2186 packet sl ("delspell");
2457 2187
2458 sl << "delspell "
2459 << uint32 (spell->count); 2188 sl << uint32 (spell->count);
2460 2189
2461 Send_With_Handling (&pl->socket, &sl); 2190 pl->ns->send_packet (sl);
2462} 2191}
2463 2192
2464/* appends the spell *spell to the Socklist we will send the data to. */ 2193/* appends the spell *spell to the Socklist we will send the data to. */
2465static void 2194static void
2466append_spell (player *pl, packet &sl, object *spell) 2195append_spell (player *pl, packet &sl, object *spell)
… …
2514 { 2243 {
2515 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); 2244 LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player");
2516 return; 2245 return;
2517 } 2246 }
2518 2247
2519 if (!pl->socket.monitor_spells) 2248 if (!pl->ns->monitor_spells)
2520 return; 2249 return;
2521 2250
2522 packet sl; 2251 packet sl ("addspell");
2523
2524 sl << "addspell ";
2525 2252
2526 if (!spell) 2253 if (!spell)
2527 { 2254 {
2528 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2255 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
2529 { 2256 {
… …
2541 * like it will fix this 2268 * like it will fix this
2542 */ 2269 */
2543 if (spell->type != SPELL) 2270 if (spell->type != SPELL)
2544 continue; 2271 continue;
2545 2272
2546 if (sl.len >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) 2273 if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0))))
2547 { 2274 {
2548 Send_With_Handling (&pl->socket, &sl); 2275 pl->ns->send_packet (sl);
2549 strcpy ((char *) sl.buf, "addspell "); 2276
2550 sl.len = strlen ((char *) sl.buf); 2277 sl.reset ();
2278 sl << "addspell ";
2551 } 2279 }
2552 2280
2553 append_spell (pl, sl, spell); 2281 append_spell (pl, sl, spell);
2554 } 2282 }
2555 } 2283 }
… …
2566 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 2294 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2567 fatal (0); 2295 fatal (0);
2568 } 2296 }
2569 2297
2570 /* finally, we can send the packet */ 2298 /* finally, we can send the packet */
2571 Send_With_Handling (&pl->socket, &sl); 2299 pl->ns->send_packet (sl);
2572
2573} 2300}
2574 2301

Diff Legend

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