KiCad PCB EDA Suite
CONNECTION_SUBGRAPH Class Reference

A subgraph is a set of items that are electrically connected on a single sheet. More...

#include <connection_graph.h>

Public Types

enum  PRIORITY {
  PRIORITY_NONE = 0, PRIORITY_PIN, PRIORITY_SHEET_PIN, PRIORITY_HIER_LABEL,
  PRIORITY_LOCAL_LABEL, PRIORITY_POWER_PIN, PRIORITY_GLOBAL
}
 

Public Member Functions

 CONNECTION_SUBGRAPH (SCH_EDIT_FRAME *aFrame)
 
bool ResolveDrivers (bool aCreateMarkers=false)
 Determines which potential driver should drive the subgraph. More...
 
wxString GetNetName () const
 Returns the fully-qualified net name for this subgraph (if one exists) More...
 
std::vector< SCH_ITEM * > GetBusLabels () const
 Returns all the bus labels attached to this subgraph (if any) More...
 
wxString GetNameForDriver (SCH_ITEM *aItem) const
 Returns the candidate net name for a driver. More...
 
void Absorb (CONNECTION_SUBGRAPH *aOther)
 Combines another subgraph on the same sheet into this one. More...
 
void AddItem (SCH_ITEM *aItem)
 Adds a new item to the subgraph. More...
 
void UpdateItemConnections ()
 Updates all items to match the driver connection. More...
 

Static Public Member Functions

static PRIORITY GetDriverPriority (SCH_ITEM *aDriver)
 Returns the priority (higher is more important) of a candidate driver. More...
 

Public Attributes

bool m_dirty
 
bool m_absorbed
 True if this subgraph has been absorbed into another. No pointers here are safe if so! More...
 
CONNECTION_SUBGRAPHm_absorbed_by
 If this subgraph is absorbed, points to the absorbing (and valid) subgraph. More...
 
long m_code
 
bool m_multiple_drivers
 True if this subgraph contains more than one driver that should be shorted together in the netlist. More...
 
bool m_strong_driver
 True if the driver is "strong": a label or power object. More...
 
bool m_local_driver
 True if the driver is a local (i.e. non-global) type. More...
 
SCH_ITEMm_no_connect
 No-connect item in graph, if any. More...
 
SCH_ITEMm_bus_entry
 Bus entry in graph, if any. More...
 
std::vector< SCH_ITEM * > m_items
 
std::vector< SCH_ITEM * > m_drivers
 
SCH_ITEMm_driver
 
SCH_SHEET_PATH m_sheet
 
SCH_EDIT_FRAMEm_frame
 
SCH_CONNECTIONm_driver_connection
 Cache for driver connection. More...
 
std::unordered_map< std::shared_ptr< SCH_CONNECTION >, std::unordered_set< CONNECTION_SUBGRAPH * > > m_bus_neighbors
 If a subgraph is a bus, this map contains links between the bus members and any local sheet neighbors with the same connection name. More...
 
std::unordered_map< std::shared_ptr< SCH_CONNECTION >, std::unordered_set< CONNECTION_SUBGRAPH * > > m_bus_parents
 If this is a net, this vector contains links to any same-sheet buses that contain it. More...
 
std::vector< SCH_SHEET_PIN * > m_hier_pins
 
std::vector< SCH_HIERLABEL * > m_hier_ports
 

Detailed Description

A subgraph is a set of items that are electrically connected on a single sheet.

For example, a label connected to a wire and so on. A net is composed of one or more subgraphs.

A set of items that appears to be physically connected may actually be more than one subgraph, because some items don't connect electrically.

For example, multiple bus wires can come together at a junction but have different labels on each branch. Each label+wire branch is its own subgraph.

Definition at line 58 of file connection_graph.h.

Member Enumeration Documentation

◆ PRIORITY

Constructor & Destructor Documentation

◆ CONNECTION_SUBGRAPH()

CONNECTION_SUBGRAPH::CONNECTION_SUBGRAPH ( SCH_EDIT_FRAME aFrame)
inline

