OpenSTA/include/sta/RiseFallMinMax.hh

89 lines
2.8 KiB
C++
Raw Normal View History

2018-09-28 17:54:21 +02:00
// OpenSTA, Static Timing Analyzer
// Copyright (c) 2025, Parallax Software, Inc.
2018-09-28 17:54:21 +02:00
//
// 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
2018-09-28 17:54:21 +02:00
// 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.
2018-09-28 17:54:21 +02:00
2020-02-16 01:13:16 +01:00
#pragma once
2018-09-28 17:54:21 +02:00
2020-04-05 23:53:44 +02:00
#include "MinMax.hh"
#include "Transition.hh"
2018-09-28 17:54:21 +02:00
namespace sta {
// Rise/Fall/Min/Max group of four values common to many constraints.
class RiseFallMinMax
{
public:
RiseFallMinMax();
RiseFallMinMax(const RiseFallMinMax *rfmm);
explicit RiseFallMinMax(float init_value);
2019-11-11 23:30:19 +01:00
float value(const RiseFall *rf,
2018-09-28 17:54:21 +02:00
const MinMax *min_max) const;
float value(const MinMax *min_max) const;
2019-11-11 23:30:19 +01:00
void value(const RiseFall *rf,
2018-09-28 17:54:21 +02:00
const MinMax *min_max,
float &value,
bool &exists) const;
bool hasValue() const;
2020-07-10 01:10:21 +02:00
void maxValue(// Return values
float &max_value,
bool &exists) const;
2018-09-28 17:54:21 +02:00
bool empty() const;
2019-11-11 23:30:19 +01:00
bool hasValue(const RiseFall *rf,
2018-09-28 17:54:21 +02:00
const MinMax *min_max) const;
2019-11-11 23:30:19 +01:00
void setValue(const RiseFallBoth *rf,
2018-09-28 17:54:21 +02:00
const MinMaxAll *min_max,
float value);
2019-11-11 23:30:19 +01:00
void setValue(const RiseFallBoth *rf,
2018-09-28 17:54:21 +02:00
const MinMax *min_max,
float value);
2019-11-11 23:30:19 +01:00
void setValue(const RiseFall *rf,
2018-09-28 17:54:21 +02:00
const MinMax *min_max, float value);
void setValue(float value);
2019-11-11 23:30:19 +01:00
void mergeValue(const RiseFallBoth *rf,
2018-09-28 17:54:21 +02:00
const MinMaxAll *min_max,
float value);
void mergeValue(const RiseFall *rf,
const MinMax *min_max,
float value);
2018-09-28 17:54:21 +02:00
void setValues(RiseFallMinMax *values);
2019-11-11 23:30:19 +01:00
void removeValue(const RiseFallBoth *rf,
2018-09-28 17:54:21 +02:00
const MinMax *min_max);
2019-11-11 23:30:19 +01:00
void removeValue(const RiseFallBoth *rf,
2018-09-28 17:54:21 +02:00
const MinMaxAll *min_max);
// Merge all values of rfmm.
void mergeWith(RiseFallMinMax *rfmm);
void clear();
bool equal(const RiseFallMinMax *values) const;
bool isOneValue() const;
2018-09-28 17:54:21 +02:00
bool isOneValue(float &value) const;
bool isOneValue(const MinMax *min_max,
// Return values.
float &value) const;
private:
2019-11-11 23:30:19 +01:00
float values_[RiseFall::index_count][MinMax::index_count];
bool exists_[RiseFall::index_count][MinMax::index_count];
2018-09-28 17:54:21 +02:00
};
} // namespace