Benjamin Kramer 3578c169bf Teach SCEV's icmp simplification logic that a-b == 0 is equivalent to a == b. ... This also required making recursive simplifications until nothing changes or a hard limit (currently 3) is hit. With the simplification in place indvars can canonicalize loops of the form for (unsigned i = 0; i < a-b; ++i) into for (unsigned i = 0; i != a-b; ++i) which used to fail because SCEV created a weird umax expr for the backedge taken count. llvm-svn: 157701		2012-05-30 18:32:23 +00:00
..
llvm	Teach SCEV's icmp simplification logic that a-b == 0 is equivalent to a == b.	2012-05-30 18:32:23 +00:00
llvm-c	Introduce llvm-c function LLVMPrintModuleToFile.	2012-05-09 16:54:17 +00:00