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.10 by root, Thu Sep 14 22:33:58 2006 UTC vs.
Revision 1.31 by root, Thu Sep 17 01:57:31 2009 UTC

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

Diff Legend

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