41 int& largestClearance =
m_board->m_DRCMaxClearance;
42 int& largestPhysicalClearance =
m_board->m_DRCMaxPhysicalClearance;
47 largestClearance = std::max( largestClearance,
m_board->GetMaxClearanceValue() );
53 largestPhysicalClearance = worstConstraint.
GetValue().
Min();
56 largestPhysicalClearance = std::max( largestPhysicalClearance, worstConstraint.
GetValue().
Min() );
60 if( largestPhysicalClearance <= 0 )
62 int conditionalMax = 0;
68 conditionalMax = std::max( conditionalMax, worstConstraint.
GetValue().
Min() );
70 if( conditionalMax > 0 )
72 bool hasMatchingItems =
false;
77 hasMatchingItems =
true;
81 if( hasMatchingItems )
82 largestPhysicalClearance = conditionalMax;
87 largestClearance = std::min( largestClearance, INT_MAX / 3 );
88 largestPhysicalClearance = std::min( largestPhysicalClearance, INT_MAX / 3 );
90 std::set<ZONE*> allZones;
93 [](
ZONE* zone,
const LSET& copperLayers )
100 fill->BuildBBoxCaches();
106 allZones.insert( zone );
110 m_board->m_DRCZones.push_back( zone );
114 if( zoneCopperLayers.any() )
116 cacheBBoxes( zone, zoneCopperLayers );
117 m_board->m_DRCCopperZones.push_back( zone );
124 for(
ZONE* zone : footprint->Zones() )
126 allZones.insert( zone );
130 m_board->m_DRCZones.push_back( zone );
134 if( zoneCopperLayers.any() )
136 cacheBBoxes( zone, zoneCopperLayers );
137 m_board->m_DRCCopperZones.push_back( zone );
144 std::atomic<size_t> done( 1 );
153 auto addToCopperTree =
159 LSET copperLayers = item->GetLayerSet() & boardCopperLayers;
167 copperLayers = boardCopperLayers;
173 m_board->m_CopperItemRTreeCache->Insert( item, layer, largestClearance );
183 static const std::vector<KICAD_T> itemTypes = {
195 std::future<void> retn =
tp.submit_task(
198 std::unique_lock<std::shared_mutex> writeLock(
m_board->m_CachesMutex );
200 if( !
m_board->m_CopperItemRTreeCache )
201 m_board->m_CopperItemRTreeCache = std::make_shared<DRC_RTREE>();
206 std::future_status status = retn.wait_for( std::chrono::milliseconds( 250 ) );
208 while( status != std::future_status::ready )
211 status = retn.wait_for( std::chrono::milliseconds( 250 ) );
214 if( !
reportPhase(
_(
"Tessellating copper zones..." ) ) )
222 footprint->BuildCourtyardCaches();
223 footprint->BuildNetTieCache();
226 std::vector<std::future<size_t>> returns;
228 returns.reserve( allZones.size() );
231 [
this, &done](
ZONE* aZone ) ->
size_t
236 aZone->CacheBoundingBox();
237 aZone->CacheTriangulation();
239 if( !aZone->GetIsRuleArea() && aZone->IsOnCopperLayer() )
241 std::unique_ptr<DRC_RTREE> rtree = std::make_unique<DRC_RTREE>();
243 aZone->GetLayerSet().RunOnLayers(
247 rtree->Insert( aZone, layer );
251 std::unique_lock<std::shared_mutex> writeLock(
m_board->m_CachesMutex );
252 m_board->m_CopperZoneRTreeCache[ aZone ] = std::move( rtree );
261 for(
ZONE* zone : allZones )
263 returns.emplace_back(
tp.submit_task(
266 return cache_zones( zone );
272 for(
const std::future<size_t>& ret : returns )
274 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
276 while( status != std::future_status::ready )
279 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
283 m_board->m_ZoneIsolatedIslandsMap.clear();
300 m_board->BoardOutline()->GetOutline().BuildBBoxCaches();
302 std::shared_ptr<CONNECTIVITY_DATA> connectivity =
m_board->GetConnectivity();
304 connectivity->ClearRatsnest();
306 connectivity->FillIsolatedIslandsMap(
m_board->m_ZoneIsolatedIslandsMap,
true );