1175 lines
37 KiB
C++
1175 lines
37 KiB
C++
/*
|
|
* c++check - c/c++ syntax checking
|
|
* Copyright (C) 2007 Daniel Marjamäki
|
|
*
|
|
* 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/
|
|
*/
|
|
|
|
|
|
#include "CheckMemoryLeak.h"
|
|
|
|
#include <stdlib.h> // free
|
|
|
|
#include <algorithm>
|
|
|
|
#include <iostream>
|
|
#include <sstream>
|
|
|
|
#ifdef __BORLANDC__
|
|
#include <mem.h> // <- memset
|
|
#else
|
|
#include <string.h>
|
|
#endif
|
|
|
|
#ifndef _MSC_VER
|
|
#define _strdup(str) strdup(str)
|
|
#endif
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
CheckMemoryLeakClass::CheckMemoryLeakClass( const Tokenizer *tokenizer, const Settings &settings, ErrorLogger *errorLogger )
|
|
: _settings(settings)
|
|
{
|
|
_tokenizer = tokenizer;
|
|
_errorLogger = errorLogger;
|
|
}
|
|
|
|
CheckMemoryLeakClass::~CheckMemoryLeakClass()
|
|
{
|
|
|
|
}
|
|
|
|
bool CheckMemoryLeakClass::isclass( const TOKEN *tok )
|
|
{
|
|
if ( tok->isStandardType() )
|
|
return false;
|
|
|
|
std::ostringstream pattern;
|
|
pattern << "struct " << tok->str();
|
|
if ( TOKEN::findmatch( _tokenizer->tokens(), pattern.str().c_str() ) )
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
//---------------------------------------------------------------------------
|
|
|
|
CheckMemoryLeakClass::AllocType CheckMemoryLeakClass::GetAllocationType( const TOKEN *tok2 )
|
|
{
|
|
// What we may have...
|
|
// * var = (char *)malloc(10);
|
|
// * var = new char[10];
|
|
// * var = strdup("hello");
|
|
if ( tok2 && tok2->aaaa0() == '(' )
|
|
{
|
|
while ( tok2 && tok2->aaaa0() != ')' )
|
|
tok2 = tok2->next;
|
|
tok2 = tok2 ? tok2->next : NULL;
|
|
}
|
|
if ( ! tok2 )
|
|
return No;
|
|
|
|
// Does tok2 point on "malloc", "strdup" or "kmalloc"..
|
|
const char *mallocfunc[] = {"malloc",
|
|
"calloc",
|
|
"strdup",
|
|
"kmalloc",
|
|
"kzalloc",
|
|
"kcalloc",
|
|
0};
|
|
for ( unsigned int i = 0; mallocfunc[i]; i++ )
|
|
{
|
|
if ( strcmp(mallocfunc[i], tok2->aaaa()) == 0 )
|
|
return Malloc;
|
|
}
|
|
|
|
// Does tok2 point on "malloc", "strdup" or "kmalloc"..
|
|
const char *gmallocfunc[] = {"g_new",
|
|
"g_new0",
|
|
"g_renew",
|
|
"g_try_new",
|
|
"g_try_new0",
|
|
"g_try_renew",
|
|
"g_malloc",
|
|
"g_malloc0",
|
|
"g_realloc",
|
|
"g_try_malloc",
|
|
"g_try_malloc0",
|
|
"g_try_realloc",
|
|
"g_strdup",
|
|
"g_strndup",
|
|
0};
|
|
for ( unsigned int i = 0; gmallocfunc[i]; i++ )
|
|
{
|
|
if ( strcmp(gmallocfunc[i], tok2->aaaa()) == 0 )
|
|
return gMalloc;
|
|
}
|
|
|
|
if ( TOKEN::Match( tok2, "new %type% [;(]" ) )
|
|
return New;
|
|
|
|
if ( TOKEN::Match( tok2, "new %type% [" ) )
|
|
return NewA;
|
|
|
|
if ( TOKEN::Match( tok2, "fopen (" ) )
|
|
return FOPEN;
|
|
|
|
if ( TOKEN::Match( tok2, "popen (" ) )
|
|
return POPEN;
|
|
|
|
// Userdefined allocation function..
|
|
std::list<AllocFunc>::const_iterator it = _listAllocFunc.begin();
|
|
while ( it != _listAllocFunc.end() )
|
|
{
|
|
if ( strcmp(tok2->aaaa(), it->funcname) == 0 )
|
|
return it->alloctype;
|
|
++it;
|
|
}
|
|
|
|
return No;
|
|
}
|
|
|
|
CheckMemoryLeakClass::AllocType CheckMemoryLeakClass::GetDeallocationType( const TOKEN *tok, const char *varnames[] )
|
|
{
|
|
// Redundant condition..
|
|
if ( TOKEN::Match(tok, "if ( %var1% )", varnames) )
|
|
{
|
|
tok = tok->tokAt(4);
|
|
if (tok->str() =="{")
|
|
tok = tok->next;
|
|
}
|
|
|
|
if ( TOKEN::Match(tok, "delete %var1% ;", varnames) )
|
|
return New;
|
|
|
|
if ( TOKEN::Match(tok, "delete [ ] %var1% ;", varnames) )
|
|
return NewA;
|
|
|
|
if ( TOKEN::Match(tok, "free ( %var1% ) ;", varnames) ||
|
|
TOKEN::Match(tok, "kfree ( %var1% ) ;", varnames) )
|
|
{
|
|
return Malloc;
|
|
}
|
|
|
|
if ( TOKEN::Match(tok, "g_free ( %var1% ) ;", varnames) )
|
|
return gMalloc;
|
|
|
|
if ( TOKEN::Match(tok, "fclose ( %var1% )", varnames) )
|
|
return FOPEN;
|
|
|
|
if ( TOKEN::Match(tok, "pclose ( %var1% )", varnames) )
|
|
return POPEN;
|
|
|
|
return No;
|
|
}
|
|
//--------------------------------------------------------------------------
|
|
|
|
const char * CheckMemoryLeakClass::call_func( const TOKEN *tok, std::list<const TOKEN *> callstack, const char *varnames[], AllocType &alloctype, AllocType &dealloctype )
|
|
{
|
|
if (TOKEN::Match(tok,"if") || TOKEN::Match(tok,"for") || TOKEN::Match(tok,"while"))
|
|
return 0;
|
|
|
|
if (GetAllocationType(tok)!=No || GetDeallocationType(tok,varnames)!=No)
|
|
return 0;
|
|
|
|
if ( callstack.size() > 2 )
|
|
return "dealloc";
|
|
|
|
const char *funcname = tok->aaaa();
|
|
for ( std::list<const TOKEN *>::const_iterator it = callstack.begin(); it != callstack.end(); ++it )
|
|
{
|
|
if ( std::string(funcname) == (*it)->aaaa() )
|
|
return "dealloc";
|
|
}
|
|
callstack.push_back(tok);
|
|
|
|
int par = 1;
|
|
int parlevel = 0;
|
|
for ( ; tok; tok = tok->next )
|
|
{
|
|
if ( tok->str() == "(" )
|
|
++parlevel;
|
|
else if ( tok->str() == ")" )
|
|
{
|
|
--parlevel;
|
|
if ( parlevel < 1 )
|
|
return NULL;
|
|
}
|
|
|
|
if ( parlevel == 1 )
|
|
{
|
|
if ( tok->str() == "," )
|
|
++par;
|
|
if ( TOKEN::Match(tok, "[,()] %var1% [,()]", varnames) )
|
|
{
|
|
const TOKEN *ftok = _tokenizer->GetFunctionTokenByName(funcname);
|
|
const char *parname = Tokenizer::getParameterName( ftok, par );
|
|
if ( ! parname )
|
|
return "use";
|
|
// Check if the function deallocates the variable..
|
|
while ( ftok && (ftok->str() != "{") )
|
|
ftok = ftok->next;
|
|
TOKEN *func = getcode( ftok->tokAt(1), callstack, parname, alloctype, dealloctype );
|
|
simplifycode( func );
|
|
const TOKEN *func_ = func;
|
|
while ( func_ && func_->str() == ";" )
|
|
func_ = func_->next;
|
|
/*
|
|
for (const TOKEN *t = func; t; t = t->next)
|
|
{
|
|
std::cout << t->str() << "\n";
|
|
}*/
|
|
|
|
const char *ret = 0;
|
|
if (TOKEN::findmatch(func_, "goto"))
|
|
{
|
|
// TODO : "goto" isn't handled well
|
|
if ( TOKEN::findmatch(func_, "dealloc") )
|
|
ret = "dealloc";
|
|
else if ( TOKEN::findmatch(func_, "use") )
|
|
ret = "use";
|
|
}
|
|
else if ( TOKEN::findmatch(func_, "dealloc") )
|
|
ret = "dealloc";
|
|
else if ( TOKEN::findmatch(func_, "use") )
|
|
ret = "use";
|
|
|
|
Tokenizer::deleteTokens(func);
|
|
return ret;
|
|
}
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
|
|
void CheckMemoryLeakClass::MismatchError( const TOKEN *Tok1, const std::list<const TOKEN *> &callstack, const char varname[] )
|
|
{
|
|
std::ostringstream errmsg;
|
|
for ( std::list<const TOKEN *>::const_iterator tok = callstack.begin(); tok != callstack.end(); ++tok )
|
|
errmsg << _tokenizer->fileLine(*tok) << " -> ";
|
|
errmsg << _tokenizer->fileLine(Tok1) << ": Mismatching allocation and deallocation: " << varname;
|
|
_errorLogger->reportErr( errmsg.str() );
|
|
}
|
|
//---------------------------------------------------------------------------
|
|
|
|
void CheckMemoryLeakClass::MemoryLeak( const TOKEN *tok, const char varname[] )
|
|
{
|
|
std::ostringstream errmsg;
|
|
errmsg << _tokenizer->fileLine(tok) << ": Memory leak: " << varname;
|
|
_errorLogger->reportErr( errmsg.str() );
|
|
}
|
|
//---------------------------------------------------------------------------
|
|
|
|
void CheckMemoryLeakClass::instoken(TOKEN *tok, const char str[])
|
|
{
|
|
TOKEN *newtok = new TOKEN;
|
|
newtok->setstr(str);
|
|
newtok->next = tok->next;
|
|
tok->next = newtok;
|
|
}
|
|
//---------------------------------------------------------------------------
|
|
|
|
bool CheckMemoryLeakClass::notvar(const TOKEN *tok, const char *varnames[])
|
|
{
|
|
return bool( TOKEN::Match(tok, "! %var1% [;)&|]", varnames) ||
|
|
TOKEN::Match(tok, "! ( %var1% )", varnames) ||
|
|
TOKEN::Match(tok, "unlikely ( ! %var1% )", varnames) ||
|
|
TOKEN::Match(tok, "unlikely ( %var1% == 0 )", varnames) ||
|
|
TOKEN::Match(tok, "0 == %var1% [;)&|]", varnames) ||
|
|
TOKEN::Match(tok, "%var1% == 0", varnames) );
|
|
}
|
|
|
|
/**
|
|
* Extract a new tokens list that is easier to parse than the "tokens"
|
|
* tok - start parse token
|
|
* varname - name of variable
|
|
*/
|
|
|
|
TOKEN *CheckMemoryLeakClass::getcode(const TOKEN *tok, std::list<const TOKEN *> callstack, const char varname[], AllocType &alloctype, AllocType &dealloctype)
|
|
{
|
|
const char *varnames[2];
|
|
varnames[0] = varname;
|
|
varnames[1] = 0;
|
|
|
|
TOKEN *rethead = 0, *rettail = 0;
|
|
#define addtoken(_str) \
|
|
{ \
|
|
TOKEN *newtok = new TOKEN; \
|
|
newtok->setstr(_str); \
|
|
newtok->linenr = tok->linenr; \
|
|
newtok->FileIndex = tok->FileIndex; \
|
|
newtok->next = 0; \
|
|
if (rettail) \
|
|
rettail->next = newtok; \
|
|
else \
|
|
rethead = newtok; \
|
|
rettail=newtok; \
|
|
}
|
|
|
|
|
|
// The first token should be ";"
|
|
addtoken(";");
|
|
|
|
|
|
bool isloop = false;
|
|
|
|
int indentlevel = 0;
|
|
int parlevel = 0;
|
|
for ( ; tok; tok = tok->next )
|
|
{
|
|
if ( tok->aaaa0() == '{' )
|
|
{
|
|
addtoken( "{" );
|
|
indentlevel++;
|
|
}
|
|
else if ( tok->aaaa0() == '}' )
|
|
{
|
|
if ( indentlevel <= 0 )
|
|
break;
|
|
addtoken( "}" );
|
|
indentlevel--;
|
|
}
|
|
|
|
if ( tok->str() == "(" )
|
|
parlevel++;
|
|
else if ( tok->str() == ")" )
|
|
parlevel--;
|
|
isloop &= ( parlevel > 0 );
|
|
|
|
if ( parlevel == 0 && tok->str()==";")
|
|
addtoken(";");
|
|
|
|
if (TOKEN::Match(tok, "[(;{}] %var1% =", varnames))
|
|
{
|
|
AllocType alloc = GetAllocationType(tok->tokAt(3));
|
|
|
|
// If "--all" hasn't been given, don't check classes..
|
|
if ( alloc == New && ! _settings._showAll )
|
|
{
|
|
if ( TOKEN::Match(tok->tokAt(3), "new %type% [(;]") )
|
|
{
|
|
if ( isclass( tok->tokAt(4) ) )
|
|
alloc = No;
|
|
}
|
|
}
|
|
|
|
if ( alloc != No )
|
|
{
|
|
addtoken("alloc");
|
|
if (alloctype!=No && alloctype!=alloc)
|
|
MismatchError(tok, callstack, varname);
|
|
if (dealloctype!=No && dealloctype!=alloc)
|
|
MismatchError(tok, callstack, varname);
|
|
alloctype = alloc;
|
|
}
|
|
}
|
|
|
|
AllocType dealloc = GetDeallocationType(tok, varnames);
|
|
if ( dealloc != No )
|
|
{
|
|
addtoken("dealloc");
|
|
if (alloctype!=No && alloctype!=dealloc)
|
|
MismatchError(tok, callstack, varname);
|
|
if (dealloctype!=No && dealloctype!=dealloc)
|
|
MismatchError(tok, callstack, varname);
|
|
dealloctype = dealloc;
|
|
}
|
|
|
|
// if else switch
|
|
if ( TOKEN::Match(tok, "if ( %var1% )", varnames) ||
|
|
TOKEN::Match(tok, "if ( %var1% != 0 )", varnames) ||
|
|
TOKEN::Match(tok, "if ( 0 != %var1% )", varnames) )
|
|
{
|
|
addtoken("if(var)");
|
|
|
|
// Make sure the "use" will not be added
|
|
while ( tok->str() != ")" )
|
|
tok = tok->next;
|
|
}
|
|
else if ( TOKEN::Match(tok, "if (") && notvar(tok->tokAt(2), varnames) )
|
|
{
|
|
addtoken("if(!var)");
|
|
}
|
|
else if ( TOKEN::Match(tok, "if ( true )") )
|
|
{
|
|
addtoken("if(true)");
|
|
}
|
|
else if ( TOKEN::Match(tok, "if ( false )") )
|
|
{
|
|
addtoken("if(false)");
|
|
}
|
|
else if ( TOKEN::Match(tok, "if") )
|
|
{
|
|
// Check if the condition depends on var somehow..
|
|
bool dep = false;
|
|
int parlevel = 0;
|
|
for ( const TOKEN *tok2 = tok; tok2; tok2 = tok2->next )
|
|
{
|
|
if ( tok2->str() == "(" )
|
|
++parlevel;
|
|
if ( tok2->str() == ")" )
|
|
{
|
|
--parlevel;
|
|
if ( parlevel <= 0 )
|
|
break;
|
|
}
|
|
if ( (tok2->str() != ".") &&
|
|
TOKEN::Match(tok2->next, "%var1%", varnames) &&
|
|
!TOKEN::Match(tok2->next, "%var1% .", varnames) )
|
|
{
|
|
dep = true;
|
|
break;
|
|
}
|
|
}
|
|
addtoken( (dep ? "ifv" : "if") );
|
|
}
|
|
else if ( (tok->str() == "else") || (tok->str() == "switch") )
|
|
{
|
|
addtoken(tok->aaaa());
|
|
}
|
|
|
|
if ( (tok->str() == "case") )
|
|
{
|
|
addtoken("case");
|
|
addtoken(";");
|
|
}
|
|
|
|
if ( (tok->str() == "default") )
|
|
{
|
|
addtoken("case");
|
|
addtoken(";");
|
|
}
|
|
|
|
// Loops..
|
|
if ((tok->str() == "for") || (tok->str() == "while") )
|
|
{
|
|
addtoken("loop");
|
|
isloop = true;
|
|
}
|
|
if ( (tok->str() == "do") )
|
|
{
|
|
addtoken("do");
|
|
}
|
|
if ( isloop && notvar(tok,varnames) )
|
|
addtoken("!var");
|
|
|
|
// continue / break..
|
|
if ( tok->str() == "continue" )
|
|
addtoken("continue");
|
|
if ( tok->str() == "break" )
|
|
addtoken("break");
|
|
|
|
// goto..
|
|
if ( tok->str() == "goto" )
|
|
{
|
|
addtoken("goto");
|
|
}
|
|
|
|
// Return..
|
|
if ( tok->str() == "return" )
|
|
{
|
|
addtoken("return");
|
|
if ( TOKEN::Match(tok, "return %var1%", varnames) ||
|
|
TOKEN::Match(tok, "return & %var1%", varnames) )
|
|
addtoken("use");
|
|
}
|
|
|
|
// throw..
|
|
if ( tok->str() == "throw" )
|
|
addtoken("throw");
|
|
|
|
// Assignment..
|
|
if ( TOKEN::Match(tok,"[)=] %var1% [;)]", varnames) )
|
|
addtoken("use");
|
|
|
|
// Investigate function calls..
|
|
if ( TOKEN::Match(tok, "%var% (") )
|
|
{
|
|
const char *str = call_func(tok, callstack, varnames, alloctype, dealloctype);
|
|
if ( str )
|
|
addtoken( str );
|
|
}
|
|
|
|
// Callback..
|
|
if ( TOKEN::Match(tok, "( * %var% ) (") )
|
|
{
|
|
for ( const TOKEN *tok2 = tok->tokAt(5); tok2; tok2 = tok2->next )
|
|
{
|
|
if ( TOKEN::Match(tok2, ";{") )
|
|
break;
|
|
else if ( tok2->str() == varname )
|
|
{
|
|
addtoken("use");
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
// Linux lists..
|
|
if ( TOKEN::Match( tok, "[=(,] & %var1% [.[]", varnames ) )
|
|
{
|
|
// todo: better checking
|
|
addtoken("use");
|
|
}
|
|
}
|
|
|
|
return rethead;
|
|
}
|
|
|
|
void CheckMemoryLeakClass::erase(TOKEN *begin, const TOKEN *end)
|
|
{
|
|
if ( ! begin )
|
|
return;
|
|
|
|
while ( begin->next && begin->next != end )
|
|
{
|
|
TOKEN *next = begin->next;
|
|
begin->next = begin->next->next;
|
|
delete next;
|
|
}
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
* Simplify code
|
|
* \param tok first token
|
|
*/
|
|
void CheckMemoryLeakClass::simplifycode(TOKEN *tok)
|
|
{
|
|
// reduce the code..
|
|
bool done = false;
|
|
while ( ! done )
|
|
{
|
|
done = true;
|
|
|
|
for (TOKEN *tok2 = tok; tok2; tok2 = tok2 ? tok2->next : NULL )
|
|
{
|
|
// Delete extra ";"
|
|
while (TOKEN::Match(tok2,"[;{}] ;"))
|
|
{
|
|
erase(tok2, tok2->tokAt(2));
|
|
done = false;
|
|
}
|
|
|
|
// Replace "{ }" with ";"
|
|
if ( TOKEN::Match(tok2->next, "{ }") )
|
|
{
|
|
tok2->next->setstr(";");
|
|
erase(tok2->next, tok2->tokAt(3));
|
|
done = false;
|
|
}
|
|
|
|
// Delete braces around a single instruction..
|
|
if ( TOKEN::Match(tok2->next, "{ %var% ; }") )
|
|
{
|
|
erase( tok2, tok2->tokAt(2) );
|
|
erase( tok2->next->next, tok2->tokAt(4) );
|
|
done = false;
|
|
}
|
|
if ( TOKEN::Match(tok2->next, "{ return use ; }") )
|
|
{
|
|
erase( tok2, tok2->tokAt(2) );
|
|
erase( tok2->next->next->next, tok2->tokAt(5) );
|
|
done = false;
|
|
}
|
|
|
|
// Delete empty if that is not followed by an else
|
|
if (tok2->tokAt(2) &&
|
|
(tok2->next->str().find("if") == 0) &&
|
|
TOKEN::Match(tok2->tokAt(2), ";") &&
|
|
!TOKEN::Match(tok2->tokAt(3), "else"))
|
|
{
|
|
erase(tok2, tok2->tokAt(2));
|
|
done = false;
|
|
}
|
|
|
|
// Delete "if ; else ;"
|
|
if ( TOKEN::Match(tok2->next, "if ; else ;") )
|
|
{
|
|
erase( tok2, tok2->tokAt(4) );
|
|
done = false;
|
|
}
|
|
|
|
// TODO Make this more generic. Delete "if ; else use ; use"
|
|
if ( TOKEN::Match(tok2, "; if ; else use ; use") ||
|
|
TOKEN::Match(tok2, "; if use ; else ; use") )
|
|
{
|
|
erase( tok2, tok2->tokAt(4) );
|
|
done = false;
|
|
}
|
|
|
|
|
|
// Reduce "if dealloc ;" and "if use ;" that is not followed by an else..
|
|
// If "--all" has been given these are deleted
|
|
// Otherwise, ony the "if" will be deleted
|
|
if ((TOKEN::Match(tok2, "[;{}] if dealloc ;") || TOKEN::Match(tok2, "[;{}] if use ;")) &&
|
|
!TOKEN::Match(tok2->tokAt(4), "else"))
|
|
{
|
|
if ( _settings._showAll )
|
|
erase(tok2, tok2->tokAt(3));
|
|
else
|
|
erase( tok2, tok2->tokAt(2) );
|
|
done = false;
|
|
}
|
|
|
|
// Delete if block: "alloc; if return use ;"
|
|
if (TOKEN::Match(tok2,"alloc ; if return use ;") && !TOKEN::Match(tok2->tokAt(6),"else"))
|
|
{
|
|
erase(tok2, tok2->tokAt(5));
|
|
done = false;
|
|
}
|
|
|
|
// "[;{}] if alloc ; else return ;" => "[;{}] alloc ;"
|
|
if (TOKEN::Match(tok2,"[;{}] if alloc ; else return ;"))
|
|
{
|
|
erase(tok2, tok2->tokAt(2)); // Remove "if"
|
|
erase(tok2->next, tok2->tokAt(5)); // Remove "; else return"
|
|
done = false;
|
|
}
|
|
|
|
// Replace "dealloc use ;" with "dealloc ;"
|
|
if ( TOKEN::Match(tok2, "dealloc use ;") )
|
|
{
|
|
erase(tok2, tok2->tokAt(2));
|
|
done = false;
|
|
}
|
|
|
|
// Reducing if..
|
|
if (TOKEN::Match(tok2,"if dealloc ; else") || TOKEN::Match(tok2,"if use ; else"))
|
|
{
|
|
erase(tok2, tok2->tokAt(2));
|
|
done = false;
|
|
}
|
|
if (TOKEN::Match(tok2,"[;{}] if { dealloc ; return ; }") && !TOKEN::Match(tok2->tokAt(8),"else"))
|
|
{
|
|
erase(tok2,tok2->tokAt(8));
|
|
done = false;
|
|
}
|
|
|
|
// Reduce "do { alloc ; } " => "alloc ;"
|
|
if ( TOKEN::Match(tok2->next, "do { alloc ; }") )
|
|
{
|
|
erase(tok2, tok2->tokAt(3));
|
|
erase(tok2->next, tok2->tokAt(3));
|
|
done = false;
|
|
}
|
|
|
|
// Reduce "loop { if break ; } => ";"
|
|
if ( TOKEN::Match( tok2, "loop {" ) &&
|
|
strncmp(tok2->strAt(2), "if", 2) == 0 &&
|
|
(TOKEN::Match( tok2->tokAt(3), "break ; }") || TOKEN::Match( tok2->tokAt(3), "continue ; }")))
|
|
{
|
|
tok2->setstr(";");
|
|
erase( tok2, tok2->tokAt(6) );
|
|
done = false;
|
|
}
|
|
|
|
// Reduce "if(true) X ;" => "X ;"
|
|
if (TOKEN::Match(tok2->next, "if(true) %var% ;") && !TOKEN::Match(tok2->tokAt(4),"else"))
|
|
{
|
|
erase( tok2, tok2->tokAt(2) );
|
|
done = false;
|
|
}
|
|
|
|
// Replace "loop { X ; break ; }" with "X ;"
|
|
if ( TOKEN::Match(tok2->next, "loop { %var% ; break ; }") )
|
|
{
|
|
erase(tok2, tok2->tokAt(3));
|
|
erase(tok2->next->next, tok2->tokAt(6));
|
|
done = false;
|
|
}
|
|
|
|
// Replace "loop ;" with ";"
|
|
if ( TOKEN::Match(tok2->next, "loop ;") )
|
|
{
|
|
erase(tok2, tok2->tokAt(2));
|
|
done = false;
|
|
}
|
|
|
|
// Replace "loop !var ;" with ";"
|
|
if ( TOKEN::Match(tok2->next, "loop !var ;") )
|
|
{
|
|
erase(tok2, tok2->tokAt(4));
|
|
done = false;
|
|
}
|
|
|
|
// Replace "loop !var alloc ;" with " alloc ;"
|
|
if ( TOKEN::Match(tok2->next, "loop !var alloc ;") )
|
|
{
|
|
erase(tok2, tok2->tokAt(3));
|
|
done = false;
|
|
}
|
|
|
|
// Delete if block in "alloc ; if(!var) return ;"
|
|
if ( TOKEN::Match(tok2, "alloc ; if(!var) return ;") )
|
|
{
|
|
erase(tok2, tok2->tokAt(4));
|
|
done = false;
|
|
}
|
|
|
|
// Reduce "if(var) return use ;" => "return use ;"
|
|
if ( TOKEN::Match(tok2->next, "if(var) return use ;") && !TOKEN::Match(tok2->tokAt(5),"else"))
|
|
{
|
|
erase( tok2, tok2->tokAt(2) );
|
|
done = false;
|
|
}
|
|
|
|
// Reduce "if(var) use ;" => "use ;"
|
|
if ( TOKEN::Match(tok2->next, "if(var) use ;") && !TOKEN::Match(tok2->tokAt(4),"else"))
|
|
{
|
|
erase( tok2, tok2->tokAt(2) );
|
|
done = false;
|
|
}
|
|
|
|
// Delete second use in "use ; use ;"
|
|
while (TOKEN::Match(tok2, "[;{}] use ; use ;"))
|
|
{
|
|
erase(tok2, tok2->tokAt(3));
|
|
done = false;
|
|
}
|
|
|
|
// Delete second case in "case ; case ;"
|
|
while (TOKEN::Match(tok2, "case ; case ;"))
|
|
{
|
|
erase(tok2, tok2->tokAt(3));
|
|
done = false;
|
|
}
|
|
|
|
// Replace switch with if (if not complicated)
|
|
if (TOKEN::Match(tok2, "switch {"))
|
|
{
|
|
// Right now, I just handle if there are a few case and perhaps a default.
|
|
bool valid = false;
|
|
bool incase = false;
|
|
for ( const TOKEN * _tok = tok2->tokAt(2); _tok; _tok = _tok->next )
|
|
{
|
|
if ( _tok->aaaa0() == '{' )
|
|
break;
|
|
|
|
else if ( _tok->aaaa0() == '}' )
|
|
{
|
|
valid = true;
|
|
break;
|
|
}
|
|
|
|
else if (strncmp(_tok->aaaa(),"if",2)==0)
|
|
break;
|
|
|
|
else if (strcmp(_tok->aaaa(),"switch")==0)
|
|
break;
|
|
|
|
else if (strcmp(_tok->aaaa(),"loop")==0)
|
|
break;
|
|
|
|
else if (incase && TOKEN::Match(_tok,"case"))
|
|
break;
|
|
|
|
incase |= TOKEN::Match(_tok,"case");
|
|
incase &= !TOKEN::Match(_tok,"break");
|
|
}
|
|
|
|
if ( !incase && valid )
|
|
{
|
|
done = false;
|
|
tok2->setstr(";");
|
|
erase( tok2, tok2->tokAt(2) );
|
|
tok2 = tok2->next;
|
|
bool first = true;
|
|
while (TOKEN::Match(tok2,"case") || TOKEN::Match(tok2,"default"))
|
|
{
|
|
bool def = TOKEN::Match(tok2, "default");
|
|
tok2->setstr(first ? "if" : "}");
|
|
if ( first )
|
|
{
|
|
first = false;
|
|
instoken( tok2, "{" );
|
|
}
|
|
else
|
|
{
|
|
// Insert "else [if] {
|
|
instoken( tok2, "{" );
|
|
if ( ! def )
|
|
instoken( tok2, "if" );
|
|
instoken( tok2, "else" );
|
|
}
|
|
while ( tok2 && tok2->aaaa0() != '}' && ! TOKEN::Match(tok2,"break ;") )
|
|
tok2 = tok2->next;
|
|
if (TOKEN::Match(tok2,"break ;"))
|
|
{
|
|
tok2->setstr(";");
|
|
tok2 = tok2->next->next;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if ( TOKEN::Match(tok2, "throw") )
|
|
{
|
|
tok2->setstr( "return" );
|
|
done = false;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Simpler but less powerful than "CheckMemoryLeak_CheckScope_All"
|
|
void CheckMemoryLeakClass::CheckMemoryLeak_CheckScope( const TOKEN *Tok1, const char varname[] )
|
|
{
|
|
std::list<const TOKEN *> callstack;
|
|
|
|
AllocType alloctype = No;
|
|
AllocType dealloctype = No;
|
|
|
|
TOKEN *tok = getcode( Tok1, callstack, varname, alloctype, dealloctype );
|
|
|
|
// If the variable is not allocated at all => no memory leak
|
|
if (TOKEN::findmatch(tok, "alloc") == 0)
|
|
{
|
|
Tokenizer::deleteTokens(tok);
|
|
return;
|
|
}
|
|
|
|
// TODO : handle "goto"
|
|
if (TOKEN::findmatch(tok, "goto"))
|
|
{
|
|
Tokenizer::deleteTokens(tok);
|
|
return;
|
|
}
|
|
|
|
simplifycode( tok );
|
|
|
|
if ( TOKEN::findmatch(tok, "loop alloc ;") )
|
|
{
|
|
MemoryLeak(TOKEN::findmatch(tok, "loop alloc ;"), varname);
|
|
}
|
|
|
|
else if ( TOKEN::findmatch(tok, "alloc ; if continue ;") )
|
|
{
|
|
// MemoryLeak(Tokenizer::gettok(TOKEN::findmatch(tok, "alloc ; if continue ;"), 3), varname);
|
|
MemoryLeak((TOKEN::findmatch(tok, "alloc ; if continue ;"))->tokAt(3), varname);
|
|
}
|
|
|
|
else if ( TOKEN::findmatch(tok, "alloc ; if break ;") )
|
|
{
|
|
MemoryLeak((TOKEN::findmatch(tok, "alloc ; if break ;"))->tokAt(3), varname);
|
|
}
|
|
|
|
else if ( TOKEN::findmatch(tok, "alloc ; if return ;") )
|
|
{
|
|
MemoryLeak((TOKEN::findmatch(tok, "alloc ; if return ;"))->tokAt(3), varname);
|
|
}
|
|
|
|
else if ( _settings._showAll && TOKEN::findmatch(tok, "alloc ; ifv continue ;") )
|
|
{
|
|
MemoryLeak((TOKEN::findmatch(tok, "alloc ; ifv continue ;"))->tokAt(3), varname);
|
|
}
|
|
|
|
else if ( _settings._showAll && TOKEN::findmatch(tok, "alloc ; ifv break ;") )
|
|
{
|
|
MemoryLeak((TOKEN::findmatch(tok, "alloc ; ifv break ;"))->tokAt(3), varname);
|
|
}
|
|
|
|
else if ( _settings._showAll && TOKEN::findmatch(tok, "alloc ; ifv return ;") )
|
|
{
|
|
MemoryLeak((TOKEN::findmatch(tok, "alloc ; ifv return ;"))->tokAt(3), varname);
|
|
}
|
|
|
|
else if ( TOKEN::findmatch(tok, "alloc ; return ;") )
|
|
{
|
|
MemoryLeak((TOKEN::findmatch(tok,"alloc ; return ;"))->tokAt(2), varname);
|
|
}
|
|
|
|
else if ( TOKEN::findmatch(tok, "alloc ; alloc") )
|
|
{
|
|
MemoryLeak((TOKEN::findmatch(tok,"alloc ; alloc"))->tokAt(2), varname);
|
|
}
|
|
|
|
else if ( ! TOKEN::findmatch(tok,"dealloc") &&
|
|
! TOKEN::findmatch(tok,"use") &&
|
|
! TOKEN::findmatch(tok,"return use ;") )
|
|
{
|
|
const TOKEN *last = tok;
|
|
while (last->next)
|
|
last = last->next;
|
|
MemoryLeak(last, varname);
|
|
}
|
|
|
|
else if ( _settings._debug )
|
|
{
|
|
TOKEN *first = tok;
|
|
while ( first && first->str() == ";" )
|
|
first = first->next;
|
|
|
|
bool noerr = false;
|
|
noerr |= TOKEN::Match( first, "alloc ; dealloc ;" );
|
|
noerr |= TOKEN::Match( first, "alloc ; return use ;" );
|
|
noerr |= TOKEN::Match( first, "alloc ; use ;" );
|
|
noerr |= TOKEN::Match( first, "if alloc ; dealloc ;" );
|
|
noerr |= TOKEN::Match( first, "if alloc ; return use ;" );
|
|
noerr |= TOKEN::Match( first, "if alloc ; use ;" );
|
|
|
|
// Unhandled case..
|
|
if ( ! noerr )
|
|
{
|
|
std::cout << "Token listing..\n ";
|
|
for ( const TOKEN *tok2 = tok; tok2; tok2 = tok2->next )
|
|
std::cout << " " << tok2->str();
|
|
std::cout << "\n";
|
|
}
|
|
}
|
|
|
|
|
|
Tokenizer::deleteTokens(tok);
|
|
}
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
// Checks for memory leaks inside function..
|
|
//---------------------------------------------------------------------------
|
|
|
|
void CheckMemoryLeakClass::CheckMemoryLeak_InFunction()
|
|
{
|
|
bool infunc = false;
|
|
int indentlevel = 0;
|
|
for (const TOKEN *tok = _tokenizer->tokens(); tok; tok = tok->next)
|
|
{
|
|
if (tok->aaaa0()=='{')
|
|
indentlevel++;
|
|
|
|
else if (tok->aaaa0()=='}')
|
|
indentlevel--;
|
|
|
|
|
|
// In function..
|
|
if ( indentlevel == 0 )
|
|
{
|
|
if ( TOKEN::Match(tok, ") {") )
|
|
infunc = true;
|
|
|
|
if ( TOKEN::Match(tok, "[;}]") )
|
|
infunc = false;
|
|
}
|
|
|
|
// Declare a local variable => Check
|
|
if (indentlevel>0 && infunc)
|
|
{
|
|
if ( TOKEN::Match(tok, "[{};] %type% * %var% [;=]") )
|
|
CheckMemoryLeak_CheckScope( tok->next, tok->strAt(3) );
|
|
|
|
else if ( TOKEN::Match(tok, "[{};] %type% %type% * %var% [;=]") )
|
|
CheckMemoryLeak_CheckScope( tok->next, tok->strAt(4) );
|
|
}
|
|
}
|
|
}
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
// Checks for memory leaks in classes..
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
void CheckMemoryLeakClass::CheckMemoryLeak_ClassMembers()
|
|
{
|
|
int indentlevel = 0;
|
|
for ( const TOKEN *tok = _tokenizer->tokens(); tok; tok = tok->next )
|
|
{
|
|
if ( tok->aaaa0() == '{' )
|
|
indentlevel++;
|
|
|
|
else if ( tok->aaaa0() == '}' )
|
|
indentlevel--;
|
|
|
|
else if ( indentlevel == 0 && TOKEN::Match(tok, "class %var% [{:]") )
|
|
{
|
|
std::vector<const char *> classname;
|
|
classname.push_back( tok->strAt(1) );
|
|
CheckMemoryLeak_ClassMembers_ParseClass( tok, classname );
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
void CheckMemoryLeakClass::CheckMemoryLeak_ClassMembers_ParseClass( const TOKEN *tok1, std::vector<const char *> &classname )
|
|
{
|
|
// Go into class.
|
|
while ( tok1 && tok1->aaaa0() != '{' )
|
|
tok1 = tok1->next;
|
|
if ( tok1 )
|
|
tok1 = tok1->next;
|
|
|
|
int indentlevel = 0;
|
|
for ( const TOKEN *tok = tok1; tok; tok = tok->next )
|
|
{
|
|
if ( tok->aaaa0() == '{' )
|
|
indentlevel++;
|
|
|
|
else if ( tok->aaaa0() == '}' )
|
|
{
|
|
indentlevel--;
|
|
if ( indentlevel < 0 )
|
|
return;
|
|
}
|
|
|
|
// Only parse this particular class.. not subclasses
|
|
if ( indentlevel > 0 )
|
|
continue;
|
|
|
|
// Declaring subclass.. recursive checking
|
|
if ( TOKEN::Match(tok, "class %var% [{:]") )
|
|
{
|
|
classname.push_back( tok->strAt(1) );
|
|
CheckMemoryLeak_ClassMembers_ParseClass( tok, classname );
|
|
classname.pop_back();
|
|
}
|
|
|
|
// Declaring member variable.. check allocations and deallocations
|
|
if ( TOKEN::Match(tok->next, "%type% * %var% ;") )
|
|
{
|
|
if ( tok->isName() || strchr(";}", tok->aaaa0()) )
|
|
{
|
|
if (_settings._showAll || !isclass(tok->tokAt(1)))
|
|
CheckMemoryLeak_ClassMembers_Variable( classname, tok->strAt(3) );
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void CheckMemoryLeakClass::CheckMemoryLeak_ClassMembers_Variable( const std::vector<const char *> &classname, const char varname[] )
|
|
{
|
|
// Function pattern.. Check if member function
|
|
std::ostringstream fpattern;
|
|
for ( unsigned int i = 0; i < classname.size(); i++ )
|
|
{
|
|
fpattern << classname[i] << " :: ";
|
|
}
|
|
fpattern << "%var% (";
|
|
|
|
// Destructor pattern.. Check if class destructor..
|
|
std::ostringstream destructor;
|
|
for ( unsigned int i = 0; i < classname.size(); i++ )
|
|
{
|
|
destructor << classname[i] << " :: ";
|
|
}
|
|
destructor << " ~" << classname.back() << " (";
|
|
|
|
// Pattern used in member function. "Var = ..."
|
|
std::ostringstream varname_eq;
|
|
varname_eq << varname << " =";
|
|
|
|
// Full variable name..
|
|
std::ostringstream FullVariableName;
|
|
for ( unsigned int i = 0; i < classname.size(); i++ )
|
|
FullVariableName << classname[i] << "::";
|
|
FullVariableName << varname;
|
|
|
|
// Check if member variable has been allocated and deallocated..
|
|
AllocType Alloc = No;
|
|
AllocType Dealloc = No;
|
|
|
|
// Loop through all tokens. Inspect member functions
|
|
bool memberfunction = false;
|
|
int indentlevel = 0;
|
|
for ( const TOKEN *tok = _tokenizer->tokens(); tok; tok = tok->next )
|
|
{
|
|
if ( tok->aaaa0() == '{' )
|
|
indentlevel++;
|
|
|
|
else if ( tok->aaaa0() == '}' )
|
|
indentlevel--;
|
|
|
|
// Set the 'memberfunction' variable..
|
|
if ( indentlevel == 0 )
|
|
{
|
|
if ( strchr(";}", tok->aaaa0()) )
|
|
memberfunction = false;
|
|
else if ( TOKEN::Match( tok, fpattern.str().c_str() ) || TOKEN::Match( tok, destructor.str().c_str() ) )
|
|
memberfunction = true;
|
|
}
|
|
|
|
// Parse member function..
|
|
if ( indentlevel > 0 && memberfunction )
|
|
{
|
|
// Allocate..
|
|
if ( TOKEN::Match( tok, varname_eq.str().c_str() ) )
|
|
{
|
|
AllocType alloc = GetAllocationType( tok->tokAt(2) );
|
|
if ( alloc != No )
|
|
{
|
|
std::list<const TOKEN *> callstack;
|
|
if ( Dealloc != No && Dealloc != alloc )
|
|
MismatchError( tok, callstack, FullVariableName.str().c_str() );
|
|
if ( Alloc != No && Alloc != alloc )
|
|
MismatchError( tok, callstack, FullVariableName.str().c_str() );
|
|
Alloc = alloc;
|
|
}
|
|
}
|
|
|
|
// Deallocate..
|
|
const char *varnames[2] = { "var", 0 };
|
|
varnames[0] = varname;
|
|
AllocType dealloc = GetDeallocationType( tok, varnames );
|
|
if ( dealloc != No )
|
|
{
|
|
std::list<const TOKEN *> callstack;
|
|
if ( Dealloc != No && Dealloc != dealloc )
|
|
MismatchError( tok, callstack, FullVariableName.str().c_str() );
|
|
if ( Alloc != No && Alloc != dealloc )
|
|
MismatchError( tok, callstack, FullVariableName.str().c_str() );
|
|
Dealloc = dealloc;
|
|
}
|
|
}
|
|
}
|
|
|
|
if ( Alloc != No && Dealloc == No )
|
|
{
|
|
MemoryLeak( _tokenizer->tokens(), FullVariableName.str().c_str() );
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
// Checks for memory leaks..
|
|
//---------------------------------------------------------------------------
|
|
|
|
void CheckMemoryLeakClass::CheckMemoryLeak()
|
|
{
|
|
_listAllocFunc.clear();
|
|
|
|
// Check for memory leaks inside functions..
|
|
CheckMemoryLeak_InFunction();
|
|
|
|
// Check that all class members are deallocated..
|
|
if ( _settings._showAll )
|
|
CheckMemoryLeak_ClassMembers();
|
|
}
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
|