Xadhoom
5 years ago
202 changed files with 12383 additions and 10753 deletions
@ -1,339 +0,0 @@
|
||||
GNU GENERAL PUBLIC LICENSE |
||||
Version 2, June 1991 |
||||
|
||||
Copyright (C) 1989, 1991 Free Software Foundation, Inc., |
||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
||||
Everyone is permitted to copy and distribute verbatim copies |
||||
of this license document, but changing it is not allowed. |
||||
|
||||
Preamble |
||||
|
||||
The licenses for most software are designed to take away your |
||||
freedom to share and change it. By contrast, the GNU General Public |
||||
License is intended to guarantee your freedom to share and change free |
||||
software--to make sure the software is free for all its users. This |
||||
General Public License applies to most of the Free Software |
||||
Foundation's software and to any other program whose authors commit to |
||||
using it. (Some other Free Software Foundation software is covered by |
||||
the GNU Lesser General Public License instead.) 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 |
||||
this service 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 make restrictions that forbid |
||||
anyone to deny you these rights or to ask you to surrender the rights. |
||||
These restrictions translate to certain responsibilities for you if you |
||||
distribute copies of the software, or if you modify it. |
||||
|
||||
For example, if you distribute copies of such a program, whether |
||||
gratis or for a fee, you must give the recipients all the rights that |
||||
you have. 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. |
||||
|
||||
We protect your rights with two steps: (1) copyright the software, and |
||||
(2) offer you this license which gives you legal permission to copy, |
||||
distribute and/or modify the software. |
||||
|
||||
Also, for each author's protection and ours, we want to make certain |
||||
that everyone understands that there is no warranty for this free |
||||
software. If the software is modified by someone else and passed on, we |
||||
want its recipients to know that what they have is not the original, so |
||||
that any problems introduced by others will not reflect on the original |
||||
authors' reputations. |
||||
|
||||
Finally, any free program is threatened constantly by software |
||||
patents. We wish to avoid the danger that redistributors of a free |
||||
program will individually obtain patent licenses, in effect making the |
||||
program proprietary. To prevent this, we have made it clear that any |
||||
patent must be licensed for everyone's free use or not licensed at all. |
||||
|
||||
The precise terms and conditions for copying, distribution and |
||||
modification follow. |
||||
|
||||
GNU GENERAL PUBLIC LICENSE |
||||
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION |
||||
|
||||
0. This License applies to any program or other work which contains |
||||
a notice placed by the copyright holder saying it may be distributed |
||||
under the terms of this General Public License. The "Program", below, |
||||
refers to any such program or work, and a "work based on the Program" |
||||
means either the Program or any derivative work under copyright law: |
||||
that is to say, a work containing the Program or a portion of it, |
||||
either verbatim or with modifications and/or translated into another |
||||
language. (Hereinafter, translation is included without limitation in |
||||
the term "modification".) Each licensee is addressed as "you". |
||||
|
||||
Activities other than copying, distribution and modification are not |
||||
covered by this License; they are outside its scope. The act of |
||||
running the Program is not restricted, and the output from the Program |
||||
is covered only if its contents constitute a work based on the |
||||
Program (independent of having been made by running the Program). |
||||
Whether that is true depends on what the Program does. |
||||
|
||||
1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the |
||||
notices that refer to this License and to the absence of any warranty; |
||||
and give any other recipients of the Program a copy of this License |
||||
along with the Program. |
||||
|
||||
You may charge a fee for the physical act of transferring a copy, and |
||||
you may at your option offer warranty protection in exchange for a fee. |
||||
|
||||
2. You may modify your copy or copies of the Program or any portion |
||||
of it, thus forming a work based on the Program, and copy and |
||||
distribute such modifications or work under the terms of Section 1 |
||||
above, provided that you also meet all of these conditions: |
||||
|
||||
a) You must cause the modified files to carry prominent notices |
||||
stating that you changed the files and the date of any change. |
||||
|
||||
b) You must cause any work that you distribute or publish, that in |
||||
whole or in part contains or is derived from the Program or any |
||||
part thereof, to be licensed as a whole at no charge to all third |
||||
parties under the terms of this License. |
||||
|
||||
c) If the modified program normally reads commands interactively |
||||
when run, you must cause it, when started running for such |
||||
interactive use in the most ordinary way, to print or display an |
||||
announcement including an appropriate copyright notice and a |
||||
notice that there is no warranty (or else, saying that you provide |
||||
a warranty) and that users may redistribute the program under |
||||
these conditions, and telling the user how to view a copy of this |
||||
License. (Exception: if the Program itself is interactive but |
||||
does not normally print such an announcement, your work based on |
||||
the Program is not required to print an announcement.) |
||||
|
||||
These requirements apply to the modified work as a whole. If |
||||
identifiable sections of that work are not derived from the Program, |
||||
and can be reasonably considered independent and separate works in |
||||
themselves, then this License, and its terms, do not apply to those |
||||
sections when you distribute them as separate works. But when you |
||||
distribute the same sections as part of a whole which is a work based |
||||
on the Program, the distribution of the whole must be on the terms of |
||||
this License, whose permissions for other licensees extend to the |
||||
entire whole, and thus to each and every part regardless of who wrote it. |
||||
|
||||
Thus, it is not the intent of this section to claim rights or contest |
||||
your rights to work written entirely by you; rather, the intent is to |
||||
exercise the right to control the distribution of derivative or |
||||
collective works based on the Program. |
||||
|
||||
In addition, mere aggregation of another work not based on the Program |
||||
with the Program (or with a work based on the Program) on a volume of |
||||
a storage or distribution medium does not bring the other work under |
||||
the scope of this License. |
||||
|
||||
3. You may copy and distribute the Program (or a work based on it, |
||||
under Section 2) in object code or executable form under the terms of |
||||
Sections 1 and 2 above provided that you also do one of the following: |
||||
|
||||
a) Accompany it with the complete corresponding machine-readable |
||||
source code, which must be distributed under the terms of Sections |
||||
1 and 2 above on a medium customarily used for software interchange; or, |
||||
|
||||
b) Accompany it with a written offer, valid for at least three |
||||
years, to give any third party, for a charge no more than your |
||||
cost of physically performing source distribution, a complete |
||||
machine-readable copy of the corresponding source code, to be |
||||
distributed under the terms of Sections 1 and 2 above on a medium |
||||
customarily used for software interchange; or, |
||||
|
||||
c) Accompany it with the information you received as to the offer |
||||
to distribute corresponding source code. (This alternative is |
||||
allowed only for noncommercial distribution and only if you |
||||
received the program in object code or executable form with such |
||||
an offer, in accord with Subsection b above.) |
||||
|
||||
The source code for a work means the preferred form of the work for |
||||
making modifications to it. For an executable work, complete source |
||||
code means all the source code for all modules it contains, plus any |
||||
associated interface definition files, plus the scripts used to |
||||
control compilation and installation of the executable. However, as a |
||||
special exception, the source code distributed need not include |
||||
anything that is normally distributed (in either source or binary |
||||
form) with the major components (compiler, kernel, and so on) of the |
||||
operating system on which the executable runs, unless that component |
||||
itself accompanies the executable. |
||||
|
||||
If distribution of executable or object code is made by offering |
||||
access to copy from a designated place, then offering equivalent |
||||
access to copy the source code from the same place counts as |
||||
distribution of the source code, even though third parties are not |
||||
compelled to copy the source along with the object code. |
||||
|
||||
4. You may not copy, modify, sublicense, or distribute the Program |
||||
except as expressly provided under this License. Any attempt |
||||
otherwise to copy, modify, sublicense or distribute the Program is |
||||
void, and will automatically terminate your rights under this License. |
||||
However, parties who have received copies, or rights, from you under |
||||
this License will not have their licenses terminated so long as such |
||||
parties remain in full compliance. |
||||
|
||||
5. You are not required to accept this License, since you have not |
||||
signed it. However, nothing else grants you permission to modify or |
||||
distribute the Program or its derivative works. These actions are |
||||
prohibited by law if you do not accept this License. Therefore, by |
||||
modifying or distributing the Program (or any work based on the |
||||
Program), you indicate your acceptance of this License to do so, and |
||||
all its terms and conditions for copying, distributing or modifying |
||||
the Program or works based on it. |
||||
|
||||
6. Each time you redistribute the Program (or any work based on the |
||||
Program), the recipient automatically receives a license from the |
||||
original licensor to copy, distribute or modify the Program subject to |
||||
these terms and conditions. You may not impose any further |
||||
restrictions on the recipients' exercise of the rights granted herein. |
||||
You are not responsible for enforcing compliance by third parties to |
||||
this License. |
||||
|
||||
7. If, as a consequence of a court judgment or allegation of patent |
||||
infringement or for any other reason (not limited to patent issues), |
||||
conditions are imposed on you (whether by court order, agreement or |
||||
otherwise) that contradict the conditions of this License, they do not |
||||
excuse you from the conditions of this License. If you cannot |
||||
distribute so as to satisfy simultaneously your obligations under this |
||||
License and any other pertinent obligations, then as a consequence you |
||||
may not distribute the Program at all. For example, if a patent |
||||
license would not permit royalty-free redistribution of the Program by |
||||
all those who receive copies directly or indirectly through you, then |
||||
the only way you could satisfy both it and this License would be to |
||||
refrain entirely from distribution of the Program. |
||||
|
||||
If any portion of this section is held invalid or unenforceable under |
||||
any particular circumstance, the balance of the section is intended to |
||||
apply and the section as a whole is intended to apply in other |
||||
circumstances. |
||||
|
||||
It is not the purpose of this section to induce you to infringe any |
||||
patents or other property right claims or to contest validity of any |
||||
such claims; this section has the sole purpose of protecting the |
||||
integrity of the free software distribution system, which is |
||||
implemented by public license practices. Many people have made |
||||
generous contributions to the wide range of software distributed |
||||
through that system in reliance on consistent application of that |
||||
system; it is up to the author/donor to decide if he or she is willing |
||||
to distribute software through any other system and a licensee cannot |
||||
impose that choice. |
||||
|
||||
This section is intended to make thoroughly clear what is believed to |
||||
be a consequence of the rest of this License. |
||||
|
||||
8. If the distribution and/or use of the Program is restricted in |
||||
certain countries either by patents or by copyrighted interfaces, the |
||||
original copyright holder who places the Program under this License |
||||
may add an explicit geographical distribution limitation excluding |
||||
those countries, so that distribution is permitted only in or among |
||||
countries not thus excluded. In such case, this License incorporates |
||||
the limitation as if written in the body of this License. |
||||
|
||||
9. The Free Software Foundation may publish revised and/or new versions |
||||
of the 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 a version number of this License which applies to it and "any |
||||
later version", you have the option of following the terms and conditions |
||||
either of that version or of any later version published by the Free |
||||
Software Foundation. If the Program does not specify a version number of |
||||
this License, you may choose any version ever published by the Free Software |
||||
Foundation. |
||||
|
||||
10. If you wish to incorporate parts of the Program into other free |
||||
programs whose distribution conditions are different, write to the author |
||||
to ask for permission. For software which is copyrighted by the Free |
||||
Software Foundation, write to the Free Software Foundation; we sometimes |
||||
make exceptions for this. Our decision will be guided by the two goals |
||||
of preserving the free status of all derivatives of our free software and |
||||
of promoting the sharing and reuse of software generally. |
||||
|
||||
NO WARRANTY |
||||
|
||||
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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. |
||||
|
||||
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING |
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR |
||||
REDISTRIBUTE THE 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. |
||||
|
||||
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 |
||||
convey the exclusion of warranty; and each file should have at least |
||||
the "copyright" line and a pointer to where the full notice is found. |
||||
|
||||
<one line to give the program's name and a brief idea of what it does.> |
||||
Copyright (C) <year> <name of author> |
||||
|
||||
This program is free software; you can redistribute it and/or modify |
||||
it under the terms of the GNU General Public License as published by |
||||
the Free Software Foundation; either version 2 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU General Public License along |
||||
with this program; if not, write to the Free Software Foundation, Inc., |
||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. |
||||
|
||||
Also add information on how to contact you by electronic and paper mail. |
||||
|
||||
If the program is interactive, make it output a short notice like this |
||||
when it starts in an interactive mode: |
||||
|
||||
Gnomovision version 69, Copyright (C) year name of author |
||||
Gnomovision 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, the commands you use may |
||||
be called something other than `show w' and `show c'; they could even be |
||||
mouse-clicks or menu items--whatever suits your program. |
||||
|
||||
You should also get your employer (if you work as a programmer) or your |
||||
school, if any, to sign a "copyright disclaimer" for the program, if |
||||
necessary. Here is a sample; alter the names: |
||||
|
||||
Yoyodyne, Inc., hereby disclaims all copyright interest in the program |
||||
`Gnomovision' (which makes passes at compilers) written by James Hacker. |
||||
|
||||
<signature of Ty Coon>, 1 April 1989 |
||||
Ty Coon, President of Vice |
||||
|
||||
This 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. |
||||
@ -1,674 +0,0 @@
|
||||
GNU GENERAL PUBLIC LICENSE |
||||
Version 3, 29 June 2007 |
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/> |
||||
Everyone is permitted to copy and distribute verbatim copies |
||||
of this license document, but changing it is not allowed. |
||||
|
||||
Preamble |
||||
|
||||
The GNU General Public License is a free, copyleft license for |
||||
software and other kinds of works. |
||||
|
||||
The licenses for most software and other practical works are designed |
||||
to take away your freedom to share and change the works. By contrast, |
||||
the GNU General Public License is intended to guarantee your freedom to |
||||
share and change all versions of a program--to make sure it remains free |
||||
software for all its users. We, the Free Software Foundation, use the |
||||
GNU General Public License for most of our software; it applies also to |
||||
any other work released this way by its authors. You can apply it to |
||||
your programs, too. |
||||
|
||||
When we speak of free software, we are referring to freedom, not |
||||
price. Our General Public Licenses are designed to make sure that you |
||||
have the freedom to distribute copies of free software (and charge for |
||||
them if you wish), that you receive source code or can get it if you |
||||
want it, that you can change the software or use pieces of it in new |
||||
free programs, and that you know you can do these things. |
||||
|
||||
To protect your rights, we need to prevent others from denying you |
||||
these rights or asking you to surrender the rights. Therefore, you have |
||||
certain responsibilities if you distribute copies of the software, or if |
||||
you modify it: responsibilities to respect the freedom of others. |
||||
|
||||
For example, if you distribute copies of such a program, whether |
||||
gratis or for a fee, you must pass on to the recipients the same |
||||
freedoms that you received. You must make sure that they, too, receive |
||||
or can get the source code. And you must show them these terms so they |
||||
know their rights. |
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps: |
||||
(1) assert copyright on the software, and (2) offer you this License |
||||
giving you legal permission to copy, distribute and/or modify it. |
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains |
||||
that there is no warranty for this free software. For both users' and |
||||
authors' sake, the GPL requires that modified versions be marked as |
||||
changed, so that their problems will not be attributed erroneously to |
||||
authors of previous versions. |
||||
|
||||
Some devices are designed to deny users access to install or run |
||||
modified versions of the software inside them, although the manufacturer |
||||
can do so. This is fundamentally incompatible with the aim of |
||||
protecting users' freedom to change the software. The systematic |
||||
pattern of such abuse occurs in the area of products for individuals to |
||||
use, which is precisely where it is most unacceptable. Therefore, we |
||||
have designed this version of the GPL to prohibit the practice for those |
||||
products. If such problems arise substantially in other domains, we |
||||
stand ready to extend this provision to those domains in future versions |
||||
of the GPL, as needed to protect the freedom of users. |
||||
|
||||
Finally, every program is threatened constantly by software patents. |
||||
States should not allow patents to restrict development and use of |
||||
software on general-purpose computers, but in those that do, we wish to |
||||
avoid the special danger that patents applied to a free program could |
||||
make it effectively proprietary. To prevent this, the GPL assures that |
||||
patents cannot be used to render the program non-free. |
||||
|
||||
The precise terms and conditions for copying, distribution and |
||||
modification follow. |
||||
|
||||
TERMS AND CONDITIONS |
||||
|
||||
0. Definitions. |
||||
|
||||
"This License" refers to version 3 of the GNU General Public License. |
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of |
||||
works, such as semiconductor masks. |
||||
|
||||
"The Program" refers to any copyrightable work licensed under this |
||||
License. Each licensee is addressed as "you". "Licensees" and |
||||
"recipients" may be individuals or organizations. |
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work |
||||
in a fashion requiring copyright permission, other than the making of an |
||||
exact copy. The resulting work is called a "modified version" of the |
||||
earlier work or a work "based on" the earlier work. |
||||
|
||||
A "covered work" means either the unmodified Program or a work based |
||||
on the Program. |
||||
|
||||
To "propagate" a work means to do anything with it that, without |
||||
permission, would make you directly or secondarily liable for |
||||
infringement under applicable copyright law, except executing it on a |
||||
computer or modifying a private copy. Propagation includes copying, |
||||
distribution (with or without modification), making available to the |
||||
public, and in some countries other activities as well. |
||||
|
||||
To "convey" a work means any kind of propagation that enables other |
||||
parties to make or receive copies. Mere interaction with a user through |
||||
a computer network, with no transfer of a copy, is not conveying. |
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices" |
||||
to the extent that it includes a convenient and prominently visible |
||||
feature that (1) displays an appropriate copyright notice, and (2) |
||||
tells the user that there is no warranty for the work (except to the |
||||
extent that warranties are provided), that licensees may convey the |
||||
work under this License, and how to view a copy of this License. If |
||||
the interface presents a list of user commands or options, such as a |
||||
menu, a prominent item in the list meets this criterion. |
||||
|
||||
1. Source Code. |
||||
|
||||
The "source code" for a work means the preferred form of the work |
||||
for making modifications to it. "Object code" means any non-source |
||||
form of a work. |
||||
|
||||
A "Standard Interface" means an interface that either is an official |
||||
standard defined by a recognized standards body, or, in the case of |
||||
interfaces specified for a particular programming language, one that |
||||
is widely used among developers working in that language. |
||||
|
||||
The "System Libraries" of an executable work include anything, other |
||||
than the work as a whole, that (a) is included in the normal form of |
||||
packaging a Major Component, but which is not part of that Major |
||||
Component, and (b) serves only to enable use of the work with that |
||||
Major Component, or to implement a Standard Interface for which an |
||||
implementation is available to the public in source code form. A |
||||
"Major Component", in this context, means a major essential component |
||||
(kernel, window system, and so on) of the specific operating system |
||||
(if any) on which the executable work runs, or a compiler used to |
||||
produce the work, or an object code interpreter used to run it. |
||||
|
||||
The "Corresponding Source" for a work in object code form means all |
||||
the source code needed to generate, install, and (for an executable |
||||
work) run the object code and to modify the work, including scripts to |
||||
control those activities. However, it does not include the work's |
||||
System Libraries, or general-purpose tools or generally available free |
||||
programs which are used unmodified in performing those activities but |
||||
which are not part of the work. For example, Corresponding Source |
||||
includes interface definition files associated with source files for |
||||
the work, and the source code for shared libraries and dynamically |
||||
linked subprograms that the work is specifically designed to require, |
||||
such as by intimate data communication or control flow between those |
||||
subprograms and other parts of the work. |
||||
|
||||
The Corresponding Source need not include anything that users |
||||
can regenerate automatically from other parts of the Corresponding |
||||
Source. |
||||
|
||||
The Corresponding Source for a work in source code form is that |
||||
same work. |
||||
|
||||
2. Basic Permissions. |
||||
|
||||
All rights granted under this License are granted for the term of |
||||
copyright on the Program, and are irrevocable provided the stated |
||||
conditions are met. This License explicitly affirms your unlimited |
||||
permission to run the unmodified Program. The output from running a |
||||
covered work is covered by this License only if the output, given its |
||||
content, constitutes a covered work. This License acknowledges your |
||||
rights of fair use or other equivalent, as provided by copyright law. |
||||
|
||||
You may make, run and propagate covered works that you do not |
||||
convey, without conditions so long as your license otherwise remains |
||||
in force. You may convey covered works to others for the sole purpose |
||||
of having them make modifications exclusively for you, or provide you |
||||
with facilities for running those works, provided that you comply with |
||||
the terms of this License in conveying all material for which you do |
||||
not control copyright. Those thus making or running the covered works |
||||
for you must do so exclusively on your behalf, under your direction |
||||
and control, on terms that prohibit them from making any copies of |
||||
your copyrighted material outside their relationship with you. |
||||
|
||||
Conveying under any other circumstances is permitted solely under |
||||
the conditions stated below. Sublicensing is not allowed; section 10 |
||||
makes it unnecessary. |
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law. |
||||
|
||||
No covered work shall be deemed part of an effective technological |
||||
measure under any applicable law fulfilling obligations under article |
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or |
||||
similar laws prohibiting or restricting circumvention of such |
||||
measures. |
||||
|
||||
When you convey a covered work, you waive any legal power to forbid |
||||
circumvention of technological measures to the extent such circumvention |
||||
is effected by exercising rights under this License with respect to |
||||
the covered work, and you disclaim any intention to limit operation or |
||||
modification of the work as a means of enforcing, against the work's |
||||
users, your or third parties' legal rights to forbid circumvention of |
||||
technological measures. |
||||
|
||||
4. Conveying Verbatim Copies. |
||||
|
||||
You may convey verbatim copies of the Program's source code as you |
||||
receive it, in any medium, provided that you conspicuously and |
||||
appropriately publish on each copy an appropriate copyright notice; |
||||
keep intact all notices stating that this License and any |
||||
non-permissive terms added in accord with section 7 apply to the code; |
||||
keep intact all notices of the absence of any warranty; and give all |
||||
recipients a copy of this License along with the Program. |
||||
|
||||
You may charge any price or no price for each copy that you convey, |
||||
and you may offer support or warranty protection for a fee. |
||||
|
||||
5. Conveying Modified Source Versions. |
||||
|
||||
You may convey a work based on the Program, or the modifications to |
||||
produce it from the Program, in the form of source code under the |
||||
terms of section 4, provided that you also meet all of these conditions: |
||||
|
||||
a) The work must carry prominent notices stating that you modified |
||||
it, and giving a relevant date. |
||||
|
||||
b) The work must carry prominent notices stating that it is |
||||
released under this License and any conditions added under section |
||||
7. This requirement modifies the requirement in section 4 to |
||||
"keep intact all notices". |
||||
|
||||
c) You must license the entire work, as a whole, under this |
||||
License to anyone who comes into possession of a copy. This |
||||
License will therefore apply, along with any applicable section 7 |
||||
additional terms, to the whole of the work, and all its parts, |
||||
regardless of how they are packaged. This License gives no |
||||
permission to license the work in any other way, but it does not |
||||
invalidate such permission if you have separately received it. |
||||
|
||||
d) If the work has interactive user interfaces, each must display |
||||
Appropriate Legal Notices; however, if the Program has interactive |
||||
interfaces that do not display Appropriate Legal Notices, your |
||||
work need not make them do so. |
||||
|
||||
A compilation of a covered work with other separate and independent |
||||
works, which are not by their nature extensions of the covered work, |
||||
and which are not combined with it such as to form a larger program, |
||||
in or on a volume of a storage or distribution medium, is called an |
||||
"aggregate" if the compilation and its resulting copyright are not |
||||
used to limit the access or legal rights of the compilation's users |
||||
beyond what the individual works permit. Inclusion of a covered work |
||||
in an aggregate does not cause this License to apply to the other |
||||
parts of the aggregate. |
||||
|
||||
6. Conveying Non-Source Forms. |
||||
|
||||
You may convey a covered work in object code form under the terms |
||||
of sections 4 and 5, provided that you also convey the |
||||
machine-readable Corresponding Source under the terms of this License, |
||||
in one of these ways: |
||||
|
||||
a) Convey the object code in, or embodied in, a physical product |
||||
(including a physical distribution medium), accompanied by the |
||||
Corresponding Source fixed on a durable physical medium |
||||
customarily used for software interchange. |
||||
|
||||
b) Convey the object code in, or embodied in, a physical product |
||||
(including a physical distribution medium), accompanied by a |
||||
written offer, valid for at least three years and valid for as |
||||
long as you offer spare parts or customer support for that product |
||||
model, to give anyone who possesses the object code either (1) a |
||||
copy of the Corresponding Source for all the software in the |
||||
product that is covered by this License, on a durable physical |
||||
medium customarily used for software interchange, for a price no |
||||
more than your reasonable cost of physically performing this |
||||
conveying of source, or (2) access to copy the |
||||
Corresponding Source from a network server at no charge. |
||||
|
||||
c) Convey individual copies of the object code with a copy of the |
||||
written offer to provide the Corresponding Source. This |
||||
alternative is allowed only occasionally and noncommercially, and |
||||
only if you received the object code with such an offer, in accord |
||||
with subsection 6b. |
||||
|
||||
d) Convey the object code by offering access from a designated |
||||
place (gratis or for a charge), and offer equivalent access to the |
||||
Corresponding Source in the same way through the same place at no |
||||
further charge. You need not require recipients to copy the |
||||
Corresponding Source along with the object code. If the place to |
||||
copy the object code is a network server, the Corresponding Source |
||||
may be on a different server (operated by you or a third party) |
||||
that supports equivalent copying facilities, provided you maintain |
||||
clear directions next to the object code saying where to find the |
||||
Corresponding Source. Regardless of what server hosts the |
||||
Corresponding Source, you remain obligated to ensure that it is |
||||
available for as long as needed to satisfy these requirements. |
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided |
||||
you inform other peers where the object code and Corresponding |
||||
Source of the work are being offered to the general public at no |
||||
charge under subsection 6d. |
||||
|
||||
A separable portion of the object code, whose source code is excluded |
||||
from the Corresponding Source as a System Library, need not be |
||||
included in conveying the object code work. |
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any |
||||
tangible personal property which is normally used for personal, family, |
||||
or household purposes, or (2) anything designed or sold for incorporation |
||||
into a dwelling. In determining whether a product is a consumer product, |
||||
doubtful cases shall be resolved in favor of coverage. For a particular |
||||
product received by a particular user, "normally used" refers to a |
||||
typical or common use of that class of product, regardless of the status |
||||
of the particular user or of the way in which the particular user |
||||
actually uses, or expects or is expected to use, the product. A product |
||||
is a consumer product regardless of whether the product has substantial |
||||
commercial, industrial or non-consumer uses, unless such uses represent |
||||
the only significant mode of use of the product. |
||||
|
||||
"Installation Information" for a User Product means any methods, |
||||
procedures, authorization keys, or other information required to install |
||||
and execute modified versions of a covered work in that User Product from |
||||
a modified version of its Corresponding Source. The information must |
||||
suffice to ensure that the continued functioning of the modified object |
||||
code is in no case prevented or interfered with solely because |
||||
modification has been made. |
||||
|
||||
If you convey an object code work under this section in, or with, or |
||||
specifically for use in, a User Product, and the conveying occurs as |
||||
part of a transaction in which the right of possession and use of the |
||||
User Product is transferred to the recipient in perpetuity or for a |
||||
fixed term (regardless of how the transaction is characterized), the |
||||
Corresponding Source conveyed under this section must be accompanied |
||||
by the Installation Information. But this requirement does not apply |
||||
if neither you nor any third party retains the ability to install |
||||
modified object code on the User Product (for example, the work has |
||||
been installed in ROM). |
||||
|
||||
The requirement to provide Installation Information does not include a |
||||
requirement to continue to provide support service, warranty, or updates |
||||
for a work that has been modified or installed by the recipient, or for |
||||
the User Product in which it has been modified or installed. Access to a |
||||
network may be denied when the modification itself materially and |
||||
adversely affects the operation of the network or violates the rules and |
||||
protocols for communication across the network. |
||||
|
||||
Corresponding Source conveyed, and Installation Information provided, |
||||
in accord with this section must be in a format that is publicly |
||||
documented (and with an implementation available to the public in |
||||
source code form), and must require no special password or key for |
||||
unpacking, reading or copying. |
||||
|
||||
7. Additional Terms. |
||||
|
||||
"Additional permissions" are terms that supplement the terms of this |
||||
License by making exceptions from one or more of its conditions. |
||||
Additional permissions that are applicable to the entire Program shall |
||||
be treated as though they were included in this License, to the extent |
||||
that they are valid under applicable law. If additional permissions |
||||
apply only to part of the Program, that part may be used separately |
||||
under those permissions, but the entire Program remains governed by |
||||
this License without regard to the additional permissions. |
||||
|
||||
When you convey a copy of a covered work, you may at your option |
||||
remove any additional permissions from that copy, or from any part of |
||||
it. (Additional permissions may be written to require their own |
||||
removal in certain cases when you modify the work.) You may place |
||||
additional permissions on material, added by you to a covered work, |
||||
for which you have or can give appropriate copyright permission. |
||||
|
||||
Notwithstanding any other provision of this License, for material you |
||||
add to a covered work, you may (if authorized by the copyright holders of |
||||
that material) supplement the terms of this License with terms: |
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the |
||||
terms of sections 15 and 16 of this License; or |
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or |
||||
author attributions in that material or in the Appropriate Legal |
||||
Notices displayed by works containing it; or |
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or |
||||
requiring that modified versions of such material be marked in |
||||
reasonable ways as different from the original version; or |
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or |
||||
authors of the material; or |
||||
|
||||
e) Declining to grant rights under trademark law for use of some |
||||
trade names, trademarks, or service marks; or |
||||
|
||||
f) Requiring indemnification of licensors and authors of that |
||||
material by anyone who conveys the material (or modified versions of |
||||
it) with contractual assumptions of liability to the recipient, for |
||||
any liability that these contractual assumptions directly impose on |
||||
those licensors and authors. |
||||
|
||||
All other non-permissive additional terms are considered "further |
||||
restrictions" within the meaning of section 10. If the Program as you |
||||
received it, or any part of it, contains a notice stating that it is |
||||
governed by this License along with a term that is a further |
||||
restriction, you may remove that term. If a license document contains |
||||
a further restriction but permits relicensing or conveying under this |
||||
License, you may add to a covered work material governed by the terms |
||||
of that license document, provided that the further restriction does |
||||
not survive such relicensing or conveying. |
||||
|
||||
If you add terms to a covered work in accord with this section, you |
||||
must place, in the relevant source files, a statement of the |
||||
additional terms that apply to those files, or a notice indicating |
||||
where to find the applicable terms. |
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the |
||||
form of a separately written license, or stated as exceptions; |
||||
the above requirements apply either way. |
||||
|
||||
8. Termination. |
||||
|
||||
You may not propagate or modify a covered work except as expressly |
||||
provided under this License. Any attempt otherwise to propagate or |
||||
modify it is void, and will automatically terminate your rights under |
||||
this License (including any patent licenses granted under the third |
||||
paragraph of section 11). |
||||
|
||||
However, if you cease all violation of this License, then your |
||||
license from a particular copyright holder is reinstated (a) |
||||
provisionally, unless and until the copyright holder explicitly and |
||||
finally terminates your license, and (b) permanently, if the copyright |
||||
holder fails to notify you of the violation by some reasonable means |
||||
prior to 60 days after the cessation. |
||||
|
||||
Moreover, your license from a particular copyright holder is |
||||
reinstated permanently if the copyright holder notifies you of the |
||||
violation by some reasonable means, this is the first time you have |
||||
received notice of violation of this License (for any work) from that |
||||
copyright holder, and you cure the violation prior to 30 days after |
||||
your receipt of the notice. |
||||
|
||||
Termination of your rights under this section does not terminate the |
||||
licenses of parties who have received copies or rights from you under |
||||
this License. If your rights have been terminated and not permanently |
||||
reinstated, you do not qualify to receive new licenses for the same |
||||
material under section 10. |
||||
|
||||
9. Acceptance Not Required for Having Copies. |
||||
|
||||
You are not required to accept this License in order to receive or |
||||
run a copy of the Program. Ancillary propagation of a covered work |
||||
occurring solely as a consequence of using peer-to-peer transmission |
||||
to receive a copy likewise does not require acceptance. However, |
||||
nothing other than this License grants you permission to propagate or |
||||
modify any covered work. These actions infringe copyright if you do |
||||
not accept this License. Therefore, by modifying or propagating a |
||||
covered work, you indicate your acceptance of this License to do so. |
||||
|
||||
10. Automatic Licensing of Downstream Recipients. |
||||
|
||||
Each time you convey a covered work, the recipient automatically |
||||
receives a license from the original licensors, to run, modify and |
||||
propagate that work, subject to this License. You are not responsible |
||||
for enforcing compliance by third parties with this License. |
||||
|
||||
An "entity transaction" is a transaction transferring control of an |
||||
organization, or substantially all assets of one, or subdividing an |
||||
organization, or merging organizations. If propagation of a covered |
||||
work results from an entity transaction, each party to that |
||||
transaction who receives a copy of the work also receives whatever |
||||
licenses to the work the party's predecessor in interest had or could |
||||
give under the previous paragraph, plus a right to possession of the |
||||
Corresponding Source of the work from the predecessor in interest, if |
||||
the predecessor has it or can get it with reasonable efforts. |
||||
|
||||
You may not impose any further restrictions on the exercise of the |
||||
rights granted or affirmed under this License. For example, you may |
||||
not impose a license fee, royalty, or other charge for exercise of |
||||
rights granted under this License, and you may not initiate litigation |
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that |
||||
any patent claim is infringed by making, using, selling, offering for |
||||
sale, or importing the Program or any portion of it. |
||||
|
||||
11. Patents. |
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this |
||||
License of the Program or a work on which the Program is based. The |
||||
work thus licensed is called the contributor's "contributor version". |
||||
|
||||
A contributor's "essential patent claims" are all patent claims |
||||
owned or controlled by the contributor, whether already acquired or |
||||
hereafter acquired, that would be infringed by some manner, permitted |
||||
by this License, of making, using, or selling its contributor version, |
||||
but do not include claims that would be infringed only as a |
||||
consequence of further modification of the contributor version. For |
||||
purposes of this definition, "control" includes the right to grant |
||||
patent sublicenses in a manner consistent with the requirements of |
||||
this License. |
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free |
||||
patent license under the contributor's essential patent claims, to |
||||
make, use, sell, offer for sale, import and otherwise run, modify and |
||||
propagate the contents of its contributor version. |
||||
|
||||
In the following three paragraphs, a "patent license" is any express |
||||
agreement or commitment, however denominated, not to enforce a patent |
||||
(such as an express permission to practice a patent or covenant not to |
||||
sue for patent infringement). To "grant" such a patent license to a |
||||
party means to make such an agreement or commitment not to enforce a |
||||
patent against the party. |
||||
|
||||
If you convey a covered work, knowingly relying on a patent license, |
||||
and the Corresponding Source of the work is not available for anyone |
||||
to copy, free of charge and under the terms of this License, through a |
||||
publicly available network server or other readily accessible means, |
||||
then you must either (1) cause the Corresponding Source to be so |
||||
available, or (2) arrange to deprive yourself of the benefit of the |
||||
patent license for this particular work, or (3) arrange, in a manner |
||||
consistent with the requirements of this License, to extend the patent |
||||
license to downstream recipients. "Knowingly relying" means you have |
||||
actual knowledge that, but for the patent license, your conveying the |
||||
covered work in a country, or your recipient's use of the covered work |
||||
in a country, would infringe one or more identifiable patents in that |
||||
country that you have reason to believe are valid. |
||||
|
||||
If, pursuant to or in connection with a single transaction or |
||||
arrangement, you convey, or propagate by procuring conveyance of, a |
||||
covered work, and grant a patent license to some of the parties |
||||
receiving the covered work authorizing them to use, propagate, modify |
||||
or convey a specific copy of the covered work, then the patent license |
||||
you grant is automatically extended to all recipients of the covered |
||||
work and works based on it. |
||||
|
||||
A patent license is "discriminatory" if it does not include within |
||||
the scope of its coverage, prohibits the exercise of, or is |
||||
conditioned on the non-exercise of one or more of the rights that are |
||||
specifically granted under this License. You may not convey a covered |
||||
work if you are a party to an arrangement with a third party that is |
||||
in the business of distributing software, under which you make payment |
||||
to the third party based on the extent of your activity of conveying |
||||
the work, and under which the third party grants, to any of the |
||||
parties who would receive the covered work from you, a discriminatory |
||||
patent license (a) in connection with copies of the covered work |
||||
conveyed by you (or copies made from those copies), or (b) primarily |
||||
for and in connection with specific products or compilations that |
||||
contain the covered work, unless you entered into that arrangement, |
||||
or that patent license was granted, prior to 28 March 2007. |
||||
|
||||
Nothing in this License shall be construed as excluding or limiting |
||||
any implied license or other defenses to infringement that may |
||||
otherwise be available to you under applicable patent law. |
||||
|
||||
12. No Surrender of Others' Freedom. |
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or |
||||
otherwise) that contradict the conditions of this License, they do not |
||||
excuse you from the conditions of this License. If you cannot convey a |
||||
covered work so as to satisfy simultaneously your obligations under this |
||||
License and any other pertinent obligations, then as a consequence you may |
||||
not convey it at all. For example, if you agree to terms that obligate you |
||||
to collect a royalty for further conveying from those to whom you convey |
||||
the Program, the only way you could satisfy both those terms and this |
||||
License would be to refrain entirely from conveying the Program. |
||||
|
||||
13. Use with the GNU Affero General Public License. |
||||
|
||||
Notwithstanding any other provision of this License, you have |
||||
permission to link or combine any covered work with a work licensed |
||||
under version 3 of the GNU Affero General Public License into a single |
||||
combined work, and to convey the resulting work. The terms of this |
||||
License will continue to apply to the part which is the covered work, |
||||
but the special requirements of the GNU Affero General Public License, |
||||
section 13, concerning interaction through a network will apply to the |
||||
combination as such. |
||||
|
||||
14. Revised Versions of this License. |
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of |
||||
the GNU General Public License from time to time. Such new versions will |
||||
be similar in spirit to the present version, but may differ in detail to |
||||
address new problems or concerns. |
||||
|
||||
Each version is given a distinguishing version number. If the |
||||
Program specifies that a certain numbered version of the GNU General |
||||
Public License "or any later version" applies to it, you have the |
||||
option of following the terms and conditions either of that numbered |
||||
version or of any later version published by the Free Software |
||||
Foundation. If the Program does not specify a version number of the |
||||
GNU General Public License, you may choose any version ever published |
||||
by the Free Software Foundation. |
||||
|
||||
If the Program specifies that a proxy can decide which future |
||||
versions of the GNU General Public License can be used, that proxy's |
||||
public statement of acceptance of a version permanently authorizes you |
||||
to choose that version for the Program. |
||||
|
||||
Later license versions may give you additional or different |
||||
permissions. However, no additional obligations are imposed on any |
||||
author or copyright holder as a result of your choosing to follow a |
||||
later version. |
||||
|
||||
15. Disclaimer of Warranty. |
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY |
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT |
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY |
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, |
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM |
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF |
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION. |
||||
|
||||
16. Limitation of Liability. |
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING |
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS |
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY |
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE |
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF |
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD |
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), |
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF |
||||
SUCH DAMAGES. |
||||
|
||||
17. Interpretation of Sections 15 and 16. |
||||
|
||||
If the disclaimer of warranty and limitation of liability provided |
||||
above cannot be given local legal effect according to their terms, |
||||
reviewing courts shall apply local law that most closely approximates |
||||
an absolute waiver of all civil liability in connection with the |
||||
Program, unless a warranty or assumption of liability accompanies a |
||||
copy of the Program in return for a fee. |
||||
|
||||
END OF TERMS AND CONDITIONS |
||||
|
||||
How to Apply These Terms to Your New Programs |
||||
|
||||
If you develop a new program, and you want it to be of the greatest |
||||
possible use to the public, the best way to achieve this is to make it |
||||
free software which everyone can redistribute and change under these terms. |
||||
|
||||
To do so, attach the following notices to the program. It is safest |
||||
to attach them to the start of each source file to most effectively |
||||
state the exclusion of warranty; and each file should have at least |
||||
the "copyright" line and a pointer to where the full notice is found. |
||||
|
||||
<one line to give the program's name and a brief idea of what it does.> |
||||
Copyright (C) <year> <name of author> |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU General Public License |
||||
along with this program. If not, see <http://www.gnu.org/licenses/>. |
||||
|
||||
Also add information on how to contact you by electronic and paper mail. |
||||
|
||||
If the program does terminal interaction, make it output a short |
||||
notice like this when it starts in an interactive mode: |
||||
|
||||
<program> Copyright (C) <year> <name of author> |
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. |
||||
This is free software, and you are welcome to redistribute it |
||||
under certain conditions; type `show c' for details. |
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate |
||||
parts of the General Public License. Of course, your program's commands |
||||
might be different; for a GUI interface, you would use an "about box". |
||||
|
||||
You should also get your employer (if you work as a programmer) or school, |
||||
if any, to sign a "copyright disclaimer" for the program, if necessary. |
||||
For more information on this, and how to apply and follow the GNU GPL, see |
||||
<http://www.gnu.org/licenses/>. |
||||
|
||||
The GNU General Public License does not permit incorporating your program |
||||
into proprietary programs. If your program is a subroutine library, you |
||||
may consider it more useful to permit linking proprietary applications with |
||||
the library. If this is what you want to do, use the GNU Lesser General |
||||
Public License instead of this License. But first, please read |
||||
<http://www.gnu.org/philosophy/why-not-lgpl.html>. |
||||
@ -1,37 +1,149 @@
|
||||
ZeroTier One - Network Virtualization Everywhere |
||||
Copyright (C) 2011-2017 ZeroTier, Inc. https://www.zerotier.com/ |
||||
----------------------------------------------------------------------------- |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
Business Source License 1.1 |
||||
|
||||
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. |
||||
License text copyright (c) 2017 MariaDB Corporation Ab, All Rights Reserved. |
||||
"Business Source License" is a trademark of MariaDB Corporation Ab. |
||||
|
||||
You should have received a copy of the GNU General Public License |
||||
along with this program. If not, see <http://www.gnu.org/licenses/>. |
||||
----------------------------------------------------------------------------- |
||||
|
||||
See LICENSE.GPL-3 for the full GNU GPL v3 license. |
||||
Parameters |
||||
|
||||
-- |
||||
Licensor: ZeroTier, Inc. |
||||
Licensed Work: ZeroTier Network Virtualization Engine 1.4.4 |
||||
The Licensed Work is (c)2019 ZeroTier, Inc. |
||||
Additional Use Grant: You may make use of the Licensed Work, provided you |
||||
do not use it in any of the following ways: |
||||
|
||||
You can be released from the requirements of the license by purchasing |
||||
a commercial license. Buying such a license is mandatory as soon as you |
||||
develop commercial closed-source software that incorporates or links |
||||
directly against ZeroTier software without disclosing the source code |
||||
of your own application. |
||||
* Sell hosted ZeroTier services as a "SaaS" Product |
||||
|
||||
-- |
||||
(1) Operate or sell access to ZeroTier root servers, |
||||
network controllers, or authorization key or certificate |
||||
generation components of the Licensed Work as a |
||||
for-profit service, regardless of whether the use of |
||||
these components is sold alone or is bundled with other |
||||
services. Note that this does not apply to the use of |
||||
ZeroTier behind the scenes to operate a service not |
||||
related to ZeroTier network administration. |
||||
|
||||
The above license does not apply to third party code included with or |
||||
linked against by ZeroTier software. See the third party code section |
||||
of the AUTHORS.md for an index of third party software included in |
||||
this software repository. |
||||
* Create Non-Open-Source Commercial Derviative Works |
||||
|
||||
Licenses for third party code are all relatively permissive: MIT, |
||||
BSD, and public domain. The only exception is the tap-windows driver |
||||
which is under the GPLv2, but this is only needed to produce the |
||||
binary tap device driver used by the ZeroTier service on Windows. |
||||
(2) Link or directly include the Licensed Work in a |
||||
commercial or for-profit application or other product |
||||
not distributed under an Open Source Initiative (OSI) |
||||
compliant license. See: https://opensource.org/licenses |
||||
|
||||
(3) Remove the name, logo, copyright, or other branding |
||||
material from the Licensed Work to create a "rebranded" |
||||
or "white labeled" version to distribute as part of |
||||
any commercial or for-profit product or service. |
||||
|
||||
* Certain Government Uses |
||||
|
||||
(4) Use or deploy the Licensed Work in a government |
||||
setting in support of any active government function |
||||
or operation with the exception of the following: |
||||
physical or mental health care, family and social |
||||
services, social welfare, senior care, child care, and |
||||
the care of persons with disabilities. |
||||
|
||||
Change Date: 2023-01-01 |
||||
|
||||
Change License: Apache License version 2.0 as published by the Apache |
||||
Software Foundation |
||||
https://www.apache.org/licenses/ |
||||
|
||||
Alternative Licensing |
||||
|
||||
If you would like to use the Licensed Work in any way that conflicts with |
||||
the stipulations of the Additional Use Grant, contact ZeroTier, Inc. to |
||||
obtain an alternative commercial license. |
||||
|
||||
Visit us on the web at: https://www.zerotier.com/ |
||||
|
||||
Notice |
||||
|
||||
The Business Source License (this document, or the "License") is not an Open |
||||
Source license. However, the Licensed Work will eventually be made available |
||||
under an Open Source License, as stated in this License. |
||||
|
||||
For more information on the use of the Business Source License for ZeroTier |
||||
products, please visit our pricing page which contains license details and |
||||
and license FAQ: https://zerotier.com/pricing |
||||
|
||||
For more information on the use of the Business Source License generally, |
||||
please visit the Adopting and Developing Business Source License FAQ at |
||||
https://mariadb.com/bsl-faq-adopting. |
||||
|
||||
----------------------------------------------------------------------------- |
||||
|
||||
Business Source License 1.1 |
||||
|
||||
Terms |
||||
|
||||
The Licensor hereby grants you the right to copy, modify, create derivative |
||||
works, redistribute, and make non-production use of the Licensed Work. The |
||||
Licensor may make an Additional Use Grant, above, permitting limited |
||||
production use. |
||||
|
||||
Effective on the Change Date, or the fourth anniversary of the first publicly |
||||
available distribution of a specific version of the Licensed Work under this |
||||
License, whichever comes first, the Licensor hereby grants you rights under |
||||
the terms of the Change License, and the rights granted in the paragraph |
||||
above terminate. |
||||
|
||||
If your use of the Licensed Work does not comply with the requirements |
||||
currently in effect as described in this License, you must purchase a |
||||
commercial license from the Licensor, its affiliated entities, or authorized |
||||
resellers, or you must refrain from using the Licensed Work. |
||||
|
||||
All copies of the original and modified Licensed Work, and derivative works |
||||
of the Licensed Work, are subject to this License. This License applies |
||||
separately for each version of the Licensed Work and the Change Date may vary |
||||
for each version of the Licensed Work released by Licensor. |
||||
|
||||
You must conspicuously display this License on each original or modified copy |
||||
of the Licensed Work. If you receive the Licensed Work in original or |
||||
modified form from a third party, the terms and conditions set forth in this |
||||
License apply to your use of that work. |
||||
|
||||
Any use of the Licensed Work in violation of this License will automatically |
||||
terminate your rights under this License for the current and all other |
||||
versions of the Licensed Work. |
||||
|
||||
This License does not grant you any right in any trademark or logo of |
||||
Licensor or its affiliates (provided that you may use a trademark or logo of |
||||
Licensor as expressly required by this License). |
||||
|
||||
TO THE EXTENT PERMITTED BY APPLICABLE LAW, THE LICENSED WORK IS PROVIDED ON |
||||
AN "AS IS" BASIS. LICENSOR HEREBY DISCLAIMS ALL WARRANTIES AND CONDITIONS, |
||||
EXPRESS OR IMPLIED, INCLUDING (WITHOUT LIMITATION) WARRANTIES OF |
||||
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NON-INFRINGEMENT, AND |
||||
TITLE. |
||||
|
||||
----------------------------------------------------------------------------- |
||||
|
||||
MariaDB hereby grants you permission to use this License’s text to license |
||||
your works, and to refer to it using the trademark "Business Source License", |
||||
as long as you comply with the Covenants of Licensor below. |
||||
|
||||
Covenants of Licensor |
||||
|
||||
In consideration of the right to use this License’s text and the "Business |
||||
Source License" name and trademark, Licensor covenants to MariaDB, and to all |
||||
other recipients of the licensed work to be provided by Licensor: |
||||
|
||||
1. To specify as the Change License the GPL Version 2.0 or any later version, |
||||
or a license that is compatible with GPL Version 2.0 or a later version, |
||||
where "compatible" means that software provided under the Change License can |
||||
be included in a program with software provided under GPL Version 2.0 or a |
||||
later version. Licensor may specify additional Change Licenses without |
||||
limitation. |
||||
|
||||
2. To either: (a) specify an additional grant of rights to use that does not |
||||
impose any additional restriction on the right granted in this License, as |
||||
the Additional Use Grant; or (b) insert the text "None". |
||||
|
||||
3. To specify a Change Date. |
||||
|
||||
4. Not to modify this License in any other way. |
||||
|
||||
@ -1,463 +0,0 @@
|
||||
/*
|
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2017 ZeroTier, Inc. https://www.zerotier.com/
|
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
* |
||||
* -- |
||||
* |
||||
* You can be released from the requirements of the license by purchasing |
||||
* a commercial license. Buying such a license is mandatory as soon as you |
||||
* develop commercial closed-source software that incorporates or links |
||||
* directly against ZeroTier software without disclosing the source code |
||||
* of your own application. |
||||
*/ |
||||
|
||||
#ifndef ZT_CLUSTER_HPP |
||||
#define ZT_CLUSTER_HPP |
||||
|
||||
#ifdef ZT_ENABLE_CLUSTER |
||||
|
||||
#include <map> |
||||
|
||||
#include "Constants.hpp" |
||||
#include "../include/ZeroTierOne.h" |
||||
#include "Address.hpp" |
||||
#include "InetAddress.hpp" |
||||
#include "SHA512.hpp" |
||||
#include "Utils.hpp" |
||||
#include "Buffer.hpp" |
||||
#include "Mutex.hpp" |
||||
#include "SharedPtr.hpp" |
||||
#include "Hashtable.hpp" |
||||
#include "Packet.hpp" |
||||
#include "SharedPtr.hpp" |
||||
|
||||
/**
|
||||
* Timeout for cluster members being considered "alive" |
||||
* |
||||
* A cluster member is considered dead and will no longer have peers |
||||
* redirected to it if we have not heard a heartbeat in this long. |
||||
*/ |
||||
#define ZT_CLUSTER_TIMEOUT 5000 |
||||
|
||||
/**
|
||||
* Desired period between doPeriodicTasks() in milliseconds |
||||
*/ |
||||
#define ZT_CLUSTER_PERIODIC_TASK_PERIOD 20 |
||||
|
||||
/**
|
||||
* How often to flush outgoing message queues (maximum interval) |
||||
*/ |
||||
#define ZT_CLUSTER_FLUSH_PERIOD ZT_CLUSTER_PERIODIC_TASK_PERIOD |
||||
|
||||
/**
|
||||
* Maximum number of queued outgoing packets per sender address |
||||
*/ |
||||
#define ZT_CLUSTER_MAX_QUEUE_PER_SENDER 16 |
||||
|
||||
/**
|
||||
* Expiration time for send queue entries |
||||
*/ |
||||
#define ZT_CLUSTER_QUEUE_EXPIRATION 3000 |
||||
|
||||
/**
|
||||
* Chunk size for allocating queue entries |
||||
* |
||||
* Queue entries are allocated in chunks of this many and are added to a pool. |
||||
* ZT_CLUSTER_MAX_QUEUE_GLOBAL must be evenly divisible by this. |
||||
*/ |
||||
#define ZT_CLUSTER_QUEUE_CHUNK_SIZE 32 |
||||
|
||||
/**
|
||||
* Maximum number of chunks to ever allocate |
||||
* |
||||
* This is a global sanity limit to prevent resource exhaustion attacks. It |
||||
* works out to about 600mb of RAM. You'll never see this on a normal edge |
||||
* node. We're unlikely to see this on a root server unless someone is DOSing |
||||
* us. In that case cluster relaying will be affected but other functions |
||||
* should continue to operate normally. |
||||
*/ |
||||
#define ZT_CLUSTER_MAX_QUEUE_CHUNKS 8194 |
||||
|
||||
/**
|
||||
* Max data per queue entry |
||||
*/ |
||||
#define ZT_CLUSTER_SEND_QUEUE_DATA_MAX 1500 |
||||
|
||||
/**
|
||||
* We won't send WANT_PEER to other members more than every (ms) per recipient |
||||
*/ |
||||
#define ZT_CLUSTER_WANT_PEER_EVERY 1000 |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
class RuntimeEnvironment; |
||||
class MulticastGroup; |
||||
class Peer; |
||||
class Identity; |
||||
|
||||
// Internal class implemented inside Cluster.cpp
|
||||
class _ClusterSendQueue; |
||||
|
||||
/**
|
||||
* Multi-homing cluster state replication and packet relaying |
||||
* |
||||
* Multi-homing means more than one node sharing the same ZeroTier identity. |
||||
* There is nothing in the protocol to prevent this, but to make it work well |
||||
* requires the devices sharing an identity to cooperate and share some |
||||
* information. |
||||
* |
||||
* There are three use cases we want to fulfill: |
||||
* |
||||
* (1) Multi-homing of root servers with handoff for efficient routing, |
||||
* HA, and load balancing across many commodity nodes. |
||||
* (2) Multi-homing of network controllers for the same reason. |
||||
* (3) Multi-homing of nodes on virtual networks, such as domain servers |
||||
* and other important endpoints. |
||||
* |
||||
* These use cases are in order of escalating difficulty. The initial |
||||
* version of Cluster is aimed at satisfying the first, though you are |
||||
* free to try #2 and #3. |
||||
*/ |
||||
class Cluster |
||||
{ |
||||
public: |
||||
/**
|
||||
* State message types |
||||
*/ |
||||
enum StateMessageType |
||||
{ |
||||
CLUSTER_MESSAGE_NOP = 0, |
||||
|
||||
/**
|
||||
* This cluster member is alive: |
||||
* <[2] version minor> |
||||
* <[2] version major> |
||||
* <[2] version revision> |
||||
* <[1] protocol version> |
||||
* <[4] X location (signed 32-bit)> |
||||
* <[4] Y location (signed 32-bit)> |
||||
* <[4] Z location (signed 32-bit)> |
||||
* <[8] local clock at this member> |
||||
* <[8] load average> |
||||
* <[8] number of peers> |
||||
* <[8] flags (currently unused, must be zero)> |
||||
* <[1] number of preferred ZeroTier endpoints> |
||||
* <[...] InetAddress(es) of preferred ZeroTier endpoint(s)> |
||||
* |
||||
* Cluster members constantly broadcast an alive heartbeat and will only |
||||
* receive peer redirects if they've done so within the timeout. |
||||
*/ |
||||
CLUSTER_MESSAGE_ALIVE = 1, |
||||
|
||||
/**
|
||||
* Cluster member has this peer: |
||||
* <[...] serialized identity of peer> |
||||
* |
||||
* This is typically sent in response to WANT_PEER but can also be pushed |
||||
* to prepopulate if this makes sense. |
||||
*/ |
||||
CLUSTER_MESSAGE_HAVE_PEER = 2, |
||||
|
||||
/**
|
||||
* Cluster member wants this peer: |
||||
* <[5] ZeroTier address of peer> |
||||
* |
||||
* Members that have a direct link to this peer will respond with |
||||
* HAVE_PEER. |
||||
*/ |
||||
CLUSTER_MESSAGE_WANT_PEER = 3, |
||||
|
||||
/**
|
||||
* A remote packet that we should also possibly respond to: |
||||
* <[2] 16-bit length of remote packet> |
||||
* <[...] remote packet payload> |
||||
* |
||||
* Cluster members may relay requests by relaying the request packet. |
||||
* These may include requests such as WHOIS and MULTICAST_GATHER. The |
||||
* packet must be already decrypted, decompressed, and authenticated. |
||||
* |
||||
* This can only be used for small request packets as per the cluster |
||||
* message size limit, but since these are the only ones in question |
||||
* this is fine. |
||||
* |
||||
* If a response is generated it is sent via PROXY_SEND. |
||||
*/ |
||||
CLUSTER_MESSAGE_REMOTE_PACKET = 4, |
||||
|
||||
/**
|
||||
* Request that VERB_RENDEZVOUS be sent to a peer that we have: |
||||
* <[5] ZeroTier address of peer on recipient's side> |
||||
* <[5] ZeroTier address of peer on sender's side> |
||||
* <[1] 8-bit number of sender's peer's active path addresses> |
||||
* <[...] series of serialized InetAddresses of sender's peer's paths> |
||||
* |
||||
* This requests that we perform NAT-t introduction between a peer that |
||||
* we have and one on the sender's side. The sender furnishes contact |
||||
* info for its peer, and we send VERB_RENDEZVOUS to both sides: to ours |
||||
* directly and with PROXY_SEND to theirs. |
||||
*/ |
||||
CLUSTER_MESSAGE_PROXY_UNITE = 5, |
||||
|
||||
/**
|
||||
* Request that a cluster member send a packet to a locally-known peer: |
||||
* <[5] ZeroTier address of recipient> |
||||
* <[1] packet verb> |
||||
* <[2] length of packet payload> |
||||
* <[...] packet payload> |
||||
* |
||||
* This differs from RELAY in that it requests the receiving cluster |
||||
* member to actually compose a ZeroTier Packet from itself to the |
||||
* provided recipient. RELAY simply says "please forward this blob." |
||||
* RELAY is used to implement peer-to-peer relaying with RENDEZVOUS, |
||||
* while PROXY_SEND is used to implement proxy sending (which right |
||||
* now is only used to send RENDEZVOUS). |
||||
*/ |
||||
CLUSTER_MESSAGE_PROXY_SEND = 6, |
||||
|
||||
/**
|
||||
* Replicate a network config for a network we belong to: |
||||
* <[...] network config chunk> |
||||
* |
||||
* This is used by clusters to avoid every member having to query |
||||
* for the same netconf for networks all members belong to. |
||||
* |
||||
* The first field of a network config chunk is the network ID, |
||||
* so this can be checked to look up the network on receipt. |
||||
*/ |
||||
CLUSTER_MESSAGE_NETWORK_CONFIG = 7 |
||||
}; |
||||
|
||||
/**
|
||||
* Construct a new cluster |
||||
*/ |
||||
Cluster( |
||||
const RuntimeEnvironment *renv, |
||||
uint16_t id, |
||||
const std::vector<InetAddress> &zeroTierPhysicalEndpoints, |
||||
int32_t x, |
||||
int32_t y, |
||||
int32_t z, |
||||
void (*sendFunction)(void *,unsigned int,const void *,unsigned int), |
||||
void *sendFunctionArg, |
||||
int (*addressToLocationFunction)(void *,const struct sockaddr_storage *,int *,int *,int *), |
||||
void *addressToLocationFunctionArg); |
||||
|
||||
~Cluster(); |
||||
|
||||
/**
|
||||
* @return This cluster member's ID |
||||
*/ |
||||
inline uint16_t id() const throw() { return _id; } |
||||
|
||||
/**
|
||||
* Handle an incoming intra-cluster message |
||||
* |
||||
* @param data Message data |
||||
* @param len Message length (max: ZT_CLUSTER_MAX_MESSAGE_LENGTH) |
||||
*/ |
||||
void handleIncomingStateMessage(const void *msg,unsigned int len); |
||||
|
||||
/**
|
||||
* Broadcast that we have a given peer |
||||
* |
||||
* This should be done when new peers are first contacted. |
||||
* |
||||
* @param id Identity of peer |
||||
*/ |
||||
void broadcastHavePeer(const Identity &id); |
||||
|
||||
/**
|
||||
* Broadcast a network config chunk to other members of cluster |
||||
* |
||||
* @param chunk Chunk data |
||||
* @param len Length of chunk |
||||
*/ |
||||
void broadcastNetworkConfigChunk(const void *chunk,unsigned int len); |
||||
|
||||
/**
|
||||
* If the cluster has this peer, prepare the packet to send via cluster |
||||
* |
||||
* Note that outp is only armored (or modified at all) if the return value is a member ID. |
||||
* |
||||
* @param toPeerAddress Value of outp.destination(), simply to save additional lookup |
||||
* @param ts Result: set to time of last HAVE_PEER from the cluster |
||||
* @param peerSecret Result: Buffer to fill with peer secret on valid return value, must be at least ZT_PEER_SECRET_KEY_LENGTH bytes |
||||
* @return -1 if cluster does not know this peer, or a member ID to pass to sendViaCluster() |
||||
*/ |
||||
int checkSendViaCluster(const Address &toPeerAddress,uint64_t &mostRecentTs,void *peerSecret); |
||||
|
||||
/**
|
||||
* Send data via cluster front plane (packet head or fragment) |
||||
* |
||||
* @param haveMemberId Member ID that has this peer as returned by prepSendviaCluster() |
||||
* @param toPeerAddress Destination peer address |
||||
* @param data Packet or packet fragment data |
||||
* @param len Length of packet or fragment |
||||
* @return True if packet was sent (and outp was modified via armoring) |
||||
*/ |
||||
bool sendViaCluster(int haveMemberId,const Address &toPeerAddress,const void *data,unsigned int len); |
||||
|
||||
/**
|
||||
* Relay a packet via the cluster |
||||
* |
||||
* This is used in the outgoing packet and relaying logic in Switch to |
||||
* relay packets to other cluster members. It isn't PROXY_SEND-- that is |
||||
* used internally in Cluster to send responses to peer queries. |
||||
* |
||||
* @param fromPeerAddress Source peer address (if known, should be NULL for fragments) |
||||
* @param toPeerAddress Destination peer address |
||||
* @param data Packet or packet fragment data |
||||
* @param len Length of packet or fragment |
||||
* @param unite If true, also request proxy unite across cluster |
||||
*/ |
||||
void relayViaCluster(const Address &fromPeerAddress,const Address &toPeerAddress,const void *data,unsigned int len,bool unite); |
||||
|
||||
/**
|
||||
* Send a distributed query to other cluster members |
||||
* |
||||
* Some queries such as WHOIS or MULTICAST_GATHER need a response from other |
||||
* cluster members. Replies (if any) will be sent back to the peer via |
||||
* PROXY_SEND across the cluster. |
||||
* |
||||
* @param pkt Packet to distribute |
||||
*/ |
||||
void sendDistributedQuery(const Packet &pkt); |
||||
|
||||
/**
|
||||
* Call every ~ZT_CLUSTER_PERIODIC_TASK_PERIOD milliseconds. |
||||
*/ |
||||
void doPeriodicTasks(); |
||||
|
||||
/**
|
||||
* Add a member ID to this cluster |
||||
* |
||||
* @param memberId Member ID |
||||
*/ |
||||
void addMember(uint16_t memberId); |
||||
|
||||
/**
|
||||
* Remove a member ID from this cluster |
||||
* |
||||
* @param memberId Member ID to remove |
||||
*/ |
||||
void removeMember(uint16_t memberId); |
||||
|
||||
/**
|
||||
* Find a better cluster endpoint for this peer (if any) |
||||
* |
||||
* @param redirectTo InetAddress to be set to a better endpoint (if there is one) |
||||
* @param peerAddress Address of peer to (possibly) redirect |
||||
* @param peerPhysicalAddress Physical address of peer's current best path (where packet was most recently received or getBestPath()->address()) |
||||
* @param offload Always redirect if possible -- can be used to offload peers during shutdown |
||||
* @return True if redirectTo was set to a new address, false if redirectTo was not modified |
||||
*/ |
||||
bool findBetterEndpoint(InetAddress &redirectTo,const Address &peerAddress,const InetAddress &peerPhysicalAddress,bool offload); |
||||
|
||||
/**
|
||||
* @param ip Address to check |
||||
* @return True if this is a cluster frontplane address (excluding our addresses) |
||||
*/ |
||||
bool isClusterPeerFrontplane(const InetAddress &ip) const; |
||||
|
||||
/**
|
||||
* Fill out ZT_ClusterStatus structure (from core API) |
||||
* |
||||
* @param status Reference to structure to hold result (anything there is replaced) |
||||
*/ |
||||
void status(ZT_ClusterStatus &status) const; |
||||
|
||||
private: |
||||
void _send(uint16_t memberId,StateMessageType type,const void *msg,unsigned int len); |
||||
void _flush(uint16_t memberId); |
||||
|
||||
void _doREMOTE_WHOIS(uint64_t fromMemberId,const Packet &remotep); |
||||
void _doREMOTE_MULTICAST_GATHER(uint64_t fromMemberId,const Packet &remotep); |
||||
|
||||
// These are initialized in the constructor and remain immutable ------------
|
||||
uint16_t _masterSecret[ZT_SHA512_DIGEST_LEN / sizeof(uint16_t)]; |
||||
unsigned char _key[ZT_PEER_SECRET_KEY_LENGTH]; |
||||
const RuntimeEnvironment *RR; |
||||
_ClusterSendQueue *const _sendQueue; |
||||
void (*_sendFunction)(void *,unsigned int,const void *,unsigned int); |
||||
void *_sendFunctionArg; |
||||
int (*_addressToLocationFunction)(void *,const struct sockaddr_storage *,int *,int *,int *); |
||||
void *_addressToLocationFunctionArg; |
||||
const int32_t _x; |
||||
const int32_t _y; |
||||
const int32_t _z; |
||||
const uint16_t _id; |
||||
const std::vector<InetAddress> _zeroTierPhysicalEndpoints; |
||||
// end immutable fields -----------------------------------------------------
|
||||
|
||||
struct _Member |
||||
{ |
||||
unsigned char key[ZT_PEER_SECRET_KEY_LENGTH]; |
||||
|
||||
uint64_t lastReceivedAliveAnnouncement; |
||||
uint64_t lastAnnouncedAliveTo; |
||||
|
||||
uint64_t load; |
||||
uint64_t peers; |
||||
int32_t x,y,z; |
||||
|
||||
std::vector<InetAddress> zeroTierPhysicalEndpoints; |
||||
|
||||
Buffer<ZT_CLUSTER_MAX_MESSAGE_LENGTH> q; |
||||
|
||||
Mutex lock; |
||||
|
||||
inline void clear() |
||||
{ |
||||
lastReceivedAliveAnnouncement = 0; |
||||
lastAnnouncedAliveTo = 0; |
||||
load = 0; |
||||
peers = 0; |
||||
x = 0; |
||||
y = 0; |
||||
z = 0; |
||||
zeroTierPhysicalEndpoints.clear(); |
||||
q.clear(); |
||||
} |
||||
|
||||
_Member() { this->clear(); } |
||||
~_Member() { Utils::burn(key,sizeof(key)); } |
||||
}; |
||||
_Member *const _members; |
||||
|
||||
std::vector<uint16_t> _memberIds; |
||||
Mutex _memberIds_m; |
||||
|
||||
struct _RemotePeer |
||||
{ |
||||
_RemotePeer() : lastHavePeerReceived(0),lastSentWantPeer(0) {} |
||||
~_RemotePeer() { Utils::burn(key,ZT_PEER_SECRET_KEY_LENGTH); } |
||||
uint64_t lastHavePeerReceived; |
||||
uint64_t lastSentWantPeer; |
||||
uint8_t key[ZT_PEER_SECRET_KEY_LENGTH]; // secret key from identity agreement
|
||||
}; |
||||
std::map< std::pair<Address,unsigned int>,_RemotePeer > _remotePeers; // we need ordered behavior and lower_bound here
|
||||
Mutex _remotePeers_m; |
||||
|
||||
uint64_t _lastFlushed; |
||||
uint64_t _lastCleanedRemotePeers; |
||||
uint64_t _lastCleanedQueue; |
||||
}; |
||||
|
||||
} // namespace ZeroTier
|
||||
|
||||
#endif // ZT_ENABLE_CLUSTER
|
||||
|
||||
#endif |
||||
@ -1,168 +0,0 @@
|
||||
/*
|
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2017 ZeroTier, Inc. https://www.zerotier.com/
|
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
* |
||||
* -- |
||||
* |
||||
* You can be released from the requirements of the license by purchasing |
||||
* a commercial license. Buying such a license is mandatory as soon as you |
||||
* develop commercial closed-source software that incorporates or links |
||||
* directly against ZeroTier software without disclosing the source code |
||||
* of your own application. |
||||
*/ |
||||
|
||||
#ifndef ZT_CLUSTERDEFINITION_HPP |
||||
#define ZT_CLUSTERDEFINITION_HPP |
||||
|
||||
#ifdef ZT_ENABLE_CLUSTER |
||||
|
||||
#include <vector> |
||||
#include <algorithm> |
||||
|
||||
#include "../node/Constants.hpp" |
||||
#include "../node/Utils.hpp" |
||||
#include "../node/NonCopyable.hpp" |
||||
#include "../osdep/OSUtils.hpp" |
||||
|
||||
#include "ClusterGeoIpService.hpp" |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
/**
|
||||
* Parser for cluster definition file |
||||
*/ |
||||
class ClusterDefinition : NonCopyable |
||||
{ |
||||
public: |
||||
struct MemberDefinition |
||||
{ |
||||
MemberDefinition() : id(0),x(0),y(0),z(0) { name[0] = (char)0; } |
||||
|
||||
unsigned int id; |
||||
int x,y,z; |
||||
char name[256]; |
||||
InetAddress clusterEndpoint; |
||||
std::vector<InetAddress> zeroTierEndpoints; |
||||
}; |
||||
|
||||
/**
|
||||
* Load and initialize cluster definition and GeoIP data if any |
||||
* |
||||
* @param myAddress My ZeroTier address |
||||
* @param pathToClusterFile Path to cluster definition file |
||||
* @throws std::runtime_error Invalid cluster definition or unable to load data |
||||
*/ |
||||
ClusterDefinition(uint64_t myAddress,const char *pathToClusterFile) |
||||
{ |
||||
std::string cf; |
||||
if (!OSUtils::readFile(pathToClusterFile,cf)) |
||||
return; |
||||
|
||||
char myAddressStr[64]; |
||||
Utils::ztsnprintf(myAddressStr,sizeof(myAddressStr),"%.10llx",myAddress); |
||||
|
||||
std::vector<std::string> lines(OSUtils::split(cf.c_str(),"\r\n","","")); |
||||
for(std::vector<std::string>::iterator l(lines.begin());l!=lines.end();++l) { |
||||
std::vector<std::string> fields(OSUtils::split(l->c_str()," \t","","")); |
||||
if ((fields.size() < 5)||(fields[0][0] == '#')||(fields[0] != myAddressStr)) |
||||
continue; |
||||
|
||||
// <address> geo <CSV path> <ip start column> <ip end column> <latitutde column> <longitude column>
|
||||
if (fields[1] == "geo") { |
||||
if ((fields.size() >= 7)&&(OSUtils::fileExists(fields[2].c_str()))) { |
||||
int ipStartColumn = Utils::strToInt(fields[3].c_str()); |
||||
int ipEndColumn = Utils::strToInt(fields[4].c_str()); |
||||
int latitudeColumn = Utils::strToInt(fields[5].c_str()); |
||||
int longitudeColumn = Utils::strToInt(fields[6].c_str()); |
||||
if (_geo.load(fields[2].c_str(),ipStartColumn,ipEndColumn,latitudeColumn,longitudeColumn) <= 0) |
||||
throw std::runtime_error(std::string("failed to load geo-ip data from ")+fields[2]); |
||||
} |
||||
continue; |
||||
} |
||||
|
||||
// <address> <ID> <name> <backplane IP/port(s)> <ZT frontplane IP/port(s)> <x,y,z>
|
||||
int id = Utils::strToUInt(fields[1].c_str()); |
||||
if ((id < 0)||(id > ZT_CLUSTER_MAX_MEMBERS)) |
||||
throw std::runtime_error(std::string("invalid cluster member ID: ")+fields[1]); |
||||
MemberDefinition &md = _md[id]; |
||||
|
||||
md.id = (unsigned int)id; |
||||
if (fields.size() >= 6) { |
||||
std::vector<std::string> xyz(OSUtils::split(fields[5].c_str(),",","","")); |
||||
md.x = (xyz.size() > 0) ? Utils::strToInt(xyz[0].c_str()) : 0; |
||||
md.y = (xyz.size() > 1) ? Utils::strToInt(xyz[1].c_str()) : 0; |
||||
md.z = (xyz.size() > 2) ? Utils::strToInt(xyz[2].c_str()) : 0; |
||||
} |
||||
Utils::scopy(md.name,sizeof(md.name),fields[2].c_str()); |
||||
md.clusterEndpoint.fromString(fields[3]); |
||||
if (!md.clusterEndpoint) |
||||
continue; |
||||
std::vector<std::string> zips(OSUtils::split(fields[4].c_str(),",","","")); |
||||
for(std::vector<std::string>::iterator zip(zips.begin());zip!=zips.end();++zip) { |
||||
InetAddress i; |
||||
i.fromString(*zip); |
||||
if (i) |
||||
md.zeroTierEndpoints.push_back(i); |
||||
} |
||||
|
||||
_ids.push_back((unsigned int)id); |
||||
} |
||||
|
||||
std::sort(_ids.begin(),_ids.end()); |
||||
} |
||||
|
||||
/**
|
||||
* @return All member definitions in this cluster by ID (ID is array index) |
||||
*/ |
||||
inline const MemberDefinition &operator[](unsigned int id) const throw() { return _md[id]; } |
||||
|
||||
/**
|
||||
* @return Number of members in this cluster |
||||
*/ |
||||
inline unsigned int size() const throw() { return (unsigned int)_ids.size(); } |
||||
|
||||
/**
|
||||
* @return IDs of members in this cluster sorted by ID |
||||
*/ |
||||
inline const std::vector<unsigned int> &ids() const throw() { return _ids; } |
||||
|
||||
/**
|
||||
* @return GeoIP service for this cluster |
||||
*/ |
||||
inline ClusterGeoIpService &geo() throw() { return _geo; } |
||||
|
||||
/**
|
||||
* @return A vector (new copy) containing all cluster members |
||||
*/ |
||||
inline std::vector<MemberDefinition> members() const |
||||
{ |
||||
std::vector<MemberDefinition> m; |
||||
for(std::vector<unsigned int>::const_iterator i(_ids.begin());i!=_ids.end();++i) |
||||
m.push_back(_md[*i]); |
||||
return m; |
||||
} |
||||
|
||||
private: |
||||
MemberDefinition _md[ZT_CLUSTER_MAX_MEMBERS]; |
||||
std::vector<unsigned int> _ids; |
||||
ClusterGeoIpService _geo; |
||||
}; |
||||
|
||||
} // namespace ZeroTier
|
||||
|
||||
#endif // ZT_ENABLE_CLUSTER
|
||||
|
||||
#endif |
||||
@ -1,243 +0,0 @@
|
||||
/*
|
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2017 ZeroTier, Inc. https://www.zerotier.com/
|
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
* |
||||
* -- |
||||
* |
||||
* You can be released from the requirements of the license by purchasing |
||||
* a commercial license. Buying such a license is mandatory as soon as you |
||||
* develop commercial closed-source software that incorporates or links |
||||
* directly against ZeroTier software without disclosing the source code |
||||
* of your own application. |
||||
*/ |
||||
|
||||
#ifdef ZT_ENABLE_CLUSTER |
||||
|
||||
#include <math.h> |
||||
|
||||
#include <cmath> |
||||
|
||||
#include "ClusterGeoIpService.hpp" |
||||
|
||||
#include "../node/Utils.hpp" |
||||
#include "../osdep/OSUtils.hpp" |
||||
|
||||
#define ZT_CLUSTERGEOIPSERVICE_FILE_MODIFICATION_CHECK_EVERY 10000 |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
ClusterGeoIpService::ClusterGeoIpService() : |
||||
_pathToCsv(), |
||||
_ipStartColumn(-1), |
||||
_ipEndColumn(-1), |
||||
_latitudeColumn(-1), |
||||
_longitudeColumn(-1), |
||||
_lastFileCheckTime(0), |
||||
_csvModificationTime(0), |
||||
_csvFileSize(0) |
||||
{ |
||||
} |
||||
|
||||
ClusterGeoIpService::~ClusterGeoIpService() |
||||
{ |
||||
} |
||||
|
||||
bool ClusterGeoIpService::locate(const InetAddress &ip,int &x,int &y,int &z) |
||||
{ |
||||
Mutex::Lock _l(_lock); |
||||
|
||||
if ((_pathToCsv.length() > 0)&&((OSUtils::now() - _lastFileCheckTime) > ZT_CLUSTERGEOIPSERVICE_FILE_MODIFICATION_CHECK_EVERY)) { |
||||
_lastFileCheckTime = OSUtils::now(); |
||||
if ((_csvFileSize != OSUtils::getFileSize(_pathToCsv.c_str()))||(_csvModificationTime != OSUtils::getLastModified(_pathToCsv.c_str()))) |
||||
_load(_pathToCsv.c_str(),_ipStartColumn,_ipEndColumn,_latitudeColumn,_longitudeColumn); |
||||
} |
||||
|
||||
/* We search by looking up the upper bound of the sorted vXdb vectors
|
||||
* and then iterating down for a matching IP range. We stop when we hit |
||||
* the beginning or an entry whose start and end are before the IP we |
||||
* are searching. */ |
||||
|
||||
if ((ip.ss_family == AF_INET)&&(_v4db.size() > 0)) { |
||||
_V4E key; |
||||
key.start = Utils::ntoh((uint32_t)(reinterpret_cast<const struct sockaddr_in *>(&ip)->sin_addr.s_addr)); |
||||
std::vector<_V4E>::const_iterator i(std::upper_bound(_v4db.begin(),_v4db.end(),key)); |
||||
while (i != _v4db.begin()) { |
||||
--i; |
||||
if ((key.start >= i->start)&&(key.start <= i->end)) { |
||||
x = i->x; |
||||
y = i->y; |
||||
z = i->z; |
||||
//printf("%s : %f,%f %d,%d,%d\n",ip.toIpString().c_str(),i->lat,i->lon,x,y,z);
|
||||
return true; |
||||
} else if ((key.start > i->start)&&(key.start > i->end)) |
||||
break; |
||||
} |
||||
} else if ((ip.ss_family == AF_INET6)&&(_v6db.size() > 0)) { |
||||
_V6E key; |
||||
memcpy(key.start,reinterpret_cast<const struct sockaddr_in6 *>(&ip)->sin6_addr.s6_addr,16); |
||||
std::vector<_V6E>::const_iterator i(std::upper_bound(_v6db.begin(),_v6db.end(),key)); |
||||
while (i != _v6db.begin()) { |
||||
--i; |
||||
const int s_vs_s = memcmp(key.start,i->start,16); |
||||
const int s_vs_e = memcmp(key.start,i->end,16); |
||||
if ((s_vs_s >= 0)&&(s_vs_e <= 0)) { |
||||
x = i->x; |
||||
y = i->y; |
||||
z = i->z; |
||||
//printf("%s : %f,%f %d,%d,%d\n",ip.toIpString().c_str(),i->lat,i->lon,x,y,z);
|
||||
return true; |
||||
} else if ((s_vs_s > 0)&&(s_vs_e > 0)) |
||||
break; |
||||
} |
||||
} |
||||
|
||||
return false; |
||||
} |
||||
|
||||
void ClusterGeoIpService::_parseLine(const char *line,std::vector<_V4E> &v4db,std::vector<_V6E> &v6db,int ipStartColumn,int ipEndColumn,int latitudeColumn,int longitudeColumn) |
||||
{ |
||||
std::vector<std::string> ls(OSUtils::split(line,",\t","\\","\"'")); |
||||
if ( ((ipStartColumn >= 0)&&(ipStartColumn < (int)ls.size()))&& |
||||
((ipEndColumn >= 0)&&(ipEndColumn < (int)ls.size()))&& |
||||
((latitudeColumn >= 0)&&(latitudeColumn < (int)ls.size()))&& |
||||
((longitudeColumn >= 0)&&(longitudeColumn < (int)ls.size())) ) { |
||||
InetAddress ipStart(ls[ipStartColumn].c_str(),0); |
||||
InetAddress ipEnd(ls[ipEndColumn].c_str(),0); |
||||
const double lat = strtod(ls[latitudeColumn].c_str(),(char **)0); |
||||
const double lon = strtod(ls[longitudeColumn].c_str(),(char **)0); |
||||
|
||||
if ((ipStart.ss_family == ipEnd.ss_family)&&(ipStart)&&(ipEnd)&&(std::isfinite(lat))&&(std::isfinite(lon))) { |
||||
const double latRadians = lat * 0.01745329251994; // PI / 180
|
||||
const double lonRadians = lon * 0.01745329251994; // PI / 180
|
||||
const double cosLat = cos(latRadians); |
||||
const int x = (int)round((-6371.0) * cosLat * cos(lonRadians)); // 6371 == Earth's approximate radius in kilometers
|
||||
const int y = (int)round(6371.0 * sin(latRadians)); |
||||
const int z = (int)round(6371.0 * cosLat * sin(lonRadians)); |
||||
|
||||
if (ipStart.ss_family == AF_INET) { |
||||
v4db.push_back(_V4E()); |
||||
v4db.back().start = Utils::ntoh((uint32_t)(reinterpret_cast<const struct sockaddr_in *>(&ipStart)->sin_addr.s_addr)); |
||||
v4db.back().end = Utils::ntoh((uint32_t)(reinterpret_cast<const struct sockaddr_in *>(&ipEnd)->sin_addr.s_addr)); |
||||
v4db.back().lat = (float)lat; |
||||
v4db.back().lon = (float)lon; |
||||
v4db.back().x = x; |
||||
v4db.back().y = y; |
||||
v4db.back().z = z; |
||||
//printf("%s - %s : %d,%d,%d\n",ipStart.toIpString().c_str(),ipEnd.toIpString().c_str(),x,y,z);
|
||||
} else if (ipStart.ss_family == AF_INET6) { |
||||
v6db.push_back(_V6E()); |
||||
memcpy(v6db.back().start,reinterpret_cast<const struct sockaddr_in6 *>(&ipStart)->sin6_addr.s6_addr,16); |
||||
memcpy(v6db.back().end,reinterpret_cast<const struct sockaddr_in6 *>(&ipEnd)->sin6_addr.s6_addr,16); |
||||
v6db.back().lat = (float)lat; |
||||
v6db.back().lon = (float)lon; |
||||
v6db.back().x = x; |
||||
v6db.back().y = y; |
||||
v6db.back().z = z; |
||||
//printf("%s - %s : %d,%d,%d\n",ipStart.toIpString().c_str(),ipEnd.toIpString().c_str(),x,y,z);
|
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
long ClusterGeoIpService::_load(const char *pathToCsv,int ipStartColumn,int ipEndColumn,int latitudeColumn,int longitudeColumn) |
||||
{ |
||||
// assumes _lock is locked
|
||||
|
||||
FILE *f = fopen(pathToCsv,"rb"); |
||||
if (!f) |
||||
return -1; |
||||
|
||||
std::vector<_V4E> v4db; |
||||
std::vector<_V6E> v6db; |
||||
v4db.reserve(16777216); |
||||
v6db.reserve(16777216); |
||||
|
||||
char buf[4096]; |
||||
char linebuf[1024]; |
||||
unsigned int lineptr = 0; |
||||
for(;;) { |
||||
int n = (int)fread(buf,1,sizeof(buf),f); |
||||
if (n <= 0) |
||||
break; |
||||
for(int i=0;i<n;++i) { |
||||
if ((buf[i] == '\r')||(buf[i] == '\n')||(buf[i] == (char)0)) { |
||||
if (lineptr) { |
||||
linebuf[lineptr] = (char)0; |
||||
_parseLine(linebuf,v4db,v6db,ipStartColumn,ipEndColumn,latitudeColumn,longitudeColumn); |
||||
} |
||||
lineptr = 0; |
||||
} else if (lineptr < (unsigned int)sizeof(linebuf)) |
||||
linebuf[lineptr++] = buf[i]; |
||||
} |
||||
} |
||||
if (lineptr) { |
||||
linebuf[lineptr] = (char)0; |
||||
_parseLine(linebuf,v4db,v6db,ipStartColumn,ipEndColumn,latitudeColumn,longitudeColumn); |
||||
} |
||||
|
||||
fclose(f); |
||||
|
||||
if ((v4db.size() > 0)||(v6db.size() > 0)) { |
||||
std::sort(v4db.begin(),v4db.end()); |
||||
std::sort(v6db.begin(),v6db.end()); |
||||
|
||||
_pathToCsv = pathToCsv; |
||||
_ipStartColumn = ipStartColumn; |
||||
_ipEndColumn = ipEndColumn; |
||||
_latitudeColumn = latitudeColumn; |
||||
_longitudeColumn = longitudeColumn; |
||||
|
||||
_lastFileCheckTime = OSUtils::now(); |
||||
_csvModificationTime = OSUtils::getLastModified(pathToCsv); |
||||
_csvFileSize = OSUtils::getFileSize(pathToCsv); |
||||
|
||||
_v4db.swap(v4db); |
||||
_v6db.swap(v6db); |
||||
|
||||
return (long)(_v4db.size() + _v6db.size()); |
||||
} else { |
||||
return 0; |
||||
} |
||||
} |
||||
|
||||
} // namespace ZeroTier
|
||||
|
||||
#endif // ZT_ENABLE_CLUSTER
|
||||
|
||||
/*
|
||||
int main(int argc,char **argv) |
||||
{ |
||||
char buf[1024]; |
||||
|
||||
ZeroTier::ClusterGeoIpService gip; |
||||
printf("loading...\n"); |
||||
gip.load("/Users/api/Code/ZeroTier/Infrastructure/root-servers/zerotier-one/cluster-geoip.csv",0,1,5,6); |
||||
printf("... done!\n"); fflush(stdout); |
||||
|
||||
while (gets(buf)) { // unsafe, testing only
|
||||
ZeroTier::InetAddress addr(buf,0); |
||||
printf("looking up: %s\n",addr.toString().c_str()); fflush(stdout); |
||||
int x = 0,y = 0,z = 0; |
||||
if (gip.locate(addr,x,y,z)) { |
||||
//printf("%s: %d,%d,%d\n",addr.toString().c_str(),x,y,z); fflush(stdout);
|
||||
} else { |
||||
printf("%s: not found!\n",addr.toString().c_str()); fflush(stdout); |
||||
} |
||||
} |
||||
|
||||
return 0; |
||||
} |
||||
*/ |
||||
@ -1,151 +0,0 @@
|
||||
/*
|
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2017 ZeroTier, Inc. https://www.zerotier.com/
|
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
* |
||||
* -- |
||||
* |
||||
* You can be released from the requirements of the license by purchasing |
||||
* a commercial license. Buying such a license is mandatory as soon as you |
||||
* develop commercial closed-source software that incorporates or links |
||||
* directly against ZeroTier software without disclosing the source code |
||||
* of your own application. |
||||
*/ |
||||
|
||||
#ifndef ZT_CLUSTERGEOIPSERVICE_HPP |
||||
#define ZT_CLUSTERGEOIPSERVICE_HPP |
||||
|
||||
#ifdef ZT_ENABLE_CLUSTER |
||||
|
||||
#include <stdint.h> |
||||
#include <stdio.h> |
||||
#include <string.h> |
||||
#include <stdlib.h> |
||||
|
||||
#include <vector> |
||||
#include <string> |
||||
#include <algorithm> |
||||
|
||||
#include "../node/Constants.hpp" |
||||
#include "../node/Mutex.hpp" |
||||
#include "../node/NonCopyable.hpp" |
||||
#include "../node/InetAddress.hpp" |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
/**
|
||||
* Loads a GeoIP CSV into memory for fast lookup, reloading as needed |
||||
* |
||||
* This was designed around the CSV from https://db-ip.com but can be used
|
||||
* with any similar GeoIP CSV database that is presented in the form of an |
||||
* IP range and lat/long coordinates. |
||||
* |
||||
* It loads the whole database into memory, which can be kind of large. If |
||||
* the CSV file changes, the changes are loaded automatically. |
||||
*/ |
||||
class ClusterGeoIpService : NonCopyable |
||||
{ |
||||
public: |
||||
ClusterGeoIpService(); |
||||
~ClusterGeoIpService(); |
||||
|
||||
/**
|
||||
* Load or reload CSV file |
||||
* |
||||
* CSV column indexes start at zero. CSVs can be quoted with single or |
||||
* double quotes. Whitespace before or after commas is ignored. Backslash |
||||
* may be used for escaping whitespace as well. |
||||
* |
||||
* @param pathToCsv Path to (uncompressed) CSV file |
||||
* @param ipStartColumn Column with IP range start |
||||
* @param ipEndColumn Column with IP range end (inclusive) |
||||
* @param latitudeColumn Column with latitude |
||||
* @param longitudeColumn Column with longitude |
||||
* @return Number of valid records loaded or -1 on error (invalid file, not found, etc.) |
||||
*/ |
||||
inline long load(const char *pathToCsv,int ipStartColumn,int ipEndColumn,int latitudeColumn,int longitudeColumn) |
||||
{ |
||||
Mutex::Lock _l(_lock); |
||||
return _load(pathToCsv,ipStartColumn,ipEndColumn,latitudeColumn,longitudeColumn); |
||||
} |
||||
|
||||
/**
|
||||
* Attempt to locate an IP |
||||
* |
||||
* This returns true if x, y, and z are set. If the return value is false |
||||
* the values of x, y, and z are undefined. |
||||
* |
||||
* @param ip IPv4 or IPv6 address |
||||
* @param x Reference to variable to receive X |
||||
* @param y Reference to variable to receive Y |
||||
* @param z Reference to variable to receive Z |
||||
* @return True if coordinates were set |
||||
*/ |
||||
bool locate(const InetAddress &ip,int &x,int &y,int &z); |
||||
|
||||
/**
|
||||
* @return True if IP database/service is available for queries (otherwise locate() will always be false) |
||||
*/ |
||||
inline bool available() const |
||||
{ |
||||
Mutex::Lock _l(_lock); |
||||
return ((_v4db.size() + _v6db.size()) > 0); |
||||
} |
||||
|
||||
private: |
||||
struct _V4E |
||||
{ |
||||
uint32_t start; |
||||
uint32_t end; |
||||
float lat,lon; |
||||
int16_t x,y,z; |
||||
|
||||
inline bool operator<(const _V4E &e) const { return (start < e.start); } |
||||
}; |
||||
|
||||
struct _V6E |
||||
{ |
||||
uint8_t start[16]; |
||||
uint8_t end[16]; |
||||
float lat,lon; |
||||
int16_t x,y,z; |
||||
|
||||
inline bool operator<(const _V6E &e) const { return (memcmp(start,e.start,16) < 0); } |
||||
}; |
||||
|
||||
static void _parseLine(const char *line,std::vector<_V4E> &v4db,std::vector<_V6E> &v6db,int ipStartColumn,int ipEndColumn,int latitudeColumn,int longitudeColumn); |
||||
long _load(const char *pathToCsv,int ipStartColumn,int ipEndColumn,int latitudeColumn,int longitudeColumn); |
||||
|
||||
std::string _pathToCsv; |
||||
int _ipStartColumn; |
||||
int _ipEndColumn; |
||||
int _latitudeColumn; |
||||
int _longitudeColumn; |
||||
|
||||
uint64_t _lastFileCheckTime; |
||||
uint64_t _csvModificationTime; |
||||
int64_t _csvFileSize; |
||||
|
||||
std::vector<_V4E> _v4db; |
||||
std::vector<_V6E> _v6db; |
||||
|
||||
Mutex _lock; |
||||
}; |
||||
|
||||
} // namespace ZeroTier
|
||||
|
||||
#endif // ZT_ENABLE_CLUSTER
|
||||
|
||||
#endif |
||||
@ -1,101 +0,0 @@
|
||||
/*
|
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2018 ZeroTier, Inc. https://www.zerotier.com/
|
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
* |
||||
* -- |
||||
* |
||||
* You can be released from the requirements of the license by purchasing |
||||
* a commercial license. Buying such a license is mandatory as soon as you |
||||
* develop commercial closed-source software that incorporates or links |
||||
* directly against ZeroTier software without disclosing the source code |
||||
* of your own application. |
||||
*/ |
||||
|
||||
#include "Constants.hpp" |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
/**
|
||||
* A really simple fixed capacity vector |
||||
* |
||||
* This class does no bounds checking, so the user must ensure that |
||||
* no more than C elements are ever added and that accesses are in |
||||
* bounds. |
||||
* |
||||
* @tparam T Type to contain |
||||
* @tparam C Capacity of vector |
||||
*/ |
||||
template<typename T,unsigned long C> |
||||
class FCV |
||||
{ |
||||
public: |
||||
FCV() : _s(0) {} |
||||
~FCV() { clear(); } |
||||
|
||||
FCV(const FCV &v) : |
||||
_s(v._s) |
||||
{ |
||||
for(unsigned long i=0;i<_s;++i) { |
||||
new (reinterpret_cast<T *>(_mem + (sizeof(T) * i))) T(reinterpret_cast<const T *>(v._mem)[i]); |
||||
} |
||||
} |
||||
|
||||
inline FCV &operator=(const FCV &v) |
||||
{ |
||||
clear(); |
||||
_s = v._s; |
||||
for(unsigned long i=0;i<_s;++i) { |
||||
new (reinterpret_cast<T *>(_mem + (sizeof(T) * i))) T(reinterpret_cast<const T *>(v._mem)[i]); |
||||
} |
||||
return *this; |
||||
} |
||||
|
||||
typedef T * iterator; |
||||
typedef const T * const_iterator; |
||||
typedef unsigned long size_type; |
||||
|
||||
inline iterator begin() { return (T *)_mem; } |
||||
inline iterator end() { return (T *)(_mem + (sizeof(T) * _s)); } |
||||
inline iterator begin() const { return (const T *)_mem; } |
||||
inline iterator end() const { return (const T *)(_mem + (sizeof(T) * _s)); } |
||||
|
||||
inline T &operator[](const size_type i) { return reinterpret_cast<T *>(_mem)[i]; } |
||||
inline const T &operator[](const size_type i) const { return reinterpret_cast<const T *>(_mem)[i]; } |
||||
|
||||
inline T &front() { return reinterpret_cast<T *>(_mem)[0]; } |
||||
inline const T &front() const { return reinterpret_cast<const T *>(_mem)[0]; } |
||||
inline T &back() { return reinterpret_cast<T *>(_mem)[_s - 1]; } |
||||
inline const T &back() const { return reinterpret_cast<const T *>(_mem)[_s - 1]; } |
||||
|
||||
inline void push_back(const T &v) { new (reinterpret_cast<T *>(_mem + (sizeof(T) * _s++))) T(v); } |
||||
inline void pop_back() { reinterpret_cast<T *>(_mem + (sizeof(T) * --_s))->~T(); } |
||||
|
||||
inline size_type size() const { return _s; } |
||||
inline size_type capacity() const { return C; } |
||||
|
||||
inline void clear() |
||||
{ |
||||
for(unsigned long i=0;i<_s;++i) |
||||
reinterpret_cast<T *>(_mem + (sizeof(T) * i))->~T(); |
||||
_s = 0; |
||||
} |
||||
|
||||
private: |
||||
char _mem[sizeof(T) * C]; |
||||
unsigned long _s; |
||||
}; |
||||
|
||||
} // namespace ZeroTier
|
||||
@ -1,650 +0,0 @@
|
||||
/* |
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2015 ZeroTier, Inc. |
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
||||
* |
||||
* -- |
||||
* |
||||
* ZeroTier may be used and distributed under the terms of the GPLv3, which |
||||
* are available at: http://www.gnu.org/licenses/gpl-3.0.html |
||||
* |
||||
* If you would like to embed ZeroTier into a commercial application or |
||||
* redistribute it in a modified binary form, please contact ZeroTier Networks |
||||
* LLC. Start here: http://www.zerotier.com/ |
||||
*/ |
||||
|
||||
#include <stdint.h> |
||||
#include <stdio.h> |
||||
#include <stdlib.h> |
||||
#include <string.h> |
||||
#include <errno.h> |
||||
|
||||
#include <unistd.h> |
||||
#include <signal.h> |
||||
|
||||
#include <fcntl.h> |
||||
#include <sys/types.h> |
||||
#include <sys/stat.h> |
||||
#include <sys/ioctl.h> |
||||
#include <sys/wait.h> |
||||
#include <sys/select.h> |
||||
#include <sys/cdefs.h> |
||||
#include <sys/uio.h> |
||||
#include <sys/param.h> |
||||
#include <sys/ioctl.h> |
||||
#include <sys/socket.h> |
||||
#include <netinet/in.h> |
||||
#include <arpa/inet.h> |
||||
#include <net/route.h> |
||||
#include <net/if.h> |
||||
#include <net/if_arp.h> |
||||
#include <net/if_dl.h> |
||||
#include <net/if_media.h> |
||||
#include <netinet6/in6_var.h> |
||||
#include <netinet/in_var.h> |
||||
#include <netinet/icmp6.h> |
||||
|
||||
#include <pcap/pcap.h> |
||||
|
||||
// OSX compile fix... in6_var defines this in a struct which namespaces it for C++ ... why?!? |
||||
struct prf_ra { |
||||
u_char onlink : 1; |
||||
u_char autonomous : 1; |
||||
u_char reserved : 6; |
||||
} prf_ra; |
||||
|
||||
#include <netinet6/nd6.h> |
||||
#include <ifaddrs.h> |
||||
|
||||
// These are KERNEL_PRIVATE... why? |
||||
#ifndef SIOCAUTOCONF_START |
||||
#define SIOCAUTOCONF_START _IOWR('i', 132, struct in6_ifreq) /* accept rtadvd on this interface */ |
||||
#endif |
||||
#ifndef SIOCAUTOCONF_STOP |
||||
#define SIOCAUTOCONF_STOP _IOWR('i', 133, struct in6_ifreq) /* stop accepting rtadv for this interface */ |
||||
#endif |
||||
|
||||
#ifndef ETH_ALEN |
||||
#define ETH_ALEN 6 |
||||
#endif |
||||
|
||||
// -------------------------------------------------------------------------- |
||||
// -------------------------------------------------------------------------- |
||||
// This source is from: |
||||
// http://www.opensource.apple.com/source/Libinfo/Libinfo-406.17/gen.subproj/getifmaddrs.c?txt |
||||
// It's here because OSX 10.6 does not have this convenience function. |
||||
|
||||
#define SALIGN (sizeof(uint32_t) - 1) |
||||
#define SA_RLEN(sa) ((sa)->sa_len ? (((sa)->sa_len + SALIGN) & ~SALIGN) : \ |
||||
(SALIGN + 1)) |
||||
#define MAX_SYSCTL_TRY 5 |
||||
#define RTA_MASKS (RTA_GATEWAY | RTA_IFP | RTA_IFA) |
||||
|
||||
/* FreeBSD uses NET_RT_IFMALIST and RTM_NEWMADDR from <sys/socket.h> */ |
||||
/* We can use NET_RT_IFLIST2 and RTM_NEWMADDR2 on Darwin */ |
||||
//#define DARWIN_COMPAT |
||||
|
||||
//#ifdef DARWIN_COMPAT |
||||
#define GIM_SYSCTL_MIB NET_RT_IFLIST2 |
||||
#define GIM_RTM_ADDR RTM_NEWMADDR2 |
||||
//#else |
||||
//#define GIM_SYSCTL_MIB NET_RT_IFMALIST |
||||
//#define GIM_RTM_ADDR RTM_NEWMADDR |
||||
//#endif |
||||
|
||||
// Not in 10.6 includes so use our own |
||||
struct _intl_ifmaddrs { |
||||
struct _intl_ifmaddrs *ifma_next; |
||||
struct sockaddr *ifma_name; |
||||
struct sockaddr *ifma_addr; |
||||
struct sockaddr *ifma_lladdr; |
||||
}; |
||||
|
||||
static inline int _intl_getifmaddrs(struct _intl_ifmaddrs **pif) |
||||
{ |
||||
int icnt = 1; |
||||
int dcnt = 0; |
||||
int ntry = 0; |
||||
size_t len; |
||||
size_t needed; |
||||
int mib[6]; |
||||
int i; |
||||
char *buf; |
||||
char *data; |
||||
char *next; |
||||
char *p; |
||||
struct ifma_msghdr2 *ifmam; |
||||
struct _intl_ifmaddrs *ifa, *ift; |
||||
struct rt_msghdr *rtm; |
||||
struct sockaddr *sa; |
||||
|
||||
mib[0] = CTL_NET; |
||||
mib[1] = PF_ROUTE; |
||||
mib[2] = 0; /* protocol */ |
||||
mib[3] = 0; /* wildcard address family */ |
||||
mib[4] = GIM_SYSCTL_MIB; |
||||
mib[5] = 0; /* no flags */ |
||||
do { |
||||
if (sysctl(mib, 6, NULL, &needed, NULL, 0) < 0) |
||||
return (-1); |
||||
if ((buf = (char *)malloc(needed)) == NULL) |
||||
return (-1); |
||||
if (sysctl(mib, 6, buf, &needed, NULL, 0) < 0) { |
||||
if (errno != ENOMEM || ++ntry >= MAX_SYSCTL_TRY) { |
||||
free(buf); |
||||
return (-1); |
||||
} |
||||
free(buf); |
||||
buf = NULL; |
||||
} |
||||
} while (buf == NULL); |
||||
|
||||
for (next = buf; next < buf + needed; next += rtm->rtm_msglen) { |
||||
rtm = (struct rt_msghdr *)(void *)next; |
||||
if (rtm->rtm_version != RTM_VERSION) |
||||
continue; |
||||
switch (rtm->rtm_type) { |
||||
case GIM_RTM_ADDR: |
||||
ifmam = (struct ifma_msghdr2 *)(void *)rtm; |
||||
if ((ifmam->ifmam_addrs & RTA_IFA) == 0) |
||||
break; |
||||
icnt++; |
||||
p = (char *)(ifmam + 1); |
||||
for (i = 0; i < RTAX_MAX; i++) { |
||||
if ((RTA_MASKS & ifmam->ifmam_addrs & |
||||
(1 << i)) == 0) |
||||
continue; |
||||
sa = (struct sockaddr *)(void *)p; |
||||
len = SA_RLEN(sa); |
||||
dcnt += len; |
||||
p += len; |
||||
} |
||||
break; |
||||
} |
||||
} |
||||
|
||||
data = (char *)malloc(sizeof(struct _intl_ifmaddrs) * icnt + dcnt); |
||||
if (data == NULL) { |
||||
free(buf); |
||||
return (-1); |
||||
} |
||||
|
||||
ifa = (struct _intl_ifmaddrs *)(void *)data; |
||||
data += sizeof(struct _intl_ifmaddrs) * icnt; |
||||
|
||||
memset(ifa, 0, sizeof(struct _intl_ifmaddrs) * icnt); |
||||
ift = ifa; |
||||
|
||||
for (next = buf; next < buf + needed; next += rtm->rtm_msglen) { |
||||
rtm = (struct rt_msghdr *)(void *)next; |
||||
if (rtm->rtm_version != RTM_VERSION) |
||||
continue; |
||||
|
||||
switch (rtm->rtm_type) { |
||||
case GIM_RTM_ADDR: |
||||
ifmam = (struct ifma_msghdr2 *)(void *)rtm; |
||||
if ((ifmam->ifmam_addrs & RTA_IFA) == 0) |
||||
break; |
||||
|
||||
p = (char *)(ifmam + 1); |
||||
for (i = 0; i < RTAX_MAX; i++) { |
||||
if ((RTA_MASKS & ifmam->ifmam_addrs & |
||||
(1 << i)) == 0) |
||||
continue; |
||||
sa = (struct sockaddr *)(void *)p; |
||||
len = SA_RLEN(sa); |
||||
switch (i) { |
||||
case RTAX_GATEWAY: |
||||
ift->ifma_lladdr = |
||||
(struct sockaddr *)(void *)data; |
||||
memcpy(data, p, len); |
||||
data += len; |
||||
break; |
||||
|
||||
case RTAX_IFP: |
||||
ift->ifma_name = |
||||
(struct sockaddr *)(void *)data; |
||||
memcpy(data, p, len); |
||||
data += len; |
||||
break; |
||||
|
||||
case RTAX_IFA: |
||||
ift->ifma_addr = |
||||
(struct sockaddr *)(void *)data; |
||||
memcpy(data, p, len); |
||||
data += len; |
||||
break; |
||||
|
||||
default: |
||||
data += len; |
||||
break; |
||||
} |
||||
p += len; |
||||
} |
||||
ift->ifma_next = ift + 1; |
||||
ift = ift->ifma_next; |
||||
break; |
||||
} |
||||
} |
||||
|
||||
free(buf); |
||||
|
||||
if (ift > ifa) { |
||||
ift--; |
||||
ift->ifma_next = NULL; |
||||
*pif = ifa; |
||||
} else { |
||||
*pif = NULL; |
||||
free(ifa); |
||||
} |
||||
return (0); |
||||
} |
||||
|
||||
static inline void _intl_freeifmaddrs(struct _intl_ifmaddrs *ifmp) |
||||
{ |
||||
free(ifmp); |
||||
} |
||||
|
||||
// -------------------------------------------------------------------------- |
||||
// -------------------------------------------------------------------------- |
||||
|
||||
#include <string> |
||||
#include <map> |
||||
#include <set> |
||||
#include <algorithm> |
||||
|
||||
#include "../node/Constants.hpp" |
||||
#include "../node/Utils.hpp" |
||||
#include "../node/Mutex.hpp" |
||||
#include "../node/Dictionary.hpp" |
||||
#include "OSUtils.hpp" |
||||
#include "OSXEthernetTap.hpp" |
||||
|
||||
// ff:ff:ff:ff:ff:ff with no ADI |
||||
static const ZeroTier::MulticastGroup _blindWildcardMulticastGroup(ZeroTier::MAC(0xff),0); |
||||
|
||||
static inline bool _setIpv6Stuff(const char *ifname,bool performNUD,bool acceptRouterAdverts) |
||||
{ |
||||
struct in6_ndireq nd; |
||||
struct in6_ifreq ifr; |
||||
|
||||
int s = socket(AF_INET6,SOCK_DGRAM,0); |
||||
if (s <= 0) |
||||
return false; |
||||
|
||||
memset(&nd,0,sizeof(nd)); |
||||
strncpy(nd.ifname,ifname,sizeof(nd.ifname)); |
||||
|
||||
if (ioctl(s,SIOCGIFINFO_IN6,&nd)) { |
||||
close(s); |
||||
return false; |
||||
} |
||||
|
||||
unsigned long oldFlags = (unsigned long)nd.ndi.flags; |
||||
|
||||
if (performNUD) |
||||
nd.ndi.flags |= ND6_IFF_PERFORMNUD; |
||||
else nd.ndi.flags &= ~ND6_IFF_PERFORMNUD; |
||||
|
||||
if (oldFlags != (unsigned long)nd.ndi.flags) { |
||||
if (ioctl(s,SIOCSIFINFO_FLAGS,&nd)) { |
||||
close(s); |
||||
return false; |
||||
} |
||||
} |
||||
|
||||
memset(&ifr,0,sizeof(ifr)); |
||||
strncpy(ifr.ifr_name,ifname,sizeof(ifr.ifr_name)); |
||||
if (ioctl(s,acceptRouterAdverts ? SIOCAUTOCONF_START : SIOCAUTOCONF_STOP,&ifr)) { |
||||
close(s); |
||||
return false; |
||||
} |
||||
|
||||
close(s); |
||||
return true; |
||||
} |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
static std::set<std::string> globalDeviceNames; |
||||
static Mutex globalTapCreateLock; |
||||
|
||||
OSXEthernetTap::OSXEthernetTap( |
||||
const char *homePath, |
||||
const MAC &mac, |
||||
unsigned int mtu, |
||||
unsigned int metric, |
||||
uint64_t nwid, |
||||
const char *friendlyName, |
||||
void (*handler)(void *,uint64_t,const MAC &,const MAC &,unsigned int,unsigned int,const void *data,unsigned int len), |
||||
void *arg) : |
||||
_handler(handler), |
||||
_arg(arg), |
||||
_pcap((void *)0), |
||||
_nwid(nwid), |
||||
_mac(mac), |
||||
_homePath(homePath), |
||||
_mtu(mtu), |
||||
_metric(metric), |
||||
_enabled(true) |
||||
{ |
||||
char errbuf[PCAP_ERRBUF_SIZE]; |
||||
char devname[64],ethaddr[64],mtustr[32],metstr[32],nwids[32]; |
||||
|
||||
Utils::snprintf(nwids,sizeof(nwids),"%.16llx",nwid); |
||||
|
||||
if (mtu > 2800) |
||||
throw std::runtime_error("max tap MTU is 2800"); |
||||
|
||||
Mutex::Lock _gl(globalTapCreateLock); |
||||
|
||||
std::string desiredDevice; |
||||
Dictionary devmap; |
||||
{ |
||||
std::string devmapbuf; |
||||
if (OSUtils::readFile((_homePath + ZT_PATH_SEPARATOR_S + "devicemap").c_str(),devmapbuf)) { |
||||
devmap.fromString(devmapbuf); |
||||
desiredDevice = devmap.get(nwids,""); |
||||
} |
||||
} |
||||
|
||||
if ((desiredDevice.length() >= 9)&&(desiredDevice.substr(0,6) == "bridge")) { |
||||
// length() >= 9 matches bridge### or bridge#### |
||||
_dev = desiredDevice; |
||||
} else { |
||||
if (globalDeviceNames.size() >= (10000 - 128)) // sanity check... this would be nuts |
||||
throw std::runtime_error("too many devices!"); |
||||
unsigned int pseudoBridgeNo = (unsigned int)((nwid ^ (nwid >> 32)) % (10000 - 128)) + 128; // range: bridge128 to bridge9999 |
||||
sprintf(devname,"bridge%u",pseudoBridgeNo); |
||||
while (globalDeviceNames.count(std::string(devname)) > 0) { |
||||
++pseudoBridgeNo; |
||||
if (pseudoBridgeNo > 9999) |
||||
pseudoBridgeNo = 64; |
||||
sprintf(devname,"bridge%u",pseudoBridgeNo); |
||||
} |
||||
_dev = devname; |
||||
} |
||||
|
||||
// Configure MAC address and MTU, bring interface up |
||||
long cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
::execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),"create",(const char *)0); |
||||
::_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(cpid,&exitcode,0); |
||||
if (exitcode != 0) |
||||
throw std::runtime_error("ifconfig failure setting link-layer address and activating tap interface"); |
||||
} else throw std::runtime_error("unable to fork()"); |
||||
Utils::snprintf(ethaddr,sizeof(ethaddr),"%.2x:%.2x:%.2x:%.2x:%.2x:%.2x",(int)mac[0],(int)mac[1],(int)mac[2],(int)mac[3],(int)mac[4],(int)mac[5]); |
||||
Utils::snprintf(mtustr,sizeof(mtustr),"%u",_mtu); |
||||
Utils::snprintf(metstr,sizeof(metstr),"%u",_metric); |
||||
cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
::execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),"lladdr",ethaddr,"mtu",mtustr,"metric",metstr,"up",(const char *)0); |
||||
::_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(cpid,&exitcode,0); |
||||
if (exitcode != 0) |
||||
throw std::runtime_error("ifconfig failure setting link-layer address and activating tap interface"); |
||||
} else throw std::runtime_error("unable to fork()"); |
||||
|
||||
_setIpv6Stuff(_dev.c_str(),true,false); |
||||
|
||||
_pcap = (void *)pcap_create(_dev.c_str(),errbuf); |
||||
if (!_pcap) { |
||||
cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
::execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),"destroy",(const char *)0); |
||||
::_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(cpid,&exitcode,0); |
||||
} |
||||
throw std::runtime_error((std::string("pcap_create() on new bridge device failed: ") + errbuf).c_str()); |
||||
} |
||||
pcap_set_promisc(reinterpret_cast<pcap_t *>(_pcap),1); |
||||
pcap_set_timeout(reinterpret_cast<pcap_t *>(_pcap),120000); |
||||
pcap_set_immediate_mode(reinterpret_cast<pcap_t *>(_pcap),1); |
||||
if (pcap_set_buffer_size(reinterpret_cast<pcap_t *>(_pcap),1024 * 1024 * 16) != 0) // 16MB |
||||
fprintf(stderr,"WARNING: pcap_set_buffer_size() failed!\n"); |
||||
if (pcap_set_snaplen(reinterpret_cast<pcap_t *>(_pcap),4096) != 0) |
||||
fprintf(stderr,"WARNING: pcap_set_snaplen() failed!\n"); |
||||
if (pcap_activate(reinterpret_cast<pcap_t *>(_pcap)) != 0) { |
||||
pcap_close(reinterpret_cast<pcap_t *>(_pcap)); |
||||
cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
::execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),"destroy",(const char *)0); |
||||
::_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(cpid,&exitcode,0); |
||||
} |
||||
throw std::runtime_error("pcap_activate() on new bridge device failed."); |
||||
} |
||||
|
||||
globalDeviceNames.insert(_dev); |
||||
|
||||
devmap[nwids] = _dev; |
||||
OSUtils::writeFile((_homePath + ZT_PATH_SEPARATOR_S + "devicemap").c_str(),devmap.toString()); |
||||
|
||||
_thread = Thread::start(this); |
||||
} |
||||
|
||||
OSXEthernetTap::~OSXEthernetTap() |
||||
{ |
||||
_enabled = false; |
||||
|
||||
Mutex::Lock _gl(globalTapCreateLock); |
||||
globalDeviceNames.erase(_dev); |
||||
|
||||
long cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
::execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),"destroy",(const char *)0); |
||||
::_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(cpid,&exitcode,0); |
||||
if (exitcode == 0) { |
||||
// Destroying the interface nukes pcap and terminates the thread. |
||||
Thread::join(_thread); |
||||
} |
||||
} |
||||
|
||||
pcap_close(reinterpret_cast<pcap_t *>(_pcap)); |
||||
} |
||||
|
||||
static bool ___removeIp(const std::string &_dev,const InetAddress &ip) |
||||
{ |
||||
long cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),"inet",ip.toIpString().c_str(),"-alias",(const char *)0); |
||||
_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
waitpid(cpid,&exitcode,0); |
||||
return (exitcode == 0); |
||||
} |
||||
return false; // never reached, make compiler shut up about return value |
||||
} |
||||
|
||||
bool OSXEthernetTap::addIp(const InetAddress &ip) |
||||
{ |
||||
if (!ip) |
||||
return false; |
||||
|
||||
std::vector<InetAddress> allIps(ips()); |
||||
if (std::binary_search(allIps.begin(),allIps.end(),ip)) |
||||
return true; |
||||
|
||||
// Remove and reconfigure if address is the same but netmask is different |
||||
for(std::vector<InetAddress>::iterator i(allIps.begin());i!=allIps.end();++i) { |
||||
if ((i->ipsEqual(ip))&&(i->netmaskBits() != ip.netmaskBits())) { |
||||
if (___removeIp(_dev,*i)) |
||||
break; |
||||
} |
||||
} |
||||
|
||||
long cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
::execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),ip.isV4() ? "inet" : "inet6",ip.toString().c_str(),"alias",(const char *)0); |
||||
::_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(cpid,&exitcode,0); |
||||
return (exitcode == 0); |
||||
} // else return false... |
||||
|
||||
return false; |
||||
} |
||||
|
||||
bool OSXEthernetTap::removeIp(const InetAddress &ip) |
||||
{ |
||||
if (!ip) |
||||
return true; |
||||
std::vector<InetAddress> allIps(ips()); |
||||
if (!std::binary_search(allIps.begin(),allIps.end(),ip)) { |
||||
if (___removeIp(_dev,ip)) |
||||
return true; |
||||
} |
||||
return false; |
||||
} |
||||
|
||||
std::vector<InetAddress> OSXEthernetTap::ips() const |
||||
{ |
||||
struct ifaddrs *ifa = (struct ifaddrs *)0; |
||||
if (getifaddrs(&ifa)) |
||||
return std::vector<InetAddress>(); |
||||
|
||||
std::vector<InetAddress> r; |
||||
|
||||
struct ifaddrs *p = ifa; |
||||
while (p) { |
||||
if ((!strcmp(p->ifa_name,_dev.c_str()))&&(p->ifa_addr)&&(p->ifa_netmask)&&(p->ifa_addr->sa_family == p->ifa_netmask->sa_family)) { |
||||
switch(p->ifa_addr->sa_family) { |
||||
case AF_INET: { |
||||
struct sockaddr_in *sin = (struct sockaddr_in *)p->ifa_addr; |
||||
struct sockaddr_in *nm = (struct sockaddr_in *)p->ifa_netmask; |
||||
r.push_back(InetAddress(&(sin->sin_addr.s_addr),4,Utils::countBits((uint32_t)nm->sin_addr.s_addr))); |
||||
} break; |
||||
case AF_INET6: { |
||||
struct sockaddr_in6 *sin = (struct sockaddr_in6 *)p->ifa_addr; |
||||
struct sockaddr_in6 *nm = (struct sockaddr_in6 *)p->ifa_netmask; |
||||
uint32_t b[4]; |
||||
memcpy(b,nm->sin6_addr.s6_addr,sizeof(b)); |
||||
r.push_back(InetAddress(sin->sin6_addr.s6_addr,16,Utils::countBits(b[0]) + Utils::countBits(b[1]) + Utils::countBits(b[2]) + Utils::countBits(b[3]))); |
||||
} break; |
||||
} |
||||
} |
||||
p = p->ifa_next; |
||||
} |
||||
|
||||
if (ifa) |
||||
freeifaddrs(ifa); |
||||
|
||||
std::sort(r.begin(),r.end()); |
||||
std::unique(r.begin(),r.end()); |
||||
|
||||
return r; |
||||
} |
||||
|
||||
void OSXEthernetTap::put(const MAC &from,const MAC &to,unsigned int etherType,const void *data,unsigned int len) |
||||
{ |
||||
char putBuf[4096]; |
||||
if ((len <= _mtu)&&(_enabled)) { |
||||
to.copyTo(putBuf,6); |
||||
from.copyTo(putBuf + 6,6); |
||||
*((uint16_t *)(putBuf + 12)) = htons((uint16_t)etherType); |
||||
memcpy(putBuf + 14,data,len); |
||||
len += 14; |
||||
int r = pcap_inject(reinterpret_cast<pcap_t *>(_pcap),putBuf,len); |
||||
if (r <= 0) { |
||||
printf("%s: pcap_inject() failed\n",_dev.c_str()); |
||||
return; |
||||
} |
||||
printf("%s: inject %s -> %s etherType==%u len=%u r==%d\n",_dev.c_str(),from.toString().c_str(),to.toString().c_str(),etherType,len,r); |
||||
} |
||||
} |
||||
|
||||
std::string OSXEthernetTap::deviceName() const |
||||
{ |
||||
return _dev; |
||||
} |
||||
|
||||
void OSXEthernetTap::setFriendlyName(const char *friendlyName) |
||||
{ |
||||
} |
||||
|
||||
void OSXEthernetTap::scanMulticastGroups(std::vector<MulticastGroup> &added,std::vector<MulticastGroup> &removed) |
||||
{ |
||||
std::vector<MulticastGroup> newGroups; |
||||
|
||||
struct _intl_ifmaddrs *ifmap = (struct _intl_ifmaddrs *)0; |
||||
if (!_intl_getifmaddrs(&ifmap)) { |
||||
struct _intl_ifmaddrs *p = ifmap; |
||||
while (p) { |
||||
if (p->ifma_addr->sa_family == AF_LINK) { |
||||
struct sockaddr_dl *in = (struct sockaddr_dl *)p->ifma_name; |
||||
struct sockaddr_dl *la = (struct sockaddr_dl *)p->ifma_addr; |
||||
if ((la->sdl_alen == 6)&&(in->sdl_nlen <= _dev.length())&&(!memcmp(_dev.data(),in->sdl_data,in->sdl_nlen))) |
||||
newGroups.push_back(MulticastGroup(MAC(la->sdl_data + la->sdl_nlen,6),0)); |
||||
} |
||||
p = p->ifma_next; |
||||
} |
||||
_intl_freeifmaddrs(ifmap); |
||||
} |
||||
|
||||
std::vector<InetAddress> allIps(ips()); |
||||
for(std::vector<InetAddress>::iterator ip(allIps.begin());ip!=allIps.end();++ip) |
||||
newGroups.push_back(MulticastGroup::deriveMulticastGroupForAddressResolution(*ip)); |
||||
|
||||
std::sort(newGroups.begin(),newGroups.end()); |
||||
std::unique(newGroups.begin(),newGroups.end()); |
||||
|
||||
for(std::vector<MulticastGroup>::iterator m(newGroups.begin());m!=newGroups.end();++m) { |
||||
if (!std::binary_search(_multicastGroups.begin(),_multicastGroups.end(),*m)) |
||||
added.push_back(*m); |
||||
} |
||||
for(std::vector<MulticastGroup>::iterator m(_multicastGroups.begin());m!=_multicastGroups.end();++m) { |
||||
if (!std::binary_search(newGroups.begin(),newGroups.end(),*m)) |
||||
removed.push_back(*m); |
||||
} |
||||
|
||||
_multicastGroups.swap(newGroups); |
||||
} |
||||
|
||||
static void _pcapHandler(u_char *ptr,const struct pcap_pkthdr *hdr,const u_char *data) |
||||
{ |
||||
OSXEthernetTap *tap = reinterpret_cast<OSXEthernetTap *>(ptr); |
||||
if (hdr->caplen > 14) { |
||||
MAC to(data,6); |
||||
MAC from(data + 6,6); |
||||
if (from == tap->_mac) { |
||||
unsigned int etherType = ntohs(((const uint16_t *)data)[6]); |
||||
printf("%s: %s -> %s etherType==%u len==%u\n",tap->_dev.c_str(),from.toString().c_str(),to.toString().c_str(),etherType,(unsigned int)hdr->caplen); |
||||
// TODO: VLAN support |
||||
tap->_handler(tap->_arg,tap->_nwid,from,to,etherType,0,(const void *)(data + 14),hdr->len - 14); |
||||
} |
||||
} |
||||
} |
||||
|
||||
void OSXEthernetTap::threadMain() |
||||
throw() |
||||
{ |
||||
pcap_loop(reinterpret_cast<pcap_t *>(_pcap),-1,&_pcapHandler,reinterpret_cast<u_char *>(this)); |
||||
} |
||||
|
||||
} // namespace ZeroTier |
||||
@ -1,831 +0,0 @@
|
||||
/* |
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2015 ZeroTier, Inc. |
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
||||
* |
||||
* -- |
||||
* |
||||
* ZeroTier may be used and distributed under the terms of the GPLv3, which |
||||
* are available at: http://www.gnu.org/licenses/gpl-3.0.html |
||||
* |
||||
* If you would like to embed ZeroTier into a commercial application or |
||||
* redistribute it in a modified binary form, please contact ZeroTier Networks |
||||
* LLC. Start here: http://www.zerotier.com/ |
||||
*/ |
||||
|
||||
#include <stdint.h> |
||||
#include <stdio.h> |
||||
#include <stdlib.h> |
||||
#include <string.h> |
||||
#include <errno.h> |
||||
|
||||
#include <unistd.h> |
||||
#include <signal.h> |
||||
|
||||
#include <fcntl.h> |
||||
#include <sys/types.h> |
||||
#include <sys/stat.h> |
||||
#include <sys/ioctl.h> |
||||
#include <sys/wait.h> |
||||
#include <sys/select.h> |
||||
#include <sys/cdefs.h> |
||||
#include <sys/uio.h> |
||||
#include <sys/param.h> |
||||
#include <sys/ioctl.h> |
||||
#include <sys/socket.h> |
||||
#include <sys/sys_domain.h> |
||||
#include <sys/kern_control.h> |
||||
#include <net/if_utun.h> |
||||
#include <netinet/in.h> |
||||
#include <arpa/inet.h> |
||||
#include <net/route.h> |
||||
#include <net/if.h> |
||||
#include <net/if_arp.h> |
||||
#include <net/if_dl.h> |
||||
#include <net/if_media.h> |
||||
#include <netinet6/in6_var.h> |
||||
#include <netinet/in_var.h> |
||||
#include <netinet/icmp6.h> |
||||
|
||||
// OSX compile fix... in6_var defines this in a struct which namespaces it for C++ ... why?!? |
||||
struct prf_ra { |
||||
u_char onlink : 1; |
||||
u_char autonomous : 1; |
||||
u_char reserved : 6; |
||||
} prf_ra; |
||||
|
||||
#include <netinet6/nd6.h> |
||||
#include <ifaddrs.h> |
||||
|
||||
// These are KERNEL_PRIVATE... why? |
||||
#ifndef SIOCAUTOCONF_START |
||||
#define SIOCAUTOCONF_START _IOWR('i', 132, struct in6_ifreq) /* accept rtadvd on this interface */ |
||||
#endif |
||||
#ifndef SIOCAUTOCONF_STOP |
||||
#define SIOCAUTOCONF_STOP _IOWR('i', 133, struct in6_ifreq) /* stop accepting rtadv for this interface */ |
||||
#endif |
||||
|
||||
// -------------------------------------------------------------------------- |
||||
// -------------------------------------------------------------------------- |
||||
// This source is from: |
||||
// http://www.opensource.apple.com/source/Libinfo/Libinfo-406.17/gen.subproj/getifmaddrs.c?txt |
||||
// It's here because OSX 10.6 does not have this convenience function. |
||||
|
||||
#define SALIGN (sizeof(uint32_t) - 1) |
||||
#define SA_RLEN(sa) ((sa)->sa_len ? (((sa)->sa_len + SALIGN) & ~SALIGN) : \ |
||||
(SALIGN + 1)) |
||||
#define MAX_SYSCTL_TRY 5 |
||||
#define RTA_MASKS (RTA_GATEWAY | RTA_IFP | RTA_IFA) |
||||
|
||||
/* FreeBSD uses NET_RT_IFMALIST and RTM_NEWMADDR from <sys/socket.h> */ |
||||
/* We can use NET_RT_IFLIST2 and RTM_NEWMADDR2 on Darwin */ |
||||
//#define DARWIN_COMPAT |
||||
|
||||
//#ifdef DARWIN_COMPAT |
||||
#define GIM_SYSCTL_MIB NET_RT_IFLIST2 |
||||
#define GIM_RTM_ADDR RTM_NEWMADDR2 |
||||
//#else |
||||
//#define GIM_SYSCTL_MIB NET_RT_IFMALIST |
||||
//#define GIM_RTM_ADDR RTM_NEWMADDR |
||||
//#endif |
||||
|
||||
// Not in 10.6 includes so use our own |
||||
struct _intl_ifmaddrs { |
||||
struct _intl_ifmaddrs *ifma_next; |
||||
struct sockaddr *ifma_name; |
||||
struct sockaddr *ifma_addr; |
||||
struct sockaddr *ifma_lladdr; |
||||
}; |
||||
|
||||
static inline int _intl_getifmaddrs(struct _intl_ifmaddrs **pif) |
||||
{ |
||||
int icnt = 1; |
||||
int dcnt = 0; |
||||
int ntry = 0; |
||||
size_t len; |
||||
size_t needed; |
||||
int mib[6]; |
||||
int i; |
||||
char *buf; |
||||
char *data; |
||||
char *next; |
||||
char *p; |
||||
struct ifma_msghdr2 *ifmam; |
||||
struct _intl_ifmaddrs *ifa, *ift; |
||||
struct rt_msghdr *rtm; |
||||
struct sockaddr *sa; |
||||
|
||||
mib[0] = CTL_NET; |
||||
mib[1] = PF_ROUTE; |
||||
mib[2] = 0; /* protocol */ |
||||
mib[3] = 0; /* wildcard address family */ |
||||
mib[4] = GIM_SYSCTL_MIB; |
||||
mib[5] = 0; /* no flags */ |
||||
do { |
||||
if (sysctl(mib, 6, NULL, &needed, NULL, 0) < 0) |
||||
return (-1); |
||||
if ((buf = (char *)malloc(needed)) == NULL) |
||||
return (-1); |
||||
if (sysctl(mib, 6, buf, &needed, NULL, 0) < 0) { |
||||
if (errno != ENOMEM || ++ntry >= MAX_SYSCTL_TRY) { |
||||
free(buf); |
||||
return (-1); |
||||
} |
||||
free(buf); |
||||
buf = NULL; |
||||
} |
||||
} while (buf == NULL); |
||||
|
||||
for (next = buf; next < buf + needed; next += rtm->rtm_msglen) { |
||||
rtm = (struct rt_msghdr *)(void *)next; |
||||
if (rtm->rtm_version != RTM_VERSION) |
||||
continue; |
||||
switch (rtm->rtm_type) { |
||||
case GIM_RTM_ADDR: |
||||
ifmam = (struct ifma_msghdr2 *)(void *)rtm; |
||||
if ((ifmam->ifmam_addrs & RTA_IFA) == 0) |
||||
break; |
||||
icnt++; |
||||
p = (char *)(ifmam + 1); |
||||
for (i = 0; i < RTAX_MAX; i++) { |
||||
if ((RTA_MASKS & ifmam->ifmam_addrs & |
||||
(1 << i)) == 0) |
||||
continue; |
||||
sa = (struct sockaddr *)(void *)p; |
||||
len = SA_RLEN(sa); |
||||
dcnt += len; |
||||
p += len; |
||||
} |
||||
break; |
||||
} |
||||
} |
||||
|
||||
data = (char *)malloc(sizeof(struct _intl_ifmaddrs) * icnt + dcnt); |
||||
if (data == NULL) { |
||||
free(buf); |
||||
return (-1); |
||||
} |
||||
|
||||
ifa = (struct _intl_ifmaddrs *)(void *)data; |
||||
data += sizeof(struct _intl_ifmaddrs) * icnt; |
||||
|
||||
memset(ifa, 0, sizeof(struct _intl_ifmaddrs) * icnt); |
||||
ift = ifa; |
||||
|
||||
for (next = buf; next < buf + needed; next += rtm->rtm_msglen) { |
||||
rtm = (struct rt_msghdr *)(void *)next; |
||||
if (rtm->rtm_version != RTM_VERSION) |
||||
continue; |
||||
|
||||
switch (rtm->rtm_type) { |
||||
case GIM_RTM_ADDR: |
||||
ifmam = (struct ifma_msghdr2 *)(void *)rtm; |
||||
if ((ifmam->ifmam_addrs & RTA_IFA) == 0) |
||||
break; |
||||
|
||||
p = (char *)(ifmam + 1); |
||||
for (i = 0; i < RTAX_MAX; i++) { |
||||
if ((RTA_MASKS & ifmam->ifmam_addrs & |
||||
(1 << i)) == 0) |
||||
continue; |
||||
sa = (struct sockaddr *)(void *)p; |
||||
len = SA_RLEN(sa); |
||||
switch (i) { |
||||
case RTAX_GATEWAY: |
||||
ift->ifma_lladdr = |
||||
(struct sockaddr *)(void *)data; |
||||
memcpy(data, p, len); |
||||
data += len; |
||||
break; |
||||
|
||||
case RTAX_IFP: |
||||
ift->ifma_name = |
||||
(struct sockaddr *)(void *)data; |
||||
memcpy(data, p, len); |
||||
data += len; |
||||
break; |
||||
|
||||
case RTAX_IFA: |
||||
ift->ifma_addr = |
||||
(struct sockaddr *)(void *)data; |
||||
memcpy(data, p, len); |
||||
data += len; |
||||
break; |
||||
|
||||
default: |
||||
data += len; |
||||
break; |
||||
} |
||||
p += len; |
||||
} |
||||
ift->ifma_next = ift + 1; |
||||
ift = ift->ifma_next; |
||||
break; |
||||
} |
||||
} |
||||
|
||||
free(buf); |
||||
|
||||
if (ift > ifa) { |
||||
ift--; |
||||
ift->ifma_next = NULL; |
||||
*pif = ifa; |
||||
} else { |
||||
*pif = NULL; |
||||
free(ifa); |
||||
} |
||||
return (0); |
||||
} |
||||
|
||||
static inline void _intl_freeifmaddrs(struct _intl_ifmaddrs *ifmp) |
||||
{ |
||||
free(ifmp); |
||||
} |
||||
|
||||
// -------------------------------------------------------------------------- |
||||
// -------------------------------------------------------------------------- |
||||
|
||||
#include <string> |
||||
#include <map> |
||||
#include <set> |
||||
#include <algorithm> |
||||
|
||||
#include "../node/Constants.hpp" |
||||
#include "../node/Utils.hpp" |
||||
#include "../node/Mutex.hpp" |
||||
#include "../node/Dictionary.hpp" |
||||
#include "Arp.hpp" |
||||
#include "OSUtils.hpp" |
||||
#include "OSXEthernetTap.hpp" |
||||
|
||||
// ff:ff:ff:ff:ff:ff with no ADI |
||||
static const ZeroTier::MulticastGroup _blindWildcardMulticastGroup(ZeroTier::MAC(0xff),0); |
||||
|
||||
static inline bool _setIpv6Stuff(const char *ifname,bool performNUD,bool acceptRouterAdverts) |
||||
{ |
||||
struct in6_ndireq nd; |
||||
struct in6_ifreq ifr; |
||||
|
||||
int s = socket(AF_INET6,SOCK_DGRAM,0); |
||||
if (s <= 0) |
||||
return false; |
||||
|
||||
memset(&nd,0,sizeof(nd)); |
||||
strncpy(nd.ifname,ifname,sizeof(nd.ifname)); |
||||
|
||||
if (ioctl(s,SIOCGIFINFO_IN6,&nd)) { |
||||
close(s); |
||||
return false; |
||||
} |
||||
|
||||
unsigned long oldFlags = (unsigned long)nd.ndi.flags; |
||||
|
||||
if (performNUD) |
||||
nd.ndi.flags |= ND6_IFF_PERFORMNUD; |
||||
else nd.ndi.flags &= ~ND6_IFF_PERFORMNUD; |
||||
|
||||
if (oldFlags != (unsigned long)nd.ndi.flags) { |
||||
if (ioctl(s,SIOCSIFINFO_FLAGS,&nd)) { |
||||
close(s); |
||||
return false; |
||||
} |
||||
} |
||||
|
||||
memset(&ifr,0,sizeof(ifr)); |
||||
strncpy(ifr.ifr_name,ifname,sizeof(ifr.ifr_name)); |
||||
if (ioctl(s,acceptRouterAdverts ? SIOCAUTOCONF_START : SIOCAUTOCONF_STOP,&ifr)) { |
||||
close(s); |
||||
return false; |
||||
} |
||||
|
||||
close(s); |
||||
return true; |
||||
} |
||||
|
||||
// Create an OSX-native utun device (utun# where # is desiredNumber) |
||||
// Adapted from public domain utun example code by Jonathan Levin |
||||
static int _make_utun(int desiredNumber) |
||||
{ |
||||
struct sockaddr_ctl sc; |
||||
struct ctl_info ctlInfo; |
||||
struct ifreq ifr; |
||||
|
||||
memset(&ctlInfo, 0, sizeof(ctlInfo)); |
||||
if (strlcpy(ctlInfo.ctl_name, UTUN_CONTROL_NAME, sizeof(ctlInfo.ctl_name)) >= sizeof(ctlInfo.ctl_name)) { |
||||
return -1; |
||||
} |
||||
|
||||
int fd = socket(PF_SYSTEM, SOCK_DGRAM, SYSPROTO_CONTROL); |
||||
if (fd == -1) |
||||
return -1; |
||||
if (ioctl(fd, CTLIOCGINFO, &ctlInfo) == -1) { |
||||
close(fd); |
||||
return -1; |
||||
} |
||||
|
||||
sc.sc_id = ctlInfo.ctl_id; |
||||
sc.sc_len = sizeof(sc); |
||||
sc.sc_family = AF_SYSTEM; |
||||
sc.ss_sysaddr = AF_SYS_CONTROL; |
||||
sc.sc_unit = desiredNumber + 1; |
||||
|
||||
if (connect(fd, (struct sockaddr *)&sc, sizeof(sc)) == -1) { |
||||
close(fd); |
||||
return -1; |
||||
} |
||||
|
||||
memset(&ifr,0,sizeof(ifr)); |
||||
sprintf(ifr.ifr_name,"utun%d",desiredNumber); |
||||
if (ioctl(fd,SIOCGIFFLAGS,(void *)&ifr) < 0) { |
||||
printf("SIOCGIFFLAGS failed\n"); |
||||
} |
||||
ifr.ifr_flags &= ~IFF_POINTOPOINT; |
||||
if (ioctl(fd,SIOCSIFFLAGS,(void *)&ifr) < 0) { |
||||
printf("clear IFF_POINTOPOINT failed\n"); |
||||
} |
||||
|
||||
return fd; |
||||
} |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
static long globalTapsRunning = 0; |
||||
static Mutex globalTapCreateLock; |
||||
|
||||
OSXEthernetTap::OSXEthernetTap( |
||||
const char *homePath, |
||||
const MAC &mac, |
||||
unsigned int mtu, |
||||
unsigned int metric, |
||||
uint64_t nwid, |
||||
const char *friendlyName, |
||||
void (*handler)(void *,uint64_t,const MAC &,const MAC &,unsigned int,unsigned int,const void *data,unsigned int len), |
||||
void *arg) : |
||||
_handler(handler), |
||||
_arg(arg), |
||||
_arp((Arp *)0), |
||||
_nwid(nwid), |
||||
_homePath(homePath), |
||||
_mtu(mtu), |
||||
_metric(metric), |
||||
_fd(0), |
||||
_utun(false), |
||||
_enabled(true) |
||||
{ |
||||
char devpath[64],ethaddr[64],mtustr[32],metstr[32],nwids[32]; |
||||
struct stat stattmp; |
||||
|
||||
Utils::snprintf(nwids,sizeof(nwids),"%.16llx",nwid); |
||||
|
||||
if (mtu > 2800) |
||||
throw std::runtime_error("max tap MTU is 2800"); |
||||
|
||||
Mutex::Lock _gl(globalTapCreateLock); |
||||
|
||||
// Read remembered previous device name, if any -- we'll try to reuse |
||||
Dictionary devmap; |
||||
std::string desiredDevice; |
||||
{ |
||||
std::string devmapbuf; |
||||
if (OSUtils::readFile((_homePath + ZT_PATH_SEPARATOR_S + "devicemap").c_str(),devmapbuf)) { |
||||
devmap.fromString(devmapbuf); |
||||
desiredDevice = devmap.get(nwids,""); |
||||
} |
||||
} |
||||
|
||||
if (::stat((_homePath + ZT_PATH_SEPARATOR_S + "tap.kext").c_str(),&stattmp) == 0) { |
||||
// Try to init kext if it's there, otherwise revert to utun mode |
||||
|
||||
if (::stat("/dev/zt0",&stattmp)) { |
||||
long kextpid = (long)vfork(); |
||||
if (kextpid == 0) { |
||||
::chdir(homePath); |
||||
OSUtils::redirectUnixOutputs("/dev/null",(const char *)0); |
||||
::execl("/sbin/kextload","/sbin/kextload","-q","-repository",homePath,"tap.kext",(const char *)0); |
||||
::_exit(-1); |
||||
} else if (kextpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(kextpid,&exitcode,0); |
||||
} |
||||
::usleep(500); // give tap device driver time to start up and try again |
||||
if (::stat("/dev/zt0",&stattmp)) |
||||
_utun = true; |
||||
} |
||||
|
||||
if (!_utun) { |
||||
// See if we can re-use the last device we had. |
||||
bool recalledDevice = false; |
||||
if (desiredDevice.length() > 2) { |
||||
Utils::snprintf(devpath,sizeof(devpath),"/dev/%s",desiredDevice.c_str()); |
||||
if (stat(devpath,&stattmp) == 0) { |
||||
_fd = ::open(devpath,O_RDWR); |
||||
if (_fd > 0) { |
||||
_dev = desiredDevice; |
||||
recalledDevice = true; |
||||
} |
||||
} |
||||
} |
||||
|
||||
// Open the first unused tap device if we didn't recall a previous one. |
||||
if (!recalledDevice) { |
||||
for(int i=0;i<64;++i) { |
||||
Utils::snprintf(devpath,sizeof(devpath),"/dev/zt%d",i); |
||||
if (stat(devpath,&stattmp)) { |
||||
_utun = true; |
||||
break; |
||||
} |
||||
_fd = ::open(devpath,O_RDWR); |
||||
if (_fd > 0) { |
||||
char foo[16]; |
||||
Utils::snprintf(foo,sizeof(foo),"zt%d",i); |
||||
_dev = foo; |
||||
break; |
||||
} |
||||
} |
||||
} |
||||
if (_fd <= 0) |
||||
_utun = true; |
||||
} |
||||
} else { |
||||
_utun = true; |
||||
} |
||||
|
||||
if (_utun) { |
||||
// Use OSX built-in utun device if kext is not available or doesn't work |
||||
|
||||
int utunNo = 0; |
||||
|
||||
if ((desiredDevice.length() > 4)&&(desiredDevice.substr(0,4) == "utun")) { |
||||
utunNo = Utils::strToInt(desiredDevice.substr(4).c_str()); |
||||
if (utunNo >= 0) |
||||
_fd = _make_utun(utunNo); |
||||
} |
||||
|
||||
if (_fd <= 0) { |
||||
// Start at utun8 to leave lower utuns unused since other stuff might |
||||
// want them -- OpenVPN, cjdns, etc. I'm not sure if those are smart |
||||
// enough to scan upward like this. |
||||
for(utunNo=8;utunNo<=256;++utunNo) { |
||||
if ((_fd = _make_utun(utunNo)) > 0) |
||||
break; |
||||
} |
||||
} |
||||
|
||||
if (_fd <= 0) |
||||
throw std::runtime_error("unable to find/load ZeroTier tap driver OR use built-in utun driver in OSX; permission or system problem or too many open devices?"); |
||||
|
||||
Utils::snprintf(devpath,sizeof(devpath),"utun%d",utunNo); |
||||
_dev = devpath; |
||||
|
||||
// Configure address and bring it up |
||||
Utils::snprintf(mtustr,sizeof(mtustr),"%u",_mtu); |
||||
Utils::snprintf(metstr,sizeof(metstr),"%u",_metric); |
||||
long cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
::execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),"mtu",mtustr,"metric",metstr,"up",(const char *)0); |
||||
::_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(cpid,&exitcode,0); |
||||
if (exitcode) { |
||||
::close(_fd); |
||||
throw std::runtime_error("ifconfig failure activating utun interface"); |
||||
} |
||||
} |
||||
|
||||
} else { |
||||
// Use our ZeroTier OSX tun/tap driver for zt# Ethernet tap device |
||||
|
||||
if (fcntl(_fd,F_SETFL,fcntl(_fd,F_GETFL) & ~O_NONBLOCK) == -1) { |
||||
::close(_fd); |
||||
throw std::runtime_error("unable to set flags on file descriptor for TAP device"); |
||||
} |
||||
|
||||
// Configure MAC address and MTU, bring interface up |
||||
Utils::snprintf(ethaddr,sizeof(ethaddr),"%.2x:%.2x:%.2x:%.2x:%.2x:%.2x",(int)mac[0],(int)mac[1],(int)mac[2],(int)mac[3],(int)mac[4],(int)mac[5]); |
||||
Utils::snprintf(mtustr,sizeof(mtustr),"%u",_mtu); |
||||
Utils::snprintf(metstr,sizeof(metstr),"%u",_metric); |
||||
long cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
::execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),"lladdr",ethaddr,"mtu",mtustr,"metric",metstr,"up",(const char *)0); |
||||
::_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(cpid,&exitcode,0); |
||||
if (exitcode) { |
||||
::close(_fd); |
||||
throw std::runtime_error("ifconfig failure setting link-layer address and activating tap interface"); |
||||
} |
||||
} |
||||
|
||||
_setIpv6Stuff(_dev.c_str(),true,false); |
||||
} |
||||
|
||||
// Set close-on-exec so that devices cannot persist if we fork/exec for update |
||||
fcntl(_fd,F_SETFD,fcntl(_fd,F_GETFD) | FD_CLOEXEC); |
||||
|
||||
::pipe(_shutdownSignalPipe); |
||||
|
||||
++globalTapsRunning; |
||||
|
||||
devmap[nwids] = _dev; |
||||
OSUtils::writeFile((_homePath + ZT_PATH_SEPARATOR_S + "devicemap").c_str(),devmap.toString()); |
||||
|
||||
_thread = Thread::start(this); |
||||
} |
||||
|
||||
OSXEthernetTap::~OSXEthernetTap() |
||||
{ |
||||
Mutex::Lock _gl(globalTapCreateLock); |
||||
|
||||
::write(_shutdownSignalPipe[1],(const void *)this,1); // writing a byte causes thread to exit |
||||
Thread::join(_thread); |
||||
|
||||
::close(_fd); |
||||
::close(_shutdownSignalPipe[0]); |
||||
::close(_shutdownSignalPipe[1]); |
||||
|
||||
if (_utun) { |
||||
delete _arp; |
||||
} else { |
||||
if (--globalTapsRunning <= 0) { |
||||
globalTapsRunning = 0; // sanity check -- should not be possible |
||||
|
||||
char tmp[16384]; |
||||
sprintf(tmp,"%s/%s",_homePath.c_str(),"tap.kext"); |
||||
long kextpid = (long)vfork(); |
||||
if (kextpid == 0) { |
||||
OSUtils::redirectUnixOutputs("/dev/null",(const char *)0); |
||||
::execl("/sbin/kextunload","/sbin/kextunload",tmp,(const char *)0); |
||||
::_exit(-1); |
||||
} else if (kextpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(kextpid,&exitcode,0); |
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
void OSXEthernetTap::setEnabled(bool en) |
||||
{ |
||||
_enabled = en; |
||||
// TODO: interface status change |
||||
} |
||||
|
||||
bool OSXEthernetTap::enabled() const |
||||
{ |
||||
return _enabled; |
||||
} |
||||
|
||||
static bool ___removeIp(const std::string &_dev,const InetAddress &ip) |
||||
{ |
||||
long cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),"inet",ip.toIpString().c_str(),"-alias",(const char *)0); |
||||
_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
waitpid(cpid,&exitcode,0); |
||||
return (exitcode == 0); |
||||
} |
||||
return false; // never reached, make compiler shut up about return value |
||||
} |
||||
|
||||
bool OSXEthernetTap::addIp(const InetAddress &ip) |
||||
{ |
||||
if (!ip) |
||||
return false; |
||||
|
||||
std::vector<InetAddress> allIps(ips()); |
||||
if (std::binary_search(allIps.begin(),allIps.end(),ip)) |
||||
return true; |
||||
|
||||
// Remove and reconfigure if address is the same but netmask is different |
||||
for(std::vector<InetAddress>::iterator i(allIps.begin());i!=allIps.end();++i) { |
||||
if ((i->ipsEqual(ip))&&(i->netmaskBits() != ip.netmaskBits())) { |
||||
if (___removeIp(_dev,*i)) |
||||
break; |
||||
} |
||||
} |
||||
|
||||
if (_utun) { |
||||
long cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
if (ip.ss_family == AF_INET6) { |
||||
::execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),"inet6",ip.toString().c_str(),"alias",(const char *)0); |
||||
} else { |
||||
::execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),ip.toString().c_str(),ip.toIpString().c_str(),"alias",(const char *)0); |
||||
} |
||||
::_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(cpid,&exitcode,0); |
||||
|
||||
if (exitcode == 0) { |
||||
if (ip.ss_family == AF_INET) { |
||||
// Add route to network over tun for IPv4 -- otherwise it behaves |
||||
// as a simple point to point tunnel instead of a true route. |
||||
cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
::close(STDERR_FILENO); |
||||
::close(STDOUT_FILENO); |
||||
::execl("/sbin/route","/sbin/route","add",ip.network().toString().c_str(),ip.toIpString().c_str(),(const char *)0); |
||||
::exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(cpid,&exitcode,0); |
||||
return (exitcode == 0); |
||||
} |
||||
} else return true; |
||||
} |
||||
} |
||||
} else { |
||||
long cpid = (long)vfork(); |
||||
if (cpid == 0) { |
||||
::execl("/sbin/ifconfig","/sbin/ifconfig",_dev.c_str(),ip.isV4() ? "inet" : "inet6",ip.toString().c_str(),"alias",(const char *)0); |
||||
::_exit(-1); |
||||
} else if (cpid > 0) { |
||||
int exitcode = -1; |
||||
::waitpid(cpid,&exitcode,0); |
||||
return (exitcode == 0); |
||||
} |
||||
} |
||||
|
||||
return false; |
||||
} |
||||
|
||||
bool OSXEthernetTap::removeIp(const InetAddress &ip) |
||||
{ |
||||
if (!ip) |
||||
return true; |
||||
std::vector<InetAddress> allIps(ips()); |
||||
if (!std::binary_search(allIps.begin(),allIps.end(),ip)) { |
||||
if (___removeIp(_dev,ip)) |
||||
return true; |
||||
} |
||||
return false; |
||||
} |
||||
|
||||
std::vector<InetAddress> OSXEthernetTap::ips() const |
||||
{ |
||||
struct ifaddrs *ifa = (struct ifaddrs *)0; |
||||
if (getifaddrs(&ifa)) |
||||
return std::vector<InetAddress>(); |
||||
|
||||
std::vector<InetAddress> r; |
||||
|
||||
struct ifaddrs *p = ifa; |
||||
while (p) { |
||||
if ((!strcmp(p->ifa_name,_dev.c_str()))&&(p->ifa_addr)&&(p->ifa_netmask)&&(p->ifa_addr->sa_family == p->ifa_netmask->sa_family)) { |
||||
switch(p->ifa_addr->sa_family) { |
||||
case AF_INET: { |
||||
struct sockaddr_in *sin = (struct sockaddr_in *)p->ifa_addr; |
||||
struct sockaddr_in *nm = (struct sockaddr_in *)p->ifa_netmask; |
||||
r.push_back(InetAddress(&(sin->sin_addr.s_addr),4,Utils::countBits((uint32_t)nm->sin_addr.s_addr))); |
||||
} break; |
||||
case AF_INET6: { |
||||
struct sockaddr_in6 *sin = (struct sockaddr_in6 *)p->ifa_addr; |
||||
struct sockaddr_in6 *nm = (struct sockaddr_in6 *)p->ifa_netmask; |
||||
uint32_t b[4]; |
||||
memcpy(b,nm->sin6_addr.s6_addr,sizeof(b)); |
||||
r.push_back(InetAddress(sin->sin6_addr.s6_addr,16,Utils::countBits(b[0]) + Utils::countBits(b[1]) + Utils::countBits(b[2]) + Utils::countBits(b[3]))); |
||||
} break; |
||||
} |
||||
} |
||||
p = p->ifa_next; |
||||
} |
||||
|
||||
if (ifa) |
||||
freeifaddrs(ifa); |
||||
|
||||
std::sort(r.begin(),r.end()); |
||||
std::unique(r.begin(),r.end()); |
||||
|
||||
return r; |
||||
} |
||||
|
||||
void OSXEthernetTap::put(const MAC &from,const MAC &to,unsigned int etherType,const void *data,unsigned int len) |
||||
{ |
||||
char putBuf[4096]; |
||||
if ((_fd > 0)&&(len <= _mtu)&&(_enabled)) { |
||||
to.copyTo(putBuf,6); |
||||
from.copyTo(putBuf + 6,6); |
||||
*((uint16_t *)(putBuf + 12)) = htons((uint16_t)etherType); |
||||
memcpy(putBuf + 14,data,len); |
||||
len += 14; |
||||
::write(_fd,putBuf,len); |
||||
} |
||||
} |
||||
|
||||
std::string OSXEthernetTap::deviceName() const |
||||
{ |
||||
return _dev; |
||||
} |
||||
|
||||
void OSXEthernetTap::setFriendlyName(const char *friendlyName) |
||||
{ |
||||
} |
||||
|
||||
void OSXEthernetTap::scanMulticastGroups(std::vector<MulticastGroup> &added,std::vector<MulticastGroup> &removed) |
||||
{ |
||||
std::vector<MulticastGroup> newGroups; |
||||
|
||||
struct _intl_ifmaddrs *ifmap = (struct _intl_ifmaddrs *)0; |
||||
if (!_intl_getifmaddrs(&ifmap)) { |
||||
struct _intl_ifmaddrs *p = ifmap; |
||||
while (p) { |
||||
if (p->ifma_addr->sa_family == AF_LINK) { |
||||
struct sockaddr_dl *in = (struct sockaddr_dl *)p->ifma_name; |
||||
struct sockaddr_dl *la = (struct sockaddr_dl *)p->ifma_addr; |
||||
if ((la->sdl_alen == 6)&&(in->sdl_nlen <= _dev.length())&&(!memcmp(_dev.data(),in->sdl_data,in->sdl_nlen))) |
||||
newGroups.push_back(MulticastGroup(MAC(la->sdl_data + la->sdl_nlen,6),0)); |
||||
} |
||||
p = p->ifma_next; |
||||
} |
||||
_intl_freeifmaddrs(ifmap); |
||||
} |
||||
|
||||
std::vector<InetAddress> allIps(ips()); |
||||
for(std::vector<InetAddress>::iterator ip(allIps.begin());ip!=allIps.end();++ip) |
||||
newGroups.push_back(MulticastGroup::deriveMulticastGroupForAddressResolution(*ip)); |
||||
|
||||
std::sort(newGroups.begin(),newGroups.end()); |
||||
std::unique(newGroups.begin(),newGroups.end()); |
||||
|
||||
for(std::vector<MulticastGroup>::iterator m(newGroups.begin());m!=newGroups.end();++m) { |
||||
if (!std::binary_search(_multicastGroups.begin(),_multicastGroups.end(),*m)) |
||||
added.push_back(*m); |
||||
} |
||||
for(std::vector<MulticastGroup>::iterator m(_multicastGroups.begin());m!=_multicastGroups.end();++m) { |
||||
if (!std::binary_search(newGroups.begin(),newGroups.end(),*m)) |
||||
removed.push_back(*m); |
||||
} |
||||
|
||||
_multicastGroups.swap(newGroups); |
||||
} |
||||
|
||||
void OSXEthernetTap::threadMain() |
||||
throw() |
||||
{ |
||||
fd_set readfds,nullfds; |
||||
MAC to,from; |
||||
int n,nfds,r; |
||||
char getBuf[8194]; |
||||
|
||||
Thread::sleep(500); |
||||
|
||||
FD_ZERO(&readfds); |
||||
FD_ZERO(&nullfds); |
||||
nfds = (int)std::max(_shutdownSignalPipe[0],_fd) + 1; |
||||
|
||||
r = 0; |
||||
for(;;) { |
||||
FD_SET(_shutdownSignalPipe[0],&readfds); |
||||
FD_SET(_fd,&readfds); |
||||
select(nfds,&readfds,&nullfds,&nullfds,(struct timeval *)0); |
||||
|
||||
if (FD_ISSET(_shutdownSignalPipe[0],&readfds)) // writes to shutdown pipe terminate thread |
||||
break; |
||||
|
||||
if (FD_ISSET(_fd,&readfds)) { |
||||
n = (int)::read(_fd,getBuf + r,sizeof(getBuf) - r); |
||||
if (n < 0) { |
||||
if ((errno != EINTR)&&(errno != ETIMEDOUT)) |
||||
break; |
||||
} else { |
||||
// Some tap drivers like to send the ethernet frame and the |
||||
// payload in two chunks, so handle that by accumulating |
||||
// data until we have at least a frame. |
||||
r += n; |
||||
if (r > 14) { |
||||
if (r > ((int)_mtu + 14)) // sanity check for weird TAP behavior on some platforms |
||||
r = _mtu + 14; |
||||
|
||||
if (_enabled) { |
||||
to.setTo(getBuf,6); |
||||
from.setTo(getBuf + 6,6); |
||||
unsigned int etherType = ntohs(((const uint16_t *)getBuf)[6]); |
||||
// TODO: VLAN support |
||||
_handler(_arg,_nwid,from,to,etherType,0,(const void *)(getBuf + 14),r - 14); |
||||
} |
||||
|
||||
r = 0; |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
} // namespace ZeroTier |
||||
@ -1,95 +0,0 @@
|
||||
/*
|
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2018 ZeroTier, Inc. https://www.zerotier.com/
|
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
* |
||||
* -- |
||||
* |
||||
* You can be released from the requirements of the license by purchasing |
||||
* a commercial license. Buying such a license is mandatory as soon as you |
||||
* develop commercial closed-source software that incorporates or links |
||||
* directly against ZeroTier software without disclosing the source code |
||||
* of your own application. |
||||
*/ |
||||
|
||||
#ifndef ZT_OSXETHERNETTAP_HPP |
||||
#define ZT_OSXETHERNETTAP_HPP |
||||
|
||||
#include <stdio.h> |
||||
#include <stdlib.h> |
||||
|
||||
#include <stdexcept> |
||||
#include <string> |
||||
#include <vector> |
||||
|
||||
#include "../node/Constants.hpp" |
||||
#include "../node/MAC.hpp" |
||||
#include "../node/InetAddress.hpp" |
||||
#include "../node/MulticastGroup.hpp" |
||||
|
||||
#include "Thread.hpp" |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
/**
|
||||
* OSX Ethernet tap using ZeroTier kernel extension zt# devices |
||||
*/ |
||||
class OSXEthernetTap |
||||
{ |
||||
public: |
||||
OSXEthernetTap( |
||||
const char *homePath, |
||||
const MAC &mac, |
||||
unsigned int mtu, |
||||
unsigned int metric, |
||||
uint64_t nwid, |
||||
const char *friendlyName, |
||||
void (*handler)(void *,void *,uint64_t,const MAC &,const MAC &,unsigned int,unsigned int,const void *,unsigned int), |
||||
void *arg); |
||||
|
||||
~OSXEthernetTap(); |
||||
|
||||
void setEnabled(bool en); |
||||
bool enabled() const; |
||||
bool addIp(const InetAddress &ip); |
||||
bool removeIp(const InetAddress &ip); |
||||
std::vector<InetAddress> ips() const; |
||||
void put(const MAC &from,const MAC &to,unsigned int etherType,const void *data,unsigned int len); |
||||
std::string deviceName() const; |
||||
void setFriendlyName(const char *friendlyName); |
||||
void scanMulticastGroups(std::vector<MulticastGroup> &added,std::vector<MulticastGroup> &removed); |
||||
void setMtu(unsigned int mtu); |
||||
|
||||
void threadMain() |
||||
throw(); |
||||
|
||||
private: |
||||
void (*_handler)(void *,void *,uint64_t,const MAC &,const MAC &,unsigned int,unsigned int,const void *,unsigned int); |
||||
void *_arg; |
||||
uint64_t _nwid; |
||||
Thread _thread; |
||||
std::string _homePath; |
||||
std::string _dev; |
||||
std::vector<MulticastGroup> _multicastGroups; |
||||
unsigned int _mtu; |
||||
unsigned int _metric; |
||||
int _fd; |
||||
int _shutdownSignalPipe[2]; |
||||
volatile bool _enabled; |
||||
}; |
||||
|
||||
} // namespace ZeroTier
|
||||
|
||||
#endif |
||||
@ -1,96 +0,0 @@
|
||||
/* |
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2015 ZeroTier, Inc. |
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
||||
* |
||||
* -- |
||||
* |
||||
* ZeroTier may be used and distributed under the terms of the GPLv3, which |
||||
* are available at: http://www.gnu.org/licenses/gpl-3.0.html |
||||
* |
||||
* If you would like to embed ZeroTier into a commercial application or |
||||
* redistribute it in a modified binary form, please contact ZeroTier Networks |
||||
* LLC. Start here: http://www.zerotier.com/ |
||||
*/ |
||||
|
||||
#ifndef ZT_OSXETHERNETTAP_HPP |
||||
#define ZT_OSXETHERNETTAP_HPP |
||||
|
||||
#include <stdio.h> |
||||
#include <stdlib.h> |
||||
|
||||
#include <stdexcept> |
||||
#include <string> |
||||
#include <vector> |
||||
|
||||
#include "../node/Constants.hpp" |
||||
#include "../node/MAC.hpp" |
||||
#include "../node/InetAddress.hpp" |
||||
#include "../node/MulticastGroup.hpp" |
||||
|
||||
#include "Thread.hpp" |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
/** |
||||
* OSX Ethernet tap using ZeroTier kernel extension zt# devices |
||||
*/ |
||||
class OSXEthernetTap |
||||
{ |
||||
public: |
||||
OSXEthernetTap( |
||||
const char *homePath, |
||||
const MAC &mac, |
||||
unsigned int mtu, |
||||
unsigned int metric, |
||||
uint64_t nwid, |
||||
const char *friendlyName, |
||||
void (*handler)(void *,uint64_t,const MAC &,const MAC &,unsigned int,unsigned int,const void *,unsigned int), |
||||
void *arg); |
||||
|
||||
~OSXEthernetTap(); |
||||
|
||||
inline void setEnabled(bool en) { _enabled = en; } |
||||
inline bool enabled() const { return _enabled; } |
||||
bool addIp(const InetAddress &ip); |
||||
bool removeIp(const InetAddress &ip); |
||||
std::vector<InetAddress> ips() const; |
||||
void put(const MAC &from,const MAC &to,unsigned int etherType,const void *data,unsigned int len); |
||||
std::string deviceName() const; |
||||
void setFriendlyName(const char *friendlyName); |
||||
void scanMulticastGroups(std::vector<MulticastGroup> &added,std::vector<MulticastGroup> &removed); |
||||
|
||||
void threadMain() |
||||
throw(); |
||||
|
||||
// Private members of OSXEthernetTap have public visibility to be accessable |
||||
// from an internal bounce function; don't modify directly. |
||||
void (*_handler)(void *,uint64_t,const MAC &,const MAC &,unsigned int,unsigned int,const void *,unsigned int); |
||||
void *_arg; |
||||
void *_pcap; // pcap_t * |
||||
uint64_t _nwid; |
||||
MAC _mac; |
||||
Thread _thread; |
||||
std::string _homePath; |
||||
std::string _dev; |
||||
std::vector<MulticastGroup> _multicastGroups; |
||||
unsigned int _mtu; |
||||
unsigned int _metric; |
||||
volatile bool _enabled; |
||||
}; |
||||
|
||||
} // namespace ZeroTier |
||||
|
||||
#endif |
||||
@ -1,101 +0,0 @@
|
||||
/* |
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2015 ZeroTier, Inc. |
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
||||
* |
||||
* -- |
||||
* |
||||
* ZeroTier may be used and distributed under the terms of the GPLv3, which |
||||
* are available at: http://www.gnu.org/licenses/gpl-3.0.html |
||||
* |
||||
* If you would like to embed ZeroTier into a commercial application or |
||||
* redistribute it in a modified binary form, please contact ZeroTier Networks |
||||
* LLC. Start here: http://www.zerotier.com/ |
||||
*/ |
||||
|
||||
#ifndef ZT_OSXETHERNETTAP_HPP |
||||
#define ZT_OSXETHERNETTAP_HPP |
||||
|
||||
#include <stdio.h> |
||||
#include <stdlib.h> |
||||
|
||||
#include <stdexcept> |
||||
#include <string> |
||||
#include <vector> |
||||
|
||||
#include "../node/Constants.hpp" |
||||
#include "../node/MAC.hpp" |
||||
#include "../node/InetAddress.hpp" |
||||
#include "../node/MulticastGroup.hpp" |
||||
|
||||
#include "Thread.hpp" |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
class Arp; |
||||
|
||||
/** |
||||
* OSX Ethernet tap supporting either ZeroTier tun/tap kext or OSX-native utun |
||||
*/ |
||||
class OSXEthernetTap |
||||
{ |
||||
public: |
||||
OSXEthernetTap( |
||||
const char *homePath, |
||||
const MAC &mac, |
||||
unsigned int mtu, |
||||
unsigned int metric, |
||||
uint64_t nwid, |
||||
const char *friendlyName, |
||||
void (*handler)(void *,uint64_t,const MAC &,const MAC &,unsigned int,unsigned int,const void *,unsigned int), |
||||
void *arg); |
||||
|
||||
~OSXEthernetTap(); |
||||
|
||||
void setEnabled(bool en); |
||||
bool enabled() const; |
||||
bool addIp(const InetAddress &ip); |
||||
bool removeIp(const InetAddress &ip); |
||||
std::vector<InetAddress> ips() const; |
||||
void put(const MAC &from,const MAC &to,unsigned int etherType,const void *data,unsigned int len); |
||||
std::string deviceName() const; |
||||
void setFriendlyName(const char *friendlyName); |
||||
void scanMulticastGroups(std::vector<MulticastGroup> &added,std::vector<MulticastGroup> &removed); |
||||
|
||||
inline bool isNativeUtun() const { return _utun; } |
||||
|
||||
void threadMain() |
||||
throw(); |
||||
|
||||
private: |
||||
void (*_handler)(void *,uint64_t,const MAC &,const MAC &,unsigned int,unsigned int,const void *,unsigned int); |
||||
void *_arg; |
||||
Arp *_arp; // created and used if utun is enabled |
||||
uint64_t _nwid; |
||||
Thread _thread; |
||||
std::string _homePath; |
||||
std::string _dev; |
||||
std::vector<MulticastGroup> _multicastGroups; |
||||
unsigned int _mtu; |
||||
unsigned int _metric; |
||||
int _fd; |
||||
int _shutdownSignalPipe[2]; |
||||
bool _utun; |
||||
volatile bool _enabled; |
||||
}; |
||||
|
||||
} // namespace ZeroTier |
||||
|
||||
#endif |
||||
@ -1,4 +0,0 @@
|
||||
Retired Code and Miscellaneous Junk |
||||
====== |
||||
|
||||
This directory is for old code that isn't used but we don't want to lose track of, and for anything else random like debug scripts. |
||||
@ -1,497 +0,0 @@
|
||||
/*
|
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2018 ZeroTier, Inc. |
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
//#define ZT_CONTROLLER_USE_RETHINKDB
|
||||
|
||||
#ifdef ZT_CONTROLLER_USE_RETHINKDB |
||||
|
||||
#include <stdio.h> |
||||
#include <stdlib.h> |
||||
#include <unistd.h> |
||||
#include <time.h> |
||||
|
||||
#include "RethinkDB.hpp" |
||||
#include "EmbeddedNetworkController.hpp" |
||||
|
||||
#include "../version.h" |
||||
|
||||
#include <chrono> |
||||
#include <algorithm> |
||||
#include <stdexcept> |
||||
|
||||
#include "../ext/librethinkdbxx/build/include/rethinkdb.h" |
||||
|
||||
namespace R = RethinkDB; |
||||
using json = nlohmann::json; |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
static const char *_timestr() |
||||
{ |
||||
time_t t = time(0); |
||||
char *ts = ctime(&t); |
||||
char *p = ts; |
||||
if (!p) |
||||
return ""; |
||||
while (*p) { |
||||
if (*p == '\n') { |
||||
*p = (char)0; |
||||
break; |
||||
} |
||||
++p; |
||||
} |
||||
return ts; |
||||
} |
||||
|
||||
RethinkDB::RethinkDB(EmbeddedNetworkController *const nc,const Identity &myId,const char *path) : |
||||
DB(nc,myId,path), |
||||
_ready(2), // two tables need to be synchronized before we're ready, so this is ready when it reaches 0
|
||||
_run(1), |
||||
_waitNoticePrinted(false) |
||||
{ |
||||
// rethinkdb:host:port:db[:auth]
|
||||
std::vector<std::string> ps(OSUtils::split(path,":","","")); |
||||
if ((ps.size() < 4)||(ps[0] != "rethinkdb")) |
||||
throw std::runtime_error("invalid rethinkdb database url"); |
||||
_host = ps[1]; |
||||
_port = Utils::strToInt(ps[2].c_str()); |
||||
_db = ps[3]; |
||||
if (ps.size() > 4) |
||||
_auth = ps[4]; |
||||
|
||||
_readyLock.lock(); |
||||
|
||||
_membersDbWatcher = std::thread([this]() { |
||||
try { |
||||
while (_run == 1) { |
||||
try { |
||||
std::unique_ptr<R::Connection> rdb(R::connect(this->_host,this->_port,this->_auth)); |
||||
if (rdb) { |
||||
_membersDbWatcherConnection = (void *)rdb.get(); |
||||
auto cur = R::db(this->_db).table("Member",R::optargs("read_mode","outdated")).get_all(this->_myAddressStr,R::optargs("index","controllerId")).changes(R::optargs("squash",0.05,"include_initial",true,"include_types",true,"include_states",true)).run(*rdb); |
||||
while (cur.has_next()) { |
||||
if (_run != 1) break; |
||||
json tmp(json::parse(cur.next().as_json())); |
||||
if ((tmp["type"] == "state")&&(tmp["state"] == "ready")) { |
||||
if (++this->_ready == 2) { |
||||
if (_waitNoticePrinted) |
||||
fprintf(stderr,"[%s] NOTICE: %.10llx controller RethinkDB data download complete." ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt()); |
||||
this->_readyLock.unlock(); |
||||
} |
||||
} else { |
||||
try { |
||||
json &ov = tmp["old_val"]; |
||||
json &nv = tmp["new_val"]; |
||||
json oldConfig,newConfig; |
||||
if (ov.is_object()) oldConfig = ov["config"]; |
||||
if (nv.is_object()) newConfig = nv["config"]; |
||||
if (oldConfig.is_object()||newConfig.is_object()) |
||||
this->_memberChanged(oldConfig,newConfig,(this->_ready <= 0)); |
||||
} catch ( ... ) {} // ignore bad records
|
||||
} |
||||
} |
||||
} |
||||
} catch (std::exception &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (member change stream): %s" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.what()); |
||||
} catch (R::Error &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (member change stream): %s" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.message.c_str()); |
||||
} catch ( ... ) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (member change stream): unknown exception" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt()); |
||||
} |
||||
std::this_thread::sleep_for(std::chrono::milliseconds(250)); |
||||
} |
||||
} catch ( ... ) {} |
||||
}); |
||||
|
||||
_networksDbWatcher = std::thread([this]() { |
||||
try { |
||||
while (_run == 1) { |
||||
try { |
||||
std::unique_ptr<R::Connection> rdb(R::connect(this->_host,this->_port,this->_auth)); |
||||
if (rdb) { |
||||
_networksDbWatcherConnection = (void *)rdb.get(); |
||||
auto cur = R::db(this->_db).table("Network",R::optargs("read_mode","outdated")).get_all(this->_myAddressStr,R::optargs("index","controllerId")).changes(R::optargs("squash",0.05,"include_initial",true,"include_types",true,"include_states",true)).run(*rdb); |
||||
while (cur.has_next()) { |
||||
if (_run != 1) break; |
||||
json tmp(json::parse(cur.next().as_json())); |
||||
if ((tmp["type"] == "state")&&(tmp["state"] == "ready")) { |
||||
if (--this->_ready == 0) { |
||||
if (_waitNoticePrinted) |
||||
fprintf(stderr,"[%s] NOTICE: %.10llx controller RethinkDB data download complete." ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt()); |
||||
this->_readyLock.unlock(); |
||||
} |
||||
} else { |
||||
try { |
||||
json &ov = tmp["old_val"]; |
||||
json &nv = tmp["new_val"]; |
||||
json oldConfig,newConfig; |
||||
if (ov.is_object()) oldConfig = ov["config"]; |
||||
if (nv.is_object()) newConfig = nv["config"]; |
||||
if (oldConfig.is_object()||newConfig.is_object()) |
||||
this->_networkChanged(oldConfig,newConfig,(this->_ready <= 0)); |
||||
} catch ( ... ) {} // ignore bad records
|
||||
} |
||||
} |
||||
} |
||||
} catch (std::exception &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (network change stream): %s" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.what()); |
||||
} catch (R::Error &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (network change stream): %s" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.message.c_str()); |
||||
} catch ( ... ) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (network change stream): unknown exception" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt()); |
||||
} |
||||
std::this_thread::sleep_for(std::chrono::milliseconds(250)); |
||||
} |
||||
} catch ( ... ) {} |
||||
}); |
||||
|
||||
for(int t=0;t<ZT_CONTROLLER_RETHINKDB_COMMIT_THREADS;++t) { |
||||
_commitThread[t] = std::thread([this]() { |
||||
try { |
||||
std::unique_ptr<R::Connection> rdb; |
||||
nlohmann::json *config = (nlohmann::json *)0; |
||||
while ((this->_commitQueue.get(config))&&(_run == 1)) { |
||||
if (!config) |
||||
continue; |
||||
nlohmann::json record; |
||||
const char *table = (const char *)0; |
||||
std::string deleteId; |
||||
try { |
||||
const std::string objtype = (*config)["objtype"]; |
||||
if (objtype == "member") { |
||||
const std::string nwid = (*config)["nwid"]; |
||||
const std::string id = (*config)["id"]; |
||||
record["id"] = nwid + "-" + id; |
||||
record["controllerId"] = this->_myAddressStr; |
||||
record["networkId"] = nwid; |
||||
record["nodeId"] = id; |
||||
record["config"] = *config; |
||||
table = "Member"; |
||||
} else if (objtype == "network") { |
||||
const std::string id = (*config)["id"]; |
||||
record["id"] = id; |
||||
record["controllerId"] = this->_myAddressStr; |
||||
record["config"] = *config; |
||||
table = "Network"; |
||||
} else if (objtype == "trace") { |
||||
record = *config; |
||||
table = "RemoteTrace"; |
||||
} else if (objtype == "_delete_network") { |
||||
deleteId = (*config)["id"]; |
||||
table = "Network"; |
||||
} else if (objtype == "_delete_member") { |
||||
deleteId = (*config)["nwid"]; |
||||
deleteId.push_back('-'); |
||||
const std::string tmp = (*config)["id"]; |
||||
deleteId.append(tmp); |
||||
table = "Member"; |
||||
} |
||||
} catch (std::exception &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (insert/update record creation): %s" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.what()); |
||||
table = (const char *)0; |
||||
} catch (R::Error &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (insert/update record creation): %s" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.message.c_str()); |
||||
table = (const char *)0; |
||||
} catch ( ... ) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (insert/update record creation): unknown exception" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt()); |
||||
table = (const char *)0; |
||||
} |
||||
delete config; |
||||
if (!table) |
||||
continue; |
||||
const std::string jdump(OSUtils::jsonDump(record,-1)); |
||||
|
||||
while (_run == 1) { |
||||
try { |
||||
if (!rdb) |
||||
rdb = R::connect(this->_host,this->_port,this->_auth); |
||||
if (rdb) { |
||||
if (deleteId.length() > 0) { |
||||
//printf("DELETE: %s" ZT_EOL_S,deleteId.c_str());
|
||||
R::db(this->_db).table(table).get(deleteId).delete_().run(*rdb); |
||||
} else { |
||||
//printf("UPSERT: %s" ZT_EOL_S,record.dump().c_str());
|
||||
R::db(this->_db).table(table).insert(R::Datum::from_json(jdump),R::optargs("conflict","update","return_changes",false)).run(*rdb); |
||||
} |
||||
break; |
||||
} else { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (insert/update): connect failed (will retry)" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt()); |
||||
rdb.reset(); |
||||
} |
||||
} catch (std::exception &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (insert/update): %s [%s]" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.what(),jdump.c_str()); |
||||
rdb.reset(); |
||||
} catch (R::Error &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (insert/update): %s [%s]" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.message.c_str(),jdump.c_str()); |
||||
rdb.reset(); |
||||
} catch ( ... ) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (insert/update): unknown exception [%s]" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),jdump.c_str()); |
||||
rdb.reset(); |
||||
} |
||||
std::this_thread::sleep_for(std::chrono::milliseconds(250)); |
||||
} |
||||
} |
||||
} catch (std::exception &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (insert/update outer loop): %s" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.what()); |
||||
} catch (R::Error &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (insert/update outer loop): %s" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.message.c_str()); |
||||
} catch ( ... ) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (insert/update outer loop): unknown exception" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt()); |
||||
} |
||||
}); |
||||
} |
||||
|
||||
_onlineNotificationThread = std::thread([this]() { |
||||
int64_t lastUpdatedNetworkStatus = 0; |
||||
std::unordered_map< std::pair<uint64_t,uint64_t>,int64_t,_PairHasher > lastOnlineCumulative; |
||||
try { |
||||
std::unique_ptr<R::Connection> rdb; |
||||
while (_run == 1) { |
||||
try { |
||||
if (!rdb) { |
||||
_connected = 0; |
||||
rdb = R::connect(this->_host,this->_port,this->_auth); |
||||
} |
||||
|
||||
if (rdb) { |
||||
_connected = 1; |
||||
R::Array batch; |
||||
R::Object tmpobj; |
||||
|
||||
std::unordered_map< std::pair<uint64_t,uint64_t>,std::pair<int64_t,InetAddress>,_PairHasher > lastOnline; |
||||
{ |
||||
std::lock_guard<std::mutex> l(_lastOnline_l); |
||||
lastOnline.swap(_lastOnline); |
||||
} |
||||
|
||||
for(auto i=lastOnline.begin();i!=lastOnline.end();++i) { |
||||
lastOnlineCumulative[i->first] = i->second.first; |
||||
char tmp[64],tmp2[64]; |
||||
OSUtils::ztsnprintf(tmp,sizeof(tmp),"%.16llx-%.10llx",i->first.first,i->first.second); |
||||
tmpobj["id"] = tmp; |
||||
tmpobj["ts"] = i->second.first; |
||||
tmpobj["phy"] = i->second.second.toIpString(tmp2); |
||||
batch.emplace_back(tmpobj); |
||||
if (batch.size() >= 1024) { |
||||
R::db(this->_db).table("MemberStatus",R::optargs("read_mode","outdated")).insert(batch,R::optargs("conflict","update")).run(*rdb); |
||||
batch.clear(); |
||||
} |
||||
} |
||||
if (batch.size() > 0) { |
||||
R::db(this->_db).table("MemberStatus",R::optargs("read_mode","outdated")).insert(batch,R::optargs("conflict","update")).run(*rdb); |
||||
batch.clear(); |
||||
} |
||||
tmpobj.clear(); |
||||
|
||||
const int64_t now = OSUtils::now(); |
||||
if ((now - lastUpdatedNetworkStatus) > 10000) { |
||||
lastUpdatedNetworkStatus = now; |
||||
|
||||
std::vector< std::pair< uint64_t,std::shared_ptr<_Network> > > networks; |
||||
{ |
||||
std::lock_guard<std::mutex> l(_networks_l); |
||||
networks.reserve(_networks.size() + 1); |
||||
for(auto i=_networks.begin();i!=_networks.end();++i) |
||||
networks.push_back(*i); |
||||
} |
||||
|
||||
for(auto i=networks.begin();i!=networks.end();++i) { |
||||
char tmp[64]; |
||||
Utils::hex(i->first,tmp); |
||||
tmpobj["id"] = tmp; |
||||
{ |
||||
std::lock_guard<std::mutex> l2(i->second->lock); |
||||
tmpobj["authorizedMemberCount"] = i->second->authorizedMembers.size(); |
||||
tmpobj["totalMemberCount"] = i->second->members.size(); |
||||
unsigned long onlineMemberCount = 0; |
||||
for(auto m=i->second->members.begin();m!=i->second->members.end();++m) { |
||||
auto lo = lastOnlineCumulative.find(std::pair<uint64_t,uint64_t>(i->first,m->first)); |
||||
if (lo != lastOnlineCumulative.end()) { |
||||
if ((now - lo->second) <= (ZT_NETWORK_AUTOCONF_DELAY * 2)) |
||||
++onlineMemberCount; |
||||
else lastOnlineCumulative.erase(lo); |
||||
} |
||||
} |
||||
tmpobj["onlineMemberCount"] = onlineMemberCount; |
||||
tmpobj["bridgeCount"] = i->second->activeBridgeMembers.size(); |
||||
tmpobj["ts"] = now; |
||||
} |
||||
batch.emplace_back(tmpobj); |
||||
if (batch.size() >= 1024) { |
||||
R::db(this->_db).table("NetworkStatus",R::optargs("read_mode","outdated")).insert(batch,R::optargs("conflict","update")).run(*rdb); |
||||
batch.clear(); |
||||
} |
||||
} |
||||
if (batch.size() > 0) { |
||||
R::db(this->_db).table("NetworkStatus",R::optargs("read_mode","outdated")).insert(batch,R::optargs("conflict","update")).run(*rdb); |
||||
batch.clear(); |
||||
} |
||||
} |
||||
} |
||||
} catch (std::exception &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (node status update): %s" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.what()); |
||||
rdb.reset(); |
||||
} catch (R::Error &e) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (node status update): %s" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt(),e.message.c_str()); |
||||
rdb.reset(); |
||||
} catch ( ... ) { |
||||
fprintf(stderr,"[%s] ERROR: %.10llx controller RethinkDB (node status update): unknown exception" ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt()); |
||||
rdb.reset(); |
||||
} |
||||
std::this_thread::sleep_for(std::chrono::milliseconds(250)); |
||||
} |
||||
} catch ( ... ) {} |
||||
}); |
||||
|
||||
_heartbeatThread = std::thread([this]() { |
||||
try { |
||||
R::Object controllerRecord; |
||||
std::unique_ptr<R::Connection> rdb; |
||||
|
||||
{ |
||||
char publicId[1024]; |
||||
//char secretId[1024];
|
||||
char hostname[1024]; |
||||
this->_myId.toString(false,publicId); |
||||
//this->_myId.toString(true,secretId);
|
||||
if (gethostname(hostname,sizeof(hostname)) != 0) { |
||||
hostname[0] = (char)0; |
||||
} else { |
||||
for(int i=0;i<sizeof(hostname);++i) { |
||||
if ((hostname[i] == '.')||(hostname[i] == 0)) { |
||||
hostname[i] = (char)0; |
||||
break; |
||||
} |
||||
} |
||||
} |
||||
controllerRecord["id"] = this->_myAddressStr.c_str(); |
||||
controllerRecord["publicIdentity"] = publicId; |
||||
//controllerRecord["secretIdentity"] = secretId;
|
||||
if (hostname[0]) |
||||
controllerRecord["clusterHost"] = hostname; |
||||
controllerRecord["vMajor"] = ZEROTIER_ONE_VERSION_MAJOR; |
||||
controllerRecord["vMinor"] = ZEROTIER_ONE_VERSION_MINOR; |
||||
controllerRecord["vRev"] = ZEROTIER_ONE_VERSION_REVISION; |
||||
controllerRecord["vBuild"] = ZEROTIER_ONE_VERSION_BUILD; |
||||
} |
||||
|
||||
while (_run == 1) { |
||||
try { |
||||
if (!rdb) |
||||
rdb = R::connect(this->_host,this->_port,this->_auth); |
||||
if (rdb) { |
||||
controllerRecord["lastAlive"] = OSUtils::now(); |
||||
//printf("HEARTBEAT: %s" ZT_EOL_S,tmp);
|
||||
R::db(this->_db).table("Controller",R::optargs("read_mode","outdated")).insert(controllerRecord,R::optargs("conflict","update")).run(*rdb); |
||||
} |
||||
} catch ( ... ) { |
||||
rdb.reset(); |
||||
} |
||||
std::this_thread::sleep_for(std::chrono::milliseconds(1000)); |
||||
} |
||||
} catch ( ... ) {} |
||||
}); |
||||
} |
||||
|
||||
RethinkDB::~RethinkDB() |
||||
{ |
||||
_run = 0; |
||||
std::this_thread::sleep_for(std::chrono::milliseconds(100)); |
||||
_commitQueue.stop(); |
||||
for(int t=0;t<ZT_CONTROLLER_RETHINKDB_COMMIT_THREADS;++t) |
||||
_commitThread[t].join(); |
||||
if (_membersDbWatcherConnection) |
||||
((R::Connection *)_membersDbWatcherConnection)->close(); |
||||
if (_networksDbWatcherConnection) |
||||
((R::Connection *)_networksDbWatcherConnection)->close(); |
||||
_membersDbWatcher.join(); |
||||
_networksDbWatcher.join(); |
||||
_heartbeatThread.join(); |
||||
_onlineNotificationThread.join(); |
||||
} |
||||
|
||||
bool RethinkDB::waitForReady() |
||||
{ |
||||
while (_ready > 0) { |
||||
if (!_waitNoticePrinted) { |
||||
_waitNoticePrinted = true; |
||||
fprintf(stderr,"[%s] NOTICE: %.10llx controller RethinkDB waiting for initial data download..." ZT_EOL_S,_timestr(),(unsigned long long)_myAddress.toInt()); |
||||
} |
||||
_readyLock.lock(); |
||||
_readyLock.unlock(); |
||||
} |
||||
return true; |
||||
} |
||||
|
||||
bool RethinkDB::isReady() |
||||
{ |
||||
return ((_ready)&&(_connected)); |
||||
} |
||||
|
||||
void RethinkDB::save(nlohmann::json *orig,nlohmann::json &record) |
||||
{ |
||||
if (!record.is_object()) // sanity check
|
||||
return; |
||||
waitForReady(); |
||||
if (orig) { |
||||
if (*orig != record) { |
||||
record["revision"] = OSUtils::jsonInt(record["revision"],0ULL) + 1; |
||||
_commitQueue.post(new nlohmann::json(record)); |
||||
} |
||||
} else { |
||||
record["revision"] = 1; |
||||
_commitQueue.post(new nlohmann::json(record)); |
||||
} |
||||
} |
||||
|
||||
void RethinkDB::eraseNetwork(const uint64_t networkId) |
||||
{ |
||||
char tmp2[24]; |
||||
waitForReady(); |
||||
Utils::hex(networkId,tmp2); |
||||
json *tmp = new json(); |
||||
(*tmp)["id"] = tmp2; |
||||
(*tmp)["objtype"] = "_delete_network"; // pseudo-type, tells thread to delete network
|
||||
_commitQueue.post(tmp); |
||||
} |
||||
|
||||
void RethinkDB::eraseMember(const uint64_t networkId,const uint64_t memberId) |
||||
{ |
||||
char tmp2[24]; |
||||
json *tmp = new json(); |
||||
waitForReady(); |
||||
Utils::hex(networkId,tmp2); |
||||
(*tmp)["nwid"] = tmp2; |
||||
Utils::hex10(memberId,tmp2); |
||||
(*tmp)["id"] = tmp2; |
||||
(*tmp)["objtype"] = "_delete_member"; // pseudo-type, tells thread to delete network
|
||||
_commitQueue.post(tmp); |
||||
} |
||||
|
||||
void RethinkDB::nodeIsOnline(const uint64_t networkId,const uint64_t memberId,const InetAddress &physicalAddress) |
||||
{ |
||||
std::lock_guard<std::mutex> l(_lastOnline_l); |
||||
std::pair<int64_t,InetAddress> &i = _lastOnline[std::pair<uint64_t,uint64_t>(networkId,memberId)]; |
||||
i.first = OSUtils::now(); |
||||
if (physicalAddress) |
||||
i.second = physicalAddress; |
||||
} |
||||
|
||||
} // namespace ZeroTier
|
||||
|
||||
#endif // ZT_CONTROLLER_USE_RETHINKDB
|
||||
@ -1,84 +0,0 @@
|
||||
/*
|
||||
* ZeroTier One - Network Virtualization Everywhere |
||||
* Copyright (C) 2011-2018 ZeroTier, Inc. |
||||
* |
||||
* This program is free software: you can redistribute it and/or modify |
||||
* it under the terms of the GNU General Public License as published by |
||||
* the Free Software Foundation, either version 3 of the License, or |
||||
* (at your option) any later version. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
* GNU General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
#ifdef ZT_CONTROLLER_USE_RETHINKDB |
||||
|
||||
#ifndef ZT_CONTROLLER_RETHINKDB_HPP |
||||
#define ZT_CONTROLLER_RETHINKDB_HPP |
||||
|
||||
#include "DB.hpp" |
||||
|
||||
#define ZT_CONTROLLER_RETHINKDB_COMMIT_THREADS 4 |
||||
|
||||
namespace ZeroTier |
||||
{ |
||||
|
||||
/**
|
||||
* A controller database driver that talks to RethinkDB |
||||
* |
||||
* This is for use with ZeroTier Central. Others are free to build and use it |
||||
* but be aware that we might change it at any time. |
||||
*/ |
||||
class RethinkDB : public DB |
||||
{ |
||||
public: |
||||
RethinkDB(EmbeddedNetworkController *const nc,const Identity &myId,const char *path); |
||||
virtual ~RethinkDB(); |
||||
|
||||
virtual bool waitForReady(); |
||||
virtual bool isReady(); |
||||
virtual void save(nlohmann::json *orig,nlohmann::json &record); |
||||
virtual void eraseNetwork(const uint64_t networkId); |
||||
virtual void eraseMember(const uint64_t networkId,const uint64_t memberId); |
||||
virtual void nodeIsOnline(const uint64_t networkId,const uint64_t memberId,const InetAddress &physicalAddress); |
||||
|
||||
protected: |
||||
struct _PairHasher |
||||
{ |
||||
inline std::size_t operator()(const std::pair<uint64_t,uint64_t> &p) const { return (std::size_t)(p.first ^ p.second); } |
||||
}; |
||||
|
||||
std::string _host; |
||||
std::string _db; |
||||
std::string _auth; |
||||
int _port; |
||||
|
||||
void *_networksDbWatcherConnection; |
||||
void *_membersDbWatcherConnection; |
||||
std::thread _networksDbWatcher; |
||||
std::thread _membersDbWatcher; |
||||
|
||||
BlockingQueue< nlohmann::json * > _commitQueue; |
||||
std::thread _commitThread[ZT_CONTROLLER_RETHINKDB_COMMIT_THREADS]; |
||||
|
||||
std::unordered_map< std::pair<uint64_t,uint64_t>,std::pair<int64_t,InetAddress>,_PairHasher > _lastOnline; |
||||
mutable std::mutex _lastOnline_l; |
||||
std::thread _onlineNotificationThread; |
||||
|
||||
std::thread _heartbeatThread; |
||||
|
||||
mutable std::mutex _readyLock; // locked until ready
|
||||
std::atomic<int> _ready,_connected,_run; |
||||
mutable volatile bool _waitNoticePrinted; |
||||
}; |
||||
|
||||
} // namespace ZeroTier
|
||||
|
||||
#endif |
||||
|
||||
#endif // ZT_CONTROLLER_USE_RETHINKDB
|
||||
@ -1,18 +0,0 @@
|
||||
{ |
||||
"configVersion": 1, |
||||
"defaultCentral": "@my.zerotier.com", |
||||
"defaultController": "@my.zerotier.com", |
||||
"defaultOne": "@local", |
||||
"things": { |
||||
"local": { |
||||
"auth": "local_service_auth_token_replaced_automatically", |
||||
"type": "one", |
||||
"url": "http://127.0.0.1:9993/" |
||||
}, |
||||
"my.zerotier.com": { |
||||
"auth": "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", |
||||
"type": "central", |
||||
"url": "https://my.zerotier.com/" |
||||
} |
||||
} |
||||
} |
||||
@ -1,19 +0,0 @@
|
||||
FROM node:4.4 |
||||
EXPOSE 8080/tcp 9993/udp |
||||
|
||||
# Install ZT network conf files |
||||
RUN mkdir -p /var/lib/zerotier-one/networks.d |
||||
ADD *.conf /var/lib/zerotier-one/networks.d/ |
||||
ADD *.conf / |
||||
ADD zerotier-one / |
||||
ADD zerotier-cli / |
||||
ADD .zerotierCliSettings / |
||||
|
||||
# Install App |
||||
ADD server.js / |
||||
|
||||
# script which will start/auth VM on ZT network |
||||
ADD entrypoint.sh / |
||||
RUN chmod -v +x /entrypoint.sh |
||||
|
||||
CMD ["./entrypoint.sh"] |
||||
@ -1,150 +0,0 @@
|
||||
Kubernetes + ZeroTier |
||||
==== |
||||
|
||||
A self-authorizing Kubernetes cluster deployment over a private ZeroTier network. |
||||
|
||||
This is a quick tutorial for setting up a Kubernetes deployment which can self-authorize each new replica onto your private ZeroTier network with no additional configuration needed when you scale. The Kubernetes-specific instructions and content is based on the [hellonode](http://kubernetes.io/docs/hellonode/) tutorial. All of the files discussed below can be found [here](); |
||||
|
||||
|
||||
|
||||
## Preliminary tasks |
||||
|
||||
**Step 1: Go to [my.zerotier.com](https://my.zerotier.com) and generate a network controller API key. This key will be used by ZeroTier to automatically authorize new instances of your VMs to join your secure deployment network during replication.** |
||||
|
||||
**Step 2: Create a new `private` network. Take note of the network ID, henceforth: `nwid`** |
||||
|
||||
**Step 3: Follow the instructions from the [hellonode](ttp://kubernetes.io/docs/hellonode/) tutorial to set up your development system.** |
||||
|
||||
*** |
||||
## Construct docker image |
||||
|
||||
**Step 4: Create necessary files for inclusion into image, your resultant directory should contain:** |
||||
|
||||
- `ztkube/<nwid>.conf` |
||||
- `ztkube/Dockerfile` |
||||
- `ztkube/entrypoint.sh` |
||||
- `ztkube/server.js` |
||||
- `ztkube/zerotier-cli` |
||||
- `ztkube/zerotier-one` |
||||
|
||||
Start by creating a build directory to copy all required files into `mkdir ztkube`. Then build the following: |
||||
- `make one` |
||||
- `make cli` |
||||
|
||||
Add the following files to the `ztkube` directory. These files will be compiled into the Docker image. |
||||
|
||||
- Create an empty `<nwid>.conf` file to specify the private deployment network you created in *Step 2*: |
||||
|
||||
- Create a CLI tool config file `.zerotierCliSettings` which should only contain your network controller API key to authorize new devices on your network (the local service API key will be filled in automatically). In this example the default controller is hosted by us at [my.zerotier.com](https://my.zerotier.com). Alternatively, you can host your own network controller but you'll need to modify the CLI config file accordingly. |
||||
|
||||
``` |
||||
{ |
||||
"configVersion": 1, |
||||
"defaultCentral": "@my.zerotier.com", |
||||
"defaultController": "@my.zerotier.com", |
||||
"defaultOne": "@local", |
||||
"things": { |
||||
"local": { |
||||
"auth": "local_service_auth_token_replaced_automatically", |
||||
"type": "one", |
||||
"url": "http://127.0.0.1:9993/" |
||||
}, |
||||
"my.zerotier.com": { |
||||
"auth": "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", |
||||
"type": "central", |
||||
"url": "https://my.zerotier.com/" |
||||
} |
||||
} |
||||
} |
||||
``` |
||||
|
||||
|
||||
- Create a `Dockerfile` which will copy the ZeroTier service as well as the ZeroTier CLI to the image: |
||||
|
||||
``` |
||||
FROM node:4.4 |
||||
EXPOSE 8080/tcp 9993/udp |
||||
|
||||
# Install ZT network conf files |
||||
RUN mkdir -p /var/lib/zerotier-one/networks.d |
||||
ADD *.conf /var/lib/zerotier-one/networks.d/ |
||||
ADD *.conf / |
||||
ADD zerotier-one / |
||||
ADD zerotier-cli / |
||||
ADD .zerotierCliSettings / |
||||
|
||||
# Install App |
||||
ADD server.js / |
||||
|
||||
# script which will start/auth VM on ZT network |
||||
ADD entrypoint.sh / |
||||
RUN chmod -v +x /entrypoint.sh |
||||
|
||||
CMD ["./entrypoint.sh"] |
||||
``` |
||||
|
||||
- Create the `entrypoint.sh` script which will start the ZeroTier service in the VM, attempt to join your deployment network and automatically authorize the new VM if your network is set to private: |
||||
|
||||
``` |
||||
#!/bin/bash |
||||
|
||||
echo '*** ZeroTier-Kubernetes self-auth test script' |
||||
chown -R daemon /var/lib/zerotier-one |
||||
chgrp -R daemon /var/lib/zerotier-one |
||||
su daemon -s /bin/bash -c '/zerotier-one -d -U -p9993 >>/tmp/zerotier-one.out 2>&1' |
||||
dev="" |
||||
nwconf=$(ls *.conf) |
||||
nwid="${nwconf%.*}" |
||||
|
||||
sleep 10 |
||||
dev=$(cat /var/lib/zerotier-one/identity.public| cut -d ':' -f 1) |
||||
|
||||
echo '*** Joining' |
||||
./zerotier-cli join "$nwid".conf |
||||
# Fill out local service auth token |
||||
AUTHTOKEN=$(cat /var/lib/zerotier-one/authtoken.secret) |
||||
sed "s|\local_service_auth_token_replaced_automatically|${AUTHTOKEN}|" .zerotierCliSettings > /root/.zerotierCliSettings |
||||
echo '*** Authorizing' |
||||
./zerotier-cli net-auth @my.zerotier.com "$nwid" "$dev" |
||||
echo '*** Cleaning up' # Remove controller auth token |
||||
rm -rf .zerotierCliSettings /root/.zerotierCliSettings |
||||
node server.js |
||||
``` |
||||
|
||||
**Step 5: Build the image:** |
||||
|
||||
- `docker build -t gcr.io/$PROJECT_ID/hello-node .` |
||||
|
||||
|
||||
|
||||
**Step 6: Push the docker image to your *Container Registry*** |
||||
|
||||
- `gcloud docker push gcr.io/$PROJECT_ID/hello-node:v1` |
||||
|
||||
*** |
||||
## Deploy! |
||||
|
||||
**Step 7: Create Kubernetes Cluster** |
||||
|
||||
- `gcloud config set compute/zone us-central1-a` |
||||
|
||||
- `gcloud container clusters create hello-world` |
||||
|
||||
- `gcloud container clusters get-credentials hello-world` |
||||
|
||||
|
||||
|
||||
**Step 8: Create your pod** |
||||
|
||||
- `kubectl run hello-node --image=gcr.io/$PROJECT_ID/hello-node:v1 --port=8080` |
||||
|
||||
|
||||
|
||||
**Step 9: Scale** |
||||
|
||||
- `kubectl scale deployment hello-node --replicas=4` |
||||
|
||||
*** |
||||
## Verify |
||||
|
||||
Now, after a minute or so you can use `zerotier-cli net-members <nwid>` to show all of your VM instances on your ZeroTier deployment network. If you haven't [configured your local CLI](https://github.com/zerotier/ZeroTierOne/tree/dev/cli), you can simply log into [my.zerotier.com](https://my.zerotier.com), go to *Networks -> nwid* to check that your VMs are indeed members of your private network. You should also note that the `entrypoint.sh` script will automatically delete your network controller API key once it has authorized your VM. This is merely a security measure and can be removed if needed. |
||||
@ -1,23 +0,0 @@
|
||||
#!/bin/bash |
||||
|
||||
echo '*** ZeroTier-Kubernetes self-auth test script' |
||||
chown -R daemon /var/lib/zerotier-one |
||||
chgrp -R daemon /var/lib/zerotier-one |
||||
su daemon -s /bin/bash -c '/zerotier-one -d -U -p9993 >>/tmp/zerotier-one.out 2>&1' |
||||
dev="" |
||||
nwconf=$(ls *.conf) |
||||
nwid="${nwconf%.*}" |
||||
|
||||
sleep 10 |
||||
dev=$(cat /var/lib/zerotier-one/identity.public| cut -d ':' -f 1) |
||||
|
||||
echo '*** Joining' |
||||
./zerotier-cli join "$nwid".conf |
||||
# Fill out local service auth token |
||||
AUTHTOKEN=$(cat /var/lib/zerotier-one/authtoken.secret) |
||||
sed "s|\local_service_auth_token_replaced_automatically|${AUTHTOKEN}|" .zerotierCliSettings > /root/.zerotierCliSettings |
||||
echo '*** Authorizing' |
||||
./zerotier-cli net-auth @my.zerotier.com "$nwid" "$dev" |
||||
echo '*** Cleaning up' # Remove controller auth token |
||||
rm -rf .zerotierCliSettings /root/.zerotierCliSettings |
||||
node server.js |
||||
@ -1,8 +0,0 @@
|
||||
var http = require('http'); |
||||
var handleRequest = function(request, response) { |
||||
console.log('Received request for URL: ' + request.url); |
||||
response.writeHead(200); |
||||
response.end('Hello World!'); |
||||
}; |
||||
var www = http.createServer(handleRequest); |
||||
www.listen(8080); |
||||
@ -1,25 +0,0 @@
|
||||
'use strict' |
||||
|
||||
/* This is a utility to convert latitude/longitude into X,Y,Z coordinates as used by clustering. */ |
||||
|
||||
if (process.argv.length !== 4) { |
||||
console.log('Usage: node lat_lon_to_xyz.js <latitude> <longitude'); |
||||
process.exit(1); |
||||
} |
||||
|
||||
var lat = parseFloat(process.argv[2])||0.0; |
||||
var lon = parseFloat(process.argv[3])||0.0; |
||||
|
||||
var latRadians = lat * 0.01745329251994; // PI / 180
|
||||
var lonRadians = lon * 0.01745329251994; // PI / 180
|
||||
var cosLat = Math.cos(latRadians); |
||||
|
||||
console.log({ |
||||
lat: lat, |
||||
lon: lon, |
||||
x: Math.round((-6371.0) * cosLat * Math.cos(lonRadians)), |
||||
y: Math.round(6371.0 * Math.sin(latRadians)), |
||||
z: Math.round(6371.0 * cosLat * Math.sin(lonRadians)) |
||||
}); |
||||
|
||||
process.exit(0); |
||||
@ -1 +1,3 @@
|
||||
c++ -I.. -o mkworld ../node/C25519.cpp ../node/Salsa20.cpp ../node/SHA512.cpp ../node/Identity.cpp ../node/Utils.cpp ../node/InetAddress.cpp ../osdep/OSUtils.cpp mkworld.cpp |
||||
#!/bin/bash |
||||
|
||||
c++ -std=c++11 -I../.. -I.. -g -o mkworld ../../node/C25519.cpp ../../node/Salsa20.cpp ../../node/SHA512.cpp ../../node/Identity.cpp ../../node/Utils.cpp ../../node/InetAddress.cpp ../../osdep/OSUtils.cpp mkworld.cpp -lm |
||||
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
@ -1,3 +1,3 @@
|
||||
|
||||
#define ZT_DEFAULT_WORLD_LENGTH 634 |
||||
static const unsigned char ZT_DEFAULT_WORLD[ZT_DEFAULT_WORLD_LENGTH] = {0x01,0x00,0x00,0x00,0x00,0x08,0xea,0xc9,0x0a,0x00,0x00,0x01,0x64,0xd3,0x71,0xf0,0x58,0xb8,0xb3,0x88,0xa4,0x69,0x22,0x14,0x91,0xaa,0x9a,0xcd,0x66,0xcc,0x76,0x4c,0xde,0xfd,0x56,0x03,0x9f,0x10,0x67,0xae,0x15,0xe6,0x9c,0x6f,0xb4,0x2d,0x7b,0x55,0x33,0x0e,0x3f,0xda,0xac,0x52,0x9c,0x07,0x92,0xfd,0x73,0x40,0xa6,0xaa,0x21,0xab,0xa8,0xa4,0x89,0xfd,0xae,0xa4,0x4a,0x39,0xbf,0x2d,0x00,0x65,0x9a,0xc9,0xc8,0x18,0xeb,0xbf,0xfd,0xd5,0x32,0xf7,0x15,0x6e,0x02,0x6f,0xb9,0x01,0x0d,0xb5,0x7b,0x04,0xd8,0x3a,0xc5,0x17,0x39,0x04,0x36,0xfd,0x9d,0xc6,0x3d,0xa8,0xf3,0x8e,0x79,0xe7,0xc8,0x77,0x8d,0xcc,0x79,0xb8,0xab,0xc6,0x98,0x7c,0x9f,0x34,0x25,0x14,0xe1,0x2f,0xd7,0x97,0x11,0xec,0x34,0x4c,0x9f,0x0f,0xb4,0x85,0x0d,0x9b,0x11,0xd1,0xc2,0xce,0x00,0xc4,0x0a,0x13,0x4b,0xcb,0xc3,0xae,0x2e,0x16,0x00,0x4b,0xdc,0x90,0x5e,0x7e,0x9b,0x44,0x07,0x15,0x36,0x61,0x3c,0x64,0xaa,0xe9,0x46,0x78,0x3c,0xa7,0x18,0xc8,0xd8,0x02,0x9d,0x21,0x90,0x39,0xf3,0x00,0x01,0xf0,0x92,0x2a,0x98,0xe3,0xb3,0x4e,0xbc,0xbf,0xf3,0x33,0x26,0x9d,0xc2,0x65,0xd7,0xa0,0x20,0xaa,0xb6,0x9d,0x72,0xbe,0x4d,0x4a,0xcc,0x9c,0x8c,0x92,0x94,0x78,0x57,0x71,0x25,0x6c,0xd1,0xd9,0x42,0xa9,0x0d,0x1b,0xd1,0xd2,0xdc,0xa3,0xea,0x84,0xef,0x7d,0x85,0xaf,0xe6,0x61,0x1f,0xb4,0x3f,0xf0,0xb7,0x41,0x26,0xd9,0x0a,0x6e,0x00,0x0c,0x04,0xbc,0xa6,0x5e,0xb1,0x27,0x09,0x06,0x2a,0x03,0xb0,0xc0,0x00,0x02,0x00,0xd0,0x00,0x7d,0x00,0x01,0x00,0x00,0x00,0x00,0x27,0x09,0x04,0x9a,0x42,0xc5,0x21,0x27,0x09,0x06,0x2c,0x0f,0xf8,0x50,0x01,0x54,0x01,0x97,0x00,0x33,0xcc,0x08,0xf8,0xfa,0xcc,0x08,0x27,0x09,0x04,0x9f,0xcb,0x61,0xab,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x08,0x00,0x00,0xa1,0x00,0x54,0x60,0x01,0x00,0xfc,0xcc,0x08,0x27,0x09,0x04,0x83,0xff,0x06,0x10,0x27,0x09,0x06,0x28,0x03,0xeb,0x80,0x00,0x00,0x00,0x0e,0x00,0x02,0x60,0x01,0x00,0xfc,0xcc,0x08,0x27,0x09,0x04,0x6b,0xaa,0xc5,0x0e,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x00,0x01,0x00,0x20,0x02,0x00,0xe0,0x01,0x08,0xfe,0xcc,0x08,0x27,0x09,0x04,0x80,0xc7,0xc5,0xd9,0x27,0x09,0x06,0x24,0x00,0x61,0x80,0x00,0x00,0x00,0xd0,0x00,0xb7,0x40,0x01,0x08,0xfe,0xcc,0x08,0x27,0x09,0x88,0x41,0x40,0x8a,0x2e,0x00,0xbb,0x1d,0x31,0xf2,0xc3,0x23,0xe2,0x64,0xe9,0xe6,0x41,0x72,0xc1,0xa7,0x4f,0x77,0x89,0x95,0x55,0xed,0x10,0x75,0x1c,0xd5,0x6e,0x86,0x40,0x5c,0xde,0x11,0x8d,0x02,0xdf,0xfe,0x55,0x5d,0x46,0x2c,0xcf,0x6a,0x85,0xb5,0x63,0x1c,0x12,0x35,0x0c,0x8d,0x5d,0xc4,0x09,0xba,0x10,0xb9,0x02,0x5d,0x0f,0x44,0x5c,0xf4,0x49,0xd9,0x2b,0x1c,0x00,0x0c,0x04,0x2d,0x20,0xc6,0x82,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x64,0x00,0x81,0xc3,0x54,0x00,0x00,0xff,0xfe,0x18,0x1d,0x61,0x27,0x09,0x04,0x2e,0x65,0xa0,0xf9,0x27,0x09,0x06,0x2a,0x03,0xb0,0xc0,0x00,0x03,0x00,0xd0,0x00,0x6a,0x30,0x01,0x78,0x00,0xcd,0x08,0x27,0x09,0x04,0x6b,0xbf,0x2e,0xd2,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x68,0x00,0x83,0xa4,0x00,0x64,0xcd,0x08,0x80,0x01,0xcd,0x08,0x27,0x09,0x04,0x2d,0x20,0xf6,0xb3,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x58,0x00,0x8b,0xf8,0x54,0x00,0x00,0xff,0xfe,0x15,0xb3,0x9a,0x27,0x09,0x04,0x2d,0x20,0xf8,0x57,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x70,0x00,0x9b,0xc9,0x54,0x00,0x00,0xff,0xfe,0x15,0xc4,0xf5,0x27,0x09,0x04,0x9f,0xcb,0x02,0x9a,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x0c,0xad,0x00,0xd0,0x00,0x26,0x70,0x01,0xfe,0x15,0xc4,0xf5,0x27,0x09}; |
||||
#define ZT_DEFAULT_WORLD_LENGTH 732 |
||||
static const unsigned char ZT_DEFAULT_WORLD[ZT_DEFAULT_WORLD_LENGTH] = {0x01,0x00,0x00,0x00,0x00,0x08,0xea,0xc9,0x0a,0x00,0x00,0x01,0x6b,0xd4,0x16,0x08,0xc1,0xb8,0xb3,0x88,0xa4,0x69,0x22,0x14,0x91,0xaa,0x9a,0xcd,0x66,0xcc,0x76,0x4c,0xde,0xfd,0x56,0x03,0x9f,0x10,0x67,0xae,0x15,0xe6,0x9c,0x6f,0xb4,0x2d,0x7b,0x55,0x33,0x0e,0x3f,0xda,0xac,0x52,0x9c,0x07,0x92,0xfd,0x73,0x40,0xa6,0xaa,0x21,0xab,0xa8,0xa4,0x89,0xfd,0xae,0xa4,0x4a,0x39,0xbf,0x2d,0x00,0x65,0x9a,0xc9,0xc8,0x18,0xeb,0x16,0x93,0xf4,0xe5,0xbd,0x20,0xda,0x10,0xad,0xc7,0x05,0xf4,0x99,0xfe,0x04,0x08,0x9b,0xe0,0x9e,0x77,0x1d,0x9f,0x47,0x16,0xaa,0x92,0x4f,0x10,0x16,0x3d,0xc7,0xec,0xd3,0x90,0x9e,0xd1,0x74,0xfc,0xb3,0xb5,0x07,0x9c,0x4d,0x95,0xc5,0x17,0x8b,0x3d,0x0b,0x60,0x76,0xe8,0x51,0xbb,0xb6,0x3d,0x74,0xb5,0x21,0x83,0x7b,0x95,0x1d,0x02,0x9b,0xcd,0xaf,0x5c,0x3e,0x96,0xdf,0x37,0x2c,0x56,0x6d,0xfa,0x75,0x0f,0xda,0x55,0x85,0x13,0xf4,0x76,0x1a,0x66,0x4d,0x3b,0x8d,0xcf,0x12,0xc9,0x34,0xb9,0x0d,0x61,0x03,0x3a,0x46,0xf1,0xbf,0x30,0x00,0x76,0xe6,0x6f,0xab,0x33,0xe2,0x85,0x49,0xa6,0x2e,0xe2,0x06,0x4d,0x18,0x43,0x27,0x3c,0x2c,0x30,0x0b,0xa4,0x5c,0x3f,0x20,0xbe,0xf0,0x2d,0xba,0xd2,0x25,0x72,0x3b,0xb5,0x9a,0x9b,0xb4,0xb1,0x35,0x35,0x73,0x09,0x61,0xae,0xec,0xf5,0xa1,0x63,0xac,0xe4,0x77,0xcc,0xeb,0x07,0x27,0x02,0x5b,0x99,0xac,0x14,0xa5,0x16,0x6a,0x09,0xa3,0x00,0x02,0x04,0xb9,0xb4,0x0d,0x52,0x27,0x09,0x06,0x2a,0x02,0x6e,0xa0,0xc8,0x15,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x27,0x09,0x9d,0x21,0x90,0x39,0xf3,0x00,0x01,0xf0,0x92,0x2a,0x98,0xe3,0xb3,0x4e,0xbc,0xbf,0xf3,0x33,0x26,0x9d,0xc2,0x65,0xd7,0xa0,0x20,0xaa,0xb6,0x9d,0x72,0xbe,0x4d,0x4a,0xcc,0x9c,0x8c,0x92,0x94,0x78,0x57,0x71,0x25,0x6c,0xd1,0xd9,0x42,0xa9,0x0d,0x1b,0xd1,0xd2,0xdc,0xa3,0xea,0x84,0xef,0x7d,0x85,0xaf,0xe6,0x61,0x1f,0xb4,0x3f,0xf0,0xb7,0x41,0x26,0xd9,0x0a,0x6e,0x00,0x0c,0x04,0xbc,0xa6,0x5e,0xb1,0x27,0x09,0x06,0x2a,0x03,0xb0,0xc0,0x00,0x02,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x7d,0x00,0x01,0x27,0x09,0x04,0x9a,0x42,0xc5,0x21,0x27,0x09,0x06,0x2c,0x0f,0xf8,0x50,0x01,0x54,0x01,0x97,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x33,0x27,0x09,0x04,0x9f,0xcb,0x61,0xab,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x08,0x00,0x00,0xa1,0x00,0x00,0x00,0x00,0x00,0x54,0x60,0x01,0x27,0x09,0x04,0x83,0xff,0x06,0x10,0x27,0x09,0x06,0x28,0x03,0xeb,0x80,0x00,0x00,0x00,0x0e,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x02,0x27,0x09,0x04,0x6b,0xaa,0xc5,0x0e,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x00,0x01,0x00,0x20,0x00,0x00,0x00,0x00,0x02,0x00,0xe0,0x01,0x27,0x09,0x04,0x80,0xc7,0xc5,0xd9,0x27,0x09,0x06,0x24,0x00,0x61,0x80,0x00,0x00,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0xb7,0x40,0x01,0x27,0x09,0x88,0x41,0x40,0x8a,0x2e,0x00,0xbb,0x1d,0x31,0xf2,0xc3,0x23,0xe2,0x64,0xe9,0xe6,0x41,0x72,0xc1,0xa7,0x4f,0x77,0x89,0x95,0x55,0xed,0x10,0x75,0x1c,0xd5,0x6e,0x86,0x40,0x5c,0xde,0x11,0x8d,0x02,0xdf,0xfe,0x55,0x5d,0x46,0x2c,0xcf,0x6a,0x85,0xb5,0x63,0x1c,0x12,0x35,0x0c,0x8d,0x5d,0xc4,0x09,0xba,0x10,0xb9,0x02,0x5d,0x0f,0x44,0x5c,0xf4,0x49,0xd9,0x2b,0x1c,0x00,0x0c,0x04,0x2d,0x20,0xc6,0x82,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x64,0x00,0x81,0xc3,0x54,0x00,0x00,0xff,0xfe,0x18,0x1d,0x61,0x27,0x09,0x04,0x2e,0x65,0xa0,0xf9,0x27,0x09,0x06,0x2a,0x03,0xb0,0xc0,0x00,0x03,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x6a,0x30,0x01,0x27,0x09,0x04,0x6b,0xbf,0x2e,0xd2,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x68,0x00,0x83,0xa4,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x64,0x27,0x09,0x04,0x2d,0x20,0xf6,0xb3,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x58,0x00,0x8b,0xf8,0x54,0x00,0x00,0xff,0xfe,0x15,0xb3,0x9a,0x27,0x09,0x04,0x2d,0x20,0xf8,0x57,0x27,0x09,0x06,0x20,0x01,0x19,0xf0,0x70,0x00,0x9b,0xc9,0x54,0x00,0x00,0xff,0xfe,0x15,0xc4,0xf5,0x27,0x09,0x04,0x9f,0xcb,0x02,0x9a,0x27,0x09,0x06,0x26,0x04,0xa8,0x80,0x0c,0xad,0x00,0xd0,0x00,0x00,0x00,0x00,0x00,0x26,0x70,0x01,0x27,0x09}; |
||||
|
||||
@ -0,0 +1,231 @@
|
||||
/*
|
||||
* Copyright (c)2019 ZeroTier, Inc. |
||||
* |
||||
* Use of this software is governed by the Business Source License included |
||||
* in the LICENSE.TXT file in the project's root directory. |
||||
* |
||||
* Change Date: 2023-01-01 |
||||
* |
||||
* On the date above, in accordance with the Business Source License, use |
||||
* of this software will be governed by version 2.0 of the Apache License. |
||||
*/ |
||||
/****/ |
||||
|
||||
#include "DBMirrorSet.hpp" |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
DBMirrorSet::DBMirrorSet(DB::ChangeListener *listener) : |
||||
_listener(listener), |
||||
_running(true) |
||||
{ |
||||
_syncCheckerThread = std::thread([this]() { |
||||
for(;;) { |
||||
for(int i=0;i<120;++i) { // 1 minute delay between checks
|
||||
if (!_running) |
||||
return; |
||||
std::this_thread::sleep_for(std::chrono::milliseconds(500)); |
||||
} |
||||
|
||||
std::vector< std::shared_ptr<DB> > dbs; |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
if (_dbs.size() <= 1) |
||||
continue; // no need to do this if there's only one DB, so skip the iteration
|
||||
dbs = _dbs; |
||||
} |
||||
|
||||
for(auto db=dbs.begin();db!=dbs.end();++db) { |
||||
(*db)->each([this,&dbs,&db](uint64_t networkId,const nlohmann::json &network,uint64_t memberId,const nlohmann::json &member) { |
||||
try { |
||||
if (network.is_object()) { |
||||
if (memberId == 0) { |
||||
for(auto db2=dbs.begin();db2!=dbs.end();++db2) { |
||||
if (db->get() != db2->get()) { |
||||
nlohmann::json nw2; |
||||
if ((!(*db2)->get(networkId,nw2))||((nw2.is_object())&&(OSUtils::jsonInt(nw2["revision"],0) < OSUtils::jsonInt(network["revision"],0)))) { |
||||
nw2 = network; |
||||
(*db2)->save(nw2,false); |
||||
} |
||||
} |
||||
} |
||||
} else if (member.is_object()) { |
||||
for(auto db2=dbs.begin();db2!=dbs.end();++db2) { |
||||
if (db->get() != db2->get()) { |
||||
nlohmann::json nw2,m2; |
||||
if ((!(*db2)->get(networkId,nw2,memberId,m2))||((m2.is_object())&&(OSUtils::jsonInt(m2["revision"],0) < OSUtils::jsonInt(member["revision"],0)))) { |
||||
m2 = member; |
||||
(*db2)->save(m2,false); |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} catch ( ... ) {} // skip entries that generate JSON errors
|
||||
}); |
||||
} |
||||
} |
||||
}); |
||||
} |
||||
|
||||
DBMirrorSet::~DBMirrorSet() |
||||
{ |
||||
_running = false; |
||||
_syncCheckerThread.join(); |
||||
} |
||||
|
||||
bool DBMirrorSet::hasNetwork(const uint64_t networkId) const |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
if ((*d)->hasNetwork(networkId)) |
||||
return true; |
||||
} |
||||
return false; |
||||
} |
||||
|
||||
bool DBMirrorSet::get(const uint64_t networkId,nlohmann::json &network) |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
if ((*d)->get(networkId,network)) { |
||||
return true; |
||||
} |
||||
} |
||||
return false; |
||||
} |
||||
|
||||
bool DBMirrorSet::get(const uint64_t networkId,nlohmann::json &network,const uint64_t memberId,nlohmann::json &member) |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
if ((*d)->get(networkId,network,memberId,member)) |
||||
return true; |
||||
} |
||||
return false; |
||||
} |
||||
|
||||
bool DBMirrorSet::get(const uint64_t networkId,nlohmann::json &network,const uint64_t memberId,nlohmann::json &member,DB::NetworkSummaryInfo &info) |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
if ((*d)->get(networkId,network,memberId,member,info)) |
||||
return true; |
||||
} |
||||
return false; |
||||
} |
||||
|
||||
bool DBMirrorSet::get(const uint64_t networkId,nlohmann::json &network,std::vector<nlohmann::json> &members) |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
if ((*d)->get(networkId,network,members)) |
||||
return true; |
||||
} |
||||
return false; |
||||
} |
||||
|
||||
void DBMirrorSet::networks(std::set<uint64_t> &networks) |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
(*d)->networks(networks); |
||||
} |
||||
} |
||||
|
||||
bool DBMirrorSet::waitForReady() |
||||
{ |
||||
bool r = false; |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
r |= (*d)->waitForReady(); |
||||
} |
||||
return r; |
||||
} |
||||
|
||||
bool DBMirrorSet::isReady() |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
if (!(*d)->isReady()) |
||||
return false; |
||||
} |
||||
return true; |
||||
} |
||||
|
||||
bool DBMirrorSet::save(nlohmann::json &record,bool notifyListeners) |
||||
{ |
||||
std::vector< std::shared_ptr<DB> > dbs; |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
dbs = _dbs; |
||||
} |
||||
if (notifyListeners) { |
||||
for(auto d=dbs.begin();d!=dbs.end();++d) { |
||||
if ((*d)->save(record,true)) |
||||
return true; |
||||
} |
||||
return false; |
||||
} else { |
||||
bool modified = false; |
||||
for(auto d=dbs.begin();d!=dbs.end();++d) { |
||||
modified |= (*d)->save(record,false); |
||||
} |
||||
return modified; |
||||
} |
||||
} |
||||
|
||||
void DBMirrorSet::eraseNetwork(const uint64_t networkId) |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
(*d)->eraseNetwork(networkId); |
||||
} |
||||
} |
||||
|
||||
void DBMirrorSet::eraseMember(const uint64_t networkId,const uint64_t memberId) |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
(*d)->eraseMember(networkId,memberId); |
||||
} |
||||
} |
||||
|
||||
void DBMirrorSet::nodeIsOnline(const uint64_t networkId,const uint64_t memberId,const InetAddress &physicalAddress) |
||||
{ |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
(*d)->nodeIsOnline(networkId,memberId,physicalAddress); |
||||
} |
||||
} |
||||
|
||||
void DBMirrorSet::onNetworkUpdate(const void *db,uint64_t networkId,const nlohmann::json &network) |
||||
{ |
||||
nlohmann::json record(network); |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
if (d->get() != db) { |
||||
(*d)->save(record,false); |
||||
} |
||||
} |
||||
_listener->onNetworkUpdate(this,networkId,network); |
||||
} |
||||
|
||||
void DBMirrorSet::onNetworkMemberUpdate(const void *db,uint64_t networkId,uint64_t memberId,const nlohmann::json &member) |
||||
{ |
||||
nlohmann::json record(member); |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
for(auto d=_dbs.begin();d!=_dbs.end();++d) { |
||||
if (d->get() != db) { |
||||
(*d)->save(record,false); |
||||
} |
||||
} |
||||
_listener->onNetworkMemberUpdate(this,networkId,memberId,member); |
||||
} |
||||
|
||||
void DBMirrorSet::onNetworkMemberDeauthorize(const void *db,uint64_t networkId,uint64_t memberId) |
||||
{ |
||||
_listener->onNetworkMemberDeauthorize(this,networkId,memberId); |
||||
} |
||||
|
||||
} // namespace ZeroTier
|
||||
@ -0,0 +1,71 @@
|
||||
/*
|
||||
* Copyright (c)2019 ZeroTier, Inc. |
||||
* |
||||
* Use of this software is governed by the Business Source License included |
||||
* in the LICENSE.TXT file in the project's root directory. |
||||
* |
||||
* Change Date: 2023-01-01 |
||||
* |
||||
* On the date above, in accordance with the Business Source License, use |
||||
* of this software will be governed by version 2.0 of the Apache License. |
||||
*/ |
||||
/****/ |
||||
|
||||
#ifndef ZT_DBMIRRORSET_HPP |
||||
#define ZT_DBMIRRORSET_HPP |
||||
|
||||
#include "DB.hpp" |
||||
|
||||
#include <vector> |
||||
#include <memory> |
||||
#include <mutex> |
||||
#include <set> |
||||
#include <thread> |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
class DBMirrorSet : public DB::ChangeListener |
||||
{ |
||||
public: |
||||
DBMirrorSet(DB::ChangeListener *listener); |
||||
virtual ~DBMirrorSet(); |
||||
|
||||
bool hasNetwork(const uint64_t networkId) const; |
||||
|
||||
bool get(const uint64_t networkId,nlohmann::json &network); |
||||
bool get(const uint64_t networkId,nlohmann::json &network,const uint64_t memberId,nlohmann::json &member); |
||||
bool get(const uint64_t networkId,nlohmann::json &network,const uint64_t memberId,nlohmann::json &member,DB::NetworkSummaryInfo &info); |
||||
bool get(const uint64_t networkId,nlohmann::json &network,std::vector<nlohmann::json> &members); |
||||
|
||||
void networks(std::set<uint64_t> &networks); |
||||
|
||||
bool waitForReady(); |
||||
bool isReady(); |
||||
bool save(nlohmann::json &record,bool notifyListeners); |
||||
void eraseNetwork(const uint64_t networkId); |
||||
void eraseMember(const uint64_t networkId,const uint64_t memberId); |
||||
void nodeIsOnline(const uint64_t networkId,const uint64_t memberId,const InetAddress &physicalAddress); |
||||
|
||||
// These are called by various DB instances when changes occur.
|
||||
virtual void onNetworkUpdate(const void *db,uint64_t networkId,const nlohmann::json &network); |
||||
virtual void onNetworkMemberUpdate(const void *db,uint64_t networkId,uint64_t memberId,const nlohmann::json &member); |
||||
virtual void onNetworkMemberDeauthorize(const void *db,uint64_t networkId,uint64_t memberId); |
||||
|
||||
inline void addDB(const std::shared_ptr<DB> &db) |
||||
{ |
||||
db->addListener(this); |
||||
std::lock_guard<std::mutex> l(_dbs_l); |
||||
_dbs.push_back(db); |
||||
} |
||||
|
||||
private: |
||||
DB::ChangeListener *const _listener; |
||||
std::atomic_bool _running; |
||||
std::thread _syncCheckerThread; |
||||
std::vector< std::shared_ptr< DB > > _dbs; |
||||
mutable std::mutex _dbs_l; |
||||
}; |
||||
|
||||
} // namespace ZeroTier
|
||||
|
||||
#endif |
||||
@ -0,0 +1,406 @@
|
||||
/*
|
||||
* Copyright (c)2019 ZeroTier, Inc. |
||||
* |
||||
* Use of this software is governed by the Business Source License included |
||||
* in the LICENSE.TXT file in the project's root directory. |
||||
* |
||||
* Change Date: 2023-01-01 |
||||
* |
||||
* On the date above, in accordance with the Business Source License, use |
||||
* of this software will be governed by version 2.0 of the Apache License. |
||||
*/ |
||||
/****/ |
||||
|
||||
#include "LFDB.hpp" |
||||
|
||||
#include <thread> |
||||
#include <chrono> |
||||
#include <iostream> |
||||
#include <sstream> |
||||
|
||||
#include "../osdep/OSUtils.hpp" |
||||
#include "../ext/cpp-httplib/httplib.h" |
||||
|
||||
namespace ZeroTier |
||||
{ |
||||
|
||||
LFDB::LFDB(const Identity &myId,const char *path,const char *lfOwnerPrivate,const char *lfOwnerPublic,const char *lfNodeHost,int lfNodePort,bool storeOnlineState) : |
||||
DB(), |
||||
_myId(myId), |
||||
_lfOwnerPrivate((lfOwnerPrivate) ? lfOwnerPrivate : ""), |
||||
_lfOwnerPublic((lfOwnerPublic) ? lfOwnerPublic : ""), |
||||
_lfNodeHost((lfNodeHost) ? lfNodeHost : "127.0.0.1"), |
||||
_lfNodePort(((lfNodePort > 0)&&(lfNodePort < 65536)) ? lfNodePort : 9980), |
||||
_running(true), |
||||
_ready(false), |
||||
_storeOnlineState(storeOnlineState) |
||||
{ |
||||
_syncThread = std::thread([this]() { |
||||
char controllerAddress[24]; |
||||
const uint64_t controllerAddressInt = _myId.address().toInt(); |
||||
_myId.address().toString(controllerAddress); |
||||
std::string networksSelectorName("com.zerotier.controller.lfdb:"); networksSelectorName.append(controllerAddress); networksSelectorName.append("/network"); |
||||
|
||||
// LF record masking key is the first 32 bytes of SHA512(controller private key) in hex,
|
||||
// hiding record values from anything but the controller or someone who has its key.
|
||||
uint8_t sha512pk[64]; |
||||
_myId.sha512PrivateKey(sha512pk); |
||||
char maskingKey [128]; |
||||
Utils::hex(sha512pk,32,maskingKey); |
||||
|
||||
httplib::Client htcli(_lfNodeHost.c_str(),_lfNodePort,600); |
||||
int64_t timeRangeStart = 0; |
||||
while (_running.load()) { |
||||
{ |
||||
std::lock_guard<std::mutex> sl(_state_l); |
||||
for(auto ns=_state.begin();ns!=_state.end();++ns) { |
||||
if (ns->second.dirty) { |
||||
nlohmann::json network; |
||||
if (get(ns->first,network)) { |
||||
nlohmann::json newrec,selector0; |
||||
selector0["Name"] = networksSelectorName; |
||||
selector0["Ordinal"] = ns->first; |
||||
newrec["Selectors"].push_back(selector0); |
||||
newrec["Value"] = network.dump(); |
||||
newrec["OwnerPrivate"] = _lfOwnerPrivate; |
||||
newrec["MaskingKey"] = maskingKey; |
||||
newrec["PulseIfUnchanged"] = true; |
||||
try { |
||||
auto resp = htcli.Post("/makerecord",newrec.dump(),"application/json"); |
||||
if (resp) { |
||||
if (resp->status == 200) { |
||||
ns->second.dirty = false; |
||||
//printf("SET network %.16llx %s\n",ns->first,resp->body.c_str());
|
||||
} else { |
||||
fprintf(stderr,"ERROR: LFDB: %d from node (create/update network): %s" ZT_EOL_S,resp->status,resp->body.c_str()); |
||||
} |
||||
} else { |
||||
fprintf(stderr,"ERROR: LFDB: node is offline" ZT_EOL_S); |
||||
} |
||||
} catch (std::exception &e) { |
||||
fprintf(stderr,"ERROR: LFDB: unexpected exception querying node (create/update network): %s" ZT_EOL_S,e.what()); |
||||
} catch ( ... ) { |
||||
fprintf(stderr,"ERROR: LFDB: unexpected exception querying node (create/update network): unknown exception" ZT_EOL_S); |
||||
} |
||||
} |
||||
} |
||||
|
||||
for(auto ms=ns->second.members.begin();ms!=ns->second.members.end();++ms) { |
||||
if ((_storeOnlineState)&&(ms->second.lastOnlineDirty)&&(ms->second.lastOnlineAddress)) { |
||||
nlohmann::json newrec,selector0,selector1,selectors,ip; |
||||
char tmp[1024],tmp2[128]; |
||||
OSUtils::ztsnprintf(tmp,sizeof(tmp),"com.zerotier.controller.lfdb:%s/network/%.16llx/online",controllerAddress,(unsigned long long)ns->first); |
||||
ms->second.lastOnlineAddress.toIpString(tmp2); |
||||
selector0["Name"] = tmp; |
||||
selector0["Ordinal"] = ms->first; |
||||
selector1["Name"] = tmp2; |
||||
selector1["Ordinal"] = 0; |
||||
selectors.push_back(selector0); |
||||
selectors.push_back(selector1); |
||||
newrec["Selectors"] = selectors; |
||||
const uint8_t *const rawip = (const uint8_t *)ms->second.lastOnlineAddress.rawIpData(); |
||||
switch(ms->second.lastOnlineAddress.ss_family) { |
||||
case AF_INET: |
||||
for(int j=0;j<4;++j) |
||||
ip.push_back((unsigned int)rawip[j]); |
||||
break; |
||||
case AF_INET6: |
||||
for(int j=0;j<16;++j) |
||||
ip.push_back((unsigned int)rawip[j]); |
||||
break; |
||||
default: |
||||
ip = tmp2; // should never happen since only IP transport is currently supported
|
||||
break; |
||||
} |
||||
newrec["Value"] = ip; |
||||
newrec["OwnerPrivate"] = _lfOwnerPrivate; |
||||
newrec["MaskingKey"] = maskingKey; |
||||
newrec["Timestamp"] = ms->second.lastOnlineTime; |
||||
newrec["PulseIfUnchanged"] = true; |
||||
try { |
||||
auto resp = htcli.Post("/makerecord",newrec.dump(),"application/json"); |
||||
if (resp) { |
||||
if (resp->status == 200) { |
||||
ms->second.lastOnlineDirty = false; |
||||
//printf("SET member online %.16llx %.10llx %s\n",ns->first,ms->first,resp->body.c_str());
|
||||
} else { |
||||
fprintf(stderr,"ERROR: LFDB: %d from node (create/update member online status): %s" ZT_EOL_S,resp->status,resp->body.c_str()); |
||||
} |
||||
} else { |
||||
fprintf(stderr,"ERROR: LFDB: node is offline" ZT_EOL_S); |
||||
} |
||||
} catch (std::exception &e) { |
||||
fprintf(stderr,"ERROR: LFDB: unexpected exception querying node (create/update member online status): %s" ZT_EOL_S,e.what()); |
||||
} catch ( ... ) { |
||||
fprintf(stderr,"ERROR: LFDB: unexpected exception querying node (create/update member online status): unknown exception" ZT_EOL_S); |
||||
} |
||||
} |
||||
|
||||
if (ms->second.dirty) { |
||||
nlohmann::json network,member; |
||||
if (get(ns->first,network,ms->first,member)) { |
||||
nlohmann::json newrec,selector0,selector1,selectors; |
||||
selector0["Name"] = networksSelectorName; |
||||
selector0["Ordinal"] = ns->first; |
||||
selector1["Name"] = "member"; |
||||
selector1["Ordinal"] = ms->first; |
||||
selectors.push_back(selector0); |
||||
selectors.push_back(selector1); |
||||
newrec["Selectors"] = selectors; |
||||
newrec["Value"] = member.dump(); |
||||
newrec["OwnerPrivate"] = _lfOwnerPrivate; |
||||
newrec["MaskingKey"] = maskingKey; |
||||
newrec["PulseIfUnchanged"] = true; |
||||
try { |
||||
auto resp = htcli.Post("/makerecord",newrec.dump(),"application/json"); |
||||
if (resp) { |
||||
if (resp->status == 200) { |
||||
ms->second.dirty = false; |
||||
//printf("SET member %.16llx %.10llx %s\n",ns->first,ms->first,resp->body.c_str());
|
||||
} else { |
||||
fprintf(stderr,"ERROR: LFDB: %d from node (create/update member): %s" ZT_EOL_S,resp->status,resp->body.c_str()); |
||||
} |
||||
} else { |
||||
fprintf(stderr,"ERROR: LFDB: node is offline" ZT_EOL_S); |
||||
} |
||||
} catch (std::exception &e) { |
||||
fprintf(stderr,"ERROR: LFDB: unexpected exception querying node (create/update member): %s" ZT_EOL_S,e.what()); |
||||
} catch ( ... ) { |
||||
fprintf(stderr,"ERROR: LFDB: unexpected exception querying node (create/update member): unknown exception" ZT_EOL_S); |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
try { |
||||
std::ostringstream query; |
||||
query << |
||||
"{" |
||||
"\"Ranges\":[{" |
||||
"\"Name\":\"" << networksSelectorName << "\"," |
||||
"\"Range\":[0,18446744073709551615]" |
||||
"}]," |
||||
"\"TimeRange\":[" << timeRangeStart << ",9223372036854775807]," |
||||
"\"MaskingKey\":\"" << maskingKey << "\"," |
||||
"\"Owners\":[\"" << _lfOwnerPublic << "\"]" |
||||
"}"; |
||||
auto resp = htcli.Post("/query",query.str(),"application/json"); |
||||
if (resp) { |
||||
if (resp->status == 200) { |
||||
nlohmann::json results(OSUtils::jsonParse(resp->body)); |
||||
if ((results.is_array())&&(results.size() > 0)) { |
||||
for(std::size_t ri=0;ri<results.size();++ri) { |
||||
nlohmann::json &rset = results[ri]; |
||||
if ((rset.is_array())&&(rset.size() > 0)) { |
||||
|
||||
nlohmann::json &result = rset[0]; |
||||
if (result.is_object()) { |
||||
nlohmann::json &record = result["Record"]; |
||||
if (record.is_object()) { |
||||
const std::string recordValue = result["Value"]; |
||||
//printf("GET network %s\n",recordValue.c_str());
|
||||
nlohmann::json network(OSUtils::jsonParse(recordValue)); |
||||
if (network.is_object()) { |
||||
const std::string idstr = network["id"]; |
||||
const uint64_t id = Utils::hexStrToU64(idstr.c_str()); |
||||
if ((id >> 24) == controllerAddressInt) { // sanity check
|
||||
|
||||
nlohmann::json oldNetwork; |
||||
if ((timeRangeStart > 0)&&(get(id,oldNetwork))) { |
||||
const uint64_t revision = network["revision"]; |
||||
const uint64_t prevRevision = oldNetwork["revision"]; |
||||
if (prevRevision < revision) { |
||||
_networkChanged(oldNetwork,network,timeRangeStart > 0); |
||||
} |
||||
} else { |
||||
nlohmann::json nullJson; |
||||
_networkChanged(nullJson,network,timeRangeStart > 0); |
||||
} |
||||
|
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
} |
||||
} |
||||
} |
||||
} else { |
||||
fprintf(stderr,"ERROR: LFDB: %d from node (check for network updates): %s" ZT_EOL_S,resp->status,resp->body.c_str()); |
||||
} |
||||
} else { |
||||
fprintf(stderr,"ERROR: LFDB: node is offline" ZT_EOL_S); |
||||
} |
||||
} catch (std::exception &e) { |
||||
fprintf(stderr,"ERROR: LFDB: unexpected exception querying node (check for network updates): %s" ZT_EOL_S,e.what()); |
||||
} catch ( ... ) { |
||||
fprintf(stderr,"ERROR: LFDB: unexpected exception querying node (check for network updates): unknown exception" ZT_EOL_S); |
||||
} |
||||
|
||||
try { |
||||
std::ostringstream query; |
||||
query << |
||||
"{" |
||||
"\"Ranges\":[{" |
||||
"\"Name\":\"" << networksSelectorName << "\"," |
||||
"\"Range\":[0,18446744073709551615]" |
||||
"},{" |
||||
"\"Name\":\"member\"," |
||||
"\"Range\":[0,18446744073709551615]" |
||||
"}]," |
||||
"\"TimeRange\":[" << timeRangeStart << ",9223372036854775807]," |
||||
"\"MaskingKey\":\"" << maskingKey << "\"," |
||||
"\"Owners\":[\"" << _lfOwnerPublic << "\"]" |
||||
"}"; |
||||
auto resp = htcli.Post("/query",query.str(),"application/json"); |
||||
if (resp) { |
||||
if (resp->status == 200) { |
||||
nlohmann::json results(OSUtils::jsonParse(resp->body)); |
||||
if ((results.is_array())&&(results.size() > 0)) { |
||||
for(std::size_t ri=0;ri<results.size();++ri) { |
||||
nlohmann::json &rset = results[ri]; |
||||
if ((rset.is_array())&&(rset.size() > 0)) { |
||||
|
||||
nlohmann::json &result = rset[0]; |
||||
if (result.is_object()) { |
||||
nlohmann::json &record = result["Record"]; |
||||
if (record.is_object()) { |
||||
const std::string recordValue = result["Value"]; |
||||
//printf("GET member %s\n",recordValue.c_str());
|
||||
nlohmann::json member(OSUtils::jsonParse(recordValue)); |
||||
if (member.is_object()) { |
||||
const std::string nwidstr = member["nwid"]; |
||||
const std::string idstr = member["id"]; |
||||
const uint64_t nwid = Utils::hexStrToU64(nwidstr.c_str()); |
||||
const uint64_t id = Utils::hexStrToU64(idstr.c_str()); |
||||
if ((id)&&((nwid >> 24) == controllerAddressInt)) { // sanity check
|
||||
|
||||
nlohmann::json network,oldMember; |
||||
if ((timeRangeStart > 0)&&(get(nwid,network,id,oldMember))) { |
||||
const uint64_t revision = member["revision"]; |
||||
const uint64_t prevRevision = oldMember["revision"]; |
||||
if (prevRevision < revision) |
||||
_memberChanged(oldMember,member,timeRangeStart > 0); |
||||
} else if (hasNetwork(nwid)) { |
||||
nlohmann::json nullJson; |
||||
_memberChanged(nullJson,member,timeRangeStart > 0); |
||||
} |
||||
|
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
} |
||||
} |
||||
} |
||||
} else { |
||||
fprintf(stderr,"ERROR: LFDB: %d from node (check for member updates): %s" ZT_EOL_S,resp->status,resp->body.c_str()); |
||||
} |
||||
} else { |
||||
fprintf(stderr,"ERROR: LFDB: node is offline" ZT_EOL_S); |
||||
} |
||||
} catch (std::exception &e) { |
||||
fprintf(stderr,"ERROR: LFDB: unexpected exception querying node (check for member updates): %s" ZT_EOL_S,e.what()); |
||||
} catch ( ... ) { |
||||
fprintf(stderr,"ERROR: LFDB: unexpected exception querying node (check for member updates): unknown exception" ZT_EOL_S); |
||||
} |
||||
|
||||
timeRangeStart = time(nullptr) - 120; // start next query 2m before now to avoid losing updates
|
||||
_ready.store(true); |
||||
|
||||
for(int k=0;k<4;++k) { // 2s delay between queries for remotely modified networks or members
|
||||
if (!_running.load()) |
||||
return; |
||||
std::this_thread::sleep_for(std::chrono::milliseconds(500)); |
||||
} |
||||
} |
||||
}); |
||||
} |
||||
|
||||
LFDB::~LFDB() |
||||
{ |
||||
_running.store(false); |
||||
_syncThread.join(); |
||||
} |
||||
|
||||
bool LFDB::waitForReady() |
||||
{ |
||||
while (!_ready.load()) { |
||||
std::this_thread::sleep_for(std::chrono::milliseconds(500)); |
||||
} |
||||
return true; |
||||
} |
||||
|
||||
bool LFDB::isReady() |
||||
{ |
||||
return (_ready.load()); |
||||
} |
||||
|
||||
bool LFDB::save(nlohmann::json &record,bool notifyListeners) |
||||
{ |
||||
bool modified = false; |
||||
const std::string objtype = record["objtype"]; |
||||
if (objtype == "network") { |
||||
const uint64_t nwid = OSUtils::jsonIntHex(record["id"],0ULL); |
||||
if (nwid) { |
||||
nlohmann::json old; |
||||
get(nwid,old); |
||||
if ((!old.is_object())||(!_compareRecords(old,record))) { |
||||
record["revision"] = OSUtils::jsonInt(record["revision"],0ULL) + 1ULL; |
||||
_networkChanged(old,record,notifyListeners); |
||||
{ |
||||
std::lock_guard<std::mutex> l(_state_l); |
||||
_state[nwid].dirty = true; |
||||
} |
||||
modified = true; |
||||
} |
||||
} |
||||
} else if (objtype == "member") { |
||||
const uint64_t nwid = OSUtils::jsonIntHex(record["nwid"],0ULL); |
||||
const uint64_t id = OSUtils::jsonIntHex(record["id"],0ULL); |
||||
if ((id)&&(nwid)) { |
||||
nlohmann::json network,old; |
||||
get(nwid,network,id,old); |
||||
if ((!old.is_object())||(!_compareRecords(old,record))) { |
||||
record["revision"] = OSUtils::jsonInt(record["revision"],0ULL) + 1ULL; |
||||
_memberChanged(old,record,notifyListeners); |
||||
{ |
||||
std::lock_guard<std::mutex> l(_state_l); |
||||
_state[nwid].members[id].dirty = true; |
||||
} |
||||
modified = true; |
||||
} |
||||
} |
||||
} |
||||
return modified; |
||||
} |
||||
|
||||
void LFDB::eraseNetwork(const uint64_t networkId) |
||||
{ |
||||
// TODO
|
||||
} |
||||
|
||||
void LFDB::eraseMember(const uint64_t networkId,const uint64_t memberId) |
||||
{ |
||||
// TODO
|
||||
} |
||||
|
||||
void LFDB::nodeIsOnline(const uint64_t networkId,const uint64_t memberId,const InetAddress &physicalAddress) |
||||
{ |
||||
std::lock_guard<std::mutex> l(_state_l); |
||||
auto nw = _state.find(networkId); |
||||
if (nw != _state.end()) { |
||||
auto m = nw->second.members.find(memberId); |
||||
if (m != nw->second.members.end()) { |
||||
m->second.lastOnlineTime = OSUtils::now(); |
||||
if (physicalAddress) |
||||
m->second.lastOnlineAddress = physicalAddress; |
||||
m->second.lastOnlineDirty = true; |
||||
} |
||||
} |
||||
} |
||||
|
||||
} // namespace ZeroTier
|
||||
@ -0,0 +1,89 @@
|
||||
/*
|
||||
* Copyright (c)2019 ZeroTier, Inc. |
||||
* |
||||
* Use of this software is governed by the Business Source License included |
||||
* in the LICENSE.TXT file in the project's root directory. |
||||
* |
||||
* Change Date: 2023-01-01 |
||||
* |
||||
* On the date above, in accordance with the Business Source License, use |
||||
* of this software will be governed by version 2.0 of the Apache License. |
||||
*/ |
||||
/****/ |
||||
|
||||
#ifndef ZT_CONTROLLER_LFDB_HPP |
||||
#define ZT_CONTROLLER_LFDB_HPP |
||||
|
||||
#include "DB.hpp" |
||||
|
||||
#include <mutex> |
||||
#include <string> |
||||
#include <unordered_map> |
||||
#include <atomic> |
||||
|
||||
namespace ZeroTier { |
||||
|
||||
/**
|
||||
* DB implementation for controller that stores data in LF |
||||
*/ |
||||
class LFDB : public DB |
||||
{ |
||||
public: |
||||
/**
|
||||
* @param myId This controller's identity |
||||
* @param path Base path for ZeroTier node itself |
||||
* @param lfOwnerPrivate LF owner private in PEM format |
||||
* @param lfOwnerPublic LF owner public in @base62 format |
||||
* @param lfNodeHost LF node host |
||||
* @param lfNodePort LF node http (not https) port |
||||
* @param storeOnlineState If true, store online/offline state and IP info in LF (a lot of data, only for private networks!) |
||||
*/ |
||||
LFDB(const Identity &myId,const char *path,const char *lfOwnerPrivate,const char *lfOwnerPublic,const char *lfNodeHost,int lfNodePort,bool storeOnlineState); |
||||
virtual ~LFDB(); |
||||
|
||||
virtual bool waitForReady(); |
||||
virtual bool isReady(); |
||||
virtual bool save(nlohmann::json &record,bool notifyListeners); |
||||
virtual void eraseNetwork(const uint64_t networkId); |
||||
virtual void eraseMember(const uint64_t networkId,const uint64_t memberId); |
||||
virtual void nodeIsOnline(const uint64_t networkId,const uint64_t memberId,const InetAddress &physicalAddress); |
||||
|
||||
protected: |
||||
const Identity _myId; |
||||
|
||||
std::string _lfOwnerPrivate,_lfOwnerPublic; |
||||
std::string _lfNodeHost; |
||||
int _lfNodePort; |
||||
|
||||
struct _MemberState |
||||
{ |
||||
_MemberState() : |
||||
lastOnlineAddress(), |
||||
lastOnlineTime(0), |
||||
dirty(false), |
||||
lastOnlineDirty(false) {} |
||||
InetAddress lastOnlineAddress; |
||||
int64_t lastOnlineTime; |
||||
bool dirty; |
||||
bool lastOnlineDirty; |
||||
}; |
||||
struct _NetworkState |
||||
{ |
||||
_NetworkState() : |
||||
members(), |
||||
dirty(false) {} |
||||
std::unordered_map<uint64_t,_MemberState> members; |
||||
bool dirty; |
||||
}; |
||||
std::unordered_map<uint64_t,_NetworkState> _state; |
||||
std::mutex _state_l; |
||||
|
||||
std::atomic_bool _running; |
||||
std::atomic_bool _ready; |
||||
std::thread _syncThread; |
||||
bool _storeOnlineState; |
||||
}; |
||||
|
||||
} // namespace ZeroTier
|
||||
|
||||
#endif |
||||
@ -1,19 +0,0 @@
|
||||
# Dockerfile for ZeroTier Central Controllers |
||||
FROM centos:7 |
||||
MAINTAINER Adam Ierymekno <adam.ierymenko@zerotier.com>, Grant Limberg <grant.limberg@zerotier.com> |
||||
|
||||
RUN yum update -y |
||||
RUN yum install -y https://download.postgresql.org/pub/repos/yum/10/redhat/rhel-7-x86_64/pgdg-centos10-10-2.noarch.rpm |
||||
RUN yum install -y postgresql10 libpqxx-devel |
||||
|
||||
RUN yum -y install epel-release && yum -y update && yum clean all |
||||
RUN yum -y install clang jemalloc jemalloc-devel |
||||
|
||||
|
||||
ADD zerotier-one /usr/local/bin/zerotier-one |
||||
RUN chmod a+x /usr/local/bin/zerotier-one |
||||
|
||||
ADD docker/main.sh / |
||||
RUN chmod a+x /main.sh |
||||
|
||||
ENTRYPOINT /main.sh |
||||
@ -0,0 +1,36 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?> |
||||
<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd"> |
||||
<plist version="1.0"> |
||||
<dict> |
||||
<key>CFBundleDevelopmentRegion</key> |
||||
<string>English</string> |
||||
<key>CFBundleExecutable</key> |
||||
<string>tap</string> |
||||
<key>CFBundleIdentifier</key> |
||||
<string>com.zerotier.tap</string> |
||||
<key>CFBundleInfoDictionaryVersion</key> |
||||
<string>6.0</string> |
||||
<key>CFBundleName</key> |
||||
<string>tap</string> |
||||
<key>CFBundlePackageType</key> |
||||
<string>KEXT</string> |
||||
<key>CFBundleShortVersionString</key> |
||||
<string>20150118</string> |
||||
<key>CFBundleSignature</key> |
||||
<string>????</string> |
||||
<key>CFBundleVersion</key> |
||||
<string>1.0</string> |
||||
<key>OSBundleLibraries</key> |
||||
<dict> |
||||
<key>com.apple.kpi.mach</key> |
||||
<string>8.0</string> |
||||
<key>com.apple.kpi.bsd</key> |
||||
<string>8.0</string> |
||||
<key>com.apple.kpi.libkern</key> |
||||
<string>8.0</string> |
||||
<key>com.apple.kpi.unsupported</key> |
||||
<string>8.0</string> |
||||
</dict> |
||||
</dict> |
||||
</plist> |
||||
|
||||
Binary file not shown.
@ -0,0 +1,105 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?> |
||||
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd"> |
||||
<plist version="1.0"> |
||||
<dict> |
||||
<key>files</key> |
||||
<dict/> |
||||
<key>files2</key> |
||||
<dict/> |
||||
<key>rules</key> |
||||
<dict> |
||||
<key>^Resources/</key> |
||||
<true/> |
||||
<key>^Resources/.*\.lproj/</key> |
||||
<dict> |
||||
<key>optional</key> |
||||
<true/> |
||||
<key>weight</key> |
||||
<real>1000</real> |
||||
</dict> |
||||
<key>^Resources/.*\.lproj/locversion.plist$</key> |
||||
<dict> |
||||
<key>omit</key> |
||||
<true/> |
||||
<key>weight</key> |
||||
<real>1100</real> |
||||
</dict> |
||||
<key>^version.plist$</key> |
||||
<true/> |
||||
</dict> |
||||
<key>rules2</key> |
||||
<dict> |
||||
<key>.*\.dSYM($|/)</key> |
||||
<dict> |
||||
<key>weight</key> |
||||
<real>11</real> |
||||
</dict> |
||||
<key>^(.*/)?\.DS_Store$</key> |
||||
<dict> |
||||
<key>omit</key> |
||||
<true/> |
||||
<key>weight</key> |
||||
<real>2000</real> |
||||
</dict> |
||||
<key>^(Frameworks|SharedFrameworks|PlugIns|Plug-ins|XPCServices|Helpers|MacOS|Library/(Automator|Spotlight|LoginItems))/</key> |
||||
<dict> |
||||
<key>nested</key> |
||||
<true/> |
||||
<key>weight</key> |
||||
<real>10</real> |
||||
</dict> |
||||
<key>^.*</key> |
||||
<true/> |
||||
<key>^Info\.plist$</key> |
||||
<dict> |
||||
<key>omit</key> |
||||
<true/> |
||||
<key>weight</key> |
||||
<real>20</real> |
||||
</dict> |
||||
<key>^PkgInfo$</key> |
||||
<dict> |
||||
<key>omit</key> |
||||
<true/> |
||||
<key>weight</key> |
||||
<real>20</real> |
||||
</dict> |
||||
<key>^Resources/</key> |
||||
<dict> |
||||
<key>weight</key> |
||||
<real>20</real> |
||||
</dict> |
||||
<key>^Resources/.*\.lproj/</key> |
||||
<dict> |
||||
<key>optional</key> |
||||
<true/> |
||||
<key>weight</key> |
||||
<real>1000</real> |
||||
</dict> |
||||
<key>^Resources/.*\.lproj/locversion.plist$</key> |
||||
<dict> |
||||
<key>omit</key> |
||||
<true/> |
||||
<key>weight</key> |
||||
<real>1100</real> |
||||
</dict> |
||||
<key>^[^/]+$</key> |
||||
<dict> |
||||
<key>nested</key> |
||||
<true/> |
||||
<key>weight</key> |
||||
<real>10</real> |
||||
</dict> |
||||
<key>^embedded\.provisionprofile$</key> |
||||
<dict> |
||||
<key>weight</key> |
||||
<real>20</real> |
||||
</dict> |
||||
<key>^version\.plist$</key> |
||||
<dict> |
||||
<key>weight</key> |
||||
<real>20</real> |
||||
</dict> |
||||
</dict> |
||||
</dict> |
||||
</plist> |
||||
@ -0,0 +1,26 @@
|
||||
# Dockerfile for ZeroTier Central Controllers |
||||
FROM centos:7 as builder |
||||
MAINTAINER Adam Ierymekno <adam.ierymenko@zerotier.com>, Grant Limberg <grant.limberg@zerotier.com> |
||||
|
||||
ARG git_branch=master |
||||
|
||||
RUN yum update -y |
||||
RUN yum install -y https://download.postgresql.org/pub/repos/yum/10/redhat/rhel-7-x86_64/pgdg-centos10-10-2.noarch.rpm |
||||
RUN yum -y install epel-release && yum -y update && yum clean all |
||||
RUN yum groupinstall -y "Development Tools" |
||||
RUN yum install -y bash postgresql10 postgresql10-devel libpqxx-devel glibc-static libstdc++-static clang jemalloc jemalloc-devel |
||||
|
||||
RUN git clone http://git.int.zerotier.com/zerotier/ZeroTierOne.git |
||||
RUN if [ "$git_branch" != "master" ]; then cd ZeroTierOne && git checkout -b $git_branch origin/$git_branch; fi |
||||
RUN ldconfig |
||||
RUN cd ZeroTierOne && make central-controller |
||||
|
||||
FROM centos:7 |
||||
|
||||
COPY --from=builder /ZeroTierOne/zerotier-one /usr/local/bin/zerotier-one |
||||
RUN chmod a+x /usr/local/bin/zerotier-one |
||||
|
||||
ADD ext/central-controller-docker/main.sh / |
||||
RUN chmod a+x /main.sh |
||||
|
||||
ENTRYPOINT /main.sh |
||||
@ -0,0 +1,3 @@
|
||||
# ZeroTier Central Controller Docker Image |
||||
|
||||
Dockerfile & startup script for use with [ZeroTier Central](https://my.zerotier.com). Not intended for public use. |
||||
@ -1,4 +1,4 @@
|
||||
#!/usr/bin/env bash |
||||
#!/bin/bash |
||||
|
||||
if [ -z "$ZT_IDENTITY_PATH" ]; then |
||||
echo '*** FAILED: ZT_IDENTITY_PATH environment variable is not defined' |
||||
@ -0,0 +1,22 @@
|
||||
The MIT License (MIT) |
||||
|
||||
Copyright (c) 2017 yhirose |
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy |
||||
of this software and associated documentation files (the "Software"), to deal |
||||
in the Software without restriction, including without limitation the rights |
||||
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
||||
copies of the Software, and to permit persons to whom the Software is |
||||
furnished to do so, subject to the following conditions: |
||||
|
||||
The above copyright notice and this permission notice shall be included in all |
||||
copies or substantial portions of the Software. |
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
||||
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
||||
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
||||
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
||||
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
||||
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
||||
SOFTWARE. |
||||
|
||||
@ -0,0 +1,259 @@
|
||||
cpp-httplib |
||||
=========== |
||||
|
||||
[](https://travis-ci.org/yhirose/cpp-httplib) |
||||
[](https://ci.appveyor.com/project/yhirose/cpp-httplib) |
||||
|
||||
A C++ header-only cross platform HTTP/HTTPS library. |
||||
|
||||
It's extremely easy to setup. Just include **httplib.h** file in your code! |
||||
|
||||
Inspired by [Sinatra](http://www.sinatrarb.com/) and [express](https://github.com/visionmedia/express). |
||||
|
||||
Server Example |
||||
-------------- |
||||
|
||||
```c++ |
||||
#include <httplib.h> |
||||
|
||||
int main(void) |
||||
{ |
||||
using namespace httplib; |
||||
|
||||
Server svr; |
||||
|
||||
svr.Get("/hi", [](const Request& req, Response& res) { |
||||
res.set_content("Hello World!", "text/plain"); |
||||
}); |
||||
|
||||
svr.Get(R"(/numbers/(\d+))", [&](const Request& req, Response& res) { |
||||
auto numbers = req.matches[1]; |
||||
res.set_content(numbers, "text/plain"); |
||||
}); |
||||
|
||||
svr.listen("localhost", 1234); |
||||
} |
||||
``` |
||||
|
||||
`Post`, `Put`, `Delete` and `Options` methods are also supported. |
||||
|
||||
### Bind a socket to multiple interfaces and any available port |
||||
|
||||
```cpp |
||||
int port = svr.bind_to_any_port("0.0.0.0"); |
||||
svr.listen_after_bind(); |
||||
``` |
||||
|
||||
### Method Chain |
||||
|
||||
```cpp |
||||
svr.Get("/get", [](const auto& req, auto& res) { |
||||
res.set_content("get", "text/plain"); |
||||
}) |
||||
.Post("/post", [](const auto& req, auto& res) { |
||||
res.set_content(req.body(), "text/plain"); |
||||
}) |
||||
.listen("localhost", 1234); |
||||
``` |
||||
|
||||
### Static File Server |
||||
|
||||
```cpp |
||||
svr.set_base_dir("./www"); |
||||
``` |
||||
|
||||
### Logging |
||||
|
||||
```cpp |
||||
svr.set_logger([](const auto& req, const auto& res) { |
||||
your_logger(req, res); |
||||
}); |
||||
``` |
||||
|
||||
### Error Handler |
||||
|
||||
```cpp |
||||
svr.set_error_handler([](const auto& req, auto& res) { |
||||
const char* fmt = "<p>Error Status: <span style='color:red;'>%d</span></p>"; |
||||
char buf[BUFSIZ]; |
||||
snprintf(buf, sizeof(buf), fmt, res.status); |
||||
res.set_content(buf, "text/html"); |
||||
}); |
||||
``` |
||||
|
||||
### 'multipart/form-data' POST data |
||||
|
||||
```cpp |
||||
svr.Post("/multipart", [&](const auto& req, auto& res) { |
||||
auto size = req.files.size(); |
||||
auto ret = req.has_file("name1")); |
||||
const auto& file = req.get_file_value("name1"); |
||||
// file.filename; |
||||
// file.content_type; |
||||
auto body = req.body.substr(file.offset, file.length)); |
||||
}) |
||||
``` |
||||
|
||||
Client Example |
||||
-------------- |
||||
|
||||
### GET |
||||
|
||||
```c++ |
||||
#include <httplib.h> |
||||
#include <iostream> |
||||
|
||||
int main(void) |
||||
{ |
||||
httplib::Client cli("localhost", 1234); |
||||
|
||||
auto res = cli.Get("/hi"); |
||||
if (res && res->status == 200) { |
||||
std::cout << res->body << std::endl; |
||||
} |
||||
} |
||||
``` |
||||
|
||||
### GET with Content Receiver |
||||
|
||||
```c++ |
||||
std::string body; |
||||
auto res = cli.Get("/large-data", [&](const char *data, size_t len) { |
||||
body.append(data, len); |
||||
}); |
||||
assert(res->body.empty()); |
||||
``` |
||||
|
||||
### POST |
||||
|
||||
```c++ |
||||
res = cli.Post("/post", "text", "text/plain"); |
||||
res = cli.Post("/person", "name=john1¬e=coder", "application/x-www-form-urlencoded"); |
||||
``` |
||||
|
||||
### POST with parameters |
||||
|
||||
```c++ |
||||
httplib::Params params; |
||||
params.emplace("name", "john"); |
||||
params.emplace("note", "coder"); |
||||
|
||||
auto res = cli.Post("/post", params); |
||||
``` |
||||
or |
||||
|
||||
```c++ |
||||
httplib::Params params{ |
||||
{ "name", "john" }, |
||||
{ "note", "coder" } |
||||
}; |
||||
|
||||
auto res = cli.Post("/post", params); |
||||
``` |
||||
|
||||
### PUT |
||||
|
||||
```c++ |
||||
res = cli.Put("/resource/foo", "text", "text/plain"); |
||||
``` |
||||
|
||||
### DELETE |
||||
|
||||
```c++ |
||||
res = cli.Delete("/resource/foo"); |
||||
``` |
||||
|
||||
### OPTIONS |
||||
|
||||
```c++ |
||||
res = cli.Options("*"); |
||||
res = cli.Options("/resource/foo"); |
||||
``` |
||||
|
||||
### Connection Timeout |
||||
|
||||
```c++ |
||||
httplib::Client cli("localhost", 8080, 5); // timeouts in 5 seconds |
||||
``` |
||||
### With Progress Callback |
||||
|
||||
```cpp |
||||
httplib::Client client(url, port); |
||||
|
||||
// prints: 0 / 000 bytes => 50% complete |
||||
std::shared_ptr<httplib::Response> res = |
||||
cli.Get("/", [](uint64_t len, uint64_t total) { |
||||
printf("%lld / %lld bytes => %d%% complete\n", |
||||
len, total, |
||||
(int)((len/total)*100)); |
||||
return true; // return 'false' if you want to cancel the request. |
||||
} |
||||
); |
||||
``` |
||||
|
||||
 |
||||
|
||||
This feature was contributed by [underscorediscovery](https://github.com/yhirose/cpp-httplib/pull/23). |
||||
|
||||
### Basic Authentication |
||||
|
||||
```cpp |
||||
httplib::Client cli("httplib.org"); |
||||
|
||||
auto res = cli.Get("/basic-auth/hello/world", { |
||||
httplib::make_basic_authentication_header("hello", "world") |
||||
}); |
||||
// res->status should be 200 |
||||
// res->body should be "{\n \"authenticated\": true, \n \"user\": \"hello\"\n}\n". |
||||
``` |
||||
|
||||
### Range |
||||
|
||||
```cpp |
||||
httplib::Client cli("httpbin.org"); |
||||
|
||||
auto res = cli.Get("/range/32", { |
||||
httplib::make_range_header(1, 10) // 'Range: bytes=1-10' |
||||
}); |
||||
// res->status should be 206. |
||||
// res->body should be "bcdefghijk". |
||||
``` |
||||
|
||||
OpenSSL Support |
||||
--------------- |
||||
|
||||
SSL support is available with `CPPHTTPLIB_OPENSSL_SUPPORT`. `libssl` and `libcrypto` should be linked. |
||||
|
||||
```c++ |
||||
#define CPPHTTPLIB_OPENSSL_SUPPORT |
||||
|
||||
SSLServer svr("./cert.pem", "./key.pem"); |
||||
|
||||
SSLClient cli("localhost", 8080); |
||||
cli.set_ca_cert_path("./ca-bundle.crt"); |
||||
cli.enable_server_certificate_verification(true); |
||||
``` |
||||
|
||||
Zlib Support |
||||
------------ |
||||
|
||||
'gzip' compression is available with `CPPHTTPLIB_ZLIB_SUPPORT`. |
||||
|
||||
The server applies gzip compression to the following MIME type contents: |
||||
|
||||
* all text types |
||||
* image/svg+xml |
||||
* application/javascript |
||||
* application/json |
||||
* application/xml |
||||
* application/xhtml+xml |
||||
|
||||
NOTE |
||||
---- |
||||
|
||||
g++ 4.8 cannot build this library since `<regex>` in g++4.8 is [broken](https://stackoverflow.com/questions/12530406/is-gcc-4-8-or-earlier-buggy-about-regular-expressions). |
||||
|
||||
License |
||||
------- |
||||
|
||||
MIT license (© 2019 Yuji Hirose) |
||||
@ -1,30 +1,28 @@
|
||||
FROM debian:stretch as builder |
||||
## NOTE: to retain configuration; mount a Docker volume, or use a bind-mount, on /var/lib/zerotier-one |
||||
|
||||
FROM debian:buster-slim as builder |
||||
|
||||
## Supports x86_64, x86, arm, and arm64 |
||||
|
||||
RUN apt-get update && apt-get install -y curl gnupg |
||||
RUN apt-key adv --keyserver ha.pool.sks-keyservers.net --recv-keys 0x1657198823e52a61 && \ |
||||
echo "deb http://download.zerotier.com/debian/stretch stretch main" > /etc/apt/sources.list.d/zerotier.list |
||||
RUN apt-get update && apt-get install -y zerotier-one=1.2.12 |
||||
|
||||
FROM alpine:latest |
||||
MAINTAINER Adam Ierymenko <adam.ierymenko@zerotier.com> |
||||
echo "deb http://download.zerotier.com/debian/buster buster main" > /etc/apt/sources.list.d/zerotier.list |
||||
RUN apt-get update && apt-get install -y zerotier-one=1.4.4 |
||||
COPY ext/installfiles/linux/zerotier-containerized/main.sh /var/lib/zerotier-one/main.sh |
||||
|
||||
LABEL version="1.2.12" |
||||
FROM debian:buster-slim |
||||
LABEL version="1.4.4" |
||||
LABEL description="Containerized ZeroTier One for use on CoreOS or other Docker-only Linux hosts." |
||||
|
||||
# Uncomment to build in container |
||||
#RUN apk add --update alpine-sdk linux-headers |
||||
|
||||
RUN apk add --update libgcc libstdc++ |
||||
# ZeroTier relies on UDP port 9993 |
||||
EXPOSE 9993/udp |
||||
|
||||
RUN mkdir -p /var/lib/zerotier-one |
||||
|
||||
COPY --from=builder /var/lib/zerotier-one/zerotier-cli /usr/sbin/zerotier-cli |
||||
COPY --from=builder /var/lib/zerotier-one/zerotier-idtool /usr/sbin/zerotier-idtool |
||||
COPY --from=builder /usr/sbin/zerotier-cli /usr/sbin/zerotier-cli |
||||
COPY --from=builder /usr/sbin/zerotier-idtool /usr/sbin/zerotier-idtool |
||||
COPY --from=builder /usr/sbin/zerotier-one /usr/sbin/zerotier-one |
||||
COPY --from=builder /var/lib/zerotier-one/main.sh /main.sh |
||||
|
||||
ADD main.sh / |
||||
RUN chmod 0755 /main.sh |
||||
ENTRYPOINT ["/main.sh"] |
||||
CMD ["zerotier-one"] |
||||
File diff suppressed because it is too large
Load Diff
@ -1,11 +0,0 @@
|
||||
From: https://raw.githubusercontent.com/zerotier/ZeroTierOne/master/COPYING |
||||
|
||||
LICENSE |
||||
|
||||
ZeroTier One 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. |
||||
|
||||
See the file ‘LICENSE.GPL-3’ for the text of the GNU GPL version 3. |
||||
If that file is not present, see <http://www.gnu.org/licenses/>. |
||||
@ -1,5 +0,0 @@
|
||||
VERIFICATION |
||||
Verification is intended to assist the Chocolatey moderators and community |
||||
in verifying that this package's contents are trustworthy. |
||||
|
||||
Our MSI installer should be signed by ZeroTier, Inc. using a certificate from DigiCert. |
||||
@ -1,8 +0,0 @@
|
||||
$packageName = 'zerotier-one' |
||||
$installerType = 'msi' |
||||
$url = 'https://download.zerotier.com/RELEASES/1.2.4/dist/ZeroTier%20One.msi' |
||||
$url64 = 'https://download.zerotier.com/RELEASES/1.2.4/dist/ZeroTier%20One.msi' |
||||
$silentArgs = '/quiet' |
||||
$validExitCodes = @(0,3010) |
||||
|
||||
Install-ChocolateyPackage $packageName $installerType $silentArgs $url $url64 -validExitCodes $validExitCodes |
||||
@ -1,30 +0,0 @@
|
||||
$ErrorActionPreference = 'Stop'; |
||||
|
||||
$packageName = 'zerotier-one' |
||||
$softwareName = 'ZeroTier One*' |
||||
$installerType = 'MSI' |
||||
|
||||
$silentArgs = '/qn /norestart' |
||||
$validExitCodes = @(0, 3010, 1605, 1614, 1641) |
||||
$uninstalled = $false |
||||
|
||||
[array]$key = Get-UninstallRegistryKey -SoftwareName $softwareName |
||||
|
||||
if ($key.Count -eq 1) { |
||||
$key | % { |
||||
$silentArgs = "$($_.PSChildName) $silentArgs" |
||||
$file = '' |
||||
Uninstall-ChocolateyPackage -PackageName $packageName ` |
||||
-FileType $installerType ` |
||||
-SilentArgs "$silentArgs" ` |
||||
-ValidExitCodes $validExitCodes ` |
||||
-File "$file" |
||||
} |
||||
} elseif ($key.Count -eq 0) { |
||||
Write-Warning "$packageName has already been uninstalled by other means." |
||||
} elseif ($key.Count -gt 1) { |
||||
Write-Warning "$key.Count matches found!" |
||||
Write-Warning "To prevent accidental data loss, no programs will be uninstalled." |
||||
Write-Warning "Please alert package maintainer the following keys were matched:" |
||||
$key | % {Write-Warning "- $_.DisplayName"} |
||||
} |
||||
@ -1,76 +0,0 @@
|
||||
<?xml version="1.0" encoding="utf-8"?> |
||||
<!-- Read this before creating packages: https://github.com/chocolatey/chocolatey/wiki/CreatePackages --> |
||||
<!-- It is especially important to read the above link to understand additional requirements when publishing packages to the community feed aka dot org (https://chocolatey.org/packages). --> |
||||
|
||||
<!-- Test your packages in a test environment: https://github.com/chocolatey/chocolatey-test-environment --> |
||||
|
||||
<!-- |
||||
This is a nuspec. It mostly adheres to https://docs.nuget.org/create/Nuspec-Reference. Chocolatey uses a special version of NuGet.Core that allows us to do more than was initially possible. As such there are certain things to be aware of: |
||||
|
||||
* the package xmlns schema url may cause issues with nuget.exe |
||||
* Any of the following elements can ONLY be used by choco tools - projectSourceUrl, docsUrl, mailingListUrl, bugTrackerUrl, packageSourceUrl, provides, conflicts, replaces |
||||
* nuget.exe can still install packages with those elements but they are ignored. Any authoring tools or commands will error on those elements |
||||
--> |
||||
|
||||
<!-- You can embed software files directly into packages, as long as you are not bound by distribution rights. --> |
||||
<!-- * If you are an organization making private packages, you probably have no issues here --> |
||||
<!-- * If you are releasing to the community feed, you need to consider distribution rights. --> |
||||
<!-- Do not remove this test for UTF-8: if “Ω” doesn’t appear as greek uppercase omega letter enclosed in quotation marks, you should use an editor that supports UTF-8, not this one. --> |
||||
<package xmlns="http://schemas.microsoft.com/packaging/2015/06/nuspec.xsd"> |
||||
<metadata> |
||||
<!-- == PACKAGE SPECIFIC SECTION == --> |
||||
<!-- This section is about this package, although id and version have ties back to the software --> |
||||
<!-- id is lowercase and if you want a good separator for words, use '-', not '.'. Dots are only acceptable as suffixes for certain types of packages, e.g. .install, .portable, .extension, .template --> |
||||
<!-- If the software is cross-platform, attempt to use the same id as the debian/rpm package(s) if possible. --> |
||||
<id>zerotier-one</id> |
||||
<!-- version should MATCH as closely as possible with the underlying software --> |
||||
<!-- Is the version a prerelease of a version? https://docs.nuget.org/create/versioning#creating-prerelease-packages --> |
||||
<!-- Note that unstable versions like 0.0.1 can be considered a released version, but it's possible that one can release a 0.0.1-beta before you release a 0.0.1 version. If the version number is final, that is considered a released version and not a prerelease. --> |
||||
<version>1.2.12</version> |
||||
<!-- <packageSourceUrl>Where is this Chocolatey package located (think GitHub)? packageSourceUrl is highly recommended for the community feed</packageSourceUrl>--> |
||||
<!-- owners is a poor name for maintainers of the package. It sticks around by this name for compatibility reasons. It basically means you. --> |
||||
<!--<owners>ZeroTier, Inc.</owners>--> |
||||
<!-- ============================== --> |
||||
|
||||
<!-- == SOFTWARE SPECIFIC SECTION == --> |
||||
<!-- This section is about the software itself --> |
||||
<title>zerotier-one (Install)</title> |
||||
<authors>ZeroTier, Inc.</authors> |
||||
<!-- projectUrl is required for the community feed --> |
||||
<projectUrl>https://www.zerotier.com/</projectUrl> |
||||
<!--<iconUrl>https://www.zerotier.com/img/ZeroTierIcon.png</iconUrl>--> |
||||
<!-- <copyright>2011-2016 ZeroTier, Inc.</copyright> --> |
||||
<!-- If there is a license Url available, it is is required for the community feed --> |
||||
<!-- <licenseUrl>https://raw.githubusercontent.com/zerotier/ZeroTierOne/master/COPYING</licenseUrl> |
||||
<requireLicenseAcceptance>true</requireLicenseAcceptance>--> |
||||
<!--<projectSourceUrl>https://github.com/zerotier/ZeroTierOne</projectSourceUrl>--> |
||||
<!--<docsUrl>https://www.zerotier.com/</docsUrl>--> |
||||
<!--<mailingListUrl></mailingListUrl>--> |
||||
<!--<bugTrackerUrl>https://github.com/zerotier/ZeroTierOne/issues</bugTrackerUrl>--> |
||||
<tags>zerotier-one admin</tags> |
||||
<summary>ZeroTier One Virtual Network Endpoint for Windows</summary> |
||||
<description>ZeroTier is a smart switch for Earth with VLAN capability. See https://www.zerotier.com/ for more information.</description> |
||||
<!-- <releaseNotes>__REPLACE_OR_REMOVE__MarkDown_Okay</releaseNotes> --> |
||||
<!-- =============================== --> |
||||
|
||||
<!-- Specifying dependencies and version ranges? https://docs.nuget.org/create/versioning#specifying-version-ranges-in-.nuspec-files --> |
||||
<!--<dependencies> |
||||
<dependency id="" version="__MINIMUM_VERSION__" /> |
||||
<dependency id="" version="[__EXACT_VERSION__]" /> |
||||
<dependency id="" version="[_MIN_VERSION_INCLUSIVE, MAX_VERSION_INCLUSIVE]" /> |
||||
<dependency id="" version="[_MIN_VERSION_INCLUSIVE, MAX_VERSION_EXCLUSIVE)" /> |
||||
<dependency id="" /> |
||||
<dependency id="chocolatey-uninstall.extension" /> |
||||
</dependencies>--> |
||||
<!-- chocolatey-uninstall.extension - If supporting 0.9.9.x (or below) and including a chocolateyUninstall.ps1 file to uninstall an EXE/MSI, you probably want to include chocolatey-uninstall.extension as a dependency. Please verify whether you are using a helper function from that package. --> |
||||
|
||||
<!--<provides>NOT YET IMPLEMENTED</provides>--> |
||||
<!--<conflicts>NOT YET IMPLEMENTED</conflicts>--> |
||||
<!--<replaces>NOT YET IMPLEMENTED</replaces>--> |
||||
</metadata> |
||||
<files> |
||||
<!-- this section controls what actually gets packaged into the Chocolatey package --> |
||||
<file src="tools\**" target="tools" /> |
||||
<!--Building from Linux? You may need this instead: <file src="tools/**" target="tools" />--> |
||||
</files> |
||||
</package> |
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
@ -0,0 +1,68 @@
|
||||
/** \file */ |
||||
/*
|
||||
* Portions created by Alan Antonuk are Copyright (c) 2013-2014 Alan Antonuk. |
||||
* All Rights Reserved. |
||||
* |
||||
* Portions created by Michael Steinert are Copyright (c) 2012-2013 Michael |
||||
* Steinert. All Rights Reserved. |
||||
* |
||||
* Permission is hereby granted, free of charge, to any person obtaining a |
||||
* copy of this software and associated documentation files (the "Software"), |
||||
* to deal in the Software without restriction, including without limitation |
||||
* the rights to use, copy, modify, merge, publish, distribute, sublicense, |
||||
* and/or sell copies of the Software, and to permit persons to whom the |
||||
* Software is furnished to do so, subject to the following conditions: |
||||
* |
||||
* The above copyright notice and this permission notice shall be included in |
||||
* all copies or substantial portions of the Software. |
||||
* |
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
||||
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
||||
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
||||
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |
||||
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER |
||||
* DEALINGS IN THE SOFTWARE. |
||||
*/ |
||||
|
||||
/**
|
||||
* A TCP socket connection. |
||||
*/ |
||||
|
||||
#ifndef AMQP_TCP_SOCKET_H |
||||
#define AMQP_TCP_SOCKET_H |
||||
|
||||
#include <amqp.h> |
||||
|
||||
AMQP_BEGIN_DECLS |
||||
|
||||
/**
|
||||
* Create a new TCP socket. |
||||
* |
||||
* Call amqp_connection_close() to release socket resources. |
||||
* |
||||
* \return A new socket object or NULL if an error occurred. |
||||
* |
||||
* \since v0.4.0 |
||||
*/ |
||||
AMQP_PUBLIC_FUNCTION |
||||
amqp_socket_t *AMQP_CALL amqp_tcp_socket_new(amqp_connection_state_t state); |
||||
|
||||
/**
|
||||
* Assign an open file descriptor to a socket object. |
||||
* |
||||
* This function must not be used in conjunction with amqp_socket_open(), i.e. |
||||
* the socket connection should already be open(2) when this function is |
||||
* called. |
||||
* |
||||
* \param [in,out] self A TCP socket object. |
||||
* \param [in] sockfd An open socket descriptor. |
||||
* |
||||
* \since v0.4.0 |
||||
*/ |
||||
AMQP_PUBLIC_FUNCTION |
||||
void AMQP_CALL amqp_tcp_socket_set_sockfd(amqp_socket_t *self, int sockfd); |
||||
|
||||
AMQP_END_DECLS |
||||
|
||||
#endif /* AMQP_TCP_SOCKET_H */ |
||||
Binary file not shown.
@ -0,0 +1,8 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?> |
||||
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd"> |
||||
<plist version="1.0"> |
||||
<dict> |
||||
<key>IDEDidComputeMac32BitWarning</key> |
||||
<true/> |
||||
</dict> |
||||
</plist> |
||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in new issue