39 int& largestClearance =
m_board->m_DRCMaxClearance;
40 int& largestPhysicalClearance =
m_board->m_DRCMaxPhysicalClearance;
45 largestClearance = std::max( largestClearance,
m_board->GetMaxClearanceValue() );
48 largestPhysicalClearance = worstConstraint.
GetValue().
Min();
51 largestPhysicalClearance = std::max( largestPhysicalClearance, worstConstraint.
GetValue().
Min() );
54 largestClearance = std::min( largestClearance, INT_MAX / 3 );
55 largestPhysicalClearance = std::min( largestPhysicalClearance, INT_MAX / 3 );
57 std::set<ZONE*> allZones;
60 [](
ZONE* zone,
const LSET& copperLayers )
67 fill->BuildBBoxCaches();
73 allZones.insert( zone );
77 m_board->m_DRCZones.push_back( zone );
81 if( zoneCopperLayers.any() )
83 cacheBBoxes( zone, zoneCopperLayers );
84 m_board->m_DRCCopperZones.push_back( zone );
91 for(
ZONE* zone : footprint->Zones() )
93 allZones.insert( zone );
97 m_board->m_DRCZones.push_back( zone );
101 if( zoneCopperLayers.any() )
103 cacheBBoxes( zone, zoneCopperLayers );
104 m_board->m_DRCCopperZones.push_back( zone );
111 std::atomic<size_t> done( 1 );
120 auto addToCopperTree =
126 LSET copperLayers = item->GetLayerSet() & boardCopperLayers;
134 copperLayers = boardCopperLayers;
140 m_board->m_CopperItemRTreeCache->Insert( item, layer, largestClearance );
150 static const std::vector<KICAD_T> itemTypes = {
161 std::future<void> retn =
tp.submit_task(
164 std::unique_lock<std::shared_mutex> writeLock(
m_board->m_CachesMutex );
166 if( !
m_board->m_CopperItemRTreeCache )
167 m_board->m_CopperItemRTreeCache = std::make_shared<DRC_RTREE>();
172 std::future_status status = retn.wait_for( std::chrono::milliseconds( 250 ) );
174 while( status != std::future_status::ready )
177 status = retn.wait_for( std::chrono::milliseconds( 250 ) );
180 if( !
reportPhase(
_(
"Tessellating copper zones..." ) ) )
188 footprint->BuildCourtyardCaches();
189 footprint->BuildNetTieCache();
192 std::vector<std::future<size_t>> returns;
194 returns.reserve( allZones.size() );
197 [
this, &done](
ZONE* aZone ) ->
size_t
202 aZone->CacheBoundingBox();
203 aZone->CacheTriangulation();
205 if( !aZone->GetIsRuleArea() && aZone->IsOnCopperLayer() )
207 std::unique_ptr<DRC_RTREE> rtree = std::make_unique<DRC_RTREE>();
209 aZone->GetLayerSet().RunOnLayers(
213 rtree->Insert( aZone, layer );
217 std::unique_lock<std::shared_mutex> writeLock(
m_board->m_CachesMutex );
218 m_board->m_CopperZoneRTreeCache[ aZone ] = std::move( rtree );
227 for(
ZONE* zone : allZones )
229 returns.emplace_back(
tp.submit_task(
232 return cache_zones( zone );
238 for(
const std::future<size_t>& ret : returns )
240 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
242 while( status != std::future_status::ready )
245 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
249 m_board->m_ZoneIsolatedIslandsMap.clear();
263 std::shared_ptr<CONNECTIVITY_DATA> connectivity =
m_board->GetConnectivity();
265 connectivity->ClearRatsnest();
267 connectivity->FillIsolatedIslandsMap(
m_board->m_ZoneIsolatedIslandsMap,
true );