2023-01-26 22:23:22 +01:00
|
|
|
/*
|
|
|
|
* Cppcheck - A tool for static C/C++ code analysis
|
2023-01-28 10:16:34 +01:00
|
|
|
* Copyright (C) 2007-2023 Cppcheck team.
|
2023-01-26 22:23:22 +01:00
|
|
|
*
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
#ifndef vfvalueH
|
|
|
|
#define vfvalueH
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
#include "mathlib.h"
|
|
|
|
|
|
|
|
#include <cassert>
|
|
|
|
#include <cmath>
|
|
|
|
#include <functional>
|
|
|
|
#include <list>
|
|
|
|
#include <string>
|
|
|
|
#include <type_traits>
|
|
|
|
#include <utility>
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
class Token;
|
|
|
|
|
|
|
|
namespace ValueFlow
|
|
|
|
{
|
|
|
|
class CPPCHECKLIB Value {
|
|
|
|
public:
|
|
|
|
using ErrorPathItem = std::pair<const Token *, std::string>;
|
|
|
|
using ErrorPath = std::list<ErrorPathItem>;
|
|
|
|
enum class Bound { Upper, Lower, Point };
|
|
|
|
|
2023-08-08 11:05:02 +02:00
|
|
|
explicit Value(long long val = 0, Bound b = Bound::Point) :
|
2023-01-26 22:23:22 +01:00
|
|
|
bound(b),
|
|
|
|
intvalue(val),
|
|
|
|
varvalue(val),
|
2023-08-08 11:05:02 +02:00
|
|
|
wideintvalue(val)
|
2023-01-26 22:23:22 +01:00
|
|
|
{}
|
|
|
|
Value(const Token* c, long long val, Bound b = Bound::Point);
|
|
|
|
|
|
|
|
static Value unknown();
|
|
|
|
|
|
|
|
bool equalValue(const ValueFlow::Value& rhs) const {
|
|
|
|
if (valueType != rhs.valueType)
|
|
|
|
return false;
|
|
|
|
switch (valueType) {
|
|
|
|
case ValueType::INT:
|
|
|
|
case ValueType::CONTAINER_SIZE:
|
|
|
|
case ValueType::BUFFER_SIZE:
|
|
|
|
case ValueType::ITERATOR_START:
|
|
|
|
case ValueType::ITERATOR_END:
|
|
|
|
if (intvalue != rhs.intvalue)
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case ValueType::TOK:
|
|
|
|
if (tokvalue != rhs.tokvalue)
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case ValueType::FLOAT:
|
|
|
|
if (floatValue > rhs.floatValue || floatValue < rhs.floatValue || std::signbit(floatValue) != std::signbit(rhs.floatValue))
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case ValueType::MOVED:
|
|
|
|
if (moveKind != rhs.moveKind)
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case ValueType::UNINIT:
|
|
|
|
break;
|
|
|
|
case ValueType::LIFETIME:
|
|
|
|
if (tokvalue != rhs.tokvalue)
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
case ValueType::SYMBOLIC:
|
|
|
|
if (!sameToken(tokvalue, rhs.tokvalue))
|
|
|
|
return false;
|
|
|
|
if (intvalue != rhs.intvalue)
|
|
|
|
return false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template<class T, class F>
|
|
|
|
static void visitValue(T& self, F f) {
|
|
|
|
switch (self.valueType) {
|
|
|
|
case ValueType::INT:
|
|
|
|
case ValueType::SYMBOLIC:
|
|
|
|
case ValueType::BUFFER_SIZE:
|
|
|
|
case ValueType::CONTAINER_SIZE:
|
|
|
|
case ValueType::ITERATOR_START:
|
|
|
|
case ValueType::ITERATOR_END: {
|
|
|
|
f(self.intvalue);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case ValueType::FLOAT: {
|
|
|
|
f(self.floatValue);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case ValueType::UNINIT:
|
|
|
|
case ValueType::TOK:
|
|
|
|
case ValueType::LIFETIME:
|
|
|
|
case ValueType::MOVED:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
struct compareVisitor {
|
|
|
|
struct innerVisitor {
|
|
|
|
template<class Compare, class T, class U>
|
|
|
|
void operator()(bool& result, Compare compare, T x, U y) const {
|
|
|
|
result = compare(x, y);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
template<class Compare, class T>
|
|
|
|
void operator()(bool& result, const Value& rhs, Compare compare, T x) const {
|
|
|
|
visitValue(rhs,
|
|
|
|
std::bind(innerVisitor{}, std::ref(result), std::move(compare), x, std::placeholders::_1));
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template<class Compare>
|
|
|
|
bool compareValue(const Value& rhs, Compare compare) const {
|
|
|
|
assert((!this->isSymbolicValue() && !rhs.isSymbolicValue()) ||
|
|
|
|
(this->valueType == rhs.valueType && sameToken(this->tokvalue, rhs.tokvalue)));
|
|
|
|
bool result = false;
|
|
|
|
visitValue(
|
|
|
|
*this,
|
|
|
|
std::bind(compareVisitor{}, std::ref(result), std::ref(rhs), std::move(compare), std::placeholders::_1));
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator==(const Value &rhs) const {
|
|
|
|
if (!equalValue(rhs))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return varvalue == rhs.varvalue &&
|
|
|
|
condition == rhs.condition &&
|
|
|
|
varId == rhs.varId &&
|
|
|
|
conditional == rhs.conditional &&
|
|
|
|
defaultArg == rhs.defaultArg &&
|
|
|
|
indirect == rhs.indirect &&
|
|
|
|
valueKind == rhs.valueKind;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator!=(const Value &rhs) const {
|
|
|
|
return !(*this == rhs);
|
|
|
|
}
|
|
|
|
|
|
|
|
template<class T, REQUIRES("T must be an arithmetic type", std::is_arithmetic<T> )>
|
|
|
|
bool equalTo(const T& x) const {
|
|
|
|
bool result = false;
|
|
|
|
visitValue(*this, std::bind(equalVisitor{}, std::ref(result), x, std::placeholders::_1));
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
void decreaseRange() {
|
|
|
|
if (bound == Bound::Lower)
|
|
|
|
visitValue(*this, increment{});
|
|
|
|
else if (bound == Bound::Upper)
|
|
|
|
visitValue(*this, decrement{});
|
|
|
|
}
|
|
|
|
|
|
|
|
void invertBound() {
|
|
|
|
if (bound == Bound::Lower)
|
|
|
|
bound = Bound::Upper;
|
|
|
|
else if (bound == Bound::Upper)
|
|
|
|
bound = Bound::Lower;
|
|
|
|
}
|
|
|
|
|
|
|
|
void invertRange() {
|
|
|
|
invertBound();
|
|
|
|
decreaseRange();
|
|
|
|
}
|
|
|
|
|
|
|
|
void assumeCondition(const Token* tok);
|
|
|
|
|
|
|
|
std::string infoString() const;
|
|
|
|
|
|
|
|
std::string toString() const;
|
|
|
|
|
|
|
|
enum class ValueType {
|
|
|
|
INT,
|
|
|
|
TOK,
|
|
|
|
FLOAT,
|
|
|
|
MOVED,
|
|
|
|
UNINIT,
|
|
|
|
CONTAINER_SIZE,
|
|
|
|
LIFETIME,
|
|
|
|
BUFFER_SIZE,
|
|
|
|
ITERATOR_START,
|
|
|
|
ITERATOR_END,
|
|
|
|
SYMBOLIC
|
2023-08-08 11:05:02 +02:00
|
|
|
} valueType = ValueType::INT;
|
2023-01-26 22:23:22 +01:00
|
|
|
bool isIntValue() const {
|
|
|
|
return valueType == ValueType::INT;
|
|
|
|
}
|
|
|
|
bool isTokValue() const {
|
|
|
|
return valueType == ValueType::TOK;
|
|
|
|
}
|
|
|
|
bool isFloatValue() const {
|
|
|
|
return valueType == ValueType::FLOAT;
|
|
|
|
}
|
|
|
|
bool isMovedValue() const {
|
|
|
|
return valueType == ValueType::MOVED;
|
|
|
|
}
|
|
|
|
bool isUninitValue() const {
|
|
|
|
return valueType == ValueType::UNINIT;
|
|
|
|
}
|
|
|
|
bool isContainerSizeValue() const {
|
|
|
|
return valueType == ValueType::CONTAINER_SIZE;
|
|
|
|
}
|
|
|
|
bool isLifetimeValue() const {
|
|
|
|
return valueType == ValueType::LIFETIME;
|
|
|
|
}
|
|
|
|
bool isBufferSizeValue() const {
|
|
|
|
return valueType == ValueType::BUFFER_SIZE;
|
|
|
|
}
|
|
|
|
bool isIteratorValue() const {
|
|
|
|
return valueType == ValueType::ITERATOR_START || valueType == ValueType::ITERATOR_END;
|
|
|
|
}
|
|
|
|
bool isIteratorStartValue() const {
|
|
|
|
return valueType == ValueType::ITERATOR_START;
|
|
|
|
}
|
|
|
|
bool isIteratorEndValue() const {
|
|
|
|
return valueType == ValueType::ITERATOR_END;
|
|
|
|
}
|
|
|
|
bool isSymbolicValue() const {
|
|
|
|
return valueType == ValueType::SYMBOLIC;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isLocalLifetimeValue() const {
|
|
|
|
return valueType == ValueType::LIFETIME && lifetimeScope == LifetimeScope::Local;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isArgumentLifetimeValue() const {
|
|
|
|
return valueType == ValueType::LIFETIME && lifetimeScope == LifetimeScope::Argument;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isSubFunctionLifetimeValue() const {
|
|
|
|
return valueType == ValueType::LIFETIME && lifetimeScope == LifetimeScope::SubFunction;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isNonValue() const {
|
|
|
|
return isMovedValue() || isUninitValue() || isLifetimeValue();
|
|
|
|
}
|
|
|
|
|
|
|
|
/** The value bound */
|
2023-08-08 11:05:02 +02:00
|
|
|
Bound bound = Bound::Point;
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** int value (or sometimes bool value?) */
|
2023-08-08 11:05:02 +02:00
|
|
|
long long intvalue{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** token value - the token that has the value. this is used for pointer aliases, strings, etc. */
|
2023-08-08 11:05:02 +02:00
|
|
|
const Token* tokvalue{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** float value */
|
2023-08-08 11:05:02 +02:00
|
|
|
double floatValue{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** For calculated values - variable value that calculated value depends on */
|
2023-08-08 11:05:02 +02:00
|
|
|
long long varvalue{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** Condition that this value depends on */
|
2023-08-08 11:05:02 +02:00
|
|
|
const Token* condition{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
ErrorPath errorPath;
|
|
|
|
|
|
|
|
ErrorPath debugPath;
|
|
|
|
|
|
|
|
/** For calculated values - varId that calculated value depends on */
|
2023-08-08 11:05:02 +02:00
|
|
|
nonneg int varId{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** value relies on safe checking */
|
2023-08-08 11:05:02 +02:00
|
|
|
bool safe{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** Conditional value */
|
2023-08-08 11:05:02 +02:00
|
|
|
bool conditional{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** Value is is from an expanded macro */
|
2023-08-08 11:05:02 +02:00
|
|
|
bool macro{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** Is this value passed as default parameter to the function? */
|
2023-08-08 11:05:02 +02:00
|
|
|
bool defaultArg{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
2023-08-08 11:05:02 +02:00
|
|
|
int indirect{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** kind of moved */
|
2023-08-08 11:05:02 +02:00
|
|
|
enum class MoveKind { NonMovedVariable, MovedVariable, ForwardedVariable } moveKind = MoveKind::NonMovedVariable;
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** Path id */
|
2023-08-08 11:05:02 +02:00
|
|
|
MathLib::bigint path{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
/** int value before implicit truncation */
|
2023-08-08 11:05:02 +02:00
|
|
|
long long wideintvalue{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
std::vector<std::string> subexpressions;
|
|
|
|
|
|
|
|
// Set to where a lifetime is captured by value
|
2023-08-08 11:05:02 +02:00
|
|
|
const Token* capturetok{};
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
enum class LifetimeKind {
|
|
|
|
// Pointer points to a member of lifetime
|
|
|
|
Object,
|
|
|
|
// A member of object points to the lifetime
|
|
|
|
SubObject,
|
|
|
|
// Lambda has captured lifetime(similar to SubObject)
|
|
|
|
Lambda,
|
|
|
|
// Iterator points to the lifetime of a container(similar to Object)
|
|
|
|
Iterator,
|
|
|
|
// A pointer that holds the address of the lifetime
|
|
|
|
Address
|
2023-08-08 11:05:02 +02:00
|
|
|
} lifetimeKind = LifetimeKind::Object;
|
2023-01-26 22:23:22 +01:00
|
|
|
|
2023-08-08 11:05:02 +02:00
|
|
|
enum class LifetimeScope { Local, Argument, SubFunction, ThisPointer, ThisValue } lifetimeScope = LifetimeScope::Local;
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
static const char* toString(MoveKind moveKind);
|
|
|
|
static const char* toString(LifetimeKind lifetimeKind);
|
|
|
|
static const char* toString(LifetimeScope lifetimeScope);
|
|
|
|
static const char* toString(Bound bound);
|
|
|
|
|
|
|
|
/** How known is this value */
|
|
|
|
enum class ValueKind {
|
|
|
|
/** This value is possible, other unlisted values may also be possible */
|
|
|
|
Possible,
|
|
|
|
/** Only listed values are possible */
|
|
|
|
Known,
|
|
|
|
/** Inconclusive */
|
|
|
|
Inconclusive,
|
|
|
|
/** Listed values are impossible */
|
|
|
|
Impossible
|
2023-08-08 11:05:02 +02:00
|
|
|
} valueKind = ValueKind::Possible;
|
2023-01-26 22:23:22 +01:00
|
|
|
|
|
|
|
void setKnown() {
|
|
|
|
valueKind = ValueKind::Known;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isKnown() const {
|
|
|
|
return valueKind == ValueKind::Known;
|
|
|
|
}
|
|
|
|
|
|
|
|
void setPossible() {
|
|
|
|
valueKind = ValueKind::Possible;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isPossible() const {
|
|
|
|
return valueKind == ValueKind::Possible;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isImpossible() const {
|
|
|
|
return valueKind == ValueKind::Impossible;
|
|
|
|
}
|
|
|
|
|
|
|
|
void setImpossible() {
|
|
|
|
valueKind = ValueKind::Impossible;
|
|
|
|
}
|
|
|
|
|
|
|
|
void setInconclusive(bool inconclusive = true) {
|
|
|
|
if (inconclusive)
|
|
|
|
valueKind = ValueKind::Inconclusive;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isInconclusive() const {
|
|
|
|
return valueKind == ValueKind::Inconclusive;
|
|
|
|
}
|
|
|
|
|
|
|
|
void changeKnownToPossible() {
|
|
|
|
if (isKnown())
|
|
|
|
valueKind = ValueKind::Possible;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool errorSeverity() const {
|
|
|
|
return !condition && !defaultArg;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool sameToken(const Token* tok1, const Token* tok2);
|
|
|
|
|
|
|
|
private:
|
|
|
|
struct equalVisitor {
|
|
|
|
template<class T, class U>
|
|
|
|
void operator()(bool& result, T x, U y) const {
|
|
|
|
result = !(x > y || x < y);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct increment {
|
|
|
|
template<class T>
|
|
|
|
void operator()(T& x) const {
|
|
|
|
x++;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
struct decrement {
|
|
|
|
template<class T>
|
|
|
|
void operator()(T& x) const {
|
|
|
|
x--;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif // vfvalueH
|