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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines