| 1 |
/* |
| 2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 |
* |
| 4 |
* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 |
* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
| 6 |
* Copyright (©) 1992,2007 Frank Tore Johansen |
| 7 |
* |
| 8 |
* Deliantra is free software: you can redistribute it and/or modify |
| 9 |
* it under the terms of the GNU General Public License as published by |
| 10 |
* the Free Software Foundation, either version 3 of the License, or |
| 11 |
* (at your option) any later version. |
| 12 |
* |
| 13 |
* This program is distributed in the hope that it will be useful, |
| 14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 |
* GNU General Public License for more details. |
| 17 |
* |
| 18 |
* You should have received a copy of the GNU General Public License |
| 19 |
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 20 |
* |
| 21 |
* The authors can be reached via e-mail to <support@deliantra.net> |
| 22 |
*/ |
| 23 |
|
| 24 |
/** |
| 25 |
* \file |
| 26 |
* Client/server logic. |
| 27 |
* |
| 28 |
* \date 2003-12-02 |
| 29 |
* |
| 30 |
* This contains item logic for client/server. It doesn't contain |
| 31 |
* the actual commands that send the data, but does contain |
| 32 |
* the logic for what items should be sent. |
| 33 |
*/ |
| 34 |
|
| 35 |
#include <global.h> |
| 36 |
#include <object.h> |
| 37 |
#include <sproto.h> |
| 38 |
|
| 39 |
/** This is the maximum number of bytes we expect any one item to take up */ |
| 40 |
#define MAXITEMLEN 300 |
| 41 |
|
| 42 |
/******************************************************************************* |
| 43 |
* |
| 44 |
* Functions related to sending object data to the client. |
| 45 |
* |
| 46 |
******************************************************************************/ |
| 47 |
|
| 48 |
/** |
| 49 |
* This is a similar to query_name, but returns flags |
| 50 |
* to be sent to client. |
| 51 |
*/ |
| 52 |
unsigned int |
| 53 |
query_flags (object *op) |
| 54 |
{ |
| 55 |
unsigned int flags = 0; |
| 56 |
|
| 57 |
if (QUERY_FLAG (op, FLAG_APPLIED)) |
| 58 |
switch (op->type) |
| 59 |
{ |
| 60 |
case BOW: |
| 61 |
case WAND: |
| 62 |
case ROD: |
| 63 |
case HORN: |
| 64 |
flags = a_readied; |
| 65 |
break; |
| 66 |
case WEAPON: |
| 67 |
flags = a_wielded; |
| 68 |
break; |
| 69 |
case SKILL: |
| 70 |
case ARMOUR: |
| 71 |
case HELMET: |
| 72 |
case SHIELD: |
| 73 |
case RING: |
| 74 |
case BOOTS: |
| 75 |
case GLOVES: |
| 76 |
case AMULET: |
| 77 |
case GIRDLE: |
| 78 |
case BRACERS: |
| 79 |
case CLOAK: |
| 80 |
flags = a_worn; |
| 81 |
break; |
| 82 |
case CONTAINER: |
| 83 |
flags = a_active; |
| 84 |
break; |
| 85 |
default: |
| 86 |
flags = a_applied; |
| 87 |
break; |
| 88 |
} |
| 89 |
|
| 90 |
if (op->type == CONTAINER && ((op->env && op->env->container == op) || (!op->env && QUERY_FLAG (op, FLAG_APPLIED)))) |
| 91 |
flags |= F_OPEN; |
| 92 |
|
| 93 |
if (QUERY_FLAG (op, FLAG_KNOWN_CURSED)) |
| 94 |
{ |
| 95 |
if (QUERY_FLAG (op, FLAG_DAMNED)) |
| 96 |
flags |= F_DAMNED; |
| 97 |
else if (QUERY_FLAG (op, FLAG_CURSED)) |
| 98 |
flags |= F_CURSED; |
| 99 |
} |
| 100 |
|
| 101 |
if (QUERY_FLAG (op, FLAG_KNOWN_MAGICAL) && !QUERY_FLAG (op, FLAG_IDENTIFIED)) |
| 102 |
flags |= F_MAGIC; |
| 103 |
if (QUERY_FLAG (op, FLAG_UNPAID)) |
| 104 |
flags |= F_UNPAID; |
| 105 |
if (QUERY_FLAG (op, FLAG_INV_LOCKED)) |
| 106 |
flags |= F_LOCKED; |
| 107 |
|
| 108 |
return flags; |
| 109 |
} |
| 110 |
|
| 111 |
/* Used in the send_look to put object head into packet |
| 112 |
* sl for socket ns. Need socket to know if we need to send |
| 113 |
* animation of face to the client. |
| 114 |
*/ |
| 115 |
static void |
| 116 |
add_object_to_socklist (client &ns, packet &sl, object *head) |
| 117 |
{ |
| 118 |
char item_n[MAX_BUF]; |
| 119 |
const char *item_p; |
| 120 |
|
| 121 |
int flags = query_flags (head); |
| 122 |
if (QUERY_FLAG (head, FLAG_NO_PICK)) |
| 123 |
flags |= F_NOPICK; |
| 124 |
|
| 125 |
ns.send_face (head->face, -50); |
| 126 |
ns.flush_fx (); |
| 127 |
|
| 128 |
if (QUERY_FLAG (head, FLAG_ANIMATE) && !ns.anims_sent[head->animation_id]) |
| 129 |
ns.send_animation (head->animation_id); |
| 130 |
|
| 131 |
sl << uint32 (head->count) |
| 132 |
<< uint32 (flags) |
| 133 |
<< uint32 (QUERY_FLAG (head, FLAG_NO_PICK) ? -1 : head->client_weight ()) |
| 134 |
<< uint32 (head->face); |
| 135 |
|
| 136 |
int len; |
| 137 |
|
| 138 |
if (!head->custom_name) |
| 139 |
{ |
| 140 |
strncpy (item_n, query_base_name (head, 0), 127); |
| 141 |
item_n[127] = 0; |
| 142 |
len = strlen (item_n); |
| 143 |
item_p = query_base_name (head, 1); |
| 144 |
} |
| 145 |
else |
| 146 |
{ |
| 147 |
strncpy (item_n, head->custom_name, 127); |
| 148 |
item_n[127] = 0; |
| 149 |
len = strlen (item_n); |
| 150 |
item_p = head->custom_name; |
| 151 |
} |
| 152 |
|
| 153 |
strncpy (item_n + len + 1, item_p, 127); |
| 154 |
item_n[254] = 0; |
| 155 |
len += strlen (item_n + 1 + len) + 1; |
| 156 |
|
| 157 |
sl << data8 (item_n, len) |
| 158 |
<< uint16 (head->animation_id); |
| 159 |
|
| 160 |
int anim_speed = !head->flag [FLAG_ANIMATE] ? 0 |
| 161 |
: head->anim_speed ? clamp (head->anim_speed, 1, 255) |
| 162 |
: 1. / clamp (fabs (head->speed), 1./255., 1./1.); |
| 163 |
|
| 164 |
sl << uint8 (anim_speed) |
| 165 |
<< uint32 (head->nrof); |
| 166 |
|
| 167 |
if (ns.itemcmd == 2) |
| 168 |
sl << uint16 (head->client_type); |
| 169 |
} |
| 170 |
|
| 171 |
static faceidx |
| 172 |
need_face_now (player *pl, const char *name) |
| 173 |
{ |
| 174 |
faceidx face = face_find (name, empty_face); |
| 175 |
|
| 176 |
pl->ns->send_face (face, -50); |
| 177 |
pl->ns->flush_fx (); |
| 178 |
|
| 179 |
return face; |
| 180 |
} |
| 181 |
|
| 182 |
#define FINGER_UP "finger_up.x11" |
| 183 |
#define FINGER_DOWN "finger_down.x11" |
| 184 |
|
| 185 |
/** |
| 186 |
* Send the look window. Don't need to do animations here |
| 187 |
* This sends all the faces to the client, not just updates. This is |
| 188 |
* because object ordering would otherwise be inconsistent. |
| 189 |
*/ |
| 190 |
void |
| 191 |
esrv_draw_look (player *pl) |
| 192 |
{ |
| 193 |
object *ob = pl->ob; |
| 194 |
|
| 195 |
if (!pl->ns->update_look) |
| 196 |
{ |
| 197 |
LOG (llevDebug, "esrv_draw_look called when update_look was not set (player %s)\n", &ob->name); |
| 198 |
return; |
| 199 |
} |
| 200 |
|
| 201 |
pl->ns->update_look = 0; |
| 202 |
|
| 203 |
if (QUERY_FLAG (ob, FLAG_REMOVED) |
| 204 |
|| !ob->map |
| 205 |
|| ob->map->in_memory != MAP_ACTIVE |
| 206 |
|| out_of_map (ob->map, ob->x, ob->y)) |
| 207 |
return; |
| 208 |
|
| 209 |
pl->ns->send_packet ("delinv 0"); |
| 210 |
|
| 211 |
packet sl; |
| 212 |
sl.printf ("item%d ", pl->ns->itemcmd); |
| 213 |
|
| 214 |
sl << uint32 (0); |
| 215 |
|
| 216 |
int start_pos = pl->ns->look_position; |
| 217 |
bool dirty = false; |
| 218 |
|
| 219 |
mapspace &ms = ob->ms (); |
| 220 |
|
| 221 |
// manage a ring buffer of the "last FLOORBOX_PAGESIZE" items and |
| 222 |
// start from the top |
| 223 |
object *items [FLOORBOX_PAGESIZE]; |
| 224 |
int item_idx = 0, item_cnt = 0; |
| 225 |
int pos = 0; |
| 226 |
|
| 227 |
// find our items by walking down |
| 228 |
object *item = ms.top; |
| 229 |
|
| 230 |
for (; item && item_cnt < FLOORBOX_PAGESIZE; item = item->below) |
| 231 |
{ |
| 232 |
if (!item->client_visible ()) |
| 233 |
continue; |
| 234 |
|
| 235 |
if (++pos < start_pos) |
| 236 |
continue; |
| 237 |
|
| 238 |
// record item |
| 239 |
items [item_idx] = item; item_idx = item_idx < FLOORBOX_PAGESIZE ? item_idx + 1 : 0; |
| 240 |
item_cnt++; |
| 241 |
|
| 242 |
// stop at first floor |
| 243 |
if (item->flag [FLAG_IS_FLOOR]) |
| 244 |
{ |
| 245 |
// we are finished, don't append "next group of items" |
| 246 |
// by setting item to ms.bot it becomes zero which is checked after the while loop |
| 247 |
item = ms.bot; |
| 248 |
} |
| 249 |
} |
| 250 |
|
| 251 |
// see if there are more if we cared - we ignore invisible objects |
| 252 |
if (item) |
| 253 |
{ |
| 254 |
/* What we basically do is make a 'fake' object - when the user applies it, |
| 255 |
* we notice the special tag the object has, and act accordingly. |
| 256 |
*/ |
| 257 |
sl << uint32 (0x80000000 | (start_pos + FLOORBOX_PAGESIZE)) |
| 258 |
<< uint32 (0) |
| 259 |
<< uint32 ((uint32) - 1) |
| 260 |
<< uint32 (need_face_now (pl, FINGER_DOWN)) |
| 261 |
<< data8 ("Apply this to see the items below") |
| 262 |
<< uint16 (0) |
| 263 |
<< uint8 (0) |
| 264 |
<< uint32 (0); |
| 265 |
|
| 266 |
if (pl->ns->itemcmd == 2) |
| 267 |
sl << uint16 (0); |
| 268 |
|
| 269 |
dirty = true; |
| 270 |
} |
| 271 |
|
| 272 |
// now send out all items in the ring buffer in reverse order |
| 273 |
while (item_cnt) |
| 274 |
{ |
| 275 |
--item_cnt; |
| 276 |
item_idx = (item_idx ? item_idx : FLOORBOX_PAGESIZE) - 1; |
| 277 |
object *item = items [item_idx]; |
| 278 |
|
| 279 |
add_object_to_socklist (*pl->ns, sl, item->head_ ()); |
| 280 |
|
| 281 |
dirty = true; |
| 282 |
|
| 283 |
// if packet got too large, send it and begin a new one |
| 284 |
if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
| 285 |
{ |
| 286 |
pl->ns->send_packet (sl); |
| 287 |
|
| 288 |
sl.reset (); |
| 289 |
sl.printf ("item%d ", pl->ns->itemcmd); |
| 290 |
sl << uint32 (0); |
| 291 |
|
| 292 |
dirty = false; |
| 293 |
} |
| 294 |
} |
| 295 |
|
| 296 |
if (start_pos) |
| 297 |
{ |
| 298 |
sl << uint32 (0x80000000 | (start_pos - FLOORBOX_PAGESIZE)) |
| 299 |
<< uint32 (0) |
| 300 |
<< sint32 (-1) |
| 301 |
<< uint32 (need_face_now (pl, FINGER_UP)) |
| 302 |
<< data8 ("Apply this to see the items higher up") |
| 303 |
<< uint16 (0) |
| 304 |
<< uint8 (0) |
| 305 |
<< uint32 (0); |
| 306 |
|
| 307 |
if (pl->ns->itemcmd == 2) |
| 308 |
sl << uint16 (0); |
| 309 |
|
| 310 |
dirty = true; |
| 311 |
} |
| 312 |
|
| 313 |
if (dirty) |
| 314 |
pl->ns->send_packet (sl); |
| 315 |
} |
| 316 |
|
| 317 |
/** |
| 318 |
* Sends whole inventory. |
| 319 |
*/ |
| 320 |
void |
| 321 |
esrv_send_inventory (object *pl, object *op) |
| 322 |
{ |
| 323 |
if (!pl->contr->ns)//D |
| 324 |
return; |
| 325 |
|
| 326 |
int got_one = 0; |
| 327 |
|
| 328 |
pl->contr->ns->send_packet_printf ("delinv %d", op->count); |
| 329 |
|
| 330 |
packet sl; |
| 331 |
sl.printf ("item%d ", pl->contr->ns->itemcmd); |
| 332 |
|
| 333 |
sl << uint32 (op->count); |
| 334 |
|
| 335 |
for (object *tmp = op->inv; tmp; tmp = tmp->below) |
| 336 |
{ |
| 337 |
object *head; |
| 338 |
|
| 339 |
if (tmp->head) |
| 340 |
head = tmp->head; |
| 341 |
else |
| 342 |
head = tmp; |
| 343 |
|
| 344 |
if (head->client_visible ()) |
| 345 |
{ |
| 346 |
add_object_to_socklist (*pl->contr->ns, sl, head); |
| 347 |
|
| 348 |
got_one++; |
| 349 |
|
| 350 |
/* IT is possible for players to accumulate a huge amount of |
| 351 |
* items (especially with some of the bags out there) to |
| 352 |
* overflow the buffer. IF so, send multiple item commands. |
| 353 |
*/ |
| 354 |
if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
| 355 |
{ |
| 356 |
pl->contr->ns->send_packet (sl); |
| 357 |
|
| 358 |
sl.reset (); |
| 359 |
sl.printf ("item%d ", pl->contr->ns->itemcmd); |
| 360 |
sl << uint32 (op->count); |
| 361 |
got_one = 0; |
| 362 |
} |
| 363 |
} |
| 364 |
} |
| 365 |
|
| 366 |
if (got_one) |
| 367 |
pl->contr->ns->send_packet (sl); |
| 368 |
} |
| 369 |
|
| 370 |
/** |
| 371 |
* Updates object *op for player *pl. |
| 372 |
* |
| 373 |
* flags is a list of values to update |
| 374 |
* to the client (as defined in newclient.h - might as well use the |
| 375 |
* same value both places. |
| 376 |
*/ |
| 377 |
void |
| 378 |
esrv_update_item (int flags, object *pl, object *op) |
| 379 |
{ |
| 380 |
/* If we have a request to send the player item, skip a few checks. */ |
| 381 |
if (op != pl && !op->client_visible ()) |
| 382 |
return; |
| 383 |
|
| 384 |
client *ns = pl->contr->ns; |
| 385 |
if (!ns) |
| 386 |
return; |
| 387 |
|
| 388 |
packet sl ("upditem"); |
| 389 |
|
| 390 |
sl << uint8 (flags); |
| 391 |
|
| 392 |
op = op->head_ (); |
| 393 |
|
| 394 |
sl << uint32 (op->count); |
| 395 |
|
| 396 |
if (flags & UPD_LOCATION) |
| 397 |
sl << uint32 (op->env ? op->env->count : 0); |
| 398 |
|
| 399 |
if (flags & UPD_FLAGS) |
| 400 |
sl << uint32 (query_flags (op)); |
| 401 |
|
| 402 |
if (flags & UPD_WEIGHT) |
| 403 |
{ |
| 404 |
sint32 weight = op->client_weight (); |
| 405 |
|
| 406 |
if (op == pl) |
| 407 |
ns->last_weight = weight; |
| 408 |
|
| 409 |
sl << uint32 (weight); |
| 410 |
} |
| 411 |
|
| 412 |
if (flags & UPD_FACE) |
| 413 |
{ |
| 414 |
ns->send_face (op->face, -50); |
| 415 |
ns->flush_fx (); |
| 416 |
sl << uint32 (op->face); |
| 417 |
} |
| 418 |
|
| 419 |
if (flags & UPD_NAME) |
| 420 |
{ |
| 421 |
int len; |
| 422 |
const char *item_p; |
| 423 |
char item_n[127 * 2]; |
| 424 |
|
| 425 |
if (!op->custom_name) |
| 426 |
{ |
| 427 |
len = assign (item_n, query_base_name (op, 0), 127); |
| 428 |
item_p = query_base_name (op, 1); |
| 429 |
} |
| 430 |
else |
| 431 |
{ |
| 432 |
len = assign (item_n, &op->custom_name, 127); |
| 433 |
item_p = &op->custom_name; |
| 434 |
} |
| 435 |
|
| 436 |
len += assign (item_n + len, item_p, 127); |
| 437 |
|
| 438 |
sl << data8 (item_n, len); |
| 439 |
} |
| 440 |
|
| 441 |
if (flags & UPD_ANIM) |
| 442 |
sl << uint16 (op->animation_id); |
| 443 |
|
| 444 |
if (flags & UPD_ANIMSPEED) |
| 445 |
{ |
| 446 |
int anim_speed = 0; |
| 447 |
|
| 448 |
if (QUERY_FLAG (op, FLAG_ANIMATE)) |
| 449 |
{ |
| 450 |
if (op->anim_speed) |
| 451 |
anim_speed = op->anim_speed; |
| 452 |
else |
| 453 |
{ |
| 454 |
if (fabs (op->speed) < 0.001) |
| 455 |
anim_speed = 255; |
| 456 |
else if (fabs (op->speed) >= 1.0) |
| 457 |
anim_speed = 1; |
| 458 |
else |
| 459 |
anim_speed = (int) (1.0 / fabs (op->speed)); |
| 460 |
} |
| 461 |
|
| 462 |
if (anim_speed > 255) |
| 463 |
anim_speed = 255; |
| 464 |
} |
| 465 |
|
| 466 |
sl << uint8 (anim_speed); |
| 467 |
} |
| 468 |
|
| 469 |
if (flags & UPD_NROF) |
| 470 |
sl << uint32 (op->nrof); |
| 471 |
|
| 472 |
pl->contr->ns->send_packet (sl); |
| 473 |
} |
| 474 |
|
| 475 |
/** |
| 476 |
* Sends item's info to player. |
| 477 |
*/ |
| 478 |
void |
| 479 |
esrv_send_item (object *pl, object *op) |
| 480 |
{ |
| 481 |
if (!pl->contr->ns) |
| 482 |
return; |
| 483 |
|
| 484 |
/* We only send 'visible' objects to the client, and sometimes the player */ |
| 485 |
if (!op->client_visible () && op->type != PLAYER) |
| 486 |
return; |
| 487 |
|
| 488 |
packet sl; |
| 489 |
|
| 490 |
sl.printf ("item%d ", pl->contr->ns->itemcmd); |
| 491 |
|
| 492 |
op = op->head_ (); |
| 493 |
|
| 494 |
sl << uint32 (op->env ? op->env->count : 0); |
| 495 |
|
| 496 |
add_object_to_socklist (*pl->contr->ns, sl, op); |
| 497 |
|
| 498 |
pl->contr->ns->send_packet (sl); |
| 499 |
} |
| 500 |
|
| 501 |
/** |
| 502 |
* Tells the client to delete an item. |
| 503 |
*/ |
| 504 |
void |
| 505 |
esrv_del_item (player *pl, int tag) |
| 506 |
{ |
| 507 |
if (!pl->ns) |
| 508 |
return; |
| 509 |
|
| 510 |
packet sl ("delitem"); |
| 511 |
|
| 512 |
sl << uint32 (tag); |
| 513 |
|
| 514 |
pl->ns->send_packet (sl); |
| 515 |
} |
| 516 |
|
| 517 |
|
| 518 |
/******************************************************************************* |
| 519 |
* |
| 520 |
* Client has requested us to do something with an object. |
| 521 |
* |
| 522 |
******************************************************************************/ |
| 523 |
|
| 524 |
/** |
| 525 |
* Takes a player and object count (tag) and returns the actual object |
| 526 |
* pointer, or null if it can't be found. |
| 527 |
*/ |
| 528 |
object * |
| 529 |
esrv_get_ob_from_count (object *pl, tag_t count) |
| 530 |
{ |
| 531 |
if (pl->count == count) |
| 532 |
return pl; |
| 533 |
|
| 534 |
for (object *op = pl->inv; op; op = op->below) |
| 535 |
if (op->count == count) |
| 536 |
return op; |
| 537 |
else if (op->type == CONTAINER && pl->container == op) |
| 538 |
for (object *tmp = op->inv; tmp; tmp = tmp->below) |
| 539 |
if (tmp->count == count) |
| 540 |
return tmp; |
| 541 |
|
| 542 |
for (object *op = GET_MAP_OB (pl->map, pl->x, pl->y); op; op = op->above) |
| 543 |
if (op->head && op->head->count == count) |
| 544 |
return op; |
| 545 |
else if (op->count == count) |
| 546 |
return op; |
| 547 |
else if (op->type == CONTAINER && pl->container == op) |
| 548 |
for (object *tmp = op->inv; tmp; tmp = tmp->below) |
| 549 |
if (tmp->count == count) |
| 550 |
return tmp; |
| 551 |
|
| 552 |
#if 0 |
| 553 |
/* If the high bit is set, player examined a pseudo object. */ |
| 554 |
if (count & 0x80000000) |
| 555 |
return 0; |
| 556 |
#endif |
| 557 |
|
| 558 |
return 0; |
| 559 |
} |
| 560 |
|
| 561 |
/** Client wants to examine some object. So lets do so. */ |
| 562 |
void |
| 563 |
ExamineCmd (char *buf, int len, player *pl) |
| 564 |
{ |
| 565 |
tag_t tag = atoi (buf); |
| 566 |
|
| 567 |
/* If the high bit is set, player applied a pseudo object. */ |
| 568 |
if (tag & 0x80000000) |
| 569 |
{ |
| 570 |
pl->ns->look_position = tag & 0x7fffffff; |
| 571 |
pl->ns->floorbox_update (); |
| 572 |
return; |
| 573 |
} |
| 574 |
|
| 575 |
object *op = esrv_get_ob_from_count (pl->ob, tag); |
| 576 |
|
| 577 |
if (!op) |
| 578 |
{ |
| 579 |
LOG (llevDebug, "Player '%s' tried to examine the unknown object (%ld)\n", &pl->ob->name, tag); |
| 580 |
return; |
| 581 |
} |
| 582 |
|
| 583 |
examine (pl->ob, op); |
| 584 |
} |
| 585 |
|
| 586 |
/** Client wants to examine some object. So lets do so. */ |
| 587 |
void |
| 588 |
ExCmd (char *buf, int len, player *pl) |
| 589 |
{ |
| 590 |
tag_t tag = atoi (buf); |
| 591 |
|
| 592 |
if (object *op = esrv_get_ob_from_count (pl->ob, tag)) |
| 593 |
{ |
| 594 |
std::string s = op->describe (pl->ob); |
| 595 |
|
| 596 |
packet sl ("ex"); |
| 597 |
sl << ber32 (tag) |
| 598 |
<< data (*pl->expand_cfpod (s.c_str ())); |
| 599 |
|
| 600 |
pl->ns->send_packet (sl); |
| 601 |
} |
| 602 |
} |
| 603 |
|
| 604 |
/** Client wants to apply some object. Lets do so. */ |
| 605 |
void |
| 606 |
ApplyCmd (char *buf, int len, player *pl) |
| 607 |
{ |
| 608 |
tag_t tag = atoi (buf); |
| 609 |
|
| 610 |
/* If the high bit is set, player applied a pseudo object. */ |
| 611 |
if (tag & 0x80000000) |
| 612 |
{ |
| 613 |
pl->ns->look_position = tag & 0x7fffffff; |
| 614 |
pl->ns->floorbox_update (); |
| 615 |
return; |
| 616 |
} |
| 617 |
|
| 618 |
object *op = esrv_get_ob_from_count (pl->ob, tag); |
| 619 |
|
| 620 |
if (!op) |
| 621 |
{ |
| 622 |
LOG (llevDebug, "Player '%s' tried to apply the unknown object (%d)\n", &pl->ob->name, tag); |
| 623 |
return; |
| 624 |
} |
| 625 |
|
| 626 |
player_apply (pl->ob, op, 0, 0); |
| 627 |
} |
| 628 |
|
| 629 |
/** Client wants to lock some object. Lets do so. */ |
| 630 |
void |
| 631 |
LockItem (char *data, int len, player *pl) |
| 632 |
{ |
| 633 |
int flag = data[0]; |
| 634 |
tag_t tag = net_uint32 ((uint8 *)data + 1); |
| 635 |
object *op = esrv_get_ob_from_count (pl->ob, tag); |
| 636 |
|
| 637 |
if (!op) |
| 638 |
{ |
| 639 |
pl->failmsg ("Could not find object to lock/unlock"); |
| 640 |
return; |
| 641 |
} |
| 642 |
|
| 643 |
if (!flag) |
| 644 |
CLEAR_FLAG (op, FLAG_INV_LOCKED); |
| 645 |
else |
| 646 |
SET_FLAG (op, FLAG_INV_LOCKED); |
| 647 |
|
| 648 |
esrv_update_item (UPD_FLAGS, pl->ob, op); |
| 649 |
} |
| 650 |
|
| 651 |
/** Client wants to mark some object. Lets do so. */ |
| 652 |
void |
| 653 |
MarkItem (char *data, int len, player *pl) |
| 654 |
{ |
| 655 |
tag_t tag = net_uint32 ((uint8 *)data); |
| 656 |
object *op = esrv_get_ob_from_count (pl->ob, tag); |
| 657 |
|
| 658 |
if (!op) |
| 659 |
{ |
| 660 |
pl->failmsg ("Could not find object to mark"); |
| 661 |
return; |
| 662 |
} |
| 663 |
|
| 664 |
pl->mark = op; |
| 665 |
pl->ob->statusmsg (format ("Marked item %s", query_name (op))); |
| 666 |
} |
| 667 |
|
| 668 |
/** |
| 669 |
* look_at prints items on the specified square. |
| 670 |
* |
| 671 |
* [ removed EARTHWALL check and added check for containers inventory. |
| 672 |
* Tero.Haatanen@lut.fi ] |
| 673 |
*/ |
| 674 |
static void |
| 675 |
look_at (player *pl, int dx, int dy) |
| 676 |
{ |
| 677 |
dynbuf_text buf; |
| 678 |
object *ob = pl->ob; |
| 679 |
|
| 680 |
if (!pl->observe->map) |
| 681 |
return; |
| 682 |
|
| 683 |
bool wiz = ob->flag [FLAG_WIZ] || ob->flag [FLAG_WIZLOOK]; |
| 684 |
|
| 685 |
mapxy pos (pl->observe); |
| 686 |
pos.move (dx, dy); |
| 687 |
|
| 688 |
if (wiz) |
| 689 |
{ |
| 690 |
if (pos.normalise ()) |
| 691 |
{ |
| 692 |
mapspace &ms = *pos; |
| 693 |
ms.update (); |
| 694 |
|
| 695 |
buf.printf (" map: %s%+d%+d (%+d%+d)\n" |
| 696 |
" smell %u/%u; flags %x; light %d; block %x; slow %x; on %x; off %x; volume %lld\n\n", |
| 697 |
&pos.m->path, pos.x, pos.y, dx, dy, |
| 698 |
(unsigned int)ms.smell, (unsigned int)mapspace::smellcount, ms.flags (), ms.light, |
| 699 |
ms.move_block, ms.move_slow, ms.move_on, ms.move_off, (long long)ms.volume () |
| 700 |
); |
| 701 |
} |
| 702 |
else |
| 703 |
buf << "off-map\n\n"; |
| 704 |
} |
| 705 |
|
| 706 |
int darkness = pl->blocked_los (dx, dy); |
| 707 |
|
| 708 |
if (darkness == LOS_BLOCKED) |
| 709 |
buf << "You cannot see that place from your position. H<Something is in between or it is too far away.>"; |
| 710 |
else if (darkness == LOS_MAX) |
| 711 |
buf << "That place is too dark to see anything. H<Move nearer or find better lighting.>"; |
| 712 |
else |
| 713 |
{ |
| 714 |
if (pos.normalise ()) |
| 715 |
for (object *tmp = pos->top; tmp; tmp = tmp->below) |
| 716 |
{ |
| 717 |
if (tmp->invisible && !QUERY_FLAG (ob, FLAG_WIZ)) |
| 718 |
continue; |
| 719 |
|
| 720 |
if (wiz) |
| 721 |
buf.printf (" - %s (%d).\n", query_name (tmp), tmp->count); |
| 722 |
else |
| 723 |
buf.printf (" - %s.\n", query_name (tmp)); |
| 724 |
|
| 725 |
object *head = tmp->head_ (); |
| 726 |
|
| 727 |
if (head->inv) |
| 728 |
if ((head->type != CONTAINER && head->type != FLESH) |
| 729 |
|| QUERY_FLAG (ob, FLAG_WIZ)) |
| 730 |
buf << head->query_inventory (ob, " "); |
| 731 |
|
| 732 |
if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) && !wiz) /* don't continue under the floor */ |
| 733 |
break; |
| 734 |
} |
| 735 |
} |
| 736 |
|
| 737 |
if (buf.empty ()) |
| 738 |
buf << "You see nothing there."; |
| 739 |
|
| 740 |
pl->infobox (MSG_CHANNEL ("lookat"), buf); |
| 741 |
} |
| 742 |
|
| 743 |
/** Client wants to look at some object. Lets do so. */ |
| 744 |
void |
| 745 |
LookAt (char *buf, int len, player *pl) |
| 746 |
{ |
| 747 |
char *cp; |
| 748 |
|
| 749 |
int dx = atoi (buf); |
| 750 |
if (!(cp = strchr (buf, ' '))) |
| 751 |
return; |
| 752 |
|
| 753 |
int dy = atoi (cp); |
| 754 |
|
| 755 |
look_at (pl, dx, dy); |
| 756 |
} |
| 757 |
|
| 758 |
/** Move an object to a new location */ |
| 759 |
void |
| 760 |
esrv_move_object (object *pl, tag_t to, tag_t tag, long nrof) |
| 761 |
{ |
| 762 |
object *op = esrv_get_ob_from_count (pl, tag); |
| 763 |
if (!op) |
| 764 |
{ |
| 765 |
LOG (llevDebug, "Player '%s' tried to move an unknown object (%ld)\n", &pl->name, tag); |
| 766 |
return; |
| 767 |
} |
| 768 |
|
| 769 |
if (!to) |
| 770 |
{ /* drop it to the ground */ |
| 771 |
if (op->map && !op->env) |
| 772 |
return; |
| 773 |
|
| 774 |
/* If it is an active container, then we should drop all objects |
| 775 |
* in the container and not the container itself. |
| 776 |
*/ |
| 777 |
if (op->inv && QUERY_FLAG (op, FLAG_APPLIED)) |
| 778 |
{ |
| 779 |
int cnt = MAX_ITEM_PER_DROP; |
| 780 |
|
| 781 |
for (object *current = op->inv; current && cnt--; ) |
| 782 |
{ |
| 783 |
object *next = current->below; |
| 784 |
drop_object (pl, current, 0); |
| 785 |
current = next; |
| 786 |
} |
| 787 |
|
| 788 |
if (cnt <= 0) |
| 789 |
op->failmsg ("Only dropped some items, can't drop that many items at once."); |
| 790 |
} |
| 791 |
else |
| 792 |
drop_object (pl, op, nrof); |
| 793 |
|
| 794 |
return; |
| 795 |
} |
| 796 |
else if (to == pl->count) |
| 797 |
{ /* pick it up to the inventory */ |
| 798 |
/* return if player has already picked it up */ |
| 799 |
if (op->env == pl) |
| 800 |
return; |
| 801 |
|
| 802 |
pl->contr->count = nrof; |
| 803 |
pick_up (pl, op); |
| 804 |
return; |
| 805 |
} |
| 806 |
|
| 807 |
object *env = esrv_get_ob_from_count (pl, to); |
| 808 |
if (!env) |
| 809 |
{ |
| 810 |
LOG (llevDebug, "Player '%s' tried to move object to the unknown location (%d)\n", &pl->name, to); |
| 811 |
return; |
| 812 |
} |
| 813 |
|
| 814 |
/* put_object_in_sack presumes that necessary sanity checking |
| 815 |
* has already been done (eg, it can be picked up and fits in |
| 816 |
* in a sack, so check for those things. We should also check |
| 817 |
* an make sure env is in fact a container for that matter. |
| 818 |
*/ |
| 819 |
if (env->type == CONTAINER |
| 820 |
&& can_pick (pl, op) |
| 821 |
&& sack_can_hold (pl, env, op, nrof)) |
| 822 |
put_object_in_sack (pl, env, op, nrof); |
| 823 |
} |
| 824 |
|