memscope-rs 0.2.0

A memory tracking library for Rust applications.
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
//! Shared relation detection — Arc/Rc shared ownership.
//!
//! Detects when multiple allocations share ownership of the same underlying data
//! through Arc or Rc reference counting.
//!
//! # Detection Strategy
//!
//! Instead of hardcoding ArcInner offsets (which may change across Rust versions),
//! we use a graph-based approach:
//!
//! 1. After Owner detection, find all nodes that have >= 2 inbound Owner edges.
//! 2. If a node looks like an Arc/Rc control block (size ≈ 16 + inline data,
//!    with small integer patterns in the first 16 bytes), its owners share it.
//! 3. Add Shared edges between all pairs of owners.
//!
//! This avoids fragile offset assumptions and works with any Rust version.

use crate::analysis::relation_inference::{InferenceRecord, Relation, RelationEdge};

const MIN_SHARED_OWNERS: usize = 2;

pub fn detect_shared(
    records: &[InferenceRecord],
    existing_edges: &[RelationEdge],
) -> Vec<RelationEdge> {
    let mut owners_of: Vec<Vec<usize>> = vec![Vec::new(); records.len()];
    for edge in existing_edges {
        if edge.relation == Relation::Owner {
            owners_of[edge.to].push(edge.from);
        }
    }

    let mut relations = Vec::new();

    for (target_id, owners) in owners_of.iter().enumerate() {
        if owners.len() < MIN_SHARED_OWNERS {
            continue;
        }

        let target = &records[target_id];

        if !looks_like_arc_rc(target) {
            continue;
        }

        for i in 0..owners.len() {
            for j in (i + 1)..owners.len() {
                relations.push(RelationEdge {
                    from: owners[i],
                    to: owners[j],
                    relation: Relation::Shared,
                });
            }
        }
    }

    relations
}

