1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License 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 Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /** |
25 | /** |
… | |
… | |
47 | |
48 | |
48 | /** |
49 | /** |
49 | * This is a similar to query_name, but returns flags |
50 | * This is a similar to query_name, but returns flags |
50 | * to be sent to client. |
51 | * to be sent to client. |
51 | */ |
52 | */ |
52 | unsigned int |
53 | static unsigned int |
53 | query_flags (object *op) |
54 | query_flags (object *op) |
54 | { |
55 | { |
55 | unsigned int flags = 0; |
56 | unsigned int flags = 0; |
56 | |
57 | |
57 | if (QUERY_FLAG (op, FLAG_APPLIED)) |
58 | if (QUERY_FLAG (op, FLAG_APPLIED)) |
… | |
… | |
85 | default: |
86 | default: |
86 | flags = a_applied; |
87 | flags = a_applied; |
87 | break; |
88 | break; |
88 | } |
89 | } |
89 | |
90 | |
90 | if (op->type == CONTAINER && ((op->env && op->env->container == op) || (!op->env && QUERY_FLAG (op, FLAG_APPLIED)))) |
91 | if (op->is_open_container ()) |
91 | flags |= F_OPEN; |
92 | flags |= F_OPEN; |
92 | |
93 | |
93 | if (QUERY_FLAG (op, FLAG_KNOWN_CURSED)) |
94 | if (QUERY_FLAG (op, FLAG_KNOWN_CURSED)) |
94 | { |
95 | { |
95 | if (QUERY_FLAG (op, FLAG_DAMNED)) |
96 | if (QUERY_FLAG (op, FLAG_DAMNED)) |
… | |
… | |
113 | * animation of face to the client. |
114 | * animation of face to the client. |
114 | */ |
115 | */ |
115 | static void |
116 | static void |
116 | add_object_to_socklist (client &ns, packet &sl, object *head) |
117 | add_object_to_socklist (client &ns, packet &sl, object *head) |
117 | { |
118 | { |
118 | char item_n[MAX_BUF]; |
|
|
119 | const char *item_p; |
|
|
120 | |
|
|
121 | int flags = query_flags (head); |
119 | int flags = query_flags (head); |
|
|
120 | |
122 | if (QUERY_FLAG (head, FLAG_NO_PICK)) |
121 | if (QUERY_FLAG (head, FLAG_NO_PICK)) |
123 | flags |= F_NOPICK; |
122 | flags |= F_NOPICK; |
124 | |
123 | |
125 | ns.send_face (head->face, -50); |
124 | ns.send_face (head->face, -50); |
126 | ns.flush_fx (); |
125 | ns.flush_fx (); |
… | |
… | |
131 | sl << uint32 (head->count) |
130 | sl << uint32 (head->count) |
132 | << uint32 (flags) |
131 | << uint32 (flags) |
133 | << uint32 (QUERY_FLAG (head, FLAG_NO_PICK) ? -1 : head->client_weight ()) |
132 | << uint32 (QUERY_FLAG (head, FLAG_NO_PICK) ? -1 : head->client_weight ()) |
134 | << uint32 (head->face); |
133 | << uint32 (head->face); |
135 | |
134 | |
136 | int len; |
|
|
137 | |
|
|
138 | if (!head->custom_name) |
135 | if (!head->custom_name) |
139 | { |
136 | { |
140 | strncpy (item_n, query_base_name (head, 0), 127); |
137 | const char *name; |
141 | item_n[127] = 0; |
138 | uint8 *len = sl.cur++; // patch up length later |
142 | len = strlen (item_n); |
139 | |
143 | item_p = query_base_name (head, 1); |
140 | name = query_base_name (head, 0); sl << data (name, min (127, strlen (name))); |
|
|
141 | sl << uint8 (0); |
|
|
142 | name = query_base_name (head, 1); sl << data (name, min (127, strlen (name))); |
|
|
143 | |
|
|
144 | *len = sl.cur - len - 1; |
144 | } |
145 | } |
145 | else |
146 | else |
146 | { |
147 | { |
147 | strncpy (item_n, head->custom_name, 127); |
148 | int len = min (head->custom_name.length (), 127); |
148 | item_n[127] = 0; |
|
|
149 | len = strlen (item_n); |
|
|
150 | item_p = head->custom_name; |
|
|
151 | } |
|
|
152 | |
149 | |
153 | strncpy (item_n + len + 1, item_p, 127); |
150 | sl << uint8 (len * 2 + 1) |
154 | item_n[254] = 0; |
151 | << data (head->custom_name, len) |
155 | len += strlen (item_n + 1 + len) + 1; |
152 | << uint8 (0) |
|
|
153 | << data (head->custom_name, len); |
|
|
154 | } |
156 | |
155 | |
157 | sl << data8 (item_n, len) |
|
|
158 | << uint16 (head->animation_id); |
156 | sl << uint16 (head->animation_id); |
159 | |
157 | |
160 | int anim_speed = !head->flag [FLAG_ANIMATE] ? 0 |
158 | int anim_speed = !head->flag [FLAG_ANIMATE] ? 0 |
161 | : head->anim_speed ? clamp (head->anim_speed, 1, 255) |
159 | : head->anim_speed ? clamp (head->anim_speed, 1, 255) |
162 | : 1. / clamp (fabs (head->speed), 1./255., 1./1.); |
160 | : 1. / clamp (head->speed, 1./255., 1./1.); |
163 | |
161 | |
164 | sl << uint8 (anim_speed) |
162 | sl << uint8 (anim_speed) |
165 | << uint32 (head->nrof); |
163 | << uint32 (head->nrof); |
166 | |
164 | |
167 | if (ns.itemcmd == 2) |
165 | if (ns.itemcmd == 2) |
… | |
… | |
418 | |
416 | |
419 | if (flags & UPD_NAME) |
417 | if (flags & UPD_NAME) |
420 | { |
418 | { |
421 | int len; |
419 | int len; |
422 | const char *item_p; |
420 | const char *item_p; |
423 | char item_n[MAX_BUF]; |
421 | char item_n[127 * 2]; |
424 | |
422 | |
425 | if (!op->custom_name) |
423 | if (!op->custom_name) |
426 | { |
424 | { |
427 | strncpy (item_n, query_base_name (op, 0), 127); |
425 | len = assign (item_n, query_base_name (op, 0), 127); |
428 | item_n[127] = 0; |
|
|
429 | len = strlen (item_n); |
|
|
430 | item_p = query_base_name (op, 1); |
426 | item_p = query_base_name (op, 1); |
431 | } |
427 | } |
432 | else |
428 | else |
433 | { |
429 | { |
434 | strncpy (item_n, op->custom_name, 127); |
430 | len = assign (item_n, &op->custom_name, 127); |
435 | item_n[127] = 0; |
|
|
436 | len = strlen (item_n); |
|
|
437 | item_p = op->custom_name; |
431 | item_p = &op->custom_name; |
438 | } |
432 | } |
439 | |
433 | |
440 | strncpy (item_n + len + 1, item_p, 127); |
434 | len += assign (item_n + len, item_p, 127); |
441 | item_n[254] = 0; |
|
|
442 | len += strlen (item_n + 1 + len) + 1; |
|
|
443 | |
435 | |
444 | sl << data8 (item_n, len); |
436 | sl << data8 (item_n, len); |
445 | } |
437 | } |
446 | |
438 | |
447 | if (flags & UPD_ANIM) |
439 | if (flags & UPD_ANIM) |
… | |
… | |
455 | { |
447 | { |
456 | if (op->anim_speed) |
448 | if (op->anim_speed) |
457 | anim_speed = op->anim_speed; |
449 | anim_speed = op->anim_speed; |
458 | else |
450 | else |
459 | { |
451 | { |
460 | if (fabs (op->speed) < 0.001) |
452 | if (op->speed < 0.001) |
461 | anim_speed = 255; |
453 | anim_speed = 255; |
462 | else if (fabs (op->speed) >= 1.0) |
454 | else if (op->speed >= 1.0) |
463 | anim_speed = 1; |
455 | anim_speed = 1; |
464 | else |
456 | else |
465 | anim_speed = (int) (1.0 / fabs (op->speed)); |
457 | anim_speed = 1. / op->speed; |
466 | } |
458 | } |
467 | |
459 | |
468 | if (anim_speed > 255) |
460 | if (anim_speed > 255) |
469 | anim_speed = 255; |
461 | anim_speed = 255; |
470 | } |
462 | } |
… | |
… | |
529 | |
521 | |
530 | /** |
522 | /** |
531 | * Takes a player and object count (tag) and returns the actual object |
523 | * Takes a player and object count (tag) and returns the actual object |
532 | * pointer, or null if it can't be found. |
524 | * pointer, or null if it can't be found. |
533 | */ |
525 | */ |
534 | object * |
526 | static object * |
535 | esrv_get_ob_from_count (object *pl, tag_t count) |
527 | esrv_get_ob_from_count (object *pl, tag_t count) |
536 | { |
528 | { |
537 | if (pl->count == count) |
529 | if (pl->count == count) |
538 | return pl; |
530 | return pl; |
539 | |
531 | |
540 | for (object *op = pl->inv; op; op = op->below) |
532 | for (object *op = pl->inv; op; op = op->below) |
541 | if (op->count == count) |
533 | if (op->count == count) |
542 | return op; |
534 | return op; |
543 | else if (op->type == CONTAINER && pl->container == op) |
535 | else if (op->type == CONTAINER && pl->container_ () == op) |
544 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
536 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
545 | if (tmp->count == count) |
537 | if (tmp->count == count) |
546 | return tmp; |
538 | return tmp; |
547 | |
539 | |
548 | for (object *op = GET_MAP_OB (pl->map, pl->x, pl->y); op; op = op->above) |
540 | for (object *op = GET_MAP_OB (pl->map, pl->x, pl->y); op; op = op->above) |
549 | if (op->head && op->head->count == count) |
541 | if (op->head && op->head->count == count) |
550 | return op; |
542 | return op; |
551 | else if (op->count == count) |
543 | else if (op->count == count) |
552 | return op; |
544 | return op; |
553 | else if (op->type == CONTAINER && pl->container == op) |
545 | else if (op->type == CONTAINER && pl->container_ () == op) |
554 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
546 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
555 | if (tmp->count == count) |
547 | if (tmp->count == count) |
556 | return tmp; |
548 | return tmp; |
557 | |
549 | |
558 | #if 0 |
550 | #if 0 |
… | |
… | |
627 | { |
619 | { |
628 | LOG (llevDebug, "Player '%s' tried to apply the unknown object (%d)\n", &pl->ob->name, tag); |
620 | LOG (llevDebug, "Player '%s' tried to apply the unknown object (%d)\n", &pl->ob->name, tag); |
629 | return; |
621 | return; |
630 | } |
622 | } |
631 | |
623 | |
632 | player_apply (pl->ob, op, 0, 0); |
624 | pl->ob->apply (op); |
633 | } |
625 | } |
634 | |
626 | |
635 | /** Client wants to lock some object. Lets do so. */ |
627 | /** Client wants to lock some object. Lets do so. */ |
636 | void |
628 | void |
637 | LockItem (char *data, int len, player *pl) |
629 | LockItem (char *data, int len, player *pl) |
… | |
… | |
678 | * Tero.Haatanen@lut.fi ] |
670 | * Tero.Haatanen@lut.fi ] |
679 | */ |
671 | */ |
680 | static void |
672 | static void |
681 | look_at (player *pl, int dx, int dy) |
673 | look_at (player *pl, int dx, int dy) |
682 | { |
674 | { |
683 | dynbuf_text buf; |
675 | dynbuf_text &buf = msg_dynbuf; buf.clear (); |
684 | object *ob = pl->ob; |
676 | object *ob = pl->ob; |
685 | |
677 | |
686 | if (!pl->observe->map) |
678 | if (!pl->observe->map) |
687 | return; |
679 | return; |
688 | |
680 | |
… | |
… | |
697 | { |
689 | { |
698 | mapspace &ms = *pos; |
690 | mapspace &ms = *pos; |
699 | ms.update (); |
691 | ms.update (); |
700 | |
692 | |
701 | buf.printf (" map: %s%+d%+d (%+d%+d)\n" |
693 | buf.printf (" map: %s%+d%+d (%+d%+d)\n" |
702 | " smell %u/%u; flags %x; light %d; block %x; slow %x; on %x; off %x; volume %lld\n\n", |
694 | " smell %u/%u; flags %x; light %d; block %x; slow %x; on %x; off %x; items %d, volume %lld\n\n", |
703 | &pos.m->path, pos.x, pos.y, dx, dy, |
695 | &pos.m->path, pos.x, pos.y, dx, dy, |
704 | (unsigned int)ms.smell, (unsigned int)mapspace::smellcount, ms.flags (), ms.light, |
696 | (unsigned int)ms.smell, (unsigned int)mapspace::smellcount, ms.flags (), ms.light, |
705 | ms.move_block, ms.move_slow, ms.move_on, ms.move_off, (long long)ms.volume () |
697 | ms.move_block, ms.move_slow, ms.move_on, ms.move_off, (int)ms.items (), (long long)ms.volume () |
706 | ); |
698 | ); |
707 | } |
699 | } |
708 | else |
700 | else |
709 | buf << "off-map\n\n"; |
701 | buf << "off-map\n\n"; |
710 | } |
702 | } |
… | |
… | |
722 | { |
714 | { |
723 | if (tmp->invisible && !QUERY_FLAG (ob, FLAG_WIZ)) |
715 | if (tmp->invisible && !QUERY_FLAG (ob, FLAG_WIZ)) |
724 | continue; |
716 | continue; |
725 | |
717 | |
726 | if (wiz) |
718 | if (wiz) |
727 | buf.printf (" - %s (%d).\n", query_name (tmp), tmp->count); |
719 | buf.printf (" - %s (%d) %s\n", query_name (tmp), tmp->count, tmp->uuid.c_str ()); |
728 | else |
720 | else |
729 | buf.printf (" - %s.\n", query_name (tmp)); |
721 | buf.printf (" - %s.\n", query_name (tmp)); |
730 | |
722 | |
731 | object *head = tmp->head_ (); |
723 | object *head = tmp->head_ (); |
732 | |
724 | |
… | |
… | |
780 | /* If it is an active container, then we should drop all objects |
772 | /* If it is an active container, then we should drop all objects |
781 | * in the container and not the container itself. |
773 | * in the container and not the container itself. |
782 | */ |
774 | */ |
783 | if (op->inv && QUERY_FLAG (op, FLAG_APPLIED)) |
775 | if (op->inv && QUERY_FLAG (op, FLAG_APPLIED)) |
784 | { |
776 | { |
785 | int cnt = MAX_ITEM_PER_DROP; |
777 | int cnt = MAX_ITEM_PER_ACTION; |
786 | |
778 | |
787 | for (object *current = op->inv; current && cnt--; ) |
779 | for (object *current = op->inv; current && cnt--; ) |
788 | { |
780 | { |
789 | object *next = current->below; |
781 | object *next = current->below; |
790 | drop_object (pl, current, 0); |
782 | drop_object (pl, current, 0); |