3 Commits

Author	SHA1	Message	Date
Duncan Sands	af32728a57	The comparision "max(x,y)==x" is equivalent to "x>=y". Since the max is ... often expressed as "x >= y ? x : y", there is a good chance we can extract the existing "x >= y" from it and use that as a replacement for "max(x,y)==x". llvm-svn: 131049	2011-05-07 16:56:49 +00:00
Duncan Sands	a228785526	Add variations on: max(x,y) >= min(x,z) folds to true. This isn't that common, ... but according to my super-optimizer there are only two missed simplifications of -instsimplify kind when compiling bzip2, and this is one of them. It amuses me to have bzip2 be perfectly optimized as far as instsimplify goes! llvm-svn: 130840	2011-05-04 16:05:05 +00:00
Duncan Sands	0a9c1246d7	Implement some basic simplifications involving min/max, for example ... max(a,b) >= a -> true. According to my super-optimizer, these are by far the most common simplifications (of the -instsimplify kind) that occur in the testsuite and aren't caught by -std-compile-opts. llvm-svn: 130780	2011-05-03 19:53:10 +00:00