pax_global_header00006660000000000000000000000064143303647270014523gustar00rootroot0000000000000052 comment=0d87bd211eb22dc3445c263fbf6afba158f14084 libspiro-20221101/000077500000000000000000000000001433036472700136005ustar00rootroot00000000000000libspiro-20221101/.github/000077500000000000000000000000001433036472700151405ustar00rootroot00000000000000libspiro-20221101/.github/workflows/000077500000000000000000000000001433036472700171755ustar00rootroot00000000000000libspiro-20221101/.github/workflows/main.yml000066400000000000000000000042231433036472700206450ustar00rootroot00000000000000name: C on: [push,pull_request] jobs: linux: runs-on: ubuntu-latest strategy: matrix: choiceL: [--disable-silent-rules, --enable-verbose_lib, --enable-test_inputs, --enable-test-a-lot] steps: - uses: actions/checkout@v2 - name: Create configure run: | sudo apt-get update -y sudo apt-get install autoconf automake libtool gcc autoreconf -i automake - name: Choose configure run: ./configure ${{ matrix.choiceL }} - name: Make library run: make - name: Test library run: make check - name: Test make distcheck if: matrix.choiceL == '--disable-silent-rules' run: make distcheck macos: runs-on: macos-latest strategy: matrix: choiceM: [--disable-silent-rules, --enable-verbose_lib, --enable-test_inputs, --enable-test-a-lot] steps: - uses: actions/checkout@v2 - name: Create configure run: | brew install autoconf automake libtool gcc autoreconf -i automake - name: Choose configure run: ./configure ${{ matrix.choiceM }} - name: Make library run: make - name: Test library run: make check windows: runs-on: windows-latest strategy: matrix: include: [ { msystem: MINGW64, toolchain: mingw-w64-x86_64-toolchain }, { msystem: MINGW32, toolchain: mingw-w64-i686-toolchain }, { msystem: UCRT64, toolchain: mingw-w64-ucrt-x86_64-toolchain }, { msystem: CLANG64, toolchain: mingw-w64-clang-x86_64-toolchain }, ] name: ${{ matrix.msystem }} defaults: run: shell: msys2 {0} steps: - uses: actions/checkout@v2 - uses: msys2/setup-msys2@v2 with: msystem: ${{ matrix.msystem }} update: true install: autotools base-devel git ${{ matrix.toolchain }} - name: Create configure run: | autoreconf -i automake - name: Choose configure run: ./configure - name: Make library run: make - name: Test library run: make check libspiro-20221101/.gitignore000066400000000000000000000002361433036472700155710ustar00rootroot00000000000000# Object files *.lo *.o # Libraries *.lib *.a # Logs *.log # Shared objects (inc. Windows DLLs) *.dll *.so *.so.* *.dylib # Executables *.exe *.out *.app libspiro-20221101/AUTHORS000066400000000000000000000005611433036472700146520ustar00rootroot00000000000000Authors: Raph Levien George Williams Joe Da Silva, www.joescat.com Patent Grant and Copyright (C) 2007 Raph Levien Extra edits, patches, updates... (2013...,) Dave Crossland Shriramana Sharma Joe Da Silva Horváth Balázs Luigi Scarso Jeremy Tan Wiesław Šoltés Mingye Wang Frederic Cambus Fredrick Brennan C.W. Betts orbea libspiro-20221101/COPYING000066400000000000000000001045131433036472700146370ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. 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. Copyright (C) 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 . 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: Copyright (C) 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 . 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 . libspiro-20221101/ChangeLog000066400000000000000000000142331433036472700153550ustar00rootroot00000000000000- 2022-Nov-01 * Libspiro Version 20221101 (1.3.0) * Bugfix - removed forgotten if-then code used with scaling tests. Majority of users won't notice a difference since most FontForge fonts are created in the +x,+y quadrant. Users that might see a change/difference are users drawing only in the -x, -y quadrant. * Enhanced libspiro to allow closed-loop spiros starting with '[' or 'a' by seeking the first available 'v', 'c', or 'o' as start, which may be found later in the spiro curve. This was the least modification needed to allow call-test10 or call-test11 to pass. - 2022-Jul-22 * Libspiro Version 20220722 (1.2.0) * Due to confusion created when ppedit was also re-licensed as MIT APACHE and GPL2+, it's necessary to re-clarify libspiro is GPL3+. In summary, GPL can include MIT code, MIT code cannot accept GPL. Please note code not in ppedit like libspiro's java is GNU GPL2+. Please note that libspiro's improvements or patches are also GPL. * Thanks to orbea for bugfixes concerning linking and linker flags, and removing .libs from linker path (some linkers don't like it). * Added more commenting in spiroentrypoints.h to clarify functions. * Reconfigured code to avoid exporting bezctx_intf.h since this is supposed to be internal to libspiro and not for external calling. * Also added https://gcc.gnu.org/wiki/Visibility to reduce exports. * SPIRO_INTERNAL_BEZCTX and call-test21.c added for simpler method of accessing libspiro for programs that only need the end result. * Test added for 'a','h' to ensure points don't overlap, else exit. - 2020-May-05 * Libspiro Version 20200505 (1.1.0) * Bugfix for CVE-2019-19847 affecting {call-test14 to call-test19}. * Fix a memory access bug/error created earlier by patch 2017oct28 Users using tagpoint libspiro20150702 are unaffected by this bug. Users using tagpoint libspiro20190731 are recommended to upgrade. Thanks to Frederic Cambus for calling attention to these faults. * Add optional 'end knot' for open curves (useful for displaying). * CRA Version also higher than so-bump 1.0.5 used on some distros; this maybe of interest to distros that bumped an earlier version. * Some garbage-in/garbage-out checks to verify we have 'ah' pairs, and we don't start with ']', or end with '['. Add libspiro.3 man. * Corrected set_di_to_x1y1() to use a constant bandwidth of 0.0005 * Code improvements and bug fixes for better tagged/spiro results. * Several improvements added to further increase libspiro's speed. - 2019-Jul-31 * Libspiro Version 20190731 (1.0.0) * Corrected library to report correctly as next version up. This is probably a significant change, therefore bumped library to start at 1.0 even though backwards compatibility remains close to same. * Scaling bug fixed. Libspiro can accept points that can be shifted and/or scaled, this gives libspiro more flexiblity with graphics and templates. Large or small spiros created before this fix may need adjusting to fit the new calculations, but they're resizable and movable afterwards. * Added toggle switch ncq giving users additional functionality not easily accessible through spiro paths, including quad0 access. * Removed the excessively long package name, which you'll note as a so-bump change with Fedora and also Debian in naming this package. * Some Java alignment fixed - Thanks to Mingye Wang * Added new anchor and handle {'a','h'} which may be useful to many. * Fix System.arraycopy and README.md - Thanks to Wieslaw Soltes. * Include config header before DO_TIME_DAY - Thanks to Jeremy Tan. - 2015-Jul-19 * Add patch for failure in hurd-i386 build (debian 1%0.5.20150702-2) - 2015-Jul-02 * Libspiro Version 0.5.20150702 * Important bug fix issue #11 (missing file not included in 0v4). * 2 Minor bug fixes caught on Coverity scan, 'free()' and 'if (c=3)' - 2015-Jul-01 * Libspiro Version 0.4.20150701 * Re-edit lib and tests to be more accommodating of older compilers. * Many changes to call-test.c to run on bigger variety of platforms, and some minor configure.ac tweaks done to resolve issues #9, #10. as seen on https://github.com/fontforge/libspiro/issues and: https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=789012 * Added developer/install test for cyclic spiros (without {} or z). * Verify libspiro output data is correct for test curves {0,1,2,4}. * User can overide default configure flags with LS_CFLAGS and LS_LIB - 2015-Jan-31 * Libspiro Version 0.3.20150131 * Allow Libspiro to be included using PKG_CHECK_MODULES(). * Bug fixes in configure.ac m4 calls that caused problems seen in: https://bugs.freebsd.org/bugzilla/show_bug.cgi?id=196780 https://bugs.archlinux.org/task/43373 * Add TaggedSpiroCPsToBezier1() and SpiroCPsToBezier1() for programs that cannot use TaggedSpiroCPsToBezier0() or SpiroCPsToBezier0(). - 2013-Sep-30 * Libspiro Version 0.2.20130930 * Optional 'make check' runs 'call-test' to check libspiro functions. * Minor logic optimizations. Removed global 'n', passed 'n' instead. - 2013-Jul-22 * Use 'make check' to run spiro.c UNIT_TEST internal main() routine. - 2013-Jun-28 * Allow for setting VERBOSE during configure - helps with debugging. * Allow for setting CHECK_INPUT_FINITENESS during configure - to test input values for finiteness before doing calculations (optional). * Pass nmat variable to reduce repeatedly recomputing with count_vec(). - 2013-May-31 * Convert build system to autotools method (configure.ac, Makefile.am). * Backporting robustness patches from Inkscape. * Increase Spiro max iterations to 30 after finding convergences of 15. * If did not converge or encountered non-finite values, do not output spline. Only good splines will be output. - 2013-Apr-20 * Initial commit to https://github.com/fontforge/libspiro.git * Add bezctx.md based on http://libspiro.sourceforge.net/bezctx.html - 2009-May-08 * Add Java implementation. - 2007-Oct-28 * Initial release. libspiro-20221101/INSTALL000066400000000000000000000363321433036472700146400ustar00rootroot00000000000000Installation Instructions ************************* Copyright (C) 1994, 1995, 1996, 1999, 2000, 2001, 2002, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, Inc. Copying and distribution of this file, with or without modification, are permitted in any medium without royalty provided the copyright notice and this notice are preserved. This file is offered as-is, without warranty of any kind. Basic Installation ================== Briefly, the shell commands `./configure; make; make install' should configure, build, and install this package. The following more-detailed instructions are generic; see the `README' file for instructions specific to this package. Some packages provide this `INSTALL' file but do not implement all of the features documented below. The lack of an optional feature in a given package is not necessarily a bug. More recommendations for GNU packages can be found in *note Makefile Conventions: (standards)Makefile Conventions. The `configure' shell script attempts to guess correct values for various system-dependent variables used during compilation. It uses those values to create a `Makefile' in each directory of the package. It may also create one or more `.h' files containing system-dependent definitions. Finally, it creates a shell script `config.status' that you can run in the future to recreate the current configuration, and a file `config.log' containing compiler output (useful mainly for debugging `configure'). It can also use an optional file (typically called `config.cache' and enabled with `--cache-file=config.cache' or simply `-C') that saves the results of its tests to speed up reconfiguring. Caching is disabled by default to prevent problems with accidental use of stale cache files. If you need to do unusual things to compile the package, please try to figure out how `configure' could check whether to do them, and mail diffs or instructions to the address given in the `README' so they can be considered for the next release. If you are using the cache, and at some point `config.cache' contains results you don't want to keep, you may remove or edit it. The file `configure.ac' (or `configure.in') is used to create `configure' by a program called `autoconf'. You need `configure.ac' if you want to change it or regenerate `configure' using a newer version of `autoconf'. The simplest way to compile this package is: 1. `cd' to the directory containing the package's source code and type `./configure' to configure the package for your system. Running `configure' might take a while. While running, it prints some messages telling which features it is checking for. 2. Type `make' to compile the package. 3. Optionally, type `make check' to run any self-tests that come with the package, generally using the just-built uninstalled binaries. 4. Type `make install' to install the programs and any data files and documentation. When installing into a prefix owned by root, it is recommended that the package be configured and built as a regular user, and only the `make install' phase executed with root privileges. 5. Optionally, type `make installcheck' to repeat any self-tests, but this time using the binaries in their final installed location. This target does not install anything. Running this target as a regular user, particularly if the prior `make install' required root privileges, verifies that the installation completed correctly. 6. You can remove the program binaries and object files from the source code directory by typing `make clean'. To also remove the files that `configure' created (so you can compile the package for a different kind of computer), type `make distclean'. There is also a `make maintainer-clean' target, but that is intended mainly for the package's developers. If you use it, you may have to get all sorts of other programs in order to regenerate files that came with the distribution. 7. Often, you can also type `make uninstall' to remove the installed files again. In practice, not all packages have tested that uninstallation works correctly, even though it is required by the GNU Coding Standards. 8. Some packages, particularly those that use Automake, provide `make distcheck', which can by used by developers to test that all other targets like `make install' and `make uninstall' work correctly. This target is generally not run by end users. Compilers and Options ===================== Some systems require unusual options for compilation or linking that the `configure' script does not know about. Run `./configure --help' for details on some of the pertinent environment variables. You can give `configure' initial values for configuration parameters by setting variables in the command line or in the environment. Here is an example: ./configure CC=c99 CFLAGS=-g LIBS=-lposix *Note Defining Variables::, for more details. Compiling For Multiple Architectures ==================================== You can compile the package for more than one kind of computer at the same time, by placing the object files for each architecture in their own directory. To do this, you can use GNU `make'. `cd' to the directory where you want the object files and executables to go and run the `configure' script. `configure' automatically checks for the source code in the directory that `configure' is in and in `..'. This is known as a "VPATH" build. With a non-GNU `make', it is safer to compile the package for one architecture at a time in the source code directory. After you have installed the package for one architecture, use `make distclean' before reconfiguring for another architecture. On MacOS X 10.5 and later systems, you can create libraries and executables that work on multiple system types--known as "fat" or "universal" binaries--by specifying multiple `-arch' options to the compiler but only a single `-arch' option to the preprocessor. Like this: ./configure CC="gcc -arch i386 -arch x86_64 -arch ppc -arch ppc64" \ CXX="g++ -arch i386 -arch x86_64 -arch ppc -arch ppc64" \ CPP="gcc -E" CXXCPP="g++ -E" This is not guaranteed to produce working output in all cases, you may have to build one architecture at a time and combine the results using the `lipo' tool if you have problems. Installation Names ================== By default, `make install' installs the package's commands under `/usr/local/bin', include files under `/usr/local/include', etc. You can specify an installation prefix other than `/usr/local' by giving `configure' the option `--prefix=PREFIX', where PREFIX must be an absolute file name. You can specify separate installation prefixes for architecture-specific files and architecture-independent files. If you pass the option `--exec-prefix=PREFIX' to `configure', the package uses PREFIX as the prefix for installing programs and libraries. Documentation and other data files still use the regular prefix. In addition, if you use an unusual directory layout you can give options like `--bindir=DIR' to specify different values for particular kinds of files. Run `configure --help' for a list of the directories you can set and what kinds of files go in them. In general, the default for these options is expressed in terms of `${prefix}', so that specifying just `--prefix' will affect all of the other directory specifications that were not explicitly provided. The most portable way to affect installation locations is to pass the correct locations to `configure'; however, many packages provide one or both of the following shortcuts of passing variable assignments to the `make install' command line to change installation locations without having to reconfigure or recompile. The first method involves providing an override variable for each affected directory. For example, `make install prefix=/alternate/directory' will choose an alternate location for all directory configuration variables that were expressed in terms of `${prefix}'. Any directories that were specified during `configure', but not in terms of `${prefix}', must each be overridden at install time for the entire installation to be relocated. The approach of makefile variable overrides for each directory variable is required by the GNU Coding Standards, and ideally causes no recompilation. However, some platforms have known limitations with the semantics of shared libraries that end up requiring recompilation when using this method, particularly noticeable in packages that use GNU Libtool. The second method involves providing the `DESTDIR' variable. For example, `make install DESTDIR=/alternate/directory' will prepend `/alternate/directory' before all installation names. The approach of `DESTDIR' overrides is not required by the GNU Coding Standards, and does not work on platforms that have drive letters. On the other hand, it does better at avoiding recompilation issues, and works well even when some directory options were not specified in terms of `${prefix}' at `configure' time. Optional Features ================= If the package supports it, you can cause programs to be installed with an extra prefix or suffix on their names by giving `configure' the option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'. Some packages pay attention to `--enable-FEATURE' options to `configure', where FEATURE indicates an optional part of the package. They may also pay attention to `--with-PACKAGE' options, where PACKAGE is something like `gnu-as' or `x' (for the X Window System). The `README' should mention any `--enable-' and `--with-' options that the package recognizes. For packages that use the X Window System, `configure' can usually find the X include and library files automatically, but if it doesn't, you can use the `configure' options `--x-includes=DIR' and `--x-libraries=DIR' to specify their locations. Some packages offer the ability to configure how verbose the execution of `make' will be. For these packages, running `./configure --enable-silent-rules' sets the default to minimal output, which can be overridden with `make V=1'; while running `./configure --disable-silent-rules' sets the default to verbose, which can be overridden with `make V=0'. Particular systems ================== On HP-UX, the default C compiler is not ANSI C compatible. If GNU CC is not installed, it is recommended to use the following options in order to use an ANSI C compiler: ./configure CC="cc -Ae -D_XOPEN_SOURCE=500" and if that doesn't work, install pre-built binaries of GCC for HP-UX. On OSF/1 a.k.a. Tru64, some versions of the default C compiler cannot parse its `' header file. The option `-nodtk' can be used as a workaround. If GNU CC is not installed, it is therefore recommended to try ./configure CC="cc" and if that doesn't work, try ./configure CC="cc -nodtk" On Solaris, don't put `/usr/ucb' early in your `PATH'. This directory contains several dysfunctional programs; working variants of these programs are available in `/usr/bin'. So, if you need `/usr/ucb' in your `PATH', put it _after_ `/usr/bin'. On Haiku, software installed for all users goes in `/boot/common', not `/usr/local'. It is recommended to use the following options: ./configure --prefix=/boot/common Specifying the System Type ========================== There may be some features `configure' cannot figure out automatically, but needs to determine by the type of machine the package will run on. Usually, assuming the package is built to be run on the _same_ architectures, `configure' can figure that out, but if it prints a message saying it cannot guess the machine type, give it the `--build=TYPE' option. TYPE can either be a short name for the system type, such as `sun4', or a canonical name which has the form: CPU-COMPANY-SYSTEM where SYSTEM can have one of these forms: OS KERNEL-OS See the file `config.sub' for the possible values of each field. If `config.sub' isn't included in this package, then this package doesn't need to know the machine type. If you are _building_ compiler tools for cross-compiling, you should use the option `--target=TYPE' to select the type of system they will produce code for. If you want to _use_ a cross compiler, that generates code for a platform different from the build platform, you should specify the "host" platform (i.e., that on which the generated programs will eventually be run) with `--host=TYPE'. Sharing Defaults ================ If you want to set default values for `configure' scripts to share, you can create a site shell script called `config.site' that gives default values for variables like `CC', `cache_file', and `prefix'. `configure' looks for `PREFIX/share/config.site' if it exists, then `PREFIX/etc/config.site' if it exists. Or, you can set the `CONFIG_SITE' environment variable to the location of the site script. A warning: not all `configure' scripts look for a site script. Defining Variables ================== Variables not defined in a site shell script can be set in the environment passed to `configure'. However, some packages may run configure again during the build, and the customized values of these variables may be lost. In order to avoid this problem, you should set them in the `configure' command line, using `VAR=value'. For example: ./configure CC=/usr/local2/bin/gcc causes the specified `gcc' to be used as the C compiler (unless it is overridden in the site shell script). Unfortunately, this technique does not work for `CONFIG_SHELL' due to an Autoconf bug. Until the bug is fixed you can use this workaround: CONFIG_SHELL=/bin/bash /bin/bash ./configure CONFIG_SHELL=/bin/bash `configure' Invocation ====================== `configure' recognizes the following options to control how it operates. `--help' `-h' Print a summary of all of the options to `configure', and exit. `--help=short' `--help=recursive' Print a summary of the options unique to this package's `configure', and exit. The `short' variant lists options used only in the top level, while the `recursive' variant lists options also present in any nested packages. `--version' `-V' Print the version of Autoconf used to generate the `configure' script, and exit. `--cache-file=FILE' Enable the cache: use and save the results of the tests in FILE, traditionally `config.cache'. FILE defaults to `/dev/null' to disable caching. `--config-cache' `-C' Alias for `--cache-file=config.cache'. `--quiet' `--silent' `-q' Do not print messages saying which checks are being made. To suppress all normal output, redirect it to `/dev/null' (any error messages will still be shown). `--srcdir=DIR' Look for the package's source code in directory DIR. Usually `configure' can determine that directory automatically. `--prefix=DIR' Use DIR as the installation prefix. *note Installation Names:: for more details, including other options available for fine-tuning the installation locations. `--no-create' `-n' Run the configure checks, but stop before creating any output files. `configure' also accepts some other, not widely useful, options. Run `configure --help' for more details. libspiro-20221101/Makefile.am000066400000000000000000000034101433036472700156320ustar00rootroot00000000000000# Makefile.am - Top level automakefile for libspiro SUBDIRS = . tests test_programs = call-test0 call-test1 call-test2 call-test3 call-test4 \ call-test5 call-test6 call-test7 call-test8 call-test9 \ call-test10 call-test11 call-test12 call-test13 \ call-test14 call-test15 call-test16 call-test17 \ call-test18 call-test19 call-test20 call-test21 \ call-testm pkgconfigdir = $(libdir)/pkgconfig pkgconfig_DATA = libspiro.pc ACLOCAL_AMFLAGS = -I m4 ${ACLOCAL_FLAGS} AM_CFLAGS = $(WCFLAGS) $(LS_CFLAGS) LIBTOOL_DEPS = @LIBTOOL_DEPS@ DISTCLEANFILES = libspiro.pc DISTCHECK_CONFIGURE_FLAGS = --disable-silent-rules --enable-verbose_lib --enable-test_inputs --enable-test-a-lot lib_LTLIBRARIES = libspiro.la libspiro_la_LIBADD = $(WLSLIB) $(LS_LIB) libspiro_la_LDFLAGS = -no-undefined -version-info $(LIBSPIRO_VERSION) libspiro_la_SOURCES = spiro.c bezctx.c spiroentrypoints.c \ bezctx.h bezctx_intf.h spiro.h spiro_intf.h spiroentrypoints.h EXTRA_DIST = bezctx.md README-RaphLevien README.md README-GeorgeWilliams \ closedspiro.png openspiro.png spiral16.png spiral32.png spiro-a.png \ java/ShowPlate.java java/Spiro.java java/SpiroBezierContext.java \ java/SpiroCanvas.java java/SpiroCP.java java/SpiroGeneralPath.java \ java/SpiroPointType.java m4/ax_check_compile_flag.m4 path5.png \ path6.png libspiro.3 include_HEADERS = bezctx.h spiro.h spiroentrypoints.h man_MANS = libspiro.3 libtool: $(LIBTOOL_DEPS) $(SHELL) ./config.status libtool check-valgrind: if HAVEVALGRIND $(MAKE); $(VALGRIND) --error-exitcode=1 $(builddir)/tests/unit-test (for arg in $(test_programs); do \ $(LIBTOOL) --mode=execute $(VALGRIND) --error-exitcode=1 $(builddir)/tests/$$(arg) ; \ done) else echo "install Valgrind, then run ./configure again" endif libspiro-20221101/NEWS000066400000000000000000000000001433036472700142650ustar00rootroot00000000000000libspiro-20221101/README000066400000000000000000000061431433036472700144640ustar00rootroot00000000000000LibSpiro is a shared library designed to give programs the ability to create smooth continuous curves based on a given set of codes and X,Y constraints. The main user(s) for Libspiro are Font editing programs such as FontForge, and graphical drawing programs such as GEGL, IPE (as well as an early fork used in InkScape). This library has strong potential in graphic and vector programs where users want beautiful curves translated into beziers curves. Developers interested in sharing and making use of LibSpiro will likely want to read (these README files too to understand how to use LibSpiro better): README-RaphLevien (ppedit 20070504) README-GeorgeWilliams (libspiro 20071029) There is a large amount of information and math on RaphLevien's website for developers interested in how LibSpiro works. Developers interested in example programs, can take a look at spiro.c found in FontForge, InkScape, or linking examples like GEGL, IPE or call-test.c (call-test.c is included with development files with this library). Maintainers =========== Developers interested in maintaining libspiro will need to fetch the latest config.guess and config.sub to ensure that libspiro will run on as many configurations as possible. Then update configure.ac to the next revision, and run 'make check', 'make dist', and 'make distcheck' to ensure all works. See git patch 'LibSpiro 20200505 - Version 1.1.0' for example patching. Configurable releases is based on first removing all non relevant files to reduce final tar file before running 'make dist', such as all hidden files and directories. The resulting file created by 'make dist' is then usually with -dist- in the filename so that distros that follow the release page are able to fetch the latest libspiro using their scripts. Example: libspiro-20200505.tar.gz is renamed as libspiro-dist-20200505.tar.gz Installation ============ Installing from Git master requires 2 preparatory steps: First, you need to create the `configure' script if you do not have it yet. This will require autoreconf and automake to build `configure'. > autoreconf -i > automake --foreign -Wall Second, you then use the usual steps to compile it. Various operating systems and setups will need `configure' options set. The INSTALLATION file has detailed info for `configure' options. Example install steps for Linux, FreeBSD, Win32/64 are shown below: Installing on Linux > ./configure > make > make check > sudo make install Installing on FreeBSD10 (using clang3.3 or 3.6) > ./configure --prefix=$(pwd)/BUILD > make clean > make > make install Installing on Windows 32-bit > ./configure --host=i686-w64-mingw32 --prefix=$(pwd)/build-w32 > make clean > make > make install Installing on Windows 64-bit > ./configure --host=x86_64-w64-mingw32 --prefix=$(pwd)/build-w64 > make clean > make > make install NOTE: Some Distros and Operating Systems may require you to run 'ldconfig' to recognize LibSpiro if you are not rebooting your computer first before installing another program that depends on LibSpiro. To do this, you may need to run 'ldconfig' in 'su -' mode after you have done 'make install': $ su - # ldconfig # exit $ libspiro-20221101/README-GeorgeWilliams000066400000000000000000000007271433036472700173760ustar00rootroot00000000000000This is a shared library designed to give FontForge (and others) access to Raph Levien's spiro splines. You may (possibly) be able to obtain more recent versions of Spiro from http://levien.com/garden/ppedit/ use the get-spiro-src.sh script to do so. To build, type ./configure make make install Currently I extract very little from spiro, just the bare minimum to convert a series of (marked) points to a set of cubic bezier curves which ff can use. libspiro-20221101/README-RaphLevien000066400000000000000000000064401433036472700165170ustar00rootroot00000000000000README for ppedit Raph Levien 4 May 2007 ppedit is my prototype application for editing curves using my curvature-continuous spirals. While I have used this code to draw many font outlines, it is very rough around the edges, and is far from a polished tool. == License and patent grant == All code in this package is released under the terms of the GNU GPL, version 2 or later, at your choice. Further, there is a provisional patent application filed for the underlying curve technology. The following patent grant applies to any patent which may be issued as a result of that application: Whereas, Raph Levien (hereinafter "Inventor") has obtained patent protection for related technology (hereinafter "Patented Technology"), Inventor wishes to aid the the GNU free software project in achieving its goals, and Inventor also wishes to increase public awareness of Patented Technology, Inventor hereby grants a fully paid up, nonexclusive, irrevocable, royalty free license to practice the patents listed below ("the Patents") if and only if practiced in conjunction with software distributed under the terms of any version of the GNU General Public License as published by the Free Software Foundation, 59 Temple Place, Suite 330, Boston, MA 02111. Inventor reserves all other rights, including without limitation, licensing for software not distributed under the GNU General Public License. == Building == The main build supported right now is the Gtk2/cairo one. There's also a Mac build and a Gtk1 one, but those aren't guaranteed to work. 1. Make sure you've got ../x3/ in a directory parallel to ppedit. If you've unpacked from a tarball, this should be the case already. From darcs, use: darcs get http://levien.com/garden/x3 2. make 3. The binary is ppedit == Using == The numeric keys 1-6 select the mode. 1 is selection, 2-6 select different point modes: 2: Add G4-continuous curve point 3: Add corner point 4: Add left-facing one-way point 5: Add right-facing one-way point 6: Add G2-continuous curve point Note: Dave Crossland has a set of alternate keybindings which are probably faster. == Plate files == Ctrl-S saves a plate file in a file of the name 'plate'. Additionally, a plate file can be given as a command line argument. The file uses simple S-expressions, with a one-character code for each point, then the X and Y coordinates - 0,0 is top left. Here's the cap U from Inconsolata, for example: (plate (v 68 78) (v 159 78) (o 158 92) ([ 148 115) (] 148 552) (o 298 744) ([ 459 549) (v 459 78) (v 536 78) (] 536 547) (o 295 813) ([ 68 551) (z) ) v: corner o: g4 c: g2 [: left-facing one-way ]: right-facing one-way == Conversion to PostScript == Ctrl-P converts to PostScript, saving '/tmp/foo.ps'. Other utilities can convert that representation into FontForge, and also optimize the Beziers. == Stability == The spline solver in this release is _not_ numerically robust. When you start drawing random points, you'll quickly run into divergence. However, "sensible" plates based on real fonts usually converge. Some tips: 1. Huge changes of angle are likely to diverge. 2. For the first two or three points, G4 points are likelier to converge than G2's. For longer segments, G2 is more likely. 3. Start on a curve point. A more numerically robust approach is in the works. libspiro-20221101/README.md000066400000000000000000000376721433036472700150760ustar00rootroot00000000000000# Spiro ![](spiral32.png) [![Coverity Scan Build Status](https://scan.coverity.com/projects/794/badge.svg?flat=1)](https://scan.coverity.com/projects/794) ## Introduction ![](spiro-a.png) Spiro is the creation of [Raph Levien (ppedit 20070504, GPL2+)](http://www.levien.com/). It simplifies the drawing of beautiful curves. LibSpiro is an adaptation of Spiro formula and functions into a sharable library [George Williams (libspiro 20071029, GPL2+)](http://libspiro.sourceforge.net/). Using Bézier splines an artist can easily draw curves with the same slope on either side of an on-curve point. Spiros, on the other hand, are based on clothoid splines which make it easy to maintain constant curvature as well as constant slope. Such curves will simply look nicer. Raph Levien's spiro splines only use on-curve points and so are easier to use and more intuitive to the artist. This library will take an array of spiro control points and convert them into a series of Bézier splines which can then be used in the myriad of ways the world has come to use Béziers. ## Installation Installing from Git master requires 2 preparatory steps: First, you need to create the ./configure script if you do not have it yet ```sh autoreconf -i (or use 'autoreconf --install --force' for more modern setups) automake --foreign -Wall ``` Second, you then use the usual steps to compile the library. Various operating systems and setups will need ./configure options set. The INSTALLATION file has detailed info for `configure' options. Example install steps for Linux, FreeBSD, Win32/64 are shown below: Installing on Linux ```sh ./configure make make check sudo make install ``` Installing on FreeBSD ```sh ./configure --prefix=$(pwd)/BUILD make clean make make install ``` Installing on Windows 32-bit ```sh ./configure --host=i686-w64-mingw32 --prefix=$(pwd)/build-w32 make clean make make install ``` Installing on Windows 64-bit ```sh ./configure --host=x86_64-w64-mingw32 --prefix=$(pwd)/build-w64 make clean make make install ``` NOTE: Some Distros and Operating Systems may require you to run 'ldconfig' to recognize libspiro if you are not rebooting your computer first before installing another program that depends on libspiro. To do this, you may need to run 'ldconfig' in 'su -' mode after you have done 'make install': ```sh $ su - # ldconfig # exit $ ``` ## Usage ### In FontForge FontForge will autodetect libspiro when it is installed in the usual way. An exception to this is with the Mac bundled version (where `FontForge.app` is copied to `/Applications`). To install your compiled version into the bundle, run ```sh ./configure --prefix=/Applications/FontForge.app/Contents/Resources/opt/local/ ``` #### Crash Reporting Mac OS X: A helping script, `./fontforge.sh` is provided to run FontForge inside a debugger to get useful information on solving crashes. An example issue is at https://github.com/fontforge/libspiro/issues/4 # Developing ### Two methods of using libspiro in your programs - [C](#programming-with-libspiro-in-c) - [Java](#programming-with-libspiro-in-java) ### Programming with libspiro in C - Basic Types - [spiro control point](#the-spiro-control-point) - [ncq control value](#the-ncq-control-value) - [Bézier context](#the-bezier-context) - [Header file](#calling-into-libspiro) - Entry points - int [SpiroCPsToBezier2](#spirocpstobezier2)(spiro_cp *,int n,int ncq,int is_closed,bezctx *) - int [TaggedSpiroCPsToBezier2](#taggedspirocpstobezier2)(spiro_cp *,int ncq,bezctx *) #### Basic Types #### The spiro control point ```c typedef struct { double x; double y; char ty; } spiro_cp; /* Possible values of the "ty" field. */ #define SPIRO_CORNER 'v' #define SPIRO_G4 'o' #define SPIRO_G2 'c' #define SPIRO_LEFT '[' #define SPIRO_RIGHT ']' #define SPIRO_ANCHOR 'a' #define SPIRO_HANDLE 'h' /* For a closed contour add an extra cp with a ty set to */ #define SPIRO_END 'z' /* For an open contour the first cp must have a ty set to*/ #define SPIRO_OPEN_CONTOUR '{' /* For an open contour the last cp must have a ty set to */ #define SPIRO_END_OPEN_CONTOUR '}' ``` A spiro control point contains a location and a point type. There are six basic types of spiro control points: - A corner point – where the slopes and curvatures of the incoming and outgoing splines are unconstrained - A G4 curve point – Continuous up to the fourth derivative - A G2 curve point – Continuous up to the second derivative. - A left constraint point – Used to connect a curve to a straight line - A right constraint point – Used to connect a straight line to a curve. If you have a contour which is drawn clockwise, and you have a straight segment at the top, then the left point of that straight segment should be a left constraint, and the right point should be a right constraint. - An anchor - Is a knot point with a fixed angle (followed by the handle cp which creates the angle). The anchor behaves as both left and right constraint points at one single point. The left constraint, right constraint, anchor and handle points are easiest explained using examples from path5 and path6 which are tested in tests/call-test5.c and tests/call-test6.c ![](path5.png) ![](path6.png) ```c path5[] path6[] { 0, 0,'{'}, { 0, 0,'{'}, {100, 100,'c'}, {100, 100,'c'}, {200, 200,'['}, {200, 200,'a'}, {300, 200,']'}, {300, 200,'h'}, {400, 150,'c'}, {300, 150,'c'}, {300, 100,'['}, {200, 100,'a'}, {200, 100,']'}, {150, 100,'h'}, {150, 50,'c'}, {150, 50,'c'}, {100, 0,'['}, {100, 0,'a'}, { 0,-100,']'}, { 0,-100,'h'}, {-50,-200,'c'}, { 50,-100,'c'}, {-80,-250,'}'}, { 20,-150,'}'}, ``` ## The ncq control value There is a need to pass additional information to libspiro, and therefore the 'ncq' value was added. 'ncq' can be thought of as toggle switches telling libspiro how to work with the source spiro control points. Below is the current toggle switch definitions, and default 'ncq' value is zero. ```c /* int ncq flags and values */ #define SPIRO_INCLUDE_LAST_KNOT 0x0100 #define SPIRO_INTERNAL_BEZCTX 0x0200 #define SPIRO_RETRO_VER1 0x0400 #define SPIRO_REVERSE_SRC 0x0800 #define SPIRO_ARC_CUB_QUAD_CLR 0x7FFF #define SPIRO_ARC_CUB_QUAD_MASK 0x7000 #define SPIRO_CUBIC_TO_BEZIER 0x0000 #define SPIRO_CUBIC_MIN_MAYBE 0x1000 #define SPIRO_ARC_MAYBE 0x2000 #define SPIRO_ARC_MIN_MAYBE 0x3000 #define SPIRO_QUAD0_TO_BEZIER 0x4000 ``` The definitions for ncq (above) are: SPIRO_INCLUDE_LAST_KNOT: Existing libspiro behaviour is to add a knot point to match each spiro point, but does not include the last knot. This option includes the last knot with the existing output results while the spiro is still open. Closed spiros should refer to the first knot point since the last and first knot are the same. SPIRO_INTERNAL_BEZCTX: This provides a simpler interface for developers having trouble with the main libspiro interface. With this method, two new functions are also provided and needed here. - 1st, the calling program creates an oversized array for the results using function "new_ls_bezctx()", - 2nd, the calling program calls libspiro to create a curve result using "TaggedSpiroCPsToBezier2()" or "SpiroCPsToBezier2()", - 3rd, the calling program can resize the array to use less memory, or release the array using if it is not needed any more using "free_ls_bezctx()". File "tests/call-test21.c" has sample code showing how this can be done. SPIRO_RETRO_VER1: This newer version of libspiro (2019 and later) has modified the way path calculations are made. The reason for this was seen as an advantage, because it allows a user to scale and move spiro paths, which is a common expectation in graphics, and there are other added advantages, such as making the path as part of templates, and more. An effort was made to keep results as close to original as possible, but this was not possible due to scaling factors in the calculations. As the main user for libspiro is FontForge, users such as font designers may see the least change since scaling targets x={0..1000}, y={0..1000}, while other users in graphics may see changes since they can be using scales much larger than 1000. The good news here is 'SPIRO_RETRO_VER1' allows the user to toggle libspiro to use the older calculation method if the user needs backwards compatibility, otherwise, leaving this off allows spiros to use the new calculation method which allows scaling and moving spiro paths. Older programs that use the older libspiro interfaces will see no-change since they use the older calculation method to maintain backwards compatibility. SPIRO_REVERSE_SRC: There may be a need to reverse the spiro path direction. This option edits the source spiro path, and reverses the information, then proceeds to continue doing libspiro calculations with the reversed path. When libspiro is done calculating bézier output, you will also have a reversed (input) spiro path, therefore save the new spiro path if you need it. This simplifies this process for the calling program to a simple option 'SPIRO_REVERSE_SRC', and the results are up to date as per this version of libspiro. NOTE - libspiro calculations are a one-way calculation, so you are not likely to see the same results in the reverse spiro path direction, but if you need this option, it is available here. SPIRO_CUBIC_TO_BEZIER: LibSpiro default action is to create cubic bézier curves. SPIRO_CUBIC_MIN_MAYBE: Cubic arcs can potentially be made with greater bends and less points. SPIRO_ARC_MAYBE and SPIRO_ARC_MIN_MAYBE: Instead of the default cubic output, this exposes the midpoint, which might be useful to someone. SPIRO_QUAD0_TO_BEZIER: Rough approximation of quadratic to bézier curves. Knot points will have smooth connection but midpoints may be visually okay or not. #### The bezier context ```c struct _bezctx { /* Called by spiro to start a contour */ void (*moveto)(bezctx *bc, double x, double y, int is_open); /* Called by spiro to move from the last point to the next one on a straight line */ void (*lineto)(bezctx *bc, double x, double y); /* Called by spiro to move from the last point to the next along a quadratic bézier spline */ /* (x1,y1) is the quadratic bézier control point and (x2,y2) will be the new end point */ void (*quadto)(bezctx *bc, double x1, double y1, double x2, double y2); /* Called by spiro to move from the last point to the next along a cubic bézier spline */ /* (x1,y1) and (x2,y2) are the two off-curve control point and (x3,y3) will be the new end point */ void (*curveto)(bezctx *bc, double x1, double y1, double x2, double y2, double x3, double y3); /* Called by spiro to notify calling function this is a knot point */ void (*mark_knot)(bezctx *bc, int knot_idx); }; ``` You must create a super-class of this abstract type that handles the creation of your particular representation of bézier splines. As an [example I provide the one used by Raph to generate PostScript output](bezctx.md) (cubic béziers). Spiro will convert a set of spiro_cps into a set of bézier curves. As it does so it will call the appropriate routine in your bézier context with this information – this should allow you to create your own internal representation of those curves. #### Calling into libspiro Your program needs this Libspiro header file: ```c #include ``` You must define a bézier context that is appropriate for your internal splines (See [Raph's PostScript example](bezctx.md)). #### SpiroCPsToBezier2 You must create an array of spiro control points: ```c spiro_cp points[4]; /* This defines something very like a circle, centered at the origin with radius 100 */ points[0].x = -100; points[0].y = 0; points[0].ty = SPIRO_G4; points[1].x = 0; points[1].y = 100; points[1].ty = SPIRO_G4; points[2].x = 100; points[2].y = 0; points[2].ty = SPIRO_G4; points[3].x = 0; points[3].y = -100; points[3].ty = SPIRO_G4; ``` ![](closedspiro.png) Then call `SpiroCPsToBezier2`, a routine which takes 5 arguments and returns bc and an integer pass/fail flag. 1. An array of input spiros 2. The number of elements in the spiros array (this example has 4) 3. Additional ncq control variable (default==0) 4. Whether this describes a closed (True=1) or open (False=0) contour 5. A bézier results output context 6. An integer success flag. 1 = completed task and have valid bézier results, or 0 = unable to complete task, bézier results are invalid. ```c bc = new_bezctx_ps(); success = SpiroCPsToBezier2(points,4,ncq,True,bc) bezctx_ps_close(bc); ``` #### TaggedSpiroCPsToBezier2 Or call `TaggedSpiroCPsToBezier2`. This routine requires that the array of spiro control points be tagged according to Raph's internal conventions. A closed curve will have an extra control point attached to the end of it with a type of `SPIRO_END`; ```c spiro_cp points[5]; points[0].x = -100; points[0].y = 0; points[0].ty = SPIRO_G4; points[1].x = 0; points[1].y = 100; points[1].ty = SPIRO_G4; points[2].x = 100; points[2].y = 0; points[2].ty = SPIRO_G4; points[3].x = 0; points[3].y = -100; points[3].ty = SPIRO_G4; points[4].x = 0; points[4].y = 0; points[4].ty = SPIRO_END; ``` (The x,y location of this last SPIRO_END point is irrelevant). An open curve will have the type of the first control point set to `SPIRO_OPEN_CONTOUR` and the last to `SPIRO_END_OPEN_CONTOUR`. ```c spiro_cp points[4]; points[0].x = -100; points[0].y = 0; points[0].ty = SPIRO_OPEN_CONTOUR; points[1].x = 0; points[1].y = 100; points[1].ty = SPIRO_G4; points[2].x = 100; points[2].y = 0; points[2].ty = SPIRO_G4; points[3].x = 0; points[3].y = -100; points[3].ty = SPIRO_END_OPEN_CONTOUR; ``` ![](openspiro.png) (In an open contour the point types of the first and last control points are going to be ignored). In this case there is no need to provide a point count nor an open/closed contour flag. That information can be obtained from the control points themselves. So `TaggedSpiroCPsToBezier2` only takes 3 arguments and returns bc and an integer pass/fail flag. 1. An array of input spiros 2. A bézier results output context 3. Additional ncq control variable (default==0) 4. An integer success flag. 1 = completed task and have valid bézier results, or 0 = unable to complete task, bézier results are invalid. ```c bc = new_bezctx_ps(); success = TaggedSpiroCPsToBezier2(points,ncq,bc) bezctx_ps_close(bc); ``` ### Programming with libspiro in Java **CAVEAT:** I'm not proficient in Java. ### Classes - `SpiroPointType` – this is an enumerated type which defines the same pointtypes used by the C interface: `CORNER`, `G4`, `G2`, `LEFT`, `RIGHT`, `END`, `OPEN`, `OPEN_END` - `SpiroCP` ```java public class SpiroCP { public double x,y; SpiroPointType type; public SpiroCP(double xx, double yy, SpiroPointType ty); public String toString(); } ``` - `SpiroBezierContext` – a Java interface used in conversion of an array of SpiroCPs to a Bézier contour. ```java public interface SpiroBezierContext { void MoveTo(double x, double y, boolean isOpen); void LineTo(double x, double y); void QuadTo(double x1, double y1, double x2, double y2); void CubicTo(double x1, double y1, double x2, double y2, double x3, double y3); void MarkKnot(int knotIdx); } ``` - `Spiro` – a class with only static members: ```java public class Spiro { // takes an array of SpiroCPs and converts to a Bézier static public void SpiroCPsToBezier(SpiroCP [] spiros,int n,boolean isclosed, SpiroBezierContext bc); // takes an array of SpiroCPs (the array contains its own terminator and indication of whether the contour is open or closed) static public void TaggedSpiroCPsToBezier(SpiroCP [] spiros,SpiroBezierContext bc); // Two routines for reading and writing one of Raph's plate files static public void SavePlateFile(Writer output,SpiroCP [][] spirocontours) throws IOException; static public SpiroCP [][] ReadPlateFile(BufferedReader input) throws IOException; } ``` libspiro-20221101/bezctx.c000066400000000000000000000120641433036472700152460ustar00rootroot00000000000000/* libspiro - A sharable library of Spiro formula and functions. This file is a fork from ppedit for use by the libspiro project. Please see Changelog or git history for description of changes. ============================================================= ppedit - A pattern plate editor for Spiro splines. Copyright (C) 2007 Raph Levien libspiro - A sharable library of Spiro formula and functions. Copyright (C) 2007... George Williams (libspiro fork) Copyright (C) 2013... Joe Da Silva (improvements...) 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #include "spiro-config.h" #include #include #ifdef VERBOSE #include #endif #include "spiroentrypoints.h" #include "bezctx.h" #include "spiro_intf.h" #include "bezctx_intf.h" LS_DLL_EXPORT ls_bezctx *new_ls_bezctx(int max, int ncq) { ls_bezctx *r; if ( (ncq&SPIRO_INTERNAL_BEZCTX)==0 || max<1 || \ (r=(ls_bezctx *)calloc(1,sizeof(ls_bezctx)))==NULL ) { #ifdef VERBOSE printf("error: new_ls_bezctx() memory\n"); #endif return NULL; } if ( (r->cd=(curve_data *)malloc(max*sizeof(curve_data)))==NULL ) { #ifdef VERBOSE printf("error: new_ls_bezctx() memory\n"); #endif free(r); } else { r->l = 0; r->max = max; #ifdef VERBOSE printf("new_ls_bezctx() created new space\n"); #endif } return r; } LS_DLL_EXPORT void free_ls_bezctx(ls_bezctx *bd) { free(bd->cd); free(bd); } static int prep_row_bc(ls_bezctx *bd) { double x,y; int i; char t; i = bd->l; if ( i < 0 ) return 0; if ( i >= bd->max || bd->max < 1 ) { bd->l = -1; /* error: too big! not enough array! */ return 0; } if ( i ) { t = bd->cd[i - 1].ty; switch ( t ) { case 'k': x = bd->cd[i - 1].x0; y = bd->cd[i - 1].y0; break; case 'l': case 'm': x = bd->cd[i - 1].x1; y = bd->cd[i - 1].y1; break; case 'q': x = bd->cd[i - 1].x2; y = bd->cd[i - 1].y2; break; case 'c': x = bd->cd[i - 1].x3; y = bd->cd[i - 1].y3; break; default: x = y = 0.0; } bd->cd[i].x0 = x; bd->cd[i].y0 = y; } else bd->cd[0].x0 = bd->cd[0].y0 = 0.0; return 1; } LS_DLL_LOCAL void bezctx_moveto(bezctx *bc, double x, double y, int is_open, int si) { #ifdef VERBOSE printf("moveto(%g,%g)_%d\n",x,y,is_open); #endif if ( si ) { ls_bezctx *bd = (ls_bezctx *)(bc); if ( prep_row_bc(bd) ) { int i = bd->l; bd->cd[i].x1 = x; bd->cd[i].y1 = y; bd->cd[i].x2 = bd->cd[i].y2 = bd->cd[i].x3 = bd->cd[i].y3 = 0.0; bd->cd[i].ty = 'm'; i++; bd->l = i; bd->is_open = is_open; } } else bc->moveto(bc, x, y, is_open); } LS_DLL_LOCAL void bezctx_lineto(bezctx *bc, double x, double y, int si) { #ifdef VERBOSE printf("lineto(%g,%g)\n",x,y); #endif if ( si ) { ls_bezctx *bd = (ls_bezctx *)(bc); if ( prep_row_bc(bd) ) { int i = bd->l; bd->cd[i].x1 = x; bd->cd[i].y1 = y; bd->cd[i].x2 = bd->cd[i].y2 = bd->cd[i].x3 = bd->cd[i].y3 = 0.0; bd->cd[i].ty = 'l'; i++; bd->l = i; } } else bc->lineto(bc, x, y); } LS_DLL_LOCAL void bezctx_quadto(bezctx *bc, double x1, double y1, double x2, double y2, int si) { #ifdef VERBOSE printf("quadto(%g,%g, %g,%g)\n",x1,y1,x2,y2); #endif if ( si ) { ls_bezctx *bd = (ls_bezctx *)(bc); if ( prep_row_bc(bd) ) { int i = bd->l; bd->cd[i].x1 = x1; bd->cd[i].y1 = y1; bd->cd[i].x2 = x2; bd->cd[i].y2 = y2; bd->cd[i].x3 = bd->cd[i].y3 = 0.0; bd->cd[i].ty = 'q'; i++; bd->l = i; } } else bc->quadto(bc, x1, y1, x2, y2); } LS_DLL_LOCAL void bezctx_curveto(bezctx *bc, double x1, double y1, double x2, double y2, \ double x3, double y3, int si) { #ifdef VERBOSE printf("curveto(%g,%g, %g,%g, %g,%g)\n",x1,y1,x2,y2,x3,y3); #endif if ( si ) { ls_bezctx *bd = (ls_bezctx *)(bc); if ( prep_row_bc(bd) ) { int i = bd->l; bd->cd[i].x1 = x1; bd->cd[i].y1 = y1; bd->cd[i].x2 = x2; bd->cd[i].y2 = y2; bd->cd[i].x3 = x3; bd->cd[i].y3 = y3; bd->cd[i].ty = 'c'; i++; bd->l = i; } } else bc->curveto(bc, x1, y1, x2, y2, x3, y3); } LS_DLL_LOCAL void bezctx_mark_knot(bezctx *bc, int knot_idx, int si) { #ifdef VERBOSE printf("mark_knot()_%d\n",knot_idx); #endif if ( si ) { ls_bezctx *bd = (ls_bezctx *)(bc); if ( prep_row_bc(bd) ) { int i = bd->l; bd->cd[i].x1 = bd->cd[i].y1 = bd->cd[i].x2 = bd->cd[i].y2 = \ bd->cd[i].x3 = bd->cd[i].y3 = 0.0; bd->cd[i].ty = 'k'; i++; bd->l = i; } } else if (bc->mark_knot) bc->mark_knot(bc, knot_idx); } libspiro-20221101/bezctx.h000066400000000000000000000033101433036472700152450ustar00rootroot00000000000000/* bezctx.h libspiro - A sharable library of Spiro formula and functions. */ #ifndef _BEZCTX_H #define _BEZCTX_H #ifdef __cplusplus extern "C" { #endif /* NOTE: The Bezier context; You must create a super-class of this abstract type that */ /* handles the creation of your particular representation of bézier splines. You will */ /* see examples and information in file bezctx.md */ typedef struct _bezctx bezctx; struct _bezctx { /* Called by spiro to start a contour */ void (*moveto)(bezctx *bc, double x, double y, int is_open); /* Called by spiro to move from the last point to the next one on a straight line */ void (*lineto)(bezctx *bc, double x, double y); /* Called by spiro to move from the last point to the next along a quadratic bezier spline */ /* (x1,y1) is the quadratic bezier control point and (x2,y2) will be the new end point */ void (*quadto)(bezctx *bc, double x1, double y1, double x2, double y2); /* Called by spiro to move from the last point to the next along a cubic bezier spline */ /* (x1,y1) and (x2,y2) are the two off-curve control point and (x3,y3) will be the new end point */ void (*curveto)(bezctx *bc, double x1, double y1, double x2, double y2, double x3, double y3); void (*mark_knot)(bezctx *bc, int knot_idx); }; /* If you are using ncq definition "SPIRO_INTERNAL_BEZCTX", you also need these below */ typedef struct { char ty; /* curve type */ double x0,y0,x1,y1,x2,y2,x3,y3; } curve_data; typedef struct { bezctx base; /* reserved */ curve_data *cd; /* bezier curve data */ int l; /* array data length */ int max; /* max array allowed */ int is_open; } ls_bezctx; #ifdef __cplusplus } #endif #endif libspiro-20221101/bezctx.md000066400000000000000000000225071433036472700154270ustar00rootroot00000000000000# The Bézier context ```c struct _bezctx { void (*moveto)(bezctx *bc, double x, double y, int is_open); void (*lineto)(bezctx *bc, double x, double y); void (*quadto)(bezctx *bc, double x1, double y1, double x2, double y2); void (*curveto)(bezctx *bc, double x1, double y1, double x2, double y2, double x3, double y3); void (*mark_knot)(bezctx *bc, int knot_idx); }; ``` You must create a super-class of this abstract type that handles the creation of your particular representation of bézier splines. I provide two examples here, one is the type Raph created for doing output to encapsulated postscript files, and the other is the type fontforge uses internally for converting from spiros into its native spline format. ## PostScript First a header file. This declares a routine which will create a PostScript bézier context – this routine takes a file argument, splines will be written to the file as we gather more information. ```c /* bezctx_ps.h */ const char *ps_prolog; /* A string to be written to the file before conversion */ const char *ps_postlog; /* A string to be written to the file after conversion */ bezctx *new_bezctx_ps(FILE *f); void bezctx_ps_close(bezctx *bc); ``` Then the file itself. ```c /* bezctx_ps.c */ /* ppedit - A pattern plate editor for Spiro splines. Copyright (C) 2007 Raph Levien 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include "zmisc.h" #include "bezctx.h" #include "bezctx_ps.h" typedef struct { bezctx base; /* This is a superclass of bezctx, and this is the entry for the base */ int is_open; double x, y; FILE *f; } bezctx_ps; const char *ps_prolog = "%!PS\n" "/m { moveto } bind def\n" "/l { lineto } bind def\n" "/c { curveto } bind def\n" "/z { closepath } bind def\n" "1 -1 scale\n" "0 -792 translate\n"; const char *ps_postlog = "stroke\n" "showpage\n"; /* This routine starts a new contour */ static void bezctx_ps_moveto(bezctx *z, double x, double y, int is_open) { bezctx_ps *bc = (bezctx_ps *)z; if (!bc->is_open) fprintf(bc->f, "z\n"); fprintf(bc->f, "%g %g m\n", x, y); bc->is_open = is_open; bc->x = x; bc->y = y; } /* This routine creates a linear spline from the previous point specified to this one */ void bezctx_ps_lineto(bezctx *z, double x, double y) { bezctx_ps *bc = (bezctx_ps *)z; fprintf(bc->f, "%g %g l\n", x, y); bc->x = x; bc->y = y; } /* This could create a quadratic spline, except PostScript only is prepared to deal with */ /* cubics, so convert the quadratic into the equivalent cubic */ void bezctx_ps_quadto(bezctx *z, double xm, double ym, double x3, double y3) { bezctx_ps *bc = (bezctx_ps *)z; double x0, y0; double x1, y1; double x2, y2; x0 = bc->x; y0 = bc->y; x1 = xm + (1./3) * (x0 - xm); y1 = ym + (1./3) * (y0 - ym); x2 = xm + (1./3) * (x3 - xm); y2 = ym + (1./3) * (y3 - ym); fprintf(bc->f, "%g %g %g %g %g %g c\n", x1, y1, x2, y2, x3, y3); bc->x = x3; bc->y = y3; } /* And this creates a cubic */ void bezctx_ps_curveto(bezctx *z, double x1, double y1, double x2, double y2, double x3, double y3) { bezctx_ps *bc = (bezctx_ps *)z; fprintf(bc->f, "%g %g %g %g %g %g c\n", x1, y1, x2, y2, x3, y3); bc->x = x3; bc->y = y3; } /* Allocates and initializes a new PostScript bézier context */ bezctx * new_bezctx_ps(FILE *f) { bezctx_ps *result = znew(bezctx_ps, 1); result->base.moveto = bezctx_ps_moveto; result->base.lineto = bezctx_ps_lineto; result->base.quadto = bezctx_ps_quadto; result->base.curveto = bezctx_ps_curveto; result->base.mark_knot = NULL; result->is_open = 1; result->f = f; return &result->base; } /* Finishes an old PostScript bézier context */ void bezctx_ps_close(bezctx *z) { bezctx_ps *bc = (bezctx_ps *)z; if (!bc->is_open) fprintf(bc->f, "z\n"); zfree(bc); } ``` ## FontForge First the header file. This declares a routine which will create a fontforge bézier context, and another which will finish off (and free) the context. This last routine returns a collection of splines, a splineset, fontforge's internal bézier contour type. ```c /* bezctx_ff.h */ #include "spiroentrypoints.h" #include "bezctx.h" bezctx *new_bezctx_ff(void); struct splineset; struct splineset *bezctx_ff_close(bezctx *bc); ``` Then the file itself. ```c /* bezctx_ff.c */ #include "bezctx_ff.h" #include "pfaeditui.h" #ifdef HAVE_IEEEFP_H # include /* Solaris defines isnan in ieeefp rather than math.h */ #else # include #endif typedef struct { bezctx base; /* This is a superclass of bezctx, and this is the entry for the base */ int is_open; int gotnans; /* Sometimes spiro fails to converge and we get NaNs. Complain the first */ /* time this happens, but not thereafter */ SplineSet *ss; /* The fontforge contour which we build up as we go along */ } bezctx_ff; static void nancheck(bezctx_ff *bc) { if ( !bc->gotnans ) { /* Called when we get passed a NaN. Complain the first time that happens */ LogError("Spiros did not converge" ); bc->gotnans = true; } } /* This routine starts a new contour */ /* So we allocate a new SplineSet, and then add the first point to it */ static void bezctx_ff_moveto(bezctx *z, double x, double y, int is_open) { bezctx_ff *bc = (bezctx_ff *)z; if ( !finite(x) || !finite(y)) { /* Protection against NaNs */ nancheck(bc); x = y = 0; } if (!bc->is_open) { SplineSet *ss = chunkalloc(sizeof(SplineSet)); ss->next = bc->ss; bc->ss = ss; } bc->ss->first = bc->ss->last = SplinePointCreate(x,y); bc->is_open = is_open; } /* This routine creates a linear spline from the previous point specified to this one */ static void bezctx_ff_lineto(bezctx *z, double x, double y) { bezctx_ff *bc = (bezctx_ff *)z; SplinePoint *sp; if ( !finite(x) || !finite(y)) { nancheck(bc); x = y = 0; } sp = SplinePointCreate(x,y); SplineMake3(bc->ss->last,sp); bc->ss->last = sp; } /* This could create a quadratic spline, except fontforge only is prepared to deal with */ /* cubics, so convert the quadratic into the equivalent cubic */ static void bezctx_ff_quadto(bezctx *z, double xm, double ym, double x3, double y3) { bezctx_ff *bc = (bezctx_ff *)z; double x0, y0; double x1, y1; double x2, y2; SplinePoint *sp; if ( !finite(xm) || !finite(ym) || !finite(x3) || !finite(y3)) { nancheck(bc); xm = ym = x3 = y3 = 0; } sp = SplinePointCreate(x3,y3); x0 = bc->ss->last->me.x; y0 = bc->ss->last->me.y; x1 = xm + (1./3) * (x0 - xm); y1 = ym + (1./3) * (y0 - ym); x2 = xm + (1./3) * (x3 - xm); y2 = ym + (1./3) * (y3 - ym); bc->ss->last->nextcp.x = x1; bc->ss->last->nextcp.y = y1; bc->ss->last->nonextcp = false; sp->prevcp.x = x2; sp->prevcp.y = y2; sp->noprevcp = false; SplineMake3(bc->ss->last,sp); bc->ss->last = sp; } /* And this creates a cubic */ static void bezctx_ff_curveto(bezctx *z, double x1, double y1, double x2, double y2, double x3, double y3) { bezctx_ff *bc = (bezctx_ff *)z; SplinePoint *sp; if ( !finite(x1) || !finite(y1) || !finite(x2) || !finite(y2) || !finite(x3) || !finite(y3)) { nancheck(bc); x1 = y1 = x2 = y2 = x3 = y3 = 0; } sp = SplinePointCreate(x3,y3); bc->ss->last->nextcp.x = x1; bc->ss->last->nextcp.y = y1; bc->ss->last->nonextcp = false; sp->prevcp.x = x2; sp->prevcp.y = y2; sp->noprevcp = false; SplineMake3(bc->ss->last,sp); bc->ss->last = sp; } /* Allocates and initializes a new fontforge bézier context */ bezctx * new_bezctx_ff(void) { bezctx_ff *result = chunkalloc(sizeof(bezctx_ff)); result->base.moveto = bezctx_ff_moveto; result->base.lineto = bezctx_ff_lineto; result->base.quadto = bezctx_ff_quadto; result->base.curveto = bezctx_ff_curveto; result->base.mark_knot = NULL; result->is_open = 0; result->gotnans = 0; result->ss = NULL; return &result->base; } /* Finishes an old fontforge bézier context, and returns the contour which was created */ struct splinepointlist * bezctx_ff_close(bezctx *z) { bezctx_ff *bc = (bezctx_ff *)z; SplineSet *ss = bc->ss; if (!bc->is_open && ss!=NULL ) { if ( ss->first!=ss->last && RealNear(ss->first->me.x,ss->last->me.x) && RealNear(ss->first->me.y,ss->last->me.y)) { ss->first->prevcp = ss->last->prevcp; ss->first->noprevcp = ss->last->noprevcp; ss->first->prev = ss->last->prev; ss->first->prev->to = ss->first; SplinePointFree(ss->last); ss->last = ss->first; } else { SplineMake3(ss->last,ss->first); ss->last = ss->first; } } chunkfree(bc,sizeof(bezctx_ff)); return( ss ); } ``` libspiro-20221101/bezctx_intf.h000066400000000000000000000026171433036472700162760ustar00rootroot00000000000000/* bezctx_inf.h libspiro - A sharable library of Spiro formula and functions. This file is a fork from ppedit for use by the libspiro project. Please see Changelog or git history for description of changes. ============================================================= 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _BEZCTX_INTF_H #define _BEZCTX_INTF_H #include "bezctx.h" void bezctx_moveto(bezctx *bc, double x, double y, int is_open, int si); void bezctx_lineto(bezctx *bc, double x, double y, int si); void bezctx_quadto(bezctx *bc, double x1, double y1, double x2, double y2, int si); void bezctx_curveto(bezctx *bc, double x1, double y1, double x2, double y2, \ double x3, double y3, int si); void bezctx_mark_knot(bezctx *bc, int knot_idx, int i); #endif libspiro-20221101/closedspiro.png000066400000000000000000000011341433036472700166330ustar00rootroot00000000000000PNG  IHDR}}}qPLTEpp:bKGDH pHYs  ~tIME cTIDATx]0 A`Uz>p3-PhC<ڬTҦgOC0iD. k@ι)ڌ{[q5ꦿXrB xWkя~r᯿<0ׇ?Apm6ޝ /߄?{?wGH2EߒAT πW (+_+XʂH<E'Kʤb fyeQ)92T /浤y5i6Wsw]WW?wG!S!n~2csO~4_Ok_\^cZzx~Xxq?Hzf >{sC~ŗK%3}:wv9~Ua,/gX1sIENDB`libspiro-20221101/config.guess000066400000000000000000001412021433036472700161150ustar00rootroot00000000000000#! /bin/sh # Attempt to guess a canonical system name. # Copyright 1992-2022 Free Software Foundation, Inc. # shellcheck disable=SC2006,SC2268 # see below for rationale timestamp='2022-05-25' # This file 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 . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # # Originally written by Per Bothner; maintained since 2000 by Ben Elliston. # # You can get the latest version of this script from: # https://git.savannah.gnu.org/cgit/config.git/plain/config.guess # # Please send patches to . # The "shellcheck disable" line above the timestamp inhibits complaints # about features and limitations of the classic Bourne shell that were # superseded or lifted in POSIX. However, this script identifies a wide # variety of pre-POSIX systems that do not have POSIX shells at all, and # even some reasonably current systems (Solaris 10 as case-in-point) still # have a pre-POSIX /bin/sh. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Options: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.guess ($timestamp) Originally written by Per Bothner. Copyright 1992-2022 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; * ) break ;; esac done if test $# != 0; then echo "$me: too many arguments$help" >&2 exit 1 fi # Just in case it came from the environment. GUESS= # CC_FOR_BUILD -- compiler used by this script. Note that the use of a # compiler to aid in system detection is discouraged as it requires # temporary files to be created and, as you can see below, it is a # headache to deal with in a portable fashion. # Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still # use `HOST_CC' if defined, but it is deprecated. # Portable tmp directory creation inspired by the Autoconf team. tmp= # shellcheck disable=SC2172 trap 'test -z "$tmp" || rm -fr "$tmp"' 0 1 2 13 15 set_cc_for_build() { # prevent multiple calls if $tmp is already set test "$tmp" && return 0 : "${TMPDIR=/tmp}" # shellcheck disable=SC2039,SC3028 { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir "$tmp" 2>/dev/null) ; } || { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir "$tmp" 2>/dev/null) && echo "Warning: creating insecure temp directory" >&2 ; } || { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } dummy=$tmp/dummy case ${CC_FOR_BUILD-},${HOST_CC-},${CC-} in ,,) echo "int x;" > "$dummy.c" for driver in cc gcc c89 c99 ; do if ($driver -c -o "$dummy.o" "$dummy.c") >/dev/null 2>&1 ; then CC_FOR_BUILD=$driver break fi done if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found fi ;; ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; esac } # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 1994-08-24) if test -f /.attbin/uname ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown case $UNAME_SYSTEM in Linux|GNU|GNU/*) LIBC=unknown set_cc_for_build cat <<-EOF > "$dummy.c" #include #if defined(__UCLIBC__) LIBC=uclibc #elif defined(__dietlibc__) LIBC=dietlibc #elif defined(__GLIBC__) LIBC=gnu #else #include /* First heuristic to detect musl libc. */ #ifdef __DEFINED_va_list LIBC=musl #endif #endif EOF cc_set_libc=`$CC_FOR_BUILD -E "$dummy.c" 2>/dev/null | grep '^LIBC' | sed 's, ,,g'` eval "$cc_set_libc" # Second heuristic to detect musl libc. if [ "$LIBC" = unknown ] && command -v ldd >/dev/null && ldd --version 2>&1 | grep -q ^musl; then LIBC=musl fi # If the system lacks a compiler, then just pick glibc. # We could probably try harder. if [ "$LIBC" = unknown ]; then LIBC=gnu fi ;; esac # Note: order is significant - the case branches are not exclusive. case $UNAME_MACHINE:$UNAME_SYSTEM:$UNAME_RELEASE:$UNAME_VERSION in *:NetBSD:*:*) # NetBSD (nbsd) targets should (where applicable) match one or # more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*, # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently # switched to ELF, *-*-netbsd* would select the old # object file format. This provides both forward # compatibility and a consistent mechanism for selecting the # object file format. # # Note: NetBSD doesn't particularly care about the vendor # portion of the name. We always set it to "unknown". UNAME_MACHINE_ARCH=`(uname -p 2>/dev/null || \ /sbin/sysctl -n hw.machine_arch 2>/dev/null || \ /usr/sbin/sysctl -n hw.machine_arch 2>/dev/null || \ echo unknown)` case $UNAME_MACHINE_ARCH in aarch64eb) machine=aarch64_be-unknown ;; armeb) machine=armeb-unknown ;; arm*) machine=arm-unknown ;; sh3el) machine=shl-unknown ;; sh3eb) machine=sh-unknown ;; sh5el) machine=sh5le-unknown ;; earmv*) arch=`echo "$UNAME_MACHINE_ARCH" | sed -e 's,^e\(armv[0-9]\).*$,\1,'` endian=`echo "$UNAME_MACHINE_ARCH" | sed -ne 's,^.*\(eb\)$,\1,p'` machine=${arch}${endian}-unknown ;; *) machine=$UNAME_MACHINE_ARCH-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently (or will in the future) and ABI. case $UNAME_MACHINE_ARCH in earm*) os=netbsdelf ;; arm*|i386|m68k|ns32k|sh3*|sparc|vax) set_cc_for_build if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ELF__ then # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). # Return netbsd for either. FIX? os=netbsd else os=netbsdelf fi ;; *) os=netbsd ;; esac # Determine ABI tags. case $UNAME_MACHINE_ARCH in earm*) expr='s/^earmv[0-9]/-eabi/;s/eb$//' abi=`echo "$UNAME_MACHINE_ARCH" | sed -e "$expr"` ;; esac # The OS release # Debian GNU/NetBSD machines have a different userland, and # thus, need a distinct triplet. However, they do not need # kernel version information, so it can be replaced with a # suitable tag, in the style of linux-gnu. case $UNAME_VERSION in Debian*) release='-gnu' ;; *) release=`echo "$UNAME_RELEASE" | sed -e 's/[-_].*//' | cut -d. -f1,2` ;; esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. GUESS=$machine-${os}${release}${abi-} ;; *:Bitrig:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'` GUESS=$UNAME_MACHINE_ARCH-unknown-bitrig$UNAME_RELEASE ;; *:OpenBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` GUESS=$UNAME_MACHINE_ARCH-unknown-openbsd$UNAME_RELEASE ;; *:SecBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/SecBSD.//'` GUESS=$UNAME_MACHINE_ARCH-unknown-secbsd$UNAME_RELEASE ;; *:LibertyBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/^.*BSD\.//'` GUESS=$UNAME_MACHINE_ARCH-unknown-libertybsd$UNAME_RELEASE ;; *:MidnightBSD:*:*) GUESS=$UNAME_MACHINE-unknown-midnightbsd$UNAME_RELEASE ;; *:ekkoBSD:*:*) GUESS=$UNAME_MACHINE-unknown-ekkobsd$UNAME_RELEASE ;; *:SolidBSD:*:*) GUESS=$UNAME_MACHINE-unknown-solidbsd$UNAME_RELEASE ;; *:OS108:*:*) GUESS=$UNAME_MACHINE-unknown-os108_$UNAME_RELEASE ;; macppc:MirBSD:*:*) GUESS=powerpc-unknown-mirbsd$UNAME_RELEASE ;; *:MirBSD:*:*) GUESS=$UNAME_MACHINE-unknown-mirbsd$UNAME_RELEASE ;; *:Sortix:*:*) GUESS=$UNAME_MACHINE-unknown-sortix ;; *:Twizzler:*:*) GUESS=$UNAME_MACHINE-unknown-twizzler ;; *:Redox:*:*) GUESS=$UNAME_MACHINE-unknown-redox ;; mips:OSF1:*.*) GUESS=mips-dec-osf1 ;; alpha:OSF1:*:*) # Reset EXIT trap before exiting to avoid spurious non-zero exit code. trap '' 0 case $UNAME_RELEASE in *4.0) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` ;; *5.*) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` ;; esac # According to Compaq, /usr/sbin/psrinfo has been available on # OSF/1 and Tru64 systems produced since 1995. I hope that # covers most systems running today. This code pipes the CPU # types through head -n 1, so we only detect the type of CPU 0. ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` case $ALPHA_CPU_TYPE in "EV4 (21064)") UNAME_MACHINE=alpha ;; "EV4.5 (21064)") UNAME_MACHINE=alpha ;; "LCA4 (21066/21068)") UNAME_MACHINE=alpha ;; "EV5 (21164)") UNAME_MACHINE=alphaev5 ;; "EV5.6 (21164A)") UNAME_MACHINE=alphaev56 ;; "EV5.6 (21164PC)") UNAME_MACHINE=alphapca56 ;; "EV5.7 (21164PC)") UNAME_MACHINE=alphapca57 ;; "EV6 (21264)") UNAME_MACHINE=alphaev6 ;; "EV6.7 (21264A)") UNAME_MACHINE=alphaev67 ;; "EV6.8CB (21264C)") UNAME_MACHINE=alphaev68 ;; "EV6.8AL (21264B)") UNAME_MACHINE=alphaev68 ;; "EV6.8CX (21264D)") UNAME_MACHINE=alphaev68 ;; "EV6.9A (21264/EV69A)") UNAME_MACHINE=alphaev69 ;; "EV7 (21364)") UNAME_MACHINE=alphaev7 ;; "EV7.9 (21364A)") UNAME_MACHINE=alphaev79 ;; esac # A Pn.n version is a patched version. # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. OSF_REL=`echo "$UNAME_RELEASE" | sed -e 's/^[PVTX]//' | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz` GUESS=$UNAME_MACHINE-dec-osf$OSF_REL ;; Amiga*:UNIX_System_V:4.0:*) GUESS=m68k-unknown-sysv4 ;; *:[Aa]miga[Oo][Ss]:*:*) GUESS=$UNAME_MACHINE-unknown-amigaos ;; *:[Mm]orph[Oo][Ss]:*:*) GUESS=$UNAME_MACHINE-unknown-morphos ;; *:OS/390:*:*) GUESS=i370-ibm-openedition ;; *:z/VM:*:*) GUESS=s390-ibm-zvmoe ;; *:OS400:*:*) GUESS=powerpc-ibm-os400 ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) GUESS=arm-acorn-riscix$UNAME_RELEASE ;; arm*:riscos:*:*|arm*:RISCOS:*:*) GUESS=arm-unknown-riscos ;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) GUESS=hppa1.1-hitachi-hiuxmpp ;; Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. case `(/bin/universe) 2>/dev/null` in att) GUESS=pyramid-pyramid-sysv3 ;; *) GUESS=pyramid-pyramid-bsd ;; esac ;; NILE*:*:*:dcosx) GUESS=pyramid-pyramid-svr4 ;; DRS?6000:unix:4.0:6*) GUESS=sparc-icl-nx6 ;; DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) case `/usr/bin/uname -p` in sparc) GUESS=sparc-icl-nx7 ;; esac ;; s390x:SunOS:*:*) SUN_REL=`echo "$UNAME_RELEASE" | sed -e 's/[^.]*//'` GUESS=$UNAME_MACHINE-ibm-solaris2$SUN_REL ;; sun4H:SunOS:5.*:*) SUN_REL=`echo "$UNAME_RELEASE" | sed -e 's/[^.]*//'` GUESS=sparc-hal-solaris2$SUN_REL ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) SUN_REL=`echo "$UNAME_RELEASE" | sed -e 's/[^.]*//'` GUESS=sparc-sun-solaris2$SUN_REL ;; i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*) GUESS=i386-pc-auroraux$UNAME_RELEASE ;; i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*) set_cc_for_build SUN_ARCH=i386 # If there is a compiler, see if it is configured for 64-bit objects. # Note that the Sun cc does not turn __LP64__ into 1 like gcc does. # This test works for both compilers. if test "$CC_FOR_BUILD" != no_compiler_found; then if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS="" $CC_FOR_BUILD -m64 -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then SUN_ARCH=x86_64 fi fi SUN_REL=`echo "$UNAME_RELEASE" | sed -e 's/[^.]*//'` GUESS=$SUN_ARCH-pc-solaris2$SUN_REL ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. SUN_REL=`echo "$UNAME_RELEASE" | sed -e 's/[^.]*//'` GUESS=sparc-sun-solaris3$SUN_REL ;; sun4*:SunOS:*:*) case `/usr/bin/arch -k` in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. SUN_REL=`echo "$UNAME_RELEASE" | sed -e 's/-/_/'` GUESS=sparc-sun-sunos$SUN_REL ;; sun3*:SunOS:*:*) GUESS=m68k-sun-sunos$UNAME_RELEASE ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x$UNAME_RELEASE" = x && UNAME_RELEASE=3 case `/bin/arch` in sun3) GUESS=m68k-sun-sunos$UNAME_RELEASE ;; sun4) GUESS=sparc-sun-sunos$UNAME_RELEASE ;; esac ;; aushp:SunOS:*:*) GUESS=sparc-auspex-sunos$UNAME_RELEASE ;; # The situation for MiNT is a little confusing. The machine name # can be virtually everything (everything which is not # "atarist" or "atariste" at least should have a processor # > m68000). The system name ranges from "MiNT" over "FreeMiNT" # to the lowercase version "mint" (or "freemint"). Finally # the system name "TOS" denotes a system which is actually not # MiNT. But MiNT is downward compatible to TOS, so this should # be no problem. atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) GUESS=m68k-atari-mint$UNAME_RELEASE ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) GUESS=m68k-atari-mint$UNAME_RELEASE ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) GUESS=m68k-atari-mint$UNAME_RELEASE ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) GUESS=m68k-milan-mint$UNAME_RELEASE ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) GUESS=m68k-hades-mint$UNAME_RELEASE ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) GUESS=m68k-unknown-mint$UNAME_RELEASE ;; m68k:machten:*:*) GUESS=m68k-apple-machten$UNAME_RELEASE ;; powerpc:machten:*:*) GUESS=powerpc-apple-machten$UNAME_RELEASE ;; RISC*:Mach:*:*) GUESS=mips-dec-mach_bsd4.3 ;; RISC*:ULTRIX:*:*) GUESS=mips-dec-ultrix$UNAME_RELEASE ;; VAX*:ULTRIX*:*:*) GUESS=vax-dec-ultrix$UNAME_RELEASE ;; 2020:CLIX:*:* | 2430:CLIX:*:*) GUESS=clipper-intergraph-clix$UNAME_RELEASE ;; mips:*:*:UMIPS | mips:*:*:RISCos) set_cc_for_build sed 's/^ //' << EOF > "$dummy.c" #ifdef __cplusplus #include /* for printf() prototype */ int main (int argc, char *argv[]) { #else int main (argc, argv) int argc; char *argv[]; { #endif #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF $CC_FOR_BUILD -o "$dummy" "$dummy.c" && dummyarg=`echo "$UNAME_RELEASE" | sed -n 's/\([0-9]*\).*/\1/p'` && SYSTEM_NAME=`"$dummy" "$dummyarg"` && { echo "$SYSTEM_NAME"; exit; } GUESS=mips-mips-riscos$UNAME_RELEASE ;; Motorola:PowerMAX_OS:*:*) GUESS=powerpc-motorola-powermax ;; Motorola:*:4.3:PL8-*) GUESS=powerpc-harris-powermax ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) GUESS=powerpc-harris-powermax ;; Night_Hawk:Power_UNIX:*:*) GUESS=powerpc-harris-powerunix ;; m88k:CX/UX:7*:*) GUESS=m88k-harris-cxux7 ;; m88k:*:4*:R4*) GUESS=m88k-motorola-sysv4 ;; m88k:*:3*:R3*) GUESS=m88k-motorola-sysv3 ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if test "$UNAME_PROCESSOR" = mc88100 || test "$UNAME_PROCESSOR" = mc88110 then if test "$TARGET_BINARY_INTERFACE"x = m88kdguxelfx || \ test "$TARGET_BINARY_INTERFACE"x = x then GUESS=m88k-dg-dgux$UNAME_RELEASE else GUESS=m88k-dg-dguxbcs$UNAME_RELEASE fi else GUESS=i586-dg-dgux$UNAME_RELEASE fi ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) GUESS=m88k-dolphin-sysv3 ;; M88*:*:R3*:*) # Delta 88k system running SVR3 GUESS=m88k-motorola-sysv3 ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) GUESS=m88k-tektronix-sysv3 ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) GUESS=m68k-tektronix-bsd ;; *:IRIX*:*:*) IRIX_REL=`echo "$UNAME_RELEASE" | sed -e 's/-/_/g'` GUESS=mips-sgi-irix$IRIX_REL ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. GUESS=romp-ibm-aix # uname -m gives an 8 hex-code CPU id ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) GUESS=i386-ibm-aix ;; ia64:AIX:*:*) if test -x /usr/bin/oslevel ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=$UNAME_VERSION.$UNAME_RELEASE fi GUESS=$UNAME_MACHINE-ibm-aix$IBM_REV ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then set_cc_for_build sed 's/^ //' << EOF > "$dummy.c" #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF if $CC_FOR_BUILD -o "$dummy" "$dummy.c" && SYSTEM_NAME=`"$dummy"` then GUESS=$SYSTEM_NAME else GUESS=rs6000-ibm-aix3.2.5 fi elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then GUESS=rs6000-ibm-aix3.2.4 else GUESS=rs6000-ibm-aix3.2 fi ;; *:AIX:*:[4567]) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` if /usr/sbin/lsattr -El "$IBM_CPU_ID" | grep ' POWER' >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if test -x /usr/bin/lslpp ; then IBM_REV=`/usr/bin/lslpp -Lqc bos.rte.libc | \ awk -F: '{ print $3 }' | sed s/[0-9]*$/0/` else IBM_REV=$UNAME_VERSION.$UNAME_RELEASE fi GUESS=$IBM_ARCH-ibm-aix$IBM_REV ;; *:AIX:*:*) GUESS=rs6000-ibm-aix ;; ibmrt:4.4BSD:*|romp-ibm:4.4BSD:*) GUESS=romp-ibm-bsd4.4 ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and GUESS=romp-ibm-bsd$UNAME_RELEASE # 4.3 with uname added to ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) GUESS=rs6000-bull-bosx ;; DPX/2?00:B.O.S.:*:*) GUESS=m68k-bull-sysv3 ;; 9000/[34]??:4.3bsd:1.*:*) GUESS=m68k-hp-bsd ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) GUESS=m68k-hp-bsd4.4 ;; 9000/[34678]??:HP-UX:*:*) HPUX_REV=`echo "$UNAME_RELEASE" | sed -e 's/[^.]*.[0B]*//'` case $UNAME_MACHINE in 9000/31?) HP_ARCH=m68000 ;; 9000/[34]??) HP_ARCH=m68k ;; 9000/[678][0-9][0-9]) if test -x /usr/bin/getconf; then sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` case $sc_cpu_version in 523) HP_ARCH=hppa1.0 ;; # CPU_PA_RISC1_0 528) HP_ARCH=hppa1.1 ;; # CPU_PA_RISC1_1 532) # CPU_PA_RISC2_0 case $sc_kernel_bits in 32) HP_ARCH=hppa2.0n ;; 64) HP_ARCH=hppa2.0w ;; '') HP_ARCH=hppa2.0 ;; # HP-UX 10.20 esac ;; esac fi if test "$HP_ARCH" = ""; then set_cc_for_build sed 's/^ //' << EOF > "$dummy.c" #define _HPUX_SOURCE #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (CCOPTS="" $CC_FOR_BUILD -o "$dummy" "$dummy.c" 2>/dev/null) && HP_ARCH=`"$dummy"` test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac if test "$HP_ARCH" = hppa2.0w then set_cc_for_build # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler # generating 64-bit code. GNU and HP use different nomenclature: # # $ CC_FOR_BUILD=cc ./config.guess # => hppa2.0w-hp-hpux11.23 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess # => hppa64-hp-hpux11.23 if echo __LP64__ | (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | grep -q __LP64__ then HP_ARCH=hppa2.0w else HP_ARCH=hppa64 fi fi GUESS=$HP_ARCH-hp-hpux$HPUX_REV ;; ia64:HP-UX:*:*) HPUX_REV=`echo "$UNAME_RELEASE" | sed -e 's/[^.]*.[0B]*//'` GUESS=ia64-hp-hpux$HPUX_REV ;; 3050*:HI-UX:*:*) set_cc_for_build sed 's/^ //' << EOF > "$dummy.c" #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF $CC_FOR_BUILD -o "$dummy" "$dummy.c" && SYSTEM_NAME=`"$dummy"` && { echo "$SYSTEM_NAME"; exit; } GUESS=unknown-hitachi-hiuxwe2 ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:*) GUESS=hppa1.1-hp-bsd ;; 9000/8??:4.3bsd:*:*) GUESS=hppa1.0-hp-bsd ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) GUESS=hppa1.0-hp-mpeix ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:*) GUESS=hppa1.1-hp-osf ;; hp8??:OSF1:*:*) GUESS=hppa1.0-hp-osf ;; i*86:OSF1:*:*) if test -x /usr/sbin/sysversion ; then GUESS=$UNAME_MACHINE-unknown-osf1mk else GUESS=$UNAME_MACHINE-unknown-osf1 fi ;; parisc*:Lites*:*:*) GUESS=hppa1.1-hp-lites ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) GUESS=c1-convex-bsd ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) GUESS=c34-convex-bsd ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) GUESS=c38-convex-bsd ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) GUESS=c4-convex-bsd ;; CRAY*Y-MP:*:*:*) CRAY_REL=`echo "$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/'` GUESS=ymp-cray-unicos$CRAY_REL ;; CRAY*[A-Z]90:*:*:*) echo "$UNAME_MACHINE"-cray-unicos"$UNAME_RELEASE" \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ -e 's/\.[^.]*$/.X/' exit ;; CRAY*TS:*:*:*) CRAY_REL=`echo "$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/'` GUESS=t90-cray-unicos$CRAY_REL ;; CRAY*T3E:*:*:*) CRAY_REL=`echo "$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/'` GUESS=alphaev5-cray-unicosmk$CRAY_REL ;; CRAY*SV1:*:*:*) CRAY_REL=`echo "$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/'` GUESS=sv1-cray-unicos$CRAY_REL ;; *:UNICOS/mp:*:*) CRAY_REL=`echo "$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/'` GUESS=craynv-cray-unicosmp$CRAY_REL ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz` FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'` FUJITSU_REL=`echo "$UNAME_RELEASE" | sed -e 's/ /_/'` GUESS=${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL} ;; 5000:UNIX_System_V:4.*:*) FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'` FUJITSU_REL=`echo "$UNAME_RELEASE" | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/ /_/'` GUESS=sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL} ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) GUESS=$UNAME_MACHINE-pc-bsdi$UNAME_RELEASE ;; sparc*:BSD/OS:*:*) GUESS=sparc-unknown-bsdi$UNAME_RELEASE ;; *:BSD/OS:*:*) GUESS=$UNAME_MACHINE-unknown-bsdi$UNAME_RELEASE ;; arm:FreeBSD:*:*) UNAME_PROCESSOR=`uname -p` set_cc_for_build if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_PCS_VFP then FREEBSD_REL=`echo "$UNAME_RELEASE" | sed -e 's/[-(].*//'` GUESS=$UNAME_PROCESSOR-unknown-freebsd$FREEBSD_REL-gnueabi else FREEBSD_REL=`echo "$UNAME_RELEASE" | sed -e 's/[-(].*//'` GUESS=$UNAME_PROCESSOR-unknown-freebsd$FREEBSD_REL-gnueabihf fi ;; *:FreeBSD:*:*) UNAME_PROCESSOR=`/usr/bin/uname -p` case $UNAME_PROCESSOR in amd64) UNAME_PROCESSOR=x86_64 ;; i386) UNAME_PROCESSOR=i586 ;; esac FREEBSD_REL=`echo "$UNAME_RELEASE" | sed -e 's/[-(].*//'` GUESS=$UNAME_PROCESSOR-unknown-freebsd$FREEBSD_REL ;; i*:CYGWIN*:*) GUESS=$UNAME_MACHINE-pc-cygwin ;; *:MINGW64*:*) GUESS=$UNAME_MACHINE-pc-mingw64 ;; *:MINGW*:*) GUESS=$UNAME_MACHINE-pc-mingw32 ;; *:MSYS*:*) GUESS=$UNAME_MACHINE-pc-msys ;; i*:PW*:*) GUESS=$UNAME_MACHINE-pc-pw32 ;; *:SerenityOS:*:*) GUESS=$UNAME_MACHINE-pc-serenity ;; *:Interix*:*) case $UNAME_MACHINE in x86) GUESS=i586-pc-interix$UNAME_RELEASE ;; authenticamd | genuineintel | EM64T) GUESS=x86_64-unknown-interix$UNAME_RELEASE ;; IA64) GUESS=ia64-unknown-interix$UNAME_RELEASE ;; esac ;; i*:UWIN*:*) GUESS=$UNAME_MACHINE-pc-uwin ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) GUESS=x86_64-pc-cygwin ;; prep*:SunOS:5.*:*) SUN_REL=`echo "$UNAME_RELEASE" | sed -e 's/[^.]*//'` GUESS=powerpcle-unknown-solaris2$SUN_REL ;; *:GNU:*:*) # the GNU system GNU_ARCH=`echo "$UNAME_MACHINE" | sed -e 's,[-/].*$,,'` GNU_REL=`echo "$UNAME_RELEASE" | sed -e 's,/.*$,,'` GUESS=$GNU_ARCH-unknown-$LIBC$GNU_REL ;; *:GNU/*:*:*) # other systems with GNU libc and userland GNU_SYS=`echo "$UNAME_SYSTEM" | sed 's,^[^/]*/,,' | tr "[:upper:]" "[:lower:]"` GNU_REL=`echo "$UNAME_RELEASE" | sed -e 's/[-(].*//'` GUESS=$UNAME_MACHINE-unknown-$GNU_SYS$GNU_REL-$LIBC ;; *:Minix:*:*) GUESS=$UNAME_MACHINE-unknown-minix ;; aarch64:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; aarch64_be:Linux:*:*) UNAME_MACHINE=aarch64_be GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; alpha:Linux:*:*) case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' /proc/cpuinfo 2>/dev/null` in EV5) UNAME_MACHINE=alphaev5 ;; EV56) UNAME_MACHINE=alphaev56 ;; PCA56) UNAME_MACHINE=alphapca56 ;; PCA57) UNAME_MACHINE=alphapca56 ;; EV6) UNAME_MACHINE=alphaev6 ;; EV67) UNAME_MACHINE=alphaev67 ;; EV68*) UNAME_MACHINE=alphaev68 ;; esac objdump --private-headers /bin/sh | grep -q ld.so.1 if test "$?" = 0 ; then LIBC=gnulibc1 ; fi GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; arc:Linux:*:* | arceb:Linux:*:* | arc32:Linux:*:* | arc64:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; arm*:Linux:*:*) set_cc_for_build if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_EABI__ then GUESS=$UNAME_MACHINE-unknown-linux-$LIBC else if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_PCS_VFP then GUESS=$UNAME_MACHINE-unknown-linux-${LIBC}eabi else GUESS=$UNAME_MACHINE-unknown-linux-${LIBC}eabihf fi fi ;; avr32*:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; cris:Linux:*:*) GUESS=$UNAME_MACHINE-axis-linux-$LIBC ;; crisv32:Linux:*:*) GUESS=$UNAME_MACHINE-axis-linux-$LIBC ;; e2k:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; frv:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; hexagon:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; i*86:Linux:*:*) GUESS=$UNAME_MACHINE-pc-linux-$LIBC ;; ia64:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; k1om:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; loongarch32:Linux:*:* | loongarch64:Linux:*:* | loongarchx32:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; m32r*:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; m68*:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; mips:Linux:*:* | mips64:Linux:*:*) set_cc_for_build IS_GLIBC=0 test x"${LIBC}" = xgnu && IS_GLIBC=1 sed 's/^ //' << EOF > "$dummy.c" #undef CPU #undef mips #undef mipsel #undef mips64 #undef mips64el #if ${IS_GLIBC} && defined(_ABI64) LIBCABI=gnuabi64 #else #if ${IS_GLIBC} && defined(_ABIN32) LIBCABI=gnuabin32 #else LIBCABI=${LIBC} #endif #endif #if ${IS_GLIBC} && defined(__mips64) && defined(__mips_isa_rev) && __mips_isa_rev>=6 CPU=mipsisa64r6 #else #if ${IS_GLIBC} && !defined(__mips64) && defined(__mips_isa_rev) && __mips_isa_rev>=6 CPU=mipsisa32r6 #else #if defined(__mips64) CPU=mips64 #else CPU=mips #endif #endif #endif #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) MIPS_ENDIAN=el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) MIPS_ENDIAN= #else MIPS_ENDIAN= #endif #endif EOF cc_set_vars=`$CC_FOR_BUILD -E "$dummy.c" 2>/dev/null | grep '^CPU\|^MIPS_ENDIAN\|^LIBCABI'` eval "$cc_set_vars" test "x$CPU" != x && { echo "$CPU${MIPS_ENDIAN}-unknown-linux-$LIBCABI"; exit; } ;; mips64el:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; openrisc*:Linux:*:*) GUESS=or1k-unknown-linux-$LIBC ;; or32:Linux:*:* | or1k*:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; padre:Linux:*:*) GUESS=sparc-unknown-linux-$LIBC ;; parisc64:Linux:*:* | hppa64:Linux:*:*) GUESS=hppa64-unknown-linux-$LIBC ;; parisc:Linux:*:* | hppa:Linux:*:*) # Look for CPU level case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in PA7*) GUESS=hppa1.1-unknown-linux-$LIBC ;; PA8*) GUESS=hppa2.0-unknown-linux-$LIBC ;; *) GUESS=hppa-unknown-linux-$LIBC ;; esac ;; ppc64:Linux:*:*) GUESS=powerpc64-unknown-linux-$LIBC ;; ppc:Linux:*:*) GUESS=powerpc-unknown-linux-$LIBC ;; ppc64le:Linux:*:*) GUESS=powerpc64le-unknown-linux-$LIBC ;; ppcle:Linux:*:*) GUESS=powerpcle-unknown-linux-$LIBC ;; riscv32:Linux:*:* | riscv32be:Linux:*:* | riscv64:Linux:*:* | riscv64be:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; s390:Linux:*:* | s390x:Linux:*:*) GUESS=$UNAME_MACHINE-ibm-linux-$LIBC ;; sh64*:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; sh*:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; sparc:Linux:*:* | sparc64:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; tile*:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; vax:Linux:*:*) GUESS=$UNAME_MACHINE-dec-linux-$LIBC ;; x86_64:Linux:*:*) set_cc_for_build CPU=$UNAME_MACHINE LIBCABI=$LIBC if test "$CC_FOR_BUILD" != no_compiler_found; then ABI=64 sed 's/^ //' << EOF > "$dummy.c" #ifdef __i386__ ABI=x86 #else #ifdef __ILP32__ ABI=x32 #endif #endif EOF cc_set_abi=`$CC_FOR_BUILD -E "$dummy.c" 2>/dev/null | grep '^ABI' | sed 's, ,,g'` eval "$cc_set_abi" case $ABI in x86) CPU=i686 ;; x32) LIBCABI=${LIBC}x32 ;; esac fi GUESS=$CPU-pc-linux-$LIBCABI ;; xtensa*:Linux:*:*) GUESS=$UNAME_MACHINE-unknown-linux-$LIBC ;; i*86:DYNIX/ptx:4*:*) # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. # earlier versions are messed up and put the nodename in both # sysname and nodename. GUESS=i386-sequent-sysv4 ;; i*86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. GUESS=$UNAME_MACHINE-pc-sysv4.2uw$UNAME_VERSION ;; i*86:OS/2:*:*) # If we were able to find `uname', then EMX Unix compatibility # is probably installed. GUESS=$UNAME_MACHINE-pc-os2-emx ;; i*86:XTS-300:*:STOP) GUESS=$UNAME_MACHINE-unknown-stop ;; i*86:atheos:*:*) GUESS=$UNAME_MACHINE-unknown-atheos ;; i*86:syllable:*:*) GUESS=$UNAME_MACHINE-pc-syllable ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*) GUESS=i386-unknown-lynxos$UNAME_RELEASE ;; i*86:*DOS:*:*) GUESS=$UNAME_MACHINE-pc-msdosdjgpp ;; i*86:*:4.*:*) UNAME_REL=`echo "$UNAME_RELEASE" | sed 's/\/MP$//'` if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then GUESS=$UNAME_MACHINE-univel-sysv$UNAME_REL else GUESS=$UNAME_MACHINE-pc-sysv$UNAME_REL fi ;; i*86:*:5:[678]*) # UnixWare 7.x, OpenUNIX and OpenServer 6. case `/bin/uname -X | grep "^Machine"` in *486*) UNAME_MACHINE=i486 ;; *Pentium) UNAME_MACHINE=i586 ;; *Pent*|*Celeron) UNAME_MACHINE=i686 ;; esac GUESS=$UNAME_MACHINE-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION} ;; i*86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ && UNAME_MACHINE=i686 (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ && UNAME_MACHINE=i686 GUESS=$UNAME_MACHINE-pc-sco$UNAME_REL else GUESS=$UNAME_MACHINE-pc-sysv32 fi ;; pc:*:*:*) # Left here for compatibility: # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i586. # Note: whatever this is, it MUST be the same as what config.sub # prints for the "djgpp" host, or else GDB configure will decide that # this is a cross-build. GUESS=i586-pc-msdosdjgpp ;; Intel:Mach:3*:*) GUESS=i386-pc-mach3 ;; paragon:*:*:*) GUESS=i860-intel-osf1 ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then GUESS=i860-stardent-sysv$UNAME_RELEASE # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. GUESS=i860-unknown-sysv$UNAME_RELEASE # Unknown i860-SVR4 fi ;; mini*:CTIX:SYS*5:*) # "miniframe" GUESS=m68010-convergent-sysv ;; mc68k:UNIX:SYSTEM5:3.51m) GUESS=m68k-convergent-sysv ;; M680?0:D-NIX:5.3:*) GUESS=m68k-diab-dnix ;; M68*:*:R3V[5678]*:*) test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3"$OS_REL"; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3"$OS_REL"; exit; } ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4; exit; } ;; NCR*:*:4.2:* | MPRAS*:*:4.2:*) OS_REL='.3' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3"$OS_REL"; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3"$OS_REL"; exit; } /bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \ && { echo i586-ncr-sysv4.3"$OS_REL"; exit; } ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) GUESS=m68k-unknown-lynxos$UNAME_RELEASE ;; mc68030:UNIX_System_V:4.*:*) GUESS=m68k-atari-sysv4 ;; TSUNAMI:LynxOS:2.*:*) GUESS=sparc-unknown-lynxos$UNAME_RELEASE ;; rs6000:LynxOS:2.*:*) GUESS=rs6000-unknown-lynxos$UNAME_RELEASE ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*) GUESS=powerpc-unknown-lynxos$UNAME_RELEASE ;; SM[BE]S:UNIX_SV:*:*) GUESS=mips-dde-sysv$UNAME_RELEASE ;; RM*:ReliantUNIX-*:*:*) GUESS=mips-sni-sysv4 ;; RM*:SINIX-*:*:*) GUESS=mips-sni-sysv4 ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` GUESS=$UNAME_MACHINE-sni-sysv4 else GUESS=ns32k-sni-sysv fi ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says GUESS=i586-unisys-sysv4 ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm GUESS=hppa1.1-stratus-sysv4 ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. GUESS=i860-stratus-sysv4 ;; i*86:VOS:*:*) # From Paul.Green@stratus.com. GUESS=$UNAME_MACHINE-stratus-vos ;; *:VOS:*:*) # From Paul.Green@stratus.com. GUESS=hppa1.1-stratus-vos ;; mc68*:A/UX:*:*) GUESS=m68k-apple-aux$UNAME_RELEASE ;; news*:NEWS-OS:6*:*) GUESS=mips-sony-newsos6 ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) if test -d /usr/nec; then GUESS=mips-nec-sysv$UNAME_RELEASE else GUESS=mips-unknown-sysv$UNAME_RELEASE fi ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. GUESS=powerpc-be-beos ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. GUESS=powerpc-apple-beos ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. GUESS=i586-pc-beos ;; BePC:Haiku:*:*) # Haiku running on Intel PC compatible. GUESS=i586-pc-haiku ;; ppc:Haiku:*:*) # Haiku running on Apple PowerPC GUESS=powerpc-apple-haiku ;; *:Haiku:*:*) # Haiku modern gcc (not bound by BeOS compat) GUESS=$UNAME_MACHINE-unknown-haiku ;; SX-4:SUPER-UX:*:*) GUESS=sx4-nec-superux$UNAME_RELEASE ;; SX-5:SUPER-UX:*:*) GUESS=sx5-nec-superux$UNAME_RELEASE ;; SX-6:SUPER-UX:*:*) GUESS=sx6-nec-superux$UNAME_RELEASE ;; SX-7:SUPER-UX:*:*) GUESS=sx7-nec-superux$UNAME_RELEASE ;; SX-8:SUPER-UX:*:*) GUESS=sx8-nec-superux$UNAME_RELEASE ;; SX-8R:SUPER-UX:*:*) GUESS=sx8r-nec-superux$UNAME_RELEASE ;; SX-ACE:SUPER-UX:*:*) GUESS=sxace-nec-superux$UNAME_RELEASE ;; Power*:Rhapsody:*:*) GUESS=powerpc-apple-rhapsody$UNAME_RELEASE ;; *:Rhapsody:*:*) GUESS=$UNAME_MACHINE-apple-rhapsody$UNAME_RELEASE ;; arm64:Darwin:*:*) GUESS=aarch64-apple-darwin$UNAME_RELEASE ;; *:Darwin:*:*) UNAME_PROCESSOR=`uname -p` case $UNAME_PROCESSOR in unknown) UNAME_PROCESSOR=powerpc ;; esac if command -v xcode-select > /dev/null 2> /dev/null && \ ! xcode-select --print-path > /dev/null 2> /dev/null ; then # Avoid executing cc if there is no toolchain installed as # cc will be a stub that puts up a graphical alert # prompting the user to install developer tools. CC_FOR_BUILD=no_compiler_found else set_cc_for_build fi if test "$CC_FOR_BUILD" != no_compiler_found; then if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then case $UNAME_PROCESSOR in i386) UNAME_PROCESSOR=x86_64 ;; powerpc) UNAME_PROCESSOR=powerpc64 ;; esac fi # On 10.4-10.6 one might compile for PowerPC via gcc -arch ppc if (echo '#ifdef __POWERPC__'; echo IS_PPC; echo '#endif') | \ (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_PPC >/dev/null then UNAME_PROCESSOR=powerpc fi elif test "$UNAME_PROCESSOR" = i386 ; then # uname -m returns i386 or x86_64 UNAME_PROCESSOR=$UNAME_MACHINE fi GUESS=$UNAME_PROCESSOR-apple-darwin$UNAME_RELEASE ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) UNAME_PROCESSOR=`uname -p` if test "$UNAME_PROCESSOR" = x86; then UNAME_PROCESSOR=i386 UNAME_MACHINE=pc fi GUESS=$UNAME_PROCESSOR-$UNAME_MACHINE-nto-qnx$UNAME_RELEASE ;; *:QNX:*:4*) GUESS=i386-pc-qnx ;; NEO-*:NONSTOP_KERNEL:*:*) GUESS=neo-tandem-nsk$UNAME_RELEASE ;; NSE-*:NONSTOP_KERNEL:*:*) GUESS=nse-tandem-nsk$UNAME_RELEASE ;; NSR-*:NONSTOP_KERNEL:*:*) GUESS=nsr-tandem-nsk$UNAME_RELEASE ;; NSV-*:NONSTOP_KERNEL:*:*) GUESS=nsv-tandem-nsk$UNAME_RELEASE ;; NSX-*:NONSTOP_KERNEL:*:*) GUESS=nsx-tandem-nsk$UNAME_RELEASE ;; *:NonStop-UX:*:*) GUESS=mips-compaq-nonstopux ;; BS2000:POSIX*:*:*) GUESS=bs2000-siemens-sysv ;; DS/*:UNIX_System_V:*:*) GUESS=$UNAME_MACHINE-$UNAME_SYSTEM-$UNAME_RELEASE ;; *:Plan9:*:*) # "uname -m" is not consistent, so use $cputype instead. 386 # is converted to i386 for consistency with other x86 # operating systems. if test "${cputype-}" = 386; then UNAME_MACHINE=i386 elif test "x${cputype-}" != x; then UNAME_MACHINE=$cputype fi GUESS=$UNAME_MACHINE-unknown-plan9 ;; *:TOPS-10:*:*) GUESS=pdp10-unknown-tops10 ;; *:TENEX:*:*) GUESS=pdp10-unknown-tenex ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) GUESS=pdp10-dec-tops20 ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) GUESS=pdp10-xkl-tops20 ;; *:TOPS-20:*:*) GUESS=pdp10-unknown-tops20 ;; *:ITS:*:*) GUESS=pdp10-unknown-its ;; SEI:*:*:SEIUX) GUESS=mips-sei-seiux$UNAME_RELEASE ;; *:DragonFly:*:*) DRAGONFLY_REL=`echo "$UNAME_RELEASE" | sed -e 's/[-(].*//'` GUESS=$UNAME_MACHINE-unknown-dragonfly$DRAGONFLY_REL ;; *:*VMS:*:*) UNAME_MACHINE=`(uname -p) 2>/dev/null` case $UNAME_MACHINE in A*) GUESS=alpha-dec-vms ;; I*) GUESS=ia64-dec-vms ;; V*) GUESS=vax-dec-vms ;; esac ;; *:XENIX:*:SysV) GUESS=i386-pc-xenix ;; i*86:skyos:*:*) SKYOS_REL=`echo "$UNAME_RELEASE" | sed -e 's/ .*$//'` GUESS=$UNAME_MACHINE-pc-skyos$SKYOS_REL ;; i*86:rdos:*:*) GUESS=$UNAME_MACHINE-pc-rdos ;; i*86:Fiwix:*:*) GUESS=$UNAME_MACHINE-pc-fiwix ;; *:AROS:*:*) GUESS=$UNAME_MACHINE-unknown-aros ;; x86_64:VMkernel:*:*) GUESS=$UNAME_MACHINE-unknown-esx ;; amd64:Isilon\ OneFS:*:*) GUESS=x86_64-unknown-onefs ;; *:Unleashed:*:*) GUESS=$UNAME_MACHINE-unknown-unleashed$UNAME_RELEASE ;; esac # Do we have a guess based on uname results? if test "x$GUESS" != x; then echo "$GUESS" exit fi # No uname command or uname output not recognized. set_cc_for_build cat > "$dummy.c" < #include #endif #if defined(ultrix) || defined(_ultrix) || defined(__ultrix) || defined(__ultrix__) #if defined (vax) || defined (__vax) || defined (__vax__) || defined(mips) || defined(__mips) || defined(__mips__) || defined(MIPS) || defined(__MIPS__) #include #if defined(_SIZE_T_) || defined(SIGLOST) #include #endif #endif #endif main () { #if defined (sony) #if defined (MIPSEB) /* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed, I don't know.... */ printf ("mips-sony-bsd\n"); exit (0); #else #include printf ("m68k-sony-newsos%s\n", #ifdef NEWSOS4 "4" #else "" #endif ); exit (0); #endif #endif #if defined (NeXT) #if !defined (__ARCHITECTURE__) #define __ARCHITECTURE__ "m68k" #endif int version; version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`; if (version < 4) printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version); else printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-pc-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) struct utsname un; uname(&un); if (strncmp(un.version, "V2", 2) == 0) { printf ("i386-sequent-ptx2\n"); exit (0); } if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */ printf ("i386-sequent-ptx1\n"); exit (0); } printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) #if !defined (ultrix) #include #if defined (BSD) #if BSD == 43 printf ("vax-dec-bsd4.3\n"); exit (0); #else #if BSD == 199006 printf ("vax-dec-bsd4.3reno\n"); exit (0); #else printf ("vax-dec-bsd\n"); exit (0); #endif #endif #else printf ("vax-dec-bsd\n"); exit (0); #endif #else #if defined(_SIZE_T_) || defined(SIGLOST) struct utsname un; uname (&un); printf ("vax-dec-ultrix%s\n", un.release); exit (0); #else printf ("vax-dec-ultrix\n"); exit (0); #endif #endif #endif #if defined(ultrix) || defined(_ultrix) || defined(__ultrix) || defined(__ultrix__) #if defined(mips) || defined(__mips) || defined(__mips__) || defined(MIPS) || defined(__MIPS__) #if defined(_SIZE_T_) || defined(SIGLOST) struct utsname *un; uname (&un); printf ("mips-dec-ultrix%s\n", un.release); exit (0); #else printf ("mips-dec-ultrix\n"); exit (0); #endif #endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF $CC_FOR_BUILD -o "$dummy" "$dummy.c" 2>/dev/null && SYSTEM_NAME=`"$dummy"` && { echo "$SYSTEM_NAME"; exit; } # Apollos put the system type in the environment. test -d /usr/apollo && { echo "$ISP-apollo-$SYSTYPE"; exit; } echo "$0: unable to guess system type" >&2 case $UNAME_MACHINE:$UNAME_SYSTEM in mips:Linux | mips64:Linux) # If we got here on MIPS GNU/Linux, output extra information. cat >&2 <&2 <&2 </dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` /bin/uname -X = `(/bin/uname -X) 2>/dev/null` hostinfo = `(hostinfo) 2>/dev/null` /bin/universe = `(/bin/universe) 2>/dev/null` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` /bin/arch = `(/bin/arch) 2>/dev/null` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` UNAME_MACHINE = "$UNAME_MACHINE" UNAME_RELEASE = "$UNAME_RELEASE" UNAME_SYSTEM = "$UNAME_SYSTEM" UNAME_VERSION = "$UNAME_VERSION" EOF fi exit 1 # Local variables: # eval: (add-hook 'before-save-hook 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: libspiro-20221101/config.sub000066400000000000000000001051161433036472700155640ustar00rootroot00000000000000#! /bin/sh # Configuration validation subroutine script. # Copyright 1992-2022 Free Software Foundation, Inc. # shellcheck disable=SC2006,SC2268 # see below for rationale timestamp='2022-01-03' # This file 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 . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # Please send patches to . # # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # You can get the latest version of this script from: # https://git.savannah.gnu.org/cgit/config.git/plain/config.sub # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. # The "shellcheck disable" line above the timestamp inhibits complaints # about features and limitations of the classic Bourne shell that were # superseded or lifted in POSIX. However, this script identifies a wide # variety of pre-POSIX systems that do not have POSIX shells at all, and # even some reasonably current systems (Solaris 10 as case-in-point) still # have a pre-POSIX /bin/sh. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] CPU-MFR-OPSYS or ALIAS Canonicalize a configuration name. Options: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.sub ($timestamp) Copyright 1992-2022 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; *local*) # First pass through any local machine types. echo "$1" exit ;; * ) break ;; esac done case $# in 0) echo "$me: missing argument$help" >&2 exit 1;; 1) ;; *) echo "$me: too many arguments$help" >&2 exit 1;; esac # Split fields of configuration type # shellcheck disable=SC2162 saved_IFS=$IFS IFS="-" read field1 field2 field3 field4 <&2 exit 1 ;; *-*-*-*) basic_machine=$field1-$field2 basic_os=$field3-$field4 ;; *-*-*) # Ambiguous whether COMPANY is present, or skipped and KERNEL-OS is two # parts maybe_os=$field2-$field3 case $maybe_os in nto-qnx* | linux-* | uclinux-uclibc* \ | uclinux-gnu* | kfreebsd*-gnu* | knetbsd*-gnu* | netbsd*-gnu* \ | netbsd*-eabi* | kopensolaris*-gnu* | cloudabi*-eabi* \ | storm-chaos* | os2-emx* | rtmk-nova*) basic_machine=$field1 basic_os=$maybe_os ;; android-linux) basic_machine=$field1-unknown basic_os=linux-android ;; *) basic_machine=$field1-$field2 basic_os=$field3 ;; esac ;; *-*) # A lone config we happen to match not fitting any pattern case $field1-$field2 in decstation-3100) basic_machine=mips-dec basic_os= ;; *-*) # Second component is usually, but not always the OS case $field2 in # Prevent following clause from handling this valid os sun*os*) basic_machine=$field1 basic_os=$field2 ;; zephyr*) basic_machine=$field1-unknown basic_os=$field2 ;; # Manufacturers dec* | mips* | sequent* | encore* | pc533* | sgi* | sony* \ | att* | 7300* | 3300* | delta* | motorola* | sun[234]* \ | unicom* | ibm* | next | hp | isi* | apollo | altos* \ | convergent* | ncr* | news | 32* | 3600* | 3100* \ | hitachi* | c[123]* | convex* | sun | crds | omron* | dg \ | ultra | tti* | harris | dolphin | highlevel | gould \ | cbm | ns | masscomp | apple | axis | knuth | cray \ | microblaze* | sim | cisco \ | oki | wec | wrs | winbond) basic_machine=$field1-$field2 basic_os= ;; *) basic_machine=$field1 basic_os=$field2 ;; esac ;; esac ;; *) # Convert single-component short-hands not valid as part of # multi-component configurations. case $field1 in 386bsd) basic_machine=i386-pc basic_os=bsd ;; a29khif) basic_machine=a29k-amd basic_os=udi ;; adobe68k) basic_machine=m68010-adobe basic_os=scout ;; alliant) basic_machine=fx80-alliant basic_os= ;; altos | altos3068) basic_machine=m68k-altos basic_os= ;; am29k) basic_machine=a29k-none basic_os=bsd ;; amdahl) basic_machine=580-amdahl basic_os=sysv ;; amiga) basic_machine=m68k-unknown basic_os= ;; amigaos | amigados) basic_machine=m68k-unknown basic_os=amigaos ;; amigaunix | amix) basic_machine=m68k-unknown basic_os=sysv4 ;; apollo68) basic_machine=m68k-apollo basic_os=sysv ;; apollo68bsd) basic_machine=m68k-apollo basic_os=bsd ;; aros) basic_machine=i386-pc basic_os=aros ;; aux) basic_machine=m68k-apple basic_os=aux ;; balance) basic_machine=ns32k-sequent basic_os=dynix ;; blackfin) basic_machine=bfin-unknown basic_os=linux ;; cegcc) basic_machine=arm-unknown basic_os=cegcc ;; convex-c1) basic_machine=c1-convex basic_os=bsd ;; convex-c2) basic_machine=c2-convex basic_os=bsd ;; convex-c32) basic_machine=c32-convex basic_os=bsd ;; convex-c34) basic_machine=c34-convex basic_os=bsd ;; convex-c38) basic_machine=c38-convex basic_os=bsd ;; cray) basic_machine=j90-cray basic_os=unicos ;; crds | unos) basic_machine=m68k-crds basic_os= ;; da30) basic_machine=m68k-da30 basic_os= ;; decstation | pmax | pmin | dec3100 | decstatn) basic_machine=mips-dec basic_os= ;; delta88) basic_machine=m88k-motorola basic_os=sysv3 ;; dicos) basic_machine=i686-pc basic_os=dicos ;; djgpp) basic_machine=i586-pc basic_os=msdosdjgpp ;; ebmon29k) basic_machine=a29k-amd basic_os=ebmon ;; es1800 | OSE68k | ose68k | ose | OSE) basic_machine=m68k-ericsson basic_os=ose ;; gmicro) basic_machine=tron-gmicro basic_os=sysv ;; go32) basic_machine=i386-pc basic_os=go32 ;; h8300hms) basic_machine=h8300-hitachi basic_os=hms ;; h8300xray) basic_machine=h8300-hitachi basic_os=xray ;; h8500hms) basic_machine=h8500-hitachi basic_os=hms ;; harris) basic_machine=m88k-harris basic_os=sysv3 ;; hp300 | hp300hpux) basic_machine=m68k-hp basic_os=hpux ;; hp300bsd) basic_machine=m68k-hp basic_os=bsd ;; hppaosf) basic_machine=hppa1.1-hp basic_os=osf ;; hppro) basic_machine=hppa1.1-hp basic_os=proelf ;; i386mach) basic_machine=i386-mach basic_os=mach ;; isi68 | isi) basic_machine=m68k-isi basic_os=sysv ;; m68knommu) basic_machine=m68k-unknown basic_os=linux ;; magnum | m3230) basic_machine=mips-mips basic_os=sysv ;; merlin) basic_machine=ns32k-utek basic_os=sysv ;; mingw64) basic_machine=x86_64-pc basic_os=mingw64 ;; mingw32) basic_machine=i686-pc basic_os=mingw32 ;; mingw32ce) basic_machine=arm-unknown basic_os=mingw32ce ;; monitor) basic_machine=m68k-rom68k basic_os=coff ;; morphos) basic_machine=powerpc-unknown basic_os=morphos ;; moxiebox) basic_machine=moxie-unknown basic_os=moxiebox ;; msdos) basic_machine=i386-pc basic_os=msdos ;; msys) basic_machine=i686-pc basic_os=msys ;; mvs) basic_machine=i370-ibm basic_os=mvs ;; nacl) basic_machine=le32-unknown basic_os=nacl ;; ncr3000) basic_machine=i486-ncr basic_os=sysv4 ;; netbsd386) basic_machine=i386-pc basic_os=netbsd ;; netwinder) basic_machine=armv4l-rebel basic_os=linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony basic_os=newsos ;; news1000) basic_machine=m68030-sony basic_os=newsos ;; necv70) basic_machine=v70-nec basic_os=sysv ;; nh3000) basic_machine=m68k-harris basic_os=cxux ;; nh[45]000) basic_machine=m88k-harris basic_os=cxux ;; nindy960) basic_machine=i960-intel basic_os=nindy ;; mon960) basic_machine=i960-intel basic_os=mon960 ;; nonstopux) basic_machine=mips-compaq basic_os=nonstopux ;; os400) basic_machine=powerpc-ibm basic_os=os400 ;; OSE68000 | ose68000) basic_machine=m68000-ericsson basic_os=ose ;; os68k) basic_machine=m68k-none basic_os=os68k ;; paragon) basic_machine=i860-intel basic_os=osf ;; parisc) basic_machine=hppa-unknown basic_os=linux ;; psp) basic_machine=mipsallegrexel-sony basic_os=psp ;; pw32) basic_machine=i586-unknown basic_os=pw32 ;; rdos | rdos64) basic_machine=x86_64-pc basic_os=rdos ;; rdos32) basic_machine=i386-pc basic_os=rdos ;; rom68k) basic_machine=m68k-rom68k basic_os=coff ;; sa29200) basic_machine=a29k-amd basic_os=udi ;; sei) basic_machine=mips-sei basic_os=seiux ;; sequent) basic_machine=i386-sequent basic_os= ;; sps7) basic_machine=m68k-bull basic_os=sysv2 ;; st2000) basic_machine=m68k-tandem basic_os= ;; stratus) basic_machine=i860-stratus basic_os=sysv4 ;; sun2) basic_machine=m68000-sun basic_os= ;; sun2os3) basic_machine=m68000-sun basic_os=sunos3 ;; sun2os4) basic_machine=m68000-sun basic_os=sunos4 ;; sun3) basic_machine=m68k-sun basic_os= ;; sun3os3) basic_machine=m68k-sun basic_os=sunos3 ;; sun3os4) basic_machine=m68k-sun basic_os=sunos4 ;; sun4) basic_machine=sparc-sun basic_os= ;; sun4os3) basic_machine=sparc-sun basic_os=sunos3 ;; sun4os4) basic_machine=sparc-sun basic_os=sunos4 ;; sun4sol2) basic_machine=sparc-sun basic_os=solaris2 ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun basic_os= ;; sv1) basic_machine=sv1-cray basic_os=unicos ;; symmetry) basic_machine=i386-sequent basic_os=dynix ;; t3e) basic_machine=alphaev5-cray basic_os=unicos ;; t90) basic_machine=t90-cray basic_os=unicos ;; toad1) basic_machine=pdp10-xkl basic_os=tops20 ;; tpf) basic_machine=s390x-ibm basic_os=tpf ;; udi29k) basic_machine=a29k-amd basic_os=udi ;; ultra3) basic_machine=a29k-nyu basic_os=sym1 ;; v810 | necv810) basic_machine=v810-nec basic_os=none ;; vaxv) basic_machine=vax-dec basic_os=sysv ;; vms) basic_machine=vax-dec basic_os=vms ;; vsta) basic_machine=i386-pc basic_os=vsta ;; vxworks960) basic_machine=i960-wrs basic_os=vxworks ;; vxworks68) basic_machine=m68k-wrs basic_os=vxworks ;; vxworks29k) basic_machine=a29k-wrs basic_os=vxworks ;; xbox) basic_machine=i686-pc basic_os=mingw32 ;; ymp) basic_machine=ymp-cray basic_os=unicos ;; *) basic_machine=$1 basic_os= ;; esac ;; esac # Decode 1-component or ad-hoc basic machines case $basic_machine in # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. w89k) cpu=hppa1.1 vendor=winbond ;; op50n) cpu=hppa1.1 vendor=oki ;; op60c) cpu=hppa1.1 vendor=oki ;; ibm*) cpu=i370 vendor=ibm ;; orion105) cpu=clipper vendor=highlevel ;; mac | mpw | mac-mpw) cpu=m68k vendor=apple ;; pmac | pmac-mpw) cpu=powerpc vendor=apple ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) cpu=m68000 vendor=att ;; 3b*) cpu=we32k vendor=att ;; bluegene*) cpu=powerpc vendor=ibm basic_os=cnk ;; decsystem10* | dec10*) cpu=pdp10 vendor=dec basic_os=tops10 ;; decsystem20* | dec20*) cpu=pdp10 vendor=dec basic_os=tops20 ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) cpu=m68k vendor=motorola ;; dpx2*) cpu=m68k vendor=bull basic_os=sysv3 ;; encore | umax | mmax) cpu=ns32k vendor=encore ;; elxsi) cpu=elxsi vendor=elxsi basic_os=${basic_os:-bsd} ;; fx2800) cpu=i860 vendor=alliant ;; genix) cpu=ns32k vendor=ns ;; h3050r* | hiux*) cpu=hppa1.1 vendor=hitachi basic_os=hiuxwe2 ;; hp3k9[0-9][0-9] | hp9[0-9][0-9]) cpu=hppa1.0 vendor=hp ;; hp9k2[0-9][0-9] | hp9k31[0-9]) cpu=m68000 vendor=hp ;; hp9k3[2-9][0-9]) cpu=m68k vendor=hp ;; hp9k6[0-9][0-9] | hp6[0-9][0-9]) cpu=hppa1.0 vendor=hp ;; hp9k7[0-79][0-9] | hp7[0-79][0-9]) cpu=hppa1.1 vendor=hp ;; hp9k78[0-9] | hp78[0-9]) # FIXME: really hppa2.0-hp cpu=hppa1.1 vendor=hp ;; hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) # FIXME: really hppa2.0-hp cpu=hppa1.1 vendor=hp ;; hp9k8[0-9][13679] | hp8[0-9][13679]) cpu=hppa1.1 vendor=hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) cpu=hppa1.0 vendor=hp ;; i*86v32) cpu=`echo "$1" | sed -e 's/86.*/86/'` vendor=pc basic_os=sysv32 ;; i*86v4*) cpu=`echo "$1" | sed -e 's/86.*/86/'` vendor=pc basic_os=sysv4 ;; i*86v) cpu=`echo "$1" | sed -e 's/86.*/86/'` vendor=pc basic_os=sysv ;; i*86sol2) cpu=`echo "$1" | sed -e 's/86.*/86/'` vendor=pc basic_os=solaris2 ;; j90 | j90-cray) cpu=j90 vendor=cray basic_os=${basic_os:-unicos} ;; iris | iris4d) cpu=mips vendor=sgi case $basic_os in irix*) ;; *) basic_os=irix4 ;; esac ;; miniframe) cpu=m68000 vendor=convergent ;; *mint | mint[0-9]* | *MiNT | *MiNT[0-9]*) cpu=m68k vendor=atari basic_os=mint ;; news-3600 | risc-news) cpu=mips vendor=sony basic_os=newsos ;; next | m*-next) cpu=m68k vendor=next case $basic_os in openstep*) ;; nextstep*) ;; ns2*) basic_os=nextstep2 ;; *) basic_os=nextstep3 ;; esac ;; np1) cpu=np1 vendor=gould ;; op50n-* | op60c-*) cpu=hppa1.1 vendor=oki basic_os=proelf ;; pa-hitachi) cpu=hppa1.1 vendor=hitachi basic_os=hiuxwe2 ;; pbd) cpu=sparc vendor=tti ;; pbb) cpu=m68k vendor=tti ;; pc532) cpu=ns32k vendor=pc532 ;; pn) cpu=pn vendor=gould ;; power) cpu=power vendor=ibm ;; ps2) cpu=i386 vendor=ibm ;; rm[46]00) cpu=mips vendor=siemens ;; rtpc | rtpc-*) cpu=romp vendor=ibm ;; sde) cpu=mipsisa32 vendor=sde basic_os=${basic_os:-elf} ;; simso-wrs) cpu=sparclite vendor=wrs basic_os=vxworks ;; tower | tower-32) cpu=m68k vendor=ncr ;; vpp*|vx|vx-*) cpu=f301 vendor=fujitsu ;; w65) cpu=w65 vendor=wdc ;; w89k-*) cpu=hppa1.1 vendor=winbond basic_os=proelf ;; none) cpu=none vendor=none ;; leon|leon[3-9]) cpu=sparc vendor=$basic_machine ;; leon-*|leon[3-9]-*) cpu=sparc vendor=`echo "$basic_machine" | sed 's/-.*//'` ;; *-*) # shellcheck disable=SC2162 saved_IFS=$IFS IFS="-" read cpu vendor <&2 exit 1 ;; esac ;; esac # Here we canonicalize certain aliases for manufacturers. case $vendor in digital*) vendor=dec ;; commodore*) vendor=cbm ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if test x$basic_os != x then # First recognize some ad-hoc cases, or perhaps split kernel-os, or else just # set os. case $basic_os in gnu/linux*) kernel=linux os=`echo "$basic_os" | sed -e 's|gnu/linux|gnu|'` ;; os2-emx) kernel=os2 os=`echo "$basic_os" | sed -e 's|os2-emx|emx|'` ;; nto-qnx*) kernel=nto os=`echo "$basic_os" | sed -e 's|nto-qnx|qnx|'` ;; *-*) # shellcheck disable=SC2162 saved_IFS=$IFS IFS="-" read kernel os <&2 exit 1 ;; esac # As a final step for OS-related things, validate the OS-kernel combination # (given a valid OS), if there is a kernel. case $kernel-$os in linux-gnu* | linux-dietlibc* | linux-android* | linux-newlib* \ | linux-musl* | linux-relibc* | linux-uclibc* ) ;; uclinux-uclibc* ) ;; -dietlibc* | -newlib* | -musl* | -relibc* | -uclibc* ) # These are just libc implementations, not actual OSes, and thus # require a kernel. echo "Invalid configuration \`$1': libc \`$os' needs explicit kernel." 1>&2 exit 1 ;; kfreebsd*-gnu* | kopensolaris*-gnu*) ;; vxworks-simlinux | vxworks-simwindows | vxworks-spe) ;; nto-qnx*) ;; os2-emx) ;; *-eabi* | *-gnueabi*) ;; -*) # Blank kernel with real OS is always fine. ;; *-*) echo "Invalid configuration \`$1': Kernel \`$kernel' not known to work with OS \`$os'." 1>&2 exit 1 ;; esac # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. case $vendor in unknown) case $cpu-$os in *-riscix*) vendor=acorn ;; *-sunos*) vendor=sun ;; *-cnk* | *-aix*) vendor=ibm ;; *-beos*) vendor=be ;; *-hpux*) vendor=hp ;; *-mpeix*) vendor=hp ;; *-hiux*) vendor=hitachi ;; *-unos*) vendor=crds ;; *-dgux*) vendor=dg ;; *-luna*) vendor=omron ;; *-genix*) vendor=ns ;; *-clix*) vendor=intergraph ;; *-mvs* | *-opened*) vendor=ibm ;; *-os400*) vendor=ibm ;; s390-* | s390x-*) vendor=ibm ;; *-ptx*) vendor=sequent ;; *-tpf*) vendor=ibm ;; *-vxsim* | *-vxworks* | *-windiss*) vendor=wrs ;; *-aux*) vendor=apple ;; *-hms*) vendor=hitachi ;; *-mpw* | *-macos*) vendor=apple ;; *-*mint | *-mint[0-9]* | *-*MiNT | *-MiNT[0-9]*) vendor=atari ;; *-vos*) vendor=stratus ;; esac ;; esac echo "$cpu-$vendor-${kernel:+$kernel-}$os" exit # Local variables: # eval: (add-hook 'before-save-hook 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: libspiro-20221101/configure.ac000066400000000000000000000257631433036472700161030ustar00rootroot00000000000000# -*- Autoconf -*- dnl Process this file with autoconf to produce a configure script. # Copyright (C) 2013...2020 by Joe Da Silva AC_PREREQ([2.64]) #------------------------------------------- # PackageTimestamp version m4_define([spiro_package_stamp], [20221101]) #------------------------------------------- # Making point releases: # spiro_major_version += 0; # spiro_minor_version += 1; (patches or added function(s)) # # If any new functions have been added: # spiro_major_version += 0; # spiro_minor_version += 1; (added function(s)) # # If backwards compatibility has been broken: # spiro_major_version += 1; # spiro_minor_version = 0; # m4_define([spiro_major_version], [1]) m4_define([spiro_minor_version], [3]) m4_define([spiro_version],[spiro_major_version.spiro_minor_version]) #------------------------------------------- # Updating the libtool version should be set # independently of the library's major/minor # version, execute the following for C:R:A # # 1. If the code has changed at all (e.g., an update): # spiro_revision += 1 # # 2. If any interfaces are added, removed, or changed # (e.g., a new function has been added): # spiro_current += 1 # spiro_revision = 0 # # 3. If any interfaces have been added: # spiro_age += 1 # # 4. If any interfaces have been removed or changed # (i.e., backwards compatibility has been broken): # spiro_age = 0 # m4_define([spiro_current], [1]) m4_define([spiro_revision],[3]) m4_define([spiro_age], [0]) m4_define([spiro_libver],[spiro_current:spiro_revision:spiro_age]) m4_define([spiro_package_name], [libspiro]) AC_INIT([spiro],[spiro_package_stamp],[fontforge-devel@lists.sourceforge.net], [spiro_package_name],[https://github.com/fontforge/libspiro]) #------------------------------------------- AC_CONFIG_SRCDIR([spiro.c]) AC_CONFIG_MACRO_DIR([m4]) AC_CANONICAL_SYSTEM AC_CANONICAL_HOST AC_CANONICAL_BUILD AM_INIT_AUTOMAKE([foreign -Wall]) #------------------------------------------- # automake 1.12 seems to require AM_PROG_AR, # but automake 1.11 doesn't recognize it. m4_ifdef([AM_PROG_AR], [AM_PROG_AR]) LT_INIT AC_SUBST([LIBTOOL_DEPS]) # Check building environment # AC_CHECK_TOOL([CC],[gcc],[:]) AC_PROG_CC AC_ENABLE_SHARED AC_PROG_LN_S AC_PROG_MKDIR_P AC_PROG_MAKE_SET AC_PROG_SED AC_CHECK_TOOL([VALGRIND],[valgrind],[:]) AC_CHECK_TOOL([STRIP],[strip],[:]) AC_CONFIG_HEADERS([spiro-config.h]) AC_PROG_INSTALL #------------------------------------------- # Indicate this is a release build and that # dependancies for changes between Makefile.am # and Makefile.in should not be checked. This # makes compiling faster. If you are working # on the library, run: # ./configure --enable-maintainer-mode # to enable the dependancies dnl AM_MAINTAINER_MODE([enable]) #------------------------------------------- # Enable silent build rules by default, this # requires atleast Automake-1.11. Disable by # either passing --disable-silent-rules to # configure or passing V=1 to make m4_ifdef([AM_SILENT_RULES],[AM_SILENT_RULES([yes])],[AC_SUBST([AM_DEFAULT_VERBOSITY],[1])]) #------------------------------------------- # Check for math.h include and math library. # Old distros, use CHECK as a SEARCH backup. AC_CHECK_HEADER([math.h], AC_SEARCH_LIBS([cos],[m],[have_libm=yes], AC_CHECK_LIB([m],[cos],[have_libm=yes]))) if test x"${have_libm}" != xyes; then AC_MSG_FAILURE([ERROR: Please install Math libraries and math.h include files for libm],[1]) fi #------------------------------------------- # Check for C99 hypot. Error if none found. # Older compilers will have to set/use C99. AC_CHECK_FUNCS(hypot, ,[AC_MSG_FAILURE([ERROR: hypot() required but not found.],[1])]) #------------------------------------------- # Check for C99 isfinite or finite. Use one. math_isfinite=no math_finite=no AC_CHECK_FUNCS(isfinite, [AC_DEFINE(HAVE_ISFINITE, 1) math_isfinite=true], [AC_LINK_IFELSE( [AC_LANG_PROGRAM( [[#include ]], [[double f = 0.0; isfinite(f)]])], [AC_DEFINE(HAVE_ISFINITE, 1) math_isfinite=true], [AC_CHECK_FUNCS(finite, [AC_DEFINE(HAVE_FINITE, 1) math_finite=true])])]) if test x"${math_isfinite}" = xno && test x"${math_finite}" = xno; then AC_MSG_FAILURE([ERROR: isfinite() or finite() required but not found.],[1]) fi AC_SUBST(HAVE_FINITE) AC_SUBST(HAVE_ISFINITE) AH_BOTTOM([/* Define IS_FINITE(x) to isfinite(x) or finite(x) */ #if HAVE_ISFINITE #define IS_FINITE(x) isfinite(x) #else #if HAVE_FINITE #define IS_FINITE(x) finite(x) #endif #endif]) #------------------------------------------- # Enable VERBOSE flag in library AC_ARG_ENABLE([verbose_lib],AS_HELP_STRING([--enable-verbose_lib],[Verbose library output (for debugging).]), [case "${enableval}" in yes) verbose_lib=true ;; no) verbose_lib=false ;; *) AC_MSG_ERROR([bad value ${enableval} for --enable-verbose_lib]) ;; esac],[verbose_lib=false]) if test x"${verbose_lib}" = xtrue; then AC_DEFINE(VERBOSE,[1],[Verbose library printf() output enabled for debugging.]) fi #------------------------------------------- # Enable input CHECK_INPUT_FINITENESS flag AC_ARG_ENABLE([test_inputs],AS_HELP_STRING([--enable-test_inputs],[Test input values for finiteness.]), [case "${enableval}" in yes) test_inputs=true ;; no) test_inputs=false ;; *) AC_MSG_ERROR([bad value ${enableval} for --enable-test_inputs]) ;; esac],[test_inputs=false]) if test x"${test_inputs}" = xtrue; then AC_DEFINE(CHECK_INPUT_FINITENESS,[1],[Check if input values are realistic and not infinite in value.]) fi #------------------------------------------- # call-test uses pthread for testing (if you # have it), but libspiro doesn't require it. AC_CHECK_HEADER([pthread.h],[havepthreads=true] AC_DEFINE(HAVE_PTHREADS,[1],[Have pthreads.h. Do multi-user check in call-test.]), [have_pthreads = xfalse]) AM_CONDITIONAL([WANTPTHREADS],[test x$havepthreads = xtrue]) #------------------------------------------- # call-test uses sys/timeb.h to display test # time lengths but libspiro doesn't need it. AC_CHECK_FUNC([gettimeofday],[have_gettimeofday=true],[have_gettimeofday=false]) AC_CHECK_HEADER([sys/time.h],[],[have_gettimeofday=false]) if test x"${have_gettimeofday}" = xtrue; then AC_DEFINE_UNQUOTED([DO_TIME_DAY],[1],[Use 'gettimeofday()==true, else use older sys/timeb.h]) else AC_CHECK_HEADER([sys/timeb.h],[], [AC_MSG_ERROR([ERROR: Please install time.h and sys/timeb.h developer files],[1])]) fi #------------------------------------------- # The 'make check' test 'call-testm.c' runs # many threads at once to test calculations. # This number is set at a default of 100 to # meet automated-test 'time-out' deadlines. # Recommend maintainers/developers run 1000+ testalot=100 AC_ARG_ENABLE([test_a_lot], AS_HELP_STRING([--enable-test_a_lot],[Run lots of multithread tests.]), [testalot=2000]) AC_DEFINE_UNQUOTED([S_TESTP],[$testalot], [Do 'S_TESTS' multi-thread 'call-testm' checks when you run 'make check'.]) #------------------------------------------- # Pass some spiro.c definitions AC_DEFINE([LS_VERSION_MJ],[spiro_major_version],[Libspiro version major value]) AC_DEFINE([LS_VERSION_MN],[spiro_minor_version],[Libspiro version minor value]) AC_DEFINE([LS_VERSION_STR],["spiro_version"],[Libspiro Major.Minor value. Report this back]) #------------------------------------------- # Platform specific stuff ($host) #------------------------------------------- # Compiler and Linker flags to override auto # detection and insertion. Use CFLAGS if you # want to add more in addition to autodetect AC_ARG_VAR([LS_CFLAGS],[C compiler flags for libspiro, overriding automatic detection]) AC_ARG_VAR([LS_LIB],[Linker flags for libspiro, overriding automatic detection]) #------------------------------------------- # Check for and add usable compiler warnings # Skip if replacing with LS_CFLAGS instead. WCFLAGS="" AC_LANG_PUSH([C]) AX_CHECK_COMPILE_FLAG([-Wall],[WCFLAGS="$WCFLAGS -Wall"]) AX_CHECK_COMPILE_FLAG([-Wextra],[WCFLAGS="$WCFLAGS -Wextra"]) AX_CHECK_COMPILE_FLAG([-Wcast-align],[WCFLAGS="$WCFLAGS -Wcast-align"]) AX_CHECK_COMPILE_FLAG([-Wbad-function-cast],[WCFLAGS="$WCFLAGS -Wbad-function-cast"]) AX_CHECK_COMPILE_FLAG([-Wc++-compat],[WCFLAGS="$WCFLAGS -Wc++-compat"]) AX_CHECK_COMPILE_FLAG([-Wmissing-prototypes],[WCFLAGS="$WCFLAGS -Wmissing-prototypes"]) AX_CHECK_COMPILE_FLAG([-Wunused],[WCFLAGS="$WCFLAGS -Wunused"]) AX_CHECK_COMPILE_FLAG([-Wdeprecated-declarations],[WCFLAGS="$WCFLAGS -Wdeprecated-declarations"]) AX_CHECK_COMPILE_FLAG([-Wconversion],[WCFLAGS="$WCFLAGS -Wconversion"]) AX_CHECK_COMPILE_FLAG([-Wsign-conversion],[WCFLAGS="$WCFLAGS -Wsign-conversion"]) AX_CHECK_COMPILE_FLAG([-Wformat=2],[WCFLAGS="$WCFLAGS -Wformat=2"]) AX_CHECK_COMPILE_FLAG([-Wformat-security],[WCFLAGS="$WCFLAGS -Wformat-security"]) AX_CHECK_COMPILE_FLAG([-fno-common],[WCFLAGS="$WCFLAGS -fno-common"]) AX_CHECK_COMPILE_FLAG([-Wmissing-declarations],[WCFLAGS="$WCFLAGS -Wmissing-declarations"]) AX_CHECK_COMPILE_FLAG([-Wstrict-prototypes],[WCFLAGS="$WCFLAGS -Wstrict-prototypes"]) AX_CHECK_COMPILE_FLAG([-fPIC],[WCFLAGS="$WCFLAGS -fPIC"]) AX_CHECK_COMPILE_FLAG([-Wstrict-overflow],[WCFLAGS="$WCFLAGS -Wstrict-overflow"]) AX_CHECK_COMPILE_FLAG([-Wpointer-arith],[WCFLAGS="$WCFLAGS -Wpointer-arith"]) AX_CHECK_COMPILE_FLAG([-Wcast-qual],[WCFLAGS="$WCFLAGS -Wcast-qual"]) AX_CHECK_COMPILE_FLAG([-Wcast-align],[WCFLAGS="$WCFLAGS -Wcast-align"]) AX_CHECK_COMPILE_FLAG([-Wpadded],[WCFLAGS="$WCFLAGS -Wpadded"]) AX_CHECK_COMPILE_FLAG([-Woverlength-strings],[WCFLAGS="$WCFLAGS -Woverlength-strings"]) dnl NOTE: -fsanitize has to be first library dnl and will also conflict with other checks dnl like valgrind due to similar test checks dnl AX_CHECK_COMPILE_FLAG([-fsanitize=address],[CFLAGS=" -fsanitize=address $CFLAGS"]) dnl NOTE: -fstack-protector may be simulated dnl on 32bit linux using these extra params: dnl ./configure CFLAGS="-fstack-protector --param ssp-buffer-size=4 -g -O0" dnl out-of-the-box params for open/free bsd: dnl AX_CHECK_COMPILE_FLAG([-fstack-protector],[CFLAGS=" -fstack-protector"]) AC_LANG_POP # Skip if replacing with LS_LIB instead. WLSLIB="" if test -z $LS_LIB ; then WLSLIB="${WCFLAGS}" fi if test "${LS_CFLAGS}"x != x; then WCFLAGS="" fi #------------------------------------------- # Put ifdef wrapper around spiro-config.h so # that we don't accidently call it twice. AH_TOP([#ifndef _SPIRO_CONFIG_H #define _SPIRO_CONFIG_H 1]) AH_BOTTOM([#endif]) #------------------------------------------- # Pass variables to MAKEFILE.AM AC_SUBST([HOST],[host]) AC_SUBST([LIBSPIRO_VERSION],[spiro_libver]) AC_SUBST([LS_CFLAGS]) AC_SUBST([LS_LIB]) AC_SUBST([WCFLAGS]) AC_SUBST([WLSLIB]) AM_CONDITIONAL([HAVEVALGRIND],[test "${VALGRIND}"x != x]) #------------------------------------------- AC_PROG_LIBTOOL AC_CONFIG_FILES([ Makefile tests/Makefile libspiro.pc ]) AC_OUTPUT AC_MSG_NOTICE([ Configuration: Source code location ${srcdir} Build code location ${builddir} Destination prefix ${prefix} Compiler ${CC} Config auto WCFLAGS "${WCFLAGS}" Config auto WLSLIB "${WLSLIB}" Config CFLAGS "${CFLAGS}" Config LDFLAGS "${LDFLAGS}" Config LS_CFLAGS "${LS_CFLAGS}" Config LS_LIB "${LS_LIB}" ]) libspiro-20221101/java/000077500000000000000000000000001433036472700145215ustar00rootroot00000000000000libspiro-20221101/java/ShowPlate.java000066400000000000000000000022241433036472700172720ustar00rootroot00000000000000 package net.sourceforge.libspiro; import java.awt.*; class ShowPlate { public static void main( String [] args) { SpiroCP [][] contours; String arg; SpiroGeneralPath sgp; java.awt.geom.GeneralPath gp; int i,j; java.awt.Rectangle size; for ( i=0; i Math.abs(pivot_val)) { pivot_val = m[j].a[0]; pivot = j; } perm[k] = pivot; if (pivot != k) { for (j = 0; j < 11; j++) { double tmp = m[k].a[j]; m[k].a[j] = m[pivot].a[j]; m[pivot].a[j] = tmp; } } if (Math.abs(pivot_val) < 1e-12) pivot_val = 1e-12; pivot_scale = 1. / pivot_val; for (i = k + 1; i < l; i++) { double x = m[i].a[0] * pivot_scale; m[k].al[i - k - 1] = x; for (j = 1; j < 11; j++) m[i].a[j - 1] = m[i].a[j] - x * m[k].a[j]; m[i].a[10] = 0.; } } } static protected void banbks11(final bandmat [] m, final int [] perm, double [] v, int n) { int i, k, l; /* forward substitution */ l = 5; for (k = 0; k < n; k++) { i = perm[k]; if (i != k) { double tmp = v[k]; v[k] = v[i]; v[i] = tmp; } if (l < n) l++; for (i = k + 1; i < l; i++) v[i] -= m[k].al[i - k - 1] * v[k]; } /* back substitution */ l = 1; for (i = n - 1; i >= 0; i--) { double x = v[i]; for (k = 1; k < l; k++) x -= m[i].a[k] * v[k + i]; v[i] = x / m[i].a[0]; if (l < 11) l++; } } static protected int compute_jinc(SpiroPointType ty0, SpiroPointType ty1) { if (ty0 == G4 || ty1 == G4 || ty0 == RIGHT || ty1 == LEFT) return 4; else if (ty0 == G2 && ty1 == G2) return 2; else if (((ty0 == OPEN || ty0 == CORNER || ty0 == LEFT) && ty1 == G2) || (ty0 == G2 && (ty1 == OPEN_END || ty1 == CORNER || ty1 == RIGHT))) return 1; else return 0; } static protected int count_vec(final spiro_seg [] s, int nseg) { int i; int n = 0; for (i = 0; i < nseg; i++) n += compute_jinc(s[i].type, s[i + 1].type); return n; } static protected void add_mat_line(bandmat [] m, double [] v, double [/*4*/] derivs, double x, double y, int j, int jj, int jinc, int nmat) { int k; if (jj >= 0) { int joff = (j + 5 - jj + nmat) % nmat; if (nmat < 6) { joff = j + 5 - jj; } else if (nmat == 6) { joff = 2 + (j + 3 - jj + nmat) % nmat; } v[jj] += x; for (k = 0; k < jinc; k++) m[jj].a[joff + k] += y * derivs[k]; } } static protected double spiro_iter(spiro_seg [] s, bandmat [] m, int [] perm, double [] v, int n) { boolean cyclic = s[0].type != OPEN && s[0].type != CORNER; int i, j, jj; int nmat = count_vec(s, n); double norm; int n_invert; for (i = 0; i < nmat; i++) { v[i] = 0.; m[i] = new bandmat(); m[i].a = new double[] { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; m[i].al = new double[] { 0, 0, 0, 0, 0 }; } j = 0; if (s[0].type == G4) jj = nmat - 2; else if (s[0].type == G2) jj = nmat - 1; else jj = 0; for (i = 0; i < n; i++) { SpiroPointType ty0 = s[i].type; SpiroPointType ty1 = s[i + 1].type; int jinc = compute_jinc(ty0, ty1); double th = s[i].bend_th; double [][] ends = new double[2][4]; double [][][] derivs = new double[4][2][4]; int jthl = -1, jk0l = -1, jk1l = -1, jk2l = -1; int jthr = -1, jk0r = -1, jk1r = -1, jk2r = -1; compute_pderivs(s[i], ends, derivs, jinc); /* constraints crossing LEFT */ if (ty0 == G4 || ty0 == G2 || ty0 == LEFT || ty0 == RIGHT) { jthl = jj++; jj %= nmat; jk0l = jj++; } if (ty0 == G4) { jj %= nmat; jk1l = jj++; jk2l = jj++; } /* constraints on LEFT */ if ((ty0 == LEFT || ty0 == CORNER || ty0 == OPEN || ty0 == G2) && jinc == 4) { if (ty0 != G2) jk1l = jj++; jk2l = jj++; } /* constraints on RIGHT */ if ((ty1 == RIGHT || ty1 == CORNER || ty1 == OPEN_END || ty1 == G2) && jinc == 4) { if (ty1 != G2) jk1r = jj++; jk2r = jj++; } /* constraints crossing RIGHT */ if (ty1 == G4 || ty1 == G2 || ty1 == LEFT || ty1 == RIGHT) { jthr = jj; jk0r = (jj + 1) % nmat; } if (ty1 == G4) { jk1r = (jj + 2) % nmat; jk2r = (jj + 3) % nmat; } add_mat_line(m, v, derivs[0][0], th - ends[0][0], 1, j, jthl, jinc, nmat); add_mat_line(m, v, derivs[1][0], ends[0][1], -1, j, jk0l, jinc, nmat); add_mat_line(m, v, derivs[2][0], ends[0][2], -1, j, jk1l, jinc, nmat); add_mat_line(m, v, derivs[3][0], ends[0][3], -1, j, jk2l, jinc, nmat); add_mat_line(m, v, derivs[0][1], -ends[1][0], 1, j, jthr, jinc, nmat); add_mat_line(m, v, derivs[1][1], -ends[1][1], 1, j, jk0r, jinc, nmat); add_mat_line(m, v, derivs[2][1], -ends[1][2], 1, j, jk1r, jinc, nmat); add_mat_line(m, v, derivs[3][1], -ends[1][3], 1, j, jk2r, jinc, nmat); j += jinc; } if (cyclic) { bandmat.arraycopy(m, 0, m, nmat, nmat ); bandmat.arraycopy(m, 0, m, 2 * nmat, nmat ); System.arraycopy(v, 0, v, nmat, nmat); System.arraycopy(v, 0, v, 2 * nmat, nmat); n_invert = 3 * nmat; j = nmat; } else { n_invert = nmat; j = 0; } bandec11(m, perm, n_invert); banbks11(m, perm, v, n_invert); norm = 0.; for (i = 0; i < n; i++) { SpiroPointType ty0 = s[i].type; SpiroPointType ty1 = s[i + 1].type; int jinc = compute_jinc(ty0, ty1); int k; for (k = 0; k < jinc; k++) { double dk = v[j++]; s[i].ks[k] += dk; norm += dk * dk; } } return norm; } static protected int solve_spiro(spiro_seg [] s, int nseg) { bandmat [] m; double [] v; int [] perm; int nmat = count_vec(s, nseg); int n_alloc = nmat; double norm; int i; if (nmat == 0) return 0; if (s[0].type != OPEN && s[0].type != CORNER) n_alloc *= 3; if (n_alloc < 5) n_alloc = 5; m = new bandmat[n_alloc]; v = new double [n_alloc]; perm = new int [n_alloc]; for (i = 0; i < 10; i++) { norm = spiro_iter(s, m, perm, v, nseg); if (norm < 1e-12) break; } return 0; } static protected void spiro_seg_to_bpath(final double [/*4*/] ks, double x0, double y0, double x1, double y1, SpiroBezierContext bc, int depth) { double bend = Math.abs(ks[0]) + Math.abs(.5 * ks[1]) + Math.abs(.125 * ks[2]) + Math.abs((1./48) * ks[3]); if ( bend <= 1e-8) { bc.LineTo(x1, y1); } else { double seg_ch = Math.hypot(x1 - x0, y1 - y0); double seg_th = Math.atan2(y1 - y0, x1 - x0); double [] xy = new double[2]; double ch, th; double scale, rot; double th_even, th_odd; double ul, vl; double ur, vr; integrate_spiro(ks, xy); ch = Math.hypot(xy[0], xy[1]); th = Math.atan2(xy[1], xy[0]); scale = seg_ch / ch; rot = seg_th - th; if (depth > 5 || bend < 1.) { th_even = (1./384) * ks[3] + (1./8) * ks[1] + rot; th_odd = (1./48) * ks[2] + .5 * ks[0]; ul = (scale * (1./3)) * Math.cos(th_even - th_odd); vl = (scale * (1./3)) * Math.sin(th_even - th_odd); ur = (scale * (1./3)) * Math.cos(th_even + th_odd); vr = (scale * (1./3)) * Math.sin(th_even + th_odd); bc.CubicTo(x0 + ul, y0 + vl, x1 - ur, y1 - vr, x1, y1); } else { /* subdivide */ double [] ksub = new double[4]; double thsub; double [] xysub = new double[2]; double xmid, ymid; double cth, sth; ksub[0] = .5 * ks[0] - .125 * ks[1] + (1./64) * ks[2] - (1./768) * ks[3]; ksub[1] = .25 * ks[1] - (1./16) * ks[2] + (1./128) * ks[3]; ksub[2] = .125 * ks[2] - (1./32) * ks[3]; ksub[3] = (1./16) * ks[3]; thsub = rot - .25 * ks[0] + (1./32) * ks[1] - (1./384) * ks[2] + (1./6144) * ks[3]; cth = .5 * scale * Math.cos(thsub); sth = .5 * scale * Math.sin(thsub); integrate_spiro(ksub, xysub); xmid = x0 + cth * xysub[0] - sth * xysub[1]; ymid = y0 + cth * xysub[1] + sth * xysub[0]; spiro_seg_to_bpath(ksub, x0, y0, xmid, ymid, bc, depth + 1); ksub[0] += .25 * ks[1] + (1./384) * ks[3]; ksub[1] += .125 * ks[2]; ksub[2] += (1./16) * ks[3]; spiro_seg_to_bpath(ksub, xmid, ymid, x1, y1, bc, depth + 1); } } } static protected spiro_seg [] run_spiro(final SpiroCP []src, int n) { int nseg = src[0].type == OPEN ? n - 1 : n; spiro_seg [] s = setup_path(src, n); if (nseg > 1) solve_spiro(s, nseg); return s; } static protected void spiro_to_bpath(final spiro_seg []s, int n, SpiroBezierContext bc) { int i; int nsegs = s[n - 1].type == OPEN_END ? n - 1 : n; for (i = 0; i < nsegs; i++) { double x0 = s[i].x; double y0 = s[i].y; double x1 = s[i + 1].x; double y1 = s[i + 1].y; if (i == 0) bc.MoveTo(x0, y0, s[0].type == OPEN); bc.MarkKnot(i); spiro_seg_to_bpath(s[i].ks, x0, y0, x1, y1, bc, 0); } } static protected double get_knot_th(final spiro_seg []s, int i) { double [][] ends = new double[2][4]; if (i == 0) { compute_ends(s[i].ks, ends, s[i].seg_ch); return s[i].seg_th - ends[0][0]; } else { compute_ends(s[i - 1].ks, ends, s[i - 1].seg_ch); return s[i - 1].seg_th + ends[1][0]; } } /* ************************************************************************* */ /* *************************** public interface **************************** */ /* ************************************************************************* */ static public void SpiroCPsToBezier(SpiroCP [] spiros,int n,boolean isclosed,SpiroBezierContext bc) { spiro_seg []s; if ( n<1 ) return; if ( !isclosed ) { SpiroPointType oldty_start = spiros[0].type; SpiroPointType oldty_end = spiros[n-1].type; spiros[0].type= OPEN; spiros[n-1].type= OPEN_END; s = run_spiro(spiros,n); spiros[n-1].type= oldty_end; spiros[0].type= oldty_start; } else s = run_spiro(spiros,n); spiro_to_bpath(s,n,bc); } static public void TaggedSpiroCPsToBezier(SpiroCP [] spiros,SpiroBezierContext bc) { spiro_seg []s; int n; for ( n=0; spiros[n].type!=END && spiros[n].type!=OPEN_END; ++n ); if ( spiros[n].type == OPEN_END ) ++n; if ( n<1 ) return; s = run_spiro(spiros,n); spiro_to_bpath(s,n,bc); } /* ************************************************************************* */ /* ***************************** plate file IO ***************************** */ /* ************************************************************************* */ static public void SavePlateFile(Writer output,SpiroCP [][] spirocontours) throws IOException { int i,j; output.write("(plate\n"); for ( i=0; i0 && spiros[0].type!=OPEN ) output.write(" (z)\n"); } output.write(")\n"); } static public SpiroCP [][] ReadPlateFile(BufferedReader input) throws IOException { ArrayList sofar; ArrayList contour; int i,j; String str; char ch; SpiroPointType pt; double x,y; str = input.readLine(); if ( str==null ) return( null ); /* EOF already? */ if ( !str.trim().equals("(plate") ) { // Doesn't look like a plate file return( null ); } sofar = new ArrayList(); contour = new ArrayList(); while ( true ) { while( true ) { str = input.readLine(); if ( str==null ) break; str = str.trim(); if ( str.equals(")") || str.equals("(z)") ) break; if ( str.charAt(0)!='(' ) return( null ); for ( i=1; i=str.length()) return( null ); ch = str.charAt(i); if ( ch=='v' ) pt = CORNER; else if ( ch=='o' ) pt = G4; else if ( ch=='c' ) pt = G2; else if ( ch=='[' ) pt = LEFT; else if ( ch==']' ) pt = RIGHT; else if ( ch=='{' ) pt = OPEN; else if ( ch=='}' ) pt = OPEN_END; else return( null ); for ( ++i ; i=str.length() ) return( null ); try { x = Double.parseDouble(str.substring(i,j-1)); } catch ( NumberFormatException e ) { return( null ); } for ( i=j+1 ; i=str.length() ) return( null ); try { y = Double.parseDouble(str.substring(i,j-1)); } catch ( NumberFormatException e ) { return( null ); } contour.add( new SpiroCP(x,y,pt)); } contour.add( new SpiroCP(0,0,END)); sofar.add( contour.toArray(new SpiroCP[contour.size()])); contour.clear(); if ( str==null || str.equals(")") ) break; } return ( sofar.toArray( new SpiroCP [sofar.size()][] ) ); } } libspiro-20221101/java/SpiroBezierContext.java000066400000000000000000000022371433036472700211720ustar00rootroot00000000000000/* libspiro - conversion between spiro control points and bezier's Copyright (C) 2007 Raph Levien 2009 converted to Java by George Williams 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 2 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ package net.sourceforge.libspiro; public interface SpiroBezierContext { void MoveTo(double x, double y, boolean isOpen); void LineTo(double x, double y); void QuadTo(double x1, double y1, double x2, double y2); void CubicTo(double x1, double y1, double x2, double y2, double x3, double y3); void MarkKnot(int knotIdx); } libspiro-20221101/java/SpiroCP.java000066400000000000000000000025711433036472700167100ustar00rootroot00000000000000/* libspiro - conversion between spiro control points and bezier's Copyright (C) 2007 Raph Levien 2009 converted to Java by George Williams 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 2 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ package net.sourceforge.libspiro; import static net.sourceforge.libspiro.SpiroPointType.*; public class SpiroCP { public double x,y; SpiroPointType type; public SpiroCP(double xx, double yy, SpiroPointType ty) { x = xx; y = yy; type = ty; } public String toString() { return( String.format("(%c %g %g)", type==CORNER ? 'v' : type==G4 ? 'o' : type==G2 ? 'c' : type==LEFT ? '[' : type==RIGHT ? ']' : type==OPEN ? '{' : type==OPEN_END ? '}' : 'z', x, y )); } } libspiro-20221101/java/SpiroCanvas.java000066400000000000000000000004671433036472700176230ustar00rootroot00000000000000 package net.sourceforge.libspiro; import java.awt.*; class SpiroCanvas extends java.awt.Canvas { java.awt.geom.GeneralPath path; public SpiroCanvas(java.awt.geom.GeneralPath p) { super(); path = p; } public void paint(Graphics g) { Graphics2D g2 = (Graphics2D)g; g2.draw(path); } } libspiro-20221101/java/SpiroGeneralPath.java000066400000000000000000000017241433036472700205770ustar00rootroot00000000000000 package net.sourceforge.libspiro; import java.awt.*; class SpiroGeneralPath implements SpiroBezierContext { boolean wasOpen; java.awt.geom.GeneralPath gp; public SpiroGeneralPath() { gp = new java.awt.geom.GeneralPath(); } public java.awt.geom.GeneralPath getPath() { if ( wasOpen ) { gp.closePath(); wasOpen = false; } return( gp ); } public void MoveTo(double x, double y, boolean isOpen) { if ( wasOpen ) gp.closePath(); gp.moveTo((float) x,(float) y); wasOpen = isOpen; } public void LineTo(double x, double y) { gp.lineTo((float) x,(float) y); } public void QuadTo(double x1, double y1, double x2, double y2) { gp.quadTo((float) x1,(float) y1,(float) x2,(float) y2); } public void CubicTo(double x1, double y1, double x2, double y2, double x3, double y3) { gp.curveTo((float) x1,(float) y1,(float) x2,(float) y2,(float) x3,(float) y3); } public void MarkKnot(int knotIdx) {} } libspiro-20221101/java/SpiroPointType.java000066400000000000000000000017041433036472700203360ustar00rootroot00000000000000/* libspiro - conversion between spiro control points and bezier's Copyright (C) 2007 Raph Levien 2009 converted to Java by George Williams 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 2 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ package net.sourceforge.libspiro; public enum SpiroPointType { CORNER, G4, G2, LEFT, RIGHT, END, OPEN, OPEN_END } libspiro-20221101/libspiro.3000066400000000000000000000044621433036472700155150ustar00rootroot00000000000000.TH SPIRO 3 "2022-Jul-22" .SH NAME libspiro \- A clothoid to bezier spline converter .SH SYNOPSIS .B #include and then compile and link with .B -lspiro .br .SH DESCRIPTION .B Spiro library for curve design which simplifies drawing of beautiful curves. .B libspiro takes an array of spiro control points which can be easier for an artist to create and modify, and then converts these into a series of bezier splines which can then be used in the myriad of ways the world has come to use beziers. .I spiroentrypoints.h has technical information on how to connect with .I libspiro and further information and example code can be found at .I http://github.com/fontforge/libspiro .SH REPORTING PROBLEMS Before reporting a problem, please check the libspiro web site to verify that you have the latest version of .I libspiro Great care was taken to maintain backwards compatibility so it is recommended to upgrade if you experience problems with earlier .I libspiro versions. .SH LIBSPIRO LICENSE .B libspiro originated from spiro code (in 2007) found in .B ppedit which is a pattern plate editor for Spiro splines. .B ppedit was/is Copyright (C) 2007 Raph Levien. GNU GPL version 2 or higher. .B ppedit was later relicensed also as Apache-2 MIT code in May of 2019. This relicensing is fine since all .B ppedit was written by Raph Levien in 2007. Copyright allows for this. Unfortunately, this re-licensing of .B ppedit has caused some confusion in assuming that this relicensing also applies to .B libspiro which is not valid and does not apply. .B libspiro was based on .B ppedit spiro code from 2007 (which was GNU GPL2 version 2 or higher) and built into a usable library at .I http://libspiro.sourceforge.net/ Copyright (C) 2007 George Williams. GNU GPL version 2 or higher. This license also applies to the included Java files which have been forked into javascript and typeset files seen elsewhere. .B libspiro was later picked up in 2013 and continued with further development and improvements at .I http://github.com/fontforge/libspiro .B libspiro is now Copyright (C) 2013... as GNU GPL version 3 or higher. .SH AUTHORS Please see .I AUTHORS file for everyone involved in creating and improving this .I libspiro Further details (on why and what) can also be seen in git history as well as the Changelog and README files. libspiro-20221101/libspiro.pc.in000066400000000000000000000006441433036472700163600ustar00rootroot00000000000000prefix=@prefix@ exec_prefix=@exec_prefix@ libdir=@libdir@ includedir=@includedir@ datarootdir=@datarootdir@ mandir=@mandir@ Name: libspiro Description: A library for curve design. Clothoid to bezier conversion. A mechanism for drawing smooth contours with constant curvature at the spline joins. URL: https://github.com/fontforge/libspiro Version: @VERSION@ Requires: Libs: -L${libdir} -lspiro Cflags: -I${includedir} libspiro-20221101/m4/000077500000000000000000000000001433036472700141205ustar00rootroot00000000000000libspiro-20221101/m4/ax_check_compile_flag.m4000066400000000000000000000064021433036472700206320ustar00rootroot00000000000000# =========================================================================== # http://www.gnu.org/software/autoconf-archive/ax_check_compile_flag.html # =========================================================================== # # SYNOPSIS # # AX_CHECK_COMPILE_FLAG(FLAG, [ACTION-SUCCESS], [ACTION-FAILURE], [EXTRA-FLAGS], [INPUT]) # # DESCRIPTION # # Check whether the given FLAG works with the current language's compiler # or gives an error. (Warnings, however, are ignored) # # ACTION-SUCCESS/ACTION-FAILURE are shell commands to execute on # success/failure. # # If EXTRA-FLAGS is defined, it is added to the current language's default # flags (e.g. CFLAGS) when the check is done. The check is thus made with # the flags: "CFLAGS EXTRA-FLAGS FLAG". This can for example be used to # force the compiler to issue an error when a bad flag is given. # # INPUT gives an alternative input source to AC_COMPILE_IFELSE. # # NOTE: Implementation based on AX_CFLAGS_GCC_OPTION. Please keep this # macro in sync with AX_CHECK_{PREPROC,LINK}_FLAG. # # LICENSE # # Copyright (c) 2008 Guido U. Draheim # Copyright (c) 2011 Maarten Bosmans # # 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 . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. #serial 4 AC_DEFUN([AX_CHECK_COMPILE_FLAG], [AC_PREREQ(2.64)dnl for _AC_LANG_PREFIX and AS_VAR_IF AS_VAR_PUSHDEF([CACHEVAR],[ax_cv_check_[]_AC_LANG_ABBREV[]flags_$4_$1])dnl AC_CACHE_CHECK([whether _AC_LANG compiler accepts $1], CACHEVAR, [ ax_check_save_flags=$[]_AC_LANG_PREFIX[]FLAGS _AC_LANG_PREFIX[]FLAGS="$[]_AC_LANG_PREFIX[]FLAGS $4 $1" AC_COMPILE_IFELSE([m4_default([$5],[AC_LANG_PROGRAM()])], [AS_VAR_SET(CACHEVAR,[yes])], [AS_VAR_SET(CACHEVAR,[no])]) _AC_LANG_PREFIX[]FLAGS=$ax_check_save_flags]) AS_VAR_IF(CACHEVAR,yes, [m4_default([$2], :)], [m4_default([$3], :)]) AS_VAR_POPDEF([CACHEVAR])dnl ])dnl AX_CHECK_COMPILE_FLAGS libspiro-20221101/openspiro.png000066400000000000000000000011201433036472700163160ustar00rootroot00000000000000PNG  IHDR}}}qPLTEpp:bKGDH pHYs  ~tIME #IDATxQr0 DL$?SiV֪ '!6,7Muv'ha(s.:-,!#-|⽯#ЏvM]jZf6WK7]t.3"$ Hu' Hq4ȟ xF[1u|?+î~~N^T̃^^T3T /kIE{ߙWsƷ՜?GDpŇI5Hm^}O|ϵDZ8aB_Y|v!pp޺ >(oG:~%^*uIENDB`libspiro-20221101/path5.png000066400000000000000000000021101433036472700153210ustar00rootroot00000000000000PNG  IHDR YOPLTE333ffIDATxMr0`B݃R{W*.fo28k!]-wF0RR%`?kGoH X(6Fy::chKfdtU12 4 9H APF&38j1ޏrR/y 2xjcNCrH/`4.+Q0h@0G5.gY%7Z[_TN`.tC_t<[.Lf߿Ne0 ̩Ol)QCyuHkm mACS]ql3FÀ< X0 ١2W 7-P0fn :Œ*gI}l&*q O=F8ƀTrabȅq!FeuF'W ɒ`@2fF'F+#0v=-i$a0mEWϏ4rkQj 1ޮiLHzis;nc쌧mz9 O莍J˕Rwi={ eRz& `H%`О5aȄA0 7$-Ra04$ba; 0ȝ@}`NC2 `AkH3dhfC8V\0hdC<6\0hbC!\04h`C%}넱@/J c 0vp Ftj]0o[>= \nh3rq@0jbπ F.5#`$˚kg'n;Ƣ`l`8a˵ ; fc+ƜViѻRV/nc<FM=تwg 5b 51bUcMj/Sg>8` ҨfblǕR|.%F0Rh7xIENDB`libspiro-20221101/path6.png000066400000000000000000000033111433036472700153260ustar00rootroot00000000000000PNG  IHDR 7PLTE3f3333f333ff3fffff3f3f̙3f3333f3333333333f3333333f3f33ff3f3f3f3333f3333333f3̙333333f333ff3ffffff3f33f3ff3f3f3ffff3fffffffffff3fffffff3fff̙ffff3fffff3f̙3333f33̙3ff3ffff̙f3f̙3f̙̙3f̙3f3333f333ff3fffff̙̙3̙f̙̙̙3f̙3fTeIDATx[v `g =2MH-~y9ujĢRЂ-hA Zb5|KA-PΐL^f!_Rt [Y_G\/TPoYA&(|ko),1pL`!2,d4f r Qkap emaJa( c YStC,( 2bBA lGX8Q ZxQ0~I9 'EL;">B*XsE\{h׏xZ(+ص-h>5tXd6G>`sb y3 M1I׶=~羦E"R(Ql(SfqMYC$\pV3PYLAq"a\/=;di>9diqCb Biӏ%ZЂ-hA ZЂ-hA ZЂ-hA ZЂ-hA ZЂ-hA ZЂ-hA ZЂ-hA ZЂ_T*IENDB`libspiro-20221101/spiral16.png000066400000000000000000000002671433036472700157540ustar00rootroot00000000000000PNG  IHDR%=m"PLTEٟbKGDH pHYs  ~tIME 8$|(7IDATxc~3|ϐc}!,!t5Cj 9 o30gxv u;f }tw9HJLUY HP3U8Vй +OuH vў[bK v&һN!qX7fSb̥L;b-d ?ݣ-ͳU2 l~;dXn<2$_dqKyh>`s@@+D&6BhV'`\3\+j/Ewb g#Mc> , +.(X)ή.vn+}vb߱$|~#;. Y`CllbL-\Xoц mAk!ADG f@QugEI ޕ`ŕ`B,L,‰ tX cX5VcJ9e5D;؁`(dqK`n69߮y9 3O2)V0lŁXkV*]ˡ!S#Ue/<Gh 4m@V+ZCXBEy)t `dg{3wk X`2㊲Ԃ.n+l 7! ;(fa`Jw5>nIBx}݋a}z㒋l([3 ѦQ gHEO}m7eQ-A0d5^e>,kaQnPf!Ep ✐fzGJNga|~ c8Gbl >|?ZǰV-̾ߞ~+ IENDB`libspiro-20221101/spiro.c000066400000000000000000001245051433036472700151070ustar00rootroot00000000000000/* libspiro - A sharable library of Spiro formula and functions. This file is a fork from ppedit for use by the libspiro project. Please see Changelog or git history for description of changes. ============================================================= ppedit - A pattern plate editor for Spiro splines. Copyright (C) 2007... Raph Levien (ppedit) libspiro - A sharable library of Spiro formula and functions. Copyright (C) 2007... George Williams (libspiro fork) Copyright (C) 2013... Joe Da Silva (improvements plus 'a','h') 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ /* C implementation of third-order polynomial spirals. */ #include #ifdef HAVE_FINITE #include #endif #include #include #include "spiroentrypoints.h" #include "bezctx_intf.h" #include "spiro_intf.h" #include "spiro.h" #include "spiro-config.h" #ifdef VERBOSE #include #endif typedef struct { double a[11]; /* band-diagonal matrix */ double al[5]; /* lower part of band-diagonal decomposition */ } bandmat; #ifndef M_PI #define M_PI 3.14159265358979323846 /* pi */ #endif #ifndef N_IS /* int n = 4; */ #define N_IS 4 #endif #ifndef ORDER #define ORDER 12 #endif /* Integrate polynomial spiral curve over range -.5 .. .5. */ static void integrate_spiro(const double ks[4], double xy[2], int n) { #if 0 int n = 1024; #endif double th1 = ks[0]; double th2 = .5 * ks[1]; double th3 = (1./6) * ks[2]; double th4 = (1./24) * ks[3]; double x, y; double ds = 1. / n; double ds2 = ds * ds; double ds3 = ds2 * ds; double k0 = ks[0] * ds; double k1 = ks[1] * ds; double k2 = ks[2] * ds; double k3 = ks[3] * ds; int i; double s = .5 * ds - .5; x = 0; y = 0; for (i = 0; i < n; i++) { #if ORDER > 2 double u, v; double km0, km1, km2, km3; if (n == 1) { km0 = k0; km1 = k1 * ds; km2 = k2 * ds2; } else { km0 = (((1./6) * k3 * s + .5 * k2) * s + k1) * s + k0; km1 = ((.5 * k3 * s + k2) * s + k1) * ds; km2 = (k3 * s + k2) * ds2; } km3 = k3 * ds3; #endif { #if ORDER == 4 double km0_2 = km0 * km0; u = 24 - km0_2; v = km1; #endif #if ORDER == 6 double km0_2 = km0 * km0; double km0_4 = km0_2 * km0_2; u = 24 - km0_2 + (km0_4 - 4 * km0 * km2 - 3 * km1 * km1) * (1./80); v = km1 + (km3 - 6 * km0_2 * km1) * (1./80); #endif #if ORDER == 8 double t1_1 = km0; double t1_2 = .5 * km1; double t1_3 = (1./6) * km2; double t1_4 = (1./24) * km3; double t2_2 = t1_1 * t1_1; double t2_3 = 2 * (t1_1 * t1_2); double t2_4 = 2 * (t1_1 * t1_3) + t1_2 * t1_2; double t2_5 = 2 * (t1_1 * t1_4 + t1_2 * t1_3); double t2_6 = 2 * (t1_2 * t1_4) + t1_3 * t1_3; double t3_4 = t2_2 * t1_2 + t2_3 * t1_1; double t3_6 = t2_2 * t1_4 + t2_3 * t1_3 + t2_4 * t1_2 + t2_5 * t1_1; double t4_4 = t2_2 * t2_2; double t4_5 = 2 * (t2_2 * t2_3); double t4_6 = 2 * (t2_2 * t2_4) + t2_3 * t2_3; double t5_6 = t4_4 * t1_2 + t4_5 * t1_1; double t6_6 = t4_4 * t2_2; u = 1; v = 0; v += (1./12) * t1_2 + (1./80) * t1_4; u -= (1./24) * t2_2 + (1./160) * t2_4 + (1./896) * t2_6; v -= (1./480) * t3_4 + (1./2688) * t3_6; u += (1./1920) * t4_4 + (1./10752) * t4_6; v += (1./53760) * t5_6; u -= (1./322560) * t6_6; #endif #if ORDER == 10 double t1_1 = km0; double t1_2 = .5 * km1; double t1_3 = (1./6) * km2; double t1_4 = (1./24) * km3; double t2_2 = t1_1 * t1_1; double t2_3 = 2 * (t1_1 * t1_2); double t2_4 = 2 * (t1_1 * t1_3) + t1_2 * t1_2; double t2_5 = 2 * (t1_1 * t1_4 + t1_2 * t1_3); double t2_6 = 2 * (t1_2 * t1_4) + t1_3 * t1_3; double t2_7 = 2 * (t1_3 * t1_4); double t2_8 = t1_4 * t1_4; double t3_4 = t2_2 * t1_2 + t2_3 * t1_1; double t3_6 = t2_2 * t1_4 + t2_3 * t1_3 + t2_4 * t1_2 + t2_5 * t1_1; double t3_8 = t2_4 * t1_4 + t2_5 * t1_3 + t2_6 * t1_2 + t2_7 * t1_1; double t4_4 = t2_2 * t2_2; double t4_5 = 2 * (t2_2 * t2_3); double t4_6 = 2 * (t2_2 * t2_4) + t2_3 * t2_3; double t4_7 = 2 * (t2_2 * t2_5 + t2_3 * t2_4); double t4_8 = 2 * (t2_2 * t2_6 + t2_3 * t2_5) + t2_4 * t2_4; double t5_6 = t4_4 * t1_2 + t4_5 * t1_1; double t5_8 = t4_4 * t1_4 + t4_5 * t1_3 + t4_6 * t1_2 + t4_7 * t1_1; double t6_6 = t4_4 * t2_2; double t6_7 = t4_4 * t2_3 + t4_5 * t2_2; double t6_8 = t4_4 * t2_4 + t4_5 * t2_3 + t4_6 * t2_2; double t7_8 = t6_6 * t1_2 + t6_7 * t1_1; double t8_8 = t6_6 * t2_2; u = 1; v = 0; v += (1./12) * t1_2 + (1./80) * t1_4; u -= (1./24) * t2_2 + (1./160) * t2_4 + (1./896) * t2_6 + (1./4608) * t2_8; v -= (1./480) * t3_4 + (1./2688) * t3_6 + (1./13824) * t3_8; u += (1./1920) * t4_4 + (1./10752) * t4_6 + (1./55296) * t4_8; v += (1./53760) * t5_6 + (1./276480) * t5_8; u -= (1./322560) * t6_6 + (1./1.65888e+06) * t6_8; v -= (1./1.16122e+07) * t7_8; u += (1./9.28973e+07) * t8_8; #endif #if ORDER == 12 double t1_1 = km0; double t1_2 = .5 * km1; double t1_3 = (1./6) * km2; double t1_4 = (1./24) * km3; double t2_2 = t1_1 * t1_1; double t2_3 = 2 * (t1_1 * t1_2); double t2_4 = 2 * (t1_1 * t1_3) + t1_2 * t1_2; double t2_5 = 2 * (t1_1 * t1_4 + t1_2 * t1_3); double t2_6 = 2 * (t1_2 * t1_4) + t1_3 * t1_3; double t2_7 = 2 * (t1_3 * t1_4); double t2_8 = t1_4 * t1_4; double t3_4 = t2_2 * t1_2 + t2_3 * t1_1; double t3_6 = t2_2 * t1_4 + t2_3 * t1_3 + t2_4 * t1_2 + t2_5 * t1_1; double t3_8 = t2_4 * t1_4 + t2_5 * t1_3 + t2_6 * t1_2 + t2_7 * t1_1; double t3_10 = t2_6 * t1_4 + t2_7 * t1_3 + t2_8 * t1_2; double t4_4 = t2_2 * t2_2; double t4_5 = 2 * (t2_2 * t2_3); double t4_6 = 2 * (t2_2 * t2_4) + t2_3 * t2_3; double t4_7 = 2 * (t2_2 * t2_5 + t2_3 * t2_4); double t4_8 = 2 * (t2_2 * t2_6 + t2_3 * t2_5) + t2_4 * t2_4; double t4_9 = 2 * (t2_2 * t2_7 + t2_3 * t2_6 + t2_4 * t2_5); double t4_10 = 2 * (t2_2 * t2_8 + t2_3 * t2_7 + t2_4 * t2_6) + t2_5 * t2_5; double t5_6 = t4_4 * t1_2 + t4_5 * t1_1; double t5_8 = t4_4 * t1_4 + t4_5 * t1_3 + t4_6 * t1_2 + t4_7 * t1_1; double t5_10 = t4_6 * t1_4 + t4_7 * t1_3 + t4_8 * t1_2 + t4_9 * t1_1; double t6_6 = t4_4 * t2_2; double t6_7 = t4_4 * t2_3 + t4_5 * t2_2; double t6_8 = t4_4 * t2_4 + t4_5 * t2_3 + t4_6 * t2_2; double t6_9 = t4_4 * t2_5 + t4_5 * t2_4 + t4_6 * t2_3 + t4_7 * t2_2; double t6_10 = t4_4 * t2_6 + t4_5 * t2_5 + t4_6 * t2_4 + t4_7 * t2_3 + t4_8 * t2_2; double t7_8 = t6_6 * t1_2 + t6_7 * t1_1; double t7_10 = t6_6 * t1_4 + t6_7 * t1_3 + t6_8 * t1_2 + t6_9 * t1_1; double t8_8 = t6_6 * t2_2; double t8_9 = t6_6 * t2_3 + t6_7 * t2_2; double t8_10 = t6_6 * t2_4 + t6_7 * t2_3 + t6_8 * t2_2; double t9_10 = t8_8 * t1_2 + t8_9 * t1_1; double t10_10 = t8_8 * t2_2; u = 1; v = 0; v += (1./12) * t1_2 + (1./80) * t1_4; u -= (1./24) * t2_2 + (1./160) * t2_4 + (1./896) * t2_6 + (1./4608) * t2_8; v -= (1./480) * t3_4 + (1./2688) * t3_6 + (1./13824) * t3_8 + (1./67584) * t3_10; u += (1./1920) * t4_4 + (1./10752) * t4_6 + (1./55296) * t4_8 + (1./270336) * t4_10; v += (1./53760) * t5_6 + (1./276480) * t5_8 + (1./1.35168e+06) * t5_10; u -= (1./322560) * t6_6 + (1./1.65888e+06) * t6_8 + (1./8.11008e+06) * t6_10; v -= (1./1.16122e+07) * t7_8 + (1./5.67706e+07) * t7_10; u += (1./9.28973e+07) * t8_8 + (1./4.54164e+08) * t8_10; v += (1./4.08748e+09) * t9_10; u -= (1./4.08748e+10) * t10_10; #endif #if ORDER == 14 double t1_1 = km0; double t1_2 = .5 * km1; double t1_3 = (1./6) * km2; double t1_4 = (1./24) * km3; double t2_2 = t1_1 * t1_1; double t2_3 = 2 * (t1_1 * t1_2); double t2_4 = 2 * (t1_1 * t1_3) + t1_2 * t1_2; double t2_5 = 2 * (t1_1 * t1_4 + t1_2 * t1_3); double t2_6 = 2 * (t1_2 * t1_4) + t1_3 * t1_3; double t2_7 = 2 * (t1_3 * t1_4); double t2_8 = t1_4 * t1_4; double t3_4 = t2_2 * t1_2 + t2_3 * t1_1; double t3_6 = t2_2 * t1_4 + t2_3 * t1_3 + t2_4 * t1_2 + t2_5 * t1_1; double t3_8 = t2_4 * t1_4 + t2_5 * t1_3 + t2_6 * t1_2 + t2_7 * t1_1; double t3_10 = t2_6 * t1_4 + t2_7 * t1_3 + t2_8 * t1_2; double t3_12 = t2_8 * t1_4; double t4_4 = t2_2 * t2_2; double t4_5 = 2 * (t2_2 * t2_3); double t4_6 = 2 * (t2_2 * t2_4) + t2_3 * t2_3; double t4_7 = 2 * (t2_2 * t2_5 + t2_3 * t2_4); double t4_8 = 2 * (t2_2 * t2_6 + t2_3 * t2_5) + t2_4 * t2_4; double t4_9 = 2 * (t2_2 * t2_7 + t2_3 * t2_6 + t2_4 * t2_5); double t4_10 = 2 * (t2_2 * t2_8 + t2_3 * t2_7 + t2_4 * t2_6) + t2_5 * t2_5; double t4_11 = 2 * (t2_3 * t2_8 + t2_4 * t2_7 + t2_5 * t2_6); double t4_12 = 2 * (t2_4 * t2_8 + t2_5 * t2_7) + t2_6 * t2_6; double t5_6 = t4_4 * t1_2 + t4_5 * t1_1; double t5_8 = t4_4 * t1_4 + t4_5 * t1_3 + t4_6 * t1_2 + t4_7 * t1_1; double t5_10 = t4_6 * t1_4 + t4_7 * t1_3 + t4_8 * t1_2 + t4_9 * t1_1; double t5_12 = t4_8 * t1_4 + t4_9 * t1_3 + t4_10 * t1_2 + t4_11 * t1_1; double t6_6 = t4_4 * t2_2; double t6_7 = t4_4 * t2_3 + t4_5 * t2_2; double t6_8 = t4_4 * t2_4 + t4_5 * t2_3 + t4_6 * t2_2; double t6_9 = t4_4 * t2_5 + t4_5 * t2_4 + t4_6 * t2_3 + t4_7 * t2_2; double t6_10 = t4_4 * t2_6 + t4_5 * t2_5 + t4_6 * t2_4 + t4_7 * t2_3 + t4_8 * t2_2; double t6_11 = t4_4 * t2_7 + t4_5 * t2_6 + t4_6 * t2_5 + t4_7 * t2_4 + t4_8 * t2_3 + t4_9 * t2_2; double t6_12 = t4_4 * t2_8 + t4_5 * t2_7 + t4_6 * t2_6 + t4_7 * t2_5 + t4_8 * t2_4 + t4_9 * t2_3 + t4_10 * t2_2; double t7_8 = t6_6 * t1_2 + t6_7 * t1_1; double t7_10 = t6_6 * t1_4 + t6_7 * t1_3 + t6_8 * t1_2 + t6_9 * t1_1; double t7_12 = t6_8 * t1_4 + t6_9 * t1_3 + t6_10 * t1_2 + t6_11 * t1_1; double t8_8 = t6_6 * t2_2; double t8_9 = t6_6 * t2_3 + t6_7 * t2_2; double t8_10 = t6_6 * t2_4 + t6_7 * t2_3 + t6_8 * t2_2; double t8_11 = t6_6 * t2_5 + t6_7 * t2_4 + t6_8 * t2_3 + t6_9 * t2_2; double t8_12 = t6_6 * t2_6 + t6_7 * t2_5 + t6_8 * t2_4 + t6_9 * t2_3 + t6_10 * t2_2; double t9_10 = t8_8 * t1_2 + t8_9 * t1_1; double t9_12 = t8_8 * t1_4 + t8_9 * t1_3 + t8_10 * t1_2 + t8_11 * t1_1; double t10_10 = t8_8 * t2_2; double t10_11 = t8_8 * t2_3 + t8_9 * t2_2; double t10_12 = t8_8 * t2_4 + t8_9 * t2_3 + t8_10 * t2_2; double t11_12 = t10_10 * t1_2 + t10_11 * t1_1; double t12_12 = t10_10 * t2_2; u = 1; v = 0; v += (1./12) * t1_2 + (1./80) * t1_4; u -= (1./24) * t2_2 + (1./160) * t2_4 + (1./896) * t2_6 + (1./4608) * t2_8; v -= (1./480) * t3_4 + (1./2688) * t3_6 + (1./13824) * t3_8 + (1./67584) * t3_10 + (1./319488) * t3_12; u += (1./1920) * t4_4 + (1./10752) * t4_6 + (1./55296) * t4_8 + (1./270336) * t4_10 + (1./1.27795e+06) * t4_12; v += (1./53760) * t5_6 + (1./276480) * t5_8 + (1./1.35168e+06) * t5_10 + (1./6.38976e+06) * t5_12; u -= (1./322560) * t6_6 + (1./1.65888e+06) * t6_8 + (1./8.11008e+06) * t6_10 + (1./3.83386e+07) * t6_12; v -= (1./1.16122e+07) * t7_8 + (1./5.67706e+07) * t7_10 + (1./2.6837e+08) * t7_12; u += (1./9.28973e+07) * t8_8 + (1./4.54164e+08) * t8_10 + (1./2.14696e+09) * t8_12; v += (1./4.08748e+09) * t9_10 + (1./1.93226e+10) * t9_12; u -= (1./4.08748e+10) * t10_10 + (1./1.93226e+11) * t10_12; v -= (1./2.12549e+12) * t11_12; u += (1./2.55059e+13) * t12_12; #endif #if ORDER == 16 double t1_1 = km0; double t1_2 = .5 * km1; double t1_3 = (1./6) * km2; double t1_4 = (1./24) * km3; double t2_2 = t1_1 * t1_1; double t2_3 = 2 * (t1_1 * t1_2); double t2_4 = 2 * (t1_1 * t1_3) + t1_2 * t1_2; double t2_5 = 2 * (t1_1 * t1_4 + t1_2 * t1_3); double t2_6 = 2 * (t1_2 * t1_4) + t1_3 * t1_3; double t2_7 = 2 * (t1_3 * t1_4); double t2_8 = t1_4 * t1_4; double t3_4 = t2_2 * t1_2 + t2_3 * t1_1; double t3_6 = t2_2 * t1_4 + t2_3 * t1_3 + t2_4 * t1_2 + t2_5 * t1_1; double t3_8 = t2_4 * t1_4 + t2_5 * t1_3 + t2_6 * t1_2 + t2_7 * t1_1; double t3_10 = t2_6 * t1_4 + t2_7 * t1_3 + t2_8 * t1_2; double t3_12 = t2_8 * t1_4; double t4_4 = t2_2 * t2_2; double t4_5 = 2 * (t2_2 * t2_3); double t4_6 = 2 * (t2_2 * t2_4) + t2_3 * t2_3; double t4_7 = 2 * (t2_2 * t2_5 + t2_3 * t2_4); double t4_8 = 2 * (t2_2 * t2_6 + t2_3 * t2_5) + t2_4 * t2_4; double t4_9 = 2 * (t2_2 * t2_7 + t2_3 * t2_6 + t2_4 * t2_5); double t4_10 = 2 * (t2_2 * t2_8 + t2_3 * t2_7 + t2_4 * t2_6) + t2_5 * t2_5; double t4_11 = 2 * (t2_3 * t2_8 + t2_4 * t2_7 + t2_5 * t2_6); double t4_12 = 2 * (t2_4 * t2_8 + t2_5 * t2_7) + t2_6 * t2_6; double t4_13 = 2 * (t2_5 * t2_8 + t2_6 * t2_7); double t4_14 = 2 * (t2_6 * t2_8) + t2_7 * t2_7; double t5_6 = t4_4 * t1_2 + t4_5 * t1_1; double t5_8 = t4_4 * t1_4 + t4_5 * t1_3 + t4_6 * t1_2 + t4_7 * t1_1; double t5_10 = t4_6 * t1_4 + t4_7 * t1_3 + t4_8 * t1_2 + t4_9 * t1_1; double t5_12 = t4_8 * t1_4 + t4_9 * t1_3 + t4_10 * t1_2 + t4_11 * t1_1; double t5_14 = t4_10 * t1_4 + t4_11 * t1_3 + t4_12 * t1_2 + t4_13 * t1_1; double t6_6 = t4_4 * t2_2; double t6_7 = t4_4 * t2_3 + t4_5 * t2_2; double t6_8 = t4_4 * t2_4 + t4_5 * t2_3 + t4_6 * t2_2; double t6_9 = t4_4 * t2_5 + t4_5 * t2_4 + t4_6 * t2_3 + t4_7 * t2_2; double t6_10 = t4_4 * t2_6 + t4_5 * t2_5 + t4_6 * t2_4 + t4_7 * t2_3 + t4_8 * t2_2; double t6_11 = t4_4 * t2_7 + t4_5 * t2_6 + t4_6 * t2_5 + t4_7 * t2_4 + t4_8 * t2_3 + t4_9 * t2_2; double t6_12 = t4_4 * t2_8 + t4_5 * t2_7 + t4_6 * t2_6 + t4_7 * t2_5 + t4_8 * t2_4 + t4_9 * t2_3 + t4_10 * t2_2; double t6_13 = t4_5 * t2_8 + t4_6 * t2_7 + t4_7 * t2_6 + t4_8 * t2_5 + t4_9 * t2_4 + t4_10 * t2_3 + t4_11 * t2_2; double t6_14 = t4_6 * t2_8 + t4_7 * t2_7 + t4_8 * t2_6 + t4_9 * t2_5 + t4_10 * t2_4 + t4_11 * t2_3 + t4_12 * t2_2; double t7_8 = t6_6 * t1_2 + t6_7 * t1_1; double t7_10 = t6_6 * t1_4 + t6_7 * t1_3 + t6_8 * t1_2 + t6_9 * t1_1; double t7_12 = t6_8 * t1_4 + t6_9 * t1_3 + t6_10 * t1_2 + t6_11 * t1_1; double t7_14 = t6_10 * t1_4 + t6_11 * t1_3 + t6_12 * t1_2 + t6_13 * t1_1; double t8_8 = t6_6 * t2_2; double t8_9 = t6_6 * t2_3 + t6_7 * t2_2; double t8_10 = t6_6 * t2_4 + t6_7 * t2_3 + t6_8 * t2_2; double t8_11 = t6_6 * t2_5 + t6_7 * t2_4 + t6_8 * t2_3 + t6_9 * t2_2; double t8_12 = t6_6 * t2_6 + t6_7 * t2_5 + t6_8 * t2_4 + t6_9 * t2_3 + t6_10 * t2_2; double t8_13 = t6_6 * t2_7 + t6_7 * t2_6 + t6_8 * t2_5 + t6_9 * t2_4 + t6_10 * t2_3 + t6_11 * t2_2; double t8_14 = t6_6 * t2_8 + t6_7 * t2_7 + t6_8 * t2_6 + t6_9 * t2_5 + t6_10 * t2_4 + t6_11 * t2_3 + t6_12 * t2_2; double t9_10 = t8_8 * t1_2 + t8_9 * t1_1; double t9_12 = t8_8 * t1_4 + t8_9 * t1_3 + t8_10 * t1_2 + t8_11 * t1_1; double t9_14 = t8_10 * t1_4 + t8_11 * t1_3 + t8_12 * t1_2 + t8_13 * t1_1; double t10_10 = t8_8 * t2_2; double t10_11 = t8_8 * t2_3 + t8_9 * t2_2; double t10_12 = t8_8 * t2_4 + t8_9 * t2_3 + t8_10 * t2_2; double t10_13 = t8_8 * t2_5 + t8_9 * t2_4 + t8_10 * t2_3 + t8_11 * t2_2; double t10_14 = t8_8 * t2_6 + t8_9 * t2_5 + t8_10 * t2_4 + t8_11 * t2_3 + t8_12 * t2_2; double t11_12 = t10_10 * t1_2 + t10_11 * t1_1; double t11_14 = t10_10 * t1_4 + t10_11 * t1_3 + t10_12 * t1_2 + t10_13 * t1_1; double t12_12 = t10_10 * t2_2; double t12_13 = t10_10 * t2_3 + t10_11 * t2_2; double t12_14 = t10_10 * t2_4 + t10_11 * t2_3 + t10_12 * t2_2; double t13_14 = t12_12 * t1_2 + t12_13 * t1_1; double t14_14 = t12_12 * t2_2; u = 1; u -= 1./24 * t2_2 + 1./160 * t2_4 + 1./896 * t2_6 + 1./4608 * t2_8; u += 1./1920 * t4_4 + 1./10752 * t4_6 + 1./55296 * t4_8 + 1./270336 * t4_10 + 1./1277952 * t4_12 + 1./5898240 * t4_14; u -= 1./322560 * t6_6 + 1./1658880 * t6_8 + 1./8110080 * t6_10 + 1./38338560 * t6_12 + 1./176947200 * t6_14; u += 1./92897280 * t8_8 + 1./454164480 * t8_10 + 4.6577500191e-10 * t8_12 + 1.0091791708e-10 * t8_14; u -= 2.4464949595e-11 * t10_10 + 5.1752777990e-12 * t10_12 + 1.1213101898e-12 * t10_14; u += 3.9206649992e-14 * t12_12 + 8.4947741650e-15 * t12_14; u -= 4.6674583324e-17 * t14_14; v = 0; v += 1./12 * t1_2 + 1./80 * t1_4; v -= 1./480 * t3_4 + 1./2688 * t3_6 + 1./13824 * t3_8 + 1./67584 * t3_10 + 1./319488 * t3_12; v += 1./53760 * t5_6 + 1./276480 * t5_8 + 1./1351680 * t5_10 + 1./6389760 * t5_12 + 1./29491200 * t5_14; v -= 1./11612160 * t7_8 + 1./56770560 * t7_10 + 1./268369920 * t7_12 + 8.0734333664e-10 * t7_14; v += 2.4464949595e-10 * t9_10 + 5.1752777990e-11 * t9_12 + 1.1213101898e-11 * t9_14; v -= 4.7047979991e-13 * t11_12 + 1.0193728998e-13 * t11_14; v += 6.5344416654e-16 * t13_14; #endif } if (n == 1) { #if ORDER == 2 x = 1; y = 0; #else x = u; y = v; #endif } else { double th = (((th4 * s + th3) * s + th2) * s + th1) * s; double cth = cos(th); double sth = sin(th); #if ORDER == 2 x += cth; y += sth; #else x += cth * u - sth * v; y += cth * v + sth * u; #endif s += ds; } } #if ORDER == 4 || ORDER == 6 xy[0] = x * (1./24 * ds); xy[1] = y * (1./24 * ds); #else xy[0] = x * ds; xy[1] = y * ds; #endif } static void set_dm_to_1(double *dm) { /* assume spiro within -0.5 to +0.5 */ /* values loaded: scale, xoff, yoff */ dm[0] = 1.; dm[1] = dm[2] = 0.; } static void set_di_to_x1y1(double *di, double *dm, double x1, double y1) { /* assume IEEE 754 rounding errors. */ di[3] = di[4] = x1; di[6] = di[7] = y1; di[3] -= di[1]; di[4] += di[1]; di[6] -= di[1]; di[7] += di[1]; di[2] = x1 * dm[0] + dm[1]; di[5] = y1 * dm[0] + dm[2]; } static double compute_ends(const double ks[4], double ends[2][4], double seg_ch) { double xy[2]; double ch, th; double l, l2, l3; double th_even, th_odd; double k0_even, k0_odd; double k1_even, k1_odd; double k2_even, k2_odd; integrate_spiro(ks, xy, N_IS); ch = hypot(xy[0], xy[1]); th = atan2(xy[1], xy[0]); l = ch / seg_ch; th_even = .5 * ks[0] + (1./48) * ks[2]; th_odd = .125 * ks[1] + (1./384) * ks[3] - th; ends[0][0] = th_even - th_odd; ends[1][0] = th_even + th_odd; k0_even = l * (ks[0] + .125 * ks[2]); k0_odd = l * (.5 * ks[1] + (1./48) * ks[3]); ends[0][1] = k0_even - k0_odd; ends[1][1] = k0_even + k0_odd; l2 = l * l; k1_even = l2 * (ks[1] + .125 * ks[3]); k1_odd = l2 * .5 * ks[2]; ends[0][2] = k1_even - k1_odd; ends[1][2] = k1_even + k1_odd; l3 = l2 * l; k2_even = l3 * ks[2]; k2_odd = l3 * .5 * ks[3]; ends[0][3] = k2_even - k2_odd; ends[1][3] = k2_even + k2_odd; return l; } static void compute_pderivs(const spiro_seg *s, double ends[2][4], double derivs[4][2][4], int jinc) { double recip_d = 2e6; double delta = 1./ recip_d; double try_ks[4]; double try_ends[2][4]; int i, j, k; compute_ends(s->ks, ends, s->seg_ch); for (i = 0; i < jinc; i++) { for (j = 0; j < 4; j++) try_ks[j] = s->ks[j]; try_ks[i] += delta; compute_ends(try_ks, try_ends, s->seg_ch); for (k = 0; k < 2; k++) for (j = 0; j < 4; j++) derivs[j][k][i] = recip_d * (try_ends[k][j] - ends[k][j]); } } static double mod_2pi(double th) { double u = th / (2 * M_PI); return 2 * M_PI * (u - floor(u + 0.5)); } static spiro_seg * setup_path0(const spiro_cp *src, double *dm, int n) { int i, ilast, n_seg, z; double dx, dy; double xmin, xmax, ymin, ymax; spiro_seg *r; z = -1; if (src[n - 1].ty == 'z') z = --n; if (src[0].ty == ']' || src[n - 1].ty == '[') { /* pair */ #ifdef VERBOSE fprintf(stderr, "ERROR: LibSpiro: cannot use cp type ']' as start, or '[' as end.\n"); #endif return 0; } if (src[0].ty == 'h' || src[n - 1].ty == 'a') { /* pair */ #ifdef VERBOSE fprintf(stderr, "ERROR: LibSpiro: cannot use cp type 'h' as start, or 'a' as end.\n"); #endif return 0; } #ifdef CHECK_INPUT_FINITENESS /* Verify that input values are within realistic limits */ for (i = 0; i < n; i++) { if (IS_FINITE(src[i].x)==0 || IS_FINITE(src[i].y)==0) { #ifdef VERBOSE fprintf(stderr, "ERROR: LibSpiro: #%d={'%c',%g,%g} is not finite.\n", \ i, src[i].ty, src[i].x, src[i].y); #endif return 0; } } #endif n_seg = src[0].ty == '{' ? n - 1 : n; i = (int)((unsigned int)(n_seg + 1) * sizeof(spiro_seg)); if (i <= 0 || (r=(spiro_seg *)malloc((unsigned int)(i))) == NULL) return 0; if (dm[0] < 0.9) { /* for math to be scalable fit it within -0.5..+0.5 */ xmin = xmax = src[0].x; ymin = ymax = src[0].y; for (i = 0; i < n_seg; i++) { if (src[i].ty != 'z' && src[i].ty != 'h') { if (src[i].x < xmin) xmin = src[i].x; else if (src[i].x > xmax) xmax = src[i].x; if (src[i].y < ymin) ymin = src[i].y; else if (src[i].y > ymax) ymax = src[i].y; } } dm[1] /* xoff */ = (xmin + xmax) / 2; xmax -= xmin; dm[2] /* yoff */ = (ymin + ymax) / 2; ymax -= ymin; dm[0] /* scale */ = fabs((fabs(xmax) >= fabs(ymax)) ? xmax : ymax); dm[0] /* scale */ /= 500.; /* ~ backward compatible */ } #ifdef VERBOSE printf("scale=%g, x_offset=%g, y_offset=%g, n=%d, n_seg=%d\n", dm[0], dm[1], dm[2], n, n_seg); #endif for (i = 0; i < n_seg; i++) { /* gigo test: error if src[i].ty isn't a known type */ if (src[i].ty == 'a') { if (src[i + 1].ty == 'h' || (i == n_seg-1 && src[i + 1].ty == '}')) { if (src[i].x == src[i + 1].x && src[i].y == src[i + 1].y) goto setup_path_error1; } else /* did not find 'ah' (or 'a}' as last pair) */ goto setup_path_error1; } else if (src[i].ty == 'h') { if (src[i - 1].ty == 'a' || (i == 1 || src[0].ty == '{')) { if (src[i - 1].x == src[i].x && src[i - 1].y == src[i].y) goto setup_path_error1; } else /* didn't find 'ah' (or '{h' as first pair) */ goto setup_path_error1; } r[i].ty = src[i].ty; r[i].x = (src[i].x - dm[1]) / dm[0]; r[i].y = (src[i].y - dm[2]) / dm[0]; r[i].ks[0] = 0.; r[i].ks[1] = 0.; r[i].ks[2] = 0.; r[i].ks[3] = 0.; } r[n_seg].x = (src[n_seg % n].x - dm[1]) / dm[0]; r[n_seg].y = (src[n_seg % n].y - dm[2]) / dm[0]; r[n_seg].ty = src[n_seg % n].ty; for (i = 0; i < n_seg; i++) { if (r[i].ty == 'h' || (i == n_seg-1 && i > 0 && r[i].ty == '}' && r[i - 1].ty == 'a')) { /* behave like a disconnected pair of '[' & ']' */ /* point 'a' holds vector to old 'h' and now we */ /* change x,y here to be the same as point 'a'. */ /* curve fitting is based on vectors and angles */ /* but final curves will be based on x,y points */ r[i].x = r[i - 1].x; r[i].y = r[i - 1].y; } dx = r[i + 1].x - r[i].x; dy = r[i + 1].y - r[i].y; #ifndef CHECK_INPUT_FINITENESS r[i].seg_ch = hypot(dx, dy); #else if (IS_FINITE(dx)==0 || IS_FINITE(dy)==0 || \ IS_FINITE((r[i].seg_ch = hypot(dx, dy)))==0) { #ifdef VERBOSE fprintf(stderr, "ERROR: LibSpiro: #%d={'%c',%g,%g} hypot error.\n", \ i, src[i].ty, src[i].x, src[i].y); #endif goto setup_path_error0; } #endif r[i].seg_th = atan2(dy, dx); } ilast = n_seg - 1; for (i = 0; i < n_seg; i++) { if (r[i].ty == '{' || r[i].ty == '}' || r[i].ty == 'v') r[i].bend_th = 0.; else r[i].bend_th = mod_2pi(r[i].seg_th - r[ilast].seg_th); ilast = i; #ifdef VERBOSE printf("input #%d={'%c',%g=>%g,%g=>%g}, hypot=%g, atan2=%g, bend_th=%g\n", \ i, src[i].ty, src[i].x, r[i].x * dm[0] + dm[1], \ src[i].y, r[i].y * dm[0] + dm[2], r[i].seg_ch * dm[0], \ r[i].seg_th, r[i].bend_th); #endif } #ifdef VERBOSE if (n_seg < n) printf("input #%d={'%c',%g=>%g,%g=>%g}\n", i, src[i].ty, \ src[i].x, r[i].x * dm[0] + dm[1], src[i].y, r[i].y * dm[0] + dm[2]); #endif if (z >= 0) r[z].ty = 'z'; /* wrong n, maintain z. */ return r; setup_path_error1: #ifdef VERBOSE fprintf(stderr, "ERROR: LibSpiro: #%d={'%c',%g,%g} found unpaired anchor+handle 'ah'.\n", \ i, src[i].ty, src[i].x, src[i].y); #endif #ifdef CHECK_INPUT_FINITENESS setup_path_error0: #endif free(r); return 0; } /* deprecated / backwards compatibility / not scalable */ static spiro_seg * setup_path(const spiro_cp *src, int n) { double dm[6]; set_dm_to_1(dm); return setup_path0(src, dm, n); } static void bandec11(bandmat *m, int *perm, int n) { int i, j, k, l, pivot; double pivot_val, pivot_scale, tmp, x; /* pack top triangle to the left. */ for (i = 0; i < 5; i++) { for (j = 0; j < i + 6; j++) m[i].a[j] = m[i].a[j + 5 - i]; for (; j < 11; j++) m[i].a[j] = 0.; } l = 5; for (k = 0; k < n; k++) { pivot = k; pivot_val = m[k].a[0]; l = l < n ? l + 1 : n; for (j = k + 1; j < l; j++) if (fabs(m[j].a[0]) > fabs(pivot_val)) { pivot_val = m[j].a[0]; pivot = j; } perm[k] = pivot; if (pivot != k) { for (j = 0; j < 11; j++) { tmp = m[k].a[j]; m[k].a[j] = m[pivot].a[j]; m[pivot].a[j] = tmp; } } if (fabs(pivot_val) < 1e-12) pivot_val = 1e-12; pivot_scale = 1. / pivot_val; for (i = k + 1; i < l; i++) { x = m[i].a[0] * pivot_scale; m[k].al[i - k - 1] = x; for (j = 1; j < 11; j++) m[i].a[j - 1] = m[i].a[j] - x * m[k].a[j]; m[i].a[10] = 0.; } } } static void banbks11(const bandmat *m, const int *perm, double *v, int n) { int i, k, l; double tmp, x; /* forward substitution */ l = 5; for (k = 0; k < n; k++) { i = perm[k]; if (i != k) { tmp = v[k]; v[k] = v[i]; v[i] = tmp; } if (l < n) l++; for (i = k + 1; i < l; i++) v[i] -= m[k].al[i - k - 1] * v[k]; } /* back substitution */ l = 1; for (i = n - 1; i >= 0; i--) { x = v[i]; for (k = 1; k < l; k++) x -= m[i].a[k] * v[k + i]; v[i] = x / m[i].a[0]; if (l < 11) l++; } } static int compute_jinc(char ty0, char ty1) { if (ty0 == 'o' || ty1 == 'o' || \ ty0 == ']' || ty1 == '[' || \ ty0 == 'h' || ty1 == 'a') return 4; else if (ty0 == 'c' && ty1 == 'c') return 2; else if ((ty1 == 'c' && (ty0 == '{' || ty0 == 'v' || ty0 == '[' || ty0 == 'a')) || (ty0 == 'c' && (ty1 == '}' || ty1 == 'v' || ty1 == ']' || ty1 == 'h'))) return 1; else return 0; } static int count_vec(const spiro_seg *s, int *jinca, int nseg) { int i, n; n = 0; for (i = 0; i < nseg; i++) n += (jinca[i] = compute_jinc(s[i].ty, s[i + 1].ty)); return n; } static void add_mat_line(bandmat *m, double *v,double derivs[4], double x, double y, int j, int jj, int jinc, int nmat) { int joff, k; if (jj >= 0) { jj %= nmat; joff = (j + 5 - jj + nmat) % nmat; if (nmat < 6) { joff = j + 5 - jj; } else if (nmat == 6) { joff = 2 + (j + 3 - jj + nmat) % nmat; } #ifdef VERBOSE printf("add_mat_line j=%d jj=%d jinc=%d nmat=%d joff=%d\n", j, jj, jinc, nmat, joff); #endif v[jj] += x; for (k = 0; k < jinc; k++) m[jj].a[joff + k] += y * derivs[k]; } } static double spiro_iter(spiro_seg *s, bandmat *m, int *perm, double *v, int *jinca, int n, int cyclic, int nmat) { unsigned int l; int i, j, jthl, jthr, jk0l, jk0r, jk1l, jk1r, jk2l, jk2r, jinc, jj, k, n_invert; char ty0, ty1; double dk, norm, th; double ends[2][4]; double derivs[4][2][4]; for (i = 0; i < nmat; i++) { v[i] = 0.; for (j = 0; j < 11; j++) m[i].a[j] = 0.; for (j = 0; j < 5; j++) m[i].al[j] = 0.; } i = j = jj = 0; if (s[0].ty == 'o') jj = nmat - 2; else if (s[0].ty == 'c') jj = nmat - 1; else if (s[0].ty == '[' || s[0].ty == 'a') { if (cyclic) { /* start at v, c or o */ for (i = 0; i < n; i++) { switch (s[i].ty) { case 'o': --jj; case 'c': --jj; case 'v': jj = (jj + nmat) % nmat; j %= nmat; goto spiro_iter_1; break; default: jj += jinca[i]; j += jinca[i]; } } i = j = jj = 0; spiro_iter_1: ; } } for (k = 0; k < n; i++, k++) { i %= n; ty0 = s[i].ty; ty1 = s[i + 1].ty; jinc = jinca[i]; th = s[i].bend_th; jthl = jk0l = jk1l = jk2l = -1; jthr = jk0r = jk1r = jk2r = -1; compute_pderivs(&s[i], ends, derivs, jinc); /* constraints crossing left */ if (ty0 == 'o' || ty0 == 'c' || ty0 == '[' || ty0 == ']' || \ ty0 == 'a' || ty0 == 'h') { jthl = jj++; jthl %= nmat; jj %= nmat; jk0l = jj++; if (ty0 == 'o') { jj %= nmat; jk1l = jj++; jk2l = jj++; } } if (jinc == 4) { /* constraints on left */ if (ty0 == 'c' || ty0 == 'v' || ty0 == '[' || \ ty0 == 'a' || ty0 == '{') { if (ty0 != 'c') jk1l = jj++; jk2l = jj++; } /* constraints on right */ if (ty1 == 'c' || ty1 == 'v' || ty1 == ']' || \ ty1 == 'h' || ty1 == '}') { if (ty1 != 'c') jk1r = jj++; jk2r = jj++; } } /* constraints crossing right */ if (ty1 == 'o' || ty1 == 'c' || ty1 == '[' || ty1 == ']' || \ ty1 == 'a' || ty1 == 'h') { jj %= nmat; jthr = jj; jk0r = (jj + 1) % nmat; if (ty1 == 'o') { jk1r = (jj + 2) % nmat; jk2r = (jj + 3) % nmat; } } add_mat_line(m, v, derivs[0][0], th - ends[0][0], 1, j, jthl, jinc, nmat); add_mat_line(m, v, derivs[1][0], ends[0][1], -1, j, jk0l, jinc, nmat); add_mat_line(m, v, derivs[2][0], ends[0][2], -1, j, jk1l, jinc, nmat); add_mat_line(m, v, derivs[3][0], ends[0][3], -1, j, jk2l, jinc, nmat); add_mat_line(m, v, derivs[0][1], -ends[1][0], 1, j, jthr, jinc, nmat); add_mat_line(m, v, derivs[1][1], -ends[1][1], 1, j, jk0r, jinc, nmat); add_mat_line(m, v, derivs[2][1], -ends[1][2], 1, j, jk1r, jinc, nmat); add_mat_line(m, v, derivs[3][1], -ends[1][3], 1, j, jk2r, jinc, nmat); if (jthl >= 0) v[jthl] = mod_2pi(v[jthl]); if (jthr >= 0) v[jthr] = mod_2pi(v[jthr]); j += jinc; j %= nmat; } if (cyclic) { l = sizeof(bandmat) * (unsigned int)(nmat); memcpy(m + nmat, m, l); memcpy(m + 2 * nmat, m, l); l = sizeof(double) * (unsigned int)(nmat); memcpy(v + nmat, v, l); memcpy(v + 2 * nmat, v, l); n_invert = 3 * nmat; j = nmat; #ifdef VERBOSE printf("cyclic\n"); #endif } else { n_invert = nmat; j = 0; } #ifdef VERBOSE for (i = 0; i < n; i++) { for (k = 0; k < 11; k++) printf(" %2.4f", m[i].a[k]); printf(": %2.4f\n", v[i]); } printf("---\n"); #endif bandec11(m, perm, n_invert); banbks11(m, perm, v, n_invert); norm = 0.; for (i = 0; i < n; i++) { jinc = jinca[i]; for (k = 0; k < jinc; k++) { dk = v[j++]; #ifdef VERBOSE printf("s[%d].ks[%d] += %f\n", i, k, dk); #endif s[i].ks[k] += dk; norm += dk * dk; /* Break if calculations are headed for failure */ if (IS_FINITE(s[i].ks[k]) == 0) return s[i].ks[k]; } s[i].ks[0] = 2.0 * mod_2pi(s[i].ks[0]/2.0); } return norm; } static int solve_spiro(spiro_seg *s, int n) { int i, converged, cyclic, nmat, n_alloc, nseg, z; bandmat *m; double *v; int *perm, *jinca; double norm; i = converged = 0; /* not solved (yet) */ z = -1; if (s[0].ty == '{') nseg = n - 1; else { if (s[n - 1].ty == 'z') { z = --n; s[z].ty = s[0].ty; } nseg = n; } if (nseg <= 1) { converged = 1; /* means no convergence problems */ goto solve_spiroerr0; } if ((jinca = (int *)malloc((unsigned int)(sizeof(int) * nseg))) == NULL) { #ifdef VERBOSE fprintf(stderr, "ERROR: LibSpiro: failed to alloc memory.\n"); #endif goto solve_spiroerr0; } nmat = count_vec(s, jinca, nseg); if (nmat == 0) { converged = 1; /* means no convergence problems */ goto solve_spiroerr1; } n_alloc = nmat; cyclic = 0; if (s[0].ty != '{' && s[0].ty != 'v') { n_alloc *= 3; ++cyclic; } if (n_alloc < 5) n_alloc = 5; #ifdef VERBOSE printf("nmat=%d, alloc=%d, cyclic=%d, n=%d, nseg=%d\n", nmat, n_alloc, cyclic, n, nseg); #endif m = (bandmat *)malloc(sizeof(bandmat) * (unsigned int)(n_alloc)); v = (double *)malloc(sizeof(double) * (unsigned int)(n_alloc)); perm = (int *)malloc(sizeof(int) * (unsigned int)(n_alloc)); if ( m!=NULL && v!=NULL && perm!=NULL ) { while (i++ < 60) { norm = spiro_iter(s, m, perm, v, jinca, nseg, cyclic, nmat); if (IS_FINITE(norm)==0) break; #ifdef VERBOSE printf("iteration #%d, %% norm = %g\n", i, norm); #endif if (norm < 1e-12) { converged = 1; break; } } #ifdef VERBOSE if (converged==0) fprintf(stderr, "ERROR: LibSpiro: failed to converge after %d attempts to converge.\n", i); } else { fprintf(stderr, "ERROR: LibSpiro: failed to alloc memory.\n"); #endif } free(perm); free(v); free(m); solve_spiroerr1: free(jinca); solve_spiroerr0: if (z >= 0) s[z].ty = 'z'; return converged; } static void spiro_seg_to_bpath1(const double ks[4], double *dm, double *di, double x0, double y0, double x1, double y1, bezctx *bc, int ncq, int si, int depth) { double bend, seg_ch, seg_th, ch, th, scale, rot; double th_even, th_odd, ul, vl, ur, vr; double thsub, xmid, ymid, cth, sth; double ksub[4], xysub[2], xy[2]; bend = fabs(ks[0]) + fabs(.5 * ks[1]) + fabs(.125 * ks[2]) + fabs((1./48) * ks[3]); if (bend <= 1e-8) { if (di[3] < x1 && x1 < di[4] && di[6] < y1 && y1 < di[7]) { #ifdef VERBOSE printf("...to next knot point...\n"); #endif bezctx_lineto(bc, di[2], di[5], si); } else { bezctx_lineto(bc, x1 * dm[0] + dm[1], y1 * dm[0] + dm[2], si); } } else { seg_ch = hypot(x1 - x0, y1 - y0); seg_th = atan2(y1 - y0, x1 - x0); integrate_spiro(ks, xy, N_IS); ch = hypot(xy[0], xy[1]); th = atan2(xy[1], xy[0]); scale = seg_ch / ch; rot = seg_th - th; if (ncq == 0 && (depth > 5 || bend < di[0])) { /* calculate cubic, and output bezier points */ th_even = (1./384) * ks[3] + (1./8) * ks[1] + rot; th_odd = (1./48) * ks[2] + .5 * ks[0]; ul = (scale * (1./3)) * cos(th_even - th_odd); vl = (scale * (1./3)) * sin(th_even - th_odd); ur = (scale * (1./3)) * cos(th_even + th_odd); vr = (scale * (1./3)) * sin(th_even + th_odd); if (di[3] < x1 && x1 < di[4] && di[6] < y1 && y1 < di[7]) { #ifdef VERBOSE printf("...to next knot point...\n"); #endif bezctx_curveto(bc, ((x0 + ul) * dm[0] + dm[1]), ((y0 + vl) * dm[0] + dm[2]), \ ((x1 - ur) * dm[0] + dm[1]), ((y1 - vr) * dm[0] + dm[2]), \ di[2], di[5], si); } else { bezctx_curveto(bc, ((x0 + ul) * dm[0] + dm[1]), ((y0 + vl) * dm[0] + dm[2]), \ ((x1 - ur) * dm[0] + dm[1]), ((y1 - vr) * dm[0] + dm[2]), \ (x1 * dm[0] + dm[1]), (y1 * dm[0] + dm[2]), si); } } else { /* subdivide */ ksub[0] = .5 * ks[0] - .125 * ks[1] + (1./64) * ks[2] - (1./768) * ks[3]; ksub[1] = .25 * ks[1] - (1./16) * ks[2] + (1./128) * ks[3]; ksub[2] = .125 * ks[2] - (1./32) * ks[3]; ksub[3] = (1./16) * ks[3]; thsub = rot - .25 * ks[0] + (1./32) * ks[1] - (1./384) * ks[2] + (1./6144) * ks[3]; cth = .5 * scale * cos(thsub); sth = .5 * scale * sin(thsub); integrate_spiro(ksub, xysub, N_IS); xmid = x0 + cth * xysub[0] - sth * xysub[1]; ymid = y0 + cth * xysub[1] + sth * xysub[0]; if (ncq != 0 && (depth > 5 || bend < di[0])) { if (ncq < 0) { /* looks like an arc (use quadto output). */ if (di[3] < x1 && x1 < di[4] && di[6] < y1 && y1 < di[7]) { #ifdef VERBOSE printf("...to next knot point...\n"); #endif bezctx_quadto(bc, (xmid * dm[0] + dm[1]), \ (ymid * dm[0] + dm[2]), di[2], di[5], si); } else { bezctx_quadto(bc, (xmid * dm[0] + dm[1]), \ (ymid * dm[0] + dm[2]), (x1 * dm[0] + dm[1]), \ (y1 * dm[0] + dm[2]), si); } } else { /* create quadratic bezier approximations */ th_even = (1./384) * ks[3] + (1./8) * ks[1] + rot; th_odd = (1./48) * ks[2] + .5 * ks[0]; ul = (scale * (1./6)) * cos(th_even - th_odd); vl = (scale * (1./6)) * sin(th_even - th_odd); ur = (scale * (1./6)) * cos(th_even + th_odd); vr = (scale * (1./6)) * sin(th_even + th_odd); bezctx_quadto(bc, ((x0 + ul) * dm[0] + dm[1]), ((y0 + vl) * dm[0] + dm[2]), \ (xmid * dm[0] + dm[1]), (ymid * dm[0] + dm[2]), si); if (di[3] < x1 && x1 < di[4] && di[6] < y1 && y1 < di[7]) { #ifdef VERBOSE printf("...to next knot point...\n"); #endif bezctx_quadto(bc, ((x1 - ur) * dm[0] + dm[1]), ((y1 - vr) * dm[0] + dm[2]), \ di[2], di[5], si); } else { bezctx_quadto(bc, ((x1 - ur) * dm[0] + dm[1]), ((y1 - vr) * dm[0] + dm[2]), \ (x1 * dm[0] + dm[1]), (y1 * dm[0] + dm[2]), si); } } } else { #ifdef VERBOSE printf("...subdivide curve...\n"); #endif spiro_seg_to_bpath1(ksub, dm, di, x0, y0, xmid, ymid, bc, ncq, si, depth + 1); ksub[0] += .25 * ks[1] + (1./384) * ks[3]; ksub[1] += .125 * ks[2]; ksub[2] += (1./16) * ks[3]; spiro_seg_to_bpath1(ksub, dm, di, xmid, ymid, x1, y1, bc, ncq, si, depth + 1); } } } } /* deprecated / keep backwards compatibility / not scalable */ static void spiro_seg_to_bpath(const double ks[4], double x0, double y0, double x1, double y1, bezctx *bc, int depth) { double di[8], dm[6]; set_dm_to_1(dm); di[1] = 0.0005 * 500; /* assume size in range {0..1000} */ set_di_to_x1y1(di, dm, x1, y1); spiro_seg_to_bpath1(ks, dm, di, x0, y0, x1, y1, bc, SPIRO_RETRO_VER1, 0, depth); } /* This function reverses src path for calling application. */ /* Spiro calculations might not translate well in the other */ /* direction, however, there may be a need to reverse path. */ /* Function leaves src unmodified if cannot reverse values. */ LS_DLL_EXPORT int spiroreverse(spiro_cp *src, int n) { char c; int i, j; double x, y; spiro_cp *tmp; if (n > 2 && src[0].ty == '{' && \ (src[1].ty == 'h' || src[n - 2].ty == 'a')) { #ifdef VERBOSE fprintf(stderr, "ERROR: LibSpiro: cannot reverse this list because it starts with '{','h' or ends with 'a','}'.\n"); #endif return -1; } if (src[n - 1].ty == 'z') --n; i = (int)((unsigned int)(n) * sizeof(spiro_cp)); if ( i <= 0 || (tmp=(spiro_cp *)malloc((unsigned int)(i))) == NULL ) return -1; #ifdef VERBOSE printf("reverse n=%d values:\n",n); #endif for (i=0,j=--n; i <= j; i++, j--) { /* NOTE: For graphic programs that repeat this over */ /* and over again, this reversal is best done once, */ /* and then you use the reversed string repeatedly; */ /* This helps avoid wasting time to recalculate the */ /* string over and over again unnecessarily. Script */ /* and non-graphic programs tend to need this once, */ /* or speed isn't as important as script simplicity */ /* so this suggestion (to pre-save) is unnecessary. */ tmp[j].ty = src[i].ty; tmp[j].x = src[i].x; tmp[j].y = src[i].y; if (i == j) break; tmp[i].ty = src[j].ty; tmp[i].x = src[j].x; tmp[i].y = src[j].y; } for (i=0; i <= n; i++) { c = tmp[i].ty; if (c == '[') tmp[i].ty = ']'; else if (c == ']') tmp[i].ty = '['; else if (c == '{') tmp[i].ty = '}'; else if (c == '}') tmp[i].ty = '{'; else if (c == 'h') { tmp[i].ty = 'a'; x = tmp[i].x; tmp[i].x = tmp[i + 1].x; x -= tmp[i].x; y = tmp[i].y; tmp[i].y = tmp[i + 1].y; y -= tmp[i].y; if ( tmp[++i].ty != 'a') goto errspiroreverse; tmp[i].ty = 'h'; tmp[i].x -= x; tmp[i].y -= y; } else if (c == 'a') goto errspiroreverse; } for (i=0; i <= n; i++) { src[i].ty = tmp[i].ty; src[i].x = tmp[i].x; src[i].y = tmp[i].y; #ifdef VERBOSE printf("reversed %d: ty=%c, x=%g, y=%g\n", i, src[i].ty, src[i].x, src[i].y ); #endif } free(tmp); return 0; errspiroreverse: free(tmp); return -1; } LS_DLL_EXPORT spiro_seg * run_spiro0(const spiro_cp *src, double *dm, int ncq, int n) { spiro_seg *s; if (src==NULL || n <= 0 || ncq < 0) return 0; if ((ncq & SPIRO_RETRO_VER1)) set_dm_to_1(dm); else dm[0] = -1.; s = setup_path0(src, dm, n); if (s) { if (solve_spiro(s, n)) return s; free(s); } return 0; } /* deprecated / backwards compatibility / not scalable */ LS_DLL_EXPORT spiro_seg * run_spiro(const spiro_cp *src, int n) { double dm[6]; return run_spiro0(src, dm, SPIRO_RETRO_VER1, n); } LS_DLL_EXPORT void free_spiro(spiro_seg *s) { if (s) free(s); } LS_DLL_EXPORT int spiro_to_bpath0(const spiro_cp *src, const spiro_seg *s, double *dm, int ncq, int n, bezctx *bc) { int i, j, lk, nsegs, si, z; double di[8], x0, y0, x1, y1; if (s==NULL || n <= 0 || ncq < 0 || bc==NULL) return 0; nsegs = n; if (s[0].ty == '{') { if (n >= 2 && s[n - 2].ty == 'a') --nsegs; --nsegs; z = -1; } else { if (s[n - 1].ty == 'z') --nsegs; z = nsegs - 1; } #ifdef VERBOSE printf("spiro_to_bpath0 ncq=0x%x n=%d nsegs=%d s=%d bc=%d\n",ncq,n,nsegs,s==NULL ? 0:1,bc==NULL ? 0:1); #endif x0 = x1 = s[0].x; y0 = y1 = s[0].y; for (i = 1; i < nsegs; i++) { if (s[i].ty != 'z' && s[i].ty != 'h') { if (s[i].x < x0) x0 = s[i].x; else if (s[i].x > x1) x1 = s[i].x; if (s[i].y < y0) y0 = s[i].y; else if (s[i].y > y1) y1 = s[i].y; } } x1 -= x0; y1 -= y0; di[1] = (x1 >= y1) ? x1: y1; di[1] *= 0.0005; di[0] = 1.; /* default cubic to bezier bend */ lk = (ncq & SPIRO_INCLUDE_LAST_KNOT) && s[n - 1].ty == '}' ? 1 : 0; if ( (ncq & SPIRO_INTERNAL_BEZCTX) ) si = 1; else if ( (bc->moveto==NULL || bc->lineto==NULL || bc->quadto==NULL || \ bc->curveto==NULL || bc->mark_knot==NULL) ) return 0; else si = 0; if ( (ncq &= SPIRO_ARC_CUB_QUAD_MASK)==0 ) { /* default action = cubic bezier output */; } else if (ncq == SPIRO_CUBIC_MIN_MAYBE) { /* visual inspection advised */ ncq = 0; /* NOTE: experimental, best to look at results first */ di[0] = M_PI / 2 + .000001; } else if (ncq == SPIRO_ARC_MAYBE) { /* visual inspection advised */ ncq = -1; /* NOTE: these are arcs (maybe), not quadratic */ } else if (ncq == SPIRO_ARC_MIN_MAYBE) { /* visual inspection advised */ ncq = -1; /* NOTE: these are arcs (maybe), not quadratic */ di[0] = M_PI / 2 + .000001; } else if (ncq == SPIRO_QUAD0_TO_BEZIER) { /* roughly approximate a cubic using two quadratic arcs. */ ncq = 0x10; } for (i=j=0; i < nsegs; i++,j++) { x0 = s[i].x; y0 = s[i].y; if (i == 0) { if (src != NULL) { bezctx_moveto(bc, src[0].x, src[0].y, s[0].ty == '{', si); } else { bezctx_moveto(bc, (x0 * dm[0] + dm[1]), (y0 * dm[0] + dm[2]), s[0].ty == '{', si); } if (nsegs > 1 && s[1].ty == 'h') ++i; } else if (s[i].ty == 'a') ++i; if (i == z) { x1 = s[0].x; y1 = s[0].y; } else { x1 = s[i + 1].x; y1 = s[i + 1].y; } set_di_to_x1y1(di, dm, x1, y1); if (src != NULL) { if (i == z) { di[2] = src[0].x; di[5] = src[0].y; } else { di[2] = src[i + 1].x; di[5] = src[i + 1].y; } } bezctx_mark_knot(bc, j, si); spiro_seg_to_bpath1(s[i].ks, dm, di, x0, y0, x1, y1, bc, ncq, si, 0); } if (lk) bezctx_mark_knot(bc, j, si); return 1; } /* deprecated / backwards compatibility / not scalable */ LS_DLL_EXPORT void spiro_to_bpath(const spiro_seg *s, int n, bezctx *bc) { double dm[6]; set_dm_to_1(dm); spiro_to_bpath0(NULL, s, dm, SPIRO_RETRO_VER1, n, bc); } LS_DLL_EXPORT const char * LibSpiroVersion(void) { return( LS_VERSION_STR ); } LS_DLL_EXPORT double get_knot_th(const spiro_seg *s, int i) { double ends[2][4]; if (i == 0) { compute_ends(s[i].ks, ends, s[i].seg_ch); return s[i].seg_th - ends[0][0]; } else { compute_ends(s[i - 1].ks, ends, s[i - 1].seg_ch); return s[i - 1].seg_th + ends[1][0]; } } libspiro-20221101/spiro.h000066400000000000000000000027141433036472700151110ustar00rootroot00000000000000/* spiro.h libspiro - A sharable library of Spiro formula and functions. */ #ifndef _SPIRO_H #define _SPIRO_H #ifdef __cplusplus extern "C" { #endif typedef struct { /* User passes an array of SpiroCP in this format for Spiro to solve */ double x; /* Spiro CodePoint Xloc */ double y; /* Spiro CodePoint Yloc */ char ty; /* Spiro CodePoint Type */ } spiro_cp; struct spiro_seg_s { /* run_spiro() uses array of information given in the structure above and */ /* creates an array in this structure format to use by spiro_to_bpath for */ /* building bezier curves */ double x; /* SpiroCP segment_chord startX */ double y; /* SpiroCP segment_chord startY */ char ty; /* Spiro CodePoint Type */ double bend_th; /* bend theta between this vector and next vector */ double ks[4]; double seg_ch; /* segment_chord distance from xy to next SpiroCP */ double seg_th; /* segment_theta angle for this SpiroCP */ double l; }; typedef struct spiro_seg_s spiro_seg; spiro_seg * run_spiro(const spiro_cp *src, int n); /* deprecated */ void free_spiro(spiro_seg *s); void spiro_to_bpath(const spiro_seg *s, int n, bezctx *bc); /* deprecated */ double get_knot_th(const spiro_seg *s, int i); spiro_seg * run_spiro0(const spiro_cp *src, double *dm, int ncq, int n); int spiro_to_bpath0(const spiro_cp *src, const spiro_seg *s, double *dm, int ncq, int n, bezctx *bc); const char * LibSpiroVersion(void); #ifdef __cplusplus } #endif #endif libspiro-20221101/spiro_intf.h000066400000000000000000000022151433036472700161250ustar00rootroot00000000000000/* spiro_intf.h libspiro - A sharable library of Spiro formula and functions. */ #ifndef _SPIRO_INTF_H #define _SPIRO_INTF_H /* Generic helper definitions for shared library support */ /* as explained in - https://gcc.gnu.org/wiki/Visibility */ #if defined (_WIN32) || defined (__CYGWIN__) || (_WIN64) || defined (__CYGWIN64__) #ifndef __clang__ #define LS_DLL_IMPORT __declspec(dllimport) #define LS_DLL_EXPORT __declspec(dllexport) #define LS_DLL_LOCAL #else /* CLANG already appears to add this. Turn this off. */ #define LS_DLL_IMPORT #define LS_DLL_EXPORT #define LS_DLL_LOCAL #endif #else #if __GNUC__ >= 4 #define LS_DLL_IMPORT __attribute__ ((visibility ("default"))) #define LS_DLL_EXPORT __attribute__ ((visibility ("default"))) /* 'internal' to avoid library conflicts. 'hidden' for debugging */ /* #define UN_DLL_LOCAL __attribute__ ((visibility ("hidden"))) */ #define LS_DLL_LOCAL __attribute__ ((visibility ("internal"))) #else #define LS_DLL_IMPORT #define LS_DLL_EXPORT #define LS_DLL_LOCAL #endif #endif int spiroreverse(spiro_cp *src, int n); /* internal use */ #endif libspiro-20221101/spiroentrypoints.c000066400000000000000000000066421433036472700174270ustar00rootroot00000000000000/* libspiro - A sharable library of Spiro formula and functions. This file is a fork from ppedit for use by the libspiro project. Please see Changelog or git history for description of changes. ============================================================= Copyright (C) 2007... Raph Levien (ppedit) Copyright (C) 2007... George Williams (libspiro fork) Copyright (C) 2013... Joe Da Silva (improvements) 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #include "spiroentrypoints.h" #include "spiro_intf.h" /* These six functions are kept for backwards compatibility */ LS_DLL_EXPORT void SpiroCPsToBezier(spiro_cp *spiros,int n,int isclosed,bezctx *bc) { SpiroCPsToBezier2(spiros,n,SPIRO_RETRO_VER1,isclosed,bc); } LS_DLL_EXPORT void TaggedSpiroCPsToBezier(spiro_cp *spiros,bezctx *bc) { TaggedSpiroCPsToBezier2(spiros,SPIRO_RETRO_VER1,bc); } LS_DLL_EXPORT int SpiroCPsToBezier0(spiro_cp *spiros,int n,int isclosed,bezctx *bc) { return SpiroCPsToBezier2(spiros,n,SPIRO_RETRO_VER1,isclosed,bc); } LS_DLL_EXPORT int TaggedSpiroCPsToBezier0(spiro_cp *spiros,bezctx *bc) { return TaggedSpiroCPsToBezier2(spiros,SPIRO_RETRO_VER1,bc); } LS_DLL_EXPORT void SpiroCPsToBezier1(spiro_cp *spiros,int n,int isclosed,bezctx *bc,int *done) { *done = SpiroCPsToBezier2(spiros,n,SPIRO_RETRO_VER1,isclosed,bc); } LS_DLL_EXPORT void TaggedSpiroCPsToBezier1(spiro_cp *spiros,bezctx *bc,int *done) { *done = TaggedSpiroCPsToBezier2(spiros,SPIRO_RETRO_VER1,bc); } LS_DLL_EXPORT int SpiroCPsToBezier2(spiro_cp *spiros,int n,int ncq,int isclosed,bezctx *bc) { double dm[6]; spiro_seg *s; if ( n<=0 || ncq<0 ) return 0; /* invalid inputs */ if ( n > 1 && (ncq & SPIRO_REVERSE_SRC) && spiroreverse(spiros,n) ) return 0; if ( isclosed ) s = run_spiro0(spiros,dm,ncq,n); else { char oldty_start = spiros[0].ty; char oldty_end = spiros[n-1].ty; spiros[0].ty = '{'; spiros[n-1].ty = '}'; s = run_spiro0(spiros,dm,ncq,n); spiros[n-1].ty = oldty_end; spiros[0].ty = oldty_start; } if ( s ) { if ( spiro_to_bpath0(spiros,s,dm,ncq,n,bc) ) { free_spiro(s); return 1; /* success */ } free_spiro(s); } return 0; /* spiro did not converge or encountered non-finite values */ } LS_DLL_EXPORT int TaggedSpiroCPsToBezier2(spiro_cp *spiros,int ncq,bezctx *bc) { double dm[6]; spiro_seg *s; int n; for ( n=0; spiros[n].ty!='z' && spiros[n].ty!='}'; ++n ); if ( spiros[n].ty == '}' ) ++n; if ( n<=0 || ncq<0 ) return 0; /* invalid inputs */ if ( n > 1 && (ncq & SPIRO_REVERSE_SRC) && spiroreverse(spiros,n) ) return 0; s = run_spiro0(spiros,dm,ncq,n); if ( s ) { if ( spiro_to_bpath0(spiros,s,dm,ncq,n,bc) ) { free_spiro(s); return 1; /* success */ } free_spiro(s); } return 0; /* spiro did not converge or encountered non-finite values */ } libspiro-20221101/spiroentrypoints.h000066400000000000000000000075741433036472700174410ustar00rootroot00000000000000/* spiroentrypoints.h libspiro - A sharable library of Spiro formula and functions. */ #ifndef _SPIROENTRYPOINTS_H #define _SPIROENTRYPOINTS_H #include "bezctx.h" #include "spiro.h" #ifdef __cplusplus extern "C" { #endif /* Possible values of the "ty" field. */ #define SPIRO_CORNER 'v' #define SPIRO_G4 'o' #define SPIRO_G2 'c' #define SPIRO_LEFT '[' #define SPIRO_RIGHT ']' /* For a closed contour add an extra cp with a ty set to */ #define SPIRO_END 'z' /* For an open contour the first cp must have a ty set to*/ #define SPIRO_OPEN_CONTOUR '{' /* For an open contour the last cp must have a ty set to */ #define SPIRO_END_OPEN_CONTOUR '}' /* These 6 functions are kept for backwards compatibility for older */ /* programs. Please use the functions listed afterwards that return */ /* success/failure replies when done. See version 20130930 or later */ /* WARNING: These two libspiro-20071029 functions can fail silently */ extern void TaggedSpiroCPsToBezier(spiro_cp *spiros,bezctx *bc); extern void SpiroCPsToBezier(spiro_cp *spiros,int n,int isclosed,bezctx *bc); /* These functions are available in libspiro-0.2.20130930 or higher */ /* int=1 on success of creating *bc. int=0 if failed to create *bc. */ extern int TaggedSpiroCPsToBezier0(spiro_cp *spiros,bezctx *bc); extern int SpiroCPsToBezier0(spiro_cp *spiros,int n,int isclosed,bezctx *bc); /* These functions are available in libspiro-0.3.20150131 or higher */ /* done=1 if succeded creating *bc. done=0 if failed to create *bc. */ extern void TaggedSpiroCPsToBezier1(spiro_cp *spiros,bezctx *bc,int *done); extern void SpiroCPsToBezier1(spiro_cp *spiros,int n,int isclosed,bezctx *bc,int *done); /* These functions are available in libspiro-20190731 or higher and */ /* give you best flexibility compared to earlier libspiro versions. */ extern const char *LibSpiroVersion(void); /* The spiros array should indicate it's own end... So */ /* Open contours must have the ty field of the first cp set to '{' */ /* and have the ty field of the last cp set to '}' */ /* Closed contours must have an extra cp at the end whose ty is 'z' */ /* the x&y values of this extra cp are ignored */ /* ncq allows you to toggle different outputs independent of spiros */ /* int=1 on success of creating *bc. int=0 if failed to create *bc. */ extern int TaggedSpiroCPsToBezier2(spiro_cp *spiros,int ncq,bezctx *bc); /* The first argument is an array of spiro control points. */ /* Open contours do not need to start with '{', nor to end with '}' */ /* Close contours do not need to end with 'z' */ /* ncq allows you to toggle different outputs independent of spiros */ /* int=1 on success of creating *bc. int=0 if failed to create *bc. */ extern int SpiroCPsToBezier2(spiro_cp *spiros,int n,int ncq,int isclosed,bezctx *bc); /* Two more "ty" values for libspiro-20190731 or higher. */ /* Curve crossing point with a 'fixed angle' of crossing */ #define SPIRO_ANCHOR 'a' /* Curve crossing handle cp(hx,hy) relative to cp(ax,ay) */ #define SPIRO_HANDLE 'h' /* int ncq flags and values */ #define SPIRO_INCLUDE_LAST_KNOT 0x0100 #define SPIRO_RETRO_VER1 0x0400 #define SPIRO_REVERSE_SRC 0x0800 #define SPIRO_ARC_CUB_QUAD_CLR 0x7FFF #define SPIRO_ARC_CUB_QUAD_MASK 0x7000 #define SPIRO_CUBIC_TO_BEZIER 0x0000 #define SPIRO_CUBIC_MIN_MAYBE 0x1000 #define SPIRO_ARC_MAYBE 0x2000 #define SPIRO_ARC_MIN_MAYBE 0x3000 #define SPIRO_QUAD0_TO_BEZIER 0x4000 /* This ncq flag value is available in libspiro-20220722 or higher. */ #define SPIRO_INTERNAL_BEZCTX 0x0200 /* These two functions are available in libspiro-20220722 or higher */ /* and used exclusively with ncq definition "SPIRO_INTERNAL_BEZCTX" */ /* tests/call-test21.c sample code shows how to use these functions */ ls_bezctx *new_ls_bezctx(int max, int ncq); void free_ls_bezctx(ls_bezctx *bd); #ifdef __cplusplus } #endif #endif libspiro-20221101/tests/000077500000000000000000000000001433036472700147425ustar00rootroot00000000000000libspiro-20221101/tests/Makefile.am000066400000000000000000000042371433036472700170040ustar00rootroot00000000000000# Common CPPFLAGS AM_CPPFLAGS = -I$(top_srcdir) -I$(top_builddir) AM_CFLAGS = -I$(top_srcdir) -I$(top_builddir) $(DEP_CFLAGS) $(BABL_CFLAGS) -lm DEPS = $(top_builddir)/libspiro.la LDADDS = $(top_builddir)/libspiro.la EXTRA_DIST = call-test.c # The tests noinst_PROGRAMS = unit-test call-test0 call-test1 call-test2 call-test3 \ call-test4 call-test5 call-test6 call-test7 call-test8 \ call-test9 call-test10 call-test11 call-test12 \ call-test13 call-test14 call-test15 call-test16 \ call-test17 call-test18 call-test19 call-test20 \ call-test21 call-testm unit_test_SOURCES = unit-test.c call_test0_SOURCES = call-test0.c call_test0_LDADD = $(LDADDS) call_test1_SOURCES = call-test1.c call_test1_LDADD = $(LDADDS) call_test2_SOURCES = call-test2.c call_test2_LDADD = $(LDADDS) call_test3_SOURCES = call-test3.c call_test3_LDADD = $(LDADDS) call_test4_SOURCES = call-test4.c call_test4_LDADD = $(LDADDS) call_test5_SOURCES = call-test5.c call_test5_LDADD = $(LDADDS) call_test6_SOURCES = call-test6.c call_test6_LDADD = $(LDADDS) call_test7_SOURCES = call-test7.c call_test7_LDADD = $(LDADDS) call_test8_SOURCES = call-test8.c call_test8_LDADD = $(LDADDS) call_test9_SOURCES = call-test9.c call_test9_LDADD = $(LDADDS) call_test10_SOURCES = call-test10.c call_test10_LDADD = $(LDADDS) call_test11_SOURCES = call-test11.c call_test11_LDADD = $(LDADDS) call_test12_SOURCES = call-test12.c call_test12_LDADD = $(LDADDS) call_test13_SOURCES = call-test13.c call_test13_LDADD = $(LDADDS) call_test14_SOURCES = call-test14.c call_test14_LDADD = $(LDADDS) call_test15_SOURCES = call-test15.c call_test15_LDADD = $(LDADDS) call_test16_SOURCES = call-test16.c call_test16_LDADD = $(LDADDS) call_test17_SOURCES = call-test17.c call_test17_LDADD = $(LDADDS) call_test18_SOURCES = call-test18.c call_test18_LDADD = $(LDADDS) call_test19_SOURCES = call-test19.c call_test19_LDADD = $(LDADDS) call_test20_SOURCES = call-test20.c call_test20_LDADD = $(LDADDS) call_test21_SOURCES = call-test21.c call_test21_LDADD = $(LDADDS) call_testm_SOURCES = call-testm.c call_testm_LDADD = $(LDADDS) if WANTPTHREADS call_testm_LDADD += -lpthread endif TESTS = $(noinst_PROGRAMS) libspiro-20221101/tests/call-test.c000066400000000000000000001210101433036472700167710ustar00rootroot00000000000000/* Test libspiro normal library calls Copyright (C) 2013... Joe Da Silva 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include "spiro-config.h" /* for ./configure test settings like VERBOSE */ #ifdef DO_TIME_DAY #include /* for gettimeofday */ #else #include /* for old get_time */ #endif #include "spiroentrypoints.h" /* call spiro through here */ #include "bezctx.h" /* bezctx structure */ #ifdef DO_CALL_TEST20 #include "spiro_intf.h" /* need to test reverse string */ #endif #ifdef DO_CALL_TESTM #ifdef HAVE_PTHREADS #include /* multi-thread check. Not part of libspiro */ #endif #endif static double get_time (void) { #ifdef DO_TIME_DAY struct timeval tv; gettimeofday(&tv, NULL); return tv.tv_sec + 1e-6 * tv.tv_usec; #else struct timeb tb; ftime(&tb); return tb.time + 1e-3 * tb.millitm; #endif } #ifndef DO_CALL_TESTM /* Expected run_spiro() test data results for path0/1/2/4/5/6[]. */ typedef struct { double b, ch, th; } rs_check_vals; rs_check_vals verify_rs0[] = { /* iteration5 */ {0.000000, 65.741920, 2.027641}, /* v,334,117 */ {0.000000, 99.020200, -2.791096}, /* v,305,176 */ {-0.851164, 60.415230, 2.640925}, /* c,212,142 */ {-1.847893, 92.633687, 0.793032}, /* c,159,171 */ {-0.120277, 157.267288, 0.672755}, /* c,224,237 */ {1.730337, 196.084166, 2.403091}, /* c,347,335 */ {1.042797, 126.826653, -2.837297}, /* c,202,467 */ {0.000000, 69.354164, -1.074902}, /* v, 81,429 */ {0.000000, 93.407708, 0.372554}, /* v,114,368 */ {-0.787061, 81.939002, -0.414507}, /* c,201,402 */ {-1.916483, 84.172442, -2.330990}, /* c,276,369 */ {-0.158341, 159.806133, -2.489331}, /* c,218,308 */ {1.237282, 105.304321, -1.252049}, /* c, 91,211 */ {0.982576, 108.931171, -0.269473}, /* c,124,111 */ {0.591223, 110.679718, 0.321751} /* c,229, 82 */ }; /* z */ rs_check_vals verify_rs1[] = { /* iteration6 */ {0.000000, 697.685459, -0.287750}, /* {, 80,738 */ {-1.608688, 243.813453, -1.896438}, /* o,749,540 */ {-1.770739, 173.404152, 2.616009}, /* o,671,309 */ {0.937994, 157.178243, -2.729182}, /* o,521,396 */ {1.881365, 136.029409, -0.847817} /* o,377,333 */ }; /* },467,231 */ rs_check_vals verify_rs2[] = { /* iteration26 */ {0.000000, 108.115679, -0.046263}, /* {,233,143 */ {-0.926114, 79.881162, -0.972377}, /* o,341,138 */ {1.844174, 90.138782, 0.871797} /* o,386, 72 */ }; /* },444,141 */ rs_check_vals verify_rs4[] = { /* iteration2 */ {-1.570796, 141.421356, 0.785398}, /* o,-100, 0 */ {-1.570796, 141.421356, -0.785398}, /* o, 0, 100 */ {-1.570796, 141.421356, -2.356194} /* o,100, 0 */ }; /* o, 0,-100 */ rs_check_vals verify_rs5[] = { /* iteration4 verify_rs6 */ {0.000000, 141.421356, 0.785398}, /* {, 0, 0 {, 0, 0 */ {0.000000, 141.421356, 0.785398}, /* c,100, 100 c,100, 100 */ {-0.785398, 100.000000, 0.000000}, /* [,200, 200 a,200, 200 */ {-0.463648, 111.803399, -0.463648}, /* ],300, 200 h,300, 200 */ {-2.214297, 111.803399, -2.677945}, /* c,400, 150 c,300, 150 */ {-0.463648, 100.000000, 3.141593}, /* [,300, 100 a,200, 100 */ {0.785398, 70.710678, -2.356194}, /* ],200, 100 h,100, 100 */ {0.000000, 70.710678, -2.356194}, /* c,150, 50 c,150, 50 */ {0.000000, 141.421356, -2.356194}, /* [,100, 0 a,100, 0 */ {0.321751, 111.803399, -2.034444}, /* ], 0,-100 h, 0,-100 */ {-0.076772, 58.309519, -2.111216} /* c,-50,-200 c, 50,-100 */ }; /* },-80,-250 }, 20,-150 */ rs_check_vals verify_rs7[] = { /* iteration4 */ {-0.950547, 50.990195, 0.197396}, /* o, 0, 200 */ {-1.534449, 215.870331, -1.337053}, /* o, 50, 210 */ {-0.233743, 50.000000, -1.570796}, /* a,100, 0 */ {-0.484478, 214.709106, -2.055274}, /* h,100, -50 */ {-0.986650, 50.249378, -3.041924}, /* a, 0,-190 */ {-1.228091, 210.237960, 2.013171}, /* h,-50,-195 */ {-0.342706, 50.249378, 1.670465}, /* a,-90, 0 */ {-0.522523, 219.317122, 1.147942} /* h,-95, 50 */ }; /* z, path12 */ rs_check_vals verify_rs8[] = { /* iteration4 */ {-0.950547, 50.990195, 0.197396}, /* o, 0, 200 */ {-1.534449, 215.870331, -1.337053}, /* o, 50, 210 */ {-0.233743, 50.000000, -1.570796}, /* a,100, 0 */ {-0.484478, 214.709106, -2.055274}, /* h,100, -50 */ {-0.986650, 50.249378, -3.041924}, /* a, 0,-190 */ {-1.228091, 210.237960, 2.013171}, /* h,-50,-195 */ {-0.342706, 50.249378, 1.670465} /* a,-90, 0 */ }; /* h,-95, 50 */ rs_check_vals verify_rs9[] = { /* iteration9 */ {-1.570796, 141.421356, 0.785398}, /* o,-100, 0 */ {-1.570796, 141.421356, -0.785398}, /* o, 0, 100 */ {-1.570796, 141.421356, -2.356194}, /* o,100, 0 */ {-1.570796, 141.421356, 2.356194} /* o, 0,-100 */ }; rs_check_vals verify_rs10[] = { /* iteration4 */ {-0.233743, 50.000000, -1.570796}, /* a,100, 0 */ {-0.484478, 214.709106, -2.055274}, /* h,100, -50 */ {-0.986650, 50.249378, -3.041924}, /* a, 0,-190 */ {-1.228091, 210.237960, 2.013171}, /* h,-50,-195 */ {-0.342706, 50.249378, 1.670465}, /* a,-90, 0 */ {-0.522523, 219.317122, 1.147942}, /* h,-95, 50 */ {-0.950547, 50.990195, 0.197396}, /* o, 0, 200 */ {-1.534449, 215.870331, -1.337053} /* o, 50, 210 */ }; rs_check_vals verify_rs11[] = { /* iteration4 */ {-0.256151, 50.000000, -1.570796}, /* [,100, 0 */ {-0.484478, 214.709106, -2.055274}, /* ],100, -50 */ {-0.986650, 50.249378, -3.041924}, /* a, 0,-240 */ {-1.228091, 210.237960, 2.013171}, /* h,-50,-245 */ {-0.342706, 50.249378, 1.670465}, /* [,-90, -50 */ {-0.522523, 219.317122, 1.147942}, /* ],-95, 0 */ {-0.950547, 50.990195, 0.197396}, /* o, -5, 200 */ {-1.512041, 217.082933, -1.314645} /* o, 45, 210 */ }; rs_check_vals verify_rs13[] = { /* iteration4 */ { 0.000000, 50.000000, -1.570796}, /* {,100, 0 */ {-0.484478, 214.709106, -2.055274}, /* h,100, -50 */ {-0.986650, 50.249378, -3.041924}, /* a, 0,-190 */ {-1.228091, 210.237960, 2.013171}, /* h,-50,-195 */ {-0.342706, 50.249378, 1.670465}, /* a,-90, 0 */ {-0.522523, 219.317122, 1.147942}, /* h,-95, 50 */ {-0.950547, 50.990195, 0.197396}, /* o, 0, 200 */ {-1.534449, 215.870331, -1.337053} /* }, 50, 210 */ }; /* a,100, 0 */ rs_check_vals verify_rs14[] = { /* iteration9 */ {-1.570796, 141.421356e10, 0.785398}, /* o,-100e10, 0 */ {-1.570796, 141.421356e10, -0.785398}, /* o, 0, 100e10 */ {-1.570796, 141.421356e10, -2.356194}, /* o, 100e10, 0 */ {-1.570796, 141.421356e10, 2.356194} /* o, 0,-100e10 */ }; rs_check_vals verify_rs15[] = { /* iteration9 */ {-1.570796, 141.421356e-42, 0.785398}, /* o,-100e-42, 0 */ {-1.570796, 141.421356e-42, -0.785398}, /* o, 0, 100e-42 */ {-1.570796, 141.421356e-42, -2.356194}, /* o, 100e-42, 0 */ {-1.570796, 141.421356e-42, 2.356194} /* o, 0,-100e-42 */ }; #endif void load_test_curve(spiro_cp *spiro, int *nextknot, int c) { /* load a test curve (and nextknot locations) into memory */ spiro_cp path0[] = { /* ...came with unit-test */ {334, 117, 'v'}, {305, 176, 'v'}, {212, 142, 'c'}, {159, 171, 'c'}, {224, 237, 'c'}, {347, 335, 'c'}, {202, 467, 'c'}, { 81, 429, 'v'}, {114, 368, 'v'}, {201, 402, 'c'}, {276, 369, 'c'}, {218, 308, 'c'}, { 91, 211, 'c'}, {124, 111, 'c'}, {229, 82, 'c'}, {0, 0, 'z'} }; int knot0[] = { 1, 1, 3, 3, 2, 3, 1, 1, 1, 3, 3, 2, 2, 2, 1, 1 }; spiro_cp path1[] = { /* do a test using "{"..."}" */ { 80, 738, '{'}, {749, 540, 'o'}, {671, 309, 'o'}, {521, 396, 'o'}, {377, 333, 'o'}, {467, 231, '}'} }; int knot1[] = { 3, 4, 2, 3, 2, 0 }; spiro_cp path2[] = { /* this does many iterations */ {233, 143, '{'}, {341, 138, 'o'}, {386, 72, 'o'}, {444, 141, '}'} }; int knot2[] = { 2, 1, 9, 0 }; spiro_cp path3[] = { /* this will fail to converge */ {233, 144, '{'}, /* will not pass (on purpose) */ {341, 138, 'o'}, {386, 72, 'o'}, {443, 141, 'o'}, {467, 231, 'o'}, {377, 333, '}'} }; int knot3[] = { 2, 1, 9, 1, 1, 0 }; spiro_cp path4[] = { /* test a cyclic calculation. */ {-100, 0, SPIRO_G4}, { 0, 100, SPIRO_G4}, { 100, 0, SPIRO_G4}, { 0, -100, SPIRO_G4} }; int knot4[] = { 2, 2, 2, 0 }; spiro_cp path5[] = { /* verify curve data with []. */ { 0, 0, '{'}, {100, 100, 'c'}, {200, 200, '['}, {300, 200, ']'}, {400, 150, 'c'}, {300, 100, '['}, {200, 100, ']'}, {150, 50, 'c'}, {100, 0, '['}, { 0,-100, ']'}, {-50,-200, 'c'}, {-80,-250, '}'} /* test 23 reverses this list. */ }; int knot5[] = { 1, 4, 1, 3, 3, 1, 4, 2, 1, 2, 1, 0 }; spiro_cp path6[] = { /* verify curve data with ah. */ { 0, 0, '{'}, {100, 100, 'c'}, {200, 200, 'a'}, {300, 200, 'h'}, {300, 150, 'c'}, {200, 100, 'a'}, {100, 100, 'h'}, {150, 50, 'c'}, {100, 0, 'a'}, { 0,-100, 'h'}, { 50,-100, 'c'}, { 20,-150, '}'} }; int knot6[] = { 1, 4, 3, 3, 4, 2, 2, 1, 0, 0, 0, 0 }; spiro_cp path7[] = { /* loop stops with ah curves. */ { 0, 200, 'o'}, { 50, 210, 'o'}, {100, 0, 'a'}, {100, -50, 'h'}, { 0,-190, 'a'}, {-50,-195, 'h'}, {-90, 0, 'a'}, {-95, 50, 'h'},/* tests 7, 8, 20, 21 end here */ { 0, 0, 'z'} /* call_test 12 ends with ah z */ }; int knot7[] = { 1, 1, 5, 5, 6, 3, 0, 0, 0 }; spiro_cp path10[] = { /* start loop with ah curves */ {100, 0, 'a'}, {100, -50, 'h'}, { 0,-190, 'a'}, {-50,-195, 'h'}, {-90, 0, 'a'}, {-95, 50, 'h'}, { 0, 200, 'o'}, { 50, 210, 'o'} }; int knot10[] = { 5, 6, 3, 1, 1, 5, 0, 0 }; spiro_cp path11[] = { /* start loop with [] curves */ {100, 0, '['}, {100, -50, ']'}, { 0,-240, 'a'}, {-50,-245, 'h'}, {-90, -50, '['}, {-95, 0, ']'}, { -5, 200, 'o'}, { 45, 210, 'o'} }; int knot11[] = { 5, 6, 3, 1, 1, 5, 0, 0 }; spiro_cp path13[] = { /* start open curve using {h */ {100, 0, '{'}, {100, -50, 'h'}, { 0,-190, 'a'}, {-50,-195, 'h'}, {-90, 0, 'a'}, {-95, 50, 'h'}, { 0, 200, 'o'}, { 50, 210, '}'} }; int knot13[] = { 5, 6, 3, 1, 1, 5, 0, 0 }; spiro_cp path14[] = { /* very big path[4] version. */ {-100e10, 0, SPIRO_G4}, { 0, 100e10, SPIRO_G4}, { 100e10, 0, SPIRO_G4}, { 0, -100e10, SPIRO_G4} }; spiro_cp path15[] = { /* very tiny path[4] version */ {-100e-42, 0, SPIRO_G4}, { 0, 100e-42, SPIRO_G4}, { 100e-42, 0, SPIRO_G4}, { 0, -100e-42, SPIRO_G4} }; int i; /* Load static variable tables into memory because */ /* SpiroCPsToBezier0() modifies start & end values */ /* Later call-tests will also modify these so that */ /* we can verify multi-threads aren't overwriting. */ if ( c==0 ) for (i = 0; i < 16; i++) { spiro[i].x = path0[i].x; spiro[i].y = path0[i].y; spiro[i].ty = path0[i].ty; nextknot[i] = knot0[i]; } else if ( c==1 ) for (i = 0; i < 6; i++) { spiro[i].x = path1[i].x; spiro[i].y = path1[i].y; spiro[i].ty = path1[i].ty; nextknot[i] = knot1[i]; } else if ( c==2 ) for (i = 0; i < 4; i++) { spiro[i].x = path2[i].x; spiro[i].y = path2[i].y; spiro[i].ty = path2[i].ty; nextknot[i] = knot2[i]; } else if ( c==3 ) for (i = 0; i < 6; i++) { spiro[i].x = path3[i].x; spiro[i].y = path3[i].y; spiro[i].ty = path3[i].ty; nextknot[i] = knot3[i]; } else if ( c==4 ) for (i = 0; i < 4; i++) { spiro[i].x = path4[i].x; spiro[i].y = path4[i].y; spiro[i].ty = path4[i].ty; nextknot[i] = knot4[i]; } else if ( c==5 ) for (i = 0; i < 12; i++) { spiro[i].x = path5[i].x; spiro[i].y = path5[i].y; spiro[i].ty = path5[i].ty; nextknot[i] = knot5[i]; } else if ( c==6 ) for (i = 0; i < 12; i++) { spiro[i].x = path6[i].x; spiro[i].y = path6[i].y; spiro[i].ty = path6[i].ty; nextknot[i] = knot6[i]; } else if ( c==7 || c==8 || c==21 ) for (i = 0; i < 8; i++) { /* path7[] is closed curve, path{8,21}[] are open curves. */ spiro[i].x = path7[i].x; spiro[i].y = path7[i].y; spiro[i].ty = path7[i].ty; nextknot[i] = knot7[i]; } else if ( c==9 ) for (i = 0; i < 4; i++) { /* path9[] is closed curve version of path4[] open curve. */ spiro[i].x = path4[i].x; spiro[i].y = path4[i].y; spiro[i].ty = path4[i].ty; nextknot[i] = knot4[i]; } else if ( c==10 ) for (i = 0; i < 8; i++) { /* path10[] is a closed loop starting with ah */ spiro[i].x = path10[i].x; spiro[i].y = path10[i].y; spiro[i].ty = path10[i].ty; nextknot[i] = knot10[i]; } else if ( c==11 ) for (i = 0; i < 8; i++) { /* path11[] is an open curve starting with [] */ spiro[i].x = path11[i].x; spiro[i].y = path11[i].y; spiro[i].ty = path11[i].ty; nextknot[i] = knot11[i]; } else if ( c==12 ) for (i = 0; i < 9; i++) { /* call_test12 checks curve ending in ah with following z */ /* and declare cl[12] len=8 so run_spiro() can work okay. */ spiro[i].x = path7[i].x; spiro[i].y = path7[i].y; spiro[i].ty = path7[i].ty; nextknot[i] = knot7[i]; } else if ( c==13 ) for (i = 0; i < 8; i++) { /* path13[] is open curve based on path11[] using '{','}' */ spiro[i].x = path13[i].x; spiro[i].y = path13[i].y; spiro[i].ty = path13[i].ty; nextknot[i] = knot13[i]; } else if ( c==14 ) for (i = 0; i < 4; i++) { /* path14[] is a very big version of closed curve path9[] */ spiro[i].x = path14[i].x; spiro[i].y = path14[i].y; spiro[i].ty = path14[i].ty; nextknot[i] = knot4[i]; } else if ( c==15 ) for (i = 0; i < 4; i++) { /* path15[] is a very small copy of path9[] closed curve. */ spiro[i].x = path15[i].x; spiro[i].y = path15[i].y; spiro[i].ty = path15[i].ty; nextknot[i] = knot4[i]; } else if ( c==16 ) for (i = 0; i < 4; i++) { /* path16[] uses path4[] as first try at quadratic output */ spiro[i].x = path4[i].x; spiro[i].y = path4[i].y; spiro[i].ty = path4[i].ty; nextknot[i] = knot4[i]; } else if ( c==17 ) for (i = 0; i < 4; i++) { /* path17[] is closed curve version of path4[] open curve */ spiro[i].x = path4[i].x; spiro[i].y = path4[i].y; spiro[i].ty = path4[i].ty; nextknot[i] = knot4[i]; } else if ( c==18 ) for (i = 0; i < 4; i++) { spiro[i].x = path2[i].x; spiro[i].y = path2[i].y; spiro[i].ty = path2[i].ty; nextknot[i] = knot2[i]; } else if ( c==19 ) for (i = 0; i < 16; i++) { spiro[i].x = path0[i].x; spiro[i].y = path0[i].y; spiro[i].ty = path0[i].ty; nextknot[i] = knot0[i]; } else if ( c==20 || c==22) for (i = 0; i < 9; i++) { /* path20[]=closed, path21[]=open, path22[]=closed_with_z */ spiro[i].x = path7[i].x; spiro[i].y = path7[i].y; spiro[i].ty = path7[i].ty; } else if ( c==23 ) for (i = 0; i < 12; i++) { spiro[i].x = path5[i].x; spiro[i].y = path5[i].y; spiro[i].ty = path5[i].ty; } else if ( c==24 ) for (i = 0; i < 16; i++) { spiro[i].x = path0[i].x; spiro[i].y = path0[i].y; spiro[i].ty = path0[i].ty; nextknot[i] = knot0[i]; } } int cl[] = {16, 6, 4, 6, 4, 12, 12, 8, 8, 4, 8, 8, 8, 8, 4, 4, 4, 4, 4, 16, 8, 8, 9, 12, 16}; /* len. */ int ck[] = {16, 6, 4, 6, 4, 12, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 16, 4, 4, 4, 12, 16}; int co[] = {1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1}; /* close=1 */ #ifndef DO_CALL_TESTM /* Provide bare-bones do-nothing functions for testing. This only */ /* printf values that would normally be handled by user programs. */ void test_moveto(bezctx *bc, double x, double y, int is_open) { printf("test_moveto(%g,%g)_%d\n",x,y,is_open); } void test_lineto(bezctx *bc, double x, double y) { printf("test_lineto(%g,%g)\n",x,y); } void test_quadto(bezctx *bc, double x1, double y1, double x2, double y2) { printf("test_quadto(%g,%g, %g,%g)\n",x1,y1,x2,y2); } void test_curveto(bezctx *bc, double x1, double y1, double x2, double y2, double x3, double y3) { printf("test_curveto(%g,%g, %g,%g, %g,%g)\n",x1,y1,x2,y2,x3,y3); } void test_mark_knot(bezctx *bc, int knot_idx) { printf("test_mark_knot()_%d\n",knot_idx); } bezctx *new_bezctx_test(void) { bezctx *result = malloc(1*sizeof(bezctx)); result->moveto = test_moveto; result->lineto = test_lineto; result->quadto = test_quadto; result->curveto = test_curveto; result->mark_knot = test_mark_knot; return result; } int test_curve(int c) { spiro_cp spiro[16]; int nextknot[17]; double d[6]; spiro_seg *segs = NULL; bezctx *bc; rs_check_vals *rsp; int i,j,done; /* Load sample data so that we can see if library is callable */ load_test_curve(spiro,nextknot,c); d[0] = 1.; d[1] = d[2] = 0.; #if defined(DO_CALL_TEST20) /* check if spiro values are reversed correctly on input path */ printf("---\ntesting spiroreverse() using data=path%d[].\n",c); if ( (spiroreverse(spiro,cl[c])) ) { fprintf(stderr,"error with spiroreverse() using data=path%d[].\n",c); return -1; } /* just do a visual check to verify types and points look ok. */ /* NOTE: spiro[] is NOT replaced if unable to reverse values. */ for (i=0; i < cl[c]; i++) { printf(" reversed %d: ty=%c, x=%g, y=%g\n", i,spiro[i].ty,spiro[i].x,spiro[i].y); } #else #if defined(DO_CALL_TEST14) || defined(DO_CALL_TEST15) || defined(DO_CALL_TEST16) || defined(DO_CALL_TEST17) || defined(DO_CALL_TEST18) || defined(DO_CALL_TEST19) #if defined(DO_CALL_TEST16) || defined(DO_CALL_TEST17) || defined(DO_CALL_TEST18) || defined(DO_CALL_TEST19) /* run_spiro0 with various paths to test a simple arc output. */ d[0] = -1.; printf("---\ntesting run_spiro0(q) using data=path%d[].\n",c); if ( (segs=run_spiro0(spiro,d,SPIRO_ARC_MAYBE,cl[c]))==0 ) { fprintf(stderr,"error with run_spiro0(q) using data=path%d[].\n",c); return -1; } #else /* Do run_spiro0 instead (these tests are far from -0.5..+0.5 */ d[0] = -1.; printf("---\ntesting run_spiro0() using data=path%d[].\n",c); if ( (segs=run_spiro0(spiro,d,0,cl[c]))==0 ) { fprintf(stderr,"error with run_spiro0() using data=path%d[].\n",c); return -1; } #endif #else /* Check if run_spiro works okay (try backwards compatiblity) */ printf("---\ntesting run_spiro() using data=path%d[].\n",c); if ( (segs=run_spiro(spiro,cl[c]))==0 ) { fprintf(stderr,"error with run_spiro() using data=path%d[].\n",c); return -1; } #endif /* Load pointer to verification data to ensure it works right */ if ( c==0 ) rsp = verify_rs0; else if ( c==1 ) rsp = verify_rs1; else if ( c==2 ) rsp = verify_rs2; /* else if ( c==3 ) rsp = NULL; expecting failure to converge */ else if ( c==4 ) rsp = verify_rs4; else if ( c==5 ) rsp = verify_rs5; else if ( c==6 ) rsp = verify_rs5; /* same angles used for #6 */ else if ( c==7 ) rsp = verify_rs7; /* stop curve with ah code */ else if ( c==8 ) rsp = verify_rs8; else if ( c==9 ) rsp = verify_rs9; else if ( c==10 ) rsp = verify_rs10; /* start curve using ah. */ else if ( c==11 ) rsp = verify_rs11; else if ( c==12 ) rsp = verify_rs7; /* test #12 uses path7[]. */ else if ( c==13 ) rsp = verify_rs13; /* almost same as path11 */ else if ( c==14 ) rsp = verify_rs14; /* very large path9 copy */ else if ( c==15 ) rsp = verify_rs15; /* sub-atomic path9 copy */ else if ( c==16 ) rsp = verify_rs4; /* path4 arc curve output */ else if ( c==17 ) rsp = verify_rs4; /* path4 arc curve closed */ else if ( c==18 ) rsp = verify_rs2; /* trying many iterations */ else rsp = verify_rs0; /* long list, arc output. */ /* Quick visual check shows X,Y knots match with each pathN[] */ for (i=j=0; i < cl[c]-1; i++,j++) { if ( spiro[i].ty == 'h' ) { --j; printf("curve %d ctrl %d t=%c x=%f y=%f (handle)\n", \ c,j,segs[i].ty,spiro[i].x,spiro[i].y); } printf("curve %d line %d t=%c x=%f y=%f bend=%f ch=%f th=%f ",c,j, \ segs[i].ty,segs[i].x,segs[i].y,segs[i].bend_th,segs[i].seg_ch,segs[i].seg_th); /* Let computer verify that run_spiro() data is PASS/FAIL */ /* Tests including ah data more complicated to verify xy, */ /* therefore, skip testing xy for call_tests shown below. */ if ( (segs[i].ty != spiro[i].ty) || #if defined(DO_CALL_TEST14) || defined(DO_CALL_TEST15) || defined(DO_CALL_TEST16) || defined(DO_CALL_TEST17) || defined(DO_CALL_TEST18) || defined(DO_CALL_TEST19) #if defined(DO_CALL_TEST14) || defined(DO_CALL_TEST16) || defined(DO_CALL_TEST17) || defined(DO_CALL_TEST18) || defined(DO_CALL_TEST19) (fabs((segs[i].x * d[0] + d[1]) - spiro[i].x) > 1e5) || (fabs((segs[i].y * d[0] + d[2]) - spiro[i].y) > 1e5) || (fabs(segs[i].seg_ch * d[0] - rsp[i].ch) > 1e5) || #else (fabs((segs[i].x * d[0] + d[1]) - spiro[i].x) > 1e-47) || (fabs((segs[i].y * d[0] + d[2]) - spiro[i].y) > 1e-47) || (fabs(segs[i].seg_ch * d[0] - rsp[i].ch) > 1e-47) || #endif #else #if !defined(DO_CALL_TEST6) && !defined(DO_CALL_TEST7) && !defined(DO_CALL_TEST8) && !defined(DO_CALL_TEST10) && !defined(DO_CALL_TEST11) && !defined(DO_CALL_TEST12) && !defined(DO_CALL_TEST13) (fabs(segs[i].x - spiro[i].x) > 1e-5) || (fabs(segs[i].y - spiro[i].y) > 1e-5) || #endif (fabs(segs[i].seg_ch - rsp[i].ch) > 1e-5) || #endif (fabs(segs[i].bend_th - rsp[i].b) > 1e-5) || (fabs(segs[i].seg_th - rsp[i].th) > 1e-5) ) { printf("FAIL\n"); fprintf(stderr,"Error found with run_spiro() data. Results are not the same.\n"); fprintf(stderr,"expected line %d t=%c x=%f y=%f bend=%f ch=%f th=%f\n", j, \ spiro[i].ty,spiro[i].x,spiro[i].y,rsp[i].b,rsp[i].ch,rsp[i].th); free(segs); return -2; } else printf("PASS\n"); } printf("curve %d ",c); if ( spiro[i].ty == '}' || spiro[i].ty == 'z' ) printf("stop %d t=%c x=%f y=%f\n",j,segs[i].ty,segs[i].x,segs[i].y); else printf("line %d t=%c x=%f y=%f bend=%f ch=%f th=%f\n", j,segs[i].ty, \ segs[i].x,segs[i].y,segs[i].bend_th,segs[i].seg_ch,segs[i].seg_th); /* Quick visual check shows X,Y knots match with each pathN[] */ printf("---\ntesting spiro_to_bpath() using data from run_spiro(data=path%d[],len=%d).\n",c,cl[c]); bc = new_bezctx_test(); #if defined(DO_CALL_TEST14) || defined(DO_CALL_TEST15) || defined(DO_CALL_TEST16) || defined(DO_CALL_TEST17) || defined(DO_CALL_TEST18) || defined(DO_CALL_TEST19) #if defined(DO_CALL_TEST16) || defined(DO_CALL_TEST17) || defined(DO_CALL_TEST18) || defined(DO_CALL_TEST19) spiro_to_bpath0(spiro,segs,d,SPIRO_ARC_MAYBE,cl[c],bc); #else spiro_to_bpath0(spiro,segs,d,0,cl[c],bc); #endif #else spiro_to_bpath(segs,cl[c],bc); #endif free(segs); #endif #if !defined(DO_CALL_TEST20) #if defined(DO_CALL_TEST14) || defined(DO_CALL_TEST15) || defined(DO_CALL_TEST16) || defined(DO_CALL_TEST17) || defined(DO_CALL_TEST18) || defined(DO_CALL_TEST19) #if defined(DO_CALL_TEST14) || defined(DO_CALL_TEST15) || defined(DO_CALL_TEST16) || defined(DO_CALL_TEST17) /* Now verify we also have simple arc output too */ printf("---\ntesting SpiroCPsToBezier2() using data=path%d[].\n",c); if ( SpiroCPsToBezier2(spiro,cl[c],SPIRO_ARC_MAYBE,co[c],bc)!=1 ) { fprintf(stderr,"error with SpiroCPsToBezier2() using data=path%d[].\n",c); return -7; } #endif #if defined(DO_CALL_TEST18) || defined(DO_CALL_TEST19) printf("---\ntesting TaggedSpiroCPsToBezier2() using data=path%d[].\n",c); if ( TaggedSpiroCPsToBezier2(spiro,SPIRO_ARC_MAYBE,bc)!=1 ) { fprintf(stderr,"error with TaggedSpiroCPsToBezier2() using data=path%d[].\n",c); return -8; } #endif #else #if !defined(DO_CALL_TEST4) && !defined(DO_CALL_TEST6) && !defined(DO_CALL_TEST7) && !defined(DO_CALL_TEST8) && !defined(DO_CALL_TEST9) && !defined(DO_CALL_TEST10) && !defined(DO_CALL_TEST11) /* Check if TaggedSpiroCPsToBezier0() works okay */ printf("---\ntesting TaggedSpiroCPsToBezier0() using data=path%d[].\n",c); if ( TaggedSpiroCPsToBezier0(spiro,bc)!=1 ) { fprintf(stderr,"error with TaggedSpiroCPsToBezier0() using data=path%d[].\n",c); return -3; } #endif #if !defined(DO_CALL_TEST12) /* Check if SpiroCPsToBezier0() works okay */ printf("---\ntesting SpiroCPsToBezier0() using data=path%d[].\n",c); if ( SpiroCPsToBezier0(spiro,cl[c],co[c],bc)!=1 ) { fprintf(stderr,"error with SpiroCPsToBezier0() using data=path%d[].\n",c); return -4; } #endif #if !defined(DO_CALL_TEST4) && !defined(DO_CALL_TEST6) && !defined(DO_CALL_TEST7) && !defined(DO_CALL_TEST8) && !defined(DO_CALL_TEST9) && !defined(DO_CALL_TEST10) && !defined(DO_CALL_TEST11) /* Check if TaggedSpiroCPsToBezier1() works okay */ printf("---\ntesting TaggedSpiroCPsToBezier1() using data=path%d[].\n",c); TaggedSpiroCPsToBezier1(spiro,bc,&done); if ( done!=1 ) { fprintf(stderr,"error with TaggedSpiroCPsToBezier1() using data=path%d[].\n",c); return -5; } #endif #if !defined(DO_CALL_TEST12) /* Check if SpiroCPsToBezier1() works okay */ printf("---\ntesting SpiroCPsToBezier1() using data=path%d[].\n",c); SpiroCPsToBezier1(spiro,cl[c],co[c],bc,&done); if ( done!=1 ) { fprintf(stderr,"error with SpiroCPsToBezier1() using data=path%d[].\n",c); return -6; } #if defined(DO_CALL_TEST13) /* Check if SpiroCPsToBezier2() works okay */ printf("---\ntesting SpiroCPsToBezier2() using data=path%d[].\n",c); if ( SpiroCPsToBezier2(spiro,cl[c],SPIRO_INCLUDE_LAST_KNOT,co[c],bc)!=1 ) { fprintf(stderr,"error with SpiroCPsToBezier2() using data=path%d[].\n",c); return -6; } #endif #else /* Check if SpiroCPsToBezier2() works okay */ printf("---\ntesting SpiroCPsToBezier2() using data=path%d[].\n",c); if ( SpiroCPsToBezier2(spiro,cl[c],SPIRO_INCLUDE_LAST_KNOT,co[c],bc)!=1 ) { fprintf(stderr,"error with SpiroCPsToBezier2() using data=path%d[].\n",c); return -6; } /* Check if TaggedSpiroCPsToBezier2() works okay */ printf("---\ntesting TaggedSpiroCPsToBezier2() using data=path%d[].\n",c); if ( TaggedSpiroCPsToBezier2(spiro,SPIRO_INCLUDE_LAST_KNOT,bc)!=1 ) { fprintf(stderr,"error with TaggedSpiroCPsToBezier2() using data=path%d[].\n",c); return -6; } #endif #endif #else /* We already visually checked output for spiroreverse above. */ /* Some reversed paths (above) will fail (like path20), so we */ /* reverse the reversed spiro path so we can use current test */ /* functions & values (so that this actually tests something) */ bc = new_bezctx_test(); if (c == 20 || c == 21) { /* Check if SpiroCPsToBezier2() works okay */ printf("---\ntesting SpiroCPsToBezier2(reverse) using data=path%d[].\n",c); if ( SpiroCPsToBezier2(spiro,cl[c],SPIRO_REVERSE_SRC,co[c],bc)!=1 ) { fprintf(stderr,"error with SpiroCPsToBezier2(reverse) using data=path%d[].\n",c); return -9; } } else { /* c==22 || c==23 || c==24 */ /* Check if TaggedSpiroCPsToBezier2() works okay */ printf("---\ntesting TaggedSpiroCPsToBezier2(reverse) using data=path%d[].\n",c); if ( TaggedSpiroCPsToBezier2(spiro,SPIRO_REVERSE_SRC,bc)!=1 ) { fprintf(stderr,"error with TaggedSpiroCPsToBezier2(reverse) using data=path%d[].\n",c); return -10; } if (c == 24) { /* reverse it again, ends in v, visually check end points */ printf("---\ntesting TaggedSpiroCPsToBezier2(reverse) using data=path%d[].\n",c); if ( TaggedSpiroCPsToBezier2(spiro,SPIRO_REVERSE_SRC|SPIRO_INCLUDE_LAST_KNOT,bc)!=1 ) { fprintf(stderr,"error with TaggedSpiroCPsToBezier2(reverse) using data=path%d[].\n",c); return -10; } } } #endif free(bc); return 0; } #endif #ifdef DO_CALL_TESTM /************************************************/ /************************************************/ /* multi-threaded, multi-user, multi-curve test */ /* exercise libspiro with multiple curves given */ /* all at the same time and then check that all */ /* returned curves contain the correct values. */ #ifdef HAVE_PTHREADS typedef struct { spiro_cp *spiro; bezctx *bc; int ret; } pthread_pcurve; void *test_a_curve(void *pdata) { pthread_pcurve *data = (pthread_pcurve*)pdata; /*printf("start pthread %d\n",data->ret);*/ data->ret = TaggedSpiroCPsToBezier2(data->spiro,0,data->bc); /*printf("done\n");*/ return 0; } #endif typedef struct { double x1,y1,x2,y2,x3,y3; char ty; } my_curve_data; typedef struct { /* This is a superclass of bezctx (to keep track of each curve). */ bezctx base; my_curve_data *my_curve; int len; int is_open; int c_id; } test_bezctx; #define S_RESULTS 50 void test_s_moveto(bezctx *z, double x, double y, int is_open) { test_bezctx *p = (test_bezctx*)z; int i; if ( (i=p->len) < S_RESULTS ) { #ifdef VERBOSE printf("test_s_moveto(%g,%g)_%d [%d]%d\n",x,y,is_open,p->c_id,i); #endif p->is_open = is_open; p->my_curve[i].x1 = x; p->my_curve[i].y1 = y; p->my_curve[p->len++].ty = 'm'; } } void test_s_lineto(bezctx *z, double x, double y) { test_bezctx *p = (test_bezctx*)z; int i; if ( (i=p->len) < S_RESULTS ) { #ifdef VERBOSE printf("test_s_lineto(%g,%g) [%d]%d\n",x,y,p->c_id,i); #endif p->my_curve[i].x1 = x; p->my_curve[i].y1 = y; p->my_curve[p->len++].ty = 'l'; } } void test_s_quadto(bezctx *z, double x1, double y1, double x2, double y2) { test_bezctx *p = (test_bezctx*)z; int i; if ( (i=p->len) < S_RESULTS ) { #ifdef VERBOSE printf("test_s_quadto(%g,%g, %g,%g) [%d]%d\n",x1,y1,x2,y2,p->c_id,i); #endif p->my_curve[i].x1 = x1; p->my_curve[i].y1 = y1; p->my_curve[i].x2 = x2; p->my_curve[i].y2 = y2; p->my_curve[p->len++].ty = 'q'; } } void test_s_curveto(bezctx *z, double x1, double y1, double x2, double y2, double x3, double y3) { test_bezctx *p = (test_bezctx*)z; int i; if ( (i=p->len) < S_RESULTS ) { #ifdef VERBOSE printf("test_s_curveto(%g,%g, %g,%g, %g,%g) [%d]%d\n",x1,y1,x2,y2,x3,y3,p->c_id,i); #endif p->my_curve[i].x1 = x1; p->my_curve[i].y1 = y1; p->my_curve[i].x2 = x2; p->my_curve[i].y2 = y2; p->my_curve[i].x3 = x3; p->my_curve[i].y3 = y3; p->my_curve[p->len++].ty = 'c'; } } void test_s_mark_knot(bezctx *z, int knot_idx) { test_bezctx *p = (test_bezctx*)z; if ( p->len < S_RESULTS ) #ifdef VERBOSE printf("test_s_mark_knot()_%d [%d]%d\n",knot_idx,p->c_id,p->len); #endif p->my_curve[p->len++].ty = 'k'; } int test_multi_curves(void) { spiro_cp **spiro = NULL; spiro_cp *temp; int *pk, **nextknot = NULL; int *scl = NULL; test_bezctx **bc; int i, j, k, l, ret; double x, y; char ty; /* our simple curve test-check breaks-down if we go more than */ /* 10x larger curves due to rounding errors on double values, */ /* so, we either need a more complex curve test-check at end, */ /* or we can cleverly increase in increments of "1/S_TESTS". */ #define S_TESTS S_TESTP*5 #ifdef HAVE_PTHREADS pthread_attr_t tattr; pthread_t curve_test[S_TESTS]; pthread_pcurve pdata[S_TESTS]; printf("---\nMulti-thread testing of libspiro.\n"); #else printf("---\nSequential tests of libspiro.\n"); #endif ret = -1; /* return error if out of memory */ /* Expect lots of results, therefore create available memory. */ /* This way, we won't be wasting time doing malloc because we */ /* really want to shoot a whole bunch of pthreads all at once.*/ if ( (bc=(test_bezctx**)calloc(S_TESTS,sizeof(test_bezctx*)))==NULL ) goto test_multi_curves_exit; for (i=0; i < S_TESTS; i++) { if ( (bc[i]=(test_bezctx*)malloc(sizeof(test_bezctx)))==NULL ) goto test_multi_curves_exit; bc[i]->base.moveto = test_s_moveto; bc[i]->base.lineto = test_s_lineto; bc[i]->base.quadto = test_s_quadto; bc[i]->base.curveto = test_s_curveto; bc[i]->base.mark_knot = test_s_mark_knot; if ( (bc[i]->my_curve=(my_curve_data*)calloc(S_RESULTS,sizeof(my_curve_data)))==NULL ) goto test_multi_curves_exit; bc[i]->len = 0; /* no curve yet, len=0 */ bc[i]->is_open = 0; bc[i]->c_id = i; /* identify each curve */ } if ( (scl=(int*)malloc(S_TESTS*sizeof(int)))==NULL || \ (spiro=(spiro_cp**)calloc(S_TESTS,sizeof(spiro_cp*)))==NULL || \ (nextknot=(int**)calloc(S_TESTS,sizeof(int*)))==NULL ) goto test_multi_curves_exit; for (i=0; i < S_TESTS; ) { /* NOTE: S_TESTS has to be multiple of 5 here. */ /* because we test with path[0/1/2/5/6]tables, */ /* ...and path[3] is used to test NOT success, */ /* ...and path[4] is too fast @ 4 interations, */ /* ...and path[7/8] ah complicates node check. */ if ( (spiro[i]=malloc(cl[0]*sizeof(spiro_cp)))==NULL || \ (nextknot[i]=calloc(cl[0],sizeof(int)))==NULL ) goto test_multi_curves_exit; load_test_curve(spiro[i],nextknot[i],0); scl[i++]=cl[0]; if ( (spiro[i]=malloc(cl[1]*sizeof(spiro_cp)))==NULL || \ (nextknot[i]=calloc(cl[1],sizeof(int)))==NULL ) goto test_multi_curves_exit; load_test_curve(spiro[i],nextknot[i],1); scl[i++]=cl[1]; if ( (spiro[i]=malloc(cl[2]*sizeof(spiro_cp)))==NULL || \ (nextknot[i]=calloc(cl[2],sizeof(int)))==NULL ) goto test_multi_curves_exit; load_test_curve(spiro[i],nextknot[i],2); scl[i++]=cl[2]; if ( (spiro[i]=malloc(cl[5]*sizeof(spiro_cp)))==NULL || \ (nextknot[i]=calloc(cl[5],sizeof(int)))==NULL ) goto test_multi_curves_exit; load_test_curve(spiro[i],nextknot[i],5); scl[i++]=cl[5]; if ( (spiro[i]=malloc(cl[6]*sizeof(spiro_cp)))==NULL || \ (nextknot[i]=calloc(cl[6],sizeof(int)))==NULL ) goto test_multi_curves_exit; load_test_curve(spiro[i],nextknot[i],6); scl[i++]=cl[6]; } /* Change to different sizes to make sure no duplicates */ /* ...to verify we do not overwrite different user data */ /* while running multiple threads all at the same time. */ for (i=0; i < S_TESTS; i++) { temp = spiro[i]; for (j=0; j < scl[i]; j++) { if ( i&1 ) { temp[j].x = temp[j].x * (i/S_TESTS+1) + i; temp[j].y = temp[j].y * (i/S_TESTS+1) + i; } else { /* Scaling bug fixed. Scale & shift at will */ temp[j].x *= (i+1); temp[j].x += i*1000. - 5000.; temp[j].y *= (i+1); temp[j].y += i*3000. - 9000.; } } } --ret; #ifdef HAVE_PTHREADS /* Data and memory prepared before Pthreads. Ready? Set? GO! */ /* Test all curves, all at same time, wait for all to finish. */ /* This test could fail if we had globally set variables that */ /* could affect other functions, eg: static n=4 was moved out */ /* into passed variable so that one user won't affect others. */ /* GEGL is a good example of multiple users all at same time. */ for (i=0; i < S_TESTS; i++) { pdata[i].spiro = spiro[i]; pdata[i].bc = (bezctx*)(bc[i]); pdata[i].ret = i; } j=0; for (k=0; k < S_TESTS;) { /* Initialize and set thread joinable attribute */ pthread_attr_init(&tattr); pthread_attr_setdetachstate(&tattr,PTHREAD_CREATE_JOINABLE); /* Some processors can't do too many pthreads at once so then */ /* we need to run threads in batches until completing S_TESTS */ for (i=k; i < S_TESTS-1; i++) { /* all values passed are joined at "->" (should be okay). */ if ( pthread_create(&curve_test[i],&tattr,test_a_curve,(void *)&pdata[i]) ) { if ( i-k < 20 ) { printf("bad pthread_create[%d]\n",i); /* not many */ j=-1; } break; } } pthread_attr_destroy(&tattr); /* Free thread attribute */ if ( j!=-1 ) { /* Test another curve while waiting for threads to finish */ pdata[i].ret = TaggedSpiroCPsToBezier2(pdata[i].spiro,0,pdata[i].bc); printf("running simultaneous threads[%d..%d]\n",k,i); } l=i; while (--i >= k) if ( pthread_join(curve_test[i],NULL) ) { fprintf(stderr,"bad pthread_join[%d]\n",i); j=-1; } k=++l; if (j) goto test_multi_curves_exit; } for (i=0; i < S_TESTS; i++) if ( pdata[i].ret!=1 ) { ret=ret-i; fprintf(stderr,"error %d with TaggedSpiroCPsToBezier2() using data=%d.\n",ret,i); goto test_multi_curves_exit; } /* All threads returned okay, Now, go check all data is good. */ #else /* No pthreads.h, test all curves sequentially, one at a time */ /* Just do a math check and leave the pthread check for other */ /* operating systems to verify libspiro has no static values. */ for (i=0; i < S_TESTS; i++) { if ( TaggedSpiroCPsToBezier0(spiro[i],(bezctx*)(bc[i]))!=1 ) { ret=ret-i; fprintf(stderr,"error %d with TaggedSpiroCPsToBezier0() using data=%d.\n",ret,i); goto test_multi_curves_exit; } } #endif ret=ret-S_TESTS; /* Check ending x,y points versus input spiro knot locations. */ for (i=0; i < S_TESTS; i++) { temp = spiro[i]; pk = nextknot[i]; k=0; #ifdef VERBOSE printf("test[%d], input spiro[0..%d], output bc->my_curve[0..%d]\n", \ i, scl[i]-1, bc[i]->len-1); #endif for (j=l=0; j < scl[i] && temp[j].ty!='z'; j++,l++) { if (temp[j].ty=='h') { #ifdef VERBOSE printf(" s[%d][ty=%c x=%g y=%g] is handle 'h' to anchor 'a'.\n", \ l-1,temp[j].ty,temp[j].x,temp[j].y); #endif --l; } else { ty = bc[i]->my_curve[k].ty; x = bc[i]->my_curve[k].x1; y = bc[i]->my_curve[k].y1; if ( ty=='q' ) { x = bc[i]->my_curve[k].x2; y = bc[i]->my_curve[k].y2; } if ( ty=='c' ) { x = bc[i]->my_curve[k].x3; y = bc[i]->my_curve[k].y3; } #ifdef VERBOSE printf(" s[%d][ty=%c x=%g y=%g], pk=%d mc[%d][x=%g y=%g]\n", \ l,temp[j].ty,temp[j].x,temp[j].y,pk[j],k,x,y); #endif if ( (fabs(temp[j].x - x) > 1e-5) || (fabs(temp[j].y - y) > 1e-5) ) { /* close-enough for testing 1..10000 value ranges */ if ( j == scl[i]-2 && temp[j+1].ty=='z' ) ; /* Exception: skip test of this code point. */ /* x and/or y are not valid for 'this' check, */ /* If ending in 'z', then prior code point is */ /* changed to a curve end point, which is '}' */ else { ret=ret-i; fprintf(stderr,"error %d with test_multi_curves() using data %d\n",ret,i); goto test_multi_curves_exit; } } k += pk[l]+1; } } } #ifdef HAVE_PTHREADS printf("Multi-thread testing of libspiro passed.\n"); #else printf("Sequential tests of libspiro passed.\n"); #endif ret = 0; test_multi_curves_exit: if ( nextknot!=NULL ) for (i=0; i < S_TESTS; i++) free(nextknot[i]); if ( spiro!=NULL ) for (i=0; i < S_TESTS; i++) free(spiro[i]); free(nextknot); free(spiro); free(scl); if ( bc!=NULL ) for (i=0; i < S_TESTS; i++) { free(bc[i]->my_curve); free(bc[i]); } free(bc); return ret; } #endif int main(int argc, char **argv) { double st, en; int ret; st = get_time(); #ifdef DO_CALL_TEST0 ret=test_curve(0); /* this comes with unit-test. */ #endif #ifdef DO_CALL_TEST1 ret=test_curve(1); /* do a test using "{"..."}". */ #endif #ifdef DO_CALL_TEST2 ret=test_curve(2); /* this does many iterations. */ #endif #ifdef DO_CALL_TEST3 if ( (ret=test_curve(3)==0) ) /* This curve will not converge */ ret = -1 /* error found! ret=error value */; else ret = 0; /* expected failure to converge */ #endif #ifdef DO_CALL_TEST4 ret=test_curve(4); /* test a cyclic calculation. */ #endif #ifdef DO_CALL_TEST5 ret=test_curve(5); /* verify curve data with []. */ #endif #ifdef DO_CALL_TEST6 ret=test_curve(6); /* verify curve data with ah. */ #endif #ifdef DO_CALL_TEST7 ret=test_curve(7); /* loop stops with ah curves. */ #endif #ifdef DO_CALL_TEST8 ret=test_curve(8); /* this open curve ends in ah */ #endif #ifdef DO_CALL_TEST9 ret=test_curve(9); /* path4[] as a closed curve. */ #endif #ifdef DO_CALL_TEST10 ret=test_curve(10); /* start loop with ah curves. */ #endif #ifdef DO_CALL_TEST11 ret=test_curve(11); /* start open curve using []. */ #endif #ifdef DO_CALL_TEST12 ret=test_curve(12); /* do path7[] with a z ending */ #endif #ifdef DO_CALL_TEST13 ret=test_curve(13); /* start open curve using {h. */ #endif #ifdef DO_CALL_TEST14 ret=test_curve(14); /* go very big! go very tiny! */ #endif #ifdef DO_CALL_TEST15 ret=test_curve(15); /* go very big! go very tiny! */ #endif #ifdef DO_CALL_TEST16 ret=test_curve(16); /* testing arc output path4[] */ #endif #ifdef DO_CALL_TEST17 ret=test_curve(17); /* do arc closed curve output */ #endif #ifdef DO_CALL_TEST18 ret=test_curve(18); /* do iterative as arc output */ #endif #ifdef DO_CALL_TEST19 ret=test_curve(19); /* do lengthy output with arc */ #endif #ifdef DO_CALL_TEST20 /* test spiroreverse and verify path[] directions */ if ( (ret=test_curve(20))==0 ) if ( (ret=test_curve(21))==0 ) if ( (ret=test_curve(22))==0 ) if ( (ret=test_curve(23))==0 ) ret=test_curve(24); #endif #ifdef DO_CALL_TESTM ret=test_multi_curves(); #endif en = get_time(); printf("time %g\n", (en - st)); return ret; } libspiro-20221101/tests/call-test0.c000066400000000000000000000000571433036472700170600ustar00rootroot00000000000000#define DO_CALL_TEST0 1 #include "call-test.c" libspiro-20221101/tests/call-test1.c000066400000000000000000000000571433036472700170610ustar00rootroot00000000000000#define DO_CALL_TEST1 1 #include "call-test.c" libspiro-20221101/tests/call-test10.c000066400000000000000000000000561433036472700171400ustar00rootroot00000000000000#define DO_CALL_TEST10 #include "call-test.c" libspiro-20221101/tests/call-test11.c000066400000000000000000000000561433036472700171410ustar00rootroot00000000000000#define DO_CALL_TEST11 #include "call-test.c" libspiro-20221101/tests/call-test12.c000066400000000000000000000000601433036472700171350ustar00rootroot00000000000000#define DO_CALL_TEST12 1 #include "call-test.c" libspiro-20221101/tests/call-test13.c000066400000000000000000000000601433036472700171360ustar00rootroot00000000000000#define DO_CALL_TEST13 1 #include "call-test.c" libspiro-20221101/tests/call-test14.c000066400000000000000000000000601433036472700171370ustar00rootroot00000000000000#define DO_CALL_TEST14 1 #include "call-test.c" libspiro-20221101/tests/call-test15.c000066400000000000000000000000601433036472700171400ustar00rootroot00000000000000#define DO_CALL_TEST15 1 #include "call-test.c" libspiro-20221101/tests/call-test16.c000066400000000000000000000000601433036472700171410ustar00rootroot00000000000000#define DO_CALL_TEST16 1 #include "call-test.c" libspiro-20221101/tests/call-test17.c000066400000000000000000000000601433036472700171420ustar00rootroot00000000000000#define DO_CALL_TEST17 1 #include "call-test.c" libspiro-20221101/tests/call-test18.c000066400000000000000000000000601433036472700171430ustar00rootroot00000000000000#define DO_CALL_TEST18 1 #include "call-test.c" libspiro-20221101/tests/call-test19.c000066400000000000000000000000601433036472700171440ustar00rootroot00000000000000#define DO_CALL_TEST19 1 #include "call-test.c" libspiro-20221101/tests/call-test2.c000066400000000000000000000000571433036472700170620ustar00rootroot00000000000000#define DO_CALL_TEST2 1 #include "call-test.c" libspiro-20221101/tests/call-test20.c000066400000000000000000000000601433036472700171340ustar00rootroot00000000000000#define DO_CALL_TEST20 1 #include "call-test.c" libspiro-20221101/tests/call-test21.c000066400000000000000000000266401433036472700171510ustar00rootroot00000000000000/* call-test21.c, 2022jul22, libspiro-20220722 This test is an example for SPIRO_INTERNAL_BEZCTX & functions */ #include #include #include #include #include "spiroentrypoints.h" /* call spiro through here */ #include "bezctx.h" /* bezctx structure */ static void load_test_curve(spiro_cp *spiro, int c) { /* load a test curve (and nextknot locations) into memory. */ spiro_cp path0[] = { /* this data came with unit-test. */ {334, 117, 'v'}, {305, 176, 'v'}, {212, 142, 'c'}, {159, 171, 'c'}, {224, 237, 'c'}, {347, 335, 'c'}, {202, 467, 'c'}, { 81, 429, 'v'}, {114, 368, 'v'}, {201, 402, 'c'}, {276, 369, 'c'}, {218, 308, 'c'}, { 91, 211, 'c'}, {124, 111, 'c'}, {229, 82, 'c'}, {0, 0, 'z'} }; spiro_cp path6[] = { /* verify curve data with ah. */ { 0, 0, '{'}, {100, 100, 'c'}, {200, 200, 'a'}, {300, 200, 'h'}, {300, 150, 'c'}, {200, 100, 'a'}, {100, 100, 'h'}, {150, 50, 'c'}, {100, 0, 'a'}, { 0,-100, 'h'}, { 50,-100, 'c'}, { 20,-150, '}'} }; int i; if (c == 0) for (i = 0; i < 16; i++) { spiro[i].x = path0[i].x; spiro[i].y = path0[i].y; spiro[i].ty = path0[i].ty; } if (c == 1) { for (i = 0; i < 12; i++) { spiro[i].x = path6[i].x; spiro[i].y = path6[i].y; spiro[i].ty = path6[i].ty; } for (i = 12; i < 16; i++) { spiro[i].x = spiro[i].y = 0.0; spiro[i].ty = 0; } } } static int verify_results(ls_bezctx *bc, int c) { /* These are the expected cubic curve results */ curve_data expect0[] = { {'m', 0, 0, 334, 117, 0, 0, 0, 0}, {'k', 334, 117, 0, 0, 0, 0, 0, 0}, {'l', 334, 117, 305, 176, 0, 0, 0, 0}, {'k', 305, 176, 0, 0, 0, 0, 0, 0}, {'c', 305, 176, 279.449, 153.974, 245.733, 141.648, 212, 142}, {'k', 212, 142, 0, 0, 0, 0, 0, 0}, {'c', 212, 142, 201.226, 142.112, 190.267, 143.529, 180.511, 148.103}, {'c', 180.511, 148.103, 175.633, 150.39, 171.099, 153.461, 167.348, 157.327}, {'c', 167.348, 157.327, 163.596, 161.194, 160.641, 165.869, 159, 171}, {'k', 159, 171, 0, 0, 0, 0, 0, 0}, {'c', 159, 171, 156.364, 179.243, 157.251, 188.403, 160.654, 196.36}, {'c', 160.654, 196.36, 164.057, 204.316, 169.853, 211.112, 176.664, 216.45}, {'c', 176.664, 216.45, 190.287, 227.126, 207.444, 231.953, 224, 237}, {'k', 224, 237, 0, 0, 0, 0, 0, 0}, {'c', 224, 237, 250.322, 245.025, 276.649, 254.369, 299.324, 269.96}, {'c', 299.324, 269.96, 321.998, 285.551, 340.921, 308.162, 347, 335}, {'k', 347, 335, 0, 0, 0, 0, 0, 0}, {'c', 347, 335, 351.166, 353.392, 349.066, 373.009, 341.95, 390.473}, {'c', 341.95, 390.473, 334.833, 407.936, 322.824, 423.251, 308.134, 435.075}, {'c', 308.134, 435.075, 278.752, 458.724, 239.706, 467.893, 202, 467}, {'k', 202, 467, 0, 0, 0, 0, 0, 0}, {'c', 202, 467, 159.176, 465.986, 116.715, 452.651, 81, 429}, {'k', 81, 429, 0, 0, 0, 0, 0, 0}, {'l', 81, 429, 114, 368, 0, 0, 0, 0}, {'k', 114, 368, 0, 0, 0, 0, 0, 0}, {'c', 114, 368, 140.251, 385.152, 170.075, 396.808, 201, 402}, {'k', 201, 402, 0, 0, 0, 0, 0, 0}, {'c', 201, 402, 216.006, 404.519, 231.742, 405.476, 246.158, 400.607}, {'c', 246.158, 400.607, 253.366, 398.172, 260.137, 394.269, 265.488, 388.861}, {'c', 265.488, 388.861, 270.839, 383.452, 274.72, 376.5, 276, 369}, {'k', 276, 369, 0, 0, 0, 0, 0, 0}, {'c', 276, 369, 277.287, 361.46, 275.914, 353.582, 272.701, 346.641}, {'c', 272.701, 346.641, 269.488, 339.699, 264.498, 333.665, 258.672, 328.709}, {'c', 258.672, 328.709, 247.02, 318.796, 232.367, 313.255, 218, 308}, {'k', 218, 308, 0, 0, 0, 0, 0, 0}, {'c', 218, 308, 191.978, 298.481, 165.57, 289.162, 142.279, 274.152}, {'c', 142.279, 274.152, 118.988, 259.143, 98.7273, 237.609, 91, 211}, {'k', 91, 211, 0, 0, 0, 0, 0, 0}, {'c', 91, 211, 85.821, 193.166, 86.5807, 173.749, 92.5866, 156.176}, {'c', 92.5866, 156.176, 98.5925, 138.603, 109.749, 122.908, 124, 111}, {'k', 124, 111, 0, 0, 0, 0, 0, 0}, {'c', 124, 111, 138.28, 99.0677, 155.539, 90.9339, 173.578, 86.3634}, {'c', 173.578, 86.3634, 191.617, 81.7928, 210.435, 80.7131, 229, 82}, {'k', 229, 82, 0, 0, 0, 0, 0, 0}, {'c', 229, 82, 266.199, 84.5786, 302.694, 96.7435, 334, 117} }; /* These are the expected quadratic curve results */ curve_data expect6[] = { {'m', 0, 0, 0, 0, 0, 0, 0, 0}, {'k', 0, 0, 0, 0, 0, 0, 0, 0}, {'q', 0, 0, 23.3715, 7.35678, 62.2475, 37.7525, 0, 0}, {'q', 62.2475, 37.7525, 92.6432, 76.6285, 100, 100, 0, 0}, {'k', 100, 100, 0, 0, 0, 0, 0, 0}, {'q', 100, 100, 101.992, 106.327, 105.137, 119.22, 0, 0}, {'q', 105.137, 119.22, 108.262, 132.117, 110.182, 138.466, 0, 0}, {'q', 110.182, 138.466, 112.101, 144.815, 117.302, 157.024, 0, 0}, {'q', 117.302, 157.024, 123.765, 168.643, 128.019, 173.733, 0, 0}, {'q', 128.019, 173.733, 132.272, 178.822, 142.741, 187.019, 0, 0}, {'q', 142.741, 187.019, 154.306, 193.575, 160.624, 195.595, 0, 0}, {'q', 160.624, 195.595, 166.942, 197.614, 180.118, 199.382, 0, 0}, {'q', 180.118, 199.382, 193.367, 200, 200, 200, 0, 0}, {'k', 200, 200, 0, 0, 0, 0, 0, 0}, {'q', 200, 200, 210.377, 200, 231.117, 199.326, 0, 0}, {'q', 231.117, 199.326, 251.834, 197.146, 261.683, 193.879, 0, 0}, {'q', 261.683, 193.879, 266.607, 192.246, 275.86, 187.525, 0, 0}, {'q', 275.86, 187.525, 284.483, 181.698, 288.06, 177.939, 0, 0}, {'q', 288.06, 177.939, 291.636, 174.181, 296.725, 165.102, 0, 0}, {'q', 296.725, 165.102, 300, 155.188, 300, 150, 0, 0}, {'k', 300, 150, 0, 0, 0, 0, 0, 0}, {'q', 300, 150, 300, 144.812, 296.725, 134.898, 0, 0}, {'q', 296.725, 134.898, 291.636, 125.819, 288.06, 122.061, 0, 0}, {'q', 288.06, 122.061, 284.483, 118.302, 275.86, 112.475, 0, 0}, {'q', 275.86, 112.475, 266.607, 107.754, 261.683, 106.121, 0, 0}, {'q', 261.683, 106.121, 251.834, 102.854, 231.117, 100.674, 0, 0}, {'q', 231.117, 100.674, 210.377, 100, 200, 100, 0, 0}, {'k', 200, 100, 0, 0, 0, 0, 0, 0}, {'q', 200, 100, 196.719, 100, 190.166, 99.6669, 0, 0}, {'q', 190.166, 99.6669, 183.656, 98.7176, 180.555, 97.6447, 0, 0}, {'q', 180.555, 97.6447, 177.454, 96.5719, 171.848, 93.1288, 0, 0}, {'q', 171.848, 93.1288, 166.838, 88.8674, 164.84, 86.2641, 0, 0}, {'q', 164.84, 86.2641, 162.843, 83.6608, 159.844, 77.8069, 0, 0}, {'q', 159.844, 77.8069, 157.408, 71.7127, 156.434, 68.579, 0, 0}, {'q', 156.434, 68.579, 155.461, 65.4454, 153.593, 59.1539, 0, 0}, {'q', 153.593, 59.1539, 151.474, 52.9318, 150, 50, 0, 0}, {'k', 150, 50, 0, 0, 0, 0, 0, 0}, {'q', 150, 50, 147.34, 44.7095, 139.446, 35.7988, 0, 0}, {'q', 139.446, 35.7988, 130.781, 27.7291, 126.249, 23.9179, 0, 0}, {'q', 126.249, 23.9179, 121.717, 20.1067, 112.792, 12.3232, 0, 0}, {'q', 112.792, 12.3232, 104.187, 4.18708, 100, 0, 0, 0}, {'k', 100, 0, 0, 0, 0, 0, 0, 0}, {'q', 100, 0, 93.2929, -6.70709, 80.9277, -21.0842, 0, 0}, {'q', 80.9277, -21.0842, 70.4319, -36.9236, 66.6872, -45.6384, 0, 0}, {'q', 66.6872, -45.6384, 62.9425, -54.3532, 57.7639, -72.6315, 0, 0}, {'q', 57.7639, -72.6315, 53.1047, -91.0372, 50, -100, 0, 0}, {'k', 50, -100, 0, 0, 0, 0, 0, 0}, {'q', 50, -100, 46.7962, -109.249, 37.5962, -126.558, 0, 0}, {'q', 37.5962, -126.558, 26.653, -142.821, 20, -150, 0, 0} }; int i,j,k,ret; ret = 1; if ( c == 0 && bc->l == 45 ) { printf("test: verify results[0..%d] vs expected values[0..44]\n",bc->l - 1); ret = 0; for (i=0; i < bc->l && ret == 0; i++) { if ( bc->cd[i].ty != expect0[i].ty ) ret = 1; /* not integers! test approximate equivalents. */ if ( fabs(bc->cd[i].x0 - expect0[i].x0) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].y0 - expect0[i].y0) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].x1 - expect0[i].x1) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].y1 - expect0[i].y1) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].x2 - expect0[i].x2) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].y2 - expect0[i].y2) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].x3 - expect0[i].x3) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].y3 - expect0[i].y3) > 0.0005 ) ret = 1; } } if ( c == 1 && bc->l == 49 ) { printf("test: verify results[0..%d] vs expected values[0..48]\n",bc->l - 1); ret = 0; for (i=0; i < bc->l && ret == 0; i++) { if ( bc->cd[i].ty != expect6[i].ty ) ret = 1; /* not integers! test approximate equivalents. */ if ( fabs(bc->cd[i].x0 - expect6[i].x0) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].y0 - expect6[i].y0) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].x1 - expect6[i].x1) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].y1 - expect6[i].y1) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].x2 - expect6[i].x2) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].y2 - expect6[i].y2) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].x3 - expect6[i].x3) > 0.0005 ) ret = 1; if ( fabs(bc->cd[i].y3 - expect6[i].y3) > 0.0005 ) ret = 1; } } return ret; } static int show_results(ls_bezctx *bc) { int i,ret; ret = 0; for (i=0; i < bc->l || ret; i++) { printf("%d: (t=%c x0=%g y0=%g",i,bc->cd[i].ty,bc->cd[i].x0,bc->cd[i].y0); switch (bc->cd[i].ty) { case 'k': printf(")\n"); break; case 'l': case 'm': printf(" x1=%g y1=%g)\n",bc->cd[i].x1,bc->cd[i].y1); break; case 'q': printf(" x1=%g y1=%g x2=%g y2=%g)\n", \ bc->cd[i].x1,bc->cd[i].y1,bc->cd[i].x2,bc->cd[i].y2); break; case 'c': printf(" x1=%g y1=%g x2=%g y2=%g x3=%g y3=%g)\n", \ bc->cd[i].x1,bc->cd[i].y1,bc->cd[i].x2,bc->cd[i].y2, \ bc->cd[i].x3,bc->cd[i].y3); break; default: printf(" -> error with type!!\n"); ret = -1; } } return ret; } int main(int argc, char **argv) { spiro_cp spiro[16]; ls_bezctx *bc; int i,ncq,max,ret; load_test_curve(spiro, 0); ncq = SPIRO_CUBIC_TO_BEZIER|SPIRO_INTERNAL_BEZCTX; max = 16 * 10; /* Oversize approximate 10x spiro size. */ bc = new_ls_bezctx(max, ncq); if ( bc == NULL ) { printf("error: new_ls_bezctx().\n"); return -1; } printf("make: cubic curve using test0 spiro array\n"); ret = TaggedSpiroCPsToBezier2(spiro,ncq,(bezctx *)(bc)); if ( ret==0 ) { printf("error: TaggedSpiroCPsToBezier2() failed to build cubic curve.\n"); free_ls_bezctx(bc); return -2; } printf("show: resulting cubic curve using test0 spiro array\n"); ret = show_results(bc); if ( ret ) { printf("error: show_results() had wrong curve type.\n"); free_ls_bezctx(bc); return -3; } ret = verify_results(bc, 0); if ( ret ) { printf("error: verify_results() did not match with expected values.\n"); free_ls_bezctx(bc); return -4; } /* Resize/release/keep old array, or start a new array * curve_data *tmp = (curve_data *)realloc(bc->cd,(bc->l)*sizeof(curve_data)); * free_ls_bezctx(bc); // old array * bc = new_ls_bezctx(max, ncq); // fresh new array /* Reuse the result array again for quadratics instead */ load_test_curve(spiro, 1); ncq = SPIRO_QUAD0_TO_BEZIER|SPIRO_INTERNAL_BEZCTX; bc->l = 0; /* reset starting length as 0 */ printf("make: quadratic curve using test0 spiro array\n"); ret = TaggedSpiroCPsToBezier2(spiro,ncq,(bezctx *)(bc)); if ( ret==0 ) { printf("error: TaggedSpiroCPsToBezier2() failed to build quadratic curve.\n"); free_ls_bezctx(bc); return -5; } printf("show: resulting quadratic curve using test0 spiro array\n"); ret = show_results(bc); if ( ret ) { printf("error: show_results() had wrong curve type.\n"); free_ls_bezctx(bc); return -6; } ret = verify_results(bc, 1); if ( ret ) { printf("error: verify_results() did not match with expected values.\n"); free_ls_bezctx(bc); return -7; } printf("pass: results matches expected values\n"); free_ls_bezctx(bc); printf("done.\n"); return 0; } libspiro-20221101/tests/call-test3.c000066400000000000000000000000571433036472700170630ustar00rootroot00000000000000#define DO_CALL_TEST3 1 #include "call-test.c" libspiro-20221101/tests/call-test4.c000066400000000000000000000000571433036472700170640ustar00rootroot00000000000000#define DO_CALL_TEST4 1 #include "call-test.c" libspiro-20221101/tests/call-test5.c000066400000000000000000000000571433036472700170650ustar00rootroot00000000000000#define DO_CALL_TEST5 1 #include "call-test.c" libspiro-20221101/tests/call-test6.c000066400000000000000000000000571433036472700170660ustar00rootroot00000000000000#define DO_CALL_TEST6 1 #include "call-test.c" libspiro-20221101/tests/call-test7.c000066400000000000000000000000571433036472700170670ustar00rootroot00000000000000#define DO_CALL_TEST7 1 #include "call-test.c" libspiro-20221101/tests/call-test8.c000066400000000000000000000000571433036472700170700ustar00rootroot00000000000000#define DO_CALL_TEST8 1 #include "call-test.c" libspiro-20221101/tests/call-test9.c000066400000000000000000000000571433036472700170710ustar00rootroot00000000000000#define DO_CALL_TEST9 1 #include "call-test.c" libspiro-20221101/tests/call-testm.c000066400000000000000000000000571433036472700171550ustar00rootroot00000000000000#define DO_CALL_TESTM 1 #include "call-test.c" libspiro-20221101/tests/unit-test.c000066400000000000000000000123431433036472700170450ustar00rootroot00000000000000/* Unit test for testing spiro.c internal routines Copyright (C) 2007 Raph Levien (original code was from spiro.c) Copyright (C) 2013 Jose Da Silva (moved from spiro.c, plus edits) 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include "spiro-config.h" /* for ./configure test settings like VERBOSE */ #ifdef DO_TIME_DAY #include /* for gettimeofday */ #else #include /* for old get_time */ #endif #include "bezctx.c" #include "spiro.c" int n; /* = 4; */ static double get_time (void) { #ifdef DO_TIME_DAY struct timeval tv; gettimeofday(&tv, NULL); return tv.tv_sec + 1e-6 * tv.tv_usec; #else struct timeb tb; ftime(&tb); return tb.time + 1e-3 * tb.millitm; #endif } int test_integ(void) { double ks[] = {1, 2, 3, 4}; double xy[2]; double xynom[2]; int i, j; int nsubdiv; n = ORDER < 6 ? 4096 : 1024; integrate_spiro(ks, xynom, n); nsubdiv = ORDER < 12 ? 8 : 7; for (i = 0; i < nsubdiv; i++) { double ch, th; double st, en, err; int n_iter = (1 << (20 - i)); n = 1 << i; st = get_time(); for (j = 0; j < n_iter; j++) integrate_spiro(ks, xy, n); en = get_time(); err = hypot(xy[0] - xynom[0], xy[1] - xynom[1]); printf("%d %d %g %g\n", ORDER, n, (en - st) / n_iter, err); ch = hypot(xy[0], xy[1]); th = atan2(xy[1], xy[0]); printf("n = %d: integ(%g %g %g %g) = %g %g, ch = %g, th = %g\n", n, ks[0], ks[1], ks[2], ks[3], xy[0], xy[1], ch, th); printf("%d: %g %g\n", n, xy[0] - xynom[0], xy[1] - xynom[1]); } return 0; } void print_seg(const double ks[4], double x0, double y0, double x1, double y1) { double bend = fabs(ks[0]) + fabs(.5 * ks[1]) + fabs(.125 * ks[2]) + fabs((1./48) * ks[3]); if (bend < 1e-8) { printf("%g %g lineto\n", x1, y1) ; } else { double seg_ch = hypot(x1 - x0, y1 - y0); double seg_th = atan2(y1 - y0, x1 - x0); double xy[2]; double ch, th; double scale, rot; double th_even, th_odd; double ul, vl, ur, vr; integrate_spiro(ks, xy, n); ch = hypot(xy[0], xy[1]); th = atan2(xy[1], xy[0]); scale = seg_ch / ch; rot = seg_th - th; if (bend < 1.) { th_even = (1./384) * ks[3] + (1./8) * ks[1] + rot; th_odd = (1./48) * ks[2] + .5 * ks[0]; ul = (scale * (1./3)) * cos(th_even - th_odd); vl = (scale * (1./3)) * sin(th_even - th_odd); ur = (scale * (1./3)) * cos(th_even + th_odd); vr = (scale * (1./3)) * sin(th_even + th_odd); printf("%g %g %g %g %g %g curveto\n", x0 + ul, y0 + vl, x1 - ur, y1 - vr, x1, y1); } else { /* subdivide */ double ksub[4]; double thsub; double xysub[2]; double xmid, ymid; double cth, sth; ksub[0] = .5 * ks[0] - .125 * ks[1] + (1./64) * ks[2] - (1./768) * ks[3]; ksub[1] = .25 * ks[1] - (1./16) * ks[2] + (1./128) * ks[3]; ksub[2] = .125 * ks[2] - (1./32) * ks[3]; ksub[3] = (1./16) * ks[3]; thsub = rot - .25 * ks[0] + (1./32) * ks[1] - (1./384) * ks[2] + (1./6144) * ks[3]; cth = .5 * scale * cos(thsub); sth = .5 * scale * sin(thsub); integrate_spiro(ksub, xysub, n); xmid = x0 + cth * xysub[0] - sth * xysub[1]; ymid = y0 + cth * xysub[1] + sth * xysub[0]; print_seg(ksub, x0, y0, xmid, ymid); ksub[0] += .25 * ks[1] + (1./384) * ks[3]; ksub[1] += .125 * ks[2]; ksub[2] += (1./16) * ks[3]; print_seg(ksub, xmid, ymid, x1, y1); } } } void print_segs(const spiro_seg *segs, int nsegs) { int i; for (i = 0; i < nsegs; i++) { double x0 = segs[i].x; double y0 = segs[i].y; double x1 = segs[i + 1].x; double y1 = segs[i + 1].y; if (i == 0) printf("%g %g moveto\n", x0, y0); printf("%% ks = [ %g %g %g %g ]\n", segs[i].ks[0], segs[i].ks[1], segs[i].ks[2], segs[i].ks[3]); print_seg(segs[i].ks, x0, y0, x1, y1); } printf("stroke\n"); } int test_curve(void) { spiro_cp path[] = { {334, 117, 'v'}, {305, 176, 'v'}, {212, 142, 'c'}, {159, 171, 'c'}, {224, 237, 'c'}, {347, 335, 'c'}, {202, 467, 'c'}, {81, 429, 'v'}, {114, 368, 'v'}, {201, 402, 'c'}, {276, 369, 'c'}, {218, 308, 'c'}, {91, 211, 'c'}, {124, 111, 'c'}, {229, 82, 'c'} }; spiro_seg *segs = 0; int i; for (i = 0; i < 1000; i++) { free_spiro(segs); if ( (segs = setup_path(path, 15))==0 || solve_spiro(segs, 15)==0 ) { printf("error in test_curve()\n"); free_spiro(segs); return -1; ; } } printf("100 800 translate 1 -1 scale 1 setlinewidth\n"); print_segs(segs, 15); printf("showpage\n"); free_spiro(segs); return 0; } int main(int argc, char **argv) { return test_curve(); }