assimp/code/FBX/FBXProperties.cpp

236 lines
7.4 KiB
C++
Raw Normal View History

2012-07-02 13:57:51 +00:00
/*
Open Asset Import Library (assimp)
----------------------------------------------------------------------
2019-01-30 08:41:39 +00:00
Copyright (c) 2006-2019, assimp team
2018-01-28 18:42:05 +00:00
2017-05-09 17:57:36 +00:00
2012-07-02 13:57:51 +00:00
All rights reserved.
2015-05-19 03:52:10 +00:00
Redistribution and use of this software in source and binary forms,
with or without modification, are permitted provided that the
2012-07-02 13:57:51 +00:00
following conditions are met:
* Redistributions of source code must retain the above
copyright notice, this list of conditions and the
following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the
following disclaimer in the documentation and/or other
materials provided with the distribution.
* Neither the name of the assimp team, nor the names of its
contributors may be used to endorse or promote products
derived from this software without specific prior
written permission of the assimp team.
2015-05-19 03:52:10 +00:00
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2012-07-02 13:57:51 +00:00
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2015-05-19 03:52:10 +00:00
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2012-07-02 13:57:51 +00:00
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2015-05-19 03:52:10 +00:00
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2012-07-02 13:57:51 +00:00
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2015-05-19 03:52:10 +00:00
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2012-07-02 13:57:51 +00:00
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
----------------------------------------------------------------------
*/
/** @file FBXProperties.cpp
* @brief Implementation of the FBX dynamic properties system
*/
#ifndef ASSIMP_BUILD_NO_FBX_IMPORTER
#include "FBXTokenizer.h"
#include "FBXParser.h"
#include "FBXDocument.h"
#include "FBXDocumentUtil.h"
#include "FBXProperties.h"
namespace Assimp {
namespace FBX {
2015-05-19 03:57:13 +00:00
using namespace Util;
2012-07-02 13:57:51 +00:00
// ------------------------------------------------------------------------------------------------
Property::Property()
{
}
// ------------------------------------------------------------------------------------------------
Property::~Property()
{
}
namespace {
// ------------------------------------------------------------------------------------------------
// read a typed property out of a FBX element. The return value is NULL if the property cannot be read.
Property* ReadTypedProperty(const Element& element)
{
2015-05-19 03:57:13 +00:00
ai_assert(element.KeyToken().StringContents() == "P");
const TokenList& tok = element.Tokens();
ai_assert(tok.size() >= 5);
const std::string& s = ParseTokenAsString(*tok[1]);
const char* const cs = s.c_str();
if (!strcmp(cs,"KString")) {
return new TypedProperty<std::string>(ParseTokenAsString(*tok[4]));
}
else if (!strcmp(cs,"bool") || !strcmp(cs,"Bool")) {
return new TypedProperty<bool>(ParseTokenAsInt(*tok[4]) != 0);
}
else if (!strcmp(cs, "int") || !strcmp(cs, "Int") || !strcmp(cs, "enum") || !strcmp(cs, "Enum")) {
return new TypedProperty<int>(ParseTokenAsInt(*tok[4]));
}
else if (!strcmp(cs, "ULongLong")) {
return new TypedProperty<uint64_t>(ParseTokenAsID(*tok[4]));
}
else if (!strcmp(cs, "KTime")) {
return new TypedProperty<int64_t>(ParseTokenAsInt64(*tok[4]));
}
else if (!strcmp(cs,"Vector3D") ||
!strcmp(cs,"ColorRGB") ||
!strcmp(cs,"Vector") ||
!strcmp(cs,"Color") ||
!strcmp(cs,"Lcl Translation") ||
!strcmp(cs,"Lcl Rotation") ||
!strcmp(cs,"Lcl Scaling")
) {
return new TypedProperty<aiVector3D>(aiVector3D(
ParseTokenAsFloat(*tok[4]),
ParseTokenAsFloat(*tok[5]),
ParseTokenAsFloat(*tok[6]))
);
}
else if (!strcmp(cs,"double") || !strcmp(cs,"Number") || !strcmp(cs,"Float") || !strcmp(cs,"FieldOfView") || !strcmp( cs, "UnitScaleFactor" ) ) {
2015-05-19 03:57:13 +00:00
return new TypedProperty<float>(ParseTokenAsFloat(*tok[4]));
}
return NULL;
2012-07-02 13:57:51 +00:00
}
2012-07-02 13:57:51 +00:00
// ------------------------------------------------------------------------------------------------
// peek into an element and check if it contains a FBX property, if so return its name.
std::string PeekPropertyName(const Element& element)
{
2015-05-19 03:57:13 +00:00
ai_assert(element.KeyToken().StringContents() == "P");
const TokenList& tok = element.Tokens();
if(tok.size() < 4) {
return "";
}
2012-07-02 13:57:51 +00:00
2015-05-19 03:57:13 +00:00
return ParseTokenAsString(*tok[0]);
2012-07-02 13:57:51 +00:00
}
} //! anon
2012-07-02 15:37:00 +00:00
// ------------------------------------------------------------------------------------------------
PropertyTable::PropertyTable()
2012-07-08 01:28:14 +00:00
: templateProps()
, element()
2012-07-02 15:37:00 +00:00
{
}
2012-07-02 13:57:51 +00:00
// ------------------------------------------------------------------------------------------------
PropertyTable::PropertyTable(const Element& element, std::shared_ptr<const PropertyTable> templateProps)
2012-07-08 01:28:14 +00:00
: templateProps(templateProps)
, element(&element)
2012-07-02 13:57:51 +00:00
{
2015-05-19 03:57:13 +00:00
const Scope& scope = GetRequiredScope(element);
for(const ElementMap::value_type& v : scope.Elements()) {
2015-05-19 03:57:13 +00:00
if(v.first != "P") {
DOMWarning("expected only P elements in property table",v.second);
continue;
}
const std::string& name = PeekPropertyName(*v.second);
if(!name.length()) {
DOMWarning("could not read property name",v.second);
continue;
}
LazyPropertyMap::const_iterator it = lazyProps.find(name);
if (it != lazyProps.end()) {
DOMWarning("duplicate property name, will hide previous value: " + name,v.second);
continue;
}
lazyProps[name] = v.second;
}
2012-07-02 13:57:51 +00:00
}
2012-07-02 13:57:51 +00:00
// ------------------------------------------------------------------------------------------------
PropertyTable::~PropertyTable()
{
for(PropertyMap::value_type& v : props) {
2015-05-19 03:57:13 +00:00
delete v.second;
}
2012-07-02 13:57:51 +00:00
}
2012-07-02 13:57:51 +00:00
// ------------------------------------------------------------------------------------------------
const Property* PropertyTable::Get(const std::string& name) const
2012-07-02 13:57:51 +00:00
{
2015-05-19 03:57:13 +00:00
PropertyMap::const_iterator it = props.find(name);
if (it == props.end()) {
// hasn't been parsed yet?
LazyPropertyMap::const_iterator lit = lazyProps.find(name);
if(lit != lazyProps.end()) {
props[name] = ReadTypedProperty(*(*lit).second);
it = props.find(name);
ai_assert(it != props.end());
}
if (it == props.end()) {
// check property template
if(templateProps) {
return templateProps->Get(name);
}
return NULL;
}
}
return (*it).second;
2012-07-02 13:57:51 +00:00
}
DirectPropertyMap PropertyTable::GetUnparsedProperties() const
{
2015-05-19 03:57:13 +00:00
DirectPropertyMap result;
2015-05-19 03:57:13 +00:00
// Loop through all the lazy properties (which is all the properties)
for(const LazyPropertyMap::value_type& element : lazyProps) {
2015-05-19 03:57:13 +00:00
// Skip parsed properties
if (props.end() != props.find(element.first)) continue;
2015-05-19 03:57:13 +00:00
// Read the element's value.
// Wrap the naked pointer (since the call site is required to acquire ownership)
// std::unique_ptr from C++11 would be preferred both as a wrapper and a return value.
std::shared_ptr<Property> prop = std::shared_ptr<Property>(ReadTypedProperty(*element.second));
2015-05-19 03:52:10 +00:00
2015-05-19 03:57:13 +00:00
// Element could not be read. Skip it.
if (!prop) continue;
2015-05-19 03:57:13 +00:00
// Add to result
result[element.first] = prop;
}
2015-05-19 03:57:13 +00:00
return result;
}
2012-07-02 13:57:51 +00:00
} //! FBX
} //! Assimp
#endif