llvm-project

Commit Graph

Author	SHA1	Message	Date
Benjamin Kramer	f4ebfa3ae1	[InstSimplify] Fold away ord/uno fcmps when nnan is present. This is important to fold away the slow case of complex multiplies emitted by clang. llvm-svn: 241911	2015-07-10 14:02:02 +00:00
Elena Demikhovsky	45f0448081	Fold fcmp in cases where value is provably non-negative. By Arch Robison. This patch folds fcmp in some cases of interest in Julia. The patch adds a function CannotBeOrderedLessThanZero that returns true if a value is provably not less than zero. I.e. the function returns true if the value is provably -0, +0, positive, or a NaN. The patch extends InstructionSimplify.cpp to fold instances of fcmp where: - the predicate is olt or uge - the first operand is provably not less than zero - the second operand is zero The motivation for handling these cases optimizing away domain checks for sqrt in Julia for common idioms such as sqrt(xx+yy).. http://reviews.llvm.org/D6972 llvm-svn: 227298	2015-01-28 08:03:58 +00:00

Author

SHA1

Message

Date

Benjamin Kramer

f4ebfa3ae1

[InstSimplify] Fold away ord/uno fcmps when nnan is present.

This is important to fold away the slow case of complex multiplies
emitted by clang.

llvm-svn: 241911

2015-07-10 14:02:02 +00:00

Elena Demikhovsky

45f0448081

Fold fcmp in cases where value is provably non-negative. By Arch Robison.

This patch folds fcmp in some cases of interest in Julia. The patch adds a function CannotBeOrderedLessThanZero that returns true if a value is provably not less than zero. I.e. the function returns true if the value is provably -0, +0, positive, or a NaN. The patch extends InstructionSimplify.cpp to fold instances of fcmp where:
 - the predicate is olt or uge
 - the first operand is provably not less than zero
 - the second operand is zero
The motivation for handling these cases optimizing away domain checks for sqrt in Julia for common idioms such as sqrt(x*x+y*y)..

http://reviews.llvm.org/D6972

llvm-svn: 227298

2015-01-28 08:03:58 +00:00

2 Commits