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.12 by root, Mon Apr 30 04:25:29 2007 UTC vs.
Revision 1.30 by root, Wed Nov 16 23:41:59 2016 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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * 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
9 * 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
10 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 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 * 17 *
18 * You should have received a copy of the Affero GNU General Public License
19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
21 *
22 * 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>
23 */ 23 */
24 24
25#include <global.h> 25#include <global.h>
26 26
27/* 27/*
42 */ 42 */
43 for (ol = first_friendly_object; ol; ol = ol->next) 43 for (ol = first_friendly_object; ol; ol = ol->next)
44 { 44 {
45 if (ol->ob == op) 45 if (ol->ob == op)
46 { 46 {
47 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);
48 return; 48 return;
49 } 49 }
50 } 50 }
51 51
52 ol = first_friendly_object; 52 ol = first_friendly_object;
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 op->clr_flag (FLAG_FRIENDLY);
67 67
68 if (op->type == GOLEM 68 if (op->type == GOLEM
69 && op->owner 69 && op->owner
70 && op->owner->contr 70 && op->owner->contr
71 && op->owner->contr->golem == op) 71 && op->owner->contr->golem == op)
104 delete obj; 104 delete obj;
105 } 105 }
106 } 106 }
107} 107}
108 108
109/*
110 * Dumps all friendly objects.
111 */
112void
113dump_friendly_objects (void)
114{
115 objectlink *ol;
116
117 for (ol = first_friendly_object; ol; ol = ol->next)
118 LOG (llevError, "%s (%d)\n", &ol->ob->name, ol->ob->count);
119}
120
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; 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)) 122 if (obj->ob->flag [FLAG_FREED] || !obj->ob->flag [FLAG_FRIENDLY])
135 { 123 {
136 if (prev) 124 if (prev)
137 prev->next = obj->next; 125 prev->next = obj->next;
138 else 126 else
139 first_friendly_object = obj->next; 127 first_friendly_object = obj->next;
148 136
149 if (count) 137 if (count)
150 LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count); 138 LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count);
151} 139}
152 140
153/* Checks if the given object is already in the friendly list or not
154 * Lauwenmark - 31/07/05
155 */
156int
157is_friendly (const object *op)
158{
159 objectlink *ol;
160
161 for (ol = first_friendly_object; ol; ol = ol->next)
162 if (ol->ob == op)
163 return 1;
164
165 return 0;
166}
167

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines