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.1 by elmex, Sun Aug 13 17:16:00 2006 UTC vs.
Revision 1.21 by root, Sun Mar 11 02:12:44 2007 UTC

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

Diff Legend

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