… | |
… | |
38 | * esrv_map_new starts updating the map |
38 | * esrv_map_new starts updating the map |
39 | * |
39 | * |
40 | * esrv_map_setbelow allows filling in all of the faces for the map. |
40 | * esrv_map_setbelow allows filling in all of the faces for the map. |
41 | * if a face has not already been sent to the client, it is sent now. |
41 | * if a face has not already been sent to the client, it is sent now. |
42 | * |
42 | * |
43 | * mapcellchanged, compactlayer, compactstack, perform the map compressing |
|
|
44 | * operations |
|
|
45 | * |
|
|
46 | */ |
43 | */ |
47 | |
44 | |
48 | #include <global.h> |
45 | #include <global.h> |
49 | #include <sproto.h> |
46 | #include <sproto.h> |
50 | |
47 | |
51 | #include <newclient.h> |
|
|
52 | #include <newserver.h> |
|
|
53 | #include <living.h> |
48 | #include <living.h> |
54 | #include <commands.h> |
49 | #include <commands.h> |
55 | |
50 | |
56 | /* This block is basically taken from socket.c - I assume if it works there, |
51 | /* This block is basically taken from socket.c - I assume if it works there, |
57 | * it should work here. |
52 | * it should work here. |
… | |
… | |
88 | -1, /* life stealing */ |
83 | -1, /* life stealing */ |
89 | -1 /* Disease - not fully done yet */ |
84 | -1 /* Disease - not fully done yet */ |
90 | }; |
85 | }; |
91 | |
86 | |
92 | static void |
87 | static void |
93 | socket_map_scroll (client_socket * ns, int dx, int dy) |
88 | socket_map_scroll (client *ns, int dx, int dy) |
94 | { |
89 | { |
95 | struct Map newmap; |
90 | struct Map newmap; |
96 | int x, y, mx, my; |
91 | int x, y, mx, my; |
97 | |
92 | |
98 | { |
|
|
99 | packet sl; |
|
|
100 | |
|
|
101 | sl.printf ("map_scroll %d %d", dx, dy); |
93 | ns->send_packet_printf ("map_scroll %d %d", dx, dy); |
102 | ns->send_packet (sl); |
|
|
103 | } |
|
|
104 | |
94 | |
105 | /* If we are using the Map1aCmd, we may in fact send |
95 | /* If we are using the Map1aCmd, we may in fact send |
106 | * head information that is outside the viewable map. |
96 | * head information that is outside the viewable map. |
107 | * So set the mx,my to the max value we want to |
97 | * So set the mx,my to the max value we want to |
108 | * look for. Removed code to do so - it caused extra |
98 | * look for. Removed code to do so - it caused extra |
… | |
… | |
148 | } |
138 | } |
149 | |
139 | |
150 | static void |
140 | static void |
151 | clear_map (player *pl) |
141 | clear_map (player *pl) |
152 | { |
142 | { |
153 | client_socket &socket = *pl->socket; |
|
|
154 | |
|
|
155 | memset (&socket.lastmap, 0, sizeof (socket.lastmap)); |
143 | memset (&pl->socket->lastmap, 0, sizeof (pl->socket->lastmap)); |
156 | |
144 | |
157 | if (socket.newmapcmd == 1) |
145 | if (pl->socket->newmapcmd == 1) |
158 | socket.send_packet ("newmap"); |
146 | pl->socket->send_packet ("newmap"); |
159 | |
147 | |
160 | socket.update_look = 1; |
148 | pl->socket->floorbox_reset (); |
161 | socket.look_position = 0; |
|
|
162 | } |
149 | } |
163 | |
150 | |
164 | /** check for map change and send new map data */ |
151 | /** check for map change and send new map data */ |
165 | static void |
152 | static void |
166 | check_map_change (player *pl) |
153 | check_map_change (player *pl) |
167 | { |
154 | { |
168 | client_socket &socket = *pl->socket; |
155 | client &socket = *pl->socket; |
169 | object *ob = pl->ob; |
156 | object *ob = pl->ob; |
170 | char buf[MAX_BUF]; /* eauugggh */ |
157 | char buf[MAX_BUF]; /* eauugggh */ |
171 | |
158 | |
172 | if (socket.current_map != ob->map) |
159 | if (socket.current_map != ob->map) |
173 | { |
160 | { |
… | |
… | |
207 | if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
194 | if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
208 | clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
195 | clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
209 | else |
196 | else |
210 | { |
197 | { |
211 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
198 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
212 | socket.update_look = 1; |
199 | socket.floorbox_reset (); |
213 | socket.look_position = 0; |
|
|
214 | } |
200 | } |
215 | } |
201 | } |
216 | |
202 | |
217 | socket.current_x = ob->x; |
203 | socket.current_x = ob->x; |
218 | socket.current_y = ob->y; |
204 | socket.current_y = ob->y; |
219 | } |
205 | } |
220 | |
206 | |
|
|
207 | /** |
|
|
208 | * RequestInfo is sort of a meta command. There is some specific |
|
|
209 | * request of information, but we call other functions to provide |
|
|
210 | * that information. |
|
|
211 | */ |
|
|
212 | void |
|
|
213 | RequestInfo (char *buf, int len, client * ns) |
|
|
214 | { |
|
|
215 | char *params = NULL, *cp; |
|
|
216 | |
|
|
217 | /* No match */ |
|
|
218 | char bigbuf[MAX_BUF]; |
|
|
219 | int slen; |
|
|
220 | |
|
|
221 | /* Set up replyinfo before we modify any of the buffers - this is used |
|
|
222 | * if we don't find a match. |
|
|
223 | */ |
|
|
224 | strcpy (bigbuf, "replyinfo "); |
|
|
225 | slen = strlen (bigbuf); |
|
|
226 | safe_strcat (bigbuf, buf, &slen, MAX_BUF); |
|
|
227 | |
|
|
228 | /* find the first space, make it null, and update the |
|
|
229 | * params pointer. |
|
|
230 | */ |
|
|
231 | for (cp = buf; *cp != '\0'; cp++) |
|
|
232 | if (*cp == ' ') |
|
|
233 | { |
|
|
234 | *cp = '\0'; |
|
|
235 | params = cp + 1; |
|
|
236 | break; |
|
|
237 | } |
|
|
238 | |
|
|
239 | if (!strcmp (buf, "image_info")) |
|
|
240 | send_image_info (ns, params); |
|
|
241 | else if (!strcmp (buf, "image_sums")) |
|
|
242 | send_image_sums (ns, params); |
|
|
243 | else if (!strcmp (buf, "skill_info")) |
|
|
244 | send_skill_info (ns, params); |
|
|
245 | else if (!strcmp (buf, "spell_paths")) |
|
|
246 | send_spell_paths (ns, params); |
|
|
247 | else |
|
|
248 | ns->send_packet (bigbuf, len); |
|
|
249 | } |
|
|
250 | |
221 | void |
251 | void |
222 | ExtCmd (char *buf, int len, player *pl) |
252 | ExtCmd (char *buf, int len, player *pl) |
223 | { |
253 | { |
224 | INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); |
254 | INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); |
|
|
255 | } |
|
|
256 | |
|
|
257 | void |
|
|
258 | ExtiCmd (char *buf, int len, client *ns) |
|
|
259 | { |
|
|
260 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
225 | } |
261 | } |
226 | |
262 | |
227 | void |
263 | void |
228 | MapInfoCmd (char *buf, int len, player *pl) |
264 | MapInfoCmd (char *buf, int len, player *pl) |
229 | { |
265 | { |
… | |
… | |
311 | pl->socket->send_packet (bigbuf); |
347 | pl->socket->send_packet (bigbuf); |
312 | } |
348 | } |
313 | |
349 | |
314 | /** This is the Setup cmd - easy first implementation */ |
350 | /** This is the Setup cmd - easy first implementation */ |
315 | void |
351 | void |
316 | SetUp (char *buf, int len, client_socket * ns) |
352 | SetUp (char *buf, int len, client * ns) |
317 | { |
353 | { |
318 | int s, slen; |
354 | int s, slen; |
319 | char *cmd, *param, cmdback[HUGE_BUF]; |
355 | char *cmd, *param, cmdback[HUGE_BUF]; |
320 | |
356 | |
321 | /* run through the cmds of setup |
357 | /* run through the cmds of setup |
… | |
… | |
531 | * This is what takes care of it. We tell the client how things worked out. |
567 | * This is what takes care of it. We tell the client how things worked out. |
532 | * I am not sure if this file is the best place for this function. however, |
568 | * I am not sure if this file is the best place for this function. however, |
533 | * it either has to be here or init_sockets needs to be exported. |
569 | * it either has to be here or init_sockets needs to be exported. |
534 | */ |
570 | */ |
535 | void |
571 | void |
536 | AddMeCmd (char *buf, int len, client_socket * ns) |
572 | AddMeCmd (char *buf, int len, client * ns) |
537 | { |
573 | { |
538 | Settings oldsettings; |
574 | if (INVOKE_CLIENT (ADDME, ns)) |
|
|
575 | return; |
539 | |
576 | |
540 | oldsettings = settings; |
|
|
541 | if (ns->status != Ns_Add || add_player (ns)) |
577 | if (ns->pl || add_player (ns)) |
542 | ns->send_packet ("addme_failed"); |
578 | ns->send_packet ("addme_failed"); |
543 | else |
579 | else |
544 | ns->send_packet ("addme_success"); |
580 | ns->send_packet ("addme_success"); |
545 | |
|
|
546 | settings = oldsettings; |
|
|
547 | } |
581 | } |
548 | |
582 | |
549 | /** Reply to ExtendedInfos command */ |
583 | /** Reply to ExtendedInfos command */ |
550 | void |
584 | void |
551 | ToggleExtendedInfos (char *buf, int len, client_socket * ns) |
585 | ToggleExtendedInfos (char *buf, int len, client * ns) |
552 | { |
586 | { |
553 | char cmdback[MAX_BUF]; |
587 | char cmdback[MAX_BUF]; |
554 | char command[50]; |
588 | char command[50]; |
555 | int info, nextinfo; |
589 | int info, nextinfo; |
556 | |
590 | |
… | |
… | |
607 | #define MSG_TYPE_MONUMENT 5 |
641 | #define MSG_TYPE_MONUMENT 5 |
608 | #define MSG_TYPE_SCRIPTED_DIALOG 6*/ |
642 | #define MSG_TYPE_SCRIPTED_DIALOG 6*/ |
609 | |
643 | |
610 | /** Reply to ExtendedInfos command */ |
644 | /** Reply to ExtendedInfos command */ |
611 | void |
645 | void |
612 | ToggleExtendedText (char *buf, int len, client_socket * ns) |
646 | ToggleExtendedText (char *buf, int len, client * ns) |
613 | { |
647 | { |
614 | char cmdback[MAX_BUF]; |
648 | char cmdback[MAX_BUF]; |
615 | char temp[10]; |
649 | char temp[10]; |
616 | char command[50]; |
650 | char command[50]; |
617 | int info, nextinfo, i, flag; |
651 | int info, nextinfo, i, flag; |
… | |
… | |
668 | * a piece of data from us that we know the client wants. So |
702 | * a piece of data from us that we know the client wants. So |
669 | * if we know the client wants it, might as well push it to the |
703 | * if we know the client wants it, might as well push it to the |
670 | * client. |
704 | * client. |
671 | */ |
705 | */ |
672 | static void |
706 | static void |
673 | SendSmooth (client_socket * ns, uint16 face) |
707 | SendSmooth (client *ns, uint16 face) |
674 | { |
708 | { |
675 | uint16 smoothface; |
709 | uint16 smoothface; |
676 | |
710 | |
677 | /* If we can't find a face, return and set it so we won't try to send this |
711 | /* If we can't find a face, return and set it so we won't try to send this |
678 | * again. |
712 | * again. |
… | |
… | |
688 | if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) |
722 | if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) |
689 | esrv_send_face (ns, smoothface, 0); |
723 | esrv_send_face (ns, smoothface, 0); |
690 | |
724 | |
691 | ns->faces_sent[face] |= NS_FACESENT_SMOOTH; |
725 | ns->faces_sent[face] |= NS_FACESENT_SMOOTH; |
692 | |
726 | |
693 | packet sl; |
727 | packet sl ("smooth"); |
694 | |
728 | |
695 | sl << "smooth " |
|
|
696 | << uint16 (face) |
729 | sl << uint16 (face) |
697 | << uint16 (smoothface); |
730 | << uint16 (smoothface); |
698 | |
731 | |
699 | ns->send_packet (sl); |
732 | ns->send_packet (sl); |
700 | } |
733 | } |
701 | |
734 | |
702 | /** |
735 | /** |
703 | * Tells client the picture it has to use |
736 | * Tells client the picture it has to use |
704 | * to smooth a picture number given as argument. |
737 | * to smooth a picture number given as argument. |
705 | */ |
738 | */ |
706 | void |
739 | void |
707 | AskSmooth (char *buf, int len, client_socket * ns) |
740 | AskSmooth (char *buf, int len, client *ns) |
708 | { |
741 | { |
709 | uint16 facenbr; |
742 | SendSmooth (ns, atoi (buf)); |
710 | |
|
|
711 | facenbr = atoi (buf); |
|
|
712 | SendSmooth (ns, facenbr); |
|
|
713 | } |
743 | } |
714 | |
744 | |
715 | /** |
745 | /** |
716 | * This handles the general commands from the client (ie, north, fire, cast, |
746 | * This handles the general commands from the client (ie, north, fire, cast, |
717 | * etc.) |
747 | * etc.) |
718 | */ |
748 | */ |
719 | void |
749 | void |
720 | PlayerCmd (char *buf, int len, player *pl) |
750 | PlayerCmd (char *buf, int len, player *pl) |
721 | { |
751 | { |
722 | |
|
|
723 | /* The following should never happen with a proper or honest client. |
|
|
724 | * Therefore, the error message doesn't have to be too clear - if |
|
|
725 | * someone is playing with a hacked/non working client, this gives them |
|
|
726 | * an idea of the problem, but they deserve what they get |
|
|
727 | */ |
|
|
728 | if (pl->state != ST_PLAYING) |
|
|
729 | { |
|
|
730 | new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf); |
|
|
731 | return; |
|
|
732 | } |
|
|
733 | /* Check if there is a count. In theory, a zero count could also be |
752 | /* Check if there is a count. In theory, a zero count could also be |
734 | * sent, so check for that also. |
753 | * sent, so check for that also. |
735 | */ |
754 | */ |
736 | if (atoi (buf) || buf[0] == '0') |
755 | if (atoi (buf) || buf[0] == '0') |
737 | { |
756 | { |
738 | pl->count = atoi ((char *) buf); |
757 | pl->count = atoi ((char *) buf); |
|
|
758 | |
739 | buf = strchr (buf, ' '); /* advance beyond the numbers */ |
759 | buf = strchr (buf, ' '); /* advance beyond the numbers */ |
740 | if (!buf) |
760 | if (!buf) |
741 | { |
|
|
742 | #ifdef ESRV_DEBUG |
|
|
743 | LOG (llevDebug, "PlayerCmd: Got count but no command.\n"); |
|
|
744 | #endif |
|
|
745 | return; |
761 | return; |
746 | } |
762 | |
747 | buf++; |
763 | buf++; |
748 | } |
764 | } |
749 | /* This should not happen anymore. */ |
765 | |
750 | if (pl->ob->speed_left < -1.0) |
|
|
751 | { |
|
|
752 | LOG (llevError, "Player has negative time - shouldn't do command.\n"); |
|
|
753 | } |
|
|
754 | /* In c_new.c */ |
|
|
755 | execute_newserver_command (pl->ob, (char *) buf); |
766 | execute_newserver_command (pl->ob, (char *) buf); |
|
|
767 | |
756 | /* Perhaps something better should be done with a left over count. |
768 | /* Perhaps something better should be done with a left over count. |
757 | * Cleaning up the input should probably be done first - all actions |
769 | * Cleaning up the input should probably be done first - all actions |
758 | * for the command that issued the count should be done before any other |
770 | * for the command that issued the count should be done before any other |
759 | * commands. |
771 | * commands. |
760 | */ |
772 | */ |
761 | |
|
|
762 | pl->count = 0; |
773 | pl->count = 0; |
763 | |
|
|
764 | } |
774 | } |
765 | |
775 | |
766 | |
776 | |
767 | /** |
777 | /** |
768 | * This handles the general commands from the client (ie, north, fire, cast, |
778 | * This handles the general commands from the client (ie, north, fire, cast, |
… | |
… | |
771 | * can throttle. |
781 | * can throttle. |
772 | */ |
782 | */ |
773 | void |
783 | void |
774 | NewPlayerCmd (char *buf, int len, player *pl) |
784 | NewPlayerCmd (char *buf, int len, player *pl) |
775 | { |
785 | { |
776 | int time, repeat; |
|
|
777 | char command[MAX_BUF]; |
|
|
778 | int pktlen; |
|
|
779 | |
|
|
780 | if (len < 7) |
786 | if (len <= 6) |
781 | { |
787 | { |
782 | LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); |
788 | LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); |
783 | return; |
789 | return; |
784 | } |
790 | } |
785 | |
791 | |
786 | pktlen = net_uint16 ((uint8 *)buf); |
792 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
787 | repeat = net_uint32 ((uint8 *)buf + 2); |
793 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
788 | |
794 | |
789 | /* -1 is special - no repeat, but don't update */ |
795 | /* -1 is special - no repeat, but don't update */ |
790 | if (repeat != -1) |
796 | if (repeat != -1) |
791 | pl->count = repeat; |
797 | pl->count = repeat; |
792 | |
798 | |
793 | if ((len - 4) >= MAX_BUF) |
799 | buf += 6; //len -= 6; |
794 | len = MAX_BUF - 5; |
|
|
795 | |
800 | |
796 | strncpy ((char *) command, (char *) buf + 6, len - 4); |
|
|
797 | command[len - 4] = 0; |
|
|
798 | |
|
|
799 | /* This should not happen anymore. */ |
|
|
800 | if (pl->ob->speed_left < -1.0) |
|
|
801 | LOG (llevError, "Player has negative time - shouldn't do command.\n"); |
|
|
802 | |
|
|
803 | /* In c_new.c */ |
|
|
804 | execute_newserver_command (pl->ob, (char *) command); |
801 | execute_newserver_command (pl->ob, buf); |
|
|
802 | |
805 | /* Perhaps something better should be done with a left over count. |
803 | /* Perhaps something better should be done with a left over count. |
806 | * Cleaning up the input should probably be done first - all actions |
804 | * Cleaning up the input should probably be done first - all actions |
807 | * for the command that issued the count should be done before any other |
805 | * for the command that issued the count should be done before any other |
808 | * commands. |
806 | * commands. |
809 | */ |
807 | */ |
810 | pl->count = 0; |
808 | pl->count = 0; |
811 | |
809 | |
|
|
810 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
812 | if (FABS (pl->ob->speed) < 0.001) |
811 | int time = FABS (pl->ob->speed) < 0.001 |
813 | time = MAX_TIME * 100; |
812 | ? time = MAX_TIME * 100 |
814 | else |
|
|
815 | time = (int) (MAX_TIME / FABS (pl->ob->speed)); |
813 | : time = (int) (MAX_TIME / FABS (pl->ob->speed)); |
816 | |
814 | |
817 | /* Send confirmation of command execution now */ |
815 | /* Send confirmation of command execution now */ |
818 | |
816 | packet sl ("comc"); |
819 | packet sl; |
|
|
820 | sl << "comc " << uint16 (pktlen) << uint32 (time); |
817 | sl << uint16 (cmdid) << uint32 (time); |
821 | pl->socket->send_packet (sl); |
818 | pl->socket->send_packet (sl); |
822 | } |
819 | } |
823 | |
820 | |
824 | |
|
|
825 | /** This is a reply to a previous query. */ |
821 | /** This is a reply to a previous query. */ |
826 | void |
822 | void |
827 | ReplyCmd (char *buf, int len, player *pl) |
823 | ReplyCmd (char *buf, int len, client *ns) |
828 | { |
824 | { |
|
|
825 | if (!ns->pl) |
|
|
826 | return; //TODO: depends on the exact reply we are after |
|
|
827 | //TODO: but right now, we always have a ns->pl |
|
|
828 | |
|
|
829 | player *pl = ns->pl; |
|
|
830 | |
829 | /* This is to synthesize how the data would be stored if it |
831 | /* This is to synthesize how the data would be stored if it |
830 | * was normally entered. A bit of a hack, and should be cleaned up |
832 | * was normally entered. A bit of a hack, and should be cleaned up |
831 | * once all the X11 code is removed from the server. |
833 | * once all the X11 code is removed from the server. |
832 | * |
834 | * |
833 | * We pass 13 to many of the functions because this way they |
835 | * We pass 13 to many of the functions because this way they |
834 | * think it was the carriage return that was entered, and the |
836 | * think it was the carriage return that was entered, and the |
835 | * function then does not try to do additional input. |
837 | * function then does not try to do additional input. |
… | |
… | |
838 | |
840 | |
839 | /* this avoids any hacking here */ |
841 | /* this avoids any hacking here */ |
840 | |
842 | |
841 | switch (pl->state) |
843 | switch (pl->state) |
842 | { |
844 | { |
843 | case ST_PLAYING: |
845 | case ST_PLAYING: |
844 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
846 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
845 | break; |
847 | break; |
846 | |
848 | |
847 | case ST_PLAY_AGAIN: |
849 | case ST_PLAY_AGAIN: |
848 | /* We can check this for return value (2==quit). Maybe we |
850 | /* We can check this for return value (2==quit). Maybe we |
849 | * should, and do something appropriate? |
851 | * should, and do something appropriate? |
850 | */ |
852 | */ |
851 | receive_play_again (pl->ob, buf[0]); |
853 | receive_play_again (pl->ob, buf[0]); |
852 | break; |
854 | break; |
853 | |
855 | |
854 | case ST_ROLL_STAT: |
856 | case ST_ROLL_STAT: |
855 | key_roll_stat (pl->ob, buf[0]); |
857 | key_roll_stat (pl->ob, buf[0]); |
856 | break; |
858 | break; |
857 | |
859 | |
858 | case ST_CHANGE_CLASS: |
860 | case ST_CHANGE_CLASS: |
859 | |
|
|
860 | key_change_class (pl->ob, buf[0]); |
861 | key_change_class (pl->ob, buf[0]); |
861 | break; |
862 | break; |
862 | |
863 | |
863 | case ST_CONFIRM_QUIT: |
864 | case ST_CONFIRM_QUIT: |
864 | key_confirm_quit (pl->ob, buf[0]); |
865 | key_confirm_quit (pl->ob, buf[0]); |
865 | break; |
866 | break; |
866 | |
867 | |
867 | case ST_CONFIGURE: |
868 | case ST_CONFIGURE: |
868 | LOG (llevError, "In client input handling, but into configure state\n"); |
869 | LOG (llevError, "In client input handling, but into configure state\n"); |
869 | pl->state = ST_PLAYING; |
870 | pl->state = ST_PLAYING; |
870 | break; |
871 | break; |
871 | |
872 | |
872 | case ST_GET_NAME: |
873 | case ST_GET_NAME: |
873 | receive_player_name (pl->ob, 13); |
874 | receive_player_name (pl->ob, 13); |
874 | break; |
875 | break; |
875 | |
876 | |
876 | case ST_GET_PASSWORD: |
877 | case ST_GET_PASSWORD: |
877 | case ST_CONFIRM_PASSWORD: |
878 | case ST_CONFIRM_PASSWORD: |
878 | receive_player_password (pl->ob, 13); |
879 | receive_player_password (pl->ob, 13); |
879 | break; |
880 | break; |
880 | |
881 | |
881 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
882 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
882 | receive_party_password (pl->ob, 13); |
883 | receive_party_password (pl->ob, 13); |
883 | break; |
884 | break; |
884 | |
885 | |
885 | default: |
886 | default: |
886 | LOG (llevError, "Unknown input state: %d\n", pl->state); |
887 | LOG (llevError, "Unknown input state: %d\n", pl->state); |
887 | } |
888 | } |
888 | } |
889 | } |
889 | |
890 | |
890 | /** |
891 | /** |
891 | * Client tells its version. If there is a mismatch, we close the |
892 | * Client tells its version. If there is a mismatch, we close the |
… | |
… | |
893 | * something older than the server. If we assume the client will be |
894 | * something older than the server. If we assume the client will be |
894 | * backwards compatible, having it be a later version should not be a |
895 | * backwards compatible, having it be a later version should not be a |
895 | * problem. |
896 | * problem. |
896 | */ |
897 | */ |
897 | void |
898 | void |
898 | VersionCmd (char *buf, int len, client_socket * ns) |
899 | VersionCmd (char *buf, int len, client * ns) |
899 | { |
900 | { |
900 | char *cp; |
|
|
901 | char version_warning[256]; |
|
|
902 | |
|
|
903 | if (!buf) |
901 | if (!buf) |
904 | { |
902 | { |
905 | LOG (llevError, "CS: received corrupted version command\n"); |
903 | LOG (llevError, "CS: received corrupted version command\n"); |
906 | return; |
904 | return; |
907 | } |
905 | } |
908 | |
906 | |
909 | ns->cs_version = atoi (buf); |
907 | ns->cs_version = atoi (buf); |
910 | ns->sc_version = ns->cs_version; |
908 | ns->sc_version = ns->cs_version; |
|
|
909 | |
|
|
910 | LOG (llevDebug, "connection from client <%s>\n", buf); |
|
|
911 | |
|
|
912 | |
|
|
913 | //TODO: should log here just for statistics |
|
|
914 | |
911 | if (VERSION_CS != ns->cs_version) |
915 | //if (VERSION_CS != ns->cs_version) |
912 | { |
916 | // unchecked; |
913 | #ifdef ESRV_DEBUG |
917 | |
914 | LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version); |
|
|
915 | #endif |
|
|
916 | } |
|
|
917 | cp = strchr (buf + 1, ' '); |
918 | char *cp = strchr (buf + 1, ' '); |
918 | if (!cp) |
919 | if (!cp) |
919 | return; |
920 | return; |
|
|
921 | |
920 | ns->sc_version = atoi (cp); |
922 | ns->sc_version = atoi (cp); |
|
|
923 | |
921 | if (VERSION_SC != ns->sc_version) |
924 | //if (VERSION_SC != ns->sc_version) |
922 | { |
925 | // unchecked; |
923 | #ifdef ESRV_DEBUG |
926 | |
924 | LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version); |
|
|
925 | #endif |
|
|
926 | } |
|
|
927 | cp = strchr (cp + 1, ' '); |
927 | cp = strchr (cp + 1, ' '); |
|
|
928 | |
928 | if (cp) |
929 | if (cp) |
929 | { |
930 | { |
930 | LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); |
931 | assign (ns->version, cp + 1); |
931 | |
932 | |
932 | snprintf (ns->client, sizeof (ns->client), "%s", cp + 1); |
|
|
933 | |
|
|
934 | /* This is first implementation - i skip all beta DX clients with it |
|
|
935 | * Add later stuff here for other clients |
|
|
936 | */ |
|
|
937 | |
|
|
938 | /* these are old dxclients */ |
|
|
939 | /* Version 1024 added support for singular + plural name values - |
|
|
940 | * requiing this minimal value reduces complexity of that code, and it |
|
|
941 | * has been around for a long time. |
|
|
942 | */ |
|
|
943 | if (ns->sc_version < 1026) |
933 | if (ns->sc_version < 1026) |
944 | { |
934 | ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
945 | sprintf (version_warning, "drawinfo %d %s", NDI_RED, |
|
|
946 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
935 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
947 | ns->send_packet (version_warning); |
|
|
948 | } |
|
|
949 | |
|
|
950 | } |
936 | } |
951 | } |
937 | } |
952 | |
938 | |
953 | /** sound related functions. */ |
939 | /** sound related functions. */ |
954 | |
|
|
955 | void |
940 | void |
956 | SetSound (char *buf, int len, client_socket * ns) |
941 | SetSound (char *buf, int len, client * ns) |
957 | { |
942 | { |
958 | ns->sound = atoi (buf); |
943 | ns->sound = atoi (buf); |
959 | } |
944 | } |
960 | |
945 | |
961 | /** client wants the map resent */ |
946 | /** client wants the map resent */ |
962 | |
947 | |
963 | void |
948 | void |
964 | MapRedrawCmd (char *buf, int len, player *pl) |
949 | MapRedrawCmd (char *buf, int len, player *pl) |
965 | { |
950 | { |
966 | |
|
|
967 | /* This function is currently disabled; just clearing the map state results in |
951 | /* This function is currently disabled; just clearing the map state results in |
968 | * display errors. It should clear the cache and send a newmap command. |
952 | * display errors. It should clear the cache and send a newmap command. |
969 | * Unfortunately this solution does not work because some client versions send |
953 | * Unfortunately this solution does not work because some client versions send |
970 | * a mapredraw command after receiving a newmap command. |
954 | * a mapredraw command after receiving a newmap command. |
971 | */ |
955 | */ |
972 | #if 0 |
|
|
973 | /* Okay, this is MAJOR UGLY. but the only way I know how to |
|
|
974 | * clear the "cache" |
|
|
975 | */ |
|
|
976 | memset (&pl->socket->lastmap, 0, sizeof (struct Map)); |
|
|
977 | draw_client_map (pl->ob); |
|
|
978 | #endif |
|
|
979 | } |
956 | } |
980 | |
957 | |
981 | /** |
958 | /** |
982 | * Moves an object (typically, container to inventory). |
959 | * Moves an object (typically, container to inventory). |
983 | * syntax is: move (to) (tag) (nrof) |
960 | * syntax is: move (to) (tag) (nrof) |
… | |
… | |
986 | MoveCmd (char *buf, int len, player *pl) |
963 | MoveCmd (char *buf, int len, player *pl) |
987 | { |
964 | { |
988 | int vals[3], i; |
965 | int vals[3], i; |
989 | |
966 | |
990 | /* A little funky here. We only cycle for 2 records, because |
967 | /* A little funky here. We only cycle for 2 records, because |
991 | * we obviously am not going to find a space after the third |
968 | * we obviously are not going to find a space after the third |
992 | * record. Perhaps we should just replace this with a |
969 | * record. Perhaps we should just replace this with a |
993 | * sscanf? |
970 | * sscanf? |
994 | */ |
971 | */ |
995 | for (i = 0; i < 2; i++) |
972 | for (i = 0; i < 2; i++) |
996 | { |
973 | { |
997 | vals[i] = atoi (buf); |
974 | vals[i] = atoi (buf); |
|
|
975 | |
998 | if (!(buf = strchr (buf, ' '))) |
976 | if (!(buf = strchr (buf, ' '))) |
999 | { |
977 | { |
1000 | LOG (llevError, "Incomplete move command: %s\n", buf); |
978 | LOG (llevError, "Incomplete move command: %s\n", buf); |
1001 | return; |
979 | return; |
1002 | } |
980 | } |
|
|
981 | |
1003 | buf++; |
982 | buf++; |
1004 | } |
983 | } |
|
|
984 | |
1005 | vals[2] = atoi (buf); |
985 | vals[2] = atoi (buf); |
1006 | |
986 | |
1007 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
987 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
1008 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
988 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
1009 | } |
989 | } |
1010 | |
|
|
1011 | |
|
|
1012 | |
990 | |
1013 | /****************************************************************************** |
991 | /****************************************************************************** |
1014 | * |
992 | * |
1015 | * Start of commands the server sends to the client. |
993 | * Start of commands the server sends to the client. |
1016 | * |
994 | * |
… | |
… | |
1019 | /** |
997 | /** |
1020 | * Asks the client to query the user. This way, the client knows |
998 | * Asks the client to query the user. This way, the client knows |
1021 | * it needs to send something back (vs just printing out a message) |
999 | * it needs to send something back (vs just printing out a message) |
1022 | */ |
1000 | */ |
1023 | void |
1001 | void |
1024 | send_query (client_socket * ns, uint8 flags, char *text) |
1002 | send_query (client *ns, uint8 flags, char *text) |
1025 | { |
1003 | { |
1026 | char buf[MAX_BUF]; |
|
|
1027 | |
|
|
1028 | sprintf (buf, "query %d %s", flags, text ? text : ""); |
1004 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
1029 | ns->send_packet (buf); |
|
|
1030 | } |
1005 | } |
1031 | |
1006 | |
1032 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
1007 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
1033 | Old = New; \ |
1008 | Old = New; \ |
1034 | sl << uint8 (Type) << uint64 (New); \ |
1009 | sl << uint8 (Type) << uint64 (New); \ |
… | |
… | |
1064 | esrv_update_stats (player *pl) |
1039 | esrv_update_stats (player *pl) |
1065 | { |
1040 | { |
1066 | char buf[MAX_BUF]; |
1041 | char buf[MAX_BUF]; |
1067 | uint16 flags; |
1042 | uint16 flags; |
1068 | |
1043 | |
1069 | packet sl; |
1044 | packet sl ("stats"); |
1070 | sl << "stats "; |
|
|
1071 | |
1045 | |
1072 | if (pl->ob != NULL) |
1046 | if (pl->ob) |
1073 | { |
1047 | { |
1074 | AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); |
1048 | AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); |
1075 | AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); |
1049 | AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); |
1076 | AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); |
1050 | AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); |
1077 | AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); |
1051 | AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); |
… | |
… | |
1085 | AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); |
1059 | AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); |
1086 | AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); |
1060 | AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); |
1087 | } |
1061 | } |
1088 | |
1062 | |
1089 | if (pl->socket->exp64) |
1063 | if (pl->socket->exp64) |
1090 | { |
|
|
1091 | uint8 s; |
|
|
1092 | |
|
|
1093 | for (s = 0; s < NUM_SKILLS; s++) |
1064 | for (int s = 0; s < NUM_SKILLS; s++) |
1094 | { |
|
|
1095 | if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) |
1065 | if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) |
1096 | { |
1066 | { |
1097 | /* Always send along the level if exp changes. This is only |
1067 | /* Always send along the level if exp changes. This is only |
1098 | * 1 extra byte, but keeps processing simpler. |
1068 | * 1 extra byte, but keeps processing simpler. |
1099 | */ |
1069 | */ |
1100 | sl << uint8 (s + CS_STAT_SKILLINFO) |
1070 | sl << uint8 (s + CS_STAT_SKILLINFO) |
1101 | << uint8 (pl->last_skill_ob[s]->level) |
1071 | << uint8 (pl->last_skill_ob[s]->level) |
1102 | << uint64 (pl->last_skill_ob[s]->stats.exp); |
1072 | << uint64 (pl->last_skill_ob[s]->stats.exp); |
1103 | |
1073 | |
1104 | pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; |
1074 | pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; |
1105 | } |
1075 | } |
1106 | } |
|
|
1107 | } |
|
|
1108 | |
1076 | |
1109 | if (pl->socket->exp64) |
1077 | if (pl->socket->exp64) |
1110 | { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } |
1078 | { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } |
1111 | else |
1079 | else |
1112 | { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } |
1080 | { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } |
… | |
… | |
1130 | AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); |
1098 | AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); |
1131 | |
1099 | |
1132 | if (pl->socket->sc_version < 1025) |
1100 | if (pl->socket->sc_version < 1025) |
1133 | { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
1101 | { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
1134 | else |
1102 | else |
1135 | { |
|
|
1136 | int i; |
|
|
1137 | |
|
|
1138 | for (i = 0; i < NROFATTACKS; i++) |
1103 | for (int i = 0; i < NROFATTACKS; i++) |
1139 | { |
1104 | { |
1140 | /* Skip ones we won't send */ |
1105 | /* Skip ones we won't send */ |
1141 | if (atnr_cs_stat[i] == -1) |
1106 | if (atnr_cs_stat[i] == -1) |
1142 | continue; |
1107 | continue; |
1143 | |
1108 | |
1144 | AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); |
1109 | AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); |
1145 | } |
1110 | } |
1146 | } |
|
|
1147 | |
1111 | |
1148 | if (pl->socket->monitor_spells) |
1112 | if (pl->socket->monitor_spells) |
1149 | { |
1113 | { |
1150 | AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
1114 | AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
1151 | AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); |
1115 | AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); |
… | |
… | |
1168 | void |
1132 | void |
1169 | esrv_new_player (player *pl, uint32 weight) |
1133 | esrv_new_player (player *pl, uint32 weight) |
1170 | { |
1134 | { |
1171 | pl->last_weight = weight; |
1135 | pl->last_weight = weight; |
1172 | |
1136 | |
1173 | packet sl; |
1137 | packet sl ("player"); |
1174 | sl << "player "; |
|
|
1175 | |
1138 | |
1176 | sl << uint32 (pl->ob->count) |
1139 | sl << uint32 (pl->ob->count) |
1177 | << uint32 (weight) |
1140 | << uint32 (weight) |
1178 | << uint32 (pl->ob->face->number) |
1141 | << uint32 (pl->ob->face->number) |
1179 | << data8 (pl->ob->name); |
1142 | << data8 (pl->ob->name); |
… | |
… | |
1188 | * sent them the face yet (this can become quite costly in terms of |
1151 | * sent them the face yet (this can become quite costly in terms of |
1189 | * how much we are sending - on the other hand, this should only happen |
1152 | * how much we are sending - on the other hand, this should only happen |
1190 | * when the player logs in and picks stuff up. |
1153 | * when the player logs in and picks stuff up. |
1191 | */ |
1154 | */ |
1192 | void |
1155 | void |
1193 | esrv_send_animation (client_socket * ns, short anim_num) |
1156 | esrv_send_animation (client * ns, short anim_num) |
1194 | { |
1157 | { |
1195 | int i; |
|
|
1196 | |
|
|
1197 | /* Do some checking on the anim_num we got. Note that the animations |
1158 | /* Do some checking on the anim_num we got. Note that the animations |
1198 | * are added in contigous order, so if the number is in the valid |
1159 | * are added in contigous order, so if the number is in the valid |
1199 | * range, it must be a valid animation. |
1160 | * range, it must be a valid animation. |
1200 | */ |
1161 | */ |
1201 | if (anim_num < 0 || anim_num > num_animations) |
1162 | if (anim_num < 0 || anim_num > num_animations) |
1202 | { |
1163 | { |
1203 | LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
1164 | LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
1204 | return; |
1165 | return; |
1205 | } |
1166 | } |
1206 | |
1167 | |
1207 | packet sl; |
1168 | packet sl ("anim"); |
1208 | |
1169 | |
1209 | sl << "anim " |
|
|
1210 | << uint16 (anim_num) |
1170 | sl << uint16 (anim_num) |
1211 | << uint16 (0); /* flags - not used right now */ |
1171 | << uint16 (0); /* flags - not used right now */ |
1212 | |
1172 | |
1213 | /* Build up the list of faces. Also, send any information (ie, the |
1173 | /* Build up the list of faces. Also, send any information (ie, the |
1214 | * the face itself) down to the client. |
1174 | * the face itself) down to the client. |
1215 | */ |
1175 | */ |
1216 | for (i = 0; i < animations[anim_num].num_animations; i++) |
1176 | for (int i = 0; i < animations[anim_num].num_animations; i++) |
1217 | { |
1177 | { |
1218 | if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) |
1178 | if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) |
1219 | esrv_send_face (ns, animations[anim_num].faces[i], 0); |
1179 | esrv_send_face (ns, animations[anim_num].faces[i], 0); |
|
|
1180 | |
1220 | sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ |
1181 | sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ |
1221 | } |
1182 | } |
1222 | |
1183 | |
1223 | ns->send_packet (sl); |
1184 | ns->send_packet (sl); |
1224 | |
1185 | |
… | |
… | |
1235 | /** |
1196 | /** |
1236 | * This adds face_num to a map cell at x,y. If the client doesn't have |
1197 | * This adds face_num to a map cell at x,y. If the client doesn't have |
1237 | * the face yet, we will also send it. |
1198 | * the face yet, we will also send it. |
1238 | */ |
1199 | */ |
1239 | static void |
1200 | static void |
1240 | esrv_map_setbelow (client_socket * ns, int x, int y, short face_num, struct Map *newmap) |
1201 | esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap) |
1241 | { |
1202 | { |
1242 | if (newmap->cells[x][y].count >= MAP_LAYERS) |
1203 | if (newmap->cells[x][y].count >= MAP_LAYERS) |
1243 | { |
1204 | { |
|
|
1205 | //TODO: one or the other, can't both have abort and return, verify and act |
1244 | LOG (llevError, "Too many faces in map cell %d %d\n", x, y); |
1206 | LOG (llevError, "Too many faces in map cell %d %d\n", x, y); |
1245 | return; |
1207 | return; |
1246 | abort (); |
1208 | abort (); |
1247 | } |
1209 | } |
1248 | |
1210 | |
1249 | newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; |
1211 | newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; |
1250 | newmap->cells[x][y].count++; |
1212 | newmap->cells[x][y].count++; |
1251 | |
1213 | |
1252 | if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) |
1214 | if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) |
1253 | esrv_send_face (ns, face_num, 0); |
1215 | esrv_send_face (ns, face_num, 0); |
1254 | } |
|
|
1255 | |
|
|
1256 | struct LayerCell |
|
|
1257 | { |
|
|
1258 | uint16 xy; |
|
|
1259 | short face; |
|
|
1260 | }; |
|
|
1261 | |
|
|
1262 | struct MapLayer |
|
|
1263 | { |
|
|
1264 | int count; |
|
|
1265 | struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y]; |
|
|
1266 | }; |
|
|
1267 | |
|
|
1268 | /** Checkes if map cells have changed */ |
|
|
1269 | static int |
|
|
1270 | mapcellchanged (client_socket * ns, int i, int j, struct Map *newmap) |
|
|
1271 | { |
|
|
1272 | int k; |
|
|
1273 | |
|
|
1274 | if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count) |
|
|
1275 | return 1; |
|
|
1276 | for (k = 0; k < newmap->cells[i][j].count; k++) |
|
|
1277 | { |
|
|
1278 | if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k]) |
|
|
1279 | { |
|
|
1280 | return 1; |
|
|
1281 | } |
|
|
1282 | } |
|
|
1283 | return 0; |
|
|
1284 | } |
|
|
1285 | |
|
|
1286 | /** |
|
|
1287 | * Basically, what this does is pack the data into layers. |
|
|
1288 | * cnum is the client number, cur is the the buffer we put all of |
|
|
1289 | * this data into. we return the end of the data. layers is |
|
|
1290 | * how many layers of data we should back. |
|
|
1291 | */ |
|
|
1292 | static uint8 * |
|
|
1293 | compactlayer (client_socket * ns, unsigned char *cur, int numlayers, struct Map *newmap) |
|
|
1294 | { |
|
|
1295 | int x, y, k; |
|
|
1296 | int face; |
|
|
1297 | unsigned char *fcur; |
|
|
1298 | struct MapLayer layers[MAP_LAYERS]; |
|
|
1299 | |
|
|
1300 | for (k = 0; k < MAP_LAYERS; k++) |
|
|
1301 | layers[k].count = 0; |
|
|
1302 | fcur = cur; |
|
|
1303 | for (x = 0; x < ns->mapx; x++) |
|
|
1304 | { |
|
|
1305 | for (y = 0; y < ns->mapy; y++) |
|
|
1306 | { |
|
|
1307 | if (!mapcellchanged (ns, x, y, newmap)) |
|
|
1308 | continue; |
|
|
1309 | if (newmap->cells[x][y].count == 0) |
|
|
1310 | { |
|
|
1311 | *cur = x * ns->mapy + y; /* mark empty space */ |
|
|
1312 | cur++; |
|
|
1313 | continue; |
|
|
1314 | } |
|
|
1315 | for (k = 0; k < newmap->cells[x][y].count; k++) |
|
|
1316 | { |
|
|
1317 | layers[k].lcells[layers[k].count].xy = x * ns->mapy + y; |
|
|
1318 | layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k]; |
|
|
1319 | layers[k].count++; |
|
|
1320 | } |
|
|
1321 | } |
|
|
1322 | } |
|
|
1323 | /* If no data, return now. */ |
|
|
1324 | if (fcur == cur && layers[0].count == 0) |
|
|
1325 | return cur; |
|
|
1326 | *cur = 255; /* mark end of explicitly cleared cells */ |
|
|
1327 | cur++; |
|
|
1328 | /* First pack by layers. */ |
|
|
1329 | for (k = 0; k < numlayers; k++) |
|
|
1330 | { |
|
|
1331 | if (layers[k].count == 0) |
|
|
1332 | break; /* once a layer is entirely empty, no layer below it can |
|
|
1333 | have anything in it either */ |
|
|
1334 | /* Pack by entries in thie layer */ |
|
|
1335 | for (x = 0; x < layers[k].count;) |
|
|
1336 | { |
|
|
1337 | fcur = cur; |
|
|
1338 | *cur = layers[k].lcells[x].face >> 8; |
|
|
1339 | cur++; |
|
|
1340 | *cur = layers[k].lcells[x].face & 0xFF; |
|
|
1341 | cur++; |
|
|
1342 | face = layers[k].lcells[x].face; |
|
|
1343 | /* Now, we back the redundant data into 1 byte xy pairings */ |
|
|
1344 | for (y = x; y < layers[k].count; y++) |
|
|
1345 | { |
|
|
1346 | if (layers[k].lcells[y].face == face) |
|
|
1347 | { |
|
|
1348 | *cur = (uint8) layers[k].lcells[y].xy; |
|
|
1349 | cur++; |
|
|
1350 | layers[k].lcells[y].face = -1; |
|
|
1351 | } |
|
|
1352 | } |
|
|
1353 | *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */ |
|
|
1354 | /* forward over the now redundant data */ |
|
|
1355 | while (x < layers[k].count && layers[k].lcells[x].face == -1) |
|
|
1356 | x++; |
|
|
1357 | } |
|
|
1358 | *fcur = *fcur | 128; /* mark for end of faces at this layer */ |
|
|
1359 | } |
|
|
1360 | return cur; |
|
|
1361 | } |
1216 | } |
1362 | |
1217 | |
1363 | /** Clears a map cell */ |
1218 | /** Clears a map cell */ |
1364 | static void |
1219 | static void |
1365 | map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) |
1220 | map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) |
… | |
… | |
1377 | #define MAX_LAYERS 3 |
1232 | #define MAX_LAYERS 3 |
1378 | |
1233 | |
1379 | /* Using a global really isn't a good approach, but saves the over head of |
1234 | /* Using a global really isn't a good approach, but saves the over head of |
1380 | * allocating and deallocating such a block of data each time run through, |
1235 | * allocating and deallocating such a block of data each time run through, |
1381 | * and saves the space of allocating this in the socket object when we only |
1236 | * and saves the space of allocating this in the socket object when we only |
1382 | * need it for this cycle. If the serve is ever threaded, this needs to be |
1237 | * need it for this cycle. If the server is ever threaded, this needs to be |
1383 | * re-examined. |
1238 | * re-examined. |
1384 | */ |
1239 | */ |
1385 | |
|
|
1386 | static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; |
1240 | static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; |
1387 | |
1241 | |
1388 | /** |
1242 | /** |
1389 | * Returns true if any of the heads for this |
1243 | * Returns true if any of the heads for this |
1390 | * space is set. Returns false if all are blank - this is used |
1244 | * space is set. Returns false if all are blank - this is used |
1391 | * for empty space checking. |
1245 | * for empty space checking. |
1392 | */ |
1246 | */ |
1393 | static inline int |
1247 | static inline int |
1394 | have_head (int ax, int ay) |
1248 | have_head (int ax, int ay) |
1395 | { |
1249 | { |
1396 | |
|
|
1397 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || |
1250 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || |
1398 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) |
1251 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) |
1399 | return 1; |
1252 | return 1; |
|
|
1253 | |
1400 | return 0; |
1254 | return 0; |
1401 | } |
1255 | } |
1402 | |
1256 | |
1403 | /** |
1257 | /** |
1404 | * check_head is a bit simplistic version of update_space below. |
1258 | * check_head is a bit simplistic version of update_space below. |
1405 | * basically, it only checks the that the head on space ax,ay at layer |
1259 | * basically, it only checks the that the head on space ax,ay at layer |
1406 | * needs to get sent - if so, it adds the data, sending the head |
1260 | * needs to get sent - if so, it adds the data, sending the head |
1407 | * if needed, and returning 1. If this no data needs to get |
1261 | * if needed, and returning 1. If this no data needs to get |
1408 | * sent, it returns zero. |
1262 | * sent, it returns zero. |
1409 | */ |
1263 | */ |
1410 | static int |
1264 | static int |
1411 | check_head (packet &sl, client_socket &ns, int ax, int ay, int layer) |
1265 | check_head (packet &sl, client &ns, int ax, int ay, int layer) |
1412 | { |
1266 | { |
1413 | short face_num; |
1267 | short face_num; |
1414 | |
1268 | |
1415 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) |
1269 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) |
1416 | face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; |
1270 | face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; |
… | |
… | |
1448 | * numbers the spaces differently - I think this was a leftover from |
1302 | * numbers the spaces differently - I think this was a leftover from |
1449 | * the map command, where the faces stack up. Sinces that is no longer |
1303 | * the map command, where the faces stack up. Sinces that is no longer |
1450 | * the case, it seems to make more sense to have these layer values |
1304 | * the case, it seems to make more sense to have these layer values |
1451 | * actually match. |
1305 | * actually match. |
1452 | */ |
1306 | */ |
1453 | |
|
|
1454 | static int |
1307 | static int |
1455 | update_space (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
1308 | update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
1456 | { |
1309 | { |
1457 | object *ob, *head; |
1310 | object *ob, *head; |
1458 | uint16 face_num; |
1311 | uint16 face_num; |
1459 | int bx, by, i; |
1312 | int bx, by, i; |
1460 | |
1313 | |
… | |
… | |
1673 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ |
1526 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ |
1674 | * take. |
1527 | * take. |
1675 | */ |
1528 | */ |
1676 | |
1529 | |
1677 | static inline int |
1530 | static inline int |
1678 | update_smooth (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
1531 | update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
1679 | { |
1532 | { |
1680 | object *ob; |
1533 | object *ob; |
1681 | int smoothlevel; /* old face_num; */ |
1534 | int smoothlevel; /* old face_num; */ |
1682 | |
1535 | |
1683 | ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); |
1536 | ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); |
… | |
… | |
1717 | * Returns the size of a data for a map square as returned by |
1570 | * Returns the size of a data for a map square as returned by |
1718 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
1571 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
1719 | * available. |
1572 | * available. |
1720 | */ |
1573 | */ |
1721 | int |
1574 | int |
1722 | getExtendedMapInfoSize (client_socket * ns) |
1575 | getExtendedMapInfoSize (client * ns) |
1723 | { |
1576 | { |
1724 | int result = 0; |
1577 | int result = 0; |
1725 | |
1578 | |
1726 | if (ns->ext_mapinfos) |
1579 | if (ns->ext_mapinfos) |
1727 | { |
1580 | { |
1728 | if (ns->EMI_smooth) |
1581 | if (ns->EMI_smooth) |
1729 | result += 1; /*One byte for smoothlevel */ |
1582 | result += 1; /*One byte for smoothlevel */ |
1730 | } |
1583 | } |
|
|
1584 | |
1731 | return result; |
1585 | return result; |
1732 | } |
1586 | } |
1733 | |
1587 | |
1734 | /** |
1588 | /** |
1735 | * This function uses the new map1 protocol command to send the map |
1589 | * This function uses the new map1 protocol command to send the map |
… | |
… | |
1763 | uint8 eentrysize; |
1617 | uint8 eentrysize; |
1764 | uint16 ewhatstart, ewhatflag; |
1618 | uint16 ewhatstart, ewhatflag; |
1765 | uint8 extendedinfos; |
1619 | uint8 extendedinfos; |
1766 | maptile *m; |
1620 | maptile *m; |
1767 | |
1621 | |
1768 | client_socket &socket = *pl->contr->socket; |
1622 | client &socket = *pl->contr->socket; |
1769 | |
1623 | |
1770 | check_map_change (pl->contr); |
1624 | check_map_change (pl->contr); |
1771 | |
1625 | |
1772 | packet sl; |
1626 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1773 | packet esl; |
1627 | packet esl; |
1774 | |
1628 | |
1775 | sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a "); |
|
|
1776 | startlen = sl.length (); |
1629 | startlen = sl.length (); |
1777 | |
1630 | |
1778 | /*Extendedmapinfo structure initialisation */ |
1631 | /*Extendedmapinfo structure initialisation */ |
1779 | if (socket.ext_mapinfos) |
1632 | if (socket.ext_mapinfos) |
1780 | { |
1633 | { |
… | |
… | |
1824 | for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
1677 | for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
1825 | { |
1678 | { |
1826 | ax = 0; |
1679 | ax = 0; |
1827 | for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
1680 | for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
1828 | { |
1681 | { |
1829 | |
|
|
1830 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1682 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1831 | |
1683 | |
1832 | /* If this space is out of the normal viewable area, we only check |
1684 | /* If this space is out of the normal viewable area, we only check |
1833 | * the heads value ax or ay will only be greater than what |
1685 | * the heads value ax or ay will only be greater than what |
1834 | * the client wants if using the map1a command - this is because |
1686 | * the client wants if using the map1a command - this is because |
… | |
… | |
2165 | return; |
2017 | return; |
2166 | |
2018 | |
2167 | memset (&newmap, 0, sizeof (struct Map)); |
2019 | memset (&newmap, 0, sizeof (struct Map)); |
2168 | |
2020 | |
2169 | for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++) |
2021 | for (j = (pl->y - pl->contr->socket->mapy / 2); j < (pl->y + (pl->contr->socket->mapy + 1) / 2); j++) |
2170 | { |
|
|
2171 | for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++) |
2022 | for (i = (pl->x - pl->contr->socket->mapx / 2); i < (pl->x + (pl->contr->socket->mapx + 1) / 2); i++) |
2172 | { |
2023 | { |
2173 | ax = i; |
2024 | ax = i; |
2174 | ay = j; |
2025 | ay = j; |
2175 | m = pm; |
2026 | m = pm; |
2176 | mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
2027 | mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
|
|
2028 | |
2177 | if (mflags & P_OUT_OF_MAP) |
2029 | if (mflags & P_OUT_OF_MAP) |
2178 | continue; |
2030 | continue; |
2179 | if (mflags & P_NEED_UPDATE) |
2031 | |
2180 | update_position (m, ax, ay); |
|
|
2181 | /* If a map is visible to the player, we don't want to swap it out |
2032 | /* If a map is visible to the player, we don't want to swap it out |
2182 | * just to reload it. This should really call something like |
2033 | * just to reload it. This should really call something like |
2183 | * swap_map, but this is much more efficient and 'good enough' |
2034 | * swap_map, but this is much more efficient and 'good enough' |
2184 | */ |
2035 | */ |
2185 | if (mflags & P_NEW_MAP) |
2036 | if (mflags & P_NEW_MAP) |
2186 | m->timeout = 50; |
2037 | m->timeout = 50; |
2187 | } |
2038 | } |
2188 | } |
2039 | |
2189 | /* do LOS after calls to update_position */ |
2040 | /* do LOS after calls to update_position */ |
2190 | if (pl->contr->do_los) |
2041 | if (pl->contr->do_los) |
2191 | { |
2042 | { |
2192 | update_los (pl); |
2043 | update_los (pl); |
2193 | pl->contr->do_los = 0; |
2044 | pl->contr->do_los = 0; |
… | |
… | |
2216 | /** |
2067 | /** |
2217 | * This sends the skill number to name mapping. We ignore |
2068 | * This sends the skill number to name mapping. We ignore |
2218 | * the params - we always send the same info no matter what. |
2069 | * the params - we always send the same info no matter what. |
2219 | */ |
2070 | */ |
2220 | void |
2071 | void |
2221 | send_skill_info (client_socket *ns, char *params) |
2072 | send_skill_info (client *ns, char *params) |
2222 | { |
2073 | { |
2223 | packet sl; |
2074 | packet sl; |
2224 | sl << "replyinfo skill_info\n"; |
2075 | sl << "replyinfo skill_info\n"; |
2225 | |
2076 | |
2226 | for (int i = 1; i < NUM_SKILLS; i++) |
2077 | for (int i = 1; i < NUM_SKILLS; i++) |
… | |
… | |
2238 | /** |
2089 | /** |
2239 | * This sends the spell path to name mapping. We ignore |
2090 | * This sends the spell path to name mapping. We ignore |
2240 | * the params - we always send the same info no matter what. |
2091 | * the params - we always send the same info no matter what. |
2241 | */ |
2092 | */ |
2242 | void |
2093 | void |
2243 | send_spell_paths (client_socket * ns, char *params) |
2094 | send_spell_paths (client * ns, char *params) |
2244 | { |
2095 | { |
2245 | packet sl; |
2096 | packet sl; |
2246 | |
2097 | |
2247 | sl << "replyinfo spell_paths\n"; |
2098 | sl << "replyinfo spell_paths\n"; |
2248 | |
2099 | |
… | |
… | |
2321 | { |
2172 | { |
2322 | LOG (llevError, "Invalid call to esrv_remove_spell"); |
2173 | LOG (llevError, "Invalid call to esrv_remove_spell"); |
2323 | return; |
2174 | return; |
2324 | } |
2175 | } |
2325 | |
2176 | |
2326 | packet sl; |
2177 | packet sl ("delspell"); |
2327 | |
2178 | |
2328 | sl << "delspell " |
|
|
2329 | << uint32 (spell->count); |
2179 | sl << uint32 (spell->count); |
2330 | |
2180 | |
2331 | pl->socket->send_packet (sl); |
2181 | pl->socket->send_packet (sl); |
2332 | } |
2182 | } |
2333 | |
2183 | |
2334 | /* appends the spell *spell to the Socklist we will send the data to. */ |
2184 | /* appends the spell *spell to the Socklist we will send the data to. */ |
… | |
… | |
2387 | } |
2237 | } |
2388 | |
2238 | |
2389 | if (!pl->socket->monitor_spells) |
2239 | if (!pl->socket->monitor_spells) |
2390 | return; |
2240 | return; |
2391 | |
2241 | |
2392 | packet sl; |
2242 | packet sl ("addspell"); |
2393 | |
|
|
2394 | sl << "addspell "; |
|
|
2395 | |
2243 | |
2396 | if (!spell) |
2244 | if (!spell) |
2397 | { |
2245 | { |
2398 | for (spell = pl->ob->inv; spell != NULL; spell = spell->below) |
2246 | for (spell = pl->ob->inv; spell != NULL; spell = spell->below) |
2399 | { |
2247 | { |