2018-09-28 17:54:21 +02:00
|
|
|
// OpenSTA, Static Timing Analyzer
|
2021-06-25 19:25:49 +02:00
|
|
|
// Copyright (c) 2021, 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
|
|
|
|
|
// 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/>.
|
|
|
|
|
|
2020-04-05 23:53:44 +02:00
|
|
|
#include "PinPair.hh"
|
2018-09-28 17:54:21 +02:00
|
|
|
|
|
|
|
|
namespace sta {
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
PinPairLess::operator()(const PinPair *pair1,
|
|
|
|
|
const PinPair *pair2) const
|
|
|
|
|
{
|
|
|
|
|
return pair1->first < pair2->first
|
|
|
|
|
|| (pair1->first == pair2->first
|
|
|
|
|
&& pair1->second < pair2->second);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
|
PinPairEqual::operator()(const PinPair *pair1,
|
|
|
|
|
const PinPair *pair2) const
|
|
|
|
|
{
|
|
|
|
|
return pair1->first == pair2->first
|
|
|
|
|
&& pair1->second == pair2->second;
|
|
|
|
|
}
|
|
|
|
|
|
2019-08-08 23:13:02 +02:00
|
|
|
size_t
|
2018-09-28 17:54:21 +02:00
|
|
|
PinPairHash::operator()(const PinPair *pair) const
|
|
|
|
|
{
|
2019-08-08 23:13:02 +02:00
|
|
|
size_t hash = hash_init_value;
|
2018-09-28 17:54:21 +02:00
|
|
|
hashIncr(hash, hashPtr(pair->first));
|
|
|
|
|
hashIncr(hash, hashPtr(pair->second));
|
|
|
|
|
return hash;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
} // namespace
|