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.11 by root, Tue Apr 24 12:32:14 2007 UTC

1
2/* 1/*
3 * static char *rcsid_friend_c = 2 * CrossFire, A Multiplayer game for X-windows
4 * "$Id: friend.C,v 1.5 2006/09/10 16:00:23 root Exp $"; 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen
7 *
8 * This program 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 2 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, write to the Free Software
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
5 */ 23 */
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 24
30#include <global.h> 25#include <global.h>
31 26
32/* 27/*
33 * 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.
34 * 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.
35 */ 30 */
36
37void 31void
38add_friendly_object (object *op) 32add_friendly_object (object *op)
39{ 33{
34 op->flag [FLAG_FRIENDLY] = 1;
35
40 objectlink *ol; 36 objectlink *ol;
41 37
42 /* Add some error checking. This shouldn't happen, but the friendly 38 /* Add some error checking. This shouldn't happen, but the friendly
43 * object list usually isn't very long, and remove_friendly_object 39 * 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 40 * 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. 41 * the debugger here and see where the problem is happening.
46 */ 42 */
47 for (ol = first_friendly_object; ol != NULL; ol = ol->next) 43 for (ol = first_friendly_object; ol; ol = ol->next)
48 { 44 {
49 if (ol->ob == op) 45 if (ol->ob == op)
50 { 46 {
51 LOG (llevError, "add_friendly_object: Trying to add object already on list (%s)\n", &op->name); 47 LOG (llevError, "add_friendly_object: Trying to add object already on list (%s)\n", &op->name);
52 return; 48 return;
… …
54 } 50 }
55 51
56 ol = first_friendly_object; 52 ol = first_friendly_object;
57 first_friendly_object = get_objectlink (); 53 first_friendly_object = get_objectlink ();
58 first_friendly_object->ob = op; 54 first_friendly_object->ob = op;
59 first_friendly_object->id = op->count;
60 first_friendly_object->next = ol; 55 first_friendly_object->next = ol;
61} 56}
62 57
63/* 58/*
64 * Removes the specified object from the linked list of friendly objects. 59 * Removes the specified object from the linked list of friendly objects.
65 */ 60 */
66
67void 61void
68remove_friendly_object (object *op) 62remove_friendly_object (object *op)
69{ 63{
70 objectlink *obj; 64 objectlink *obj;
71 65
72 CLEAR_FLAG (op, FLAG_FRIENDLY); 66 CLEAR_FLAG (op, FLAG_FRIENDLY);
73 67
68 if (op->type == GOLEM
69 && op->owner
70 && op->owner->contr
71 && op->owner->contr->ranges[range_golem] == op)
72 {
73 op->owner->contr->ranges[range_golem] = 0;
74 op->owner->contr->shoottype = range_none;
75 }
76
74 if (!first_friendly_object) 77 if (!first_friendly_object)
75 { 78 {
76 LOG (llevError, "remove_friendly_object called with empty friendly list, remove ob=%s\n", &op->name); 79 LOG (llevError, "remove_friendly_object called with empty friendly list, remove ob=%s\n", &op->name);
77 return; 80 return;
78 } 81 }
82
79 /* if the first object happens to be the one, processing is pretty 83 /* if the first object happens to be the one, processing is pretty
80 * easy. 84 * easy.
81 */ 85 */
82 if (first_friendly_object->ob == op) 86 if (first_friendly_object->ob == op)
83 { 87 {
84 obj = first_friendly_object; 88 obj = first_friendly_object;
85 first_friendly_object = obj->next; 89 first_friendly_object = obj->next;
86 free (obj); 90 delete obj;
87 } 91 }
88 else 92 else
89 { 93 {
90 objectlink *prev = first_friendly_object; 94 objectlink *prev = first_friendly_object;
91 95
92 for (obj = first_friendly_object->next; obj != NULL; obj = obj->next) 96 for (obj = first_friendly_object->next; obj; obj = obj->next)
93 { 97 {
94 if (obj->ob == op) 98 if (obj->ob == op)
95 break; 99 break;
100
96 prev = obj; 101 prev = obj;
97 } 102 }
103
98 if (obj) 104 if (obj)
99 { 105 {
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; 106 prev->next = obj->next;
109 free (obj); 107 delete obj;
110 } 108 }
111 } 109 }
112} 110}
113 111
114/* 112/*
115 * Dumps all friendly objects. Invoked in DM-mode with the G key. 113 * Dumps all friendly objects.
116 */ 114 */
117
118void 115void
119dump_friendly_objects (void) 116dump_friendly_objects (void)
120{ 117{
121 objectlink *ol; 118 objectlink *ol;
122 119
123 for (ol = first_friendly_object; ol != NULL; ol = ol->next) 120 for (ol = first_friendly_object; ol; ol = ol->next)
124 LOG (llevError, "%s (%d)\n", &ol->ob->name, ol->ob->count); 121 LOG (llevError, "%s (%d)\n", &ol->ob->name, ol->ob->count);
125} 122}
126 123
127/* New function, MSW 2000-1-14 124/* New function, MSW 2000-1-14
128 * It traverses the friendly list removing objects that should not be here 125 * It traverses the friendly list removing objects that should not be here
… …
132clean_friendly_list (void) 129clean_friendly_list (void)
133{ 130{
134 objectlink *obj, *prev = NULL, *next; 131 objectlink *obj, *prev = NULL, *next;
135 int count = 0; 132 int count = 0;
136 133
137 for (obj = first_friendly_object; obj != NULL; obj = next) 134 for (obj = first_friendly_object; obj; obj = next)
138 { 135 {
139 next = obj->next; 136 next = obj->next;
140 if (QUERY_FLAG (obj->ob, FLAG_FREED) || !QUERY_FLAG (obj->ob, FLAG_FRIENDLY) || (obj->id != obj->ob->count)) 137 if (QUERY_FLAG (obj->ob, FLAG_FREED) || !QUERY_FLAG (obj->ob, FLAG_FRIENDLY))
141 { 138 {
142 if (prev) 139 if (prev)
143 {
144 prev->next = obj->next; 140 prev->next = obj->next;
145 }
146 else 141 else
147 {
148 first_friendly_object = obj->next; 142 first_friendly_object = obj->next;
149 } 143
150 count++; 144 count++;
151 free (obj); 145 delete obj;
152 } 146 }
153 /* If we removed the object, then prev is still valid. */
154 else 147 else
148 /* If we removed the object, then prev is still valid. */
155 prev = obj; 149 prev = obj;
156 } 150 }
151
157 if (count) 152 if (count)
158 LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count); 153 LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count);
159} 154}
160 155
161/* Checks if the given object is already in the friendly list or not 156/* Checks if the given object is already in the friendly list or not
… …
164int 159int
165is_friendly (const object *op) 160is_friendly (const object *op)
166{ 161{
167 objectlink *ol; 162 objectlink *ol;
168 163
169 for (ol = first_friendly_object; ol != NULL; ol = ol->next) 164 for (ol = first_friendly_object; ol; ol = ol->next)
170 if (ol->ob == op) 165 if (ol->ob == op)
171 return 1; 166 return 1;
172 167
173 return 0; 168 return 0;
174} 169}
170

Diff Legend

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