graph_edge.hpp

Go to the documentation of this file.

//
// Copyright 2019 Ettus Research, a National Instruments Brand
//
// SPDX-License-Identifier: GPL-3.0-or-later
//
 
#pragma once
 
#include <uhd/config.hpp>
#include <cstdint>
#include <string>
#include <tuple>
 
namespace uhd { namespace rfnoc {

struct UHD_API graph_edge_t
{
    enum edge_t : uint32_t {
        STATIC, 
        DYNAMIC, 
        RX_STREAM, 
        TX_STREAM 
    };
 
    graph_edge_t() = default;
 
    graph_edge_t(const size_t src_port_,
        const size_t dst_port_,
        const edge_t edge_,
        const bool fwd_edge)
        : src_port(src_port_), dst_port(dst_port_), edge(edge_), is_forward_edge(fwd_edge)
    {
    }

    std::string src_blockid;
    size_t src_port = 0;
    std::string dst_blockid;
    size_t dst_port = 0;
    edge_t edge = DYNAMIC;
    // are not used for sorting the graph as a DAG.
    bool is_forward_edge = true;

    // properties.
    bool operator==(const graph_edge_t& rhs) const
    {
        return is_equal(rhs, true);
    }

    bool is_equal(const graph_edge_t& rhs, const bool match_properties = false) const
    {
        return (std::tie(src_blockid, src_port, dst_blockid, dst_port)
                   == std::tie(
                       rhs.src_blockid, rhs.src_port, rhs.dst_blockid, rhs.dst_port))
               && (match_properties ? (std::tie(edge, is_forward_edge)
                                       == std::tie(rhs.edge, rhs.is_forward_edge))
                                    : true);
    }

    std::string to_string() const
    {
        return src_blockid + ":" + std::to_string(src_port)
               + (edge == STATIC ? "==>" : "-->") + dst_blockid + ":"
               + std::to_string(dst_port);
    }
};
 
 
}} /* namespace uhd::rfnoc */