123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239 |
- /*
- Open Asset Import Library (assimp)
- ----------------------------------------------------------------------
- Copyright (c) 2006-2025, assimp team
- All rights reserved.
- 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.
- 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
- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- 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
- #include <stdint.h>
- #include <map>
- #include <memory>
- #include <vector>
- #include <assimp/LogAux.h>
- #include <assimp/fast_atof.h>
- #include "Common/StackAllocator.h"
- #include "FBXCompileConfig.h"
- #include "FBXTokenizer.h"
- namespace Assimp {
- namespace FBX {
- class Scope;
- class Parser;
- class Element;
- using ScopeList = std::vector<Scope*>;
- using ElementMap = std::fbx_unordered_multimap< std::string, Element*>;
- using ElementCollection = std::pair<ElementMap::const_iterator,ElementMap::const_iterator>;
- #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
- * as their trailing member.
- **/
- class Element {
- public:
- Element(const Token& key_token, Parser& parser);
- ~Element();
- const Scope* Compound() const {
- return compound;
- }
- const Token& KeyToken() const {
- return key_token;
- }
- const TokenList& Tokens() const {
- return tokens;
- }
- private:
- 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
- * Properties70:
- * [...]
- * }
- * @endverbatim */
- class Scope
- {
- public:
- Scope(Parser& parser, bool topLevel = false);
- ~Scope();
- const Element* operator[] (const std::string& index) const {
- ElementMap::const_iterator it = elements.find(index);
- return it == elements.end() ? nullptr : (*it).second;
- }
- 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, AI_MAXLEN)) {
- return element->second;
- }
- }
- return nullptr;
- }
- ElementCollection GetCollection(const std::string& index) const {
- return elements.equal_range(index);
- }
- const ElementMap& Elements() const {
- return elements;
- }
- private:
- ElementMap elements;
- };
- /** FBX parsing class, takes a list of input tokens and generates a hierarchy
- * of nested #Scope instances, representing the fbx DOM.*/
- class Parser
- {
- public:
- /** Parse given a token list. Does not take ownership of the tokens -
- * the objects must persist during the entire parser lifetime */
- Parser(const TokenList &tokens, StackAllocator &allocator, bool is_binary);
- ~Parser();
- const Scope& GetRootScope() const {
- return *root;
- }
- bool IsBinary() const {
- return is_binary;
- }
- StackAllocator &GetAllocator() {
- return allocator;
- }
- private:
- friend class Scope;
- friend class Element;
- TokenPtr AdvanceToNextToken();
- TokenPtr LastToken() const;
- TokenPtr CurrentToken() const;
- private:
- const TokenList& tokens;
- StackAllocator &allocator;
- TokenPtr last, current;
- TokenList::const_iterator cursor;
- Scope *root;
- 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
|