-
Notifications
You must be signed in to change notification settings - Fork 14.3k
[mlir][affine] Support vectorization with the step size exceeding 2^32-1 #66026
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: main
Are you sure you want to change the base?
Conversation
@llvm/pr-subscribers-mlir-affine ChangesSince the step size in
|
@llvm/pr-subscribers-mlir ChangesSince the step size in
|
@llvm/pr-subscribers-mlir-core ChangesSince the step size in
|
165104c
to
c3aa628
Compare
func.func @large_step_size(%A: memref<4294967295xf32>) { | ||
%cst = arith.constant 0.000000e+00 : f32 | ||
// CHECK: affine.for %{{.*}} = 0 to 256 step 549755813760 { | ||
affine.for %i = 0 to 256 step 4294967295 { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The problem is that currently loops with non-unit step sizes are not vectorized correctly (we should probably add a check and avoid vectorizing these loops).
Since the step size in
affine.for
is defined asint64_t
, we should be able to keep the precision as it is with using theint64_t
type int the vectorization pass.