Definition at line 72 of file connection_graph.h.

72  :
73  m_dirty( false ), m_absorbed( false ), m_code( -1 ), m_multiple_drivers( false ),
74  m_strong_driver( false ), m_no_connect( nullptr ), m_bus_entry( nullptr ),
75  m_driver( nullptr ), m_frame( aFrame ), m_driver_connection( nullptr )
76  {}
SCH_CONNECTION * m_driver_connection
Cache for driver connection.
SCH_ITEM * m_bus_entry
Bus entry in graph, if any.
SCH_EDIT_FRAME * m_frame
bool m_absorbed
True if this subgraph has been absorbed into another. No pointers here are safe if so!
bool m_multiple_drivers
True if this subgraph contains more than one driver that should be shorted together in the netlist.
bool m_strong_driver
True if the driver is "strong": a label or power object.
SCH_ITEM * m_no_connect
No-connect item in graph, if any.

Member Function Documentation

◆ Absorb()

void CONNECTION_SUBGRAPH::Absorb ( CONNECTION_SUBGRAPH aOther)

Combines another subgraph on the same sheet into this one.

Definition at line 262 of file connection_graph.cpp.

263 {
264  wxASSERT( m_sheet == aOther->m_sheet );
265 
266  for( SCH_ITEM* item : aOther->m_items )
267  {
269  AddItem( item );
270  }
271 
272  m_bus_neighbors.insert( aOther->m_bus_neighbors.begin(), aOther->m_bus_neighbors.end() );
273  m_bus_parents.insert( aOther->m_bus_parents.begin(), aOther->m_bus_parents.end() );
274 
275  aOther->m_absorbed = true;
276  aOther->m_dirty = false;
277  aOther->m_driver = nullptr;
278  aOther->m_driver_connection = nullptr;
279  aOther->m_absorbed_by = this;
280 }
SCH_SHEET_PATH m_sheet
SCH_CONNECTION * m_driver_connection
Cache for driver connection.
std::unordered_map< std::shared_ptr< SCH_CONNECTION >, std::unordered_set< CONNECTION_SUBGRAPH * > > m_bus_neighbors
If a subgraph is a bus, this map contains links between the bus members and any local sheet neighbors...
bool m_absorbed
True if this subgraph has been absorbed into another. No pointers here are safe if so!
std::unordered_map< std::shared_ptr< SCH_CONNECTION >, std::unordered_set< CONNECTION_SUBGRAPH * > > m_bus_parents
If this is a net, this vector contains links to any same-sheet buses that contain it.
void SetSubgraphCode(int aCode)
std::vector< SCH_ITEM * > m_items
void AddItem(SCH_ITEM *aItem)
Adds a new item to the subgraph.
SCH_CONNECTION * Connection(const SCH_SHEET_PATH &aPath) const
Retrieves the connection associated with this object in the given sheet.
Definition: sch_item.cpp:127
CONNECTION_SUBGRAPH * m_absorbed_by
If this subgraph is absorbed, points to the absorbing (and valid) subgraph.
Class SCH_ITEM is a base class for any item which can be embedded within the SCHEMATIC container clas...
Definition: sch_item.h:114

References AddItem(), SCH_ITEM::Connection(), m_absorbed, m_absorbed_by, m_bus_neighbors, m_bus_parents, m_code, m_dirty, m_driver, m_driver_connection, m_items, m_sheet, and SCH_CONNECTION::SetSubgraphCode().

◆ AddItem()

void CONNECTION_SUBGRAPH::AddItem ( SCH_ITEM aItem)

Adds a new item to the subgraph.

Definition at line 283 of file connection_graph.cpp.

