440 lines
9.7 KiB
C++
440 lines
9.7 KiB
C++
/*
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
*
|
|
* Copyright (C) 2015 Cirilo Bernardo <cirilo.bernardo@gmail.com>
|
|
*
|
|
* 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, you may find one here:
|
|
* http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
|
|
* or you may search the http://www.gnu.org website for the version 2 license,
|
|
* or you may write to the Free Software Foundation, Inc.,
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
|
|
*/
|
|
|
|
#include <algorithm>
|
|
#include <cmath>
|
|
#include <cstring>
|
|
#include <iostream>
|
|
#include <sstream>
|
|
#include <wx/log.h>
|
|
|
|
#include "3d_cache/sg/sg_node.h"
|
|
#include "plugins/3dapi/c3dmodel.h"
|
|
|
|
static const std::string node_names[S3D::SGTYPE_END + 1] = {
|
|
"TXFM",
|
|
"APP",
|
|
"COL",
|
|
"COLIDX",
|
|
"FACE",
|
|
"COORD",
|
|
"COORDIDX",
|
|
"NORM",
|
|
"SHAPE",
|
|
"INVALID"
|
|
};
|
|
|
|
|
|
static unsigned int node_counts[S3D::SGTYPE_END] = { 1, 1, 1, 1, 1, 1, 1, 1, 1 };
|
|
|
|
|
|
char const* S3D::GetNodeTypeName( S3D::SGTYPES aType ) noexcept
|
|
{
|
|
return node_names[aType].c_str();
|
|
}
|
|
|
|
|
|
static void getNodeName( S3D::SGTYPES nodeType, std::string& aName )
|
|
{
|
|
if( nodeType < 0 || nodeType >= S3D::SGTYPE_END )
|
|
{
|
|
aName = node_names[S3D::SGTYPE_END];
|
|
return;
|
|
}
|
|
|
|
unsigned int seqNum = node_counts[nodeType];
|
|
++node_counts[nodeType];
|
|
|
|
std::ostringstream ostr;
|
|
ostr << node_names[nodeType] << "_" << seqNum;
|
|
aName = ostr.str();
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
SGNODE::SGNODE( SGNODE* aParent )
|
|
{
|
|
m_Parent = aParent;
|
|
m_Association = NULL;
|
|
m_written = false;
|
|
m_SGtype = S3D::SGTYPE_END;
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
SGNODE::~SGNODE()
|
|
{
|
|
if( m_Parent )
|
|
m_Parent->unlinkChildNode( this );
|
|
|
|
if( m_Association )
|
|
*m_Association = NULL;
|
|
|
|
std::list< SGNODE* >::iterator sBP = m_BackPointers.begin();
|
|
std::list< SGNODE* >::iterator eBP = m_BackPointers.end();
|
|
|
|
while( sBP != eBP )
|
|
{
|
|
(*sBP)->unlinkRefNode( this );
|
|
++sBP;
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
S3D::SGTYPES SGNODE::GetNodeType( void ) const noexcept
|
|
{
|
|
return m_SGtype;
|
|
}
|
|
|
|
|
|
SGNODE* SGNODE::GetParent( void ) const noexcept
|
|
{
|
|
return m_Parent;
|
|
}
|
|
|
|
|
|
bool SGNODE::SwapParent( SGNODE* aNewParent )
|
|
{
|
|
if( aNewParent == m_Parent )
|
|
return true;
|
|
|
|
if( NULL == aNewParent )
|
|
return false;
|
|
|
|
if( NULL == m_Parent )
|
|
{
|
|
if( aNewParent->AddChildNode( this ) )
|
|
return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
if( aNewParent->GetNodeType() != m_Parent->GetNodeType() )
|
|
return false;
|
|
|
|
SGNODE* oldParent = m_Parent;
|
|
m_Parent->unlinkChildNode( this );
|
|
m_Parent = NULL;
|
|
aNewParent->unlinkRefNode( this );
|
|
aNewParent->AddChildNode( this );
|
|
oldParent->AddRefNode( this );
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
const char* SGNODE::GetName( void )
|
|
{
|
|
if( m_Name.empty() )
|
|
getNodeName( m_SGtype, m_Name );
|
|
|
|
return m_Name.c_str();
|
|
}
|
|
|
|
|
|
void SGNODE::SetName( const char *aName )
|
|
{
|
|
if( NULL == aName || 0 == aName[0] )
|
|
getNodeName( m_SGtype, m_Name );
|
|
else
|
|
m_Name = aName;
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
const char * SGNODE::GetNodeTypeName( S3D::SGTYPES aNodeType ) const noexcept
|
|
{
|
|
return node_names[aNodeType].c_str();
|
|
}
|
|
|
|
|
|
void SGNODE::addNodeRef( SGNODE* aNode )
|
|
{
|
|
if( NULL == aNode )
|
|
return;
|
|
|
|
std::list< SGNODE* >::iterator np =
|
|
std::find( m_BackPointers.begin(), m_BackPointers.end(), aNode );
|
|
|
|
if( np != m_BackPointers.end() )
|
|
return;
|
|
|
|
m_BackPointers.push_back( aNode );
|
|
return;
|
|
}
|
|
|
|
|
|
void SGNODE::delNodeRef( const SGNODE* aNode )
|
|
{
|
|
if( NULL == aNode )
|
|
return;
|
|
|
|
std::list< SGNODE* >::iterator np =
|
|
std::find( m_BackPointers.begin(), m_BackPointers.end(), aNode );
|
|
|
|
if( np != m_BackPointers.end() )
|
|
{
|
|
m_BackPointers.erase( np );
|
|
return;
|
|
}
|
|
|
|
#ifdef DEBUG
|
|
std::ostringstream ostr;
|
|
ostr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__ << "\n";
|
|
ostr << " * [BUG] delNodeRef() did not find its target\n";
|
|
ostr << " * This Node Type: " << m_SGtype << ", Referenced node type: ";
|
|
ostr << aNode->GetNodeType() << "\n";
|
|
wxLogTrace( MASK_3D_SG, "%s\n", ostr.str().c_str() );
|
|
#endif
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
void SGNODE::AssociateWrapper( SGNODE** aWrapperRef ) noexcept
|
|
{
|
|
if( NULL == aWrapperRef )
|
|
{
|
|
#ifdef DEBUG
|
|
std::ostringstream ostr;
|
|
ostr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__ << "\n";
|
|
ostr << " * [BUG] NULL handle";
|
|
wxLogTrace( MASK_3D_SG, "%s\n", ostr.str().c_str() );
|
|
#endif
|
|
|
|
return;
|
|
}
|
|
|
|
if( *aWrapperRef != this )
|
|
{
|
|
#ifdef DEBUG
|
|
std::ostringstream ostr;
|
|
ostr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__ << "\n";
|
|
ostr << " * [BUG] handle value does not match this object's pointer";
|
|
wxLogTrace( MASK_3D_SG, "%s\n", ostr.str().c_str() );
|
|
#endif
|
|
|
|
return;
|
|
}
|
|
|
|
// if there is an existing association then break it and emit a warning
|
|
// just in case the behavior is undesired
|
|
if( m_Association )
|
|
{
|
|
*m_Association = NULL;
|
|
|
|
#ifdef DEBUG
|
|
std::ostringstream ostr;
|
|
ostr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__ << "\n";
|
|
ostr << " * [WARNING] association being broken with previous wrapper";
|
|
wxLogTrace( MASK_3D_SG, "%s\n", ostr.str().c_str() );
|
|
#endif
|
|
}
|
|
|
|
m_Association = aWrapperRef;
|
|
|
|
return;
|
|
}
|
|
|
|
void SGNODE::DisassociateWrapper( SGNODE** aWrapperRef ) noexcept
|
|
{
|
|
if( !m_Association )
|
|
return;
|
|
|
|
if( !aWrapperRef )
|
|
{
|
|
#ifdef DEBUG
|
|
std::ostringstream ostr;
|
|
ostr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__ << "\n";
|
|
ostr << " * [BUG] invalid handle value aWrapperRef";
|
|
wxLogTrace( MASK_3D_SG, "%s\n", ostr.str().c_str() );
|
|
#endif
|
|
|
|
return;
|
|
}
|
|
|
|
if( *aWrapperRef != *m_Association || aWrapperRef != m_Association )
|
|
{
|
|
#ifdef DEBUG
|
|
std::ostringstream ostr;
|
|
ostr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__ << "\n";
|
|
ostr << " * [BUG] *aWrapperRef (" << *aWrapperRef;
|
|
ostr << ") does not match *m_Association (" << *m_Association << ") in type ";
|
|
ostr << node_names[ m_SGtype] << "\n";
|
|
ostr << " * [INFO] OR aWrapperRef(" << aWrapperRef << ") != m_Association(";
|
|
ostr << m_Association << ")\n";
|
|
ostr << " * [INFO] node name: " << GetName();
|
|
wxLogTrace( MASK_3D_SG, "%s\n", ostr.str().c_str() );
|
|
#endif
|
|
|
|
return;
|
|
}
|
|
|
|
m_Association = NULL;
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
void SGNODE::ResetNodeIndex( void ) noexcept
|
|
{
|
|
for( int i = 0; i < (int)S3D::SGTYPE_END; ++i )
|
|
node_counts[i] = 1;
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
bool S3D::GetMatIndex( MATLIST& aList, SGNODE* aNode, int& aIndex )
|
|
{
|
|
aIndex = 0;
|
|
|
|
if( NULL == aNode || S3D::SGTYPE_APPEARANCE != aNode->GetNodeType() )
|
|
{
|
|
#ifdef DEBUG
|
|
std::ostringstream ostr;
|
|
ostr << __FILE__ << ": " << __FUNCTION__ << ": " << __LINE__;
|
|
wxLogTrace( MASK_3D_SG, "%s\n", ostr.str().c_str() );
|
|
ostr.str( "" );
|
|
|
|
if( NULL == aNode )
|
|
{
|
|
wxLogTrace( MASK_3D_SG, " * [BUG] aNode is NULL\n" );
|
|
}
|
|
else
|
|
{
|
|
ostr << " * [BUG] invalid node type (" << aNode->GetNodeType();
|
|
ostr << "), expected " << S3D::SGTYPE_APPEARANCE;
|
|
wxLogTrace( MASK_3D_SG, "%s\n", ostr.str().c_str() );
|
|
}
|
|
#endif
|
|
|
|
return false;
|
|
}
|
|
|
|
SGAPPEARANCE* node = (SGAPPEARANCE*)aNode;
|
|
|
|
std::map< SGAPPEARANCE const*, int >::iterator it = aList.matmap.find( node );
|
|
|
|
if( it != aList.matmap.end() )
|
|
{
|
|
aIndex = it->second;
|
|
return true;
|
|
}
|
|
|
|
int idx = (int)aList.matorder.size();
|
|
aList.matorder.push_back( node );
|
|
aList.matmap.insert( std::pair< SGAPPEARANCE const*, int >( node, idx ) );
|
|
aIndex = idx;
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
void S3D::INIT_SMATERIAL( SMATERIAL& aMaterial )
|
|
{
|
|
aMaterial = {};
|
|
}
|
|
|
|
|
|
void S3D::INIT_SMESH( SMESH& aMesh ) noexcept
|
|
{
|
|
aMesh = {};
|
|
}
|
|
|
|
|
|
void S3D::INIT_S3DMODEL( S3DMODEL& aModel ) noexcept
|
|
{
|
|
aModel = {};
|
|
}
|
|
|
|
|
|
void S3D::FREE_SMESH( SMESH& aMesh) noexcept
|
|
{
|
|
if( NULL != aMesh.m_Positions )
|
|
{
|
|
delete [] aMesh.m_Positions;
|
|
aMesh.m_Positions = NULL;
|
|
}
|
|
|
|
if( NULL != aMesh.m_Normals )
|
|
{
|
|
delete [] aMesh.m_Normals;
|
|
aMesh.m_Normals = NULL;
|
|
}
|
|
|
|
if( NULL != aMesh.m_Texcoords )
|
|
{
|
|
delete [] aMesh.m_Texcoords;
|
|
aMesh.m_Texcoords = NULL;
|
|
}
|
|
|
|
if( NULL != aMesh.m_Color )
|
|
{
|
|
delete [] aMesh.m_Color;
|
|
aMesh.m_Color = NULL;
|
|
}
|
|
|
|
if( NULL != aMesh.m_FaceIdx )
|
|
{
|
|
delete [] aMesh.m_FaceIdx;
|
|
aMesh.m_FaceIdx = NULL;
|
|
}
|
|
|
|
aMesh.m_VertexSize = 0;
|
|
aMesh.m_FaceIdxSize = 0;
|
|
aMesh.m_MaterialIdx = 0;
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
void S3D::FREE_S3DMODEL( S3DMODEL& aModel )
|
|
{
|
|
if( NULL != aModel.m_Materials )
|
|
{
|
|
delete [] aModel.m_Materials;
|
|
aModel.m_Materials = NULL;
|
|
}
|
|
|
|
aModel.m_MaterialsSize = 0;
|
|
|
|
if( NULL != aModel.m_Meshes )
|
|
{
|
|
for( unsigned int i = 0; i < aModel.m_MeshesSize; ++i )
|
|
FREE_SMESH( aModel.m_Meshes[i] );
|
|
|
|
delete [] aModel.m_Meshes;
|
|
aModel.m_Meshes = NULL;
|
|
}
|
|
|
|
aModel.m_MeshesSize = 0;
|
|
|
|
return;
|
|
}
|