walkero
/
cppcheck
1
0
Fork 0
Code Issues Pull Requests Projects Releases 1 Wiki Activity

Remove unused functions

This commit is contained in:
Daniel Marjamäki 2020-02-14 20:37:33 +01:00
parent 0faea7ade3
commit e04b9fe4a4
2 changed files with 0 additions and 76 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
lib/programmemory.cpp
View File

@ -172,16 +172,6 @@ static void fillProgramMemoryFromConditions(ProgramMemory& pm, const Token* tok,
fillProgramMemoryFromConditions(pm, tok->scope(), tok, settings);
}
static void fillProgramMemoryFromConditionalExpression(ProgramMemory& pm, const Token* tok, const Settings* settings)
{
const Token* parent = tok->astParent();
if (Token::Match(parent, "?|&&|%oror%")) {
programMemoryParseCondition(pm, parent->astOperand1(), tok, settings, !Token::simpleMatch(parent, "||"));
} else if (Token::simpleMatch(parent, ":") && Token::simpleMatch(parent->astParent(), "?")) {
programMemoryParseCondition(pm, parent->astParent()->astOperand1(), tok, settings, parent->astOperand1() == tok);
}
}
static void fillProgramMemoryFromAssignments(ProgramMemory& pm, const Token* tok, const ProgramMemory& state, std::unordered_map<nonneg int, ValueFlow::Value> vars)
{
int indentlevel = 0;

66
lib/valueflow.cpp
View File

@ -145,25 +145,6 @@ static void lowerToPossible(std::list<ValueFlow::Value>& values, int indirect =
removeImpossible(values, indirect);
}
static void lowerToInconclusive(std::list<ValueFlow::Value>& values, const Settings* settings, int indirect = -1)
{
if (settings->inconclusive) {
removeImpossible(values, indirect);
for (ValueFlow::Value& v : values) {
if (indirect >= 0 && v.indirect != indirect)
continue;
v.setInconclusive();
}
} else {
// Remove all values if the inconclusive flags is not set
values.remove_if([&](const ValueFlow::Value& v) {
if (indirect >= 0 && v.indirect != indirect)
return false;
return true;
});
}
}
static void changePossibleToKnown(std::list<ValueFlow::Value>& values, int indirect = -1)
{
for (ValueFlow::Value& v : values) {
@ -2015,20 +1996,6 @@ static void valueFlowBeforeCondition(TokenList *tokenlist, SymbolDatabase *symbo
}
}
static void removeValues(std::list<ValueFlow::Value> &values, const std::list<ValueFlow::Value> &valuesToRemove)
{
for (std::list<ValueFlow::Value>::iterator it = values.begin(); it != values.end();) {
const bool found = std::any_of(valuesToRemove.cbegin(), valuesToRemove.cend(),
[=](const ValueFlow::Value &v2) {
return it->intvalue == v2.intvalue;
});
if (found)
values.erase(it++);
else
++it;
}
}
static void valueFlowAST(Token *tok, nonneg int varid, const ValueFlow::Value &value, const Settings *settings)
{
if (!tok)
@ -2057,21 +2024,6 @@ static void valueFlowAST(Token *tok, nonneg int varid, const ValueFlow::Value &v
valueFlowAST(tok->astOperand2(), varid, value, settings);
}
/** if known variable is changed in loop body, change it to a possible value */
static bool handleKnownValuesInLoop(const Token *startToken,
const Token *endToken,
std::list<ValueFlow::Value> *values,
nonneg int varid,
bool globalvar,
const Settings *settings)
{
const bool isChanged = isVariableChanged(startToken, endToken, varid, globalvar, settings, true);
if (!isChanged)
return false;
lowerToPossible(*values);
return isChanged;
}
static bool evalAssignment(ValueFlow::Value &lhsValue, const std::string &assign, const ValueFlow::Value &rhsValue)
{
if (lhsValue.isIntValue()) {
@ -2149,15 +2101,6 @@ static bool isAliasOf(const Variable * var, const Token *tok, nonneg int varid,
return false;
}
static std::set<int> getIndirections(const std::list<ValueFlow::Value>& values)
{
std::set<int> result;
std::transform(values.begin(), values.end(), std::inserter(result, result.end()), [](const ValueFlow::Value& v) {
return std::max(0, v.indirect);
});
return result;
}
static void valueFlowForwardExpression(Token* startToken,
const Token* endToken,
const Token* exprTok,
@ -2226,15 +2169,6 @@ static bool bifurcate(const Token* tok, const std::set<nonneg int>& varids, cons
return false;
}
static void addCondition(std::list<ValueFlow::Value>& values, const Token* condTok, bool assume)
{
for (ValueFlow::Value& v : values)
if (assume)
v.errorPath.emplace_back(condTok, "Assuming condition is true.");
else
v.errorPath.emplace_back(condTok, "Assuming condition is false.");
}
struct VariableForwardAnalyzer : ForwardAnalyzer {
Token* start;
const Variable* var;