284 {
285  m_items.push_back( aItem );
286 
287  if( aItem->Connection( m_sheet )->IsDriver() )
288  m_drivers.push_back( aItem );
289 
290  if( aItem->Type() == SCH_SHEET_PIN_T )
291  m_hier_pins.push_back( static_cast<SCH_SHEET_PIN*>( aItem ) );
292  else if( aItem->Type() == SCH_HIER_LABEL_T )
293  m_hier_ports.push_back( static_cast<SCH_HIERLABEL*>( aItem ) );
294 }
SCH_SHEET_PATH m_sheet
std::vector< SCH_SHEET_PIN * > m_hier_pins
std::vector< SCH_ITEM * > m_items
std::vector< SCH_ITEM * > m_drivers
bool IsDriver() const
Checks if the SCH_ITEM this connection is attached to can drive connections Drivers can be labels,...
std::vector< SCH_HIERLABEL * > m_hier_ports
SCH_CONNECTION * Connection(const SCH_SHEET_PATH &aPath) const
Retrieves the connection associated with this object in the given sheet.
Definition: sch_item.cpp:127
KICAD_T Type() const
Function Type()
Definition: base_struct.h:204

References SCH_ITEM::Connection(), SCH_CONNECTION::IsDriver(), m_drivers, m_hier_pins, m_hier_ports, m_items, m_sheet, SCH_HIER_LABEL_T, SCH_SHEET_PIN_T, and EDA_ITEM::Type().

Referenced by Absorb(), and CONNECTION_GRAPH::buildConnectionGraph().

◆ GetBusLabels()

std::vector< SCH_ITEM * > CONNECTION_SUBGRAPH::GetBusLabels ( ) const

Returns all the bus labels attached to this subgraph (if any)

Definition at line 207 of file connection_graph.cpp.

208 {
209  std::vector<SCH_ITEM*> labels;
210 
211  for( auto item : m_drivers )
212  {
213  switch( item->Type() )
214  {
215  case SCH_LABEL_T:
216  case SCH_GLOBAL_LABEL_T:
217  {
218  auto label_conn = item->Connection( m_sheet );
219 
220  // Only consider bus vectors
221  if( label_conn->Type() == CONNECTION_BUS )
222  labels.push_back( item );
223  }
224  default: break;
225  }
226  }
227 
228  return labels;
229 }
SCH_SHEET_PATH m_sheet
std::vector< SCH_ITEM * > m_drivers
This item represents a bus vector.

References CONNECTION_BUS, m_drivers, m_sheet, SCH_GLOBAL_LABEL_T, and SCH_LABEL_T.

◆ GetDriverPriority()

CONNECTION_SUBGRAPH::PRIORITY CONNECTION_SUBGRAPH::GetDriverPriority ( SCH_ITEM aDriver)
static

Returns the priority (higher is more important) of a candidate driver.

0: Invalid driver 1: Component pin 2: Hierarchical sheet pin 3: Hierarchical label 4: Local label 5: Power pin 6: Global label

Parameters
aDriveris the item to inspect
Returns
a PRIORITY

Definition at line 324 of file connection_graph.cpp.

325 {
326  if( !aDriver )
327  return PRIORITY_NONE;
328 
329  switch( aDriver->Type() )
330  {
331  case SCH_SHEET_PIN_T: return PRIORITY_SHEET_PIN;
333  case SCH_LABEL_T: return PRIORITY_LOCAL_LABEL;
334  case SCH_GLOBAL_LABEL_T: return PRIORITY_GLOBAL;
335  case SCH_PIN_T:
336  {
337  auto sch_pin = static_cast<SCH_PIN*>( aDriver );
338 
339  if( sch_pin->IsPowerConnection() )
340  return PRIORITY_POWER_PIN;
341  else
342  return PRIORITY_PIN;
343  }
344 
345  default: return PRIORITY_NONE;
346  }
347 }
KICAD_T Type() const
Function Type()
Definition: base_struct.h:204

References PRIORITY_GLOBAL, PRIORITY_HIER_LABEL, PRIORITY_LOCAL_LABEL, PRIORITY_NONE, PRIORITY_PIN, PRIORITY_POWER_PIN, PRIORITY_SHEET_PIN, SCH_GLOBAL_LABEL_T, SCH_HIER_LABEL_T, SCH_LABEL_T, SCH_PIN_T, SCH_SHEET_PIN_T, and EDA_ITEM::Type().

