cppcheck/lib/checkpostfixoperator.cpp

110 lines
3.8 KiB
C++
Raw Normal View History

2010-10-12 19:54:39 +02:00
/*
* Cppcheck - A tool for static C/C++ code analysis
* Copyright (C) 2007-2011 Daniel Marjamäki and Cppcheck team.
2010-10-12 19:54:39 +02: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/>.
*/
//---------------------------------------------------------------------------
2010-10-14 19:59:10 +02:00
// You should use ++ and -- as prefix whenever possible as these are more
2010-10-12 19:54:39 +02:00
// efficient than postfix operators
//---------------------------------------------------------------------------
#include "checkpostfixoperator.h"
//---------------------------------------------------------------------------
// Register this check class (by creating a static instance of it)
namespace
{
CheckPostfixOperator instance;
}
void CheckPostfixOperator::postfixOperator()
{
if (!_settings->_checkCodingStyle)
return;
const Token *tok = _tokenizer->tokens();
// prevent crash if first token is ++ or --
if (Token::Match(tok, "++|--"))
tok = tok->next();
for (; tok; tok = tok->next())
2010-10-12 19:54:39 +02:00
{
bool result = false;
2010-10-14 19:59:10 +02:00
if (Token::Match(tok, "++|--"))
{
if (Token::Match(tok->previous()->previous(), ";|{|}") && Token::Match(tok->next(), ";|)|,"))
{
result = true;
}
else if (tok->strAt(-2) == ",")
{
int i(1);
while (tok->strAt(i) != ")" && tok->tokAt(i) != 0)
2010-10-14 19:59:10 +02:00
{
if (tok->strAt(i) == ";")
{
result = true;
break;
}
++i;
}
}
else if (tok->strAt(-2) == "<<" && tok->strAt(1) == "<<")
{
result = true;
2010-10-12 19:54:39 +02:00
}
}
if (result && tok->previous()->varId())
2010-10-14 19:59:10 +02:00
{
const Token *decltok = Token::findmatch(_tokenizer->tokens(), "%varid%", tok->previous()->varId());
if (decltok == NULL || !Token::Match(decltok->tokAt(-1), "%type%"))
continue;
if (Token::Match(decltok->previous(), "iterator|const_iterator|reverse_iterator|const_reverse_iterator"))
2010-10-14 19:59:10 +02:00
{
// the variable is an iterator
postfixOperatorError(tok);
}
else
{
const std::string classDef = std::string("class ") + std::string(decltok->previous()->strAt(0));
if (Token::findmatch(_tokenizer->tokens(), classDef.c_str()))
{
// the variable is an instance of class
postfixOperatorError(tok);
}
2010-10-12 19:54:39 +02:00
}
}
}
}
//---------------------------------------------------------------------------
void CheckPostfixOperator::postfixOperatorError(const Token *tok)
{
reportError(tok, Severity::performance, "postfixOperator",
2010-11-27 19:54:02 +01:00
"Prefer prefix ++/-- operators for non-primitive types.\n"
"Prefix ++/-- operators should be preferred for non-primitive types. "
"Pre-increment/decrement can be more efficient than "
"post-increment/decrement. Post-increment/decrement usually "
"involves keeping a copy of the previous value around and "
"adds a little extra code.");
2010-10-12 19:54:39 +02:00
}