| … | |
… | |
| 29 | #include <stdio.h> |
29 | #include <stdio.h> |
| 30 | #include <sys/types.h> |
30 | #include <sys/types.h> |
| 31 | #include <sys/uio.h> |
31 | #include <sys/uio.h> |
| 32 | #include <object.h> |
32 | #include <object.h> |
| 33 | #include <funcpoint.h> |
33 | #include <funcpoint.h> |
|
|
34 | #include <sproto.h> |
| 34 | #include <loader.h> |
35 | #include <loader.h> |
| 35 | |
36 | |
| 36 | #include <bitset> |
37 | #include <bitset> |
| 37 | |
38 | |
| 38 | int nrofallocobjects = 0; |
39 | int nrofallocobjects = 0; |
| … | |
… | |
| 313 | |
314 | |
| 314 | /* Everything passes, must be OK. */ |
315 | /* Everything passes, must be OK. */ |
| 315 | return 1; |
316 | return 1; |
| 316 | } |
317 | } |
| 317 | |
318 | |
| 318 | void |
|
|
| 319 | player::set_range (rangetype r) |
|
|
| 320 | { |
|
|
| 321 | shoottype = r; |
|
|
| 322 | } |
|
|
| 323 | |
|
|
| 324 | /* |
319 | /* |
| 325 | * sum_weight() is a recursive function which calculates the weight |
320 | * sum_weight() is a recursive function which calculates the weight |
| 326 | * an object is carrying. It goes through in figures out how much |
321 | * an object is carrying. It goes through in figures out how much |
| 327 | * containers are carrying, and sums it up. |
322 | * containers are carrying, and sums it up. |
| 328 | */ |
323 | */ |
| … | |
… | |
| 330 | sum_weight (object *op) |
325 | sum_weight (object *op) |
| 331 | { |
326 | { |
| 332 | long sum; |
327 | long sum; |
| 333 | object *inv; |
328 | object *inv; |
| 334 | |
329 | |
| 335 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
330 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
| 336 | { |
331 | { |
| 337 | if (inv->inv) |
332 | if (inv->inv) |
| 338 | sum_weight (inv); |
333 | sum_weight (inv); |
|
|
334 | |
| 339 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
335 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
| 340 | } |
336 | } |
| 341 | |
337 | |
| 342 | if (op->type == CONTAINER && op->stats.Str) |
338 | if (op->type == CONTAINER && op->stats.Str) |
| 343 | sum = (sum * (100 - op->stats.Str)) / 100; |
339 | sum = (sum * (100 - op->stats.Str)) / 100; |
| … | |
… | |
| 452 | */ |
448 | */ |
| 453 | while (owner->owner) |
449 | while (owner->owner) |
| 454 | owner = owner->owner; |
450 | owner = owner->owner; |
| 455 | |
451 | |
| 456 | this->owner = owner; |
452 | this->owner = owner; |
|
|
453 | } |
|
|
454 | |
|
|
455 | bool |
|
|
456 | object::change_weapon (object *ob) |
|
|
457 | { |
|
|
458 | if (current_weapon == ob) |
|
|
459 | return true; |
|
|
460 | |
|
|
461 | if (chosen_skill) |
|
|
462 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
463 | |
|
|
464 | current_weapon = ob; |
|
|
465 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
466 | |
|
|
467 | if (chosen_skill) |
|
|
468 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
469 | |
|
|
470 | update_stats (); |
|
|
471 | |
|
|
472 | if (ob) |
|
|
473 | { |
|
|
474 | // now check wether any body locations became invalid, in which case |
|
|
475 | // we cannot apply the weapon at the moment. |
|
|
476 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
477 | if (slot[i].used < 0) |
|
|
478 | { |
|
|
479 | current_weapon = chosen_skill = 0; |
|
|
480 | update_stats (); |
|
|
481 | |
|
|
482 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
483 | "You try to balance your applied items all at once, but the %s is too much. " |
|
|
484 | "You need to unapply some items first.", &ob->name); |
|
|
485 | return false; |
|
|
486 | } |
|
|
487 | |
|
|
488 | new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
489 | } |
|
|
490 | else |
|
|
491 | new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
492 | |
|
|
493 | return true; |
| 457 | } |
494 | } |
| 458 | |
495 | |
| 459 | /* Zero the key_values on op, decrementing the shared-string |
496 | /* Zero the key_values on op, decrementing the shared-string |
| 460 | * refcounts and freeing the links. |
497 | * refcounts and freeing the links. |
| 461 | */ |
498 | */ |
| … | |
… | |
| 543 | * need for monsters, but doesn't hurt to do it for everything. |
580 | * need for monsters, but doesn't hurt to do it for everything. |
| 544 | * by doing so, when a monster is created, it has good starting |
581 | * by doing so, when a monster is created, it has good starting |
| 545 | * values for the body_used info, so when items are created |
582 | * values for the body_used info, so when items are created |
| 546 | * for it, they can be properly equipped. |
583 | * for it, they can be properly equipped. |
| 547 | */ |
584 | */ |
| 548 | memcpy (body_used, body_info, sizeof (body_used)); |
585 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
586 | slot[i].used = slot[i].info; |
| 549 | |
587 | |
| 550 | attachable::instantiate (); |
588 | attachable::instantiate (); |
| 551 | } |
589 | } |
| 552 | |
590 | |
| 553 | object * |
591 | object * |
| … | |
… | |
| 2589 | } |
2627 | } |
| 2590 | |
2628 | |
| 2591 | const char * |
2629 | const char * |
| 2592 | object::debug_desc () const |
2630 | object::debug_desc () const |
| 2593 | { |
2631 | { |
| 2594 | static char info[256 * 4]; |
2632 | static char info[3][256 * 4]; |
|
|
2633 | static int info_idx; |
|
|
2634 | |
| 2595 | return debug_desc (info); |
2635 | return debug_desc (info [++info_idx % 3]); |
| 2596 | } |
|
|
| 2597 | |
|
|
| 2598 | const char * |
|
|
| 2599 | object::debug_desc2 () const |
|
|
| 2600 | { |
|
|
| 2601 | static char info[256 * 4]; |
|
|
| 2602 | return debug_desc (info); |
|
|
| 2603 | } |
2636 | } |
| 2604 | |
2637 | |
| 2605 | struct region * |
2638 | struct region * |
| 2606 | object::region () const |
2639 | object::region () const |
| 2607 | { |
2640 | { |
