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.41 by root, Fri Dec 15 19:59:20 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 */ 44 */
47 45
48#include <global.h> 46#include <global.h>
49#include <sproto.h> 47#include <sproto.h>
50 48
… …
86 -1, /* life stealing */ 84 -1, /* life stealing */
87 -1 /* Disease - not fully done yet */ 85 -1 /* Disease - not fully done yet */
88}; 86};
89 87
90static void 88static void
91socket_map_scroll (client * ns, int dx, int dy) 89socket_map_scroll (client *ns, int dx, int dy)
92{ 90{
93 struct Map newmap; 91 struct Map newmap;
94 int x, y, mx, my; 92 int x, y, mx, my;
95 93
96 {
97 packet sl;
98
99 sl.printf ("map_scroll %d %d", dx, dy); 94 ns->send_packet_printf ("map_scroll %d %d", dx, dy);
100 ns->send_packet (sl);
101 }
102 95
103 /* If we are using the Map1aCmd, we may in fact send 96 /* If we are using the Map1aCmd, we may in fact send
104 * head information that is outside the viewable map. 97 * head information that is outside the viewable map.
105 * 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
106 * look for. Removed code to do so - it caused extra 99 * look for. Removed code to do so - it caused extra
… …
146} 139}
147 140
148static void 141static void
149clear_map (player *pl) 142clear_map (player *pl)
150{ 143{
151 client &socket = *pl->socket;
152
153 memset (&socket.lastmap, 0, sizeof (socket.lastmap)); 144 memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap));
154 145
155 if (socket.newmapcmd == 1) 146 if (pl->ns->newmapcmd == 1)
156 socket.send_packet ("newmap"); 147 pl->ns->send_packet ("newmap");
157 148
158 socket.update_look = 1; 149 pl->ns->floorbox_reset ();
159 socket.look_position = 0;
160} 150}
161 151
162/** check for map change and send new map data */ 152/** check for map/region change and send new map data */
163static void 153static void
164check_map_change (player *pl) 154check_map_change (player *pl)
165{ 155{
166 client &socket = *pl->socket; 156 client &socket = *pl->ns;
167 object *ob = pl->ob; 157 object *ob = pl->ob;
168 char buf[MAX_BUF]; /* eauugggh */ 158 char buf[MAX_BUF]; /* eauugggh */
169 159
170 if (socket.current_map != ob->map) 160 if (socket.current_map != ob->map)
171 { 161 {
… …
187 flags |= 4; 177 flags |= 4;
188 if (ob->map->tile_path[3]) 178 if (ob->map->tile_path[3])
189 flags |= 8; 179 flags |= 8;
190 180
191 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",
192 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);
193 } 183 }
194 else 184 else
195 snprintf (buf, MAX_BUF, "mapinfo current"); 185 snprintf (buf, MAX_BUF, "mapinfo current");
196 186
197 socket.send_packet (buf); 187 socket.send_packet (buf);
… …
205 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) 195 if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8))
206 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
207 else 197 else
208 { 198 {
209 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);
210 socket.update_look = 1; 200 socket.floorbox_reset ();
211 socket.look_position = 0;
212 } 201 }
213 } 202 }
214 203
215 socket.current_x = ob->x; 204 socket.current_x = ob->x;
216 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 }
217} 213}
218 214
219/** 215/**
220 * RequestInfo is sort of a meta command. There is some specific 216 * RequestInfo is sort of a meta command. There is some specific
221 * request of information, but we call other functions to provide 217 * request of information, but we call other functions to provide
… …
265{ 261{
266 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); 262 INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len));
267} 263}
268 264
269void 265void
266ExtiCmd (char *buf, int len, client *ns)
267{
268 INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len));
269}
270
271void
270MapInfoCmd (char *buf, int len, player *pl) 272MapInfoCmd (char *buf, int len, player *pl)
271{ 273{
272 // <mapinfo tag spatial tile-path 274 // <mapinfo tag spatial tile-path
273 // >mapinfo tag spatial flags x y w h hash 275 // >mapinfo tag spatial flags x y w h hash
274 276
… …
286 buf += 8; 288 buf += 8;
287 289
288 // initial map and its origin 290 // initial map and its origin
289 maptile *map = pl->ob->map; 291 maptile *map = pl->ob->map;
290 sint16 dx, dy; 292 sint16 dx, dy;
291 int mapx = pl->socket->mapx / 2 - pl->ob->x; 293 int mapx = pl->ns->mapx / 2 - pl->ob->x;
292 int mapy = pl->socket->mapy / 2 - pl->ob->y; 294 int mapy = pl->ns->mapy / 2 - pl->ob->y;
293 int max_distance = 8; // limit maximum path length to something generous 295 int max_distance = 8; // limit maximum path length to something generous
294 296
295 while (*buf && map && max_distance) 297 while (*buf && map && max_distance)
296 { 298 {
297 int dir = *buf++; 299 int dir = *buf++;
298 300
299 switch (dir) 301 switch (dir)
300 { 302 {
301 case '1': 303 case '1':
302 dx = 0; 304 dx = 0;
303 dy = -1; 305 dy = -1;
304 map = get_map_from_coord (map, &dx, &dy); 306 map = map->xy_find (dx, dy);
305 map && (mapy -= map->height); 307 map && (mapy -= map->height);
306 break; 308 break;
307 case '2': 309 case '2':
308 mapx += map->width; 310 mapx += map->width;
309 dx = map->width; 311 dx = map->width;
310 dy = 0; 312 dy = 0;
311 map = get_map_from_coord (map, &dx, &dy); 313 map = map->xy_find (dx, dy);
312 break; 314 break;
313 case '3': 315 case '3':
314 mapy += map->height; 316 mapy += map->height;
315 dx = 0; 317 dx = 0;
316 dy = map->height; 318 dy = map->height;
317 map = get_map_from_coord (map, &dx, &dy); 319 map = map->xy_find (dx, dy);
318 break; 320 break;
319 case '4': 321 case '4':
320 dx = -1; 322 dx = -1;
321 dy = 0; 323 dy = 0;
322 map = get_map_from_coord (map, &dx, &dy); 324 map = map->xy_find (dx, dy);
323 map && (mapx -= map->width); 325 map && (mapx -= map->width);
324 break; 326 break;
325 } 327 }
326 328
327 --max_distance; 329 --max_distance;
328 } 330 }
329 331
… …
340 if (map->tile_path[2]) 342 if (map->tile_path[2])
341 flags |= 4; 343 flags |= 4;
342 if (map->tile_path[3]) 344 if (map->tile_path[3])
343 flags |= 8; 345 flags |= 8;
344 346
345 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);
346 } 348 }
347 else 349 else
348 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); 350 snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token);
349 } 351 }
350 else 352 else
351 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); 353 snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token);
352 354
353 pl->socket->send_packet (bigbuf); 355 pl->ns->send_packet (bigbuf);
354} 356}
355 357
356/** This is the Setup cmd - easy first implementation */ 358/** This is the Setup cmd - easy first implementation */
357void 359void
358SetUp (char *buf, int len, client * ns) 360SetUp (char *buf, int len, client * ns)
… …
405 { 407 {
406 ns->sound = atoi (param); 408 ns->sound = atoi (param);
407 safe_strcat (cmdback, param, &slen, HUGE_BUF); 409 safe_strcat (cmdback, param, &slen, HUGE_BUF);
408 } 410 }
409 else if (!strcmp (cmd, "exp64")) 411 else if (!strcmp (cmd, "exp64"))
410 {
411 ns->exp64 = atoi (param);
412 safe_strcat (cmdback, param, &slen, HUGE_BUF); 412 safe_strcat (cmdback, param, &slen, HUGE_BUF);
413 }
414 else if (!strcmp (cmd, "spellmon")) 413 else if (!strcmp (cmd, "spellmon"))
415 { 414 {
416 ns->monitor_spells = atoi (param); 415 ns->monitor_spells = atoi (param);
417 safe_strcat (cmdback, param, &slen, HUGE_BUF); 416 safe_strcat (cmdback, param, &slen, HUGE_BUF);
418 } 417 }
… …
575 * 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.
576 */ 575 */
577void 576void
578AddMeCmd (char *buf, int len, client * ns) 577AddMeCmd (char *buf, int len, client * ns)
579{ 578{
580 Settings oldsettings; 579 INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len));
581
582 oldsettings = settings;
583 if (ns->status != Ns_Add || add_player (ns))
584 ns->send_packet ("addme_failed");
585 else
586 ns->send_packet ("addme_success");
587
588 settings = oldsettings;
589} 580}
590 581
591/** Reply to ExtendedInfos command */ 582/** Reply to ExtendedInfos command */
592void 583void
593ToggleExtendedInfos (char *buf, int len, client * ns) 584ToggleExtendedInfos (char *buf, int len, client * ns)
… …
710 * 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
711 * 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
712 * client. 703 * client.
713 */ 704 */
714static void 705static void
715SendSmooth (client * ns, uint16 face) 706SendSmooth (client *ns, uint16 face)
716{ 707{
717 uint16 smoothface; 708 uint16 smoothface;
718 709
719 /* 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
720 * again. 711 * again.
… …
730 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) 721 if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE))
731 esrv_send_face (ns, smoothface, 0); 722 esrv_send_face (ns, smoothface, 0);
732 723
733 ns->faces_sent[face] |= NS_FACESENT_SMOOTH; 724 ns->faces_sent[face] |= NS_FACESENT_SMOOTH;
734 725
735 packet sl; 726 packet sl ("smooth");
736 727
737 sl << "smooth "
738 << uint16 (face) 728 sl << uint16 (face)
739 << uint16 (smoothface); 729 << uint16 (smoothface);
740 730
741 ns->send_packet (sl); 731 ns->send_packet (sl);
742} 732}
743 733
744 /** 734 /**
745 * Tells client the picture it has to use 735 * Tells client the picture it has to use
746 * to smooth a picture number given as argument. 736 * to smooth a picture number given as argument.
747 */ 737 */
748void 738void
749AskSmooth (char *buf, int len, client * ns) 739AskSmooth (char *buf, int len, client *ns)
750{ 740{
751 uint16 facenbr; 741 SendSmooth (ns, atoi (buf));
752
753 facenbr = atoi (buf);
754 SendSmooth (ns, facenbr);
755} 742}
756 743
757/** 744/**
758 * 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,
759 * etc.) 746 * etc.)
760 */ 747 */
761void 748void
762PlayerCmd (char *buf, int len, player *pl) 749PlayerCmd (char *buf, int len, player *pl)
763{ 750{
764
765 /* The following should never happen with a proper or honest client.
766 * Therefore, the error message doesn't have to be too clear - if
767 * someone is playing with a hacked/non working client, this gives them
768 * an idea of the problem, but they deserve what they get
769 */
770 if (pl->state != ST_PLAYING)
771 {
772 new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf);
773 return;
774 }
775 /* 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
776 * sent, so check for that also. 752 * sent, so check for that also.
777 */ 753 */
778 if (atoi (buf) || buf[0] == '0') 754 if (atoi (buf) || buf[0] == '0')
779 { 755 {
780 pl->count = atoi ((char *) buf); 756 pl->count = atoi ((char *) buf);
757
781 buf = strchr (buf, ' '); /* advance beyond the numbers */ 758 buf = strchr (buf, ' '); /* advance beyond the numbers */
782 if (!buf) 759 if (!buf)
783 {
784#ifdef ESRV_DEBUG
785 LOG (llevDebug, "PlayerCmd: Got count but no command.\n");
786#endif
787 return; 760 return;
788 } 761
789 buf++; 762 buf++;
790 } 763 }
791 /* This should not happen anymore. */ 764
792 if (pl->ob->speed_left < -1.0)
793 {
794 LOG (llevError, "Player has negative time - shouldn't do command.\n");
795 }
796 /* In c_new.c */
797 execute_newserver_command (pl->ob, (char *) buf); 765 execute_newserver_command (pl->ob, (char *) buf);
766
798 /* Perhaps something better should be done with a left over count. 767 /* Perhaps something better should be done with a left over count.
799 * Cleaning up the input should probably be done first - all actions 768 * Cleaning up the input should probably be done first - all actions
800 * 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
801 * commands. 770 * commands.
802 */ 771 */
803
804 pl->count = 0; 772 pl->count = 0;
805
806} 773}
807 774
808 775
809/** 776/**
810 * 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,
… …
813 * can throttle. 780 * can throttle.
814 */ 781 */
815void 782void
816NewPlayerCmd (char *buf, int len, player *pl) 783NewPlayerCmd (char *buf, int len, player *pl)
817{ 784{
818 int time, repeat;
819 char command[MAX_BUF];
820 int pktlen;
821
822 if (len < 7) 785 if (len <= 6)
823 { 786 {
824 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);
825 return; 788 return;
826 } 789 }
827 790
828 pktlen = net_uint16 ((uint8 *)buf); 791 uint16 cmdid = net_uint16 ((uint8 *)buf);
829 repeat = net_uint32 ((uint8 *)buf + 2); 792 sint32 repeat = net_sint32 ((uint8 *)buf + 2);
830 793
831 /* -1 is special - no repeat, but don't update */ 794 /* -1 is special - no repeat, but don't update */
832 if (repeat != -1) 795 if (repeat != -1)
833 pl->count = repeat; 796 pl->count = repeat;
834 797
835 if ((len - 4) >= MAX_BUF) 798 buf += 6; //len -= 6;
836 len = MAX_BUF - 5;
837 799
838 strncpy ((char *) command, (char *) buf + 6, len - 4);
839 command[len - 4] = 0;
840
841 /* This should not happen anymore. */
842 if (pl->ob->speed_left < -1.0)
843 LOG (llevError, "Player has negative time - shouldn't do command.\n");
844
845 /* In c_new.c */
846 execute_newserver_command (pl->ob, (char *) command); 800 execute_newserver_command (pl->ob, buf);
801
847 /* Perhaps something better should be done with a left over count. 802 /* Perhaps something better should be done with a left over count.
848 * Cleaning up the input should probably be done first - all actions 803 * Cleaning up the input should probably be done first - all actions
849 * 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
850 * commands. 805 * commands.
851 */ 806 */
852 pl->count = 0; 807 pl->count = 0;
853 808
854 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
855 time = MAX_TIME * 100; 811 ? time = MAX_TIME * 100
856 else
857 time = (int) (MAX_TIME / FABS (pl->ob->speed)); 812 : time = (int) (MAX_TIME / fabs (pl->ob->speed));
858 813
859 /* Send confirmation of command execution now */ 814 /* Send confirmation of command execution now */
860 815 packet sl ("comc");
861 packet sl;
862 sl << "comc " << uint16 (pktlen) << uint32 (time); 816 sl << uint16 (cmdid) << uint32 (time);
863 pl->socket->send_packet (sl); 817 pl->ns->send_packet (sl);
864} 818}
865
866 819
867/** This is a reply to a previous query. */ 820/** This is a reply to a previous query. */
868void 821void
869ReplyCmd (char *buf, int len, player *pl) 822ReplyCmd (char *buf, int len, client *ns)
870{ 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
871 /* 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
872 * 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
873 * once all the X11 code is removed from the server. 838 * once all the X11 code is removed from the server.
874 * 839 *
875 * 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
876 * think it was the carriage return that was entered, and the 841 * think it was the carriage return that was entered, and the
877 * function then does not try to do additional input. 842 * function then does not try to do additional input.
878 */ 843 */
879 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); 844 snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf);
880 845
881 /* this avoids any hacking here */ 846 /* this avoids any hacking here */
882 847
883 switch (pl->state) 848 switch (ns->state)
884 { 849 {
885 case ST_PLAYING: 850 case ST_PLAYING:
886 LOG (llevError, "Got reply message with ST_PLAYING input state\n"); 851 LOG (llevError, "Got reply message with ST_PLAYING input state\n");
887 break; 852 break;
888 853
889 case ST_PLAY_AGAIN:
890 /* We can check this for return value (2==quit). Maybe we
891 * should, and do something appropriate?
892 */
893 receive_play_again (pl->ob, buf[0]);
894 break;
895
896 case ST_ROLL_STAT:
897 key_roll_stat (pl->ob, buf[0]);
898 break;
899
900 case ST_CHANGE_CLASS: 854 case ST_CHANGE_CLASS:
901
902 key_change_class (pl->ob, buf[0]); 855 key_change_class (pl->ob, buf[0]);
903 break; 856 break;
904 857
905 case ST_CONFIRM_QUIT:
906 key_confirm_quit (pl->ob, buf[0]);
907 break;
908
909 case ST_CONFIGURE:
910 LOG (llevError, "In client input handling, but into configure state\n");
911 pl->state = ST_PLAYING;
912 break;
913
914 case ST_GET_NAME:
915 receive_player_name (pl->ob, 13);
916 break;
917
918 case ST_GET_PASSWORD:
919 case ST_CONFIRM_PASSWORD:
920 receive_player_password (pl->ob, 13);
921 break;
922
923 case ST_GET_PARTY_PASSWORD: /* Get password for party */ 858 case ST_GET_PARTY_PASSWORD: /* Get password for party */
924 receive_party_password (pl->ob, 13); 859 receive_party_password (pl->ob, 13);
925 break; 860 break;
926 861
927 default: 862 default:
928 LOG (llevError, "Unknown input state: %d\n", pl->state); 863 LOG (llevError, "Unknown input state: %d\n", ns->state);
929 } 864 }
930} 865}
931 866
932/** 867/**
933 * 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
… …
937 * problem. 872 * problem.
938 */ 873 */
939void 874void
940VersionCmd (char *buf, int len, client * ns) 875VersionCmd (char *buf, int len, client * ns)
941{ 876{
942 char *cp;
943 char version_warning[256];
944
945 if (!buf) 877 if (!buf)
946 { 878 {
947 LOG (llevError, "CS: received corrupted version command\n"); 879 LOG (llevError, "CS: received corrupted version command\n");
948 return; 880 return;
949 } 881 }
950 882
951 ns->cs_version = atoi (buf); 883 ns->cs_version = atoi (buf);
952 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
953 if (VERSION_CS != ns->cs_version) 891 //if (VERSION_CS != ns->cs_version)
954 { 892 // unchecked;
955#ifdef ESRV_DEBUG 893
956 LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version);
957#endif
958 }
959 cp = strchr (buf + 1, ' '); 894 char *cp = strchr (buf + 1, ' ');
960 if (!cp) 895 if (!cp)
961 return; 896 return;
897
962 ns->sc_version = atoi (cp); 898 ns->sc_version = atoi (cp);
899
963 if (VERSION_SC != ns->sc_version) 900 //if (VERSION_SC != ns->sc_version)
964 { 901 // unchecked;
965#ifdef ESRV_DEBUG 902
966 LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version);
967#endif
968 }
969 cp = strchr (cp + 1, ' '); 903 cp = strchr (cp + 1, ' ');
904
970 if (cp) 905 if (cp)
971 { 906 {
972 LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host);
973
974 assign (ns->version, cp + 1); 907 assign (ns->version, cp + 1);
975 908
976 if (ns->sc_version < 1026) 909 if (ns->sc_version < 1026)
977 { 910 ns->send_packet_printf ("drawinfo %d %s", NDI_RED,
978 sprintf (version_warning, "drawinfo %d %s", NDI_RED,
979 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); 911 "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****");
980 ns->send_packet (version_warning);
981 }
982
983 } 912 }
984} 913}
985 914
986/** sound related functions. */ 915/** sound related functions. */
987void 916void
… …
989{ 918{
990 ns->sound = atoi (buf); 919 ns->sound = atoi (buf);
991} 920}
992 921
993/** client wants the map resent */ 922/** client wants the map resent */
994
995void 923void
996MapRedrawCmd (char *buf, int len, player *pl) 924MapRedrawCmd (char *buf, int len, player *pl)
997{ 925{
998
999/* 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
1000 * 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.
1001 * Unfortunately this solution does not work because some client versions send 928 * Unfortunately this solution does not work because some client versions send
1002 * a mapredraw command after receiving a newmap command. 929 * a mapredraw command after receiving a newmap command.
1003 */ 930 */
1004#if 0
1005 /* Okay, this is MAJOR UGLY. but the only way I know how to
1006 * clear the "cache"
1007 */
1008 memset (&pl->socket->lastmap, 0, sizeof (struct Map));
1009 draw_client_map (pl->ob);
1010#endif
1011} 931}
1012 932
1013/** 933/**
1014 * Moves an object (typically, container to inventory). 934 * Moves an object (typically, container to inventory).
1015 * syntax is: move (to) (tag) (nrof) 935 * syntax is: move (to) (tag) (nrof)
… …
1018MoveCmd (char *buf, int len, player *pl) 938MoveCmd (char *buf, int len, player *pl)
1019{ 939{
1020 int vals[3], i; 940 int vals[3], i;
1021 941
1022 /* A little funky here. We only cycle for 2 records, because 942 /* A little funky here. We only cycle for 2 records, because
1023 * 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
1024 * record. Perhaps we should just replace this with a 944 * record. Perhaps we should just replace this with a
1025 * sscanf? 945 * sscanf?
1026 */ 946 */
1027 for (i = 0; i < 2; i++) 947 for (i = 0; i < 2; i++)
1028 { 948 {
1029 vals[i] = atoi (buf); 949 vals[i] = atoi (buf);
950
1030 if (!(buf = strchr (buf, ' '))) 951 if (!(buf = strchr (buf, ' ')))
1031 { 952 {
1032 LOG (llevError, "Incomplete move command: %s\n", buf); 953 LOG (llevError, "Incomplete move command: %s\n", buf);
1033 return; 954 return;
1034 } 955 }
956
1035 buf++; 957 buf++;
1036 } 958 }
959
1037 vals[2] = atoi (buf); 960 vals[2] = atoi (buf);
1038 961
1039/* 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]);*/
1040 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); 963 esrv_move_object (pl->ob, vals[0], vals[1], vals[2]);
1041} 964}
1042
1043
1044 965
1045/****************************************************************************** 966/******************************************************************************
1046 * 967 *
1047 * Start of commands the server sends to the client. 968 * Start of commands the server sends to the client.
1048 * 969 *
… …
1051/** 972/**
1052 * 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
1053 * 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)
1054 */ 975 */
1055void 976void
1056send_query (client * ns, uint8 flags, char *text) 977send_query (client *ns, uint8 flags, char *text)
1057{ 978{
1058 char buf[MAX_BUF];
1059
1060 sprintf (buf, "query %d %s", flags, text ? text : ""); 979 ns->send_packet_printf ("query %d %s", flags, text ? text : "");
1061 ns->send_packet (buf);
1062} 980}
1063 981
1064#define AddIfInt64(Old,New,Type) if (Old != New) {\ 982#define AddIfInt64(Old,New,Type) if (Old != New) {\
1065 Old = New; \ 983 Old = New; \
1066 sl << uint8 (Type) << uint64 (New); \ 984 sl << uint8 (Type) << uint64 (New); \
… …
1096esrv_update_stats (player *pl) 1014esrv_update_stats (player *pl)
1097{ 1015{
1098 char buf[MAX_BUF]; 1016 char buf[MAX_BUF];
1099 uint16 flags; 1017 uint16 flags;
1100 1018
1101 packet sl; 1019 client *ns = pl->ns;
1102 sl << "stats "; 1020 if (!ns)
1021 return;
1103 1022
1104 if (pl->ob != NULL) 1023 object *ob = pl->ob;
1105 { 1024 if (!ob)
1025 return;
1026
1027 packet sl ("stats");
1028
1106 AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); 1029 AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP);
1107 AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); 1030 AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP);
1108 AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); 1031 AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP);
1109 AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); 1032 AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP);
1110 AddIfShort (pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); 1033 AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE);
1111 AddIfShort (pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); 1034 AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE);
1112 AddIfShort (pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); 1035 AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR);
1113 AddIfShort (pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT);
1114 AddIfShort (pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW);
1115 AddIfShort (pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS);
1116 AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); 1036 AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX);
1117 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);
1118 AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); 1041 AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA);
1119 }
1120 1042
1121 if (pl->socket->exp64)
1122 {
1123 uint8 s;
1124
1125 for (s = 0; s < NUM_SKILLS; s++) 1043 for (int s = 0; s < NUM_SKILLS; s++)
1126 { 1044 if (object *skill = pl->last_skill_ob[s])
1127 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])
1128 { 1046 {
1047 ns->last_skill_exp [s] = skill->stats.exp;
1048
1129 /* Always send along the level if exp changes. This is only 1049 /* Always send along the level if exp changes. This is only
1130 * 1 extra byte, but keeps processing simpler. 1050 * 1 extra byte, but keeps processing simpler.
1131 */ 1051 */
1132 sl << uint8 (s + CS_STAT_SKILLINFO) 1052 sl << uint8 (s + CS_STAT_SKILLINFO)
1133 << uint8 (pl->last_skill_ob[s]->level) 1053 << uint8 (skill->level)
1134 << uint64 (pl->last_skill_ob[s]->stats.exp); 1054 << uint64 (skill->stats.exp);
1135
1136 pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp;
1137 } 1055 }
1138 }
1139 }
1140 1056
1141 if (pl->socket->exp64)
1142 { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } 1057 AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64);
1143 else
1144 { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) }
1145
1146 AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); 1058 AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL);
1147 AddIfShort (pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); 1059 AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC);
1148 AddIfShort (pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); 1060 AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC);
1149 AddIfShort (pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); 1061 AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM);
1150 AddIfFloat (pl->last_speed, pl->ob->speed, CS_STAT_SPEED); 1062 AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED);
1151 AddIfShort (pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD); 1063 AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD);
1152 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);
1153 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
1154 flags = 0; 1067 flags = 0;
1155 1068
1156 if (pl->fire_on) 1069 if (pl->fire_on)
1157 flags |= SF_FIREON; 1070 flags |= SF_FIREON;
1158 1071
1159 if (pl->run_on) 1072 if (pl->run_on)
1160 flags |= SF_RUNON; 1073 flags |= SF_RUNON;
1161 1074
1162 AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); 1075 AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS);
1163 1076
1164 if (pl->socket->sc_version < 1025) 1077 if (ns->sc_version < 1025)
1165 { 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) }
1166 else 1079 else
1167 {
1168 int i;
1169
1170 for (i = 0; i < NROFATTACKS; i++) 1080 for (int i = 0; i < NROFATTACKS; i++)
1171 { 1081 {
1172 /* Skip ones we won't send */ 1082 /* Skip ones we won't send */
1173 if (atnr_cs_stat[i] == -1) 1083 if (atnr_cs_stat[i] == -1)
1174 continue; 1084 continue;
1175 1085
1176 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]);
1177 } 1087 }
1178 }
1179 1088
1180 if (pl->socket->monitor_spells) 1089 if (pl->ns->monitor_spells)
1181 { 1090 {
1182 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);
1183 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);
1184 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);
1185 } 1094 }
1186 1095
1187 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 */
1188 AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE); 1097 AddIfString (ns->stats.range, buf, CS_STAT_RANGE);
1189 set_title (pl->ob, buf); 1098 set_title (ob, buf);
1190 AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE); 1099 AddIfString (ns->stats.title, buf, CS_STAT_TITLE);
1191 1100
1192 /* Only send it away if we have some actual data */ 1101 /* Only send it away if we have some actual data */
1193 if (sl.length () > 6) 1102 if (sl.length () > 6)
1194 pl->socket->send_packet (sl); 1103 ns->send_packet (sl);
1195} 1104}
1196 1105
1197/** 1106/**
1198 * 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.
1199 */ 1108 */
1200void 1109void
1201esrv_new_player (player *pl, uint32 weight) 1110esrv_new_player (player *pl, uint32 weight)
1202{ 1111{
1203 pl->last_weight = weight; 1112 packet sl ("player");
1204
1205 packet sl;
1206 sl << "player ";
1207 1113
1208 sl << uint32 (pl->ob->count) 1114 sl << uint32 (pl->ob->count)
1209 << uint32 (weight) 1115 << uint32 (weight)
1210 << uint32 (pl->ob->face->number) 1116 << uint32 (pl->ob->face->number)
1211 << data8 (pl->ob->name); 1117 << data8 (pl->ob->name);
1212 1118
1119 pl->ns->last_weight = weight;
1213 pl->socket->send_packet (sl); 1120 pl->ns->send_packet (sl);
1214 SET_FLAG (pl->ob, FLAG_CLIENT_SENT); 1121 SET_FLAG (pl->ob, FLAG_CLIENT_SENT);
1215} 1122}
1216 1123
1217/** 1124/**
1218 * Need to send an animation sequence to the client. 1125 * Need to send an animation sequence to the client.
… …
1222 * when the player logs in and picks stuff up. 1129 * when the player logs in and picks stuff up.
1223 */ 1130 */
1224void 1131void
1225esrv_send_animation (client * ns, short anim_num) 1132esrv_send_animation (client * ns, short anim_num)
1226{ 1133{
1227 int i;
1228
1229 /* 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
1230 * 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
1231 * range, it must be a valid animation. 1136 * range, it must be a valid animation.
1232 */ 1137 */
1233 if (anim_num < 0 || anim_num > num_animations) 1138 if (anim_num < 0 || anim_num > num_animations)
1234 { 1139 {
1235 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);
1236 return; 1141 return;
1237 } 1142 }
1238 1143
1239 packet sl; 1144 packet sl ("anim");
1240 1145
1241 sl << "anim "
1242 << uint16 (anim_num) 1146 sl << uint16 (anim_num)
1243 << uint16 (0); /* flags - not used right now */ 1147 << uint16 (0); /* flags - not used right now */
1244 1148
1245 /* 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
1246 * the face itself) down to the client. 1150 * the face itself) down to the client.
1247 */ 1151 */
1248 for (i = 0; i < animations[anim_num].num_animations; i++) 1152 for (int i = 0; i < animations[anim_num].num_animations; i++)
1249 { 1153 {
1250 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))
1251 esrv_send_face (ns, animations[anim_num].faces[i], 0); 1155 esrv_send_face (ns, animations[anim_num].faces[i], 0);
1156
1252 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 */
1253 } 1158 }
1254 1159
1255 ns->send_packet (sl); 1160 ns->send_packet (sl);
1256 1161
… …
1271static void 1176static void
1272esrv_map_setbelow (client * 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)
1273{ 1178{
1274 if (newmap->cells[x][y].count >= MAP_LAYERS) 1179 if (newmap->cells[x][y].count >= MAP_LAYERS)
1275 { 1180 {
1181 //TODO: one or the other, can't both have abort and return, verify and act
1276 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);
1277 return; 1183 return;
1278 abort (); 1184 abort ();
1279 } 1185 }
1280 1186
1281 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; 1187 newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num;
1282 newmap->cells[x][y].count++; 1188 newmap->cells[x][y].count++;
1283 1189
1284 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) 1190 if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE))
1285 esrv_send_face (ns, face_num, 0); 1191 esrv_send_face (ns, face_num, 0);
1286}
1287
1288struct LayerCell
1289{
1290 uint16 xy;
1291 short face;
1292};
1293
1294struct MapLayer
1295{
1296 int count;
1297 struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y];
1298};
1299
1300/** Checkes if map cells have changed */
1301static int
1302mapcellchanged (client * ns, int i, int j, struct Map *newmap)
1303{
1304 int k;
1305
1306 if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count)
1307 return 1;
1308 for (k = 0; k < newmap->cells[i][j].count; k++)
1309 {
1310 if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k])
1311 {
1312 return 1;
1313 }
1314 }
1315 return 0;
1316}
1317
1318/**
1319 * Basically, what this does is pack the data into layers.
1320 * cnum is the client number, cur is the the buffer we put all of
1321 * this data into. we return the end of the data. layers is
1322 * how many layers of data we should back.
1323 */
1324static uint8 *
1325compactlayer (client * ns, unsigned char *cur, int numlayers, struct Map *newmap)
1326{
1327 int x, y, k;
1328 int face;
1329 unsigned char *fcur;
1330 struct MapLayer layers[MAP_LAYERS];
1331
1332 for (k = 0; k < MAP_LAYERS; k++)
1333 layers[k].count = 0;
1334 fcur = cur;
1335 for (x = 0; x < ns->mapx; x++)
1336 {
1337 for (y = 0; y < ns->mapy; y++)
1338 {
1339 if (!mapcellchanged (ns, x, y, newmap))
1340 continue;
1341 if (newmap->cells[x][y].count == 0)
1342 {
1343 *cur = x * ns->mapy + y; /* mark empty space */
1344 cur++;
1345 continue;
1346 }
1347 for (k = 0; k < newmap->cells[x][y].count; k++)
1348 {
1349 layers[k].lcells[layers[k].count].xy = x * ns->mapy + y;
1350 layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k];
1351 layers[k].count++;
1352 }
1353 }
1354 }
1355 /* If no data, return now. */
1356 if (fcur == cur && layers[0].count == 0)
1357 return cur;
1358 *cur = 255; /* mark end of explicitly cleared cells */
1359 cur++;
1360 /* First pack by layers. */
1361 for (k = 0; k < numlayers; k++)
1362 {
1363 if (layers[k].count == 0)
1364 break; /* once a layer is entirely empty, no layer below it can
1365 have anything in it either */
1366 /* Pack by entries in thie layer */
1367 for (x = 0; x < layers[k].count;)
1368 {
1369 fcur = cur;
1370 *cur = layers[k].lcells[x].face >> 8;
1371 cur++;
1372 *cur = layers[k].lcells[x].face & 0xFF;
1373 cur++;
1374 face = layers[k].lcells[x].face;
1375 /* Now, we back the redundant data into 1 byte xy pairings */
1376 for (y = x; y < layers[k].count; y++)
1377 {
1378 if (layers[k].lcells[y].face == face)
1379 {
1380 *cur = (uint8) layers[k].lcells[y].xy;
1381 cur++;
1382 layers[k].lcells[y].face = -1;
1383 }
1384 }
1385 *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */
1386 /* forward over the now redundant data */
1387 while (x < layers[k].count && layers[k].lcells[x].face == -1)
1388 x++;
1389 }
1390 *fcur = *fcur | 128; /* mark for end of faces at this layer */
1391 }
1392 return cur;
1393} 1192}
1394 1193
1395/** Clears a map cell */ 1194/** Clears a map cell */
1396static void 1195static void
1397map_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)
… …
1409#define MAX_LAYERS 3 1208#define MAX_LAYERS 3
1410 1209
1411/* 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
1412 * 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,
1413 * 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
1414 * 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
1415 * re-examined. 1214 * re-examined.
1416 */ 1215 */
1417
1418static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; 1216static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS];
1419 1217
1420/** 1218/**
1421 * Returns true if any of the heads for this 1219 * Returns true if any of the heads for this
1422 * 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
1423 * for empty space checking. 1221 * for empty space checking.
1424 */ 1222 */
1425static inline int 1223static inline int
1426have_head (int ax, int ay) 1224have_head (int ax, int ay)
1427{ 1225{
1428
1429 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || 1226 if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] ||
1430 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])
1431 return 1; 1228 return 1;
1229
1432 return 0; 1230 return 0;
1433} 1231}
1434 1232
1435/** 1233/**
1436 * check_head is a bit simplistic version of update_space below. 1234 * check_head is a bit simplistic version of update_space below.
1437 * 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
1438 * 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
1439 * 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
1440 * sent, it returns zero. 1238 * sent, it returns zero.
1441 */ 1239 */
1442static int 1240static int
1443check_head (packet &sl, client &ns, int ax, int ay, int layer) 1241check_head (packet &sl, client &ns, int ax, int ay, int layer)
1444{ 1242{
… …
1480 * numbers the spaces differently - I think this was a leftover from 1278 * numbers the spaces differently - I think this was a leftover from
1481 * 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
1482 * 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
1483 * actually match. 1281 * actually match.
1484 */ 1282 */
1485
1486static int 1283static int
1487update_space (packet &sl, client &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)
1488{ 1285{
1489 object *ob, *head; 1286 object *ob, *head;
1490 uint16 face_num; 1287 uint16 face_num;
… …
1715 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); 1512 ob = GET_MAP_FACE_OBJ (mp, mx, my, layer);
1716 1513
1717 /* 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
1718 * is the blank face, set the smoothlevel to zero. 1515 * is the blank face, set the smoothlevel to zero.
1719 */ 1516 */
1720 if (!ob || ob->face == blank_face || MAP_NOSMOOTH (mp)) 1517 if (!ob || ob->face == blank_face)
1721 smoothlevel = 0; 1518 smoothlevel = 0;
1722 else 1519 else
1723 { 1520 {
1724 smoothlevel = ob->smoothlevel; 1521 smoothlevel = ob->smoothlevel;
1725 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH)) 1522 if (smoothlevel && !(ns.faces_sent[ob->face->number] & NS_FACESENT_SMOOTH))
… …
1758 if (ns->ext_mapinfos) 1555 if (ns->ext_mapinfos)
1759 { 1556 {
1760 if (ns->EMI_smooth) 1557 if (ns->EMI_smooth)
1761 result += 1; /*One byte for smoothlevel */ 1558 result += 1; /*One byte for smoothlevel */
1762 } 1559 }
1560
1763 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);
1764} 1584}
1765 1585
1766/** 1586/**
1767 * 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
1768 * 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
… …
1774 * 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
1775 * 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,
1776 * 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
1777 * of what we send, see the doc/Protocol file. 1597 * of what we send, see the doc/Protocol file.
1778 * I will describe internally what we do: 1598 * I will describe internally what we do:
1779 * 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.
1780 * 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
1781 * maximum viewable size (As set in config.h). 1601 * maximum viewable size (As set in config.h).
1782 * in the cells, there are faces and a count value. 1602 * in the cells, there are faces and a count value.
1783 * 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
1784 * is not viewable. 1604 * is not viewable.
… …
1795 uint8 eentrysize; 1615 uint8 eentrysize;
1796 uint16 ewhatstart, ewhatflag; 1616 uint16 ewhatstart, ewhatflag;
1797 uint8 extendedinfos; 1617 uint8 extendedinfos;
1798 maptile *m; 1618 maptile *m;
1799 1619
1800 client &socket = *pl->contr->socket; 1620 client &socket = *pl->contr->ns;
1621
1622 if (!pl->active)
1623 return;
1801 1624
1802 check_map_change (pl->contr); 1625 check_map_change (pl->contr);
1626 prefetch_surrounding_maps (pl);
1803 1627
1804 packet sl; 1628 packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a");
1805 packet esl; 1629 packet esl;
1806 1630
1807 sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a ");
1808 startlen = sl.length (); 1631 startlen = sl.length ();
1809 1632
1810 /*Extendedmapinfo structure initialisation */ 1633 /*Extendedmapinfo structure initialisation */
1811 if (socket.ext_mapinfos) 1634 if (socket.ext_mapinfos)
1812 { 1635 {
… …
1856 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++)
1857 { 1680 {
1858 ax = 0; 1681 ax = 0;
1859 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++)
1860 { 1683 {
1861
1862 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; 1684 emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4;
1863 1685
1864 /* 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
1865 * 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
1866 * the client wants if using the map1a command - this is because 1688 * the client wants if using the map1a command - this is because
… …
1928 map_clearcell (&lastcell, 0, 0, 0, -1); 1750 map_clearcell (&lastcell, 0, 0, 0, -1);
1929 } 1751 }
1930 } 1752 }
1931 else if (d > 3) 1753 else if (d > 3)
1932 { 1754 {
1755 m->touch ();
1756
1933 int need_send = 0, count; 1757 int need_send = 0, count;
1934 1758
1935 /* This block deals with spaces that are not visible for whatever 1759 /* This block deals with spaces that are not visible for whatever
1936 * reason. Still may need to send the head for this space. 1760 * reason. Still may need to send the head for this space.
1937 */ 1761 */
… …
1970 else 1794 else
1971 sl.reset (oldlen); 1795 sl.reset (oldlen);
1972 } 1796 }
1973 else 1797 else
1974 { 1798 {
1799 m->touch ();
1800
1975 /* 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
1976 * we need to send. 1802 * we need to send.
1977 */ 1803 */
1978 1804
1979 /* Rather than try to figure out what everything that we might 1805 /* Rather than try to figure out what everything that we might
… …
2173void 1999void
2174draw_client_map (object *pl) 2000draw_client_map (object *pl)
2175{ 2001{
2176 int i, j; 2002 int i, j;
2177 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 */
2178 New_Face *face, *floor; 2004 facetile *face, *floor;
2179 New_Face *floor2; 2005 facetile *floor2;
2180 int d, mflags; 2006 int d, mflags;
2181 struct Map newmap; 2007 struct Map newmap;
2182 maptile *m, *pm; 2008 maptile *m, *pm;
2183 2009
2184 if (pl->type != PLAYER) 2010 if (pl->type != PLAYER)
… …
2196 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) 2022 if (pm == NULL || pm->in_memory != MAP_IN_MEMORY)
2197 return; 2023 return;
2198 2024
2199 memset (&newmap, 0, sizeof (struct Map)); 2025 memset (&newmap, 0, sizeof (struct Map));
2200 2026
2201 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++)
2202 {
2203 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++)
2204 { 2029 {
2205 ax = i; 2030 ax = i;
2206 ay = j; 2031 ay = j;
2207 m = pm; 2032 m = pm;
2208 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); 2033 mflags = get_map_flags (m, &m, ax, ay, &ax, &ay);
2034
2209 if (mflags & P_OUT_OF_MAP) 2035 if (mflags & P_OUT_OF_MAP)
2210 continue; 2036 continue;
2211 if (mflags & P_NEED_UPDATE) 2037
2212 update_position (m, ax, ay);
2213 /* 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
2214 * just to reload it. This should really call something like 2039 * just to reload it. This should really call something like
2215 * swap_map, but this is much more efficient and 'good enough' 2040 * swap_map, but this is much more efficient and 'good enough'
2216 */ 2041 */
2217 if (mflags & P_NEW_MAP) 2042 if (mflags & P_NEW_MAP)
2218 m->timeout = 50; 2043 m->timeout = 50;
2219 } 2044 }
2220 } 2045
2221 /* do LOS after calls to update_position */ 2046 /* do LOS after calls to update_position */
2222 if (pl->contr->do_los) 2047 if (pl->contr->do_los)
2223 { 2048 {
2224 update_los (pl); 2049 update_los (pl);
2225 pl->contr->do_los = 0; 2050 pl->contr->do_los = 0;
… …
2240 2065
2241/*****************************************************************************/ 2066/*****************************************************************************/
2242void 2067void
2243send_plugin_custom_message (object *pl, char *buf) 2068send_plugin_custom_message (object *pl, char *buf)
2244{ 2069{
2245 pl->contr->socket->send_packet (buf); 2070 pl->contr->ns->send_packet (buf);
2246} 2071}
2247 2072
2248/** 2073/**
2249 * This sends the skill number to name mapping. We ignore 2074 * This sends the skill number to name mapping. We ignore
2250 * the params - we always send the same info no matter what. 2075 * the params - we always send the same info no matter what.
… …
2295 * 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
2296 */ 2121 */
2297void 2122void
2298esrv_update_spells (player *pl) 2123esrv_update_spells (player *pl)
2299{ 2124{
2125 if (!pl->ns)
2126 return;
2127
2300 if (!pl->socket->monitor_spells) 2128 if (!pl->ns->monitor_spells)
2301 return; 2129 return;
2302 2130
2303 for (object *spell = pl->ob->inv; spell; spell = spell->below) 2131 for (object *spell = pl->ob->inv; spell; spell = spell->below)
2304 { 2132 {
2305 if (spell->type == SPELL) 2133 if (spell->type == SPELL)
… …
2335 2163
2336 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); 2164 if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp);
2337 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); 2165 if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace);
2338 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); 2166 if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat);
2339 2167
2340 pl->socket->send_packet (sl); 2168 pl->ns->send_packet (sl);
2341 } 2169 }
2342 } 2170 }
2343 } 2171 }
2344} 2172}
2345 2173
2346void 2174void
2347esrv_remove_spell (player *pl, object *spell) 2175esrv_remove_spell (player *pl, object *spell)
2348{ 2176{
2349 if (!pl->socket->monitor_spells) 2177 if (!pl->ns->monitor_spells)
2350 return; 2178 return;
2351 2179
2352 if (!pl || !spell || spell->env != pl->ob) 2180 if (!pl || !spell || spell->env != pl->ob)
2353 { 2181 {
2354 LOG (llevError, "Invalid call to esrv_remove_spell"); 2182 LOG (llevError, "Invalid call to esrv_remove_spell");
2355 return; 2183 return;
2356 } 2184 }
2357 2185
2358 packet sl; 2186 packet sl ("delspell");
2359 2187
2360 sl << "delspell "
2361 << uint32 (spell->count); 2188 sl << uint32 (spell->count);
2362 2189
2363 pl->socket->send_packet (sl); 2190 pl->ns->send_packet (sl);
2364} 2191}
2365 2192
2366/* 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. */
2367static void 2194static void
2368append_spell (player *pl, packet &sl, object *spell) 2195append_spell (player *pl, packet &sl, object *spell)
… …
2416 { 2243 {
2417 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");
2418 return; 2245 return;
2419 } 2246 }
2420 2247
2421 if (!pl->socket->monitor_spells) 2248 if (!pl->ns->monitor_spells)
2422 return; 2249 return;
2423 2250
2424 packet sl; 2251 packet sl ("addspell");
2425
2426 sl << "addspell ";
2427 2252
2428 if (!spell) 2253 if (!spell)
2429 { 2254 {
2430 for (spell = pl->ob->inv; spell != NULL; spell = spell->below) 2255 for (spell = pl->ob->inv; spell != NULL; spell = spell->below)
2431 { 2256 {
… …
2445 if (spell->type != SPELL) 2270 if (spell->type != SPELL)
2446 continue; 2271 continue;
2447 2272
2448 if (sl.length () >= (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))))
2449 { 2274 {
2450 pl->socket->send_packet (sl); 2275 pl->ns->send_packet (sl);
2451 2276
2452 sl.reset (); 2277 sl.reset ();
2453 sl << "addspell "; 2278 sl << "addspell ";
2454 } 2279 }
2455 2280
… …
2469 LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); 2294 LOG (llevError, "Buffer overflow in esrv_add_spells!\n");
2470 fatal (0); 2295 fatal (0);
2471 } 2296 }
2472 2297
2473 /* finally, we can send the packet */ 2298 /* finally, we can send the packet */
2474 pl->socket->send_packet (sl); 2299 pl->ns->send_packet (sl);
2475} 2300}
2476 2301

Diff Legend

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