| 1 | |
|
|
| 2 | /* |
1 | /* |
| 3 | * static char *rcsid_friend_c = |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 4 | * "$Id: friend.C,v 1.5 2006/09/10 16:00:23 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 it under |
|
|
9 | * the terms of the Affero GNU General Public License as published by the |
|
|
10 | * Free Software Foundation, either version 3 of the License, or (at your |
|
|
11 | * 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 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 to <support@deliantra.net> |
| 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 | |
|
|
| 37 | void |
31 | void |
| 38 | add_friendly_object (object *op) |
32 | add_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 | logBacktrace, "add_friendly_object: Trying to add object already on list (%s)\n", &op->name); |
| 52 | return; |
48 | return; |
| 53 | } |
49 | } |
| 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 | |
|
|
| 67 | void |
61 | void |
| 68 | remove_friendly_object (object *op) |
62 | remove_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->golem == op) |
|
|
72 | op->owner->contr->golem = 0; |
|
|
73 | |
| 74 | if (!first_friendly_object) |
74 | if (!first_friendly_object) |
| 75 | { |
75 | { |
| 76 | LOG (llevError, "remove_friendly_object called with empty friendly list, remove ob=%s\n", &op->name); |
76 | LOG (llevError, "remove_friendly_object called with empty friendly list, remove ob=%s\n", &op->name); |
| 77 | return; |
77 | return; |
| 78 | } |
78 | } |
|
|
79 | |
| 79 | /* if the first object happens to be the one, processing is pretty |
80 | /* if the first object happens to be the one, processing is pretty |
| 80 | * easy. |
81 | * easy. |
| 81 | */ |
82 | */ |
| 82 | if (first_friendly_object->ob == op) |
83 | if (first_friendly_object->ob == op) |
| 83 | { |
84 | { |
| 84 | obj = first_friendly_object; |
85 | obj = first_friendly_object; |
| 85 | first_friendly_object = obj->next; |
86 | first_friendly_object = obj->next; |
| 86 | free (obj); |
87 | delete obj; |
| 87 | } |
88 | } |
| 88 | else |
89 | else |
| 89 | { |
90 | { |
| 90 | objectlink *prev = first_friendly_object; |
91 | objectlink *prev = first_friendly_object; |
| 91 | |
92 | |
| 92 | for (obj = first_friendly_object->next; obj != NULL; obj = obj->next) |
93 | for (obj = first_friendly_object->next; obj; obj = obj->next) |
| 93 | { |
94 | { |
| 94 | if (obj->ob == op) |
95 | if (obj->ob == op) |
| 95 | break; |
96 | break; |
|
|
97 | |
| 96 | prev = obj; |
98 | prev = obj; |
| 97 | } |
99 | } |
|
|
100 | |
| 98 | if (obj) |
101 | if (obj) |
| 99 | { |
102 | { |
| 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; |
103 | prev->next = obj->next; |
| 109 | free (obj); |
104 | delete obj; |
| 110 | } |
105 | } |
| 111 | } |
106 | } |
| 112 | } |
|
|
| 113 | |
|
|
| 114 | /* |
|
|
| 115 | * Dumps all friendly objects. Invoked in DM-mode with the G key. |
|
|
| 116 | */ |
|
|
| 117 | |
|
|
| 118 | void |
|
|
| 119 | dump_friendly_objects (void) |
|
|
| 120 | { |
|
|
| 121 | objectlink *ol; |
|
|
| 122 | |
|
|
| 123 | for (ol = first_friendly_object; ol != NULL; ol = ol->next) |
|
|
| 124 | LOG (llevError, "%s (%d)\n", &ol->ob->name, ol->ob->count); |
|
|
| 125 | } |
107 | } |
| 126 | |
108 | |
| 127 | /* New function, MSW 2000-1-14 |
109 | /* New function, MSW 2000-1-14 |
| 128 | * 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 |
| 129 | * (ie, do not have friendly flag set, freed, etc) |
111 | * (ie, do not have friendly flag set, freed, etc) |
| … | |
… | |
| 132 | clean_friendly_list (void) |
114 | clean_friendly_list (void) |
| 133 | { |
115 | { |
| 134 | objectlink *obj, *prev = NULL, *next; |
116 | objectlink *obj, *prev = NULL, *next; |
| 135 | int count = 0; |
117 | int count = 0; |
| 136 | |
118 | |
| 137 | for (obj = first_friendly_object; obj != NULL; obj = next) |
119 | for (obj = first_friendly_object; obj; obj = next) |
| 138 | { |
120 | { |
| 139 | next = obj->next; |
121 | next = obj->next; |
| 140 | if (QUERY_FLAG (obj->ob, FLAG_FREED) || !QUERY_FLAG (obj->ob, FLAG_FRIENDLY) || (obj->id != obj->ob->count)) |
122 | if (QUERY_FLAG (obj->ob, FLAG_FREED) || !QUERY_FLAG (obj->ob, FLAG_FRIENDLY)) |
| 141 | { |
123 | { |
| 142 | if (prev) |
124 | if (prev) |
| 143 | { |
|
|
| 144 | prev->next = obj->next; |
125 | prev->next = obj->next; |
| 145 | } |
|
|
| 146 | else |
126 | else |
| 147 | { |
|
|
| 148 | first_friendly_object = obj->next; |
127 | first_friendly_object = obj->next; |
| 149 | } |
128 | |
| 150 | count++; |
129 | count++; |
| 151 | free (obj); |
130 | delete obj; |
| 152 | } |
131 | } |
| 153 | /* If we removed the object, then prev is still valid. */ |
|
|
| 154 | else |
132 | else |
|
|
133 | /* If we removed the object, then prev is still valid. */ |
| 155 | prev = obj; |
134 | prev = obj; |
| 156 | } |
135 | } |
|
|
136 | |
| 157 | if (count) |
137 | if (count) |
| 158 | LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count); |
138 | LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count); |
| 159 | } |
139 | } |
| 160 | |
140 | |
| 161 | /* Checks if the given object is already in the friendly list or not |
|
|
| 162 | * Lauwenmark - 31/07/05 |
|
|
| 163 | */ |
|
|
| 164 | int |
|
|
| 165 | is_friendly (const object *op) |
|
|
| 166 | { |
|
|
| 167 | objectlink *ol; |
|
|
| 168 | |
|
|
| 169 | for (ol = first_friendly_object; ol != NULL; ol = ol->next) |
|
|
| 170 | if (ol->ob == op) |
|
|
| 171 | return 1; |
|
|
| 172 | |
|
|
| 173 | return 0; |
|
|
| 174 | } |
|
|
