2012-08-27 00:34:59 +00:00
|
|
|
/*
|
|
|
|
Serval Daemon
|
|
|
|
Copyright (C) 2012 Serval Project Inc.
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
|
|
modify it under the terms of the GNU General Public License
|
|
|
|
as published by the Free Software Foundation; either version 2
|
|
|
|
of the License, or (at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program; if not, write to the Free Software
|
|
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _SERVALD_OVERLAY_ADDRESS_H
|
|
|
|
#define _SERVALD_OVERLAY_ADDRESS_H
|
|
|
|
|
|
|
|
#include "constants.h"
|
|
|
|
|
|
|
|
// not reachable
|
|
|
|
#define REACHABLE_NONE 0
|
|
|
|
|
2012-11-30 03:15:08 +00:00
|
|
|
// this subscriber is in our keystore
|
|
|
|
#define REACHABLE_SELF (1<<0)
|
2012-09-10 01:25:12 +00:00
|
|
|
|
2012-11-30 03:15:08 +00:00
|
|
|
// immediate neighbour broadcast packet
|
|
|
|
#define REACHABLE_BROADCAST (1<<1)
|
2012-08-27 00:34:59 +00:00
|
|
|
|
2012-11-30 03:15:08 +00:00
|
|
|
// reachable directly via unicast packet
|
|
|
|
#define REACHABLE_UNICAST (1<<2)
|
2012-08-27 00:34:59 +00:00
|
|
|
|
2012-11-30 03:15:08 +00:00
|
|
|
// packets must be routed via next_hop
|
|
|
|
#define REACHABLE_INDIRECT (1<<3)
|
2012-08-27 00:34:59 +00:00
|
|
|
|
2012-11-30 03:15:08 +00:00
|
|
|
#define REACHABLE_ASSUMED (1<<4)
|
2012-09-19 00:20:29 +00:00
|
|
|
|
2012-11-30 03:15:08 +00:00
|
|
|
#define REACHABLE_DIRECT (REACHABLE_BROADCAST|REACHABLE_UNICAST)
|
|
|
|
#define REACHABLE (REACHABLE_DIRECT|REACHABLE_INDIRECT)
|
2012-08-27 00:34:59 +00:00
|
|
|
|
|
|
|
#define BROADCAST_LEN 8
|
|
|
|
|
|
|
|
|
|
|
|
// This structure supports both our own routing protocol which can store calculation details in *node
|
|
|
|
// or IP4 addresses reachable via any other kind of normal layer3 routing protocol, eg olsr
|
|
|
|
struct subscriber{
|
|
|
|
unsigned char sid[SID_SIZE];
|
|
|
|
// minimum abbreviation length, in 4bit nibbles.
|
|
|
|
int abbreviate_len;
|
|
|
|
|
|
|
|
// should we send the full address once?
|
|
|
|
int send_full;
|
2012-12-04 04:17:57 +00:00
|
|
|
// sequence number for this unicast or broadcast destination
|
|
|
|
int sequence;
|
2012-08-27 00:34:59 +00:00
|
|
|
// overlay routing information
|
|
|
|
struct overlay_node *node;
|
|
|
|
|
|
|
|
// result of routing calculations;
|
|
|
|
int reachable;
|
2012-10-03 04:29:46 +00:00
|
|
|
|
2012-10-17 01:08:31 +00:00
|
|
|
// if indirect, who is the next hop?
|
|
|
|
struct subscriber *next_hop;
|
|
|
|
|
|
|
|
// if direct, or unicast, where do we send packets?
|
|
|
|
struct overlay_interface *interface;
|
|
|
|
|
2012-12-03 03:14:31 +00:00
|
|
|
// if reachable&REACHABLE_UNICAST send packets to this address, else use the interface broadcast address
|
2012-10-17 01:08:31 +00:00
|
|
|
struct sockaddr_in address;
|
2012-12-05 05:06:46 +00:00
|
|
|
time_ms_t last_probe;
|
|
|
|
time_ms_t last_rx;
|
|
|
|
time_ms_t last_tx;
|
2012-10-17 01:08:31 +00:00
|
|
|
|
|
|
|
// public signing key details for remote peers
|
2012-10-03 04:29:46 +00:00
|
|
|
unsigned char sas_public[SAS_SIZE];
|
|
|
|
time_ms_t sas_last_request;
|
|
|
|
unsigned char sas_valid;
|
|
|
|
|
2012-10-10 00:02:25 +00:00
|
|
|
// private keys for local identities
|
|
|
|
keyring_identity *identity;
|
2012-08-27 00:34:59 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
struct broadcast{
|
|
|
|
unsigned char id[BROADCAST_LEN];
|
|
|
|
};
|
|
|
|
|
2012-09-19 04:46:40 +00:00
|
|
|
struct decode_context{
|
2012-12-04 04:17:57 +00:00
|
|
|
struct overlay_interface *interface;
|
|
|
|
struct sockaddr_in addr;
|
2012-09-19 04:46:40 +00:00
|
|
|
int invalid_addresses;
|
|
|
|
struct overlay_frame *please_explain;
|
2012-11-22 22:34:42 +00:00
|
|
|
struct subscriber *sender;
|
|
|
|
struct subscriber *previous;
|
2012-09-19 04:46:40 +00:00
|
|
|
};
|
|
|
|
|
2012-08-27 00:34:59 +00:00
|
|
|
extern struct subscriber *my_subscriber;
|
2012-09-18 02:56:30 +00:00
|
|
|
extern struct subscriber *directory_service;
|
2012-08-27 00:34:59 +00:00
|
|
|
|
|
|
|
struct subscriber *find_subscriber(const unsigned char *sid, int len, int create);
|
|
|
|
void enum_subscribers(struct subscriber *start, int(*callback)(struct subscriber *, void *), void *context);
|
2012-08-30 02:19:12 +00:00
|
|
|
int subscriber_is_reachable(struct subscriber *subscriber);
|
2012-09-18 02:56:30 +00:00
|
|
|
int set_reachable(struct subscriber *subscriber, int reachable);
|
2012-09-06 05:51:31 +00:00
|
|
|
int reachable_unicast(struct subscriber *subscriber, overlay_interface *interface, struct in_addr addr, int port);
|
2012-09-14 02:20:45 +00:00
|
|
|
int load_subscriber_address(struct subscriber *subscriber);
|
2012-08-27 00:34:59 +00:00
|
|
|
|
2012-09-19 04:46:40 +00:00
|
|
|
int process_explain(struct overlay_frame *frame);
|
2012-08-27 00:34:59 +00:00
|
|
|
int overlay_broadcast_drop_check(struct broadcast *addr);
|
|
|
|
int overlay_broadcast_generate_address(struct broadcast *addr);
|
|
|
|
|
2012-11-26 04:58:13 +00:00
|
|
|
int overlay_broadcast_append(struct overlay_buffer *b, struct broadcast *broadcast);
|
2012-11-22 22:34:42 +00:00
|
|
|
int overlay_address_append(struct decode_context *context, struct overlay_buffer *b, struct subscriber *subscriber);
|
2012-09-19 04:46:40 +00:00
|
|
|
|
2012-11-26 04:58:13 +00:00
|
|
|
int overlay_broadcast_parse(struct overlay_buffer *b, struct broadcast *broadcast);
|
|
|
|
int overlay_address_parse(struct decode_context *context, struct overlay_buffer *b, struct subscriber **subscriber);
|
2012-09-19 04:46:40 +00:00
|
|
|
int send_please_explain(struct decode_context *context, struct subscriber *source, struct subscriber *destination);
|
|
|
|
|
2012-08-27 00:34:59 +00:00
|
|
|
#endif
|