shadow_rs/host/descriptor/
descriptor_table.rs

1use std::collections::{BTreeMap, BTreeSet};
2
3use log::*;
4use shadow_shim_helper_rs::explicit_drop::ExplicitDrop;
5use shadow_shim_helper_rs::syscall_types::SyscallReg;
6
7use crate::host::descriptor::{Descriptor, DropPosixRecordLocks};
8use crate::host::host::Host;
9use crate::utility::ObjectCounter;
10use crate::utility::callback_queue::CallbackQueue;
11
12/// POSIX requires fds to be assigned as `libc::c_int`, so we can't allow any fds larger than this.
13pub const FD_MAX: u32 = i32::MAX as u32;
14
15/// Map of file handles to file descriptors. Typically owned by a
16/// [`Thread`][crate::host::thread::Thread].
17#[derive(Clone)]
18pub struct DescriptorTable {
19    descriptors: BTreeMap<DescriptorHandle, Descriptor>,
20
21    // Indices less than `next_index` known to be available.
22    available_indices: BTreeSet<u32>,
23
24    // Lowest index not in `available_indices` that *might* be available. We still need to verify
25    // availability in `descriptors`, though.
26    next_index: u32,
27
28    _counter: ObjectCounter,
29}
30
31impl DescriptorTable {
32    pub fn new() -> Self {
33        DescriptorTable {
34            descriptors: Default::default(),
35            available_indices: BTreeSet::new(),
36            next_index: 0,
37            _counter: ObjectCounter::new("DescriptorTable"),
38        }
39    }
40
41    /// Add the descriptor at an unused index, and return the index. If the descriptor could not be
42    /// added, the descriptor is returned in the `Err`.
43    fn add(
44        &mut self,
45        descriptor: Descriptor,
46        min_index: DescriptorHandle,
47    ) -> Result<DescriptorHandle, Descriptor> {
48        let idx = if let Some(idx) = self.available_indices.range(min_index.val()..).next() {
49            // Un-borrow from `available_indices`.
50            let idx = *idx;
51            // Take from `available_indices`
52            trace!("Reusing available index {idx}");
53            self.available_indices.remove(&idx);
54            idx
55        } else {
56            // Start our search at either the next likely available index or the minimum index,
57            // whichever is larger.
58            let mut idx = std::cmp::max(self.next_index, min_index.val());
59
60            // Check if this index out of range.
61            if idx > FD_MAX {
62                return Err(descriptor);
63            }
64
65            // Only update next_index if we started at it, otherwise there may be other
66            // available indexes lower than idx.
67            let should_update_next_index = idx == self.next_index;
68
69            // Skip past any indexes that are in use. This can happen after
70            // calling `set` with a value greater than `next_index`.
71            while self
72                .descriptors
73                .contains_key(&DescriptorHandle::new(idx).unwrap())
74            {
75                trace!("Skipping past in-use index {idx}");
76
77                // Check if the next index is out of range.
78                if idx >= FD_MAX {
79                    return Err(descriptor);
80                }
81
82                // Won't overflow because of the check above.
83                idx += 1;
84            }
85
86            if should_update_next_index {
87                self.next_index = idx + 1;
88            }
89
90            // Take the next index.
91            trace!("Using index {idx}");
92            idx
93        };
94
95        let idx = DescriptorHandle::new(idx).unwrap();
96
97        let prev = self.descriptors.insert(idx, descriptor);
98        assert!(prev.is_none(), "Already a descriptor at {idx}");
99
100        Ok(idx)
101    }
102
103    // Call after inserting to `available_indices`, to free any that are contiguous
104    // with `next_index`.
105    fn trim_tail(&mut self) {
106        while let Some(last_in_available) = self.available_indices.iter().next_back().copied() {
107            if (last_in_available + 1) == self.next_index {
108                // Last entry in available_indices is adjacent to next_index.
109                // We can merge them, freeing an entry in `available_indices`.
110                self.next_index -= 1;
111                self.available_indices.remove(&last_in_available);
112            } else {
113                break;
114            }
115        }
116    }
117
118    /// Get the descriptor at `idx`, if any.
119    pub fn get(&self, idx: DescriptorHandle) -> Option<&Descriptor> {
120        self.descriptors.get(&idx)
121    }
122
123    /// Get the descriptor at `idx`, if any.
124    pub fn get_mut(&mut self, idx: DescriptorHandle) -> Option<&mut Descriptor> {
125        self.descriptors.get_mut(&idx)
126    }
127
128    /// Insert a descriptor at `index`. If a descriptor is already present at that index, it is
129    /// unregistered from that index and returned.
130    #[must_use]
131    fn set(&mut self, index: DescriptorHandle, descriptor: Descriptor) -> Option<Descriptor> {
132        // We ensure the index is no longer in `self.available_indices`. We *don't* ensure
133        // `self.next_index` is > `index`, since that'd require adding the indices in between to
134        // `self.available_indices`. It uses less memory and is no more expensive to iterate when
135        // *using* `self.available_indices` instead.
136        self.available_indices.remove(&index.val());
137
138        let prev = self.descriptors.insert(index, descriptor);
139
140        if prev.is_some() {
141            trace!("Overwriting index {index}");
142        } else {
143            trace!("Setting to unused index {index}");
144        }
145
146        prev
147    }
148
149    /// Register a descriptor and return its fd handle. Equivalent to
150    /// [`register_descriptor_with_min_fd(desc, 0)`][Self::register_descriptor_with_min_fd]. If the
151    /// descriptor could not be added, the descriptor is returned in the `Err`.
152    pub fn register_descriptor(
153        &mut self,
154        desc: Descriptor,
155    ) -> Result<DescriptorHandle, Descriptor> {
156        const ZERO: DescriptorHandle = match DescriptorHandle::new(0) {
157            Some(x) => x,
158            None => unreachable!(),
159        };
160        self.add(desc, ZERO)
161    }
162
163    /// Register a descriptor and return its fd handle. If the descriptor could not be added, the
164    /// descriptor is returned in the `Err`.
165    pub fn register_descriptor_with_min_fd(
166        &mut self,
167        desc: Descriptor,
168        min_fd: DescriptorHandle,
169    ) -> Result<DescriptorHandle, Descriptor> {
170        self.add(desc, min_fd)
171    }
172
173    /// Register a descriptor with a given fd handle and return the descriptor that it replaced.
174    #[must_use]
175    pub fn register_descriptor_with_fd(
176        &mut self,
177        desc: Descriptor,
178        new_fd: DescriptorHandle,
179    ) -> Option<Descriptor> {
180        self.set(new_fd, desc)
181    }
182
183    /// Deregister the descriptor with the given fd handle and return it.
184    #[must_use]
185    pub fn deregister_descriptor(&mut self, fd: DescriptorHandle) -> Option<Descriptor> {
186        let maybe_descriptor = self.descriptors.remove(&fd);
187        self.available_indices.insert(fd.val());
188        self.trim_tail();
189        maybe_descriptor
190    }
191
192    /// Remove and return all descriptors.
193    pub fn remove_all(&mut self) -> impl Iterator<Item = Descriptor> {
194        // reset `self` to default state.
195        let mut old_self = std::mem::take(self);
196        // take the descriptors out of the table, so that our `Drop` check
197        // doesn't think we forgot to close them.
198        let old_descriptors = std::mem::take(&mut old_self.descriptors);
199        // return the old descriptors
200        old_descriptors.into_values()
201    }
202
203    /// Remove and return all descriptors in the range. If you want to remove all descriptors, you
204    /// should use [`remove_all`](Self::remove_all).
205    pub fn remove_range(
206        &mut self,
207        range: impl std::ops::RangeBounds<DescriptorHandle>,
208    ) -> impl Iterator<Item = Descriptor> {
209        // This code is not very efficient but it shouldn't be called often, so it should be fine
210        // for now. If we wanted something more efficient, we'd need to redesign the descriptor
211        // table to not use a hash map.
212
213        let fds: Vec<_> = self
214            .iter()
215            .filter_map(|(fd, _)| range.contains(fd).then_some(*fd))
216            .collect();
217
218        let mut descriptors = Vec::with_capacity(fds.len());
219        for fd in fds {
220            descriptors.push(self.deregister_descriptor(fd).unwrap());
221        }
222
223        descriptors.into_iter()
224    }
225
226    pub fn iter(&self) -> impl Iterator<Item = (&DescriptorHandle, &Descriptor)> {
227        self.descriptors.iter()
228    }
229
230    pub fn iter_mut(&mut self) -> impl Iterator<Item = (&DescriptorHandle, &mut Descriptor)> {
231        self.descriptors.iter_mut()
232    }
233}
234
235impl Default for DescriptorTable {
236    fn default() -> Self {
237        Self::new()
238    }
239}
240
241impl ExplicitDrop for DescriptorTable {
242    type ExplicitDropParam<'p> = (&'p Host, DropPosixRecordLocks);
243    type ExplicitDropResult = ();
244
245    fn explicit_drop<'p>(mut self, param: Self::ExplicitDropParam<'p>) {
246        let (host, drop_posix_record_locks) = param;
247        // Drop all descriptors using a callback queue.
248        //
249        // Doing this explicitly instead of letting `DescriptorTable`'s `Drop`
250        // implementation implicitly close these individually is a performance
251        // optimization so that all descriptors are closed before any of their
252        // callbacks run.
253        let descriptors = self.remove_all();
254        CallbackQueue::queue_and_run_with_legacy(|cb_queue| {
255            for desc in descriptors {
256                desc.close(host, drop_posix_record_locks, cb_queue);
257            }
258        });
259    }
260}
261
262impl Drop for DescriptorTable {
263    fn drop(&mut self) {
264        if !self.descriptors.is_empty() {
265            warn_and_debug_panic!(
266                "Dropped DescriptorTable without closing (or taking) descriptors"
267            );
268        }
269    }
270}
271
272/// A handle for a file descriptor.
273#[derive(Copy, Clone, Debug, Hash, PartialEq, Eq, PartialOrd, Ord)]
274pub struct DescriptorHandle(u32);
275
276impl DescriptorHandle {
277    /// Returns `Some` if `fd` is less than [`FD_MAX`]. Can be used in `const` contexts.
278    pub const fn new(fd: u32) -> Option<Self> {
279        if fd > FD_MAX {
280            return None;
281        }
282
283        Some(DescriptorHandle(fd))
284    }
285
286    pub fn val(&self) -> u32 {
287        self.0
288    }
289}
290
291impl std::fmt::Display for DescriptorHandle {
292    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
293        self.0.fmt(f)
294    }
295}
296
297impl From<DescriptorHandle> for u32 {
298    fn from(x: DescriptorHandle) -> u32 {
299        x.0
300    }
301}
302
303impl From<DescriptorHandle> for u64 {
304    fn from(x: DescriptorHandle) -> u64 {
305        x.0.into()
306    }
307}
308
309impl From<DescriptorHandle> for i32 {
310    fn from(x: DescriptorHandle) -> i32 {
311        const { assert!(FD_MAX <= i32::MAX as u32) };
312        // the constructor makes sure this won't panic
313        x.0.try_into().unwrap()
314    }
315}
316
317impl From<DescriptorHandle> for i64 {
318    fn from(x: DescriptorHandle) -> i64 {
319        x.0.into()
320    }
321}
322
323impl From<DescriptorHandle> for SyscallReg {
324    fn from(x: DescriptorHandle) -> SyscallReg {
325        x.0.into()
326    }
327}
328
329impl TryFrom<u32> for DescriptorHandle {
330    type Error = DescriptorHandleError;
331    fn try_from(x: u32) -> Result<Self, Self::Error> {
332        DescriptorHandle::new(x).ok_or(DescriptorHandleError())
333    }
334}
335
336impl TryFrom<u64> for DescriptorHandle {
337    // use the same error type as the conversion from u32
338    type Error = <DescriptorHandle as TryFrom<u32>>::Error;
339    fn try_from(x: u64) -> Result<Self, Self::Error> {
340        u32::try_from(x)
341            .or(Err(DescriptorHandleError()))?
342            .try_into()
343    }
344}
345
346impl TryFrom<i32> for DescriptorHandle {
347    type Error = DescriptorHandleError;
348    fn try_from(x: i32) -> Result<Self, Self::Error> {
349        x.try_into()
350            .ok()
351            .and_then(DescriptorHandle::new)
352            .ok_or(DescriptorHandleError())
353    }
354}
355
356impl TryFrom<i64> for DescriptorHandle {
357    // use the same error type as the conversion from i32
358    type Error = <DescriptorHandle as TryFrom<i32>>::Error;
359    fn try_from(x: i64) -> Result<Self, Self::Error> {
360        i32::try_from(x)
361            .or(Err(DescriptorHandleError()))?
362            .try_into()
363    }
364}
365
366/// The handle is not valid.
367#[derive(Copy, Clone, Debug, PartialEq, Eq)]
368pub struct DescriptorHandleError();
369
370impl std::fmt::Display for DescriptorHandleError {
371    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
372        write!(f, "Not a valid descriptor handle")
373    }
374}
375
376impl std::error::Error for DescriptorHandleError {}
shadow_rs/host/descriptor/descriptor_table.rs

shadow_rs/host/descriptor/
descriptor_table.rs
