ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.106 by root, Wed Jan 3 20:08:04 2007 UTC vs.
Revision 1.116 by pippijn, Mon Jan 15 21:06:18 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 23 */
23 24
24/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25 sub/add_weight will transcend the environment updating the carrying 26 sub/add_weight will transcend the environment updating the carrying
26 variable. */ 27 variable. */
27#include <global.h> 28#include <global.h>
… …
36 37
37int nrofallocobjects = 0; 38int nrofallocobjects = 0;
38static UUID uuid; 39static UUID uuid;
39const uint64 UUID_SKIP = 1<<19; 40const uint64 UUID_SKIP = 1<<19;
40 41
41object *active_objects; /* List of active objects that need to be processed */ 42objectvec objects;
43activevec actives;
42 44
43short 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, 45short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
44 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 46 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
45}; 47};
46short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, 48short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
… …
390} 392}
391 393
392/* 394/*
393 * Returns the object which has the count-variable equal to the argument. 395 * Returns the object which has the count-variable equal to the argument.
394 */ 396 */
395
396object * 397object *
397find_object (tag_t i) 398find_object (tag_t i)
398{ 399{
399 for (object *op = object::first; op; op = op->next) 400 for_all_objects (op)
400 if (op->count == i) 401 if (op->count == i)
401 return op; 402 return op;
402 403
403 return 0; 404 return 0;
404} 405}
405 406
406/* 407/*
407 * Returns the first object which has a name equal to the argument. 408 * Returns the first object which has a name equal to the argument.
408 * Used only by the patch command, but not all that useful. 409 * Used only by the patch command, but not all that useful.
409 * Enables features like "patch <name-of-other-player> food 999" 410 * Enables features like "patch <name-of-other-player> food 999"
410 */ 411 */
411
412object * 412object *
413find_object_name (const char *str) 413find_object_name (const char *str)
414{ 414{
415 shstr_cmp str_ (str); 415 shstr_cmp str_ (str);
416 object *op; 416 object *op;
417 417
418 for (op = object::first; op != NULL; op = op->next) 418 for_all_objects (op)
419 if (op->name == str_) 419 if (op->name == str_)
420 break; 420 break;
421 421
422 return op; 422 return op;
423} 423}
… …
660 660
661 if (op->more) 661 if (op->more)
662 update_object (op->more, action); 662 update_object (op->more, action);
663} 663}
664 664
665object *object::first;
666
667object::object () 665object::object ()
668{ 666{
669 SET_FLAG (this, FLAG_REMOVED); 667 SET_FLAG (this, FLAG_REMOVED);
670 668
671 expmul = 1.0; 669 expmul = 1.0;
… …
675object::~object () 673object::~object ()
676{ 674{
677 free_key_values (this); 675 free_key_values (this);
678} 676}
679 677
678static int object_count;
679
680void object::link () 680void object::link ()
681{ 681{
682 count = ++ob_count; 682 assert (!index);//D
683 uuid = gen_uuid (); 683 uuid = gen_uuid ();
684 count = ++object_count;
684 685
685 prev = 0; 686 refcnt_inc ();
686 next = object::first; 687 objects.insert (this);
687
688 if (object::first)
689 object::first->prev = this;
690
691 object::first = this;
692} 688}
693 689
694void object::unlink () 690void object::unlink ()
695{ 691{
696 if (this == object::first) 692 assert (index);//D
697 object::first = next; 693 objects.erase (this);
698 694 refcnt_dec ();
699 /* Remove this object from the list of used objects */
700 if (prev) prev->next = next;
701 if (next) next->prev = prev;
702
703 prev = 0;
704 next = 0;
705}
706
707bool
708object::active () const
709{
710 return active_next || active_prev || this == active_objects;
711} 695}
712 696
713void 697void
714object::activate () 698object::activate ()
715{ 699{
716 /* If already on active list, don't do anything */ 700 /* If already on active list, don't do anything */
717 if (active ()) 701 if (active)
718 return; 702 return;
719 703
720 if (has_active_speed ()) 704 if (has_active_speed ())
721 { 705 actives.insert (this);
722 /* process_events() expects us to insert the object at the beginning
723 * of the list. */
724 active_next = active_objects;
725
726 if (active_next)
727 active_next->active_prev = this;
728
729 active_objects = this;
730 }
731} 706}
732 707
733void 708void
734object::activate_recursive () 709object::activate_recursive ()
735{ 710{
… …
749 */ 724 */
750void 725void
751object::deactivate () 726object::deactivate ()
752{ 727{
753 /* If not on the active list, nothing needs to be done */ 728 /* If not on the active list, nothing needs to be done */
754 if (!active ()) 729 if (!active)
755 return; 730 return;
756 731
757 if (active_prev == 0) 732 actives.erase (this);
758 {
759 active_objects = active_next;
760 if (active_next)
761 active_next->active_prev = 0;
762 }
763 else
764 {
765 active_prev->active_next = active_next;
766 if (active_next)
767 active_next->active_prev = active_prev;
768 }
769
770 active_next = 0;
771 active_prev = 0;
772} 733}
773 734
774void 735void
775object::deactivate_recursive () 736object::deactivate_recursive ()
776{ 737{
… …
828 789
829 if (op->flag [FLAG_STARTEQUIP] 790 if (op->flag [FLAG_STARTEQUIP]
830 || op->flag [FLAG_NO_DROP] 791 || op->flag [FLAG_NO_DROP]
831 || op->type == RUNE 792 || op->type == RUNE
832 || op->type == TRAP 793 || op->type == TRAP
833 || op->flag [FLAG_IS_A_TEMPLATE]) 794 || op->flag [FLAG_IS_A_TEMPLATE]
795 || op->flag [FLAG_DESTROY_ON_DEATH])
834 op->destroy (); 796 op->destroy ();
835 else 797 else
836 map->insert (op, x, y); 798 map->insert (op, x, y);
837 } 799 }
838 } 800 }
… …
846} 808}
847 809
848void 810void
849object::do_destroy () 811object::do_destroy ()
850{ 812{
813 attachable::do_destroy ();
814
851 if (flag [FLAG_IS_LINKED]) 815 if (flag [FLAG_IS_LINKED])
852 remove_button_link (this); 816 remove_button_link (this);
853 817
854 if (flag [FLAG_FRIENDLY]) 818 if (flag [FLAG_FRIENDLY])
855 remove_friendly_object (this); 819 remove_friendly_object (this);
856 820
857 if (!flag [FLAG_REMOVED]) 821 if (!flag [FLAG_REMOVED])
858 remove (); 822 remove ();
859 823
860 if (flag [FLAG_FREED]) 824 destroy_inv (true);
861 return;
862 825
863 set_speed (0); 826 deactivate ();
827 unlink ();
864 828
865 flag [FLAG_FREED] = 1; 829 flag [FLAG_FREED] = 1;
866
867 attachable::do_destroy ();
868
869 destroy_inv (true);
870 unlink ();
871 830
872 // hack to ensure that freed objects still have a valid map 831 // hack to ensure that freed objects still have a valid map
873 { 832 {
874 static maptile *freed_map; // freed objects are moved here to avoid crashes 833 static maptile *freed_map; // freed objects are moved here to avoid crashes
875 834
… …
900 859
901 // clear those pointers that likely might have circular references to us 860 // clear those pointers that likely might have circular references to us
902 owner = 0; 861 owner = 0;
903 enemy = 0; 862 enemy = 0;
904 attacked_by = 0; 863 attacked_by = 0;
905
906 // only relevant for players(?), but make sure of it anyways
907 contr = 0;
908} 864}
909 865
910void 866void
911object::destroy (bool destroy_inventory) 867object::destroy (bool destroy_inventory)
912{ 868{
… …
2207 2163
2208 return 3; 2164 return 3;
2209} 2165}
2210 2166
2211/* 2167/*
2212 * absdir(int): Returns a number between 1 and 8, which represent
2213 * the "absolute" direction of a number (it actually takes care of
2214 * "overflow" in previous calculations of a direction).
2215 */
2216
2217int
2218absdir (int d)
2219{
2220 while (d < 1)
2221 d += 8;
2222
2223 while (d > 8)
2224 d -= 8;
2225
2226 return d;
2227}
2228
2229/*
2230 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2168 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2231 * between two directions (which are expected to be absolute (see absdir()) 2169 * between two directions (which are expected to be absolute (see absdir())
2232 */ 2170 */
2233
2234int 2171int
2235dirdiff (int dir1, int dir2) 2172dirdiff (int dir1, int dir2)
2236{ 2173{
2237 int d; 2174 int d;
2238 2175
… …
2677{ 2614{
2678 static char info[256 * 4]; 2615 static char info[256 * 4];
2679 return debug_desc (info); 2616 return debug_desc (info);
2680} 2617}
2681 2618
2619const char *
2620object::debug_desc2 () const
2621{
2622 static char info[256 * 4];
2623 return debug_desc (info);
2624}
2625

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines