isSequential update

Signed-off-by: dsengupta0628 <dsengupta@precisioninno.com>
This commit is contained in:
dsengupta0628 2026-06-29 15:39:27 +00:00
parent 0c96ee9a22
commit 0fd2ad3217
5 changed files with 9 additions and 9 deletions

View File

@ -3230,7 +3230,7 @@ TEST(TestCellTest, HasInferedRegTimingArcs) {
TEST(TestCellTest, HasSequentials) { TEST(TestCellTest, HasSequentials) {
LibertyLibrary lib("test_lib", "test.lib"); LibertyLibrary lib("test_lib", "test.lib");
TestCell cell(&lib, "CELL1", "test.lib"); TestCell cell(&lib, "CELL1", "test.lib");
EXPECT_FALSE(cell.hasSequentials()); EXPECT_FALSE(cell.isSequential());
} }
TEST(TestCellTest, SequentialsEmpty) { TEST(TestCellTest, SequentialsEmpty) {

View File

@ -810,7 +810,7 @@ TEST_F(StaLibertyTest, LibraryDelayModelType) {
TEST_F(StaLibertyTest, CellHasSequentials) { TEST_F(StaLibertyTest, CellHasSequentials) {
LibertyCell *dff = lib_->findLibertyCell("DFF_X1"); LibertyCell *dff = lib_->findLibertyCell("DFF_X1");
if (dff) { if (dff) {
EXPECT_TRUE(dff->hasSequentials()); EXPECT_TRUE(dff->isSequential());
auto &seqs = dff->sequentials(); auto &seqs = dff->sequentials();
EXPECT_GT(seqs.size(), 0u); EXPECT_GT(seqs.size(), 0u);
} }
@ -3266,10 +3266,10 @@ TEST_F(StaLibertyTest, CellIsInverter2) {
TEST_F(StaLibertyTest, CellHasSequentials2) { TEST_F(StaLibertyTest, CellHasSequentials2) {
LibertyCell *buf = lib_->findLibertyCell("BUF_X1"); LibertyCell *buf = lib_->findLibertyCell("BUF_X1");
ASSERT_NE(buf, nullptr); ASSERT_NE(buf, nullptr);
EXPECT_FALSE(buf->hasSequentials()); EXPECT_FALSE(buf->isSequential());
LibertyCell *dff = lib_->findLibertyCell("DFF_X1"); LibertyCell *dff = lib_->findLibertyCell("DFF_X1");
if (dff) { if (dff) {
EXPECT_TRUE(dff->hasSequentials()); EXPECT_TRUE(dff->isSequential());
} }
} }

View File

@ -2166,14 +2166,14 @@ TEST_F(StaLibertyTest, CellSetClockGateType) {
TEST_F(StaLibertyTest, CellHasSequentialsBuf) { TEST_F(StaLibertyTest, CellHasSequentialsBuf) {
LibertyCell *buf = lib_->findLibertyCell("BUF_X1"); LibertyCell *buf = lib_->findLibertyCell("BUF_X1");
ASSERT_NE(buf, nullptr); ASSERT_NE(buf, nullptr);
EXPECT_FALSE(buf->hasSequentials()); EXPECT_FALSE(buf->isSequential());
} }
// LibertyCell::hasSequentials on DFF // LibertyCell::hasSequentials on DFF
TEST_F(StaLibertyTest, CellHasSequentialsDFF) { TEST_F(StaLibertyTest, CellHasSequentialsDFF) {
LibertyCell *dff = lib_->findLibertyCell("DFF_X1"); LibertyCell *dff = lib_->findLibertyCell("DFF_X1");
ASSERT_NE(dff, nullptr); ASSERT_NE(dff, nullptr);
EXPECT_TRUE(dff->hasSequentials()); EXPECT_TRUE(dff->isSequential());
} }
// LibertyCell::sequentials // LibertyCell::sequentials

View File

@ -3688,7 +3688,7 @@ library(test_r11_latch) {
LibertyCell *cell = lib->findLibertyCell("LATCH1"); LibertyCell *cell = lib->findLibertyCell("LATCH1");
EXPECT_NE(cell, nullptr); EXPECT_NE(cell, nullptr);
if (cell) { if (cell) {
EXPECT_TRUE(cell->hasSequentials()); EXPECT_TRUE(cell->isSequential());
} }
} }
remove(tmp_path.c_str()); remove(tmp_path.c_str());
@ -4338,7 +4338,7 @@ library(test_mbff_statetable) {
// But it has a statetable, so it IS sequential. // But it has a statetable, so it IS sequential.
EXPECT_NE(mbff->statetable(), nullptr); EXPECT_NE(mbff->statetable(), nullptr);
// hasSequentials() must return true for statetable-only cells. // hasSequentials() must return true for statetable-only cells.
EXPECT_TRUE(mbff->hasSequentials()) EXPECT_TRUE(mbff->isSequential())
<< "MBFF2 uses statetable (no ff/latch) but hasSequentials() " << "MBFF2 uses statetable (no ff/latch) but hasSequentials() "
"returned false — statetable cells are misclassified as " "returned false — statetable cells are misclassified as "
"combinational"; "combinational";

View File

@ -1326,7 +1326,7 @@ TEST_F(PowerDesignTest, SequentialCellClassification) {
Instance *inst = child_iter->next(); Instance *inst = child_iter->next();
LibertyCell *cell = network->libertyCell(inst); LibertyCell *cell = network->libertyCell(inst);
ASSERT_NE(cell, nullptr); ASSERT_NE(cell, nullptr);
if (cell->hasSequentials()) { if (cell->isSequential()) {
seq_count++; seq_count++;
} else { } else {
comb_count++; comb_count++;