Skip to main content

Advanced C++ - virtual functions

Today I am going to explain some basic but very important C++ feature - polymorphism and inheritance which is based on virtual functions in C++.

Virtual functions can be declared by preceding the function with virtual keyword. The importance of Virtual functions can be understood, when we design classes using inheritance. Virtual functions are special functions which are called using late binding concept.

Late binding or dynamic binding means that the binding happens during run time using vtable (virtual table) to select the correct virtual method to be called as the code runs.


Let us look at an example for getting more clarity on how Virtual functions work in reality: Output of that example is: Point 1 shows how virtual function is declared and defined.

Point 2 shows the inheritance concept i.e class Derived is inherited from class Base using public access specifier.

In point 3, virtual function of class Base is redefined in class Derived which leads to function overriding. Note that the use of keyword virtual is not required if other classes does not derive from Derived class.

From point 4, you can check which function is called for Base and Derived class(look at output). We see that based on the address what base pointer holds, such respective function gets called.

You can also run the same sample program after deleting the virtual keyword. Check the output then: This is because without using the concept of virtual functions, the compiler does early binding.

Early binding or Static binding is nothing but binding the function call to function body during compile time. Irrespective of what base pointer holds (value), the method matching the type of pointer gets called, in this case it is Base class method.

Now, let us understand how the concept of virtual functions work. Using virtual functions, we can achieve run time selection of methods which needs to be called based on object type. Late binding happens using vtable. Once the compiler sees that a class has a virtual function, it constructs a vtable which consist of addresses of virtual functions of that class.

Also, compiler places a special pointer called as vpointer i.e VPTR which points to the vtable which happens when an object of that class is constructed. Hence, when we call a virtual function using base class pointer, the compiler fetches the VPTR from the object’s memory, gets the function address from the vtable, thus resolving the virtual function call during run time as shown in the first output.

Code of this example can be found on our GitHub account: https://github.com/xmementoit/CppAdventureExamples/tree/master/advancedCpp/virtualFunction


Comments

Popular posts from this blog

GDB Automatic Deadlock Detector

Have you ever had a problem with detection deadlock between threads in your C/C++ application? Would you like to do that automatically? Try this GDB Automatic Deadlock Detector from my github: GDB Automatic Deadlock Detector Picture source: http://csunplugged.org/wp-content/uploads/2015/03/deadlock.jpg1286488735

STL - count and count_if algorithms

One of the basic and most useful STL algorithms is algorithm which can be used to count number of elements within selected container according to specified criteria. In order to do that we can use std::count or std::count_if algorithm. std::count (firstElementIterator, lastElementIterator, elementForSearch) - is function which will go through container using firstElementIterator and lastElementIterator and return number of container elements which value is equal elementForSearch std::count_if (firstElementIterator, lastElementIterator, UnaryPredicateFunction) - is function which examine range from firstElementIterator to lastElementIterator and return number of container elements which fulfill UnaryPredicateFunction criteria. UnaryPredicateFunction is function having following signature: bool functionName(const Type& a) . So, count_if returns number of elements where UnaryPredicateFunction returns true for. For better understanding let's take a

Advanced C++ - Stack unwinding

Stack unwinding is normally a concept of removing function entries from call stack (also known as Execution stack, Control stack, Function stack or Run-time stack). Call Stack is a stack data structure that stores active functions' addresses and helps in supporting function call/return mechanism. Every time when a function is called, an entry is made into Call stack which contains the return address of the calling function where the control needs to return after the execution of called function. This entry is called by various names like stack frame , activation frame or activation record. With respect to exception handling , stack Unwinding is a process of linearly searching function call stack to reach exception handler. When an exception occurs, if it is not handled in current function where it is thrown, the function Call Stack is unwound until the control reaches try block and then passes to catch block at the end of try block to handle exception. Also, in this proc