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.7 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.44 by root, Sun Nov 18 15:19:47 2018 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.7 2006/09/10 16:00:23 root Exp $"; 3 *
4 * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
5 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
6 * Copyright (©) 2002-2003 Mark Wedel & Crossfire Development Team
7 * Copyright (©) 1992 Frank Tore Johansen
8 *
9 * Deliantra is free software: you can redistribute it and/or modify it under
10 * the terms of the Affero GNU General Public License as published by the
11 * Free Software Foundation, either version 3 of the License, or (at your
12 * option) any later version.
13 *
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
18 *
19 * You should have received a copy of the Affero GNU General Public License
20 * and the GNU General Public License along with this program. If not, see
21 * <http://www.gnu.org/licenses/>.
22 *
23 * The authors can be reached via e-mail to <support@deliantra.net>
5 */ 24 */
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 25
30/* This file contains animation related code. */ 26/* This file contains animation related code. */
31 27
32#include <global.h> 28#include <global.h>
33#include <stdio.h> 29#include <stdio.h>
34 30
31static animhash_t animhash;
35std::vector < Animations > animations; 32std::vector<animation> animations;
36 33
37void 34void
38free_all_anim (void) 35animation::resize (int new_size)
39{ 36{
40 for (int i = 0; i <= num_animations; i++) 37 sfree<faceidx> (faces, num_animations);
41 { 38 num_animations = new_size;
42 animations[i].name = 0; 39 faces = salloc<faceidx> (num_animations);
43 free (animations[i].faces); 40}
44 }
45 41
46 animations.clear (); 42animation &
43animation::create (const char *name, uint8 frames, uint8 facings)
44{
45 if (animations.size () == MAXANIMNUM)
46 cleanup ("trying to create new animation, but MAXANIMNUM animations in use.");
47
48 animations.push_back (animation ());
49 animation &anim = animations.back ();
50
51 anim.number = animations.size () - 1;
52 anim.name = name;
53 anim.num_animations = frames;
54 anim.facings = facings;
55 anim.faces = salloc<faceidx> (frames);
56
57 animhash.insert (std::make_pair (anim.name, anim.number));
58
59 return anim;
60}
61
62/* Tries to find the animation id that matches name. Returns an integer match
63 * 0 if no match found (animation 0 is initialised as the 'bug' face
64 */
65animation &
66animation::find (const char *name)
67{
68 if (!name)
69 return animations [0];
70
71 animhash_t::iterator i = animhash.find (name);
72 return animations [i == animhash.end () ? 0 : i->second];
47} 73}
48 74
49void 75void
50init_anim (void) 76init_anim ()
51{ 77{
52 char 78 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
74 anim0;
75
76 anim0.name = "###none";
77 anim0.num_animations = 1;
78 anim0.faces = (Fontindex *) malloc (sizeof (Fontindex));
79 anim0.faces[0] = 0; 79 anim0.faces [0] = 0;
80 anim0.facings = 0;
81
82 animations.push_back (anim0);
83 }
84
85 sprintf (buf, "%s/animations", settings.datadir);
86 LOG (llevDebug, "Reading animations from %s...", buf);
87 if ((fp = fopen (buf, "r")) == NULL)
88 {
89 LOG (llevError, "Cannot open animations file %s: %s\n", buf, strerror (errno));
90 exit (-1);
91 }
92 while (fgets (buf, MAX_BUF - 1, fp) != NULL)
93 {
94 if (*buf == '#')
95 continue;
96 /* Kill the newline */
97 buf[strlen (buf) - 1] = '\0';
98 if (!strncmp (buf, "anim ", 5))
99 {
100 if (num_frames)
101 {
102 LOG (llevError, "Didn't get a mina before %s\n", buf);
103 num_frames = 0;
104 }
105 num_animations++;
106
107 Animations
108 anim;
109
110 anim.name = buf + 5;
111 anim.num = num_animations; /* for bsearch */
112 anim.facings = 1;
113 animations.push_back (anim);
114 }
115 else if (!strncmp (buf, "mina", 4))
116 {
117 animations[num_animations].faces = (Fontindex *) malloc (sizeof (Fontindex) * num_frames);
118 for (i = 0; i < num_frames; i++)
119 animations[num_animations].faces[i] = faces[i];
120 animations[num_animations].num_animations = num_frames;
121 if (num_frames % animations[num_animations].facings)
122 {
123 LOG (llevDebug, "Animation %s frame numbers (%d) is not a multiple of facings (%d)\n",
124 &animations[num_animations].name, num_frames, animations[num_animations].facings);
125 }
126 num_frames = 0;
127 }
128 else if (!strncmp (buf, "facings", 7))
129 {
130 if (!(animations[num_animations].facings = atoi (buf + 7)))
131 {
132 LOG (llevDebug, "Animation %s has 0 facings, line=%s\n", &animations[num_animations].name, buf);
133 animations[num_animations].facings = 1;
134 }
135
136 }
137 else
138 {
139 if (!(faces[num_frames++] = FindFace (buf, 0)))
140 LOG (llevDebug, "Could not find face %s for animation %s\n", buf, &animations[num_animations].name);
141 }
142 }
143 fclose (fp);
144 LOG (llevDebug, "done. got (%d)\n", num_animations);
145}
146
147static int
148anim_compare (const Animations * a, const Animations * b)
149{
150 return strcmp (a->name, b->name);
151}
152
153/* Tries to find the animation id that matches name. Returns an integer match
154 * 0 if no match found (animation 0 is initialized as the 'bug' face
155 */
156int
157find_animation (const char *name)
158{
159 Animations
160 search, *
161 match;
162
163 search.name = name;
164
165 match = (Animations *) bsearch (&search, &animations[0], (num_animations + 1),
166 sizeof (Animations), (int (*)(const void *, const void *)) anim_compare);
167
168
169 if (match)
170 return match->num;
171 LOG (llevError, "Unable to find animation %s\n", name);
172 return 0;
173} 80}
174 81
175/* 82/*
176 * animate_object(object) updates the face-variable of an object. 83 * animate_object(object) updates the face-variable of an object.
177 * If the object is the head of a multi-object, all objects are animated. 84 * If the object is the head of a multi-object, all objects are animated.
… …
179 * dir is the direction the object is facing. This is generally same as 86 * dir is the direction the object is facing. This is generally same as
180 * op->direction, but in some cases, op->facing is used instead - the 87 * op->direction, but in some cases, op->facing is used instead - the
181 * caller has a better idea which one it really wants to be using, 88 * caller has a better idea which one it really wants to be using,
182 * so let it pass along the right one. 89 * so let it pass along the right one.
183 */ 90 */
184
185void 91void
186animate_object (object *op, int dir) 92animate_object (object *op, int dir)
187{ 93{
188 int
189 max_state; /* Max animation state object should be drawn in */ 94 int max_state; /* Max animation state object should be drawn in */
190 int
191 base_state; /* starting index # to draw from */ 95 int base_state; /* starting index # to draw from */
192 96
193 if (!op->animation_id || !NUM_ANIMATIONS (op)) 97 if (!op->animation_id || !op->anim_frames ())
194 { 98 {
195 LOG (llevError, "Object lacks animation.\n"); 99 LOG (llevError, "Object %s lacks animation.\n", op->debug_desc ());
196 dump_object (op); 100 op->clr_flag (FLAG_ANIMATE);
197 return; 101 return;
198 } 102 }
103
199 if (op->head) 104 if (op->head_ () != op)
200 { 105 {
201 dir = op->head->direction; 106 dir = op->head->direction;
202 107
203 if (NUM_ANIMATIONS (op) == NUM_ANIMATIONS (op->head)) 108 if (op->anim_frames () == op->head->anim_frames ())
204 op->state = op->head->state; 109 op->state = op->head->state;
205 else 110 else
206 ++op->state; 111 ++op->state;
207 } 112 }
208 else 113 else
209 {
210 ++op->state; /* increase draw state */ 114 ++op->state; /* increase draw state */
211 }
212 115
213 /* If object is turning, then max animation state is half through the 116 /* If object is turning, then max animation state is half through the
214 * animations. Otherwise, we can use all the animations. 117 * animations. Otherwise, we can use all the animations.
215 */ 118 */
216 max_state = NUM_ANIMATIONS (op) / NUM_FACINGS (op); 119 max_state = op->anim_frames () / op->anim_facings ();
217 base_state = 0; 120 base_state = 0;
218 /* at least in the older aniamtions that used is_turning, the first half 121 /* at least in the older animations that used is_turning, the first half
219 * of the animations were left facing, the second half right facing. 122 * of the animations were left facing, the second half right facing.
220 * Note in old the is_turning, it was set so that the animation for a monster 123 * Note in old the is_turning, it was set so that the animation for a monster
221 * was always towards the enemy - now it is whatever direction the monster 124 * was always towards the enemy - now it is whatever direction the monster
222 * is facing. 125 * is facing.
223 */ 126 */
224 if (NUM_FACINGS (op) == 2) 127
128 if (dir > 0)
129 switch (op->anim_facings ())
225 { 130 {
226 if (dir < 5) 131 case 2: base_state = ((dir - 1) / (8 / 2)) * (op->anim_frames () / 2); break;
132 case 4: base_state = ((dir - 1) / (8 / 4)) * (op->anim_frames () / 4); break;
133 case 8: base_state = ((dir - 1) / (8 / 8)) * (op->anim_frames () / 8); break;
134 }
135 else
227 base_state = 0; 136 base_state = 0;
228 else
229 base_state = NUM_ANIMATIONS (op) / 2;
230 }
231 else if (NUM_FACINGS (op) == 4)
232 {
233 if (dir == 0)
234 base_state = 0;
235 else
236 base_state = ((dir - 1) / 2) * (NUM_ANIMATIONS (op) / 4);
237 }
238 else if (NUM_FACINGS (op) == 8)
239 {
240 if (dir == 0)
241 base_state = 0;
242 else
243 base_state = (dir - 1) * (NUM_ANIMATIONS (op) / 8);
244 }
245 137
246 /* If beyond drawable states, reset */ 138 /* If beyond drawable states, reset */
247 if (op->state >= max_state) 139 if (op->state >= max_state)
248 op->state = 0; 140 op->state = 0;
249 141
250 SET_ANIMATION (op, op->state + base_state); 142 op->set_anim_frame (op->state + base_state);
251 143
252 if (op->face == blank_face) 144 if (op->face == blank_face)
253 op->invisible = 1; 145 op->invisible = 1;
254 146
255 /* This block covers monsters (eg, pixies) which are supposed to 147 /* This block covers monsters (eg, pixies) which are supposed to
256 * cycle from visible to invisible and back to being visible. 148 * cycle from visible to invisible and back to being visible.
257 * as such, disable it for players, as then players would become 149 * as such, disable it for players, as then players would become
258 * visible. 150 * visible.
259 */ 151 */
260 else if (op->type != PLAYER && QUERY_FLAG ((&op->arch->clone), FLAG_ALIVE)) 152 else if (op->type != PLAYER && op->arch->flag [FLAG_ALIVE])
261 { 153 {
262 if (op->face->number == 0) 154 if (op->face == 0)
263 { 155 {
264 op->invisible = 1; 156 op->invisible = 1;
265 CLEAR_FLAG (op, FLAG_ALIVE); 157 op->clr_flag (FLAG_ALIVE);
266 } 158 }
267 else 159 else
268 { 160 {
269 op->invisible = 0; 161 op->invisible = 0;
270 SET_FLAG (op, FLAG_ALIVE); 162 op->set_flag (FLAG_ALIVE);
271 } 163 }
272 } 164 }
273 165
274 if (op->more) 166 if (op->more)
275 animate_object (op->more, dir); 167 animate_object (op->more, dir);
276 168
277 /* update_object will also recursively update all the pieces. 169 /* update_object will also recursively update all the pieces.
278 * as such, we call it last, and only call it for the head 170 * as such, we call it last, and only call it for the head
279 * piece, and not for the other tail pieces. 171 * piece, and not for the other tail pieces.
280 */ 172 */
281 if (!op->head) 173 if (op->head_ () == op)
282 update_object (op, UP_OBJ_FACE); 174 update_object (op, UP_OBJ_FACE);
283} 175}
176

Diff Legend

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