New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
verilator runs out of memory at gateAll #1260
Comments
Original Redmine Comment Believable, but will need a testcase (or ideally your own debugging) to figure out why it's so bad. |
Original Redmine Comment The testcase is ready but it is large: ~.5.5 MB in compressed form. What's the best way to send it? |
Original Redmine Comment BTW, the same testcase compiles with -Og -Wno-fatal, then clang++ compiles C++ |
Original Redmine Comment The code has thousands of lines similar to this
Obviously they are machine generated. The optimizer is going crazy optimizing them. I would recommend creating more sane code, it will translate and run a lot faster. But anyhow... Fixed in git to stop optimizing at some point, and added --gate-stmts parameter to tune this. |
Original Redmine Comment In 3.920. |
Author Name: Alex Solomatnikov
Original Redmine Issue: 1260 from https://www.veripool.org
Original Assignee: Wilson Snyder (@wsnyder)
verilator consumes ~100 GB of memory at gateAll stage and runs out of memory eventually:
It looks like copy constructor is creating another copy of the graph and at that point it runs out of memory:
It looks like verilator is stuck at this point for several minutes before running out of memory.
The text was updated successfully, but these errors were encountered: