Pre-fetch a batch of disjoint memory ranges. Used during BFS planning: prefetch adjacency data for all nodes in the next frontier before the traversal loop touches them.
(ranges: &[(*const u8, usize)])
| 52 | /// Used during BFS planning: prefetch adjacency data for all nodes |
| 53 | /// in the next frontier before the traversal loop touches them. |
| 54 | pub fn prefetch_batch(ranges: &[(*const u8, usize)]) { |
| 55 | for &(ptr, len) in ranges { |
| 56 | prefetch_pages(ptr, len); |
| 57 | } |
| 58 | } |
| 59 | |
| 60 | /// Hint the kernel that pages won't be needed soon (reverse of prefetch). |
| 61 | /// |
nothing calls this directly
no test coverage detected