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.3 by root, Thu Aug 31 17:54:14 2006 UTC vs.
Revision 1.19 by root, Thu Jan 8 00:54:55 2009 UTC

1/* 1/*
2 * static char *rcsid_friend_c = 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * "$Id: friend.C,v 1.3 2006/08/31 17:54:14 root Exp $"; 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 *
8 * Deliantra 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 <support@deliantra.net>
4 */ 22 */
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 23
29#include <global.h> 24#include <global.h>
30 25
31/* 26/*
32 * 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.
33 * 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.
34 */ 29 */
30void
31add_friendly_object (object *op)
32{
33 op->flag [FLAG_FRIENDLY] = 1;
35 34
36void add_friendly_object(object *op) {
37 objectlink *ol; 35 objectlink *ol;
38 36
39 /* Add some error checking. This shouldn't happen, but the friendly 37 /* Add some error checking. This shouldn't happen, but the friendly
40 * object list usually isn't very long, and remove_friendly_object 38 * 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 39 * 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. 40 * the debugger here and see where the problem is happening.
43 */ 41 */
44 for (ol=first_friendly_object; ol!=NULL; ol=ol->next) { 42 for (ol = first_friendly_object; ol; ol = ol->next)
43 {
45 if (ol->ob == op) { 44 if (ol->ob == op)
45 {
46 LOG(llevError, "add_friendly_object: Trying to add object already on list (%s)\n", 46 LOG (llevError | logBacktrace, "add_friendly_object: Trying to add object already on list (%s)\n", &op->name);
47 op->name);
48 return; 47 return;
49 } 48 }
50 } 49 }
51 50
52 ol=first_friendly_object; 51 ol = first_friendly_object;
53 first_friendly_object=get_objectlink(); 52 first_friendly_object = get_objectlink ();
54 first_friendly_object->ob = op; 53 first_friendly_object->ob = op;
55 first_friendly_object->id = op->count;
56 first_friendly_object->next=ol; 54 first_friendly_object->next = ol;
57} 55}
58 56
59/* 57/*
60 * Removes the specified object from the linked list of friendly objects. 58 * Removes the specified object from the linked list of friendly objects.
61 */ 59 */
60void
61remove_friendly_object (object *op)
62{
63 objectlink *obj;
62 64
63void remove_friendly_object(object *op) { 65 CLEAR_FLAG (op, FLAG_FRIENDLY);
64 objectlink *obj;
65 66
66 CLEAR_FLAG(op,FLAG_FRIENDLY); 67 if (op->type == GOLEM
68 && op->owner
69 && op->owner->contr
70 && op->owner->contr->golem == op)
71 op->owner->contr->golem = 0;
67 72
68 if (!first_friendly_object) { 73 if (!first_friendly_object)
74 {
69 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);
70 return; 76 return;
71 } 77 }
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 78
79 /* if the first object happens to be the one, processing is pretty
80 * easy.
81 */
82 if (first_friendly_object->ob == op)
83 {
84 obj = first_friendly_object;
85 first_friendly_object = obj->next;
86 delete obj;
87 }
88 else
89 {
90 objectlink *prev = first_friendly_object;
91
82 for (obj=first_friendly_object->next; obj!=NULL; obj=obj->next) { 92 for (obj = first_friendly_object->next; obj; obj = obj->next)
93 {
83 if (obj->ob == op) break; 94 if (obj->ob == op)
95 break;
96
84 prev=obj; 97 prev = obj;
85 } 98 }
99
86 if (obj) { 100 if (obj)
87 /* This should not happen. But if it does, presumably the 101 {
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?(const char *)op->name:"none", op->count, obj->id);
93 }
94 prev->next = obj->next; 102 prev->next = obj->next;
95 free(obj); 103 delete obj;
96 } 104 }
97 } 105 }
98}
99
100/*
101 * Dumps all friendly objects. Invoked in DM-mode with the G key.
102 */
103
104void dump_friendly_objects(void) {
105 objectlink *ol;
106
107 for(ol=first_friendly_object;ol!=NULL;ol=ol->next)
108 LOG(llevError, "%s (%d)\n",ol->ob->name,ol->ob->count);
109} 106}
110 107
111/* New function, MSW 2000-1-14 108/* New function, MSW 2000-1-14
112 * It traverses the friendly list removing objects that should not be here 109 * It traverses the friendly list removing objects that should not be here
113 * (ie, do not have friendly flag set, freed, etc) 110 * (ie, do not have friendly flag set, freed, etc)
114 */ 111 */
112void
115void clean_friendly_list(void) { 113clean_friendly_list (void)
114{
116 objectlink *obj, *prev=NULL, *next; 115 objectlink *obj, *prev = NULL, *next;
117 int count=0; 116 int count = 0;
118 117
119 for (obj=first_friendly_object; obj!=NULL; obj=next) { 118 for (obj = first_friendly_object; obj; obj = next)
119 {
120 next=obj->next; 120 next = obj->next;
121 if (QUERY_FLAG(obj->ob, FLAG_FREED) || 121 if (QUERY_FLAG (obj->ob, FLAG_FREED) || !QUERY_FLAG (obj->ob, FLAG_FRIENDLY))
122 !QUERY_FLAG(obj->ob, FLAG_FRIENDLY) || 122 {
123 (obj->id != obj->ob->count)) {
124 if (prev) { 123 if (prev)
125 prev->next = obj->next; 124 prev->next = obj->next;
126 }
127 else { 125 else
128 first_friendly_object = obj->next; 126 first_friendly_object = obj->next;
129 } 127
130 count++; 128 count++;
131 free(obj); 129 delete obj;
132 } 130 }
131 else
133 /* If we removed the object, then prev is still valid. */ 132 /* If we removed the object, then prev is still valid. */
134 else prev=obj; 133 prev = obj;
135 } 134 }
135
136 if (count) 136 if (count)
137 LOG(llevDebug,"clean_friendly_list: Removed %d bogus links\n", count); 137 LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count);
138} 138}
139 139
140/* Checks if the given object is already in the friendly list or not 140/* Checks if the given object is already in the friendly list or not
141 * Lauwenmark - 31/07/05 141 * Lauwenmark - 31/07/05
142 */ 142 */
143int
143int is_friendly(const object* op) 144is_friendly (const object *op)
144{ 145{
145 objectlink *ol; 146 objectlink *ol;
146 147
147 for(ol=first_friendly_object;ol!=NULL;ol=ol->next) 148 for (ol = first_friendly_object; ol; ol = ol->next)
148 if (ol->ob == op) 149 if (ol->ob == op)
149 return 1; 150 return 1;
150 151
151 return 0; 152 return 0;
152} 153}
153 154

Diff Legend

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