2020-01-25 02:16:02 +11:00
|
|
|
// Copyright 2020 Sigma Prime Pty Ltd.
|
|
|
|
//
|
|
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
|
|
// copy of this software and associated documentation files (the "Software"),
|
|
|
|
// to deal in the Software without restriction, including without limitation
|
|
|
|
// the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
|
|
// and/or sell copies of the Software, and to permit persons to whom the
|
|
|
|
// Software is furnished to do so, subject to the following conditions:
|
|
|
|
//
|
|
|
|
// The above copyright notice and this permission notice shall be included in
|
|
|
|
// all copies or substantial portions of the Software.
|
|
|
|
//
|
|
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
|
|
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
|
|
|
// DEALINGS IN THE SOFTWARE.
|
|
|
|
|
2020-07-27 20:27:33 +00:00
|
|
|
|
2020-01-25 02:16:02 +11:00
|
|
|
|
|
|
|
use crate::protocol::{GossipsubMessage, MessageId};
|
|
|
|
use crate::topic::TopicHash;
|
2020-07-29 09:25:53 +02:00
|
|
|
use std::{collections::HashMap, fmt};
|
2020-01-25 02:16:02 +11:00
|
|
|
|
|
|
|
/// CacheEntry stored in the history.
|
|
|
|
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
|
|
|
|
pub struct CacheEntry {
|
|
|
|
mid: MessageId,
|
|
|
|
topics: Vec<TopicHash>,
|
|
|
|
}
|
|
|
|
|
|
|
|
/// MessageCache struct holding history of messages.
|
|
|
|
#[derive(Clone)]
|
|
|
|
pub struct MessageCache {
|
|
|
|
msgs: HashMap<MessageId, GossipsubMessage>,
|
|
|
|
history: Vec<Vec<CacheEntry>>,
|
|
|
|
gossip: usize,
|
|
|
|
msg_id: fn(&GossipsubMessage) -> MessageId,
|
|
|
|
}
|
|
|
|
|
2020-07-29 09:25:53 +02:00
|
|
|
impl fmt::Debug for MessageCache {
|
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
|
|
|
f.debug_struct("MessageCache")
|
|
|
|
.field("msgs", &self.msgs)
|
|
|
|
.field("history", &self.history)
|
|
|
|
.field("gossip", &self.gossip)
|
|
|
|
.finish()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-01-25 02:16:02 +11:00
|
|
|
/// Implementation of the MessageCache.
|
|
|
|
impl MessageCache {
|
|
|
|
pub fn new(
|
|
|
|
gossip: usize,
|
|
|
|
history_capacity: usize,
|
|
|
|
msg_id: fn(&GossipsubMessage) -> MessageId,
|
|
|
|
) -> MessageCache {
|
|
|
|
MessageCache {
|
|
|
|
gossip,
|
|
|
|
msgs: HashMap::default(),
|
|
|
|
history: vec![Vec::new(); history_capacity],
|
|
|
|
msg_id,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-08-03 18:13:43 +10:00
|
|
|
/// Put a message into the memory cache.
|
|
|
|
///
|
|
|
|
/// Returns the message if it already exists.
|
|
|
|
pub fn put(&mut self, msg: GossipsubMessage) -> Option<GossipsubMessage> {
|
2020-01-25 02:16:02 +11:00
|
|
|
let message_id = (self.msg_id)(&msg);
|
|
|
|
let cache_entry = CacheEntry {
|
|
|
|
mid: message_id.clone(),
|
|
|
|
topics: msg.topics.clone(),
|
|
|
|
};
|
|
|
|
|
2020-08-03 18:13:43 +10:00
|
|
|
let seen_message = self.msgs.insert(message_id, msg);
|
|
|
|
if seen_message.is_none() {
|
|
|
|
// Don't add duplicate entries to the cache.
|
|
|
|
self.history[0].push(cache_entry);
|
|
|
|
}
|
|
|
|
seen_message
|
2020-01-25 02:16:02 +11:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Get a message with `message_id`
|
|
|
|
pub fn get(&self, message_id: &MessageId) -> Option<&GossipsubMessage> {
|
|
|
|
self.msgs.get(message_id)
|
|
|
|
}
|
|
|
|
|
2020-08-03 18:13:43 +10:00
|
|
|
/// Gets and validates a message with `message_id`.
|
|
|
|
pub fn validate(&mut self, message_id: &MessageId) -> Option<&GossipsubMessage> {
|
|
|
|
self.msgs.get_mut(message_id).map(|message| {
|
|
|
|
message.validated = true;
|
|
|
|
&*message
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
2020-01-25 02:16:02 +11:00
|
|
|
/// Get a list of GossipIds for a given topic
|
|
|
|
pub fn get_gossip_ids(&self, topic: &TopicHash) -> Vec<MessageId> {
|
|
|
|
self.history[..self.gossip]
|
|
|
|
.iter()
|
|
|
|
.fold(vec![], |mut current_entries, entries| {
|
|
|
|
// search for entries with desired topic
|
|
|
|
let mut found_entries: Vec<MessageId> = entries
|
|
|
|
.iter()
|
|
|
|
.filter_map(|entry| {
|
|
|
|
if entry.topics.iter().any(|t| t == topic) {
|
2020-08-03 18:13:43 +10:00
|
|
|
let mid = &entry.mid;
|
|
|
|
// Only gossip validated messages
|
|
|
|
if let Some(true) = self.msgs.get(mid).map(|msg| msg.validated) {
|
|
|
|
Some(mid.clone())
|
|
|
|
} else {
|
|
|
|
None
|
|
|
|
}
|
2020-01-25 02:16:02 +11:00
|
|
|
} else {
|
|
|
|
None
|
|
|
|
}
|
|
|
|
})
|
|
|
|
.collect();
|
|
|
|
|
|
|
|
// generate the list
|
|
|
|
current_entries.append(&mut found_entries);
|
|
|
|
current_entries
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Shift the history array down one and delete messages associated with the
|
|
|
|
/// last entry
|
|
|
|
pub fn shift(&mut self) {
|
|
|
|
for entry in self.history.pop().expect("history is always > 1") {
|
|
|
|
self.msgs.remove(&entry.mid);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Insert an empty vec in position 0
|
|
|
|
self.history.insert(0, Vec::new());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[cfg(test)]
|
|
|
|
mod tests {
|
|
|
|
use super::*;
|
|
|
|
use crate::{Topic, TopicHash};
|
|
|
|
use libp2p_core::PeerId;
|
|
|
|
|
|
|
|
fn gen_testm(x: u64, topics: Vec<TopicHash>) -> GossipsubMessage {
|
|
|
|
let u8x: u8 = x as u8;
|
2020-08-03 18:13:43 +10:00
|
|
|
let source = Some(PeerId::random());
|
2020-01-25 02:16:02 +11:00
|
|
|
let data: Vec<u8> = vec![u8x];
|
2020-08-03 18:13:43 +10:00
|
|
|
let sequence_number = Some(x);
|
2020-01-25 02:16:02 +11:00
|
|
|
|
|
|
|
let m = GossipsubMessage {
|
|
|
|
source,
|
|
|
|
data,
|
|
|
|
sequence_number,
|
|
|
|
topics,
|
2020-08-03 18:13:43 +10:00
|
|
|
signature: None,
|
|
|
|
key: None,
|
|
|
|
validated: true,
|
2020-01-25 02:16:02 +11:00
|
|
|
};
|
|
|
|
m
|
|
|
|
}
|
|
|
|
|
2020-08-03 18:13:43 +10:00
|
|
|
fn new_cache(gossip_size: usize, history: usize) -> MessageCache {
|
2020-01-25 02:16:02 +11:00
|
|
|
let default_id = |message: &GossipsubMessage| {
|
|
|
|
// default message id is: source + sequence number
|
2020-08-03 18:13:43 +10:00
|
|
|
let mut source_string = message.source.as_ref().unwrap().to_base58();
|
|
|
|
source_string.push_str(&message.sequence_number.unwrap().to_string());
|
|
|
|
MessageId::from(source_string)
|
2020-01-25 02:16:02 +11:00
|
|
|
};
|
2020-08-03 18:13:43 +10:00
|
|
|
|
|
|
|
MessageCache::new(gossip_size, history, default_id)
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
/// Test that the message cache can be created.
|
|
|
|
fn test_new_cache() {
|
2020-01-25 02:16:02 +11:00
|
|
|
let x: usize = 3;
|
2020-08-03 18:13:43 +10:00
|
|
|
let mc = new_cache(x, 5);
|
2020-01-25 02:16:02 +11:00
|
|
|
|
|
|
|
assert_eq!(mc.gossip, x);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
/// Test you can put one message and get one.
|
|
|
|
fn test_put_get_one() {
|
2020-08-03 18:13:43 +10:00
|
|
|
let mut mc = new_cache(10, 15);
|
2020-01-25 02:16:02 +11:00
|
|
|
|
|
|
|
let topic1_hash = Topic::new("topic1".into()).no_hash().clone();
|
|
|
|
let topic2_hash = Topic::new("topic2".into()).no_hash().clone();
|
|
|
|
|
|
|
|
let m = gen_testm(10, vec![topic1_hash, topic2_hash]);
|
|
|
|
|
|
|
|
mc.put(m.clone());
|
|
|
|
|
|
|
|
assert!(mc.history[0].len() == 1);
|
|
|
|
|
|
|
|
let fetched = mc.get(&(mc.msg_id)(&m));
|
|
|
|
|
|
|
|
assert_eq!(fetched.is_none(), false);
|
|
|
|
assert_eq!(fetched.is_some(), true);
|
|
|
|
|
|
|
|
// Make sure it is the same fetched message
|
|
|
|
match fetched {
|
|
|
|
Some(x) => assert_eq!(*x, m),
|
|
|
|
_ => assert!(false),
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
/// Test attempting to 'get' with a wrong id.
|
|
|
|
fn test_get_wrong() {
|
2020-08-03 18:13:43 +10:00
|
|
|
let mut mc = new_cache(10, 15);
|
2020-01-25 02:16:02 +11:00
|
|
|
|
|
|
|
let topic1_hash = Topic::new("topic1".into()).no_hash().clone();
|
|
|
|
let topic2_hash = Topic::new("topic2".into()).no_hash().clone();
|
|
|
|
|
|
|
|
let m = gen_testm(10, vec![topic1_hash, topic2_hash]);
|
|
|
|
|
|
|
|
mc.put(m.clone());
|
|
|
|
|
|
|
|
// Try to get an incorrect ID
|
2020-08-03 18:13:43 +10:00
|
|
|
let wrong_id = MessageId::new(b"wrongid");
|
2020-01-25 02:16:02 +11:00
|
|
|
let fetched = mc.get(&wrong_id);
|
|
|
|
assert_eq!(fetched.is_none(), true);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
/// Test attempting to 'get' empty message cache.
|
|
|
|
fn test_get_empty() {
|
2020-08-03 18:13:43 +10:00
|
|
|
let mc = new_cache(10, 15);
|
2020-01-25 02:16:02 +11:00
|
|
|
|
|
|
|
// Try to get an incorrect ID
|
2020-08-03 18:13:43 +10:00
|
|
|
let wrong_string = MessageId::new(b"imempty");
|
2020-01-25 02:16:02 +11:00
|
|
|
let fetched = mc.get(&wrong_string);
|
|
|
|
assert_eq!(fetched.is_none(), true);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
/// Test adding a message with no topics.
|
|
|
|
fn test_no_topic_put() {
|
2020-08-03 18:13:43 +10:00
|
|
|
let mut mc = new_cache(3, 5);
|
2020-01-25 02:16:02 +11:00
|
|
|
|
|
|
|
// Build the message
|
|
|
|
let m = gen_testm(1, vec![]);
|
|
|
|
mc.put(m.clone());
|
|
|
|
|
|
|
|
let fetched = mc.get(&(mc.msg_id)(&m));
|
|
|
|
|
|
|
|
// Make sure it is the same fetched message
|
|
|
|
match fetched {
|
|
|
|
Some(x) => assert_eq!(*x, m),
|
|
|
|
_ => assert!(false),
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
/// Test shift mechanism.
|
|
|
|
fn test_shift() {
|
2020-08-03 18:13:43 +10:00
|
|
|
let mut mc = new_cache(1, 5);
|
2020-01-25 02:16:02 +11:00
|
|
|
|
|
|
|
let topic1_hash = Topic::new("topic1".into()).no_hash().clone();
|
|
|
|
let topic2_hash = Topic::new("topic2".into()).no_hash().clone();
|
|
|
|
|
|
|
|
// Build the message
|
|
|
|
for i in 0..10 {
|
|
|
|
let m = gen_testm(i, vec![topic1_hash.clone(), topic2_hash.clone()]);
|
|
|
|
mc.put(m.clone());
|
|
|
|
}
|
|
|
|
|
|
|
|
mc.shift();
|
|
|
|
|
|
|
|
// Ensure the shift occurred
|
|
|
|
assert!(mc.history[0].len() == 0);
|
|
|
|
assert!(mc.history[1].len() == 10);
|
|
|
|
|
|
|
|
// Make sure no messages deleted
|
|
|
|
assert!(mc.msgs.len() == 10);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
/// Test Shift with no additions.
|
|
|
|
fn test_empty_shift() {
|
2020-08-03 18:13:43 +10:00
|
|
|
let mut mc = new_cache(1, 5);
|
2020-01-25 02:16:02 +11:00
|
|
|
|
|
|
|
let topic1_hash = Topic::new("topic1".into()).no_hash().clone();
|
|
|
|
let topic2_hash = Topic::new("topic2".into()).no_hash().clone();
|
|
|
|
// Build the message
|
|
|
|
for i in 0..10 {
|
|
|
|
let m = gen_testm(i, vec![topic1_hash.clone(), topic2_hash.clone()]);
|
|
|
|
mc.put(m.clone());
|
|
|
|
}
|
|
|
|
|
|
|
|
mc.shift();
|
|
|
|
|
|
|
|
// Ensure the shift occurred
|
|
|
|
assert!(mc.history[0].len() == 0);
|
|
|
|
assert!(mc.history[1].len() == 10);
|
|
|
|
|
|
|
|
mc.shift();
|
|
|
|
|
|
|
|
assert!(mc.history[2].len() == 10);
|
|
|
|
assert!(mc.history[1].len() == 0);
|
|
|
|
assert!(mc.history[0].len() == 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
/// Test shift to see if the last history messages are removed.
|
|
|
|
fn test_remove_last_from_shift() {
|
2020-08-03 18:13:43 +10:00
|
|
|
let mut mc = new_cache(4, 5);
|
2020-01-25 02:16:02 +11:00
|
|
|
|
|
|
|
let topic1_hash = Topic::new("topic1".into()).no_hash().clone();
|
|
|
|
let topic2_hash = Topic::new("topic2".into()).no_hash().clone();
|
|
|
|
// Build the message
|
|
|
|
for i in 0..10 {
|
|
|
|
let m = gen_testm(i, vec![topic1_hash.clone(), topic2_hash.clone()]);
|
|
|
|
mc.put(m.clone());
|
|
|
|
}
|
|
|
|
|
|
|
|
// Shift right until deleting messages
|
|
|
|
mc.shift();
|
|
|
|
mc.shift();
|
|
|
|
mc.shift();
|
|
|
|
mc.shift();
|
|
|
|
|
|
|
|
assert_eq!(mc.history[mc.history.len() - 1].len(), 10);
|
|
|
|
|
|
|
|
// Shift and delete the messages
|
|
|
|
mc.shift();
|
|
|
|
assert_eq!(mc.history[mc.history.len() - 1].len(), 0);
|
|
|
|
assert_eq!(mc.history[0].len(), 0);
|
|
|
|
assert_eq!(mc.msgs.len(), 0);
|
|
|
|
}
|
|
|
|
}
|