1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | sub/add_weight will transcend the environment updating the carrying |
26 | sub/add_weight will transcend the environment updating the carrying |
26 | variable. */ |
27 | variable. */ |
27 | #include <global.h> |
28 | #include <global.h> |
28 | #include <stdio.h> |
29 | #include <stdio.h> |
29 | #include <sys/types.h> |
30 | #include <sys/types.h> |
30 | #include <sys/uio.h> |
31 | #include <sys/uio.h> |
31 | #include <object.h> |
32 | #include <object.h> |
32 | #include <funcpoint.h> |
33 | #include <funcpoint.h> |
|
|
34 | #include <sproto.h> |
33 | #include <loader.h> |
35 | #include <loader.h> |
34 | |
36 | |
35 | #include <bitset> |
37 | #include <bitset> |
36 | |
38 | |
37 | int nrofallocobjects = 0; |
39 | int nrofallocobjects = 0; |
38 | static UUID uuid; |
40 | static UUID uuid; |
39 | const uint64 UUID_SKIP = 1<<19; |
41 | const uint64 UUID_SKIP = 1<<19; |
40 | |
42 | |
41 | object *active_objects; /* List of active objects that need to be processed */ |
43 | objectvec objects; |
|
|
44 | activevec actives; |
42 | |
45 | |
43 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
46 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
44 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
47 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
45 | }; |
48 | }; |
46 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
49 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
… | |
… | |
190 | * Check nrof variable *before* calling can_merge() |
193 | * Check nrof variable *before* calling can_merge() |
191 | * |
194 | * |
192 | * Improvements made with merge: Better checking on potion, and also |
195 | * Improvements made with merge: Better checking on potion, and also |
193 | * check weight |
196 | * check weight |
194 | */ |
197 | */ |
195 | |
|
|
196 | bool object::can_merge_slow (object *ob1, object *ob2) |
198 | bool object::can_merge_slow (object *ob1, object *ob2) |
197 | { |
199 | { |
198 | /* A couple quicksanity checks */ |
200 | /* A couple quicksanity checks */ |
199 | if (ob1 == ob2 |
201 | if (ob1 == ob2 |
200 | || ob1->type != ob2->type |
202 | || ob1->type != ob2->type |
… | |
… | |
277 | |
279 | |
278 | /* Note sure why the following is the case - either the object has to |
280 | /* Note sure why the following is the case - either the object has to |
279 | * be animated or have a very low speed. Is this an attempted monster |
281 | * be animated or have a very low speed. Is this an attempted monster |
280 | * check? |
282 | * check? |
281 | */ |
283 | */ |
282 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) |
284 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
283 | return 0; |
285 | return 0; |
284 | |
286 | |
285 | switch (ob1->type) |
287 | switch (ob1->type) |
286 | { |
288 | { |
287 | case SCROLL: |
289 | case SCROLL: |
… | |
… | |
323 | sum_weight (object *op) |
325 | sum_weight (object *op) |
324 | { |
326 | { |
325 | long sum; |
327 | long sum; |
326 | object *inv; |
328 | object *inv; |
327 | |
329 | |
328 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
330 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
329 | { |
331 | { |
330 | if (inv->inv) |
332 | if (inv->inv) |
331 | sum_weight (inv); |
333 | sum_weight (inv); |
|
|
334 | |
332 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
335 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
333 | } |
336 | } |
334 | |
337 | |
335 | if (op->type == CONTAINER && op->stats.Str) |
338 | if (op->type == CONTAINER && op->stats.Str) |
336 | sum = (sum * (100 - op->stats.Str)) / 100; |
339 | sum = (sum * (100 - op->stats.Str)) / 100; |
… | |
… | |
356 | /* |
359 | /* |
357 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
360 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
358 | * Some error messages. |
361 | * Some error messages. |
359 | * The result of the dump is stored in the static global errmsg array. |
362 | * The result of the dump is stored in the static global errmsg array. |
360 | */ |
363 | */ |
361 | |
|
|
362 | char * |
364 | char * |
363 | dump_object (object *op) |
365 | dump_object (object *op) |
364 | { |
366 | { |
365 | if (!op) |
367 | if (!op) |
366 | return strdup ("[NULLOBJ]"); |
368 | return strdup ("[NULLOBJ]"); |
367 | |
369 | |
368 | object_freezer freezer; |
370 | object_freezer freezer; |
369 | save_object (freezer, op, 1); |
371 | op->write (freezer); |
370 | return freezer.as_string (); |
372 | return freezer.as_string (); |
371 | } |
373 | } |
372 | |
374 | |
373 | /* |
375 | /* |
374 | * get_nearest_part(multi-object, object 2) returns the part of the |
376 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
391 | } |
393 | } |
392 | |
394 | |
393 | /* |
395 | /* |
394 | * Returns the object which has the count-variable equal to the argument. |
396 | * Returns the object which has the count-variable equal to the argument. |
395 | */ |
397 | */ |
396 | |
|
|
397 | object * |
398 | object * |
398 | find_object (tag_t i) |
399 | find_object (tag_t i) |
399 | { |
400 | { |
400 | for (object *op = object::first; op; op = op->next) |
401 | for_all_objects (op) |
401 | if (op->count == i) |
402 | if (op->count == i) |
402 | return op; |
403 | return op; |
403 | |
404 | |
404 | return 0; |
405 | return 0; |
405 | } |
406 | } |
406 | |
407 | |
407 | /* |
408 | /* |
408 | * Returns the first object which has a name equal to the argument. |
409 | * Returns the first object which has a name equal to the argument. |
409 | * Used only by the patch command, but not all that useful. |
410 | * Used only by the patch command, but not all that useful. |
410 | * Enables features like "patch <name-of-other-player> food 999" |
411 | * Enables features like "patch <name-of-other-player> food 999" |
411 | */ |
412 | */ |
412 | |
|
|
413 | object * |
413 | object * |
414 | find_object_name (const char *str) |
414 | find_object_name (const char *str) |
415 | { |
415 | { |
416 | shstr_cmp str_ (str); |
416 | shstr_cmp str_ (str); |
417 | object *op; |
417 | object *op; |
418 | |
418 | |
419 | for (op = object::first; op != NULL; op = op->next) |
419 | for_all_objects (op) |
420 | if (op->name == str_) |
420 | if (op->name == str_) |
421 | break; |
421 | break; |
422 | |
422 | |
423 | return op; |
423 | return op; |
424 | } |
424 | } |
… | |
… | |
450 | owner = owner->owner; |
450 | owner = owner->owner; |
451 | |
451 | |
452 | this->owner = owner; |
452 | this->owner = owner; |
453 | } |
453 | } |
454 | |
454 | |
|
|
455 | int |
|
|
456 | object::slottype () const |
|
|
457 | { |
|
|
458 | if (type == SKILL) |
|
|
459 | { |
|
|
460 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
461 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
462 | } |
|
|
463 | else |
|
|
464 | { |
|
|
465 | if (slot [body_combat].info) return slot_combat; |
|
|
466 | if (slot [body_range ].info) return slot_ranged; |
|
|
467 | } |
|
|
468 | |
|
|
469 | return slot_none; |
|
|
470 | } |
|
|
471 | |
|
|
472 | bool |
|
|
473 | object::change_weapon (object *ob) |
|
|
474 | { |
|
|
475 | if (current_weapon == ob) |
|
|
476 | return true; |
|
|
477 | |
|
|
478 | current_weapon = ob; |
|
|
479 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
480 | |
|
|
481 | update_stats (); |
|
|
482 | |
|
|
483 | if (ob) |
|
|
484 | { |
|
|
485 | // now check wether any body locations became invalid, in which case |
|
|
486 | // we cannot apply the weapon at the moment. |
|
|
487 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
488 | if (slot[i].used < 0) |
|
|
489 | { |
|
|
490 | current_weapon = chosen_skill = 0; |
|
|
491 | update_stats (); |
|
|
492 | |
|
|
493 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
494 | "You try to balance your applied items all at once, but the %s is too much. " |
|
|
495 | "You need to unapply some items first.", &ob->name); |
|
|
496 | return false; |
|
|
497 | } |
|
|
498 | |
|
|
499 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
500 | } |
|
|
501 | else |
|
|
502 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
503 | |
|
|
504 | return true; |
|
|
505 | } |
|
|
506 | |
455 | /* Zero the key_values on op, decrementing the shared-string |
507 | /* Zero the key_values on op, decrementing the shared-string |
456 | * refcounts and freeing the links. |
508 | * refcounts and freeing the links. |
457 | */ |
509 | */ |
458 | static void |
510 | static void |
459 | free_key_values (object *op) |
511 | free_key_values (object *op) |
460 | { |
512 | { |
461 | for (key_value *i = op->key_values; i != 0;) |
513 | for (key_value *i = op->key_values; i; ) |
462 | { |
514 | { |
463 | key_value *next = i->next; |
515 | key_value *next = i->next; |
464 | delete i; |
516 | delete i; |
465 | |
517 | |
466 | i = next; |
518 | i = next; |
467 | } |
519 | } |
468 | |
520 | |
469 | op->key_values = 0; |
521 | op->key_values = 0; |
470 | } |
522 | } |
471 | |
523 | |
472 | /* |
524 | object & |
473 | * copy_to first frees everything allocated by the dst object, |
525 | object::operator =(const object &src) |
474 | * and then copies the contents of itself into the second |
|
|
475 | * object, allocating what needs to be allocated. Basically, any |
|
|
476 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
477 | * if the first object is freed, the pointers in the new object |
|
|
478 | * will point at garbage. |
|
|
479 | */ |
|
|
480 | void |
|
|
481 | object::copy_to (object *dst) |
|
|
482 | { |
526 | { |
483 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
527 | bool is_freed = flag [FLAG_FREED]; |
484 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
528 | bool is_removed = flag [FLAG_REMOVED]; |
485 | |
529 | |
486 | *(object_copy *)dst = *this; |
530 | *(object_copy *)this = src; |
487 | |
531 | |
488 | if (is_freed) |
532 | flag [FLAG_FREED] = is_freed; |
489 | SET_FLAG (dst, FLAG_FREED); |
533 | flag [FLAG_REMOVED] = is_removed; |
490 | |
|
|
491 | if (is_removed) |
|
|
492 | SET_FLAG (dst, FLAG_REMOVED); |
|
|
493 | |
|
|
494 | if (speed < 0) |
|
|
495 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
|
|
496 | |
534 | |
497 | /* Copy over key_values, if any. */ |
535 | /* Copy over key_values, if any. */ |
498 | if (key_values) |
536 | if (src.key_values) |
499 | { |
537 | { |
500 | key_value *tail = 0; |
538 | key_value *tail = 0; |
501 | key_value *i; |
|
|
502 | |
|
|
503 | dst->key_values = 0; |
539 | key_values = 0; |
504 | |
540 | |
505 | for (i = key_values; i; i = i->next) |
541 | for (key_value *i = src.key_values; i; i = i->next) |
506 | { |
542 | { |
507 | key_value *new_link = new key_value; |
543 | key_value *new_link = new key_value; |
508 | |
544 | |
509 | new_link->next = 0; |
545 | new_link->next = 0; |
510 | new_link->key = i->key; |
546 | new_link->key = i->key; |
511 | new_link->value = i->value; |
547 | new_link->value = i->value; |
512 | |
548 | |
513 | /* Try and be clever here, too. */ |
549 | /* Try and be clever here, too. */ |
514 | if (!dst->key_values) |
550 | if (!key_values) |
515 | { |
551 | { |
516 | dst->key_values = new_link; |
552 | key_values = new_link; |
517 | tail = new_link; |
553 | tail = new_link; |
518 | } |
554 | } |
519 | else |
555 | else |
520 | { |
556 | { |
521 | tail->next = new_link; |
557 | tail->next = new_link; |
522 | tail = new_link; |
558 | tail = new_link; |
523 | } |
559 | } |
524 | } |
560 | } |
525 | } |
561 | } |
|
|
562 | } |
|
|
563 | |
|
|
564 | /* |
|
|
565 | * copy_to first frees everything allocated by the dst object, |
|
|
566 | * and then copies the contents of itself into the second |
|
|
567 | * object, allocating what needs to be allocated. Basically, any |
|
|
568 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
569 | * if the first object is freed, the pointers in the new object |
|
|
570 | * will point at garbage. |
|
|
571 | */ |
|
|
572 | void |
|
|
573 | object::copy_to (object *dst) |
|
|
574 | { |
|
|
575 | *dst = *this; |
|
|
576 | |
|
|
577 | if (speed < 0) |
|
|
578 | dst->speed_left = speed_left - rndm (); |
526 | |
579 | |
527 | dst->set_speed (dst->speed); |
580 | dst->set_speed (dst->speed); |
|
|
581 | } |
|
|
582 | |
|
|
583 | void |
|
|
584 | object::instantiate () |
|
|
585 | { |
|
|
586 | if (!uuid.seq) // HACK |
|
|
587 | uuid = gen_uuid (); |
|
|
588 | |
|
|
589 | speed_left = -0.1f; |
|
|
590 | /* copy the body_info to the body_used - this is only really |
|
|
591 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
592 | * by doing so, when a monster is created, it has good starting |
|
|
593 | * values for the body_used info, so when items are created |
|
|
594 | * for it, they can be properly equipped. |
|
|
595 | */ |
|
|
596 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
597 | slot[i].used = slot[i].info; |
|
|
598 | |
|
|
599 | attachable::instantiate (); |
528 | } |
600 | } |
529 | |
601 | |
530 | object * |
602 | object * |
531 | object::clone () |
603 | object::clone () |
532 | { |
604 | { |
… | |
… | |
538 | /* |
610 | /* |
539 | * If an object with the IS_TURNABLE() flag needs to be turned due |
611 | * If an object with the IS_TURNABLE() flag needs to be turned due |
540 | * to the closest player being on the other side, this function can |
612 | * to the closest player being on the other side, this function can |
541 | * be called to update the face variable, _and_ how it looks on the map. |
613 | * be called to update the face variable, _and_ how it looks on the map. |
542 | */ |
614 | */ |
543 | |
|
|
544 | void |
615 | void |
545 | update_turn_face (object *op) |
616 | update_turn_face (object *op) |
546 | { |
617 | { |
547 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL) |
618 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
548 | return; |
619 | return; |
|
|
620 | |
549 | SET_ANIMATION (op, op->direction); |
621 | SET_ANIMATION (op, op->direction); |
550 | update_object (op, UP_OBJ_FACE); |
622 | update_object (op, UP_OBJ_FACE); |
551 | } |
623 | } |
552 | |
624 | |
553 | /* |
625 | /* |
… | |
… | |
556 | * This function needs to be called whenever the speed of an object changes. |
628 | * This function needs to be called whenever the speed of an object changes. |
557 | */ |
629 | */ |
558 | void |
630 | void |
559 | object::set_speed (float speed) |
631 | object::set_speed (float speed) |
560 | { |
632 | { |
561 | extern int arch_init; |
|
|
562 | |
|
|
563 | /* No reason putting the archetypes objects on the speed list, |
|
|
564 | * since they never really need to be updated. |
|
|
565 | */ |
|
|
566 | if (flag [FLAG_FREED] && speed) |
633 | if (flag [FLAG_FREED] && speed) |
567 | { |
634 | { |
568 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
635 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
569 | speed = 0; |
636 | speed = 0; |
570 | } |
637 | } |
571 | |
638 | |
572 | this->speed = speed; |
639 | this->speed = speed; |
573 | |
640 | |
574 | if (arch_init) |
641 | if (has_active_speed ()) |
575 | return; |
642 | activate (); |
576 | |
|
|
577 | if (FABS (speed) > MIN_ACTIVE_SPEED) |
|
|
578 | { |
|
|
579 | /* If already on active list, don't do anything */ |
|
|
580 | if (active_next || active_prev || this == active_objects) |
|
|
581 | return; |
|
|
582 | |
|
|
583 | /* process_events() expects us to insert the object at the beginning |
|
|
584 | * of the list. */ |
|
|
585 | active_next = active_objects; |
|
|
586 | |
|
|
587 | if (active_next) |
|
|
588 | active_next->active_prev = this; |
|
|
589 | |
|
|
590 | active_objects = this; |
|
|
591 | } |
|
|
592 | else |
643 | else |
593 | { |
644 | deactivate (); |
594 | /* If not on the active list, nothing needs to be done */ |
|
|
595 | if (!active_next && !active_prev && this != active_objects) |
|
|
596 | return; |
|
|
597 | |
|
|
598 | if (!active_prev) |
|
|
599 | { |
|
|
600 | active_objects = active_next; |
|
|
601 | |
|
|
602 | if (active_next) |
|
|
603 | active_next->active_prev = 0; |
|
|
604 | } |
|
|
605 | else |
|
|
606 | { |
|
|
607 | active_prev->active_next = active_next; |
|
|
608 | |
|
|
609 | if (active_next) |
|
|
610 | active_next->active_prev = active_prev; |
|
|
611 | } |
|
|
612 | |
|
|
613 | active_next = 0; |
|
|
614 | active_prev = 0; |
|
|
615 | } |
|
|
616 | } |
|
|
617 | |
|
|
618 | /* This function removes object 'op' from the list of active |
|
|
619 | * objects. |
|
|
620 | * This should only be used for style maps or other such |
|
|
621 | * reference maps where you don't want an object that isn't |
|
|
622 | * in play chewing up cpu time getting processed. |
|
|
623 | * The reverse of this is to call update_ob_speed, which |
|
|
624 | * will do the right thing based on the speed of the object. |
|
|
625 | */ |
|
|
626 | void |
|
|
627 | remove_from_active_list (object *op) |
|
|
628 | { |
|
|
629 | /* If not on the active list, nothing needs to be done */ |
|
|
630 | if (!op->active_next && !op->active_prev && op != active_objects) |
|
|
631 | return; |
|
|
632 | |
|
|
633 | if (op->active_prev == NULL) |
|
|
634 | { |
|
|
635 | active_objects = op->active_next; |
|
|
636 | if (op->active_next != NULL) |
|
|
637 | op->active_next->active_prev = NULL; |
|
|
638 | } |
|
|
639 | else |
|
|
640 | { |
|
|
641 | op->active_prev->active_next = op->active_next; |
|
|
642 | if (op->active_next) |
|
|
643 | op->active_next->active_prev = op->active_prev; |
|
|
644 | } |
|
|
645 | op->active_next = NULL; |
|
|
646 | op->active_prev = NULL; |
|
|
647 | } |
645 | } |
648 | |
646 | |
649 | /* |
647 | /* |
650 | * update_object() updates the the map. |
648 | * update_object() updates the the map. |
651 | * It takes into account invisible objects (and represent squares covered |
649 | * It takes into account invisible objects (and represent squares covered |
… | |
… | |
664 | * UP_OBJ_FACE: only the objects face has changed. |
662 | * UP_OBJ_FACE: only the objects face has changed. |
665 | */ |
663 | */ |
666 | void |
664 | void |
667 | update_object (object *op, int action) |
665 | update_object (object *op, int action) |
668 | { |
666 | { |
669 | MoveType move_on, move_off, move_block, move_slow; |
|
|
670 | |
|
|
671 | if (op == NULL) |
667 | if (op == NULL) |
672 | { |
668 | { |
673 | /* this should never happen */ |
669 | /* this should never happen */ |
674 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
670 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
675 | return; |
671 | return; |
… | |
… | |
699 | return; |
695 | return; |
700 | } |
696 | } |
701 | |
697 | |
702 | mapspace &m = op->ms (); |
698 | mapspace &m = op->ms (); |
703 | |
699 | |
704 | if (m.flags_ & P_NEED_UPDATE) |
700 | if (!(m.flags_ & P_UPTODATE)) |
705 | /* nop */; |
701 | /* nop */; |
706 | else if (action == UP_OBJ_INSERT) |
702 | else if (action == UP_OBJ_INSERT) |
707 | { |
703 | { |
708 | // this is likely overkill, TODO: revisit (schmorp) |
704 | // this is likely overkill, TODO: revisit (schmorp) |
709 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
705 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
… | |
… | |
718 | /* This isn't perfect, but I don't expect a lot of objects to |
714 | /* This isn't perfect, but I don't expect a lot of objects to |
719 | * to have move_allow right now. |
715 | * to have move_allow right now. |
720 | */ |
716 | */ |
721 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
717 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
722 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
718 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
723 | m.flags_ = P_NEED_UPDATE; |
719 | m.flags_ = 0; |
724 | } |
720 | } |
725 | /* if the object is being removed, we can't make intelligent |
721 | /* if the object is being removed, we can't make intelligent |
726 | * decisions, because remove_ob can't really pass the object |
722 | * decisions, because remove_ob can't really pass the object |
727 | * that is being removed. |
723 | * that is being removed. |
728 | */ |
724 | */ |
729 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
725 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
730 | m.flags_ = P_NEED_UPDATE; |
726 | m.flags_ = 0; |
731 | else if (action == UP_OBJ_FACE) |
727 | else if (action == UP_OBJ_FACE) |
732 | /* Nothing to do for that case */ ; |
728 | /* Nothing to do for that case */ ; |
733 | else |
729 | else |
734 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
730 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
735 | |
731 | |
736 | if (op->more) |
732 | if (op->more) |
737 | update_object (op->more, action); |
733 | update_object (op->more, action); |
738 | } |
734 | } |
739 | |
735 | |
740 | object::vector object::objects; // not yet used |
|
|
741 | object *object::first; |
|
|
742 | |
|
|
743 | object::object () |
736 | object::object () |
744 | { |
737 | { |
745 | SET_FLAG (this, FLAG_REMOVED); |
738 | SET_FLAG (this, FLAG_REMOVED); |
746 | |
739 | |
747 | expmul = 1.0; |
740 | expmul = 1.0; |
748 | face = blank_face; |
741 | face = blank_face; |
749 | } |
742 | } |
750 | |
743 | |
751 | object::~object () |
744 | object::~object () |
752 | { |
745 | { |
|
|
746 | unlink (); |
|
|
747 | |
753 | free_key_values (this); |
748 | free_key_values (this); |
754 | } |
749 | } |
755 | |
750 | |
|
|
751 | static int object_count; |
|
|
752 | |
756 | void object::link () |
753 | void object::link () |
757 | { |
754 | { |
758 | count = ++ob_count; |
755 | assert (!index);//D |
759 | uuid = gen_uuid (); |
756 | uuid = gen_uuid (); |
|
|
757 | count = ++object_count; |
760 | |
758 | |
761 | prev = 0; |
759 | refcnt_inc (); |
762 | next = object::first; |
760 | objects.insert (this); |
763 | |
|
|
764 | if (object::first) |
|
|
765 | object::first->prev = this; |
|
|
766 | |
|
|
767 | object::first = this; |
|
|
768 | } |
761 | } |
769 | |
762 | |
770 | void object::unlink () |
763 | void object::unlink () |
771 | { |
764 | { |
772 | if (this == object::first) |
765 | if (!index) |
773 | object::first = next; |
766 | return; |
774 | |
767 | |
775 | /* Remove this object from the list of used objects */ |
768 | objects.erase (this); |
776 | if (prev) prev->next = next; |
769 | refcnt_dec (); |
777 | if (next) next->prev = prev; |
770 | } |
778 | |
771 | |
779 | prev = 0; |
772 | void |
780 | next = 0; |
773 | object::activate () |
|
|
774 | { |
|
|
775 | /* If already on active list, don't do anything */ |
|
|
776 | if (active) |
|
|
777 | return; |
|
|
778 | |
|
|
779 | if (has_active_speed ()) |
|
|
780 | actives.insert (this); |
|
|
781 | } |
|
|
782 | |
|
|
783 | void |
|
|
784 | object::activate_recursive () |
|
|
785 | { |
|
|
786 | activate (); |
|
|
787 | |
|
|
788 | for (object *op = inv; op; op = op->below) |
|
|
789 | op->activate_recursive (); |
|
|
790 | } |
|
|
791 | |
|
|
792 | /* This function removes object 'op' from the list of active |
|
|
793 | * objects. |
|
|
794 | * This should only be used for style maps or other such |
|
|
795 | * reference maps where you don't want an object that isn't |
|
|
796 | * in play chewing up cpu time getting processed. |
|
|
797 | * The reverse of this is to call update_ob_speed, which |
|
|
798 | * will do the right thing based on the speed of the object. |
|
|
799 | */ |
|
|
800 | void |
|
|
801 | object::deactivate () |
|
|
802 | { |
|
|
803 | /* If not on the active list, nothing needs to be done */ |
|
|
804 | if (!active) |
|
|
805 | return; |
|
|
806 | |
|
|
807 | actives.erase (this); |
|
|
808 | } |
|
|
809 | |
|
|
810 | void |
|
|
811 | object::deactivate_recursive () |
|
|
812 | { |
|
|
813 | for (object *op = inv; op; op = op->below) |
|
|
814 | op->deactivate_recursive (); |
|
|
815 | |
|
|
816 | deactivate (); |
|
|
817 | } |
|
|
818 | |
|
|
819 | void |
|
|
820 | object::set_flag_inv (int flag, int value) |
|
|
821 | { |
|
|
822 | for (object *op = inv; op; op = op->below) |
|
|
823 | { |
|
|
824 | op->flag [flag] = value; |
|
|
825 | op->set_flag_inv (flag, value); |
|
|
826 | } |
781 | } |
827 | } |
782 | |
828 | |
783 | /* |
829 | /* |
784 | * Remove and free all objects in the inventory of the given object. |
830 | * Remove and free all objects in the inventory of the given object. |
785 | * object.c ? |
831 | * object.c ? |
… | |
… | |
800 | * drop on that space. |
846 | * drop on that space. |
801 | */ |
847 | */ |
802 | if (!drop_to_ground |
848 | if (!drop_to_ground |
803 | || !map |
849 | || !map |
804 | || map->in_memory != MAP_IN_MEMORY |
850 | || map->in_memory != MAP_IN_MEMORY |
|
|
851 | || map->nodrop |
805 | || ms ().move_block == MOVE_ALL) |
852 | || ms ().move_block == MOVE_ALL) |
806 | { |
853 | { |
807 | while (inv) |
854 | while (inv) |
808 | { |
855 | { |
809 | inv->destroy_inv (drop_to_ground); |
856 | inv->destroy_inv (drop_to_ground); |
… | |
… | |
818 | |
865 | |
819 | if (op->flag [FLAG_STARTEQUIP] |
866 | if (op->flag [FLAG_STARTEQUIP] |
820 | || op->flag [FLAG_NO_DROP] |
867 | || op->flag [FLAG_NO_DROP] |
821 | || op->type == RUNE |
868 | || op->type == RUNE |
822 | || op->type == TRAP |
869 | || op->type == TRAP |
823 | || op->flag [FLAG_IS_A_TEMPLATE]) |
870 | || op->flag [FLAG_IS_A_TEMPLATE] |
|
|
871 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
824 | op->destroy (); |
872 | op->destroy (); |
825 | else |
873 | else |
826 | map->insert (op, x, y); |
874 | map->insert (op, x, y); |
827 | } |
875 | } |
828 | } |
876 | } |
… | |
… | |
836 | } |
884 | } |
837 | |
885 | |
838 | void |
886 | void |
839 | object::do_destroy () |
887 | object::do_destroy () |
840 | { |
888 | { |
|
|
889 | attachable::do_destroy (); |
|
|
890 | |
841 | if (flag [FLAG_IS_LINKED]) |
891 | if (flag [FLAG_IS_LINKED]) |
842 | remove_button_link (this); |
892 | remove_button_link (this); |
843 | |
893 | |
844 | if (flag [FLAG_FRIENDLY]) |
894 | if (flag [FLAG_FRIENDLY]) |
845 | remove_friendly_object (this); |
895 | remove_friendly_object (this); |
846 | |
896 | |
847 | if (!flag [FLAG_REMOVED]) |
897 | if (!flag [FLAG_REMOVED]) |
848 | remove (); |
898 | remove (); |
849 | |
899 | |
850 | if (flag [FLAG_FREED]) |
900 | destroy_inv (true); |
851 | return; |
|
|
852 | |
901 | |
853 | set_speed (0); |
902 | deactivate (); |
|
|
903 | unlink (); |
854 | |
904 | |
855 | flag [FLAG_FREED] = 1; |
905 | flag [FLAG_FREED] = 1; |
856 | |
|
|
857 | attachable::do_destroy (); |
|
|
858 | |
|
|
859 | destroy_inv (true); |
|
|
860 | unlink (); |
|
|
861 | |
906 | |
862 | // hack to ensure that freed objects still have a valid map |
907 | // hack to ensure that freed objects still have a valid map |
863 | { |
908 | { |
864 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
909 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
865 | |
910 | |
… | |
… | |
869 | |
914 | |
870 | freed_map->name = "/internal/freed_objects_map"; |
915 | freed_map->name = "/internal/freed_objects_map"; |
871 | freed_map->width = 3; |
916 | freed_map->width = 3; |
872 | freed_map->height = 3; |
917 | freed_map->height = 3; |
873 | |
918 | |
874 | freed_map->allocate (); |
919 | freed_map->alloc (); |
|
|
920 | freed_map->in_memory = MAP_IN_MEMORY; |
875 | } |
921 | } |
876 | |
922 | |
877 | map = freed_map; |
923 | map = freed_map; |
878 | x = 1; |
924 | x = 1; |
879 | y = 1; |
925 | y = 1; |
… | |
… | |
889 | |
935 | |
890 | // clear those pointers that likely might have circular references to us |
936 | // clear those pointers that likely might have circular references to us |
891 | owner = 0; |
937 | owner = 0; |
892 | enemy = 0; |
938 | enemy = 0; |
893 | attacked_by = 0; |
939 | attacked_by = 0; |
894 | |
|
|
895 | // only relevant for players(?), but make sure of it anyways |
|
|
896 | contr = 0; |
|
|
897 | } |
940 | } |
898 | |
941 | |
899 | void |
942 | void |
900 | object::destroy (bool destroy_inventory) |
943 | object::destroy (bool destroy_inventory) |
901 | { |
944 | { |
… | |
… | |
929 | * This function removes the object op from the linked list of objects |
972 | * This function removes the object op from the linked list of objects |
930 | * which it is currently tied to. When this function is done, the |
973 | * which it is currently tied to. When this function is done, the |
931 | * object will have no environment. If the object previously had an |
974 | * object will have no environment. If the object previously had an |
932 | * environment, the x and y coordinates will be updated to |
975 | * environment, the x and y coordinates will be updated to |
933 | * the previous environment. |
976 | * the previous environment. |
934 | * Beware: This function is called from the editor as well! |
|
|
935 | */ |
977 | */ |
936 | void |
978 | void |
937 | object::remove () |
979 | object::do_remove () |
938 | { |
980 | { |
939 | object *tmp, *last = 0; |
981 | object *tmp, *last = 0; |
940 | object *otmp; |
982 | object *otmp; |
941 | |
983 | |
942 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
984 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
964 | * to save cpu time. |
1006 | * to save cpu time. |
965 | */ |
1007 | */ |
966 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1008 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
967 | otmp->update_stats (); |
1009 | otmp->update_stats (); |
968 | |
1010 | |
969 | if (above != NULL) |
1011 | if (above) |
970 | above->below = below; |
1012 | above->below = below; |
971 | else |
1013 | else |
972 | env->inv = below; |
1014 | env->inv = below; |
973 | |
1015 | |
974 | if (below != NULL) |
1016 | if (below) |
975 | below->above = above; |
1017 | below->above = above; |
976 | |
1018 | |
977 | /* we set up values so that it could be inserted into |
1019 | /* we set up values so that it could be inserted into |
978 | * the map, but we don't actually do that - it is up |
1020 | * the map, but we don't actually do that - it is up |
979 | * to the caller to decide what we want to do. |
1021 | * to the caller to decide what we want to do. |
… | |
… | |
983 | above = 0, below = 0; |
1025 | above = 0, below = 0; |
984 | env = 0; |
1026 | env = 0; |
985 | } |
1027 | } |
986 | else if (map) |
1028 | else if (map) |
987 | { |
1029 | { |
988 | /* Re did the following section of code - it looks like it had |
1030 | if (type == PLAYER) |
989 | * lots of logic for things we no longer care about |
|
|
990 | */ |
1031 | { |
|
|
1032 | // leaving a spot always closes any open container on the ground |
|
|
1033 | if (container && !container->env) |
|
|
1034 | // this causes spurious floorbox updates, but it ensures |
|
|
1035 | // that the CLOSE event is being sent. |
|
|
1036 | close_container (); |
|
|
1037 | |
|
|
1038 | --map->players; |
|
|
1039 | map->touch (); |
|
|
1040 | } |
|
|
1041 | |
|
|
1042 | map->dirty = true; |
|
|
1043 | mapspace &ms = this->ms (); |
991 | |
1044 | |
992 | /* link the object above us */ |
1045 | /* link the object above us */ |
993 | if (above) |
1046 | if (above) |
994 | above->below = below; |
1047 | above->below = below; |
995 | else |
1048 | else |
996 | map->at (x, y).top = below; /* we were top, set new top */ |
1049 | ms.top = below; /* we were top, set new top */ |
997 | |
1050 | |
998 | /* Relink the object below us, if there is one */ |
1051 | /* Relink the object below us, if there is one */ |
999 | if (below) |
1052 | if (below) |
1000 | below->above = above; |
1053 | below->above = above; |
1001 | else |
1054 | else |
… | |
… | |
1003 | /* Nothing below, which means we need to relink map object for this space |
1056 | /* Nothing below, which means we need to relink map object for this space |
1004 | * use translated coordinates in case some oddness with map tiling is |
1057 | * use translated coordinates in case some oddness with map tiling is |
1005 | * evident |
1058 | * evident |
1006 | */ |
1059 | */ |
1007 | if (GET_MAP_OB (map, x, y) != this) |
1060 | if (GET_MAP_OB (map, x, y) != this) |
1008 | { |
|
|
1009 | char *dump = dump_object (this); |
|
|
1010 | LOG (llevError, |
|
|
1011 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); |
1061 | LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ()); |
1012 | free (dump); |
|
|
1013 | dump = dump_object (GET_MAP_OB (map, x, y)); |
|
|
1014 | LOG (llevError, "%s\n", dump); |
|
|
1015 | free (dump); |
|
|
1016 | } |
|
|
1017 | |
1062 | |
1018 | map->at (x, y).bot = above; /* goes on above it. */ |
1063 | ms.bot = above; /* goes on above it. */ |
1019 | } |
1064 | } |
1020 | |
1065 | |
1021 | above = 0; |
1066 | above = 0; |
1022 | below = 0; |
1067 | below = 0; |
1023 | |
1068 | |
1024 | if (map->in_memory == MAP_SAVING) |
1069 | if (map->in_memory == MAP_SAVING) |
1025 | return; |
1070 | return; |
1026 | |
1071 | |
1027 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1072 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1028 | |
1073 | |
1029 | for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) |
1074 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1030 | { |
1075 | { |
1031 | /* No point updating the players look faces if he is the object |
1076 | /* No point updating the players look faces if he is the object |
1032 | * being removed. |
1077 | * being removed. |
1033 | */ |
1078 | */ |
1034 | |
1079 | |
… | |
… | |
1046 | |
1091 | |
1047 | if (tmp->contr->ns) |
1092 | if (tmp->contr->ns) |
1048 | tmp->contr->ns->floorbox_update (); |
1093 | tmp->contr->ns->floorbox_update (); |
1049 | } |
1094 | } |
1050 | |
1095 | |
1051 | /* See if player moving off should effect something */ |
1096 | /* See if object moving off should effect something */ |
1052 | if (check_walk_off |
1097 | if (check_walk_off |
1053 | && ((move_type & tmp->move_off) |
1098 | && ((move_type & tmp->move_off) |
1054 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1099 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1055 | { |
1100 | { |
1056 | move_apply (tmp, this, 0); |
1101 | move_apply (tmp, this, 0); |
… | |
… | |
1058 | if (destroyed ()) |
1103 | if (destroyed ()) |
1059 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1104 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1060 | } |
1105 | } |
1061 | |
1106 | |
1062 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1107 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1063 | |
1108 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
1064 | if (tmp->above == tmp) |
1109 | if (tmp->above == tmp) |
1065 | tmp->above = 0; |
1110 | tmp->above = 0; |
1066 | |
1111 | |
1067 | last = tmp; |
1112 | last = tmp; |
1068 | } |
1113 | } |
1069 | |
1114 | |
1070 | /* last == NULL of there are no objects on this space */ |
1115 | /* last == NULL if there are no objects on this space */ |
|
|
1116 | //TODO: this makes little sense, why only update the topmost object? |
1071 | if (!last) |
1117 | if (!last) |
1072 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1118 | map->at (x, y).flags_ = 0; |
1073 | else |
1119 | else |
1074 | update_object (last, UP_OBJ_REMOVE); |
1120 | update_object (last, UP_OBJ_REMOVE); |
1075 | |
1121 | |
1076 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1122 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1077 | update_all_los (map, x, y); |
1123 | update_all_los (map, x, y); |
… | |
… | |
1113 | } |
1159 | } |
1114 | |
1160 | |
1115 | return 0; |
1161 | return 0; |
1116 | } |
1162 | } |
1117 | |
1163 | |
|
|
1164 | void |
|
|
1165 | object::expand_tail () |
|
|
1166 | { |
|
|
1167 | if (more) |
|
|
1168 | return; |
|
|
1169 | |
|
|
1170 | object *prev = this; |
|
|
1171 | |
|
|
1172 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1173 | { |
|
|
1174 | object *op = arch_to_object (at); |
|
|
1175 | |
|
|
1176 | op->name = name; |
|
|
1177 | op->name_pl = name_pl; |
|
|
1178 | op->title = title; |
|
|
1179 | |
|
|
1180 | op->head = this; |
|
|
1181 | prev->more = op; |
|
|
1182 | |
|
|
1183 | prev = op; |
|
|
1184 | } |
|
|
1185 | } |
|
|
1186 | |
1118 | /* |
1187 | /* |
1119 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1188 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1120 | * job preparing multi-part monsters |
1189 | * job preparing multi-part monsters. |
1121 | */ |
1190 | */ |
1122 | object * |
1191 | object * |
1123 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1192 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1124 | { |
1193 | { |
1125 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1194 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
… | |
… | |
1152 | * just 'op' otherwise |
1221 | * just 'op' otherwise |
1153 | */ |
1222 | */ |
1154 | object * |
1223 | object * |
1155 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1224 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1156 | { |
1225 | { |
|
|
1226 | assert (!op->flag [FLAG_FREED]); |
|
|
1227 | |
1157 | object *tmp, *top, *floor = NULL; |
1228 | object *tmp, *top, *floor = NULL; |
1158 | sint16 x, y; |
|
|
1159 | |
1229 | |
1160 | if (QUERY_FLAG (op, FLAG_FREED)) |
1230 | op->remove (); |
1161 | { |
|
|
1162 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1163 | return NULL; |
|
|
1164 | } |
|
|
1165 | |
1231 | |
1166 | if (m == NULL) |
1232 | #if 0 |
1167 | { |
1233 | if (!m->active != !op->active) |
1168 | char *dump = dump_object (op); |
1234 | if (m->active) |
1169 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1235 | op->activate_recursive (); |
1170 | free (dump); |
1236 | else |
1171 | return op; |
1237 | op->deactivate_recursive (); |
1172 | } |
1238 | #endif |
1173 | |
1239 | |
1174 | if (out_of_map (m, op->x, op->y)) |
1240 | if (out_of_map (m, op->x, op->y)) |
1175 | { |
1241 | { |
1176 | char *dump = dump_object (op); |
|
|
1177 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1242 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1178 | #ifdef MANY_CORES |
1243 | #ifdef MANY_CORES |
1179 | /* Better to catch this here, as otherwise the next use of this object |
1244 | /* Better to catch this here, as otherwise the next use of this object |
1180 | * is likely to cause a crash. Better to find out where it is getting |
1245 | * is likely to cause a crash. Better to find out where it is getting |
1181 | * improperly inserted. |
1246 | * improperly inserted. |
1182 | */ |
1247 | */ |
1183 | abort (); |
1248 | abort (); |
1184 | #endif |
1249 | #endif |
1185 | free (dump); |
|
|
1186 | return op; |
1250 | return op; |
1187 | } |
1251 | } |
1188 | |
1252 | |
1189 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1190 | { |
|
|
1191 | char *dump = dump_object (op); |
|
|
1192 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1193 | free (dump); |
|
|
1194 | return op; |
|
|
1195 | } |
|
|
1196 | |
|
|
1197 | if (op->more) |
|
|
1198 | { |
|
|
1199 | /* The part may be on a different map. */ |
|
|
1200 | |
|
|
1201 | object *more = op->more; |
1253 | if (object *more = op->more) |
1202 | |
1254 | { |
1203 | /* We really need the caller to normalize coordinates - if |
|
|
1204 | * we set the map, that doesn't work if the location is within |
|
|
1205 | * a map and this is straddling an edge. So only if coordinate |
|
|
1206 | * is clear wrong do we normalize it. |
|
|
1207 | */ |
|
|
1208 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1209 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1210 | else if (!more->map) |
|
|
1211 | { |
|
|
1212 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1213 | * more->map should always point to the parent. |
|
|
1214 | */ |
|
|
1215 | more->map = m; |
|
|
1216 | } |
|
|
1217 | |
|
|
1218 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
1255 | if (!insert_ob_in_map (more, m, originator, flag)) |
1219 | { |
1256 | { |
1220 | if (!op->head) |
1257 | if (!op->head) |
1221 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1258 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1222 | |
1259 | |
1223 | return 0; |
1260 | return 0; |
… | |
… | |
1228 | |
1265 | |
1229 | /* Ideally, the caller figures this out. However, it complicates a lot |
1266 | /* Ideally, the caller figures this out. However, it complicates a lot |
1230 | * of areas of callers (eg, anything that uses find_free_spot would now |
1267 | * of areas of callers (eg, anything that uses find_free_spot would now |
1231 | * need extra work |
1268 | * need extra work |
1232 | */ |
1269 | */ |
1233 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1270 | if (!xy_normalise (m, op->x, op->y)) |
1234 | x = op->x; |
1271 | return 0; |
1235 | y = op->y; |
1272 | |
|
|
1273 | op->map = m; |
|
|
1274 | mapspace &ms = op->ms (); |
1236 | |
1275 | |
1237 | /* this has to be done after we translate the coordinates. |
1276 | /* this has to be done after we translate the coordinates. |
1238 | */ |
1277 | */ |
1239 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1278 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1240 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1279 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1241 | if (object::can_merge (op, tmp)) |
1280 | if (object::can_merge (op, tmp)) |
1242 | { |
1281 | { |
1243 | op->nrof += tmp->nrof; |
1282 | op->nrof += tmp->nrof; |
1244 | tmp->destroy (); |
1283 | tmp->destroy (); |
1245 | } |
1284 | } |
… | |
… | |
1262 | op->below = originator->below; |
1301 | op->below = originator->below; |
1263 | |
1302 | |
1264 | if (op->below) |
1303 | if (op->below) |
1265 | op->below->above = op; |
1304 | op->below->above = op; |
1266 | else |
1305 | else |
1267 | op->ms ().bot = op; |
1306 | ms.bot = op; |
1268 | |
1307 | |
1269 | /* since *below* originator, no need to update top */ |
1308 | /* since *below* originator, no need to update top */ |
1270 | originator->below = op; |
1309 | originator->below = op; |
1271 | } |
1310 | } |
1272 | else |
1311 | else |
1273 | { |
1312 | { |
|
|
1313 | top = ms.bot; |
|
|
1314 | |
1274 | /* If there are other objects, then */ |
1315 | /* If there are other objects, then */ |
1275 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1316 | if ((!(flag & INS_MAP_LOAD)) && top) |
1276 | { |
1317 | { |
1277 | object *last = NULL; |
1318 | object *last = 0; |
1278 | |
1319 | |
1279 | /* |
1320 | /* |
1280 | * If there are multiple objects on this space, we do some trickier handling. |
1321 | * If there are multiple objects on this space, we do some trickier handling. |
1281 | * We've already dealt with merging if appropriate. |
1322 | * We've already dealt with merging if appropriate. |
1282 | * Generally, we want to put the new object on top. But if |
1323 | * Generally, we want to put the new object on top. But if |
… | |
… | |
1286 | * once we get to them. This reduces the need to traverse over all of |
1327 | * once we get to them. This reduces the need to traverse over all of |
1287 | * them when adding another one - this saves quite a bit of cpu time |
1328 | * them when adding another one - this saves quite a bit of cpu time |
1288 | * when lots of spells are cast in one area. Currently, it is presumed |
1329 | * when lots of spells are cast in one area. Currently, it is presumed |
1289 | * that flying non pickable objects are spell objects. |
1330 | * that flying non pickable objects are spell objects. |
1290 | */ |
1331 | */ |
1291 | |
1332 | for (top = ms.bot; top; top = top->above) |
1292 | while (top != NULL) |
|
|
1293 | { |
1333 | { |
1294 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1334 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1295 | floor = top; |
1335 | floor = top; |
1296 | |
1336 | |
1297 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1337 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1300 | top = top->below; |
1340 | top = top->below; |
1301 | break; |
1341 | break; |
1302 | } |
1342 | } |
1303 | |
1343 | |
1304 | last = top; |
1344 | last = top; |
1305 | top = top->above; |
|
|
1306 | } |
1345 | } |
1307 | |
1346 | |
1308 | /* Don't want top to be NULL, so set it to the last valid object */ |
1347 | /* Don't want top to be NULL, so set it to the last valid object */ |
1309 | top = last; |
1348 | top = last; |
1310 | |
1349 | |
… | |
… | |
1312 | * looks like instead of lots of conditions here. |
1351 | * looks like instead of lots of conditions here. |
1313 | * makes things faster, and effectively the same result. |
1352 | * makes things faster, and effectively the same result. |
1314 | */ |
1353 | */ |
1315 | |
1354 | |
1316 | /* Have object 'fall below' other objects that block view. |
1355 | /* Have object 'fall below' other objects that block view. |
1317 | * Unless those objects are exits, type 66 |
1356 | * Unless those objects are exits. |
1318 | * If INS_ON_TOP is used, don't do this processing |
1357 | * If INS_ON_TOP is used, don't do this processing |
1319 | * Need to find the object that in fact blocks view, otherwise |
1358 | * Need to find the object that in fact blocks view, otherwise |
1320 | * stacking is a bit odd. |
1359 | * stacking is a bit odd. |
1321 | */ |
1360 | */ |
1322 | if (!(flag & INS_ON_TOP) && |
1361 | if (!(flag & INS_ON_TOP) |
1323 | (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1362 | && ms.flags () & P_BLOCKSVIEW |
|
|
1363 | && (op->face && !faces [op->face].visibility)) |
1324 | { |
1364 | { |
1325 | for (last = top; last != floor; last = last->below) |
1365 | for (last = top; last != floor; last = last->below) |
1326 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1366 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1327 | break; |
1367 | break; |
|
|
1368 | |
1328 | /* Check to see if we found the object that blocks view, |
1369 | /* Check to see if we found the object that blocks view, |
1329 | * and make sure we have a below pointer for it so that |
1370 | * and make sure we have a below pointer for it so that |
1330 | * we can get inserted below this one, which requires we |
1371 | * we can get inserted below this one, which requires we |
1331 | * set top to the object below us. |
1372 | * set top to the object below us. |
1332 | */ |
1373 | */ |
… | |
… | |
1334 | top = last->below; |
1375 | top = last->below; |
1335 | } |
1376 | } |
1336 | } /* If objects on this space */ |
1377 | } /* If objects on this space */ |
1337 | |
1378 | |
1338 | if (flag & INS_MAP_LOAD) |
1379 | if (flag & INS_MAP_LOAD) |
1339 | top = GET_MAP_TOP (op->map, op->x, op->y); |
1380 | top = ms.top; |
1340 | |
1381 | |
1341 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1382 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1342 | top = floor; |
1383 | top = floor; |
1343 | |
1384 | |
1344 | /* Top is the object that our object (op) is going to get inserted above. |
1385 | /* Top is the object that our object (op) is going to get inserted above. |
1345 | */ |
1386 | */ |
1346 | |
1387 | |
1347 | /* First object on this space */ |
1388 | /* First object on this space */ |
1348 | if (!top) |
1389 | if (!top) |
1349 | { |
1390 | { |
1350 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1391 | op->above = ms.bot; |
1351 | |
1392 | |
1352 | if (op->above) |
1393 | if (op->above) |
1353 | op->above->below = op; |
1394 | op->above->below = op; |
1354 | |
1395 | |
1355 | op->below = NULL; |
1396 | op->below = 0; |
1356 | op->ms ().bot = op; |
1397 | ms.bot = op; |
1357 | } |
1398 | } |
1358 | else |
1399 | else |
1359 | { /* get inserted into the stack above top */ |
1400 | { /* get inserted into the stack above top */ |
1360 | op->above = top->above; |
1401 | op->above = top->above; |
1361 | |
1402 | |
… | |
… | |
1364 | |
1405 | |
1365 | op->below = top; |
1406 | op->below = top; |
1366 | top->above = op; |
1407 | top->above = op; |
1367 | } |
1408 | } |
1368 | |
1409 | |
1369 | if (op->above == NULL) |
1410 | if (!op->above) |
1370 | op->ms ().top = op; |
1411 | ms.top = op; |
1371 | } /* else not INS_BELOW_ORIGINATOR */ |
1412 | } /* else not INS_BELOW_ORIGINATOR */ |
1372 | |
1413 | |
1373 | if (op->type == PLAYER) |
1414 | if (op->type == PLAYER) |
|
|
1415 | { |
1374 | op->contr->do_los = 1; |
1416 | op->contr->do_los = 1; |
|
|
1417 | ++op->map->players; |
|
|
1418 | op->map->touch (); |
|
|
1419 | } |
|
|
1420 | |
|
|
1421 | op->map->dirty = true; |
1375 | |
1422 | |
1376 | /* If we have a floor, we know the player, if any, will be above |
1423 | /* If we have a floor, we know the player, if any, will be above |
1377 | * it, so save a few ticks and start from there. |
1424 | * it, so save a few ticks and start from there. |
1378 | */ |
1425 | */ |
1379 | if (!(flag & INS_MAP_LOAD)) |
1426 | if (!(flag & INS_MAP_LOAD)) |
1380 | if (object *pl = op->ms ().player ()) |
1427 | if (object *pl = ms.player ()) |
1381 | if (pl->contr->ns) |
1428 | if (pl->contr->ns) |
1382 | pl->contr->ns->floorbox_update (); |
1429 | pl->contr->ns->floorbox_update (); |
1383 | |
1430 | |
1384 | /* If this object glows, it may affect lighting conditions that are |
1431 | /* If this object glows, it may affect lighting conditions that are |
1385 | * visible to others on this map. But update_all_los is really |
1432 | * visible to others on this map. But update_all_los is really |
1386 | * an inefficient way to do this, as it means los for all players |
1433 | * an inefficient way to do this, as it means los for all players |
1387 | * on the map will get recalculated. The players could very well |
1434 | * on the map will get recalculated. The players could very well |
1388 | * be far away from this change and not affected in any way - |
1435 | * be far away from this change and not affected in any way - |
1389 | * this should get redone to only look for players within range, |
1436 | * this should get redone to only look for players within range, |
1390 | * or just updating the P_NEED_UPDATE for spaces within this area |
1437 | * or just updating the P_UPTODATE for spaces within this area |
1391 | * of effect may be sufficient. |
1438 | * of effect may be sufficient. |
1392 | */ |
1439 | */ |
1393 | if (op->map->darkness && (op->glow_radius != 0)) |
1440 | if (op->map->darkness && (op->glow_radius != 0)) |
1394 | update_all_los (op->map, op->x, op->y); |
1441 | update_all_los (op->map, op->x, op->y); |
1395 | |
1442 | |
… | |
… | |
1433 | { |
1480 | { |
1434 | object *tmp, *tmp1; |
1481 | object *tmp, *tmp1; |
1435 | |
1482 | |
1436 | /* first search for itself and remove any old instances */ |
1483 | /* first search for itself and remove any old instances */ |
1437 | |
1484 | |
1438 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1485 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1439 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1486 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1440 | tmp->destroy (); |
1487 | tmp->destroy (); |
1441 | |
1488 | |
1442 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1489 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1443 | |
1490 | |
… | |
… | |
1447 | } |
1494 | } |
1448 | |
1495 | |
1449 | object * |
1496 | object * |
1450 | object::insert_at (object *where, object *originator, int flags) |
1497 | object::insert_at (object *where, object *originator, int flags) |
1451 | { |
1498 | { |
1452 | where->map->insert (this, where->x, where->y, originator, flags); |
1499 | return where->map->insert (this, where->x, where->y, originator, flags); |
1453 | } |
1500 | } |
1454 | |
1501 | |
1455 | /* |
1502 | /* |
1456 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1503 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1457 | * is returned contains nr objects, and the remaining parts contains |
1504 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1497 | * the amount of an object. If the amount reaches 0, the object |
1544 | * the amount of an object. If the amount reaches 0, the object |
1498 | * is subsequently removed and freed. |
1545 | * is subsequently removed and freed. |
1499 | * |
1546 | * |
1500 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1547 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1501 | */ |
1548 | */ |
1502 | |
|
|
1503 | object * |
1549 | object * |
1504 | decrease_ob_nr (object *op, uint32 i) |
1550 | decrease_ob_nr (object *op, uint32 i) |
1505 | { |
1551 | { |
1506 | object *tmp; |
1552 | object *tmp; |
1507 | |
1553 | |
… | |
… | |
1582 | |
1628 | |
1583 | /* |
1629 | /* |
1584 | * add_weight(object, weight) adds the specified weight to an object, |
1630 | * add_weight(object, weight) adds the specified weight to an object, |
1585 | * and also updates how much the environment(s) is/are carrying. |
1631 | * and also updates how much the environment(s) is/are carrying. |
1586 | */ |
1632 | */ |
1587 | |
|
|
1588 | void |
1633 | void |
1589 | add_weight (object *op, signed long weight) |
1634 | add_weight (object *op, signed long weight) |
1590 | { |
1635 | { |
1591 | while (op != NULL) |
1636 | while (op != NULL) |
1592 | { |
1637 | { |
… | |
… | |
1624 | * inside the object environment. |
1669 | * inside the object environment. |
1625 | * |
1670 | * |
1626 | * The function returns now pointer to inserted item, and return value can |
1671 | * The function returns now pointer to inserted item, and return value can |
1627 | * be != op, if items are merged. -Tero |
1672 | * be != op, if items are merged. -Tero |
1628 | */ |
1673 | */ |
1629 | |
|
|
1630 | object * |
1674 | object * |
1631 | object::insert (object *op) |
1675 | object::insert (object *op) |
1632 | { |
1676 | { |
1633 | object *tmp, *otmp; |
1677 | object *tmp, *otmp; |
1634 | |
1678 | |
… | |
… | |
1766 | |
1810 | |
1767 | /* The objects have to be checked from top to bottom. |
1811 | /* The objects have to be checked from top to bottom. |
1768 | * Hence, we first go to the top: |
1812 | * Hence, we first go to the top: |
1769 | */ |
1813 | */ |
1770 | |
1814 | |
1771 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above) |
1815 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1772 | { |
1816 | { |
1773 | /* Trim the search when we find the first other spell effect |
1817 | /* Trim the search when we find the first other spell effect |
1774 | * this helps performance so that if a space has 50 spell objects, |
1818 | * this helps performance so that if a space has 50 spell objects, |
1775 | * we don't need to check all of them. |
1819 | * we don't need to check all of them. |
1776 | */ |
1820 | */ |
… | |
… | |
1794 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1838 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1795 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1839 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1796 | { |
1840 | { |
1797 | |
1841 | |
1798 | float |
1842 | float |
1799 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1843 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1800 | |
1844 | |
1801 | if (op->type == PLAYER) |
1845 | if (op->type == PLAYER) |
1802 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1846 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1803 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1847 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1804 | diff /= 4.0; |
1848 | diff /= 4.0; |
… | |
… | |
1834 | * The first matching object is returned, or NULL if none. |
1878 | * The first matching object is returned, or NULL if none. |
1835 | */ |
1879 | */ |
1836 | object * |
1880 | object * |
1837 | present_arch (const archetype *at, maptile *m, int x, int y) |
1881 | present_arch (const archetype *at, maptile *m, int x, int y) |
1838 | { |
1882 | { |
1839 | if (m == NULL || out_of_map (m, x, y)) |
1883 | if (!m || out_of_map (m, x, y)) |
1840 | { |
1884 | { |
1841 | LOG (llevError, "Present_arch called outside map.\n"); |
1885 | LOG (llevError, "Present_arch called outside map.\n"); |
1842 | return NULL; |
1886 | return NULL; |
1843 | } |
1887 | } |
1844 | |
1888 | |
1845 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1889 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1846 | if (tmp->arch == at) |
1890 | if (tmp->arch == at) |
1847 | return tmp; |
1891 | return tmp; |
1848 | |
1892 | |
1849 | return NULL; |
1893 | return NULL; |
1850 | } |
1894 | } |
… | |
… | |
1861 | { |
1905 | { |
1862 | LOG (llevError, "Present called outside map.\n"); |
1906 | LOG (llevError, "Present called outside map.\n"); |
1863 | return NULL; |
1907 | return NULL; |
1864 | } |
1908 | } |
1865 | |
1909 | |
1866 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1910 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1867 | if (tmp->type == type) |
1911 | if (tmp->type == type) |
1868 | return tmp; |
1912 | return tmp; |
1869 | |
1913 | |
1870 | return NULL; |
1914 | return NULL; |
1871 | } |
1915 | } |
… | |
… | |
2011 | } |
2055 | } |
2012 | |
2056 | |
2013 | if (!index) |
2057 | if (!index) |
2014 | return -1; |
2058 | return -1; |
2015 | |
2059 | |
2016 | return altern[RANDOM () % index]; |
2060 | return altern [rndm (index)]; |
2017 | } |
2061 | } |
2018 | |
2062 | |
2019 | /* |
2063 | /* |
2020 | * find_first_free_spot(archetype, maptile, x, y) works like |
2064 | * find_first_free_spot(archetype, maptile, x, y) works like |
2021 | * find_free_spot(), but it will search max number of squares. |
2065 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
2042 | { |
2086 | { |
2043 | arr += begin; |
2087 | arr += begin; |
2044 | end -= begin; |
2088 | end -= begin; |
2045 | |
2089 | |
2046 | while (--end) |
2090 | while (--end) |
2047 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2091 | swap (arr [end], arr [rndm (end + 1)]); |
2048 | } |
2092 | } |
2049 | |
2093 | |
2050 | /* new function to make monster searching more efficient, and effective! |
2094 | /* new function to make monster searching more efficient, and effective! |
2051 | * This basically returns a randomized array (in the passed pointer) of |
2095 | * This basically returns a randomized array (in the passed pointer) of |
2052 | * the spaces to find monsters. In this way, it won't always look for |
2096 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2186 | |
2230 | |
2187 | return 3; |
2231 | return 3; |
2188 | } |
2232 | } |
2189 | |
2233 | |
2190 | /* |
2234 | /* |
2191 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2192 | * the "absolute" direction of a number (it actually takes care of |
|
|
2193 | * "overflow" in previous calculations of a direction). |
|
|
2194 | */ |
|
|
2195 | |
|
|
2196 | int |
|
|
2197 | absdir (int d) |
|
|
2198 | { |
|
|
2199 | while (d < 1) |
|
|
2200 | d += 8; |
|
|
2201 | |
|
|
2202 | while (d > 8) |
|
|
2203 | d -= 8; |
|
|
2204 | |
|
|
2205 | return d; |
|
|
2206 | } |
|
|
2207 | |
|
|
2208 | /* |
|
|
2209 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2235 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2210 | * between two directions (which are expected to be absolute (see absdir()) |
2236 | * between two directions (which are expected to be absolute (see absdir()) |
2211 | */ |
2237 | */ |
2212 | |
|
|
2213 | int |
2238 | int |
2214 | dirdiff (int dir1, int dir2) |
2239 | dirdiff (int dir1, int dir2) |
2215 | { |
2240 | { |
2216 | int d; |
2241 | int d; |
2217 | |
2242 | |
… | |
… | |
2383 | insert_ob_in_ob (object_create_clone (item), dst); |
2408 | insert_ob_in_ob (object_create_clone (item), dst); |
2384 | |
2409 | |
2385 | return dst; |
2410 | return dst; |
2386 | } |
2411 | } |
2387 | |
2412 | |
2388 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2389 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2390 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2391 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2392 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2393 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2394 | object * |
|
|
2395 | load_object_str (const char *obstr) |
|
|
2396 | { |
|
|
2397 | object *op; |
|
|
2398 | char filename[MAX_BUF]; |
|
|
2399 | |
|
|
2400 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2401 | |
|
|
2402 | FILE *tempfile = fopen (filename, "w"); |
|
|
2403 | |
|
|
2404 | if (tempfile == NULL) |
|
|
2405 | { |
|
|
2406 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2407 | return NULL; |
|
|
2408 | } |
|
|
2409 | |
|
|
2410 | fprintf (tempfile, obstr); |
|
|
2411 | fclose (tempfile); |
|
|
2412 | |
|
|
2413 | op = object::create (); |
|
|
2414 | |
|
|
2415 | object_thawer thawer (filename); |
|
|
2416 | |
|
|
2417 | if (thawer) |
|
|
2418 | load_object (thawer, op, 0); |
|
|
2419 | |
|
|
2420 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2421 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2422 | |
|
|
2423 | return op; |
|
|
2424 | } |
|
|
2425 | |
|
|
2426 | /* This returns the first object in who's inventory that |
2413 | /* This returns the first object in who's inventory that |
2427 | * has the same type and subtype match. |
2414 | * has the same type and subtype match. |
2428 | * returns NULL if no match. |
2415 | * returns NULL if no match. |
2429 | */ |
2416 | */ |
2430 | object * |
2417 | object * |
… | |
… | |
2483 | if (link->key == canonical_key) |
2470 | if (link->key == canonical_key) |
2484 | return link->value; |
2471 | return link->value; |
2485 | |
2472 | |
2486 | return 0; |
2473 | return 0; |
2487 | } |
2474 | } |
2488 | |
|
|
2489 | |
2475 | |
2490 | /* |
2476 | /* |
2491 | * Updates the canonical_key in op to value. |
2477 | * Updates the canonical_key in op to value. |
2492 | * |
2478 | * |
2493 | * canonical_key is a shared string (value doesn't have to be). |
2479 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2596 | } |
2582 | } |
2597 | else |
2583 | else |
2598 | item = item->env; |
2584 | item = item->env; |
2599 | } |
2585 | } |
2600 | |
2586 | |
|
|
2587 | |
|
|
2588 | const char * |
|
|
2589 | object::flag_desc (char *desc, int len) const |
|
|
2590 | { |
|
|
2591 | char *p = desc; |
|
|
2592 | bool first = true; |
|
|
2593 | |
|
|
2594 | *p = 0; |
|
|
2595 | |
|
|
2596 | for (int i = 0; i < NUM_FLAGS; i++) |
|
|
2597 | { |
|
|
2598 | if (len <= 10) // magic constant! |
|
|
2599 | { |
|
|
2600 | snprintf (p, len, ",..."); |
|
|
2601 | break; |
|
|
2602 | } |
|
|
2603 | |
|
|
2604 | if (flag [i]) |
|
|
2605 | { |
|
|
2606 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
|
|
2607 | len -= cnt; |
|
|
2608 | p += cnt; |
|
|
2609 | first = false; |
|
|
2610 | } |
|
|
2611 | } |
|
|
2612 | |
|
|
2613 | return desc; |
|
|
2614 | } |
|
|
2615 | |
2601 | // return a suitable string describing an objetc in enough detail to find it |
2616 | // return a suitable string describing an object in enough detail to find it |
2602 | const char * |
2617 | const char * |
2603 | object::debug_desc (char *info) const |
2618 | object::debug_desc (char *info) const |
2604 | { |
2619 | { |
|
|
2620 | char flagdesc[512]; |
2605 | char info2[256 * 3]; |
2621 | char info2[256 * 4]; |
2606 | char *p = info; |
2622 | char *p = info; |
2607 | |
2623 | |
2608 | p += snprintf (p, 256, "%d=\"%s%s%s\"", |
2624 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2609 | count, |
2625 | count, uuid.seq, |
2610 | &name, |
2626 | &name, |
2611 | title ? " " : "", |
2627 | title ? "\",title:\"" : "", |
2612 | title ? (const char *)title : ""); |
2628 | title ? (const char *)title : "", |
|
|
2629 | flag_desc (flagdesc, 512), type); |
2613 | |
2630 | |
2614 | if (env) |
2631 | if (env) |
2615 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2632 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2616 | |
2633 | |
2617 | if (map) |
2634 | if (map) |
2618 | p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); |
2635 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2619 | |
2636 | |
2620 | return info; |
2637 | return info; |
2621 | } |
2638 | } |
2622 | |
2639 | |
2623 | const char * |
2640 | const char * |
2624 | object::debug_desc () const |
2641 | object::debug_desc () const |
2625 | { |
2642 | { |
2626 | static char info[256 * 3]; |
2643 | static char info[3][256 * 4]; |
|
|
2644 | static int info_idx; |
|
|
2645 | |
2627 | return debug_desc (info); |
2646 | return debug_desc (info [++info_idx % 3]); |
2628 | } |
2647 | } |
2629 | |
2648 | |
|
|
2649 | struct region * |
|
|
2650 | object::region () const |
|
|
2651 | { |
|
|
2652 | return map ? map->region (x, y) |
|
|
2653 | : region::default_region (); |
|
|
2654 | } |
|
|
2655 | |
|
|
2656 | const materialtype_t * |
|
|
2657 | object::dominant_material () const |
|
|
2658 | { |
|
|
2659 | if (materialtype_t *mat = name_to_material (materialname)) |
|
|
2660 | return mat; |
|
|
2661 | |
|
|
2662 | // omfg this is slow, this has to be temporary :) |
|
|
2663 | shstr unknown ("unknown"); |
|
|
2664 | |
|
|
2665 | return name_to_material (unknown); |
|
|
2666 | } |
|
|
2667 | |
|
|
2668 | void |
|
|
2669 | object::open_container (object *new_container) |
|
|
2670 | { |
|
|
2671 | if (container == new_container) |
|
|
2672 | return; |
|
|
2673 | |
|
|
2674 | if (object *old_container = container) |
|
|
2675 | { |
|
|
2676 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2677 | return; |
|
|
2678 | |
|
|
2679 | #if 0 |
|
|
2680 | // remove the "Close old_container" object. |
|
|
2681 | if (object *closer = old_container->inv) |
|
|
2682 | if (closer->type == CLOSE_CON) |
|
|
2683 | closer->destroy (); |
|
|
2684 | #endif |
|
|
2685 | |
|
|
2686 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2687 | container = 0; |
|
|
2688 | |
|
|
2689 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2690 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2691 | } |
|
|
2692 | |
|
|
2693 | if (new_container) |
|
|
2694 | { |
|
|
2695 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2696 | return; |
|
|
2697 | |
|
|
2698 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2699 | #if 0 |
|
|
2700 | // insert the "Close Container" object. |
|
|
2701 | if (archetype *closer = new_container->other_arch) |
|
|
2702 | { |
|
|
2703 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2704 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2705 | new_container->insert (closer); |
|
|
2706 | } |
|
|
2707 | #endif |
|
|
2708 | |
|
|
2709 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2710 | |
|
|
2711 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2712 | container = new_container; |
|
|
2713 | |
|
|
2714 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2715 | esrv_send_inventory (this, new_container); |
|
|
2716 | } |
|
|
2717 | } |
|
|
2718 | |
|
|
2719 | |