├── .clang-format ├── .cmake-format ├── .gitignore ├── CMakeLists.txt ├── LICENSE ├── README.md ├── benchmark ├── CMakeLists.txt └── bench.cpp ├── cmake └── CPM.cmake ├── include └── riften │ ├── semaphore.hpp │ ├── thiefpool.hpp │ └── xoroshiro128starstar.hpp └── test ├── CMakeLists.txt ├── example_test.cpp └── thiefpool_test.cpp /.clang-format: -------------------------------------------------------------------------------- 1 | BasedOnStyle: Google 2 | AccessModifierOffset: '-2' 3 | AlignTrailingComments: 'true' 4 | AllowAllParametersOfDeclarationOnNextLine: 'false' 5 | AlwaysBreakTemplateDeclarations: 'No' 6 | BreakBeforeBraces: Attach 7 | ColumnLimit: '110' 8 | ConstructorInitializerAllOnOneLineOrOnePerLine: 'true' 9 | IncludeBlocks: Regroup 10 | IndentPPDirectives: AfterHash 11 | IndentWidth: '4' 12 | BreakBeforeBinaryOperators: All 13 | BreakBeforeTernaryOperators: 'true' 14 | 15 | BinPackArguments: false 16 | BinPackParameters: false 17 | -------------------------------------------------------------------------------- /.cmake-format: -------------------------------------------------------------------------------- 1 | format: 2 | tab_size: 2 3 | line_width: 105 4 | dangle_parens: true 5 | 6 | parse: 7 | additional_commands: 8 | cpmaddpackage: 9 | pargs: 10 | nargs: '*' 11 | flags: [] 12 | spelling: CPMAddPackage 13 | kwargs: &cpmaddpackagekwargs 14 | NAME: 1 15 | FORCE: 1 16 | VERSION: 1 17 | GIT_TAG: 1 18 | DOWNLOAD_ONLY: 1 19 | GITHUB_REPOSITORY: 1 20 | GITLAB_REPOSITORY: 1 21 | GIT_REPOSITORY: 1 22 | SVN_REPOSITORY: 1 23 | SVN_REVISION: 1 24 | SOURCE_DIR: 1 25 | DOWNLOAD_COMMAND: 1 26 | FIND_PACKAGE_ARGUMENTS: 1 27 | NO_CACHE: 1 28 | GIT_SHALLOW: 1 29 | URL: 1 30 | URL_HASH: 1 31 | URL_MD5: 1 32 | DOWNLOAD_NAME: 1 33 | DOWNLOAD_NO_EXTRACT: 1 34 | HTTP_USERNAME: 1 35 | HTTP_PASSWORD: 1 36 | OPTIONS: + 37 | cpmfindpackage: 38 | pargs: 39 | nargs: '*' 40 | flags: [] 41 | spelling: CPMFindPackage 42 | kwargs: *cpmaddpackagekwargs 43 | packageproject: 44 | pargs: 45 | nargs: '*' 46 | flags: [] 47 | spelling: packageProject 48 | kwargs: 49 | NAME: 1 50 | VERSION: 1 51 | NAMESPACE: 1 52 | INCLUDE_DIR: 1 53 | INCLUDE_DESTINATION: 1 54 | BINARY_DIR: 1 55 | COMPATIBILITY: 1 56 | VERSION_HEADER: 1 57 | DEPENDENCIES: + -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Custom 2 | build 3 | .vscode 4 | .clangd 5 | .cache 6 | compile_commands.json 7 | 8 | # Prerequisites 9 | *.d 10 | 11 | # Compiled Object files 12 | *.slo 13 | *.lo 14 | *.o 15 | *.obj 16 | 17 | # Precompiled Headers 18 | *.gch 19 | *.pch 20 | 21 | # Compiled Dynamic libraries 22 | *.so 23 | *.dylib 24 | *.dll 25 | 26 | # Fortran module files 27 | *.mod 28 | *.smod 29 | 30 | # Compiled Static libraries 31 | *.lai 32 | *.la 33 | *.a 34 | *.lib 35 | 36 | # Executables 37 | *.exe 38 | *.out 39 | *.app 40 | -------------------------------------------------------------------------------- /CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.14 FATAL_ERROR) 2 | 3 | # ---- Project ---- 4 | 5 | project( 6 | RiftenThiefpool 7 | VERSION 2.1.1 8 | LANGUAGES CXX 9 | ) 10 | 11 | # ---- Include guards ---- 12 | 13 | if(PROJECT_SOURCE_DIR STREQUAL PROJECT_BINARY_DIR) 14 | message( 15 | FATAL_ERROR 16 | "In-source builds not allowed. Please make a new directory (called a build directory) and run CMake from there." 17 | ) 18 | endif() 19 | 20 | # ---- Add dependencies ---- 21 | 22 | find_package(Threads) 23 | 24 | include(cmake/CPM.cmake) 25 | 26 | CPMAddPackage("gh:TheLartians/PackageProject.cmake@1.6.0") 27 | CPMAddPackage("gh:Naios/function2#4.1.0") 28 | CPMAddPackage("gh:ConorWilliams/ConcurrentDeque#v1.1.0") 29 | 30 | # ---- Create library ---- 31 | 32 | add_library(${PROJECT_NAME} INTERFACE) 33 | 34 | target_compile_features(${PROJECT_NAME} INTERFACE cxx_std_20) 35 | 36 | # Link dependencies 37 | target_link_libraries( 38 | ${PROJECT_NAME} INTERFACE function2::function2 RiftenDeque::RiftenDeque ${CMAKE_THREAD_LIBS_INIT} 39 | ) 40 | 41 | target_include_directories( 42 | ${PROJECT_NAME} INTERFACE $ 43 | $ 44 | ) 45 | 46 | # ---- Create an installable target ---- 47 | 48 | packageProject( 49 | NAME ${PROJECT_NAME} 50 | VERSION ${PROJECT_VERSION} 51 | NAMESPACE ${PROJECT_NAME} 52 | BINARY_DIR ${PROJECT_BINARY_DIR} 53 | INCLUDE_DIR ${PROJECT_SOURCE_DIR}/include 54 | INCLUDE_DESTINATION include/${PROJECT_NAME}-${PROJECT_VERSION} 55 | COMPATIBILITY SameMajorVersion 56 | DEPENDENCIES "function2, RiftenDeque" 57 | ) 58 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | Mozilla Public License Version 2.0 2 | ================================== 3 | 4 | 1. Definitions 5 | -------------- 6 | 7 | 1.1. "Contributor" 8 | means each individual or legal entity that creates, contributes to 9 | the creation of, or owns Covered Software. 10 | 11 | 1.2. "Contributor Version" 12 | means the combination of the Contributions of others (if any) used 13 | by a Contributor and that particular Contributor's Contribution. 14 | 15 | 1.3. "Contribution" 16 | means Covered Software of a particular Contributor. 17 | 18 | 1.4. "Covered Software" 19 | means Source Code Form to which the initial Contributor has attached 20 | the notice in Exhibit A, the Executable Form of such Source Code 21 | Form, and Modifications of such Source Code Form, in each case 22 | including portions thereof. 23 | 24 | 1.5. "Incompatible With Secondary Licenses" 25 | means 26 | 27 | (a) that the initial Contributor has attached the notice described 28 | in Exhibit B to the Covered Software; or 29 | 30 | (b) that the Covered Software was made available under the terms of 31 | version 1.1 or earlier of the License, but not also under the 32 | terms of a Secondary License. 33 | 34 | 1.6. "Executable Form" 35 | means any form of the work other than Source Code Form. 36 | 37 | 1.7. "Larger Work" 38 | means a work that combines Covered Software with other material, in 39 | a separate file or files, that is not Covered Software. 40 | 41 | 1.8. "License" 42 | means this document. 43 | 44 | 1.9. "Licensable" 45 | means having the right to grant, to the maximum extent possible, 46 | whether at the time of the initial grant or subsequently, any and 47 | all of the rights conveyed by this License. 48 | 49 | 1.10. "Modifications" 50 | means any of the following: 51 | 52 | (a) any file in Source Code Form that results from an addition to, 53 | deletion from, or modification of the contents of Covered 54 | Software; or 55 | 56 | (b) any new file in Source Code Form that contains any Covered 57 | Software. 58 | 59 | 1.11. "Patent Claims" of a Contributor 60 | means any patent claim(s), including without limitation, method, 61 | process, and apparatus claims, in any patent Licensable by such 62 | Contributor that would be infringed, but for the grant of the 63 | License, by the making, using, selling, offering for sale, having 64 | made, import, or transfer of either its Contributions or its 65 | Contributor Version. 66 | 67 | 1.12. "Secondary License" 68 | means either the GNU General Public License, Version 2.0, the GNU 69 | Lesser General Public License, Version 2.1, the GNU Affero General 70 | Public License, Version 3.0, or any later versions of those 71 | licenses. 72 | 73 | 1.13. "Source Code Form" 74 | means the form of the work preferred for making modifications. 75 | 76 | 1.14. "You" (or "Your") 77 | means an individual or a legal entity exercising rights under this 78 | License. For legal entities, "You" includes any entity that 79 | controls, is controlled by, or is under common control with You. For 80 | purposes of this definition, "control" means (a) the power, direct 81 | or indirect, to cause the direction or management of such entity, 82 | whether by contract or otherwise, or (b) ownership of more than 83 | fifty percent (50%) of the outstanding shares or beneficial 84 | ownership of such entity. 85 | 86 | 2. License Grants and Conditions 87 | -------------------------------- 88 | 89 | 2.1. Grants 90 | 91 | Each Contributor hereby grants You a world-wide, royalty-free, 92 | non-exclusive license: 93 | 94 | (a) under intellectual property rights (other than patent or trademark) 95 | Licensable by such Contributor to use, reproduce, make available, 96 | modify, display, perform, distribute, and otherwise exploit its 97 | Contributions, either on an unmodified basis, with Modifications, or 98 | as part of a Larger Work; and 99 | 100 | (b) under Patent Claims of such Contributor to make, use, sell, offer 101 | for sale, have made, import, and otherwise transfer either its 102 | Contributions or its Contributor Version. 103 | 104 | 2.2. Effective Date 105 | 106 | The licenses granted in Section 2.1 with respect to any Contribution 107 | become effective for each Contribution on the date the Contributor first 108 | distributes such Contribution. 109 | 110 | 2.3. Limitations on Grant Scope 111 | 112 | The licenses granted in this Section 2 are the only rights granted under 113 | this License. No additional rights or licenses will be implied from the 114 | distribution or licensing of Covered Software under this License. 115 | Notwithstanding Section 2.1(b) above, no patent license is granted by a 116 | Contributor: 117 | 118 | (a) for any code that a Contributor has removed from Covered Software; 119 | or 120 | 121 | (b) for infringements caused by: (i) Your and any other third party's 122 | modifications of Covered Software, or (ii) the combination of its 123 | Contributions with other software (except as part of its Contributor 124 | Version); or 125 | 126 | (c) under Patent Claims infringed by Covered Software in the absence of 127 | its Contributions. 128 | 129 | This License does not grant any rights in the trademarks, service marks, 130 | or logos of any Contributor (except as may be necessary to comply with 131 | the notice requirements in Section 3.4). 132 | 133 | 2.4. Subsequent Licenses 134 | 135 | No Contributor makes additional grants as a result of Your choice to 136 | distribute the Covered Software under a subsequent version of this 137 | License (see Section 10.2) or under the terms of a Secondary License (if 138 | permitted under the terms of Section 3.3). 139 | 140 | 2.5. Representation 141 | 142 | Each Contributor represents that the Contributor believes its 143 | Contributions are its original creation(s) or it has sufficient rights 144 | to grant the rights to its Contributions conveyed by this License. 145 | 146 | 2.6. Fair Use 147 | 148 | This License is not intended to limit any rights You have under 149 | applicable copyright doctrines of fair use, fair dealing, or other 150 | equivalents. 151 | 152 | 2.7. Conditions 153 | 154 | Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted 155 | in Section 2.1. 156 | 157 | 3. Responsibilities 158 | ------------------- 159 | 160 | 3.1. Distribution of Source Form 161 | 162 | All distribution of Covered Software in Source Code Form, including any 163 | Modifications that You create or to which You contribute, must be under 164 | the terms of this License. You must inform recipients that the Source 165 | Code Form of the Covered Software is governed by the terms of this 166 | License, and how they can obtain a copy of this License. You may not 167 | attempt to alter or restrict the recipients' rights in the Source Code 168 | Form. 169 | 170 | 3.2. Distribution of Executable Form 171 | 172 | If You distribute Covered Software in Executable Form then: 173 | 174 | (a) such Covered Software must also be made available in Source Code 175 | Form, as described in Section 3.1, and You must inform recipients of 176 | the Executable Form how they can obtain a copy of such Source Code 177 | Form by reasonable means in a timely manner, at a charge no more 178 | than the cost of distribution to the recipient; and 179 | 180 | (b) You may distribute such Executable Form under the terms of this 181 | License, or sublicense it under different terms, provided that the 182 | license for the Executable Form does not attempt to limit or alter 183 | the recipients' rights in the Source Code Form under this License. 184 | 185 | 3.3. Distribution of a Larger Work 186 | 187 | You may create and distribute a Larger Work under terms of Your choice, 188 | provided that You also comply with the requirements of this License for 189 | the Covered Software. If the Larger Work is a combination of Covered 190 | Software with a work governed by one or more Secondary Licenses, and the 191 | Covered Software is not Incompatible With Secondary Licenses, this 192 | License permits You to additionally distribute such Covered Software 193 | under the terms of such Secondary License(s), so that the recipient of 194 | the Larger Work may, at their option, further distribute the Covered 195 | Software under the terms of either this License or such Secondary 196 | License(s). 197 | 198 | 3.4. Notices 199 | 200 | You may not remove or alter the substance of any license notices 201 | (including copyright notices, patent notices, disclaimers of warranty, 202 | or limitations of liability) contained within the Source Code Form of 203 | the Covered Software, except that You may alter any license notices to 204 | the extent required to remedy known factual inaccuracies. 205 | 206 | 3.5. Application of Additional Terms 207 | 208 | You may choose to offer, and to charge a fee for, warranty, support, 209 | indemnity or liability obligations to one or more recipients of Covered 210 | Software. However, You may do so only on Your own behalf, and not on 211 | behalf of any Contributor. You must make it absolutely clear that any 212 | such warranty, support, indemnity, or liability obligation is offered by 213 | You alone, and You hereby agree to indemnify every Contributor for any 214 | liability incurred by such Contributor as a result of warranty, support, 215 | indemnity or liability terms You offer. You may include additional 216 | disclaimers of warranty and limitations of liability specific to any 217 | jurisdiction. 218 | 219 | 4. Inability to Comply Due to Statute or Regulation 220 | --------------------------------------------------- 221 | 222 | If it is impossible for You to comply with any of the terms of this 223 | License with respect to some or all of the Covered Software due to 224 | statute, judicial order, or regulation then You must: (a) comply with 225 | the terms of this License to the maximum extent possible; and (b) 226 | describe the limitations and the code they affect. Such description must 227 | be placed in a text file included with all distributions of the Covered 228 | Software under this License. Except to the extent prohibited by statute 229 | or regulation, such description must be sufficiently detailed for a 230 | recipient of ordinary skill to be able to understand it. 231 | 232 | 5. Termination 233 | -------------- 234 | 235 | 5.1. The rights granted under this License will terminate automatically 236 | if You fail to comply with any of its terms. However, if You become 237 | compliant, then the rights granted under this License from a particular 238 | Contributor are reinstated (a) provisionally, unless and until such 239 | Contributor explicitly and finally terminates Your grants, and (b) on an 240 | ongoing basis, if such Contributor fails to notify You of the 241 | non-compliance by some reasonable means prior to 60 days after You have 242 | come back into compliance. Moreover, Your grants from a particular 243 | Contributor are reinstated on an ongoing basis if such Contributor 244 | notifies You of the non-compliance by some reasonable means, this is the 245 | first time You have received notice of non-compliance with this License 246 | from such Contributor, and You become compliant prior to 30 days after 247 | Your receipt of the notice. 248 | 249 | 5.2. If You initiate litigation against any entity by asserting a patent 250 | infringement claim (excluding declaratory judgment actions, 251 | counter-claims, and cross-claims) alleging that a Contributor Version 252 | directly or indirectly infringes any patent, then the rights granted to 253 | You by any and all Contributors for the Covered Software under Section 254 | 2.1 of this License shall terminate. 255 | 256 | 5.3. In the event of termination under Sections 5.1 or 5.2 above, all 257 | end user license agreements (excluding distributors and resellers) which 258 | have been validly granted by You or Your distributors under this License 259 | prior to termination shall survive termination. 260 | 261 | ************************************************************************ 262 | * * 263 | * 6. Disclaimer of Warranty * 264 | * ------------------------- * 265 | * * 266 | * Covered Software is provided under this License on an "as is" * 267 | * basis, without warranty of any kind, either expressed, implied, or * 268 | * statutory, including, without limitation, warranties that the * 269 | * Covered Software is free of defects, merchantable, fit for a * 270 | * particular purpose or non-infringing. The entire risk as to the * 271 | * quality and performance of the Covered Software is with You. * 272 | * Should any Covered Software prove defective in any respect, You * 273 | * (not any Contributor) assume the cost of any necessary servicing, * 274 | * repair, or correction. This disclaimer of warranty constitutes an * 275 | * essential part of this License. No use of any Covered Software is * 276 | * authorized under this License except under this disclaimer. * 277 | * * 278 | ************************************************************************ 279 | 280 | ************************************************************************ 281 | * * 282 | * 7. Limitation of Liability * 283 | * -------------------------- * 284 | * * 285 | * Under no circumstances and under no legal theory, whether tort * 286 | * (including negligence), contract, or otherwise, shall any * 287 | * Contributor, or anyone who distributes Covered Software as * 288 | * permitted above, be liable to You for any direct, indirect, * 289 | * special, incidental, or consequential damages of any character * 290 | * including, without limitation, damages for lost profits, loss of * 291 | * goodwill, work stoppage, computer failure or malfunction, or any * 292 | * and all other commercial damages or losses, even if such party * 293 | * shall have been informed of the possibility of such damages. This * 294 | * limitation of liability shall not apply to liability for death or * 295 | * personal injury resulting from such party's negligence to the * 296 | * extent applicable law prohibits such limitation. Some * 297 | * jurisdictions do not allow the exclusion or limitation of * 298 | * incidental or consequential damages, so this exclusion and * 299 | * limitation may not apply to You. * 300 | * * 301 | ************************************************************************ 302 | 303 | 8. Litigation 304 | ------------- 305 | 306 | Any litigation relating to this License may be brought only in the 307 | courts of a jurisdiction where the defendant maintains its principal 308 | place of business and such litigation shall be governed by laws of that 309 | jurisdiction, without reference to its conflict-of-law provisions. 310 | Nothing in this Section shall prevent a party's ability to bring 311 | cross-claims or counter-claims. 312 | 313 | 9. Miscellaneous 314 | ---------------- 315 | 316 | This License represents the complete agreement concerning the subject 317 | matter hereof. If any provision of this License is held to be 318 | unenforceable, such provision shall be reformed only to the extent 319 | necessary to make it enforceable. Any law or regulation which provides 320 | that the language of a contract shall be construed against the drafter 321 | shall not be used to construe this License against a Contributor. 322 | 323 | 10. Versions of the License 324 | --------------------------- 325 | 326 | 10.1. New Versions 327 | 328 | Mozilla Foundation is the license steward. Except as provided in Section 329 | 10.3, no one other than the license steward has the right to modify or 330 | publish new versions of this License. Each version will be given a 331 | distinguishing version number. 332 | 333 | 10.2. Effect of New Versions 334 | 335 | You may distribute the Covered Software under the terms of the version 336 | of the License under which You originally received the Covered Software, 337 | or under the terms of any subsequent version published by the license 338 | steward. 339 | 340 | 10.3. Modified Versions 341 | 342 | If you create software not governed by this License, and you want to 343 | create a new license for such software, you may create and use a 344 | modified version of this License if you rename the license and remove 345 | any references to the name of the license steward (except to note that 346 | such modified license differs from this License). 347 | 348 | 10.4. Distributing Source Code Form that is Incompatible With Secondary 349 | Licenses 350 | 351 | If You choose to distribute Source Code Form that is Incompatible With 352 | Secondary Licenses under the terms of this version of the License, the 353 | notice described in Exhibit B of this License must be attached. 354 | 355 | Exhibit A - Source Code Form License Notice 356 | ------------------------------------------- 357 | 358 | This Source Code Form is subject to the terms of the Mozilla Public 359 | License, v. 2.0. If a copy of the MPL was not distributed with this 360 | file, You can obtain one at http://mozilla.org/MPL/2.0/. 361 | 362 | If it is not possible or desirable to put the notice in a particular 363 | file, then You may include the notice in a location (such as a LICENSE 364 | file in a relevant directory) where a recipient would be likely to look 365 | for such a notice. 366 | 367 | You may add additional accurate notices of copyright ownership. 368 | 369 | Exhibit B - "Incompatible With Secondary Licenses" Notice 370 | --------------------------------------------------------- 371 | 372 | This Source Code Form is "Incompatible With Secondary Licenses", as 373 | defined by the Mozilla Public License, v. 2.0. 374 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # `riften::Thiefpool` 2 | 3 | A blazing-fast, lightweight, work-stealing thread-pool for C++20. Built on the lock-free concurrent [`riften::Deque`](https://github.com/ConorWilliams/ConcurrentDeque). 4 | 5 | ## Usage 6 | 7 | ```C++ 8 | #include "riften/thiefpool.hpp" 9 | 10 | // Create thread pool with 4 worker threads. 11 | riften::Thiefpool pool(4); 12 | 13 | // Enqueue and return future. 14 | auto result = pool.enqueue([](int x) { return x; }, 42); 15 | 16 | // Get result from future. 17 | std::cout << result.get() << std::endl; 18 | ``` 19 | 20 | Additionally, `riften::Thiefpool` supplies a detaching version of enqueue: 21 | 22 | ```C++ 23 | // Enqueue and return nothing 24 | pool.enqueue_detach([](int x) { do_work(x); }, x); 25 | ``` 26 | Which elides the allocation of a `std::future`'s shared state. 27 | 28 | ## Installation 29 | 30 | The recommended way to consume this library is through [CPM.cmake](https://github.com/cpm-cmake/CPM.cmake), just add: 31 | 32 | ```CMake 33 | CPMAddPackage("gh:ConorWilliams/Threadpool#v2.1.1") 34 | ``` 35 | to your `CMakeLists.txt` and you're good to go! 36 | 37 | ## Tests 38 | 39 | To compile and run the tests: 40 | ```zsh 41 | mkdir build && cd build 42 | cmake ../test 43 | make && make test 44 | ``` 45 | -------------------------------------------------------------------------------- /benchmark/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.14 FATAL_ERROR) 2 | 3 | # ---- Project ---- 4 | 5 | project(RiftenThiefpoolBench LANGUAGES CXX) 6 | 7 | # ---- Include guards ---- 8 | 9 | if(PROJECT_SOURCE_DIR STREQUAL PROJECT_BINARY_DIR) 10 | message( 11 | FATAL_ERROR 12 | "In-source builds not allowed. Please make a new directory (called a build directory) and run CMake from there." 13 | ) 14 | endif() 15 | 16 | # ---- Add dependencies ---- 17 | 18 | find_package(Threads) 19 | 20 | include(../cmake/CPM.cmake) 21 | 22 | CPMAddPackage(NAME RiftenThiefpool SOURCE_DIR ${CMAKE_CURRENT_LIST_DIR}/..) 23 | 24 | # ---- Benchmarking ---- 25 | 26 | add_executable(${PROJECT_NAME} "${CMAKE_CURRENT_SOURCE_DIR}/bench.cpp") 27 | 28 | # Link dependencies 29 | target_link_libraries(${PROJECT_NAME} PUBLIC RiftenThiefpool::RiftenThiefpool ${CMAKE_THREAD_LIBS_INIT}) 30 | -------------------------------------------------------------------------------- /benchmark/bench.cpp: -------------------------------------------------------------------------------- 1 | 2 | 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | 11 | #include "riften/thiefpool.hpp" 12 | 13 | struct clock_tick { 14 | std::string name; 15 | typename std::chrono::high_resolution_clock::time_point start; 16 | }; 17 | 18 | inline clock_tick tick(std::string const &name, bool print = false) { 19 | if (print) { 20 | std::cout << "Timing: " << name << '\n'; 21 | } 22 | return {name, std::chrono::high_resolution_clock::now()}; 23 | } 24 | 25 | template int tock(clock_tick &x, Args &&...args) { 26 | using namespace std::chrono; 27 | 28 | auto const stop = high_resolution_clock::now(); 29 | 30 | auto const time = duration_cast(stop - x.start).count(); 31 | 32 | std::cout << x.name << ": " << time << "/ms"; 33 | 34 | (static_cast(std::cout << ',' << ' ' << args), ...); 35 | 36 | std::cout << std::endl; 37 | 38 | return time; 39 | } 40 | 41 | template void Benchmark(int threads, std::string_view str) { 42 | { 43 | auto fast = tick("fast"); 44 | 45 | std::atomic counter; 46 | 47 | { 48 | T pool(threads); 49 | 50 | for (std::size_t i = 0; i < 10'000'000; i++) { 51 | pool.enqueue([&]() { counter.fetch_add(1); }); 52 | } 53 | } 54 | 55 | tock(fast, str, counter.load()); 56 | } 57 | 58 | { 59 | auto het = tick(" het"); 60 | 61 | std::atomic counter; 62 | 63 | { 64 | T pool(threads); 65 | 66 | for (std::size_t i = 0; i < 10'000; i++) { 67 | pool.enqueue([&]() { 68 | counter.fetch_add(1); 69 | std::this_thread::sleep_for(std::chrono::microseconds(i)); 70 | }); 71 | } 72 | } 73 | 74 | tock(het, str, counter.load()); 75 | } 76 | 77 | { 78 | auto slow = tick("slow"); 79 | 80 | std::atomic counter; 81 | 82 | { 83 | T pool(threads); 84 | 85 | for (std::size_t i = 0; i < 500; i++) { 86 | pool.enqueue([&]() { 87 | counter.fetch_add(1); 88 | std::this_thread::sleep_for(std::chrono::milliseconds(100)); 89 | }); 90 | } 91 | } 92 | 93 | tock(slow, str, counter.load()); 94 | } 95 | } 96 | 97 | int main() { 98 | Benchmark(12, "riften"); 99 | 100 | return 0; 101 | } -------------------------------------------------------------------------------- /cmake/CPM.cmake: -------------------------------------------------------------------------------- 1 | set(CPM_DOWNLOAD_VERSION 0.31.1) 2 | 3 | if(CPM_SOURCE_CACHE) 4 | # Expand relative path. This is important if the provided path contains a tilde (~) 5 | get_filename_component(CPM_SOURCE_CACHE ${CPM_SOURCE_CACHE} ABSOLUTE) 6 | set(CPM_DOWNLOAD_LOCATION "${CPM_SOURCE_CACHE}/cpm/CPM_${CPM_DOWNLOAD_VERSION}.cmake") 7 | elseif(DEFINED ENV{CPM_SOURCE_CACHE}) 8 | set(CPM_DOWNLOAD_LOCATION "$ENV{CPM_SOURCE_CACHE}/cpm/CPM_${CPM_DOWNLOAD_VERSION}.cmake") 9 | else() 10 | set(CPM_DOWNLOAD_LOCATION "${CMAKE_BINARY_DIR}/cmake/CPM_${CPM_DOWNLOAD_VERSION}.cmake") 11 | endif() 12 | 13 | if(NOT (EXISTS ${CPM_DOWNLOAD_LOCATION})) 14 | message(STATUS "Downloading CPM.cmake to ${CPM_DOWNLOAD_LOCATION}") 15 | file(DOWNLOAD 16 | https://github.com/cpm-cmake/CPM.cmake/releases/download/v${CPM_DOWNLOAD_VERSION}/CPM.cmake 17 | ${CPM_DOWNLOAD_LOCATION} 18 | ) 19 | endif() 20 | 21 | include(${CPM_DOWNLOAD_LOCATION}) 22 | -------------------------------------------------------------------------------- /include/riften/semaphore.hpp: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | // Code in the file below is an adaptation (by C. J. Williams) of Jeff Preshing's portable + lightweight 4 | // semaphore implementations, see: 5 | // 6 | // https://github.com/preshing/cpp11-on-multicore 7 | // https://preshing.com/20150316/semaphores-are-surprisingly-versatile/ 8 | 9 | // LICENSE: 10 | // 11 | // Copyright (c) 2015 Jeff Preshing 12 | // 13 | // This software is provided 'as-is', without any express or implied 14 | // warranty. In no event will the authors be held liable for any damages 15 | // arising from the use of this software. 16 | // 17 | // Permission is granted to anyone to use this software for any purpose, 18 | // including commercial applications, and to alter it and redistribute it 19 | // freely, subject to the following restrictions: 20 | // 21 | // 1. The origin of this software must not be misrepresented; you must not 22 | // claim that you wrote the original software. If you use this software 23 | // in a product, an acknowledgement in the product documentation would be 24 | // appreciated but is not required. 25 | // 2. Altered source versions must be plainly marked as such, and must not be 26 | // misrepresented as being the original software. 27 | // 3. This notice may not be removed or altered from any source distribution. 28 | 29 | #include 30 | #include 31 | 32 | namespace riften { 33 | 34 | namespace detail { 35 | 36 | #if defined(_WIN32) 37 | //--------------------------------------------------------- 38 | // Semaphore (Windows) 39 | //--------------------------------------------------------- 40 | 41 | # include 42 | # undef min 43 | # undef max 44 | 45 | class Semaphore { 46 | private: 47 | HANDLE m_hSema; 48 | 49 | Semaphore(const Semaphore& other) = delete; 50 | Semaphore& operator=(const Semaphore& other) = delete; 51 | 52 | public: 53 | Semaphore(int initialCount = 0) { 54 | assert(initialCount >= 0); 55 | m_hSema = CreateSemaphore(NULL, initialCount, MAXLONG, NULL); 56 | } 57 | 58 | ~Semaphore() { CloseHandle(m_hSema); } 59 | 60 | void wait() { WaitForSingleObject(m_hSema, INFINITE); } 61 | 62 | void signal(int count = 1) { ReleaseSemaphore(m_hSema, count, NULL); } 63 | }; 64 | 65 | #elif defined(__MACH__) 66 | //--------------------------------------------------------- 67 | // Semaphore (Apple iOS and OSX) 68 | // Can't use POSIX semaphores due to http://lists.apple.com/archives/darwin-kernel/2009/Apr/msg00010.html 69 | //--------------------------------------------------------- 70 | 71 | # include 72 | 73 | class Semaphore { 74 | private: 75 | semaphore_t m_sema; 76 | 77 | Semaphore(const Semaphore& other) = delete; 78 | Semaphore& operator=(const Semaphore& other) = delete; 79 | 80 | public: 81 | Semaphore(int initialCount = 0) { 82 | assert(initialCount >= 0); 83 | semaphore_create(mach_task_self(), &m_sema, SYNC_POLICY_FIFO, initialCount); 84 | } 85 | 86 | ~Semaphore() { semaphore_destroy(mach_task_self(), m_sema); } 87 | 88 | void wait() { semaphore_wait(m_sema); } 89 | 90 | void signal() { semaphore_signal(m_sema); } 91 | 92 | void signal(int count) { 93 | while (count-- > 0) { 94 | semaphore_signal(m_sema); 95 | } 96 | } 97 | }; 98 | 99 | #elif defined(__unix__) 100 | //--------------------------------------------------------- 101 | // Semaphore (POSIX, Linux) 102 | //--------------------------------------------------------- 103 | 104 | # include 105 | 106 | class Semaphore { 107 | private: 108 | sem_t m_sema; 109 | 110 | Semaphore(const Semaphore& other) = delete; 111 | Semaphore& operator=(const Semaphore& other) = delete; 112 | 113 | public: 114 | Semaphore(int initialCount = 0) { 115 | assert(initialCount >= 0); 116 | sem_init(&m_sema, 0, initialCount); 117 | } 118 | 119 | ~Semaphore() { sem_destroy(&m_sema); } 120 | 121 | void wait() { 122 | // http://stackoverflow.com/questions/2013181/gdb-causes-sem-wait-to-fail-with-eintr-error 123 | int rc; 124 | do { 125 | rc = sem_wait(&m_sema); 126 | } while (rc == -1 && errno == EINTR); 127 | } 128 | 129 | void signal() { sem_post(&m_sema); } 130 | 131 | void signal(int count) { 132 | while (count-- > 0) { 133 | sem_post(&m_sema); 134 | } 135 | } 136 | }; 137 | 138 | #else 139 | 140 | # error Unsupported platform! 141 | 142 | #endif 143 | 144 | } // namespace detail 145 | 146 | class Semaphore { 147 | public: 148 | explicit Semaphore(std::ptrdiff_t desired) : m_count(desired) { assert(desired >= 0); } 149 | 150 | void release(std::ptrdiff_t update = 1) { 151 | std::ptrdiff_t oldCount = m_count.fetch_add(update, std::memory_order_release); 152 | std::ptrdiff_t toRelease = -oldCount < update ? -oldCount : update; 153 | if (toRelease > 0) { 154 | m_sema.signal(toRelease); 155 | } 156 | } 157 | 158 | // If possible consumes all counts in the semaphore, otherwise blocks until released. 159 | void acquire_many() { 160 | for (std::ptrdiff_t spin = 0; spin < 10'000; ++spin) { 161 | std::ptrdiff_t old = m_count.load(relaxed); 162 | if (old > 0 && m_count.compare_exchange_strong(old, 0, acquire)) { 163 | return; 164 | } 165 | std::atomic_signal_fence(acquire); // Prevent the compiler from collapsing the loop. 166 | } 167 | 168 | std::ptrdiff_t old = m_count.load(relaxed); 169 | 170 | for (;;) { 171 | if (old <= 0) { 172 | if (m_count.compare_exchange_strong(old, old - 1, acq_rel, relaxed)) { 173 | m_sema.wait(); 174 | return; 175 | } 176 | } else if (m_count.compare_exchange_strong(old, 0, acq_rel, relaxed)) { 177 | return; 178 | } 179 | } 180 | } 181 | 182 | private: 183 | std::atomic m_count; 184 | detail::Semaphore m_sema; 185 | 186 | static constexpr std::memory_order relaxed = std::memory_order_relaxed; 187 | static constexpr std::memory_order acq_rel = std::memory_order_acq_rel; 188 | static constexpr std::memory_order acquire = std::memory_order_acquire; 189 | }; 190 | 191 | } // namespace riften 192 | -------------------------------------------------------------------------------- /include/riften/thiefpool.hpp: -------------------------------------------------------------------------------- 1 | // Written in 2020 by Conor Williams (cw648@cam.ac.uk) 2 | 3 | #pragma once 4 | 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | 16 | #include "function2/function2.hpp" 17 | #include "riften/deque.hpp" 18 | #include "semaphore.hpp" 19 | #include "xoroshiro128starstar.hpp" 20 | 21 | namespace riften { 22 | 23 | namespace detail { 24 | 25 | // See: https://en.cppreference.com/w/cpp/thread/thread/thread 26 | template std::decay_t decay_copy(T &&v) { return std::forward(v); } 27 | 28 | // Bind F and args... into a nullary one-shot lambda. Lambda captures by value. 29 | template auto bind(F &&f, Args &&...args) { 30 | return [f = decay_copy(std::forward(f)), 31 | ... args = decay_copy(std::forward(args))]() mutable -> decltype(auto) { 32 | return std::invoke(std::move(f), std::move(args)...); 33 | }; 34 | } 35 | 36 | // Like std::packaged_task, but guarantees no type-erasure. 37 | template class NullaryOneShot { 38 | public: 39 | // Stores a copy of the function 40 | NullaryOneShot(F fn) : _fn(std::move(fn)) {} 41 | 42 | std::future> get_future() { return _promise.get_future(); } 43 | 44 | void operator()() && { 45 | try { 46 | if constexpr (!std::is_same_v>) { 47 | _promise.set_value(std::invoke(std::move(_fn))); 48 | } else { 49 | std::invoke(std::move(_fn)); 50 | _promise.set_value(); 51 | } 52 | } catch (...) { 53 | _promise.set_exception(std::current_exception()); 54 | } 55 | } 56 | 57 | private: 58 | std::promise> _promise; 59 | F _fn; 60 | }; 61 | 62 | } // namespace detail 63 | 64 | // Lightweight, fast, work-stealing thread-pool for C++20. Built on the lock-free concurrent `riften::Deque`. 65 | // Upon destruction the threadpool blocks until all tasks have been completed and all threads have joined. 66 | class Thiefpool { 67 | public: 68 | // Construct a `Thiefpool` with `num_threads` threads. 69 | explicit Thiefpool(std::size_t num_threads = std::thread::hardware_concurrency()) : _deques(num_threads) { 70 | for (std::size_t i = 0; i < num_threads; ++i) { 71 | _threads.emplace_back([&, id = i](std::stop_token tok) { 72 | jump(id); // Get a different random stream 73 | do { 74 | // Wait to be signalled 75 | _deques[id].sem.acquire_many(); 76 | 77 | std::size_t spin = 0; 78 | 79 | do { 80 | // Prioritise our work otherwise steal 81 | std::size_t t = spin++ < 100 || !_deques[id].tasks.empty() 82 | ? id 83 | : xoroshiro128() % _deques.size(); 84 | 85 | if (std::optional one_shot = _deques[t].tasks.steal()) { 86 | _in_flight.fetch_sub(1, std::memory_order_release); 87 | std::invoke(std::move(*one_shot)); 88 | } 89 | 90 | // Loop until all the work is done. 91 | } while (_in_flight.load(std::memory_order_acquire) > 0); 92 | 93 | } while (!tok.stop_requested()); 94 | }); 95 | } 96 | } 97 | 98 | // Enqueue callable `f` into the threadpool. Like `std::async`/`std::thread` a copy of `args...` is made, 99 | // use `std::ref` if you really want a reference. Returns a `std::future<...>` which does not block upon 100 | // destruction. 101 | template 102 | [[nodiscard]] std::future, std::decay_t...>> enqueue( 103 | F &&f, 104 | Args &&...args) { 105 | // 106 | auto task = detail::NullaryOneShot(detail::bind(std::forward(f), std::forward(args)...)); 107 | 108 | auto future = task.get_future(); 109 | 110 | execute(std::move(task)); 111 | 112 | return future; 113 | } 114 | 115 | // Enqueue callable `f` into the threadpool. Like `std::async`/`std::thread` a copy of `args...` is made, 116 | // use `std::ref` if you really want a reference. This version does *not* return a handle to the called 117 | // function and thus only accepts functions which return void. 118 | template void enqueue_detach(F &&f, Args &&...args) { 119 | // Cleaner error message than concept 120 | static_assert(std::is_same_v, std::decay_t...>>, 121 | "Function must return void."); 122 | 123 | execute(detail::bind(std::forward(f), std::forward(args)...)); 124 | } 125 | 126 | ~Thiefpool() { 127 | for (auto &t : _threads) { 128 | t.request_stop(); 129 | } 130 | for (auto &d : _deques) { 131 | d.sem.release(); 132 | } 133 | } 134 | 135 | private: 136 | // Fire and forget interface. 137 | template void execute(F &&f) { 138 | std::size_t i = count++ % _deques.size(); 139 | 140 | _in_flight.fetch_add(1, std::memory_order_relaxed); 141 | _deques[i].tasks.emplace(std::forward(f)); 142 | _deques[i].sem.release(); 143 | } 144 | 145 | struct named_pair { 146 | Semaphore sem{0}; 147 | Deque> tasks; 148 | }; 149 | 150 | std::atomic _in_flight; 151 | std::size_t count = 0; 152 | std::vector _deques; 153 | std::vector _threads; 154 | }; 155 | 156 | } // namespace riften 157 | -------------------------------------------------------------------------------- /include/riften/xoroshiro128starstar.hpp: -------------------------------------------------------------------------------- 1 | // Written in 2018 by David Blackman and Sebastiano Vigna (vigna@acm.org) 2 | 3 | // To the extent possible under law, the author has dedicated all copyright 4 | // and related and neighbouring rights to this software to the public domain 5 | // worldwide. This software is distributed without any warranty. 6 | 7 | // See . 8 | 9 | #include 10 | 11 | namespace riften { 12 | 13 | // This is xoroshiro128** 1.0, one of our all-purpose, rock-solid, 14 | // small-state generators. It is extremely (sub-ns) fast and it passes all 15 | // tests we are aware of, but its state space is large enough only for 16 | // mild parallelism. 17 | 18 | // For generating just floating-point numbers, xoroshiro128+ is even 19 | // faster (but it has a very mild bias, see notes in the comments). 20 | 21 | // The state must be seeded so that it is not everywhere zero. If you have 22 | // a 64-bit seed, we suggest to seed a splitmix64 generator and use its 23 | // output to fill s. 24 | 25 | inline uint64_t rotl(const uint64_t x, int k) { return (x << k) | (x >> (64 - k)); } 26 | 27 | static thread_local uint64_t s[2] = {42, 42}; // The answer to the greatest question 28 | 29 | inline uint64_t xoroshiro128() { 30 | const uint64_t s0 = s[0]; 31 | uint64_t s1 = s[1]; 32 | const uint64_t result = rotl(s0 * 5, 7) * 9; 33 | 34 | s1 ^= s0; 35 | s[0] = rotl(s0, 24) ^ s1 ^ (s1 << 16); // a, b 36 | s[1] = rotl(s1, 37); // c 37 | 38 | return result; 39 | } 40 | 41 | // This is the jump function for the generator. It is equivalent 42 | // to 2^64 calls to next(); it can be used to generate 2^64 43 | // non-overlapping sub-sequences for parallel computations. 44 | inline void jump(uint64_t jumps) { 45 | static constexpr uint64_t JUMP[] = {0xdf900294d8f554a5, 0x170865df4b3201fc}; 46 | 47 | while (jumps--) { 48 | uint64_t s0 = 0; 49 | uint64_t s1 = 0; 50 | 51 | for (uint64_t i = 0; i < sizeof(JUMP) / sizeof(*JUMP); i++) 52 | for (int b = 0; b < 64; b++) { 53 | if (JUMP[i] & UINT64_C(1) << b) { 54 | s0 ^= s[0]; 55 | s1 ^= s[1]; 56 | } 57 | xoroshiro128(); 58 | } 59 | 60 | s[0] = s0; 61 | s[1] = s1; 62 | } 63 | } 64 | 65 | } // namespace riften 66 | -------------------------------------------------------------------------------- /test/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.14 FATAL_ERROR) 2 | 3 | # ---- Project ---- 4 | 5 | project(RiftenThiefpoolTest) 6 | 7 | # ---- Options ---- 8 | 9 | option(TEST_INSTALLED_VERSION "Test the version found by find_package" OFF) 10 | 11 | # ---- Include guards ---- 12 | 13 | if(PROJECT_SOURCE_DIR STREQUAL PROJECT_BINARY_DIR) 14 | message( 15 | FATAL_ERROR 16 | "In-source builds not allowed. Please make a new directory (called a build directory) and run CMake from there." 17 | ) 18 | endif() 19 | 20 | # ---- Add dependencies ---- 21 | 22 | find_package(Threads) 23 | 24 | include(../cmake/CPM.cmake) 25 | 26 | CPMAddPackage("gh:onqtam/doctest#2.4.5") 27 | 28 | if(TEST_INSTALLED_VERSION) 29 | find_package(RiftenThiefpool REQUIRED) 30 | else() 31 | CPMAddPackage(NAME RiftenThiefpool SOURCE_DIR ${CMAKE_CURRENT_LIST_DIR}/..) 32 | if(CMAKE_CXX_COMPILER_ID MATCHES "Clang" OR CMAKE_CXX_COMPILER_ID MATCHES "GNU") 33 | target_compile_options(RiftenThiefpool INTERFACE -Wall -Wextra -Wpedantic) 34 | elseif(MSVC) 35 | target_compile_options(RiftenThiefpool INTERFACE /W4) 36 | endif() 37 | endif() 38 | 39 | # ---- Tests ---- 40 | 41 | file(GLOB sources CONFIGURE_DEPENDS ${CMAKE_CURRENT_SOURCE_DIR}/*_test.cpp) 42 | add_executable(${PROJECT_NAME} "${sources}") 43 | 44 | # Link dependencies 45 | target_link_libraries( 46 | ${PROJECT_NAME} PUBLIC doctest::doctest RiftenThiefpool::RiftenThiefpool ${CMAKE_THREAD_LIBS_INIT} 47 | ) 48 | 49 | target_compile_definitions( 50 | ${PROJECT_NAME} PUBLIC $<$:DOCTEST_CONFIG_USE_STD_HEADERS> 51 | ) 52 | 53 | enable_testing() 54 | 55 | include(${doctest_SOURCE_DIR}/scripts/cmake/doctest.cmake) 56 | 57 | doctest_discover_tests(${PROJECT_NAME}) 58 | -------------------------------------------------------------------------------- /test/example_test.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | #include "doctest/doctest.h" 4 | #include "riften/thiefpool.hpp" 5 | 6 | TEST_CASE("README example") { 7 | // Create thread pool with 4 worker threads. 8 | riften::Thiefpool pool(4); 9 | 10 | // Enqueue and store future. 11 | auto result = pool.enqueue([](int x) { return x; }, 42); 12 | 13 | // Get result from future. 14 | std::cout << result.get() << std::endl; 15 | } 16 | -------------------------------------------------------------------------------- /test/thiefpool_test.cpp: -------------------------------------------------------------------------------- 1 | #define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN 2 | #include "doctest/doctest.h" 3 | 4 | #include "riften/thiefpool.hpp" 5 | 6 | #include 7 | #include 8 | #include 9 | #include 10 | 11 | TEST_CASE("Construct-Destruct") { 12 | for (std::size_t i = 0; i < 10000; i++) { 13 | riften::Thiefpool pool; 14 | } 15 | } 16 | 17 | void null_jobs(std::size_t threads) { 18 | std::vector> future; 19 | 20 | { 21 | riften::Thiefpool pool(threads); 22 | 23 | for (std::size_t i = 0; i < (1ul << 21); i++) { 24 | future.push_back(pool.enqueue([]() {})); 25 | } 26 | } 27 | 28 | for (auto&& f : future) { 29 | REQUIRE(f.valid()); 30 | f.wait(); 31 | } 32 | } 33 | 34 | TEST_CASE("Null jobs - 1 thread" * doctest::timeout(25)) { null_jobs(1); } 35 | TEST_CASE("Null jobs - 2 thread" * doctest::timeout(25)) { null_jobs(2); } 36 | TEST_CASE("Null jobs - 3 thread" * doctest::timeout(25)) { null_jobs(3); } 37 | TEST_CASE("Null jobs - 4 thread" * doctest::timeout(25)) { null_jobs(4); } 38 | TEST_CASE("Null jobs - 12 thread" * doctest::timeout(25)) { null_jobs(12); } 39 | 40 | void detach_job(std::size_t threads) { 41 | std::atomic counter; 42 | 43 | { 44 | riften::Thiefpool pool(threads); 45 | 46 | for (std::size_t i = 0; i < (1ul << 21); i++) { 47 | pool.enqueue_detach([&]() { counter.fetch_add(1); }); 48 | } 49 | } 50 | 51 | REQUIRE(counter == (1ul << 21)); 52 | } 53 | 54 | TEST_CASE("Detach jobs - 1 thread" * doctest::timeout(25)) { detach_job(1); } 55 | TEST_CASE("Detach jobs - 2 thread" * doctest::timeout(25)) { detach_job(2); } 56 | TEST_CASE("Detach jobs - 3 thread" * doctest::timeout(25)) { detach_job(3); } 57 | TEST_CASE("Detach jobs - 4 thread" * doctest::timeout(25)) { detach_job(4); } 58 | TEST_CASE("Detach jobs - 12 thread" * doctest::timeout(25)) { detach_job(12); } 59 | 60 | void fast_jobs(std::size_t threads) { 61 | std::vector> future; 62 | 63 | { 64 | riften::Thiefpool pool(threads); 65 | 66 | for (std::size_t i = 0; i < (1ul << 21); i++) { 67 | future.push_back(pool.enqueue([](int x) { return x; }, (int)i)); 68 | } 69 | } 70 | 71 | for (std::size_t i = 0; i < future.size(); i++) { 72 | REQUIRE(future[i].valid()); 73 | REQUIRE(future[i].get() == i); 74 | } 75 | } 76 | 77 | TEST_CASE("Fast jobs - 1 thread" * doctest::timeout(25)) { fast_jobs(1); } 78 | TEST_CASE("Fast jobs - 2 thread" * doctest::timeout(25)) { fast_jobs(2); } 79 | TEST_CASE("Fast jobs - 3 thread" * doctest::timeout(25)) { fast_jobs(3); } 80 | TEST_CASE("Fast jobs - 4 thread" * doctest::timeout(25)) { fast_jobs(4); } 81 | TEST_CASE("Fast jobs - 12 thread" * doctest::timeout(25)) { fast_jobs(12); } 82 | 83 | void waiting_jobs(std::size_t threads) { 84 | std::vector> future; 85 | 86 | { 87 | riften::Thiefpool pool(threads); 88 | 89 | for (std::size_t i = 0; i < 100; i++) { 90 | future.push_back(pool.enqueue( 91 | [](int x) { 92 | std::this_thread::sleep_for(std::chrono::milliseconds(100)); 93 | return x; 94 | }, 95 | (int)i)); 96 | } 97 | } 98 | 99 | for (std::size_t i = 0; i < future.size(); i++) { 100 | REQUIRE(future[i].valid()); 101 | REQUIRE(future[i].get() == i); 102 | } 103 | } 104 | 105 | TEST_CASE("Waiting jobs - 1 thread" * doctest::timeout(25)) { waiting_jobs(1); } 106 | TEST_CASE("Waiting jobs - 2 thread" * doctest::timeout(25)) { waiting_jobs(2); } 107 | TEST_CASE("Waiting jobs - 3 thread" * doctest::timeout(25)) { waiting_jobs(3); } 108 | TEST_CASE("Waiting jobs - 4 thread" * doctest::timeout(25)) { waiting_jobs(4); } 109 | TEST_CASE("Waiting jobs - 12 thread" * doctest::timeout(25)) { waiting_jobs(12); } 110 | 111 | void heterogenous_wait(std::size_t threads) { 112 | std::vector> future; 113 | 114 | { 115 | riften::Thiefpool pool(threads); 116 | 117 | for (std::size_t i = 0; i < 10 * threads; i++) { 118 | future.push_back( 119 | pool.enqueue([i]() { std::this_thread::sleep_for(std::chrono::milliseconds(i * 10)); })); 120 | } 121 | } 122 | 123 | for (std::size_t i = 0; i < future.size(); i++) { 124 | REQUIRE(future[i].valid()); 125 | future[i].get(); 126 | } 127 | } 128 | 129 | TEST_CASE("Heterogenous waiting jobs - 1 thread" * doctest::timeout(25)) { heterogenous_wait(1); } 130 | TEST_CASE("Heterogenous waiting jobs - 2 thread" * doctest::timeout(25)) { heterogenous_wait(2); } 131 | TEST_CASE("Heterogenous waiting jobs - 3 thread" * doctest::timeout(25)) { heterogenous_wait(3); } 132 | TEST_CASE("Heterogenous waiting jobs - 4 thread" * doctest::timeout(25)) { heterogenous_wait(4); } 133 | TEST_CASE("Heterogenous waiting jobs - 12 thread" * doctest::timeout(25)) { heterogenous_wait(12); } 134 | 135 | void heavy_jobs(std::size_t threads) { 136 | std::vector> future; 137 | 138 | { 139 | riften::Thiefpool pool(threads); 140 | 141 | for (std::size_t i = 0; i < 100; i++) { 142 | future.push_back(pool.enqueue([]() { 143 | int big_prime = 50'000'719; 144 | for (int i = 2; i < big_prime; i++) { 145 | if (big_prime % i == 0) { 146 | return false; 147 | } 148 | } 149 | return true; 150 | })); 151 | } 152 | } 153 | 154 | for (std::size_t i = 0; i < future.size(); i++) { 155 | REQUIRE(future[i].valid()); 156 | REQUIRE(future[i].get()); 157 | } 158 | } 159 | 160 | TEST_CASE("Heavy jobs - 1 thread" * doctest::timeout(25)) { heavy_jobs(1); } 161 | TEST_CASE("Heavy jobs - 2 thread" * doctest::timeout(25)) { heavy_jobs(2); } 162 | TEST_CASE("Heavy jobs - 3 thread" * doctest::timeout(25)) { heavy_jobs(3); } 163 | TEST_CASE("Heavy jobs - 4 thread" * doctest::timeout(25)) { heavy_jobs(4); } 164 | TEST_CASE("Heavy jobs - 12 thread" * doctest::timeout(25)) { heavy_jobs(12); } 165 | --------------------------------------------------------------------------------