common_successor_predecessor.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 "hal_core/defines.h"
#include <QHash>
#include <QList>
#include <QSet>
#include "hal_core/netlist/gate.h"
 
namespace hal {
    class Gate;
 
    class CommonSuccessorPredecessorGateQueue
    {
        int mIndex;
        Gate* mGate;
        QHash <Gate*, Gate*> mLastWaypoint;
        QList<Gate*> mQueue;
    public:
        CommonSuccessorPredecessorGateQueue(int i, Gate* g);
        QList<Gate*> getNext(bool forward);
        void setQueue(const QList<Gate*>& q) { mQueue = q; }
        int mask() const { return 1 << mIndex; }
        QList<Gate*> waypoints(Gate* g) const;
    };
 
    class CommonSuccessorPredecessor
    {
        bool mForward;
        int mMaskAll;
        QList<CommonSuccessorPredecessorGateQueue> mQueues;
        QHash<Gate*,int> mFoundBit;
        QSet<Gate*> mFoundSet;
    public:
        CommonSuccessorPredecessor(const QList<u32>& gateIds, bool forw, int maxRound);
        QSet<Gate*> result() const;
    };
}