To get a trial key
fill out the form below
Team License (a basic version)
Enterprise License (an extended version)
* By clicking this button you agree to our Privacy Policy statement

Request our prices
New License
License Renewal
--Select currency--
* By clicking this button you agree to our Privacy Policy statement

Free PVS-Studio license for Microsoft MVP specialists
* By clicking this button you agree to our Privacy Policy statement

To get the licence for your open-source project, please fill out this form
* By clicking this button you agree to our Privacy Policy statement

I am interested to try it on the platforms:
* By clicking this button you agree to our Privacy Policy statement

Message submitted.

Your message has been sent. We will email you at

If you haven't received our response, please do the following:
check your Spam/Junk folder and click the "Not Spam" button for our message.
This way, you won't miss messages from our team in the future.

Unreachable Code

Unreachable Code

Aug 16 2013

Unreachable code is a program code fragment which is never executed.

Don't mix it up with dead code which is, unlike unreachable code, a code fragment that can be executed but whose result is never used in any other computation.

Presence of unreachable code in a program is determined by a number of factors. These fragments often contain random computations looking very similar to executable code. Since unreachable code is never executed, it only adds to the size of the program but does not cause performance losses. However, its presence may indicate a logic error. The common task of detecting fragments of unreachable code is algorithmically unsolvable. But most errors related to unreachable code are very plain and can be detected by the compiler or specialized utilities. Static code analysis, being based on various heuristic methods, can be used to find fragments of unreachable code.

Below are a few simple examples of unreachable code.

Example 1:

int func(int a)
   int b = a*2;
   return b;

   // Unreachable code
   if (b < 10)
        b += 10;
   return b;

The condition 'b<10' in this sample will never be executed, since it stands below the unconditional return operator. Since the condition 'b<10' can never be executed, the variable 'b' will also never be incremented by 10.

Example 2:

vector<string> vec;
while (true)

   if (vec.size() > 25)
       return 0;

// Unreachable code

The infinite loop in this sample fills the 'vec' container with the string "abc". As the container's size exceeds 25, the return operator will be called to immediately terminate the function and bring control back to the return point. Due to this, the last item of the 'vec' container will never be removed.

Example 3:

tStatus = TGetFirstLayerItem (pContext, DBX_LAYER_MULTI, pLayerItem);
if (DBX_LAYER_MULTI && tStatus == DBX_OK)
    // Writing styles

In this sample, the list of project styles will never be written because the condition (DBX_LAYER_MULTI && tStatus == DBX_OK) is always false. It contains the DBX_LAYER_MULTI constant which equals zero.

Example 4:

typedef unsigned short wint_t;

void lexungetc(wint_t c) {
  if (c < 0)

The condition 'c<0' here is always false because 'c' is unsigned.

Such bugs are most efficient to diagnose by static code analysis tools at the earlier stage of software development.

Unreachable code is often exploited in practice. For instance, blocks "if (false)" can be used to disable certain code fragments. It allows preserving obsolete or incomplete code which can be later included into the program. Disabled code will be maintained through refactoring means, which will simplify issues associated with inclusion of such fragments into the project when it is needed. An "if (false)" block can also be used for the purpose of step-by-step debugging by returning the current program execution point into it. While doing so, you can use this block to perform some computations or output certain data which you may need later for debugging. Thus, you can keep code fragments which will never be called by the program itself but which may come in handy for debugging purposes.


Popular related articles
Appreciate Static Code Analysis!

Date: Oct 16 2017

Author: Andrey Karpov

I am really astonished by the capabilities of static code analysis even though I am one of the developers of PVS-Studio analyzer myself. The tool surprised me the other day as it turned out to be sma…
PVS-Studio ROI

Date: Jan 30 2019

Author: Andrey Karpov

Occasionally, we're asked a question, what monetary value the company will receive from using PVS-Studio. We decided to draw up a response in the form of an article and provide tables, which will sho…
Technologies used in the PVS-Studio code analyzer for finding bugs and potential vulnerabilities

Date: Nov 21 2018

Author: Andrey Karpov

A brief description of technologies used in the PVS-Studio tool, which let us effectively detect a large number of error patterns and potential vulnerabilities. The article describes the implementati…
Free PVS-Studio for those who develops open source projects

Date: Dec 22 2018

Author: Andrey Karpov

On the New 2019 year's eve, a PVS-Studio team decided to make a nice gift for all contributors of open-source projects hosted on GitHub, GitLab or Bitbucket. They are given free usage of PVS-Studio s…
The Last Line Effect

Date: May 31 2014

Author: Andrey Karpov

I have studied many errors caused by the use of the Copy-Paste method, and can assure you that programmers most often tend to make mistakes in the last fragment of a homogeneous code block. I have ne…
PVS-Studio for Java

Date: Jan 17 2019

Author: Andrey Karpov

In the seventh version of the PVS-Studio static analyzer, we added support of the Java language. It's time for a brief story of how we've started making support of the Java language, how far we've co…
The way static analyzers fight against false positives, and why they do it

Date: Mar 20 2017

Author: Andrey Karpov

In my previous article I wrote that I don't like the approach of evaluating the efficiency of static analyzers with the help of synthetic tests. In that article, I give the example of a code fragment…
The Evil within the Comparison Functions

Date: May 19 2017

Author: Andrey Karpov

Perhaps, readers remember my article titled "Last line effect". It describes a pattern I've once noticed: in most cases programmers make an error in the last line of similar text blocks. Now I want t…
Characteristics of PVS-Studio Analyzer by the Example of EFL Core Libraries, 10-15% of False Positives

Date: Jul 31 2017

Author: Andrey Karpov

After I wrote quite a big article about the analysis of the Tizen OS code, I received a large number of questions concerning the percentage of false positives and the density of errors (how many erro…
How PVS-Studio Proved to Be More Attentive Than Three and a Half Programmers

Date: Oct 22 2018

Author: Andrey Karpov

Just like other static analyzers, PVS-Studio often produces false positives. What you are about to read is a short story where I'll tell you how PVS-Studio proved, just one more time, to be more atte…

Comments (0)

Next comments
This website uses cookies and other technology to provide you a more personalized experience. By continuing the view of our web-pages you accept the terms of using these files. If you don't want your personal data to be processed, please, leave this site.
Learn More →