mirror of
https://github.com/norohind/hans.git
synced 2025-04-16 22:42:19 +03:00
initial commit
This commit is contained in:
Friedrich Schöller
commit
f20f1d50df
Makefileauth.cppauth.hclient.cppclient.hconfig.hecho.cppecho.hexception.cppexception.hgpl.txtmain.cppserver.cppserver.hsha1 license.txtsha1.cppsha1.htime.cpptime.htun.cpptun.htun_dev.htun_dev_freebsd.ctun_dev_generic.ctun_dev_linux.ctun_dev_openbsd.ctun_dev_svr4.cutility.cpputility.hworker.cppworker.h
68
Makefile
Normal file
68
Makefile
Normal file
@ -0,0 +1,68 @@
|
||||
OS = $(shell uname | tr "a-z" "A-Z")
|
||||
|
||||
LDFLAGS =
|
||||
CFLAGS = -c -g -D$(OS) $(OS_CFLAGS)
|
||||
|
||||
ifeq ($(OS), LINUX)
|
||||
TUN_DEV_FILE = tun_dev_linux.c
|
||||
OS_CFLAGS = -DHAVE_LINUX_IF_TUN_H
|
||||
else
|
||||
|
||||
ifeq ($(OS), OPENBSD)
|
||||
TUN_DEV_FILE = tun_dev_openbsd.c
|
||||
else
|
||||
|
||||
ifeq ($(OS), FREEBSD)
|
||||
TUN_DEV_FILE = tun_dev_freebsd.c
|
||||
else
|
||||
|
||||
TUN_DEV_FILE = tun_dev_generic.c
|
||||
|
||||
endif
|
||||
endif
|
||||
endif
|
||||
|
||||
|
||||
all: hans
|
||||
|
||||
hans: tun.o sha1.o main.o client.o server.o auth.o worker.o time.o tun_dev.o echo.o exception.o utility.o
|
||||
g++ -o hans tun.o sha1.o main.o client.o server.o auth.o worker.o time.o tun_dev.o echo.o exception.o utility.o $(LDFLAGS)
|
||||
|
||||
utility.o: utility.cpp utility.h
|
||||
g++ -c utility.cpp $(CFLAGS)
|
||||
|
||||
exception.o: exception.cpp exception.h
|
||||
g++ -c exception.cpp $(CFLAGS)
|
||||
|
||||
echo.o: echo.cpp echo.h exception.h
|
||||
g++ -c echo.cpp $(CFLAGS)
|
||||
|
||||
tun.o: tun.cpp tun.h exception.h utility.h tun_dev.h
|
||||
g++ -c tun.cpp $(CFLAGS)
|
||||
|
||||
tun_dev.o: $(TUN_DEV_FILE)
|
||||
gcc -c $(TUN_DEV_FILE) -o tun_dev.o $(CFLAGS)
|
||||
|
||||
sha1.o: sha1.cpp sha1.h
|
||||
g++ -c sha1.cpp $(CFLAGS)
|
||||
|
||||
main.o: main.cpp client.h server.h exception.h worker.h auth.h time.h echo.h tun.h tun_dev.h
|
||||
g++ -c main.cpp $(CFLAGS)
|
||||
|
||||
client.o: client.cpp client.h server.h exception.h config.h worker.h auth.h time.h echo.h tun.h tun_dev.h
|
||||
g++ -c client.cpp $(CFLAGS)
|
||||
|
||||
server.o: server.cpp server.h client.h utility.h config.h worker.h auth.h time.h echo.h tun.h tun_dev.h
|
||||
g++ -c server.cpp $(CFLAGS)
|
||||
|
||||
auth.o: auth.cpp auth.h sha1.h
|
||||
g++ -c auth.cpp $(CFLAGS)
|
||||
|
||||
worker.o: worker.cpp worker.h tun.h exception.h time.h echo.h tun_dev.h
|
||||
g++ -c worker.cpp $(CFLAGS)
|
||||
|
||||
time.o: time.cpp time.h
|
||||
g++ -c time.cpp $(CFLAGS)
|
||||
|
||||
clean:
|
||||
rm -f tun.o sha1.o main.o client.o server.o auth.o worker.o time.o tun_dev.o echo.o exception.o utility.o hans
|
||||
65
auth.cpp
Normal file
65
auth.cpp
Normal file
@ -0,0 +1,65 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 "auth.h"
|
||||
#include "sha1.h"
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <arpa/inet.h>
|
||||
|
||||
bool Auth::randInitialized = false;
|
||||
|
||||
Auth::Auth(const char *passphrase)
|
||||
{
|
||||
this->passphrase = passphrase;
|
||||
|
||||
if (!randInitialized)
|
||||
{
|
||||
srand(time(NULL));
|
||||
randInitialized = true;
|
||||
}
|
||||
}
|
||||
|
||||
Auth::Response Auth::getResponse(const Challenge &challenge) const
|
||||
{
|
||||
SHA1 hasher;
|
||||
|
||||
Response response;
|
||||
|
||||
hasher << passphrase.c_str();
|
||||
hasher.Input(&challenge[0], challenge.size());
|
||||
|
||||
hasher.Result((unsigned int *)response.data);
|
||||
|
||||
for (int i = 0; i < 5; i++)
|
||||
response.data[i] = htonl(response.data[i]);
|
||||
|
||||
return response;
|
||||
}
|
||||
|
||||
Auth::Challenge Auth::generateChallenge(int length) const
|
||||
{
|
||||
Challenge challenge;
|
||||
challenge.resize(length);
|
||||
|
||||
for (int i = 0; i < length; i++)
|
||||
challenge[i] = rand();
|
||||
|
||||
return challenge;
|
||||
}
|
||||
50
auth.h
Normal file
50
auth.h
Normal file
@ -0,0 +1,50 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 AUTH_H
|
||||
#define AUTH_H
|
||||
|
||||
#include <vector>
|
||||
#include <string>
|
||||
#include <string.h>
|
||||
|
||||
class Auth
|
||||
{
|
||||
public:
|
||||
typedef std::vector<char> Challenge;
|
||||
|
||||
struct Response
|
||||
{
|
||||
uint32_t data[5];
|
||||
bool operator==(const Response &other) const { return memcmp(this, &other, sizeof(Response)) == 0; }
|
||||
};
|
||||
|
||||
Auth(const char *passphrase);
|
||||
|
||||
Challenge generateChallenge(int length) const;
|
||||
Response getResponse(const Challenge &challenge) const;
|
||||
|
||||
protected:
|
||||
std::string passphrase;
|
||||
std::string challenge;
|
||||
|
||||
static bool randInitialized;
|
||||
};
|
||||
|
||||
#endif
|
||||
212
client.cpp
Normal file
212
client.cpp
Normal file
@ -0,0 +1,212 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 "client.h"
|
||||
#include "server.h"
|
||||
#include "exception.h"
|
||||
#include "config.h"
|
||||
|
||||
#include <string.h>
|
||||
#include <arpa/inet.h>
|
||||
#include <syslog.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
const Worker::TunnelHeader::Magic Client::magic("9967");
|
||||
|
||||
Client::Client(int tunnelMtu, const char *deviceName, uint32_t serverIp, int maxPolls, const char *passphrase, uid_t uid, gid_t gid)
|
||||
: Worker(tunnelMtu, deviceName, false, uid, gid), auth(passphrase)
|
||||
{
|
||||
this->serverIp = serverIp;
|
||||
this->maxPolls = maxPolls;
|
||||
|
||||
state = STATE_CLOSED;
|
||||
}
|
||||
|
||||
Client::~Client()
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
void Client::sendConnectionRequest()
|
||||
{
|
||||
Server::ClientConnectData *connectData = (Server::ClientConnectData *)payloadBuffer();
|
||||
connectData->maxPolls = maxPolls;
|
||||
|
||||
syslog(LOG_DEBUG, "sending connection request");
|
||||
|
||||
sendEchoToServer(TunnelHeader::TYPE_CONNECTION_REQUEST, sizeof(Server::ClientConnectData));
|
||||
|
||||
state = STATE_CONNECTION_REQUEST_SENT;
|
||||
setTimeout(5000);
|
||||
}
|
||||
|
||||
void Client::sendChallengeResponse(int dataLength)
|
||||
{
|
||||
if (dataLength != CHALLENGE_SIZE)
|
||||
throw Exception("invalid challenge received");
|
||||
|
||||
state = STATE_CHALLENGE_RESPONSE_SENT;
|
||||
|
||||
syslog(LOG_DEBUG, "sending challenge response");
|
||||
|
||||
vector<char> challenge;
|
||||
challenge.resize(dataLength);
|
||||
memcpy(&challenge[0], payloadBuffer(), dataLength);
|
||||
|
||||
Auth::Response response = auth.getResponse(challenge);
|
||||
|
||||
memcpy(payloadBuffer(), (char *)&response, sizeof(Auth::Response));
|
||||
sendEchoToServer(TunnelHeader::TYPE_CHALLENGE_RESPONSE, sizeof(Auth::Response));
|
||||
|
||||
setTimeout(5000);
|
||||
}
|
||||
|
||||
bool Client::handleEchoData(TunnelHeader header, int dataLength, uint32_t realIp, bool reply, int id, int seq)
|
||||
{
|
||||
if (realIp != serverIp || !reply || id != ICMP_ID)
|
||||
return false;
|
||||
|
||||
if (header.magic != Server::magic)
|
||||
return false;
|
||||
|
||||
switch (header.type)
|
||||
{
|
||||
case TunnelHeader::TYPE_RESET_CONNECTION:
|
||||
syslog(LOG_DEBUG, "reset reveiced");
|
||||
sendConnectionRequest();
|
||||
return true;
|
||||
case TunnelHeader::TYPE_SERVER_FULL:
|
||||
if (state == STATE_CONNECTION_REQUEST_SENT)
|
||||
{
|
||||
throw Exception("server full");
|
||||
}
|
||||
break;
|
||||
case TunnelHeader::TYPE_CHALLENGE:
|
||||
if (state == STATE_CONNECTION_REQUEST_SENT)
|
||||
{
|
||||
syslog(LOG_DEBUG, "challenge received");
|
||||
sendChallengeResponse(dataLength);
|
||||
return true;
|
||||
}
|
||||
break;
|
||||
case TunnelHeader::TYPE_CONNECTION_ACCEPT:
|
||||
if (state == STATE_CHALLENGE_RESPONSE_SENT)
|
||||
{
|
||||
if (dataLength != sizeof(uint32_t))
|
||||
{
|
||||
throw Exception("invalid ip received");
|
||||
return true;
|
||||
}
|
||||
|
||||
syslog(LOG_INFO, "connection established");
|
||||
|
||||
tun->setIp(ntohl(*(uint32_t *)payloadBuffer()));
|
||||
state = STATE_ESTABLISHED;
|
||||
|
||||
dropPrivileges();
|
||||
startPolling();
|
||||
|
||||
return true;
|
||||
}
|
||||
break;
|
||||
case TunnelHeader::TYPE_CHALLENGE_ERROR:
|
||||
if (state == STATE_CHALLENGE_RESPONSE_SENT)
|
||||
{
|
||||
throw Exception("password error");
|
||||
}
|
||||
break;
|
||||
case TunnelHeader::TYPE_DATA:
|
||||
if (state == STATE_ESTABLISHED)
|
||||
{
|
||||
handleDataFromServer(dataLength);
|
||||
return true;
|
||||
}
|
||||
break;
|
||||
}
|
||||
|
||||
syslog(LOG_DEBUG, "invalid packet type: %d, state:\n", header.type, state);
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
void Client::sendEchoToServer(int type, int dataLength)
|
||||
{
|
||||
if (maxPolls == 0 && state == STATE_ESTABLISHED)
|
||||
setTimeout(KEEP_ALIVE_INTERVAL);
|
||||
|
||||
sendEcho(magic, type, dataLength, serverIp, false, ICMP_ID, 0);
|
||||
}
|
||||
|
||||
void Client::startPolling()
|
||||
{
|
||||
if (maxPolls == 0)
|
||||
{
|
||||
setTimeout(KEEP_ALIVE_INTERVAL);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (int i = 0; i < maxPolls; i++)
|
||||
sendEchoToServer(TunnelHeader::TYPE_POLL, 0);
|
||||
setTimeout(POLL_INTERVAL);
|
||||
}
|
||||
}
|
||||
|
||||
void Client::handleDataFromServer(int dataLength)
|
||||
{
|
||||
sendToTun(dataLength);
|
||||
|
||||
if (maxPolls != 0)
|
||||
sendEchoToServer(TunnelHeader::TYPE_POLL, 0);
|
||||
}
|
||||
|
||||
void Client::handleTunData(int dataLength, uint32_t sourceIp, uint32_t destIp)
|
||||
{
|
||||
if (state != STATE_ESTABLISHED)
|
||||
return;
|
||||
|
||||
sendEchoToServer(TunnelHeader::TYPE_DATA, dataLength);
|
||||
}
|
||||
|
||||
void Client::handleTimeout()
|
||||
{
|
||||
switch (state)
|
||||
{
|
||||
case STATE_CONNECTION_REQUEST_SENT:
|
||||
case STATE_CHALLENGE_RESPONSE_SENT:
|
||||
sendConnectionRequest();
|
||||
break;
|
||||
|
||||
case STATE_ESTABLISHED:
|
||||
sendEchoToServer(TunnelHeader::TYPE_POLL, 0);
|
||||
setTimeout(maxPolls == 0 ? KEEP_ALIVE_INTERVAL : POLL_INTERVAL);
|
||||
break;
|
||||
case STATE_CLOSED:
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
void Client::run()
|
||||
{
|
||||
now = Time::now();
|
||||
|
||||
sendConnectionRequest();
|
||||
|
||||
Worker::run();
|
||||
}
|
||||
68
client.h
Normal file
68
client.h
Normal file
@ -0,0 +1,68 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 CLIENT_H
|
||||
#define CLIENT_H
|
||||
|
||||
#include "worker.h"
|
||||
#include "auth.h"
|
||||
|
||||
#include <vector>
|
||||
|
||||
class Client : public Worker
|
||||
{
|
||||
public:
|
||||
Client(int tunnelMtu, const char *deviceName, uint32_t serverIp, int maxPolls, const char *passphrase, uid_t uid, gid_t gid);
|
||||
virtual ~Client();
|
||||
|
||||
virtual void run();
|
||||
|
||||
static const Worker::TunnelHeader::Magic magic;
|
||||
protected:
|
||||
enum State
|
||||
{
|
||||
STATE_CLOSED,
|
||||
STATE_CONNECTION_REQUEST_SENT,
|
||||
STATE_CHALLENGE_RESPONSE_SENT,
|
||||
STATE_ESTABLISHED
|
||||
};
|
||||
|
||||
virtual bool handleEchoData(TunnelHeader header, int dataLength, uint32_t realIp, bool reply, int id, int seq);
|
||||
virtual void handleTunData(int dataLength, uint32_t sourceIp, uint32_t destIp);
|
||||
virtual void handleTimeout();
|
||||
|
||||
void handleDataFromServer(int length);
|
||||
|
||||
void startPolling();
|
||||
|
||||
void sendEchoToServer(int type, int dataLength);
|
||||
void sendChallengeResponse(int dataLength);
|
||||
void sendConnectionRequest();
|
||||
|
||||
Auth auth;
|
||||
|
||||
uint32_t serverIp;
|
||||
|
||||
int maxPolls;
|
||||
int pollTimeoutNr;
|
||||
|
||||
State state;
|
||||
};
|
||||
|
||||
#endif
|
||||
27
config.h
Normal file
27
config.h
Normal file
@ -0,0 +1,27 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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/>.
|
||||
*
|
||||
*/
|
||||
|
||||
#define ICMP_ID 57251
|
||||
|
||||
#define MAX_BUFFERED_PACKETS 20
|
||||
|
||||
#define KEEP_ALIVE_INTERVAL (60 * 1000)
|
||||
#define POLL_INTERVAL 2000
|
||||
|
||||
#define CHALLENGE_SIZE 20
|
||||
107
echo.cpp
Normal file
107
echo.cpp
Normal file
@ -0,0 +1,107 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 "echo.h"
|
||||
#include "exception.h"
|
||||
|
||||
#include <netinet/ip.h>
|
||||
|
||||
typedef ip IpHeader;
|
||||
|
||||
Echo::Echo(int maxPayloadSize)
|
||||
{
|
||||
fd = socket(AF_INET, SOCK_RAW, IPPROTO_ICMP);
|
||||
if (fd == -1)
|
||||
throw Exception("creating icmp socket", true);
|
||||
|
||||
bufferSize = maxPayloadSize + headerSize();
|
||||
buffer = new char[bufferSize];
|
||||
}
|
||||
|
||||
Echo::~Echo()
|
||||
{
|
||||
close(fd);
|
||||
delete[] buffer;
|
||||
}
|
||||
|
||||
int Echo::headerSize()
|
||||
{
|
||||
return sizeof(IpHeader) + sizeof(EchoHeader);
|
||||
}
|
||||
|
||||
void Echo::send(int payloadLength, uint32_t realIp, bool reply, int id, int seq)
|
||||
{
|
||||
struct sockaddr_in target;
|
||||
target.sin_family = AF_INET;
|
||||
target.sin_addr.s_addr = htonl(realIp);
|
||||
|
||||
if (payloadLength + sizeof(IpHeader) + sizeof(EchoHeader) > bufferSize)
|
||||
throw Exception("packet too big");
|
||||
|
||||
EchoHeader *header = (EchoHeader *)(buffer + sizeof(IpHeader));
|
||||
header->type = reply ? 0: 8;
|
||||
header->code = 0;
|
||||
header->id = htons(id);
|
||||
header->seq = htons(seq);
|
||||
header->chksum = 0;
|
||||
header->chksum = icmpChecksum(buffer + sizeof(IpHeader), payloadLength + sizeof(EchoHeader));
|
||||
|
||||
int result = sendto(fd, buffer + sizeof(IpHeader), payloadLength + sizeof(EchoHeader), 0, (struct sockaddr *)&target, sizeof(struct sockaddr_in));
|
||||
if (result == -1)
|
||||
throw Exception("sendto", true);
|
||||
}
|
||||
|
||||
int Echo::receive(uint32_t &realIp, bool &reply, int &id, int &seq)
|
||||
{
|
||||
struct sockaddr_in source;
|
||||
int source_addr_len = sizeof(struct sockaddr_in);
|
||||
|
||||
int dataLength = recvfrom(fd, buffer, bufferSize, 0, (struct sockaddr *)&source, (socklen_t *)&source_addr_len);
|
||||
if (dataLength == -1)
|
||||
throw Exception("recvfrom", true);
|
||||
|
||||
if (dataLength < sizeof(IpHeader) + sizeof(EchoHeader))
|
||||
return -1;
|
||||
|
||||
EchoHeader *header = (EchoHeader *)(buffer + sizeof(IpHeader));
|
||||
if ((header->type != 0 && header->type != 8) || header->code != 0)
|
||||
return -1;
|
||||
|
||||
realIp = ntohl(source.sin_addr.s_addr);
|
||||
reply = header->type == 0;
|
||||
id = ntohs(header->id);
|
||||
seq = ntohs(header->seq);
|
||||
|
||||
return dataLength - sizeof(IpHeader) - sizeof(EchoHeader);
|
||||
}
|
||||
|
||||
uint16_t Echo::icmpChecksum(const char *data, int length)
|
||||
{
|
||||
uint16_t *data16 = (uint16_t *)data;
|
||||
uint32_t sum = 0;
|
||||
|
||||
for (sum = 0; length > 1; length -= 2)
|
||||
sum += *data16++;
|
||||
if (length == 1)
|
||||
sum += *(unsigned char *)data16;
|
||||
|
||||
sum = (sum >> 16) + (sum & 0xffff);
|
||||
sum += (sum >> 16);
|
||||
return ~sum;
|
||||
}
|
||||
57
echo.h
Normal file
57
echo.h
Normal file
@ -0,0 +1,57 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 ECHO_H
|
||||
#define ECHO_H
|
||||
|
||||
#include <string>
|
||||
#include <stdint.h>
|
||||
|
||||
class Echo
|
||||
{
|
||||
public:
|
||||
Echo(int maxPayloadSize);
|
||||
~Echo();
|
||||
|
||||
int getFd() { return fd; }
|
||||
|
||||
void send(int payloadLength, uint32_t realIp, bool reply, int id, int seq);
|
||||
int receive(uint32_t &realIp, bool &reply, int &id, int &seq);
|
||||
|
||||
char *payloadBuffer() { return buffer + headerSize(); }
|
||||
|
||||
static int headerSize();
|
||||
protected:
|
||||
struct EchoHeader
|
||||
{
|
||||
uint8_t type;
|
||||
uint8_t code;
|
||||
uint16_t chksum;
|
||||
uint16_t id;
|
||||
uint16_t seq;
|
||||
}; // size = 8
|
||||
|
||||
uint16_t icmpChecksum(const char *data, int length);
|
||||
|
||||
int fd;
|
||||
int bufferSize;
|
||||
char *buffer;
|
||||
};
|
||||
|
||||
#endif
|
||||
38
exception.cpp
Normal file
38
exception.cpp
Normal file
@ -0,0 +1,38 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 "exception.h"
|
||||
|
||||
#include <errno.h>
|
||||
#include <string.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
Exception::Exception(const char *msg)
|
||||
{
|
||||
this->msg = msg;
|
||||
}
|
||||
|
||||
Exception::Exception(const char *msg, bool appendSystemError)
|
||||
{
|
||||
if (appendSystemError)
|
||||
this->msg = string(msg) + ": " + strerror(errno);
|
||||
else
|
||||
this->msg = msg;
|
||||
}
|
||||
31
exception.h
Normal file
31
exception.h
Normal file
@ -0,0 +1,31 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 <string>
|
||||
|
||||
class Exception
|
||||
{
|
||||
public:
|
||||
Exception(const char *msg);
|
||||
Exception(const char *msg, bool appendSystemError);
|
||||
|
||||
const char *errorMessage() const { return msg.c_str(); }
|
||||
protected:
|
||||
std::string msg;
|
||||
};
|
||||
674
gpl.txt
Normal file
674
gpl.txt
Normal 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>.
|
||||
178
main.cpp
Normal file
178
main.cpp
Normal file
@ -0,0 +1,178 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 "client.h"
|
||||
#include "server.h"
|
||||
#include "exception.h"
|
||||
|
||||
#include <stdio.h>
|
||||
#include <arpa/inet.h>
|
||||
#include <pwd.h>
|
||||
#include <netdb.h>
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <errno.h>
|
||||
#include <syslog.h>
|
||||
|
||||
void usage()
|
||||
{
|
||||
printf(
|
||||
"usage: hans -s network [-fhr] [-p password] [-u unprivileged_user] [-d tun_device] [-m mtu]\n"
|
||||
" hans -c server [-fhw] [-p password] [-u unprivileged_user] [-d tun_device] [-m mtu]\n");
|
||||
}
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
const char *serverName;
|
||||
const char *userName = NULL;
|
||||
const char *password = "";
|
||||
const char *device = NULL;
|
||||
bool isServer = false;
|
||||
bool isClient = false;
|
||||
bool foreground = false;
|
||||
int mtu = 1500;
|
||||
int maxPolls = 10;
|
||||
uint32_t network = INADDR_NONE;
|
||||
bool answerPing = false;
|
||||
uid_t uid = 0;
|
||||
gid_t gid = 0;
|
||||
|
||||
openlog(argv[0], LOG_PERROR, LOG_DAEMON);
|
||||
|
||||
int c;
|
||||
while ((c = getopt(argc, argv, "fhru:d:p:s:c:m:w:")) != -1)
|
||||
{
|
||||
switch(c) {
|
||||
case 'f':
|
||||
foreground = true;
|
||||
break;
|
||||
case 'h':
|
||||
usage();
|
||||
return 0;
|
||||
case 'u':
|
||||
userName = optarg;
|
||||
break;
|
||||
case 'd':
|
||||
device = optarg;
|
||||
break;
|
||||
case 'p':
|
||||
password = strdup(optarg);
|
||||
memset(optarg, 0, strlen(optarg));
|
||||
break;
|
||||
case 'c':
|
||||
isClient = true;
|
||||
serverName = optarg;
|
||||
break;
|
||||
case 's':
|
||||
isServer = true;
|
||||
network = ntohl(inet_addr(optarg));
|
||||
break;
|
||||
case 'm':
|
||||
mtu = atoi(optarg);
|
||||
break;
|
||||
case 'w':
|
||||
maxPolls = atoi(optarg);
|
||||
break;
|
||||
case 'r':
|
||||
answerPing = true;
|
||||
break;
|
||||
default:
|
||||
usage();
|
||||
return 1;
|
||||
}
|
||||
}
|
||||
|
||||
mtu -= Echo::headerSize() + Worker::headerSize();
|
||||
|
||||
if (isClient == isServer)
|
||||
{
|
||||
usage();
|
||||
return 1;
|
||||
}
|
||||
|
||||
if (network == INADDR_NONE && isServer)
|
||||
{
|
||||
usage();
|
||||
return 1;
|
||||
}
|
||||
|
||||
if (maxPolls < 0 || maxPolls > 255)
|
||||
{
|
||||
usage();
|
||||
return 1;
|
||||
}
|
||||
|
||||
if (userName != NULL)
|
||||
{
|
||||
passwd *pw = getpwnam(userName);
|
||||
|
||||
if (pw != NULL)
|
||||
{
|
||||
uid = pw->pw_uid;
|
||||
gid = pw->pw_gid;
|
||||
}
|
||||
else
|
||||
{
|
||||
syslog(LOG_ERR, "user not found");
|
||||
return 1;
|
||||
}
|
||||
}
|
||||
|
||||
try
|
||||
{
|
||||
Worker *worker;
|
||||
|
||||
if (isServer)
|
||||
{
|
||||
worker = new Server(mtu, device, password, network, answerPing, uid, gid, 5000);
|
||||
}
|
||||
else
|
||||
{
|
||||
uint32_t serverIp = inet_addr(serverName);
|
||||
if (serverIp == INADDR_NONE)
|
||||
{
|
||||
struct hostent* he = gethostbyname(serverName);
|
||||
if (!he)
|
||||
{
|
||||
syslog(LOG_ERR, "gethostbyname: %s", hstrerror(h_errno));
|
||||
return 1;
|
||||
}
|
||||
|
||||
serverIp = *(uint32_t *)he->h_addr;
|
||||
}
|
||||
|
||||
worker = new Client(mtu, device, ntohl(serverIp), maxPolls, password, uid, gid);
|
||||
}
|
||||
|
||||
if (!foreground)
|
||||
{
|
||||
syslog(LOG_INFO, "detaching from terminal");
|
||||
daemon(0, 0);
|
||||
}
|
||||
|
||||
worker->run();
|
||||
}
|
||||
catch (Exception e)
|
||||
{
|
||||
syslog(LOG_ERR, "%s", e.errorMessage());
|
||||
return 1;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
338
server.cpp
Normal file
338
server.cpp
Normal file
@ -0,0 +1,338 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 "server.h"
|
||||
#include "client.h"
|
||||
#include "config.h"
|
||||
#include "utility.h"
|
||||
|
||||
#include <string.h>
|
||||
#include <arpa/inet.h>
|
||||
#include <syslog.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
//#define DEBUG_ONLY(a) a
|
||||
#define DEBUG_ONLY(a)
|
||||
|
||||
const Worker::TunnelHeader::Magic Server::magic("9973");
|
||||
|
||||
Server::Server(int tunnelMtu, const char *deviceName, const char *passphrase, uint32_t network, bool answerEcho, uid_t uid, gid_t gid, int pollTimeout)
|
||||
: Worker(tunnelMtu, deviceName, answerEcho, uid, gid), auth(passphrase)
|
||||
{
|
||||
this->network = network & 0xffffff00;
|
||||
this->pollTimeout = pollTimeout;
|
||||
|
||||
tun->setIp(this->network + 1);
|
||||
|
||||
dropPrivileges();
|
||||
}
|
||||
|
||||
Server::~Server()
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
void Server::handleUnknownClient(TunnelHeader &header, int dataLength, uint32_t realIp)
|
||||
{
|
||||
ClientData client;
|
||||
client.realIp = realIp;
|
||||
client.maxPolls = 0;
|
||||
|
||||
// if (header.type == TunnelHeader::TYPE_POLL)
|
||||
// return;
|
||||
|
||||
if (header.type != TunnelHeader::TYPE_CONNECTION_REQUEST || dataLength != sizeof(ClientConnectData))
|
||||
{
|
||||
syslog(LOG_DEBUG, "invalid request %s", Utility::formatIp(realIp).c_str());
|
||||
sendReset(&client);
|
||||
return;
|
||||
}
|
||||
|
||||
pollReceived(&client);
|
||||
|
||||
ClientConnectData *connectData = (ClientConnectData *)payloadBuffer();
|
||||
|
||||
client.maxPolls = connectData->maxPolls;
|
||||
client.state = ClientData::STATE_NEW;
|
||||
client.tunnelIp = reserveTunnelIp();
|
||||
|
||||
syslog(LOG_DEBUG, "new client: %s (%s)\n", Utility::formatIp(client.realIp).c_str(), Utility::formatIp(client.tunnelIp).c_str());
|
||||
|
||||
if (client.tunnelIp != 0)
|
||||
{
|
||||
client.challenge = auth.generateChallenge(CHALLENGE_SIZE);
|
||||
sendChallenge(&client);
|
||||
|
||||
// add client to list
|
||||
clientList.push_back(client);
|
||||
clientRealIpMap[realIp] = clientList.size() - 1;
|
||||
clientTunnelIpMap[client.tunnelIp] = clientList.size() - 1;
|
||||
}
|
||||
else
|
||||
{
|
||||
syslog(LOG_WARNING, "server full");
|
||||
sendEchoToClient(&client, TunnelHeader::TYPE_SERVER_FULL, 0);
|
||||
}
|
||||
}
|
||||
|
||||
void Server::sendChallenge(ClientData *client)
|
||||
{
|
||||
syslog(LOG_DEBUG, "sending challenge to: %s\n", Utility::formatIp(client->realIp).c_str());
|
||||
|
||||
memcpy(payloadBuffer(), &client->challenge[0], client->challenge.size());
|
||||
sendEchoToClient(client, TunnelHeader::TYPE_CHALLENGE, client->challenge.size());
|
||||
|
||||
client->state = ClientData::STATE_CHALLENGE_SENT;
|
||||
}
|
||||
|
||||
void Server::removeClient(ClientData *client)
|
||||
{
|
||||
syslog(LOG_DEBUG, "removing client: %s (%s)\n", Utility::formatIp(client->realIp).c_str(), Utility::formatIp(client->tunnelIp).c_str());
|
||||
|
||||
releaseTunnelIp(client->tunnelIp);
|
||||
|
||||
int nr = clientRealIpMap[client->realIp];
|
||||
|
||||
clientRealIpMap.erase(client->realIp);
|
||||
clientTunnelIpMap.erase(client->tunnelIp);
|
||||
|
||||
clientList.erase(clientList.begin() + nr);
|
||||
}
|
||||
|
||||
void Server::checkChallenge(ClientData *client, int length)
|
||||
{
|
||||
Auth::Response rightResponse = auth.getResponse(client->challenge);
|
||||
|
||||
if (length != sizeof(Auth::Response) || memcmp(&rightResponse, payloadBuffer(), length) != 0)
|
||||
{
|
||||
syslog(LOG_DEBUG, "wrong challenge response\n");
|
||||
|
||||
sendEchoToClient(client, TunnelHeader::TYPE_CHALLENGE_ERROR, 0);
|
||||
|
||||
removeClient(client);
|
||||
return;
|
||||
}
|
||||
|
||||
uint32_t *ip = (uint32_t *)payloadBuffer();
|
||||
*ip = htonl(client->tunnelIp);
|
||||
|
||||
sendEchoToClient(client, TunnelHeader::TYPE_CONNECTION_ACCEPT, sizeof(uint32_t));
|
||||
|
||||
client->state = ClientData::STATE_ESTABLISHED;
|
||||
|
||||
syslog(LOG_INFO, "connection established: %s", Utility::formatIp(client->realIp).c_str());
|
||||
}
|
||||
|
||||
void Server::sendReset(ClientData *client)
|
||||
{
|
||||
syslog(LOG_DEBUG, "sending reset: %s", Utility::formatIp(client->realIp).c_str());
|
||||
sendEchoToClient(client, TunnelHeader::TYPE_RESET_CONNECTION, 0);
|
||||
}
|
||||
|
||||
bool Server::handleEchoData(TunnelHeader header, int dataLength, uint32_t realIp, bool reply, int id, int seq)
|
||||
{
|
||||
if (reply || id != ICMP_ID)
|
||||
return false;
|
||||
|
||||
if (header.magic != Client::magic)
|
||||
return false;
|
||||
|
||||
ClientData *client = getClientByRealIp(realIp);
|
||||
if (client == NULL)
|
||||
{
|
||||
handleUnknownClient(header, dataLength, realIp);
|
||||
return true;
|
||||
}
|
||||
|
||||
pollReceived(client);
|
||||
|
||||
switch (header.type)
|
||||
{
|
||||
case TunnelHeader::TYPE_CONNECTION_REQUEST:
|
||||
if (client->state == ClientData::STATE_CHALLENGE_SENT)
|
||||
{
|
||||
sendChallenge(client);
|
||||
return true;
|
||||
}
|
||||
|
||||
syslog(LOG_DEBUG, "reconnecting %s", Utility::formatIp(realIp).c_str());
|
||||
sendReset(client);
|
||||
removeClient(client);
|
||||
return true;
|
||||
case TunnelHeader::TYPE_CHALLENGE_RESPONSE:
|
||||
if (client->state == ClientData::STATE_CHALLENGE_SENT)
|
||||
{
|
||||
checkChallenge(client, dataLength);
|
||||
return true;
|
||||
}
|
||||
break;
|
||||
case TunnelHeader::TYPE_DATA:
|
||||
if (client->state == ClientData::STATE_ESTABLISHED)
|
||||
{
|
||||
sendToTun(dataLength);
|
||||
return true;
|
||||
}
|
||||
break;
|
||||
case TunnelHeader::TYPE_POLL:
|
||||
return true;
|
||||
}
|
||||
|
||||
syslog(LOG_DEBUG, "invalid packet from: %s, type: %d, state:\n", Utility::formatIp(realIp).c_str(), header.type, client->state);
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
Server::ClientData *Server::getClientByTunnelIp(uint32_t ip)
|
||||
{
|
||||
ClientIpMap::iterator clientMapIterator = clientTunnelIpMap.find(ip);
|
||||
if (clientMapIterator == clientTunnelIpMap.end())
|
||||
return NULL;
|
||||
|
||||
return &clientList[clientMapIterator->second];
|
||||
}
|
||||
|
||||
Server::ClientData *Server::getClientByRealIp(uint32_t ip)
|
||||
{
|
||||
ClientIpMap::iterator clientMapIterator = clientRealIpMap.find(ip);
|
||||
if (clientMapIterator == clientRealIpMap.end())
|
||||
return NULL;
|
||||
|
||||
return &clientList[clientMapIterator->second];
|
||||
}
|
||||
|
||||
void Server::handleTunData(int dataLength, uint32_t sourceIp, uint32_t destIp)
|
||||
{
|
||||
ClientData *client = getClientByTunnelIp(destIp);
|
||||
|
||||
if (client == NULL)
|
||||
{
|
||||
syslog(LOG_DEBUG, "unknown client: %s\n", Utility::formatIp(destIp).c_str());
|
||||
return;
|
||||
}
|
||||
|
||||
sendEchoToClient(client, TunnelHeader::TYPE_DATA, dataLength);
|
||||
}
|
||||
|
||||
void Server::pollReceived(ClientData *client)
|
||||
{
|
||||
unsigned int maxSavedPolls = client->maxPolls != 0 ? client->maxPolls : 1;
|
||||
|
||||
client->pollTimes.push(now);
|
||||
if (client->pollTimes.size() > maxSavedPolls)
|
||||
client->pollTimes.pop();
|
||||
DEBUG_ONLY(printf("poll -> %d\n", client->pollTimes.size()));
|
||||
|
||||
if (client->pendingPackets.size() > 0)
|
||||
{
|
||||
Packet &packet = client->pendingPackets.front();
|
||||
memcpy(payloadBuffer(), &packet.data[0], packet.data.size());
|
||||
client->pendingPackets.pop();
|
||||
|
||||
DEBUG_ONLY(printf("pending packet: %d bytes\n", packet.data.size()));
|
||||
sendEchoToClient(client, packet.type, packet.data.size());
|
||||
}
|
||||
|
||||
client->lastActivity = now;
|
||||
}
|
||||
|
||||
void Server::sendEchoToClient(ClientData *client, int type, int dataLength)
|
||||
{
|
||||
if (client->maxPolls == 0)
|
||||
{
|
||||
sendEcho(magic, type, dataLength, client->realIp, true, ICMP_ID, 0);
|
||||
return;
|
||||
}
|
||||
|
||||
while (client->pollTimes.size() != 0)
|
||||
{
|
||||
Time pollTime = client->pollTimes.front();
|
||||
client->pollTimes.pop();
|
||||
|
||||
if (pollTime + POLL_INTERVAL * (client->maxPolls + 1) > now)
|
||||
{
|
||||
DEBUG_ONLY(printf("sending -> %d\n", client->pollTimes.size()));
|
||||
sendEcho(magic, type, dataLength, client->realIp, true, ICMP_ID, 0);
|
||||
return;
|
||||
}
|
||||
}
|
||||
DEBUG_ONLY(printf("queuing -> %d\n", client->pollTimes.size()));
|
||||
|
||||
if (client->pendingPackets.size() == MAX_BUFFERED_PACKETS)
|
||||
{
|
||||
client->pendingPackets.pop();
|
||||
syslog(LOG_WARNING, "packet dropped to %s", Utility::formatIp(client->tunnelIp).c_str());
|
||||
}
|
||||
|
||||
DEBUG_ONLY(printf("packet queued: %d bytes\n", dataLength));
|
||||
|
||||
client->pendingPackets.push(Packet());
|
||||
Packet &packet = client->pendingPackets.back();
|
||||
packet.type = type;
|
||||
packet.data.resize(dataLength);
|
||||
memcpy(&packet.data[0], payloadBuffer(), dataLength);
|
||||
}
|
||||
|
||||
void Server::releaseTunnelIp(uint32_t tunnelIp)
|
||||
{
|
||||
usedIps.remove(tunnelIp);
|
||||
}
|
||||
|
||||
void Server::handleTimeout()
|
||||
{
|
||||
for (int i = 0; i < clientList.size(); i++)
|
||||
{
|
||||
ClientData *client = &clientList[i];
|
||||
|
||||
if (client->lastActivity + KEEP_ALIVE_INTERVAL * 2 < now)
|
||||
{
|
||||
syslog(LOG_DEBUG, "client timeout: %s\n", Utility::formatIp(client->realIp).c_str());
|
||||
removeClient(client);
|
||||
i--;
|
||||
}
|
||||
}
|
||||
|
||||
setTimeout(KEEP_ALIVE_INTERVAL);
|
||||
}
|
||||
|
||||
uint32_t Server::reserveTunnelIp()
|
||||
{
|
||||
uint32_t ip = network + 2;
|
||||
|
||||
list<uint32_t>::iterator i;
|
||||
for (i = usedIps.begin(); i != usedIps.end(); ++i)
|
||||
{
|
||||
if (*i > ip)
|
||||
break;
|
||||
ip = ip + 1;
|
||||
}
|
||||
|
||||
if (ip - network >= 255)
|
||||
return 0;
|
||||
|
||||
usedIps.insert(i, ip);
|
||||
return ip;
|
||||
}
|
||||
|
||||
void Server::run()
|
||||
{
|
||||
setTimeout(KEEP_ALIVE_INTERVAL);
|
||||
|
||||
Worker::run();
|
||||
}
|
||||
114
server.h
Normal file
114
server.h
Normal file
@ -0,0 +1,114 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 SERVER_H
|
||||
#define SERVER_H
|
||||
|
||||
#include "worker.h"
|
||||
#include "auth.h"
|
||||
|
||||
#include <map>
|
||||
#include <queue>
|
||||
#include <vector>
|
||||
#include <list>
|
||||
|
||||
class Server : public Worker
|
||||
{
|
||||
public:
|
||||
Server(int tunnelMtu, const char *deviceName, const char *passphrase, uint32_t network, bool answerEcho, uid_t uid, gid_t gid, int pollTimeout);
|
||||
virtual ~Server();
|
||||
|
||||
struct ClientConnectData
|
||||
{
|
||||
uint8_t maxPolls;
|
||||
};
|
||||
|
||||
static const Worker::TunnelHeader::Magic magic;
|
||||
|
||||
protected:
|
||||
struct Packet
|
||||
{
|
||||
int type;
|
||||
std::vector<char> data;
|
||||
};
|
||||
|
||||
struct ClientData
|
||||
{
|
||||
enum State
|
||||
{
|
||||
STATE_NEW,
|
||||
STATE_CHALLENGE_SENT,
|
||||
STATE_ESTABLISHED
|
||||
};
|
||||
|
||||
uint32_t realIp;
|
||||
uint32_t tunnelIp;
|
||||
|
||||
std::queue<Packet> pendingPackets;
|
||||
|
||||
int maxPolls;
|
||||
std::queue<Time> pollTimes;
|
||||
Time lastActivity;
|
||||
|
||||
State state;
|
||||
|
||||
Auth::Challenge challenge;
|
||||
};
|
||||
|
||||
typedef std::vector<ClientData> ClientList;
|
||||
typedef std::map<uint32_t, int> ClientIpMap;
|
||||
|
||||
virtual bool handleEchoData(TunnelHeader header, int dataLength, uint32_t realIp, bool reply, int id, int seq);
|
||||
virtual void handleTunData(int dataLength, uint32_t sourceIp, uint32_t destIp);
|
||||
virtual void handleTimeout();
|
||||
|
||||
virtual void run();
|
||||
|
||||
void serveTun(ClientData *client);
|
||||
|
||||
void handleUnknownClient(TunnelHeader &header, int dataLength, uint32_t realIp);
|
||||
void removeClient(ClientData *client);
|
||||
|
||||
void sendChallenge(ClientData *client);
|
||||
void checkChallenge(ClientData *client, int dataLength);
|
||||
void sendReset(ClientData *client);
|
||||
|
||||
void sendEchoToClient(ClientData *client, int type, int dataLength);
|
||||
|
||||
void pollReceived(ClientData *client);
|
||||
|
||||
uint32_t reserveTunnelIp();
|
||||
void releaseTunnelIp(uint32_t tunnelIp);
|
||||
|
||||
ClientData *getClientByTunnelIp(uint32_t ip);
|
||||
ClientData *getClientByRealIp(uint32_t ip);
|
||||
|
||||
Auth auth;
|
||||
|
||||
uint32_t network;
|
||||
std::list<uint32_t> usedIps;
|
||||
|
||||
Time pollTimeout;
|
||||
|
||||
ClientList clientList;
|
||||
ClientIpMap clientRealIpMap;
|
||||
ClientIpMap clientTunnelIpMap;
|
||||
};
|
||||
|
||||
#endif
|
||||
14
sha1 license.txt
Normal file
14
sha1 license.txt
Normal file
@ -0,0 +1,14 @@
|
||||
Copyright (C) 1998, 2009
|
||||
Paul E. Jones <paulej@packetizer.com>
|
||||
|
||||
Freeware Public License (FPL)
|
||||
|
||||
This software is licensed as "freeware." Permission to distribute
|
||||
this software in source and binary forms, including incorporation
|
||||
into other products, is hereby granted without a fee. THIS SOFTWARE
|
||||
IS PROVIDED 'AS IS' AND WITHOUT ANY EXPRESSED OR IMPLIED WARRANTIES,
|
||||
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
|
||||
AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHOR SHALL NOT BE HELD
|
||||
LIABLE FOR ANY DAMAGES RESULTING FROM THE USE OF THIS SOFTWARE, EITHER
|
||||
DIRECTLY OR INDIRECTLY, INCLUDING, BUT NOT LIMITED TO, LOSS OF DATA
|
||||
OR DATA BEING RENDERED INACCURATE.
|
||||
589
sha1.cpp
Normal file
589
sha1.cpp
Normal file
@ -0,0 +1,589 @@
|
||||
/*
|
||||
* sha1.cpp
|
||||
*
|
||||
* Copyright (C) 1998, 2009
|
||||
* Paul E. Jones <paulej@packetizer.com>
|
||||
* All Rights Reserved.
|
||||
*
|
||||
*****************************************************************************
|
||||
* $Id: sha1.cpp 12 2009-06-22 19:34:25Z paulej $
|
||||
*****************************************************************************
|
||||
*
|
||||
* Description:
|
||||
* This class implements the Secure Hashing Standard as defined
|
||||
* in FIPS PUB 180-1 published April 17, 1995.
|
||||
*
|
||||
* The Secure Hashing Standard, which uses the Secure Hashing
|
||||
* Algorithm (SHA), produces a 160-bit message digest for a
|
||||
* given data stream. In theory, it is highly improbable that
|
||||
* two messages will produce the same message digest. Therefore,
|
||||
* this algorithm can serve as a means of providing a "fingerprint"
|
||||
* for a message.
|
||||
*
|
||||
* Portability Issues:
|
||||
* SHA-1 is defined in terms of 32-bit "words". This code was
|
||||
* written with the expectation that the processor has at least
|
||||
* a 32-bit machine word size. If the machine word size is larger,
|
||||
* the code should still function properly. One caveat to that
|
||||
* is that the input functions taking characters and character arrays
|
||||
* assume that only 8 bits of information are stored in each character.
|
||||
*
|
||||
* Caveats:
|
||||
* SHA-1 is designed to work with messages less than 2^64 bits long.
|
||||
* Although SHA-1 allows a message digest to be generated for
|
||||
* messages of any number of bits less than 2^64, this implementation
|
||||
* only works with messages with a length that is a multiple of 8
|
||||
* bits.
|
||||
*
|
||||
*/
|
||||
|
||||
|
||||
#include "sha1.h"
|
||||
|
||||
/*
|
||||
* SHA1
|
||||
*
|
||||
* Description:
|
||||
* This is the constructor for the sha1 class.
|
||||
*
|
||||
* Parameters:
|
||||
* None.
|
||||
*
|
||||
* Returns:
|
||||
* Nothing.
|
||||
*
|
||||
* Comments:
|
||||
*
|
||||
*/
|
||||
SHA1::SHA1()
|
||||
{
|
||||
Reset();
|
||||
}
|
||||
|
||||
/*
|
||||
* ~SHA1
|
||||
*
|
||||
* Description:
|
||||
* This is the destructor for the sha1 class
|
||||
*
|
||||
* Parameters:
|
||||
* None.
|
||||
*
|
||||
* Returns:
|
||||
* Nothing.
|
||||
*
|
||||
* Comments:
|
||||
*
|
||||
*/
|
||||
SHA1::~SHA1()
|
||||
{
|
||||
// The destructor does nothing
|
||||
}
|
||||
|
||||
/*
|
||||
* Reset
|
||||
*
|
||||
* Description:
|
||||
* This function will initialize the sha1 class member variables
|
||||
* in preparation for computing a new message digest.
|
||||
*
|
||||
* Parameters:
|
||||
* None.
|
||||
*
|
||||
* Returns:
|
||||
* Nothing.
|
||||
*
|
||||
* Comments:
|
||||
*
|
||||
*/
|
||||
void SHA1::Reset()
|
||||
{
|
||||
Length_Low = 0;
|
||||
Length_High = 0;
|
||||
Message_Block_Index = 0;
|
||||
|
||||
H[0] = 0x67452301;
|
||||
H[1] = 0xEFCDAB89;
|
||||
H[2] = 0x98BADCFE;
|
||||
H[3] = 0x10325476;
|
||||
H[4] = 0xC3D2E1F0;
|
||||
|
||||
Computed = false;
|
||||
Corrupted = false;
|
||||
}
|
||||
|
||||
/*
|
||||
* Result
|
||||
*
|
||||
* Description:
|
||||
* This function will return the 160-bit message digest into the
|
||||
* array provided.
|
||||
*
|
||||
* Parameters:
|
||||
* message_digest_array: [out]
|
||||
* This is an array of five unsigned integers which will be filled
|
||||
* with the message digest that has been computed.
|
||||
*
|
||||
* Returns:
|
||||
* True if successful, false if it failed.
|
||||
*
|
||||
* Comments:
|
||||
*
|
||||
*/
|
||||
bool SHA1::Result(unsigned *message_digest_array)
|
||||
{
|
||||
int i; // Counter
|
||||
|
||||
if (Corrupted)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
if (!Computed)
|
||||
{
|
||||
PadMessage();
|
||||
Computed = true;
|
||||
}
|
||||
|
||||
for(i = 0; i < 5; i++)
|
||||
{
|
||||
message_digest_array[i] = H[i];
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
/*
|
||||
* Input
|
||||
*
|
||||
* Description:
|
||||
* This function accepts an array of octets as the next portion of
|
||||
* the message.
|
||||
*
|
||||
* Parameters:
|
||||
* message_array: [in]
|
||||
* An array of characters representing the next portion of the
|
||||
* message.
|
||||
*
|
||||
* Returns:
|
||||
* Nothing.
|
||||
*
|
||||
* Comments:
|
||||
*
|
||||
*/
|
||||
void SHA1::Input( const unsigned char *message_array,
|
||||
unsigned length)
|
||||
{
|
||||
if (!length)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
if (Computed || Corrupted)
|
||||
{
|
||||
Corrupted = true;
|
||||
return;
|
||||
}
|
||||
|
||||
while(length-- && !Corrupted)
|
||||
{
|
||||
Message_Block[Message_Block_Index++] = (*message_array & 0xFF);
|
||||
|
||||
Length_Low += 8;
|
||||
Length_Low &= 0xFFFFFFFF; // Force it to 32 bits
|
||||
if (Length_Low == 0)
|
||||
{
|
||||
Length_High++;
|
||||
Length_High &= 0xFFFFFFFF; // Force it to 32 bits
|
||||
if (Length_High == 0)
|
||||
{
|
||||
Corrupted = true; // Message is too long
|
||||
}
|
||||
}
|
||||
|
||||
if (Message_Block_Index == 64)
|
||||
{
|
||||
ProcessMessageBlock();
|
||||
}
|
||||
|
||||
message_array++;
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Input
|
||||
*
|
||||
* Description:
|
||||
* This function accepts an array of octets as the next portion of
|
||||
* the message.
|
||||
*
|
||||
* Parameters:
|
||||
* message_array: [in]
|
||||
* An array of characters representing the next portion of the
|
||||
* message.
|
||||
* length: [in]
|
||||
* The length of the message_array
|
||||
*
|
||||
* Returns:
|
||||
* Nothing.
|
||||
*
|
||||
* Comments:
|
||||
*
|
||||
*/
|
||||
void SHA1::Input( const char *message_array,
|
||||
unsigned length)
|
||||
{
|
||||
Input((unsigned char *) message_array, length);
|
||||
}
|
||||
|
||||
/*
|
||||
* Input
|
||||
*
|
||||
* Description:
|
||||
* This function accepts a single octets as the next message element.
|
||||
*
|
||||
* Parameters:
|
||||
* message_element: [in]
|
||||
* The next octet in the message.
|
||||
*
|
||||
* Returns:
|
||||
* Nothing.
|
||||
*
|
||||
* Comments:
|
||||
*
|
||||
*/
|
||||
void SHA1::Input(unsigned char message_element)
|
||||
{
|
||||
Input(&message_element, 1);
|
||||
}
|
||||
|
||||
/*
|
||||
* Input
|
||||
*
|
||||
* Description:
|
||||
* This function accepts a single octet as the next message element.
|
||||
*
|
||||
* Parameters:
|
||||
* message_element: [in]
|
||||
* The next octet in the message.
|
||||
*
|
||||
* Returns:
|
||||
* Nothing.
|
||||
*
|
||||
* Comments:
|
||||
*
|
||||
*/
|
||||
void SHA1::Input(char message_element)
|
||||
{
|
||||
Input((unsigned char *) &message_element, 1);
|
||||
}
|
||||
|
||||
/*
|
||||
* operator<<
|
||||
*
|
||||
* Description:
|
||||
* This operator makes it convenient to provide character strings to
|
||||
* the SHA1 object for processing.
|
||||
*
|
||||
* Parameters:
|
||||
* message_array: [in]
|
||||
* The character array to take as input.
|
||||
*
|
||||
* Returns:
|
||||
* A reference to the SHA1 object.
|
||||
*
|
||||
* Comments:
|
||||
* Each character is assumed to hold 8 bits of information.
|
||||
*
|
||||
*/
|
||||
SHA1& SHA1::operator<<(const char *message_array)
|
||||
{
|
||||
const char *p = message_array;
|
||||
|
||||
while(*p)
|
||||
{
|
||||
Input(*p);
|
||||
p++;
|
||||
}
|
||||
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* operator<<
|
||||
*
|
||||
* Description:
|
||||
* This operator makes it convenient to provide character strings to
|
||||
* the SHA1 object for processing.
|
||||
*
|
||||
* Parameters:
|
||||
* message_array: [in]
|
||||
* The character array to take as input.
|
||||
*
|
||||
* Returns:
|
||||
* A reference to the SHA1 object.
|
||||
*
|
||||
* Comments:
|
||||
* Each character is assumed to hold 8 bits of information.
|
||||
*
|
||||
*/
|
||||
SHA1& SHA1::operator<<(const unsigned char *message_array)
|
||||
{
|
||||
const unsigned char *p = message_array;
|
||||
|
||||
while(*p)
|
||||
{
|
||||
Input(*p);
|
||||
p++;
|
||||
}
|
||||
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* operator<<
|
||||
*
|
||||
* Description:
|
||||
* This function provides the next octet in the message.
|
||||
*
|
||||
* Parameters:
|
||||
* message_element: [in]
|
||||
* The next octet in the message
|
||||
*
|
||||
* Returns:
|
||||
* A reference to the SHA1 object.
|
||||
*
|
||||
* Comments:
|
||||
* The character is assumed to hold 8 bits of information.
|
||||
*
|
||||
*/
|
||||
SHA1& SHA1::operator<<(const char message_element)
|
||||
{
|
||||
Input((unsigned char *) &message_element, 1);
|
||||
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* operator<<
|
||||
*
|
||||
* Description:
|
||||
* This function provides the next octet in the message.
|
||||
*
|
||||
* Parameters:
|
||||
* message_element: [in]
|
||||
* The next octet in the message
|
||||
*
|
||||
* Returns:
|
||||
* A reference to the SHA1 object.
|
||||
*
|
||||
* Comments:
|
||||
* The character is assumed to hold 8 bits of information.
|
||||
*
|
||||
*/
|
||||
SHA1& SHA1::operator<<(const unsigned char message_element)
|
||||
{
|
||||
Input(&message_element, 1);
|
||||
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* ProcessMessageBlock
|
||||
*
|
||||
* Description:
|
||||
* This function will process the next 512 bits of the message
|
||||
* stored in the Message_Block array.
|
||||
*
|
||||
* Parameters:
|
||||
* None.
|
||||
*
|
||||
* Returns:
|
||||
* Nothing.
|
||||
*
|
||||
* Comments:
|
||||
* Many of the variable names in this function, especially the single
|
||||
* character names, were used because those were the names used
|
||||
* in the publication.
|
||||
*
|
||||
*/
|
||||
void SHA1::ProcessMessageBlock()
|
||||
{
|
||||
const unsigned K[] = { // Constants defined for SHA-1
|
||||
0x5A827999,
|
||||
0x6ED9EBA1,
|
||||
0x8F1BBCDC,
|
||||
0xCA62C1D6
|
||||
};
|
||||
int t; // Loop counter
|
||||
unsigned temp; // Temporary word value
|
||||
unsigned W[80]; // Word sequence
|
||||
unsigned A, B, C, D, E; // Word buffers
|
||||
|
||||
/*
|
||||
* Initialize the first 16 words in the array W
|
||||
*/
|
||||
for(t = 0; t < 16; t++)
|
||||
{
|
||||
W[t] = ((unsigned) Message_Block[t * 4]) << 24;
|
||||
W[t] |= ((unsigned) Message_Block[t * 4 + 1]) << 16;
|
||||
W[t] |= ((unsigned) Message_Block[t * 4 + 2]) << 8;
|
||||
W[t] |= ((unsigned) Message_Block[t * 4 + 3]);
|
||||
}
|
||||
|
||||
for(t = 16; t < 80; t++)
|
||||
{
|
||||
W[t] = CircularShift(1,W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16]);
|
||||
}
|
||||
|
||||
A = H[0];
|
||||
B = H[1];
|
||||
C = H[2];
|
||||
D = H[3];
|
||||
E = H[4];
|
||||
|
||||
for(t = 0; t < 20; t++)
|
||||
{
|
||||
temp = CircularShift(5,A) + ((B & C) | ((~B) & D)) + E + W[t] + K[0];
|
||||
temp &= 0xFFFFFFFF;
|
||||
E = D;
|
||||
D = C;
|
||||
C = CircularShift(30,B);
|
||||
B = A;
|
||||
A = temp;
|
||||
}
|
||||
|
||||
for(t = 20; t < 40; t++)
|
||||
{
|
||||
temp = CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[1];
|
||||
temp &= 0xFFFFFFFF;
|
||||
E = D;
|
||||
D = C;
|
||||
C = CircularShift(30,B);
|
||||
B = A;
|
||||
A = temp;
|
||||
}
|
||||
|
||||
for(t = 40; t < 60; t++)
|
||||
{
|
||||
temp = CircularShift(5,A) +
|
||||
((B & C) | (B & D) | (C & D)) + E + W[t] + K[2];
|
||||
temp &= 0xFFFFFFFF;
|
||||
E = D;
|
||||
D = C;
|
||||
C = CircularShift(30,B);
|
||||
B = A;
|
||||
A = temp;
|
||||
}
|
||||
|
||||
for(t = 60; t < 80; t++)
|
||||
{
|
||||
temp = CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[3];
|
||||
temp &= 0xFFFFFFFF;
|
||||
E = D;
|
||||
D = C;
|
||||
C = CircularShift(30,B);
|
||||
B = A;
|
||||
A = temp;
|
||||
}
|
||||
|
||||
H[0] = (H[0] + A) & 0xFFFFFFFF;
|
||||
H[1] = (H[1] + B) & 0xFFFFFFFF;
|
||||
H[2] = (H[2] + C) & 0xFFFFFFFF;
|
||||
H[3] = (H[3] + D) & 0xFFFFFFFF;
|
||||
H[4] = (H[4] + E) & 0xFFFFFFFF;
|
||||
|
||||
Message_Block_Index = 0;
|
||||
}
|
||||
|
||||
/*
|
||||
* PadMessage
|
||||
*
|
||||
* Description:
|
||||
* According to the standard, the message must be padded to an even
|
||||
* 512 bits. The first padding bit must be a '1'. The last 64 bits
|
||||
* represent the length of the original message. All bits in between
|
||||
* should be 0. This function will pad the message according to those
|
||||
* rules by filling the message_block array accordingly. It will also
|
||||
* call ProcessMessageBlock() appropriately. When it returns, it
|
||||
* can be assumed that the message digest has been computed.
|
||||
*
|
||||
* Parameters:
|
||||
* None.
|
||||
*
|
||||
* Returns:
|
||||
* Nothing.
|
||||
*
|
||||
* Comments:
|
||||
*
|
||||
*/
|
||||
void SHA1::PadMessage()
|
||||
{
|
||||
/*
|
||||
* Check to see if the current message block is too small to hold
|
||||
* the initial padding bits and length. If so, we will pad the
|
||||
* block, process it, and then continue padding into a second block.
|
||||
*/
|
||||
if (Message_Block_Index > 55)
|
||||
{
|
||||
Message_Block[Message_Block_Index++] = 0x80;
|
||||
while(Message_Block_Index < 64)
|
||||
{
|
||||
Message_Block[Message_Block_Index++] = 0;
|
||||
}
|
||||
|
||||
ProcessMessageBlock();
|
||||
|
||||
while(Message_Block_Index < 56)
|
||||
{
|
||||
Message_Block[Message_Block_Index++] = 0;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
Message_Block[Message_Block_Index++] = 0x80;
|
||||
while(Message_Block_Index < 56)
|
||||
{
|
||||
Message_Block[Message_Block_Index++] = 0;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
/*
|
||||
* Store the message length as the last 8 octets
|
||||
*/
|
||||
Message_Block[56] = (Length_High >> 24) & 0xFF;
|
||||
Message_Block[57] = (Length_High >> 16) & 0xFF;
|
||||
Message_Block[58] = (Length_High >> 8) & 0xFF;
|
||||
Message_Block[59] = (Length_High) & 0xFF;
|
||||
Message_Block[60] = (Length_Low >> 24) & 0xFF;
|
||||
Message_Block[61] = (Length_Low >> 16) & 0xFF;
|
||||
Message_Block[62] = (Length_Low >> 8) & 0xFF;
|
||||
Message_Block[63] = (Length_Low) & 0xFF;
|
||||
|
||||
ProcessMessageBlock();
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
* CircularShift
|
||||
*
|
||||
* Description:
|
||||
* This member function will perform a circular shifting operation.
|
||||
*
|
||||
* Parameters:
|
||||
* bits: [in]
|
||||
* The number of bits to shift (1-31)
|
||||
* word: [in]
|
||||
* The value to shift (assumes a 32-bit integer)
|
||||
*
|
||||
* Returns:
|
||||
* The shifted value.
|
||||
*
|
||||
* Comments:
|
||||
*
|
||||
*/
|
||||
unsigned SHA1::CircularShift(int bits, unsigned word)
|
||||
{
|
||||
return ((word << bits) & 0xFFFFFFFF) | ((word & 0xFFFFFFFF) >> (32-bits));
|
||||
}
|
||||
89
sha1.h
Normal file
89
sha1.h
Normal file
@ -0,0 +1,89 @@
|
||||
/*
|
||||
* sha1.h
|
||||
*
|
||||
* Copyright (C) 1998, 2009
|
||||
* Paul E. Jones <paulej@packetizer.com>
|
||||
* All Rights Reserved.
|
||||
*
|
||||
*****************************************************************************
|
||||
* $Id: sha1.h 12 2009-06-22 19:34:25Z paulej $
|
||||
*****************************************************************************
|
||||
*
|
||||
* Description:
|
||||
* This class implements the Secure Hashing Standard as defined
|
||||
* in FIPS PUB 180-1 published April 17, 1995.
|
||||
*
|
||||
* Many of the variable names in this class, especially the single
|
||||
* character names, were used because those were the names used
|
||||
* in the publication.
|
||||
*
|
||||
* Please read the file sha1.cpp for more information.
|
||||
*
|
||||
*/
|
||||
|
||||
#ifndef _SHA1_H_
|
||||
#define _SHA1_H_
|
||||
|
||||
class SHA1
|
||||
{
|
||||
|
||||
public:
|
||||
|
||||
SHA1();
|
||||
virtual ~SHA1();
|
||||
|
||||
/*
|
||||
* Re-initialize the class
|
||||
*/
|
||||
void Reset();
|
||||
|
||||
/*
|
||||
* Returns the message digest
|
||||
*/
|
||||
bool Result(unsigned *message_digest_array);
|
||||
|
||||
/*
|
||||
* Provide input to SHA1
|
||||
*/
|
||||
void Input( const unsigned char *message_array,
|
||||
unsigned length);
|
||||
void Input( const char *message_array,
|
||||
unsigned length);
|
||||
void Input(unsigned char message_element);
|
||||
void Input(char message_element);
|
||||
SHA1& operator<<(const char *message_array);
|
||||
SHA1& operator<<(const unsigned char *message_array);
|
||||
SHA1& operator<<(const char message_element);
|
||||
SHA1& operator<<(const unsigned char message_element);
|
||||
|
||||
private:
|
||||
|
||||
/*
|
||||
* Process the next 512 bits of the message
|
||||
*/
|
||||
void ProcessMessageBlock();
|
||||
|
||||
/*
|
||||
* Pads the current message block to 512 bits
|
||||
*/
|
||||
void PadMessage();
|
||||
|
||||
/*
|
||||
* Performs a circular left shift operation
|
||||
*/
|
||||
inline unsigned CircularShift(int bits, unsigned word);
|
||||
|
||||
unsigned H[5]; // Message digest buffers
|
||||
|
||||
unsigned Length_Low; // Message length in bits
|
||||
unsigned Length_High; // Message length in bits
|
||||
|
||||
unsigned char Message_Block[64]; // 512-bit message blocks
|
||||
int Message_Block_Index; // Index into message block array
|
||||
|
||||
bool Computed; // Is the digest computed?
|
||||
bool Corrupted; // Is the message digest corruped?
|
||||
|
||||
};
|
||||
|
||||
#endif
|
||||
85
time.cpp
Normal file
85
time.cpp
Normal file
@ -0,0 +1,85 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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"
|
||||
|
||||
const Time Time::ZERO = Time(0);
|
||||
|
||||
Time::Time(int ms)
|
||||
{
|
||||
tv.tv_sec = ms / 1000;
|
||||
tv.tv_usec = (ms % 1000) * 1000;
|
||||
}
|
||||
|
||||
Time Time::operator-(const Time &other) const
|
||||
{
|
||||
Time result;
|
||||
result.tv.tv_sec = tv.tv_sec - other.tv.tv_sec;
|
||||
result.tv.tv_usec = tv.tv_usec - other.tv.tv_usec;
|
||||
|
||||
if (result.tv.tv_usec < 0)
|
||||
{
|
||||
result.tv.tv_usec += 1000000;
|
||||
result.tv.tv_sec -= 1;
|
||||
}
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
Time Time::operator+(const Time &other) const
|
||||
{
|
||||
Time result;
|
||||
result.tv.tv_sec = tv.tv_sec + other.tv.tv_sec;
|
||||
result.tv.tv_usec = tv.tv_usec + other.tv.tv_usec;
|
||||
|
||||
if (result.tv.tv_usec >= 1000000)
|
||||
{
|
||||
result.tv.tv_usec -= 1000000;
|
||||
result.tv.tv_sec += 1;
|
||||
}
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
bool Time::operator==(const Time &other) const
|
||||
{
|
||||
return tv.tv_sec != other.tv.tv_sec ? false : tv.tv_usec == other.tv.tv_usec;
|
||||
}
|
||||
|
||||
bool Time::operator!=(const Time &other) const
|
||||
{
|
||||
return tv.tv_sec != other.tv.tv_sec ? true : tv.tv_usec != other.tv.tv_usec;
|
||||
}
|
||||
|
||||
bool Time::operator<(const Time &other) const
|
||||
{
|
||||
return tv.tv_sec != other.tv.tv_sec ? tv.tv_sec < other.tv.tv_sec : tv.tv_usec < other.tv.tv_usec;
|
||||
}
|
||||
|
||||
bool Time::operator>(const Time &other) const
|
||||
{
|
||||
return tv.tv_sec != other.tv.tv_sec ? tv.tv_sec > other.tv.tv_sec : tv.tv_usec > other.tv.tv_usec;
|
||||
}
|
||||
|
||||
Time Time::now()
|
||||
{
|
||||
Time result;
|
||||
gettimeofday(&result.tv, 0);
|
||||
return result;
|
||||
}
|
||||
48
time.h
Normal file
48
time.h
Normal file
@ -0,0 +1,48 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 TIME_H
|
||||
#define TIME_H
|
||||
|
||||
#include <sys/time.h>
|
||||
|
||||
class Time
|
||||
{
|
||||
public:
|
||||
Time() { tv.tv_sec = 0; tv.tv_usec = 0; };
|
||||
Time(int ms);
|
||||
|
||||
timeval &getTimeval() { return tv; }
|
||||
|
||||
Time operator+(const Time &other) const;
|
||||
Time operator-(const Time &other) const;
|
||||
|
||||
bool operator!=(const Time &other) const;
|
||||
bool operator==(const Time &other) const;
|
||||
bool operator<(const Time &other) const;
|
||||
bool operator>(const Time &other) const;
|
||||
|
||||
static Time now();
|
||||
|
||||
static const Time ZERO;
|
||||
protected:
|
||||
timeval tv;
|
||||
};
|
||||
|
||||
#endif
|
||||
103
tun.cpp
Normal file
103
tun.cpp
Normal file
@ -0,0 +1,103 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 "tun.h"
|
||||
#include "exception.h"
|
||||
#include "utility.h"
|
||||
|
||||
#include <arpa/inet.h>
|
||||
#include <netinet/ip.h>
|
||||
#include <syslog.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
typedef ip IpHeader;
|
||||
|
||||
using namespace std;
|
||||
|
||||
Tun::Tun(const char *device, int mtu)
|
||||
{
|
||||
this->mtu = mtu;
|
||||
|
||||
if (device != NULL)
|
||||
{
|
||||
strncmp(this->device, device, VTUN_DEV_LEN);
|
||||
this->device[VTUN_DEV_LEN] = 0;
|
||||
}
|
||||
else
|
||||
this->device[0] = 0;
|
||||
|
||||
fd = tun_open(this->device);
|
||||
if (fd == -1)
|
||||
throw Exception("could not create tunnel device");
|
||||
|
||||
char cmdline[512];
|
||||
snprintf(cmdline, sizeof(cmdline), "/sbin/ifconfig %s mtu %u", this->device, mtu);
|
||||
if (system(cmdline) != 0)
|
||||
syslog(LOG_ERR, "could not set tun device mtu");
|
||||
}
|
||||
|
||||
Tun::~Tun()
|
||||
{
|
||||
tun_close(fd, device);
|
||||
}
|
||||
|
||||
void Tun::setIp(uint32_t ip)
|
||||
{
|
||||
char cmdline[512];
|
||||
string ips = Utility::formatIp(ip);
|
||||
|
||||
snprintf(cmdline, sizeof(cmdline), "/sbin/ifconfig %s %s %s netmask 255.255.255.0", device, ips.c_str(), ips.c_str());
|
||||
if (system(cmdline) != 0)
|
||||
syslog(LOG_ERR, "could not set tun device ip address");
|
||||
|
||||
#ifndef LINUX
|
||||
snprintf(cmdline, sizeof(cmdline), "/sbin/route add %s/24 %s", ips.c_str(), ips.c_str());
|
||||
if (system(cmdline) != 0)
|
||||
syslog(LOG_ERR, "could not add route");
|
||||
#endif
|
||||
}
|
||||
|
||||
void Tun::write(const char *buffer, int length)
|
||||
{
|
||||
if (tun_write(fd, (char *)buffer, length) == -1)
|
||||
{
|
||||
syslog(LOG_ERR, "error writing %d bytes to tun", length);
|
||||
throw Exception("writing to tun", true);
|
||||
}
|
||||
}
|
||||
|
||||
int Tun::read(char *buffer)
|
||||
{
|
||||
int length = tun_read(fd, buffer, mtu);
|
||||
if (length == -1)
|
||||
throw Exception("reading from tun", true);
|
||||
return length;
|
||||
}
|
||||
|
||||
int Tun::read(char *buffer, uint32_t &sourceIp, uint32_t &destIp)
|
||||
{
|
||||
int length = read(buffer);
|
||||
|
||||
IpHeader *header = (IpHeader *)buffer;
|
||||
sourceIp = ntohl(header->ip_src.s_addr);
|
||||
destIp = ntohl(header->ip_dst.s_addr);
|
||||
|
||||
return length;
|
||||
}
|
||||
49
tun.h
Normal file
49
tun.h
Normal file
@ -0,0 +1,49 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 TUN_H
|
||||
#define TUN_H
|
||||
|
||||
#include "tun_dev.h"
|
||||
|
||||
#include <string>
|
||||
#include <stdint.h>
|
||||
|
||||
class Tun
|
||||
{
|
||||
public:
|
||||
Tun(const char *device, int mtu);
|
||||
~Tun();
|
||||
|
||||
int getFd() { return fd; }
|
||||
|
||||
int read(char *buffer);
|
||||
int read(char *buffer, uint32_t &sourceIp, uint32_t &destIp);
|
||||
|
||||
void write(const char *buffer, int length);
|
||||
|
||||
void setIp(uint32_t ip);
|
||||
protected:
|
||||
char device[VTUN_DEV_LEN];
|
||||
|
||||
int mtu;
|
||||
int fd;
|
||||
};
|
||||
|
||||
#endif
|
||||
27
tun_dev.h
Normal file
27
tun_dev.h
Normal file
@ -0,0 +1,27 @@
|
||||
/*
|
||||
VTun - Virtual Tunnel over TCP/IP network.
|
||||
|
||||
Copyright (C) 1998-2000 Maxim Krasnyansky <max_mk@yahoo.com>
|
||||
|
||||
VTun has been derived from VPPP package by Maxim Krasnyansky.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
*/
|
||||
|
||||
#define VTUN_DEV_LEN 20
|
||||
|
||||
extern "C"
|
||||
{
|
||||
int tun_open(char *dev);
|
||||
int tun_close(int fd, char *dev);
|
||||
int tun_write(int fd, char *buf, int len);
|
||||
int tun_read(int fd, char *buf, int len);
|
||||
}
|
||||
83
tun_dev_freebsd.c
Normal file
83
tun_dev_freebsd.c
Normal file
@ -0,0 +1,83 @@
|
||||
/*
|
||||
VTun - Virtual Tunnel over TCP/IP network.
|
||||
|
||||
Copyright (C) 1998-2000 Maxim Krasnyansky <max_mk@yahoo.com>
|
||||
|
||||
VTun has been derived from VPPP package by Maxim Krasnyansky.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
*/
|
||||
|
||||
/*
|
||||
* tun_dev.c,v 1.2.2.1.2.1 2006/11/16 04:04:23 mtbishop Exp
|
||||
*/
|
||||
|
||||
/* #include "config.h" */
|
||||
|
||||
#include <unistd.h>
|
||||
#include <fcntl.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <syslog.h>
|
||||
|
||||
#include <sys/ioctl.h>
|
||||
#include <net/if_tun.h>
|
||||
|
||||
/* #include "vtun.h"
|
||||
#include "lib.h" */
|
||||
|
||||
/*
|
||||
* Allocate TUN device, returns opened fd.
|
||||
* Stores dev name in the first arg(must be large enough).
|
||||
*/
|
||||
int tun_open(char *dev)
|
||||
{
|
||||
char tunname[14];
|
||||
int i, fd = -1;
|
||||
|
||||
if( *dev ){
|
||||
sprintf(tunname, "/dev/%s", dev);
|
||||
fd = open(tunname, O_RDWR);
|
||||
} else {
|
||||
for(i=0; i < 255; i++){
|
||||
sprintf(tunname, "/dev/tun%d", i);
|
||||
/* Open device */
|
||||
if( (fd=open(tunname, O_RDWR)) > 0 ){
|
||||
sprintf(dev, "tun%d", i);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
if( fd > -1 ){
|
||||
i=0;
|
||||
/* Disable extended modes */
|
||||
ioctl(fd, TUNSLMODE, &i);
|
||||
ioctl(fd, TUNSIFHEAD, &i);
|
||||
}
|
||||
return fd;
|
||||
}
|
||||
|
||||
int tun_close(int fd, char *dev)
|
||||
{
|
||||
return close(fd);
|
||||
}
|
||||
|
||||
/* Read/write frames from/to TUN device */
|
||||
int tun_write(int fd, char *buf, int len)
|
||||
{
|
||||
return write(fd, buf, len);
|
||||
}
|
||||
|
||||
int tun_read(int fd, char *buf, int len)
|
||||
{
|
||||
return read(fd, buf, len);
|
||||
}
|
||||
74
tun_dev_generic.c
Normal file
74
tun_dev_generic.c
Normal file
@ -0,0 +1,74 @@
|
||||
/*
|
||||
VTun - Virtual Tunnel over TCP/IP network.
|
||||
|
||||
Copyright (C) 1998-2000 Maxim Krasnyansky <max_mk@yahoo.com>
|
||||
|
||||
VTun has been derived from VPPP package by Maxim Krasnyansky.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
*/
|
||||
|
||||
/*
|
||||
* tun_dev.c,v 1.2.2.1.2.1 2006/11/16 04:04:40 mtbishop Exp
|
||||
*/
|
||||
|
||||
/* #include "config.h" */
|
||||
|
||||
#include <unistd.h>
|
||||
#include <fcntl.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <syslog.h>
|
||||
|
||||
/* #include "vtun.h"
|
||||
#include "lib.h" */
|
||||
|
||||
/*
|
||||
* Allocate TUN device, returns opened fd.
|
||||
* Stores dev name in the first arg(must be large enough).
|
||||
*/
|
||||
int tun_open(char *dev)
|
||||
{
|
||||
char tunname[14];
|
||||
int i, fd;
|
||||
|
||||
if( *dev ) {
|
||||
sprintf(tunname, "/dev/%s", dev);
|
||||
return open(tunname, O_RDWR);
|
||||
}
|
||||
|
||||
for(i=0; i < 255; i++){
|
||||
sprintf(tunname, "/dev/tun%d", i);
|
||||
/* Open device */
|
||||
if( (fd=open(tunname, O_RDWR)) > 0 ){
|
||||
sprintf(dev, "tun%d", i);
|
||||
return fd;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
int tun_close(int fd, char *dev)
|
||||
{
|
||||
return close(fd);
|
||||
}
|
||||
|
||||
/* Read/write frames from TUN device */
|
||||
int tun_write(int fd, char *buf, int len)
|
||||
{
|
||||
return write(fd, buf, len);
|
||||
}
|
||||
|
||||
int tun_read(int fd, char *buf, int len)
|
||||
{
|
||||
return read(fd, buf, len);
|
||||
}
|
||||
132
tun_dev_linux.c
Normal file
132
tun_dev_linux.c
Normal file
@ -0,0 +1,132 @@
|
||||
/*
|
||||
VTun - Virtual Tunnel over TCP/IP network.
|
||||
|
||||
Copyright (C) 1998-2000 Maxim Krasnyansky <max_mk@yahoo.com>
|
||||
|
||||
VTun has been derived from VPPP package by Maxim Krasnyansky.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
*/
|
||||
|
||||
/*
|
||||
* $Id: tun_dev.c,v 1.4 2006/12/11 10:45:35 mtbishop Exp $
|
||||
*/
|
||||
|
||||
/* #include "config.h" */
|
||||
|
||||
#include <unistd.h>
|
||||
#include <fcntl.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <syslog.h>
|
||||
#include <errno.h>
|
||||
|
||||
#include <sys/ioctl.h>
|
||||
#include <sys/socket.h>
|
||||
#include <linux/if.h>
|
||||
|
||||
/* #include "vtun.h"
|
||||
#include "lib.h" */
|
||||
|
||||
/*
|
||||
* Allocate TUN device, returns opened fd.
|
||||
* Stores dev name in the first arg(must be large enough).
|
||||
*/
|
||||
static int tun_open_common0(char *dev, int istun)
|
||||
{
|
||||
char tunname[14];
|
||||
int i, fd, err;
|
||||
|
||||
if( *dev ) {
|
||||
sprintf(tunname, "/dev/%s", dev);
|
||||
return open(tunname, O_RDWR);
|
||||
}
|
||||
|
||||
sprintf(tunname, "/dev/%s", istun ? "tun" : "tap");
|
||||
err = 0;
|
||||
for(i=0; i < 255; i++){
|
||||
sprintf(tunname + 8, "%d", i);
|
||||
/* Open device */
|
||||
if( (fd=open(tunname, O_RDWR)) > 0 ) {
|
||||
strcpy(dev, tunname + 5);
|
||||
return fd;
|
||||
}
|
||||
else if (errno != ENOENT)
|
||||
err = errno;
|
||||
else if (i) /* don't try all 256 devices */
|
||||
break;
|
||||
}
|
||||
if (err)
|
||||
errno = err;
|
||||
return -1;
|
||||
}
|
||||
|
||||
#ifdef HAVE_LINUX_IF_TUN_H /* New driver support */
|
||||
#include <linux/if_tun.h>
|
||||
|
||||
#ifndef OTUNSETNOCSUM
|
||||
/* pre 2.4.6 compatibility */
|
||||
#define OTUNSETNOCSUM (('T'<< 8) | 200)
|
||||
#define OTUNSETDEBUG (('T'<< 8) | 201)
|
||||
#define OTUNSETIFF (('T'<< 8) | 202)
|
||||
#define OTUNSETPERSIST (('T'<< 8) | 203)
|
||||
#define OTUNSETOWNER (('T'<< 8) | 204)
|
||||
#endif
|
||||
|
||||
static int tun_open_common(char *dev, int istun)
|
||||
{
|
||||
struct ifreq ifr;
|
||||
int fd;
|
||||
|
||||
if ((fd = open("/dev/net/tun", O_RDWR)) < 0)
|
||||
return tun_open_common0(dev, istun);
|
||||
|
||||
memset(&ifr, 0, sizeof(ifr));
|
||||
ifr.ifr_flags = (istun ? IFF_TUN : IFF_TAP) | IFF_NO_PI;
|
||||
if (*dev)
|
||||
strncpy(ifr.ifr_name, dev, IFNAMSIZ);
|
||||
|
||||
if (ioctl(fd, TUNSETIFF, (void *) &ifr) < 0) {
|
||||
if (errno == EBADFD) {
|
||||
/* Try old ioctl */
|
||||
if (ioctl(fd, OTUNSETIFF, (void *) &ifr) < 0)
|
||||
goto failed;
|
||||
} else
|
||||
goto failed;
|
||||
}
|
||||
|
||||
strcpy(dev, ifr.ifr_name);
|
||||
return fd;
|
||||
|
||||
failed:
|
||||
close(fd);
|
||||
return -1;
|
||||
}
|
||||
|
||||
#else
|
||||
|
||||
# define tun_open_common(dev, type) tun_open_common0(dev, type)
|
||||
|
||||
#endif /* New driver support */
|
||||
|
||||
int tun_open(char *dev) { return tun_open_common(dev, 1); }
|
||||
int tap_open(char *dev) { return tun_open_common(dev, 0); }
|
||||
|
||||
int tun_close(int fd, char *dev) { return close(fd); }
|
||||
int tap_close(int fd, char *dev) { return close(fd); }
|
||||
|
||||
/* Read/write frames from TUN device */
|
||||
int tun_write(int fd, char *buf, int len) { return write(fd, buf, len); }
|
||||
int tap_write(int fd, char *buf, int len) { return write(fd, buf, len); }
|
||||
|
||||
int tun_read(int fd, char *buf, int len) { return read(fd, buf, len); }
|
||||
int tap_read(int fd, char *buf, int len) { return read(fd, buf, len); }
|
||||
100
tun_dev_openbsd.c
Normal file
100
tun_dev_openbsd.c
Normal file
@ -0,0 +1,100 @@
|
||||
/*
|
||||
VTun - Virtual Tunnel over TCP/IP network.
|
||||
|
||||
Copyright (C) 1998-2000 Maxim Krasnyansky <max_mk@yahoo.com>
|
||||
|
||||
VTun has been derived from VPPP package by Maxim Krasnyansky.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
*/
|
||||
|
||||
/*
|
||||
* tun_dev.c,v 1.3.2.1.2.1 2006/11/16 04:04:52 mtbishop Exp
|
||||
*/
|
||||
|
||||
/* #include "config.h" */
|
||||
|
||||
#include <unistd.h>
|
||||
#include <fcntl.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <syslog.h>
|
||||
|
||||
#include <sys/types.h>
|
||||
#include <sys/uio.h>
|
||||
#include <sys/socket.h>
|
||||
#include <sys/ioctl.h>
|
||||
#include <net/if_tun.h>
|
||||
|
||||
/* #include "vtun.h"
|
||||
#include "lib.h" */
|
||||
|
||||
/*
|
||||
* Allocate TUN device, returns opened fd.
|
||||
* Stores dev name in the first arg(must be large enough).
|
||||
*/
|
||||
int tun_open(char *dev)
|
||||
{
|
||||
char tunname[14];
|
||||
int i, fd = -1;
|
||||
|
||||
if( *dev ){
|
||||
sprintf(tunname, "/dev/%s", dev);
|
||||
fd = open(tunname, O_RDWR);
|
||||
} else {
|
||||
for(i=0; i < 255; i++){
|
||||
sprintf(tunname, "/dev/tun%d", i);
|
||||
/* Open device */
|
||||
if( (fd=open(tunname, O_RDWR)) > 0 ){
|
||||
sprintf(dev, "tun%d", i);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
return fd;
|
||||
}
|
||||
|
||||
int tun_close(int fd, char *dev)
|
||||
{
|
||||
return close(fd);
|
||||
}
|
||||
|
||||
/* Read/write frames from TUN device */
|
||||
int tun_write(int fd, char *buf, int len)
|
||||
{
|
||||
u_int32_t type = htonl(AF_INET);
|
||||
struct iovec iv[2];
|
||||
|
||||
iv[0].iov_base = &type;
|
||||
iv[0].iov_len = sizeof(type);
|
||||
iv[1].iov_base = buf;
|
||||
iv[1].iov_len = len;
|
||||
|
||||
return writev(fd, iv, 2);
|
||||
}
|
||||
|
||||
int tun_read(int fd, char *buf, int len)
|
||||
{
|
||||
struct iovec iv[2];
|
||||
u_int32_t type;
|
||||
register int rlen;
|
||||
|
||||
iv[0].iov_base = &type;
|
||||
iv[0].iov_len = sizeof(type);
|
||||
iv[1].iov_base = buf;
|
||||
iv[1].iov_len = len;
|
||||
|
||||
if( (rlen = readv(fd, iv, 2)) > 0 )
|
||||
return rlen - sizeof(type);
|
||||
else
|
||||
return rlen;
|
||||
}
|
||||
177
tun_dev_svr4.c
Normal file
177
tun_dev_svr4.c
Normal file
@ -0,0 +1,177 @@
|
||||
/*
|
||||
VTun - Virtual Tunnel over TCP/IP network.
|
||||
|
||||
Copyright (C) 1998-2000 Maxim Krasnyansky <max_mk@yahoo.com>
|
||||
|
||||
VTun has been derived from VPPP package by Maxim Krasnyansky.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
*/
|
||||
|
||||
/*
|
||||
* tun_dev.c,v 1.2.2.2.2.1 2006/11/16 04:05:18 mtbishop Exp
|
||||
*/
|
||||
|
||||
/* #include "config.h" */
|
||||
|
||||
#include <unistd.h>
|
||||
#include <fcntl.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <ctype.h>
|
||||
#include <stdarg.h>
|
||||
#include <sys/time.h>
|
||||
#include <sys/wait.h>
|
||||
#include <syslog.h>
|
||||
#include <sys/types.h>
|
||||
#include <sys/socket.h>
|
||||
#include <sys/sockio.h>
|
||||
#include <sys/ioctl.h>
|
||||
#include <errno.h>
|
||||
#include <signal.h>
|
||||
#include <stropts.h>
|
||||
#include <net/if.h>
|
||||
#include <net/if_tun.h>
|
||||
|
||||
#ifdef HAVE_NETINET_IN_H
|
||||
#include <netinet/in.h>
|
||||
#endif
|
||||
|
||||
#ifdef HAVE_NETINET_IN_SYSTM_H
|
||||
#include <netinet/in_systm.h>
|
||||
#endif
|
||||
|
||||
#ifdef HAVE_NETINET_IP_H
|
||||
#include <netinet/ip.h>
|
||||
#endif
|
||||
|
||||
#ifdef HAVE_NETINET_TCP_H
|
||||
#include <netinet/tcp.h>
|
||||
#endif
|
||||
|
||||
/* #include "vtun.h"
|
||||
#include "lib.h" */
|
||||
|
||||
static int ip_fd = -1;
|
||||
|
||||
/*
|
||||
* Allocate TUN device, returns opened fd.
|
||||
* Stores dev name in the first arg(must be large enough).
|
||||
*/
|
||||
int tun_open(char *dev)
|
||||
{
|
||||
int tun_fd, if_fd, muxid, ppa = -1;
|
||||
struct ifreq ifr;
|
||||
char *ptr;
|
||||
|
||||
if( *dev ){
|
||||
ptr = dev;
|
||||
while( *ptr && !isdigit((int)*ptr) ) ptr++;
|
||||
ppa = atoi(ptr);
|
||||
}
|
||||
|
||||
if( (ip_fd = open("/dev/udp", O_RDWR, 0)) < 0){
|
||||
syslog(LOG_ERR, "Can't open /dev/ip");
|
||||
return -1;
|
||||
}
|
||||
|
||||
if( (tun_fd = open("/dev/tun", O_RDWR, 0)) < 0){
|
||||
syslog(LOG_ERR, "Can't open /dev/tun");
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* Assign a new PPA and get its unit number. */
|
||||
if( (ppa = ioctl(tun_fd, TUNNEWPPA, ppa)) < 0){
|
||||
syslog(LOG_ERR, "Can't assign new interface");
|
||||
return -1;
|
||||
}
|
||||
|
||||
if( (if_fd = open("/dev/tun", O_RDWR, 0)) < 0){
|
||||
syslog(LOG_ERR, "Can't open /dev/tun (2)");
|
||||
return -1;
|
||||
}
|
||||
if(ioctl(if_fd, I_PUSH, "ip") < 0){
|
||||
syslog(LOG_ERR, "Can't push IP module");
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* Assign ppa according to the unit number returned by tun device */
|
||||
if(ioctl(if_fd, IF_UNITSEL, (char *)&ppa) < 0){
|
||||
syslog(LOG_ERR, "Can't set PPA %d", ppa);
|
||||
return -1;
|
||||
}
|
||||
if( (muxid = ioctl(ip_fd, I_PLINK, if_fd)) < 0){
|
||||
syslog(LOG_ERR, "Can't link TUN device to IP");
|
||||
return -1;
|
||||
}
|
||||
close(if_fd);
|
||||
|
||||
sprintf(dev, "tun%d", ppa);
|
||||
|
||||
memset(&ifr, 0, sizeof(ifr));
|
||||
strcpy(ifr.ifr_name, dev);
|
||||
ifr.ifr_ip_muxid = muxid;
|
||||
|
||||
if( ioctl(ip_fd, SIOCSIFMUXID, &ifr) < 0 ){
|
||||
ioctl(ip_fd, I_PUNLINK, muxid);
|
||||
syslog(LOG_ERR, "Can't set multiplexor id");
|
||||
return -1;
|
||||
}
|
||||
|
||||
return tun_fd;
|
||||
}
|
||||
|
||||
/*
|
||||
* Close TUN device.
|
||||
*/
|
||||
int tun_close(int fd, char *dev)
|
||||
{
|
||||
struct ifreq ifr;
|
||||
|
||||
memset(&ifr, 0, sizeof(ifr));
|
||||
strcpy(ifr.ifr_name, dev);
|
||||
if( ioctl(ip_fd, SIOCGIFFLAGS, &ifr) < 0 ){
|
||||
syslog(LOG_ERR, "Can't get iface flags");
|
||||
return 0;
|
||||
}
|
||||
|
||||
if( ioctl(ip_fd, SIOCGIFMUXID, &ifr) < 0 ){
|
||||
syslog(LOG_ERR, "Can't get multiplexor id");
|
||||
return 0;
|
||||
}
|
||||
|
||||
if( ioctl(ip_fd, I_PUNLINK, ifr.ifr_ip_muxid) < 0 ){
|
||||
syslog(LOG_ERR, "Can't unlink interface");
|
||||
return 0;
|
||||
}
|
||||
|
||||
close(ip_fd); close(fd);
|
||||
return 0;
|
||||
}
|
||||
|
||||
int tun_write(int fd, char *buf, int len)
|
||||
{
|
||||
struct strbuf sbuf;
|
||||
sbuf.len = len;
|
||||
sbuf.buf = buf;
|
||||
return putmsg(fd, NULL, &sbuf, 0) >=0 ? sbuf.len : -1;
|
||||
}
|
||||
|
||||
int tun_read(int fd, char *buf, int len)
|
||||
{
|
||||
struct strbuf sbuf;
|
||||
int f = 0;
|
||||
|
||||
sbuf.maxlen = len;
|
||||
sbuf.buf = buf;
|
||||
return getmsg(fd, NULL, &sbuf, &f) >=0 ? sbuf.len : -1;
|
||||
}
|
||||
29
utility.cpp
Normal file
29
utility.cpp
Normal file
@ -0,0 +1,29 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 "utility.h"
|
||||
|
||||
using namespace std;
|
||||
|
||||
string Utility::formatIp(uint32_t ip)
|
||||
{
|
||||
char buffer[16];
|
||||
sprintf(buffer, "%d.%d.%d.%d", (ip >> 24) & 0xff, (ip >> 16) & 0xff, (ip >> 8) & 0xff, ip & 0xff);
|
||||
return buffer;
|
||||
}
|
||||
31
utility.h
Normal file
31
utility.h
Normal file
@ -0,0 +1,31 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 UTILITY_H
|
||||
#define UTILITY_H
|
||||
|
||||
#include <string>
|
||||
|
||||
class Utility
|
||||
{
|
||||
public:
|
||||
static std::string formatIp(uint32_t ip);
|
||||
};
|
||||
|
||||
#endif
|
||||
181
worker.cpp
Normal file
181
worker.cpp
Normal file
@ -0,0 +1,181 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 "worker.h"
|
||||
#include "tun.h"
|
||||
#include "exception.h"
|
||||
|
||||
#include <string.h>
|
||||
#include <syslog.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
Worker::TunnelHeader::Magic::Magic(const char *magic)
|
||||
{
|
||||
memset(data, 0, sizeof(data));
|
||||
strncpy(data, magic, sizeof(data));
|
||||
}
|
||||
|
||||
bool Worker::TunnelHeader::Magic::operator==(const Magic &other) const
|
||||
{
|
||||
return memcmp(data, other.data, sizeof(data)) == 0;
|
||||
}
|
||||
|
||||
bool Worker::TunnelHeader::Magic::operator!=(const Magic &other) const
|
||||
{
|
||||
return memcmp(data, other.data, sizeof(data)) != 0;
|
||||
}
|
||||
|
||||
Worker::Worker(int tunnelMtu, const char *deviceName, bool answerEcho, uid_t uid, gid_t gid)
|
||||
{
|
||||
this->tunnelMtu = tunnelMtu;
|
||||
this->answerEcho = answerEcho;
|
||||
this->uid = uid;
|
||||
this->gid = gid;
|
||||
|
||||
echo = NULL;
|
||||
tun = NULL;
|
||||
|
||||
try
|
||||
{
|
||||
echo = new Echo(tunnelMtu + sizeof(TunnelHeader));
|
||||
tun = new Tun(deviceName, tunnelMtu);
|
||||
}
|
||||
catch (...)
|
||||
{
|
||||
delete echo;
|
||||
delete tun;
|
||||
|
||||
throw;
|
||||
}
|
||||
}
|
||||
|
||||
Worker::~Worker()
|
||||
{
|
||||
delete echo;
|
||||
delete tun;
|
||||
}
|
||||
|
||||
void Worker::sendEcho(const TunnelHeader::Magic &magic, int type, int length, uint32_t realIp, bool reply, int id, int seq)
|
||||
{
|
||||
if (length > payloadBufferSize())
|
||||
throw Exception("packet too big");
|
||||
|
||||
TunnelHeader *header = (TunnelHeader *)echo->payloadBuffer();
|
||||
header->magic = magic;
|
||||
header->type = type;
|
||||
|
||||
echo->send(length + sizeof(TunnelHeader), realIp, reply, id, seq);
|
||||
}
|
||||
|
||||
void Worker::sendToTun(int length)
|
||||
{
|
||||
tun->write(payloadBuffer(), length);
|
||||
}
|
||||
|
||||
void Worker::setTimeout(Time delta)
|
||||
{
|
||||
nextTimeout = now + delta;
|
||||
}
|
||||
|
||||
void Worker::run()
|
||||
{
|
||||
now = Time::now();
|
||||
alive = true;
|
||||
|
||||
int maxFd = echo->getFd() > tun->getFd() ? echo->getFd() : tun->getFd();
|
||||
|
||||
while (alive)
|
||||
{
|
||||
fd_set fs;
|
||||
Time timeout;
|
||||
|
||||
FD_ZERO(&fs);
|
||||
FD_SET(tun->getFd(), &fs);
|
||||
FD_SET(echo->getFd(), &fs);
|
||||
|
||||
if (nextTimeout != Time::ZERO)
|
||||
{
|
||||
timeout = nextTimeout - now;
|
||||
if (timeout < Time::ZERO)
|
||||
timeout = Time::ZERO;
|
||||
}
|
||||
|
||||
// wait for data or timeout
|
||||
int result = select(maxFd + 1 , &fs, NULL, NULL, nextTimeout != Time::ZERO ? &timeout.getTimeval() : NULL);
|
||||
if (result == -1)
|
||||
throw Exception("select", true);
|
||||
now = Time::now();
|
||||
|
||||
// timeout
|
||||
if (result == 0)
|
||||
{
|
||||
nextTimeout = Time::ZERO;
|
||||
handleTimeout();
|
||||
continue;
|
||||
}
|
||||
|
||||
// icmp data
|
||||
if (FD_ISSET(echo->getFd(), &fs))
|
||||
{
|
||||
bool reply;
|
||||
int id, seq;
|
||||
uint32_t ip;
|
||||
|
||||
int dataLength = echo->receive(ip, reply, id, seq);
|
||||
if (dataLength != -1)
|
||||
{
|
||||
bool valid = dataLength >= sizeof(TunnelHeader);
|
||||
|
||||
if (valid)
|
||||
valid = handleEchoData(*(TunnelHeader *)(echo->payloadBuffer()), dataLength - sizeof(TunnelHeader), ip, reply, id, seq);
|
||||
|
||||
if (!valid && !reply && answerEcho)
|
||||
echo->send(dataLength, ip, true, id, seq);
|
||||
}
|
||||
}
|
||||
|
||||
// data from tun
|
||||
if (FD_ISSET(tun->getFd(), &fs))
|
||||
{
|
||||
uint32_t sourceIp, destIp;
|
||||
|
||||
int dataLength = tun->read(payloadBuffer(), sourceIp, destIp);
|
||||
|
||||
if (dataLength == 0)
|
||||
throw Exception("tunnel closed");
|
||||
|
||||
handleTunData(dataLength, sourceIp, destIp);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void Worker::dropPrivileges()
|
||||
{
|
||||
if (uid <= 0)
|
||||
return;
|
||||
|
||||
syslog(LOG_INFO, "dropping privileges");
|
||||
|
||||
if (setgid(gid) == -1)
|
||||
throw Exception("setgid", true);
|
||||
|
||||
if (setuid(uid) == -1)
|
||||
throw Exception("setuid", true);
|
||||
}
|
||||
98
worker.h
Normal file
98
worker.h
Normal file
@ -0,0 +1,98 @@
|
||||
/*
|
||||
* Hans - IP over ICMP
|
||||
* Copyright (C) 2009 Friedrich Schöller <friedrich.schoeller@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 WORKER_H
|
||||
#define WORKER_H
|
||||
|
||||
#include "time.h"
|
||||
#include "echo.h"
|
||||
#include "tun.h"
|
||||
|
||||
#include <string>
|
||||
|
||||
class Worker
|
||||
{
|
||||
public:
|
||||
Worker(int tunnelMtu, const char *deviceName, bool answerEcho, uid_t uid, gid_t gid);
|
||||
virtual ~Worker();
|
||||
|
||||
virtual void run();
|
||||
|
||||
static int headerSize() { return sizeof(TunnelHeader); }
|
||||
|
||||
protected:
|
||||
struct TunnelHeader
|
||||
{
|
||||
struct Magic
|
||||
{
|
||||
Magic(const char *magic);
|
||||
bool operator==(const Magic &other) const;
|
||||
bool operator!=(const Magic &other) const;
|
||||
|
||||
char data[4];
|
||||
};
|
||||
|
||||
Magic magic;
|
||||
uint8_t type;
|
||||
|
||||
enum Type
|
||||
{
|
||||
TYPE_RESET_CONNECTION = 1,
|
||||
TYPE_CONNECTION_REQUEST = 2,
|
||||
TYPE_CHALLENGE = 3,
|
||||
TYPE_CHALLENGE_RESPONSE = 4,
|
||||
TYPE_CONNECTION_ACCEPT = 5,
|
||||
TYPE_CHALLENGE_ERROR = 6,
|
||||
TYPE_DATA = 7,
|
||||
TYPE_POLL = 8,
|
||||
TYPE_SERVER_FULL = 9
|
||||
};
|
||||
}; // size = 5
|
||||
|
||||
virtual bool handleEchoData(TunnelHeader header, int dataLength, uint32_t realIp, bool reply, int id, int seq) { return true; }
|
||||
virtual void handleTunData(int dataLength, uint32_t sourceIp, uint32_t destIp) { }
|
||||
virtual void handleTimeout() { }
|
||||
|
||||
void sendEcho(const TunnelHeader::Magic &magic, int type, int length, uint32_t realIp, bool reply, int id, int seq);
|
||||
void sendToTun(int length);
|
||||
|
||||
void setTimeout(Time delta);
|
||||
|
||||
char *payloadBuffer() { return echo->payloadBuffer() + sizeof(TunnelHeader); }
|
||||
int payloadBufferSize() { return tunnelMtu; }
|
||||
|
||||
void dropPrivileges();
|
||||
|
||||
Echo *echo;
|
||||
Tun *tun;
|
||||
bool alive;
|
||||
bool answerEcho;
|
||||
int tunnelMtu;
|
||||
int maxTunnelHeaderSize;
|
||||
uid_t uid;
|
||||
gid_t gid;
|
||||
|
||||
Time now;
|
||||
private:
|
||||
int readIcmpData(int *realIp, int *id, int *seq);
|
||||
|
||||
Time nextTimeout;
|
||||
};
|
||||
|
||||
#endif
|
||||
Loading…
x
Reference in New Issue
Block a user