gpuray_glsl

view anim/anim.h @ 2:6e3a4daf3159

find changesets by author, revision, files, or words in the commit message
adding cones
author John Tsiombikas <nuclear@mutantstargoat.com>
date Sun, 09 Nov 2014 14:39:01 +0200
parents f234630e38ff
children
line source
1 #ifndef LIBANIM_H_
2 #define LIBANIM_H_
3
4 #include "config.h"
5
6 #include <pthread.h>
7
8 #include <vmath/vector.h>
9 #include <vmath/quat.h>
10 #include <vmath/matrix.h>
11 #include "track.h"
12
13 enum {
14 ANM_TRACK_POS_X,
15 ANM_TRACK_POS_Y,
16 ANM_TRACK_POS_Z,
17
18 ANM_TRACK_ROT_X,
19 ANM_TRACK_ROT_Y,
20 ANM_TRACK_ROT_Z,
21 ANM_TRACK_ROT_W,
22
23 ANM_TRACK_SCL_X,
24 ANM_TRACK_SCL_Y,
25 ANM_TRACK_SCL_Z,
26
27 ANM_NUM_TRACKS
28 };
29
30 struct anm_node {
31 char *name;
32
33 struct anm_track tracks[ANM_NUM_TRACKS];
34 vec3_t pivot;
35
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 #ifdef ANIM_THREAD_SAFE
43 pthread_key_t cache_key;
44 pthread_mutex_t cache_list_lock;
45 #endif
46
47 struct anm_node *parent;
48 struct anm_node *child;
49 struct anm_node *next;
50 };
51
52 #ifdef __cplusplus
53 extern "C" {
54 #endif
55
56 /* node constructor and destructor */
57 int anm_init_node(struct anm_node *node);
58 void anm_destroy_node(struct anm_node *node);
59
60 /* recursively destroy an animation node tree */
61 void anm_destroy_node_tree(struct anm_node *tree);
62
63 /* helper functions to allocate/construct and destroy/free with
64 * a single call. They call anm_init_node and anm_destroy_node
65 * internally.
66 */
67 struct anm_node *anm_create_node(void);
68 void anm_free_node(struct anm_node *node);
69
70 /* recursively destroy and free the nodes of a node tree */
71 void anm_free_node_tree(struct anm_node *tree);
72
73 int anm_set_node_name(struct anm_node *node, const char *name);
74 const char *anm_get_node_name(struct anm_node *node);
75
76 void anm_set_interpolator(struct anm_node *node, enum anm_interpolator in);
77 void anm_set_extrapolator(struct anm_node *node, enum anm_extrapolator ex);
78
79 /* link and unlink nodes with parent/child relations */
80 void anm_link_node(struct anm_node *parent, struct anm_node *child);
81 int anm_unlink_node(struct anm_node *parent, struct anm_node *child);
82
83 void anm_set_position(struct anm_node *node, vec3_t pos, anm_time_t tm);
84 vec3_t anm_get_node_position(struct anm_node *node, anm_time_t tm);
85
86 void anm_set_rotation(struct anm_node *node, quat_t rot, anm_time_t tm);
87 quat_t anm_get_node_rotation(struct anm_node *node, anm_time_t tm);
88
89 void anm_set_scaling(struct anm_node *node, vec3_t scl, anm_time_t tm);
90 vec3_t anm_get_node_scaling(struct anm_node *node, anm_time_t tm);
91
92 /* these three return the full p/r/s taking hierarchy into account */
93 vec3_t anm_get_position(struct anm_node *node, anm_time_t tm);
94 quat_t anm_get_rotation(struct anm_node *node, anm_time_t tm);
95 vec3_t anm_get_scaling(struct anm_node *node, anm_time_t tm);
96
97 void anm_set_pivot(struct anm_node *node, vec3_t pivot);
98 vec3_t anm_get_pivot(struct anm_node *node);
99
100 /* these calculate the matrix and inverse matrix of this node alone */
101 void anm_get_node_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm);
102 void anm_get_node_inv_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm);
103
104 /* These calculate the matrix and inverse matrix of this node taking hierarchy
105 * into account. The results are cached in thread-specific storage and returned
106 * if there's no change in time or tracks from the last query...
107 */
108 void anm_get_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm);
109 void anm_get_inv_matrix(struct anm_node *node, mat4_t mat, anm_time_t tm);
110
111 /* those return the start and end times of the whole tree */
112 anm_time_t anm_get_start_time(struct anm_node *node);
113 anm_time_t anm_get_end_time(struct anm_node *node);
114
115 #ifdef __cplusplus
116 }
117 #endif
118
119 #endif /* LIBANIM_H_ */