DomainValues that are only used by "don't care" instructions are now
collapsed to the first possible execution domain after all basic blocks
have been processed.  This typically means the PS domain on x86.

For example, the vsel_i64 and vsel_double functions in sse2-blend.ll are
completely collapsed to the PS domain instead of containing a mix of
execution domains created by isel.

llvm-svn: 144037

Fixes r8429

llvm-svn: 144036

Add a bunch of calls to RemoveDeadNode in LegalizeDAG, so legalization doesn't get confused by CSE later on.  Fixes PR11318.

llvm-svn: 144034

llvm-svn: 144027

llvm-svn: 144026

The enterBasicBlock() function is combining live-out values from
predecessor blocks.  The RPO traversal means that more predecessors
have been visited when that happens, only back-edges are missing.

llvm-svn: 144025

llvm-svn: 144024

llvm-svn: 144023

llvm-svn: 144021

llvm-svn: 144020

llvm-svn: 144019

and add Mips64's version too.

llvm-svn: 144018

registers.

llvm-svn: 144017

floating pointer registers.

llvm-svn: 144016

llvm-svn: 144015

llvm-svn: 144014

As a side effect hex is printed lowercase instead of uppercase now.

llvm-svn: 144013

llvm-svn: 144012

llvm-svn: 144003

<rdar://problem/10405911>

llvm-svn: 144000

The xorps instruction is smaller than pxor, so prefer that encoding.

The ExecutionDepsFix pass will switch the encoding to pxor and xorpd
when appropriate.

llvm-svn: 143996

llvm-svn: 143994

llvm-svn: 143993

is used to save va_arg or byval arguments passed in registers.

llvm-svn: 143992

llvm-svn: 143991

when shift amount is larger than 32.

llvm-svn: 143990

instruction definitions.

llvm-svn: 143989

llvm-svn: 143988

llvm-svn: 143982

llvm-svn: 143974

Fixes a self-host error.

llvm-svn: 143970

llvm-svn: 143966

and TargetLowering::BuildUDIV(). Fixes PR11283

llvm-svn: 143964

llvm-svn: 143925

llvm-svn: 143924

to fix the types section (all types, not just global types), and testcases.

The code to do the final emission is disabled by default.

llvm-svn: 143923

the pubnames and pubtypes tables. LLDB can currently use this format
and a full spec is forthcoming and submission for standardization is planned.

A basic summary:

The dwarf accelerator tables are an indirect hash table optimized
for null lookup rather than access to known data. They are output into
an on-disk format that looks like this:

.-------------.
|  HEADER     |
|-------------|
|  BUCKETS    |
|-------------|
|  HASHES     |
|-------------|
|  OFFSETS    |
|-------------|
|  DATA       |
`-------------'

where the header contains a magic number, version, type of hash function,
the number of buckets, total number of hashes, and room for a special
struct of data and the length of that struct.

The buckets contain an index (e.g. 6) into the hashes array. The hashes
section contains all of the 32-bit hash values in contiguous memory, and
the offsets contain the offset into the data area for the particular
hash.

For a lookup example, we could hash a function name and take it modulo the
number of buckets giving us our bucket. From there we take the bucket value
as an index into the hashes table and look at each successive hash as long
as the hash value is still the same modulo result (bucket value) as earlier.
If we have a match we look at that same entry in the offsets table and
grab the offset in the data for our final match.

llvm-svn: 143921

llvm-svn: 143920

llvm-svn: 143919

llvm-svn: 143918