239 lines
7.9 KiB
C++
239 lines
7.9 KiB
C++
/*
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
*
|
|
* Copyright (C) 2004-2020 KiCad Developers.
|
|
*
|
|
* 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
|
|
*/
|
|
|
|
#include <common.h>
|
|
#include <class_board.h>
|
|
#include <pcb_shape.h>
|
|
|
|
#include <geometry/seg.h>
|
|
#include <geometry/shape_segment.h>
|
|
|
|
#include <drc/drc_engine.h>
|
|
#include <drc/drc_item.h>
|
|
#include <drc/drc_rule.h>
|
|
#include <drc/drc_test_provider_clearance_base.h>
|
|
|
|
#include <drc/drc_rtree.h>
|
|
|
|
/*
|
|
Silk to silk clearance test. Check all silkscreen features against each other.
|
|
Errors generated:
|
|
- DRCE_OVERLAPPING_SILK
|
|
|
|
*/
|
|
|
|
class DRC_TEST_PROVIDER_SILK_CLEARANCE : public DRC_TEST_PROVIDER
|
|
{
|
|
public:
|
|
DRC_TEST_PROVIDER_SILK_CLEARANCE ()
|
|
{
|
|
}
|
|
|
|
virtual ~DRC_TEST_PROVIDER_SILK_CLEARANCE()
|
|
{
|
|
}
|
|
|
|
virtual bool Run() override;
|
|
|
|
virtual const wxString GetName() const override
|
|
{
|
|
return "silk_clearance";
|
|
};
|
|
|
|
virtual const wxString GetDescription() const override
|
|
{
|
|
return "Tests for overlapping silkscreen features.";
|
|
}
|
|
|
|
virtual int GetNumPhases() const override
|
|
{
|
|
return 1;
|
|
}
|
|
|
|
virtual std::set<DRC_CONSTRAINT_TYPE_T> GetConstraintTypes() const override;
|
|
|
|
private:
|
|
|
|
BOARD* m_board;
|
|
int m_largestClearance;
|
|
};
|
|
|
|
|
|
bool DRC_TEST_PROVIDER_SILK_CLEARANCE::Run()
|
|
{
|
|
m_board = m_drcEngine->GetBoard();
|
|
|
|
DRC_CONSTRAINT worstClearanceConstraint;
|
|
m_largestClearance = 0;
|
|
|
|
if( m_drcEngine->IsErrorLimitExceeded( DRCE_OVERLAPPING_SILK ) )
|
|
{
|
|
reportAux( "Silkscreen clearance testing not run." );
|
|
return true;
|
|
}
|
|
|
|
if( m_drcEngine->QueryWorstConstraint( DRC_CONSTRAINT_TYPE_SILK_CLEARANCE,
|
|
worstClearanceConstraint, DRCCQ_LARGEST_MINIMUM ) )
|
|
{
|
|
m_largestClearance = worstClearanceConstraint.m_Value.Min();
|
|
}
|
|
|
|
reportAux( "Worst clearance : %d nm", m_largestClearance );
|
|
|
|
if( !reportPhase( _( "Checking silkscreen for overlapping items..." ) ) )
|
|
return false;
|
|
|
|
DRC_RTREE silkTree, targetTree;
|
|
|
|
auto addToSilkTree =
|
|
[&silkTree]( BOARD_ITEM *item ) -> bool
|
|
{
|
|
silkTree.insert( item );
|
|
return true;
|
|
};
|
|
|
|
auto addToTargetTree =
|
|
[&targetTree]( BOARD_ITEM *item ) -> bool
|
|
{
|
|
targetTree.insert( item );
|
|
return true;
|
|
};
|
|
|
|
auto checkClearance =
|
|
[&]( const DRC_RTREE::LAYER_PAIR& aLayers, DRC_RTREE::ITEM_WITH_SHAPE* aRefItem,
|
|
DRC_RTREE::ITEM_WITH_SHAPE* aTestItem, bool* aCollisionDetected ) -> bool
|
|
{
|
|
if( m_drcEngine->IsErrorLimitExceeded( DRCE_OVERLAPPING_SILK ) )
|
|
return false;
|
|
|
|
if ( isInvisibleText( aRefItem->parent ) )
|
|
return true;
|
|
|
|
if ( isInvisibleText( aTestItem->parent ) )
|
|
return true;
|
|
|
|
auto constraint = m_drcEngine->EvalRulesForItems( DRC_CONSTRAINT_TYPE_SILK_CLEARANCE,
|
|
aRefItem->parent,
|
|
aTestItem->parent,
|
|
aLayers.second );
|
|
|
|
if( constraint.IsNull() )
|
|
return true;
|
|
|
|
int minClearance = constraint.GetValue().Min();
|
|
int actual;
|
|
VECTOR2I pos;
|
|
|
|
accountCheck( constraint );
|
|
|
|
// Graphics are often compound shapes so ignore collisions between shapes in a
|
|
// single footprint or on the board.
|
|
PCB_SHAPE* refGraphic = dynamic_cast<PCB_SHAPE*>( aRefItem->parent );
|
|
PCB_SHAPE* testGraphic = dynamic_cast<PCB_SHAPE*>( aTestItem->parent );
|
|
|
|
if( refGraphic && testGraphic )
|
|
{
|
|
MODULE *refParentFP = dynamic_cast<MODULE*>( refGraphic->GetParent() );
|
|
MODULE *testParentFP = dynamic_cast<MODULE*>( testGraphic->GetParent() );
|
|
|
|
if( refParentFP == testParentFP ) // also true when both are nullptr
|
|
return true;
|
|
}
|
|
|
|
if( !aRefItem->shape->Collide( aTestItem->shape, minClearance, &actual, &pos ) )
|
|
return true;
|
|
|
|
std::shared_ptr<DRC_ITEM> drcItem = DRC_ITEM::Create( DRCE_OVERLAPPING_SILK );
|
|
|
|
if( minClearance > 0 )
|
|
{
|
|
m_msg.Printf( drcItem->GetErrorText() + wxS( " " ) + _( "(%s clearance %s; actual %s)" ),
|
|
constraint.GetParentRule()->m_Name,
|
|
MessageTextFromValue( userUnits(), minClearance ),
|
|
MessageTextFromValue( userUnits(), actual ) );
|
|
|
|
drcItem->SetErrorMessage( m_msg );
|
|
}
|
|
|
|
drcItem->SetItems( aRefItem->parent, aTestItem->parent );
|
|
drcItem->SetViolatingRule( constraint.GetParentRule() );
|
|
|
|
reportViolation( drcItem, (wxPoint) pos );
|
|
|
|
*aCollisionDetected = true;
|
|
return true;
|
|
};
|
|
|
|
forEachGeometryItem( {}, LSET( 2, F_SilkS, B_SilkS ), addToSilkTree );
|
|
forEachGeometryItem( {}, LSET::FrontMask() | LSET::BackMask(), addToTargetTree );
|
|
|
|
reportAux( _("Testing %d silkscreen features against %d board items."),
|
|
silkTree.size(),
|
|
targetTree.size() );
|
|
|
|
const std::vector<DRC_RTREE::LAYER_PAIR> layerPairs =
|
|
{
|
|
DRC_RTREE::LAYER_PAIR( F_SilkS, F_SilkS ),
|
|
DRC_RTREE::LAYER_PAIR( F_SilkS, F_Mask ),
|
|
DRC_RTREE::LAYER_PAIR( F_SilkS, F_Adhes ),
|
|
DRC_RTREE::LAYER_PAIR( F_SilkS, F_Paste ),
|
|
DRC_RTREE::LAYER_PAIR( F_SilkS, F_CrtYd ),
|
|
DRC_RTREE::LAYER_PAIR( F_SilkS, F_Fab ),
|
|
DRC_RTREE::LAYER_PAIR( F_SilkS, F_Cu ),
|
|
DRC_RTREE::LAYER_PAIR( F_SilkS, Edge_Cuts ),
|
|
DRC_RTREE::LAYER_PAIR( B_SilkS, B_SilkS ),
|
|
DRC_RTREE::LAYER_PAIR( B_SilkS, B_Mask ),
|
|
DRC_RTREE::LAYER_PAIR( B_SilkS, B_Adhes ),
|
|
DRC_RTREE::LAYER_PAIR( B_SilkS, B_Paste ),
|
|
DRC_RTREE::LAYER_PAIR( B_SilkS, B_CrtYd ),
|
|
DRC_RTREE::LAYER_PAIR( B_SilkS, B_Fab ),
|
|
DRC_RTREE::LAYER_PAIR( B_SilkS, B_Cu ),
|
|
DRC_RTREE::LAYER_PAIR( B_SilkS, Edge_Cuts )
|
|
};
|
|
|
|
// This is the number of tests between 2 calls to the progress bar
|
|
const int delta = 250;
|
|
|
|
targetTree.QueryCollidingPairs( &silkTree, layerPairs, checkClearance, m_largestClearance,
|
|
[&]( int aCount, int aSize ) -> bool
|
|
{
|
|
return reportProgress( aCount, aSize, delta );
|
|
} );
|
|
|
|
reportRuleStatistics();
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
std::set<DRC_CONSTRAINT_TYPE_T> DRC_TEST_PROVIDER_SILK_CLEARANCE::GetConstraintTypes() const
|
|
{
|
|
return { DRC_CONSTRAINT_TYPE_SILK_CLEARANCE };
|
|
}
|
|
|
|
|
|
namespace detail
|
|
{
|
|
static DRC_REGISTER_TEST_PROVIDER<DRC_TEST_PROVIDER_SILK_CLEARANCE> dummy;
|
|
}
|