… | |
… | |
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->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
156 | |
144 | |
157 | if (socket.newmapcmd == 1) |
145 | if (pl->ns->newmapcmd == 1) |
158 | socket.send_packet ("newmap"); |
146 | pl->ns->send_packet ("newmap"); |
159 | |
147 | |
160 | socket.update_look = 1; |
148 | pl->ns->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->ns; |
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 | { |
… | |
… | |
244 | buf += 8; |
280 | buf += 8; |
245 | |
281 | |
246 | // initial map and its origin |
282 | // initial map and its origin |
247 | maptile *map = pl->ob->map; |
283 | maptile *map = pl->ob->map; |
248 | sint16 dx, dy; |
284 | sint16 dx, dy; |
249 | int mapx = pl->socket->mapx / 2 - pl->ob->x; |
285 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
250 | int mapy = pl->socket->mapy / 2 - pl->ob->y; |
286 | int mapy = pl->ns->mapy / 2 - pl->ob->y; |
251 | int max_distance = 8; // limit maximum path length to something generous |
287 | int max_distance = 8; // limit maximum path length to something generous |
252 | |
288 | |
253 | while (*buf && map && max_distance) |
289 | while (*buf && map && max_distance) |
254 | { |
290 | { |
255 | int dir = *buf++; |
291 | int dir = *buf++; |
… | |
… | |
306 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
342 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
307 | } |
343 | } |
308 | else |
344 | else |
309 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
345 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
310 | |
346 | |
311 | pl->socket->send_packet (bigbuf); |
347 | pl->ns->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, |
769 | * etc.). It is a lot like PlayerCmd above, but is called with the |
779 | * etc.). It is a lot like PlayerCmd above, but is called with the |
770 | * 'ncom' method which gives more information back to the client so it |
780 | * 'ncom' method which gives more information back to the client so it |
771 | * can throttle. |
781 | * can throttle. |
772 | */ |
782 | */ |
773 | void |
783 | void |
774 | NewPlayerCmd (uint8 * 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 (buf); |
792 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
787 | repeat = net_uint32 (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 | /* The following should never happen with a proper or honest client. |
|
|
800 | * Therefore, the error message doesn't have to be too clear - if |
|
|
801 | * someone is playing with a hacked/non working client, this gives them |
|
|
802 | * an idea of the problem, but they deserve what they get |
|
|
803 | */ |
|
|
804 | if (pl->state != ST_PLAYING) |
|
|
805 | { |
|
|
806 | new_draw_info_format (NDI_UNIQUE, 0, pl->ob, "You can not issue commands - state is not ST_PLAYING (%s)", buf); |
|
|
807 | return; |
|
|
808 | } |
|
|
809 | |
|
|
810 | /* This should not happen anymore. */ |
|
|
811 | if (pl->ob->speed_left < -1.0) |
|
|
812 | LOG (llevError, "Player has negative time - shouldn't do command.\n"); |
|
|
813 | |
|
|
814 | /* In c_new.c */ |
|
|
815 | execute_newserver_command (pl->ob, (char *) command); |
801 | execute_newserver_command (pl->ob, buf); |
|
|
802 | |
816 | /* Perhaps something better should be done with a left over count. |
803 | /* Perhaps something better should be done with a left over count. |
817 | * Cleaning up the input should probably be done first - all actions |
804 | * Cleaning up the input should probably be done first - all actions |
818 | * 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 |
819 | * commands. |
806 | * commands. |
820 | */ |
807 | */ |
821 | pl->count = 0; |
808 | pl->count = 0; |
822 | |
809 | |
|
|
810 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
823 | if (FABS (pl->ob->speed) < 0.001) |
811 | int time = FABS (pl->ob->speed) < 0.001 |
824 | time = MAX_TIME * 100; |
812 | ? time = MAX_TIME * 100 |
825 | else |
|
|
826 | time = (int) (MAX_TIME / FABS (pl->ob->speed)); |
813 | : time = (int) (MAX_TIME / FABS (pl->ob->speed)); |
827 | |
814 | |
828 | /* Send confirmation of command execution now */ |
815 | /* Send confirmation of command execution now */ |
829 | |
816 | packet sl ("comc"); |
830 | packet sl; |
|
|
831 | sl << "comc " << uint16 (pktlen) << uint32 (time); |
817 | sl << uint16 (cmdid) << uint32 (time); |
832 | pl->socket->send_packet (sl); |
818 | pl->ns->send_packet (sl); |
833 | } |
819 | } |
834 | |
|
|
835 | |
820 | |
836 | /** This is a reply to a previous query. */ |
821 | /** This is a reply to a previous query. */ |
837 | void |
822 | void |
838 | ReplyCmd (char *buf, int len, player *pl) |
823 | ReplyCmd (char *buf, int len, client *ns) |
839 | { |
824 | { |
|
|
825 | if (ns->state == ST_CUSTOM) |
|
|
826 | { |
|
|
827 | INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len)); |
|
|
828 | return; |
|
|
829 | } |
|
|
830 | |
|
|
831 | if (!ns->pl) |
|
|
832 | return; //TODO: depends on the exact reply we are after |
|
|
833 | //TODO: but right now, we always have a ns->pl |
|
|
834 | |
|
|
835 | player *pl = ns->pl; |
|
|
836 | |
840 | /* This is to synthesize how the data would be stored if it |
837 | /* This is to synthesize how the data would be stored if it |
841 | * was normally entered. A bit of a hack, and should be cleaned up |
838 | * was normally entered. A bit of a hack, and should be cleaned up |
842 | * once all the X11 code is removed from the server. |
839 | * once all the X11 code is removed from the server. |
843 | * |
840 | * |
844 | * We pass 13 to many of the functions because this way they |
841 | * We pass 13 to many of the functions because this way they |
845 | * think it was the carriage return that was entered, and the |
842 | * think it was the carriage return that was entered, and the |
846 | * function then does not try to do additional input. |
843 | * function then does not try to do additional input. |
847 | */ |
844 | */ |
848 | snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); |
845 | snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); |
849 | |
846 | |
850 | /* this avoids any hacking here */ |
847 | /* this avoids any hacking here */ |
851 | |
848 | |
852 | switch (pl->state) |
849 | switch (ns->state) |
853 | { |
850 | { |
854 | case ST_PLAYING: |
851 | case ST_PLAYING: |
855 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
852 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
856 | break; |
853 | break; |
857 | |
854 | |
858 | case ST_PLAY_AGAIN: |
855 | case ST_PLAY_AGAIN: |
859 | /* We can check this for return value (2==quit). Maybe we |
856 | /* We can check this for return value (2==quit). Maybe we |
860 | * should, and do something appropriate? |
857 | * should, and do something appropriate? |
861 | */ |
858 | */ |
862 | receive_play_again (pl->ob, buf[0]); |
859 | receive_play_again (pl->ob, buf[0]); |
863 | break; |
860 | break; |
864 | |
861 | |
865 | case ST_ROLL_STAT: |
862 | case ST_ROLL_STAT: |
866 | key_roll_stat (pl->ob, buf[0]); |
863 | key_roll_stat (pl->ob, buf[0]); |
867 | break; |
864 | break; |
868 | |
865 | |
869 | case ST_CHANGE_CLASS: |
866 | case ST_CHANGE_CLASS: |
870 | |
|
|
871 | key_change_class (pl->ob, buf[0]); |
867 | key_change_class (pl->ob, buf[0]); |
872 | break; |
868 | break; |
873 | |
869 | |
874 | case ST_CONFIRM_QUIT: |
870 | case ST_CONFIRM_QUIT: |
875 | key_confirm_quit (pl->ob, buf[0]); |
871 | key_confirm_quit (pl->ob, buf[0]); |
876 | break; |
872 | break; |
877 | |
873 | |
878 | case ST_CONFIGURE: |
874 | case ST_CONFIGURE: |
879 | LOG (llevError, "In client input handling, but into configure state\n"); |
875 | LOG (llevError, "In client input handling, but into configure state\n"); |
880 | pl->state = ST_PLAYING; |
876 | ns->state = ST_PLAYING; |
881 | break; |
877 | break; |
882 | |
878 | |
883 | case ST_GET_NAME: |
879 | case ST_GET_NAME: |
884 | receive_player_name (pl->ob, 13); |
880 | receive_player_name (pl->ob, 13); |
885 | break; |
881 | break; |
886 | |
882 | |
887 | case ST_GET_PASSWORD: |
883 | case ST_GET_PASSWORD: |
888 | case ST_CONFIRM_PASSWORD: |
884 | case ST_CONFIRM_PASSWORD: |
889 | receive_player_password (pl->ob, 13); |
885 | receive_player_password (pl->ob, 13); |
890 | break; |
886 | break; |
891 | |
887 | |
892 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
888 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
893 | receive_party_password (pl->ob, 13); |
889 | receive_party_password (pl->ob, 13); |
894 | break; |
890 | break; |
895 | |
891 | |
896 | default: |
892 | default: |
897 | LOG (llevError, "Unknown input state: %d\n", pl->state); |
893 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
898 | } |
894 | } |
899 | } |
895 | } |
900 | |
896 | |
901 | /** |
897 | /** |
902 | * Client tells its version. If there is a mismatch, we close the |
898 | * Client tells its version. If there is a mismatch, we close the |
… | |
… | |
904 | * something older than the server. If we assume the client will be |
900 | * something older than the server. If we assume the client will be |
905 | * backwards compatible, having it be a later version should not be a |
901 | * backwards compatible, having it be a later version should not be a |
906 | * problem. |
902 | * problem. |
907 | */ |
903 | */ |
908 | void |
904 | void |
909 | VersionCmd (char *buf, int len, client_socket * ns) |
905 | VersionCmd (char *buf, int len, client * ns) |
910 | { |
906 | { |
911 | char *cp; |
|
|
912 | char version_warning[256]; |
|
|
913 | |
|
|
914 | if (!buf) |
907 | if (!buf) |
915 | { |
908 | { |
916 | LOG (llevError, "CS: received corrupted version command\n"); |
909 | LOG (llevError, "CS: received corrupted version command\n"); |
917 | return; |
910 | return; |
918 | } |
911 | } |
919 | |
912 | |
920 | ns->cs_version = atoi (buf); |
913 | ns->cs_version = atoi (buf); |
921 | ns->sc_version = ns->cs_version; |
914 | ns->sc_version = ns->cs_version; |
|
|
915 | |
|
|
916 | LOG (llevDebug, "connection from client <%s>\n", buf); |
|
|
917 | |
|
|
918 | |
|
|
919 | //TODO: should log here just for statistics |
|
|
920 | |
922 | if (VERSION_CS != ns->cs_version) |
921 | //if (VERSION_CS != ns->cs_version) |
923 | { |
922 | // unchecked; |
924 | #ifdef ESRV_DEBUG |
923 | |
925 | LOG (llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS, ns->cs_version); |
|
|
926 | #endif |
|
|
927 | } |
|
|
928 | cp = strchr (buf + 1, ' '); |
924 | char *cp = strchr (buf + 1, ' '); |
929 | if (!cp) |
925 | if (!cp) |
930 | return; |
926 | return; |
|
|
927 | |
931 | ns->sc_version = atoi (cp); |
928 | ns->sc_version = atoi (cp); |
|
|
929 | |
932 | if (VERSION_SC != ns->sc_version) |
930 | //if (VERSION_SC != ns->sc_version) |
933 | { |
931 | // unchecked; |
934 | #ifdef ESRV_DEBUG |
932 | |
935 | LOG (llevDebug, "CS: scversion mismatch (%d,%d)\n", VERSION_SC, ns->sc_version); |
|
|
936 | #endif |
|
|
937 | } |
|
|
938 | cp = strchr (cp + 1, ' '); |
933 | cp = strchr (cp + 1, ' '); |
|
|
934 | |
939 | if (cp) |
935 | if (cp) |
940 | { |
936 | { |
941 | LOG (llevDebug, "CS: connection from client of type <%s>, ip %s\n", cp, ns->host); |
937 | assign (ns->version, cp + 1); |
942 | |
938 | |
943 | snprintf (ns->client, sizeof (ns->client), "%s", cp + 1); |
|
|
944 | |
|
|
945 | /* This is first implementation - i skip all beta DX clients with it |
|
|
946 | * Add later stuff here for other clients |
|
|
947 | */ |
|
|
948 | |
|
|
949 | /* these are old dxclients */ |
|
|
950 | /* Version 1024 added support for singular + plural name values - |
|
|
951 | * requiing this minimal value reduces complexity of that code, and it |
|
|
952 | * has been around for a long time. |
|
|
953 | */ |
|
|
954 | if (ns->sc_version < 1026) |
939 | if (ns->sc_version < 1026) |
955 | { |
940 | ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
956 | sprintf (version_warning, "drawinfo %d %s", NDI_RED, |
|
|
957 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
941 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
958 | ns->send_packet (version_warning); |
|
|
959 | } |
|
|
960 | |
|
|
961 | } |
942 | } |
962 | } |
943 | } |
963 | |
944 | |
964 | /** sound related functions. */ |
945 | /** sound related functions. */ |
965 | |
|
|
966 | void |
946 | void |
967 | SetSound (char *buf, int len, client_socket * ns) |
947 | SetSound (char *buf, int len, client * ns) |
968 | { |
948 | { |
969 | ns->sound = atoi (buf); |
949 | ns->sound = atoi (buf); |
970 | } |
950 | } |
971 | |
951 | |
972 | /** client wants the map resent */ |
952 | /** client wants the map resent */ |
973 | |
953 | |
974 | void |
954 | void |
975 | MapRedrawCmd (char *buf, int len, player *pl) |
955 | MapRedrawCmd (char *buf, int len, player *pl) |
976 | { |
956 | { |
977 | |
|
|
978 | /* This function is currently disabled; just clearing the map state results in |
957 | /* This function is currently disabled; just clearing the map state results in |
979 | * display errors. It should clear the cache and send a newmap command. |
958 | * display errors. It should clear the cache and send a newmap command. |
980 | * Unfortunately this solution does not work because some client versions send |
959 | * Unfortunately this solution does not work because some client versions send |
981 | * a mapredraw command after receiving a newmap command. |
960 | * a mapredraw command after receiving a newmap command. |
982 | */ |
961 | */ |
983 | #if 0 |
|
|
984 | /* Okay, this is MAJOR UGLY. but the only way I know how to |
|
|
985 | * clear the "cache" |
|
|
986 | */ |
|
|
987 | memset (&pl->socket->lastmap, 0, sizeof (struct Map)); |
|
|
988 | draw_client_map (pl->ob); |
|
|
989 | #endif |
|
|
990 | } |
962 | } |
991 | |
963 | |
992 | /** |
964 | /** |
993 | * Moves an object (typically, container to inventory). |
965 | * Moves an object (typically, container to inventory). |
994 | * syntax is: move (to) (tag) (nrof) |
966 | * syntax is: move (to) (tag) (nrof) |
… | |
… | |
997 | MoveCmd (char *buf, int len, player *pl) |
969 | MoveCmd (char *buf, int len, player *pl) |
998 | { |
970 | { |
999 | int vals[3], i; |
971 | int vals[3], i; |
1000 | |
972 | |
1001 | /* A little funky here. We only cycle for 2 records, because |
973 | /* A little funky here. We only cycle for 2 records, because |
1002 | * we obviously am not going to find a space after the third |
974 | * we obviously are not going to find a space after the third |
1003 | * record. Perhaps we should just replace this with a |
975 | * record. Perhaps we should just replace this with a |
1004 | * sscanf? |
976 | * sscanf? |
1005 | */ |
977 | */ |
1006 | for (i = 0; i < 2; i++) |
978 | for (i = 0; i < 2; i++) |
1007 | { |
979 | { |
1008 | vals[i] = atoi (buf); |
980 | vals[i] = atoi (buf); |
|
|
981 | |
1009 | if (!(buf = strchr (buf, ' '))) |
982 | if (!(buf = strchr (buf, ' '))) |
1010 | { |
983 | { |
1011 | LOG (llevError, "Incomplete move command: %s\n", buf); |
984 | LOG (llevError, "Incomplete move command: %s\n", buf); |
1012 | return; |
985 | return; |
1013 | } |
986 | } |
|
|
987 | |
1014 | buf++; |
988 | buf++; |
1015 | } |
989 | } |
|
|
990 | |
1016 | vals[2] = atoi (buf); |
991 | vals[2] = atoi (buf); |
1017 | |
992 | |
1018 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
993 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
1019 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
994 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
1020 | } |
995 | } |
1021 | |
|
|
1022 | |
|
|
1023 | |
996 | |
1024 | /****************************************************************************** |
997 | /****************************************************************************** |
1025 | * |
998 | * |
1026 | * Start of commands the server sends to the client. |
999 | * Start of commands the server sends to the client. |
1027 | * |
1000 | * |
… | |
… | |
1030 | /** |
1003 | /** |
1031 | * Asks the client to query the user. This way, the client knows |
1004 | * Asks the client to query the user. This way, the client knows |
1032 | * it needs to send something back (vs just printing out a message) |
1005 | * it needs to send something back (vs just printing out a message) |
1033 | */ |
1006 | */ |
1034 | void |
1007 | void |
1035 | send_query (client_socket * ns, uint8 flags, char *text) |
1008 | send_query (client *ns, uint8 flags, char *text) |
1036 | { |
1009 | { |
1037 | char buf[MAX_BUF]; |
|
|
1038 | |
|
|
1039 | sprintf (buf, "query %d %s", flags, text ? text : ""); |
1010 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
1040 | ns->send_packet (buf); |
|
|
1041 | } |
1011 | } |
1042 | |
1012 | |
1043 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
1013 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
1044 | Old = New; \ |
1014 | Old = New; \ |
1045 | sl << uint8 (Type) << uint64 (New); \ |
1015 | sl << uint8 (Type) << uint64 (New); \ |
… | |
… | |
1075 | esrv_update_stats (player *pl) |
1045 | esrv_update_stats (player *pl) |
1076 | { |
1046 | { |
1077 | char buf[MAX_BUF]; |
1047 | char buf[MAX_BUF]; |
1078 | uint16 flags; |
1048 | uint16 flags; |
1079 | |
1049 | |
1080 | packet sl; |
1050 | packet sl ("stats"); |
1081 | sl << "stats "; |
|
|
1082 | |
1051 | |
1083 | if (pl->ob != NULL) |
1052 | if (pl->ob) |
1084 | { |
1053 | { |
1085 | AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); |
1054 | AddIfShort (pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); |
1086 | AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); |
1055 | AddIfShort (pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); |
1087 | AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); |
1056 | AddIfShort (pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); |
1088 | AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); |
1057 | AddIfShort (pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); |
… | |
… | |
1095 | AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); |
1064 | AddIfShort (pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); |
1096 | AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); |
1065 | AddIfShort (pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); |
1097 | AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); |
1066 | AddIfShort (pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); |
1098 | } |
1067 | } |
1099 | |
1068 | |
1100 | if (pl->socket->exp64) |
1069 | if (pl->ns->exp64) |
1101 | { |
|
|
1102 | uint8 s; |
|
|
1103 | |
|
|
1104 | for (s = 0; s < NUM_SKILLS; s++) |
1070 | for (int s = 0; s < NUM_SKILLS; s++) |
1105 | { |
|
|
1106 | if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) |
1071 | if (pl->last_skill_ob[s] && pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) |
1107 | { |
1072 | { |
1108 | /* Always send along the level if exp changes. This is only |
1073 | /* Always send along the level if exp changes. This is only |
1109 | * 1 extra byte, but keeps processing simpler. |
1074 | * 1 extra byte, but keeps processing simpler. |
1110 | */ |
1075 | */ |
1111 | sl << uint8 (s + CS_STAT_SKILLINFO) |
1076 | sl << uint8 (s + CS_STAT_SKILLINFO) |
1112 | << uint8 (pl->last_skill_ob[s]->level) |
1077 | << uint8 (pl->last_skill_ob[s]->level) |
1113 | << uint64 (pl->last_skill_ob[s]->stats.exp); |
1078 | << uint64 (pl->last_skill_ob[s]->stats.exp); |
1114 | |
1079 | |
1115 | pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; |
1080 | pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; |
1116 | } |
1081 | } |
1117 | } |
|
|
1118 | } |
|
|
1119 | |
1082 | |
1120 | if (pl->socket->exp64) |
1083 | if (pl->ns->exp64) |
1121 | { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } |
1084 | { AddIfInt64 (pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64) } |
1122 | else |
1085 | else |
1123 | { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } |
1086 | { AddIfInt (pl->last_stats.exp, (int) pl->ob->stats.exp, CS_STAT_EXP) } |
1124 | |
1087 | |
1125 | AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); |
1088 | AddIfShort (pl->last_level, (char) pl->ob->level, CS_STAT_LEVEL); |
… | |
… | |
1138 | if (pl->run_on) |
1101 | if (pl->run_on) |
1139 | flags |= SF_RUNON; |
1102 | flags |= SF_RUNON; |
1140 | |
1103 | |
1141 | AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); |
1104 | AddIfShort (pl->last_flags, flags, CS_STAT_FLAGS); |
1142 | |
1105 | |
1143 | if (pl->socket->sc_version < 1025) |
1106 | if (pl->ns->sc_version < 1025) |
1144 | { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
1107 | { AddIfShort (pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
1145 | else |
1108 | else |
1146 | { |
|
|
1147 | int i; |
|
|
1148 | |
|
|
1149 | for (i = 0; i < NROFATTACKS; i++) |
1109 | for (int i = 0; i < NROFATTACKS; i++) |
1150 | { |
1110 | { |
1151 | /* Skip ones we won't send */ |
1111 | /* Skip ones we won't send */ |
1152 | if (atnr_cs_stat[i] == -1) |
1112 | if (atnr_cs_stat[i] == -1) |
1153 | continue; |
1113 | continue; |
1154 | |
1114 | |
1155 | AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); |
1115 | AddIfShort (pl->last_resist[i], pl->ob->resist[i], (char) atnr_cs_stat[i]); |
1156 | } |
1116 | } |
1157 | } |
|
|
1158 | |
1117 | |
1159 | if (pl->socket->monitor_spells) |
1118 | if (pl->ns->monitor_spells) |
1160 | { |
1119 | { |
1161 | AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
1120 | AddIfInt (pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
1162 | AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); |
1121 | AddIfInt (pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); |
1163 | AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); |
1122 | AddIfInt (pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); |
1164 | } |
1123 | } |
1165 | |
1124 | |
1166 | rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ |
1125 | rangetostring (pl->ob, buf); /* we want use the new fire & run system in new client */ |
1167 | AddIfString (pl->socket->stats.range, buf, CS_STAT_RANGE); |
1126 | AddIfString (pl->ns->stats.range, buf, CS_STAT_RANGE); |
1168 | set_title (pl->ob, buf); |
1127 | set_title (pl->ob, buf); |
1169 | AddIfString (pl->socket->stats.title, buf, CS_STAT_TITLE); |
1128 | AddIfString (pl->ns->stats.title, buf, CS_STAT_TITLE); |
1170 | |
1129 | |
1171 | /* Only send it away if we have some actual data */ |
1130 | /* Only send it away if we have some actual data */ |
1172 | if (sl.length () > 6) |
1131 | if (sl.length () > 6) |
1173 | pl->socket->send_packet (sl); |
1132 | pl->ns->send_packet (sl); |
1174 | } |
1133 | } |
1175 | |
1134 | |
1176 | /** |
1135 | /** |
1177 | * Tells the client that here is a player it should start using. |
1136 | * Tells the client that here is a player it should start using. |
1178 | */ |
1137 | */ |
1179 | void |
1138 | void |
1180 | esrv_new_player (player *pl, uint32 weight) |
1139 | esrv_new_player (player *pl, uint32 weight) |
1181 | { |
1140 | { |
1182 | pl->last_weight = weight; |
1141 | pl->last_weight = weight; |
1183 | |
1142 | |
1184 | packet sl; |
1143 | packet sl ("player"); |
1185 | sl << "player "; |
|
|
1186 | |
1144 | |
1187 | sl << uint32 (pl->ob->count) |
1145 | sl << uint32 (pl->ob->count) |
1188 | << uint32 (weight) |
1146 | << uint32 (weight) |
1189 | << uint32 (pl->ob->face->number) |
1147 | << uint32 (pl->ob->face->number) |
1190 | << data8 (pl->ob->name); |
1148 | << data8 (pl->ob->name); |
1191 | |
1149 | |
1192 | pl->socket->send_packet (sl); |
1150 | pl->ns->send_packet (sl); |
1193 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
1151 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
1194 | } |
1152 | } |
1195 | |
1153 | |
1196 | /** |
1154 | /** |
1197 | * Need to send an animation sequence to the client. |
1155 | * Need to send an animation sequence to the client. |
… | |
… | |
1199 | * sent them the face yet (this can become quite costly in terms of |
1157 | * sent them the face yet (this can become quite costly in terms of |
1200 | * how much we are sending - on the other hand, this should only happen |
1158 | * how much we are sending - on the other hand, this should only happen |
1201 | * when the player logs in and picks stuff up. |
1159 | * when the player logs in and picks stuff up. |
1202 | */ |
1160 | */ |
1203 | void |
1161 | void |
1204 | esrv_send_animation (client_socket * ns, short anim_num) |
1162 | esrv_send_animation (client * ns, short anim_num) |
1205 | { |
1163 | { |
1206 | int i; |
|
|
1207 | |
|
|
1208 | /* Do some checking on the anim_num we got. Note that the animations |
1164 | /* Do some checking on the anim_num we got. Note that the animations |
1209 | * are added in contigous order, so if the number is in the valid |
1165 | * are added in contigous order, so if the number is in the valid |
1210 | * range, it must be a valid animation. |
1166 | * range, it must be a valid animation. |
1211 | */ |
1167 | */ |
1212 | if (anim_num < 0 || anim_num > num_animations) |
1168 | if (anim_num < 0 || anim_num > num_animations) |
1213 | { |
1169 | { |
1214 | LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
1170 | LOG (llevError, "esrv_send_anim (%d) out of bounds??\n", anim_num); |
1215 | return; |
1171 | return; |
1216 | } |
1172 | } |
1217 | |
1173 | |
1218 | packet sl; |
1174 | packet sl ("anim"); |
1219 | |
1175 | |
1220 | sl << "anim " |
|
|
1221 | << uint16 (anim_num) |
1176 | sl << uint16 (anim_num) |
1222 | << uint16 (0); /* flags - not used right now */ |
1177 | << uint16 (0); /* flags - not used right now */ |
1223 | |
1178 | |
1224 | /* Build up the list of faces. Also, send any information (ie, the |
1179 | /* Build up the list of faces. Also, send any information (ie, the |
1225 | * the face itself) down to the client. |
1180 | * the face itself) down to the client. |
1226 | */ |
1181 | */ |
1227 | for (i = 0; i < animations[anim_num].num_animations; i++) |
1182 | for (int i = 0; i < animations[anim_num].num_animations; i++) |
1228 | { |
1183 | { |
1229 | if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) |
1184 | if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) |
1230 | esrv_send_face (ns, animations[anim_num].faces[i], 0); |
1185 | esrv_send_face (ns, animations[anim_num].faces[i], 0); |
|
|
1186 | |
1231 | sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ |
1187 | sl << uint16 (animations[anim_num].faces[i]); /* flags - not used right now */ |
1232 | } |
1188 | } |
1233 | |
1189 | |
1234 | ns->send_packet (sl); |
1190 | ns->send_packet (sl); |
1235 | |
1191 | |
… | |
… | |
1246 | /** |
1202 | /** |
1247 | * This adds face_num to a map cell at x,y. If the client doesn't have |
1203 | * This adds face_num to a map cell at x,y. If the client doesn't have |
1248 | * the face yet, we will also send it. |
1204 | * the face yet, we will also send it. |
1249 | */ |
1205 | */ |
1250 | static void |
1206 | static void |
1251 | esrv_map_setbelow (client_socket * ns, int x, int y, short face_num, struct Map *newmap) |
1207 | esrv_map_setbelow (client * ns, int x, int y, short face_num, struct Map *newmap) |
1252 | { |
1208 | { |
1253 | if (newmap->cells[x][y].count >= MAP_LAYERS) |
1209 | if (newmap->cells[x][y].count >= MAP_LAYERS) |
1254 | { |
1210 | { |
|
|
1211 | //TODO: one or the other, can't both have abort and return, verify and act |
1255 | LOG (llevError, "Too many faces in map cell %d %d\n", x, y); |
1212 | LOG (llevError, "Too many faces in map cell %d %d\n", x, y); |
1256 | return; |
1213 | return; |
1257 | abort (); |
1214 | abort (); |
1258 | } |
1215 | } |
1259 | |
1216 | |
1260 | newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; |
1217 | newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; |
1261 | newmap->cells[x][y].count++; |
1218 | newmap->cells[x][y].count++; |
1262 | |
1219 | |
1263 | if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) |
1220 | if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) |
1264 | esrv_send_face (ns, face_num, 0); |
1221 | esrv_send_face (ns, face_num, 0); |
1265 | } |
|
|
1266 | |
|
|
1267 | struct LayerCell |
|
|
1268 | { |
|
|
1269 | uint16 xy; |
|
|
1270 | short face; |
|
|
1271 | }; |
|
|
1272 | |
|
|
1273 | struct MapLayer |
|
|
1274 | { |
|
|
1275 | int count; |
|
|
1276 | struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y]; |
|
|
1277 | }; |
|
|
1278 | |
|
|
1279 | /** Checkes if map cells have changed */ |
|
|
1280 | static int |
|
|
1281 | mapcellchanged (client_socket * ns, int i, int j, struct Map *newmap) |
|
|
1282 | { |
|
|
1283 | int k; |
|
|
1284 | |
|
|
1285 | if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count) |
|
|
1286 | return 1; |
|
|
1287 | for (k = 0; k < newmap->cells[i][j].count; k++) |
|
|
1288 | { |
|
|
1289 | if (ns->lastmap.cells[i][j].faces[k] != newmap->cells[i][j].faces[k]) |
|
|
1290 | { |
|
|
1291 | return 1; |
|
|
1292 | } |
|
|
1293 | } |
|
|
1294 | return 0; |
|
|
1295 | } |
|
|
1296 | |
|
|
1297 | /** |
|
|
1298 | * Basically, what this does is pack the data into layers. |
|
|
1299 | * cnum is the client number, cur is the the buffer we put all of |
|
|
1300 | * this data into. we return the end of the data. layers is |
|
|
1301 | * how many layers of data we should back. |
|
|
1302 | */ |
|
|
1303 | static uint8 * |
|
|
1304 | compactlayer (client_socket * ns, unsigned char *cur, int numlayers, struct Map *newmap) |
|
|
1305 | { |
|
|
1306 | int x, y, k; |
|
|
1307 | int face; |
|
|
1308 | unsigned char *fcur; |
|
|
1309 | struct MapLayer layers[MAP_LAYERS]; |
|
|
1310 | |
|
|
1311 | for (k = 0; k < MAP_LAYERS; k++) |
|
|
1312 | layers[k].count = 0; |
|
|
1313 | fcur = cur; |
|
|
1314 | for (x = 0; x < ns->mapx; x++) |
|
|
1315 | { |
|
|
1316 | for (y = 0; y < ns->mapy; y++) |
|
|
1317 | { |
|
|
1318 | if (!mapcellchanged (ns, x, y, newmap)) |
|
|
1319 | continue; |
|
|
1320 | if (newmap->cells[x][y].count == 0) |
|
|
1321 | { |
|
|
1322 | *cur = x * ns->mapy + y; /* mark empty space */ |
|
|
1323 | cur++; |
|
|
1324 | continue; |
|
|
1325 | } |
|
|
1326 | for (k = 0; k < newmap->cells[x][y].count; k++) |
|
|
1327 | { |
|
|
1328 | layers[k].lcells[layers[k].count].xy = x * ns->mapy + y; |
|
|
1329 | layers[k].lcells[layers[k].count].face = newmap->cells[x][y].faces[k]; |
|
|
1330 | layers[k].count++; |
|
|
1331 | } |
|
|
1332 | } |
|
|
1333 | } |
|
|
1334 | /* If no data, return now. */ |
|
|
1335 | if (fcur == cur && layers[0].count == 0) |
|
|
1336 | return cur; |
|
|
1337 | *cur = 255; /* mark end of explicitly cleared cells */ |
|
|
1338 | cur++; |
|
|
1339 | /* First pack by layers. */ |
|
|
1340 | for (k = 0; k < numlayers; k++) |
|
|
1341 | { |
|
|
1342 | if (layers[k].count == 0) |
|
|
1343 | break; /* once a layer is entirely empty, no layer below it can |
|
|
1344 | have anything in it either */ |
|
|
1345 | /* Pack by entries in thie layer */ |
|
|
1346 | for (x = 0; x < layers[k].count;) |
|
|
1347 | { |
|
|
1348 | fcur = cur; |
|
|
1349 | *cur = layers[k].lcells[x].face >> 8; |
|
|
1350 | cur++; |
|
|
1351 | *cur = layers[k].lcells[x].face & 0xFF; |
|
|
1352 | cur++; |
|
|
1353 | face = layers[k].lcells[x].face; |
|
|
1354 | /* Now, we back the redundant data into 1 byte xy pairings */ |
|
|
1355 | for (y = x; y < layers[k].count; y++) |
|
|
1356 | { |
|
|
1357 | if (layers[k].lcells[y].face == face) |
|
|
1358 | { |
|
|
1359 | *cur = (uint8) layers[k].lcells[y].xy; |
|
|
1360 | cur++; |
|
|
1361 | layers[k].lcells[y].face = -1; |
|
|
1362 | } |
|
|
1363 | } |
|
|
1364 | *(cur - 1) = *(cur - 1) | 128; /* mark for end of xy's; 11*11 < 128 */ |
|
|
1365 | /* forward over the now redundant data */ |
|
|
1366 | while (x < layers[k].count && layers[k].lcells[x].face == -1) |
|
|
1367 | x++; |
|
|
1368 | } |
|
|
1369 | *fcur = *fcur | 128; /* mark for end of faces at this layer */ |
|
|
1370 | } |
|
|
1371 | return cur; |
|
|
1372 | } |
1222 | } |
1373 | |
1223 | |
1374 | /** Clears a map cell */ |
1224 | /** Clears a map cell */ |
1375 | static void |
1225 | static void |
1376 | map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) |
1226 | map_clearcell (struct MapCell *cell, int face0, int face1, int face2, int count) |
… | |
… | |
1388 | #define MAX_LAYERS 3 |
1238 | #define MAX_LAYERS 3 |
1389 | |
1239 | |
1390 | /* Using a global really isn't a good approach, but saves the over head of |
1240 | /* Using a global really isn't a good approach, but saves the over head of |
1391 | * allocating and deallocating such a block of data each time run through, |
1241 | * allocating and deallocating such a block of data each time run through, |
1392 | * and saves the space of allocating this in the socket object when we only |
1242 | * and saves the space of allocating this in the socket object when we only |
1393 | * need it for this cycle. If the serve is ever threaded, this needs to be |
1243 | * need it for this cycle. If the server is ever threaded, this needs to be |
1394 | * re-examined. |
1244 | * re-examined. |
1395 | */ |
1245 | */ |
1396 | |
|
|
1397 | static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; |
1246 | static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; |
1398 | |
1247 | |
1399 | /** |
1248 | /** |
1400 | * Returns true if any of the heads for this |
1249 | * Returns true if any of the heads for this |
1401 | * space is set. Returns false if all are blank - this is used |
1250 | * space is set. Returns false if all are blank - this is used |
1402 | * for empty space checking. |
1251 | * for empty space checking. |
1403 | */ |
1252 | */ |
1404 | static inline int |
1253 | static inline int |
1405 | have_head (int ax, int ay) |
1254 | have_head (int ax, int ay) |
1406 | { |
1255 | { |
1407 | |
|
|
1408 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || |
1256 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || |
1409 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) |
1257 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) |
1410 | return 1; |
1258 | return 1; |
|
|
1259 | |
1411 | return 0; |
1260 | return 0; |
1412 | } |
1261 | } |
1413 | |
1262 | |
1414 | /** |
1263 | /** |
1415 | * check_head is a bit simplistic version of update_space below. |
1264 | * check_head is a bit simplistic version of update_space below. |
1416 | * basically, it only checks the that the head on space ax,ay at layer |
1265 | * basically, it only checks the that the head on space ax,ay at layer |
1417 | * needs to get sent - if so, it adds the data, sending the head |
1266 | * needs to get sent - if so, it adds the data, sending the head |
1418 | * if needed, and returning 1. If this no data needs to get |
1267 | * if needed, and returning 1. If this no data needs to get |
1419 | * sent, it returns zero. |
1268 | * sent, it returns zero. |
1420 | */ |
1269 | */ |
1421 | static int |
1270 | static int |
1422 | check_head (packet &sl, client_socket &ns, int ax, int ay, int layer) |
1271 | check_head (packet &sl, client &ns, int ax, int ay, int layer) |
1423 | { |
1272 | { |
1424 | short face_num; |
1273 | short face_num; |
1425 | |
1274 | |
1426 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) |
1275 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) |
1427 | face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; |
1276 | face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; |
… | |
… | |
1459 | * numbers the spaces differently - I think this was a leftover from |
1308 | * numbers the spaces differently - I think this was a leftover from |
1460 | * the map command, where the faces stack up. Sinces that is no longer |
1309 | * the map command, where the faces stack up. Sinces that is no longer |
1461 | * the case, it seems to make more sense to have these layer values |
1310 | * the case, it seems to make more sense to have these layer values |
1462 | * actually match. |
1311 | * actually match. |
1463 | */ |
1312 | */ |
1464 | |
|
|
1465 | static int |
1313 | static int |
1466 | update_space (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
1314 | update_space (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
1467 | { |
1315 | { |
1468 | object *ob, *head; |
1316 | object *ob, *head; |
1469 | uint16 face_num; |
1317 | uint16 face_num; |
1470 | int bx, by, i; |
1318 | int bx, by, i; |
1471 | |
1319 | |
… | |
… | |
1684 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ |
1532 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ |
1685 | * take. |
1533 | * take. |
1686 | */ |
1534 | */ |
1687 | |
1535 | |
1688 | static inline int |
1536 | static inline int |
1689 | update_smooth (packet &sl, client_socket &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
1537 | update_smooth (packet &sl, client &ns, maptile *mp, int mx, int my, int sx, int sy, int layer) |
1690 | { |
1538 | { |
1691 | object *ob; |
1539 | object *ob; |
1692 | int smoothlevel; /* old face_num; */ |
1540 | int smoothlevel; /* old face_num; */ |
1693 | |
1541 | |
1694 | ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); |
1542 | ob = GET_MAP_FACE_OBJ (mp, mx, my, layer); |
… | |
… | |
1728 | * Returns the size of a data for a map square as returned by |
1576 | * Returns the size of a data for a map square as returned by |
1729 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
1577 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
1730 | * available. |
1578 | * available. |
1731 | */ |
1579 | */ |
1732 | int |
1580 | int |
1733 | getExtendedMapInfoSize (client_socket * ns) |
1581 | getExtendedMapInfoSize (client * ns) |
1734 | { |
1582 | { |
1735 | int result = 0; |
1583 | int result = 0; |
1736 | |
1584 | |
1737 | if (ns->ext_mapinfos) |
1585 | if (ns->ext_mapinfos) |
1738 | { |
1586 | { |
1739 | if (ns->EMI_smooth) |
1587 | if (ns->EMI_smooth) |
1740 | result += 1; /*One byte for smoothlevel */ |
1588 | result += 1; /*One byte for smoothlevel */ |
1741 | } |
1589 | } |
|
|
1590 | |
1742 | return result; |
1591 | return result; |
1743 | } |
1592 | } |
1744 | |
1593 | |
1745 | /** |
1594 | /** |
1746 | * This function uses the new map1 protocol command to send the map |
1595 | * This function uses the new map1 protocol command to send the map |
… | |
… | |
1753 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
1602 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
1754 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
1603 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
1755 | * and use the other 4 bits for other informatiion. For full documentation |
1604 | * and use the other 4 bits for other informatiion. For full documentation |
1756 | * of what we send, see the doc/Protocol file. |
1605 | * of what we send, see the doc/Protocol file. |
1757 | * I will describe internally what we do: |
1606 | * I will describe internally what we do: |
1758 | * the socket->lastmap shows how the map last looked when sent to the client. |
1607 | * the ns->lastmap shows how the map last looked when sent to the client. |
1759 | * in the lastmap structure, there is a cells array, which is set to the |
1608 | * in the lastmap structure, there is a cells array, which is set to the |
1760 | * maximum viewable size (As set in config.h). |
1609 | * maximum viewable size (As set in config.h). |
1761 | * in the cells, there are faces and a count value. |
1610 | * in the cells, there are faces and a count value. |
1762 | * we use the count value to hold the darkness value. If -1, then this space |
1611 | * we use the count value to hold the darkness value. If -1, then this space |
1763 | * is not viewable. |
1612 | * is not viewable. |
… | |
… | |
1774 | uint8 eentrysize; |
1623 | uint8 eentrysize; |
1775 | uint16 ewhatstart, ewhatflag; |
1624 | uint16 ewhatstart, ewhatflag; |
1776 | uint8 extendedinfos; |
1625 | uint8 extendedinfos; |
1777 | maptile *m; |
1626 | maptile *m; |
1778 | |
1627 | |
1779 | client_socket &socket = *pl->contr->socket; |
1628 | client &socket = *pl->contr->ns; |
1780 | |
1629 | |
1781 | check_map_change (pl->contr); |
1630 | check_map_change (pl->contr); |
1782 | |
1631 | |
1783 | packet sl; |
1632 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1784 | packet esl; |
1633 | packet esl; |
1785 | |
1634 | |
1786 | sl << (socket.mapmode == Map1Cmd ? "map1 " : "map1a "); |
|
|
1787 | startlen = sl.length (); |
1635 | startlen = sl.length (); |
1788 | |
1636 | |
1789 | /*Extendedmapinfo structure initialisation */ |
1637 | /*Extendedmapinfo structure initialisation */ |
1790 | if (socket.ext_mapinfos) |
1638 | if (socket.ext_mapinfos) |
1791 | { |
1639 | { |
… | |
… | |
1835 | for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
1683 | for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
1836 | { |
1684 | { |
1837 | ax = 0; |
1685 | ax = 0; |
1838 | for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
1686 | for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
1839 | { |
1687 | { |
1840 | |
|
|
1841 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1688 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1842 | |
1689 | |
1843 | /* If this space is out of the normal viewable area, we only check |
1690 | /* If this space is out of the normal viewable area, we only check |
1844 | * the heads value ax or ay will only be greater than what |
1691 | * the heads value ax or ay will only be greater than what |
1845 | * the client wants if using the map1a command - this is because |
1692 | * the client wants if using the map1a command - this is because |
… | |
… | |
2175 | if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) |
2022 | if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) |
2176 | return; |
2023 | return; |
2177 | |
2024 | |
2178 | memset (&newmap, 0, sizeof (struct Map)); |
2025 | memset (&newmap, 0, sizeof (struct Map)); |
2179 | |
2026 | |
2180 | 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++) |
2181 | { |
|
|
2182 | 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++) |
2183 | { |
2029 | { |
2184 | ax = i; |
2030 | ax = i; |
2185 | ay = j; |
2031 | ay = j; |
2186 | m = pm; |
2032 | m = pm; |
2187 | mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
2033 | mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
|
|
2034 | |
2188 | if (mflags & P_OUT_OF_MAP) |
2035 | if (mflags & P_OUT_OF_MAP) |
2189 | continue; |
2036 | continue; |
2190 | if (mflags & P_NEED_UPDATE) |
2037 | |
2191 | update_position (m, ax, ay); |
|
|
2192 | /* 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 |
2193 | * just to reload it. This should really call something like |
2039 | * just to reload it. This should really call something like |
2194 | * swap_map, but this is much more efficient and 'good enough' |
2040 | * swap_map, but this is much more efficient and 'good enough' |
2195 | */ |
2041 | */ |
2196 | if (mflags & P_NEW_MAP) |
2042 | if (mflags & P_NEW_MAP) |
2197 | m->timeout = 50; |
2043 | m->timeout = 50; |
2198 | } |
2044 | } |
2199 | } |
2045 | |
2200 | /* do LOS after calls to update_position */ |
2046 | /* do LOS after calls to update_position */ |
2201 | if (pl->contr->do_los) |
2047 | if (pl->contr->do_los) |
2202 | { |
2048 | { |
2203 | update_los (pl); |
2049 | update_los (pl); |
2204 | pl->contr->do_los = 0; |
2050 | pl->contr->do_los = 0; |
… | |
… | |
2219 | |
2065 | |
2220 | /*****************************************************************************/ |
2066 | /*****************************************************************************/ |
2221 | void |
2067 | void |
2222 | send_plugin_custom_message (object *pl, char *buf) |
2068 | send_plugin_custom_message (object *pl, char *buf) |
2223 | { |
2069 | { |
2224 | pl->contr->socket->send_packet (buf); |
2070 | pl->contr->ns->send_packet (buf); |
2225 | } |
2071 | } |
2226 | |
2072 | |
2227 | /** |
2073 | /** |
2228 | * This sends the skill number to name mapping. We ignore |
2074 | * This sends the skill number to name mapping. We ignore |
2229 | * the params - we always send the same info no matter what. |
2075 | * the params - we always send the same info no matter what. |
2230 | */ |
2076 | */ |
2231 | void |
2077 | void |
2232 | send_skill_info (client_socket *ns, char *params) |
2078 | send_skill_info (client *ns, char *params) |
2233 | { |
2079 | { |
2234 | packet sl; |
2080 | packet sl; |
2235 | sl << "replyinfo skill_info\n"; |
2081 | sl << "replyinfo skill_info\n"; |
2236 | |
2082 | |
2237 | for (int i = 1; i < NUM_SKILLS; i++) |
2083 | for (int i = 1; i < NUM_SKILLS; i++) |
… | |
… | |
2249 | /** |
2095 | /** |
2250 | * This sends the spell path to name mapping. We ignore |
2096 | * This sends the spell path to name mapping. We ignore |
2251 | * the params - we always send the same info no matter what. |
2097 | * the params - we always send the same info no matter what. |
2252 | */ |
2098 | */ |
2253 | void |
2099 | void |
2254 | send_spell_paths (client_socket * ns, char *params) |
2100 | send_spell_paths (client * ns, char *params) |
2255 | { |
2101 | { |
2256 | packet sl; |
2102 | packet sl; |
2257 | |
2103 | |
2258 | sl << "replyinfo spell_paths\n"; |
2104 | sl << "replyinfo spell_paths\n"; |
2259 | |
2105 | |
… | |
… | |
2274 | * 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 |
2275 | */ |
2121 | */ |
2276 | void |
2122 | void |
2277 | esrv_update_spells (player *pl) |
2123 | esrv_update_spells (player *pl) |
2278 | { |
2124 | { |
2279 | if (!pl->socket->monitor_spells) |
2125 | if (!pl->ns->monitor_spells) |
2280 | return; |
2126 | return; |
2281 | |
2127 | |
2282 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
2128 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
2283 | { |
2129 | { |
2284 | if (spell->type == SPELL) |
2130 | if (spell->type == SPELL) |
… | |
… | |
2314 | |
2160 | |
2315 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
2161 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
2316 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
2162 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
2317 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
2163 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
2318 | |
2164 | |
2319 | pl->socket->send_packet (sl); |
2165 | pl->ns->send_packet (sl); |
2320 | } |
2166 | } |
2321 | } |
2167 | } |
2322 | } |
2168 | } |
2323 | } |
2169 | } |
2324 | |
2170 | |
2325 | void |
2171 | void |
2326 | esrv_remove_spell (player *pl, object *spell) |
2172 | esrv_remove_spell (player *pl, object *spell) |
2327 | { |
2173 | { |
2328 | if (!pl->socket->monitor_spells) |
2174 | if (!pl->ns->monitor_spells) |
2329 | return; |
2175 | return; |
2330 | |
2176 | |
2331 | if (!pl || !spell || spell->env != pl->ob) |
2177 | if (!pl || !spell || spell->env != pl->ob) |
2332 | { |
2178 | { |
2333 | LOG (llevError, "Invalid call to esrv_remove_spell"); |
2179 | LOG (llevError, "Invalid call to esrv_remove_spell"); |
2334 | return; |
2180 | return; |
2335 | } |
2181 | } |
2336 | |
2182 | |
2337 | packet sl; |
2183 | packet sl ("delspell"); |
2338 | |
2184 | |
2339 | sl << "delspell " |
|
|
2340 | << uint32 (spell->count); |
2185 | sl << uint32 (spell->count); |
2341 | |
2186 | |
2342 | pl->socket->send_packet (sl); |
2187 | pl->ns->send_packet (sl); |
2343 | } |
2188 | } |
2344 | |
2189 | |
2345 | /* appends the spell *spell to the Socklist we will send the data to. */ |
2190 | /* appends the spell *spell to the Socklist we will send the data to. */ |
2346 | static void |
2191 | static void |
2347 | append_spell (player *pl, packet &sl, object *spell) |
2192 | append_spell (player *pl, packet &sl, object *spell) |
… | |
… | |
2395 | { |
2240 | { |
2396 | LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); |
2241 | LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); |
2397 | return; |
2242 | return; |
2398 | } |
2243 | } |
2399 | |
2244 | |
2400 | if (!pl->socket->monitor_spells) |
2245 | if (!pl->ns->monitor_spells) |
2401 | return; |
2246 | return; |
2402 | |
2247 | |
2403 | packet sl; |
2248 | packet sl ("addspell"); |
2404 | |
|
|
2405 | sl << "addspell "; |
|
|
2406 | |
2249 | |
2407 | if (!spell) |
2250 | if (!spell) |
2408 | { |
2251 | { |
2409 | for (spell = pl->ob->inv; spell != NULL; spell = spell->below) |
2252 | for (spell = pl->ob->inv; spell != NULL; spell = spell->below) |
2410 | { |
2253 | { |
… | |
… | |
2424 | if (spell->type != SPELL) |
2267 | if (spell->type != SPELL) |
2425 | continue; |
2268 | continue; |
2426 | |
2269 | |
2427 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
2270 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
2428 | { |
2271 | { |
2429 | pl->socket->send_packet (sl); |
2272 | pl->ns->send_packet (sl); |
2430 | |
2273 | |
2431 | sl.reset (); |
2274 | sl.reset (); |
2432 | sl << "addspell "; |
2275 | sl << "addspell "; |
2433 | } |
2276 | } |
2434 | |
2277 | |
… | |
… | |
2448 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
2291 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
2449 | fatal (0); |
2292 | fatal (0); |
2450 | } |
2293 | } |
2451 | |
2294 | |
2452 | /* finally, we can send the packet */ |
2295 | /* finally, we can send the packet */ |
2453 | pl->socket->send_packet (sl); |
2296 | pl->ns->send_packet (sl); |
2454 | } |
2297 | } |
2455 | |
2298 | |