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.5 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.16 by root, Sun Jul 1 05:00:17 2007 UTC

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

Diff Legend

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