Dan Gohman a590b79ee2 Teach IndVarSimplify how to eliminate remainder operators where the ... numerator is an induction variable. For example, with code like this: for (i=0;i<n;++i) x[i%n] = 0; IndVarSimplify will now recognize that i is always less than n inside the loop, and eliminate the remainder. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@101113 91177308-0d34-0410-b5e6-96231b3b80d8		2010-04-13 01:46:36 +00:00
..
Analysis	Generalize ScalarEvolution's PHI analysis to handle loops that don't	2010-04-12 07:49:36 +00:00
Archive
Assembler	add newlines at the end of files.	2010-04-07 22:53:17 +00:00
Bindings/Ocaml
Bitcode	add newlines at the end of files.	2010-04-07 22:53:17 +00:00
BugPoint
CodeGen	add llvm codegen support for -ffunction-sections and -fdata-sections,	2010-04-13 00:36:43 +00:00
DebugInfo	add newlines at the end of files.	2010-04-07 22:53:17 +00:00
ExecutionEngine
Feature
FrontendAda
FrontendC	Print empty structs as {} rather than { }.	2010-04-08 18:03:05 +00:00
FrontendC++
FrontendFortran
FrontendObjC
FrontendObjC++
Integer
lib
Linker
LLVMC
MC	Fixed a crasher in arm disassembler within ARMInstPrinter.cpp after calling	2010-04-12 18:46:53 +00:00
Other	Add several more lint checks.	2010-04-09 01:39:53 +00:00
Scripts
TableGen
Transforms	Teach IndVarSimplify how to eliminate remainder operators where the	2010-04-13 01:46:36 +00:00
Unit
Verifier
CMakeLists.txt
lit.cfg
lit.site.cfg.in
Makefile
Makefile.tests
site.exp.in
TestRunner.sh