Skip to main content

Return value optimization

In C++, writing a function with a compound return statement like this
const Rational function (void)
{
....
return Rational (a,b); // statement 1
}

can be more efficient than

const Rational function (void)
{
....
Rational r(a,b);
return r; // statement 2
}

when used in the surrounding context such as

main()
{
Rational c = function (); // initializing c.
}

because compilers can avoid "invisible" creation and
destruction of temporaries when function returns an object
by value. This is known as "return value optimization".
In the optimized assembly code, object c is directly
initialized by statement 1. You save upto 2 temporaries (and
creation/destruction of them). One is the local object
r and other one is created and destroyed when the
function returns.

Comments

Anonymous said…
Good insightful content... Cool use of a blog
towi said…
I am not absolutely sure, but I think, the rules for RVO are a bit wider. I think the compiler can also optimize if all "return"s directly call a constructor OR all "return"s return the same instance.
This could also be RVO'd:

Obj func()
{
__if(sunshine)
____return Obj("blue");
__else
____return Obj(42);
}

This would be, because the compiler can allocate the memory for the return value, then work through the function, and depending on which "return" call the appropriate constructor with the already allocated space.
It would not work if you mixed the two variants.
[towi@geocities.com]
Anonymous said…
wrong. both forms WILL BE optimized.
Anonymous said…
Following code calls constructor only twice.

Chk Test()
{
Chk p;
p.Set(1);

return p;

}

int main(int argc, char* argv[])
{ Chk q ;

q = Test();
}





http://vijayvcplusplus.blogspot.com/
Anonymous said…
Please stop copying codes from famous books and put them in your blog to have fame. To all readers, instead reading these blogs, please read "Efficient C++" series from Scott Mayer.
Anonymous said…
Please stop copying codes from famous books and put them in your blog to have fame. To all readers, instead reading these blogs, please read "Efficient C++" series from Scott Mayer. Most of the codes are copied from that book and if you read from book, you will get much more insight about these topics.
Anonymous said…
Striking blog. I liked the site I will be back
again! Websurfing is a good way to find blogs like
yours.
Everyd
thanks you!
gclub casino

Popular Content

Unit Testing C++ Templates and Mock Injection Using Traits

Unit testing your template code comes up from time to time. (You test your templates, right?) Some templates are easy to test. No others. Sometimes it's not clear how to about injecting mock code into the template code that's under test. I've seen several reasons why code injection becomes challenging. Here I've outlined some examples below with roughly increasing code injection difficulty. Template accepts a type argument and an object of the same type by reference in constructor Template accepts a type argument. Makes a copy of the constructor argument or simply does not take one Template accepts a type argument and instantiates multiple interrelated templates without virtual functions Lets start with the easy ones. Template accepts a type argument and an object of the same type by reference in constructor This one appears straight-forward because the unit test simply instantiates the template under test with a mock type. Some assertion might be tested in

Covariance and Contravariance in C++ Standard Library

Covariance and Contravariance are concepts that come up often as you go deeper into generic programming. While designing a language that supports parametric polymorphism (e.g., templates in C++, generics in Java, C#), the language designer has a choice between Invariance, Covariance, and Contravariance when dealing with generic types. C++'s choice is "invariance". Let's look at an example. struct Vehicle {}; struct Car : Vehicle {}; std::vector<Vehicle *> vehicles; std::vector<Car *> cars; vehicles = cars; // Does not compile The above program does not compile because C++ templates are invariant. Of course, each time a C++ template is instantiated, the compiler creates a brand new type that uniquely represents that instantiation. Any other type to the same template creates another unique type that has nothing to do with the earlier one. Any two unrelated user-defined types in C++ can't be assigned to each-other by default. You have to provide a

Multi-dimensional arrays in C++11

What new can be said about multi-dimensional arrays in C++? As it turns out, quite a bit! With the advent of C++11, we get new standard library class std::array. We also get new language features, such as template aliases and variadic templates. So I'll talk about interesting ways in which they come together. It all started with a simple question of how to define a multi-dimensional std::array. It is a great example of deceptively simple things. Are the following the two arrays identical except that one is native and the other one is std::array? int native[3][4]; std::array<std::array<int, 3>, 4> arr; No! They are not. In fact, arr is more like an int[4][3]. Note the difference in the array subscripts. The native array is an array of 3 elements where every element is itself an array of 4 integers. 3 rows and 4 columns. If you want a std::array with the same layout, what you really need is: std::array<std::array<int, 4>, 3> arr; That's quite annoying for