1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
/**
* $Id$
* ***** BEGIN GPL LICENSE BLOCK *****
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Original author: Benoit Bolsee
* Contributor(s):
*
* ***** END GPL LICENSE BLOCK *****
*/
#include "MEM_guardedalloc.h"
#include "BIK_api.h"
#include "BLI_blenlib.h"
#include "BLI_arithb.h"
#include "BKE_armature.h"
#include "BKE_utildefines.h"
#include "DNA_object_types.h"
#include "DNA_action_types.h"
#include "DNA_scene_types.h"
#include "DNA_constraint_types.h"
#include "DNA_armature_types.h"
#include "ikplugin_api.h"
#include "iksolver_plugin.h"
#include "itasc_plugin.h"
static IKPlugin ikplugin_tab[BIK_SOLVER_COUNT] = {
/* Legacy IK solver */
{
iksolver_initialize_tree,
iksolver_execute_tree,
NULL,
NULL,
NULL,
NULL,
NULL,
},
/* iTaSC IK solver */
{
itasc_initialize_tree,
itasc_execute_tree,
itasc_release_tree,
itasc_clear_data,
itasc_clear_cache,
itasc_update_param,
itasc_test_constraint,
}
};
static IKPlugin *get_plugin(bPose *pose)
{
if (!pose || pose->iksolver < 0 || pose->iksolver >= BIK_SOLVER_COUNT)
return NULL;
return &ikplugin_tab[pose->iksolver];
}
/*----------------------------------------*/
/* Plugin API */
void BIK_initialize_tree(Scene *scene, Object *ob, float ctime)
{
IKPlugin *plugin = get_plugin(ob->pose);
if (plugin && plugin->initialize_tree_func)
plugin->initialize_tree_func(scene, ob, ctime);
}
void BIK_execute_tree(struct Scene *scene, Object *ob, bPoseChannel *pchan, float ctime)
{
IKPlugin *plugin = get_plugin(ob->pose);
if (plugin && plugin->execute_tree_func)
plugin->execute_tree_func(scene, ob, pchan, ctime);
}
void BIK_release_tree(struct Scene *scene, Object *ob, float ctime)
{
IKPlugin *plugin = get_plugin(ob->pose);
if (plugin && plugin->release_tree_func)
plugin->release_tree_func(scene, ob, ctime);
}
void BIK_clear_data(struct bPose *pose)
{
IKPlugin *plugin = get_plugin(pose);
if (plugin && plugin->remove_armature_func)
plugin->remove_armature_func(pose);
}
void BIK_clear_cache(struct bPose *pose)
{
IKPlugin *plugin = get_plugin(pose);
if (plugin && plugin->clear_cache)
plugin->clear_cache(pose);
}
void BIK_update_param(struct bPose *pose)
{
IKPlugin *plugin = get_plugin(pose);
if (plugin && plugin->update_param)
plugin->update_param(pose);
}
void BIK_test_constraint(struct Object *ob, struct bConstraint *cons)
{
IKPlugin *plugin = get_plugin(ob->pose);
if (plugin && plugin->test_constraint)
plugin->test_constraint(ob, cons);
}
|