Referenced by CONNECTION_GRAPH::propagateToNeighbors(), and ResolveDrivers().

◆ GetNameForDriver()

wxString CONNECTION_SUBGRAPH::GetNameForDriver ( SCH_ITEM aItem) const

Returns the candidate net name for a driver.

Definition at line 232 of file connection_graph.cpp.

233 {
234  wxString name;
235 
236  switch( aItem->Type() )
237  {
238  case SCH_PIN_T:
239  {
240  auto power_object = static_cast<SCH_PIN*>( aItem );
241  name = power_object->GetDefaultNetName( m_sheet );
242  break;
243  }
244 
245  case SCH_LABEL_T:
246  case SCH_GLOBAL_LABEL_T:
247  case SCH_HIER_LABEL_T:
248  case SCH_SHEET_PIN_T:
249  {
250  name = static_cast<SCH_TEXT*>( aItem )->GetText();
251  break;
252  }
253 
254  default:
255  break;
256  }
257 
258  return name;
259 }
SCH_SHEET_PATH m_sheet
const char * name
Definition: DXF_plotter.cpp:61
KICAD_T Type() const
Function Type()
Definition: base_struct.h:204

References m_sheet, name, SCH_GLOBAL_LABEL_T, SCH_HIER_LABEL_T, SCH_LABEL_T, SCH_PIN_T, SCH_SHEET_PIN_T, and EDA_ITEM::Type().

Referenced by ResolveDrivers().

◆ GetNetName()

wxString CONNECTION_SUBGRAPH::GetNetName ( ) const

Returns the fully-qualified net name for this subgraph (if one exists)

Definition at line 189 of file connection_graph.cpp.

190 {
191  if( !m_driver || m_dirty )
192  return "";
193 
194  if( !m_driver->Connection( m_sheet ) )
195  {
196  #ifdef CONNECTIVITY_DEBUG
197  wxASSERT_MSG( false, "Tried to get the net name of an item with no connection" );
198  #endif
199 
200  return "";
201  }
202 
203  return m_driver->Connection( m_sheet )->Name();
204 }
SCH_SHEET_PATH m_sheet
wxString Name(bool aIgnoreSheet=false) const
SCH_CONNECTION * Connection(const SCH_SHEET_PATH &aPath) const
Retrieves the connection associated with this object in the given sheet.
Definition: sch_item.cpp:127

References SCH_ITEM::Connection(), m_dirty, m_driver, m_sheet, and SCH_CONNECTION::Name().

◆ ResolveDrivers()

bool CONNECTION_SUBGRAPH::ResolveDrivers ( bool  aCreateMarkers = false)

Determines which potential driver should drive the subgraph.

If multiple possible drivers exist, picks one according to the priority. If multiple "winners" exist, returns false and sets m_driver to nullptr.

Parameters
aCreateMarkerscontrols whether ERC markers should be added for conflicts
Returns
true if m_driver was set, or false if a conflict occurred

Definition at line 45 of file connection_graph.cpp.

