├── .gitignore ├── .travis.yml ├── LICENSE ├── Makefile ├── README.md ├── main.c ├── plot.js ├── postprocess.py ├── runalltests ├── runtest.py └── tests ├── brk1.c ├── brk2.c ├── context_switch1.c ├── dup1.c ├── eventfd1.c ├── fallocate1.c ├── fallocate2.c ├── futex1.c ├── futex2.c ├── futex3.c ├── futex4.c ├── getppid1.c ├── lock1.c ├── lock2.c ├── lseek1.c ├── lseek2.c ├── malloc1.c ├── malloc2.c ├── mmap1.c ├── mmap2.c ├── open1.c ├── open2.c ├── open3.c ├── page_fault1.c ├── page_fault2.c ├── page_fault3.c ├── pipe1.c ├── poll1.c ├── poll2.c ├── posix_semaphore1.c ├── pread1.c ├── pread2.c ├── pread3.c ├── pthread_mutex1.c ├── pthread_mutex2.c ├── pthread_mutex3.c ├── pthread_mutex4.c ├── pthread_mutex5.c ├── pwrite1.c ├── pwrite2.c ├── pwrite3.c ├── read1.c ├── read2.c ├── read3.c ├── read4.c ├── readseek1.c ├── readseek2.c ├── readseek3.c ├── sched_yield.c ├── signal1.c ├── tlb_flush1.c ├── tlb_flush2.c ├── tlb_flush3.c ├── unix1.c ├── unlink1.c ├── unlink2.c ├── write1.c ├── writeseek1.c ├── writeseek2.c └── writeseek3.c /.gitignore: -------------------------------------------------------------------------------- 1 | *_processes 2 | *_threads 3 | tests/*.o 4 | *.csv 5 | *.title 6 | *.html 7 | -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: c 2 | cache: ccache 3 | os: 4 | - linux 5 | - linux-ppc64le 6 | addons: 7 | apt: 8 | packages: 9 | - libhwloc-dev 10 | script: make 11 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | CFLAGS+=-Wall -O2 -g 2 | LDFLAGS+=-lhwloc 3 | 4 | processes := $(patsubst tests/%.c,%_processes,$(wildcard tests/*.c)) 5 | threads := $(patsubst tests/%.c,%_threads,$(wildcard tests/*.c)) 6 | 7 | all: processes threads 8 | 9 | processes: $(processes) 10 | 11 | threads: $(threads) 12 | 13 | posix_semaphore1_processes_FLAGS+=-lpthread 14 | 15 | $(processes): %_processes: tests/%.o main.c 16 | $(CC) $(CFLAGS) main.c $< $($@_FLAGS) $(LDFLAGS) -o $@ 17 | 18 | $(threads): %_threads: tests/%.o main.c 19 | $(CC) -DTHREADS $(CFLAGS) main.c $< -pthread $(LDFLAGS) -o $@ 20 | 21 | clean: 22 | rm -f tests/*.o *_processes *_threads 23 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | will-it-scale 2 | ============= 3 | 4 | Overview 5 | -------- 6 | Will It Scale takes a testcase and runs it from 1 through to n parallel copies 7 | to see if the testcase will scale. It builds both a process and threads based 8 | test in order to see any differences between the two. 9 | 10 | We rely on hwloc for a platform independent way of laying out tasks on cores. 11 | It can be found at www.open-mpi.org/projects/hwloc/. 12 | 13 | Care is taken to try and reduce run to run variability. By using hwloc 14 | we ensure each task is on its own core and won't get bounced around by the 15 | scheduler. The wrapper script (runtest.py) turns off address space 16 | randomisation which can cause huge differences in pagetable related benchmarks 17 | (one run may fit within one pte page, the next may span two). There is a 18 | warmup period before which an average is taken. The averaging period can 19 | be changed with the -s option, which by default is 5 seconds. 20 | 21 | Testcase design 22 | --------------- 23 | Each test has two required components. A testcase description: 24 | 25 | char *testcase_description = "Context switch via pipes"; 26 | 27 | and a testcase() which is passed a pointer to an iteration count that the 28 | testcase should increment. This testcase is run whatever number of times the 29 | user specifies on the command line via the -t option: 30 | 31 | void testcase(unsigned long long *iterations) 32 | 33 | A (not very useful) example: 34 | 35 | #include 36 | #include 37 | 38 | char *testcase_description = "getppid"; 39 | 40 | void testcase(unsigned long long *iterations) 41 | { 42 | while (1) { 43 | getppid(); 44 | (*iterations)++; 45 | } 46 | } 47 | 48 | If you need to setup something globally such as a single file for all 49 | parallel testcases to operate on, there are two functions: 50 | 51 | void testcase_prepare(unsigned long nr_tasks) 52 | void testcase_cleanup(void) 53 | 54 | Finally if you need a new task such as when you want to write a context 55 | switch benchmark between two tasks, you can use: 56 | 57 | void new_task(void *(func)(void *), void *arg) 58 | 59 | This takes care of creating a new process or a new thread depending on 60 | which version of the test is being run. 61 | 62 | Quick start: 63 | 64 | make 65 | ./runalltests 66 | 67 | Postprocessing and graphing 68 | --------------------------- 69 | The graphing scripts use plotly, a client side javascript graphing package. 70 | 71 | To generate html files for generated results: 72 | 73 | ./postprocess.py 74 | 75 | Then load the generated html file in the browser. 76 | 77 | The graphs show number of tasks run on the x axis vs performance (in operations 78 | per second) on the left y axis. We also plot the amount of idle time against 79 | the right y axis. In the ideal case we should have an X pattern, with 80 | operations per second increasing and idle time decreasing. 81 | -------------------------------------------------------------------------------- /main.c: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright (C) 2010 Anton Blanchard , IBM 3 | * 4 | * This program is free software; you can redistribute it and/or 5 | * modify it under the terms of the GNU General Public License 6 | * as published by the Free Software Foundation; either version 7 | * 2 of the License, or (at your option) any later version. 8 | */ 9 | #define _GNU_SOURCE 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | #include 16 | #include 17 | #include 18 | #include 19 | #include 20 | #include 21 | #include 22 | #include 23 | 24 | #define MAX_TASKS 2048 25 | #define MAX_CACHELINE_SIZE 256 26 | #define WARMUP_ITERATIONS 5 27 | 28 | extern char *testcase_description; 29 | extern void __attribute__((weak)) testcase_prepare(unsigned long nr_tasks) { } 30 | extern void __attribute__((weak)) testcase_cleanup(void) { } 31 | extern void *testcase(unsigned long long *iterations, unsigned long nr); 32 | 33 | static char *initialise_shared_area(unsigned long size) 34 | { 35 | char template[] = "/tmp/shared_area_XXXXXX"; 36 | int fd; 37 | char *m; 38 | int page_size = getpagesize(); 39 | 40 | /* Align to page boundary */ 41 | size = (size + page_size-1) & ~(page_size-1); 42 | 43 | fd = mkstemp(template); 44 | if (fd < 0) { 45 | perror("mkstemp"); 46 | exit(1); 47 | } 48 | 49 | if (ftruncate(fd, size) == -1) { 50 | perror("ftruncate"); 51 | unlink(template); 52 | exit(1); 53 | } 54 | 55 | m = mmap(NULL, size, PROT_READ|PROT_WRITE, MAP_SHARED, fd, 0); 56 | if (m == MAP_FAILED) { 57 | perror("mmap"); 58 | unlink(template); 59 | exit(1); 60 | } 61 | 62 | memset(m, 0, size); 63 | 64 | unlink(template); 65 | 66 | return m; 67 | } 68 | 69 | static void usage(char *command) 70 | { 71 | printf("Usage: %s [options]\n\n", command); 72 | printf("\t-s iterations\tNumber of iterations to run\n"); 73 | printf("\t-t tasks\tNumber of threads or processes to run\n"); 74 | printf("\t-m\t\tAffinitize tasks on SMT threads (default cores)\n"); 75 | printf("\t-n\t\tNo affinity\n"); 76 | exit(1); 77 | } 78 | 79 | struct args 80 | { 81 | void *(*func)(unsigned long long *iterations, unsigned long nr); 82 | unsigned long long *arg1; 83 | unsigned long arg2; 84 | int poll_fd; 85 | hwloc_topology_t topology; 86 | hwloc_cpuset_t cpuset; 87 | }; 88 | 89 | static void *testcase_trampoline(void *p) 90 | { 91 | struct args *args = p; 92 | struct pollfd pfd = { args->poll_fd, POLLIN, 0 }; 93 | int ret; 94 | 95 | do { 96 | ret = poll(&pfd, 1, -1); 97 | } while ((ret == -1) && (errno == EINTR)); 98 | 99 | return args->func(args->arg1, args->arg2); 100 | } 101 | 102 | static bool use_affinity = true; 103 | 104 | #ifdef THREADS 105 | 106 | #include 107 | 108 | static pthread_t threads[2*MAX_TASKS]; 109 | static int nr_threads; 110 | 111 | void new_task(void *(func)(void *), void *arg) 112 | { 113 | pthread_create(&threads[nr_threads++], NULL, func, arg); 114 | } 115 | 116 | static void *pre_trampoline(void *p) 117 | { 118 | struct args *args = p; 119 | 120 | if (use_affinity && hwloc_set_thread_cpubind(args->topology, pthread_self(), args->cpuset, 0) < 0) { 121 | perror("hwloc_set_thread_cpubind"); 122 | exit(1); 123 | } 124 | 125 | pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, NULL); 126 | 127 | return testcase_trampoline(args); 128 | } 129 | 130 | void new_task_affinity(struct args *args) 131 | { 132 | pthread_attr_t attr; 133 | 134 | pthread_attr_init(&attr); 135 | 136 | pthread_create(&threads[nr_threads++], &attr, pre_trampoline, args); 137 | 138 | pthread_attr_destroy(&attr); 139 | } 140 | 141 | /* All threads will die when we exit */ 142 | static void kill_tasks(void) 143 | { 144 | int i; 145 | 146 | for (i = 0; i < nr_threads; i++) { 147 | pthread_cancel(threads[i]); 148 | } 149 | 150 | for (i = 0; i < nr_threads; i++) { 151 | pthread_join(threads[i], NULL); 152 | } 153 | } 154 | 155 | #else 156 | #include 157 | 158 | static int pids[2*MAX_TASKS]; 159 | static int nr_pids; 160 | 161 | /* Watchdog used to make sure all children exit when the parent does */ 162 | static int parent_pid; 163 | static void watchdog(int junk) 164 | { 165 | if (kill(parent_pid, 0) == -1) 166 | exit(0); 167 | 168 | alarm(1); 169 | } 170 | 171 | void new_task(void *(func)(void *), void *arg) 172 | { 173 | int pid; 174 | 175 | parent_pid = getpid(); 176 | 177 | pid = fork(); 178 | if (pid < 0) { 179 | perror("fork"); 180 | exit(1); 181 | } 182 | 183 | if (!pid) { 184 | struct sigaction sa; 185 | 186 | memset(&sa, 0, sizeof(sa)); 187 | sa.sa_handler = watchdog; 188 | sa.sa_flags = SA_RESTART; 189 | sigaction(SIGALRM, &sa, NULL); 190 | alarm(1); 191 | 192 | func(arg); 193 | } 194 | 195 | pids[nr_pids++] = pid; 196 | } 197 | 198 | void new_task_affinity(struct args *args) 199 | { 200 | int pid; 201 | 202 | parent_pid = getpid(); 203 | 204 | pid = fork(); 205 | if (pid < 0) { 206 | perror("fork"); 207 | exit(1); 208 | } 209 | 210 | if (!pid) { 211 | struct sigaction sa; 212 | 213 | memset(&sa, 0, sizeof(sa)); 214 | sa.sa_handler = watchdog; 215 | sa.sa_flags = SA_RESTART; 216 | sigaction(SIGALRM, &sa, NULL); 217 | alarm(1); 218 | 219 | testcase_trampoline(args); 220 | } 221 | 222 | pids[nr_pids++] = pid; 223 | } 224 | 225 | 226 | static void kill_tasks(void) 227 | { 228 | int i; 229 | 230 | for (i = 0; i < nr_pids; i++) 231 | kill(pids[i], SIGTERM); 232 | for (i = 0; i < nr_pids; i++) 233 | waitpid(pids[i], NULL, 0); 234 | } 235 | #endif 236 | 237 | int main(int argc, char *argv[]) 238 | { 239 | int opt_tasks = 1; 240 | int opt_iterations = 0; 241 | int iterations = 0; 242 | int i, n; 243 | char *m; 244 | static unsigned long long *results[MAX_TASKS]; 245 | hwloc_topology_t topology; 246 | unsigned long long prev[MAX_TASKS] = {0, }; 247 | unsigned long long total = 0; 248 | int fd[2]; 249 | bool smt_affinity = false; 250 | struct args *args; 251 | bool verbose = false; 252 | 253 | while (1) { 254 | signed char c = getopt(argc, argv, "mt:s:hvn"); 255 | if (c < 0) 256 | break; 257 | 258 | switch (c) { 259 | case 'm': 260 | smt_affinity = true; 261 | break; 262 | 263 | case 't': 264 | opt_tasks = atoi(optarg); 265 | if (opt_tasks > MAX_TASKS) { 266 | printf("tasks cannot exceed %d\n", 267 | MAX_TASKS); 268 | exit(1); 269 | } 270 | break; 271 | 272 | case 's': 273 | opt_iterations = atoi(optarg); 274 | break; 275 | 276 | case 'v': 277 | verbose = true; 278 | break; 279 | 280 | case 'n': 281 | use_affinity = false; 282 | break; 283 | 284 | default: 285 | usage(argv[0]); 286 | } 287 | } 288 | 289 | if (optind < argc) 290 | usage(argv[0]); 291 | 292 | if (smt_affinity && (use_affinity == false)) 293 | usage(argv[0]); 294 | 295 | m = initialise_shared_area(opt_tasks * MAX_CACHELINE_SIZE); 296 | for (i = 0; i < opt_tasks; i++) 297 | results[i] = (unsigned long long *)&m[i * MAX_CACHELINE_SIZE]; 298 | 299 | if (pipe(fd) == -1) { 300 | perror("pipe"); 301 | exit(1); 302 | } 303 | 304 | testcase_prepare(opt_tasks); 305 | 306 | hwloc_topology_init(&topology); 307 | hwloc_topology_load(topology); 308 | 309 | n = hwloc_get_nbobjs_by_type(topology, 310 | smt_affinity ? HWLOC_OBJ_PU : HWLOC_OBJ_CORE); 311 | if (n == 0) { 312 | printf("No Cores/PUs found. Try %s -m flag\n", 313 | smt_affinity ? "removing" : "adding"); 314 | exit(1); 315 | } 316 | if (n < 1) { 317 | perror("hwloc_get_nbobjs_by_type"); 318 | exit(1); 319 | } 320 | 321 | args = malloc(opt_tasks * sizeof(struct args)); 322 | if (!args) { 323 | perror("malloc"); 324 | exit(1); 325 | } 326 | 327 | for (i = 0; i < opt_tasks; i++) { 328 | hwloc_obj_t obj; 329 | hwloc_cpuset_t old_cpuset; 330 | int flags = 0; 331 | 332 | args[i].func = testcase; 333 | args[i].arg1 = results[i]; 334 | args[i].arg2 = i; 335 | args[i].poll_fd = fd[0]; 336 | 337 | obj = hwloc_get_obj_by_type(topology, 338 | smt_affinity ? HWLOC_OBJ_PU : HWLOC_OBJ_CORE, 339 | i % n); 340 | 341 | if (hwloc_topology_dup(&args[i].topology, topology)) { 342 | perror("hwloc_topology_dup"); 343 | exit(1); 344 | } 345 | 346 | if (!(args[i].cpuset = hwloc_bitmap_dup(obj->cpuset))) { 347 | perror("hwloc_bitmap_dup"); 348 | exit(1); 349 | } 350 | 351 | old_cpuset = hwloc_bitmap_alloc(); 352 | if (!old_cpuset) { 353 | perror("hwloc_bitmap_alloc"); 354 | exit(1); 355 | } 356 | #ifdef THREADS 357 | flags |= HWLOC_CPUBIND_THREAD; 358 | #endif 359 | if (hwloc_get_cpubind(topology, old_cpuset, flags) < 0) { 360 | perror("hwloc_get_cpubind"); 361 | exit(1); 362 | } 363 | 364 | if (use_affinity && hwloc_set_cpubind(topology, obj->cpuset, flags) < 0) { 365 | perror("hwloc_set_cpubind"); 366 | exit(1); 367 | } 368 | 369 | new_task_affinity(&args[i]); 370 | 371 | if (use_affinity && hwloc_set_cpubind(topology, old_cpuset, flags) < 0) { 372 | perror("hwloc_set_cpubind"); 373 | exit(1); 374 | } 375 | 376 | hwloc_bitmap_free(old_cpuset); 377 | } 378 | 379 | if (write(fd[1], &i, 1) != 1) { 380 | perror("write"); 381 | exit(1); 382 | } 383 | 384 | hwloc_topology_destroy(topology); 385 | 386 | printf("testcase:%s\n", testcase_description); 387 | 388 | printf("warmup\n"); 389 | 390 | while (1) { 391 | unsigned long long sum = 0, min = -1ULL, max = 0; 392 | 393 | sleep(1); 394 | 395 | for (i = 0; i < opt_tasks; i++) { 396 | unsigned long long val = *(results[i]); 397 | unsigned long long diff = val - prev[i]; 398 | 399 | if (verbose) 400 | printf("%4d -> %llu\n", i, diff); 401 | 402 | if (diff < min) 403 | min = diff; 404 | 405 | if (diff > max) 406 | max = diff; 407 | 408 | sum += diff; 409 | prev[i] = val; 410 | } 411 | 412 | printf("min:%llu max:%llu total:%llu\n", min, max, sum); 413 | 414 | if (iterations == WARMUP_ITERATIONS) 415 | printf("measurement\n"); 416 | 417 | if (iterations++ > WARMUP_ITERATIONS) 418 | total += sum; 419 | 420 | if (opt_iterations && 421 | (iterations > (opt_iterations + WARMUP_ITERATIONS))) { 422 | printf("average:%llu\n", total / opt_iterations); 423 | break; 424 | } 425 | } 426 | 427 | kill_tasks(); 428 | 429 | for (i = 0; i < opt_tasks; i++) { 430 | hwloc_bitmap_free(args[i].cpuset); 431 | hwloc_topology_destroy(args[i].topology); 432 | } 433 | free(args); 434 | 435 | testcase_cleanup(); 436 | exit(0); 437 | } 438 | -------------------------------------------------------------------------------- /plot.js: -------------------------------------------------------------------------------- 1 | function createPlot(data, title) { 2 | var x = []; 3 | var y1 = []; 4 | var y2 = []; 5 | var y3 = []; 6 | var y4 = []; 7 | var y5 = []; 8 | 9 | for (var r = 0; r < data.length; r++) { 10 | x.push(data[r][0]); 11 | y1.push(data[r][1]); 12 | y2.push(data[r][2]); 13 | y3.push(data[r][3]); 14 | y4.push(data[r][4]); 15 | y5.push(data[r][5]); 16 | } 17 | 18 | var trace1 = { 19 | x: x, 20 | y: y1, 21 | mode: 'lines+markers', 22 | name: 'Processes', 23 | line: { dash: 'solid', width: 4 }, 24 | marker: { size: 6 }, 25 | }; 26 | 27 | var trace2 = { 28 | x: x, 29 | y: y3, 30 | mode: 'lines+markers', 31 | name: 'Threads', 32 | line: { dash: 'solid', width: 4 }, 33 | marker: { size: 6 }, 34 | }; 35 | 36 | var trace3 = { 37 | x: x, 38 | y: y5, 39 | mode: 'lines', 40 | name: 'Linear', 41 | line: { dash: 'dot', width: 4 }, 42 | }; 43 | 44 | var trace4 = { 45 | x: x, 46 | y: y2, 47 | yaxis: 'y2', 48 | mode: 'lines+markers', 49 | name: 'Process idle', 50 | line: { dash: 'solid', width: 2 }, 51 | marker: { size: 8 }, 52 | }; 53 | 54 | var trace5 = { 55 | x: x, 56 | y: y4, 57 | yaxis: 'y2', 58 | mode: 'lines+markers', 59 | name: 'Thread idle', 60 | line: { dash: 'solid', width: 2 }, 61 | marker: { size: 8 }, 62 | }; 63 | 64 | var graphs = [trace1, trace2, trace3, trace4, trace5]; 65 | var layout = { 66 | title: title, 67 | xaxis: { title: 'Number of tasks' }, 68 | yaxis: { title: 'Operations per second' }, 69 | yaxis2: { title: 'Idle', side: 'right', overlaying: 'y', showline: true }, 70 | }; 71 | 72 | Plotly.newPlot('plot', graphs, layout); 73 | } 74 | -------------------------------------------------------------------------------- /postprocess.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python3 2 | 3 | import sys 4 | import os 5 | import csv 6 | import string 7 | 8 | template = ''' 9 | 10 | 11 | Will it scale? 12 | 13 | 14 | 15 | 16 | 17 |
18 | 22 | 23 | 24 | ''' 25 | 26 | def parse_data(csvfile): 27 | data = [] 28 | fp = open(csvfile) 29 | csv_reader = csv.reader(fp, dialect='excel') 30 | for row in csv_reader: 31 | data.append(row) 32 | fp.close() 33 | return data 34 | 35 | 36 | def process(base): 37 | csvfile = base + '.csv' 38 | titlefile = base + '.title' 39 | htmlfile = base + '.html' 40 | 41 | data = parse_data(csvfile) 42 | title = open(titlefile).readline().strip() 43 | 44 | t = string.Template(template) 45 | html = t.substitute(data=data, title=title) 46 | 47 | open(htmlfile, 'w').write(html) 48 | print('Created %s' % (htmlfile)) 49 | 50 | 51 | def for_each_file(dirname, subdirs, filenames): 52 | for f in filenames: 53 | if f.endswith('.csv'): 54 | process(f) 55 | 56 | 57 | if __name__ == '__main__': 58 | 59 | for root, dirs, files in os.walk('.'): 60 | if root == '.': 61 | for f in files: 62 | if f.endswith('.csv'): 63 | tmp = f.split('.', 1) 64 | try: 65 | process(tmp[0]) 66 | except: 67 | sys.exit(1) 68 | -------------------------------------------------------------------------------- /runalltests: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | for i in *_processes 4 | do 5 | TESTCASE=`basename $i _processes` 6 | echo "Running $TESTCASE" 7 | ./runtest.py $TESTCASE > $TESTCASE.csv 8 | done 9 | -------------------------------------------------------------------------------- /runtest.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python3 2 | 3 | import time 4 | import subprocess 5 | import sys 6 | import os 7 | import re 8 | 9 | class linux_stat(): 10 | def __init__(self, procstat='/proc/stat'): 11 | fd = open(procstat, 'r'); 12 | for line in fd.readlines(): 13 | arr = line.split() 14 | if arr[0] != 'cpu': 15 | continue 16 | 17 | self.user = int(arr[1]) 18 | self.nice = int(arr[2]) 19 | self.system = int(arr[3]) 20 | self.idle = int(arr[4]) 21 | self.iowait = int(arr[5]) 22 | self.irq = int(arr[6]) 23 | self.softirq = int(arr[7]) 24 | self.steal = 0 25 | self.guest = 0 26 | self.guest_nice = 0 27 | if len(arr) > 8: 28 | self.steal = int(arr[8]) 29 | if len(arr) > 9: 30 | self.guest = int(arr[9]) 31 | if len(arr) > 10: 32 | self.guest_nice = int(arr[10]) 33 | 34 | break 35 | fd.close() 36 | 37 | def idle_fraction(self, prev): 38 | busy = self.user + self.nice + self.system + self.irq + self.softirq + self.steal + self.guest + self.guest_nice 39 | idle = self.idle + self.iowait 40 | 41 | if prev: 42 | busy = busy - (prev.user + prev.nice + prev.system + prev.irq + prev.softirq + prev.steal + prev.guest + prev.guest_nice) 43 | idle = idle - (prev.idle + prev.iowait) 44 | 45 | if (idle + busy) == 0: 46 | return 0 47 | 48 | return 1.0 * idle / (idle + busy) 49 | 50 | 51 | duration=5 52 | 53 | if len(sys.argv) != 2: 54 | print('Usage: runtest.py ', file=sys.stderr) 55 | sys.exit(1) 56 | cmd = sys.argv[1] 57 | 58 | nr_cores=0 59 | r = re.compile('^processor') 60 | fd = open('/proc/cpuinfo', 'r') 61 | for line in fd.readlines(): 62 | if r.search(line): 63 | nr_cores = nr_cores + 1 64 | fd.close() 65 | 66 | setarch = 'setarch linux64 -R' 67 | try: 68 | retcode = subprocess.call(setarch + " /bin/true", shell=True) 69 | except OSError as e: 70 | retcode = -1 71 | 72 | if retcode != 0: 73 | setarch = '' 74 | print('WARNING: setarch -R failed, address space randomization may cause variability', file=sys.stderr) 75 | 76 | pipe = subprocess.Popen('uname -m', shell=True, stdout=subprocess.PIPE, text=True).stdout 77 | arch = pipe.readline().rstrip(os.linesep) 78 | pipe.close() 79 | 80 | if arch == 'ppc64': 81 | pipe = subprocess.Popen('ppc64_cpu --smt 2>&1', shell=True, stdout=subprocess.PIPE, text=True).stdout 82 | smt_status = pipe.readline() 83 | pipe.close() 84 | if 'off' not in smt_status: 85 | print('WARNING: SMT enabled, suggest disabling', file=sys.stderr) 86 | 87 | print('tasks,processes,processes_idle,threads,threads_idle,linear') 88 | print('0,0,100,0,100,0') 89 | 90 | step = 1 91 | # if step=5, this is: [5, 10, 15, ... nr_cores] 92 | data_points = list(range(step, nr_cores+step, step)) 93 | # this makes it [ 1, 5, 10, ... ] 94 | if step > 1: 95 | data_points.insert(0, 1) 96 | 97 | for i in data_points: 98 | c = './%s_processes -t %d -s %d' % (cmd, i, duration) 99 | before = linux_stat() 100 | pipe = subprocess.Popen(setarch + ' ' + c, shell=True, stdout=subprocess.PIPE, text=True).stdout 101 | processes_avg = -1 102 | for line in pipe.readlines(): 103 | if 'testcase:' in line: 104 | (testcase, val) = line.split(':') 105 | title = open(cmd + '.title', 'w') 106 | title.write(val) 107 | title.close() 108 | 109 | if 'average:' in line: 110 | (name, val) = line.split(':') 111 | processes_avg = int(val) 112 | pipe.close() 113 | after = linux_stat() 114 | processes_idle = after.idle_fraction(before) * 100 115 | 116 | c = './%s_threads -t %d -s %d' % (cmd, i, duration) 117 | before = linux_stat() 118 | pipe = subprocess.Popen(setarch + ' ' + c, shell=True, stdout=subprocess.PIPE, text=True).stdout 119 | threads_avg = -1 120 | for line in pipe.readlines(): 121 | if 'average:' in line: 122 | (name, val) = line.split(':') 123 | threads_avg = int(val) 124 | pipe.close() 125 | after = linux_stat() 126 | threads_idle = after.idle_fraction(before) * 100 127 | 128 | if i == 1: 129 | linear = max(processes_avg, threads_avg) 130 | 131 | print('%d,%d,%0.2f,%d,%0.2f,%d' % (i, processes_avg, processes_idle, threads_avg, threads_idle, linear * i)) 132 | -------------------------------------------------------------------------------- /tests/brk1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | char *testcase_description = "brk increase/decrease of one page"; 6 | 7 | void testcase(unsigned long long *iterations, unsigned long nr) 8 | { 9 | void *addr = sbrk(0); 10 | unsigned long page_size = getpagesize(); 11 | 12 | while (1) { 13 | addr += page_size; 14 | assert(brk(addr) == 0); 15 | 16 | addr -= page_size; 17 | assert(brk(addr) == 0); 18 | 19 | (*iterations) += 2; 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /tests/brk2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | char *testcase_description = "brk unshared increase/decrease of one page"; 6 | 7 | void testcase(unsigned long long *iterations, unsigned long nr) 8 | { 9 | unsigned long page_size = getpagesize(); 10 | void *addr = sbrk(page_size) + page_size; 11 | 12 | while (1) { 13 | addr += page_size; 14 | assert(brk(addr) == 0); 15 | 16 | addr -= page_size; 17 | assert(brk(addr) == 0); 18 | 19 | (*iterations) += 2; 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /tests/context_switch1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | #define READ 0 7 | #define WRITE 1 8 | 9 | char *testcase_description = "Context switch via pipes"; 10 | 11 | extern void new_task(void *(func)(void *), void *arg); 12 | 13 | struct args { 14 | int fd1[2]; 15 | int fd2[2]; 16 | }; 17 | 18 | static void *child(void *arg) 19 | { 20 | struct args *a = arg; 21 | char c; 22 | int ret; 23 | 24 | while (1) { 25 | do { 26 | ret = read(a->fd1[READ], &c, 1); 27 | } while (ret != 1 && errno == EINTR); 28 | assert(ret == 1); 29 | 30 | do { 31 | ret = write(a->fd2[WRITE], &c, 1); 32 | } while (ret != 1 && errno == EINTR); 33 | assert(ret == 1); 34 | } 35 | 36 | return NULL; 37 | } 38 | 39 | void testcase(unsigned long long *iterations, unsigned long nr) 40 | { 41 | struct args *a; 42 | char c; 43 | int ret; 44 | a = malloc(sizeof(struct args)); 45 | assert(pipe(a->fd1) == 0); 46 | assert(pipe(a->fd2) == 0); 47 | 48 | new_task(child, a); 49 | 50 | while (1) { 51 | do { 52 | ret = write(a->fd1[WRITE], &c, 1); 53 | } while (ret != 1 && errno == EINTR); 54 | assert(ret == 1); 55 | 56 | do { 57 | ret = read(a->fd2[READ], &c, 1); 58 | } while (ret != 1 && errno == EINTR); 59 | assert(ret == 1); 60 | 61 | (*iterations) += 2; 62 | } 63 | 64 | free(a); 65 | } 66 | -------------------------------------------------------------------------------- /tests/dup1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | char *testcase_description = "Separate file dup/close"; 6 | 7 | void testcase(unsigned long long *iterations, unsigned long nr) 8 | { 9 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 10 | int fd = mkstemp(tmpfile); 11 | 12 | assert(fd >= 0); 13 | unlink(tmpfile); 14 | 15 | while (1) { 16 | int fd2 = dup(fd); 17 | 18 | assert(fd2 >= 0); 19 | close(fd2); 20 | 21 | (*iterations)++; 22 | } 23 | 24 | close(fd); 25 | } 26 | -------------------------------------------------------------------------------- /tests/eventfd1.c: -------------------------------------------------------------------------------- 1 | #ifdef __linux__ 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | char *testcase_description = "eventfd read/write of 8 bytes"; 9 | 10 | void testcase(unsigned long long *iterations, unsigned long nr) 11 | { 12 | unsigned long long rbuf; 13 | unsigned long long wbuf; 14 | int fd = eventfd(0, 0); 15 | int ret; 16 | 17 | assert(fd >= 0); 18 | 19 | wbuf = 1; 20 | 21 | while (1) { 22 | do { 23 | ret = write(fd, &wbuf, sizeof(wbuf)); 24 | } while (ret != sizeof(wbuf) && errno == EINTR); 25 | assert(ret == sizeof(wbuf)); 26 | 27 | do { 28 | ret = read(fd, &rbuf, sizeof(rbuf)); 29 | } while (ret != sizeof(rbuf) && errno == EINTR); 30 | assert(ret == sizeof(wbuf)); 31 | 32 | (*iterations)++; 33 | } 34 | } 35 | #else 36 | char *testcase_description = "eventfd read/write of 8 bytes"; 37 | void testcase(unsigned long long *iterations, unsigned long nr) 38 | { 39 | } 40 | #endif 41 | -------------------------------------------------------------------------------- /tests/fallocate1.c: -------------------------------------------------------------------------------- 1 | #if __linux__ 2 | #define _GNU_SOURCE /* See feature_test_macros(7) */ 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | 10 | #define FILESIZE (1 * 1024 * 1024) 11 | #define BUFLEN (FILESIZE / 128) 12 | 13 | char *testcase_description = "Separate file fallocate against tmpfs"; 14 | 15 | void testcase(unsigned long long *iterations, unsigned long nr) 16 | { 17 | char tmpfile[] = "/dev/shm/willitscale.XXXXXX"; 18 | int fd = mkstemp(tmpfile); 19 | unsigned long place = 0; 20 | assert(fd >= 0); 21 | unlink(tmpfile); 22 | 23 | while (1) { 24 | int ret = fallocate(fd, 0, place, BUFLEN); 25 | if (errno != EINTR) 26 | assert(ret == 0); 27 | place += BUFLEN; 28 | if (place >= FILESIZE) { 29 | ret = ftruncate(fd, 0); 30 | assert(ret == 0); 31 | place = 0; 32 | } 33 | (*iterations)++; 34 | } 35 | } 36 | #else 37 | char *testcase_description = "Separate file fallocate "; 38 | void testcase(unsigned long long *iterations, unsigned long nr) 39 | { 40 | } 41 | #endif 42 | -------------------------------------------------------------------------------- /tests/fallocate2.c: -------------------------------------------------------------------------------- 1 | #if __linux__ 2 | #define _GNU_SOURCE /* See feature_test_macros(7) */ 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | 10 | #define FILESIZE (1 * 1024 * 1024) 11 | #define BUFLEN (FILESIZE / 128) 12 | 13 | char *testcase_description = "Separate file fallocate"; 14 | 15 | void testcase(unsigned long long *iterations, unsigned long nr) 16 | { 17 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 18 | int fd = mkstemp(tmpfile); 19 | unsigned long place = 0; 20 | assert(fd >= 0); 21 | unlink(tmpfile); 22 | 23 | while (1) { 24 | int ret = fallocate(fd, 0, place, BUFLEN); 25 | if (errno != EINTR) 26 | assert(ret == 0); 27 | place += BUFLEN; 28 | if (place >= FILESIZE) { 29 | ret = ftruncate(fd, 0); 30 | assert(ret == 0); 31 | place = 0; 32 | } 33 | (*iterations)++; 34 | } 35 | } 36 | #else 37 | char *testcase_description = "Separate file fallocate"; 38 | void testcase(unsigned long long *iterations, unsigned long nr) 39 | { 40 | } 41 | #endif 42 | -------------------------------------------------------------------------------- /tests/futex1.c: -------------------------------------------------------------------------------- 1 | #ifdef __linux__ 2 | #define _GNU_SOURCE 3 | #include 4 | #include 5 | #include 6 | 7 | #define futex(A, B, C, D, E, F) syscall(__NR_futex, A, B, C, D, E, F) 8 | 9 | char *testcase_description = "futex(FUTEX_WAKE)"; 10 | 11 | void testcase(unsigned long long *iterations, unsigned long nr) 12 | { 13 | while (1) { 14 | unsigned int addr = 0; 15 | 16 | futex(&addr, FUTEX_WAKE, 1, NULL, NULL, 0); 17 | 18 | (*iterations)++; 19 | } 20 | } 21 | #else 22 | char *testcase_description = "futex(FUTEX_WAKE)"; 23 | void testcase(unsigned long long *iterations, unsigned long nr) 24 | { 25 | } 26 | #endif 27 | -------------------------------------------------------------------------------- /tests/futex2.c: -------------------------------------------------------------------------------- 1 | #ifdef __linux__ 2 | #define _GNU_SOURCE 3 | #include 4 | #include 5 | #include 6 | 7 | #define futex(A, B, C, D, E, F) syscall(__NR_futex, A, B, C, D, E, F) 8 | 9 | char *testcase_description = "futex(FUTEX_WAIT)"; 10 | 11 | void testcase(unsigned long long *iterations, unsigned long nr) 12 | { 13 | while (1) { 14 | unsigned int addr = 0; 15 | 16 | futex(&addr, FUTEX_WAIT, 1, NULL, NULL, 0); 17 | 18 | (*iterations)++; 19 | } 20 | } 21 | #else 22 | char *testcase_description = "futex(FUTEX_WAIT)"; 23 | void testcase(unsigned long long *iterations, unsigned long nr) 24 | { 25 | } 26 | #endif 27 | -------------------------------------------------------------------------------- /tests/futex3.c: -------------------------------------------------------------------------------- 1 | #ifdef __linux__ 2 | #define _GNU_SOURCE 3 | #include 4 | #include 5 | #include 6 | 7 | #define futex(A, B, C, D, E, F) syscall(__NR_futex, A, B, C, D, E, F) 8 | 9 | char *testcase_description = "futex(FUTEX_WAKE_PRIVATE)"; 10 | 11 | void testcase(unsigned long long *iterations, unsigned long nr) 12 | { 13 | while (1) { 14 | unsigned int addr = 0; 15 | 16 | futex(&addr, FUTEX_WAKE_PRIVATE, 1, NULL, NULL, 0); 17 | 18 | (*iterations)++; 19 | } 20 | } 21 | #else 22 | char *testcase_description = "futex(FUTEX_WAKE_PRIVATE)"; 23 | void testcase(unsigned long long *iterations, unsigned long nr) 24 | { 25 | } 26 | #endif 27 | -------------------------------------------------------------------------------- /tests/futex4.c: -------------------------------------------------------------------------------- 1 | #ifdef __linux__ 2 | #define _GNU_SOURCE 3 | #include 4 | #include 5 | #include 6 | 7 | #define futex(A, B, C, D, E, F) syscall(__NR_futex, A, B, C, D, E, F) 8 | 9 | char *testcase_description = "futex(FUTEX_WAIT_PRIVATE)"; 10 | 11 | void testcase(unsigned long long *iterations, unsigned long nr) 12 | { 13 | while (1) { 14 | unsigned int addr = 0; 15 | 16 | futex(&addr, FUTEX_WAIT_PRIVATE, 1, NULL, NULL, 0); 17 | 18 | (*iterations)++; 19 | } 20 | } 21 | #else 22 | char *testcase_description = "futex(FUTEX_WAIT_PRIVATE)"; 23 | void testcase(unsigned long long *iterations, unsigned long nr) 24 | { 25 | } 26 | #endif 27 | -------------------------------------------------------------------------------- /tests/getppid1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | char *testcase_description = "getppid"; 5 | 6 | void testcase(unsigned long long *iterations, unsigned long nr) 7 | { 8 | while (1) { 9 | getppid(); 10 | 11 | (*iterations)++; 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /tests/lock1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | char *testcase_description = "Separate file write lock/unlock"; 8 | 9 | void testcase(unsigned long long *iterations, unsigned long nr) 10 | { 11 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 12 | int fd = mkstemp(tmpfile); 13 | 14 | assert(fd >= 0); 15 | unlink(tmpfile); 16 | 17 | while (1) { 18 | struct flock lck; 19 | 20 | lck.l_type = F_WRLCK; 21 | lck.l_whence = SEEK_SET; 22 | lck.l_start = 0; 23 | lck.l_len = 1; 24 | assert(fcntl(fd, F_SETLKW, &lck) == 0); 25 | 26 | lck.l_type = F_UNLCK; 27 | lck.l_whence = SEEK_SET; 28 | lck.l_start = 0; 29 | lck.l_len = 1; 30 | assert(fcntl(fd, F_SETLKW, &lck) == 0); 31 | 32 | (*iterations) += 2; 33 | } 34 | } 35 | -------------------------------------------------------------------------------- /tests/lock2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 8 | 9 | char *testcase_description = "Same file write lock/unlock"; 10 | 11 | void testcase_prepare(unsigned long nr_tasks) 12 | { 13 | assert(mkstemp(tmpfile) != -1); 14 | } 15 | 16 | void testcase(unsigned long long *iterations, unsigned long nr) 17 | { 18 | int fd = open(tmpfile, O_RDWR); 19 | 20 | assert(fd >= 0); 21 | 22 | while (1) { 23 | struct flock lck; 24 | 25 | lck.l_type = F_WRLCK; 26 | lck.l_whence = SEEK_SET; 27 | lck.l_start = 0; 28 | lck.l_len = 1; 29 | assert(fcntl(fd, F_SETLKW, &lck) == 0); 30 | 31 | lck.l_type = F_UNLCK; 32 | lck.l_whence = SEEK_SET; 33 | lck.l_start = 0; 34 | lck.l_len = 1; 35 | assert(fcntl(fd, F_SETLKW, &lck) == 0); 36 | 37 | (*iterations) += 2; 38 | } 39 | } 40 | 41 | void testcase_cleanup(void) 42 | { 43 | unlink(tmpfile); 44 | } 45 | -------------------------------------------------------------------------------- /tests/lseek1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | #define BUFLEN 4096 7 | 8 | char *testcase_description = "Separate file lseek"; 9 | 10 | void testcase(unsigned long long *iterations, unsigned long nr) 11 | { 12 | char buf[BUFLEN]; 13 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 14 | int fd = mkstemp(tmpfile); 15 | 16 | assert(fd >= 0); 17 | unlink(tmpfile); 18 | 19 | assert(write(fd, buf, sizeof(buf)) == sizeof(buf)); 20 | 21 | while (1) { 22 | lseek(fd, 0, SEEK_SET); 23 | 24 | (*iterations)++; 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /tests/lseek2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | 9 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 10 | 11 | char *testcase_description = "Same file lseek"; 12 | 13 | void testcase_prepare(unsigned long nr_tasks, unsigned long nr) 14 | { 15 | char buf[BUFLEN]; 16 | int fd = mkstemp(tmpfile); 17 | 18 | memset(buf, 0, sizeof(buf)); 19 | assert(fd >= 0); 20 | assert(write(fd, buf, sizeof(buf)) == sizeof(buf)); 21 | close(fd); 22 | } 23 | 24 | void testcase(unsigned long long *iterations) 25 | { 26 | int fd = open(tmpfile, O_RDWR); 27 | 28 | assert(fd >= 0); 29 | 30 | while (1) { 31 | lseek(fd, 0, SEEK_SET); 32 | 33 | (*iterations)++; 34 | } 35 | } 36 | 37 | void testcase_cleanup(void) 38 | { 39 | unlink(tmpfile); 40 | } 41 | -------------------------------------------------------------------------------- /tests/malloc1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | #define SIZE (128UL * 1024 * 1024) 7 | 8 | char *testcase_description = "malloc/free of 128MB"; 9 | 10 | void testcase(unsigned long long *iterations, unsigned long nr) 11 | { 12 | while (1) { 13 | void *addr = malloc(SIZE); 14 | assert(addr != NULL); 15 | free(addr); 16 | 17 | (*iterations)++; 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /tests/malloc2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | #define SIZE (1UL * 1024) 7 | 8 | char *testcase_description = "malloc/free of 1kB"; 9 | 10 | void testcase(unsigned long long *iterations, unsigned long nr) 11 | { 12 | while (1) { 13 | void *addr = malloc(SIZE); 14 | assert(addr != NULL); 15 | free(addr); 16 | 17 | (*iterations)++; 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /tests/mmap1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | #define MEMSIZE (128 * 1024 * 1024) 7 | 8 | char *testcase_description = "Anonymous memory mmap/munmap of 128MB"; 9 | 10 | void testcase(unsigned long long *iterations, unsigned long nr) 11 | { 12 | while (1) { 13 | char *c = mmap(NULL, MEMSIZE, PROT_READ|PROT_WRITE, 14 | MAP_PRIVATE|MAP_ANONYMOUS, -1, 0); 15 | assert(c != MAP_FAILED); 16 | munmap(c, MEMSIZE); 17 | 18 | (*iterations)++; 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /tests/mmap2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define MEMSIZE (128 * 1024 * 1024) 8 | 9 | char *testcase_description = "Separate file mmap/munmap of 128MB"; 10 | 11 | void testcase(unsigned long long *iterations, unsigned long nr) 12 | { 13 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 14 | int fd = mkstemp(tmpfile); 15 | 16 | assert(ftruncate(fd, MEMSIZE) == 0); 17 | unlink(tmpfile); 18 | 19 | while (1) { 20 | char *c = mmap(NULL, MEMSIZE, PROT_READ|PROT_WRITE, 21 | MAP_PRIVATE, fd, 0); 22 | assert(c != MAP_FAILED); 23 | munmap(c, MEMSIZE); 24 | 25 | (*iterations)++; 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /tests/open1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | 9 | char *testcase_description = "Separate file open/close"; 10 | 11 | #define template "/tmp/willitscale.XXXXXX" 12 | static char (*tmpfiles)[sizeof(template)]; 13 | static unsigned long local_nr_tasks; 14 | 15 | void testcase_prepare(unsigned long nr_tasks) 16 | { 17 | int i; 18 | tmpfiles = (char(*)[sizeof(template)])malloc(sizeof(template) * nr_tasks); 19 | assert(tmpfiles); 20 | 21 | for (i = 0; i < nr_tasks; i++) { 22 | strcpy(tmpfiles[i], template); 23 | char *tmpfile = tmpfiles[i]; 24 | int fd = mkstemp(tmpfile); 25 | 26 | assert(fd >= 0); 27 | close(fd); 28 | } 29 | 30 | local_nr_tasks = nr_tasks; 31 | } 32 | 33 | void testcase(unsigned long long *iterations, unsigned long nr) 34 | { 35 | char *tmpfile = tmpfiles[nr]; 36 | 37 | while (1) { 38 | int fd = open(tmpfile, O_RDWR); 39 | assert(fd >= 0); 40 | close(fd); 41 | 42 | (*iterations)++; 43 | } 44 | } 45 | 46 | void testcase_cleanup(void) 47 | { 48 | int i; 49 | for (i = 0; i < local_nr_tasks; i++) { 50 | unlink(tmpfiles[i]); 51 | } 52 | free(tmpfiles); 53 | } 54 | -------------------------------------------------------------------------------- /tests/open2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | 11 | char *testcase_description = "Separate file open/close in different directories"; 12 | 13 | #define template "/tmp/willitscale.XXXXXX" 14 | static char (*tmpdirs)[sizeof(template)]; 15 | static unsigned long local_nr_tasks; 16 | 17 | void testcase_prepare(unsigned long nr_tasks) 18 | { 19 | int i; 20 | tmpdirs = (char(*)[sizeof(template)])malloc(sizeof(template) * nr_tasks); 21 | assert(tmpdirs); 22 | 23 | char tmpfile[PATH_MAX]; 24 | int fd; 25 | 26 | for (i = 0; i < nr_tasks; i++) { 27 | strcpy(tmpdirs[i], template); 28 | char *tmpdir = tmpdirs[i]; 29 | assert(mkdtemp(tmpdir) != NULL); 30 | sprintf(tmpfile, "%s/willitscale", tmpdir); 31 | fd = open(tmpfile, O_RDWR|O_CREAT, 0600); 32 | assert(fd >= 0); 33 | close(fd); 34 | } 35 | 36 | local_nr_tasks = nr_tasks; 37 | } 38 | 39 | 40 | void testcase(unsigned long long *iterations, unsigned long nr) 41 | { 42 | int fd; 43 | char tmpfile[PATH_MAX]; 44 | sprintf(tmpfile, "%s/willitscale", tmpdirs[nr]); 45 | 46 | while (1) { 47 | fd = open(tmpfile, O_RDWR); 48 | assert(fd >= 0); 49 | close(fd); 50 | 51 | (*iterations)++; 52 | } 53 | } 54 | 55 | 56 | void testcase_cleanup(void) 57 | { 58 | int i; 59 | char tmpfile[PATH_MAX]; 60 | 61 | for (i = 0; i < local_nr_tasks; i++) { 62 | sprintf(tmpfile, "%s/willitscale", tmpdirs[i]); 63 | unlink(tmpfile); 64 | rmdir(tmpdirs[i]); 65 | } 66 | free(tmpdirs); 67 | } 68 | -------------------------------------------------------------------------------- /tests/open3.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 9 | 10 | char *testcase_description = "Same file open/close"; 11 | 12 | void testcase_prepare(unsigned long nr_tasks) 13 | { 14 | int fd = mkstemp(tmpfile); 15 | 16 | assert(fd >= 0); 17 | close(fd); 18 | } 19 | 20 | void testcase(unsigned long long *iterations, unsigned long nr) 21 | { 22 | while (1) { 23 | int fd = open(tmpfile, O_RDWR); 24 | assert(fd >= 0); 25 | close(fd); 26 | 27 | (*iterations)++; 28 | } 29 | } 30 | 31 | void testcase_cleanup(void) 32 | { 33 | unlink(tmpfile); 34 | } 35 | -------------------------------------------------------------------------------- /tests/page_fault1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | #define MEMSIZE (128 * 1024 * 1024) 7 | 8 | char *testcase_description = "Anonymous memory page fault"; 9 | 10 | void testcase(unsigned long long *iterations, unsigned long nr) 11 | { 12 | unsigned long pgsize = getpagesize(); 13 | 14 | while (1) { 15 | unsigned long i; 16 | 17 | char *c = mmap(NULL, MEMSIZE, PROT_READ|PROT_WRITE, 18 | MAP_PRIVATE|MAP_ANONYMOUS, -1, 0); 19 | assert(c != MAP_FAILED); 20 | 21 | for (i = 0; i < MEMSIZE; i += pgsize) { 22 | c[i] = 0; 23 | (*iterations)++; 24 | } 25 | 26 | munmap(c, MEMSIZE); 27 | } 28 | } 29 | -------------------------------------------------------------------------------- /tests/page_fault2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | #define MEMSIZE (128 * 1024 * 1024) 7 | 8 | char *testcase_description = "Separate file private mapping page fault"; 9 | 10 | void testcase(unsigned long long *iterations, unsigned long nr) 11 | { 12 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 13 | int fd = mkstemp(tmpfile); 14 | unsigned long pgsize = getpagesize(); 15 | 16 | assert(fd >= 0); 17 | assert(ftruncate(fd, MEMSIZE) == 0); 18 | unlink(tmpfile); 19 | 20 | while (1) { 21 | unsigned long i; 22 | 23 | char *c = mmap(NULL, MEMSIZE, PROT_READ|PROT_WRITE, 24 | MAP_PRIVATE, fd, 0); 25 | assert(c != MAP_FAILED); 26 | 27 | for (i = 0; i < MEMSIZE; i += pgsize) { 28 | c[i] = 0; 29 | (*iterations)++; 30 | } 31 | 32 | munmap(c, MEMSIZE); 33 | } 34 | } 35 | -------------------------------------------------------------------------------- /tests/page_fault3.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | #define MEMSIZE (128 * 1024 * 1024) 7 | 8 | char *testcase_description = "Separate file shared mapping page fault"; 9 | 10 | void testcase(unsigned long long *iterations, unsigned long nr) 11 | { 12 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 13 | int fd = mkstemp(tmpfile); 14 | unsigned long pgsize = getpagesize(); 15 | 16 | assert(fd >= 0); 17 | assert(ftruncate(fd, MEMSIZE) == 0); 18 | unlink(tmpfile); 19 | 20 | while (1) { 21 | unsigned long i; 22 | 23 | char *c = mmap(NULL, MEMSIZE, PROT_READ|PROT_WRITE, 24 | MAP_SHARED, fd, 0); 25 | assert(c != MAP_FAILED); 26 | 27 | for (i = 0; i < MEMSIZE; i += pgsize) { 28 | c[i] = 0; 29 | (*iterations)++; 30 | } 31 | 32 | munmap(c, MEMSIZE); 33 | } 34 | } 35 | -------------------------------------------------------------------------------- /tests/pipe1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | #define READ 0 7 | #define WRITE 1 8 | 9 | char *testcase_description = "pipe read/write"; 10 | 11 | void testcase(unsigned long long *iterations, unsigned long nr) 12 | { 13 | int fd[2]; 14 | 15 | assert(pipe(fd) == 0); 16 | 17 | while (1) { 18 | char c = 0; 19 | int ret; 20 | 21 | do { 22 | ret = write(fd[WRITE], &c, 1); 23 | } while (ret != 1 && errno == EINTR); 24 | 25 | do { 26 | ret = read(fd[READ], &c, 1); 27 | } while (ret != 1 && errno == EINTR); 28 | 29 | (*iterations)++; 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /tests/poll1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | char *testcase_description = "poll of 1 fd"; 8 | 9 | void testcase(unsigned long long *iterations, unsigned long nr) 10 | { 11 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 12 | int fd = mkstemp(tmpfile); 13 | 14 | assert(fd >= 0); 15 | unlink(tmpfile); 16 | 17 | while (1) { 18 | struct pollfd pfd[1]; 19 | 20 | memset(&pfd, 0, sizeof(pfd)); 21 | pfd[0].fd = fd; 22 | pfd[0].events = POLLOUT; 23 | 24 | assert(poll(pfd, 1, 0) >= 0); 25 | 26 | (*iterations)++; 27 | } 28 | } 29 | -------------------------------------------------------------------------------- /tests/poll2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | 11 | #define NR_FILES 128 12 | 13 | char *testcase_description = "poll of 128 fds"; 14 | 15 | void testcase_prepare(unsigned long nr_tasks) 16 | { 17 | struct rlimit rlim; 18 | int nr_procs = sysconf(_SC_NPROCESSORS_CONF); 19 | rlim_t new_lim = (NR_FILES + 10) * nr_procs; 20 | 21 | getrlimit(RLIMIT_NOFILE, &rlim); 22 | if (rlim.rlim_max < new_lim) { 23 | rlim.rlim_cur = new_lim; 24 | rlim.rlim_max = new_lim; 25 | } 26 | if (rlim.rlim_cur < new_lim) { 27 | rlim.rlim_cur = new_lim; 28 | } 29 | assert(setrlimit(RLIMIT_NOFILE, &rlim) == 0); 30 | } 31 | 32 | void testcase(unsigned long long *iterations, unsigned long nr) 33 | { 34 | int i; 35 | char tmpfile[PATH_MAX]; 36 | int tmpfiles[NR_FILES]; 37 | 38 | for (i = 0; i < NR_FILES; i++) { 39 | sprintf(tmpfile, "/tmp/willitscale.XXXXXX"); 40 | tmpfiles[i] = mkstemp(tmpfile); 41 | assert(tmpfiles[i] >= 0); 42 | unlink(tmpfile); 43 | } 44 | 45 | while (1) { 46 | struct pollfd pfd[NR_FILES]; 47 | 48 | memset(&pfd, 0, sizeof(pfd)); 49 | 50 | for (i = 0; i < NR_FILES; i++) { 51 | pfd[i].fd = tmpfiles[i]; 52 | pfd[i].events = POLLOUT; 53 | } 54 | 55 | assert(poll(pfd, NR_FILES, 0) >= 0); 56 | 57 | (*iterations)++; 58 | } 59 | } 60 | -------------------------------------------------------------------------------- /tests/posix_semaphore1.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | char *testcase_description = "POSIX semaphores"; 4 | 5 | void testcase(unsigned long long *iterations, unsigned long nr) 6 | { 7 | sem_t sem; 8 | 9 | sem_init(&sem, 0, 1); 10 | 11 | while (1) { 12 | sem_wait(&sem); 13 | sem_post(&sem); 14 | (*iterations)++; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /tests/pread1.c: -------------------------------------------------------------------------------- 1 | #define _XOPEN_SOURCE 500 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | 9 | char *testcase_description = "Separate file pread"; 10 | 11 | void testcase(unsigned long long *iterations, unsigned long nr) 12 | { 13 | char buf[BUFLEN]; 14 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 15 | int fd = mkstemp(tmpfile); 16 | 17 | memset(buf, 0, sizeof(buf)); 18 | assert(fd >= 0); 19 | assert(write(fd, buf, sizeof(buf)) == sizeof(buf)); 20 | unlink(tmpfile); 21 | 22 | while (1) { 23 | assert(pread(fd, buf, BUFLEN, 0) == BUFLEN); 24 | 25 | (*iterations)++; 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /tests/pread2.c: -------------------------------------------------------------------------------- 1 | #define _XOPEN_SOURCE 500 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #define BUFLEN 4096 9 | 10 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 11 | 12 | char *testcase_description = "Same file pread to same offset"; 13 | 14 | void testcase_prepare(unsigned long nr_tasks) 15 | { 16 | char buf[BUFLEN]; 17 | int fd = mkstemp(tmpfile); 18 | 19 | memset(buf, 0, sizeof(buf)); 20 | assert(fd >= 0); 21 | assert(write(fd, buf, sizeof(buf)) == sizeof(buf)); 22 | close(fd); 23 | } 24 | 25 | void testcase(unsigned long long *iterations, unsigned long nr) 26 | { 27 | char buf[BUFLEN]; 28 | int fd = open(tmpfile, O_RDONLY); 29 | 30 | assert(fd >= 0); 31 | 32 | while (1) { 33 | assert(pread(fd, buf, BUFLEN, 0) == BUFLEN); 34 | 35 | (*iterations)++; 36 | } 37 | } 38 | 39 | void testcase_cleanup(void) 40 | { 41 | unlink(tmpfile); 42 | } 43 | -------------------------------------------------------------------------------- /tests/pread3.c: -------------------------------------------------------------------------------- 1 | #define _XOPEN_SOURCE 500 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #define BUFLEN 4096 9 | 10 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 11 | 12 | char *testcase_description = "Same file pread to different offsets"; 13 | 14 | void testcase_prepare(unsigned long nr_tasks) 15 | { 16 | char buf[BUFLEN]; 17 | int fd = mkstemp(tmpfile); 18 | unsigned long left = getpagesize() * nr_tasks; 19 | 20 | memset(buf, 0, sizeof(buf)); 21 | assert(fd >= 0); 22 | 23 | while (left > 0) { 24 | int n = write(fd, buf, sizeof(buf)); 25 | assert(n > 0); 26 | left -= n; 27 | } 28 | close(fd); 29 | } 30 | 31 | void testcase(unsigned long long *iterations, unsigned long nr) 32 | { 33 | char buf[BUFLEN]; 34 | int fd = open(tmpfile, O_RDONLY); 35 | unsigned long offset = getpagesize() * nr; 36 | 37 | assert(fd >= 0); 38 | 39 | while (1) { 40 | assert(pread(fd, buf, BUFLEN, offset) == BUFLEN); 41 | 42 | (*iterations)++; 43 | } 44 | } 45 | 46 | void testcase_cleanup(void) 47 | { 48 | unlink(tmpfile); 49 | } 50 | -------------------------------------------------------------------------------- /tests/pthread_mutex1.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | 4 | char *testcase_description = "Contended pthread mutex"; 5 | 6 | pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; 7 | 8 | void testcase(unsigned long long *iterations, unsigned long nr) 9 | { 10 | while (1) { 11 | pthread_mutex_lock(&mutex); 12 | pthread_mutex_unlock(&mutex); 13 | 14 | (*iterations)++; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /tests/pthread_mutex2.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | 4 | char *testcase_description = "Uncontended pthread mutex"; 5 | 6 | void testcase(unsigned long long *iterations, unsigned long nr) 7 | { 8 | pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; 9 | 10 | while (1) { 11 | pthread_mutex_lock(&mutex); 12 | pthread_mutex_unlock(&mutex); 13 | 14 | (*iterations)++; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /tests/pthread_mutex3.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | 4 | char *testcase_description = "Contended pthread mutex with global update"; 5 | 6 | pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; 7 | unsigned long val; 8 | 9 | void testcase(unsigned long long *iterations, unsigned long nr) 10 | { 11 | while (1) { 12 | pthread_mutex_lock(&mutex); 13 | val++; 14 | pthread_mutex_unlock(&mutex); 15 | 16 | (*iterations)++; 17 | } 18 | } 19 | -------------------------------------------------------------------------------- /tests/pthread_mutex4.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | #include 4 | 5 | char *testcase_description = "Contended pthread mutex with local update"; 6 | 7 | pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; 8 | 9 | void testcase(unsigned long long *iterations, unsigned long nr) 10 | { 11 | // alloca() because plain "unsigned long val" gets optimized away. 12 | unsigned long *val = alloca(sizeof(unsigned long)); 13 | *(val) = 0; 14 | 15 | while (1) { 16 | pthread_mutex_lock(&mutex); 17 | (*val)++; 18 | pthread_mutex_unlock(&mutex); 19 | 20 | (*iterations)++; 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /tests/pthread_mutex5.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | 4 | char *testcase_description = "Contended pthread mutex with TLS update"; 5 | 6 | pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; 7 | __thread unsigned long val; 8 | 9 | void testcase(unsigned long long *iterations, unsigned long nr) 10 | { 11 | while (1) { 12 | pthread_mutex_lock(&mutex); 13 | val++; 14 | pthread_mutex_unlock(&mutex); 15 | 16 | (*iterations)++; 17 | } 18 | } 19 | -------------------------------------------------------------------------------- /tests/pwrite1.c: -------------------------------------------------------------------------------- 1 | #define _XOPEN_SOURCE 500 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | 9 | char *testcase_description = "Separate file pwrite"; 10 | 11 | void testcase(unsigned long long *iterations, unsigned long nr) 12 | { 13 | char buf[BUFLEN]; 14 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 15 | int fd = mkstemp(tmpfile); 16 | 17 | memset(buf, 0, sizeof(buf)); 18 | assert(fd >= 0); 19 | unlink(tmpfile); 20 | 21 | while (1) { 22 | assert(pwrite(fd, buf, BUFLEN, 0) == BUFLEN); 23 | 24 | (*iterations)++; 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /tests/pwrite2.c: -------------------------------------------------------------------------------- 1 | #define _XOPEN_SOURCE 500 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #define BUFLEN 4096 9 | 10 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 11 | 12 | char *testcase_description = "Same file pwrite to same offset"; 13 | 14 | void testcase_prepare(unsigned long nr_tasks) 15 | { 16 | char buf[BUFLEN]; 17 | int fd = mkstemp(tmpfile); 18 | 19 | memset(buf, 0, sizeof(buf)); 20 | assert(fd >= 0); 21 | assert(write(fd, buf, sizeof(buf)) == sizeof(buf)); 22 | close(fd); 23 | } 24 | 25 | void testcase(unsigned long long *iterations, unsigned long nr) 26 | { 27 | char buf[BUFLEN]; 28 | int fd = open(tmpfile, O_RDWR); 29 | 30 | assert(fd >= 0); 31 | 32 | while (1) { 33 | assert(pwrite(fd, buf, BUFLEN, 0) == BUFLEN); 34 | 35 | (*iterations)++; 36 | } 37 | } 38 | 39 | void testcase_cleanup(void) 40 | { 41 | unlink(tmpfile); 42 | } 43 | -------------------------------------------------------------------------------- /tests/pwrite3.c: -------------------------------------------------------------------------------- 1 | #define _XOPEN_SOURCE 500 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #define BUFLEN 4096 9 | 10 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 11 | 12 | char *testcase_description = "Same file pwrite to different offsets"; 13 | 14 | void testcase_prepare(unsigned long nr_tasks) 15 | { 16 | char buf[BUFLEN]; 17 | int fd = mkstemp(tmpfile); 18 | unsigned long left = getpagesize() * nr_tasks; 19 | 20 | memset(buf, 0, sizeof(buf)); 21 | assert(fd >= 0); 22 | 23 | while (left > 0) { 24 | int n = write(fd, buf, sizeof(buf)); 25 | assert(n > 0); 26 | left -= n; 27 | } 28 | close(fd); 29 | } 30 | 31 | void testcase(unsigned long long *iterations, unsigned long nr) 32 | { 33 | char buf[BUFLEN]; 34 | int fd = open(tmpfile, O_RDWR); 35 | unsigned long offset = getpagesize() * nr; 36 | 37 | assert(fd >= 0); 38 | 39 | while (1) { 40 | assert(pwrite(fd, buf, BUFLEN, offset) == BUFLEN); 41 | 42 | (*iterations)++; 43 | } 44 | } 45 | 46 | void testcase_cleanup(void) 47 | { 48 | unlink(tmpfile); 49 | } 50 | -------------------------------------------------------------------------------- /tests/read1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | #define FILESIZE (1 * 1024 * 1024) 9 | 10 | char *testcase_description = "Separate file read"; 11 | 12 | void testcase(unsigned long long *iterations, unsigned long nr) 13 | { 14 | char buf[FILESIZE]; 15 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 16 | int fd = mkstemp(tmpfile); 17 | 18 | unlink(tmpfile); 19 | 20 | memset(buf, 0, sizeof(buf)); 21 | assert(fd >= 0); 22 | assert(write(fd, buf, sizeof(buf)) == sizeof(buf)); 23 | 24 | while (1) { 25 | int len = read(fd, buf, BUFLEN); 26 | assert(len >= 0); 27 | if (len == 0) 28 | lseek(fd, 0, SEEK_SET); 29 | 30 | (*iterations)++; 31 | } 32 | } 33 | -------------------------------------------------------------------------------- /tests/read2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | #define FILESIZE (1 * 1024 * 1024) 9 | 10 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 11 | 12 | char *testcase_description = "Same file read"; 13 | 14 | void testcase_prepare(unsigned long nr_tasks) 15 | { 16 | char buf[FILESIZE]; 17 | int fd = mkstemp(tmpfile); 18 | 19 | memset(buf, 0, sizeof(buf)); 20 | assert(fd >= 0); 21 | assert(write(fd, buf, sizeof(buf)) == sizeof(buf)); 22 | close(fd); 23 | } 24 | 25 | void testcase(unsigned long long *iterations, unsigned long nr) 26 | { 27 | char buf[BUFLEN]; 28 | int fd = open(tmpfile, O_RDONLY); 29 | 30 | assert(fd >= 0); 31 | 32 | while (1) { 33 | int ret = read(fd, buf, BUFLEN); 34 | assert(ret >= 0); 35 | if (ret == 0) 36 | lseek(fd, 0, SEEK_SET); 37 | 38 | (*iterations)++; 39 | } 40 | } 41 | 42 | void testcase_cleanup(void) 43 | { 44 | unlink(tmpfile); 45 | } 46 | -------------------------------------------------------------------------------- /tests/read3.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #define BUFLEN getpagesize() 9 | #define FILESIZE (1 * 1024 * 1024) 10 | 11 | char *testcase_description = "Separate file O_DIRECT read"; 12 | 13 | void testcase(unsigned long long *iterations, unsigned long nr) 14 | { 15 | char *buf; 16 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 17 | int fd = mkostemp(tmpfile, O_DIRECT); 18 | char *p; 19 | 20 | buf = aligned_alloc(getpagesize(), FILESIZE); 21 | memset(buf, 0, FILESIZE); 22 | assert(fd >= 0); 23 | assert(write(fd, buf, FILESIZE) == FILESIZE); 24 | unlink(tmpfile); 25 | 26 | p = malloc(BUFLEN + getpagesize()); 27 | p = (char *)(((unsigned long)p + getpagesize()-1) & ~(getpagesize()-1)); 28 | 29 | while (1) { 30 | int ret = read(fd, p, BUFLEN); 31 | assert(ret >= 0); 32 | if (ret == 0) 33 | lseek(fd, 0, SEEK_SET); 34 | 35 | (*iterations)++; 36 | } 37 | free(buf); 38 | } 39 | -------------------------------------------------------------------------------- /tests/read4.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #define BUFLEN getpagesize() 9 | #define FILESIZE (1 * 1024 * 1024) 10 | 11 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 12 | 13 | char *testcase_description = "Same file O_DIRECT read"; 14 | 15 | void testcase_prepare(unsigned long nr_tasks) 16 | { 17 | int fd = mkstemp(tmpfile); 18 | char buf[FILESIZE]; 19 | 20 | memset(buf, 0, sizeof(buf)); 21 | assert(fd >= 0); 22 | assert(write(fd, buf, sizeof(buf)) == sizeof(buf)); 23 | close(fd); 24 | } 25 | 26 | void testcase(unsigned long long *iterations, unsigned long nr) 27 | { 28 | int fd = open(tmpfile, O_DIRECT|O_RDONLY); 29 | char *p; 30 | 31 | p = aligned_alloc(getpagesize(), BUFLEN); 32 | 33 | while (1) { 34 | int ret = read(fd, p, BUFLEN); 35 | assert(ret >= 0); 36 | if (ret == 0) 37 | lseek(fd, 0, SEEK_SET); 38 | 39 | (*iterations)++; 40 | } 41 | free(p); 42 | } 43 | 44 | void testcase_cleanup(void) 45 | { 46 | unlink(tmpfile); 47 | } 48 | -------------------------------------------------------------------------------- /tests/readseek1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | 9 | char *testcase_description = "Separate file seek+read"; 10 | 11 | void testcase(unsigned long long *iterations, unsigned long nr) 12 | { 13 | char buf[BUFLEN]; 14 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 15 | int fd = mkstemp(tmpfile); 16 | 17 | memset(buf, 0, sizeof(buf)); 18 | assert(fd >= 0); 19 | assert(write(fd, buf, sizeof(buf)) == sizeof(buf)); 20 | unlink(tmpfile); 21 | 22 | while (1) { 23 | lseek(fd, 0, SEEK_SET); 24 | assert(read(fd, buf, BUFLEN) == BUFLEN); 25 | 26 | (*iterations)++; 27 | } 28 | } 29 | -------------------------------------------------------------------------------- /tests/readseek2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | 9 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 10 | 11 | char *testcase_description = "Same file seek+read to same offset"; 12 | 13 | void testcase_prepare(unsigned long nr_tasks) 14 | { 15 | char buf[BUFLEN]; 16 | int fd = mkstemp(tmpfile); 17 | 18 | memset(buf, 0, sizeof(buf)); 19 | assert(fd >= 0); 20 | assert(write(fd, buf, sizeof(buf)) == sizeof(buf)); 21 | close(fd); 22 | } 23 | 24 | void testcase(unsigned long long *iterations, unsigned long nr) 25 | { 26 | char buf[BUFLEN]; 27 | int fd = open(tmpfile, O_RDWR); 28 | 29 | assert(fd >= 0); 30 | 31 | while (1) { 32 | lseek(fd, 0, SEEK_SET); 33 | assert(read(fd, buf, BUFLEN) == BUFLEN); 34 | 35 | (*iterations)++; 36 | } 37 | } 38 | 39 | void testcase_cleanup(void) 40 | { 41 | unlink(tmpfile); 42 | } 43 | -------------------------------------------------------------------------------- /tests/readseek3.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | 9 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 10 | 11 | char *testcase_description = "Same file seek+read to different offsets"; 12 | 13 | void testcase_prepare(unsigned long nr_tasks) 14 | { 15 | char buf[BUFLEN]; 16 | int fd = mkstemp(tmpfile); 17 | unsigned long left = getpagesize() * nr_tasks; 18 | 19 | memset(buf, 0, sizeof(buf)); 20 | assert(fd >= 0); 21 | 22 | while (left > 0) { 23 | int n = write(fd, buf, sizeof(buf)); 24 | assert(n > 0); 25 | left -= n; 26 | } 27 | close(fd); 28 | } 29 | 30 | void testcase(unsigned long long *iterations, unsigned long nr) 31 | { 32 | char buf[BUFLEN]; 33 | int fd = open(tmpfile, O_RDONLY); 34 | unsigned long offset = getpagesize() * nr; 35 | 36 | assert(fd >= 0); 37 | 38 | while (1) { 39 | lseek(fd, offset, SEEK_SET); 40 | assert(read(fd, buf, BUFLEN) == BUFLEN); 41 | 42 | (*iterations)++; 43 | } 44 | } 45 | 46 | void testcase_cleanup(void) 47 | { 48 | unlink(tmpfile); 49 | } 50 | -------------------------------------------------------------------------------- /tests/sched_yield.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | char *testcase_description = "sched_yield"; 5 | 6 | void testcase(unsigned long long *iterations, unsigned long nr) 7 | { 8 | while (1) { 9 | assert(sched_yield() == 0); 10 | 11 | (*iterations)++; 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /tests/signal1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | void handler(int junk) 8 | { 9 | /* Do Nothing */ 10 | } 11 | 12 | char *testcase_description = "signal delivery"; 13 | 14 | void testcase(unsigned long long *iterations, unsigned long nr) 15 | { 16 | struct sigaction act; 17 | 18 | memset(&act, 0, sizeof(act)); 19 | act.sa_handler = handler; 20 | sigaction(SIGUSR1, &act, NULL); 21 | 22 | while (1) { 23 | raise(SIGUSR1); 24 | 25 | (*iterations)++; 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /tests/tlb_flush1.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE /* See feature_test_macros(7) */ 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | 12 | #define FILESIZE (128 * 1024 * 1024) 13 | 14 | char *testcase_description = "TLB flush of separate file private mapping"; 15 | 16 | void testcase(unsigned long *iteration, unsigned long nr) 17 | { 18 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 19 | int fd = mkstemp(tmpfile); 20 | unsigned long offset = 0; 21 | unsigned long pgsize = getpagesize(); 22 | assert(fd >= 0); 23 | assert(ftruncate(fd, FILESIZE) == 0); 24 | unlink(tmpfile); 25 | unsigned long i; 26 | 27 | while (1) { 28 | char *addr = mmap(NULL, FILESIZE, PROT_READ|PROT_WRITE, 29 | MAP_PRIVATE, fd, offset); 30 | for (i = 0; i < FILESIZE; i += pgsize) { 31 | *(addr + i) = 1; 32 | madvise(addr + i, pgsize, MADV_DONTNEED); 33 | assert(*(addr + i) == 0); 34 | (*iteration)++; 35 | } 36 | munmap(addr, FILESIZE); 37 | } 38 | } 39 | -------------------------------------------------------------------------------- /tests/tlb_flush2.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE /* See feature_test_macros(7) */ 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | 12 | #define MEMORYSIZE (1 * 1024 * 1024) 13 | 14 | char *testcase_description = "TLB flush of anonymous memory private mapping"; 15 | 16 | void testcase(unsigned long *iteration, unsigned long nr) 17 | { 18 | unsigned long pgsize = getpagesize(); 19 | unsigned long i; 20 | 21 | while (1) { 22 | char *addr = mmap(NULL, MEMORYSIZE, PROT_READ|PROT_WRITE, 23 | MAP_ANONYMOUS | MAP_PRIVATE, -1, 0); 24 | for (i = 0; i < MEMORYSIZE; i += pgsize) { 25 | *(addr + i) = 1; 26 | madvise(addr + i, pgsize, MADV_DONTNEED); 27 | assert(*(addr + i) == 0); 28 | (*iteration)++; 29 | } 30 | munmap(addr, MEMORYSIZE); 31 | } 32 | } 33 | -------------------------------------------------------------------------------- /tests/tlb_flush3.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE /* See feature_test_macros(7) */ 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | 12 | #define FILESIZE (128 * 1024 * 1024) 13 | 14 | char *testcase_description = "TLB flush of separate file shared mapping"; 15 | 16 | void testcase(unsigned long *iteration, unsigned long nr) 17 | { 18 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 19 | int fd = mkstemp(tmpfile); 20 | unsigned long offset = 0; 21 | unsigned long pgsize = getpagesize(); 22 | assert(fd >= 0); 23 | assert(ftruncate(fd, FILESIZE) == 0); 24 | unlink(tmpfile); 25 | unsigned long i; 26 | 27 | while (1) { 28 | char *addr = mmap(NULL, FILESIZE, PROT_READ|PROT_WRITE, 29 | MAP_SHARED, fd, offset); 30 | for (i = 0; i < FILESIZE; i += pgsize) { 31 | *(addr + i) = 1; 32 | madvise(addr + i, pgsize, MADV_DONTNEED); 33 | assert(*(addr + i) == 1); 34 | (*iteration)++; 35 | } 36 | munmap(addr, FILESIZE); 37 | } 38 | } 39 | -------------------------------------------------------------------------------- /tests/unix1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define READ 0 8 | #define WRITE 1 9 | 10 | char *testcase_description = "unix domain socket read/write"; 11 | 12 | void testcase(unsigned long long *iterations, unsigned long nr) 13 | { 14 | int fd[2]; 15 | char c; 16 | int ret; 17 | 18 | socketpair(AF_UNIX, SOCK_STREAM, 0, fd); 19 | 20 | while (1) { 21 | do { 22 | ret = write(fd[WRITE], &c, 1); 23 | } while (ret != 1 && errno == EINTR); 24 | 25 | do { 26 | ret = read(fd[READ], &c, 1); 27 | } while (ret != 1 && errno == EINTR); 28 | 29 | (*iterations)++; 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /tests/unlink1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | 9 | char *testcase_description = "Separate file open/close/unlink"; 10 | 11 | #define template "/tmp/willitscale.XXXXXX" 12 | static char (*tmpfiles)[sizeof(template)]; 13 | static int local_nr_tasks; 14 | 15 | 16 | void testcase_prepare(unsigned long nr_tasks) 17 | { 18 | int i; 19 | tmpfiles = (char(*)[sizeof(template)])malloc(sizeof(template) * nr_tasks); 20 | assert(tmpfiles); 21 | 22 | for (i = 0; i < nr_tasks; i++) { 23 | strcpy(tmpfiles[i], template); 24 | char *tmpfile = tmpfiles[i]; 25 | int fd = mkstemp(tmpfile); 26 | 27 | assert(fd >= 0); 28 | close(fd); 29 | unlink(tmpfile); 30 | } 31 | 32 | local_nr_tasks = nr_tasks; 33 | } 34 | 35 | 36 | void testcase(unsigned long long *iterations, unsigned long nr) 37 | { 38 | char *tmpfile = tmpfiles[nr]; 39 | 40 | while (1) { 41 | int fd = open(tmpfile, O_RDWR|O_CREAT, 0600); 42 | assert(fd >= 0); 43 | close(fd); 44 | unlink(tmpfile); 45 | 46 | (*iterations)++; 47 | } 48 | } 49 | 50 | 51 | void testcase_cleanup(void) 52 | { 53 | int i; 54 | for (i = 0; i < local_nr_tasks; i++) { 55 | unlink(tmpfiles[i]); 56 | } 57 | free(tmpfiles); 58 | } 59 | -------------------------------------------------------------------------------- /tests/unlink2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | 11 | char *testcase_description = "Separate file open/close/unlink in different directories"; 12 | 13 | #define template "/tmp/willitscale.XXXXXX" 14 | static char (*tmpdirs)[sizeof(template)]; 15 | static unsigned long local_nr_tasks; 16 | 17 | void testcase_prepare(unsigned long nr_tasks) 18 | { 19 | int i; 20 | tmpdirs = (char(*)[sizeof(template)])malloc(sizeof(template) * nr_tasks); 21 | assert(tmpdirs); 22 | 23 | char tmpfile[PATH_MAX]; 24 | int fd; 25 | 26 | for (i = 0; i < nr_tasks; i++) { 27 | strcpy(tmpdirs[i], template); 28 | char *tmpdir = tmpdirs[i]; 29 | assert(mkdtemp(tmpdir) != NULL); 30 | sprintf(tmpfile, "%s/willitscale", tmpdir); 31 | fd = open(tmpfile, O_RDWR|O_CREAT, 0600); 32 | assert(fd >= 0); 33 | close(fd); 34 | } 35 | 36 | local_nr_tasks = nr_tasks; 37 | } 38 | 39 | 40 | void testcase(unsigned long long *iterations, unsigned long nr) 41 | { 42 | char tmpfile[PATH_MAX]; 43 | 44 | sprintf(tmpfile, "%s/willitscale", tmpdirs[nr]); 45 | 46 | while (1) { 47 | int fd = open(tmpfile, O_RDWR|O_CREAT, 0600); 48 | assert(fd >= 0); 49 | close(fd); 50 | unlink(tmpfile); 51 | 52 | (*iterations)++; 53 | } 54 | } 55 | 56 | 57 | void testcase_cleanup(void) 58 | { 59 | int i; 60 | char tmpfile[PATH_MAX]; 61 | 62 | for (i = 0; i < local_nr_tasks; i++) { 63 | sprintf(tmpfile, "%s/willitscale", tmpdirs[i]); 64 | unlink(tmpfile); 65 | rmdir(tmpdirs[i]); 66 | } 67 | free(tmpdirs); 68 | } 69 | -------------------------------------------------------------------------------- /tests/write1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | #define FILESIZE (1 * 1024 * 1024) 9 | 10 | char *testcase_description = "Separate file write"; 11 | 12 | void testcase(unsigned long long *iterations, unsigned long nr) 13 | { 14 | char buf[BUFLEN]; 15 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 16 | int fd = mkstemp(tmpfile); 17 | unsigned long size = 0; 18 | 19 | memset(buf, 0, sizeof(buf)); 20 | assert(fd >= 0); 21 | unlink(tmpfile); 22 | 23 | while (1) { 24 | int ret = write(fd, buf, BUFLEN); 25 | assert(ret >= 0); 26 | size += ret; 27 | if (size >= FILESIZE) { 28 | size = 0; 29 | lseek(fd, 0, SEEK_SET); 30 | } 31 | 32 | (*iterations)++; 33 | } 34 | } 35 | -------------------------------------------------------------------------------- /tests/writeseek1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | 9 | char *testcase_description = "Separate file seek+write"; 10 | 11 | void testcase(unsigned long long *iterations, unsigned long nr) 12 | { 13 | char buf[BUFLEN]; 14 | char tmpfile[] = "/tmp/willitscale.XXXXXX"; 15 | int fd = mkstemp(tmpfile); 16 | 17 | memset(buf, 0, sizeof(buf)); 18 | assert(fd >= 0); 19 | unlink(tmpfile); 20 | 21 | while (1) { 22 | lseek(fd, 0, SEEK_SET); 23 | assert(write(fd, buf, BUFLEN) == BUFLEN); 24 | 25 | (*iterations)++; 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /tests/writeseek2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | 9 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 10 | 11 | char *testcase_description = "Same file seek+read to same offset"; 12 | 13 | void testcase_prepare(unsigned long nr_tasks) 14 | { 15 | char buf[BUFLEN]; 16 | int fd = mkstemp(tmpfile); 17 | 18 | memset(buf, 0, sizeof(buf)); 19 | assert(fd >= 0); 20 | assert(write(fd, buf, sizeof(buf)) == sizeof(buf)); 21 | close(fd); 22 | } 23 | 24 | void testcase(unsigned long long *iterations, unsigned long nr) 25 | { 26 | char buf[BUFLEN]; 27 | int fd = open(tmpfile, O_RDWR); 28 | 29 | assert(fd >= 0); 30 | 31 | while (1) { 32 | lseek(fd, 0, SEEK_SET); 33 | assert(write(fd, buf, BUFLEN) == BUFLEN); 34 | 35 | (*iterations)++; 36 | } 37 | } 38 | 39 | void testcase_cleanup(void) 40 | { 41 | unlink(tmpfile); 42 | } 43 | -------------------------------------------------------------------------------- /tests/writeseek3.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #define BUFLEN 4096 8 | 9 | static char tmpfile[] = "/tmp/willitscale.XXXXXX"; 10 | 11 | char *testcase_description = "Same file seek+write to different offsets"; 12 | 13 | void testcase_prepare(unsigned long nr_tasks) 14 | { 15 | char buf[BUFLEN]; 16 | int fd = mkstemp(tmpfile); 17 | unsigned long left = getpagesize() * nr_tasks; 18 | 19 | memset(buf, 0, sizeof(buf)); 20 | assert(fd >= 0); 21 | 22 | while (left > 0) { 23 | int n = write(fd, buf, sizeof(buf)); 24 | assert(n > 0); 25 | left -= n; 26 | } 27 | close(fd); 28 | } 29 | 30 | void testcase(unsigned long long *iterations, unsigned long nr) 31 | { 32 | char buf[BUFLEN]; 33 | int fd = open(tmpfile, O_RDWR); 34 | unsigned long offset = getpagesize() * nr; 35 | 36 | assert(fd >= 0); 37 | 38 | while (1) { 39 | lseek(fd, offset, SEEK_SET); 40 | assert(write(fd, buf, BUFLEN) == BUFLEN); 41 | 42 | (*iterations)++; 43 | } 44 | } 45 | 46 | void testcase_cleanup(void) 47 | { 48 | unlink(tmpfile); 49 | } 50 | --------------------------------------------------------------------------------