/* * This program source code file is part of KiCad, a free EDA CAD application. * * Copyright (C) 2004-2021 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 #include #include #include #include #include #include #include #include "drc_rtree.h" /* Board edge clearance test. Checks all items for their mechanical clearances against the board edge. Errors generated: - DRCE_COPPER_EDGE_CLEARANCE TODO: - separate holes to edge check - tester only looks for edge crossings. it doesn't check if items are inside/outside the board area. - pad test missing! */ class DRC_TEST_PROVIDER_EDGE_CLEARANCE : public DRC_TEST_PROVIDER_CLEARANCE_BASE { public: DRC_TEST_PROVIDER_EDGE_CLEARANCE () : DRC_TEST_PROVIDER_CLEARANCE_BASE() { } virtual ~DRC_TEST_PROVIDER_EDGE_CLEARANCE() { } virtual bool Run() override; virtual const wxString GetName() const override { return "edge_clearance"; } virtual const wxString GetDescription() const override { return "Tests items vs board edge clearance"; } virtual std::set GetConstraintTypes() const override; int GetNumPhases() const override; private: bool testAgainstEdge( BOARD_ITEM* item, SHAPE* itemShape, BOARD_ITEM* other, DRC_CONSTRAINT_T aConstraintType, PCB_DRC_CODE aErrorCode ); }; bool DRC_TEST_PROVIDER_EDGE_CLEARANCE::testAgainstEdge( BOARD_ITEM* item, SHAPE* itemShape, BOARD_ITEM* edge, DRC_CONSTRAINT_T aConstraintType, PCB_DRC_CODE aErrorCode ) { const std::shared_ptr& edgeShape = edge->GetEffectiveShape( Edge_Cuts ); auto constraint = m_drcEngine->EvalRules( aConstraintType, edge, item, item->GetLayer() ); int minClearance = constraint.GetValue().Min(); int actual; VECTOR2I pos; if( minClearance >= 0 && itemShape->Collide( edgeShape.get(), minClearance, &actual, &pos ) ) { std::shared_ptr drce = DRC_ITEM::Create( aErrorCode ); // Only report clearance info if there is any; otherwise it's just a straight collision if( minClearance > 0 ) { m_msg.Printf( _( "(%s clearance %s; actual %s)" ), constraint.GetName(), MessageTextFromValue( userUnits(), minClearance ), MessageTextFromValue( userUnits(), actual ) ); drce->SetErrorMessage( drce->GetErrorText() + wxS( " " ) + m_msg ); } drce->SetItems( edge->m_Uuid, item->m_Uuid ); drce->SetViolatingRule( constraint.GetParentRule() ); reportViolation( drce, (wxPoint) pos ); } return true; } bool DRC_TEST_PROVIDER_EDGE_CLEARANCE::Run() { m_board = m_drcEngine->GetBoard(); DRC_CONSTRAINT worstClearanceConstraint; if( m_drcEngine->QueryWorstConstraint( EDGE_CLEARANCE_CONSTRAINT, worstClearanceConstraint ) ) m_largestClearance = worstClearanceConstraint.GetValue().Min(); reportAux( "Worst clearance : %d nm", m_largestClearance ); if( !reportPhase( _( "Checking board edge clearances..." ) ) ) return false; std::vector> edges; // we own these DRC_RTREE edgesTree; std::vector boardItems; // we don't own these auto queryBoardOutlineItems = [&]( BOARD_ITEM *item ) -> bool { PCB_SHAPE* shape = static_cast( item ); if( shape->GetShape() == S_RECT ) { // A single rectangle for the board would make the RTree useless, so // convert to 4 edges edges.emplace_back( static_cast( shape->Clone() ) ); edges.back()->SetShape( S_SEGMENT ); edges.back()->SetEndX( shape->GetStartX() ); edges.back()->SetWidth( 0 ); edges.emplace_back( static_cast( shape->Clone() ) ); edges.back()->SetShape( S_SEGMENT ); edges.back()->SetEndY( shape->GetStartY() ); edges.back()->SetWidth( 0 ); edges.emplace_back( static_cast( shape->Clone() ) ); edges.back()->SetShape( S_SEGMENT ); edges.back()->SetStartX( shape->GetEndX() ); edges.back()->SetWidth( 0 ); edges.emplace_back( static_cast( shape->Clone() ) ); edges.back()->SetShape( S_SEGMENT ); edges.back()->SetStartY( shape->GetEndY() ); edges.back()->SetWidth( 0 ); return true; } else if( shape->GetShape() == S_POLYGON ) { // Same for polygons SHAPE_LINE_CHAIN poly = shape->GetPolyShape().Outline( 0 ); for( size_t ii = 0; ii < poly.GetSegmentCount(); ++ii ) { SEG seg = poly.CSegment( ii ); edges.emplace_back( static_cast( shape->Clone() ) ); edges.back()->SetShape( S_SEGMENT ); edges.back()->SetStart((wxPoint) seg.A ); edges.back()->SetEnd((wxPoint) seg.B ); edges.back()->SetWidth( 0 ); } } edges.emplace_back( static_cast( shape->Clone() ) ); edges.back()->SetWidth( 0 ); return true; }; auto queryBoardGeometryItems = [&]( BOARD_ITEM *item ) -> bool { if( !isInvisibleText( item ) ) boardItems.push_back( item ); return true; }; forEachGeometryItem( { PCB_SHAPE_T, PCB_FP_SHAPE_T }, LSET( 2, Edge_Cuts, Margin ), queryBoardOutlineItems ); forEachGeometryItem( s_allBasicItemsButZones, LSET::AllCuMask(), queryBoardGeometryItems ); for( const std::unique_ptr& edge : edges ) edgesTree.Insert( edge.get(), m_largestClearance ); wxString val; wxGetEnv( "WXTRACE", &val ); drc_dbg( 2, "outline: %d items, board: %d items\n", (int) edges.size(), (int) boardItems.size() ); // This is the number of tests between 2 calls to the progress bar const int delta = 50; int ii = 0; for( BOARD_ITEM* item : boardItems ) { bool testCopper = !m_drcEngine->IsErrorLimitExceeded( DRCE_COPPER_EDGE_CLEARANCE ); bool testSilk = !m_drcEngine->IsErrorLimitExceeded( DRCE_SILK_MASK_CLEARANCE ); if( !testCopper && !testSilk ) break; if( !reportProgress( ii++, boardItems.size(), delta ) ) break; const std::shared_ptr& itemShape = item->GetEffectiveShape(); if( testCopper && item->IsOnCopperLayer() ) { edgesTree.QueryColliding( item, UNDEFINED_LAYER, Edge_Cuts, nullptr, [&]( BOARD_ITEM* edge ) -> bool { return testAgainstEdge( item, itemShape.get(), edge, EDGE_CLEARANCE_CONSTRAINT, DRCE_COPPER_EDGE_CLEARANCE ); }, m_largestClearance ); } if( testSilk && ( item->GetLayer() == F_SilkS || item->GetLayer() == B_SilkS ) ) { edgesTree.QueryColliding( item, UNDEFINED_LAYER, Edge_Cuts, nullptr, [&]( BOARD_ITEM* edge ) -> bool { return testAgainstEdge( item, itemShape.get(), edge, SILK_CLEARANCE_CONSTRAINT, DRCE_SILK_MASK_CLEARANCE ); }, m_largestClearance ); } } reportRuleStatistics(); return true; } int DRC_TEST_PROVIDER_EDGE_CLEARANCE::GetNumPhases() const { return 1; } std::set DRC_TEST_PROVIDER_EDGE_CLEARANCE::GetConstraintTypes() const { return { EDGE_CLEARANCE_CONSTRAINT, SILK_CLEARANCE_CONSTRAINT }; } namespace detail { static DRC_REGISTER_TEST_PROVIDER dummy; }