samply 0.13.1

A command line profiler for macOS and Linux.
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

use std::cmp::Reverse;
use std::collections::BinaryHeap;

use fxprof_processed_profile::{FrameInfo, ProcessHandle, ThreadHandle};

use crate::shared::jit_function_recycler::JitFunctionRecycler;
use crate::shared::types::FastHashMap;

pub struct ProcessRecyclingData {
    pub process_handle: ProcessHandle,
    pub main_thread_recycling_data: (ThreadHandle, FrameInfo),
    pub thread_recycler: ThreadRecycler,
    pub jit_function_recycler: JitFunctionRecycler,
}

impl PartialEq for ProcessRecyclingData {
    fn eq(&self, other: &Self) -> bool {
        self.process_handle == other.process_handle
    }
}

impl Eq for ProcessRecyclingData {}

impl PartialOrd for ProcessRecyclingData {
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        Some(self.cmp(other))
    }
}

impl Ord for ProcessRecyclingData {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        self.process_handle.cmp(&other.process_handle)
    }
}

pub type ProcessRecycler = RecyclerByName<ProcessRecyclingData>;
pub type ThreadRecycler = RecyclerByName<(ThreadHandle, FrameInfo)>;

pub struct RecyclerByName<T: Ord>(FastHashMap<String, BinaryHeap<Reverse<T>>>);

impl<T: Ord> RecyclerByName<T> {
    pub fn new() -> Self {
        Self(FastHashMap::default())
    }

    pub fn add_to_pool(&mut self, name: &str, value: T) {
        self.0
            .entry(name.to_string())
            .or_default()
            .push(Reverse(value));
    }

    pub fn recycle_by_name(&mut self, name: &str) -> Option<T> {
        let heap = self.0.get_mut(name)?;
        let process: Reverse<T> = heap
            .pop()
            .expect("We only have non-empty BinaryHeaps in this HashMap");
        if heap.is_empty() {
            self.0.remove(name);
        }
        Some(process.0)
    }
}