| Commit message (Collapse) | Author | Age | Files | Lines |
| ... | |
| |
|
|
|
|
| |
are there under ADD, this one was missing.
llvm-svn: 61107
|
| |
|
|
|
|
| |
now until I finish working out some iterator invalidation issues.
llvm-svn: 61104
|
| |
|
|
|
|
|
| |
the load multiple times, make sure the check the uses of the PHI to
ensure they are transformable.
llvm-svn: 61102
|
| |
|
|
| |
llvm-svn: 61101
|
| |
|
|
|
|
|
|
| |
consistently for deleting branches. In addition to being slightly
more readable, this makes SimplifyCFG a bit better
about cleaning up after itself when it makes conditions unused.
llvm-svn: 61100
|
| |
|
|
|
|
|
| |
position in the critical path during the main instruction walk. This
eliminates the need for the CritialAntiDep DenseMap.
llvm-svn: 61096
|
| |
|
|
|
|
| |
builds.
llvm-svn: 61094
|
| |
|
|
|
|
| |
different offsets within the same stack slot.
llvm-svn: 61093
|
| |
|
|
|
|
| |
matching input operand with incompatible type (i.e. either one is a floating point and the other is an integer or the sizes of the types differ). SelectionDAGBuild will catch these and exit with an error.
llvm-svn: 61092
|
| |
|
|
| |
llvm-svn: 61087
|
| |
|
|
|
|
|
| |
which source/line a certain BB/instruction comes from, original variable names,
and original (unmangled) C++ name of functions.
llvm-svn: 61085
|
| |
|
|
|
|
|
| |
instruction or BasicBlock, and to search for DbgDeclareInst corresponding to a
variable.
llvm-svn: 61084
|
| |
|
|
| |
llvm-svn: 61083
|
| |
|
|
|
|
| |
and support for non-unit strides with signed exit conditions.
llvm-svn: 61082
|
| |
|
|
| |
llvm-svn: 61081
|
| |
|
|
|
|
|
|
| |
visited set before they are used. If used, their blocks need to be
added to the visited set so that subsequent queries don't use conflicting
pointer values in the cache result blocks.
llvm-svn: 61080
|
| |
|
|
| |
llvm-svn: 61078
|
| |
|
|
|
|
|
| |
one of its aliases defined. This is conservative, but tricky subreg
corner cases are outside the primary aim of this pass.
llvm-svn: 61077
|
| |
|
|
|
|
|
| |
especially in the case of addresses computed from loop induction
variables.
llvm-svn: 61075
|
| |
|
|
|
|
|
| |
latency computation code that is no longer needed with the
new method for handling latencies.
llvm-svn: 61074
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
computation code. Also, avoid adding output-depenency edges when both
defs are dead, which frequently happens with EFLAGS defs.
Compute Depth and Height lazily, and always in terms of edge latency
values. For the schedulers that don't care about latency, edge latencies
are set to 1.
Eliminate Cycle and CycleBound, and LatencyPriorityQueue's Latencies array.
These are all subsumed by the Depth and Height fields.
llvm-svn: 61073
|
| |
|
|
|
|
| |
instruction itinerary data to back-schedule loads.
llvm-svn: 61070
|
| |
|
|
| |
llvm-svn: 61067
|
| |
|
|
|
|
| |
currently used by anything.
llvm-svn: 61066
|
| |
|
|
| |
llvm-svn: 61065
|
| |
|
|
|
|
| |
variable sized array allocations.
llvm-svn: 61051
|
| |
|
|
| |
llvm-svn: 61050
|
| |
|
|
| |
llvm-svn: 61047
|
| |
|
|
|
|
| |
ValueIsOnlyUsedLocallyOrStoredToOneGlobal.
llvm-svn: 61046
|
| |
|
|
|
|
| |
Use GetElementPtrInst::hasAllZeroIndices where possible.
llvm-svn: 61045
|
| |
|
|
|
|
| |
intrinsics are properly marked nocapture, the fixme should be addressed.
llvm-svn: 61040
|
| |
|
|
| |
llvm-svn: 61036
|
| |
|
|
| |
llvm-svn: 61033
|
| |
|
|
|
|
| |
comments about why we're not getting other cases.
llvm-svn: 61032
|
| |
|
|
| |
llvm-svn: 61031
|
| |
|
|
|
|
|
|
|
|
| |
alignment attribute such that 0 means unaligned.
This will probably require a rebuild of llvm-gcc because of the change to
Attributes.h. If you see many test failures on "make check", please rebuild
your llvm-gcc.
llvm-svn: 61030
|
| |
|
|
|
|
|
| |
and insert vector element. Modified extract vector element to extend the
result to match the expected promoted type.
llvm-svn: 61029
|
| |
|
|
| |
llvm-svn: 61028
|
| |
|
|
|
|
|
|
|
| |
CFG when there is exactly one predecessor where the load is not available.
This is designed to not increase code size but still eliminate partially
redundant loads. This fires 1765 times on 403.gcc even though it doesn't
do critical edge splitting yet (the most common reason for it to fail).
llvm-svn: 61027
|
| |
|
|
|
|
|
| |
return *just* a clobber of the start block, not other
random stuff as well.
llvm-svn: 61026
|
| |
|
|
| |
llvm-svn: 61024
|
| |
|
|
|
|
|
| |
cleans up the generated code a bit. This should have the added benefit of
not randomly renaming functions/globals like my previous patch did. :)
llvm-svn: 61023
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
memdep keeps track of how PHIs affect the pointer in dep queries, which
allows it to eliminate the load in cases like rle-phi-translate.ll, which
basically end up being:
BB1:
X = load P
br BB3
BB2:
Y = load Q
br BB3
BB3:
R = phi [P] [Q]
load R
turning "load R" into a phi of X/Y. In addition to additional exposed
opportunities, this makes memdep safe in many cases that it wasn't before
(which is required for load PRE) and also makes it substantially more
efficient. For example, consider:
bb1: // has many predecessors.
P = some_operator()
load P
In this example, previously memdep would scan all the predecessors of BB1
to see if they had something that would mustalias P. In some cases (e.g.
test/Transforms/GVN/rle-must-alias.ll) it would actually find them and end
up eliminating something. In many other cases though, it would scan and not
find anything useful. MemDep now stops at a block if the pointer is defined
in that block and cannot be phi translated to predecessors. This causes it
to miss the (rare) cases like rle-must-alias.ll, but makes it faster by not
scanning tons of stuff that is unlikely to be useful. For example, this
speeds up GVN as a whole from 3.928s to 2.448s (60%)!. IMO, scalar GVN
should be enhanced to simplify the rle-must-alias pointer base anyway, which
would allow the loads to be eliminated.
In the future, this should be enhanced to phi translate through geps and
bitcasts as well (as indicated by FIXMEs) making memdep even more powerful.
llvm-svn: 61022
|
| |
|
|
|
|
|
|
| |
is disabled for now, as it actually pessimizes code in the abscence
of phi translation for load elimination. This slow down GVN a bit, by about 2% on 403.gcc.
llvm-svn: 61021
|
| |
|
|
|
|
|
| |
Remove TODO; icmp isn't a binary operator, so this function will never deal
with them.
llvm-svn: 61020
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
callee will not introduce any new aliases of that pointer.
The attributes had all bits allocated already, so I decided to collapse
alignment. Alignment was previously stored as a 16-bit integer from bits 16 to
32 of the attribute, but it was required to be a power of 2. Now it's stored in
log2 encoded form in five bits from 16 to 21. That gives us 11 more bits of
space.
You may have already noticed that you only need four bits to encode a 16-bit
power of two, so why five bits? Because the AsmParser accepted 32-bit
alignments, even though we couldn't store them (they were silently discarded).
Now we can store them in memory, but not in the bitcode.
The bitcode format was already storing these as 64-bit VBR integers. So, the
bitcode format stays the same, keeping the alignment values stored as 16 bit
raw values. There's some hideous code in the reader and writer that deals with
this, waiting to be ripped out the moment we run out of bits again and have to
replace the parameter attributes table encoding.
llvm-svn: 61019
|
| |
|
|
| |
llvm-svn: 61014
|
| |
|
|
| |
llvm-svn: 61013
|
| |
|
|
| |
llvm-svn: 61012
|
| |
|
|
| |
llvm-svn: 61009
|