2015-02-18 00:29:54 +00:00
|
|
|
/*
|
|
|
|
* KiRouter - a push-and-(sometimes-)shove PCB router
|
|
|
|
*
|
|
|
|
* Copyright (C) 2013-2015 CERN
|
2016-08-29 14:38:11 +00:00
|
|
|
* Copyright (C) 2016 KiCad Developers, see AUTHORS.txt for contributors.
|
2015-02-18 00:29:54 +00:00
|
|
|
* Author: Tomasz Wlostowski <tomasz.wlostowski@cern.ch>
|
|
|
|
*
|
|
|
|
* 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, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <base_units.h> // God forgive me doing this...
|
|
|
|
|
|
|
|
#include "pns_node.h"
|
|
|
|
#include "pns_itemset.h"
|
|
|
|
#include "pns_topology.h"
|
|
|
|
#include "pns_meander_skew_placer.h"
|
|
|
|
|
|
|
|
#include "pns_router.h"
|
2016-08-15 15:16:48 +00:00
|
|
|
#include "pns_debug_decorator.h"
|
2015-02-18 00:29:54 +00:00
|
|
|
|
2016-08-29 14:38:11 +00:00
|
|
|
namespace PNS {
|
2015-02-18 00:29:54 +00:00
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
MEANDER_SKEW_PLACER::MEANDER_SKEW_PLACER ( ROUTER* aRouter ) :
|
|
|
|
MEANDER_PLACER ( aRouter )
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
2015-05-15 12:49:11 +00:00
|
|
|
// Init temporary variables (do not leave uninitialized members)
|
|
|
|
m_coupledLength = 0;
|
2015-02-18 00:29:54 +00:00
|
|
|
}
|
|
|
|
|
2015-02-18 16:53:46 +00:00
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
MEANDER_SKEW_PLACER::~MEANDER_SKEW_PLACER( )
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2015-02-18 16:53:46 +00:00
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
bool MEANDER_SKEW_PLACER::Start( const VECTOR2I& aP, ITEM* aStartItem )
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
|
|
|
VECTOR2I p;
|
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
if( !aStartItem || !aStartItem->OfKind( ITEM::SEGMENT_T ) )
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
2015-02-18 16:53:46 +00:00
|
|
|
Router()->SetFailureReason( _( "Please select a differential pair trace you want to tune." ) );
|
2015-02-18 00:29:54 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
m_initialSegment = static_cast<SEGMENT*>( aStartItem );
|
2015-02-18 00:29:54 +00:00
|
|
|
|
2015-02-18 16:53:46 +00:00
|
|
|
p = m_initialSegment->Seg().NearestPoint( aP );
|
2015-02-18 00:29:54 +00:00
|
|
|
|
|
|
|
m_currentNode = NULL;
|
|
|
|
m_currentStart = p;
|
|
|
|
|
2015-02-18 16:53:46 +00:00
|
|
|
m_world = Router()->GetWorld( )->Branch();
|
2015-02-18 00:29:54 +00:00
|
|
|
m_originLine = m_world->AssembleLine( m_initialSegment );
|
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
TOPOLOGY topo( m_world );
|
2015-02-18 00:29:54 +00:00
|
|
|
m_tunedPath = topo.AssembleTrivialPath( m_initialSegment );
|
|
|
|
|
|
|
|
if( !topo.AssembleDiffPair ( m_initialSegment, m_originPair ) )
|
|
|
|
{
|
|
|
|
Router()->SetFailureReason( _( "Unable to find complementary differential pair "
|
|
|
|
"net for skew tuning. Make sure the names of the nets belonging "
|
|
|
|
"to a differential pair end with either _N/_P or +/-." ) );
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2015-07-02 14:10:02 +00:00
|
|
|
if( m_originPair.Gap() < 0 )
|
2015-07-02 14:11:15 +00:00
|
|
|
m_originPair.SetGap( Router()->Sizes().DiffPairGap() );
|
2015-02-18 00:29:54 +00:00
|
|
|
|
|
|
|
if( !m_originPair.PLine().SegmentCount() ||
|
|
|
|
!m_originPair.NLine().SegmentCount() )
|
|
|
|
return false;
|
2015-02-18 16:53:46 +00:00
|
|
|
|
2015-07-02 14:11:15 +00:00
|
|
|
m_tunedPathP = topo.AssembleTrivialPath( m_originPair.PLine().GetLink( 0 ) );
|
|
|
|
m_tunedPathN = topo.AssembleTrivialPath( m_originPair.NLine().GetLink( 0 ) );
|
2015-02-18 00:29:54 +00:00
|
|
|
|
2016-08-30 17:01:30 +00:00
|
|
|
m_world->Remove( m_originLine );
|
2015-02-18 16:53:46 +00:00
|
|
|
|
2015-08-03 19:11:51 +00:00
|
|
|
m_currentWidth = m_originLine.Width();
|
2015-02-18 00:29:54 +00:00
|
|
|
m_currentEnd = VECTOR2I( 0, 0 );
|
|
|
|
|
2015-08-03 19:11:51 +00:00
|
|
|
if ( m_originPair.PLine().Net() == m_originLine.Net() )
|
2015-07-02 14:11:15 +00:00
|
|
|
m_coupledLength = itemsetLength( m_tunedPathN );
|
2015-02-18 00:29:54 +00:00
|
|
|
else
|
2015-07-02 14:11:15 +00:00
|
|
|
m_coupledLength = itemsetLength( m_tunedPathP );
|
2015-02-18 16:53:46 +00:00
|
|
|
|
2015-02-18 00:29:54 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
int MEANDER_SKEW_PLACER::origPathLength( ) const
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
|
|
|
return itemsetLength ( m_tunedPath );
|
|
|
|
}
|
|
|
|
|
2015-02-18 16:53:46 +00:00
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
int MEANDER_SKEW_PLACER::itemsetLength( const ITEM_SET& aSet ) const
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
|
|
|
int total = 0;
|
2016-08-29 17:31:13 +00:00
|
|
|
for( const ITEM* item : aSet.CItems() )
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
2016-08-29 17:31:13 +00:00
|
|
|
if( const LINE* l = dyn_cast<const LINE*>( item ) )
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
2015-02-18 16:53:46 +00:00
|
|
|
total += l->CLine().Length();
|
2015-02-18 00:29:54 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return total;
|
|
|
|
}
|
|
|
|
|
2015-02-18 16:53:46 +00:00
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
int MEANDER_SKEW_PLACER::currentSkew() const
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
|
|
|
return m_lastLength - m_coupledLength;
|
|
|
|
}
|
|
|
|
|
2015-02-18 16:53:46 +00:00
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
bool MEANDER_SKEW_PLACER::Move( const VECTOR2I& aP, ITEM* aEndItem )
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
2016-08-29 17:31:13 +00:00
|
|
|
for( const ITEM* item : m_tunedPathP.CItems() )
|
2015-08-19 15:27:23 +00:00
|
|
|
{
|
2016-08-29 17:31:13 +00:00
|
|
|
if( const LINE* l = dyn_cast<const LINE*>( item ) )
|
2016-08-15 15:16:48 +00:00
|
|
|
Dbg()->AddLine( l->CLine(), 5, 10000 );
|
2015-08-19 15:27:23 +00:00
|
|
|
}
|
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
for( const ITEM* item : m_tunedPathN.CItems() )
|
2015-08-19 15:27:23 +00:00
|
|
|
{
|
2016-08-29 17:31:13 +00:00
|
|
|
if( const LINE* l = dyn_cast<const LINE*>( item ) )
|
2016-08-15 15:16:48 +00:00
|
|
|
Dbg()->AddLine( l->CLine(), 4, 10000 );
|
2015-08-19 15:27:23 +00:00
|
|
|
}
|
|
|
|
|
2015-02-18 16:53:46 +00:00
|
|
|
return doMove( aP, aEndItem, m_coupledLength + m_settings.m_targetSkew );
|
2015-02-18 00:29:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-08-29 17:31:13 +00:00
|
|
|
const wxString MEANDER_SKEW_PLACER::TuningInfo() const
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
|
|
|
wxString status;
|
|
|
|
|
2015-02-18 16:53:46 +00:00
|
|
|
switch( m_lastStatus )
|
2015-02-18 00:29:54 +00:00
|
|
|
{
|
2015-10-05 16:28:41 +00:00
|
|
|
case TOO_LONG:
|
|
|
|
status = _( "Too long: skew " );
|
|
|
|
break;
|
|
|
|
case TOO_SHORT:
|
|
|
|
status = _( "Too short: skew " );
|
|
|
|
break;
|
|
|
|
case TUNED:
|
|
|
|
status = _( "Tuned: skew " );
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return _( "?" );
|
2015-02-18 00:29:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
status += LengthDoubleToString( (double) m_lastLength - m_coupledLength, false );
|
|
|
|
status += "/";
|
|
|
|
status += LengthDoubleToString( (double) m_settings.m_targetSkew, false );
|
2015-02-18 16:53:46 +00:00
|
|
|
|
2015-02-18 00:29:54 +00:00
|
|
|
return status;
|
|
|
|
}
|
2016-08-29 14:38:11 +00:00
|
|
|
|
|
|
|
}
|