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::INVALID = -1, PRIORITY::NONE = 0, PRIORITY::PIN, PRIORITY::SHEET_PIN,   PRIORITY::HIER_LABEL, PRIORITY::LOCAL_LABEL, PRIORITY::POWER_PIN, PRIORITY::GLOBAL }

Public Member Functions
	CONNECTION_SUBGRAPH (CONNECTION_GRAPH *aGraph)
	~CONNECTION_SUBGRAPH ()=default
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...
const wxString &	GetNameForDriver (SCH_ITEM *aItem)
	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...
PRIORITY	GetDriverPriority ()

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

Public Attributes
CONNECTION_GRAPH *	m_graph
bool	m_dirty
bool	m_absorbed
	True if this subgraph has been absorbed into another. No pointers here are safe if so! More...
CONNECTION_SUBGRAPH *	m_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_ITEM *	m_no_connect
	No-connect item in graph, if any. More...
SCH_ITEM *	m_bus_entry
	Bus entry in graph, if any. More...
std::vector< SCH_ITEM * >	m_items
std::vector< SCH_ITEM * >	m_drivers
SCH_ITEM *	m_driver
SCH_SHEET_PATH	m_sheet
SCH_CONNECTION *	m_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
CONNECTION_SUBGRAPH *	m_hier_parent
std::unordered_map< SCH_ITEM *, wxString >	m_driver_name_cache
	A cache of escaped netnames from schematic items. More...

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 59 of file connection_graph.h.

Member Enumeration Documentation

PRIORITY

enum CONNECTION_SUBGRAPH::PRIORITY

strong

Enumerator
INVALID
NONE
PIN
SHEET_PIN
HIER_LABEL
LOCAL_LABEL
POWER_PIN
GLOBAL

Definition at line 62 of file connection_graph.h.

    {
        INVALID = -1,
        NONE    = 0,
        PIN,
        SHEET_PIN,
        HIER_LABEL,
        LOCAL_LABEL,
        POWER_PIN,
        GLOBAL
    };

Constructor & Destructor Documentation

CONNECTION_SUBGRAPH()

CONNECTION_SUBGRAPH::CONNECTION_SUBGRAPH ( CONNECTION_GRAPH *  aGraph )

inlineexplicit

Definition at line 74 of file connection_graph.h.

                                                             :
              m_graph( aGraph ),
              m_dirty( false ),
              m_absorbed( false ),
              m_absorbed_by( nullptr ),
              m_code( -1 ),
              m_multiple_drivers( false ),
              m_strong_driver( false ),
              m_local_driver( false ),
              m_no_connect( nullptr ),
              m_bus_entry( nullptr ),
              m_driver( nullptr ),
              m_driver_connection( nullptr ),
              m_hier_parent( nullptr )
    {}

~CONNECTION_SUBGRAPH()

CONNECTION_SUBGRAPH::~CONNECTION_SUBGRAPH ( )

default

Member Function Documentation

Absorb()

void CONNECTION_SUBGRAPH::Absorb

(

CONNECTION_SUBGRAPH *

aOther

)

Combines another subgraph on the same sheet into this one.

Definition at line 310 of file connection_graph.cpp.

{
    wxASSERT( m_sheet == aOther->m_sheet );

    for( SCH_ITEM* item : aOther->m_items )
    {
        item->Connection( &m_sheet )->SetSubgraphCode( m_code );
        AddItem( item );
    }

    m_bus_neighbors.insert( aOther->m_bus_neighbors.begin(), aOther->m_bus_neighbors.end() );
    m_bus_parents.insert( aOther->m_bus_parents.begin(), aOther->m_bus_parents.end() );

    m_multiple_drivers |= aOther->m_multiple_drivers;

    aOther->m_absorbed = true;
    aOther->m_dirty = false;
    aOther->m_driver = nullptr;
    aOther->m_driver_connection = nullptr;
    aOther->m_absorbed_by = this;
}

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_multiple_drivers, m_sheet, and SCH_CONNECTION::SetSubgraphCode().

AddItem()

void CONNECTION_SUBGRAPH::AddItem

(

SCH_ITEM *

aItem

)

Adds a new item to the subgraph.

Definition at line 333 of file connection_graph.cpp.

