Drive the analysis of interleaved memory accesses in the loop.
Synopsis
Declared in <llvm/Analysis/VectorUtils.h>
class InterleavedAccessInfo;
Description
Use this class to analyze interleaved accesses only when we can vectorize a loop. Otherwise it's meaningless to do analysis as the vectorization on interleaved accesses is unsafe.
The analysis collects interleave groups and records the relationships between the member and the group in a map.
Member Functions
Name |
Description |
|
Construct interleaved‐access analysis for loop |
|
Destroy the analysis and release all interleave groups. |
Analyze interleaved accesses and collect them into interleave groups. |
|
Get the interleave group that |
|
Return an iterator range over the interleave groups found by analysis. |
|
Returns true if we have any interleave groups. |
|
Invalidate all interleave groups. |
|
Invalidate groups that require a scalar epilogue due to gaps. |
|
Check if |
|
Returns true if an interleaved group that may access memory out‐of‐bounds requires a scalar epilogue iteration for correctness. |
Created with MrDocs