KiCad PCB EDA Suite
drc_clearance_test_functions.cpp
Go to the documentation of this file.
1 
5 /*
6  * This program source code file is part of KiCad, a free EDA CAD application.
7  *
8  * Copyright (C) 2004-2016 Jean-Pierre Charras, jean-pierre.charras@gipsa-lab.inpg.fr
9  * Copyright (C) 2007 Dick Hollenbeck, dick@softplc.com
10  * Copyright (C) 2016 KiCad Developers, see change_log.txt for contributors.
11  *
12  * This program is free software; you can redistribute it and/or
13  * modify it under the terms of the GNU General Public License
14  * as published by the Free Software Foundation; either version 2
15  * of the License, or (at your option) any later version.
16  *
17  * This program is distributed in the hope that it will be useful,
18  * but WITHOUT ANY WARRANTY; without even the implied warranty of
19  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20  * GNU General Public License for more details.
21  *
22  * You should have received a copy of the GNU General Public License
23  * along with this program; if not, you may find one here:
24  * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
25  * or you may search the http://www.gnu.org website for the version 2 license,
26  * or you may write to the Free Software Foundation, Inc.,
27  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
28  */
29 
34 #include <fctsys.h>
35 #include <wxPcbStruct.h>
36 #include <trigo.h>
37 
38 #include <pcbnew.h>
39 #include <drc_stuff.h>
40 
41 #include <class_board.h>
42 #include <class_module.h>
43 #include <class_track.h>
44 #include <class_zone.h>
45 #include <class_marker_pcb.h>
46 #include <math_for_graphics.h>
49 
50 
51 /* compare 2 convex polygons and return true if distance > aDist
52  * i.e if for each edge of the first polygon distance from each edge of the other polygon
53  * is >= aDist
54  */
55 bool poly2polyDRC( wxPoint* aTref, int aTrefCount,
56  wxPoint* aTcompare, int aTcompareCount, int aDist )
57 {
58  /* Test if one polygon is contained in the other and thus the polygon overlap.
59  * This case is not covered by the following check if one polygone is
60  * completely contained in the other (because edges don't intersect)!
61  */
62  if( TestPointInsidePolygon( aTref, aTrefCount, aTcompare[0] ) )
63  return false;
64 
65  if( TestPointInsidePolygon( aTcompare, aTcompareCount, aTref[0] ) )
66  return false;
67 
68  for( int ii = 0, jj = aTrefCount - 1; ii < aTrefCount; jj = ii, ii++ )
69  { // for all edges in aTref
70  for( int kk = 0, ll = aTcompareCount - 1; kk < aTcompareCount; ll = kk, kk++ )
71  { // for all edges in aTcompare
72  double d;
74  aTref[ii].x, aTref[ii].y, aTref[jj].x, aTref[jj].y,
75  aTcompare[kk].x, aTcompare[kk].y, aTcompare[ll].x, aTcompare[ll].y,
76  NULL, NULL, &d );
77 
78  if( intersect || ( d< aDist ) )
79  return false;
80  }
81  }
82 
83  return true;
84 }
85 
86 /* compare a trapezoids (can be rectangle) and a segment and return true if distance > aDist
87  */
88 bool poly2segmentDRC( wxPoint* aTref, int aTrefCount, wxPoint aSegStart, wxPoint aSegEnd, int aDist )
89 {
90  /* Test if the segment is contained in the polygon.
91  * This case is not covered by the following check if the segment is
92  * completely contained in the polygon (because edges don't intersect)!
93  */
94  if( TestPointInsidePolygon( aTref, aTrefCount, aSegStart ) )
95  return false;
96 
97  for( int ii = 0, jj = aTrefCount-1; ii < aTrefCount; jj = ii, ii++ )
98  { // for all edges in polygon
99  double d;
101  aTref[ii].x, aTref[ii].y, aTref[jj].x, aTref[jj].y,
102  aSegStart.x, aSegStart.y, aSegEnd.x, aSegEnd.y,
103  NULL, NULL, &d );
104 
105  if( intersect || ( d < aDist) )
106  return false;
107  }
108 
109  return true;
110 }
111 
112 /* compare a polygon to a point and return true if distance > aDist
113  * do not use this function for horizontal or vertical rectangles
114  * because there is a faster an easier way to compare the distance
115  */
116 bool convex2pointDRC( wxPoint* aTref, int aTrefCount, wxPoint aPcompare, int aDist )
117 {
118  /* Test if aPcompare point is contained in the polygon.
119  * This case is not covered by the following check if this point is inside the polygon
120  */
121  if( TestPointInsidePolygon( aTref, aTrefCount, aPcompare ) )
122  {
123  return false;
124  }
125 
126  // Test distance between aPcompare and each segment of the polygon:
127  for( int ii = 0, jj = aTrefCount - 1; ii < aTrefCount; jj = ii, ii++ ) // for all edge in polygon
128  {
129  if( TestSegmentHit( aPcompare, aTref[ii], aTref[jj], aDist ) )
130  return false;
131  }
132 
133  return true;
134 }
135 
136 
137 bool DRC::doTrackDrc( TRACK* aRefSeg, TRACK* aStart, bool testPads )
138 {
139  TRACK* track;
140  wxPoint delta; // length on X and Y axis of segments
141  LSET layerMask;
142  int net_code_ref;
143  wxPoint shape_pos;
144 
145  NETCLASSPTR netclass = aRefSeg->GetNetClass();
147 
148  /* In order to make some calculations more easier or faster,
149  * pads and tracks coordinates will be made relative to the reference segment origin
150  */
151  wxPoint origin = aRefSeg->GetStart(); // origin will be the origin of other coordinates
152 
153  m_segmEnd = delta = aRefSeg->GetEnd() - origin;
154  m_segmAngle = 0;
155 
156  layerMask = aRefSeg->GetLayerSet();
157  net_code_ref = aRefSeg->GetNetCode();
158 
159  // Phase 0 : Test vias
160  if( aRefSeg->Type() == PCB_VIA_T )
161  {
162  const VIA *refvia = static_cast<const VIA*>( aRefSeg );
163  // test if the via size is smaller than minimum
164  if( refvia->GetViaType() == VIA_MICROVIA )
165  {
166  if( refvia->GetWidth() < dsnSettings.m_MicroViasMinSize )
167  {
168  m_currentMarker = fillMarker( refvia, NULL,
170  return false;
171  }
172  if( refvia->GetDrillValue() < dsnSettings.m_MicroViasMinDrill )
173  {
174  m_currentMarker = fillMarker( refvia, NULL,
176  return false;
177  }
178  }
179  else
180  {
181  if( refvia->GetWidth() < dsnSettings.m_ViasMinSize )
182  {
183  m_currentMarker = fillMarker( refvia, NULL,
185  return false;
186  }
187  if( refvia->GetDrillValue() < dsnSettings.m_ViasMinDrill )
188  {
189  m_currentMarker = fillMarker( refvia, NULL,
191  return false;
192  }
193  }
194 
195  // test if via's hole is bigger than its diameter
196  // This test is necessary since the via hole size and width can be modified
197  // and a default via hole can be bigger than some vias sizes
198  if( refvia->GetDrillValue() > refvia->GetWidth() )
199  {
200  m_currentMarker = fillMarker( refvia, NULL,
202  return false;
203  }
204 
205  // For microvias: test if they are blind vias and only between 2 layers
206  // because they are used for very small drill size and are drill by laser
207  // and **only one layer** can be drilled
208  if( refvia->GetViaType() == VIA_MICROVIA )
209  {
210  PCB_LAYER_ID layer1, layer2;
211  bool err = true;
212 
213  refvia->LayerPair( &layer1, &layer2 );
214 
215  if( layer1 > layer2 )
216  std::swap( layer1, layer2 );
217 
218  if( layer2 == B_Cu && layer1 == m_pcb->GetDesignSettings().GetCopperLayerCount() - 2 )
219  err = false;
220  else if( layer1 == F_Cu && layer2 == In1_Cu )
221  err = false;
222 
223  if( err )
224  {
225  m_currentMarker = fillMarker( refvia, NULL,
227  return false;
228  }
229  }
230  }
231  else // This is a track segment
232  {
233  if( aRefSeg->GetWidth() < dsnSettings.m_TrackMinWidth )
234  {
235  m_currentMarker = fillMarker( aRefSeg, NULL,
237  return false;
238  }
239  }
240 
241  // for a non horizontal or vertical segment Compute the segment angle
242  // in tenths of degrees and its length
243  if( delta.x || delta.y )
244  {
245  // Compute the segment angle in 0,1 degrees
246  m_segmAngle = ArcTangente( delta.y, delta.x );
247 
248  // Compute the segment length: we build an equivalent rotated segment,
249  // this segment is horizontal, therefore dx = length
250  RotatePoint( &delta, m_segmAngle ); // delta.x = length, delta.y = 0
251  }
252 
253  m_segmLength = delta.x;
254 
255  /******************************************/
256  /* Phase 1 : test DRC track to pads : */
257  /******************************************/
258 
259  /* Use a dummy pad to test DRC tracks versus holes, for pads not on all copper layers
260  * but having a hole
261  * This dummy pad has the size and shape of the hole
262  * to test tracks to pad hole DRC, using checkClearanceSegmToPad test function.
263  * Therefore, this dummy pad is a circle or an oval.
264  * A pad must have a parent because some functions expect a non null parent
265  * to find the parent board, and some other data
266  */
267  MODULE dummymodule( m_pcb ); // Creates a dummy parent
268  D_PAD dummypad( &dummymodule );
269 
270  dummypad.SetLayerSet( LSET::AllCuMask() ); // Ensure the hole is on all layers
271 
272  // Compute the min distance to pads
273  if( testPads )
274  {
275  unsigned pad_count = m_pcb->GetPadCount();
276 
277  auto pads = m_pcb->GetPads();
278 
279  for( unsigned ii = 0; ii<pad_count; ++ii )
280  {
281  D_PAD* pad = pads[ii];
282 
283  /* No problem if pads are on an other layer,
284  * But if a drill hole exists (a pad on a single layer can have a hole!)
285  * we must test the hole
286  */
287  if( !( pad->GetLayerSet() & layerMask ).any() )
288  {
289  /* We must test the pad hole. In order to use the function
290  * checkClearanceSegmToPad(),a pseudo pad is used, with a shape and a
291  * size like the hole
292  */
293  if( pad->GetDrillSize().x == 0 )
294  continue;
295 
296  dummypad.SetSize( pad->GetDrillSize() );
297  dummypad.SetPosition( pad->GetPosition() );
298  dummypad.SetShape( pad->GetDrillShape() == PAD_DRILL_SHAPE_OBLONG ?
300  dummypad.SetOrientation( pad->GetOrientation() );
301 
302  m_padToTestPos = dummypad.GetPosition() - origin;
303 
304  if( !checkClearanceSegmToPad( &dummypad, aRefSeg->GetWidth(),
305  netclass->GetClearance() ) )
306  {
307  m_currentMarker = fillMarker( aRefSeg, pad,
309  return false;
310  }
311 
312  continue;
313  }
314 
315  // The pad must be in a net (i.e pt_pad->GetNet() != 0 )
316  // but no problem if the pad netcode is the current netcode (same net)
317  if( pad->GetNetCode() // the pad must be connected
318  && net_code_ref == pad->GetNetCode() ) // the pad net is the same as current net -> Ok
319  continue;
320 
321  // DRC for the pad
322  shape_pos = pad->ShapePos();
323  m_padToTestPos = shape_pos - origin;
324 
325  if( !checkClearanceSegmToPad( pad, aRefSeg->GetWidth(), aRefSeg->GetClearance( pad ) ) )
326  {
327  m_currentMarker = fillMarker( aRefSeg, pad,
329  return false;
330  }
331  }
332  }
333 
334  /***********************************************/
335  /* Phase 2: test DRC with other track segments */
336  /***********************************************/
337 
338  // At this point the reference segment is the X axis
339 
340  // Test the reference segment with other track segments
341  wxPoint segStartPoint;
342  wxPoint segEndPoint;
343  for( track = aStart; track; track = track->Next() )
344  {
345  // No problem if segments have the same net code:
346  if( net_code_ref == track->GetNetCode() )
347  continue;
348 
349  // No problem if segment are on different layers :
350  if( !( layerMask & track->GetLayerSet() ).any() )
351  continue;
352 
353  // the minimum distance = clearance plus half the reference track
354  // width plus half the other track's width
355  int w_dist = aRefSeg->GetClearance( track );
356  w_dist += (aRefSeg->GetWidth() + track->GetWidth()) / 2;
357 
358  // Due to many double to int conversions during calculations, which
359  // create rounding issues,
360  // the exact clearance margin cannot be really known.
361  // To avoid false bad DRC detection due to these rounding issues,
362  // slightly decrease the w_dist (remove one nanometer is enough !)
363  w_dist -= 1;
364 
365  // If the reference segment is a via, we test it here
366  if( aRefSeg->Type() == PCB_VIA_T )
367  {
368  delta = track->GetEnd() - track->GetStart();
369  segStartPoint = aRefSeg->GetStart() - track->GetStart();
370 
371  if( track->Type() == PCB_VIA_T )
372  {
373  // Test distance between two vias, i.e. two circles, trivial case
374  if( EuclideanNorm( segStartPoint ) < w_dist )
375  {
376  m_currentMarker = fillMarker( aRefSeg, track,
378  return false;
379  }
380  }
381  else // test via to segment
382  {
383  // Compute l'angle du segment a tester;
384  double angle = ArcTangente( delta.y, delta.x );
385 
386  // Compute new coordinates ( the segment become horizontal)
387  RotatePoint( &delta, angle );
388  RotatePoint( &segStartPoint, angle );
389 
390  if( !checkMarginToCircle( segStartPoint, w_dist, delta.x ) )
391  {
392  m_currentMarker = fillMarker( track, aRefSeg,
394  return false;
395  }
396  }
397 
398  continue;
399  }
400 
401  /* We compute segStartPoint, segEndPoint = starting and ending point coordinates for
402  * the segment to test in the new axis : the new X axis is the
403  * reference segment. We must translate and rotate the segment to test
404  */
405  segStartPoint = track->GetStart() - origin;
406  segEndPoint = track->GetEnd() - origin;
407  RotatePoint( &segStartPoint, m_segmAngle );
408  RotatePoint( &segEndPoint, m_segmAngle );
409  if( track->Type() == PCB_VIA_T )
410  {
411  if( checkMarginToCircle( segStartPoint, w_dist, m_segmLength ) )
412  continue;
413 
414  m_currentMarker = fillMarker( aRefSeg, track,
416  return false;
417  }
418 
419  /* We have changed axis:
420  * the reference segment is Horizontal.
421  * 3 cases : the segment to test can be parallel, perpendicular or have an other direction
422  */
423  if( segStartPoint.y == segEndPoint.y ) // parallel segments
424  {
425  if( abs( segStartPoint.y ) >= w_dist )
426  continue;
427 
428  // Ensure segStartPoint.x <= segEndPoint.x
429  if( segStartPoint.x > segEndPoint.x )
430  std::swap( segStartPoint.x, segEndPoint.x );
431 
432  if( segStartPoint.x > (-w_dist) && segStartPoint.x < (m_segmLength + w_dist) ) /* possible error drc */
433  {
434  // the start point is inside the reference range
435  // X........
436  // O--REF--+
437 
438  // Fine test : we consider the rounded shape of each end of the track segment:
439  if( segStartPoint.x >= 0 && segStartPoint.x <= m_segmLength )
440  {
441  m_currentMarker = fillMarker( aRefSeg, track,
443  return false;
444  }
445 
446  if( !checkMarginToCircle( segStartPoint, w_dist, m_segmLength ) )
447  {
448  m_currentMarker = fillMarker( aRefSeg, track,
450  return false;
451  }
452  }
453 
454  if( segEndPoint.x > (-w_dist) && segEndPoint.x < (m_segmLength + w_dist) )
455  {
456  // the end point is inside the reference range
457  // .....X
458  // O--REF--+
459  // Fine test : we consider the rounded shape of the ends
460  if( segEndPoint.x >= 0 && segEndPoint.x <= m_segmLength )
461  {
462  m_currentMarker = fillMarker( aRefSeg, track,
464  return false;
465  }
466 
467  if( !checkMarginToCircle( segEndPoint, w_dist, m_segmLength ) )
468  {
469  m_currentMarker = fillMarker( aRefSeg, track,
471  return false;
472  }
473  }
474 
475  if( segStartPoint.x <=0 && segEndPoint.x >= 0 )
476  {
477  // the segment straddles the reference range (this actually only
478  // checks if it straddles the origin, because the other cases where already
479  // handled)
480  // X.............X
481  // O--REF--+
482  m_currentMarker = fillMarker( aRefSeg, track,
484  return false;
485  }
486  }
487  else if( segStartPoint.x == segEndPoint.x ) // perpendicular segments
488  {
489  if( ( segStartPoint.x <= (-w_dist) ) || ( segStartPoint.x >= (m_segmLength + w_dist) ) )
490  continue;
491 
492  // Test if segments are crossing
493  if( segStartPoint.y > segEndPoint.y )
494  std::swap( segStartPoint.y, segEndPoint.y );
495 
496  if( (segStartPoint.y < 0) && (segEndPoint.y > 0) )
497  {
498  m_currentMarker = fillMarker( aRefSeg, track,
500  return false;
501  }
502 
503  // At this point the drc error is due to an end near a reference segm end
504  if( !checkMarginToCircle( segStartPoint, w_dist, m_segmLength ) )
505  {
506  m_currentMarker = fillMarker( aRefSeg, track,
508  return false;
509  }
510  if( !checkMarginToCircle( segEndPoint, w_dist, m_segmLength ) )
511  {
512  m_currentMarker = fillMarker( aRefSeg, track,
514  return false;
515  }
516  }
517  else // segments quelconques entre eux
518  {
519  // calcul de la "surface de securite du segment de reference
520  // First rought 'and fast) test : the track segment is like a rectangle
521 
522  m_xcliplo = m_ycliplo = -w_dist;
523  m_xcliphi = m_segmLength + w_dist;
524  m_ycliphi = w_dist;
525 
526  // A fine test is needed because a serment is not exactly a
527  // rectangle, it has rounded ends
528  if( !checkLine( segStartPoint, segEndPoint ) )
529  {
530  /* 2eme passe : the track has rounded ends.
531  * we must a fine test for each rounded end and the
532  * rectangular zone
533  */
534 
535  m_xcliplo = 0;
537 
538  if( !checkLine( segStartPoint, segEndPoint ) )
539  {
540  m_currentMarker = fillMarker( aRefSeg, track,
542  return false;
543  }
544  else // The drc error is due to the starting or the ending point of the reference segment
545  {
546  // Test the starting and the ending point
547  segStartPoint = track->GetStart();
548  segEndPoint = track->GetEnd();
549  delta = segEndPoint - segStartPoint;
550 
551  // Compute the segment orientation (angle) en 0,1 degre
552  double angle = ArcTangente( delta.y, delta.x );
553 
554  // Compute the segment length: delta.x = length after rotation
555  RotatePoint( &delta, angle );
556 
557  /* Comute the reference segment coordinates relatives to a
558  * X axis = current tested segment
559  */
560  wxPoint relStartPos = aRefSeg->GetStart() - segStartPoint;
561  wxPoint relEndPos = aRefSeg->GetEnd() - segStartPoint;
562 
563  RotatePoint( &relStartPos, angle );
564  RotatePoint( &relEndPos, angle );
565 
566  if( !checkMarginToCircle( relStartPos, w_dist, delta.x ) )
567  {
568  m_currentMarker = fillMarker( aRefSeg, track,
570  return false;
571  }
572 
573  if( !checkMarginToCircle( relEndPos, w_dist, delta.x ) )
574  {
575  m_currentMarker = fillMarker( aRefSeg, track,
577  return false;
578  }
579  }
580  }
581  }
582  }
583 
584  return true;
585 }
586 
587 
588 /* test DRC between 2 pads.
589  * this function can be also used to test DRC between a pad and a hole,
590  * because a hole is like a round or oval pad.
591  */
592 bool DRC::checkClearancePadToPad( D_PAD* aRefPad, D_PAD* aPad )
593 {
594  int dist;
595  double pad_angle;
596 
597  // Get the clearance between the 2 pads. this is the min distance between aRefPad and aPad
598  int dist_min = aRefPad->GetClearance( aPad );
599 
600  // relativePadPos is the aPad shape position relative to the aRefPad shape position
601  wxPoint relativePadPos = aPad->ShapePos() - aRefPad->ShapePos();
602 
603  dist = KiROUND( EuclideanNorm( relativePadPos ) );
604 
605  // Quick test: Clearance is OK if the bounding circles are further away than "dist_min"
606  if( (dist - aRefPad->GetBoundingRadius() - aPad->GetBoundingRadius()) >= dist_min )
607  return true;
608 
609  /* Here, pads are near and DRC depend on the pad shapes
610  * We must compare distance using a fine shape analysis
611  * Because a circle or oval shape is the easier shape to test, try to have
612  * aRefPad shape type = PAD_SHAPE_CIRCLE or PAD_SHAPE_OVAL.
613  * if aRefPad = TRAP. and aPad = RECT, also swap pads
614  * Swap aRefPad and aPad if needed
615  */
616  bool swap_pads;
617  swap_pads = false;
618 
619  // swap pads to make comparisons easier
620  // Note also a ROUNDRECT pad with a corner radius = r can be considered as
621  // a smaller RECT (size - 2*r) with a clearance increased by r
622  // priority is aRefPad = ROUND then OVAL then RECT/ROUNDRECT then other
623  if( aRefPad->GetShape() != aPad->GetShape() && aRefPad->GetShape() != PAD_SHAPE_CIRCLE )
624  {
625  // pad ref shape is here oval, rect, roundrect, trapezoid or custom
626  switch( aPad->GetShape() )
627  {
628  case PAD_SHAPE_CIRCLE:
629  swap_pads = true;
630  break;
631 
632  case PAD_SHAPE_OVAL:
633  swap_pads = true;
634  break;
635 
636  case PAD_SHAPE_RECT:
637  case PAD_SHAPE_ROUNDRECT:
638  if( aRefPad->GetShape() != PAD_SHAPE_OVAL )
639  swap_pads = true;
640  break;
641 
642  default:
643  break;
644  }
645  }
646 
647  if( swap_pads )
648  {
649  std::swap( aRefPad, aPad );
650  relativePadPos = -relativePadPos;
651  }
652 
653  // corners of aRefPad (used only for rect/roundrect/trap pad)
654  wxPoint polyref[4];
655  // corners of aRefPad (used only for custom pad)
656  SHAPE_POLY_SET polysetref;
657 
658  // corners of aPad (used only for rect/roundrect/trap pad)
659  wxPoint polycompare[4];
660  // corners of aPad (used only custom pad)
661  SHAPE_POLY_SET polysetcompare;
662 
663  /* Because pad exchange, aRefPad shape is PAD_SHAPE_CIRCLE or PAD_SHAPE_OVAL,
664  * if one of the 2 pads was a PAD_SHAPE_CIRCLE or PAD_SHAPE_OVAL.
665  * Therefore, if aRefPad is a PAD_SHAPE_RECT, PAD_SHAPE_ROUNDRECT or a PAD_SHAPE_TRAPEZOID,
666  * aPad is also a PAD_SHAPE_RECT, PAD_SHAPE_ROUNDRECT or a PAD_SHAPE_TRAPEZOID
667  */
668  bool diag = true;
669 
670  switch( aRefPad->GetShape() )
671  {
672  case PAD_SHAPE_CIRCLE:
673 
674  /* One can use checkClearanceSegmToPad to test clearance
675  * aRefPad is like a track segment with a null length and a witdth = GetSize().x
676  */
677  m_segmLength = 0;
678  m_segmAngle = 0;
679 
680  m_segmEnd.x = m_segmEnd.y = 0;
681 
682  m_padToTestPos = relativePadPos;
683  diag = checkClearanceSegmToPad( aPad, aRefPad->GetSize().x, dist_min );
684  break;
685 
686  case PAD_SHAPE_TRAPEZOID:
687  case PAD_SHAPE_ROUNDRECT:
688  case PAD_SHAPE_RECT:
689  // pad_angle = pad orient relative to the aRefPad orient
690  pad_angle = aRefPad->GetOrientation() + aPad->GetOrientation();
691  NORMALIZE_ANGLE_POS( pad_angle );
692 
693  if( aRefPad->GetShape() == PAD_SHAPE_ROUNDRECT )
694  {
695  int padRadius = aRefPad->GetRoundRectCornerRadius();
696  dist_min += padRadius;
697  GetRoundRectCornerCenters( polyref, padRadius, wxPoint( 0, 0 ),
698  aRefPad->GetSize(), aRefPad->GetOrientation() );
699  }
700  else
701  aRefPad->BuildPadPolygon( polyref, wxSize( 0, 0 ), aRefPad->GetOrientation() );
702 
703  switch( aPad->GetShape() )
704  {
705  case PAD_SHAPE_ROUNDRECT:
706  case PAD_SHAPE_RECT:
707  case PAD_SHAPE_TRAPEZOID:
708  if( aPad->GetShape() == PAD_SHAPE_ROUNDRECT )
709  {
710  int padRadius = aPad->GetRoundRectCornerRadius();
711  dist_min += padRadius;
712  GetRoundRectCornerCenters( polycompare, padRadius, relativePadPos,
713  aPad->GetSize(), aPad->GetOrientation() );
714  }
715  else
716  {
717  aPad->BuildPadPolygon( polycompare, wxSize( 0, 0 ), aPad->GetOrientation() );
718 
719  // Move aPad shape to relativePadPos
720  for( int ii = 0; ii < 4; ii++ )
721  polycompare[ii] += relativePadPos;
722  }
723 
724  // And now test polygons:
725  if( polysetref.OutlineCount() )
726  {
727  const SHAPE_LINE_CHAIN& refpoly = polysetref.COutline( 0 );
728  // And now test polygons:
729  if( !poly2polyDRC( (wxPoint*) &refpoly.CPoint( 0 ), refpoly.PointCount(),
730  polycompare, 4, dist_min ) )
731  diag = false;
732  }
733  else if( !poly2polyDRC( polyref, 4, polycompare, 4, dist_min ) )
734  diag = false;
735  break;
736 
737  default:
738  wxLogDebug( wxT( "DRC::checkClearancePadToPad: unexpected pad shape %d" ), aPad->GetShape() );
739  break;
740  }
741  break;
742 
743  case PAD_SHAPE_OVAL: /* an oval pad is like a track segment */
744  {
745  /* Create a track segment with same dimensions as the oval aRefPad
746  * and use checkClearanceSegmToPad function to test aPad to aRefPad clearance
747  */
748  int segm_width;
749  m_segmAngle = aRefPad->GetOrientation(); // Segment orient.
750 
751  if( aRefPad->GetSize().y < aRefPad->GetSize().x ) // Build an horizontal equiv segment
752  {
753  segm_width = aRefPad->GetSize().y;
754  m_segmLength = aRefPad->GetSize().x - aRefPad->GetSize().y;
755  }
756  else // Vertical oval: build an horizontal equiv segment and rotate 90.0 deg
757  {
758  segm_width = aRefPad->GetSize().x;
759  m_segmLength = aRefPad->GetSize().y - aRefPad->GetSize().x;
760  m_segmAngle += 900;
761  }
762 
763  /* the start point must be 0,0 and currently relativePadPos
764  * is relative the center of pad coordinate */
765  wxPoint segstart;
766  segstart.x = -m_segmLength / 2; // Start point coordinate of the horizontal equivalent segment
767 
768  RotatePoint( &segstart, m_segmAngle ); // actual start point coordinate of the equivalent segment
769  // Calculate segment end position relative to the segment origin
770  m_segmEnd.x = -2 * segstart.x;
771  m_segmEnd.y = -2 * segstart.y;
772 
773  // Recalculate the equivalent segment angle in 0,1 degrees
774  // to prepare a call to checkClearanceSegmToPad()
776 
777  // move pad position relative to the segment origin
778  m_padToTestPos = relativePadPos - segstart;
779 
780  // Use segment to pad check to test the second pad:
781  diag = checkClearanceSegmToPad( aPad, segm_width, dist_min );
782  break;
783  }
784 
785  default:
786  wxLogDebug( wxT( "DRC::checkClearancePadToPad: unknown pad shape" ) );
787  break;
788  }
789 
790  return diag;
791 }
792 
793 
794 /* test if distance between a segment is > aMinDist
795  * segment start point is assumed in (0,0) and segment start point in m_segmEnd
796  * and its orientation is m_segmAngle (m_segmAngle must be already initialized)
797  * and have aSegmentWidth.
798  */
799 bool DRC::checkClearanceSegmToPad( const D_PAD* aPad, int aSegmentWidth, int aMinDist )
800 {
801  wxSize padHalfsize; // half dimension of the pad
802  int r;
803 
804  int segmHalfWidth = aSegmentWidth / 2;
805  int distToLine = segmHalfWidth + aMinDist;
806 
807  padHalfsize.x = aPad->GetSize().x >> 1;
808  padHalfsize.y = aPad->GetSize().y >> 1;
809 
810  if( aPad->GetShape() == PAD_SHAPE_TRAPEZOID ) // The size is bigger, due to GetDelta() extra size
811  {
812  padHalfsize.x += std::abs(aPad->GetDelta().y) / 2; // Remember: GetDelta().y is the GetSize().x change
813  padHalfsize.y += std::abs(aPad->GetDelta().x) / 2; // Remember: GetDelta().x is the GetSize().y change
814  }
815 
816  if( aPad->GetShape() == PAD_SHAPE_CIRCLE )
817  {
818  /* Easy case: just test the distance between segment and pad centre
819  * calculate pad coordinates in the X,Y axis with X axis = segment to test
820  */
822  return checkMarginToCircle( m_padToTestPos, distToLine + padHalfsize.x, m_segmLength );
823  }
824 
825  /* calculate the bounding box of the pad, including the clearance and the segment width
826  * if the line from 0 to m_segmEnd does not intersect this bounding box,
827  * the clearance is always OK
828  * But if intersect, a better analysis of the pad shape must be done.
829  */
830  m_xcliplo = m_padToTestPos.x - distToLine - padHalfsize.x;
831  m_ycliplo = m_padToTestPos.y - distToLine - padHalfsize.y;
832  m_xcliphi = m_padToTestPos.x + distToLine + padHalfsize.x;
833  m_ycliphi = m_padToTestPos.y + distToLine + padHalfsize.y;
834 
835  wxPoint startPoint;
836  wxPoint endPoint = m_segmEnd;
837 
838  double orient = aPad->GetOrientation();
839 
840  RotatePoint( &startPoint, m_padToTestPos, -orient );
841  RotatePoint( &endPoint, m_padToTestPos, -orient );
842 
843  if( checkLine( startPoint, endPoint ) )
844  return true;
845 
846  /* segment intersects the bounding box. But there is not always a DRC error.
847  * A fine analysis of the pad shape must be done.
848  */
849  switch( aPad->GetShape() )
850  {
851  default:
852  return false;
853 
854  case PAD_SHAPE_OVAL:
855  {
856  /* an oval is a complex shape, but is a rectangle and 2 circles
857  * these 3 basic shapes are more easy to test.
858  *
859  * In calculations we are using a vertical oval shape
860  * (i.e. a vertical rounded segment)
861  * for horizontal oval shapes, swap x and y size and rotate the shape
862  */
863  if( padHalfsize.x > padHalfsize.y )
864  {
865  std::swap( padHalfsize.x, padHalfsize.y );
866  orient = AddAngles( orient, 900 );
867  }
868 
869  // here, padHalfsize.x is the radius of rounded ends.
870 
871  int deltay = padHalfsize.y - padHalfsize.x;
872  // here: padHalfsize.x = radius,
873  // deltay = dist between the centre pad and the centre of a rounded end
874 
875  // Test the rectangular area between the two circles (the rounded ends)
876  m_xcliplo = m_padToTestPos.x - distToLine - padHalfsize.x;
877  m_ycliplo = m_padToTestPos.y - deltay;
878  m_xcliphi = m_padToTestPos.x + distToLine + padHalfsize.x;
879  m_ycliphi = m_padToTestPos.y + deltay;
880 
881  if( !checkLine( startPoint, endPoint ) )
882  {
883  return false;
884  }
885 
886  // test the first circle
887  startPoint.x = m_padToTestPos.x; // startPoint = centre of the upper circle of the oval shape
888  startPoint.y = m_padToTestPos.y + deltay;
889 
890  // Calculate the actual position of the circle, given the pad orientation:
891  RotatePoint( &startPoint, m_padToTestPos, orient );
892 
893  // Calculate the actual position of the circle in the new X,Y axis:
894  RotatePoint( &startPoint, m_segmAngle );
895 
896  if( !checkMarginToCircle( startPoint, padHalfsize.x + distToLine, m_segmLength ) )
897  {
898  return false;
899  }
900 
901  // test the second circle
902  startPoint.x = m_padToTestPos.x; // startPoint = centre of the lower circle of the oval shape
903  startPoint.y = m_padToTestPos.y - deltay;
904  RotatePoint( &startPoint, m_padToTestPos, orient );
905  RotatePoint( &startPoint, m_segmAngle );
906 
907  if( !checkMarginToCircle( startPoint, padHalfsize.x + distToLine, m_segmLength ) )
908  {
909  return false;
910  }
911  }
912  break;
913 
914  case PAD_SHAPE_ROUNDRECT:
915  // a round rect is a smaller rect, with a clearance augmented by the corners radius
916  r = aPad->GetRoundRectCornerRadius();
917  padHalfsize.x -= r;
918  padHalfsize.y -= r;
919  distToLine += r;
920  // Fall through
921  case PAD_SHAPE_RECT:
922  // the area to test is a rounded rectangle.
923  // this can be done by testing 2 rectangles and 4 circles (the corners)
924 
925  // Testing the first rectangle dimx + distToLine, dimy:
926  m_xcliplo = m_padToTestPos.x - padHalfsize.x - distToLine;
927  m_ycliplo = m_padToTestPos.y - padHalfsize.y;
928  m_xcliphi = m_padToTestPos.x + padHalfsize.x + distToLine;
929  m_ycliphi = m_padToTestPos.y + padHalfsize.y;
930 
931  if( !checkLine( startPoint, endPoint ) )
932  return false;
933 
934  // Testing the second rectangle dimx , dimy + distToLine
935  m_xcliplo = m_padToTestPos.x - padHalfsize.x;
936  m_ycliplo = m_padToTestPos.y - padHalfsize.y - distToLine;
937  m_xcliphi = m_padToTestPos.x + padHalfsize.x;
938  m_ycliphi = m_padToTestPos.y + padHalfsize.y + distToLine;
939 
940  if( !checkLine( startPoint, endPoint ) )
941  return false;
942 
943  // testing the 4 circles which are the clearance area of each corner:
944 
945  // testing the left top corner of the rectangle
946  startPoint.x = m_padToTestPos.x - padHalfsize.x;
947  startPoint.y = m_padToTestPos.y - padHalfsize.y;
948  RotatePoint( &startPoint, m_padToTestPos, orient );
949  RotatePoint( &startPoint, m_segmAngle );
950 
951  if( !checkMarginToCircle( startPoint, distToLine, m_segmLength ) )
952  return false;
953 
954  // testing the right top corner of the rectangle
955  startPoint.x = m_padToTestPos.x + padHalfsize.x;
956  startPoint.y = m_padToTestPos.y - padHalfsize.y;
957  RotatePoint( &startPoint, m_padToTestPos, orient );
958  RotatePoint( &startPoint, m_segmAngle );
959 
960  if( !checkMarginToCircle( startPoint, distToLine, m_segmLength ) )
961  return false;
962 
963  // testing the left bottom corner of the rectangle
964  startPoint.x = m_padToTestPos.x - padHalfsize.x;
965  startPoint.y = m_padToTestPos.y + padHalfsize.y;
966  RotatePoint( &startPoint, m_padToTestPos, orient );
967  RotatePoint( &startPoint, m_segmAngle );
968 
969  if( !checkMarginToCircle( startPoint, distToLine, m_segmLength ) )
970  return false;
971 
972  // testing the right bottom corner of the rectangle
973  startPoint.x = m_padToTestPos.x + padHalfsize.x;
974  startPoint.y = m_padToTestPos.y + padHalfsize.y;
975  RotatePoint( &startPoint, m_padToTestPos, orient );
976  RotatePoint( &startPoint, m_segmAngle );
977 
978  if( !checkMarginToCircle( startPoint, distToLine, m_segmLength ) )
979  return false;
980 
981  break;
982 
983  case PAD_SHAPE_TRAPEZOID:
984  {
985  wxPoint poly[4];
986  aPad->BuildPadPolygon( poly, wxSize( 0, 0 ), orient );
987 
988  // Move shape to m_padToTestPos
989  for( int ii = 0; ii < 4; ii++ )
990  {
991  poly[ii] += m_padToTestPos;
992  RotatePoint( &poly[ii], m_segmAngle );
993  }
994 
995  if( !poly2segmentDRC( poly, 4, wxPoint( 0, 0 ), wxPoint(m_segmLength,0), distToLine ) )
996  return false;
997 
998  break;
999  }
1000  }
1001 
1002  return true;
1003 }
1004 
1005 
1012 bool DRC::checkMarginToCircle( wxPoint aCentre, int aRadius, int aLength )
1013 {
1014  if( abs( aCentre.y ) >= aRadius ) // trivial case
1015  return true;
1016 
1017  // Here, distance between aCentre and X axis is < aRadius
1018  if( (aCentre.x > -aRadius ) && ( aCentre.x < (aLength + aRadius) ) )
1019  {
1020  if( (aCentre.x >= 0) && (aCentre.x <= aLength) )
1021  return false; // aCentre is between the starting point and the ending point of the segm
1022 
1023  if( aCentre.x > aLength ) // aCentre is after the ending point
1024  aCentre.x -= aLength; // move aCentre to the starting point of the segment
1025 
1026  if( EuclideanNorm( aCentre ) < aRadius )
1027  // distance between aCentre and the starting point or the ending point is < aRadius
1028  return false;
1029  }
1030 
1031  return true;
1032 }
1033 
1034 
1035 // Helper function used in checkLine::
1036 static inline int USCALE( unsigned arg, unsigned num, unsigned den )
1037 {
1038  int ii;
1039 
1040  ii = KiROUND( ( (double) arg * num ) / den );
1041  return ii;
1042 }
1043 
1044 
1050 bool DRC::checkLine( wxPoint aSegStart, wxPoint aSegEnd )
1051 {
1052 #define WHEN_OUTSIDE return true
1053 #define WHEN_INSIDE
1054  int temp;
1055 
1056  if( aSegStart.x > aSegEnd.x )
1057  std::swap( aSegStart, aSegEnd );
1058 
1059  if( (aSegEnd.x < m_xcliplo) || (aSegStart.x > m_xcliphi) )
1060  {
1061  WHEN_OUTSIDE;
1062  }
1063 
1064  if( aSegStart.y < aSegEnd.y )
1065  {
1066  if( (aSegEnd.y < m_ycliplo) || (aSegStart.y > m_ycliphi) )
1067  {
1068  WHEN_OUTSIDE;
1069  }
1070 
1071  if( aSegStart.y < m_ycliplo )
1072  {
1073  temp = USCALE( (aSegEnd.x - aSegStart.x), (m_ycliplo - aSegStart.y),
1074  (aSegEnd.y - aSegStart.y) );
1075 
1076  if( (aSegStart.x += temp) > m_xcliphi )
1077  {
1078  WHEN_OUTSIDE;
1079  }
1080 
1081  aSegStart.y = m_ycliplo;
1082  WHEN_INSIDE;
1083  }
1084 
1085  if( aSegEnd.y > m_ycliphi )
1086  {
1087  temp = USCALE( (aSegEnd.x - aSegStart.x), (aSegEnd.y - m_ycliphi),
1088  (aSegEnd.y - aSegStart.y) );
1089 
1090  if( (aSegEnd.x -= temp) < m_xcliplo )
1091  {
1092  WHEN_OUTSIDE;
1093  }
1094 
1095  aSegEnd.y = m_ycliphi;
1096  WHEN_INSIDE;
1097  }
1098 
1099  if( aSegStart.x < m_xcliplo )
1100  {
1101  temp = USCALE( (aSegEnd.y - aSegStart.y), (m_xcliplo - aSegStart.x),
1102  (aSegEnd.x - aSegStart.x) );
1103  aSegStart.y += temp;
1104  aSegStart.x = m_xcliplo;
1105  WHEN_INSIDE;
1106  }
1107 
1108  if( aSegEnd.x > m_xcliphi )
1109  {
1110  temp = USCALE( (aSegEnd.y - aSegStart.y), (aSegEnd.x - m_xcliphi),
1111  (aSegEnd.x - aSegStart.x) );
1112  aSegEnd.y -= temp;
1113  aSegEnd.x = m_xcliphi;
1114  WHEN_INSIDE;
1115  }
1116  }
1117  else
1118  {
1119  if( (aSegStart.y < m_ycliplo) || (aSegEnd.y > m_ycliphi) )
1120  {
1121  WHEN_OUTSIDE;
1122  }
1123 
1124  if( aSegStart.y > m_ycliphi )
1125  {
1126  temp = USCALE( (aSegEnd.x - aSegStart.x), (aSegStart.y - m_ycliphi),
1127  (aSegStart.y - aSegEnd.y) );
1128 
1129  if( (aSegStart.x += temp) > m_xcliphi )
1130  {
1131  WHEN_OUTSIDE;
1132  }
1133 
1134  aSegStart.y = m_ycliphi;
1135  WHEN_INSIDE;
1136  }
1137 
1138  if( aSegEnd.y < m_ycliplo )
1139  {
1140  temp = USCALE( (aSegEnd.x - aSegStart.x), (m_ycliplo - aSegEnd.y),
1141  (aSegStart.y - aSegEnd.y) );
1142 
1143  if( (aSegEnd.x -= temp) < m_xcliplo )
1144  {
1145  WHEN_OUTSIDE;
1146  }
1147 
1148  aSegEnd.y = m_ycliplo;
1149  WHEN_INSIDE;
1150  }
1151 
1152  if( aSegStart.x < m_xcliplo )
1153  {
1154  temp = USCALE( (aSegStart.y - aSegEnd.y), (m_xcliplo - aSegStart.x),
1155  (aSegEnd.x - aSegStart.x) );
1156  aSegStart.y -= temp;
1157  aSegStart.x = m_xcliplo;
1158  WHEN_INSIDE;
1159  }
1160 
1161  if( aSegEnd.x > m_xcliphi )
1162  {
1163  temp = USCALE( (aSegStart.y - aSegEnd.y), (aSegEnd.x - m_xcliphi),
1164  (aSegEnd.x - aSegStart.x) );
1165  aSegEnd.y += temp;
1166  aSegEnd.x = m_xcliphi;
1167  WHEN_INSIDE;
1168  }
1169  }
1170 
1171  if( ( (aSegEnd.x + aSegStart.x) / 2 <= m_xcliphi )
1172  && ( (aSegEnd.x + aSegStart.x) / 2 >= m_xcliplo ) \
1173  && ( (aSegEnd.y + aSegStart.y) / 2 <= m_ycliphi )
1174  && ( (aSegEnd.y + aSegStart.y) / 2 >= m_ycliplo ) )
1175  {
1176  return false;
1177  }
1178  else
1179  {
1180  return true;
1181  }
1182 }
double EuclideanNorm(const wxPoint &vector)
Euclidean norm of a 2D vector.
Definition: trigo.h:104
static LSET AllCuMask(int aCuLayerCount=MAX_CU_LAYERS)
Function AllCuMask returns a mask holding the requested number of Cu PCB_LAYER_IDs.
Definition: lset.cpp:639
KICAD_T Type() const
Function Type()
Definition: base_struct.h:198
#define DRCE_TRACK_SEGMENTS_TOO_CLOSE
2 parallel track segments too close: segm ends between segref ends
Definition: drc_stuff.h:51
static int USCALE(unsigned arg, unsigned num, unsigned den)
#define WHEN_OUTSIDE
static int KiROUND(double v)
KiROUND rounds a floating point number to an int using "round halfway cases away from zero"...
Definition: common.h:107
MARKER_PCB * fillMarker(const TRACK *aTrack, BOARD_ITEM *aItem, int aErrorCode, MARKER_PCB *fillMe)
Function fillMarker optionally creates a marker and fills it in with information, but does not add it...
int m_ycliplo
Definition: drc_stuff.h:200
#define DRCE_ENDS_PROBLEM1
track ends are too close
Definition: drc_stuff.h:53
#define DRCE_TRACK_ENDS1
2 parallel track segments too close: fine start point test
Definition: drc_stuff.h:47
void BuildPadPolygon(wxPoint aCoord[4], wxSize aInflateValue, double aRotation) const
Function BuildPadPolygon Has meaning only for polygonal pads (trapezoid and rectangular) Build the Co...
int PointCount() const
Function PointCount()
bool TestForIntersectionOfStraightLineSegments(int x1i, int y1i, int x1f, int y1f, int x2i, int y2i, int x2f, int y2f, int *x, int *y, double *d)
Function TestForIntersectionOfStraightLineSegments Test for intersection of line segments If lines ar...
#define DRCE_TOO_SMALL_MICROVIA_DRILL
Too small micro via drill.
Definition: drc_stuff.h:70
#define DRCE_TRACK_NEAR_VIA
track too close to via
Definition: drc_stuff.h:44
Class BOARD to handle a board.
int GetRoundRectCornerRadius() const
Function GetRoundRectCornerRadius Has meaning only for rounded rect pads.
Definition: class_pad.h:351
int m_ycliphi
Definition: drc_stuff.h:202
static const int dist[10][10]
Definition: dist.cpp:57
bool poly2segmentDRC(wxPoint *aTref, int aTrefCount, wxPoint aSegStart, wxPoint aSegEnd, int aDist)
int m_segmLength
Definition: drc_stuff.h:194
void SetPosition(const wxPoint &aPos) override
Definition: class_pad.h:169
Classes to handle copper zones.
PAD_DRILL_SHAPE_T GetDrillShape() const
Definition: class_pad.h:221
void RotatePoint(int *pX, int *pY, double angle)
Definition: trigo.cpp:317
int OutlineCount() const
Returns the number of outlines in the set
void NORMALIZE_ANGLE_POS(T &Angle)
Definition: trigo.h:222
const wxSize & GetDrillSize() const
Definition: class_pad.h:188
#define DRCE_TRACKS_CROSSING
tracks are crossing
Definition: drc_stuff.h:52
wxPoint m_padToTestPos
Definition: drc_stuff.h:185
PAD_SHAPE_T GetShape() const
Function GetShape.
Definition: class_pad.h:166
#define DRCE_ENDS_PROBLEM2
track ends are too close
Definition: drc_stuff.h:54
#define abs(a)
Definition: auxiliary.h:84
#define DRCE_TOO_SMALL_MICROVIA
Too small micro via size.
Definition: drc_stuff.h:68
static const int delta[8][2]
Definition: solve.cpp:112
const wxPoint & GetEnd() const
Definition: class_track.h:118
Functions relatives to tracks, vias and segments used to fill zones.
BOARD * m_pcb
Definition: drc_stuff.h:205
bool checkLine(wxPoint aSegStart, wxPoint aSegEnd)
Function checkLine (helper function used in drc calculations to see if one track is in contact with a...
#define DRCE_ENDS_PROBLEM5
track ends are too close
Definition: drc_stuff.h:57
Markers used to show a drc problem on boards.
PCB_LAYER_ID
A quick note on layer IDs:
Class LSET is a set of PCB_LAYER_IDs.
int GetCopperLayerCount() const
Function GetCopperLayerCount.
bool TestPointInsidePolygon(const CPOLYGONS_LIST &aPolysList, int aIdxstart, int aIdxend, int aRefx, int aRefy)
Function TestPointInsidePolygon test if a point is inside or outside a polygon.
VIATYPE_T GetViaType() const
Definition: class_track.h:439
double ArcTangente(int dy, int dx)
Definition: trigo.cpp:271
#define DRCE_VIA_NEAR_TRACK
via too close to track
Definition: drc_stuff.h:46
std::shared_ptr< NETCLASS > GetNetClass() const
Function GetNetClass returns the NETCLASS for this item.
T AddAngles(T a1, T2 a2)
Add two angles (keeping the result normalized). T2 is here.
Definition: trigo.h:246
int GetBoundingRadius() const
Function GetBoundingRadius returns the radius of a minimum sized circle which fully encloses this pad...
Definition: class_pad.h:428
Class SHAPE_POLY_SET.
const wxPoint & GetStart() const
Definition: class_track.h:121
const wxPoint & GetPosition() const override
Definition: class_pad.h:170
int m_TrackMinWidth
track min value for width ((min copper size value
int m_ViasMinSize
vias (not micro vias) min diameter
LSET GetLayerSet() const override
Function GetLayerSet returns a "layer mask", which is a bitmap of all layers on which the TRACK segme...
Definition: class_pad.h:235
bool convex2pointDRC(wxPoint *aTref, int aTrefCount, wxPoint aPcompare, int aDist)
int m_ViasMinDrill
vias (not micro vias) min drill diameter
virtual LSET GetLayerSet() const
Function GetLayerSet returns a "layer mask", which is a bitmap of all layers on which the TRACK segme...
const wxSize & GetSize() const
Definition: class_pad.h:182
BOARD_DESIGN_SETTINGS & GetDesignSettings() const
Function GetDesignSettings.
Definition: class_board.h:532
void SetSize(const wxSize &aSize)
Definition: class_pad.h:181
static bool checkMarginToCircle(wxPoint aCentre, int aRadius, int aLength)
Helper function checkMarginToCircle Check the distance from a point to a segment. ...
#define DRCE_TRACK_NEAR_PAD
pad too close to track
Definition: drc_stuff.h:43
const SHAPE_LINE_CHAIN & COutline(int aIndex) const
static bool intersect(const SEGMENT_WITH_NORMALS &aSeg, const SFVEC2F &aStart, const SFVEC2F &aEnd)
Definition: cpolygon2d.cpp:293
virtual int GetClearance(BOARD_CONNECTED_ITEM *aItem=NULL) const override
Function GetClearance returns the clearance in internal units.
int m_xcliphi
Definition: drc_stuff.h:201
int m_MicroViasMinSize
micro vias (not vias) min diameter
unsigned GetPadCount() const
Function GetPadCount.
void LayerPair(PCB_LAYER_ID *top_layer, PCB_LAYER_ID *bottom_layer) const
Function LayerPair Return the 2 layers used by the via (the via actually uses all layers between thes...
bool checkClearancePadToPad(D_PAD *aRefPad, D_PAD *aPad)
Function checkClearancePadToPad.
int GetNetCode() const
Function GetNetCode.
MARKER_PCB * m_currentMarker
Definition: drc_stuff.h:176
#define DRCE_TOO_SMALL_TRACK_WIDTH
Too small track width.
Definition: drc_stuff.h:66
#define WHEN_INSIDE
bool checkClearanceSegmToPad(const D_PAD *aPad, int aSegmentWidth, int aMinDist)
Function checkClearanceSegmToPad check the distance from a pad to segment.
const std::vector< D_PAD * > GetPads()
Function GetPads returns a reference to a list of all the pads.
wxPoint m_segmEnd
Definition: drc_stuff.h:186
void SetLayerSet(LSET aLayerMask)
Definition: class_pad.h:234
TRACK * Next() const
Definition: class_track.h:98
int GetDrillValue() const
Function GetDrillValue "calculates" the drill value for vias (m-Drill if > 0, or default drill value ...
Class SHAPE_LINE_CHAIN.
int GetWidth() const
Definition: class_track.h:115
static DIRECTION_45::AngleType angle(const VECTOR2I &a, const VECTOR2I &b)
#define DRCE_ENDS_PROBLEM3
track ends are too close
Definition: drc_stuff.h:55
#define DRCE_TRACK_ENDS4
2 parallel track segments too close: fine end point test
Definition: drc_stuff.h:50
double GetOrientation() const
Function GetOrientation returns the rotation angle of the pad in tenths of degrees, but soon degrees.
Definition: class_pad.h:214
const wxSize & GetDelta() const
Definition: class_pad.h:185
bool poly2polyDRC(wxPoint *aTref, int aTrefCount, wxPoint *aTcompare, int aTcompareCount, int aDist)
DRC control: these functions make a DRC between pads, tracks and pads versus tracks.
void GetRoundRectCornerCenters(wxPoint aCenters[4], int aRadius, const wxPoint &aPosition, const wxSize &aSize, double aRotation)
Helper function GetRoundRectCornerCenters Has meaning only for rounded rect Returns the centers of th...
#define DRCE_VIA_NEAR_VIA
via too close to via
Definition: drc_stuff.h:45
int GetClearance(BOARD_CONNECTED_ITEM *aItem=NULL) const override
Function GetClearance returns the clearance in internal units.
Definition: class_pad.cpp:506
void SetShape(PAD_SHAPE_T aShape)
Definition: class_pad.h:167
wxPoint ShapePos() const
Definition: class_pad.cpp:418
void SetOrientation(double aAngle)
Function SetOrientation sets the rotation angle of the pad.
Definition: class_pad.cpp:357
class VIA, a via (like a track segment on a copper layer)
Definition: typeinfo.h:108
bool doTrackDrc(TRACK *aRefSeg, TRACK *aStart, bool doPads=true)
Function DoTrackDrc tests the current segment.
Module description (excepted pads)
int m_MicroViasMinDrill
micro vias (not vias) min drill diameter
bool TestSegmentHit(const wxPoint &aRefPoint, wxPoint aStart, wxPoint aEnd, int aDist)
Function TestSegmentHit test for hit on line segment i.e.
Definition: trigo.cpp:142
#define DRCE_TRACK_ENDS2
2 parallel track segments too close: fine start point test
Definition: drc_stuff.h:48
#define DRCE_TRACK_ENDS3
2 parallel track segments too close: fine end point test
Definition: drc_stuff.h:49
#define DRCE_ENDS_PROBLEM4
track ends are too close
Definition: drc_stuff.h:56
const VECTOR2I & CPoint(int aIndex) const
Function CPoint()
int m_xcliplo
Definition: drc_stuff.h:199
#define DRCE_MICRO_VIA_INCORRECT_LAYER_PAIR
micro via's layer pair incorrect (layers must be adjacent)
Definition: drc_stuff.h:60
double m_segmAngle
Definition: drc_stuff.h:193
#define DRCE_TRACK_NEAR_THROUGH_HOLE
thru hole is too close to track
Definition: drc_stuff.h:42
#define DRCE_VIA_HOLE_BIGGER
via's hole is bigger than its diameter
Definition: drc_stuff.h:59
Class BOARD_DESIGN_SETTINGS contains design settings for a BOARD object.
#define DRCE_TOO_SMALL_VIA_DRILL
Too small via drill.
Definition: drc_stuff.h:69
#define DRCE_TOO_SMALL_VIA
Too small via size.
Definition: drc_stuff.h:67