// OpenSTA, Static Timing Analyzer // Copyright (c) 2025, Parallax Software, Inc. // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License // along with this program. If not, see . // // The origin of this software must not be misrepresented; you must not // claim that you wrote the original software. // // Altered source versions must be plainly marked as such, and must not be // misrepresented as being the original software. // // This notice may not be removed or altered from any source distribution. #pragma once #include #include #include #include "Set.hh" #include "Vector.hh" #include "Iterator.hh" namespace sta { class Network; class NetworkEdit; class NetworkReader; class Library; class Cell; class Port; class PortDirection; class Instance; class Pin; class Term; class Net; class ConstantPinIterator; class ViewType; class LibertyLibrary; typedef Iterator LibraryIterator; typedef Iterator LibertyLibraryIterator; typedef Vector CellSeq; typedef Vector PortSeq; typedef Iterator CellPortIterator; typedef Iterator CellPortBitIterator; typedef Iterator PortMemberIterator; typedef Vector PinSeq; typedef Vector InstanceSeq; typedef Vector NetSeq; typedef std::vector ConstNetSeq; typedef Iterator InstanceChildIterator; typedef Iterator InstancePinIterator; typedef Iterator InstanceNetIterator; typedef Iterator LeafInstanceIterator; typedef Iterator NetIterator; typedef Iterator NetPinIterator; typedef Iterator NetTermIterator; typedef Iterator ConnectedPinIterator; typedef ConnectedPinIterator NetConnectedPinIterator; typedef ConnectedPinIterator PinConnectedPinIterator; typedef uint32_t ObjectId; typedef std::map AttributeMap; enum class LogicValue : unsigned { zero, one, unknown, rise, fall }; class CellIdLess { public: CellIdLess(const Network *network); bool operator()(const Cell *cell1, const Cell *cell2) const; private: const Network *network_; }; class PortIdLess { public: PortIdLess(const Network *network); bool operator()(const Port *port1, const Port *port2) const; private: const Network *network_; }; class InstanceIdLess { public: InstanceIdLess(const Network *network); bool operator()(const Instance *inst1, const Instance *inst2) const; private: const Network *network_; }; class PinIdLess { public: PinIdLess(const Network *network); bool operator()(const Pin *pin1, const Pin *pin2) const; private: const Network *network_; }; class PinIdHash { public: PinIdHash(const Network *network); size_t operator()(const Pin *pin) const; private: const Network *network_; }; class NetIdLess { public: NetIdLess(const Network *network); bool operator()(const Net *net1, const Net *net2) const; private: const Network *network_; }; //////////////////////////////////////////////////////////////// class CellSet : public Set { public: CellSet(const Network *network); }; class PortSet : public Set { public: PortSet(const Network *network); }; class InstanceSet : public Set { public: InstanceSet(); InstanceSet(const Network *network); static int compare(const InstanceSet *set1, const InstanceSet *set2, const Network *network); static bool intersects(const InstanceSet *set1, const InstanceSet *set2, const Network *network); }; class PinSet : public Set { public: PinSet(); PinSet(const Network *network); static int compare(const PinSet *set1, const PinSet *set2, const Network *network); static bool intersects(const PinSet *set1, const PinSet *set2, const Network *network); }; class NetSet : public Set { public: NetSet(); NetSet(const Network *network); static int compare(const NetSet *set1, const NetSet *set2, const Network *network); static bool intersects(const NetSet *set1, const NetSet *set2, const Network *network); }; } // namespace