llvm-6502

mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-13 09:33:50 +00:00

History

Wojciech Matyjewicz 7b5b76835a Fix PR2002. Suppose n is the initial value for the induction

variable (with step 1) and m is its final value. Then, the correct trip 
count is SMAX(m,n)-n. Previously, we used SMAX(0,m-n), but m-n may 
overflow and can't in general be interpreted as signed.

Patch by Nick Lewycky.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@47007 91177308-0d34-0410-b5e6-96231b3b80d8

2008-02-12 15:09:36 +00:00

Analysis

Fix PR2002. Suppose n is the initial value for the induction

2008-02-12 15:09:36 +00:00

Archive

Use empty() instead of comparing size() with zero.

2008-01-29 13:02:09 +00:00

AsmParser

Back out mods to llvmAsmParser, incorrectly committed

2008-01-30 03:10:00 +00:00

Bitcode

Use empty() instead of comparing size() with zero.