SubCircuit::Graph Class Reference

#include <subcircuit.h>

Data Structures
struct	BitRef
struct	Edge
struct	Node
struct	Port
struct	PortBit

Public Member Functions
	Graph ()
	Graph (const Graph &other, const std::vector< std::string > &otherNodes)
void	createNode (std::string nodeId, std::string typeId, void *userData=NULL, bool shared=false)
void	createPort (std::string nodeId, std::string portId, int width=1, int minWidth=-1)
void	createConnection (std::string fromNodeId, std::string fromPortId, int fromBit, std::string toNodeId, std::string toPortId, int toBit, int width=1)
void	createConnection (std::string fromNodeId, std::string fromPortId, std::string toNodeId, std::string toPortId)
void	createConstant (std::string toNodeId, std::string toPortId, int toBit, int constValue)
void	createConstant (std::string toNodeId, std::string toPortId, int constValue)
void	markExtern (std::string nodeId, std::string portId, int bit=-1)
void	markAllExtern ()
void	print ()

Protected Attributes
bool	allExtern
std::map< std::string, int >	nodeMap
std::vector< Node >	nodes
std::vector< Edge >	edges

Friends
class	SolverWorker

Detailed Description

Definition at line 33 of file subcircuit.h.

Constructor & Destructor Documentation

SubCircuit::Graph::Graph ( )

inline

Definition at line 76 of file subcircuit.h.

: allExtern(false) { };

SubCircuit::Graph::Graph	(	const Graph &	other,
		const std::vector< std::string > &	otherNodes
	)

Definition at line 60 of file subcircuit.cc.

{
    allExtern = other.allExtern;

    std::map<int, int> other2this;
    for (int i = 0; i < int(otherNodes.size()); i++) {
        assert(other.nodeMap.count(otherNodes[i]) > 0);
        other2this[other.nodeMap.at(otherNodes[i])] = i;
        nodeMap[otherNodes[i]] = i;
    }

    std::map<int, int> edges2this;
    for (auto &i1 : other2this)
    for (auto &i2 : other.nodes[i1.first].ports)
    for (auto &i3 : i2.bits)
        if (edges2this.count(i3.edgeIdx) == 0) {
            int next_idx = edges2this.size();
            edges2this[i3.edgeIdx] = next_idx;
        }

    edges.resize(edges2this.size());
    for (auto &it : edges2this) {
        for (auto &bit : other.edges[it.first].portBits)
            if (other2this.count(bit.nodeIdx) > 0)
                edges[it.second].portBits.insert(BitRef(other2this[bit.nodeIdx], bit.portIdx, bit.bitIdx));
        edges[it.second].constValue = other.edges[it.first].constValue;
        edges[it.second].isExtern = other.edges[it.first].isExtern;
    }

    nodes.resize(other2this.size());
    for (auto &it : other2this) {
        nodes[it.second] = other.nodes[it.first];
        for (auto &i2 : nodes[it.second].ports)
        for (auto &i3 : i2.bits)
            i3.edgeIdx = edges2this.at(i3.edgeIdx);
    }
}

Member Function Documentation

void SubCircuit::Graph::createConnection	(	std::string	fromNodeId,
		std::string	fromPortId,
		int	fromBit,
		std::string	toNodeId,
		std::string	toPortId,
		int	toBit,
		int	width = 1
	)

Definition at line 144 of file subcircuit.cc.