{
    m_items.push_back( aItem );

    if( aItem->Connection( &m_sheet )->IsDriver() )
        m_drivers.push_back( aItem );

    if( aItem->Type() == SCH_SHEET_PIN_T )
        m_hier_pins.push_back( static_cast<SCH_SHEET_PIN*>( aItem ) );
    else if( aItem->Type() == SCH_HIER_LABEL_T )
        m_hier_ports.push_back( static_cast<SCH_HIERLABEL*>( aItem ) );
}

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 247 of file connection_graph.cpp.

{
    std::vector<SCH_ITEM*> labels;

    for( SCH_ITEM* item : m_drivers )
    {
        switch( item->Type() )
        {
        case SCH_LABEL_T:
        case SCH_GLOBAL_LABEL_T:
        {
            SCH_CONNECTION* label_conn = item->Connection( &m_sheet );

            // Only consider bus vectors
            if( label_conn->Type() == CONNECTION_TYPE::BUS )
                labels.push_back( item );

            break;
        }

        default: break;
        }
    }

    return labels;
}

References BUS, m_drivers, m_sheet, SCH_GLOBAL_LABEL_T, SCH_LABEL_T, and SCH_CONNECTION::Type().

GetDriverPriority() [1/2]

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

aDriver

is the item to inspect

Returns

a PRIORITY

Definition at line 374 of file connection_graph.cpp.

{
    if( !aDriver )
        return PRIORITY::NONE;

    switch( aDriver->Type() )
    {
    case SCH_SHEET_PIN_T:     return PRIORITY::SHEET_PIN;
    case SCH_HIER_LABEL_T:    return PRIORITY::HIER_LABEL;
    case SCH_LABEL_T:         return PRIORITY::LOCAL_LABEL;
    case SCH_GLOBAL_LABEL_T:  return PRIORITY::GLOBAL;
    case SCH_PIN_T:
    {
        auto sch_pin = static_cast<SCH_PIN*>( aDriver );

        if( sch_pin->IsPowerConnection() )
            return PRIORITY::POWER_PIN;
        else
            return PRIORITY::PIN;
    }

    default: return PRIORITY::NONE;
    }
}

References GLOBAL, HIER_LABEL, LOCAL_LABEL, NONE, PIN, POWER_PIN, SCH_GLOBAL_LABEL_T, SCH_HIER_LABEL_T, SCH_LABEL_T, SCH_PIN_T, SCH_SHEET_PIN_T, SHEET_PIN, and EDA_ITEM::Type().

Referenced by CONNECTION_GRAPH::ercCheckNoConnects(), and SCHEMATIC::GetNetClassAssignmentCandidates().

GetDriverPriority() [2/2]

PRIORITY CONNECTION_SUBGRAPH::GetDriverPriority ( )

inline

Definition at line 139 of file connection_graph.h.

    {
        if( m_driver )
            return GetDriverPriority( m_driver );
        else
            return PRIORITY::NONE;
    }

References m_driver, and NONE.

Referenced by SCH_EDITOR_CONTROL::AssignNetclass(), CONNECTION_GRAPH::buildConnectionGraph(), CONNECTION_GRAPH::ercCheckBusToBusEntryConflicts(), inheritNetclass(), BACK_ANNOTATE::processNetNameChange(), CONNECTION_GRAPH::propagateToNeighbors(), and ResolveDrivers().

GetNameForDriver()

const wxString & CONNECTION_SUBGRAPH::GetNameForDriver

(

SCH_ITEM *

aItem

)

Returns the candidate net name for a driver.

Definition at line 275 of file connection_graph.cpp.

{
    auto it = m_driver_name_cache.find( aItem );

    if( it != m_driver_name_cache.end() )
        return it->second;

    switch( aItem->Type() )
    {
    case SCH_PIN_T:
    {
        SCH_PIN* pin = static_cast<SCH_PIN*>( aItem );
        m_driver_name_cache[aItem] = pin->GetDefaultNetName( m_sheet );
        break;
    }

    case SCH_LABEL_T:
    case SCH_GLOBAL_LABEL_T:
    case SCH_HIER_LABEL_T:
    case SCH_SHEET_PIN_T:
    {
        m_driver_name_cache[aItem] = EscapeString( static_cast<SCH_TEXT*>( aItem )->GetShownText(),
                                                   CTX_NETNAME );
        break;
    }

    default:
        wxFAIL_MSG( "Unhandled item type in GetNameForDriver" );
        break;
    }

    return m_driver_name_cache.at( aItem );
}

References CTX_NETNAME, EscapeString(), SCH_PIN::GetDefaultNetName(), m_driver_name_cache, m_sheet, 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::getDefaultConnection(), inheritNetclass(), CONNECTION_GRAPH::propagateToNeighbors(), and ResolveDrivers().

