Polly Transformation Pass[strip mining]

[harish c]

Hello All,

I'm new to Polly and going through the thesis 'ENABLING POLYHEDRAL OPTIMIZATIONS IN LLVM, where I've come across a below transformation (STRIP MINING).

In that context, I've created a pass where it could dump the schedule({ Stmt0[i0] -> [o0] : o0 = i0 }) and I'm stuck on how to proceed on applying the above transformation.

Is there an existing LLVM(or Polly) pass that does this transformation? If not, can someone give me pointers on how to implement this as a pass?

Thanks in advance.

Regards,

Harish C

[Harish]

Thanks, I'll check it out.

On Sat, May 1, 2021 at 1:07 AM Michael Kruse <Michae...@meinersbur.de> wrote:

Polly does tiling (https://github.com/llvm/llvm-project/blob/ad12590fdd1459ffb8db185ea1b45748c20b538e/polly/lib/Transform/ScheduleOptimizer.cpp#L745) which is a superset of strip-mining, like tiling with only one loop. It also does strip-mining as supporting transformation for vectorization (called pre-vectorizeron; option `-polly-vectorizer=stripmine`; https://github.com/llvm/llvm-project/blob/ad12590fdd1459ffb8db185ea1b45748c20b538e/polly/lib/Transform/ScheduleOptimizer.cpp#L710) which also just uses tiling with just one dimension.

Michael

--
You received this message because you are subscribed to the Google Groups "Polly Development" group.
To unsubscribe from this group and stop receiving emails from it, send an email to polly-dev+...@googlegroups.com.
To view this discussion on the web, visit https://groups.google.com/d/msgid/polly-dev/cf383b74-abed-4b6d-b6d9-71e1feb05443n%40googlegroups.com.

--

Tardyzentrismus verboten!