round_candidate.h

Go to the documentation of this file.

// MIT License
//
// Copyright (c) 2019 Ruhr University Bochum, Chair for Embedded Security. All Rights reserved.
// Copyright (c) 2019 Marc Fyrbiak, Sebastian Wallat, Max Hoffmann ("ORIGINAL AUTHORS"). All rights reserved.
// Copyright (c) 2021 Max Planck Institute for Security and Privacy. All Rights reserved.
// Copyright (c) 2021 Jörn Langheinrich, Julian Speith, Nils Albartus, René Walendy, Simon Klix ("ORIGINAL AUTHORS"). All Rights reserved.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
 
#pragma once
 
#include "graph_algorithm/netlist_graph.h"
#include "hal_core/defines.h"
#include "hawkeye/register_candidate.h"
 
#include <map>
#include <set>
 
namespace hal
{
    namespace hawkeye
    {
        class RoundCandidate
        {
        public:
            RoundCandidate() = default;
 
            ~RoundCandidate() = default;
 
            static Result<std::unique_ptr<RoundCandidate>> from_register_candidate(RegisterCandidate* candidate);
 
            Netlist* get_netlist() const;
 
            graph_algorithm::NetlistGraph* get_graph() const;
 
            u32 get_size() const;
 
            const std::set<Gate*>& get_input_reg() const;
 
            const std::set<Gate*>& get_output_reg() const;
 
            const std::set<Gate*>& get_state_logic() const;
 
            const std::set<Net*>& get_state_inputs() const;
 
            const std::set<Net*>& get_control_inputs() const;
 
            const std::set<Net*>& get_other_inputs() const;
 
            const std::set<Net*>& get_state_outputs() const;
 
            const std::map<Gate*, std::set<Gate*>>& get_input_ffs_of_gate() const;
 
            const std::map<u32, std::set<Gate*>>& get_longest_distance_to_gate() const;
 
        private:
            std::unique_ptr<Netlist> m_netlist;
 
            std::unique_ptr<graph_algorithm::NetlistGraph> m_graph;
 
            u32 m_size;
 
            std::set<Gate*> m_in_reg;
 
            std::set<Gate*> m_out_reg;
 
            std::set<Gate*> m_state_logic;
 
            std::set<Net*> m_state_inputs;
 
            std::set<Net*> m_control_inputs;
 
            std::set<Net*> m_other_inputs;
 
            std::set<Net*> m_state_outputs;
 
            std::map<Gate*, std::set<Gate*>> m_input_ffs_of_gate;
 
            std::map<u32, std::set<Gate*>> m_longest_distance_to_gate;
        };
    }    // namespace hawkeye
}    // namespace hal