Skip to main content

Recover from exception and re-execute the code.

 In this post, I am trying to show how can we catch an exception, then correct the cause of the exception and re-execute the code. In Windows, we have something called SEH (Structured Exception Handling) using which we can have a chance to recover from exceptions and re-execute the code which originally raised an exception.

So what I am trying to do here in my sample code is:

1. Accepting two numbers from the user and deliberately taking the denominator as 0;

2. Trying to divide by numerator with zero.

3. Division with zero results as an exception.

4. Catching the exception and asking the user to re-enter the denominator with a non-zero value and then executing the division part of the code again.  Simple! This same thing can be done for other type of exceptions too.

Let's see how it works in the below demo code!

#include <windows.h>
#include <iostream>

class ADemoToRecover {
public:
        int numerator = 0;
        int denominator = 0;
public:
    int recoverFromDivideByZero(DWORD exceptCode);
};
int ADemoToRecover::recoverFromDivideByZero(DWORD exceptCode)
{
    if (exceptCode != EXCEPTION_INT_DIVIDE_BY_ZERO)
        return EXCEPTION_CONTINUE_SEARCH;
    std::cout << "Integer divided by Zero detected" << "\n";
    std::cout << "Please enter a valid number other than zero for division(deniminator)" << "\n";
    std::cin >> denominator;
    return EXCEPTION_CONTINUE_EXECUTION;
}
int main()
{
    // A sample demo to recover division by zero.
    ADemoToRecover a;
    std::cout << "Please enter numerator (number): " << "\n";
    std::cin >> a.numerator;
    std::cout << "Please enter denominator (number): " << "\n";
    std::cin >> a.denominator;
    __try {
        int res = (a.numerator / a.denominator); // Exception will be raised here if denominator = 0
        std::cout << "The result of division: " << res << "\n";
    }
    __except (a.recoverFromDivideByZero(GetExceptionCode())) {
    }
    return 0;
}

The output: 



Labels:

Comments

Post a Comment

Popular posts from this blog

XOR (Exclusive OR) for branchless coding

The following example shows the array reversing using the  XOR operator . No need to take any additional variable to reverse the array.   int main(int argc, _TCHAR* argv[]) { char str[] = "I AM STUDENT"; int length = strlen(str); for(int i = 0; i < ((length/2)); i++) { str[i] ^= str[length - (1+i)]; str[length - (1+i)] ^= str[i]; str[i] ^= str[length - (1+i)]; } cout << str << endl; return 0; } The above example is one of the uses of XOR but XOR comes in handy when we can do branchless coding  methods like butterfly switch etc. Sometimes this is very effective in speeding up the execution.  Let's see one of the uses of XOR in branchless coding. I am taking a simple example of Y = | X |.  Yes, I am generating abs of a supplied number. So, my function signature/definition in C++ looks like below: int absoluteBranch( int x) {     if (x < 0 ) {         return ...
1 comment
Read more

Reversing char array without splitting the array to tokens

 I was reading about strdup, a C++ function and suddenly an idea came to my mind if this can be leveraged to aid in reversing a character array without splitting the array into words and reconstructing it again by placing spaces and removing trailing spaces. Again, I wanted an array to be passed as a function argument and an array size to be passed implicitly with the array to the function. Assumed, a well-formed char array has been passed into the function. No malformed array checking is done inside the function. So, the function signature and definition are like below: Below is the call from the client code to reverse the array without splitting tokens and reconstructing it. Finally, copy the reversed array to the destination.  For GNU C++, we should use strdup instead _strdup . On run, we get the following output: Demo code
Post a Comment
Read more

Power of Two

  I n this post will be discussing how to calculate if a number is a power of two or not. As an example, 8 is a power of two but the number 10 is not. There are many ways we can solve this. First , we will take an approach which is simple and iterative. In this case, we will calculate the power of two one by one and check with the supplied number. The below code illustrates it. bool isPowerofTwo(unsigned num) { auto y = 1; while (0 != y) { if (num == y) return true; if (num < y) return false; y <<= 1; } return false; } Second , assuming, the number is a 32-bit number, this is also an iterative solution. In this scenario, iterating all bits and counting the set bits. Any number which is a power of 2 will have only one bit set and the rest will be zeros. As an example, 8 in binary representation is 1000. Using this observation, we can implement an iterative solution. bool isPowerofTwo(unsigned num) { auto one_count = 0; for (auto index = 0; index < ...
Post a Comment
Read more