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

Comparing deliantra/server/common/friend.C (file contents):
Revision 1.6 by root, Thu Sep 14 22:33:58 2006 UTC vs.
Revision 1.24 by root, Fri Mar 26 00:59:20 2010 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
8 it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
9 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 11 * 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 Affero GNU General Public License
18 along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22*/ 23 */
23 24
24#include <global.h> 25#include <global.h>
25 26
26/* 27/*
27 * Add a new friendly object to the linked list of friendly objects. 28 * Add a new friendly object to the linked list of friendly objects.
28 * No checking to see if the object is already in the linked list is done. 29 * No checking to see if the object is already in the linked list is done.
29 */ 30 */
30
31void 31void
32add_friendly_object (object *op) 32add_friendly_object (object *op)
33{ 33{
34 op->flag [FLAG_FRIENDLY] = 1;
35
34 objectlink *ol; 36 objectlink *ol;
35 37
36 /* Add some error checking. This shouldn't happen, but the friendly 38 /* Add some error checking. This shouldn't happen, but the friendly
37 * object list usually isn't very long, and remove_friendly_object 39 * object list usually isn't very long, and remove_friendly_object
38 * won't remove it either. Plus, it is easier to put a breakpoint in 40 * won't remove it either. Plus, it is easier to put a breakpoint in
39 * the debugger here and see where the problem is happening. 41 * the debugger here and see where the problem is happening.
40 */ 42 */
41 for (ol = first_friendly_object; ol != NULL; ol = ol->next) 43 for (ol = first_friendly_object; ol; ol = ol->next)
42 { 44 {
43 if (ol->ob == op) 45 if (ol->ob == op)
44 { 46 {
45 LOG (llevError, "add_friendly_object: Trying to add object already on list (%s)\n", &op->name); 47 LOG (llevError | logBacktrace, "add_friendly_object: Trying to add object already on list (%s)\n", &op->name);
46 return; 48 return;
47 } 49 }
48 } 50 }
49 51
50 ol = first_friendly_object; 52 ol = first_friendly_object;
51 first_friendly_object = get_objectlink (); 53 first_friendly_object = get_objectlink ();
52 first_friendly_object->ob = op; 54 first_friendly_object->ob = op;
53 first_friendly_object->id = op->count;
54 first_friendly_object->next = ol; 55 first_friendly_object->next = ol;
55} 56}
56 57
57/* 58/*
58 * Removes the specified object from the linked list of friendly objects. 59 * Removes the specified object from the linked list of friendly objects.
59 */ 60 */
60
61void 61void
62remove_friendly_object (object *op) 62remove_friendly_object (object *op)
63{ 63{
64 objectlink *obj; 64 objectlink *obj;
65 65
66 CLEAR_FLAG (op, FLAG_FRIENDLY); 66 CLEAR_FLAG (op, FLAG_FRIENDLY);
67 67
68 if (op->type == GOLEM
69 && op->owner
70 && op->owner->contr
71 && op->owner->contr->golem == op)
72 op->owner->contr->golem = 0;
73
68 if (!first_friendly_object) 74 if (!first_friendly_object)
69 { 75 {
70 LOG (llevError, "remove_friendly_object called with empty friendly list, remove ob=%s\n", &op->name); 76 LOG (llevError, "remove_friendly_object called with empty friendly list, remove ob=%s\n", &op->name);
71 return; 77 return;
72 } 78 }
79
73 /* if the first object happens to be the one, processing is pretty 80 /* if the first object happens to be the one, processing is pretty
74 * easy. 81 * easy.
75 */ 82 */
76 if (first_friendly_object->ob == op) 83 if (first_friendly_object->ob == op)
77 { 84 {
78 obj = first_friendly_object; 85 obj = first_friendly_object;
79 first_friendly_object = obj->next; 86 first_friendly_object = obj->next;
80 free (obj); 87 delete obj;
81 } 88 }
82 else 89 else
83 { 90 {
84 objectlink *prev = first_friendly_object; 91 objectlink *prev = first_friendly_object;
85 92
86 for (obj = first_friendly_object->next; obj != NULL; obj = obj->next) 93 for (obj = first_friendly_object->next; obj; obj = obj->next)
87 { 94 {
88 if (obj->ob == op) 95 if (obj->ob == op)
89 break; 96 break;
97
90 prev = obj; 98 prev = obj;
91 } 99 }
100
92 if (obj) 101 if (obj)
93 { 102 {
94 /* This should not happen. But if it does, presumably the
95 * call to remove it is still valid.
96 */
97 if (obj->id != op->count)
98 {
99 LOG (llevError, "remove_friendly_object, tags do no match, %s, %d != %d\n",
100 op->name ? (const char *) op->name : "none", op->count, obj->id);
101 }
102 prev->next = obj->next; 103 prev->next = obj->next;
103 free (obj); 104 delete obj;
104 } 105 }
105 } 106 }
106}
107
108/*
109 * Dumps all friendly objects. Invoked in DM-mode with the G key.
110 */
111
112void
113dump_friendly_objects (void)
114{
115 objectlink *ol;
116
117 for (ol = first_friendly_object; ol != NULL; ol = ol->next)
118 LOG (llevError, "%s (%d)\n", &ol->ob->name, ol->ob->count);
119} 107}
120 108
121/* New function, MSW 2000-1-14 109/* New function, MSW 2000-1-14
122 * It traverses the friendly list removing objects that should not be here 110 * It traverses the friendly list removing objects that should not be here
123 * (ie, do not have friendly flag set, freed, etc) 111 * (ie, do not have friendly flag set, freed, etc)
124 */ 112 */
125void 113void
126clean_friendly_list (void) 114clean_friendly_list ()
127{ 115{
128 objectlink *obj, *prev = NULL, *next; 116 objectlink *obj, *prev = NULL, *next;
129 int count = 0; 117 int count = 0;
130 118
131 for (obj = first_friendly_object; obj != NULL; obj = next) 119 for (obj = first_friendly_object; obj; obj = next)
132 { 120 {
133 next = obj->next; 121 next = obj->next;
134 if (QUERY_FLAG (obj->ob, FLAG_FREED) || !QUERY_FLAG (obj->ob, FLAG_FRIENDLY) || (obj->id != obj->ob->count)) 122 if (QUERY_FLAG (obj->ob, FLAG_FREED) || !QUERY_FLAG (obj->ob, FLAG_FRIENDLY))
135 { 123 {
136 if (prev) 124 if (prev)
137 {
138 prev->next = obj->next; 125 prev->next = obj->next;
139 }
140 else 126 else
141 {
142 first_friendly_object = obj->next; 127 first_friendly_object = obj->next;
143 } 128
144 count++; 129 count++;
145 free (obj); 130 delete obj;
146 } 131 }
147 /* If we removed the object, then prev is still valid. */
148 else 132 else
133 /* If we removed the object, then prev is still valid. */
149 prev = obj; 134 prev = obj;
150 } 135 }
136
151 if (count) 137 if (count)
152 LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count); 138 LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count);
153} 139}
154 140
155/* Checks if the given object is already in the friendly list or not
156 * Lauwenmark - 31/07/05
157 */
158int
159is_friendly (const object *op)
160{
161 objectlink *ol;
162
163 for (ol = first_friendly_object; ol != NULL; ol = ol->next)
164 if (ol->ob == op)
165 return 1;
166
167 return 0;
168}

Diff Legend

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