46 {
47  int highest_priority = -1;
48  std::vector<SCH_ITEM*> candidates;
49  std::vector<SCH_ITEM*> strong_drivers;
50 
51  m_driver = nullptr;
52 
53  // Hierarchical labels are lower priority than local labels here,
54  // because on the first pass we want local labels to drive subgraphs
55  // so that we can identify same-sheet neighbors and link them together.
56  // Hierarchical labels will end up overriding the final net name if
57  // a higher-level sheet has a different name during the hierarchical
58  // pass.
59 
60  for( auto item : m_drivers )
61  {
62  PRIORITY item_priority = GetDriverPriority( item );
63 
64  if( item_priority == PRIORITY_PIN &&
65  !static_cast<SCH_PIN*>( item )->GetParentComponent()->IsInNetlist() )
66  continue;
67 
68  if( item_priority >= PRIORITY_HIER_LABEL )
69  strong_drivers.push_back( item );
70 
71  if( item_priority > highest_priority )
72  {
73  candidates.clear();
74  candidates.push_back( item );
75  highest_priority = item_priority;
76  }
77  else if( !candidates.empty() && ( item_priority == highest_priority ) )
78  {
79  candidates.push_back( item );
80  }
81  }
82 
83  if( highest_priority >= PRIORITY_HIER_LABEL )
84  m_strong_driver = true;
85 
86  // Power pins are 5, global labels are 6
87  m_local_driver = ( highest_priority < PRIORITY_POWER_PIN );
88 
89  if( !candidates.empty() )
90  {
91  if( candidates.size() > 1 )
92  {
93  if( highest_priority == PRIORITY_SHEET_PIN )
94  {
95  // We have multiple options, and they are all hierarchical
96  // sheet pins. Let's prefer outputs over inputs.
97 
98  for( auto c : candidates )
99  {
100  auto p = static_cast<SCH_SHEET_PIN*>( c );
101 
102  if( p->GetShape() == NET_OUTPUT )
103  {
104  m_driver = c;
105  break;
106  }
107  }
108  }
109  else
110  {
111  // For all other driver types, sort by name
112  std::sort( candidates.begin(), candidates.end(),
113  [&] ( SCH_ITEM* a, SCH_ITEM* b) -> bool
114  {
115  return GetNameForDriver( a ) < GetNameForDriver( b );
116  } );
117  }
118  }
119 
120  if( !m_driver )
121  m_driver = candidates[0];
122  }
123 
124  if( strong_drivers.size() > 1 )
125  m_multiple_drivers = true;
126 
127  // Drop weak drivers
128  if( m_strong_driver )
129  m_drivers = strong_drivers;
130 
131  // Cache driver connection
132  if( m_driver )
134  else
135  m_driver_connection = nullptr;
136 
137  if( aCreateMarkers && m_multiple_drivers )
138  {
139  // First check if all the candidates are actually the same
140  bool same = true;
141  auto first = GetNameForDriver( candidates[0] );
142 
143  for( unsigned i = 1; i < candidates.size(); i++ )
144  {
145  if( GetNameForDriver( candidates[i] ) != first )
146  {
147  same = false;
148  break;
149  }
150  }
151 
152  if( !same )
153  {
154  wxString msg;
155  msg.Printf( _( "%s and %s are both attached to the same wires. "
156  "%s was picked as the label to use for netlisting." ),
157  candidates[0]->GetSelectMenuText( m_frame->GetUserUnits() ),
158  candidates[1]->GetSelectMenuText( m_frame->GetUserUnits() ),
159  candidates[0]->Connection( m_sheet )->Name() );
160 
161  wxASSERT( candidates[0] != candidates[1] );
162 
163  auto p0 = ( candidates[0]->Type() == SCH_PIN_T ) ?
164  static_cast<SCH_PIN*>( candidates[0] )->GetTransformedPosition() :
165  candidates[0]->GetPosition();
166 
167  auto p1 = ( candidates[1]->Type() == SCH_PIN_T ) ?
168  static_cast<SCH_PIN*>( candidates[1] )->GetTransformedPosition() :
169  candidates[1]->GetPosition();
170 
171  auto marker = new SCH_MARKER();
172  marker->SetTimeStamp( GetNewTimeStamp() );
173  marker->SetMarkerType( MARKER_BASE::MARKER_ERC );
174  marker->SetErrorLevel( MARKER_BASE::MARKER_SEVERITY_WARNING );
175  marker->SetData( ERCE_DRIVER_CONFLICT, p0, msg, p1 );
176 
177  m_sheet.LastScreen()->Append( marker );
178 
179  // If aCreateMarkers is true, then this is part of ERC check, so we
180  // should return false even if the driver was assigned
181  return false;
182  }
183  }
184 
185  return aCreateMarkers || ( m_driver != nullptr );
186 }
SCH_SHEET_PATH m_sheet
SCH_CONNECTION * m_driver_connection
Cache for driver connection.
SCH_EDIT_FRAME * m_frame
static PRIORITY GetDriverPriority(SCH_ITEM *aDriver)
Returns the priority (higher is more important) of a candidate driver.
bool m_local_driver
True if the driver is a local (i.e. non-global) type.
bool m_multiple_drivers
True if this subgraph contains more than one driver that should be shorted together in the netlist.
timestamp_t GetNewTimeStamp()
Definition: common.cpp:217
EDA_UNITS_T GetUserUnits() const override
Return the user units currently in use.
Definition: draw_frame.h:289
bool m_strong_driver
True if the driver is "strong": a label or power object.
std::vector< SCH_ITEM * > m_drivers
SCH_CONNECTION * Connection(const SCH_SHEET_PATH &aPath) const
Retrieves the connection associated with this object in the given sheet.
Definition: sch_item.cpp:127
void Append(SCH_ITEM *aItem)
Definition: sch_screen.h:155
size_t i
Definition: json11.cpp:597
Class SCH_ITEM is a base class for any item which can be embedded within the SCHEMATIC container clas...
Definition: sch_item.h:114
SCH_SCREEN * LastScreen() const
Function LastScreen.
wxString GetNameForDriver(SCH_ITEM *aItem) const
Returns the candidate net name for a driver.

