[Relax] Add size heuristic to skip folding large creation ops#18764
Conversation
Summary of ChangesHello @guan404ming, I'm Gemini Code Assist1! I'm currently reviewing this pull request and will post my feedback shortly. In the meantime, here's a summary to help you and other reviewers quickly get up to speed! This pull request introduces a crucial optimization to the constant folding pass by preventing the folding of large creation operations that lack tensor inputs. This change significantly reduces the size of the compiled binary by avoiding the unnecessary embedding of large, easily computable constants, thereby improving overall efficiency without compromising correctness. Highlights
🧠 New Feature in Public Preview: You can now enable Memory to help Gemini Code Assist learn from your team's feedback. This makes future code reviews more consistent and personalized to your project's style. Click here to enable Memory in your admin console. Changelog
Activity
Using Gemini Code AssistThe full guide for Gemini Code Assist can be found on our documentation page, here are some quick tips. Invoking Gemini You can request assistance from Gemini at any point by creating a comment using either
Customization To customize Gemini Code Assist for GitHub experience, repository maintainers can create a configuration file and/or provide a custom code review style guide (such as PEP-8 for Python) by creating and adding files to a Limitations & Feedback Gemini Code Assist may make mistakes. Please leave feedback on any instances where its feedback is incorrect or counter productive. You can react with 👍 and 👎 on @gemini-code-assist comments. If you're interested in giving your feedback about your experience with Gemini Code Assist for Github and other Google products, sign up here. You can also get AI-powered code generation, chat, as well as code reviews directly in the IDE at no cost with the Gemini Code Assist IDE Extension. Footnotes
|
There was a problem hiding this comment.
Code Review
This pull request introduces a valuable heuristic to skip constant folding for large creation operations, which helps in reducing the final binary size. The implementation is well-structured and the accompanying tests cover the primary scenarios. I've identified a couple of areas for improvement: a potential integer overflow during the calculation of the number of elements in a tensor, and a bug in the logic for detecting tensor inputs within nested tuples. My review includes suggestions to address these points for a more robust implementation.
7a35680 to
7680c2d
Compare
Signed-off-by: Guan-Ming Chiu <guanmingchiu@gmail.com>
7680c2d to
09a68e5
Compare
Why
Folding large creation ops (zeros, ones, full, arange) with no tensor inputs materializes large constants in
the binary unnecessarily, since they are cheap to compute at runtime.
How