Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8521607
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 11, 20262026-06-11T06:52:33+00:00 2026-06-11T06:52:33+00:00

For the below code example, the speed to execute method increment by the pointer

  • 0

For the below code example, the speed to execute method “increment” by the pointer – num_ptr is significantly slower than the local variable – num. I think it is related to the virtual method, but I don’t understand why. Please help explain this. I am trying to understand the performance issue from this example.

#include <iostream>

const long long iterations_count = 1000000;

// a number interface
struct number {        
    virtual void increment() = 0;
};

struct concrete_number:number
{
    long long a;
    concrete_number(long long p){
        a = p;
    }
    void increment()
    {
        a+=1;
    }
};

int main() {

    concrete_number num(0);
    concrete_number* num_ptr = &num;

    for (long long i = 0; i < iterations_count; i++) {
        num.increment();
    }

    for (long long i = 0; i < iterations_count; i++) {
        num_ptr->increment();
    }
    std::getchar();
}
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-11T06:52:35+00:00Added an answer on June 11, 2026 at 6:52 am

    num.increment(); is resolved statically, num_ptr->increment(); will be resolved dynamically (the function is called through dynamic dispatch because it’s virtual).

    However, with full optimizations on, the compiler should produce similar results.

    No optmizations:

        num.increment();
    00341453  lea         ecx,[num]  
    00341456  call        concrete_number::increment (341186h)  
    

    vs

        num_ptr->increment();
    00341490  mov         eax,dword ptr [num_ptr]  
    00341493  mov         edx,dword ptr [eax]  
    00341495  mov         esi,esp  
    00341497  mov         ecx,dword ptr [num_ptr]  
    0034149A  mov         eax,dword ptr [edx]  
    0034149C  call        eax  
    0034149E  cmp         esi,esp  
    003414A0  call        @ILT+340(__RTC_CheckEsp) (341159h)  
    

    With optimizations, at least for me, both calls are inlined.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

For this code example below, usually I would use [self fall]; instead of the
The example code below works as as a server process. But when I add
I know how to do this... I'll give example code below. But I can't
UPDATE 2011.09.13 This bug has been resolved by Adobe. The example code below now
Given the example source code below, is it possible for someone to see the
I have a basic PHP question, take the code below for example, let's say
For example, I have the java code below: URL u = new URL(http://google.com); URLConnection
The example below shows the code I am using to test whether a user
I've simplified my JavaScript code to the example below; this code is giving me
I constantly find myself writing similar code like the example below: if (object[Object Name]

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.