[MLIR] Loop invariant cache generalization
Open
- Dominant language
- LLVM
- Stars
- 1.7k
- Forks
- 188
- Avg merge
- 1d 22h
- Merged PRs (30d)
- 26
Description
we should generalize this for the lower-upper bound check instead of just alloca/memref load (incl affine load).
Contributor guide
Research direction
Start by locating the MLIR loop-invariant cache logic that handles alloca and memref loads, including affine loads. Trace how the lower-upper bound check is currently handled and identify the relevant tests; done means the check is generalized beyond those load cases.
Written by the indexing model from the issue text.
Assessment
- Domain
- compilers
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100