/* * Cppcheck - A tool for static C/C++ code analysis * Copyright (C) 2007-2009 Daniel Marjamäki, Reijo Tomperi, Nicolas Le Cam, * Leandro Penz, Kimmo Varis, Vesa Pikki * * 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 _checkCodingStyle) { checkOther.WarningOldStylePointerCast(); checkOther.WarningRedundantCode(); checkOther.WarningIf(); checkOther.CheckVariableScope(); checkOther.CheckConstantFunctionParameter(); checkOther.CheckStructMemberUsage(); checkOther.CheckIncompleteStatement(); } checkOther.strPlusChar(); checkOther.returnPointerToStackData(); checkOther.InvalidFunctionUsage(); } // Casting void WarningOldStylePointerCast(); // Redundant code void WarningRedundantCode(); // Warning upon: if (condition); void WarningIf(); // Invalid function usage.. void InvalidFunctionUsage(); // Check for unsigned division that might create bad results void CheckUnsignedDivision(); // Check scope of variables void CheckVariableScope(); // Check for constant function parameter void CheckConstantFunctionParameter(); // Check that all struct members are used void CheckStructMemberUsage(); // Using char variable as array index / as operand in bit operation void CheckCharVariable(); // Incomplete statement. A statement that only contains a constant or variable void CheckIncompleteStatement(); /** str plus char */ void strPlusChar(); /** Returning pointer to local data */ void returnPointerToStackData(); protected: void CheckVariableScope_LookupVar(const Token *tok1, const char varname[]); // Redundant condition // if (haystack.find(needle) != haystack.end()) // haystack.remove(needle); void redundantCondition2(); }; //--------------------------------------------------------------------------- #endif