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-2017 Jean-Pierre Charras, jp.charras at wanadoo.fr
9  * Copyright (C) 2007 Dick Hollenbeck, dick@softplc.com
10  * Copyright (C) 2017 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  int delta = dist - aRefPad->GetBoundingRadius() - aPad->GetBoundingRadius();
607 
608  if( delta >= dist_min )
609  return true;
610 
611  /* Here, pads are near and DRC depend on the pad shapes
612  * We must compare distance using a fine shape analysis
613  * Because a circle or oval shape is the easier shape to test, try to have
614  * aRefPad shape type = PAD_SHAPE_CIRCLE or PAD_SHAPE_OVAL.
615  * if aRefPad = TRAP. and aPad = RECT, also swap pads
616  * Swap aRefPad and aPad if needed
617  */
618  bool swap_pads;
619  swap_pads = false;
620 
621  // swap pads to make comparisons easier
622  // Note also a ROUNDRECT pad with a corner radius = r can be considered as
623  // a smaller RECT (size - 2*r) with a clearance increased by r
624  // priority is aRefPad = ROUND then OVAL then RECT/ROUNDRECT then other
625  if( aRefPad->GetShape() != aPad->GetShape() && aRefPad->GetShape() != PAD_SHAPE_CIRCLE )
626  {
627  // pad ref shape is here oval, rect, roundrect, trapezoid or custom
628  switch( aPad->GetShape() )
629  {
630  case PAD_SHAPE_CIRCLE:
631  swap_pads = true;
632  break;
633 
634  case PAD_SHAPE_OVAL:
635  swap_pads = true;
636  break;
637 
638  case PAD_SHAPE_RECT:
639  case PAD_SHAPE_ROUNDRECT:
640  if( aRefPad->GetShape() != PAD_SHAPE_OVAL )
641  swap_pads = true;
642  break;
643 
644  case PAD_SHAPE_TRAPEZOID:
645  case PAD_SHAPE_CUSTOM:
646  break;
647  }
648  }
649 
650  if( swap_pads )
651  {
652  std::swap( aRefPad, aPad );
653  relativePadPos = -relativePadPos;
654  }
655 
656  // corners of aRefPad (used only for rect/roundrect/trap pad)
657  wxPoint polyref[4];
658  // corners of aRefPad (used only for custom pad)
659  SHAPE_POLY_SET polysetref;
660 
661  // corners of aPad (used only for rect/roundrect/trap pad)
662  wxPoint polycompare[4];
663  // corners of aPad (used only custom pad)
664  SHAPE_POLY_SET polysetcompare;
665 
666  /* Because pad exchange, aRefPad shape is PAD_SHAPE_CIRCLE or PAD_SHAPE_OVAL,
667  * if one of the 2 pads was a PAD_SHAPE_CIRCLE or PAD_SHAPE_OVAL.
668  * Therefore, if aRefPad is a PAD_SHAPE_RECT, PAD_SHAPE_ROUNDRECT or a PAD_SHAPE_TRAPEZOID,
669  * aPad is also a PAD_SHAPE_RECT, PAD_SHAPE_ROUNDRECT or a PAD_SHAPE_TRAPEZOID
670  */
671  bool diag = true;
672 
673  switch( aRefPad->GetShape() )
674  {
675  case PAD_SHAPE_CIRCLE:
676 
677  /* One can use checkClearanceSegmToPad to test clearance
678  * aRefPad is like a track segment with a null length and a witdth = GetSize().x
679  */
680  m_segmLength = 0;
681  m_segmAngle = 0;
682 
683  m_segmEnd.x = m_segmEnd.y = 0;
684 
685  m_padToTestPos = relativePadPos;
686  diag = checkClearanceSegmToPad( aPad, aRefPad->GetSize().x, dist_min );
687  break;
688 
689  case PAD_SHAPE_TRAPEZOID:
690  case PAD_SHAPE_ROUNDRECT:
691  case PAD_SHAPE_RECT:
692  case PAD_SHAPE_CUSTOM:
693  // pad_angle = pad orient relative to the aRefPad orient
694  pad_angle = aRefPad->GetOrientation() + aPad->GetOrientation();
695  NORMALIZE_ANGLE_POS( pad_angle );
696 
697  if( aRefPad->GetShape() == PAD_SHAPE_ROUNDRECT )
698  {
699  int padRadius = aRefPad->GetRoundRectCornerRadius();
700  dist_min += padRadius;
701  GetRoundRectCornerCenters( polyref, padRadius, wxPoint( 0, 0 ),
702  aRefPad->GetSize(), aRefPad->GetOrientation() );
703  }
704  else if( aRefPad->GetShape() == PAD_SHAPE_CUSTOM )
705  {
706  polysetref.Append( aRefPad->GetCustomShapeAsPolygon() );
707 
708  // The reference pad can be rotated. calculate the rotated
709  // coordiantes ( note, the ref pad position is the origin of
710  // coordinates for this drc test)
711  aRefPad->CustomShapeAsPolygonToBoardPosition( &polysetref,
712  wxPoint( 0, 0 ), aRefPad->GetOrientation() );
713  }
714  else
715  {
716  // BuildPadPolygon has meaning for rect a trapeziod shapes
717  // and returns the 4 corners
718  aRefPad->BuildPadPolygon( polyref, wxSize( 0, 0 ), aRefPad->GetOrientation() );
719  }
720 
721  switch( aPad->GetShape() )
722  {
723  case PAD_SHAPE_ROUNDRECT:
724  case PAD_SHAPE_RECT:
725  case PAD_SHAPE_TRAPEZOID:
726  case PAD_SHAPE_CUSTOM:
727  if( aPad->GetShape() == PAD_SHAPE_ROUNDRECT )
728  {
729  int padRadius = aPad->GetRoundRectCornerRadius();
730  dist_min += padRadius;
731  GetRoundRectCornerCenters( polycompare, padRadius, relativePadPos,
732  aPad->GetSize(), aPad->GetOrientation() );
733  }
734  else if( aPad->GetShape() == PAD_SHAPE_CUSTOM )
735  {
736  polysetcompare.Append( aPad->GetCustomShapeAsPolygon() );
737 
738  // The pad to compare can be rotated. calculate the rotated
739  // coordinattes ( note, the pad to compare position
740  // is the relativePadPos for this drc test
741  aPad->CustomShapeAsPolygonToBoardPosition( &polysetcompare,
742  relativePadPos, aPad->GetOrientation() );
743  }
744  else
745  {
746  aPad->BuildPadPolygon( polycompare, wxSize( 0, 0 ), aPad->GetOrientation() );
747 
748  // Move aPad shape to relativePadPos
749  for( int ii = 0; ii < 4; ii++ )
750  polycompare[ii] += relativePadPos;
751  }
752  // And now test polygons: We have 3 cases:
753  // one poly is complex and the other is basic (has only 4 corners)
754  // both polys are complex
755  // both polys are basic (have only 4 corners) the most usual case
756  if( polysetref.OutlineCount() && polysetcompare.OutlineCount() == 0)
757  {
758  const SHAPE_LINE_CHAIN& refpoly = polysetref.COutline( 0 );
759  // And now test polygons:
760  if( !poly2polyDRC( (wxPoint*) &refpoly.CPoint( 0 ), refpoly.PointCount(),
761  polycompare, 4, dist_min ) )
762  diag = false;
763  }
764  else if( polysetref.OutlineCount() == 0 && polysetcompare.OutlineCount())
765  {
766  const SHAPE_LINE_CHAIN& cmppoly = polysetcompare.COutline( 0 );
767  // And now test polygons:
768  if( !poly2polyDRC( (wxPoint*) &cmppoly.CPoint( 0 ), cmppoly.PointCount(),
769  polyref, 4, dist_min ) )
770  diag = false;
771  }
772  else if( polysetref.OutlineCount() && polysetcompare.OutlineCount() )
773  {
774  const SHAPE_LINE_CHAIN& refpoly = polysetref.COutline( 0 );
775  const SHAPE_LINE_CHAIN& cmppoly = polysetcompare.COutline( 0 );
776 
777  // And now test polygons:
778  if( !poly2polyDRC( (wxPoint*) &refpoly.CPoint( 0 ), refpoly.PointCount(),
779  (wxPoint*) &cmppoly.CPoint( 0 ), cmppoly.PointCount(), dist_min ) )
780  diag = false;
781  }
782  else if( !poly2polyDRC( polyref, 4, polycompare, 4, dist_min ) )
783  diag = false;
784  break;
785 
786  default:
787  wxLogDebug( wxT( "DRC::checkClearancePadToPad: unexpected pad shape %d" ), aPad->GetShape() );
788  break;
789  }
790  break;
791 
792  case PAD_SHAPE_OVAL: /* an oval pad is like a track segment */
793  {
794  /* Create a track segment with same dimensions as the oval aRefPad
795  * and use checkClearanceSegmToPad function to test aPad to aRefPad clearance
796  */
797  int segm_width;
798  m_segmAngle = aRefPad->GetOrientation(); // Segment orient.
799 
800  if( aRefPad->GetSize().y < aRefPad->GetSize().x ) // Build an horizontal equiv segment
801  {
802  segm_width = aRefPad->GetSize().y;
803  m_segmLength = aRefPad->GetSize().x - aRefPad->GetSize().y;
804  }
805  else // Vertical oval: build an horizontal equiv segment and rotate 90.0 deg
806  {
807  segm_width = aRefPad->GetSize().x;
808  m_segmLength = aRefPad->GetSize().y - aRefPad->GetSize().x;
809  m_segmAngle += 900;
810  }
811 
812  /* the start point must be 0,0 and currently relativePadPos
813  * is relative the center of pad coordinate */
814  wxPoint segstart;
815  segstart.x = -m_segmLength / 2; // Start point coordinate of the horizontal equivalent segment
816 
817  RotatePoint( &segstart, m_segmAngle ); // actual start point coordinate of the equivalent segment
818  // Calculate segment end position relative to the segment origin
819  m_segmEnd.x = -2 * segstart.x;
820  m_segmEnd.y = -2 * segstart.y;
821 
822  // Recalculate the equivalent segment angle in 0,1 degrees
823  // to prepare a call to checkClearanceSegmToPad()
825 
826  // move pad position relative to the segment origin
827  m_padToTestPos = relativePadPos - segstart;
828 
829  // Use segment to pad check to test the second pad:
830  diag = checkClearanceSegmToPad( aPad, segm_width, dist_min );
831  break;
832  }
833 
834  default:
835  wxMessageBox( wxT( "DRC::checkClearancePadToPad: unknown pad shape" ) );
836  break;
837  }
838 
839  return diag;
840 }
841 
842 
843 /* test if distance between a segment is > aMinDist
844  * segment start point is assumed in (0,0) and segment start point in m_segmEnd
845  * and its orientation is m_segmAngle (m_segmAngle must be already initialized)
846  * and have aSegmentWidth.
847  */
848 bool DRC::checkClearanceSegmToPad( const D_PAD* aPad, int aSegmentWidth, int aMinDist )
849 {
850  // Note:
851  // we are using a horizontal segment for test, because we know here
852  // only the length and orientation+ of the segment
853  // Therefore the coordinates of the shape of pad to compare
854  // must be calculated in a axis system rotated by m_segmAngle
855  // and centered to the segment origin, before they can be tested
856  // against the segment
857  // We are using:
858  // m_padToTestPos the position of the pad shape in this axis system
859  // m_segmAngle the axis system rotation
860 
861  int segmHalfWidth = aSegmentWidth / 2;
862  int distToLine = segmHalfWidth + aMinDist;
863 
864  wxSize padHalfsize; // half dimension of the pad
865 
866  if( aPad->GetShape() == PAD_SHAPE_CUSTOM )
867  {
868  // For a custom pad, the pad size has no meaning, we only can
869  // use the bounding radius
870  padHalfsize.x = padHalfsize.y = aPad->GetBoundingRadius();
871  }
872  else
873  {
874  padHalfsize.x = aPad->GetSize().x >> 1;
875  padHalfsize.y = aPad->GetSize().y >> 1;
876  }
877 
878  if( aPad->GetShape() == PAD_SHAPE_TRAPEZOID ) // The size is bigger, due to GetDelta() extra size
879  {
880  padHalfsize.x += std::abs(aPad->GetDelta().y) / 2; // Remember: GetDelta().y is the GetSize().x change
881  padHalfsize.y += std::abs(aPad->GetDelta().x) / 2; // Remember: GetDelta().x is the GetSize().y change
882  }
883 
884  if( aPad->GetShape() == PAD_SHAPE_CIRCLE )
885  {
886  /* Easy case: just test the distance between segment and pad centre
887  * calculate pad coordinates in the X,Y axis with X axis = segment to test
888  */
890  return checkMarginToCircle( m_padToTestPos, distToLine + padHalfsize.x, m_segmLength );
891  }
892 
893  /* calculate the bounding box of the pad, including the clearance and the segment width
894  * if the line from 0 to m_segmEnd does not intersect this bounding box,
895  * the clearance is always OK
896  * But if intersect, a better analysis of the pad shape must be done.
897  */
898  m_xcliplo = m_padToTestPos.x - distToLine - padHalfsize.x;
899  m_ycliplo = m_padToTestPos.y - distToLine - padHalfsize.y;
900  m_xcliphi = m_padToTestPos.x + distToLine + padHalfsize.x;
901  m_ycliphi = m_padToTestPos.y + distToLine + padHalfsize.y;
902 
903  wxPoint startPoint;
904  wxPoint endPoint = m_segmEnd;
905 
906  double orient = aPad->GetOrientation();
907 
908  RotatePoint( &startPoint, m_padToTestPos, -orient );
909  RotatePoint( &endPoint, m_padToTestPos, -orient );
910 
911  if( checkLine( startPoint, endPoint ) )
912  return true;
913 
914  /* segment intersects the bounding box. But there is not always a DRC error.
915  * A fine analysis of the pad shape must be done.
916  */
917  switch( aPad->GetShape() )
918  {
919  case PAD_SHAPE_CIRCLE:
920  // This case was already tested, so it cannot be found here.
921  // it is here just to avoid compil warning, and to remember
922  // it is already tested.
923  return false;
924 
925  case PAD_SHAPE_OVAL:
926  {
927  /* an oval is a complex shape, but is a rectangle and 2 circles
928  * these 3 basic shapes are more easy to test.
929  *
930  * In calculations we are using a vertical oval shape
931  * (i.e. a vertical rounded segment)
932  * for horizontal oval shapes, swap x and y size and rotate the shape
933  */
934  if( padHalfsize.x > padHalfsize.y )
935  {
936  std::swap( padHalfsize.x, padHalfsize.y );
937  orient = AddAngles( orient, 900 );
938  }
939 
940  // here, padHalfsize.x is the radius of rounded ends.
941 
942  int deltay = padHalfsize.y - padHalfsize.x;
943  // here: padHalfsize.x = radius,
944  // deltay = dist between the centre pad and the centre of a rounded end
945 
946  // Test the rectangular area between the two circles (the rounded ends)
947  m_xcliplo = m_padToTestPos.x - distToLine - padHalfsize.x;
948  m_ycliplo = m_padToTestPos.y - deltay;
949  m_xcliphi = m_padToTestPos.x + distToLine + padHalfsize.x;
950  m_ycliphi = m_padToTestPos.y + deltay;
951 
952  if( !checkLine( startPoint, endPoint ) )
953  {
954  return false;
955  }
956 
957  // test the first circle
958  startPoint.x = m_padToTestPos.x; // startPoint = centre of the upper circle of the oval shape
959  startPoint.y = m_padToTestPos.y + deltay;
960 
961  // Calculate the actual position of the circle, given the pad orientation:
962  RotatePoint( &startPoint, m_padToTestPos, orient );
963 
964  // Calculate the actual position of the circle in the new X,Y axis:
965  RotatePoint( &startPoint, m_segmAngle );
966 
967  if( !checkMarginToCircle( startPoint, padHalfsize.x + distToLine, m_segmLength ) )
968  {
969  return false;
970  }
971 
972  // test the second circle
973  startPoint.x = m_padToTestPos.x; // startPoint = centre of the lower circle of the oval shape
974  startPoint.y = m_padToTestPos.y - deltay;
975  RotatePoint( &startPoint, m_padToTestPos, orient );
976  RotatePoint( &startPoint, m_segmAngle );
977 
978  if( !checkMarginToCircle( startPoint, padHalfsize.x + distToLine, m_segmLength ) )
979  {
980  return false;
981  }
982  }
983  break;
984 
985  case PAD_SHAPE_ROUNDRECT:
986  {
987  // a round rect is a smaller rect, with a clearance augmented by the corners radius
988  int r = aPad->GetRoundRectCornerRadius();
989  padHalfsize.x -= r;
990  padHalfsize.y -= r;
991  distToLine += r;
992  }
993  // Fall through
994  case PAD_SHAPE_RECT:
995  // the area to test is a rounded rectangle.
996  // this can be done by testing 2 rectangles and 4 circles (the corners)
997 
998  // Testing the first rectangle dimx + distToLine, dimy:
999  m_xcliplo = m_padToTestPos.x - padHalfsize.x - distToLine;
1000  m_ycliplo = m_padToTestPos.y - padHalfsize.y;
1001  m_xcliphi = m_padToTestPos.x + padHalfsize.x + distToLine;
1002  m_ycliphi = m_padToTestPos.y + padHalfsize.y;
1003 
1004  if( !checkLine( startPoint, endPoint ) )
1005  return false;
1006 
1007  // Testing the second rectangle dimx , dimy + distToLine
1008  m_xcliplo = m_padToTestPos.x - padHalfsize.x;
1009  m_ycliplo = m_padToTestPos.y - padHalfsize.y - distToLine;
1010  m_xcliphi = m_padToTestPos.x + padHalfsize.x;
1011  m_ycliphi = m_padToTestPos.y + padHalfsize.y + distToLine;
1012 
1013  if( !checkLine( startPoint, endPoint ) )
1014  return false;
1015 
1016  // testing the 4 circles which are the clearance area of each corner:
1017 
1018  // testing the left top corner of the rectangle
1019  startPoint.x = m_padToTestPos.x - padHalfsize.x;
1020  startPoint.y = m_padToTestPos.y - padHalfsize.y;
1021  RotatePoint( &startPoint, m_padToTestPos, orient );
1022  RotatePoint( &startPoint, m_segmAngle );
1023 
1024  if( !checkMarginToCircle( startPoint, distToLine, m_segmLength ) )
1025  return false;
1026 
1027  // testing the right top corner of the rectangle
1028  startPoint.x = m_padToTestPos.x + padHalfsize.x;
1029  startPoint.y = m_padToTestPos.y - padHalfsize.y;
1030  RotatePoint( &startPoint, m_padToTestPos, orient );
1031  RotatePoint( &startPoint, m_segmAngle );
1032 
1033  if( !checkMarginToCircle( startPoint, distToLine, m_segmLength ) )
1034  return false;
1035 
1036  // testing the left bottom corner of the rectangle
1037  startPoint.x = m_padToTestPos.x - padHalfsize.x;
1038  startPoint.y = m_padToTestPos.y + padHalfsize.y;
1039  RotatePoint( &startPoint, m_padToTestPos, orient );
1040  RotatePoint( &startPoint, m_segmAngle );
1041 
1042  if( !checkMarginToCircle( startPoint, distToLine, m_segmLength ) )
1043  return false;
1044 
1045  // testing the right bottom corner of the rectangle
1046  startPoint.x = m_padToTestPos.x + padHalfsize.x;
1047  startPoint.y = m_padToTestPos.y + padHalfsize.y;
1048  RotatePoint( &startPoint, m_padToTestPos, orient );
1049  RotatePoint( &startPoint, m_segmAngle );
1050 
1051  if( !checkMarginToCircle( startPoint, distToLine, m_segmLength ) )
1052  return false;
1053 
1054  break;
1055 
1056  case PAD_SHAPE_TRAPEZOID:
1057  {
1058  wxPoint poly[4];
1059  aPad->BuildPadPolygon( poly, wxSize( 0, 0 ), orient );
1060 
1061  // Move shape to m_padToTestPos
1062  for( int ii = 0; ii < 4; ii++ )
1063  {
1064  poly[ii] += m_padToTestPos;
1065  RotatePoint( &poly[ii], m_segmAngle );
1066  }
1067 
1068  if( !poly2segmentDRC( poly, 4, wxPoint( 0, 0 ),
1069  wxPoint(m_segmLength,0), distToLine ) )
1070  return false;
1071  }
1072  break;
1073 
1074  case PAD_SHAPE_CUSTOM:
1075  {
1076  SHAPE_POLY_SET polyset;
1077  polyset.Append( aPad->GetCustomShapeAsPolygon() );
1078  // The pad can be rotated. calculate the coordinates
1079  // relatives to the segment being tested
1080  // Note, the pad position relative to the segment origin
1081  // is m_padToTestPos
1082  aPad->CustomShapeAsPolygonToBoardPosition( &polyset,
1083  m_padToTestPos, orient );
1084 
1085  // Rotate all coordinates by m_segmAngle, because the segment orient
1086  // is m_segmAngle
1087  // we are using a horizontal segment for test, because we know here
1088  // only the lenght and orientation+ of the segment
1089  // therefore all coordinates of the pad to test must be rotated by
1090  // m_segmAngle (they are already relative to the segment origin)
1091  aPad->CustomShapeAsPolygonToBoardPosition( &polyset,
1092  wxPoint( 0, 0 ), m_segmAngle );
1093 
1094  const SHAPE_LINE_CHAIN& refpoly = polyset.COutline( 0 );
1095 
1096  if( !poly2segmentDRC( (wxPoint*) &refpoly.CPoint( 0 ),
1097  refpoly.PointCount(),
1098  wxPoint( 0, 0 ), wxPoint(m_segmLength,0),
1099  distToLine ) )
1100  return false;
1101  }
1102  break;
1103  }
1104 
1105  return true;
1106 }
1107 
1108 
1115 bool DRC::checkMarginToCircle( wxPoint aCentre, int aRadius, int aLength )
1116 {
1117  if( abs( aCentre.y ) >= aRadius ) // trivial case
1118  return true;
1119 
1120  // Here, distance between aCentre and X axis is < aRadius
1121  if( (aCentre.x > -aRadius ) && ( aCentre.x < (aLength + aRadius) ) )
1122  {
1123  if( (aCentre.x >= 0) && (aCentre.x <= aLength) )
1124  return false; // aCentre is between the starting point and the ending point of the segm
1125 
1126  if( aCentre.x > aLength ) // aCentre is after the ending point
1127  aCentre.x -= aLength; // move aCentre to the starting point of the segment
1128 
1129  if( EuclideanNorm( aCentre ) < aRadius )
1130  // distance between aCentre and the starting point or the ending point is < aRadius
1131  return false;
1132  }
1133 
1134  return true;
1135 }
1136 
1137 
1138 // Helper function used in checkLine::
1139 static inline int USCALE( unsigned arg, unsigned num, unsigned den )
1140 {
1141  int ii;
1142 
1143  ii = KiROUND( ( (double) arg * num ) / den );
1144  return ii;
1145 }
1146 
1147 
1153 bool DRC::checkLine( wxPoint aSegStart, wxPoint aSegEnd )
1154 {
1155 #define WHEN_OUTSIDE return true
1156 #define WHEN_INSIDE
1157  int temp;
1158 
1159  if( aSegStart.x > aSegEnd.x )
1160  std::swap( aSegStart, aSegEnd );
1161 
1162  if( (aSegEnd.x < m_xcliplo) || (aSegStart.x > m_xcliphi) )
1163  {
1164  WHEN_OUTSIDE;
1165  }
1166 
1167  if( aSegStart.y < aSegEnd.y )
1168  {
1169  if( (aSegEnd.y < m_ycliplo) || (aSegStart.y > m_ycliphi) )
1170  {
1171  WHEN_OUTSIDE;
1172  }
1173 
1174  if( aSegStart.y < m_ycliplo )
1175  {
1176  temp = USCALE( (aSegEnd.x - aSegStart.x), (m_ycliplo - aSegStart.y),
1177  (aSegEnd.y - aSegStart.y) );
1178 
1179  if( (aSegStart.x += temp) > m_xcliphi )
1180  {
1181  WHEN_OUTSIDE;
1182  }
1183 
1184  aSegStart.y = m_ycliplo;
1185  WHEN_INSIDE;
1186  }
1187 
1188  if( aSegEnd.y > m_ycliphi )
1189  {
1190  temp = USCALE( (aSegEnd.x - aSegStart.x), (aSegEnd.y - m_ycliphi),
1191  (aSegEnd.y - aSegStart.y) );
1192 
1193  if( (aSegEnd.x -= temp) < m_xcliplo )
1194  {
1195  WHEN_OUTSIDE;
1196  }
1197 
1198  aSegEnd.y = m_ycliphi;
1199  WHEN_INSIDE;
1200  }
1201 
1202  if( aSegStart.x < m_xcliplo )
1203  {
1204  temp = USCALE( (aSegEnd.y - aSegStart.y), (m_xcliplo - aSegStart.x),
1205  (aSegEnd.x - aSegStart.x) );
1206  aSegStart.y += temp;
1207  aSegStart.x = m_xcliplo;
1208  WHEN_INSIDE;
1209  }
1210 
1211  if( aSegEnd.x > m_xcliphi )
1212  {
1213  temp = USCALE( (aSegEnd.y - aSegStart.y), (aSegEnd.x - m_xcliphi),
1214  (aSegEnd.x - aSegStart.x) );
1215  aSegEnd.y -= temp;
1216  aSegEnd.x = m_xcliphi;
1217  WHEN_INSIDE;
1218  }
1219  }
1220  else
1221  {
1222  if( (aSegStart.y < m_ycliplo) || (aSegEnd.y > m_ycliphi) )
1223  {
1224  WHEN_OUTSIDE;
1225  }
1226 
1227  if( aSegStart.y > m_ycliphi )
1228  {
1229  temp = USCALE( (aSegEnd.x - aSegStart.x), (aSegStart.y - m_ycliphi),
1230  (aSegStart.y - aSegEnd.y) );
1231 
1232  if( (aSegStart.x += temp) > m_xcliphi )
1233  {
1234  WHEN_OUTSIDE;
1235  }
1236 
1237  aSegStart.y = m_ycliphi;
1238  WHEN_INSIDE;
1239  }
1240 
1241  if( aSegEnd.y < m_ycliplo )
1242  {
1243  temp = USCALE( (aSegEnd.x - aSegStart.x), (m_ycliplo - aSegEnd.y),
1244  (aSegStart.y - aSegEnd.y) );
1245 
1246  if( (aSegEnd.x -= temp) < m_xcliplo )
1247  {
1248  WHEN_OUTSIDE;
1249  }
1250 
1251  aSegEnd.y = m_ycliplo;
1252  WHEN_INSIDE;
1253  }
1254 
1255  if( aSegStart.x < m_xcliplo )
1256  {
1257  temp = USCALE( (aSegStart.y - aSegEnd.y), (m_xcliplo - aSegStart.x),
1258  (aSegEnd.x - aSegStart.x) );
1259  aSegStart.y -= temp;
1260  aSegStart.x = m_xcliplo;
1261  WHEN_INSIDE;
1262  }
1263 
1264  if( aSegEnd.x > m_xcliphi )
1265  {
1266  temp = USCALE( (aSegStart.y - aSegEnd.y), (aSegEnd.x - m_xcliphi),
1267  (aSegEnd.x - aSegStart.x) );
1268  aSegEnd.y += temp;
1269  aSegEnd.x = m_xcliphi;
1270  WHEN_INSIDE;
1271  }
1272  }
1273 
1274  if( ( (aSegEnd.x + aSegStart.x) / 2 <= m_xcliphi )
1275  && ( (aSegEnd.x + aSegStart.x) / 2 >= m_xcliplo ) \
1276  && ( (aSegEnd.y + aSegStart.y) / 2 <= m_ycliphi )
1277  && ( (aSegEnd.y + aSegStart.y) / 2 >= m_ycliplo ) )
1278  {
1279  return false;
1280  }
1281  else
1282  {
1283  return true;
1284  }
1285 }
double EuclideanNorm(const wxPoint &vector)
Euclidean norm of a 2D vector.
Definition: trigo.h:112
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:646
KICAD_T Type() const
Function Type()
Definition: base_struct.h:212
#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
const SHAPE_POLY_SET & GetCustomShapeAsPolygon() const
Accessor to the custom shape as one polygon.
Definition: class_pad.h:341
#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:511
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:219
Classes to handle copper zones.
PAD_DRILL_SHAPE_T GetDrillShape() const
Definition: class_pad.h:381
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:230
const wxSize & GetDrillSize() const
Definition: class_pad.h:275
#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:216
#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.
void CustomShapeAsPolygonToBoardPosition(SHAPE_POLY_SET *aMergedPolygon, wxPoint aPosition, double aRotation) const
When created, the corners coordinates are relative to the pad position, orientation 0...
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:254
int GetBoundingRadius() const
Function GetBoundingRadius returns the radius of a minimum sized circle which fully encloses this pad...
Definition: class_pad.h:586
Class SHAPE_POLY_SET.
const wxPoint & GetStart() const
Definition: class_track.h:121
const wxPoint & GetPosition() const override
Definition: class_pad.h:220
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:395
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:269
BOARD_DESIGN_SETTINGS & GetDesignSettings() const
Function GetDesignSettings.
Definition: class_board.h:532
void SetSize(const wxSize &aSize)
Definition: class_pad.h:268
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:394
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:375
const wxSize & GetDelta() const
Definition: class_pad.h:272
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:546
void SetShape(PAD_SHAPE_T aShape)
Definition: class_pad.h:217
wxPoint ShapePos() const
Definition: class_pad.cpp:500
void SetOrientation(double aAngle)
Function SetOrientation sets the rotation angle of the pad.
Definition: class_pad.cpp:401
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
int Append(int x, int y, int aOutline=-1, int aHole=-1, bool aAllowDuplication=false)
Appends a vertex at the end of the given outline/hole (default: the last outline) ...
#define DRCE_TOO_SMALL_VIA
Too small via size.
Definition: drc_stuff.h:67