From ba228378d9389a8861986b72acc6d35305fb7c26 Mon Sep 17 00:00:00 2001 From: Jan Petykiewicz Date: Sun, 27 Mar 2022 23:43:52 -0700 Subject: [PATCH] initial commit --- .gitignore | 20 ++ LICENSE.md | 595 +++++++++++++++++++++++++++++++++++ connectivity.py | 326 +++++++++++++++++++ example.py | 20 ++ snarl/__init__.py | 2 + snarl/clipper.py | 47 +++ snarl/interfaces/__init__.py | 0 snarl/interfaces/masque.py | 66 ++++ snarl/main.py | 186 +++++++++++ snarl/poly.py | 64 ++++ snarl/tracker.py | 50 +++ snarl/types.py | 6 + snarl/utils.py | 19 ++ 13 files changed, 1401 insertions(+) create mode 100644 .gitignore create mode 100644 LICENSE.md create mode 100644 connectivity.py create mode 100644 example.py create mode 100644 snarl/__init__.py create mode 100644 snarl/clipper.py create mode 100644 snarl/interfaces/__init__.py create mode 100644 snarl/interfaces/masque.py create mode 100644 snarl/main.py create mode 100644 snarl/poly.py create mode 100644 snarl/tracker.py create mode 100644 snarl/types.py create mode 100644 snarl/utils.py diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..64466d7 --- /dev/null +++ b/.gitignore @@ -0,0 +1,20 @@ +*.pyc +__pycache__ + +*.idea + +build/ +dist/ +*.egg-info/ +.mypy_cache/ + +*.swp +*.swo + +*.gds +*.gds.gz +*.svg +*.oas +*.oas.gz +*.dxf +*.dxf.gz diff --git a/LICENSE.md b/LICENSE.md new file mode 100644 index 0000000..175443c --- /dev/null +++ b/LICENSE.md @@ -0,0 +1,595 @@ +GNU General Public License +========================== + +_Version 3, 29 June 2007_ +_Copyright © 2007 Free Software Foundation, Inc. <>_ + +Everyone is permitted to copy and distribute verbatim copies of this license +document, but changing it is not allowed. + +## Preamble + +The GNU General Public License is a free, copyleft license for software and other +kinds of works. + +The licenses for most software and other practical works are designed to take away +your freedom to share and change the works. By contrast, the GNU General Public +License is intended to guarantee your freedom to share and change all versions of a +program--to make sure it remains free software for all its users. We, the Free +Software Foundation, use the GNU General Public License for most of our software; it +applies also to any other work released this way by its authors. You can apply it to +your programs, too. + +When we speak of free software, we are referring to freedom, not price. Our General +Public Licenses are designed to make sure that you have the freedom to distribute +copies of free software (and charge for them if you wish), that you receive source +code or can get it if you want it, that you can change the software or use pieces of +it in new free programs, and that you know you can do these things. + +To protect your rights, we need to prevent others from denying you these rights or +asking you to surrender the rights. Therefore, you have certain responsibilities if +you distribute copies of the software, or if you modify it: responsibilities to +respect the freedom of others. + +For example, if you distribute copies of such a program, whether gratis or for a fee, +you must pass on to the recipients the same freedoms that you received. You must make +sure that they, too, receive or can get the source code. And you must show them these +terms so they know their rights. + +Developers that use the GNU GPL protect your rights with two steps: **(1)** assert +copyright on the software, and **(2)** offer you this License giving you legal permission +to copy, distribute and/or modify it. + +For the developers' and authors' protection, the GPL clearly explains that there is +no warranty for this free software. For both users' and authors' sake, the GPL +requires that modified versions be marked as changed, so that their problems will not +be attributed erroneously to authors of previous versions. + +Some devices are designed to deny users access to install or run modified versions of +the software inside them, although the manufacturer can do so. This is fundamentally +incompatible with the aim of protecting users' freedom to change the software. The +systematic pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we have designed +this version of the GPL to prohibit the practice for those products. If such problems +arise substantially in other domains, we stand ready to extend this provision to +those domains in future versions of the GPL, as needed to protect the freedom of +users. + +Finally, every program is threatened constantly by software patents. States should +not allow patents to restrict development and use of software on general-purpose +computers, but in those that do, we wish to avoid the special danger that patents +applied to a free program could make it effectively proprietary. To prevent this, the +GPL assures that patents cannot be used to render the program non-free. + +The precise terms and conditions for copying, distribution and modification follow. + +## TERMS AND CONDITIONS + +### 0. Definitions + +“This License” refers to version 3 of the GNU General Public License. + +“Copyright” also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + +“The Program” refers to any copyrightable work licensed under this +License. Each licensee is addressed as “you”. “Licensees” and +“recipients” may be individuals or organizations. + +To “modify” a work means to copy from or adapt all or part of the work in +a fashion requiring copyright permission, other than the making of an exact copy. The +resulting work is called a “modified version” of the earlier work or a +work “based on” the earlier work. + +A “covered work” means either the unmodified Program or a work based on +the Program. + +To “propagate” a work means to do anything with it that, without +permission, would make you directly or secondarily liable for infringement under +applicable copyright law, except executing it on a computer or modifying a private +copy. Propagation includes copying, distribution (with or without modification), +making available to the public, and in some countries other activities as well. + +To “convey” a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through a computer +network, with no transfer of a copy, is not conveying. + +An interactive user interface displays “Appropriate Legal Notices” to the +extent that it includes a convenient and prominently visible feature that **(1)** +displays an appropriate copyright notice, and **(2)** tells the user that there is no +warranty for the work (except to the extent that warranties are provided), that +licensees may convey the work under this License, and how to view a copy of this +License. If the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + +### 1. Source Code + +The “source code” for a work means the preferred form of the work for +making modifications to it. “Object code” means any non-source form of a +work. + +A “Standard Interface” means an interface that either is an official +standard defined by a recognized standards body, or, in the case of interfaces +specified for a particular programming language, one that is widely used among +developers working in that language. + +The “System Libraries” of an executable work include anything, other than +the work as a whole, that **(a)** is included in the normal form of packaging a Major +Component, but which is not part of that Major Component, and **(b)** serves only to +enable use of the work with that Major Component, or to implement a Standard +Interface for which an implementation is available to the public in source code form. +A “Major Component”, in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system (if any) on which +the executable work runs, or a compiler used to produce the work, or an object code +interpreter used to run it. + +The “Corresponding Source” for a work in object code form means all the +source code needed to generate, install, and (for an executable work) run the object +code and to modify the work, including scripts to control those activities. However, +it does not include the work's System Libraries, or general-purpose tools or +generally available free programs which are used unmodified in performing those +activities but which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for the work, and +the source code for shared libraries and dynamically linked subprograms that the work +is specifically designed to require, such as by intimate data communication or +control flow between those subprograms and other parts of the work. + +The Corresponding Source need not include anything that users can regenerate +automatically from other parts of the Corresponding Source. + +The Corresponding Source for a work in source code form is that same work. + +### 2. Basic Permissions + +All rights granted under this License are granted for the term of copyright on the +Program, and are irrevocable provided the stated conditions are met. This License +explicitly affirms your unlimited permission to run the unmodified Program. The +output from running a covered work is covered by this License only if the output, +given its content, constitutes a covered work. This License acknowledges your rights +of fair use or other equivalent, as provided by copyright law. + +You may make, run and propagate covered works that you do not convey, without +conditions so long as your license otherwise remains in force. You may convey covered +works to others for the sole purpose of having them make modifications exclusively +for you, or provide you with facilities for running those works, provided that you +comply with the terms of this License in conveying all material for which you do not +control copyright. Those thus making or running the covered works for you must do so +exclusively on your behalf, under your direction and control, on terms that prohibit +them from making any copies of your copyrighted material outside their relationship +with you. + +Conveying under any other circumstances is permitted solely under the conditions +stated below. Sublicensing is not allowed; section 10 makes it unnecessary. + +### 3. Protecting Users' Legal Rights From Anti-Circumvention Law + +No covered work shall be deemed part of an effective technological measure under any +applicable law fulfilling obligations under article 11 of the WIPO copyright treaty +adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention +of such measures. + +When you convey a covered work, you waive any legal power to forbid circumvention of +technological measures to the extent such circumvention is effected by exercising +rights under this License with respect to the covered work, and you disclaim any +intention to limit operation or modification of the work as a means of enforcing, +against the work's users, your or third parties' legal rights to forbid circumvention +of technological measures. + +### 4. Conveying Verbatim Copies + +You may convey verbatim copies of the Program's source code as you receive it, in any +medium, provided that you conspicuously and appropriately publish on each copy an +appropriate copyright notice; keep intact all notices stating that this License and +any non-permissive terms added in accord with section 7 apply to the code; keep +intact all notices of the absence of any warranty; and give all recipients a copy of +this License along with the Program. + +You may charge any price or no price for each copy that you convey, and you may offer +support or warranty protection for a fee. + +### 5. Conveying Modified Source Versions + +You may convey a work based on the Program, or the modifications to produce it from +the Program, in the form of source code under the terms of section 4, provided that +you also meet all of these conditions: + +* **a)** The work must carry prominent notices stating that you modified it, and giving a +relevant date. +* **b)** The work must carry prominent notices stating that it is released under this +License and any conditions added under section 7. This requirement modifies the +requirement in section 4 to “keep intact all notices”. +* **c)** You must license the entire work, as a whole, under this License to anyone who +comes into possession of a copy. This License will therefore apply, along with any +applicable section 7 additional terms, to the whole of the work, and all its parts, +regardless of how they are packaged. This License gives no permission to license the +work in any other way, but it does not invalidate such permission if you have +separately received it. +* **d)** If the work has interactive user interfaces, each must display Appropriate Legal +Notices; however, if the Program has interactive interfaces that do not display +Appropriate Legal Notices, your work need not make them do so. + +A compilation of a covered work with other separate and independent works, which are +not by their nature extensions of the covered work, and which are not combined with +it such as to form a larger program, in or on a volume of a storage or distribution +medium, is called an “aggregate” if the compilation and its resulting +copyright are not used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work in an aggregate +does not cause this License to apply to the other parts of the aggregate. + +### 6. Conveying Non-Source Forms + +You may convey a covered work in object code form under the terms of sections 4 and +5, provided that you also convey the machine-readable Corresponding Source under the +terms of this License, in one of these ways: + +* **a)** Convey the object code in, or embodied in, a physical product (including a +physical distribution medium), accompanied by the Corresponding Source fixed on a +durable physical medium customarily used for software interchange. +* **b)** Convey the object code in, or embodied in, a physical product (including a +physical distribution medium), accompanied by a written offer, valid for at least +three years and valid for as long as you offer spare parts or customer support for +that product model, to give anyone who possesses the object code either **(1)** a copy of +the Corresponding Source for all the software in the product that is covered by this +License, on a durable physical medium customarily used for software interchange, for +a price no more than your reasonable cost of physically performing this conveying of +source, or **(2)** access to copy the Corresponding Source from a network server at no +charge. +* **c)** Convey individual copies of the object code with a copy of the written offer to +provide the Corresponding Source. This alternative is allowed only occasionally and +noncommercially, and only if you received the object code with such an offer, in +accord with subsection 6b. +* **d)** Convey the object code by offering access from a designated place (gratis or for +a charge), and offer equivalent access to the Corresponding Source in the same way +through the same place at no further charge. You need not require recipients to copy +the Corresponding Source along with the object code. If the place to copy the object +code is a network server, the Corresponding Source may be on a different server +(operated by you or a third party) that supports equivalent copying facilities, +provided you maintain clear directions next to the object code saying where to find +the Corresponding Source. Regardless of what server hosts the Corresponding Source, +you remain obligated to ensure that it is available for as long as needed to satisfy +these requirements. +* **e)** Convey the object code using peer-to-peer transmission, provided you inform +other peers where the object code and Corresponding Source of the work are being +offered to the general public at no charge under subsection 6d. + +A separable portion of the object code, whose source code is excluded from the +Corresponding Source as a System Library, need not be included in conveying the +object code work. + +A “User Product” is either **(1)** a “consumer product”, which +means any tangible personal property which is normally used for personal, family, or +household purposes, or **(2)** anything designed or sold for incorporation into a +dwelling. In determining whether a product is a consumer product, doubtful cases +shall be resolved in favor of coverage. For a particular product received by a +particular user, “normally used” refers to a typical or common use of +that class of product, regardless of the status of the particular user or of the way +in which the particular user actually uses, or expects or is expected to use, the +product. A product is a consumer product regardless of whether the product has +substantial commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + +“Installation Information” for a User Product means any methods, +procedures, authorization keys, or other information required to install and execute +modified versions of a covered work in that User Product from a modified version of +its Corresponding Source. The information must suffice to ensure that the continued +functioning of the modified object code is in no case prevented or interfered with +solely because modification has been made. + +If you convey an object code work under this section in, or with, or specifically for +use in, a User Product, and the conveying occurs as part of a transaction in which +the right of possession and use of the User Product is transferred to the recipient +in perpetuity or for a fixed term (regardless of how the transaction is +characterized), the Corresponding Source conveyed under this section must be +accompanied by the Installation Information. But this requirement does not apply if +neither you nor any third party retains the ability to install modified object code +on the User Product (for example, the work has been installed in ROM). + +The requirement to provide Installation Information does not include a requirement to +continue to provide support service, warranty, or updates for a work that has been +modified or installed by the recipient, or for the User Product in which it has been +modified or installed. Access to a network may be denied when the modification itself +materially and adversely affects the operation of the network or violates the rules +and protocols for communication across the network. + +Corresponding Source conveyed, and Installation Information provided, in accord with +this section must be in a format that is publicly documented (and with an +implementation available to the public in source code form), and must require no +special password or key for unpacking, reading or copying. + +### 7. Additional Terms + +“Additional permissions” are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. Additional +permissions that are applicable to the entire Program shall be treated as though they +were included in this License, to the extent that they are valid under applicable +law. If additional permissions apply only to part of the Program, that part may be +used separately under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + +When you convey a copy of a covered work, you may at your option remove any +additional permissions from that copy, or from any part of it. (Additional +permissions may be written to require their own removal in certain cases when you +modify the work.) You may place additional permissions on material, added by you to a +covered work, for which you have or can give appropriate copyright permission. + +Notwithstanding any other provision of this License, for material you add to a +covered work, you may (if authorized by the copyright holders of that material) +supplement the terms of this License with terms: + +* **a)** Disclaiming warranty or limiting liability differently from the terms of +sections 15 and 16 of this License; or +* **b)** Requiring preservation of specified reasonable legal notices or author +attributions in that material or in the Appropriate Legal Notices displayed by works +containing it; or +* **c)** Prohibiting misrepresentation of the origin of that material, or requiring that +modified versions of such material be marked in reasonable ways as different from the +original version; or +* **d)** Limiting the use for publicity purposes of names of licensors or authors of the +material; or +* **e)** Declining to grant rights under trademark law for use of some trade names, +trademarks, or service marks; or +* **f)** Requiring indemnification of licensors and authors of that material by anyone +who conveys the material (or modified versions of it) with contractual assumptions of +liability to the recipient, for any liability that these contractual assumptions +directly impose on those licensors and authors. + +All other non-permissive additional terms are considered “further +restrictions” within the meaning of section 10. If the Program as you received +it, or any part of it, contains a notice stating that it is governed by this License +along with a term that is a further restriction, you may remove that term. If a +license document contains a further restriction but permits relicensing or conveying +under this License, you may add to a covered work material governed by the terms of +that license document, provided that the further restriction does not survive such +relicensing or conveying. + +If you add terms to a covered work in accord with this section, you must place, in +the relevant source files, a statement of the additional terms that apply to those +files, or a notice indicating where to find the applicable terms. + +Additional terms, permissive or non-permissive, may be stated in the form of a +separately written license, or stated as exceptions; the above requirements apply +either way. + +### 8. Termination + +You may not propagate or modify a covered work except as expressly provided under +this License. Any attempt otherwise to propagate or modify it is void, and will +automatically terminate your rights under this License (including any patent licenses +granted under the third paragraph of section 11). + +However, if you cease all violation of this License, then your license from a +particular copyright holder is reinstated **(a)** provisionally, unless and until the +copyright holder explicitly and finally terminates your license, and **(b)** permanently, +if the copyright holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + +Moreover, your license from a particular copyright holder is reinstated permanently +if the copyright holder notifies you of the violation by some reasonable means, this +is the first time you have received notice of violation of this License (for any +work) from that copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + +Termination of your rights under this section does not terminate the licenses of +parties who have received copies or rights from you under this License. If your +rights have been terminated and not permanently reinstated, you do not qualify to +receive new licenses for the same material under section 10. + +### 9. Acceptance Not Required for Having Copies + +You are not required to accept this License in order to receive or run a copy of the +Program. Ancillary propagation of a covered work occurring solely as a consequence of +using peer-to-peer transmission to receive a copy likewise does not require +acceptance. However, nothing other than this License grants you permission to +propagate or modify any covered work. These actions infringe copyright if you do not +accept this License. Therefore, by modifying or propagating a covered work, you +indicate your acceptance of this License to do so. + +### 10. Automatic Licensing of Downstream Recipients + +Each time you convey a covered work, the recipient automatically receives a license +from the original licensors, to run, modify and propagate that work, subject to this +License. You are not responsible for enforcing compliance by third parties with this +License. + +An “entity transaction” is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an organization, or +merging organizations. If propagation of a covered work results from an entity +transaction, each party to that transaction who receives a copy of the work also +receives whatever licenses to the work the party's predecessor in interest had or +could give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if the predecessor +has it or can get it with reasonable efforts. + +You may not impose any further restrictions on the exercise of the rights granted or +affirmed under this License. For example, you may not impose a license fee, royalty, +or other charge for exercise of rights granted under this License, and you may not +initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging +that any patent claim is infringed by making, using, selling, offering for sale, or +importing the Program or any portion of it. + +### 11. Patents + +A “contributor” is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The work thus +licensed is called the contributor's “contributor version”. + +A contributor's “essential patent claims” are all patent claims owned or +controlled by the contributor, whether already acquired or hereafter acquired, that +would be infringed by some manner, permitted by this License, of making, using, or +selling its contributor version, but do not include claims that would be infringed +only as a consequence of further modification of the contributor version. For +purposes of this definition, “control” includes the right to grant patent +sublicenses in a manner consistent with the requirements of this License. + +Each contributor grants you a non-exclusive, worldwide, royalty-free patent license +under the contributor's essential patent claims, to make, use, sell, offer for sale, +import and otherwise run, modify and propagate the contents of its contributor +version. + +In the following three paragraphs, a “patent license” is any express +agreement or commitment, however denominated, not to enforce a patent (such as an +express permission to practice a patent or covenant not to sue for patent +infringement). To “grant” such a patent license to a party means to make +such an agreement or commitment not to enforce a patent against the party. + +If you convey a covered work, knowingly relying on a patent license, and the +Corresponding Source of the work is not available for anyone to copy, free of charge +and under the terms of this License, through a publicly available network server or +other readily accessible means, then you must either **(1)** cause the Corresponding +Source to be so available, or **(2)** arrange to deprive yourself of the benefit of the +patent license for this particular work, or **(3)** arrange, in a manner consistent with +the requirements of this License, to extend the patent license to downstream +recipients. “Knowingly relying” means you have actual knowledge that, but +for the patent license, your conveying the covered work in a country, or your +recipient's use of the covered work in a country, would infringe one or more +identifiable patents in that country that you have reason to believe are valid. + +If, pursuant to or in connection with a single transaction or arrangement, you +convey, or propagate by procuring conveyance of, a covered work, and grant a patent +license to some of the parties receiving the covered work authorizing them to use, +propagate, modify or convey a specific copy of the covered work, then the patent +license you grant is automatically extended to all recipients of the covered work and +works based on it. + +A patent license is “discriminatory” if it does not include within the +scope of its coverage, prohibits the exercise of, or is conditioned on the +non-exercise of one or more of the rights that are specifically granted under this +License. You may not convey a covered work if you are a party to an arrangement with +a third party that is in the business of distributing software, under which you make +payment to the third party based on the extent of your activity of conveying the +work, and under which the third party grants, to any of the parties who would receive +the covered work from you, a discriminatory patent license **(a)** in connection with +copies of the covered work conveyed by you (or copies made from those copies), or **(b)** +primarily for and in connection with specific products or compilations that contain +the covered work, unless you entered into that arrangement, or that patent license +was granted, prior to 28 March 2007. + +Nothing in this License shall be construed as excluding or limiting any implied +license or other defenses to infringement that may otherwise be available to you +under applicable patent law. + +### 12. No Surrender of Others' Freedom + +If conditions are imposed on you (whether by court order, agreement or otherwise) +that contradict the conditions of this License, they do not excuse you from the +conditions of this License. If you cannot convey a covered work so as to satisfy +simultaneously your obligations under this License and any other pertinent +obligations, then as a consequence you may not convey it at all. For example, if you +agree to terms that obligate you to collect a royalty for further conveying from +those to whom you convey the Program, the only way you could satisfy both those terms +and this License would be to refrain entirely from conveying the Program. + +### 13. Use with the GNU Affero General Public License + +Notwithstanding any other provision of this License, you have permission to link or +combine any covered work with a work licensed under version 3 of the GNU Affero +General Public License into a single combined work, and to convey the resulting work. +The terms of this License will continue to apply to the part which is the covered +work, but the special requirements of the GNU Affero General Public License, section +13, concerning interaction through a network will apply to the combination as such. + +### 14. Revised Versions of this License + +The Free Software Foundation may publish revised and/or new versions of the GNU +General Public License from time to time. Such new versions will be similar in spirit +to the present version, but may differ in detail to address new problems or concerns. + +Each version is given a distinguishing version number. If the Program specifies that +a certain numbered version of the GNU General Public License “or any later +version” applies to it, you have the option of following the terms and +conditions either of that numbered version or of any later version published by the +Free Software Foundation. If the Program does not specify a version number of the GNU +General Public License, you may choose any version ever published by the Free +Software Foundation. + +If the Program specifies that a proxy can decide which future versions of the GNU +General Public License can be used, that proxy's public statement of acceptance of a +version permanently authorizes you to choose that version for the Program. + +Later license versions may give you additional or different permissions. However, no +additional obligations are imposed on any author or copyright holder as a result of +your choosing to follow a later version. + +### 15. Disclaimer of Warranty + +THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. +EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES +PROVIDE THE PROGRAM “AS IS” WITHOUT WARRANTY OF ANY KIND, EITHER +EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE +QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE +DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + +### 16. Limitation of Liability + +IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY +COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS +PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, +INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE +PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE +OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE +WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE +POSSIBILITY OF SUCH DAMAGES. + +### 17. Interpretation of Sections 15 and 16 + +If the disclaimer of warranty and limitation of liability provided above cannot be +given local legal effect according to their terms, reviewing courts shall apply local +law that most closely approximates an absolute waiver of all civil liability in +connection with the Program, unless a warranty or assumption of liability accompanies +a copy of the Program in return for a fee. + +_END OF TERMS AND CONDITIONS_ + +## How to Apply These Terms to Your New Programs + +If you develop a new program, and you want it to be of the greatest possible use to +the public, the best way to achieve this is to make it free software which everyone +can redistribute and change under these terms. + +To do so, attach the following notices to the program. It is safest to attach them +to the start of each source file to most effectively state the exclusion of warranty; +and each file should have at least the “copyright” line and a pointer to +where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + +If the program does terminal interaction, make it output a short notice like this +when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type 'show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type 'show c' for details. + +The hypothetical commands `show w` and `show c` should show the appropriate parts of +the General Public License. Of course, your program's commands might be different; +for a GUI interface, you would use an “about box”. + +You should also get your employer (if you work as a programmer) or school, if any, to +sign a “copyright disclaimer” for the program, if necessary. For more +information on this, and how to apply and follow the GNU GPL, see +<>. + +The GNU General Public License does not permit incorporating your program into +proprietary programs. If your program is a subroutine library, you may consider it +more useful to permit linking proprietary applications with the library. If this is +what you want to do, use the GNU Lesser General Public License instead of this +License. But first, please read +<>. diff --git a/connectivity.py b/connectivity.py new file mode 100644 index 0000000..a2c1266 --- /dev/null +++ b/connectivity.py @@ -0,0 +1,326 @@ +from typing import Tuple, List, Dict, Set, Optional, Union, Sequence +from collections import defaultdict +from pprint import pformat +import logging + +import numpy +from numpy.typing import NDArray, ArrayLike +import pyclipper +from pyclipper import ( + Pyclipper, PT_CLIP, PT_SUBJECT, CT_UNION, CT_INTERSECTION, PFT_NONZERO, PFT_EVENODD, + scale_to_clipper, scale_from_clipper, PyPolyNode, + ) +from masque.file import oasis, gdsii + +from masque import Pattern +from masque.shapes import Polygon +from .poly import poly_contains_points + + +logger = logging.getLogger(__name__) + + +layer_t = Tuple[int, int] +contour_t = List[Tuple[int, int]] +net_name_t = Union[str, object] + + +CLIPPER_SCALE_FACTOR = 2**24 + + + + +def union_nonzero(shapes: Sequence[ArrayLike]) -> Optional[PyPolyNode]: + if not shapes: + return None + pc = Pyclipper() + pc.AddPaths(shapes, PT_CLIP, closed=True) + result = pc.Execute2(CT_UNION, PFT_NONZERO, PFT_NONZERO) + return result + + +def union_evenodd(shapes: Sequence[ArrayLike]) -> List[contour_t]: + if not shapes: + return [] + pc = Pyclipper() + pc.AddPaths(shapes, PT_CLIP, closed=True) + return pc.Execute(CT_UNION, PFT_EVENODD, PFT_EVENODD) + + +def intersection_evenodd( + subject_shapes: Sequence[ArrayLike], + clip_shapes: Sequence[ArrayLike], + clip_closed: bool = True, + ) -> List[contour_t]: + if not subject_shapes or not clip_shapes: + return [] + pc = Pyclipper() + pc.AddPaths(subject_shapes, PT_SUBJECT, closed=True) + pc.AddPaths(clip_shapes, PT_CLIP, closed=clip_closed) + return pc.Execute(CT_INTERSECTION, PFT_EVENODD, PFT_EVENODD) + + +class NetsInfo: + nets: defaultdict[str, defaultdict[layer_t, List]] + net_aliases: defaultdict[str, List] + + def __init__(self) -> None: + self.nets = defaultdict(lambda: defaultdict(list)) + self.net_aliases = defaultdict(list) + + def resolve_name(self, net_name: net_name_t) -> net_name_t: + while net_name in self.net_aliases: + net_name = self.net_aliases[net_name] + return net_name + + def merge(self, net_a: net_name_t, net_b: net_name_t) -> None: + net_a = self.resolve_name(net_a) + net_b = self.resolve_name(net_b) + + # Always keep named nets if the other is anonymous + if not isinstance(net_a, str) and isinstance(net_b, str): + keep_net, old_net = net_b, net_a + else: + keep_net, old_net = net_a, net_b + + #logger.info(f'merging {old_net} into {keep_net}') + self.net_aliases[old_net] = keep_net + if old_net in self.nets: + for layer in self.nets[old_net]: + self.nets[keep_net][layer] += self.nets[old_net][layer] + del self.nets[old_net] + + def get(self, net: net_name_t, layer: layer_t) -> List[contour_t]: + return self.nets[self.resolve_name(net)][layer] + + def get_shorted_nets(self) -> List[Set[str]]: + shorts = defaultdict(list) + for kk in self.net_aliases: + if isinstance(kk, str): + shorts[self.resolve_name(kk)].append(kk) + + shorted_sets = [set([kk] + others) + for kk, others in shorts.items()] + return shorted_sets + + +def load_polys(layers: Sequence[Tuple[int, int]]) -> Dict[layer_t, List[NDArray[numpy.float64]]]: + polys = defaultdict(list) + for ss in topcell.shapes: + if ss.layer not in layers: + continue + + if ss.repetition is None: + displacements = [(0, 0)] + else: + displacements = ss.repetition.displacements + + for displacement in displacements: + polys[ss.layer].append( + ss.vertices + ss.offset + displacement + ) + return dict(polys) + + +def union_polys(polys: list[ArrayLike]) -> List[PyPolyNode]: + scaled_polys = scale_to_clipper(polys, CLIPPER_SCALE_FACTOR) + for poly in scaled_polys: + if (numpy.abs(poly) % 1).any(): + logger.warning('Warning: union_polys got non-integer coordinates; all values will be truncated.') + break + + poly_tree = union_nonzero(scaled_polys) + + # Partially flatten the tree, reclassifying all the "outer" (non-hole) nodes as new root nodes + unvisited_nodes = [poly_tree] + outer_nodes = [] + while unvisited_nodes: + node = unvisited_nodes.pop() # node will be the tree parent node (a container), or a hole + for poly in node.Childs: + outer_nodes.append(poly) + for hole in poly.Childs: + unvisited_nodes.append(hole) + + return outer_nodes + + + +cells, props = oasis.readfile('connectivity.oas') +#cells, props = gdsii.readfile('connectivity.gds') +topcell = cells['top'] + + +layer_info = { + ((1, 0), (1, 2), (2, 0)), #M1 to M2 + ((1, 0), (1, 3), (3, 0)), #M1 to M3 + ((2, 0), (2, 3), (3, 0)), #M2 to M3 + } + +metal_layers = set() +via_layers = set() +for top, via, bot in layer_info: + metal_layers.add(top) + metal_layers.add(bot) + via_layers.add(via) + + +topcell = topcell.subset( + shapes_func=lambda ss: ss.layer in metal_layers | via_layers, + labels_func=lambda ll: ll.layer in metal_layers, + subpatterns_func=lambda ss: True, + ) +topcell = topcell.flatten() + + +base_metal_polys = load_polys(metal_layers) +metal_polys = {layer: union_polys(base_metal_polys[layer]) + for layer in metal_layers} + +base_via_polys = load_polys(via_layers) +via_polys = {layer: union_polys(base_via_polys[layer]) + for layer in via_layers} + +## write out polys to gds +#pat = Pattern('metal_polys') +#for layer in metal_polys: +# for poly in metal_polys[layer]: +# pat.shapes.append(Polygon(layer=layer, vertices=scale_from_clipper(poly.Contour, CLIPPER_SCALE_FACTOR))) +# for hole in poly.Childs: +# pat.shapes.append(Polygon(layer=(layer[0], layer[1] + 10), vertices=scale_from_clipper(hole.Contour, CLIPPER_SCALE_FACTOR))) +#for layer in via_polys: +# for poly in via_polys[layer]: +# pat.shapes.append(Polygon(layer=layer, vertices=scale_from_clipper(poly.Contour, CLIPPER_SCALE_FACTOR))) +# for hole in poly.Childs: +# pat.shapes.append(Polygon(layer=(layer[0], layer[1] + 10), vertices=scale_from_clipper(hole.Contour, CLIPPER_SCALE_FACTOR))) +#gdsii.writefile(pat, '_polys.gds', 1e-9, 1e-6) + + +net_info = NetsInfo() + + + +def label_nets( + net_info: NetsInfo, + polys: Sequence[PyPolyNode], + point_xys: ArrayLike, + point_names: Sequence[str], + ): + for poly in polys: + poly_contour = scale_from_clipper(poly.Contour, CLIPPER_SCALE_FACTOR) + inside = poly_contains_points(poly_contour, point_xys) + for hole in poly.Childs: + hole_contour = scale_from_clipper(hole.Contour, CLIPPER_SCALE_FACTOR) + inside &= ~poly_contains_points(hole_contour, point_xys) + + inside_nets = sorted([net_name for net_name, ii in zip(point_names, inside) if ii]) + + if not inside.any(): + # No labels in this net, so it's anonymous + name = object() + net_info.nets[name][layer].append(poly) + continue + + net_info.get(inside_nets[0], layer).append(poly) + + if inside.sum() == 1: + # No short on this layer, continue + continue + + logger.warning(f'Nets {inside_nets} are shorted on layer {layer} in poly:\n {pformat(poly)}') + first_net, *defunct_nets = inside_nets + for defunct_net in defunct_nets: + net_info.merge(first_net, defunct_net) + + contours = [] + + +def tree2oriented(polys: Sequence[PyPolyNode]) -> List[ArrayLike]: + contours = [] + for poly in polys: + contours.append(poly.Contour) + contours += [hole.Contour for hole in poly.Childs] + + return union_evenodd(contours) + + +for layer in metal_layers: + labels = sorted([ll for ll in topcell.labels if ll.layer == layer], key=lambda ll: ll.string) + point_xys = [ll.offset for ll in labels] + point_names = [ll.string for ll in labels] + label_nets(net_info, metal_polys[layer], point_xys, point_names) + +# +# Take EVENODD union within each net +# & stay in EVENODD-friendly representation +# +for net in net_info.nets.values(): + for layer in net: + net[layer] = tree2oriented(net[layer]) + +for layer in via_polys: + via_polys[layer] = tree2oriented(via_polys[layer]) + +## write out nets to gds +#pat = Pattern('nets') +#for name, net in net_info.nets.items(): +# sub = Pattern(str(name)) +# for layer in net: +# print('aaaaaa', layer) +# for poly in net[layer]: +# sub.shapes.append(Polygon(layer=layer, vertices=scale_from_clipper(poly, CLIPPER_SCALE_FACTOR))) +# pat.addsp(sub) +#gdsii.writefile(pat, '_nets.gds', 1e-9, 1e-6) + + +# +# Merge nets based on via connectivity +# +merge_pairs = set() +for top_layer, via_layer, bot_layer in layer_info: + vias = via_polys[via_layer] + if not vias: + continue + + #TODO deal with polygons that have holes (loops?) + + for top_name in net_info.nets.keys(): + top_polys = net_info.nets[top_name][top_layer] + if not top_polys: + continue + + for bot_name in net_info.nets.keys(): + if bot_name == top_name: + continue + name_pair = tuple(sorted((top_name, bot_name), key=lambda s: id(s))) + if name_pair in merge_pairs: + continue + + bot_polys = net_info.nets[bot_name][bot_layer] + if not bot_polys: + continue + + via_top = intersection_evenodd(top_polys, vias) + overlap = intersection_evenodd(via_top, bot_polys) + + if not overlap: + continue + + if isinstance(bot_name, str) and isinstance(top_name, str): + logger.warning(f'Nets {top_name} and {bot_name} are shorted with via layer {via_layer} at:\n {pformat(scale_from_clipper(overlap[0], CLIPPER_SCALE_FACTOR))}') + merge_pairs.add(name_pair) + +for net_a, net_b in merge_pairs: + net_info.merge(net_a, net_b) + + +print('merged pairs') +print(pformat(merge_pairs)) + + +print('\nFinal nets:') +print([kk for kk in net_info.nets if isinstance(kk, str)]) + + +print('\nNet sets:') +for short in net_info.get_shorted_nets(): + print('(' + ','.join(sorted(list(short))) + ')') diff --git a/example.py b/example.py new file mode 100644 index 0000000..3aadff2 --- /dev/null +++ b/example.py @@ -0,0 +1,20 @@ +from masque.file import gdsii, oasis + +import snarl +import snarl.interfaces.masque + + +connectivity = { + ((1, 0), (1, 2), (2, 0)), #M1 to M2 (via V12) + ((1, 0), (1, 3), (3, 0)), #M1 to M3 (via V13) + ((2, 0), (2, 3), (3, 0)), #M2 to M3 (via V23) + } + + +#cells, props = gdsii.readfile('connectivity.gds') +cells, props = oasis.readfile('connectivity.oas') +topcell = cells['top'] + +polys, labels = snarl.interfaces.masque.read_topcell(topcell, connectivity) +nets_info = snarl.check_connectivity(polys, labels, connectivity) + diff --git a/snarl/__init__.py b/snarl/__init__.py new file mode 100644 index 0000000..9c4f490 --- /dev/null +++ b/snarl/__init__.py @@ -0,0 +1,2 @@ +from .main import check_connectivity +from . import interfaces diff --git a/snarl/clipper.py b/snarl/clipper.py new file mode 100644 index 0000000..7b13476 --- /dev/null +++ b/snarl/clipper.py @@ -0,0 +1,47 @@ +from typing import Sequence, Optional, List + +from numpy.typing import ArrayLike +from pyclipper import ( + Pyclipper, PT_CLIP, PT_SUBJECT, CT_UNION, CT_INTERSECTION, PFT_NONZERO, PFT_EVENODD, + PyPolyNode, + ) + +from .types import contour_t + + +def union_nonzero(shapes: Sequence[ArrayLike]) -> Optional[PyPolyNode]: + if not shapes: + return None + pc = Pyclipper() + pc.AddPaths(shapes, PT_CLIP, closed=True) + result = pc.Execute2(CT_UNION, PFT_NONZERO, PFT_NONZERO) + return result + + +def union_evenodd(shapes: Sequence[ArrayLike]) -> List[contour_t]: + if not shapes: + return [] + pc = Pyclipper() + pc.AddPaths(shapes, PT_CLIP, closed=True) + return pc.Execute(CT_UNION, PFT_EVENODD, PFT_EVENODD) + + +def intersection_evenodd( + subject_shapes: Sequence[ArrayLike], + clip_shapes: Sequence[ArrayLike], + ) -> List[contour_t]: + if not subject_shapes or not clip_shapes: + return [] + pc = Pyclipper() + pc.AddPaths(subject_shapes, PT_SUBJECT, closed=True) + pc.AddPaths(clip_shapes, PT_CLIP, closed=True) + return pc.Execute(CT_INTERSECTION, PFT_EVENODD, PFT_EVENODD) + + +def hier2oriented(polys: Sequence[PyPolyNode]) -> List[ArrayLike]: + contours = [] + for poly in polys: + contours.append(poly.Contour) + contours += [hole.Contour for hole in poly.Childs] + + return contours diff --git a/snarl/interfaces/__init__.py b/snarl/interfaces/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/snarl/interfaces/masque.py b/snarl/interfaces/masque.py new file mode 100644 index 0000000..8b9e3af --- /dev/null +++ b/snarl/interfaces/masque.py @@ -0,0 +1,66 @@ +from typing import Sequence, Dict, List, Any, Tuple, Optional, Mapping +from collections import defaultdict + +import numpy +from numpy.typing import NDArray +from masque import Pattern +from masque.file import oasis, gdsii +from masque.shapes import Polygon + +from ..types import layer_t +from ..utils import connectivity2layers + + +def read_topcell( + topcell: Pattern, + connectivity: Sequence[Tuple[layer_t, Optional[layer_t], layer_t]], + label_mapping: Optional[Mapping[layer_t, layer_t]] = None, + ) -> Tuple[ + defaultdict[layer_t, List[NDArray[numpy.float64]]], + defaultdict[layer_t, List[Tuple[float, float, str]]]]: + + metal_layers, via_layers = connectivity2layers(connectivity) + poly_layers = metal_layers | via_layers + + if label_mapping is None: + label_mapping = {layer: layer for layer in metal_layers} + label_layers = {label_layer for label_layer in label_mapping.keys()} + + topcell = topcell.deepcopy().subset( + shapes_func=lambda ss: ss.layer in poly_layers, + labels_func=lambda ll: ll.layer in label_layers, + subpatterns_func=lambda ss: True, + ) + topcell = topcell.flatten() + + polys = load_polys(topcell, list(poly_layers)) + + metal_labels = defaultdict(list) + for label_layer, metal_layer in label_mapping.items(): + labels = [ll for ll in topcell.labels if ll.layer == label_layer] + metal_labels[metal_layer] += [(*ll.offset, ll.string) for ll in labels] + + return polys, metal_labels + + +def load_polys( + topcell: Pattern, + layers: Sequence[layer_t], + ) -> defaultdict[layer_t, List[NDArray[numpy.float64]]]: + polys = defaultdict(list) + for ss in topcell.shapes: + if ss.layer not in layers: + continue + + assert(isinstance(ss, Polygon)) + + if ss.repetition is None: + displacements = [(0, 0)] + else: + displacements = ss.repetition.displacements + + for displacement in displacements: + polys[ss.layer].append( + ss.vertices + ss.offset + displacement + ) + return polys diff --git a/snarl/main.py b/snarl/main.py new file mode 100644 index 0000000..87839d4 --- /dev/null +++ b/snarl/main.py @@ -0,0 +1,186 @@ +from typing import Tuple, List, Dict, Set, Optional, Union, Sequence, Mapping +from collections import defaultdict +from pprint import pformat +import logging + +import numpy +from numpy.typing import NDArray, ArrayLike +from pyclipper import scale_to_clipper, scale_from_clipper, PyPolyNode + +from .types import connectivity_t, layer_t, contour_t, net_name_t +from .poly import poly_contains_points +from .clipper import union_nonzero, union_evenodd, intersection_evenodd, hier2oriented +from .tracker import NetsInfo +from .utils import connectivity2layers + + +logger = logging.getLogger(__name__) + + +def check_connectivity( + polys: Mapping[layer_t, Sequence[ArrayLike]], + labels: Mapping[layer_t, Sequence[Tuple[float, float, str]]], + connectivity: Sequence[Tuple[layer_t, Optional[layer_t], layer_t]], + label_mapping: Optional[Mapping[layer_t, layer_t]] = None, + clipper_scale_factor: int = int(2 ** 24), + ) -> NetsInfo: + + metal_layers, via_layers = connectivity2layers(connectivity) + if label_mapping is None: + label_mapping = {layer: layer for layer in metal_layers} + + metal_polys = {layer: union_input_polys(scale_to_clipper(polys[layer], clipper_scale_factor)) + for layer in metal_layers} + via_polys = {layer: union_input_polys(scale_to_clipper(polys[layer], clipper_scale_factor)) + for layer in via_layers} + + nets_info = NetsInfo() + + merge_groups: List[List[net_name_t]] = [] + for layer, labels_for_layer in labels.items(): + point_xys = [] + point_names = [] + for x, y, point_name in labels_for_layer: + point_xys.append((x, y)) + point_names.append(point_name) + + for poly in metal_polys[layer]: + found_nets = label_poly(poly, point_xys, point_names, clipper_scale_factor) + + name: net_name_t + if found_nets: + name = found_nets[0] + else: + name = object() # Anonymous net + + nets_info.get(name, layer).append(poly) + + if len(found_nets) > 1: + # Found a short + logger.warning(f'Nets {found_nets} are shorted on layer {layer} in poly:\n {pformat(poly)}') + merge_groups.append(found_nets) # type: ignore + + for group in merge_groups: + first_net, *defunct_nets = group + for defunct_net in defunct_nets: + nets_info.merge(first_net, defunct_net) + + # + # Take EVENODD union within each net + # & stay in EVENODD-friendly representation + # + for net in nets_info.nets.values(): + for layer in net: + #net[layer] = union_evenodd(hier2oriented(net[layer])) + net[layer] = hier2oriented(net[layer]) + + for layer in via_polys: + via_polys[layer] = hier2oriented(via_polys[layer]) + + + merge_pairs = find_merge_pairs(connectivity, nets_info.nets, via_polys) + for net_a, net_b in merge_pairs: + nets_info.merge(net_a, net_b) + + + print('merged pairs') + print(pformat(merge_pairs)) + + print('\nFinal nets:') + print([kk for kk in nets_info.nets if isinstance(kk, str)]) + + print('\nNet sets:') + for short in nets_info.get_shorted_nets(): + print('(' + ','.join(sorted(list(short))) + ')') + + return nets_info + + +def union_input_polys(polys: List[ArrayLike]) -> List[PyPolyNode]: + for poly in polys: + if (numpy.abs(poly) % 1).any(): + logger.warning('Warning: union_polys got non-integer coordinates; all values will be truncated.') + break + + poly_tree = union_nonzero(polys) + if poly_tree is None: + return [] + + # Partially flatten the tree, reclassifying all the "outer" (non-hole) nodes as new root nodes + unvisited_nodes = [poly_tree] + outer_nodes = [] + while unvisited_nodes: + node = unvisited_nodes.pop() # node will be the tree parent node (a container), or a hole + for poly in node.Childs: + outer_nodes.append(poly) + for hole in poly.Childs: # type: ignore + unvisited_nodes.append(hole) + + return outer_nodes + + +def label_poly( + poly: PyPolyNode, + point_xys: ArrayLike, + point_names: Sequence[str], + clipper_scale_factor: int = int(2 ** 24), + ) -> List[str]: + + poly_contour = scale_from_clipper(poly.Contour, clipper_scale_factor) + inside = poly_contains_points(poly_contour, point_xys) + for hole in poly.Childs: + hole_contour = scale_from_clipper(hole.Contour, clipper_scale_factor) + inside &= ~poly_contains_points(hole_contour, point_xys) + + inside_nets = sorted([net_name for net_name, ii in zip(point_names, inside) if ii]) + + if inside.any(): + return inside_nets + else: + return [] + + +def find_merge_pairs( + connectivity: connectivity_t, + nets: Mapping[net_name_t, Mapping[layer_t, Sequence[contour_t]]], + via_polys: Mapping[layer_t, Sequence[contour_t]], + ) -> Set[Tuple[net_name_t, net_name_t]]: + # + # Merge nets based on via connectivity + # + merge_pairs = set() + for top_layer, via_layer, bot_layer in connectivity: + if via_layer is not None: + vias = via_polys[via_layer] + if not vias: + continue + + #TODO deal with polygons that have holes (loops?) + + for top_name in nets.keys(): + top_polys = nets[top_name][top_layer] + if not top_polys: + continue + + for bot_name in nets.keys(): + if bot_name == top_name: + continue + name_pair = tuple(sorted((top_name, bot_name), key=lambda s: id(s))) + if name_pair in merge_pairs: + continue + + bot_polys = nets[bot_name][bot_layer] + if not bot_polys: + continue + + if via_layer is not None: + via_top = intersection_evenodd(top_polys, vias) + overlap = intersection_evenodd(via_top, bot_polys) + else: + overlap = intersection_evenodd(top_polys, bot_polys) # TODO verify there aren't any suspicious corner cases for this + + if not overlap: + continue + + merge_pairs.add(name_pair) + return merge_pairs diff --git a/snarl/poly.py b/snarl/poly.py new file mode 100644 index 0000000..59a8574 --- /dev/null +++ b/snarl/poly.py @@ -0,0 +1,64 @@ +import numpy +from numpy.typing import NDArray, ArrayLike + + +def poly_contains_points( + vertices: ArrayLike, + points: ArrayLike, + include_boundary: bool = True, + ) -> NDArray[numpy.int_]: + """ + Tests whether the provided points are inside the implicitly closed polygon + described by the provided list of vertices. + + Args: + vertices: Nx2 Arraylike of form [[x0, y0], [x1, y1], ...], describing an implicitly- + closed polygon. Note that this should include any offsets. + points: Nx2 ArrayLike of form [[x0, y0], [x1, y1], ...] containing the points to test. + include_boundary: True if points on the boundary should be count as inside the shape. + Default True. + + Returns: + ndarray of booleans, [point0_is_in_shape, point1_is_in_shape, ...] + """ + points = numpy.array(points, copy=False) + vertices = numpy.array(vertices, copy=False) + + if points.size == 0: + return numpy.zeros(0) + + min_bounds = numpy.min(vertices, axis=0)[None, :] + max_bounds = numpy.max(vertices, axis=0)[None, :] + + trivially_outside = ((points < min_bounds).any(axis=1) + | (points > max_bounds).any(axis=1)) + + nontrivial = ~trivially_outside + if trivially_outside.all(): + inside = numpy.zeros_like(trivially_outside, dtype=bool) + return inside + + ntpts = points[None, nontrivial, :] # nontrivial points, along axis 1 of ndarray + verts = vertices[:, None, :] # vertices, along axis 0 + xydiff = ntpts - verts # Expands into (n_vertices, n_ntpts, 2) + + y0_le = xydiff[:, :, 1] >= 0 # y_point >= y_vertex (axes 0, 1 for all points & vertices) + y1_le = numpy.roll(y0_le, -1, axis=0) # same thing for next vertex + + upward = y0_le & ~y1_le # edge passes point y coord going upwards + downward = ~y0_le & y1_le # edge passes point y coord going downwards + + dv = numpy.roll(verts, -1, axis=0) - verts + is_left = (dv[..., 0] * xydiff[..., 1] # >0 if left of dv, <0 if right, 0 if on the line + - dv[..., 1] * xydiff[..., 0]) + + winding_number = ((upward & (is_left > 0)).sum(axis=0) + - (downward & (is_left < 0)).sum(axis=0)) + + nontrivial_inside = winding_number != 0 # filter nontrivial points based on winding number + if include_boundary: + nontrivial_inside[(is_left == 0).any(axis=0)] = True # check if point lies on any edge + + inside = nontrivial.copy() + inside[nontrivial] = nontrivial_inside + return inside diff --git a/snarl/tracker.py b/snarl/tracker.py new file mode 100644 index 0000000..802d39f --- /dev/null +++ b/snarl/tracker.py @@ -0,0 +1,50 @@ +from typing import List, Set +from collections import defaultdict + +from .types import layer_t, net_name_t, contour_t + + +class NetsInfo: + nets: defaultdict[net_name_t, defaultdict[layer_t, List]] + net_aliases: defaultdict[net_name_t, net_name_t] + + def __init__(self) -> None: + self.nets = defaultdict(lambda: defaultdict(list)) + self.net_aliases = defaultdict(list) + + def resolve_name(self, net_name: net_name_t) -> net_name_t: + while net_name in self.net_aliases: + net_name = self.net_aliases[net_name] + return net_name + + def merge(self, net_a: net_name_t, net_b: net_name_t) -> None: + net_a = self.resolve_name(net_a) + net_b = self.resolve_name(net_b) + + # Always keep named nets if the other is anonymous + if not isinstance(net_a, str) and isinstance(net_b, str): + keep_net, old_net = net_b, net_a + else: + keep_net, old_net = net_a, net_b + + #logger.info(f'merging {old_net} into {keep_net}') + self.net_aliases[old_net] = keep_net + if old_net in self.nets: + for layer in self.nets[old_net]: + self.nets[keep_net][layer] += self.nets[old_net][layer] + del self.nets[old_net] + + def get(self, net: net_name_t, layer: layer_t) -> List[contour_t]: + return self.nets[self.resolve_name(net)][layer] + + def get_shorted_nets(self) -> List[Set[str]]: + shorts = defaultdict(list) + for kk in self.net_aliases: + if isinstance(kk, str): + base_name = self.resolve_name(kk) + assert(isinstance(base_name, str)) + shorts[base_name].append(kk) + + shorted_sets = [set([kk] + others) + for kk, others in shorts.items()] + return shorted_sets diff --git a/snarl/types.py b/snarl/types.py new file mode 100644 index 0000000..1acf31e --- /dev/null +++ b/snarl/types.py @@ -0,0 +1,6 @@ +from typing import Union, Tuple, List, Sequence, Optional + +layer_t = Tuple[int, int] +contour_t = List[Tuple[int, int]] +net_name_t = Union[str, object] +connectivity_t = Sequence[Tuple[layer_t, Optional[layer_t], layer_t]] diff --git a/snarl/utils.py b/snarl/utils.py new file mode 100644 index 0000000..339c6be --- /dev/null +++ b/snarl/utils.py @@ -0,0 +1,19 @@ +from typing import Set, Tuple + +from .types import connectivity_t, layer_t + + +def connectivity2layers( + connectivity: connectivity_t, + ) -> Tuple[Set[layer_t], Set[layer_t]]: + metal_layers = set() + via_layers = set() + for top, via, bot in connectivity: + metal_layers.add(top) + metal_layers.add(bot) + if via is not None: + via_layers.add(via) + + # TODO verify no overlap between metal and via layer specifications + + return metal_layers, via_layers