GetNetName()

wxString CONNECTION_SUBGRAPH::GetNetName

(

)

const

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

Definition at line 229 of file connection_graph.cpp.

{
    if( !m_driver || m_dirty )
        return "";

    if( !m_driver->Connection( &m_sheet ) )
    {
#ifdef CONNECTIVITY_DEBUG
        wxASSERT_MSG( false, "Tried to get the net name of an item with no connection" );
#endif

        return "";
    }

    return m_driver->Connection( &m_sheet )->Name();
}

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

Referenced by CONNECTION_GRAPH::buildConnectionGraph().

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

aCreateMarkers

controls whether ERC markers should be added for conflicts

Returns

true if m_driver was set, or false if a conflict occurred

Definition at line 60 of file connection_graph.cpp.

{
    PRIORITY               highest_priority = PRIORITY::INVALID;
    std::vector<SCH_ITEM*> candidates;
    std::vector<SCH_ITEM*> strong_drivers;

    m_driver = nullptr;

    // Hierarchical labels are lower priority than local labels here,
    // because on the first pass we want local labels to drive subgraphs
    // so that we can identify same-sheet neighbors and link them together.
    // Hierarchical labels will end up overriding the final net name if
    // a higher-level sheet has a different name during the hierarchical
    // pass.

    for( SCH_ITEM* item : m_drivers )
    {
        PRIORITY item_priority = GetDriverPriority( item );

        if( item_priority == PRIORITY::PIN
                && !static_cast<SCH_PIN*>( item )->GetParentSymbol()->IsInNetlist() )
            continue;

        if( item_priority >= PRIORITY::HIER_LABEL )
            strong_drivers.push_back( item );

        if( item_priority > highest_priority )
        {
            candidates.clear();
            candidates.push_back( item );
            highest_priority = item_priority;
        }
        else if( !candidates.empty() && ( item_priority == highest_priority ) )
        {
            candidates.push_back( item );
        }
    }

    if( highest_priority >= PRIORITY::HIER_LABEL )
        m_strong_driver = true;

    // Power pins are 5, global labels are 6
    m_local_driver = ( highest_priority < PRIORITY::POWER_PIN );

    if( !candidates.empty() )
    {
        if( candidates.size() > 1 )
        {
            if( highest_priority == PRIORITY::SHEET_PIN )
            {
                // We have multiple options, and they are all hierarchical
                // sheet pins.  Let's prefer outputs over inputs.

                for( SCH_ITEM* c : candidates )
                {
                    SCH_SHEET_PIN* p = static_cast<SCH_SHEET_PIN*>( c );

                    if( p->GetShape() == PINSHEETLABEL_SHAPE::PS_OUTPUT )
                    {
                        m_driver = c;
                        break;
                    }
                }
            }
            else
            {
                // See if a previous driver is still a candidate
                void* previousDriver = nullptr;

                for( SCH_ITEM* member : m_items )
                {
                    if( SCH_CONNECTION* mc = member->Connection( &m_sheet ) )
                    {
                        if( mc->GetLastDriver() )
                        {
                            previousDriver = mc->GetLastDriver();
                            break;
                        }
                    }
                }

                // For all other driver types, sort by name
                std::sort( candidates.begin(), candidates.end(),
                           [&]( SCH_ITEM* a, SCH_ITEM* b ) -> bool
                           {
                               // meet irreflexive requirements of std::sort
                               if( a == b )
                                   return false;

                               SCH_CONNECTION* ac = a->Connection( &m_sheet );
                               SCH_CONNECTION* bc = b->Connection( &m_sheet );

                               // Ensure we don't pick the subset over the superset
                               if( ac->IsBus() && bc->IsBus() )
                                   return bc->IsSubsetOf( ac );

                               if( a == previousDriver )
                                   return true;
                               else if( b == previousDriver )
                                   return false;
                               else
                                   return GetNameForDriver( a ) < GetNameForDriver( b );
                           } );
            }
        }

        if( !m_driver )
            m_driver = candidates[0];
    }

    if( strong_drivers.size() > 1 )
        m_multiple_drivers = true;

    // Drop weak drivers
    if( m_strong_driver )
        m_drivers = strong_drivers;

    // Cache driver connection
    if( m_driver )
        m_driver_connection = m_driver->Connection( &m_sheet );
    else
        m_driver_connection = nullptr;

    if( aCreateMarkers && m_multiple_drivers )
    {
        // First check if all the candidates are actually the same
        bool same = true;
        wxString first = GetNameForDriver( candidates[0] );
        SCH_ITEM* second_item = nullptr;

        for( unsigned i = 1; i < candidates.size(); i++ )
        {
            if( GetNameForDriver( candidates[i] ) != first )
            {
                second_item = candidates[i];
                same = false;
                break;
            }
        }

        if( !same )
        {
            wxPoint pos = candidates[0]->Type() == SCH_PIN_T ?
                              static_cast<SCH_PIN*>( candidates[0] )->GetTransformedPosition() :
                              candidates[0]->GetPosition();

            wxString msg = wxString::Format( _( "Both %s and %s are attached to the same "
                                                "items; %s will be used in the netlist" ),
                                             first,
                                             GetNameForDriver( second_item ),
                                             first );

            std::shared_ptr<ERC_ITEM> ercItem = ERC_ITEM::Create( ERCE_DRIVER_CONFLICT );
            ercItem->SetItems( candidates[0], second_item );
            ercItem->SetErrorMessage( msg );

            SCH_MARKER* marker = new SCH_MARKER( ercItem, pos );
            m_sheet.LastScreen()->Append( marker );

            // If aCreateMarkers is true, then this is part of ERC check, so we
            // should return false even if the driver was assigned
            return false;
        }
    }

    return aCreateMarkers || ( m_driver != nullptr );
}

