commit 3035e23fe446bff3623522f7819f84245518bc75
Author: Christophe Coustet <christophe.coustet@meso-star.com>
Date: Fri, 17 Jan 2020 16:38:58 +0100
Initial commit
Diffstat:
24 files changed, 4826 insertions(+), 0 deletions(-)
diff --git a/COPYING b/COPYING
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ <program> Copyright (C) <year> <name of author>
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/README.md b/README.md
@@ -0,0 +1,43 @@
+Star-geometry-2D
+================
+
+The purpose of this library is to help create clean and decorated 2D
+geometries. These geometries are suitable to be partitioned into
+enclosures using the star-enclosures-2D library. It also provides
+mechanisms to construct segment-related app data, detect
+inconsistencies and dump the resulting geometry in various formats (OBJ,
+VTK, C code chunks).
+
+How to build
+------------
+
+Star-geometry-2D relies on the [CMake](http://www.cmake.org) and the
+[RCMake](https://gitlab.com/vaplv/rcmake/) package to build. It also
+depends on the [RSys](https://gitlab.com/vaplv/rsys/) library.
+
+First ensure that CMake and a C compiler that is compliant with C89 are
+installed on your system. Then install the RCMake package as well as all
+the aforementioned prerequisites. Finally generate the project from the
+`cmake/CMakeLists.txt` file by appending to the `CMAKE_PREFIX_PATH`
+variable the install directories of its dependencies.
+
+Release notes
+-------------
+
+### Version 0.1
+
+First version and implementation of the Star-geometry-2D API.
+
+- Creation of geometries in multiple steps, allowing advanced
+ deduplication and application-data management;
+
+- Dump of geometries as OBJ or VTK files or as C code chunks;
+
+License
+-------
+
+Copyright (C) 2019-2020 |Meso|Star>
+(<a href="mailto:contact@meso-star.com" class="email">contact@meso-star.com</a>).
+Stardis is free software released under the GPLv3+ license: GNU GPL
+version 3 or later. You are welcome to redistribute it under certain
+conditions; refer to the COPYING files for details.
diff --git a/cmake/CMakeLists.txt b/cmake/CMakeLists.txt
@@ -0,0 +1,171 @@
+# Copyright (C) 2019-2020 |Meso|Star>
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+cmake_minimum_required(VERSION 3.1)
+project(star-geometry-2D C)
+enable_testing()
+
+include(CMakeDependentOption)
+
+set(STAR_GEOM_SOURCE_DIR ${PROJECT_SOURCE_DIR}/../src)
+option(NO_TEST
+ "Do not build tests"
+ OFF)
+
+CMAKE_DEPENDENT_OPTION(SMALL_ADDITIONAL_TESTS
+ "Build small additional tests originally written for star-enclosures" OFF "NOT NO_TEST" OFF)
+
+CMAKE_DEPENDENT_OPTION(HUGE_ADDITIONAL_TESTS
+ "Build additional tests originally written for star-enclosures that involve millions of segments" OFF "NOT NO_TEST" OFF)
+
+################################################################################
+# Check dependencies
+################################################################################
+find_package(RCMake 0.4 REQUIRED)
+find_package(RSys 0.8.1 REQUIRED)
+
+set(CMAKE_MODULE_PATH ${CMAKE_MODULE_PATH} ${RCMAKE_SOURCE_DIR})
+include(rcmake)
+include(rcmake_runtime)
+
+include_directories(
+ ${RSys_INCLUDE_DIR}
+ ${StarEnc_INCLUDE_DIR})
+
+rcmake_append_runtime_dirs(_runtime_dirs RSys StarEnc)
+
+################################################################################
+# Configure and define targets
+################################################################################
+set(VERSION_MAJOR 0)
+set(VERSION_MINOR 1)
+set(VERSION_PATCH 0)
+set(VERSION ${VERSION_MAJOR}.${VERSION_MINOR}.${VERSION_PATCH})
+
+set(SG2_FILES_SRC
+ sg2_device.c
+ sg2_geometry.c
+)
+
+set(SG2_FILES_INC_API
+ sg2.h
+ sg2_s2d_helper.h
+ sg2_senc2d_helper.h
+)
+
+set(SG2_FILES_INC
+ sg2_device.h
+ sg2_geometry.h
+ sg2_misc.h
+)
+
+set(SG2_FILES_DOC COPYING README.md)
+
+# Prepend each file by `STAR_GEOM_SOURCE_DIR'
+rcmake_prepend_path(SG2_FILES_SRC ${STAR_GEOM_SOURCE_DIR})
+rcmake_prepend_path(SG2_FILES_INC ${STAR_GEOM_SOURCE_DIR})
+rcmake_prepend_path(SG2_FILES_INC_API ${STAR_GEOM_SOURCE_DIR})
+rcmake_prepend_path(SG2_FILES_DOC ${PROJECT_SOURCE_DIR}/../)
+
+if(CMAKE_COMPILER_IS_GNUCC)
+ set(MATH_LIB m)
+endif()
+
+if(MSVC)
+
+endif()
+
+add_library(sg2 SHARED
+ ${SG2_FILES_SRC}
+ ${SG2_FILES_INC}
+ ${SG2_FILES_INC_API})
+target_link_libraries(sg2 RSys ${MATH_LIB})
+
+set_target_properties(sg2 PROPERTIES
+ DEFINE_SYMBOL SG2_SHARED_BUILD
+ VERSION ${VERSION}
+ SOVERSION ${VERSION_MAJOR})
+rcmake_copy_runtime_libraries(sg2)
+
+rcmake_setup_devel(sg2 StarGeom ${VERSION} star/sg2_version.h)
+
+################################################################################
+# Add tests
+################################################################################
+if(NOT NO_TEST)
+ function(build_test _name)
+ add_executable(${_name}
+ ${STAR_GEOM_SOURCE_DIR}/${_name}.c
+ ${STAR_GEOM_SOURCE_DIR}/test_sg2_utils.h)
+ foreach(other ${ARGN})
+ target_sources(${_name}
+ PUBLIC ${STAR_GEOM_SOURCE_DIR}/${other})
+ endforeach()
+ target_link_libraries(${_name} RSys sg2)
+ endfunction()
+
+ function(register_test _name)
+ add_test(${_name} ${ARGN})
+ rcmake_set_test_runtime_dirs(${_name} _runtime_dirs)
+ endfunction()
+
+ function(new_test _name)
+ build_test(${_name} ${ARGN})
+ register_test(${_name} ${_name})
+ endfunction()
+
+ new_test(test_sg2_device)
+ new_test(test_sg2_geometry)
+ new_test(test_sg2_geometry_2)
+
+ rcmake_copy_runtime_libraries(test_sg2_device)
+ rcmake_copy_runtime_libraries(test_sg2_geometry)
+ rcmake_copy_runtime_libraries(test_sg2_geometry_2)
+
+ if(SMALL_ADDITIONAL_TESTS)
+ new_test(test_sg2_square_behind_square)
+ new_test(test_sg2_square_in_square)
+ new_test(test_sg2_square_on_square)
+ new_test(test_sg2_some_enclosures test_sg2_utils2.h)
+ new_test(test_sg2_some_segments test_sg2_utils2.h)
+ new_test(test_sg2_undefined_properties)
+
+ rcmake_copy_runtime_libraries(test_sg2_square_behind_square)
+ rcmake_copy_runtime_libraries(test_sg2_square_in_square)
+ rcmake_copy_runtime_libraries(test_sg2_square_on_square)
+ rcmake_copy_runtime_libraries(test_sg2_some_enclosures)
+ rcmake_copy_runtime_libraries(test_sg2_some_segments)
+ rcmake_copy_runtime_libraries(test_sg2_undefined_properties)
+ endif()
+
+ if(HUGE_ADDITIONAL_TESTS)
+ new_test(test_sg2_many_enclosures test_sg2_utils2.h)
+ new_test(test_sg2_many_segments test_sg2_utils2.h)
+
+ rcmake_copy_runtime_libraries(test_sg2_many_enclosures)
+ rcmake_copy_runtime_libraries(test_sg2_many_segments)
+ endif()
+
+endif()
+
+################################################################################
+# Define output & install directories
+################################################################################
+install(TARGETS sg2
+ ARCHIVE DESTINATION bin
+ LIBRARY DESTINATION lib
+ RUNTIME DESTINATION bin)
+install(FILES ${SG2_FILES_INC_API} DESTINATION include/star)
+install(FILES ${SG2_FILES_DOC} DESTINATION share/doc/star-geometry-2D)
diff --git a/src/sg2.h b/src/sg2.h
@@ -0,0 +1,391 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#ifndef STAR_GEOMETRY_H__
+#define STAR_GEOMETRY_H__
+
+#include <rsys/rsys.h>
+#include <rsys/dynamic_array_uint.h>
+
+#include <limits.h>
+
+/* Library symbol management */
+#if defined(SG2_SHARED_BUILD)
+ #define SG2_API extern EXPORT_SYM
+#elif defined(SG2_STATIC_BUILD)
+ #define SG2_API extern LOCAL_SYM
+#else /* Use shared library */
+ #define SG2_API extern IMPORT_SYM
+#endif
+
+/* Helper macro that asserts if the invocation of the star-geometry function
+ * `Func' returns an error. One should use this macro on star-geometry
+ * function calls for which no explicit error checking is performed. */
+#ifndef NDEBUG
+#define SG2(Func) ASSERT(sg2_ ## Func == RES_OK)
+#else
+#define SG2(Func) sg2_ ## Func
+#endif
+
+ /* Forward declaration of external opaque data types */
+struct logger;
+struct mem_allocator;
+struct senc_scene;
+
+/* Forward declaration of the star-geometry opaque data types. These data
+ * types are ref counted. Once created the caller implicitly owns the created
+ * data, i.e. its reference counter is set to 1. The sdis_<TYPE>_ref_<get|put>
+ * functions get or release a reference on the data, i.e. they increment or
+ * decrement the reference counter, respectively. When this counter reaches 0,
+ * the object is silently destroyed and cannot be used anymore. */
+struct sg2_device;
+struct sg2_geometry;
+
+/*******************************************************************************
+ * A type to list the different user properties attached to segments.
+ ******************************************************************************/
+enum sg2_property_type {
+ SG2_FRONT,
+ SG2_BACK,
+ SG2_INTFACE,
+ SG2_PROP_TYPES_COUNT__
+};
+
+/*******************************************************************************
+ * A type to list the different possible partitions of segments.
+ ******************************************************************************/
+enum sg2_dump_content {
+ SG2_MERGE_CONFLICTS = BIT(0),
+ SG2_PROPERTY_CONFLICTS = BIT(1),
+ SG2_VALID_SEGMENT = BIT(2),
+ SG2_ALL_SEGMENTS =
+ SG2_MERGE_CONFLICTS | SG2_PROPERTY_CONFLICTS | SG2_VALID_SEGMENT
+};
+
+/*******************************************************************************
+ * A type to list the different qualifiers of C code variable output.
+ ******************************************************************************/
+enum sg2_cdump_qualifiers {
+ SG2_CDUMP_CONST = BIT(0),
+ SG2_CDUMP_STATIC = BIT(1)
+};
+
+/*******************************************************************************
+ * The value that should be used for properties attached to segments (i.e.
+ * media or interface) when not defined.
+ * SG2_UNDEFINED_PROPERTY can be used for a property that has already been
+ * defined; in this case the previous value will remain.
+ ******************************************************************************/
+#define SG2_UNDEFINED_PROPERTY UINT_MAX
+
+ /*******************************************************************************
+ * A type to hold callbacks for sg2_geometry_add.
+ ******************************************************************************/
+struct sg2_geometry_add_callbacks {
+ /* User function that provides vertices ids for added segments */
+ void(*get_indices)
+ (const unsigned iseg, unsigned ids[2], void* context);
+ /* User function that provides properties for added segments */
+ void(*get_properties) /* Can be NULL <=> SG2_UNDEFINED_PROPERTY used */
+ (const unsigned iseg,
+ /* It is OK to have side and interface properties sharing the same IDs,
+ * i.e. side and interface IDs both starting from 0 */
+ unsigned properties[SG2_PROP_TYPES_COUNT__],
+ void* context);
+ /* User function that provides coordinates for added vertices */
+ void(*get_position)
+ (const unsigned ivert, double pos[2], void* context);
+ /* Called if the iseg_th segment of the current sg2_geometry_add is a new
+ * segment (i.e. not a duplicate) so that the client app can manage its own
+ * segment data/properties/attributes.
+ * If return is not RES_OK, sg2_geometry_add stops immediately and returns
+ * whatever value add_segment returned. */
+ res_T(*add_segment) /* Can be NULL */
+ (const unsigned unique_id, const unsigned iseg, void* context);
+ /* Called if the iseg_th segment of the current sg2_geometry_add is a
+ * duplicate of the unique_id_th unique segment so that the client app can
+ * merge its own segment data, rule merge validity, and possibly change the
+ * recorded properties.
+ * The reversed_segment arg indicates if the segment vertices' order is
+ * the same it was when the segment was first added.
+ * The merge_conflict_status argument can be set to any value. Any non-0
+ * value is accounted for a conflict and is kept as-is in dumps, allowing
+ * different shades of conflict.
+ * The segment_properties and merged_properties args contain the involved
+ * properties. */
+ res_T(*merge_segment) /* Can be NULL */
+ (const unsigned unique_id,
+ const unsigned iseg,
+ const int reversed_segment,
+ unsigned segment_properties[SG2_PROP_TYPES_COUNT__],
+ const unsigned merged_properties[SG2_PROP_TYPES_COUNT__],
+ void* context,
+ int* merge_conflict_status);
+ /* Called if the iseg_th segment is degenerated. According to the value
+ * of abort, sg2_geometry_add will stop and return RES_BAD_ARG or continue
+ * silently. */
+ res_T(*degenerated_segment) /* Can be NULL <=> Drop segment, don't abort */
+ (const unsigned iseg, void* context, int* abort);
+};
+#define SG2_ADD_CALLBACKS_NULL__ { NULL, NULL, NULL, NULL, NULL, NULL }
+
+BEGIN_DECLS
+
+/*******************************************************************************
+ * A helper function on properties compatibility.
+ ******************************************************************************/
+static INLINE int
+sg2_compatible_property
+ (const unsigned p1,
+ const unsigned p2)
+{
+ if(p1 == SG2_UNDEFINED_PROPERTY || p2 == SG2_UNDEFINED_PROPERTY) return 1;
+ return (p1 == p2);
+}
+
+/*******************************************************************************
+ * star-geometry device. It is an handle toward the star-geometry library.
+ * It manages the star-geometry resources.
+ ******************************************************************************/
+SG2_API res_T
+sg2_device_create
+ (struct logger* logger, /* Can be NULL <=> use default logger */
+ struct mem_allocator* allocator, /* Can be NULL <=> use default allocator */
+ const int verbose, /* Verbosity level */
+ struct sg2_device** dev);
+
+SG2_API res_T
+sg2_device_ref_get
+ (struct sg2_device* dev);
+
+SG2_API res_T
+sg2_device_ref_put
+ (struct sg2_device* dev);
+
+/*******************************************************************************
+ * star-geometry geometry.
+ * It stores decorated geometry accumulated through calls to sg2_geometry_add,
+ * information related to this geometry and its creation process, including merge
+ * conflicts.
+ ******************************************************************************/
+/* Create a geometry that can be used to accumulate vertices and segments
+ * decorated with properties. */
+SG2_API res_T
+sg2_geometry_create
+ (struct sg2_device* dev,
+ struct sg2_geometry** geometry);
+
+/* Reserve memory according to anticipated geometry size. */
+SG2_API res_T
+sg2_geometry_reserve
+ (struct sg2_geometry* geometry,
+ const unsigned vertices_count,
+ const unsigned segments_count,
+ const unsigned properties_count);
+
+/* Add a new set of 3D vertices and segments to the geometry; segments can
+ * be decorated with 3 properties (front and back media and interface) that can
+ * be let undefined using the SG2_UNDEFINED_PROPERTY special value.
+ * Vertices can be duplicates and are silently deduplicated, always valid.
+ * Segments can be duplicates, but this can be ruled invalid due to property
+ * inconsistency. Segment duplicates are silently deduplicated, even if
+ * invalid. Consistency is to be understood as the consistency of the
+ * successive values for the same property across calls of sg2_geometry_add,
+ * not as the consistency of the values of the 3 properties of a segment at
+ * some given time (this question has its own callback (validate) in the
+ * sg2_geometry_validate_properties API call).
+ * Duplicate segments validity is either ruled by the user-provided
+ * merge_segment callback, or is just a matter of properties consistency if no
+ * callback is provided. In either case, sg2_geometry_add never stops
+ * prematurely nor returns an error code due to a merge conflict.
+ * - if provided, the callback must return the consistency status using the
+ * merge_conflict_status int* paramater (0 for consistent; any other value
+ * for inconsistent, this value being recorded); regardless of
+ * merge_conflict_status, the callback can change the properties of the
+ * segment before the SG2_UNDEFINED_PROPERTY overwriting step;
+ * - if not, a non-SG2_UNDEFINED_PROPERTY is only consistent with itself and
+ * with SG2_UNDEFINED_PROPERTY (if inconsistent, merge_conflict_status is set
+ * to 1 and recorded) ; regardless of merge_conflict_status, a
+ * non-SG2_UNDEFINED_PROPERTY property is never overridden.
+ * When deduplicating segments, the first occurence remains (with its
+ * original index in user world). After consistency being computed, a final
+ * step consists in rewriting SG2_UNDEFINED_PROPERTY properties if the merged
+ * property is defined. */
+SG2_API res_T
+sg2_geometry_add
+ (struct sg2_geometry* geometry,
+ const unsigned segments_count,
+ const unsigned vertices_count,
+ const struct sg2_geometry_add_callbacks* callbacks,
+ void* context); /* Can be NULL */
+
+/* Apply a validation callback on each segment included in this geometry that
+ * is not already flagged with a merge error. If validate returns a non-RES_OK
+ * value, the validation stops and returns the same error value; on the other
+ * hand, validation goes to the end regardless of properties conflicts.
+ * The properties_conflict_status argument can be set to any value. Any non-0
+ * value is accounted for a conflict and is kept as-is in dumps, allowing
+ * different shades of conflict.
+ * If validation is processed again, the properties conflict count is reset,
+ * as well as the properties_conflict_status status of the segments. */
+SG2_API res_T
+sg2_geometry_validate_properties
+ (struct sg2_geometry* geometry,
+ res_T(*validate)
+ (const unsigned iseg,
+ const unsigned properties[SG2_PROP_TYPES_COUNT__],
+ void* context,
+ int* properties_conflict_status),
+ void* context); /* Can be NULL */
+
+/* Get the number of unique vertices. */
+SG2_API res_T
+sg2_geometry_get_unique_vertices_count
+ (const struct sg2_geometry* geometry,
+ unsigned* count);
+
+/* Get the ivtx_th vertex. */
+SG2_API res_T
+sg2_geometry_get_unique_vertex
+ (const struct sg2_geometry* geometry,
+ const unsigned ivtx,
+ double coord[2]);
+
+/* Get the number of segments added to the geometry, regardless of unicity. */
+SG2_API res_T
+sg2_geometry_get_added_segments_count
+ (const struct sg2_geometry* geometry,
+ unsigned* count);
+
+/* Get the number of unique segments. */
+SG2_API res_T
+sg2_geometry_get_unique_segments_count
+ (const struct sg2_geometry* geometry,
+ unsigned* count);
+
+/* Get the vertex indices of the iseg_th unique segment. */
+SG2_API res_T
+sg2_geometry_get_unique_segment_vertices
+ (const struct sg2_geometry* geometry,
+ const unsigned iseg,
+ unsigned indices[2]);
+
+/* Get the properties of the iseg_th unique segment. */
+SG2_API res_T
+sg2_geometry_get_unique_segment_properties
+ (const struct sg2_geometry* geometry,
+ const unsigned iseg,
+ unsigned properties[SG2_PROP_TYPES_COUNT__]);
+
+/* Get the user ID of the iseg_th unique segment, that is the user world's
+ * index of the segment that first created this unique segment.
+ * User world index starts at 0 and increases for every segment that is
+ * submitted to sg2_geometry_add calls, regardless of duplication or
+ * sg2_geometry_add failures (non-RES_OK return value). */
+SG2_API res_T
+sg2_geometry_get_unique_segment_user_id
+ (const struct sg2_geometry* geometry,
+ const unsigned iseg,
+ unsigned* user_id);
+
+/* Get the number of segment with (at least) one undefined side. */
+SG2_API res_T
+sg2_geometry_get_segment_with_undefined_side_count
+ (const struct sg2_geometry* geometry,
+ unsigned* count);
+
+/* Get the number of segment with undefined interface. */
+SG2_API res_T
+sg2_geometry_get_segment_with_undefined_interface_count
+ (const struct sg2_geometry* geometry,
+ unsigned* count);
+
+/* Get the number of segment flagged with a merge conflict. */
+SG2_API res_T
+sg2_geometry_get_merge_conflict_count
+ (const struct sg2_geometry* geometry,
+ unsigned* count);
+
+/* Get the number of segment flagged with a property conflict. Only meaningful
+ * after sg2_geometry_validate_properties has been called. */
+SG2_API res_T
+sg2_geometry_get_properties_conflict_count
+ (const struct sg2_geometry* geometry,
+ unsigned* count);
+
+/* Dump a geometry in the provided stream in the OBJ format.
+ * The geometry can include conflicts, but cannot be empty. Note that vertices
+ * in this output are 3D with Z==0, as OBJ files cannot define 2 vertices.
+ * The dump is made of the vertices and some segments, without their
+ * properties. The dumped segments are defined by the flags argument, that
+ * must be ORed enum sg2_dump_content values.
+ * The dumped segments are partitioned in the following groups:
+ * - Valid_segments
+ * - Merge_conflicts
+ * - Property_conflict */
+SG2_API res_T
+sg2_geometry_dump_as_obj
+ (const struct sg2_geometry* geometry,
+ FILE* stream,
+ int flags);
+
+/* Dump a geometry in the provided stream in the VTK ascii format.
+ * The geometry can include conflicts, but cannot be empty. Note that POINTS
+ * in this output are 3D with Z==0, as VTK text files cannot define 2 POINTS.
+ * The dump is made of the vertices and segments, with most of their
+ * properties:
+ * - Front_medium (medium ID of the front side, INT_MAX for both undefined and
+ * conflicted)
+ * - Back_medium (medium ID of the back side, INT_MAX for both undefined and
+ * conflicted)
+ * - Interface (interface ID, INT_MAX for both undefined and conflicted)
+ * - Merge_conflict (merge conflict status)
+ * - Property_conflict (property conflict status)
+ * - Created_at_sg2_geometry_add (rank of the sg2_geometry_add that created the
+ * segment) */
+SG2_API res_T
+sg2_geometry_dump_as_vtk
+ (const struct sg2_geometry* geometry,
+ FILE* stream);
+
+/* Dump the geometry as C code.
+ * The geometry cannot be empty and must be conflict-free.
+ * The C code defines the 3 variables:
+ * - [static] [const] unsigned <name_prefix>_vertices_count = N1;
+ * - [static] [const] double <name_prefix>_vertices[<N1>] = { .... };
+ * - [static] [const] unsigned <name_prefix>_segments_count = N2;
+ * - [static] [const] unsigned <name_prefix>_segments[<N2>] = { .... };
+ * - [static] [const] unsigned <name_prefix>_properties[<N2>] = { .... };
+ * Where <N1> is 3 * vertices_count and <N2> is 3 * segments_count.
+ * The two qualifiers static and const are output or not according to flags;
+ * flags must be ORed enum sg2_cdump_qualifiers values. */
+SG2_API res_T
+sg2_geometry_dump_as_C_code
+ (const struct sg2_geometry* geometry,
+ FILE* stream,
+ const char* name_prefix, /* Can be NULL or "" */
+ const int flags);
+
+SG2_API res_T
+sg2_geometry_ref_get
+ (struct sg2_geometry* geometry);
+
+SG2_API res_T
+sg2_geometry_ref_put
+ (struct sg2_geometry* geometry);
+
+END_DECLS
+
+#endif /* STAR_GEOMETRY_H__ */
diff --git a/src/sg2_device.c b/src/sg2_device.c
@@ -0,0 +1,139 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "sg2_device.h"
+
+#include <rsys/logger.h>
+#include <rsys/mem_allocator.h>
+
+#include <stdarg.h>
+
+ /*******************************************************************************
+ * Helper functions
+ ******************************************************************************/
+static void
+log_msg
+ (struct sg2_device* dev,
+ const enum log_type stream,
+ const char* msg,
+ va_list vargs)
+{
+ ASSERT(dev && msg);
+ if(dev->verbose) {
+ res_T res; (void)res;
+ res = logger_vprint(dev->logger, stream, msg, vargs);
+ ASSERT(res == RES_OK);
+ }
+}
+
+static void
+device_release(ref_T* ref)
+{
+ struct sg2_device* dev;
+ ASSERT(ref);
+ dev = CONTAINER_OF(ref, struct sg2_device, ref);
+ MEM_RM(dev->allocator, dev);
+}
+
+/*******************************************************************************
+ * Exported functions
+ ******************************************************************************/
+res_T
+sg2_device_create
+ (struct logger* logger,
+ struct mem_allocator* mem_allocator,
+ const int verbose,
+ struct sg2_device** out_dev)
+{
+ struct logger* log = NULL;
+ struct sg2_device* dev = NULL;
+ struct mem_allocator* allocator = NULL;
+ res_T res = RES_OK;
+
+ if(!out_dev) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+
+ log = logger ? logger : LOGGER_DEFAULT;
+ allocator = mem_allocator ? mem_allocator : &mem_default_allocator;
+ dev = MEM_CALLOC(allocator, 1, sizeof(struct sg2_device));
+ if(!dev) {
+ if(verbose) {
+ /* Do not use helper log functions since dev is not initialised */
+ CHK(logger_print(log, LOG_ERROR,
+ "%s: could not allocate the star-geometry device.\n", FUNC_NAME)
+ == RES_OK);
+ }
+ res = RES_MEM_ERR;
+ goto error;
+ }
+ dev->logger = log;
+ dev->allocator = allocator;
+ dev->verbose = verbose;
+ ref_init(&dev->ref);
+
+exit:
+ if(out_dev) *out_dev = dev;
+ return res;
+error:
+ if(dev) {
+ SG2(device_ref_put(dev));
+ dev = NULL;
+ }
+ goto exit;
+}
+
+res_T
+sg2_device_ref_get(struct sg2_device* dev)
+{
+ if(!dev) return RES_BAD_ARG;
+ ref_get(&dev->ref);
+ return RES_OK;
+}
+
+res_T
+sg2_device_ref_put(struct sg2_device* dev)
+{
+ if(!dev) return RES_BAD_ARG;
+ ref_put(&dev->ref, device_release);
+ return RES_OK;
+}
+
+/*******************************************************************************
+ * Local functions
+ ******************************************************************************/
+void
+log_err(struct sg2_device* dev, const char* msg, ...)
+{
+ va_list vargs_list;
+ ASSERT(dev && msg);
+
+ va_start(vargs_list, msg);
+ log_msg(dev, LOG_ERROR, msg, vargs_list);
+ va_end(vargs_list);
+}
+
+void
+log_warn(struct sg2_device* dev, const char* msg, ...)
+{
+ va_list vargs_list;
+ ASSERT(dev && msg);
+
+ va_start(vargs_list, msg);
+ log_msg(dev, LOG_WARNING, msg, vargs_list);
+ va_end(vargs_list);
+}
diff --git a/src/sg2_device.h b/src/sg2_device.h
@@ -0,0 +1,57 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#ifndef SG2_DEVICE_H__
+#define SG2_DEVICE_H__
+
+#include <rsys/ref_count.h>
+
+ /* Forward declaration of external opaque data types */
+struct logger;
+struct mem_allocator;
+
+struct sg2_device {
+ struct logger* logger;
+ struct mem_allocator* allocator;
+ int verbose;
+
+ ref_T ref;
+};
+
+/* Conditionally log a message on the LOG_ERROR stream of the device logger,
+ * with respect to the device verbose flag */
+extern LOCAL_SYM void
+log_err
+ (struct sg2_device* dev,
+ const char* msg,
+ ...)
+#ifdef COMPILER_GCC
+ __attribute((format(printf, 2, 3)))
+#endif
+ ;
+
+/* Conditionally log a message on the LOG_WARNING stream of the device logger,
+ * with respect to the device verbose flag */
+extern LOCAL_SYM void
+log_warn
+ (struct sg2_device* dev,
+ const char* msg,
+ ...)
+#ifdef COMPILER_GCC
+ __attribute((format(printf, 2, 3)))
+#endif
+ ;
+
+#endif /* SG2_DEVICE_H__ */
diff --git a/src/sg2_geometry.c b/src/sg2_geometry.c
@@ -0,0 +1,1045 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "sg2_geometry.h"
+#include "sg2_device.h"
+
+#include <rsys/double2.h>
+
+#include <limits.h>
+
+ /*******************************************************************************
+ * Helper functions
+ ******************************************************************************/
+static void
+geometry_release(ref_T* ref)
+{
+ struct sg2_geometry* geom;
+ struct sg2_device* dev;
+ ASSERT(ref);
+ geom = CONTAINER_OF(ref, struct sg2_geometry, ref);
+ dev = geom->dev;
+ darray_segment_release(&geom->unique_segments);
+ darray_vertex_release(&geom->unique_vertices);
+ htable_seg_release(&geom->unique_segments_ids);
+ htable_vrtx_release(&geom->unique_vertices_ids);
+ darray_seg_descriptions_release(&geom->seg_descriptions);
+ MEM_RM(dev->allocator, geom);
+ SG2(device_ref_put(dev));
+}
+
+static FINLINE int /* Return 1 if reversed */
+seg_make_key(struct unsigned2* k, const unsigned t[2])
+{
+ ASSERT(t);
+ ASSERT(t[0] != t[1]);
+ if(t[0] < t[1]) {
+ k->x[0] = t[0];
+ k->x[1] = t[1];
+ return 0;
+ } else {
+ k->x[0] = t[1];
+ k->x[1] = t[0];
+ return 1;
+ }
+}
+
+static void
+dump_seg_property
+ (const struct sg2_geometry* geom,
+ FILE* stream,
+ const enum sg2_property_type type)
+{
+ size_t i;
+ const struct seg_descriptions* descriptions;
+ ASSERT(geom && stream && type < SG2_PROP_TYPES_COUNT__);
+
+ descriptions
+ = darray_seg_descriptions_cdata_get(&geom->seg_descriptions);
+ FOR_EACH(i, 0, darray_segment_size_get(&geom->unique_segments)) {
+ unsigned property = SG2_UNDEFINED_PROPERTY;
+ size_t tdefs_count
+ = darray_definition_size_get(&descriptions[i].defs[type]);
+ if(tdefs_count && descriptions[i].property_defined[type]) {
+ const struct definition* tdefs
+ = darray_definition_cdata_get(&descriptions[i].defs[type]);
+ size_t j;
+ FOR_EACH(j, 0, tdefs_count) {
+ if(tdefs->property_value != SG2_UNDEFINED_PROPERTY) {
+ property = tdefs->property_value;
+ break; /* Found the defined value */
+ }
+ tdefs++; /* Next value */
+ }
+ }
+ /* Value is INT_MAX for both undefined and conflict */
+ fprintf(stream, "%u\n", MMIN(property, INT_MAX));
+ }
+}
+
+/*******************************************************************************
+ * Local functions
+ ******************************************************************************/
+res_T
+geometry_register_segment
+ (struct sg2_geometry* geom,
+ const struct segment* segment,
+ const unsigned segment_unique_id,
+ const unsigned set_id,
+ const int merge_conflict)
+{
+ res_T res = RES_OK;
+ struct seg_descriptions* seg_d;
+ int i;
+ char keep_prop_def[SG2_PROP_TYPES_COUNT__];
+
+ ASSERT(geom && segment);
+
+ ERR(geometry_enlarge_seg_descriptions(geom, segment_unique_id + 1));
+ seg_d = (darray_seg_descriptions_data_get(&geom->seg_descriptions)
+ + segment_unique_id);
+ /* Record information */
+ FOR_EACH(i, 0, SG2_PROP_TYPES_COUNT__) {
+ struct darray_definition* definitions;
+ struct definition* defs;
+ int done = 0;
+ size_t j;
+ keep_prop_def[i] = seg_d->property_defined[i];
+ if(segment->properties[i] == SG2_UNDEFINED_PROPERTY)
+ seg_d->defs_include_undefined = 1;
+ else seg_d->property_defined[i] = 1;
+ definitions = seg_d->defs + i;
+ defs = darray_definition_data_get(definitions);
+ FOR_EACH(j, 0, darray_definition_size_get(definitions)) {
+ if(defs[j].property_value == segment->properties[i]) {
+ /* This property_value is already registered: no conflict */
+ const unsigned* ids = darray_uint_cdata_get(&defs[j].set_ids);
+ size_t k;
+ /* Search if property_value already includes set_id */
+ FOR_EACH(k, 0, darray_uint_size_get(&defs[j].set_ids)) {
+ if(ids[k] == set_id) {
+ /* Same value+set_id was there already */
+ done = 1;
+ break;
+ }
+ }
+ if(!done) {
+ /* Need to add the set_id for this property_value */
+ ERR(darray_uint_push_back(&defs[j].set_ids, &set_id));
+ done = 1;
+ }
+ break;
+ }
+ }
+ if(!done) {
+ /* This property_value was not recorded already */
+ size_t defs_sz = darray_definition_size_get(definitions);
+ struct definition* new_def;
+ ERR(darray_definition_resize(definitions, 1 + defs_sz));
+ new_def = darray_definition_data_get(definitions) + defs_sz;
+ ERR(darray_uint_push_back(&new_def->set_ids, &set_id));
+ new_def->property_value = segment->properties[i];
+ if(!seg_d->merge_conflict && merge_conflict) {
+ /* If more than 1 merge_conflict occur, the first one remains */
+ seg_d->merge_conflict = merge_conflict;
+ geom->merge_conflict_count++;
+ }
+ }
+ }
+
+ if((!keep_prop_def[SG2_FRONT] || !keep_prop_def[SG2_BACK])
+ && seg_d->property_defined[SG2_FRONT] && seg_d->property_defined[SG2_BACK])
+ {
+ /* Both sides are now defined */
+ ASSERT(geom->seg_with_undef_sides_count > 0);
+ geom->seg_with_undef_sides_count--;
+ }
+
+ if(!keep_prop_def[SG2_INTFACE] && seg_d->property_defined[SG2_INTFACE]) {
+ /* Interface is now defined */
+ ASSERT(geom->seg_with_undef_intface_count > 0);
+ geom->seg_with_undef_intface_count--;
+ }
+
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+geometry_enlarge_seg_descriptions
+ (struct sg2_geometry* geom,
+ const size_t sz)
+{
+ res_T res = RES_OK;
+ size_t old_sz =
+ darray_seg_descriptions_size_get(&geom->seg_descriptions);
+ if(sz <= old_sz) return RES_OK;
+ ASSERT(sz - old_sz < UINT_MAX);
+ ERR(darray_seg_descriptions_resize(&geom->seg_descriptions, sz));
+ geom->seg_with_undef_sides_count += (unsigned)(sz - old_sz);
+ geom->seg_with_undef_intface_count += (unsigned)(sz - old_sz);
+
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+static void
+dump_partition
+ (const struct sg2_geometry* geom,
+ FILE* stream,
+ const char* group_name,
+ enum sg2_dump_content partition)
+{
+ const struct seg_descriptions* seg_descriptions;
+ const struct segment* segments;
+ size_t sz, i;
+ ASSERT(geom && stream && group_name);
+ ASSERT(partition == SG2_MERGE_CONFLICTS
+ || partition == SG2_PROPERTY_CONFLICTS
+ || partition == SG2_VALID_SEGMENT);
+ seg_descriptions
+ = darray_seg_descriptions_cdata_get(&geom->seg_descriptions);
+ sz = darray_seg_descriptions_size_get(&geom->seg_descriptions);
+ segments = darray_segment_cdata_get(&geom->unique_segments);
+ fprintf(stream, "g %s\n", group_name);
+ FOR_EACH(i, 0, sz) {
+ int dump;
+ if(partition == SG2_VALID_SEGMENT)
+ dump = !(seg_descriptions[i].merge_conflict
+ || seg_descriptions[i].properties_conflict);
+ else if(partition == SG2_MERGE_CONFLICTS)
+ dump = seg_descriptions[i].merge_conflict;
+ else {
+ ASSERT(partition == SG2_PROPERTY_CONFLICTS);
+ dump = seg_descriptions[i].properties_conflict;
+ }
+ if(!dump) continue;
+ fprintf(stream, "l %u %u\n",
+ /* OBJ indexing starts at 1 */
+ 1 + segments[i].vertex_ids[0],
+ 1 + segments[i].vertex_ids[1]);
+ }
+}
+
+/*******************************************************************************
+ * Exported functions
+ ******************************************************************************/
+res_T
+sg2_geometry_create
+ (struct sg2_device* dev,
+ struct sg2_geometry** out_geometry)
+{
+ struct sg2_geometry* geom = NULL;
+ res_T res = RES_OK;
+
+ if(!dev || !out_geometry) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+
+ geom = MEM_CALLOC(dev->allocator, 1, sizeof(struct sg2_geometry));
+ if(!geom) {
+ log_err(dev,
+ "%s: could not allocate the sg2.\n", FUNC_NAME);
+ res = RES_MEM_ERR;
+ goto error;
+ }
+
+ SG2(device_ref_get(dev));
+ darray_segment_init(dev->allocator, &geom->unique_segments);
+ darray_vertex_init(dev->allocator, &geom->unique_vertices);
+ htable_seg_init(dev->allocator, &geom->unique_segments_ids);
+ htable_vrtx_init(dev->allocator, &geom->unique_vertices_ids);
+ darray_seg_descriptions_init(dev->allocator, &geom->seg_descriptions);
+ geom->segment_count_including_duplicates = 0;
+ geom->sides_with_defined_medium_count = 0;
+ geom->set_id = 0;
+ geom->seg_with_undef_sides_count = 0;
+ geom->seg_with_undef_intface_count = 0;
+ geom->merge_conflict_count = 0;
+ geom->properties_conflict_count = 0;
+ geom->dev = dev;
+
+ ref_init(&geom->ref);
+
+exit:
+ if(out_geometry) *out_geometry = geom;
+ return res;
+error:
+ if(geom) {
+ SG2(geometry_ref_put(geom));
+ geom = NULL;
+ }
+ goto exit;
+}
+
+res_T
+sg2_geometry_reserve
+ (struct sg2_geometry* geom,
+ const unsigned vertices_count,
+ const unsigned segments_count,
+ const unsigned properties_count)
+{
+ res_T res = RES_OK;
+ if(!geom) return RES_BAD_ARG;
+
+ ERR(darray_segment_reserve(&geom->unique_segments, segments_count));
+ ERR(darray_vertex_reserve(&geom->unique_vertices, vertices_count));
+ ERR(htable_vrtx_reserve(&geom->unique_vertices_ids, vertices_count));
+ ERR(htable_seg_reserve(&geom->unique_segments_ids, segments_count));
+ ERR(darray_seg_descriptions_reserve(&geom->seg_descriptions,
+ properties_count));
+
+end:
+ return res;
+error:
+ goto end;
+}
+
+res_T
+sg2_geometry_add
+ (struct sg2_geometry* geom,
+ const unsigned nsegs,
+ const unsigned nverts,
+ const struct sg2_geometry_add_callbacks* callbacks,
+ void* ctx) /* Can be NULL */
+{
+ res_T res = RES_OK;
+ struct mem_allocator* alloc;
+ size_t nuseg, nuverts;
+ unsigned i, n_new_uverts = 0, n_new_utris = 0;
+ struct segment* seg;
+ /* Tmp table of IDs to record unique IDs of the currently added vertices */
+ struct darray_uint unique_vertice_ids;
+ int unique_vertice_ids_initialized = 0;
+
+ if(!geom || !callbacks || !callbacks->get_indices || !callbacks->get_position)
+ {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+
+ alloc = geom->dev->allocator;
+ nuverts = darray_vertex_size_get(&geom->unique_vertices);
+ nuseg = darray_segment_size_get(&geom->unique_segments);
+
+ /* Make room for new geometry; suppose no more duplicates */
+ darray_uint_init(alloc, &unique_vertice_ids);
+ unique_vertice_ids_initialized = 1;
+ ERR(darray_uint_reserve(&unique_vertice_ids, nverts));
+ ERR(darray_vertex_reserve(&geom->unique_vertices, nuverts + nverts));
+ ERR(darray_segment_reserve(&geom->unique_segments, nuseg + nsegs));
+ ERR(htable_vrtx_reserve(&geom->unique_vertices_ids, nuverts + nverts));
+ ERR(htable_seg_reserve(&geom->unique_segments_ids, nuseg + nsegs));
+ ASSERT(nuseg == darray_seg_descriptions_size_get(&geom->seg_descriptions));
+ ERR(darray_seg_descriptions_reserve(&geom->seg_descriptions, nuseg + nsegs));
+ /* Get vertices and deduplicate */
+ FOR_EACH(i, 0, nverts) {
+ unsigned* p_vrtx;
+ struct vertex tmp;
+ unsigned v_idx;
+ callbacks->get_position(i, tmp.coord, ctx);
+ p_vrtx = htable_vrtx_find(&geom->unique_vertices_ids, &tmp);
+ if(p_vrtx) {
+ /* Duplicate vertex */
+ v_idx = *p_vrtx;
+ } else {
+ /* New vertex */
+ ASSERT(nuverts + n_new_uverts < UINT_MAX);
+ v_idx = (unsigned)(nuverts + n_new_uverts);
+ ASSERT(v_idx == htable_vrtx_size_get(&geom->unique_vertices_ids));
+ ERR(darray_vertex_push_back(&geom->unique_vertices, &tmp));
+ ERR(htable_vrtx_set(&geom->unique_vertices_ids, &tmp, &v_idx));
+ ++n_new_uverts;
+ }
+ /* Keep the unique ID for vertex i */
+ ERR(darray_uint_push_back(&unique_vertice_ids, &v_idx));
+ }
+
+ /* Get segments and deduplicate */
+ seg = darray_segment_data_get(&geom->unique_segments);
+ FOR_EACH(i, 0, nsegs) {
+ int j, reversed;
+ struct unsigned2 seg_key;
+ struct segment tmp = SEG_UNDEF__;
+ unsigned* p_seg;
+ struct seg_descriptions* seg_descriptions = NULL;
+ unsigned unique_id;
+
+ callbacks->get_indices(i, tmp.vertex_ids, ctx);
+ FOR_EACH(j, 0, 2) {
+ if(tmp.vertex_ids[j] >= nverts) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ /* Replace the vertex ID by its the unique ID */
+ tmp.vertex_ids[j]
+ = darray_uint_cdata_get(&unique_vertice_ids)[tmp.vertex_ids[j]];
+ }
+ if(tmp.vertex_ids[0] == tmp.vertex_ids[1]) {
+ int abort = 0;
+ if(callbacks->degenerated_segment) {
+ /* Let the client app rule. */
+ ERR(callbacks->degenerated_segment(i, ctx, &abort));
+ } else {
+ log_warn(geom->dev, "%s: segment %u is degenerated.\n",
+ FUNC_NAME, i);
+ }
+ if(abort) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ else continue;
+ }
+ /* Get properties */
+ if(callbacks->get_properties)
+ callbacks->get_properties(i, tmp.properties, ctx);
+ /* Find duplicate segments */
+ reversed = seg_make_key(&seg_key, tmp.vertex_ids);
+ p_seg = htable_seg_find(&geom->unique_segments_ids, &seg_key);
+ if(p_seg) {
+ /* Duplicate segment. Need to check duplicate validity */
+ struct unsigned2 useg_key;
+ int ureversed = seg_make_key(&useg_key, seg[*p_seg].vertex_ids);
+ int same = (reversed == ureversed);
+ int already_conflict;
+ ASSERT(seg_key_eq(&seg_key, &useg_key));
+ unique_id = *p_seg;
+ ERR(geometry_enlarge_seg_descriptions(geom, 1 + unique_id));
+ seg_descriptions
+ = darray_seg_descriptions_data_get(&geom->seg_descriptions);
+ if(!same)
+ SWAP(unsigned, tmp.properties[SG2_FRONT], tmp.properties[SG2_BACK]);
+ already_conflict = seg_descriptions[i].merge_conflict;
+ if(callbacks->merge_segment) {
+ /* Let the client app rule. */
+ ERR(callbacks->merge_segment(*p_seg, i, !same, seg[*p_seg].properties,
+ tmp.properties, ctx, &seg_descriptions[i].merge_conflict));
+ } else {
+ FOR_EACH(j, 0, SG2_PROP_TYPES_COUNT__) {
+ if(!sg2_compatible_property(seg[*p_seg].properties[j],
+ tmp.properties[j]))
+ {
+ seg_descriptions[i].merge_conflict = 1;
+ break;
+ }
+ }
+ }
+ if(seg_descriptions[i].merge_conflict && !already_conflict)
+ geom->merge_conflict_count++;
+ /* Replace SG2_UNDEFINED_PROPERTY properties */
+ FOR_EACH(j, 0, SG2_PROP_TYPES_COUNT__) {
+ if(seg[*p_seg].properties[j] == SG2_UNDEFINED_PROPERTY
+ && tmp.properties[j] != SG2_UNDEFINED_PROPERTY) {
+ seg[*p_seg].properties[j] = tmp.properties[j];
+ if(j == SG2_FRONT || j == SG2_BACK)
+ geom->sides_with_defined_medium_count++;
+ }
+ }
+ } else {
+ /* New segment */
+ ASSERT(nuseg + n_new_utris < UINT_MAX);
+ unique_id = (unsigned)(nuseg + n_new_utris);
+ tmp.user_id = geom->segment_count_including_duplicates + i;
+ if(callbacks->add_segment)
+ ERR(callbacks->add_segment(unique_id, i, ctx));
+ ERR(geometry_enlarge_seg_descriptions(geom, 1 + unique_id));
+ seg_descriptions
+ = darray_seg_descriptions_data_get(&geom->seg_descriptions);
+ ERR(darray_segment_push_back(&geom->unique_segments, &tmp));
+ FOR_EACH(j, 0, SG2_PROP_TYPES_COUNT__) {
+ if((j == SG2_FRONT || j == SG2_BACK)
+ && tmp.properties[j] != SG2_UNDEFINED_PROPERTY)
+ geom->sides_with_defined_medium_count++;
+ }
+ ASSERT(unique_id == htable_seg_size_get(&geom->unique_segments_ids));
+ ERR(htable_seg_set(&geom->unique_segments_ids, &seg_key, &unique_id));
+ n_new_utris++;
+ }
+ ERR(geometry_register_segment(geom, &tmp, unique_id, geom->set_id,
+ seg_descriptions[i].properties_conflict));
+ if(seg_descriptions[i].properties_conflict)
+ geom->merge_conflict_count++;
+ }
+
+ ASSERT(nuverts + n_new_uverts
+ == htable_vrtx_size_get(&geom->unique_vertices_ids));
+ ASSERT(nuseg + n_new_utris
+ == htable_seg_size_get(&geom->unique_segments_ids));
+exit:
+ if(geom) {
+ geom->set_id++;
+ geom->segment_count_including_duplicates += nsegs;
+ }
+ if(unique_vertice_ids_initialized)
+ darray_uint_release(&unique_vertice_ids);
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_validate_properties
+ (struct sg2_geometry* geom,
+ res_T(*validate)(const unsigned, const unsigned*, void*, int*),
+ void* ctx)
+{
+ size_t sz__;
+ unsigned i, sz;
+ struct seg_descriptions* seg_descriptions;
+ res_T res = RES_OK;
+
+ if(!geom || !validate) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+
+ sz__ = darray_seg_descriptions_size_get(&geom->seg_descriptions);
+ ASSERT(sz__ <= UINT_MAX);
+ sz = (unsigned)sz__;
+ seg_descriptions
+ = darray_seg_descriptions_data_get(&geom->seg_descriptions);
+ geom->properties_conflict_count = 0; /* Reset count */
+ FOR_EACH(i, 0, sz) {
+ unsigned p, j;
+ unsigned props[SG2_PROP_TYPES_COUNT__];
+ struct seg_descriptions* segd = seg_descriptions + i;
+ /* Validate only segment not flagged with merge_conflict */
+ if(segd->merge_conflict) {
+ segd->properties_conflict = 0;
+ continue;
+ }
+ /* Get properties for non-conflict segments */
+ FOR_EACH(p, 0, SG2_PROP_TYPES_COUNT__) {
+ const struct definition* defs = darray_definition_cdata_get(segd->defs + p);
+ props[p] = SG2_UNDEFINED_PROPERTY;
+ FOR_EACH(j, 0, darray_definition_size_get(segd->defs + p)) {
+ if(defs[j].property_value != SG2_UNDEFINED_PROPERTY) {
+ props[p] = defs[j].property_value;
+ break;
+ }
+ }
+ }
+ /* Call vaildation */
+ ERR(validate(i, props, ctx, &segd->properties_conflict));
+ if(segd->properties_conflict)
+ geom->properties_conflict_count++;
+ }
+
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_get_unique_vertices_count
+ (const struct sg2_geometry* geom,
+ unsigned* count)
+{
+ res_T res = RES_OK;
+ size_t sz;
+ if(!geom || !count) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ sz = darray_vertex_size_get(&geom->unique_vertices);
+ ASSERT(sz <= UINT_MAX);
+ *count = (unsigned)sz;
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_get_unique_vertex
+ (const struct sg2_geometry* geom,
+ const unsigned ivtx,
+ double coord[2])
+{
+ res_T res = RES_OK;
+ const struct vertex* vertices;
+ if(!geom || !coord
+ || ivtx >= darray_vertex_size_get(&geom->unique_vertices))
+ {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ vertices = darray_vertex_cdata_get(&geom->unique_vertices);
+ d2_set(coord, vertices[ivtx].coord);
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_get_added_segments_count
+ (const struct sg2_geometry* geom,
+ unsigned* count)
+{
+ res_T res = RES_OK;
+ if (!geom || !count) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ *count = geom->segment_count_including_duplicates;
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_get_unique_segments_count
+ (const struct sg2_geometry* geom,
+ unsigned* count)
+{
+ res_T res = RES_OK;
+ size_t sz;
+ if(!geom || !count) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ sz = darray_segment_size_get(&geom->unique_segments);
+ ASSERT(sz <= UINT_MAX);
+ *count = (unsigned)sz;
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_get_unique_segment_vertices
+ (const struct sg2_geometry* geom,
+ const unsigned iseg,
+ unsigned indices[2])
+{
+ res_T res = RES_OK;
+ const struct segment* segments;
+ size_t i;
+ if(!geom || !indices
+ || iseg >= darray_segment_size_get(&geom->unique_segments))
+ {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ segments = darray_segment_cdata_get(&geom->unique_segments);
+ FOR_EACH(i, 0, 2) indices[i] = segments[iseg].vertex_ids[i];
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_get_unique_segment_properties
+ (const struct sg2_geometry* geom,
+ const unsigned iseg,
+ unsigned properties[SG2_PROP_TYPES_COUNT__])
+{
+ res_T res = RES_OK;
+ const struct segment* segments;
+ size_t i;
+ if(!geom || !properties
+ || iseg >= darray_segment_size_get(&geom->unique_segments))
+ {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ segments = darray_segment_cdata_get(&geom->unique_segments);
+ FOR_EACH(i, 0, SG2_PROP_TYPES_COUNT__)
+ properties[i] = segments[iseg].properties[i];
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_get_unique_segment_user_id
+ (const struct sg2_geometry* geom,
+ const unsigned iseg,
+ unsigned* user_id)
+{
+ res_T res = RES_OK;
+ const struct segment* segments;
+ if(!geom || !user_id
+ || iseg >= darray_segment_size_get(&geom->unique_segments))
+ {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ segments = darray_segment_cdata_get(&geom->unique_segments);
+ *user_id = segments[iseg].user_id;
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_get_segment_with_undefined_side_count
+ (const struct sg2_geometry* geom,
+ unsigned* count)
+{
+ res_T res = RES_OK;
+ if(!geom || !count) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ *count = geom->seg_with_undef_sides_count;
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_get_segment_with_undefined_interface_count
+ (const struct sg2_geometry* geom,
+ unsigned* count)
+{
+ res_T res = RES_OK;
+ if(!geom || !count) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ *count = geom->seg_with_undef_intface_count;
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_get_merge_conflict_count
+ (const struct sg2_geometry* geom,
+ unsigned* count)
+{
+ res_T res = RES_OK;
+ if(!geom || !count) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ *count = geom->merge_conflict_count;
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_get_properties_conflict_count
+ (const struct sg2_geometry* geom,
+ unsigned* count)
+{
+ res_T res = RES_OK;
+ if(!geom || !count) {
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ *count = geom->properties_conflict_count;
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_dump_as_obj
+ (const struct sg2_geometry* geom,
+ FILE* stream,
+ int flags)
+{
+ res_T res = RES_OK;
+ const struct vertex* vertices;
+ size_t vsz, tsz, i;
+ if(!geom || !stream || !flags
+ || !geom->segment_count_including_duplicates)
+ {
+ if(geom && !geom->segment_count_including_duplicates)
+ log_err(geom->dev,
+ "%s: cannot dump empty geometries as OBJ\n",
+ FUNC_NAME);
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ /* Headers */
+ fprintf(stream, "# Dump of star-geometry\n");
+ fprintf(stream, "# Geometry counts:\n");
+ vsz = darray_vertex_size_get(&geom->unique_vertices);
+ ASSERT(vsz <= UINT_MAX);
+ fprintf(stream, "# . %u vertices\n", (unsigned)vsz);
+ tsz = darray_segment_size_get(&geom->unique_segments);
+ ASSERT(tsz <= UINT_MAX);
+ fprintf(stream, "# . %u segments\n", (unsigned)tsz);
+ fprintf(stream,
+ "# . %u segments flagged with a merge conflict\n",
+ geom->merge_conflict_count);
+ fprintf(stream,
+ "# . %u segments flagged with a property conflict\n",
+ geom->merge_conflict_count);
+
+ /* Dump vertices */
+ vertices = darray_vertex_cdata_get(&geom->unique_vertices);
+ FOR_EACH(i, 0, vsz)
+ fprintf(stream, "v %g %g 0\n", SPLIT2(vertices[i].coord));
+
+ /* Dump segments by groups */
+ dump_partition(geom, stream, "Valid_segments", SG2_VALID_SEGMENT);
+ dump_partition(geom, stream, "Merge_conflicts", SG2_MERGE_CONFLICTS);
+ dump_partition(geom, stream, "Property_conflicts", SG2_PROPERTY_CONFLICTS);
+
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_dump_as_vtk
+ (const struct sg2_geometry* geom,
+ FILE* stream)
+{
+ res_T res = RES_OK;
+ const struct vertex* vertices;
+ const struct segment* segments;
+ const struct seg_descriptions* descriptions;
+ size_t vsz, tsz, i;
+ if(!geom || !stream || !geom->segment_count_including_duplicates) {
+ if(geom && !geom->segment_count_including_duplicates)
+ log_err(geom->dev,
+ "%s: cannot dump empty geometries as VTK\n",
+ FUNC_NAME);
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ /* Headers */
+ fprintf(stream, "# vtk DataFile Version 3.0\n");
+ fprintf(stream, "Dump of star-geometry geometry\n");
+ fprintf(stream, "ASCII\n");
+ fprintf(stream, "DATASET POLYDATA\n");
+
+ /* Dump vertices */
+ vsz = darray_vertex_size_get(&geom->unique_vertices);
+ ASSERT(vsz <= UINT_MAX);
+ fprintf(stream, "POINTS %u double\n", (unsigned)vsz);
+ vertices = darray_vertex_cdata_get(&geom->unique_vertices);
+ FOR_EACH(i, 0, vsz)
+ fprintf(stream, "%g %g 0\n", SPLIT2(vertices[i].coord));
+
+ /* Dump segments */
+ tsz = darray_segment_size_get(&geom->unique_segments);
+ ASSERT(4 * tsz <= UINT_MAX);
+ fprintf(stream, "LINES %u %u\n", (unsigned)tsz, (unsigned)(3 * tsz));
+ segments = darray_segment_cdata_get(&geom->unique_segments);
+ FOR_EACH(i, 0, tsz)
+ fprintf(stream, "2 %u %u\n", SPLIT2(segments[i].vertex_ids));
+
+ /* Start segments properties */
+ fprintf(stream, "CELL_DATA %u\n", (unsigned)tsz);
+ descriptions = darray_seg_descriptions_cdata_get(&geom->seg_descriptions);
+
+ /* Dump front medium */
+ fprintf(stream, "SCALARS Front_medium int\n");
+ fprintf(stream, "LOOKUP_TABLE default\n");
+ dump_seg_property(geom, stream, SG2_FRONT);
+
+ /* Dump back medium */
+ fprintf(stream, "SCALARS Back_medium int\n");
+ fprintf(stream, "LOOKUP_TABLE default\n");
+ dump_seg_property(geom, stream, SG2_BACK);
+
+ /* Dump interface */
+ fprintf(stream, "SCALARS Interface int\n");
+ fprintf(stream, "LOOKUP_TABLE default\n");
+ dump_seg_property(geom, stream, SG2_INTFACE);
+
+ /* Dump user_id */
+ fprintf(stream, "SCALARS User_ID int\n");
+ fprintf(stream, "LOOKUP_TABLE default\n");
+ FOR_EACH(i, 0, tsz)
+ fprintf(stream, "%u\n", segments[i].user_id);
+
+ /* Dump merge conflict status */
+ fprintf(stream, "SCALARS Merge_conflict int\n");
+ fprintf(stream, "LOOKUP_TABLE default\n");
+ FOR_EACH(i, 0, tsz)
+ fprintf(stream, "%d\n", descriptions[i].merge_conflict);
+
+ /* Dump property conflict status */
+ fprintf(stream, "SCALARS Property_conflict int\n");
+ fprintf(stream, "LOOKUP_TABLE default\n");
+ FOR_EACH(i, 0, tsz)
+ fprintf(stream, "%d\n", descriptions[i].properties_conflict);
+
+ /* Dump rank of the sg2_geometry_add that created the segment */
+ fprintf(stream, "SCALARS Created_at_sg2_geometry_add int\n");
+ fprintf(stream, "LOOKUP_TABLE default\n");
+ FOR_EACH(i, 0, tsz) {
+ const struct definition* tdefs;
+ const unsigned* ranks;
+ ASSERT(darray_definition_size_get(&descriptions[i].defs[SG2_FRONT]) > 0);
+ /* Rank is the first set_id of the first definition of any property */
+ tdefs = darray_definition_cdata_get(&descriptions[i].defs[SG2_FRONT]);
+ ranks = darray_uint_cdata_get(&tdefs[0].set_ids);
+ fprintf(stream, "%u\n", ranks[0]);
+ }
+
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_dump_as_C_code
+ (const struct sg2_geometry* geom,
+ FILE* stream,
+ const char* name_prefix,
+ const int flags)
+{
+ res_T res = RES_OK;
+ const struct vertex* vertices;
+ const struct segment* segments;
+ const char* qualifiers;
+ size_t vsz, tsz, i;
+ if(!geom || !stream
+ || geom->merge_conflict_count
+ || geom->properties_conflict_count
+ || !geom->segment_count_including_duplicates)
+ {
+ if(geom
+ && (geom->merge_conflict_count
+ || geom->properties_conflict_count))
+ log_err(geom->dev,
+ "%s: cannot dump geometries with conflict as C code\n",
+ FUNC_NAME);
+ if(geom && !geom->segment_count_including_duplicates)
+ log_err(geom->dev,
+ "%s: cannot dump empty geometries as C code\n",
+ FUNC_NAME);
+ res = RES_BAD_ARG;
+ goto error;
+ }
+ if(!name_prefix) name_prefix = "";
+ /* Headers */
+ if(name_prefix && name_prefix[0] != '\0')
+ fprintf(stream, "/* Dump of star-geometry '%s'. */\n", name_prefix);
+ else
+ fprintf(stream, "/* Dump of star-geometry. */\n");
+ vsz = darray_vertex_size_get(&geom->unique_vertices);
+ ASSERT(3 * vsz <= UINT_MAX);
+ tsz = darray_segment_size_get(&geom->unique_segments);
+ ASSERT(3 * tsz <= UINT_MAX);
+
+ if(vsz == 0 || tsz == 0) {
+ log_err(geom->dev,
+ "%s: no geometry to dump\n",
+ FUNC_NAME);
+ res = RES_BAD_ARG;
+ goto error;
+ }
+
+ if(flags & SG2_CDUMP_CONST && flags & SG2_CDUMP_STATIC)
+ qualifiers = "static const ";
+ else if(flags & SG2_CDUMP_CONST)
+ qualifiers = "const ";
+ else if(flags & SG2_CDUMP_STATIC)
+ qualifiers = "static ";
+ else qualifiers = "";
+
+ /* Dump vertices */
+ fprintf(stream, "%sunsigned %s_vertices_count = %u;\n",
+ qualifiers, name_prefix, (unsigned)vsz);
+
+ vertices = darray_vertex_cdata_get(&geom->unique_vertices);
+ fprintf(stream,
+ "%sdouble %s_vertices[%u] =\n"
+ "{\n",
+ qualifiers, name_prefix, (unsigned)(2 * vsz));
+ FOR_EACH(i, 0, vsz - 1)
+ fprintf(stream,
+ " %g, %g,\n", SPLIT2(vertices[i].coord));
+ fprintf(stream,
+ " %g, %g\n", SPLIT2(vertices[vsz - 1].coord));
+ fprintf(stream,
+ "};\n");
+
+ /* Dump segments */
+ fprintf(stream, "%sunsigned %s_segments_count = %u;\n",
+ qualifiers, name_prefix, (unsigned)tsz);
+
+ segments = darray_segment_cdata_get(&geom->unique_segments);
+ fprintf(stream,
+ "%sunsigned %s_segments[%u] =\n"
+ "{\n",
+ qualifiers, name_prefix, (unsigned)(2 * tsz));
+ FOR_EACH(i, 0, tsz - 1)
+ fprintf(stream,
+ " %u, %u,\n", SPLIT2(segments[i].vertex_ids));
+ fprintf(stream,
+ " %u, %u\n", SPLIT2(segments[tsz - 1].vertex_ids));
+ fprintf(stream,
+ "};\n");
+
+ /* Dump properties */
+ fprintf(stream,
+ "%sunsigned %s_properties[%u] =\n"
+ "{\n",
+ qualifiers, name_prefix, (unsigned)(SG2_PROP_TYPES_COUNT__ * tsz));
+ FOR_EACH(i, 0, tsz) {
+ int p;
+ fprintf(stream, " ");
+ FOR_EACH(p, 0, SG2_PROP_TYPES_COUNT__) {
+ if(segments[i].properties[p] == SG2_UNDEFINED_PROPERTY)
+ fprintf(stream, " SG2_UNDEFINED_PROPERTY");
+ else fprintf(stream," %u", segments[i].properties[p]);
+ if(i < tsz-1 || p < 2) fprintf(stream, ",");
+ if(p == 2) fprintf(stream, "\n");
+ }
+ }
+ fprintf(stream,
+ "};\n");
+
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+res_T
+sg2_geometry_ref_get(struct sg2_geometry* geom)
+{
+ if(!geom) return RES_BAD_ARG;
+ ref_get(&geom->ref);
+ return RES_OK;
+}
+
+res_T
+sg2_geometry_ref_put(struct sg2_geometry* geom)
+{
+ if(!geom) return RES_BAD_ARG;
+ ref_put(&geom->ref, geometry_release);
+ return RES_OK;
+}
diff --git a/src/sg2_geometry.h b/src/sg2_geometry.h
@@ -0,0 +1,275 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#ifndef SG2_GEOMETRY_H__
+#define SG2_GEOMETRY_H__
+
+#include "sg2.h"
+#include "sg2_misc.h"
+
+#include <rsys/ref_count.h>
+#include <rsys/dynamic_array.h>
+#include <rsys/hash_table.h>
+
+/* Forward declaration of external opaque data types */
+
+/*******************************************************************************
+ * A type to store segments
+ ******************************************************************************/
+struct segment {
+ unsigned vertex_ids[2];
+ /* FRONT/BACK/INTERFACE property */
+ unsigned properties[SG2_PROP_TYPES_COUNT__];
+ /* ID of the segment in user world, i.e. without deduplication */
+ unsigned user_id;
+};
+#define SEG_UNDEF__ {\
+ { SG2_UNDEFINED_PROPERTY, SG2_UNDEFINED_PROPERTY },\
+ { SG2_UNDEFINED_PROPERTY, SG2_UNDEFINED_PROPERTY, SG2_UNDEFINED_PROPERTY },\
+ SG2_UNDEFINED_PROPERTY\
+}
+#define DARRAY_NAME segment
+#define DARRAY_DATA struct segment
+#include <rsys/dynamic_array.h>
+
+/*******************************************************************************
+ * A type to store vertices
+ ******************************************************************************/
+struct vertex {
+ double coord[2];
+};
+#define DARRAY_NAME vertex
+#define DARRAY_DATA struct vertex
+#include <rsys/dynamic_array.h>
+
+/*******************************************************************************
+ * A type to map segment vertices to IDs in unique_segments
+ ******************************************************************************/
+struct unsigned2 { unsigned x[2]; };
+
+static FINLINE int
+seg_key_eq(const struct unsigned2* k1, const struct unsigned2* k2)
+{
+ ASSERT(k1 && k2 && k1->x[0] < k1->x[1] && k2->x[0] < k2->x[1]);
+ return (k1->x[0] == k2->x[0]) && (k1->x[1] == k2->x[1]);
+}
+
+#define HTABLE_NAME seg
+#define HTABLE_KEY struct unsigned2
+#define HTABLE_DATA unsigned
+#define HTABLE_KEY_FUNCTOR_EQ seg_key_eq
+#include <rsys/hash_table.h>
+
+ /*******************************************************************************
+ * A type to map vertex coordinates to IDs in unique_vertices
+ ******************************************************************************/
+static FINLINE int
+vrtx_eq(const struct vertex* v1, const struct vertex* v2)
+{
+ int i;
+ ASSERT(v1 && v2);
+ FOR_EACH(i, 0, 2) if(v1->coord[i] != v2->coord[i]) return 0;
+ return 1;
+}
+
+#define HTABLE_NAME vrtx
+#define HTABLE_KEY struct vertex
+#define HTABLE_DATA unsigned
+#define HTABLE_KEY_FUNCTOR_EQ vrtx_eq
+#include <rsys/hash_table.h>
+
+/*******************************************************************************
+ * Types to record sources and values of segment descriptions.
+ ******************************************************************************/
+
+ /* A type to store a value and the files defining this value
+ * (usualy a single file) */
+struct definition {
+ /* The value */
+ unsigned property_value;
+ /* The IDs of the geometry sets that defined the value */
+ struct darray_uint set_ids;
+};
+
+static FINLINE void
+init_definition
+ (struct mem_allocator* alloc,
+ struct definition* data)
+{
+ ASSERT(alloc && data);
+ data->property_value = SG2_UNDEFINED_PROPERTY;
+ darray_uint_init(alloc, &data->set_ids);
+}
+
+static INLINE res_T
+copy_definition
+ (struct definition* dst,
+ const struct definition* src)
+{
+ res_T res = RES_OK;
+ ASSERT(dst && src);
+ dst->property_value = src->property_value;
+ ERR(darray_uint_copy(&dst->set_ids, &src->set_ids));
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+static FINLINE void
+release_definition
+ (struct definition* data)
+{
+ ASSERT(data);
+ darray_uint_release(&data->set_ids);
+}
+
+#define DARRAY_NAME definition
+#define DARRAY_DATA struct definition
+#define DARRAY_FUNCTOR_INIT init_definition
+#define DARRAY_FUNCTOR_COPY copy_definition
+#define DARRAY_FUNCTOR_RELEASE release_definition
+#include <rsys/dynamic_array.h>
+
+/* A type to accumulate information for a segment.
+ * If there is more than 1 definition / field, it is a conflict */
+struct seg_descriptions {
+ struct darray_definition defs[SG2_PROP_TYPES_COUNT__];
+ int merge_conflict;
+ int properties_conflict;
+ char defs_include_undefined;
+ char property_defined[SG2_PROP_TYPES_COUNT__];
+};
+
+static FINLINE void
+init_seg_descriptions
+ (struct mem_allocator* alloc,
+ struct seg_descriptions* data)
+{
+ int i;
+ ASSERT(alloc && data);
+ FOR_EACH(i, 0, SG2_PROP_TYPES_COUNT__)
+ darray_definition_init(alloc, data->defs + i);
+ data->merge_conflict = 0;
+ data->properties_conflict = 0;
+ data->defs_include_undefined = 0;
+ FOR_EACH(i, 0, SG2_PROP_TYPES_COUNT__)
+ data->property_defined[i] = 0;
+}
+
+static INLINE res_T
+copy_seg_descriptions
+ (struct seg_descriptions* dst,
+ const struct seg_descriptions* src)
+{
+ res_T res = RES_OK;
+ int i;
+ ASSERT(dst && src);
+ FOR_EACH(i, 0, SG2_PROP_TYPES_COUNT__)
+ ERR(darray_definition_copy(&dst->defs[i], &src->defs[i]));
+ dst->merge_conflict = src->merge_conflict;
+ dst->properties_conflict = src->properties_conflict;
+ dst->defs_include_undefined = src->defs_include_undefined;
+ FOR_EACH(i, 0, SG2_PROP_TYPES_COUNT__)
+ dst->property_defined[i] = src->property_defined[i];
+exit:
+ return res;
+error:
+ goto exit;
+}
+
+static FINLINE void
+release_seg_descriptions
+ (struct seg_descriptions* data)
+{
+ int i;
+ ASSERT(data);
+ FOR_EACH(i, 0, SG2_PROP_TYPES_COUNT__)
+ darray_definition_release(data->defs + i);
+}
+
+#define DARRAY_NAME seg_descriptions
+#define DARRAY_DATA struct seg_descriptions
+#define DARRAY_FUNCTOR_INIT init_seg_descriptions
+#define DARRAY_FUNCTOR_COPY copy_seg_descriptions
+#define DARRAY_FUNCTOR_RELEASE release_seg_descriptions
+#include <rsys/dynamic_array.h>
+
+/*******************************************************************************
+ * A type to store interface IDs, as star-enclosures doesn't manage them.
+ ******************************************************************************/
+static FINLINE void
+init_seg_intfaceid
+ (struct mem_allocator* alloc,
+ unsigned* data)
+{
+ ASSERT(data); (void)alloc;
+ *data = SG2_UNDEFINED_PROPERTY;
+}
+
+#define DARRAY_NAME intface_id
+#define DARRAY_DATA unsigned
+#define DARRAY_FUNCTOR_INIT init_seg_intfaceid
+#include <rsys/dynamic_array.h>
+
+/*******************************************************************************
+ * Types to store geometry amid sg2_geometry_add calls.
+ ******************************************************************************/
+struct sg2_geometry {
+ /* Record unique (i.e. deduplicated) segments */
+ struct darray_segment unique_segments;
+ /* Record coordinates for unique (i.e. deduplicated) vertices */
+ struct darray_vertex unique_vertices;
+
+ /* A table to map segment vertices to IDs in unique_segments */
+ struct htable_seg unique_segments_ids;
+ /* A table to map vertex coordinates to IDs in unique_vertices */
+ struct htable_vrtx unique_vertices_ids;
+
+ /* Record which set defined what */
+ struct darray_seg_descriptions seg_descriptions;
+
+ /* Counts */
+ unsigned set_id;
+ unsigned segment_count_including_duplicates;
+ unsigned sides_with_defined_medium_count;
+ unsigned seg_with_undef_sides_count;
+ unsigned seg_with_undef_intface_count;
+ unsigned merge_conflict_count;
+ unsigned properties_conflict_count;
+
+ struct sg2_device* dev;
+ ref_T ref;
+};
+
+/*******************************************************************************
+ * Local functions
+ ******************************************************************************/
+
+extern res_T
+geometry_register_segment
+ (struct sg2_geometry* geometry,
+ const struct segment* segment,
+ const unsigned segment_unique_id,
+ const unsigned set_id,
+ const int merge_conflict);
+
+/* Add new undefined segment descriptions to a geometry */
+extern res_T
+geometry_enlarge_seg_descriptions
+ (struct sg2_geometry* geom,
+ const size_t sz);
+
+#endif /* SG2_GEOMETRY_H__ */
diff --git a/src/sg2_misc.h b/src/sg2_misc.h
@@ -0,0 +1,21 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#ifndef SG2_MISC_H__
+#define SG2_MISC_H__
+
+#define ERR(Expr) if((res = (Expr)) != RES_OK) goto error;
+
+#endif /* SG2_MISC_H__ */
diff --git a/src/sg2_s2d_helper.h b/src/sg2_s2d_helper.h
@@ -0,0 +1,61 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#ifndef SG2_SENC_HELPER_H__
+#define SG2_SENC_HELPER_H__
+
+#include "sg2.h"
+#include <star/senc2d.h>
+
+#include <rsys/rsys.h>
+#include <rsys/float2.h>
+
+/* Get vertex indices for the iseg_th segment.
+ * Suitable for use as get_indice callback in s2d_mesh_setup_indexed_vertices
+ * calls. */
+static FINLINE void
+sg2_s2d_geometry_get_indices__
+ (const unsigned iseg,
+ unsigned indices[2],
+ void* ctx)
+{
+ const struct sg2_geometry* geometry = ctx;
+ res_T r;
+ ASSERT(indices && geometry);
+ r = sg2_geometry_get_unique_segment_vertices(geometry, iseg, indices);
+ ASSERT(r == RES_OK); (void)r;
+}
+
+/* Get coordinates for the ivert_th vertex.
+ * Suitable for use as s2d_vertex_data getter for S2D_POSITION s2d_attrib_usage
+ * in s2d_mesh_setup_indexed_vertices calls. */
+static FINLINE void
+sg2_s2d_geometry_get_position__
+ (const unsigned ivert,
+ float coord[2],
+ void* ctx)
+{
+ const struct sg2_geometry* geometry = ctx;
+ double tmp[2];
+ res_T r;
+ ASSERT(coord && geometry);
+ r = sg2_geometry_get_unique_vertex(geometry, ivert, tmp);
+ ASSERT(r == RES_OK); (void)r;
+ f2_set_d2(coord, tmp);
+}
+
+END_DECLS
+
+#endif /* SG2_SENC_HELPER_H__ */
diff --git a/src/sg2_senc2d_helper.h b/src/sg2_senc2d_helper.h
@@ -0,0 +1,76 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#ifndef SG2_SENC_HELPER_H__
+#define SG2_SENC_HELPER_H__
+
+#include "sg2.h"
+#include <star/senc2d.h>
+
+#include <rsys/rsys.h>
+
+ /* Get vertex indices for the iseg_th segment.
+ * Suitable for use as get_indices callback in senc2d_scene_create calls. */
+static FINLINE void
+sg2_senc_geometry_get_indices__
+ (const unsigned iseg,
+ unsigned indices[2],
+ void* ctx)
+{
+ const struct sg2_geometry* geometry = ctx;
+ res_T r;
+ ASSERT(indices && geometry);
+ r = sg2_geometry_get_unique_segment_vertices(geometry, iseg, indices);
+ ASSERT(r == RES_OK); (void)r;
+}
+
+/* Get vertex indices for the iseg_th segment.
+ * Suitable for use as get_media callback in senc2d_scene_create calls. */
+static FINLINE void
+sg2_senc_geometry_get_media__
+ (const unsigned iseg,
+ unsigned media[2],
+ void* ctx)
+{
+ const struct sg2_geometry* geometry = ctx;
+ unsigned tmp[SG2_PROP_TYPES_COUNT__];
+ res_T r;
+ ASSERT(media && geometry);
+ r = sg2_geometry_get_unique_segment_properties(geometry, iseg, tmp);
+ ASSERT(r == RES_OK); (void)r;
+ media[SENC2D_FRONT] = (tmp[SG2_FRONT] == SG2_UNDEFINED_PROPERTY)
+ ? SENC2D_UNDEFINED_MEDIUM : tmp[SG2_FRONT];
+ media[SENC2D_BACK] = (tmp[SG2_BACK] == SG2_UNDEFINED_PROPERTY)
+ ? SENC2D_UNDEFINED_MEDIUM : tmp[SG2_BACK];
+}
+
+/* Get vertex indices for the iseg_th segment.
+ * Suitable for use as get_position callback in senc2d_scene_create calls. */
+static FINLINE void
+sg2_senc_geometry_get_position__
+ (const unsigned ivert,
+ double coord[2],
+ void* ctx)
+{
+ const struct sg2_geometry* geometry = ctx;
+ res_T r;
+ ASSERT(coord && geometry);
+ r = sg2_geometry_get_unique_vertex(geometry, ivert, coord);
+ ASSERT(r == RES_OK); (void)r;
+}
+
+END_DECLS
+
+#endif /* SG2_SENC_HELPER_H__ */
diff --git a/src/test_sg2_device.c b/src/test_sg2_device.c
@@ -0,0 +1,75 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "test_sg2_utils.h"
+
+#include <rsys/logger.h>
+
+static INLINE void
+log_stream(const char* msg, void* ctx)
+{
+ ASSERT(msg);
+ (void) msg, (void) ctx;
+ printf("%s\n", msg);
+}
+
+int
+main(int argc, char** argv)
+{
+ struct logger logger;
+ struct mem_allocator allocator;
+ struct sg2_device* dev;
+ (void)argc, (void)argv;
+
+ BA(sg2_device_create(NULL, NULL, 0, NULL));
+ OK(sg2_device_create(NULL, NULL, 0, &dev));
+ BA(sg2_device_ref_get(NULL));
+ OK(sg2_device_ref_get(dev));
+ BA(sg2_device_ref_put(NULL));
+ OK(sg2_device_ref_put(dev));
+ OK(sg2_device_ref_put(dev));
+
+ OK(mem_init_proxy_allocator(&allocator, &mem_default_allocator));
+
+ CHK(MEM_ALLOCATED_SIZE(&allocator) == 0);
+ BA(sg2_device_create(NULL, &allocator, 0, NULL));
+ OK(sg2_device_create(NULL, &allocator, 0, &dev));
+ OK(sg2_device_ref_put(dev));
+ CHK(MEM_ALLOCATED_SIZE(&allocator) == 0);
+
+ OK(logger_init(&allocator, &logger));
+ logger_set_stream(&logger, LOG_OUTPUT, log_stream, NULL);
+ logger_set_stream(&logger, LOG_ERROR, log_stream, NULL);
+ logger_set_stream(&logger, LOG_WARNING, log_stream, NULL);
+
+ BA(sg2_device_create(&logger, NULL, 0, NULL));
+ OK(sg2_device_create(&logger, NULL, 1, &dev));
+ OK(sg2_device_ref_put(dev));
+
+ BA(sg2_device_create(&logger, &allocator, 0, NULL));
+ OK(sg2_device_create(&logger, &allocator, 0, &dev));
+ OK(sg2_device_ref_put(dev));
+
+ OK(sg2_device_create(&logger, &allocator, 0, &dev));
+ OK(sg2_device_ref_put(dev));
+
+ logger_release(&logger);
+ check_memory_allocator(&allocator);
+ mem_shutdown_proxy_allocator(&allocator);
+ CHK(mem_allocated_size() == 0);
+ return 0;
+}
+
diff --git a/src/test_sg2_geometry.c b/src/test_sg2_geometry.c
@@ -0,0 +1,293 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "test_sg2_utils.h"
+
+#include <stdio.h>
+
+static res_T
+validate
+ (const unsigned iseg,
+ const unsigned properties[SG2_PROP_TYPES_COUNT__],
+ void* context,
+ int* properties_conflict)
+{
+ (void)iseg; (void)properties; (void)context;
+ *properties_conflict = 0;
+ return RES_OK;
+}
+
+static res_T
+merge_seg
+ (const unsigned user_id,
+ const unsigned iseg,
+ const int reversed_segment,
+ unsigned segment_properties[SG2_PROP_TYPES_COUNT__],
+ const unsigned merged_properties[SG2_PROP_TYPES_COUNT__],
+ void* context,
+ int* merge_conflict)
+{
+ ASSERT(segment_properties && merged_properties && merge_conflict);
+ (void)user_id; (void)reversed_segment; (void)context;
+ (void)segment_properties; (void)merged_properties; (void)merge_conflict;
+ *merge_conflict = (int)iseg;
+ return RES_OK;
+}
+
+static res_T
+degenerated_segment
+ (const unsigned iseg,
+ void* context,
+ int* abort)
+{
+ struct context* ctx = context;
+ ASSERT(abort && ctx);
+ (void)iseg;
+ *abort = *(int*)ctx->custom;
+ return RES_OK;
+}
+
+int
+main(int argc, char** argv)
+{
+ struct mem_allocator allocator;
+ struct sg2_device* dev;
+ struct sg2_geometry* geom;
+ double coord[2];
+ unsigned indices[2];
+ unsigned degenerated[2] = { 0, 0 };
+ unsigned properties[SG2_PROP_TYPES_COUNT__];
+ struct sg2_geometry_add_callbacks callbacks = SG2_ADD_CALLBACKS_NULL__;
+ unsigned user_id;
+ unsigned count, i;
+ struct context ctx = CONTEXT_NULL__;
+ (void)argc, (void)argv;
+
+ OK(mem_init_proxy_allocator(&allocator, &mem_default_allocator));
+ OK(sg2_device_create(NULL, &allocator, 1, &dev));
+
+ BA(sg2_geometry_create(NULL, &geom));
+ BA(sg2_geometry_create(dev, NULL));
+ OK(sg2_geometry_create(dev, &geom));
+
+ BA(sg2_geometry_ref_get(NULL));
+ OK(sg2_geometry_ref_get(geom));
+
+ BA(sg2_geometry_ref_put(NULL));
+ OK(sg2_geometry_ref_put(geom));
+ OK(sg2_geometry_ref_put(geom));
+
+ OK(sg2_geometry_create(dev, &geom));
+
+ BA(sg2_geometry_validate_properties(NULL, NULL, NULL));
+ BA(sg2_geometry_validate_properties(geom, NULL, NULL));
+ BA(sg2_geometry_validate_properties(NULL, validate, NULL));
+ OK(sg2_geometry_validate_properties(geom, validate, NULL));
+
+ BA(sg2_geometry_get_unique_vertices_count(NULL, NULL));
+ BA(sg2_geometry_get_unique_vertices_count(geom, NULL));
+ BA(sg2_geometry_get_unique_vertices_count(NULL, &count));
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+
+ BA(sg2_geometry_get_added_segments_count(NULL, NULL));
+ BA(sg2_geometry_get_added_segments_count(geom, NULL));
+ BA(sg2_geometry_get_added_segments_count(NULL, &count));
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+
+ BA(sg2_geometry_get_unique_segments_count(NULL, NULL));
+ BA(sg2_geometry_get_unique_segments_count(geom, NULL));
+ BA(sg2_geometry_get_unique_segments_count(NULL, &count));
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+
+ BA(sg2_geometry_get_segment_with_undefined_side_count(NULL, NULL));
+ BA(sg2_geometry_get_segment_with_undefined_side_count(geom, NULL));
+ BA(sg2_geometry_get_segment_with_undefined_side_count(NULL, &count));
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+
+ BA(sg2_geometry_get_segment_with_undefined_interface_count(NULL, NULL));
+ BA(sg2_geometry_get_segment_with_undefined_interface_count(geom, NULL));
+ BA(sg2_geometry_get_segment_with_undefined_interface_count(NULL, &count));
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+
+ BA(sg2_geometry_get_merge_conflict_count(NULL, NULL));
+ BA(sg2_geometry_get_merge_conflict_count(geom, NULL));
+ BA(sg2_geometry_get_merge_conflict_count(NULL, &count));
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+
+ BA(sg2_geometry_get_properties_conflict_count(NULL, NULL));
+ BA(sg2_geometry_get_properties_conflict_count(geom, NULL));
+ BA(sg2_geometry_get_properties_conflict_count(NULL, &count));
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+
+ BA(sg2_geometry_dump_as_obj(NULL, NULL, 0));
+ BA(sg2_geometry_dump_as_obj(geom, NULL, 0));
+ BA(sg2_geometry_dump_as_obj(NULL, stdout, 0));
+ BA(sg2_geometry_dump_as_obj(NULL, NULL, SG2_ALL_SEGMENTS));
+ BA(sg2_geometry_dump_as_obj(geom, stdout, 0));
+ BA(sg2_geometry_dump_as_obj(geom, NULL, SG2_ALL_SEGMENTS));
+ BA(sg2_geometry_dump_as_obj(NULL, stdout, SG2_ALL_SEGMENTS));
+ /* BA because geometry is empty */
+ BA(sg2_geometry_dump_as_obj(geom, stdout, SG2_ALL_SEGMENTS));
+
+ BA(sg2_geometry_dump_as_vtk(NULL, NULL));
+ BA(sg2_geometry_dump_as_vtk(geom, NULL));
+ BA(sg2_geometry_dump_as_vtk(NULL, stdout));
+ /* BA because geometry is empty */
+ BA(sg2_geometry_dump_as_vtk(geom, stdout));
+
+ BA(sg2_geometry_dump_as_C_code(NULL, NULL, NULL, 0));
+ BA(sg2_geometry_dump_as_C_code(geom, NULL, NULL, 0));
+ BA(sg2_geometry_dump_as_C_code(NULL, stdout, NULL, 0));
+ BA(sg2_geometry_dump_as_C_code(NULL, NULL, "test", 0));
+ BA(sg2_geometry_dump_as_C_code(geom, NULL, "test", 0));
+ BA(sg2_geometry_dump_as_C_code(NULL, stdout, "test", 0));
+ /* BA because geometry is empty */
+ BA(sg2_geometry_dump_as_C_code(geom, stdout, NULL, 0));
+ BA(sg2_geometry_dump_as_C_code(geom, stdout, "test", 0));
+
+ BA(sg2_geometry_add(NULL, 0, 0, &callbacks, NULL));
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 0);
+ BA(sg2_geometry_add(geom, nsegments, nvertices, NULL, NULL));
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == nsegments);
+ /* Mandatory callbacks are NULL */
+ callbacks.get_indices = NULL;
+ callbacks.get_position = get_position;
+ BA(sg2_geometry_add(geom, 0, 0, &callbacks, NULL));
+ callbacks.get_indices = get_indices;
+ callbacks.get_position = NULL;
+ BA(sg2_geometry_add(geom, 0, 0, &callbacks, NULL));
+ callbacks.get_indices = NULL;
+ callbacks.get_position = NULL;
+ BA(sg2_geometry_add(geom, 0, 0, &callbacks, NULL));
+ /* Add 0 items */
+ callbacks.get_indices = get_indices;
+ callbacks.get_position = get_position;
+ OK(sg2_geometry_add(geom, 0, 0, &callbacks, NULL));
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == nsegments);
+
+ /* A 2D square.
+ * 2 enclosures (inside, outside) sharing the same segments,
+ * but opposite sides */
+ ctx.positions = square_vertices;
+ ctx.indices = box_indices;
+ ctx.front_media = medium0;
+ ctx.back_media = medium1;
+ ctx.intface = intface0;
+
+ callbacks.get_indices = get_indices;
+ callbacks.get_properties = get_properties;
+ callbacks.get_position = get_position;
+
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ OK(sg2_geometry_dump_as_obj(geom, stdout, SG2_ALL_SEGMENTS));
+ OK(sg2_geometry_dump_as_vtk(geom, stdout));
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, NULL, 0));
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "test",
+ SG2_CDUMP_STATIC | SG2_CDUMP_CONST));
+
+ BA(sg2_geometry_get_unique_vertex(NULL, nsegments, NULL));
+ BA(sg2_geometry_get_unique_vertex(geom, nsegments, NULL));
+ BA(sg2_geometry_get_unique_vertex(NULL, 0, NULL));
+ BA(sg2_geometry_get_unique_vertex(NULL, nsegments, coord));
+ BA(sg2_geometry_get_unique_vertex(geom, 0, NULL));
+ BA(sg2_geometry_get_unique_vertex(geom, nsegments, coord));
+ BA(sg2_geometry_get_unique_vertex(NULL, 0, coord));
+ OK(sg2_geometry_get_unique_vertex(geom, 0, coord));
+
+ BA(sg2_geometry_get_unique_segment_vertices(NULL, nsegments, NULL));
+ BA(sg2_geometry_get_unique_segment_vertices(geom, nsegments, NULL));
+ BA(sg2_geometry_get_unique_segment_vertices(NULL, 0, NULL));
+ BA(sg2_geometry_get_unique_segment_vertices(NULL, nsegments, indices));
+ BA(sg2_geometry_get_unique_segment_vertices(geom, 0, NULL));
+ BA(sg2_geometry_get_unique_segment_vertices(geom, nsegments, indices));
+ BA(sg2_geometry_get_unique_segment_vertices(NULL, 0, indices));
+ OK(sg2_geometry_get_unique_segment_vertices(geom, 0, indices));
+ FOR_EACH(i, 0 , 2) CHK(indices[i] == box_indices[i]);
+
+ BA(sg2_geometry_get_unique_segment_properties(NULL, nsegments, NULL));
+ BA(sg2_geometry_get_unique_segment_properties(geom, nsegments, NULL));
+ BA(sg2_geometry_get_unique_segment_properties(NULL, 0, NULL));
+ BA(sg2_geometry_get_unique_segment_properties(NULL, nsegments, properties));
+ BA(sg2_geometry_get_unique_segment_properties(geom, 0, NULL));
+ BA(sg2_geometry_get_unique_segment_properties(geom, nsegments, properties));
+ BA(sg2_geometry_get_unique_segment_properties(NULL, 0, properties));
+ OK(sg2_geometry_get_unique_segment_properties(geom, 0, properties));
+ CHK(medium0[0] == properties[SG2_FRONT]);
+ CHK(medium1[0] == properties[SG2_BACK]);
+ CHK(intface0[0] == properties[SG2_INTFACE]);
+
+ BA(sg2_geometry_get_unique_segment_user_id(NULL, nsegments, NULL));
+ BA(sg2_geometry_get_unique_segment_user_id(geom, nsegments, NULL));
+ BA(sg2_geometry_get_unique_segment_user_id(NULL, 0, NULL));
+ BA(sg2_geometry_get_unique_segment_user_id(NULL, nsegments, &user_id));
+ BA(sg2_geometry_get_unique_segment_user_id(geom, 0, NULL));
+ BA(sg2_geometry_get_unique_segment_user_id(geom, nsegments, &user_id));
+ BA(sg2_geometry_get_unique_segment_user_id(NULL, 0, &user_id));
+ OK(sg2_geometry_get_unique_segment_user_id(geom, 0, &user_id));
+ /* Due to a failed attempt to add nsegments segments, user_id for the
+ * first successfully added segment is shifted */
+ CHK(user_id == nsegments);
+
+ /* Conflicts with merge_seg callback */
+ callbacks.merge_segment = merge_seg;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ /* Due to merge_seg internals, all but the first segment have conflict */
+ CHK(count == nsegments - 1);
+ OK(sg2_geometry_dump_as_obj(geom, stdout, SG2_ALL_SEGMENTS));
+ OK(sg2_geometry_dump_as_vtk(geom, stdout));
+ /* BA because of conflicts */
+ BA(sg2_geometry_dump_as_C_code(geom, stdout, "test", SG2_CDUMP_STATIC));
+ OK(sg2_geometry_ref_put(geom));
+
+ /* Conflicts without merge_seg callback */
+ OK(sg2_geometry_create(dev, &geom));
+ callbacks.merge_segment = NULL;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ ctx.front_media = medium1_top0;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ FOR_EACH(i, 0, nsegments) if(medium0[i] != medium1_top0[i]) count--;
+ CHK(count == 0);
+ OK(sg2_geometry_dump_as_obj(geom, stdout, SG2_ALL_SEGMENTS));
+ OK(sg2_geometry_dump_as_vtk(geom, stdout));
+ /* BA because of conflicts */
+ BA(sg2_geometry_dump_as_C_code(geom, stdout, "test", SG2_CDUMP_CONST));
+
+ /* Degenerated segments */
+ ctx.indices = degenerated;
+ /* Without callback : OK */
+ OK(sg2_geometry_add(geom, 1, nvertices, &callbacks, &ctx));
+ /* With callback : OK */
+ callbacks.degenerated_segment = degenerated_segment;
+ ctx.custom = &i;
+ i = 0;
+ OK(sg2_geometry_add(geom, 1, nvertices, &callbacks, &ctx));
+ /* With callback : KO */
+ i= 1;
+ BA(sg2_geometry_add(geom, 1, nvertices, &callbacks, &ctx));
+
+ OK(sg2_geometry_ref_put(geom));
+ OK(sg2_device_ref_put(dev));
+
+ check_memory_allocator(&allocator);
+ mem_shutdown_proxy_allocator(&allocator);
+ CHK(mem_allocated_size() == 0);
+ return 0;
+}
diff --git a/src/test_sg2_geometry_2.c b/src/test_sg2_geometry_2.c
@@ -0,0 +1,438 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "test_sg2_utils.h"
+
+#include <stdio.h>
+
+ /* Manage add_geometry behaviour */
+struct add_geom_ctx {
+ unsigned add_cpt, merge_cpt;
+ res_T add_res, merge_res;
+};
+
+static res_T
+add_seg
+ (const unsigned unique_id,
+ const unsigned iseg,
+ void* context)
+{
+ struct context* ctx = context;
+ struct add_geom_ctx* add_geom_ctx;
+ ASSERT(ctx); (void)unique_id; (void)iseg;
+ add_geom_ctx = ctx->custom;
+ if(add_geom_ctx->add_res == RES_OK) ++add_geom_ctx->add_cpt;
+ return add_geom_ctx->add_res;
+}
+
+static res_T
+merge_seg
+ (const unsigned unique_id,
+ const unsigned iseg,
+ const int reversed_segment,
+ unsigned segment_properties[SG2_PROP_TYPES_COUNT__],
+ const unsigned merged_properties[SG2_PROP_TYPES_COUNT__],
+ void* context,
+ int* merge_conflict)
+{
+ struct context* ctx = context;
+ struct add_geom_ctx* add_geom_ctx;
+ int i;
+ ASSERT(ctx && segment_properties && merged_properties && merge_conflict);
+ (void)unique_id; (void)iseg; (void)reversed_segment;
+ (void)segment_properties; (void)merged_properties;
+ add_geom_ctx = ctx->custom;
+ if(add_geom_ctx->merge_res == RES_OK) ++add_geom_ctx->merge_cpt;
+ FOR_EACH(i, 0, SG2_PROP_TYPES_COUNT__)
+ if(!sg2_compatible_property(segment_properties[i], merged_properties[i]))
+ *merge_conflict = 1;
+ return add_geom_ctx->merge_res;
+}
+
+static res_T
+validate
+ (const unsigned iseg,
+ const unsigned properties[SG2_PROP_TYPES_COUNT__],
+ void* context,
+ int* properties_conflict)
+{
+ (void)iseg; (void)properties; (void)context;
+ *properties_conflict = 0;
+ return RES_OK;
+}
+
+static res_T
+validate2
+ (const unsigned iseg,
+ const unsigned properties[SG2_PROP_TYPES_COUNT__],
+ void* context,
+ int* properties_conflict)
+{
+ (void)iseg; (void)properties; (void)context;
+ *properties_conflict = (iseg % 2 == 0) ? 0 : (int)iseg;
+ return RES_OK;
+}
+
+int
+main(int argc, char** argv)
+{
+ struct mem_allocator allocator;
+ struct sg2_device* dev;
+ struct sg2_geometry* geom;
+ struct context ctx = CONTEXT_NULL__;
+ struct sg2_geometry_add_callbacks callbacks = SG2_ADD_CALLBACKS_NULL__;
+ struct add_geom_ctx add_geom_ctx;
+ unsigned property[12];
+ unsigned i;
+ const unsigned property_count = sizeof(property) / sizeof(*property);
+ unsigned count;
+ (void)argc, (void)argv;
+
+ OK(mem_init_proxy_allocator(&allocator, &mem_default_allocator));
+ OK(sg2_device_create(NULL, &allocator, 1, &dev));
+ OK(sg2_geometry_create(dev, &geom));
+
+ /* A 2D square.
+ * 2 enclosures (inside, outside) sharing the same segments,
+ * but opposite sides */
+ ctx.positions = square_vertices;
+ ctx.indices = box_indices;
+ ctx.custom = &add_geom_ctx;
+
+ add_geom_ctx.add_cpt = add_geom_ctx.merge_cpt = 0;
+ add_geom_ctx.add_res = add_geom_ctx.merge_res = RES_OK;
+
+ /* Geometry with no media information on both sides */
+ for(i = 0; i < property_count; i++) property[i] = SG2_UNDEFINED_PROPERTY;
+ ctx.front_media = property;
+ ctx.back_media = property;
+ ctx.intface = property;
+
+ callbacks.get_indices = get_indices;
+ callbacks.get_properties = get_properties;
+ callbacks.get_position = get_position;
+ callbacks.add_segment = add_seg;
+ callbacks.merge_segment = merge_seg;
+
+ /* If add fails, add geometry fails the same way */
+ add_geom_ctx.add_res = RES_BAD_ARG;
+
+ BA(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.add_cpt == 0);
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == 0);
+ add_geom_ctx.add_res = RES_MEM_ERR;
+ ME(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.add_cpt == 0);
+ CHK(count == 0);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 2 * nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ /* Successful add geometry with add callback */
+ add_geom_ctx.add_res = RES_OK;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.add_cpt == nsegments);
+ CHK(add_geom_ctx.merge_cpt == 0);
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 3 * nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "test_undefined",
+ SG2_CDUMP_STATIC | SG2_CDUMP_CONST));
+
+ /* Clear geometry */
+ SG2(geometry_ref_put(geom));
+ OK(sg2_geometry_create(dev, &geom));
+
+ /* Successful add geometry without add callback */
+ add_geom_ctx.add_cpt = 0;
+ callbacks.add_segment = NULL;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.add_cpt == 0);
+ CHK(add_geom_ctx.merge_cpt == 0);
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ /* If merge fails, add geometry fails the same way */
+ add_geom_ctx.merge_res = RES_BAD_ARG;
+ callbacks.add_segment = add_seg;
+ BA(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.merge_cpt == 0);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 2 * nsegments);
+ add_geom_ctx.merge_res = RES_MEM_ERR;
+ ME(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.merge_cpt == 0);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 3 * nsegments);
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0); /* merge failed but with a no-conflict status */
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ /* Successful add geometry without merge callback */
+ callbacks.merge_segment = NULL;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.merge_cpt == 0);
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 4 * nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ /* Successful add geometry with merge callback */
+ add_geom_ctx.merge_res = RES_OK;
+ callbacks.merge_segment = merge_seg;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.merge_cpt == nsegments);
+ add_geom_ctx.merge_cpt = 0;
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 5 * nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0); /* merge failed but with a no-conflict status */
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ /* Geometry with media information on both sides */
+ ctx.front_media = medium0;
+ ctx.back_media = medium1;
+
+ /* Clear geometry */
+ SG2(geometry_ref_put(geom));
+ OK(sg2_geometry_create(dev, &geom));
+
+ /* Successful add geometry with add callback
+ * First half of the segments, then all of them */
+ add_geom_ctx.add_res = RES_OK;
+ OK(sg2_geometry_add(geom, nsegments / 2, nvertices, &callbacks, &ctx));
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == nsegments / 2);
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.add_cpt == nsegments);
+ CHK(add_geom_ctx.merge_cpt == nsegments / 2);
+ add_geom_ctx.add_cpt = 0;
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == nsegments + nsegments / 2);
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0); /* media where defined */
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == nsegments); /* interfaces where undefined */
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_dump_as_vtk(geom, stdout));
+ /* Second add was half duplicated, so numbering is shifted */
+ FOR_EACH(i, 0, nsegments) {
+ unsigned id;
+ OK(sg2_geometry_get_unique_segment_user_id(geom, i, &id));
+ CHK(i < nsegments / 2 ? id == i : id == i + nsegments / 2);
+ }
+
+ /* Clear geometry */
+ SG2(geometry_ref_put(geom));
+ OK(sg2_geometry_create(dev, &geom));
+ add_geom_ctx.merge_cpt = 0;
+
+ /* Successful add geometry with add callback and no defined properties */
+ add_geom_ctx.add_res = RES_OK;
+ callbacks.get_properties = NULL;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.add_cpt == nsegments);
+ CHK(add_geom_ctx.merge_cpt == 0);
+ add_geom_ctx.add_cpt = 0;
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == nsegments); /* media where undefined */
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == nsegments); /* interfaces where undefined */
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ /* Define interface */
+ ctx.intface = intface0;
+
+ /* Successful add geometry with merge callback and properties */
+ add_geom_ctx.merge_res = RES_OK;
+ callbacks.get_properties = get_properties;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.merge_cpt == nsegments);
+ add_geom_ctx.merge_cpt = 0;
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 2 * nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0); /* media where defined */
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0); /* interfaces where defined */
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ /* Geometry with incompatible media information on both sides */
+ ctx.front_media = medium1;
+ ctx.back_media = medium0;
+
+ /* Add geometry without merge callback and conflicts */
+ callbacks.merge_segment = NULL;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.merge_cpt == 0);
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 3 * nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0); /* media where defined */
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0); /* interfaces where defined */
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ /* Incompatible interface */
+ ctx.intface = intface1;
+
+ /* Successful add geometry with merge callback */
+ add_geom_ctx.merge_res = RES_OK;
+ callbacks.merge_segment = merge_seg;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ CHK(add_geom_ctx.merge_cpt == nsegments);
+ add_geom_ctx.merge_cpt = 0;
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 4 * nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0); /* media where defined */
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0); /* interfaces where defined */
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ /* Clear geometry */
+ SG2(geometry_ref_put(geom));
+ OK(sg2_geometry_create(dev, &geom));
+
+ /* Successful add geometry with merge callback */
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ OK(sg2_geometry_validate_properties(geom, validate, NULL));
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_dump_as_obj(geom, stdout, SG2_ALL_SEGMENTS));
+
+ OK(sg2_geometry_validate_properties(geom, validate, NULL));
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+
+ OK(sg2_geometry_validate_properties(geom, validate2, NULL));
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == nsegments / 2);
+
+ OK(sg2_geometry_ref_put(geom));
+ OK(sg2_device_ref_put(dev));
+
+ check_memory_allocator(&allocator);
+ mem_shutdown_proxy_allocator(&allocator);
+ CHK(mem_allocated_size() == 0);
+ return 0;
+}
diff --git a/src/test_sg2_many_enclosures.c b/src/test_sg2_many_enclosures.c
@@ -0,0 +1,103 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "test_sg2_utils.h"
+#include "test_sg2_utils2.h"
+
+#include <rsys/double2.h>
+
+#include <stdio.h>
+#include <limits.h>
+
+#define NB_CIRC_X 64
+#define NB_CIRC_Y 64
+#define NB_CIRC_Z 64
+#define NB_CIRC (NB_CIRC_X * NB_CIRC_Y * NB_CIRC_Z)
+
+int
+main(int argc, char** argv)
+{
+ struct mem_allocator allocator;
+ struct sg2_device* dev;
+ struct sg2_geometry* geom;
+ struct sg2_geometry_add_callbacks callbacks = SG2_ADD_CALLBACKS_NULL__;
+ unsigned circ_seg_count, circ_vrtx_count, count;
+ int i, j, k;
+ unsigned m_in, m_out, itf = 0;
+ struct context ctx = CONTEXT_NULL__;
+ (void)argc, (void)argv;
+
+ OK(mem_init_proxy_allocator(&allocator, &mem_default_allocator));
+ OK(sg2_device_create(NULL, &allocator, 1, &dev));
+ OK(sg2_geometry_create(dev, &geom));
+ SG2(device_ref_put(dev));
+
+ callbacks.get_indices = get_indices;
+ callbacks.get_position = get_position;
+ callbacks.get_properties = get_uniform_properties;
+
+ ctx.front_media = &m_in;
+ ctx.back_media = &m_out;
+ ctx.intface = &itf;
+
+ /* A 16 segments circle template */
+ create_circle(1, 16, &ctx);
+ ASSERT(sa_size(ctx.positions) % 2 == 0
+ && sa_size(ctx.positions) / 2 < UINT_MAX);
+ ASSERT(sa_size(ctx.indices) % 2 == 0
+ && sa_size(ctx.indices) / 2 < UINT_MAX);
+ circ_seg_count = (unsigned)sa_size(ctx.indices) / 2;
+ circ_vrtx_count = (unsigned)sa_size(ctx.positions) / 2;
+ OK(sg2_geometry_reserve(geom, NB_CIRC * circ_vrtx_count,
+ NB_CIRC * circ_seg_count, 0));
+ FOR_EACH(i, 0, NB_CIRC_X) {
+ double center_x = 2 * (1 + NB_CIRC_X) * (i - NB_CIRC_X / 2);
+ FOR_EACH(j, 0, NB_CIRC_Y) {
+ double center_y = 2 * (1 + NB_CIRC_Y) * (j - NB_CIRC_Y / 2);
+ double misalignment = 0;
+ FOR_EACH(k, 0, NB_CIRC_Z) {
+ m_in = (unsigned)k;
+ m_out = (unsigned)(k + 1);
+ ctx.scale = k + 1;
+#ifdef MITIGATE_EMBREE_181
+ /* Mitigate Embree issue #181
+ * We cannot keep perfect alignment of circles
+ * or some hits are missed in some raytracing tasks */
+ misalignment = (k % 2) ? -0.01 : +0.01;
+#endif
+ d2(ctx.offset, center_x + misalignment, center_y + misalignment);
+ OK(sg2_geometry_add(geom, circ_seg_count, circ_vrtx_count, &callbacks,
+ &ctx));
+ }
+ }
+ }
+ circle_release(&ctx);
+
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_dump_as_obj(geom, stdout, SG2_ALL_SEGMENTS));
+
+ SG2(geometry_ref_put(geom));
+
+ check_memory_allocator(&allocator);
+ mem_shutdown_proxy_allocator(&allocator);
+ CHK(mem_allocated_size() == 0);
+ return 0;
+}
+\ No newline at end of file
diff --git a/src/test_sg2_many_segments.c b/src/test_sg2_many_segments.c
@@ -0,0 +1,84 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "test_sg2_utils.h"
+#include "test_sg2_utils2.h"
+
+#include <rsys/double2.h>
+
+#include <stdio.h>
+#include <limits.h>
+
+#define NB_CIRC 4
+
+int
+main(int argc, char** argv)
+{
+ struct mem_allocator allocator;
+ struct sg2_device* dev;
+ struct sg2_geometry* geom;
+ struct sg2_geometry_add_callbacks callbacks = SG2_ADD_CALLBACKS_NULL__;
+ unsigned circ_seg_count, circ_vrtx_count, i, count;
+ unsigned m0 = 0, m1, itf = 0;
+ struct context ctx = CONTEXT_NULL__;
+ (void)argc, (void)argv;
+
+ OK(mem_init_proxy_allocator(&allocator, &mem_default_allocator));
+ OK(sg2_device_create(NULL, &allocator, 1, &dev));
+ OK(sg2_geometry_create(dev, &geom));
+ SG2(device_ref_put(dev));
+
+ callbacks.get_indices = get_indices;
+ callbacks.get_position = get_position;
+ callbacks.get_properties = get_uniform_properties;
+
+ ctx.front_media = &m1;
+ ctx.back_media = &m0;
+ ctx.intface = &itf;
+
+ /* A 1,048,576 segments circle template */
+ create_circle(1, 1048576, &ctx);
+ ASSERT(sa_size(ctx.positions) % 2 == 0
+ && sa_size(ctx.positions) / 2 < UINT_MAX);
+ ASSERT(sa_size(ctx.indices) % 2 == 0
+ && sa_size(ctx.indices) / 2 < UINT_MAX);
+ circ_seg_count = (unsigned)sa_size(ctx.indices) / 2;
+ circ_vrtx_count = (unsigned)sa_size(ctx.positions) / 2;
+ OK(sg2_geometry_reserve(geom, NB_CIRC * circ_vrtx_count,
+ NB_CIRC * circ_seg_count, 0));
+ FOR_EACH(i, 0, NB_CIRC) {
+ m1 = i;
+ d2(ctx.offset, 0, i * 10);
+ OK(sg2_geometry_add(geom, circ_seg_count, circ_vrtx_count, &callbacks,
+ &ctx));
+ }
+ circle_release(&ctx);
+
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_dump_as_obj(geom, stdout, SG2_ALL_SEGMENTS));
+
+ SG2(geometry_ref_put(geom));
+
+ check_memory_allocator(&allocator);
+ mem_shutdown_proxy_allocator(&allocator);
+ CHK(mem_allocated_size() == 0);
+ return 0;
+}
+\ No newline at end of file
diff --git a/src/test_sg2_some_enclosures.c b/src/test_sg2_some_enclosures.c
@@ -0,0 +1,104 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "test_sg2_utils.h"
+#include "test_sg2_utils2.h"
+
+#include <rsys/double2.h>
+
+#include <stdio.h>
+#include <limits.h>
+
+#define NB_CIRC_X 4
+#define NB_CIRC_Y 4
+#define NB_CIRC_Z 4
+#define NB_CIRC (NB_CIRC_X * NB_CIRC_Y * NB_CIRC_Z)
+
+int
+main(int argc, char** argv)
+{
+ struct mem_allocator allocator;
+ struct sg2_device* dev;
+ struct sg2_geometry* geom;
+ struct sg2_geometry_add_callbacks callbacks = SG2_ADD_CALLBACKS_NULL__;
+ unsigned circ_seg_count, circ_vrtx_count, count;
+ int i, j, k;
+ unsigned m_in, m_out, itf = 0;
+ struct context ctx = CONTEXT_NULL__;
+ (void)argc, (void)argv;
+
+ OK(mem_init_proxy_allocator(&allocator, &mem_default_allocator));
+ OK(sg2_device_create(NULL, &allocator, 1, &dev));
+ OK(sg2_geometry_create(dev, &geom));
+ SG2(device_ref_put(dev));
+
+ callbacks.get_indices = get_indices;
+ callbacks.get_position = get_position;
+ callbacks.get_properties = get_uniform_properties;
+
+ ctx.front_media = &m_in;
+ ctx.back_media = &m_out;
+ ctx.intface = &itf;
+
+ /* A 16 segments circle template */
+ create_circle(1, 16, &ctx);
+ ASSERT(sa_size(ctx.positions) % 2 == 0
+ && sa_size(ctx.positions) / 2 < UINT_MAX);
+ ASSERT(sa_size(ctx.indices) % 2 == 0
+ && sa_size(ctx.indices) / 2 < UINT_MAX);
+ circ_seg_count = (unsigned)sa_size(ctx.indices) / 2;
+ circ_vrtx_count = (unsigned)sa_size(ctx.positions) / 2;
+ OK(sg2_geometry_reserve(geom, NB_CIRC * circ_vrtx_count,
+ NB_CIRC * circ_seg_count, 0));
+ FOR_EACH(i, 0, NB_CIRC_X) {
+ double center_x = 2 * (1 + NB_CIRC_X) * (i - NB_CIRC_X / 2);
+ FOR_EACH(j, 0, NB_CIRC_Y) {
+ double center_y = 2 * (1 + NB_CIRC_Y) * (j - NB_CIRC_Y / 2);
+ double misalignment = 0;
+ FOR_EACH(k, 0, NB_CIRC_Z) {
+ m_in = (unsigned)k;
+ m_out = (unsigned)(k + 1);
+ ctx.scale = k + 1;
+#ifdef MITIGATE_EMBREE_181
+ /* Mitigate Embree issue #181
+ * We cannot keep perfect alignment of circles
+ * or some hits are missed in some raytracing tasks */
+ misalignment = (k % 2) ? -0.01 : +0.01;
+#endif
+ d2(ctx.offset, center_x + misalignment, center_y + misalignment);
+ OK(sg2_geometry_add(geom, circ_seg_count, circ_vrtx_count, &callbacks,
+ &ctx));
+ }
+ }
+ }
+ circle_release(&ctx);
+
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "some_enclosures",
+ SG2_CDUMP_CONST | SG2_CDUMP_STATIC));
+
+ SG2(geometry_ref_put(geom));
+
+ check_memory_allocator(&allocator);
+ mem_shutdown_proxy_allocator(&allocator);
+ CHK(mem_allocated_size() == 0);
+ return 0;
+}
+\ No newline at end of file
diff --git a/src/test_sg2_some_segments.c b/src/test_sg2_some_segments.c
@@ -0,0 +1,87 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "test_sg2_utils.h"
+#include "test_sg2_utils2.h"
+
+#include <rsys/double2.h>
+
+#include <stdio.h>
+#include <limits.h>
+
+#define NB_CIRC 4
+
+int
+main(int argc, char** argv)
+{
+ struct mem_allocator allocator;
+ struct sg2_device* dev;
+ struct sg2_geometry* geom;
+ struct sg2_geometry_add_callbacks callbacks = SG2_ADD_CALLBACKS_NULL__;
+ unsigned circ_seg_count, circ_vrtx_count, i, count;
+ unsigned m0 = 0, m1, itf = 0;
+ struct context ctx = CONTEXT_NULL__;
+ (void)argc, (void)argv;
+
+ OK(mem_init_proxy_allocator(&allocator, &mem_default_allocator));
+ OK(sg2_device_create(NULL, &allocator, 1, &dev));
+ OK(sg2_geometry_create(dev, &geom));
+ SG2(device_ref_put(dev));
+
+ callbacks.get_indices = get_indices;
+ callbacks.get_position = get_position;
+ callbacks.get_properties = get_uniform_properties;
+
+ ctx.front_media = &m1;
+ ctx.back_media = &m0;
+ ctx.intface = &itf;
+
+ /* A 264 segments circle template */
+ create_circle(1, 264, &ctx);
+ ASSERT(sa_size(ctx.positions) % 2 == 0
+ && sa_size(ctx.positions) / 2 < UINT_MAX);
+ ASSERT(sa_size(ctx.indices) % 2 == 0
+ && sa_size(ctx.indices) / 2 < UINT_MAX);
+ circ_seg_count = (unsigned)sa_size(ctx.indices) / 2;
+ circ_vrtx_count = (unsigned)sa_size(ctx.positions) / 2;
+
+ OK(sg2_geometry_reserve(geom, NB_CIRC * circ_vrtx_count,
+ NB_CIRC * circ_seg_count, 0));
+ FOR_EACH(i, 0, NB_CIRC) {
+ m1 = i;
+ d2(ctx.offset, 0, i * 10);
+ OK(sg2_geometry_add(geom, circ_seg_count, circ_vrtx_count, &callbacks,
+ &ctx));
+ }
+ circle_release(&ctx);
+
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0);
+
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "some_segments",
+ SG2_CDUMP_CONST | SG2_CDUMP_STATIC));
+
+ SG2(geometry_ref_put(geom));
+
+ check_memory_allocator(&allocator);
+ mem_shutdown_proxy_allocator(&allocator);
+ CHK(mem_allocated_size() == 0);
+ return 0;
+}
+\ No newline at end of file
diff --git a/src/test_sg2_square_behind_square.c b/src/test_sg2_square_behind_square.c
@@ -0,0 +1,117 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "test_sg2_utils.h"
+
+#include <rsys/double2.h>
+
+#include <stdio.h>
+
+/*
+ square_2 square_3
+
+ +-----------------------+
+ | 3
+ | |
+ m1 | m0 |
+ | |
+ | |
+ | |
+ | |--> N
+ | |
+ | |
+ +-----------------------+
+ +------------+ +------------+
+ | 2 | 2
+ m0 | m1 | m0 | m1 |
+ | | | |
+ | |--> N | |--> N
+ | | | |
+ +------------+ +------------+
+ +-----+ +-----+
+ m0 | m1 1 m0 | m1 1
+ | |--> N | |--> N
+ +-----+ +-----+
+ */
+
+int
+main(int argc, char** argv)
+{
+ struct mem_allocator allocator;
+ struct sg2_device* dev;
+ struct sg2_geometry* geom;
+ struct context ctx = CONTEXT_NULL__;
+ struct sg2_geometry_add_callbacks callbacks = SG2_ADD_CALLBACKS_NULL__;
+ unsigned count;
+ (void)argc, (void)argv;
+
+ OK(mem_init_proxy_allocator(&allocator, &mem_default_allocator));
+ OK(sg2_device_create(NULL, &allocator, 1, &dev));
+ OK(sg2_geometry_create(dev, &geom));
+ SG2(device_ref_put(dev));
+
+ callbacks.get_indices = get_indices;
+ callbacks.get_properties = get_properties;
+ callbacks.get_position = get_position;
+
+ ctx.positions = box_vertices;
+ ctx.indices = box_indices;
+ ctx.front_media = medium0;
+ ctx.back_media = medium1;
+ ctx.intface = intface0;
+
+ /* First square (front: 0, back: 1), right-handed normal outside */
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+
+ d2(ctx.offset, -2, -2);
+ ctx.scale = 5;
+
+ /* Second square (front: 0, back: 1), right-handed normal outside */
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "square_behind_square_2",
+ SG2_CDUMP_CONST | SG2_CDUMP_STATIC));
+
+ d2(ctx.offset, -3, -3);
+ ctx.scale = 7;
+ ctx.front_media = medium1;
+ ctx.back_media = medium0;
+
+ /* Third square (front: 1, back: 0), right-handed normal outside */
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "square_behind_square_3",
+ SG2_CDUMP_CONST | SG2_CDUMP_STATIC));
+
+ SG2(geometry_ref_put(geom));
+
+ check_memory_allocator(&allocator);
+ mem_shutdown_proxy_allocator(&allocator);
+ CHK(mem_allocated_size() == 0);
+ return 0;
+}
+\ No newline at end of file
diff --git a/src/test_sg2_square_in_square.c b/src/test_sg2_square_in_square.c
@@ -0,0 +1,110 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "test_sg2_utils.h"
+
+#include <rsys/double2.h>
+
+#include <stdio.h>
+
+/*
+ square_2 square_3
+
+ +-------------------------+
+ | B
+ +-------------+ | +-------------+ |
+ m1 | m0 M m1 | m1 | m0 M |
+ | +------+ | | m0 | +------+ | |
+ | | m1 S | | | | m1 S | |
+ | | N <--| | | | | N <--| | |
+ | +------+ | | | +------+ | |
+ | N <--| | | N <--| |
+ +-------------+ | +-------------+ |
+ | N <--|
+ +-------------------------+
+ */
+
+int
+main(int argc, char** argv)
+{
+ struct mem_allocator allocator;
+ struct sg2_device* dev;
+ struct sg2_geometry* geom;
+ struct context ctx = CONTEXT_NULL__;
+ struct sg2_geometry_add_callbacks callbacks = SG2_ADD_CALLBACKS_NULL__;
+ unsigned count;
+ (void)argc, (void)argv;
+
+ OK(mem_init_proxy_allocator(&allocator, &mem_default_allocator));
+ OK(sg2_device_create(NULL, &allocator, 1, &dev));
+ OK(sg2_geometry_create(dev, &geom));
+ SG2(device_ref_put(dev));
+
+ callbacks.get_indices = get_indices;
+ callbacks.get_properties = get_properties;
+ callbacks.get_position = get_position;
+
+ ctx.positions = box_vertices;
+ ctx.indices = box_indices;
+ ctx.front_media = medium0;
+ ctx.back_media = medium1;
+ ctx.intface = intface0;
+
+ /* First square (front: 0, back: 1), right-handed normal outside */
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+
+ d2(ctx.offset, -1, -1);
+ ctx.scale = 3;
+ ctx.reverse_vrtx = 1;
+
+ /* Second square (front: 0, back: 1), right-handed normal inside */
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "square_in_square_2",
+ SG2_CDUMP_CONST | SG2_CDUMP_STATIC));
+
+ d2(ctx.offset, -4, -4);
+ ctx.scale = 10;
+ ctx.reverse_vrtx = 1;
+ ctx.reverse_med = 1;
+ ctx.front_media = medium1;
+ ctx.back_media = medium0;
+
+ /* Third square (front: 0, back: 1), right-handed normal inside */
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "square_in_square_3",
+ SG2_CDUMP_CONST | SG2_CDUMP_STATIC));
+
+ SG2(geometry_ref_put(geom));
+
+ check_memory_allocator(&allocator);
+ mem_shutdown_proxy_allocator(&allocator);
+ CHK(mem_allocated_size() == 0);
+ return 0;
+}
+\ No newline at end of file
diff --git a/src/test_sg2_square_on_square.c b/src/test_sg2_square_on_square.c
@@ -0,0 +1,101 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "test_sg2_utils.h"
+
+#include <rsys/double2.h>
+
+#include <stdio.h>
+
+/*
+ +-----------------------+
+ | 3
+ | +------+ |
+ m2 | m1 | m0 2 |
+ | | |--> N |
+ | +------+ |
+ | | m0 1 |
+ | | |--> N |
+ | +------+ |
+ |--> N |
+ +-----------------------+
+ */
+
+int
+main(int argc, char** argv)
+{
+ struct mem_allocator allocator;
+ struct sg2_device* dev;
+ struct sg2_geometry* geom;
+ struct context ctx = CONTEXT_NULL__;
+ struct sg2_geometry_add_callbacks callbacks = SG2_ADD_CALLBACKS_NULL__;
+ unsigned count;
+ (void)argc, (void)argv;
+
+ OK(mem_init_proxy_allocator(&allocator, &mem_default_allocator));
+ OK(sg2_device_create(NULL, &allocator, 1, &dev));
+ OK(sg2_geometry_create(dev, &geom));
+ SG2(device_ref_put(dev));
+
+ callbacks.get_indices = get_indices;
+ callbacks.get_properties = get_properties;
+ callbacks.get_position = get_position;
+
+ ctx.positions = square_vertices;
+ ctx.indices = box_indices;
+ d2(ctx.offset, 1, 1);
+ ctx.front_media = medium1_top0;
+ ctx.back_media = medium0;
+ ctx.intface = intface0;
+
+ /* First square (front: 0 on top face, 1 elsewhere, back: 0),
+ * right-handed normal outside */
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+
+ d2(ctx.offset, 1, 2);
+ ctx.front_media = medium1_bottom0;
+
+ /* Second square (front: 0 on bottom face, 1 elsewhere, back: 0),
+ * right-handed normal outside */
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+
+ ctx.positions = box_vertices; /* Can use distorded square for square #3 */
+ d2(ctx.offset, 0, 0);
+ ctx.scale = 4;
+ ctx.reverse_vrtx = 1;
+ ctx.reverse_med = 1;
+ ctx.front_media = medium2;
+ ctx.back_media = medium1;
+
+ /* Third square (front: 2, back: 1), right-handed normal inside */
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_interface_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "square_on_square",
+ SG2_CDUMP_CONST | SG2_CDUMP_STATIC));
+
+ SG2(geometry_ref_put(geom));
+
+ check_memory_allocator(&allocator);
+ mem_shutdown_proxy_allocator(&allocator);
+ CHK(mem_allocated_size() == 0);
+ return 0;
+}
+\ No newline at end of file
diff --git a/src/test_sg2_undefined_properties.c b/src/test_sg2_undefined_properties.c
@@ -0,0 +1,143 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include "sg2.h"
+#include "test_sg2_utils.h"
+
+#include <stdio.h>
+
+int
+main(int argc, char** argv)
+{
+ struct mem_allocator allocator;
+ struct sg2_device* dev;
+ struct sg2_geometry* geom;
+ struct context ctx = CONTEXT_NULL__;
+ struct sg2_geometry_add_callbacks callbacks = SG2_ADD_CALLBACKS_NULL__;
+ unsigned property[12];
+ unsigned i;
+ const unsigned property_count = sizeof(property) / sizeof(*property);
+ unsigned count;
+ (void)argc, (void)argv;
+
+ OK(mem_init_proxy_allocator(&allocator, &mem_default_allocator));
+ OK(sg2_device_create(NULL, &allocator, 1, &dev));
+ OK(sg2_geometry_create(dev, &geom));
+
+ FOR_EACH(i, 0, property_count) property[i] = SG2_UNDEFINED_PROPERTY;
+
+ callbacks.get_indices = get_indices;
+ callbacks.get_position = get_position;
+
+ /* A 3D square.
+ * 2 enclosures (inside, outside) sharing the same segments,
+ * but opposite sides */
+ ctx.positions = box_vertices;
+ ctx.indices = box_indices;
+
+ /* Add geometry with no properties */
+ ctx.front_media = property;
+ ctx.back_media = medium1;
+ ctx.intface = property;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == nsegments);
+
+ /* Add same geometry with no properties on front/intface */
+ callbacks.get_properties = get_properties;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == nsegments);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 2 * nsegments);
+
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "front_undefined",
+ SG2_CDUMP_STATIC | SG2_CDUMP_CONST));
+
+ /* Add same geometry, front/intface properties are defined for odd segments */
+ FOR_EACH(i, 0, sizeof(property) / sizeof(*property))
+ property[i] = (i % 2) ? 0 : SG2_UNDEFINED_PROPERTY;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == nsegments / 2);
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 3 * nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ FOR_EACH(i, 0, count) {
+ unsigned prop[SG2_PROP_TYPES_COUNT__];
+ OK(sg2_geometry_get_unique_segment_properties(geom, i, prop));
+ CHK(prop[SG2_FRONT] == ((i % 2) ? 0 : SG2_UNDEFINED_PROPERTY)
+ && prop[SG2_BACK] == 1
+ && prop[SG2_INTFACE] == ((i % 2) ? 0 : SG2_UNDEFINED_PROPERTY));
+ }
+
+ /* Same information again, using a reversed box */
+ ctx.reverse_vrtx = 1;
+ SWAP(const unsigned*, ctx.front_media, ctx.back_media);
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == nsegments / 2);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 4 * nsegments);
+
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "front_half_undefined",
+ SG2_CDUMP_STATIC | SG2_CDUMP_CONST));
+
+ /* Define properties for remaining segments, using reversed box */
+ FOR_EACH(i, 0, sizeof(property) / sizeof(*property))
+ property[i] = (i % 2) ? SG2_UNDEFINED_PROPERTY : 0;
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ OK(sg2_geometry_get_segment_with_undefined_side_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_unique_vertices_count(geom, &count));
+ CHK(count == nvertices);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 5 * nsegments);
+ OK(sg2_geometry_get_unique_segments_count(geom, &count));
+ CHK(count == nsegments);
+ FOR_EACH(i, 0, count) {
+ unsigned prop[SG2_PROP_TYPES_COUNT__];
+ OK(sg2_geometry_get_unique_segment_properties(geom, i, prop));
+ CHK(prop[SG2_FRONT] == 0 && prop[SG2_BACK] == 1
+ && prop[SG2_INTFACE] == 0);
+ }
+
+ OK(sg2_geometry_dump_as_C_code(geom, stdout, "all_defined",
+ SG2_CDUMP_STATIC | SG2_CDUMP_CONST));
+
+ /* Define incoherent properties for some segments */
+ FOR_EACH(i, 0, sizeof(property) / sizeof(*property))
+ property[i] = (i % 2);
+ OK(sg2_geometry_add(geom, nsegments, nvertices, &callbacks, &ctx));
+ OK(sg2_geometry_get_merge_conflict_count(geom, &count));
+ CHK(count == nsegments / 2);
+ OK(sg2_geometry_get_properties_conflict_count(geom, &count));
+ CHK(count == 0);
+ OK(sg2_geometry_get_added_segments_count(geom, &count));
+ CHK(count == 6 * nsegments);
+
+ OK(sg2_geometry_ref_put(geom));
+ OK(sg2_device_ref_put(dev));
+
+ check_memory_allocator(&allocator);
+ mem_shutdown_proxy_allocator(&allocator);
+ CHK(mem_allocated_size() == 0);
+ return 0;
+}
diff --git a/src/test_sg2_utils.h b/src/test_sg2_utils.h
@@ -0,0 +1,136 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#ifndef TEST_SG2_UTILS_H
+#define TEST_SG2_UTILS_H
+
+#include <rsys/mem_allocator.h>
+#include <stdio.h>
+
+#define OK(Cond) CHK((Cond) == RES_OK)
+#define BA(Cond) CHK((Cond) == RES_BAD_ARG)
+#define ME(Cond) CHK((Cond) == RES_MEM_ERR)
+
+/*******************************************************************************
+ * Memory allocator
+ ******************************************************************************/
+static INLINE void
+check_memory_allocator(struct mem_allocator* allocator)
+{
+ if(MEM_ALLOCATED_SIZE(allocator)) {
+ char dump[80192];
+ MEM_DUMP(allocator, dump, sizeof(dump));
+ fprintf(stderr, "%s\n", dump);
+ FATAL("Memory leaks.\n");
+ }
+}
+
+/*******************************************************************************
+ * Geometry
+ ******************************************************************************/
+/* 2D square */
+static double square_vertices[4/*#vertices*/ * 2/*#coords per vertex*/] = {
+ 0.0, 0.0,
+ 1.0, 0.0,
+ 0.0, 1.0,
+ 1.0, 1.0
+};
+static const unsigned
+nvertices = sizeof(square_vertices) / (2 * sizeof(*square_vertices));
+/* Distorded square */
+static double box_vertices[4/*#vertices*/ * 2/*#coords per vertex*/] = {
+ 0.1, 0.0,
+ 1.0, 0.0,
+ 0.0, 1.1,
+ 1.0, 1.0
+};
+
+/* The following array lists the indices toward the 2D vertices of each
+ * segment.
+ * Y
+ * 2----3 |
+ * | | 0----X
+ * | |
+ * 0----1
+ *
+ * The right-handed geometrical normal is outside the square
+ */
+static unsigned
+box_indices[4/*#segments*/ * 2/*#indices per segment*/] = {
+ 0, 2,
+ 2, 3,
+ 3, 1,
+ 1, 0
+};
+static const unsigned
+nsegments = sizeof(box_indices) / (2 * sizeof(*box_indices));
+
+struct context {
+ double* positions;
+ unsigned* indices;
+ const unsigned* front_media;
+ const unsigned* back_media;
+ const unsigned* intface;
+ void* custom;
+ double offset[2];
+ double scale;
+ char reverse_vrtx, reverse_med;
+};
+#define CONTEXT_NULL__ {\
+ NULL, NULL, NULL, NULL, NULL, NULL, {0,0}, 1, 0, 0\
+}
+
+static const unsigned medium0[4] = { 0, 0, 0, 0 };
+static const unsigned medium1[4] = { 1, 1, 1, 1 };
+static const unsigned medium2[4] = { 2, 2, 2, 2 };
+static const unsigned medium1_3[4] = { 1, 1, 3, 1 };
+static const unsigned medium1_bottom0[4] = { 1, 1, 1, 0 };
+static const unsigned medium1_top0[4] = { 1, 0, 1, 1 };
+
+static const unsigned intface0[4] = { 0, 0, 0, 0 };
+static const unsigned intface1[4] = { 1, 1, 1, 1 };
+
+static INLINE void
+get_indices(const unsigned iseg, unsigned ids[2], void* context)
+{
+ const struct context* ctx = context;
+ ASSERT(ids && ctx);
+ ids[ctx->reverse_vrtx ? 1 : 0] = ctx->indices[iseg * 2 + 0];
+ ids[ctx->reverse_vrtx ? 0 : 1] = ctx->indices[iseg * 2 + 1];
+}
+
+static INLINE void
+get_position(const unsigned ivert, double pos[2], void* context)
+{
+ const struct context* ctx = context;
+ ASSERT(pos && ctx);
+ pos[0] = ctx->positions[ivert * 2 + 0] * ctx->scale + ctx->offset[0];
+ pos[1] = ctx->positions[ivert * 2 + 1] * ctx->scale + ctx->offset[1];
+}
+
+static INLINE void
+get_properties
+ (const unsigned iseg,
+ unsigned property[SG2_PROP_TYPES_COUNT__],
+ void* context)
+{
+ const struct context* ctx = context;
+ ASSERT(property && ctx);
+ property[ctx->reverse_med ? SG2_BACK : SG2_FRONT] = ctx->front_media[iseg];
+ property[ctx->reverse_med ? SG2_FRONT : SG2_BACK] = ctx->back_media[iseg];
+ property[SG2_INTFACE] = ctx->intface[iseg];
+}
+
+#endif /* TEST_SG2_UTILS_H */
diff --git a/src/test_sg2_utils2.h b/src/test_sg2_utils2.h
@@ -0,0 +1,75 @@
+/* Copyright (C) 2019-2020 |Meso|Star> (contact@meso-star.com)
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#ifndef TEST_SG2_UTILS2_H
+#define TEST_SG2_UTILS2_H
+
+#include <rsys/stretchy_array.h>
+
+/*******************************************************************************
+ * Circle functions
+ ******************************************************************************/
+static INLINE void
+create_circle
+ (const double radius,
+ const unsigned nslices,
+ struct context* ctx)
+{
+ double step_theta;
+ unsigned itheta;
+ unsigned islice;
+ ASSERT(radius > 0 && nslices >= 3 && ctx);
+
+ step_theta = 2 * PI / (double)nslices;
+ FOR_EACH(itheta, 0, nslices) {
+ const double theta = (double)itheta * step_theta;
+ const double x = cos(theta);
+ const double y = sin(theta);
+ sa_push(ctx->positions, x * radius);
+ sa_push(ctx->positions, y * radius);
+ }
+
+ FOR_EACH(islice, 0, nslices) {
+ const unsigned v0 = islice;
+ const unsigned v1 = ((islice + 1) % nslices);
+ sa_push(ctx->indices, v0);
+ sa_push(ctx->indices, v1);
+ }
+}
+
+static INLINE void
+circle_release(struct context* ctx)
+{
+ ASSERT(ctx);
+ sa_release(ctx->positions);
+ sa_release(ctx->indices);
+ ctx->positions = NULL;
+ ctx->indices = NULL;
+}
+
+static INLINE void
+get_uniform_properties
+ (const unsigned iseg,
+ unsigned property[SG2_PROP_TYPES_COUNT__],
+ void* context)
+{
+ const struct context* ctx = context;
+ ASSERT(property && ctx); (void)iseg;
+ property[ctx->reverse_med ? SG2_BACK : SG2_FRONT] = *ctx->front_media;
+ property[ctx->reverse_med ? SG2_FRONT : SG2_BACK] = *ctx->back_media;
+ property[SG2_INTFACE] = *ctx->intface;
+}
+
+#endif /* TEST_SG2_UTILS2_H */