{
    assert(nodeMap.count(fromNodeId) != 0);
    assert(nodeMap.count(toNodeId) != 0);

    int fromNodeIdx = nodeMap[fromNodeId];
    Node &fromNode = nodes[fromNodeIdx];

    int toNodeIdx = nodeMap[toNodeId];
    Node &toNode = nodes[toNodeIdx];

    assert(fromNode.portMap.count(fromPortId) != 0);
    assert(toNode.portMap.count(toPortId) != 0);

    int fromPortIdx = fromNode.portMap[fromPortId];
    Port &fromPort = fromNode.ports[fromPortIdx];

    int toPortIdx = toNode.portMap[toPortId];
    Port &toPort = toNode.ports[toPortIdx];

    if (width < 0) {
        assert(fromBit == 0 && toBit == 0);
        assert(fromPort.bits.size() == toPort.bits.size());
        width = fromPort.bits.size();
    }

    assert(fromBit >= 0 && toBit >= 0);
    for (int i = 0; i < width; i++)
    {
        assert(fromBit + i < int(fromPort.bits.size()));
        assert(toBit + i < int(toPort.bits.size()));

        int fromEdgeIdx = fromPort.bits[fromBit + i].edgeIdx;
        int toEdgeIdx = toPort.bits[toBit + i].edgeIdx;

        if (fromEdgeIdx == toEdgeIdx)
            continue;

        // merge toEdge into fromEdge
        if (edges[toEdgeIdx].isExtern)
            edges[fromEdgeIdx].isExtern = true;
        if (edges[toEdgeIdx].constValue) {
            assert(edges[fromEdgeIdx].constValue == 0);
            edges[fromEdgeIdx].constValue = edges[toEdgeIdx].constValue;
        }
        for (const auto &ref : edges[toEdgeIdx].portBits) {
            edges[fromEdgeIdx].portBits.insert(ref);
            nodes[ref.nodeIdx].ports[ref.portIdx].bits[ref.bitIdx].edgeIdx = fromEdgeIdx;
        }

        // remove toEdge (move last edge over toEdge if needed)
        if (toEdgeIdx+1 != int(edges.size())) {
            edges[toEdgeIdx] = edges.back();
            for (const auto &ref : edges[toEdgeIdx].portBits)
                nodes[ref.nodeIdx].ports[ref.portIdx].bits[ref.bitIdx].edgeIdx = toEdgeIdx;
        }
        edges.pop_back();
    }
}

Here is the caller graph for this function:

void SubCircuit::Graph::createConnection	(	std::string	fromNodeId,
		std::string	fromPortId,
		std::string	toNodeId,
		std::string	toPortId
	)

Definition at line 204 of file subcircuit.cc.

{
    createConnection(fromNodeId, fromPortId, 0, toNodeId, toPortId, 0, -1);
}

void SubCircuit::Graph::createConstant	(	std::string	toNodeId,
		std::string	toPortId,
		int	toBit,
		int	constValue
	)

Definition at line 209 of file subcircuit.cc.

{
    assert(nodeMap.count(toNodeId) != 0);
    int toNodeIdx = nodeMap[toNodeId];
    Node &toNode = nodes[toNodeIdx];

    assert(toNode.portMap.count(toPortId) != 0);
    int toPortIdx = toNode.portMap[toPortId];
    Port &toPort = toNode.ports[toPortIdx];

    assert(toBit >= 0 && toBit < int(toPort.bits.size()));
    int toEdgeIdx = toPort.bits[toBit].edgeIdx;

    assert(edges[toEdgeIdx].constValue == 0);
    edges[toEdgeIdx].constValue = constValue;
}

Here is the caller graph for this function:

void SubCircuit::Graph::createConstant	(	std::string	toNodeId,
		std::string	toPortId,
		int	constValue
	)

Definition at line 226 of file subcircuit.cc.

{
    assert(nodeMap.count(toNodeId) != 0);
    int toNodeIdx = nodeMap[toNodeId];
    Node &toNode = nodes[toNodeIdx];

    assert(toNode.portMap.count(toPortId) != 0);
    int toPortIdx = toNode.portMap[toPortId];
    Port &toPort = toNode.ports[toPortIdx];

    for (int i = 0; i < int(toPort.bits.size()); i++) {
        int toEdgeIdx = toPort.bits[i].edgeIdx;
        assert(edges[toEdgeIdx].constValue == 0);
        edges[toEdgeIdx].constValue = constValue % 2 ? '1' : '0';
        constValue = constValue >> 1;
    }
}

void SubCircuit::Graph::createNode	(	std::string	nodeId,
		std::string	typeId,
		void *	userData = NULL,
		bool	shared = false
	)