References _, SCH_SCREEN::Append(), SCH_ITEM::Connection(), ERC_ITEM::Create(), ERCE_DRIVER_CONFLICT, Format(), GetDriverPriority(), GetNameForDriver(), SCH_TEXT::GetShape(), HIER_LABEL, INVALID, SCH_CONNECTION::IsBus(), SCH_CONNECTION::IsSubsetOf(), SCH_SHEET_PATH::LastScreen(), m_driver, m_driver_connection, m_drivers, m_items, m_local_driver, m_multiple_drivers, m_sheet, m_strong_driver, PIN, POWER_PIN, PS_OUTPUT, SCH_PIN_T, SHEET_PIN, and EDA_ITEM::Type().

Referenced by CONNECTION_GRAPH::buildConnectionGraph().

UpdateItemConnections()

void CONNECTION_SUBGRAPH::UpdateItemConnections

(

)

Updates all items to match the driver connection.

Definition at line 347 of file connection_graph.cpp.

{
    if( !m_driver_connection )
        return;

    for( SCH_ITEM* item : m_items )
    {
        SCH_CONNECTION* item_conn = item->Connection( &m_sheet );

        if( !item_conn )
            item_conn = item->InitializeConnection( m_sheet, m_graph );

        if( ( m_driver_connection->IsBus() && item_conn->IsNet() ) ||
            ( m_driver_connection->IsNet() && item_conn->IsBus() ) )
        {
            continue;
        }

        if( item != m_driver )
        {
            item_conn->Clone( *m_driver_connection );
            item_conn->ClearDirty();
        }
    }
}

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

Referenced by CONNECTION_GRAPH::buildConnectionGraph(), and 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 152 of file connection_graph.h.

Referenced by Absorb(), CONNECTION_GRAPH::buildConnectionGraph(), CONNECTION_GRAPH::FindSubgraphByName(), CONNECTION_GRAPH::GetSubgraphForItem(), 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 155 of file connection_graph.h.

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

m_bus_entry

SCH_ITEM* CONNECTION_SUBGRAPH::m_bus_entry

Bus entry in graph, if any.

Definition at line 176 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 198 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 206 of file connection_graph.h.

Referenced by Absorb().

m_code

long CONNECTION_SUBGRAPH::m_code

Definition at line 157 of file connection_graph.h.

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

m_dirty

bool CONNECTION_SUBGRAPH::m_dirty

Definition at line 149 of file connection_graph.h.

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

m_driver

SCH_ITEM* CONNECTION_SUBGRAPH::m_driver

Definition at line 182 of file connection_graph.h.

Referenced by Absorb(), CONNECTION_GRAPH::ercCheckBusToBusEntryConflicts(), CONNECTION_GRAPH::ercCheckFloatingWires(), GetDriverPriority(), GetNetName(), CONNECTION_GRAPH::propagateToNeighbors(), ResolveDrivers(), and UpdateItemConnections().

m_driver_connection

