hoptracker 1.0.0

Sign up to get free protection for your applications and to get access to all the features.
checksums.yaml ADDED
@@ -0,0 +1,7 @@
1
+ ---
2
+ SHA256:
3
+ metadata.gz: f5e7307d2bd6ca1b4c81545cce71b5f00433317992d0494493c6c7fd70f4e215
4
+ data.tar.gz: 32b1e15dd7777677f9cc574443fec65a33069ca8ce472ccf66c2e5f300a9a2fa
5
+ SHA512:
6
+ metadata.gz: ddea919a498c92c97a2c111d73a445e9823d5bf5387d427d6f42320eed5e826824b5e47f7af109cae5a926eabd70a0a7db32fb70e87521df5ef25aac5ab73f75
7
+ data.tar.gz: 47fce4ef081ea017c6946c58ccd2a29669f815405ecdaf26f418c31769641254f68574961526a2819387fbd695e9d7a69f06201410914128e85aa31497858183
data/LICENSE ADDED
@@ -0,0 +1,232 @@
1
+ GNU GENERAL PUBLIC LICENSE
2
+ Version 3, 29 June 2007
3
+
4
+ Copyright © 2007 Free Software Foundation, Inc. <https://fsf.org/>
5
+
6
+ Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed.
7
+
8
+ Preamble
9
+
10
+ The GNU General Public License is a free, copyleft license for software and other kinds of works.
11
+
12
+ 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.
13
+
14
+ 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.
15
+
16
+ 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.
17
+
18
+ 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.
19
+
20
+ 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.
21
+
22
+ 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.
23
+
24
+ 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.
25
+
26
+ 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.
27
+
28
+ The precise terms and conditions for copying, distribution and modification follow.
29
+
30
+ TERMS AND CONDITIONS
31
+
32
+ 0. Definitions.
33
+
34
+ “This License” refers to version 3 of the GNU General Public License.
35
+
36
+ “Copyright” also means copyright-like laws that apply to other kinds of works, such as semiconductor masks.
37
+
38
+ “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.
39
+
40
+ 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.
41
+
42
+ A “covered work” means either the unmodified Program or a work based on the Program.
43
+
44
+ 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.
45
+
46
+ 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.
47
+
48
+ 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.
49
+
50
+ 1. Source Code.
51
+ 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.
52
+
53
+ 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.
54
+
55
+ 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.
56
+
57
+ 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.
58
+
59
+ The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source.
60
+
61
+ The Corresponding Source for a work in source code form is that same work.
62
+
63
+ 2. Basic Permissions.
64
+ 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.
65
+
66
+ 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.
67
+
68
+ Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary.
69
+
70
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
71
+ 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.
72
+
73
+ 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.
74
+
75
+ 4. Conveying Verbatim Copies.
76
+ 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.
77
+
78
+ 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.
79
+
80
+ 5. Conveying Modified Source Versions.
81
+ 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:
82
+
83
+ a) The work must carry prominent notices stating that you modified it, and giving a relevant date.
84
+
85
+ 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”.
86
+
87
+ 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.
88
+
89
+ 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.
90
+
91
+ 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.
92
+
93
+ 6. Conveying Non-Source Forms.
94
+ 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:
95
+
96
+ 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.
97
+
98
+ 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.
99
+
100
+ 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.
101
+
102
+ 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.
103
+
104
+ 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.
105
+
106
+ 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.
107
+
108
+ 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.
109
+
110
+ “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.
111
+
112
+ 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).
113
+
114
+ 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.
115
+
116
+ 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.
117
+
118
+ 7. Additional Terms.
119
+ “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.
120
+
121
+ 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.
122
+
123
+ 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:
124
+
125
+ a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or
126
+
127
+ 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
128
+
129
+ 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
130
+
131
+ d) Limiting the use for publicity purposes of names of licensors or authors of the material; or
132
+
133
+ e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or
134
+
135
+ 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.
136
+
137
+ 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.
138
+
139
+ 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.
140
+
141
+ 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.
142
+
143
+ 8. Termination.
144
+ 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).
145
+
146
+ 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.
147
+
148
+ 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.
149
+
150
+ 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.
151
+
152
+ 9. Acceptance Not Required for Having Copies.
153
+ 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.
154
+
155
+ 10. Automatic Licensing of Downstream Recipients.
156
+ 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.
157
+
158
+ 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.
159
+
160
+ 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.
161
+
162
+ 11. Patents.
163
+ 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”.
164
+
165
+ 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.
166
+
167
+ 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.
168
+
169
+ 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.
170
+
171
+ 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.
172
+
173
+ 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.
174
+
175
+ 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.
176
+
177
+ 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.
178
+
179
+ 12. No Surrender of Others' Freedom.
180
+ 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.
181
+
182
+ 13. Use with the GNU Affero General Public License.
183
+ 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.
184
+
185
+ 14. Revised Versions of this License.
186
+ 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.
187
+
188
+ 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.
189
+
190
+ 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.
191
+
192
+ 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.
193
+
194
+ 15. Disclaimer of Warranty.
195
+ 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.
196
+
197
+ 16. Limitation of Liability.
198
+ 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.
199
+
200
+ 17. Interpretation of Sections 15 and 16.
201
+ 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.
202
+
203
+ END OF TERMS AND CONDITIONS
204
+
205
+ How to Apply These Terms to Your New Programs
206
+
207
+ 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.
208
+
209
+ 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.
210
+
211
+ hoptracker
212
+ Copyright (C) 2024 mark22k
213
+
214
+ 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.
215
+
216
+ 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.
217
+
218
+ You should have received a copy of the GNU General Public License along with this program. If not, see <https://www.gnu.org/licenses/>.
219
+
220
+ Also add information on how to contact you by electronic and paper mail.
221
+
222
+ If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode:
223
+
224
+ hoptracker Copyright (C) 2024 mark22k
225
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
226
+ This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details.
227
+
228
+ 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”.
229
+
230
+ 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 <https://www.gnu.org/licenses/>.
231
+
232
+ 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 <https://www.gnu.org/philosophy/why-not-lgpl.html>.
data/README.md ADDED
@@ -0,0 +1,12 @@
1
+ # hoptracker
2
+
3
+ hoptracker has the following range of functions:
4
+ - Determine the hops on the path.
5
+ - Determine the MTU of the path and where it changes.
6
+ - Estimate how many hops a hop took back to the local computer and display the corresponding asymmetry.
7
+ - Show latency (or loss) of three probes to each hop.
8
+
9
+ HopTracker has the following features:
10
+ - Use of Paris traceroute methods to maintain the same path for load balancing.
11
+ - Use of 33434 as destination port.
12
+ - Since the program does not work asynchronously, latency errors of around 0.1 ms may occur.
data/bin/hoptracker ADDED
@@ -0,0 +1,77 @@
1
+ #!/usr/bin/env ruby
2
+ # frozen_string_literal: true
3
+ # sharable_constant_value: literal
4
+
5
+ require 'hoptracker/prober'
6
+
7
+ prober = HopTracker::Prober.new ARGV[0]
8
+
9
+ # Set the MTU to the maximum and the TTL counter to 1
10
+ counter = 1
11
+ mtu = 65535
12
+
13
+ # Probe until the maximum TTL is reached.
14
+ while counter < 256
15
+ message = "#{counter}:"
16
+
17
+ result = prober.probe counter, mtu
18
+
19
+ unless result[:hop_names].empty?
20
+ names = result[:hop_names].map do |name|
21
+ case name[:type]
22
+ when :none
23
+ "NONE?"
24
+ when :local
25
+ "LOCAL"
26
+ when :address
27
+ ip_name = name[:address].ip_address
28
+ begin
29
+ rdns = name[:address].getnameinfo[0]
30
+ rescue Socket::ResolutionError => e
31
+ rdns = "failure!"
32
+ end
33
+
34
+ ip_name += " (#{rdns})" if rdns && rdns != ip_name
35
+
36
+ ip_name
37
+ end
38
+ end
39
+ message += " hop #{names.join ' '}"
40
+ end
41
+
42
+ if result[:mtus].empty?
43
+ unless result[:hop_ttls].empty?
44
+ message += " ttl #{result[:hop_ttls].join ' '}"
45
+ end
46
+
47
+ unless result[:hop_asymms].empty?
48
+ message += " asymm #{result[:hop_asymms].join ' '}"
49
+ end
50
+
51
+ unless result[:hop_latencies].empty?
52
+ latencies = result[:hop_latencies].map do |latency|
53
+ format('%.3f', latency * 1000)
54
+ end
55
+ message += " latency #{latencies.join ' '}"
56
+
57
+ message += " lost #{3 - result[:hop_latencies].length}/3"
58
+ end
59
+ else
60
+ mtu = result[:mtus].min
61
+ message += " mtu #{result[:mtus].join ' '}"
62
+ end
63
+
64
+ if result[:hop_latencies].empty? && result[:mtus].empty? && result[:hop_names].empty?
65
+ message += ' no reply'
66
+ end
67
+
68
+ if result[:target_reached]
69
+ message += ' reached'
70
+ end
71
+
72
+ puts message
73
+
74
+ break if result[:target_reached]
75
+
76
+ counter += 1 if result[:mtus].empty?
77
+ end
@@ -0,0 +1,13 @@
1
+ # frozen_string_literal: true
2
+ # sharable_constant_value: literal
3
+
4
+ module HopTracker
5
+
6
+ RECVERR_ORIGINS = {
7
+ SO_EE_ORIGIN_NONE: 0,
8
+ SO_EE_ORIGIN_LOCAL: 1,
9
+ SO_EE_ORIGIN_ICMP: 2,
10
+ SO_EE_ORIGIN_ICMP6: 3
11
+ }
12
+
13
+ end
@@ -0,0 +1,11 @@
1
+ # frozen_string_literal: true
2
+ # sharable_constant_value: literal
3
+
4
+ module HopTracker
5
+
6
+ class HopTrackerError < StandardError; end
7
+ class FailedToInitializeProber < HopTrackerError; end
8
+ class ProbeError < HopTrackerError; end
9
+ class InvalidReturnedProbe < ProbeError; end
10
+
11
+ end
@@ -0,0 +1,331 @@
1
+ # frozen_string_literal: true
2
+ # sharable_constant_value: literal
3
+
4
+ # I will only refer to TTL in the documentation. With IPv6, I am of course referring to the hop limit.
5
+
6
+ module HopTracker
7
+
8
+ # Helper function: Returns the Errno name for an Errno number.
9
+ #
10
+ # @param errno_number [Integer]
11
+ # @return [Symbol]
12
+ def self.errno_name(errno_number)
13
+ Errno.constants.each do |constant_name|
14
+ if Errno.const_get(constant_name)::Errno == errno_number
15
+ return constant_name
16
+ end
17
+ end
18
+ return nil
19
+ end
20
+
21
+ # The Prober class provides tools to probe the hops on the way to a destination.
22
+ #
23
+ # A type check does not take place in any function of the class. It is assumed that the correct type (and within its value limits) is used for each argument.
24
+ class Prober
25
+
26
+ require 'socket'
27
+ require 'msgpack'
28
+ require 'active_support'
29
+ require 'active_support/core_ext'
30
+ require_relative 'exceptions'
31
+ require_relative 'constants'
32
+
33
+ # @param destination [String] The destination (an IP address or host name)
34
+ def initialize(destination)
35
+ # If necessary, resolve the DNS name and return the corresponding Addrinfo object
36
+ possible_destinations = Addrinfo.getaddrinfo(destination, 33434, nil, Socket::SOCK_DGRAM, Socket::IPPROTO_UDP)
37
+ # Delete all objects that do not have an IP address (such as Unix sockets)
38
+ possible_destinations.keep_if(&:ip?)
39
+ # If there are no more addresses left, there is a problem.
40
+ raise FailedToInitializeProber, 'No addresses available for probing' if possible_destinations.empty?
41
+ # The destination should be the first remaining address.
42
+ @destination = possible_destinations[0]
43
+
44
+ # Next, we create a socket. This automatically binds to a fixed local port so that this no longer needs to be done later with #bind.
45
+ # The fixed local port is one of the prerequisites for Paris-Traceroute.
46
+ @socket = @destination.connect
47
+
48
+ # Next, we allow errors to be received, which means that we will later have ICMP error messages. Furthermore, we set the flag for MTU Discover so that packets are not fragmented. We also want to know the TTL of the packet we are receiving.
49
+ # Requires patch for IPv6
50
+ if @destination.ipv6?
51
+ # Some constants are currently missing for IPv6. I have created both a bug report [1] and a PR [2] for this.
52
+ # [1] https://bugs.ruby-lang.org/issues/20258
53
+ # [2] https://github.com/ruby/ruby/pull/9930
54
+ if defined?(Socket::IPV6_RECVERR) && defined?(Socket::IPV6_MTU_DISCOVER)
55
+ @socket.setsockopt Socket::IPPROTO_IPV6, Socket::IPV6_RECVERR, 1
56
+ @socket.setsockopt Socket::IPPROTO_IPV6, Socket::IPV6_MTU_DISCOVER, 3
57
+ else
58
+ # Since the program should still try to work, we use frequently used numbers as a fallback.
59
+ warn "Please use a Ruby version that includes PR#9930 on GitHub or has closed bug #20258. Using fallback numbers... This can lead to errors."
60
+ @socket.setsockopt Socket::IPPROTO_IPV6, 25, 1
61
+ @socket.setsockopt Socket::IPPROTO_IPV6, 23, 3
62
+ end
63
+ @socket.setsockopt Socket::IPPROTO_IPV6, Socket::IPV6_RECVHOPLIMIT, 1
64
+ else
65
+ @socket.setsockopt Socket::IPPROTO_IP, Socket::IP_RECVERR, 1
66
+ @socket.setsockopt Socket::IPPROTO_IP, Socket::IP_MTU_DISCOVER, 3
67
+ @socket.setsockopt Socket::IPPROTO_IP, Socket::IP_RECVTTL, 1
68
+ end
69
+ rescue SocketError => e
70
+ # If there is an error when creating the socket, the traceroute cannot be executed.
71
+ raise FailedToInitializeProber, e.message
72
+ end
73
+
74
+ # Probe sends a probe, receives it and creates a usable result.
75
+ #
76
+ # @param ttl [Integer]
77
+ # @param mtu [Integer]
78
+ def probe(ttl, mtu)
79
+ sended_probes = send_probes ttl, mtu, 3
80
+ received_probes = receive_probes ttl, mtu, 3, 5
81
+ result = process_probes sended_probes, received_probes, ttl
82
+
83
+ return result
84
+ end
85
+
86
+ private
87
+
88
+ def process_probes(sended_probes, received_probes, ttl)
89
+ # First, the latency is calculated for each probe.
90
+ probes = received_probes.map do |probe|
91
+ # The latency can only be determined if it is known which probe has returned. However, it can happen that none are returned. Therefore, the latency cannot be calculated.
92
+ if probe[:probe_n]
93
+ received_time = probe[:time]
94
+ sended_time = sended_probes[probe[:probe_n]][:send_time]
95
+ # To do this, the time when the probe was sent is minus the time when the probe (or the error message from it) was received.
96
+ latency = received_time - sended_time
97
+ probe[:latency] = latency
98
+ end
99
+ probe.delete :time
100
+
101
+ probe
102
+ end
103
+
104
+ # Now each probe is processed. This means interpreting the data received and saving simplified results.
105
+ probes.map do |probe|
106
+ probe[:controls].each do |control|
107
+ # To do this, every Control message received is scanned. These contain, for example, the sender of the ICMP error message and therefore a hop address.
108
+ if control.cmsg_is?(Socket::IPPROTO_IP, Socket::IP_RECVERR) || control.cmsg_is?(Socket::IPPROTO_IPV6, Socket::IPV6_RECVERR)
109
+ # Although IPv4 and IPv6 are different, the structures that are returned appear to be the same for both.
110
+ # The structure is documented under man recvmsg MSG_ERRQUEUE. As there are no C structs (and therefore sock_extended_err) in Ruby, the message is evaluated using unpack.
111
+ errno, origin, type, code, pad, info, data = control.data.unpack('LCCCCLL')
112
+ if origin == RECVERR_ORIGINS[:SO_EE_ORIGIN_NONE]
113
+ probe[:hop_name] = { type: :none }
114
+ elsif origin == RECVERR_ORIGINS[:SO_EE_ORIGIN_LOCAL]
115
+ probe[:hop_name] = { type: :local }
116
+ if errno == Errno::EMSGSIZE::Errno
117
+ probe[:mtu] = info
118
+ else
119
+ # If an unknown error message is returned, this still needs to be implemented.
120
+ warn "Unknown errno: #{HopTracker::errno_name errno} / #{control.inspect}"
121
+ end
122
+ else # RECVERR_ORIGINS[:SO_EE_ORIGIN_ICMP] or RECVERR_ORIGINS[:SO_EE_ORIGIN_ICMP6]
123
+ if errno == Errno::EHOSTUNREACH::Errno
124
+ address = Addrinfo.new(control.data[16..])
125
+ probe[:hop_name] = { type: :address, address: }
126
+ elsif errno == Errno::ECONNREFUSED::Errno
127
+ address = Addrinfo.new(control.data[16..])
128
+ probe[:hop_name] = { type: :address, address: }
129
+ probe[:target_reached] = true
130
+ elsif errno == Errno::EMSGSIZE::Errno
131
+ address = Addrinfo.new(control.data[16..])
132
+ probe[:hop_name] = { type: :address, address: }
133
+ probe[:mtu] = info
134
+ else
135
+ # If an unknown error message is returned, this still needs to be implemented.
136
+ warn "Unknown errno: #{HopTracker::errno_name errno} / #{control.inspect}"
137
+ end
138
+ end
139
+ elsif control.cmsg_is?(Socket::IPPROTO_IP, Socket::IP_TTL) || control.cmsg_is?(Socket::IPPROTO_IPV6, Socket::IPV6_HOPLIMIT)
140
+ decoded_hop_ttl = control.data.unpack('L')
141
+ raise 'Failed to decode hop count' if decoded_hop_ttl.empty?
142
+ probe[:hop_ttl] = decoded_hop_ttl[0]
143
+ else
144
+ warn "Unknown control: #{control.inspect}"
145
+ end
146
+ end
147
+ # The evaluated data no longer needs to be saved.
148
+ probe.delete :controls
149
+
150
+ if probe[:hop_ttl]
151
+ # Guess how many hops the package took back
152
+ # I "stole" this if condition from tracepath.
153
+ asymm = if probe[:hop_ttl] <= 64
154
+ 65 - probe[:hop_ttl]
155
+ elsif probe[:hop_ttl] <= 128
156
+ 129 - probe[:hop_ttl]
157
+ else
158
+ 256 - probe[:hop_ttl]
159
+ end
160
+
161
+ # If it has a different number of hops than the outward path, make a note of this.
162
+ probe[:asymm] = asymm if asymm != ttl
163
+ end
164
+
165
+ # The evaluated data no longer needs to be saved.
166
+ probe.delete :flags
167
+ probe
168
+ end
169
+
170
+ result = nil
171
+
172
+ # Next, duplicate data is removed (except for latency).
173
+ # It is unlikely, but hoptracker could receive all three probe responses from different routers. If this is the case, this should not be "hidden", but communicated openly. However, if it is not the case, the output should still look nice - hence the removal of duplicates.
174
+ mtus = probes.map { |v| v[:mtu] }
175
+ mtus.compact!
176
+ mtus.uniq!
177
+
178
+ hop_names = probes.map { |v| v[:hop_name] }
179
+ hop_names.compact!
180
+ hop_names.uniq! do |name|
181
+ # Comparing Addrinfo objects seems to be difficult. Accordingly, searching for duplicates is also difficult.
182
+ [
183
+ name[:type],
184
+ name[:address]&.ip_address,
185
+ name[:address]&.ip_port,
186
+ name[:address]&.pfamily,
187
+ name[:address]&.protocol,
188
+ name[:address]&.socktype
189
+ ]
190
+ end
191
+
192
+ hop_ttls = probes.map { |v| v[:hop_ttl] }
193
+ hop_ttls.compact!
194
+ hop_ttls.uniq!
195
+
196
+ hop_asymms = probes.map { |v| v[:asymm] }
197
+ hop_asymms.compact!
198
+ hop_asymms.uniq!
199
+
200
+ hop_latencies = probes.map { |v| v[:latency] }
201
+ hop_latencies.compact!
202
+
203
+ target_reacheds = probes.map { |v| v[:target_reached] }
204
+ target_reacheds.compact!
205
+ target_reached = (! target_reacheds.include?(false)) && target_reacheds.include?(true)
206
+
207
+ result = {
208
+ hop_names:,
209
+ hop_asymms:,
210
+ hop_ttls:,
211
+ hop_latencies:,
212
+ target_reached:,
213
+ mtus:
214
+ }
215
+
216
+ return result
217
+ end
218
+
219
+ def receive_probes(ttl, mtu, n, timeout)
220
+ received_probes = []
221
+ begin_waiting = Time.now
222
+ while (Time.now - begin_waiting) < timeout.seconds && received_probes.length < n
223
+ # Thanks to https://stackoverflow.com/questions/77981387/how-can-i-see-icmp-error-messages-in-response-to-udp-messages-in-ruby#comment-137479018
224
+ probe = @socket.recvmsg_nonblock mtu, Socket::MSG_ERRQUEUE, mtu, exception: false
225
+
226
+ # If no probe can currently be received, the system should wait a maximum of timeout seconds. The loop should then abort.
227
+ if probe == :wait_readable
228
+ IO.select [@socket], nil, nil, timeout
229
+ else
230
+ begin
231
+ received_time = Time.now
232
+
233
+ raise InvalidReturnedProbe, 'Returned probe has a different destination.' unless probe[1].to_s == @destination.to_s
234
+
235
+ if probe[0].empty?
236
+ # If the message that was sent is not received again, either a router is incorrectly configured or an error message such as an MTU change is received. Since we cannot assign the probe (and the probe number, which is stored in the probe itself, is missing), no latency can be stored, which means that no time needs to be stored.
237
+ received_probes << {
238
+ flags: probe[2],
239
+ controls: probe[3..],
240
+ time: received_time
241
+ }
242
+ else
243
+ # The probe should be "unpacked" and checked for major errors. If possible, this should not take much time so that the program does not work asynchronously and the next probe should be received as soon as possible.
244
+ full_content = probe[0]
245
+
246
+ payload_length_information = full_content[0..1].unpack('n')
247
+ raise InvalidReturnedProbe, 'Could not unpack the length information.' if payload_length_information.empty?
248
+ payload_length_information = payload_length_information[0] + 1
249
+
250
+ begin
251
+ decoded_probe = MessagePack.unpack full_content[2..payload_length_information]
252
+ rescue MessagePack::MalformedFormatError => e
253
+ raise InvalidReturnedProbe, 'The encoded probe could not be decoded.'
254
+ end
255
+
256
+ raise InvalidReturnedProbe, 'Encoded data in probe is different than expected (root is not a hash).' unless decoded_probe.is_a? Hash
257
+ raise InvalidReturnedProbe, 'Encoded data in probe is different than expected (ttl is not a integer).' unless decoded_probe['ttl'].is_a? Integer
258
+ raise InvalidReturnedProbe, 'The TTL does not match the current probe.' unless decoded_probe['ttl'] == ttl
259
+
260
+ received_probes << {
261
+ probe_n: decoded_probe['probe_n'],
262
+ flags: probe[2],
263
+ controls: probe[3..],
264
+ time: received_time
265
+ }
266
+ end
267
+
268
+ # puts "It took #{(Time.now - received_time) * 1000} seconds to process the received probe."
269
+ rescue InvalidReturnedProbe => e
270
+ warn "Faulty probe: #{e.message} / #{probe.inspect}"
271
+ end
272
+ end
273
+ end
274
+
275
+ return received_probes
276
+ end
277
+
278
+ def send_probes(ttl, mtu, n)
279
+ set_ttl ttl
280
+
281
+ # IP header (IPv6 40 bytes, IPv4 20 bytes) + UDP header (8 Bytes) ... + payload
282
+ header_length = (@destination.ipv6? ? 40 : 20) + 8
283
+
284
+ # Send three probes
285
+ probes = []
286
+ n.times do |probe_n|
287
+ # Probe format:
288
+ # 16-bit integer (big-endian) - Length of the following message
289
+ # As 65535 is the maximum MTU, the maximum length of the message can be 65535. A 16-bit integer is therefore sufficient.
290
+ # MessagePack-encoded message - Consists of a hash with the following values:
291
+ # probe_n: Number of the probe. This allows the latency to be calculated later.
292
+ # ttl: TTL of the probe. This allows delayed probes to be ignored.
293
+ # Padding - Filled with zero bytes. This makes it possible to artificially increase the size of the message in order to reach the MTU.
294
+
295
+ # Create the message encoded with MessagePack.
296
+ payload = { probe_n:, ttl: }.to_msgpack
297
+ # Create the 16-bit integer (see probe format)
298
+ payload_length_information = [payload.length].pack('n')
299
+
300
+ # Calculation of the number of characters that must be filled to reach the MTU
301
+ padding_length = mtu - header_length - 2 - payload.length
302
+ # 2 = 16-bit-integer = payload length information
303
+
304
+ # If the message is too small for the MTU, this means that traceroute cannot be started. An error is thrown.
305
+ raise 'MTU too small' if padding_length.negative?
306
+
307
+ begin
308
+ @socket.sendmsg "#{payload_length_information}#{payload}#{"\0" * padding_length}", 0
309
+ rescue Errno::EMSGSIZE => e
310
+ # Ignore MTU errors when sending, as we process the error later when receiving the error message
311
+ # warn "Failed to send probe: #{e.message} - that's okay!"
312
+ end
313
+ probes << {
314
+ send_time: Time.now
315
+ }
316
+ end
317
+
318
+ return probes
319
+ end
320
+
321
+ def set_ttl(ttl)
322
+ if @destination.ipv6?
323
+ @socket.setsockopt Socket::IPPROTO_IPV6, Socket::IPV6_UNICAST_HOPS, ttl
324
+ else
325
+ @socket.setsockopt Socket::IPPROTO_IP, Socket::IP_TTL, ttl
326
+ end
327
+ end
328
+
329
+ end
330
+
331
+ end
metadata ADDED
@@ -0,0 +1,96 @@
1
+ --- !ruby/object:Gem::Specification
2
+ name: hoptracker
3
+ version: !ruby/object:Gem::Version
4
+ version: 1.0.0
5
+ platform: ruby
6
+ authors:
7
+ - Marek Küthe
8
+ autorequire:
9
+ bindir: bin
10
+ cert_chain: []
11
+ date: 2024-02-21 00:00:00.000000000 Z
12
+ dependencies:
13
+ - !ruby/object:Gem::Dependency
14
+ name: msgpack
15
+ requirement: !ruby/object:Gem::Requirement
16
+ requirements:
17
+ - - "~>"
18
+ - !ruby/object:Gem::Version
19
+ version: '1.7'
20
+ - - ">="
21
+ - !ruby/object:Gem::Version
22
+ version: 1.7.2
23
+ type: :runtime
24
+ prerelease: false
25
+ version_requirements: !ruby/object:Gem::Requirement
26
+ requirements:
27
+ - - "~>"
28
+ - !ruby/object:Gem::Version
29
+ version: '1.7'
30
+ - - ">="
31
+ - !ruby/object:Gem::Version
32
+ version: 1.7.2
33
+ - !ruby/object:Gem::Dependency
34
+ name: activesupport
35
+ requirement: !ruby/object:Gem::Requirement
36
+ requirements:
37
+ - - "~>"
38
+ - !ruby/object:Gem::Version
39
+ version: '7.1'
40
+ - - ">="
41
+ - !ruby/object:Gem::Version
42
+ version: 7.1.3.2
43
+ type: :runtime
44
+ prerelease: false
45
+ version_requirements: !ruby/object:Gem::Requirement
46
+ requirements:
47
+ - - "~>"
48
+ - !ruby/object:Gem::Version
49
+ version: '7.1'
50
+ - - ">="
51
+ - !ruby/object:Gem::Version
52
+ version: 7.1.3.2
53
+ description: hoptracker is a paris-traceroute-like program that can discover the hops
54
+ in the path, the path MTU and where it changes, measure the TTL/hop limit, guess
55
+ asymmetric return paths and measure the latency to each hop.
56
+ email: m.k@mk16.de
57
+ executables:
58
+ - hoptracker
59
+ extensions: []
60
+ extra_rdoc_files:
61
+ - LICENSE
62
+ - README.md
63
+ files:
64
+ - LICENSE
65
+ - README.md
66
+ - bin/hoptracker
67
+ - lib/hoptracker/constants.rb
68
+ - lib/hoptracker/exceptions.rb
69
+ - lib/hoptracker/prober.rb
70
+ homepage: https://codeberg.org/mark22k/hoptracker
71
+ licenses:
72
+ - GPL-3.0-or-later
73
+ metadata:
74
+ source_code_uri: https://codeberg.org/mark22k/hoptracker
75
+ bug_tracker_uri: https://codeberg.org/mark22k/hoptracker/issues
76
+ rubygems_mfa_required: 'true'
77
+ post_install_message:
78
+ rdoc_options: []
79
+ require_paths:
80
+ - lib
81
+ required_ruby_version: !ruby/object:Gem::Requirement
82
+ requirements:
83
+ - - ">="
84
+ - !ruby/object:Gem::Version
85
+ version: '3.1'
86
+ required_rubygems_version: !ruby/object:Gem::Requirement
87
+ requirements:
88
+ - - ">="
89
+ - !ruby/object:Gem::Version
90
+ version: '0'
91
+ requirements: []
92
+ rubygems_version: 3.6.0.dev
93
+ signing_key:
94
+ specification_version: 4
95
+ summary: traceroute-like program for measuring hops, path MTU, TTL and latency.
96
+ test_files: []