llvm-svn: 33422

llvm-svn: 33421

llvm-svn: 33420

Regenerate for ARM support.

llvm-svn: 33419

llvm-svn: 33418

llvm-svn: 33417

llvm-svn: 33416

Clean up handling of isFloatingPoint() and dealing with PackedType.
Patch by Gordon Henriksen!

llvm-svn: 33415

We only want to do this if the src and destination types have the same
bit width. This patch uses TargetData::getTypeSizeInBits() instead of
making a special case for integer types and avoiding the transform if
they don't match.

llvm-svn: 33414

to ensure the bit size of a type is identical before proceeding.

llvm-svn: 33413

Bytecode format.

llvm-svn: 33412

an unspecified datatype in the datalayout is capped by the size of a pointer.

llvm-svn: 33411

llvm-svn: 33410

these alignment amounts to align scalars when we can.  Patch by Scott Michel!

llvm-svn: 33409

that disassembleBuffer will be called even if NDEBUG, but the result will
be ignored.

llvm-svn: 33408

Regenerate to include NetBSD.

llvm-svn: 33407

NetBSD also doesn't have pthread_mutexattr_setpshared

llvm-svn: 33406

Add support for NetBSD.

llvm-svn: 33405

llvm-svn: 33404

a small inline function to sign extend a uint64_t value based on its
type's bitwidth. This function is then used in both executeSExtInst and
the various executeICMP_S** functions.

llvm-svn: 33403

llvm-svn: 33401

llvm-svn: 33400

Last check-in was bogus. There is no need to align the stack if the function is a leaf function (and without alloca).

llvm-svn: 33399

llvm-svn: 33398

llvm-svn: 33397

llvm-svn: 33396

llvm-svn: 33395

This patch fixes test/Integer/2007-01-17-TruncSext.ll

llvm-svn: 33394

llvm-svn: 33393

llvm-svn: 33392

llvm-svn: 33391

llvm-svn: 33390

llvm-svn: 33389

llvm-svn: 33388

We not align the final stack slot but instead let the target do so in emitPrologue(). Each target can make adjustments to the stack frame and re-align the stack as it deem appropriate. Do not align it twice which can end up wasting stack space.

llvm-svn: 33387

llvm-svn: 33385

llvm-svn: 33384

llvm-svn: 33383

GetRegForReload() now keeps track which registers have been considered and rejected during its quest to find a suitable reload register. This avoids an infinite loop in case like this:
  t1 := op t2, t3
  t2 <- assigned r0 for use by the reload but ended up reuse r1
  t3 <- assigned r1 for use by the reload but ended up reuse r0
  t1 <- desires r1
        sees r1 is taken by t2, tries t2's reload register r0
        sees r0 is taken by t3, tries t3's reload register r1
        sees r1 is taken by t2, tries t2's reload register r0 ...

llvm-svn: 33382

llvm-svn: 33375