1 | |
|
|
2 | /* |
|
|
3 | * static char *rcsid_object_c = |
|
|
4 | * "$Id: object.C,v 1.24 2006/09/10 16:00:23 root Exp $"; |
|
|
5 | */ |
|
|
6 | |
1 | |
7 | /* |
2 | /* |
8 | CrossFire, A Multiplayer game for X-windows |
3 | CrossFire, A Multiplayer game for X-windows |
9 | |
4 | |
10 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
… | |
… | |
29 | |
24 | |
30 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
31 | sub/add_weight will transcend the environment updating the carrying |
26 | sub/add_weight will transcend the environment updating the carrying |
32 | variable. */ |
27 | variable. */ |
33 | #include <global.h> |
28 | #include <global.h> |
34 | #ifndef WIN32 /* ---win32 exclude headers */ |
|
|
35 | # include <stdio.h> |
29 | #include <stdio.h> |
36 | # include <sys/types.h> |
30 | #include <sys/types.h> |
37 | # include <sys/uio.h> |
31 | #include <sys/uio.h> |
38 | #endif /* win32 */ |
|
|
39 | #include <object.h> |
32 | #include <object.h> |
40 | #include <funcpoint.h> |
33 | #include <funcpoint.h> |
41 | #include <skills.h> |
|
|
42 | #include <loader.h> |
34 | #include <loader.h> |
|
|
35 | |
43 | int nrofallocobjects = 0; |
36 | int nrofallocobjects = 0; |
|
|
37 | static UUID uuid; |
|
|
38 | const uint64 UUID_SKIP = 1<<19; |
44 | |
39 | |
45 | object *objects; /* Pointer to the list of used objects */ |
40 | object *objects; /* Pointer to the list of used objects */ |
46 | 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 */ |
47 | |
42 | |
48 | 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, |
… | |
… | |
56 | }; |
51 | }; |
57 | int freedir[SIZEOFFREE] = { |
52 | int freedir[SIZEOFFREE] = { |
58 | 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, |
59 | 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 |
60 | }; |
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 | } |
61 | |
133 | |
62 | /* 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. */ |
63 | static int |
135 | static int |
64 | compare_ob_value_lists_one (const object *wants, const object *has) |
136 | compare_ob_value_lists_one (const object *wants, const object *has) |
65 | { |
137 | { |
… | |
… | |
214 | 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) |
215 | return 0; |
287 | return 0; |
216 | |
288 | |
217 | switch (ob1->type) |
289 | switch (ob1->type) |
218 | { |
290 | { |
219 | case SCROLL: |
291 | case SCROLL: |
220 | if (ob1->level != ob2->level) |
292 | if (ob1->level != ob2->level) |
221 | return 0; |
293 | return 0; |
222 | break; |
294 | break; |
223 | } |
295 | } |
224 | |
296 | |
225 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
297 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
226 | { |
298 | { |
227 | /* At least one of these has key_values. */ |
299 | /* At least one of these has key_values. */ |
… | |
… | |
249 | /* |
321 | /* |
250 | * sum_weight() is a recursive function which calculates the weight |
322 | * sum_weight() is a recursive function which calculates the weight |
251 | * an object is carrying. It goes through in figures out how much |
323 | * an object is carrying. It goes through in figures out how much |
252 | * containers are carrying, and sums it up. |
324 | * containers are carrying, and sums it up. |
253 | */ |
325 | */ |
254 | signed long |
326 | long |
255 | sum_weight (object *op) |
327 | sum_weight (object *op) |
256 | { |
328 | { |
257 | signed long sum; |
329 | long sum; |
258 | object *inv; |
330 | object *inv; |
259 | |
331 | |
260 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
332 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
261 | { |
333 | { |
262 | if (inv->inv) |
334 | if (inv->inv) |
263 | sum_weight (inv); |
335 | sum_weight (inv); |
264 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
336 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
265 | } |
337 | } |
|
|
338 | |
266 | if (op->type == CONTAINER && op->stats.Str) |
339 | if (op->type == CONTAINER && op->stats.Str) |
267 | sum = (sum * (100 - op->stats.Str)) / 100; |
340 | sum = (sum * (100 - op->stats.Str)) / 100; |
|
|
341 | |
268 | if (op->carrying != sum) |
342 | if (op->carrying != sum) |
269 | op->carrying = sum; |
343 | op->carrying = sum; |
|
|
344 | |
270 | return sum; |
345 | return sum; |
271 | } |
346 | } |
272 | |
347 | |
273 | /** |
348 | /** |
274 | * Return the outermost environment object for a given object. |
349 | * Return the outermost environment object for a given object. |
… | |
… | |
423 | */ |
498 | */ |
424 | |
499 | |
425 | object * |
500 | object * |
426 | find_object_name (const char *str) |
501 | find_object_name (const char *str) |
427 | { |
502 | { |
428 | const char *name = shstr::find (str); |
503 | shstr_cmp str_ (str); |
429 | object *op; |
504 | object *op; |
430 | |
505 | |
431 | for (op = objects; op != NULL; op = op->next) |
506 | for (op = objects; op != NULL; op = op->next) |
432 | if (&op->name == name) |
507 | if (op->name == str_) |
433 | break; |
508 | break; |
434 | |
509 | |
435 | return op; |
510 | return op; |
436 | } |
511 | } |
437 | |
512 | |
… | |
… | |
449 | * 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 |
450 | * 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 |
451 | * 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 |
452 | * anything - once an object is removed, it is basically dead anyways. |
527 | * anything - once an object is removed, it is basically dead anyways. |
453 | */ |
528 | */ |
454 | |
|
|
455 | object * |
529 | object * |
456 | get_owner (object *op) |
530 | object::get_owner () |
457 | { |
531 | { |
458 | if (op->owner == NULL) |
532 | if (!owner |
459 | return NULL; |
533 | || QUERY_FLAG (owner, FLAG_FREED) |
|
|
534 | || QUERY_FLAG (owner, FLAG_REMOVED)) |
|
|
535 | owner = 0; |
460 | |
536 | |
461 | if (!QUERY_FLAG (op->owner, FLAG_FREED) && !QUERY_FLAG (op->owner, FLAG_REMOVED) && op->owner->count == op->ownercount) |
|
|
462 | return op->owner; |
537 | return owner; |
463 | |
|
|
464 | op->owner = NULL; |
|
|
465 | op->ownercount = 0; |
|
|
466 | return NULL; |
|
|
467 | } |
|
|
468 | |
|
|
469 | void |
|
|
470 | clear_owner (object *op) |
|
|
471 | { |
|
|
472 | if (!op) |
|
|
473 | return; |
|
|
474 | |
|
|
475 | if (op->owner && op->ownercount == op->owner->count) |
|
|
476 | op->owner->refcount--; |
|
|
477 | |
|
|
478 | op->owner = NULL; |
|
|
479 | op->ownercount = 0; |
|
|
480 | } |
538 | } |
481 | |
539 | |
482 | /* |
540 | /* |
483 | * 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 |
484 | * skill and experience objects. |
542 | * skill and experience objects. |
485 | */ |
543 | */ |
486 | void |
544 | void |
487 | set_owner (object *op, object *owner) |
545 | object::set_owner (object *owner) |
488 | { |
546 | { |
489 | if (owner == NULL || op == NULL) |
547 | if (!owner) |
490 | return; |
548 | return; |
491 | |
549 | |
492 | /* next line added to allow objects which own objects */ |
550 | /* next line added to allow objects which own objects */ |
493 | /* 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 |
494 | * with the fireball owning a poison cloud which then owned the |
552 | * with the fireball owning a poison cloud which then owned the |
495 | * 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 |
496 | * freed and then another object replacing it. Since the ownercounts |
554 | * freed and then another object replacing it. Since the ownercounts |
497 | * 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. |
498 | */ |
556 | */ |
499 | while (owner->owner && owner != owner->owner && owner->ownercount == owner->owner->count) |
557 | while (owner->owner) |
500 | owner = owner->owner; |
558 | owner = owner->owner; |
501 | |
559 | |
502 | /* IF the owner still has an owner, we did not resolve to a final owner. |
|
|
503 | * so lets not add to that. |
|
|
504 | */ |
|
|
505 | if (owner->owner) |
|
|
506 | return; |
|
|
507 | |
|
|
508 | op->owner = owner; |
560 | this->owner = owner; |
509 | |
|
|
510 | op->ownercount = owner->count; |
|
|
511 | owner->refcount++; |
|
|
512 | |
|
|
513 | } |
|
|
514 | |
|
|
515 | /* Set the owner to clone's current owner and set the skill and experience |
|
|
516 | * objects to clone's objects (typically those objects that where the owner's |
|
|
517 | * current skill and experience objects at the time when clone's owner was |
|
|
518 | * set - not the owner's current skill and experience objects). |
|
|
519 | * |
|
|
520 | * Use this function if player created an object (e.g. fire bullet, swarm |
|
|
521 | * spell), and this object creates further objects whose kills should be |
|
|
522 | * accounted for the player's original skill, even if player has changed |
|
|
523 | * skills meanwhile. |
|
|
524 | */ |
|
|
525 | void |
|
|
526 | copy_owner (object *op, object *clone) |
|
|
527 | { |
|
|
528 | object *owner = get_owner (clone); |
|
|
529 | |
|
|
530 | if (owner == NULL) |
|
|
531 | { |
|
|
532 | /* players don't have owners - they own themselves. Update |
|
|
533 | * as appropriate. |
|
|
534 | */ |
|
|
535 | if (clone->type == PLAYER) |
|
|
536 | owner = clone; |
|
|
537 | else |
|
|
538 | return; |
|
|
539 | } |
|
|
540 | set_owner (op, owner); |
|
|
541 | |
|
|
542 | } |
561 | } |
543 | |
562 | |
544 | /* Zero the key_values on op, decrementing the shared-string |
563 | /* Zero the key_values on op, decrementing the shared-string |
545 | * refcounts and freeing the links. |
564 | * refcounts and freeing the links. |
546 | */ |
565 | */ |
… | |
… | |
562 | { |
581 | { |
563 | attachable_base::clear (); |
582 | attachable_base::clear (); |
564 | |
583 | |
565 | free_key_values (this); |
584 | free_key_values (this); |
566 | |
585 | |
|
|
586 | owner = 0; |
567 | name = 0; |
587 | name = 0; |
568 | name_pl = 0; |
588 | name_pl = 0; |
569 | title = 0; |
589 | title = 0; |
570 | race = 0; |
590 | race = 0; |
571 | slaying = 0; |
591 | slaying = 0; |
572 | skill = 0; |
592 | skill = 0; |
573 | msg = 0; |
593 | msg = 0; |
574 | lore = 0; |
594 | lore = 0; |
575 | custom_name = 0; |
595 | custom_name = 0; |
576 | 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; |
577 | |
608 | |
578 | memset (static_cast < object_pod * >(this), 0, sizeof (object_pod)); |
609 | memset (static_cast<object_pod *>(this), 0, sizeof (object_pod)); |
579 | |
610 | |
580 | 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; |
581 | } |
621 | } |
582 | |
622 | |
583 | void object::clone (object *destination) |
623 | void object::clone (object *destination) |
584 | { |
624 | { |
585 | *(object_copy *) destination = *this; |
625 | *(object_copy *)destination = *this; |
586 | *(object_pod *) destination = *this; |
626 | *(object_pod *)destination = *this; |
587 | |
627 | |
588 | if (self || cb) |
628 | if (self || cb) |
589 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); |
629 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); |
590 | } |
|
|
591 | |
|
|
592 | /* |
|
|
593 | * clear_object() frees everything allocated by an object, and also |
|
|
594 | * clears all variables and flags to default settings. |
|
|
595 | */ |
|
|
596 | |
|
|
597 | void |
|
|
598 | clear_object (object *op) |
|
|
599 | { |
|
|
600 | op->clear (); |
|
|
601 | |
|
|
602 | op->contr = NULL; |
|
|
603 | op->below = NULL; |
|
|
604 | op->above = NULL; |
|
|
605 | op->inv = NULL; |
|
|
606 | op->container = NULL; |
|
|
607 | op->env = NULL; |
|
|
608 | op->more = NULL; |
|
|
609 | op->head = NULL; |
|
|
610 | op->map = NULL; |
|
|
611 | op->refcount = 0; |
|
|
612 | op->active_next = NULL; |
|
|
613 | op->active_prev = NULL; |
|
|
614 | /* What is not cleared is next, prev, and count */ |
|
|
615 | |
|
|
616 | op->expmul = 1.0; |
|
|
617 | op->face = blank_face; |
|
|
618 | op->attacked_by_count = -1; |
|
|
619 | |
|
|
620 | if (settings.casting_time) |
|
|
621 | op->casting_time = -1; |
|
|
622 | } |
630 | } |
623 | |
631 | |
624 | /* |
632 | /* |
625 | * copy object first frees everything allocated by the second object, |
633 | * copy object first frees everything allocated by the second object, |
626 | * 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 |
627 | * object, allocating what needs to be allocated. Basically, any |
635 | * object, allocating what needs to be allocated. Basically, any |
628 | * 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, |
629 | * 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 |
630 | * will point at garbage. |
638 | * will point at garbage. |
631 | */ |
639 | */ |
632 | |
|
|
633 | void |
640 | void |
634 | copy_object (object *op2, object *op) |
641 | copy_object (object *op2, object *op) |
635 | { |
642 | { |
636 | bool is_freed = QUERY_FLAG (op, FLAG_FREED); |
643 | bool is_freed = QUERY_FLAG (op, FLAG_FREED); |
637 | bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); |
644 | bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); |
… | |
… | |
697 | /* |
704 | /* |
698 | * 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 |
699 | * 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. |
700 | * 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. |
701 | */ |
708 | */ |
702 | |
|
|
703 | void |
709 | void |
704 | update_ob_speed (object *op) |
710 | update_ob_speed (object *op) |
705 | { |
711 | { |
706 | extern int arch_init; |
712 | extern int arch_init; |
707 | |
713 | |
… | |
… | |
716 | abort (); |
722 | abort (); |
717 | #else |
723 | #else |
718 | op->speed = 0; |
724 | op->speed = 0; |
719 | #endif |
725 | #endif |
720 | } |
726 | } |
|
|
727 | |
721 | if (arch_init) |
728 | if (arch_init) |
722 | { |
|
|
723 | return; |
729 | return; |
724 | } |
730 | |
725 | if (FABS (op->speed) > MIN_ACTIVE_SPEED) |
731 | if (FABS (op->speed) > MIN_ACTIVE_SPEED) |
726 | { |
732 | { |
727 | /* If already on active list, don't do anything */ |
733 | /* If already on active list, don't do anything */ |
728 | if (op->active_next || op->active_prev || op == active_objects) |
734 | if (op->active_next || op->active_prev || op == active_objects) |
729 | return; |
735 | return; |
730 | |
736 | |
731 | /* process_events() expects us to insert the object at the beginning |
737 | /* process_events() expects us to insert the object at the beginning |
732 | * of the list. */ |
738 | * of the list. */ |
733 | op->active_next = active_objects; |
739 | op->active_next = active_objects; |
|
|
740 | |
734 | if (op->active_next != NULL) |
741 | if (op->active_next != NULL) |
735 | op->active_next->active_prev = op; |
742 | op->active_next->active_prev = op; |
|
|
743 | |
736 | active_objects = op; |
744 | active_objects = op; |
737 | } |
745 | } |
738 | else |
746 | else |
739 | { |
747 | { |
740 | /* If not on the active list, nothing needs to be done */ |
748 | /* If not on the active list, nothing needs to be done */ |
… | |
… | |
742 | return; |
750 | return; |
743 | |
751 | |
744 | if (op->active_prev == NULL) |
752 | if (op->active_prev == NULL) |
745 | { |
753 | { |
746 | active_objects = op->active_next; |
754 | active_objects = op->active_next; |
|
|
755 | |
747 | if (op->active_next != NULL) |
756 | if (op->active_next != NULL) |
748 | op->active_next->active_prev = NULL; |
757 | op->active_next->active_prev = NULL; |
749 | } |
758 | } |
750 | else |
759 | else |
751 | { |
760 | { |
752 | op->active_prev->active_next = op->active_next; |
761 | op->active_prev->active_next = op->active_next; |
|
|
762 | |
753 | if (op->active_next) |
763 | if (op->active_next) |
754 | op->active_next->active_prev = op->active_prev; |
764 | op->active_next->active_prev = op->active_prev; |
755 | } |
765 | } |
|
|
766 | |
756 | op->active_next = NULL; |
767 | op->active_next = NULL; |
757 | op->active_prev = NULL; |
768 | op->active_prev = NULL; |
758 | } |
769 | } |
759 | } |
770 | } |
760 | |
771 | |
… | |
… | |
890 | /* if the object is being removed, we can't make intelligent |
901 | /* if the object is being removed, we can't make intelligent |
891 | * decisions, because remove_ob can't really pass the object |
902 | * decisions, because remove_ob can't really pass the object |
892 | * that is being removed. |
903 | * that is being removed. |
893 | */ |
904 | */ |
894 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
905 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
895 | { |
|
|
896 | update_now = 1; |
906 | update_now = 1; |
897 | } |
|
|
898 | else if (action == UP_OBJ_FACE) |
907 | else if (action == UP_OBJ_FACE) |
899 | { |
|
|
900 | /* Nothing to do for that case */ |
908 | /* Nothing to do for that case */ ; |
901 | } |
|
|
902 | else |
909 | else |
903 | { |
|
|
904 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
910 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
905 | } |
|
|
906 | |
911 | |
907 | if (update_now) |
912 | if (update_now) |
908 | { |
913 | { |
909 | SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE); |
914 | SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE); |
910 | update_position (op->map, op->x, op->y); |
915 | update_position (op->map, op->x, op->y); |
… | |
… | |
912 | |
917 | |
913 | if (op->more != NULL) |
918 | if (op->more != NULL) |
914 | update_object (op->more, action); |
919 | update_object (op->more, action); |
915 | } |
920 | } |
916 | |
921 | |
917 | static |
922 | static unordered_vector<object *> mortals; |
918 | std::vector < object *> |
|
|
919 | mortals; |
|
|
920 | |
923 | |
921 | void object::free_mortals () |
924 | void object::free_mortals () |
922 | { |
925 | { |
923 | for (std::vector < object *>::iterator i = mortals.begin (); i != mortals.end (); ++i) |
926 | for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();) |
924 | delete * |
927 | if ((*i)->refcnt) |
|
|
928 | ++i; // further delay freeing |
|
|
929 | else |
925 | i; |
930 | { |
|
|
931 | delete *i; |
|
|
932 | mortals.erase (i); |
|
|
933 | } |
926 | |
934 | |
927 | mortals.clear (); |
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 | } |
928 | } |
942 | } |
929 | |
943 | |
930 | object::object () |
944 | object::object () |
931 | { |
945 | { |
932 | SET_FLAG (this, FLAG_REMOVED); |
946 | SET_FLAG (this, FLAG_REMOVED); |
… | |
… | |
942 | } |
956 | } |
943 | |
957 | |
944 | void object::link () |
958 | void object::link () |
945 | { |
959 | { |
946 | count = ++ob_count; |
960 | count = ++ob_count; |
|
|
961 | uuid = gen_uuid (); |
947 | |
962 | |
948 | prev = 0; |
963 | prev = 0; |
949 | next = objects; |
964 | next = objects; |
950 | |
965 | |
951 | if (objects) |
966 | if (objects) |
… | |
… | |
954 | objects = this; |
969 | objects = this; |
955 | } |
970 | } |
956 | |
971 | |
957 | void object::unlink () |
972 | void object::unlink () |
958 | { |
973 | { |
959 | count = 0; |
974 | //count = 0;//D |
|
|
975 | if (!prev && !next) return;//D |
960 | |
976 | |
961 | /* Remove this object from the list of used objects */ |
|
|
962 | if (prev) |
|
|
963 | prev->next = next; |
|
|
964 | if (next) |
|
|
965 | next->prev = prev; |
|
|
966 | if (this == objects) |
977 | if (this == objects) |
967 | 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; |
968 | } |
986 | } |
969 | |
987 | |
970 | object *object::create () |
988 | object *object::create () |
971 | { |
989 | { |
972 | object * |
|
|
973 | op = new object; |
990 | object *op = new object; |
974 | |
|
|
975 | op->link (); |
991 | op->link (); |
976 | return op; |
992 | return op; |
977 | } |
993 | } |
978 | |
994 | |
979 | /* |
995 | /* |
… | |
… | |
986 | * 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 |
987 | * inventory to the ground. |
1003 | * inventory to the ground. |
988 | */ |
1004 | */ |
989 | void object::free (bool free_inventory) |
1005 | void object::free (bool free_inventory) |
990 | { |
1006 | { |
|
|
1007 | if (QUERY_FLAG (this, FLAG_FREED)) |
|
|
1008 | return; |
|
|
1009 | |
|
|
1010 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
|
|
1011 | remove_friendly_object (this); |
|
|
1012 | |
991 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
1013 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
992 | { |
1014 | remove_ob (this); |
993 | LOG (llevDebug, "Free object called with non removed object\n"); |
|
|
994 | dump_object (this); |
|
|
995 | #ifdef MANY_CORES |
|
|
996 | abort (); |
|
|
997 | #endif |
|
|
998 | } |
|
|
999 | |
1015 | |
1000 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
|
|
1001 | { |
|
|
1002 | LOG (llevMonster, "Warning: tried to free friendly object.\n"); |
|
|
1003 | remove_friendly_object (this); |
|
|
1004 | } |
|
|
1005 | |
|
|
1006 | if (QUERY_FLAG (this, FLAG_FREED)) |
1016 | SET_FLAG (this, FLAG_FREED); |
1007 | { |
|
|
1008 | dump_object (this); |
|
|
1009 | LOG (llevError, "Trying to free freed object.\n%s\n", errmsg); |
|
|
1010 | return; |
|
|
1011 | } |
|
|
1012 | |
1017 | |
1013 | if (more) |
1018 | if (more) |
1014 | { |
1019 | { |
1015 | more->free (free_inventory); |
1020 | more->free (free_inventory); |
1016 | more = 0; |
1021 | more = 0; |
… | |
… | |
1020 | { |
1025 | { |
1021 | /* Only if the space blocks everything do we not process - |
1026 | /* Only if the space blocks everything do we not process - |
1022 | * if some form of movement is allowed, let objects |
1027 | * if some form of movement is allowed, let objects |
1023 | * drop on that space. |
1028 | * drop on that space. |
1024 | */ |
1029 | */ |
1025 | 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) |
1026 | { |
1031 | { |
1027 | object * |
1032 | object *op = inv; |
1028 | op = inv; |
|
|
1029 | |
1033 | |
1030 | while (op) |
1034 | while (op) |
1031 | { |
1035 | { |
1032 | object * |
|
|
1033 | tmp = op->below; |
1036 | object *tmp = op->below; |
1034 | |
|
|
1035 | remove_ob (op); |
|
|
1036 | op->free (free_inventory); |
1037 | op->free (free_inventory); |
1037 | op = tmp; |
1038 | op = tmp; |
1038 | } |
1039 | } |
1039 | } |
1040 | } |
1040 | else |
1041 | else |
1041 | { /* Put objects in inventory onto this space */ |
1042 | { /* Put objects in inventory onto this space */ |
1042 | object * |
1043 | object *op = inv; |
1043 | op = inv; |
|
|
1044 | |
1044 | |
1045 | while (op) |
1045 | while (op) |
1046 | { |
1046 | { |
1047 | object * |
|
|
1048 | tmp = op->below; |
1047 | object *tmp = op->below; |
1049 | |
1048 | |
1050 | remove_ob (op); |
1049 | remove_ob (op); |
1051 | |
1050 | |
1052 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
1051 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
1053 | || 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)) |
… | |
… | |
1062 | op = tmp; |
1061 | op = tmp; |
1063 | } |
1062 | } |
1064 | } |
1063 | } |
1065 | } |
1064 | } |
1066 | |
1065 | |
|
|
1066 | owner = 0; |
|
|
1067 | |
1067 | /* Remove object from the active list */ |
1068 | /* Remove object from the active list */ |
1068 | speed = 0; |
1069 | speed = 0; |
1069 | update_ob_speed (this); |
1070 | update_ob_speed (this); |
1070 | |
1071 | |
1071 | unlink (); |
1072 | unlink (); |
1072 | |
|
|
1073 | SET_FLAG (this, FLAG_FREED); |
|
|
1074 | |
1073 | |
1075 | mortals.push_back (this); |
1074 | mortals.push_back (this); |
1076 | } |
1075 | } |
1077 | |
1076 | |
1078 | /* |
1077 | /* |
… | |
… | |
1109 | object * |
1108 | object * |
1110 | tmp, * |
1109 | tmp, * |
1111 | last = NULL; |
1110 | last = NULL; |
1112 | object * |
1111 | object * |
1113 | otmp; |
1112 | otmp; |
|
|
1113 | |
1114 | tag_t |
1114 | tag_t |
1115 | tag; |
1115 | tag; |
1116 | int |
1116 | int |
1117 | check_walk_off; |
1117 | check_walk_off; |
1118 | mapstruct * |
1118 | mapstruct * |
1119 | m; |
1119 | m; |
|
|
1120 | |
1120 | sint16 |
1121 | sint16 |
1121 | x, |
1122 | x, |
1122 | y; |
1123 | y; |
1123 | |
1124 | |
1124 | |
|
|
1125 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1125 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1126 | { |
1126 | return; |
1127 | dump_object (op); |
|
|
1128 | LOG (llevError, "Trying to remove removed object.\n%s\n", errmsg); |
|
|
1129 | |
1127 | |
1130 | /* Changed it to always dump core in this case. As has been learned |
1128 | SET_FLAG (op, FLAG_REMOVED); |
1131 | * in the past, trying to recover from errors almost always |
1129 | |
1132 | * make things worse, and this is a real error here - something |
|
|
1133 | * that should not happen. |
|
|
1134 | * Yes, if this was a mission critical app, trying to do something |
|
|
1135 | * to recover may make sense, but that is because failure of the app |
|
|
1136 | * may have other disastrous problems. Cf runs out of a script |
|
|
1137 | * so is easily enough restarted without any real problems. |
|
|
1138 | * MSW 2001-07-01 |
|
|
1139 | */ |
|
|
1140 | abort (); |
|
|
1141 | } |
|
|
1142 | if (op->more != NULL) |
1130 | if (op->more != NULL) |
1143 | remove_ob (op->more); |
1131 | remove_ob (op->more); |
1144 | |
|
|
1145 | SET_FLAG (op, FLAG_REMOVED); |
|
|
1146 | |
1132 | |
1147 | /* |
1133 | /* |
1148 | * In this case, the object to be removed is in someones |
1134 | * In this case, the object to be removed is in someones |
1149 | * inventory. |
1135 | * inventory. |
1150 | */ |
1136 | */ |
… | |
… | |
1176 | */ |
1162 | */ |
1177 | op->x = op->env->x, op->y = op->env->y; |
1163 | op->x = op->env->x, op->y = op->env->y; |
1178 | op->map = op->env->map; |
1164 | op->map = op->env->map; |
1179 | op->above = NULL, op->below = NULL; |
1165 | op->above = NULL, op->below = NULL; |
1180 | op->env = NULL; |
1166 | op->env = NULL; |
1181 | return; |
1167 | } |
|
|
1168 | else if (op->map) |
1182 | } |
1169 | { |
1183 | |
|
|
1184 | /* If we get here, we are removing it from a map */ |
|
|
1185 | if (op->map == NULL) |
|
|
1186 | return; |
|
|
1187 | |
|
|
1188 | x = op->x; |
1170 | x = op->x; |
1189 | y = op->y; |
1171 | y = op->y; |
1190 | m = get_map_from_coord (op->map, &x, &y); |
1172 | m = get_map_from_coord (op->map, &x, &y); |
1191 | |
1173 | |
1192 | if (!m) |
1174 | if (!m) |
1193 | { |
1175 | { |
1194 | 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", |
1195 | op->map->path, op->x, op->y); |
1177 | op->map->path, op->x, op->y); |
1196 | /* 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. |
1197 | * it seems if we get into this case, something is probablye |
1179 | * it seems if we get into this case, something is probablye |
1198 | * 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 |
1199 | */ |
1191 | */ |
1200 | abort (); |
|
|
1201 | } |
|
|
1202 | if (op->map != m) |
|
|
1203 | { |
|
|
1204 | LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n", |
|
|
1205 | op->map->path, m->path, op->x, op->y, x, y); |
|
|
1206 | } |
|
|
1207 | |
1192 | |
1208 | /* Re did the following section of code - it looks like it had |
|
|
1209 | * lots of logic for things we no longer care about |
|
|
1210 | */ |
|
|
1211 | |
|
|
1212 | /* link the object above us */ |
1193 | /* link the object above us */ |
1213 | if (op->above) |
1194 | if (op->above) |
1214 | op->above->below = op->below; |
1195 | op->above->below = op->below; |
1215 | else |
1196 | else |
1216 | 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 */ |
1217 | |
1198 | |
1218 | /* Relink the object below us, if there is one */ |
1199 | /* Relink the object below us, if there is one */ |
1219 | if (op->below) |
1200 | if (op->below) |
1220 | { |
|
|
1221 | op->below->above = op->above; |
1201 | op->below->above = op->above; |
1222 | } |
|
|
1223 | else |
1202 | else |
1224 | { |
1203 | { |
1225 | /* 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 |
1226 | * use translated coordinates in case some oddness with map tiling is |
1205 | * use translated coordinates in case some oddness with map tiling is |
1227 | * evident |
1206 | * evident |
1228 | */ |
|
|
1229 | if (GET_MAP_OB (m, x, y) != op) |
|
|
1230 | { |
|
|
1231 | dump_object (op); |
|
|
1232 | 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", |
|
|
1233 | errmsg); |
|
|
1234 | dump_object (GET_MAP_OB (m, x, y)); |
|
|
1235 | LOG (llevError, "%s\n", errmsg); |
|
|
1236 | } |
|
|
1237 | SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ |
|
|
1238 | } |
|
|
1239 | op->above = NULL; |
|
|
1240 | op->below = NULL; |
|
|
1241 | |
|
|
1242 | if (op->map->in_memory == MAP_SAVING) |
|
|
1243 | return; |
|
|
1244 | |
|
|
1245 | tag = op->count; |
|
|
1246 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
|
|
1247 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
|
|
1248 | { |
|
|
1249 | /* No point updating the players look faces if he is the object |
|
|
1250 | * being removed. |
|
|
1251 | */ |
|
|
1252 | |
|
|
1253 | if (tmp->type == PLAYER && tmp != op) |
|
|
1254 | { |
|
|
1255 | /* If a container that the player is currently using somehow gets |
|
|
1256 | * removed (most likely destroyed), update the player view |
|
|
1257 | * appropriately. |
|
|
1258 | */ |
1207 | */ |
1259 | if (tmp->container == op) |
1208 | if (GET_MAP_OB (m, x, y) != op) |
1260 | { |
1209 | { |
1261 | CLEAR_FLAG (op, FLAG_APPLIED); |
1210 | dump_object (op); |
1262 | 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); |
1263 | } |
1215 | } |
1264 | tmp->contr->socket.update_look = 1; |
1216 | |
1265 | } |
1217 | SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ |
1266 | /* See if player moving off should effect something */ |
|
|
1267 | if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
|
|
1268 | { |
1218 | } |
1269 | |
1219 | |
1270 | move_apply (tmp, op, NULL); |
1220 | op->above = 0; |
1271 | if (was_destroyed (op, tag)) |
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) |
1272 | { |
1236 | { |
1273 | 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; |
1274 | } |
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 | } |
1275 | } |
1259 | } |
1276 | |
1260 | |
1277 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1261 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1278 | |
1262 | |
1279 | if (tmp->above == tmp) |
1263 | if (tmp->above == tmp) |
1280 | tmp->above = NULL; |
1264 | tmp->above = NULL; |
|
|
1265 | |
1281 | last = tmp; |
1266 | last = tmp; |
1282 | } |
1267 | } |
|
|
1268 | |
1283 | /* last == NULL of there are no objects on this space */ |
1269 | /* last == NULL of there are no objects on this space */ |
1284 | if (last == NULL) |
1270 | if (last == NULL) |
1285 | { |
1271 | { |
1286 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
1272 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
1287 | * 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 |
1288 | * 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 |
1289 | * be correct anyways. |
1275 | * be correct anyways. |
1290 | */ |
1276 | */ |
1291 | 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); |
1292 | update_position (op->map, op->x, op->y); |
1278 | update_position (op->map, op->x, op->y); |
1293 | } |
1279 | } |
1294 | else |
1280 | else |
1295 | update_object (last, UP_OBJ_REMOVE); |
1281 | update_object (last, UP_OBJ_REMOVE); |
1296 | |
1282 | |
1297 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) |
1283 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) |
1298 | update_all_los (op->map, op->x, op->y); |
1284 | update_all_los (op->map, op->x, op->y); |
1299 | |
1285 | } |
1300 | } |
1286 | } |
1301 | |
1287 | |
1302 | /* |
1288 | /* |
1303 | * merge_ob(op,top): |
1289 | * merge_ob(op,top): |
1304 | * |
1290 | * |
1305 | * This function goes through all objects below and including top, and |
1291 | * This function goes through all objects below and including top, and |
1306 | * merges op to the first matching object. |
1292 | * merges op to the first matching object. |
1307 | * If top is NULL, it is calculated. |
1293 | * If top is NULL, it is calculated. |
1308 | * 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 |
1309 | */ |
1295 | */ |
1310 | |
|
|
1311 | object * |
1296 | object * |
1312 | merge_ob (object *op, object *top) |
1297 | merge_ob (object *op, object *top) |
1313 | { |
1298 | { |
1314 | if (!op->nrof) |
1299 | if (!op->nrof) |
1315 | return 0; |
1300 | return 0; |
|
|
1301 | |
1316 | if (top == NULL) |
1302 | if (top == NULL) |
1317 | for (top = op; top != NULL && top->above != NULL; top = top->above); |
1303 | for (top = op; top != NULL && top->above != NULL; top = top->above); |
|
|
1304 | |
1318 | for (; top != NULL; top = top->below) |
1305 | for (; top != NULL; top = top->below) |
1319 | { |
1306 | { |
1320 | if (top == op) |
1307 | if (top == op) |
1321 | continue; |
1308 | continue; |
1322 | if (CAN_MERGE (op, top)) |
1309 | if (CAN_MERGE (op, top)) |
… | |
… | |
1328 | remove_ob (op); |
1315 | remove_ob (op); |
1329 | free_object (op); |
1316 | free_object (op); |
1330 | return top; |
1317 | return top; |
1331 | } |
1318 | } |
1332 | } |
1319 | } |
|
|
1320 | |
1333 | return NULL; |
1321 | return NULL; |
1334 | } |
1322 | } |
1335 | |
1323 | |
1336 | /* |
1324 | /* |
1337 | * 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 |
1338 | * job preparing multi-part monsters |
1326 | * job preparing multi-part monsters |
1339 | */ |
1327 | */ |
1340 | object * |
1328 | object * |
1341 | 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) |
1342 | { |
1330 | { |
1343 | object * |
1331 | object *tmp; |
1344 | tmp; |
|
|
1345 | |
1332 | |
1346 | if (op->head) |
1333 | if (op->head) |
1347 | op = op->head; |
1334 | op = op->head; |
|
|
1335 | |
1348 | for (tmp = op; tmp; tmp = tmp->more) |
1336 | for (tmp = op; tmp; tmp = tmp->more) |
1349 | { |
1337 | { |
1350 | tmp->x = x + tmp->arch->clone.x; |
1338 | tmp->x = x + tmp->arch->clone.x; |
1351 | tmp->y = y + tmp->arch->clone.y; |
1339 | tmp->y = y + tmp->arch->clone.y; |
1352 | } |
1340 | } |
|
|
1341 | |
1353 | return insert_ob_in_map (op, m, originator, flag); |
1342 | return insert_ob_in_map (op, m, originator, flag); |
1354 | } |
1343 | } |
1355 | |
1344 | |
1356 | /* |
1345 | /* |
1357 | * insert_ob_in_map (op, map, originator, flag): |
1346 | * insert_ob_in_map (op, map, originator, flag): |
… | |
… | |
1375 | */ |
1364 | */ |
1376 | |
1365 | |
1377 | object * |
1366 | object * |
1378 | insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) |
1367 | insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) |
1379 | { |
1368 | { |
1380 | object * |
1369 | object *tmp, *top, *floor = NULL; |
1381 | tmp, * |
1370 | sint16 x, y; |
1382 | top, * |
|
|
1383 | floor = NULL; |
|
|
1384 | sint16 |
|
|
1385 | x, |
|
|
1386 | y; |
|
|
1387 | |
1371 | |
1388 | if (QUERY_FLAG (op, FLAG_FREED)) |
1372 | if (QUERY_FLAG (op, FLAG_FREED)) |
1389 | { |
1373 | { |
1390 | LOG (llevError, "Trying to insert freed object!\n"); |
1374 | LOG (llevError, "Trying to insert freed object!\n"); |
1391 | return NULL; |
1375 | return NULL; |
1392 | } |
1376 | } |
|
|
1377 | |
1393 | if (m == NULL) |
1378 | if (m == NULL) |
1394 | { |
1379 | { |
1395 | dump_object (op); |
1380 | dump_object (op); |
1396 | LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg); |
1381 | LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg); |
1397 | return op; |
1382 | return op; |
1398 | } |
1383 | } |
|
|
1384 | |
1399 | if (out_of_map (m, op->x, op->y)) |
1385 | if (out_of_map (m, op->x, op->y)) |
1400 | { |
1386 | { |
1401 | dump_object (op); |
1387 | dump_object (op); |
1402 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg); |
1388 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg); |
1403 | #ifdef MANY_CORES |
1389 | #ifdef MANY_CORES |
… | |
… | |
1407 | */ |
1393 | */ |
1408 | abort (); |
1394 | abort (); |
1409 | #endif |
1395 | #endif |
1410 | return op; |
1396 | return op; |
1411 | } |
1397 | } |
|
|
1398 | |
1412 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1399 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1413 | { |
1400 | { |
1414 | dump_object (op); |
1401 | dump_object (op); |
1415 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg); |
1402 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg); |
1416 | return op; |
1403 | return op; |
1417 | } |
1404 | } |
|
|
1405 | |
1418 | if (op->more != NULL) |
1406 | if (op->more != NULL) |
1419 | { |
1407 | { |
1420 | /* The part may be on a different map. */ |
1408 | /* The part may be on a different map. */ |
1421 | |
1409 | |
1422 | object * |
|
|
1423 | more = op->more; |
1410 | object *more = op->more; |
1424 | |
1411 | |
1425 | /* We really need the caller to normalize coordinates - if |
1412 | /* We really need the caller to normalize coordinates - if |
1426 | * we set the map, that doesn't work if the location is within |
1413 | * we set the map, that doesn't work if the location is within |
1427 | * a map and this is straddling an edge. So only if coordinate |
1414 | * a map and this is straddling an edge. So only if coordinate |
1428 | * is clear wrong do we normalize it. |
1415 | * is clear wrong do we normalize it. |
1429 | */ |
1416 | */ |
1430 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
1417 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
1431 | { |
|
|
1432 | more->map = get_map_from_coord (m, &more->x, &more->y); |
1418 | more->map = get_map_from_coord (m, &more->x, &more->y); |
1433 | } |
|
|
1434 | else if (!more->map) |
1419 | else if (!more->map) |
1435 | { |
1420 | { |
1436 | /* For backwards compatibility - when not dealing with tiled maps, |
1421 | /* For backwards compatibility - when not dealing with tiled maps, |
1437 | * more->map should always point to the parent. |
1422 | * more->map should always point to the parent. |
1438 | */ |
1423 | */ |
… | |
… | |
1441 | |
1426 | |
1442 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
1427 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
1443 | { |
1428 | { |
1444 | if (!op->head) |
1429 | if (!op->head) |
1445 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1430 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1431 | |
1446 | return NULL; |
1432 | return NULL; |
1447 | } |
1433 | } |
1448 | } |
1434 | } |
|
|
1435 | |
1449 | CLEAR_FLAG (op, FLAG_REMOVED); |
1436 | CLEAR_FLAG (op, FLAG_REMOVED); |
1450 | |
1437 | |
1451 | /* Ideally, the caller figures this out. However, it complicates a lot |
1438 | /* Ideally, the caller figures this out. However, it complicates a lot |
1452 | * of areas of callers (eg, anything that uses find_free_spot would now |
1439 | * of areas of callers (eg, anything that uses find_free_spot would now |
1453 | * need extra work |
1440 | * need extra work |
… | |
… | |
1457 | y = op->y; |
1444 | y = op->y; |
1458 | |
1445 | |
1459 | /* this has to be done after we translate the coordinates. |
1446 | /* this has to be done after we translate the coordinates. |
1460 | */ |
1447 | */ |
1461 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1448 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1462 | { |
|
|
1463 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1449 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1464 | if (CAN_MERGE (op, tmp)) |
1450 | if (CAN_MERGE (op, tmp)) |
1465 | { |
1451 | { |
1466 | op->nrof += tmp->nrof; |
1452 | op->nrof += tmp->nrof; |
1467 | remove_ob (tmp); |
1453 | remove_ob (tmp); |
1468 | free_object (tmp); |
1454 | free_object (tmp); |
1469 | } |
1455 | } |
1470 | } |
|
|
1471 | |
1456 | |
1472 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1457 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1473 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1458 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
|
|
1459 | |
1474 | if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1460 | if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1475 | CLEAR_FLAG (op, FLAG_NO_STEAL); |
1461 | CLEAR_FLAG (op, FLAG_NO_STEAL); |
1476 | |
1462 | |
1477 | if (flag & INS_BELOW_ORIGINATOR) |
1463 | if (flag & INS_BELOW_ORIGINATOR) |
1478 | { |
1464 | { |
1479 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1465 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1480 | { |
1466 | { |
1481 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1467 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1482 | abort (); |
1468 | abort (); |
1483 | } |
1469 | } |
|
|
1470 | |
1484 | op->above = originator; |
1471 | op->above = originator; |
1485 | op->below = originator->below; |
1472 | op->below = originator->below; |
|
|
1473 | |
1486 | if (op->below) |
1474 | if (op->below) |
1487 | op->below->above = op; |
1475 | op->below->above = op; |
1488 | else |
1476 | else |
1489 | SET_MAP_OB (op->map, op->x, op->y, op); |
1477 | SET_MAP_OB (op->map, op->x, op->y, op); |
|
|
1478 | |
1490 | /* since *below* originator, no need to update top */ |
1479 | /* since *below* originator, no need to update top */ |
1491 | originator->below = op; |
1480 | originator->below = op; |
1492 | } |
1481 | } |
1493 | else |
1482 | else |
1494 | { |
1483 | { |
1495 | /* If there are other objects, then */ |
1484 | /* If there are other objects, then */ |
1496 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1485 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1497 | { |
1486 | { |
1498 | object * |
|
|
1499 | last = NULL; |
1487 | object *last = NULL; |
1500 | |
1488 | |
1501 | /* |
1489 | /* |
1502 | * If there are multiple objects on this space, we do some trickier handling. |
1490 | * If there are multiple objects on this space, we do some trickier handling. |
1503 | * We've already dealt with merging if appropriate. |
1491 | * We've already dealt with merging if appropriate. |
1504 | * Generally, we want to put the new object on top. But if |
1492 | * Generally, we want to put the new object on top. But if |
… | |
… | |
1513 | |
1501 | |
1514 | while (top != NULL) |
1502 | while (top != NULL) |
1515 | { |
1503 | { |
1516 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1504 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1517 | floor = top; |
1505 | floor = top; |
|
|
1506 | |
1518 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1507 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1519 | { |
1508 | { |
1520 | /* We insert above top, so we want this object below this */ |
1509 | /* We insert above top, so we want this object below this */ |
1521 | top = top->below; |
1510 | top = top->below; |
1522 | break; |
1511 | break; |
1523 | } |
1512 | } |
|
|
1513 | |
1524 | last = top; |
1514 | last = top; |
1525 | top = top->above; |
1515 | top = top->above; |
1526 | } |
1516 | } |
|
|
1517 | |
1527 | /* Don't want top to be NULL, so set it to the last valid object */ |
1518 | /* Don't want top to be NULL, so set it to the last valid object */ |
1528 | top = last; |
1519 | top = last; |
1529 | |
1520 | |
1530 | /* We let update_position deal with figuring out what the space |
1521 | /* We let update_position deal with figuring out what the space |
1531 | * looks like instead of lots of conditions here. |
1522 | * looks like instead of lots of conditions here. |
… | |
… | |
1551 | */ |
1542 | */ |
1552 | if (last && last->below && last != floor) |
1543 | if (last && last->below && last != floor) |
1553 | top = last->below; |
1544 | top = last->below; |
1554 | } |
1545 | } |
1555 | } /* If objects on this space */ |
1546 | } /* If objects on this space */ |
|
|
1547 | |
1556 | if (flag & INS_MAP_LOAD) |
1548 | if (flag & INS_MAP_LOAD) |
1557 | top = GET_MAP_TOP (op->map, op->x, op->y); |
1549 | top = GET_MAP_TOP (op->map, op->x, op->y); |
|
|
1550 | |
1558 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1551 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1559 | top = floor; |
1552 | top = floor; |
1560 | |
1553 | |
1561 | /* Top is the object that our object (op) is going to get inserted above. |
1554 | /* Top is the object that our object (op) is going to get inserted above. |
1562 | */ |
1555 | */ |
1563 | |
1556 | |
1564 | /* First object on this space */ |
1557 | /* First object on this space */ |
1565 | if (!top) |
1558 | if (!top) |
1566 | { |
1559 | { |
1567 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1560 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
|
|
1561 | |
1568 | if (op->above) |
1562 | if (op->above) |
1569 | op->above->below = op; |
1563 | op->above->below = op; |
|
|
1564 | |
1570 | op->below = NULL; |
1565 | op->below = NULL; |
1571 | SET_MAP_OB (op->map, op->x, op->y, op); |
1566 | SET_MAP_OB (op->map, op->x, op->y, op); |
1572 | } |
1567 | } |
1573 | else |
1568 | else |
1574 | { /* get inserted into the stack above top */ |
1569 | { /* get inserted into the stack above top */ |
1575 | op->above = top->above; |
1570 | op->above = top->above; |
|
|
1571 | |
1576 | if (op->above) |
1572 | if (op->above) |
1577 | op->above->below = op; |
1573 | op->above->below = op; |
|
|
1574 | |
1578 | op->below = top; |
1575 | op->below = top; |
1579 | top->above = op; |
1576 | top->above = op; |
1580 | } |
1577 | } |
|
|
1578 | |
1581 | if (op->above == NULL) |
1579 | if (op->above == NULL) |
1582 | SET_MAP_TOP (op->map, op->x, op->y, op); |
1580 | SET_MAP_TOP (op->map, op->x, op->y, op); |
1583 | } /* else not INS_BELOW_ORIGINATOR */ |
1581 | } /* else not INS_BELOW_ORIGINATOR */ |
1584 | |
1582 | |
1585 | if (op->type == PLAYER) |
1583 | if (op->type == PLAYER) |
… | |
… | |
1588 | /* If we have a floor, we know the player, if any, will be above |
1586 | /* If we have a floor, we know the player, if any, will be above |
1589 | * it, so save a few ticks and start from there. |
1587 | * it, so save a few ticks and start from there. |
1590 | */ |
1588 | */ |
1591 | if (!(flag & INS_MAP_LOAD)) |
1589 | if (!(flag & INS_MAP_LOAD)) |
1592 | for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1590 | for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1593 | { |
|
|
1594 | if (tmp->type == PLAYER) |
1591 | if (tmp->type == PLAYER) |
1595 | tmp->contr->socket.update_look = 1; |
1592 | tmp->contr->socket.update_look = 1; |
1596 | } |
|
|
1597 | |
1593 | |
1598 | /* If this object glows, it may affect lighting conditions that are |
1594 | /* If this object glows, it may affect lighting conditions that are |
1599 | * visible to others on this map. But update_all_los is really |
1595 | * visible to others on this map. But update_all_los is really |
1600 | * an inefficient way to do this, as it means los for all players |
1596 | * an inefficient way to do this, as it means los for all players |
1601 | * on the map will get recalculated. The players could very well |
1597 | * on the map will get recalculated. The players could very well |
… | |
… | |
1605 | * of effect may be sufficient. |
1601 | * of effect may be sufficient. |
1606 | */ |
1602 | */ |
1607 | if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) |
1603 | if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) |
1608 | update_all_los (op->map, op->x, op->y); |
1604 | update_all_los (op->map, op->x, op->y); |
1609 | |
1605 | |
1610 | |
|
|
1611 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1606 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1612 | update_object (op, UP_OBJ_INSERT); |
1607 | update_object (op, UP_OBJ_INSERT); |
1613 | |
|
|
1614 | |
1608 | |
1615 | /* Don't know if moving this to the end will break anything. However, |
1609 | /* Don't know if moving this to the end will break anything. However, |
1616 | * we want to have update_look set above before calling this. |
1610 | * we want to have update_look set above before calling this. |
1617 | * |
1611 | * |
1618 | * check_move_on() must be after this because code called from |
1612 | * check_move_on() must be after this because code called from |
… | |
… | |
1620 | * blocked() and wall() work properly), and these flags are updated by |
1614 | * blocked() and wall() work properly), and these flags are updated by |
1621 | * update_object(). |
1615 | * update_object(). |
1622 | */ |
1616 | */ |
1623 | |
1617 | |
1624 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1618 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1625 | |
|
|
1626 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1619 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1627 | { |
1620 | { |
1628 | if (check_move_on (op, originator)) |
1621 | if (check_move_on (op, originator)) |
1629 | return NULL; |
1622 | return NULL; |
1630 | |
1623 | |
… | |
… | |
1633 | */ |
1626 | */ |
1634 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1627 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1635 | if (check_move_on (tmp, originator)) |
1628 | if (check_move_on (tmp, originator)) |
1636 | return NULL; |
1629 | return NULL; |
1637 | } |
1630 | } |
|
|
1631 | |
1638 | return op; |
1632 | return op; |
1639 | } |
1633 | } |
1640 | |
1634 | |
1641 | /* this function inserts an object in the map, but if it |
1635 | /* this function inserts an object in the map, but if it |
1642 | * finds an object of its own type, it'll remove that one first. |
1636 | * finds an object of its own type, it'll remove that one first. |
… | |
… | |
1660 | free_object (tmp); |
1654 | free_object (tmp); |
1661 | } |
1655 | } |
1662 | } |
1656 | } |
1663 | |
1657 | |
1664 | tmp1 = arch_to_object (find_archetype (arch_string)); |
1658 | tmp1 = arch_to_object (find_archetype (arch_string)); |
1665 | |
|
|
1666 | |
1659 | |
1667 | tmp1->x = op->x; |
1660 | tmp1->x = op->x; |
1668 | tmp1->y = op->y; |
1661 | tmp1->y = op->y; |
1669 | insert_ob_in_map (tmp1, op->map, op, 0); |
1662 | insert_ob_in_map (tmp1, op->map, op, 0); |
1670 | } |
1663 | } |
… | |
… | |
1688 | if (orig_ob->nrof < nr) |
1681 | if (orig_ob->nrof < nr) |
1689 | { |
1682 | { |
1690 | 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); |
1691 | return NULL; |
1684 | return NULL; |
1692 | } |
1685 | } |
|
|
1686 | |
1693 | newob = object_create_clone (orig_ob); |
1687 | newob = object_create_clone (orig_ob); |
|
|
1688 | |
1694 | if ((orig_ob->nrof -= nr) < 1) |
1689 | if ((orig_ob->nrof -= nr) < 1) |
1695 | { |
1690 | { |
1696 | if (!is_removed) |
1691 | if (!is_removed) |
1697 | remove_ob (orig_ob); |
1692 | remove_ob (orig_ob); |
1698 | free_object2 (orig_ob, 1); |
1693 | free_object2 (orig_ob, 1); |
… | |
… | |
1706 | 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."); |
1707 | 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"); |
1708 | return NULL; |
1703 | return NULL; |
1709 | } |
1704 | } |
1710 | } |
1705 | } |
|
|
1706 | |
1711 | newob->nrof = nr; |
1707 | newob->nrof = nr; |
1712 | |
1708 | |
1713 | return newob; |
1709 | return newob; |
1714 | } |
1710 | } |
1715 | |
1711 | |
… | |
… | |
1722 | */ |
1718 | */ |
1723 | |
1719 | |
1724 | object * |
1720 | object * |
1725 | decrease_ob_nr (object *op, uint32 i) |
1721 | decrease_ob_nr (object *op, uint32 i) |
1726 | { |
1722 | { |
1727 | object * |
1723 | object *tmp; |
1728 | tmp; |
|
|
1729 | player * |
1724 | player *pl; |
1730 | pl; |
|
|
1731 | |
1725 | |
1732 | if (i == 0) /* objects with op->nrof require this check */ |
1726 | if (i == 0) /* objects with op->nrof require this check */ |
1733 | return op; |
1727 | return op; |
1734 | |
1728 | |
1735 | if (i > op->nrof) |
1729 | if (i > op->nrof) |
1736 | i = op->nrof; |
1730 | i = op->nrof; |
1737 | |
1731 | |
1738 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1732 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1739 | { |
|
|
1740 | op->nrof -= i; |
1733 | op->nrof -= i; |
1741 | } |
|
|
1742 | else if (op->env != NULL) |
1734 | else if (op->env != NULL) |
1743 | { |
1735 | { |
1744 | /* is this object in the players inventory, or sub container |
1736 | /* is this object in the players inventory, or sub container |
1745 | * therein? |
1737 | * therein? |
1746 | */ |
1738 | */ |
… | |
… | |
1781 | } |
1773 | } |
1782 | } |
1774 | } |
1783 | } |
1775 | } |
1784 | else |
1776 | else |
1785 | { |
1777 | { |
1786 | object * |
|
|
1787 | above = op->above; |
1778 | object *above = op->above; |
1788 | |
1779 | |
1789 | if (i < op->nrof) |
1780 | if (i < op->nrof) |
1790 | { |
|
|
1791 | op->nrof -= i; |
1781 | op->nrof -= i; |
1792 | } |
|
|
1793 | else |
1782 | else |
1794 | { |
1783 | { |
1795 | remove_ob (op); |
1784 | remove_ob (op); |
1796 | op->nrof = 0; |
1785 | op->nrof = 0; |
1797 | } |
1786 | } |
|
|
1787 | |
1798 | /* Since we just removed op, op->above is null */ |
1788 | /* Since we just removed op, op->above is null */ |
1799 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
1789 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
1800 | if (tmp->type == PLAYER) |
1790 | if (tmp->type == PLAYER) |
1801 | { |
1791 | { |
1802 | if (op->nrof) |
1792 | if (op->nrof) |
… | |
… | |
1805 | esrv_del_item (tmp->contr, op->count); |
1795 | esrv_del_item (tmp->contr, op->count); |
1806 | } |
1796 | } |
1807 | } |
1797 | } |
1808 | |
1798 | |
1809 | if (op->nrof) |
1799 | if (op->nrof) |
1810 | { |
|
|
1811 | return op; |
1800 | return op; |
1812 | } |
|
|
1813 | else |
1801 | else |
1814 | { |
1802 | { |
1815 | free_object (op); |
1803 | free_object (op); |
1816 | return NULL; |
1804 | return NULL; |
1817 | } |
1805 | } |
… | |
… | |
1826 | add_weight (object *op, signed long weight) |
1814 | add_weight (object *op, signed long weight) |
1827 | { |
1815 | { |
1828 | while (op != NULL) |
1816 | while (op != NULL) |
1829 | { |
1817 | { |
1830 | if (op->type == CONTAINER) |
1818 | if (op->type == CONTAINER) |
1831 | { |
|
|
1832 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
1819 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
1833 | } |
1820 | |
1834 | op->carrying += weight; |
1821 | op->carrying += weight; |
1835 | op = op->env; |
1822 | op = op->env; |
1836 | } |
1823 | } |
1837 | } |
1824 | } |
1838 | |
1825 | |
… | |
… | |
1861 | { |
1848 | { |
1862 | dump_object (op); |
1849 | dump_object (op); |
1863 | 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); |
1864 | return op; |
1851 | return op; |
1865 | } |
1852 | } |
|
|
1853 | |
1866 | if (where == NULL) |
1854 | if (where == NULL) |
1867 | { |
1855 | { |
1868 | dump_object (op); |
1856 | dump_object (op); |
1869 | 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); |
1870 | return op; |
1858 | return op; |
1871 | } |
1859 | } |
|
|
1860 | |
1872 | if (where->head) |
1861 | if (where->head) |
1873 | { |
1862 | { |
1874 | 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"); |
1875 | where = where->head; |
1864 | where = where->head; |
1876 | } |
1865 | } |
|
|
1866 | |
1877 | if (op->more) |
1867 | if (op->more) |
1878 | { |
1868 | { |
1879 | 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); |
1880 | return op; |
1870 | return op; |
1881 | } |
1871 | } |
|
|
1872 | |
1882 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1873 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1883 | CLEAR_FLAG (op, FLAG_REMOVED); |
1874 | CLEAR_FLAG (op, FLAG_REMOVED); |
1884 | if (op->nrof) |
1875 | if (op->nrof) |
1885 | { |
1876 | { |
1886 | for (tmp = where->inv; tmp != NULL; tmp = tmp->below) |
1877 | for (tmp = where->inv; tmp != NULL; tmp = tmp->below) |
… | |
… | |
1979 | tag; |
1970 | tag; |
1980 | mapstruct * |
1971 | mapstruct * |
1981 | m = op->map; |
1972 | m = op->map; |
1982 | int |
1973 | int |
1983 | x = op->x, y = op->y; |
1974 | x = op->x, y = op->y; |
|
|
1975 | |
1984 | MoveType |
1976 | MoveType |
1985 | move_on, |
1977 | move_on, |
1986 | move_slow, |
1978 | move_slow, |
1987 | move_block; |
1979 | move_block; |
1988 | |
1980 | |
… | |
… | |
2022 | * we don't need to check all of them. |
2014 | * we don't need to check all of them. |
2023 | */ |
2015 | */ |
2024 | if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK)) |
2016 | if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK)) |
2025 | break; |
2017 | break; |
2026 | } |
2018 | } |
|
|
2019 | |
2027 | for (; tmp != NULL; tmp = tmp->below) |
2020 | for (; tmp; tmp = tmp->below) |
2028 | { |
2021 | { |
2029 | if (tmp == op) |
2022 | if (tmp == op) |
2030 | continue; /* Can't apply yourself */ |
2023 | continue; /* Can't apply yourself */ |
2031 | |
2024 | |
2032 | /* Check to see if one of the movement types should be slowed down. |
2025 | /* Check to see if one of the movement types should be slowed down. |
… | |
… | |
2040 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
2033 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
2041 | ((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)) |
2042 | { |
2035 | { |
2043 | |
2036 | |
2044 | float |
2037 | float |
2045 | diff; |
|
|
2046 | |
|
|
2047 | diff = tmp->move_slow_penalty * FABS (op->speed); |
2038 | diff = tmp->move_slow_penalty * FABS (op->speed); |
|
|
2039 | |
2048 | if (op->type == PLAYER) |
2040 | if (op->type == PLAYER) |
2049 | { |
|
|
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 | { |
|
|
2053 | diff /= 4.0; |
2043 | diff /= 4.0; |
2054 | } |
2044 | |
2055 | } |
|
|
2056 | op->speed_left -= diff; |
2045 | op->speed_left -= diff; |
2057 | } |
2046 | } |
2058 | } |
2047 | } |
2059 | |
2048 | |
2060 | /* Basically same logic as above, except now for actual apply. */ |
2049 | /* Basically same logic as above, except now for actual apply. */ |
2061 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
2050 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
2062 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
2051 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
2063 | { |
2052 | { |
2064 | |
|
|
2065 | move_apply (tmp, op, originator); |
2053 | move_apply (tmp, op, originator); |
|
|
2054 | |
2066 | if (was_destroyed (op, tag)) |
2055 | if (was_destroyed (op, tag)) |
2067 | return 1; |
2056 | return 1; |
2068 | |
2057 | |
2069 | /* what the person/creature stepped onto has moved the object |
2058 | /* what the person/creature stepped onto has moved the object |
2070 | * someplace new. Don't process any further - if we did, |
2059 | * someplace new. Don't process any further - if we did, |
… | |
… | |
2072 | */ |
2061 | */ |
2073 | if (op->map != m || op->x != x || op->y != y) |
2062 | if (op->map != m || op->x != x || op->y != y) |
2074 | return 0; |
2063 | return 0; |
2075 | } |
2064 | } |
2076 | } |
2065 | } |
|
|
2066 | |
2077 | return 0; |
2067 | return 0; |
2078 | } |
2068 | } |
2079 | |
2069 | |
2080 | /* |
2070 | /* |
2081 | * present_arch(arch, map, x, y) searches for any objects with |
2071 | * present_arch(arch, map, x, y) searches for any objects with |
… | |
… | |
2372 | find_dir (mapstruct *m, int x, int y, object *exclude) |
2362 | find_dir (mapstruct *m, int x, int y, object *exclude) |
2373 | { |
2363 | { |
2374 | int |
2364 | int |
2375 | i, |
2365 | i, |
2376 | max = SIZEOFFREE, mflags; |
2366 | max = SIZEOFFREE, mflags; |
2377 | sint16 |
2367 | |
2378 | nx, |
2368 | sint16 nx, ny; |
2379 | ny; |
|
|
2380 | object * |
2369 | object * |
2381 | tmp; |
2370 | tmp; |
2382 | mapstruct * |
2371 | mapstruct * |
2383 | mp; |
2372 | mp; |
2384 | MoveType |
2373 | |
2385 | blocked, |
2374 | MoveType blocked, move_type; |
2386 | move_type; |
|
|
2387 | |
2375 | |
2388 | if (exclude && exclude->head) |
2376 | if (exclude && exclude->head) |
2389 | { |
2377 | { |
2390 | exclude = exclude->head; |
2378 | exclude = exclude->head; |
2391 | move_type = exclude->move_type; |
2379 | move_type = exclude->move_type; |
… | |
… | |
2598 | |
2586 | |
2599 | |
2587 | |
2600 | int |
2588 | int |
2601 | can_see_monsterP (mapstruct *m, int x, int y, int dir) |
2589 | can_see_monsterP (mapstruct *m, int x, int y, int dir) |
2602 | { |
2590 | { |
2603 | sint16 |
2591 | sint16 dx, dy; |
2604 | dx, |
|
|
2605 | dy; |
|
|
2606 | int |
2592 | int |
2607 | mflags; |
2593 | mflags; |
2608 | |
2594 | |
2609 | if (dir < 0) |
2595 | if (dir < 0) |
2610 | return 0; /* exit condition: invalid direction */ |
2596 | return 0; /* exit condition: invalid direction */ |
… | |
… | |
2735 | |
2721 | |
2736 | if (tempfile == NULL) |
2722 | if (tempfile == NULL) |
2737 | { |
2723 | { |
2738 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2724 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2739 | return NULL; |
2725 | return NULL; |
2740 | }; |
2726 | } |
|
|
2727 | |
2741 | fprintf (tempfile, obstr); |
2728 | fprintf (tempfile, obstr); |
2742 | fclose (tempfile); |
2729 | fclose (tempfile); |
2743 | |
2730 | |
2744 | op = get_object (); |
2731 | op = get_object (); |
2745 | |
2732 | |
2746 | object_thawer |
2733 | object_thawer thawer (filename); |
2747 | thawer (filename); |
|
|
2748 | |
2734 | |
2749 | if (thawer) |
2735 | if (thawer) |
2750 | load_object (thawer, op, 0); |
2736 | load_object (thawer, op, 0); |
2751 | |
2737 | |
2752 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
2738 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
… | |
… | |
2803 | * The returned string is shared. |
2789 | * The returned string is shared. |
2804 | */ |
2790 | */ |
2805 | const char * |
2791 | const char * |
2806 | get_ob_key_value (const object *op, const char *const key) |
2792 | get_ob_key_value (const object *op, const char *const key) |
2807 | { |
2793 | { |
2808 | key_value * |
2794 | key_value *link; |
2809 | link; |
2795 | shstr_cmp canonical_key (key); |
2810 | const char * |
|
|
2811 | canonical_key; |
|
|
2812 | |
2796 | |
2813 | canonical_key = shstr::find (key); |
|
|
2814 | |
|
|
2815 | if (canonical_key == NULL) |
2797 | if (!canonical_key) |
2816 | { |
2798 | { |
2817 | /* 1. There being a field named key on any object |
2799 | /* 1. There being a field named key on any object |
2818 | * implies there'd be a shared string to find. |
2800 | * implies there'd be a shared string to find. |
2819 | * 2. Since there isn't, no object has this field. |
2801 | * 2. Since there isn't, no object has this field. |
2820 | * 3. Therefore, *this* object doesn't have this field. |
2802 | * 3. Therefore, *this* object doesn't have this field. |
2821 | */ |
2803 | */ |
2822 | return NULL; |
2804 | return 0; |
2823 | } |
2805 | } |
2824 | |
2806 | |
2825 | /* This is copied from get_ob_key_link() above - |
2807 | /* This is copied from get_ob_key_link() above - |
2826 | * only 4 lines, and saves the function call overhead. |
2808 | * only 4 lines, and saves the function call overhead. |
2827 | */ |
2809 | */ |
2828 | for (link = op->key_values; link != NULL; link = link->next) |
2810 | for (link = op->key_values; link; link = link->next) |
2829 | { |
|
|
2830 | if (link->key == canonical_key) |
2811 | if (link->key == canonical_key) |
2831 | { |
|
|
2832 | return link->value; |
2812 | return link->value; |
2833 | } |
2813 | |
2834 | } |
|
|
2835 | return NULL; |
2814 | return 0; |
2836 | } |
2815 | } |
2837 | |
2816 | |
2838 | |
2817 | |
2839 | /* |
2818 | /* |
2840 | * Updates the canonical_key in op to value. |
2819 | * Updates the canonical_key in op to value. |
… | |
… | |
2876 | if (last) |
2855 | if (last) |
2877 | last->next = field->next; |
2856 | last->next = field->next; |
2878 | else |
2857 | else |
2879 | op->key_values = field->next; |
2858 | op->key_values = field->next; |
2880 | |
2859 | |
2881 | delete |
|
|
2882 | field; |
2860 | delete field; |
2883 | } |
2861 | } |
2884 | } |
2862 | } |
2885 | return TRUE; |
2863 | return TRUE; |
2886 | } |
2864 | } |
2887 | /* IF we get here, key doesn't exist */ |
2865 | /* IF we get here, key doesn't exist */ |
… | |
… | |
2922 | * Returns TRUE on success. |
2900 | * Returns TRUE on success. |
2923 | */ |
2901 | */ |
2924 | int |
2902 | int |
2925 | 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) |
2926 | { |
2904 | { |
2927 | shstr |
|
|
2928 | key_ (key); |
2905 | shstr key_ (key); |
2929 | |
2906 | |
2930 | return set_ob_key_value_s (op, key_, value, add_key); |
2907 | return set_ob_key_value_s (op, key_, value, add_key); |
2931 | } |
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 | |