fn looks_like_arc_rc(record: &InferenceRecord) -> bool {
    if record.size < 16 || record.size > 1024 {
        return false;
    }

    let memory = match &record.memory {
        Some(m) => m,
        None => return false,
    };

    if memory.len() < 16 {
        return false;
    }

    let strong = memory.read_usize(0).unwrap_or(usize::MAX);
    let weak = memory.read_usize(8).unwrap_or(usize::MAX);

    let strong_valid = (1..=1000).contains(&strong);
    let weak_valid = weak <= 100;

    strong_valid && weak_valid
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::analysis::unsafe_inference::{OwnedMemoryView, TypeKind};

    fn make_record(
        id: usize,
        ptr: usize,
        size: usize,
        memory: Option<Vec<u8>>,
        type_kind: TypeKind,
    ) -> InferenceRecord {
        InferenceRecord {
            id,
            ptr,
            size,
            memory: memory.map(OwnedMemoryView::new),
            type_kind,
            confidence: 80,
            call_stack_hash: None,
            alloc_time: 0,
        }
    }

    #[test]
    fn test_shared_detection_basic() {
        let mut arc_inner_data = vec![0u8; 48];
        arc_inner_data[0..8].copy_from_slice(&2usize.to_le_bytes());
        arc_inner_data[8..16].copy_from_slice(&0usize.to_le_bytes());

        let records = vec![
            make_record(0, 0x1000, 24, None, TypeKind::Vec),
            make_record(1, 0x2000, 24, None, TypeKind::Vec),
            make_record(2, 0x3000, 48, Some(arc_inner_data), TypeKind::Buffer),
        ];

        let existing_edges = vec![
            RelationEdge {
                from: 0,
                to: 2,
                relation: Relation::Owner,
            },
            RelationEdge {
                from: 1,
                to: 2,
                relation: Relation::Owner,
            },
        ];

        let shared = detect_shared(&records, &existing_edges);
        assert_eq!(shared.len(), 1);
        assert_eq!(shared[0].from, 0);
        assert_eq!(shared[0].to, 1);
        assert_eq!(shared[0].relation, Relation::Shared);
    }

    #[test]
    fn test_no_shared_with_single_owner() {
        let mut arc_inner_data = vec![0u8; 48];
        arc_inner_data[0..8].copy_from_slice(&1usize.to_le_bytes());
        arc_inner_data[8..16].copy_from_slice(&0usize.to_le_bytes());

        let records = vec![
            make_record(0, 0x1000, 24, None, TypeKind::Vec),
            make_record(1, 0x3000, 48, Some(arc_inner_data), TypeKind::Buffer),
        ];

        let existing_edges = vec![RelationEdge {
            from: 0,
            to: 1,
            relation: Relation::Owner,
        }];

        let shared = detect_shared(&records, &existing_edges);
        assert!(shared.is_empty());
    }

    #[test]
    fn test_no_shared_when_not_arc_like() {
        let records = vec![
            make_record(0, 0x1000, 24, None, TypeKind::Vec),
            make_record(1, 0x2000, 24, None, TypeKind::Vec),
            make_record(2, 0x3000, 4096, None, TypeKind::Buffer),
        ];

        let existing_edges = vec![
            RelationEdge {
                from: 0,
                to: 2,
                relation: Relation::Owner,
            },
            RelationEdge {
                from: 1,
                to: 2,
                relation: Relation::Owner,
            },
        ];

        let shared = detect_shared(&records, &existing_edges);
        assert!(shared.is_empty());
    }

    #[test]
    fn test_shared_three_owners() {
        let mut arc_inner_data = vec![0u8; 48];
        arc_inner_data[0..8].copy_from_slice(&3usize.to_le_bytes());
        arc_inner_data[8..16].copy_from_slice(&0usize.to_le_bytes());

        let records = vec![
            make_record(0, 0x1000, 24, None, TypeKind::Vec),
            make_record(1, 0x2000, 24, None, TypeKind::Vec),
            make_record(2, 0x2500, 24, None, TypeKind::Vec),
            make_record(3, 0x3000, 48, Some(arc_inner_data), TypeKind::Buffer),
        ];

        let existing_edges = vec![
            RelationEdge {
                from: 0,
                to: 3,
                relation: Relation::Owner,
            },
            RelationEdge {
                from: 1,
                to: 3,
                relation: Relation::Owner,
            },
            RelationEdge {
                from: 2,
                to: 3,
                relation: Relation::Owner,
            },
        ];

        let shared = detect_shared(&records, &existing_edges);
        assert_eq!(shared.len(), 3);
    }

    #[test]
    fn test_looks_like_arc_rc_valid() {
        let mut data = vec![0u8; 48];
        data[0..8].copy_from_slice(&2usize.to_le_bytes());
        data[8..16].copy_from_slice(&0usize.to_le_bytes());

        let record = make_record(0, 0x1000, 48, Some(data), TypeKind::Buffer);
        assert!(looks_like_arc_rc(&record));
    }

    #[test]
    fn test_looks_like_arc_rc_too_small() {
        let record = make_record(0, 0x1000, 8, None, TypeKind::Buffer);
        assert!(!looks_like_arc_rc(&record));
    }

    #[test]
    fn test_looks_like_arc_rc_too_large() {
        let record = make_record(0, 0x1000, 2048, None, TypeKind::Buffer);
        assert!(!looks_like_arc_rc(&record));
    }

    #[test]
    fn test_looks_like_arc_rc_no_memory() {
        let record = make_record(0, 0x1000, 48, None, TypeKind::Buffer);
        assert!(!looks_like_arc_rc(&record));
    }

    #[test]
    fn test_looks_like_arc_rc_invalid_strong() {
        let mut data = vec![0u8; 48];
        data[0..8].copy_from_slice(&0usize.to_le_bytes());
        data[8..16].copy_from_slice(&0usize.to_le_bytes());

        let record = make_record(0, 0x1000, 48, Some(data), TypeKind::Buffer);
        assert!(!looks_like_arc_rc(&record));
    }

    #[test]
    fn test_looks_like_arc_rc_invalid_weak() {
        let mut data = vec![0u8; 48];
        data[0..8].copy_from_slice(&1usize.to_le_bytes());
        data[8..16].copy_from_slice(&9999usize.to_le_bytes());

        let record = make_record(0, 0x1000, 48, Some(data), TypeKind::Buffer);
        assert!(!looks_like_arc_rc(&record));
    }

    #[test]
    fn test_looks_like_arc_rc_strong_count_zero() {
        // strong_count = 0 is invalid (no live references).
        let mut data = vec![0u8; 48];
        data[0..8].copy_from_slice(&0usize.to_le_bytes());
        data[8..16].copy_from_slice(&0usize.to_le_bytes());

        let record = make_record(0, 0x1000, 48, Some(data), TypeKind::Buffer);
        assert!(!looks_like_arc_rc(&record));
    }

    #[test]
    fn test_looks_like_arc_rc_strong_count_boundary_1000() {
        // strong_count = 1000 should be valid (upper boundary).
        let mut data = vec![0u8; 48];
        data[0..8].copy_from_slice(&1000usize.to_le_bytes());
        data[8..16].copy_from_slice(&0usize.to_le_bytes());

        let record = make_record(0, 0x1000, 48, Some(data), TypeKind::Buffer);
        assert!(looks_like_arc_rc(&record));
    }

    #[test]
    fn test_looks_like_arc_rc_strong_count_exceeds_1000() {
        // strong_count = 1001 should be invalid.
        let mut data = vec![0u8; 48];
        data[0..8].copy_from_slice(&1001usize.to_le_bytes());
        data[8..16].copy_from_slice(&0usize.to_le_bytes());

        let record = make_record(0, 0x1000, 48, Some(data), TypeKind::Buffer);
        assert!(!looks_like_arc_rc(&record));
    }

    #[test]
    fn test_looks_like_arc_rc_weak_count_boundary_100() {
        // weak_count = 100 should be valid.
        let mut data = vec![0u8; 48];
        data[0..8].copy_from_slice(&1usize.to_le_bytes());
        data[8..16].copy_from_slice(&100usize.to_le_bytes());

        let record = make_record(0, 0x1000, 48, Some(data), TypeKind::Buffer);
        assert!(looks_like_arc_rc(&record));
    }

    #[test]
    fn test_looks_like_arc_rc_weak_count_exceeds_100() {
        // weak_count = 101 should be invalid.
        let mut data = vec![0u8; 48];
        data[0..8].copy_from_slice(&1usize.to_le_bytes());
        data[8..16].copy_from_slice(&101usize.to_le_bytes());

        let record = make_record(0, 0x1000, 48, Some(data), TypeKind::Buffer);
        assert!(!looks_like_arc_rc(&record));
    }

    #[test]
    fn test_no_shared_for_regular_vec_type() {
        // Regular Vec types should NOT produce Shared edges even with multiple owners.
        let records = vec![
            make_record(0, 0x1000, 24, None, TypeKind::Vec),
            make_record(1, 0x2000, 24, None, TypeKind::Vec),
            // A buffer that doesn't look like Arc/Rc (random data, not strong/weak pattern).
            make_record(2, 0x3000, 64, Some(vec![0xAAu8; 64]), TypeKind::Buffer),
        ];

        let existing_edges = vec![
            RelationEdge {
                from: 0,
                to: 2,
                relation: Relation::Owner,
            },
            RelationEdge {
                from: 1,
                to: 2,
                relation: Relation::Owner,
            },
        ];

        let shared = detect_shared(&records, &existing_edges);
        assert!(
            shared.is_empty(),
            "Regular Vec buffer should not produce Shared edges"
        );
    }

    #[test]
    fn test_shared_detection_with_rc_like_data() {
        // Rc has the same memory layout as Arc (strong, weak, data).
        let mut rc_inner_data = vec![0u8; 32];
        rc_inner_data[0..8].copy_from_slice(&2usize.to_le_bytes()); // strong = 2
        rc_inner_data[8..16].copy_from_slice(&1usize.to_le_bytes()); // weak = 1

        let records = vec![
            make_record(0, 0x1000, 24, None, TypeKind::Vec),
            make_record(1, 0x2000, 24, None, TypeKind::Vec),
            make_record(2, 0x3000, 32, Some(rc_inner_data), TypeKind::Buffer),
        ];

        let existing_edges = vec![
            RelationEdge {
                from: 0,
                to: 2,
                relation: Relation::Owner,
            },
            RelationEdge {
                from: 1,
                to: 2,
                relation: Relation::Owner,
            },
        ];

        let shared = detect_shared(&records, &existing_edges);
        assert_eq!(shared.len(), 1, "Rc-like data should produce Shared edge");
        assert_eq!(shared[0].from, 0);
        assert_eq!(shared[0].to, 1);
    }

    #[test]
    fn test_no_shared_with_only_one_owner() {
        // Even with Arc-like data, a single owner should not produce Shared.
        let mut arc_inner_data = vec![0u8; 48];
        arc_inner_data[0..8].copy_from_slice(&1usize.to_le_bytes());
        arc_inner_data[8..16].copy_from_slice(&0usize.to_le_bytes());

        let records = vec![
            make_record(0, 0x1000, 24, None, TypeKind::Vec),
            make_record(1, 0x3000, 48, Some(arc_inner_data), TypeKind::Buffer),
        ];

        let existing_edges = vec![RelationEdge {
            from: 0,
            to: 1,
            relation: Relation::Owner,
        }];

        let shared = detect_shared(&records, &existing_edges);
        assert!(
            shared.is_empty(),
            "Single owner should not produce Shared edges"
        );
    }
}