ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/item.C
(Generate patch)

Comparing deliantra/server/socket/item.C (file contents):
Revision 1.67 by root, Tue May 6 19:47:56 2008 UTC vs.
Revision 1.89 by root, Sat Apr 3 02:27:24 2010 UTC

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/**
… …
37#include <sproto.h> 38#include <sproto.h>
38 39
39/** This is the maximum number of bytes we expect any one item to take up */ 40/** This is the maximum number of bytes we expect any one item to take up */
40#define MAXITEMLEN 300 41#define MAXITEMLEN 300
41 42
42#if 0
43tag_t
44client_container::tag () const
45{
46 switch (type)
47 {
48 case CC_INVENTORY:
49 return ns->pl->count;
50 case CC_MAPSPACE:
51 return 0;
52 case CC_CONTAINER:
53 return env->count;
54 }
55
56 abort ();
57}
58
59void
60client_container::clear ()
61{
62 switch (type)
63 {
64 case CC_INVENTORY:
65 abort ();
66
67 case CC_MAPSPACE:
68 case CC_CONTAINER:
69 ns->send_packet_printf ("delinv %d", tag ());
70 break;
71 }
72
73 for (iterator i = begin (); i != end (); ++i)
74 i->op->seen_by = 0;
75
76 vector< refitem, slice_allocator<refitem> >::clear ();
77}
78
79inline iterator
80client_container::merge_item (iterator i, object *op)
81{
82 if (i != end () && i->op == op)
83 return ++i;
84
85 if (op->seen_by)
86 return; // seen by another entity already
87
88 op->seen_by = this;
89
90 refitem ref;
91 ref.op = op;
92
93 return insert (i, ref);
94}
95
96void
97client_container::update (int offset)
98{
99 iterator i = begin ();
100
101 switch (type)
102 {
103 case CC_INVENTORY:
104 case CC_CONTAINER:
105 {
106 object *env = type == CC_INVENTORY
107 ? ns->pl->ob
108 : this->env;
109
110 // pass 1, erase all objects no longer in container
111 for (iterator j = begin (); j != end (); ++j)
112 if (j->op->env != env)
113 {
114 j->op->seen_by = 0;
115 erase (j);
116 }
117
118 // pass 2 merge items
119 for (object *op = env->inv; op; op = op->below)
120 {
121 if (--offset < 0)
122 i = merge_item (i, op);
123 else if (offset < -FLOORBOX_PAGESIZE)
124 break;
125 }
126 }
127 break;
128
129 case CC_MAPSPACE:
130 {
131 // pass 1, erase all objects no longer on space
132 for (iterator j = begin (); j != end (); ++j)
133 if (j->op->x != x || j->op->y != y || j->op->map != map)
134 {
135 j->op->seen_by = 0;
136 erase (j);
137 }
138
139 // pass 2 merge items
140 for (object *op = GET_MAP_OB (map, x, y); op; op = op->above)
141 {
142 if (--offset < 0)
143 i = merge_item (i, op);
144 else if (offset < -FLOORBOX_PAGESIZE)
145 break;
146 }
147 }
148 break;
149 }
150
151 // pass 3, erase all extra items
152 for (iterator j = i; j != end (); ++j)
153 j->op->seen_by = 0;
154
155 if (i != end ())
156 erase (i, end ());
157}
158
159void
160client_container::set_mapspace (maptile *map, int x, int y)
161{
162 if (type == CC_MAPSPACE
163 && this->map == map
164 && this->x == x
165 && this->y == y)
166 return;
167
168 clear ();
169
170 type = CC_MAPSPACE;
171 this->map = map;
172 this->x = x;
173 this->y = y;
174}
175
176void
177client_container::set_container (object *env)
178{
179}
180#endif
181
182/******************************************************************************* 43/*******************************************************************************
183 * 44 *
184 * Functions related to sending object data to the client. 45 * Functions related to sending object data to the client.
185 * 46 *
186 ******************************************************************************/ 47 ******************************************************************************/
187 48
188/** 49/**
189 * This is a similar to query_name, but returns flags 50 * This is a similar to query_name, but returns flags
190 * to be sent to client. 51 * to be sent to client.
191 */ 52 */
192unsigned int 53static unsigned int
193query_flags (object *op) 54query_flags (object *op)
194{ 55{
195 unsigned int flags = 0; 56 unsigned int flags = 0;
196 57
197 if (QUERY_FLAG (op, FLAG_APPLIED)) 58 if (QUERY_FLAG (op, FLAG_APPLIED))
… …
225 default: 86 default:
226 flags = a_applied; 87 flags = a_applied;
227 break; 88 break;
228 } 89 }
229 90
230 if (op->type == CONTAINER && ((op->env && op->env->container == op) || (!op->env && QUERY_FLAG (op, FLAG_APPLIED)))) 91 if (op->is_open_container ())
231 flags |= F_OPEN; 92 flags |= F_OPEN;
232 93
233 if (QUERY_FLAG (op, FLAG_KNOWN_CURSED)) 94 if (QUERY_FLAG (op, FLAG_KNOWN_CURSED))
234 { 95 {
235 if (QUERY_FLAG (op, FLAG_DAMNED)) 96 if (QUERY_FLAG (op, FLAG_DAMNED))
… …
253 * animation of face to the client. 114 * animation of face to the client.
254 */ 115 */
255static void 116static void
256add_object_to_socklist (client &ns, packet &sl, object *head) 117add_object_to_socklist (client &ns, packet &sl, object *head)
257{ 118{
258 char item_n[MAX_BUF];
259 const char *item_p;
260
261 int flags = query_flags (head); 119 int flags = query_flags (head);
120
262 if (QUERY_FLAG (head, FLAG_NO_PICK)) 121 if (QUERY_FLAG (head, FLAG_NO_PICK))
263 flags |= F_NOPICK; 122 flags |= F_NOPICK;
264 123
265 ns.send_face (head->face, -50); 124 ns.send_face (head->face, -50);
266 ns.flush_fx (); 125 ns.flush_fx ();
… …
271 sl << uint32 (head->count) 130 sl << uint32 (head->count)
272 << uint32 (flags) 131 << uint32 (flags)
273 << uint32 (QUERY_FLAG (head, FLAG_NO_PICK) ? -1 : head->client_weight ()) 132 << uint32 (QUERY_FLAG (head, FLAG_NO_PICK) ? -1 : head->client_weight ())
274 << uint32 (head->face); 133 << uint32 (head->face);
275 134
276 int len;
277
278 if (!head->custom_name) 135 if (!head->custom_name)
279 { 136 {
280 strncpy (item_n, query_base_name (head, 0), 127); 137 const char *name;
281 item_n[127] = 0; 138 uint8 *len = sl.cur++; // patch up length later
282 len = strlen (item_n); 139
283 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;
284 } 145 }
285 else 146 else
286 { 147 {
287 strncpy (item_n, head->custom_name, 127); 148 int len = min (head->custom_name.length (), 127);
288 item_n[127] = 0;
289 len = strlen (item_n);
290 item_p = head->custom_name;
291 }
292 149
293 strncpy (item_n + len + 1, item_p, 127); 150 sl << uint8 (len * 2 + 1)
294 item_n[254] = 0; 151 << data (head->custom_name, len)
295 len += strlen (item_n + 1 + len) + 1; 152 << uint8 (0)
153 << data (head->custom_name, len);
154 }
296 155
297 sl << data8 (item_n, len)
298 << uint16 (head->animation_id); 156 sl << uint16 (head->animation_id);
299 157
300 int anim_speed = !head->flag [FLAG_ANIMATE] ? 0 158 int anim_speed = !head->flag [FLAG_ANIMATE] ? 0
301 : head->anim_speed ? clamp (head->anim_speed, 1, 255) 159 : head->anim_speed ? clamp (head->anim_speed, 1, 255)
302 : 1. / clamp (fabs (head->speed), 1./255., 1./1.); 160 : 1. / clamp (head->speed, 1./255., 1./1.);
303 161
304 sl << uint8 (anim_speed) 162 sl << uint8 (anim_speed)
305 << uint32 (head->nrof); 163 << uint32 (head->nrof);
306 164
307 if (ns.itemcmd == 2) 165 if (ns.itemcmd == 2)
308 sl << uint16 (head->client_type); 166 sl << uint16 (head->client_type);
309
310 SET_FLAG (head, FLAG_CLIENT_SENT);
311} 167}
312 168
313static faceidx 169static faceidx
314need_face_now (player *pl, const char *name) 170need_face_now (player *pl, const char *name)
315{ 171{
… …
525 381
526 client *ns = pl->contr->ns; 382 client *ns = pl->contr->ns;
527 if (!ns) 383 if (!ns)
528 return; 384 return;
529 385
530 if (!QUERY_FLAG (op, FLAG_CLIENT_SENT))
531 {
532 /* FLAG_CLIENT_SENT is debug only. We are using it to see where
533 * this is happening - we can set a breakpoint here in the debugger
534 * and track back the call.
535 */
536 LOG (llevDebug, "We have not sent item %s (%d)\n", &op->name, op->count);
537 }
538
539 packet sl ("upditem"); 386 packet sl ("upditem");
540 387
541 sl << uint8 (flags); 388 sl << uint8 (flags);
542 389
543 op = op->head_ (); 390 op = op->head_ ();
… …
550 if (flags & UPD_FLAGS) 397 if (flags & UPD_FLAGS)
551 sl << uint32 (query_flags (op)); 398 sl << uint32 (query_flags (op));
552 399
553 if (flags & UPD_WEIGHT) 400 if (flags & UPD_WEIGHT)
554 { 401 {
555 sint32 weight = op->flag [FLAG_NO_PICK] ? -1 : op->client_weight (); 402 sint32 weight = op->client_weight ();
556 403
557 if (op) 404 if (op == pl)
558 ns->last_weight = weight; 405 ns->last_weight = weight;
559 406
560 sl << uint32 (weight); 407 sl << uint32 (weight);
561 } 408 }
562 409
… …
569 416
570 if (flags & UPD_NAME) 417 if (flags & UPD_NAME)
571 { 418 {
572 int len; 419 int len;
573 const char *item_p; 420 const char *item_p;
574 char item_n[MAX_BUF]; 421 char item_n[127 * 2];
575 422
576 if (!op->custom_name) 423 if (!op->custom_name)
577 { 424 {
578 strncpy (item_n, query_base_name (op, 0), 127); 425 len = assign (item_n, query_base_name (op, 0), 127);
579 item_n[127] = 0;
580 len = strlen (item_n);
581 item_p = query_base_name (op, 1); 426 item_p = query_base_name (op, 1);
582 } 427 }
583 else 428 else
584 { 429 {
585 strncpy (item_n, op->custom_name, 127); 430 len = assign (item_n, &op->custom_name, 127);
586 item_n[127] = 0;
587 len = strlen (item_n);
588 item_p = op->custom_name; 431 item_p = &op->custom_name;
589 } 432 }
590 433
591 strncpy (item_n + len + 1, item_p, 127); 434 len += assign (item_n + len, item_p, 127);
592 item_n[254] = 0;
593 len += strlen (item_n + 1 + len) + 1;
594 435
595 sl << data8 (item_n, len); 436 sl << data8 (item_n, len);
596 } 437 }
597 438
598 if (flags & UPD_ANIM) 439 if (flags & UPD_ANIM)
… …
606 { 447 {
607 if (op->anim_speed) 448 if (op->anim_speed)
608 anim_speed = op->anim_speed; 449 anim_speed = op->anim_speed;
609 else 450 else
610 { 451 {
611 if (fabs (op->speed) < 0.001) 452 if (op->speed < 0.001)
612 anim_speed = 255; 453 anim_speed = 255;
613 else if (fabs (op->speed) >= 1.0) 454 else if (op->speed >= 1.0)
614 anim_speed = 1; 455 anim_speed = 1;
615 else 456 else
616 anim_speed = (int) (1.0 / fabs (op->speed)); 457 anim_speed = 1. / op->speed;
617 } 458 }
618 459
619 if (anim_speed > 255) 460 if (anim_speed > 255)
620 anim_speed = 255; 461 anim_speed = 255;
621 } 462 }
… …
651 sl << uint32 (op->env ? op->env->count : 0); 492 sl << uint32 (op->env ? op->env->count : 0);
652 493
653 add_object_to_socklist (*pl->contr->ns, sl, op); 494 add_object_to_socklist (*pl->contr->ns, sl, op);
654 495
655 pl->contr->ns->send_packet (sl); 496 pl->contr->ns->send_packet (sl);
656 SET_FLAG (op, FLAG_CLIENT_SENT);
657} 497}
658 498
659/** 499/**
660 * Tells the client to delete an item. 500 * Tells the client to delete an item.
661 */ 501 */
… …
681 521
682/** 522/**
683 * 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
684 * pointer, or null if it can't be found. 524 * pointer, or null if it can't be found.
685 */ 525 */
686object * 526static object *
687esrv_get_ob_from_count (object *pl, tag_t count) 527esrv_get_ob_from_count (object *pl, tag_t count)
688{ 528{
689 if (pl->count == count) 529 if (pl->count == count)
690 return pl; 530 return pl;
691 531
692 for (object *op = pl->inv; op; op = op->below) 532 for (object *op = pl->inv; op; op = op->below)
693 if (op->count == count) 533 if (op->count == count)
694 return op; 534 return op;
695 else if (op->type == CONTAINER && pl->container == op) 535 else if (op->type == CONTAINER && pl->container_ () == op)
696 for (object *tmp = op->inv; tmp; tmp = tmp->below) 536 for (object *tmp = op->inv; tmp; tmp = tmp->below)
697 if (tmp->count == count) 537 if (tmp->count == count)
698 return tmp; 538 return tmp;
699 539
700 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)
701 if (op->head && op->head->count == count) 541 if (op->head && op->head->count == count)
702 return op; 542 return op;
703 else if (op->count == count) 543 else if (op->count == count)
704 return op; 544 return op;
705 else if (op->type == CONTAINER && pl->container == op) 545 else if (op->type == CONTAINER && pl->container_ () == op)
706 for (object *tmp = op->inv; tmp; tmp = tmp->below) 546 for (object *tmp = op->inv; tmp; tmp = tmp->below)
707 if (tmp->count == count) 547 if (tmp->count == count)
708 return tmp; 548 return tmp;
709 549
710#if 0 550#if 0
… …
750 if (object *op = esrv_get_ob_from_count (pl->ob, tag)) 590 if (object *op = esrv_get_ob_from_count (pl->ob, tag))
751 { 591 {
752 std::string s = op->describe (pl->ob); 592 std::string s = op->describe (pl->ob);
753 593
754 packet sl ("ex"); 594 packet sl ("ex");
755 sl << ber32 (tag) << s.c_str (); 595 sl << ber32 (tag)
596 << data (*pl->expand_cfpod (s.c_str ()));
756 597
757 pl->ns->send_packet (sl); 598 pl->ns->send_packet (sl);
758 } 599 }
759} 600}
760 601
… …
778 { 619 {
779 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);
780 return; 621 return;
781 } 622 }
782 623
783 player_apply (pl->ob, op, 0, 0); 624 pl->ob->apply (op);
784} 625}
785 626
786/** Client wants to lock some object. Lets do so. */ 627/** Client wants to lock some object. Lets do so. */
787void 628void
788LockItem (char *data, int len, player *pl) 629LockItem (char *data, int len, player *pl)
… …
829 * Tero.Haatanen@lut.fi ] 670 * Tero.Haatanen@lut.fi ]
830 */ 671 */
831static void 672static void
832look_at (player *pl, int dx, int dy) 673look_at (player *pl, int dx, int dy)
833{ 674{
834 dynbuf_text buf; 675 dynbuf_text &buf = msg_dynbuf; buf.clear ();
835 object *ob = pl->ob; 676 object *ob = pl->ob;
836 677
837 if (!pl->observe->map) 678 if (!pl->observe->map)
838 return; 679 return;
839 680
681 bool wiz = ob->flag [FLAG_WIZ] || ob->flag [FLAG_WIZLOOK];
682
840 mapxy pos (pl->observe); 683 mapxy pos (pl->observe);
841 pos.move (dx, dy); 684 pos.move (dx, dy);
842 685
686 if (wiz)
687 {
843 if (pos.normalise ()) 688 if (pos.normalise ())
689 {
690 mapspace &ms = *pos;
691 ms.update ();
692
693 buf.printf (" map: %s%+d%+d (%+d%+d)\n"
694 " smell %u/%u; flags %x; light %d; block %x; slow %x; on %x; off %x; items %d, volume %lld\n\n",
695 &pos.m->path, pos.x, pos.y, dx, dy,
696 (unsigned int)ms.smell, (unsigned int)mapspace::smellcount, ms.flags (), ms.light,
697 ms.move_block, ms.move_slow, ms.move_on, ms.move_off, (int)ms.items (), (long long)ms.volume ()
698 );
699 }
700 else
701 buf << "off-map\n\n";
702 }
703
704 int darkness = pl->blocked_los (dx, dy);
705
706 if (darkness == LOS_BLOCKED)
707 buf << "You cannot see that place from your position. H<Something is in between or it is too far away.>";
708 else if (darkness == LOS_MAX)
709 buf << "That place is too dark to see anything. H<Move nearer or find better lighting.>";
710 else
711 {
712 if (pos.normalise ())
844 for (object *tmp = pos->top; tmp; tmp = tmp->below) 713 for (object *tmp = pos->top; tmp; tmp = tmp->below)
845 { 714 {
846 if (tmp->invisible && !QUERY_FLAG (ob, FLAG_WIZ)) 715 if (tmp->invisible && !QUERY_FLAG (ob, FLAG_WIZ))
847 continue; 716 continue;
848 717
849 if (QUERY_FLAG (ob, FLAG_WIZ)) 718 if (wiz)
850 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 ());
851 else 720 else
852 buf.printf ("- %s.\n", query_name (tmp)); 721 buf.printf (" - %s.\n", query_name (tmp));
853 722
854 object *head = tmp->head_ (); 723 object *head = tmp->head_ ();
855 724
856 if (head->inv) 725 if (head->inv)
857 if ((head->type != CONTAINER && head->type != FLESH) 726 if ((head->type != CONTAINER && head->type != FLESH)
858 || QUERY_FLAG (ob, FLAG_WIZ)) 727 || QUERY_FLAG (ob, FLAG_WIZ))
859 buf << head->query_inventory (ob, " "); 728 buf << head->query_inventory (ob, " ");
860 729
861 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) && !QUERY_FLAG (ob, FLAG_WIZ)) /* don't continue under the floor */ 730 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) && !wiz) /* don't continue under the floor */
862 break; 731 break;
732 }
863 } 733 }
864 734
865 if (buf.empty ()) 735 if (buf.empty ())
866 pl->failmsg ("You see nothing there."); 736 buf << "You see nothing there.";
867 else 737
868 pl->infobox (MSG_CHANNEL ("lookat"), buf); 738 pl->infobox (MSG_CHANNEL ("lookat"), buf);
869} 739}
870 740
871/** Client wants to look at some object. Lets do so. */ 741/** Client wants to look at some object. Lets do so. */
872void 742void
873LookAt (char *buf, int len, player *pl) 743LookAt (char *buf, int len, player *pl)
… …
877 int dx = atoi (buf); 747 int dx = atoi (buf);
878 if (!(cp = strchr (buf, ' '))) 748 if (!(cp = strchr (buf, ' ')))
879 return; 749 return;
880 750
881 int dy = atoi (cp); 751 int dy = atoi (cp);
882
883 if (player *opl = pl->observe->contr)
884 if (client *ns = opl->ns)
885 {
886 if (fabs (dx) > ns->mapx / 2 || fabs (dy) > ns->mapy / 2)
887 return;
888
889 if (opl->blocked_los[dx + ns->mapx / 2][dy + ns->mapy / 2])
890 return;
891 }
892 752
893 look_at (pl, dx, dy); 753 look_at (pl, dx, dy);
894} 754}
895 755
896/** Move an object to a new location */ 756/** Move an object to a new location */
… …
912 /* 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
913 * in the container and not the container itself. 773 * in the container and not the container itself.
914 */ 774 */
915 if (op->inv && QUERY_FLAG (op, FLAG_APPLIED)) 775 if (op->inv && QUERY_FLAG (op, FLAG_APPLIED))
916 { 776 {
917 int cnt = MAX_ITEM_PER_DROP; 777 int cnt = MAX_ITEM_PER_ACTION;
918 778
919 for (object *current = op->inv; current && cnt--; ) 779 for (object *current = op->inv; current && cnt--; )
920 { 780 {
921 object *next = current->below; 781 object *next = current->below;
922 drop_object (pl, current, 0); 782 drop_object (pl, current, 0);

Diff Legend

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