1 | /* |
1 | /* |
2 | * static char *rcsid_friend_c = |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * "$Id: friend.C,v 1.3 2006/08/31 17:54:14 root Exp $"; |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
|
|
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992 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> |
4 | */ |
23 | */ |
5 | |
|
|
6 | /* |
|
|
7 | CrossFire, A Multiplayer game for X-windows |
|
|
8 | |
|
|
9 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
|
|
10 | Copyright (C) 1992 Frank Tore Johansen |
|
|
11 | |
|
|
12 | This program is free software; you can redistribute it and/or modify |
|
|
13 | it under the terms of the GNU General Public License as published by |
|
|
14 | the Free Software Foundation; either version 2 of the License, or |
|
|
15 | (at your option) any later version. |
|
|
16 | |
|
|
17 | This program is distributed in the hope that it will be useful, |
|
|
18 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
19 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
20 | GNU General Public License for more details. |
|
|
21 | |
|
|
22 | You should have received a copy of the GNU General Public License |
|
|
23 | along with this program; if not, write to the Free Software |
|
|
24 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
25 | |
|
|
26 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
|
|
27 | */ |
|
|
28 | |
24 | |
29 | #include <global.h> |
25 | #include <global.h> |
30 | |
26 | |
31 | /* |
27 | /* |
32 | * 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. |
33 | * 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. |
34 | */ |
30 | */ |
|
|
31 | void |
|
|
32 | add_friendly_object (object *op) |
|
|
33 | { |
|
|
34 | op->flag [FLAG_FRIENDLY] = 1; |
35 | |
35 | |
36 | void add_friendly_object(object *op) { |
|
|
37 | objectlink *ol; |
36 | objectlink *ol; |
38 | |
37 | |
39 | /* Add some error checking. This shouldn't happen, but the friendly |
38 | /* Add some error checking. This shouldn't happen, but the friendly |
40 | * object list usually isn't very long, and remove_friendly_object |
39 | * object list usually isn't very long, and remove_friendly_object |
41 | * 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 |
42 | * the debugger here and see where the problem is happening. |
41 | * the debugger here and see where the problem is happening. |
43 | */ |
42 | */ |
44 | for (ol=first_friendly_object; ol!=NULL; ol=ol->next) { |
43 | for (ol = first_friendly_object; ol; ol = ol->next) |
|
|
44 | { |
45 | if (ol->ob == op) { |
45 | if (ol->ob == op) |
|
|
46 | { |
46 | LOG(llevError, "add_friendly_object: Trying to add object already on list (%s)\n", |
47 | LOG (llevError | logBacktrace, "add_friendly_object: Trying to add object already on list (%s)\n", &op->name); |
47 | op->name); |
|
|
48 | return; |
48 | return; |
49 | } |
49 | } |
50 | } |
50 | } |
51 | |
51 | |
52 | ol=first_friendly_object; |
52 | ol = first_friendly_object; |
53 | first_friendly_object=get_objectlink(); |
53 | first_friendly_object = get_objectlink (); |
54 | first_friendly_object->ob = op; |
54 | first_friendly_object->ob = op; |
55 | first_friendly_object->id = op->count; |
|
|
56 | first_friendly_object->next=ol; |
55 | first_friendly_object->next = ol; |
57 | } |
56 | } |
58 | |
57 | |
59 | /* |
58 | /* |
60 | * Removes the specified object from the linked list of friendly objects. |
59 | * Removes the specified object from the linked list of friendly objects. |
61 | */ |
60 | */ |
|
|
61 | void |
|
|
62 | remove_friendly_object (object *op) |
|
|
63 | { |
|
|
64 | objectlink *obj; |
62 | |
65 | |
63 | void remove_friendly_object(object *op) { |
66 | op->clr_flag (FLAG_FRIENDLY); |
64 | objectlink *obj; |
|
|
65 | |
67 | |
66 | CLEAR_FLAG(op,FLAG_FRIENDLY); |
68 | if (op->type == GOLEM |
|
|
69 | && op->owner |
|
|
70 | && op->owner->contr |
|
|
71 | && op->owner->contr->golem == op) |
|
|
72 | op->owner->contr->golem = 0; |
67 | |
73 | |
68 | if (!first_friendly_object) { |
74 | if (!first_friendly_object) |
|
|
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 | } |
72 | /* if the first object happens to be the one, processing is pretty |
|
|
73 | * easy. |
|
|
74 | */ |
|
|
75 | if(first_friendly_object->ob==op) { |
|
|
76 | obj=first_friendly_object; |
|
|
77 | first_friendly_object=obj->next; |
|
|
78 | free(obj); |
|
|
79 | } else { |
|
|
80 | objectlink *prev=first_friendly_object; |
|
|
81 | |
79 | |
|
|
80 | /* if the first object happens to be the one, processing is pretty |
|
|
81 | * easy. |
|
|
82 | */ |
|
|
83 | if (first_friendly_object->ob == op) |
|
|
84 | { |
|
|
85 | obj = first_friendly_object; |
|
|
86 | first_friendly_object = obj->next; |
|
|
87 | delete obj; |
|
|
88 | } |
|
|
89 | else |
|
|
90 | { |
|
|
91 | objectlink *prev = first_friendly_object; |
|
|
92 | |
82 | for (obj=first_friendly_object->next; obj!=NULL; obj=obj->next) { |
93 | for (obj = first_friendly_object->next; obj; obj = obj->next) |
|
|
94 | { |
83 | if (obj->ob == op) break; |
95 | if (obj->ob == op) |
|
|
96 | break; |
|
|
97 | |
84 | prev=obj; |
98 | prev = obj; |
85 | } |
99 | } |
|
|
100 | |
86 | if (obj) { |
101 | if (obj) |
87 | /* This should not happen. But if it does, presumably the |
102 | { |
88 | * call to remove it is still valid. |
|
|
89 | */ |
|
|
90 | if (obj->id != op->count) { |
|
|
91 | LOG(llevError,"remove_friendly_object, tags do no match, %s, %d != %d\n", |
|
|
92 | op->name?(const char *)op->name:"none", op->count, obj->id); |
|
|
93 | } |
|
|
94 | prev->next = obj->next; |
103 | prev->next = obj->next; |
95 | free(obj); |
104 | delete obj; |
96 | } |
105 | } |
97 | } |
106 | } |
98 | } |
|
|
99 | |
|
|
100 | /* |
|
|
101 | * Dumps all friendly objects. Invoked in DM-mode with the G key. |
|
|
102 | */ |
|
|
103 | |
|
|
104 | void dump_friendly_objects(void) { |
|
|
105 | objectlink *ol; |
|
|
106 | |
|
|
107 | for(ol=first_friendly_object;ol!=NULL;ol=ol->next) |
|
|
108 | LOG(llevError, "%s (%d)\n",ol->ob->name,ol->ob->count); |
|
|
109 | } |
107 | } |
110 | |
108 | |
111 | /* New function, MSW 2000-1-14 |
109 | /* New function, MSW 2000-1-14 |
112 | * 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 |
113 | * (ie, do not have friendly flag set, freed, etc) |
111 | * (ie, do not have friendly flag set, freed, etc) |
114 | */ |
112 | */ |
|
|
113 | void |
115 | void clean_friendly_list(void) { |
114 | clean_friendly_list () |
|
|
115 | { |
116 | objectlink *obj, *prev=NULL, *next; |
116 | objectlink *obj, *prev = NULL, *next; |
117 | int count=0; |
117 | int count = 0; |
118 | |
118 | |
119 | for (obj=first_friendly_object; obj!=NULL; obj=next) { |
119 | for (obj = first_friendly_object; obj; obj = next) |
|
|
120 | { |
120 | next=obj->next; |
121 | next = obj->next; |
121 | if (QUERY_FLAG(obj->ob, FLAG_FREED) || |
122 | if (obj->ob->flag [FLAG_FREED] || !obj->ob->flag [FLAG_FRIENDLY]) |
122 | !QUERY_FLAG(obj->ob, FLAG_FRIENDLY) || |
123 | { |
123 | (obj->id != obj->ob->count)) { |
|
|
124 | if (prev) { |
124 | if (prev) |
125 | prev->next = obj->next; |
125 | prev->next = obj->next; |
126 | } |
|
|
127 | else { |
126 | else |
128 | first_friendly_object = obj->next; |
127 | first_friendly_object = obj->next; |
129 | } |
128 | |
130 | count++; |
129 | count++; |
131 | free(obj); |
130 | delete obj; |
132 | } |
131 | } |
|
|
132 | else |
133 | /* If we removed the object, then prev is still valid. */ |
133 | /* If we removed the object, then prev is still valid. */ |
134 | else prev=obj; |
134 | prev = obj; |
135 | } |
135 | } |
|
|
136 | |
136 | if (count) |
137 | if (count) |
137 | LOG(llevDebug,"clean_friendly_list: Removed %d bogus links\n", count); |
138 | LOG (llevDebug, "clean_friendly_list: Removed %d bogus links\n", count); |
138 | } |
139 | } |
139 | |
140 | |
140 | /* Checks if the given object is already in the friendly list or not |
|
|
141 | * Lauwenmark - 31/07/05 |
|
|
142 | */ |
|
|
143 | int is_friendly(const object* op) |
|
|
144 | { |
|
|
145 | objectlink *ol; |
|
|
146 | |
|
|
147 | for(ol=first_friendly_object;ol!=NULL;ol=ol->next) |
|
|
148 | if (ol->ob == op) |
|
|
149 | return 1; |
|
|
150 | |
|
|
151 | return 0; |
|
|
152 | } |
|
|
153 | |
|
|