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 (op->flag [FLAG_APPLIED]) |
58 | switch (op->type) |
59 | switch (op->type) |
59 | { |
60 | { |
60 | case BOW: |
61 | case BOW: |
61 | case WAND: |
62 | case WAND: |
62 | case ROD: |
63 | case ROD: |
… | |
… | |
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 (op->flag [FLAG_KNOWN_CURSED]) |
94 | { |
95 | { |
95 | if (QUERY_FLAG (op, FLAG_DAMNED)) |
96 | if (op->flag [FLAG_DAMNED]) |
96 | flags |= F_DAMNED; |
97 | flags |= F_DAMNED; |
97 | else if (QUERY_FLAG (op, FLAG_CURSED)) |
98 | else if (op->flag [FLAG_CURSED]) |
98 | flags |= F_CURSED; |
99 | flags |= F_CURSED; |
99 | } |
100 | } |
100 | |
101 | |
101 | if (QUERY_FLAG (op, FLAG_KNOWN_MAGICAL) && !QUERY_FLAG (op, FLAG_IDENTIFIED)) |
102 | if (op->flag [FLAG_KNOWN_MAGICAL] && !op->flag [FLAG_IDENTIFIED]) |
102 | flags |= F_MAGIC; |
103 | flags |= F_MAGIC; |
103 | if (QUERY_FLAG (op, FLAG_UNPAID)) |
104 | if (op->flag [FLAG_UNPAID]) |
104 | flags |= F_UNPAID; |
105 | flags |= F_UNPAID; |
105 | if (QUERY_FLAG (op, FLAG_INV_LOCKED)) |
106 | if (op->flag [FLAG_INV_LOCKED]) |
106 | flags |= F_LOCKED; |
107 | flags |= F_LOCKED; |
107 | |
108 | |
108 | return flags; |
109 | return flags; |
109 | } |
110 | } |
110 | |
111 | |
… | |
… | |
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); |
122 | if (QUERY_FLAG (head, FLAG_NO_PICK)) |
120 | |
|
|
121 | if (head->flag [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 (); |
|
|
127 | |
125 | |
128 | if (QUERY_FLAG (head, FLAG_ANIMATE) && !ns.anims_sent[head->animation_id]) |
126 | if (head->flag [FLAG_ANIMATE] && !ns.anims_sent[head->animation_id]) |
129 | ns.send_animation (head->animation_id); |
127 | ns.send_animation (head->animation_id); |
130 | |
128 | |
131 | sl << uint32 (head->count) |
129 | sl << uint32 (head->count) |
132 | << uint32 (flags) |
130 | << uint32 (flags) |
133 | << uint32 (QUERY_FLAG (head, FLAG_NO_PICK) ? -1 : head->client_weight ()) |
131 | << uint32 (head->flag [FLAG_NO_PICK] ? -1 : head->client_weight ()) |
134 | << uint32 (head->face); |
132 | << uint32 (head->face); |
135 | |
133 | |
136 | int len; |
|
|
137 | |
|
|
138 | if (!head->custom_name) |
134 | if (!head->custom_name) |
139 | { |
135 | { |
140 | strncpy (item_n, query_base_name (head, 0), 127); |
136 | const char *name; |
141 | item_n[127] = 0; |
137 | uint8 *len = sl.cur++; // patch up length later |
142 | len = strlen (item_n); |
138 | |
143 | item_p = query_base_name (head, 1); |
139 | name = query_base_name (head, 0); sl << data (name, min (127, strlen (name))); |
|
|
140 | sl << uint8 (0); |
|
|
141 | name = query_base_name (head, 1); sl << data (name, min (127, strlen (name))); |
|
|
142 | |
|
|
143 | *len = sl.cur - len - 1; |
144 | } |
144 | } |
145 | else |
145 | else |
146 | { |
146 | { |
147 | strncpy (item_n, head->custom_name, 127); |
147 | 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 | |
148 | |
153 | strncpy (item_n + len + 1, item_p, 127); |
149 | sl << uint8 (len * 2 + 1) |
154 | item_n[254] = 0; |
150 | << data (head->custom_name, len) |
155 | len += strlen (item_n + 1 + len) + 1; |
151 | << uint8 (0) |
|
|
152 | << data (head->custom_name, len); |
|
|
153 | } |
156 | |
154 | |
157 | sl << data8 (item_n, len) |
|
|
158 | << uint16 (head->animation_id); |
155 | sl << uint16 (head->animation_id); |
159 | |
156 | |
160 | int anim_speed = !head->flag [FLAG_ANIMATE] ? 0 |
157 | int anim_speed = !head->flag [FLAG_ANIMATE] ? 0 |
161 | : head->anim_speed ? clamp (head->anim_speed, 1, 255) |
158 | : head->anim_speed ? clamp (head->anim_speed, 1, 255) |
162 | : 1. / clamp (fabs (head->speed), 1./255., 1./1.); |
159 | : 1. / clamp (head->speed, 1./255., 1./1.); |
163 | |
160 | |
164 | sl << uint8 (anim_speed) |
161 | sl << uint8 (anim_speed) |
165 | << uint32 (head->nrof); |
162 | << uint32 (head->nrof); |
166 | |
163 | |
167 | if (ns.itemcmd == 2) |
164 | if (ns.itemcmd == 2) |
… | |
… | |
198 | return; |
195 | return; |
199 | } |
196 | } |
200 | |
197 | |
201 | pl->ns->update_look = 0; |
198 | pl->ns->update_look = 0; |
202 | |
199 | |
203 | if (QUERY_FLAG (ob, FLAG_REMOVED) |
200 | if (ob->flag [FLAG_REMOVED] |
204 | || !ob->map |
201 | || !ob->map |
205 | || ob->map->in_memory != MAP_ACTIVE |
202 | || ob->map->in_memory != MAP_ACTIVE |
206 | || out_of_map (ob->map, ob->x, ob->y)) |
203 | || out_of_map (ob->map, ob->x, ob->y)) |
207 | return; |
204 | return; |
208 | |
205 | |
… | |
… | |
281 | dirty = true; |
278 | dirty = true; |
282 | |
279 | |
283 | // if packet got too large, send it and begin a new one |
280 | // if packet got too large, send it and begin a new one |
284 | if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
281 | if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
285 | { |
282 | { |
|
|
283 | pl->ns->flush_fx (); |
286 | pl->ns->send_packet (sl); |
284 | pl->ns->send_packet (sl); |
287 | |
285 | |
288 | sl.reset (); |
286 | sl.reset (); |
289 | sl.printf ("item%d ", pl->ns->itemcmd); |
287 | sl.printf ("item%d ", pl->ns->itemcmd); |
290 | sl << uint32 (0); |
288 | sl << uint32 (0); |
… | |
… | |
309 | |
307 | |
310 | dirty = true; |
308 | dirty = true; |
311 | } |
309 | } |
312 | |
310 | |
313 | if (dirty) |
311 | if (dirty) |
|
|
312 | { |
|
|
313 | pl->ns->flush_fx (); |
314 | pl->ns->send_packet (sl); |
314 | pl->ns->send_packet (sl); |
|
|
315 | } |
315 | } |
316 | } |
316 | |
317 | |
317 | /** |
318 | /** |
318 | * Sends whole inventory. |
319 | * Sends whole inventory. |
319 | */ |
320 | */ |
… | |
… | |
351 | * items (especially with some of the bags out there) to |
352 | * items (especially with some of the bags out there) to |
352 | * overflow the buffer. IF so, send multiple item commands. |
353 | * overflow the buffer. IF so, send multiple item commands. |
353 | */ |
354 | */ |
354 | if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
355 | if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
355 | { |
356 | { |
|
|
357 | pl->contr->ns->flush_fx (); |
356 | pl->contr->ns->send_packet (sl); |
358 | pl->contr->ns->send_packet (sl); |
357 | |
359 | |
358 | sl.reset (); |
360 | sl.reset (); |
359 | sl.printf ("item%d ", pl->contr->ns->itemcmd); |
361 | sl.printf ("item%d ", pl->contr->ns->itemcmd); |
360 | sl << uint32 (op->count); |
362 | sl << uint32 (op->count); |
… | |
… | |
362 | } |
364 | } |
363 | } |
365 | } |
364 | } |
366 | } |
365 | |
367 | |
366 | if (got_one) |
368 | if (got_one) |
|
|
369 | { |
|
|
370 | pl->contr->ns->flush_fx (); |
367 | pl->contr->ns->send_packet (sl); |
371 | pl->contr->ns->send_packet (sl); |
|
|
372 | } |
368 | } |
373 | } |
369 | |
374 | |
370 | /** |
375 | /** |
371 | * Updates object *op for player *pl. |
376 | * Updates object *op for player *pl. |
372 | * |
377 | * |
… | |
… | |
399 | if (flags & UPD_FLAGS) |
404 | if (flags & UPD_FLAGS) |
400 | sl << uint32 (query_flags (op)); |
405 | sl << uint32 (query_flags (op)); |
401 | |
406 | |
402 | if (flags & UPD_WEIGHT) |
407 | if (flags & UPD_WEIGHT) |
403 | { |
408 | { |
404 | sint32 weight = op->flag [FLAG_NO_PICK] ? -1 : op->client_weight (); |
409 | sint32 weight = op->client_weight (); |
405 | |
410 | |
406 | if (op) |
411 | if (op == pl) |
407 | ns->last_weight = weight; |
412 | ns->last_weight = weight; |
408 | |
413 | |
409 | sl << uint32 (weight); |
414 | sl << uint32 (weight); |
410 | } |
415 | } |
411 | |
416 | |
… | |
… | |
418 | |
423 | |
419 | if (flags & UPD_NAME) |
424 | if (flags & UPD_NAME) |
420 | { |
425 | { |
421 | int len; |
426 | int len; |
422 | const char *item_p; |
427 | const char *item_p; |
423 | char item_n[MAX_BUF]; |
428 | char item_n[127 * 2]; |
424 | |
429 | |
425 | if (!op->custom_name) |
430 | if (!op->custom_name) |
426 | { |
431 | { |
427 | strncpy (item_n, query_base_name (op, 0), 127); |
432 | 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); |
433 | item_p = query_base_name (op, 1); |
431 | } |
434 | } |
432 | else |
435 | else |
433 | { |
436 | { |
434 | strncpy (item_n, op->custom_name, 127); |
437 | len = assign (item_n, &op->custom_name, 127); |
435 | item_n[127] = 0; |
|
|
436 | len = strlen (item_n); |
|
|
437 | item_p = op->custom_name; |
438 | item_p = &op->custom_name; |
438 | } |
439 | } |
439 | |
440 | |
440 | strncpy (item_n + len + 1, item_p, 127); |
441 | len += assign (item_n + len, item_p, 127); |
441 | item_n[254] = 0; |
|
|
442 | len += strlen (item_n + 1 + len) + 1; |
|
|
443 | |
442 | |
444 | sl << data8 (item_n, len); |
443 | sl << data8 (item_n, len); |
445 | } |
444 | } |
446 | |
445 | |
447 | if (flags & UPD_ANIM) |
446 | if (flags & UPD_ANIM) |
… | |
… | |
449 | |
448 | |
450 | if (flags & UPD_ANIMSPEED) |
449 | if (flags & UPD_ANIMSPEED) |
451 | { |
450 | { |
452 | int anim_speed = 0; |
451 | int anim_speed = 0; |
453 | |
452 | |
454 | if (QUERY_FLAG (op, FLAG_ANIMATE)) |
453 | if (op->flag [FLAG_ANIMATE]) |
455 | { |
454 | { |
456 | if (op->anim_speed) |
455 | if (op->anim_speed) |
457 | anim_speed = op->anim_speed; |
456 | anim_speed = op->anim_speed; |
458 | else |
457 | else |
459 | { |
458 | { |
460 | if (fabs (op->speed) < 0.001) |
459 | if (op->speed < 0.001) |
461 | anim_speed = 255; |
460 | anim_speed = 255; |
462 | else if (fabs (op->speed) >= 1.0) |
461 | else if (op->speed >= 1.0) |
463 | anim_speed = 1; |
462 | anim_speed = 1; |
464 | else |
463 | else |
465 | anim_speed = (int) (1.0 / fabs (op->speed)); |
464 | anim_speed = 1. / op->speed; |
466 | } |
465 | } |
467 | |
466 | |
468 | if (anim_speed > 255) |
467 | if (anim_speed > 255) |
469 | anim_speed = 255; |
468 | anim_speed = 255; |
470 | } |
469 | } |
… | |
… | |
499 | |
498 | |
500 | sl << uint32 (op->env ? op->env->count : 0); |
499 | sl << uint32 (op->env ? op->env->count : 0); |
501 | |
500 | |
502 | add_object_to_socklist (*pl->contr->ns, sl, op); |
501 | add_object_to_socklist (*pl->contr->ns, sl, op); |
503 | |
502 | |
|
|
503 | pl->contr->ns->flush_fx (); |
504 | pl->contr->ns->send_packet (sl); |
504 | pl->contr->ns->send_packet (sl); |
505 | } |
505 | } |
506 | |
506 | |
507 | /** |
507 | /** |
508 | * Tells the client to delete an item. |
508 | * Tells the client to delete an item. |
… | |
… | |
529 | |
529 | |
530 | /** |
530 | /** |
531 | * Takes a player and object count (tag) and returns the actual object |
531 | * Takes a player and object count (tag) and returns the actual object |
532 | * pointer, or null if it can't be found. |
532 | * pointer, or null if it can't be found. |
533 | */ |
533 | */ |
534 | object * |
534 | static object * |
535 | esrv_get_ob_from_count (object *pl, tag_t count) |
535 | esrv_get_ob_from_count (object *pl, tag_t count) |
536 | { |
536 | { |
537 | if (pl->count == count) |
537 | if (pl->count == count) |
538 | return pl; |
538 | return pl; |
539 | |
539 | |
540 | for (object *op = pl->inv; op; op = op->below) |
540 | for (object *op = pl->inv; op; op = op->below) |
541 | if (op->count == count) |
541 | if (op->count == count) |
542 | return op; |
542 | return op; |
543 | else if (op->type == CONTAINER && pl->container == op) |
543 | else if (op->type == CONTAINER && pl->container_ () == op) |
544 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
544 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
545 | if (tmp->count == count) |
545 | if (tmp->count == count) |
546 | return tmp; |
546 | return tmp; |
547 | |
547 | |
548 | for (object *op = GET_MAP_OB (pl->map, pl->x, pl->y); op; op = op->above) |
548 | for (object *op = GET_MAP_OB (pl->map, pl->x, pl->y); op; op = op->above) |
549 | if (op->head && op->head->count == count) |
549 | if (op->head && op->head->count == count) |
550 | return op; |
550 | return op; |
551 | else if (op->count == count) |
551 | else if (op->count == count) |
552 | return op; |
552 | return op; |
553 | else if (op->type == CONTAINER && pl->container == op) |
553 | else if (op->type == CONTAINER && pl->container_ () == op) |
554 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
554 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
555 | if (tmp->count == count) |
555 | if (tmp->count == count) |
556 | return tmp; |
556 | return tmp; |
557 | |
557 | |
558 | #if 0 |
558 | #if 0 |
… | |
… | |
627 | { |
627 | { |
628 | LOG (llevDebug, "Player '%s' tried to apply the unknown object (%d)\n", &pl->ob->name, tag); |
628 | LOG (llevDebug, "Player '%s' tried to apply the unknown object (%d)\n", &pl->ob->name, tag); |
629 | return; |
629 | return; |
630 | } |
630 | } |
631 | |
631 | |
632 | player_apply (pl->ob, op, 0, 0); |
632 | pl->ob->apply (op, AP_TOGGLE); |
633 | } |
633 | } |
634 | |
634 | |
635 | /** Client wants to lock some object. Lets do so. */ |
635 | /** Client wants to lock some object. Lets do so. */ |
636 | void |
636 | void |
637 | LockItem (char *data, int len, player *pl) |
637 | LockItem (char *data, int len, player *pl) |
… | |
… | |
645 | pl->failmsg ("Could not find object to lock/unlock"); |
645 | pl->failmsg ("Could not find object to lock/unlock"); |
646 | return; |
646 | return; |
647 | } |
647 | } |
648 | |
648 | |
649 | if (!flag) |
649 | if (!flag) |
650 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
650 | op->clr_flag (FLAG_INV_LOCKED); |
651 | else |
651 | else |
652 | SET_FLAG (op, FLAG_INV_LOCKED); |
652 | op->set_flag (FLAG_INV_LOCKED); |
653 | |
653 | |
654 | esrv_update_item (UPD_FLAGS, pl->ob, op); |
654 | esrv_update_item (UPD_FLAGS, pl->ob, op); |
655 | } |
655 | } |
656 | |
656 | |
657 | /** Client wants to mark some object. Lets do so. */ |
657 | /** Client wants to mark some object. Lets do so. */ |
… | |
… | |
678 | * Tero.Haatanen@lut.fi ] |
678 | * Tero.Haatanen@lut.fi ] |
679 | */ |
679 | */ |
680 | static void |
680 | static void |
681 | look_at (player *pl, int dx, int dy) |
681 | look_at (player *pl, int dx, int dy) |
682 | { |
682 | { |
683 | dynbuf_text buf; |
683 | dynbuf_text &buf = msg_dynbuf; buf.clear (); |
684 | object *ob = pl->ob; |
684 | object *ob = pl->ob; |
685 | |
685 | |
686 | if (!pl->observe->map) |
686 | if (!pl->observe->map) |
687 | return; |
687 | return; |
688 | |
688 | |
|
|
689 | bool wiz = ob->flag [FLAG_WIZ] || ob->flag [FLAG_WIZLOOK]; |
|
|
690 | |
689 | mapxy pos (pl->observe); |
691 | mapxy pos (pl->observe); |
690 | pos.move (dx, dy); |
692 | pos.move (dx, dy); |
691 | |
693 | |
|
|
694 | if (wiz) |
|
|
695 | { |
692 | if (pos.normalise ()) |
696 | if (pos.normalise ()) |
|
|
697 | { |
|
|
698 | mapspace &ms = *pos; |
|
|
699 | ms.update (); |
|
|
700 | |
|
|
701 | 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; items %d, volume %lld\n\n", |
|
|
703 | &pos.m->path, pos.x, pos.y, dx, dy, |
|
|
704 | (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, (int)ms.items (), (long long)ms.volume () |
|
|
706 | ); |
|
|
707 | } |
|
|
708 | else |
|
|
709 | buf << "off-map\n\n"; |
|
|
710 | } |
|
|
711 | |
|
|
712 | int darkness = pl->blocked_los (dx, dy); |
|
|
713 | |
|
|
714 | if (darkness == LOS_BLOCKED) |
|
|
715 | buf << "You cannot see that place from your position. H<Something is in between or it is too far away.>"; |
|
|
716 | else if (darkness == LOS_MAX) |
|
|
717 | buf << "That place is too dark to see anything. H<Move nearer or find better lighting.>"; |
|
|
718 | else |
|
|
719 | { |
|
|
720 | if (pos.normalise ()) |
693 | for (object *tmp = pos->top; tmp; tmp = tmp->below) |
721 | for (object *tmp = pos->top; tmp; tmp = tmp->below) |
694 | { |
722 | { |
695 | if (tmp->invisible && !QUERY_FLAG (ob, FLAG_WIZ)) |
723 | if (tmp->invisible && !ob->flag [FLAG_WIZ]) |
696 | continue; |
724 | continue; |
697 | |
725 | |
698 | if (QUERY_FLAG (ob, FLAG_WIZ)) |
726 | if (wiz) |
699 | buf.printf (" - %s (%d).\n", query_name (tmp), tmp->count); |
727 | buf.printf (" - %s (%d) %s\n", query_name (tmp), tmp->count, tmp->uuid.c_str ()); |
700 | else |
728 | else |
701 | buf.printf (" - %s.\n", query_name (tmp)); |
729 | buf.printf (" - %s.\n", query_name (tmp)); |
702 | |
730 | |
703 | object *head = tmp->head_ (); |
731 | object *head = tmp->head_ (); |
704 | |
732 | |
705 | if (head->inv) |
733 | if (head->inv) |
706 | if ((head->type != CONTAINER && head->type != FLESH) |
734 | if ((head->type != CONTAINER && head->type != FLESH) |
707 | || QUERY_FLAG (ob, FLAG_WIZ)) |
735 | || ob->flag [FLAG_WIZ]) |
708 | buf << head->query_inventory (ob, " "); |
736 | buf << head->query_inventory (ob, " "); |
709 | |
737 | |
710 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) && !QUERY_FLAG (ob, FLAG_WIZ)) /* don't continue under the floor */ |
738 | if (tmp->flag [FLAG_IS_FLOOR] && !wiz) /* don't continue under the floor */ |
711 | break; |
739 | break; |
|
|
740 | } |
712 | } |
741 | } |
713 | |
742 | |
714 | if (buf.empty ()) |
743 | if (buf.empty ()) |
715 | pl->failmsg ("You see nothing there."); |
744 | buf << "You see nothing there."; |
716 | else |
745 | |
717 | pl->infobox (MSG_CHANNEL ("lookat"), buf); |
746 | pl->infobox (MSG_CHANNEL ("lookat"), buf); |
718 | } |
747 | } |
719 | |
748 | |
720 | /** Client wants to look at some object. Lets do so. */ |
749 | /** Client wants to look at some object. Lets do so. */ |
721 | void |
750 | void |
722 | LookAt (char *buf, int len, player *pl) |
751 | LookAt (char *buf, int len, player *pl) |
… | |
… | |
726 | int dx = atoi (buf); |
755 | int dx = atoi (buf); |
727 | if (!(cp = strchr (buf, ' '))) |
756 | if (!(cp = strchr (buf, ' '))) |
728 | return; |
757 | return; |
729 | |
758 | |
730 | int dy = atoi (cp); |
759 | int dy = atoi (cp); |
731 | |
|
|
732 | if (player *opl = pl->observe->contr) |
|
|
733 | if (client *ns = opl->ns) |
|
|
734 | { |
|
|
735 | if (fabs (dx) > ns->mapx / 2 || fabs (dy) > ns->mapy / 2) |
|
|
736 | return; |
|
|
737 | |
|
|
738 | if (opl->blocked_los[dx + ns->mapx / 2][dy + ns->mapy / 2]) |
|
|
739 | return; |
|
|
740 | } |
|
|
741 | |
760 | |
742 | look_at (pl, dx, dy); |
761 | look_at (pl, dx, dy); |
743 | } |
762 | } |
744 | |
763 | |
745 | /** Move an object to a new location */ |
764 | /** Move an object to a new location */ |
… | |
… | |
759 | return; |
778 | return; |
760 | |
779 | |
761 | /* If it is an active container, then we should drop all objects |
780 | /* If it is an active container, then we should drop all objects |
762 | * in the container and not the container itself. |
781 | * in the container and not the container itself. |
763 | */ |
782 | */ |
764 | if (op->inv && QUERY_FLAG (op, FLAG_APPLIED)) |
783 | if (op->inv && op->flag [FLAG_APPLIED]) |
765 | { |
784 | { |
766 | int cnt = MAX_ITEM_PER_DROP; |
785 | int cnt = MAX_ITEM_PER_ACTION; |
767 | |
786 | |
768 | for (object *current = op->inv; current && cnt--; ) |
787 | for (object *current = op->inv; current && cnt--; ) |
769 | { |
788 | { |
770 | object *next = current->below; |
789 | object *next = current->below; |
771 | drop_object (pl, current, 0); |
790 | drop_object (pl, current, 0); |