KiCad PCB EDA Suite
Loading...
Searching...
No Matches
drc_cache_generator.cpp
Go to the documentation of this file.
1/*
2 * This program source code file is part of KiCad, a free EDA CAD application.
3 *
4 * Copyright The KiCad Developers.
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version 2
9 * of the License, or (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, you may find one here:
18 * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
19 * or you may search the http://www.gnu.org website for the version 2 license,
20 * or you may write to the Free Software Foundation, Inc.,
21 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
22 */
23
24#include <common.h>
26#include <pad.h>
27#include <pcb_board_outline.h>
28#include <footprint.h>
29#include <thread_pool.h>
30#include <zone.h>
32#include <drc/drc_engine.h>
33#include <drc/drc_rtree.h>
35#include <mutex>
36
38{
39 m_board = m_drcEngine->GetBoard();
40
41 int& largestClearance = m_board->m_DRCMaxClearance;
42 int& largestPhysicalClearance = m_board->m_DRCMaxPhysicalClearance;
43 DRC_CONSTRAINT worstConstraint;
44 LSET boardCopperLayers = LSET::AllCuMask( m_board->GetCopperLayerCount() );
46
47 largestClearance = std::max( largestClearance, m_board->GetMaxClearanceValue() );
48
49 // Only consider unconditional constraints for the global maximum. Conditional constraints
50 // (like the barcode physical clearance default) apply only to specific item types and
51 // should not inflate the R-tree query radius for all items on the board.
52 if( m_drcEngine->QueryWorstConstraint( PHYSICAL_CLEARANCE_CONSTRAINT, worstConstraint, true ) )
53 largestPhysicalClearance = worstConstraint.GetValue().Min();
54
55 if( m_drcEngine->QueryWorstConstraint( PHYSICAL_HOLE_CLEARANCE_CONSTRAINT, worstConstraint, true ) )
56 largestPhysicalClearance = std::max( largestPhysicalClearance, worstConstraint.GetValue().Min() );
57
58 // If the unconditional max is 0, check for conditional constraints that may still apply.
59 // Only include the conditional maximum if matching items actually exist on the board.
60 if( largestPhysicalClearance <= 0 )
61 {
62 int conditionalMax = 0;
63
64 if( m_drcEngine->QueryWorstConstraint( PHYSICAL_CLEARANCE_CONSTRAINT, worstConstraint ) )
65 conditionalMax = worstConstraint.GetValue().Min();
66
67 if( m_drcEngine->QueryWorstConstraint( PHYSICAL_HOLE_CLEARANCE_CONSTRAINT, worstConstraint ) )
68 conditionalMax = std::max( conditionalMax, worstConstraint.GetValue().Min() );
69
70 if( conditionalMax > 0 )
71 {
72 bool hasMatchingItems = false;
73
75 [&]( BOARD_ITEM* item ) -> bool
76 {
77 hasMatchingItems = true;
78 return false;
79 } );
80
81 if( hasMatchingItems )
82 largestPhysicalClearance = conditionalMax;
83 }
84 }
85
86 // Ensure algorithmic safety
87 largestClearance = std::min( largestClearance, INT_MAX / 3 );
88 largestPhysicalClearance = std::min( largestPhysicalClearance, INT_MAX / 3 );
89
90 std::set<ZONE*> allZones;
91
92 auto cacheBBoxes =
93 []( ZONE* zone, const LSET& copperLayers )
94 {
95 zone->Outline()->BuildBBoxCaches();
96
97 for( PCB_LAYER_ID layer : copperLayers )
98 {
99 if( SHAPE_POLY_SET* fill = zone->GetFill( layer ) )
100 fill->BuildBBoxCaches();
101 }
102 };
103
104 for( ZONE* zone : m_board->Zones() )
105 {
106 allZones.insert( zone );
107
108 if( !zone->GetIsRuleArea() )
109 {
110 m_board->m_DRCZones.push_back( zone );
111
112 LSET zoneCopperLayers = zone->GetLayerSet() & boardCopperLayers;
113
114 if( zoneCopperLayers.any() )
115 {
116 cacheBBoxes( zone, zoneCopperLayers );
117 m_board->m_DRCCopperZones.push_back( zone );
118 }
119 }
120 }
121
122 for( FOOTPRINT* footprint : m_board->Footprints() )
123 {
124 for( ZONE* zone : footprint->Zones() )
125 {
126 allZones.insert( zone );
127
128 if( !zone->GetIsRuleArea() )
129 {
130 m_board->m_DRCZones.push_back( zone );
131
132 LSET zoneCopperLayers = zone->GetLayerSet() & boardCopperLayers;
133
134 if( zoneCopperLayers.any() )
135 {
136 cacheBBoxes( zone, zoneCopperLayers );
137 m_board->m_DRCCopperZones.push_back( zone );
138 }
139 }
140 }
141 }
142
143 size_t count = 0;
144 std::atomic<size_t> done( 1 );
145
146 auto countItems =
147 [&]( BOARD_ITEM* item ) -> bool
148 {
149 ++count;
150 return true;
151 };
152
153 auto addToCopperTree =
154 [&]( BOARD_ITEM* item ) -> bool
155 {
156 if( m_drcEngine->IsCancelled() )
157 return false;
158
159 LSET copperLayers = item->GetLayerSet() & boardCopperLayers;
160
161 // Special-case pad holes which pierce all the copper layers
162 if( item->Type() == PCB_PAD_T )
163 {
164 PAD* pad = static_cast<PAD*>( item );
165
166 if( pad->HasHole() )
167 copperLayers = boardCopperLayers;
168 }
169
170 copperLayers.RunOnLayers(
171 [&]( PCB_LAYER_ID layer )
172 {
173 m_board->m_CopperItemRTreeCache->Insert( item, layer, largestClearance );
174 } );
175
176 done.fetch_add( 1 );
177 return true;
178 };
179
180 if( !reportPhase( _( "Gathering copper items..." ) ) )
181 return false; // DRC cancelled
182
183 static const std::vector<KICAD_T> itemTypes = {
185 PCB_PAD_T,
191 };
192
193 forEachGeometryItem( itemTypes, boardCopperLayers, countItems );
194
195 std::future<void> retn = tp.submit_task(
196 [&]()
197 {
198 std::unique_lock<std::shared_mutex> writeLock( m_board->m_CachesMutex );
199
200 if( !m_board->m_CopperItemRTreeCache )
201 m_board->m_CopperItemRTreeCache = std::make_shared<DRC_RTREE>();
202
203 forEachGeometryItem( itemTypes, boardCopperLayers, addToCopperTree );
204 } );
205
206 std::future_status status = retn.wait_for( std::chrono::milliseconds( 250 ) );
207
208 while( status != std::future_status::ready )
209 {
210 reportProgress( done, count );
211 status = retn.wait_for( std::chrono::milliseconds( 250 ) );
212 }
213
214 if( !reportPhase( _( "Tessellating copper zones..." ) ) )
215 return false; // DRC cancelled
216
217 // Cache zone bounding boxes, triangulation, copper zone rtrees, and footprint courtyards
218 // before we start.
219
220 for( FOOTPRINT* footprint : m_board->Footprints() )
221 {
222 footprint->BuildCourtyardCaches();
223 footprint->BuildNetTieCache();
224 }
225
226 std::vector<std::future<size_t>> returns;
227
228 returns.reserve( allZones.size() );
229
230 auto cache_zones =
231 [this, &done]( ZONE* aZone ) -> size_t
232 {
233 if( m_drcEngine->IsCancelled() )
234 return 0;
235
236 aZone->CacheBoundingBox();
237 aZone->CacheTriangulation();
238
239 if( !aZone->GetIsRuleArea() && aZone->IsOnCopperLayer() )
240 {
241 std::unique_ptr<DRC_RTREE> rtree = std::make_unique<DRC_RTREE>();
242
243 aZone->GetLayerSet().RunOnLayers(
244 [&]( PCB_LAYER_ID layer )
245 {
246 if( IsCopperLayer( layer ) )
247 rtree->Insert( aZone, layer );
248 } );
249
250 {
251 std::unique_lock<std::shared_mutex> writeLock( m_board->m_CachesMutex );
252 m_board->m_CopperZoneRTreeCache[ aZone ] = std::move( rtree );
253 }
254
255 done.fetch_add( 1 );
256 }
257
258 return 1;
259 };
260
261 for( ZONE* zone : allZones )
262 {
263 returns.emplace_back( tp.submit_task(
264 [cache_zones, zone]
265 {
266 return cache_zones( zone );
267 } ) );
268 }
269
270 done.store( 1 );
271
272 for( const std::future<size_t>& ret : returns )
273 {
274 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
275
276 while( status != std::future_status::ready )
277 {
278 reportProgress( done, allZones.size() );
279 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
280 }
281 }
282
283 m_board->m_ZoneIsolatedIslandsMap.clear();
284
285 for( ZONE* zone : m_board->Zones() )
286 {
287 if( !zone->GetIsRuleArea() && !zone->IsTeardropArea() )
288 {
289 zone->GetLayerSet().RunOnLayers(
290 [&]( PCB_LAYER_ID layer )
291 {
292 m_board->m_ZoneIsolatedIslandsMap[ zone ][ layer ] = ISOLATED_ISLANDS();
293 } );
294 }
295 }
296
297 m_board->UpdateBoardOutline();
298
299 if( m_board->BoardOutline() )
300 m_board->BoardOutline()->GetOutline().BuildBBoxCaches();
301
302 std::shared_ptr<CONNECTIVITY_DATA> connectivity = m_board->GetConnectivity();
303
304 connectivity->ClearRatsnest();
305 connectivity->Build( m_board, m_drcEngine->GetProgressReporter() );
306 connectivity->FillIsolatedIslandsMap( m_board->m_ZoneIsolatedIslandsMap, true );
307
308 return !m_drcEngine->IsCancelled();
309}
A base class for any item which can be embedded within the BOARD container class, and therefore insta...
Definition board_item.h:84
virtual bool Run() override
Run this provider against the given PCB with configured options (if any).
const MINOPTMAX< int > & GetValue() const
Definition drc_rule.h:187
virtual bool reportPhase(const wxString &aStageName)
int forEachGeometryItem(const std::vector< KICAD_T > &aTypes, const LSET &aLayers, const std::function< bool(BOARD_ITEM *)> &aFunc)
virtual bool reportProgress(size_t aCount, size_t aSize, size_t aDelta=1)
LSET is a set of PCB_LAYER_IDs.
Definition lset.h:37
static const LSET & AllCuMask()
return AllCuMask( MAX_CU_LAYERS );
Definition lset.cpp:608
void RunOnLayers(const std::function< void(PCB_LAYER_ID)> &aFunction) const
Execute a function on each layer of the LSET.
Definition lset.h:263
static const LSET & AllLayersMask()
Definition lset.cpp:641
T Min() const
Definition minoptmax.h:33
Definition pad.h:55
Represent a set of closed polygons.
void BuildBBoxCaches() const
Construct BBoxCaches for Contains(), below.
Handle a list of polygons defining a copper zone.
Definition zone.h:73
bool GetIsRuleArea() const
Accessors to parameters used in Rule Area zones:
Definition zone.h:719
SHAPE_POLY_SET * Outline()
Definition zone.h:340
SHAPE_POLY_SET * GetFill(PCB_LAYER_ID aLayer)
Definition zone.h:613
bool IsTeardropArea() const
Definition zone.h:694
virtual LSET GetLayerSet() const override
Return a std::bitset of all layers on which the item physically resides.
Definition zone.h:136
The common library.
@ PHYSICAL_HOLE_CLEARANCE_CONSTRAINT
Definition drc_rule.h:78
@ PHYSICAL_CLEARANCE_CONSTRAINT
Definition drc_rule.h:77
#define _(s)
bool IsCopperLayer(int aLayerId)
Test whether a layer is a copper layer.
Definition layer_ids.h:677
PCB_LAYER_ID
A quick note on layer IDs:
Definition layer_ids.h:60
A struct recording the isolated and single-pad islands within a zone.
Definition zone.h:60
thread_pool & GetKiCadThreadPool()
Get a reference to the current thread pool.
static thread_pool * tp
BS::priority_thread_pool thread_pool
Definition thread_pool.h:31
@ PCB_SHAPE_T
class PCB_SHAPE, a segment not on copper layers
Definition typeinfo.h:88
@ PCB_VIA_T
class PCB_VIA, a via (like a track segment on a copper layer)
Definition typeinfo.h:97
@ PCB_TEXTBOX_T
class PCB_TEXTBOX, wrapped text on a layer
Definition typeinfo.h:93
@ PCB_TEXT_T
class PCB_TEXT, text on a layer
Definition typeinfo.h:92
@ PCB_FIELD_T
class PCB_FIELD, text associated with a footprint property
Definition typeinfo.h:90
@ PCB_BARCODE_T
class PCB_BARCODE, a barcode (graphic item)
Definition typeinfo.h:101
@ PCB_TABLECELL_T
class PCB_TABLECELL, PCB_TEXTBOX for use in tables
Definition typeinfo.h:95
@ PCB_PAD_T
class PAD, a pad in a footprint
Definition typeinfo.h:87
@ PCB_ARC_T
class PCB_ARC, an arc track segment on a copper layer
Definition typeinfo.h:98
@ PCB_DIMENSION_T
class PCB_DIMENSION_BASE: abstract dimension meta-type
Definition typeinfo.h:100
@ PCB_TABLE_T
class PCB_TABLE, table of PCB_TABLECELLs
Definition typeinfo.h:94
@ PCB_TRACE_T
class PCB_TRACK, a track segment (segment on a copper layer)
Definition typeinfo.h:96