-
Notifications
You must be signed in to change notification settings - Fork 273
Simplify multiple-of-element size access to arrays #8627
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
base: develop
Are you sure you want to change the base?
Conversation
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## develop #8627 +/- ##
=========================================
Coverage 80.37% 80.38%
=========================================
Files 1686 1686
Lines 206885 207022 +137
Branches 73 73
=========================================
+ Hits 166276 166405 +129
- Misses 40609 40617 +8 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Is there a way to share some of the pattern matching conditions between the array-read and array-write cases ? |
Seems like we should also be able to pattern match an access to a member of a struct in an array of structs like a[i].m, the offset would be of the form i*sizeof(T) + offset(T,m) and turn that into a functional update as well ? |
959a535
to
0307a14
Compare
Done. |
Array operations may fall back to byte_extract or byte_update expressions in parts of the code base. Simplify this to index or WITH expressions, respectively, when the offset is known to be a multiple of the array-element size, or a constant offset plus a multiple of the array-element size.
0307a14
to
ba35ebf
Compare
Array operations may fall back to byte_extract or byte_update expressions in parts of the code base. Simplify this to index or WITH expressions, respectively, when the offset is known to be a multiple of the array-element size.