thread_aware 0.7.2 

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

// Copyright (c) Microsoft Corporation.
// Licensed under the MIT License.

use crate::affinity::Affinity;
use crate::cell::Strategy;

/// A strategy that stores data per processor core / thread.
///
/// This strategy uses the processor index and count from the `Affinity` to determine
/// where to store and retrieve data.
#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]
pub struct PerCore;

impl Strategy for PerCore {
    fn index(affinity: Affinity) -> usize {
        affinity.processor_index()
    }

    fn count(affinity: Affinity) -> usize {
        affinity.processor_count()
    }
}

/// A strategy that stores data per memory region.
///
/// This strategy uses the memory region index and count from the `Affinity` to determine
/// where to store and retrieve data.
#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]
pub struct PerNuma;

impl Strategy for PerNuma {
    fn index(affinity: Affinity) -> usize {
        affinity.memory_region_index()
    }

    fn count(affinity: Affinity) -> usize {
        affinity.memory_region_count()
    }
}

/// A strategy that stores data per process.
///
/// This strategy does not differentiate between affinities, storing all data in a single slot.
#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]
pub struct PerProcess;

impl Strategy for PerProcess {
    fn index(_affinity: Affinity) -> usize {
        0
    }

    fn count(_affinity: Affinity) -> usize {
        1
    }
}