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 (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | 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 |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | (at your option) any later version. |
11 | * option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
18 | along with this program; if not, write to the Free Software |
19 | * and the GNU General Public License along with this program. If not, see |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
20 | |
21 | * |
21 | 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> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
25 | |
26 | |
26 | /* |
27 | /* |
27 | * 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. |
28 | * 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. |
29 | */ |
30 | */ |
30 | |
|
|
31 | void |
31 | void |
32 | add_friendly_object (object *op) |
32 | add_friendly_object (object *op) |
33 | { |
33 | { |
|
|
34 | op->flag [FLAG_FRIENDLY] = 1; |
|
|
35 | |
34 | objectlink *ol; |
36 | objectlink *ol; |
35 | |
37 | |
36 | /* Add some error checking. This shouldn't happen, but the friendly |
38 | /* Add some error checking. This shouldn't happen, but the friendly |
37 | * object list usually isn't very long, and remove_friendly_object |
39 | * object list usually isn't very long, and remove_friendly_object |
38 | * 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 |
39 | * the debugger here and see where the problem is happening. |
41 | * the debugger here and see where the problem is happening. |
40 | */ |
42 | */ |
41 | for (ol = first_friendly_object; ol != NULL; ol = ol->next) |
43 | for (ol = first_friendly_object; ol; ol = ol->next) |
42 | { |
44 | { |
43 | if (ol->ob == op) |
45 | if (ol->ob == op) |
44 | { |
46 | { |
45 | 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); |
46 | return; |
48 | return; |
47 | } |
49 | } |
48 | } |
50 | } |
49 | |
51 | |
50 | ol = first_friendly_object; |
52 | ol = first_friendly_object; |
… | |
… | |
54 | } |
56 | } |
55 | |
57 | |
56 | /* |
58 | /* |
57 | * Removes the specified object from the linked list of friendly objects. |
59 | * Removes the specified object from the linked list of friendly objects. |
58 | */ |
60 | */ |
59 | |
|
|
60 | void |
61 | void |
61 | remove_friendly_object (object *op) |
62 | remove_friendly_object (object *op) |
62 | { |
63 | { |
63 | objectlink *obj; |
64 | objectlink *obj; |
64 | |
65 | |
65 | CLEAR_FLAG (op, FLAG_FRIENDLY); |
66 | op->clr_flag (FLAG_FRIENDLY); |
|
|
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; |
66 | |
73 | |
67 | if (!first_friendly_object) |
74 | if (!first_friendly_object) |
68 | { |
75 | { |
69 | 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); |
70 | return; |
77 | return; |
71 | } |
78 | } |
|
|
79 | |
72 | /* 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 |
73 | * easy. |
81 | * easy. |
74 | */ |
82 | */ |
75 | if (first_friendly_object->ob == op) |
83 | if (first_friendly_object->ob == op) |
76 | { |
84 | { |
… | |
… | |
80 | } |
88 | } |
81 | else |
89 | else |
82 | { |
90 | { |
83 | objectlink *prev = first_friendly_object; |
91 | objectlink *prev = first_friendly_object; |
84 | |
92 | |
85 | for (obj = first_friendly_object->next; obj != NULL; obj = obj->next) |
93 | for (obj = first_friendly_object->next; obj; obj = obj->next) |
86 | { |
94 | { |
87 | if (obj->ob == op) |
95 | if (obj->ob == op) |
88 | break; |
96 | break; |
|
|
97 | |
89 | prev = obj; |
98 | prev = obj; |
90 | } |
99 | } |
91 | |
100 | |
92 | if (obj) |
101 | if (obj) |
93 | { |
102 | { |
… | |
… | |
95 | delete obj; |
104 | delete obj; |
96 | } |
105 | } |
97 | } |
106 | } |
98 | } |
107 | } |
99 | |
108 | |
100 | /* |
|
|
101 | * Dumps all friendly objects. Invoked in DM-mode with the G key. |
|
|
102 | */ |
|
|
103 | |
|
|
104 | void |
|
|
105 | dump_friendly_objects (void) |
|
|
106 | { |
|
|
107 | objectlink *ol; |
|
|
108 | |
|
|
109 | for (ol = first_friendly_object; ol != NULL; ol = ol->next) |
|
|
110 | LOG (llevError, "%s (%d)\n", &ol->ob->name, ol->ob->count); |
|
|
111 | } |
|
|
112 | |
|
|
113 | /* New function, MSW 2000-1-14 |
109 | /* New function, MSW 2000-1-14 |
114 | * 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 |
115 | * (ie, do not have friendly flag set, freed, etc) |
111 | * (ie, do not have friendly flag set, freed, etc) |
116 | */ |
112 | */ |
117 | void |
113 | void |
118 | clean_friendly_list (void) |
114 | clean_friendly_list () |
119 | { |
115 | { |
120 | objectlink *obj, *prev = NULL, *next; |
116 | objectlink *obj, *prev = NULL, *next; |
121 | int count = 0; |
117 | int count = 0; |
122 | |
118 | |
123 | for (obj = first_friendly_object; obj; obj = next) |
119 | for (obj = first_friendly_object; obj; obj = next) |
124 | { |
120 | { |
125 | next = obj->next; |
121 | next = obj->next; |
126 | 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]) |
127 | { |
123 | { |
128 | if (prev) |
124 | if (prev) |
129 | prev->next = obj->next; |
125 | prev->next = obj->next; |
130 | else |
126 | else |
131 | first_friendly_object = obj->next; |
127 | first_friendly_object = obj->next; |
… | |
… | |
140 | |
136 | |
141 | if (count) |
137 | if (count) |
142 | LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count); |
138 | LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count); |
143 | } |
139 | } |
144 | |
140 | |
145 | /* Checks if the given object is already in the friendly list or not |
|
|
146 | * Lauwenmark - 31/07/05 |
|
|
147 | */ |
|
|
148 | int |
|
|
149 | is_friendly (const object *op) |
|
|
150 | { |
|
|
151 | objectlink *ol; |
|
|
152 | |
|
|
153 | for (ol = first_friendly_object; ol != NULL; ol = ol->next) |
|
|
154 | if (ol->ob == op) |
|
|
155 | return 1; |
|
|
156 | |
|
|
157 | return 0; |
|
|
158 | } |
|
|