mirror of
https://github.com/powdr-labs/powdr.git
synced 2026-04-20 03:03:25 -04:00
Depends on #2279 This PR implements JIT code generation for block machines with irregular block shape, such as `std::machines::large_field::binary::Binary`. This is achieved as follows: - Instead of solving rows `0..block_size`, we run the solver for rows `-1..(block_size + 1)`. This way, the solver is able to generate code that writes to the previous row of the last block or the first row of the next block. - At the end, we check whether the generated code is actually consistent: For example, if the code writes to the last row of the previous block, it can't have a unknown value in the same cell of the current block (unless it's known to be the same). Note that the generated code is still not used in practice, because we don't call the JIT with the right amount of context. I started fixing this in #2281, but it is still WIP. --------- Co-authored-by: chriseth <chris@ethereum.org>