70 lines
2.1 KiB
C++
70 lines
2.1 KiB
C++
// 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 <https://www.gnu.org/licenses/>.
|
|
//
|
|
// 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 <limits>
|
|
|
|
#include "ObjectId.hh"
|
|
#include "Set.hh"
|
|
#include "Vector.hh"
|
|
#include "MinMax.hh"
|
|
#include "Transition.hh"
|
|
#include "Delay.hh"
|
|
|
|
namespace sta {
|
|
|
|
// Class declarations for pointer references.
|
|
class Graph;
|
|
class Vertex;
|
|
class Edge;
|
|
class VertexIterator;
|
|
class VertexInEdgeIterator;
|
|
class VertexOutEdgeIterator;
|
|
class GraphLoop;
|
|
class VertexSet;
|
|
|
|
typedef ObjectId VertexId;
|
|
typedef ObjectId EdgeId;
|
|
typedef Vector<Vertex*> VertexSeq;
|
|
typedef Vector<Edge*> EdgeSeq;
|
|
typedef Set<Edge*> EdgeSet;
|
|
typedef int Level;
|
|
typedef int DcalcAPIndex;
|
|
typedef int TagGroupIndex;
|
|
typedef Vector<GraphLoop*> GraphLoopSeq;
|
|
typedef std::vector<Slew> SlewSeq;
|
|
|
|
static constexpr int level_max = std::numeric_limits<Level>::max();
|
|
|
|
// 16,777,215 tags
|
|
static constexpr int tag_group_index_bits = 24;
|
|
static constexpr TagGroupIndex tag_group_index_max = (1<<tag_group_index_bits)-1;
|
|
static constexpr int slew_annotated_bits = MinMax::index_count * RiseFall::index_count;
|
|
|
|
// Bit shifts used to mark vertices in a Bfs queue.
|
|
enum class BfsIndex { dcalc, arrival, required, other, bits };
|
|
|
|
} // namespace
|