assimp/code/AssetLib/FBX/FBXParser.h

242 lines
7.2 KiB
C
Raw Normal View History

/*
Open Asset Import Library (assimp)
----------------------------------------------------------------------
2024-02-23 21:30:05 +00:00
Copyright (c) 2006-2024, assimp team
2018-01-28 18:42:05 +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
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
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
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
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
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
----------------------------------------------------------------------
*/
/** @file FBXParser.h
* @brief FBX parsing code
*/
#ifndef INCLUDED_AI_FBX_PARSER_H
#define INCLUDED_AI_FBX_PARSER_H
2016-02-28 19:27:31 +00:00
#include <stdint.h>
2016-02-28 19:56:11 +00:00
#include <map>
#include <memory>
2020-03-08 20:24:01 +00:00
#include <vector>
#include <assimp/LogAux.h>
#include <assimp/fast_atof.h>
2022-04-20 10:33:39 +00:00
#include "Common/StackAllocator.h"
#include "FBXCompileConfig.h"
#include "FBXTokenizer.h"
namespace Assimp {
namespace FBX {
class Scope;
class Parser;
class Element;
// XXX should use C++11's unique_ptr - but assimp's need to keep working with 03
2023-05-15 09:02:58 +00:00
using ScopeList = std::vector<Scope*>;
using ElementMap = std::fbx_unordered_multimap< std::string, Element*>;
using ElementCollection = std::pair<ElementMap::const_iterator,ElementMap::const_iterator>;
2022-04-20 10:33:39 +00:00
#define new_Scope new (allocator.Allocate(sizeof(Scope))) Scope
#define new_Element new (allocator.Allocate(sizeof(Element))) Element
#define delete_Scope(_p) (_p)->~Scope()
#define delete_Element(_p) (_p)->~Element()
/** FBX data entity that consists of a key:value tuple.
*
* Example:
* @verbatim
* AnimationCurve: 23, "AnimCurve::", "" {
* [..]
* }
* @endverbatim
*
* As can be seen in this sample, elements can contain nested #Scope
2023-05-15 09:02:58 +00:00
* as their trailing member.
**/
class Element
{
public:
2015-05-19 03:57:13 +00:00
Element(const Token& key_token, Parser& parser);
2023-05-15 09:02:58 +00:00
~Element();
2015-05-19 03:57:13 +00:00
const Scope* Compound() const {
return compound;
2015-05-19 03:57:13 +00:00
}
2015-05-19 03:57:13 +00:00
const Token& KeyToken() const {
return key_token;
}
2015-05-19 03:57:13 +00:00
const TokenList& Tokens() const {
return tokens;
}
private:
2015-05-19 03:57:13 +00:00
const Token& key_token;
TokenList tokens;
Scope* compound;
};
/** FBX data entity that consists of a 'scope', a collection
* of not necessarily unique #Element instances.
*
* Example:
* @verbatim
* GlobalSettings: {
* Version: 1000
2015-05-19 03:52:10 +00:00
* Properties70:
* [...]
* }
* @endverbatim */
class Scope
{
public:
2015-05-19 03:57:13 +00:00
Scope(Parser& parser, bool topLevel = false);
~Scope();
2015-05-19 03:57:13 +00:00
const Element* operator[] (const std::string& index) const {
ElementMap::const_iterator it = elements.find(index);
2020-03-08 20:24:01 +00:00
return it == elements.end() ? nullptr : (*it).second;
2015-05-19 03:57:13 +00:00
}
const Element* FindElementCaseInsensitive(const std::string& elementName) const {
const char* elementNameCStr = elementName.c_str();
for (auto element = elements.begin(); element != elements.end(); ++element)
{
if (!ASSIMP_strincmp(element->first.c_str(), elementNameCStr, MAXLEN)) {
return element->second;
}
}
return nullptr;
}
2015-05-19 03:57:13 +00:00
ElementCollection GetCollection(const std::string& index) const {
return elements.equal_range(index);
}
2015-05-19 03:57:13 +00:00
const ElementMap& Elements() const {
return elements;
}
private:
2015-05-19 03:57:13 +00:00
ElementMap elements;
};
/** FBX parsing class, takes a list of input tokens and generates a hierarchy
* of nested #Scope instances, representing the fbx DOM.*/
2015-05-19 03:52:10 +00:00
class Parser
{
public:
2015-05-19 03:57:13 +00:00
/** Parse given a token list. Does not take ownership of the tokens -
* the objects must persist during the entire parser lifetime */
2022-04-20 10:33:39 +00:00
Parser(const TokenList &tokens, StackAllocator &allocator, bool is_binary);
2015-05-19 03:57:13 +00:00
~Parser();
2015-05-19 03:57:13 +00:00
const Scope& GetRootScope() const {
2022-04-20 10:33:39 +00:00
return *root;
2015-05-19 03:57:13 +00:00
}
2015-05-19 03:57:13 +00:00
bool IsBinary() const {
return is_binary;
}
2022-04-20 10:33:39 +00:00
StackAllocator &GetAllocator() {
return allocator;
}
private:
2015-05-19 03:57:13 +00:00
friend class Scope;
friend class Element;
2015-05-19 03:57:13 +00:00
TokenPtr AdvanceToNextToken();
TokenPtr LastToken() const;
TokenPtr CurrentToken() const;
private:
2015-05-19 03:57:13 +00:00
const TokenList& tokens;
2022-04-20 10:33:39 +00:00
StackAllocator &allocator;
2015-05-19 03:57:13 +00:00
TokenPtr last, current;
TokenList::const_iterator cursor;
2022-04-20 10:33:39 +00:00
Scope *root;
2015-05-19 03:57:13 +00:00
const bool is_binary;
};
/* token parsing - this happens when building the DOM out of the parse-tree*/
uint64_t ParseTokenAsID(const Token& t, const char*& err_out);
size_t ParseTokenAsDim(const Token& t, const char*& err_out);
float ParseTokenAsFloat(const Token& t, const char*& err_out);
int ParseTokenAsInt(const Token& t, const char*& err_out);
int64_t ParseTokenAsInt64(const Token& t, const char*& err_out);
std::string ParseTokenAsString(const Token& t, const char*& err_out);
/* wrapper around ParseTokenAsXXX() with DOMError handling */
uint64_t ParseTokenAsID(const Token& t);
size_t ParseTokenAsDim(const Token& t);
float ParseTokenAsFloat(const Token& t);
int ParseTokenAsInt(const Token& t);
int64_t ParseTokenAsInt64(const Token& t);
std::string ParseTokenAsString(const Token& t);
/* read data arrays */
void ParseVectorDataArray(std::vector<aiVector3D>& out, const Element& el);
void ParseVectorDataArray(std::vector<aiColor4D>& out, const Element& el);
void ParseVectorDataArray(std::vector<aiVector2D>& out, const Element& el);
void ParseVectorDataArray(std::vector<int>& out, const Element& el);
void ParseVectorDataArray(std::vector<float>& out, const Element& el);
void ParseVectorDataArray(std::vector<unsigned int>& out, const Element& el);
void ParseVectorDataArray(std::vector<uint64_t>& out, const Element& e);
void ParseVectorDataArray(std::vector<int64_t>& out, const Element& el);
bool HasElement( const Scope& sc, const std::string& index );
// extract a required element from a scope, abort if the element cannot be found
const Element &GetRequiredElement(const Scope &sc, const std::string &index, const Element *element = nullptr);
// extract required compound scope
const Scope& GetRequiredScope(const Element& el);
// get token at a particular index
const Token& GetRequiredToken(const Element& el, unsigned int index);
// read a 4x4 matrix from an array of 16 floats
aiMatrix4x4 ReadMatrix(const Element& element);
} // ! FBX
} // ! Assimp
#endif // ! INCLUDED_AI_FBX_PARSER_H