References SCH_SCREEN::Append(), SCH_ITEM::Connection(), ERCE_DRIVER_CONFLICT, GetDriverPriority(), GetNameForDriver(), GetNewTimeStamp(), EDA_DRAW_FRAME::GetUserUnits(), i, SCH_SHEET_PATH::LastScreen(), m_driver, m_driver_connection, m_drivers, m_frame, m_local_driver, m_multiple_drivers, m_sheet, m_strong_driver, MARKER_BASE::MARKER_ERC, MARKER_BASE::MARKER_SEVERITY_WARNING, NET_OUTPUT, PRIORITY_HIER_LABEL, PRIORITY_PIN, PRIORITY_POWER_PIN, PRIORITY_SHEET_PIN, and SCH_PIN_T.

Referenced by CONNECTION_GRAPH::buildConnectionGraph().

◆ UpdateItemConnections()

void CONNECTION_SUBGRAPH::UpdateItemConnections ( )

Updates all items to match the driver connection.

Definition at line 297 of file connection_graph.cpp.

298 {
299  if( !m_driver_connection )
300  return;
301 
302  for( auto item : m_items )
303  {
304  auto item_conn = item->Connection( m_sheet );
305 
306  if( !item_conn )
307  item_conn = item->InitializeConnection( m_sheet );
308 
309  if( ( m_driver_connection->IsBus() && item_conn->IsNet() ) ||
310  ( m_driver_connection->IsNet() && item_conn->IsBus() ) )
311  {
312  continue;
313  }
314 
315  if( item != m_driver )
316  {
317  item_conn->Clone( *m_driver_connection );
318  item_conn->ClearDirty();
319  }
320  }
321 }
SCH_SHEET_PATH m_sheet
SCH_CONNECTION * m_driver_connection
Cache for driver connection.
std::vector< SCH_ITEM * > m_items
bool IsNet() const
bool IsBus() const

References SCH_CONNECTION::IsBus(), SCH_CONNECTION::IsNet(), m_driver, m_driver_connection, m_items, and m_sheet.

Referenced by CONNECTION_GRAPH::propagateToNeighbors().

Member Data Documentation

◆ m_absorbed

bool CONNECTION_SUBGRAPH::m_absorbed

True if this subgraph has been absorbed into another. No pointers here are safe if so!

Definition at line 127 of file connection_graph.h.

Referenced by Absorb(), and CONNECTION_GRAPH::propagateToNeighbors().

◆ m_absorbed_by

CONNECTION_SUBGRAPH* CONNECTION_SUBGRAPH::m_absorbed_by

If this subgraph is absorbed, points to the absorbing (and valid) subgraph.

