├── .gitignore ├── LICENSE ├── Makefile ├── README.md ├── cmt.cpp ├── cmt.h ├── init.cpp ├── ladspa_types.h └── ng.cpp /.gitignore: -------------------------------------------------------------------------------- 1 | *.o 2 | *.so 3 | -------------------------------------------------------------------------------- /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 | CXXFLAGS += -std=c++14 2 | OBJ_FILES = init.o ng.o cmt.o 3 | ng.so: ${OBJ_FILES} 4 | $(CXX) -shared -o $@ $+ 5 | %.o: %.cpp 6 | $(CXX) -Wall -pedantic -fPIC -DPIC -O2 $(CXXFLAGS) -o $@ -c $< 7 | clean: 8 | rm -f ${OBJ_FILES} ng.so 9 | install: ng.so 10 | mkdir -p ~/.ladspa 11 | cp -f ng.so ~/.ladspa/ 12 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | This is a better noise gate for Audacity, Ardour, or any other editor/DAW that supports the 2 | [LADSPA](https://www.ladspa.org/) plugin interface. 3 | 4 | See for the 5 | introduction. 6 | 7 | ## Installation 8 | 9 | 1. Make sure you have a standard C++ development environment (the compiler and 10 | the Boost library). 11 | 1. Make sure that you have the LADSPA SDK installed, which consists of a single 12 | header file, `ladspa.h`. For example, on Fedora you have to install the 13 | `ladspa-devel` package. 14 | 1. Run `make`. This should produce a file named `ng.so` on UNIX, `ng.dylib` on 15 | MacOS, or `ng.dll` on Windows. This is the plugin itself. 16 | 1. Change the `LADSPA_PATH` to include the directory containing the plugin (i.e. 17 | `ng.so` or similar). Personally, I set my `LADSPA_PATH` to 18 | `/home/feuerbach/.ladspa:/usr/lib64/ladspa` in `~/.pam_environment`, and then 19 | copy the plugin to `~/.ladspa`, but your actions may differ depending on the 20 | platform. 21 | 22 | The plugin will show up under the name "Roman's noise gate". 23 | 24 | These instructions have been tested on Linux. Building on other systems 25 | may require minor tweaks in the instructions and the `Makefile`. If you've 26 | installed the plugin on a different system, please send a pull request with the 27 | instructions for that system. 28 | -------------------------------------------------------------------------------- /cmt.cpp: -------------------------------------------------------------------------------- 1 | /* cmt.cpp 2 | 3 | Computer Music Toolkit - a library of LADSPA plugins. Copyright (C) 4 | 2000-2002 Richard W.E. Furse. The author may be contacted at 5 | richard@muse.demon.co.uk. 6 | 7 | This library is free software; you can redistribute it and/or 8 | modify it under the terms of the GNU General Public Licence as 9 | published by the Free Software Foundation; either version 2 of the 10 | Licence, or (at your option) any later version. 11 | 12 | This library is distributed in the hope that it will be useful, but 13 | WITHOUT ANY WARRANTY; without even the implied warranty of 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 15 | General Public License for more details. 16 | 17 | You should have received a copy of the GNU General Public License 18 | along with this library; if not, write to the Free Software 19 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 20 | 02111-1307, USA. */ 21 | 22 | /*****************************************************************************/ 23 | 24 | #include 25 | 26 | /*****************************************************************************/ 27 | 28 | #include "cmt.h" 29 | 30 | /*****************************************************************************/ 31 | 32 | inline char * 33 | localStrdup(const char * input) { 34 | char * output = new char[strlen(input) + 1]; 35 | strcpy(output, input); 36 | return output; 37 | } 38 | 39 | /*****************************************************************************/ 40 | 41 | CMT_Descriptor:: 42 | ~CMT_Descriptor() { 43 | if (Label) 44 | delete [] Label; 45 | if (Name) 46 | delete [] Name; 47 | if (Maker) 48 | delete [] Maker; 49 | if (Copyright) 50 | delete [] Copyright; 51 | if (ImplementationData) 52 | delete (CMT_ImplementationData *)ImplementationData; 53 | if (PortDescriptors) 54 | delete [] PortDescriptors; 55 | if (PortNames) { 56 | for (unsigned long lIndex = 0; lIndex < PortCount; lIndex++) 57 | if (PortNames[lIndex]) 58 | delete [] PortNames[lIndex]; 59 | delete [] PortNames; 60 | } 61 | if (PortRangeHints) 62 | delete [] PortRangeHints; 63 | } 64 | 65 | /*****************************************************************************/ 66 | 67 | void 68 | CMT_ConnectPort(LADSPA_Handle Instance, 69 | unsigned long Port, 70 | LADSPA_Data * DataLocation) { 71 | CMT_PluginInstance * poInstance = (CMT_PluginInstance *)Instance; 72 | poInstance->m_ppfPorts[Port] = DataLocation; 73 | } 74 | 75 | /*****************************************************************************/ 76 | 77 | void 78 | CMT_Cleanup(LADSPA_Handle Instance) { 79 | CMT_PluginInstance * poInstance = (CMT_PluginInstance *)Instance; 80 | delete poInstance; 81 | } 82 | 83 | /*****************************************************************************/ 84 | 85 | CMT_Descriptor:: 86 | CMT_Descriptor(unsigned long lUniqueID, 87 | const char * pcLabel, 88 | LADSPA_Properties iProperties, 89 | const char * pcName, 90 | const char * pcMaker, 91 | const char * pcCopyright, 92 | CMT_ImplementationData * poImplementationData, 93 | LADSPA_Instantiate_Function fInstantiate, 94 | LADSPA_Activate_Function fActivate, 95 | LADSPA_Run_Function fRun, 96 | LADSPA_Run_Adding_Function fRunAdding, 97 | LADSPA_Set_Run_Adding_Gain_Function fSetRunAddingGain, 98 | LADSPA_Deactivate_Function fDeactivate) { 99 | 100 | UniqueID = lUniqueID; 101 | Label = localStrdup(pcLabel); 102 | Properties = iProperties; 103 | Name = localStrdup(pcName); 104 | Maker = localStrdup(pcMaker); 105 | Copyright = localStrdup(pcCopyright); 106 | PortCount = 0; 107 | ImplementationData = poImplementationData; 108 | 109 | instantiate = fInstantiate; 110 | connect_port = CMT_ConnectPort; 111 | activate = fActivate; 112 | run = fRun; 113 | run_adding = fRunAdding; 114 | set_run_adding_gain = fSetRunAddingGain; 115 | deactivate = fDeactivate; 116 | cleanup = CMT_Cleanup; 117 | 118 | } 119 | 120 | /*****************************************************************************/ 121 | 122 | typedef char * char_ptr; 123 | 124 | void CMT_Descriptor:: 125 | addPort(LADSPA_PortDescriptor iPortDescriptor, 126 | const char * pcPortName, 127 | LADSPA_PortRangeHintDescriptor iHintDescriptor, 128 | LADSPA_Data fLowerBound, 129 | LADSPA_Data fUpperBound) { 130 | 131 | unsigned long lOldPortCount = PortCount; 132 | unsigned long lNewPortCount = PortCount + 1; 133 | 134 | LADSPA_PortDescriptor * piOldPortDescriptors 135 | = (LADSPA_PortDescriptor *)PortDescriptors; 136 | char ** ppcOldPortNames 137 | = (char **)PortNames; 138 | LADSPA_PortRangeHint * psOldPortRangeHints 139 | = (LADSPA_PortRangeHint *)PortRangeHints; 140 | 141 | LADSPA_PortDescriptor * piNewPortDescriptors 142 | = new LADSPA_PortDescriptor[lNewPortCount]; 143 | char ** ppcNewPortNames 144 | = new char_ptr[lNewPortCount]; 145 | LADSPA_PortRangeHint * psNewPortRangeHints 146 | = new LADSPA_PortRangeHint[lNewPortCount]; 147 | 148 | if (piNewPortDescriptors == NULL 149 | || ppcNewPortNames == NULL 150 | || psNewPortRangeHints == NULL) { 151 | /* Memory allocation failure that we cannot handle. Best option is 152 | probably just to get out while the going is reasonably good. */ 153 | return; 154 | } 155 | 156 | for (unsigned long lPortIndex = 0; 157 | lPortIndex < lOldPortCount; 158 | lPortIndex++) { 159 | piNewPortDescriptors[lPortIndex] = piOldPortDescriptors[lPortIndex]; 160 | ppcNewPortNames[lPortIndex] = ppcOldPortNames[lPortIndex]; 161 | psNewPortRangeHints[lPortIndex] = psOldPortRangeHints[lPortIndex]; 162 | } 163 | if (lOldPortCount > 0) { 164 | delete [] piOldPortDescriptors; 165 | delete [] ppcOldPortNames; 166 | delete [] psOldPortRangeHints; 167 | } 168 | 169 | piNewPortDescriptors[lOldPortCount] = iPortDescriptor; 170 | ppcNewPortNames[lOldPortCount] = localStrdup(pcPortName); 171 | psNewPortRangeHints[lOldPortCount].HintDescriptor = iHintDescriptor; 172 | psNewPortRangeHints[lOldPortCount].LowerBound = fLowerBound; 173 | psNewPortRangeHints[lOldPortCount].UpperBound = fUpperBound; 174 | 175 | PortDescriptors = piNewPortDescriptors; 176 | PortNames = ppcNewPortNames; 177 | PortRangeHints = psNewPortRangeHints; 178 | 179 | PortCount++; 180 | } 181 | 182 | /*****************************************************************************/ 183 | 184 | /* EOF */ 185 | -------------------------------------------------------------------------------- /cmt.h: -------------------------------------------------------------------------------- 1 | /* cmt.h 2 | 3 | Computer Music Toolkit - a library of LADSPA plugins. Copyright (C) 4 | 2000-2002 Richard W.E. Furse. The author may be contacted at 5 | richard@muse.demon.co.uk. 6 | 7 | This library is free software; you can redistribute it and/or 8 | modify it under the terms of the GNU General Public Licence as 9 | published by the Free Software Foundation; either version 2 of the 10 | Licence, or (at your option) any later version. 11 | 12 | This library is distributed in the hope that it will be useful, but 13 | WITHOUT ANY WARRANTY; without even the implied warranty of 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 15 | General Public License for more details. 16 | 17 | You should have received a copy of the GNU General Public License 18 | along with this library; if not, write to the Free Software 19 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 20 | 02111-1307, USA. */ 21 | 22 | #ifndef CMT_BASE_INCLUDED 23 | #define CMT_BASE_INCLUDED 24 | 25 | /*****************************************************************************/ 26 | 27 | #include "ladspa_types.h" 28 | 29 | /*****************************************************************************/ 30 | 31 | /** This class is the baseclass of all CMT plugin implementation 32 | data. Baseclassed so virtual destructors can be used. */ 33 | class CMT_ImplementationData { 34 | public: 35 | virtual ~CMT_ImplementationData() { 36 | } 37 | }; 38 | 39 | /*****************************************************************************/ 40 | 41 | /** This structure describes a CMT LADSPA Plugin. It is a direct 42 | ancestor of the _LADSPA_Descriptor structure which allows direct 43 | casting. A rich constructor function is provided make it easier to 44 | write LADSPA_Descriptor objects. (Less code is required and the 45 | compiler will tell you when you have missed an entry.) An 46 | addPort() function makes configuration of ports more 47 | straightforward than using the _LADSPA_Descriptor structure 48 | directly. */ 49 | 50 | struct CMT_Descriptor : public _LADSPA_Descriptor { 51 | private: 52 | 53 | CMT_Descriptor &operator=(const CMT_Descriptor &) { 54 | return *this; 55 | } 56 | CMT_Descriptor(const CMT_Descriptor &) { 57 | } 58 | 59 | public: 60 | 61 | ~CMT_Descriptor(); 62 | 63 | /** The basic constructor for a CMT_Descriptor object. If you do not 64 | know what the parameters mean, please see the fields in the 65 | LADSPA_Descriptor structure, described in ladspa.h. Note that 66 | some parameters may be NULL. Note also that a template is 67 | provided to generate instantiate functions automatically (see 68 | CMT_Instantiate<>() below). Implementation data must be NULL if 69 | not allocated. */ 70 | CMT_Descriptor(unsigned long lUniqueID, 71 | const char * pcLabel, 72 | LADSPA_Properties iProperties, 73 | const char * pcName, 74 | const char * pcMaker, 75 | const char * pcCopyright, 76 | CMT_ImplementationData * poImplementationData, 77 | LADSPA_Instantiate_Function fInstantiate, 78 | LADSPA_Activate_Function fActivate, 79 | LADSPA_Run_Function fRun, 80 | LADSPA_Run_Adding_Function fRunAdding, 81 | LADSPA_Set_Run_Adding_Gain_Function fSetRunAddingGain, 82 | LADSPA_Deactivate_Function fDeactivate); 83 | 84 | /** This method adds a new port to the descriptor. If you do not 85 | know what the parameters mean, please see the fields in the 86 | LADSPA_Descriptor structure, described in ladspa.h. */ 87 | void addPort(LADSPA_PortDescriptor iPortDescriptor, 88 | const char * pcPortName, 89 | LADSPA_PortRangeHintDescriptor iHintDescriptor = 0, 90 | LADSPA_Data fLowerBound = 0, 91 | LADSPA_Data fUpperBound = 0); 92 | 93 | }; 94 | 95 | typedef CMT_Descriptor * CMT_Descriptor_ptr; 96 | 97 | /*****************************************************************************/ 98 | 99 | /** Each plugin type must register itself with the descriptor 100 | registry. This is done by calling the following function, passing 101 | a newly allocated structure (that will be cleaned up on library 102 | unload automatically). 103 | 104 | Each module needs to be initialised in order to have a chance to 105 | register new plugins. This can be achieved by modifying the list 106 | of initialiser functions in descriptor.cpp. */ 107 | void registerNewPluginDescriptor(CMT_Descriptor * psDescriptor); 108 | 109 | /*****************************************************************************/ 110 | 111 | /** This class is the baseclass of all CMT plugins. It provides 112 | functionality to handle LADSPA connect_port() and cleanup() 113 | requirements (as long as plugins have correctly written 114 | destructors!) A CMT_Instantiate<>() template is provided also, 115 | which makes LADSPA instantiate() methods easier to write. 116 | 117 | Derived classes access port data through the m_ppfPorts[] 118 | array. This contains one entry for each port, in the order in 119 | which ports were added to the corresponding CMT_Descriptor 120 | object. */ 121 | class CMT_PluginInstance { 122 | private: 123 | 124 | CMT_PluginInstance &operator=(const CMT_PluginInstance &) { 125 | return *this; 126 | } 127 | CMT_PluginInstance(const CMT_PluginInstance &) { 128 | } 129 | 130 | protected: 131 | 132 | LADSPA_Data ** m_ppfPorts; 133 | 134 | CMT_PluginInstance(const unsigned long lPortCount) 135 | : m_ppfPorts(new LADSPA_Data_ptr[lPortCount]) { 136 | } 137 | virtual ~CMT_PluginInstance() { 138 | delete [] m_ppfPorts; 139 | } 140 | 141 | friend void CMT_ConnectPort(LADSPA_Handle Instance, 142 | unsigned long Port, 143 | LADSPA_Data * DataLocation); 144 | friend void CMT_Cleanup(LADSPA_Handle Instance); 145 | 146 | }; 147 | 148 | /*****************************************************************************/ 149 | 150 | /** This template can be used to generate functions to instantiate CMT 151 | plugins. To be used with this function, the plugin must accept two 152 | parameters (a LADSPA_Descriptor pointer and a sample rate). See 153 | the SimpleMixer class and mixer_descriptor() in mixer.cpp for a 154 | simple example of this: the instantiate function for the mixer 155 | class is generated within the mixer_descriptor() function as 156 | "CMT_Instantiate". */ 157 | template LADSPA_Handle 158 | CMT_Instantiate(const LADSPA_Descriptor * Descriptor, 159 | unsigned long SampleRate) { 160 | return new T(Descriptor, SampleRate); 161 | } 162 | 163 | /*****************************************************************************/ 164 | 165 | /** This macro should be used to fill in the `Maker' field in the 166 | CMT_Descriptor. */ 167 | #define CMT_MAKER(AUTHORS) \ 168 | "CMT (http://www.ladspa.org/cmt, plugin by " AUTHORS ")" 169 | 170 | /** This macro should be used to fill in the `Copyright' field in the 171 | CMT_Descriptor. */ 172 | #define CMT_COPYRIGHT(YEARS, AUTHORS) \ 173 | "(C)" YEARS ", " AUTHORS ". " \ 174 | "GNU General Public Licence Version 2 applies." 175 | 176 | /*****************************************************************************/ 177 | 178 | #endif 179 | 180 | /* EOF */ 181 | -------------------------------------------------------------------------------- /init.cpp: -------------------------------------------------------------------------------- 1 | /* init.cpp 2 | 3 | Computer Music Toolkit - a library of LADSPA plugins. Copyright (C) 4 | 2000 Richard W.E. Furse. The author may be contacted at 5 | richard@muse.demon.co.uk. 6 | 7 | This library is free software; you can redistribute it and/or 8 | modify it under the terms of the GNU General Public Licence as 9 | published by the Free Software Foundation; either version 2 of the 10 | Licence, or (at your option) any later version. 11 | 12 | This library is distributed in the hope that it will be useful, but 13 | WITHOUT ANY WARRANTY; without even the implied warranty of 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 15 | General Public License for more details. 16 | 17 | You should have received a copy of the GNU General Public License 18 | along with this library; if not, write to the Free Software 19 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 20 | 02111-1307, USA. */ 21 | 22 | /*****************************************************************************/ 23 | 24 | #include 25 | #include 26 | #include 27 | 28 | /*****************************************************************************/ 29 | 30 | #include "cmt.h" 31 | 32 | void init_noise_gate(); 33 | 34 | /*****************************************************************************/ 35 | 36 | int 37 | pluginNameComparator(const void * pvDescriptor1, const void * pvDescriptor2) { 38 | 39 | const CMT_Descriptor * psDescriptor1 40 | = *(const CMT_Descriptor **)pvDescriptor1; 41 | const CMT_Descriptor * psDescriptor2 42 | = *(const CMT_Descriptor **)pvDescriptor2; 43 | 44 | int iResult = strcmp(psDescriptor1->Name, psDescriptor2->Name); 45 | if (iResult < 0) 46 | return -1; 47 | else if (iResult > 0) 48 | return 1; 49 | else 50 | return 0; 51 | } 52 | 53 | /*****************************************************************************/ 54 | 55 | CMT_Descriptor ** g_ppsRegisteredDescriptors = NULL; 56 | unsigned long g_lPluginCapacity = 0; 57 | unsigned long g_lPluginCount = 0; 58 | 59 | /*****************************************************************************/ 60 | 61 | #define CAPACITY_STEP 20 62 | 63 | void 64 | registerNewPluginDescriptor(CMT_Descriptor * psDescriptor) { 65 | if (g_lPluginCapacity == g_lPluginCount) { 66 | /* Full. Enlarge capacity. */ 67 | CMT_Descriptor ** ppsOldDescriptors 68 | = g_ppsRegisteredDescriptors; 69 | g_ppsRegisteredDescriptors 70 | = new CMT_Descriptor_ptr[g_lPluginCapacity + CAPACITY_STEP]; 71 | if (g_lPluginCapacity > 0) { 72 | memcpy(g_ppsRegisteredDescriptors, 73 | ppsOldDescriptors, 74 | g_lPluginCapacity * sizeof(CMT_Descriptor_ptr)); 75 | delete [] ppsOldDescriptors; 76 | } 77 | g_lPluginCapacity += CAPACITY_STEP; 78 | } 79 | g_ppsRegisteredDescriptors[g_lPluginCount++] = psDescriptor; 80 | } 81 | 82 | /*****************************************************************************/ 83 | 84 | /** A global object of this class is used to perform initialisation 85 | and shutdown services for the entire library. The constructor is 86 | run when the library is loaded and the destructor when it is 87 | unloaded. */ 88 | class StartupShutdownHandler { 89 | public: 90 | 91 | StartupShutdownHandler() { 92 | init_noise_gate(); 93 | qsort(g_ppsRegisteredDescriptors, 94 | g_lPluginCount, 95 | sizeof(CMT_Descriptor_ptr), 96 | pluginNameComparator); 97 | } 98 | 99 | ~StartupShutdownHandler() { 100 | if (g_ppsRegisteredDescriptors != NULL) { 101 | for (unsigned long lIndex = 0; lIndex < g_lPluginCount; lIndex++) 102 | delete g_ppsRegisteredDescriptors[lIndex]; 103 | delete [] g_ppsRegisteredDescriptors; 104 | } 105 | // finalise_modules(); 106 | } 107 | 108 | } g_oStartupShutdownHandler; 109 | 110 | /*****************************************************************************/ 111 | 112 | const LADSPA_Descriptor * 113 | ladspa_descriptor(unsigned long Index) { 114 | if (Index < g_lPluginCount) 115 | return g_ppsRegisteredDescriptors[Index]; 116 | else 117 | return NULL; 118 | } 119 | 120 | /*****************************************************************************/ 121 | 122 | /* EOF */ 123 | -------------------------------------------------------------------------------- /ladspa_types.h: -------------------------------------------------------------------------------- 1 | /* ladspa_types.h 2 | 3 | Computer Music Toolkit - a library of LADSPA plugins. Copyright (C) 4 | 2000 Richard W.E. Furse. The author may be contacted at 5 | richard@muse.demon.co.uk. 6 | 7 | This library is free software; you can redistribute it and/or 8 | modify it under the terms of the GNU General Public Licence as 9 | published by the Free Software Foundation; either version 2 of the 10 | Licence, or (at your option) any later version. 11 | 12 | This library is distributed in the hope that it will be useful, but 13 | WITHOUT ANY WARRANTY; without even the implied warranty of 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 15 | General Public License for more details. 16 | 17 | You should have received a copy of the GNU General Public License 18 | along with this library; if not, write to the Free Software 19 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 20 | 02111-1307, USA. */ 21 | 22 | #ifndef CMT_LADSPA_TYPES_INCLUDED 23 | #define CMT_LADSPA_TYPES_INCLUDED 24 | 25 | /*****************************************************************************/ 26 | 27 | #include 28 | 29 | /* Compatibility hack for version 1.0. */ 30 | #ifndef LADSPA_VERSION_MAJOR 31 | #define LADSPA_HINT_DEFAULT_MINIMUM 0x40 32 | #define LADSPA_HINT_DEFAULT_LOW 0x80 33 | #define LADSPA_HINT_DEFAULT_MIDDLE 0xC0 34 | #define LADSPA_HINT_DEFAULT_HIGH 0x100 35 | #define LADSPA_HINT_DEFAULT_MAXIMUM 0x140 36 | #define LADSPA_HINT_DEFAULT_0 0x200 37 | #define LADSPA_HINT_DEFAULT_1 0x240 38 | #define LADSPA_HINT_DEFAULT_100 0x280 39 | #define LADSPA_HINT_DEFAULT_440 0x2C0 40 | #endif 41 | 42 | /*****************************************************************************/ 43 | 44 | typedef LADSPA_Handle (*LADSPA_Instantiate_Function) 45 | (const struct _LADSPA_Descriptor * Descriptor, 46 | unsigned long SampleRate); 47 | 48 | typedef void (*LADSPA_Connect_Port_Function) 49 | (LADSPA_Handle Instance, 50 | unsigned long Port, 51 | LADSPA_Data * DataLocation); 52 | 53 | typedef void (*LADSPA_Activate_Function) 54 | (LADSPA_Handle Instance); 55 | 56 | typedef void (*LADSPA_Run_Function) 57 | (LADSPA_Handle Instance, 58 | unsigned long SampleCount); 59 | 60 | typedef void (*LADSPA_Run_Adding_Function) 61 | (LADSPA_Handle Instance, 62 | unsigned long SampleCount); 63 | 64 | typedef void (*LADSPA_Set_Run_Adding_Gain_Function) 65 | (LADSPA_Handle Instance, 66 | LADSPA_Data Gain); 67 | 68 | typedef void (*LADSPA_Deactivate_Function) 69 | (LADSPA_Handle Instance); 70 | 71 | typedef void (*LADSPA_Cleanup_Function) 72 | (LADSPA_Handle Instance); 73 | 74 | typedef LADSPA_Data * LADSPA_Data_ptr; 75 | 76 | /*****************************************************************************/ 77 | 78 | #endif 79 | 80 | /* EOF */ 81 | -------------------------------------------------------------------------------- /ng.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include "cmt.h" 3 | #include 4 | #include 5 | #include 6 | 7 | using namespace std; 8 | 9 | // A sliding window that maintains its maximum absolute value 10 | class MaxWindow { 11 | private: 12 | // Window size. 13 | deque::size_type window_size; 14 | // Samples within the window. 15 | boost::circular_buffer buf; 16 | // Indinces into the whole track (not buf!), corresponding to the decreasing 17 | // subsequence of samples within the current window. 18 | deque indices; 19 | // Total cumulative number of samples pushed into this window. 20 | // Used to convert 'indices' to actual buf indices. 21 | unsigned long n_samples = 0; 22 | // Get sample value by its absolute index. 23 | inline LADSPA_Data get_sample(unsigned long index) const { 24 | return buf[buf.size() - (n_samples - index)]; 25 | } 26 | public: 27 | MaxWindow(deque::size_type window_size) 28 | : window_size(window_size), buf(window_size) {}; 29 | void push(LADSPA_Data sample) { 30 | sample = abs(sample); 31 | while (!indices.empty() && get_sample(indices.back()) <= sample) { 32 | indices.pop_back(); 33 | } 34 | while (!indices.empty() && indices.front() <= n_samples - window_size) { 35 | indices.pop_front(); 36 | } 37 | indices.push_back(n_samples++); 38 | buf.push_back(sample); 39 | } 40 | LADSPA_Data level() const { 41 | return get_sample(indices.front()); 42 | } 43 | }; 44 | 45 | // A sliding window that knows at each moment how much non-silence it contains. 46 | // 47 | // The window has the latency ns_window_size. 48 | class NonSilenceWindow { 49 | private: 50 | boost::circular_buffer buf; // true == non-silent 51 | MaxWindow max_window; 52 | LADSPA_Data sample_rate; 53 | LADSPA_Data level_threshold; // a threshold above which the sound is considered non-silent 54 | unsigned long nonsilent_samples = 0; 55 | public: 56 | NonSilenceWindow(boost::circular_buffer::capacity_type ns_window_size, 57 | boost::circular_buffer::capacity_type max_window_size, 58 | LADSPA_Data sample_rate, 59 | LADSPA_Data level_threshold) 60 | : buf(ns_window_size), max_window(max_window_size), 61 | sample_rate(sample_rate), level_threshold(level_threshold) 62 | {}; 63 | void push(LADSPA_Data sample) { 64 | max_window.push(sample); 65 | if (buf.full()) 66 | nonsilent_samples -= buf.front(); 67 | bool new_nonsilent = max_window.level() >= level_threshold; 68 | buf.push_back(new_nonsilent); 69 | nonsilent_samples += new_nonsilent; 70 | } 71 | // Get the total amount of non-silence inside the window in seconds 72 | LADSPA_Data nonsilent() const { 73 | return nonsilent_samples / sample_rate; 74 | } 75 | }; 76 | 77 | // A window that smoothes the transition between the open and closed states of 78 | // the gate. 79 | // 80 | // The state of the gate is represented by a bool: true = open, false = closed. 81 | // 82 | // When the gate moves from open to closed (true -> false), the gate closes 83 | // smoothly after that. 84 | // 85 | // When the gate moves from closed to open (false -> true), this event is 86 | // anticipated ahead of time and the transition is again smoothed. 87 | // 88 | // This function could probably be optimized by introducing more states and 89 | // avoiding multiplications when the gate remains open or closed for a long time. 90 | class SmoothingWindow { 91 | private: 92 | const LADSPA_Data floor = 1e-4; // -80 dB 93 | unsigned long window_size; 94 | // The current scaling factor applied to the sound samples. 95 | LADSPA_Data current_coef = 1; 96 | // Are we currently rising (true) or falling (false)? 97 | bool rising = true; 98 | // The number of samples since we've last seen the gate open. 99 | // If it's more than the window size, we may begin to decrease the scaling 100 | // factor. 101 | long unsigned samples_since_open = 0; 102 | // factor is initialized in the constructor based on 103 | // the window size and then never changes. 104 | LADSPA_Data factor; 105 | public: 106 | SmoothingWindow(unsigned long window_size) 107 | : window_size(window_size), 108 | factor(exp(-log(floor)/window_size)) 109 | {} 110 | // Push a new sample (is the gate open?) 111 | void push(bool open) { 112 | if (open) { 113 | samples_since_open = 0; 114 | rising = true; 115 | } else { 116 | samples_since_open++; 117 | if (samples_since_open > window_size) { 118 | rising = false; 119 | } 120 | } 121 | if (rising) { 122 | current_coef = min(max(current_coef, floor) * factor, 1.f); 123 | } else { 124 | current_coef = current_coef / factor; 125 | if (current_coef < floor) { 126 | current_coef = 0.f; 127 | } 128 | } 129 | } 130 | // Get the current scaling factor (with the latency equal to the 131 | // attack/decay duration) 132 | LADSPA_Data scaling_factor() const { 133 | return current_coef; 134 | } 135 | }; 136 | 137 | const unsigned long port_count = 7; 138 | 139 | class NoiseGate : public CMT_PluginInstance { 140 | public: 141 | unsigned sample_rate; 142 | unique_ptr ns_window; 143 | unique_ptr sm_window; 144 | unique_ptr> buf; 145 | 146 | // NB: we cannot do much initialization in the constructor because the ports 147 | // may be connected after it is called. 148 | NoiseGate(const LADSPA_Descriptor *, 149 | unsigned sample_rate) 150 | : CMT_PluginInstance(port_count), sample_rate(sample_rate) {} 151 | 152 | void run(unsigned long n_samples) { 153 | 154 | LADSPA_Data threshold = pow(10.f, *(m_ppfPorts[0]) / 20.f); 155 | LADSPA_Data window_size = *(m_ppfPorts[1]) / 1000; // in seconds 156 | LADSPA_Data min_nonsilent = *(m_ppfPorts[2]) / 1000; // in seconds 157 | LADSPA_Data attack = *(m_ppfPorts[3]) / 1000; // in seconds 158 | LADSPA_Data *input = m_ppfPorts[4]; 159 | LADSPA_Data *output = m_ppfPorts[5]; 160 | LADSPA_Data *latency = m_ppfPorts[6]; 161 | 162 | unsigned half_window_samples = window_size * sample_rate / 2.f; 163 | unsigned window_samples = 2 * half_window_samples + 1; 164 | unsigned sm_window_size = attack * sample_rate; 165 | unsigned latency_samples = half_window_samples + sm_window_size; 166 | *latency = latency_samples; 167 | 168 | if (ns_window == nullptr) { 169 | ns_window = make_unique(window_samples, 170 | sample_rate * 5e-3, 171 | sample_rate, 172 | threshold); 173 | } 174 | if (sm_window == nullptr) { 175 | sm_window = make_unique(sm_window_size); 176 | } 177 | if (buf == nullptr) { 178 | buf = make_unique>(latency_samples); 179 | } 180 | for (unsigned i = 0; i < n_samples; i++) { 181 | // save the sample so we don't lose it after writing to output[i] 182 | LADSPA_Data sample = input[i]; 183 | ns_window->push(sample); 184 | sm_window->push(ns_window->nonsilent() >= min_nonsilent); 185 | if (buf->full()) { 186 | output[i] = buf->front() * sm_window->scaling_factor(); 187 | } 188 | else { 189 | output[i] = 0; 190 | } 191 | buf->push_back(sample); 192 | } 193 | } 194 | 195 | void run_noise_gate(LADSPA_Handle Instance, unsigned long SampleCount); 196 | }; 197 | 198 | void run_noise_gate (LADSPA_Handle handle, 199 | unsigned long n_samples) { 200 | NoiseGate *ng = static_cast(handle); 201 | 202 | ng->run(n_samples); 203 | } 204 | void init_noise_gate() { 205 | CMT_Descriptor *desc = new CMT_Descriptor 206 | (5581, 207 | "noise_gate", 208 | 0, // Properties 209 | "Roman's Noise Gate", 210 | "Roman Cheplyaka", 211 | "(c) Roman Cheplyaka 2018", 212 | nullptr, // ImplementationData 213 | CMT_Instantiate, 214 | nullptr, // activate 215 | run_noise_gate, 216 | nullptr, // run_adding 217 | nullptr, // set_run_adding_gain 218 | nullptr // deactivate TODO we need to clear the buffers/windows 219 | ); 220 | desc->addPort 221 | (LADSPA_PORT_INPUT | LADSPA_PORT_CONTROL, 222 | "Threshold (dB)", 223 | LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE, 224 | -80, 0); 225 | desc->addPort 226 | (LADSPA_PORT_INPUT | LADSPA_PORT_CONTROL, 227 | "Window size (ms)", 228 | LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE, 229 | 100, 3000); 230 | desc->addPort 231 | (LADSPA_PORT_INPUT | LADSPA_PORT_CONTROL, 232 | "Non-silent audio per window (ms)", 233 | LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE, 234 | 10, 500); 235 | desc->addPort 236 | (LADSPA_PORT_INPUT | LADSPA_PORT_CONTROL, 237 | "Attack/decay (ms)", 238 | LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE, 239 | 10, 200); 240 | desc->addPort 241 | (LADSPA_PORT_INPUT | LADSPA_PORT_AUDIO, 242 | "Input"); 243 | desc->addPort 244 | (LADSPA_PORT_OUTPUT | LADSPA_PORT_AUDIO, 245 | "Output"); 246 | desc->addPort 247 | (LADSPA_PORT_OUTPUT | LADSPA_PORT_CONTROL, 248 | "latency"); 249 | registerNewPluginDescriptor(desc); 250 | } 251 | --------------------------------------------------------------------------------