the second (store) instruction in SpillSlotToUsesMap
consistently.  I don't think this matters functionally,
but it's cleaner and Evan wants it this way.

llvm-svn: 85463

llvm-svn: 85460

cascading "ifs" of strcmps/memcmps.

llvm-svn: 85459

llvm-svn: 85458

llvm-svn: 85457

--- Reverse-merging r85338 into '.':
U    lib/CodeGen/SimpleRegisterCoalescing.cpp
U    lib/CodeGen/SimpleRegisterCoalescing.h

llvm-svn: 85454

llvm-svn: 85451

llvm-svn: 85449

llvm-svn: 85445

common tail, except when the OptimizeForSize function attribute is present.
Radar 7338114.

llvm-svn: 85441

to spill after all, we weren't handling 2-instruction
spill sequences correctly (PPC Altivec).  We need to
remove the store in this case.  Removing the other
instruction(s) would be goodness but is not needed for
correctness, and isn't done here.  7331562.

llvm-svn: 85437

llvm-svn: 85436

I'm going to redo this using the OptimizeForSize function attribute.

llvm-svn: 85426

ArraySize * ElementSize
ElementSize * ArraySize
ArraySize << log2(ElementSize)
ElementSize << log2(ArraySize)

Refactor isArrayMallocHelper and delete isSafeToGetMallocArraySize, so that there is only 1 copy of the malloc array determining logic.
Update users of getMallocArraySize() to not bother calling isArrayMalloc() as well.

llvm-svn: 85421

llvm-svn: 85419

This fixes parallel build with clang on glibc platforms.

llvm-svn: 85414

llvm-svn: 85412

opcode and operand with a tab.  Check for these instructions in the usual
places.

llvm-svn: 85411

llvm-svn: 85410

llvm-svn: 85406

llvm-svn: 85402

stuff) to programmatically control the current debug flavor.  While 
I'm at it, doxygenate Debug.h and clean it up.

llvm-svn: 85395

chains have no users, they can't be predecessors of the condition.

llvm-svn: 85394

the new instructions and leave the old one in place.

llvm-svn: 85393

llvm-svn: 85390

llvm-svn: 85389

llvm-svn: 85388

llvm-svn: 85387

and eliminate confusing double-use of SSA names
(work in progress)

llvm-svn: 85385

purposes for GVN/DSE.

llvm-svn: 85383

Checks on Demand algorithm which looks at arbitrary branches instead of loop
iterations. This is GSoC work by Andre Tavares with only editorial changes
applied!

llvm-svn: 85382

llvm-svn: 85381

to depend on Ref and ModRef calls within the invariant region.

llvm-svn: 85380

llvm-svn: 85379

purely local for now.

llvm-svn: 85378

round trip blockaddress through .ll and .bc files, so add a testcase.

There are still a bunch of places in the optimizer and other places
that need to be updated to work with these constructs, but at least
the basics are in now.

llvm-svn: 85377

llvm-svn: 85376

In the new world order, BlockAddress can have a BasicBlock operand.
This doesn't permute much, because if you have a ConstantExpr (or
anything more specific than Constant) we still know the operand has
to be a Constant.

llvm-svn: 85375

llvm-svn: 85372

readonly section if a reference to the containing function
is valid in the readonly section.

llvm-svn: 85370