rev |
line source |
nuclear@1
|
1 #include <stdlib.h>
|
nuclear@0
|
2 #include <limits.h>
|
nuclear@0
|
3 #include <assert.h>
|
nuclear@0
|
4 #include "anim.h"
|
nuclear@0
|
5 #include "dynarr.h"
|
nuclear@0
|
6
|
nuclear@7
|
7 #define ROT_USE_SLERP
|
nuclear@7
|
8
|
nuclear@0
|
9 static void invalidate_cache(struct anm_node *node);
|
nuclear@0
|
10
|
nuclear@21
|
11 int anm_init_animation(struct anm_animation *anim)
|
nuclear@0
|
12 {
|
nuclear@0
|
13 int i, j;
|
nuclear@0
|
14 static const float defaults[] = {
|
nuclear@0
|
15 0.0f, 0.0f, 0.0f, /* default position */
|
nuclear@0
|
16 0.0f, 0.0f, 0.0f, 1.0f, /* default rotation quat */
|
nuclear@0
|
17 1.0f, 1.0f, 1.0f /* default scale factor */
|
nuclear@0
|
18 };
|
nuclear@0
|
19
|
nuclear@21
|
20 anim->name = 0;
|
nuclear@21
|
21
|
nuclear@21
|
22 for(i=0; i<ANM_NUM_TRACKS; i++) {
|
nuclear@21
|
23 if(anm_init_track(anim->tracks + i) == -1) {
|
nuclear@21
|
24 for(j=0; j<i; j++) {
|
nuclear@21
|
25 anm_destroy_track(anim->tracks + i);
|
nuclear@21
|
26 }
|
nuclear@21
|
27 }
|
nuclear@21
|
28 anm_set_track_default(anim->tracks + i, defaults[i]);
|
nuclear@21
|
29 }
|
nuclear@21
|
30 return 0;
|
nuclear@21
|
31 }
|
nuclear@21
|
32
|
nuclear@21
|
33 void anm_destroy_animation(struct anm_animation *anim)
|
nuclear@21
|
34 {
|
nuclear@21
|
35 int i;
|
nuclear@21
|
36 for(i=0; i<ANM_NUM_TRACKS; i++) {
|
nuclear@21
|
37 anm_destroy_track(anim->tracks + i);
|
nuclear@21
|
38 }
|
nuclear@21
|
39 free(anim->name);
|
nuclear@21
|
40 }
|
nuclear@21
|
41
|
nuclear@21
|
42 /* ---- node implementation ----- */
|
nuclear@21
|
43
|
nuclear@21
|
44 int anm_init_node(struct anm_node *node)
|
nuclear@21
|
45 {
|
nuclear@0
|
46 memset(node, 0, sizeof *node);
|
nuclear@0
|
47
|
nuclear@21
|
48 node->cur_anim[1] = -1;
|
nuclear@21
|
49 node->cur_mix = 0;
|
nuclear@21
|
50
|
nuclear@21
|
51 if(!(node->animations = dynarr_alloc(1, sizeof *node->animations))) {
|
nuclear@21
|
52 return -1;
|
nuclear@21
|
53 }
|
nuclear@21
|
54 if(anm_init_animation(node->animations) == -1) {
|
nuclear@21
|
55 dynarr_free(node->animations);
|
nuclear@21
|
56 return -1;
|
nuclear@21
|
57 }
|
nuclear@21
|
58
|
nuclear@0
|
59 /* initialize thread-local matrix cache */
|
nuclear@0
|
60 pthread_key_create(&node->cache_key, 0);
|
nuclear@10
|
61 pthread_mutex_init(&node->cache_list_lock, 0);
|
nuclear@0
|
62
|
nuclear@0
|
63 return 0;
|
nuclear@0
|
64 }
|
nuclear@0
|
65
|
nuclear@0
|
66 void anm_destroy_node(struct anm_node *node)
|
nuclear@0
|
67 {
|
nuclear@0
|
68 int i;
|
nuclear@0
|
69 free(node->name);
|
nuclear@0
|
70
|
nuclear@0
|
71 for(i=0; i<ANM_NUM_TRACKS; i++) {
|
nuclear@21
|
72 anm_destroy_animation(node->animations + i);
|
nuclear@0
|
73 }
|
nuclear@21
|
74 dynarr_free(node->animations);
|
nuclear@0
|
75
|
nuclear@0
|
76 /* destroy thread-specific cache */
|
nuclear@0
|
77 pthread_key_delete(node->cache_key);
|
nuclear@0
|
78
|
nuclear@0
|
79 while(node->cache_list) {
|
nuclear@0
|
80 struct mat_cache *tmp = node->cache_list;
|
nuclear@0
|
81 node->cache_list = tmp->next;
|
nuclear@0
|
82 free(tmp);
|
nuclear@0
|
83 }
|
nuclear@0
|
84 }
|
nuclear@0
|
85
|
nuclear@0
|
86 void anm_destroy_node_tree(struct anm_node *tree)
|
nuclear@0
|
87 {
|
nuclear@0
|
88 struct anm_node *c, *tmp;
|
nuclear@0
|
89
|
nuclear@0
|
90 if(!tree) return;
|
nuclear@0
|
91
|
nuclear@0
|
92 c = tree->child;
|
nuclear@0
|
93 while(c) {
|
nuclear@0
|
94 tmp = c;
|
nuclear@0
|
95 c = c->next;
|
nuclear@0
|
96
|
nuclear@0
|
97 anm_destroy_node_tree(tmp);
|
nuclear@0
|
98 }
|
nuclear@0
|
99 anm_destroy_node(tree);
|
nuclear@0
|
100 }
|
nuclear@0
|
101
|
nuclear@0
|
102 struct anm_node *anm_create_node(void)
|
nuclear@0
|
103 {
|
nuclear@0
|
104 struct anm_node *n;
|
nuclear@0
|
105
|
nuclear@0
|
106 if((n = malloc(sizeof *n))) {
|
nuclear@0
|
107 if(anm_init_node(n) == -1) {
|
nuclear@0
|
108 free(n);
|
nuclear@0
|
109 return 0;
|
nuclear@0
|
110 }
|
nuclear@0
|
111 }
|
nuclear@0
|
112 return n;
|
nuclear@0
|
113 }
|
nuclear@0
|
114
|
nuclear@0
|
115 void anm_free_node(struct anm_node *node)
|
nuclear@0
|
116 {
|
nuclear@0
|
117 anm_destroy_node(node);
|
nuclear@0
|
118 free(node);
|
nuclear@0
|
119 }
|
nuclear@0
|
120
|
nuclear@0
|
121 void anm_free_node_tree(struct anm_node *tree)
|
nuclear@0
|
122 {
|
nuclear@0
|
123 struct anm_node *c, *tmp;
|
nuclear@0
|
124
|
nuclear@0
|
125 if(!tree) return;
|
nuclear@0
|
126
|
nuclear@0
|
127 c = tree->child;
|
nuclear@0
|
128 while(c) {
|
nuclear@0
|
129 tmp = c;
|
nuclear@0
|
130 c = c->next;
|
nuclear@0
|
131
|
nuclear@0
|
132 anm_free_node_tree(tmp);
|
nuclear@0
|
133 }
|
nuclear@0
|
134
|
nuclear@0
|
135 anm_free_node(tree);
|
nuclear@0
|
136 }
|
nuclear@0
|
137
|
nuclear@0
|
138 int anm_set_node_name(struct anm_node *node, const char *name)
|
nuclear@0
|
139 {
|
nuclear@0
|
140 char *str;
|
nuclear@0
|
141
|
nuclear@0
|
142 if(!(str = malloc(strlen(name) + 1))) {
|
nuclear@0
|
143 return -1;
|
nuclear@0
|
144 }
|
nuclear@0
|
145 strcpy(str, name);
|
nuclear@0
|
146 free(node->name);
|
nuclear@0
|
147 node->name = str;
|
nuclear@0
|
148 return 0;
|
nuclear@0
|
149 }
|
nuclear@0
|
150
|
nuclear@0
|
151 const char *anm_get_node_name(struct anm_node *node)
|
nuclear@0
|
152 {
|
nuclear@0
|
153 return node->name ? node->name : "";
|
nuclear@0
|
154 }
|
nuclear@0
|
155
|
nuclear@0
|
156 void anm_link_node(struct anm_node *p, struct anm_node *c)
|
nuclear@0
|
157 {
|
nuclear@0
|
158 c->next = p->child;
|
nuclear@0
|
159 p->child = c;
|
nuclear@0
|
160
|
nuclear@0
|
161 c->parent = p;
|
nuclear@0
|
162 invalidate_cache(c);
|
nuclear@0
|
163 }
|
nuclear@0
|
164
|
nuclear@0
|
165 int anm_unlink_node(struct anm_node *p, struct anm_node *c)
|
nuclear@0
|
166 {
|
nuclear@0
|
167 struct anm_node *iter;
|
nuclear@0
|
168
|
nuclear@0
|
169 if(p->child == c) {
|
nuclear@0
|
170 p->child = c->next;
|
nuclear@0
|
171 c->next = 0;
|
nuclear@0
|
172 invalidate_cache(c);
|
nuclear@0
|
173 return 0;
|
nuclear@0
|
174 }
|
nuclear@0
|
175
|
nuclear@0
|
176 iter = p->child;
|
nuclear@0
|
177 while(iter->next) {
|
nuclear@0
|
178 if(iter->next == c) {
|
nuclear@0
|
179 iter->next = c->next;
|
nuclear@0
|
180 c->next = 0;
|
nuclear@0
|
181 invalidate_cache(c);
|
nuclear@0
|
182 return 0;
|
nuclear@0
|
183 }
|
nuclear@0
|
184 }
|
nuclear@0
|
185 return -1;
|
nuclear@0
|
186 }
|
nuclear@0
|
187
|
nuclear@21
|
188 void anm_set_pivot(struct anm_node *node, vec3_t piv)
|
nuclear@21
|
189 {
|
nuclear@21
|
190 node->pivot = piv;
|
nuclear@21
|
191 }
|
nuclear@21
|
192
|
nuclear@21
|
193 vec3_t anm_get_pivot(struct anm_node *node)
|
nuclear@21
|
194 {
|
nuclear@21
|
195 return node->pivot;
|
nuclear@21
|
196 }
|
nuclear@21
|
197
|
nuclear@21
|
198
|
nuclear@21
|
199 /* animation management */
|
nuclear@21
|
200
|
nuclear@21
|
201 int anm_use_node_animation(struct anm_node *node, int aidx)
|
nuclear@21
|
202 {
|
nuclear@21
|
203 if(aidx == node->cur_anim[0] && node->cur_anim[1] == -1) {
|
nuclear@21
|
204 return 0; /* no change, no invalidation */
|
nuclear@21
|
205 }
|
nuclear@21
|
206
|
nuclear@21
|
207 if(aidx < 0 || aidx >= anm_get_animation_count(node)) {
|
nuclear@21
|
208 return -1;
|
nuclear@21
|
209 }
|
nuclear@21
|
210
|
nuclear@21
|
211 node->cur_anim[0] = aidx;
|
nuclear@21
|
212 node->cur_anim[1] = -1;
|
nuclear@21
|
213 node->cur_mix = 0;
|
nuclear@21
|
214
|
nuclear@21
|
215 invalidate_cache(node);
|
nuclear@21
|
216 return 0;
|
nuclear@21
|
217 }
|
nuclear@21
|
218
|
nuclear@21
|
219 int anm_use_node_animations(struct anm_node *node, int aidx, int bidx, float t)
|
nuclear@21
|
220 {
|
nuclear@21
|
221 int num_anim;
|
nuclear@21
|
222
|
nuclear@21
|
223 if(node->cur_anim[0] == aidx && node->cur_anim[1] == bidx &&
|
nuclear@21
|
224 fabs(t - node->cur_mix) < 1e-6) {
|
nuclear@21
|
225 return 0; /* no change, no invalidation */
|
nuclear@21
|
226 }
|
nuclear@21
|
227
|
nuclear@21
|
228 num_anim = anm_get_animation_count(node);
|
nuclear@21
|
229 if(aidx < 0 || aidx >= num_anim) {
|
nuclear@21
|
230 return anm_use_animation(node, bidx);
|
nuclear@21
|
231 }
|
nuclear@21
|
232 if(bidx < 0 || bidx >= num_anim) {
|
nuclear@21
|
233 return anm_use_animation(node, aidx);
|
nuclear@21
|
234 }
|
nuclear@21
|
235 node->cur_anim[0] = aidx;
|
nuclear@21
|
236 node->cur_anim[1] = bidx;
|
nuclear@21
|
237 node->cur_mix = t;
|
nuclear@21
|
238
|
nuclear@21
|
239 invalidate_cache(node);
|
nuclear@21
|
240 return 0;
|
nuclear@21
|
241 }
|
nuclear@21
|
242
|
nuclear@21
|
243 int anm_use_animation(struct anm_node *node, int aidx)
|
nuclear@21
|
244 {
|
nuclear@21
|
245 struct anm_node *child;
|
nuclear@21
|
246
|
nuclear@21
|
247 if(anm_use_node_animation(node, aidx) == -1) {
|
nuclear@21
|
248 return -1;
|
nuclear@21
|
249 }
|
nuclear@21
|
250
|
nuclear@21
|
251 child = node->child;
|
nuclear@21
|
252 while(child) {
|
nuclear@21
|
253 if(anm_use_animation(child, aidx) == -1) {
|
nuclear@21
|
254 return -1;
|
nuclear@21
|
255 }
|
nuclear@21
|
256 child = child->next;
|
nuclear@21
|
257 }
|
nuclear@21
|
258 return 0;
|
nuclear@21
|
259 }
|
nuclear@21
|
260
|
nuclear@21
|
261 int anm_use_animations(struct anm_node *node, int aidx, int bidx, float t)
|
nuclear@21
|
262 {
|
nuclear@21
|
263 struct anm_node *child;
|
nuclear@21
|
264
|
nuclear@21
|
265 if(anm_use_node_animations(node, aidx, bidx, t) == -1) {
|
nuclear@21
|
266 return -1;
|
nuclear@21
|
267 }
|
nuclear@21
|
268
|
nuclear@21
|
269 child = node->child;
|
nuclear@21
|
270 while(child) {
|
nuclear@21
|
271 if(anm_use_animations(child, aidx, bidx, t) == -1) {
|
nuclear@21
|
272 return -1;
|
nuclear@21
|
273 }
|
nuclear@21
|
274 child = child->next;
|
nuclear@21
|
275 }
|
nuclear@21
|
276 return 0;
|
nuclear@21
|
277
|
nuclear@21
|
278 }
|
nuclear@21
|
279
|
nuclear@21
|
280 int anm_get_active_animation_index(struct anm_node *node, int which)
|
nuclear@21
|
281 {
|
nuclear@21
|
282 if(which < 0 || which >= 2) return -1;
|
nuclear@21
|
283 return node->cur_anim[which];
|
nuclear@21
|
284 }
|
nuclear@21
|
285
|
nuclear@21
|
286 struct anm_animation *anm_get_active_animation(struct anm_node *node, int which)
|
nuclear@21
|
287 {
|
nuclear@21
|
288 int idx = anm_get_active_animation_index(node, which);
|
nuclear@21
|
289 if(idx < 0 || idx >= anm_get_animation_count(node)) {
|
nuclear@21
|
290 return 0;
|
nuclear@21
|
291 }
|
nuclear@21
|
292 return node->animations + idx;
|
nuclear@21
|
293 }
|
nuclear@21
|
294
|
nuclear@21
|
295 float anm_get_active_animation_mix(struct anm_node *node)
|
nuclear@21
|
296 {
|
nuclear@21
|
297 return node->cur_mix;
|
nuclear@21
|
298 }
|
nuclear@21
|
299
|
nuclear@21
|
300 int anm_get_animation_count(struct anm_node *node)
|
nuclear@21
|
301 {
|
nuclear@21
|
302 return dynarr_size(node->animations);
|
nuclear@21
|
303 }
|
nuclear@21
|
304
|
nuclear@21
|
305 int anm_add_node_animation(struct anm_node *node)
|
nuclear@21
|
306 {
|
nuclear@21
|
307 struct anm_animation newanim;
|
nuclear@21
|
308 anm_init_animation(&newanim);
|
nuclear@21
|
309
|
nuclear@21
|
310 node->animations = dynarr_push(node->animations, &newanim);
|
nuclear@21
|
311 return 0;
|
nuclear@21
|
312 }
|
nuclear@21
|
313
|
nuclear@21
|
314 int anm_remove_node_animation(struct anm_node *node, int idx)
|
nuclear@21
|
315 {
|
nuclear@21
|
316 fprintf(stderr, "anm_remove_animation: unimplemented!");
|
nuclear@21
|
317 abort();
|
nuclear@21
|
318 return 0;
|
nuclear@21
|
319 }
|
nuclear@21
|
320
|
nuclear@21
|
321 int anm_add_animation(struct anm_node *node)
|
nuclear@21
|
322 {
|
nuclear@21
|
323 struct anm_node *child;
|
nuclear@21
|
324
|
nuclear@21
|
325 if(anm_add_node_animation(node) == -1) {
|
nuclear@21
|
326 return -1;
|
nuclear@21
|
327 }
|
nuclear@21
|
328
|
nuclear@21
|
329 child = node->child;
|
nuclear@21
|
330 while(child) {
|
nuclear@21
|
331 if(anm_add_animation(child)) {
|
nuclear@21
|
332 return -1;
|
nuclear@21
|
333 }
|
nuclear@21
|
334 child = child->next;
|
nuclear@21
|
335 }
|
nuclear@21
|
336 return 0;
|
nuclear@21
|
337 }
|
nuclear@21
|
338
|
nuclear@21
|
339 int anm_remove_animation(struct anm_node *node, int idx)
|
nuclear@21
|
340 {
|
nuclear@21
|
341 struct anm_node *child;
|
nuclear@21
|
342
|
nuclear@21
|
343 if(anm_remove_node_animation(node, idx) == -1) {
|
nuclear@21
|
344 return -1;
|
nuclear@21
|
345 }
|
nuclear@21
|
346
|
nuclear@21
|
347 child = node->child;
|
nuclear@21
|
348 while(child) {
|
nuclear@21
|
349 if(anm_remove_animation(child, idx) == -1) {
|
nuclear@21
|
350 return -1;
|
nuclear@21
|
351 }
|
nuclear@21
|
352 child = child->next;
|
nuclear@21
|
353 }
|
nuclear@21
|
354 return 0;
|
nuclear@21
|
355 }
|
nuclear@21
|
356
|
nuclear@21
|
357 struct anm_animation *anm_get_animation(struct anm_node *node, int idx)
|
nuclear@21
|
358 {
|
nuclear@21
|
359 if(idx < 0 || idx > anm_get_animation_count(node)) {
|
nuclear@21
|
360 return 0;
|
nuclear@21
|
361 }
|
nuclear@21
|
362 return node->animations + idx;
|
nuclear@21
|
363 }
|
nuclear@21
|
364
|
nuclear@21
|
365 struct anm_animation *anm_get_animation_by_name(struct anm_node *node, const char *name)
|
nuclear@21
|
366 {
|
nuclear@21
|
367 return anm_get_animation(node, anm_find_animation(node, name));
|
nuclear@21
|
368 }
|
nuclear@21
|
369
|
nuclear@21
|
370 int anm_find_animation(struct anm_node *node, const char *name)
|
nuclear@21
|
371 {
|
nuclear@21
|
372 int i, count = anm_get_animation_count(node);
|
nuclear@21
|
373 for(i=0; i<count; i++) {
|
nuclear@21
|
374 if(strcmp(node->animations[i].name, name) == 0) {
|
nuclear@21
|
375 return i;
|
nuclear@21
|
376 }
|
nuclear@21
|
377 }
|
nuclear@21
|
378 return -1;
|
nuclear@21
|
379 }
|
nuclear@21
|
380
|
nuclear@21
|
381 /* all the rest act on the current animation(s) */
|
nuclear@21
|
382
|
nuclear@21
|
383 void anm_set_interpolator(struct anm_node *node, enum anm_interpolator in)
|
nuclear@21
|
384 {
|
nuclear@21
|
385 int i;
|
nuclear@21
|
386 struct anm_animation *anim = anm_get_active_animation(node, 0);
|
nuclear@21
|
387 if(!anim) return;
|
nuclear@21
|
388
|
nuclear@21
|
389 for(i=0; i<ANM_NUM_TRACKS; i++) {
|
nuclear@21
|
390 anm_set_track_interpolator(anim->tracks + i, in);
|
nuclear@21
|
391 }
|
nuclear@21
|
392 invalidate_cache(node);
|
nuclear@21
|
393 }
|
nuclear@21
|
394
|
nuclear@21
|
395 void anm_set_extrapolator(struct anm_node *node, enum anm_extrapolator ex)
|
nuclear@21
|
396 {
|
nuclear@21
|
397 int i;
|
nuclear@21
|
398 struct anm_animation *anim = anm_get_active_animation(node, 0);
|
nuclear@21
|
399 if(!anim) return;
|
nuclear@21
|
400
|
nuclear@21
|
401 for(i=0; i<ANM_NUM_TRACKS; i++) {
|
nuclear@21
|
402 anm_set_track_extrapolator(anim->tracks + i, ex);
|
nuclear@21
|
403 }
|
nuclear@21
|
404 invalidate_cache(node);
|
nuclear@21
|
405 }
|
nuclear@21
|
406
|
nuclear@0
|
407 void anm_set_position(struct anm_node *node, vec3_t pos, anm_time_t tm)
|
nuclear@0
|
408 {
|
nuclear@21
|
409 struct anm_animation *anim = anm_get_active_animation(node, 0);
|
nuclear@21
|
410 if(!anim) return;
|
nuclear@21
|
411
|
nuclear@21
|
412 anm_set_value(anim->tracks + ANM_TRACK_POS_X, tm, pos.x);
|
nuclear@21
|
413 anm_set_value(anim->tracks + ANM_TRACK_POS_Y, tm, pos.y);
|
nuclear@21
|
414 anm_set_value(anim->tracks + ANM_TRACK_POS_Z, tm, pos.z);
|
nuclear@0
|
415 invalidate_cache(node);
|
nuclear@0
|
416 }
|
nuclear@0
|
417
|
nuclear@0
|
418 vec3_t anm_get_node_position(struct anm_node *node, anm_time_t tm)
|
nuclear@0
|
419 {
|
nuclear@0
|
420 vec3_t v;
|
nuclear@21
|
421 struct anm_animation *anim0 = anm_get_active_animation(node, 0);
|
nuclear@21
|
422 struct anm_animation *anim1 = anm_get_active_animation(node, 1);
|
nuclear@21
|
423
|
nuclear@21
|
424 if(!anim0) {
|
nuclear@21
|
425 return v3_cons(0, 0, 0);
|
nuclear@21
|
426 }
|
nuclear@21
|
427
|
nuclear@21
|
428 v.x = anm_get_value(anim0->tracks + ANM_TRACK_POS_X, tm);
|
nuclear@21
|
429 v.y = anm_get_value(anim0->tracks + ANM_TRACK_POS_Y, tm);
|
nuclear@21
|
430 v.z = anm_get_value(anim0->tracks + ANM_TRACK_POS_Z, tm);
|
nuclear@21
|
431
|
nuclear@21
|
432 if(anim1) {
|
nuclear@21
|
433 vec3_t v1;
|
nuclear@21
|
434 v1.x = anm_get_value(anim1->tracks + ANM_TRACK_POS_X, tm);
|
nuclear@21
|
435 v1.y = anm_get_value(anim1->tracks + ANM_TRACK_POS_Y, tm);
|
nuclear@21
|
436 v1.z = anm_get_value(anim1->tracks + ANM_TRACK_POS_Z, tm);
|
nuclear@21
|
437
|
nuclear@21
|
438 v.x = v.x + (v1.x - v.x) * node->cur_mix;
|
nuclear@21
|
439 v.y = v.y + (v1.y - v.y) * node->cur_mix;
|
nuclear@21
|
440 v.z = v.z + (v1.z - v.z) * node->cur_mix;
|
nuclear@21
|
441 }
|
nuclear@21
|
442
|
nuclear@0
|
443 return v;
|
nuclear@0
|
444 }
|
nuclear@0
|
445
|
nuclear@0
|
446 void anm_set_rotation(struct anm_node *node, quat_t rot, anm_time_t tm)
|
nuclear@0
|
447 {
|
nuclear@21
|
448 struct anm_animation *anim = anm_get_active_animation(node, 0);
|
nuclear@21
|
449 if(!anim) return;
|
nuclear@21
|
450
|
nuclear@21
|
451 anm_set_value(anim->tracks + ANM_TRACK_ROT_X, tm, rot.x);
|
nuclear@21
|
452 anm_set_value(anim->tracks + ANM_TRACK_ROT_Y, tm, rot.y);
|
nuclear@21
|
453 anm_set_value(anim->tracks + ANM_TRACK_ROT_Z, tm, rot.z);
|
nuclear@21
|
454 anm_set_value(anim->tracks + ANM_TRACK_ROT_W, tm, rot.w);
|
nuclear@0
|
455 invalidate_cache(node);
|
nuclear@0
|
456 }
|
nuclear@0
|
457
|
nuclear@21
|
458 static quat_t get_node_rotation(struct anm_node *node, anm_time_t tm, struct anm_animation *anim)
|
nuclear@0
|
459 {
|
nuclear@7
|
460 #ifndef ROT_USE_SLERP
|
nuclear@7
|
461 quat_t q;
|
nuclear@21
|
462 q.x = anm_get_value(anim->tracks + ANM_TRACK_ROT_X, tm);
|
nuclear@21
|
463 q.y = anm_get_value(anim->tracks + ANM_TRACK_ROT_Y, tm);
|
nuclear@21
|
464 q.z = anm_get_value(anim->tracks + ANM_TRACK_ROT_Z, tm);
|
nuclear@21
|
465 q.w = anm_get_value(anim->tracks + ANM_TRACK_ROT_W, tm);
|
nuclear@7
|
466 return q;
|
nuclear@7
|
467 #else
|
nuclear@0
|
468 int idx0, idx1, last_idx;
|
nuclear@0
|
469 anm_time_t tstart, tend;
|
nuclear@0
|
470 float t, dt;
|
nuclear@0
|
471 struct anm_track *track_x, *track_y, *track_z, *track_w;
|
nuclear@0
|
472 quat_t q, q1, q2;
|
nuclear@0
|
473
|
nuclear@21
|
474 track_x = anim->tracks + ANM_TRACK_ROT_X;
|
nuclear@21
|
475 track_y = anim->tracks + ANM_TRACK_ROT_Y;
|
nuclear@21
|
476 track_z = anim->tracks + ANM_TRACK_ROT_Z;
|
nuclear@21
|
477 track_w = anim->tracks + ANM_TRACK_ROT_W;
|
nuclear@0
|
478
|
nuclear@0
|
479 if(!track_x->count) {
|
nuclear@0
|
480 q.x = track_x->def_val;
|
nuclear@0
|
481 q.y = track_y->def_val;
|
nuclear@0
|
482 q.z = track_z->def_val;
|
nuclear@0
|
483 q.w = track_w->def_val;
|
nuclear@0
|
484 return q;
|
nuclear@0
|
485 }
|
nuclear@0
|
486
|
nuclear@0
|
487 last_idx = track_x->count - 1;
|
nuclear@0
|
488
|
nuclear@0
|
489 tstart = track_x->keys[0].time;
|
nuclear@0
|
490 tend = track_x->keys[last_idx].time;
|
nuclear@6
|
491
|
nuclear@6
|
492 if(tstart == tend) {
|
nuclear@6
|
493 q.x = track_x->keys[0].val;
|
nuclear@6
|
494 q.y = track_y->keys[0].val;
|
nuclear@6
|
495 q.z = track_z->keys[0].val;
|
nuclear@6
|
496 q.w = track_w->keys[0].val;
|
nuclear@6
|
497 return q;
|
nuclear@6
|
498 }
|
nuclear@6
|
499
|
nuclear@0
|
500 tm = anm_remap_time(track_x, tm, tstart, tend);
|
nuclear@0
|
501
|
nuclear@0
|
502 idx0 = anm_get_key_interval(track_x, tm);
|
nuclear@0
|
503 assert(idx0 >= 0 && idx0 < track_x->count);
|
nuclear@0
|
504 idx1 = idx0 + 1;
|
nuclear@0
|
505
|
nuclear@6
|
506 if(idx0 == last_idx) {
|
nuclear@6
|
507 q.x = track_x->keys[idx0].val;
|
nuclear@6
|
508 q.y = track_y->keys[idx0].val;
|
nuclear@6
|
509 q.z = track_z->keys[idx0].val;
|
nuclear@6
|
510 q.w = track_w->keys[idx0].val;
|
nuclear@6
|
511 return q;
|
nuclear@6
|
512 }
|
nuclear@6
|
513
|
nuclear@0
|
514 dt = (float)(track_x->keys[idx1].time - track_x->keys[idx0].time);
|
nuclear@0
|
515 t = (float)(tm - track_x->keys[idx0].time) / dt;
|
nuclear@0
|
516
|
nuclear@0
|
517 q1.x = track_x->keys[idx0].val;
|
nuclear@0
|
518 q1.y = track_y->keys[idx0].val;
|
nuclear@0
|
519 q1.z = track_z->keys[idx0].val;
|
nuclear@0
|
520 q1.w = track_w->keys[idx0].val;
|
nuclear@0
|
521
|
nuclear@0
|
522 q2.x = track_x->keys[idx1].val;
|
nuclear@0
|
523 q2.y = track_y->keys[idx1].val;
|
nuclear@0
|
524 q2.z = track_z->keys[idx1].val;
|
nuclear@0
|
525 q2.w = track_w->keys[idx1].val;
|
nuclear@0
|
526
|
nuclear@9
|
527 /*q1 = quat_normalize(q1);
|
nuclear@9
|
528 q2 = quat_normalize(q2);*/
|
nuclear@9
|
529
|
nuclear@0
|
530 return quat_slerp(q1, q2, t);
|
nuclear@7
|
531 #endif
|
nuclear@0
|
532 }
|
nuclear@0
|
533
|
nuclear@21
|
534 quat_t anm_get_node_rotation(struct anm_node *node, anm_time_t tm)
|
nuclear@21
|
535 {
|
nuclear@21
|
536 quat_t q;
|
nuclear@21
|
537 struct anm_animation *anim0 = anm_get_active_animation(node, 0);
|
nuclear@21
|
538 struct anm_animation *anim1 = anm_get_active_animation(node, 1);
|
nuclear@21
|
539
|
nuclear@21
|
540 if(!anim0) {
|
nuclear@21
|
541 return quat_identity();
|
nuclear@21
|
542 }
|
nuclear@21
|
543
|
nuclear@21
|
544 q = get_node_rotation(node, tm, anim0);
|
nuclear@21
|
545
|
nuclear@21
|
546 if(anim1) {
|
nuclear@21
|
547 quat_t q1 = get_node_rotation(node, tm, anim1);
|
nuclear@21
|
548
|
nuclear@21
|
549 q = quat_slerp(q, q1, node->cur_mix);
|
nuclear@21
|
550 }
|
nuclear@21
|
551 return q;
|
nuclear@21
|
552 }
|
nuclear@21
|
553
|
nuclear@0
|
554 void anm_set_scaling(struct anm_node *node, vec3_t scl, anm_time_t tm)
|
nuclear@0
|
555 {
|
nuclear@21
|
556 struct anm_animation *anim = anm_get_active_animation(node, 0);
|
nuclear@21
|
557 if(!anim) return;
|
nuclear@21
|
558
|
nuclear@21
|
559 anm_set_value(anim->tracks + ANM_TRACK_SCL_X, tm, scl.x);
|
nuclear@21
|
560 anm_set_value(anim->tracks + ANM_TRACK_SCL_Y, tm, scl.y);
|
nuclear@21
|
561 anm_set_value(anim->tracks + ANM_TRACK_SCL_Z, tm, scl.z);
|
nuclear@0
|
562 invalidate_cache(node);
|
nuclear@0
|
563 }
|
nuclear@0
|
564
|
nuclear@0
|
565 vec3_t anm_get_node_scaling(struct anm_node *node, anm_time_t tm)
|
nuclear@0
|
566 {
|
nuclear@0
|
567 vec3_t v;
|
nuclear@21
|
568 struct anm_animation *anim0 = anm_get_active_animation(node, 0);
|
nuclear@21
|
569 struct anm_animation *anim1 = anm_get_active_animation(node, 1);
|
nuclear@21
|
570
|
nuclear@21
|
571 if(!anim0) {
|
nuclear@21
|
572 return v3_cons(1, 1, 1);
|
nuclear@21
|
573 }
|
nuclear@21
|
574
|
nuclear@21
|
575 v.x = anm_get_value(anim0->tracks + ANM_TRACK_SCL_X, tm);
|
nuclear@21
|
576 v.y = anm_get_value(anim0->tracks + ANM_TRACK_SCL_Y, tm);
|
nuclear@21
|
577 v.z = anm_get_value(anim0->tracks + ANM_TRACK_SCL_Z, tm);
|
nuclear@21
|
578
|
nuclear@21
|
579 if(anim1) {
|
nuclear@21
|
580 vec3_t v1;
|
nuclear@21
|
581 v1.x = anm_get_value(anim1->tracks + ANM_TRACK_SCL_X, tm);
|
nuclear@21
|
582 v1.y = anm_get_value(anim1->tracks + ANM_TRACK_SCL_Y, tm);
|
nuclear@21
|
583 v1.z = anm_get_value(anim1->tracks + ANM_TRACK_SCL_Z, tm);
|
nuclear@21
|
584
|
nuclear@21
|
585 v.x = v.x + (v1.x - v.x) * node->cur_mix;
|
nuclear@21
|
586 v.y = v.y + (v1.y - v.y) * node->cur_mix;
|
nuclear@21
|
587 v.z = v.z + (v1.z - v.z) * node->cur_mix;
|
nuclear@21
|
588 }
|
nuclear@21
|
589
|
nuclear@0
|
590 return v;
|
nuclear@0
|
591 }
|
nuclear@0
|
592
|
nuclear@0
|
593
|
nuclear@0
|
594 vec3_t anm_get_position(struct anm_node *node, anm_time_t tm)
|
nuclear@0
|
595 {
|
nuclear@0
|
596 mat4_t xform;
|
nuclear@0
|
597 vec3_t pos = {0.0, 0.0, 0.0};
|
nuclear@0
|
598
|
nuclear@0
|
599 if(!node->parent) {
|
nuclear@0
|
600 return anm_get_node_position(node, tm);
|
nuclear@0
|
601 }
|
nuclear@0
|
602
|
nuclear@0
|
603 anm_get_matrix(node, xform, tm);
|
nuclear@0
|
604 return v3_transform(pos, xform);
|
nuclear@0
|
605 }
|
nuclear@0
|
606
|
nuclear@0
|
607 quat_t anm_get_rotation(struct anm_node *node, anm_time_t tm)
|
nuclear@0
|
608 {
|
nuclear@0
|
609 quat_t rot, prot;
|
nuclear@0
|
610 rot = anm_get_node_rotation(node, tm);
|
nuclear@0
|
611
|
nuclear@0
|
612 if(!node->parent) {
|
nuclear@0
|
613 return rot;
|
nuclear@0
|
614 }
|
nuclear@0
|
615
|
nuclear@0
|
616 prot = anm_get_rotation(node->parent, tm);
|
nuclear@0
|
617 return quat_mul(prot, rot);
|
nuclear@0
|
618 }
|
nuclear@0
|
619
|
nuclear@0
|
620 vec3_t anm_get_scaling(struct anm_node *node, anm_time_t tm)
|
nuclear@0
|
621 {
|
nuclear@0
|
622 vec3_t s, ps;
|
nuclear@0
|
623 s = anm_get_node_scaling(node, tm);
|
nuclear@0
|
624
|
nuclear@0
|
625 if(!node->parent) {
|
nuclear@0
|
626 return s;
|
nuclear@0
|
627 }
|
nuclear@0
|
628
|
nuclear@0
|
629 ps = anm_get_scaling(node->parent, tm);
|
nuclear@0
|
630 return v3_mul(s, ps);
|
nuclear@0
|
631 }
|
nuclear@0
|
632
|
nuclear@5
|
633 void anm_get_node_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm)
|
nuclear@5
|
634 {
|
nuclear@9
|
635 int i;
|
nuclear@9
|
636 mat4_t rmat;
|
nuclear@5
|
637 vec3_t pos, scale;
|
nuclear@5
|
638 quat_t rot;
|
nuclear@5
|
639
|
nuclear@5
|
640 pos = anm_get_node_position(node, tm);
|
nuclear@5
|
641 rot = anm_get_node_rotation(node, tm);
|
nuclear@5
|
642 scale = anm_get_node_scaling(node, tm);
|
nuclear@5
|
643
|
nuclear@9
|
644 m4_set_translation(mat, node->pivot.x, node->pivot.y, node->pivot.z);
|
nuclear@5
|
645
|
nuclear@5
|
646 quat_to_mat4(rmat, rot);
|
nuclear@9
|
647 for(i=0; i<3; i++) {
|
nuclear@9
|
648 mat[i][0] = rmat[i][0];
|
nuclear@9
|
649 mat[i][1] = rmat[i][1];
|
nuclear@9
|
650 mat[i][2] = rmat[i][2];
|
nuclear@9
|
651 }
|
nuclear@9
|
652 /* this loop is equivalent to: m4_mult(mat, mat, rmat); */
|
nuclear@5
|
653
|
nuclear@9
|
654 mat[0][0] *= scale.x; mat[0][1] *= scale.y; mat[0][2] *= scale.z; mat[0][3] += pos.x;
|
nuclear@9
|
655 mat[1][0] *= scale.x; mat[1][1] *= scale.y; mat[1][2] *= scale.z; mat[1][3] += pos.y;
|
nuclear@9
|
656 mat[2][0] *= scale.x; mat[2][1] *= scale.y; mat[2][2] *= scale.z; mat[2][3] += pos.z;
|
nuclear@9
|
657
|
nuclear@9
|
658 m4_translate(mat, -node->pivot.x, -node->pivot.y, -node->pivot.z);
|
nuclear@9
|
659
|
nuclear@9
|
660 /* that's basically: pivot * rotation * translation * scaling * -pivot */
|
nuclear@5
|
661 }
|
nuclear@5
|
662
|
nuclear@5
|
663 void anm_get_node_inv_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm)
|
nuclear@5
|
664 {
|
nuclear@5
|
665 mat4_t tmp;
|
nuclear@5
|
666 anm_get_node_matrix(node, tmp, tm);
|
nuclear@5
|
667 m4_inverse(mat, tmp);
|
nuclear@5
|
668 }
|
nuclear@5
|
669
|
nuclear@20
|
670 void anm_eval_node(struct anm_node *node, anm_time_t tm)
|
nuclear@20
|
671 {
|
nuclear@20
|
672 anm_get_node_matrix(node, node->matrix, tm);
|
nuclear@20
|
673 }
|
nuclear@20
|
674
|
nuclear@20
|
675 void anm_eval(struct anm_node *node, anm_time_t tm)
|
nuclear@20
|
676 {
|
nuclear@20
|
677 struct anm_node *c;
|
nuclear@20
|
678
|
nuclear@20
|
679 anm_eval_node(node, tm);
|
nuclear@20
|
680
|
nuclear@20
|
681 if(node->parent) {
|
nuclear@20
|
682 /* due to post-order traversal, the parent matrix is already evaluated */
|
nuclear@20
|
683 m4_mult(node->matrix, node->parent->matrix, node->matrix);
|
nuclear@20
|
684 }
|
nuclear@20
|
685
|
nuclear@20
|
686 /* recersively evaluate all children */
|
nuclear@20
|
687 c = node->child;
|
nuclear@20
|
688 while(c) {
|
nuclear@20
|
689 anm_eval(c, tm);
|
nuclear@20
|
690 c = c->next;
|
nuclear@20
|
691 }
|
nuclear@20
|
692 }
|
nuclear@20
|
693
|
nuclear@0
|
694 void anm_get_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm)
|
nuclear@0
|
695 {
|
nuclear@0
|
696 struct mat_cache *cache = pthread_getspecific(node->cache_key);
|
nuclear@0
|
697 if(!cache) {
|
nuclear@0
|
698 cache = malloc(sizeof *cache);
|
nuclear@0
|
699 assert(cache);
|
nuclear@0
|
700
|
nuclear@0
|
701 pthread_mutex_lock(&node->cache_list_lock);
|
nuclear@0
|
702 cache->next = node->cache_list;
|
nuclear@0
|
703 node->cache_list = cache;
|
nuclear@0
|
704 pthread_mutex_unlock(&node->cache_list_lock);
|
nuclear@0
|
705
|
nuclear@0
|
706 cache->time = ANM_TIME_INVAL;
|
nuclear@2
|
707 cache->inv_time = ANM_TIME_INVAL;
|
nuclear@0
|
708 pthread_setspecific(node->cache_key, cache);
|
nuclear@0
|
709 }
|
nuclear@0
|
710
|
nuclear@0
|
711 if(cache->time != tm) {
|
nuclear@5
|
712 anm_get_node_matrix(node, cache->matrix, tm);
|
nuclear@0
|
713
|
nuclear@0
|
714 if(node->parent) {
|
nuclear@0
|
715 mat4_t parent_mat;
|
nuclear@0
|
716
|
nuclear@4
|
717 anm_get_matrix(node->parent, parent_mat, tm);
|
nuclear@0
|
718 m4_mult(cache->matrix, parent_mat, cache->matrix);
|
nuclear@0
|
719 }
|
nuclear@0
|
720 cache->time = tm;
|
nuclear@0
|
721 }
|
nuclear@0
|
722 m4_copy(mat, cache->matrix);
|
nuclear@0
|
723 }
|
nuclear@0
|
724
|
nuclear@0
|
725 void anm_get_inv_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm)
|
nuclear@0
|
726 {
|
nuclear@0
|
727 struct mat_cache *cache = pthread_getspecific(node->cache_key);
|
nuclear@0
|
728 if(!cache) {
|
nuclear@0
|
729 cache = malloc(sizeof *cache);
|
nuclear@0
|
730 assert(cache);
|
nuclear@0
|
731
|
nuclear@0
|
732 pthread_mutex_lock(&node->cache_list_lock);
|
nuclear@0
|
733 cache->next = node->cache_list;
|
nuclear@0
|
734 node->cache_list = cache;
|
nuclear@0
|
735 pthread_mutex_unlock(&node->cache_list_lock);
|
nuclear@0
|
736
|
nuclear@0
|
737 cache->inv_time = ANM_TIME_INVAL;
|
nuclear@2
|
738 cache->inv_time = ANM_TIME_INVAL;
|
nuclear@0
|
739 pthread_setspecific(node->cache_key, cache);
|
nuclear@0
|
740 }
|
nuclear@0
|
741
|
nuclear@0
|
742 if(cache->inv_time != tm) {
|
nuclear@0
|
743 anm_get_matrix(node, mat, tm);
|
nuclear@0
|
744 m4_inverse(cache->inv_matrix, mat);
|
nuclear@0
|
745 cache->inv_time = tm;
|
nuclear@0
|
746 }
|
nuclear@0
|
747 m4_copy(mat, cache->inv_matrix);
|
nuclear@0
|
748 }
|
nuclear@0
|
749
|
nuclear@0
|
750 anm_time_t anm_get_start_time(struct anm_node *node)
|
nuclear@0
|
751 {
|
nuclear@21
|
752 int i, j;
|
nuclear@0
|
753 struct anm_node *c;
|
nuclear@0
|
754 anm_time_t res = LONG_MAX;
|
nuclear@0
|
755
|
nuclear@21
|
756 for(j=0; j<2; j++) {
|
nuclear@21
|
757 struct anm_animation *anim = anm_get_active_animation(node, j);
|
nuclear@21
|
758 if(!anim) break;
|
nuclear@21
|
759
|
nuclear@21
|
760 for(i=0; i<ANM_NUM_TRACKS; i++) {
|
nuclear@21
|
761 if(anim->tracks[i].count) {
|
nuclear@21
|
762 anm_time_t tm = anim->tracks[i].keys[0].time;
|
nuclear@21
|
763 if(tm < res) {
|
nuclear@21
|
764 res = tm;
|
nuclear@21
|
765 }
|
nuclear@0
|
766 }
|
nuclear@0
|
767 }
|
nuclear@0
|
768 }
|
nuclear@0
|
769
|
nuclear@0
|
770 c = node->child;
|
nuclear@0
|
771 while(c) {
|
nuclear@0
|
772 anm_time_t tm = anm_get_start_time(c);
|
nuclear@0
|
773 if(tm < res) {
|
nuclear@0
|
774 res = tm;
|
nuclear@0
|
775 }
|
nuclear@0
|
776 c = c->next;
|
nuclear@0
|
777 }
|
nuclear@0
|
778 return res;
|
nuclear@0
|
779 }
|
nuclear@0
|
780
|
nuclear@0
|
781 anm_time_t anm_get_end_time(struct anm_node *node)
|
nuclear@0
|
782 {
|
nuclear@21
|
783 int i, j;
|
nuclear@0
|
784 struct anm_node *c;
|
nuclear@0
|
785 anm_time_t res = LONG_MIN;
|
nuclear@0
|
786
|
nuclear@21
|
787 for(j=0; j<2; j++) {
|
nuclear@21
|
788 struct anm_animation *anim = anm_get_active_animation(node, j);
|
nuclear@21
|
789 if(!anim) break;
|
nuclear@21
|
790
|
nuclear@21
|
791 for(i=0; i<ANM_NUM_TRACKS; i++) {
|
nuclear@21
|
792 if(anim->tracks[i].count) {
|
nuclear@21
|
793 anm_time_t tm = anim->tracks[i].keys[anim->tracks[i].count - 1].time;
|
nuclear@21
|
794 if(tm > res) {
|
nuclear@21
|
795 res = tm;
|
nuclear@21
|
796 }
|
nuclear@0
|
797 }
|
nuclear@0
|
798 }
|
nuclear@0
|
799 }
|
nuclear@0
|
800
|
nuclear@0
|
801 c = node->child;
|
nuclear@0
|
802 while(c) {
|
nuclear@0
|
803 anm_time_t tm = anm_get_end_time(c);
|
nuclear@0
|
804 if(tm > res) {
|
nuclear@0
|
805 res = tm;
|
nuclear@0
|
806 }
|
nuclear@0
|
807 c = c->next;
|
nuclear@0
|
808 }
|
nuclear@0
|
809 return res;
|
nuclear@0
|
810 }
|
nuclear@0
|
811
|
nuclear@0
|
812 static void invalidate_cache(struct anm_node *node)
|
nuclear@0
|
813 {
|
nuclear@0
|
814 struct mat_cache *cache = pthread_getspecific(node->cache_key);
|
nuclear@0
|
815 if(cache) {
|
nuclear@13
|
816 cache->time = cache->inv_time = ANM_TIME_INVAL;
|
nuclear@0
|
817 }
|
nuclear@0
|
818 }
|