blip 0.3.0

A crate for writing fast and highly resilient in-process gRPC service meshes.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110

// Copyright 2020 nytopop (Eric Izoita)
//
// Licensed under the Apache License, Version 2.0, <LICENSE-APACHE or
// http://apache.org/licenses/LICENSE-2.0> or the MIT license <LICENSE-MIT or
// http://opensource.org/licenses/MIT>, at your option. This file may not be
// copied, modified, or distributed except according to those terms.
#![cfg(feature = "cache")]
#![type_length_limit = "8388608"]

mod shared;

use blip::{service::Cache, Mesh};
use shared::{addr_in, cfg_handle, init_logger, subnet};
use tokio::{join, task};

/// Tests that keys are distributed amongst multiple nodes, and that all nodes in a given
/// configuration agree with each other wrt who owns which key.
#[tokio::test]
async fn keys_are_distributed() {
    init_logger();
    let net = subnet();

    let a = Cache::from_fn(16, |_| b"a".to_vec());
    let (mut ha, hsa) = cfg_handle();
    let af = Mesh::low_latency()
        .add_mesh_service(hsa)
        .add_service(a.clone())
        .serve(addr_in(net, 1));

    let b = Cache::from_fn(16, |_| b"b".to_vec());
    let (mut hb, hsb) = cfg_handle();
    let bf = Mesh::low_latency()
        .add_mesh_service(hsb)
        .add_service(b.clone())
        .join_seed(addr_in(net, 1), false)
        .serve(addr_in(net, 2));

    task::spawn(af);
    task::spawn(bf);

    join![ha.cfg_change(2), hb.cfg_change(2)];

    for key in vec![
        ("test"),
        ("these"),
        ("keys"),
        ("for"),
        ("distribution"),
        ("basically"),
        ("each node"),
        ("should"),
        ("agree on"),
        ("placement"),
    ] {
        let (v1, v2) = join![a.get(key), b.get(key)];
        assert_eq!(v1.unwrap(), v2.unwrap());
        let (v1, v2) = join![a.get(key), b.get(key)];
        assert_eq!(v1.unwrap(), v2.unwrap());
    }
}

/// Tests that key distribution amongst multiple nodes is stable when individual cache
/// nodes evict keys.
#[tokio::test]
async fn key_placement_is_stable() {
    init_logger();
    let net = subnet();

    let a = Cache::from_fn(1, |_| b"a".to_vec());
    let (mut ha, hsa) = cfg_handle();
    let af = Mesh::low_latency()
        .add_mesh_service(hsa)
        .add_service(a.clone())
        .serve(addr_in(net, 1));

    let b = Cache::from_fn(1, |_| b"b".to_vec());
    let (mut hb, hsb) = cfg_handle();
    let bf = Mesh::low_latency()
        .add_mesh_service(hsb)
        .add_service(b.clone())
        .join_seed(addr_in(net, 1), false)
        .serve(addr_in(net, 2));

    task::spawn(af);
    task::spawn(bf);

    join![ha.cfg_change(2), hb.cfg_change(2)];

    let keys = vec![
        ("these"),
        ("other keys"),
        ("should"),
        ("also be"),
        ("distributed"),
        ("in a consistent"),
        ("manner when"),
        ("max_keys is set"),
        ("to some"),
        ("small value"),
    ];

    for key in keys.iter() {
        let (v1, v2) = join![a.get(*key), b.get(*key)];
        assert_eq!(v1.unwrap(), v2.unwrap());
    }
    for key in keys.iter() {
        let (v1, v2) = join![a.get(*key), b.get(*key)];
        assert_eq!(v1.unwrap(), v2.unwrap());
    }
}