251 lines
6.8 KiB
C++
251 lines
6.8 KiB
C++
/*
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
*
|
|
* Copyright (C) 2007, 2008 Lubo Racko <developer@lura.sk>
|
|
* Copyright (C) 2007, 2008, 2012-2013 Alexander Lunev <al.lunev@yahoo.com>
|
|
* Copyright (C) 2012 KiCad Developers, see CHANGELOG.TXT for contributors.
|
|
*
|
|
* 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 2
|
|
* 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:
|
|
* http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
|
|
* or you may search the http://www.gnu.org website for the version 2 license,
|
|
* or you may write to the Free Software Foundation, Inc.,
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
|
|
*/
|
|
|
|
/**
|
|
* @file pcb_polygon.cpp
|
|
*/
|
|
|
|
#include <wx/wx.h>
|
|
#include <wx/config.h>
|
|
|
|
#include <common.h>
|
|
|
|
#include <pcb_polygon.h>
|
|
|
|
namespace PCAD2KICAD {
|
|
|
|
PCB_POLYGON::PCB_POLYGON( PCB_CALLBACKS* aCallbacks, BOARD* aBoard, int aPCadLayer ) :
|
|
PCB_COMPONENT( aCallbacks, aBoard )
|
|
{
|
|
m_width = 0;
|
|
m_priority = 0;
|
|
m_objType = wxT( 'Z' );
|
|
m_PCadLayer = aPCadLayer;
|
|
m_KiCadLayer = GetKiCadLayer();
|
|
m_timestamp = GetNewTimestamp();
|
|
m_filled = true;
|
|
}
|
|
|
|
|
|
PCB_POLYGON::~PCB_POLYGON()
|
|
{
|
|
int i, island;
|
|
|
|
for( i = 0; i < (int) m_outline.GetCount(); i++ )
|
|
{
|
|
delete m_outline[i];
|
|
}
|
|
|
|
for( island = 0; island < (int) m_cutouts.GetCount(); island++ )
|
|
{
|
|
for( i = 0; i < (int) m_cutouts[island]->GetCount(); i++ )
|
|
{
|
|
delete (*m_cutouts[island])[i];
|
|
}
|
|
|
|
delete m_cutouts[island];
|
|
}
|
|
|
|
for( island = 0; island < (int) m_islands.GetCount(); island++ )
|
|
{
|
|
for( i = 0; i < (int) m_islands[island]->GetCount(); i++ )
|
|
{
|
|
delete (*m_islands[island])[i];
|
|
}
|
|
|
|
delete m_islands[island];
|
|
}
|
|
}
|
|
|
|
void PCB_POLYGON::AssignNet( wxString aNetName )
|
|
{
|
|
m_net = aNetName;
|
|
m_netCode = GetNetCode( m_net );
|
|
}
|
|
|
|
void PCB_POLYGON::SetOutline( VERTICES_ARRAY* aOutline )
|
|
{
|
|
int i;
|
|
|
|
m_outline.Empty();
|
|
|
|
for( i = 0; i < (int) aOutline->GetCount(); i++ )
|
|
m_outline.Add( new wxRealPoint( (*aOutline)[i]->x, (*aOutline)[i]->y ) );
|
|
|
|
m_positionX = m_outline[0]->x;
|
|
m_positionY = m_outline[0]->y;
|
|
}
|
|
|
|
void PCB_POLYGON::FormPolygon( XNODE* aNode, VERTICES_ARRAY* aPolygon,
|
|
wxString aDefaultMeasurementUnit, wxString aActualConversion )
|
|
{
|
|
XNODE* lNode;
|
|
double x, y;
|
|
|
|
lNode = FindNode( aNode, wxT( "pt" ) );
|
|
|
|
while( lNode )
|
|
{
|
|
if( lNode->GetName() == wxT( "pt" ) )
|
|
{
|
|
SetDoublePrecisionPosition(
|
|
lNode->GetNodeContent(), aDefaultMeasurementUnit, &x, &y, aActualConversion );
|
|
aPolygon->Add( new wxRealPoint( x, y ) );
|
|
}
|
|
|
|
lNode = lNode->GetNext();
|
|
}
|
|
}
|
|
|
|
|
|
bool PCB_POLYGON::Parse( XNODE* aNode,
|
|
wxString aDefaultMeasurementUnit,
|
|
wxString aActualConversion,
|
|
wxStatusBar* aStatusBar )
|
|
{
|
|
XNODE* lNode;
|
|
wxString propValue;
|
|
|
|
// aStatusBar->SetStatusText( aStatusBar->GetStatusText() + wxT( " Polygon..." ) );
|
|
|
|
lNode = FindNode( aNode, wxT( "netNameRef" ) );
|
|
|
|
if( lNode )
|
|
{
|
|
lNode->GetAttribute( wxT( "Name" ), &propValue );
|
|
propValue.Trim( false );
|
|
propValue.Trim( true );
|
|
m_net = propValue;
|
|
m_netCode = GetNetCode( m_net );
|
|
}
|
|
|
|
// retrieve polygon outline
|
|
FormPolygon( aNode, &m_outline, aDefaultMeasurementUnit, aActualConversion );
|
|
|
|
m_positionX = m_outline[0]->x;
|
|
m_positionY = m_outline[0]->y;
|
|
|
|
// fill the polygon with the same contour as its outline is
|
|
m_islands.Add( new VERTICES_ARRAY );
|
|
FormPolygon( aNode, m_islands[0], aDefaultMeasurementUnit, aActualConversion );
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
void PCB_POLYGON::AddToModule( MODULE* aModule )
|
|
{
|
|
}
|
|
|
|
|
|
void PCB_POLYGON::AddToBoard()
|
|
{
|
|
int i = 0;
|
|
|
|
if( m_outline.GetCount() > 0 )
|
|
{
|
|
ZONE_CONTAINER* zone = new ZONE_CONTAINER( m_board );
|
|
m_board->Add( zone, ADD_APPEND );
|
|
|
|
zone->SetTimeStamp( m_timestamp );
|
|
zone->SetLayer( m_KiCadLayer );
|
|
zone->SetNet( m_netCode );
|
|
|
|
// add outline
|
|
int outline_hatch = CPolyLine::DIAGONAL_EDGE;
|
|
|
|
zone->Outline()->Start( m_KiCadLayer, KiROUND( m_outline[i]->x ),
|
|
KiROUND( m_outline[i]->y ), outline_hatch );
|
|
|
|
for( i = 1; i < (int) m_outline.GetCount(); i++ )
|
|
{
|
|
zone->AppendCorner( wxPoint( KiROUND( m_outline[i]->x ),
|
|
KiROUND( m_outline[i]->y ) ) );
|
|
}
|
|
|
|
zone->Outline()->CloseLastContour();
|
|
|
|
zone->SetZoneClearance( m_width );
|
|
|
|
zone->SetPriority( m_priority );
|
|
|
|
zone->Outline()->SetHatch( outline_hatch,
|
|
Mils2iu( zone->Outline()->GetDefaultHatchPitchMils() ),
|
|
true );
|
|
|
|
if ( m_objType == wxT( 'K' ) )
|
|
{
|
|
zone->SetIsKeepout( true );
|
|
zone->SetDoNotAllowTracks( true );
|
|
zone->SetDoNotAllowVias( true );
|
|
zone->SetDoNotAllowCopperPour( true );
|
|
}
|
|
else if( m_objType == wxT( 'C' ) )
|
|
{
|
|
// convert cutouts to keepouts because standalone cutouts are not supported in KiCad
|
|
zone->SetIsKeepout( true );
|
|
zone->SetDoNotAllowCopperPour( true );
|
|
}
|
|
|
|
//if( m_filled )
|
|
// cvpcb is not linked
|
|
// zone->BuildFilledPolysListData( m_board );
|
|
}
|
|
}
|
|
|
|
|
|
void PCB_POLYGON::SetPosOffset( int aX_offs, int aY_offs )
|
|
{
|
|
int i, island;
|
|
|
|
PCB_COMPONENT::SetPosOffset( aX_offs, aY_offs );
|
|
|
|
for( i = 0; i < (int) m_outline.GetCount(); i++ )
|
|
{
|
|
m_outline[i]->x += aX_offs;
|
|
m_outline[i]->y += aY_offs;
|
|
}
|
|
|
|
for( island = 0; island < (int) m_islands.GetCount(); island++ )
|
|
{
|
|
for( i = 0; i < (int) m_islands[island]->GetCount(); i++ )
|
|
{
|
|
(*m_islands[island])[i]->x += aX_offs;
|
|
(*m_islands[island])[i]->y += aY_offs;
|
|
}
|
|
}
|
|
|
|
for( island = 0; island < (int) m_cutouts.GetCount(); island++ )
|
|
{
|
|
for( i = 0; i < (int) m_cutouts[island]->GetCount(); i++ )
|
|
{
|
|
(*m_cutouts[island])[i]->x += aX_offs;
|
|
(*m_cutouts[island])[i]->y += aY_offs;
|
|
}
|
|
}
|
|
}
|
|
|
|
} // namespace PCAD2KICAD
|