verilator/test_regress
Geza Lore 7e55c62cac
Improve combinational cycle fixup in Dfg (#6744) (#6746)
Now that we have an efficient algorithm to analyse which bits in a
combinational cycle are not dependent on the cycle, can simplify the
cycle fixup algorithms. Remove FixUpSelDrivers: this was a heuristic
to save on the expensive independent bits analysis, but itself can
cause a performance problem on certain inputs that result in a large
number of attempted fixups. Doing this simplifies the driver tracing
algorithm, and because we now only attempt to trace drivers that are
known to be independent of the cycles, it should always succeed...
Unless of course there is a mismatch between the independent bit
analysis ant the driver tracing algorithm. In such case (when we managed
to prove independence, but then fail to trace a driver), we will crash,
which is still easier to sv-bugpoint than a performance bug.

Fixes #6744
2025-12-08 18:43:21 +00:00
..
t Improve combinational cycle fixup in Dfg (#6744) (#6746) 2025-12-08 18:43:21 +00:00
.gdbinit
.gitignore
CMakeLists.txt
Makefile Internals: Run format-make 2025-11-01 14:12:47 -04:00
Makefile_obj
driver.py Tests: Fix make_main traceEverOn after eval (#6727) 2025-11-24 07:37:49 -05:00
input.vc
input.xsim.vc