KiCad PCB EDA Suite
Loading...
Searching...
No Matches
drc_test_provider_annular_width.cpp
Go to the documentation of this file.
1/*
2 * This program source code file is part of KiCad, a free EDA CAD application.
3 *
4 * Copyright The KiCad Developers.
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version 2
9 * of the License, or (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, you may find one here:
18 * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
19 * or you may search the http://www.gnu.org website for the version 2 license,
20 * or you may write to the Free Software Foundation, Inc.,
21 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
22 */
23
24#include <common.h>
25#include <pcb_track.h>
26#include <pad.h>
27#include <footprint.h>
28#include <drc/drc_engine.h>
29#include <drc/drc_item.h>
31#include <macros.h>
34
35/*
36 Via/pad annular ring width test. Checks if there's sufficient copper ring around
37 PTH/NPTH holes (vias/pads)
38 Errors generated:
39 - DRCE_ANNULAR_WIDTH
40
41 Todo:
42 - check pad holes too.
43*/
44
45
47{
48public:
51
53
54 virtual bool Run() override;
55
56 virtual const wxString GetName() const override { return wxT( "annular_width" ); };
57};
58
59
61{
62 if( m_drcEngine->IsErrorLimitExceeded( DRCE_ANNULAR_WIDTH ) )
63 {
64 REPORT_AUX( wxT( "Annular width violations ignored. Skipping check." ) );
65 return true; // continue with other tests
66 }
67
68 const int progressDelta = 500;
69
70 if( !m_drcEngine->HasRulesForConstraintType( ANNULAR_WIDTH_CONSTRAINT ) )
71 {
72 REPORT_AUX( wxT( "No annular width constraints found. Tests not run." ) );
73 return true; // continue with other tests
74 }
75
76 if( !reportPhase( _( "Checking pad & via annular rings..." ) ) )
77 return false; // DRC cancelled
78
79 auto calcEffort =
80 []( BOARD_ITEM* item ) -> size_t
81 {
82 switch( item->Type() )
83 {
84 case PCB_VIA_T:
85 return 1;
86
87 case PCB_PAD_T:
88 {
89 PAD* pad = static_cast<PAD*>( item );
90
91 if( !pad->HasHole() || pad->GetAttribute() != PAD_ATTRIB::PTH )
92 return 0;
93
94 size_t effort = 0;
95
96 pad->Padstack().ForEachUniqueLayer(
97 [&pad, &effort]( PCB_LAYER_ID aLayer )
98 {
99 if( pad->GetOffset( aLayer ) == VECTOR2I( 0, 0 ) )
100 {
101 switch( pad->GetShape( aLayer ) )
102 {
104 if( pad->GetChamferRectRatio( aLayer ) > 0.30 )
105 break;
106
108
110 case PAD_SHAPE::OVAL:
113 effort += 1;
114 break;
115
116 default:
117 break;
118 }
119 }
120
121 effort += 5;
122 } );
123
124 return effort;
125 }
126
127 default:
128 return 0;
129 }
130 };
131
132 auto getPadAnnulusPts =
133 []( PAD* pad, PCB_LAYER_ID aLayer, DRC_CONSTRAINT& constraint,
134 const std::vector<const PAD*>& sameNumPads, VECTOR2I* ptA, VECTOR2I* ptB )
135 {
136 bool handled = false;
137
138 if( pad->GetOffset( aLayer ) == VECTOR2I( 0, 0 ) )
139 {
140 int xDist = KiROUND( ( pad->GetSizeX() - pad->GetDrillSizeX() ) / 2.0 );
141 int yDist = KiROUND( ( pad->GetSizeY() - pad->GetDrillSizeY() ) / 2.0 );
142
143 if( yDist < xDist )
144 {
145 *ptA = pad->GetPosition() - VECTOR2I( 0, pad->GetDrillSizeY() / 2 );
146 *ptB = pad->GetPosition() - VECTOR2I( 0, pad->GetSizeY() / 2 );
147 }
148 else
149 {
150 *ptA = pad->GetPosition() - VECTOR2I( pad->GetDrillSizeX() / 2, 0 );
151 *ptB = pad->GetPosition() - VECTOR2I( pad->GetSizeX() / 2, 0 );
152 }
153
154 RotatePoint( *ptA, pad->GetPosition(), pad->GetOrientation() );
155 RotatePoint( *ptB, pad->GetPosition(), pad->GetOrientation() );
156
157 switch( pad->GetShape( aLayer ) )
158 {
160 handled = pad->GetChamferRectRatio( aLayer ) <= 0.30;
161 break;
162
164 case PAD_SHAPE::OVAL:
167 handled = true;
168
169 break;
170
171 default:
172 break;
173 }
174 }
175
176 std::vector<const PAD*> overlappingSameNumPads;
177
178 for( const PAD* p : sameNumPads )
179 {
180 if( p->IsOnLayer( aLayer )
181 && pad->GetBoundingBox().Intersects( p->GetBoundingBox() ) )
182 {
183 overlappingSameNumPads.push_back( p );
184 }
185 }
186
187 // Same-number pads only add copper. Skip the slow path unless one
188 // fully covers this pad (combined outline is then bigger than this
189 // pad alone) or one's drill cuts into this pad (drill-to-drill copper
190 // becomes the real limit).
191 bool overlapHasConstrainingHole = false;
192 bool overlapCoversThisPad = false;
193
194 for( const PAD* p : overlappingSameNumPads )
195 {
196 if( p->GetBoundingBox().Contains( pad->GetBoundingBox() ) )
197 overlapCoversThisPad = true;
198
199 if( p->HasHole() && pad->GetBoundingBox().Intersects( p->GetEffectiveHoleShape()->BBox() ) )
200 {
201 overlapHasConstrainingHole = true;
202 }
203
204 if( overlapCoversThisPad && overlapHasConstrainingHole )
205 break;
206 }
207
208 if( handled && !overlappingSameNumPads.empty() && !overlapHasConstrainingHole && !overlapCoversThisPad
209 && constraint.Value().HasMin() && !constraint.Value().HasMax() )
210 {
211 // Circle: same annular width all around, so the fast value is exact
212 // whenever any direction is uncovered. Non-circle has a narrow side
213 // an SMD can rescue by itself, so trust the fast value here only
214 // when it already passes.
215 if( pad->GetShape( aLayer ) == PAD_SHAPE::CIRCLE )
216 {
217 return;
218 }
219 else
220 {
221 int width = ( *ptA - *ptB ).EuclideanNorm();
222
223 if( width >= constraint.Value().Min() )
224 return;
225 }
226 }
227
228 if( !handled || !overlappingSameNumPads.empty() )
229 {
230 // Slow (but general purpose) method.
231 SHAPE_POLY_SET padOutline;
232 std::shared_ptr<SHAPE_SEGMENT> slot = pad->GetEffectiveHoleShape();
233
234 pad->TransformShapeToPolygon( padOutline, aLayer, 0, pad->GetMaxError(), ERROR_INSIDE );
235
236 if( sameNumPads.empty() )
237 {
238 if( !padOutline.Collide( pad->GetPosition() ) )
239 {
240 // Hole outside pad
241 *ptA = pad->GetPosition();
242 *ptB = pad->GetPosition();
243 }
244 else
245 {
246 padOutline.NearestPoints( slot.get(), *ptA, *ptB );
247 }
248 }
249 else if( constraint.Value().HasMin() )
250 {
251 SHAPE_POLY_SET aggregatePadOutline = padOutline;
252 SHAPE_POLY_SET otherPadHoles;
253 SHAPE_POLY_SET slotPolygon;
254
255 slot->TransformToPolygon( slotPolygon, 0, ERROR_INSIDE );
256
257 for( const PAD* sameNumPad : sameNumPads )
258 {
259 // Construct the full pad with outline and hole.
260 sameNumPad->TransformShapeToPolygon( aggregatePadOutline, aLayer, 0, pad->GetMaxError(),
262
263 sameNumPad->TransformHoleToPolygon( otherPadHoles, 0, pad->GetMaxError(), ERROR_INSIDE );
264 }
265
266 aggregatePadOutline.BooleanSubtract( otherPadHoles );
267
268 if( !aggregatePadOutline.Collide( pad->GetPosition() ) )
269 {
270 // Hole outside pad
271 *ptA = pad->GetPosition();
272 *ptB = pad->GetPosition();
273 }
274 else
275 {
276 aggregatePadOutline.NearestPoints( slot.get(), *ptA, *ptB );
277 }
278 }
279 }
280 };
281
282 auto checkConstraint =
283 [&]( DRC_CONSTRAINT& constraint, BOARD_ITEM* item, const VECTOR2I& ptA, const VECTOR2I& ptB,
284 PCB_LAYER_ID aLayer )
285 {
286 if( constraint.GetSeverity() == RPT_SEVERITY_IGNORE )
287 return;
288
289 int v_min = 0;
290 int v_max = 0;
291 bool fail_min = false;
292 bool fail_max = false;
293 int width = ( ptA - ptB ).EuclideanNorm();
294
295 if( constraint.Value().HasMin() )
296 {
297 v_min = constraint.Value().Min();
298 fail_min = width < v_min;
299 }
300
301 if( constraint.Value().HasMax() )
302 {
303 v_max = constraint.Value().Max();
304 fail_max = width > v_max;
305 }
306
307 if( fail_min || fail_max )
308 {
309 std::shared_ptr<DRC_ITEM> drcItem = DRC_ITEM::Create( DRCE_ANNULAR_WIDTH );
310
311 if( fail_min )
312 {
313 drcItem->SetErrorDetail( formatMsg( _( "(%s min annular width %s; actual %s)" ),
314 constraint.GetName(),
315 v_min,
316 width ) );
317 }
318
319 if( fail_max )
320 {
321 drcItem->SetErrorDetail( formatMsg( _( "(%s max annular width %s; actual %s)" ),
322 constraint.GetName(),
323 v_max,
324 width ) );
325 }
326
327 drcItem->SetItems( item );
328 drcItem->SetViolatingRule( constraint.GetParentRule() );
329 reportTwoPointGeometry( drcItem, item->GetPosition(), ptA, ptB, aLayer );
330 }
331 };
332
333 auto checkAnnularWidth =
334 [&]( BOARD_ITEM* item ) -> bool
335 {
336 if( m_drcEngine->IsErrorLimitExceeded( DRCE_ANNULAR_WIDTH ) )
337 return false;
338
339 if( item->Type() == PCB_VIA_T )
340 {
341 PCB_VIA* via = static_cast<PCB_VIA*>( item );
342
343 via->Padstack().ForEachUniqueLayer(
344 [&]( PCB_LAYER_ID aLayer )
345 {
346 auto constraint = m_drcEngine->EvalRules( ANNULAR_WIDTH_CONSTRAINT, item,
347 nullptr, aLayer );
348
349 VECTOR2I ptA = via->GetPosition() - VECTOR2I( via->GetDrillValue() / 2, 0 );
350 VECTOR2I ptB = via->GetPosition() - VECTOR2I( via->GetWidth( aLayer ) / 2, 0 );
351 checkConstraint( constraint, via, ptA, ptB, aLayer );
352 } );
353 }
354 else if( item->Type() == PCB_PAD_T )
355 {
356 PAD* pad = static_cast<PAD*>( item );
357
358 if( !pad->HasHole() || pad->GetAttribute() != PAD_ATTRIB::PTH )
359 return true;
360
361 std::vector<const PAD*> sameNumPads;
362
363 if( const FOOTPRINT* fp = static_cast<const FOOTPRINT*>( pad->GetParent() ) )
364 sameNumPads = fp->GetPads( pad->GetNumber(), pad );
365
366 pad->Padstack().ForEachUniqueLayer(
367 [&]( PCB_LAYER_ID aLayer )
368 {
369 auto constraint = m_drcEngine->EvalRules( ANNULAR_WIDTH_CONSTRAINT, item,
370 nullptr, aLayer );
371
372 VECTOR2I ptA;
373 VECTOR2I ptB;
374 getPadAnnulusPts( pad, aLayer, constraint, sameNumPads, &ptA, &ptB );
375 checkConstraint( constraint, pad, ptA, ptB, aLayer );
376 } );
377 }
378
379 return true;
380 };
381
382 BOARD* board = m_drcEngine->GetBoard();
383 size_t ii = 0;
384 size_t total = 0;
385
386 for( PCB_TRACK* item : board->Tracks() )
387 total += calcEffort( item );
388
389 for( FOOTPRINT* footprint : board->Footprints() )
390 {
391 for( PAD* pad : footprint->Pads() )
392 total += calcEffort( pad );
393 }
394
395 for( PCB_TRACK* item : board->Tracks() )
396 {
397 ii += calcEffort( item );
398
399 if( !reportProgress( ii, total, progressDelta ) )
400 return false; // DRC cancelled
401
402 if( !checkAnnularWidth( item ) )
403 break;
404 }
405
406 for( FOOTPRINT* footprint : board->Footprints() )
407 {
408 for( PAD* pad : footprint->Pads() )
409 {
410 ii += calcEffort( pad );
411
412 if( !reportProgress( ii, total, progressDelta ) )
413 return false; // DRC cancelled
414
415 if( !checkAnnularWidth( pad ) )
416 break;
417 }
418 }
419
420 return !m_drcEngine->IsCancelled();
421}
422
423
424namespace detail
425{
427}
@ ERROR_OUTSIDE
@ ERROR_INSIDE
constexpr BOX2I KiROUND(const BOX2D &aBoxD)
Definition box2.h:990
A base class for any item which can be embedded within the BOARD container class, and therefore insta...
Definition board_item.h:84
Information pertinent to a Pcbnew printed circuit board.
Definition board.h:323
const FOOTPRINTS & Footprints() const
Definition board.h:364
const TRACKS & Tracks() const
Definition board.h:362
static std::shared_ptr< DRC_ITEM > Create(int aErrorCode)
Constructs a DRC_ITEM for the given error code.
Definition drc_item.cpp:416
virtual bool Run() override
Run this provider against the given PCB with configured options (if any).
virtual ~DRC_TEST_PROVIDER_ANNULAR_WIDTH()=default
virtual const wxString GetName() const override
virtual bool reportPhase(const wxString &aStageName)
void reportTwoPointGeometry(std::shared_ptr< DRC_ITEM > &aDrcItem, const VECTOR2I &aMarkerPos, const VECTOR2I &ptA, const VECTOR2I &ptB, PCB_LAYER_ID aLayer)
wxString formatMsg(const wxString &aFormatString, const wxString &aSource, double aConstraint, double aActual, EDA_DATA_TYPE aDataType=EDA_DATA_TYPE::DISTANCE)
virtual bool reportProgress(size_t aCount, size_t aSize, size_t aDelta=1)
Definition pad.h:65
Represent a set of closed polygons.
bool Collide(const SHAPE *aShape, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const override
Check if the boundary of shape (this) lies closer to the shape aShape than aClearance,...
void BooleanSubtract(const SHAPE_POLY_SET &b)
Perform boolean polyset difference.
bool NearestPoints(const SHAPE *aOther, VECTOR2I &aPtThis, VECTOR2I &aPtOther) const
Return the two points that mark the closest distance between this shape and aOther.
The common library.
@ DRCE_ANNULAR_WIDTH
Definition drc_item.h:59
@ ANNULAR_WIDTH_CONSTRAINT
Definition drc_rule.h:67
#define REPORT_AUX(s)
#define _(s)
PCB_LAYER_ID
A quick note on layer IDs:
Definition layer_ids.h:60
This file contains miscellaneous commonly used macros and functions.
#define KI_FALLTHROUGH
The KI_FALLTHROUGH macro is to be used when switch statement cases should purposely fallthrough from ...
Definition macros.h:83
static DRC_REGISTER_TEST_PROVIDER< DRC_TEST_PROVIDER_ANNULAR_WIDTH > dummy
@ PTH
Plated through hole pad.
Definition padstack.h:98
@ CHAMFERED_RECT
Definition padstack.h:60
@ ROUNDRECT
Definition padstack.h:57
@ RECTANGLE
Definition padstack.h:54
@ RPT_SEVERITY_IGNORE
void RotatePoint(int *pX, int *pY, const EDA_ANGLE &aAngle)
Calculate the new point of coord coord pX, pY, for a rotation center 0, 0.
Definition trigo.cpp:229
@ PCB_VIA_T
class PCB_VIA, a via (like a track segment on a copper layer)
Definition typeinfo.h:94
@ PCB_PAD_T
class PAD, a pad in a footprint
Definition typeinfo.h:84
VECTOR2< int32_t > VECTOR2I
Definition vector2d.h:687