2022-09-19 05:18:06 +00:00
|
|
|
/*
|
|
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2022 Mikolaj Wielgus
|
2023-02-22 09:10:06 +00:00
|
|
|
* Copyright (C) 2022-2023 KiCad Developers, see AUTHORS.txt for contributors.
|
2022-09-19 05:18:06 +00:00
|
|
|
*
|
|
|
|
* 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 3
|
|
|
|
* 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:
|
|
|
|
* https://www.gnu.org/licenses/gpl-3.0.html
|
|
|
|
* or you may search the http://www.gnu.org website for the version 3 license,
|
|
|
|
* or you may write to the Free Software Foundation, Inc.,
|
|
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sim/spice_model_parser.h>
|
|
|
|
#include <sim/spice_grammar.h>
|
|
|
|
#include <sim/sim_model_spice.h>
|
2022-10-04 15:17:41 +00:00
|
|
|
#include <sim/sim_library_spice.h>
|
2022-09-19 05:18:06 +00:00
|
|
|
|
2022-09-22 05:38:45 +00:00
|
|
|
#include <boost/algorithm/string/case_conv.hpp>
|
|
|
|
#include <boost/algorithm/string/predicate.hpp>
|
2022-09-19 05:18:06 +00:00
|
|
|
#include <pegtl.hpp>
|
|
|
|
#include <pegtl/contrib/parse_tree.hpp>
|
|
|
|
|
|
|
|
|
|
|
|
namespace SIM_MODEL_SPICE_PARSER
|
|
|
|
{
|
|
|
|
using namespace SPICE_GRAMMAR;
|
|
|
|
|
|
|
|
template <typename Rule> struct spiceUnitSelector : std::false_type {};
|
|
|
|
|
2022-10-04 15:17:41 +00:00
|
|
|
template <> struct spiceUnitSelector<dotModelAko> : std::true_type {};
|
2022-09-19 05:18:06 +00:00
|
|
|
template <> struct spiceUnitSelector<dotModel> : std::true_type {};
|
|
|
|
template <> struct spiceUnitSelector<modelName> : std::true_type {};
|
|
|
|
template <> struct spiceUnitSelector<dotModelType> : std::true_type {};
|
|
|
|
template <> struct spiceUnitSelector<param> : std::true_type {};
|
|
|
|
template <> struct spiceUnitSelector<paramValue> : std::true_type {};
|
|
|
|
|
|
|
|
template <> struct spiceUnitSelector<dotSubckt> : std::true_type {};
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2022-10-04 20:41:19 +00:00
|
|
|
SIM_MODEL::TYPE SPICE_MODEL_PARSER::ReadType( const SIM_LIBRARY_SPICE& aLibrary,
|
|
|
|
const std::string& aSpiceCode )
|
2022-09-19 05:18:06 +00:00
|
|
|
{
|
2022-09-22 05:38:45 +00:00
|
|
|
tao::pegtl::string_input<> in( aSpiceCode, "Spice_Code" );
|
2022-09-19 05:18:06 +00:00
|
|
|
std::unique_ptr<tao::pegtl::parse_tree::node> root;
|
|
|
|
|
|
|
|
try
|
|
|
|
{
|
|
|
|
root = tao::pegtl::parse_tree::parse<SIM_MODEL_SPICE_PARSER::spiceUnitGrammar,
|
|
|
|
SIM_MODEL_SPICE_PARSER::spiceUnitSelector,
|
|
|
|
tao::pegtl::nothing,
|
|
|
|
SIM_MODEL_SPICE_PARSER::control>
|
|
|
|
( in );
|
|
|
|
}
|
|
|
|
catch( const tao::pegtl::parse_error& e )
|
|
|
|
{
|
|
|
|
wxLogDebug( "%s", e.what() );
|
|
|
|
return SIM_MODEL::TYPE::NONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
for( const auto& node : root->children )
|
|
|
|
{
|
2022-10-04 20:41:19 +00:00
|
|
|
if( node->is_type<SIM_MODEL_SPICE_PARSER::dotModelAko>() )
|
|
|
|
{
|
|
|
|
std::string modelName = node->children.at( 0 )->string();
|
|
|
|
std::string akoName = node->children.at( 1 )->string();
|
|
|
|
const SIM_MODEL* sourceModel = aLibrary.FindModel( akoName );
|
|
|
|
|
|
|
|
if( !sourceModel )
|
|
|
|
{
|
|
|
|
THROW_IO_ERROR( wxString::Format(
|
2022-10-07 08:11:02 +00:00
|
|
|
_( "Could not find model '%s' to copy for \"A Kind Of\" model '%s'" ),
|
2022-10-04 20:41:19 +00:00
|
|
|
akoName,
|
|
|
|
modelName ) );
|
|
|
|
}
|
|
|
|
|
|
|
|
return sourceModel->GetType();
|
|
|
|
}
|
|
|
|
else if( node->is_type<SIM_MODEL_SPICE_PARSER::dotModel>() )
|
2022-09-19 05:18:06 +00:00
|
|
|
{
|
2022-09-22 05:38:45 +00:00
|
|
|
std::string paramName;
|
|
|
|
std::string typeString;
|
|
|
|
std::string level;
|
|
|
|
std::string version;
|
2022-09-19 05:18:06 +00:00
|
|
|
|
|
|
|
for( const auto& subnode : node->children )
|
|
|
|
{
|
|
|
|
if( subnode->is_type<SIM_MODEL_SPICE_PARSER::modelName>() )
|
|
|
|
{
|
|
|
|
// Do nothing.
|
|
|
|
}
|
|
|
|
else if( subnode->is_type<SIM_MODEL_SPICE_PARSER::dotModelType>() )
|
|
|
|
{
|
|
|
|
typeString = subnode->string();
|
|
|
|
SIM_MODEL::TYPE type = ReadTypeFromSpiceStrings( typeString );
|
|
|
|
|
|
|
|
if( type != SIM_MODEL::TYPE::RAWSPICE )
|
|
|
|
return type;
|
|
|
|
}
|
|
|
|
else if( subnode->is_type<SIM_MODEL_SPICE_PARSER::param>() )
|
|
|
|
{
|
|
|
|
paramName = subnode->string();
|
|
|
|
}
|
|
|
|
else if( subnode->is_type<SIM_MODEL_SPICE_PARSER::paramValue>() )
|
|
|
|
{
|
|
|
|
wxASSERT( paramName != "" );
|
|
|
|
|
|
|
|
if( paramName == "level" )
|
|
|
|
level = subnode->string();
|
|
|
|
else if( paramName == "version" )
|
|
|
|
version = subnode->string();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
wxFAIL_MSG( "Unhandled parse tree subnode" );
|
|
|
|
return SIM_MODEL::TYPE::NONE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Type was not determined from Spice type string alone, so now we take `level` and
|
|
|
|
// `version` variables into account too. This is suboptimal since we read the model
|
|
|
|
// twice this way, and moreover the code is now somewhat duplicated.
|
|
|
|
|
|
|
|
return ReadTypeFromSpiceStrings( typeString, level, version, false );
|
|
|
|
}
|
|
|
|
else if( node->is_type<SIM_MODEL_SPICE_PARSER::dotSubckt>() )
|
|
|
|
return SIM_MODEL::TYPE::SUBCKT;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
wxFAIL_MSG( "Unhandled parse tree node" );
|
|
|
|
return SIM_MODEL::TYPE::NONE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
wxFAIL_MSG( "Could not derive type from Spice code" );
|
|
|
|
return SIM_MODEL::TYPE::NONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2022-10-04 15:17:41 +00:00
|
|
|
void SPICE_MODEL_PARSER::ReadModel( const SIM_LIBRARY_SPICE& aLibrary,
|
|
|
|
const std::string& aSpiceCode )
|
2022-09-19 05:18:06 +00:00
|
|
|
{
|
|
|
|
// The default behavior is to treat the Spice param=value pairs as the model parameters and
|
|
|
|
// values (for many models the correspondence is not exact, so this function is overridden).
|
|
|
|
|
2022-09-22 05:38:45 +00:00
|
|
|
tao::pegtl::string_input<> in( aSpiceCode, "Spice_Code" );
|
2022-09-19 05:18:06 +00:00
|
|
|
std::unique_ptr<tao::pegtl::parse_tree::node> root;
|
|
|
|
|
|
|
|
try
|
|
|
|
{
|
|
|
|
root = tao::pegtl::parse_tree::parse<SIM_MODEL_SPICE_PARSER::spiceUnitGrammar,
|
|
|
|
SIM_MODEL_SPICE_PARSER::spiceUnitSelector,
|
|
|
|
tao::pegtl::nothing,
|
|
|
|
SIM_MODEL_SPICE_PARSER::control>
|
|
|
|
( in );
|
|
|
|
}
|
|
|
|
catch( tao::pegtl::parse_error& e )
|
|
|
|
{
|
|
|
|
THROW_IO_ERROR( e.what() );
|
|
|
|
}
|
|
|
|
|
|
|
|
for( const auto& node : root->children )
|
|
|
|
{
|
2022-10-04 15:17:41 +00:00
|
|
|
if( node->is_type<SIM_MODEL_SPICE_PARSER::dotModelAko>() )
|
2022-09-19 05:18:06 +00:00
|
|
|
{
|
2022-10-04 15:17:41 +00:00
|
|
|
std::string modelName = node->children.at( 0 )->string();
|
|
|
|
std::string akoName = node->children.at( 1 )->string();
|
|
|
|
|
2022-10-04 20:41:19 +00:00
|
|
|
const SIM_MODEL* sourceModel = aLibrary.FindModel( akoName );
|
2022-10-04 15:17:41 +00:00
|
|
|
|
|
|
|
if( !sourceModel )
|
|
|
|
{
|
|
|
|
THROW_IO_ERROR( wxString::Format(
|
2022-10-07 08:11:02 +00:00
|
|
|
_( "Could not find model '%s' to copy for \"A Kind Of\" model '%s'" ),
|
2022-10-04 15:17:41 +00:00
|
|
|
akoName,
|
|
|
|
modelName ) );
|
|
|
|
}
|
|
|
|
|
|
|
|
for( int i = 0; i < static_cast<int>( sourceModel->GetParamCount() ); ++i )
|
2023-02-22 09:10:06 +00:00
|
|
|
m_model.SetParamValue( i, sourceModel->GetParam( i ).value );
|
2022-10-04 15:17:41 +00:00
|
|
|
|
|
|
|
std::string paramName;
|
2022-09-19 05:18:06 +00:00
|
|
|
|
|
|
|
for( const auto& subnode : node->children )
|
|
|
|
{
|
|
|
|
if( subnode->is_type<SIM_MODEL_SPICE_PARSER::modelName>() )
|
|
|
|
{
|
|
|
|
// Do nothing.
|
|
|
|
}
|
|
|
|
else if( subnode->is_type<SIM_MODEL_SPICE_PARSER::dotModelType>() )
|
|
|
|
{
|
|
|
|
// Do nothing.
|
|
|
|
}
|
|
|
|
else if( subnode->is_type<SIM_MODEL_SPICE_PARSER::param>() )
|
|
|
|
{
|
|
|
|
paramName = subnode->string();
|
|
|
|
}
|
|
|
|
else if( subnode->is_type<SIM_MODEL_SPICE_PARSER::paramValue>() )
|
|
|
|
{
|
2022-09-22 05:38:45 +00:00
|
|
|
wxASSERT( paramName != "" );
|
2022-09-19 05:18:06 +00:00
|
|
|
|
2022-10-12 02:26:16 +00:00
|
|
|
m_model.SetParamFromSpiceCode( paramName, subnode->string() );
|
2022-10-04 15:17:41 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
wxFAIL_MSG( "Unhandled parse tree subnode" );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if( node->is_type<SIM_MODEL_SPICE_PARSER::dotModel>() )
|
|
|
|
{
|
|
|
|
std::string modelName;
|
|
|
|
std::string paramName;
|
|
|
|
|
|
|
|
for( const auto& subnode : node->children )
|
|
|
|
{
|
|
|
|
if( subnode->is_type<SIM_MODEL_SPICE_PARSER::modelName>() )
|
|
|
|
{
|
|
|
|
modelName = subnode->string();
|
|
|
|
}
|
|
|
|
else if( subnode->is_type<SIM_MODEL_SPICE_PARSER::dotModelType>() )
|
|
|
|
{
|
|
|
|
// Do nothing.
|
|
|
|
}
|
|
|
|
else if( subnode->is_type<SIM_MODEL_SPICE_PARSER::param>() )
|
|
|
|
{
|
|
|
|
paramName = subnode->string();
|
|
|
|
}
|
|
|
|
else if( subnode->is_type<SIM_MODEL_SPICE_PARSER::paramValue>() )
|
|
|
|
{
|
|
|
|
wxASSERT( paramName != "" );
|
|
|
|
|
2022-10-12 02:26:16 +00:00
|
|
|
m_model.SetParamFromSpiceCode( paramName, subnode->string() );
|
2022-09-19 05:18:06 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
wxFAIL_MSG( "Unhandled parse tree subnode" );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
wxFAIL_MSG( "Unhandled parse tree node" );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
m_model.m_spiceCode = aSpiceCode;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2022-09-22 05:38:45 +00:00
|
|
|
SIM_MODEL::TYPE SPICE_MODEL_PARSER::ReadTypeFromSpiceStrings( const std::string& aTypeString,
|
|
|
|
const std::string& aLevel,
|
|
|
|
const std::string& aVersion,
|
2022-09-19 05:18:06 +00:00
|
|
|
bool aSkipDefaultLevel )
|
|
|
|
{
|
2023-02-22 09:10:06 +00:00
|
|
|
std::string readLevel = wxString( aLevel ).BeforeFirst( '.' ).ToStdString();
|
2022-09-19 05:18:06 +00:00
|
|
|
|
|
|
|
for( SIM_MODEL::TYPE type : SIM_MODEL::TYPE_ITERATOR() )
|
|
|
|
{
|
2022-09-22 05:38:45 +00:00
|
|
|
std::string typePrefix = SIM_MODEL::SpiceInfo( type ).modelType;
|
|
|
|
std::string level = SIM_MODEL::SpiceInfo( type ).level;
|
|
|
|
std::string version = SIM_MODEL::SpiceInfo( type ).version;
|
2022-09-19 05:18:06 +00:00
|
|
|
bool isDefaultLevel = SIM_MODEL::SpiceInfo( type ).isDefaultLevel;
|
|
|
|
|
|
|
|
if( typePrefix == "" )
|
|
|
|
continue;
|
|
|
|
|
2023-03-20 16:14:21 +00:00
|
|
|
if( boost::starts_with( typePrefix, "VDMOS" ) )
|
2022-09-19 05:18:06 +00:00
|
|
|
{
|
2023-03-20 16:14:21 +00:00
|
|
|
wxString deviceType = wxString( typePrefix ).BeforeFirst( ' ' ); // VDMOS
|
|
|
|
wxString channelType = wxString( typePrefix ).AfterFirst( ' ' ); // NCHAN or PCHAN
|
|
|
|
|
|
|
|
wxStringTokenizer tokenizer( aTypeString, wxT( " \t\n\r+(" ), wxTOKEN_STRTOK );
|
|
|
|
|
|
|
|
if( tokenizer.HasMoreTokens() && tokenizer.GetNextToken().Upper() == deviceType
|
|
|
|
&& tokenizer.HasMoreTokens() && tokenizer.GetNextToken().Upper() == channelType )
|
|
|
|
{
|
|
|
|
return type;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if( boost::starts_with( boost::to_upper_copy( aTypeString ), typePrefix ) )
|
|
|
|
{
|
|
|
|
if( version != aVersion )
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if( level == readLevel )
|
|
|
|
return type;
|
|
|
|
|
|
|
|
if( aSkipDefaultLevel )
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if( isDefaultLevel && aLevel == "" )
|
|
|
|
return type;
|
2022-09-19 05:18:06 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// If the type string is not recognized, demote to a raw Spice element. This way the user won't
|
|
|
|
// have an error if there is a type KiCad does not recognize.
|
|
|
|
return SIM_MODEL::TYPE::RAWSPICE;
|
|
|
|
}
|
2022-10-04 15:17:41 +00:00
|
|
|
|