Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[analyzer][Solver] Early return if sym is concrete on assuming #115579

Merged
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -1354,6 +1354,8 @@ void StdLibraryFunctionsChecker::checkPreCall(const CallEvent &Call,
if (BR.isInteresting(ArgSVal))
OS << Msg;
}));
if (NewNode->isSink())
break;
}
}
}
Expand Down
2 changes: 1 addition & 1 deletion clang/lib/StaticAnalyzer/Core/ConstraintManager.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -74,7 +74,7 @@ ConstraintManager::assumeDualImpl(ProgramStateRef &State,
// it might happen that a Checker uncoditionally uses one of them if the
// other is a nullptr. This may also happen with the non-dual and
// adjacent `assume(true)` and `assume(false)` calls. By implementing
// assume in therms of assumeDual, we can keep our API contract there as
// assume in terms of assumeDual, we can keep our API contract there as
// well.
return ProgramStatePair(StInfeasible, StInfeasible);
}
Expand Down
9 changes: 8 additions & 1 deletion clang/lib/StaticAnalyzer/Core/RangedConstraintManager.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -23,7 +23,14 @@ RangedConstraintManager::~RangedConstraintManager() {}
ProgramStateRef RangedConstraintManager::assumeSym(ProgramStateRef State,
SymbolRef Sym,
bool Assumption) {
Sym = simplify(State, Sym);
SVal SimplifiedVal = simplifyToSVal(State, Sym);
steakhal marked this conversation as resolved.
Show resolved Hide resolved
if (SimplifiedVal.isConstant()) {
bool Feasible = SimplifiedVal.isZeroConstant() != Assumption;
return Feasible ? State : nullptr;
}

if (SymbolRef SimplifiedSym = SimplifiedVal.getAsSymbol())
Sym = SimplifiedSym;

// Handle SymbolData.
if (isa<SymbolData>(Sym))
Expand Down
37 changes: 37 additions & 0 deletions clang/test/Analysis/solver-sym-simplification-on-assumption.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
// RUN: %clang_analyze_cc1 -triple=x86_64-unknown-linux-gnu %s \
// RUN: -analyzer-checker=debug.ExprInspection \
// RUN: -verify

void clang_analyzer_eval(int);
void clang_analyzer_value(int);

void test_derived_sym_simplification_on_assume(int s0, int s1) {
int elem = s0 + s1 + 1;
if (elem-- == 0)
return;

if (elem-- == 0)
return;

if (s0 < 1)
return;
clang_analyzer_value(s0); // expected-warning{{[1, 2147483647]}}

if (s1 < 1)
return;
clang_analyzer_value(s1); // expected-warning{{[1, 2147483647]}}

clang_analyzer_eval(elem); // expected-warning{{UNKNOWN}}
if (elem-- == 0)
return;

if (s0 > 1)
return;
clang_analyzer_eval(s0 == 1); // expected-warning{{TRUE}}

if (s1 > 1)
return;
clang_analyzer_eval(s1 == 1); // expected-warning{{TRUE}}

clang_analyzer_eval(elem); // expected-warning{{FALSE}}
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,43 @@
// RUN: %clang_analyze_cc1 %s \
// RUN: -analyzer-max-loop 6 \
// RUN: -analyzer-checker=unix.StdCLibraryFunctions \
// RUN: -analyzer-config unix.StdCLibraryFunctions:ModelPOSIX=true \
// RUN: -analyzer-checker=debug.ExprInspection \
// RUN: -triple x86_64-unknown-linux-gnu \
// RUN: -verify

#include "Inputs/std-c-library-functions-POSIX.h"

void clang_analyzer_value(int);
void clang_analyzer_warnIfReached();
void clang_analyzer_printState();

void _add_one_to_index_C(int *indices, int *shape) {
int k = 1;
for (; k >= 0; k--)
if (indices[k] < shape[k])
indices[k]++;
else
indices[k] = 0;
}

void PyObject_CopyData_sptr(char *i, char *j, int *indices, int itemsize,
int *shape, struct sockaddr *restrict sa) {
int elements = 1;
for (int k = 0; k < 2; k++)
elements += shape[k];

// no contradiction after 3 iterations when 'elements' could be
// simplified to 0
steakhal marked this conversation as resolved.
Show resolved Hide resolved
int iterations = 0;
while (elements--) {
iterations++;
_add_one_to_index_C(indices, shape);
getnameinfo(sa, 10, i, itemsize, i, itemsize, 0); // no crash here
}

if (shape[0] == 1 && shape[1] == 1 && indices[0] == 0 && indices[1] == 0) {
clang_analyzer_value(iterations == 3 && elements == -1);
// expected-warning@-1{{1}}
}
}
Original file line number Diff line number Diff line change
Expand Up @@ -28,13 +28,13 @@ void test(int a, int b, int c, int d) {
return;
clang_analyzer_printState();
// CHECK: "constraints": [
// CHECK-NEXT: { "symbol": "(reg_$0<int a>) != (reg_$3<int d>)", "range": "{ [0, 0] }" },
// CHECK-NEXT: { "symbol": "((reg_$0<int a>) + (reg_$2<int c>)) != (reg_$3<int d>)", "range": "{ [0, 0] }" },
// CHECK-NEXT: { "symbol": "reg_$1<int b>", "range": "{ [0, 0] }" },
// CHECK-NEXT: { "symbol": "reg_$2<int c>", "range": "{ [0, 0] }" }
// CHECK-NEXT: ],
// CHECK-NEXT: "equivalence_classes": [
// CHECK-NEXT: [ "(reg_$0<int a>) != (reg_$3<int d>)" ],
// CHECK-NEXT: [ "reg_$0<int a>", "reg_$3<int d>" ],
// CHECK-NEXT: [ "((reg_$0<int a>) + (reg_$2<int c>)) != (reg_$3<int d>)" ],
// CHECK-NEXT: [ "(reg_$0<int a>) + (reg_$2<int c>)", "reg_$3<int d>" ],
// CHECK-NEXT: [ "reg_$2<int c>" ]
// CHECK-NEXT: ],
// CHECK-NEXT: "disequality_info": null,
Expand Down
Loading