ExternalVendorCode/ZeroTierOne
1
0
Fork 0
mirror of https://github.com/zerotier/ZeroTierOne.git synced 2025-02-20 09:46:13 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Merge branch 'dev' into netbsd-support

Browse Source
This commit is contained in:
Adam Ierymenko 2018-04-25 06:39:02 -07:00 committed by GitHub
commit 42ec780a6f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
682 changed files with 119343 additions and 39556 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

41
.gitignore vendored
View File

@ -9,6 +9,8 @@
.DS_Store
.Apple*
Thumbs.db
@eaDir
._*
# Windows build droppings
/windows/ZeroTierOne.sdf
@ -25,10 +27,20 @@ Thumbs.db
/windows/Release
/windows/WebUIWrapper/bin
/windows/WebUIWrapper/obj
/windows/lib
/ext/installfiles/windows/ZeroTier One-SetupFiles
/ext/installfiles/windows/Prerequisites
/ext/installfiles/windows/*-cache
/ZeroTier One.msi
/windows/.vs
*.vcxproj.backup
/windows/TapDriver6/Win7Debug
/windows/TapDriver6/win7Release
/windows/*.db
/windows/*.opendb
enc_temp_folder
/windows/copyutil/bin
/windows/copyutil/obj
# *nix/Mac build droppings
/build-*
@ -49,7 +61,7 @@ zt1-src.tar.gz
*.pid
*.pkg
*.o
*.a
/*.a
*.dylib
*.so
*.so.*
@ -59,16 +71,15 @@ zt1-src.tar.gz
*.rpm
*.autosave
*.tmp
doc/*.1
doc/*.2
doc/*.8
.depend
node_modules
zt1_update_*
debian/files
debian/zerotier-one
debian/zerotier-one*.debhelper
debian/*.log
debian/zerotier-one.substvars
root-watcher/config.json
# Java/Android/JNI build droppings
java/obj/
@ -83,3 +94,25 @@ windows/WinUI/obj/
windows/WinUI/bin/
windows/ZeroTierOne/Debug/
/ext/installfiles/windows/chocolatey/zerotier-one/*.nupkg
# Miscellaneous mac/Xcode droppings
.DS_Store
.Trashes
*.swp
*~.nib
DerivedData/
build/
*.pbxuser
*.mode1v3
*.mode2v3
*.perspectivev3
!default.pbxuser
!default.mode1v3
!default.mode2v3
!default.perspectivev3
*.xccheckout
xcuserdata/
ext/librethinkdbxx/build
.vscode
__pycache__
*~

31
AUTHORS.md
View File

@ -25,13 +25,13 @@
## Third-Party Code
These are included in ext/ for platforms that do not have them available in common repositories. Otherwise they may be linked and the package may ship with them as dependencies.
ZeroTier includes the following third party code, either in ext/ or incorporated into the ZeroTier core.
* LZ4 compression algorithm by Yann Collet
* Files: ext/lz4/*
* Files: node/Packet.cpp (bundled within anonymous namespace)
* Home page: http://code.google.com/p/lz4/
* License grant: BSD attribution
* License grant: BSD 2-clause
* http-parser by Joyent, Inc. (many authors)
@ -39,11 +39,11 @@ These are included in ext/ for platforms that do not have them available in comm
* Home page: https://github.com/joyent/http-parser/
* License grant: MIT/Expat
* json-parser by James McLaughlin
* C++11 json (nlohmann/json) by Niels Lohmann
* Files: ext/json-parser/*
* Home page: https://github.com/udp/json-parser/
* License grant: BSD attribution
* Files: ext/json/*
* Home page: https://github.com/nlohmann/json
* License grant: MIT
* TunTapOSX by Mattias Nissler
@ -55,26 +55,19 @@ These are included in ext/ for platforms that do not have them available in comm
* tap-windows6 by the OpenVPN project
* Files: windows/TapDriver6/*
* Home page:
https://github.com/OpenVPN/tap-windows6/
* Home page: https://github.com/OpenVPN/tap-windows6/
* License grant: GNU GPL v2
* ZeroTier Modifications: change name of driver to ZeroTier, add ioctl() to get L2 multicast memberships (source is in ext/ and modifications inherit GPL)
* Salsa20 stream cipher, Curve25519 elliptic curve cipher, Ed25519
digital signature algorithm, and Poly1305 MAC algorithm, all by
Daniel J. Bernstein
* Salsa20 stream cipher, Curve25519 elliptic curve cipher, Ed25519 digital signature algorithm, and Poly1305 MAC algorithm, all by Daniel J. Bernstein
* Files:
node/Salsa20.hpp
node/C25519.hpp
node/Poly1305.hpp
* Files: node/Salsa20.* node/C25519.* node/Poly1305.*
* Home page: http://cr.yp.to/
* License grant: public domain
* ZeroTier Modifications: slight cryptographically-irrelevant modifications for inclusion into ZeroTier core
* MiniUPNPC and libnatpmp by Thomas Bernard
* Files:
ext/libnatpmp/*
ext/miniupnpc/*
* Files: ext/libnatpmp/* ext/miniupnpc/*
* Home page: http://miniupnp.free.fr/
* License grant: BSD attribution no-endorsement

12
CMakeLists.txt Normal file
View File

@ -0,0 +1,12 @@
# CMake build script for libzerotiercore.a
cmake_minimum_required (VERSION 2.8)
project (zerotiercore)
set (PROJ_DIR ${PROJECT_SOURCE_DIR})
set (ZT_DEFS -std=c++11)
file(GLOB core_src_glob ${PROJ_DIR}/node/*.cpp)
add_library(zerotiercore STATIC ${core_src_glob})
target_compile_options(zerotiercore PRIVATE ${ZT_DEFS})

2
COPYING
View File

@ -1,5 +1,5 @@
ZeroTier One, an endpoint server for the ZeroTier virtual network layer.
Copyright © 2011–2016 ZeroTier, Inc.
Copyright © 2011–2018 ZeroTier, Inc.
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

84
Jenkinsfile vendored Normal file
View File

@ -0,0 +1,84 @@
#!/usr/bin/env groovy
node('master') {
checkout scm
def changelog = getChangeLog currentBuild
mattermostSend "Building ${env.JOB_NAME} #${env.BUILD_NUMBER} \n Change Log: \n ${changelog}"
}
parallel 'centos7': {
node('centos7') {
try {
checkout scm
stage('Build Centos 7') {
sh 'make -f make-linux.mk'
}
}
catch (err) {
currentBuild.result = "FAILURE"
mattermostSend color: '#ff0000', message: "${env.JOB_NAME} broken on Centos 7 (<${env.BUILD_URL}|Open>)"
throw err
}
}
}, 'android-ndk': {
node('android-ndk') {
try {
checkout scm
stage('Build Android NDK') {
sh "/android/android-ndk-r15b/ndk-build -C $WORKSPACE/java ZT1=${WORKSPACE}"
}
}
catch (err) {
currentBuild.result = "FAILURE"
mattermostSend color: '#ff0000', message: "${env.JOB_NAME} broken on Android NDK (<${env.BUILD_URL}|Open>)"
throw err
}
}
}, 'macOS': {
node('macOS') {
try {
checkout scm
stage('Build macOS') {
sh 'make -f make-mac.mk'
}
stage('Build macOS UI') {
sh 'cd macui && xcodebuild -target "ZeroTier One" -configuration Debug'
}
}
catch (err) {
currentBuild.result = "FAILURE"
mattermostSend color: '#ff0000', message: "${env.JOB_NAME} broken on macOS (<${env.BUILD_URL}|Open>)"
throw err
}
}
}, 'windows': {
node('windows') {
try {
checkout scm
stage('Build Windows') {
bat '''CALL "C:\\Program Files (x86)\\Microsoft Visual Studio 14.0\\VC\\vcvarsall.bat" amd64
git clean -dfx
msbuild windows\\ZeroTierOne.sln
'''
}
}
catch (err) {
currentBuild.result = "FAILURE"
mattermostSend color: '#ff0000', message: "${env.JOB_NAME} broken on Windows (<${env.BUILD_URL}|Open>)"
throw err
}
}
}
mattermostSend color: "#00ff00", message: "${env.JOB_NAME} #${env.BUILD_NUMBER} Complete (<${env.BUILD_URL}|Show More...>)"

37
LICENSE.txt Normal file
View File

@ -0,0 +1,37 @@
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/>.
See LICENSE.GPL-3 for the full GNU GPL v3 license.
--
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.
--
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.
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.

10
Makefile
View File

@ -11,10 +11,16 @@ ifeq ($(OSTYPE),Linux)
endif
ifeq ($(OSTYPE),FreeBSD)
include make-freebsd.mk
CC=clang
CXX=clang++
ZT_BUILD_PLATFORM=7
include make-bsd.mk
endif
ifeq ($(OSTYPE),OpenBSD)
include make-freebsd.mk
CC=egcc
CXX=eg++
ZT_BUILD_PLATFORM=9
include make-bsd.mk
endif
ifeq ($(OSTYPE),NetBSD)

18
OFFICIAL-RELEASE-STEPS.md
View File

@ -15,6 +15,7 @@ The version must be incremented in all of the following files:
/ext/installfiles/mac/ZeroTier One.pkgproj
/ext/installfiles/windows/chocolatey/zerotier-one.nuspec
/ext/installfiles/windows/ZeroTier One.aip
/windows/WinUI/AboutView.xaml
The final .AIP file can only be edited on Windows with [Advanced Installer Enterprise](http://www.advancedinstaller.com/). In addition to incrementing the version be sure that a new product code is generated. (The "upgrade code" GUID on the other hand must never change.)
@ -30,22 +31,7 @@ You will need [Packages](http://s.sudre.free.fr/Software/Packages/about.html) an
## Linux
Mount the GPG key for *contact@zerotier.com* and then on an x86_64 box with a recent version of Docker and an Internet connection run:
make distclean
cd linux-build-farm
./build.sh
This will build i386 and x86_64 packages. Now ssh into our build Raspberry Pi and type `make debian` there to build the Raspbian armhf package. Copy it to `debian-jessie/` inside `linux-build-farm` so that it will be included in the repositories we generate. Now generate the YUM and APT repos:
rm -rf ~/.aptly*
rm -rf /tmp/zt-rpm-repo
./make-apt-repos.sh
./make-rpm-repos.sh
This will require the passphrase for *contact@zerotier.com*.
The contents of ~/.aptly/public must be published as `debian/` on `download.zerotier.com`. The contents of /tmp/zt-rpm-repo are published as `redhat/` on same.
See `LinuxBuild` environment on `linux-build` VM and use: `chroots/mount-build.sh`, `chroots/build.sh`, and the scripts in `build/` to make APT and RPM repositories.
## Windows

77
README.md
View File

@ -1,52 +1,65 @@
ZeroTier - A Planetary Ethernet Switch
======
ZeroTier is a software-based managed Ethernet switch for planet Earth.
ZeroTier is a smart programmable Ethernet switch for planet Earth.
It erases the LAN/WAN distinction and makes VPNs, tunnels, proxies, and other kludges arising from the inflexible nature of physical networks obsolete. Everything is encrypted end-to-end and traffic takes the most direct (peer to peer) path available.
It replaces the physical LAN/WAN boundary with a virtual one, allowing devices of any type at any location to be managed as if they all reside in the same cloud region or data center. All traffic is encrypted end-to-end and takes the most direct path available for minimum latency and maximum performance. The goals and design of ZeroTier are inspired by among other things the original [Google BeyondCorp](https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43231.pdf) paper and the [Jericho Forum](https://en.wikipedia.org/wiki/Jericho_Forum).
This repository contains ZeroTier One, a service that provides ZeroTier network connectivity to devices running Windows, Mac, Linux, iOS, Android, and FreeBSD and makes joining virtual networks as easy as joining IRC or Slack channels. It also contains the OS-independent core ZeroTier protocol implementation in [node/](node/).
Visit [ZeroTier's site](https://www.zerotier.com/) for more information and [pre-built binary packages](https://www.zerotier.com/download.shtml). Apps for Android and iOS are available for free in the Google Play and Apple app stores.
Visit [ZeroTier's site](https://www.zerotier.com/?pk_campaign=github_ZeroTierOne) for more information and [pre-built binary packages](https://www.zerotier.com/download.shtml?pk_campaign=github_ZeroTierOne). Apps for Android and iOS are available for free in the Google Play and Apple app stores.
### Getting Started
ZeroTier's basic operation is easy to understand. Devices have 10-digit *ZeroTier addresses* like `89e92ceee5` and networks have 16-digit network IDs like `8056c2e21c000001`. All it takes for a device to join a network is its 16-digit ID, and all it takes for a network to authorize a device is its 10-digit address. Everything else is automatic.
Everything in the ZeroTier world is controlled by two types of identifier: 40-bit/10-digit *ZeroTier addresses* and 64-bit/16-digit *network IDs*. A ZeroTier address identifies a node or "device" (laptop, phone, server, VM, app, etc.) while a network ID identifies a virtual Ethernet network that can be joined by devices.
A "device" can be anything really: desktops, laptops, phones, servers, VMs/VPSes, containers, and even (soon) apps.
Another way of thinking about it is that ZeroTier addresses are port numbers on a giant planetary-sized smart switch while network IDs are VLANs to which these ports can be assigned. For more details read about VL1 and VL2 in [the ZeroTier manual](https://www.zerotier.com/manual.shtml).
For testing we provide a public virtual network called *Earth* with network ID `8056c2e21c000001`. On Linux and Mac you can do this with:
*Network controllers* are ZeroTier nodes that act as access control certificate authorities and configuration managers for virtual networks. The first 40 bits (or 10 digits) of a network ID is the ZeroTier address of its controller. You can create networks with our [hosted controllers](https://my.zerotier.com/) and web UI/API or [host your own](controller/) if you don't mind posting some JSON configuration info or writing a script to do so.
sudo zerotier-cli join 8056c2e21c000001
### Project Layout
Now wait about 30 seconds and check your system with `ip addr list` or `ifconfig`. You'll see a new interface whose name starts with *zt* and it should quickly get an IPv4 and an IPv6 address. Once you see it get an IP, try pinging `earth.zerotier.net` at `29.209.112.93`. If you've joined Earth from more than one system, try pinging your other machine.
- `artwork/`: icons, logos, etc.
- `attic/`: old stuff and experimental code that we want to keep around for reference.
- `controller/`: the reference network controller implementation, which is built and included by default on desktop and server build targets.
- `debian/`: files for building Debian packages on Linux.
- `doc/`: manual pages and other documentation.
- `ext/`: third party libraries, binaries that we ship for convenience on some platforms (Mac and Windows), and installation support files.
- `include/`: include files for the ZeroTier core.
- `java/`: a JNI wrapper used with our Android mobile app. (The whole Android app is not open source but may be made so in the future.)
- `macui/`: a Macintosh menu-bar app for controlling ZeroTier One, written in Objective C.
- `node/`: the ZeroTier virtual Ethernet switch core, which is designed to be entirely separate from the rest of the code and able to be built as a stand-alone OS-independent library. Note to developers: do not use C++11 features in here, since we want this to build on old embedded platforms that lack C++11 support. C++11 can be used elsewhere.
- `osdep/`: code to support and integrate with OSes, including platform-specific stuff only built for certain targets.
- `service/`: the ZeroTier One service, which wraps the ZeroTier core and provides VPN-like connectivity to virtual networks for desktops, laptops, servers, VMs, and containers.
- `tcp-proxy/`: TCP proxy code run by ZeroTier, Inc. to provide TCP fallback (this will die soon!).
- `windows/`: Visual Studio solution files, Windows service code for ZeroTier One, and the Windows task bar app UI.
*(IPv4 addresses for Earth are assigned from the block 28.0.0.0/7, which is not a part of the public Internet but is non-standard for private networks. It's used to avoid IP conflicts during testing. Your networks can run any IP addressing scheme you want.)*
The base path contains the ZeroTier One service main entry point (`one.cpp`), self test code, makefiles, etc.
If you don't want to belong to a giant Ethernet party line anymore, just type:
### Build and Platform Notes
sudo zerotier-cli leave 8056c2e21c000001
To build on Mac and Linux just type `make`. On FreeBSD and OpenBSD `gmake` (GNU make) is required and can be installed from packages or ports. For Windows there is a Visual Studio solution in `windows/'.
The *zt* interface will disappear. You're no longer on the network.
To create networks of your own you'll need a network controller. You can use [our hosted controller at my.zerotier.com](https://my.zerotier.com) which is free for up to 100 devices on an unlimited number of networks, or you can build your own controller and run it through its local JSON API. See [README.md in controller/](controller/) for more information.
### Building from Source
For Mac, Linux, and BSD, just type "make" (or "gmake" on BSD). You won't need much installed; here are the requirements for various platforms:
* **Mac**: Xcode command line tools. It should build on OSX 10.7 or newer.
* **Linux**: gcc/g++ (4.9 or newer recommended) or clang/clang++ (3.4 or newer recommended) Makefile will use clang by default if available. The Linux build will auto-detect the presence of development headers for *json-parser*, *http-parser*, *li8bnatpmp*, and *libminiupnpc* and will link against the system libraries for these if they are present and recent enough. Otherwise the bundled versions in [ext/](ext/) will be used. Type `make install` to install the binaries and other files on the system, though this will not create init.d or systemd links.
* **FreeBSD/OpenBSD/NetBSD**: C++ compiler (G++ usually) and GNU make (gmake).
Each supported platform has its own *make-XXX.mk* file that contains the actual make rules for the platform. The right .mk file is included by the main Makefile based on the GNU make *OSTYPE* variable. Take a look at the .mk file for your platform for other targets, debug build rules, etc.
- **Mac**
- Xcode command line tools for OSX 10.7 or newer are required.
- Tap device driver kext source is in `ext/tap-mac` and a signed pre-built binary can be found in `ext/bin/tap-mac`. You should not need to build it yourself. It's a fork of [tuntaposx](http://tuntaposx.sourceforge.net) with device names changed to `zt#`, support for a larger MTU, and tun functionality removed.
- **Linux**
- The minimum compiler versions required are GCC/G++ 4.9.3 or CLANG/CLANG++ 3.4.2.
- Linux makefiles automatically detect and prefer clang/clang++ if present as it produces smaller and slightly faster binaries in most cases. You can override by supplying CC and CXX variables on the make command line.
- CentOS 7 ships with a version of GCC/G++ that is too old, but a new enough version of CLANG can be found in the *epel* repositories. Type `yum install epel-release` and then `yum install clang` to build there.
- **Windows**
- Windows 7 or newer is supported. This *may* work on Vista but isn't officially supported there. It will not work on Windows XP.
- We build with Visual Studio 2015. Older versions may not work. Clang or MinGW will also probably work but may require some makefile hacking.
- Pre-built signed Windows drivers are included in `ext/bin/tap-windows-ndis6`. The MSI files found there will install them on 32-bit and 64-bit systems. We don't recommend trying to build Windows drivers from scratch unless you know what you're doing. One does not simply "build" a Windows driver.
- **FreeBSD**
- Tested most recently on FreeBSD-11. Older versions may work but we're not sure.
- GCC/G++ 4.9 and gmake are required. These can be installed from packages or ports. Type `gmake` to build.
- **OpenBSD**
- There is a limit of four network memberships on OpenBSD as there are only four tap devices (`/dev/tap0` through `/dev/tap3`). We're not sure if this can be increased.
- OpenBSD lacks `getifmaddrs` (or any equivalent method) to get interface multicast memberships. As a result multicast will only work on OpenBSD for ARP and NDP (IP/MAC lookup) and not for other purposes.
- Only tested on OpenBSD 6.0. Older versions may not work.
- GCC/G++ 4.9 and gmake are required and can be installed using `pkg_add` or from ports. They get installed in `/usr/local/bin` as `egcc` and `eg++` and our makefile is pre-configured to use them on OpenBSD.
Typing `make selftest` will build a *zerotier-selftest* binary which unit tests various internals and reports on a few aspects of the build environment. It's a good idea to try this on novel platforms or architectures.
Windows, of course, is special. We build for Windows with Microsoft Visual Studio 2012 on Windows 7. A solution file is located in the *windows/* subfolder. Newer versions of Visual Studio (and Windows) may work but haven't been tested. Older versions almost certainly will not, since they lack things like *stdint.h* and certain STL features. MinGW or other ports of gcc/clang to Windows should also work but haven't been tested.
32 and 64 bit X86 and ARM (e.g. Raspberry Pi, Android) are officially supported. Community members have built for MIPS and Sparc without issues.
### Running
Running *zerotier-one* with -h will show help.
@ -62,7 +75,7 @@ The service is controlled via the JSON API, which by default is available at 127
Here's where home folders live (by default) on each OS:
* **Linux**: `/var/lib/zerotier-one`
* **FreeBSD**: `/var/db/zerotier-one`
* **FreeBSD** / **OpenBSD**: `/var/db/zerotier-one`
* **Mac**: `/Library/Application Support/ZeroTier/One`
* **Windows**: `\ProgramData\ZeroTier\One` (That's for Windows 7. The base 'shared app data' folder might be different on different Windows versions.)
@ -88,7 +101,7 @@ ZeroTier One peers will automatically locate each other and communicate directly
Users behind certain types of firewalls and "symmetric" NAT devices may not able able to connect to external peers directly at all. ZeroTier has limited support for port prediction and will *attempt* to traverse symmetric NATs, but this doesn't always work. If P2P connectivity fails you'll be bouncing UDP packets off our relay servers resulting in slower performance. Some NAT router(s) have a configurable NAT mode, and setting this to "full cone" will eliminate this problem. If you do this you may also see a magical improvement for things like VoIP phones, Skype, BitTorrent, WebRTC, certain games, etc., since all of these use NAT traversal techniques similar to ours.
If you're interested, there's a [technical deep dive about NAT traversal on our blog](https://www.zerotier.com/blog/?p=226). A troubleshooting tool to help you diagnose NAT issues is planned for the future as are uPnP/IGD/NAT-PMP and IPv6 transport.
If you're interested, there's a [technical deep dive about NAT traversal on our blog](https://www.zerotier.com/blog/?p=226?pk_campaign=github_ZeroTierOne). A troubleshooting tool to help you diagnose NAT issues is planned for the future as are uPnP/IGD/NAT-PMP and IPv6 transport.
If a firewall between you and the Internet blocks ZeroTier's UDP traffic, you will fall back to last-resort TCP tunneling to rootservers over port 443 (https impersonation). This will work almost anywhere but is *very slow* compared to UDP or direct peer to peer connectivity.

173
RELEASE-NOTES.md Normal file
View File

@ -0,0 +1,173 @@
ZeroTier Release Notes
======
# 2018-04-17 -- Version 1.2.6
* Features and Core Improvements
* Path selection has been overhauled to improve path stability, simplify code, and prepare for multi-path and trunking in the next major release.
* This version introduces remote tracing for remote diagnostics. Network controllers can set a node (usually the controller itself) to receive remote tracing events from all members of the network or from select members. Events are only sent if they pertain to a given network for security reasons.
* Multicast replication can now be done by designated multicast replicators on a network (flagged as such at the controller) rather than by the sender. Most users won't want this, but it's useful for specialized use cases on hub-and-spoke networks and for low-power devices.
* Cryptographic performance improvements on several platforms.
* Multithreaded performance improvements throughout the code base, including the use of an inline lightweight spinlock for low-contention resources.
* Bugs fixed
* Disappearing routes on Mac (GitHub issue #600)
* Route flapping and path instability in some dual-stack V4/V6 networks
* Blacklist (in local.conf) doesn't work reliably (GitHub issue #656)
* Connection instabilities due to unsigned integer overflows in timing comparisons (use int64_t instead of uint64_t)
* Binaries don't run on some older or lower-end 32-bit ARM chips (build problem)
* ARM NEON crypto code crashes (build problem)
* Fixed some lock ordering issues revealed by "valgrind" tool
* The "zerotier-idtool" command could not be accessed from "zerotier-one" via command line switch
* Leaking sockets on some platforms when uPnP/NAT-PMP is enabled
* Fixed two very rare multithreading issues that were only observed on certain systems
* Platform-Specific Changes
* MacOS
* Installer now loads the kernel extension right away so that High Sierra users will see the prompt to authorize it. This is done in the "Security & Privacy" preference pane and must be done driectly on the console (not via remote desktop). On High Sierra and newer kexts must be authorized at the console via security settings system preferences pane.
* Windows
* The Windows installer should now install the driver without requiring a special prompt in most cases. This should make it easier for our packages to be accepted into and updated in the Chocolatey repository and should make it easier to perform remote installs across groups of machines using IT management and provisioning tools.
* The Windows official packages are now signed with an EV certificate (with hardware key).
* The Windows UI can now log into ZeroTier Central and join networks via the Central API.
* The `zerotier-idtool` command should now work on Windows without ugly hacks.
* Upgraded the installer version.
* Made a few changes to hopefully fix sporadic "will not uninstall" problems, though we cannot duplicate these issues ourselves.
* Linux
* Device names are now generated deterministically based on network IDs for all newly joined networks.
* Android
* Multicast now works on Android in most cases! Android apps can send and receive multicast and subscribe to multicast group IPs. Note that in some cases the app must bind to the specific correct interface for this to work.
* IPv6 can be disabled in UI for cases where it causes problems.
# 2017-04-20 -- Version 1.2.4
* Managed routes are now only bifurcated for the default route. This is a change in behavior, though few people will probably notice. Bifurcating all managed routes was causing more trouble than it was worth for most users.
* Up to 2X crypto speedup on x86-64 (except Windows, which will take some porting) and 32-bit ARM platforms due to integration of fast assembly language implementations of Salsa20/12 from the [supercop](http://bench.cr.yp.to/supercop.html) code base. These were written by Daniel J. Bernstein and are in the public domain. My Macbook Pro (Core i5 2.8ghz) now does almost 1.5GiB/sec Salsa20/12 per core and a Raspberry Pi got a 2X boost. 64-bit ARM support and Windows support will take some work but should not be too hard.
* Refactored code that manages credentials to greatly reduce memory use in most cases. This may also result in a small performance improvement.
* Reworked and simplified path selection and priority logic to fix path instability and dead path persistence edge cases. There have been some sporadic reports of persistent path instabilities and dead paths hanging around that take minutes to resolve. These have proven difficult to reproduce in house, but hopefully this will fix them. In any case it seems to speed up path establishment in our tests and it makes the code simpler and more readable.
* Eliminated some unused cruft from the code around path management and in the peer class.
* Fixed an issue causing build problems on some MIPS architecture systems.
* Fixed Windows forgetting routes on sleep/wake or in some other circumstances. (GitHub issue #465)
# 2017-03-17 -- Version 1.2.2
* A bug causing unreliable multicast propagation (GitHub issue #461).
* A crash in ARM binaries due to a build chain and flags problem.
* A bug in the network controller preventing members from being listed (GitHub issue #460).
# 2017-03-14 -- Version 1.2.0
Version 1.2.0 is a major milestone release representing almost nine months of work. It includes our rules engine for distributed network packet filtering and security monitoring, federated roots, and many other architectural and UI improvements and bug fixes.
## New Features in 1.2.0
### The ZeroTier Rules Engine
The largest new feature in 1.2.0, and the product of many months of work, is our advanced network rules engine. With this release we achieve traffic control, security monitoring, and micro-segmentation capability on par with many enterprise SDN solutions designed for use in advanced data centers and corporate networks.
Rules allow you to filter packets on your network and vector traffic to security observers. Security observation can be performed in-band using REDIRECT or out of band using TEE.
Tags and capabilites provide advanced methods for implementing fine grained permission structures and micro-segmentation schemes without bloating the size and complexity of your rules table.
See the [rules engine announcement blog post](https://www.zerotier.com/blog/?p=927) for an in-depth discussion of theory and implementation. The [manual](https://www.zerotier.com/manual.shtml) contains detailed information on rule, tag, and capability use, and the `rule-compiler/` subfolder of the ZeroTier source tree contains a JavaScript function to compile rules in our human-readable rule definition language into rules suitable for import into a network controller. (ZeroTier Central uses this same script to compile rules on [my.zerotier.com](https://my.zerotier.com/).)
### Root Server Federation
It's now possible to create your own root servers and add them to the root server pool on your nodes. This is done by creating what's called a "moon," which is a signed enumeration of root servers and their stable points on the network. Refer to the [manual](https://www.zerotier.com/manual.shtml) for instructions.
Federated roots achieve a number of things:
* You can deploy your own infrastructure to reduce dependency on ours.
* You can deploy roots *inside your LAN* to ensure that network connectivity inside your facility still works if the Internet goes down. This is the first step toward making ZeroTier viable as an in-house SDN solution.
* Roots can be deployed inside national boundaries for countries with data residency laws or "great firewalls." (As of 1.2.0 there is still no way to force all traffic to use these roots, but that will be easy to do in a later version.)
* Last but not least this makes ZeroTier somewhat less centralized by eliminating any hard dependency on ZeroTier, Inc.'s infrastructure.
Our roots will of course remain and continue to provide zero-configuration instant-on deployment, a secure global authority for identities, and free traffic relaying for those who can't establish peer to peer connections.
### Local Configuration
An element of our design philosophy is "features are bugs." This isn't an absolute dogma but more of a guiding principle. We try as hard as we can to avoid adding features, especially "knobs" that must be tweaked by a user.
As of 1.2.0 we've decided that certain knobs are unavoidable, and so there is now a `local.conf` file that can be used to configure them. See the ZeroTier One documentation for these. They include:
* Blacklisting interfaces you want to make sure ZeroTier doesn't use for network traffic, such as VPNs, slow links, or backplanes designated for only certain kinds of traffic.
* Turning uPnP/NAT-PMP on or off.
* Configuring software updates on Windows and Mac platforms.
* Defining trusted paths (the old trusted paths file is now deprecated)
* Setting the ZeroTier main port so it doesn't have to be changed on the command line, which is very inconvenient in many cases.
### Improved In-Band Software Updates
A good software update system for Windows and Mac clients has been a missing feature in previous versions. It does exist but we've been shy about using it so far due to its fragility in some environments.
We've greatly improved this mechanism in 1.2.0. Not only does it now do a better job of actually invoking the update, but it also transfers updates in-band using the ZeroTier protocol. This means it can work in environments that do not allows http/https traffic or that force it through proxies. There's also now an update channel setting: `beta` or `release` (the default).
Software updates are authenticated three ways:
1. ZeroTier's own signing key is used to sign all updates and this signature is checked prior to installation. ZeroTier, Inc.'s signatures are performed on an air-gapped machine.
2. Updates for Mac and Windows are signed using Apple and Microsoft (DigiCert EV) keys and will not install unless these signatures are also valid.
3. The new in-band update mechanism also authenticates the source of the update via ZeroTier's built-in security features. This provides transport security, while 1 and 2 provide security of the update at rest.
Updates are now configurable via `local.conf`. There are three options: `disable`, `download`, and `apply`. The third (apply) is the default for official builds on Windows and Mac, making updates happen silently and automatically as they do for popular browsers like Chrome and Firefox. Updates are disabled by default on Linux and other Unix-type systems as these are typically updated through package managers.
### Path Link Quality Awareness
Version 1.2.0 is now aware of the link quality of direct paths with other 1.2.0 nodes. This information isn't used yet but is visible through the JSON API. (Quality always shows as 100% with pre-1.2.0 nodes.) Quality is measured passively with no additional overhead using a counter based packet loss detection algorithm.
This information is visible from the command line via `listpeers`:
200 listpeers XXXXXXXXXX 199.XXX.XXX.XXX/9993;10574;15250;1.00 48 1.2.0 LEAF
200 listpeers XXXXXXXXXX 195.XXX.XXX.XXX/45584;467;7608;0.44 290 1.2.0 LEAF
The first peer's path is at 100% (1.00), while the second peer's path is suffering quite a bit of packet loss (0.44).
Link quality awareness is a precursor to intelligent multi-path and QoS support, which will in future versions bring us to feature parity with SD-WAN products like Cisco iWAN.
### Security Improvements
Version 1.2.0 adds anti-DOS (denial of service) rate limits and other hardening for improved resiliency against a number of denial of service attack scenarios.
It also adds a mechanism for instantaneous credential revocation. This can be used to revoke certificates of membership instantly to kick a node off a network (for private networks) and also to revoke capabilities and tags. The new controller sends revocations by default when a peer is de-authorized.
Revocations propagate using a "rumor mill" peer to peer algorithm. This means that a controller need only successfully send a revocation to at least one member of a network with connections to other active members. At this point the revocation will flood through the network peer to peer very quickly. This helps make revocations more robust in the face of poor connectivity with the controller or attempts to incapacitate the controller with denial of service attacks, as well as making revocations faster on huge networks.
### Windows and Macintosh UI Improvements (ZeroTier One)
The Mac has a whole new UI built natively in Objective-C. It provides a pulldown similar in appearance and operation to the Mac WiFi task bar menu.
The Windows UI has also been improved and now provides a task bar icon that can be right-clicked to manage networks. Both now expose managed route and IP permissions, allowing nodes to easily opt in to full tunnel operation if you have a router configured on your network.
### Ad-Hoc Networks
A special kind of public network called an ad-hoc network may be accessed by joining a network ID with the format:
ffSSSSEEEE000000
| | | |
| | | Reserved for future use, must be 0
| | End of port range (hex)
| Start of port range (hex)
Reserved ZeroTier address prefix indicating a controller-less network
Ad-hoc networks are public (no access control) networks that have no network controller. Instead their configuration and other credentials are generated locally. Ad-hoc networks permit only IPv6 UDP and TCP unicast traffic (no multicast or broadcast) using 6plane format NDP-emulated IPv6 addresses. In addition an ad-hoc network ID encodes an IP port range. UDP packets and TCP SYN (connection open) packets are only allowed to desintation ports within the encoded range.
For example `ff00160016000000` is an ad-hoc network allowing only SSH, while `ff0000ffff000000` is an ad-hoc network allowing any UDP or TCP port.
Keep in mind that these networks are public and anyone in the entire world can join them. Care must be taken to avoid exposing vulnerable services or sharing unwanted files or other resources.
### Network Controller (Partial) Rewrite
The network controller has been largely rewritten to use a simple in-filesystem JSON data store in place of SQLite, and it is now included by default in all Windows, Mac, Linux, and BSD builds. This means any desktop or server node running ZeroTier One can now be a controller with no recompilation needed.
If you have data in an old SQLite3 controller we've included a NodeJS script in `controller/migrate-sqlite` to migrate data to the new format. If you don't migrate, members will start getting `NOT_FOUND` when they attempt to query for updates.
## Major Bug Fixes in 1.2.0
* **The Windows HyperV 100% CPU bug is FINALLY DEAD**: This long-running problem turns out to have been an issue with Windows itself, but one we were triggering by placing invalid data into the Windows registry. Microsoft is aware of the issue but we've also fixed the triggering problem on our side. ZeroTier should now co-exist quite well with HyperV and should now be able to be bridged with a HyperV virtual switch.
* **Segmenation faults on musl-libc based Linux systems**: Alpine Linux and some embedded Linux systems that use musl libc (a minimal libc) experienced segmentation faults. These were due to a smaller default stack size. A work-around that sets the stack size for new threads has been added.
* **Windows firewall blocks local JSON API**: On some Windows systems the firewall likes to block 127.0.0.1:9993 for mysterious reasons. This is now fixed in the installer via the addition of another firewall exemption rule.
* **UI crash on embedded Windows due to missing fonts**: The MSI installer now ships fonts and will install them if they are not present, so this should be fixed.
## Other Improvements in 1.2.0
* **Improved dead path detection**: ZeroTier is now more aggressive about expiring paths that do not seem to be active. If a path seems marginal it is re-confirmed before re-use.
* **Minor performance improvements**: We've reduced unnecessary memcpy's and made a few other performance improvements in the core.
* **Linux static binaries**: For our official packages (the ones in the download.zerotier.com apt and yum repositories) we now build Linux binaries with static linking. Hopefully this will stop all the bug reports relating to library inconsistencies, as well as allowing our deb packages to run on a wider variety of Debian-based distributions. (There are far too many of these to support officially!) The overhead for this is very small, especially since we built our static versions against musl-libc. Distribution maintainers are of course free to build dynamically linked versions for inclusion into distributions; this only affects our official binaries.

BIN
artwork/ZeroTierIcon32x32.png Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 7.0 KiB

269
node/Cluster.cpp → attic/Cluster.cpp
View File

@ -1,6 +1,6 @@
/*
* ZeroTier One - Network Virtualization Everywhere
* Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
* 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
@ -14,6 +14,14 @@
*
* 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
@ -44,6 +52,7 @@
#include "Packet.hpp"
#include "Switch.hpp"
#include "Node.hpp"
#include "Network.hpp"
#include "Array.hpp"
namespace ZeroTier {
@ -248,13 +257,13 @@ void Cluster::handleIncomingStateMessage(const void *msg,unsigned int len)
memcpy(keytmp,_key,32);
for(int i=0;i<8;++i)
keytmp[i] ^= reinterpret_cast<const char *>(msg)[i];
Salsa20 s20(keytmp,256,reinterpret_cast<const char *>(msg) + 8);
Salsa20 s20(keytmp,reinterpret_cast<const char *>(msg) + 8);
Utils::burn(keytmp,sizeof(keytmp));
// One-time-use Poly1305 key from first 32 bytes of Salsa20 keystream (as per DJB/NaCl "standard")
char polykey[ZT_POLY1305_KEY_LEN];
memset(polykey,0,sizeof(polykey));
s20.encrypt12(polykey,polykey,sizeof(polykey));
s20.crypt12(polykey,polykey,sizeof(polykey));
// Compute 16-byte MAC
char mac[ZT_POLY1305_MAC_LEN];
@ -266,7 +275,7 @@ void Cluster::handleIncomingStateMessage(const void *msg,unsigned int len)
// Decrypt!
dmsg.setSize(len - 24);
s20.decrypt12(reinterpret_cast<const char *>(msg) + 24,const_cast<void *>(dmsg.data()),dmsg.size());
s20.crypt12(reinterpret_cast<const char *>(msg) + 24,const_cast<void *>(dmsg.data()),dmsg.size());
}
if (dmsg.size() < 4)
@ -341,17 +350,20 @@ void Cluster::handleIncomingStateMessage(const void *msg,unsigned int len)
Identity id;
ptr += id.deserialize(dmsg,ptr);
if (id) {
RR->topology->saveIdentity(id);
{
Mutex::Lock _l(_remotePeers_m);
_remotePeers[std::pair<Address,unsigned int>(id.address(),(unsigned int)fromMemberId)] = RR->node->now();
_RemotePeer &rp = _remotePeers[std::pair<Address,unsigned int>(id.address(),(unsigned int)fromMemberId)];
if (!rp.lastHavePeerReceived) {
RR->topology->saveIdentity((void *)0,id);
RR->identity.agree(id,rp.key,ZT_PEER_SECRET_KEY_LENGTH);
}
rp.lastHavePeerReceived = RR->node->now();
}
_ClusterSendQueueEntry *q[16384]; // 16384 is "tons"
unsigned int qc = _sendQueue->getByDest(id.address(),q,16384);
for(unsigned int i=0;i<qc;++i)
this->sendViaCluster(q[i]->fromPeerAddress,q[i]->toPeerAddress,q[i]->data,q[i]->len,q[i]->unite);
this->relayViaCluster(q[i]->fromPeerAddress,q[i]->toPeerAddress,q[i]->data,q[i]->len,q[i]->unite);
_sendQueue->returnToPool(q,qc);
TRACE("[%u] has %s (retried %u queued sends)",(unsigned int)fromMemberId,id.address().toString().c_str(),qc);
@ -361,7 +373,7 @@ void Cluster::handleIncomingStateMessage(const void *msg,unsigned int len)
case CLUSTER_MESSAGE_WANT_PEER: {
const Address zeroTierAddress(dmsg.field(ptr,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); ptr += ZT_ADDRESS_LENGTH;
SharedPtr<Peer> peer(RR->topology->getPeerNoCache(zeroTierAddress));
if ( (peer) && (peer->hasClusterOptimalPath(RR->node->now())) ) {
if ( (peer) && (peer->hasLocalClusterOptimalPath(RR->node->now())) ) {
Buffer<1024> buf;
peer->identity().serialize(buf);
Mutex::Lock _l2(_members[fromMemberId].lock);
@ -396,7 +408,7 @@ void Cluster::handleIncomingStateMessage(const void *msg,unsigned int len)
SharedPtr<Peer> localPeer(RR->topology->getPeerNoCache(localPeerAddress));
if ((localPeer)&&(numRemotePeerPaths > 0)) {
InetAddress bestLocalV4,bestLocalV6;
localPeer->getBestActiveAddresses(now,bestLocalV4,bestLocalV6);
localPeer->getRendezvousAddresses(now,bestLocalV4,bestLocalV6);
InetAddress bestRemoteV4,bestRemoteV6;
for(unsigned int i=0;i<numRemotePeerPaths;++i) {
@ -455,7 +467,7 @@ void Cluster::handleIncomingStateMessage(const void *msg,unsigned int len)
Mutex::Lock _l2(_members[fromMemberId].lock);
_send(fromMemberId,CLUSTER_MESSAGE_PROXY_SEND,rendezvousForRemote.data(),rendezvousForRemote.size());
}
RR->sw->send(rendezvousForLocal,true,0);
RR->sw->send((void *)0,rendezvousForLocal,true);
}
}
} break;
@ -466,9 +478,18 @@ void Cluster::handleIncomingStateMessage(const void *msg,unsigned int len)
const unsigned int len = dmsg.at<uint16_t>(ptr); ptr += 2;
Packet outp(rcpt,RR->identity.address(),verb);
outp.append(dmsg.field(ptr,len),len); ptr += len;
RR->sw->send(outp,true,0);
RR->sw->send((void *)0,outp,true);
//TRACE("[%u] proxy send %s to %s length %u",(unsigned int)fromMemberId,Packet::verbString(verb),rcpt.toString().c_str(),len);
} break;
case CLUSTER_MESSAGE_NETWORK_CONFIG: {
const SharedPtr<Network> network(RR->node->network(dmsg.at<uint64_t>(ptr)));
if (network) {
// Copy into a Packet just to conform to Network API. Eventually
// will want to refactor.
network->handleConfigChunk((void *)0,0,Address(),Buffer<ZT_PROTO_MAX_PACKET_LENGTH>(dmsg),ptr);
}
} break;
}
} catch ( ... ) {
TRACE("invalid message of size %u type %d (inner decode), discarding",mlen,mtype);
@ -494,7 +515,84 @@ void Cluster::broadcastHavePeer(const Identity &id)
}
}
void Cluster::sendViaCluster(const Address &fromPeerAddress,const Address &toPeerAddress,const void *data,unsigned int len,bool unite)
void Cluster::broadcastNetworkConfigChunk(const void *chunk,unsigned int len)
{
Mutex::Lock _l(_memberIds_m);
for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
Mutex::Lock _l2(_members[*mid].lock);
_send(*mid,CLUSTER_MESSAGE_NETWORK_CONFIG,chunk,len);
}
}
int Cluster::checkSendViaCluster(const Address &toPeerAddress,uint64_t &mostRecentTs,void *peerSecret)
{
const uint64_t now = RR->node->now();
mostRecentTs = 0;
int mostRecentMemberId = -1;
{
Mutex::Lock _l2(_remotePeers_m);
std::map< std::pair<Address,unsigned int>,_RemotePeer >::const_iterator rpe(_remotePeers.lower_bound(std::pair<Address,unsigned int>(toPeerAddress,0)));
for(;;) {
if ((rpe == _remotePeers.end())||(rpe->first.first != toPeerAddress))
break;
else if (rpe->second.lastHavePeerReceived > mostRecentTs) {
mostRecentTs = rpe->second.lastHavePeerReceived;
memcpy(peerSecret,rpe->second.key,ZT_PEER_SECRET_KEY_LENGTH);
mostRecentMemberId = (int)rpe->first.second;
}
++rpe;
}
}
const uint64_t ageOfMostRecentHavePeerAnnouncement = now - mostRecentTs;
if (ageOfMostRecentHavePeerAnnouncement >= (ZT_PEER_ACTIVITY_TIMEOUT / 3)) {
if (ageOfMostRecentHavePeerAnnouncement >= ZT_PEER_ACTIVITY_TIMEOUT)
mostRecentMemberId = -1;
bool sendWantPeer = true;
{
Mutex::Lock _l(_remotePeers_m);
_RemotePeer &rp = _remotePeers[std::pair<Address,unsigned int>(toPeerAddress,(unsigned int)_id)];
if ((now - rp.lastSentWantPeer) >= ZT_CLUSTER_WANT_PEER_EVERY) {
rp.lastSentWantPeer = now;
} else {
sendWantPeer = false; // don't flood WANT_PEER
}
}
if (sendWantPeer) {
char tmp[ZT_ADDRESS_LENGTH];
toPeerAddress.copyTo(tmp,ZT_ADDRESS_LENGTH);
{
Mutex::Lock _l(_memberIds_m);
for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
Mutex::Lock _l2(_members[*mid].lock);
_send(*mid,CLUSTER_MESSAGE_WANT_PEER,tmp,ZT_ADDRESS_LENGTH);
}
}
}
}
return mostRecentMemberId;
}
bool Cluster::sendViaCluster(int mostRecentMemberId,const Address &toPeerAddress,const void *data,unsigned int len)
{
if ((mostRecentMemberId < 0)||(mostRecentMemberId >= ZT_CLUSTER_MAX_MEMBERS)) // sanity check
return false;
Mutex::Lock _l2(_members[mostRecentMemberId].lock);
for(std::vector<InetAddress>::const_iterator i1(_zeroTierPhysicalEndpoints.begin());i1!=_zeroTierPhysicalEndpoints.end();++i1) {
for(std::vector<InetAddress>::const_iterator i2(_members[mostRecentMemberId].zeroTierPhysicalEndpoints.begin());i2!=_members[mostRecentMemberId].zeroTierPhysicalEndpoints.end();++i2) {
if (i1->ss_family == i2->ss_family) {
TRACE("sendViaCluster sending %u bytes to %s by way of %u (%s->%s)",len,toPeerAddress.toString().c_str(),(unsigned int)mostRecentMemberId,i1->toString().c_str(),i2->toString().c_str());
RR->node->putPacket((void *)0,*i1,*i2,data,len);
return true;
}
}
}
return false;
}
void Cluster::relayViaCluster(const Address &fromPeerAddress,const Address &toPeerAddress,const void *data,unsigned int len,bool unite)
{
if (len > ZT_PROTO_MAX_PACKET_LENGTH) // sanity check
return;
@ -502,87 +600,101 @@ void Cluster::sendViaCluster(const Address &fromPeerAddress,const Address &toPee
const uint64_t now = RR->node->now();
uint64_t mostRecentTs = 0;
unsigned int mostRecentMemberId = 0xffffffff;
int mostRecentMemberId = -1;
{
Mutex::Lock _l2(_remotePeers_m);
std::map< std::pair<Address,unsigned int>,uint64_t >::const_iterator rpe(_remotePeers.lower_bound(std::pair<Address,unsigned int>(toPeerAddress,0)));
std::map< std::pair<Address,unsigned int>,_RemotePeer >::const_iterator rpe(_remotePeers.lower_bound(std::pair<Address,unsigned int>(toPeerAddress,0)));
for(;;) {
if ((rpe == _remotePeers.end())||(rpe->first.first != toPeerAddress))
break;
else if (rpe->second > mostRecentTs) {
mostRecentTs = rpe->second;
mostRecentMemberId = rpe->first.second;
else if (rpe->second.lastHavePeerReceived > mostRecentTs) {
mostRecentTs = rpe->second.lastHavePeerReceived;
mostRecentMemberId = (int)rpe->first.second;
}
++rpe;
}
}
const uint64_t age = now - mostRecentTs;
if (age >= (ZT_PEER_ACTIVITY_TIMEOUT / 3)) {
const bool enqueueAndWait = ((age >= ZT_PEER_ACTIVITY_TIMEOUT)||(mostRecentMemberId > 0xffff));
const uint64_t ageOfMostRecentHavePeerAnnouncement = now - mostRecentTs;
if (ageOfMostRecentHavePeerAnnouncement >= (ZT_PEER_ACTIVITY_TIMEOUT / 3)) {
// Enqueue and wait if peer seems alive, but do WANT_PEER to refresh homing
const bool enqueueAndWait = ((ageOfMostRecentHavePeerAnnouncement >= ZT_PEER_ACTIVITY_TIMEOUT)||(mostRecentMemberId < 0));
// Poll everyone with WANT_PEER if the age of our most recent entry is
// approaching expiration (or has expired, or does not exist).
char tmp[ZT_ADDRESS_LENGTH];
toPeerAddress.copyTo(tmp,ZT_ADDRESS_LENGTH);
bool sendWantPeer = true;
{
Mutex::Lock _l(_memberIds_m);
for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
Mutex::Lock _l2(_members[*mid].lock);
_send(*mid,CLUSTER_MESSAGE_WANT_PEER,tmp,ZT_ADDRESS_LENGTH);
Mutex::Lock _l(_remotePeers_m);
_RemotePeer &rp = _remotePeers[std::pair<Address,unsigned int>(toPeerAddress,(unsigned int)_id)];
if ((now - rp.lastSentWantPeer) >= ZT_CLUSTER_WANT_PEER_EVERY) {
rp.lastSentWantPeer = now;
} else {
sendWantPeer = false; // don't flood WANT_PEER
}
}
if (sendWantPeer) {
char tmp[ZT_ADDRESS_LENGTH];
toPeerAddress.copyTo(tmp,ZT_ADDRESS_LENGTH);
{
Mutex::Lock _l(_memberIds_m);
for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
Mutex::Lock _l2(_members[*mid].lock);
_send(*mid,CLUSTER_MESSAGE_WANT_PEER,tmp,ZT_ADDRESS_LENGTH);
}
}
}
// If there isn't a good place to send via, then enqueue this for retrying
// later and return after having broadcasted a WANT_PEER.
if (enqueueAndWait) {
TRACE("sendViaCluster %s -> %s enqueueing to wait for HAVE_PEER",fromPeerAddress.toString().c_str(),toPeerAddress.toString().c_str());
TRACE("relayViaCluster %s -> %s enqueueing to wait for HAVE_PEER",fromPeerAddress.toString().c_str(),toPeerAddress.toString().c_str());
_sendQueue->enqueue(now,fromPeerAddress,toPeerAddress,data,len,unite);
return;
}
}
Buffer<1024> buf;
if (unite) {
InetAddress v4,v6;
if (fromPeerAddress) {
SharedPtr<Peer> fromPeer(RR->topology->getPeerNoCache(fromPeerAddress));
if (fromPeer)
fromPeer->getBestActiveAddresses(now,v4,v6);
}
uint8_t addrCount = 0;
if (v4)
++addrCount;
if (v6)
++addrCount;
if (addrCount) {
toPeerAddress.appendTo(buf);
fromPeerAddress.appendTo(buf);
buf.append(addrCount);
if (mostRecentMemberId >= 0) {
Buffer<1024> buf;
if (unite) {
InetAddress v4,v6;
if (fromPeerAddress) {
SharedPtr<Peer> fromPeer(RR->topology->getPeerNoCache(fromPeerAddress));
if (fromPeer)
fromPeer->getRendezvousAddresses(now,v4,v6);
}
uint8_t addrCount = 0;
if (v4)
v4.serialize(buf);
++addrCount;
if (v6)
v6.serialize(buf);
}
}
{
Mutex::Lock _l2(_members[mostRecentMemberId].lock);
if (buf.size() > 0)
_send(mostRecentMemberId,CLUSTER_MESSAGE_PROXY_UNITE,buf.data(),buf.size());
for(std::vector<InetAddress>::const_iterator i1(_zeroTierPhysicalEndpoints.begin());i1!=_zeroTierPhysicalEndpoints.end();++i1) {
for(std::vector<InetAddress>::const_iterator i2(_members[mostRecentMemberId].zeroTierPhysicalEndpoints.begin());i2!=_members[mostRecentMemberId].zeroTierPhysicalEndpoints.end();++i2) {
if (i1->ss_family == i2->ss_family) {
TRACE("sendViaCluster relaying %u bytes from %s to %s by way of %u (%s->%s)",len,fromPeerAddress.toString().c_str(),toPeerAddress.toString().c_str(),(unsigned int)mostRecentMemberId,i1->toString().c_str(),i2->toString().c_str());
RR->node->putPacket(*i1,*i2,data,len);
return;
}
++addrCount;
if (addrCount) {
toPeerAddress.appendTo(buf);
fromPeerAddress.appendTo(buf);
buf.append(addrCount);
if (v4)
v4.serialize(buf);
if (v6)
v6.serialize(buf);
}
}
TRACE("sendViaCluster relaying %u bytes from %s to %s by way of %u failed: no common endpoints with the same address family!",len,fromPeerAddress.toString().c_str(),toPeerAddress.toString().c_str(),(unsigned int)mostRecentMemberId);
return;
{
Mutex::Lock _l2(_members[mostRecentMemberId].lock);
if (buf.size() > 0)
_send(mostRecentMemberId,CLUSTER_MESSAGE_PROXY_UNITE,buf.data(),buf.size());
for(std::vector<InetAddress>::const_iterator i1(_zeroTierPhysicalEndpoints.begin());i1!=_zeroTierPhysicalEndpoints.end();++i1) {
for(std::vector<InetAddress>::const_iterator i2(_members[mostRecentMemberId].zeroTierPhysicalEndpoints.begin());i2!=_members[mostRecentMemberId].zeroTierPhysicalEndpoints.end();++i2) {
if (i1->ss_family == i2->ss_family) {
TRACE("relayViaCluster relaying %u bytes from %s to %s by way of %u (%s->%s)",len,fromPeerAddress.toString().c_str(),toPeerAddress.toString().c_str(),(unsigned int)mostRecentMemberId,i1->toString().c_str(),i2->toString().c_str());
RR->node->putPacket((void *)0,*i1,*i2,data,len);
return;
}
}
}
TRACE("relayViaCluster relaying %u bytes from %s to %s by way of %u failed: no common endpoints with the same address family!",len,fromPeerAddress.toString().c_str(),toPeerAddress.toString().c_str(),(unsigned int)mostRecentMemberId);
}
}
}
@ -644,8 +756,8 @@ void Cluster::doPeriodicTasks()
_lastCleanedRemotePeers = now;
Mutex::Lock _l(_remotePeers_m);
for(std::map< std::pair<Address,unsigned int>,uint64_t >::iterator rp(_remotePeers.begin());rp!=_remotePeers.end();) {
if ((now - rp->second) >= ZT_PEER_ACTIVITY_TIMEOUT)
for(std::map< std::pair<Address,unsigned int>,_RemotePeer >::iterator rp(_remotePeers.begin());rp!=_remotePeers.end();) {
if ((now - rp->second.lastHavePeerReceived) >= ZT_PEER_ACTIVITY_TIMEOUT)
_remotePeers.erase(rp++);
else ++rp;
}
@ -719,7 +831,9 @@ bool Cluster::findBetterEndpoint(InetAddress &redirectTo,const Address &peerAddr
std::vector<InetAddress> best;
const double currentDistance = _dist3d(_x,_y,_z,px,py,pz);
double bestDistance = (offload ? 2147483648.0 : currentDistance);
#ifdef ZT_TRACE
unsigned int bestMember = _id;
#endif
{
Mutex::Lock _l(_memberIds_m);
for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
@ -731,7 +845,9 @@ bool Cluster::findBetterEndpoint(InetAddress &redirectTo,const Address &peerAddr
const double mdist = _dist3d(m.x,m.y,m.z,px,py,pz);
if (mdist < bestDistance) {
bestDistance = mdist;
#ifdef ZT_TRACE
bestMember = *mid;
#endif
best = m.zeroTierPhysicalEndpoints;
}
}
@ -754,6 +870,19 @@ bool Cluster::findBetterEndpoint(InetAddress &redirectTo,const Address &peerAddr
}
}
bool Cluster::isClusterPeerFrontplane(const InetAddress &ip) const
{
Mutex::Lock _l(_memberIds_m);
for(std::vector<uint16_t>::const_iterator mid(_memberIds.begin());mid!=_memberIds.end();++mid) {
Mutex::Lock _l2(_members[*mid].lock);
for(std::vector<InetAddress>::const_iterator i2(_members[*mid].zeroTierPhysicalEndpoints.begin());i2!=_members[*mid].zeroTierPhysicalEndpoints.end();++i2) {
if (ip == *i2)
return true;
}
}
return false;
}
void Cluster::status(ZT_ClusterStatus &status) const
{
const uint64_t now = RR->node->now();
@ -827,16 +956,16 @@ void Cluster::_flush(uint16_t memberId)
memcpy(keytmp,m.key,32);
for(int i=0;i<8;++i)
keytmp[i] ^= m.q[i];
Salsa20 s20(keytmp,256,m.q.field(8,8));
Salsa20 s20(keytmp,m.q.field(8,8));
Utils::burn(keytmp,sizeof(keytmp));
// One-time-use Poly1305 key from first 32 bytes of Salsa20 keystream (as per DJB/NaCl "standard")
char polykey[ZT_POLY1305_KEY_LEN];
memset(polykey,0,sizeof(polykey));
s20.encrypt12(polykey,polykey,sizeof(polykey));
s20.crypt12(polykey,polykey,sizeof(polykey));
// Encrypt m.q in place
s20.encrypt12(reinterpret_cast<const char *>(m.q.data()) + 24,const_cast<char *>(reinterpret_cast<const char *>(m.q.data())) + 24,m.q.size() - 24);
s20.crypt12(reinterpret_cast<const char *>(m.q.data()) + 24,const_cast<char *>(reinterpret_cast<const char *>(m.q.data())) + 24,m.q.size() - 24);
// Add MAC for authentication (encrypt-then-MAC)
char mac[ZT_POLY1305_MAC_LEN];
@ -860,7 +989,7 @@ void Cluster::_flush(uint16_t memberId)
void Cluster::_doREMOTE_WHOIS(uint64_t fromMemberId,const Packet &remotep)
{
if (remotep.payloadLength() >= ZT_ADDRESS_LENGTH) {
Identity queried(RR->topology->getIdentity(Address(remotep.payload(),ZT_ADDRESS_LENGTH)));
Identity queried(RR->topology->getIdentity((void *)0,Address(remotep.payload(),ZT_ADDRESS_LENGTH)));
if (queried) {
Buffer<1024> routp;
remotep.source().appendTo(routp);

73
node/Cluster.hpp → attic/Cluster.hpp
View File

@ -1,6 +1,6 @@
/*
* ZeroTier One - Network Virtualization Everywhere
* Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
* 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
@ -14,6 +14,14 @@
*
* 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
@ -88,6 +96,11 @@
*/
#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;
@ -216,14 +229,13 @@ public:
/**
* Replicate a network config for a network we belong to:
* <[8] 64-bit network ID>
* <[2] 16-bit length of network config>
* <[...] serialized network config>
* <[...] 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.
*
* TODO: not implemented yet!
* 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
};
@ -268,7 +280,38 @@ public:
void broadcastHavePeer(const Identity &id);
/**
* Send this packet via another node in this cluster if another node has this peer
* 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
@ -280,7 +323,7 @@ public:
* @param len Length of packet or fragment
* @param unite If true, also request proxy unite across cluster
*/
void sendViaCluster(const Address &fromPeerAddress,const Address &toPeerAddress,const void *data,unsigned int len,bool unite);
void relayViaCluster(const Address &fromPeerAddress,const Address &toPeerAddress,const void *data,unsigned int len,bool unite);
/**
* Send a distributed query to other cluster members
@ -323,6 +366,12 @@ public:
*/
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)
*
@ -391,7 +440,15 @@ private:
std::vector<uint16_t> _memberIds;
Mutex _memberIds_m;
std::map< std::pair<Address,unsigned int>,uint64_t > _remotePeers; // we need ordered behavior and lower_bound here
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;

20
service/ClusterDefinition.hpp → attic/ClusterDefinition.hpp
View File

@ -1,6 +1,6 @@
/*
* ZeroTier One - Network Virtualization Everywhere
* Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
* 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
@ -14,6 +14,14 @@
*
* 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
@ -64,11 +72,11 @@ public:
return;
char myAddressStr[64];
Utils::snprintf(myAddressStr,sizeof(myAddressStr),"%.10llx",myAddress);
Utils::ztsnprintf(myAddressStr,sizeof(myAddressStr),"%.10llx",myAddress);
std::vector<std::string> lines(Utils::split(cf.c_str(),"\r\n","",""));
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(Utils::split(l->c_str()," \t","",""));
std::vector<std::string> fields(OSUtils::split(l->c_str()," \t","",""));
if ((fields.size() < 5)||(fields[0][0] == '#')||(fields[0] != myAddressStr))
continue;
@ -93,7 +101,7 @@ public:
md.id = (unsigned int)id;
if (fields.size() >= 6) {
std::vector<std::string> xyz(Utils::split(fields[5].c_str(),",","",""));
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;
@ -102,7 +110,7 @@ public:
md.clusterEndpoint.fromString(fields[3]);
if (!md.clusterEndpoint)
continue;
std::vector<std::string> zips(Utils::split(fields[4].c_str(),",","",""));
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);

12
service/ClusterGeoIpService.cpp → attic/ClusterGeoIpService.cpp
View File

@ -1,6 +1,6 @@
/*
* ZeroTier One - Network Virtualization Everywhere
* Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
* 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
@ -14,6 +14,14 @@
*
* 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
@ -101,7 +109,7 @@ bool ClusterGeoIpService::locate(const InetAddress &ip,int &x,int &y,int &z)
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(Utils::split(line,",\t","\\","\"'"));
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()))&&

10
service/ClusterGeoIpService.hpp → attic/ClusterGeoIpService.hpp
View File

@ -1,6 +1,6 @@
/*
* ZeroTier One - Network Virtualization Everywhere
* Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
* 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
@ -14,6 +14,14 @@
*
* 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

101
attic/FCV.hpp Normal file
View File

@ -0,0 +1,101 @@
/*
* 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

408
attic/Filter.cpp
View File

@ -1,408 +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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include <algorithm>
#include "RuntimeEnvironment.hpp"
#include "Logger.hpp"
#include "Filter.hpp"
#include "Utils.hpp"
namespace ZeroTier {
const char *const Filter::UNKNOWN_NAME = "(unknown)";
const Range<unsigned int> Filter::ANY;
static inline Range<unsigned int> __parseRange(char *r)
throw(std::invalid_argument)
{
char *saveptr = (char *)0;
unsigned int a = 0;
unsigned int b = 0;
unsigned int fn = 0;
for(char *f=Utils::stok(r,"-",&saveptr);(f);f=Utils::stok((char *)0,"-",&saveptr)) {
if (*f) {
switch(fn++) {
case 0:
if (*f != '*')
a = b = (unsigned int)strtoul(f,(char **)0,10);
break;
case 1:
if (*f != '*')
b = (unsigned int)strtoul(f,(char **)0,10);
break;
default:
throw std::invalid_argument("rule range must be <int>, <int>-<int>, or *");
}
}
}
return Range<unsigned int>(a,b);
}
Filter::Rule::Rule(const char *s)
throw(std::invalid_argument)
{
char *saveptr = (char *)0;
char tmp[256];
if (!Utils::scopy(tmp,sizeof(tmp),s))
throw std::invalid_argument("rule string too long");
unsigned int fn = 0;
for(char *f=Utils::stok(tmp,";",&saveptr);(f);f=Utils::stok((char *)0,";",&saveptr)) {
if (*f) {
switch(fn++) {
case 0:
_etherType = __parseRange(f);
break;
case 1:
_protocol = __parseRange(f);
break;
case 2:
_port = __parseRange(f);
break;
default:
throw std::invalid_argument("rule string has unknown extra fields");
}
}
}
if (fn != 3)
throw std::invalid_argument("rule string must contain 3 fields");
}
bool Filter::Rule::operator()(unsigned int etype,const void *data,unsigned int len) const
throw(std::invalid_argument)
{
if ((!_etherType)||(_etherType(etype))) { // ethertype is ANY, or matches
// Ethertype determines meaning of protocol and port
switch(etype) {
case ZT_ETHERTYPE_IPV4:
if (len > 20) {
if ((!_protocol)||(_protocol(((const uint8_t *)data)[9]))) { // protocol is ANY or match
if (!_port) // port is ANY
return true;
// Don't match on fragments beyond fragment 0. If we've blocked
// fragment 0, further fragments will fall on deaf ears anyway.
if ((Utils::ntoh(((const uint16_t *)data)[3]) & 0x1fff))
return false;
// Internet header length determines where data begins, in multiples of 32 bits
unsigned int ihl = 4 * (((const uint8_t *)data)[0] & 0x0f);
switch(((const uint8_t *)data)[9]) { // port's meaning depends on IP protocol
case ZT_IPPROTO_ICMP:
// For ICMP, port is ICMP type
return _port(((const uint8_t *)data)[ihl]);
case ZT_IPPROTO_TCP:
case ZT_IPPROTO_UDP:
case ZT_IPPROTO_SCTP:
case ZT_IPPROTO_UDPLITE:
// For these, port is destination port. Protocol designers were
// nice enough to put the field in the same place.
return _port(((const uint16_t *)data)[(ihl / 2) + 1]);
default:
// port has no meaning for other IP types, so ignore it
return true;
}
return false; // no match on port
}
} else throw std::invalid_argument("undersized IPv4 packet");
break;
case ZT_ETHERTYPE_IPV6:
if (len > 40) {
int nextHeader = ((const uint8_t *)data)[6];
unsigned int pos = 40;
while ((pos < len)&&(nextHeader >= 0)&&(nextHeader != 59)) { // 59 == no next header
fprintf(stderr,"[rule] V6: start header parse, header %.2x pos %d\n",nextHeader,pos);
switch(nextHeader) {
case 0: // hop-by-hop options
case 60: // destination options
case 43: // routing
case 135: // mobility (mobile IPv6 options)
if (_protocol((unsigned int)nextHeader))
return true; // match if our goal was to match any of these
nextHeader = ((const uint8_t *)data)[pos];
pos += 8 + (8 * ((const uint8_t *)data)[pos + 1]);
break;
case 44: // fragment
if (_protocol(44))
return true; // match if our goal was to match fragments
nextHeader = ((const uint8_t *)data)[pos];
pos += 8;
break;
case ZT_IPPROTO_AH: // AH
return _protocol(ZT_IPPROTO_AH); // true if AH is matched protocol, otherwise false since packet will be IPsec
case ZT_IPPROTO_ESP: // ESP
return _protocol(ZT_IPPROTO_ESP); // true if ESP is matched protocol, otherwise false since packet will be IPsec
case ZT_IPPROTO_ICMPV6:
// Only match ICMPv6 if we've selected it specifically
if (_protocol(ZT_IPPROTO_ICMPV6)) {
// Port is interpreted as ICMPv6 type
if ((!_port)||(_port(((const uint8_t *)data)[pos])))
return true;
}
break;
case ZT_IPPROTO_TCP:
case ZT_IPPROTO_UDP:
case ZT_IPPROTO_SCTP:
case ZT_IPPROTO_UDPLITE:
// If we encounter any of these, match if protocol matches or is wildcard as
// we'll consider these the "real payload" if present.
if ((!_protocol)||(_protocol(nextHeader))) {
if ((!_port)||(_port(((const uint16_t *)data)[(pos / 2) + 1])))
return true; // protocol matches or is ANY, port is ANY or matches
}
break;
default: {
char foo[128];
Utils::snprintf(foo,sizeof(foo),"unrecognized IPv6 header type %d",(int)nextHeader);
throw std::invalid_argument(foo);
}
}
fprintf(stderr,"[rule] V6: end header parse, next header %.2x, new pos %d\n",nextHeader,pos);
}
} else throw std::invalid_argument("undersized IPv6 packet");
break;
default:
// For other ethertypes, protocol and port are ignored. What would they mean?
return true;
}
}
return false;
}
std::string Filter::Rule::toString() const
{
char buf[128];
std::string s;
switch(_etherType.magnitude()) {
case 0:
s.push_back('*');
break;
case 1:
Utils::snprintf(buf,sizeof(buf),"%u",_etherType.start);
s.append(buf);
break;
default:
Utils::snprintf(buf,sizeof(buf),"%u-%u",_etherType.start,_etherType.end);
s.append(buf);
break;
}
s.push_back(';');
switch(_protocol.magnitude()) {
case 0:
s.push_back('*');
break;
case 1:
Utils::snprintf(buf,sizeof(buf),"%u",_protocol.start);
s.append(buf);
break;
default:
Utils::snprintf(buf,sizeof(buf),"%u-%u",_protocol.start,_protocol.end);
s.append(buf);
break;
}
s.push_back(';');
switch(_port.magnitude()) {
case 0:
s.push_back('*');
break;
case 1:
Utils::snprintf(buf,sizeof(buf),"%u",_port.start);
s.append(buf);
break;
default:
Utils::snprintf(buf,sizeof(buf),"%u-%u",_port.start,_port.end);
s.append(buf);
break;
}
return s;
}
Filter::Filter(const char *s)
throw(std::invalid_argument)
{
char tmp[16384];
if (!Utils::scopy(tmp,sizeof(tmp),s))
throw std::invalid_argument("filter string too long");
char *saveptr = (char *)0;
unsigned int fn = 0;
for(char *f=Utils::stok(tmp,",",&saveptr);(f);f=Utils::stok((char *)0,",",&saveptr)) {
try {
_rules.push_back(Rule(f));
++fn;
} catch (std::invalid_argument &exc) {
char tmp[256];
Utils::snprintf(tmp,sizeof(tmp),"invalid rule at index %u: %s",fn,exc.what());
throw std::invalid_argument(tmp);
}
}
std::sort(_rules.begin(),_rules.end());
}
std::string Filter::toString() const
{
std::string s;
for(std::vector<Rule>::const_iterator r(_rules.begin());r!=_rules.end();++r) {
if (s.length() > 0)
s.push_back(',');
s.append(r->toString());
}
return s;
}
void Filter::add(const Rule &r)
{
for(std::vector<Rule>::iterator rr(_rules.begin());rr!=_rules.end();++rr) {
if (r == *rr)
return;
}
_rules.push_back(r);
std::sort(_rules.begin(),_rules.end());
}
const char *Filter::etherTypeName(const unsigned int etherType)
throw()
{
switch(etherType) {
case ZT_ETHERTYPE_IPV4: return "ETHERTYPE_IPV4";
case ZT_ETHERTYPE_ARP: return "ETHERTYPE_ARP";
case ZT_ETHERTYPE_RARP: return "ETHERTYPE_RARP";
case ZT_ETHERTYPE_ATALK: return "ETHERTYPE_ATALK";
case ZT_ETHERTYPE_AARP: return "ETHERTYPE_AARP";
case ZT_ETHERTYPE_IPX_A: return "ETHERTYPE_IPX_A";
case ZT_ETHERTYPE_IPX_B: return "ETHERTYPE_IPX_B";
case ZT_ETHERTYPE_IPV6: return "ETHERTYPE_IPV6";
}
return UNKNOWN_NAME;
}
const char *Filter::ipProtocolName(const unsigned int ipp)
throw()
{
switch(ipp) {
case ZT_IPPROTO_ICMP: return "IPPROTO_ICMP";
case ZT_IPPROTO_IGMP: return "IPPROTO_IGMP";
case ZT_IPPROTO_TCP: return "IPPROTO_TCP";
case ZT_IPPROTO_UDP: return "IPPROTO_UDP";
case ZT_IPPROTO_GRE: return "IPPROTO_GRE";
case ZT_IPPROTO_ESP: return "IPPROTO_ESP";
case ZT_IPPROTO_AH: return "IPPROTO_AH";
case ZT_IPPROTO_ICMPV6: return "IPPROTO_ICMPV6";
case ZT_IPPROTO_OSPF: return "IPPROTO_OSPF";
case ZT_IPPROTO_IPIP: return "IPPROTO_IPIP";
case ZT_IPPROTO_IPCOMP: return "IPPROTO_IPCOMP";
case ZT_IPPROTO_L2TP: return "IPPROTO_L2TP";
case ZT_IPPROTO_SCTP: return "IPPROTO_SCTP";
case ZT_IPPROTO_FC: return "IPPROTO_FC";
case ZT_IPPROTO_UDPLITE: return "IPPROTO_UDPLITE";
case ZT_IPPROTO_HIP: return "IPPROTO_HIP";
}
return UNKNOWN_NAME;
}
const char *Filter::icmpTypeName(const unsigned int icmpType)
throw()
{
switch(icmpType) {
case ZT_ICMP_ECHO_REPLY: return "ICMP_ECHO_REPLY";
case ZT_ICMP_DESTINATION_UNREACHABLE: return "ICMP_DESTINATION_UNREACHABLE";
case ZT_ICMP_SOURCE_QUENCH: return "ICMP_SOURCE_QUENCH";
case ZT_ICMP_REDIRECT: return "ICMP_REDIRECT";
case ZT_ICMP_ALTERNATE_HOST_ADDRESS: return "ICMP_ALTERNATE_HOST_ADDRESS";
case ZT_ICMP_ECHO_REQUEST: return "ICMP_ECHO_REQUEST";
case ZT_ICMP_ROUTER_ADVERTISEMENT: return "ICMP_ROUTER_ADVERTISEMENT";
case ZT_ICMP_ROUTER_SOLICITATION: return "ICMP_ROUTER_SOLICITATION";
case ZT_ICMP_TIME_EXCEEDED: return "ICMP_TIME_EXCEEDED";
case ZT_ICMP_BAD_IP_HEADER: return "ICMP_BAD_IP_HEADER";
case ZT_ICMP_TIMESTAMP: return "ICMP_TIMESTAMP";
case ZT_ICMP_TIMESTAMP_REPLY: return "ICMP_TIMESTAMP_REPLY";
case ZT_ICMP_INFORMATION_REQUEST: return "ICMP_INFORMATION_REQUEST";
case ZT_ICMP_INFORMATION_REPLY: return "ICMP_INFORMATION_REPLY";
case ZT_ICMP_ADDRESS_MASK_REQUEST: return "ICMP_ADDRESS_MASK_REQUEST";
case ZT_ICMP_ADDRESS_MASK_REPLY: return "ICMP_ADDRESS_MASK_REPLY";
case ZT_ICMP_TRACEROUTE: return "ICMP_TRACEROUTE";
case ZT_ICMP_MOBILE_HOST_REDIRECT: return "ICMP_MOBILE_HOST_REDIRECT";
case ZT_ICMP_MOBILE_REGISTRATION_REQUEST: return "ICMP_MOBILE_REGISTRATION_REQUEST";
case ZT_ICMP_MOBILE_REGISTRATION_REPLY: return "ICMP_MOBILE_REGISTRATION_REPLY";
}
return UNKNOWN_NAME;
}
const char *Filter::icmp6TypeName(const unsigned int icmp6Type)
throw()
{
switch(icmp6Type) {
case ZT_ICMP6_DESTINATION_UNREACHABLE: return "ICMP6_DESTINATION_UNREACHABLE";
case ZT_ICMP6_PACKET_TOO_BIG: return "ICMP6_PACKET_TOO_BIG";
case ZT_ICMP6_TIME_EXCEEDED: return "ICMP6_TIME_EXCEEDED";
case ZT_ICMP6_PARAMETER_PROBLEM: return "ICMP6_PARAMETER_PROBLEM";
case ZT_ICMP6_ECHO_REQUEST: return "ICMP6_ECHO_REQUEST";
case ZT_ICMP6_ECHO_REPLY: return "ICMP6_ECHO_REPLY";
case ZT_ICMP6_MULTICAST_LISTENER_QUERY: return "ICMP6_MULTICAST_LISTENER_QUERY";
case ZT_ICMP6_MULTICAST_LISTENER_REPORT: return "ICMP6_MULTICAST_LISTENER_REPORT";
case ZT_ICMP6_MULTICAST_LISTENER_DONE: return "ICMP6_MULTICAST_LISTENER_DONE";
case ZT_ICMP6_ROUTER_SOLICITATION: return "ICMP6_ROUTER_SOLICITATION";
case ZT_ICMP6_ROUTER_ADVERTISEMENT: return "ICMP6_ROUTER_ADVERTISEMENT";
case ZT_ICMP6_NEIGHBOR_SOLICITATION: return "ICMP6_NEIGHBOR_SOLICITATION";
case ZT_ICMP6_NEIGHBOR_ADVERTISEMENT: return "ICMP6_NEIGHBOR_ADVERTISEMENT";
case ZT_ICMP6_REDIRECT_MESSAGE: return "ICMP6_REDIRECT_MESSAGE";
case ZT_ICMP6_ROUTER_RENUMBERING: return "ICMP6_ROUTER_RENUMBERING";
case ZT_ICMP6_NODE_INFORMATION_QUERY: return "ICMP6_NODE_INFORMATION_QUERY";
case ZT_ICMP6_NODE_INFORMATION_RESPONSE: return "ICMP6_NODE_INFORMATION_RESPONSE";
case ZT_ICMP6_INV_NEIGHBOR_SOLICITATION: return "ICMP6_INV_NEIGHBOR_SOLICITATION";
case ZT_ICMP6_INV_NEIGHBOR_ADVERTISEMENT: return "ICMP6_INV_NEIGHBOR_ADVERTISEMENT";
case ZT_ICMP6_MLDV2: return "ICMP6_MLDV2";
case ZT_ICMP6_HOME_AGENT_ADDRESS_DISCOVERY_REQUEST: return "ICMP6_HOME_AGENT_ADDRESS_DISCOVERY_REQUEST";
case ZT_ICMP6_HOME_AGENT_ADDRESS_DISCOVERY_REPLY: return "ICMP6_HOME_AGENT_ADDRESS_DISCOVERY_REPLY";
case ZT_ICMP6_MOBILE_PREFIX_SOLICITATION: return "ICMP6_MOBILE_PREFIX_SOLICITATION";
case ZT_ICMP6_MOBILE_PREFIX_ADVERTISEMENT: return "ICMP6_MOBILE_PREFIX_ADVERTISEMENT";
case ZT_ICMP6_CERTIFICATION_PATH_SOLICITATION: return "ICMP6_CERTIFICATION_PATH_SOLICITATION";
case ZT_ICMP6_CERTIFICATION_PATH_ADVERTISEMENT: return "ICMP6_CERTIFICATION_PATH_ADVERTISEMENT";
case ZT_ICMP6_MULTICAST_ROUTER_ADVERTISEMENT: return "ICMP6_MULTICAST_ROUTER_ADVERTISEMENT";
case ZT_ICMP6_MULTICAST_ROUTER_SOLICITATION: return "ICMP6_MULTICAST_ROUTER_SOLICITATION";
case ZT_ICMP6_MULTICAST_ROUTER_TERMINATION: return "ICMP6_MULTICAST_ROUTER_TERMINATION";
case ZT_ICMP6_RPL_CONTROL_MESSAGE: return "ICMP6_RPL_CONTROL_MESSAGE";
}
return UNKNOWN_NAME;
}
} // namespace ZeroTier

284
attic/Filter.hpp
View File

@ -1,284 +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_FILTER_HPP
#define _ZT_FILTER_HPP
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#include <utility>
#include <stdexcept>
#include "Range.hpp"
/* Ethernet frame types that might be relevant to us */
#define ZT_ETHERTYPE_IPV4 0x0800
#define ZT_ETHERTYPE_ARP 0x0806
#define ZT_ETHERTYPE_RARP 0x8035
#define ZT_ETHERTYPE_ATALK 0x809b
#define ZT_ETHERTYPE_AARP 0x80f3
#define ZT_ETHERTYPE_IPX_A 0x8137
#define ZT_ETHERTYPE_IPX_B 0x8138
#define ZT_ETHERTYPE_IPV6 0x86dd
/* IP protocols we might care about */
#define ZT_IPPROTO_ICMP 0x01
#define ZT_IPPROTO_IGMP 0x02
#define ZT_IPPROTO_TCP 0x06
#define ZT_IPPROTO_UDP 0x11
#define ZT_IPPROTO_GRE 0x2f
#define ZT_IPPROTO_ESP 0x32
#define ZT_IPPROTO_AH 0x33
#define ZT_IPPROTO_ICMPV6 0x3a
#define ZT_IPPROTO_OSPF 0x59
#define ZT_IPPROTO_IPIP 0x5e
#define ZT_IPPROTO_IPCOMP 0x6c
#define ZT_IPPROTO_L2TP 0x73
#define ZT_IPPROTO_SCTP 0x84
#define ZT_IPPROTO_FC 0x85
#define ZT_IPPROTO_UDPLITE 0x88
#define ZT_IPPROTO_HIP 0x8b
/* IPv4 ICMP types */
#define ZT_ICMP_ECHO_REPLY 0
#define ZT_ICMP_DESTINATION_UNREACHABLE 3
#define ZT_ICMP_SOURCE_QUENCH 4
#define ZT_ICMP_REDIRECT 5
#define ZT_ICMP_ALTERNATE_HOST_ADDRESS 6
#define ZT_ICMP_ECHO_REQUEST 8
#define ZT_ICMP_ROUTER_ADVERTISEMENT 9
#define ZT_ICMP_ROUTER_SOLICITATION 10
#define ZT_ICMP_TIME_EXCEEDED 11
#define ZT_ICMP_BAD_IP_HEADER 12
#define ZT_ICMP_TIMESTAMP 13
#define ZT_ICMP_TIMESTAMP_REPLY 14
#define ZT_ICMP_INFORMATION_REQUEST 15
#define ZT_ICMP_INFORMATION_REPLY 16
#define ZT_ICMP_ADDRESS_MASK_REQUEST 17
#define ZT_ICMP_ADDRESS_MASK_REPLY 18
#define ZT_ICMP_TRACEROUTE 30
#define ZT_ICMP_MOBILE_HOST_REDIRECT 32
#define ZT_ICMP_MOBILE_REGISTRATION_REQUEST 35
#define ZT_ICMP_MOBILE_REGISTRATION_REPLY 36
/* IPv6 ICMP types */
#define ZT_ICMP6_DESTINATION_UNREACHABLE 1
#define ZT_ICMP6_PACKET_TOO_BIG 2
#define ZT_ICMP6_TIME_EXCEEDED 3
#define ZT_ICMP6_PARAMETER_PROBLEM 4
#define ZT_ICMP6_ECHO_REQUEST 128
#define ZT_ICMP6_ECHO_REPLY 129
#define ZT_ICMP6_MULTICAST_LISTENER_QUERY 130
#define ZT_ICMP6_MULTICAST_LISTENER_REPORT 131
#define ZT_ICMP6_MULTICAST_LISTENER_DONE 132
#define ZT_ICMP6_ROUTER_SOLICITATION 133
#define ZT_ICMP6_ROUTER_ADVERTISEMENT 134
#define ZT_ICMP6_NEIGHBOR_SOLICITATION 135
#define ZT_ICMP6_NEIGHBOR_ADVERTISEMENT 136
#define ZT_ICMP6_REDIRECT_MESSAGE 137
#define ZT_ICMP6_ROUTER_RENUMBERING 138
#define ZT_ICMP6_NODE_INFORMATION_QUERY 139
#define ZT_ICMP6_NODE_INFORMATION_RESPONSE 140
#define ZT_ICMP6_INV_NEIGHBOR_SOLICITATION 141
#define ZT_ICMP6_INV_NEIGHBOR_ADVERTISEMENT 142
#define ZT_ICMP6_MLDV2 143
#define ZT_ICMP6_HOME_AGENT_ADDRESS_DISCOVERY_REQUEST 144
#define ZT_ICMP6_HOME_AGENT_ADDRESS_DISCOVERY_REPLY 145
#define ZT_ICMP6_MOBILE_PREFIX_SOLICITATION 146
#define ZT_ICMP6_MOBILE_PREFIX_ADVERTISEMENT 147
#define ZT_ICMP6_CERTIFICATION_PATH_SOLICITATION 148
#define ZT_ICMP6_CERTIFICATION_PATH_ADVERTISEMENT 149
#define ZT_ICMP6_MULTICAST_ROUTER_ADVERTISEMENT 151
#define ZT_ICMP6_MULTICAST_ROUTER_SOLICITATION 152
#define ZT_ICMP6_MULTICAST_ROUTER_TERMINATION 153
#define ZT_ICMP6_RPL_CONTROL_MESSAGE 155
namespace ZeroTier {
class RuntimeEnvironment;
/**
* A simple Ethernet frame level filter
*
* This doesn't specify actions, since it's used as a deny filter. The rule
* in ZT1 is "that which is not explicitly prohibited is allowed." (Except for
* ethertypes, which are handled by a whitelist.)
*/
class Filter
{
public:
/**
* Value returned by etherTypeName, etc. on unknown
*
* These static methods return precisely this, so a pointer equality
* check will work.
*/
static const char *const UNKNOWN_NAME;
/**
* An empty range as a more idiomatic way of specifying a wildcard match
*/
static const Range<unsigned int> ANY;
/**
* A filter rule
*/
class Rule
{
public:
Rule()
throw() :
_etherType(),
_protocol(),
_port()
{
}
/**
* Construct a rule from a string-serialized value
*
* @param s String formatted rule, such as returned by toString()
* @throws std::invalid_argument String formatted rule is not valid
*/
Rule(const char *s)
throw(std::invalid_argument);
/**
* Construct a new rule
*
* @param etype Ethernet type or empty range for ANY
* @param prot Protocol or empty range for ANY (meaning depends on ethertype, e.g. IP protocol numbers)
* @param prt Port or empty range for ANY (only applies to some protocols)
*/
Rule(const Range<unsigned int> &etype,const Range<unsigned int> &prot,const Range<unsigned int> &prt)
throw() :
_etherType(etype),
_protocol(prot),
_port(prt)
{
}
inline const Range<unsigned int> &etherType() const throw() { return _etherType; }
inline const Range<unsigned int> &protocol() const throw() { return _protocol; }
inline const Range<unsigned int> &port() const throw() { return _port; }
/**
* Test this rule against a frame
*
* @param etype Type of ethernet frame
* @param data Ethernet frame data
* @param len Length of ethernet frame
* @return True if rule matches
* @throws std::invalid_argument Frame invalid or not parseable
*/
bool operator()(unsigned int etype,const void *data,unsigned int len) const
throw(std::invalid_argument);
/**
* Serialize rule as string
*
* @return Human readable representation of rule
*/
std::string toString() const;
inline bool operator==(const Rule &r) const throw() { return ((_etherType == r._etherType)&&(_protocol == r._protocol)&&(_port == r._port)); }
inline bool operator!=(const Rule &r) const throw() { return !(*this == r); }
inline bool operator<(const Rule &r) const
throw()
{
if (_etherType < r._etherType)
return true;
else if (_etherType == r._etherType) {
if (_protocol < r._protocol)
return true;
else if (_protocol == r._protocol) {
if (_port < r._port)
return true;
}
}
return false;
}
inline bool operator>(const Rule &r) const throw() { return (r < *this); }
inline bool operator<=(const Rule &r) const throw() { return !(r < *this); }
inline bool operator>=(const Rule &r) const throw() { return !(*this < r); }
private:
Range<unsigned int> _etherType;
Range<unsigned int> _protocol;
Range<unsigned int> _port;
};
Filter() {}
/**
* @param s String-serialized filter representation
*/
Filter(const char *s)
throw(std::invalid_argument);
/**
* @return Comma-delimited list of string-format rules
*/
std::string toString() const;
/**
* Add a rule to this filter
*
* @param r Rule to add to filter
*/
void add(const Rule &r);
inline bool operator()(unsigned int etype,const void *data,unsigned int len) const
throw(std::invalid_argument)
{
for(std::vector<Rule>::const_iterator r(_rules.begin());r!=_rules.end();++r) {
if ((*r)(etype,data,len))
return true;
}
return false;
}
static const char *etherTypeName(const unsigned int etherType)
throw();
static const char *ipProtocolName(const unsigned int ipp)
throw();
static const char *icmpTypeName(const unsigned int icmpType)
throw();
static const char *icmp6TypeName(const unsigned int icmp6Type)
throw();
private:
std::vector<Rule> _rules;
};
} // namespace ZeroTier
#endif

84
attic/SECURITY.md
View File

@ -1,84 +0,0 @@
ZeroTier Security
======
## Summary
## Using ZeroTier Securely
### Overall Recommendations
*TL;DR: same as anything else: defense in depth defense in depth defense in depth.*
We encourage our users to treat private ZeroTier networks as being rougly equivalent in security to WPA2-enterprise securied WiFi or on-premise wired Ethernet. (Public networks on the other hand are open by design.) That means they're networks with perimeters, but like all networks the compromise of any participating device or network controller allows an attacker to breach this perimeter.
**Never trust the network.** Many modern security professionals discourage reliance on network perimeters as major components in any security strategy, and we strongly agree regardless of whether your network is physical or virtual.
As part of a defense in depth approach **we specifically encourage the use of other secure protocols and authentication systems over ZeroTier networks**. While the use of secure encrypted protocols like SSH and SSL over ZeroTier adds a bit more overhead, it greatly reduces the chance of total compromise.
Imagine that the per-day probability of a major "0-day" security flaw in ZeroTier and OpenSSH are both roughly 0.001 or one per thousand days. Using both at the same time gives you a cumulative 0-day risk of roughly 0.000001 or one per one million days.
Those are made-up numbers. In reality these probabilities can't be known ahead of time. History shows that a 0-day could be found in anything tomorrow, next week, or never. But layers of security give you an overall posture that is the product -- more than the sum -- of its parts. That's how defense in depth works.
### ZeroTier Specifics
#### Protect Your Identity
Each ZeroTier device has an identity. The secret portion of this identity is stored in a file called "identity.secret." *Protect this file.* If it's stolen your device's identity (as represented by its 10-digit ZeroTier address) can easily be stolen or impersonated and your traffic can be decrypted or man-in-the-middle'd.
#### Protect Your Controller
The second major component of ZeroTier network security is the network controller. It's responsible for issuing certificates and configuration information to all network members. That makes it a certificate authority. Compromise of the controller allows an attacker to join or disrupt any network the controller controls. It does *not*, however, allow an attacker to decrypt peer to peer unicast traffic.
If you are using our controller-as-a-service at [my.zerotier.com](https://my.zerotier.com), you are delegating this responsibility to us.
## Security Priorities
These are our security "must-haves." If the system fails in any of these objectives it is broken.
* ZeroTier must be secure against remote vulnerabilities. This includes things like unauthorized remote control, remote penetration of the device using ZeroTier as a vector, or remote injection of malware.
* The content (but not meta-data) of communication must be secure against eavesdropping on the wire by any known means. (We can't warrant against secret vulnerabilities against ciphers, etc., or anything else we don't know about.)
* Communication must be secure against man-in-the-middle attacks and remote device impersonation.
## Security Non-Priorities
There are a few aspects of security we knowingly do not address, since doing so would be beyond scope or would conflict too greatly with other priorities.
* ZeroTier makes no effort to conceal communication meta-data such as source and destination addresses and the amount of information transferred between peers. To do this more or less requires onion routing or other "heavy" approaches to anonymity, and this is beyond scope.
* ZeroTier does not implement complex certificate chains, X.509, or other feature-rich (some would say feature-laden) cryptographic stuff. We only implement the crypto we need to get the job done.
* We don't take extraordinary measures to preserve security under conditions in which an endpoint device has been penetrated by other means (e.g. "rooted" by third party malware) or physicall compromised. If someone steals your keys they've stolen your keys, and if they've "pwned" your device they can easily eavesdrop on everything directly.
## Insecurities and Areas for Improvement
The only perfectly secure system is one that is off. All real world systems have potential security weaknesses. If possible, we like to know what these are and acknowledge their existence.
In some cases we plan to improve these. In other cases we have deliberately decided to "punt" on them in favor of some other priority (see philosophy). We may or may not revisit this decision in the future.
* We don't implement forward secrecy / ephemeral keys. A [discussion of this can be found at the closed GitHub issue for this feature](https://github.com/zerotier/ZeroTierOne/issues/204). In short: we've decided to "punt" on this feature because it introduces complexity and state negotiation. One of the design goals of ZeroTier is "reliability convergence" -- the reliability of ZeroTier virtual networks should rapidly converge with that of the underlying physical wire. Any state that must be negotiated prior to communication multiplies the probability of delay or failure due to packet loss. We *may* revisit this decision at a later date.
## Secure Coding Practices
The first line of defense employed against remote vulnerabilities and other major security flaws is the use of secure coding practices. These are, in no particular order:
* All parsing of remote messages is performed via higher level safe bounds-checked data structures and interfaces. See node/Buffer.hpp for one of the core elements of this.
* C++ exceptions are used to ensure that any unhandled failure or error condition (such as a bounds checking violation) results in the safe and complete termination of message processing. Invalid messages are dropped and ignored.
* Minimalism is a secure coding practice. There is an exponential relationship between complexity and the probability of bugs, and complex designs are much harder to audit and reason about.
* Our build scripts try to enable any OS and compiler level security features such as ASLR and "stack canaries" on non-debug builds.
## Cryptographic Security Practices
* We use [boring crypto](https://cr.yp.to/talks/2015.10.05/slides-djb-20151005-a4.pdf). A single symmetric algorithm (Salsa20/12), a single asymmetric algorithm (Curve25519 ECDH-256), and a single MAC (Poly1305). The way these algorithms are used is identical to how they're used in the NaCl reference implementation. The protocol supports selection of alternative algorithms but only for "future proofing" in the case that a serious flaw is discovered in any of these. Avoiding algorithm bloat and cryptographic state negotiation helps guard against down-grade, "oracle," and other protocol level attacks.
* Authenticated encryption is employed with authentication being performed prior to any other operations on received messages. See also: [the cryptographic doom principle](https://moxie.org/blog/the-cryptographic-doom-principle/).
* "Never branch on anything secret" -- deterministic-time comparisons and other operations are used in cryptographic operations. See Utils::secureEq() in node/Utils.hpp.
* OS-derived crypographic random numbers (/dev/urandom or Windows CryptGenRandom) are further randomized using encryption by a secondary key with a secondary source of entropy to guard against CSPRNG bugs. Such OS-level CSPRNG bugs have been found in the past. See Utils::getSecureRandom() in node/Utils.hpp.

BIN
attic/big-http-test/2015-11-10_01_50000.out.xz
View File

Binary file not shown.

BIN
attic/big-http-test/2015-11-10_02_50000.out.xz
View File

Binary file not shown.

BIN
attic/big-http-test/2015-11-10_03_12500_ec2-east-only.out.xz
View File

Binary file not shown.

24
attic/big-http-test/Dockerfile
View File

@ -1,24 +0,0 @@
FROM centos:latest
MAINTAINER https://www.zerotier.com/
EXPOSE 9993/udp
ADD nodesource-el.repo /etc/yum.repos.d/nodesource-el.repo
RUN yum -y update && yum install -y nodejs && yum clean all
RUN mkdir -p /var/lib/zerotier-one
RUN mkdir -p /var/lib/zerotier-one/networks.d
RUN touch /var/lib/zerotier-one/networks.d/ffffffffffffffff.conf
ADD package.json /
RUN npm install
ADD zerotier-one /
RUN chmod a+x /zerotier-one
ADD agent.js /
ADD docker-main.sh /
RUN chmod a+x /docker-main.sh
CMD ["./docker-main.sh"]

12
attic/big-http-test/README.md
View File

@ -1,12 +0,0 @@
HTTP one-to-all test
======
*This is really internal use code. You're free to test it out but expect to do some editing/tweaking to make it work. We used this to run some massive scale tests of our new geo-cluster-based root server infrastructure prior to taking it live.*
Before using this code you will want to edit agent.js to change SERVER_HOST to the IP address of where you will run server.js. This should typically be an open Internet IP, since this makes reporting not dependent upon the thing being tested. Also note that this thing does no security of any kind. It's designed for one-off tests run over a short period of time, not to be anything that runs permanently. You will also want to edit the Dockerfile if you want to build containers and change the network ID to the network you want to run tests over.
This code can be deployed across a large number of VMs or containers to test and benchmark HTTP traffic within a virtual network at scale. The agent acts as a server and can query other agents, while the server collects agent data and tells agents about each other. It's designed to use RFC4193-based ZeroTier IPv6 addresses within the cluster, which allows the easy provisioning of a large cluster without IP conflicts.
The Dockerfile builds an image that launches the agent. The image must be "docker run" with "--device=/dev/net/tun --privileged" to permit it to open a tun/tap device within the container. (Unfortunately CAP_NET_ADMIN may not work due to a bug in Docker and/or Linux.) You can run a bunch with a command like:
for ((n=0;n<10;n++)); do docker run --device=/dev/net/tun --privileged -d zerotier/http-test; done

196
attic/big-http-test/agent.js
View File

@ -1,196 +0,0 @@
// ZeroTier distributed HTTP test agent
// ---------------------------------------------------------------------------
// Customizable parameters:
// Time between startup and first test attempt
var TEST_STARTUP_LAG = 10000;
// Maximum interval between test attempts (actual timing is random % this)
var TEST_INTERVAL_MAX = (60000 * 10);
// Test timeout in ms
var TEST_TIMEOUT = 30000;
// Where should I get other agents' IDs and POST results?
var SERVER_HOST = '52.26.196.147';
var SERVER_PORT = 18080;
// Which port do agents use to serve up test data to each other?
var AGENT_PORT = 18888;
// Payload size in bytes
var PAYLOAD_SIZE = 5000;
// ---------------------------------------------------------------------------
var ipaddr = require('ipaddr.js');
var os = require('os');
var http = require('http');
var async = require('async');
var express = require('express');
var app = express();
// Find our ZeroTier-assigned RFC4193 IPv6 address
var thisAgentId = null;
var interfaces = os.networkInterfaces();
if (!interfaces) {
console.error('FATAL: os.networkInterfaces() failed.');
process.exit(1);
}
for(var ifname in interfaces) {
var ifaddrs = interfaces[ifname];
if (Array.isArray(ifaddrs)) {
for(var i=0;i<ifaddrs.length;++i) {
if (ifaddrs[i].family == 'IPv6') {
try {
var ipbytes = ipaddr.parse(ifaddrs[i].address).toByteArray();
if ((ipbytes.length === 16)&&(ipbytes[0] == 0xfd)&&(ipbytes[9] == 0x99)&&(ipbytes[10] == 0x93)) {
thisAgentId = '';
for(var j=0;j<16;++j) {
var tmp = ipbytes[j].toString(16);
if (tmp.length === 1)
thisAgentId += '0';
thisAgentId += tmp;
}
}
} catch (e) {
console.error(e);
}
}
}
}
}
if (thisAgentId === null) {
console.error('FATAL: no ZeroTier-assigned RFC4193 IPv6 addresses found on any local interface!');
process.exit(1);
}
//console.log(thisAgentId);
// Create a random (and therefore not very compressable) payload
var payload = new Buffer(PAYLOAD_SIZE);
for(var xx=0;xx<PAYLOAD_SIZE;++xx) {
payload.writeUInt8(Math.round(Math.random() * 255.0),xx);
}
function agentIdToIp(agentId)
{
var ip = '';
ip += agentId.substr(0,4);
ip += ':';
ip += agentId.substr(4,4);
ip += ':';
ip += agentId.substr(8,4);
ip += ':';
ip += agentId.substr(12,4);
ip += ':';
ip += agentId.substr(16,4);
ip += ':';
ip += agentId.substr(20,4);
ip += ':';
ip += agentId.substr(24,4);
ip += ':';
ip += agentId.substr(28,4);
return ip;
};
var lastTestResult = null;
var allOtherAgents = {};
function doTest()
{
var submit = http.request({
host: SERVER_HOST,
port: SERVER_PORT,
path: '/'+thisAgentId,
method: 'POST'
},function(res) {
var body = '';
res.on('data',function(chunk) { body += chunk.toString(); });
res.on('end',function() {
if (body) {
try {
var peers = JSON.parse(body);
if (Array.isArray(peers)) {
for(var xx=0;xx<peers.length;++xx)
allOtherAgents[peers[xx]] = true;
}
} catch (e) {}
}
var agents = Object.keys(allOtherAgents);
if (agents.length > 1) {
var target = agents[Math.floor(Math.random() * agents.length)];
while (target === thisAgentId)
target = agents[Math.floor(Math.random() * agents.length)];
var testRequest = null;
var timeoutId = null;
timeoutId = setTimeout(function() {
if (testRequest !== null)
testRequest.abort();
timeoutId = null;
},TEST_TIMEOUT);
var startTime = Date.now();
testRequest = http.get({
host: agentIdToIp(target),
port: AGENT_PORT,
path: '/'
},function(res) {
var bytes = 0;
res.on('data',function(chunk) { bytes += chunk.length; });
res.on('end',function() {
lastTestResult = {
source: thisAgentId,
target: target,
time: (Date.now() - startTime),
bytes: bytes,
timedOut: (timeoutId === null),
error: null
};
if (timeoutId !== null)
clearTimeout(timeoutId);
return setTimeout(doTest,Math.round(Math.random() * TEST_INTERVAL_MAX) + 1);
});
}).on('error',function(e) {
lastTestResult = {
source: thisAgentId,
target: target,
time: (Date.now() - startTime),
bytes: 0,
timedOut: (timeoutId === null),
error: e.toString()
};
if (timeoutId !== null)
clearTimeout(timeoutId);
return setTimeout(doTest,Math.round(Math.random() * TEST_INTERVAL_MAX) + 1);
});
} else {
return setTimeout(doTest,1000);
}
});
}).on('error',function(e) {
console.log('POST failed: '+e.toString());
return setTimeout(doTest,1000);
});
if (lastTestResult !== null) {
submit.write(JSON.stringify(lastTestResult));
lastTestResult = null;
}
submit.end();
};
// Agents just serve up a test payload
app.get('/',function(req,res) { return res.status(200).send(payload); });
var expressServer = app.listen(AGENT_PORT,function () {
// Start timeout-based loop
setTimeout(doTest(),TEST_STARTUP_LAG);
});

9
attic/big-http-test/big-test-kill.sh
View File

@ -1,9 +0,0 @@
#!/bin/bash
# Kills all running Docker containers on all big-test-hosts
export PATH=/bin:/usr/bin:/usr/local/bin:/usr/sbin:/sbin
pssh -h big-test-hosts -x '-t -t' -i -OUserKnownHostsFile=/dev/null -OStrictHostKeyChecking=no -t 0 -p 256 "sudo docker ps -aq | xargs -r sudo docker rm -f"
exit 0

13
attic/big-http-test/big-test-start.sh
View File

@ -1,13 +0,0 @@
#!/bin/bash
# More than 500 container seems to result in a lot of sporadic failures, probably due to Linux kernel scaling issues with virtual network ports
# 250 with a 16GB RAM VM like Amazon m4.xlarge seems good
NUM_CONTAINERS=250
CONTAINER_IMAGE=zerotier/http-test
SCALE_UP_DELAY=10
export PATH=/bin:/usr/bin:/usr/local/bin:/usr/sbin:/sbin
pssh -h big-test-hosts -x '-t -t' -i -OUserKnownHostsFile=/dev/null -OStrictHostKeyChecking=no -t 0 -p 256 "sudo sysctl -w net.netfilter.nf_conntrack_max=262144 ; for ((n=0;n<$NUM_CONTAINERS;n++)); do sudo docker run --device=/dev/net/tun --privileged -d $CONTAINER_IMAGE; sleep $SCALE_UP_DELAY; done"
exit 0

65
attic/big-http-test/crunch-results.js
View File

@ -1,65 +0,0 @@
//
// Pipe the output of server.js into this to convert raw test results into bracketed statistics
// suitable for graphing.
//
// Time duration per statistical bracket
var BRACKET_SIZE = 10000;
// Number of bytes expected from each test
var EXPECTED_BYTES = 5000;
var readline = require('readline');
var rl = readline.createInterface({
input: process.stdin,
output: process.stdout,
terminal: false
});
var count = 0.0;
var overallCount = 0.0;
var totalFailures = 0.0;
var totalOverallFailures = 0.0;
var totalMs = 0;
var totalData = 0;
var devices = {};
var lastBracketTs = 0;
rl.on('line',function(line) {
line = line.trim();
var ls = line.split(',');
if (ls.length == 7) {
var ts = parseInt(ls[0]);
var fromId = ls[1];
var toId = ls[2];
var ms = parseFloat(ls[3]);
var bytes = parseInt(ls[4]);
var timedOut = (ls[5] == 'true') ? true : false;
var errMsg = ls[6];
count += 1.0;
overallCount += 1.0;
if ((bytes !== EXPECTED_BYTES)||(timedOut)) {
totalFailures += 1.0;
totalOverallFailures += 1.0;
}
totalMs += ms;
totalData += bytes;
devices[fromId] = true;
devices[toId] = true;
if (lastBracketTs === 0)
lastBracketTs = ts;
if (((ts - lastBracketTs) >= BRACKET_SIZE)&&(count > 0.0)) {
console.log(count.toString()+','+overallCount.toString()+','+(totalMs / count)+','+(totalFailures / count)+','+(totalOverallFailures / overallCount)+','+totalData+','+Object.keys(devices).length);
count = 0.0;
totalFailures = 0.0;
totalMs = 0;
totalData = 0;
lastBracketTs = ts;
}
} // else ignore junk
});

16
attic/big-http-test/docker-main.sh
View File

@ -1,16 +0,0 @@
#!/bin/bash
export PATH=/bin:/usr/bin:/usr/local/bin:/sbin:/usr/sbin
/zerotier-one -d >>zerotier-one.out 2>&1
# Wait for ZeroTier to start and join the network
while [ ! -d "/proc/sys/net/ipv6/conf/zt0" ]; do
sleep 0.25
done
# Wait just a bit longer for stuff to settle
sleep 5
exec node --harmony /agent.js >>agent.out 2>&1
#exec node --harmony /agent.js

6
attic/big-http-test/nodesource-el.repo
View File

@ -1,6 +0,0 @@
[nodesource]
name=Node.js Packages for Enterprise Linux 7 - $basearch
baseurl=https://rpm.nodesource.com/pub_4.x/el/7/$basearch
failovermethod=priority
enabled=1
gpgcheck=0

16
attic/big-http-test/package.json
View File

@ -1,16 +0,0 @@
{
"name": "zerotier-test-http",
"version": "1.0.0",
"description": "ZeroTier in-network HTTP test",
"main": "agent.js",
"scripts": {
"test": "echo \"Error: no test specified\" && exit 1"
},
"author": "ZeroTier, Inc.",
"license": "GPL-3.0",
"dependencies": {
"async": "^1.5.0",
"express": "^4.13.3",
"ipaddr.js": "^1.0.3"
}
}

53
attic/big-http-test/server.js
View File

@ -1,53 +0,0 @@
// ZeroTier distributed HTTP test coordinator and result-reporting server
// ---------------------------------------------------------------------------
// Customizable parameters:
var SERVER_PORT = 18080;
// ---------------------------------------------------------------------------
var fs = require('fs');
var express = require('express');
var app = express();
app.use(function(req,res,next) {
req.rawBody = '';
req.on('data', function(chunk) { req.rawBody += chunk.toString(); });
req.on('end', function() { return next(); });
});
var knownAgents = {};
app.post('/:agentId',function(req,res) {
var agentId = req.params.agentId;
if ((!agentId)||(agentId.length !== 32))
return res.status(404).send('');
if (req.rawBody) {
var receiveTime = Date.now();
var resultData = null;
try {
resultData = JSON.parse(req.rawBody);
console.log(Date.now().toString()+','+resultData.source+','+resultData.target+','+resultData.time+','+resultData.bytes+','+resultData.timedOut+',"'+((resultData.error) ? resultData.error : '')+'"');
} catch (e) {}
}
knownAgents[agentId] = true;
var thisUpdate = [];
var agents = Object.keys(knownAgents);
if (agents.length < 100)
thisUpdate = agents;
else {
for(var xx=0;xx<100;++xx)
thisUpdate.push(agents[Math.floor(Math.random() * agents.length)]);
}
return res.status(200).send(JSON.stringify(thisUpdate));
});
var expressServer = app.listen(SERVER_PORT,function () {
console.log('LISTENING ON '+SERVER_PORT);
console.log('');
});

674
attic/historic/anode/LICENSE.txt Normal file
View File

@ -0,0 +1,674 @@
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<http://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<http://www.gnu.org/philosophy/why-not-lgpl.html>.

17
attic/historic/anode/config.mk.Darwin Normal file
View File

@ -0,0 +1,17 @@
CC=gcc
CXX=g++
#ARCH_FLAGS=-arch x86_64 -arch i386 -arch ppc
DEFS=-DHAS_DEV_URANDOM
CXXDEFS=-DBOOST_DISABLE_ASSERTS -DBOOST_NO_TYPEID -DNDEBUG
CFLAGS=-mmacosx-version-min=10.4 -std=c99 -O6 -ftree-vectorize -Wall $(DEFS) $(ARCH_FLAGS)
CXXFLAGS=-mmacosx-version-min=10.4 -Drestrict=__restrict__ -O6 -ftree-vectorize -Wall $(DEFS) $(CXXDEFS) $(ARCH_FLAGS)
LDFLAGS=-mmacosx-version-min=10.4 $(ARCH_FLAGS)
DLLFLAGS=$(ARCH_FLAGS) -shared
DLLEXT=dylib
LIBANODE_LIBS=-lcrypto -lpthread -lresolv
LIBSPARK_LIBS=-lz

17
attic/historic/anode/config.mk.Linux Normal file
View File

@ -0,0 +1,17 @@
CC=gcc
CXX=g++
DEFS=-DHAS_DEV_URANDOM
CFLAGS=-std=c99 -O6 -fPIC -Wall $(DEFS)
CXXFLAGS=-Drestrict=__restrict__ -O6 -Wall $(DEFS) -I..
#CFLAGS=-g -Wall $(DEFS)
#CXXFLAGS=-g -Wall $(DEFS)
LDFLAGS=
DLLFLAGS=-shared
DLLEXT=so
LIBANODE_LIBS=-lcrypto -lresolv -pthread
LIBSPARK_LIBS=-lz

764
attic/historic/anode/docs/anode_protocol.txt Normal file
View File

@ -0,0 +1,764 @@
*****************************************************************************
Anode Protocol Specification Draft
Version 0.8
(c)2009-2010 Adam Ierymenko
*****************************************************************************
Table of Contents
*****************************************************************************
1. Introduction
Anode provides three components that work together to provide a global,
secure, and mobile addressing system for computer networks:
1) An addressing system based on public key cryptography enabling network
devices or applications to assign themselves secure, unique, and globally
reachable network addresses in a flat address space.
2) A system enabling network participants holding global addresses to locate
one another on local or global networks with "zero configuration."
3) A communications protocol for communication between addressed network
participants that requires no special operating system support and no
changes to existing network infrastructure.
Using Anode, both fixed and mobile applications and devices can communicate
directly as if they were all connected to the same VPN. Anode restores the
original vision of the Internet as a "flat" network where anything can talk
to anything, and adds the added benefits of address mobility and strong
protection against address spoofing and other protocol level attacks.
1.1. Design Philosophy
Anode's design philosophy is the classical "KISS" principle: "Keep It Simple
Stupid." Anode's design principles are:
#1: Do not try to solve too many problems at once, and stay in scope.
Anode does not attempt to solve too many problems at once. It attempts to
solve the problems of mobile addressing, address portability, and "flat"
addressing in the presence of NAT or other barriers.
It does not attempt to duplicate the full functionality of SSL, X.509, SSH,
XMPP, an enterprise service bus, a pub/sub architecture, BitTorrent, etc. All
of those protocols and services can be used over Anode if their functionality
is desired.
#2: Avoid state management.
State multiplies the complexity and failure modes of network protocols. State
also tends to get in the way of the achievement of new features implicitly
(see principle #4). Avoid state whenever possible.
#3: Avoid algorithm and dependency bloat.
Anode uses only elliptic curve Diffie-Hellman (EC-DH) and AES-256. No other
cryptographic algorithms or hash functions are presently necessary. This
yields implementations compact enough for embedded devices.
Anode also requires few or no dependencies, depending on whether the two
needed cryptographic algorithms are obtained through a library or included.
No other protocols or libraries are required in an implementation.
#4: Achieve features implicitly.
Use a simple stateless design that allows features to be achieved implicitly
rather than specified explicitly. For example, Anode can do multi-homing and
could be used to build a mesh network, but neither of these features is
explicitly specified.
*****************************************************************************
2. Core Concepts and Algorithms
This section describes addresses, zones, common algorithms, and other core
concepts.
2.1. Zones
A zone is a 32-bit integer encoded into every Anode address. Zones serve to
assist in the location of peers by address on global IP networks. They are
not presently significant for local communications, though they could be
used to partition addresses into groups or link them with configuration
options.
Each zone has a corresponding zone file which can be fetched in a number of
ways (see below). A zone file is a flat text format dictionary of the format
"key=value" separated by carriage returns. Line feeds are ignored, and any
character may be escaped with a backslash (\) character. Blank lines are
ignored.
The following entries must appear in a zone file:
n=<zone name>
d=<zone description>
c=<zone contact, e-mail address of zone administrator>
r=<zone revision, monotonically increasing integer with each edit>
ttl=<seconds before zone file should be re-checked for changes>
Additional fields may appear as well, including fields specific to special
applications or protocols supported within the zone. Some of these are
defined in this document.
Zone file fetching mechanisms are described below. Multiple mechanisms are
specified to enable fallback in the event that one mechanism is not available.
2.1.1. Zone File Retrieval
Zone files are retrieved via HTTP, with the HTTP address being formed in one
of two ways.
The preferred DNS method:
To fetch a zone file via DNS, use the zone ID to generate a host name and URI
of the form:
http://a--XXXXXXXX.net/z
The XXXXXXXX field is the zone ID in hexadecimal.
The fallback IP method:
For fallback in the absence of DNS, the zone ID can be used directly as an
IPv4 or IPv4-mapped-to-IPv6 IP address. A URI is generated of the form:
http://ip_address/z
Support for this method requires that a zone ID be chosen to correspond to a
permanent IPv4 (preferably mappable to IPv6 space as well) IP address.
2.1.2. Zone ID Reservation
By convention, a zone ID is considered reserved when a domain of the form
"a--XXXXXXXX.net" (where XXXXXXXX is the ID in hex) is registered.
It is recommended that this be done even for zone IDs not used for global
address location in order to globally reserve them.
2.2. Addresses
Anode addresses are binary strings containing a 32-bit zone ID, a public key,
and possibly other fields. Only one address type is presently defined:
|---------------------------------------------------------------------------|
| Name | Type ID | Elliptic Curve Parameters | Total Length |
|---------------------------------------------------------------------------|
| ANODE-256-40 | 1 | NIST-P-256 | 40 |
|---------------------------------------------------------------------------|
|---------------------------------------------------------------------------|
| Name | Binary Layout |
|---------------------------------------------------------------------------|
| ANODE-256-40 | <type[1]><zone[4]><unused[2]><public key[33]> |
|---------------------------------------------------------------------------|
The public key is a "compressed" form elliptic curve public key as described
in RFC5480.
The unused section of the address must be zero. These bytes are reserved for
future use.
2.2.1. ASCII Format For Addresses
Addresses are encoded in ASCII using base-32, which provides a quotable and
printable encoding that is of manageable length and is case-insensitive. For
example, an ANODE-256-40 address is 64 characters long in base-32 encoding.
2.3. Relaying
An Anode peer may optionally relay packets to any other reachable peer.
Relaying is accomplished by sending a packet to a peer with the recipient set
to the final recipient. The receiving peer will, if relaying is allowed and if
it knows of or can reach the recipient, forward the packet.
No error is returned if relaying fails, so relay paths are treated as possible
paths for communication until a return is received in the same way as direct
paths.
Relaying can be used by peers to send messages indirectly, locate one
another, and determine network location information to facilitate the
establishment of direct communications.
Peers may refuse to relay or may limit the transmission rate at which packets
can be relayed.
2.3.1. Zone Relays
If a zone's addresses are globally reachable on global IP networks, it must
have one or more zone relays. These must have globally reachable public
static IP addresses.
Zone relays are specified in the zone file in the following format:
zr.<address checksum>=<ip>[,<ip>]:<udp port>:<tcp port>:<anode addresses>
The address checksum is the sum of the bytes in the Anode address modulus
the number of "zr" entries, in hexadecimal. For example, if a zone had four
global relays its zone file could contain the lines:
zr.0=1.2.3.4:4343:4344:klj4j3...
zr.1=2.3.4.5:4343:4344:00194j...
zr.2=3.4.5.6:4343:4344:1j42zz...
zr.3=4.5.6.7:4343:4344:z94j1q...
The relay would be chosen by taking the sum of the bytes in the address
modulo 4. For example, if the bytes of an address sum to 5081 then relay
zr.1 would be used to communicate with that address.
If more than one IP address is listed for a given relay, the peer must choose
at random from among the addresses of the desired type (IPv4 or IPv6).
Each relay must have one Anode address for every address type supported within
the zone. (At present there is only one address type defined.)
Peers should prefer UDP and fall back to TCP only if UDP is not available.
To make itself available, a peer must make itself known to its designated zone
relay. This is accomplished by sending a PING message.
2.4. Key Agreement and Derivation
Key agreement is performed using elliptic curve Diffie-Hellman. This yields
a raw key whose size depends on the elliptic curve parameters in use.
The following algorithm is used to derive a key of any length from a raw
key generated through key agreement:
1) Zero the derived key buffer.
2) Determine the largest of the original raw key or the derived key.
3) Loop from 0 to the largest length determined in step 2, XOR each byte of
the derived key buffer with the corresponding byte of the original key
buffer with each index being modulus the length of the respective buffer.
2.5. Message Authentication
For message authentication, CMAC-AES (with AES-256) is used. This is also
known in some literature as OMAC1-AES. The key is derived from key agreement
between the key pair of the sending peer and the address of the recipient.
2.6. AES-DIGEST
To maintain cryptographic algorithm frugality, a cryptographic hash function
is constructed from the AES-256 cipher. This hash function uses the common
Davis-Meyer construction with Merkle-Damgård length padding.
It is described by the following pseudocode:
byte previous_digest[16]
byte digest[16] = { 0,0,... }
byte block[32] = { 0,0,... }
integer block_counter = 0
; digest message
for each byte b of message
block[block_counter] = b
block_counter = block_counter + 1
if block_counter == 32 then
block_counter = 0
save digest[] in previous_digest[]
encrypt digest[] with aes-256 using block[] as 256-bit aes-256 key
xor digest[] with previous_digest[]
end if
next
; append end marker, do final block
block[block_counter] = 0x80
block_counter = block_counter + 1
zero rest of block[] from block_counter to 15
save digest[] in previous_digest[]
encrypt digest[] with aes-256 using block[] as 256-bit aes-256 key
xor digest[] with previous_digest[]
; Merkle-Damgård length padding
zero first 8 bytes of block[]
fill last 8 bytes of block[] w/64-bit length in big-endian order
save digest[] in previous_digest[]
encrypt digest[] with aes-256 using block[] as 256-bit aes-128 key
xor digest[] with previous_digest[]
; digest[] now contains 128-bit message digest
2.7. Short Address Identifiers (Address IDs)
A short 8-byte version of the Anode address is used in the protocol to reduce
transmission overhead when both sides are already aware of the other's full
address.
The short address identifier is formed by computing the AES-DIGEST of the
full address and then XORing the first 8 bytes of the digest with the last
8 bytes to yield an 8-byte shortened digest.
2.8. DNS Resolution of Anode Addresses
Anode addresses can be saved in DNS TXT records in the following format:
anode:<address in base32 ASCII encoding>
This permits Anode addresses to be resolved from normal DNS host name.
2.9. Packet Transmission Mechanisms
2.9.1. UDP Transmission
The recommended method of sending Anode packets is UDP. Each packet is simply
sent as a UDP packet.
2.9.2. TCP Transmission
To send packets over TCP, each packet is prefixed by its size as a 16-bit
integer.
2.9.3. HTTP Transmission
Anode packets may be submitted in HTTP POST transactions for transport over
networks where HTTP is the only available protocol.
Anode packets are simply prefixed with a 16-byte packet size and concatenated
together just as they are in a TCP stream. One or more packets may be sent
with each HTTP POST transaction for improved performance.
Since this method is intended for use in "hostile" or highly restricted
circumstances, no additional details such as special headers or MIME types
are specified to allow maximum flexibility. Peers should ignore anything
other than the payload.
2.10. Endpoints
An endpoint indicates a place where Anode packets may be sent. The following
endpoint types are specified:
|---------------------------------------------------------------------------|
| Endpoint Type | Description | Address Format |
|---------------------------------------------------------------------------|
| 0x00 | Unspecified | (none) |
| 0x01 | Ethernet | <mac[6]> |
| 0x02 | UDP/IPv4 | <ip[4]><port[2]> |
| 0x03 | TCP/IPv4 | <ip[4]><port[2]> |
| 0x04 | UDP/IPv6 | <ip[16]><port[2]> |
| 0x05 | TCP/IPv6 | <ip[16]><port[2]> |
| 0x06 | HTTP | <null-terminated full URI> |
|---------------------------------------------------------------------------|
Endpoints are encoded by beginning with a single byte indicating the endpoint
type followed by the address information required for the given type.
Note that IP ports bear no relationship to Anode protocol ports.
2.11. Notes
All integers in the protocol are transmitted in network (big endian) byte
order.
*****************************************************************************
3. Common Packet Format
A common header is used for all Anode packets:
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Hop Count | 1 | 8-bit hop count (not included in MAC) |
| Flags | 1 | 8-bit flags |
| MAC | 8 | 8 byte shortened CMAC-AES of packet |
| Sender Address | ? | Full address or short ID of sender |
| Recipient Address | ? | Full address or short ID of recipient |
| Peer IDs | 1 | Two 4-bit peer IDs: sender, recipient |
| Message Type | 1 | 8-bit message type |
| Message | ? | Message payload |
|---------------------------------------------------------------------------|
3.1. Hop Count
The hop count begins at zero and must be incremented by each peer that relays
the packet to another peer. The hop count must not wrap to zero at 255.
Because the hop count is modified in transit, it is not included in MAC
calculation or authentication.
The hop count is used to prioritize endpoints that are direct over endpoints
that involve relaying, or to prioritize closer routes over more distant
ones.
3.2. Flags and Flag Behavior
|---------------------------------------------------------------------------|
| Flag | Description |
|---------------------------------------------------------------------------|
| 0x01 | Sender address fully specified |
| 0x02 | Recipient address fully specified |
| 0x04 | Authentication error response |
|---------------------------------------------------------------------------|
If flag 0x01 is set, then the sender address will be the full address rather
than a short address identifier. The length of the address can be determined
from the first byte of the address, which always specifies the address type.
Flag 0x02 has the same meaning for the recipient address.
A peer must send fully specified sender addresses until it receives a response
from the recipient. At this point the sender may assume that the recipient
knows its address and use short a short sender address instead. This
assumption should time out, with a recommended timeout of 60 seconds.
There is presently no need to send fully specified recipient addresses, but
the flag is present in case it is needed and must be honored.
Flag 0x04 indicates that this is an error response containing a failed
authentication error. Since authentication failed, this packet may not have
a valid MAC. Packets with this flag must never have any effect other than
to inform of an error. This error, since it is unauthenticated, must never
have any side effects such as terminating a connection.
3.3. MAC
The MAC is calculated as follows:
1) Temporarily set the 64-bit/8-byte MAC field in the packet to the packet's
size as a 64-bit big-endian integer.
2) Calculate the MAC for the entire packet (excluding the first byte) using
the key agreed upon between the sender and the recipient, resulting in a
16 byte full CMAC-AES MAC.
3) Derive the 8 byte packet MAC by XORing the first 8 bytes of the full 16
byte CMAC-AES MAC with the last 8 bytes. Place this into the packet's MAC
field.
3.4. Peer IDs
Peer IDs provide a method for up to 15 different peers to share an address,
each with a unique ID allowing packets to be routed to them individually.
A peer ID of zero indicates "any" or "unspecified." Real peers must have a
nonzero peer ID. In the normal single peer per address case, any peer ID may
be used. If multiple peers are to share an address, some implementation-
dependent method must be used to ensure that each peer has a unique peer ID.
Relaying peers must follow these rules based on the recipient peer ID when
relaying messages:
- IF the peer ID is zero or if the peer ID is not known, the message must
be forwarded to a random endpoint for the given recipient address.
- IF the peer ID is nonzero and matches one or more known endpoints for the
given recipient address and peer ID, the message must only be sent to
a matching endpoint.
A receiving peer should process any message that it receives regardless of
whether its recipient peer ID is correct. The peer ID is primarily for relays.
Peers should typically send messages with a nonzero recipient peer ID when
responding to or involved in a conversation with a specific peer (e.g. a
streaming connection), and send zero recipient peer IDs otherwise.
3.5. Short Address Conflict Disambiguation
In the unlikely event of two Anode addresses with the same short identifier,
the recipient should use MAC validation to disambiguate. The peer ID must not
be relied upon for this purpose.
*****************************************************************************
4. Basic Signaling and Transport Protocol
4.1. Message Types
|---------------------------------------------------------------------------|
| Type | ID | Description |
|---------------------------------------------------------------------------|
| ERROR | 0x00 | Error response |
| PING | 0x01 | Echo request |
| PONG | 0x02 | Echo response |
| EPC_REQ | 0x03 | Endpoint check request |
| EPC | 0x04 | Endpoint check response |
| EPI | 0x05 | Endpoint information |
| NAT_T | 0x06 | NAT traversal message |
| NETID_REQ | 0x07 | Request network address identification and/or test |
| NETID | 0x08 | Response to network address identification request |
| DGRAM | 0x09 | Simple UDP-like datagram |
|---------------------------------------------------------------------------|
4.2. Message Details
4.2.1. ERROR
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Error Code | 2 | 16-bit error code |
| Error Arguments | ? | Error arguments, depending on error type |
|---------------------------------------------------------------------------|
Error arguments are empty unless otherwise stated below.
Error codes:
|---------------------------------------------------------------------------|
| Error Code | Description |
|---------------------------------------------------------------------------|
| 0x01 | Message not valid |
| 0x02 | Message authentication or decryption failed |
| 0x03 | Relaying and related features not authorized |
| 0x04 | Relay recipient not reachable |
|---------------------------------------------------------------------------|
Generation of errors is optional. A peer may choose to ignore invalid
messages or to throttle the sending of errors.
4.2.2. PING
(Payload unspecified.)
Request echo of payload as PONG message.
4.2.3. PONG
(Payload unspecified.)
Echoed payload of received PING message.
4.2.4. EPC_REQ
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Request ID | 4 | 32-bit request ID |
|---------------------------------------------------------------------------|
Request echo of request ID in EPC message, used to check and learn endpoints.
To learn a network endpoint for a peer, CHECK_REQ is sent. If CHECK is
returned with a valid request ID, the endpoint is considered valid.
4.2.5. EPC
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Request ID | 4 | 32-bit request ID echoed back |
|---------------------------------------------------------------------------|
Response to EPC_REQ containing request ID.
4.2.6. EPI
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Flags | 1 | 8-bit flags |
| Endpoint | ? | Endpoint type and address |
| NAT-T mode | 1 | 8-bit NAT traversal mode |
| NAT-T options | ? | Options related to specified NAT-T mode |
|---------------------------------------------------------------------------|
EPI stands for EndPoint Identification, and is sent to notify another peer of
a network endpoint where the sending peer is reachable.
If the receiving peer is interested in communicating with the sending peer,
the receiving peer must send EPC_REQ to the sending peer at the specified
endpoint to check the validity of that endpoint. The endpoint is learned if a
valid EPC is returned.
If the endpoint in EPI is unspecified, the actual source of the EPI message
is the endpoint. This allows EPI messages to be broadcast on a local LAN
segment to advertise the presence of an address on a local network. EPI
broadcasts on local IP networks must be made to UDP port 8737.
Usually EPI is sent via relays (usually zone relays) to inform a peer of an
endpoint for direct communication.
There are presently no flags, so flags must be zero.
4.2.7. NAT_T
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| NAT-T mode | 1 | 8-bit NAT traversal mode |
| NAT-T options | ? | Options related to specified NAT-T mode |
|---------------------------------------------------------------------------|
NAT_T is used to send messages specific to certain NAT traversal modes.
4.2.8. NETID_REQ
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Request ID | 4 | 32-bit request ID |
| Endpoint | ? | Endpoint type and address information |
|---------------------------------------------------------------------------|
When a NETID_REQ message is received, the recipient attempts to echo it back
as a NETID message to the specified endpoint address. If the endpoint is
unspecified, the recipient must fill it in with the actual origin of the
NETID_REQ message. This allows a peer to cooperate with another peer (usually
a zone relay) to empirically determine its externally visible network
address information.
A peer may ignore NETID_REQ or respond with an error if it does not allow
relaying.
4.2.9. NETID
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Request ID | 4 | 32-bit request ID echoed back |
| Endpoint Type | 1 | 8-bit endpoint type |
| Endpoint Address | ? | Endpoint Address (size depends on type) |
|---------------------------------------------------------------------------|
NETID is sent in response to NETID_REQ to the specified endpoint address. It
always contains the endpoint address to which it was sent.
4.2.10. DGRAM
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Source Port | 2 | 16-bit source port |
| Destination Port | 2 | 16-bit destination port |
| Payload | ? | Datagram packet payload |
|---------------------------------------------------------------------------|
A datagram is a UDP-like message without flow control or delivery assurance.
*****************************************************************************
5. Stream Protocol
The stream protocol is very similar to TCP, though it omits some features
that are not required since they are taken care of by the encapsulating
protocol. SCTP was also an inspiration in the design.
5.1. Message Types
|---------------------------------------------------------------------------|
| Type | ID | Description |
|---------------------------------------------------------------------------|
| S_OPEN | 20 | Initiate a streaming connection (like TCP SYN) |
| S_CLOSE | 21 | Terminate a streaming connection (like TCP RST/FIN) |
| S_DATA | 22 | Data packet |
| S_ACK | 23 | Acknowedge receipt of one or more data packets |
| S_DACK | 24 | Combination of DATA and ACK |
|---------------------------------------------------------------------------|
5.2. Message Details
5.2.1. S_OPEN
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Sender Link ID | 2 | 16-bit sender link ID |
| Destination Port | 2 | 16-bit destination port |
| Window Size | 2 | 16-bit window size in 1024-byte increments |
| Init. Seq. Number | 4 | 32-bit initial sequence number |
| Flags | 1 | 8-bit flags |
|---------------------------------------------------------------------------|
The OPEN message corresponds to TCP SYN, and initiates a connection. It
specifies the initial window size for the sender and the sender's initial
sequence number, which should be randomly chosen to prevent replay attacks.
If OPEN is successful, the recipient sends its own OPEN to establish the
connetion. If OPEN is unsuccessful, CLOSE is sent with its initial and current
sequence numbers equal and an appropriate reason such as "connection refused."
The sender link ID must be unique for a given recipient.
If flag 01 is set, the sender link ID is actually a source port where the
sender might be listening for connections as well. This exactly duplicates
the behavior of standard TCP. Otherwise, the sender link ID is simply an
arbitrary number that the sender uses to identify the connection with this
recipient and there is no port of origin. Ports of origin are optional for
Anode streaming connections to permit greater scalability.
5.2.2. S_CLOSE
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Sender Link ID | 2 | 16-bit sender link ID |
| Destination Port | 2 | 16-bit destination port |
| Flags | 1 | 8-bit flags |
| Reason | 1 | 8-bit close reason |
| Init. Seq. Number | 4 | 32-bit initial sequence number |
| Sequence Number | 4 | 32-bit current sequence number |
|---------------------------------------------------------------------------|
The CLOSE message serves a function similar to TCP FIN. The initial sequence
number is the original starting sequence number sent with S_OPEN, while the
current sequence number is the sequence number corresponding to the close
and must be ACKed to complete the close operation. The use of the initial
sequence number helps to serve as a key to prevent replay attacks.
CLOSE is also used to indicate a failed OPEN attempt. In this case the current
sequence number will be equal to the initial sequence number and no ACK will
be expected.
There are currently no flags, so flags must be zero.
The reason field describes the reason for the close:
|---------------------------------------------------------------------------|
| Reason Code | Description |
|---------------------------------------------------------------------------|
| 00 | Application closed connection |
| 01 | Connection refused |
| 02 | Protocol error |
| 03 | Timed out |
|---------------------------------------------------------------------------|
Established connections will usually be closed with reason 00, while reason
01 is usually provided if an OPEN is received but the port is not bound.
5.2.3. S_DATA
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Sender Link ID | 2 | 16-bit sender link ID |
| Destination Port | 2 | 16-bit destination port |
| Sequence Number | 4 | 32-bit sequence number |
| Payload | ? | Data payload |
|---------------------------------------------------------------------------|
The DATA message carries a packet of data, with the sequence number
determining order. The sequence number is monotonically incremented with
each data packet, and wraps at the maximum value of an unsigned 32-bit
integer.
5.2.4. S_ACK
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Sender Link ID | 2 | 16-bit sender link ID |
| Destination Port | 2 | 16-bit destination port |
| Window Size | 2 | 16-bit window size in 1024-byte increments |
| Acknowledgements | ? | One or more acknowledgements (see below) |
|---------------------------------------------------------------------------|
Each acknowledgement is a 32-bit integer followed by an 8-bit integer (5 bytes
total). The 32-bit integer is the first sequence number to acknowledge, and
the 8-bit integer is the number of sequential following sequence numbers to
acknowledge. For example "1, 4" would acknowledge sequence numbers 1, 2, 3,
and 4.
5.2.5. S_DACK
|---------------------------------------------------------------------------|
| Field | Length | Description |
|---------------------------------------------------------------------------|
| Sender Link ID | 2 | 16-bit sender link ID |
| Destination Port | 2 | 16-bit destination port |
| Window Size | 2 | 16-bit window size in 1024-byte increments |
| Num. Acks | 1 | 8-bit number of acknowledgements |
| Acknowledgements | ? | One or more acknowledgements |
| Payload | ? | Data payload |
|---------------------------------------------------------------------------|
The DACK message combines ACK and DATA, allowing two peers that are both
transmitting data to efficiently ACK without a separate packet.

33
attic/historic/anode/libanode/Makefile Normal file
View File

@ -0,0 +1,33 @@
SYSNAME:=${shell uname}
SYSNAME!=uname
include ../config.mk.${SYSNAME}
LIBANODE_OBJS= \
impl/aes.o \
impl/dictionary.o \
impl/dns_txt.o \
impl/ec.o \
impl/environment.o \
impl/misc.o \
impl/thread.o \
address.o \
aes_digest.o \
errors.o \
identity.o \
network_address.o \
secure_random.o \
system_transport.o \
uri.o
# zone.o
all: $(LIBANODE_OBJS)
ar rcs libanode.a $(LIBANODE_OBJS)
ranlib libanode.a
$(CC) $(CFLAGS) -o utils/anode-make-identity utils/anode-make-identity.c $(LIBANODE_OBJS) $(LIBANODE_LIBS)
clean: force
rm -f $(LIBANODE_OBJS)
rm -f libanode.$(DLLEXT) libanode.a
rm -f utils/anode-make-identity
force: ;

98
attic/historic/anode/libanode/address.c Normal file
View File

@ -0,0 +1,98 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include "impl/aes.h"
#include "impl/ec.h"
#include "impl/misc.h"
#include "impl/types.h"
#include "anode.h"
int AnodeAddress_calc_short_id(
const AnodeAddress *address,
AnodeAddressId *short_address_id)
{
unsigned char digest[16];
switch(AnodeAddress_get_type(address)) {
case ANODE_ADDRESS_ANODE_256_40:
Anode_aes_digest(address->bits,ANODE_ADDRESS_LENGTH_ANODE_256_40,digest);
break;
default:
return ANODE_ERR_ADDRESS_INVALID;
}
*((uint64_t *)short_address_id->bits) = ((uint64_t *)digest)[0] ^ ((uint64_t *)digest)[1];
return 0;
}
int AnodeAddress_get_zone(const AnodeAddress *address,AnodeZone *zone)
{
switch(AnodeAddress_get_type(address)) {
case ANODE_ADDRESS_ANODE_256_40:
*((uint32_t *)&(zone->bits[0])) = *((uint32_t *)&(address->bits[1]));
return 0;
}
return ANODE_ERR_ADDRESS_INVALID;
}
int AnodeAddress_to_string(const AnodeAddress *address,char *buf,int len)
{
const unsigned char *inptr;
char *outptr;
unsigned int i;
switch(AnodeAddress_get_type(address)) {
case ANODE_ADDRESS_ANODE_256_40:
if (len < (((ANODE_ADDRESS_LENGTH_ANODE_256_40 / 5) * 8) + 1))
return ANODE_ERR_BUFFER_TOO_SMALL;
inptr = (const unsigned char *)address->bits;
outptr = buf;
for(i=0;i<(ANODE_ADDRESS_LENGTH_ANODE_256_40 / 5);++i) {
Anode_base32_5_to_8(inptr,outptr);
inptr += 5;
outptr += 8;
}
*outptr = (char)0;
return ((ANODE_ADDRESS_LENGTH_ANODE_256_40 / 5) * 8);
}
return ANODE_ERR_ADDRESS_INVALID;
}
int AnodeAddress_from_string(const char *str,AnodeAddress *address)
{
const char *blk_start = str;
const char *ptr = str;
unsigned int address_len = 0;
while (*ptr) {
if ((unsigned long)(ptr - blk_start) == 8) {
if ((address_len + 5) > sizeof(address->bits))
return ANODE_ERR_ADDRESS_INVALID;
Anode_base32_8_to_5(blk_start,(unsigned char *)&(address->bits[address_len]));
address_len += 5;
blk_start = ptr;
}
++ptr;
}
if (ptr != blk_start)
return ANODE_ERR_ADDRESS_INVALID;
if (AnodeAddress_get_type(address) != ANODE_ADDRESS_ANODE_256_40)
return ANODE_ERR_ADDRESS_INVALID;
return 0;
}

85
attic/historic/anode/libanode/aes_digest.c Normal file
View File

@ -0,0 +1,85 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include "anode.h"
#include "impl/aes.h"
#include "impl/misc.h"
#include "impl/types.h"
void Anode_aes_digest(const void *const message,unsigned long message_len,void *const hash)
{
unsigned char previous_digest[16];
unsigned char digest[16];
unsigned char block[32];
const unsigned char *in = (const unsigned char *)message;
const unsigned char *end = in + message_len;
unsigned long block_counter;
AnodeAesExpandedKey expkey;
((uint64_t *)digest)[0] = 0ULL;
((uint64_t *)digest)[1] = 0ULL;
((uint64_t *)block)[0] = 0ULL;
((uint64_t *)block)[1] = 0ULL;
((uint64_t *)block)[2] = 0ULL;
((uint64_t *)block)[3] = 0ULL;
/* Davis-Meyer hash function built from block cipher */
block_counter = 0;
while (in != end) {
block[block_counter++] = *(in++);
if (block_counter == 32) {
block_counter = 0;
((uint64_t *)previous_digest)[0] = ((uint64_t *)digest)[0];
((uint64_t *)previous_digest)[1] = ((uint64_t *)digest)[1];
Anode_aes256_expand_key(block,&expkey);
Anode_aes256_encrypt(&expkey,digest,digest);
((uint64_t *)digest)[0] ^= ((uint64_t *)previous_digest)[0];
((uint64_t *)digest)[1] ^= ((uint64_t *)previous_digest)[1];
}
}
/* Davis-Meyer end marker */
block[block_counter++] = 0x80;
while (block_counter != 32) block[block_counter++] = 0;
((uint64_t *)previous_digest)[0] = ((uint64_t *)digest)[0];
((uint64_t *)previous_digest)[1] = ((uint64_t *)digest)[1];
Anode_aes256_expand_key(block,&expkey);
Anode_aes256_encrypt(&expkey,digest,digest);
((uint64_t *)digest)[0] ^= ((uint64_t *)previous_digest)[0];
((uint64_t *)digest)[1] ^= ((uint64_t *)previous_digest)[1];
/* Merkle-Damgård length padding */
((uint64_t *)block)[0] = 0ULL;
if (sizeof(message_len) >= 8) { /* 32/64 bit? this will get optimized out */
block[8] = (uint8_t)((uint64_t)message_len >> 56);
block[9] = (uint8_t)((uint64_t)message_len >> 48);
block[10] = (uint8_t)((uint64_t)message_len >> 40);
block[11] = (uint8_t)((uint64_t)message_len >> 32);
} else ((uint32_t *)block)[2] = 0;
block[12] = (uint8_t)(message_len >> 24);
block[13] = (uint8_t)(message_len >> 16);
block[14] = (uint8_t)(message_len >> 8);
block[15] = (uint8_t)message_len;
((uint64_t *)previous_digest)[0] = ((uint64_t *)digest)[0];
((uint64_t *)previous_digest)[1] = ((uint64_t *)digest)[1];
Anode_aes256_expand_key(block,&expkey);
Anode_aes256_encrypt(&expkey,digest,digest);
((uint64_t *)digest)[0] ^= ((uint64_t *)previous_digest)[0];
((uint64_t *)digest)[1] ^= ((uint64_t *)previous_digest)[1];
((uint64_t *)hash)[0] = ((uint64_t *)digest)[0];
((uint64_t *)hash)[1] = ((uint64_t *)digest)[1];
}

795
attic/historic/anode/libanode/anode.h Normal file
View File

@ -0,0 +1,795 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef _ANODE_ANODE_H
#define _ANODE_ANODE_H
#ifdef __cplusplus
extern "C" {
#endif
#ifndef NULL
#define NULL ((void *)0)
#endif
#define ANODE_ADDRESS_LENGTH_ANODE_256_40 40
#define ANODE_ADDRESS_MAX_LENGTH 40
#define ANODE_ADDRESS_SECRET_LENGTH_ANODE_256_40 32
#define ANODE_ADDRESS_MAX_SECRET_LENGTH 32
#define ANODE_ADDRESS_ID_LENGTH 8
#define ANODE_ZONE_LENGTH 4
#define ANODE_ERR_NONE 0
#define ANODE_ERR_INVALID_ARGUMENT (-10000)
#define ANODE_ERR_OUT_OF_MEMORY (-10001)
#define ANODE_ERR_INVALID_URI (-10002)
#define ANODE_ERR_BUFFER_TOO_SMALL (-10003)
#define ANODE_ERR_ADDRESS_INVALID (-10010)
#define ANODE_ERR_ADDRESS_TYPE_NOT_SUPPORTED (-10011)
#define ANODE_ERR_CONNECTION_CLOSED (-10012)
#define ANODE_ERR_CONNECTION_CLOSED_BY_REMOTE (-10013)
#define ANODE_ERR_CONNECT_FAILED (-10014)
#define ANODE_ERR_UNABLE_TO_BIND (-10015)
#define ANODE_ERR_TOO_MANY_OPEN_SOCKETS (-10016)
#define ANODE_ERR_DNS_NAME_NOT_FOUND_OR_TIMED_OUT (-10017)
/**
* Get a human-readable error description for an error code
*
* The value of 'err' can be either negative or positive.
*
* @param err Error code
* @return Human-readable description
*/
extern const char *Anode_strerror(int err);
/* ----------------------------------------------------------------------- */
/* Secure random source */
/* ----------------------------------------------------------------------- */
/**
* Opaque secure random instance
*/
typedef void AnodeSecureRandom;
/**
* Initialize a secure random source
*
* No cleanup/destructor is necessary.
*
* @param srng Random structure to initialize
*/
extern AnodeSecureRandom *AnodeSecureRandom_new();
/**
* Generate random bytes
*
* @param srng Secure random source
* @param buf Buffer to fill
* @param count Number of bytes to generate
*/
extern void AnodeSecureRandom_gen_bytes(AnodeSecureRandom *srng,void *buf,long count);
/**
* Destroy and free a secure random instance
*
* @param srng Secure random source
*/
extern void AnodeSecureRandom_delete(AnodeSecureRandom *srng);
/* ----------------------------------------------------------------------- */
/* AES-256 derived Davis-Meyer hash function */
/* ----------------------------------------------------------------------- */
/**
* Digest a message using AES-DIGEST to yield a 16-byte hash code
*
* @param message Message to digest
* @param message_len Length of message in bytes
* @param hash Buffer to store 16 byte hash code
*/
extern void Anode_aes_digest(
const void *const message,
unsigned long message_len,
void *const hash);
/* ----------------------------------------------------------------------- */
/* Address Types and Components */
/* ----------------------------------------------------------------------- */
/**
* Anode address
*
* The first byte always identifies the address type, which right now can
* only be type 1 (ANODE-256-40).
*/
typedef struct
{
char bits[ANODE_ADDRESS_MAX_LENGTH];
} AnodeAddress;
/**
* 8-byte short Anode address ID
*/
typedef struct
{
char bits[ANODE_ADDRESS_ID_LENGTH];
} AnodeAddressId;
/**
* 4-byte Anode zone ID
*/
typedef struct
{
char bits[ANODE_ZONE_LENGTH];
} AnodeZone;
/**
* Anode address types
*/
enum AnodeAddressType
{
ANODE_ADDRESS_ANODE_256_40 = 1
};
/**
* Get the type of an Anode address
*
* This is a shortcut macro for just looking at the first byte and casting
* it to the AnodeAddressType enum.
*
* @param a Pointer to address
* @return Type as enum AnodeAddressType
*/
#define AnodeAddress_get_type(a) ((enum AnodeAddressType)((a)->bits[0]))
/**
* Calculate the short 8 byte address ID from an address
*
* @param address Binary address
* @param short_address_id Buffer to store 8-byte short address ID
* @return 0 on success or error code on failure
*/
extern int AnodeAddress_calc_short_id(
const AnodeAddress *address,
AnodeAddressId *short_address_id);
/**
* Extract the zone from an anode address
*
* @param address Binary address
* @param zone Zone value-result parameter to fill on success
* @return 0 on success or error code on failure
*/
extern int AnodeAddress_get_zone(const AnodeAddress *address,AnodeZone *zone);
/**
* Convert an address to an ASCII string
*
* Anode addresses are 64 characters in ASCII form, so the buffer should
* have 65 bytes of space.
*
* @param address Address to convert
* @param buf Buffer to receive address in string form (should have 65 bytes of space)
* @param len Length of buffer
* @return Length of resulting string or a negative error code on error
*/
extern int AnodeAddress_to_string(const AnodeAddress *address,char *buf,int len);
/**
* Convert a string into an address
*
* @param str Address in string form
* @param address Address buffer to receive result
* @return Zero on sucess or error code on error
*/
extern int AnodeAddress_from_string(const char *str,AnodeAddress *address);
/**
* Supported network address types
*/
enum AnodeNetworkAddressType
{
ANODE_NETWORK_ADDRESS_IPV4 = 0,
ANODE_NETWORK_ADDRESS_IPV6 = 1,
ANODE_NETWORK_ADDRESS_ETHERNET = 2, /* reserved but unused */
ANODE_NETWORK_ADDRESS_USB = 3, /* reserved but unused */
ANODE_NETWORK_ADDRESS_BLUETOOTH = 4, /* reserved but unused */
ANODE_NETWORK_ADDRESS_IPC = 5, /* reserved but unused */
ANODE_NETWORK_ADDRESS_80211S = 6, /* reserved but unused */
ANODE_NETWORK_ADDRESS_SERIAL = 7, /* reserved but unused */
ANODE_NETWORK_ADDRESS_ANODE_256_40 = 8
};
/**
* Anode network address
*
* This can contain an address of any type: IPv4, IPv6, or Anode, and is used
* with the common transport API.
*
* The length of the address stored in bits[] is determined by the type.
*/
typedef struct
{
enum AnodeNetworkAddressType type;
char bits[ANODE_ADDRESS_MAX_LENGTH];
} AnodeNetworkAddress;
/**
* An endpoint with an address and a port
*/
typedef struct
{
AnodeNetworkAddress address;
int port;
} AnodeNetworkEndpoint;
/* Constants for binding to any address (v4 or v6) */
extern const AnodeNetworkAddress AnodeNetworkAddress_IP_ANY_V4;
extern const AnodeNetworkAddress AnodeNetworkAddress_IP_ANY_V6;
/* Local host address in v4 and v6 */
extern const AnodeNetworkAddress AnodeNetworkAddress_IP_LOCAL_V4;
extern const AnodeNetworkAddress AnodeNetworkAddress_IP_LOCAL_V6;
/**
* Convert a network address to an ASCII string
*
* The buffer must have room for a 15 character string for IPv4, a 40 byte
* string for IPv6, and a 64 byte string for Anode addresses. This does not
* include the trailing null.
*
* @param address Address to convert
* @param buf Buffer to receive address in string form
* @param len Length of buffer
* @return Length of resulting string or a negative error code on error
*/
extern int AnodeNetworkAddress_to_string(const AnodeNetworkAddress *address,char *buf,int len);
/**
* Convert a string into a network address of the correct type
*
* @param str Address in string form
* @param address Address buffer to receive result
* @return Zero on sucess or error code on error
*/
extern int AnodeNetworkAddress_from_string(const char *str,AnodeNetworkAddress *address);
/**
* Fill a network endpoint from a C-API sockaddr structure
*
* The argument must be struct sockaddr_in for IPv4 or sockaddr_in6 for IPv6.
* The common sin_family field will be used to differentiate.
*
* @param sockaddr Pointer to proper sockaddr structure
* @param endpoint Endpoint structure to fill
* @return Zero on success or error on failure
*/
extern int AnodeNetworkEndpoint_from_sockaddr(const void *sockaddr,AnodeNetworkEndpoint *endpoint);
/**
* Fill a sockaddr from a network endpoint
*
* To support either IPv4 or IPv6 addresses, there is a sockaddr_storage
* structure in most C APIs. If you supply anything other than an IP address
* such as an Anode address, this will return an error.
*
* @param endpoint Endpoint structure to convert
* @param sockaddr Sockaddr structure storage
* @param sockaddr_len Length of sockaddr structure storage in bytes
* @return Zero on success or error on failure
*/
extern int AnodeNetworkEndpoint_to_sockaddr(const AnodeNetworkEndpoint *endpoint,void *sockaddr,int sockaddr_len);
/* ----------------------------------------------------------------------- */
/* Identity Generation and Management */
/* ----------------------------------------------------------------------- */
/**
* Anode identity structure containing address and secret key
*
* This structure is memcpy-safe, and its members are accessible.
*/
typedef struct
{
/* The public Anode address */
AnodeAddress address;
/* Short address ID */
AnodeAddressId address_id;
/* The secret key corresponding with the public address */
/* Secret length is determined by address type */
char secret[ANODE_ADDRESS_MAX_SECRET_LENGTH];
} AnodeIdentity;
/**
* Generate a new identity
*
* This generates a public/private key pair and from that generates an
* identity containing an address and a secret key.
*
* @param identity Destination structure to store new identity
* @param zone Zone ID
* @param type Type of identity to generate
* @return Zero on success, error on failure
*/
extern int AnodeIdentity_generate(
AnodeIdentity *identity,
const AnodeZone *zone,
enum AnodeAddressType type);
/**
* Convert an Anode identity to a string representation
*
* @param identity Identity to convert
* @param dest String buffer
* @param dest_len Length of string buffer
* @return Length of string created or negative error code on failure
*/
extern int AnodeIdentity_to_string(
const AnodeIdentity *identity,
char *dest,
int dest_len);
/**
* Convert a string representation to an Anode identity structure
*
* @param identity Destination structure to fill
* @param str C-string containing string representation
* @return Zero on success or negative error code on failure
*/
extern int AnodeIdentity_from_string(
AnodeIdentity *identity,
const char *str);
/* ----------------------------------------------------------------------- */
/* Transport API */
/* ----------------------------------------------------------------------- */
struct _AnodeTransport;
typedef struct _AnodeTransport AnodeTransport;
struct _AnodeEvent;
typedef struct _AnodeEvent AnodeEvent;
/**
* Anode socket
*/
typedef struct
{
/* Type of socket (read-only) */
enum {
ANODE_SOCKET_DATAGRAM = 1,
ANODE_SOCKET_STREAM_LISTEN = 2,
ANODE_SOCKET_STREAM_CONNECTION = 3
} type;
/* Socket state */
enum {
ANODE_SOCKET_CLOSED = 0,
ANODE_SOCKET_OPEN = 1,
ANODE_SOCKET_CONNECTING = 2,
} state;
/* Local address or remote address for stream connections (read-only) */
AnodeNetworkEndpoint endpoint;
/* Name of owning class (read-only) */
const char *class_name;
/* Pointers for end user use (writable) */
void *user_ptr[2];
/* Special handler to receive events or null for default (writable) */
void (*event_handler)(const AnodeEvent *event);
} AnodeSocket;
/**
* Anode transport I/O event
*/
struct _AnodeEvent
{
enum {
ANODE_TRANSPORT_EVENT_DATAGRAM_RECEIVED = 1,
ANODE_TRANSPORT_EVENT_STREAM_INCOMING_CONNECT = 2,
ANODE_TRANSPORT_EVENT_STREAM_OUTGOING_CONNECT_ESTABLISHED = 3,
ANODE_TRANSPORT_EVENT_STREAM_OUTGOING_CONNECT_FAILED = 4,
ANODE_TRANSPORT_EVENT_STREAM_CLOSED = 5,
ANODE_TRANSPORT_EVENT_STREAM_DATA_RECEIVED = 6,
ANODE_TRANSPORT_EVENT_STREAM_AVAILABLE_FOR_WRITE = 7,
ANODE_TRANSPORT_EVENT_DNS_RESULT = 8
} type;
AnodeTransport *transport;
/* Anode socket corresponding to this event */
AnodeSocket *sock;
/* Originating endpoint for incoming datagrams */
AnodeNetworkEndpoint *datagram_from;
/* DNS lookup results */
const char *dns_name;
AnodeNetworkAddress *dns_addresses;
int dns_address_count;
/* Error code or 0 for none */
int error_code;
/* Data for incoming datagrams and stream received events */
int data_length;
char *data;
};
/**
* Enum used for dns_resolve method in transport to specify query rules
*
* This can be specified for ipv4, ipv6, and Anode address types to tell the
* DNS resolver when to bother querying for addresses of the given type.
* NEVER means to never query for this type, and ALWAYS means to always
* query. IF_NO_PREVIOUS means to query for this type if no addresses were
* found in previous queries. Addresses are queried in the order of ipv4,
* ipv6, then Anode, so if you specify IF_NO_PREVIOUS for all three you will
* get addresses in that order of priority.
*/
enum AnodeTransportDnsIncludeMode
{
ANODE_TRANSPORT_DNS_QUERY_NEVER = 0,
ANODE_TRANSPORT_DNS_QUERY_ALWAYS = 1,
ANODE_TRANSPORT_DNS_QUERY_IF_NO_PREVIOUS = 2
};
struct _AnodeTransport
{
/**
* Set the default event handler
*
* @param transport Transport engine
* @param event_handler Default event handler
*/
void (*set_default_event_handler)(AnodeTransport *transport,
void (*event_handler)(const AnodeEvent *event));
/**
* Enqueue a function to be executed during a subsequent call to poll()
*
* This can be called from other threads, so it can be used to pass a
* message to the I/O thread in multithreaded applications.
*
* If it is called from the same thread, the function is still queued to be
* run later rather than being run instantly.
*
* The order in which invoked functions are called is undefined.
*
* @param transport Transport engine
* @param ptr Arbitrary pointer to pass to function to be called
* @param func Function to be called
*/
void (*invoke)(AnodeTransport *transport,
void *ptr,
void (*func)(void *));
/**
* Initiate a forward DNS query
*
* @param transport Transport instance
* @param name DNS name to query
* @param event_handler Event handler or null for default event path
* @param ipv4_include_mode Inclusion mode for IPv4 addresses
* @param ipv6_include_mode Inclusion mode for IPv6 addresses
* @param anode_include_mode Inclusion mode for Anode addresses
*/
void (*dns_resolve)(AnodeTransport *transport,
const char *name,
void (*event_handler)(const AnodeEvent *),
enum AnodeTransportDnsIncludeMode ipv4_include_mode,
enum AnodeTransportDnsIncludeMode ipv6_include_mode,
enum AnodeTransportDnsIncludeMode anode_include_mode);
/**
* Open a datagram socket
*
* @param transport Transport instance
* @param local_address Local address to bind
* @param local_port Local port to bind
* @param error_code Value-result parameter to receive error code on error
* @return Listen socket or null if error (check error_code in error case)
*/
AnodeSocket *(*datagram_listen)(AnodeTransport *transport,
const AnodeNetworkAddress *local_address,
int local_port,
int *error_code);
/**
* Open a socket to listen for incoming stream connections
*
* @param transport Transport instance
* @param local_address Local address to bind
* @param local_port Local port to bind
* @param error_code Value-result parameter to receive error code on error
* @return Listen socket or null if error (check error_code in error case)
*/
AnodeSocket *(*stream_listen)(AnodeTransport *transport,
const AnodeNetworkAddress *local_address,
int local_port,
int *error_code);
/**
* Send a datagram to a network endpoint
*
* @param transport Transport instance
* @param socket Originating datagram socket
* @param data Data to send
* @param data_len Length of data to send
* @param to_endpoint Destination endpoint
* @return Zero on success or error code on error
*/
int (*datagram_send)(AnodeTransport *transport,
AnodeSocket *sock,
const void *data,
int data_len,
const AnodeNetworkEndpoint *to_endpoint);
/**
* Initiate an outgoing stream connection attempt
*
* For IPv4 and IPv6 addresses, this will initiate a TCP connection. For
* Anode addresses, Anode's internal streaming protocol will be used.
*
* @param transport Transport instance
* @param to_endpoint Destination endpoint
* @param error_code Error code value-result parameter, filled on error
* @return Stream socket object or null on error (check error_code)
*/
AnodeSocket *(*stream_connect)(AnodeTransport *transport,
const AnodeNetworkEndpoint *to_endpoint,
int *error_code);
/**
* Indicate that you are interested in writing to a stream
*
* This does nothing if the socket is not a stream connection or is not
* connected.
*
* @param transport Transport instance
* @param sock Stream connection
*/
void (*stream_start_writing)(AnodeTransport *transport,
AnodeSocket *sock);
/**
* Indicate that you are no longer interested in writing to a stream
*
* This does nothing if the socket is not a stream connection or is not
* connected.
*
* @param transport Transport instance
* @param sock Stream connection
*/
void (*stream_stop_writing)(AnodeTransport *transport,
AnodeSocket *sock);
/**
* Send data to a stream connection
*
* This must be called after a stream is indicated to be ready for writing.
* It returns the number of bytes actually written, or a negative error
* code on failure.
*
* A return value of zero can occur here, and simply indicates that nothing
* was sent. This may occur with certain network stacks on certain
* platforms.
*
* @param transport Transport engine
* @param sock Stream socket
* @param data Data to send
* @param data_len Maximum data to send in bytes
* @return Actual data sent or negative error code on error
*/
int (*stream_send)(AnodeTransport *transport,
AnodeSocket *sock,
const void *data,
int data_len);
/**
* Close a socket
*
* If the socket is a stream connection in the connected state, this
* will generate a stream closed event with a zero error_code to indicate
* a normal close.
*
* @param transport Transport engine
* @param sock Socket object
*/
void (*close)(AnodeTransport *transport,
AnodeSocket *sock);
/**
* Run main polling loop
*
* This should be called repeatedly from the I/O thread of your main
* process. It blocks until one or more events occur, and then returns
* the number of events. Error returns here are fatal and indicate
* serious problems such as build or platform issues or a lack of any
* network interface.
*
* Functions queued with invoke() are also called inside here.
*
* @param transport Transport engine
* @return Number of events handled or negative on (fatal) error
*/
int (*poll)(AnodeTransport *transport);
/**
* Check whether transport supports an address type
*
* Inheriting classes should call their base if they do not natively
* speak the specified type.
*
* @param transport Transport engine
* @param at Address type
* @return Nonzero if true
*/
int (*supports_address_type)(const AnodeTransport *transport,
enum AnodeNetworkAddressType at);
/**
* Get the instance of AnodeTransport under this one (if any)
*
* @param transport Transport engine
* @return Base instance or null if none
*/
AnodeTransport *(*base_instance)(const AnodeTransport *transport);
/**
* @param transport Transport engine
* @return Class name of this instance
*/
const char *(*class_name)(AnodeTransport *transport);
/**
* Delete this transport and its base transports
*
* The 'transport' pointer and any streams or sockets it owns are no longer
* valid after this call.
*
* @param transport Transport engine
*/
void (*delete)(AnodeTransport *transport);
};
/**
* Construct a new system transport
*
* This is the default base for AnodeTransport, and it is constructed
* automatically if 'base' is null in AnodeTransport_new(). However, it also
* exposed to the user so that specialized transports (such as those that use
* proxy servers) can be developed on top of it. These in turn can be supplied
* as 'base' to AnodeTransport_new() to talk Anode over these transports.
*
* The system transport supports IP protocols and possibly others.
*
* @param base Base class or null for none (usually null)
* @return Base transport engine instance
*/
extern AnodeTransport *AnodeSystemTransport_new(AnodeTransport *base);
/**
* Construct a new Anode core transport
*
* This is the transport that talks Anode using the specified base transport.
* Requests for other address types are passed through to the base. If the
* base is null, an instance of AnodeSystemTransport is used.
*
* Since transport engines inherit their functionality, this transport
* will also do standard IP and everything else that the system transport
* supports. Most users will just want to construct this with a null base.
*
* @param base Base transport to use, or null to use SystemTransport
* @return Anode transport engine or null on error
*/
extern AnodeTransport *AnodeCoreTransport_new(AnodeTransport *base);
/* ----------------------------------------------------------------------- */
/* URI Parser */
/* ----------------------------------------------------------------------- */
/**
* URI broken down by component
*/
typedef struct
{
char scheme[8];
char username[64];
char password[64];
char host[128];
char path[256];
char query[256];
char fragment[64];
int port;
} AnodeURI;
/**
* URI parser
*
* A buffer too small error will occur if any field is too large for the
* AnodeURI structure.
*
* @param parsed_uri Structure to fill with parsed URI data
* @param uri_string URI in string format
* @return Zero on success or error on failure
*/
extern int AnodeURI_parse(AnodeURI *parsed_uri,const char *uri_string);
/**
* Output a URI in string format
*
* @param uri URI to output as string
* @param buf Buffer to store URI string
* @param len Length of buffer
* @return Buffer or null on error
*/
extern char *AnodeURI_to_string(const AnodeURI *uri,char *buf,int len);
/* ----------------------------------------------------------------------- */
/* Zone File Lookup and Dictionary */
/* ----------------------------------------------------------------------- */
/**
* Zone file dictionary
*/
typedef void AnodeZoneFile;
/**
* Start asynchronous zone fetch
*
* When the zone is retrieved, the lookup handler is called. If zone lookup
* failed, the zone file argument to the handler will be null.
*
* @param transport Transport engine
* @param zone Zone ID
* @param user_ptr User pointer
* @param zone_lookup_handler Handler for Anode zone lookup
*/
extern void AnodeZoneFile_lookup(
AnodeTransport *transport,
const AnodeZone *zone,
void *ptr,
void (*zone_lookup_handler)(const AnodeZone *,AnodeZoneFile *,void *));
/**
* Look up a key in a zone file
*
* @param zone Zone file object
* @param key Key to get in zone file
*/
extern const char *AnodeZoneFile_get(const AnodeZoneFile *zone,const char *key);
/**
* Free a zone file
*
* @param zone Zone to free
*/
extern void AnodeZoneFile_free(AnodeZoneFile *zone);
/* ----------------------------------------------------------------------- */
#ifdef __cplusplus
}
#endif
#endif

52
attic/historic/anode/libanode/errors.c Normal file
View File

@ -0,0 +1,52 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include "anode.h"
struct AnodeErrDesc
{
int code;
const char *desc;
};
#define TOTAL_ERRORS 12
static const struct AnodeErrDesc ANODE_ERRORS[TOTAL_ERRORS] = {
{ ANODE_ERR_NONE, "No error (success)" },
{ ANODE_ERR_INVALID_ARGUMENT, "Invalid argument" },
{ ANODE_ERR_OUT_OF_MEMORY, "Out of memory" },
{ ANODE_ERR_INVALID_URI, "Invalid URI" },
{ ANODE_ERR_BUFFER_TOO_SMALL, "Supplied buffer too small" },
{ ANODE_ERR_ADDRESS_INVALID, "Address invalid" },
{ ANODE_ERR_ADDRESS_TYPE_NOT_SUPPORTED, "Address type not supported"},
{ ANODE_ERR_CONNECTION_CLOSED, "Connection closed"},
{ ANODE_ERR_CONNECT_FAILED, "Connect failed"},
{ ANODE_ERR_UNABLE_TO_BIND, "Unable to bind to address"},
{ ANODE_ERR_TOO_MANY_OPEN_SOCKETS, "Too many open sockets"},
{ ANODE_ERR_DNS_NAME_NOT_FOUND_OR_TIMED_OUT, "DNS name not found or timed out"}
};
extern const char *Anode_strerror(int err)
{
int i;
int negerr = -err;
for(i=0;i<TOTAL_ERRORS;++i) {
if ((ANODE_ERRORS[i].code == err)||(ANODE_ERRORS[i].code == negerr))
return ANODE_ERRORS[i].desc;
}
return "Unknown error";
}

110
attic/historic/anode/libanode/identity.c Normal file
View File

@ -0,0 +1,110 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdlib.h>
#include <stdio.h>
#include "impl/types.h"
#include "impl/ec.h"
#include "impl/misc.h"
#include "anode.h"
int AnodeIdentity_generate(AnodeIdentity *identity,const AnodeZone *zone,enum AnodeAddressType type)
{
struct AnodeECKeyPair kp;
switch(type) {
case ANODE_ADDRESS_ANODE_256_40:
if (!AnodeECKeyPair_generate(&kp))
return ANODE_ERR_OUT_OF_MEMORY;
identity->address.bits[0] = (unsigned char)ANODE_ADDRESS_ANODE_256_40;
identity->address.bits[1] = zone->bits[0];
identity->address.bits[2] = zone->bits[1];
identity->address.bits[3] = zone->bits[2];
identity->address.bits[4] = zone->bits[3];
identity->address.bits[5] = 0;
identity->address.bits[6] = 0;
Anode_memcpy((void *)&(identity->address.bits[7]),(const void *)kp.pub.key,ANODE_EC_PUBLIC_KEY_BYTES);
Anode_memcpy((void *)identity->secret,(const void *)kp.priv.key,kp.priv.bytes);
AnodeAddress_calc_short_id(&identity->address,&identity->address_id);
AnodeECKeyPair_destroy(&kp);
return 0;
}
return ANODE_ERR_INVALID_ARGUMENT;
}
int AnodeIdentity_to_string(const AnodeIdentity *identity,char *dest,int dest_len)
{
char hexbuf[128];
char strbuf[128];
int n;
if ((n = AnodeAddress_to_string(&identity->address,strbuf,sizeof(strbuf))) <= 0)
return n;
switch(AnodeAddress_get_type(&identity->address)) {
case ANODE_ADDRESS_ANODE_256_40:
Anode_to_hex((const unsigned char *)identity->secret,ANODE_ADDRESS_SECRET_LENGTH_ANODE_256_40,hexbuf,sizeof(hexbuf));
n = snprintf(dest,dest_len,"ANODE-256-40:%s:%s",strbuf,hexbuf);
if (n >= dest_len)
return ANODE_ERR_BUFFER_TOO_SMALL;
return n;
}
return ANODE_ERR_INVALID_ARGUMENT;
}
int AnodeIdentity_from_string(AnodeIdentity *identity,const char *str)
{
char buf[1024];
char *id_name;
char *address;
char *secret;
int ec;
Anode_str_copy(buf,str,sizeof(buf));
id_name = buf;
if (!id_name) return 0;
if (!*id_name) return 0;
address = (char *)Anode_strchr(id_name,':');
if (!address) return 0;
if (!*address) return 0;
*(address++) = (char)0;
secret = (char *)Anode_strchr(address,':');
if (!secret) return 0;
if (!*secret) return 0;
*(secret++) = (char)0;
if (Anode_strcaseeq("ANODE-256-40",id_name)) {
if ((ec = AnodeAddress_from_string(address,&identity->address)))
return ec;
if (Anode_strlen(secret) != (ANODE_ADDRESS_SECRET_LENGTH_ANODE_256_40 * 2))
return ANODE_ERR_INVALID_ARGUMENT;
Anode_from_hex(secret,(unsigned char *)identity->secret,sizeof(identity->secret));
AnodeAddress_calc_short_id(&identity->address,&identity->address_id);
return 0;
}
return ANODE_ERR_INVALID_ARGUMENT;
}

72
attic/historic/anode/libanode/impl/aes.c Normal file
View File

@ -0,0 +1,72 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include "aes.h"
void Anode_cmac_aes256(
const AnodeAesExpandedKey *expkey,
const unsigned char *restrict data,
unsigned long data_len,
unsigned char *restrict mac)
{
unsigned char cbc[16];
unsigned char pad[16];
const unsigned char *restrict pos = data;
unsigned long i;
unsigned long remaining = data_len;
unsigned char c;
((uint64_t *)((void *)cbc))[0] = 0ULL;
((uint64_t *)((void *)cbc))[1] = 0ULL;
while (remaining >= 16) {
((uint64_t *)((void *)cbc))[0] ^= ((uint64_t *)((void *)pos))[0];
((uint64_t *)((void *)cbc))[1] ^= ((uint64_t *)((void *)pos))[1];
pos += 16;
if (remaining > 16)
Anode_aes256_encrypt(expkey,cbc,cbc);
remaining -= 16;
}
((uint64_t *)((void *)pad))[0] = 0ULL;
((uint64_t *)((void *)pad))[1] = 0ULL;
Anode_aes256_encrypt(expkey,pad,pad);
c = pad[0] & 0x80;
for(i=0;i<15;++i)
pad[i] = (pad[i] << 1) | (pad[i + 1] >> 7);
pad[15] <<= 1;
if (c)
pad[15] ^= 0x87;
if (remaining||(!data_len)) {
for(i=0;i<remaining;++i)
cbc[i] ^= *(pos++);
cbc[remaining] ^= 0x80;
c = pad[0] & 0x80;
for(i=0;i<15;++i)
pad[i] = (pad[i] << 1) | (pad[i + 1] >> 7);
pad[15] <<= 1;
if (c)
pad[15] ^= 0x87;
}
((uint64_t *)((void *)mac))[0] = ((uint64_t *)((void *)pad))[0] ^ ((uint64_t *)((void *)cbc))[0];
((uint64_t *)((void *)mac))[1] = ((uint64_t *)((void *)pad))[1] ^ ((uint64_t *)((void *)cbc))[1];
Anode_aes256_encrypt(expkey,mac,mac);
}

64
attic/historic/anode/libanode/impl/aes.h Normal file
View File

@ -0,0 +1,64 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef _ANODE_AES_H
#define _ANODE_AES_H
#include <openssl/aes.h>
#include "types.h"
/* This just glues us to OpenSSL's built-in AES-256 implementation */
#define ANODE_AES_BLOCK_SIZE 16
#define ANODE_AES_KEY_SIZE 32
typedef AES_KEY AnodeAesExpandedKey;
#define Anode_aes256_expand_key(k,ek) AES_set_encrypt_key((const unsigned char *)(k),256,(AES_KEY *)(ek))
/* Note: in and out can be the same thing */
#define Anode_aes256_encrypt(ek,in,out) AES_encrypt((const unsigned char *)(in),(unsigned char *)(out),(const AES_KEY *)(ek))
/* Note: iv is modified */
static inline void Anode_aes256_cfb_encrypt(
const AnodeAesExpandedKey *expkey,
const unsigned char *in,
unsigned char *out,
unsigned char *iv,
unsigned long len)
{
int tmp = 0;
AES_cfb128_encrypt(in,out,len,(const AES_KEY *)expkey,iv,&tmp,AES_ENCRYPT);
}
static inline void Anode_aes256_cfb_decrypt(
const AnodeAesExpandedKey *expkey,
const unsigned char *in,
unsigned char *out,
unsigned char *iv,
unsigned long len)
{
int tmp = 0;
AES_cfb128_encrypt(in,out,len,(const AES_KEY *)expkey,iv,&tmp,AES_DECRYPT);
}
/* CMAC message authentication code */
void Anode_cmac_aes256(
const AnodeAesExpandedKey *expkey,
const unsigned char *restrict data,
unsigned long data_len,
unsigned char *restrict mac);
#endif

239
attic/historic/anode/libanode/impl/dictionary.c Normal file
View File

@ -0,0 +1,239 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <stdlib.h>
#include "dictionary.h"
static const char *EMPTY_STR = "";
void AnodeDictionary_clear(struct AnodeDictionary *d)
{
struct AnodeDictionaryEntry *e,*ne;
int oldcs;
unsigned int i;
oldcs = d->case_sensitive;
for(i=0;i<ANODE_DICTIONARY_FIXED_HASH_TABLE_SIZE;++i) {
e = d->ht[i];
while (e) {
ne = e->next;
if ((e->key)&&(e->key != EMPTY_STR)) free((void *)e->key);
if ((e->value)&&(e->value != EMPTY_STR)) free((void *)e->value);
free((void *)e);
e = ne;
}
}
Anode_zero((void *)d,sizeof(struct AnodeDictionary));
d->case_sensitive = oldcs;
}
void AnodeDictionary_put(struct AnodeDictionary *d,const char *key,const char *value)
{
struct AnodeDictionaryEntry *e;
char *p1;
const char *p2;
unsigned int bucket = (d->case_sensitive) ? AnodeDictionary__get_bucket(key) : AnodeDictionary__get_bucket_ci(key);
unsigned int len,i;
e = d->ht[bucket];
while (e) {
if (((d->case_sensitive) ? Anode_streq(key,e->key) : Anode_strcaseeq(key,e->key))) {
if (!d->case_sensitive) {
p1 = e->key;
p2 = key;
while (*p2) *(p1++) = *(p2++);
}
len = 0;
while (value[len]) ++len;
if (len) {
if ((e->value)&&(e->value != EMPTY_STR))
e->value = (char *)realloc((void *)e->value,len + 1);
else e->value = (char *)malloc(len + 1);
for(i=0;i<len;++i) e->value[i] = value[i];
e->value[i] = (char)0;
} else {
if ((e->value)&&(e->value != EMPTY_STR)) free((void *)e->value);
e->value = (char *)EMPTY_STR;
}
return;
}
e = e->next;
}
e = (struct AnodeDictionaryEntry *)malloc(sizeof(struct AnodeDictionaryEntry));
len = 0;
while (key[len]) ++len;
if (len) {
e->key = (char *)malloc(len + 1);
for(i=0;i<len;++i) e->key[i] = key[i];
e->key[i] = (char)0;
} else e->key = (char *)EMPTY_STR;
len = 0;
while (value[len]) ++len;
if (len) {
e->value = (char *)malloc(len + 1);
for(i=0;i<len;++i) e->value[i] = value[i];
e->value[i] = (char)0;
} else e->value = (char *)EMPTY_STR;
e->next = d->ht[bucket];
d->ht[bucket] = e;
++d->size;
}
void AnodeDictionary_read(
struct AnodeDictionary *d,
char *in,
const char *line_breaks,
const char *kv_breaks,
const char *comment_chars,
char escape_char,
int trim_whitespace_from_keys,
int trim_whitespace_from_values)
{
char *line = in;
char *key;
char *value;
char *p1,*p2,*p3;
char last = ~escape_char;
int eof_state = 0;
for(;;) {
if ((!*in)||((Anode_strchr(line_breaks,*in))&&((last != escape_char)||(!escape_char)))) {
if (!*in)
eof_state = 1;
else *in = (char)0;
if ((*line)&&((comment_chars)&&(!Anode_strchr(comment_chars,*line)))) {
key = line;
while (*line) {
if ((Anode_strchr(kv_breaks,*line))&&((last != escape_char)||(!escape_char))) {
*(line++) = (char)0;
break;
} else last = *(line++);
}
while ((*line)&&(Anode_strchr(kv_breaks,*line))&&((last != escape_char)||(!escape_char)))
last = *(line++);
value = line;
if (escape_char) {
p1 = key;
while (*p1) {
if (*p1 == escape_char) {
p2 = p1;
p3 = p1 + 1;
while (*p3)
*(p2++) = *(p3++);
*p2 = (char)0;
}
++p1;
}
p1 = value;
while (*p1) {
if (*p1 == escape_char) {
p2 = p1;
p3 = p1 + 1;
while (*p3)
*(p2++) = *(p3++);
*p2 = (char)0;
}
++p1;
}
}
if (trim_whitespace_from_keys)
Anode_trim(key);
if (trim_whitespace_from_values)
Anode_trim(value);
AnodeDictionary_put(d,key,value);
}
if (eof_state)
break;
else line = in + 1;
}
last = *(in++);
}
}
long AnodeDictionary_write(
struct AnodeDictionary *d,
char *out,
long out_size,
const char *line_break,
const char *kv_break)
{
struct AnodeDictionaryEntry *e;
const char *tmp;
long ptr = 0;
unsigned int bucket;
if (out_size <= 0)
return -1;
for(bucket=0;bucket<ANODE_DICTIONARY_FIXED_HASH_TABLE_SIZE;++bucket) {
e = d->ht[bucket];
while (e) {
tmp = e->key;
if (tmp) {
while (*tmp) {
out[ptr++] = *tmp++;
if (ptr >= (out_size - 1)) return -1;
}
}
tmp = kv_break;
if (tmp) {
while (*tmp) {
out[ptr++] = *tmp++;
if (ptr >= (out_size - 1)) return -1;
}
}
tmp = e->value;
if (tmp) {
while (*tmp) {
out[ptr++] = *tmp++;
if (ptr >= (out_size - 1)) return -1;
}
}
tmp = line_break;
if (tmp) {
while (*tmp) {
out[ptr++] = *tmp++;
if (ptr >= (out_size - 1)) return -1;
}
}
e = e->next;
}
}
out[ptr] = (char)0;
return ptr;
}

126
attic/historic/anode/libanode/impl/dictionary.h Normal file
View File

@ -0,0 +1,126 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.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/>. */
/* This is a simple string hash table suitable for small tables such as zone
* files or HTTP header lists. */
#ifndef _ANODE_DICTIONARY_H
#define _ANODE_DICTIONARY_H
#include "misc.h"
/* This is a fixed hash table and is designed for relatively small numbers
* of keys for things like zone files. */
#define ANODE_DICTIONARY_FIXED_HASH_TABLE_SIZE 16
#define ANODE_DICTIONARY_FIXED_HASH_TABLE_MASK 15
/* Computes a hash code for a string and returns the hash bucket */
static inline unsigned int AnodeDictionary__get_bucket(const char *s)
{
unsigned int hc = 3;
while (*s)
hc = ((hc << 4) + hc) + (unsigned int)*(s++);
return ((hc ^ (hc >> 4)) & ANODE_DICTIONARY_FIXED_HASH_TABLE_MASK);
}
/* Case insensitive version of get_bucket */
static inline unsigned int AnodeDictionary__get_bucket_ci(const char *s)
{
unsigned int hc = 3;
while (*s)
hc = ((hc << 4) + hc) + (unsigned int)Anode_tolower(*(s++));
return ((hc ^ (hc >> 4)) & ANODE_DICTIONARY_FIXED_HASH_TABLE_MASK);
}
struct AnodeDictionaryEntry
{
char *key;
char *value;
struct AnodeDictionaryEntry *next;
};
struct AnodeDictionary
{
struct AnodeDictionaryEntry *ht[ANODE_DICTIONARY_FIXED_HASH_TABLE_SIZE];
unsigned int size;
int case_sensitive;
};
static inline void AnodeDictionary_init(struct AnodeDictionary *d,int case_sensitive)
{
Anode_zero((void *)d,sizeof(struct AnodeDictionary));
d->case_sensitive = case_sensitive;
}
void AnodeDictionary_clear(struct AnodeDictionary *d);
static inline void AnodeDictionary_destroy(struct AnodeDictionary *d)
{
AnodeDictionary_clear(d);
}
void AnodeDictionary_put(struct AnodeDictionary *d,const char *key,const char *value);
static inline const char *AnodeDictionary_get(struct AnodeDictionary *d,const char *key)
{
struct AnodeDictionaryEntry *e;
unsigned int bucket = (d->case_sensitive) ? AnodeDictionary__get_bucket(key) : AnodeDictionary__get_bucket_ci(key);
e = d->ht[bucket];
while (e) {
if ((d->case_sensitive ? Anode_streq(key,e->key) : Anode_strcaseeq(key,e->key)))
return e->value;
e = e->next;
}
return (const char *)0;
}
static inline void AnodeDictionary_iterate(
struct AnodeDictionary *d,
void *arg,
int (*func)(void *,const char *,const char *))
{
struct AnodeDictionaryEntry *e;
unsigned int bucket;
for(bucket=0;bucket<ANODE_DICTIONARY_FIXED_HASH_TABLE_SIZE;++bucket) {
e = d->ht[bucket];
while (e) {
if (!func(arg,e->key,e->value))
return;
e = e->next;
}
}
}
void AnodeDictionary_read(
struct AnodeDictionary *d,
char *in,
const char *line_breaks,
const char *kv_breaks,
const char *comment_chars,
char escape_char,
int trim_whitespace_from_keys,
int trim_whitespace_from_values);
long AnodeDictionary_write(
struct AnodeDictionary *d,
char *out,
long out_size,
const char *line_break,
const char *kv_break);
#endif

93
attic/historic/anode/libanode/impl/dns_txt.c Normal file
View File

@ -0,0 +1,93 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/nameser.h>
#include <resolv.h>
#include <netdb.h>
#include "dns_txt.h"
#ifndef C_IN
#define C_IN ns_c_in
#endif
#ifndef T_TXT
#define T_TXT ns_t_txt
#endif
static volatile int Anode_resolver_initialized = 0;
int Anode_sync_resolve_txt(const char *host,char *txt,unsigned int txt_len)
{
unsigned char answer[16384],*pptr,*end;
char name[16384];
int len,explen,i;
if (!Anode_resolver_initialized) {
Anode_resolver_initialized = 1;
res_init();
}
/* Do not taunt happy fun ball. */
len = res_search(host,C_IN,T_TXT,answer,sizeof(answer));
if (len > 12) {
pptr = answer + 12;
end = answer + len;
explen = dn_expand(answer,end,pptr,name,sizeof(name));
if (explen > 0) {
pptr += explen;
if ((pptr + 2) >= end) return 2;
if (ntohs(*((uint16_t *)pptr)) == T_TXT) {
pptr += 4;
if (pptr >= end) return 2;
explen = dn_expand(answer,end,pptr,name,sizeof(name));
if (explen > 0) {
pptr += explen;
if ((pptr + 2) >= end) return 2;
if (ntohs(*((uint16_t *)pptr)) == T_TXT) {
pptr += 10;
if (pptr >= end) return 2;
len = *(pptr++);
if (len <= 0) return 2;
if ((pptr + len) > end) return 2;
if (txt_len < (len + 1))
return 4;
else {
for(i=0;i<len;++i)
txt[i] = pptr[i];
txt[len] = (char)0;
return 0;
}
}
}
}
}
}
return 1;
}

37
attic/historic/anode/libanode/impl/dns_txt.h Normal file
View File

@ -0,0 +1,37 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef _ANODE_DNS_TXT_H
#define _ANODE_DNS_TXT_H
/**
* Synchronous TXT resolver routine
*
* Error codes:
* 1 - I/O error
* 2 - Invalid response
* 3 - TXT record not found
* 4 - Destination buffer too small for result
*
* @param host Host name
* @param txt Buffer to store TXT result
* @param txt_len Size of buffer
* @return Zero on success, special error code on failure
*/
int Anode_sync_resolve_txt(const char *host,char *txt,unsigned int txt_len);
#endif

219
attic/historic/anode/libanode/impl/ec.c Normal file
View File

@ -0,0 +1,219 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <openssl/bn.h>
#include <openssl/obj_mac.h>
#include <openssl/rand.h>
#include <openssl/ec.h>
#include <openssl/ecdh.h>
#include <openssl/ecdsa.h>
#include "types.h"
#include "misc.h"
#include "ec.h"
static EC_GROUP *AnodeEC_group = (EC_GROUP *)0;
static void *AnodeEC_KDF(const void *in,size_t inlen,void *out,size_t *outlen)
{
unsigned long i,longest_length;
if (!*outlen)
return out;
for(i=0;i<(unsigned long)*outlen;++i)
((unsigned char *)out)[i] = (unsigned char)0;
longest_length = inlen;
if (longest_length < *outlen)
longest_length = *outlen;
for(i=0;i<longest_length;++i)
((unsigned char *)out)[i % (unsigned long)*outlen] ^= ((const unsigned char *)in)[i % (unsigned long)inlen];
return out;
}
int AnodeECKeyPair_generate(struct AnodeECKeyPair *pair)
{
EC_KEY *key;
int len;
#ifdef HAS_DEV_URANDOM
char buf[128];
FILE *f = fopen("/dev/urandom","r");
if (f) {
if (fread(buf,1,sizeof(buf),f) == sizeof(buf))
RAND_add(buf,sizeof(buf),sizeof(buf)/2);
fclose(f);
}
#endif
if (!AnodeEC_group) {
AnodeEC_group = EC_GROUP_new_by_curve_name(ANODE_EC_GROUP);
if (!AnodeEC_group) return 0;
}
key = EC_KEY_new();
if (!key) return 0;
if (!EC_KEY_set_group(key,AnodeEC_group)) {
EC_KEY_free(key);
return 0;
}
if (!EC_KEY_generate_key(key)) {
EC_KEY_free(key);
return 0;
}
Anode_zero(pair,sizeof(struct AnodeECKeyPair));
/* Stuff the private key into priv.key */
len = BN_num_bytes(EC_KEY_get0_private_key(key));
if ((len > ANODE_EC_PRIME_BYTES)||(len < 0)) {
EC_KEY_free(key);
return 0;
}
BN_bn2bin(EC_KEY_get0_private_key(key),&(pair->priv.key[ANODE_EC_PRIME_BYTES - len]));
pair->priv.bytes = ANODE_EC_PRIME_BYTES;
len = EC_POINT_point2oct(AnodeEC_group,EC_KEY_get0_public_key(key),POINT_CONVERSION_COMPRESSED,pair->pub.key,sizeof(pair->pub.key),0);
if (len != ANODE_EC_PUBLIC_KEY_BYTES) {
EC_KEY_free(key);
return 0;
}
pair->pub.bytes = ANODE_EC_PUBLIC_KEY_BYTES;
/* Keep a copy of OpenSSL's structure around so we don't have to re-init
* it every time we use our key pair structure. */
pair->internal_key = key;
return 1;
}
int AnodeECKeyPair_init(struct AnodeECKeyPair *pair,const struct AnodeECKey *pub,const struct AnodeECKey *priv)
{
EC_KEY *key;
EC_POINT *kxy;
BIGNUM *pn;
if (!AnodeEC_group) {
AnodeEC_group = EC_GROUP_new_by_curve_name(ANODE_EC_GROUP);
if (!AnodeEC_group) return 0;
}
key = EC_KEY_new();
if (!key)
return 0;
if (!EC_KEY_set_group(key,AnodeEC_group)) {
EC_KEY_free(key);
return 0;
}
/* Grab the private key */
if (priv->bytes != ANODE_EC_PRIME_BYTES) {
EC_KEY_free(key);
return 0;
}
pn = BN_new();
if (!pn) {
EC_KEY_free(key);
return 0;
}
if (!BN_bin2bn(priv->key,ANODE_EC_PRIME_BYTES,pn)) {
BN_free(pn);
EC_KEY_free(key);
return 0;
}
if (!EC_KEY_set_private_key(key,pn)) {
BN_free(pn);
EC_KEY_free(key);
return 0;
}
BN_free(pn);
/* Set the public key */
if (pub->bytes != ANODE_EC_PUBLIC_KEY_BYTES) {
EC_KEY_free(key);
return 0;
}
kxy = EC_POINT_new(AnodeEC_group);
if (!kxy) {
EC_KEY_free(key);
return 0;
}
EC_POINT_oct2point(AnodeEC_group,kxy,pub->key,ANODE_EC_PUBLIC_KEY_BYTES,0);
if (!EC_KEY_set_public_key(key,kxy)) {
EC_POINT_free(kxy);
EC_KEY_free(key);
return 0;
}
EC_POINT_free(kxy);
Anode_zero(pair,sizeof(struct AnodeECKeyPair));
Anode_memcpy((void *)&(pair->pub),(const void *)pub,sizeof(struct AnodeECKey));
Anode_memcpy((void *)&(pair->priv),(const void *)priv,sizeof(struct AnodeECKey));
pair->internal_key = key;
return 1;
}
void AnodeECKeyPair_destroy(struct AnodeECKeyPair *pair)
{
if (pair) {
if (pair->internal_key)
EC_KEY_free((EC_KEY *)pair->internal_key);
}
}
int AnodeECKeyPair_agree(const struct AnodeECKeyPair *my_key_pair,const struct AnodeECKey *their_pub_key,unsigned char *key_buf,unsigned int key_len)
{
EC_POINT *pub;
int i;
if (!AnodeEC_group) {
AnodeEC_group = EC_GROUP_new_by_curve_name(ANODE_EC_GROUP);
if (!AnodeEC_group) return 0;
}
if (!my_key_pair->internal_key)
return 0;
if (their_pub_key->bytes != ANODE_EC_PUBLIC_KEY_BYTES)
return 0;
pub = EC_POINT_new(AnodeEC_group);
if (!pub)
return 0;
EC_POINT_oct2point(AnodeEC_group,pub,their_pub_key->key,ANODE_EC_PUBLIC_KEY_BYTES,0);
i = ECDH_compute_key(key_buf,key_len,pub,(EC_KEY *)my_key_pair->internal_key,&AnodeEC_KDF);
if (i != (int)key_len) {
EC_POINT_free(pub);
return 0;
}
EC_POINT_free(pub);
return 1;
}
void AnodeEC_random(unsigned char *buf,unsigned int len)
{
RAND_pseudo_bytes(buf,len);
}

61
attic/historic/anode/libanode/impl/ec.h Normal file
View File

@ -0,0 +1,61 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.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/>. */
/* Elliptic curve glue -- hides OpenSSL code behind this source module */
#ifndef _ANODE_EC_H
#define _ANODE_EC_H
#include "misc.h"
/* Right now, only one mode is supported: NIST-P-256. This is the only mode
* supported in the spec as well, and should be good for quite some time.
* If other modes are needed this code will need to be refactored. */
/* NIST-P-256 prime size in bytes */
#define ANODE_EC_PRIME_BYTES 32
/* Sizes of key fields */
#define ANODE_EC_GROUP NID_X9_62_prime256v1
#define ANODE_EC_PUBLIC_KEY_BYTES (ANODE_EC_PRIME_BYTES + 1)
#define ANODE_EC_PRIVATE_KEY_BYTES ANODE_EC_PRIME_BYTES
/* Larger of public or private key bytes, used for buffers */
#define ANODE_EC_MAX_BYTES ANODE_EC_PUBLIC_KEY_BYTES
struct AnodeECKey
{
unsigned char key[ANODE_EC_MAX_BYTES];
unsigned int bytes;
};
struct AnodeECKeyPair
{
struct AnodeECKey pub;
struct AnodeECKey priv;
void *internal_key;
};
/* Key management functions */
int AnodeECKeyPair_generate(struct AnodeECKeyPair *pair);
int AnodeECKeyPair_init(struct AnodeECKeyPair *pair,const struct AnodeECKey *pub,const struct AnodeECKey *priv);
void AnodeECKeyPair_destroy(struct AnodeECKeyPair *pair);
int AnodeECKeyPair_agree(const struct AnodeECKeyPair *my_key_pair,const struct AnodeECKey *their_pub_key,unsigned char *key_buf,unsigned int key_len);
/* Provides access to the secure PRNG used to generate keys */
void AnodeEC_random(unsigned char *buf,unsigned int len);
#endif

118
attic/historic/anode/libanode/impl/environment.c Normal file
View File

@ -0,0 +1,118 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <stdlib.h>
#include "environment.h"
#ifdef WINDOWS
#include <windows.h>
#else
#include <sys/stat.h>
#include <string.h>
#endif
static char Anode_cache_base[1024] = { 0 };
const char *Anode_get_cache()
{
if (Anode_cache_base[0])
return Anode_cache_base;
#ifdef WINDOWS
#else
char tmp[1024];
char home[1024];
unsigned int i;
struct stat st;
const char *_home = getenv("HOME");
if (!_home)
return (const char *)0;
for(i=0;i<sizeof(home);++i) {
home[i] = _home[i];
if (!home[i]) {
if (i == 0)
return (const char *)0;
else if (home[i-1] == ANODE_PATH_SEPARATOR)
home[i-1] = (char)0;
break;
}
}
if (i == sizeof(home))
return (const char *)0;
#ifdef __APPLE__
snprintf(tmp,sizeof(tmp),"%s%cLibrary",home,ANODE_PATH_SEPARATOR);
tmp[sizeof(tmp)-1] = (char)0;
if (!stat(tmp,&st)) {
sprintf(tmp,"%s%cLibrary%cCaches",home,ANODE_PATH_SEPARATOR,ANODE_PATH_SEPARATOR);
if (stat(tmp,&st)) {
if (mkdir(tmp,0700))
return (const char *)0;
}
snprintf(Anode_cache_base,sizeof(Anode_cache_base),"%s%ccom.zerotier.anode",tmp,ANODE_PATH_SEPARATOR);
Anode_cache_base[sizeof(Anode_cache_base)-1] = (char)0;
if (stat(Anode_cache_base,&st)) {
if (mkdir(Anode_cache_base,0700)) {
Anode_cache_base[0] = (char)0;
return (const char *)0;
}
}
return Anode_cache_base;
}
#endif
snprintf(tmp,sizeof(tmp),"%s%c.anode",home,ANODE_PATH_SEPARATOR);
tmp[sizeof(tmp)-1] = (char)0;
if (stat(tmp,&st)) {
if (mkdir(tmp,0700)) {
Anode_cache_base[0] = (char)0;
return (const char *)0;
}
}
snprintf(Anode_cache_base,sizeof(Anode_cache_base),"%s%ccaches",tmp,ANODE_PATH_SEPARATOR);
Anode_cache_base[sizeof(Anode_cache_base)-1] = (char)0;
if (stat(Anode_cache_base,&st)) {
if (mkdir(Anode_cache_base,0700)) {
Anode_cache_base[0] = (char)0;
return (const char *)0;
}
}
return Anode_cache_base;
#endif
}
char *Anode_get_cache_sub(const char *cache_subdir,char *buf,unsigned int len)
{
struct stat st;
const char *cache_base = Anode_get_cache();
if (!len)
return (char *)0;
if (!cache_base)
return (char *)0;
snprintf(buf,len,"%s%c%s",cache_base,ANODE_PATH_SEPARATOR,cache_subdir);
buf[len-1] = (char)0;
if (stat(buf,&st)) {
if (mkdir(buf,0700))
return (char *)0;
}
return buf;
}

30
attic/historic/anode/libanode/impl/environment.h Normal file
View File

@ -0,0 +1,30 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef _ANODE_ENVIRONMENT_H
#define _ANODE_ENVIRONMENT_H
#ifdef WINDOWS
#define ANODE_PATH_SEPARATOR '\\'
#else
#define ANODE_PATH_SEPARATOR '/'
#endif
const char *Anode_get_cache();
char *Anode_get_cache_sub(const char *cache_subdir,char *buf,unsigned int len);
#endif

558
attic/historic/anode/libanode/impl/http_client.c Normal file
View File

@ -0,0 +1,558 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <netinet/in.h>
#include <sys/socket.h>
#include "http_client.h"
#include "misc.h"
#include "types.h"
/* How much to increment read buffer at each capacity top? */
#define ANODE_HTTP_CAPACITY_INCREMENT 4096
static void AnodeHttpClient_close_and_fail(struct AnodeHttpClient *client)
{
if (client->impl.tcp_connection) {
client->impl.transport_engine->tcp_close(client->impl.transport_engine,client->impl.tcp_connection);
client->impl.tcp_connection = (AnodeTransportTcpConnection *)0;
}
client->response.data_length = 0;
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_CLOSED;
if (client->handler)
client->handler(client);
}
static void AnodeHttpClient_do_initiate_client(struct AnodeHttpClient *client)
{
const char *method = "";
long l,i;
switch(client->method) {
case ANODE_HTTP_GET: method = "GET"; break;
case ANODE_HTTP_HEAD: method = "HEAD"; break;
case ANODE_HTTP_POST: method = "POST"; break;
}
client->impl.outbuf_len = snprintf((char *)client->impl.outbuf,sizeof(client->impl.outbuf),
"%s %s%s%s HTTP/1.1\r\nHost: %s:%d\r\n%s",
method,
client->uri.path,
((client->uri.query[0]) ? "?" : ""),
client->uri.query,
client->uri.host,
((client->uri.port > 0) ? client->uri.port : 80),
((client->keepalive) ? "" : "Connection: close\r\n")
);
if (client->impl.outbuf_len >= (sizeof(client->impl.outbuf) - 2)) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_HEADERS_TOO_LARGE;
AnodeHttpClient_close_and_fail(client);
return;
}
if (client->method == ANODE_HTTP_POST) {
if ((client->data)&&(client->data_length)) {
client->impl.outbuf_len += snprintf((char *)client->impl.outbuf + client->impl.outbuf_len,sizeof(client->impl.outbuf) - client->impl.outbuf_len,
"Content-Type: %s\r\n",
(client->data_content_type ? client->data_content_type : "application/x-www-form-urlencoded")
);
if (client->impl.outbuf_len >= (sizeof(client->impl.outbuf) - 2)) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_HEADERS_TOO_LARGE;
AnodeHttpClient_close_and_fail(client);
return;
}
client->impl.outbuf_len += snprintf((char *)client->impl.outbuf + client->impl.outbuf_len,sizeof(client->impl.outbuf) - client->impl.outbuf_len,
"Content-Length: %u\r\n",
client->data_length
);
if (client->impl.outbuf_len >= (sizeof(client->impl.outbuf) - 2)) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_HEADERS_TOO_LARGE;
AnodeHttpClient_close_and_fail(client);
return;
}
} else {
client->impl.outbuf_len += snprintf((char *)client->impl.outbuf + client->impl.outbuf_len,sizeof(client->impl.outbuf) - client->impl.outbuf_len,
"Content-Length: 0\r\n"
);
if (client->impl.outbuf_len >= (sizeof(client->impl.outbuf) - 2)) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_HEADERS_TOO_LARGE;
AnodeHttpClient_close_and_fail(client);
return;
}
}
}
l = AnodeDictionary_write(&(client->headers),(char *)client->impl.outbuf + client->impl.outbuf_len,(long)(sizeof(client->impl.outbuf) - client->impl.outbuf_len - 2),"\r\n",": ");
if (l < 0) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_HEADERS_TOO_LARGE;
AnodeHttpClient_close_and_fail(client);
return;
}
client->impl.outbuf_len += (unsigned int)l;
if (client->impl.outbuf_len >= (sizeof(client->impl.outbuf) - 2)) { /* sanity check */
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_HEADERS_TOO_LARGE;
AnodeHttpClient_close_and_fail(client);
return;
}
client->impl.outbuf[client->impl.outbuf_len++] = '\r';
client->impl.outbuf[client->impl.outbuf_len++] = '\n';
if ((client->method == ANODE_HTTP_POST)&&(client->data)&&(client->data_length)) {
i = sizeof(client->impl.outbuf) - client->impl.outbuf_len;
if (i > client->data_length)
i = client->data_length;
Anode_memcpy((client->impl.outbuf + client->impl.outbuf_len),client->data,i);
client->impl.request_data_ptr += i;
client->impl.outbuf_len += i;
}
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_SEND;
client->impl.transport_engine->tcp_start_writing(client->impl.transport_engine,client->impl.tcp_connection);
}
static void AnodeHttpClient_tcp_outgoing_connect_handler(
AnodeTransportEngine *transport,
AnodeTransportTcpConnection *connection,
int error_code)
{
struct AnodeHttpClient *client;
if (!(client = (struct AnodeHttpClient *)(connection->ptr)))
return;
if ((client->impl.phase == ANODE_HTTP_REQUEST_PHASE_CONNECT)&&(!client->impl.freed)) {
if (error_code) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_CONNECT_FAILED;
AnodeHttpClient_close_and_fail(client);
} else {
client->impl.tcp_connection = connection;
AnodeHttpClient_do_initiate_client(client);
}
} else transport->tcp_close(transport,connection);
}
static void AnodeHttpClient_tcp_connection_terminated_handler(
AnodeTransportEngine *transport,
AnodeTransportTcpConnection *connection,
int error_code)
{
struct AnodeHttpClient *client;
if (!(client = (struct AnodeHttpClient *)(connection->ptr)))
return;
if (client->impl.freed)
return;
client->response.data_length = 0;
client->impl.tcp_connection = (AnodeTransportTcpConnection *)0;
if ((client->impl.phase != ANODE_HTTP_REQUEST_PHASE_KEEPALIVE)&&(client->impl.phase != ANODE_HTTP_REQUEST_PHASE_CLOSED)) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_SERVER_CLOSED_CONNECTION;
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_CLOSED;
AnodeHttpClient_close_and_fail(client);
} else client->impl.phase = ANODE_HTTP_REQUEST_PHASE_CLOSED;
}
static void AnodeHttpClient_tcp_receive_handler(
AnodeTransportEngine *transport,
AnodeTransportTcpConnection *connection,
void *data,
unsigned int data_length)
{
struct AnodeHttpClient *client;
char *p1,*p2;
unsigned int i;
long l;
if (!(client = (struct AnodeHttpClient *)(connection->ptr)))
return;
if (client->impl.freed) {
transport->tcp_close(transport,connection);
return;
}
if (!client->response.data)
client->response.data = malloc(client->impl.response_data_capacity = ANODE_HTTP_CAPACITY_INCREMENT);
i = 0;
while (i < data_length) {
switch(client->impl.read_mode) {
case ANODE_HTTP_READ_MODE_WAITING:
for(;i<data_length;++i) {
if (((const char *)data)[i] == '\n') {
((char *)client->response.data)[client->response.data_length] = (char)0;
client->response.data_length = 0;
p1 = (char *)Anode_strchr((char *)client->response.data,' ');
if (!p1)
p1 = (char *)Anode_strchr((char *)client->response.data,'\t');
if (p1) {
while ((*p1 == ' ')||(*p1 == '\t')) ++p1;
if (!*p1) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_INVALID_RESPONSE;
AnodeHttpClient_close_and_fail(client);
return;
}
p2 = p1 + 1;
while (*p2) {
if ((*p2 == ' ')||(*p2 == '\t')||(*p2 == '\r')||(*p2 == '\n')) {
*p2 = (char)0;
break;
} else ++p2;
}
client->response.code = (int)strtol(p1,(char **)0,10);
client->impl.read_mode = ANODE_HTTP_READ_MODE_HEADERS;
++i; break; /* Exit inner for() */
}
} else {
((char *)client->response.data)[client->response.data_length++] = ((const char *)data)[i];
if (client->response.data_length >= client->impl.response_data_capacity)
client->response.data = realloc(client->response.data,client->impl.response_data_capacity += ANODE_HTTP_CAPACITY_INCREMENT);
}
}
break;
case ANODE_HTTP_READ_MODE_HEADERS:
case ANODE_HTTP_READ_MODE_CHUNKED_FOOTER:
for(;i<data_length;++i) {
if (((const char *)data)[i] == '\n') {
client->impl.header_line_buf[client->impl.header_line_buf_ptr] = (char)0;
client->impl.header_line_buf_ptr = 0;
if ((!client->impl.header_line_buf[0])||((client->impl.header_line_buf[0] == '\r')&&(!client->impl.header_line_buf[1]))) {
/* If the line is empty (or is empty with \r\n as the
* line terminator), we're at the end. */
if (client->impl.read_mode == ANODE_HTTP_READ_MODE_CHUNKED_FOOTER) {
/* If this is a chunked footer, we finally end the
* chunked response. */
client->impl.read_mode = ANODE_HTTP_READ_MODE_WAITING;
if (client->keepalive)
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_KEEPALIVE;
else {
client->impl.transport_engine->tcp_close(client->impl.transport_engine,client->impl.tcp_connection);
client->impl.tcp_connection = (AnodeTransportTcpConnection *)0;
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_CLOSED;
}
if (client->handler)
client->handler(client);
if (client->impl.freed)
return;
} else {
/* Otherwise, this is a regular header block */
if (client->response.code == 100) {
/* Ignore 100 Continue messages */
client->impl.read_mode = ANODE_HTTP_READ_MODE_WAITING;
++i; break; /* Exit inner for() */
} else if ((client->response.code == 200)&&(client->method != ANODE_HTTP_HEAD)) {
/* Other messages get their headers parsed to determine
* how to read them. */
p1 = (char *)AnodeDictionary_get(&(client->response.headers),"transfer-encoding");
if ((p1)&&(Anode_strcaseeq(p1,"chunked"))) {
/* Chunked encoding enters chunked mode */
client->impl.header_line_buf_ptr = 0;
client->impl.read_mode = ANODE_HTTP_READ_MODE_CHUNKED_CHUNK_SIZE;
++i; break; /* Exit inner for() */
} else {
/* Else we must have a Content-Length header */
p1 = (char *)AnodeDictionary_get(&(client->response.headers),"content-length");
if (!p1) {
/* No chunked or content length is not supported */
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_INVALID_RESPONSE;
AnodeHttpClient_close_and_fail(client);
return;
} else {
/* Enter block read mode with content length */
l = strtol(p1,(char **)0,10);
if (l <= 0) {
/* Zero length data is all done... */
client->impl.expecting_response_length = 0;
client->impl.read_mode = ANODE_HTTP_READ_MODE_WAITING;
if (client->keepalive)
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_KEEPALIVE;
else {
client->impl.transport_engine->tcp_close(client->impl.transport_engine,client->impl.tcp_connection);
client->impl.tcp_connection = (AnodeTransportTcpConnection *)0;
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_CLOSED;
}
if (client->handler)
client->handler(client);
if (client->impl.freed)
return;
++i; break; /* Exit inner for() */
} else {
/* Else start reading... */
client->impl.expecting_response_length = (unsigned int)l;
client->impl.read_mode = ANODE_HTTP_READ_MODE_BLOCK;
++i; break; /* Exit inner for() */
}
}
}
} else {
/* HEAD clients or non-200 codes get headers only */
client->impl.expecting_response_length = 0;
client->impl.read_mode = ANODE_HTTP_READ_MODE_WAITING;
if (client->keepalive)
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_KEEPALIVE;
else {
client->impl.transport_engine->tcp_close(client->impl.transport_engine,client->impl.tcp_connection);
client->impl.tcp_connection = (AnodeTransportTcpConnection *)0;
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_CLOSED;
}
if (client->handler)
client->handler(client);
if (client->impl.freed)
return;
++i; break; /* Exit inner for() */
}
}
} else {
/* Otherwise this is another header, add to dictionary */
AnodeDictionary_read(
&(client->response.headers),
client->impl.header_line_buf,
"\r\n",
": \t",
"",
(char)0,
1,
1
);
}
} else {
client->impl.header_line_buf[client->impl.header_line_buf_ptr++] = ((const char *)data)[i];
if (client->impl.header_line_buf_ptr >= sizeof(client->impl.header_line_buf)) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_INVALID_RESPONSE;
AnodeHttpClient_close_and_fail(client);
return;
}
}
}
break;
case ANODE_HTTP_READ_MODE_BLOCK:
if ((client->response.data_length + client->impl.expecting_response_length) > client->impl.response_data_capacity)
client->response.data = realloc(client->response.data,client->impl.response_data_capacity = (client->response.data_length + client->impl.expecting_response_length));
for(;((i<data_length)&&(client->impl.expecting_response_length));++i) {
((char *)client->response.data)[client->response.data_length++] = ((const char *)data)[i];
--client->impl.expecting_response_length;
}
if (!client->impl.expecting_response_length) {
client->impl.read_mode = ANODE_HTTP_READ_MODE_WAITING;
if (client->keepalive)
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_KEEPALIVE;
else {
client->impl.transport_engine->tcp_close(client->impl.transport_engine,client->impl.tcp_connection);
client->impl.tcp_connection = (AnodeTransportTcpConnection *)0;
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_CLOSED;
}
if (client->handler)
client->handler(client);
if (client->impl.freed)
return;
}
break;
case ANODE_HTTP_READ_MODE_CHUNKED_CHUNK_SIZE:
for(;i<data_length;++i) {
if (((const char *)data)[i] == '\n') {
client->impl.header_line_buf[client->impl.header_line_buf_ptr] = (char)0;
client->impl.header_line_buf_ptr = 0;
p1 = client->impl.header_line_buf;
while (*p1) {
if ((*p1 == ';')||(*p1 == ' ')||(*p1 == '\r')||(*p1 == '\n')||(*p1 == '\t')) {
*p1 = (char)0;
break;
} else ++p1;
}
if (client->impl.header_line_buf[0]) {
l = strtol(client->impl.header_line_buf,(char **)0,16);
if (l <= 0) {
/* Zero length ends chunked and enters footer mode */
client->impl.expecting_response_length = 0;
client->impl.read_mode = ANODE_HTTP_READ_MODE_CHUNKED_FOOTER;
} else {
/* Otherwise the next chunk is to be read */
client->impl.expecting_response_length = (unsigned int)l;
client->impl.read_mode = ANODE_HTTP_READ_MODE_CHUNKED_DATA;
}
++i; break; /* Exit inner for() */
}
} else {
client->impl.header_line_buf[client->impl.header_line_buf_ptr++] = ((const char *)data)[i];
if (client->impl.header_line_buf_ptr >= sizeof(client->impl.header_line_buf)) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_INVALID_RESPONSE;
AnodeHttpClient_close_and_fail(client);
return;
}
}
}
break;
case ANODE_HTTP_READ_MODE_CHUNKED_DATA:
if ((client->response.data_length + client->impl.expecting_response_length) > client->impl.response_data_capacity)
client->response.data = realloc(client->response.data,client->impl.response_data_capacity = (client->response.data_length + client->impl.expecting_response_length));
for(;((i<data_length)&&(client->impl.expecting_response_length));++i) {
((char *)client->response.data)[client->response.data_length++] = ((const char *)data)[i];
--client->impl.expecting_response_length;
}
if (!client->impl.expecting_response_length)
client->impl.read_mode = ANODE_HTTP_READ_MODE_CHUNKED_CHUNK_SIZE;
break;
}
}
}
static void AnodeHttpClient_tcp_available_for_write_handler(
AnodeTransportEngine *transport,
AnodeTransportTcpConnection *connection)
{
struct AnodeHttpClient *client;
unsigned int i,j;
int n;
if (!(client = (struct AnodeHttpClient *)(connection->ptr)))
return;
if (client->impl.freed) {
transport->tcp_close(transport,connection);
return;
}
if (client->impl.phase == ANODE_HTTP_REQUEST_PHASE_SEND) {
n = client->impl.transport_engine->tcp_send(client->impl.transport_engine,client->impl.tcp_connection,(const void *)client->impl.outbuf,(int)client->impl.outbuf_len);
if (n < 0) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_SERVER_CLOSED_CONNECTION;
AnodeHttpClient_close_and_fail(client);
} else if (n > 0) {
for(i=0,j=(client->impl.outbuf_len - (unsigned int)n);i<j;++i)
client->impl.outbuf[i] = client->impl.outbuf[i + (unsigned int)n];
client->impl.outbuf_len -= (unsigned int)n;
if ((client->method == ANODE_HTTP_POST)&&(client->data)&&(client->data_length)) {
i = sizeof(client->impl.outbuf) - client->impl.outbuf_len;
j = client->data_length - client->impl.request_data_ptr;
if (i > j)
i = j;
Anode_memcpy((client->impl.outbuf + client->impl.outbuf_len),client->data,i);
client->impl.request_data_ptr += i;
client->impl.outbuf_len += i;
}
if (!client->impl.outbuf_len) {
client->impl.transport_engine->tcp_stop_writing(client->impl.transport_engine,client->impl.tcp_connection);
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_RECEIVE;
}
}
} else client->impl.transport_engine->tcp_stop_writing(client->impl.transport_engine,client->impl.tcp_connection);
}
static void AnodeHttpClient_dns_result_handler(
AnodeTransportEngine *transport,
void *ptr,
int error_code,
const char *name,
const AnodeTransportIpAddress *ip_addresses,
unsigned int ip_address_count,
const AnodeAddress *anode_address)
{
struct AnodeHttpClient *client;
AnodeTransportIpEndpoint to_endpoint;
if (!(client = (struct AnodeHttpClient *)ptr))
return;
if (client->impl.freed)
return;
if ((error_code)||(!ip_address_count)) {
if (client->impl.phase == ANODE_HTTP_REQUEST_PHASE_RESOLVE) {
client->response.code = ANODE_HTTP_SPECIAL_RESPONSE_DNS_RESOLVE_FAILED;
AnodeHttpClient_close_and_fail(client);
}
} else {
client->impl.phase = ANODE_HTTP_REQUEST_PHASE_CONNECT;
Anode_memcpy(&to_endpoint.address,ip_addresses,sizeof(AnodeTransportIpAddress));
to_endpoint.port = (client->uri.port > 0) ? client->uri.port : 80;
client->impl.transport_engine->tcp_connect(
client->impl.transport_engine,
client,
&AnodeHttpClient_tcp_outgoing_connect_handler,
&AnodeHttpClient_tcp_connection_terminated_handler,
&AnodeHttpClient_tcp_receive_handler,
&AnodeHttpClient_tcp_available_for_write_handler,
&to_endpoint);
}
}
struct AnodeHttpClient *AnodeHttpClient_new(AnodeTransportEngine *transport_engine)
{
struct AnodeHttpClient *req = malloc(sizeof(struct AnodeHttpClient));
Anode_zero(req,sizeof(struct AnodeHttpClient));
AnodeDictionary_init(&(req->headers),0);
AnodeDictionary_init(&(req->response.headers),0);
req->impl.transport_engine = transport_engine;
return req;
}
void AnodeHttpClient_send(struct AnodeHttpClient *client)
{
client->response.code = 0;
client->response.data_length = 0;
AnodeDictionary_clear(&(client->response.headers));
client->impl.request_data_ptr = 0;
client->impl.expecting_response_length = 0;
client->impl.read_mode = ANODE_HTTP_READ_MODE_WAITING;
client->impl.outbuf_len = 0;
if (!client->impl.tcp_connection) {
client->impl.transport_engine->dns_resolve(
client->impl.transport_engine,
&AnodeHttpClient_dns_result_handler,
client,
client->uri.host,
ANODE_TRANSPORT_DNS_QUERY_ALWAYS,
ANODE_TRANSPORT_DNS_QUERY_IF_NO_PREVIOUS,
ANODE_TRANSPORT_DNS_QUERY_NEVER);
} else AnodeHttpClient_do_initiate_client(client);
}
void AnodeHttpClient_free(struct AnodeHttpClient *client)
{
AnodeDictionary_destroy(&(client->headers));
AnodeDictionary_destroy(&(client->response.headers));
if (client->impl.tcp_connection) {
client->impl.transport_engine->tcp_close(client->impl.transport_engine,client->impl.tcp_connection);
client->impl.tcp_connection = (AnodeTransportTcpConnection *)0;
}
if (client->response.data)
free(client->response.data);
client->impl.freed = 1;
client->impl.transport_engine->run_later(client->impl.transport_engine,client,&free);
}

200
attic/historic/anode/libanode/impl/http_client.h Normal file
View File

@ -0,0 +1,200 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef _ANODE_HTTP_CLIENT_H
#define _ANODE_HTTP_CLIENT_H
#include <stdio.h>
#include <stdlib.h>
#include "dictionary.h"
#include "../anode.h"
#ifdef __cplusplus
extern "C" {
#endif
/**
* HTTP request type
*/
enum AnodeHttpClientRequestMethod
{
ANODE_HTTP_GET = 0,
ANODE_HTTP_HEAD = 1,
ANODE_HTTP_POST = 2
};
/*
* Special response codes to indicate I/O errors
*/
#define ANODE_HTTP_SPECIAL_RESPONSE_DNS_RESOLVE_FAILED -1
#define ANODE_HTTP_SPECIAL_RESPONSE_CONNECT_FAILED -2
#define ANODE_HTTP_SPECIAL_RESPONSE_HEADERS_TOO_LARGE -3
#define ANODE_HTTP_SPECIAL_RESPONSE_SERVER_CLOSED_CONNECTION -4
#define ANODE_HTTP_SPECIAL_RESPONSE_INVALID_RESPONSE -5
/**
* Simple HTTP client
*/
struct AnodeHttpClient
{
/**
* Request URI
*/
AnodeURI uri;
/**
* Request method: GET, PUT, HEAD, or POST
*/
enum AnodeHttpClientRequestMethod method;
/**
* Data for POST requests
*
* It is your responsibility to manage and/or free this pointer. The HTTP
* client only reads from it.
*/
const void *data;
unsigned int data_length;
/**
* Content type for data, or null for application/x-www-form-urlencoded
*/
const char *data_content_type;
/**
* Set to non-zero to use HTTP connection keepalive
*
* If keepalive is enabled, this request can be modified and re-used and
* its associated connection will stay open (being reopened if needed)
* until it is freed.
*
* Note that this client is too dumb to pool connections and pick them on
* the basis of host. Keepalive mode should only be set if the next request
* will be from the same host and port, otherwise you will get a '404'.
*/
int keepalive;
/**
* Function pointer to be called when request is complete (or fails)
*/
void (*handler)(struct AnodeHttpClient *);
/**
* Two arbitrary pointers that can be stored here for use by the handler.
* These are not accessed or modified by the client.
*/
void *ptr[2];
/**
* Request headers
*/
struct AnodeDictionary headers;
struct {
/**
* Response code, set on completion or failure before handler is called
*
* Also check for the special response codes defined in http_client.h as
* these negative codes indicate network or other errors.
*/
int code;
/**
* Response data, for GET and POST requests
*/
void *data;
/**
* Length of response data
*/
unsigned int data_length;
/**
* Response headers
*/
struct AnodeDictionary headers;
} response;
/**
* Internal fields used by implementation
*/
struct {
/* Transport engine being used by request */
AnodeTransportEngine *transport_engine;
/* Connection to which request has been sent, or null if none */
struct AnodeHttpConnection *connection;
/* Buffer for reading chunked mode chunk lines (can't use data buf) */
char header_line_buf[256];
unsigned int header_line_buf_ptr;
/* Where are we in sending request data? */
unsigned int request_data_ptr;
/* Capacity of response_data buffer */
unsigned int response_data_capacity;
/* How much response data are we currently expecting? */
/* This is content-length in block mode or chunk length in chunked mode */
unsigned int expecting_response_length;
/* Read mode */
enum {
ANODE_HTTP_READ_MODE_WAITING = 0,
ANODE_HTTP_READ_MODE_HEADERS = 1,
ANODE_HTTP_READ_MODE_BLOCK = 2,
ANODE_HTTP_READ_MODE_CHUNKED_CHUNK_SIZE = 3,
ANODE_HTTP_READ_MODE_CHUNKED_DATA = 4,
ANODE_HTTP_READ_MODE_CHUNKED_FOOTER = 5
} read_mode;
/* Connection from transport engine */
AnodeTransportTcpConnection *tcp_connection;
/* Write buffer */
unsigned char outbuf[16384];
unsigned int outbuf_len;
/* Phase of request state machine */
enum {
ANODE_HTTP_REQUEST_PHASE_RESOLVE = 0,
ANODE_HTTP_REQUEST_PHASE_CONNECT = 1,
ANODE_HTTP_REQUEST_PHASE_SEND = 2,
ANODE_HTTP_REQUEST_PHASE_RECEIVE = 3,
ANODE_HTTP_REQUEST_PHASE_KEEPALIVE = 4,
ANODE_HTTP_REQUEST_PHASE_CLOSED = 5
} phase;
/* Has request object been freed? */
int freed;
/**
* Pointer used internally for putting requests into linked lists
*/
struct AnodeHttpClient *next;
} impl;
};
struct AnodeHttpClient *AnodeHttpClient_new(AnodeTransportEngine *transport_engine);
void AnodeHttpClient_send(struct AnodeHttpClient *client);
void AnodeHttpClient_free(struct AnodeHttpClient *client);
#ifdef __cplusplus
}
#endif
#endif

190
attic/historic/anode/libanode/impl/misc.c Normal file
View File

@ -0,0 +1,190 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "misc.h"
#include "types.h"
static const char Anode_hex_chars[16] = {
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'
};
static const char Anode_base32_chars[32] = {
'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q',
'r','s','t','u','v','w','x','y','z','2','3','4','5','6','7'
};
static const unsigned char Anode_base32_bits[256] = {
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,26,27,28,29,30,31,0,0,0,0,0,0,0,0,0,0,1,2,3,4,5,
6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,0,0,0,0,0,0,0,1,2,
3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
};
/* Table for converting ASCII chars to lower case */
const unsigned char Anode_ascii_tolower_table[256] = {
0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f,
0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17,
0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f,
0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27,
0x28, 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f,
0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37,
0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f,
0x40, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67,
0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f,
0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
0x78, 0x79, 0x7a, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f,
0x60, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67,
0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f,
0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f,
0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87,
0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f,
0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97,
0x98, 0x99, 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f,
0xa0, 0xa1, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6, 0xa7,
0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf,
0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7,
0xb8, 0xb9, 0xba, 0xbb, 0xbc, 0xbd, 0xbe, 0xbf,
0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7,
0xc8, 0xc9, 0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf,
0xd0, 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0xd7,
0xd8, 0xd9, 0xda, 0xdb, 0xdc, 0xdd, 0xde, 0xdf,
0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7,
0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef,
0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7,
0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xff
};
void Anode_trim(char *s)
{
char *dest = s;
char *last;
while ((*s)&&((*s == ' ')||(*s == '\t')||(*s == '\r')||(*s == '\n')))
++s;
last = s;
while ((*dest = *s)) {
if ((*dest != ' ')&&(*dest != '\t')&&(*dest != '\r')&&(*dest != '\n'))
last = dest;
++dest;
++s;
}
if (*last)
*(++last) = (char)0;
}
unsigned int Anode_rand()
{
static volatile int need_seed = 1;
if (need_seed) {
need_seed = 0;
srandom((unsigned long)Anode_time64());
}
return (unsigned int)random();
}
void Anode_to_hex(const unsigned char *b,unsigned int len,char *h,unsigned int hlen)
{
unsigned int i;
if ((len * 2) >= hlen)
len = (hlen - 1) / 2;
for(i=0;i<len;++i) {
*(h++) = Anode_hex_chars[b[i] >> 4];
*(h++) = Anode_hex_chars[b[i] & 0xf];
}
*h = (char)0;
}
void Anode_from_hex(const char *h,unsigned char *b,unsigned int blen)
{
unsigned char *end = b + blen;
unsigned char v = (unsigned char)0;
while (b != end) {
switch(*(h++)) {
case '0': v = 0x00; break;
case '1': v = 0x10; break;
case '2': v = 0x20; break;
case '3': v = 0x30; break;
case '4': v = 0x40; break;
case '5': v = 0x50; break;
case '6': v = 0x60; break;
case '7': v = 0x70; break;
case '8': v = 0x80; break;
case '9': v = 0x90; break;
case 'a': v = 0xa0; break;
case 'b': v = 0xb0; break;
case 'c': v = 0xc0; break;
case 'd': v = 0xd0; break;
case 'e': v = 0xe0; break;
case 'f': v = 0xf0; break;
default: return;
}
switch(*(h++)) {
case '0': v |= 0x00; break;
case '1': v |= 0x01; break;
case '2': v |= 0x02; break;
case '3': v |= 0x03; break;
case '4': v |= 0x04; break;
case '5': v |= 0x05; break;
case '6': v |= 0x06; break;
case '7': v |= 0x07; break;
case '8': v |= 0x08; break;
case '9': v |= 0x09; break;
case 'a': v |= 0x0a; break;
case 'b': v |= 0x0b; break;
case 'c': v |= 0x0c; break;
case 'd': v |= 0x0d; break;
case 'e': v |= 0x0e; break;
case 'f': v |= 0x0f; break;
default: return;
}
*(b++) = v;
}
}
void Anode_base32_5_to_8(const unsigned char *in,char *out)
{
out[0] = Anode_base32_chars[(in[0]) >> 3];
out[1] = Anode_base32_chars[(in[0] & 0x07) << 2 | (in[1] & 0xc0) >> 6];
out[2] = Anode_base32_chars[(in[1] & 0x3e) >> 1];
out[3] = Anode_base32_chars[(in[1] & 0x01) << 4 | (in[2] & 0xf0) >> 4];
out[4] = Anode_base32_chars[(in[2] & 0x0f) << 1 | (in[3] & 0x80) >> 7];
out[5] = Anode_base32_chars[(in[3] & 0x7c) >> 2];
out[6] = Anode_base32_chars[(in[3] & 0x03) << 3 | (in[4] & 0xe0) >> 5];
out[7] = Anode_base32_chars[(in[4] & 0x1f)];
}
void Anode_base32_8_to_5(const char *in,unsigned char *out)
{
out[0] = ((Anode_base32_bits[(unsigned int)in[0]]) << 3) | (Anode_base32_bits[(unsigned int)in[1]] & 0x1C) >> 2;
out[1] = ((Anode_base32_bits[(unsigned int)in[1]] & 0x03) << 6) | (Anode_base32_bits[(unsigned int)in[2]]) << 1 | (Anode_base32_bits[(unsigned int)in[3]] & 0x10) >> 4;
out[2] = ((Anode_base32_bits[(unsigned int)in[3]] & 0x0F) << 4) | (Anode_base32_bits[(unsigned int)in[4]] & 0x1E) >> 1;
out[3] = ((Anode_base32_bits[(unsigned int)in[4]] & 0x01) << 7) | (Anode_base32_bits[(unsigned int)in[5]]) << 2 | (Anode_base32_bits[(unsigned int)in[6]] & 0x18) >> 3;
out[4] = ((Anode_base32_bits[(unsigned int)in[6]] & 0x07) << 5) | (Anode_base32_bits[(unsigned int)in[7]]);
}

193
attic/historic/anode/libanode/impl/misc.h Normal file
View File

@ -0,0 +1,193 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.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/>. */
/* This contains miscellaneous functions, including some re-implementations
* of some functions from string.h. This is to help us port to some platforms
* (cough Windows Mobile cough) that lack a lot of the basic C library. */
#ifndef _ANODE_MISC_H
#define _ANODE_MISC_H
#include <time.h>
#include <sys/time.h>
#include "types.h"
#ifndef ANODE_NO_STRING_H
#include <string.h>
#include <stdlib.h>
#endif
/* Table mapping ASCII characters to themselves or their lower case */
extern const unsigned char Anode_ascii_tolower_table[256];
/* Get the lower case version of an ASCII char */
#define Anode_tolower(c) ((char)Anode_ascii_tolower_table[((unsigned long)((unsigned char)(c)))])
/* Test strings for equality, return nonzero if equal */
static inline unsigned int Anode_streq(const char *restrict a,const char *restrict b)
{
if ((!a)||(!b))
return 0;
while (*a == *(b++)) {
if (!*(a++))
return 1;
}
return 0;
}
/* Equality test ignoring (ASCII) case */
static inline unsigned int Anode_strcaseeq(const char *restrict a,const char *restrict b)
{
if ((!a)||(!b))
return 0;
while (Anode_tolower(*a) == Anode_tolower(*(b++))) {
if (!*(a++))
return 1;
}
return 0;
}
/* Safe c-string copy, ensuring that dest[] always ends with zero */
static inline void Anode_str_copy(char *restrict dest,const char *restrict src,unsigned int dest_size)
{
char *restrict dest_end = dest + (dest_size - 1);
while ((*src)&&(dest != dest_end))
*(dest++) = *(src++);
*dest = (char)0;
}
/* Simple memcpy() */
#ifdef ANODE_NO_STRING_H
static inline void Anode_memcpy(void *restrict dest,const void *restrict src,unsigned int len)
{
unsigned int i;
for(i=0;i<len;++i)
((unsigned char *restrict)dest)[i] = ((const unsigned char *restrict)src)[i];
}
#else
#define Anode_memcpy(d,s,l) memcpy((d),(s),(l))
#endif
/* Memory test for equality */
#ifdef ANODE_NO_STRING_H
static inline unsigned int Anode_mem_eq(const void *restrict a,const void *restrict b,unsigned int len)
{
unsigned int i;
for(i=0;i<len;++i) {
if (((const unsigned char *restrict)a)[i] != ((const unsigned char *restrict)b)[i])
return 0;
}
return 1;
}
#else
#define Anode_mem_eq(a,b,l) (!memcmp((a),(b),(l)))
#endif
/* Zero memory */
#ifdef ANODE_NO_STRING_H
static inline void Anode_zero(void *restrict ptr,unsigned int len)
{
unsigned int i;
for(i=0;i<len;++i)
((unsigned char *restrict)ptr)[i] = (unsigned char)0;
}
#else
#define Anode_zero(p,l) memset((p),0,(l))
#endif
/* Get a pointer to the first occurrance of a character in a string */
#ifdef ANODE_NO_STRING_H
static inline const char *Anode_strchr(const char *s,char c)
{
while (*s) {
if (*s == c)
return s;
++s;
}
return (char *)0;
}
#else
#define Anode_strchr(s,c) strchr((s),(c))
#endif
static inline unsigned int Anode_count_char(const char *s,char c)
{
unsigned int cnt = 0;
while (s) {
if (*s == c)
++cnt;
++s;
}
return cnt;
}
/* Strip all of a given set of characters from a string */
static inline void Anode_strip_all(char *s,const char *restrict schars)
{
char *d = s;
while (*s) {
if (!Anode_strchr(schars,*s))
*(d++) = *s;
++s;
}
*d = (char)0;
}
/* Trim whitespace from beginning and end of string */
void Anode_trim(char *s);
/* Get the length of a string */
#ifdef ANODE_NO_STRING_H
static inline unsigned int Anode_strlen(const char *s)
{
const char *ptr = s;
while (*ptr) ++ptr;
return (unsigned int)(ptr - s);
}
#else
#define Anode_strlen(s) strlen((s))
#endif
/* Returns number of milliseconds since the epoch (Java-style) */
static inline uint64_t Anode_time64()
{
struct timeval tv;
gettimeofday(&tv,(void *)0);
return ( (((uint64_t)tv.tv_sec) / 1000ULL) + ((uint64_t)(tv.tv_usec / 1000ULL)) );
}
/* Returns number of seconds since the epoch (*nix style) */
static inline unsigned long Anode_time()
{
struct timeval tv;
gettimeofday(&tv,(void *)0);
return (unsigned long)tv.tv_sec;
}
/* Simple random function, not cryptographically safe */
unsigned int Anode_rand();
/* Fast hex/ascii conversion */
void Anode_to_hex(const unsigned char *b,unsigned int len,char *h,unsigned int hlen);
void Anode_from_hex(const char *h,unsigned char *b,unsigned int blen);
/* Convert back and forth from base32 encoding */
/* 5 bytes -> 8 base32 characters and vice versa */
void Anode_base32_5_to_8(const unsigned char *in,char *out);
void Anode_base32_8_to_5(const char *in,unsigned char *out);
#endif

34
attic/historic/anode/libanode/impl/mutex.h Normal file
View File

@ -0,0 +1,34 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef _ANODE_MUTEX_H
#define _ANODE_MUTEX_H
#ifdef WINDOWS
#else /* WINDOWS */
#include <pthread.h>
#define AnodeMutex pthread_mutex_t
#define AnodeMutex_init(m) pthread_mutex_init((m),(const pthread_mutexattr_t *)0)
#define AnodeMutex_destroy(m) pthread_mutex_destroy((m))
#define AnodeMutex_lock(m) pthread_mutex_lock((m))
#define AnodeMutex_unlock(m) pthread_mutex_unlock((m))
#endif /* WINDOWS */
#endif

58
attic/historic/anode/libanode/impl/thread.c Normal file
View File

@ -0,0 +1,58 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include "thread.h"
#include <stdlib.h>
#ifdef WINDOWS
#else /* not WINDOWS */
struct _AnodeThread
{
void (*func)(void *);
void *arg;
int wait_for_join;
pthread_t thread;
};
static void *_AnodeThread_main(void *arg)
{
((struct _AnodeThread *)arg)->func(((struct _AnodeThread *)arg)->arg);
if (!((struct _AnodeThread *)arg)->wait_for_join)
free(arg);
return (void *)0;
}
AnodeThread *AnodeThread_create(void (*func)(void *),void *arg,int wait_for_join)
{
struct _AnodeThread *t = malloc(sizeof(struct _AnodeThread));
t->func = func;
t->arg = arg;
t->wait_for_join = wait_for_join;
pthread_create(&t->thread,(const pthread_attr_t *)0,&_AnodeThread_main,(void *)t);
if (!wait_for_join)
pthread_detach(t->thread);
return (AnodeThread *)t;
}
void AnodeThread_join(AnodeThread *thread)
{
pthread_join(((struct _AnodeThread *)thread)->thread,(void **)0);
free((void *)thread);
}
#endif /* WINDOWS / not WINDOWS */

65
attic/historic/anode/libanode/impl/thread.h Normal file
View File

@ -0,0 +1,65 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef _ANODE_THREAD_H
#define _ANODE_THREAD_H
#ifdef WINDOWS
#include <windows.h>
#include <thread.h>
typedef DWORD AnodeThreadId;
#else /* not WINDOWS */
#include <pthread.h>
typedef pthread_t AnodeThreadId;
#define AnodeThread_self() pthread_self()
#define AnodeThreadId_equal(a,b) pthread_equal((pthread_t)(a),(pthread_t)(b))
#endif
typedef void AnodeThread;
/**
* Create and launch a new thread
*
* If wait_for_join is true (nonzero), the thread can and must be joined. The
* thread object won't be freed until join is called and returns. If
* wait_for_join is false, the thread object frees itself automatically on
* termination.
*
* If wait_for_join is false (zero), there is really no need to keep track of
* the thread object.
*
* @param func Function to call as thread main
* @param arg Argument to pass to function
* @param wait_for_join If false, thread deletes itself when it terminates
*/
AnodeThread *AnodeThread_create(void (*func)(void *),void *arg,int wait_for_join);
/**
* Wait for a thread to terminate and delete thread object
*
* This can only be used for threads created with wait_for_join set to true.
* The thread object is no longer valid after this call.
*
* @param thread Thread to wait for termination and delete
*/
void AnodeThread_join(AnodeThread *thread);
#endif

25
attic/historic/anode/libanode/impl/types.h Normal file
View File

@ -0,0 +1,25 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef _ANODE_TYPES_H
#define _ANODE_TYPES_H
#ifdef WINDOWS
#else
#include <stdint.h>
#endif
#endif

136
attic/historic/anode/libanode/network_address.c Normal file
View File

@ -0,0 +1,136 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <netinet/in.h>
#include <arpa/inet.h>
#include "impl/misc.h"
#include "impl/types.h"
#include "anode.h"
const AnodeNetworkAddress AnodeNetworkAddress_ANY4 = {
ANODE_NETWORK_ADDRESS_IPV4,
{ 0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }
};
const AnodeNetworkAddress AnodeNetworkAddress_ANY6 = {
ANODE_NETWORK_ADDRESS_IPV6,
{ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }
};
const AnodeNetworkAddress AnodeNetworkAddress_LOCAL4 = {
ANODE_NETWORK_ADDRESS_IPV4,
{ 127,0,0,1, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }
};
const AnodeNetworkAddress AnodeNetworkAddress_LOCAL6 = {
ANODE_NETWORK_ADDRESS_IPV6,
{ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1 ,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }
};
int AnodeNetworkAddress_to_string(const AnodeNetworkAddress *address,char *buf,int len)
{
const char *s;
switch(address->type) {
case ANODE_NETWORK_ADDRESS_IPV4:
s = inet_ntop(AF_INET,(const void *)address->bits,buf,len);
if (s)
return Anode_strlen(s);
else return ANODE_ERR_INVALID_ARGUMENT;
break;
case ANODE_NETWORK_ADDRESS_IPV6:
s = inet_ntop(AF_INET6,address->bits,buf,len);
if (s)
return Anode_strlen(s);
else return ANODE_ERR_INVALID_ARGUMENT;
/*
case ANODE_NETWORK_ADDRESS_ETHERNET:
break;
case ANODE_NETWORK_ADDRESS_USB:
break;
case ANODE_NETWORK_ADDRESS_BLUETOOTH:
break;
case ANODE_NETWORK_ADDRESS_IPC:
break;
case ANODE_NETWORK_ADDRESS_80211S:
break;
case ANODE_NETWORK_ADDRESS_SERIAL:
break;
*/
case ANODE_NETWORK_ADDRESS_ANODE_256_40:
return AnodeAddress_to_string((const AnodeAddress *)address->bits,buf,len);
default:
return ANODE_ERR_ADDRESS_TYPE_NOT_SUPPORTED;
}
}
int AnodeNetworkAddress_from_string(const char *str,AnodeNetworkAddress *address)
{
unsigned int dots = Anode_count_char(str,'.');
unsigned int colons = Anode_count_char(str,':');
if ((dots == 3)&&(!colons)) {
address->type = ANODE_NETWORK_ADDRESS_IPV4;
if (inet_pton(AF_INET,str,address->bits) > 0)
return 0;
else return ANODE_ERR_INVALID_ARGUMENT;
} else if ((colons)&&(!dots)) {
address->type = ANODE_NETWORK_ADDRESS_IPV6;
if (inet_pton(AF_INET6,str,address->bits) > 0)
return 0;
else return ANODE_ERR_INVALID_ARGUMENT;
} else {
address->type = ANODE_NETWORK_ADDRESS_ANODE_256_40;
return AnodeAddress_from_string(str,(AnodeAddress *)address->bits);
}
}
int AnodeNetworkEndpoint_from_sockaddr(const void *sockaddr,AnodeNetworkEndpoint *endpoint)
{
switch(((struct sockaddr_storage *)sockaddr)->ss_family) {
case AF_INET:
*((uint32_t *)endpoint->address.bits) = (uint32_t)(((struct sockaddr_in *)sockaddr)->sin_addr.s_addr);
endpoint->port = (int)ntohs(((struct sockaddr_in *)sockaddr)->sin_port);
return 0;
case AF_INET6:
Anode_memcpy(endpoint->address.bits,((struct sockaddr_in6 *)sockaddr)->sin6_addr.s6_addr,16);
endpoint->port = (int)ntohs(((struct sockaddr_in6 *)sockaddr)->sin6_port);
return 0;
default:
return ANODE_ERR_INVALID_ARGUMENT;
}
}
int AnodeNetworkEndpoint_to_sockaddr(const AnodeNetworkEndpoint *endpoint,void *sockaddr,int sockaddr_len)
{
switch(endpoint->address.type) {
case ANODE_NETWORK_ADDRESS_IPV4:
if (sockaddr_len < (int)sizeof(struct sockaddr_in))
return ANODE_ERR_BUFFER_TOO_SMALL;
Anode_zero(sockaddr,sizeof(struct sockaddr_in));
((struct sockaddr_in *)sockaddr)->sin_family = AF_INET;
((struct sockaddr_in *)sockaddr)->sin_port = htons((uint16_t)endpoint->port);
((struct sockaddr_in *)sockaddr)->sin_addr.s_addr = *((uint32_t *)endpoint->address.bits);
return 0;
case ANODE_NETWORK_ADDRESS_IPV6:
if (sockaddr_len < (int)sizeof(struct sockaddr_in6))
return ANODE_ERR_BUFFER_TOO_SMALL;
Anode_zero(sockaddr,sizeof(struct sockaddr_in6));
((struct sockaddr_in6 *)sockaddr)->sin6_family = AF_INET6;
((struct sockaddr_in6 *)sockaddr)->sin6_port = htons((uint16_t)endpoint->port);
Anode_memcpy(((struct sockaddr_in6 *)sockaddr)->sin6_addr.s6_addr,endpoint->address.bits,16);
return 0;
default:
return ANODE_ERR_INVALID_ARGUMENT;
}
}

88
attic/historic/anode/libanode/secure_random.c Normal file
View File

@ -0,0 +1,88 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdlib.h>
#include <stdio.h>
#include "impl/aes.h"
#include "impl/misc.h"
#include "anode.h"
#ifdef WINDOWS
#include <windows.h>
#include <wincrypt.h>
#endif
struct AnodeSecureRandomImpl
{
AnodeAesExpandedKey key;
unsigned char state[ANODE_AES_BLOCK_SIZE];
unsigned char block[ANODE_AES_BLOCK_SIZE];
unsigned int ptr;
};
AnodeSecureRandom *AnodeSecureRandom_new()
{
unsigned char keybuf[ANODE_AES_KEY_SIZE + ANODE_AES_BLOCK_SIZE + ANODE_AES_BLOCK_SIZE];
unsigned int i;
struct AnodeSecureRandomImpl *srng;
#ifdef WINDOWS
HCRYPTPROV hProv;
if (CryptAcquireContext(&hProv,NULL,NULL,PROV_RSA_FULL,CRYPT_VERIFYCONTEXT|CRYPT_SILENT)) {
CryptGenRandom(hProv,sizeof(keybuf),keybuf);
CryptReleaseContext(hProv,0);
}
#else
FILE *urandf = fopen("/dev/urandom","rb");
if (urandf) {
fread((void *)keybuf,sizeof(keybuf),1,urandf);
fclose(urandf);
}
#endif
for(i=0;i<sizeof(keybuf);++i)
keybuf[i] ^= (unsigned char)(Anode_rand() >> 5);
srng = malloc(sizeof(struct AnodeSecureRandomImpl));
Anode_aes256_expand_key(keybuf,&srng->key);
for(i=0;i<ANODE_AES_BLOCK_SIZE;++i)
srng->state[i] = keybuf[ANODE_AES_KEY_SIZE + i];
for(i=0;i<ANODE_AES_BLOCK_SIZE;++i)
srng->block[i] = keybuf[ANODE_AES_KEY_SIZE + ANODE_AES_KEY_SIZE + i];
srng->ptr = ANODE_AES_BLOCK_SIZE;
return (AnodeSecureRandom *)srng;
}
void AnodeSecureRandom_gen_bytes(AnodeSecureRandom *srng,void *buf,long count)
{
long i,j;
for(i=0;i<count;++i) {
if (((struct AnodeSecureRandomImpl *)srng)->ptr == ANODE_AES_BLOCK_SIZE) {
Anode_aes256_encrypt(&((struct AnodeSecureRandomImpl *)srng)->key,((struct AnodeSecureRandomImpl *)srng)->state,((struct AnodeSecureRandomImpl *)srng)->state);
for(j=0;j<ANODE_AES_KEY_SIZE;++j)
((struct AnodeSecureRandomImpl *)srng)->block[j] ^= ((struct AnodeSecureRandomImpl *)srng)->state[j];
((struct AnodeSecureRandomImpl *)srng)->ptr = 0;
}
((unsigned char *)buf)[i] = ((struct AnodeSecureRandomImpl *)srng)->block[((struct AnodeSecureRandomImpl *)srng)->ptr++];
}
}
void AnodeSecureRandom_delete(AnodeSecureRandom *srng)
{
free(srng);
}

948
attic/historic/anode/libanode/system_transport.c Normal file
View File

@ -0,0 +1,948 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <netdb.h>
#include <fcntl.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include "anode.h"
#include "impl/mutex.h"
#include "impl/thread.h"
#include "impl/misc.h"
#include "impl/dns_txt.h"
#ifdef WINDOWS
#include <windows.h>
#include <winsock2.h>
#define AnodeSystemTransport__close_socket(s) closesocket((s))
#define ANODE_USE_SELECT 1
#else
#include <poll.h>
#include <unistd.h>
#define AnodeSystemTransport__close_socket(s) close((s))
#endif
static const char *AnodeSystemTransport_CLASS = "SystemTransport";
/* ======================================================================== */
struct AnodeSystemTransport;
struct AnodeSystemTransport_AnodeSocket
{
AnodeSocket base; /* must be first */
unsigned int entry_idx;
};
#define ANODE_SYSTEM_TRANSPORT_DNS_MAX_RESULTS 16
struct AnodeSystemTransport__dns_request
{
struct AnodeSystemTransport__dns_request *next;
AnodeThread *thread;
struct AnodeSystemTransport *owner;
void (*event_handler)(const AnodeEvent *event);
char name[256];
enum AnodeTransportDnsIncludeMode ipv4_include_mode;
enum AnodeTransportDnsIncludeMode ipv6_include_mode;
enum AnodeTransportDnsIncludeMode anode_include_mode;
AnodeNetworkAddress addresses[ANODE_SYSTEM_TRANSPORT_DNS_MAX_RESULTS];
unsigned int address_count;
int error_code;
};
#ifdef ANODE_USE_SELECT
typedef int AnodeSystemTransport__poll_fd; /* for select() */
#else
typedef struct pollfd AnodeSystemTransport__poll_fd; /* for poll() */
#endif
struct AnodeSystemTransport
{
AnodeTransport interface; /* must be first */
AnodeTransport *base;
#ifdef ANODE_USE_SELECT
FD_SET readfds;
FD_SET writefds;
#endif
void (*default_event_handler)(const AnodeEvent *event);
AnodeSystemTransport__poll_fd *fds;
struct AnodeSystemTransport_AnodeSocket *sockets;
unsigned int fd_count;
unsigned int fd_capacity;
struct AnodeSystemTransport__dns_request *pending_dns_requests;
int invoke_pipe[2];
AnodeMutex invoke_pipe_m;
void *invoke_pipe_buf[2];
unsigned int invoke_pipe_buf_ptr;
};
/* ======================================================================== */
/* Internal helper methods */
static unsigned int AnodeSystemTransport__add_entry(struct AnodeSystemTransport *transport)
{
if ((transport->fd_count + 1) > transport->fd_capacity) {
transport->fd_capacity += 8;
transport->fds = realloc(transport->fds,sizeof(AnodeSystemTransport__poll_fd) * transport->fd_capacity);
transport->sockets = realloc(transport->sockets,sizeof(struct AnodeSystemTransport_AnodeSocket) * transport->fd_capacity);
}
return transport->fd_count++;
}
static void AnodeSystemTransport__remove_entry(struct AnodeSystemTransport *transport,const unsigned int idx)
{
unsigned int i;
--transport->fd_count;
for(i=idx;i<transport->fd_count;++i) {
Anode_memcpy(&transport->fds[i],&transport->fds[i+1],sizeof(AnodeSystemTransport__poll_fd));
Anode_memcpy(&transport->sockets[i],&transport->sockets[i+1],sizeof(struct AnodeSystemTransport_AnodeSocket));
}
if ((transport->fd_capacity - transport->fd_count) > 16) {
transport->fd_capacity -= 16;
transport->fds = realloc(transport->fds,sizeof(AnodeSystemTransport__poll_fd) * transport->fd_capacity);
transport->sockets = realloc(transport->sockets,sizeof(struct AnodeSystemTransport_AnodeSocket) * transport->fd_capacity);
}
}
static void AnodeSystemTransport__dns_invoke_on_completion(void *_dreq)
{
struct AnodeSystemTransport__dns_request *dreq = (struct AnodeSystemTransport__dns_request *)_dreq;
struct AnodeSystemTransport__dns_request *ptr,**lastnext;
AnodeThread_join(dreq->thread);
ptr = dreq->owner->pending_dns_requests;
lastnext = &dreq->owner->pending_dns_requests;
while (ptr) {
if (ptr == dreq) {
*lastnext = ptr->next;
break;
} else {
lastnext = &ptr->next;
ptr = ptr->next;
}
}
free(dreq);
}
static void AnodeSystemTransport__dns_thread_main(void *_dreq)
{
struct AnodeSystemTransport__dns_request *dreq = (struct AnodeSystemTransport__dns_request *)_dreq;
dreq->owner->interface.invoke((AnodeTransport *)dreq->owner,dreq,&AnodeSystemTransport__dns_invoke_on_completion);
}
static void AnodeSystemTransport__do_close(struct AnodeSystemTransport *transport,struct AnodeSystemTransport_AnodeSocket *sock,const int error_code,const int generate_event)
{
AnodeEvent evbuf;
int fd;
if (sock->base.class_name == AnodeSystemTransport_CLASS) {
#ifdef ANODE_USE_SELECT
fd = (int)(transport->fds[((struct AnodeSystemTransport_AnodeSocket *)sock)->entry_idx]);
#else
fd = transport->fds[((struct AnodeSystemTransport_AnodeSocket *)sock)->entry_idx].fd;
#endif
if ((sock->base.type == ANODE_SOCKET_STREAM_CONNECTION)&&(sock->base.state != ANODE_SOCKET_CLOSED)) {
sock->base.state = ANODE_SOCKET_CLOSED;
if (generate_event) {
evbuf.type = ANODE_TRANSPORT_EVENT_STREAM_CLOSED;
evbuf.transport = (AnodeTransport *)transport;
evbuf.sock = (AnodeSocket *)sock;
evbuf.datagram_from = NULL;
evbuf.dns_name = NULL;
evbuf.dns_addresses = NULL;
evbuf.dns_address_count = 0;
evbuf.error_code = error_code;
evbuf.data_length = 0;
evbuf.data = NULL;
if (sock->base.event_handler)
sock->base.event_handler(&evbuf);
else if (transport->default_event_handler)
transport->default_event_handler(&evbuf);
}
}
AnodeSystemTransport__close_socket(fd);
AnodeSystemTransport__remove_entry(transport,((struct AnodeSystemTransport_AnodeSocket *)sock)->entry_idx);
#ifdef ANODE_USE_SELECT
FD_CLR(sock,&THIS->readfds);
FD_CLR(sock,&THIS->writefds);
#endif
} else transport->base->close(transport->base,(AnodeSocket *)sock);
}
static int AnodeSystemTransport__populate_network_endpoint(const struct sockaddr_storage *saddr,AnodeNetworkEndpoint *ep)
{
switch(saddr->ss_family) {
case AF_INET:
ep->address.type = ANODE_NETWORK_ADDRESS_IPV4;
*((uint32_t *)ep->address.bits) = ((struct sockaddr_in *)saddr)->sin_addr.s_addr;
ep->port = ntohs(((struct sockaddr_in *)saddr)->sin_port);
return 1;
case AF_INET6:
ep->address.type = ANODE_NETWORK_ADDRESS_IPV6;
Anode_memcpy(ep->address.bits,((struct sockaddr_in6 *)saddr)->sin6_addr.s6_addr,16);
ep->port = ntohs(((struct sockaddr_in6 *)saddr)->sin6_port);
return 1;
}
return 0;
}
/* ======================================================================== */
#ifdef THIS
#undef THIS
#endif
#define THIS ((struct AnodeSystemTransport *)transport)
static void AnodeSystemTransport_invoke(AnodeTransport *transport,
void *ptr,
void (*func)(void *))
{
void *invoke_msg[2];
invoke_msg[0] = ptr;
invoke_msg[1] = (void *)func;
AnodeMutex_lock(&THIS->invoke_pipe_m);
write(THIS->invoke_pipe[1],(void *)(&invoke_msg),sizeof(invoke_msg));
AnodeMutex_unlock(&THIS->invoke_pipe_m);
}
static void AnodeSystemTransport_dns_resolve(AnodeTransport *transport,
const char *name,
void (*event_handler)(const AnodeEvent *),
enum AnodeTransportDnsIncludeMode ipv4_include_mode,
enum AnodeTransportDnsIncludeMode ipv6_include_mode,
enum AnodeTransportDnsIncludeMode anode_include_mode)
{
struct AnodeSystemTransport__dns_request *dreq = malloc(sizeof(struct AnodeSystemTransport__dns_request));
dreq->owner = THIS;
dreq->event_handler = event_handler;
Anode_str_copy(dreq->name,name,sizeof(dreq->name));
dreq->ipv4_include_mode = ipv4_include_mode;
dreq->ipv6_include_mode = ipv6_include_mode;
dreq->anode_include_mode = anode_include_mode;
dreq->address_count = 0;
dreq->error_code = 0;
dreq->next = THIS->pending_dns_requests;
THIS->pending_dns_requests = dreq;
dreq->thread = AnodeThread_create(&AnodeSystemTransport__dns_thread_main,dreq,0);
}
static AnodeSocket *AnodeSystemTransport_datagram_listen(AnodeTransport *transport,
const AnodeNetworkAddress *local_address,
int local_port,
int *error_code)
{
struct sockaddr_in sin4;
struct sockaddr_in6 sin6;
struct AnodeSystemTransport_AnodeSocket *sock;
unsigned int entry_idx;
int fd;
int tmp;
switch(local_address->type) {
case ANODE_NETWORK_ADDRESS_IPV4:
fd = socket(AF_INET,SOCK_DGRAM,0);
if (fd <= 0) {
*error_code = ANODE_ERR_UNABLE_TO_BIND;
return (AnodeSocket *)0;
}
tmp = 1;
setsockopt(fd,SOL_SOCKET,SO_REUSEADDR,&tmp,sizeof(tmp));
fcntl(fd,F_SETFL,O_NONBLOCK);
Anode_zero(&sin4,sizeof(struct sockaddr_in));
sin4.sin_family = AF_INET;
sin4.sin_port = htons(local_port);
sin4.sin_addr.s_addr = *((uint32_t *)local_address->bits);
if (bind(fd,(const struct sockaddr *)&sin4,sizeof(sin4))) {
AnodeSystemTransport__close_socket(fd);
*error_code = ANODE_ERR_UNABLE_TO_BIND;
return (AnodeSocket *)0;
}
break;
case ANODE_NETWORK_ADDRESS_IPV6:
fd = socket(AF_INET6,SOCK_DGRAM,0);
if (fd <= 0) {
*error_code = ANODE_ERR_UNABLE_TO_BIND;
return (AnodeSocket *)0;
}
tmp = 1; setsockopt(fd,SOL_SOCKET,SO_REUSEADDR,&tmp,sizeof(tmp));
fcntl(fd,F_SETFL,O_NONBLOCK);
#ifdef IPV6_V6ONLY
tmp = 1; setsockopt(fd,IPPROTO_IPV6,IPV6_V6ONLY,&tmp,sizeof(tmp));
#endif
Anode_zero(&sin6,sizeof(struct sockaddr_in6));
sin6.sin6_family = AF_INET6;
sin6.sin6_port = htons(local_port);
Anode_memcpy(sin6.sin6_addr.s6_addr,local_address->bits,16);
if (bind(fd,(const struct sockaddr *)&sin6,sizeof(sin6))) {
AnodeSystemTransport__close_socket(fd);
*error_code = ANODE_ERR_UNABLE_TO_BIND;
return (AnodeSocket *)0;
}
break;
default:
if (THIS->base)
return THIS->base->datagram_listen(THIS->base,local_address,local_port,error_code);
else {
*error_code = ANODE_ERR_ADDRESS_TYPE_NOT_SUPPORTED;
return (AnodeSocket *)0;
}
}
entry_idx = AnodeSystemTransport__add_entry(THIS);
sock = &(THIS->sockets[entry_idx]);
sock->base.type = ANODE_SOCKET_DATAGRAM;
sock->base.state = ANODE_SOCKET_OPEN;
Anode_memcpy(&sock->base.endpoint.address,local_address,sizeof(AnodeNetworkAddress));
sock->base.endpoint.port = local_port;
sock->base.class_name = AnodeSystemTransport_CLASS;
sock->base.user_ptr[0] = NULL;
sock->base.user_ptr[1] = NULL;
sock->base.event_handler = NULL;
sock->entry_idx = entry_idx;
THIS->fds[entry_idx].fd = fd;
THIS->fds[entry_idx].events = POLLIN;
THIS->fds[entry_idx].revents = 0;
*error_code = 0;
return (AnodeSocket *)sock;
}
static AnodeSocket *AnodeSystemTransport_stream_listen(AnodeTransport *transport,
const AnodeNetworkAddress *local_address,
int local_port,
int *error_code)
{
struct sockaddr_in sin4;
struct sockaddr_in6 sin6;
struct AnodeSystemTransport_AnodeSocket *sock;
unsigned int entry_idx;
int fd;
int tmp;
switch(local_address->type) {
case ANODE_NETWORK_ADDRESS_IPV4:
fd = socket(AF_INET,SOCK_STREAM,0);
if (fd < 0) {
*error_code = ANODE_ERR_UNABLE_TO_BIND;
return (AnodeSocket *)0;
}
fcntl(fd,F_SETFL,O_NONBLOCK);
Anode_zero(&sin4,sizeof(struct sockaddr_in));
sin4.sin_family = AF_INET;
sin4.sin_port = htons(local_port);
sin4.sin_addr.s_addr = *((uint32_t *)local_address->bits);
if (bind(fd,(const struct sockaddr *)&sin4,sizeof(sin4))) {
AnodeSystemTransport__close_socket(fd);
*error_code = ANODE_ERR_UNABLE_TO_BIND;
return (AnodeSocket *)0;
}
if (listen(fd,8)) {
AnodeSystemTransport__close_socket(fd);
*error_code = ANODE_ERR_UNABLE_TO_BIND;
return (AnodeSocket *)0;
}
break;
case ANODE_NETWORK_ADDRESS_IPV6:
fd = socket(AF_INET6,SOCK_STREAM,0);
if (fd < 0) {
*error_code = ANODE_ERR_UNABLE_TO_BIND;
return (AnodeSocket *)0;
}
fcntl(fd,F_SETFL,O_NONBLOCK);
#ifdef IPV6_V6ONLY
tmp = 1; setsockopt(fd,IPPROTO_IPV6,IPV6_V6ONLY,&tmp,sizeof(tmp));
#endif
Anode_zero(&sin6,sizeof(struct sockaddr_in6));
sin6.sin6_family = AF_INET6;
sin6.sin6_port = htons(local_port);
Anode_memcpy(sin6.sin6_addr.s6_addr,local_address->bits,16);
if (bind(fd,(const struct sockaddr *)&sin6,sizeof(sin6))) {
AnodeSystemTransport__close_socket(fd);
*error_code = ANODE_ERR_UNABLE_TO_BIND;
return (AnodeSocket *)0;
}
if (listen(fd,8)) {
AnodeSystemTransport__close_socket(fd);
*error_code = ANODE_ERR_UNABLE_TO_BIND;
return (AnodeSocket *)0;
}
break;
default:
if (THIS->base)
return THIS->base->stream_listen(THIS->base,local_address,local_port,error_code);
else {
*error_code = ANODE_ERR_ADDRESS_TYPE_NOT_SUPPORTED;
return (AnodeSocket *)0;
}
}
entry_idx = AnodeSystemTransport__add_entry(THIS);
sock = &(THIS->sockets[entry_idx]);
sock->base.type = ANODE_SOCKET_STREAM_LISTEN;
sock->base.state = ANODE_SOCKET_OPEN;
Anode_memcpy(&sock->base.endpoint.address,local_address,sizeof(AnodeNetworkAddress));
sock->base.endpoint.port = local_port;
sock->base.class_name = AnodeSystemTransport_CLASS;
sock->base.user_ptr[0] = NULL;
sock->base.user_ptr[1] = NULL;
sock->base.event_handler = NULL;
sock->entry_idx = entry_idx;
THIS->fds[entry_idx].fd = fd;
THIS->fds[entry_idx].events = POLLIN;
THIS->fds[entry_idx].revents = 0;
*error_code = 0;
return (AnodeSocket *)sock;
}
static int AnodeSystemTransport_datagram_send(AnodeTransport *transport,
AnodeSocket *sock,
const void *data,
int data_len,
const AnodeNetworkEndpoint *to_endpoint)
{
struct sockaddr_in sin4;
struct sockaddr_in6 sin6;
#ifdef ANODE_USE_SELECT
const int fd = (int)(THIS->fds[((struct AnodeSystemTransport_AnodeSocket *)sock)->entry_idx]);
#else
const int fd = THIS->fds[((struct AnodeSystemTransport_AnodeSocket *)sock)->entry_idx].fd;
#endif
switch(to_endpoint->address.type) {
case ANODE_NETWORK_ADDRESS_IPV4:
Anode_zero(&sin4,sizeof(struct sockaddr_in));
sin4.sin_family = AF_INET;
sin4.sin_port = htons((uint16_t)to_endpoint->port);
sin4.sin_addr.s_addr = *((uint32_t *)to_endpoint->address.bits);
sendto(fd,data,data_len,0,(struct sockaddr *)&sin4,sizeof(sin4));
return 0;
case ANODE_NETWORK_ADDRESS_IPV6:
Anode_zero(&sin6,sizeof(struct sockaddr_in6));
sin6.sin6_family = AF_INET6;
sin6.sin6_port = htons((uint16_t)to_endpoint->port);
Anode_memcpy(sin6.sin6_addr.s6_addr,to_endpoint->address.bits,16);
sendto(fd,data,data_len,0,(struct sockaddr *)&sin6,sizeof(sin6));
return 0;
default:
if (THIS->base)
return THIS->base->datagram_send(THIS->base,sock,data,data_len,to_endpoint);
else return ANODE_ERR_ADDRESS_TYPE_NOT_SUPPORTED;
}
}
static AnodeSocket *AnodeSystemTransport_stream_connect(AnodeTransport *transport,
const AnodeNetworkEndpoint *to_endpoint,
int *error_code)
{
struct sockaddr_in sin4;
struct sockaddr_in6 sin6;
struct AnodeSystemTransport_AnodeSocket *sock;
unsigned int entry_idx;
int fd;
switch(to_endpoint->address.type) {
case ANODE_NETWORK_ADDRESS_IPV4:
Anode_zero(&sin4,sizeof(struct sockaddr_in));
sin4.sin_family = AF_INET;
sin4.sin_port = htons(to_endpoint->port);
sin4.sin_addr.s_addr = *((uint32_t *)to_endpoint->address.bits);
fd = socket(AF_INET,SOCK_STREAM,0);
if (fd < 0) {
*error_code = ANODE_ERR_ADDRESS_TYPE_NOT_SUPPORTED;
return (AnodeSocket *)0;
}
fcntl(fd,F_SETFL,O_NONBLOCK);
if (connect(fd,(struct sockaddr *)&sin4,sizeof(sin4))) {
if (errno != EINPROGRESS) {
*error_code = ANODE_ERR_CONNECT_FAILED;
AnodeSystemTransport__close_socket(fd);
return (AnodeSocket *)0;
}
}
break;
case ANODE_NETWORK_ADDRESS_IPV6:
Anode_zero(&sin6,sizeof(struct sockaddr_in6));
sin6.sin6_family = AF_INET6;
sin6.sin6_port = htons(to_endpoint->port);
Anode_memcpy(sin6.sin6_addr.s6_addr,to_endpoint->address.bits,16);
fd = socket(AF_INET6,SOCK_STREAM,0);
if (fd < 0) {
*error_code = ANODE_ERR_ADDRESS_TYPE_NOT_SUPPORTED;
return (AnodeSocket *)0;
}
fcntl(fd,F_SETFL,O_NONBLOCK);
if (connect(fd,(struct sockaddr *)&sin6,sizeof(sin6))) {
if (errno == EINPROGRESS) {
*error_code = ANODE_ERR_CONNECT_FAILED;
AnodeSystemTransport__close_socket(fd);
return (AnodeSocket *)0;
}
}
break;
default:
if (THIS->base)
return THIS->base->stream_connect(THIS->base,to_endpoint,error_code);
else {
*error_code = ANODE_ERR_ADDRESS_TYPE_NOT_SUPPORTED;
return (AnodeSocket *)0;
}
}
entry_idx = AnodeSystemTransport__add_entry(THIS);
sock = &(THIS->sockets[entry_idx]);
sock->base.type = ANODE_SOCKET_STREAM_CONNECTION;
sock->base.state = ANODE_SOCKET_CONNECTING;
Anode_memcpy(&sock->base.endpoint,to_endpoint,sizeof(AnodeNetworkEndpoint));
sock->base.class_name = AnodeSystemTransport_CLASS;
sock->base.user_ptr[0] = NULL;
sock->base.user_ptr[1] = NULL;
sock->base.event_handler = NULL;
sock->entry_idx = entry_idx;
THIS->fds[entry_idx].fd = fd;
THIS->fds[entry_idx].events = POLLIN|POLLOUT;
THIS->fds[entry_idx].revents = 0;
return (AnodeSocket *)sock;
}
static void AnodeSystemTransport_stream_start_writing(AnodeTransport *transport,
AnodeSocket *sock)
{
if ((sock->type == ANODE_SOCKET_STREAM_CONNECTION)&&(((struct AnodeSystemTransport_AnodeSocket *)sock)->base.state == ANODE_SOCKET_OPEN)) {
if (sock->class_name == AnodeSystemTransport_CLASS) {
#ifdef ANODE_USE_SELECT
FD_SET((int)(THIS->fds[((struct AnodeSystemTransport_AnodeSocket *)sock)->entry_idx]),&THIS->writefds);
#else
THIS->fds[((struct AnodeSystemTransport_AnodeSocket *)sock)->entry_idx].events = (POLLIN|POLLOUT);
#endif
} else THIS->base->stream_start_writing(THIS->base,sock);
}
}
static void AnodeSystemTransport_stream_stop_writing(AnodeTransport *transport,
AnodeSocket *sock)
{
if ((sock->type == ANODE_SOCKET_STREAM_CONNECTION)&&(((struct AnodeSystemTransport_AnodeSocket *)sock)->base.state == ANODE_SOCKET_OPEN)) {
if (sock->class_name == AnodeSystemTransport_CLASS) {
#ifdef ANODE_USE_SELECT
FD_CLR((int)(THIS->fds[((struct AnodeSystemTransport_AnodeSocket *)sock)->entry_idx]),&THIS->writefds);
#else
THIS->fds[((struct AnodeSystemTransport_AnodeSocket *)sock)->entry_idx].events = POLLIN;
#endif
} else THIS->base->stream_stop_writing(THIS->base,sock);
}
}
static int AnodeSystemTransport_stream_send(AnodeTransport *transport,
AnodeSocket *sock,
const void *data,
int data_len)
{
int result;
if (sock->type == ANODE_SOCKET_STREAM_CONNECTION) {
if (sock->class_name == AnodeSystemTransport_CLASS) {
if (((struct AnodeSystemTransport_AnodeSocket *)sock)->base.state != ANODE_SOCKET_OPEN)
return ANODE_ERR_CONNECTION_CLOSED;
#ifdef ANODE_USE_SELECT
result = send((int)(THIS->fds[((struct AnodeSystemTransport_AnodeSocket *)sock)->entry_idx]),data,data_len,0);
#else
result = send(THIS->fds[((struct AnodeSystemTransport_AnodeSocket *)sock)->entry_idx].fd,data,data_len,0);
#endif
if (result >= 0)
return result;
else {
AnodeSystemTransport__do_close(THIS,(struct AnodeSystemTransport_AnodeSocket *)sock,ANODE_ERR_CONNECTION_CLOSED_BY_REMOTE,1);
return ANODE_ERR_CONNECTION_CLOSED;
}
} else return THIS->base->stream_send(THIS->base,sock,data,data_len);
} else return ANODE_ERR_INVALID_ARGUMENT;
}
static void AnodeSystemTransport_close(AnodeTransport *transport,
AnodeSocket *sock)
{
AnodeSystemTransport__do_close(THIS,(struct AnodeSystemTransport_AnodeSocket *)sock,0,1);
}
static void AnodeSystemTransport__poll_do_read_datagram(struct AnodeSystemTransport *transport,int fd,struct AnodeSystemTransport_AnodeSocket *sock)
{
char buf[16384];
struct sockaddr_storage fromaddr;
AnodeNetworkEndpoint tmp_ep;
AnodeEvent evbuf;
socklen_t addrlen;
int n;
addrlen = sizeof(struct sockaddr_storage);
n = recvfrom(fd,buf,sizeof(buf),0,(struct sockaddr *)&fromaddr,&addrlen);
if ((n >= 0)&&(AnodeSystemTransport__populate_network_endpoint(&fromaddr,&tmp_ep))) {
evbuf.type = ANODE_TRANSPORT_EVENT_DATAGRAM_RECEIVED;
evbuf.transport = (AnodeTransport *)transport;
evbuf.sock = (AnodeSocket *)sock;
evbuf.datagram_from = &tmp_ep;
evbuf.dns_name = NULL;
evbuf.dns_addresses = NULL;
evbuf.dns_address_count = 0;
evbuf.error_code = 0;
evbuf.data_length = n;
evbuf.data = buf;
if (sock->base.event_handler)
sock->base.event_handler(&evbuf);
else if (transport->default_event_handler)
transport->default_event_handler(&evbuf);
}
}
static void AnodeSystemTransport__poll_do_accept_incoming_connection(struct AnodeSystemTransport *transport,int fd,struct AnodeSystemTransport_AnodeSocket *sock)
{
struct sockaddr_storage fromaddr;
AnodeNetworkEndpoint tmp_ep;
AnodeEvent evbuf;
struct AnodeSystemTransport_AnodeSocket *newsock;
socklen_t addrlen;
int n;
unsigned int entry_idx;
addrlen = sizeof(struct sockaddr_storage);
n = accept(fd,(struct sockaddr *)&fromaddr,&addrlen);
if ((n >= 0)&&(AnodeSystemTransport__populate_network_endpoint(&fromaddr,&tmp_ep))) {
entry_idx = AnodeSystemTransport__add_entry(transport);
newsock = &(transport->sockets[entry_idx]);
newsock->base.type = ANODE_SOCKET_STREAM_CONNECTION;
newsock->base.state = ANODE_SOCKET_OPEN;
Anode_memcpy(&newsock->base.endpoint,&tmp_ep,sizeof(AnodeNetworkEndpoint));
newsock->base.class_name = AnodeSystemTransport_CLASS;
newsock->base.user_ptr[0] = NULL;
newsock->base.user_ptr[1] = NULL;
newsock->base.event_handler = NULL;
newsock->entry_idx = entry_idx;
THIS->fds[entry_idx].fd = n;
THIS->fds[entry_idx].events = POLLIN;
THIS->fds[entry_idx].revents = 0;
evbuf.type = ANODE_TRANSPORT_EVENT_STREAM_INCOMING_CONNECT;
evbuf.transport = (AnodeTransport *)transport;
evbuf.sock = (AnodeSocket *)newsock;
evbuf.datagram_from = NULL;
evbuf.dns_name = NULL;
evbuf.dns_addresses = NULL;
evbuf.dns_address_count = 0;
evbuf.error_code = 0;
evbuf.data_length = 0;
evbuf.data = NULL;
if (sock->base.event_handler)
sock->base.event_handler(&evbuf);
else if (transport->default_event_handler)
transport->default_event_handler(&evbuf);
}
}
static void AnodeSystemTransport__poll_do_read_stream(struct AnodeSystemTransport *transport,int fd,struct AnodeSystemTransport_AnodeSocket *sock)
{
char buf[65536];
AnodeEvent evbuf;
int n;
n = recv(fd,buf,sizeof(buf),0);
if (n > 0) {
evbuf.type = ANODE_TRANSPORT_EVENT_STREAM_DATA_RECEIVED;
evbuf.transport = (AnodeTransport *)transport;
evbuf.sock = (AnodeSocket *)sock;
evbuf.datagram_from = NULL;
evbuf.dns_name = NULL;
evbuf.dns_addresses = NULL;
evbuf.dns_address_count = 0;
evbuf.error_code = 0;
evbuf.data_length = n;
evbuf.data = buf;
if (sock->base.event_handler)
sock->base.event_handler(&evbuf);
else if (transport->default_event_handler)
transport->default_event_handler(&evbuf);
} else AnodeSystemTransport__do_close(transport,sock,ANODE_ERR_CONNECTION_CLOSED_BY_REMOTE,1);
}
static void AnodeSystemTransport__poll_do_stream_available_for_write(struct AnodeSystemTransport *transport,int fd,struct AnodeSystemTransport_AnodeSocket *sock)
{
AnodeEvent evbuf;
evbuf.type = ANODE_TRANSPORT_EVENT_STREAM_DATA_RECEIVED;
evbuf.transport = (AnodeTransport *)transport;
evbuf.sock = (AnodeSocket *)sock;
evbuf.datagram_from = NULL;
evbuf.dns_name = NULL;
evbuf.dns_addresses = NULL;
evbuf.dns_address_count = 0;
evbuf.error_code = 0;
evbuf.data_length = 0;
evbuf.data = NULL;
if (sock->base.event_handler)
sock->base.event_handler(&evbuf);
else if (transport->default_event_handler)
transport->default_event_handler(&evbuf);
}
static void AnodeSystemTransport__poll_do_outgoing_connect(struct AnodeSystemTransport *transport,int fd,struct AnodeSystemTransport_AnodeSocket *sock)
{
AnodeEvent evbuf;
int err_code;
socklen_t optlen;
optlen = sizeof(err_code);
if (getsockopt(fd,SOL_SOCKET,SO_ERROR,(void *)&err_code,&optlen)) {
/* Error getting result, so we assume a failure */
evbuf.type = ANODE_TRANSPORT_EVENT_STREAM_OUTGOING_CONNECT_FAILED;
evbuf.transport = (AnodeTransport *)transport;
evbuf.sock = (AnodeSocket *)sock;
evbuf.datagram_from = NULL;
evbuf.dns_name = NULL;
evbuf.dns_addresses = NULL;
evbuf.dns_address_count = 0;
evbuf.error_code = ANODE_ERR_CONNECT_FAILED;
evbuf.data_length = 0;
evbuf.data = NULL;
AnodeSystemTransport__do_close(transport,sock,0,0);
} else if (err_code) {
/* Error code is nonzero, so connect failed */
evbuf.type = ANODE_TRANSPORT_EVENT_STREAM_OUTGOING_CONNECT_FAILED;
evbuf.transport = (AnodeTransport *)transport;
evbuf.sock = (AnodeSocket *)sock;
evbuf.datagram_from = NULL;
evbuf.dns_name = NULL;
evbuf.dns_addresses = NULL;
evbuf.dns_address_count = 0;
evbuf.error_code = ANODE_ERR_CONNECT_FAILED;
evbuf.data_length = 0;
evbuf.data = NULL;
AnodeSystemTransport__do_close(transport,sock,0,0);
} else {
/* Connect succeeded */
evbuf.type = ANODE_TRANSPORT_EVENT_STREAM_OUTGOING_CONNECT_ESTABLISHED;
evbuf.transport = (AnodeTransport *)transport;
evbuf.sock = (AnodeSocket *)sock;
evbuf.datagram_from = NULL;
evbuf.dns_name = NULL;
evbuf.dns_addresses = NULL;
evbuf.dns_address_count = 0;
evbuf.error_code = 0;
evbuf.data_length = 0;
evbuf.data = NULL;
}
if (sock->base.event_handler)
sock->base.event_handler(&evbuf);
else if (transport->default_event_handler)
transport->default_event_handler(&evbuf);
}
static int AnodeSystemTransport_poll(AnodeTransport *transport)
{
int timeout = -1;
unsigned int fd_idx;
int event_count = 0;
int n;
if (poll((struct pollfd *)THIS->fds,THIS->fd_count,timeout) > 0) {
for(fd_idx=0;fd_idx<THIS->fd_count;++fd_idx) {
if ((THIS->fds[fd_idx].revents & (POLLERR|POLLHUP|POLLNVAL))) {
if (THIS->sockets[fd_idx].base.type == ANODE_SOCKET_STREAM_CONNECTION) {
if (THIS->sockets[fd_idx].base.state == ANODE_SOCKET_CONNECTING)
AnodeSystemTransport__poll_do_outgoing_connect(THIS,THIS->fds[fd_idx].fd,&THIS->sockets[fd_idx]);
else AnodeSystemTransport__do_close(THIS,&THIS->sockets[fd_idx],ANODE_ERR_CONNECTION_CLOSED_BY_REMOTE,1);
++event_count;
}
} else {
if ((THIS->fds[fd_idx].revents & POLLIN)) {
if (THIS->fds[fd_idx].fd == THIS->invoke_pipe[0]) {
n = read(THIS->invoke_pipe[0],&(((unsigned char *)(&(THIS->invoke_pipe_buf)))[THIS->invoke_pipe_buf_ptr]),sizeof(THIS->invoke_pipe_buf) - THIS->invoke_pipe_buf_ptr);
if (n > 0) {
THIS->invoke_pipe_buf_ptr += (unsigned int)n;
if (THIS->invoke_pipe_buf_ptr >= sizeof(THIS->invoke_pipe_buf)) {
THIS->invoke_pipe_buf_ptr -= sizeof(THIS->invoke_pipe_buf);
((void (*)(void *))(THIS->invoke_pipe_buf[1]))(THIS->invoke_pipe_buf[0]);
}
}
} else {
switch(THIS->sockets[fd_idx].base.type) {
case ANODE_SOCKET_DATAGRAM:
AnodeSystemTransport__poll_do_read_datagram(THIS,THIS->fds[fd_idx].fd,&THIS->sockets[fd_idx]);
break;
case ANODE_SOCKET_STREAM_LISTEN:
AnodeSystemTransport__poll_do_accept_incoming_connection(THIS,THIS->fds[fd_idx].fd,&THIS->sockets[fd_idx]);
break;
case ANODE_SOCKET_STREAM_CONNECTION:
if (THIS->sockets[fd_idx].base.state == ANODE_SOCKET_CONNECTING)
AnodeSystemTransport__poll_do_outgoing_connect(THIS,THIS->fds[fd_idx].fd,&THIS->sockets[fd_idx]);
else AnodeSystemTransport__poll_do_read_stream(THIS,THIS->fds[fd_idx].fd,&THIS->sockets[fd_idx]);
break;
}
++event_count;
}
}
if ((THIS->fds[fd_idx].revents & POLLOUT)) {
if (THIS->sockets[fd_idx].base.state == ANODE_SOCKET_CONNECTING)
AnodeSystemTransport__poll_do_outgoing_connect(THIS,THIS->fds[fd_idx].fd,&THIS->sockets[fd_idx]);
else AnodeSystemTransport__poll_do_stream_available_for_write(THIS,THIS->fds[fd_idx].fd,&THIS->sockets[fd_idx]);
++event_count;
}
}
}
}
return event_count;
}
static int AnodeSystemTransport_supports_address_type(const AnodeTransport *transport,
enum AnodeNetworkAddressType at)
{
switch(at) {
case ANODE_NETWORK_ADDRESS_IPV4:
return 1;
case ANODE_NETWORK_ADDRESS_IPV6:
return 1;
default:
if (THIS->base)
return THIS->base->supports_address_type(THIS->base,at);
return 0;
}
}
static AnodeTransport *AnodeSystemTransport_base_instance(const AnodeTransport *transport)
{
return THIS->base;
}
static const char *AnodeSystemTransport_class_name(AnodeTransport *transport)
{
return AnodeSystemTransport_CLASS;
}
static void AnodeSystemTransport_delete(AnodeTransport *transport)
{
close(THIS->invoke_pipe[0]);
close(THIS->invoke_pipe[1]);
AnodeMutex_destroy(&THIS->invoke_pipe_m);
if (THIS->fds) free(THIS->fds);
if (THIS->sockets) free(THIS->sockets);
if (THIS->base) THIS->base->delete(THIS->base);
free(transport);
}
/* ======================================================================== */
AnodeTransport *AnodeSystemTransport_new(AnodeTransport *base)
{
struct AnodeSystemTransport *t;
unsigned int entry_idx;
t = malloc(sizeof(struct AnodeSystemTransport));
if (!t) return (AnodeTransport *)0;
Anode_zero(t,sizeof(struct AnodeSystemTransport));
t->interface.invoke = &AnodeSystemTransport_invoke;
t->interface.dns_resolve = &AnodeSystemTransport_dns_resolve;
t->interface.datagram_listen = &AnodeSystemTransport_datagram_listen;
t->interface.stream_listen = &AnodeSystemTransport_stream_listen;
t->interface.datagram_send = &AnodeSystemTransport_datagram_send;
t->interface.stream_connect = &AnodeSystemTransport_stream_connect;
t->interface.stream_start_writing = &AnodeSystemTransport_stream_start_writing;
t->interface.stream_stop_writing = &AnodeSystemTransport_stream_stop_writing;
t->interface.stream_send = &AnodeSystemTransport_stream_send;
t->interface.close = &AnodeSystemTransport_close;
t->interface.poll = &AnodeSystemTransport_poll;
t->interface.supports_address_type = &AnodeSystemTransport_supports_address_type;
t->interface.base_instance = &AnodeSystemTransport_base_instance;
t->interface.class_name = &AnodeSystemTransport_class_name;
t->interface.delete = &AnodeSystemTransport_delete;
t->base = base;
pipe(t->invoke_pipe);
fcntl(t->invoke_pipe[0],F_SETFL,O_NONBLOCK);
entry_idx = AnodeSystemTransport__add_entry(t);
t->fds[entry_idx].fd = t->invoke_pipe[0];
t->fds[entry_idx].events = POLLIN;
t->fds[entry_idx].revents = 0;
AnodeMutex_init(&t->invoke_pipe_m);
return (AnodeTransport *)t;
}

25
attic/historic/anode/libanode/tests/Makefile Normal file
View File

@ -0,0 +1,25 @@
all: force clean anode-utils-test anode-zone-test aes-test ec-test
aes-test:
gcc -Wall -O6 -ftree-vectorize -std=c99 -o aes-test aes-test.c ../aes_digest.c -lcrypto
http_client-test:
gcc -O0 -g -std=c99 -o http_client-test http_client-test.c ../anode-utils.c ../misc.c ../http_client.c ../dictionary.c ../iptransport.c ../anode-transport.c -lcrypto
anode-utils-test:
gcc -O0 -g -std=c99 -o anode-utils-test anode-utils-test.c ../anode-utils.c ../misc.c
ec-test:
gcc -O0 -g -std=c99 -o ec-test ec-test.c ../impl/ec.c ../impl/misc.c -lcrypto
anode-zone-test:
gcc -O0 -g -std=c99 -o anode-zone-test anode-zone-test.c ../anode-zone.c ../http_client.c ../dictionary.c ../misc.c ../anode-transport.c ../iptransport.c ../environment.c
system_transport-test:
gcc -O0 -g -std=c99 -o system_transport-test system_transport-test.c ../system_transport.c ../network_address.c ../address.c ../aes_digest.c ../impl/misc.c ../impl/thread.c ../impl/dns_txt.c ../impl/aes.c -lresolv -lcrypto
clean: force
rm -rf *.dSYM
rm -f http_client-test anode-utils-test anode-zone-test ec-test aes-test system_transport-test
force: ;

191
attic/historic/anode/libanode/tests/aes-test.c Normal file
View File

@ -0,0 +1,191 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <time.h>
#include <sys/time.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "../impl/aes.h"
#include "../anode.h"
static const unsigned char AES_TEST_KEY[32] = {
0x08,0x09,0x0A,0x0B,0x0D,0x0E,0x0F,0x10,0x12,0x13,0x14,0x15,0x17,0x18,0x19,0x1A,
0x1C,0x1D,0x1E,0x1F,0x21,0x22,0x23,0x24,0x26,0x27,0x28,0x29,0x2B,0x2C,0x2D,0x2E
};
static const unsigned char AES_TEST_IN[16] = {
0x06,0x9A,0x00,0x7F,0xC7,0x6A,0x45,0x9F,0x98,0xBA,0xF9,0x17,0xFE,0xDF,0x95,0x21
};
static const unsigned char AES_TEST_OUT[16] = {
0x08,0x0e,0x95,0x17,0xeb,0x16,0x77,0x71,0x9a,0xcf,0x72,0x80,0x86,0x04,0x0a,0xe3
};
static const unsigned char CMAC_TEST_KEY[32] = {
0x60,0x3d,0xeb,0x10,0x15,0xca,0x71,0xbe,0x2b,0x73,0xae,0xf0,0x85,0x7d,0x77,0x81,
0x1f,0x35,0x2c,0x07,0x3b,0x61,0x08,0xd7,0x2d,0x98,0x10,0xa3,0x09,0x14,0xdf,0xf4
};
static const unsigned char CMAC_TEST1_OUT[16] = {
0x02,0x89,0x62,0xf6,0x1b,0x7b,0xf8,0x9e,0xfc,0x6b,0x55,0x1f,0x46,0x67,0xd9,0x83
};
static const unsigned char CMAC_TEST2_IN[16] = {
0x6b,0xc1,0xbe,0xe2,0x2e,0x40,0x9f,0x96,0xe9,0x3d,0x7e,0x11,0x73,0x93,0x17,0x2a
};
static const unsigned char CMAC_TEST2_OUT[16] = {
0x28,0xa7,0x02,0x3f,0x45,0x2e,0x8f,0x82,0xbd,0x4b,0xf2,0x8d,0x8c,0x37,0xc3,0x5c
};
static const unsigned char CMAC_TEST3_IN[40] = {
0x6b,0xc1,0xbe,0xe2,0x2e,0x40,0x9f,0x96,0xe9,0x3d,0x7e,0x11,0x73,0x93,0x17,0x2a,
0xae,0x2d,0x8a,0x57,0x1e,0x03,0xac,0x9c,0x9e,0xb7,0x6f,0xac,0x45,0xaf,0x8e,0x51,
0x30,0xc8,0x1c,0x46,0xa3,0x5c,0xe4,0x11
};
static const unsigned char CMAC_TEST3_OUT[16] = {
0xaa,0xf3,0xd8,0xf1,0xde,0x56,0x40,0xc2,0x32,0xf5,0xb1,0x69,0xb9,0xc9,0x11,0xe6
};
static const unsigned char CMAC_TEST4_IN[64] = {
0x6b,0xc1,0xbe,0xe2,0x2e,0x40,0x9f,0x96,0xe9,0x3d,0x7e,0x11,0x73,0x93,0x17,0x2a,
0xae,0x2d,0x8a,0x57,0x1e,0x03,0xac,0x9c,0x9e,0xb7,0x6f,0xac,0x45,0xaf,0x8e,0x51,
0x30,0xc8,0x1c,0x46,0xa3,0x5c,0xe4,0x11,0xe5,0xfb,0xc1,0x19,0x1a,0x0a,0x52,0xef,
0xf6,0x9f,0x24,0x45,0xdf,0x4f,0x9b,0x17,0xad,0x2b,0x41,0x7b,0xe6,0x6c,0x37,0x10
};
static const unsigned char CMAC_TEST4_OUT[16] = {
0xe1,0x99,0x21,0x90,0x54,0x9f,0x6e,0xd5,0x69,0x6a,0x2c,0x05,0x6c,0x31,0x54,0x10
};
static void test_cmac(const AnodeAesExpandedKey *expkey,const unsigned char *in,unsigned int inlen,const unsigned char *expected)
{
unsigned int i;
unsigned char out[16];
printf("Testing CMAC with %u byte input:\n",inlen);
printf(" IN: ");
for(i=0;i<inlen;++i)
printf("%.2x",(int)in[i]);
printf("\n");
printf(" EXP: ");
for(i=0;i<16;++i)
printf("%.2x",(int)expected[i]);
printf("\n");
Anode_cmac_aes256(expkey,in,inlen,out);
printf(" OUT: ");
for(i=0;i<16;++i)
printf("%.2x",(int)out[i]);
printf("\n");
if (memcmp(expected,out,16)) {
printf("FAILED!\n");
exit(1);
} else printf("Passed.\n");
}
static void test_cfb(const AnodeAesExpandedKey *expkey,const unsigned char *in,unsigned int inlen,unsigned char *iv,const unsigned char *expected)
{
unsigned char tmp[131072];
unsigned char tmp2[131072];
unsigned char tmpiv[16];
printf("Testing AES-256 CFB mode with %u bytes: ",inlen);
fflush(stdout);
memcpy(tmpiv,iv,16);
Anode_aes256_cfb_encrypt(expkey,in,tmp,tmpiv,inlen);
if (!memcmp(tmp,expected,inlen)) {
printf("FAILED (didn't encrypt)!\n");
exit(1);
}
memcpy(tmpiv,iv,16);
Anode_aes256_cfb_decrypt(expkey,tmp,tmp2,tmpiv,inlen);
if (memcmp(tmp2,expected,inlen)) {
printf("FAILED (didn't encrypt)!\n");
exit(1);
} else printf("Passed.\n");
}
static const char *AES_DIGEST_TEST_1 = "test";
static const char *AES_DIGEST_TEST_2 = "supercalifragilisticexpealidocious";
static const char *AES_DIGEST_TEST_3 = "12345678";
static const char *AES_DIGEST_TEST_4 = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa";
int main(int argc,char **argv)
{
AnodeAesExpandedKey expkey;
unsigned int i;
unsigned char aestestbuf[16];
unsigned char cfbin[131072];
unsigned char iv[16];
printf("Testing AES-256:");
Anode_aes256_expand_key(AES_TEST_KEY,&expkey);
printf(" IN: ");
for(i=0;i<16;++i)
printf("%.2x",(int)AES_TEST_IN[i]);
printf("\n");
printf(" EXP: ");
for(i=0;i<16;++i)
printf("%.2x",(int)AES_TEST_OUT[i]);
printf("\n");
Anode_aes256_encrypt(&expkey,AES_TEST_IN,aestestbuf);
printf(" OUT: ");
for(i=0;i<16;++i)
printf("%.2x",(int)aestestbuf[i]);
printf("\n");
if (memcmp(AES_TEST_OUT,aestestbuf,16)) {
printf("FAILED!\n");
return 1;
} else printf("Passed.\n");
printf("\n");
Anode_aes256_expand_key(CMAC_TEST_KEY,&expkey);
test_cmac(&expkey,(unsigned char *)0,0,CMAC_TEST1_OUT);
test_cmac(&expkey,CMAC_TEST2_IN,16,CMAC_TEST2_OUT);
test_cmac(&expkey,CMAC_TEST3_IN,40,CMAC_TEST3_OUT);
test_cmac(&expkey,CMAC_TEST4_IN,64,CMAC_TEST4_OUT);
printf("\n");
for(i=0;i<131072;++i)
cfbin[i] = (unsigned char)(i & 0xff);
for(i=0;i<16;++i)
iv[i] = (unsigned char)(i & 0xff);
for(i=12345;i<131072;i+=7777)
test_cfb(&expkey,cfbin,i,iv,cfbin);
printf("\nTesting AES-DIGEST...\n");
printf("0 bytes: ");
Anode_aes_digest(cfbin,0,iv);
for(i=0;i<16;++i) printf("%.2x",(unsigned int)iv[i]);
printf("\n");
printf("%d bytes: ",(int)strlen(AES_DIGEST_TEST_1));
Anode_aes_digest(AES_DIGEST_TEST_1,strlen(AES_DIGEST_TEST_1),iv);
for(i=0;i<16;++i) printf("%.2x",(unsigned int)iv[i]);
printf("\n");
printf("%d bytes: ",(int)strlen(AES_DIGEST_TEST_2));
Anode_aes_digest(AES_DIGEST_TEST_2,strlen(AES_DIGEST_TEST_2),iv);
for(i=0;i<16;++i) printf("%.2x",(unsigned int)iv[i]);
printf("\n");
printf("%d bytes: ",(int)strlen(AES_DIGEST_TEST_3));
Anode_aes_digest(AES_DIGEST_TEST_3,strlen(AES_DIGEST_TEST_3),iv);
for(i=0;i<16;++i) printf("%.2x",(unsigned int)iv[i]);
printf("\n");
printf("%d bytes: ",(int)strlen(AES_DIGEST_TEST_4));
Anode_aes_digest(AES_DIGEST_TEST_4,strlen(AES_DIGEST_TEST_4),iv);
for(i=0;i<16;++i) printf("%.2x",(unsigned int)iv[i]);
printf("\n");
return 0;
}

38
attic/historic/anode/libanode/tests/anode-secure_random-test.c Normal file
View File

@ -0,0 +1,38 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdlib.h>
#include <stdio.h>
#include "../anode.h"
#include "../misc.h"
int main(int argc,char **argv)
{
unsigned char test[10005];
unsigned int i;
AnodeSecureRandom srng;
AnodeSecureRandom_init(&srng);
AnodeSecureRandom_gen_bytes(&srng,test,sizeof(test));
for(i=0;i<sizeof(test);++i) {
printf("%.2x",(unsigned int)test[i]);
if ((i % 20) == 19)
printf("\n");
}
printf("\n");
}

75
attic/historic/anode/libanode/tests/anode-utils-test.c Normal file
View File

@ -0,0 +1,75 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdlib.h>
#include <stdio.h>
#include "../anode.h"
#include "../misc.h"
static const char *testuris[22] = {
"http://www.test.com",
"http://www.test.com/",
"http://www.test.com/path/to/something",
"http://user@www.test.com",
"http://user@www.test.com/path/to/something",
"http://user:password@www.test.com/path/to/something",
"http://www.test.com/path/to/something?query=foo&bar=baz",
"http://www.test.com/path/to/something#fragment",
"http://www.test.com/path/to/something?query=foo&bar=baz#fragment",
"http://user:password@www.test.com/path/to/something#fragment",
"http://user:password@www.test.com/path/to/something?query=foo&bar=baz#fragment",
"http://@www.test.com/",
"http://:@www.test.com/",
"http://www.test.com:8080/path/to/something",
"http://user:password@www.test.com:8080/path/to/something?query=foo#fragment",
"http://",
"http://www.test.com/path/to/something?#",
"http://www.test.com/path/to/something?#fragment",
"http:",
"http",
"mailto:this_is_a_urn@somedomain.com",
""
};
int main(int argc,char **argv)
{
int i,r;
char reconstbuf[2048];
char *reconst;
AnodeURI uri;
for(i=0;i<22;++i) {
printf("\"%s\":\n",testuris[i]);
r = AnodeURI_parse(&uri,testuris[i]);
if (r) {
printf(" error: %d\n",r);
} else {
printf(" scheme: %s\n",uri.scheme);
printf(" username: %s\n",uri.username);
printf(" password: %s\n",uri.password);
printf(" host: %s\n",uri.host);
printf(" port: %d\n",uri.port);
printf(" path: %s\n",uri.path);
printf(" query: %s\n",uri.query);
printf(" fragment: %s\n",uri.fragment);
}
reconst = AnodeURI_to_string(&uri,reconstbuf,sizeof(reconstbuf));
printf("Reconstituted URI: %s\n",reconst ? reconst : "(null)");
printf("\n");
}
return 0;
}

47
attic/historic/anode/libanode/tests/anode-zone-test.c Normal file
View File

@ -0,0 +1,47 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "../anode.h"
#include "../dictionary.h"
static int got_it = 0;
static void zone_lookup_handler(void *ptr,long zone_id,AnodeZone *zone)
{
if (zone)
printf("got %.8lx: %d entries\n",(unsigned long)zone_id & 0xffffffff,((struct AnodeDictionary *)zone)->size);
else printf("failed.\n");
got_it = 1;
}
int main(int argc,char **argv)
{
AnodeTransportEngine transport;
Anode_init_ip_transport_engine(&transport);
AnodeZone_lookup(&transport,0,0,&zone_lookup_handler);
while (!got_it)
transport.poll(&transport);
transport.destroy(&transport);
return 0;
}

149
attic/historic/anode/libanode/tests/dictionary-test.c Normal file
View File

@ -0,0 +1,149 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <sys/time.h>
#include "../dictionary.h"
static const char *HASH_TESTS[16] = {
"test",
"testt",
"",
"foo",
"fooo",
"1",
"2",
"3",
"4",
"11",
"22",
"33",
"44",
"adklfjklejrer",
"erngnetbekjrq",
"erklerqqqqre"
};
int diterate(void *arg,const char *key,const char *value)
{
printf(" %s: %s\n",key ? key : "(null)",value ? value : "(null)");
return 1;
}
int main(int argc,char **argv)
{
char tmp[1024];
char fuzzparam1[16],fuzzparam2[16],fuzzparam3[16];
struct AnodeDictionary d;
unsigned int i,j,k,cs;
srandom(time(0));
printf("Trying out hash function a little...\n");
for(i=0;i<16;++i)
printf(" %s: %u\n",HASH_TESTS[i],(unsigned int)AnodeDictionary__get_bucket(HASH_TESTS[i]));
for(cs=0;cs<2;++cs) {
printf("\nTesting with case sensitivity = %d\n",cs);
AnodeDictionary_init(&d,cs);
printf("\nTesting dictionary by adding and retrieving some keys...\n");
AnodeDictionary_put(&d,"test1","This is the first test");
AnodeDictionary_put(&d,"test2","This is the second test");
AnodeDictionary_put(&d,"test3","This is the third test (lower case)");
AnodeDictionary_put(&d,"TEST3","This is the third test (UPPER CASE)");
AnodeDictionary_iterate(&d,(void *)0,&diterate);
if (d.size != (cs ? 4 : 3)) {
printf("Failed (size).\n");
return 1;
}
AnodeDictionary_clear(&d);
if (d.size||(AnodeDictionary_get(&d,"test1"))) {
printf("Failed (clear).\n");
return 1;
}
printf("\nTesting read, trial 1: simple key=value with unterminated line\n");
strcpy(tmp,"foo=bar\nbar=baz\ntest1=Happy happy joyjoy!\ntest2=foobarbaz\nlinewithnocr=thisworked");
AnodeDictionary_read(&d,tmp,"\r\n","=","",'\\',0,0);
printf("Results:\n");
AnodeDictionary_iterate(&d,(void *)0,&diterate);
AnodeDictionary_clear(&d);
printf("\nTesting read, trial 2: key=value with escape chars, escaped CRs\n");
strcpy(tmp,"foo=bar\r\nbar==baz\nte\\=st1=\\=Happy happy joyjoy!\ntest2=foobarbaz\\\nfoobarbaz on next line\r\n");
AnodeDictionary_read(&d,tmp,"\r\n","=","",'\\',0,0);
printf("Results:\n");
AnodeDictionary_iterate(&d,(void *)0,&diterate);
AnodeDictionary_clear(&d);
printf("\nTesting read, trial 3: HTTP header-like dictionary\n");
strcpy(tmp,"Host: some.host.net\r\nX-Some-Header: foo bar\r\nX-Some-Other-Header: y0y0y0y0y0\r\n");
AnodeDictionary_read(&d,tmp,"\r\n",": ","",0,0,0);
printf("Results:\n");
AnodeDictionary_iterate(&d,(void *)0,&diterate);
AnodeDictionary_clear(&d);
printf("\nTesting read, trial 4: single line key/value\n");
strcpy(tmp,"Header: one line only");
AnodeDictionary_read(&d,tmp,"\r\n",": ","",0,0,0);
printf("Results:\n");
AnodeDictionary_iterate(&d,(void *)0,&diterate);
AnodeDictionary_clear(&d);
printf("\nFuzzing dictionary reader...\n"); fflush(stdout);
for(i=0;i<200000;++i) {
j = random() % (sizeof(tmp) - 1);
for(k=0;k<j;++k) {
tmp[k] = (char)((unsigned int)random() >> 3);
if (!tmp[k]) tmp[k] = 1;
}
tmp[j] = (char)0;
j = random() % (sizeof(fuzzparam1) - 1);
for(k=0;k<j;++k) {
fuzzparam1[k] = (char)((unsigned int)random() >> 3);
if (!fuzzparam1[k]) fuzzparam1[k] = 1;
}
fuzzparam1[j] = (char)0;
j = random() % (sizeof(fuzzparam2) - 1);
for(k=0;k<j;++k) {
fuzzparam1[k] = (char)((unsigned int)random() >> 3);
if (!fuzzparam2[k]) fuzzparam2[k] = 1;
}
fuzzparam2[j] = (char)0;
j = random() % (sizeof(fuzzparam3) - 1);
for(k=0;k<j;++k) {
fuzzparam3[k] = (char)((unsigned int)random() >> 3);
if (!fuzzparam3[k]) fuzzparam3[k] = 1;
}
fuzzparam3[j] = (char)0;
AnodeDictionary_read(&d,tmp,fuzzparam1,fuzzparam2,fuzzparam3,random() & 3,random() & 1,random() & 1);
AnodeDictionary_clear(&d);
}
AnodeDictionary_destroy(&d);
}
return 0;
}

97
attic/historic/anode/libanode/tests/ec-test.c Normal file
View File

@ -0,0 +1,97 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "../impl/ec.h"
#include "../impl/misc.h"
#define TEST_KEY_LEN 128
#define AnodeEC_key_to_hex(k,b,l) Anode_to_hex((k)->key,(k)->bytes,(b),l)
int main(int argc,char **argv)
{
struct AnodeECKeyPair pair1;
struct AnodeECKeyPair pair2;
struct AnodeECKeyPair pair3;
unsigned char key[TEST_KEY_LEN];
char str[16384];
printf("Creating key pair #1...\n");
if (!AnodeECKeyPair_generate(&pair1)) {
printf("Could not create key pair.\n");
return 1;
}
AnodeEC_key_to_hex(&pair1.pub,str,sizeof(str));
printf("Public: %s\n",str);
AnodeEC_key_to_hex(&pair1.priv,str,sizeof(str));
printf("Private: %s\n\n",str);
printf("Creating key pair #2...\n");
if (!AnodeECKeyPair_generate(&pair2)) {
printf("Could not create key pair.\n");
return 1;
}
AnodeEC_key_to_hex(&pair2.pub,str,sizeof(str));
printf("Public: %s\n",str);
AnodeEC_key_to_hex(&pair2.priv,str,sizeof(str));
printf("Private: %s\n\n",str);
printf("Key agreement between public #2 and private #1...\n");
if (!AnodeECKeyPair_agree(&pair1,&pair2.pub,key,TEST_KEY_LEN)) {
printf("Agreement failed.\n");
return 1;
}
Anode_to_hex(key,TEST_KEY_LEN,str,sizeof(str));
printf("Agreed secret: %s\n\n",str);
printf("Key agreement between public #1 and private #2...\n");
if (!AnodeECKeyPair_agree(&pair2,&pair1.pub,key,TEST_KEY_LEN)) {
printf("Agreement failed.\n");
return 1;
}
Anode_to_hex(key,TEST_KEY_LEN,str,sizeof(str));
printf("Agreed secret: %s\n\n",str);
printf("Testing key pair init function (init #3 from #2's parts)...\n");
if (!AnodeECKeyPair_init(&pair3,&(pair2.pub),&(pair2.priv))) {
printf("Init failed.\n");
return 1;
}
printf("Key agreement between public #1 and private #3...\n");
if (!AnodeECKeyPair_agree(&pair3,&pair1.pub,key,TEST_KEY_LEN)) {
printf("Agreement failed.\n");
return 1;
}
Anode_to_hex(key,TEST_KEY_LEN,str,sizeof(str));
printf("Agreed secret: %s\n\n",str);
printf("Key agreement between public #1 and private #1...\n");
if (!AnodeECKeyPair_agree(&pair1,&pair1.pub,key,TEST_KEY_LEN)) {
printf("Agreement failed.\n");
return 1;
}
Anode_to_hex(key,TEST_KEY_LEN,str,sizeof(str));
printf("Agreed secret (should not match): %s\n\n",str);
AnodeECKeyPair_destroy(&pair1);
AnodeECKeyPair_destroy(&pair2);
AnodeECKeyPair_destroy(&pair3);
return 0;
}

28
attic/historic/anode/libanode/tests/environment-test.c Normal file
View File

@ -0,0 +1,28 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <stdlib.h>
#include "../environment.h"
int main(int argc,char **argv)
{
const char *cache = Anode_get_cache();
printf("Cache folder: %s\n",cache ? cache : "(null)");
return 0;
}

233
attic/historic/anode/libanode/tests/http_client-test.c Normal file
View File

@ -0,0 +1,233 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <openssl/sha.h>
#include "../anode.h"
#include "../misc.h"
#include "../http_client.h"
#include "../dictionary.h"
struct TestCase
{
int method;
AnodeURI uri;
const void *client_data;
unsigned int client_data_len;
const char *expected_sha1;
char actual_sha1[64];
int got_it;
int keepalive;
struct TestCase *next;
};
#define NUM_TEST_CASES 7
static struct TestCase test_cases[NUM_TEST_CASES];
static void init_test_cases(int keepalive)
{
AnodeURI_parse(&(test_cases[0].uri),"http://zerotier.com/for_unit_tests/test1.txt");
test_cases[0].method = ANODE_HTTP_GET;
test_cases[0].client_data_len = 0;
test_cases[0].expected_sha1 = "0828324174b10cc867b7255a84a8155cf89e1b8b";
test_cases[0].actual_sha1[0] = (char)0;
test_cases[0].got_it = 0;
test_cases[0].keepalive = keepalive;
test_cases[0].next = &(test_cases[1]);
AnodeURI_parse(&(test_cases[1].uri),"http://zerotier.com/for_unit_tests/test2.bin");
test_cases[1].method = ANODE_HTTP_GET;
test_cases[1].client_data_len = 0;
test_cases[1].expected_sha1 = "6b67c635786ab52666211d02412c0d0f0372980d";
test_cases[1].actual_sha1[0] = (char)0;
test_cases[1].got_it = 0;
test_cases[1].keepalive = keepalive;
test_cases[1].next = &(test_cases[2]);
AnodeURI_parse(&(test_cases[2].uri),"http://zerotier.com/for_unit_tests/test3.bin");
test_cases[2].method = ANODE_HTTP_GET;
test_cases[2].client_data_len = 0;
test_cases[2].expected_sha1 = "efa7722029fdbb6abd0e3ed32a0b44bfb982cff0";
test_cases[2].actual_sha1[0] = (char)0;
test_cases[2].got_it = 0;
test_cases[2].keepalive = keepalive;
test_cases[2].next = &(test_cases[3]);
AnodeURI_parse(&(test_cases[3].uri),"http://zerotier.com/for_unit_tests/test4.bin");
test_cases[3].method = ANODE_HTTP_GET;
test_cases[3].client_data_len = 0;
test_cases[3].expected_sha1 = "da39a3ee5e6b4b0d3255bfef95601890afd80709";
test_cases[3].actual_sha1[0] = (char)0;
test_cases[3].got_it = 0;
test_cases[3].keepalive = keepalive;
test_cases[3].next = &(test_cases[4]);
AnodeURI_parse(&(test_cases[4].uri),"http://zerotier.com/for_unit_tests/echo.php?echo=foobar");
test_cases[4].method = ANODE_HTTP_GET;
test_cases[4].client_data_len = 0;
test_cases[4].expected_sha1 = "8843d7f92416211de9ebb963ff4ce28125932878";
test_cases[4].actual_sha1[0] = (char)0;
test_cases[4].got_it = 0;
test_cases[4].keepalive = keepalive;
test_cases[4].next = &(test_cases[5]);
AnodeURI_parse(&(test_cases[5].uri),"http://zerotier.com/for_unit_tests/echo.php");
test_cases[5].method = ANODE_HTTP_POST;
test_cases[5].client_data = "echo=foobar";
test_cases[5].client_data_len = strlen((char *)test_cases[5].client_data);
test_cases[5].expected_sha1 = "8843d7f92416211de9ebb963ff4ce28125932878";
test_cases[5].actual_sha1[0] = (char)0;
test_cases[5].got_it = 0;
test_cases[5].keepalive = keepalive;
test_cases[5].next = &(test_cases[6]);
AnodeURI_parse(&(test_cases[6].uri),"http://zerotier.com/for_unit_tests/test3.bin");
test_cases[6].method = ANODE_HTTP_HEAD;
test_cases[6].client_data_len = 0;
test_cases[6].expected_sha1 = "da39a3ee5e6b4b0d3255bfef95601890afd80709";
test_cases[6].actual_sha1[0] = (char)0;
test_cases[6].got_it = 0;
test_cases[6].keepalive = keepalive;
test_cases[6].next = 0;
}
static int http_handler_dump_headers(void *arg,const char *key,const char *value)
{
printf(" H %s: %s\n",key,value);
return 1;
}
static void http_handler(struct AnodeHttpClient *client)
{
const char *method = "???";
char buf[1024];
unsigned char sha[20];
struct TestCase *test = (struct TestCase *)client->ptr[0];
switch(client->method) {
case ANODE_HTTP_GET:
method = "GET";
break;
case ANODE_HTTP_HEAD:
method = "HEAD";
break;
case ANODE_HTTP_POST:
method = "POST";
break;
}
if (client->response.code == 200) {
SHA1((unsigned char *)client->response.data,client->response.data_length,sha);
Anode_to_hex(sha,20,test->actual_sha1,sizeof(test->actual_sha1));
printf("%s %s\n * SHA1: %s exp: %s\n",method,AnodeURI_to_string(&(test->uri),buf,sizeof(buf)),test->actual_sha1,test->expected_sha1);
if (strcmp(test->actual_sha1,test->expected_sha1))
printf(" ! SHA1 MISMATCH!\n");
AnodeDictionary_iterate(&(client->response.headers),0,&http_handler_dump_headers);
} else printf("%s %s: ERROR: %d\n",method,AnodeURI_to_string(&(test->uri),buf,sizeof(buf)),client->response.code);
test->got_it = 1;
if (!test->keepalive)
AnodeHttpClient_free(client);
else {
test = test->next;
if (test) {
memcpy((void *)&(client->uri),(const void *)&(test->uri),sizeof(AnodeURI));
client->data = test->client_data;
client->data_length = test->client_data_len;
client->ptr[0] = test;
client->keepalive = test->keepalive;
client->method = test->method;
client->handler = &http_handler;
AnodeHttpClient_send(client);
} else {
AnodeHttpClient_free(client);
}
}
}
int main(int argc,char **argv)
{
struct AnodeHttpClient *client;
AnodeTransportEngine transport_engine;
int i;
if (Anode_init_ip_transport_engine(&transport_engine)) {
printf("Failed (transport engine init)\n");
return 1;
}
printf("Testing without keepalive...\n\n");
init_test_cases(0);
for(i=0;i<NUM_TEST_CASES;++i) {
client = AnodeHttpClient_new(&transport_engine);
memcpy((void *)&(client->uri),(const void *)&(test_cases[i].uri),sizeof(AnodeURI));
client->data = test_cases[i].client_data;
client->data_length = test_cases[i].client_data_len;
client->ptr[0] = &test_cases[i];
client->keepalive = test_cases[i].keepalive;
client->method = test_cases[i].method;
client->handler = &http_handler;
AnodeHttpClient_send(client);
}
for(;;) {
for(i=0;i<NUM_TEST_CASES;++i) {
if (!test_cases[i].got_it)
break;
}
if (i == NUM_TEST_CASES)
break;
transport_engine.poll(&transport_engine);
}
printf("\n\n");
printf("Testing with keepalive...\n\n");
init_test_cases(1);
client = AnodeHttpClient_new(&transport_engine);
i = 0;
memcpy((void *)&(client->uri),(const void *)&(test_cases[i].uri),sizeof(AnodeURI));
client->data = test_cases[i].client_data;
client->data_length = test_cases[i].client_data_len;
client->ptr[0] = &test_cases[i];
client->keepalive = test_cases[i].keepalive;
client->method = test_cases[i].method;
client->handler = &http_handler;
AnodeHttpClient_send(client);
for(;;) {
for(i=0;i<NUM_TEST_CASES;++i) {
if (!test_cases[i].got_it)
break;
}
if (i == NUM_TEST_CASES)
break;
transport_engine.poll(&transport_engine);
}
transport_engine.destroy(&transport_engine);
return 0;
}

137
attic/historic/anode/libanode/tests/misc-test.c Normal file
View File

@ -0,0 +1,137 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <sys/time.h>
#include "../misc.h"
int main(int argc,char **argv)
{
const char *base32TestStr = "asdf";
char *fields[16];
char buf[1024];
char buf2[1024];
char buf3[4096];
unsigned int i;
unsigned long tmpl,tmpl2;
unsigned long long tmp64;
srand(time(0));
Anode_base32_5_to_8((const unsigned char *)base32TestStr,buf);
printf("Base32 from test string: %s\n",buf);
Anode_base32_8_to_5("MFZWIZQA",(unsigned char *)buf2);
printf("Test string from Base32 (upper case): %s\n",buf2);
Anode_base32_8_to_5("mfzwizqa",(unsigned char *)buf2);
printf("Test string from Base32 (lower case): %s\n",buf2);
printf("Testing variable length encoding/decoded with pad5 functions...\n");
for(i=0;i<1024;++i) {
tmpl = rand() % (sizeof(buf) - 8);
if (!tmpl)
tmpl = 1;
for(tmpl2=0;tmpl2<tmpl;++tmpl2)
buf[tmpl2] = (buf2[tmpl2] = (char)(rand() >> 3));
if (!Anode_base32_encode_pad5(buf2,tmpl,buf3,sizeof(buf3))) {
printf("Failed (encode failed).\n");
return 1;
}
memset(buf2,0,sizeof(buf2));
if (!Anode_base32_decode_pad5(buf3,buf2,sizeof(buf2))) {
printf("Failed (decode failed).\n");
return 1;
}
if (memcmp(buf,buf2,tmpl)) {
printf("Failed (compare failed).\n");
return 1;
}
}
printf("Anode_htonll(0x0102030405060708) == 0x%.16llx\n",tmp64 = Anode_htonll(0x0102030405060708ULL));
printf("Anode_ntohll(0x%.16llx) == 0x%.16llx\n",tmp64,Anode_ntohll(tmp64));
if (Anode_ntohll(tmp64) != 0x0102030405060708ULL) {
printf("Failed.\n");
return 1;
}
strcpy(buf,"foo bar baz");
Anode_trim(buf);
printf("Testing string trim: 'foo bar baz' -> '%s'\n",buf);
strcpy(buf,"foo bar baz ");
Anode_trim(buf);
printf("Testing string trim: 'foo bar baz ' -> '%s'\n",buf);
strcpy(buf," foo bar baz");
Anode_trim(buf);
printf("Testing string trim: ' foo bar baz' -> '%s'\n",buf);
strcpy(buf," foo bar baz ");
Anode_trim(buf);
printf("Testing string trim: ' foo bar baz ' -> '%s'\n",buf);
strcpy(buf,"");
Anode_trim(buf);
printf("Testing string trim: '' -> '%s'\n",buf);
strcpy(buf," ");
Anode_trim(buf);
printf("Testing string trim: ' ' -> '%s'\n",buf);
printf("Testing string split.\n");
strcpy(buf,"66.246.138.121,5323,0");
i = Anode_split(buf,';',fields,16);
if (i != 1) {
printf("Failed.\n");
return 1;
} else printf("Fields: %s\n",fields[0]);
strcpy(buf,"a;b;c");
i = Anode_split(buf,';',fields,16);
if (i != 3) {
printf("Failed.\n");
return 1;
} else printf("Fields: %s %s %s\n",fields[0],fields[1],fields[2]);
strcpy(buf,";;");
i = Anode_split(buf,';',fields,16);
if (i != 3) {
printf("Failed.\n");
return 1;
} else printf("Fields: %s %s %s\n",fields[0],fields[1],fields[2]);
strcpy(buf,"a;b;");
i = Anode_split(buf,';',fields,16);
if (i != 3) {
printf("Failed.\n");
return 1;
} else printf("Fields: %s %s %s\n",fields[0],fields[1],fields[2]);
strcpy(buf,"a;;c");
i = Anode_split(buf,';',fields,16);
if (i != 3) {
printf("Failed.\n");
return 1;
} else printf("Fields: %s %s %s\n",fields[0],fields[1],fields[2]);
strcpy(buf,";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;");
i = Anode_split(buf,';',fields,16);
if (i != 16) {
printf("Failed.\n");
return 1;
}
strcpy(buf,"");
i = Anode_split(buf,';',fields,16);
if (i != 0) {
printf("Failed.\n");
return 1;
}
printf("Passed.\n");
return 0;
}

70
attic/historic/anode/libanode/tests/system_transport-test.c Normal file
View File

@ -0,0 +1,70 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <sys/socket.h>
#include "../anode.h"
#include "../impl/thread.h"
static int do_client()
{
AnodeTransport *st;
AnodeSocket *udp_sock;
int run = 1;
st = AnodeSystemTransport_new(NULL);
if (!st) {
printf("FAILED: unable to construct AnodeSystemTransport.\n");
return -1;
}
printf("Created AnodeSystemTransport.\n");
while (run)
st->poll(st);
}
static int do_server()
{
AnodeTransport *st;
AnodeSocket *udp_sock;
AnodeSocket *tcp_sock;
int run = 1;
st = AnodeSystemTransport_new(NULL);
if (!st) {
printf("FAILED: unable to construct AnodeSystemTransport.\n");
return -1;
}
printf("Created AnodeSystemTransport.\n");
while (run)
st->poll(st);
}
int main(int argc,char **argv)
{
if (argc == 2) {
if (!strcmp(argv[1],"client"))
return do_client();
else if (!strcmp(argv[1],"server"))
return do_server();
}
printf("Usage: system_transport-test <client / server>\n");
return -1;
}

185
attic/historic/anode/libanode/uri.c Normal file
View File

@ -0,0 +1,185 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <stdlib.h>
#include "impl/misc.h"
#include "anode.h"
int AnodeURI_parse(AnodeURI *parsed_uri,const char *uri_string)
{
char buf[sizeof(AnodeURI)];
unsigned long ptr = 0;
char c;
char *p1,*p2;
Anode_zero((void *)parsed_uri,sizeof(AnodeURI));
/* Get the scheme */
for(;;) {
c = *(uri_string++);
if (!c) {
parsed_uri->scheme[ptr] = (char)0;
return ANODE_ERR_INVALID_URI;
} else if (c == ':') {
parsed_uri->scheme[ptr] = (char)0;
break;
} else {
parsed_uri->scheme[ptr++] = c;
if (ptr == sizeof(parsed_uri->scheme))
return ANODE_ERR_BUFFER_TOO_SMALL;
}
}
if (*uri_string == '/') {
/* If it starts with /, it's a URL */
/* Skip double slash */
if (!(*(++uri_string)))
return 0; /* Scheme with no path */
if (*uri_string == '/') {
if (!(*(++uri_string)))
return 0; /* Scheme with no path */
}
/* Get the host section and put it in buf[] */
ptr = 0;
while ((*uri_string)&&(*uri_string != '/')) {
buf[ptr++] = *(uri_string++);
if (ptr == sizeof(buf))
return ANODE_ERR_BUFFER_TOO_SMALL;
}
buf[ptr] = (char)0;
/* Parse host section for host, username, password, and port */
if (buf[0]) {
p1 = (char *)Anode_strchr(buf,'@');
if (p1) {
*(p1++) = (char)0;
if (*p1) {
p2 = (char *)Anode_strchr(buf,':');
if (p2) {
*(p2++) = (char)0;
Anode_str_copy(parsed_uri->password,p2,sizeof(parsed_uri->password));
}
Anode_str_copy(parsed_uri->username,buf,sizeof(parsed_uri->username));
} else return ANODE_ERR_INVALID_URI;
} else p1 = buf;
p2 = (char *)Anode_strchr(p1,':');
if (p2) {
*(p2++) = (char)0;
if (*p2)
parsed_uri->port = (int)strtoul(p2,(char **)0,10);
}
Anode_str_copy(parsed_uri->host,p1,sizeof(parsed_uri->host));
}
/* Get the path, query, and fragment section and put it in buf[] */
ptr = 0;
while ((buf[ptr++] = *(uri_string++))) {
if (ptr == sizeof(buf))
return ANODE_ERR_BUFFER_TOO_SMALL;
}
/* Parse path section for path, query, and fragment */
if (buf[0]) {
p1 = (char *)Anode_strchr(buf,'?');
if (p1) {
*(p1++) = (char)0;
p2 = (char *)Anode_strchr(p1,'#');
if (p2) {
*(p2++) = (char)0;
Anode_str_copy(parsed_uri->fragment,p2,sizeof(parsed_uri->fragment));
}
Anode_str_copy(parsed_uri->query,p1,sizeof(parsed_uri->query));
} else {
p2 = (char *)Anode_strchr(buf,'#');
if (p2) {
*(p2++) = (char)0;
Anode_str_copy(parsed_uri->fragment,p2,sizeof(parsed_uri->fragment));
}
}
Anode_str_copy(parsed_uri->path,buf,sizeof(parsed_uri->path));
}
} else {
/* Otherwise, it's a URN and what remains is all path */
ptr = 0;
while ((parsed_uri->path[ptr++] = *(uri_string++))) {
if (ptr == sizeof(parsed_uri->path))
return ANODE_ERR_BUFFER_TOO_SMALL;
}
}
return 0;
}
char *AnodeURI_to_string(const AnodeURI *uri,char *buf,int len)
{
int i = 0;
char portbuf[16];
const char *p;
p = uri->scheme;
while (*p) { buf[i++] = *(p++); if (i >= len) return (char *)0; }
buf[i++] = ':'; if (i >= len) return (char *)0;
if (uri->host[0]) {
buf[i++] = '/'; if (i >= len) return (char *)0;
buf[i++] = '/'; if (i >= len) return (char *)0;
if (uri->username[0]) {
p = uri->username;
while (*p) { buf[i++] = *(p++); if (i >= len) return (char *)0; }
if (uri->password[0]) {
buf[i++] = ':'; if (i >= len) return (char *)0;
p = uri->password;
while (*p) { buf[i++] = *(p++); if (i >= len) return (char *)0; }
}
buf[i++] = '@'; if (i >= len) return (char *)0;
}
p = uri->host;
while (*p) { buf[i++] = *(p++); if (i >= len) return (char *)0; }
if ((uri->port > 0)&&(uri->port <= 0xffff)) {
buf[i++] = ':'; if (i >= len) return (char *)0;
snprintf(portbuf,sizeof(portbuf),"%d",uri->port);
p = portbuf;
while (*p) { buf[i++] = *(p++); if (i >= len) return (char *)0; }
}
}
p = uri->path;
while (*p) { buf[i++] = *(p++); if (i >= len) return (char *)0; }
if (uri->query[0]) {
buf[i++] = '?'; if (i >= len) return (char *)0;
p = uri->query;
while (*p) { buf[i++] = *(p++); if (i >= len) return (char *)0; }
}
if (uri->fragment[0]) {
buf[i++] = '#'; if (i >= len) return (char *)0;
p = uri->fragment;
while (*p) { buf[i++] = *(p++); if (i >= len) return (char *)0; }
}
buf[i] = (char)0;
return buf;
}

50
attic/historic/anode/libanode/utils/anode-make-identity.c Normal file
View File

@ -0,0 +1,50 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <arpa/inet.h>
#include "../anode.h"
#include "../impl/misc.h"
#include "../impl/types.h"
int main(int argc,char **argv)
{
char str[1024];
AnodeZone zone;
AnodeIdentity identity;
if (argc < 2) {
printf("Usage: anode-make-identity <32-bit zone ID hex>\n");
return 0;
}
*((uint32_t *)zone.bits) = htonl((uint32_t)strtoul(argv[1],(char **)0,16));
if (AnodeIdentity_generate(&identity,&zone,ANODE_ADDRESS_ANODE_256_40)) {
fprintf(stderr,"Error: identity key pair generation failed (check build settings).\n");
return 1;
}
if (AnodeIdentity_to_string(&identity,str,sizeof(str)) <= 0) {
fprintf(stderr,"Error: internal error converting identity to string.\n");
return -1;
}
printf("%s\n",str);
return 0;
}

184
attic/historic/anode/libanode/zone.c Normal file
View File

@ -0,0 +1,184 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009-2010 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/stat.h>
#include "impl/types.h"
#include "impl/misc.h"
#include "impl/dictionary.h"
#include "impl/environment.h"
#include "impl/http_client.h"
#include "anode.h"
static const char *_MONTHS[12] = { "Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec" };
static const char *_DAYS_OF_WEEK[7] = { "Sun","Mon","Tue","Wed","Thu","Fri","Sat" };
static inline unsigned long get_file_time_for_http(const char *path,char *buf,unsigned int len)
{
struct stat st;
struct tm *gmt;
if (!stat(path,(struct stat *)&st)) {
gmt = gmtime(&st.st_mtime);
if (gmt) {
snprintf(buf,len,"%s, %d %s %d %d:%d:%d GMT",
_DAYS_OF_WEEK[gmt->tm_wday],
gmt->tm_mday,
_MONTHS[gmt->tm_mon],
(1900 + gmt->tm_year),
gmt->tm_hour,
gmt->tm_min,
gmt->tm_sec);
buf[len - 1] = (char)0;
return (unsigned long)st.st_size;
}
}
return 0;
}
struct AnodeZoneLookupJob
{
char cached_zone_file[2048];
struct AnodeDictionary *zone_dict;
AnodeZone zone;
void *ptr;
void (*zone_lookup_handler)(void *,const AnodeZone *,AnodeZoneFile *);
int had_cached_zone;
};
static void AnodeZone_lookup_http_handler(struct AnodeHttpClient *client)
{
char *data_tmp;
struct AnodeZoneLookupJob *job = (struct AnodeZoneLookupJob *)client->ptr[0];
FILE *zf;
if ((client->response.code == 200)&&(client->response.data_length > 0)) {
zf = fopen(job->cached_zone_file,"w");
if (zf) {
fwrite(client->response.data,1,client->response.data_length,zf);
fclose(zf);
}
data_tmp = (char *)malloc(client->response.data_length + 1);
Anode_memcpy((void *)data_tmp,client->response.data,client->response.data_length);
data_tmp[client->response.data_length] = (char)0;
AnodeDictionary_clear(job->zone_dict);
AnodeDictionary_read(
job->zone_dict,
data_tmp,
"\r\n",
"=",
";",
'\\',
1,1);
free((void *)data_tmp);
job->zone_lookup_handler(job->ptr,&job->zone,(AnodeZoneFile *)job->zone_dict);
} else if (job->had_cached_zone)
job->zone_lookup_handler(job->ptr,&job->zone,(AnodeZoneFile *)job->zone_dict);
else {
AnodeDictionary_destroy(job->zone_dict);
free((void *)job->zone_dict);
job->zone_lookup_handler(job->ptr,&job->zone,(AnodeZoneFile *)0);
}
free((void *)job);
AnodeHttpClient_free(client);
}
void AnodeZone_lookup(
AnodeTransportEngine *transport,
const AnodeZone *zone,
void *ptr,
void (*zone_lookup_handler)(void *,const AnodeZone *,AnodeZone *))
{
char cached_zones_folder[2048];
char cached_zone_file[2048];
char if_modified_since[256];
unsigned long file_size;
struct AnodeZoneLookupJob *job;
struct AnodeHttpClient *client;
char *file_data;
FILE *zf;
if (Anode_get_cache_sub("zones",cached_zones_folder,sizeof(cached_zones_folder))) {
snprintf(cached_zone_file,sizeof(cached_zone_file),"%s%c%.2x%.2x%.2x%.2x.z",cached_zones_folder,ANODE_PATH_SEPARATOR,(unsigned int)zone->bits[0],(unsigned int)zone->bits[1],(unsigned int)zone->bits[2],(unsigned int)zone->bits[3]);
cached_zone_file[sizeof(cached_zone_file)-1] = (char)0;
job = (struct AnodeZoneLookupJob *)malloc(sizeof(struct AnodeZoneLookupJob));
Anode_str_copy(job->cached_zone_file,cached_zone_file,sizeof(job->cached_zone_file));
job->zone_dict = (struct AnodeDictionary *)malloc(sizeof(struct AnodeDictionary));
AnodeDictionary_init(job->zone_dict,0);
job->zone.bits[0] = zone->bits[0];
job->zone.bits[1] = zone->bits[1];
job->zone.bits[2] = zone->bits[2];
job->zone.bits[3] = zone->bits[3];
job->ptr = ptr;
job->zone_lookup_handler = zone_lookup_handler;
job->had_cached_zone = 0;
client = AnodeHttpClient_new(transport);
Anode_str_copy(client->uri.scheme,"http",sizeof(client->uri.scheme));
snprintf(client->uri.host,sizeof(client->uri.host),"a--%.2x%.2x%.2x%.2x.net",(unsigned int)zone->bits[0],(unsigned int)zone->bits[1],(unsigned int)zone->bits[2],(unsigned int)zone->bits[3]);
client->uri.host[sizeof(client->uri.host)-1] = (char)0;
Anode_str_copy(client->uri.path,"/z",sizeof(client->uri.path));
client->handler = &AnodeZone_lookup_http_handler;
client->ptr[0] = job;
if ((file_size = get_file_time_for_http(cached_zone_file,if_modified_since,sizeof(if_modified_since)))) {
zf = fopen(cached_zone_file,"r");
if (zf) {
AnodeDictionary_put(&client->headers,"If-Modified-Since",if_modified_since);
file_data = (char *)malloc(file_size + 1);
if (fread((void *)file_data,1,file_size,zf)) {
file_data[file_size] = (char)0;
AnodeDictionary_read(
job->zone_dict,
file_data,
"\r\n",
"=",
";",
'\\',
1,1);
job->had_cached_zone = 1;
}
free((void *)file_data);
fclose(zf);
}
}
AnodeHttpClient_send(client);
} else zone_lookup_handler(ptr,zone,(AnodeZone *)0);
}
const char *AnodeZoneFile_get(AnodeZoneFile *zone,const char *key)
{
return AnodeDictionary_get((struct AnodeDictionary *)zone,key);
}
void AnodeZoneFile_free(AnodeZoneFile *zone)
{
AnodeDictionary_destroy((struct AnodeDictionary *)zone);
free((void *)zone);
}

16
attic/historic/anode/libspark/Makefile Normal file
View File

@ -0,0 +1,16 @@
SYSNAME:=${shell uname}
SYSNAME!=uname
include ../config.mk.${SYSNAME}
LIBSPARK_OBJS=
all: libspark
libspark: $(LIBSPARK_OBJS)
ar rcs libspark.a $(LIBSPARK_OBJS)
ranlib libspark.a
clean: force
rm -f *.a *.so *.dylib *.dll *.lib *.exe *.o
force: ;

161
attic/historic/anode/libspark/experiments/FindGoodSegmentDelimiters.cpp Normal file
View File

@ -0,0 +1,161 @@
// Searches for good delimiters to cut streams into relatively well sized
// segments.
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <sys/time.h>
#include <boost/cstdint.hpp>
#include <boost/array.hpp>
#include <boost/random/mersenne_twister.hpp>
#include <boost/thread.hpp>
#include <boost/bind.hpp>
#include <boost/shared_ptr.hpp>
#include <iostream>
#include <vector>
#include <map>
// Desired size range
#define MIN_DESIRED_SIZE 4096
#define MAX_DESIRED_SIZE 131072
#define DELIMITER_SET_SIZE 1
typedef boost::array<boost::uint16_t,DELIMITER_SET_SIZE> DelimArray;
struct BestEntry
{
DelimArray best;
double bestScore;
std::vector<unsigned char> data;
};
boost::mutex bestLock;
boost::mutex outLock;
std::map<std::string,BestEntry> best;
static void runThread(const std::string &fileName)
{
char tmp[4096];
boost::mt19937 prng;
{
boost::uint32_t seed;
FILE *ur = fopen("/dev/urandom","r");
fread((void *)&seed,1,sizeof(seed),ur);
fclose(ur);
prng.seed(seed);
}
BestEntry *myEntry;
{
boost::mutex::scoped_lock l(bestLock);
myEntry = &(best[fileName]);
myEntry->bestScore = 99999999.0;
}
{
boost::mutex::scoped_lock l(outLock);
std::cout << "*** Reading test data from: " << fileName << std::endl;
FILE *f = fopen(fileName.c_str(),"r");
if (f) {
int n;
while ((n = fread((void *)tmp,1,sizeof(tmp),f)) > 0) {
for(int i=0;i<n;++i)
myEntry->data.push_back((unsigned char)tmp[i]);
}
fclose(f);
}
if (myEntry->data.size() <= 0) {
std::cout << "Error: no data read." << std::endl;
exit(1);
} else std::cout << "*** Read " << myEntry->data.size() << " bytes of test data." << std::endl;
std::cout.flush();
}
DelimArray current;
for(unsigned int i=0;i<DELIMITER_SET_SIZE;++i)
current[i] = (boost::uint16_t)prng();
for(;;) {
unsigned long numTooShort = 0;
unsigned long numTooLong = 0;
unsigned long numGood = 0;
boost::uint32_t shiftRegister = 0;
unsigned long segSize = 0;
for(std::vector<unsigned char>::iterator i=myEntry->data.begin();i!=myEntry->data.end();++i) {
shiftRegister <<= 1;
shiftRegister |= (((boost::uint32_t)*i) & 1);
++segSize;
boost::uint16_t transformedShiftRegister = (boost::uint16_t)(shiftRegister);
for(DelimArray::iterator d=current.begin();d!=current.end();++d) {
if (transformedShiftRegister == *d) {
if (segSize < MIN_DESIRED_SIZE)
++numTooShort;
else if (segSize > MAX_DESIRED_SIZE)
++numTooLong;
else ++numGood;
segSize = 0;
break;
}
}
}
if (segSize) {
if (segSize < MIN_DESIRED_SIZE)
++numTooShort;
else if (segSize > MAX_DESIRED_SIZE)
++numTooLong;
else ++numGood;
}
if (numGood) {
double score = ((double)(numTooShort + numTooLong)) / ((double)numGood);
if (score < myEntry->bestScore) {
myEntry->best = current;
myEntry->bestScore = score;
boost::mutex::scoped_lock l(outLock);
std::cout << fileName << ": ";
for(DelimArray::iterator d=current.begin();d!=current.end();++d) {
sprintf(tmp,"0x%.4x",(unsigned int)*d);
if (d != current.begin())
std::cout << ',';
std::cout << tmp;
}
std::cout << ": " << numTooShort << " / " << numGood << " / " << numTooLong << " (" << score << ")" << std::endl;
std::cout.flush();
if ((numTooShort == 0)&&(numTooLong == 0))
break;
}
}
for(DelimArray::iterator i=current.begin();i!=current.end();++i)
*i = (boost::uint16_t)prng();
}
}
int main(int argc,char **argv)
{
std::vector< boost::shared_ptr<boost::thread> > threads;
for(int i=1;i<argc;++i) {
boost::shared_ptr<boost::thread> t(new boost::thread(boost::bind(&runThread,std::string(argv[i]))));
threads.push_back(t);
}
for(std::vector< boost::shared_ptr<boost::thread> >::iterator i=threads.begin();i!=threads.end();++i)
(*i)->join();
return 0;
}

5
attic/historic/anode/libspark/experiments/Makefile Normal file
View File

@ -0,0 +1,5 @@
all:
g++ -O6 -ftree-vectorize -o FindGoodSegmentDelimiters FindGoodSegmentDelimiters.cpp -lboost_thread -lpthread
clean:
rm FindGoodSegmentDelimiters

108
attic/historic/anode/libspark/streamencoder.h Normal file
View File

@ -0,0 +1,108 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef _SPARK_STREAMENCODER_H
#define _SPARK_STREAMENCODER_H
#ifdef __cplusplus
extern "C" {
#endif
typedef struct
{
unsigned char *input_buf;
unsigned long input_buf_capacity;
unsigned long input_length;
unsigned char *stream_out_buf;
unsigned long stream_out_buf_capacity;
unsigned long stream_out_length;
void (*data_segment_add_func)(const void *data,unsigned long len,const void *global_hash,unsigned long global_hash_len);
} SparkStreamEncoder;
/**
* Initialize a spark stream encoder
*
* @param enc Encoder structure to initialize
* @param data_segment_add_func Function to call to store or cache data
*/
void SparkStreamEncoder_init(
SparkStreamEncoder *enc,
void (*data_segment_add_func)(
const void *data,
unsigned long len,
const void *global_hash,
unsigned long global_hash_len));
/**
* Clean up a spark stream encoder structure
*
* @param enc Structure to clear
*/
void SparkStreamEncoder_destroy(SparkStreamEncoder *enc);
/**
* Add data to encode
*
* @param enc Encoder structure
* @param data Data to encode
* @param len Length of data in bytes
* @return Number of bytes of result stream now available
*/
unsigned long SparkStreamEncoder_put(
SparkStreamEncoder *enc,
const void *data,
unsigned long len);
/**
* Flush all data currently in input buffer
*
* @param enc Encoder structure to flush
*/
void SparkStreamEncoder_flush(SparkStreamEncoder *enc);
/**
* @return Number of bytes of output stream available
*/
static inline unsigned long SparkStreamEncoder_available(SparkStreamEncoder *enc)
{
return enc->stream_out_length;
}
/**
* @return Pointer to result stream bytes (may return null if none available)
*/
static inline const void *SparkStreamEncoder_get(SparkStreamEncoder *enc)
{
return (const void *)(enc->stream_out_buf);
}
/**
* @return "Consume" result stream bytes after they're read or sent
*/
static inline void SparkStreamEncoder_consume(SparkStreamEncoder *enc,unsigned long len)
{
unsigned long i;
for(i=len;i<enc->stream_out_length;++i)
enc->stream_out_buf[i - len] = enc->stream_out_buf[i];
}
#ifdef __cplusplus
}
#endif
#endif

66
attic/historic/anode/libspark/wrapper.h Normal file
View File

@ -0,0 +1,66 @@
/* libanode: the Anode C reference implementation
* Copyright (C) 2009 Adam Ierymenko <adam.ierymenko@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef _SPARK_WRAPPER_H
#define _SPARK_WRAPPER_H
#include <openssl/sha.h>
#include "../libanode/aes128.h"
#ifdef __cplusplus
extern "C" {
#endif
/* Spark uses SHA-256 with hash length 32 */
#define SPARK_HASH_LENGTH 32
// Wrap a segment for forward propagation
static inline void Spark_wrap(void *data,unsigned long len,void *plaintext_hash_buf,void *global_hash_buf)
{
unsigned char expkey[ANODE_AES128_EXP_KEY_SIZE];
SHA256((const unsigned char *)data,len,(unsigned char *)plaintext_hash_buf);
Anode_aes128_expand_key(expkey,(const unsigned char *)plaintext_hash_buf);
Anode_aes128_cfb_encrypt(expkey,((const unsigned char *)plaintext_hash_buf) + 16,(unsigned char *)data,len);
SHA256((const unsigned char *)data,len,(unsigned char *)global_hash_buf);
}
// Unwrap a segment and check its integrity
static inline int Spark_unwrap(void *data,unsigned long len,const void *plaintext_hash)
{
unsigned char expkey[ANODE_AES128_EXP_KEY_SIZE];
unsigned char check_hash[32];
unsigned long i;
Anode_aes128_expand_key(expkey,(const unsigned char *)plaintext_hash);
Anode_aes128_cfb_decrypt(expkey,((const unsigned char *)plaintext_hash) + 16,(unsigned char *)data,len);
SHA256((const unsigned char *)data,len,check_hash);
for(i=0;i<32;++i) {
if (check_hash[i] != ((const unsigned char *)plaintext_hash)[i])
return 0;
}
return 1;
}
#ifdef __cplusplus
}
#endif
#endif

18
attic/kubernetes_docs/.zerotierCliSettings Normal file
View File

@ -0,0 +1,18 @@
{
"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/"
}
}
}

19
attic/kubernetes_docs/Dockerfile Normal file
View File

@ -0,0 +1,19 @@
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"]

150
attic/kubernetes_docs/README.md Normal file
View File

@ -0,0 +1,150 @@
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.

23
attic/kubernetes_docs/entrypoint.sh Normal file
View File

@ -0,0 +1,23 @@
#!/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

8
attic/kubernetes_docs/server.js Normal file
View File

@ -0,0 +1,8 @@
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);

25
attic/lat_lon_to_xyz.js Normal file
View File

@ -0,0 +1,25 @@
'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);

134
attic/old-linux-installer/buildinstaller.sh
View File

@ -1,134 +0,0 @@
#!/bin/bash
# This script builds the installer for *nix systems. Windows must do everything
# completely differently, as usual.
export PATH=/bin:/usr/bin:/sbin:/usr/sbin
if [ ! -f zerotier-one ]; then
echo "Could not find 'zerotier-one' binary, please build before running this script."
exit 2
fi
machine=`uname -m`
system=`uname -s`
vmajor=`cat version.h | grep -F ZEROTIER_ONE_VERSION_MAJOR | cut -d ' ' -f 3`
vminor=`cat version.h | grep -F ZEROTIER_ONE_VERSION_MINOR | cut -d ' ' -f 3`
revision=`cat version.h | grep -F ZEROTIER_ONE_VERSION_REVISION | cut -d ' ' -f 3`
if [ -z "$vmajor" -o -z "$vminor" -o -z "$revision" ]; then
echo "Unable to extract version info from version.h, aborting installer build."
exit 2
fi
rm -rf build-installer
mkdir build-installer
case "$system" in
Linux)
# Canonicalize $machine for some architectures... we use x86
# and x64 for Intel stuff. ARM and others should be fine if
# we ever ship officially for those.
debian_arch=$machine
case "$machine" in
i386|i486|i586|i686)
machine="x86"
debian_arch="i386"
;;
x86_64|amd64|x64)
machine="x64"
debian_arch="amd64"
;;
armv6l|arm|armhf|arm7l|armv7l)
machine="armv6l"
debian_arch="armhf"
;;
esac
echo "Assembling Linux installer for $machine and version $vmajor.$vminor.$revision"
mkdir -p 'build-installer/var/lib/zerotier-one/ui'
cp -fp 'ext/installfiles/linux/uninstall.sh' 'build-installer/var/lib/zerotier-one'
cp -fp 'zerotier-one' 'build-installer/var/lib/zerotier-one'
for f in ui/*.html ui/*.js ui/*.css ui/*.jsx ; do
cp -fp "$f" 'build-installer/var/lib/zerotier-one/ui'
done
mkdir -p 'build-installer/tmp'
cp -fp 'ext/installfiles/linux/init.d/zerotier-one' 'build-installer/tmp/init.d_zerotier-one'
cp -fp 'ext/installfiles/linux/systemd/zerotier-one.service' 'build-installer/tmp/systemd_zerotier-one.service'
targ="ZeroTierOneInstaller-linux-${machine}-${vmajor}_${vminor}_${revision}"
# Use gzip in Linux since some minimal Linux systems do not have bunzip2
rm -f build-installer-tmp.tar.gz
cd build-installer
tar -cf - * | gzip -9 >../build-installer-tmp.tar.gz
cd ..
rm -f $targ
cat ext/installfiles/linux/install.tmpl.sh build-installer-tmp.tar.gz >$targ
chmod 0755 $targ
rm -f build-installer-tmp.tar.gz
ls -l $targ
if [ -f /usr/bin/dpkg-deb -a "$UID" -eq 0 ]; then
echo
echo Found dpkg-deb and you are root, trying to build Debian package.
rm -rf build-installer-deb
debbase="build-installer-deb/zerotier-one_${vmajor}.${vminor}.${revision}_$debian_arch"
debfolder="${debbase}/DEBIAN"
mkdir -p $debfolder
cat 'ext/installfiles/linux/DEBIAN/control.in' | sed "s/__VERSION__/${vmajor}.${vminor}.${revision}/" | sed "s/__ARCH__/${debian_arch}/" >$debfolder/control
cat $debfolder/control
cp -f 'ext/installfiles/linux/DEBIAN/conffiles' "${debfolder}/conffiles"
mkdir -p "${debbase}/var/lib/zerotier-one/updates.d"
cp -f $targ "${debbase}/var/lib/zerotier-one/updates.d"
rm -f "${debfolder}/postinst" "${debfolder}/prerm"
echo '#!/bin/bash' >${debfolder}/postinst
echo "/var/lib/zerotier-one/updates.d/${targ} >>/dev/null 2>&1" >>${debfolder}/postinst
echo "/bin/rm -f /var/lib/zerotier-one/updates.d/*" >>${debfolder}/postinst
chmod a+x ${debfolder}/postinst
echo '#!/bin/bash' >${debfolder}/prerm
echo 'export PATH=/bin:/usr/bin:/usr/local/bin:/sbin:/usr/sbin' >>${debfolder}/prerm
echo 'if [ "$1" != "upgrade" ]; then' >>${debfolder}/prerm
echo ' /var/lib/zerotier-one/uninstall.sh >>/dev/null 2>&1' >>${debfolder}/prerm
echo 'fi' >>${debfolder}/prerm
chmod a+x ${debfolder}/prerm
dpkg-deb --build $debbase
mv -f build-installer-deb/*.deb .
rm -rf build-installer-deb
fi
if [ -f /usr/bin/rpmbuild ]; then
echo
echo Found rpmbuild, trying to build RedHat/CentOS package.
rm -f /tmp/zerotier-one.spec
curr_dir=`pwd`
cat ext/installfiles/linux/RPM/zerotier-one.spec.in | sed "s/__VERSION__/${vmajor}.${vminor}.${revision}/g" | sed "s/__INSTALLER__/${targ}/g" >/tmp/zerotier-one.spec
rpmbuild -ba /tmp/zerotier-one.spec
rm -f /tmp/zerotier-one.spec
fi
;;
*)
echo "Unsupported platform: $system"
exit 2
esac
rm -rf build-installer
exit 0

182
attic/old-linux-installer/install.tmpl.sh
View File

@ -1,182 +0,0 @@
#!/bin/bash
export PATH=/bin:/usr/bin:/sbin:/usr/sbin:/usr/local/bin:/usr/local/sbin
shopt -s expand_aliases
dryRun=0
echo "*** ZeroTier One install/update ***"
echo
if [ "$UID" -ne 0 ]; then
echo "Not running as root so doing dry run (no modifications to system)..."
dryRun=1
fi
if [ $dryRun -gt 0 ]; then
alias ln="echo '>> ln'"
alias rm="echo '>> rm'"
alias mv="echo '>> mv'"
alias cp="echo '>> cp'"
alias chown="echo '>> chown'"
alias chgrp="echo '>> chgrp'"
alias chmod="echo '>> chmod'"
alias chkconfig="echo '>> chkconfig'"
alias zerotier-cli="echo '>> zerotier-cli'"
alias service="echo '>> service'"
alias systemctl="echo '>> systemctl'"
fi
scriptPath="`dirname "$0"`/`basename "$0"`"
if [ ! -r "$scriptPath" ]; then
scriptPath="$0"
if [ ! -r "$scriptPath" ]; then
echo "Installer cannot determine its own path; $scriptPath is not readable."
exit 2
fi
fi
# Check for systemd vs. old school SysV init
SYSTEMDUNITDIR=
if [ -e /bin/systemctl -o -e /usr/bin/systemctl -o -e /usr/local/bin/systemctl -o -e /sbin/systemctl -o -e /usr/sbin/systemctl ]; then
# Second check: test if systemd appears to actually be running. Apparently Ubuntu
# thought it was a good idea to ship with systemd installed but not used. Issue #133
if [ -d /var/run/systemd/system -o -d /run/systemd/system ]; then
if [ -e /usr/bin/pkg-config ]; then
SYSTEMDUNITDIR=`/usr/bin/pkg-config systemd --variable=systemdsystemunitdir`
fi
if [ -z "$SYSTEMDUNITDIR" -o ! -d "$SYSTEMDUNITDIR" ]; then
if [ -d /usr/lib/systemd/system ]; then
SYSTEMDUNITDIR=/usr/lib/systemd/system
fi
if [ -d /etc/systemd/system ]; then
SYSTEMDUNITDIR=/etc/systemd/system
fi
fi
fi
fi
# Find the end of this script, which is where we have appended binary data.
endMarkerIndex=`grep -a -b -E '^################' "$scriptPath" | head -c 16 | cut -d : -f 1`
if [ "$endMarkerIndex" -le 100 ]; then
echo 'Internal error: unable to find end of script / start of binary data marker.'
exit 2
fi
blobStart=`expr $endMarkerIndex + 17`
if [ "$blobStart" -le "$endMarkerIndex" ]; then
echo 'Internal error: unable to find end of script / start of binary data marker.'
exit 2
fi
echo -n 'Getting version of existing install... '
origVersion=NONE
if [ -x /var/lib/zerotier-one/zerotier-one ]; then
origVersion=`/var/lib/zerotier-one/zerotier-one -v`
fi
echo $origVersion
echo 'Extracting files...'
if [ $dryRun -gt 0 ]; then
echo ">> tail -c +$blobStart \"$scriptPath\" | gunzip -c | tar -xvop -C / -f -"
tail -c +$blobStart "$scriptPath" | gunzip -c | tar -t -f - | sed 's/^/>> /'
else
tail -c +$blobStart "$scriptPath" | gunzip -c | tar -xvop --no-overwrite-dir -C / -f -
fi
if [ $dryRun -eq 0 -a ! -x "/var/lib/zerotier-one/zerotier-one" ]; then
echo 'Archive extraction failed, cannot find zerotier-one binary in "/var/lib/zerotier-one".'
exit 2
fi
echo -n 'Getting version of new install... '
newVersion=`/var/lib/zerotier-one/zerotier-one -v`
echo $newVersion
echo 'Creating symlinks...'
rm -f /usr/bin/zerotier-cli /usr/bin/zerotier-idtool
ln -sf /var/lib/zerotier-one/zerotier-one /usr/bin/zerotier-cli
ln -sf /var/lib/zerotier-one/zerotier-one /usr/bin/zerotier-idtool
echo 'Installing zerotier-one service...'
if [ -n "$SYSTEMDUNITDIR" -a -d "$SYSTEMDUNITDIR" ]; then
# SYSTEMD
# If this was updated or upgraded from an init.d based system, clean up the old
# init.d stuff before installing directly via systemd.
if [ -f /etc/init.d/zerotier-one ]; then
if [ -e /sbin/chkconfig -o -e /usr/sbin/chkconfig -o -e /bin/chkconfig -o -e /usr/bin/chkconfig ]; then
chkconfig zerotier-one off
fi
rm -f /etc/init.d/zerotier-one
fi
cp -f /tmp/systemd_zerotier-one.service "$SYSTEMDUNITDIR/zerotier-one.service"
chown 0 "$SYSTEMDUNITDIR/zerotier-one.service"
chgrp 0 "$SYSTEMDUNITDIR/zerotier-one.service"
chmod 0644 "$SYSTEMDUNITDIR/zerotier-one.service"
rm -f /tmp/systemd_zerotier-one.service /tmp/init.d_zerotier-one
systemctl enable zerotier-one.service
echo
echo 'Done! Installed and service configured to start at system boot.'
echo
echo "To start now or restart the service if it's already running:"
echo ' sudo systemctl restart zerotier-one.service'
else
# SYSV INIT -- also covers upstart which supports SysVinit backward compatibility
cp -f /tmp/init.d_zerotier-one /etc/init.d/zerotier-one
chmod 0755 /etc/init.d/zerotier-one
rm -f /tmp/systemd_zerotier-one.service /tmp/init.d_zerotier-one
if [ -f /sbin/chkconfig -o -f /usr/sbin/chkconfig -o -f /usr/bin/chkconfig -o -f /bin/chkconfig ]; then
chkconfig zerotier-one on
else
# Yes Virginia, some systems lack chkconfig.
if [ -d /etc/rc0.d ]; then
rm -f /etc/rc0.d/???zerotier-one
ln -sf /etc/init.d/zerotier-one /etc/rc0.d/K89zerotier-one
fi
if [ -d /etc/rc1.d ]; then
rm -f /etc/rc1.d/???zerotier-one
ln -sf /etc/init.d/zerotier-one /etc/rc1.d/K89zerotier-one
fi
if [ -d /etc/rc2.d ]; then
rm -f /etc/rc2.d/???zerotier-one
ln -sf /etc/init.d/zerotier-one /etc/rc2.d/S11zerotier-one
fi
if [ -d /etc/rc3.d ]; then
rm -f /etc/rc3.d/???zerotier-one
ln -sf /etc/init.d/zerotier-one /etc/rc3.d/S11zerotier-one
fi
if [ -d /etc/rc4.d ]; then
rm -f /etc/rc4.d/???zerotier-one
ln -sf /etc/init.d/zerotier-one /etc/rc4.d/S11zerotier-one
fi
if [ -d /etc/rc5.d ]; then
rm -f /etc/rc5.d/???zerotier-one
ln -sf /etc/init.d/zerotier-one /etc/rc5.d/S11zerotier-one
fi
if [ -d /etc/rc6.d ]; then
rm -f /etc/rc6.d/???zerotier-one
ln -sf /etc/init.d/zerotier-one /etc/rc6.d/K89zerotier-one
fi
fi
echo
echo 'Done! Installed and service configured to start at system boot.'
echo
echo "To start now or restart the service if it's already running:"
echo ' sudo service zerotier-one restart'
fi
exit 0
# Do not remove the last line or add a carriage return to it! The installer
# looks for an unterminated line beginning with 16 #'s in itself to find
# the binary blob data, which is appended after it.
################

76
attic/old-linux-installer/uninstall.sh
View File

@ -1,76 +0,0 @@
#!/bin/bash
export PATH=/bin:/usr/bin:/sbin:/usr/sbin:/usr/local/bin:/usr/local/sbin
if [ "$UID" -ne 0 ]; then
echo "Must be run as root; try: sudo $0"
exit 1
fi
# Detect systemd vs. regular init
SYSTEMDUNITDIR=
if [ -e /bin/systemctl -o -e /usr/bin/systemctl -o -e /usr/local/bin/systemctl -o -e /sbin/systemctl -o -e /usr/sbin/systemctl ]; then
if [ -e /usr/bin/pkg-config ]; then
SYSTEMDUNITDIR=`/usr/bin/pkg-config systemd --variable=systemdsystemunitdir`
fi
if [ -z "$SYSTEMDUNITDIR" -o ! -d "$SYSTEMDUNITDIR" ]; then
if [ -d /usr/lib/systemd/system ]; then
SYSTEMDUNITDIR=/usr/lib/systemd/system
fi
if [ -d /etc/systemd/system ]; then
SYSTEMDUNITDIR=/etc/systemd/system
fi
fi
fi
echo "Killing any running zerotier-one service..."
if [ -n "$SYSTEMDUNITDIR" -a -d "$SYSTEMDUNITDIR" ]; then
systemctl stop zerotier-one.service
systemctl disable zerotier-one.service
else
if [ -f /sbin/service -o -f /usr/sbin/service -o -f /bin/service -o -f /usr/bin/service ]; then
service zerotier-one stop
fi
fi
sleep 1
if [ -f /var/lib/zerotier-one/zerotier-one.pid ]; then
kill -TERM `cat /var/lib/zerotier-one/zerotier-one.pid`
sleep 1
fi
if [ -f /var/lib/zerotier-one/zerotier-one.pid ]; then
kill -KILL `cat /var/lib/zerotier-one/zerotier-one.pid`
fi
if [ -f /etc/init.d/zerotier-one ]; then
echo "Removing SysV init items..."
if [ -f /sbin/chkconfig -o -f /usr/sbin/chkconfig -o -f /bin/chkconfig -o -f /usr/bin/chkconfig ]; then
chkconfig zerotier-one off
fi
rm -f /etc/init.d/zerotier-one
find /etc/rc*.d -type f -name '???zerotier-one' -print0 | xargs -0 rm -f
fi
if [ -n "$SYSTEMDUNITDIR" -a -d "$SYSTEMDUNITDIR" -a -f "$SYSTEMDUNITDIR/zerotier-one.service" ]; then
echo "Removing systemd service..."
rm -f "$SYSTEMDUNITDIR/zerotier-one.service"
fi
echo "Erasing binary and support files..."
if [ -d /var/lib/zerotier-one ]; then
cd /var/lib/zerotier-one
rm -rf zerotier-one *.persist identity.public *.log *.pid *.sh updates.d networks.d iddb.d root-topology ui
fi
echo "Erasing anything installed into system bin directories..."
rm -f /usr/local/bin/zerotier-cli /usr/bin/zerotier-cli /usr/local/bin/zerotier-idtool /usr/bin/zerotier-idtool
echo "Done."
echo
echo "Your ZeroTier One identity is still preserved in /var/lib/zerotier-one"
echo "as identity.secret and can be manually deleted if you wish. Save it if"
echo "you wish to re-use the address of this node, as it cannot be regenerated."
echo
exit 0

0
world/README.md → attic/world/README.md
View File

0
world/build.sh → attic/world/build.sh
View File

0
world/earth-2016-01-13.bin → attic/world/earth-2016-01-13.bin
View File

21
world/mkworld.cpp → attic/world/mkworld.cpp
View File

@ -50,25 +50,6 @@
using namespace ZeroTier;
class WorldMaker : public World
{
public:
static inline World make(uint64_t id,uint64_t ts,const C25519::Public &sk,const std::vector<World::Root> &roots,const C25519::Pair &signWith)
{
WorldMaker w;
w._id = id;
w._ts = ts;
w._updateSigningKey = sk;
w._roots = roots;
Buffer<ZT_WORLD_MAX_SERIALIZED_LENGTH> tmp;
w.serialize(tmp,true);
w._signature = C25519::sign(signWith,tmp.data(),tmp.size());
return w;
}
};
int main(int argc,char **argv)
{
std::string previous,current;
@ -139,7 +120,7 @@ int main(int argc,char **argv)
fprintf(stderr,"INFO: generating and signing id==%llu ts==%llu"ZT_EOL_S,(unsigned long long)id,(unsigned long long)ts);
World nw = WorldMaker::make(id,ts,currentKP.pub,roots,previousKP);
World nw = World::make(World::TYPE_PLANET,id,ts,currentKP.pub,roots,previousKP);
Buffer<ZT_WORLD_MAX_SERIALIZED_LENGTH> outtmp;
nw.serialize(outtmp,false);

0
world/old/earth-2015-11-16.bin → attic/world/old/earth-2015-11-16.bin
View File

0
world/old/earth-2015-11-20.bin → attic/world/old/earth-2015-11-20.bin
View File

0
world/old/earth-2015-12-17.bin → attic/world/old/earth-2015-12-17.bin
View File

6
cli/README.md
View File

@ -1,6 +0,0 @@
ZeroTier Newer-Spiffier Command Line Interface
======
This will be the future home of our new unified CLI for ZeroTier One, controllers, and Central (my.zerotier.com etc.).
IT IS NOT DONE AND DOES NOT WORK EVEN A LITTLE BIT. GO AWAY.

Some files were not shown because too many files have changed in this diff Show More