libanim
view src/anim.h @ 18:2317c40b8dcb
added local install post-build event in the vs2008 vcproj
| author | John Tsiombikas <nuclear@member.fsf.org> |
|---|---|
| date | Sat, 16 Nov 2013 09:08:42 +0200 |
| parents | 69654793abc3 |
| children | 3c2428cb38f7 |
line source
1 #ifndef LIBANIM_H_
2 #define LIBANIM_H_
4 #include "config.h"
6 #include <pthread.h>
8 #include <vmath/vector.h>
9 #include <vmath/quat.h>
10 #include <vmath/matrix.h>
11 #include "track.h"
13 enum {
14 ANM_TRACK_POS_X,
15 ANM_TRACK_POS_Y,
16 ANM_TRACK_POS_Z,
18 ANM_TRACK_ROT_X,
19 ANM_TRACK_ROT_Y,
20 ANM_TRACK_ROT_Z,
21 ANM_TRACK_ROT_W,
23 ANM_TRACK_SCL_X,
24 ANM_TRACK_SCL_Y,
25 ANM_TRACK_SCL_Z,
27 ANM_NUM_TRACKS
28 };
30 struct anm_node {
31 char *name;
33 struct anm_track tracks[ANM_NUM_TRACKS];
34 vec3_t pivot;
36 /* matrix cache */
37 struct mat_cache {
38 mat4_t matrix, inv_matrix;
39 anm_time_t time, inv_time;
40 struct mat_cache *next;
41 } *cache_list;
42 pthread_key_t cache_key;
43 pthread_mutex_t cache_list_lock;
45 struct anm_node *parent;
46 struct anm_node *child;
47 struct anm_node *next;
48 };
50 #ifdef __cplusplus
51 extern "C" {
52 #endif
54 /* node constructor and destructor */
55 int anm_init_node(struct anm_node *node);
56 void anm_destroy_node(struct anm_node *node);
58 /* recursively destroy an animation node tree */
59 void anm_destroy_node_tree(struct anm_node *tree);
61 /* helper functions to allocate/construct and destroy/free with
62 * a single call. They call anm_init_node and anm_destroy_node
63 * internally.
64 */
65 struct anm_node *anm_create_node(void);
66 void anm_free_node(struct anm_node *node);
68 /* recursively destroy and free the nodes of a node tree */
69 void anm_free_node_tree(struct anm_node *tree);
71 int anm_set_node_name(struct anm_node *node, const char *name);
72 const char *anm_get_node_name(struct anm_node *node);
74 void anm_set_interpolator(struct anm_node *node, enum anm_interpolator in);
75 void anm_set_extrapolator(struct anm_node *node, enum anm_extrapolator ex);
77 /* link and unlink nodes with parent/child relations */
78 void anm_link_node(struct anm_node *parent, struct anm_node *child);
79 int anm_unlink_node(struct anm_node *parent, struct anm_node *child);
81 void anm_set_position(struct anm_node *node, vec3_t pos, anm_time_t tm);
82 vec3_t anm_get_node_position(struct anm_node *node, anm_time_t tm);
84 void anm_set_rotation(struct anm_node *node, quat_t rot, anm_time_t tm);
85 quat_t anm_get_node_rotation(struct anm_node *node, anm_time_t tm);
87 void anm_set_scaling(struct anm_node *node, vec3_t scl, anm_time_t tm);
88 vec3_t anm_get_node_scaling(struct anm_node *node, anm_time_t tm);
90 /* these three return the full p/r/s taking hierarchy into account */
91 vec3_t anm_get_position(struct anm_node *node, anm_time_t tm);
92 quat_t anm_get_rotation(struct anm_node *node, anm_time_t tm);
93 vec3_t anm_get_scaling(struct anm_node *node, anm_time_t tm);
95 void anm_set_pivot(struct anm_node *node, vec3_t pivot);
96 vec3_t anm_get_pivot(struct anm_node *node);
98 /* these calculate the matrix and inverse matrix of this node alone */
99 void anm_get_node_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm);
100 void anm_get_node_inv_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm);
102 /* These calculate the matrix and inverse matrix of this node taking hierarchy
103 * into account. The results are cached in thread-specific storage and returned
104 * if there's no change in time or tracks from the last query...
105 */
106 void anm_get_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm);
107 void anm_get_inv_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm);
109 /* those return the start and end times of the whole tree */
110 anm_time_t anm_get_start_time(struct anm_node *node);
111 anm_time_t anm_get_end_time(struct anm_node *node);
113 #ifdef __cplusplus
114 }
115 #endif
117 #endif /* LIBANIM_H_ */