Thanks to visit codestin.com
Credit goes to github.com

Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion lib/Conversion/VerifToSMT/VerifToSMT.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -367,7 +367,9 @@ struct VerifBoundedModelCheckingOpConversion
if (clockIndexes.size() == 1) {
auto clockIndex = clockIndexes[0];
auto oldClock = iterArgs[clockIndex];
auto newClock = loopVals[clockIndex];
// The clock is necessarily the first value returned by the loop
// region
auto newClock = loopVals[0];
auto oldClockLow = builder.create<smt::BVNotOp>(loc, oldClock);
auto isPosedgeBV =
builder.create<smt::BVAndOp>(loc, oldClockLow, newClock);
Expand Down
32 changes: 32 additions & 0 deletions test/Conversion/VerifToSMT/bmc-clock-not-first.mlir
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
// RUN: circt-opt %s --convert-verif-to-smt --reconcile-unrealized-casts -allow-unregistered-dialect | FileCheck %s

// Check subset of output to make sure posedge calculation works with different clock positions
// CHECK-LABEL: func.func @test_bmc_clock_not_first() -> i1 {
// CHECK: [[LOOP:%.+]] = func.call @bmc_loop([[ARG2:%.+]]) : (!smt.bv<1>) -> !smt.bv<1>
// CHECK: [[OLDCLOCKLOW:%.+]] = smt.bv.not [[ARG2]]
// CHECK: [[BVPOSEDGE:%.+]] = smt.bv.and [[OLDCLOCKLOW]], [[LOOP]]

func.func @test_bmc_clock_not_first() -> (i1) {
%bmc = verif.bmc bound 10 num_regs 1 initial_values [unit]
init {
%clk = seq.const_clock low
verif.yield %clk : !seq.clock
}
loop {
^bb0(%clk: !seq.clock):
%from_clock = seq.from_clock %clk
%c-1_i1 = hw.constant -1 : i1
%neg_clock = comb.xor %from_clock, %c-1_i1 : i1
%newclk = seq.to_clock %neg_clock
verif.yield %newclk: !seq.clock
}
circuit {
^bb0(%arg0: i32, %clk: !seq.clock, %state0: i32):
%c-1_i32 = hw.constant -1 : i32
%0 = comb.add %arg0, %state0 : i32
// %state0 is the result of a seq.compreg taking %0 as input
%2 = comb.xor %state0, %c-1_i32 : i32
verif.yield %2, %0 : i32, i32
}
func.return %bmc : i1
}
Loading