llvm-project

Commit Graph

Author	SHA1	Message	Date
Valeriy Savchenko	73c120a989	[analyzer] Introduce reasoning about symbolic remainder operator Summary: New logic tries to narrow possible result values of the remainder operation based on its operands and their ranges. It also tries to be conservative with negative operands because according to the standard the sign of the result is implementation-defined. rdar://problem/44978988 Differential Revision: https://reviews.llvm.org/D80117	2020-05-28 18:56:38 +03:00
Artem Dergachev	16a1f64ccf	[analyzer] Improve performance of the SVal simplification mechanism. When neither LHS nor RHS of a binary operator expression can be simplified, return the original expression instead of re-evaluating the binary operator. Such re-evaluation was causing recusrive re-simplification which caused the algorithmic complexity to explode. Differential Revision: https://reviews.llvm.org/D47155 llvm-svn: 333670	2018-05-31 17:22:38 +00:00

Author

SHA1

Message

Date

Valeriy Savchenko

73c120a989

[analyzer] Introduce reasoning about symbolic remainder operator

Summary:
New logic tries to narrow possible result values of the remainder operation
based on its operands and their ranges.  It also tries to be conservative
with negative operands because according to the standard the sign of
the result is implementation-defined.

rdar://problem/44978988

Differential Revision: https://reviews.llvm.org/D80117

2020-05-28 18:56:38 +03:00

Artem Dergachev

16a1f64ccf

[analyzer] Improve performance of the SVal simplification mechanism.

When neither LHS nor RHS of a binary operator expression can be simplified,
return the original expression instead of re-evaluating the binary operator.

Such re-evaluation was causing recusrive re-simplification which caused
the algorithmic complexity to explode.

Differential Revision: https://reviews.llvm.org/D47155

llvm-svn: 333670

2018-05-31 17:22:38 +00:00

2 Commits