cppcheck/lib/checkstl.h

162 lines
4.7 KiB
C
Raw Normal View History

2009-02-10 20:40:21 +01:00
/*
* Cppcheck - A tool for static C/C++ code analysis
* Copyright (C) 2007-2009 Daniel Marjamäki and Cppcheck team.
2009-02-10 20:40:21 +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/>.
2009-02-10 20:40:21 +01:00
*/
//---------------------------------------------------------------------------
#ifndef checkstlH
#define checkstlH
//---------------------------------------------------------------------------
#include "check.h"
2009-02-11 06:08:29 +01:00
class Token;
2009-02-10 20:40:21 +01:00
/// @addtogroup Checks
/// @{
/** @brief %Check STL usage */
class CheckStl : public Check
2009-02-10 20:40:21 +01:00
{
public:
/** This constructor is used when registering the CheckClass */
2009-03-20 17:15:51 +01:00
CheckStl() : Check()
{ }
/** This constructor is used when running checks.. */
2009-03-20 17:15:51 +01:00
CheckStl(const Tokenizer *tokenizer, const Settings *settings, ErrorLogger *errorLogger)
: Check(tokenizer, settings, errorLogger)
{ }
void runSimplifiedChecks(const Tokenizer *tokenizer, const Settings *settings, ErrorLogger *errorLogger)
{
2009-03-20 17:15:51 +01:00
CheckStl checkStl(tokenizer, settings, errorLogger);
checkStl.stlOutOfBounds();
checkStl.iterators();
checkStl.mismatchingContainers();
2009-03-20 17:15:51 +01:00
checkStl.erase();
checkStl.pushback();
checkStl.stlBoundries();
checkStl.find();
checkStl.size();
}
2009-02-10 20:40:21 +01:00
/**
* Finds errors like this:
* for (unsigned ii = 0; ii <= foo.size(); ++ii)
*/
void stlOutOfBounds();
2009-02-11 06:08:29 +01:00
/**
* Finds errors like this:
* for (it = foo.begin(); it != bar.end(); ++it)
*/
2009-02-10 20:40:21 +01:00
void iterators();
/**
* Mismatching containers:
* std::find(foo.begin(), bar.end(), x)
*/
void mismatchingContainers();
/** Dereferencing an erased iterator */
void dereferenceErasedError(const Token *tok, const std::string &itername);
2009-02-11 06:08:29 +01:00
/**
* Dangerous usage of erase
*/
void erase();
/**
* Dangerous usage of push_back and insert
*/
void pushback();
/**
* bad condition.. "it < alist.end()"
*/
void stlBoundries();
2009-11-02 20:25:08 +01:00
/** usage of std::find */
void find();
/**
* Suggest using empty() instead of checking size() against zero for containers.
* Item 4 from Scott Meyers book "Effective STL".
*/
void size();
2009-02-10 20:40:21 +01:00
private:
2009-02-11 06:08:29 +01:00
/**
* Helper function used by the 'erase' function
* This function parses a loop
* @param it iterator token
*/
void eraseCheckLoop(const Token *it);
void stlOutOfBoundsError(const Token *tok, const std::string &num, const std::string &var);
void iteratorsError(const Token *tok, const std::string &container1, const std::string &container2);
void mismatchingContainersError(const Token *tok);
2009-03-21 17:58:13 +01:00
void eraseError(const Token *tok);
2009-10-21 20:15:11 +02:00
void invalidIteratorError(const Token *tok, const std::string &func, const std::string &iterator_name);
void invalidPointerError(const Token *tok, const std::string &pointer_name);
void stlBoundriesError(const Token *tok, const std::string &container_name);
void findError(const Token *tok);
void sizeError(const Token *tok);
void getErrorMessages()
{
iteratorsError(0, "container1", "container2");
mismatchingContainersError(0);
dereferenceErasedError(0, "iter");
stlOutOfBoundsError(0, "i", "foo");
2009-03-21 17:58:13 +01:00
eraseError(0);
2009-10-21 20:15:11 +02:00
invalidIteratorError(0, "push_back|push_front|insert", "iterator");
invalidPointerError(0, "pointer");
stlBoundriesError(0, "container");
findError(0);
sizeError(0);
}
2009-06-12 15:20:08 +02:00
std::string name() const
{
return "STL usage";
}
std::string classInfo() const
{
2009-06-12 15:20:08 +02:00
return "Check for invalid usage of STL:\n"
" * out of bounds errors\n"
" * misuse of iterators when iterating through a container\n"
" * mismatching containers in calls\n"
" * dereferencing an erased iterator\n"
" * for vectors: using iterator/pointer after push_back has been used\n"
2009-12-19 19:24:48 +01:00
" * dangerous usage of find\n"
" * optimisation: using empty() instead of size()";
}
bool isStlContainer(const Token *tok);
2009-02-10 20:40:21 +01:00
};
/// @}
2009-02-10 20:40:21 +01:00
//---------------------------------------------------------------------------
#endif