SCH_CONNECTION* CONNECTION_SUBGRAPH::m_driver_connection

Cache for driver connection.

Definition at line 187 of file connection_graph.h.

Referenced by Absorb(), CONNECTION_GRAPH::buildConnectionGraph(), CONNECTION_GRAPH::ercCheckBusToBusEntryConflicts(), CONNECTION_GRAPH::FindSubgraphByName(), CONNECTION_GRAPH::propagateToNeighbors(), CONNECTION_GRAPH::recacheSubgraphName(), ResolveDrivers(), and UpdateItemConnections().

m_driver_name_cache

std::unordered_map<SCH_ITEM*, wxString> CONNECTION_SUBGRAPH::m_driver_name_cache

A cache of escaped netnames from schematic items.

Definition at line 218 of file connection_graph.h.

Referenced by GetNameForDriver().

m_drivers

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

Definition at line 180 of file connection_graph.h.

Referenced by AddItem(), CONNECTION_GRAPH::ercCheckLabels(), GetBusLabels(), inheritNetclass(), CONNECTION_GRAPH::propagateToNeighbors(), and ResolveDrivers().

m_graph

CONNECTION_GRAPH* CONNECTION_SUBGRAPH::m_graph

Definition at line 147 of file connection_graph.h.

Referenced by UpdateItemConnections().

m_hier_parent

CONNECTION_SUBGRAPH* CONNECTION_SUBGRAPH::m_hier_parent

Definition at line 215 of file connection_graph.h.

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

m_hier_pins

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

Definition at line 209 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 212 of file connection_graph.h.

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

m_items

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

Definition at line 178 of file connection_graph.h.

Referenced by Absorb(), AddItem(), NETLIST_EXPORTER_BASE::CreatePinList(), CONNECTION_GRAPH::ercCheckBusToBusConflicts(), CONNECTION_GRAPH::ercCheckBusToBusEntryConflicts(), CONNECTION_GRAPH::ercCheckBusToNetConflicts(), CONNECTION_GRAPH::ercCheckFloatingWires(), CONNECTION_GRAPH::ercCheckLabels(), CONNECTION_GRAPH::ercCheckNoConnects(), NETLIST_EXPORTER_BASE::findAllUnitsOfSymbol(), ResolveDrivers(), ERC_TESTER::TestMultUnitPinConflicts(), ERC_TESTER::TestPinToPin(), ERC_TESTER::TestSimilarLabels(), UpdateItemConnections(), and SCH_EDITOR_CONTROL::UpdateNetHighlighting().

m_local_driver

bool CONNECTION_SUBGRAPH::m_local_driver

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

Definition at line 170 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 164 of file connection_graph.h.

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

m_no_connect

SCH_ITEM* CONNECTION_SUBGRAPH::m_no_connect

No-connect item in graph, if any.

Definition at line 173 of file connection_graph.h.

Referenced by NETLIST_EXPORTER_BASE::CreatePinList(), CONNECTION_GRAPH::ercCheckLabels(), CONNECTION_GRAPH::ercCheckNoConnects(), and NETLIST_EXPORTER_BASE::findAllUnitsOfSymbol().

m_sheet

SCH_SHEET_PATH CONNECTION_SUBGRAPH::m_sheet

Definition at line 184 of file connection_graph.h.

Referenced by Absorb(), AddItem(), CONNECTION_GRAPH::buildConnectionGraph(), CONNECTION_GRAPH::ercCheckBusToBusConflicts(), CONNECTION_GRAPH::ercCheckBusToBusEntryConflicts(), CONNECTION_GRAPH::ercCheckBusToNetConflicts(), CONNECTION_GRAPH::ercCheckFloatingWires(), CONNECTION_GRAPH::ercCheckLabels(), CONNECTION_GRAPH::ercCheckNoConnects(), CONNECTION_GRAPH::FindSubgraphByName(), GetBusLabels(), CONNECTION_GRAPH::getDefaultConnection(), GetNameForDriver(), GetNetName(), CONNECTION_GRAPH::propagateToNeighbors(), ResolveDrivers(), ERC_TESTER::TestMultUnitPinConflicts(), ERC_TESTER::TestPinToPin(), ERC_TESTER::TestSimilarLabels(), and UpdateItemConnections().

m_strong_driver

bool CONNECTION_SUBGRAPH::m_strong_driver

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

Definition at line 167 of file connection_graph.h.

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

---

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

• connection_graph.h
• connection_graph.cpp