llvm-project/clang/test/Analysis/constraint_manager_negate_difference.c
Adam Balogh dcde8acc32 [Analyzer] Quick Fix for exponential execution time when simpilifying complex additive expressions
Patch https://reviews.llvm.org/rC329780 not only rearranges comparisons but
also binary expressions. This latter behavior is not protected by the analyzer
option. Hower, since no complexity threshold is enforced to the symbols this
may result in exponential execution time if the expressions are too complex:
https://bugs.llvm.org/show_bug.cgi?id=38208. For a quick fix we extended the
analyzer option to also cover the additive cases.

This is only a temporary fix, the final solution should be enforcing the
complexity threshold to the symbols.

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

llvm-svn: 337678
2018-07-23 10:50:20 +00:00

99 lines
2.5 KiB
C

// RUN: %clang_analyze_cc1 -analyzer-checker=debug.ExprInspection,core.builtin -analyzer-config aggressive-binary-operation-simplification=true -verify %s
void clang_analyzer_eval(int);
void exit(int);
#define UINT_MAX (~0U)
#define INT_MAX (UINT_MAX & (UINT_MAX >> 1))
#define INT_MIN (UINT_MAX & ~(UINT_MAX >> 1))
extern void __assert_fail (__const char *__assertion, __const char *__file,
unsigned int __line, __const char *__function)
__attribute__ ((__noreturn__));
#define assert(expr) \
((expr) ? (void)(0) : __assert_fail (#expr, __FILE__, __LINE__, __func__))
void assert_in_range(int x) {
assert(x <= ((int)INT_MAX / 4));
assert(x >= -(((int)INT_MAX) / 4));
}
void assert_in_wide_range(int x) {
assert(x <= ((int)INT_MAX / 2));
assert(x >= -(((int)INT_MAX) / 2));
}
void assert_in_range_2(int m, int n) {
assert_in_range(m);
assert_in_range(n);
}
void equal(int m, int n) {
assert_in_range_2(m, n);
if (m != n)
return;
assert_in_wide_range(m - n);
clang_analyzer_eval(n == m); // expected-warning{{TRUE}}
}
void non_equal(int m, int n) {
assert_in_range_2(m, n);
if (m == n)
return;
assert_in_wide_range(m - n);
clang_analyzer_eval(n != m); // expected-warning{{TRUE}}
}
void less_or_equal(int m, int n) {
assert_in_range_2(m, n);
if (m < n)
return;
assert_in_wide_range(m - n);
clang_analyzer_eval(n <= m); // expected-warning{{TRUE}}
}
void less(int m, int n) {
assert_in_range_2(m, n);
if (m <= n)
return;
assert_in_wide_range(m - n);
clang_analyzer_eval(n < m); // expected-warning{{TRUE}}
}
void greater_or_equal(int m, int n) {
assert_in_range_2(m, n);
if (m > n)
return;
assert_in_wide_range(m - n);
clang_analyzer_eval(n >= m); // expected-warning{{TRUE}}
}
void greater(int m, int n) {
assert_in_range_2(m, n);
if (m >= n)
return;
assert_in_wide_range(m - n);
clang_analyzer_eval(n > m); // expected-warning{{TRUE}}
}
void negate_positive_range(int m, int n) {
if (m - n <= 0)
return;
clang_analyzer_eval(n - m < 0); // expected-warning{{TRUE}}
clang_analyzer_eval(n - m > INT_MIN); // expected-warning{{TRUE}}
clang_analyzer_eval(n - m == INT_MIN); // expected-warning{{FALSE}}
}
void negate_int_min(int m, int n) {
if (m - n != INT_MIN)
return;
clang_analyzer_eval(n - m == INT_MIN); // expected-warning{{TRUE}}
}
void negate_mixed(int m, int n) {
if (m -n > INT_MIN && m - n <= 0)
return;
clang_analyzer_eval(n - m <= 0); // expected-warning{{TRUE}}
}