1 | /* |
1 | /* |
2 | * static char *rcsid_anim_c = |
2 | * static char *rcsid_anim_c = |
3 | * "$Id: anim.C,v 1.1 2006/08/13 17:16:00 elmex Exp $"; |
3 | * "$Id: anim.C,v 1.6 2006/09/03 08:05:39 root Exp $"; |
4 | */ |
4 | */ |
5 | |
5 | |
6 | /* |
6 | /* |
7 | CrossFire, A Multiplayer game for X-windows |
7 | CrossFire, A Multiplayer game for X-windows |
8 | |
8 | |
… | |
… | |
29 | /* This file contains animation related code. */ |
29 | /* This file contains animation related code. */ |
30 | |
30 | |
31 | #include <global.h> |
31 | #include <global.h> |
32 | #include <stdio.h> |
32 | #include <stdio.h> |
33 | |
33 | |
|
|
34 | std::vector<Animations> animations; |
|
|
35 | |
34 | void free_all_anim(void) { |
36 | void free_all_anim(void) |
35 | int i; |
37 | { |
36 | |
|
|
37 | for (i=0; i<=num_animations; i++) { |
38 | for (int i=0; i<=num_animations; i++) |
38 | free_string(animations[i].name); |
39 | { |
|
|
40 | animations[i].name = 0; |
39 | free(animations[i].faces); |
41 | free (animations[i].faces); |
40 | } |
42 | } |
41 | free(animations); |
43 | |
|
|
44 | animations.clear (); |
42 | } |
45 | } |
43 | |
46 | |
44 | void init_anim(void) { |
47 | void init_anim(void) { |
45 | char buf[MAX_BUF]; |
48 | char buf[MAX_BUF]; |
46 | FILE *fp; |
49 | FILE *fp; |
47 | static int anim_init=0; |
50 | static int anim_init=0; |
48 | int num_frames=0,faces[MAX_ANIMATIONS],i; |
51 | int num_frames=0,faces[MAX_ANIMATIONS],i; |
49 | |
52 | |
50 | if (anim_init) return; |
53 | if (anim_init) return; |
51 | animations_allocated=9; |
|
|
52 | num_animations=0; |
54 | num_animations=0; |
53 | /* Make a default. New animations start at one, so if something |
55 | /* Make a default. New animations start at one, so if something |
54 | * thinks it is animated but hasn't set the animation_id properly, |
56 | * thinks it is animated but hasn't set the animation_id properly, |
55 | * it will have a default value that should be pretty obvious. |
57 | * it will have a default value that should be pretty obvious. |
56 | */ |
58 | */ |
57 | animations = (Animations *) malloc(10*sizeof(Animations)); |
|
|
58 | /* set the name so we don't try to dereferance null. |
59 | /* set the name so we don't try to dereferance null. |
59 | * Put # at start so it will be first in alphabetical |
60 | * Put # at start so it will be first in alphabetical |
60 | * order. |
61 | * order. |
61 | */ |
62 | */ |
62 | animations[0].name=add_string("###none"); |
63 | { |
|
|
64 | Animations anim0; |
|
|
65 | |
|
|
66 | anim0.name = "###none"; |
63 | animations[0].num_animations=1; |
67 | anim0.num_animations=1; |
64 | animations[0].faces = (Fontindex *) malloc(sizeof(Fontindex)); |
68 | anim0.faces = (Fontindex *) malloc(sizeof(Fontindex)); |
65 | animations[0].faces[0]=0; |
69 | anim0.faces[0]=0; |
66 | animations[0].facings=0; |
70 | anim0.facings=0; |
|
|
71 | |
|
|
72 | animations.push_back (anim0); |
|
|
73 | } |
67 | |
74 | |
68 | sprintf(buf,"%s/animations", settings.datadir); |
75 | sprintf(buf,"%s/animations", settings.datadir); |
69 | LOG(llevDebug,"Reading animations from %s...", buf); |
76 | LOG(llevDebug,"Reading animations from %s...", buf); |
70 | if ((fp=fopen(buf,"r")) ==NULL) { |
77 | if ((fp=fopen(buf,"r")) ==NULL) { |
71 | LOG(llevError, "Cannot open animations file %s: %s\n", buf, strerror_local(errno)); |
78 | LOG(llevError, "Cannot open animations file %s: %s\n", buf, strerror(errno)); |
72 | exit(-1); |
79 | exit(-1); |
73 | } |
80 | } |
74 | while (fgets(buf, MAX_BUF-1, fp)!=NULL) { |
81 | while (fgets(buf, MAX_BUF-1, fp)!=NULL) { |
75 | if (*buf=='#') continue; |
82 | if (*buf=='#') continue; |
76 | /* Kill the newline */ |
83 | /* Kill the newline */ |
77 | buf[strlen(buf)-1] = '\0'; |
84 | buf[strlen(buf)-1] = '\0'; |
78 | if (!strncmp(buf,"anim ", 5)) { |
85 | if (!strncmp(buf,"anim ", 5)) { |
79 | if (num_frames) { |
86 | if (num_frames) { |
80 | LOG(llevError,"Didn't get a mina before %s\n", buf); |
87 | LOG(llevError,"Didn't get a mina before %s\n", buf); |
81 | num_frames=0; |
88 | num_frames=0; |
82 | } |
89 | } |
83 | num_animations++; |
90 | num_animations++; |
84 | if (num_animations==animations_allocated) { |
91 | |
85 | animations= (Animations *) realloc(animations, sizeof(Animations)*(animations_allocated+10)); |
92 | Animations anim; |
86 | animations_allocated+=10; |
93 | anim.name = buf + 5; |
87 | } |
|
|
88 | animations[num_animations].name = add_string(buf+5); |
|
|
89 | animations[num_animations].num = num_animations; /* for bsearch */ |
94 | anim.num = num_animations; /* for bsearch */ |
90 | animations[num_animations].facings = 1; |
95 | anim.facings = 1; |
91 | } |
96 | animations.push_back (anim); |
|
|
97 | } |
92 | else if (!strncmp(buf,"mina",4)) { |
98 | else if (!strncmp(buf,"mina",4)) { |
93 | animations[num_animations].faces = (Fontindex *) malloc(sizeof(Fontindex)*num_frames); |
99 | animations[num_animations].faces = (Fontindex *) malloc(sizeof(Fontindex)*num_frames); |
94 | for (i=0; i<num_frames; i++) |
100 | for (i=0; i<num_frames; i++) |
95 | animations[num_animations].faces[i]=faces[i]; |
101 | animations[num_animations].faces[i]=faces[i]; |
96 | animations[num_animations].num_animations = num_frames; |
102 | animations[num_animations].num_animations = num_frames; |
97 | if (num_frames % animations[num_animations].facings) { |
103 | if (num_frames % animations[num_animations].facings) { |
98 | LOG(llevDebug,"Animation %s frame numbers (%d) is not a multiple of facings (%d)\n", |
104 | 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); |
105 | &animations[num_animations].name, num_frames, animations[num_animations].facings); |
100 | } |
106 | } |
101 | num_frames=0; |
107 | num_frames=0; |
102 | } |
108 | } |
103 | else if (!strncmp(buf,"facings",7)) { |
109 | else if (!strncmp(buf,"facings",7)) { |
104 | if (!(animations[num_animations].facings = atoi(buf+7))) { |
110 | if (!(animations[num_animations].facings = atoi(buf+7))) { |
105 | LOG(llevDebug,"Animation %s has 0 facings, line=%s\n", |
111 | LOG(llevDebug,"Animation %s has 0 facings, line=%s\n", |
106 | animations[num_animations].name, buf); |
112 | &animations[num_animations].name, buf); |
107 | animations[num_animations].facings=1; |
113 | animations[num_animations].facings=1; |
108 | } |
114 | } |
109 | |
115 | |
110 | } else { |
116 | } else { |
111 | if (!(faces[num_frames++] = FindFace(buf,0))) |
117 | if (!(faces[num_frames++] = FindFace(buf,0))) |
112 | LOG(llevDebug,"Could not find face %s for animation %s\n", |
118 | LOG(llevDebug,"Could not find face %s for animation %s\n", |
113 | buf, animations[num_animations].name); |
119 | buf, &animations[num_animations].name); |
114 | } |
120 | } |
115 | } |
121 | } |
116 | fclose(fp); |
122 | fclose(fp); |
117 | LOG(llevDebug,"done. got (%d)\n", num_animations); |
123 | LOG(llevDebug,"done. got (%d)\n", num_animations); |
118 | } |
124 | } |
119 | |
125 | |
… | |
… | |
128 | { |
134 | { |
129 | Animations search, *match; |
135 | Animations search, *match; |
130 | |
136 | |
131 | search.name = name; |
137 | search.name = name; |
132 | |
138 | |
133 | match = (Animations*)bsearch(&search, animations, (num_animations+1), |
139 | match = (Animations*)bsearch(&search, &animations [0], (num_animations+1), |
134 | sizeof(Animations), (int (*)(const void*, const void*))anim_compare); |
140 | sizeof(Animations), (int (*)(const void*, const void*))anim_compare); |
135 | |
141 | |
136 | |
142 | |
137 | if (match) return match->num; |
143 | if (match) return match->num; |
138 | LOG(llevError,"Unable to find animation %s\n", name); |
144 | LOG(llevError,"Unable to find animation %s\n", name); |
139 | return 0; |
145 | return 0; |
… | |
… | |
152 | void animate_object(object *op, int dir) { |
158 | void animate_object(object *op, int dir) { |
153 | int max_state; /* Max animation state object should be drawn in */ |
159 | int max_state; /* Max animation state object should be drawn in */ |
154 | int base_state; /* starting index # to draw from */ |
160 | int base_state; /* starting index # to draw from */ |
155 | |
161 | |
156 | if(!op->animation_id || !NUM_ANIMATIONS(op)) { |
162 | if(!op->animation_id || !NUM_ANIMATIONS(op)) { |
157 | LOG(llevError,"Object lacks animation.\n"); |
163 | LOG(llevError,"Object lacks animation.\n"); |
158 | dump_object(op); |
164 | dump_object(op); |
159 | return; |
165 | return; |
160 | } |
166 | } |
161 | if (op->head) { |
167 | if (op->head) { |
162 | dir=op->head->direction; |
168 | dir=op->head->direction; |
163 | |
169 | |
164 | if (NUM_ANIMATIONS(op) == NUM_ANIMATIONS(op->head)) |
170 | if (NUM_ANIMATIONS(op) == NUM_ANIMATIONS(op->head)) |
165 | op->state = op->head->state; |
171 | op->state = op->head->state; |
166 | else |
172 | else |
167 | ++op->state; |
173 | ++op->state; |
168 | } |
174 | } |
169 | else { |
175 | else { |
170 | ++op->state; /* increase draw state */ |
176 | ++op->state; /* increase draw state */ |
171 | } |
177 | } |
172 | |
178 | |
173 | /* If object is turning, then max animation state is half through the |
179 | /* If object is turning, then max animation state is half through the |
174 | * animations. Otherwise, we can use all the animations. |
180 | * animations. Otherwise, we can use all the animations. |
175 | */ |
181 | */ |
… | |
… | |
180 | * Note in old the is_turning, it was set so that the animation for a monster |
186 | * 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 |
187 | * was always towards the enemy - now it is whatever direction the monster |
182 | * is facing. |
188 | * is facing. |
183 | */ |
189 | */ |
184 | if (NUM_FACINGS(op)==2) { |
190 | if (NUM_FACINGS(op)==2) { |
185 | if (dir<5) base_state=0; |
191 | if (dir<5) base_state=0; |
186 | else base_state=NUM_ANIMATIONS(op)/2; |
192 | else base_state=NUM_ANIMATIONS(op)/2; |
187 | } |
193 | } |
188 | else if (NUM_FACINGS(op)==4) { |
194 | else if (NUM_FACINGS(op)==4) { |
189 | if (dir==0) base_state=0; |
195 | if (dir==0) base_state=0; |
190 | else base_state = ((dir-1)/2) * (NUM_ANIMATIONS(op)/4); |
196 | else base_state = ((dir-1)/2) * (NUM_ANIMATIONS(op)/4); |
191 | } |
197 | } |
192 | else if (NUM_FACINGS(op)==8) { |
198 | else if (NUM_FACINGS(op)==8) { |
193 | if (dir==0) base_state=0; |
199 | if (dir==0) base_state=0; |
194 | else base_state = (dir-1)*(NUM_ANIMATIONS(op)/8); |
200 | else base_state = (dir-1)*(NUM_ANIMATIONS(op)/8); |
195 | } |
201 | } |
196 | |
202 | |
197 | /* If beyond drawable states, reset */ |
203 | /* If beyond drawable states, reset */ |
198 | if (op->state>=max_state) op->state=0; |
204 | if (op->state>=max_state) op->state=0; |
199 | |
205 | |
200 | SET_ANIMATION(op, op->state + base_state); |
206 | SET_ANIMATION(op, op->state + base_state); |
201 | |
207 | |
202 | if(op->face==blank_face) |
208 | if(op->face==blank_face) |
203 | op->invisible=1; |
209 | op->invisible=1; |
204 | |
210 | |
205 | /* This block covers monsters (eg, pixies) which are supposed to |
211 | /* This block covers monsters (eg, pixies) which are supposed to |
206 | * cycle from visible to invisible and back to being visible. |
212 | * cycle from visible to invisible and back to being visible. |
207 | * as such, disable it for players, as then players would become |
213 | * as such, disable it for players, as then players would become |
208 | * visible. |
214 | * visible. |
209 | */ |
215 | */ |
210 | else if(op->type != PLAYER && QUERY_FLAG((&op->arch->clone),FLAG_ALIVE)) { |
216 | else if(op->type != PLAYER && QUERY_FLAG((&op->arch->clone),FLAG_ALIVE)) { |
211 | if(op->face->number==0) { |
217 | if(op->face->number==0) { |
212 | op->invisible=1; |
218 | op->invisible=1; |
213 | CLEAR_FLAG(op, FLAG_ALIVE); |
219 | CLEAR_FLAG(op, FLAG_ALIVE); |
214 | } else { |
220 | } else { |
215 | op->invisible=0; |
221 | op->invisible=0; |
216 | SET_FLAG(op, FLAG_ALIVE); |
222 | SET_FLAG(op, FLAG_ALIVE); |
217 | } |
223 | } |
218 | } |
224 | } |
219 | |
225 | |
220 | if(op->more) |
226 | if(op->more) |
221 | animate_object(op->more, dir); |
227 | animate_object(op->more, dir); |
222 | |
228 | |
223 | /* update_object will also recursively update all the pieces. |
229 | /* update_object will also recursively update all the pieces. |
224 | * as such, we call it last, and only call it for the head |
230 | * as such, we call it last, and only call it for the head |
225 | * piece, and not for the other tail pieces. |
231 | * piece, and not for the other tail pieces. |
226 | */ |
232 | */ |
227 | if (!op->head) |
233 | if (!op->head) |
228 | update_object(op, UP_OBJ_FACE); |
234 | update_object(op, UP_OBJ_FACE); |
229 | } |
235 | } |
230 | |
236 | |