| 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
| 5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 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 |
| 8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
| 9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
| 10 | (at your option) any later version. |
11 | * (at your 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 GNU General Public License |
| 18 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
| 20 | |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
|
|
| 22 | */ |
22 | */ |
| 23 | |
23 | |
| 24 | #include <global.h> |
24 | #include <global.h> |
| 25 | |
25 | |
| 26 | /* |
26 | /* |
| 27 | * 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. |
| 28 | * 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. |
| 29 | */ |
29 | */ |
| 30 | |
|
|
| 31 | void |
30 | void |
| 32 | add_friendly_object (object *op) |
31 | add_friendly_object (object *op) |
| 33 | { |
32 | { |
|
|
33 | op->flag [FLAG_FRIENDLY] = 1; |
|
|
34 | |
| 34 | objectlink *ol; |
35 | objectlink *ol; |
| 35 | |
36 | |
| 36 | /* Add some error checking. This shouldn't happen, but the friendly |
37 | /* Add some error checking. This shouldn't happen, but the friendly |
| 37 | * object list usually isn't very long, and remove_friendly_object |
38 | * 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 |
39 | * 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. |
40 | * the debugger here and see where the problem is happening. |
| 40 | */ |
41 | */ |
| 41 | for (ol = first_friendly_object; ol != NULL; ol = ol->next) |
42 | for (ol = first_friendly_object; ol; ol = ol->next) |
| 42 | { |
43 | { |
| 43 | if (ol->ob == op) |
44 | if (ol->ob == op) |
| 44 | { |
45 | { |
| 45 | LOG (llevError, "add_friendly_object: Trying to add object already on list (%s)\n", &op->name); |
46 | LOG (llevError | logBacktrace, "add_friendly_object: Trying to add object already on list (%s)\n", &op->name); |
| 46 | return; |
47 | return; |
| 47 | } |
48 | } |
| 48 | } |
49 | } |
| 49 | |
50 | |
| 50 | ol = first_friendly_object; |
51 | ol = first_friendly_object; |
| … | |
… | |
| 54 | } |
55 | } |
| 55 | |
56 | |
| 56 | /* |
57 | /* |
| 57 | * Removes the specified object from the linked list of friendly objects. |
58 | * Removes the specified object from the linked list of friendly objects. |
| 58 | */ |
59 | */ |
| 59 | |
|
|
| 60 | void |
60 | void |
| 61 | remove_friendly_object (object *op) |
61 | remove_friendly_object (object *op) |
| 62 | { |
62 | { |
| 63 | objectlink *obj; |
63 | objectlink *obj; |
| 64 | |
64 | |
| 65 | CLEAR_FLAG (op, FLAG_FRIENDLY); |
65 | CLEAR_FLAG (op, FLAG_FRIENDLY); |
| 66 | |
66 | |
|
|
67 | if (op->type == GOLEM |
|
|
68 | && op->owner |
|
|
69 | && op->owner->contr |
|
|
70 | && op->owner->contr->golem == op) |
|
|
71 | op->owner->contr->golem = 0; |
|
|
72 | |
| 67 | if (!first_friendly_object) |
73 | if (!first_friendly_object) |
| 68 | { |
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 | } |
|
|
78 | |
| 72 | /* if the first object happens to be the one, processing is pretty |
79 | /* if the first object happens to be the one, processing is pretty |
| 73 | * easy. |
80 | * easy. |
| 74 | */ |
81 | */ |
| 75 | if (first_friendly_object->ob == op) |
82 | if (first_friendly_object->ob == op) |
| 76 | { |
83 | { |
| … | |
… | |
| 80 | } |
87 | } |
| 81 | else |
88 | else |
| 82 | { |
89 | { |
| 83 | objectlink *prev = first_friendly_object; |
90 | objectlink *prev = first_friendly_object; |
| 84 | |
91 | |
| 85 | for (obj = first_friendly_object->next; obj != NULL; obj = obj->next) |
92 | for (obj = first_friendly_object->next; obj; obj = obj->next) |
| 86 | { |
93 | { |
| 87 | if (obj->ob == op) |
94 | if (obj->ob == op) |
| 88 | break; |
95 | break; |
|
|
96 | |
| 89 | prev = obj; |
97 | prev = obj; |
| 90 | } |
98 | } |
| 91 | |
99 | |
| 92 | if (obj) |
100 | if (obj) |
| 93 | { |
101 | { |
| … | |
… | |
| 96 | } |
104 | } |
| 97 | } |
105 | } |
| 98 | } |
106 | } |
| 99 | |
107 | |
| 100 | /* |
108 | /* |
| 101 | * Dumps all friendly objects. Invoked in DM-mode with the G key. |
109 | * Dumps all friendly objects. |
| 102 | */ |
110 | */ |
| 103 | |
|
|
| 104 | void |
111 | void |
| 105 | dump_friendly_objects (void) |
112 | dump_friendly_objects (void) |
| 106 | { |
113 | { |
| 107 | objectlink *ol; |
114 | objectlink *ol; |
| 108 | |
115 | |
| 109 | for (ol = first_friendly_object; ol != NULL; ol = ol->next) |
116 | for (ol = first_friendly_object; ol; ol = ol->next) |
| 110 | LOG (llevError, "%s (%d)\n", &ol->ob->name, ol->ob->count); |
117 | LOG (llevError, "%s (%d)\n", &ol->ob->name, ol->ob->count); |
| 111 | } |
118 | } |
| 112 | |
119 | |
| 113 | /* New function, MSW 2000-1-14 |
120 | /* New function, MSW 2000-1-14 |
| 114 | * It traverses the friendly list removing objects that should not be here |
121 | * It traverses the friendly list removing objects that should not be here |
| … | |
… | |
| 148 | int |
155 | int |
| 149 | is_friendly (const object *op) |
156 | is_friendly (const object *op) |
| 150 | { |
157 | { |
| 151 | objectlink *ol; |
158 | objectlink *ol; |
| 152 | |
159 | |
| 153 | for (ol = first_friendly_object; ol != NULL; ol = ol->next) |
160 | for (ol = first_friendly_object; ol; ol = ol->next) |
| 154 | if (ol->ob == op) |
161 | if (ol->ob == op) |
| 155 | return 1; |
162 | return 1; |
| 156 | |
163 | |
| 157 | return 0; |
164 | return 0; |
| 158 | } |
165 | } |
|
|
166 | |
