memsets that initialize "structs of arrays" and other store sequences
that are not sequential.  This is still only enabled if you pass 
-form-memset-from-stores.  The flag is not heavily tested and I haven't
analyzed the perf regressions when -form-memset-from-stores is passed
either, but this causes no make check regressions.

llvm-svn: 48909

Increment iterator in advance.

llvm-svn: 48890

Handle a special case xor undef, undef -> 0. Technically this should be transformed to undef. But this is such a common idiom (misuse) we are going to handle it.

llvm-svn: 48791

llvm-svn: 48738

Increasing the inline limit from (overly conservative) 200 to 300. Given each BB costs 20 and each instruction costs 5, 200 means a 4 BB function + 24 instructions (actually less because caller's size also contributes to it).

Furthermore, double the limit when more than 10% of the callee instructions are vector instructions. Multimedia kernels tend to love inlining.

llvm-svn: 48725

llvm-svn: 48720

Transform (zext (or (icmp), (icmp))) to (or (zext (cimp), (zext icmp))) if at least one of the (zext icmp) can be transformed to eliminate an icmp.

llvm-svn: 48715

llvm-svn: 48708

This fires dozens of times across spec and multisource, but I don't know
if it actually speeds stuff up.  Hopefully the testers will show something
nice :)

llvm-svn: 48680

llvm-svn: 48679

merging optimization.  Nothing to see here, hopefully more later :)

llvm-svn: 48670

adding <map> to many files that actually do need it.

llvm-svn: 48667

llvm-svn: 48662

each basic block.

llvm-svn: 48660

llvm-svn: 48658

from their aggregate operands by moving the getresult
instructions.

llvm-svn: 48657

llvm-svn: 48648

llvm-svn: 48639

simplify things like (X & 4) >> 1 == 2  --> (X & 4) == 4.

since it is obvious that the shift doesn't remove any bits.

llvm-svn: 48631

- Fix loop nest.
- Use RetVals.size()
- Check for null return value.

llvm-svn: 48605

Patch by Erick Tryzelaar.

llvm-svn: 48602

llvm-svn: 48588

llvm-svn: 48573

llvm-svn: 48567

llvm-svn: 48556

llvm-svn: 48474

Patch originally by Erick Tryzelaar, but has been modified somewhat.

llvm-svn: 48419

the type instead of the byte size. This was causing troublesome mis-compilations.

True to form, this took 2 days to find and is a one-line fix. :-P

llvm-svn: 48354

pointer bitcast when performing return slot optimization.

llvm-svn: 48343

successors. This makes it support nounwind.

llvm-svn: 48320

1. There is now a "PAListPtr" class, which is a smart pointer around
   the underlying uniqued parameter attribute list object, and manages
   its refcount.  It is now impossible to mess up the refcount.
2. PAListPtr is now the main interface to the underlying object, and
   the underlying object is now completely opaque.
3. Implementation details like SmallVector and FoldingSet are now no
   longer part of the interface.
4. You can create a PAListPtr with an arbitrary sequence of
   ParamAttrsWithIndex's, no need to make a SmallVector of a specific 
   size (you can just use an array or scalar or vector if you wish).
5. All the client code that had to check for a null pointer before
   dereferencing the pointer is simplified to just access the 
   PAListPtr directly.
6. The interfaces for adding attrs to a list and removing them is a
   bit simpler.

Phase #2 will rename some stuff (e.g. PAListPtr) and do other less 
invasive changes.

llvm-svn: 48289

Improve the return slot optimization to be both more aggressive (not limited to sret parameters), and 
safer (when the passed pointer might be invalid).  Thanks to Duncan and Chris for the idea behind this, 
and extra thanks to Duncan for helping me work out the trap-safety.

llvm-svn: 48280

llvm-svn: 48267

llvm-svn: 48262

llvm-svn: 48254

llvm-svn: 48253

before trying to merge the block into its predecessors.
This allows two-entry-phi-return.ll to be simplified
into a single basic block.

llvm-svn: 48252

llvm-svn: 48233

Right now, the pass does not optimize tail recursions 
involving multiple return values.

llvm-svn: 48228

llvm-svn: 48227