Definition at line 107 of file subcircuit.cc.

{
    assert(nodeMap.count(nodeId) == 0);
    nodeMap[nodeId] = nodes.size();
    nodes.push_back(Node());

    Node &newNode = nodes.back();
    newNode.nodeId = nodeId;
    newNode.typeId = typeId;
    newNode.userData = userData;
    newNode.shared = shared;
}

Here is the caller graph for this function:

void SubCircuit::Graph::createPort	(	std::string	nodeId,
		std::string	portId,
		int	width = 1,
		int	minWidth = -1
	)

Definition at line 120 of file subcircuit.cc.

{
    assert(nodeMap.count(nodeId) != 0);
    int nodeIdx = nodeMap[nodeId];
    Node &node = nodes[nodeIdx];

    assert(node.portMap.count(portId) == 0);

    int portIdx = node.ports.size();
    node.portMap[portId] = portIdx;
    node.ports.push_back(Port());
    Port &port = node.ports.back();

    port.portId = portId;
    port.minWidth = minWidth < 0 ? width : minWidth;
    port.bits.insert(port.bits.end(), width, PortBit());

    for (int i = 0; i < width; i++) {
        port.bits[i].edgeIdx = edges.size();
        edges.push_back(Edge());
        edges.back().portBits.insert(BitRef(nodeIdx, portIdx, i));
    }
}

Here is the caller graph for this function:

void SubCircuit::Graph::markAllExtern

(

)

Definition at line 261 of file subcircuit.cc.

{
    allExtern = true;
}

Here is the caller graph for this function:

void SubCircuit::Graph::markExtern	(	std::string	nodeId,
		std::string	portId,
		int	bit = -1
	)

Definition at line 244 of file subcircuit.cc.

{
    assert(nodeMap.count(nodeId) != 0);
    Node &node = nodes[nodeMap[nodeId]];

    assert(node.portMap.count(portId) != 0);
    Port &port = node.ports[node.portMap[portId]];

    if (bit < 0) {
        for (const auto portBit : port.bits)
            edges[portBit.edgeIdx].isExtern = true;
    } else {
        assert(bit < int(port.bits.size()));
        edges[port.bits[bit].edgeIdx].isExtern = true;
    }
}

Here is the caller graph for this function:

void SubCircuit::Graph::print

(

)

Definition at line 266 of file subcircuit.cc.

{
    for (int i = 0; i < int(nodes.size()); i++) {
        const Node &node = nodes[i];
        my_printf("NODE %d: %s (%s)\n", i, node.nodeId.c_str(), node.typeId.c_str());
        for (int j = 0; j < int(node.ports.size()); j++) {
            const Port &port = node.ports[j];
            my_printf("  PORT %d: %s (%d/%d)\n", j, port.portId.c_str(), port.minWidth, int(port.bits.size()));
            for (int k = 0; k < int(port.bits.size()); k++) {
                int edgeIdx = port.bits[k].edgeIdx;
                my_printf("    BIT %d (%d):", k, edgeIdx);
                for (const auto &ref : edges[edgeIdx].portBits)
                    my_printf(" %d.%d.%d", ref.nodeIdx, ref.portIdx, ref.bitIdx);
                if (edges[edgeIdx].isExtern)
                    my_printf(" [extern]");
                my_printf("\n");
            }
        }
    }
}

Here is the caller graph for this function:

Friends And Related Function Documentation

friend class SolverWorker

friend

Definition at line 89 of file subcircuit.h.

Field Documentation

bool SubCircuit::Graph::allExtern

protected

Definition at line 70 of file subcircuit.h.

std::vector<Edge> SubCircuit::Graph::edges

protected

Definition at line 73 of file subcircuit.h.

std::map<std::string, int> SubCircuit::Graph::nodeMap

protected

Definition at line 71 of file subcircuit.h.

std::vector<Node> SubCircuit::Graph::nodes

protected

Definition at line 72 of file subcircuit.h.

---

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

• subcircuit.h
• subcircuit.cc