Displaying 2 results from an estimated 2 matches for "delinerarize".
Did you mean:
delinearize
2020 Oct 03
2
Information about the number of indices in memory accesses
...e
> LLVM-IR
>
> int C[n][m];
> C[y][x];
>
> Delinearization as mentioned by Stefanos tries to recover the two
> subscripts x and y, but can only do so heuristically. Also keep in mind
> that
> C[1][-1] appears as the same IR as C[0][m-1], so there is no unique way to
> delinerarize. In particular, one cannot just assume that if all indices are
> different, that the memory locations being accessed are different (again, a
> pointer aliasing problem)
>
> Michael
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
> Am Fr., 2. Okt. 2020...
2020 Oct 03
2
Information about the number of indices in memory accesses
Hi Ees,
SCEV Delinearization is the closest I know. But it has its problems. Well
for one your expression should be SCEVable.
But more importantly, SCEV Delinearization is trying to deduce something
that is high-level (actually source-level) from a low-level IR in which a
lot of this info has been lost. So, since there's not a 1-1 mapping from
high-level code to LLVM IR, going backwards will