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 (C) 2020-2023 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
33#include <progress_reporter.h>
35#include <board_commit.h>
36#include <core/thread_pool.h>
37#include <pcb_shape.h>
38
39#include <wx/log.h>
40
41#ifdef PROFILE
42#include <core/profile.h>
43#endif
44
45
47{
48 markItemNetAsDirty( aItem );
49
50 switch( aItem->Type() )
51 {
52 case PCB_FOOTPRINT_T:
53 for( PAD* pad : static_cast<FOOTPRINT*>( aItem )->Pads() )
54 {
55 m_itemMap[pad].MarkItemsAsInvalid();
56 m_itemMap.erase( pad );
57 }
58
59 m_itemList.SetDirty( true );
60 break;
61
62 case PCB_PAD_T:
63 case PCB_TRACE_T:
64 case PCB_ARC_T:
65 case PCB_VIA_T:
66 case PCB_ZONE_T:
67 case PCB_SHAPE_T:
68 m_itemMap[aItem].MarkItemsAsInvalid();
69 m_itemMap.erase ( aItem );
70 m_itemList.SetDirty( true );
71 break;
72
73 default:
74 return false;
75 }
76
77 // Once we delete an item, it may connect between lists, so mark both as potentially invalid
79
80 return true;
81}
82
83
85{
86 if( aItem->IsConnected() )
87 {
88 const BOARD_CONNECTED_ITEM* citem = static_cast<const BOARD_CONNECTED_ITEM*>( aItem );
89 MarkNetAsDirty( citem->GetNetCode() );
90 }
91 else
92 {
93 if( aItem->Type() == PCB_FOOTPRINT_T )
94 {
95 const FOOTPRINT* footprint = static_cast<const FOOTPRINT*>( aItem );
96
97 for( PAD* pad : footprint->Pads() )
98 MarkNetAsDirty( pad->GetNetCode() );
99 }
100 }
101}
102
103
105{
106 if( !aItem->IsOnCopperLayer() )
107 return false;
108
109 auto alreadyAdded =
110 [this]( BOARD_ITEM* item )
111 {
112 auto it = m_itemMap.find( item );
113
114 if( it == m_itemMap.end() )
115 return false;
116
117 // Don't be fooled by an empty ITEM_MAP_ENTRY auto-created by operator[].
118 return !it->second.GetItems().empty();
119 };
120
121 switch( aItem->Type() )
122 {
123 case PCB_NETINFO_T:
124 MarkNetAsDirty( static_cast<NETINFO_ITEM*>( aItem )->GetNetCode() );
125 break;
126
127 case PCB_FOOTPRINT_T:
128 {
129 if( static_cast<FOOTPRINT*>( aItem )->GetAttributes() & FP_JUST_ADDED )
130 return false;
131
132 for( PAD* pad : static_cast<FOOTPRINT*>( aItem )->Pads() )
133 {
134 if( alreadyAdded( pad ) )
135 return false;
136
137 add( m_itemList, pad );
138 }
139
140 break;
141 }
142
143 case PCB_PAD_T:
144 {
145 if( FOOTPRINT* fp = aItem->GetParentFootprint() )
146 {
147 if( fp->GetAttributes() & FP_JUST_ADDED )
148 return false;
149 }
150
151 if( alreadyAdded( aItem ) )
152 return false;
153
154 add( m_itemList, static_cast<PAD*>( aItem ) );
155 break;
156 }
157
158 case PCB_TRACE_T:
159 if( alreadyAdded( aItem ) )
160 return false;
161
162 add( m_itemList, static_cast<PCB_TRACK*>( aItem ) );
163 break;
164
165 case PCB_ARC_T:
166 if( alreadyAdded( aItem ) )
167 return false;
168
169 add( m_itemList, static_cast<PCB_ARC*>( aItem ) );
170 break;
171
172 case PCB_VIA_T:
173 if( alreadyAdded( aItem ) )
174 return false;
175
176 add( m_itemList, static_cast<PCB_VIA*>( aItem ) );
177 break;
178
179 case PCB_SHAPE_T:
180 if( alreadyAdded( aItem ) )
181 return false;
182
183 if( !IsCopperLayer( aItem->GetLayer() ) )
184 return false;
185
186 add( m_itemList, static_cast<PCB_SHAPE*>( aItem ) );
187 break;
188
189 case PCB_ZONE_T:
190 {
191 ZONE* zone = static_cast<ZONE*>( aItem );
192
193 if( alreadyAdded( aItem ) )
194 return false;
195
196 m_itemMap[zone] = ITEM_MAP_ENTRY();
197
198 for( PCB_LAYER_ID layer : zone->GetLayerSet().Seq() )
199 {
200 for( CN_ITEM* zitem : m_itemList.Add( zone, layer ) )
201 m_itemMap[zone].Link( zitem );
202 }
203 }
204 break;
205
206 default:
207 return false;
208 }
209
210 markItemNetAsDirty( aItem );
211
212 return true;
213}
214
215
217{
218 for( CN_ITEM* item : m_itemList )
219 item->RemoveInvalidRefs();
220}
221
222
224{
225#ifdef PROFILE
226 PROF_TIMER garbage_collection( "garbage-collection" );
227#endif
228 std::vector<CN_ITEM*> garbage;
229 garbage.reserve( 1024 );
230
232
233 if( m_isLocal )
234 m_globalConnectivityData->RemoveInvalidRefs();
235
237
238 for( CN_ITEM* item : garbage )
239 delete item;
240
241#ifdef PROFILE
242 garbage_collection.Show();
243 PROF_TIMER search_basic( "search-basic" );
244#endif
245
247 std::vector<CN_ITEM*> dirtyItems;
248 std::copy_if( m_itemList.begin(), m_itemList.end(), std::back_inserter( dirtyItems ),
249 [] ( CN_ITEM* aItem )
250 {
251 return aItem->Dirty();
252 } );
253
255 {
256 m_progressReporter->SetMaxProgress( dirtyItems.size() );
257
259 return;
260 }
261
262 if( m_itemList.IsDirty() )
263 {
264
265 std::vector<std::future<size_t>> returns( dirtyItems.size() );
266
267 auto conn_lambda =
268 [&dirtyItems]( size_t aItem, CN_LIST* aItemList,
269 PROGRESS_REPORTER* aReporter) -> size_t
270 {
271 if( aReporter && aReporter->IsCancelled() )
272 return 0;
273
274 CN_VISITOR visitor( dirtyItems[aItem] );
275 aItemList->FindNearby( dirtyItems[aItem], visitor );
276
277 if( aReporter )
278 aReporter->AdvanceProgress();
279
280 return 1;
281 };
282
283 for( size_t ii = 0; ii < dirtyItems.size(); ++ii )
284 returns[ii] = tp.submit( conn_lambda, ii, &m_itemList, m_progressReporter );
285
286 for( const std::future<size_t>& ret : returns )
287 {
288 // Here we balance returns with a 250ms timeout to allow UI updating
289 std::future_status status = ret.wait_for( std::chrono::milliseconds( 250 ) );
290
291 while( status != std::future_status::ready )
292 {
295
296 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
297 }
298 }
299
302 }
303
304#ifdef PROFILE
305 search_basic.Show();
306#endif
307
309}
310
311
313{
314 if( aMode == CSM_PROPAGATE )
315 {
316 return SearchClusters( aMode,
318 PCB_SHAPE_T },
319 -1 );
320 }
321 else
322 {
323 return SearchClusters( aMode,
326 -1 );
327 }
328}
329
330
333 const std::initializer_list<KICAD_T>& aTypes,
334 int aSingleNet, CN_ITEM* rootItem )
335{
336 bool withinAnyNet = ( aMode != CSM_PROPAGATE );
337
338 std::deque<CN_ITEM*> Q;
339 std::set<CN_ITEM*> item_set;
340
341 CLUSTERS clusters;
342
343 if( m_itemList.IsDirty() )
345
346 auto addToSearchList =
347 [&item_set, withinAnyNet, aSingleNet, &aTypes, rootItem ]( CN_ITEM *aItem )
348 {
349 if( withinAnyNet && aItem->Net() <= 0 )
350 return;
351
352 if( !aItem->Valid() )
353 return;
354
355 if( aSingleNet >=0 && aItem->Net() != aSingleNet )
356 return;
357
358 bool found = false;
359
360 for( KICAD_T type : aTypes )
361 {
362 if( aItem->Parent()->Type() == type )
363 {
364 found = true;
365 break;
366 }
367 }
368
369 if( !found && aItem != rootItem )
370 return;
371
372 aItem->SetVisited( false );
373
374 item_set.insert( aItem );
375 };
376
377 std::for_each( m_itemList.begin(), m_itemList.end(), addToSearchList );
378
380 return CLUSTERS();
381
382 while( !item_set.empty() )
383 {
384 std::shared_ptr<CN_CLUSTER> cluster = std::make_shared<CN_CLUSTER>();
385 CN_ITEM* root;
386 auto it = item_set.begin();
387
388 while( it != item_set.end() && (*it)->Visited() )
389 it = item_set.erase( item_set.begin() );
390
391 if( it == item_set.end() )
392 break;
393
394 root = *it;
395 root->SetVisited( true );
396
397 Q.clear();
398 Q.push_back( root );
399
400 while( Q.size() )
401 {
402 CN_ITEM* current = Q.front();
403
404 Q.pop_front();
405 cluster->Add( current );
406
407 for( CN_ITEM* n : current->ConnectedItems() )
408 {
409 if( withinAnyNet && n->Net() != root->Net() )
410 continue;
411
412 if( !n->Visited() && n->Valid() )
413 {
414 n->SetVisited( true );
415 Q.push_back( n );
416 }
417 }
418 }
419
420 clusters.push_back( cluster );
421 }
422
424 return CLUSTERS();
425
426 std::sort( clusters.begin(), clusters.end(),
427 []( const std::shared_ptr<CN_CLUSTER>& a, const std::shared_ptr<CN_CLUSTER>& b )
428 {
429 return a->OriginNet() < b->OriginNet();
430 } );
431
432 return clusters;
433}
434
435
437{
438 // Generate CN_ZONE_LAYERs for each island on each layer of each zone
439 //
440 std::vector<CN_ZONE_LAYER*> zitems;
441
442 for( ZONE* zone : aBoard->Zones() )
443 {
444 if( zone->IsOnCopperLayer() )
445 {
446 m_itemMap[zone] = ITEM_MAP_ENTRY();
447 markItemNetAsDirty( zone );
448
449 for( PCB_LAYER_ID layer : zone->GetLayerSet().Seq() )
450 {
451 if( IsCopperLayer( layer ) )
452 {
453 for( int j = 0; j < zone->GetFilledPolysList( layer )->OutlineCount(); j++ )
454 zitems.push_back( new CN_ZONE_LAYER( zone, layer, j ) );
455 }
456 }
457 }
458 }
459
460 // Setup progress metrics
461 //
462 int progressDelta = 50;
463 double size = 0.0;
464
465 size += zitems.size(); // Once for building RTrees
466 size += zitems.size(); // Once for adding to connectivity
467 size += aBoard->Tracks().size();
468 size += aBoard->Drawings().size();
469
470 for( FOOTPRINT* footprint : aBoard->Footprints() )
471 size += footprint->Pads().size();
472
473 size *= 1.5; // Our caller gets the other third of the progress bar
474
475 progressDelta = std::max( progressDelta, (int) size / 4 );
476
477 auto report =
478 [&]( int progress )
479 {
480 if( aReporter && ( progress % progressDelta ) == 0 )
481 {
482 aReporter->SetCurrentProgress( progress / size );
483 aReporter->KeepRefreshing( false );
484 }
485 };
486
487 // Generate RTrees for CN_ZONE_LAYER items (in parallel)
488 //
490 std::vector<std::future<size_t>> returns( zitems.size() );
491
492 auto cache_zones =
493 [aReporter]( CN_ZONE_LAYER* aZoneLayer ) -> size_t
494 {
495 if( aReporter && aReporter->IsCancelled() )
496 return 0;
497
498 aZoneLayer->BuildRTree();
499
500 if( aReporter )
501 aReporter->AdvanceProgress();
502
503 return 1;
504 };
505
506 for( size_t ii = 0; ii < zitems.size(); ++ii )
507 returns[ii] = tp.submit( cache_zones, zitems[ii] );
508
509 for( const std::future<size_t>& ret : returns )
510 {
511 std::future_status status = ret.wait_for( std::chrono::milliseconds( 250 ) );
512
513 while( status != std::future_status::ready )
514 {
515 if( aReporter )
516 aReporter->KeepRefreshing();
517
518 status = ret.wait_for( std::chrono::milliseconds( 250 ) );
519 }
520
521 }
522
523 // Add CN_ZONE_LAYERS, tracks, and pads to connectivity
524 //
525 int ii = zitems.size();
526
527 for( CN_ZONE_LAYER* zitem : zitems )
528 {
529 m_itemList.Add( zitem );
530 m_itemMap[ zitem->Parent() ].Link( zitem );
531 report( ++ii );
532 }
533
534 for( PCB_TRACK* tv : aBoard->Tracks() )
535 {
536 Add( tv );
537 report( ++ii );
538 }
539
540 for( FOOTPRINT* footprint : aBoard->Footprints() )
541 {
542 for( PAD* pad : footprint->Pads() )
543 {
544 Add( pad );
545 report( ++ii );
546 }
547 }
548
549 for( BOARD_ITEM* drawing : aBoard->Drawings() )
550 {
551 if( PCB_SHAPE* shape = dynamic_cast<PCB_SHAPE*>( drawing ) )
552 {
553 if( shape->IsOnCopperLayer() )
554 Add( shape );
555 }
556
557 report( ++ii );
558 }
559
560 if( aReporter )
561 {
562 aReporter->SetCurrentProgress( (double) ii / (double) size );
563 aReporter->KeepRefreshing( false );
564 }
565}
566
567
568void CN_CONNECTIVITY_ALGO::LocalBuild( std::shared_ptr<CONNECTIVITY_DATA> aGlobalConnectivity,
569 const std::vector<BOARD_ITEM*>& aLocalItems )
570{
571 m_isLocal = true;
572 m_globalConnectivityData = aGlobalConnectivity;
573
574 for( BOARD_ITEM* item : aLocalItems )
575 {
576 switch( item->Type() )
577 {
578 case PCB_TRACE_T:
579 case PCB_ARC_T:
580 case PCB_VIA_T:
581 case PCB_PAD_T:
582 case PCB_FOOTPRINT_T:
583 case PCB_SHAPE_T:
584 Add( item );
585 break;
586
587 default:
588 break;
589 }
590 }
591}
592
593
595{
596 for( const std::shared_ptr<CN_CLUSTER>& cluster : m_connClusters )
597 {
598 if( cluster->IsConflicting() )
599 {
600 // Conflicting pads in cluster: we don't know the user's intent so best to do
601 // nothing.
602 wxLogTrace( wxT( "CN" ), wxT( "Conflicting pads in cluster %p; skipping propagation" ),
603 cluster.get() );
604 }
605 else if( cluster->HasValidNet() )
606 {
607 // Propagate from the origin (will be a pad if there are any, or another item if
608 // there are no pads).
609 int n_changed = 0;
610
611 for( CN_ITEM* item : *cluster )
612 {
613 if( item->Valid() && item->CanChangeNet()
614 && item->Parent()->GetNetCode() != cluster->OriginNet() )
615 {
616 MarkNetAsDirty( item->Parent()->GetNetCode() );
617 MarkNetAsDirty( cluster->OriginNet() );
618
619 if( aCommit )
620 aCommit->Modify( item->Parent() );
621
622 item->Parent()->SetNetCode( cluster->OriginNet() );
623 n_changed++;
624 }
625 }
626
627 if( n_changed )
628 {
629 wxLogTrace( wxT( "CN" ), wxT( "Cluster %p: net: %d %s" ),
630 cluster.get(),
631 cluster->OriginNet(),
632 (const char*) cluster->OriginNetName().c_str() );
633 }
634 else
635 {
636 wxLogTrace( wxT( "CN" ), wxT( "Cluster %p: no changeable items to propagate to" ),
637 cluster.get() );
638 }
639 }
640 else
641 {
642 wxLogTrace( wxT( "CN" ), wxT( "Cluster %p: connected to unused net" ),
643 cluster.get() );
644 }
645 }
646}
647
648
650{
652 propagateConnections( aCommit );
653}
654
655
657 std::map<ZONE*, std::map<PCB_LAYER_ID, ISOLATED_ISLANDS>>& aMap,
658 bool aConnectivityAlreadyRebuilt )
659{
660 int progressDelta = 50;
661 int ii = 0;
662
663 progressDelta = std::max( progressDelta, (int) aMap.size() / 4 );
664
665 if( !aConnectivityAlreadyRebuilt )
666 {
667 for( const auto& [ zone, islands ] : aMap )
668 {
669 Remove( zone );
670 Add( zone );
671 ii++;
672
673 if( m_progressReporter && ( ii % progressDelta ) == 0 )
674 {
675 m_progressReporter->SetCurrentProgress( (double) ii / (double) aMap.size() );
677 }
678
680 return;
681 }
682 }
683
685
686 for( auto& [ zone, zoneIslands ] : aMap )
687 {
688 for( auto& [ layer, layerIslands ] : zoneIslands )
689 {
690 if( zone->GetFilledPolysList( layer )->IsEmpty() )
691 continue;
692
693 for( const std::shared_ptr<CN_CLUSTER>& cluster : m_connClusters )
694 {
695 for( CN_ITEM* item : *cluster )
696 {
697 if( item->Parent() == zone && item->Layer() == layer )
698 {
699 CN_ZONE_LAYER* z = static_cast<CN_ZONE_LAYER*>( item );
700
701 if( cluster->IsOrphaned() )
702 layerIslands.m_IsolatedOutlines.push_back( z->SubpolyIndex() );
703 else if( z->HasSingleConnection() )
704 layerIslands.m_SingleConnectionOutlines.push_back( z->SubpolyIndex() );
705 }
706 }
707 }
708 }
709 }
710}
711
712
714{
716 return m_ratsnestClusters;
717}
718
719
721{
722 if( aNet < 0 )
723 return;
724
725 if( (int) m_dirtyNets.size() <= aNet )
726 {
727 int lastNet = m_dirtyNets.size() - 1;
728
729 if( lastNet < 0 )
730 lastNet = 0;
731
732 m_dirtyNets.resize( aNet + 1 );
733
734 for( int i = lastNet; i < aNet + 1; i++ )
735 m_dirtyNets[i] = true;
736 }
737
738 m_dirtyNets[aNet] = true;
739}
740
741
743{
744 PCB_LAYER_ID layer = aZoneLayer->GetLayer();
745 BOARD_CONNECTED_ITEM* item = aItem->Parent();
746
747 if( !item->IsOnLayer( layer ) )
748 return;
749
750 auto connect =
751 [&]()
752 {
753 aZoneLayer->Connect( aItem );
754 aItem->Connect( aZoneLayer );
755 };
756
757 // Try quick checks first...
758 if( item->Type() == PCB_PAD_T )
759 {
760 PAD* pad = static_cast<PAD*>( item );
761
762 if( pad->ConditionallyFlashed( layer )
763 && pad->GetZoneLayerOverride( layer ) == ZLO_FORCE_NO_ZONE_CONNECTION )
764 {
765 return;
766 }
767 }
768 else if( item->Type() == PCB_VIA_T )
769 {
770 PCB_VIA* via = static_cast<PCB_VIA*>( item );
771
772 if( via->ConditionallyFlashed( layer )
773 && via->GetZoneLayerOverride( layer ) == ZLO_FORCE_NO_ZONE_CONNECTION )
774 {
775 return;
776 }
777 }
778
779 for( int i = 0; i < aItem->AnchorCount(); ++i )
780 {
781 if( aZoneLayer->ContainsPoint( aItem->GetAnchor( i ) ) )
782 {
783 connect();
784 return;
785 }
786 }
787
788 if( item->Type() == PCB_VIA_T || item->Type() == PCB_PAD_T )
789 {
790 // As long as the pad/via crosses the zone layer, check for the full effective shape
791 // We check for the overlapping layers above
792 if( aZoneLayer->Collide( item->GetEffectiveShape( layer, FLASHING::ALWAYS_FLASHED ).get() ) )
793 connect();
794
795 return;
796 }
797
798 if( aZoneLayer->Collide( item->GetEffectiveShape( layer ).get() ) )
799 connect();
800}
801
803{
804 const ZONE* zoneA = static_cast<const ZONE*>( aZoneLayerA->Parent() );
805 const ZONE* zoneB = static_cast<const ZONE*>( aZoneLayerB->Parent() );
806
807 const BOX2I& boxA = aZoneLayerA->BBox();
808 const BOX2I& boxB = aZoneLayerB->BBox();
809
810 PCB_LAYER_ID layer = aZoneLayerA->GetLayer();
811
812 if( aZoneLayerB->GetLayer() != layer )
813 return;
814
815 if( !boxA.Intersects( boxB ) )
816 return;
817
818 const SHAPE_LINE_CHAIN& outline =
819 zoneA->GetFilledPolysList( layer )->COutline( aZoneLayerA->SubpolyIndex() );
820
821 for( int i = 0; i < outline.PointCount(); i++ )
822 {
823 if( !boxB.Contains( outline.CPoint( i ) ) )
824 continue;
825
826 if( aZoneLayerB->ContainsPoint( outline.CPoint( i ) ) )
827 {
828 aZoneLayerA->Connect( aZoneLayerB );
829 aZoneLayerB->Connect( aZoneLayerA );
830 return;
831 }
832 }
833
834 const SHAPE_LINE_CHAIN& outline2 =
835 zoneB->GetFilledPolysList( layer )->COutline( aZoneLayerB->SubpolyIndex() );
836
837 for( int i = 0; i < outline2.PointCount(); i++ )
838 {
839 if( !boxA.Contains( outline2.CPoint( i ) ) )
840 continue;
841
842 if( aZoneLayerA->ContainsPoint( outline2.CPoint( i ) ) )
843 {
844 aZoneLayerA->Connect( aZoneLayerB );
845 aZoneLayerB->Connect( aZoneLayerA );
846 return;
847 }
848 }
849}
850
851
853{
854 const BOARD_CONNECTED_ITEM* parentA = aCandidate->Parent();
855 const BOARD_CONNECTED_ITEM* parentB = m_item->Parent();
856
857 if( !aCandidate->Valid() || !m_item->Valid() )
858 return true;
859
860 if( parentA == parentB )
861 return true;
862
863 // Don't connect items in different nets that can't be changed
864 if( !aCandidate->CanChangeNet() && !m_item->CanChangeNet() && aCandidate->Net() != m_item->Net() )
865 return true;
866
867 // If both m_item and aCandidate are marked dirty, they will both be searched
868 // Since we are reciprocal in our connection, we arbitrarily pick one of the connections
869 // to conduct the expensive search
870 if( aCandidate->Dirty() && aCandidate < m_item )
871 return true;
872
873 // We should handle zone-zone connection separately
874 if ( parentA->Type() == PCB_ZONE_T && parentB->Type() == PCB_ZONE_T )
875 {
877 static_cast<CN_ZONE_LAYER*>( aCandidate ) );
878 return true;
879 }
880
881 if( parentA->Type() == PCB_ZONE_T )
882 {
883 checkZoneItemConnection( static_cast<CN_ZONE_LAYER*>( aCandidate ), m_item );
884 return true;
885 }
886
887 if( parentB->Type() == PCB_ZONE_T )
888 {
889 checkZoneItemConnection( static_cast<CN_ZONE_LAYER*>( m_item ), aCandidate );
890 return true;
891 }
892
893 LSET commonLayers = parentA->GetLayerSet() & parentB->GetLayerSet();
894
895 for( PCB_LAYER_ID layer : commonLayers.Seq() )
896 {
897 FLASHING flashingA = FLASHING::NEVER_FLASHED;
898 FLASHING flashingB = FLASHING::NEVER_FLASHED;
899
900 if( parentA->Type() == PCB_PAD_T )
901 {
902 if( !static_cast<const PAD*>( parentA )->ConditionallyFlashed( layer ) )
903 flashingA = FLASHING::ALWAYS_FLASHED;
904 }
905 else if( parentA->Type() == PCB_VIA_T )
906 {
907 if( !static_cast<const PCB_VIA*>( parentA )->ConditionallyFlashed( layer ) )
908 flashingA = FLASHING::ALWAYS_FLASHED;
909 }
910
911 if( parentB->Type() == PCB_PAD_T )
912 {
913 if( !static_cast<const PAD*>( parentB )->ConditionallyFlashed( layer ) )
914 flashingB = FLASHING::ALWAYS_FLASHED;
915 }
916 else if( parentB->Type() == PCB_VIA_T )
917 {
918 if( !static_cast<const PCB_VIA*>( parentB )->ConditionallyFlashed( layer ) )
919 flashingB = FLASHING::ALWAYS_FLASHED;
920 }
921
922 if( parentA->GetEffectiveShape( layer, flashingA )->Collide(
923 parentB->GetEffectiveShape( layer, flashingB ).get() ) )
924 {
925 m_item->Connect( aCandidate );
926 aCandidate->Connect( m_item );
927 return true;
928 }
929 }
930
931 return true;
932};
933
934
936{
937 m_ratsnestClusters.clear();
938 m_connClusters.clear();
939 m_itemMap.clear();
941
942}
943
945{
946 m_progressReporter = aReporter;
947}
@ ZLO_FORCE_NO_ZONE_CONNECTION
Definition: board_item.h:67
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:77
virtual PCB_LAYER_ID GetLayer() const
Return the primary layer this item is on.
Definition: board_item.h:226
virtual bool IsConnected() const
Returns information if the object is derived from BOARD_CONNECTED_ITEM.
Definition: board_item.h:134
virtual bool IsOnLayer(PCB_LAYER_ID aLayer) const
Test to see if this object is on the given layer.
Definition: board_item.h:291
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.
Definition: board_item.cpp:228
FOOTPRINT * GetParentFootprint() const
Definition: board_item.cpp:248
virtual LSET GetLayerSet() const
Return a std::bitset of all layers on which the item physically resides.
Definition: board_item.h:231
virtual bool IsOnCopperLayer() const
Definition: board_item.h:151
Information pertinent to a Pcbnew printed circuit board.
Definition: board.h:276
ZONES & Zones()
Definition: board.h:324
FOOTPRINTS & Footprints()
Definition: board.h:318
TRACKS & Tracks()
Definition: board.h:315
DRAWINGS & Drawings()
Definition: board.h:321
bool Intersects(const BOX2< Vec > &aRect) const
Definition: box2.h:270
bool Contains(const Vec &aPoint) const
Definition: box2.h:142
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 LocalBuild(std::shared_ptr< CONNECTIVITY_DATA > aGlobalConnectivity, const std::vector< BOARD_ITEM * > &aLocalItems)
void propagateConnections(BOARD_COMMIT *aCommit=nullptr)
const CLUSTERS & GetClusters()
const CLUSTERS SearchClusters(CLUSTER_SEARCH_MODE aMode, const std::initializer_list< KICAD_T > &aTypes, int aSingleNet, CN_ITEM *rootItem=nullptr)
void MarkNetAsDirty(int aNet)
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::vector< std::shared_ptr< CN_CLUSTER > > CLUSTERS
std::unordered_map< const BOARD_ITEM *, ITEM_MAP_ENTRY > m_itemMap
void SetProgressReporter(PROGRESS_REPORTER *aReporter)
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
void SetVisited(bool aVisited)
bool Dirty() const
BOARD_CONNECTED_ITEM * Parent() const
CN_ITEM * Add(PAD *pad)
std::vector< CN_ITEM * >::iterator begin()
void SetDirty(bool aDirty=true)
bool IsDirty() const
std::vector< CN_ITEM * >::iterator end()
void ClearDirtyFlags()
void SetHasInvalid(bool aInvalid=true)
void RemoveInvalidItems(std::vector< CN_ITEM * > &aGarbage)
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)
bool operator()(CN_ITEM *aCandidate)
PCB_LAYER_ID GetLayer() const
bool Collide(SHAPE *aRefShape) const
int SubpolyIndex() const
bool ContainsPoint(const VECTOR2I &p) const
COMMIT & Modify(EDA_ITEM *aItem, BASE_SCREEN *aScreen=nullptr)
Create an undo entry for an item that has been already modified.
Definition: commit.h:105
KICAD_T Type() const
Returns the type of object.
Definition: eda_item.h:97
PADS & Pads()
Definition: footprint.h:188
LSET is a set of PCB_LAYER_IDs.
Definition: layer_ids.h:573
LSEQ Seq(const PCB_LAYER_ID *aWishListSequence, unsigned aCount) const
Return an LSEQ from the union of this LSET and a desired sequence.
Definition: lset.cpp:418
Handle the data for a net.
Definition: netinfo.h:56
Definition: pad.h:59
A small class to help profiling.
Definition: profile.h:47
void Show(std::ostream &aStream=std::cerr)
Print the elapsed time (in a suitable unit) to a stream.
Definition: profile.h:103
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).
virtual void SetMaxProgress(int aMaxProgress)=0
Fix the value that gives the 100 percent progress bar length (inside the current virtual zone).
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.
Handle a list of polygons defining a copper zone.
Definition: zone.h:72
const std::shared_ptr< SHAPE_POLY_SET > & GetFilledPolysList(PCB_LAYER_ID aLayer) const
Definition: zone.h:615
virtual LSET GetLayerSet() const override
Return a std::bitset of all layers on which the item physically resides.
Definition: zone.h:129
@ FP_JUST_ADDED
Definition: footprint.h:77
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:148
bool IsCopperLayer(int aLayerId)
Tests whether a layer is a copper layer.
Definition: layer_ids.h:879
PCB_LAYER_ID
A quick note on layer IDs:
Definition: layer_ids.h:60
static thread_pool * tp
Definition: thread_pool.cpp:30
BS::thread_pool thread_pool
Definition: thread_pool.h:30
thread_pool & GetKiCadThreadPool()
Get a reference to the current thread pool.
Definition: thread_pool.cpp:32
KICAD_T
The set of class identification values stored in EDA_ITEM::m_structType.
Definition: typeinfo.h:78
@ 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:107
@ 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:109
@ PCB_TRACE_T
class PCB_TRACK, a track segment (segment on a copper layer)
Definition: typeinfo.h:96