| commit | 7313aa576dc9327e7d68660c007a317bd498e372 | |
| author | Michael Kruse <llvm@meinersbur.de> | |
| Sat, 6 Feb 2016 09:19:40 +0000 (6 09:19 +0000) | ||
| committer | Michael Kruse <llvm@meinersbur.de> | |
| Sat, 6 Feb 2016 09:19:40 +0000 (6 09:19 +0000) | ||
| tree | 1e0042164af9e78e373b4eeb5a27a97b8d581404 | treesnapshot (tar.gz zip) |
| parent | 419575163a8a4ea89bc88539ccb6ec2eb2751afb | commitdiff |
Follow uses to create value MemoryAccesses
The previously implemented approach is to follow value definitions and
create write accesses ("push defs") while searching for uses. This
requires the same relatively validity- and requirement conditions to be
replicated at multiple locations (PHI instructions, other instructions,
uses by PHIs).
We replace this by iterating over the uses in a SCoP ("pull in
requirements"), and add writes only when at least one read has been
added. It turns out to be simpler code because each use is only iterated
over once and writes are added for the first access that reads it. We
need another iteration to identify escaping values (uses not in the
SCoP), which also makes the difference between such accesses more
obvious. As a side-effect, the order of scalar MemoryAccess can change.
Differential Revision: http://reviews.llvm.org/D15706
git-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@259987 91177308-0d34-0410-b5e6-96231b3b80d8
The previously implemented approach is to follow value definitions and
create write accesses ("push defs") while searching for uses. This
requires the same relatively validity- and requirement conditions to be
replicated at multiple locations (PHI instructions, other instructions,
uses by PHIs).
We replace this by iterating over the uses in a SCoP ("pull in
requirements"), and add writes only when at least one read has been
added. It turns out to be simpler code because each use is only iterated
over once and writes are added for the first access that reads it. We
need another iteration to identify escaping values (uses not in the
SCoP), which also makes the difference between such accesses more
obvious. As a side-effect, the order of scalar MemoryAccess can change.
Differential Revision: http://reviews.llvm.org/D15706
git-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@259987 91177308-0d34-0410-b5e6-96231b3b80d8
16 files changed: