| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
| |
the last instruction of a basic block.
llvm-svn: 158468
|
|
|
|
| |
llvm-svn: 158467
|
|
|
|
|
|
|
|
| |
vectorise buildbot
This reverts commit 12c1f86ffa731e2952c80d2cc577000c96b8962c.
llvm-svn: 158462
|
|
|
|
| |
llvm-svn: 158461
|
|
|
|
|
|
| |
is out of range to be replaced with a scalar access. Now with additional fix and test for indexing into a vector inside a struct
llvm-svn: 158454
|
|
|
|
| |
llvm-svn: 158446
|
|
|
|
| |
llvm-svn: 158445
|
|
|
|
| |
llvm-svn: 158443
|
|
|
|
|
|
| |
uno && ueq was converted to ueq, it should be converted to uno.
llvm-svn: 158441
|
|
|
|
| |
llvm-svn: 158437
|
|
|
|
| |
llvm-svn: 158436
|
|
|
|
| |
llvm-svn: 158434
|
|
|
|
| |
llvm-svn: 158433
|
|
|
|
|
|
| |
as a scratch register when they are expanded to long branches.
llvm-svn: 158432
|
|
|
|
|
|
| |
to load an immediate that does not fit into 16-bit.
llvm-svn: 158431
|
|
|
|
|
|
|
|
| |
to load an immediate that does not fit into 16-bit. Also, take into
consideration the global base register slot on the stack when computing the
stack size.
llvm-svn: 158430
|
|
|
|
|
|
|
| |
compute the size of basic blocks in a function. Also, define a function which
emits a series of instructions to load an immediate.
llvm-svn: 158429
|
|
|
|
|
|
|
| |
Long-branches need access to the global base register to get the destination
address.
llvm-svn: 158428
|
|
|
|
|
|
|
|
|
| |
object for the global base register.
This is the first of a series of patches which implements long branch expansion
for MIPS.
llvm-svn: 158427
|
|
|
|
|
|
|
|
|
| |
delay slot filler pass of MIPS, per suggestion of Jakob Stoklund Olesen.
This change, along with the fix in r158154, enables machine verification
to be run after delay slot filling.
llvm-svn: 158426
|
|
|
|
|
|
|
|
|
|
| |
pattern:
(add v0, (add v1, abs_lo(tjt))) => (add (add v0, v1), abs_lo(tjt))
"tjt" is a TargetJumpTable node.
llvm-svn: 158419
|
|
|
|
| |
llvm-svn: 158414
|
|
|
|
| |
llvm-svn: 158413
|
|
|
|
| |
llvm-svn: 158410
|
|
|
|
| |
llvm-svn: 158409
|
|
|
|
|
|
|
|
| |
range to be replaced with a scalar access"
This reverts commit 51786e0aaec76b973205066bd44f7f427b21969f.
llvm-svn: 158408
|
|
|
|
|
|
| |
be replaced with a scalar access
llvm-svn: 158407
|
|
|
|
| |
llvm-svn: 158405
|
|
|
|
| |
llvm-svn: 158404
|
|
|
|
|
|
|
| |
combine to the absorbing element. Thanks to nbjoerg on IRC for pointing this
out.
llvm-svn: 158399
|
|
|
|
|
|
|
|
|
| |
since then the entire expression must equal zero (similarly for other operations
with an absorbing element). With this in place a bunch of reassociate code for
handling constants is dead since it is all taken care of when linearizing. No
intended functionality change.
llvm-svn: 158398
|
|
|
|
|
|
| |
one source register and zero the upper bits of the destination rather than preserving them.
llvm-svn: 158396
|
|
|
|
| |
llvm-svn: 158393
|
|
|
|
|
|
|
|
|
|
| |
This patch extends FoldBranchToCommonDest to fold unconditional branches.
For unconditional branches, we fold them if it is easy to update the phi nodes
in the common successors.
rdar://10554090
llvm-svn: 158392
|
|
|
|
|
|
|
|
| |
TableGen backends are simply written as functions now.
Patch by Sean Silva!
llvm-svn: 158389
|
|
|
|
|
|
| |
Patch by Reed Kotler.
llvm-svn: 158382
|
|
|
|
|
|
|
|
| |
until this directive is pushed in gas to open source fsf
Patch by Reed Kotler.
llvm-svn: 158381
|
|
|
|
|
|
|
|
|
|
|
| |
For store->load dependencies that may alias, we should always use
TrueMemOrderLatency, which may eventually become a subtarget hook. In
effect, we should guarantee at least TrueMemOrderLatency on at least
one DAG path from a store to a may-alias load.
This should fix the standard mode as well as -enable-aa-sched-mi".
llvm-svn: 158380
|
|
|
|
| |
llvm-svn: 158379
|
|
|
|
|
|
|
|
|
| |
non mips16
2. fix some comments to change OPcode->EXTEND for extended instructions
Patch by Reed Kotler.
llvm-svn: 158378
|
|
|
|
| |
llvm-svn: 158373
|
|
|
|
| |
llvm-svn: 158371
|
|
|
|
|
|
|
| |
POD type, causing memory corruption when mapping to APInts with bitwidth > 64.
Merge another crash testcase into crash.ll while there.
llvm-svn: 158369
|
|
|
|
|
|
| |
Patch by Jush Lu <jush.msn@gmail.com>.
llvm-svn: 158368
|
|
|
|
|
|
|
| |
On the POWER7, adds and logical operations can also be handled
in the load/store pipelines. We'll call these IntSimple.
llvm-svn: 158366
|
|
|
|
|
|
|
|
|
| |
POWER4 is a 64-bit CPU (better matched to the 970).
The g3 is really the 750 (no altivec), the g4+ is the 74xx (not the 750).
Patch by Andreas Tobler.
llvm-svn: 158363
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
topologies, it is quite possible for a leaf node to have huge multiplicity, for
example: x0 = x*x, x1 = x0*x0, x2 = x1*x1, ... rapidly gives a value which is x
raised to a vast power (the multiplicity, or weight, of x). This patch fixes
the computation of weights by correctly computing them no matter how big they
are, rather than just overflowing and getting a wrong value. It turns out that
the weight for a value never needs more bits to represent than the value itself,
so it is enough to represent weights as APInts of the same bitwidth and do the
right overflow-avoiding dance steps when computing weights. As a side-effect it
reduces the number of multiplies needed in some cases of large powers. While
there, in view of external uses (eg by the vectorizer) I made LinearizeExprTree
static, pushing the rank computation out into users. This is progress towards
fixing PR13021.
llvm-svn: 158358
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
__ppc__.
Original commit message:
Move PPC host-CPU detection logic from PPCSubtarget into sys::getHostCPUName().
Both the new Linux functionality and the old Darwin functions have been moved.
This change also allows this information to be queried directly by clang and
other frontends (clang, for example, will now have real -mcpu=native support).
llvm-svn: 158349
|
|
|
|
| |
llvm-svn: 158346
|
|
|
|
|
|
|
|
|
| |
sys::getHostCPUName()."
This commit broke most of the PowerPC unit tests when running on
Intel/Apple.
llvm-svn: 158345
|