libanim

view src/anim.h @ 0:fad4701f484e

find changesets by author, revision, files, or words in the commit message
libanim mercurial repo
author John Tsiombikas <nuclear@mutantstargoat.com>
date Sun, 08 Jan 2012 05:13:13 +0200
parents
children 69654793abc3
line source
1 #ifndef LIBANIM_H_
2 #define LIBANIM_H_
3
4 #include "config.h"
5
6 #include <pthread.h>
7
8 #include <vmath/vmath.h>
9 #include "track.h"
10
11 enum {
12 ANM_TRACK_POS_X,
13 ANM_TRACK_POS_Y,
14 ANM_TRACK_POS_Z,
15
16 ANM_TRACK_ROT_X,
17 ANM_TRACK_ROT_Y,
18 ANM_TRACK_ROT_Z,
19 ANM_TRACK_ROT_W,
20
21 ANM_TRACK_SCL_X,
22 ANM_TRACK_SCL_Y,
23 ANM_TRACK_SCL_Z,
24
25 ANM_NUM_TRACKS
26 };
27
28 struct anm_node {
29 char *name;
30
31 struct anm_track tracks[ANM_NUM_TRACKS];
32 vec3_t pivot;
33
34 /* matrix cache */
35 struct mat_cache {
36 mat4_t matrix, inv_matrix;
37 anm_time_t time, inv_time;
38 struct mat_cache *next;
39 } *cache_list;
40 pthread_key_t cache_key;
41 pthread_mutex_t cache_list_lock;
42
43 struct anm_node *parent;
44 struct anm_node *child;
45 struct anm_node *next;
46 };
47
48 #ifdef __cplusplus
49 extern "C" {
50 #endif
51
52 /* node constructor and destructor */
53 int anm_init_node(struct anm_node *node);
54 void anm_destroy_node(struct anm_node *node);
55
56 /* recursively destroy an animation node tree */
57 void anm_destroy_node_tree(struct anm_node *tree);
58
59 /* helper functions to allocate/construct and destroy/free with
60 * a single call. They call anm_init_node and anm_destroy_node
61 * internally.
62 */
63 struct anm_node *anm_create_node(void);
64 void anm_free_node(struct anm_node *node);
65
66 /* recursively destroy and free the nodes of a node tree */
67 void anm_free_node_tree(struct anm_node *tree);
68
69 int anm_set_node_name(struct anm_node *node, const char *name);
70 const char *anm_get_node_name(struct anm_node *node);
71
72 void anm_set_interpolator(struct anm_node *node, enum anm_interpolator in);
73 void anm_set_extrapolator(struct anm_node *node, enum anm_extrapolator ex);
74
75 /* link and unlink nodes with parent/child relations */
76 void anm_link_node(struct anm_node *parent, struct anm_node *child);
77 int anm_unlink_node(struct anm_node *parent, struct anm_node *child);
78
79 void anm_set_position(struct anm_node *node, vec3_t pos, anm_time_t tm);
80 vec3_t anm_get_node_position(struct anm_node *node, anm_time_t tm);
81
82 void anm_set_rotation(struct anm_node *node, quat_t rot, anm_time_t tm);
83 quat_t anm_get_node_rotation(struct anm_node *node, anm_time_t tm);
84
85 void anm_set_scaling(struct anm_node *node, vec3_t scl, anm_time_t tm);
86 vec3_t anm_get_node_scaling(struct anm_node *node, anm_time_t tm);
87
88 /* these three return the full p/r/s taking hierarchy into account */
89 vec3_t anm_get_position(struct anm_node *node, anm_time_t tm);
90 quat_t anm_get_rotation(struct anm_node *node, anm_time_t tm);
91 vec3_t anm_get_scaling(struct anm_node *node, anm_time_t tm);
92
93 void anm_set_pivot(struct anm_node *node, vec3_t pivot);
94 vec3_t anm_get_pivot(struct anm_node *node);
95
96 void anm_get_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm);
97 void anm_get_inv_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm);
98
99 /* those return the start and end times of the whole tree */
100 anm_time_t anm_get_start_time(struct anm_node *node);
101 anm_time_t anm_get_end_time(struct anm_node *node);
102
103 #ifdef __cplusplus
104 }
105 #endif
106
107 #endif /* LIBANIM_H_ */