1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
9 | * it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
11 | * (at your option) any later version. |
11 | * any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, but |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
16 | * GNU General Public License for more details. |
16 | * for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License along |
19 | * along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
21 | * |
21 | * |
22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /** |
25 | /** |
26 | * \file |
26 | * \file |
27 | * Client/server logic. |
27 | * Client/server logic. |
… | |
… | |
264 | |
264 | |
265 | flags = query_flags (head); |
265 | flags = query_flags (head); |
266 | if (QUERY_FLAG (head, FLAG_NO_PICK)) |
266 | if (QUERY_FLAG (head, FLAG_NO_PICK)) |
267 | flags |= F_NOPICK; |
267 | flags |= F_NOPICK; |
268 | |
268 | |
269 | if (!(ns.faces_sent[head->face] & NS_FACESENT_FACE)) |
|
|
270 | esrv_send_face (&ns, head->face, 0); |
269 | ns.send_face (head->face); |
|
|
270 | ns.flush_fx (); |
271 | |
271 | |
272 | if (QUERY_FLAG (head, FLAG_ANIMATE) && !ns.anims_sent[head->animation_id]) |
272 | if (QUERY_FLAG (head, FLAG_ANIMATE) && !ns.anims_sent[head->animation_id]) |
273 | esrv_send_animation (&ns, head->animation_id); |
273 | ns.send_animation (head->animation_id); |
274 | |
274 | |
275 | sl << uint32 (head->count) |
275 | sl << uint32 (head->count) |
276 | << uint32 (flags) |
276 | << uint32 (flags) |
277 | << uint32 (QUERY_FLAG (head, FLAG_NO_PICK) ? -1 : WEIGHT (head)) |
277 | << uint32 (QUERY_FLAG (head, FLAG_NO_PICK) ? -1 : WEIGHT (head)) |
278 | << uint32 (head->face); |
278 | << uint32 (head->face); |
… | |
… | |
356 | packet sl; |
356 | packet sl; |
357 | sl.printf ("item%d ", pl->contr->ns->itemcmd); |
357 | sl.printf ("item%d ", pl->contr->ns->itemcmd); |
358 | |
358 | |
359 | sl << uint32 (0); |
359 | sl << uint32 (0); |
360 | |
360 | |
361 | if (!(pl->contr->ns->faces_sent[empty_face] & NS_FACESENT_FACE)) |
361 | pl->contr->ns->send_face (empty_face); |
362 | esrv_send_face (pl->contr->ns, empty_face, 0); |
362 | pl->contr->ns->flush_fx (); |
363 | |
363 | |
364 | if (pl->contr->ns->look_position) |
364 | if (pl->contr->ns->look_position) |
365 | { |
365 | { |
366 | char buf[80]; |
366 | char buf[80]; |
367 | snprintf (buf, 80, "Apply this to see %d previous items", FLOORBOX_PAGESIZE); |
367 | snprintf (buf, 80, "Apply this to see %d previous items", FLOORBOX_PAGESIZE); |
… | |
… | |
555 | ns->last_weight = weight; |
555 | ns->last_weight = weight; |
556 | } |
556 | } |
557 | |
557 | |
558 | if (flags & UPD_FACE) |
558 | if (flags & UPD_FACE) |
559 | { |
559 | { |
560 | if (!(ns->faces_sent[op->face] & NS_FACESENT_FACE)) |
|
|
561 | esrv_send_face (ns, op->face, 0); |
560 | ns->send_face (op->face); |
562 | |
561 | ns->flush_fx (); |
563 | sl << uint32 (op->face); |
562 | sl << uint32 (op->face); |
564 | } |
563 | } |
565 | |
564 | |
566 | if (flags & UPD_NAME) |
565 | if (flags & UPD_NAME) |
567 | { |
566 | { |
… | |
… | |
692 | |
691 | |
693 | /** |
692 | /** |
694 | * Takes a player and object count (tag) and returns the actual object |
693 | * Takes a player and object count (tag) and returns the actual object |
695 | * pointer, or null if it can't be found. |
694 | * pointer, or null if it can't be found. |
696 | */ |
695 | */ |
697 | |
|
|
698 | object * |
696 | object * |
699 | esrv_get_ob_from_count (object *pl, tag_t count) |
697 | esrv_get_ob_from_count (object *pl, tag_t count) |
700 | { |
698 | { |
701 | object *op, *tmp; |
|
|
702 | |
|
|
703 | if (pl->count == count) |
699 | if (pl->count == count) |
704 | return pl; |
700 | return pl; |
705 | |
701 | |
706 | for (op = pl->inv; op; op = op->below) |
702 | for (object *op = pl->inv; op; op = op->below) |
707 | if (op->count == count) |
703 | if (op->count == count) |
708 | return op; |
704 | return op; |
709 | else if (op->type == CONTAINER && pl->container == op) |
705 | else if (op->type == CONTAINER && pl->container == op) |
710 | for (tmp = op->inv; tmp; tmp = tmp->below) |
706 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
711 | if (tmp->count == count) |
707 | if (tmp->count == count) |
712 | return tmp; |
708 | return tmp; |
713 | |
709 | |
714 | for (op = GET_MAP_OB (pl->map, pl->x, pl->y); op; op = op->above) |
710 | for (object *op = GET_MAP_OB (pl->map, pl->x, pl->y); op; op = op->above) |
715 | if (op->head && op->head->count == count) |
711 | if (op->head && op->head->count == count) |
716 | return op; |
712 | return op; |
717 | else if (op->count == count) |
713 | else if (op->count == count) |
718 | return op; |
714 | return op; |
719 | else if (op->type == CONTAINER && pl->container == op) |
715 | else if (op->type == CONTAINER && pl->container == op) |
720 | for (tmp = op->inv; tmp; tmp = tmp->below) |
716 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
721 | if (tmp->count == count) |
717 | if (tmp->count == count) |
722 | return tmp; |
718 | return tmp; |
723 | |
719 | |
|
|
720 | #if 0 |
|
|
721 | /* If the high bit is set, player examined a pseudo object. */ |
|
|
722 | if (count & 0x80000000) |
|
|
723 | return 0; |
|
|
724 | #endif |
|
|
725 | |
724 | return 0; |
726 | return 0; |
725 | } |
727 | } |
726 | |
728 | |
727 | |
|
|
728 | /** Client wants to examine some object. So lets do so. */ |
729 | /** Client wants to examine some object. So lets do so. */ |
729 | void |
730 | void |
730 | ExamineCmd (char *buf, int len, player *pl) |
731 | ExamineCmd (char *buf, int len, player *pl) |
731 | { |
732 | { |
732 | tag_t tag = atoi (buf); |
733 | tag_t tag = atoi (buf); |
733 | |
|
|
734 | /* If the high bit is set, player examined a pseudo object. */ |
|
|
735 | if (tag & 0x80000000) |
|
|
736 | return; |
|
|
737 | |
734 | |
738 | object *op = esrv_get_ob_from_count (pl->ob, tag); |
735 | object *op = esrv_get_ob_from_count (pl->ob, tag); |
739 | |
736 | |
740 | if (!op) |
737 | if (!op) |
741 | { |
738 | { |
742 | LOG (llevDebug, "Player '%s' tried to examine the unknown object (%ld)\n", &pl->ob->name, tag); |
739 | LOG (llevDebug, "Player '%s' tried to examine the unknown object (%ld)\n", &pl->ob->name, tag); |
743 | return; |
740 | return; |
744 | } |
741 | } |
745 | |
742 | |
746 | examine (pl->ob, op); |
743 | examine (pl->ob, op); |
|
|
744 | } |
|
|
745 | |
|
|
746 | /** Client wants to examine some object. So lets do so. */ |
|
|
747 | void |
|
|
748 | ExCmd (char *buf, int len, player *pl) |
|
|
749 | { |
|
|
750 | tag_t tag = atoi (buf); |
|
|
751 | |
|
|
752 | if (object *op = esrv_get_ob_from_count (pl->ob, tag)) |
|
|
753 | { |
|
|
754 | std::string s = op->describe (pl->ob); |
|
|
755 | |
|
|
756 | packet sl ("ex"); |
|
|
757 | sl << ber32 (tag) << s.c_str (); |
|
|
758 | |
|
|
759 | pl->ns->send_packet (sl); |
|
|
760 | } |
747 | } |
761 | } |
748 | |
762 | |
749 | /** Client wants to apply some object. Lets do so. */ |
763 | /** Client wants to apply some object. Lets do so. */ |
750 | void |
764 | void |
751 | ApplyCmd (char *buf, int len, player *pl) |
765 | ApplyCmd (char *buf, int len, player *pl) |
… | |
… | |
838 | |
852 | |
839 | m = get_map_from_coord (op->map, &x, &y); |
853 | m = get_map_from_coord (op->map, &x, &y); |
840 | if (!m) |
854 | if (!m) |
841 | return; |
855 | return; |
842 | |
856 | |
843 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL && tmp->above != NULL; tmp = tmp->above); |
857 | for (tmp = GET_MAP_OB (m, x, y); tmp && tmp->above; tmp = tmp->above) |
|
|
858 | ; |
844 | |
859 | |
845 | for (; tmp != NULL; tmp = tmp->below) |
860 | for (; tmp; tmp = tmp->below) |
846 | { |
861 | { |
847 | if (tmp->invisible && !QUERY_FLAG (op, FLAG_WIZ)) |
862 | if (tmp->invisible && !QUERY_FLAG (op, FLAG_WIZ)) |
848 | continue; |
863 | continue; |
849 | |
864 | |
850 | if (!flag) |
865 | if (!flag) |
… | |
… | |
888 | int dx, dy; |
903 | int dx, dy; |
889 | char *cp; |
904 | char *cp; |
890 | |
905 | |
891 | dx = atoi (buf); |
906 | dx = atoi (buf); |
892 | if (!(cp = strchr (buf, ' '))) |
907 | if (!(cp = strchr (buf, ' '))) |
893 | { |
|
|
894 | return; |
908 | return; |
895 | } |
909 | |
896 | dy = atoi (cp); |
910 | dy = atoi (cp); |
897 | |
|
|
898 | if (fabs (dx) > pl->ns->mapx / 2 || fabs (dy) > pl->ns->mapy / 2) |
911 | if (fabs (dx) > pl->ns->mapx / 2 || fabs (dy) > pl->ns->mapy / 2) |
899 | return; |
912 | return; |
900 | |
913 | |
901 | if (pl->blocked_los[dx + pl->ns->mapx / 2][dy + pl->ns->mapy / 2]) |
914 | if (pl->blocked_los[dx + pl->ns->mapx / 2][dy + pl->ns->mapy / 2]) |
902 | return; |
915 | return; |