cppcheck/lib/valueflow.h

390 lines
12 KiB
C
Raw Normal View History

/*
* Cppcheck - A tool for static C/C++ code analysis
2020-05-10 11:16:32 +02:00
* Copyright (C) 2007-2020 Cppcheck team.
*
* 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 valueflowH
#define valueflowH
//---------------------------------------------------------------------------
2017-05-27 04:33:47 +02:00
#include "config.h"
#include "mathlib.h"
#include "utils.h"
2017-05-27 04:33:47 +02:00
#include <list>
#include <string>
2017-05-27 04:33:47 +02:00
#include <utility>
#include <vector>
class ErrorLogger;
class Settings;
2017-05-27 04:33:47 +02:00
class SymbolDatabase;
class Token;
class TokenList;
class ValueType;
class Variable;
namespace ValueFlow {
2019-09-20 15:07:27 +02:00
struct increment {
template <class T>
void operator()(T& x) const {
x++;
}
};
struct decrement {
template <class T>
void operator()(T& x) const {
x--;
}
};
class CPPCHECKLIB Value {
public:
typedef std::pair<const Token *, std::string> ErrorPathItem;
typedef std::list<ErrorPathItem> ErrorPath;
explicit Value(long long val = 0)
2019-07-10 14:04:56 +02:00
: valueType(ValueType::INT),
bound(Bound::Point),
intvalue(val),
tokvalue(nullptr),
floatValue(0.0),
2019-07-10 15:27:07 +02:00
moveKind(MoveKind::NonMovedVariable),
varvalue(val),
condition(nullptr),
varId(0U),
2019-07-25 17:19:51 +02:00
safe(false),
conditional(false),
defaultArg(false),
indirect(0),
path(0),
2019-07-16 10:51:07 +02:00
lifetimeKind(LifetimeKind::Object),
2019-07-16 11:12:35 +02:00
lifetimeScope(LifetimeScope::Local),
valueKind(ValueKind::Possible)
{}
Value(const Token *c, long long val);
bool equalValue(const ValueFlow::Value& rhs) const {
2016-11-13 22:33:39 +01:00
if (valueType != rhs.valueType)
return false;
switch (valueType) {
2019-07-10 14:04:56 +02:00
case ValueType::INT:
case ValueType::CONTAINER_SIZE:
case ValueType::BUFFER_SIZE:
case ValueType::ITERATOR_START:
case ValueType::ITERATOR_END:
2016-11-13 22:33:39 +01:00
if (intvalue != rhs.intvalue)
return false;
break;
2019-07-10 14:04:56 +02:00
case ValueType::TOK:
2016-11-13 22:33:39 +01:00
if (tokvalue != rhs.tokvalue)
return false;
break;
2019-07-10 14:04:56 +02:00
case ValueType::FLOAT:
2016-11-13 22:59:56 +01:00
// TODO: Write some better comparison
if (floatValue > rhs.floatValue || floatValue < rhs.floatValue)
return false;
break;
2019-07-10 14:04:56 +02:00
case ValueType::MOVED:
if (moveKind != rhs.moveKind)
return false;
break;
2019-07-10 14:04:56 +02:00
case ValueType::UNINIT:
break;
2019-07-10 14:04:56 +02:00
case ValueType::LIFETIME:
if (tokvalue != rhs.tokvalue)
return false;
}
return true;
}
template <class F>
2019-09-20 15:07:27 +02:00
void visitValue(F f) {
switch (valueType) {
case ValueType::INT:
case ValueType::BUFFER_SIZE:
case ValueType::CONTAINER_SIZE:
case ValueType::ITERATOR_START:
case ValueType::ITERATOR_END: {
f(intvalue);
break;
}
case ValueType::FLOAT: {
f(floatValue);
break;
}
case ValueType::UNINIT:
case ValueType::TOK:
case ValueType::LIFETIME:
case ValueType::MOVED:
break;
}
}
bool operator==(const Value &rhs) const {
if (!equalValue(rhs))
return false;
2016-11-13 22:33:39 +01:00
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);
}
2019-09-20 15:07:27 +02:00
void decreaseRange() {
if (bound == Bound::Lower)
visitValue(increment{});
else if (bound == Bound::Upper)
visitValue(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;
enum ValueType { INT, TOK, FLOAT, MOVED, UNINIT, CONTAINER_SIZE, LIFETIME, BUFFER_SIZE, ITERATOR_START, ITERATOR_END } valueType;
2016-11-13 22:33:39 +01:00
bool isIntValue() const {
2019-07-10 14:04:56 +02:00
return valueType == ValueType::INT;
2016-11-13 22:33:39 +01:00
}
bool isTokValue() const {
2019-07-10 14:04:56 +02:00
return valueType == ValueType::TOK;
2016-11-13 22:33:39 +01:00
}
2016-11-13 22:59:56 +01:00
bool isFloatValue() const {
2019-07-10 14:04:56 +02:00
return valueType == ValueType::FLOAT;
2016-11-13 22:59:56 +01:00
}
bool isMovedValue() const {
2019-07-10 14:04:56 +02:00
return valueType == ValueType::MOVED;
}
bool isUninitValue() const {
2019-07-10 14:04:56 +02:00
return valueType == ValueType::UNINIT;
}
bool isContainerSizeValue() const {
2019-07-10 14:04:56 +02:00
return valueType == ValueType::CONTAINER_SIZE;
}
bool isLifetimeValue() const {
2019-07-10 14:04:56 +02:00
return valueType == ValueType::LIFETIME;
}
bool isBufferSizeValue() const {
2019-07-10 14:04:56 +02:00
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;
}
2016-11-13 22:33:39 +01:00
2019-01-29 09:48:18 +01:00
bool isLocalLifetimeValue() const {
2019-07-16 11:12:35 +02:00
return valueType == ValueType::LIFETIME && lifetimeScope == LifetimeScope::Local;
2019-01-29 09:48:18 +01:00
}
2019-01-29 09:48:18 +01:00
bool isArgumentLifetimeValue() const {
2019-07-16 11:12:35 +02:00
return valueType == ValueType::LIFETIME && lifetimeScope == LifetimeScope::Argument;
2019-01-29 09:48:18 +01:00
}
2020-09-04 18:59:30 +02:00
bool isSubFunctionLifetimeValue() const
{
2020-09-04 18:56:34 +02:00
return valueType == ValueType::LIFETIME && lifetimeScope == LifetimeScope::SubFunction;
}
bool isNonValue() const {
return isMovedValue() || isUninitValue() || isLifetimeValue();
}
/** The value bound */
enum class Bound { Upper, Lower, Point } bound;
/** int value */
long long intvalue;
/** token value - the token that has the value. this is used for pointer aliases, strings, etc. */
const Token *tokvalue;
2016-11-13 22:59:56 +01:00
/** float value */
double floatValue;
/** kind of moved */
2019-07-10 15:27:07 +02:00
enum class MoveKind {NonMovedVariable, MovedVariable, ForwardedVariable} moveKind;
/** For calculated values - variable value that calculated value depends on */
long long varvalue;
/** Condition that this value depends on */
2014-05-19 14:37:54 +02:00
const Token *condition;
ErrorPath errorPath;
2014-05-19 14:37:54 +02:00
/** For calculated values - varId that calculated value depends on */
nonneg int varId;
2014-05-19 14:37:54 +02:00
2019-07-25 17:19:51 +02:00
/** value relies on safe checking */
bool safe;
/** Conditional value */
bool conditional;
2015-02-01 15:23:15 +01:00
/** Is this value passed as default parameter to the function? */
bool defaultArg;
2018-11-10 21:30:01 +01:00
int indirect;
/** Path id */
MathLib::bigint path;
enum class LifetimeKind {Object, SubObject, Lambda, Iterator, Address} lifetimeKind;
2020-09-04 18:56:34 +02:00
enum class LifetimeScope { Local, Argument, SubFunction } lifetimeScope;
static const char* toString(MoveKind moveKind);
/** 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
} valueKind;
void setKnown() {
valueKind = ValueKind::Known;
}
bool isKnown() const {
return valueKind == ValueKind::Known;
}
void setPossible() {
valueKind = ValueKind::Possible;
}
bool isPossible() const {
return valueKind == ValueKind::Possible;
}
2019-09-20 15:07:27 +02:00
bool isImpossible() const {
return valueKind == ValueKind::Impossible;
}
2019-09-20 15:07:27 +02:00
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;
}
};
2016-05-07 20:18:07 +02:00
/// Constant folding of expression. This can be used before the full ValueFlow has been executed (ValueFlow::setValues).
const ValueFlow::Value * valueFlowConstantFoldAST(Token *expr, const Settings *settings);
2016-05-07 20:18:07 +02:00
/// Perform valueflow analysis.
void setValues(TokenList *tokenlist, SymbolDatabase* symboldatabase, ErrorLogger *errorLogger, const Settings *settings);
std::string eitherTheConditionIsRedundant(const Token *condition);
size_t getSizeOf(const ValueType &vt, const Settings *settings);
}
struct LifetimeToken {
const Token* token;
bool addressOf;
ValueFlow::Value::ErrorPath errorPath;
bool inconclusive;
LifetimeToken() : token(nullptr), addressOf(false), errorPath(), inconclusive(false) {}
LifetimeToken(const Token* token, ValueFlow::Value::ErrorPath errorPath)
: token(token), addressOf(false), errorPath(std::move(errorPath)), inconclusive(false)
{}
LifetimeToken(const Token* token, bool addressOf, ValueFlow::Value::ErrorPath errorPath)
: token(token), addressOf(addressOf), errorPath(std::move(errorPath)), inconclusive(false)
{}
static std::vector<LifetimeToken> setAddressOf(std::vector<LifetimeToken> v, bool b) {
for (LifetimeToken& x : v)
x.addressOf = b;
return v;
}
static std::vector<LifetimeToken> setInconclusive(std::vector<LifetimeToken> v, bool b) {
for (LifetimeToken& x : v)
x.inconclusive = b;
return v;
}
};
const Token *parseCompareInt(const Token *tok, ValueFlow::Value &true_value, ValueFlow::Value &false_value);
std::vector<LifetimeToken> getLifetimeTokens(const Token* tok,
2020-09-07 10:56:02 +02:00
bool escape = false,
ValueFlow::Value::ErrorPath errorPath = ValueFlow::Value::ErrorPath{},
int depth = 20);
const Variable* getLifetimeVariable(const Token* tok, ValueFlow::Value::ErrorPath& errorPath, bool* addressOf = nullptr);
const Variable* getLifetimeVariable(const Token* tok);
bool isLifetimeBorrowed(const Token *tok, const Settings *settings);
std::string lifetimeType(const Token *tok, const ValueFlow::Value *val);
std::string lifetimeMessage(const Token *tok, const ValueFlow::Value *val, ValueFlow::Value::ErrorPath &errorPath);
ValueFlow::Value getLifetimeObjValue(const Token *tok, bool inconclusive = false);
#endif // valueflowH