![\"trap\"](\"https:\/\/www.modernescpp.com\/wp-content\/uploads\/2018\/05\/trap.png\")
<\/p>\nConcurrency provides many ways to shoot yourself in the foot. The rules for today help you to know these dangers and to overcome them.<\/p>\n
<\/p>\n
<\/p>\n
First, here are three rules for this post.<\/p>\n
thread<\/code>s use shared_ptr<\/code><\/a><\/li>\n- CP.41: Minimize thread creation and destruction<\/a><\/li>\n<\/ul>\n
They are more rules which I ignore because they have no content.<\/p>\n
CP.31: Pass small amounts of data between threads by value, rather than by reference or pointer<\/a><\/h3>\nThis rule is quite apparent; therefore, I can make it short. Passing data to a thread by value immediately gives you two benefits:<\/p>\n
\n- There is no sharing and therefore, no data race is possible. The requirements for a data race are mutable, shared state. Read the details here: C++ Core Guidelines: Rules for Concurrency and Parallelism<\/a>.<\/li>\n
- You do have not to care about the lifetime of the data. The data stays alive for the lifetime of the created thread. This is, in particular, important when you detach a thread: C++ Core Guidelines: Taking Care of your Child.<\/a><\/li>\n<\/ol>\n
Of course, the crucial question is: What does a small amount of data mean? The C++ core guidelines are not clear on this point. In rule F.16 For \u201cin\u201d parameters, pass cheaply-copied types by value and others by reference to <\/a>const to functions<\/a>, <\/code>the C++ core guidelines states that 4 * sizeof(int)<\/span> is a rule of thumb for functions. Meaning smaller than 4 * sizeof(int)<\/span> should be passed by value; bigger than 4 * sizeof(int)<\/span> by reference or pointer.<\/p>\nIn the end, you have to measure the performance if necessary.<\/p>\n<\/p>\n
CP.32: To share ownership between unrelated thread<\/code>s use shared_ptr<\/code><\/a><\/h3>\nImagine you have an object which you want to share between unrelated threads. The critical question is, who is the object’s owner and, therefore, responsible for releasing the memory? Now you can choose between a memory leak if you don’t deallocate the memory or undefined behavior because you invoked delete more than once. Most of the time, the undefined behavior ends in a runtime crash.<\/p>\n
<\/p>\n
\n\/\/ threadSharesOwnership.cpp<\/span>\r\n\r\n#include <iostream><\/span>\r\n#include <thread><\/span>\r\n\r\nusing<\/span> namespace<\/span> std::<\/span>literals::<\/span>chrono_literals;\r\n\r\nstruct<\/span> MyInt{\r\n int<\/span> val{2017<\/span>};\r\n ~<\/span>MyInt(){ \/\/ (4)<\/span>\r\n std::<\/span>cout <<<\/span> \"Good Bye\"<\/span> <<<\/span> std::<\/span>endl; <\/span>\r\n }\r\n};\r\n\r\nvoid<\/span> showNumber<\/span>(MyInt*<\/span> myInt){\r\n std::<\/span>cout <<<\/span> myInt-><\/span>val <<<\/span> std::<\/span>endl;\r\n}\r\n\r\nvoid<\/span> threadCreator<\/span>(){\r\n MyInt*<\/span> tmpInt=<\/span> new<\/span> MyInt; \/\/ (1)<\/span>\r\n \r\n std::<\/span>thread<\/span> t1(showNumber, tmpInt); \/\/ (2)<\/span>\r\n std::<\/span>thread<\/span> t2(showNumber, tmpInt); \/\/ (3)<\/span>\r\n \r\n t1.detach();\r\n t2.detach();\r\n}\r\n\r\nint<\/span> main<\/span>(){
std::cout << std::endl;
\r\n threadCreator();\r\n std::<\/span>this_thread::<\/span>sleep_for(1<\/span>s);
std::cout << std::endl;
\r\n}\r\n<\/pre>\n<\/div>\n <\/p>\n
Bear with me. The example is intentionally so easy. I let the main thread sleep for one second to be sure that it outlives the lifetime of the child threads t1<\/span> and t2.<\/span> This is, of course, no appropriate synchronization, but it helps me to make my point. The vital issue of the program is: Who is responsible for the deletion of tmpInt<\/span> (1)? Thread t1<\/span> (2), thread t2<\/span> (3), or the function (main thread) itself. Because I can not forecast how long each thread runs, I decided to go with a memory leak. Consequentially, the destructor of MyInt<\/span> (4) is never called:<\/p>\n ![\"threadSharesOwnership\"](\"https:\/\/www.modernescpp.com\/wp-content\/uploads\/2018\/05\/threadSharesOwnership.png\")
<\/p>\n
The lifetime issues are quite easy to handle if I use a std::shared_ptr<\/span>.<\/p>\n![\"threadSharesOwnershipSharedPtr\"](\"https:\/\/www.modernescpp.com\/wp-content\/uploads\/2018\/05\/threadSharesOwnershipSharedPtr.png\")
<\/p>\n
\n\/\/ threadSharesOwnershipSharedPtr.cpp<\/span>\r\n\r\n#include <iostream><\/span>\r\n#include <memory><\/span>\r\n#include <thread><\/span>\r\n\r\nusing<\/span> namespace<\/span> std::<\/span>literals::<\/span>chrono_literals;\r\n\r\nstruct<\/span> MyInt{\r\n int<\/span> val{2017<\/span>};\r\n ~<\/span>MyInt(){\r\n std::<\/span>cout <<<\/span> \"Good Bye\"<\/span> <<<\/span> std::<\/span>endl;\r\n }\r\n};\r\n\r\nvoid<\/span> showNumber<\/span>(std::<\/span>shared_ptr<<\/span>MyInt><\/span> myInt){ \/\/ (2)<\/span>\r\n std::<\/span>cout <<<\/span> myInt-><\/span>val <<<\/span> std::<\/span>endl;\r\n}\r\n\r\nvoid<\/span> threadCreator<\/span>(){\r\n auto<\/span> sharedPtr =<\/span> std::<\/span>make_shared<<\/span>MyInt><\/span>(); \/\/ (1)<\/span>\r\n \r\n std::<\/span>thread<\/span> t1(showNumber, sharedPtr);\r\n std::<\/span>thread<\/span> t2(showNumber, sharedPtr);\r\n \r\n t1.detach();\r\n t2.detach();\r\n}\r\n\r\nint<\/span> main<\/span>(){\r\n \r\n std::<\/span>cout <<<\/span> std::<\/span>endl;\r\n \r\n threadCreator();\r\n std::<\/span>this_thread::<\/span>sleep_for(1<\/span>s);\r\n \r\n std::<\/span>cout <<<\/span> std::<\/span>endl;\r\n \r\n}\r\n<\/pre>\n<\/div>\n <\/p>\n
Two small changes to the source code were necessary. First, the pointer in (1) became a std::shared_ptr<\/span>; second, the function showNumber <\/span>takes a smart pointer instead of a plain pointer.
<\/span><\/p>\nCP.41: Minimize thread creation and destruction<\/a><\/h3>\nHow expensive is a thread? Quite expensive! This is the issue behind this rule. Let me first talk about the usual size of a thread and then the costs of its creation.<\/p>\n
Size<\/h4>\n
A std::thread i<\/span>s a thin wrapper around the native thread. This means I’m interested in the size of Windows and POSIX threads.<\/p>\n\n- Windows systems: the post Thread Stack Size<\/a> gave me the answer: 1 MB.<\/li>\n
- POSIX systems: the<\/span> pthread_create<\/span><\/a> man-page provides me with the answer: 2MB. These is the sizes for the i386 and x86_64 architectures. If you want to know the sizes for further architectures that support POSIX, here are they:<\/li>\n<\/ul>\n
![\"threadStackSize\"](\"https:\/\/www.modernescpp.com\/wp-content\/uploads\/2018\/05\/threadStackSize.png\")
<\/p>\n
Creation<\/h4>\n
I didn’t find numbers on how long it takes to create a thread. I made a simple performance test on Linux and Windows to get a gut feeling.<\/p>\n
I used GCC 6.2.1 on a desktop and cl.exe on a laptop for my performance tests. The cl.exe is part of Microsoft Visual Studio 2017. I compiled the programs with maximum optimization. This means on Linux, the flag O3<\/span> and Windows Ox<\/span>.<\/p>\nHere is my small test program.<\/p>\n
\n\/\/ threadCreationPerformance.cpp<\/span>\r\n\r\n#include <chrono><\/span>\r\n#include <iostream><\/span>\r\n#include <thread><\/span>\r\n\r\nstatic<\/span> const<\/span> long<\/span> long<\/span> numThreads=<\/span> 1000000<\/span>;\r\n\r\nint<\/span> main<\/span>(){\r\n\r\n auto<\/span> start =<\/span> std::<\/span>chrono::<\/span>system_clock::<\/span>now();\r\n\r\n for<\/span> (volatile<\/span> int<\/span> i =<\/span> 0<\/span>; i <<\/span> numThreads; ++<\/span>i) std::<\/span>thread<\/span>([]{}).detach(); \/\/ (1)<\/span>\r\n\r\n std::<\/span>chrono::<\/span>duration<<\/span>double<\/span>><\/span> dur=<\/span> std::<\/span>chrono::<\/span>system_clock::<\/span>now() -<\/span> start;\r\n std::<\/span>cout <<<\/span> \"time: \"<\/span> <<<\/span> dur.count() <<<\/span> \" seconds\"<\/span> <<<\/span> std::<\/span>endl;\r\n\r\n}\r\n<\/pre>\n<\/div>\n <\/p>\n
The program creates 1 million threads that execute an empty lambda function (1). These are the numbers for Linux and Windows:<\/p>\n
Linux:<\/strong><\/h5>\n![\"threadCreationLinux\"](\"https:\/\/www.modernescpp.com\/wp-content\/uploads\/2018\/05\/threadCreationLinux.png\")
<\/p>\n
This means that creating a thread took about 14.5 sec \/ 1000000 = 14.5 microseconds on Linux<\/strong>.<\/p>\nWindows:<\/strong><\/h5>\n![\"threadCreationWindows\"](\"https:\/\/www.modernescpp.com\/wp-content\/uploads\/2018\/05\/threadCreationWindows.png\")
<\/p>\n
It took about 44 sec \/ 1000000 = 44 microseconds on Windows.<\/strong><\/p>\nTo put it the other way around. In one second, you can create about 69 thousand threads on Linux and 23 thousand on Windows.<\/strong><\/p>\nWhat’s next?<\/h2>\n