| Commit message (Collapse) | Author | Age | Files | Lines |
... | |
|
|
|
|
|
|
|
| |
If we see that a load depends on the allocation of its memory with no
intervening stores, we now return a 'None' depedency instead of "Normal".
This tweaks GVN to do its optimization with the new result.
llvm-svn: 60267
|
|
|
|
|
|
|
| |
method that returns its result as a DepResultTy instead of as a
MemDepResult. This reduces conversion back and forth.
llvm-svn: 60266
|
|
|
|
|
|
| |
the file, no functionality change.
llvm-svn: 60265
|
|
|
|
|
|
| |
comments about what this class does.
llvm-svn: 60264
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
dependencies. The basic situation was this: consider if we had:
store1
...
store2
...
store3
Where memdep thinks that store3 depends on store2 and store2 depends
on store1. The problem happens when we delete store2: The code in
question was updating dep info for store3 to be store1. This is a
spiffy optimization, but is not safe at all, because aliasing isn't
transitive. This bug isn't exposed today with DSE because DSE will only
zap store2 if it is identifical to store 3, and in this case, it is
safe to update it to depend on store1. However, memcpyopt is not so
fortunate, which is presumably why the "dropInstruction" code used to
exist.
Since this doesn't actually provide a speedup in practice, just rip the
code out.
llvm-svn: 60263
|
|
|
|
|
|
| |
Fix a subtle iterator invalidation bug I introduced in the last commit.
llvm-svn: 60258
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
an entry in the nonlocal deps map, don't reset entries
referencing that instruction to [dirty, null], instead, set
them to [dirty,next] where next is the instruction after the
deleted one. Use this information in the non-local deps
code to avoid rescanning entire blocks.
This speeds up GVN slightly by avoiding pointless work. On
403.gcc this makes GVN 1.5% faster.
llvm-svn: 60256
|
|
|
|
|
|
|
| |
a smallvector instead of a DenseMap. This speeds up GVN by 5%
on 403.gcc.
llvm-svn: 60255
|
|
|
|
|
|
| |
no functionality/code change.
llvm-svn: 60254
|
|
|
|
|
|
|
| |
formulation that is faster and doesn't require nonLazyHelper.
Much less code.
llvm-svn: 60253
|
|
|
|
| |
llvm-svn: 60251
|
|
|
|
| |
llvm-svn: 60242
|
|
|
|
| |
llvm-svn: 60241
|
|
|
|
|
|
|
| |
Put a some code back to handle buggy behavior that GVN expects: it wants
loads to depend on each other, and accesses to depend on their allocations.
llvm-svn: 60240
|
|
|
|
|
|
|
| |
Use getTypeStoreSize instead of ABITypeSize for in-memory size
in a couple places.
llvm-svn: 60238
|
|
|
|
|
|
|
| |
former does caching, the later doesn't. This dramatically simplifies
the logic in getDependency and getDependencyFrom.
llvm-svn: 60234
|
|
|
|
|
|
| |
to fail.
llvm-svn: 60233
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Document the Dirty value more precisely, use it for the uninitialized
DepResultTy value. Change reverse mappings to be from an instruction*
instead of DepResultTy, and stop tracking other forms. This makes it more
clear that we only care about the instruction cases.
Eliminate a DepResultTy,bool pair by using Dirty in the local case as well,
shrinking the map and simplifying the code.
This speeds up GVN by ~3% on 403.gcc.
llvm-svn: 60232
|
|
|
|
|
|
|
|
|
|
|
| |
query. This makes it crystal clear what cases can escape from MemDep that
the clients have to handle. This also gives the clients a nice simplified
interface to it that is easy to poke at.
This patch also makes DepResultTy and MemoryDependenceAnalysis::DepType
private, yay.
llvm-svn: 60231
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
of a pointer/int pair instead of a manually bitmangled pointer.
This forces clients to think a little more about checking the
appropriate pieces and will be useful for internal
implementation improvements later.
I'm not particularly happy with this. After going through this
I don't think that the clients of memdep should be exposed to
the internal type at all. I'll fix this in a subsequent commit.
This has no functionality change.
llvm-svn: 60230
|
|
|
|
|
|
|
| |
properly updates the reverse dependency map when it installs updated
dependencies for instructions that depend on the removed instruction.
llvm-svn: 60222
|
|
|
|
| |
llvm-svn: 60221
|
|
|
|
|
|
| |
no functionality change.
llvm-svn: 60219
|
|
|
|
| |
llvm-svn: 60218
|
|
|
|
|
|
| |
This shows the root problem behind PR3141.
llvm-svn: 60216
|
|
|
|
|
|
|
|
| |
but it doesn't make any sense at all.
Also make the method const, private, and fit in 80 cols while we're at it.
llvm-svn: 60215
|
|
|
|
| |
llvm-svn: 60213
|
|
|
|
| |
llvm-svn: 60211
|
|
|
|
|
|
|
| |
predecessor is itself. This doesn't make sense, and this is
a dead infinite loop anyway.
llvm-svn: 60210
|
|
|
|
|
|
| |
gcc 4.4 (due to use of sprintf).
llvm-svn: 60209
|
|
|
|
|
|
| |
being both a namespace and a variable name.
llvm-svn: 60208
|
|
|
|
|
|
| |
formulation that doesn't require set lookups or scanning a set.
llvm-svn: 60203
|
|
|
|
|
|
|
| |
nothing to do with dead instruction elimination. No tests in
dejagnu depend on this, so I don't know what it was needed for.
llvm-svn: 60202
|
|
|
|
|
|
|
| |
elimination to use more modern infrastructure. Also do a bunch
of small cleanups.
llvm-svn: 60201
|
|
|
|
|
|
| |
RecursivelyDeleteTriviallyDeadInstructions.
llvm-svn: 60196
|
|
|
|
|
|
|
| |
making it use RecursivelyDeleteTriviallyDeadInstructions to do
the heavy lifting.
llvm-svn: 60195
|
|
|
|
|
|
| |
PHIs dead if they are single-value.
llvm-svn: 60194
|
|
|
|
|
|
| |
return a list of deleted instructions.
llvm-svn: 60193
|
|
|
|
| |
llvm-svn: 60192
|
|
|
|
|
|
|
|
|
|
| |
wrappers around the interesting code and use an obscure iterator
abstraction that dates back many many years.
Move EraseDeadInstructions to Transforms/Utils and name it
RecursivelyDeleteTriviallyDeadInstructions.
llvm-svn: 60191
|
|
|
|
| |
llvm-svn: 60190
|
|
|
|
| |
llvm-svn: 60189
|
|
|
|
| |
llvm-svn: 60188
|
|
|
|
| |
llvm-svn: 60187
|
|
|
|
| |
llvm-svn: 60186
|
|
|
|
|
|
| |
by 1, as well as multiply by -1.
llvm-svn: 60182
|
|
|
|
|
|
| |
it ends up being the entry block.
llvm-svn: 60180
|
|
|
|
|
|
| |
move the other block back up into the entry position!
llvm-svn: 60179
|
|
|
|
|
|
|
| |
Despite changing the order of evaluation, this doesn't actually change the
meaning of the statement.
llvm-svn: 60177
|
|
|
|
| |
llvm-svn: 60175
|