| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
|
|
| |
compare when the AND has more than one use.
This can pessimize code, inequalities are generally more expensive.
llvm-svn: 134379
|
| |
|
|
| |
llvm-svn: 134306
|
| |
|
|
|
|
| |
integers, and fix the one optimization pass that I'm aware of that needs updating for this. At least one current target, ARM NEON, can implement these operations on vectors directly.
llvm-svn: 134265
|
| |
|
|
| |
llvm-svn: 134235
|
| |
|
|
|
|
|
|
|
| |
nodes.
Original message:
Let simplify cfg simplify bb with only debug and lifetime intrinsics.
llvm-svn: 134182
|
| |
|
|
|
|
| |
overflow.
llvm-svn: 134177
|
| |
|
|
| |
llvm-svn: 134124
|
| |
|
|
| |
llvm-svn: 134112
|
| |
|
|
|
|
| |
lifetime intrinsics" due to buildbot failures.
llvm-svn: 134071
|
| |
|
|
| |
llvm-svn: 134057
|
| |
|
|
|
|
| |
mean they can be removed.
llvm-svn: 134054
|
| |
|
|
| |
llvm-svn: 134010
|
| |
|
|
| |
llvm-svn: 133992
|
| |
|
|
| |
llvm-svn: 133991
|
| |
|
|
| |
llvm-svn: 133990
|
| |
|
|
| |
llvm-svn: 133988
|
| |
|
|
|
|
| |
evaluates all other IV exprs.
llvm-svn: 133982
|
| |
|
|
|
|
| |
a bit more control over the order SCEVs are evaluated.
llvm-svn: 133959
|
| |
|
|
| |
llvm-svn: 133946
|
| |
|
|
|
|
|
|
| |
alloca that only holds a copy of a global and we're going to replace the users
of the alloca with that global, just nuke the lifetime intrinsics. Part of
PR10121.
llvm-svn: 133905
|
| |
|
|
|
|
| |
passes as well.
llvm-svn: 133904
|
| |
|
|
| |
llvm-svn: 133756
|
| |
|
|
|
|
| |
-Wshorten-64-to-32 warning in Instructions.h.
llvm-svn: 133708
|
| |
|
|
|
|
|
|
|
| |
"Reinstate r133435 and r133449 (reverted in r133499) now that the clang
self-hosted build failure has been fixed (r133512)."
Due to some additional warnings.
llvm-svn: 133700
|
| |
|
|
| |
llvm-svn: 133636
|
| |
|
|
|
|
| |
that takes an ArrayRef.
llvm-svn: 133615
|
| |
|
|
| |
llvm-svn: 133518
|
| |
|
|
| |
llvm-svn: 133514
|
| |
|
|
|
|
| |
self-hosted build failure has been fixed (r133512).
llvm-svn: 133513
|
| |
|
|
|
|
|
| |
because it won't work after my phi operand changes, because the incoming
blocks will no longer be Uses.
llvm-svn: 133512
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
ops.
This is a rewrite of the IV simplification algorithm used by
-disable-iv-rewrite. To avoid perturbing the default mode, I
temporarily split the driver and created SimplifyIVUsersNoRewrite. The
idea is to avoid doing opcode/pattern matching inside
IndVarSimplify. SCEV already does it. We want to optimize with the
full generality of SCEV, but optimize def-use chains top down on-demand rather
than rewriting the entire expression bottom-up. This was easy to do
for operations that SCEV can prove are identity function. So we're now
eliminating bitmasks and zero extends this way.
A result of this rewrite is that indvars -disable-iv-rewrite no longer
requires IVUsers.
llvm-svn: 133502
|
| |
|
|
| |
llvm-svn: 133499
|
| |
|
|
|
|
| |
functions do not appear in the module.
llvm-svn: 133478
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Change PHINodes to store simple pointers to their incoming basic blocks,
instead of full-blown Uses.
Note that this loses an optimization in SplitCriticalEdge(), because we
can no longer walk the use list of a BasicBlock to find phi nodes. See
the comment I removed starting "However, the foreach loop is slow for
blocks with lots of predecessors".
Extend replaceAllUsesWith() on a BasicBlock to also update any phi
nodes in the block's successors. This mimics what would have happened
when PHINodes were proper Users of their incoming blocks. (Note that
this only works if OldBB->replaceAllUsesWith(NewBB) is called when
OldBB still has a terminator instruction, so it still has some
successors.)
llvm-svn: 133435
|
| |
|
|
|
|
|
|
| |
Change various bits of code to make better use of the existing PHINode
API, to insulate them from forthcoming changes in how PHINodes store
their operands.
llvm-svn: 133434
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
all over the place in different styles and variants. Standardize on two
preferred entrypoints: one that takes a StructType and ArrayRef, and one that
takes StructType and varargs.
In cases where there isn't a struct type convenient, we now add a
ConstantStruct::getAnon method (whose name will make more sense after a few
more patches land).
It would be "really really nice" if the ConstantStruct::get and
ConstantVector::get methods didn't make temporary std::vectors.
llvm-svn: 133412
|
| |
|
|
|
|
|
|
| |
making usage
much cleaner.
llvm-svn: 133364
|
| |
|
|
|
|
|
|
|
|
|
| |
In cases such as the attached test, where the case value for a switch
destination is used in a phi node that follows the destination, it
might be better to replace that value with the condition value of the
switch, so that more blocks can be folded away with
TryToSimplifyUncondBranchFromEmptyBlock because there are less
conflicts in the phi node.
llvm-svn: 133344
|
| |
|
|
|
|
|
|
|
|
|
|
| |
type's bitwidth matches the (allocated) size of the alloca. This severely
pessimizes vector scalar replacement when the only vector type being used is
something like <3 x float> on x86 or ARM whose allocated size matches a
<4 x float>.
I hope to fix some of the flawed assumptions about allocated size throughout
scalar replacement and reenable this in most cases.
llvm-svn: 133338
|
| |
|
|
|
|
| |
alloca. Fixes part of <rdar://problem/9580800>.
llvm-svn: 133336
|
| |
|
|
|
|
| |
unless ScalarKind is Vector.
llvm-svn: 133335
|
| |
|
|
| |
llvm-svn: 133301
|
| |
|
|
| |
llvm-svn: 133298
|
| |
|
|
|
|
| |
Followup to 132926. rdar://problem/9265821
llvm-svn: 133285
|
| |
|
|
| |
llvm-svn: 133251
|
| |
|
|
|
|
| |
than trying to insert them immediately after the invoke.
llvm-svn: 133188
|
| |
|
|
| |
llvm-svn: 133108
|
| |
|
|
| |
llvm-svn: 133086
|
| |
|
|
| |
llvm-svn: 133085
|
| |
|
|
| |
llvm-svn: 133078
|