Definition at line 130 of file connection_graph.h.

Referenced by Absorb(), and CONNECTION_GRAPH::propagateToNeighbors().

◆ m_bus_entry

SCH_ITEM* CONNECTION_SUBGRAPH::m_bus_entry

Bus entry in graph, if any.

Definition at line 151 of file connection_graph.h.

◆ m_bus_neighbors

std::unordered_map< std::shared_ptr<SCH_CONNECTION>, std::unordered_set<CONNECTION_SUBGRAPH*> > CONNECTION_SUBGRAPH::m_bus_neighbors

If a subgraph is a bus, this map contains links between the bus members and any local sheet neighbors with the same connection name.

For example, if this subgraph is a bus D[7..0], and on the same sheet there is a net with label D7, this map will contain an entry for the D7 bus member, and the vector will contain a pointer to the D7 net subgraph.

Definition at line 176 of file connection_graph.h.

Referenced by Absorb().

◆ m_bus_parents

std::unordered_map< std::shared_ptr<SCH_CONNECTION>, std::unordered_set<CONNECTION_SUBGRAPH*> > CONNECTION_SUBGRAPH::m_bus_parents

If this is a net, this vector contains links to any same-sheet buses that contain it.

The string key is the name of the connection that forms the link (which isn't necessarily the same as the name of the connection driving this subgraph)

Definition at line 184 of file connection_graph.h.

Referenced by Absorb().

◆ m_code

long CONNECTION_SUBGRAPH::m_code

◆ m_dirty

bool CONNECTION_SUBGRAPH::m_dirty

Definition at line 124 of file connection_graph.h.

Referenced by Absorb(), GetNetName(), and CONNECTION_GRAPH::propagateToNeighbors().

◆ m_driver

SCH_ITEM* CONNECTION_SUBGRAPH::m_driver

◆ m_driver_connection

◆ m_drivers

std::vector<SCH_ITEM*> CONNECTION_SUBGRAPH::m_drivers

Definition at line 155 of file connection_graph.h.

Referenced by AddItem(), GetBusLabels(), and ResolveDrivers().

◆ m_frame

SCH_EDIT_FRAME* CONNECTION_SUBGRAPH::m_frame

Definition at line 162 of file connection_graph.h.

Referenced by ResolveDrivers().

◆ m_hier_pins

std::vector<SCH_SHEET_PIN*> CONNECTION_SUBGRAPH::m_hier_pins

Definition at line 187 of file connection_graph.h.

Referenced by AddItem(), and CONNECTION_GRAPH::propagateToNeighbors().

◆ m_hier_ports

std::vector<SCH_HIERLABEL*> CONNECTION_SUBGRAPH::m_hier_ports

Definition at line 190 of file connection_graph.h.

Referenced by AddItem(), and CONNECTION_GRAPH::propagateToNeighbors().

◆ m_items

◆ m_local_driver

bool CONNECTION_SUBGRAPH::m_local_driver

True if the driver is a local (i.e. non-global) type.

Definition at line 145 of file connection_graph.h.

Referenced by ResolveDrivers().

◆ m_multiple_drivers

bool CONNECTION_SUBGRAPH::m_multiple_drivers

True if this subgraph contains more than one driver that should be shorted together in the netlist.

For example, two labels or two power ports.

Definition at line 139 of file connection_graph.h.

Referenced by ResolveDrivers().

◆ m_no_connect

SCH_ITEM* CONNECTION_SUBGRAPH::m_no_connect

No-connect item in graph, if any.

Definition at line 148 of file connection_graph.h.

Referenced by CONNECTION_GRAPH::ercCheckLabels(), and CONNECTION_GRAPH::ercCheckNoConnects().

◆ m_sheet

◆ m_strong_driver

bool CONNECTION_SUBGRAPH::m_strong_driver

True if the driver is "strong": a label or power object.

Definition at line 142 of file connection_graph.h.

Referenced by ResolveDrivers().


The documentation for this class was generated from the following files: