Benjamin Kramer b70ebd2aa3 InstCombine: Reduce "X shift (A srem B)" to "X shift (A urem B)" iff B is positive. ... This allows to transform the rem in "1 << ((int)x % 8);" to an and. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@120028 91177308-0d34-0410-b5e6-96231b3b80d8		2010-11-23 18:52:42 +00:00
..
CMakeLists.txt
InstCombine.h	Exploit distributive laws (eg: And distributes over Or, Mul over Add, etc) in a	2010-11-23 14:23:47 +00:00
InstCombineAddSub.cpp	Exploit distributive laws (eg: And distributes over Or, Mul over Add, etc) in a	2010-11-23 14:23:47 +00:00
InstCombineAndOrXor.cpp	Exploit distributive laws (eg: And distributes over Or, Mul over Add, etc) in a	2010-11-23 14:23:47 +00:00
InstCombineCalls.cpp
InstCombineCasts.cpp
InstCombineCompares.cpp	duncan's spider sense was right, I completely reversed the condition	2010-11-23 02:42:04 +00:00
InstCombineLoadStoreAlloca.cpp
InstCombineMulDivRem.cpp	InstCombine: Add a missing irem identity (X % X -> 0).	2010-11-17 19:11:46 +00:00
InstCombinePHI.cpp	Teach InstructionSimplify about phi nodes. I chose to have it simply	2010-11-14 13:30:18 +00:00
InstCombineSelect.cpp
InstCombineShifts.cpp	InstCombine: Reduce "X shift (A srem B)" to "X shift (A urem B)" iff B is positive.	2010-11-23 18:52:42 +00:00
InstCombineSimplifyDemanded.cpp
InstCombineVectorOps.cpp
InstCombineWorklist.h
InstructionCombining.cpp	Propagate LeftDistributes and RightDistributes into their only uses.	2010-11-23 15:28:14 +00:00
Makefile