Chris Lattner bf5d8a8270 Three changes:
1. Teach GetConstantInType to handle boolean constants.
2. Teach instcombine to fold (compare X, CST) when X has known 0/1 bits.
   Testcase here: set.ll:test22
3. Improve the "(X >> c1) & C2 == 0" folding code to allow a noop cast
   between the shift and and.  More aggressive bitfolding for other reasons
   was turning signed shr's into unsigned shr's, leaving the noop cast in
   the way.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26131 91177308-0d34-0410-b5e6-96231b3b80d8
2006-02-12 02:07:56 +00:00
2006-02-05 05:56:51 +00:00
2006-02-12 02:07:56 +00:00
2006-02-12 02:06:31 +00:00
2006-02-05 08:30:45 +00:00
2006-02-04 03:27:04 +00:00
2006-02-05 06:26:43 +00:00
2006-01-08 08:25:38 +00:00
2006-01-03 14:42:06 +00:00
2005-05-18 20:23:20 +00:00
2005-05-18 20:23:20 +00:00
2005-08-25 04:59:49 +00:00
2005-12-21 03:31:53 +00:00
2006-01-27 22:13:12 +00:00

Low Level Virtual Machine (LLVM)
================================

This directory and its subdirectories contain source code for the Low Level 
Virtual Machine, a toolkit for the construction of highly optimized compilers,
optimizers, and runtime environments. 

LLVM is open source software. You may freely distribute it under the terms of
the license agreement found in LICENSE.txt.

Please see the HTML documentation provided in docs/index.html for further
assistance with LLVM.
Description
LLVM backend for 6502
Readme 277 MiB
Languages
C++ 48.7%
LLVM 38.5%
Assembly 10.2%
C 0.9%
Python 0.4%
Other 1.2%