ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/anim.C
(Generate patch)

Comparing deliantra/server/common/anim.C (file contents):
Revision 1.8 by root, Mon Sep 11 20:28:37 2006 UTC vs.
Revision 1.37 by root, Sun Apr 11 00:34:05 2010 UTC

1
2/* 1/*
3 * static char *rcsid_anim_c = 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
4 * "$Id: anim.C,v 1.8 2006/09/11 20:28:37 root Exp $"; 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002-2003 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>
5 */ 23 */
6
7/*
8 CrossFire, A Multiplayer game for X-windows
9
10 Copyright (C) 2002-2003 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/* This file contains animation related code. */ 25/* This file contains animation related code. */
31 26
32#include <global.h> 27#include <global.h>
33#include <stdio.h> 28#include <stdio.h>
34 29
30static animhash_t animhash;
35std::vector < Animations > animations; 31std::vector<animation> animations;
36 32
37void 33void
38free_all_anim (void) 34animation::resize (int new_size)
39{ 35{
40 for (int i = 0; i <= num_animations; i++) 36 sfree<faceidx> (faces, num_animations);
41 { 37 num_animations = new_size;
42 animations[i].name = 0; 38 faces = salloc<faceidx> (num_animations);
43 free (animations[i].faces); 39}
44 }
45 40
46 animations.clear (); 41animation &
42animation::create (const char *name, uint8 frames, uint8 facings)
43{
44 if (animations.size () == MAXANIMNUM)
45 cleanup ("trying to create new animation, but MAXANIMNUM animations in use.");
46
47 animations.push_back (animation ());
48 animation &anim = animations.back ();
49
50 anim.number = animations.size () - 1;
51 anim.name = name;
52 anim.num_animations = frames;
53 anim.facings = facings;
54 anim.faces = salloc<faceidx> (frames);
55
56 animhash.insert (std::make_pair (anim.name, anim.number));
57
58 return anim;
59}
60
61animation &
62animation::find (const char *name)
63{
64 if (!name)
65 return animations [0];
66
67 animhash_t::iterator i = animhash.find (name);
68 return animations [i == animhash.end () ? 0 : i->second];
47} 69}
48 70
49void 71void
50init_anim (void) 72init_anim ()
51{ 73{
52 char 74 animation &anim0 = animation::create ("none", 1, 0);
53 buf[MAX_BUF];
54 FILE *
55 fp;
56 static int
57 anim_init = 0;
58 int
59 num_frames = 0, faces[MAX_ANIMATIONS], i;
60
61 if (anim_init)
62 return;
63 num_animations = 0;
64 /* Make a default. New animations start at one, so if something
65 * thinks it is animated but hasn't set the animation_id properly,
66 * it will have a default value that should be pretty obvious.
67 */
68 /* set the name so we don't try to dereferance null.
69 * Put # at start so it will be first in alphabetical
70 * order.
71 */
72 {
73 Animations anim0;
74
75 anim0.name = "###none";
76 anim0.num_animations = 1;
77 anim0.faces = (Fontindex *) malloc (sizeof (Fontindex));
78 anim0.faces[0] = 0; 75 anim0.faces [0] = 0;
79 anim0.facings = 0;
80
81 animations.push_back (anim0);
82 }
83
84 sprintf (buf, "%s/animations", settings.datadir);
85 LOG (llevDebug, "Reading animations from %s...", buf);
86 if ((fp = fopen (buf, "r")) == NULL)
87 {
88 LOG (llevError, "Cannot open animations file %s: %s\n", buf, strerror (errno));
89 exit (-1);
90 }
91 while (fgets (buf, MAX_BUF - 1, fp) != NULL)
92 {
93 if (*buf == '#')
94 continue;
95 /* Kill the newline */
96 buf[strlen (buf) - 1] = '\0';
97 if (!strncmp (buf, "anim ", 5))
98 {
99 if (num_frames)
100 {
101 LOG (llevError, "Didn't get a mina before %s\n", buf);
102 num_frames = 0;
103 }
104 num_animations++;
105
106 Animations anim;
107
108 anim.name = buf + 5;
109 anim.num = num_animations; /* for bsearch */
110 anim.facings = 1;
111 animations.push_back (anim);
112 }
113 else if (!strncmp (buf, "mina", 4))
114 {
115 animations[num_animations].faces = (Fontindex *) malloc (sizeof (Fontindex) * num_frames);
116 for (i = 0; i < num_frames; i++)
117 animations[num_animations].faces[i] = faces[i];
118 animations[num_animations].num_animations = num_frames;
119 if (num_frames % animations[num_animations].facings)
120 {
121 LOG (llevDebug, "Animation %s frame numbers (%d) is not a multiple of facings (%d)\n",
122 &animations[num_animations].name, num_frames, animations[num_animations].facings);
123 }
124 num_frames = 0;
125 }
126 else if (!strncmp (buf, "facings", 7))
127 {
128 if (!(animations[num_animations].facings = atoi (buf + 7)))
129 {
130 LOG (llevDebug, "Animation %s has 0 facings, line=%s\n", &animations[num_animations].name, buf);
131 animations[num_animations].facings = 1;
132 }
133
134 }
135 else
136 {
137 if (!(faces[num_frames++] = FindFace (buf, 0)))
138 LOG (llevDebug, "Could not find face %s for animation %s\n", buf, &animations[num_animations].name);
139 }
140 }
141 fclose (fp);
142 LOG (llevDebug, "done. got (%d)\n", num_animations);
143}
144
145static int
146anim_compare (const Animations * a, const Animations * b)
147{
148 return strcmp (a->name, b->name);
149} 76}
150 77
151/* Tries to find the animation id that matches name. Returns an integer match 78/* Tries to find the animation id that matches name. Returns an integer match
152 * 0 if no match found (animation 0 is initialized as the 'bug' face 79 * 0 if no match found (animation 0 is initialised as the 'bug' face
153 */ 80 */
81//TODO: nuke this function and replace all occurences by animations::find
154int 82int
155find_animation (const char *name) 83find_animation (const char *name)
156{ 84{
157 Animations 85 return animation::find (name).number;
158 search, *
159 match;
160
161 search.name = name;
162
163 match = (Animations *) bsearch (&search, &animations[0], (num_animations + 1),
164 sizeof (Animations), (int (*)(const void *, const void *)) anim_compare);
165
166
167 if (match)
168 return match->num;
169 LOG (llevError, "Unable to find animation %s\n", name);
170 return 0;
171} 86}
172 87
173/* 88/*
174 * animate_object(object) updates the face-variable of an object. 89 * animate_object(object) updates the face-variable of an object.
175 * If the object is the head of a multi-object, all objects are animated. 90 * If the object is the head of a multi-object, all objects are animated.
… …
177 * dir is the direction the object is facing. This is generally same as 92 * dir is the direction the object is facing. This is generally same as
178 * op->direction, but in some cases, op->facing is used instead - the 93 * op->direction, but in some cases, op->facing is used instead - the
179 * caller has a better idea which one it really wants to be using, 94 * caller has a better idea which one it really wants to be using,
180 * so let it pass along the right one. 95 * so let it pass along the right one.
181 */ 96 */
182
183void 97void
184animate_object (object *op, int dir) 98animate_object (object *op, int dir)
185{ 99{
186 int
187 max_state; /* Max animation state object should be drawn in */ 100 int max_state; /* Max animation state object should be drawn in */
188 int
189 base_state; /* starting index # to draw from */ 101 int base_state; /* starting index # to draw from */
190 102
191 if (!op->animation_id || !NUM_ANIMATIONS (op)) 103 if (!op->animation_id || !NUM_ANIMATIONS (op))
192 { 104 {
193 LOG (llevError, "Object lacks animation.\n"); 105 LOG (llevError, "Object %s lacks animation.\n", op->debug_desc ());
194 dump_object (op); 106 op->clr_flag (FLAG_ANIMATE);
195 return; 107 return;
196 } 108 }
109
197 if (op->head) 110 if (op->head_ () != op)
198 { 111 {
199 dir = op->head->direction; 112 dir = op->head->direction;
200 113
201 if (NUM_ANIMATIONS (op) == NUM_ANIMATIONS (op->head)) 114 if (NUM_ANIMATIONS (op) == NUM_ANIMATIONS (op->head))
202 op->state = op->head->state; 115 op->state = op->head->state;
203 else 116 else
204 ++op->state; 117 ++op->state;
205 } 118 }
206 else 119 else
207 {
208 ++op->state; /* increase draw state */ 120 ++op->state; /* increase draw state */
209 }
210 121
211 /* If object is turning, then max animation state is half through the 122 /* If object is turning, then max animation state is half through the
212 * animations. Otherwise, we can use all the animations. 123 * animations. Otherwise, we can use all the animations.
213 */ 124 */
214 max_state = NUM_ANIMATIONS (op) / NUM_FACINGS (op); 125 max_state = NUM_ANIMATIONS (op) / NUM_FACINGS (op);
215 base_state = 0; 126 base_state = 0;
216 /* at least in the older aniamtions that used is_turning, the first half 127 /* at least in the older animations that used is_turning, the first half
217 * of the animations were left facing, the second half right facing. 128 * of the animations were left facing, the second half right facing.
218 * Note in old the is_turning, it was set so that the animation for a monster 129 * Note in old the is_turning, it was set so that the animation for a monster
219 * was always towards the enemy - now it is whatever direction the monster 130 * was always towards the enemy - now it is whatever direction the monster
220 * is facing. 131 * is facing.
221 */ 132 */
133
134 if (dir > 0)
222 if (NUM_FACINGS (op) == 2) 135 switch (NUM_FACINGS (op))
223 { 136 {
224 if (dir < 5) 137 case 2: base_state = ((dir - 1) / (8 / 2)) * (NUM_ANIMATIONS (op) / 2); break;
138 case 4: base_state = ((dir - 1) / (8 / 4)) * (NUM_ANIMATIONS (op) / 4); break;
139 case 8: base_state = ((dir - 1) / (8 / 8)) * (NUM_ANIMATIONS (op) / 8); break;
140 }
141 else
225 base_state = 0; 142 base_state = 0;
226 else
227 base_state = NUM_ANIMATIONS (op) / 2;
228 }
229 else if (NUM_FACINGS (op) == 4)
230 {
231 if (dir == 0)
232 base_state = 0;
233 else
234 base_state = ((dir - 1) / 2) * (NUM_ANIMATIONS (op) / 4);
235 }
236 else if (NUM_FACINGS (op) == 8)
237 {
238 if (dir == 0)
239 base_state = 0;
240 else
241 base_state = (dir - 1) * (NUM_ANIMATIONS (op) / 8);
242 }
243 143
244 /* If beyond drawable states, reset */ 144 /* If beyond drawable states, reset */
245 if (op->state >= max_state) 145 if (op->state >= max_state)
246 op->state = 0; 146 op->state = 0;
247 147
… …
253 /* This block covers monsters (eg, pixies) which are supposed to 153 /* This block covers monsters (eg, pixies) which are supposed to
254 * cycle from visible to invisible and back to being visible. 154 * cycle from visible to invisible and back to being visible.
255 * as such, disable it for players, as then players would become 155 * as such, disable it for players, as then players would become
256 * visible. 156 * visible.
257 */ 157 */
258 else if (op->type != PLAYER && QUERY_FLAG ((&op->arch->clone), FLAG_ALIVE)) 158 else if (op->type != PLAYER && op->arch->flag [FLAG_ALIVE])
259 { 159 {
260 if (op->face->number == 0) 160 if (op->face == 0)
261 { 161 {
262 op->invisible = 1; 162 op->invisible = 1;
263 CLEAR_FLAG (op, FLAG_ALIVE); 163 op->clr_flag (FLAG_ALIVE);
264 } 164 }
265 else 165 else
266 { 166 {
267 op->invisible = 0; 167 op->invisible = 0;
268 SET_FLAG (op, FLAG_ALIVE); 168 op->set_flag (FLAG_ALIVE);
269 } 169 }
270 } 170 }
271 171
272 if (op->more) 172 if (op->more)
273 animate_object (op->more, dir); 173 animate_object (op->more, dir);
274 174
275 /* update_object will also recursively update all the pieces. 175 /* update_object will also recursively update all the pieces.
276 * as such, we call it last, and only call it for the head 176 * as such, we call it last, and only call it for the head
277 * piece, and not for the other tail pieces. 177 * piece, and not for the other tail pieces.
278 */ 178 */
279 if (!op->head) 179 if (op->head_ () == op)
280 update_object (op, UP_OBJ_FACE); 180 update_object (op, UP_OBJ_FACE);
281} 181}
182

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines