2011-02-23 10:52:22 +00:00
|
|
|
/*
|
2010-10-05 00:05:14 +00:00
|
|
|
* ***** 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
*
|
|
|
|
* Contributor(s): Chingiz Dyussenov, Arystanbek Dyussenov, Nathan Letwory.
|
|
|
|
*
|
|
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
|
|
*/
|
|
|
|
|
2011-02-27 20:30:35 +00:00
|
|
|
/** \file blender/collada/collada_utils.cpp
|
|
|
|
* \ingroup collada
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
2011-02-12 06:25:04 +00:00
|
|
|
/* COLLADABU_ASSERT, may be able to remove later */
|
|
|
|
#include "COLLADABUPlatform.h"
|
|
|
|
|
2010-10-05 00:05:14 +00:00
|
|
|
#include "COLLADAFWGeometry.h"
|
|
|
|
#include "COLLADAFWMeshPrimitive.h"
|
|
|
|
#include "COLLADAFWMeshVertexData.h"
|
|
|
|
|
2012-06-15 22:00:25 +00:00
|
|
|
extern "C" {
|
2012-06-07 17:55:26 +00:00
|
|
|
#include "DNA_modifier_types.h"
|
2010-10-05 00:05:14 +00:00
|
|
|
#include "DNA_customdata_types.h"
|
|
|
|
#include "DNA_object_types.h"
|
2012-06-07 17:55:26 +00:00
|
|
|
#include "DNA_mesh_types.h"
|
2012-05-03 21:32:49 +00:00
|
|
|
#include "DNA_scene_types.h"
|
2012-06-15 22:00:25 +00:00
|
|
|
#include "DNA_armature_types.h"
|
2010-10-05 00:05:14 +00:00
|
|
|
|
|
|
|
#include "BLI_math.h"
|
2012-11-01 15:34:38 +00:00
|
|
|
#include "BLI_linklist.h"
|
2013-03-03 01:24:09 +00:00
|
|
|
|
2010-10-05 00:05:14 +00:00
|
|
|
#include "BKE_context.h"
|
|
|
|
#include "BKE_customdata.h"
|
|
|
|
#include "BKE_object.h"
|
2013-02-05 13:16:21 +00:00
|
|
|
#include "BKE_global.h"
|
2017-11-08 12:16:49 -02:00
|
|
|
#include "BKE_layer.h"
|
2012-06-07 17:55:26 +00:00
|
|
|
#include "BKE_mesh.h"
|
2012-05-03 21:32:49 +00:00
|
|
|
#include "BKE_scene.h"
|
2012-06-07 17:55:26 +00:00
|
|
|
#include "BKE_DerivedMesh.h"
|
|
|
|
|
2016-05-28 18:41:54 +02:00
|
|
|
#include "ED_armature.h"
|
|
|
|
|
2010-10-05 00:05:14 +00:00
|
|
|
#include "WM_api.h" // XXX hrm, see if we can do without this
|
|
|
|
#include "WM_types.h"
|
2013-08-23 11:16:52 +00:00
|
|
|
|
2013-03-03 01:24:09 +00:00
|
|
|
#include "bmesh.h"
|
2013-08-23 11:16:52 +00:00
|
|
|
#include "bmesh_tools.h"
|
2012-06-15 22:00:25 +00:00
|
|
|
}
|
2010-10-05 00:05:14 +00:00
|
|
|
|
2017-04-06 16:17:21 +02:00
|
|
|
#include "DEG_depsgraph.h"
|
|
|
|
|
2017-04-01 15:29:40 +02:00
|
|
|
#include "collada_utils.h"
|
|
|
|
#include "ExportSettings.h"
|
|
|
|
|
2010-10-05 00:05:14 +00:00
|
|
|
float bc_get_float_value(const COLLADAFW::FloatOrDoubleArray& array, unsigned int index)
|
|
|
|
{
|
|
|
|
if (index >= array.getValuesCount())
|
|
|
|
return 0.0f;
|
|
|
|
|
|
|
|
if (array.getType() == COLLADAFW::MeshVertexData::DATA_TYPE_FLOAT)
|
|
|
|
return array.getFloatValues()->getData()[index];
|
|
|
|
else
|
|
|
|
return array.getDoubleValues()->getData()[index];
|
|
|
|
}
|
|
|
|
|
|
|
|
// copied from /editors/object/object_relations.c
|
|
|
|
int bc_test_parent_loop(Object *par, Object *ob)
|
|
|
|
{
|
|
|
|
/* test if 'ob' is a parent somewhere in par's parents */
|
|
|
|
|
2012-03-24 07:52:14 +00:00
|
|
|
if (par == NULL) return 0;
|
|
|
|
if (ob == par) return 1;
|
2010-10-05 00:05:14 +00:00
|
|
|
|
|
|
|
return bc_test_parent_loop(par->parent, ob);
|
|
|
|
}
|
|
|
|
|
|
|
|
// a shortened version of parent_set_exec()
|
|
|
|
// if is_parent_space is true then ob->obmat will be multiplied by par->obmat before parenting
|
|
|
|
int bc_set_parent(Object *ob, Object *par, bContext *C, bool is_parent_space)
|
|
|
|
{
|
|
|
|
Object workob;
|
|
|
|
Scene *sce = CTX_data_scene(C);
|
2017-07-21 11:53:13 +02:00
|
|
|
EvaluationContext eval_ctx;
|
|
|
|
|
|
|
|
CTX_data_eval_ctx(C, &eval_ctx);
|
2010-10-05 00:05:14 +00:00
|
|
|
|
|
|
|
if (!par || bc_test_parent_loop(par, ob))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
ob->parent = par;
|
|
|
|
ob->partype = PAROBJECT;
|
|
|
|
|
|
|
|
ob->parsubstr[0] = 0;
|
|
|
|
|
|
|
|
if (is_parent_space) {
|
|
|
|
float mat[4][4];
|
|
|
|
// calc par->obmat
|
2017-07-21 11:53:13 +02:00
|
|
|
BKE_object_where_is_calc(&eval_ctx, sce, par);
|
2010-10-05 00:05:14 +00:00
|
|
|
|
|
|
|
// move child obmat into world space
|
2013-05-26 18:36:25 +00:00
|
|
|
mul_m4_m4m4(mat, par->obmat, ob->obmat);
|
2010-10-05 00:05:14 +00:00
|
|
|
copy_m4_m4(ob->obmat, mat);
|
|
|
|
}
|
|
|
|
|
|
|
|
// apply child obmat (i.e. decompose it into rot/loc/size)
|
2017-07-21 17:44:11 +02:00
|
|
|
BKE_object_apply_mat4(ob, ob->obmat, 0, 0);
|
2010-10-05 00:05:14 +00:00
|
|
|
|
|
|
|
// compute parentinv
|
2017-07-21 11:53:13 +02:00
|
|
|
BKE_object_workob_calc_parent(&eval_ctx, sce, ob, &workob);
|
2010-10-05 00:05:14 +00:00
|
|
|
invert_m4_m4(ob->parentinv, workob.obmat);
|
|
|
|
|
2017-04-06 16:17:21 +02:00
|
|
|
DEG_id_tag_update(&ob->id, OB_RECALC_OB | OB_RECALC_DATA);
|
|
|
|
DEG_id_tag_update(&par->id, OB_RECALC_OB);
|
2010-10-05 00:05:14 +00:00
|
|
|
|
2013-03-05 14:47:49 +00:00
|
|
|
/** done once after import */
|
|
|
|
#if 0
|
2017-06-08 10:14:53 +02:00
|
|
|
DEG_relations_tag_update(bmain);
|
2012-06-12 22:05:33 +00:00
|
|
|
WM_event_add_notifier(C, NC_OBJECT | ND_TRANSFORM, NULL);
|
2013-03-05 14:47:49 +00:00
|
|
|
#endif
|
2010-10-05 00:05:14 +00:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2012-05-03 21:32:49 +00:00
|
|
|
Object *bc_add_object(Scene *scene, int type, const char *name)
|
|
|
|
{
|
2013-02-05 13:16:21 +00:00
|
|
|
Object *ob = BKE_object_add_only_object(G.main, type, name);
|
2012-05-03 21:32:49 +00:00
|
|
|
|
2015-05-04 12:25:33 +10:00
|
|
|
ob->data = BKE_object_obdata_add_from_type(G.main, type, name);
|
2012-06-12 22:05:33 +00:00
|
|
|
ob->lay = scene->lay;
|
2017-04-06 16:17:21 +02:00
|
|
|
DEG_id_tag_update(&ob->id, OB_RECALC_OB | OB_RECALC_DATA | OB_RECALC_TIME);
|
2012-05-03 21:32:49 +00:00
|
|
|
|
2017-11-08 12:16:49 -02:00
|
|
|
/* XXX Collada should use the context scene layer, not the scene one. (dfelinto/gaia). */
|
|
|
|
SceneLayer *scene_layer = BKE_scene_layer_context_active_PLACEHOLDER(scene);
|
|
|
|
|
|
|
|
LayerCollection *layer_collection = BKE_layer_collection_get_active_ensure(scene, scene_layer);
|
|
|
|
BKE_collection_object_add(scene, layer_collection->scene_collection, ob);
|
|
|
|
|
|
|
|
Base *base = BKE_scene_layer_base_find(scene_layer, ob);
|
|
|
|
BKE_scene_layer_base_select(scene_layer, base);
|
2012-05-03 21:32:49 +00:00
|
|
|
|
|
|
|
return ob;
|
|
|
|
}
|
|
|
|
|
2017-08-16 12:45:11 +10:00
|
|
|
Mesh *bc_get_mesh_copy(const struct EvaluationContext *eval_ctx, Scene *scene, Object *ob, BC_export_mesh_type export_mesh_type, bool apply_modifiers, bool triangulate)
|
2012-06-07 17:55:26 +00:00
|
|
|
{
|
|
|
|
Mesh *tmpmesh;
|
|
|
|
CustomDataMask mask = CD_MASK_MESH;
|
2015-05-06 17:03:24 +02:00
|
|
|
Mesh *mesh = (Mesh *)ob->data;
|
2012-12-02 16:01:06 +00:00
|
|
|
DerivedMesh *dm = NULL;
|
2013-03-18 18:25:05 +00:00
|
|
|
if (apply_modifiers) {
|
2013-03-02 15:58:13 +00:00
|
|
|
switch (export_mesh_type) {
|
2013-07-19 10:40:43 +00:00
|
|
|
case BC_MESH_TYPE_VIEW:
|
|
|
|
{
|
2017-07-21 17:44:11 +02:00
|
|
|
dm = mesh_create_derived_view(eval_ctx, scene, ob, mask);
|
2013-03-02 15:58:13 +00:00
|
|
|
break;
|
|
|
|
}
|
2013-07-19 10:40:43 +00:00
|
|
|
case BC_MESH_TYPE_RENDER:
|
|
|
|
{
|
2017-07-21 17:44:11 +02:00
|
|
|
dm = mesh_create_derived_render(eval_ctx, scene, ob, mask);
|
2013-03-02 15:58:13 +00:00
|
|
|
break;
|
|
|
|
}
|
2012-06-16 23:35:53 +00:00
|
|
|
}
|
|
|
|
}
|
2013-03-02 15:58:13 +00:00
|
|
|
else {
|
2013-12-26 08:26:41 +11:00
|
|
|
dm = mesh_create_derived((Mesh *)ob->data, NULL);
|
2013-03-02 15:58:13 +00:00
|
|
|
}
|
2012-06-16 23:35:53 +00:00
|
|
|
|
2013-02-05 13:04:01 +00:00
|
|
|
tmpmesh = BKE_mesh_add(G.main, "ColladaMesh"); // name is not important here
|
2015-02-19 00:00:23 +05:00
|
|
|
DM_to_mesh(dm, tmpmesh, ob, CD_MASK_MESH, true);
|
2015-05-06 17:03:24 +02:00
|
|
|
tmpmesh->flag = mesh->flag;
|
2013-03-02 15:58:13 +00:00
|
|
|
|
|
|
|
if (triangulate) {
|
2015-05-27 13:19:40 +02:00
|
|
|
bc_triangulate_mesh(tmpmesh);
|
2013-03-02 15:58:13 +00:00
|
|
|
}
|
2015-05-27 13:19:40 +02:00
|
|
|
BKE_mesh_tessface_ensure(tmpmesh);
|
2012-06-07 17:55:26 +00:00
|
|
|
return tmpmesh;
|
|
|
|
}
|
|
|
|
|
|
|
|
Object *bc_get_assigned_armature(Object *ob)
|
|
|
|
{
|
|
|
|
Object *ob_arm = NULL;
|
|
|
|
|
|
|
|
if (ob->parent && ob->partype == PARSKEL && ob->parent->type == OB_ARMATURE) {
|
|
|
|
ob_arm = ob->parent;
|
|
|
|
}
|
|
|
|
else {
|
2012-06-12 22:05:33 +00:00
|
|
|
ModifierData *mod;
|
|
|
|
for (mod = (ModifierData *)ob->modifiers.first; mod; mod = mod->next) {
|
2012-06-07 17:55:26 +00:00
|
|
|
if (mod->type == eModifierType_Armature) {
|
2012-06-12 22:05:33 +00:00
|
|
|
ob_arm = ((ArmatureModifierData *)mod)->object;
|
2012-06-07 17:55:26 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return ob_arm;
|
|
|
|
}
|
|
|
|
|
2012-06-12 21:25:29 +00:00
|
|
|
// Returns the highest selected ancestor
|
|
|
|
// returns NULL if no ancestor is selected
|
|
|
|
// IMPORTANT: This function expects that
|
|
|
|
// all exported objects have set:
|
Split id->flag in two, persistent flags and runtime tags.
This is purely internal sanitizing/cleanup, no change in behavior is expected at all.
This change was also needed because we were getting short on ID flags, and
future enhancement of 'user_one' ID behavior requires two new ones.
id->flag remains for persistent data (fakeuser only, so far!), this also allows us
100% backward & forward compatibility.
New id->tag is used for most flags. Though written in .blend files, its content
is cleared at read time.
Note that .blend file version was bumped, so that we can clear runtimeflags from
old .blends, important in case we add new persistent flags in future.
Also, behavior of tags (either status ones, or whether they need to be cleared before/after use)
has been added as comments to their declaration.
Reviewers: sergey, campbellbarton
Differential Revision: https://developer.blender.org/D1683
2015-12-27 11:53:50 +01:00
|
|
|
// ob->id.tag & LIB_TAG_DOIT
|
2012-06-12 21:25:29 +00:00
|
|
|
Object *bc_get_highest_selected_ancestor_or_self(LinkNode *export_set, Object *ob)
|
|
|
|
{
|
|
|
|
Object *ancestor = ob;
|
2012-06-27 18:29:47 +00:00
|
|
|
while (ob->parent && bc_is_marked(ob->parent)) {
|
2012-06-12 21:25:29 +00:00
|
|
|
ob = ob->parent;
|
|
|
|
ancestor = ob;
|
|
|
|
}
|
|
|
|
return ancestor;
|
|
|
|
}
|
|
|
|
|
2012-06-15 22:00:25 +00:00
|
|
|
|
2012-06-12 21:25:29 +00:00
|
|
|
bool bc_is_base_node(LinkNode *export_set, Object *ob)
|
|
|
|
{
|
|
|
|
Object *root = bc_get_highest_selected_ancestor_or_self(export_set, ob);
|
|
|
|
return (root == ob);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool bc_is_in_Export_set(LinkNode *export_set, Object *ob)
|
|
|
|
{
|
2012-06-16 09:16:24 +00:00
|
|
|
return (BLI_linklist_index(export_set, ob) != -1);
|
2012-06-12 21:25:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool bc_has_object_type(LinkNode *export_set, short obtype)
|
|
|
|
{
|
2012-06-16 09:16:24 +00:00
|
|
|
LinkNode *node;
|
2012-06-12 21:25:29 +00:00
|
|
|
|
2012-06-16 09:16:24 +00:00
|
|
|
for (node = export_set; node; node = node->next) {
|
2012-06-12 21:25:29 +00:00
|
|
|
Object *ob = (Object *)node->link;
|
2012-06-16 09:16:24 +00:00
|
|
|
/* XXX - why is this checking for ob->data? - we could be looking for empties */
|
2012-06-12 21:25:29 +00:00
|
|
|
if (ob->type == obtype && ob->data) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
int bc_is_marked(Object *ob)
|
|
|
|
{
|
Split id->flag in two, persistent flags and runtime tags.
This is purely internal sanitizing/cleanup, no change in behavior is expected at all.
This change was also needed because we were getting short on ID flags, and
future enhancement of 'user_one' ID behavior requires two new ones.
id->flag remains for persistent data (fakeuser only, so far!), this also allows us
100% backward & forward compatibility.
New id->tag is used for most flags. Though written in .blend files, its content
is cleared at read time.
Note that .blend file version was bumped, so that we can clear runtimeflags from
old .blends, important in case we add new persistent flags in future.
Also, behavior of tags (either status ones, or whether they need to be cleared before/after use)
has been added as comments to their declaration.
Reviewers: sergey, campbellbarton
Differential Revision: https://developer.blender.org/D1683
2015-12-27 11:53:50 +01:00
|
|
|
return ob && (ob->id.tag & LIB_TAG_DOIT);
|
2012-06-12 21:25:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void bc_remove_mark(Object *ob)
|
|
|
|
{
|
Split id->flag in two, persistent flags and runtime tags.
This is purely internal sanitizing/cleanup, no change in behavior is expected at all.
This change was also needed because we were getting short on ID flags, and
future enhancement of 'user_one' ID behavior requires two new ones.
id->flag remains for persistent data (fakeuser only, so far!), this also allows us
100% backward & forward compatibility.
New id->tag is used for most flags. Though written in .blend files, its content
is cleared at read time.
Note that .blend file version was bumped, so that we can clear runtimeflags from
old .blends, important in case we add new persistent flags in future.
Also, behavior of tags (either status ones, or whether they need to be cleared before/after use)
has been added as comments to their declaration.
Reviewers: sergey, campbellbarton
Differential Revision: https://developer.blender.org/D1683
2015-12-27 11:53:50 +01:00
|
|
|
ob->id.tag &= ~LIB_TAG_DOIT;
|
2012-06-12 21:25:29 +00:00
|
|
|
}
|
2012-06-14 10:38:39 +00:00
|
|
|
|
2012-08-12 17:13:07 +00:00
|
|
|
void bc_set_mark(Object *ob)
|
|
|
|
{
|
Split id->flag in two, persistent flags and runtime tags.
This is purely internal sanitizing/cleanup, no change in behavior is expected at all.
This change was also needed because we were getting short on ID flags, and
future enhancement of 'user_one' ID behavior requires two new ones.
id->flag remains for persistent data (fakeuser only, so far!), this also allows us
100% backward & forward compatibility.
New id->tag is used for most flags. Though written in .blend files, its content
is cleared at read time.
Note that .blend file version was bumped, so that we can clear runtimeflags from
old .blends, important in case we add new persistent flags in future.
Also, behavior of tags (either status ones, or whether they need to be cleared before/after use)
has been added as comments to their declaration.
Reviewers: sergey, campbellbarton
Differential Revision: https://developer.blender.org/D1683
2015-12-27 11:53:50 +01:00
|
|
|
ob->id.tag |= LIB_TAG_DOIT;
|
2012-08-12 17:13:07 +00:00
|
|
|
}
|
|
|
|
|
2012-06-14 10:38:39 +00:00
|
|
|
// Use bubble sort algorithm for sorting the export set
|
|
|
|
void bc_bubble_sort_by_Object_name(LinkNode *export_set)
|
|
|
|
{
|
2012-06-14 14:48:52 +00:00
|
|
|
bool sorted = false;
|
|
|
|
LinkNode *node;
|
2012-06-16 09:16:24 +00:00
|
|
|
for (node = export_set; node->next && !sorted; node = node->next) {
|
2012-06-14 10:38:39 +00:00
|
|
|
|
2012-06-14 14:48:52 +00:00
|
|
|
sorted = true;
|
2012-06-14 10:38:39 +00:00
|
|
|
|
2012-06-14 14:48:52 +00:00
|
|
|
LinkNode *current;
|
2012-06-16 09:16:24 +00:00
|
|
|
for (current = export_set; current->next; current = current->next) {
|
2012-06-14 10:38:39 +00:00
|
|
|
Object *a = (Object *)current->link;
|
|
|
|
Object *b = (Object *)current->next->link;
|
|
|
|
|
2012-06-16 09:16:24 +00:00
|
|
|
if (strcmp(a->id.name, b->id.name) > 0) {
|
2012-06-14 10:38:39 +00:00
|
|
|
current->link = b;
|
|
|
|
current->next->link = a;
|
2012-06-14 14:48:52 +00:00
|
|
|
sorted = false;
|
2012-06-14 10:38:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
2012-06-15 02:21:07 +00:00
|
|
|
}
|
2012-06-15 22:00:25 +00:00
|
|
|
|
|
|
|
/* Check if a bone is the top most exportable bone in the bone hierarchy.
|
|
|
|
* When deform_bones_only == false, then only bones with NO parent
|
|
|
|
* can be root bones. Otherwise the top most deform bones in the hierarchy
|
|
|
|
* are root bones.
|
|
|
|
*/
|
2012-06-20 16:43:48 +00:00
|
|
|
bool bc_is_root_bone(Bone *aBone, bool deform_bones_only)
|
|
|
|
{
|
2012-06-16 09:16:24 +00:00
|
|
|
if (deform_bones_only) {
|
2012-06-15 22:00:25 +00:00
|
|
|
Bone *root = NULL;
|
|
|
|
Bone *bone = aBone;
|
|
|
|
while (bone) {
|
|
|
|
if (!(bone->flag & BONE_NO_DEFORM))
|
|
|
|
root = bone;
|
|
|
|
bone = bone->parent;
|
|
|
|
}
|
2012-06-16 09:16:24 +00:00
|
|
|
return (aBone == root);
|
2012-06-15 22:00:25 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
return !(aBone->parent);
|
|
|
|
}
|
2012-06-22 16:16:58 +00:00
|
|
|
|
|
|
|
int bc_get_active_UVLayer(Object *ob)
|
|
|
|
{
|
|
|
|
Mesh *me = (Mesh *)ob->data;
|
|
|
|
return CustomData_get_active_layer_index(&me->fdata, CD_MTFACE);
|
|
|
|
}
|
2013-02-09 00:23:59 +00:00
|
|
|
|
2013-03-05 14:47:49 +00:00
|
|
|
std::string bc_url_encode(std::string data)
|
|
|
|
{
|
2013-02-09 00:23:59 +00:00
|
|
|
/* XXX We probably do not need to do a full encoding.
|
2013-03-05 14:47:49 +00:00
|
|
|
* But in case that is necessary,then it can be added here.
|
|
|
|
*/
|
2013-02-09 00:23:59 +00:00
|
|
|
return bc_replace_string(data,"#", "%23");
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string bc_replace_string(std::string data, const std::string& pattern,
|
2013-03-05 14:47:49 +00:00
|
|
|
const std::string& replacement)
|
|
|
|
{
|
2013-02-10 17:06:05 +00:00
|
|
|
size_t pos = 0;
|
2013-06-13 11:59:28 +00:00
|
|
|
while ((pos = data.find(pattern, pos)) != std::string::npos) {
|
2013-02-10 17:06:05 +00:00
|
|
|
data.replace(pos, pattern.length(), replacement);
|
|
|
|
pos += replacement.length();
|
|
|
|
}
|
|
|
|
return data;
|
|
|
|
}
|
2013-02-10 22:14:56 +00:00
|
|
|
|
|
|
|
/**
|
2013-03-05 14:47:49 +00:00
|
|
|
* Calculate a rescale factor such that the imported scene's scale
|
|
|
|
* is preserved. I.e. 1 meter in the import will also be
|
|
|
|
* 1 meter in the current scene.
|
|
|
|
*/
|
2013-02-10 22:14:56 +00:00
|
|
|
|
2013-07-29 21:51:53 +00:00
|
|
|
void bc_match_scale(Object *ob, UnitConverter &bc_unit, bool scale_to_scene)
|
|
|
|
{
|
|
|
|
if (scale_to_scene) {
|
|
|
|
mul_m4_m4m4(ob->obmat, bc_unit.get_scale(), ob->obmat);
|
2013-02-10 22:14:56 +00:00
|
|
|
}
|
2013-07-29 21:51:53 +00:00
|
|
|
mul_m4_m4m4(ob->obmat, bc_unit.get_rotation(), ob->obmat);
|
|
|
|
BKE_object_apply_mat4(ob, ob->obmat, 0, 0);
|
|
|
|
}
|
2013-02-10 22:14:56 +00:00
|
|
|
|
2013-07-29 21:51:53 +00:00
|
|
|
void bc_match_scale(std::vector<Object *> *objects_done,
|
|
|
|
UnitConverter &bc_unit,
|
|
|
|
bool scale_to_scene)
|
|
|
|
{
|
2013-02-11 11:12:44 +00:00
|
|
|
for (std::vector<Object *>::iterator it = objects_done->begin();
|
|
|
|
it != objects_done->end();
|
|
|
|
++it)
|
|
|
|
{
|
2013-07-29 21:51:53 +00:00
|
|
|
Object *ob = *it;
|
|
|
|
if (ob -> parent == NULL) {
|
|
|
|
bc_match_scale(*it, bc_unit, scale_to_scene);
|
|
|
|
}
|
2013-02-10 22:14:56 +00:00
|
|
|
}
|
2013-02-21 19:33:04 +00:00
|
|
|
}
|
2013-03-02 15:58:13 +00:00
|
|
|
|
2017-03-23 12:38:41 +01:00
|
|
|
/*
|
|
|
|
Convenience function to get only the needed components of a matrix
|
|
|
|
*/
|
|
|
|
void bc_decompose(float mat[4][4], float *loc, float eul[3], float quat[4], float *size)
|
|
|
|
{
|
|
|
|
if (size) {
|
|
|
|
mat4_to_size(size, mat);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (eul) {
|
|
|
|
mat4_to_eul(eul, mat);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (quat) {
|
|
|
|
mat4_to_quat(quat, mat);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (loc) {
|
|
|
|
copy_v3_v3(loc, mat[3]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-06-02 23:20:49 +00:00
|
|
|
void bc_triangulate_mesh(Mesh *me)
|
|
|
|
{
|
2013-10-29 10:49:44 +00:00
|
|
|
bool use_beauty = false;
|
|
|
|
bool tag_only = false;
|
|
|
|
int quad_method = MOD_TRIANGULATE_QUAD_SHORTEDGE; /* XXX: The triangulation method selection could be offered in the UI */
|
2016-07-02 20:21:39 +10:00
|
|
|
|
|
|
|
const struct BMeshCreateParams bm_create_params = {0};
|
2016-07-01 19:07:11 +10:00
|
|
|
BMesh *bm = BM_mesh_create(
|
|
|
|
&bm_mesh_allocsize_default,
|
2016-07-02 20:21:39 +10:00
|
|
|
&bm_create_params);
|
2016-04-29 16:56:20 +02:00
|
|
|
BMeshFromMeshParams bm_from_me_params = {0};
|
|
|
|
bm_from_me_params.calc_face_normal = true;
|
|
|
|
BM_mesh_bm_from_me(bm, me, &bm_from_me_params);
|
2015-11-06 01:56:29 +11:00
|
|
|
BM_mesh_triangulate(bm, quad_method, use_beauty, tag_only, NULL, NULL, NULL);
|
2013-10-29 10:49:44 +00:00
|
|
|
|
2016-04-29 16:56:20 +02:00
|
|
|
BMeshToMeshParams bm_to_me_params = {0};
|
|
|
|
BM_mesh_bm_to_me(bm, me, &bm_to_me_params);
|
2013-03-02 15:58:13 +00:00
|
|
|
BM_mesh_free(bm);
|
|
|
|
}
|
2016-05-26 18:22:36 +02:00
|
|
|
|
|
|
|
/*
|
2016-07-02 10:02:04 +10:00
|
|
|
* A bone is a leaf when it has no children or all children are not connected.
|
|
|
|
*/
|
2016-05-26 18:22:36 +02:00
|
|
|
bool bc_is_leaf_bone(Bone *bone)
|
|
|
|
{
|
|
|
|
for (Bone *child = (Bone *)bone->childbase.first; child; child = child->next) {
|
|
|
|
if (child->flag & BONE_CONNECTED)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
2016-05-28 18:41:54 +02:00
|
|
|
|
|
|
|
EditBone *bc_get_edit_bone(bArmature * armature, char *name) {
|
|
|
|
EditBone *eBone;
|
|
|
|
|
|
|
|
for (eBone = (EditBone *)armature->edbo->first; eBone; eBone = eBone->next) {
|
|
|
|
if (STREQ(name, eBone->name))
|
|
|
|
return eBone;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
}
|
|
|
|
int bc_set_layer(int bitfield, int layer)
|
|
|
|
{
|
|
|
|
return bc_set_layer(bitfield, layer, true); /* enable */
|
|
|
|
}
|
|
|
|
|
|
|
|
int bc_set_layer(int bitfield, int layer, bool enable)
|
|
|
|
{
|
|
|
|
int bit = 1u << layer;
|
|
|
|
|
|
|
|
if (enable)
|
|
|
|
bitfield |= bit;
|
|
|
|
else
|
|
|
|
bitfield &= ~bit;
|
|
|
|
|
|
|
|
return bitfield;
|
|
|
|
}
|
|
|
|
|
2016-09-23 12:56:04 +02:00
|
|
|
/*
|
|
|
|
| This method creates a new extension map when needed.
|
|
|
|
| Note: The ~BoneExtensionManager destructor takes care
|
|
|
|
| to delete the created maps when the manager is removed.
|
|
|
|
*/
|
|
|
|
BoneExtensionMap &BoneExtensionManager::getExtensionMap(bArmature *armature)
|
|
|
|
{
|
|
|
|
std::string key = armature->id.name;
|
|
|
|
BoneExtensionMap *result = extended_bone_maps[key];
|
|
|
|
if (result == NULL)
|
|
|
|
{
|
|
|
|
result = new BoneExtensionMap();
|
|
|
|
extended_bone_maps[key] = result;
|
|
|
|
}
|
|
|
|
return *result;
|
|
|
|
}
|
|
|
|
|
|
|
|
BoneExtensionManager::~BoneExtensionManager()
|
|
|
|
{
|
|
|
|
std::map<std::string, BoneExtensionMap *>::iterator map_it;
|
|
|
|
for (map_it = extended_bone_maps.begin(); map_it != extended_bone_maps.end(); ++map_it)
|
|
|
|
{
|
|
|
|
BoneExtensionMap *extended_bones = map_it->second;
|
|
|
|
for (BoneExtensionMap::iterator ext_it = extended_bones->begin(); ext_it != extended_bones->end(); ++ext_it) {
|
|
|
|
if (ext_it->second != NULL)
|
|
|
|
delete ext_it->second;
|
|
|
|
}
|
|
|
|
extended_bones->clear();
|
|
|
|
delete extended_bones;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-05-28 18:41:54 +02:00
|
|
|
/**
|
2016-07-02 10:02:04 +10:00
|
|
|
* BoneExtended is a helper class needed for the Bone chain finder
|
|
|
|
* See ArmatureImporter::fix_leaf_bones()
|
|
|
|
* and ArmatureImporter::connect_bone_chains()
|
|
|
|
*/
|
2016-05-28 18:41:54 +02:00
|
|
|
|
|
|
|
BoneExtended::BoneExtended(EditBone *aBone)
|
|
|
|
{
|
|
|
|
this->set_name(aBone->name);
|
|
|
|
this->chain_length = 0;
|
|
|
|
this->is_leaf = false;
|
|
|
|
this->tail[0] = 0.0f;
|
|
|
|
this->tail[1] = 0.5f;
|
|
|
|
this->tail[2] = 0.0f;
|
|
|
|
this->use_connect = -1;
|
|
|
|
this->roll = 0;
|
|
|
|
this->bone_layers = 0;
|
|
|
|
|
|
|
|
this->has_custom_tail = false;
|
|
|
|
this->has_custom_roll = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *BoneExtended::get_name()
|
|
|
|
{
|
|
|
|
return name;
|
|
|
|
}
|
|
|
|
|
|
|
|
void BoneExtended::set_name(char *aName)
|
|
|
|
{
|
|
|
|
BLI_strncpy(name, aName, MAXBONENAME);
|
|
|
|
}
|
|
|
|
|
|
|
|
int BoneExtended::get_chain_length()
|
|
|
|
{
|
|
|
|
return chain_length;
|
|
|
|
}
|
|
|
|
|
|
|
|
void BoneExtended::set_chain_length(const int aLength)
|
|
|
|
{
|
|
|
|
chain_length = aLength;
|
|
|
|
}
|
|
|
|
|
|
|
|
void BoneExtended::set_leaf_bone(bool state)
|
|
|
|
{
|
|
|
|
is_leaf = state;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool BoneExtended::is_leaf_bone()
|
|
|
|
{
|
|
|
|
return is_leaf;
|
|
|
|
}
|
|
|
|
|
|
|
|
void BoneExtended::set_roll(float roll)
|
|
|
|
{
|
|
|
|
this->roll = roll;
|
|
|
|
this->has_custom_roll = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool BoneExtended::has_roll()
|
|
|
|
{
|
|
|
|
return this->has_custom_roll;
|
|
|
|
}
|
|
|
|
|
|
|
|
float BoneExtended::get_roll()
|
|
|
|
{
|
|
|
|
return this->roll;
|
|
|
|
}
|
|
|
|
|
|
|
|
void BoneExtended::set_tail(float vec[])
|
|
|
|
{
|
|
|
|
this->tail[0] = vec[0];
|
|
|
|
this->tail[1] = vec[1];
|
|
|
|
this->tail[2] = vec[2];
|
|
|
|
this->has_custom_tail = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool BoneExtended::has_tail()
|
|
|
|
{
|
|
|
|
return this->has_custom_tail;
|
|
|
|
}
|
|
|
|
|
|
|
|
float *BoneExtended::get_tail()
|
|
|
|
{
|
|
|
|
return this->tail;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool isInteger(const std::string & s)
|
|
|
|
{
|
|
|
|
if (s.empty() || ((!isdigit(s[0])) && (s[0] != '-') && (s[0] != '+'))) return false;
|
|
|
|
|
|
|
|
char * p;
|
|
|
|
strtol(s.c_str(), &p, 10);
|
|
|
|
|
|
|
|
return (*p == 0);
|
|
|
|
}
|
|
|
|
|
2016-05-29 00:35:50 +02:00
|
|
|
void BoneExtended::set_bone_layers(std::string layerString, std::vector<std::string> &layer_labels)
|
2016-05-28 18:41:54 +02:00
|
|
|
{
|
|
|
|
std::stringstream ss(layerString);
|
2016-05-29 00:35:50 +02:00
|
|
|
std::string layer;
|
|
|
|
int pos;
|
2016-05-28 18:41:54 +02:00
|
|
|
|
2016-05-29 00:35:50 +02:00
|
|
|
while (ss >> layer) {
|
2016-05-28 18:41:54 +02:00
|
|
|
|
2016-05-29 00:35:50 +02:00
|
|
|
/* Blender uses numbers to specify layers*/
|
2016-05-28 18:41:54 +02:00
|
|
|
if (isInteger(layer))
|
|
|
|
{
|
2016-05-29 01:30:20 +02:00
|
|
|
pos = atoi(layer.c_str());
|
2016-05-29 01:38:14 +02:00
|
|
|
if (pos >= 0 && pos < 32) {
|
2016-05-29 00:35:50 +02:00
|
|
|
this->bone_layers = bc_set_layer(this->bone_layers, pos);
|
|
|
|
continue;
|
|
|
|
}
|
2016-05-28 18:41:54 +02:00
|
|
|
}
|
|
|
|
|
2016-05-29 00:35:50 +02:00
|
|
|
/* layer uses labels (not supported by blender). Map to layer numbers:*/
|
|
|
|
pos = find(layer_labels.begin(), layer_labels.end(), layer) - layer_labels.begin();
|
|
|
|
if (pos >= layer_labels.size()) {
|
|
|
|
layer_labels.push_back(layer); /* remember layer number for future usage*/
|
2016-05-28 18:41:54 +02:00
|
|
|
}
|
|
|
|
|
2016-05-29 00:35:50 +02:00
|
|
|
if (pos > 31)
|
2016-05-28 18:41:54 +02:00
|
|
|
{
|
2016-05-29 00:35:50 +02:00
|
|
|
fprintf(stderr, "Too many layers in Import. Layer %s mapped to Blender layer 31\n", layer.c_str());
|
|
|
|
pos = 31;
|
2016-05-28 18:41:54 +02:00
|
|
|
}
|
2016-05-29 00:35:50 +02:00
|
|
|
|
|
|
|
/* If numeric layers and labeled layers are used in parallel (unlikely),
|
2016-07-15 02:36:21 +10:00
|
|
|
* we get a potential mixup. Just leave as is for now.
|
|
|
|
*/
|
2016-05-29 00:35:50 +02:00
|
|
|
this->bone_layers = bc_set_layer(this->bone_layers, pos);
|
|
|
|
|
2016-05-28 18:41:54 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string BoneExtended::get_bone_layers(int bitfield)
|
|
|
|
{
|
|
|
|
std::string result = "";
|
|
|
|
std::string sep = "";
|
|
|
|
int bit = 1u;
|
|
|
|
|
2016-05-29 01:30:20 +02:00
|
|
|
std::ostringstream ss;
|
2016-05-28 18:41:54 +02:00
|
|
|
for (int i = 0; i < 32; i++)
|
|
|
|
{
|
|
|
|
if (bit & bitfield)
|
|
|
|
{
|
2016-05-29 01:30:20 +02:00
|
|
|
ss << sep << i;
|
2016-05-28 18:41:54 +02:00
|
|
|
sep = " ";
|
|
|
|
}
|
|
|
|
bit = bit << 1;
|
|
|
|
}
|
2016-05-29 01:30:20 +02:00
|
|
|
return ss.str();
|
2016-05-28 18:41:54 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
int BoneExtended::get_bone_layers()
|
|
|
|
{
|
|
|
|
return (bone_layers == 0) ? 1 : bone_layers; // ensure that the bone is in at least one bone layer!
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void BoneExtended::set_use_connect(int use_connect)
|
|
|
|
{
|
|
|
|
this->use_connect = use_connect;
|
|
|
|
}
|
|
|
|
|
|
|
|
int BoneExtended::get_use_connect()
|
|
|
|
{
|
|
|
|
return this->use_connect;
|
|
|
|
}
|
2017-03-23 12:38:41 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Stores a 4*4 matrix as a custom bone property array of size 16
|
|
|
|
*/
|
|
|
|
void bc_set_IDPropertyMatrix(EditBone *ebone, const char *key, float mat[4][4])
|
|
|
|
{
|
|
|
|
IDProperty *idgroup = (IDProperty *)ebone->prop;
|
|
|
|
if (idgroup == NULL)
|
|
|
|
{
|
|
|
|
IDPropertyTemplate val = { 0 };
|
|
|
|
idgroup = IDP_New(IDP_GROUP, &val, "RNA_EditBone ID properties");
|
|
|
|
ebone->prop = idgroup;
|
|
|
|
}
|
|
|
|
|
|
|
|
IDPropertyTemplate val = { 0 };
|
|
|
|
val.array.len = 16;
|
|
|
|
val.array.type = IDP_FLOAT;
|
|
|
|
|
|
|
|
IDProperty *data = IDP_New(IDP_ARRAY, &val, key);
|
|
|
|
float *array = (float *)IDP_Array(data);
|
|
|
|
for (int i = 0; i < 4; i++)
|
|
|
|
for (int j = 0; j < 4; j++)
|
|
|
|
array[4 * i + j] = mat[i][j];
|
|
|
|
|
|
|
|
IDP_AddToGroup(idgroup, data);
|
|
|
|
}
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
/**
|
|
|
|
* Stores a Float value as a custom bone property
|
|
|
|
*
|
|
|
|
* Note: This function is currently not needed. Keep for future usage
|
|
|
|
*/
|
|
|
|
static void bc_set_IDProperty(EditBone *ebone, const char *key, float value)
|
|
|
|
{
|
|
|
|
if (ebone->prop == NULL)
|
|
|
|
{
|
|
|
|
IDPropertyTemplate val = { 0 };
|
|
|
|
ebone->prop = IDP_New(IDP_GROUP, &val, "RNA_EditBone ID properties");
|
|
|
|
}
|
|
|
|
|
|
|
|
IDProperty *pgroup = (IDProperty *)ebone->prop;
|
|
|
|
IDPropertyTemplate val = { 0 };
|
|
|
|
IDProperty *prop = IDP_New(IDP_FLOAT, &val, key);
|
|
|
|
IDP_Float(prop) = value;
|
|
|
|
IDP_AddToGroup(pgroup, prop);
|
|
|
|
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get a custom property when it exists.
|
|
|
|
* This function is also used to check if a property exists.
|
|
|
|
*/
|
|
|
|
IDProperty *bc_get_IDProperty(Bone *bone, std::string key)
|
|
|
|
{
|
|
|
|
return (bone->prop == NULL) ? NULL : IDP_GetPropertyFromGroup(bone->prop, key.c_str());
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Read a custom bone property and convert to float
|
|
|
|
* Return def if the property does not exist.
|
|
|
|
*/
|
|
|
|
float bc_get_property(Bone *bone, std::string key, float def)
|
|
|
|
{
|
|
|
|
float result = def;
|
|
|
|
IDProperty *property = bc_get_IDProperty(bone, key);
|
|
|
|
if (property) {
|
|
|
|
switch (property->type) {
|
|
|
|
case IDP_INT:
|
|
|
|
result = (float)(IDP_Int(property));
|
|
|
|
break;
|
|
|
|
case IDP_FLOAT:
|
|
|
|
result = (float)(IDP_Float(property));
|
|
|
|
break;
|
|
|
|
case IDP_DOUBLE:
|
|
|
|
result = (float)(IDP_Double(property));
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
result = def;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Read a custom bone property and convert to matrix
|
|
|
|
* Return true if conversion was succesfull
|
|
|
|
*
|
|
|
|
* Return false if:
|
|
|
|
* - the property does not exist
|
|
|
|
* - is not an array of size 16
|
|
|
|
*/
|
|
|
|
bool bc_get_property_matrix(Bone *bone, std::string key, float mat[4][4])
|
|
|
|
{
|
|
|
|
IDProperty *property = bc_get_IDProperty(bone, key);
|
|
|
|
if (property && property->type == IDP_ARRAY && property->len == 16) {
|
|
|
|
float *array = (float *)IDP_Array(property);
|
|
|
|
for (int i = 0; i < 4; i++)
|
|
|
|
for (int j = 0; j < 4; j++)
|
|
|
|
mat[i][j] = array[4 * i + j];
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* get a vector that is stored in 3 custom properties (used in Blender <= 2.78)
|
|
|
|
*/
|
|
|
|
void bc_get_property_vector(Bone *bone, std::string key, float val[3], const float def[3])
|
|
|
|
{
|
|
|
|
val[0] = bc_get_property(bone, key + "_x", def[0]);
|
|
|
|
val[1] = bc_get_property(bone, key + "_y", def[1]);
|
|
|
|
val[2] = bc_get_property(bone, key + "_z", def[2]);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Check if vector exist stored in 3 custom properties (used in Blender <= 2.78)
|
|
|
|
*/
|
|
|
|
static bool has_custom_props(Bone *bone, bool enabled, std::string key)
|
|
|
|
{
|
|
|
|
if (!enabled)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return (bc_get_IDProperty(bone, key + "_x")
|
|
|
|
|| bc_get_IDProperty(bone, key + "_y")
|
|
|
|
|| bc_get_IDProperty(bone, key + "_z"));
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Check if custom information about bind matrix exists and modify the from_mat
|
|
|
|
* accordingly.
|
|
|
|
*
|
|
|
|
* Note: This is old style for Blender <= 2.78 only kept for compatibility
|
|
|
|
*/
|
|
|
|
void bc_create_restpose_mat(const ExportSettings *export_settings, Bone *bone, float to_mat[4][4], float from_mat[4][4], bool use_local_space)
|
|
|
|
{
|
|
|
|
float loc[3];
|
|
|
|
float rot[3];
|
|
|
|
float scale[3];
|
|
|
|
static const float V0[3] = { 0, 0, 0 };
|
|
|
|
|
|
|
|
if (!has_custom_props(bone, export_settings->keep_bind_info, "restpose_loc") &&
|
|
|
|
!has_custom_props(bone, export_settings->keep_bind_info, "restpose_rot") &&
|
|
|
|
!has_custom_props(bone, export_settings->keep_bind_info, "restpose_scale"))
|
|
|
|
{
|
|
|
|
/* No need */
|
|
|
|
copy_m4_m4(to_mat, from_mat);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
bc_decompose(from_mat, loc, rot, NULL, scale);
|
|
|
|
loc_eulO_size_to_mat4(to_mat, loc, rot, scale, 6);
|
|
|
|
|
|
|
|
if (export_settings->keep_bind_info) {
|
|
|
|
bc_get_property_vector(bone, "restpose_loc", loc, loc);
|
|
|
|
|
|
|
|
if (use_local_space && bone->parent) {
|
|
|
|
Bone *b = bone;
|
|
|
|
while (b->parent) {
|
|
|
|
b = b->parent;
|
|
|
|
float ploc[3];
|
|
|
|
bc_get_property_vector(b, "restpose_loc", ploc, V0);
|
|
|
|
loc[0] += ploc[0];
|
|
|
|
loc[1] += ploc[1];
|
|
|
|
loc[2] += ploc[2];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (export_settings->keep_bind_info) {
|
|
|
|
if (bc_get_IDProperty(bone, "restpose_rot_x"))
|
|
|
|
rot[0] = DEG2RADF(bc_get_property(bone, "restpose_rot_x", 0));
|
|
|
|
if (bc_get_IDProperty(bone, "restpose_rot_y"))
|
|
|
|
rot[1] = DEG2RADF(bc_get_property(bone, "restpose_rot_y", 0));
|
|
|
|
if (bc_get_IDProperty(bone, "restpose_rot_z"))
|
|
|
|
rot[2] = DEG2RADF(bc_get_property(bone, "restpose_rot_z", 0));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (export_settings->keep_bind_info) {
|
|
|
|
bc_get_property_vector(bone, "restpose_scale", scale, scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
loc_eulO_size_to_mat4(to_mat, loc, rot, scale, 6);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
Make 4*4 matrices better readable
|
|
|
|
*/
|
2017-04-01 15:29:40 +02:00
|
|
|
void bc_sanitize_mat(float mat[4][4], int precision)
|
2017-03-23 12:38:41 +01:00
|
|
|
{
|
|
|
|
for (int i = 0; i < 4; i++)
|
|
|
|
for (int j = 0; j < 4; j++)
|
2017-04-01 15:29:40 +02:00
|
|
|
mat[i][j] = double_round(mat[i][j], precision);
|
2017-06-08 10:14:53 +02:00
|
|
|
}
|