Support $lut cells. Both C++ and SMT tests pass

This commit is contained in:
Roland Coeurjoly 2024-07-08 00:07:07 +02:00 committed by Emily Schmidt
parent 7cff8fa3a3
commit 566e57d24f
1 changed files with 24 additions and 2 deletions

View File

@ -249,6 +249,28 @@ public:
} }
} else if(cellType == ID($pow)) { } else if(cellType == ID($pow)) {
return handle_pow(inputs.at(ID(A)), a_width, inputs.at(ID(B)), b_width, y_width, a_signed && b_signed); return handle_pow(inputs.at(ID(A)), a_width, inputs.at(ID(B)), b_width, y_width, a_signed && b_signed);
} else if (cellType == ID($lut)) {
int width = parameters.at(ID(WIDTH)).as_int();
Const lut_table = parameters.at(ID(LUT));
T a = inputs.at(ID(A));
// Output initialization
T y = factory.constant(Const(0, 1));
// Iterate over each possible input combination
for (int i = 0; i < (1 << width); ++i) {
// Create a constant representing the value of i
T i_val = factory.constant(Const(i, width));
// Check if the input matches this value
T match = factory.equal(a, i_val, width);
// Get the corresponding LUT value
bool lut_val = lut_table.bits[i] == State::S1;
T lut_output = factory.constant(Const(lut_val, 1));
// Use a multiplexer to select the correct output based on the match
y = factory.mux(y, lut_output, match, 1);
}
return y;
} else{ } else{
log_error("unhandled cell in CellSimplifier %s\n", cellType.c_str()); log_error("unhandled cell in CellSimplifier %s\n", cellType.c_str());
} }