2008-12-18 22:28:57 +01:00
/*
2009-01-21 21:04:20 +01:00
* Cppcheck - A tool for static C / C + + code analysis
2014-02-15 07:45:39 +01:00
* Copyright ( C ) 2007 - 2014 Daniel Marjamäki and Cppcheck team .
2008-12-18 22:28:57 +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
2009-09-27 17:08:31 +02:00
* along with this program . If not , see < http : //www.gnu.org/licenses/>.
2008-12-18 22:28:57 +01:00
*/
# include "testsuite.h"
2009-10-25 12:49:06 +01:00
# include "tokenize.h"
# include "token.h"
2010-07-26 22:05:17 +02:00
# include "settings.h"
2008-12-18 22:28:57 +01:00
# include <sstream>
extern std : : ostringstream errout ;
2009-02-17 20:18:26 +01:00
2011-10-13 20:53:06 +02:00
class TestSimplifyTokens : public TestFixture {
2008-12-18 22:28:57 +01:00
public :
2014-11-20 14:20:09 +01:00
TestSimplifyTokens ( ) : TestFixture ( " TestSimplifyTokens " ) {
2013-08-07 16:27:37 +02:00
}
2008-12-18 22:28:57 +01:00
private :
2014-09-24 13:26:52 +02:00
Settings settings_std ;
2014-10-19 07:34:40 +02:00
Settings settings_windows ;
2008-12-18 22:28:57 +01:00
2014-11-20 14:20:09 +01:00
void run ( ) {
2014-09-24 13:26:52 +02:00
LOAD_LIB_2 ( settings_std . library , " std.cfg " ) ;
2014-10-19 07:34:40 +02:00
LOAD_LIB_2 ( settings_windows . library , " windows.cfg " ) ;
2014-09-24 13:26:52 +02:00
2010-05-30 13:15:15 +02:00
// Make sure the Tokenizer::simplifyTokenList works.
// The order of the simplifications is important. So this test
// case shall make sure the simplifications are done in the
// correct order
TEST_CASE ( simplifyTokenList1 ) ;
2009-08-28 12:57:29 +02:00
TEST_CASE ( cast ) ;
2009-01-05 16:49:57 +01:00
TEST_CASE ( iftruefalse ) ;
2009-02-08 09:52:03 +01:00
TEST_CASE ( combine_strings ) ;
2009-02-14 19:44:50 +01:00
TEST_CASE ( double_plus ) ;
2009-02-14 21:56:08 +01:00
TEST_CASE ( redundant_plus ) ;
2012-01-04 13:45:27 +01:00
TEST_CASE ( redundant_plus_numbers ) ;
2011-03-30 16:45:31 +02:00
TEST_CASE ( parentheses1 ) ;
TEST_CASE ( parenthesesVar ) ; // Remove redundant parentheses around variable .. "( %var% )"
2009-02-28 21:40:37 +01:00
TEST_CASE ( declareVar ) ;
2009-02-17 20:18:26 +01:00
2009-06-10 19:36:00 +02:00
TEST_CASE ( declareArray ) ;
2009-05-25 14:21:58 +02:00
TEST_CASE ( dontRemoveIncrement ) ;
2009-05-25 08:26:11 +02:00
TEST_CASE ( removePostIncrement ) ;
2009-05-25 08:31:20 +02:00
TEST_CASE ( removePreIncrement ) ;
2009-05-25 08:26:11 +02:00
2009-02-17 20:18:26 +01:00
TEST_CASE ( elseif1 ) ;
2010-01-22 20:20:43 +01:00
TEST_CASE ( ifa_ifa ) ; // "if (a) { if (a) .." => "if (a) { if (1) .."
2009-02-28 10:09:55 +01:00
2014-09-16 17:21:17 +02:00
TEST_CASE ( sizeof_array ) ;
2009-02-28 10:09:55 +01:00
TEST_CASE ( sizeof5 ) ;
TEST_CASE ( sizeof6 ) ;
2009-03-29 16:36:34 +02:00
TEST_CASE ( sizeof7 ) ;
2009-05-31 21:33:44 +02:00
TEST_CASE ( sizeof8 ) ;
2009-09-06 13:28:25 +02:00
TEST_CASE ( sizeof9 ) ;
2009-10-10 14:26:03 +02:00
TEST_CASE ( sizeof10 ) ;
2009-10-18 18:06:32 +02:00
TEST_CASE ( sizeof11 ) ;
2009-10-21 21:08:00 +02:00
TEST_CASE ( sizeof12 ) ;
2009-10-22 23:00:27 +02:00
TEST_CASE ( sizeof13 ) ;
2009-11-13 20:07:44 +01:00
TEST_CASE ( sizeof14 ) ;
2009-11-29 12:14:42 +01:00
TEST_CASE ( sizeof15 ) ;
2009-11-29 17:25:35 +01:00
TEST_CASE ( sizeof16 ) ;
2009-12-06 08:46:59 +01:00
TEST_CASE ( sizeof17 ) ;
2010-03-28 15:56:13 +02:00
TEST_CASE ( sizeof18 ) ;
2010-07-22 22:21:12 +02:00
TEST_CASE ( sizeof19 ) ; // #1891 - sizeof 'x'
2010-09-06 21:34:51 +02:00
TEST_CASE ( sizeof20 ) ; // #2024 - sizeof a)
2010-11-29 17:46:10 +01:00
TEST_CASE ( sizeof21 ) ; // #2232 - sizeof...(Args)
2011-02-21 23:49:30 +01:00
TEST_CASE ( sizeof22 ) ; // #2599
2011-02-23 20:44:14 +01:00
TEST_CASE ( sizeof23 ) ; // #2604
2010-05-14 18:40:15 +02:00
TEST_CASE ( sizeofsizeof ) ;
2009-03-05 20:32:02 +01:00
TEST_CASE ( casting ) ;
2009-03-11 19:14:45 +01:00
2009-11-07 08:25:39 +01:00
TEST_CASE ( strlen1 ) ;
2013-06-25 20:10:40 +02:00
TEST_CASE ( strlen2 ) ;
2009-11-07 08:25:39 +01:00
2009-03-13 00:07:05 +01:00
TEST_CASE ( namespaces ) ;
2009-03-23 18:20:56 +01:00
// Assignment in condition..
TEST_CASE ( ifassign1 ) ;
2010-04-13 21:57:52 +02:00
TEST_CASE ( ifAssignWithCast ) ;
2010-07-28 21:03:15 +02:00
TEST_CASE ( whileAssign1 ) ;
TEST_CASE ( whileAssign2 ) ;
2012-10-06 12:49:24 +02:00
TEST_CASE ( whileAssign3 ) ; // varid
2014-08-23 12:28:54 +02:00
TEST_CASE ( whileAssign4 ) ; // links
2013-07-28 11:58:14 +02:00
TEST_CASE ( doWhileAssign ) ; // varid
2013-07-29 12:10:11 +02:00
TEST_CASE ( test_4881 ) ; // similar to doWhileAssign (#4911), taken from #4881 with full code
2009-03-24 18:23:21 +01:00
// "if(0==x)" => "if(!x)"
TEST_CASE ( ifnot ) ;
2009-04-05 21:21:38 +02:00
TEST_CASE ( combine_wstrings ) ;
2009-05-31 10:42:27 +02:00
// Simplify "not" to "!" (#345)
TEST_CASE ( not1 ) ;
2009-08-29 14:26:01 +02:00
// Simplify "and" to "&&" (#620)
TEST_CASE ( and1 ) ;
2010-05-13 13:59:41 +02:00
// Simplify "or" to "||"
TEST_CASE ( or1 ) ;
2014-03-16 18:51:05 +01:00
TEST_CASE ( cAlternativeTokens ) ;
2009-06-10 23:12:26 +02:00
TEST_CASE ( comma_keyword ) ;
2009-07-04 17:06:25 +02:00
TEST_CASE ( remove_comma ) ;
2009-07-14 12:06:38 +02:00
// Simplify "?:"
2012-09-30 18:49:25 +02:00
TEST_CASE ( simplifyConditionOperator ) ;
2009-08-02 10:45:33 +02:00
// Simplify calculations
TEST_CASE ( calculations ) ;
2013-06-14 18:51:52 +02:00
TEST_CASE ( comparisons ) ;
2009-08-24 23:10:12 +02:00
2011-11-08 14:07:22 +01:00
//remove dead code after flow control statements
2014-03-23 10:59:41 +01:00
TEST_CASE ( simplifyFlowControl ) ;
2011-11-08 14:07:22 +01:00
TEST_CASE ( flowControl ) ;
2011-10-15 01:34:07 +02:00
2009-09-05 18:46:27 +02:00
// Simplify nested strcat() calls
TEST_CASE ( strcat1 ) ;
2009-11-27 22:21:13 +01:00
TEST_CASE ( strcat2 ) ;
2009-09-05 21:21:25 +02:00
2009-09-12 22:54:47 +02:00
TEST_CASE ( simplifyAtol )
2012-01-23 16:10:15 +01:00
2011-10-23 10:25:14 +02:00
TEST_CASE ( simplifyOperator1 ) ;
2009-10-04 22:33:41 +02:00
TEST_CASE ( reverseArraySyntax )
2009-11-27 17:32:53 +01:00
TEST_CASE ( simplify_numeric_condition )
2011-01-04 21:35:35 +01:00
TEST_CASE ( simplify_condition ) ;
2009-10-17 18:21:13 +02:00
2010-01-31 16:29:12 +01:00
TEST_CASE ( pointeralias1 ) ;
TEST_CASE ( pointeralias2 ) ;
2010-02-06 16:51:32 +01:00
TEST_CASE ( pointeralias3 ) ;
2010-04-25 15:12:06 +02:00
TEST_CASE ( pointeralias4 ) ;
2010-05-16 19:38:44 +02:00
TEST_CASE ( pointeralias5 ) ;
2009-11-05 21:30:05 +01:00
TEST_CASE ( reduceConstness ) ;
2009-12-28 08:37:34 +01:00
// simplify "while (0)"
TEST_CASE ( while0 ) ;
2011-10-10 15:13:47 +02:00
// ticket #3140
TEST_CASE ( while0for ) ;
2010-01-01 22:25:37 +01:00
TEST_CASE ( while1 ) ;
2010-01-04 17:22:06 +01:00
TEST_CASE ( enum1 ) ;
TEST_CASE ( enum2 ) ;
2010-01-25 07:45:16 +01:00
TEST_CASE ( enum3 ) ;
2010-01-29 15:57:26 +01:00
TEST_CASE ( enum4 ) ;
2010-02-03 21:23:44 +01:00
TEST_CASE ( enum5 ) ;
2010-02-06 09:49:56 +01:00
TEST_CASE ( enum6 ) ;
2010-02-16 07:33:23 +01:00
TEST_CASE ( enum7 ) ;
TEST_CASE ( enum8 ) ;
2010-02-17 22:42:08 +01:00
TEST_CASE ( enum9 ) ; // ticket 1404
2010-02-25 07:24:32 +01:00
TEST_CASE ( enum10 ) ; // ticket 1445
2010-02-26 21:40:57 +01:00
TEST_CASE ( enum11 ) ;
2010-03-06 13:48:43 +01:00
TEST_CASE ( enum12 ) ;
2010-03-07 12:50:45 +01:00
TEST_CASE ( enum13 ) ;
2010-03-07 13:01:56 +01:00
TEST_CASE ( enum14 ) ;
2010-08-21 07:44:56 +02:00
TEST_CASE ( enum15 ) ;
2010-08-30 07:25:17 +02:00
TEST_CASE ( enum16 ) ; // ticket #1988
2010-12-30 20:55:23 +01:00
TEST_CASE ( enum17 ) ; // ticket #2381 (duplicate enums)
2011-01-15 08:21:06 +01:00
TEST_CASE ( enum18 ) ; // #2466 (array with same name as enum constant)
2011-02-03 07:58:49 +01:00
TEST_CASE ( enum19 ) ; // ticket #2536
2011-02-22 01:30:40 +01:00
TEST_CASE ( enum20 ) ; // ticket #2600
2011-04-15 01:50:17 +02:00
TEST_CASE ( enum21 ) ; // ticket #2720
2011-04-24 04:08:03 +02:00
TEST_CASE ( enum22 ) ; // ticket #2745
2011-05-27 17:17:39 +02:00
TEST_CASE ( enum23 ) ; // ticket #2804
2011-06-09 02:14:52 +02:00
TEST_CASE ( enum24 ) ; // ticket #2828
2011-08-06 00:07:18 +02:00
TEST_CASE ( enum25 ) ; // ticket #2966
2011-08-07 22:48:47 +02:00
TEST_CASE ( enum26 ) ; // ticket #2975 (segmentation fault)
2011-08-15 13:07:12 +02:00
TEST_CASE ( enum27 ) ; // ticket #3005 (segmentation fault)
2011-10-22 13:43:53 +02:00
TEST_CASE ( enum28 ) ;
2012-05-16 18:48:33 +02:00
TEST_CASE ( enum29 ) ; // ticket #3747 (bitwise or value)
2012-05-29 13:20:51 +02:00
TEST_CASE ( enum30 ) ; // ticket #3852 (false positive)
2012-09-08 12:42:24 +02:00
TEST_CASE ( enum31 ) ; // ticket #3934 (calculation in first item)
TEST_CASE ( enum32 ) ; // ticket #3998 (access violation)
TEST_CASE ( enum33 ) ; // ticket #4015 (segmentation fault)
2012-09-09 12:38:15 +02:00
TEST_CASE ( enum34 ) ; // ticket #4141 (division by zero)
2012-09-21 16:17:20 +02:00
TEST_CASE ( enum35 ) ; // ticket #3953 (avoid simplification of type)
2012-12-02 07:22:55 +01:00
TEST_CASE ( enum36 ) ; // ticket #4378
2013-06-03 19:18:51 +02:00
TEST_CASE ( enum37 ) ; // ticket #4280 (shadow variable)
2013-06-12 06:45:26 +02:00
TEST_CASE ( enum38 ) ; // ticket #4463 (when throwing enum id, don't warn about shadow variable)
2013-11-03 09:34:48 +01:00
TEST_CASE ( enum39 ) ; // ticket #5145 (fp variable hides enum)
2013-11-20 18:04:28 +01:00
TEST_CASE ( enum40 ) ;
2013-12-15 07:47:04 +01:00
TEST_CASE ( enum41 ) ; // ticket #5212 (valgrind errors during enum simplification)
2013-12-16 07:07:00 +01:00
TEST_CASE ( enum42 ) ; // ticket #5182 (template function call in enum value)
2014-04-23 17:10:17 +02:00
TEST_CASE ( enum43 ) ; // lhs in assignment
2012-09-08 12:42:24 +02:00
TEST_CASE ( enumscope1 ) ; // ticket #3949
2012-09-19 19:19:13 +02:00
TEST_CASE ( duplicateDefinition ) ; // ticket #3565
2014-03-22 19:30:06 +01:00
TEST_CASE ( invalid_enum ) ; // #5600
2010-01-12 21:25:31 +01:00
// remove "std::" on some standard functions
TEST_CASE ( removestd ) ;
2010-01-30 09:33:16 +01:00
// Tokenizer::simplifyInitVar
TEST_CASE ( simplifyInitVar ) ;
2010-01-31 16:29:12 +01:00
// Tokenizer::simplifyReference
TEST_CASE ( simplifyReference ) ;
2010-02-27 19:41:14 +01:00
// x = realloc(y,0); => free(y);x=0;
TEST_CASE ( simplifyRealloc ) ;
2010-03-06 15:28:52 +01:00
2010-05-30 12:49:39 +02:00
// while(f() && errno==EINTR) { } => while (f()) { }
TEST_CASE ( simplifyErrNoInWhile ) ;
2010-03-06 15:28:52 +01:00
// while(fclose(f)); => r = fclose(f); while(r){r=fclose(f);}
TEST_CASE ( simplifyFuncInWhile ) ;
2010-03-13 11:52:48 +01:00
// struct ABC abc = { .a = 3 }; => struct ABC abc; abc.a = 3;
TEST_CASE ( initstruct ) ;
2010-03-18 18:14:52 +01:00
// struct ABC { } abc; => struct ABC { }; ABC abc;
2011-02-13 20:11:22 +01:00
TEST_CASE ( simplifyStructDecl1 ) ;
TEST_CASE ( simplifyStructDecl2 ) ; // ticket #2579
2011-07-02 15:21:30 +02:00
TEST_CASE ( simplifyStructDecl3 ) ;
2011-07-03 14:14:51 +02:00
TEST_CASE ( simplifyStructDecl4 ) ;
2012-01-31 18:23:02 +01:00
TEST_CASE ( simplifyStructDecl5 ) ; // ticket #3533 (segmentation fault)
2012-09-08 10:51:31 +02:00
TEST_CASE ( simplifyStructDecl6 ) ; // ticket #3732
2013-01-10 18:24:01 +01:00
TEST_CASE ( simplifyStructDecl7 ) ; // ticket #476 (static anonymous struct array)
2010-04-10 09:58:09 +02:00
// register int var; => int var;
// inline int foo() {} => int foo() {}
TEST_CASE ( removeUnwantedKeywords ) ;
2010-04-21 21:08:47 +02:00
// remove calling convention __cdecl, __stdcall, ...
TEST_CASE ( simplifyCallingConvention ) ;
2010-10-02 13:09:07 +02:00
TEST_CASE ( simplifyFunctorCall ) ;
2010-10-26 21:05:20 +02:00
2014-01-12 15:15:09 +01:00
TEST_CASE ( simplifyFunctionPointer ) ; // ticket #5339 (simplify function pointer after comma)
2010-10-26 21:05:20 +02:00
TEST_CASE ( redundant_semicolon ) ;
2010-11-06 06:53:09 +01:00
TEST_CASE ( simplifyFunctionReturn ) ;
2011-02-02 07:40:08 +01:00
2011-10-27 20:54:42 +02:00
// void foo(void) -> void foo()
TEST_CASE ( removeVoidFromFunction ) ;
2011-02-24 12:39:46 +01:00
TEST_CASE ( removeUnnecessaryQualification1 ) ;
TEST_CASE ( removeUnnecessaryQualification2 ) ;
2011-06-14 21:31:52 +02:00
TEST_CASE ( removeUnnecessaryQualification3 ) ;
TEST_CASE ( removeUnnecessaryQualification4 ) ;
TEST_CASE ( removeUnnecessaryQualification5 ) ;
2011-11-08 17:37:24 +01:00
TEST_CASE ( removeUnnecessaryQualification6 ) ; // ticket #2859
TEST_CASE ( removeUnnecessaryQualification7 ) ; // ticket #2970
2011-09-24 01:45:19 +02:00
TEST_CASE ( removeUnnecessaryQualification8 ) ;
2011-11-08 17:37:24 +01:00
TEST_CASE ( removeUnnecessaryQualification9 ) ; // ticket #3151
TEST_CASE ( removeUnnecessaryQualification10 ) ; // ticket #3310 segmentation fault
2011-02-22 13:02:15 +01:00
TEST_CASE ( simplifyIfNotNull ) ;
2011-06-12 14:24:49 +02:00
TEST_CASE ( simplifyVarDecl1 ) ; // ticket # 2682 segmentation fault
TEST_CASE ( simplifyVarDecl2 ) ; // ticket # 2834 segmentation fault
2011-06-26 22:53:16 +02:00
TEST_CASE ( return_strncat ) ; // ticket # 2860 Returning value of strncat() reported as memory leak
2011-09-03 20:45:48 +02:00
// #3069 : for loop with 1 iteration
// for (x=0;x<1;x++) { .. }
// The for is redundant
TEST_CASE ( removeRedundantFor ) ;
2011-11-12 12:01:31 +01:00
TEST_CASE ( consecutiveBraces ) ;
2012-01-26 17:07:10 +01:00
TEST_CASE ( undefinedSizeArray ) ;
2012-09-08 20:59:25 +02:00
TEST_CASE ( simplifyArrayAddress ) ; // Replace "&str[num]" => "(str + num)"
2013-01-13 20:52:38 +01:00
TEST_CASE ( simplifyCharAt ) ;
2013-10-05 07:40:59 +02:00
TEST_CASE ( simplifyOverride ) ; // ticket #5069
2008-12-18 22:28:57 +01:00
}
2014-11-20 14:20:09 +01:00
std : : string tok ( const char code [ ] , bool simplify = true , Settings : : PlatformType type = Settings : : Unspecified ) {
2009-11-29 12:14:42 +01:00
errout . str ( " " ) ;
Settings settings ;
2011-09-03 15:30:30 +02:00
settings . addEnabled ( " portability " ) ;
2011-09-18 16:31:31 +02:00
settings . platform ( type ) ;
2009-11-29 12:14:42 +01:00
Tokenizer tokenizer ( & settings , this ) ;
2008-12-18 22:28:57 +01:00
std : : istringstream istr ( code ) ;
2009-01-05 16:49:57 +01:00
tokenizer . tokenize ( istr , " test.cpp " ) ;
2009-11-29 12:14:42 +01:00
2010-04-02 07:30:58 +02:00
if ( simplify )
2013-12-30 17:45:28 +01:00
tokenizer . simplifyTokenList2 ( ) ;
2009-09-30 13:35:00 +02:00
2012-04-16 19:51:07 +02:00
return tokenizer . tokens ( ) - > stringifyList ( 0 , ! simplify ) ;
2008-12-18 22:28:57 +01:00
}
2014-03-23 10:59:41 +01:00
2014-11-20 14:20:09 +01:00
std : : string tokWithWindows ( const char code [ ] , bool simplify = true , Settings : : PlatformType type = Settings : : Unspecified ) {
2014-10-19 07:34:40 +02:00
errout . str ( " " ) ;
settings_windows . addEnabled ( " portability " ) ;
settings_windows . platform ( type ) ;
Tokenizer tokenizer ( & settings_windows , this ) ;
std : : istringstream istr ( code ) ;
tokenizer . tokenize ( istr , " test.cpp " ) ;
if ( simplify )
tokenizer . simplifyTokenList2 ( ) ;
return tokenizer . tokens ( ) - > stringifyList ( 0 , ! simplify ) ;
}
2014-11-20 14:20:09 +01:00
std : : string tok ( const char code [ ] , const char filename [ ] ) {
2012-06-10 21:52:32 +02:00
errout . str ( " " ) ;
Settings settings ;
Tokenizer tokenizer ( & settings , this ) ;
std : : istringstream istr ( code ) ;
tokenizer . tokenize ( istr , filename ) ;
2013-12-30 17:45:28 +01:00
tokenizer . simplifyTokenList2 ( ) ;
2012-06-10 21:52:32 +02:00
return tokenizer . tokens ( ) - > stringifyList ( 0 , false ) ;
}
2010-05-30 13:15:15 +02:00
2014-11-20 14:20:09 +01:00
std : : string tokWithStdLib ( const char code [ ] ) {
2014-03-23 10:59:41 +01:00
errout . str ( " " ) ;
2014-09-24 13:26:52 +02:00
Tokenizer tokenizer ( & settings_std , this ) ;
2014-03-23 10:59:41 +01:00
std : : istringstream istr ( code ) ;
tokenizer . tokenize ( istr , " test.cpp " ) ;
tokenizer . simplifyTokenList2 ( ) ;
return tokenizer . tokens ( ) - > stringifyList ( 0 , false ) ;
}
2014-11-20 14:20:09 +01:00
std : : string tokenizeDebugListing ( const char code [ ] , bool simplify = false , const char filename [ ] = " test.cpp " ) {
2012-08-17 16:37:25 +02:00
errout . str ( " " ) ;
Settings settings ;
Tokenizer tokenizer ( & settings , this ) ;
std : : istringstream istr ( code ) ;
tokenizer . tokenize ( istr , filename ) ;
if ( simplify )
2013-12-30 17:45:28 +01:00
tokenizer . simplifyTokenList2 ( ) ;
2012-08-17 16:37:25 +02:00
// result..
return tokenizer . tokens ( ) - > stringifyList ( true ) ;
}
2010-05-30 13:15:15 +02:00
2014-11-20 14:20:09 +01:00
void simplifyTokenList1 ( ) {
2013-07-28 11:58:14 +02:00
// #1717 : The simplifyErrNoInWhile needs to be used before simplifyIfAndWhileAssign..
2011-04-09 18:30:47 +02:00
ASSERT_EQUALS ( " ; x = f ( ) ; while ( x == -1 ) { x = f ( ) ; } " ,
2010-05-30 13:15:15 +02:00
tok ( " ;while((x=f())==-1 && errno==EINTR){} " , true ) ) ;
}
2008-12-18 22:28:57 +01:00
2014-11-20 14:20:09 +01:00
void cast ( ) {
2012-01-15 14:50:01 +01:00
ASSERT_EQUALS ( " if ( ! p ) { ; } " , tok ( " if (p == (char *)0); " ) ) ;
2009-08-28 12:57:29 +02:00
ASSERT_EQUALS ( " return str ; " , tok ( " return (char *)str; " ) ) ;
2008-12-18 22:28:57 +01:00
2009-10-04 23:12:12 +02:00
ASSERT_EQUALS ( " if ( * a ) " , tok ( " if ((char)*a) " ) ) ;
ASSERT_EQUALS ( " if ( & a ) " , tok ( " if ((int)&a) " ) ) ;
ASSERT_EQUALS ( " if ( * a ) " , tok ( " if ((unsigned int)(unsigned char)*a) " ) ) ;
2011-01-27 18:44:20 +01:00
ASSERT_EQUALS ( " class A { A operator* ( int ) ; } ; " , tok ( " class A { A operator *(int); }; " ) ) ;
ASSERT_EQUALS ( " class A { A operator* ( int ) const ; } ; " , tok ( " class A { A operator *(int) const; }; " ) ) ;
2012-01-15 14:50:01 +01:00
ASSERT_EQUALS ( " if ( ! p ) { ; } " , tok ( " if (p == (char *)(char *)0); " ) ) ;
2011-07-21 09:32:24 +02:00
// no simplification as the cast may be important here. see #2897 for example
ASSERT_EQUALS ( " ; * ( ( char * ) p + 1 ) = 0 ; " , tok ( " ; *((char *)p + 1) = 0; " ) ) ;
2012-09-18 20:55:37 +02:00
ASSERT_EQUALS ( " if ( true ) " , tok ( " if ((unsigned char)1) " ) ) ; // #4164
ASSERT_EQUALS ( " f ( 200 ) " , tok ( " f((unsigned char)200) " ) ) ;
ASSERT_EQUALS ( " f ( ( char ) 1234 ) " , tok ( " f((char)1234) " ) ) ; // dont simplify downcast
2009-03-09 19:47:21 +01:00
}
2009-08-28 12:57:29 +02:00
2014-11-20 14:20:09 +01:00
void iftruefalse ( ) {
2008-12-21 16:10:44 +01:00
{
2009-07-14 11:37:26 +02:00
const char code1 [ ] = " void f() { int a; bool use = false; if( use ) { a=0; } else {a=1;} } " ;
const char code2 [ ] = " void f() { int a; bool use = false; {a=1;} } " ;
2009-01-05 16:49:57 +01:00
ASSERT_EQUALS ( tok ( code2 ) , tok ( code1 ) ) ;
2008-12-21 16:10:44 +01:00
}
{
2009-07-14 11:37:26 +02:00
const char code1 [ ] = " void f() { int a; bool use = true; if( use ) { a=0; } else {a=1;} } " ;
const char code2 [ ] = " void f() { int a; bool use = true; { a=0; } } " ;
2009-01-05 16:49:57 +01:00
ASSERT_EQUALS ( tok ( code2 ) , tok ( code1 ) ) ;
2008-12-21 16:10:44 +01:00
}
{
2009-07-14 11:37:26 +02:00
const char code1 [ ] = " void f() { int a; int use = 5; if( use ) { a=0; } else {a=1;} } " ;
const char code2 [ ] = " void f() { int a; int use = 5; { a=0; } } " ;
2009-01-05 16:49:57 +01:00
ASSERT_EQUALS ( tok ( code2 ) , tok ( code1 ) ) ;
2008-12-21 16:10:44 +01:00
}
{
2009-07-14 11:37:26 +02:00
const char code1 [ ] = " void f() { int a; int use = 0; if( use ) { a=0; } else {a=1;} } " ;
const char code2 [ ] = " void f() { int a; int use = 0; {a=1;} } " ;
2009-01-05 16:49:57 +01:00
ASSERT_EQUALS ( tok ( code2 ) , tok ( code1 ) ) ;
2008-12-21 16:10:44 +01:00
}
2008-12-21 22:04:58 +01:00
{
2009-07-14 11:37:26 +02:00
const char code1 [ ] = " void f() { int a; bool use = false; if( use ) a=0; else a=1; int c=1; } " ;
const char code2 [ ] = " void f() { int a; bool use = false; { a=1; } int c=1; } " ;
2009-01-05 16:49:57 +01:00
ASSERT_EQUALS ( tok ( code2 ) , tok ( code1 ) ) ;
2008-12-21 22:04:58 +01:00
}
{
2009-07-14 11:37:26 +02:00
const char code1 [ ] = " void f() { int a; bool use = true; if( use ) a=0; else a=1; int c=1; } " ;
const char code2 [ ] = " void f() { int a; bool use = true; { a=0; } int c=1; } " ;
2009-01-05 16:49:57 +01:00
ASSERT_EQUALS ( tok ( code2 ) , tok ( code1 ) ) ;
2008-12-21 22:04:58 +01:00
}
{
2009-07-14 11:37:26 +02:00
const char code1 [ ] = " void f() { int a; bool use = false; if( use ) a=0; else if( bb ) a=1; int c=1; } " ;
const char code2 [ ] = " void f ( ) { int a ; bool use ; use = false ; { if ( bb ) { a = 1 ; } } int c ; c = 1 ; } " ;
2009-01-05 16:49:57 +01:00
ASSERT_EQUALS ( tok ( code2 ) , tok ( code1 ) ) ;
2008-12-21 22:04:58 +01:00
}
{
2009-07-14 11:37:26 +02:00
const char code1 [ ] = " void f() { int a; bool use = true; if( use ) a=0; else if( bb ) a=1; int c=1; } " ;
const char code2 [ ] = " void f() { int a; bool use = true; { a=0;} int c=1; } " ;
2009-01-05 16:49:57 +01:00
ASSERT_EQUALS ( tok ( code2 ) , tok ( code1 ) ) ;
2008-12-21 22:04:58 +01:00
}
{
2010-01-31 09:33:57 +01:00
const char code1 [ ] = " void f() { int a; bool use = true; if( use ) a=0; else if( bb ) a=1; else if( cc ) a=33; else { gg = 0; } int c=1; } " ;
2011-12-02 23:01:55 +01:00
const char code2 [ ] = " void f ( ) { } " ;
2010-01-31 09:33:57 +01:00
ASSERT_EQUALS ( code2 , tok ( code1 ) ) ;
2008-12-26 13:55:53 +01:00
}
2008-12-26 16:42:04 +01:00
2008-12-26 15:43:16 +01:00
{
2009-07-14 11:37:26 +02:00
const char code1 [ ] = " void f() { if( aa ) { a=0; } else if( true ) a=1; else { a=2; } } " ;
const char code2 [ ] = " void f ( ) { if ( aa ) { a = 0 ; } else { { a = 1 ; } } } " ;
2009-01-05 16:49:57 +01:00
ASSERT_EQUALS ( tok ( code2 ) , tok ( code1 ) ) ;
2008-12-26 15:43:16 +01:00
}
2008-12-26 16:46:59 +01:00
{
2009-07-14 11:37:26 +02:00
const char code1 [ ] = " void f() { if( aa ) { a=0; } else if( false ) a=1; else { a=2; } } " ;
const char code2 [ ] = " void f ( ) { if ( aa ) { a = 0 ; } else { { a = 2 ; } } } " ;
2009-01-05 16:49:57 +01:00
ASSERT_EQUALS ( tok ( code2 ) , tok ( code1 ) ) ;
2008-12-26 16:46:59 +01:00
}
2013-01-19 21:13:51 +01:00
{
const char code1 [ ] = " static const int x=1; void f() { if(x) { a=0; } } " ;
ASSERT_EQUALS ( " void f ( ) { a = 0 ; } " , tok ( code1 ) ) ;
}
2008-12-21 16:10:44 +01:00
}
2009-02-08 09:52:03 +01:00
2014-11-20 14:20:09 +01:00
void combine_strings ( ) {
2009-02-08 09:52:03 +01:00
const char code1 [ ] = " void foo() \n "
" { \n "
" const char *a = \n "
" { \n "
" \" hello \" \n "
" \" world \" \n "
" }; \n "
" } \n " ;
const char code2 [ ] = " void foo() \n "
" { \n "
" const char *a = \n "
" { \n "
" \" hello world \" \n "
" }; \n "
2009-04-05 21:21:38 +02:00
" } \n " ;
ASSERT_EQUALS ( tok ( code2 ) , tok ( code1 ) ) ;
}
2014-11-20 14:20:09 +01:00
void combine_wstrings ( ) {
2009-04-05 21:21:38 +02:00
const char code1 [ ] = " void foo() \n "
" { \n "
" const wchar_t *a = \n "
" { \n "
" L \" hello \" \n "
" L \" world \" \n "
" }; \n "
" } \n " ;
const char code2 [ ] = " void foo() \n "
" { \n "
" const wchar_t *a = \n "
" { \n "
" \" hello world \" \n "
" }; \n "
2009-02-08 09:52:03 +01:00
" } \n " ;
2012-09-01 13:12:47 +02:00
Settings settings ;
settings . platform ( Settings : : Unspecified ) ;
Tokenizer tokenizer ( & settings , this ) ;
std : : istringstream istr ( code1 ) ;
tokenizer . tokenize ( istr , " test.cpp " ) ;
ASSERT_EQUALS ( tok ( code2 ) , tokenizer . tokens ( ) - > stringifyList ( 0 , false ) ) ;
ASSERT_EQUALS ( true , tokenizer . tokens ( ) - > tokAt ( 13 ) & & tokenizer . tokens ( ) - > tokAt ( 13 ) - > isLong ( ) ) ;
2009-02-08 09:52:03 +01:00
}
2009-02-12 21:32:59 +01:00
2014-11-20 14:20:09 +01:00
void double_plus ( ) {
2009-02-12 21:32:59 +01:00
{
const char code1 [ ] = " void foo( int a ) \n "
" { \n "
" a++; \n "
" a--; \n "
" ++a; \n "
" --a; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a ) { a ++ ; a -- ; ++ a ; -- a ; } " , tok ( code1 ) ) ;
2009-02-12 21:32:59 +01:00
}
{
const char code1 [ ] = " void foo( int a ) \n "
" { \n "
" a=a+a; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a ) { a = a + a ; } " , tok ( code1 ) ) ;
2009-02-12 21:32:59 +01:00
}
2009-02-12 21:49:05 +01:00
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a+++b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a ++ + b ; } " , tok ( code1 ) ) ;
2009-02-12 21:49:05 +01:00
}
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a---b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a -- - b ; } " , tok ( code1 ) ) ;
2009-02-12 21:49:05 +01:00
}
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a--+b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a -- + b ; } " , tok ( code1 ) ) ;
2009-02-12 21:49:05 +01:00
}
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a++-b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a ++ - b ; } " , tok ( code1 ) ) ;
2009-02-12 21:49:05 +01:00
}
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a+--b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a + -- b ; } " , tok ( code1 ) ) ;
2009-02-12 21:49:05 +01:00
}
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a-++b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a - ++ b ; } " , tok ( code1 ) ) ;
2009-02-12 21:49:05 +01:00
}
2009-02-12 21:32:59 +01:00
}
2009-02-14 21:56:08 +01:00
2014-11-20 14:20:09 +01:00
void redundant_plus ( ) {
2009-02-14 21:56:08 +01:00
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a + + b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a + b ; } " , tok ( code1 ) ) ;
2009-02-14 21:56:08 +01:00
}
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a + + + b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a + b ; } " , tok ( code1 ) ) ;
2009-02-14 21:56:08 +01:00
}
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a + - b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a - b ; } " , tok ( code1 ) ) ;
2009-02-14 21:56:08 +01:00
}
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a - + b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a - b ; } " , tok ( code1 ) ) ;
2009-02-14 21:56:08 +01:00
}
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a - - b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a + b ; } " , tok ( code1 ) ) ;
2009-02-14 21:56:08 +01:00
}
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a - + - b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a + b ; } " , tok ( code1 ) ) ;
2009-02-14 21:56:08 +01:00
}
{
const char code1 [ ] = " void foo( int a, int b ) \n "
" { \n "
" a=a - - - b; \n "
" } \n " ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void foo ( int a , int b ) { a = a - b ; } " , tok ( code1 ) ) ;
2009-02-14 21:56:08 +01:00
}
}
2009-02-15 14:28:54 +01:00
2014-11-20 14:20:09 +01:00
void redundant_plus_numbers ( ) {
2012-01-04 13:45:27 +01:00
{
const char code1 [ ] = " void foo( int a ) \n "
" { \n "
" a=a + + 1; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( int a ) { a = a + 1 ; } " , tok ( code1 ) ) ;
}
{
const char code1 [ ] = " void foo( int a ) \n "
" { \n "
" a=a + + + 1; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( int a ) { a = a + 1 ; } " , tok ( code1 ) ) ;
}
{
const char code1 [ ] = " void foo( int a ) \n "
" { \n "
" a=a + - 1; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( int a ) { a = a - 1 ; } " , tok ( code1 ) ) ;
}
{
const char code1 [ ] = " void foo( int a ) \n "
" { \n "
" a=a - + 1; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( int a ) { a = a - 1 ; } " , tok ( code1 ) ) ;
}
{
const char code1 [ ] = " void foo( int a ) \n "
" { \n "
" a=a - - 1; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( int a ) { a = a + 1 ; } " , tok ( code1 ) ) ;
}
{
const char code1 [ ] = " void foo( int a ) \n "
" { \n "
" a=a - + - 1; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( int a ) { a = a + 1 ; } " , tok ( code1 ) ) ;
}
{
const char code1 [ ] = " void foo( int a ) \n "
" { \n "
" a=a - - - 1; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( int a ) { a = a - 1 ; } " , tok ( code1 ) ) ;
}
}
2009-02-15 14:28:54 +01:00
2014-11-20 14:20:09 +01:00
void parentheses1 ( ) {
2014-06-04 18:10:57 +02:00
ASSERT_EQUALS ( " a <= 110 ; " , tok ( " a <= (10+100); " ) ) ;
2010-05-29 22:20:10 +02:00
ASSERT_EQUALS ( " while ( x ( ) == -1 ) { } " , tok ( " while((x()) == -1){ } " ) ) ;
2009-02-15 14:28:54 +01:00
}
2009-02-17 20:18:26 +01:00
2014-11-20 14:20:09 +01:00
void parenthesesVar ( ) {
2010-12-15 18:45:53 +01:00
// remove parentheses..
2014-06-04 18:10:57 +02:00
ASSERT_EQUALS ( " a = p ; " , tok ( " a = (p); " ) ) ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " if ( a < p ) { } " , tok ( " if(a<(p)){} " ) ) ;
ASSERT_EQUALS ( " void f ( ) { int p ; if ( p == -1 ) { } } " , tok ( " void f(){int p; if((p)==-1){}} " ) ) ;
2014-01-17 17:25:56 +01:00
ASSERT_EQUALS ( " void f ( ) { int p ; if ( -1 == p ) { } } " , tok ( " void f(){int p; if(-1==(p)){}} " ) ) ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " void f ( ) { int p ; if ( p ) { } } " , tok ( " void f(){int p; if((p)){}} " ) ) ;
2009-07-24 21:55:35 +02:00
ASSERT_EQUALS ( " return p ; " , tok ( " return (p); " ) ) ;
2009-10-05 13:10:09 +02:00
ASSERT_EQUALS ( " void f ( ) { int * p ; if ( ! * p ) { } } " , tok ( " void f(){int *p; if (*(p) == 0) {}} " ) ) ;
ASSERT_EQUALS ( " void f ( ) { int * p ; if ( ! * p ) { } } " , tok ( " void f(){int *p; if (*p == 0) {}} " ) ) ;
2010-01-31 09:52:19 +01:00
ASSERT_EQUALS ( " void f ( int & p ) { p = 1 ; } " , tok ( " void f(int &p) {(p) = 1;} " ) ) ;
2009-10-05 13:22:35 +02:00
ASSERT_EQUALS ( " void f ( ) { int p [ 10 ] ; p [ 0 ] = 1 ; } " , tok ( " void f(){int p[10]; (p)[0] = 1;} " ) ) ;
ASSERT_EQUALS ( " void f ( ) { int p ; if ( ! p ) { } } " , tok ( " void f(){int p; if ((p) == 0) {}} " ) ) ;
ASSERT_EQUALS ( " void f ( ) { int * p ; * p = 1 ; } " , tok ( " void f(){int *p; *(p) = 1;} " ) ) ;
2009-10-05 13:30:05 +02:00
ASSERT_EQUALS ( " void f ( ) { int p ; if ( p ) { } p = 1 ; } " , tok ( " void f(){int p; if ( p ) { } (p) = 1;} " ) ) ;
2009-02-27 07:07:38 +01:00
2010-12-15 18:45:53 +01:00
// keep parentheses..
2014-06-04 18:10:57 +02:00
ASSERT_EQUALS ( " b = a ; " , tok ( " b = (char)a; " ) ) ;
2009-07-14 11:37:26 +02:00
ASSERT_EQUALS ( " cast < char * > ( p ) " , tok ( " cast<char *>(p) " ) ) ;
2009-07-24 21:55:35 +02:00
ASSERT_EQUALS ( " return ( a + b ) * c ; " , tok ( " return (a+b)*c; " ) ) ;
2009-10-05 13:10:09 +02:00
ASSERT_EQUALS ( " void f ( ) { int p ; if ( 2 * p == 0 ) { } } " , tok ( " void f(){int p; if (2*p == 0) {}} " ) ) ;
ASSERT_EQUALS ( " void f ( ) { DIR * f ; f = opendir ( dirname ) ; if ( closedir ( f ) ) { } } " , tok ( " void f(){DIR * f = opendir(dirname);if (closedir(f)){}} " ) ) ;
2014-01-17 17:25:56 +01:00
ASSERT_EQUALS ( " void foo ( int p ) { if ( p >= 0 ) { ; } } " , tok ( " void foo(int p){if((p)>=0);} " ) ) ;
2009-02-25 20:55:24 +01:00
}
2014-11-20 14:20:09 +01:00
void declareVar ( ) {
2009-07-14 11:37:26 +02:00
const char code [ ] = " void f ( ) { char str [ 100 ] = \" 100 \" ; } " ;
2009-02-28 21:40:37 +01:00
ASSERT_EQUALS ( code , tok ( code ) ) ;
}
2009-02-17 20:18:26 +01:00
2014-11-20 14:20:09 +01:00
void declareArray ( ) {
2012-12-25 08:56:12 +01:00
const char code1 [ ] = " void f ( ) { char str [ ] = \" 100 \" ; } " ;
const char expected1 [ ] = " void f ( ) { char str [ 4 ] = \" 100 \" ; } " ;
ASSERT_EQUALS ( expected1 , tok ( code1 ) ) ;
const char code2 [ ] = " char str [ ] = \" \\ x00 \" ; " ;
const char expected2 [ ] = " char str [ 2 ] = \" \\ 0 \" ; " ;
2012-12-26 12:08:40 +01:00
ASSERT_EQUALS ( expected2 , tok ( code2 ) ) ;
const char code3 [ ] = " char str [ ] = \" \\ 0 \" ; " ;
const char expected3 [ ] = " char str [ 2 ] = \" \\ 0 \" ; " ;
ASSERT_EQUALS ( expected3 , tok ( code3 ) ) ;
2009-06-10 19:36:00 +02:00
}
2009-05-25 08:26:11 +02:00
2014-11-20 14:20:09 +01:00
void dontRemoveIncrement ( ) {
2009-05-25 14:21:58 +02:00
{
const char code [ ] = " void f(int a) \n "
" { \n "
" if (a > 10) \n "
" a = 5; \n "
" else \n "
" a = 10; \n "
" a++; \n "
" } \n " ;
2014-01-17 17:25:56 +01:00
ASSERT_EQUALS ( " void f ( int a ) { if ( a > 10 ) { a = 5 ; } else { a = 10 ; } a ++ ; } " , tok ( code ) ) ;
2009-05-25 14:21:58 +02:00
}
{
const char code [ ] = " void f(int a) \n "
" { \n "
" if (a > 10) \n "
" a = 5; \n "
" else \n "
" a = 10; \n "
" ++a; \n "
" } \n " ;
2014-01-17 17:25:56 +01:00
ASSERT_EQUALS ( " void f ( int a ) { if ( a > 10 ) { a = 5 ; } else { a = 10 ; } ++ a ; } " , tok ( code ) ) ;
2009-05-25 14:21:58 +02:00
}
}
2014-11-20 14:20:09 +01:00
void removePostIncrement ( ) {
2010-01-31 09:52:19 +01:00
const char code [ ] = " void f(int &c) \n "
2009-05-25 08:26:11 +02:00
" { \n "
2010-01-31 09:52:19 +01:00
" c = 0; \n "
2009-05-25 08:26:11 +02:00
" c++; \n "
" if (c>0) { c++; } \n "
" c++; \n "
" } \n " ;
2011-01-30 12:54:19 +01:00
TODO_ASSERT_EQUALS ( " void f ( int & c ) { c = 3 ; { ; } ; } " ,
" void f ( int & c ) { c = 1 ; { c ++ ; } c ++ ; } " , tok ( code ) ) ;
2009-05-25 08:26:11 +02:00
}
2014-11-20 14:20:09 +01:00
void removePreIncrement ( ) {
2009-12-07 22:42:30 +01:00
{
2010-01-31 09:52:19 +01:00
const char code [ ] = " void f(int &c) \n "
2009-12-07 22:42:30 +01:00
" { \n "
2010-01-31 09:52:19 +01:00
" c = 0; \n "
2009-12-07 22:42:30 +01:00
" ++c; \n "
" if (c>0) { ++c; } \n "
" ++c; \n "
" } \n " ;
2011-01-30 12:54:19 +01:00
TODO_ASSERT_EQUALS ( " void f ( int & c ) { c = 3 ; { ; } ; } " ,
" void f ( int & c ) { c = 1 ; { ++ c ; } ++ c ; } " , tok ( code ) ) ;
2009-12-07 22:42:30 +01:00
}
{
const char code [ ] = " void f() \n "
" { \n "
" char a[] = \" p \" ; \n "
" ++a[0]; \n "
" } \n " ;
2010-04-24 21:48:58 +02:00
ASSERT_EQUALS ( " void f ( ) { char a [ 2 ] = \" p \" ; ++ a [ 0 ] ; } " , tok ( code ) ) ;
2009-12-07 22:42:30 +01:00
}
2009-05-25 08:31:20 +02:00
}
2014-11-20 14:20:09 +01:00
std : : string elseif ( const char code [ ] ) {
2010-12-01 18:00:55 +01:00
errout . str ( " " ) ;
2009-02-17 20:18:26 +01:00
2010-12-01 18:00:55 +01:00
Settings settings ;
Tokenizer tokenizer ( & settings , this ) ;
std : : istringstream istr ( code ) ;
2012-02-26 02:44:16 +01:00
tokenizer . tokenize ( istr , " test.cpp " ) ;
2009-08-04 21:32:14 +02:00
tokenizer . elseif ( ) ;
2009-02-17 20:18:26 +01:00
return tokenizer . tokens ( ) - > stringifyList ( false ) ;
}
2014-11-20 14:20:09 +01:00
void elseif1 ( ) {
2009-02-17 20:18:26 +01:00
const char code [ ] = " else if(ab) { cd } else { ef }gh " ;
2009-03-03 21:17:23 +01:00
ASSERT_EQUALS ( " \n \n ##file 0 \n 1: else { if ( ab ) { cd } else { ef } } gh \n " , elseif ( code ) ) ;
2009-11-23 18:59:50 +01:00
// syntax error: assert there is no segmentation fault
ASSERT_EQUALS ( " \n \n ##file 0 \n 1: else if ( x ) { } \n " , elseif ( " else if (x) { } " ) ) ;
2009-12-08 00:22:24 +01:00
{
const char src [ ] = " void f(int g,int f) { \n "
" if(g==1) {poo();} \n "
" else if( g == 2 ) \n "
" { \n "
" if( f == 0 ){coo();} \n "
" else if( f==1) \n "
" goo(); \n "
" } \n "
" } " ;
const char expected [ ] = " void f ( int g , int f ) "
" { "
" if ( g == 1 ) { poo ( ) ; } "
" else { "
" if ( g == 2 ) "
" { "
" if ( ! f ) { coo ( ) ; } "
" else { "
" if ( f == 1 ) "
" { "
" goo ( ) ; "
" } "
" } "
" } "
" } "
" } " ;
ASSERT_EQUALS ( tok ( expected ) , tok ( src ) ) ;
}
2009-02-17 20:18:26 +01:00
}
2009-02-28 10:09:55 +01:00
2014-11-20 14:20:09 +01:00
void ifa_ifa ( ) {
2010-01-22 20:20:43 +01:00
ASSERT_EQUALS ( " int a ; if ( a ) { { ab } cd } " , tok ( " int a ; if (a) { if (a) { ab } cd } " , true ) ) ;
ASSERT_EQUALS ( " int a ; if ( a ) { { ab } cd } " , tok ( " int a ; if (unlikely(a)) { if (a) { ab } cd } " , true ) ) ;
}
2009-02-28 10:09:55 +01:00
2014-11-20 14:20:09 +01:00
unsigned int sizeofFromTokenizer ( const char type [ ] ) {
2010-12-01 18:00:55 +01:00
errout . str ( " " ) ;
Settings settings ;
Tokenizer tokenizer ( & settings , this ) ;
2009-10-27 19:23:45 +01:00
std : : istringstream istr ( " " ) ;
tokenizer . tokenize ( istr , " test.cpp " ) ;
2010-04-09 21:40:37 +02:00
Token tok1 ( 0 ) ;
tok1 . str ( type ) ;
return tokenizer . sizeOfType ( & tok1 ) ;
2009-10-27 19:23:45 +01:00
}
2009-02-28 10:09:55 +01:00
2014-11-20 14:20:09 +01:00
void sizeof_array ( ) {
2014-09-16 17:21:17 +02:00
const char * code ;
2014-09-23 16:04:38 +02:00
2014-09-16 17:21:17 +02:00
code = " void foo() \n "
2014-09-23 16:04:38 +02:00
" { \n "
" int i[4]; \n "
" sizeof(i); \n "
" sizeof(*i); \n "
" } \n " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " void foo ( ) { int i [ 4 ] ; 16 ; 4 ; } " , tok ( code ) ) ;
2009-02-28 10:09:55 +01:00
2014-09-16 17:21:17 +02:00
code = " static int i[4]; \n "
2014-09-23 16:04:38 +02:00
" void f() \n "
" { \n "
" int i[10]; \n "
" sizeof(i); \n "
" } \n " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " static int i [ 4 ] ; void f ( ) { int i [ 10 ] ; 40 ; } " , tok ( code ) ) ;
2009-09-20 22:38:32 +02:00
{
2014-09-16 17:21:17 +02:00
code = " int i[10]; \n "
2014-09-23 16:04:38 +02:00
" sizeof(i[0]); \n " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " int i [ 10 ] ; 4 ; " , tok ( code ) ) ;
2009-09-20 22:38:32 +02:00
2014-09-16 17:21:17 +02:00
code = " int i[10]; \n "
2014-09-23 16:04:38 +02:00
" sizeof i[0]; \n " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " int i [ 10 ] ; 4 ; " , tok ( code ) ) ;
2009-09-20 22:38:32 +02:00
}
2014-09-16 17:21:17 +02:00
code = " char i[2][20]; \n "
" sizeof(i[1]); " ;
2014-09-23 16:04:38 +02:00
ASSERT_EQUALS ( " char i [ 2 ] [ 20 ] ; 20 ; " , tok ( code ) ) ;
2009-02-28 10:09:55 +01:00
}
2014-11-20 14:20:09 +01:00
void sizeof5 ( ) {
2009-02-28 10:09:55 +01:00
const char code [ ] =
2009-10-21 21:08:00 +02:00
" const char * names[2]; "
2010-08-25 22:10:21 +02:00
" for (int i = 0; i != sizeof(names[0]); i++) "
2009-02-28 10:09:55 +01:00
" {} " ;
2009-10-27 19:23:45 +01:00
std : : ostringstream expected ;
2010-08-25 22:10:21 +02:00
expected < < " const char * names [ 2 ] ; for ( int i = 0 ; i != " < < sizeofFromTokenizer ( " * " ) < < " ; i ++ ) { } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( code ) ) ;
2009-02-28 10:09:55 +01:00
}
2014-11-20 14:20:09 +01:00
void sizeof6 ( ) {
2009-02-28 10:09:55 +01:00
const char code [ ] = " ;int i; \n "
" sizeof(i); \n " ;
std : : ostringstream expected ;
2009-09-13 12:59:59 +02:00
expected < < " ; int i ; " < < sizeof ( int ) < < " ; " ;
2009-02-28 10:09:55 +01:00
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( code ) ) ;
2009-02-28 10:09:55 +01:00
}
2014-11-20 14:20:09 +01:00
void sizeof7 ( ) {
2009-03-29 16:36:34 +02:00
const char code [ ] = " ;INT32 i[10]; \n "
" sizeof(i[0]); \n " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " ; INT32 i [ 10 ] ; sizeof ( i [ 0 ] ) ; " , tok ( code , true , Settings : : Unspecified ) ) ;
2014-10-19 07:34:40 +02:00
ASSERT_EQUALS ( " ; int i [ 10 ] ; 4 ; " , tokWithWindows ( code , true , Settings : : Win32A ) ) ;
2009-03-29 16:36:34 +02:00
}
2014-11-20 14:20:09 +01:00
void sizeof8 ( ) {
2009-05-31 21:33:44 +02:00
{
const char code [ ] = " void f() \n "
" { \n "
" char* ptrs[2]; \n "
2010-01-31 09:52:19 +01:00
" a = sizeof( ptrs ); \n "
2009-05-31 21:33:44 +02:00
" } \n " ;
std : : ostringstream oss ;
2009-10-27 19:23:45 +01:00
oss < < ( sizeofFromTokenizer ( " * " ) * 2 ) ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " void f ( ) { char * ptrs [ 2 ] ; a = " + oss . str ( ) + " ; } " , tok ( code ) ) ;
2009-05-31 21:33:44 +02:00
}
{
const char code [ ] = " void f() \n "
" { \n "
" char* ptrs[55]; \n "
2010-01-31 09:52:19 +01:00
" a = sizeof( ptrs ); \n "
2009-05-31 21:33:44 +02:00
" } \n " ;
std : : ostringstream oss ;
2009-10-27 19:23:45 +01:00
oss < < ( sizeofFromTokenizer ( " * " ) * 55 ) ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " void f ( ) { char * ptrs [ 55 ] ; a = " + oss . str ( ) + " ; } " , tok ( code ) ) ;
2009-05-31 21:33:44 +02:00
}
{
const char code [ ] = " void f() \n "
" { \n "
" char* ptrs; \n "
2010-01-31 09:52:19 +01:00
" a = sizeof( ptrs ); \n "
2009-05-31 21:33:44 +02:00
" } \n " ;
std : : ostringstream oss ;
2009-10-27 19:23:45 +01:00
oss < < sizeofFromTokenizer ( " * " ) ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " void f ( ) { a = " + oss . str ( ) + " ; } " , tok ( code ) ) ;
2009-05-31 21:33:44 +02:00
}
}
2014-11-20 14:20:09 +01:00
void sizeof9 ( ) {
2009-09-06 13:28:25 +02:00
// ticket #487
{
2009-10-07 09:54:34 +02:00
const char code [ ] = " ; const char *str = \" 1 \" ; sizeof(str); " ;
2009-09-06 13:28:25 +02:00
std : : ostringstream expected ;
2009-10-27 19:23:45 +01:00
expected < < " ; const char * str ; str = \" 1 \" ; " < < sizeofFromTokenizer ( " * " ) < < " ; " ;
2009-09-06 13:28:25 +02:00
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( code ) ) ;
2009-09-06 13:28:25 +02:00
}
{
2009-10-07 09:54:34 +02:00
const char code [ ] = " ; const char str[] = \" 1 \" ; sizeof(str); " ;
2009-09-06 13:28:25 +02:00
std : : ostringstream expected ;
2010-04-24 21:48:58 +02:00
expected < < " ; const char str [ 2 ] = \" 1 \" ; " < < sizeofFromTokenizer ( " char " ) * 2 < < " ; " ;
2009-09-06 13:28:25 +02:00
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( code ) ) ;
2009-09-06 13:28:25 +02:00
}
{
2010-04-04 19:28:15 +02:00
// Ticket #799
2009-10-07 09:54:34 +02:00
const char code [ ] = " ; const char str[] = {'1'}; sizeof(str); " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " ; const char str [ 1 ] = { '1' } ; 1 ; " , tok ( code ) ) ;
2009-09-06 13:28:25 +02:00
}
2009-09-22 20:50:00 +02:00
2010-10-12 21:52:02 +02:00
{
// Ticket #2087
const char code [ ] = " ; const char str[] = { \" abc \" }; sizeof(str); " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " ; const char str [ 4 ] = \" abc \" ; 4 ; " , tok ( code ) ) ;
2010-10-12 21:52:02 +02:00
}
2009-09-22 20:50:00 +02:00
// ticket #716 - sizeof string
{
std : : ostringstream expected ;
expected < < " ; " < < ( sizeof " 123 " ) ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( " ; sizeof \" 123 \" " ) ) ;
ASSERT_EQUALS ( expected . str ( ) , tok ( " ; sizeof( \" 123 \" ) " ) ) ;
2009-09-22 20:50:00 +02:00
}
2009-09-23 17:59:26 +02:00
2009-10-07 11:05:44 +02:00
{
const char code [ ] = " void f(char *a,char *b, char *c) "
" {g(sizeof(a),sizeof(b),sizeof(c));} " ;
std : : ostringstream expected ;
expected < < " void f ( char * a , char * b , char * c ) { g ( " < <
2010-04-15 20:08:51 +02:00
sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " ) ; } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( code ) ) ;
2009-10-07 11:05:44 +02:00
}
{
const char code [ ] = " void f(char a,char b, char c) "
" {g(sizeof(a),sizeof(b),sizeof(c));} " ;
std : : ostringstream expected ;
expected < < " void f ( char a , char b , char c ) { g ( " < <
2010-04-15 20:08:51 +02:00
sizeofFromTokenizer ( " char " ) < < " , " < < sizeofFromTokenizer ( " char " ) < < " , " < < sizeofFromTokenizer ( " char " ) < < " ) ; } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( code ) ) ;
2009-10-07 11:05:44 +02:00
}
{
const char code [ ] = " void f(const char *a,const char *b, const char *c) "
" {g(sizeof(a),sizeof(b),sizeof(c));} " ;
std : : ostringstream expected ;
expected < < " void f ( const char * a , const char * b , const char * c ) { g ( " < <
2010-04-15 20:08:51 +02:00
sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " ) ; } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( code ) ) ;
2009-10-07 11:05:44 +02:00
}
{
const char code [ ] = " void f(char a[10],char b[10], char c[10]) "
" {g(sizeof(a),sizeof(b),sizeof(c));} " ;
std : : ostringstream expected ;
expected < < " void f ( char a [ 10 ] , char b [ 10 ] , char c [ 10 ] ) { g ( " < <
2010-04-15 20:08:51 +02:00
sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " ) ; } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( code ) ) ;
2009-10-07 11:05:44 +02:00
}
{
const char code [ ] = " void f(const char a[10],const char b[10], const char c[10]) "
" {g(sizeof(a),sizeof(b),sizeof(c));} " ;
std : : ostringstream expected ;
expected < < " void f ( const char a [ 10 ] , "
2010-04-15 20:08:51 +02:00
" const char b [ 10 ] , "
" const char c [ 10 ] ) { g ( " < <
sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " ) ; } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( code ) ) ;
2009-10-07 11:05:44 +02:00
}
{
const char code [ ] = " void f(const char *a[10],const char *b[10], const char *c[10]) "
" {g(sizeof(a),sizeof(b),sizeof(c));} " ;
std : : ostringstream expected ;
expected < < " void f ( const char * a [ 10 ] , "
2010-04-15 20:08:51 +02:00
" const char * b [ 10 ] , "
" const char * c [ 10 ] ) { g ( " < <
sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " ) ; } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( code ) ) ;
2009-10-07 11:05:44 +02:00
}
{
const char code [ ] = " void f(char *a[10],char *b[10], char *c[10]) "
" {g(sizeof(a),sizeof(b),sizeof(c));} " ;
std : : ostringstream expected ;
expected < < " void f ( char * a [ 10 ] , char * b [ 10 ] , char * c [ 10 ] ) { g ( " < <
2010-04-15 20:08:51 +02:00
sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " , " < < sizeofFromTokenizer ( " * " ) < < " ) ; } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( code ) ) ;
2009-10-07 11:05:44 +02:00
}
2009-09-23 17:59:26 +02:00
{
std : : ostringstream expected ;
expected < < " ; " < < sizeof ( " \" quote \" " ) ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( " ; sizeof( \" \\ \" quote \\ \" \" ) " ) ) ;
2009-09-23 17:59:26 +02:00
}
2009-10-07 09:54:34 +02:00
{
std : : ostringstream expected ;
2010-04-02 07:30:58 +02:00
expected < < " void f ( ) { char str [ 100 ] = \" 100 \" ; " < < sizeofFromTokenizer ( " char " ) * 100 < < " } " ;
2009-10-07 09:54:34 +02:00
ASSERT_EQUALS ( expected . str ( ) , tok ( " void f ( ) { char str [ 100 ] = \" 100 \" ; sizeof ( str ) } " ) ) ;
}
2009-09-06 13:28:25 +02:00
}
2014-11-20 14:20:09 +01:00
void sizeof10 ( ) {
2009-10-10 14:26:03 +02:00
// ticket #809
const char code [ ] = " int m ; "
" compat_ulong_t um ; "
2011-09-18 16:31:31 +02:00
" long size ; size = sizeof ( m ) / sizeof ( um ) ; " ;
2009-10-10 14:26:03 +02:00
2011-09-24 20:51:03 +02:00
ASSERT_EQUALS ( code , tok ( code , true , Settings : : Win32A ) ) ;
2009-10-10 14:26:03 +02:00
}
2014-11-20 14:20:09 +01:00
void sizeof11 ( ) {
2009-10-18 18:06:32 +02:00
// ticket #827
const char code [ ] = " void f() \n "
" { \n "
" char buf2[4]; \n "
" sizeof buf2; \n "
" } \n "
" \n "
" void g() \n "
" { \n "
" struct A a[2]; \n "
" char buf[32]; \n "
" sizeof buf; \n "
" } " ;
const char expected [ ] = " void f ( ) "
" { "
" char buf2 [ 4 ] ; "
" 4 ; "
" } "
" "
" void g ( ) "
" { "
" struct A a [ 2 ] ; "
" char buf [ 32 ] ; "
" 32 ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void sizeof12 ( ) {
2009-10-21 21:08:00 +02:00
// ticket #827
const char code [ ] = " void f() \n "
" { \n "
" int *p; \n "
" (sizeof *p); \n "
" } " ;
const char expected [ ] = " void f ( ) "
" { "
2011-12-02 23:01:55 +01:00
" "
2009-10-21 21:08:00 +02:00
" 4 ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void sizeof13 ( ) {
2009-10-22 23:00:27 +02:00
// ticket #851
const char code [ ] = " int main() \n "
" { \n "
" char *a; \n "
" a = malloc(sizeof(*a)); \n "
" } \n "
" \n "
" struct B \n "
" { \n "
" char * b[2]; \n "
" }; " ;
const char expected [ ] = " int main ( ) "
" { "
" char * a ; "
" a = malloc ( 1 ) ; "
" } "
" struct B "
" { "
" char * b [ 2 ] ; "
" } ; " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void sizeof14 ( ) {
2009-11-13 20:07:44 +01:00
// ticket #954
const char code [ ] = " void f() \n "
" { \n "
" A **a; \n "
" int aa = sizeof *(*a)->b; \n "
" } \n " ;
const char expected [ ] = " void f ( ) "
" { "
" A * * a ; "
" int aa ; aa = sizeof ( * ( * a ) . b ) ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
2013-10-06 08:20:10 +02:00
// #5064 - sizeof !! (a == 1);
ASSERT_EQUALS ( " sizeof ( ! ! ( a == 1 ) ) ; " , tok ( " sizeof !!(a==1); " ) ) ;
2009-11-13 20:07:44 +01:00
}
2014-11-20 14:20:09 +01:00
void sizeof15 ( ) {
2009-11-29 12:14:42 +01:00
// ticket #1020
tok ( " void f() \n "
" { \n "
" int *n; \n "
" sizeof *(n); \n "
2013-03-20 15:36:16 +01:00
" } " ) ;
2009-11-29 12:14:42 +01:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void sizeof16 ( ) {
2009-11-29 17:25:35 +01:00
// ticket #1027
const char code [ ] = " void f() \n "
" { \n "
" int a; \n "
" printf( \" %i \" , sizeof a++); \n "
" } \n " ;
ASSERT_EQUALS ( " void f ( ) { int a ; printf ( \" %i \" , sizeof ( a ++ ) ) ; } " , tok ( code ) ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void sizeof17 ( ) {
2009-12-06 08:46:59 +01:00
// ticket #1050
const char code [ ] = " void f() \n "
" { \n "
" sizeof 1; \n "
" while (0); \n "
" } \n " ;
2009-12-28 08:37:34 +01:00
ASSERT_EQUALS ( " void f ( ) { sizeof ( 1 ) ; } " , tok ( code ) ) ;
2009-12-06 08:46:59 +01:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void sizeof18 ( ) {
2010-03-28 15:56:13 +02:00
{
2010-04-13 22:17:27 +02:00
std : : ostringstream expected ;
expected < < sizeof ( short int ) ;
2010-03-28 15:56:13 +02:00
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(short int); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(unsigned short int); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(short unsigned int); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(signed short int); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
}
{
2010-04-13 22:17:27 +02:00
std : : ostringstream expected ;
expected < < sizeof ( long long ) ;
2010-03-28 15:56:13 +02:00
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(long long); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(signed long long); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(unsigned long long); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(long unsigned long); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(long long int); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(signed long long int); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(unsigned long long int); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(long unsigned long int); \n "
" } \n " ;
2010-04-13 22:17:27 +02:00
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
2010-03-28 15:56:13 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
}
2010-04-13 22:17:27 +02:00
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(char*); \n "
" } \n " ;
std : : ostringstream expected ;
expected < < sizeof ( int * ) ;
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof(unsigned int*); \n "
" } \n " ;
std : : ostringstream expected ;
expected < < sizeof ( int * ) ;
ASSERT_EQUALS ( " void f ( ) { " + expected . str ( ) + " ; } " , tok ( code ) ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
2010-07-22 22:21:12 +02:00
}
}
2014-11-20 14:20:09 +01:00
void sizeof19 ( ) {
2010-07-22 22:21:12 +02:00
// ticket #1891 - sizeof 'x'
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof 'x'; \n "
" } \n " ;
std : : ostringstream sz ;
sz < < sizeof ( ' x ' ) ;
ASSERT_EQUALS ( " void f ( ) { " + sz . str ( ) + " ; } " , tok ( code ) ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" sizeof('x'); \n "
" } \n " ;
std : : ostringstream sz ;
sz < < sizeof ( ' x ' ) ;
ASSERT_EQUALS ( " void f ( ) { " + sz . str ( ) + " ; } " , tok ( code ) ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
2010-04-13 22:17:27 +02:00
}
2010-03-28 15:56:13 +02:00
}
2014-11-20 14:20:09 +01:00
void sizeof20 ( ) {
2010-09-06 21:34:51 +02:00
// ticket #2024 - sizeof a)
const char code [ ] = " struct struct_a { \n "
" char a[20]; \n "
" }; \n "
" \n "
" void foo() { \n "
" struct_a a; \n "
" append(sizeof a).append(); \n "
" } \n " ;
ASSERT_EQUALS ( " struct struct_a { char a [ 20 ] ; } ; "
" void foo ( ) { "
" struct_a a ; "
2012-09-16 08:20:43 +02:00
" append ( sizeof ( a ) ) . append ( ) ; "
2010-09-06 21:34:51 +02:00
" } " , tok ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void sizeof21 ( ) {
2010-11-29 17:46:10 +01:00
// ticket #2232 - sizeof...(Args)
const char code [ ] = " struct Internal { \n "
" int operator()(const Args&... args) const { \n "
" int n = sizeof...(Args); \n "
" return n; \n "
" } \n "
" }; \n "
" \n "
" int main() { \n "
" Internal internal; \n "
" int n = 0; n = internal(1); \n "
" return 0; \n "
" } \n " ;
// don't segfault
tok ( code ) ;
}
2014-11-20 14:20:09 +01:00
void sizeof22 ( ) {
2011-02-21 23:49:30 +01:00
// ticket #2599 segmentation fault
const char code [ ] = " sizeof \n " ;
// don't segfault
tok ( code ) ;
}
2014-11-20 14:20:09 +01:00
void sizeof23 ( ) {
2011-02-23 20:44:14 +01:00
// ticket #2604 segmentation fault
const char code [ ] = " sizeof <= A \n " ;
// don't segfault
tok ( code ) ;
}
2010-09-06 21:34:51 +02:00
2014-11-20 14:20:09 +01:00
void sizeofsizeof ( ) {
2010-05-14 18:40:15 +02:00
// ticket #1682
const char code [ ] = " void f() \n "
" { \n "
" sizeof sizeof 1; \n "
" } \n " ;
ASSERT_EQUALS ( " void f ( ) { sizeof sizeof ( 1 ) ; } " , tok ( code ) ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void casting ( ) {
2009-06-19 19:25:56 +02:00
{
const char code [ ] = " void f() \n "
" { \n "
" for (int i = 0; i < static_cast<int>(3); ++i) {} \n "
" } \n " ;
2009-09-13 12:59:59 +02:00
const std : : string expected ( " void f ( ) { for ( int i = 0 ; i < 3 ; ++ i ) { } } " ) ;
2009-03-05 20:32:02 +01:00
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , tok ( code ) ) ;
2009-06-19 19:25:56 +02:00
}
{
const char code [ ] = " void f() \n "
" { \n "
" p = const_cast<char *> qtu (); \n "
" } \n " ;
2009-03-05 20:32:02 +01:00
2009-09-13 12:59:59 +02:00
const std : : string expected ( " void f ( ) { p = const_cast < char * > qtu ( ) ; } " ) ;
2009-06-19 19:25:56 +02:00
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , tok ( code ) ) ;
2009-06-19 19:25:56 +02:00
}
2009-03-11 18:50:24 +01:00
2009-09-13 12:31:32 +02:00
{
// ticket #645
const char code [ ] = " void f() \n "
" { \n "
" return dynamic_cast<Foo *>((bar())); \n "
" } \n " ;
2009-09-13 12:59:59 +02:00
const std : : string expected ( " void f ( ) { return bar ( ) ; } " ) ;
2009-09-13 12:31:32 +02:00
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , tok ( code ) ) ;
2009-09-13 12:31:32 +02:00
}
}
2009-03-11 18:50:24 +01:00
2014-11-20 14:20:09 +01:00
void strlen1 ( ) {
2009-11-07 08:25:39 +01:00
ASSERT_EQUALS ( " 4 " , tok ( " strlen( \" abcd \" ) " ) ) ;
{
const char code [ ] = " void f() \n "
" { \n "
" const char *s = \" abcd \" ; \n "
" strlen(s); \n "
" } \n " ;
const char expected [ ] = " void f ( ) "
" { "
" const char * s ; "
" s = \" abcd \" ; "
" 4 ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" const char s [ ] = \" abcd \" ; \n "
" strlen(s); \n "
" } \n " ;
const char expected [ ] = " void f ( ) "
" { "
2010-04-24 21:48:58 +02:00
" const char s [ 5 ] = \" abcd \" ; "
2009-11-07 08:25:39 +01:00
" 4 ; "
" } " ;
2010-11-05 20:05:57 +01:00
ASSERT_EQUALS ( expected , tok ( code ) ) ;
2009-11-07 08:25:39 +01:00
}
}
2014-11-20 14:20:09 +01:00
void strlen2 ( ) {
2013-06-25 20:10:40 +02:00
// #4530 - make sure calculation with strlen is simplified
ASSERT_EQUALS ( " i = -4 ; " ,
tok ( " i = (strlen( \" abcd \" ) - 8); " ) ) ;
}
2009-11-07 08:25:39 +01:00
2014-11-20 14:20:09 +01:00
void namespaces ( ) {
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " namespace std { } " ;
2009-03-11 18:50:24 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " " , tok ( code ) ) ;
}
2009-05-05 20:16:57 +02:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " ; namespace std { } " ;
2009-05-05 20:16:57 +02:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " ; " , tok ( code ) ) ;
}
2009-05-05 20:16:57 +02:00
2009-05-05 22:09:15 +02:00
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " using namespace std; namespace a{ namespace b{ void f(){} } } " ;
2009-05-05 22:09:15 +02:00
2014-09-24 13:23:44 +02:00
const std : : string expected ( " namespace a { namespace b { void f ( ) { } } } " ) ;
2009-05-05 22:09:15 +02:00
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , tok ( code ) ) ;
2009-05-05 22:09:15 +02:00
}
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " namespace b{ void f(){} } " ;
2011-01-30 12:54:19 +01:00
2014-09-24 13:23:44 +02:00
const std : : string expected ( " namespace b { void f ( ) { } } " ) ;
2009-05-05 22:09:15 +02:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( expected , tok ( code ) ) ;
2009-05-05 22:09:15 +02:00
}
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " void f(int namespace) { } " ;
2009-05-05 22:09:15 +02:00
2014-09-24 13:23:44 +02:00
const std : : string expected ( " void f ( int namespace ) { } " ) ;
2009-05-05 22:09:15 +02:00
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , tok ( code ) ) ;
2009-05-05 22:09:15 +02:00
}
}
2009-03-14 21:26:32 +01:00
2009-05-08 16:19:22 +02:00
2014-11-20 14:20:09 +01:00
std : : string simplifyIfAndWhileAssign ( const char code [ ] ) {
2014-09-24 13:23:44 +02:00
errout . str ( " " ) ;
Settings settings ;
// tokenize..
Tokenizer tokenizer ( & settings , this ) ;
std : : istringstream istr ( code ) ;
tokenizer . tokenize ( istr , " test.cpp " ) ;
2009-05-09 08:02:59 +02:00
2014-09-24 13:23:44 +02:00
tokenizer . simplifyIfAndWhileAssign ( ) ;
2009-05-09 08:02:59 +02:00
2014-09-24 13:23:44 +02:00
return tokenizer . tokens ( ) - > stringifyList ( 0 , false ) ;
2009-05-09 08:02:59 +02:00
}
2014-11-20 14:20:09 +01:00
void ifassign1 ( ) {
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " ; a = b ; if ( a ) { ; } " , simplifyIfAndWhileAssign ( " ;if(a=b); " ) ) ;
ASSERT_EQUALS ( " ; a = b ( ) ; if ( a ) { ; } " , simplifyIfAndWhileAssign ( " ;if((a=b())); " ) ) ;
ASSERT_EQUALS ( " ; a = b ( ) ; if ( ! ( a ) ) { ; } " , simplifyIfAndWhileAssign ( " ;if(!(a=b())); " ) ) ;
ASSERT_EQUALS ( " ; a . x = b ( ) ; if ( ! ( a . x ) ) { ; } " , simplifyIfAndWhileAssign ( " ;if(!(a->x=b())); " ) ) ;
ASSERT_EQUALS ( " void f ( ) { A ( ) a = b ; if ( a ) { ; } } " , simplifyIfAndWhileAssign ( " void f() { A() if(a=b); } " ) ) ;
ASSERT_EQUALS ( " void foo ( int a ) { a = b ( ) ; if ( a >= 0 ) { ; } } " , tok ( " void foo(int a) {if((a=b())>=0);} " ) ) ;
TODO_ASSERT_EQUALS ( " void foo ( A a ) { a . c = b ( ) ; if ( 0 <= a . c ) { ; } } " ,
" void foo ( A a ) { a . c = b ( ) ; if ( a . c >= 0 ) { ; } } " ,
tok ( " void foo(A a) {if((a.c=b())>=0);} " ) ) ;
2009-06-14 11:28:25 +02:00
}
2009-05-08 16:19:22 +02:00
2014-11-20 14:20:09 +01:00
void ifAssignWithCast ( ) {
2014-09-24 13:23:44 +02:00
const char * code = " void foo() \n "
2009-06-14 14:57:47 +02:00
" { \n "
2014-09-24 13:23:44 +02:00
" FILE *f; \n "
" if( (f = fopen( \" foo \" , \" r \" )) == ((FILE*)NULL) ) \n "
" return(-1); \n "
" fclose(f); \n "
2009-06-14 14:57:47 +02:00
" } \n " ;
2014-09-24 13:23:44 +02:00
const char * expected = " void foo ( ) "
" { "
" FILE * f ; "
" f = fopen ( \" foo \" , \" r \" ) ; "
" if ( ! f ) "
" { "
" return -1 ; "
" } "
" fclose ( f ) ; "
" } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , tok ( code ) ) ;
2009-06-14 14:57:47 +02:00
}
2014-11-20 14:20:09 +01:00
void whileAssign1 ( ) {
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " ; a = b ; while ( a ) { b = 0 ; a = b ; } " , simplifyIfAndWhileAssign ( " ;while(a=b) { b = 0; } " ) ) ;
ASSERT_EQUALS ( " ; a . b = c ; while ( a . b ) { c = 0 ; a . b = c ; } " , simplifyIfAndWhileAssign ( " ;while(a.b=c) { c=0; } " ) ) ;
ASSERT_EQUALS ( " struct hfs_bnode * node ; "
" struct hfs_btree * tree ; "
" node = tree . node_hash [ i ++ ] ; "
" while ( node ) { node = tree . node_hash [ i ++ ] ; } " ,
tok ( " struct hfs_bnode *node; "
" struct hfs_btree *tree; "
" while ((node = tree->node_hash[i++])) { } " ) ) ;
ASSERT_EQUALS ( " char * s ; s = new char [ 10 ] ; while ( ! s ) { s = new char [ 10 ] ; } " ,
tok ( " char *s; while (0 == (s=new char[10])) { } " ) ) ;
2009-07-22 13:29:42 +02:00
}
2014-11-20 14:20:09 +01:00
void whileAssign2 ( ) {
2014-09-24 13:23:44 +02:00
// #1909 - Internal error
tok ( " void f() \n "
" { \n "
" int b; \n "
" while (b = sizeof (struct foo { int i0;})) \n "
" ; \n "
" if (!(0 <= b )) \n "
" ; \n "
" } " ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2009-09-14 21:49:41 +02:00
2014-11-20 14:20:09 +01:00
void whileAssign3 ( ) {
2014-09-24 13:23:44 +02:00
// #4254 - Variable id
const char code [ ] = " void f() { \n "
" int a; \n "
" while (a = x()); \n "
" } " ;
ASSERT_EQUALS ( " \n \n ##file 0 \n "
" 1: void f ( ) { \n "
" 2: int a@1 ; \n "
" 3: a@1 = x ( ) ; while ( a@1 ) { ; a@1 = x ( ) ; } \n "
" 4: } \n " , tokenizeDebugListing ( code , true , " test.c " ) ) ;
2009-09-14 21:49:41 +02:00
}
2014-11-20 14:20:09 +01:00
void whileAssign4 ( ) {
2014-09-24 13:23:44 +02:00
errout . str ( " " ) ;
2009-10-31 12:34:52 +01:00
2014-09-24 13:23:44 +02:00
Settings settings ;
Tokenizer tokenizer ( & settings , this ) ;
std : : istringstream istr ( " ; while (!(m = q->push<Message>(x))) {} " ) ;
tokenizer . tokenize ( istr , " test.cpp " ) ;
tokenizer . simplifyTokenList2 ( ) ;
2009-10-31 12:34:52 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " ; m = q . push < Message > ( x ) ; while ( ! m ) { m = q . push < Message > ( x ) ; } " , tokenizer . tokens ( ) - > stringifyList ( 0 , false ) ) ;
ASSERT ( tokenizer . tokens ( ) - > tokAt ( 26 ) ! = nullptr ) ;
if ( tokenizer . tokens ( ) - > tokAt ( 26 ) ) {
ASSERT ( tokenizer . tokens ( ) - > linkAt ( 6 ) = = tokenizer . tokens ( ) - > tokAt ( 8 ) ) ;
ASSERT ( tokenizer . tokens ( ) - > linkAt ( 24 ) = = tokenizer . tokens ( ) - > tokAt ( 26 ) ) ;
}
2009-11-01 15:56:00 +01:00
}
2014-11-20 14:20:09 +01:00
void doWhileAssign ( ) {
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " ; do { a = b ; } while ( a ) ; " , simplifyIfAndWhileAssign ( " ;do { } while(a=b); " ) ) ;
ASSERT_EQUALS ( " ; do { a . a = 0 ; a . b = c ; } while ( a . b ) ; " , simplifyIfAndWhileAssign ( " ;do { a.a = 0; } while(a.b=c); " ) ) ;
ASSERT_EQUALS ( " struct hfs_bnode * node ; "
" struct hfs_btree * tree ; "
" do { node = tree . node_hash [ i ++ ] ; } while ( node ) ; " ,
tok ( " struct hfs_bnode *node; "
" struct hfs_btree *tree; "
" do { } while((node = tree->node_hash[i++])); " ) ) ;
ASSERT_EQUALS ( " char * s ; do { s = new char [ 10 ] ; } while ( ! s ) ; " ,
tok ( " char *s; do { } while (0 == (s=new char[10])); " ) ) ;
// #4911
ASSERT_EQUALS ( " ; do { current = f ( ) ; } while ( current ) ; " , simplifyIfAndWhileAssign ( " ;do { } while((current=f()) != NULL); " ) ) ;
}
2009-11-01 15:56:00 +01:00
2014-11-20 14:20:09 +01:00
void ifnot ( ) {
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " if ( ! x ) { ; } " , tok ( " if(0==x); " , false ) ) ;
ASSERT_EQUALS ( " if ( ! x ) { ; } " , tok ( " if(x==0); " , false ) ) ;
ASSERT_EQUALS ( " if ( ! ( a = b ) ) { ; } " , tok ( " if(0==(a=b)); " , false ) ) ;
ASSERT_EQUALS ( " if ( ! a && b ( ) ) { ; } " , tok ( " if( 0 == a && b() ); " , false ) ) ;
ASSERT_EQUALS ( " if ( b ( ) && ! a ) { ; } " , tok ( " if( b() && 0 == a ); " , false ) ) ;
ASSERT_EQUALS ( " if ( ! ( a = b ) ) { ; } " , tok ( " if((a=b)==0); " , false ) ) ;
ASSERT_EQUALS ( " if ( ! x . y ) { ; } " , tok ( " if(x.y==0); " , false ) ) ;
ASSERT_EQUALS ( " if ( ! x ) { ; } " , tok ( " if((x==0)); " , false ) ) ;
ASSERT_EQUALS ( " if ( ( ! x ) && ! y ) { ; } " , tok ( " if((x==0) && y==0); " , false ) ) ;
ASSERT_EQUALS ( " if ( ! ( ! fclose ( fd ) ) ) { ; } " , tok ( " if(!(fclose(fd) == 0)); " , false ) ) ;
2009-10-31 12:34:52 +01:00
}
2014-11-20 14:20:09 +01:00
void not1 ( ) {
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { if ( ! p ) { ; } } " , tok ( " void f() { if (not p); } " , false ) ) ;
ASSERT_EQUALS ( " void f ( ) { if ( p && ! q ) { ; } } " , tok ( " void f() { if (p && not q); } " , false ) ) ;
ASSERT_EQUALS ( " void f ( ) { a = ! ( p && q ) ; } " , tok ( " void f() { a = not(p && q); } " , false ) ) ;
// Don't simplify 'not' or 'compl' if they are defined as a type;
// in variable declaration and in function declaration/definition
ASSERT_EQUALS ( " struct not { int x ; } ; " , tok ( " struct not { int x; }; " , false ) ) ;
ASSERT_EQUALS ( " void f ( ) { not p ; compl c ; } " , tok ( " void f() { not p; compl c; } " , false ) ) ;
ASSERT_EQUALS ( " void foo ( not i ) ; " , tok ( " void foo(not i); " , false ) ) ;
ASSERT_EQUALS ( " int foo ( not i ) { return g ( i ) ; } " , tok ( " int foo(not i) { return g(i); } " , false ) ) ;
}
2009-11-01 19:03:52 +01:00
2014-11-20 14:20:09 +01:00
void and1 ( ) {
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { if ( p && q ) { ; } } " ,
tok ( " void f() { if (p and q) ; } " , false ) ) ;
2009-11-01 19:03:52 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { if ( foo ( ) && q ) { ; } } " ,
tok ( " void f() { if (foo() and q) ; } " , false ) ) ;
2009-12-22 20:10:08 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { if ( foo ( ) && bar ( ) ) { ; } } " ,
tok ( " void f() { if (foo() and bar()) ; } " , false ) ) ;
2009-12-22 20:10:08 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { if ( p && bar ( ) ) { ; } } " ,
tok ( " void f() { if (p and bar()) ; } " , false ) ) ;
2009-11-01 19:03:52 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { if ( p && ! q ) { ; } } " ,
tok ( " void f() { if (p and not q) ; } " , false ) ) ;
2010-01-24 20:04:09 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { r = a && b ; } " ,
tok ( " void f() { r = a and b; } " , false ) ) ;
2010-01-24 20:04:09 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { r = ( a || b ) && ( c || d ) ; } " ,
tok ( " void f() { r = (a || b) and (c || d); } " , false ) ) ;
2010-01-24 20:04:09 +01:00
}
2014-11-20 14:20:09 +01:00
void or1 ( ) {
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { if ( p || q ) { ; } } " ,
tok ( " void f() { if (p or q) ; } " , false ) ) ;
2010-03-03 22:02:32 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { if ( foo ( ) || q ) { ; } } " ,
tok ( " void f() { if (foo() or q) ; } " , false ) ) ;
2010-03-03 22:02:32 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { if ( foo ( ) || bar ( ) ) { ; } } " ,
tok ( " void f() { if (foo() or bar()) ; } " , false ) ) ;
2010-06-12 08:32:05 +02:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { if ( p || bar ( ) ) { ; } } " ,
tok ( " void f() { if (p or bar()) ; } " , false ) ) ;
ASSERT_EQUALS ( " void f ( ) { if ( p || ! q ) { ; } } " ,
tok ( " void f() { if (p or not q) ; } " , false ) ) ;
ASSERT_EQUALS ( " void f ( ) { r = a || b ; } " ,
tok ( " void f() { r = a or b; } " , false ) ) ;
ASSERT_EQUALS ( " void f ( ) { r = ( a && b ) || ( c && d ) ; } " ,
tok ( " void f() { r = (a && b) or (c && d); } " , false ) ) ;
2010-06-12 08:32:05 +02:00
}
2014-11-20 14:20:09 +01:00
void cAlternativeTokens ( ) {
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { err = err | ( ( r & s ) && ! t ) ; } " ,
tok ( " void f() { err or_eq ((r bitand s) and not t); } " , false ) ) ;
ASSERT_EQUALS ( " void f ( ) const { r = f ( a [ 4 ] | 15 , ~ c , ! d ) ; } " ,
tok ( " void f() const { r = f(a[4] bitor 0x0F, compl c, not d) ; } " , false ) ) ;
2010-06-16 07:13:52 +02:00
2014-09-24 13:23:44 +02:00
}
2010-06-16 07:13:52 +02:00
2014-11-20 14:20:09 +01:00
void comma_keyword ( ) {
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void foo() \n "
" { \n "
" char *a, *b; \n "
" delete a, delete b; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( ) { char * a ; char * b ; delete a ; delete b ; } " , tok ( code ) ) ;
2010-06-16 07:13:52 +02:00
}
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " void foo() \n "
" { \n "
" struct A *a, *b; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( ) { struct A * a ; struct A * b ; } " , tok ( code ) ) ;
2010-06-16 07:13:52 +02:00
}
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " void foo() \n "
" { \n "
" struct A **a, **b; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( ) { struct A * * a ; struct A * * b ; } " , tok ( code ) ) ;
}
2010-06-16 07:13:52 +02:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void foo() \n "
" { \n "
" char *a, *b; \n "
" delete a, b; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( ) { char * a ; char * b ; delete a ; delete b ; } " , tok ( code ) ) ;
}
2010-06-16 07:13:52 +02:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void foo() \n "
" { \n "
" char **a, **b, **c; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( ) { char * * a ; char * * b ; char * * c ; } " , tok ( code ) ) ;
2010-06-16 07:13:52 +02:00
}
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " int f() \n "
" { \n "
" if (something) \n "
" return a(2, c(3, 4)), b(3), 10; \n "
" return a(), b(0, 0, 0), 10; \n "
" } \n " ;
ASSERT_EQUALS ( " int f ( ) "
" { "
" if ( something ) "
" { "
" a ( 2 , c ( 3 , 4 ) ) ; "
" b ( 3 ) ; "
" return 10 ; "
" } "
" a ( ) ; "
" b ( 0 , 0 , 0 ) ; "
" return 10 ; "
" } " , tok ( code ) ) ;
}
2010-06-16 07:13:52 +02:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void foo() \n "
" { \n "
" delete [] a, a = 0; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( ) { delete [ ] a ; a = 0 ; } " , tok ( code ) ) ;
}
2010-06-16 07:13:52 +02:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void foo() \n "
" { \n "
" delete a, a = 0; \n "
" } \n " ;
ASSERT_EQUALS ( " void foo ( ) { delete a ; a = 0 ; } " , tok ( code ) ) ;
2010-06-16 07:13:52 +02:00
}
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void f() \n "
" { \n "
" for(int a,b; a < 10; a = a + 1, b = b + 1); \n "
" } \n " ;
ASSERT_EQUALS ( " void f ( ) { for ( int a , b ; a < 10 ; a = a + 1 , b = b + 1 ) { ; } } " , tok ( code ) ) ;
}
2011-02-20 12:17:05 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void f() \n "
" { \n "
" char buf[BUFSIZ], **p; \n "
" char *ptrs[BUFSIZ], **pp; \n "
" } \n " ;
ASSERT_EQUALS ( " void f ( ) { char buf [ BUFSIZ ] ; char * * p ; char * ptrs [ BUFSIZ ] ; char * * pp ; } " , tok ( code ) ) ;
}
2011-02-20 12:17:05 +01:00
2014-09-24 13:23:44 +02:00
{
// #4786 - don't replace , with ; in ".. : public B, C .." code
const char code [ ] = " template < class T = X > class A : public B , C { } ; " ;
ASSERT_EQUALS ( code , tok ( code ) ) ;
}
2011-02-20 12:22:01 +01:00
}
2011-02-20 12:17:05 +01:00
2014-11-20 14:20:09 +01:00
void remove_comma ( ) {
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void f() \n "
" { \n "
" int a,b; \n "
" if( a ) \n "
" a=0, \n "
" b=0; \n "
" } \n " ;
ASSERT_EQUALS ( " void f ( ) { int a ; int b ; if ( a ) { a = 0 ; b = 0 ; } } " , tok ( code ) ) ;
}
2011-03-06 21:15:42 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " a ? b = c , d : e ; " ; // do nothing
ASSERT_EQUALS ( code , tok ( code ) ) ;
}
2011-03-06 21:15:42 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " ; return a ? b = c , d : e ; " ; // do nothing
ASSERT_EQUALS ( code , tok ( code ) ) ;
}
2011-02-20 12:17:05 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void f() \n "
" { \n "
" A a,b; \n "
" if( a.f ) \n "
" a.f=b.f, \n "
" a.g=b.g; \n "
" } \n " ;
ASSERT_EQUALS ( " void f ( ) { A a ; A b ; if ( a . f ) { a . f = b . f ; a . g = b . g ; } } " , tok ( code ) ) ;
}
2011-03-17 21:45:03 +01:00
2014-09-24 13:23:44 +02:00
// keep the comma in template specifiers..
{
const char code [ ] = " void f() \n "
" { \n "
" int a = b<T<char,3>, int>(); \n "
" } \n " ;
ASSERT_EQUALS ( " void f ( ) { int a ; a = b < T < char , 3 > , int > ( ) ; } " , tok ( code ) ) ;
}
2011-03-17 21:45:03 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void f() { \n "
" a = new std::map<std::string, std::string>; \n "
" } \n " ;
ASSERT_EQUALS ( " void f ( ) { a = new std :: map < std :: string , std :: string > ; } " , tok ( code ) ) ;
}
2011-03-17 21:45:03 +01:00
2014-09-24 13:23:44 +02:00
{
// ticket #1327
const char code [ ] = " const C<1,2,3> foo () \n "
" { \n "
" return C<1,2,3>(x,y); \n "
" } \n " ;
const char expected [ ] = " const C < 1 , 2 , 3 > foo ( ) "
" { "
" return C < 1 , 2 , 3 > ( x , y ) ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
2011-03-17 21:45:03 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " int foo () \n "
" { \n "
" return doSomething(), 0; \n "
" } \n " ;
const char expected [ ] = " int foo ( ) "
" { "
" doSomething ( ) ; return 0 ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
2014-11-10 17:31:19 +01:00
{
const char code [ ] = " int foo () \n "
" { \n "
" return a=1, b=2; \n "
" } \n " ;
const char expected [ ] = " int foo ( ) "
" { "
" a = 1 ; return b = 2 ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
2011-03-17 21:45:03 +01:00
}
2014-11-20 14:20:09 +01:00
void simplifyConditionOperator ( ) {
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " (0?(false?1:2):3) " ;
ASSERT_EQUALS ( " ( 3 ) " , tok ( code ) ) ;
}
2011-05-01 19:05:18 +02:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " (1?(false?1:2):3) " ;
ASSERT_EQUALS ( " ( 2 ) " , tok ( code ) ) ;
}
2011-12-03 15:14:53 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " int a = (1?0:1 == 1?0:1); " ;
ASSERT_EQUALS ( " int a ; a = 0 ; " , tok ( code ) ) ;
}
2011-12-04 11:38:41 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " (1?0:foo()) " ;
ASSERT_EQUALS ( " ( 0 ) " , tok ( code ) ) ;
}
2011-12-31 12:08:49 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void f () { switch(n) { case 1?0:foo(): break; }} " ;
ASSERT_EQUALS ( " void f ( ) { switch ( n ) { case 0 : ; break ; } } " , tok ( code ) ) ;
}
2012-02-18 08:51:09 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void f () { switch(n) { case 1?0?1:0:foo(): break; }} " ;
ASSERT_EQUALS ( " void f ( ) { switch ( n ) { case 0 : ; break ; } } " , tok ( code ) ) ;
}
2012-08-05 17:11:39 +02:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void f () { switch(n) { case 0?foo():1: break; }} " ;
ASSERT_EQUALS ( " void f ( ) { switch ( n ) { case 1 : ; break ; } } " , tok ( code ) ) ;
}
2012-08-08 06:43:41 +02:00
2013-04-12 16:38:12 +02:00
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " ( true ? a ( ) : b ( ) ) " ;
ASSERT_EQUALS ( " ( a ( ) ) " , tok ( code ) ) ;
2013-04-12 16:38:12 +02:00
}
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " ( true ? abc . a : abc . b ) " ;
ASSERT_EQUALS ( " ( abc . a ) " , tok ( code ) ) ;
2013-04-12 16:38:12 +02:00
}
2012-08-09 17:19:15 +02:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " void f() \n "
" { \n "
" bool x = false; \n "
" int b = x ? 44 : 3; \n "
" } \n " ;
ASSERT_EQUALS ( " void f ( ) { } " , tok ( code ) ) ;
}
2013-11-24 11:07:11 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " int vals[] = { 0x13, 1?0x01:0x00 }; " ;
ASSERT_EQUALS ( " int vals [ 2 ] = { 19 , 1 } ; " , tok ( code ) ) ;
}
2014-01-05 19:19:52 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " int vals[] = { 0x13, 0?0x01:0x00 }; " ;
ASSERT_EQUALS ( " int vals [ 2 ] = { 19 , 0 } ; " , tok ( code ) ) ;
}
2013-11-24 11:07:11 +01:00
2014-09-24 13:23:44 +02:00
{
const char code [ ] = " a = 1 ? 0 : ({ 0; }); " ;
ASSERT_EQUALS ( " a = 0 ; " , tok ( code ) ) ;
}
2014-05-15 21:52:57 +02:00
2014-09-24 13:23:44 +02:00
//GNU extension: "x ?: y" <-> "x ? x : y"
{
const char code [ ] = " ; a = 1 ? : x; b = 0 ? : 2; " ;
ASSERT_EQUALS ( " ; a = 1 ; b = 2 ; " , tok ( code ) ) ;
}
2014-05-16 22:17:39 +02:00
2014-09-24 13:23:44 +02:00
// Ticket #3572 (segmentation fault)
ASSERT_EQUALS ( " 0 ; x = { ? y : z ; } " , tok ( " 0; x = { ? y : z; } " ) ) ;
2014-09-06 20:39:04 +02:00
2014-09-24 13:23:44 +02:00
{
// #3922 - (true)
ASSERT_EQUALS ( " ; x = 2 ; " , tok ( " ; x = (true)?2:4; " ) ) ;
ASSERT_EQUALS ( " ; x = 4 ; " , tok ( " ; x = (false)?2:4; " ) ) ;
ASSERT_EQUALS ( " ; x = * a ; " , tok ( " ; x = (true)?*a:*b; " ) ) ;
ASSERT_EQUALS ( " ; x = * b ; " , tok ( " ; x = (false)?*a:*b; " ) ) ;
ASSERT_EQUALS ( " void f ( ) { return 1 ; } " , tok ( " void f() { char *p=0; return (p==0)?1:2; } " ) ) ;
}
2014-09-13 16:44:05 +02:00
}
2014-11-20 14:20:09 +01:00
void calculations ( ) {
2009-09-06 08:22:45 +02:00
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " a[i+8+2] " ;
ASSERT_EQUALS ( " a [ i + 10 ] " , tok ( code ) ) ;
2009-09-06 08:22:45 +02:00
}
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " a[8+2+i] " ;
ASSERT_EQUALS ( " a [ 10 + i ] " , tok ( code ) ) ;
2009-09-06 08:22:45 +02:00
}
2009-09-09 22:57:28 +02:00
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " a[i + 2 * (2 * 4)] " ;
ASSERT_EQUALS ( " a [ i + 16 ] " , tok ( code ) ) ;
}
{
const char code [ ] = " a[i + 100 - 90] " ;
ASSERT_EQUALS ( " a [ i + 10 ] " , tok ( code ) ) ;
}
{
const char code [ ] = " a[1+1+1+1+1+1+1+1+1+1-2+5-3] " ;
ASSERT_EQUALS ( " a [ 10 ] " , tok ( code ) ) ;
}
{
const char code [ ] = " a[10+10-10-10] " ;
ASSERT_EQUALS ( " a [ 0 ] " , tok ( code ) ) ;
2013-11-21 20:27:24 +01:00
}
2009-11-22 13:38:45 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " a [ 4 ] ; " , tok ( " a[1+3|4]; " ) ) ;
2009-11-22 13:38:45 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " x = 1 + 2 * y ; " , tok ( " x=1+2*y; " ) ) ;
ASSERT_EQUALS ( " x = 7 ; " , tok ( " x=1+2*3; " ) ) ;
ASSERT_EQUALS ( " x = 47185 ; " , tok ( " x=(65536*72/100); " ) ) ;
ASSERT_EQUALS ( " x = 900 ; " , tok ( " x = 1500000 / ((145000 - 55000) * 1000 / 54000); " ) ) ;
ASSERT_EQUALS ( " int a [ 8 ] ; " , tok ( " int a[5+6/2]; " ) ) ;
ASSERT_EQUALS ( " int a [ 4 ] ; " , tok ( " int a[(10)-1-5]; " ) ) ;
ASSERT_EQUALS ( " int a [ i - 9 ] ; " , tok ( " int a[i - 10 + 1]; " ) ) ;
2009-11-22 13:38:45 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " x = y ; " , tok ( " x=0+y+0-0; " ) ) ;
ASSERT_EQUALS ( " x = 0 ; " , tok ( " x=0*y; " ) ) ;
2009-09-03 22:19:44 +02:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " x = 501 ; " , tok ( " x = 1000 + 2 >> 1; " ) ) ;
ASSERT_EQUALS ( " x = 125 ; " , tok ( " x = 1000 / 2 >> 2; " ) ) ;
2010-10-02 13:28:44 +02:00
{
2014-09-24 13:23:44 +02:00
// Ticket #1997
const char code [ ] = " void * operator new[](size_t); " ;
ASSERT_EQUALS ( " void * operatornew[] ( long ) ; " , tok ( code , true , Settings : : Win32A ) ) ;
2010-10-02 13:28:44 +02:00
}
2009-05-08 16:19:22 +02:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " ; a [ 0 ] ; " , tok ( " ;a[0*(*p)]; " ) ) ;
2012-03-31 11:30:26 +02:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " ; " , tok ( " ; x = x + 0; " ) ) ;
2011-10-29 19:45:47 +02:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " if ( a == 2 ) { ; } " , tok ( " if (a==1+1); " ) ) ;
ASSERT_EQUALS ( " if ( a + 2 != 6 ) { ; } " , tok ( " if (a+1+1!=1+2+3); " ) ) ;
ASSERT_EQUALS ( " if ( 4 < a ) { ; } " , tok ( " if (14-2*5<a*4/(2*2)); " ) ) ;
2012-04-27 18:02:07 +02:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " ( y / 2 - 2 ) " , tok ( " (y / 2 - 2) " ) ) ;
ASSERT_EQUALS ( " ( y % 2 - 2 ) " , tok ( " (y % 2 - 2) " ) ) ;
2012-04-27 18:02:07 +02:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " ( 4 ) " , tok ( " (1 * 2 / 1 * 2) " ) ) ; // #3722
2014-10-10 13:19:25 +02:00
// don't remove these spaces..
ASSERT_EQUALS ( " new ( auto ) ( 4 ) ; " , tok ( " new (auto)(4); " ) ) ;
2012-04-27 18:02:07 +02:00
}
2014-11-20 14:20:09 +01:00
void comparisons ( ) {
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " ( 1 ) " , tok ( " ( 1 < 2 ) " ) ) ;
ASSERT_EQUALS ( " ( x ) " , tok ( " ( x && 1 < 2 ) " ) ) ;
ASSERT_EQUALS ( " ( 5 ) " , tok ( " ( 1 < 2 && 3 < 4 ? 5 : 6 ) " ) ) ;
ASSERT_EQUALS ( " ( 6 ) " , tok ( " ( 1 > 2 && 3 > 4 ? 5 : 6 ) " ) ) ;
2012-04-27 18:02:07 +02:00
}
2014-09-24 13:23:44 +02:00
2014-11-20 14:20:09 +01:00
void simplifyFlowControl ( ) {
2014-09-24 13:23:44 +02:00
const char code1 [ ] = " void f() { \n "
" return; \n "
" y(); \n "
" } " ;
ASSERT_EQUALS ( " void f ( ) { return ; } " , tokWithStdLib ( code1 ) ) ;
const char code2 [ ] = " void f() { \n "
" exit(); \n "
" y(); \n "
" } " ;
ASSERT_EQUALS ( " void f ( ) { exit ( ) ; } " , tokWithStdLib ( code2 ) ) ;
const char code3 [ ] = " void f() { \n "
" x.abort(); \n "
" y(); \n "
" } " ;
ASSERT_EQUALS ( " void f ( ) { x . abort ( ) ; y ( ) ; } " , tokWithStdLib ( code3 ) ) ;
2012-09-19 11:03:40 +02:00
}
2012-04-27 18:02:07 +02:00
2014-11-20 14:20:09 +01:00
void flowControl ( ) {
2009-03-13 00:07:05 +01:00
{
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void f ( ) { exit ( 0 ) ; } " , tokWithStdLib ( " void f() { exit(0); foo(); } " ) ) ;
ASSERT_EQUALS ( " void f ( ) { exit ( 0 ) ; } " , tokWithStdLib ( " void f() { exit(0); if (m) foo(); } " ) ) ;
ASSERT_EQUALS ( " void f ( int n ) { if ( n ) { exit ( 0 ) ; } foo ( ) ; } " , tokWithStdLib ( " void f(int n) { if (n) { exit(0); } foo(); } " ) ) ;
ASSERT_EQUALS ( " void f ( ) { exit ( 0 ) ; } " , tokWithStdLib ( " void f() { exit(0); dead(); switch (n) { case 1: deadcode () ; default: deadcode (); } } " ) ) ;
2009-03-13 00:07:05 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " int f ( int n ) { switch ( n ) { case 0 : ; exit ( 0 ) ; default : ; exit ( 0 ) ; } exit ( 0 ) ; } " ,
tokWithStdLib ( " int f(int n) { switch (n) {case 0: exit(0); n*=2; default: exit(0); n*=6;} exit(0); foo();} " ) ) ;
//ticket #3132
ASSERT_EQUALS ( " void f ( int i ) { goto label ; { label : ; exit ( 0 ) ; } } " , tokWithStdLib ( " void f (int i) { goto label; switch(i) { label: exit(0); } } " ) ) ;
//ticket #3148
ASSERT_EQUALS ( " void f ( ) { MACRO ( exit ( 0 ) ) } " , tokWithStdLib ( " void f() { MACRO(exit(0)) } " ) ) ;
ASSERT_EQUALS ( " void f ( ) { MACRO ( exit ( 0 ) ; , NULL ) } " , tokWithStdLib ( " void f() { MACRO(exit(0);, NULL) } " ) ) ;
ASSERT_EQUALS ( " void f ( ) { MACRO ( bar1 , exit ( 0 ) ) } " , tokWithStdLib ( " void f() { MACRO(bar1, exit(0)) } " ) ) ;
ASSERT_EQUALS ( " void f ( ) { MACRO ( exit ( 0 ) ; bar2 , foo ) } " , tokWithStdLib ( " void f() { MACRO(exit(0); bar2, foo) } " ) ) ;
2009-03-13 00:07:05 +01:00
}
2012-11-04 23:14:41 +01:00
{
2014-09-24 13:23:44 +02:00
const char * code = " void f(){ "
" if (k>0) goto label; "
" exit(0); "
" if (tnt) "
" { "
" { "
" check(); "
" k=0; "
" } "
" label: "
" bar(); "
" } "
" } " ;
ASSERT_EQUALS ( " void f ( ) { if ( k > 0 ) { goto label ; } exit ( 0 ) ; { label : ; bar ( ) ; } } " , tokWithStdLib ( code ) ) ;
2012-11-04 23:14:41 +01:00
}
2009-03-13 00:07:05 +01:00
{
2014-09-24 13:23:44 +02:00
const char * code = " void foo () { "
" exit(0); "
" { "
" boo(); "
" while (n) { --n; } "
" { "
" label: "
" ok(); "
" } "
" } "
" } " ;
ASSERT_EQUALS ( " void foo ( ) { exit ( 0 ) ; { label : ; ok ( ) ; } } " , tokWithStdLib ( code ) ) ;
2009-03-13 00:07:05 +01:00
}
2009-03-30 23:59:33 +02:00
{
2014-09-24 13:23:44 +02:00
const char * code = " void foo () { "
" exit(0); "
" switch (n) { "
" case 1: "
" label: "
" foo(); break; "
" default: "
" break; "
" } "
" } " ;
const char * expected = " void foo ( ) { exit ( 0 ) ; { label : ; foo ( ) ; break ; } } " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2009-03-30 23:59:33 +02:00
}
2010-01-01 21:06:30 +01:00
{
2014-09-24 13:23:44 +02:00
const char * code = " void foo () { "
" exit(0); "
" switch (n) { "
" case 1: "
" { "
" foo(); "
" } "
" label: "
" bar(); "
" } "
2013-01-16 15:37:07 +01:00
" } " ;
2014-09-24 13:23:44 +02:00
const char * expected = " void foo ( ) { exit ( 0 ) ; { label : ; bar ( ) ; } } " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char * code = " void foo () { "
" exit(0); "
" switch (n) { "
" case a: "
" { "
" foo(); "
" } "
" case b|c: "
" bar(); "
" } "
" } " ;
const char * expected = " void foo ( ) { exit ( 0 ) ; } " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char * code = " void foo () { "
" exit(0); "
" switch (n) { "
" case 1: "
" label: "
" foo(); break; "
" default: "
" break; break; "
" } "
" } " ;
const char * expected = " void foo ( ) { exit ( 0 ) ; { label : ; foo ( ) ; break ; } } " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char * code = " void foo () { "
" exit(0); "
" switch (n) { "
" case 1: "
" label: "
" foo(); break; break; "
" default: "
" break; "
" } "
" } " ;
const char * expected = " void foo ( ) { exit ( 0 ) ; { label : ; foo ( ) ; break ; } } " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char * code = " void foo () { "
" exit(0); "
" switch (n) { "
" case 1: "
" label: "
" foo(); break; break; "
" default: "
" break; break; "
" } "
" } " ;
const char * expected = " void foo ( ) { exit ( 0 ) ; { label : ; foo ( ) ; break ; } } " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char * code = " int f() { "
" switch (x) { case 1: exit(0); bar(); tack; { ticak(); exit(0) } exit(0); "
" case 2: exit(0); { random(); } tack(); "
" switch(y) { case 1: exit(0); case 2: exit(0); } "
" exit(0); } exit(0); } " ;
ASSERT_EQUALS ( " int f ( ) { switch ( x ) { case 1 : ; exit ( 0 ) ; case 2 : ; exit ( 0 ) ; } exit ( 0 ) ; } " , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char * code = " int f() { "
" switch (x) { case 1: exit(0); bar(); tack; { ticak(); exit(0); } exit(0); "
" case 2: switch(y) { case 1: exit(0); bar2(); foo(); case 2: exit(0); } "
" exit(0); } exit(0); } " ;
const char * expected = " int f ( ) { "
" switch ( x ) { case 1 : ; exit ( 0 ) ; "
" case 2 : ; switch ( y ) { case 1 : ; exit ( 0 ) ; case 2 : ; exit ( 0 ) ; } "
" exit ( 0 ) ; } exit ( 0 ) ; } " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char * code = " void foo () { "
" switch (i) { case 0: switch (j) { case 0: exit(0); } "
" case 1: switch (j) { case -1: exit(0); } "
" case 2: switch (j) { case -2: exit(0); } "
" case 3: if (blah6) {exit(0);} break; } } " ;
const char * expected = " void foo ( ) { "
" switch ( i ) { case 0 : ; switch ( j ) { case 0 : ; exit ( 0 ) ; } "
" case 1 : ; switch ( j ) { case -1 : ; exit ( 0 ) ; } "
" case 2 : ; switch ( j ) { case -2 : ; exit ( 0 ) ; } "
" case 3 : ; if ( blah6 ) { exit ( 0 ) ; } break ; } } " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char * code = " void foo () { "
" exit(0); "
" switch (i) { case 0: switch (j) { case 0: foo(); } "
" case 1: switch (j) { case -1: bar(); label:; ok(); } "
" case 3: if (blah6) { boo(); break; } } } " ;
const char * expected = " void foo ( ) { exit ( 0 ) ; { { label : ; ok ( ) ; } case 3 : ; if ( blah6 ) { boo ( ) ; break ; } } } " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char * code = " void foo() { "
" switch ( t ) { "
" case 0: "
" if ( t ) switch ( b ) {} "
" break; "
" case 1: "
" exit(0); "
" return 0; "
" } "
" return 0; "
" } " ;
const char * expected = " void foo ( ) { "
" switch ( t ) { "
" case 0 : ; "
" if ( t ) { switch ( b ) { } } "
" break ; "
" case 1 : ; "
" exit ( 0 ) ; "
" } "
" return 0 ; "
" } " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " void foo() \n "
" { \n "
" A *a = 0; \n "
" if (!a) { \n "
" nondeadcode; \n "
" return; \n "
" dead; \n "
" } \n "
" stilldead; \n "
" a->_a; \n "
" } \n " ;
const char expected [ ] = " void foo ( ) "
" { "
" A * a ; a = 0 ; { "
" nondeadcode ; "
" return ; "
" } "
" } " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " class Fred \n "
" { \n "
" public: \n "
" bool foo() const { return f; } \n "
" bool exit(); \n "
" \n "
" private: \n "
" bool f; \n "
" }; \n " ;
const char expected [ ] = " class Fred "
" { "
" public: "
" bool foo ( ) const { return f ; } "
" bool exit ( ) ; "
" "
" private: "
" bool f ; "
" } ; " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
2014-09-24 13:23:44 +02:00
const char code [ ] = " class abort { }; \n "
" \n "
" class Fred \n "
" { \n "
" public: \n "
" bool foo() const { return f; } \n "
" abort exit(); \n "
" \n "
" private: \n "
" bool f; \n "
" }; \n " ;
const char expected [ ] = " class abort { } ; "
" class Fred "
" { "
" public: "
" bool foo ( ) const { return f ; } "
" abort exit ( ) ; "
" "
" private: "
" bool f ; "
" } ; " ;
ASSERT_EQUALS ( expected , tokWithStdLib ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " void foo ( ) { exit ( 0 ) ; } " ,
tokWithStdLib ( " void foo() { do { exit(0); } while (true); } " ) ) ;
2014-10-22 20:25:36 +02:00
// #6187
tokWithStdLib ( " void foo() { \n "
" goto label; \n "
" for (int i = 0; i < 0; ++i) { \n "
" ; \n "
" label: \n "
" ; \n "
" } \n "
" } " ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void strcat1 ( ) {
2014-09-24 13:23:44 +02:00
const char code [ ] = " ; strcat(strcat(strcat(strcat(strcat(strcat(dst, \" this \" ), \" \" ), \" is \" ), \" a \" ), \" test \" ), \" . \" ); " ;
const char expect [ ] = " ; "
" strcat ( dst , \" this \" ) ; "
" strcat ( dst , \" \" ) ; "
" strcat ( dst , \" is \" ) ; "
" strcat ( dst , \" a \" ) ; "
" strcat ( dst , \" test \" ) ; "
" strcat ( dst , \" . \" ) ; " ;
2011-03-06 21:07:06 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( expect , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void strcat2 ( ) {
2014-09-24 13:23:44 +02:00
const char code [ ] = " ; strcat(strcat(dst, foo[0]), \" \" ); " ;
const char expect [ ] = " ; "
" strcat ( dst , foo [ 0 ] ) ; "
" strcat ( dst , \" \" ) ; " ;
2011-03-06 21:07:06 +01:00
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( expect , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void simplifyAtol ( ) {
2014-09-24 13:23:44 +02:00
ASSERT_EQUALS ( " a = std :: atol ( x ) ; " , tok ( " a = std::atol(x); " ) ) ;
ASSERT_EQUALS ( " a = atol ( \" text \" ) ; " , tok ( " a = atol( \" text \" ); " ) ) ;
ASSERT_EQUALS ( " a = 0 ; " , tok ( " a = std::atol( \" 0 \" ); " ) ) ;
ASSERT_EQUALS ( " a = 10 ; " , tok ( " a = atol( \" 0xa \" ); " ) ) ;
2013-07-19 21:18:54 +02:00
}
2014-11-20 14:20:09 +01:00
void simplifyOperator1 ( ) {
2011-10-23 10:25:14 +02:00
// #3237 - error merging namespaces with operators
const char code [ ] = " class c { \n "
" public: \n "
" operator std::string() const; \n "
" operator string() const; \n "
" }; \n " ;
const char expected [ ] = " class c { "
" public: "
" operatorstd::string ( ) const ; "
" operatorstring ( ) const ; "
" } ; " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void reverseArraySyntax ( ) {
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " a [ 13 ] " , tok ( " 13[a] " ) ) ;
}
2014-11-20 14:20:09 +01:00
void simplify_numeric_condition ( ) {
2011-03-06 21:07:06 +01:00
{
const char code [ ] =
" void f() \n "
" { \n "
" int x = 0; \n "
" if( !x || 0 ) \n "
" { g(); \n "
" } \n "
" } " ;
2011-12-02 23:01:55 +01:00
ASSERT_EQUALS ( " void f ( ) { g ( ) ; } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] =
" void f() \n "
" { \n "
" int x = 1; \n "
" if( !x ) \n "
" { g(); \n "
" } \n "
" } " ;
2011-12-02 23:01:55 +01:00
ASSERT_EQUALS ( " void f ( ) { } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] =
" void f() \n "
" { \n "
" bool x = true; \n "
" if( !x ) \n "
" { g(); \n "
" } \n "
" } " ;
2011-12-02 23:01:55 +01:00
ASSERT_EQUALS ( " void f ( ) { } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] =
" void f() \n "
" { \n "
" bool x = false; \n "
" if( !x ) \n "
" { g(); \n "
" } \n "
" } " ;
2011-12-02 23:01:55 +01:00
ASSERT_EQUALS ( " void f ( ) { g ( ) ; } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] = " void f() \n "
" { \n "
" if (5==5); \n "
" } \n " ;
2011-11-12 12:01:31 +01:00
ASSERT_EQUALS ( " void f ( ) { ; } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] = " void f() \n "
" { \n "
" if (4<5); \n "
" } \n " ;
2011-11-12 12:01:31 +01:00
ASSERT_EQUALS ( " void f ( ) { ; } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] = " void f() \n "
" { \n "
" if (5<5); \n "
" } \n " ;
ASSERT_EQUALS ( " void f ( ) { } " , tok ( code ) ) ;
}
{
const char code [ ] = " void f() \n "
" { \n "
" if (13>12?true:false); \n "
" } \n " ;
2011-11-12 12:01:31 +01:00
ASSERT_EQUALS ( " void f ( ) { ; } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
}
2014-11-20 14:20:09 +01:00
void simplify_condition ( ) {
2011-03-06 21:07:06 +01:00
{
const char code [ ] =
" void f(int a) \n "
" { \n "
" if (a && false) g(); \n "
" } " ;
ASSERT_EQUALS ( " void f ( int a ) { } " , tok ( code ) ) ;
}
{
const char code [ ] =
" void f(int a) \n "
" { \n "
" if (false && a) g(); \n "
" } " ;
ASSERT_EQUALS ( " void f ( int a ) { } " , tok ( code ) ) ;
}
{
const char code [ ] =
" void f(int a) \n "
" { \n "
" if (true || a) g(); \n "
" } " ;
2011-11-12 12:01:31 +01:00
ASSERT_EQUALS ( " void f ( int a ) { g ( ) ; } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] =
" void f(int a) \n "
" { \n "
" if (a || true) g(); \n "
" } " ;
2011-11-12 12:01:31 +01:00
ASSERT_EQUALS ( " void f ( int a ) { g ( ) ; } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2012-01-26 23:12:01 +01:00
{
const char code [ ] =
" void f(int a) \n "
" { \n "
" if (a || true || b) g(); \n "
" } " ;
ASSERT_EQUALS ( " void f ( int a ) { g ( ) ; } " , tok ( code ) ) ;
}
{
const char code [ ] =
" void f(int a) \n "
" { \n "
" if (a && false && b) g(); \n "
" } " ;
ASSERT_EQUALS ( " void f ( int a ) { } " , tok ( code ) ) ;
}
{
const char code [ ] =
" void f(int a) \n "
" { \n "
" if (a || (b && false && c) || d) g(); \n "
" } " ;
ASSERT_EQUALS ( " void f ( int a ) { if ( a || d ) { g ( ) ; } } " , tok ( code ) ) ;
}
{
const char code [ ] =
" void f(int a) \n "
" { \n "
" if ((a && b) || true || (c && d)) g(); \n "
" } " ;
ASSERT_EQUALS ( " void f ( int a ) { g ( ) ; } " , tok ( code ) ) ;
}
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void pointeralias1 ( ) {
2011-03-06 21:07:06 +01:00
{
const char code [ ] = " void f() \n "
" { \n "
" char buf[100]; \n "
" char *p = buf; \n "
" free(p); \n "
" } \n " ;
const char expected [ ] = " void f ( ) "
" { "
" char buf [ 100 ] ; "
" free ( buf ) ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
{
const char code [ ] = " void f(char *p1) \n "
" { \n "
" char *p = p1; \n "
" p1 = 0; "
" x(p); \n "
" } \n " ;
const char expected [ ] = " void f ( char * p1 ) "
" { "
" char * p ; p = p1 ; "
" p1 = 0 ; "
" x ( p ) ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
{
const char code [ ] = " void foo(Result* ptr) \n "
" { \n "
" Result* obj = ptr; \n "
" ++obj->total; \n "
" } \n " ;
const char expected [ ] = " void foo ( Result * ptr ) "
" { "
" Result * obj ; obj = ptr ; "
" ++ obj . total ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
{
const char code [ ] = " int *foo() \n "
" { \n "
" int a[10]; \n "
" int *b = a; \n "
" return b; \n "
" } \n " ;
const char expected [ ] = " int * foo ( ) "
" { "
" int a [ 10 ] ; "
" return a ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
{
const char code [ ] = " void f() { \n "
" int a[10]; \n "
" int *b = a; \n "
" memset(b,0,sizeof(a)); \n "
" } " ;
const char expected [ ] = " void f ( ) { "
" int a [ 10 ] ; "
" memset ( a , 0 , 40 ) ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
}
2014-11-20 14:20:09 +01:00
void pointeralias2 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " void f() \n "
" { \n "
" int i; \n "
" int *p = &i; \n "
" return *p; \n "
" } \n " ;
ASSERT_EQUALS ( " void f ( ) { int i ; return i ; } " , tok ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void pointeralias3 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " void f() \n "
" { \n "
" int i, j, *p; \n "
" if (ab) p = &i; \n "
" else p = &j; \n "
" *p = 0; \n "
" } \n " ;
const char expected [ ] = " void f ( ) "
" { "
" int i ; int j ; int * p ; "
" if ( ab ) { p = & i ; } "
" else { p = & j ; } "
" * p = 0 ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void pointeralias4 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " void f() \n "
" { \n "
" int a[10]; \n "
" int *p = &a[0]; \n "
" *p = 0; \n "
" } \n " ;
const char expected [ ] = " void f ( ) "
" { "
" int a [ 10 ] ; "
" * a = 0 ; "
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void pointeralias5 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " int f() \n "
" { \n "
" int i; \n "
" int *p = &i; \n "
" *p = 5; \n "
" return i; \n "
" } \n " ;
const char expected [ ] = " int f ( ) "
" { "
2011-12-02 23:01:55 +01:00
" return 5 ; "
2011-03-06 21:07:06 +01:00
" } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void reduceConstness ( ) {
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " char * p ; " , tok ( " char * const p; " ) ) ;
}
2014-11-20 14:20:09 +01:00
void while0 ( ) {
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " ; x = 1 ; " , tok ( " ; do { x = 1 ; } while (0); " ) ) ;
2011-10-19 18:20:29 +02:00
ASSERT_EQUALS ( " ; return 0 ; " , tok ( " ; do { return 0; } while (0); " ) ) ;
ASSERT_EQUALS ( " void foo ( ) { goto label ; } " , tok ( " void foo() { do { goto label; } while (0); } " ) ) ;
ASSERT_EQUALS ( " ; { continue ; } " , tok ( " ; do { continue ; } while (0); " ) ) ;
ASSERT_EQUALS ( " ; { break ; } " , tok ( " ; do { break; } while (0); " ) ) ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " ; " , tok ( " ; while (false) { a; } " ) ) ;
2011-10-19 18:49:02 +02:00
ASSERT_EQUALS ( " ; " , tok ( " ; while (false) { switch (n) { case 0: return; default: break; } n*=1; } " ) ) ;
2011-10-10 15:13:47 +02:00
}
2011-03-06 21:07:06 +01:00
2014-11-20 14:20:09 +01:00
void while0for ( ) {
2011-03-06 21:07:06 +01:00
// for (condition is always false)
2011-12-02 23:01:55 +01:00
ASSERT_EQUALS ( " void f ( ) { } " , tok ( " void f() { int i; for (i = 0; i < 0; i++) { a; } } " ) ) ;
2011-10-10 15:13:47 +02:00
//ticket #3140
2011-12-02 23:01:55 +01:00
ASSERT_EQUALS ( " void f ( ) { } " , tok ( " void f() { int i; for (i = 0; i < 0; i++) { foo(); break; } } " ) ) ;
ASSERT_EQUALS ( " void f ( ) { } " , tok ( " void f() { int i; for (i = 0; i < 0; i++) { foo(); continue; } } " ) ) ;
2011-10-10 15:13:47 +02:00
ASSERT_EQUALS ( " void f ( ) { } " , tok ( " void f() { for (int i = 0; i < 0; i++) { a; } } " ) ) ;
ASSERT_EQUALS ( " void f ( ) { } " , tok ( " void f() { for (unsigned int i = 0; i < 0; i++) { a; } } " ) ) ;
ASSERT_EQUALS ( " void f ( ) { } " , tok ( " void f() { for (long long i = 0; i < 0; i++) { a; } } " ) ) ;
ASSERT_EQUALS ( " void f ( ) { } " , tok ( " void f() { for (signed long long i = 0; i < 0; i++) { a; } } " ) ) ;
2014-09-26 10:46:49 +02:00
ASSERT_EQUALS ( " void f ( ) { } " , tok ( " void f() { int n = 0; for (signed long long i = 0; i < n; i++) { a; } } " ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void while1 ( ) {
2011-03-06 21:07:06 +01:00
// ticket #1197
const char code [ ] = " void do {} while (0) { } " ;
const char expected [ ] = " void { } " ;
ASSERT_EQUALS ( expected , tok ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum1 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum A { a, b, c }; A c1 = c; " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " int c1 ; c1 = 2 ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum2 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum A { a, }; int array[a]; " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " int array [ 0 ] ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum3 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum { a, }; int array[a]; " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " int array [ 0 ] ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum4 ( ) {
2011-03-06 21:07:06 +01:00
{
const char code [ ] = " class A { \n "
" public: \n "
" enum EA { a1, a2, a3 }; \n "
" EA get() const; \n "
" void put(EA a) { ea = a; ea = a1; } \n "
" private: \n "
" EA ea; \n "
" }; \n "
" A::EA A::get() const { return ea; } \n "
" A::EA e = A::a1; " ;
const char expected [ ] = " class A { "
" public: "
2011-12-04 18:08:35 +01:00
" "
2011-03-06 21:07:06 +01:00
" int get ( ) const ; "
" void put ( int a ) { ea = a ; ea = 0 ; } "
" private: "
" int ea ; "
" } ; "
" int A :: get ( ) const { return ea ; } "
" int e ; e = 0 ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct A { \n "
" enum EA { a1, a2, a3 }; \n "
" EA get() const; \n "
" void put(EA a) { ea = a; ea = a1; } \n "
" EA ea; \n "
" }; \n "
" A::EA A::get() const { return ea; } \n "
" A::EA e = A::a1; " ;
const char expected [ ] = " struct A { "
2011-12-04 18:08:35 +01:00
" "
2011-03-06 21:07:06 +01:00
" int get ( ) const ; "
" void put ( int a ) { ea = a ; ea = 0 ; } "
" int ea ; "
" } ; "
" int A :: get ( ) const { return ea ; } "
" int e ; e = 0 ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
}
2014-11-20 14:20:09 +01:00
void enum5 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum ABC { \n "
" a = sizeof(int), \n "
" b = 1 + a, \n "
" c = b + 100, \n "
" d, \n "
" e, \n "
" f = 90, \n "
" g \n "
" }; \n "
" int sum = a + b + c + d + e + f + g; " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " int sum ; sum = "
2011-03-06 21:07:06 +01:00
" sizeof ( int ) + "
2013-11-20 18:04:28 +01:00
" ( 1 + sizeof ( int ) ) + "
" ( 1 + sizeof ( int ) + 100 ) + " // 101 = 100 + 1
" ( 1 + sizeof ( int ) + 101 ) + " // 102 = 100 + 1 + 1
" ( 1 + sizeof ( int ) + 102 ) + 181 " // 283 = 100+2+90+91
2012-09-08 10:15:37 +02:00
" ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
2011-12-04 18:08:35 +01:00
ASSERT_EQUALS ( " int sum ; sum = 508 ; " , tok ( code , true ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void enum6 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum { a = MAC(A, B, C) }; void f(a) { } " ;
2012-09-21 16:17:20 +02:00
const char expected [ ] = " void f ( a ) { } " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum7 ( ) {
2011-03-06 21:07:06 +01:00
{
// ticket 1388
const char code [ ] = " enum FOO {A,B,C}; \n "
" int main() \n "
" { \n "
" int A = B; \n "
" { float A = C; } \n "
" } " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " int main ( ) "
2011-03-06 21:07:06 +01:00
" { "
" int A ; A = 1 ; "
" { float A ; A = 2 ; } "
" } " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " enum FOO {A,B,C}; \n "
" void f(int A, float B, char C) { } " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " void f ( int A , float B , char C ) { } " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
}
// Check simplifyEnum
2014-11-20 14:20:09 +01:00
std : : string checkSimplifyEnum ( const char code [ ] , bool cpp = true ) {
2011-03-06 21:07:06 +01:00
errout . str ( " " ) ;
// Tokenize..
Settings settings ;
2011-08-07 09:28:08 +02:00
settings . addEnabled ( " style " ) ;
2011-03-06 21:07:06 +01:00
Tokenizer tokenizer ( & settings , this ) ;
std : : istringstream istr ( code ) ;
2014-03-18 16:22:00 +01:00
tokenizer . tokenize ( istr , cpp ? " test.cpp " : " test.c " ) ;
2012-04-17 09:51:08 +02:00
return tokenizer . tokens ( ) - > stringifyList ( 0 , true ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void enum8 ( ) {
2011-03-06 21:07:06 +01:00
// ticket 1388
checkSimplifyEnum ( " enum Direction {N=100,E,S,W,ALL}; \n "
" template<class T,int S> class EF_Vector{ \n "
" T v_v[S]; \n "
" \n "
" public: \n "
" EF_Vector(); \n "
" explicit EF_Vector(const T &); \n "
" explicit EF_Vector(const T arr[S]); \n "
" }; \n "
" \n "
" template<class T,int S> \n "
" EF_Vector<T,S>::EF_Vector() \n "
" { \n "
" } \n "
" \n "
" template<class T,int S> \n "
" EF_Vector<T,S>::EF_Vector(const T &t) \n "
" { \n "
" for(int i=0;i<S;i++) \n "
" v_v[i]=t; \n "
" } \n "
" \n "
" template<class T,int S> \n "
" EF_Vector<T,S>::EF_Vector(const T arr[S]) \n "
" { \n "
" for(int i=0;i<S;i++) \n "
" v_v[i]=arr[i]; \n "
" } \n "
" \n "
" void initialize() \n "
" { \n "
" EF_Vector<float,6> d; \n "
" } " ) ;
ASSERT_EQUALS ( " [test.cpp:2] -> [test.cpp:1]: (style) Template parameter 'S' hides enumerator with same name \n "
" [test.cpp:11] -> [test.cpp:1]: (style) Template parameter 'S' hides enumerator with same name \n "
" [test.cpp:16] -> [test.cpp:1]: (style) Template parameter 'S' hides enumerator with same name \n "
" [test.cpp:23] -> [test.cpp:1]: (style) Template parameter 'S' hides enumerator with same name \n " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum9 ( ) {
2011-03-06 21:07:06 +01:00
// ticket 1404
checkSimplifyEnum ( " class XX { \n "
" public: \n "
" static void Set(const int &p){m_p=p;} \n "
" static int m_p; \n "
" }; \n "
" int XX::m_p=0; \n "
" int main() { \n "
" enum { XX }; \n "
" XX::Set(std::numeric_limits<X>::digits()); \n "
" } " ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum10 ( ) {
2011-03-06 21:07:06 +01:00
// ticket 1445
const char code [ ] = " enum { \n "
2012-12-06 19:19:22 +01:00
" SHELL_SIZE = sizeof(union { int i; char *cp; double d; }) - 1, \n "
2011-03-06 21:07:06 +01:00
" } e = SHELL_SIZE; " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " int e ; e = sizeof ( union { int i ; char * cp ; double d ; } ) - 1 ; " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum11 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " int main() \n "
" { \n "
" enum { u, v }; \n "
" A u = 1, v = 2; \n "
" } " ;
const char expected [ ] = " int main ( ) "
" { "
2011-12-04 18:08:35 +01:00
" "
2011-03-06 21:07:06 +01:00
" A u ; u = 1 ; A v ; v = 2 ; "
" } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " [test.cpp:4] -> [test.cpp:3]: (style) Variable 'u' hides enumerator with same name \n "
" [test.cpp:4] -> [test.cpp:3]: (style) Variable 'v' hides enumerator with same name \n " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum12 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum fred { a, b }; \n "
" void foo() \n "
" { \n "
" unsigned int fred = 0; \n "
" } " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " void foo ( ) { unsigned int fred ; fred = 0 ; } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void enum13 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum ab { ENTRY(1, a = 0), ENTRY(2, b) }; \n "
" void foo() \n "
" { \n "
" unsigned int fred = a; \n "
" } " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " void foo ( ) { unsigned int fred ; fred = a ; } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void enum14 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum ab { a }; \n "
" ab " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " ab " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void enum15 ( ) { // C++0x features
2011-03-06 21:07:06 +01:00
{
const char code [ ] = " enum : char { a = 99 }; \n "
" char c1 = a; " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " char c1 ; c1 = 99 ; " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] = " enum class Enum1 { a }; \n "
2014-03-16 18:24:46 +01:00
" Enum1 e1 = Enum1::a; " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " int e1 ; e1 = 0 ; " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-03-16 18:24:46 +01:00
{
const char code [ ] = " enum class Enum1 { a }; \n "
" Enum1 e1 = a; " ;
const char expected [ ] = " int e1 ; e1 = a ; " ;
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
}
2011-03-06 21:07:06 +01:00
{
const char code [ ] = " enum Enum1 : char { a }; \n "
" Enum1 e1 = a; " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " char e1 ; e1 = 0 ; " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] = " enum class Enum1 : unsigned char { a }; \n "
2014-03-16 18:24:46 +01:00
" Enum1 e1 = Enum1::a; " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " unsigned char e1 ; e1 = 0 ; " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] = " enum class Enum1 : unsigned int { a }; \n "
2014-03-16 18:24:46 +01:00
" Enum1 e1 = Enum1::a; " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " unsigned int e1 ; e1 = 0 ; " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] = " enum class Enum1 : unsigned long long int { a }; \n "
2014-03-16 18:24:46 +01:00
" Enum1 e1 = Enum1::a; " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " unsigned long long e1 ; e1 = 0 ; " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-03-18 16:22:00 +01:00
{
const char code [ ] = " enum class { A }; \n "
" int i = A; " ;
const char expected [ ] = " int i ; i = 0 ; " ;
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code , false ) ) ; // Compile as C code: enum has name 'class'
checkSimplifyEnum ( code , true ) ; // Compile as C++ code: Don't crash
}
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void enum16 ( ) { // ticket #1988
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum D : auto * { FF = 0 }; " ;
2014-03-27 13:15:21 +01:00
ASSERT_THROW ( checkSimplifyEnum ( code ) , InternalError ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void enum17 ( ) { // ticket #2381
2011-03-06 21:07:06 +01:00
// if header is included twice its enums will be duplicated
const char code [ ] = " enum ab { a=0, b }; "
" enum ab { a=0, b }; \n " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " ; " , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum18 ( ) { // ticket #2466 - array with same name as enum constant
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum ab { a=0, b }; \n "
" void f() { a[0]; } \n " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " void f ( ) { a [ 0 ] ; } " , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void enum19 ( ) { // ticket #2536
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum class E1; \n "
" enum class E2 : int; \n " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " ; " , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void enum20 ( ) { // ticket #2600 segmentation fault
2011-03-06 21:07:06 +01:00
const char code [ ] = " enum { const } \n " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " " , checkSimplifyEnum ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void enum21 ( ) { // ticket #2720 syntax error
2011-04-15 01:50:17 +02:00
const char code [ ] = " enum E2 : signed const short { }; \n " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " ; " , checkSimplifyEnum ( code ) ) ;
2011-04-15 01:50:17 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum22 ( ) { // ticket #2745
2011-04-24 04:08:03 +02:00
const char code [ ] = " enum en { x = 0 }; \n "
" void f() { \n "
" int x = 0; \n "
" g(x); \n "
" } \n "
" void f2(int &x) { \n "
" x+=1; \n "
" } \n " ;
checkSimplifyEnum ( code ) ;
2013-06-04 18:57:46 +02:00
ASSERT_EQUALS ( " [test.cpp:3] -> [test.cpp:1]: (style) Variable 'x' hides enumerator with same name \n "
" [test.cpp:6] -> [test.cpp:1]: (style) Function argument 'x' hides enumerator with same name \n " ,
errout . str ( ) ) ;
2013-06-04 21:18:20 +02:00
// avoid false positive: in other scope
const char code2 [ ] = " class C1 { enum en { x = 0 }; }; \n "
2013-06-05 22:19:37 +02:00
" class C2 { bool x; }; \n " ;
2013-06-04 21:18:20 +02:00
checkSimplifyEnum ( code2 ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
// avoid false positive: inner if-scope
const char code3 [ ] = " enum en { x = 0 }; \n "
2013-06-05 22:19:37 +02:00
" void f() { if (aa) ; else if (bb==x) df; } \n " ;
2013-06-04 21:18:20 +02:00
checkSimplifyEnum ( code3 ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
2011-04-24 04:08:03 +02:00
}
2014-11-20 14:20:09 +01:00
void enum23 ( ) { // ticket #2804
2011-05-27 17:17:39 +02:00
const char code [ ] = " enum Enumerator : std::uint8_t { ITEM1, ITEM2, ITEM3 }; \n "
" Enumerator e = ITEM3; \n " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " std :: uint8_t e ; e = 2 ; " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-05-27 17:17:39 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum24 ( ) { // ticket #2828
2011-06-09 02:14:52 +02:00
const char code [ ] = " enum EnumName { STYLE = 0x0001 }; \n "
" void f(long style) { \n "
" if (style & STYLE) { } \n "
" } \n " ;
2011-12-04 18:08:35 +01:00
const char expected [ ] = " void f ( long style ) { if ( style & 1 ) { } } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( expected , checkSimplifyEnum ( code ) ) ;
2011-06-09 02:14:52 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum25 ( ) { // ticket #2966 (segmentation fault)
2011-08-06 00:07:18 +02:00
const char code [ ] = " enum x : \n " ;
2014-03-27 13:15:21 +01:00
ASSERT_THROW ( checkSimplifyEnum ( code ) , InternalError ) ;
2011-08-06 00:07:18 +02:00
}
2014-11-20 14:20:09 +01:00
void enum26 ( ) { // ticket #2975 (segmentation fault)
2011-08-07 22:48:47 +02:00
const char code [ ] = " enum E {} e enum \n " ;
2012-04-17 09:51:08 +02:00
checkSimplifyEnum ( code ) ;
2011-08-07 22:48:47 +02:00
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum27 ( ) { // ticket #3005 (segmentation fault)
2011-08-15 13:07:12 +02:00
const char code [ ] = " enum : x \n " ;
2014-03-27 13:15:21 +01:00
ASSERT_THROW ( checkSimplifyEnum ( code ) , InternalError ) ;
2011-08-15 13:07:12 +02:00
}
2014-11-20 14:20:09 +01:00
void enum28 ( ) {
2011-10-22 13:43:53 +02:00
const char code [ ] = " enum { x=0 }; \n "
2012-12-06 19:19:22 +01:00
" void f() { char x[4]; memset(x, 0, 4); \n "
2011-10-22 13:43:53 +02:00
" { x } }; \n "
" void g() { x; } " ;
2012-04-17 09:51:08 +02:00
ASSERT_EQUALS ( " void f ( ) { char x [ 4 ] ; memset ( x , 0 , 4 ) ; { x } } ; void g ( ) { 0 ; } " , checkSimplifyEnum ( code ) ) ;
2011-10-22 13:43:53 +02:00
}
2014-11-20 14:20:09 +01:00
void enum29 ( ) { // #3747 - bitwise or value
2012-05-16 18:48:33 +02:00
const char code [ ] = " enum { x=1, y=x|2 }; i = (3==y); " ;
2012-09-09 16:22:39 +02:00
ASSERT_EQUALS ( " i = 3 == 3 ; " , checkSimplifyEnum ( code ) ) ;
2012-05-16 18:48:33 +02:00
}
2014-11-20 14:20:09 +01:00
void enum30 ( ) { // #3852 - false positive
2014-03-16 18:24:46 +01:00
const char code [ ] = " class TestIf \n "
" { \n "
" public: \n "
" enum class Foo \n "
" { \n "
" one = 0, \n "
" two = 1 \n "
" }; \n "
" enum class Bar \n "
" { \n "
" one = 0, \n "
" two = 1 \n "
" }; \n "
" }; \n "
" int main() { "
" return TestIf::Bar::two; \n "
" } " ;
ASSERT_EQUALS ( " class TestIf { public: } ; int main ( ) { return 1 ; } " , checkSimplifyEnum ( code ) ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
2012-05-29 13:20:51 +02:00
}
2014-11-20 14:20:09 +01:00
void enum31 ( ) { // #3934 - calculation in first item
2012-09-08 12:42:24 +02:00
const char code [ ] = " enum { x=2*32, y }; i = y; " ;
ASSERT_EQUALS ( " i = 65 ; " , checkSimplifyEnum ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum32 ( ) { // #3998 - wrong enum simplification => access violation
2012-09-08 12:42:24 +02:00
const char code [ ] = " enum { x=(32), y=x, z }; { a, z } " ;
2013-11-20 18:04:28 +01:00
ASSERT_EQUALS ( " { a , ( 33 ) } " , checkSimplifyEnum ( code ) ) ;
2012-09-08 12:42:24 +02:00
}
2014-11-20 14:20:09 +01:00
void enum33 ( ) { // #4015 - segmentation fault
2012-09-08 12:42:24 +02:00
const char code [ ] = " enum { A=SOME_VALUE, B=A }; " ;
ASSERT_EQUALS ( " ; " , checkSimplifyEnum ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum34 ( ) { // #4141 - division by zero
2012-09-09 12:38:15 +02:00
const char code [ ] = " enum { A=1/0 }; " ;
ASSERT_EQUALS ( " ; " , checkSimplifyEnum ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum35 ( ) { // #3953 - avoid simplification of type
2012-09-21 16:17:20 +02:00
ASSERT_EQUALS ( " void f ( A * a ) ; " , checkSimplifyEnum ( " enum { A }; void f(A * a) ; " ) ) ;
ASSERT_EQUALS ( " void f ( A * a ) { } " , checkSimplifyEnum ( " enum { A }; void f(A * a) { } " ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum36 ( ) { // #4378
2012-12-02 07:22:55 +01:00
const char code [ ] = " struct X { enum Y { a, b }; X(Y) { Y y = (Y)1; } }; " ;
ASSERT_EQUALS ( " struct X { X ( int ) { int y ; y = ( int ) 1 ; } } ; " , checkSimplifyEnum ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum37 ( ) { // #4280 - shadow variables
2013-06-04 06:51:01 +02:00
const char code1 [ ] = " enum { a, b }; void f(int a) { return a + 1; } " ;
ASSERT_EQUALS ( " void f ( int a ) { return a + 1 ; } " , checkSimplifyEnum ( code1 ) ) ;
const char code2 [ ] = " enum { a, b }; void f() { int a; } " ;
ASSERT_EQUALS ( " void f ( ) { int a ; } " , checkSimplifyEnum ( code2 ) ) ;
const char code3 [ ] = " enum { a, b }; void f() { int *a=do_something(); } " ;
ASSERT_EQUALS ( " void f ( ) { int * a ; a = do_something ( ) ; } " , checkSimplifyEnum ( code3 ) ) ;
const char code4 [ ] = " enum { a, b }; void f() { int &a=x; } " ;
ASSERT_EQUALS ( " void f ( ) { int & a = x ; } " , checkSimplifyEnum ( code4 ) ) ;
2013-06-16 08:13:41 +02:00
// #4857 - not shadow variable
checkSimplifyEnum ( " enum { a,b }; void f() { if (x) { } else if ( x & a ) {} } " ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
2013-06-03 19:18:51 +02:00
}
2014-11-20 14:20:09 +01:00
void enum38 ( ) { // #4463
2013-06-12 06:45:26 +02:00
const char code [ ] = " enum { a,b }; void f() { throw a; } " ;
checkSimplifyEnum ( code ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum39 ( ) { // #5145 - fp variable hides enum
2013-11-03 09:34:48 +01:00
const char code [ ] = " enum { A }; void f() { int a = 1 * A; } " ;
checkSimplifyEnum ( code ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum40 ( ) {
2013-11-20 18:04:28 +01:00
const char code [ ] = " enum { A=(1<<0)|(1<<1) }; void f() { x = y + A; } " ;
ASSERT_EQUALS ( " void f ( ) { x = y + ( 3 ) ; } " , checkSimplifyEnum ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum41 ( ) { // ticket #5212 (valgrind errors during enum simplification)
2013-12-15 07:47:04 +01:00
const char code [ ] = " namespace Foo { \n "
" enum BarConfig { \n "
" eBitOne = (1 << 0), \n "
" eBitTwo = (1 << 1), \n "
" eAll = eBitOne|eBitTwo \n "
" }; \n "
" } \n "
" int x = Foo::eAll; " ;
ASSERT_EQUALS ( " int x ; x = ( 1 ) | 2 ; " , checkSimplifyEnum ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum42 ( ) { // ticket #5182 (template function call in template value)
2013-12-16 07:07:00 +01:00
const char code [ ] = " enum { A = f<int,2>() }; \n "
" a = A; " ;
ASSERT_EQUALS ( " a = f < int , 2 > ( ) ; " , checkSimplifyEnum ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void enum43 ( ) { // lhs in assignment
2014-04-23 17:10:17 +02:00
const char code [ ] = " enum { A, B }; \n "
" A = 1; " ;
ASSERT_EQUALS ( " A = 1 ; " , checkSimplifyEnum ( code ) ) ;
}
2014-11-20 14:20:09 +01:00
void enumscope1 ( ) { // #3949 - don't simplify enum from one function in another function
2012-09-08 12:42:24 +02:00
const char code [ ] = " void foo() { enum { A = 0, B = 1 }; } \n "
" void bar() { int a = A; } " ;
ASSERT_EQUALS ( " void foo ( ) { } void bar ( ) { int a ; a = A ; } " , checkSimplifyEnum ( code ) ) ;
}
2012-08-06 16:21:21 +02:00
2014-11-20 14:20:09 +01:00
void duplicateDefinition ( ) { // #3565 - wrongly detects duplicate definition
2012-09-19 19:19:13 +02:00
const Settings settings ;
2013-03-12 15:42:00 +01:00
Tokenizer tokenizer ( & settings , this ) ;
2012-09-19 19:19:13 +02:00
std : : istringstream istr ( " x ; return a not_eq x; " ) ;
tokenizer . tokenize ( istr , " test.c " ) ;
2012-09-29 14:10:41 +02:00
Token * x_token = tokenizer . list . front ( ) - > tokAt ( 5 ) ;
2012-09-21 16:17:20 +02:00
ASSERT_EQUALS ( false , tokenizer . duplicateDefinition ( & x_token , tokenizer . tokens ( ) ) ) ;
2012-09-19 19:19:13 +02:00
}
2014-11-20 14:20:09 +01:00
void invalid_enum ( ) { // #5600: missing include causes invalid enum
2014-03-22 19:30:06 +01:00
const char code [ ] = " enum { \n "
" NUM_OPCODES = \n "
// #include "definition"
" }; \n "
" struct bytecode {}; \n "
" jv jq_next() { opcode = ((opcode) +NUM_OPCODES); \n "
" } " ;
2014-03-27 13:15:21 +01:00
ASSERT_THROW ( checkSimplifyEnum ( code ) , InternalError ) ;
2014-03-22 19:30:06 +01:00
}
2014-11-20 14:20:09 +01:00
void removestd ( ) {
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " ; strcpy ( a , b ) ; " , tok ( " ; std::strcpy(a,b); " ) ) ;
ASSERT_EQUALS ( " ; strcat ( a , b ) ; " , tok ( " ; std::strcat(a,b); " ) ) ;
ASSERT_EQUALS ( " ; strncpy ( a , b , 10 ) ; " , tok ( " ; std::strncpy(a,b,10); " ) ) ;
ASSERT_EQUALS ( " ; strncat ( a , b , 10 ) ; " , tok ( " ; std::strncat(a,b,10); " ) ) ;
ASSERT_EQUALS ( " ; free ( p ) ; " , tok ( " ; std::free(p); " ) ) ;
ASSERT_EQUALS ( " ; malloc ( 10 ) ; " , tok ( " ; std::malloc(10); " ) ) ;
}
2014-11-20 14:20:09 +01:00
void simplifyInitVar ( ) {
2011-03-06 21:07:06 +01:00
// ticket #1005 - int *p(0); => int *p = 0;
{
const char code [ ] = " void foo() { int *p(0); } " ;
2011-12-02 23:01:55 +01:00
ASSERT_EQUALS ( " void foo ( ) { } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] = " void foo() { int p(0); } " ;
2011-12-02 23:01:55 +01:00
ASSERT_EQUALS ( " void foo ( ) { } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
{
const char code [ ] = " void a() { foo *p(0); } " ;
2011-12-02 23:01:55 +01:00
ASSERT_EQUALS ( " void a ( ) { } " , tok ( code ) ) ;
2011-03-06 21:07:06 +01:00
}
}
2014-11-20 14:20:09 +01:00
void simplifyReference ( ) {
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " void f ( ) { int a ; a ++ ; } " ,
tok ( " void f() { int a; int &b(a); b++; } " ) ) ;
ASSERT_EQUALS ( " void f ( ) { int a ; a ++ ; } " ,
tok ( " void f() { int a; int &b = a; b++; } " ) ) ;
2014-10-16 11:43:42 +02:00
ASSERT_EQUALS ( " void test ( ) { c . f ( 7 ) ; } " ,
tok ( " void test() { c.f(7); T3 &t3 = c; } " ) ) ; // #6133
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void simplifyRealloc ( ) {
2012-01-27 13:56:06 +01:00
ASSERT_EQUALS ( " ; free ( p ) ; p = 0 ; " , tok ( " ; p = realloc(p, 0); " ) ) ;
ASSERT_EQUALS ( " ; p = malloc ( 100 ) ; " , tok ( " ; p = realloc(0, 100); " ) ) ;
ASSERT_EQUALS ( " ; p = malloc ( 0 ) ; " , tok ( " ; p = realloc(0, 0); " ) ) ;
ASSERT_EQUALS ( " ; free ( q ) ; p = 0 ; " , tok ( " ; p = realloc(q, 0); " ) ) ;
ASSERT_EQUALS ( " ; free ( * q ) ; p = 0 ; " , tok ( " ; p = realloc(*q, 0); " ) ) ;
ASSERT_EQUALS ( " ; free ( f ( z ) ) ; p = 0 ; " , tok ( " ; p = realloc(f(z), 0); " ) ) ;
ASSERT_EQUALS ( " ; p = malloc ( n * m ) ; " , tok ( " ; p = realloc(0, n*m); " ) ) ;
ASSERT_EQUALS ( " ; p = malloc ( f ( 1 ) ) ; " , tok ( " ; p = realloc(0, f(1)); " ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void simplifyErrNoInWhile ( ) {
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " ; while ( f ( ) ) { } " ,
tok ( " ; while (f() && errno == EINTR) { } " ) ) ;
ASSERT_EQUALS ( " ; while ( f ( ) ) { } " ,
tok ( " ; while (f() && (errno == EINTR)) { } " ) ) ;
}
2014-11-20 14:20:09 +01:00
void simplifyFuncInWhile ( ) {
2012-11-26 02:19:35 +01:00
ASSERT_EQUALS ( " int cppcheck:r1 = fclose ( f ) ; "
" while ( cppcheck:r1 ) "
2011-03-06 21:07:06 +01:00
" { "
" foo ( ) ; "
2012-11-26 02:19:35 +01:00
" cppcheck:r1 = fclose ( f ) ; "
2011-03-06 21:07:06 +01:00
" } " ,
tok ( " while(fclose(f))foo(); " ) ) ;
2012-11-26 02:19:35 +01:00
ASSERT_EQUALS ( " int cppcheck:r1 = fclose ( f ) ; "
" while ( cppcheck:r1 ) "
2011-03-06 21:07:06 +01:00
" { "
2012-11-26 02:19:35 +01:00
" ; cppcheck:r1 = fclose ( f ) ; "
2011-03-06 21:07:06 +01:00
" } " ,
tok ( " while(fclose(f)); " ) ) ;
2012-11-26 02:19:35 +01:00
ASSERT_EQUALS ( " int cppcheck:r1 = fclose ( f ) ; "
" while ( cppcheck:r1 ) "
2011-03-06 21:07:06 +01:00
" { "
2012-11-26 02:19:35 +01:00
" ; cppcheck:r1 = fclose ( f ) ; "
2011-03-06 21:07:06 +01:00
" } "
2012-11-26 02:19:35 +01:00
" int cppcheck:r2 = fclose ( g ) ; "
" while ( cppcheck:r2 ) "
2011-03-06 21:07:06 +01:00
" { "
2012-11-26 02:19:35 +01:00
" ; cppcheck:r2 = fclose ( g ) ; "
2011-03-06 21:07:06 +01:00
" } " ,
tok ( " while(fclose(f)); while(fclose(g)); " ) ) ;
}
2014-11-20 14:20:09 +01:00
void initstruct ( ) {
2014-08-26 15:21:19 +02:00
ASSERT_EQUALS ( " ; struct A a ; a . buf = 3 ; " , tok ( " ; struct A a ; a = { .buf = 3 }; " ) ) ;
ASSERT_EQUALS ( " ; struct A a ; a . buf = x ; " , tok ( " ; struct A a ; a = { .buf = x }; " ) ) ;
ASSERT_EQUALS ( " ; struct A a ; a . buf = & key ; " , tok ( " ; struct A a ; a = { .buf = &key }; " ) ) ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " ; struct ABC abc ; abc . a = 3 ; abc . b = x ; abc . c = & key ; " , tok ( " ; struct ABC abc = { .a = 3, .b = x, .c = &key }; " ) ) ;
TODO_ASSERT_EQUALS ( " ; struct A a ; a . buf = { 0 } ; " ,
" ; struct A a ; a = { . buf = { 0 } } ; " ,
tok ( " ; struct A a = { .buf = {0} }; " ) ) ;
}
2014-11-20 14:20:09 +01:00
void simplifyStructDecl1 ( ) {
2011-03-06 21:07:06 +01:00
{
const char code [ ] = " struct ABC { } abc; " ;
2013-01-07 19:20:15 +01:00
const char expected [ ] = " struct ABC { } ; struct ABC abc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct ABC { } * pabc; " ;
2013-01-07 19:20:15 +01:00
const char expected [ ] = " struct ABC { } ; struct ABC * pabc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct ABC { } abc[4]; " ;
2013-01-07 19:20:15 +01:00
const char expected [ ] = " struct ABC { } ; struct ABC abc [ 4 ] ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct ABC { } abc, def; " ;
2013-01-07 19:20:15 +01:00
const char expected [ ] = " struct ABC { } ; struct ABC abc ; struct ABC def ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct ABC { } abc, * pabc; " ;
2013-01-07 19:20:15 +01:00
const char expected [ ] = " struct ABC { } ; struct ABC abc ; struct ABC * pabc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct ABC { struct DEF {} def; } abc; " ;
2013-01-07 19:20:15 +01:00
const char expected [ ] = " struct ABC { struct DEF { } ; struct DEF def ; } ; struct ABC abc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { } abc; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " struct Anonymous0 { } ; struct Anonymous0 abc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { } * pabc; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " struct Anonymous0 { } ; struct Anonymous0 * pabc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { } abc[4]; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " struct Anonymous0 { } ; struct Anonymous0 abc [ 4 ] ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { } abc, def; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " struct Anonymous0 { } ; struct Anonymous0 abc ; struct Anonymous0 def ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { } abc, * pabc; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " struct Anonymous0 { } ; struct Anonymous0 abc ; struct Anonymous0 * pabc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { struct DEF {} def; } abc; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " struct Anonymous0 { struct DEF { } ; struct DEF def ; } ; struct Anonymous0 abc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct ABC { struct {} def; } abc; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " struct ABC { struct Anonymous0 { } ; struct Anonymous0 def ; } ; struct ABC abc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { struct {} def; } abc; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " struct Anonymous0 { struct Anonymous1 { } ; struct Anonymous1 def ; } ; struct Anonymous0 abc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " union ABC { int i; float f; } abc; " ;
2013-01-07 19:20:15 +01:00
const char expected [ ] = " union ABC { int i ; float f ; } ; union ABC abc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct ABC { struct {} def; }; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " struct ABC { struct Anonymous0 { } ; struct Anonymous0 def ; } ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct ABC : public XYZ { struct {} def; }; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " struct ABC : public XYZ { struct Anonymous0 { } ; struct Anonymous0 def ; } ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { int x; }; int y; " ;
const char expected [ ] = " int x ; int y ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { int x; }; " ;
const char expected [ ] = " int x ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { }; " ;
const char expected [ ] = " ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { struct { struct { } ; } ; }; " ;
const char expected [ ] = " ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
// ticket 2464
{
const char code [ ] = " static struct ABC { } abc ; " ;
2013-01-07 19:20:15 +01:00
const char expected [ ] = " struct ABC { } ; static struct ABC abc ; " ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
// ticket #980
{
const char code [ ] = " void f() { int A(1),B(2),C=3,D,E(5),F=6; } " ;
const char expected [ ] = " void f ( ) { int A ; A = 1 ; int B ; B = 2 ; int C ; C = 3 ; int D ; int E ; E = 5 ; int F ; F = 6 ; } " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
}
2014-11-20 14:20:09 +01:00
void simplifyStructDecl2 ( ) { // ticket #2479 (segmentation fault)
2011-03-06 21:07:06 +01:00
const char code [ ] = " struct { char c; } " ;
const char expected [ ] = " struct { char c ; } " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
2014-11-20 14:20:09 +01:00
void simplifyStructDecl3 ( ) {
2011-07-02 15:21:30 +02:00
{
const char code [ ] = " class ABC { } abc; " ;
const char expected [ ] = " class ABC { } ; ABC abc ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class ABC { } * pabc; " ;
const char expected [ ] = " class ABC { } ; ABC * pabc ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class ABC { } abc[4]; " ;
const char expected [ ] = " class ABC { } ; ABC abc [ 4 ] ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class ABC { } abc, def; " ;
const char expected [ ] = " class ABC { } ; ABC abc ; ABC def ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class ABC { } abc, * pabc; " ;
const char expected [ ] = " class ABC { } ; ABC abc ; ABC * pabc ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class ABC { class DEF {} def; } abc; " ;
const char expected [ ] = " class ABC { class DEF { } ; DEF def ; } ; ABC abc ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class { } abc; " ;
const char expected [ ] = " class { } abc ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class { } * pabc; " ;
const char expected [ ] = " class { } * pabc ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class { } abc[4]; " ;
const char expected [ ] = " class { } abc [ 4 ] ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class { } abc, def; " ;
const char expected [ ] = " class { } abc , def ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class { } abc, * pabc; " ;
const char expected [ ] = " class { } abc , * pabc ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " struct { class DEF {} def; } abc; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " struct Anonymous0 { class DEF { } ; DEF def ; } ; struct Anonymous0 abc ; " ;
2011-07-02 15:21:30 +02:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class ABC { struct {} def; } abc; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " class ABC { struct Anonymous0 { } ; struct Anonymous0 def ; } ; ABC abc ; " ;
2011-07-02 15:21:30 +02:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class { class {} def; } abc; " ;
const char expected [ ] = " class { class { } def ; } abc ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class ABC { struct {} def; }; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " class ABC { struct Anonymous0 { } ; struct Anonymous0 def ; } ; " ;
2011-07-02 15:21:30 +02:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class ABC : public XYZ { struct {} def; }; " ;
2013-01-10 18:24:01 +01:00
const char expected [ ] = " class ABC : public XYZ { struct Anonymous0 { } ; struct Anonymous0 def ; } ; " ;
2011-07-02 15:21:30 +02:00
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class { int x; }; int y; " ;
const char expected [ ] = " class { int x ; } ; int y ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class { int x; }; " ;
const char expected [ ] = " class { int x ; } ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class { }; " ;
const char expected [ ] = " class { } ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class { struct { struct { } ; } ; }; " ;
const char expected [ ] = " class { } ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
}
2014-11-20 14:20:09 +01:00
void simplifyStructDecl4 ( ) {
2012-01-31 18:23:02 +01:00
const char code [ ] = " class ABC { \n "
" void foo() { \n "
" union { \n "
" int i; \n "
" float f; \n "
" }; \n "
" struct Fee { } fee; \n "
" } \n "
" union { \n "
" long long ll; \n "
" double d; \n "
" }; \n "
" } abc; \n " ;
const char expected [ ] = " class ABC { "
" void foo ( ) { "
" int i ; "
" float & f = i ; "
2013-01-07 19:20:15 +01:00
" struct Fee { } ; struct Fee fee ; "
2012-01-31 18:23:02 +01:00
" } "
" union { "
" long long ll ; "
" double d ; "
" } ; "
" } ; ABC abc ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
2014-11-20 14:20:09 +01:00
void simplifyStructDecl5 ( ) {
2012-01-31 18:23:02 +01:00
const char code [ ] = " <class T> \n "
" { \n "
" struct { \n "
" typename D4:typename Base<T*> \n "
" }; \n "
" }; \n " ;
//don't crash
tok ( code , false ) ;
2011-07-03 14:14:51 +02:00
}
2014-11-20 14:20:09 +01:00
void simplifyStructDecl6 ( ) {
2012-09-08 10:51:31 +02:00
ASSERT_EQUALS ( " struct A { "
" char integers [ X ] ; "
2013-01-07 19:20:15 +01:00
" } ; struct A arrays ; arrays = { { 0 } } ; " ,
2012-09-08 10:51:31 +02:00
tok ( " struct A { \n "
" char integers[X]; \n "
" } arrays = {{0}}; " , false ) ) ;
}
2014-11-20 14:20:09 +01:00
void simplifyStructDecl7 ( ) {
2013-01-10 18:24:01 +01:00
ASSERT_EQUALS ( " struct Anonymous0 { char x ; } ; struct Anonymous0 a [ 2 ] ; " ,
tok ( " struct { char x; } a[2]; " , false ) ) ;
ASSERT_EQUALS ( " struct Anonymous0 { char x ; } ; static struct Anonymous0 a [ 2 ] ; " ,
tok ( " static struct { char x; } a[2]; " , false ) ) ;
}
2014-11-20 14:20:09 +01:00
void removeUnwantedKeywords ( ) {
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " int var ; " , tok ( " register int var ; " , true ) ) ;
ASSERT_EQUALS ( " short var ; " , tok ( " register short int var ; " , true ) ) ;
ASSERT_EQUALS ( " int foo ( ) { } " , tok ( " inline int foo ( ) { } " , true ) ) ;
ASSERT_EQUALS ( " int foo ( ) { } " , tok ( " __inline int foo ( ) { } " , true ) ) ;
ASSERT_EQUALS ( " int foo ( ) { } " , tok ( " __forceinline int foo ( ) { } " , true ) ) ;
2012-11-09 19:53:10 +01:00
ASSERT_EQUALS ( " int foo ( ) { } " , tok ( " constexpr int foo() { } " , true ) ) ;
2012-11-11 13:32:19 +01:00
ASSERT_EQUALS ( " class C { int f ( ) ; } ; " , tok ( " class C { int f() override ; }; " , true ) ) ;
ASSERT_EQUALS ( " class C { int f ( ) ; } ; " , tok ( " class C { int f() final ; }; " , true ) ) ;
2013-02-10 23:54:15 +01:00
ASSERT_EQUALS ( " void f ( ) { int final [ 10 ] ; } " , tok ( " void f() { int final[10]; } " , true ) ) ;
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " if ( a ) { } " , tok ( " if ( likely ( a ) ) { } " , true ) ) ;
ASSERT_EQUALS ( " if ( a ) { } " , tok ( " if ( unlikely ( a ) ) { } " , true ) ) ;
2012-06-10 21:52:32 +02:00
ASSERT_EQUALS ( " int * p ; " , tok ( " int * __restrict p; " , " test.c " ) ) ;
ASSERT_EQUALS ( " int * * p ; " , tok ( " int * __restrict__ * p; " , " test.c " ) ) ;
ASSERT_EQUALS ( " void foo ( float * a , float * b ) ; " , tok ( " void foo(float * __restrict__ a, float * __restrict__ b); " , " test.c " ) ) ;
ASSERT_EQUALS ( " int * p ; " , tok ( " int * restrict p; " , " test.c " ) ) ;
ASSERT_EQUALS ( " int * * p ; " , tok ( " int * restrict * p; " , " test.c " ) ) ;
ASSERT_EQUALS ( " void foo ( float * a , float * b ) ; " , tok ( " void foo(float * restrict a, float * restrict b); " , " test.c " ) ) ;
ASSERT_EQUALS ( " int * p ; " , tok ( " typedef int * __restrict__ rint; rint p; " , " test.c " ) ) ;
2014-08-01 17:19:08 +02:00
// don't remove struct members:
ASSERT_EQUALS ( " a = b . _inline ; " , tok ( " a = b._inline; " , true ) ) ;
2014-09-02 11:21:47 +02:00
ASSERT_EQUALS ( " int i ; i = 0 ; " , tok ( " auto int i = 0; " , " test.c " ) ) ;
ASSERT_EQUALS ( " auto i ; i = 0 ; " , tok ( " auto i = 0; " , " test.cpp " ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void simplifyCallingConvention ( ) {
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __cdecl f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __stdcall f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __fastcall f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __clrcall f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __thiscall f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __syscall f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __pascal f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __fortran f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __far __cdecl f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __far __stdcall f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __far __fastcall f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __far __clrcall f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __far __thiscall f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __far __syscall f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __far __pascal f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int __far __fortran f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int WINAPI f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int APIENTRY f(); " , true ) ) ;
ASSERT_EQUALS ( " int f ( ) ; " , tok ( " int CALLBACK f(); " , true ) ) ;
}
2014-11-20 14:20:09 +01:00
void simplifyFunctorCall ( ) {
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " IncrementFunctor ( ) ( a ) ; " , tok ( " IncrementFunctor()(a); " , true ) ) ;
}
2014-01-12 15:15:09 +01:00
// #ticket #5339 (simplify function pointer after comma)
2014-11-20 14:20:09 +01:00
void simplifyFunctionPointer ( ) {
2014-01-12 15:15:09 +01:00
ASSERT_EQUALS ( " f ( double x , double * y ) ; " , tok ( " f (double x, double (*y) ()); " , true ) ) ;
}
2014-11-20 14:20:09 +01:00
void redundant_semicolon ( ) {
2011-03-06 21:07:06 +01:00
ASSERT_EQUALS ( " void f ( ) { ; } " , tok ( " void f() { ; } " , false ) ) ;
ASSERT_EQUALS ( " void f ( ) { ; } " , tok ( " void f() { do { ; } while (0); } " , true ) ) ;
}
2014-11-20 14:20:09 +01:00
void simplifyFunctionReturn ( ) {
2014-03-27 11:04:31 +01:00
{
const char code [ ] = " typedef void (*testfp)(); \n "
" struct Fred \n "
" { \n "
" testfp get1() { return 0; } \n "
" void ( * get2 ( ) ) ( ) { return 0 ; } \n "
" testfp get3(); \n "
" void ( * get4 ( ) ) ( ); \n "
" }; " ;
const char expected [ ] = " struct Fred "
" { "
2014-04-12 16:06:31 +02:00
" void * get1 ( ) { return 0 ; } "
" void * get2 ( ) { return 0 ; } "
" void * get3 ( ) ; "
" void * get4 ( ) ; "
2014-03-27 11:04:31 +01:00
" } ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
{
const char code [ ] = " class Fred { \n "
" std::string s; \n "
" const std::string & foo(); \n "
" }; \n "
" const std::string & Fred::foo() { return \" \" ; } " ;
const char expected [ ] = " class Fred { "
" std :: string s ; "
" const std :: string & foo ( ) ; "
" } ; "
" const std :: string & Fred :: foo ( ) { return \" \" ; } " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
}
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void removeVoidFromFunction ( ) {
2011-10-27 20:54:42 +02:00
ASSERT_EQUALS ( " void foo ( ) ; " , tok ( " void foo(void); " ) ) ;
}
2014-11-20 14:20:09 +01:00
void removeUnnecessaryQualification1 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " class Fred { Fred::Fred() {} }; " ;
const char expected [ ] = " class Fred { Fred ( ) { } } ; " ;
ASSERT_EQUALS ( expected , tok ( code , false ) ) ;
2012-04-25 15:09:46 +02:00
ASSERT_EQUALS ( " [test.cpp:1]: (portability) The extra qualification 'Fred::' is unnecessary and is considered an error by many compilers. \n " , errout . str ( ) ) ;
2011-03-06 21:07:06 +01:00
}
2014-11-20 14:20:09 +01:00
void removeUnnecessaryQualification2 ( ) {
2011-03-06 21:07:06 +01:00
const char code [ ] = " template<typename Iter, typename Skip> \n "
" struct grammar : qi::grammar<Iter, int(), Skip> { \n "
" grammar() : grammar::base_type(start) { } \n "
" }; \n " ;
tok ( code , false ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void removeUnnecessaryQualification3 ( ) {
2011-06-14 21:31:52 +02:00
const char code [ ] = " namespace one { \n "
" class c { \n "
" public: \n "
" void function() {} \n "
" }; \n "
" } \n "
" namespace two { \n "
" class c : public one::c { \n "
" public: \n "
" void function() { \n "
" one::c::function(); \n "
" } \n "
" }; \n "
" } \n " ;
tok ( code , false ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void removeUnnecessaryQualification4 ( ) {
2011-06-14 21:31:52 +02:00
const char code [ ] = " namespace one { \n "
" class c { \n "
" public: \n "
" void function() {} \n "
" }; \n "
" } \n "
" class c : public one::c { \n "
" public: \n "
" void function() { \n "
" one::c::function(); \n "
" } \n "
" }; \n " ;
tok ( code , false ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void removeUnnecessaryQualification5 ( ) {
2011-06-14 21:31:52 +02:00
const char code [ ] = " namespace one { \n "
" class c { \n "
" public: \n "
" void function() {} \n "
" }; \n "
" } \n "
" namespace two { \n "
" class c : public one::c { \n "
" public: \n "
" void function() { \n "
" two::c::function(); \n "
" } \n "
" }; \n "
" } \n " ;
tok ( code , false ) ;
2012-04-25 15:09:46 +02:00
ASSERT_EQUALS ( " [test.cpp:11]: (portability) The extra qualification 'two::c::' is unnecessary and is considered an error by many compilers. \n " , errout . str ( ) ) ;
2011-06-14 21:31:52 +02:00
}
2014-11-20 14:20:09 +01:00
void removeUnnecessaryQualification6 ( ) {
2011-06-27 03:13:29 +02:00
const char code [ ] = " namespace NS { \n "
" int HRDF_bit() { return 1; } \n "
" void HRDF_bit_set() { } \n "
" void func(int var) { \n "
" if (!NS::HRDF_bit()) \n "
" return; \n "
" else \n "
" NS::HRDF_bit_set(); \n "
" } \n "
" } \n " ;
tok ( code , false ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void removeUnnecessaryQualification7 ( ) { // ticket #2970
2011-08-06 23:54:02 +02:00
const char code [ ] = " class TProcedure { \n "
" public: \n "
" TProcedure::TProcedure(long endAddress) : m_lEndAddr(endAddress){} \n "
" private: \n "
" long m_lEndAddr; \n "
2011-09-24 01:45:19 +02:00
" }; \n " ;
2011-08-06 23:54:02 +02:00
tok ( code , false ) ;
2012-04-25 15:09:46 +02:00
ASSERT_EQUALS ( " [test.cpp:3]: (portability) The extra qualification 'TProcedure::' is unnecessary and is considered an error by many compilers. \n " , errout . str ( ) ) ;
2011-08-06 23:54:02 +02:00
}
2014-11-20 14:20:09 +01:00
void removeUnnecessaryQualification8 ( ) {
2011-09-24 01:45:19 +02:00
const char code [ ] = " class Fred { \n "
" public: \n "
" Fred & Fred::operator = (const Fred &); \n "
" void Fred::operator () (void); \n "
" void Fred::operator delete[](void* x); \n "
" }; \n " ;
tok ( code , false ) ;
2012-04-25 15:09:46 +02:00
ASSERT_EQUALS ( " [test.cpp:3]: (portability) The extra qualification 'Fred::' is unnecessary and is considered an error by many compilers. \n "
" [test.cpp:4]: (portability) The extra qualification 'Fred::' is unnecessary and is considered an error by many compilers. \n "
" [test.cpp:5]: (portability) The extra qualification 'Fred::' is unnecessary and is considered an error by many compilers. \n " , errout . str ( ) ) ;
2011-09-24 01:45:19 +02:00
}
2014-11-20 14:20:09 +01:00
void removeUnnecessaryQualification9 ( ) {
2011-09-30 01:25:14 +02:00
const char code [ ] = " class Fred { \n "
" public: \n "
" Fred::~Fred(); \n "
" }; \n " ;
tok ( code , false ) ;
2012-04-25 15:09:46 +02:00
ASSERT_EQUALS ( " [test.cpp:3]: (portability) The extra qualification 'Fred::' is unnecessary and is considered an error by many compilers. \n " , errout . str ( ) ) ;
2011-09-30 01:25:14 +02:00
}
2014-11-20 14:20:09 +01:00
void removeUnnecessaryQualification10 ( ) {
2011-11-08 17:37:24 +01:00
const char code [ ] = " template<typename T> class A \n "
" { \n "
" operator T(); \n "
" A() { T (A::*f)() = &A::operator T; } \n "
" }; \n " ;
tok ( code , false ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2014-11-20 14:20:09 +01:00
void simplifyIfNotNull ( ) {
2011-04-16 12:07:56 +02:00
{
// ticket # 2601 segmentation fault
const char code [ ] = " || #if #define <= " ;
tok ( code , false ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
{
const char code [ ] = " void f(int x) { \n "
" x = (x != 0); \n "
" } " ;
ASSERT_EQUALS ( " void f ( int x ) { } " , tok ( code , false ) ) ;
}
2011-06-10 21:11:45 +02:00
}
2011-04-16 12:07:56 +02:00
2014-11-20 14:20:09 +01:00
void simplifyVarDecl1 ( ) { // ticket # 2682 segmentation fault
2011-06-10 21:11:45 +02:00
const char code [ ] = " x a[0] = " ;
tok ( code , false ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
2011-03-06 21:07:06 +01:00
}
2011-06-12 14:24:49 +02:00
2014-11-20 14:20:09 +01:00
void simplifyVarDecl2 ( ) { // ticket # 2834 segmentation fault
2011-06-12 14:24:49 +02:00
const char code [ ] = " std::vector<int>::iterator " ;
tok ( code , false ) ;
ASSERT_EQUALS ( " " , errout . str ( ) ) ;
}
2011-06-26 22:53:16 +02:00
2014-11-20 14:20:09 +01:00
void return_strncat ( ) {
2012-01-26 16:09:32 +01:00
{
const char code [ ] = " char *f() \n "
" { \n "
" char *temp=malloc(2); \n "
" strcpy(temp, \" \" ); \n "
" return (strncat(temp, \" a \" ,1)); \n "
" } " ;
ASSERT_EQUALS ( " char * f ( ) { "
" char * temp ; "
" temp = malloc ( 2 ) ; "
" strcpy ( temp , \" \" ) ; "
" strncat ( temp , \" a \" , 1 ) ; "
" return temp ; "
" } " , tok ( code , true ) ) ;
}
{
const char code [ ] = " char *f() \n "
" { \n "
" char **temp=malloc(8); \n "
" *temp = malloc(2); \n "
" strcpy(*temp, \" \" ); \n "
" return (strncat(*temp, \" a \" ,1)); \n "
" } " ;
ASSERT_EQUALS ( " char * f ( ) { "
" char * * temp ; "
" temp = malloc ( 8 ) ; "
" * temp = malloc ( 2 ) ; "
" strcpy ( * temp , \" \" ) ; "
" strncat ( * temp , \" a \" , 1 ) ; "
" return * temp ; "
" } " , tok ( code , true ) ) ;
}
{
const char code [ ] = " char *f() \n "
" { \n "
" char **temp=malloc(8); \n "
" *temp = malloc(2); \n "
" strcpy(*temp, \" \" ); \n "
" return (strncat(temp[0],foo(b),calc(c-d))); \n "
" } " ;
ASSERT_EQUALS ( " char * f ( ) { "
" char * * temp ; "
" temp = malloc ( 8 ) ; "
" * temp = malloc ( 2 ) ; "
" strcpy ( * temp , \" \" ) ; "
" strncat ( temp [ 0 ] , foo ( b ) , calc ( c - d ) ) ; "
" return temp [ 0 ] ; "
" } " , tok ( code , true ) ) ;
}
2011-06-26 22:53:16 +02:00
}
2011-09-03 20:45:48 +02:00
2014-11-20 14:20:09 +01:00
void removeRedundantFor ( ) { // ticket #3069
2011-09-03 20:45:48 +02:00
{
const char code [ ] = " void f() { "
" for(x=0;x<1;x++) { "
" y = 1; "
" } "
" } " ;
ASSERT_EQUALS ( " void f ( ) { { y = 1 ; } x = 1 ; } " , tok ( code , true ) ) ;
}
{
const char code [ ] = " void f() { "
" for(x=0;x<1;x++) { "
" y = 1 + x; "
" } "
" } " ;
ASSERT_EQUALS ( " void f ( ) { x = 0 ; { y = 1 + x ; } x = 1 ; } " , tok ( code , true ) ) ;
}
2014-09-26 10:46:49 +02:00
{
const char code [ ] = " void f() { "
" foo(); "
" for(int x=0;x<1;x++) { "
" y = 1 + x; "
" } "
" } " ;
ASSERT_EQUALS ( " void f ( ) { foo ( ) ; { int x = 0 ; y = 1 + x ; } } " , tok ( code , true ) ) ;
}
2011-09-03 20:45:48 +02:00
}
2011-11-12 12:01:31 +01:00
2014-11-20 14:20:09 +01:00
void consecutiveBraces ( ) {
2011-11-14 09:21:42 +01:00
ASSERT_EQUALS ( " void f ( ) { } " , tok ( " void f(){{}} " , true ) ) ;
ASSERT_EQUALS ( " void f ( ) { } " , tok ( " void f(){{{}}} " , true ) ) ;
2011-11-18 20:57:29 +01:00
ASSERT_EQUALS ( " void f ( ) { for ( ; ; ) { } } " , tok ( " void f () { for(;;){} } " , true ) ) ;
ASSERT_EQUALS ( " void f ( ) { { scope_lock lock ; foo ( ) ; } { scope_lock lock ; bar ( ) ; } } " , tok ( " void f () { {scope_lock lock; foo();} {scope_lock lock; bar();} } " , true ) ) ;
2011-11-12 12:01:31 +01:00
}
2012-01-26 17:07:10 +01:00
2014-11-20 14:20:09 +01:00
void undefinedSizeArray ( ) {
2012-01-26 17:07:10 +01:00
ASSERT_EQUALS ( " int * x ; " , tok ( " int x []; " ) ) ;
ASSERT_EQUALS ( " int * * x ; " , tok ( " int x [][]; " ) ) ;
ASSERT_EQUALS ( " int * * x ; " , tok ( " int * x []; " ) ) ;
ASSERT_EQUALS ( " int * * * x ; " , tok ( " int * x [][]; " ) ) ;
ASSERT_EQUALS ( " int * * * * x ; " , tok ( " int * * x [][]; " ) ) ;
ASSERT_EQUALS ( " void f ( int x [ ] , double y [ ] ) { } " , tok ( " void f(int x[], double y[]) { } " ) ) ;
}
2012-09-04 13:41:14 +02:00
2014-11-20 14:20:09 +01:00
void simplifyArrayAddress ( ) { // ticket #3304
2012-09-04 13:41:14 +02:00
const char code [ ] = " void foo() { \n "
" int a[10]; \n "
" memset(&a[4], 0, 20*sizeof(int)); \n "
" } " ;
ASSERT_EQUALS ( " void foo ( ) { "
" int a [ 10 ] ; "
" memset ( a + 4 , 0 , 80 ) ; "
" } " , tok ( code , true ) ) ;
2012-09-08 20:59:25 +02:00
// Don't crash
tok ( " int " , true ) ;
2012-09-04 13:41:14 +02:00
}
2013-01-13 20:52:38 +01:00
2014-11-20 14:20:09 +01:00
void simplifyCharAt ( ) { // ticket #4481
2013-01-13 20:52:38 +01:00
ASSERT_EQUALS ( " 'h' ; " , tok ( " \" hello \" [0] ; " ) ) ;
ASSERT_EQUALS ( " ' \n ' ; " , tok ( " \" \n \" [0] ; " ) ) ;
ASSERT_EQUALS ( " ' \\ 0' ; " , tok ( " \" hello \" [5] ; " ) ) ;
ASSERT_EQUALS ( " ' \\ 0' ; " , tok ( " \" \" [0] ; " ) ) ;
ASSERT_EQUALS ( " ' \\ 0' ; " , tok ( " \" \\ 0 \" [0] ; " ) ) ;
ASSERT_EQUALS ( " ' \\ n' ; " , tok ( " \" hello \\ nworld \" [5] ; " ) ) ;
ASSERT_EQUALS ( " 'w' ; " , tok ( " \" hello \n world \" [6] ; " ) ) ;
ASSERT_EQUALS ( " \" hello \" [ 7 ] ; " , tok ( " \" hello \" [7] ; " ) ) ;
ASSERT_EQUALS ( " \" hello \" [ -1 ] ; " , tok ( " \" hello \" [-1] ; " ) ) ;
}
2013-07-29 12:10:11 +02:00
2014-11-20 14:20:09 +01:00
void test_4881 ( ) {
2013-07-29 12:10:11 +02:00
const char code [ ] = " int evallex() { \n "
" int c, t; \n "
" again: \n "
" do { \n "
" if ((c = macroid(c)) == EOF_CHAR || c == ' \n ') { \n "
" } \n "
" } while ((t = type[c]) == LET && catenate()); \n "
" } \n " ;
2014-01-17 17:36:45 +01:00
ASSERT_EQUALS ( " int evallex ( ) { int c ; int t ; again : ; do { c = macroid ( c ) ; if ( c == EOF_CHAR || c == ' \n ' ) { } t = type [ c ] ; } while ( t == LET && catenate ( ) ) ; } " ,
2013-07-29 12:10:11 +02:00
tok ( code , true ) ) ;
}
2013-10-05 07:40:59 +02:00
2014-11-20 14:20:09 +01:00
void simplifyOverride ( ) { // ticket #5069
2013-10-05 07:40:59 +02:00
const char code [ ] = " void fun() { \n "
" unsigned char override[] = {0x01, 0x02}; \n "
" doSomething(override, sizeof(override)); \n "
" } \n " ;
ASSERT_EQUALS ( " void fun ( ) { char override [ 2 ] = { 1 , 2 } ; doSomething ( override , 2 ) ; } " ,
tok ( code , true ) ) ;
}
2011-03-06 21:07:06 +01:00
} ;
REGISTER_TEST ( TestSimplifyTokens )