MusicBrainz-libdiscid (empty) → 0.4.1.0
raw patch · 24 files changed
+4655/−0 lines, 24 filesdep +basedep +containersdep +vectorsetup-changed
Dependencies added: base, containers, vector
Files
- COPYING +674/−0
- COPYING.LESSER +165/−0
- MusicBrainz-libdiscid.cabal +36/−0
- Setup.lhs +6/−0
- libdiscid/AUTHORS +38/−0
- libdiscid/COPYING +504/−0
- libdiscid/README +28/−0
- libdiscid/include/config.h +84/−0
- libdiscid/include/discid/discid.h +363/−0
- libdiscid/include/discid/discid_private.h +107/−0
- libdiscid/src/base64.c +110/−0
- libdiscid/src/base64.h +72/−0
- libdiscid/src/disc.c +407/−0
- libdiscid/src/disc_darwin.c +245/−0
- libdiscid/src/disc_freebsd.c +184/−0
- libdiscid/src/disc_generic.c +43/−0
- libdiscid/src/disc_linux.c +277/−0
- libdiscid/src/disc_openbsd.c +158/−0
- libdiscid/src/disc_solaris.c +196/−0
- libdiscid/src/disc_win32.c +159/−0
- libdiscid/src/disc_win32_new.c +243/−0
- libdiscid/src/sha1.c +329/−0
- libdiscid/src/sha1.h +62/−0
- src/Sound/MusicBrainz/DiscId.hs +165/−0
+ COPYING view
@@ -0,0 +1,674 @@+ GNU GENERAL PUBLIC LICENSE+ Version 3, 29 June 2007++ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>+ Everyone is permitted to copy and distribute verbatim copies+ of this license document, but changing it is not allowed.++ Preamble++ The GNU General Public License is a free, copyleft license for+software and other kinds of works.++ The licenses for most software and other practical works are designed+to take away your freedom to share and change the works. By contrast,+the GNU General Public License is intended to guarantee your freedom to+share and change all versions of a program--to make sure it remains free+software for all its users. We, the Free Software Foundation, use the+GNU General Public License for most of our software; it applies also to+any other work released this way by its authors. You can apply it to+your programs, too.++ When we speak of free software, we are referring to freedom, not+price. Our General Public Licenses are designed to make sure that you+have the freedom to distribute copies of free software (and charge for+them if you wish), that you receive source code or can get it if you+want it, that you can change the software or use pieces of it in new+free programs, and that you know you can do these things.++ To protect your rights, we need to prevent others from denying you+these rights or asking you to surrender the rights. Therefore, you have+certain responsibilities if you distribute copies of the software, or if+you modify it: responsibilities to respect the freedom of others.++ For example, if you distribute copies of such a program, whether+gratis or for a fee, you must pass on to the recipients the same+freedoms that you received. You must make sure that they, too, receive+or can get the source code. And you must show them these terms so they+know their rights.++ Developers that use the GNU GPL protect your rights with two steps:+(1) assert copyright on the software, and (2) offer you this License+giving you legal permission to copy, distribute and/or modify it.++ For the developers' and authors' protection, the GPL clearly explains+that there is no warranty for this free software. For both users' and+authors' sake, the GPL requires that modified versions be marked as+changed, so that their problems will not be attributed erroneously to+authors of previous versions.++ Some devices are designed to deny users access to install or run+modified versions of the software inside them, although the manufacturer+can do so. This is fundamentally incompatible with the aim of+protecting users' freedom to change the software. The systematic+pattern of such abuse occurs in the area of products for individuals to+use, which is precisely where it is most unacceptable. Therefore, we+have designed this version of the GPL to prohibit the practice for those+products. If such problems arise substantially in other domains, we+stand ready to extend this provision to those domains in future versions+of the GPL, as needed to protect the freedom of users.++ Finally, every program is threatened constantly by software patents.+States should not allow patents to restrict development and use of+software on general-purpose computers, but in those that do, we wish to+avoid the special danger that patents applied to a free program could+make it effectively proprietary. To prevent this, the GPL assures that+patents cannot be used to render the program non-free.++ The precise terms and conditions for copying, distribution and+modification follow.++ TERMS AND CONDITIONS++ 0. Definitions.++ "This License" refers to version 3 of the GNU General Public License.++ "Copyright" also means copyright-like laws that apply to other kinds of+works, such as semiconductor masks.++ "The Program" refers to any copyrightable work licensed under this+License. Each licensee is addressed as "you". "Licensees" and+"recipients" may be individuals or organizations.++ To "modify" a work means to copy from or adapt all or part of the work+in a fashion requiring copyright permission, other than the making of an+exact copy. The resulting work is called a "modified version" of the+earlier work or a work "based on" the earlier work.++ A "covered work" means either the unmodified Program or a work based+on the Program.++ To "propagate" a work means to do anything with it that, without+permission, would make you directly or secondarily liable for+infringement under applicable copyright law, except executing it on a+computer or modifying a private copy. Propagation includes copying,+distribution (with or without modification), making available to the+public, and in some countries other activities as well.++ To "convey" a work means any kind of propagation that enables other+parties to make or receive copies. Mere interaction with a user through+a computer network, with no transfer of a copy, is not conveying.++ An interactive user interface displays "Appropriate Legal Notices"+to the extent that it includes a convenient and prominently visible+feature that (1) displays an appropriate copyright notice, and (2)+tells the user that there is no warranty for the work (except to the+extent that warranties are provided), that licensees may convey the+work under this License, and how to view a copy of this License. If+the interface presents a list of user commands or options, such as a+menu, a prominent item in the list meets this criterion.++ 1. Source Code.++ The "source code" for a work means the preferred form of the work+for making modifications to it. "Object code" means any non-source+form of a work.++ A "Standard Interface" means an interface that either is an official+standard defined by a recognized standards body, or, in the case of+interfaces specified for a particular programming language, one that+is widely used among developers working in that language.++ The "System Libraries" of an executable work include anything, other+than the work as a whole, that (a) is included in the normal form of+packaging a Major Component, but which is not part of that Major+Component, and (b) serves only to enable use of the work with that+Major Component, or to implement a Standard Interface for which an+implementation is available to the public in source code form. A+"Major Component", in this context, means a major essential component+(kernel, window system, and so on) of the specific operating system+(if any) on which the executable work runs, or a compiler used to+produce the work, or an object code interpreter used to run it.++ The "Corresponding Source" for a work in object code form means all+the source code needed to generate, install, and (for an executable+work) run the object code and to modify the work, including scripts to+control those activities. However, it does not include the work's+System Libraries, or general-purpose tools or generally available free+programs which are used unmodified in performing those activities but+which are not part of the work. For example, Corresponding Source+includes interface definition files associated with source files for+the work, and the source code for shared libraries and dynamically+linked subprograms that the work is specifically designed to require,+such as by intimate data communication or control flow between those+subprograms and other parts of the work.++ The Corresponding Source need not include anything that users+can regenerate automatically from other parts of the Corresponding+Source.++ The Corresponding Source for a work in source code form is that+same work.++ 2. Basic Permissions.++ All rights granted under this License are granted for the term of+copyright on the Program, and are irrevocable provided the stated+conditions are met. This License explicitly affirms your unlimited+permission to run the unmodified Program. The output from running a+covered work is covered by this License only if the output, given its+content, constitutes a covered work. This License acknowledges your+rights of fair use or other equivalent, as provided by copyright law.++ You may make, run and propagate covered works that you do not+convey, without conditions so long as your license otherwise remains+in force. You may convey covered works to others for the sole purpose+of having them make modifications exclusively for you, or provide you+with facilities for running those works, provided that you comply with+the terms of this License in conveying all material for which you do+not control copyright. Those thus making or running the covered works+for you must do so exclusively on your behalf, under your direction+and control, on terms that prohibit them from making any copies of+your copyrighted material outside their relationship with you.++ Conveying under any other circumstances is permitted solely under+the conditions stated below. Sublicensing is not allowed; section 10+makes it unnecessary.++ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.++ No covered work shall be deemed part of an effective technological+measure under any applicable law fulfilling obligations under article+11 of the WIPO copyright treaty adopted on 20 December 1996, or+similar laws prohibiting or restricting circumvention of such+measures.++ When you convey a covered work, you waive any legal power to forbid+circumvention of technological measures to the extent such circumvention+is effected by exercising rights under this License with respect to+the covered work, and you disclaim any intention to limit operation or+modification of the work as a means of enforcing, against the work's+users, your or third parties' legal rights to forbid circumvention of+technological measures.++ 4. Conveying Verbatim Copies.++ You may convey verbatim copies of the Program's source code as you+receive it, in any medium, provided that you conspicuously and+appropriately publish on each copy an appropriate copyright notice;+keep intact all notices stating that this License and any+non-permissive terms added in accord with section 7 apply to the code;+keep intact all notices of the absence of any warranty; and give all+recipients a copy of this License along with the Program.++ You may charge any price or no price for each copy that you convey,+and you may offer support or warranty protection for a fee.++ 5. Conveying Modified Source Versions.++ You may convey a work based on the Program, or the modifications to+produce it from the Program, in the form of source code under the+terms of section 4, provided that you also meet all of these conditions:++ a) The work must carry prominent notices stating that you modified+ it, and giving a relevant date.++ b) The work must carry prominent notices stating that it is+ released under this License and any conditions added under section+ 7. This requirement modifies the requirement in section 4 to+ "keep intact all notices".++ c) You must license the entire work, as a whole, under this+ License to anyone who comes into possession of a copy. This+ License will therefore apply, along with any applicable section 7+ additional terms, to the whole of the work, and all its parts,+ regardless of how they are packaged. This License gives no+ permission to license the work in any other way, but it does not+ invalidate such permission if you have separately received it.++ d) If the work has interactive user interfaces, each must display+ Appropriate Legal Notices; however, if the Program has interactive+ interfaces that do not display Appropriate Legal Notices, your+ work need not make them do so.++ A compilation of a covered work with other separate and independent+works, which are not by their nature extensions of the covered work,+and which are not combined with it such as to form a larger program,+in or on a volume of a storage or distribution medium, is called an+"aggregate" if the compilation and its resulting copyright are not+used to limit the access or legal rights of the compilation's users+beyond what the individual works permit. Inclusion of a covered work+in an aggregate does not cause this License to apply to the other+parts of the aggregate.++ 6. Conveying Non-Source Forms.++ You may convey a covered work in object code form under the terms+of sections 4 and 5, provided that you also convey the+machine-readable Corresponding Source under the terms of this License,+in one of these ways:++ a) Convey the object code in, or embodied in, a physical product+ (including a physical distribution medium), accompanied by the+ Corresponding Source fixed on a durable physical medium+ customarily used for software interchange.++ b) Convey the object code in, or embodied in, a physical product+ (including a physical distribution medium), accompanied by a+ written offer, valid for at least three years and valid for as+ long as you offer spare parts or customer support for that product+ model, to give anyone who possesses the object code either (1) a+ copy of the Corresponding Source for all the software in the+ product that is covered by this License, on a durable physical+ medium customarily used for software interchange, for a price no+ more than your reasonable cost of physically performing this+ conveying of source, or (2) access to copy the+ Corresponding Source from a network server at no charge.++ c) Convey individual copies of the object code with a copy of the+ written offer to provide the Corresponding Source. This+ alternative is allowed only occasionally and noncommercially, and+ only if you received the object code with such an offer, in accord+ with subsection 6b.++ d) Convey the object code by offering access from a designated+ place (gratis or for a charge), and offer equivalent access to the+ Corresponding Source in the same way through the same place at no+ further charge. You need not require recipients to copy the+ Corresponding Source along with the object code. If the place to+ copy the object code is a network server, the Corresponding Source+ may be on a different server (operated by you or a third party)+ that supports equivalent copying facilities, provided you maintain+ clear directions next to the object code saying where to find the+ Corresponding Source. Regardless of what server hosts the+ Corresponding Source, you remain obligated to ensure that it is+ available for as long as needed to satisfy these requirements.++ e) Convey the object code using peer-to-peer transmission, provided+ you inform other peers where the object code and Corresponding+ Source of the work are being offered to the general public at no+ charge under subsection 6d.++ A separable portion of the object code, whose source code is excluded+from the Corresponding Source as a System Library, need not be+included in conveying the object code work.++ A "User Product" is either (1) a "consumer product", which means any+tangible personal property which is normally used for personal, family,+or household purposes, or (2) anything designed or sold for incorporation+into a dwelling. In determining whether a product is a consumer product,+doubtful cases shall be resolved in favor of coverage. For a particular+product received by a particular user, "normally used" refers to a+typical or common use of that class of product, regardless of the status+of the particular user or of the way in which the particular user+actually uses, or expects or is expected to use, the product. A product+is a consumer product regardless of whether the product has substantial+commercial, industrial or non-consumer uses, unless such uses represent+the only significant mode of use of the product.++ "Installation Information" for a User Product means any methods,+procedures, authorization keys, or other information required to install+and execute modified versions of a covered work in that User Product from+a modified version of its Corresponding Source. The information must+suffice to ensure that the continued functioning of the modified object+code is in no case prevented or interfered with solely because+modification has been made.++ If you convey an object code work under this section in, or with, or+specifically for use in, a User Product, and the conveying occurs as+part of a transaction in which the right of possession and use of the+User Product is transferred to the recipient in perpetuity or for a+fixed term (regardless of how the transaction is characterized), the+Corresponding Source conveyed under this section must be accompanied+by the Installation Information. But this requirement does not apply+if neither you nor any third party retains the ability to install+modified object code on the User Product (for example, the work has+been installed in ROM).++ The requirement to provide Installation Information does not include a+requirement to continue to provide support service, warranty, or updates+for a work that has been modified or installed by the recipient, or for+the User Product in which it has been modified or installed. Access to a+network may be denied when the modification itself materially and+adversely affects the operation of the network or violates the rules and+protocols for communication across the network.++ Corresponding Source conveyed, and Installation Information provided,+in accord with this section must be in a format that is publicly+documented (and with an implementation available to the public in+source code form), and must require no special password or key for+unpacking, reading or copying.++ 7. Additional Terms.++ "Additional permissions" are terms that supplement the terms of this+License by making exceptions from one or more of its conditions.+Additional permissions that are applicable to the entire Program shall+be treated as though they were included in this License, to the extent+that they are valid under applicable law. If additional permissions+apply only to part of the Program, that part may be used separately+under those permissions, but the entire Program remains governed by+this License without regard to the additional permissions.++ When you convey a copy of a covered work, you may at your option+remove any additional permissions from that copy, or from any part of+it. (Additional permissions may be written to require their own+removal in certain cases when you modify the work.) You may place+additional permissions on material, added by you to a covered work,+for which you have or can give appropriate copyright permission.++ Notwithstanding any other provision of this License, for material you+add to a covered work, you may (if authorized by the copyright holders of+that material) supplement the terms of this License with terms:++ a) Disclaiming warranty or limiting liability differently from the+ terms of sections 15 and 16 of this License; or++ b) Requiring preservation of specified reasonable legal notices or+ author attributions in that material or in the Appropriate Legal+ Notices displayed by works containing it; or++ c) Prohibiting misrepresentation of the origin of that material, or+ requiring that modified versions of such material be marked in+ reasonable ways as different from the original version; or++ d) Limiting the use for publicity purposes of names of licensors or+ authors of the material; or++ e) Declining to grant rights under trademark law for use of some+ trade names, trademarks, or service marks; or++ f) Requiring indemnification of licensors and authors of that+ material by anyone who conveys the material (or modified versions of+ it) with contractual assumptions of liability to the recipient, for+ any liability that these contractual assumptions directly impose on+ those licensors and authors.++ All other non-permissive additional terms are considered "further+restrictions" within the meaning of section 10. If the Program as you+received it, or any part of it, contains a notice stating that it is+governed by this License along with a term that is a further+restriction, you may remove that term. If a license document contains+a further restriction but permits relicensing or conveying under this+License, you may add to a covered work material governed by the terms+of that license document, provided that the further restriction does+not survive such relicensing or conveying.++ If you add terms to a covered work in accord with this section, you+must place, in the relevant source files, a statement of the+additional terms that apply to those files, or a notice indicating+where to find the applicable terms.++ Additional terms, permissive or non-permissive, may be stated in the+form of a separately written license, or stated as exceptions;+the above requirements apply either way.++ 8. Termination.++ You may not propagate or modify a covered work except as expressly+provided under this License. Any attempt otherwise to propagate or+modify it is void, and will automatically terminate your rights under+this License (including any patent licenses granted under the third+paragraph of section 11).++ However, if you cease all violation of this License, then your+license from a particular copyright holder is reinstated (a)+provisionally, unless and until the copyright holder explicitly and+finally terminates your license, and (b) permanently, if the copyright+holder fails to notify you of the violation by some reasonable means+prior to 60 days after the cessation.++ Moreover, your license from a particular copyright holder is+reinstated permanently if the copyright holder notifies you of the+violation by some reasonable means, this is the first time you have+received notice of violation of this License (for any work) from that+copyright holder, and you cure the violation prior to 30 days after+your receipt of the notice.++ Termination of your rights under this section does not terminate the+licenses of parties who have received copies or rights from you under+this License. If your rights have been terminated and not permanently+reinstated, you do not qualify to receive new licenses for the same+material under section 10.++ 9. Acceptance Not Required for Having Copies.++ You are not required to accept this License in order to receive or+run a copy of the Program. Ancillary propagation of a covered work+occurring solely as a consequence of using peer-to-peer transmission+to receive a copy likewise does not require acceptance. However,+nothing other than this License grants you permission to propagate or+modify any covered work. These actions infringe copyright if you do+not accept this License. Therefore, by modifying or propagating a+covered work, you indicate your acceptance of this License to do so.++ 10. Automatic Licensing of Downstream Recipients.++ Each time you convey a covered work, the recipient automatically+receives a license from the original licensors, to run, modify and+propagate that work, subject to this License. You are not responsible+for enforcing compliance by third parties with this License.++ An "entity transaction" is a transaction transferring control of an+organization, or substantially all assets of one, or subdividing an+organization, or merging organizations. If propagation of a covered+work results from an entity transaction, each party to that+transaction who receives a copy of the work also receives whatever+licenses to the work the party's predecessor in interest had or could+give under the previous paragraph, plus a right to possession of the+Corresponding Source of the work from the predecessor in interest, if+the predecessor has it or can get it with reasonable efforts.++ You may not impose any further restrictions on the exercise of the+rights granted or affirmed under this License. For example, you may+not impose a license fee, royalty, or other charge for exercise of+rights granted under this License, and you may not initiate litigation+(including a cross-claim or counterclaim in a lawsuit) alleging that+any patent claim is infringed by making, using, selling, offering for+sale, or importing the Program or any portion of it.++ 11. Patents.++ A "contributor" is a copyright holder who authorizes use under this+License of the Program or a work on which the Program is based. The+work thus licensed is called the contributor's "contributor version".++ A contributor's "essential patent claims" are all patent claims+owned or controlled by the contributor, whether already acquired or+hereafter acquired, that would be infringed by some manner, permitted+by this License, of making, using, or selling its contributor version,+but do not include claims that would be infringed only as a+consequence of further modification of the contributor version. For+purposes of this definition, "control" includes the right to grant+patent sublicenses in a manner consistent with the requirements of+this License.++ Each contributor grants you a non-exclusive, worldwide, royalty-free+patent license under the contributor's essential patent claims, to+make, use, sell, offer for sale, import and otherwise run, modify and+propagate the contents of its contributor version.++ In the following three paragraphs, a "patent license" is any express+agreement or commitment, however denominated, not to enforce a patent+(such as an express permission to practice a patent or covenant not to+sue for patent infringement). To "grant" such a patent license to a+party means to make such an agreement or commitment not to enforce a+patent against the party.++ If you convey a covered work, knowingly relying on a patent license,+and the Corresponding Source of the work is not available for anyone+to copy, free of charge and under the terms of this License, through a+publicly available network server or other readily accessible means,+then you must either (1) cause the Corresponding Source to be so+available, or (2) arrange to deprive yourself of the benefit of the+patent license for this particular work, or (3) arrange, in a manner+consistent with the requirements of this License, to extend the patent+license to downstream recipients. "Knowingly relying" means you have+actual knowledge that, but for the patent license, your conveying the+covered work in a country, or your recipient's use of the covered work+in a country, would infringe one or more identifiable patents in that+country that you have reason to believe are valid.++ If, pursuant to or in connection with a single transaction or+arrangement, you convey, or propagate by procuring conveyance of, a+covered work, and grant a patent license to some of the parties+receiving the covered work authorizing them to use, propagate, modify+or convey a specific copy of the covered work, then the patent license+you grant is automatically extended to all recipients of the covered+work and works based on it.++ A patent license is "discriminatory" if it does not include within+the scope of its coverage, prohibits the exercise of, or is+conditioned on the non-exercise of one or more of the rights that are+specifically granted under this License. You may not convey a covered+work if you are a party to an arrangement with a third party that is+in the business of distributing software, under which you make payment+to the third party based on the extent of your activity of conveying+the work, and under which the third party grants, to any of the+parties who would receive the covered work from you, a discriminatory+patent license (a) in connection with copies of the covered work+conveyed by you (or copies made from those copies), or (b) primarily+for and in connection with specific products or compilations that+contain the covered work, unless you entered into that arrangement,+or that patent license was granted, prior to 28 March 2007.++ Nothing in this License shall be construed as excluding or limiting+any implied license or other defenses to infringement that may+otherwise be available to you under applicable patent law.++ 12. No Surrender of Others' Freedom.++ If conditions are imposed on you (whether by court order, agreement or+otherwise) that contradict the conditions of this License, they do not+excuse you from the conditions of this License. If you cannot convey a+covered work so as to satisfy simultaneously your obligations under this+License and any other pertinent obligations, then as a consequence you may+not convey it at all. For example, if you agree to terms that obligate you+to collect a royalty for further conveying from those to whom you convey+the Program, the only way you could satisfy both those terms and this+License would be to refrain entirely from conveying the Program.++ 13. Use with the GNU Affero General Public License.++ Notwithstanding any other provision of this License, you have+permission to link or combine any covered work with a work licensed+under version 3 of the GNU Affero General Public License into a single+combined work, and to convey the resulting work. The terms of this+License will continue to apply to the part which is the covered work,+but the special requirements of the GNU Affero General Public License,+section 13, concerning interaction through a network will apply to the+combination as such.++ 14. Revised Versions of this License.++ The Free Software Foundation may publish revised and/or new versions of+the GNU General Public License from time to time. Such new versions will+be similar in spirit to the present version, but may differ in detail to+address new problems or concerns.++ Each version is given a distinguishing version number. If the+Program specifies that a certain numbered version of the GNU General+Public License "or any later version" applies to it, you have the+option of following the terms and conditions either of that numbered+version or of any later version published by the Free Software+Foundation. If the Program does not specify a version number of the+GNU General Public License, you may choose any version ever published+by the Free Software Foundation.++ If the Program specifies that a proxy can decide which future+versions of the GNU General Public License can be used, that proxy's+public statement of acceptance of a version permanently authorizes you+to choose that version for the Program.++ Later license versions may give you additional or different+permissions. However, no additional obligations are imposed on any+author or copyright holder as a result of your choosing to follow a+later version.++ 15. Disclaimer of Warranty.++ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.++ 16. Limitation of Liability.++ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF+SUCH DAMAGES.++ 17. Interpretation of Sections 15 and 16.++ If the disclaimer of warranty and limitation of liability provided+above cannot be given local legal effect according to their terms,+reviewing courts shall apply local law that most closely approximates+an absolute waiver of all civil liability in connection with the+Program, unless a warranty or assumption of liability accompanies a+copy of the Program in return for a fee.++ END OF TERMS AND CONDITIONS++ How to Apply These Terms to Your New Programs++ If you develop a new program, and you want it to be of the greatest+possible use to the public, the best way to achieve this is to make it+free software which everyone can redistribute and change under these terms.++ To do so, attach the following notices to the program. It is safest+to attach them to the start of each source file to most effectively+state the exclusion of warranty; and each file should have at least+the "copyright" line and a pointer to where the full notice is found.++ <one line to give the program's name and a brief idea of what it does.>+ Copyright (C) <year> <name of author>++ This program is free software: you can redistribute it and/or modify+ it under the terms of the GNU General Public License as published by+ the Free Software Foundation, either version 3 of the License, or+ (at your option) any later version.++ This program is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+ GNU General Public License for more details.++ You should have received a copy of the GNU General Public License+ along with this program. If not, see <http://www.gnu.org/licenses/>.++Also add information on how to contact you by electronic and paper mail.++ If the program does terminal interaction, make it output a short+notice like this when it starts in an interactive mode:++ <program> Copyright (C) <year> <name of author>+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.+ This is free software, and you are welcome to redistribute it+ under certain conditions; type `show c' for details.++The hypothetical commands `show w' and `show c' should show the appropriate+parts of the General Public License. Of course, your program's commands+might be different; for a GUI interface, you would use an "about box".++ You should also get your employer (if you work as a programmer) or school,+if any, to sign a "copyright disclaimer" for the program, if necessary.+For more information on this, and how to apply and follow the GNU GPL, see+<http://www.gnu.org/licenses/>.++ The GNU General Public License does not permit incorporating your program+into proprietary programs. If your program is a subroutine library, you+may consider it more useful to permit linking proprietary applications with+the library. If this is what you want to do, use the GNU Lesser General+Public License instead of this License. But first, please read+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+ COPYING.LESSER view
@@ -0,0 +1,165 @@+ GNU LESSER GENERAL PUBLIC LICENSE+ Version 3, 29 June 2007++ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>+ Everyone is permitted to copy and distribute verbatim copies+ of this license document, but changing it is not allowed.+++ This version of the GNU Lesser General Public License incorporates+the terms and conditions of version 3 of the GNU General Public+License, supplemented by the additional permissions listed below.++ 0. Additional Definitions.++ As used herein, "this License" refers to version 3 of the GNU Lesser+General Public License, and the "GNU GPL" refers to version 3 of the GNU+General Public License.++ "The Library" refers to a covered work governed by this License,+other than an Application or a Combined Work as defined below.++ An "Application" is any work that makes use of an interface provided+by the Library, but which is not otherwise based on the Library.+Defining a subclass of a class defined by the Library is deemed a mode+of using an interface provided by the Library.++ A "Combined Work" is a work produced by combining or linking an+Application with the Library. The particular version of the Library+with which the Combined Work was made is also called the "Linked+Version".++ The "Minimal Corresponding Source" for a Combined Work means the+Corresponding Source for the Combined Work, excluding any source code+for portions of the Combined Work that, considered in isolation, are+based on the Application, and not on the Linked Version.++ The "Corresponding Application Code" for a Combined Work means the+object code and/or source code for the Application, including any data+and utility programs needed for reproducing the Combined Work from the+Application, but excluding the System Libraries of the Combined Work.++ 1. Exception to Section 3 of the GNU GPL.++ You may convey a covered work under sections 3 and 4 of this License+without being bound by section 3 of the GNU GPL.++ 2. Conveying Modified Versions.++ If you modify a copy of the Library, and, in your modifications, a+facility refers to a function or data to be supplied by an Application+that uses the facility (other than as an argument passed when the+facility is invoked), then you may convey a copy of the modified+version:++ a) under this License, provided that you make a good faith effort to+ ensure that, in the event an Application does not supply the+ function or data, the facility still operates, and performs+ whatever part of its purpose remains meaningful, or++ b) under the GNU GPL, with none of the additional permissions of+ this License applicable to that copy.++ 3. Object Code Incorporating Material from Library Header Files.++ The object code form of an Application may incorporate material from+a header file that is part of the Library. You may convey such object+code under terms of your choice, provided that, if the incorporated+material is not limited to numerical parameters, data structure+layouts and accessors, or small macros, inline functions and templates+(ten or fewer lines in length), you do both of the following:++ a) Give prominent notice with each copy of the object code that the+ Library is used in it and that the Library and its use are+ covered by this License.++ b) Accompany the object code with a copy of the GNU GPL and this license+ document.++ 4. Combined Works.++ You may convey a Combined Work under terms of your choice that,+taken together, effectively do not restrict modification of the+portions of the Library contained in the Combined Work and reverse+engineering for debugging such modifications, if you also do each of+the following:++ a) Give prominent notice with each copy of the Combined Work that+ the Library is used in it and that the Library and its use are+ covered by this License.++ b) Accompany the Combined Work with a copy of the GNU GPL and this license+ document.++ c) For a Combined Work that displays copyright notices during+ execution, include the copyright notice for the Library among+ these notices, as well as a reference directing the user to the+ copies of the GNU GPL and this license document.++ d) Do one of the following:++ 0) Convey the Minimal Corresponding Source under the terms of this+ License, and the Corresponding Application Code in a form+ suitable for, and under terms that permit, the user to+ recombine or relink the Application with a modified version of+ the Linked Version to produce a modified Combined Work, in the+ manner specified by section 6 of the GNU GPL for conveying+ Corresponding Source.++ 1) Use a suitable shared library mechanism for linking with the+ Library. A suitable mechanism is one that (a) uses at run time+ a copy of the Library already present on the user's computer+ system, and (b) will operate properly with a modified version+ of the Library that is interface-compatible with the Linked+ Version.++ e) Provide Installation Information, but only if you would otherwise+ be required to provide such information under section 6 of the+ GNU GPL, and only to the extent that such information is+ necessary to install and execute a modified version of the+ Combined Work produced by recombining or relinking the+ Application with a modified version of the Linked Version. (If+ you use option 4d0, the Installation Information must accompany+ the Minimal Corresponding Source and Corresponding Application+ Code. If you use option 4d1, you must provide the Installation+ Information in the manner specified by section 6 of the GNU GPL+ for conveying Corresponding Source.)++ 5. Combined Libraries.++ You may place library facilities that are a work based on the+Library side by side in a single library together with other library+facilities that are not Applications and are not covered by this+License, and convey such a combined library under terms of your+choice, if you do both of the following:++ a) Accompany the combined library with a copy of the same work based+ on the Library, uncombined with any other library facilities,+ conveyed under the terms of this License.++ b) Give prominent notice with the combined library that part of it+ is a work based on the Library, and explaining where to find the+ accompanying uncombined form of the same work.++ 6. Revised Versions of the GNU Lesser General Public License.++ The Free Software Foundation may publish revised and/or new versions+of the GNU Lesser General Public License from time to time. Such new+versions will be similar in spirit to the present version, but may+differ in detail to address new problems or concerns.++ Each version is given a distinguishing version number. If the+Library as you received it specifies that a certain numbered version+of the GNU Lesser General Public License "or any later version"+applies to it, you have the option of following the terms and+conditions either of that published version or of any later version+published by the Free Software Foundation. If the Library as you+received it does not specify a version number of the GNU Lesser+General Public License, you may choose any version of the GNU Lesser+General Public License ever published by the Free Software Foundation.++ If the Library as you received it specifies that a proxy can decide+whether future versions of the GNU Lesser General Public License shall+apply, that proxy's public statement of acceptance of any version is+permanent authorization for you to choose that version for the+Library.
+ MusicBrainz-libdiscid.cabal view
@@ -0,0 +1,36 @@+name: MusicBrainz-libdiscid+version: 0.4.1.0+cabal-version: >=1.6+build-type: Simple+license: LGPL+license-file: COPYING.LESSER+copyright: 2013 André Twupack+maintainer: André Twupack+homepage: https://github.com/atwupack/MusicBrainz-libdiscid+bug-reports: https://github.com/atwupack/MusicBrainz-libdiscid/issues+synopsis: Binding to libdiscid by MusicBrainz+description: Binding to libdiscid by MusicBrainz.+category: Audio, Sound, FFI+author: André Twupack+data-dir: ""+extra-source-files: COPYING libdiscid/AUTHORS libdiscid/COPYING+ libdiscid/README libdiscid/include/config.h+ libdiscid/include/discid/*.h libdiscid/src/*.c libdiscid/src/*.h+ +library+ build-depends: base >=4 && <5, containers -any, vector >0.10+ exposed-modules: Sound.MusicBrainz.DiscId+ exposed: True+ buildable: True+ cc-options: -DHAVE_CONFIG_H+ if os(windows)+ c-sources: libdiscid/src/base64.c libdiscid/src/disc.c+ libdiscid/src/disc_win32_new.c libdiscid/src/sha1.c+ libdiscid/src/disc_win32.c+ extra-libraries: winmm+ if os(linux)+ c-sources: libdiscid/src/base64.c libdiscid/src/disc.c+ libdiscid/src/disc_linux.c libdiscid/src/sha1.c+ include-dirs: libdiscid/include+ hs-source-dirs: src+
+ Setup.lhs view
@@ -0,0 +1,6 @@+#!/usr/bin/runhaskell +> module Main where+> import Distribution.Simple+> main :: IO ()+> main = defaultMain+
+ libdiscid/AUTHORS view
@@ -0,0 +1,38 @@+This library is a C port of the DiscID-related code from libmusicbrainz-2+written by Robert Kaye et al.++The following people have contributed to libdiscid:++ Matthias Friedrich <matt at mafr dot de>+ - Created the library interface and documented it.+ - Wrote the operating system independent parts of libdiscid.+ - Ported the DiscID and linux code.++ Lukáš Lalinský <lalinsky at gmail dot com>+ - Ported the win32 code and added a Makefile for MSVC.+ - Added FreeDB support and a test program.+ - Several other useful changes.++ Robert Kaye <rob at eorbit dot net>+ - Invented and originally implemented the DiscID algorithm.+ - Ported the darwin code.++ Patrick Hurrelmann <outi at bytephobia dot de>+ - Implemented and tested FreeBSD support.++ Anton Yabchinskiy <arn at bestmx dot ru>+ - Implemented and tested OpenBSD support.++ Shunsuke Kuroda <kronox at lifewithsolaris dot jp>+ - Implemented and tested Solaris/OpenSolaris support.++ Nicholas Humphrey+ - Implemented ISRC reading on Darwin++ Johannes Dewender <brainz at JonnyJD dot net>+ - Implemented ISRC reading on Linux+ - Implemented features API and generic platform+ - Completed CMake support on all platforms+ Various Autotools fixes, switch to libtool -version-number+ versioninfo resource for DLL+
+ libdiscid/COPYING view
@@ -0,0 +1,504 @@+ GNU LESSER GENERAL PUBLIC LICENSE+ Version 2.1, February 1999++ Copyright (C) 1991, 1999 Free Software Foundation, Inc.+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA+ Everyone is permitted to copy and distribute verbatim copies+ of this license document, but changing it is not allowed.++[This is the first released version of the Lesser GPL. It also counts+ as the successor of the GNU Library Public License, version 2, hence+ the version number 2.1.]++ Preamble++ The licenses for most software are designed to take away your+freedom to share and change it. By contrast, the GNU General Public+Licenses are intended to guarantee your freedom to share and change+free software--to make sure the software is free for all its users.++ This license, the Lesser General Public License, applies to some+specially designated software packages--typically libraries--of the+Free Software Foundation and other authors who decide to use it. You+can use it too, but we suggest you first think carefully about whether+this license or the ordinary General Public License is the better+strategy to use in any particular case, based on the explanations below.++ When we speak of free software, we are referring to freedom of use,+not price. Our General Public Licenses are designed to make sure that+you have the freedom to distribute copies of free software (and charge+for this service if you wish); that you receive source code or can get+it if you want it; that you can change the software and use pieces of+it in new free programs; and that you are informed that you can do+these things.++ To protect your rights, we need to make restrictions that forbid+distributors to deny you these rights or to ask you to surrender these+rights. These restrictions translate to certain responsibilities for+you if you distribute copies of the library or if you modify it.++ For example, if you distribute copies of the library, whether gratis+or for a fee, you must give the recipients all the rights that we gave+you. You must make sure that they, too, receive or can get the source+code. If you link other code with the library, you must provide+complete object files to the recipients, so that they can relink them+with the library after making changes to the library and recompiling+it. And you must show them these terms so they know their rights.++ We protect your rights with a two-step method: (1) we copyright the+library, and (2) we offer you this license, which gives you legal+permission to copy, distribute and/or modify the library.++ To protect each distributor, we want to make it very clear that+there is no warranty for the free library. Also, if the library is+modified by someone else and passed on, the recipients should know+that what they have is not the original version, so that the original+author's reputation will not be affected by problems that might be+introduced by others.++ Finally, software patents pose a constant threat to the existence of+any free program. We wish to make sure that a company cannot+effectively restrict the users of a free program by obtaining a+restrictive license from a patent holder. Therefore, we insist that+any patent license obtained for a version of the library must be+consistent with the full freedom of use specified in this license.++ Most GNU software, including some libraries, is covered by the+ordinary GNU General Public License. This license, the GNU Lesser+General Public License, applies to certain designated libraries, and+is quite different from the ordinary General Public License. We use+this license for certain libraries in order to permit linking those+libraries into non-free programs.++ When a program is linked with a library, whether statically or using+a shared library, the combination of the two is legally speaking a+combined work, a derivative of the original library. The ordinary+General Public License therefore permits such linking only if the+entire combination fits its criteria of freedom. The Lesser General+Public License permits more lax criteria for linking other code with+the library.++ We call this license the "Lesser" General Public License because it+does Less to protect the user's freedom than the ordinary General+Public License. It also provides other free software developers Less+of an advantage over competing non-free programs. These disadvantages+are the reason we use the ordinary General Public License for many+libraries. However, the Lesser license provides advantages in certain+special circumstances.++ For example, on rare occasions, there may be a special need to+encourage the widest possible use of a certain library, so that it becomes+a de-facto standard. To achieve this, non-free programs must be+allowed to use the library. A more frequent case is that a free+library does the same job as widely used non-free libraries. In this+case, there is little to gain by limiting the free library to free+software only, so we use the Lesser General Public License.++ In other cases, permission to use a particular library in non-free+programs enables a greater number of people to use a large body of+free software. For example, permission to use the GNU C Library in+non-free programs enables many more people to use the whole GNU+operating system, as well as its variant, the GNU/Linux operating+system.++ Although the Lesser General Public License is Less protective of the+users' freedom, it does ensure that the user of a program that is+linked with the Library has the freedom and the wherewithal to run+that program using a modified version of the Library.++ The precise terms and conditions for copying, distribution and+modification follow. Pay close attention to the difference between a+"work based on the library" and a "work that uses the library". The+former contains code derived from the library, whereas the latter must+be combined with the library in order to run.++ GNU LESSER GENERAL PUBLIC LICENSE+ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION++ 0. This License Agreement applies to any software library or other+program which contains a notice placed by the copyright holder or+other authorized party saying it may be distributed under the terms of+this Lesser General Public License (also called "this License").+Each licensee is addressed as "you".++ A "library" means a collection of software functions and/or data+prepared so as to be conveniently linked with application programs+(which use some of those functions and data) to form executables.++ The "Library", below, refers to any such software library or work+which has been distributed under these terms. A "work based on the+Library" means either the Library or any derivative work under+copyright law: that is to say, a work containing the Library or a+portion of it, either verbatim or with modifications and/or translated+straightforwardly into another language. (Hereinafter, translation is+included without limitation in the term "modification".)++ "Source code" for a work means the preferred form of the work for+making modifications to it. For a library, complete source code means+all the source code for all modules it contains, plus any associated+interface definition files, plus the scripts used to control compilation+and installation of the library.++ Activities other than copying, distribution and modification are not+covered by this License; they are outside its scope. The act of+running a program using the Library is not restricted, and output from+such a program is covered only if its contents constitute a work based+on the Library (independent of the use of the Library in a tool for+writing it). Whether that is true depends on what the Library does+and what the program that uses the Library does.+ + 1. You may copy and distribute verbatim copies of the Library's+complete source code as you receive it, in any medium, provided that+you conspicuously and appropriately publish on each copy an+appropriate copyright notice and disclaimer of warranty; keep intact+all the notices that refer to this License and to the absence of any+warranty; and distribute a copy of this License along with the+Library.++ You may charge a fee for the physical act of transferring a copy,+and you may at your option offer warranty protection in exchange for a+fee.++ 2. You may modify your copy or copies of the Library or any portion+of it, thus forming a work based on the Library, and copy and+distribute such modifications or work under the terms of Section 1+above, provided that you also meet all of these conditions:++ a) The modified work must itself be a software library.++ b) You must cause the files modified to carry prominent notices+ stating that you changed the files and the date of any change.++ c) You must cause the whole of the work to be licensed at no+ charge to all third parties under the terms of this License.++ d) If a facility in the modified Library refers to a function or a+ table of data to be supplied by an application program that uses+ the facility, other than as an argument passed when the facility+ is invoked, then you must make a good faith effort to ensure that,+ in the event an application does not supply such function or+ table, the facility still operates, and performs whatever part of+ its purpose remains meaningful.++ (For example, a function in a library to compute square roots has+ a purpose that is entirely well-defined independent of the+ application. Therefore, Subsection 2d requires that any+ application-supplied function or table used by this function must+ be optional: if the application does not supply it, the square+ root function must still compute square roots.)++These requirements apply to the modified work as a whole. If+identifiable sections of that work are not derived from the Library,+and can be reasonably considered independent and separate works in+themselves, then this License, and its terms, do not apply to those+sections when you distribute them as separate works. But when you+distribute the same sections as part of a whole which is a work based+on the Library, the distribution of the whole must be on the terms of+this License, whose permissions for other licensees extend to the+entire whole, and thus to each and every part regardless of who wrote+it.++Thus, it is not the intent of this section to claim rights or contest+your rights to work written entirely by you; rather, the intent is to+exercise the right to control the distribution of derivative or+collective works based on the Library.++In addition, mere aggregation of another work not based on the Library+with the Library (or with a work based on the Library) on a volume of+a storage or distribution medium does not bring the other work under+the scope of this License.++ 3. You may opt to apply the terms of the ordinary GNU General Public+License instead of this License to a given copy of the Library. To do+this, you must alter all the notices that refer to this License, so+that they refer to the ordinary GNU General Public License, version 2,+instead of to this License. (If a newer version than version 2 of the+ordinary GNU General Public License has appeared, then you can specify+that version instead if you wish.) Do not make any other change in+these notices.++ Once this change is made in a given copy, it is irreversible for+that copy, so the ordinary GNU General Public License applies to all+subsequent copies and derivative works made from that copy.++ This option is useful when you wish to copy part of the code of+the Library into a program that is not a library.++ 4. You may copy and distribute the Library (or a portion or+derivative of it, under Section 2) in object code or executable form+under the terms of Sections 1 and 2 above provided that you accompany+it with the complete corresponding machine-readable source code, which+must be distributed under the terms of Sections 1 and 2 above on a+medium customarily used for software interchange.++ If distribution of object code is made by offering access to copy+from a designated place, then offering equivalent access to copy the+source code from the same place satisfies the requirement to+distribute the source code, even though third parties are not+compelled to copy the source along with the object code.++ 5. A program that contains no derivative of any portion of the+Library, but is designed to work with the Library by being compiled or+linked with it, is called a "work that uses the Library". Such a+work, in isolation, is not a derivative work of the Library, and+therefore falls outside the scope of this License.++ However, linking a "work that uses the Library" with the Library+creates an executable that is a derivative of the Library (because it+contains portions of the Library), rather than a "work that uses the+library". The executable is therefore covered by this License.+Section 6 states terms for distribution of such executables.++ When a "work that uses the Library" uses material from a header file+that is part of the Library, the object code for the work may be a+derivative work of the Library even though the source code is not.+Whether this is true is especially significant if the work can be+linked without the Library, or if the work is itself a library. The+threshold for this to be true is not precisely defined by law.++ If such an object file uses only numerical parameters, data+structure layouts and accessors, and small macros and small inline+functions (ten lines or less in length), then the use of the object+file is unrestricted, regardless of whether it is legally a derivative+work. (Executables containing this object code plus portions of the+Library will still fall under Section 6.)++ Otherwise, if the work is a derivative of the Library, you may+distribute the object code for the work under the terms of Section 6.+Any executables containing that work also fall under Section 6,+whether or not they are linked directly with the Library itself.++ 6. As an exception to the Sections above, you may also combine or+link a "work that uses the Library" with the Library to produce a+work containing portions of the Library, and distribute that work+under terms of your choice, provided that the terms permit+modification of the work for the customer's own use and reverse+engineering for debugging such modifications.++ You must give prominent notice with each copy of the work that the+Library is used in it and that the Library and its use are covered by+this License. You must supply a copy of this License. If the work+during execution displays copyright notices, you must include the+copyright notice for the Library among them, as well as a reference+directing the user to the copy of this License. Also, you must do one+of these things:++ a) Accompany the work with the complete corresponding+ machine-readable source code for the Library including whatever+ changes were used in the work (which must be distributed under+ Sections 1 and 2 above); and, if the work is an executable linked+ with the Library, with the complete machine-readable "work that+ uses the Library", as object code and/or source code, so that the+ user can modify the Library and then relink to produce a modified+ executable containing the modified Library. (It is understood+ that the user who changes the contents of definitions files in the+ Library will not necessarily be able to recompile the application+ to use the modified definitions.)++ b) Use a suitable shared library mechanism for linking with the+ Library. A suitable mechanism is one that (1) uses at run time a+ copy of the library already present on the user's computer system,+ rather than copying library functions into the executable, and (2)+ will operate properly with a modified version of the library, if+ the user installs one, as long as the modified version is+ interface-compatible with the version that the work was made with.++ c) Accompany the work with a written offer, valid for at+ least three years, to give the same user the materials+ specified in Subsection 6a, above, for a charge no more+ than the cost of performing this distribution.++ d) If distribution of the work is made by offering access to copy+ from a designated place, offer equivalent access to copy the above+ specified materials from the same place.++ e) Verify that the user has already received a copy of these+ materials or that you have already sent this user a copy.++ For an executable, the required form of the "work that uses the+Library" must include any data and utility programs needed for+reproducing the executable from it. However, as a special exception,+the materials to be distributed need not include anything that is+normally distributed (in either source or binary form) with the major+components (compiler, kernel, and so on) of the operating system on+which the executable runs, unless that component itself accompanies+the executable.++ It may happen that this requirement contradicts the license+restrictions of other proprietary libraries that do not normally+accompany the operating system. Such a contradiction means you cannot+use both them and the Library together in an executable that you+distribute.++ 7. You may place library facilities that are a work based on the+Library side-by-side in a single library together with other library+facilities not covered by this License, and distribute such a combined+library, provided that the separate distribution of the work based on+the Library and of the other library facilities is otherwise+permitted, and provided that you do these two things:++ a) Accompany the combined library with a copy of the same work+ based on the Library, uncombined with any other library+ facilities. This must be distributed under the terms of the+ Sections above.++ b) Give prominent notice with the combined library of the fact+ that part of it is a work based on the Library, and explaining+ where to find the accompanying uncombined form of the same work.++ 8. You may not copy, modify, sublicense, link with, or distribute+the Library except as expressly provided under this License. Any+attempt otherwise to copy, modify, sublicense, link with, or+distribute the Library is void, and will automatically terminate your+rights under this License. However, parties who have received copies,+or rights, from you under this License will not have their licenses+terminated so long as such parties remain in full compliance.++ 9. You are not required to accept this License, since you have not+signed it. However, nothing else grants you permission to modify or+distribute the Library or its derivative works. These actions are+prohibited by law if you do not accept this License. Therefore, by+modifying or distributing the Library (or any work based on the+Library), you indicate your acceptance of this License to do so, and+all its terms and conditions for copying, distributing or modifying+the Library or works based on it.++ 10. Each time you redistribute the Library (or any work based on the+Library), the recipient automatically receives a license from the+original licensor to copy, distribute, link with or modify the Library+subject to these terms and conditions. You may not impose any further+restrictions on the recipients' exercise of the rights granted herein.+You are not responsible for enforcing compliance by third parties with+this License.++ 11. If, as a consequence of a court judgment or allegation of patent+infringement or for any other reason (not limited to patent issues),+conditions are imposed on you (whether by court order, agreement or+otherwise) that contradict the conditions of this License, they do not+excuse you from the conditions of this License. If you cannot+distribute so as to satisfy simultaneously your obligations under this+License and any other pertinent obligations, then as a consequence you+may not distribute the Library at all. For example, if a patent+license would not permit royalty-free redistribution of the Library by+all those who receive copies directly or indirectly through you, then+the only way you could satisfy both it and this License would be to+refrain entirely from distribution of the Library.++If any portion of this section is held invalid or unenforceable under any+particular circumstance, the balance of the section is intended to apply,+and the section as a whole is intended to apply in other circumstances.++It is not the purpose of this section to induce you to infringe any+patents or other property right claims or to contest validity of any+such claims; this section has the sole purpose of protecting the+integrity of the free software distribution system which is+implemented by public license practices. Many people have made+generous contributions to the wide range of software distributed+through that system in reliance on consistent application of that+system; it is up to the author/donor to decide if he or she is willing+to distribute software through any other system and a licensee cannot+impose that choice.++This section is intended to make thoroughly clear what is believed to+be a consequence of the rest of this License.++ 12. If the distribution and/or use of the Library is restricted in+certain countries either by patents or by copyrighted interfaces, the+original copyright holder who places the Library under this License may add+an explicit geographical distribution limitation excluding those countries,+so that distribution is permitted only in or among countries not thus+excluded. In such case, this License incorporates the limitation as if+written in the body of this License.++ 13. The Free Software Foundation may publish revised and/or new+versions of the Lesser General Public License from time to time.+Such new versions will be similar in spirit to the present version,+but may differ in detail to address new problems or concerns.++Each version is given a distinguishing version number. If the Library+specifies a version number of this License which applies to it and+"any later version", you have the option of following the terms and+conditions either of that version or of any later version published by+the Free Software Foundation. If the Library does not specify a+license version number, you may choose any version ever published by+the Free Software Foundation.++ 14. If you wish to incorporate parts of the Library into other free+programs whose distribution conditions are incompatible with these,+write to the author to ask for permission. For software which is+copyrighted by the Free Software Foundation, write to the Free+Software Foundation; we sometimes make exceptions for this. Our+decision will be guided by the two goals of preserving the free status+of all derivatives of our free software and of promoting the sharing+and reuse of software generally.++ NO WARRANTY++ 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE+LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.++ 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH+DAMAGES.++ END OF TERMS AND CONDITIONS++ How to Apply These Terms to Your New Libraries++ If you develop a new library, and you want it to be of the greatest+possible use to the public, we recommend making it free software that+everyone can redistribute and change. You can do so by permitting+redistribution under these terms (or, alternatively, under the terms of the+ordinary General Public License).++ To apply these terms, attach the following notices to the library. It is+safest to attach them to the start of each source file to most effectively+convey the exclusion of warranty; and each file should have at least the+"copyright" line and a pointer to where the full notice is found.++ <one line to give the library's name and a brief idea of what it does.>+ Copyright (C) <year> <name of author>++ This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.++ This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.++ You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++Also add information on how to contact you by electronic and paper mail.++You should also get your employer (if you work as a programmer) or your+school, if any, to sign a "copyright disclaimer" for the library, if+necessary. Here is a sample; alter the names:++ Yoyodyne, Inc., hereby disclaims all copyright interest in the+ library `Frob' (a library for tweaking knobs) written by James Random Hacker.++ <signature of Ty Coon>, 1 April 1990+ Ty Coon, President of Vice++That's all there is to it!++
+ libdiscid/README view
@@ -0,0 +1,28 @@+A Library for creating MusicBrainz DiscIDs+------------------------------------------++libdiscid is a library for creating MusicBrainz DiscIDs from audio CDs.+It reads a CD's table of contents (TOC) and generates an identifier which+can be used to lookup the CD at MusicBrainz (http://musicbrainz.org).+Additionally, it provides a submission URL for adding the DiscID to the+database.++The interface of this library is new, but the DiscID algorithm and the+operating system dependent CD-ROM/DVD-ROM access code have been ported+from libmusicbrainz version 2. +++Please report all bugs you find via the MusicBrainz bug tracker.+Don't forget to state which OS and what version you are using:++ http://tickets.musicbrainz.org/browse/LIB++Questions about this package may be posted to the MusicBrainz+development mailing list (mb-devel):++ http://musicbrainz.org/doc/Communication/Mailing_Lists++More information can be found at the package's official homepage:++ http://musicbrainz.org/doc/libdiscid+
+ libdiscid/include/config.h view
@@ -0,0 +1,84 @@+/* config.h. Generated from config.h.in by configure. */+/* config.h.in. Generated from configure.ac by autoheader. */++/* Define if building universal (internal helper macro) */+/* #undef AC_APPLE_UNIVERSAL_BUILD */++/* Define to 1 if you have the <dlfcn.h> header file. */+#define HAVE_DLFCN_H 1++/* Define to 1 if you have the <inttypes.h> header file. */+#define HAVE_INTTYPES_H 1++/* Define to 1 if you have the <memory.h> header file. */+#define HAVE_MEMORY_H 1++/* Define to 1 if you have the <stdint.h> header file. */+#define HAVE_STDINT_H 1++/* Define to 1 if you have the <stdlib.h> header file. */+#define HAVE_STDLIB_H 1++/* Define to 1 if you have the <strings.h> header file. */+#define HAVE_STRINGS_H 1++/* Define to 1 if you have the <string.h> header file. */+#define HAVE_STRING_H 1++/* Define to 1 if you have the <sys/stat.h> header file. */+#define HAVE_SYS_STAT_H 1++/* Define to 1 if you have the <sys/types.h> header file. */+#define HAVE_SYS_TYPES_H 1++/* Define to 1 if you have the <unistd.h> header file. */+#define HAVE_UNISTD_H 1++/* Define to the sub-directory in which libtool stores uninstalled libraries.+ */+#define LT_OBJDIR ".libs/"++/* Name of package */+#define PACKAGE "libdiscid"++/* Define to the address where bug reports for this package should be sent. */+#define PACKAGE_BUGREPORT ""++/* Define to the full name of this package. */+#define PACKAGE_NAME "libdiscid"++/* Define to the full name and version of this package. */+#define PACKAGE_STRING "libdiscid 0.4.1"++/* Define to the one symbol short name of this package. */+#define PACKAGE_TARNAME "libdiscid"++/* Define to the home page for this package. */+#define PACKAGE_URL ""++/* Define to the version of this package. */+#define PACKAGE_VERSION "0.4.1"++/* The size of `long', as computed by sizeof. */+#define SIZEOF_LONG 8++/* Define to 1 if you have the ANSI C header files. */+#define STDC_HEADERS 1++/* Version number of package */+#define VERSION "0.4.1"++/* Define WORDS_BIGENDIAN to 1 if your processor stores words with the most+ significant byte first (like Motorola and SPARC, unlike Intel). */+#if defined AC_APPLE_UNIVERSAL_BUILD+# if defined __BIG_ENDIAN__+# define WORDS_BIGENDIAN 1+# endif+#else+# ifndef WORDS_BIGENDIAN+/* # undef WORDS_BIGENDIAN */+# endif+#endif++/* "the header is used to create the library" */+#define libdiscid_EXPORTS /**/
+ libdiscid/include/discid/discid.h view
@@ -0,0 +1,363 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2013 Johannes Dewender+ Copyright (C) 2006-2010 Lukas Lalinsky+ Copyright (C) 2006 Matthias Friedrich+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++--------------------------------------------------------------------------- */+#ifndef MUSICBRAINZ_DISC_ID_H+#define MUSICBRAINZ_DISC_ID_H++#if (defined(_WIN32) || defined(_WIN64))+# ifdef libdiscid_EXPORTS+# define LIBDISCID_API __declspec(dllexport)+# else+# define LIBDISCID_API __declspec(dllimport)+# endif+#else+# define LIBDISCID_API+#endif++++#ifdef __cplusplus+ extern "C" {+#endif++/*!+ * \mainpage libdiscid+ * \section intro Introduction+ *+ * Libdiscid is a C library for calculating DiscIDs+ * (<a href="http://musicbrainz.org/doc/Disc ID">MusicBrainz</a>+ * and <a href="http://freedb.org">freedb</a>)+ * for Audio CDs.+ * Additionally the library can extract the MCN/UPC/EAN and the+ * <a href="http://musicbrainz.org/doc/ISRC">ISRCs</a> from disc.+ *+ * The idea is to have an easy to use library without any dependencies+ * that can be used from scripting languages.+ *+ * The API is documented in discid.h.+ *+ * \section examples Examples+ *+ * This is an example of the most basic usage:+ *+ * \code+ *+ * DiscId *disc = discid_new();+ *+ * if ( discid_read(disc, "/dev/cdrom") == 0 ) {+ * fprintf(stderr, "Error: %s\n", discid_get_error_msg(disc));+ * return 1;+ * }+ * + * printf("DiscID : %s\n", discid_get_id(disc));+ * printf("Submit via : %s\n", discid_get_submission_url(disc));+ *+ * discid_free(disc); + *+ * \endcode+ *+ * \section Building+ *+ * libdiscid provides a pkg-config script that returns the necessary compiler and linker flags, as well as the+ * version number. To build a small sample program one would use:+ *+ * @par+ * <tt>gcc libdiscid-test.c \`pkg-config libdiscid --cflags --libs\` -o libdiscid-test</tt>+ *+ * \section Contact+ *+ * - <a href="http://lists.musicbrainz.org/mailman/listinfo/musicbrainz-devel">MusicBrainz Development Mailing List</a>+ * - <a href="http://tickets.musicbrainz.org/browse/LIB">MusicBrainz Bug Tracker</a>+ * - <a href="http://musicbrainz.org/doc/libdiscid">MusicBrainz Documentation</a>+ * - <a href="https://github.com/metabrainz/libdiscid">Github Repository</a>+ *+ */ +++/**+ * A transparent handle for an Audio CD.+ *+ * This is returned by discid_new() and has to be passed as the first+ * parameter to all discid_*() functions.+ */+typedef void *DiscId;+++/**+ * Return a handle for a new DiscId object.+ *+ * If no memory could be allocated, NULL is returned. Don't use the created+ * DiscId object before calling discid_read() or discid_put().+ *+ * @return a DiscId object, or NULL.+ */+LIBDISCID_API DiscId *discid_new();+++/**+ * Release the memory allocated for the DiscId object.+ *+ * @param d a DiscId object created by discid_new()+ */+LIBDISCID_API void discid_free(DiscId *d);+++/**+ * Read the disc in the given CD-ROM/DVD-ROM drive.+ *+ * This function reads the disc in the drive specified by the given device+ * identifier. If the device is NULL, the default drive, as returned by+ * discid_get_default_device() is used.+ *+ * On error, this function returns false and sets the error message which you+ * can access using discid_get_error_msg(). In this case, the other functions+ * won't return meaningful values and should not be used.+ *+ * This function may be used multiple times with the same DiscId object.+ *+ * @param d a DiscId object created by discid_new()+ * @param device an operating system dependent device identifier, or NULL+ * @return true if successful, or false on error.+ */+LIBDISCID_API int discid_read(DiscId *d, const char *device);+++/**+ * Provides the TOC of a known CD.+ *+ * This function may be used if the TOC has been read earlier and you+ * want to calculate the disc ID afterwards, without accessing the disc+ * drive. It replaces the discid_read function in this case.+ *+ * On error, this function returns false and sets the error message which you+ * can access using discid_get_error_msg(). In this case, the other functions+ * won't return meaningful values and should not be used.+ *+ * The offsets parameter points to an array which contains the track offsets+ * for each track. The first element, offsets[0], is the leadout track. It+ * must contain the total number of sectors on the disc.+ *+ * @param d a DiscID object created by discid_new()+ * @param first the number of the first audio track on disc (usually one)+ * @param last the number of the last audio track on the disc+ * @param offsets a pointer to an array of 100 track offsets+ * @return true if the given data was valid, and false on error+ */+LIBDISCID_API int discid_put(DiscId *d, int first, int last, int *offsets);+++/**+ * Return a human-readable error message.+ *+ * This function may only be used if discid_read() failed. The returned+ * error message is only valid as long as the DiscId object exists.+ *+ * @param d a DiscId object created by discid_new()+ * @return a string describing the error that occurred+ */+LIBDISCID_API char *discid_get_error_msg(DiscId *d);+++/**+ * Return a MusicBrainz DiscID.+ *+ * The returned string is only valid as long as the DiscId object exists.+ *+ * @param d a DiscId object created by discid_new()+ * @return a string containing a MusicBrainz DiscID+ */+LIBDISCID_API char *discid_get_id(DiscId *d);+++/**+ * Return a FreeDB DiscID.+ *+ * The returned string is only valid as long as the DiscId object exists.+ *+ * @param d a DiscId object created by discid_new()+ * @return a string containing a FreeDB DiscID+ */+LIBDISCID_API char *discid_get_freedb_id(DiscId *d);+++/**+ * Return an URL for submitting the DiscID to MusicBrainz.+ *+ * The URL leads to an interactive disc submission wizard that guides the+ * user through the process of associating this disc's DiscID with a+ * release in the MusicBrainz database.+ *+ * The returned string is only valid as long as the DiscId object exists.+ *+ * @param d a DiscId object created by discid_new()+ * @return a string containing an URL+ */+LIBDISCID_API char *discid_get_submission_url(DiscId *d);++/**+ * Return an URL for retrieving CD information from MusicBrainz' web service+ *+ * The URL provides the CD information in XML. + * See http://musicbrainz.org/development/mmd for details.+ *+ * The returned string is only valid as long as the DiscId object exists.+ *+ * @param d a DiscId object created by discid_new()+ * @return a string containing an URL+ */+LIBDISCID_API char *discid_get_webservice_url(DiscId *d);++/**+ * Return the name of the default disc drive for this operating system.+ *+ * @return a string containing an operating system dependent device identifier+ */+LIBDISCID_API char *discid_get_default_device(void);+++/**+ * Return the number of the first track on this disc.+ *+ * @param d a DiscId object created by discid_new()+ * @return the number of the first track+ */+LIBDISCID_API int discid_get_first_track_num(DiscId *d);+++/**+ * Return the number of the last track on this disc.+ *+ * @param d a DiscId object created by discid_new()+ * @return the number of the last track+ */+LIBDISCID_API int discid_get_last_track_num(DiscId *d);+++/**+ * Return the length of the disc in sectors.+ *+ * @param d a DiscId object created by discid_new()+ * @return the length of the disc in sectors+ */+LIBDISCID_API int discid_get_sectors(DiscId *d);+++/**+ * Return the sector offset of a track.+ *+ * Only track numbers between (and including) discid_get_first_track_num()+ * and discid_get_last_track_num() may be used.+ *+ * @param d a DiscId object created by discid_new()+ * @param track_num the number of a track+ * @return sector offset of the specified track+ */+LIBDISCID_API int discid_get_track_offset(DiscId *d, int track_num);+++/**+ * Return the length of a track in sectors.+ *+ * Only track numbers between (and including) discid_get_first_track_num()+ * and discid_get_last_track_num() may be used.+ *+ * @param d a DiscId object created by discid_new()+ * @param track_num the number of a track+ * @return length of the specified track+ */+LIBDISCID_API int discid_get_track_length(DiscId *d, int track_num);++/**+ * Return the Media Catalogue Number for the disc.+ *+ * @param d a DiscId object created by discid_new()+ * @return a string containing an Media Catalogue Number of the disk+ */+LIBDISCID_API char* discid_get_mcn(DiscId *d);++/**+ * Return the ISRC for a track.+ *+ * Only track numbers between (and including) discid_get_first_track_num()+ * and discid_get_last_track_num() may be used.+ *+ * @param d a DiscId object created by discid_new()+ * @param track_num the number of a track+ * @return a string containing an ISRC for the specified track+ */+LIBDISCID_API char* discid_get_track_isrc(DiscId *d, int track_num);+++/**+ * PLATFORM-DEPENDENT FEATURES+ *+ * The platform dependent features are currently:+ * - "read" read TOC from disc+ * - "mcn" read MCN from disc+ * - "isrc" read ISRC from disc+ *+ * You can use get_feature_list() or has_feature() below.+ */++enum discid_feature {+ DISCID_FEATURE_READ = 1 << 0,+ DISCID_FEATURE_MCN = 1 << 1,+ DISCID_FEATURE_ISRC = 1 << 2,+};+/**+ * Check if a certain feature is implemented on the current platform.+ *+ * @return 1 if the feature is implemented and 0 if not.+ */+LIBDISCID_API int discid_has_feature(enum discid_feature feature);++#define DISCID_FEATURE_STR_READ "read"+#define DISCID_FEATURE_STR_MCN "mcn"+#define DISCID_FEATURE_STR_ISRC "isrc"+#define DISCID_FEATURE_LENGTH 32+/**+ * Return a list of features supported by the current platform.+ * The array of length DISCID_FEATURES_LENGTH should be allocated by the user.+ * After the call each element of the array is either NULL+ * or a pointer to a static string.+ *+ * @return an array of supported features (as strings)+ */+LIBDISCID_API void discid_get_feature_list(+ char *features[DISCID_FEATURE_LENGTH]);++/**+ * Return the full version string of this library, including the name.+ * This can be used for debug output.+ * Don't use this to test for features, see discid_has_feature().+ *+ * @return a string containing the version of libdiscid.+ */+LIBDISCID_API char *discid_get_version_string(void);+++#ifdef __cplusplus+ }+#endif++#endif /* MUSICBRAINZ_DISC_ID_H */
+ libdiscid/include/discid/discid_private.h view
@@ -0,0 +1,107 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2006 Matthias Friedrich+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++ $Id$++--------------------------------------------------------------------------- */+/*+ * For internal use only. This header file is not installed.+ */+#ifndef MUSICBRAINZ_DISC_ID_PRIVATE_H+#define MUSICBRAINZ_DISC_ID_PRIVATE_H++#include "discid.h"+++/* Length of a MusicBrainz DiscID in bytes (without a trailing '\0'-byte). */+#define MB_DISC_ID_LENGTH 32++/* Length of a FreeDB DiscID in bytes (without a trailing '\0'-byte). */+#define FREEDB_DISC_ID_LENGTH 8++/* The maximum permitted length for an error message (without the '\0'-byte). */+#define MB_ERROR_MSG_LENGTH 255++/* URL prefix + 100 tracks, 5 bytes each + 32 bytes discid */+#define MB_MAX_URL_LENGTH 1023++/* The URL that can be used for submitting DiscIDs (no parameters yet) */+#define MB_SUBMISSION_URL "http://mm.musicbrainz.org/bare/cdlookup.html"++/* The URL that can be used for retrieving XML for a CD */+#define MB_WEBSERVICE_URL "http://mm.musicbrainz.org/ws/1/release"++/* Maximum length of a Media Catalogue Number string */+#define MCN_STR_LENGTH 13++/* Maximum length of a ISRC code string */+#define ISRC_STR_LENGTH 12++/*+ * This data structure represents an audio disc.+ *+ * We use fixed length strings here because that way the user doesn't have to+ * check for memory exhaustion conditions. As soon as the mb_disc object has+ * been created, all calls returning strings will be successful.+ */+typedef struct {+ int first_track_num;+ int last_track_num;+ int track_offsets[100];+ char id[MB_DISC_ID_LENGTH+1];+ char freedb_id[FREEDB_DISC_ID_LENGTH+1];+ char submission_url[MB_MAX_URL_LENGTH+1];+ char webservice_url[MB_MAX_URL_LENGTH+1];+ char error_msg[MB_ERROR_MSG_LENGTH+1];+ char isrc[100][ISRC_STR_LENGTH+1];+ char mcn[MCN_STR_LENGTH+1];+ int success;+} mb_disc_private;+++/*+ * This function has to be implemented once per operating system.+ *+ * The caller guarantees that both the disc and device parameters are+ * not NULL.+ *+ * Implementors have to set mb_disc_private's first_track_num, last_track_num,+ * and track_offsets attributes. If there is an error, the error_msg attribute+ * has to be set to a human-readable error message.+ *+ * On error, 0 is returned. On success, 1 is returned.+ */+int mb_disc_read_unportable(mb_disc_private *disc, const char *device);+++/*+ * This should return the name of the default/preferred CDROM/DVD device + * on this operating system. It has to be in a format usable for the second+ * parameter of mb_disc_read_unportable().+ */+char *mb_disc_get_default_device_unportable(void);++/*+ * This should return 1 if the feature is supported by the platform+ * and 0 if not.+ */+int mb_disc_has_feature_unportable(enum discid_feature feature);++#endif /* MUSICBRAINZ_DISC_ID_PRIVATE_H */
+ libdiscid/src/base64.c view
@@ -0,0 +1,110 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2000 Robert Kaye+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++ $Id$++----------------------------------------------------------------------------*/+/*+ * Program: RFC-822 routines (originally from SMTP)+ *+ * Author: Mark Crispin+ * Networks and Distributed Computing+ * Computing & Communications+ * University of Washington+ * Administration Building, AG-44+ * Seattle, WA 98195+ * Internet: MRC@CAC.Washington.EDU+ *+ * Date: 27 July 1988+ * Last Edited: 10 September 1998+ *+ * Sponsorship: The original version of this work was developed in the+ * Symbolic Systems Resources Group of the Knowledge Systems+ * Laboratory at Stanford University in 1987-88, and was funded+ * by the Biomedical Research Technology Program of the National+ * Institutes of Health under grant number RR-00785.+ *+ * Original version Copyright 1988 by The Leland Stanford Junior University+ * Copyright 1998 by the University of Washington+ *+ * Permission to use, copy, modify, and distribute this software and its+ * documentation for any purpose and without fee is hereby granted, provided+ * that the above copyright notices appear in all copies and that both the+ * above copyright notices and this permission notice appear in supporting+ * documentation, and that the name of the University of Washington or The+ * Leland Stanford Junior University not be used in advertising or publicity+ * pertaining to distribution of the software without specific, written prior+ * permission. This software is made available "as is", and+ * THE UNIVERSITY OF WASHINGTON AND THE LELAND STANFORD JUNIOR UNIVERSITY+ * DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED, WITH REGARD TO THIS SOFTWARE,+ * INCLUDING WITHOUT LIMITATION ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND+ * FITNESS FOR A PARTICULAR PURPOSE, AND IN NO EVENT SHALL THE UNIVERSITY OF+ * WASHINGTON OR THE LELAND STANFORD JUNIOR UNIVERSITY BE LIABLE FOR ANY+ * SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER+ * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF+ * CONTRACT, TORT (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF+ * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.+ *+ */++#include <ctype.h>+#include <stdio.h>+#include <time.h>+#include <stdlib.h>+++/* NOTE: This is not true RFC822 anymore. The use of the characters+ '/', '+', and '=' is no bueno when the ID will be used as part of a URL.+ '_', '.', and '-' have been used instead+*/++/* Convert binary contents to BASE64+ * Accepts: source+ * length of source+ * pointer to return destination length+ * Returns: destination as BASE64+ */++unsigned char *rfc822_binary (void *src,unsigned long srcl,unsigned long *len)+{+ unsigned char *ret,*d;+ unsigned char *s = (unsigned char *) src;+ char *v = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789._";+ unsigned long i = ((srcl + 2) / 3) * 4;+ *len = i += 2 * ((i / 60) + 1);+ d = ret = (unsigned char *) malloc ((size_t) ++i);+ for (i = 0; srcl; s += 3) { /* process tuplets */+ *d++ = v[s[0] >> 2]; /* byte 1: high 6 bits (1) */+ /* byte 2: low 2 bits (1), high 4 bits (2) */+ *d++ = v[((s[0] << 4) + (--srcl ? (s[1] >> 4) : 0)) & 0x3f];+ /* byte 3: low 4 bits (2), high 2 bits (3) */+ *d++ = srcl ? v[((s[1] << 2) + (--srcl ? (s[2] >> 6) : 0)) & 0x3f] : '-';+ /* byte 4: low 6 bits (3) */+ *d++ = srcl ? v[s[2] & 0x3f] : '-';+ if (srcl) srcl--; /* count third character if processed */+ if ((++i) == 15) { /* output 60 characters? */+ i = 0; /* restart line break count, insert CRLF */+ *d++ = '\015'; *d++ = '\012';+ }+ }+ *d = '\0'; /* tie off string */++ return ret; /* return the resulting string */+}
+ libdiscid/src/base64.h view
@@ -0,0 +1,72 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2000 Robert Kaye+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++ $Id$++----------------------------------------------------------------------------*/+/*+ * Program: RFC-822 routines (originally from SMTP)+ *+ * Author: Mark Crispin+ * Networks and Distributed Computing+ * Computing & Communications+ * University of Washington+ * Administration Building, AG-44+ * Seattle, WA 98195+ * Internet: MRC@CAC.Washington.EDU+ *+ * Date: 27 July 1988+ * Last Edited: 10 September 1998+ *+ * Sponsorship: The original version of this work was developed in the+ * Symbolic Systems Resources Group of the Knowledge Systems+ * Laboratory at Stanford University in 1987-88, and was funded+ * by the Biomedical Research Technology Program of the National+ * Institutes of Health under grant number RR-00785.+ *+ * Original version Copyright 1988 by The Leland Stanford Junior University+ * Copyright 1998 by the University of Washington+ *+ * Permission to use, copy, modify, and distribute this software and its+ * documentation for any purpose and without fee is hereby granted, provided+ * that the above copyright notices appear in all copies and that both the+ * above copyright notices and this permission notice appear in supporting+ * documentation, and that the name of the University of Washington or The+ * Leland Stanford Junior University not be used in advertising or publicity+ * pertaining to distribution of the software without specific, written prior+ * permission. This software is made available "as is", and+ * THE UNIVERSITY OF WASHINGTON AND THE LELAND STANFORD JUNIOR UNIVERSITY+ * DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED, WITH REGARD TO THIS SOFTWARE,+ * INCLUDING WITHOUT LIMITATION ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND+ * FITNESS FOR A PARTICULAR PURPOSE, AND IN NO EVENT SHALL THE UNIVERSITY OF+ * WASHINGTON OR THE LELAND STANFORD JUNIOR UNIVERSITY BE LIABLE FOR ANY+ * SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER+ * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF+ * CONTRACT, TORT (INCLUDING NEGLIGENCE) OR STRICT LIABILITY, ARISING OUT OF+ * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.+ *+ */++#ifndef BASE64_H+#define BASE64_H++unsigned char *rfc822_binary (void *src,unsigned long srcl,unsigned long *len);++#endif
+ libdiscid/src/disc.c view
@@ -0,0 +1,407 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2006 Matthias Friedrich+ Copyright (C) 2000 Robert Kaye+ Copyright (C) 1999 Marc E E van Woerkom+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++ $Id$++--------------------------------------------------------------------------- */+#include <string.h>+#include <assert.h>++#include "sha1.h"+#include "base64.h"++#include "discid/discid.h"+#include "discid/discid_private.h"+++#define TRACK_NUM_IS_VALID(disc, i) \+ ( i >= disc->first_track_num && i <= disc->last_track_num )+++static void create_disc_id(mb_disc_private *d, char buf[]);+static void create_freedb_disc_id(mb_disc_private *d, char buf[]);+static void create_submission_url(mb_disc_private *d, char buf[]);+static void create_webservice_url(mb_disc_private *d, char buf[]);+++/****************************************************************************+ *+ * Implementation of the public interface.+ *+ ****************************************************************************/++DiscId *discid_new() {+ /* initializes everything to zero */+ return calloc(1, sizeof(mb_disc_private));+}+++void discid_free(DiscId *d) {+ free(d);+}+++char *discid_get_error_msg(DiscId *d) {+ mb_disc_private *disc = (mb_disc_private *) d;+ assert( disc != NULL );++ return disc->error_msg;+}+++char *discid_get_id(DiscId *d) {+ mb_disc_private *disc = (mb_disc_private *) d;+ assert( disc != NULL );+ assert( disc->success );++ if ( ! disc->success )+ return NULL;++ if ( strlen(disc->id) == 0 )+ create_disc_id(disc, disc->id);++ return disc->id;+}+++char *discid_get_freedb_id(DiscId *d) {+ mb_disc_private *disc = (mb_disc_private *) d;+ assert( disc != NULL );+ assert( disc->success );++ if ( ! disc->success )+ return NULL;++ if ( strlen(disc->freedb_id) == 0 )+ create_freedb_disc_id(disc, disc->freedb_id);++ return disc->freedb_id;+}+++char *discid_get_submission_url(DiscId *d) {+ mb_disc_private *disc = (mb_disc_private *) d;+ assert( disc != NULL );+ assert( disc->success );++ if ( ! disc->success )+ return NULL;++ if ( strlen(disc->submission_url) == 0 )+ create_submission_url(disc, disc->submission_url);++ return disc->submission_url;+}++char *discid_get_webservice_url(DiscId *d) {+ mb_disc_private *disc = (mb_disc_private *) d;+ assert( disc != NULL );+ assert( disc->success );++ if ( ! disc->success )+ return NULL;++ if ( strlen(disc->webservice_url) == 0 )+ create_webservice_url(disc, disc->webservice_url);++ return disc->webservice_url;+}++int discid_read(DiscId *d, const char *device) {+ mb_disc_private *disc = (mb_disc_private *) d;++ assert( disc != NULL );++ if ( device == NULL )+ device = discid_get_default_device();++ assert( device != NULL );++ /* Necessary, because the disc handle could have been used before. */+ memset(disc, 0, sizeof(mb_disc_private));++ return disc->success = mb_disc_read_unportable(disc, device);+}+++int discid_put(DiscId *d, int first, int last, int *offsets) {+ mb_disc_private *disc = (mb_disc_private *) d;++ assert( disc != NULL );++ memset(disc, 0, sizeof(mb_disc_private));++ if ( first > last || first < 1 || first > 99 || last < 1+ || last > 99 || offsets==NULL ) {++ sprintf(disc->error_msg, "Illegal parameters");+ return 0;+ }++ disc->first_track_num = first;+ disc->last_track_num = last;++ memcpy(disc->track_offsets, offsets, sizeof(int) * (last+1));++ disc->success = 1;++ return 1;+}+++char *discid_get_default_device(void) {+ return mb_disc_get_default_device_unportable();+}++int discid_get_first_track_num(DiscId *d) {+ mb_disc_private *disc = (mb_disc_private *) d;++ assert( disc != NULL );++ return disc->first_track_num;+}+++int discid_get_last_track_num(DiscId *d) {+ mb_disc_private *disc = (mb_disc_private *) d;++ assert( disc != NULL );++ return disc->last_track_num;+}+++int discid_get_sectors(DiscId *d) {+ mb_disc_private *disc = (mb_disc_private *) d;++ assert( disc != NULL );++ return disc->track_offsets[0];+}+++int discid_get_track_offset(DiscId *d, int i) {+ mb_disc_private *disc = (mb_disc_private *) d;++ assert( disc != NULL );+ assert( TRACK_NUM_IS_VALID(disc, i) );++ if ( ! TRACK_NUM_IS_VALID(disc, i) )+ return 0;++ return disc->track_offsets[i];+}+++int discid_get_track_length(DiscId *d, int i) {+ mb_disc_private *disc = (mb_disc_private *) d;++ assert( disc != NULL );+ assert( TRACK_NUM_IS_VALID(disc, i) );++ if ( ! TRACK_NUM_IS_VALID(disc, i) )+ return 0;++ if ( i < disc->last_track_num )+ return disc->track_offsets[i+1] - disc->track_offsets[i];+ else+ return disc->track_offsets[0] - disc->track_offsets[i];+}++char *discid_get_mcn(DiscId *d) {+ mb_disc_private *disc = (mb_disc_private *) d;++ assert( disc != NULL );++ return disc->mcn;+}++char* discid_get_track_isrc(DiscId *d, int i) {+ mb_disc_private *disc = (mb_disc_private *) d;++ assert( disc != NULL );+ assert( TRACK_NUM_IS_VALID(disc, i) );++ if ( ! TRACK_NUM_IS_VALID(disc, i) || i == 0)+ return NULL;++ return disc->isrc[i];+}++int discid_has_feature(enum discid_feature feature) {+ return mb_disc_has_feature_unportable(feature);+}++void discid_get_feature_list(char *features[DISCID_FEATURE_LENGTH]) {+ int i;++ /* for the code, the parameter is actually only a pointer */+ memset(features, 0, sizeof(char *) * DISCID_FEATURE_LENGTH);+ i = 0;++ if (discid_has_feature(DISCID_FEATURE_READ)) {+ features[i++] = DISCID_FEATURE_STR_READ;+ }+ if (discid_has_feature(DISCID_FEATURE_MCN)) {+ features[i++] = DISCID_FEATURE_STR_MCN;+ }+ if (discid_has_feature(DISCID_FEATURE_ISRC)) {+ features[i++] = DISCID_FEATURE_STR_ISRC;+ }++ return;+}++char *discid_get_version_string(void) {+#ifdef HAVE_CONFIG_H+#include <config.h>+ return PACKAGE_STRING;+#else+ return "";+#endif+}++++/****************************************************************************+ *+ * Private utilities, not exported.+ *+ ****************************************************************************/++/*+ * Create a DiscID based on the TOC data found in the DiscId object.+ * The DiscID is placed in the provided string buffer.+ */+static void create_disc_id(mb_disc_private *d, char buf[]) {+ SHA_INFO sha;+ unsigned char digest[20], *base64;+ unsigned long size;+ char tmp[17]; /* for 8 hex digits (16 to avoid trouble) */+ int i;++ assert( d != NULL );++ sha_init(&sha);++ sprintf(tmp, "%02X", d->first_track_num);+ sha_update(&sha, (unsigned char *) tmp, strlen(tmp));++ sprintf(tmp, "%02X", d->last_track_num);+ sha_update(&sha, (unsigned char *) tmp, strlen(tmp));++ for (i = 0; i < 100; i++) {+ sprintf(tmp, "%08X", d->track_offsets[i]);+ sha_update(&sha, (unsigned char *) tmp, strlen(tmp));+ }++ sha_final(digest, &sha);++ base64 = rfc822_binary(digest, sizeof(digest), &size);++ memcpy(buf, base64, size);+ buf[size] = '\0';++ free(base64);+}+++/*+ * Create a FreeDB DiscID based on the TOC data found in the DiscId object.+ * The DiscID is placed in the provided string buffer.+ */+static void create_freedb_disc_id(mb_disc_private *d, char buf[]) {+ int i, n, m, t;++ assert( d != NULL );++ n = 0;+ for (i = 0; i < d->last_track_num; i++) {+ m = d->track_offsets[i + 1] / 75;+ while (m > 0) {+ n += m % 10;+ m /= 10;+ }+ }+ t = d->track_offsets[0] / 75 - d->track_offsets[1] / 75;+ sprintf(buf, "%08x", ((n % 0xff) << 24 | t << 8 | d->last_track_num));+}+++/*+ * Create a submission URL based on the TOC data found in the mb_disc_private+ * object. The URL is placed in the provided string buffer.+ */+static void create_submission_url(mb_disc_private *d, char buf[]) {+ char tmp[1024];+ int i;++ assert( d != NULL );++ strcpy(buf, MB_SUBMISSION_URL);++ strcat(buf, "?id=");+ strcat(buf, discid_get_id((DiscId *) d));++ sprintf(tmp, "&tracks=%d", d->last_track_num);+ strcat(buf, tmp);++ sprintf(tmp, "&toc=%d+%d+%d",+ d->first_track_num,+ d->last_track_num,+ d->track_offsets[0]);+ strcat(buf, tmp);++ for (i = d->first_track_num; i <= d->last_track_num; i++) {+ sprintf(tmp, "+%d", d->track_offsets[i]);+ strcat(buf, tmp);+ }+}++/*+ * Create a web service URL based on the TOC data found in the mb_disc_private+ * object. The URL is placed in the provided string buffer.+ */+static void create_webservice_url(mb_disc_private *d, char buf[]) {+ char tmp[1024];+ int i;++ assert( d != NULL );++ strcpy(buf, MB_WEBSERVICE_URL);++ strcat(buf, "?type=xml&discid=");+ strcat(buf, discid_get_id((DiscId *) d));++ sprintf(tmp, "&toc=%d+%d+%d",+ d->first_track_num,+ d->last_track_num,+ d->track_offsets[0]);+ strcat(buf, tmp);++ for (i = d->first_track_num; i <= d->last_track_num; i++) {+ sprintf(tmp, "+%d", d->track_offsets[i]);+ strcat(buf, tmp);+ }+}++/* EOF */
+ libdiscid/src/disc_darwin.c view
@@ -0,0 +1,245 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2006 Robert Kaye+ Copyright (C) 1999 Marc E E van Woerkom+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++ $Id: mb_darwin.cpp,v 1.4 2005/10/28 22:05:27 robert Exp $++----------------------------------------------------------------------------*/++#include <stdio.h>+#include <stdlib.h>+#include <string.h>+#include <errno.h>+#include <sys/types.h>+#include <sys/ioctl.h>+#include <sys/stat.h>+#include <unistd.h>+#include <fcntl.h>+#include <assert.h>+#include <paths.h>+#include <IOKit/IOKitLib.h>+#include <IOKit/IOBSD.h>+#include <IOKit/storage/IOCDMedia.h>+#include <IOKit/storage/IOMedia.h>+#include <IOKit/storage/IOCDTypes.h>+#include <IOKit/storage/IOCDMediaBSDClient.h>+#include <IOKit/storage/IOMediaBSDClient.h>++#include <CoreFoundation/CoreFoundation.h>++#include "discid/discid.h"+#include "discid/discid_private.h"++#define TOC_BUFFER_LEN 2048+#define MAXPATHLEN 1024++static char defaultDevice[MAXPATHLEN] = "\0";++static kern_return_t find_ejectable_cd_media( io_iterator_t *mediaIterator )+{+ mach_port_t masterPort;+ kern_return_t kernResult;+ CFMutableDictionaryRef classesToMatch;++ kernResult = IOMasterPort( MACH_PORT_NULL, &masterPort );+ if ( kernResult != KERN_SUCCESS )+ return kernResult;++ // CD media are instances of class kIOCDMediaClass.+ classesToMatch = IOServiceMatching( kIOCDMediaClass );+ if ( classesToMatch != NULL )+ {+ // Each IOMedia object has a property with key kIOMediaEjectableKey+ // which is true if the media is indeed ejectable. So add this+ // property to the CFDictionary for matching.+ CFDictionarySetValue( classesToMatch, CFSTR( kIOMediaEjectableKey ), kCFBooleanTrue );+ }++ return IOServiceGetMatchingServices( masterPort, classesToMatch, mediaIterator );+}++static kern_return_t get_device_file_path( io_iterator_t mediaIterator, char *deviceFilePath, CFIndex maxPathSize )+{+ io_object_t nextMedia;+ kern_return_t kernResult = KERN_FAILURE;+ + *deviceFilePath = '\0';+ nextMedia = IOIteratorNext( mediaIterator );+ if ( nextMedia )+ {+ CFTypeRef deviceFilePathAsCFString;+ deviceFilePathAsCFString = IORegistryEntryCreateCFProperty(+ nextMedia, CFSTR( kIOBSDNameKey ),+ kCFAllocatorDefault, 0 );++ *deviceFilePath = '\0';+ if ( deviceFilePathAsCFString )+ {+ size_t devPathLength;+ strcpy( deviceFilePath, _PATH_DEV );+ // Add "r" before the BSD node name from the I/O Registry+ // to specify the raw disk node. The raw disk node receives+ // I/O requests directly and does not go through the+ // buffer cache.+ strcat( deviceFilePath, "r");+ devPathLength = strlen( deviceFilePath );+ if ( CFStringGetCString( deviceFilePathAsCFString,+ deviceFilePath + devPathLength,+ maxPathSize - devPathLength,+ kCFStringEncodingASCII ) )+ kernResult = KERN_SUCCESS;++ CFRelease( deviceFilePathAsCFString );+ }+ }+ IOObjectRelease( nextMedia );++ return kernResult;+}++static void read_disc_mcn(int fd, mb_disc_private *disc)+{+ dk_cd_read_mcn_t cd_read_mcn;+ bzero(&cd_read_mcn, sizeof(cd_read_mcn));+ + if(ioctl(fd, DKIOCCDREADMCN, &cd_read_mcn) == -1) {+ fprintf(stderr, "Warning: Unable to read the disc's media catalog number.\n");+ } else {+ strncpy( disc->mcn, cd_read_mcn.mcn, MCN_STR_LENGTH );+ }+}++static void read_disc_isrc(int fd, mb_disc_private *disc, int track)+{+ dk_cd_read_isrc_t cd_read_isrc;+ bzero(&cd_read_isrc, sizeof(cd_read_isrc));+ cd_read_isrc.track = track;+ + if(ioctl(fd, DKIOCCDREADISRC, &cd_read_isrc) == -1) {+ fprintf(stderr, "Warning: Unable to read the international standard recording code (ISRC) for track %i\n", track);+ return;+ } else {+ strncpy( disc->isrc[track], cd_read_isrc.isrc, ISRC_STR_LENGTH );+ }+}++int mb_disc_has_feature_unportable(enum discid_feature feature) {+ switch(feature) {+ case DISCID_FEATURE_READ:+ case DISCID_FEATURE_MCN:+ case DISCID_FEATURE_ISRC:+ return 1;+ default:+ return 0;+ }+}+++char *mb_disc_get_default_device_unportable(void) +{+ kern_return_t kernResult;+ io_iterator_t mediaIterator;++ *defaultDevice = 0;++ kernResult = find_ejectable_cd_media( &mediaIterator );+ if ( kernResult != KERN_SUCCESS )+ return "";++ kernResult = get_device_file_path( mediaIterator, defaultDevice, MAXPATHLEN - 1);+ if ( kernResult != KERN_SUCCESS )+ return "";++ return defaultDevice;+}++int mb_disc_read_unportable(mb_disc_private *disc, const char *device) +{+ int fd;+ int i;+ dk_cd_read_toc_t toc;+ CDTOC *cdToc;++ if (device == NULL || *device == 0)+ device = mb_disc_get_default_device_unportable();++ if (!*device)+ {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH, "No CD-ROMs found. Please insert a disc and try again.");+ return 0;+ }+ + fd = open(device, O_RDONLY | O_NONBLOCK);+ if (fd < 0) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH, "Cannot open '%s'", device);+ return 0;+ }+ + memset(&toc, 0, sizeof(toc));+ toc.format = kCDTOCFormatTOC;+ toc.formatAsTime = 0;+ toc.buffer = (char *)malloc(TOC_BUFFER_LEN);+ toc.bufferLength = TOC_BUFFER_LEN;+ if (ioctl(fd, DKIOCCDREADTOC, &toc) < 0 ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH, "Cannot read TOC from '%s'", device);+ free(toc.buffer);+ return 0;+ }+ if ( toc.bufferLength < sizeof(CDTOC) ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH, "Short TOC was returned from '%s'", device);+ free(toc.buffer);+ return 0;+ }++ // Read in the media catalogue number+ read_disc_mcn( fd, disc );+ + cdToc = (CDTOC *)toc.buffer;+ int numDesc = CDTOCGetDescriptorCount(cdToc);+ + int numTracks = 0;+ for(i = 0; i < numDesc; i++)+ {+ CDTOCDescriptor *desc = &cdToc->descriptors[i];+ + if (desc->session > 1)+ continue;+ + if (desc->point == 0xA2 && desc->adr == 1)+ disc->track_offsets[0] = CDConvertMSFToLBA(desc->p) + 150; + + if (desc->point <= 99 && desc->adr == 1) {+ disc->track_offsets[1 + numTracks] = CDConvertMSFToLBA(desc->p) + 150; + + // Read in the IRSC codes for tracks+ read_disc_isrc( fd, disc, 1 + numTracks );+ + numTracks++;+ }+ }+ disc->first_track_num = 1;+ disc->last_track_num = numTracks;+ + + close(fd);+ free(toc.buffer);+ + return 1;+}
+ libdiscid/src/disc_freebsd.c view
@@ -0,0 +1,184 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2008 Patrick Hurrelmann + Copyright (C) 2006 Matthias Friedrich+ Copyright (C) 2000 Robert Kaye+ Copyright (C) 1999 Marc E E van Woerkom+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++ $Id$++--------------------------------------------------------------------------- */+#include <stdlib.h>+#include <stdio.h>+#include <string.h>+#include <fcntl.h>+#include <unistd.h>+#include <assert.h>+#include <sys/types.h>+#include <sys/stat.h>+#include <sys/ioctl.h>+#include <sys/cdio.h>+#include <arpa/inet.h>+++#include "discid/discid.h"+#include "discid/discid_private.h"++#define CD_FRAMES 75 /* per second */+#define CD_DATA_TRACK 0x04+#define CD_LEADOUT 0xAA++#define MB_DEFAULT_DEVICE "/dev/acd0"++#define XA_INTERVAL ((60 + 90 + 2) * CD_FRAMES)+++static int read_toc_header(int fd, int *first, int *last) {+ struct ioc_toc_header th;+ struct ioc_read_toc_single_entry te;++ int ret = ioctl(fd, CDIOREADTOCHEADER, &th);++ if ( ret < 0 )+ return ret; /* error */++ *first = th.starting_track;+ *last = th.ending_track;++ /*+ * Hide the last track if this is a multisession disc. Note that+ * currently only dual-session discs with one track in the second+ * session are handled correctly.+ */+ te.address_format = CD_LBA_FORMAT;+ te.track = th.ending_track;+ ret = ioctl(fd, CDIOREADTOCENTRY, &te);++ if (( te.entry.control & CD_DATA_TRACK) != 0 )+ (*last)--;++ return ret;+}+++static int read_toc_entry(int fd, int track_num, unsigned long *lba) {+ struct ioc_read_toc_single_entry te;+ int ret;++ te.track = track_num;+ te.address_format = CD_LBA_FORMAT;++ ret = ioctl(fd, CDIOREADTOCENTRY, &te);+ assert( te.address_format == CD_LBA_FORMAT );++ if ( ret == 0 )+ *lba = ntohl(te.entry.addr.lba);++ return ret;+}+++static int read_leadout(int fd, unsigned long *lba) {+ struct ioc_toc_header th;+ struct ioc_read_toc_single_entry te;+ int ret;+ + ret = ioctl(fd, CDIOREADTOCHEADER, &th);+ te.track = th.ending_track;+ te.address_format = CD_LBA_FORMAT;+ ret = ioctl(fd, CDIOREADTOCENTRY, &te);++ if (( te.entry.control & CD_DATA_TRACK) != 0 ) {+ *lba = ntohl(te.entry.addr.lba) - 11400;+ return ret;+ }++ return read_toc_entry(fd, CD_LEADOUT, lba);+}+++char *mb_disc_get_default_device_unportable(void) {+ return MB_DEFAULT_DEVICE;+}++int mb_disc_has_feature_unportable(enum discid_feature feature) {+ switch(feature) {+ case DISCID_FEATURE_READ:+ return 1;+ default:+ return 0;+ }+}+++int mb_disc_read_unportable(mb_disc_private *disc, const char *device) {+ int fd;+ unsigned long lba;+ int first, last;+ int i;++ if ( (fd = open(device, O_RDONLY | O_NONBLOCK)) < 0 ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "cannot open device `%s'", device);+ return 0;+ }++ /*+ * Find the numbers of the first track (usually 1) and the last track.+ */+ if ( read_toc_header(fd, &first, &last) < 0 ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "cannot read table of contents");+ close(fd);+ return 0;+ }++ /* basic error checking */+ if ( last == 0 ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "this disc has no tracks");+ close(fd);+ return 0;+ }++ disc->first_track_num = first;+ disc->last_track_num = last;++ /*+ * Get the logical block address (lba) for the end of the audio data.+ * The "LEADOUT" track is the track beyond the final audio track, so+ * we're looking for the block address of the LEADOUT track.+ */+ read_leadout(fd, &lba);+ disc->track_offsets[0] = lba + 150;++ /*+ * Now, for every track, find out the block address where it starts.+ */+ for (i = first; i <= last; i++) {+ read_toc_entry(fd, i, &lba);+ disc->track_offsets[i] = lba + 150;+ }++ close(fd);++ return 1;+}++/* EOF */
+ libdiscid/src/disc_generic.c view
@@ -0,0 +1,43 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2013 Johannes Dewender+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++--------------------------------------------------------------------------- */+#include <stdio.h>++#include "discid/discid.h"+#include "discid/discid_private.h"+++char *mb_disc_get_default_device_unportable(void) {+ return "";+}+++int mb_disc_has_feature_unportable(enum discid_feature feature) {+ return 0;+}++int mb_disc_read_unportable(mb_disc_private *disc, const char *device) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "disc reading not implemented on this platform");+ return 0;+}++/* EOF */
+ libdiscid/src/disc_linux.c view
@@ -0,0 +1,277 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2013 Johannes Dewender+ Copyright (C) 2006 Matthias Friedrich+ Copyright (C) 2000 Robert Kaye+ Copyright (C) 1999 Marc E E van Woerkom+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++ $Id$++--------------------------------------------------------------------------- */+#include <stdlib.h>+#include <stdio.h>+#include <string.h>+#include <fcntl.h>+#include <assert.h>+#include <errno.h>+#include <unistd.h>+#include <sys/types.h>+#include <sys/stat.h>+#include <sys/ioctl.h>+#include <linux/cdrom.h>+#include <scsi/sg.h>+++#include "discid/discid.h"+#include "discid/discid_private.h"+++#define MB_DEFAULT_DEVICE "/dev/cdrom"++#define XA_INTERVAL ((60 + 90 + 2) * CD_FRAMES)++/* timeout better shouldn't happen for scsi commands -> device is reset */+#define DEFAULT_TIMEOUT 30000 /* in ms */++#ifndef SG_MAX_SENSE+#define SG_MAX_SENSE 16+#endif+++static int read_toc_header(int fd, int *first, int *last) {+ struct cdrom_tochdr th;+ struct cdrom_multisession ms;++ int ret = ioctl(fd, CDROMREADTOCHDR, &th);++ if ( ret < 0 )+ return ret; /* error */++ *first = th.cdth_trk0;+ *last = th.cdth_trk1;++ /*+ * Hide the last track if this is a multisession disc. Note that+ * currently only dual-session discs with one track in the second+ * session are handled correctly.+ */+ ms.addr_format = CDROM_LBA;+ ret = ioctl(fd, CDROMMULTISESSION, &ms);++ if ( ms.xa_flag )+ (*last)--;++ return ret;+}+++static int read_toc_entry(int fd, int track_num, unsigned long *lba) {+ struct cdrom_tocentry te;+ int ret;++ te.cdte_track = track_num;+ te.cdte_format = CDROM_LBA;++ ret = ioctl(fd, CDROMREADTOCENTRY, &te);+ assert( te.cdte_format == CDROM_LBA );++ /* in case the ioctl() was successful */+ if ( ret == 0 )+ *lba = te.cdte_addr.lba;++ return ret;+}+++static int read_leadout(int fd, unsigned long *lba) {+ struct cdrom_multisession ms;+ int ret;++ ms.addr_format = CDROM_LBA;+ ret = ioctl(fd, CDROMMULTISESSION, &ms);++ if ( ms.xa_flag ) {+ *lba = ms.addr.lba - XA_INTERVAL;+ return ret;+ }++ return read_toc_entry(fd, CDROM_LEADOUT, lba);+}+++char *mb_disc_get_default_device_unportable(void) {+ return MB_DEFAULT_DEVICE;+}++static void read_disc_mcn(int fd, mb_disc_private *disc)+{+ struct cdrom_mcn mcn;++ if(ioctl(fd, CDROM_GET_MCN, &mcn) == -1) {+ fprintf(stderr, "Warning: Unable to read the disc's media catalog number.\n");+ } else {+ strncpy( disc->mcn,+ (const char *)mcn.medium_catalog_number,+ MCN_STR_LENGTH );+ }+}++/* Send a scsi command and receive data. */+static int scsi_cmd(int fd, unsigned char *cmd, int cmd_len,+ unsigned char *data, int data_len) {+ unsigned char sense_buffer[SG_MAX_SENSE]; /* for "error situations" */+ sg_io_hdr_t io_hdr;++ memset(&io_hdr, 0, sizeof io_hdr);++ assert(cmd_len <= 16);++ io_hdr.interface_id = 'S'; /* must always be 'S' (SCSI generic) */+ io_hdr.cmd_len = cmd_len;+ io_hdr.cmdp = cmd;+ io_hdr.timeout = DEFAULT_TIMEOUT; /* timeout in ms */+ io_hdr.sbp = sense_buffer;/* only used when status is CHECK_CONDITION */+ io_hdr.mx_sb_len = sizeof sense_buffer;+ io_hdr.flags = SG_FLAG_DIRECT_IO;++ io_hdr.dxferp = (void*)data;+ io_hdr.dxfer_len = data_len;+ io_hdr.dxfer_direction = SG_DXFER_FROM_DEV;++ if (ioctl(fd, SG_IO, &io_hdr) != 0) {+ return errno;+ } else {+ return io_hdr.status; /* 0 = success */+ }+}++static void read_track_isrc(int fd, mb_disc_private *disc, int track_num) {+ int i;+ unsigned char cmd[10];+ unsigned char data[24];+ char buffer[ISRC_STR_LENGTH+1];++ memset(cmd, 0, sizeof cmd);+ memset(data, 0, sizeof data);+ memset(buffer, 0, sizeof buffer);++ /* data read from the last appropriate sector encountered+ * by a current or previous media access operation.+ * The Logical Unit accesses the media when there is/was no access.+ * TODO: force access at a specific block? -> no duplicate ISRCs?+ */+ cmd[0] = 0x42; /* READ SUB-CHANNEL */+ /* cmd[1] reserved / MSF bit (unused) */+ cmd[2] = 1 << 6; /* 6th bit set (SUBQ) -> get sub-channel data */+ cmd[3] = 0x03; /* get ISRC (ADR 3, Q sub-channel Mode-3) */+ /* 4+5 reserved */+ cmd[6] = track_num;+ /* cmd[7] = upper byte of the transfer length */+ cmd[8] = sizeof data; /* transfer length in bytes (4 header, 20 data)*/+ /* cmd[9] = control byte */++ if (scsi_cmd(fd, cmd, sizeof cmd, data, sizeof data) != 0) {+ fprintf(stderr, "Warning: Cannot get ISRC code for track %d\n",+ track_num);+ return;+ }++ /* data[1:4] = sub-q channel data header (audio status, data length) */+ if (data[8] & (1 << 7)) { /* TCVAL is set -> ISRCs valid */+ for (i = 0; i < ISRC_STR_LENGTH; i++) {+ buffer[i] = data[9 + i];+ }+ buffer[ISRC_STR_LENGTH] = 0;+ strncpy(disc->isrc[track_num], buffer, ISRC_STR_LENGTH);+ }+ /* data[21:23] = zero, AFRAME, reserved */++}++int mb_disc_has_feature_unportable(enum discid_feature feature) {+ switch(feature) {+ case DISCID_FEATURE_READ:+ case DISCID_FEATURE_MCN:+ case DISCID_FEATURE_ISRC:+ return 1;+ default:+ return 0;+ }+}+++int mb_disc_read_unportable(mb_disc_private *disc, const char *device) {+ int fd;+ unsigned long lba;+ int first, last;+ int i;++ if ( (fd = open(device, O_RDONLY | O_NONBLOCK)) < 0 ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "cannot open device `%s'", device);+ return 0;+ }++ /*+ * Find the numbers of the first track (usually 1) and the last track.+ */+ if ( read_toc_header(fd, &first, &last) < 0 ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "cannot read table of contents");+ close(fd);+ return 0;+ }++ /* basic error checking */+ if ( last == 0 ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "this disc has no tracks");+ close(fd);+ return 0;+ }++ /* Read in the media catalog number */+ read_disc_mcn( fd, disc );++ disc->first_track_num = first;+ disc->last_track_num = last;+++ /*+ * Get the logical block address (lba) for the end of the audio data.+ * The "LEADOUT" track is the track beyond the final audio track, so+ * we're looking for the block address of the LEADOUT track.+ */+ read_leadout(fd, &lba);+ disc->track_offsets[0] = lba + 150;++ for (i = first; i <= last; i++) {+ read_toc_entry(fd, i, &lba);+ disc->track_offsets[i] = lba + 150;++ /* Read the ISRC for the track */+ read_track_isrc(fd, disc, i);+ }++ close(fd);++ return 1;+}++/* EOF */
+ libdiscid/src/disc_openbsd.c view
@@ -0,0 +1,158 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2009 Anton Yabchinskiy+ Copyright (C) 2006 Matthias Friedrich+ Copyright (C) 2000 Robert Kaye+ Copyright (C) 1999 Marc E E van Woerkom++ This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.++ This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.++ You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++ $Id$++--------------------------------------------------------------------------- */++#include <sys/types.h>+#include <sys/cdio.h>+#include <sys/ioctl.h>++#include <errno.h>+#include <fcntl.h>+#include <stdio.h>+#include <string.h>+#include <unistd.h>++#include "discid/discid.h"+#include "discid/discid_private.h"++#define MB_DEFAULT_DEVICE "/dev/rcd0c"++#ifdef __NetBSD__+ #define CD_TRACK_LEADOUT 0xAA+ #ifdef __i386__+ #define MB_DEFAULT_DEVICE "/dev/rcd0d"+ #endif/* __i386__ */+#endif/* __NetBSD__ */++static int+read_toc_entry (int fd, int track, struct cd_toc_entry *te)+{+ struct ioc_read_toc_entry rte;++ rte.address_format = CD_LBA_FORMAT;+ rte.data = te;+ rte.data_len = sizeof (*te);+ rte.starting_track = track;++ if (ioctl (fd, CDIOREADTOCENTRYS, &rte) == -1) {+ return errno;+ }++ return 0;+}++static inline int+is_data_track (const struct cd_toc_entry *te)+{+ return (te->control & 0x4) != 0;+}++int+mb_disc_read_unportable (mb_disc_private *disc, const char *device)+{+ struct cd_toc_entry te;+ struct ioc_toc_header th;+ int fd, i, rc;++ fd = open (device, O_RDONLY | O_NONBLOCK);+ if (fd == -1) {+ snprintf (disc->error_msg, MB_ERROR_MSG_LENGTH,+ "could not open device '%s' (errno %i, '%s')", device, errno,+ strerror (errno));+ return 0;+ }++ rc = ioctl (fd, CDIOREADTOCHEADER, &th);+ if (rc == -1) {+ snprintf (disc->error_msg, MB_ERROR_MSG_LENGTH,+ "could not read table of contents (errno %i, '%s')", errno,+ strerror (errno));+ close (fd);+ return 0;+ }++ if (th.ending_track == 0) {+ snprintf (disc->error_msg, MB_ERROR_MSG_LENGTH, "disc has no tracks");+ close (fd);+ return 0;+ }++ disc->first_track_num = th.starting_track;+ disc->last_track_num = th.ending_track;++ rc = read_toc_entry (fd, CD_TRACK_LEADOUT, &te);+ if (rc != 0) {+ snprintf (disc->error_msg, MB_ERROR_MSG_LENGTH,+ "could not read TOC entry for lead-out track (errno %i, '%s')",+ rc, strerror (rc));+ close (fd);+ return 0;+ }+ disc->track_offsets [0] = (int) te.addr.lba + 150;++ for (i = th.starting_track; i <= th.ending_track; ++i) {+ rc = read_toc_entry (fd, i, &te);+ if (rc != 0) {+ snprintf (disc->error_msg, MB_ERROR_MSG_LENGTH,+ "could not read TOC entry for track %i (errno %i, '%s')", i,+ rc, strerror (rc));+ close (fd);+ return 0;+ }++ if (is_data_track (&te)) {+ if (i == th.starting_track) {+ snprintf (disc->error_msg, MB_ERROR_MSG_LENGTH,+ "disc has no audio tracks");+ close (fd);+ return 0;+ }+ break;+ }++ disc->track_offsets [i] = (int) te.addr.lba + 150;+ }++ close (fd);++ return 1;+}++char *+mb_disc_get_default_device_unportable (void)+{+ return MB_DEFAULT_DEVICE;+}++int+mb_disc_has_feature_unportable(enum discid_feature feature) {+ switch(feature) {+ case DISCID_FEATURE_READ:+ return 1;+ default:+ return 0;+ }+}
+ libdiscid/src/disc_solaris.c view
@@ -0,0 +1,196 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2009 Shunsuke Kuroda+ Copyright (C) 2006 Matthias Friedrich+ Copyright (C) 2000 Robert Kaye+ Copyright (C) 1999 Marc E E van Woerkom+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA+ 02110-1301 USA++ $Id$++--------------------------------------------------------------------------- */+#include <stdlib.h>+#include <stdio.h>+#include <string.h>+#include <fcntl.h>+#include <assert.h>+#include <unistd.h>+#include <sys/types.h>+#include <sys/stat.h>+#include <sys/ioctl.h>+#include <sys/cdio.h>+++#include "discid/discid.h"+#include "discid/discid_private.h"+++#define MB_DEFAULT_DEVICE "/vol/dev/aliases/cdrom0"++#define CD_FRAMES 75+#define XA_INTERVAL ((60 + 90 + 2) * CD_FRAMES)+++static int read_toc_header(int fd, int *first, int *last) {+ int ret;+ unsigned long ms_offset;++ struct cdrom_tochdr th;+ struct cdrom_tocentry te;++ ret = ioctl(fd, CDROMREADTOCHDR, &th);++ if ( ret < 0 )+ return ret; /* error */++ *first = th.cdth_trk0;+ *last = th.cdth_trk1;++ /*+ * Hide the last track if this is a multisession disc.+ *+ * te.cdte_addr.lba is the absolute CD-ROM address of the first+ * track in the FIRST SESSION. ms_offset is the absolute CD-ROM+ * address of the first track in the LAST SESSION.+ *+ * If ms_offset differs from te.cdte_addr.lba, CD-ROM is multi-+ * session.+ *+ * Note that currently only dual-session discs with one track+ * in the second session are handled correctly.+ */+ te.cdte_track = 1;+ te.cdte_format = CDROM_LBA;++ ret = ioctl(fd, CDROMREADTOCENTRY, &te);+ ret = ioctl(fd, CDROMREADOFFSET, &ms_offset);++ if ( ms_offset != te.cdte_addr.lba )+ (*last)--;++ return ret;+}+++static int read_toc_entry(int fd, int track_num, unsigned long *lba) {+ struct cdrom_tocentry te;+ int ret;++ te.cdte_track = track_num;+ te.cdte_format = CDROM_LBA;++ ret = ioctl(fd, CDROMREADTOCENTRY, &te);+ assert( te.cdte_format == CDROM_LBA );++ /* in case the ioctl() was successful */+ if ( ret == 0 )+ *lba = te.cdte_addr.lba;++ return ret;+}+++static int read_leadout(int fd, unsigned long *lba) {+ int ret;+ unsigned long ms_offset;++ struct cdrom_tocentry te;++ te.cdte_track = 1;+ te.cdte_format = CDROM_LBA;++ ret = ioctl(fd, CDROMREADTOCENTRY, &te);+ ret = ioctl(fd, CDROMREADOFFSET, &ms_offset);++ if ( ms_offset != te.cdte_addr.lba ) {+ *lba = ms_offset - XA_INTERVAL;+ return ret;+ }++ return read_toc_entry(fd, CDROM_LEADOUT, lba);+}+++char *mb_disc_get_default_device_unportable(void) {+ return MB_DEFAULT_DEVICE;+}++int mb_disc_has_feature_unportable(enum discid_feature feature) {+ switch(feature) {+ case DISCID_FEATURE_READ:+ return 1;+ default:+ return 0;+ }+}+++int mb_disc_read_unportable(mb_disc_private *disc, const char *device) {+ int fd;+ unsigned long lba;+ int first, last;+ int i;++ if ( (fd = open(device, O_RDONLY | O_NONBLOCK)) < 0 ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "cannot open device `%s'", device);+ return 0;+ }++ /*+ * Find the numbers of the first track (usually 1) and the last track.+ */+ if ( read_toc_header(fd, &first, &last) < 0 ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "cannot read table of contents");+ close(fd);+ return 0;+ }++ /* basic error checking */+ if ( last == 0 ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "this disc has no tracks");+ close(fd);+ return 0;+ }++ disc->first_track_num = first;+ disc->last_track_num = last;+++ /*+ * Get the logical block address (lba) for the end of the audio data.+ * The "LEADOUT" track is the track beyond the final audio track, so+ * we're looking for the block address of the LEADOUT track.+ */+ read_leadout(fd, &lba);+ disc->track_offsets[0] = lba + 150;++ for (i = first; i <= last; i++) {+ read_toc_entry(fd, i, &lba);+ disc->track_offsets[i] = lba + 150;+ }++ close(fd);++ return 1;+}++/* EOF */
+ libdiscid/src/disc_win32.c view
@@ -0,0 +1,159 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2000 Robert Kaye+ Portions Copyright (C) 2000 Emusic.com+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++ $Id$++----------------------------------------------------------------------------*/++#include <windows.h>+#include <mmsystem.h>+#include <string.h>+#include <stdio.h>+#ifdef _MSC_VER+#define snprintf _snprintf+#endif++#include "discid/discid_private.h"++#define MB_DEFAULT_DEVICE "cdaudio"++int mb_disc_read_unportable_nt(mb_disc_private *disc, const char *device);++char *mb_disc_get_default_device_unportable(void) {+ return MB_DEFAULT_DEVICE;+} ++int mb_disc_read_unportable(mb_disc_private *disc, const char *device) {+ int i, ret, last_track;+ char mci_command[128];+ char mci_return[128];+ char alias[128], device_str[128], error_msg[256];++ if ( GetVersion() < 0x80000000 ) {+ if ( strlen(device) == 0 || strcmp(device, "cdaudio") == 0 ) {+ sprintf(device_str, "D:"); /* FIXME */+ device = device_str;+ }+ return mb_disc_read_unportable_nt(disc, device);+ }++ + if ( strlen(device) == 0 || strcmp(device, "cdaudio") == 0 ) {+ sprintf(device_str, "cdaudio");+ }+ else {+ snprintf(device_str, 128, "%s type cdaudio", device);+ }++ /*+ * Prepare unique device alias.+ */+ snprintf(alias, 128, "libdiscid_%u_%u", (unsigned)GetTickCount(),+ (unsigned)GetCurrentThreadId());++ /*+ * Check number of CD audio devices+ */+ snprintf(mci_command, 128, "sysinfo cdaudio quantity wait");+ mciSendString(mci_command, mci_return, sizeof(mci_return), NULL);+ if ( atoi(mci_return) <= 0 ) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "no CD audio devices");+ return 0;+ }++ /*+ * Open specified CD audio device+ */+ snprintf(mci_command, 128, "open %s shareable alias %s wait",+ device_str, alias);+ ret = mciSendString(mci_command, mci_return, sizeof(mci_return), NULL);+ if ( ret != 0 ) {+ mciGetErrorString(ret, error_msg, 256); + snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "cannot open device `%s': %s", device, error_msg);+ return 0;+ }++ /*+ * Find the numbers of the first track (usually 1) and the last track.+ */ + snprintf(mci_command, 128, "status %s number of tracks wait", alias);+ ret = mciSendString(mci_command, mci_return, sizeof(mci_return), NULL);+ if ( ret != 0 ) {+ mciGetErrorString(ret, error_msg, 256); + snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "cannot read number of tracks: %s", error_msg);+ return 0;+ }+ + last_track = atoi(mci_return);+ disc->first_track_num = 1;+ disc->last_track_num = last_track;++ /*+ * Set time format to MSF (the returned track positions will be in format+ * mm:ss:ff, where mm is minutes, ss is seconds, and ff is frames).+ */+ snprintf(mci_command, 128, "set %s time format msf wait", alias);+ ret = mciSendString(mci_command, mci_return, sizeof(mci_return), NULL);+ if ( ret != 0 ) {+ mciGetErrorString(ret, error_msg, 256); + snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "cannot set time format: %s", error_msg);+ return 0;+ }+ + /*+ * Read positions for all tracks in the CD.+ */+ for (i = 1; i <= last_track; i++) {+ snprintf(mci_command, 128, "status %s position track %d wait",+ alias, i);+ mciSendString(mci_command, mci_return, sizeof(mci_return), NULL);+ disc->track_offsets[i] =+ atoi(mci_return + 0) * 4500 ++ atoi(mci_return + 3) * 75 ++ atoi(mci_return + 6);+ }+ + /*+ * Read length of the last track and calculate length of the whole CD.+ */+ snprintf(mci_command, 128, "status %s length track %d wait",+ alias, last_track);+ mciSendString(mci_command, mci_return, sizeof(mci_return), NULL);+ disc->track_offsets[0] =+ atoi(mci_return + 0) * 4500 ++ atoi(mci_return + 3) * 75 ++ atoi(mci_return + 6) ++ disc->track_offsets[last_track] + 1;+ + /*+ * Close the CD audio device+ */+ snprintf(mci_command, 128, "close %s wait", alias);+ mciSendString(mci_command, mci_return, sizeof(mci_return), NULL);++ return 1;+}++/* EOF */
+ libdiscid/src/disc_win32_new.c view
@@ -0,0 +1,243 @@+/* --------------------------------------------------------------------------++ MusicBrainz -- The Internet music metadatabase++ Copyright (C) 2007-2008 Lukas Lalinsky+ + This library is free software; you can redistribute it and/or+ modify it under the terms of the GNU Lesser General Public+ License as published by the Free Software Foundation; either+ version 2.1 of the License, or (at your option) any later version.+ + This library is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU+ Lesser General Public License for more details.+ + You should have received a copy of the GNU Lesser General Public+ License along with this library; if not, write to the Free Software+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA++ $Id$++----------------------------------------------------------------------------*/++#include <windows.h>+#include <string.h>+#include <stdio.h>+#ifdef _MSC_VER+#define snprintf _snprintf+#endif+#include "discid/discid.h"+#include "discid/discid_private.h"++#define CD_FRAMES 75+#define XA_INTERVAL ((60 + 90 + 2) * CD_FRAMES)++#define IOCTL_CDROM_READ_TOC 0x24000+#define IOCTL_CDROM_READ_Q_CHANNEL 0x2402c+#define IOCTL_CDROM_GET_LAST_SESSION 0x24038++typedef struct {+ UCHAR Reserved;+ UCHAR Control : 4;+ UCHAR Adr : 4;+ UCHAR TrackNumber;+ UCHAR Reserved1;+ UCHAR Address[4];+} TRACK_DATA;++typedef struct {+ UCHAR Length[2];+ UCHAR FirstTrack;+ UCHAR LastTrack;+ TRACK_DATA TrackData[100];+} CDROM_TOC;++typedef struct _CDROM_TOC_SESSION_DATA {+ UCHAR Length[2];+ UCHAR FirstCompleteSession;+ UCHAR LastCompleteSession;+ TRACK_DATA TrackData[1];+} CDROM_TOC_SESSION_DATA;++#define IOCTL_CDROM_SUB_Q_CHANNEL 0x00+#define IOCTL_CDROM_CURRENT_POSITION 0x01+#define IOCTL_CDROM_MEDIA_CATALOG 0x02+#define IOCTL_CDROM_TRACK_ISRC 0x03++typedef struct _CDROM_SUB_Q_DATA_FORMAT {+ UCHAR Format;+ UCHAR Track;+} CDROM_SUB_Q_DATA_FORMAT;++typedef struct _SUB_Q_HEADER {+ UCHAR Reserved;+ UCHAR AudioStatus;+ UCHAR DataLength[2];+} SUB_Q_HEADER;++typedef struct _SUB_Q_MEDIA_CATALOG_NUMBER {+ SUB_Q_HEADER Header;+ UCHAR FormatCode;+ UCHAR Reserved[3];+ UCHAR Reserved1 : 7;+ UCHAR Mcval :1;+ UCHAR MediaCatalog[15];+} SUB_Q_MEDIA_CATALOG_NUMBER;++typedef struct _SUB_Q_TRACK_ISRC {+ SUB_Q_HEADER Header;+ UCHAR FormatCode;+ UCHAR Reserved0;+ UCHAR Track;+ UCHAR Reserved1;+ UCHAR Reserved2 : 7;+ UCHAR Tcval : 1;+ UCHAR TrackIsrc[15];+} SUB_Q_TRACK_ISRC;++typedef union _SUB_Q_CHANNEL_DATA {+ /*SUB_Q_CURRENT_POSITION CurrentPosition;*/+ SUB_Q_MEDIA_CATALOG_NUMBER MediaCatalog;+ SUB_Q_TRACK_ISRC TrackIsrc;+} SUB_Q_CHANNEL_DATA;++int AddressToSectors(UCHAR address[4])+{+ return address[1] * 4500 + address[2] * 75 + address[3];+}++static void read_disc_mcn(HANDLE hDevice, mb_disc_private *disc)+{+ DWORD dwReturned;+ BOOL bResult;+ CDROM_SUB_Q_DATA_FORMAT format;+ SUB_Q_CHANNEL_DATA data;++ format.Track = 0;+ format.Format = IOCTL_CDROM_MEDIA_CATALOG;+ bResult = DeviceIoControl(hDevice, IOCTL_CDROM_READ_Q_CHANNEL,+ &format, sizeof(format),+ &data, sizeof(data),+ &dwReturned, NULL);+ if (bResult == FALSE) {+ fprintf(stderr, "Warning: Unable to read the disc's media catalog number.\n");+ }+ else {+ strncpy(disc->mcn, (char *) data.MediaCatalog.MediaCatalog,+ MCN_STR_LENGTH);+ }+}++static void read_disc_isrc(HANDLE hDevice, mb_disc_private *disc, int track)+{+ DWORD dwReturned;+ BOOL bResult;+ CDROM_SUB_Q_DATA_FORMAT format;+ SUB_Q_CHANNEL_DATA data;++ format.Track = track;+ format.Format = IOCTL_CDROM_TRACK_ISRC;+ bResult = DeviceIoControl(hDevice, IOCTL_CDROM_READ_Q_CHANNEL,+ &format, sizeof(format),+ &data, sizeof(data),+ &dwReturned, NULL);+ if (bResult == FALSE) {+ fprintf(stderr, "Warning: Unable to read the international standard recording code (ISRC) for track %i\n", track);+ }+ else {+ strncpy(disc->isrc[track], (char *) data.TrackIsrc.TrackIsrc,+ ISRC_STR_LENGTH);+ }+}++int mb_disc_has_feature_unportable(enum discid_feature feature) {+ switch(feature) {+ case DISCID_FEATURE_READ:+ case DISCID_FEATURE_MCN:+ case DISCID_FEATURE_ISRC:+ return 1;+ default:+ return 0;+ }+}+++int mb_disc_read_unportable_nt(mb_disc_private *disc, const char *device)+{+ HANDLE hDevice;+ DWORD dwReturned;+ BOOL bResult;+ CDROM_TOC toc;+ CDROM_TOC_SESSION_DATA session;+ char filename[128], *colon;+ int i, len;++ strcpy(filename, "\\\\.\\");+ len = strlen(device);+ colon = strchr(device, ':');+ if (colon) {+ len = colon - device + 1;+ }+ strncat(filename, device, len > 120 ? 120 : len);++ hDevice = CreateFile(filename, GENERIC_READ,+ FILE_SHARE_READ | FILE_SHARE_WRITE, + NULL, OPEN_EXISTING, 0, NULL); + if (hDevice == INVALID_HANDLE_VALUE) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "couldn't open the CD audio device");+ return 0;+ } ++ bResult = DeviceIoControl(hDevice, IOCTL_CDROM_GET_LAST_SESSION,+ NULL, 0,+ &session, sizeof(session),+ &dwReturned, NULL);+ if (bResult == FALSE) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "error while reading the CD TOC");+ CloseHandle(hDevice);+ return 0;+ }++ bResult = DeviceIoControl(hDevice, IOCTL_CDROM_READ_TOC,+ NULL, 0,+ &toc, sizeof(toc),+ &dwReturned, NULL);+ if (bResult == FALSE) {+ snprintf(disc->error_msg, MB_ERROR_MSG_LENGTH,+ "error while reading the CD TOC");+ CloseHandle(hDevice);+ return 0;+ }++ read_disc_mcn(hDevice, disc);++ disc->first_track_num = toc.FirstTrack;+ disc->last_track_num = toc.LastTrack;++ /* multi-session disc */+ if (session.FirstCompleteSession != session.LastCompleteSession) {+ disc->last_track_num = session.TrackData[0].TrackNumber - 1;+ disc->track_offsets[0] =+ AddressToSectors(toc.TrackData[disc->last_track_num].Address) -+ XA_INTERVAL;+ }+ else {+ disc->track_offsets[0] =+ AddressToSectors(toc.TrackData[disc->last_track_num].Address);+ }++ for (i = disc->first_track_num; i <= disc->last_track_num; i++) {+ disc->track_offsets[i] = AddressToSectors(toc.TrackData[i - 1].Address);+ read_disc_isrc(hDevice, disc, i);+ }++ CloseHandle(hDevice);+ return 1;+}++/* EOF */+
+ libdiscid/src/sha1.c view
@@ -0,0 +1,329 @@+/* (PD) 2001 The Bitzi Corporation+ * Please see file COPYING or http://bitzi.com/publicdomain + * for more info.+ *+ * NIST Secure Hash Algorithm + * heavily modified by Uwe Hollerbach <uh@alumni.caltech edu> + * from Peter C. Gutmann's implementation as found in + * Applied Cryptography by Bruce Schneier + * Further modifications to include the "UNRAVEL" stuff, below + *+ * This code is in the public domain + *+ * $Id$+ */++#include <string.h>+#include "sha1.h"++/* UNRAVEL should be fastest & biggest */+/* UNROLL_LOOPS should be just as big, but slightly slower */+/* both undefined should be smallest and slowest */++#define UNRAVEL+/* #define UNROLL_LOOPS */++/* SHA f()-functions */++#define f1(x,y,z) ((x & y) | (~x & z))+#define f2(x,y,z) (x ^ y ^ z)+#define f3(x,y,z) ((x & y) | (x & z) | (y & z))+#define f4(x,y,z) (x ^ y ^ z)++/* SHA constants */++#define CONST1 0x5a827999L+#define CONST2 0x6ed9eba1L+#define CONST3 0x8f1bbcdcL+#define CONST4 0xca62c1d6L++/* truncate to 32 bits -- should be a null op on 32-bit machines */++#define T32(x) ((x) & 0xffffffffL)++/* 32-bit rotate */++#define R32(x,n) T32(((x << n) | (x >> (32 - n))))++/* the generic case, for when the overall rotation is not unraveled */++#define FG(n) \+ T = T32(R32(A,5) + f##n(B,C,D) + E + *WP++ + CONST##n); \+ E = D; D = C; C = R32(B,30); B = A; A = T++/* specific cases, for when the overall rotation is unraveled */++#define FA(n) \+ T = T32(R32(A,5) + f##n(B,C,D) + E + *WP++ + CONST##n); B = R32(B,30)++#define FB(n) \+ E = T32(R32(T,5) + f##n(A,B,C) + D + *WP++ + CONST##n); A = R32(A,30)++#define FC(n) \+ D = T32(R32(E,5) + f##n(T,A,B) + C + *WP++ + CONST##n); T = R32(T,30)++#define FD(n) \+ C = T32(R32(D,5) + f##n(E,T,A) + B + *WP++ + CONST##n); E = R32(E,30)++#define FE(n) \+ B = T32(R32(C,5) + f##n(D,E,T) + A + *WP++ + CONST##n); D = R32(D,30)++#define FT(n) \+ A = T32(R32(B,5) + f##n(C,D,E) + T + *WP++ + CONST##n); C = R32(C,30)++/* do SHA transformation */++static void sha_transform(SHA_INFO *sha_info)+{+ int i;+ SHA_BYTE *dp;+ SHA_LONG T, A, B, C, D, E, W[80], *WP;++ dp = sha_info->data;++/*+the following makes sure that at least one code block below is+traversed or an error is reported, without the necessity for nested+preprocessor if/else/endif blocks, which are a great pain in the+nether regions of the anatomy...+*/+#undef SWAP_DONE++#if (SHA_BYTE_ORDER == 1234)+#define SWAP_DONE+ for (i = 0; i < 16; ++i) {+ T = *((SHA_LONG *) dp);+ dp += 4;+ W[i] = ((T << 24) & 0xff000000) | ((T << 8) & 0x00ff0000) |+ ((T >> 8) & 0x0000ff00) | ((T >> 24) & 0x000000ff);+ }+#endif /* SHA_BYTE_ORDER == 1234 */++#if (SHA_BYTE_ORDER == 4321)+#define SWAP_DONE+ for (i = 0; i < 16; ++i) {+ T = *((SHA_LONG *) dp);+ dp += 4;+ W[i] = T32(T);+ }+#endif /* SHA_BYTE_ORDER == 4321 */++#if (SHA_BYTE_ORDER == 12345678)+#define SWAP_DONE+ for (i = 0; i < 16; i += 2) {+ T = *((SHA_LONG *) dp);+ dp += 8;+ W[i] = ((T << 24) & 0xff000000) | ((T << 8) & 0x00ff0000) |+ ((T >> 8) & 0x0000ff00) | ((T >> 24) & 0x000000ff);+ T >>= 32;+ W[i+1] = ((T << 24) & 0xff000000) | ((T << 8) & 0x00ff0000) |+ ((T >> 8) & 0x0000ff00) | ((T >> 24) & 0x000000ff);+ }+#endif /* SHA_BYTE_ORDER == 12345678 */++#if (SHA_BYTE_ORDER == 87654321)+#define SWAP_DONE+ for (i = 0; i < 16; i += 2) {+ T = *((SHA_LONG *) dp);+ dp += 8;+ W[i] = T32(T >> 32);+ W[i+1] = T32(T);+ }+#endif /* SHA_BYTE_ORDER == 87654321 */++#ifndef SWAP_DONE+#error Unknown byte order -- you need to add code here+#endif /* SWAP_DONE */++ for (i = 16; i < 80; ++i) {+ W[i] = W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16];+#if (SHA_VERSION == 1)+ W[i] = R32(W[i], 1);+#endif /* SHA_VERSION */+ }+ A = sha_info->digest[0];+ B = sha_info->digest[1];+ C = sha_info->digest[2];+ D = sha_info->digest[3];+ E = sha_info->digest[4];+ WP = W;+#ifdef UNRAVEL+ FA(1); FB(1); FC(1); FD(1); FE(1); FT(1); FA(1); FB(1); FC(1); FD(1);+ FE(1); FT(1); FA(1); FB(1); FC(1); FD(1); FE(1); FT(1); FA(1); FB(1);+ FC(2); FD(2); FE(2); FT(2); FA(2); FB(2); FC(2); FD(2); FE(2); FT(2);+ FA(2); FB(2); FC(2); FD(2); FE(2); FT(2); FA(2); FB(2); FC(2); FD(2);+ FE(3); FT(3); FA(3); FB(3); FC(3); FD(3); FE(3); FT(3); FA(3); FB(3);+ FC(3); FD(3); FE(3); FT(3); FA(3); FB(3); FC(3); FD(3); FE(3); FT(3);+ FA(4); FB(4); FC(4); FD(4); FE(4); FT(4); FA(4); FB(4); FC(4); FD(4);+ FE(4); FT(4); FA(4); FB(4); FC(4); FD(4); FE(4); FT(4); FA(4); FB(4);+ sha_info->digest[0] = T32(sha_info->digest[0] + E);+ sha_info->digest[1] = T32(sha_info->digest[1] + T);+ sha_info->digest[2] = T32(sha_info->digest[2] + A);+ sha_info->digest[3] = T32(sha_info->digest[3] + B);+ sha_info->digest[4] = T32(sha_info->digest[4] + C);+#else /* !UNRAVEL */+#ifdef UNROLL_LOOPS+ FG(1); FG(1); FG(1); FG(1); FG(1); FG(1); FG(1); FG(1); FG(1); FG(1);+ FG(1); FG(1); FG(1); FG(1); FG(1); FG(1); FG(1); FG(1); FG(1); FG(1);+ FG(2); FG(2); FG(2); FG(2); FG(2); FG(2); FG(2); FG(2); FG(2); FG(2);+ FG(2); FG(2); FG(2); FG(2); FG(2); FG(2); FG(2); FG(2); FG(2); FG(2);+ FG(3); FG(3); FG(3); FG(3); FG(3); FG(3); FG(3); FG(3); FG(3); FG(3);+ FG(3); FG(3); FG(3); FG(3); FG(3); FG(3); FG(3); FG(3); FG(3); FG(3);+ FG(4); FG(4); FG(4); FG(4); FG(4); FG(4); FG(4); FG(4); FG(4); FG(4);+ FG(4); FG(4); FG(4); FG(4); FG(4); FG(4); FG(4); FG(4); FG(4); FG(4);+#else /* !UNROLL_LOOPS */+ for (i = 0; i < 20; ++i) { FG(1); }+ for (i = 20; i < 40; ++i) { FG(2); }+ for (i = 40; i < 60; ++i) { FG(3); }+ for (i = 60; i < 80; ++i) { FG(4); }+#endif /* !UNROLL_LOOPS */+ sha_info->digest[0] = T32(sha_info->digest[0] + A);+ sha_info->digest[1] = T32(sha_info->digest[1] + B);+ sha_info->digest[2] = T32(sha_info->digest[2] + C);+ sha_info->digest[3] = T32(sha_info->digest[3] + D);+ sha_info->digest[4] = T32(sha_info->digest[4] + E);+#endif /* !UNRAVEL */+}++/* initialize the SHA digest */++void sha_init(SHA_INFO *sha_info)+{+ sha_info->digest[0] = 0x67452301L;+ sha_info->digest[1] = 0xefcdab89L;+ sha_info->digest[2] = 0x98badcfeL;+ sha_info->digest[3] = 0x10325476L;+ sha_info->digest[4] = 0xc3d2e1f0L;+ sha_info->count_lo = 0L;+ sha_info->count_hi = 0L;+ sha_info->local = 0;+}++/* update the SHA digest */++void sha_update(SHA_INFO *sha_info, SHA_BYTE *buffer, int count)+{+ int i;+ SHA_LONG clo;++ clo = T32(sha_info->count_lo + ((SHA_LONG) count << 3));+ if (clo < sha_info->count_lo) {+ ++sha_info->count_hi;+ }+ sha_info->count_lo = clo;+ sha_info->count_hi += (SHA_LONG) count >> 29;+ if (sha_info->local) {+ i = SHA_BLOCKSIZE - sha_info->local;+ if (i > count) {+ i = count;+ }+ memcpy(((SHA_BYTE *) sha_info->data) + sha_info->local, buffer, i);+ count -= i;+ buffer += i;+ sha_info->local += i;+ if (sha_info->local == SHA_BLOCKSIZE) {+ sha_transform(sha_info);+ } else {+ return;+ }+ }+ while (count >= SHA_BLOCKSIZE) {+ memcpy(sha_info->data, buffer, SHA_BLOCKSIZE);+ buffer += SHA_BLOCKSIZE;+ count -= SHA_BLOCKSIZE;+ sha_transform(sha_info);+ }+ memcpy(sha_info->data, buffer, count);+ sha_info->local = count;+}++/* finish computing the SHA digest */++void sha_final(unsigned char digest[20], SHA_INFO *sha_info)+{+ int count;+ SHA_LONG lo_bit_count, hi_bit_count;++ lo_bit_count = sha_info->count_lo;+ hi_bit_count = sha_info->count_hi;+ count = (int) ((lo_bit_count >> 3) & 0x3f);+ ((SHA_BYTE *) sha_info->data)[count++] = 0x80;+ if (count > SHA_BLOCKSIZE - 8) {+ memset(((SHA_BYTE *) sha_info->data) + count, 0, SHA_BLOCKSIZE - count);+ sha_transform(sha_info);+ memset((SHA_BYTE *) sha_info->data, 0, SHA_BLOCKSIZE - 8);+ } else {+ memset(((SHA_BYTE *) sha_info->data) + count, 0,+ SHA_BLOCKSIZE - 8 - count);+ }+ sha_info->data[56] = (unsigned char) ((hi_bit_count >> 24) & 0xff);+ sha_info->data[57] = (unsigned char) ((hi_bit_count >> 16) & 0xff);+ sha_info->data[58] = (unsigned char) ((hi_bit_count >> 8) & 0xff);+ sha_info->data[59] = (unsigned char) ((hi_bit_count >> 0) & 0xff);+ sha_info->data[60] = (unsigned char) ((lo_bit_count >> 24) & 0xff);+ sha_info->data[61] = (unsigned char) ((lo_bit_count >> 16) & 0xff);+ sha_info->data[62] = (unsigned char) ((lo_bit_count >> 8) & 0xff);+ sha_info->data[63] = (unsigned char) ((lo_bit_count >> 0) & 0xff);+ sha_transform(sha_info);+ digest[ 0] = (unsigned char) ((sha_info->digest[0] >> 24) & 0xff);+ digest[ 1] = (unsigned char) ((sha_info->digest[0] >> 16) & 0xff);+ digest[ 2] = (unsigned char) ((sha_info->digest[0] >> 8) & 0xff);+ digest[ 3] = (unsigned char) ((sha_info->digest[0] ) & 0xff);+ digest[ 4] = (unsigned char) ((sha_info->digest[1] >> 24) & 0xff);+ digest[ 5] = (unsigned char) ((sha_info->digest[1] >> 16) & 0xff);+ digest[ 6] = (unsigned char) ((sha_info->digest[1] >> 8) & 0xff);+ digest[ 7] = (unsigned char) ((sha_info->digest[1] ) & 0xff);+ digest[ 8] = (unsigned char) ((sha_info->digest[2] >> 24) & 0xff);+ digest[ 9] = (unsigned char) ((sha_info->digest[2] >> 16) & 0xff);+ digest[10] = (unsigned char) ((sha_info->digest[2] >> 8) & 0xff);+ digest[11] = (unsigned char) ((sha_info->digest[2] ) & 0xff);+ digest[12] = (unsigned char) ((sha_info->digest[3] >> 24) & 0xff);+ digest[13] = (unsigned char) ((sha_info->digest[3] >> 16) & 0xff);+ digest[14] = (unsigned char) ((sha_info->digest[3] >> 8) & 0xff);+ digest[15] = (unsigned char) ((sha_info->digest[3] ) & 0xff);+ digest[16] = (unsigned char) ((sha_info->digest[4] >> 24) & 0xff);+ digest[17] = (unsigned char) ((sha_info->digest[4] >> 16) & 0xff);+ digest[18] = (unsigned char) ((sha_info->digest[4] >> 8) & 0xff);+ digest[19] = (unsigned char) ((sha_info->digest[4] ) & 0xff);+}++/* compute the SHA digest of a FILE stream */++#define BLOCK_SIZE 8192++void sha_stream(unsigned char digest[20], SHA_INFO *sha_info, FILE *fin)+{+ int i;+ SHA_BYTE data[BLOCK_SIZE];++ sha_init(sha_info);+ while ((i = fread(data, 1, BLOCK_SIZE, fin)) > 0) {+ sha_update(sha_info, data, i);+ }+ sha_final(digest, sha_info);+}++/* print a SHA digest */++void sha_print(unsigned char digest[20])+{+ int i, j;++ for (j = 0; j < 5; ++j) {+ for (i = 0; i < 4; ++i) {+ printf("%02x", *digest++);+ }+ printf("%c", (j < 4) ? ' ' : '\n');+ }+}++char *sha_version(void)+{+#if (SHA_VERSION == 1)+ static char *version = "SHA-1";+#else+ static char *version = "SHA";+#endif+ return(version);+}+
+ libdiscid/src/sha1.h view
@@ -0,0 +1,62 @@+/* NIST Secure Hash Algorithm */+/* heavily modified by Uwe Hollerbach <uh@alumni.caltech edu> */+/* from Peter C. Gutmann's implementation as found in */+/* Applied Cryptography by Bruce Schneier */+/* This code is in the public domain */+/* $Id$ */++#ifndef SHA_H+#define SHA_H++#include <stdlib.h>+#include <stdio.h>++/* Useful defines & typedefs */+typedef unsigned char SHA_BYTE; /* 8-bit quantity */+typedef unsigned long SHA_LONG; /* 32-or-more-bit quantity */++#define SHA_BLOCKSIZE 64+#define SHA_DIGESTSIZE 20++typedef struct {+ SHA_LONG digest[5]; /* message digest */+ SHA_LONG count_lo, count_hi; /* 64-bit bit count */+ SHA_BYTE data[SHA_BLOCKSIZE]; /* SHA data buffer */+ int local; /* unprocessed amount in data */+} SHA_INFO;++void sha_init(SHA_INFO *);+void sha_update(SHA_INFO *, SHA_BYTE *, int);+void sha_final(unsigned char [20], SHA_INFO *);++void sha_stream(unsigned char [20], SHA_INFO *, FILE *);+void sha_print(unsigned char [20]);+char *sha_version(void);++#define SHA_VERSION 1++#ifdef HAVE_CONFIG_H +#include "config.h"+++#ifdef WORDS_BIGENDIAN+# if SIZEOF_LONG == 4+# define SHA_BYTE_ORDER 4321+# elif SIZEOF_LONG == 8+# define SHA_BYTE_ORDER 87654321+# endif+#else+# if SIZEOF_LONG == 4+# define SHA_BYTE_ORDER 1234+# elif SIZEOF_LONG == 8+# define SHA_BYTE_ORDER 12345678+# endif+#endif++#else++#define SHA_BYTE_ORDER 1234++#endif++#endif /* SHA_H */
+ src/Sound/MusicBrainz/DiscId.hs view
@@ -0,0 +1,165 @@+-----------------------------------------------------------------------------+--+-- Module : Sound.MusicBrainz.DiscId+-- Copyright : 2013 André Twupack+-- License : GNU LESSER GENERAL PUBLIC LICENSE Version 3+--+-- This library is free software: you can redistribute it and/or modify+-- it under the terms of the GNU Lesser General Public License as published by+-- the Free Software Foundation, either version 3 of the License, or+-- (at your option) any later version.+--+-- This library is distributed in the hope that it will be useful,+-- but WITHOUT ANY WARRANTY; without even the implied warranty of+-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+-- GNU Lesser General Public License for more details.+--+-- You should have received a copy of the GNU Lesser General Public License+-- along with this library. If not, see <http://www.gnu.org/licenses/>.++-- Maintainer : André Twupack+-- Stability :+-- Portability :+--+-- |+-----------------------------------------------------------------------------++{-# LANGUAGE ForeignFunctionInterface #-}++module Sound.MusicBrainz.DiscId (+ getVersionString,+ getDefaultDevice,+ readFromDefaultCd,+ readFromCd,+ hasFeature,+ getFeatureList,+ DiscIdFeature(..),+ DiscId(..),+ TOC(..),+ Track(..)+) where++import Foreign.C+import Foreign.Ptr (Ptr, nullPtr)+import Data.Map (Map, fromList)+import Control.Monad (mapM)+import Control.Applicative ((<$>))+import qualified Data.Vector.Storable.Mutable as M+++data DiscId = DiscId { mbId :: String,+ freedbId :: String,+ submissionUrl :: String,+ webserviceUrl :: String,+ sectors :: Int,+ toc :: TOC,+ mcn :: String} deriving Show++data TOC = TOC { firstTrackNum :: Int,+ lastTrackNum :: Int,+ tracks :: Map Int Track} deriving Show++data Track = Track { num :: Int,+ offset :: Int,+ length :: Int,+ isrc :: String} deriving Show++type DiscIdHandle = Ptr ()++foreign import ccall unsafe discid_get_version_string :: IO CString+foreign import ccall unsafe discid_get_default_device :: IO CString+foreign import ccall unsafe discid_new :: IO DiscIdHandle+foreign import ccall unsafe discid_free :: DiscIdHandle -> IO ()+foreign import ccall unsafe discid_get_error_msg :: DiscIdHandle -> IO CString+foreign import ccall unsafe discid_get_freedb_id :: DiscIdHandle -> IO CString+foreign import ccall unsafe discid_get_id :: DiscIdHandle -> IO CString+foreign import ccall unsafe discid_read :: DiscIdHandle -> CString -> IO CInt+foreign import ccall unsafe discid_get_first_track_num :: DiscIdHandle -> IO CInt+foreign import ccall unsafe discid_get_last_track_num :: DiscIdHandle -> IO CInt+foreign import ccall unsafe discid_get_submission_url :: DiscIdHandle -> IO CString+foreign import ccall unsafe discid_get_webservice_url :: DiscIdHandle -> IO CString+foreign import ccall unsafe discid_get_sectors :: DiscIdHandle -> IO CInt+foreign import ccall unsafe discid_get_track_length :: DiscIdHandle -> CInt -> IO CInt+foreign import ccall unsafe discid_get_track_offset :: DiscIdHandle -> CInt -> IO CInt+foreign import ccall unsafe discid_get_mcn :: DiscIdHandle -> IO CString+foreign import ccall unsafe discid_get_track_isrc :: DiscIdHandle -> CInt -> IO CString+foreign import ccall unsafe discid_has_feature :: CInt -> CInt+foreign import ccall unsafe discid_get_feature_list :: Ptr CString -> IO ()++data DiscIdFeature = Read | MCN | ISRC | Unknown deriving Show++getFeatureList :: IO [DiscIdFeature]+getFeatureList = do+ arr <- M.new 32+ M.unsafeWith arr discid_get_feature_list+ cp <- mapM (M.read arr) [0..31]+ fs <- mapM peekCString (takeWhile (/=nullPtr) cp)+ return $ toFeature <$> fs++toFeature :: String -> DiscIdFeature+toFeature s+ | s == "read" = Read+ | s == "isrc" = ISRC+ | s == "mcn" = MCN+ | otherwise = Unknown++toBool :: CInt -> Bool+toBool ib+ | ib == 0 = False+ | otherwise = True++hasFeature :: DiscIdFeature -> Bool+hasFeature Read = toBool $ discid_has_feature 1+hasFeature MCN = toBool $ discid_has_feature 2+hasFeature ISRC = toBool $ discid_has_feature 4++-- | Return the full version string of this library, including the name.+getVersionString :: IO String -- ^ a string containing the version of libdiscid.+getVersionString = discid_get_version_string >>= peekCString++-- | Return the name of the default disc drive for this operating system.+getDefaultDevice :: IO String -- ^ a string containing an operating system dependent device identifier+getDefaultDevice = discid_get_default_device >>= peekCString++-- | Read the disc in the default CD-ROM/DVD-ROM drive.+readFromDefaultCd :: IO (Either String DiscId)+readFromDefaultCd = getDefaultDevice >>= readFromCd++-- | Read the disc in the given CD-ROM/DVD-ROM drive.+readFromCd :: String -> IO (Either String DiscId)+readFromCd dev = do+ handle <- discid_new+ result <- withCString dev $ \devC -> discid_read handle devC+ discId <- createDiscId handle result+ discid_free handle+ return discId++createDiscId :: DiscIdHandle -> CInt -> IO (Either String DiscId)+createDiscId handle result+ | result == 0 = do+ error <- discid_get_error_msg handle >>= peekCString+ return $ Left error+ | otherwise = do+ mbId <- discid_get_id handle >>= peekCString+ freedbId <- discid_get_freedb_id handle >>= peekCString+ submUrl <- discid_get_submission_url handle >>= peekCString+ websUrl <- discid_get_webservice_url handle >>= peekCString+ sectors <- fromIntegral <$> discid_get_sectors handle+ toc <- createTOC handle+ mcn <- discid_get_mcn handle >>= peekCString+ return $ Right (DiscId mbId freedbId submUrl websUrl sectors toc mcn)+++createTrack :: DiscIdHandle -> CInt -> IO (Int, Track)+createTrack handle num = do+ length <- fromIntegral <$> discid_get_track_length handle num+ offset <- fromIntegral <$> discid_get_track_offset handle num+ isrc <- discid_get_track_isrc handle num >>= peekCString+ return (fromIntegral num, Track (fromIntegral num) offset length isrc)++createTOC :: DiscIdHandle -> IO TOC+createTOC handle = do+ first <- discid_get_first_track_num handle+ last <- discid_get_last_track_num handle+ tracks <- mapM (createTrack handle) [first..last]+ return $ TOC (fromIntegral first) (fromIntegral last) (fromList tracks)