2010-12-04 09:18:57 +01:00
|
|
|
<?xml version="1.0" encoding="UTF-8"?>
|
|
|
|
<!DOCTYPE article PUBLIC "-//OASIS//DTD DocBook XML V4.5//EN"
|
|
|
|
"http://www.oasis-open.org/docbook/xml/4.5/docbookx.dtd">
|
|
|
|
<article>
|
|
|
|
<articleinfo>
|
|
|
|
<title>Writing Cppcheck rules</title>
|
|
|
|
|
|
|
|
<author>
|
|
|
|
<firstname>Daniel</firstname>
|
|
|
|
|
|
|
|
<surname>Marjamäki</surname>
|
|
|
|
|
|
|
|
<affiliation>
|
|
|
|
<orgname>Cppcheck</orgname>
|
|
|
|
</affiliation>
|
|
|
|
</author>
|
|
|
|
|
|
|
|
<pubdate>2010</pubdate>
|
|
|
|
</articleinfo>
|
|
|
|
|
|
|
|
<section>
|
|
|
|
<title>Introduction</title>
|
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<para>This is a short guide for developers who want to write Cppcheck
|
|
|
|
rules.</para>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
|
|
|
<para>There are two ways to write rules.</para>
|
|
|
|
|
|
|
|
<variablelist>
|
|
|
|
<varlistentry>
|
|
|
|
<term>Regular expressions</term>
|
|
|
|
|
|
|
|
<listitem>
|
|
|
|
<para>Simple rules can be created by using regular expressions. No
|
|
|
|
compilation is required.</para>
|
|
|
|
</listitem>
|
|
|
|
</varlistentry>
|
|
|
|
|
|
|
|
<varlistentry>
|
|
|
|
<term>C++</term>
|
|
|
|
|
|
|
|
<listitem>
|
|
|
|
<para>Advanced rules must be created with C++. These rules must be
|
|
|
|
compiled and linked statically with Cppcheck.</para>
|
|
|
|
</listitem>
|
|
|
|
</varlistentry>
|
|
|
|
</variablelist>
|
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<para>It is a good first step to use regular expressions. It is easier.
|
|
|
|
You'll get results quicker. Therefore this guide will focus on regular
|
|
|
|
expressions.</para>
|
2010-12-04 09:18:57 +01:00
|
|
|
</section>
|
|
|
|
|
|
|
|
<section>
|
|
|
|
<title>Data representation of the source code</title>
|
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<para>The data used by the rules are not the raw source code.
|
|
|
|
<literal>Cppcheck</literal> will read the source code and process it
|
|
|
|
before the rules are used.</para>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<para>Cppcheck is designed to find bugs and dangerous code. Stylistic
|
|
|
|
information such as indentation, comments, etc are filtered out at an
|
|
|
|
early state. You don't need to worry about such stylistic information when
|
|
|
|
you write rules.</para>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<para>Between each token in the code there is always a space. For instance
|
|
|
|
the raw code "1+f()" is processed into "1 + f ( )".</para>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<para>The code is simplified in many ways. For example:</para>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<itemizedlist>
|
|
|
|
<listitem>
|
|
|
|
<para>The templates are instantiated</para>
|
|
|
|
</listitem>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<listitem>
|
|
|
|
<para>The typedefs are handled</para>
|
|
|
|
</listitem>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<listitem>
|
|
|
|
<para>There is no "else if". These are converted into "else {
|
|
|
|
if.."</para>
|
|
|
|
</listitem>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<listitem>
|
|
|
|
<para>The bodies of "if", "else", "while", "do" and "for" are always
|
|
|
|
enclosed in "{" and "}"</para>
|
|
|
|
</listitem>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<listitem>
|
|
|
|
<para>A declaration of multiple variables is split up into multiple
|
|
|
|
variable declarations. "int a,b;" => "int a; int b;"</para>
|
|
|
|
</listitem>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<listitem>
|
|
|
|
<para>There is no sizeof</para>
|
|
|
|
</listitem>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<listitem>
|
|
|
|
<para>NULL is replaced with 0</para>
|
|
|
|
</listitem>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<listitem>
|
|
|
|
<para>Static value flow analysis is made. Known values are inserted
|
|
|
|
into the code.</para>
|
|
|
|
</listitem>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<listitem>
|
|
|
|
<para>.. and many more</para>
|
|
|
|
</listitem>
|
|
|
|
</itemizedlist>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-04 20:01:55 +01:00
|
|
|
<para>The simplifications are made in the <literal>Cppcheck</literal>
|
|
|
|
<literal>Tokenizer</literal>. For more information see:
|
|
|
|
<uri>http://cppcheck.sourceforge.net/doxyoutput/classTokenizer.html</uri></para>
|
2010-12-04 09:18:57 +01:00
|
|
|
</section>
|
|
|
|
|
|
|
|
<section>
|
|
|
|
<title>Regular expressions</title>
|
|
|
|
|
|
|
|
<para>Simple rules can be defined through regular expressions.</para>
|
|
|
|
|
2010-12-05 09:36:13 +01:00
|
|
|
<section>
|
|
|
|
<title>Creating regular expression</title>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-05 09:36:13 +01:00
|
|
|
<para>Let's create a regular expression that checks for:</para>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-05 09:36:13 +01:00
|
|
|
<programlisting>if (p)
|
|
|
|
free(p);</programlisting>
|
|
|
|
|
|
|
|
<para>The condition is often redundant, it is valid to free a NULL
|
|
|
|
pointer.</para>
|
|
|
|
|
|
|
|
<para>It is important to write the regular expression so it matches the
|
|
|
|
simplified code. Create a source file that has the bad code:</para>
|
|
|
|
|
|
|
|
<programlisting>void f() {
|
|
|
|
if (p) free(p);
|
|
|
|
}</programlisting>
|
|
|
|
|
|
|
|
<para>I intentionally put the whole pattern on a single line. The
|
|
|
|
simplified code is written on a single line of code.</para>
|
|
|
|
|
|
|
|
<para>To see the simplified code I use <literal>cppcheck --debug
|
|
|
|
file.cpp</literal>.</para>
|
|
|
|
|
|
|
|
<programlisting>##file dealloc.cpp
|
|
|
|
1: void f ( ) {
|
|
|
|
2: if ( p ) { free ( p ) ; }
|
|
|
|
3: }</programlisting>
|
|
|
|
|
|
|
|
<para>I save that in a file <literal>test.txt</literal>.</para>
|
|
|
|
|
|
|
|
<para>Now we can use <literal>grep</literal> to develop a regular
|
|
|
|
expression.</para>
|
|
|
|
|
|
|
|
<programlisting>grep "if [(] p [)] { free [(] p [)] ; }" test.txt</programlisting>
|
|
|
|
|
|
|
|
<para>Feel free to improve the pattern.</para>
|
|
|
|
</section>
|
|
|
|
|
|
|
|
<section>
|
|
|
|
<title>Create rule file</title>
|
|
|
|
|
|
|
|
<para>A rule consist of:</para>
|
|
|
|
|
|
|
|
<itemizedlist>
|
|
|
|
<listitem>
|
|
|
|
<para>a pattern to search for.</para>
|
|
|
|
</listitem>
|
|
|
|
|
|
|
|
<listitem>
|
|
|
|
<para>an optional error message that is reported when pattern is
|
|
|
|
found</para>
|
|
|
|
</listitem>
|
|
|
|
</itemizedlist>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-05 09:36:13 +01:00
|
|
|
<para>Here is a simple example:</para>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-05 09:36:13 +01:00
|
|
|
<programlisting><?xml version="1.0"?>
|
2010-12-04 20:01:55 +01:00
|
|
|
<rule version="1">
|
2010-12-05 09:36:13 +01:00
|
|
|
<pattern>if [(] p [)] { free [(] p [)] ; }</pattern>
|
2010-12-04 09:18:57 +01:00
|
|
|
<message>
|
2010-12-05 09:36:13 +01:00
|
|
|
<id>redundantCondition</id>
|
|
|
|
<severity>style</severity>
|
|
|
|
<summary>Redundant condition. It is valid to free a NULL pointer.</summary>
|
2010-12-04 09:18:57 +01:00
|
|
|
</message>
|
|
|
|
</rule></programlisting>
|
|
|
|
|
2010-12-05 09:36:13 +01:00
|
|
|
<para>The <literal>message</literal>, <literal>id</literal>,
|
|
|
|
<literal>severity</literal> and <literal>summary</literal> elements are
|
|
|
|
optional. If they are not written default values are used.</para>
|
2010-12-04 09:18:57 +01:00
|
|
|
|
2010-12-05 09:36:13 +01:00
|
|
|
<para>Now you can test this rule. Use the <literal>cppcheck
|
|
|
|
--rule-file=dealloc.rule test.cpp</literal> command.</para>
|
|
|
|
</section>
|
2010-12-04 09:18:57 +01:00
|
|
|
</section>
|
|
|
|
</article>
|