/* * KiRouter - a push-and-(sometimes-)shove PCB router * * Copyright (C) 2013-2014 CERN * Copyright (C) 2016-2020 KiCad Developers, see AUTHORS.txt for contributors. * Author: Tomasz Wlostowski * * 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 . */ #include "pns_via.h" #include "pns_node.h" #include "pns_utils.h" #include "pns_router.h" #include #include namespace PNS { bool VIA::PushoutForce( NODE* aNode, const ITEM* aOther, VECTOR2I& aForce ) { int clearance = aNode->GetClearance( this, aOther ); int holeClearance = aNode->GetHoleClearance( this, aOther ); int hole2holeClearance = aNode->GetHoleToHoleClearance( this, aOther ); VECTOR2I f[4], force; if( aOther->Hole() ) { aOther->Hole()->Collide( Shape(), holeClearance, &f[0] ); aOther->Hole()->Collide( Hole(), hole2holeClearance, &f[1] ); } aOther->Shape()->Collide( Shape(), clearance, &f[2] ); aOther->Shape()->Collide( Hole(), holeClearance, &f[3] ); for( int i = 0; i < 4; i++ ) { if( f[i].SquaredEuclideanNorm() > force.SquaredEuclideanNorm() ) force = f[i]; } aForce = force; return ( force != VECTOR2I( 0, 0 ) ); } bool VIA::PushoutForce( NODE* aNode, const VECTOR2I& aDirection, VECTOR2I& aForce, bool aSolidsOnly, int aMaxIterations ) { int iter = 0; VIA mv( *this ); VECTOR2I totalForce; while( iter < aMaxIterations ) { NODE::OPT_OBSTACLE obs = aNode->CheckColliding( &mv, aSolidsOnly ? ITEM::SOLID_T : ITEM::ANY_T ); if( !obs ) break; if( iter > aMaxIterations / 2 ) { VECTOR2I l = aDirection.Resize( m_diameter / 2 ); totalForce += l; mv.SetPos( mv.Pos() + l ); } VECTOR2I force; bool collFound = PushoutForce( aNode, obs->m_item, force ); if( collFound ) { totalForce += force; mv.SetPos( mv.Pos() + force ); } iter++; } if( iter == aMaxIterations ) return false; aForce = totalForce; return true; } const SHAPE_LINE_CHAIN VIA::Hull( int aClearance, int aWalkaroundThickness, int aLayer ) const { int cl = ( aClearance + aWalkaroundThickness / 2 ); int width = m_diameter; if( !ROUTER::GetInstance()->GetInterface()->IsFlashedOnLayer( this, aLayer ) ) width = m_drill; // Chamfer = width * ( 1 - sqrt(2)/2 ) for equilateral octagon return OctagonalHull( m_pos - VECTOR2I( width / 2, width / 2 ), VECTOR2I( width, width ), cl + 1, ( 2 * cl + width ) * ( 1.0 - M_SQRT1_2 ) ); } 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_hole = SHAPE_CIRCLE( m_pos, m_drill / 2 ); v->m_rank = m_rank; v->m_marker = m_marker; v->m_viaType = m_viaType; v->m_parent = m_parent; v->m_isFree = m_isFree; v->m_isVirtual = m_isVirtual; return v; } OPT_BOX2I VIA::ChangedArea( const VIA* aOther ) const { if ( aOther->Pos() != Pos() ) { BOX2I tmp = Shape()->BBox(); 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; } }