kicad/pcbnew/router/pns_via.h

191 lines
5.1 KiB
C
Raw Normal View History

/*
* KiRouter - a push-and-(sometimes-)shove PCB router
*
* Copyright (C) 2013-2014 CERN
* Copyright (C) 2016-2022 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/>.
*/
#ifndef __PNS_VIA_H
#define __PNS_VIA_H
#include <geometry/shape_line_chain.h>
#include <geometry/shape_circle.h>
#include <math/box2.h>
2021-06-11 21:07:02 +00:00
#include "pcb_track.h"
#include "pns_item.h"
#include "pns_linked_item.h"
namespace PNS {
class NODE;
// uniquely identifies a VIA within a NODE without using pointers. Used to
// simplify (or complexifiy, depending on the point of view) the pointer management
// in PNS::NODE. Sooner or later I'll have to fix it for good using smart pointers - twl
struct VIA_HANDLE
{
2021-01-02 18:38:17 +00:00
bool valid = false;
VECTOR2I pos;
LAYER_RANGE layers;
int net = -1;
};
class VIA : public LINKED_ITEM
{
2013-09-26 21:53:54 +00:00
public:
VIA() :
LINKED_ITEM( VIA_T )
{
2019-12-28 00:55:11 +00:00
m_diameter = 2; // Dummy value
m_drill = 0;
m_viaType = VIATYPE::THROUGH;
m_isFree = false;
m_isVirtual = false;
}
2013-09-26 21:53:54 +00:00
2021-01-02 18:38:17 +00:00
VIA( const VECTOR2I& aPos, const LAYER_RANGE& aLayers, int aDiameter, int aDrill,
int aNet = -1, VIATYPE aViaType = VIATYPE::THROUGH ) :
LINKED_ITEM( VIA_T )
2013-09-26 21:53:54 +00:00
{
SetNet( aNet );
SetLayers( aLayers );
m_pos = aPos;
m_diameter = aDiameter;
m_drill = aDrill;
2013-09-26 21:53:54 +00:00
m_shape = SHAPE_CIRCLE( aPos, aDiameter / 2 );
m_hole = SHAPE_CIRCLE( m_pos, aDrill / 2 );
m_viaType = aViaType;
m_isFree = false;
m_isVirtual = false;
}
2013-09-26 21:53:54 +00:00
VIA( const VIA& aB ) :
LINKED_ITEM( aB )
2013-09-26 21:53:54 +00:00
{
SetNet( aB.Net() );
SetLayers( aB.Layers() );
m_pos = aB.m_pos;
m_diameter = aB.m_diameter;
2013-09-26 21:53:54 +00:00
m_shape = SHAPE_CIRCLE( m_pos, m_diameter / 2 );
m_hole = SHAPE_CIRCLE( m_pos, aB.m_drill / 2 );
m_marker = aB.m_marker;
m_rank = aB.m_rank;
m_drill = aB.m_drill;
m_viaType = aB.m_viaType;
m_isFree = aB.m_isFree;
m_isVirtual = aB.m_isVirtual;
2013-09-26 21:53:54 +00:00
}
static inline bool ClassOf( const ITEM* aItem )
{
return aItem && VIA_T == aItem->Kind();
}
2021-01-02 18:38:17 +00:00
const VECTOR2I& Pos() const { return m_pos; }
2013-09-26 21:53:54 +00:00
void SetPos( const VECTOR2I& aPos )
{
m_pos = aPos;
m_shape.SetCenter( aPos );
m_hole.SetCenter( aPos );
2013-09-26 21:53:54 +00:00
}
2021-01-02 18:38:17 +00:00
VIATYPE ViaType() const { return m_viaType; }
void SetViaType( VIATYPE aViaType ) { m_viaType = aViaType; }
2021-01-02 18:38:17 +00:00
int Diameter() const { return m_diameter; }
2013-09-26 21:53:54 +00:00
void SetDiameter( int aDiameter )
{
m_diameter = aDiameter;
m_shape.SetRadius( m_diameter / 2 );
}
2021-01-02 18:38:17 +00:00
int Drill() const { return m_drill; }
void SetDrill( int aDrill )
{
m_drill = aDrill;
m_hole.SetRadius( m_drill / 2 );
}
2013-09-26 21:53:54 +00:00
bool IsFree() const { return m_isFree; }
void SetIsFree( bool aIsFree ) { m_isFree = aIsFree; }
2021-01-02 18:38:17 +00:00
bool PushoutForce( NODE* aNode, const VECTOR2I& aDirection, VECTOR2I& aForce,
int aCollisionMask = ITEM::ANY_T, int aMaxIterations = 10 );
2013-09-26 21:53:54 +00:00
bool PushoutForce( NODE* aNode, const ITEM* aOther, VECTOR2I& aForce );
2021-01-02 18:38:17 +00:00
const SHAPE* Shape() const override { return &m_shape; }
2021-01-02 18:38:17 +00:00
const SHAPE_CIRCLE* Hole() const override { return &m_hole; }
void SetHole( const SHAPE_CIRCLE& aHole ) { m_hole = aHole; }
2016-09-24 18:53:15 +00:00
VIA* Clone() const override;
2013-09-26 21:53:54 +00:00
2021-01-02 18:38:17 +00:00
const SHAPE_LINE_CHAIN Hull( int aClearance = 0, int aWalkaroundThickness = 0,
int aLayer = -1 ) const override;
2022-06-07 23:48:03 +00:00
const SHAPE_LINE_CHAIN HoleHull( int aClearance = 0, int aWalkaroundThickness = 0,
int aLayer = -1 ) const override;
2016-09-25 17:06:49 +00:00
virtual VECTOR2I Anchor( int n ) const override
{
return m_pos;
2013-09-26 21:53:54 +00:00
}
2016-09-25 17:06:49 +00:00
virtual int AnchorCount() const override
{
return 1;
}
2013-09-26 21:53:54 +00:00
OPT_BOX2I ChangedArea( const VIA* aOther ) const;
2015-02-18 16:53:46 +00:00
const VIA_HANDLE MakeHandle() const;
virtual const std::string Format() const override;
2013-09-26 21:53:54 +00:00
private:
2019-12-28 00:55:11 +00:00
int m_diameter;
int m_drill;
VECTOR2I m_pos;
2013-09-26 21:53:54 +00:00
SHAPE_CIRCLE m_shape;
SHAPE_CIRCLE m_hole;
2019-12-28 00:55:11 +00:00
VIATYPE m_viaType;
bool m_isFree;
};
class VVIA : public VIA
{
public:
VVIA( const VECTOR2I& aPos, int aLayer, int aDiameter, int aNet ) :
VIA( aPos, LAYER_RANGE( aLayer, aLayer ), aDiameter, aDiameter / 2, aNet )
{
m_isVirtual = true;
SetHole( SHAPE_CIRCLE( Pos(), 1 ) );
}
};
}
#endif