kicad/pcbnew/router/pns_via.cpp

127 lines
3.1 KiB
C++
Raw Normal View History

/*
* KiRouter - a push-and-(sometimes-)shove PCB router
*
* Copyright (C) 2013-2014 CERN
* Copyright (C) 2016 KiCad Developers, see AUTHORS.txt for contributors.
* Author: Tomasz Wlostowski <tomasz.wlostowski@cern.ch>
2013-09-26 21:53:54 +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.
2013-09-26 21:53:54 +00:00
*
* 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.
2013-09-26 21:53:54 +00:00
*
* 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 "pns_via.h"
#include "pns_node.h"
#include "pns_utils.h"
#include "pns_router.h"
#include <geometry/shape_rect.h>
#include <math/box2.h>
namespace PNS {
bool VIA::PushoutForce( NODE* aNode, const VECTOR2I& aDirection, VECTOR2I& aForce,
bool aSolidsOnly, int aMaxIterations )
{
2013-09-26 21:53:54 +00:00
int iter = 0;
VIA mv( *this );
VECTOR2I force, totalForce, force2;
2013-09-26 21:53:54 +00:00
while( iter < aMaxIterations )
{
NODE::OPT_OBSTACLE obs = aNode->CheckColliding( &mv,
aSolidsOnly ? ITEM::SOLID_T : ITEM::ANY_T );
2013-09-26 21:53:54 +00:00
if( !obs )
break;
int clearance = aNode->GetClearance( obs->m_item, &mv );
if( iter > aMaxIterations / 2 )
2013-09-26 21:53:54 +00:00
{
VECTOR2I l = aDirection.Resize( m_diameter / 2 );
2013-09-26 21:53:54 +00:00
totalForce += l;
mv.SetPos( mv.Pos() + l );
2013-09-26 21:53:54 +00:00
}
bool col = CollideShapes( obs->m_item->Shape(), mv.Shape(), clearance, true, force2 );
if( col ) {
totalForce += force2;
mv.SetPos( mv.Pos() + force2 );
2013-09-26 21:53:54 +00:00
}
2013-09-26 21:53:54 +00:00
iter++;
}
2013-09-26 21:53:54 +00:00
if( iter == aMaxIterations )
return false;
aForce = totalForce;
2013-09-26 21:53:54 +00:00
return true;
}
2013-09-26 21:53:54 +00:00
const SHAPE_LINE_CHAIN VIA::Hull( int aClearance, int aWalkaroundThickness ) const
{
int cl = ( aClearance + aWalkaroundThickness / 2 );
2013-09-26 21:53:54 +00:00
return OctagonalHull( m_pos -
VECTOR2I( m_diameter / 2, m_diameter / 2 ), VECTOR2I( m_diameter, m_diameter ),
cl + 1, ( 2 * cl + m_diameter ) * 0.26 );
}
VIA* VIA::Clone() const
{
VIA* v = new VIA();
v->SetNet( Net() );
v->SetLayers( Layers() );
v->m_pos = m_pos;
v->m_diameter = m_diameter;
v->m_drill = m_drill;
v->m_shape = SHAPE_CIRCLE( m_pos, m_diameter / 2 );
v->m_rank = m_rank;
v->m_marker = m_marker;
v->m_viaType = m_viaType;
v->m_parent = m_parent;
return v;
}
2015-02-18 16:53:46 +00:00
OPT_BOX2I VIA::ChangedArea( const VIA* aOther ) const
{
if ( aOther->Pos() != Pos() )
{
2015-02-18 16:53:46 +00:00
BOX2I tmp = Shape()->BBox();
2015-07-07 16:36:38 +00:00
tmp.Merge( aOther->Shape()->BBox() );
return tmp;
}
return OPT_BOX2I();
}
const VIA_HANDLE VIA::MakeHandle() const
{
VIA_HANDLE h;
h.pos = Pos();
h.layers = Layers();
h.net = Net();
h.valid = true;
return h;
}
}