/* * Cppcheck - A tool for static C/C++ code analysis * Copyright (C) 2007-2013 Daniel Marjamäki and 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 . */ //--------------------------------------------------------------------------- #ifndef libraryH #define libraryH //--------------------------------------------------------------------------- #include "config.h" #include "path.h" #include "mathlib.h" #include #include #include #include #include class TokenList; namespace tinyxml2 { class XMLDocument; } /// @addtogroup Core /// @{ /** * @brief Library definitions handling */ class CPPCHECKLIB Library { public: Library(); bool load(const char exename [], const char path []); bool load(const tinyxml2::XMLDocument &doc); /** get allocation id for function (by name) */ int alloc(const std::string &name) const { return getid(_alloc, name); } /** get deallocation id for function (by name) */ int dealloc(const std::string &name) const { return getid(_dealloc, name); } /** set allocation id for function */ void setalloc(const std::string &functionname, int id) { _alloc[functionname] = id; } void setdealloc(const std::string &functionname, int id) { _dealloc[functionname] = id; } /** add noreturn function setting */ void setnoreturn(const std::string& funcname, bool noreturn) { _noreturn[funcname] = noreturn; } /** is allocation type memory? */ static bool ismemory(int id) { return ((id > 0) && ((id & 1) == 0)); } /** is allocation type resource? */ static bool isresource(int id) { return ((id > 0) && ((id & 1) == 1)); } std::set use; std::set leakignore; bool isnoreturn(const std::string &name) const { std::map::const_iterator it = _noreturn.find(name); return (it != _noreturn.end() && it->second); } bool isnotnoreturn(const std::string &name) const { std::map::const_iterator it = _noreturn.find(name); return (it != _noreturn.end() && !it->second); } class ArgumentChecks { public: ArgumentChecks() : notbool(false), notnull(false), notuninit(false), formatstr(false), strz(false) { } bool notbool; bool notnull; bool notuninit; bool formatstr; bool strz; std::string valid; }; // function name, argument nr => argument data std::map > argumentChecks; bool isboolargbad(const std::string &functionName, int argnr) const { const ArgumentChecks *arg = getarg(functionName, argnr); return arg && arg->notbool; } bool isnullargbad(const std::string &functionName, int argnr) const { const ArgumentChecks *arg = getarg(functionName, argnr); return arg && arg->notnull; } bool isuninitargbad(const std::string &functionName, int argnr) const { const ArgumentChecks *arg = getarg(functionName, argnr); return arg && arg->notuninit; } bool isargformatstr(const std::string &functionName, int argnr) const { const ArgumentChecks *arg = getarg(functionName, argnr); return arg && arg->formatstr; } bool isargstrz(const std::string &functionName, int argnr) const { const ArgumentChecks *arg = getarg(functionName, argnr); return arg && arg->strz; } bool isargvalid(const std::string &functionName, int argnr, const MathLib::bigint argvalue) const; std::string validarg(const std::string &functionName, int argnr) const { const ArgumentChecks *arg = getarg(functionName, argnr); return arg ? arg->valid : std::string(""); } bool markupFile(const std::string &path) const { return _markupExtensions.find(Path::getFilenameExtensionInLowerCase(path)) != _markupExtensions.end(); } bool processMarkupAfterCode(const std::string &path) const { const std::map::const_iterator it = _processAfterCode.find(Path::getFilenameExtensionInLowerCase(path)); return (it == _processAfterCode.end() || it->second); } const std::set &markupExtensions() const { return _markupExtensions; } bool reportErrors(const std::string &path) const { const std::map::const_iterator it = _reporterrors.find(Path::getFilenameExtensionInLowerCase(path)); return (it == _reporterrors.end() || it->second); } bool ignorefunction(const std::string &function) const { return (_ignorefunction.find(function) != _ignorefunction.end()); } bool isexecutableblock(const std::string &file, const std::string &token) const { const std::map::const_iterator it = _executableblocks.find(Path::getFilenameExtensionInLowerCase(file)); return (it != _executableblocks.end() && it->second.isBlock(token)); } int blockstartoffset(const std::string &file) const { int offset = -1; const std::map::const_iterator map_it = _executableblocks.find(Path::getFilenameExtensionInLowerCase(file)); if (map_it != _executableblocks.end()) { offset = map_it->second.offset(); } return offset; } std::string blockstart(const std::string &file) const { std::string start; const std::map::const_iterator map_it = _executableblocks.find(Path::getFilenameExtensionInLowerCase(file)); if (map_it != _executableblocks.end()) { start = map_it->second.start(); } return start; } std::string blockend(const std::string &file) const { std::string end; const std::map::const_iterator map_it = _executableblocks.find(Path::getFilenameExtensionInLowerCase(file)); if (map_it != _executableblocks.end()) { end = map_it->second.end(); } return end; } bool iskeyword(const std::string &file, const std::string &keyword) const { const std::map >::const_iterator it = _keywords.find(Path::getFilenameExtensionInLowerCase(file)); return (it != _keywords.end() && it->second.count(keyword)); } bool isexporter(const std::string &prefix) const { return _exporters.find(prefix) != _exporters.end(); } bool isexportedprefix(const std::string &prefix, const std::string &token) const { const std::map::const_iterator it = _exporters.find(prefix); return (it != _exporters.end() && it->second.isPrefix(token)); } bool isexportedsuffix(const std::string &prefix, const std::string &token) const { const std::map::const_iterator it = _exporters.find(prefix); return (it != _exporters.end() && it->second.isSuffix(token)); } bool isimporter(const std::string& file, const std::string &importer) const { const std::map >::const_iterator it = _importers.find(Path::getFilenameExtensionInLowerCase(file)); return (it != _importers.end() && it->second.count(importer) > 0); } bool isreflection(const std::string& file, const std::string &token) const { const std::map >::const_iterator it = _reflection.find(Path::getFilenameExtensionInLowerCase(file)); return (it != _reflection.end() && it->second.count(token)); } int reflectionArgument(const std::string& file, const std::string &token) const { int argIndex = -1; const std::map >::const_iterator it = _reflection.find(Path::getFilenameExtensionInLowerCase(file)); if (it != _reflection.end()) { const std::map::const_iterator it2 = it->second.find(token); if (it2 != it->second.end()) { argIndex = it2->second; } } return argIndex; } std::set returnuninitdata; private: class ExportedFunctions { public: void addPrefix(const std::string& prefix) { _prefixes.insert(prefix); } void addSuffix(const std::string& suffix) { _suffixes.insert(suffix); } bool isPrefix(const std::string& prefix) const { return (_prefixes.find(prefix) != _prefixes.end()); } bool isSuffix(const std::string& suffix) const { return (_suffixes.find(suffix) != _suffixes.end()); } private: std::set _prefixes; std::set _suffixes; }; class CodeBlock { public: CodeBlock() : _offset(0) {} void setStart(const std::string& s) { _start = s; } void setEnd(const std::string& e) { _end = e; } void setOffset(const int o) { _offset = o; } void addBlock(const std::string& blockName) { _blocks.insert(blockName); } std::string start() const { return _start; } std::string end() const { return _end; } int offset() const { return _offset; } bool isBlock(const std::string& blockName) const { return _blocks.find(blockName) != _blocks.end(); } private: std::string _start; std::string _end; int _offset; std::set _blocks; }; int allocid; std::map _alloc; // allocation functions std::map _dealloc; // deallocation functions std::map _noreturn; // is function noreturn? std::set _ignorefunction; // ignore functions/macros from a library (gtk, qt etc) std::map _reporterrors; std::map _processAfterCode; std::set _markupExtensions; // file extensions of markup files std::map > _keywords; // keywords for code in the library std::map _executableblocks; // keywords for blocks of executable code std::map _exporters; // keywords that export variables/functions to libraries (meta-code/macros) std::map > _importers; // keywords that import variables/functions std::map > _reflection; // invocation of reflection const ArgumentChecks * getarg(const std::string &functionName, int argnr) const { std::map >::const_iterator it1; it1 = argumentChecks.find(functionName); if (it1 != argumentChecks.end()) { const std::map::const_iterator it2 = it1->second.find(argnr); if (it2 != it1->second.end()) return &it2->second; } return NULL; } static int getid(const std::map &data, const std::string &name) { const std::map::const_iterator it = data.find(name); return (it == data.end()) ? 0 : it->second; } }; /// @} //--------------------------------------------------------------------------- #endif // libraryH