vpncloud/src/ethernet.rs

104 lines
2.9 KiB
Rust
Raw Normal View History

// VpnCloud - Peer-to-Peer VPN
// Copyright (C) 2015-2016 Dennis Schwerdel
// This software is licensed under GPL-3 or newer (see LICENSE.md)
2015-11-21 15:50:50 +00:00
use std::net::SocketAddr;
use std::collections::HashMap;
2016-03-29 08:45:54 +00:00
use std::hash::BuildHasherDefault;
use fnv::FnvHasher;
2015-11-19 15:34:20 +00:00
2015-11-23 00:04:30 +00:00
use super::types::{Error, Table, Protocol, Address};
2015-11-25 20:55:30 +00:00
use super::util::{now, Time, Duration};
2015-11-22 16:28:04 +00:00
2015-11-22 17:05:15 +00:00
pub struct Frame;
2015-11-21 17:09:13 +00:00
2015-11-22 17:05:15 +00:00
impl Protocol for Frame {
2015-11-22 23:49:58 +00:00
fn parse(data: &[u8]) -> Result<(Address, Address), Error> {
2015-11-22 15:48:01 +00:00
if data.len() < 14 {
return Err(Error::ParseError("Frame is too short"));
}
let mut pos = 0;
2015-11-22 23:49:58 +00:00
let dst_data = &data[pos..pos+6];
pos += 6;
let src_data = &data[pos..pos+6];
pos += 6;
2015-11-22 15:48:01 +00:00
if data[pos] == 0x81 && data[pos+1] == 0x00 {
pos += 2;
if data.len() < pos + 2 {
return Err(Error::ParseError("Vlan frame is too short"));
}
let mut src = [0; 16];
let mut dst = [0; 16];
2015-11-26 09:45:25 +00:00
src[0] = data[pos]; src[1] = data[pos+1];
dst[0] = data[pos]; dst[1] = data[pos+1];
for i in 0..6 {
src[i+2] = src_data[i];
dst[i+2] = dst_data[i];
2015-11-22 23:49:58 +00:00
}
2015-11-26 09:45:25 +00:00
Ok((Address{data: src, len: 8}, Address{data: dst, len: 8}))
2015-11-22 23:49:58 +00:00
} else {
2015-11-26 09:45:25 +00:00
let src = try!(Address::read_from_fixed(&src_data, 6));
let dst = try!(Address::read_from_fixed(&dst_data, 6));
Ok((src, dst))
2015-11-22 15:48:01 +00:00
}
}
}
2015-11-22 16:28:04 +00:00
2015-11-23 00:40:47 +00:00
struct SwitchTableValue {
2015-11-21 15:50:50 +00:00
address: SocketAddr,
2015-11-25 20:55:30 +00:00
timeout: Time
2015-11-21 15:50:50 +00:00
}
2016-03-29 08:45:54 +00:00
type Hash = BuildHasherDefault<FnvHasher>;
2015-11-23 00:40:47 +00:00
pub struct SwitchTable {
2016-03-29 08:45:54 +00:00
table: HashMap<Address, SwitchTableValue, Hash>,
2015-11-25 18:23:25 +00:00
cache: Option<(Address, SocketAddr)>,
2015-11-21 15:50:50 +00:00
timeout: Duration
}
2015-11-23 00:40:47 +00:00
impl SwitchTable {
pub fn new(timeout: Duration) -> Self {
2016-03-29 08:45:54 +00:00
SwitchTable{table: HashMap::default(), cache: None, timeout: timeout}
2015-11-21 15:50:50 +00:00
}
2015-11-21 17:09:13 +00:00
}
2015-11-23 00:40:47 +00:00
impl Table for SwitchTable {
2015-11-21 17:09:13 +00:00
fn housekeep(&mut self) {
2015-11-25 20:55:30 +00:00
let now = now();
2015-11-22 23:49:58 +00:00
let mut del: Vec<Address> = Vec::new();
for (key, val) in &self.table {
2015-11-21 15:50:50 +00:00
if val.timeout < now {
2015-11-22 23:49:58 +00:00
del.push(key.clone());
2015-11-21 15:50:50 +00:00
}
}
for key in del {
2015-11-26 21:16:51 +00:00
info!("Forgot address {}", key);
2015-11-21 15:50:50 +00:00
self.table.remove(&key);
}
2015-11-25 18:23:25 +00:00
self.cache = None;
2015-11-21 15:50:50 +00:00
}
#[inline]
2015-11-22 23:49:58 +00:00
fn learn(&mut self, key: Address, _prefix_len: Option<u8>, addr: SocketAddr) {
2015-11-25 20:55:30 +00:00
let value = SwitchTableValue{address: addr, timeout: now()+self.timeout as Time};
2016-01-19 20:52:44 +00:00
if self.table.insert(key, value).is_none() {
2015-11-26 21:16:51 +00:00
info!("Learned address {} => {}", key, addr);
2015-11-25 18:23:25 +00:00
}
2015-11-21 15:50:50 +00:00
}
#[inline]
2015-11-25 18:23:25 +00:00
fn lookup(&mut self, key: &Address) -> Option<SocketAddr> {
match self.table.get(key) {
Some(value) => Some(value.address),
None => None
}
2015-11-21 15:50:50 +00:00
}
2015-11-22 21:00:34 +00:00
fn remove_all(&mut self, _addr: SocketAddr) {
unimplemented!()
}
2015-11-21 15:50:50 +00:00
}