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.2 by root, Tue Aug 29 08:01:35 2006 UTC vs.
Revision 1.11 by root, Tue Apr 24 12:32:14 2007 UTC

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

Diff Legend

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