KiCad PCB EDA Suite
Loading...
Searching...
No Matches
connectivity_algo.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 (C) 2016-2018 CERN
5 * Copyright The KiCad Developers, see AUTHORS.txt for contributors.
6 *
7 * @author Tomasz Wlostowski <[email protected]>
8 *
9 * This program is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU General Public License
11 * as published by the Free Software Foundation; either version 2
12 * of the License, or (at your option) any later version.
13 *
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
18 *
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, you may find one here:
21 * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
22 * or you may search the http://www.gnu.org website for the version 2 license,
23 * or you may write to the Free Software Foundation, Inc.,
24 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
25 */
26
27
28#include <algorithm>
29#include <future>
30#include <mutex>
31#include <ranges>
32
34#include <progress_reporter.h>
36#include <board.h>
37#include <board_commit.h>
38#include <thread_pool.h>
39#include <footprint.h>
40#include <pad.h>
41#include <pcb_shape.h>
42#include <pcb_track.h>
43
44#include <wx/log.h>
45
46#ifdef PROFILE
47#include <core/profile.h>
48#endif
49
50
52{
53 markItemNetAsDirty( aItem );
54
55 switch( aItem->Type() )
56 {
57 case PCB_FOOTPRINT_T:
58 for( PAD* pad : static_cast<FOOTPRINT*>( aItem )->Pads() )
59 {
60 m_itemMap[pad].MarkItemsAsInvalid();
61 m_itemMap.erase( pad );
62 }
63
64 m_itemList.SetDirty( true );
65 break;
66
67 case PCB_PAD_T:
68 case PCB_TRACE_T:
69 case PCB_ARC_T:
70 case PCB_VIA_T:
71 case PCB_ZONE_T:
72 case PCB_SHAPE_T:
73 m_itemMap[aItem].MarkItemsAsInvalid();
74 m_itemMap.erase ( aItem );
75 m_itemList.SetDirty( true );
76 break;
77
78 default:
79 return false;
80 }
81
82 // Once we delete an item, it may connect between lists, so mark both as potentially invalid
83 m_itemList.SetHasInvalid( true );
84
85 return true;
86}
87
88
90{
91 if( aItem->IsConnected() )
92 {
93 const BOARD_CONNECTED_ITEM* citem = static_cast<const BOARD_CONNECTED_ITEM*>( aItem );
94 MarkNetAsDirty( citem->GetNetCode() );
95 }
96 else
97 {
98 if( aItem->Type() == PCB_FOOTPRINT_T )
99 {
100 const FOOTPRINT* footprint = static_cast<const FOOTPRINT*>( aItem );
101
102 for( PAD* pad : footprint->Pads() )
103 MarkNetAsDirty( pad->GetNetCode() );
104 }
105 }
106}
107
108
110{
111 if( !aItem->IsOnCopperLayer() )
112 return false;
113
114 auto alreadyAdded =
115 [this]( BOARD_ITEM* item )
116 {
117 auto it = m_itemMap.find( item );
118
119 if( it == m_itemMap.end() )
120 return false;
121
122 // Don't be fooled by an empty ITEM_MAP_ENTRY auto-created by operator[].
123 return !it->second.GetItems().empty();
124 };
125
126 switch( aItem->Type() )
127 {
128 case PCB_NETINFO_T:
129 MarkNetAsDirty( static_cast<NETINFO_ITEM*>( aItem )->GetNetCode() );
130 break;
131
132 case PCB_FOOTPRINT_T:
133 {
134 if( static_cast<FOOTPRINT*>( aItem )->GetAttributes() & FP_JUST_ADDED )
135 return false;
136
137 for( PAD* pad : static_cast<FOOTPRINT*>( aItem )->Pads() )
138 {
139 if( alreadyAdded( pad ) )
140 return false;
141
142 add( m_itemList, pad );
143 }
144
145 break;
146 }
147
148 case PCB_PAD_T:
149 {
150 if( FOOTPRINT* fp = aItem->GetParentFootprint() )
151 {
152 if( fp->GetAttributes() & FP_JUST_ADDED )
153 return false;
154 }
155
156 if( alreadyAdded( aItem ) )
157 return false;
158
159 add( m_itemList, static_cast<PAD*>( aItem ) );
160 break;
161 }
162
163 case PCB_TRACE_T:
164 if( alreadyAdded( aItem ) )
165 return false;
166
167 add( m_itemList, static_cast<PCB_TRACK*>( aItem ) );
168 break;
169
170 case PCB_ARC_T:
171 if( alreadyAdded( aItem ) )
172 return false;
173
174 add( m_itemList, static_cast<PCB_ARC*>( aItem ) );
175 break;
176
177 case PCB_VIA_T:
178 if( alreadyAdded( aItem ) )
179 return false;
180
181 add( m_itemList, static_cast<PCB_VIA*>( aItem ) );
182 break;
183
184 case PCB_SHAPE_T:
185 if( alreadyAdded( aItem ) )
186 return false;
187
188 if( !IsCopperLayer( aItem->GetLayer() ) )
189 return false;
190
191 add( m_itemList, static_cast<PCB_SHAPE*>( aItem ) );
192 break;
193
194 case PCB_ZONE_T:
195 {
196 ZONE* zone = static_cast<ZONE*>( aItem );
197
198 if( alreadyAdded( aItem ) )
199 return false;
200
201 m_itemMap[zone] = ITEM_MAP_ENTRY();
202
203 // Don't check for connections on layers that only exist in the zone but
204 // were disabled in the board
205 BOARD* board = zone->GetBoard();
206 LSET layerset = board->GetEnabledLayers() & zone->GetLayerSet();
207
208 layerset.RunOnLayers(
209 [&]( PCB_LAYER_ID layer )
210 {
211 for( CN_ITEM* zitem : m_itemList.Add( zone, layer ) )
212 m_itemMap[zone].Link( zitem );
213 } );
214
215 break;
216 }
217
218 default:
219 return false;
220 }
221
222 markItemNetAsDirty( aItem );
223
224 return true;
225}
226
227
229{
230 for( CN_ITEM* item : m_itemList )
231 item->RemoveInvalidRefs();
232}
233
234
236{
237 std::lock_guard lock( m_mutex );
238#ifdef PROFILE
239 PROF_TIMER garbage_collection( "garbage-collection" );
240#endif
241 std::vector<CN_ITEM*> garbage;
242 garbage.reserve( 1024 );
243
244 m_parentConnectivityData->RemoveInvalidRefs();
245
246 if( m_isLocal )
247 m_globalConnectivityData->RemoveInvalidRefs();
248
249 m_itemList.RemoveInvalidItems( garbage );
250
251 for( CN_ITEM* item : garbage )
252 delete item;
253
254#ifdef PROFILE
255 garbage_collection.Show();
256 PROF_TIMER search_basic( "search-basic" );
257#endif
258
260 std::vector<CN_ITEM*> dirtyItems;
261 std::copy_if( m_itemList.begin(), m_itemList.end(), std::back_inserter( dirtyItems ),
262 [] ( CN_ITEM* aItem )
263 {
264 return aItem->Dirty();
265 } );
266
268 {
269 m_progressReporter->SetMaxProgress( dirtyItems.size() );
270
271 if( !m_progressReporter->KeepRefreshing() )
272 return;
273 }
274
275 if( m_itemList.IsDirty() )
276 {
277 std::vector<std::future<size_t>> returns( dirtyItems.size() );
278
279 // Collect deferred net code changes to avoid data races in parallel search.
280 // Free vias connected to zones have their net codes updated after all parallel
281 // work completes.
282 std::vector<std::pair<BOARD_CONNECTED_ITEM*, int>> deferredNetCodes;
283 std::mutex deferredNetCodesMutex;
284
285 for( size_t ii = 0; ii < dirtyItems.size(); ++ii )
286 {
287 returns[ii] = tp.submit_task(
288 [&dirtyItems, ii, this, &deferredNetCodes, &deferredNetCodesMutex] () ->size_t
289 {
290 if( m_progressReporter && m_progressReporter->IsCancelled() )
291 return 0;
292
293 CN_VISITOR visitor( dirtyItems[ii], &deferredNetCodes, &deferredNetCodesMutex );
294 m_itemList.FindNearby( dirtyItems[ii], visitor );
295
297 m_progressReporter->AdvanceProgress();
298
299 return 1;
300 } );
301 }
302
303 for( const std::future<size_t>& ret : returns )
304 {
305 // Here we balance returns with a 250ms timeout to allow UI updating
306 std::future_status status = ret.wait_for( std::chrono::milliseconds( 250 ) );
307
308 while( status != std::future_status::ready )
309 {
311 m_progressReporter->KeepRefreshing();
312
313 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
314 }
315 }
316
317 // Apply deferred net code changes now that parallel search is complete
318 for( const auto& [item, netCode] : deferredNetCodes )
319 item->SetNetCode( netCode );
320
322 m_progressReporter->KeepRefreshing();
323 }
324
325#ifdef PROFILE
326 search_basic.Show();
327#endif
328
329 m_itemList.ClearDirtyFlags();
330}
331
332
337
338
340CN_CONNECTIVITY_ALGO::SearchClusters( CLUSTER_SEARCH_MODE aMode, bool aExcludeZones, int aSingleNet )
341{
342 bool withinAnyNet = ( aMode != CSM_PROPAGATE );
343
344 std::deque<CN_ITEM*> Q;
345 std::set<CN_ITEM*> item_set;
346
347 CLUSTERS clusters;
348
349 if( m_itemList.IsDirty() )
351
352 std::set<CN_ITEM*> visited;
353
354 auto addToSearchList =
355 [&item_set, withinAnyNet, aSingleNet, &aExcludeZones]( CN_ITEM *aItem )
356 {
357 if( withinAnyNet && aItem->Net() <= 0 )
358 return;
359
360 if( !aItem->Valid() )
361 return;
362
363 if( aSingleNet >=0 && aItem->Net() != aSingleNet )
364 return;
365
366 if( aExcludeZones && aItem->Parent()->Type() == PCB_ZONE_T )
367 return;
368
369 item_set.insert( aItem );
370 };
371
372 std::for_each( m_itemList.begin(), m_itemList.end(), addToSearchList );
373
374 if( m_progressReporter && m_progressReporter->IsCancelled() )
375 return CLUSTERS();
376
377 while( !item_set.empty() )
378 {
379 std::shared_ptr<CN_CLUSTER> cluster = std::make_shared<CN_CLUSTER>();
380 CN_ITEM* root;
381 auto it = item_set.begin();
382
383 while( it != item_set.end() && visited.contains( *it ) )
384 it = item_set.erase( item_set.begin() );
385
386 if( it == item_set.end() )
387 break;
388
389 root = *it;
390 visited.insert( root );
391
392 Q.clear();
393 Q.push_back( root );
394
395 while( Q.size() )
396 {
397 CN_ITEM* current = Q.front();
398
399 Q.pop_front();
400 cluster->Add( current );
401
402 for( CN_ITEM* n : current->ConnectedItems() )
403 {
404 if( withinAnyNet && n->Net() != root->Net() )
405 continue;
406
407 if( aExcludeZones && n->Parent()->Type() == PCB_ZONE_T )
408 continue;
409
410 if( !visited.contains( n ) && n->Valid() )
411 {
412 visited.insert( n );
413 Q.push_back( n );
414 }
415 }
416 }
417
418 clusters.push_back( std::move( cluster ) );
419 }
420
421 if( m_progressReporter && m_progressReporter->IsCancelled() )
422 return CLUSTERS();
423
424 std::sort( clusters.begin(), clusters.end(),
425 []( const std::shared_ptr<CN_CLUSTER>& a, const std::shared_ptr<CN_CLUSTER>& b )
426 {
427 return a->OriginNet() < b->OriginNet();
428 } );
429
430 return clusters;
431}
432
433
435{
436 // Generate CN_ZONE_LAYERs for each island on each layer of each zone
437 //
438 std::vector<CN_ZONE_LAYER*> zitems;
439
440 for( ZONE* zone : aBoard->Zones() )
441 {
442 if( zone->IsOnCopperLayer() )
443 {
444 m_itemMap[zone] = ITEM_MAP_ENTRY();
445 markItemNetAsDirty( zone );
446
447 // Don't check for connections on layers that only exist in the zone but
448 // were disabled in the board
449 BOARD* board = zone->GetBoard();
450 LSET layerset = board->GetEnabledLayers() & zone->GetLayerSet() & LSET::AllCuMask();
451
452 layerset.RunOnLayers(
453 [&]( PCB_LAYER_ID layer )
454 {
455 for( int j = 0; j < zone->GetFilledPolysList( layer )->OutlineCount(); j++ )
456 zitems.push_back( new CN_ZONE_LAYER( zone, layer, j ) );
457 } );
458 }
459 }
460
461 // Setup progress metrics
462 //
463 int progressDelta = 50;
464 double size = 0.0;
465
466 size += zitems.size(); // Once for building RTrees
467 size += zitems.size(); // Once for adding to connectivity
468 size += aBoard->Tracks().size();
469 size += aBoard->Drawings().size();
470
471 for( FOOTPRINT* footprint : aBoard->Footprints() )
472 size += footprint->Pads().size();
473
474 size *= 1.5; // Our caller gets the other third of the progress bar
475
476 progressDelta = std::max( progressDelta, (int) size / 4 );
477
478 auto report =
479 [&]( int progress )
480 {
481 if( aReporter && ( progress % progressDelta ) == 0 )
482 {
483 aReporter->SetCurrentProgress( progress / size );
484 aReporter->KeepRefreshing( false );
485 }
486 };
487
488 // Generate RTrees for CN_ZONE_LAYER items (in parallel)
489 //
491 std::vector<std::future<size_t>> returns( zitems.size() );
492
493 auto cache_zones =
494 [aReporter]( CN_ZONE_LAYER* aZoneLayer ) -> size_t
495 {
496 if( aReporter && aReporter->IsCancelled() )
497 return 0;
498
499 aZoneLayer->BuildRTree();
500
501 if( aReporter )
502 aReporter->AdvanceProgress();
503
504 return 1;
505 };
506
507 for( size_t ii = 0; ii < zitems.size(); ++ii )
508 {
509 CN_ZONE_LAYER* ptr = zitems[ii];
510 returns[ii] = tp.submit_task(
511 [cache_zones, ptr] { return cache_zones( ptr ); } );
512 }
513
514 for( const std::future<size_t>& ret : returns )
515 {
516 std::future_status status = ret.wait_for( std::chrono::milliseconds( 250 ) );
517
518 while( status != std::future_status::ready )
519 {
520 if( aReporter )
521 aReporter->KeepRefreshing();
522
523 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
524 }
525
526 }
527
528 // Add CN_ZONE_LAYERS, tracks, and pads to connectivity
529 //
530 int ii = zitems.size();
531
532 for( CN_ZONE_LAYER* zitem : zitems )
533 {
534 m_itemList.Add( zitem );
535 m_itemMap[ zitem->Parent() ].Link( zitem );
536 report( ++ii );
537 }
538
539 for( PCB_TRACK* tv : aBoard->Tracks() )
540 {
541 Add( tv );
542 report( ++ii );
543 }
544
545 for( FOOTPRINT* footprint : aBoard->Footprints() )
546 {
547 for( PAD* pad : footprint->Pads() )
548 {
549 Add( pad );
550 report( ++ii );
551 }
552 }
553
554 for( BOARD_ITEM* drawing : aBoard->Drawings() )
555 {
556 if( PCB_SHAPE* shape = dynamic_cast<PCB_SHAPE*>( drawing ) )
557 {
558 if( shape->IsOnCopperLayer() )
559 Add( shape );
560 }
561
562 report( ++ii );
563 }
564
565 if( aReporter )
566 {
567 aReporter->SetCurrentProgress( (double) ii / (double) size );
568 aReporter->KeepRefreshing( false );
569 }
570}
571
572
573void CN_CONNECTIVITY_ALGO::LocalBuild( const std::shared_ptr<CONNECTIVITY_DATA>& aGlobalConnectivity,
574 const std::vector<BOARD_ITEM*>& aLocalItems )
575{
576 m_isLocal = true;
577 m_globalConnectivityData = aGlobalConnectivity;
578
579 for( BOARD_ITEM* item : aLocalItems )
580 {
581 switch( item->Type() )
582 {
583 case PCB_TRACE_T:
584 case PCB_ARC_T:
585 case PCB_VIA_T:
586 case PCB_PAD_T:
587 case PCB_FOOTPRINT_T:
588 case PCB_SHAPE_T:
589 Add( item );
590 break;
591
592 default:
593 break;
594 }
595 }
596}
597
598
600{
601 for( const std::shared_ptr<CN_CLUSTER>& cluster : m_connClusters )
602 {
603 if( cluster->IsConflicting() )
604 {
605 // Conflicting pads in cluster: we don't know the user's intent so best to do
606 // nothing.
607 wxLogTrace( wxT( "CN" ), wxT( "Conflicting pads in cluster %p; skipping propagation" ),
608 cluster.get() );
609 }
610 else if( cluster->HasValidNet() )
611 {
612 // Propagate from the origin (will be a pad if there are any, or another item if
613 // there are no pads).
614 int n_changed = 0;
615
616 for( CN_ITEM* item : *cluster )
617 {
618 if( item->Valid() && item->CanChangeNet()
619 && item->Parent()->GetNetCode() != cluster->OriginNet() )
620 {
621 MarkNetAsDirty( item->Parent()->GetNetCode() );
622 MarkNetAsDirty( cluster->OriginNet() );
623
624 if( aCommit )
625 aCommit->Modify( item->Parent() );
626
627 item->Parent()->SetNetCode( cluster->OriginNet() );
628 n_changed++;
629 }
630 }
631
632 if( n_changed )
633 {
634 wxLogTrace( wxT( "CN" ), wxT( "Cluster %p: net: %d %s" ),
635 cluster.get(),
636 cluster->OriginNet(),
637 (const char*) cluster->OriginNetName().c_str() );
638 }
639 else
640 {
641 wxLogTrace( wxT( "CN" ), wxT( "Cluster %p: no changeable items to propagate to" ),
642 cluster.get() );
643 }
644 }
645 else
646 {
647 wxLogTrace( wxT( "CN" ), wxT( "Cluster %p: connected to unused net" ),
648 cluster.get() );
649 }
650 }
651}
652
653
660
661
662void CN_CONNECTIVITY_ALGO::FillIsolatedIslandsMap( std::map<ZONE*, std::map<PCB_LAYER_ID, ISOLATED_ISLANDS>>& aMap,
663 bool aConnectivityAlreadyRebuilt )
664{
665 int progressDelta = 50;
666 int ii = 0;
667
668 progressDelta = std::max( progressDelta, (int) aMap.size() / 4 );
669
670 if( !aConnectivityAlreadyRebuilt )
671 {
672 for( const auto& [ zone, islands ] : aMap )
673 {
674 Remove( zone );
675 Add( zone );
676 ii++;
677
678 if( m_progressReporter && ( ii % progressDelta ) == 0 )
679 {
680 m_progressReporter->SetCurrentProgress( (double) ii / (double) aMap.size() );
681 m_progressReporter->KeepRefreshing( false );
682 }
683
684 if( m_progressReporter && m_progressReporter->IsCancelled() )
685 return;
686 }
687 }
688
690
691 for( auto& [ zone, zoneIslands ] : aMap )
692 {
693 for( auto& [ layer, layerIslands ] : zoneIslands )
694 {
695 if( zone->GetFilledPolysList( layer )->IsEmpty() )
696 continue;
697
698 bool notInConnectivity = true;
699
700 for( const std::shared_ptr<CN_CLUSTER>& cluster : m_connClusters )
701 {
702 for( CN_ITEM* item : *cluster )
703 {
704 if( item->Parent() == zone && item->GetBoardLayer() == layer )
705 {
706 CN_ZONE_LAYER* z = static_cast<CN_ZONE_LAYER*>( item );
707 notInConnectivity = false;
708
709 if( cluster->IsOrphaned() )
710 layerIslands.m_IsolatedOutlines.push_back( z->SubpolyIndex() );
711 else if( z->HasSingleConnection() )
712 layerIslands.m_SingleConnectionOutlines.push_back( z->SubpolyIndex() );
713 }
714 }
715 }
716
717 if( notInConnectivity )
718 layerIslands.m_IsolatedOutlines.push_back( 0 );
719 }
720 }
721}
722
723
729
730
732{
733 if( aNet < 0 )
734 return;
735
736 if( (int) m_dirtyNets.size() <= aNet )
737 {
738 int lastNet = m_dirtyNets.size() - 1;
739
740 if( lastNet < 0 )
741 lastNet = 0;
742
743 m_dirtyNets.resize( aNet + 1 );
744
745 for( int i = lastNet; i < aNet + 1; i++ )
746 m_dirtyNets[i] = true;
747 }
748
749 m_dirtyNets[aNet] = true;
750}
751
752
754{
755 PCB_LAYER_ID layer = aZoneLayer->GetLayer();
756 BOARD_CONNECTED_ITEM* item = aItem->Parent();
757
758 if( !item->IsOnLayer( layer ) )
759 return;
760
761 auto connect =
762 [&]()
763 {
764 // We don't propagate nets from zones, so any free-via net changes need to happen now.
765 // Defer the SetNetCode call to avoid data races during parallel connectivity search.
766 if( aItem->Parent()->Type() == PCB_VIA_T && aItem->CanChangeNet() )
767 {
768 std::lock_guard<std::mutex> lock( *m_deferredNetCodesMutex );
769 m_deferredNetCodes->emplace_back( aItem->Parent(), aZoneLayer->Net() );
770 }
771
772 aZoneLayer->Connect( aItem );
773 aItem->Connect( aZoneLayer );
774 };
775
776 // Try quick checks first...
777 if( item->Type() == PCB_PAD_T )
778 {
779 PAD* pad = static_cast<PAD*>( item );
780
781 if( pad->ConditionallyFlashed( layer )
782 && pad->GetZoneLayerOverride( layer ) == ZLO_FORCE_NO_ZONE_CONNECTION )
783 {
784 return;
785 }
786
787 // Don't connect zones to pads on backdrilled or post-machined layers
788 if( pad->IsBackdrilledOrPostMachined( layer ) )
789 return;
790 }
791 else if( item->Type() == PCB_VIA_T )
792 {
793 PCB_VIA* via = static_cast<PCB_VIA*>( item );
794
795 if( via->ConditionallyFlashed( layer )
796 && via->GetZoneLayerOverride( layer ) == ZLO_FORCE_NO_ZONE_CONNECTION )
797 {
798 return;
799 }
800
801 // Don't connect zones to vias on backdrilled or post-machined layers
802 if( via->IsBackdrilledOrPostMachined( layer ) )
803 return;
804 }
805
806 for( int i = 0; i < aItem->AnchorCount(); ++i )
807 {
808 if( aZoneLayer->ContainsPoint( aItem->GetAnchor( i ) ) )
809 {
810 connect();
811 return;
812 }
813 }
814
815 if( item->Type() == PCB_VIA_T || item->Type() == PCB_PAD_T )
816 {
817 // As long as the pad/via crosses the zone layer, check for the full effective shape
818 // We check for the overlapping layers above
819 if( aZoneLayer->Collide( item->GetEffectiveShape( layer, FLASHING::ALWAYS_FLASHED ).get() ) )
820 connect();
821
822 return;
823 }
824
825 if( aZoneLayer->Collide( item->GetEffectiveShape( layer ).get() ) )
826 connect();
827}
828
830{
831 // CN_ZONE_LAYER now caches its own copy of the outline, so we just check if it's non-empty.
832 if( !aZoneLayerA->HasValidOutline() || !aZoneLayerB->HasValidOutline() )
833 return;
834
835 const BOX2I& boxA = aZoneLayerA->BBox();
836 const BOX2I& boxB = aZoneLayerB->BBox();
837
838 PCB_LAYER_ID layer = aZoneLayerA->GetLayer();
839
840 if( aZoneLayerB->GetLayer() != layer )
841 return;
842
843 if( !boxA.Intersects( boxB ) )
844 return;
845
846 const SHAPE_LINE_CHAIN& outlineA = aZoneLayerA->GetOutline();
847
848 for( int i = 0; i < outlineA.PointCount(); i++ )
849 {
850 const VECTOR2I& pt = outlineA.CPoint( i );
851
852 if( !boxB.Contains( pt ) )
853 continue;
854
855 if( aZoneLayerB->ContainsPoint( pt ) )
856 {
857 aZoneLayerA->Connect( aZoneLayerB );
858 aZoneLayerB->Connect( aZoneLayerA );
859 return;
860 }
861 }
862
863 const SHAPE_LINE_CHAIN& outlineB = aZoneLayerB->GetOutline();
864
865 for( int i = 0; i < outlineB.PointCount(); i++ )
866 {
867 const VECTOR2I& pt = outlineB.CPoint( i );
868
869 if( !boxA.Contains( pt ) )
870 continue;
871
872 if( aZoneLayerA->ContainsPoint( pt ) )
873 {
874 aZoneLayerA->Connect( aZoneLayerB );
875 aZoneLayerB->Connect( aZoneLayerA );
876 return;
877 }
878 }
879}
880
881
883{
884 const BOARD_CONNECTED_ITEM* parentA = aCandidate->Parent();
885 const BOARD_CONNECTED_ITEM* parentB = m_item->Parent();
886
887 if( !aCandidate->Valid() || !m_item->Valid() )
888 return true;
889
890 if( parentA == parentB )
891 return true;
892
893 // Don't connect items in different nets that can't be changed
894 if( !aCandidate->CanChangeNet() && !m_item->CanChangeNet() && aCandidate->Net() != m_item->Net() )
895 return true;
896
897 // If both m_item and aCandidate are marked dirty, they will both be searched
898 // Since we are reciprocal in our connection, we arbitrarily pick one of the connections
899 // to conduct the expensive search
900 if( aCandidate->Dirty() && aCandidate < m_item )
901 return true;
902
903 // We should handle zone-zone connection separately
904 if ( parentA->Type() == PCB_ZONE_T && parentB->Type() == PCB_ZONE_T )
905 {
907 static_cast<CN_ZONE_LAYER*>( aCandidate ) );
908 return true;
909 }
910
911 if( parentA->Type() == PCB_ZONE_T )
912 {
913 checkZoneItemConnection( static_cast<CN_ZONE_LAYER*>( aCandidate ), m_item );
914 return true;
915 }
916
917 if( parentB->Type() == PCB_ZONE_T )
918 {
919 checkZoneItemConnection( static_cast<CN_ZONE_LAYER*>( m_item ), aCandidate );
920 return true;
921 }
922
923 LSET commonLayers = parentA->GetLayerSet() & parentB->GetLayerSet();
924
925 if( const BOARD* board = parentA->GetBoard() )
926 commonLayers &= board->GetEnabledLayers();
927
928 for( PCB_LAYER_ID layer : commonLayers )
929 {
932
933 if( parentA->Type() == PCB_PAD_T )
934 {
935 if( !static_cast<const PAD*>( parentA )->ConditionallyFlashed( layer ) )
936 flashingA = FLASHING::ALWAYS_FLASHED;
937 }
938 else if( parentA->Type() == PCB_VIA_T )
939 {
940 if( !static_cast<const PCB_VIA*>( parentA )->ConditionallyFlashed( layer ) )
941 flashingA = FLASHING::ALWAYS_FLASHED;
942 }
943
944 if( parentB->Type() == PCB_PAD_T )
945 {
946 if( !static_cast<const PAD*>( parentB )->ConditionallyFlashed( layer ) )
947 flashingB = FLASHING::ALWAYS_FLASHED;
948 }
949 else if( parentB->Type() == PCB_VIA_T )
950 {
951 if( !static_cast<const PCB_VIA*>( parentB )->ConditionallyFlashed( layer ) )
952 flashingB = FLASHING::ALWAYS_FLASHED;
953 }
954
955 if( parentA->GetEffectiveShape( layer, flashingA )->Collide(
956 parentB->GetEffectiveShape( layer, flashingB ).get() ) )
957 {
958 m_item->Connect( aCandidate );
959 aCandidate->Connect( m_item );
960 return true;
961 }
962 }
963
964 return true;
965};
966
967
969{
970 m_ratsnestClusters.clear();
971 m_connClusters.clear();
972 m_itemMap.clear();
973 m_itemList.Clear();
974
975}
976
981
982
984{
985 // Map of footprint -> map of pad number -> list of CN_ITEMs for pads with that number
986 std::map<FOOTPRINT*, std::map<wxString, std::vector<CN_ITEM*>>> padsByFootprint;
987
988 for( CN_ITEM* item : m_itemList )
989 {
990 if( !item->Valid() || item->Parent()->Type() != PCB_PAD_T )
991 continue;
992
993 auto pad = static_cast<const PAD*>( item->Parent() );
994
995 FOOTPRINT* fp = pad->GetParentFootprint();
996
997 padsByFootprint[fp][ pad->GetNumber() ].emplace_back( item );
998 }
999
1000 for( auto& [footprint, padsMap] : padsByFootprint )
1001 {
1002 if( footprint->GetDuplicatePadNumbersAreJumpers() )
1003 {
1004 for( const std::vector<CN_ITEM*>& padsList : padsMap | std::views::values )
1005 {
1006 for( size_t i = 0; i < padsList.size(); ++i )
1007 {
1008 for( size_t j = 1; j < padsList.size(); ++j )
1009 {
1010 padsList[i]->Connect( padsList[j] );
1011 padsList[j]->Connect( padsList[i] );
1012 }
1013 }
1014 }
1015 }
1016
1017 for( const std::set<wxString>& group : footprint->JumperPadGroups() )
1018 {
1019 std::vector<CN_ITEM*> toConnect;
1020
1021 for( const wxString& padNumber : group )
1022 std::ranges::copy( padsMap[padNumber], std::back_inserter( toConnect ) );
1023
1024 for( size_t i = 0; i < toConnect.size(); ++i )
1025 {
1026 for( size_t j = 1; j < toConnect.size(); ++j )
1027 {
1028 toConnect[i]->Connect( toConnect[j] );
1029 toConnect[j]->Connect( toConnect[i] );
1030 }
1031 }
1032 }
1033 }
1034}
@ ZLO_FORCE_NO_ZONE_CONNECTION
Definition board_item.h:75
BOX2< VECTOR2I > BOX2I
Definition box2.h:922
A base class derived from BOARD_ITEM for items that can be connected and have a net,...
A base class for any item which can be embedded within the BOARD container class, and therefore insta...
Definition board_item.h:84
virtual PCB_LAYER_ID GetLayer() const
Return the primary layer this item is on.
Definition board_item.h:237
virtual bool IsConnected() const
Returns information if the object is derived from BOARD_CONNECTED_ITEM.
Definition board_item.h:139
virtual bool IsOnLayer(PCB_LAYER_ID aLayer) const
Test to see if this object is on the given layer.
Definition board_item.h:319
virtual std::shared_ptr< SHAPE > GetEffectiveShape(PCB_LAYER_ID aLayer=UNDEFINED_LAYER, FLASHING aFlash=FLASHING::DEFAULT) const
Some pad shapes can be complex (rounded/chamfered rectangle), even without considering custom shapes.
virtual const BOARD * GetBoard() const
Return the BOARD in which this BOARD_ITEM resides, or NULL if none.
FOOTPRINT * GetParentFootprint() const
virtual LSET GetLayerSet() const
Return a std::bitset of all layers on which the item physically resides.
Definition board_item.h:257
virtual bool IsOnCopperLayer() const
Definition board_item.h:156
Information pertinent to a Pcbnew printed circuit board.
Definition board.h:322
const ZONES & Zones() const
Definition board.h:367
const FOOTPRINTS & Footprints() const
Definition board.h:363
const TRACKS & Tracks() const
Definition board.h:361
const LSET & GetEnabledLayers() const
A proxy function that calls the corresponding function in m_BoardSettings.
Definition board.cpp:968
const DRAWINGS & Drawings() const
Definition board.h:365
constexpr bool Contains(const Vec &aPoint) const
Definition box2.h:168
constexpr bool Intersects(const BOX2< Vec > &aRect) const
Definition box2.h:311
void FillIsolatedIslandsMap(std::map< ZONE *, std::map< PCB_LAYER_ID, ISOLATED_ISLANDS > > &aMap, bool aConnectivityAlreadyRebuilt)
Fill in the isolated islands map with copper islands that are not connected to a net.
bool Remove(BOARD_ITEM *aItem)
CONNECTIVITY_DATA * m_parentConnectivityData
void add(Container &c, BItem brditem)
PROGRESS_REPORTER * m_progressReporter
std::vector< std::shared_ptr< CN_CLUSTER > > m_connClusters
void propagateConnections(BOARD_COMMIT *aCommit=nullptr)
const CLUSTERS & GetClusters()
void LocalBuild(const std::shared_ptr< CONNECTIVITY_DATA > &aGlobalConnectivity, const std::vector< BOARD_ITEM * > &aLocalItems)
const CLUSTERS SearchClusters(CLUSTER_SEARCH_MODE aMode, bool aExcludeZones, int aSingleNet)
void markItemNetAsDirty(const BOARD_ITEM *aItem)
std::vector< std::shared_ptr< CN_CLUSTER > > m_ratsnestClusters
void PropagateNets(BOARD_COMMIT *aCommit=nullptr)
Propagate nets from pads to other items in clusters.
std::shared_ptr< CONNECTIVITY_DATA > m_globalConnectivityData
std::vector< bool > m_dirtyNets
std::unordered_map< const BOARD_ITEM *, ITEM_MAP_ENTRY > m_itemMap
void SetProgressReporter(PROGRESS_REPORTER *aReporter)
std::vector< std::shared_ptr< CN_CLUSTER > > CLUSTERS
void Build(BOARD *aBoard, PROGRESS_REPORTER *aReporter=nullptr)
bool Add(BOARD_ITEM *aItem)
CN_ITEM represents a BOARD_CONNETED_ITEM in the connectivity system (ie: a pad, track/arc/via,...
void Connect(CN_ITEM *b)
const BOX2I & BBox()
virtual int AnchorCount() const
const std::vector< CN_ITEM * > & ConnectedItems() const
int Net() const
bool Valid() const
virtual const VECTOR2I GetAnchor(int n) const
bool CanChangeNet() const
bool Dirty() const
BOARD_CONNECTED_ITEM * Parent() const
std::vector< std::pair< BOARD_CONNECTED_ITEM *, int > > * m_deferredNetCodes
Deferred net code changes collected during parallel connectivity search.
void checkZoneItemConnection(CN_ZONE_LAYER *aZoneLayer, CN_ITEM *aItem)
CN_ITEM * m_item
The item we are looking for connections to.
void checkZoneZoneConnection(CN_ZONE_LAYER *aZoneLayerA, CN_ZONE_LAYER *aZoneLayerB)
std::mutex * m_deferredNetCodesMutex
bool operator()(CN_ITEM *aCandidate)
const SHAPE_LINE_CHAIN & GetOutline() const
PCB_LAYER_ID GetLayer() const
bool Collide(SHAPE *aRefShape) const
int SubpolyIndex() const
bool ContainsPoint(const VECTOR2I &p) const
bool HasValidOutline() const
COMMIT & Modify(EDA_ITEM *aItem, BASE_SCREEN *aScreen=nullptr, RECURSE_MODE aRecurse=RECURSE_MODE::NO_RECURSE)
Modify a given item in the model.
Definition commit.h:106
KICAD_T Type() const
Returns the type of object.
Definition eda_item.h:111
std::deque< PAD * > & Pads()
Definition footprint.h:306
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
Handle the data for a net.
Definition netinfo.h:54
Definition pad.h:55
A small class to help profiling.
Definition profile.h:49
void Show(std::ostream &aStream=std::cerr)
Print the elapsed time (in a suitable unit) to a stream.
Definition profile.h:105
A progress reporter interface for use in multi-threaded environments.
virtual bool IsCancelled() const =0
virtual bool KeepRefreshing(bool aWait=false)=0
Update the UI (if any).
virtual void AdvanceProgress()=0
Increment the progress bar length (inside the current virtual zone).
virtual void SetCurrentProgress(double aProgress)=0
Set the progress value to aProgress (0..1).
Represent a polyline containing arcs as well as line segments: A chain of connected line and/or arc s...
int PointCount() const
Return the number of points (vertices) in this line chain.
const VECTOR2I & CPoint(int aIndex) const
Return a reference to a given point in the line chain.
virtual bool Collide(const VECTOR2I &aP, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const
Check if the boundary of shape (this) lies closer to the point aP than aClearance,...
Definition shape.h:181
Handle a list of polygons defining a copper zone.
Definition zone.h:73
virtual LSET GetLayerSet() const override
Return a std::bitset of all layers on which the item physically resides.
Definition zone.h:136
@ FP_JUST_ADDED
Definition footprint.h:89
a few functions useful in geometry calculations.
FLASHING
Enum used during connectivity building to ensure we do not query connectivity while building the data...
Definition layer_ids.h:184
@ NEVER_FLASHED
Never flashed for connectivity.
Definition layer_ids.h:187
@ ALWAYS_FLASHED
Always flashed for connectivity.
Definition layer_ids.h:186
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
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_ZONE_T
class ZONE, a copper pour area
Definition typeinfo.h:108
@ PCB_FOOTPRINT_T
class FOOTPRINT, a footprint
Definition typeinfo.h:86
@ 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_NETINFO_T
class NETINFO_ITEM, a description of a net
Definition typeinfo.h:110
@ PCB_TRACE_T
class PCB_TRACK, a track segment (segment on a copper layer)
Definition typeinfo.h:96
VECTOR2< int32_t > VECTOR2I
Definition vector2d.h:695