where the destination is dead.

llvm-svn: 35252

llvm-svn: 35251

Add the NoUnwindAttribute to allow explicit marking of functions that do
not unwind the stack via the unwind instruction. This is akin to gcc's
NoThrow attribute and used for optimizing exception handling.

llvm-svn: 35250

llvm-svn: 35249

llvm-svn: 35248

* Fix some indentation and comments in InsertRangeTest
* Add an "IsSigned" parameter to AddWithOverflow and make it handle signed
  additions. Also, APIntify this function so it works with any bitwidth.
* For the icmp pred ([us]div %X, C1), C2 transforms, exit early if the
  div instruction's RHS is zero.
* Finally, for icmp pred (sdiv %X, C1), -C2, fix an off-by-one error. The
  HiBound needs to be incremented in order to get the range test correct.

llvm-svn: 35247

llvm-svn: 35246

llvm-svn: 35245

llvm-svn: 35244

llvm-svn: 35243

llvm-svn: 35242

llvm-svn: 35241

llvm-svn: 35240

llvm-svn: 35239

llvm-svn: 35237

Okay, really fix it this time. Make sure the CurFun.Linkage is set early
and consolidate some duplicate code.

llvm-svn: 35236

llvm-svn: 35235

Make Signedness information pervasive throughout all types and values.
There is no easy way to get around this. Because the GEP instruction can
index through an arbitrarily complex value structure, it is necessary to
keep track of signedness information throughout that structure. This change
makes Signedness a full class, capable of representing Signedness in
arbitrarily shaped types. The class is then used throughout llvm-upgrade to
track signedness and differentiate between globals, locals, and functions
based on their signedness.

For PR1243:
This patch also removes bogus warnings about renaming internal globals. It
now only emits such warnings when renaming non-internal globals because
they may affect linkage.

llvm-svn: 35234

is the frame pointer.

llvm-svn: 35233

some test cases for bitwidth > 64.

llvm-svn: 35232

llvm-svn: 35230

llvm-svn: 35229

llvm-svn: 35228

instructions (that would have to be split later)

llvm-svn: 35227

llvm-svn: 35226

Avoid recursion, Use iterative algorithm.

llvm-svn: 35225

llvm-svn: 35224

Get pos/neg infinity the correct way.

llvm-svn: 35223

LoopSimplify::FindPHIToPartitionLoops()
Use ETForest instead of DominatorSet.

llvm-svn: 35222

Use ETForest instead of DominatorSet.

llvm-svn: 35221

llvm-svn: 35220

llvm-svn: 35219

    mov lr, pc
    bx lr
So, the function was not called.

llvm-svn: 35218

llvm-svn: 35217

llvm-svn: 35216

llvm-svn: 35215

llvm-svn: 35214

llvm-svn: 35213

llvm-svn: 35212

llvm-svn: 35211