├── .gitignore ├── LICENSE ├── c_list.c ├── c_list.h ├── lib ├── pthread.c └── pthread.h ├── m_vector.h ├── main.c ├── mpool.c ├── mpool.h ├── thpool.c ├── thpool.h ├── ycmpool.pro └── ycmpool.pro.user /.gitignore: -------------------------------------------------------------------------------- 1 | # Object files 2 | *.o 3 | *.ko 4 | *.obj 5 | *.elf 6 | 7 | # Precompiled Headers 8 | *.gch 9 | *.pch 10 | 11 | # Libraries 12 | *.lib 13 | *.a 14 | *.la 15 | *.lo 16 | 17 | # Shared objects (inc. Windows DLLs) 18 | *.dll 19 | *.so 20 | *.so.* 21 | *.dylib 22 | 23 | # Executables 24 | *.exe 25 | *.out 26 | *.app 27 | *.i*86 28 | *.x86_64 29 | *.hex 30 | 31 | # Debug files 32 | *.dSYM/ 33 | -------------------------------------------------------------------------------- /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 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 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 | {project} Copyright (C) {year} {fullname} 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 | -------------------------------------------------------------------------------- /c_list.c: -------------------------------------------------------------------------------- 1 |  2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #include "c_list.h" 8 | #include "string.h" 9 | 10 | c_list_node * list_node_new( int unit) 11 | { 12 | c_list_node *nd = (c_list_node*)malloc(sizeof(c_list_node)); 13 | 14 | assert(nd->data!=NULL); 15 | if ( nd ) 16 | { 17 | memset(nd,0,sizeof(c_list_node)); 18 | } 19 | nd->data = malloc(unit); 20 | return nd; 21 | } 22 | 23 | c_list * list_init( int unit) 24 | { 25 | c_list *list = (c_list*)malloc(sizeof(c_list)); 26 | 27 | c_list_node *head = list_node_new(unit), 28 | *tail = list_node_new(unit); 29 | int i = 0; 30 | 31 | assert(list != NULL ); 32 | assert(head != NULL ); 33 | assert(tail != NULL ); 34 | 35 | memset(list,0,sizeof(c_list)); 36 | 37 | list->head = head; 38 | list->tail = tail; 39 | 40 | list->head->next = list->tail; 41 | list->tail ->pre = list->head; 42 | 43 | list->size = 0; 44 | 45 | return list; 46 | } 47 | void list_free(c_list *list) 48 | { 49 | uint32_t i = 0; 50 | 51 | c_list_node *node = NULL,*tmp; 52 | 53 | assert(list != NULL ); 54 | 55 | node = list->head; 56 | 57 | while ( node ) 58 | { 59 | free(node->data); 60 | tmp = node->next; 61 | free(node); 62 | node = tmp; 63 | } 64 | 65 | free(list); 66 | 67 | } 68 | 69 | void _list_push_back(c_list *list, c_list_node *nd) 70 | { 71 | 72 | assert(nd != NULL); 73 | assert(list != NULL); 74 | 75 | list->tail->pre ->next = nd; 76 | nd->next = list->tail; 77 | nd->pre = list->tail->pre; 78 | list->tail->pre = nd; 79 | list->size++; 80 | } 81 | 82 | void list_push_back(c_list *list, void *value, int unit) 83 | { 84 | uint32_t pos = list->size; 85 | c_list_node *node = list_node_new(unit); 86 | memcpy(node->data,value,unit); 87 | _list_push_back(list,node); 88 | 89 | } 90 | void list_push_front(c_list *list, void *value,int unit) 91 | { 92 | c_list_node *nd = list_node_new(unit); 93 | memcpy(nd->data,value,unit); 94 | _list_push_back(list,nd); 95 | } 96 | 97 | void _list_push_front(c_list *list, c_list_node *nd) 98 | { 99 | 100 | assert(list != NULL); 101 | assert(nd != NULL); 102 | 103 | list->head->next ->pre = nd; 104 | 105 | nd->next = list->head->next; 106 | nd->pre = list->head; 107 | } 108 | 109 | c_list_node *_list_read_back(c_list *list) 110 | { 111 | assert(list); 112 | return list->tail->pre; 113 | } 114 | 115 | c_list_node *_list_read_front(c_list *list) 116 | { 117 | assert(list); 118 | return list->head->next; 119 | } 120 | 121 | void * list_read_back(c_list *list) 122 | { 123 | return (_list_read_back(list)->data); 124 | } 125 | 126 | void *list_read_front(c_list *list) 127 | { 128 | return (_list_read_front(list)->data); 129 | } 130 | 131 | void list_erase_back(c_list *list) 132 | { 133 | c_list_node *nd = (list->tail->pre); 134 | 135 | list->tail ->pre = (nd)->pre; 136 | (nd)->pre ->next = list->tail; 137 | 138 | free(nd);nd = NULL; 139 | } 140 | void list_erase_front(c_list *list) 141 | { 142 | c_list_node *nd = list->head->next; 143 | 144 | list->head->next = nd->next; 145 | nd->next ->pre = list->head; 146 | 147 | free(nd); 148 | nd = NULL; 149 | } 150 | 151 | void list_erase(c_list *list, c_list_node *nd) 152 | { 153 | c_list_node *cur = list->head->next; 154 | 155 | assert( nd != list->head && nd != list->tail ); 156 | 157 | while ( cur ) 158 | { 159 | if ( cur->data == nd->data ) 160 | { 161 | cur->pre->next = cur->next; 162 | cur->next->pre = cur->pre; 163 | free(cur); 164 | break; 165 | } 166 | cur = cur->next; 167 | 168 | } 169 | 170 | } 171 | -------------------------------------------------------------------------------- /c_list.h: -------------------------------------------------------------------------------- 1 | #ifndef C_LIST_H 2 | #define C_LIST_H 3 | 4 | #define LIST_INIT_SIZE 1000 5 | #define LIST_INC_SIZE 1000 6 | 7 | #include 8 | 9 | typedef struct c_list_node c_list_node; 10 | typedef struct c_list c_list; 11 | 12 | 13 | 14 | #ifdef __cplusplus 15 | extern "C" 16 | { 17 | #endif 18 | 19 | #define HF_List c_list 20 | typedef c_list YC_List; 21 | 22 | #define List_Create( Type ) \ 23 | list_init(sizeof(Type)) 24 | 25 | #define List_Free(list) \ 26 | list_free(list) 27 | 28 | #define List_Push_Back(Type,list,v) \ 29 | {\ 30 | c_list_node *node = list_node_new(sizeof(Type)); \ 31 | *(Type*)(node->data) = v; \ 32 | _list_push_back(list,node);\ 33 | } 34 | 35 | #define List_Push_Front(Type,list,v) \ 36 | {\ 37 | c_list_node *node = list_node_new(sizeof(Type)); \ 38 | *(Type*)node->data = v; \ 39 | _list_push_front(list,node);\ 40 | } 41 | 42 | #define List_Erase_Back(list) \ 43 | list->size--; \ 44 | list_erase_back(list) 45 | 46 | #define List_Erase_Front(list) \ 47 | list->size--;\ 48 | list_erase_front(list) 49 | 50 | #define List_Erase(Type,list,v) \ 51 | {\ 52 | c_list_node *cur = list->head->next;\ 53 | assert( nd != list->head && nd != list->tail );\ \ 54 | while ( cur )\ 55 | {\ 56 | if ( *(Type*)cur->data == *(Type*)nd->data )\ 57 | {\ 58 | cur->pre->next = cur->next;\ 59 | cur->next->pre = cur->pre;\ 60 | free(cur);\ 61 | break;\ 62 | }\ 63 | cur = cur->next;\ 64 | \ 65 | }\ 66 | } 67 | 68 | #define List_Free(list) \ 69 | list_free(list) 70 | 71 | #define List_Read_Front(Type,list) \ 72 | *(Type*)(_list_read_front(list)->data) 73 | #define List_Read_Back(Type,list) \ 74 | *(Type*)(_list_read_back(list)->data) 75 | 76 | #define List_Begin(list) list->head->next 77 | #define List_End(list) list->tail 78 | 79 | struct c_list_node 80 | { 81 | c_list_node *pre; 82 | c_list_node *next; 83 | void *data; 84 | }; 85 | 86 | struct c_list 87 | { 88 | c_list_node *head; 89 | c_list_node *tail; 90 | c_list_node *iterator; 91 | 92 | uint32_t size; 93 | 94 | }; 95 | 96 | c_list_node* list_node_new(int unit); 97 | 98 | c_list* list_init(int unit); 99 | void list_free(c_list *list); 100 | 101 | void _list_push_back(c_list *list, c_list_node *nd); 102 | void _list_push_front(c_list *list, c_list_node *nd); 103 | 104 | void list_push_back (c_list *list, void *value, int unit); 105 | void list_push_front(c_list *list, void *value, int unit); 106 | 107 | void list_erase_back(c_list *list); 108 | void list_erase_front(c_list *list); 109 | void list_erase(c_list *list, c_list_node *nd); 110 | 111 | 112 | 113 | c_list_node *_list_read_back(c_list *list); 114 | c_list_node *_list_read_front(c_list *list); 115 | 116 | void * list_read_back(c_list *list); 117 | void * list_read_front(c_list *list); 118 | 119 | 120 | #ifdef __cplusplus 121 | } 122 | #endif 123 | 124 | #endif // C_LIST_H 125 | -------------------------------------------------------------------------------- /lib/pthread.c: -------------------------------------------------------------------------------- 1 | /* 2 | * Pthreads compat. 3 | * 4 | * Copyright (c) 2007-2009 Marko Kreen 5 | * 6 | * Permission to use, copy, modify, and/or distribute this software for any 7 | * purpose with or without fee is hereby granted, provided that the above 8 | * copyright notice and this permission notice appear in all copies. 9 | * 10 | * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES 11 | * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF 12 | * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR 13 | * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES 14 | * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN 15 | * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF 16 | * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. 17 | */ 18 | 19 | 20 | #include "pthread.h" 21 | 22 | /* 23 | * basic pthreads for win32. 24 | */ 25 | 26 | struct _w32thread { 27 | void *(*fn)(void *); 28 | void *arg; 29 | }; 30 | 31 | static DWORD WINAPI w32launcher(LPVOID arg) 32 | { 33 | struct _w32thread *info = arg; 34 | info->fn(info->arg); 35 | free(info); 36 | return 0; 37 | } 38 | 39 | int pthread_create(pthread_t *t, pthread_attr_t *attr, void *(*fn)(void *), void *arg) 40 | { 41 | struct _w32thread *info = calloc(1, sizeof(*info)); 42 | if (!info) 43 | return -1; 44 | info->fn = fn; 45 | info->arg = arg; 46 | *t = CreateThread(NULL, 0, w32launcher, info, 0, NULL); 47 | if (*t == NULL) 48 | return -1; 49 | return 0; 50 | } 51 | 52 | int pthread_join(pthread_t *t, void **ret) 53 | { 54 | if (WaitForSingleObject(*t, INFINITE) != WAIT_OBJECT_0) 55 | return -1; 56 | CloseHandle(*t); 57 | return 0; 58 | } 59 | 60 | int pthread_mutex_init(pthread_mutex_t *lock, void *unused) 61 | { 62 | *lock = CreateMutex(NULL, FALSE, NULL); 63 | if (*lock == NULL) 64 | return -1; 65 | return 0; 66 | } 67 | 68 | int pthread_mutex_destroy(pthread_mutex_t *lock) 69 | { 70 | if (*lock) { 71 | CloseHandle(*lock); 72 | *lock = NULL; 73 | } 74 | return 0; 75 | } 76 | 77 | int pthread_mutex_lock(pthread_mutex_t *lock) 78 | { 79 | if (WaitForSingleObject(*lock, INFINITE) != WAIT_OBJECT_0) 80 | return -1; 81 | return 0; 82 | } 83 | 84 | int pthread_mutex_unlock(pthread_mutex_t *lock) 85 | { 86 | if (!ReleaseMutex(*lock)) 87 | return -1; 88 | return 0; 89 | } 90 | 91 | -------------------------------------------------------------------------------- /lib/pthread.h: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright (c) 2007-2009 Marko Kreen 3 | * 4 | * Permission to use, copy, modify, and/or distribute this software for any 5 | * purpose with or without fee is hereby granted, provided that the above 6 | * copyright notice and this permission notice appear in all copies. 7 | * 8 | * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES 9 | * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF 10 | * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR 11 | * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES 12 | * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN 13 | * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF 14 | * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. 15 | */ 16 | 17 | /** @file 18 | * 19 | * Pthreads compat for win32. 20 | */ 21 | #ifndef _USUAL_PTHREAD_H_ 22 | #define _USUAL_PTHREAD_H_ 23 | 24 | #ifdef __cplusplus 25 | extern "C"{ 26 | #endif 27 | 28 | 29 | #include 30 | 31 | typedef HANDLE pthread_t; 32 | typedef HANDLE pthread_mutex_t; 33 | typedef int pthread_attr_t; 34 | 35 | int pthread_create(pthread_t *t, pthread_attr_t *attr, void *(*fn)(void *), void *arg); 36 | int pthread_mutex_init(pthread_mutex_t *lock, void *unused); 37 | int pthread_mutex_destroy(pthread_mutex_t *lock); 38 | int pthread_mutex_lock(pthread_mutex_t *lock); 39 | int pthread_mutex_unlock(pthread_mutex_t *lock); 40 | int pthread_join(pthread_t *t, void **ret); 41 | 42 | #ifdef __cplusplus 43 | } 44 | #endif 45 | 46 | #endif /* HAVE_PTHREAD_H */ 47 | 48 | -------------------------------------------------------------------------------- /m_vector.h: -------------------------------------------------------------------------------- 1 | /* 2 | * GNU GENERAL PUBLIC LICENSE 3 | * Version 3, 29 June 2007 4 | * Copyright (C) 2016 XD.Yang 5 | * Everyone is permitted to copy and distribute verbatim copies 6 | * of this license document, but changing it is not allowed. 7 | */ 8 | #ifndef M_VECTOR_H 9 | #define M_VECTOR_H 10 | 11 | #include 12 | #include 13 | 14 | 15 | typedef struct 16 | { 17 | void **_store; 18 | int _size; 19 | int _cap; 20 | }LineTable; 21 | 22 | #define Linear_New() (LineTable*)malloc(sizeof(LineTable)) 23 | 24 | #define Linear(LT,SZ) \ 25 | {\ 26 | LT->_cap = SZ; LT->_size = 0;LT->_store = (void**)calloc(SZ,sizeof(void*));\ 27 | } 28 | 29 | #define Line_Append(LT,V)\ 30 | {\ 31 | if ( LT->_size >= LT->_cap )\ 32 | _Extend(LT);\ 33 | LT->_store[ LT->_size++] = V;\ 34 | } 35 | 36 | #define _Extend(LT) \ 37 | {\ 38 | int _cap = LT->_cap * 3;\ 39 | LT->_store = (void**)realloc(LT->_store,sizeof(void**)*_cap);\ 40 | assert(LT->_store != NULL);\ 41 | LT->_cap = _cap;\ 42 | } 43 | 44 | #define Line_Free(LT) \ 45 | {free(LT->_store);} 46 | 47 | #define Line_Get(LT,I) (LT->_store[I]) 48 | 49 | #define Line_Set(LT,I,V) (LT->_store[I] = V) 50 | 51 | #endif // M_VECTOR_H 52 | -------------------------------------------------------------------------------- /main.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | #include "mpool.h" 5 | #include "m_vector.h" 6 | 7 | #include "thpool.h" 8 | 9 | 10 | int bsz = 8; 11 | int times = 100000; 12 | int runtimes = 100; 13 | 14 | void test_pool() 15 | { 16 | MemPool *pool = pool_create(128,10); 17 | char *cp; 18 | int i = 0; 19 | for ( ; i < 15; ++i ) 20 | { 21 | char *c = (char*)m_malloc(pool); 22 | 23 | sprintf(c,"%d\tThis Is My Pool\n",i+1); 24 | printf(c); 25 | } 26 | 27 | cp = m_malloc(pool); 28 | m_free(pool,&cp); 29 | m_free(pool,&cp); 30 | 31 | cp = m_malloc(pool); 32 | 33 | pool_release(pool); 34 | } 35 | 36 | void * f1(void *arg) 37 | { 38 | printf("==================Func 1\n"); 39 | return NULL; 40 | } 41 | void * f2(void* arg) 42 | { 43 | printf("==================Func 2\n"); 44 | return NULL; 45 | } 46 | void test_malloc() 47 | { 48 | clock_t start, end; 49 | int i , j ; 50 | 51 | 52 | start = clock(); 53 | for( j = 0 ;j < runtimes; ++j) 54 | for ( i = 0 ; i < times; ++i) 55 | { 56 | void *f = malloc(bsz); 57 | free(f); 58 | } 59 | end = clock(); 60 | fprintf(stdout,"malloc Time Ellapsed:%d\n",end-start); 61 | } 62 | 63 | //void test_boost() 64 | //{ 65 | // boost::pool<> bpool(bsz); 66 | // clock_t start, end; 67 | // int i , j; 68 | 69 | // start = clock(); 70 | // for( j = 0 ;j < runtimes; ++j) 71 | // for ( i = 0 ; i < times; ++i) 72 | // { 73 | // void *f = bpool.malloc(); 74 | // bpool.free(f,bsz); 75 | // } 76 | // end = clock(); 77 | // fprintf(stdout,"Boost Pool Time Ellapsed:%dms\n",end-start); 78 | 79 | //} 80 | 81 | void test_mempool() 82 | { 83 | MemPool *block = pool_create(bsz,1); 84 | clock_t start, end; 85 | int i , j ; 86 | 87 | 88 | start = clock(); 89 | for( j = 0 ;j < runtimes; ++j) 90 | for ( i = 0 ; i < times; ++i) 91 | { 92 | void *f = m_malloc(block); 93 | m_free(block,&f); 94 | } 95 | end = clock(); 96 | fprintf(stdout,"Block Pool Time Ellapsed:%d\n",end-start); 97 | pool_release(block); 98 | } 99 | 100 | //void test_threadpool() 101 | //{ 102 | // thPool *pool = thpool_create(3); 103 | // Task t1 = {f1,NULL}, t2 = {f2,NULL}; 104 | 105 | // add_Task(pool,&t2); 106 | // add_Task(pool,&t2); 107 | // add_Task(pool,&t1); 108 | // add_Task(pool,&t1); 109 | // add_Task(pool,&t1); 110 | // add_Task(pool,&t2); 111 | // Sleep(3000); 112 | // thpool_release(pool); 113 | //} 114 | 115 | int main(void) 116 | { 117 | // test_boost(); 118 | test_pool(); 119 | test_mempool(); 120 | test_malloc(); 121 | // test_threadpool(); 122 | 123 | return 0; 124 | } 125 | 126 | -------------------------------------------------------------------------------- /mpool.c: -------------------------------------------------------------------------------- 1 | /* 2 | * GNU GENERAL PUBLIC LICENSE 3 | * Version 3, 29 June 2007 4 | * Copyright (C) 2016 XD.Yang 5 | * Everyone is permitted to copy and distribute verbatim copies 6 | * of this license document, but changing it is not allowed. 7 | */ 8 | 9 | #include 10 | #include 11 | 12 | #include "mpool.h" 13 | 14 | #define Inc_Ptr( PTR,N ) ((char*)PTR+N) 15 | #define Dec_Ptr( PTR,N ) ((char*)PTR-N) 16 | #define nextof(Ptr,BSZ) (*(void**)Inc_Ptr(Ptr,BSZ)) 17 | 18 | #define NOUSE 19 | 20 | Block* pool_create(int bsz, int count) 21 | { 22 | Block *res = (Block*)malloc(sizeof(Block)); 23 | int realsize = bsz + sizeof( void* ); 24 | void *_Mem = (void*)calloc(count,realsize); 25 | 26 | int i; 27 | res->_slots = Linear_New(); 28 | Linear(res->_slots,10); 29 | res->_first = _Mem; 30 | res->_cap = count; 31 | res->_size = count; 32 | res->_bsz = bsz; 33 | for ( i = 0 ; i < count-1; ++i) 34 | { 35 | *(void**)Inc_Ptr(_Mem , i*realsize + bsz)= Inc_Ptr(_Mem,(i+1)*realsize); 36 | } 37 | Line_Append(res->_slots,_Mem); 38 | return res; 39 | } 40 | void extend(Block *blk,int sz,int bsz) 41 | { 42 | void *_Mem = NULL; 43 | int i = 0,realsize = bsz + sizeof(void*); 44 | 45 | _Mem = calloc(sz,bsz+ sizeof(void*)); 46 | 47 | Line_Append(blk->_slots,_Mem); 48 | blk->_first = _Mem; 49 | for ( ; i_first; 59 | if ( res == NULL ) 60 | { 61 | int sz = blk->_cap * 1.5; 62 | extend(blk,sz,blk->_bsz); 63 | blk->_size = sz; 64 | blk->_cap += sz; 65 | res = blk->_first; 66 | } 67 | blk->_first = nextof(blk->_first,blk->_bsz); 68 | --blk->_size; 69 | return res; 70 | } 71 | 72 | void m_free(Block* blk, void **ptr) 73 | { 74 | if (*ptr == NULL) return; 75 | 76 | *(char**)((char*)(*ptr) + blk->_bsz ) = blk->_first; 77 | blk->_first = (*ptr); 78 | *ptr = NULL; 79 | } 80 | 81 | void pool_release(Block *blk) 82 | { 83 | int i = 0,sz = blk->_slots->_size; 84 | 85 | for( ; i_slots,i)); 87 | free(blk->_slots->_store); 88 | free(blk->_slots); 89 | } 90 | ////////////////////////////////////Don't Use the Code Below//////////////////////////////////////////// 91 | 92 | NOUSE MPool *mpool_create(int bsz, int count) 93 | { 94 | MPool *pool = (MPool*)malloc(sizeof(MPool)); 95 | int i = 0; 96 | 97 | pool->_store = (char **)malloc(sizeof(char*)*count); 98 | pool->_freeIndex = 0; 99 | pool->_bsz = bsz; 100 | pool->_slots = Linear_New(); 101 | pool->_cap = count; 102 | 103 | Linear(pool->_slots,10); 104 | pool->_mem = malloc(bsz * count); 105 | Line_Append(pool->_slots,pool->_mem); 106 | 107 | for ( ; i < count; ++i) 108 | { 109 | pool->_store[i] = (char*)pool->_mem + i * bsz; 110 | } 111 | 112 | return pool; 113 | } 114 | NOUSE void mpool_realse(MPool *pool) 115 | { 116 | int i; 117 | 118 | for ( i = 0 ; i < pool->_slots->_size; ++i) 119 | free(Line_Get(pool->_slots,i)); 120 | free(pool->_store); 121 | } 122 | 123 | NOUSE void _extend(MPool *pool) 124 | { 125 | int incsize = pool->_cap * 1.5, i = pool->_cap,j = 0; 126 | void *incmem = malloc(pool->_bsz * incsize); 127 | 128 | Line_Append(pool->_slots,incmem); 129 | pool->_store = (char**)realloc(pool->_store,(pool->_cap + incsize)*sizeof(char*)); 130 | assert(pool->_store != NULL); 131 | 132 | for ( ; j < incsize; ++j ) 133 | { 134 | pool->_store[i + j] = (char*)incmem + j * pool->_bsz; 135 | } 136 | pool->_freeIndex = pool->_cap; 137 | pool->_cap += incsize; 138 | } 139 | 140 | NOUSE void *malloc2(MPool *pool) 141 | { 142 | void *res = NULL; 143 | 144 | if ( pool->_freeIndex >= pool->_cap ) 145 | { 146 | _extend(pool); 147 | } 148 | 149 | res = pool->_store[ pool->_freeIndex++ ]; 150 | return res; 151 | } 152 | 153 | NOUSE void free2(MPool *pool, void *ptr) 154 | { 155 | //STOP HERE 156 | } 157 | -------------------------------------------------------------------------------- /mpool.h: -------------------------------------------------------------------------------- 1 | /* 2 | * GNU GENERAL PUBLIC LICENSE 3 | * Version 3, 29 June 2007 4 | * Copyright (C) 2016 XD.Yang 5 | * Everyone is permitted to copy and distribute verbatim copies 6 | * of this license document, but changing it is not allowed. 7 | */ 8 | 9 | #ifndef MPOOL_H 10 | #define MPOOL_H 11 | 12 | #ifdef __cplusplus 13 | extern "C"{ 14 | #endif 15 | 16 | 17 | #include 18 | #include 19 | 20 | #include "m_vector.h" 21 | //////////////////////////////////Linked-List/////////////////////////////////// 22 | 23 | #define MemPool Block 24 | 25 | typedef struct 26 | { 27 | void *_first; 28 | int _cap; 29 | int _bsz; 30 | int _size; 31 | LineTable *_slots; 32 | }Block; 33 | 34 | Block* pool_create(int bsz, int count); 35 | void* m_malloc(Block* blk); 36 | void m_free(Block* blk, void **ptr); 37 | void pool_release(Block *blk); 38 | 39 | 40 | 41 | //////////////////////////////////Array/////////////////////////////////// 42 | 43 | typedef struct 44 | { 45 | void *_mem; //实际分配的存储区 46 | char **_store; 47 | int _freeIndex; 48 | int _bsz; //块的尺寸 49 | int _cap; //一个区内的总块数 50 | LineTable *_slots; //内存区块指针 51 | }MPool; 52 | 53 | 54 | MPool *mpool_create(int bsz, int count); 55 | void *malloc2(MPool *pool); 56 | void free2(MPool *pool, void *ptr); 57 | void mpool_realse(MPool *pool); 58 | 59 | ///////////////////////////////////////////////////////////////////// 60 | #ifdef __cplusplus 61 | } 62 | #endif 63 | 64 | #endif // MPOOL_H 65 | -------------------------------------------------------------------------------- /thpool.c: -------------------------------------------------------------------------------- 1 | /* 2 | * GNU GENERAL PUBLIC LICENSE 3 | * Version 3, 29 June 2007 4 | * Copyright (C) 2016 XD.Yang 5 | * Everyone is permitted to copy and distribute verbatim copies 6 | * of this license document, but changing it is not allowed. 7 | */ 8 | #include 9 | #include 10 | 11 | #include "m_vector.h" 12 | #include "thpool.h" 13 | 14 | void m_sleep( long tms ) 15 | { 16 | #ifdef WIN32 17 | Sleep(tms); 18 | #else 19 | usleep(tms*1000); 20 | #endif 21 | } 22 | 23 | void* lanuch(void *arg) 24 | { 25 | mthread *thread = (mthread*)arg; 26 | 27 | //each thread has a custom task queue given by main thread task manager 28 | while ( 1 ) 29 | { 30 | if ( thread->_task->size == 0 ) 31 | { 32 | m_sleep(100); 33 | }else{ 34 | int i = 0, count = 0; 35 | Task *task; 36 | 37 | pthread_mutex_lock(&thread->_lock); 38 | thread->_busy = 1; 39 | count = thread->_task->size; 40 | for ( ; i < count; i++ ) 41 | { 42 | task = List_Read_Back(Task*,thread->_task); 43 | task->fn( task->arg ); 44 | List_Erase_Back(thread->_task); 45 | } 46 | thread->_busy = 0; 47 | pthread_mutex_unlock(&thread->_lock); 48 | } 49 | } 50 | } 51 | 52 | void* loop(void*arg) 53 | { 54 | thPool *pool = (thPool*)arg; 55 | int i = 0 , thcount = pool->_threads->_size; 56 | 57 | //main thread task manager 58 | while (1) 59 | { 60 | i = 0; 61 | if ( pool->_tasks->size == 0){ 62 | m_sleep(100); 63 | continue; 64 | } 65 | for (;i_threads,i); 69 | //idle thread can get the task 70 | pthread_mutex_lock(&thread->_lock); 71 | if ( thread->_busy ) 72 | { 73 | pthread_mutex_unlock(&thread->_lock); 74 | continue; 75 | } 76 | pthread_mutex_unlock(&thread->_lock); 77 | 78 | pthread_mutex_lock(&pool->_lock); 79 | //distribute tasks to idle thread 80 | if( pool->_tasks->size > 0 ) 81 | { 82 | task = List_Read_Back(Task*,pool->_tasks); 83 | List_Push_Back(Task*,thread->_task,task); 84 | //remove distributed task 85 | List_Erase_Back(pool->_tasks); 86 | } 87 | pthread_mutex_unlock(&pool->_lock); 88 | } 89 | } 90 | } 91 | 92 | thPool *thpool_create( int num ) 93 | { 94 | int i = 0; 95 | thPool *pool = (thPool*)malloc(sizeof(thPool)); 96 | pthread_t actor; 97 | 98 | pthread_mutex_init(&pool->_lock,NULL); 99 | 100 | pool->_threads = Linear_New(); 101 | Linear(pool->_threads,num); 102 | 103 | pool->_tasks = List_Create(Task*); 104 | 105 | //initialize thread-pool 106 | for ( ; i < num; ++i ) 107 | { 108 | mthread *thd = (mthread*)calloc(1,sizeof(mthread)); 109 | thd->_task = List_Create(Task*); 110 | pthread_mutex_init(&thd->_lock,NULL); 111 | Line_Append(pool->_threads,thd); 112 | pthread_create(&thd->_thread,NULL,lanuch,thd); 113 | } 114 | //start up task manager thread 115 | pthread_create(&actor,NULL,loop,pool); 116 | m_sleep(100); 117 | return pool; 118 | } 119 | 120 | void add_Task(thPool *pool,Task *task) 121 | { 122 | pthread_mutex_lock(&pool->_lock); 123 | List_Push_Back(Task*,pool->_tasks,task); 124 | pthread_mutex_unlock(&pool->_lock); 125 | } 126 | 127 | void thpool_release(thPool *pool) 128 | { 129 | int i = 0 , num = 0; 130 | pthread_mutex_lock(&pool->_lock); 131 | num = pool->_threads->_size; 132 | for ( ; i < num; ++i ) 133 | { 134 | mthread *thd = Line_Get(pool->_threads,i); 135 | List_Free(thd->_task); 136 | free(thd); 137 | 138 | } 139 | List_Free(pool->_tasks); 140 | free(pool); 141 | pthread_mutex_unlock(&pool->_lock); 142 | } 143 | -------------------------------------------------------------------------------- /thpool.h: -------------------------------------------------------------------------------- 1 | /* 2 | * GNU GENERAL PUBLIC LICENSE 3 | * Version 3, 29 June 2007 4 | * Copyright (C) 2016 XD.Yang 5 | * Everyone is permitted to copy and distribute verbatim copies 6 | * of this license document, but changing it is not allowed. 7 | */ 8 | #ifndef THPOOL_H 9 | #define THPOOL_H 10 | 11 | #include 12 | 13 | #include "c_list.h" 14 | #include "m_vector.h" 15 | 16 | #ifdef WIN32 17 | #include "lib/pthread.h" 18 | #else 19 | #include 20 | #endif 21 | 22 | 23 | #ifdef __cplusplus 24 | extern "C"{ 25 | #endif 26 | 27 | 28 | typedef void* (*task_func)(void*); 29 | 30 | typedef struct 31 | { 32 | void* (*fn)(void*); 33 | void* arg; 34 | }Task; 35 | 36 | typedef struct 37 | { 38 | pthread_t _thread; 39 | int _busy; 40 | YC_List *_task; 41 | pthread_mutex_t _lock; 42 | }mthread; 43 | 44 | typedef struct 45 | { 46 | //线程列表 47 | LineTable *_threads; 48 | //任务队列 49 | YC_List *_tasks; 50 | 51 | pthread_mutex_t _lock; 52 | }thPool; 53 | 54 | 55 | thPool *thpool_create( int num ); 56 | void add_Task(thPool *pool,Task *task); 57 | void thpool_release(thPool *pool); 58 | 59 | 60 | #ifdef __cplusplus 61 | } 62 | #endif 63 | 64 | 65 | #endif // THPOOL_H 66 | -------------------------------------------------------------------------------- /ycmpool.pro: -------------------------------------------------------------------------------- 1 | TEMPLATE = app 2 | CONFIG += console 3 | CONFIG -= app_bundle 4 | CONFIG -= qt 5 | 6 | SOURCES += \ 7 | mpool.c \ 8 | lib/pthread.c \ 9 | thpool.c \ 10 | main.c 11 | 12 | INCLUDEPATH += "F:\C-C++\hfdslib\include" 13 | 14 | INCLUDEPATH += "F:\C-C++\boost_1_59_0\boost_1_59_0" 15 | 16 | LIBS+="F:\C-C++\hfdslib\lib\hfdslib.lib" 17 | 18 | LIBS += user32.lib shell32.lib ole32.lib 19 | 20 | HEADERS += \ 21 | mpool.h \ 22 | m_vector.h \ 23 | lib/pthread.h \ 24 | thpool.h 25 | -------------------------------------------------------------------------------- /ycmpool.pro.user: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | ProjectExplorer.Project.ActiveTarget 7 | 0 8 | 9 | 10 | ProjectExplorer.Project.EditorSettings 11 | 12 | true 13 | false 14 | true 15 | 16 | Cpp 17 | 18 | CppGlobal 19 | 20 | 21 | 22 | QmlJS 23 | 24 | QmlJSGlobal 25 | 26 | 27 | 2 28 | UTF-8 29 | false 30 | 4 31 | false 32 | 80 33 | true 34 | true 35 | 1 36 | true 37 | false 38 | 0 39 | true 40 | 0 41 | 8 42 | true 43 | 0 44 | true 45 | true 46 | true 47 | false 48 | 49 | 50 | 51 | ProjectExplorer.Project.PluginSettings 52 | 53 | 54 | 55 | ProjectExplorer.Project.Target.0 56 | 57 | 桌面 58 | 桌面 59 | {fcdf2160-ef44-458f-bb93-cf03ce1b2ff2} 60 | 0 61 | 0 62 | 0 63 | 64 | F:/C-C++/build-ycmpool-unknown-Debug 65 | 66 | 67 | true 68 | qmake 69 | 70 | QtProjectManager.QMakeBuildStep 71 | false 72 | true 73 | 74 | false 75 | 76 | 77 | true 78 | Make 79 | 80 | Qt4ProjectManager.MakeStep 81 | 82 | false 83 | 84 | 85 | 86 | 2 87 | 构建 88 | 89 | ProjectExplorer.BuildSteps.Build 90 | 91 | 92 | 93 | true 94 | Make 95 | 96 | Qt4ProjectManager.MakeStep 97 | 98 | true 99 | clean 100 | 101 | 102 | 1 103 | 清理 104 | 105 | ProjectExplorer.BuildSteps.Clean 106 | 107 | 2 108 | false 109 | 110 | Debug 111 | 112 | Qt4ProjectManager.Qt4BuildConfiguration 113 | 2 114 | true 115 | 116 | 117 | F:/C-C++/build-ycmpool-unknown-Release 118 | 119 | 120 | true 121 | qmake 122 | 123 | QtProjectManager.QMakeBuildStep 124 | false 125 | true 126 | 127 | false 128 | 129 | 130 | true 131 | Make 132 | 133 | Qt4ProjectManager.MakeStep 134 | 135 | false 136 | 137 | 138 | 139 | 2 140 | 构建 141 | 142 | ProjectExplorer.BuildSteps.Build 143 | 144 | 145 | 146 | true 147 | Make 148 | 149 | Qt4ProjectManager.MakeStep 150 | 151 | true 152 | clean 153 | 154 | 155 | 1 156 | 清理 157 | 158 | ProjectExplorer.BuildSteps.Clean 159 | 160 | 2 161 | false 162 | 163 | Release 164 | 165 | Qt4ProjectManager.Qt4BuildConfiguration 166 | 0 167 | true 168 | 169 | 2 170 | 171 | 172 | 0 173 | 部署 174 | 175 | ProjectExplorer.BuildSteps.Deploy 176 | 177 | 1 178 | 在本地部署 179 | 180 | ProjectExplorer.DefaultDeployConfiguration 181 | 182 | 1 183 | 184 | 185 | 186 | false 187 | false 188 | false 189 | false 190 | true 191 | 0.01 192 | 10 193 | true 194 | 1 195 | 25 196 | 197 | 1 198 | true 199 | false 200 | true 201 | valgrind 202 | 203 | 0 204 | 1 205 | 2 206 | 3 207 | 4 208 | 5 209 | 6 210 | 7 211 | 8 212 | 9 213 | 10 214 | 11 215 | 12 216 | 13 217 | 14 218 | 219 | 2 220 | 221 | ycmpool 222 | 223 | Qt4ProjectManager.Qt4RunConfiguration:F:/C-C++/ycmpool/ycmpool.pro 224 | 225 | ycmpool.pro 226 | false 227 | true 228 | 229 | 3768 230 | false 231 | true 232 | false 233 | false 234 | true 235 | 236 | 1 237 | 238 | 239 | 240 | ProjectExplorer.Project.TargetCount 241 | 1 242 | 243 | 244 | ProjectExplorer.Project.Updater.EnvironmentId 245 | {15b69ba0-b226-47bf-a34b-2ab53bcdc923} 246 | 247 | 248 | ProjectExplorer.Project.Updater.FileVersion 249 | 15 250 | 251 | 252 | --------------------------------------------------------------------------------