|
|
1 | |
1 | /* |
2 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
3 | CrossFire, A Multiplayer game for X-windows |
3 | |
4 | |
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 |
… | |
… | |
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> |
33 | #include <skills.h> |
|
|
34 | #include <loader.h> |
34 | #include <loader.h> |
35 | |
35 | |
36 | int nrofallocobjects = 0; |
36 | int nrofallocobjects = 0; |
|
|
37 | static UUID uuid; |
|
|
38 | const uint64 UUID_SKIP = 1<<19; |
37 | |
39 | |
38 | object *objects; /* Pointer to the list of used objects */ |
40 | object *objects; /* Pointer to the list of used objects */ |
39 | object *active_objects; /* List of active objects that need to be processed */ |
41 | object *active_objects; /* List of active objects that need to be processed */ |
40 | |
42 | |
41 | 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, |
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, |
… | |
… | |
49 | }; |
51 | }; |
50 | int freedir[SIZEOFFREE] = { |
52 | int freedir[SIZEOFFREE] = { |
51 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
53 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
52 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
54 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
53 | }; |
55 | }; |
|
|
56 | |
|
|
57 | static void |
|
|
58 | write_uuid (void) |
|
|
59 | { |
|
|
60 | char filename1[MAX_BUF], filename2[MAX_BUF]; |
|
|
61 | |
|
|
62 | sprintf (filename1, "%s/uuid", settings.localdir); |
|
|
63 | sprintf (filename2, "%s/uuid~", settings.localdir); |
|
|
64 | |
|
|
65 | FILE *fp; |
|
|
66 | |
|
|
67 | if (!(fp = fopen (filename2, "w"))) |
|
|
68 | { |
|
|
69 | LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); |
|
|
70 | return; |
|
|
71 | } |
|
|
72 | |
|
|
73 | fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2); |
|
|
74 | fclose (fp); |
|
|
75 | rename (filename2, filename1); |
|
|
76 | } |
|
|
77 | |
|
|
78 | static void |
|
|
79 | read_uuid (void) |
|
|
80 | { |
|
|
81 | char filename[MAX_BUF]; |
|
|
82 | |
|
|
83 | sprintf (filename, "%s/uuid", settings.localdir); |
|
|
84 | |
|
|
85 | FILE *fp; |
|
|
86 | |
|
|
87 | if (!(fp = fopen (filename, "r"))) |
|
|
88 | { |
|
|
89 | if (errno == ENOENT) |
|
|
90 | { |
|
|
91 | LOG (llevInfo, "RESET uid to 1\n"); |
|
|
92 | uuid.seq = 0; |
|
|
93 | write_uuid (); |
|
|
94 | return; |
|
|
95 | } |
|
|
96 | |
|
|
97 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
|
|
98 | _exit (1); |
|
|
99 | } |
|
|
100 | |
|
|
101 | int version; |
|
|
102 | unsigned long long uid; |
|
|
103 | if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1) |
|
|
104 | { |
|
|
105 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
|
|
106 | _exit (1); |
|
|
107 | } |
|
|
108 | |
|
|
109 | uuid.seq = uid; |
|
|
110 | write_uuid (); |
|
|
111 | LOG (llevDebug, "read UID: %lld\n", uid); |
|
|
112 | fclose (fp); |
|
|
113 | } |
|
|
114 | |
|
|
115 | UUID |
|
|
116 | gen_uuid () |
|
|
117 | { |
|
|
118 | UUID uid; |
|
|
119 | |
|
|
120 | uid.seq = ++uuid.seq; |
|
|
121 | |
|
|
122 | if (!(uuid.seq & (UUID_SKIP - 1))) |
|
|
123 | write_uuid (); |
|
|
124 | |
|
|
125 | return uid; |
|
|
126 | } |
|
|
127 | |
|
|
128 | void |
|
|
129 | init_uuid () |
|
|
130 | { |
|
|
131 | read_uuid (); |
|
|
132 | } |
54 | |
133 | |
55 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
134 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
56 | static int |
135 | static int |
57 | compare_ob_value_lists_one (const object *wants, const object *has) |
136 | compare_ob_value_lists_one (const object *wants, const object *has) |
58 | { |
137 | { |
… | |
… | |
207 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) |
286 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) |
208 | return 0; |
287 | return 0; |
209 | |
288 | |
210 | switch (ob1->type) |
289 | switch (ob1->type) |
211 | { |
290 | { |
212 | case SCROLL: |
291 | case SCROLL: |
213 | if (ob1->level != ob2->level) |
292 | if (ob1->level != ob2->level) |
214 | return 0; |
293 | return 0; |
215 | break; |
294 | break; |
216 | } |
295 | } |
217 | |
296 | |
218 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
297 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
219 | { |
298 | { |
220 | /* At least one of these has key_values. */ |
299 | /* At least one of these has key_values. */ |
… | |
… | |
254 | { |
333 | { |
255 | if (inv->inv) |
334 | if (inv->inv) |
256 | sum_weight (inv); |
335 | sum_weight (inv); |
257 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
336 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
258 | } |
337 | } |
|
|
338 | |
259 | if (op->type == CONTAINER && op->stats.Str) |
339 | if (op->type == CONTAINER && op->stats.Str) |
260 | sum = (sum * (100 - op->stats.Str)) / 100; |
340 | sum = (sum * (100 - op->stats.Str)) / 100; |
|
|
341 | |
261 | if (op->carrying != sum) |
342 | if (op->carrying != sum) |
262 | op->carrying = sum; |
343 | op->carrying = sum; |
|
|
344 | |
263 | return sum; |
345 | return sum; |
264 | } |
346 | } |
265 | |
347 | |
266 | /** |
348 | /** |
267 | * Return the outermost environment object for a given object. |
349 | * Return the outermost environment object for a given object. |
… | |
… | |
416 | */ |
498 | */ |
417 | |
499 | |
418 | object * |
500 | object * |
419 | find_object_name (const char *str) |
501 | find_object_name (const char *str) |
420 | { |
502 | { |
421 | const char *name = shstr::find (str); |
503 | shstr_cmp str_ (str); |
422 | object *op; |
504 | object *op; |
423 | |
505 | |
424 | for (op = objects; op != NULL; op = op->next) |
506 | for (op = objects; op != NULL; op = op->next) |
425 | if (&op->name == name) |
507 | if (op->name == str_) |
426 | break; |
508 | break; |
427 | |
509 | |
428 | return op; |
510 | return op; |
429 | } |
511 | } |
430 | |
512 | |
… | |
… | |
442 | * Changed 2004-02-12 - if the player is setting at the play again |
524 | * Changed 2004-02-12 - if the player is setting at the play again |
443 | * prompt, he is removed, and we don't want to treat him as an owner of |
525 | * prompt, he is removed, and we don't want to treat him as an owner of |
444 | * anything, so check removed flag. I don't expect that this should break |
526 | * anything, so check removed flag. I don't expect that this should break |
445 | * anything - once an object is removed, it is basically dead anyways. |
527 | * anything - once an object is removed, it is basically dead anyways. |
446 | */ |
528 | */ |
447 | |
|
|
448 | object * |
529 | object * |
449 | get_owner (object *op) |
530 | object::get_owner () |
450 | { |
531 | { |
451 | if (op->owner == NULL) |
532 | if (!owner |
452 | return NULL; |
533 | || QUERY_FLAG (owner, FLAG_FREED) |
|
|
534 | || QUERY_FLAG (owner, FLAG_REMOVED)) |
|
|
535 | owner = 0; |
453 | |
536 | |
454 | if (!QUERY_FLAG (op->owner, FLAG_FREED) && !QUERY_FLAG (op->owner, FLAG_REMOVED) && op->owner->count == op->ownercount) |
|
|
455 | return op->owner; |
537 | return owner; |
456 | |
|
|
457 | op->owner = NULL; |
|
|
458 | op->ownercount = 0; |
|
|
459 | return NULL; |
|
|
460 | } |
|
|
461 | |
|
|
462 | void |
|
|
463 | clear_owner (object *op) |
|
|
464 | { |
|
|
465 | if (!op) |
|
|
466 | return; |
|
|
467 | |
|
|
468 | if (op->owner && op->ownercount == op->owner->count) |
|
|
469 | op->owner->refcount--; |
|
|
470 | |
|
|
471 | op->owner = NULL; |
|
|
472 | op->ownercount = 0; |
|
|
473 | } |
538 | } |
474 | |
539 | |
475 | /* |
540 | /* |
476 | * Sets the owner and sets the skill and exp pointers to owner's current |
541 | * Sets the owner and sets the skill and exp pointers to owner's current |
477 | * skill and experience objects. |
542 | * skill and experience objects. |
478 | */ |
543 | */ |
479 | void |
544 | void |
480 | set_owner (object *op, object *owner) |
545 | object::set_owner (object *owner) |
481 | { |
546 | { |
482 | if (owner == NULL || op == NULL) |
547 | if (!owner) |
483 | return; |
548 | return; |
484 | |
549 | |
485 | /* next line added to allow objects which own objects */ |
550 | /* next line added to allow objects which own objects */ |
486 | /* Add a check for ownercounts in here, as I got into an endless loop |
551 | /* Add a check for ownercounts in here, as I got into an endless loop |
487 | * with the fireball owning a poison cloud which then owned the |
552 | * with the fireball owning a poison cloud which then owned the |
488 | * fireball. I believe that was caused by one of the objects getting |
553 | * fireball. I believe that was caused by one of the objects getting |
489 | * freed and then another object replacing it. Since the ownercounts |
554 | * freed and then another object replacing it. Since the ownercounts |
490 | * didn't match, this check is valid and I believe that cause is valid. |
555 | * didn't match, this check is valid and I believe that cause is valid. |
491 | */ |
556 | */ |
492 | while (owner->owner && owner != owner->owner && owner->ownercount == owner->owner->count) |
557 | while (owner->owner) |
493 | owner = owner->owner; |
558 | owner = owner->owner; |
494 | |
559 | |
495 | /* IF the owner still has an owner, we did not resolve to a final owner. |
|
|
496 | * so lets not add to that. |
|
|
497 | */ |
|
|
498 | if (owner->owner) |
|
|
499 | return; |
|
|
500 | |
|
|
501 | op->owner = owner; |
560 | this->owner = owner; |
502 | |
|
|
503 | op->ownercount = owner->count; |
|
|
504 | owner->refcount++; |
|
|
505 | } |
|
|
506 | |
|
|
507 | /* Set the owner to clone's current owner and set the skill and experience |
|
|
508 | * objects to clone's objects (typically those objects that where the owner's |
|
|
509 | * current skill and experience objects at the time when clone's owner was |
|
|
510 | * set - not the owner's current skill and experience objects). |
|
|
511 | * |
|
|
512 | * Use this function if player created an object (e.g. fire bullet, swarm |
|
|
513 | * spell), and this object creates further objects whose kills should be |
|
|
514 | * accounted for the player's original skill, even if player has changed |
|
|
515 | * skills meanwhile. |
|
|
516 | */ |
|
|
517 | void |
|
|
518 | copy_owner (object *op, object *clone) |
|
|
519 | { |
|
|
520 | object *owner = get_owner (clone); |
|
|
521 | |
|
|
522 | if (owner == NULL) |
|
|
523 | { |
|
|
524 | /* players don't have owners - they own themselves. Update |
|
|
525 | * as appropriate. |
|
|
526 | */ |
|
|
527 | if (clone->type == PLAYER) |
|
|
528 | owner = clone; |
|
|
529 | else |
|
|
530 | return; |
|
|
531 | } |
|
|
532 | |
|
|
533 | set_owner (op, owner); |
|
|
534 | } |
561 | } |
535 | |
562 | |
536 | /* Zero the key_values on op, decrementing the shared-string |
563 | /* Zero the key_values on op, decrementing the shared-string |
537 | * refcounts and freeing the links. |
564 | * refcounts and freeing the links. |
538 | */ |
565 | */ |
… | |
… | |
554 | { |
581 | { |
555 | attachable_base::clear (); |
582 | attachable_base::clear (); |
556 | |
583 | |
557 | free_key_values (this); |
584 | free_key_values (this); |
558 | |
585 | |
559 | clear_owner (this); |
586 | owner = 0; |
560 | |
|
|
561 | name = 0; |
587 | name = 0; |
562 | name_pl = 0; |
588 | name_pl = 0; |
563 | title = 0; |
589 | title = 0; |
564 | race = 0; |
590 | race = 0; |
565 | slaying = 0; |
591 | slaying = 0; |
566 | skill = 0; |
592 | skill = 0; |
567 | msg = 0; |
593 | msg = 0; |
568 | lore = 0; |
594 | lore = 0; |
569 | custom_name = 0; |
595 | custom_name = 0; |
570 | materialname = 0; |
596 | materialname = 0; |
|
|
597 | contr = 0; |
|
|
598 | below = 0; |
|
|
599 | above = 0; |
|
|
600 | inv = 0; |
|
|
601 | container = 0; |
|
|
602 | env = 0; |
|
|
603 | more = 0; |
|
|
604 | head = 0; |
|
|
605 | map = 0; |
|
|
606 | active_next = 0; |
|
|
607 | active_prev = 0; |
571 | |
608 | |
572 | memset (static_cast < object_pod * >(this), 0, sizeof (object_pod)); |
609 | memset (static_cast<object_pod *>(this), 0, sizeof (object_pod)); |
573 | |
610 | |
574 | SET_FLAG (this, FLAG_REMOVED); |
611 | SET_FLAG (this, FLAG_REMOVED); |
|
|
612 | |
|
|
613 | /* What is not cleared is next, prev, and count */ |
|
|
614 | |
|
|
615 | expmul = 1.0; |
|
|
616 | face = blank_face; |
|
|
617 | attacked_by_count = -1; |
|
|
618 | |
|
|
619 | if (settings.casting_time) |
|
|
620 | casting_time = -1; |
575 | } |
621 | } |
576 | |
622 | |
577 | void object::clone (object *destination) |
623 | void object::clone (object *destination) |
578 | { |
624 | { |
579 | *(object_copy *) destination = *this; |
625 | *(object_copy *)destination = *this; |
580 | *(object_pod *) destination = *this; |
626 | *(object_pod *)destination = *this; |
581 | |
627 | |
582 | if (self || cb) |
628 | if (self || cb) |
583 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); |
629 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); |
584 | } |
|
|
585 | |
|
|
586 | /* |
|
|
587 | * clear_object() frees everything allocated by an object, and also |
|
|
588 | * clears all variables and flags to default settings. |
|
|
589 | */ |
|
|
590 | |
|
|
591 | void |
|
|
592 | clear_object (object *op) |
|
|
593 | { |
|
|
594 | op->clear (); |
|
|
595 | |
|
|
596 | op->contr = NULL; |
|
|
597 | op->below = NULL; |
|
|
598 | op->above = NULL; |
|
|
599 | op->inv = NULL; |
|
|
600 | op->container = NULL; |
|
|
601 | op->env = NULL; |
|
|
602 | op->more = NULL; |
|
|
603 | op->head = NULL; |
|
|
604 | op->map = NULL; |
|
|
605 | op->refcount = 0; |
|
|
606 | op->active_next = NULL; |
|
|
607 | op->active_prev = NULL; |
|
|
608 | /* What is not cleared is next, prev, and count */ |
|
|
609 | |
|
|
610 | op->expmul = 1.0; |
|
|
611 | op->face = blank_face; |
|
|
612 | op->attacked_by_count = -1; |
|
|
613 | |
|
|
614 | if (settings.casting_time) |
|
|
615 | op->casting_time = -1; |
|
|
616 | } |
630 | } |
617 | |
631 | |
618 | /* |
632 | /* |
619 | * copy object first frees everything allocated by the second object, |
633 | * copy object first frees everything allocated by the second object, |
620 | * and then copies the contends of the first object into the second |
634 | * and then copies the contends of the first object into the second |
621 | * object, allocating what needs to be allocated. Basically, any |
635 | * object, allocating what needs to be allocated. Basically, any |
622 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
636 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
623 | * if the first object is freed, the pointers in the new object |
637 | * if the first object is freed, the pointers in the new object |
624 | * will point at garbage. |
638 | * will point at garbage. |
625 | */ |
639 | */ |
626 | |
|
|
627 | void |
640 | void |
628 | copy_object (object *op2, object *op) |
641 | copy_object (object *op2, object *op) |
629 | { |
642 | { |
630 | bool is_freed = QUERY_FLAG (op, FLAG_FREED); |
643 | bool is_freed = QUERY_FLAG (op, FLAG_FREED); |
631 | bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); |
644 | bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); |
… | |
… | |
691 | /* |
704 | /* |
692 | * Updates the speed of an object. If the speed changes from 0 to another |
705 | * Updates the speed of an object. If the speed changes from 0 to another |
693 | * value, or vice versa, then add/remove the object from the active list. |
706 | * value, or vice versa, then add/remove the object from the active list. |
694 | * This function needs to be called whenever the speed of an object changes. |
707 | * This function needs to be called whenever the speed of an object changes. |
695 | */ |
708 | */ |
696 | |
|
|
697 | void |
709 | void |
698 | update_ob_speed (object *op) |
710 | update_ob_speed (object *op) |
699 | { |
711 | { |
700 | extern int arch_init; |
712 | extern int arch_init; |
701 | |
713 | |
… | |
… | |
710 | abort (); |
722 | abort (); |
711 | #else |
723 | #else |
712 | op->speed = 0; |
724 | op->speed = 0; |
713 | #endif |
725 | #endif |
714 | } |
726 | } |
|
|
727 | |
715 | if (arch_init) |
728 | if (arch_init) |
716 | { |
|
|
717 | return; |
729 | return; |
718 | } |
730 | |
719 | if (FABS (op->speed) > MIN_ACTIVE_SPEED) |
731 | if (FABS (op->speed) > MIN_ACTIVE_SPEED) |
720 | { |
732 | { |
721 | /* If already on active list, don't do anything */ |
733 | /* If already on active list, don't do anything */ |
722 | if (op->active_next || op->active_prev || op == active_objects) |
734 | if (op->active_next || op->active_prev || op == active_objects) |
723 | return; |
735 | return; |
724 | |
736 | |
725 | /* process_events() expects us to insert the object at the beginning |
737 | /* process_events() expects us to insert the object at the beginning |
726 | * of the list. */ |
738 | * of the list. */ |
727 | op->active_next = active_objects; |
739 | op->active_next = active_objects; |
|
|
740 | |
728 | if (op->active_next != NULL) |
741 | if (op->active_next != NULL) |
729 | op->active_next->active_prev = op; |
742 | op->active_next->active_prev = op; |
|
|
743 | |
730 | active_objects = op; |
744 | active_objects = op; |
731 | } |
745 | } |
732 | else |
746 | else |
733 | { |
747 | { |
734 | /* If not on the active list, nothing needs to be done */ |
748 | /* If not on the active list, nothing needs to be done */ |
… | |
… | |
736 | return; |
750 | return; |
737 | |
751 | |
738 | if (op->active_prev == NULL) |
752 | if (op->active_prev == NULL) |
739 | { |
753 | { |
740 | active_objects = op->active_next; |
754 | active_objects = op->active_next; |
|
|
755 | |
741 | if (op->active_next != NULL) |
756 | if (op->active_next != NULL) |
742 | op->active_next->active_prev = NULL; |
757 | op->active_next->active_prev = NULL; |
743 | } |
758 | } |
744 | else |
759 | else |
745 | { |
760 | { |
746 | op->active_prev->active_next = op->active_next; |
761 | op->active_prev->active_next = op->active_next; |
|
|
762 | |
747 | if (op->active_next) |
763 | if (op->active_next) |
748 | op->active_next->active_prev = op->active_prev; |
764 | op->active_next->active_prev = op->active_prev; |
749 | } |
765 | } |
|
|
766 | |
750 | op->active_next = NULL; |
767 | op->active_next = NULL; |
751 | op->active_prev = NULL; |
768 | op->active_prev = NULL; |
752 | } |
769 | } |
753 | } |
770 | } |
754 | |
771 | |
… | |
… | |
886 | * that is being removed. |
903 | * that is being removed. |
887 | */ |
904 | */ |
888 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
905 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
889 | update_now = 1; |
906 | update_now = 1; |
890 | else if (action == UP_OBJ_FACE) |
907 | else if (action == UP_OBJ_FACE) |
891 | /* Nothing to do for that case */; |
908 | /* Nothing to do for that case */ ; |
892 | else |
909 | else |
893 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
910 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
894 | |
911 | |
895 | if (update_now) |
912 | if (update_now) |
896 | { |
913 | { |
… | |
… | |
901 | if (op->more != NULL) |
918 | if (op->more != NULL) |
902 | update_object (op->more, action); |
919 | update_object (op->more, action); |
903 | } |
920 | } |
904 | |
921 | |
905 | static unordered_vector<object *> mortals; |
922 | static unordered_vector<object *> mortals; |
906 | static std::vector<object *> freed; |
|
|
907 | |
923 | |
908 | void object::free_mortals () |
924 | void object::free_mortals () |
909 | { |
925 | { |
910 | for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end (); ) |
926 | for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();) |
911 | if (!(*i)->refcount) |
927 | if ((*i)->refcnt) |
|
|
928 | ++i; // further delay freeing |
|
|
929 | else |
912 | { |
930 | { |
913 | freed.push_back (*i); |
931 | delete *i; |
914 | mortals.erase (i); |
932 | mortals.erase (i); |
915 | } |
933 | } |
916 | else |
934 | |
917 | ++i; |
935 | static int lastmortals = 0;//D |
|
|
936 | |
|
|
937 | if (mortals.size() != lastmortals)//D |
|
|
938 | { |
|
|
939 | lastmortals = mortals.size ();//D |
|
|
940 | LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D |
|
|
941 | } |
918 | } |
942 | } |
919 | |
943 | |
920 | object::object () |
944 | object::object () |
921 | { |
945 | { |
922 | SET_FLAG (this, FLAG_REMOVED); |
946 | SET_FLAG (this, FLAG_REMOVED); |
… | |
… | |
932 | } |
956 | } |
933 | |
957 | |
934 | void object::link () |
958 | void object::link () |
935 | { |
959 | { |
936 | count = ++ob_count; |
960 | count = ++ob_count; |
|
|
961 | uuid = gen_uuid (); |
937 | |
962 | |
938 | prev = 0; |
963 | prev = 0; |
939 | next = objects; |
964 | next = objects; |
940 | |
965 | |
941 | if (objects) |
966 | if (objects) |
… | |
… | |
944 | objects = this; |
969 | objects = this; |
945 | } |
970 | } |
946 | |
971 | |
947 | void object::unlink () |
972 | void object::unlink () |
948 | { |
973 | { |
949 | count = 0; |
974 | //count = 0;//D |
950 | |
975 | if (!prev && !next) return;//D |
951 | /* Remove this object from the list of used objects */ |
|
|
952 | if (prev) |
|
|
953 | { |
|
|
954 | prev->next = next; |
|
|
955 | prev = 0; |
|
|
956 | } |
|
|
957 | |
|
|
958 | if (next) |
|
|
959 | { |
|
|
960 | next->prev = prev; |
|
|
961 | next = 0; |
|
|
962 | } |
|
|
963 | |
976 | |
964 | if (this == objects) |
977 | if (this == objects) |
965 | objects = next; |
978 | objects = next; |
|
|
979 | |
|
|
980 | /* Remove this object from the list of used objects */ |
|
|
981 | if (prev) prev->next = next; |
|
|
982 | if (next) next->prev = prev; |
|
|
983 | |
|
|
984 | prev = 0; |
|
|
985 | next = 0; |
966 | } |
986 | } |
967 | |
987 | |
968 | object *object::create () |
988 | object *object::create () |
969 | { |
989 | { |
970 | object *op; |
|
|
971 | |
|
|
972 | if (freed.empty ()) |
|
|
973 | op = new object; |
990 | object *op = new object; |
974 | else |
|
|
975 | { |
|
|
976 | // highly annoying, but the only way to get it stable right now |
|
|
977 | op = freed.back (); freed.pop_back (); |
|
|
978 | op->~object (); |
|
|
979 | new ((void *)op) object; |
|
|
980 | } |
|
|
981 | |
|
|
982 | op->link (); |
991 | op->link (); |
983 | return op; |
992 | return op; |
984 | } |
993 | } |
985 | |
994 | |
986 | /* |
995 | /* |
… | |
… | |
993 | * If free_inventory is set, free inventory as well. Else drop items in |
1002 | * If free_inventory is set, free inventory as well. Else drop items in |
994 | * inventory to the ground. |
1003 | * inventory to the ground. |
995 | */ |
1004 | */ |
996 | void object::free (bool free_inventory) |
1005 | void object::free (bool free_inventory) |
997 | { |
1006 | { |
|
|
1007 | if (QUERY_FLAG (this, FLAG_FREED)) |
|
|
1008 | return; |
|
|
1009 | |
|
|
1010 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
|
|
1011 | remove_friendly_object (this); |
|
|
1012 | |
998 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
1013 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
999 | { |
1014 | remove_ob (this); |
1000 | LOG (llevDebug, "Free object called with non removed object\n"); |
|
|
1001 | dump_object (this); |
|
|
1002 | #ifdef MANY_CORES |
|
|
1003 | abort (); |
|
|
1004 | #endif |
|
|
1005 | } |
|
|
1006 | |
1015 | |
1007 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
|
|
1008 | { |
|
|
1009 | LOG (llevMonster, "Warning: tried to free friendly object.\n"); |
|
|
1010 | remove_friendly_object (this); |
|
|
1011 | } |
|
|
1012 | |
|
|
1013 | if (QUERY_FLAG (this, FLAG_FREED)) |
1016 | SET_FLAG (this, FLAG_FREED); |
1014 | { |
|
|
1015 | dump_object (this); |
|
|
1016 | LOG (llevError, "Trying to free freed object.\n%s\n", errmsg); |
|
|
1017 | return; |
|
|
1018 | } |
|
|
1019 | |
1017 | |
1020 | if (more) |
1018 | if (more) |
1021 | { |
1019 | { |
1022 | more->free (free_inventory); |
1020 | more->free (free_inventory); |
1023 | more = 0; |
1021 | more = 0; |
… | |
… | |
1027 | { |
1025 | { |
1028 | /* Only if the space blocks everything do we not process - |
1026 | /* Only if the space blocks everything do we not process - |
1029 | * if some form of movement is allowed, let objects |
1027 | * if some form of movement is allowed, let objects |
1030 | * drop on that space. |
1028 | * drop on that space. |
1031 | */ |
1029 | */ |
1032 | if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)) |
1030 | if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
1033 | { |
1031 | { |
1034 | object * |
1032 | object *op = inv; |
1035 | op = inv; |
|
|
1036 | |
1033 | |
1037 | while (op) |
1034 | while (op) |
1038 | { |
1035 | { |
1039 | object * |
|
|
1040 | tmp = op->below; |
1036 | object *tmp = op->below; |
1041 | |
|
|
1042 | remove_ob (op); |
|
|
1043 | op->free (free_inventory); |
1037 | op->free (free_inventory); |
1044 | op = tmp; |
1038 | op = tmp; |
1045 | } |
1039 | } |
1046 | } |
1040 | } |
1047 | else |
1041 | else |
1048 | { /* Put objects in inventory onto this space */ |
1042 | { /* Put objects in inventory onto this space */ |
1049 | object * |
1043 | object *op = inv; |
1050 | op = inv; |
|
|
1051 | |
1044 | |
1052 | while (op) |
1045 | while (op) |
1053 | { |
1046 | { |
1054 | object * |
|
|
1055 | tmp = op->below; |
1047 | object *tmp = op->below; |
1056 | |
1048 | |
1057 | remove_ob (op); |
1049 | remove_ob (op); |
1058 | |
1050 | |
1059 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
1051 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
1060 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
1052 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
… | |
… | |
1069 | op = tmp; |
1061 | op = tmp; |
1070 | } |
1062 | } |
1071 | } |
1063 | } |
1072 | } |
1064 | } |
1073 | |
1065 | |
1074 | clear_owner (this); |
1066 | owner = 0; |
1075 | |
1067 | |
1076 | /* Remove object from the active list */ |
1068 | /* Remove object from the active list */ |
1077 | speed = 0; |
1069 | speed = 0; |
1078 | update_ob_speed (this); |
1070 | update_ob_speed (this); |
1079 | |
1071 | |
1080 | unlink (); |
1072 | unlink (); |
1081 | |
|
|
1082 | SET_FLAG (this, FLAG_FREED); |
|
|
1083 | |
1073 | |
1084 | mortals.push_back (this); |
1074 | mortals.push_back (this); |
1085 | } |
1075 | } |
1086 | |
1076 | |
1087 | /* |
1077 | /* |
… | |
… | |
1113 | */ |
1103 | */ |
1114 | |
1104 | |
1115 | void |
1105 | void |
1116 | remove_ob (object *op) |
1106 | remove_ob (object *op) |
1117 | { |
1107 | { |
1118 | object *tmp, *last = NULL; |
|
|
1119 | object *otmp; |
1108 | object * |
|
|
1109 | tmp, * |
|
|
1110 | last = NULL; |
|
|
1111 | object * |
|
|
1112 | otmp; |
1120 | |
1113 | |
1121 | tag_t tag; |
1114 | tag_t |
|
|
1115 | tag; |
|
|
1116 | int |
1122 | int check_walk_off; |
1117 | check_walk_off; |
1123 | mapstruct *m; |
1118 | mapstruct * |
|
|
1119 | m; |
1124 | |
1120 | |
1125 | sint16 x, y; |
1121 | sint16 |
|
|
1122 | x, |
|
|
1123 | y; |
1126 | |
1124 | |
1127 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1125 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1128 | { |
1126 | return; |
1129 | dump_object (op); |
|
|
1130 | LOG (llevError, "Trying to remove removed object.\n%s\n", errmsg); |
|
|
1131 | |
1127 | |
1132 | /* Changed it to always dump core in this case. As has been learned |
1128 | SET_FLAG (op, FLAG_REMOVED); |
1133 | * in the past, trying to recover from errors almost always |
|
|
1134 | * make things worse, and this is a real error here - something |
|
|
1135 | * that should not happen. |
|
|
1136 | * Yes, if this was a mission critical app, trying to do something |
|
|
1137 | * to recover may make sense, but that is because failure of the app |
|
|
1138 | * may have other disastrous problems. Cf runs out of a script |
|
|
1139 | * so is easily enough restarted without any real problems. |
|
|
1140 | * MSW 2001-07-01 |
|
|
1141 | */ |
|
|
1142 | abort (); |
|
|
1143 | } |
|
|
1144 | |
1129 | |
1145 | if (op->more != NULL) |
1130 | if (op->more != NULL) |
1146 | remove_ob (op->more); |
1131 | remove_ob (op->more); |
1147 | |
|
|
1148 | SET_FLAG (op, FLAG_REMOVED); |
|
|
1149 | |
1132 | |
1150 | /* |
1133 | /* |
1151 | * In this case, the object to be removed is in someones |
1134 | * In this case, the object to be removed is in someones |
1152 | * inventory. |
1135 | * inventory. |
1153 | */ |
1136 | */ |
… | |
… | |
1179 | */ |
1162 | */ |
1180 | op->x = op->env->x, op->y = op->env->y; |
1163 | op->x = op->env->x, op->y = op->env->y; |
1181 | op->map = op->env->map; |
1164 | op->map = op->env->map; |
1182 | op->above = NULL, op->below = NULL; |
1165 | op->above = NULL, op->below = NULL; |
1183 | op->env = NULL; |
1166 | op->env = NULL; |
1184 | return; |
1167 | } |
|
|
1168 | else if (op->map) |
1185 | } |
1169 | { |
1186 | |
|
|
1187 | /* If we get here, we are removing it from a map */ |
|
|
1188 | if (op->map == NULL) |
|
|
1189 | return; |
|
|
1190 | |
|
|
1191 | x = op->x; |
1170 | x = op->x; |
1192 | y = op->y; |
1171 | y = op->y; |
1193 | m = get_map_from_coord (op->map, &x, &y); |
1172 | m = get_map_from_coord (op->map, &x, &y); |
1194 | |
1173 | |
1195 | if (!m) |
1174 | if (!m) |
1196 | { |
1175 | { |
1197 | LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n", |
1176 | LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n", |
1198 | op->map->path, op->x, op->y); |
1177 | op->map->path, op->x, op->y); |
1199 | /* in old days, we used to set x and y to 0 and continue. |
1178 | /* in old days, we used to set x and y to 0 and continue. |
1200 | * it seems if we get into this case, something is probablye |
1179 | * it seems if we get into this case, something is probablye |
1201 | * screwed up and should be fixed. |
1180 | * screwed up and should be fixed. |
|
|
1181 | */ |
|
|
1182 | abort (); |
|
|
1183 | } |
|
|
1184 | |
|
|
1185 | if (op->map != m) |
|
|
1186 | LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n", |
|
|
1187 | op->map->path, m->path, op->x, op->y, x, y); |
|
|
1188 | |
|
|
1189 | /* Re did the following section of code - it looks like it had |
|
|
1190 | * lots of logic for things we no longer care about |
1202 | */ |
1191 | */ |
1203 | abort (); |
|
|
1204 | } |
|
|
1205 | if (op->map != m) |
|
|
1206 | { |
|
|
1207 | LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n", |
|
|
1208 | op->map->path, m->path, op->x, op->y, x, y); |
|
|
1209 | } |
|
|
1210 | |
1192 | |
1211 | /* Re did the following section of code - it looks like it had |
|
|
1212 | * lots of logic for things we no longer care about |
|
|
1213 | */ |
|
|
1214 | |
|
|
1215 | /* link the object above us */ |
1193 | /* link the object above us */ |
1216 | if (op->above) |
1194 | if (op->above) |
1217 | op->above->below = op->below; |
1195 | op->above->below = op->below; |
1218 | else |
1196 | else |
1219 | SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ |
1197 | SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ |
1220 | |
1198 | |
1221 | /* Relink the object below us, if there is one */ |
1199 | /* Relink the object below us, if there is one */ |
1222 | if (op->below) |
1200 | if (op->below) |
1223 | op->below->above = op->above; |
1201 | op->below->above = op->above; |
1224 | else |
1202 | else |
1225 | { |
1203 | { |
1226 | /* Nothing below, which means we need to relink map object for this space |
1204 | /* Nothing below, which means we need to relink map object for this space |
1227 | * use translated coordinates in case some oddness with map tiling is |
1205 | * use translated coordinates in case some oddness with map tiling is |
1228 | * evident |
1206 | * evident |
1229 | */ |
|
|
1230 | if (GET_MAP_OB (m, x, y) != op) |
|
|
1231 | { |
|
|
1232 | dump_object (op); |
|
|
1233 | LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", |
|
|
1234 | errmsg); |
|
|
1235 | dump_object (GET_MAP_OB (m, x, y)); |
|
|
1236 | LOG (llevError, "%s\n", errmsg); |
|
|
1237 | } |
|
|
1238 | |
|
|
1239 | SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ |
|
|
1240 | } |
|
|
1241 | |
|
|
1242 | op->above = NULL; |
|
|
1243 | op->below = NULL; |
|
|
1244 | |
|
|
1245 | if (op->map->in_memory == MAP_SAVING) |
|
|
1246 | return; |
|
|
1247 | |
|
|
1248 | tag = op->count; |
|
|
1249 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
|
|
1250 | |
|
|
1251 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
|
|
1252 | { |
|
|
1253 | /* No point updating the players look faces if he is the object |
|
|
1254 | * being removed. |
|
|
1255 | */ |
|
|
1256 | |
|
|
1257 | if (tmp->type == PLAYER && tmp != op) |
|
|
1258 | { |
|
|
1259 | /* If a container that the player is currently using somehow gets |
|
|
1260 | * removed (most likely destroyed), update the player view |
|
|
1261 | * appropriately. |
|
|
1262 | */ |
1207 | */ |
1263 | if (tmp->container == op) |
1208 | if (GET_MAP_OB (m, x, y) != op) |
1264 | { |
1209 | { |
1265 | CLEAR_FLAG (op, FLAG_APPLIED); |
1210 | dump_object (op); |
1266 | tmp->container = NULL; |
1211 | LOG (llevError, |
|
|
1212 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg); |
|
|
1213 | dump_object (GET_MAP_OB (m, x, y)); |
|
|
1214 | LOG (llevError, "%s\n", errmsg); |
1267 | } |
1215 | } |
1268 | |
1216 | |
1269 | tmp->contr->socket.update_look = 1; |
1217 | SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ |
1270 | } |
|
|
1271 | /* See if player moving off should effect something */ |
|
|
1272 | if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
|
|
1273 | { |
1218 | } |
1274 | move_apply (tmp, op, NULL); |
|
|
1275 | |
1219 | |
1276 | if (was_destroyed (op, tag)) |
1220 | op->above = 0; |
|
|
1221 | op->below = 0; |
|
|
1222 | |
|
|
1223 | if (op->map->in_memory == MAP_SAVING) |
|
|
1224 | return; |
|
|
1225 | |
|
|
1226 | tag = op->count; |
|
|
1227 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
|
|
1228 | |
|
|
1229 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
|
|
1230 | { |
|
|
1231 | /* No point updating the players look faces if he is the object |
|
|
1232 | * being removed. |
|
|
1233 | */ |
|
|
1234 | |
|
|
1235 | if (tmp->type == PLAYER && tmp != op) |
1277 | { |
1236 | { |
1278 | LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); |
1237 | /* If a container that the player is currently using somehow gets |
|
|
1238 | * removed (most likely destroyed), update the player view |
|
|
1239 | * appropriately. |
|
|
1240 | */ |
|
|
1241 | if (tmp->container == op) |
|
|
1242 | { |
|
|
1243 | CLEAR_FLAG (op, FLAG_APPLIED); |
|
|
1244 | tmp->container = NULL; |
|
|
1245 | } |
|
|
1246 | |
|
|
1247 | tmp->contr->socket.update_look = 1; |
1279 | } |
1248 | } |
|
|
1249 | |
|
|
1250 | /* See if player moving off should effect something */ |
|
|
1251 | if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
|
|
1252 | { |
|
|
1253 | move_apply (tmp, op, NULL); |
|
|
1254 | |
|
|
1255 | if (was_destroyed (op, tag)) |
|
|
1256 | { |
|
|
1257 | LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); |
|
|
1258 | } |
1280 | } |
1259 | } |
1281 | |
1260 | |
1282 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1261 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1283 | |
1262 | |
1284 | if (tmp->above == tmp) |
1263 | if (tmp->above == tmp) |
1285 | tmp->above = NULL; |
1264 | tmp->above = NULL; |
1286 | |
1265 | |
1287 | last = tmp; |
1266 | last = tmp; |
1288 | } |
1267 | } |
1289 | |
1268 | |
1290 | /* last == NULL of there are no objects on this space */ |
1269 | /* last == NULL of there are no objects on this space */ |
1291 | if (last == NULL) |
1270 | if (last == NULL) |
1292 | { |
1271 | { |
1293 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
1272 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
1294 | * we could preserve the flags (GET_MAP_FLAGS), but update_position figures |
1273 | * we could preserve the flags (GET_MAP_FLAGS), but update_position figures |
1295 | * those out anyways, and if there are any flags set right now, they won't |
1274 | * those out anyways, and if there are any flags set right now, they won't |
1296 | * be correct anyways. |
1275 | * be correct anyways. |
1297 | */ |
1276 | */ |
1298 | SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE); |
1277 | SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE); |
1299 | update_position (op->map, op->x, op->y); |
1278 | update_position (op->map, op->x, op->y); |
1300 | } |
1279 | } |
1301 | else |
1280 | else |
1302 | update_object (last, UP_OBJ_REMOVE); |
1281 | update_object (last, UP_OBJ_REMOVE); |
1303 | |
1282 | |
1304 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) |
1283 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) |
1305 | update_all_los (op->map, op->x, op->y); |
1284 | update_all_los (op->map, op->x, op->y); |
|
|
1285 | } |
1306 | } |
1286 | } |
1307 | |
1287 | |
1308 | /* |
1288 | /* |
1309 | * merge_ob(op,top): |
1289 | * merge_ob(op,top): |
1310 | * |
1290 | * |
1311 | * This function goes through all objects below and including top, and |
1291 | * This function goes through all objects below and including top, and |
1312 | * merges op to the first matching object. |
1292 | * merges op to the first matching object. |
1313 | * If top is NULL, it is calculated. |
1293 | * If top is NULL, it is calculated. |
1314 | * Returns pointer to object if it succeded in the merge, otherwise NULL |
1294 | * Returns pointer to object if it succeded in the merge, otherwise NULL |
1315 | */ |
1295 | */ |
1316 | |
|
|
1317 | object * |
1296 | object * |
1318 | merge_ob (object *op, object *top) |
1297 | merge_ob (object *op, object *top) |
1319 | { |
1298 | { |
1320 | if (!op->nrof) |
1299 | if (!op->nrof) |
1321 | return 0; |
1300 | return 0; |
|
|
1301 | |
1322 | if (top == NULL) |
1302 | if (top == NULL) |
1323 | for (top = op; top != NULL && top->above != NULL; top = top->above); |
1303 | for (top = op; top != NULL && top->above != NULL; top = top->above); |
|
|
1304 | |
1324 | for (; top != NULL; top = top->below) |
1305 | for (; top != NULL; top = top->below) |
1325 | { |
1306 | { |
1326 | if (top == op) |
1307 | if (top == op) |
1327 | continue; |
1308 | continue; |
1328 | if (CAN_MERGE (op, top)) |
1309 | if (CAN_MERGE (op, top)) |
… | |
… | |
1334 | remove_ob (op); |
1315 | remove_ob (op); |
1335 | free_object (op); |
1316 | free_object (op); |
1336 | return top; |
1317 | return top; |
1337 | } |
1318 | } |
1338 | } |
1319 | } |
|
|
1320 | |
1339 | return NULL; |
1321 | return NULL; |
1340 | } |
1322 | } |
1341 | |
1323 | |
1342 | /* |
1324 | /* |
1343 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1325 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1344 | * job preparing multi-part monsters |
1326 | * job preparing multi-part monsters |
1345 | */ |
1327 | */ |
1346 | object * |
1328 | object * |
1347 | insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) |
1329 | insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) |
1348 | { |
1330 | { |
1349 | object * |
1331 | object *tmp; |
1350 | tmp; |
|
|
1351 | |
1332 | |
1352 | if (op->head) |
1333 | if (op->head) |
1353 | op = op->head; |
1334 | op = op->head; |
|
|
1335 | |
1354 | for (tmp = op; tmp; tmp = tmp->more) |
1336 | for (tmp = op; tmp; tmp = tmp->more) |
1355 | { |
1337 | { |
1356 | tmp->x = x + tmp->arch->clone.x; |
1338 | tmp->x = x + tmp->arch->clone.x; |
1357 | tmp->y = y + tmp->arch->clone.y; |
1339 | tmp->y = y + tmp->arch->clone.y; |
1358 | } |
1340 | } |
|
|
1341 | |
1359 | return insert_ob_in_map (op, m, originator, flag); |
1342 | return insert_ob_in_map (op, m, originator, flag); |
1360 | } |
1343 | } |
1361 | |
1344 | |
1362 | /* |
1345 | /* |
1363 | * insert_ob_in_map (op, map, originator, flag): |
1346 | * insert_ob_in_map (op, map, originator, flag): |
… | |
… | |
1654 | * op is the object to insert it under: supplies x and the map. |
1637 | * op is the object to insert it under: supplies x and the map. |
1655 | */ |
1638 | */ |
1656 | void |
1639 | void |
1657 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1640 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1658 | { |
1641 | { |
1659 | object *tmp; |
1642 | object * |
|
|
1643 | tmp; |
1660 | object *tmp1; |
1644 | object * |
|
|
1645 | tmp1; |
1661 | |
1646 | |
1662 | /* first search for itself and remove any old instances */ |
1647 | /* first search for itself and remove any old instances */ |
1663 | |
1648 | |
1664 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1649 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1665 | { |
1650 | { |
… | |
… | |
1696 | if (orig_ob->nrof < nr) |
1681 | if (orig_ob->nrof < nr) |
1697 | { |
1682 | { |
1698 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1683 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1699 | return NULL; |
1684 | return NULL; |
1700 | } |
1685 | } |
|
|
1686 | |
1701 | newob = object_create_clone (orig_ob); |
1687 | newob = object_create_clone (orig_ob); |
|
|
1688 | |
1702 | if ((orig_ob->nrof -= nr) < 1) |
1689 | if ((orig_ob->nrof -= nr) < 1) |
1703 | { |
1690 | { |
1704 | if (!is_removed) |
1691 | if (!is_removed) |
1705 | remove_ob (orig_ob); |
1692 | remove_ob (orig_ob); |
1706 | free_object2 (orig_ob, 1); |
1693 | free_object2 (orig_ob, 1); |
… | |
… | |
1714 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
1701 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
1715 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
1702 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
1716 | return NULL; |
1703 | return NULL; |
1717 | } |
1704 | } |
1718 | } |
1705 | } |
|
|
1706 | |
1719 | newob->nrof = nr; |
1707 | newob->nrof = nr; |
1720 | |
1708 | |
1721 | return newob; |
1709 | return newob; |
1722 | } |
1710 | } |
1723 | |
1711 | |
… | |
… | |
1730 | */ |
1718 | */ |
1731 | |
1719 | |
1732 | object * |
1720 | object * |
1733 | decrease_ob_nr (object *op, uint32 i) |
1721 | decrease_ob_nr (object *op, uint32 i) |
1734 | { |
1722 | { |
1735 | object * |
1723 | object *tmp; |
1736 | tmp; |
|
|
1737 | player * |
1724 | player *pl; |
1738 | pl; |
|
|
1739 | |
1725 | |
1740 | if (i == 0) /* objects with op->nrof require this check */ |
1726 | if (i == 0) /* objects with op->nrof require this check */ |
1741 | return op; |
1727 | return op; |
1742 | |
1728 | |
1743 | if (i > op->nrof) |
1729 | if (i > op->nrof) |
1744 | i = op->nrof; |
1730 | i = op->nrof; |
1745 | |
1731 | |
1746 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1732 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1747 | { |
|
|
1748 | op->nrof -= i; |
1733 | op->nrof -= i; |
1749 | } |
|
|
1750 | else if (op->env != NULL) |
1734 | else if (op->env != NULL) |
1751 | { |
1735 | { |
1752 | /* is this object in the players inventory, or sub container |
1736 | /* is this object in the players inventory, or sub container |
1753 | * therein? |
1737 | * therein? |
1754 | */ |
1738 | */ |
… | |
… | |
1789 | } |
1773 | } |
1790 | } |
1774 | } |
1791 | } |
1775 | } |
1792 | else |
1776 | else |
1793 | { |
1777 | { |
1794 | object * |
|
|
1795 | above = op->above; |
1778 | object *above = op->above; |
1796 | |
1779 | |
1797 | if (i < op->nrof) |
1780 | if (i < op->nrof) |
1798 | { |
|
|
1799 | op->nrof -= i; |
1781 | op->nrof -= i; |
1800 | } |
|
|
1801 | else |
1782 | else |
1802 | { |
1783 | { |
1803 | remove_ob (op); |
1784 | remove_ob (op); |
1804 | op->nrof = 0; |
1785 | op->nrof = 0; |
1805 | } |
1786 | } |
|
|
1787 | |
1806 | /* Since we just removed op, op->above is null */ |
1788 | /* Since we just removed op, op->above is null */ |
1807 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
1789 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
1808 | if (tmp->type == PLAYER) |
1790 | if (tmp->type == PLAYER) |
1809 | { |
1791 | { |
1810 | if (op->nrof) |
1792 | if (op->nrof) |
… | |
… | |
1813 | esrv_del_item (tmp->contr, op->count); |
1795 | esrv_del_item (tmp->contr, op->count); |
1814 | } |
1796 | } |
1815 | } |
1797 | } |
1816 | |
1798 | |
1817 | if (op->nrof) |
1799 | if (op->nrof) |
1818 | { |
|
|
1819 | return op; |
1800 | return op; |
1820 | } |
|
|
1821 | else |
1801 | else |
1822 | { |
1802 | { |
1823 | free_object (op); |
1803 | free_object (op); |
1824 | return NULL; |
1804 | return NULL; |
1825 | } |
1805 | } |
… | |
… | |
1834 | add_weight (object *op, signed long weight) |
1814 | add_weight (object *op, signed long weight) |
1835 | { |
1815 | { |
1836 | while (op != NULL) |
1816 | while (op != NULL) |
1837 | { |
1817 | { |
1838 | if (op->type == CONTAINER) |
1818 | if (op->type == CONTAINER) |
1839 | { |
|
|
1840 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
1819 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
1841 | } |
1820 | |
1842 | op->carrying += weight; |
1821 | op->carrying += weight; |
1843 | op = op->env; |
1822 | op = op->env; |
1844 | } |
1823 | } |
1845 | } |
1824 | } |
1846 | |
1825 | |
… | |
… | |
1869 | { |
1848 | { |
1870 | dump_object (op); |
1849 | dump_object (op); |
1871 | LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg); |
1850 | LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg); |
1872 | return op; |
1851 | return op; |
1873 | } |
1852 | } |
|
|
1853 | |
1874 | if (where == NULL) |
1854 | if (where == NULL) |
1875 | { |
1855 | { |
1876 | dump_object (op); |
1856 | dump_object (op); |
1877 | LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg); |
1857 | LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg); |
1878 | return op; |
1858 | return op; |
1879 | } |
1859 | } |
|
|
1860 | |
1880 | if (where->head) |
1861 | if (where->head) |
1881 | { |
1862 | { |
1882 | LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n"); |
1863 | LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n"); |
1883 | where = where->head; |
1864 | where = where->head; |
1884 | } |
1865 | } |
|
|
1866 | |
1885 | if (op->more) |
1867 | if (op->more) |
1886 | { |
1868 | { |
1887 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1869 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1888 | return op; |
1870 | return op; |
1889 | } |
1871 | } |
|
|
1872 | |
1890 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1873 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1891 | CLEAR_FLAG (op, FLAG_REMOVED); |
1874 | CLEAR_FLAG (op, FLAG_REMOVED); |
1892 | if (op->nrof) |
1875 | if (op->nrof) |
1893 | { |
1876 | { |
1894 | for (tmp = where->inv; tmp != NULL; tmp = tmp->below) |
1877 | for (tmp = where->inv; tmp != NULL; tmp = tmp->below) |
… | |
… | |
1979 | */ |
1962 | */ |
1980 | |
1963 | |
1981 | int |
1964 | int |
1982 | check_move_on (object *op, object *originator) |
1965 | check_move_on (object *op, object *originator) |
1983 | { |
1966 | { |
1984 | object *tmp; |
1967 | object * |
1985 | tag_t tag; |
1968 | tmp; |
1986 | mapstruct *m = op->map; |
1969 | tag_t |
|
|
1970 | tag; |
|
|
1971 | mapstruct * |
|
|
1972 | m = op->map; |
|
|
1973 | int |
1987 | int x = op->x, y = op->y; |
1974 | x = op->x, y = op->y; |
1988 | |
1975 | |
1989 | MoveType move_on, move_slow, move_block; |
1976 | MoveType |
|
|
1977 | move_on, |
|
|
1978 | move_slow, |
|
|
1979 | move_block; |
1990 | |
1980 | |
1991 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1981 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1992 | return 0; |
1982 | return 0; |
1993 | |
1983 | |
1994 | tag = op->count; |
1984 | tag = op->count; |
… | |
… | |
2042 | { |
2032 | { |
2043 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
2033 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
2044 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
2034 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
2045 | { |
2035 | { |
2046 | |
2036 | |
|
|
2037 | float |
2047 | float diff = tmp->move_slow_penalty * FABS (op->speed); |
2038 | diff = tmp->move_slow_penalty * FABS (op->speed); |
2048 | |
2039 | |
2049 | if (op->type == PLAYER) |
2040 | if (op->type == PLAYER) |
2050 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
2041 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
2051 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
2042 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
2052 | diff /= 4.0; |
2043 | diff /= 4.0; |
… | |
… | |
2371 | find_dir (mapstruct *m, int x, int y, object *exclude) |
2362 | find_dir (mapstruct *m, int x, int y, object *exclude) |
2372 | { |
2363 | { |
2373 | int |
2364 | int |
2374 | i, |
2365 | i, |
2375 | max = SIZEOFFREE, mflags; |
2366 | max = SIZEOFFREE, mflags; |
2376 | sint16 |
2367 | |
2377 | nx, |
2368 | sint16 nx, ny; |
2378 | ny; |
|
|
2379 | object * |
2369 | object * |
2380 | tmp; |
2370 | tmp; |
2381 | mapstruct * |
2371 | mapstruct * |
2382 | mp; |
2372 | mp; |
2383 | MoveType |
2373 | |
2384 | blocked, |
2374 | MoveType blocked, move_type; |
2385 | move_type; |
|
|
2386 | |
2375 | |
2387 | if (exclude && exclude->head) |
2376 | if (exclude && exclude->head) |
2388 | { |
2377 | { |
2389 | exclude = exclude->head; |
2378 | exclude = exclude->head; |
2390 | move_type = exclude->move_type; |
2379 | move_type = exclude->move_type; |
… | |
… | |
2597 | |
2586 | |
2598 | |
2587 | |
2599 | int |
2588 | int |
2600 | can_see_monsterP (mapstruct *m, int x, int y, int dir) |
2589 | can_see_monsterP (mapstruct *m, int x, int y, int dir) |
2601 | { |
2590 | { |
2602 | sint16 |
2591 | sint16 dx, dy; |
2603 | dx, |
|
|
2604 | dy; |
|
|
2605 | int |
2592 | int |
2606 | mflags; |
2593 | mflags; |
2607 | |
2594 | |
2608 | if (dir < 0) |
2595 | if (dir < 0) |
2609 | return 0; /* exit condition: invalid direction */ |
2596 | return 0; /* exit condition: invalid direction */ |
… | |
… | |
2734 | |
2721 | |
2735 | if (tempfile == NULL) |
2722 | if (tempfile == NULL) |
2736 | { |
2723 | { |
2737 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2724 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2738 | return NULL; |
2725 | return NULL; |
2739 | }; |
2726 | } |
|
|
2727 | |
2740 | fprintf (tempfile, obstr); |
2728 | fprintf (tempfile, obstr); |
2741 | fclose (tempfile); |
2729 | fclose (tempfile); |
2742 | |
2730 | |
2743 | op = get_object (); |
2731 | op = get_object (); |
2744 | |
2732 | |
2745 | object_thawer |
2733 | object_thawer thawer (filename); |
2746 | thawer (filename); |
|
|
2747 | |
2734 | |
2748 | if (thawer) |
2735 | if (thawer) |
2749 | load_object (thawer, op, 0); |
2736 | load_object (thawer, op, 0); |
2750 | |
2737 | |
2751 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
2738 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
… | |
… | |
2802 | * The returned string is shared. |
2789 | * The returned string is shared. |
2803 | */ |
2790 | */ |
2804 | const char * |
2791 | const char * |
2805 | get_ob_key_value (const object *op, const char *const key) |
2792 | get_ob_key_value (const object *op, const char *const key) |
2806 | { |
2793 | { |
2807 | key_value * |
2794 | key_value *link; |
2808 | link; |
2795 | shstr_cmp canonical_key (key); |
2809 | const char * |
|
|
2810 | canonical_key; |
|
|
2811 | |
2796 | |
2812 | canonical_key = shstr::find (key); |
|
|
2813 | |
|
|
2814 | if (canonical_key == NULL) |
2797 | if (!canonical_key) |
2815 | { |
2798 | { |
2816 | /* 1. There being a field named key on any object |
2799 | /* 1. There being a field named key on any object |
2817 | * implies there'd be a shared string to find. |
2800 | * implies there'd be a shared string to find. |
2818 | * 2. Since there isn't, no object has this field. |
2801 | * 2. Since there isn't, no object has this field. |
2819 | * 3. Therefore, *this* object doesn't have this field. |
2802 | * 3. Therefore, *this* object doesn't have this field. |
2820 | */ |
2803 | */ |
2821 | return NULL; |
2804 | return 0; |
2822 | } |
2805 | } |
2823 | |
2806 | |
2824 | /* This is copied from get_ob_key_link() above - |
2807 | /* This is copied from get_ob_key_link() above - |
2825 | * only 4 lines, and saves the function call overhead. |
2808 | * only 4 lines, and saves the function call overhead. |
2826 | */ |
2809 | */ |
2827 | for (link = op->key_values; link != NULL; link = link->next) |
2810 | for (link = op->key_values; link; link = link->next) |
2828 | { |
|
|
2829 | if (link->key == canonical_key) |
2811 | if (link->key == canonical_key) |
2830 | { |
|
|
2831 | return link->value; |
2812 | return link->value; |
2832 | } |
2813 | |
2833 | } |
|
|
2834 | return NULL; |
2814 | return 0; |
2835 | } |
2815 | } |
2836 | |
2816 | |
2837 | |
2817 | |
2838 | /* |
2818 | /* |
2839 | * Updates the canonical_key in op to value. |
2819 | * Updates the canonical_key in op to value. |
… | |
… | |
2875 | if (last) |
2855 | if (last) |
2876 | last->next = field->next; |
2856 | last->next = field->next; |
2877 | else |
2857 | else |
2878 | op->key_values = field->next; |
2858 | op->key_values = field->next; |
2879 | |
2859 | |
2880 | delete |
|
|
2881 | field; |
2860 | delete field; |
2882 | } |
2861 | } |
2883 | } |
2862 | } |
2884 | return TRUE; |
2863 | return TRUE; |
2885 | } |
2864 | } |
2886 | /* IF we get here, key doesn't exist */ |
2865 | /* IF we get here, key doesn't exist */ |
… | |
… | |
2921 | * Returns TRUE on success. |
2900 | * Returns TRUE on success. |
2922 | */ |
2901 | */ |
2923 | int |
2902 | int |
2924 | set_ob_key_value (object *op, const char *key, const char *value, int add_key) |
2903 | set_ob_key_value (object *op, const char *key, const char *value, int add_key) |
2925 | { |
2904 | { |
2926 | shstr |
|
|
2927 | key_ (key); |
2905 | shstr key_ (key); |
2928 | |
2906 | |
2929 | return set_ob_key_value_s (op, key_, value, add_key); |
2907 | return set_ob_key_value_s (op, key_, value, add_key); |
2930 | } |
2908 | } |
|
|
2909 | |
|
|
2910 | object::depth_iterator::depth_iterator (object *container) |
|
|
2911 | : iterator_base (container) |
|
|
2912 | { |
|
|
2913 | while (item->inv) |
|
|
2914 | item = item->inv; |
|
|
2915 | } |
|
|
2916 | |
|
|
2917 | void |
|
|
2918 | object::depth_iterator::next () |
|
|
2919 | { |
|
|
2920 | if (item->below) |
|
|
2921 | { |
|
|
2922 | item = item->below; |
|
|
2923 | |
|
|
2924 | while (item->inv) |
|
|
2925 | item = item->inv; |
|
|
2926 | } |
|
|
2927 | else |
|
|
2928 | item = item->env; |
|
|
2929 | } |
|
|
2930 | |
|
|
2931 | // return a suitable string describing an objetc in enough detail to find it |
|
|
2932 | const char * |
|
|
2933 | object::debug_desc (char *info) const |
|
|
2934 | { |
|
|
2935 | char info2[256 * 3]; |
|
|
2936 | char *p = info; |
|
|
2937 | |
|
|
2938 | p += snprintf (p, 256, "%d=\"%s%s%s\"", |
|
|
2939 | count, |
|
|
2940 | &name, |
|
|
2941 | title ? " " : "", |
|
|
2942 | title ? (const char *)title : ""); |
|
|
2943 | |
|
|
2944 | if (env) |
|
|
2945 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
|
|
2946 | |
|
|
2947 | if (map) |
|
|
2948 | p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); |
|
|
2949 | |
|
|
2950 | return info; |
|
|
2951 | } |
|
|
2952 | |
|
|
2953 | const char * |
|
|
2954 | object::debug_desc () const |
|
|
2955 | { |
|
|
2956 | static char info[256 * 3]; |
|
|
2957 | return debug_desc (info); |
|
|
2958 | } |
|
|
2959 | |