1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
|
|
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | * 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 |
10 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * GNU General Public License for more details. |
17 | * |
18 | * |
18 | * You should have received a copy of the GNU General Public License |
19 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * and the GNU General Public License along with this program. If not, see |
|
|
21 | * <http://www.gnu.org/licenses/>. |
20 | * |
22 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
24 | */ |
23 | |
25 | |
24 | #include <global.h> |
26 | #include <global.h> |
25 | |
27 | |
26 | /* |
28 | /* |
… | |
… | |
35 | objectlink *ol; |
37 | objectlink *ol; |
36 | |
38 | |
37 | /* Add some error checking. This shouldn't happen, but the friendly |
39 | /* Add some error checking. This shouldn't happen, but the friendly |
38 | * object list usually isn't very long, and remove_friendly_object |
40 | * object list usually isn't very long, and remove_friendly_object |
39 | * won't remove it either. Plus, it is easier to put a breakpoint in |
41 | * won't remove it either. Plus, it is easier to put a breakpoint in |
40 | * the debugger here and see where the problem is happening. |
42 | * the debugger here and see where the problem is happening. |
41 | */ |
43 | */ |
42 | for (ol = first_friendly_object; ol; ol = ol->next) |
44 | for (ol = first_friendly_object; ol; ol = ol->next) |
43 | { |
45 | { |
44 | if (ol->ob == op) |
46 | if (ol->ob == op) |
45 | { |
47 | { |
… | |
… | |
60 | void |
62 | void |
61 | remove_friendly_object (object *op) |
63 | remove_friendly_object (object *op) |
62 | { |
64 | { |
63 | objectlink *obj; |
65 | objectlink *obj; |
64 | |
66 | |
65 | CLEAR_FLAG (op, FLAG_FRIENDLY); |
67 | op->clr_flag (FLAG_FRIENDLY); |
66 | |
68 | |
67 | if (op->type == GOLEM |
69 | if (op->type == GOLEM |
68 | && op->owner |
70 | && op->owner |
69 | && op->owner->contr |
71 | && op->owner->contr |
70 | && op->owner->contr->golem == op) |
72 | && op->owner->contr->golem == op) |
… | |
… | |
103 | delete obj; |
105 | delete obj; |
104 | } |
106 | } |
105 | } |
107 | } |
106 | } |
108 | } |
107 | |
109 | |
108 | /* |
|
|
109 | * Dumps all friendly objects. |
|
|
110 | */ |
|
|
111 | void |
|
|
112 | dump_friendly_objects (void) |
|
|
113 | { |
|
|
114 | objectlink *ol; |
|
|
115 | |
|
|
116 | for (ol = first_friendly_object; ol; ol = ol->next) |
|
|
117 | LOG (llevError, "%s (%d)\n", &ol->ob->name, ol->ob->count); |
|
|
118 | } |
|
|
119 | |
|
|
120 | /* New function, MSW 2000-1-14 |
110 | /* New function, MSW 2000-1-14 |
121 | * It traverses the friendly list removing objects that should not be here |
111 | * It traverses the friendly list removing objects that should not be here |
122 | * (ie, do not have friendly flag set, freed, etc) |
112 | * (ie, do not have friendly flag set, freed, etc) |
123 | */ |
113 | */ |
124 | void |
114 | void |
125 | clean_friendly_list (void) |
115 | clean_friendly_list () |
126 | { |
116 | { |
127 | objectlink *obj, *prev = NULL, *next; |
117 | objectlink *obj, *prev = NULL, *next; |
128 | int count = 0; |
118 | int count = 0; |
129 | |
119 | |
130 | for (obj = first_friendly_object; obj; obj = next) |
120 | for (obj = first_friendly_object; obj; obj = next) |
131 | { |
121 | { |
132 | next = obj->next; |
122 | next = obj->next; |
133 | if (QUERY_FLAG (obj->ob, FLAG_FREED) || !QUERY_FLAG (obj->ob, FLAG_FRIENDLY)) |
123 | if (obj->ob->flag [FLAG_FREED] || !obj->ob->flag [FLAG_FRIENDLY]) |
134 | { |
124 | { |
135 | if (prev) |
125 | if (prev) |
136 | prev->next = obj->next; |
126 | prev->next = obj->next; |
137 | else |
127 | else |
138 | first_friendly_object = obj->next; |
128 | first_friendly_object = obj->next; |
… | |
… | |
147 | |
137 | |
148 | if (count) |
138 | if (count) |
149 | LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count); |
139 | LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count); |
150 | } |
140 | } |
151 | |
141 | |
152 | /* Checks if the given object is already in the friendly list or not |
|
|
153 | * Lauwenmark - 31/07/05 |
|
|
154 | */ |
|
|
155 | int |
|
|
156 | is_friendly (const object *op) |
|
|
157 | { |
|
|
158 | objectlink *ol; |
|
|
159 | |
|
|
160 | for (ol = first_friendly_object; ol; ol = ol->next) |
|
|
161 | if (ol->ob == op) |
|
|
162 | return 1; |
|
|
163 | |
|
|
164 | return 0; |
|
|
165 | } |
|
|
166 | |
|
|